├── .appveyor.yml ├── .github └── workflows │ └── main.yml ├── .gitignore ├── CMakeLists.txt ├── CMakeLists.txt.in ├── COPYING ├── COPYING.LESSER ├── README.md ├── cmake └── gtest_downloader.cmake ├── examples ├── CMakeLists.txt ├── hello_world.cpp ├── producer_consumer.cpp └── threaded_producer_consumer.cpp ├── lib ├── CMakeLists.txt ├── include │ └── hope │ │ ├── application.h │ │ ├── connection.h │ │ ├── event.h │ │ ├── eventloop.h │ │ ├── global.h │ │ ├── object.h │ │ ├── objectinvoker.h │ │ ├── private │ │ ├── atomicwrapper.h │ │ ├── indexsequence.h │ │ ├── objectdata.h │ │ ├── optional.h │ │ ├── queuedinvokationevent.h │ │ └── threaddata.h │ │ ├── signal.h │ │ ├── thread.h │ │ └── timer.h └── src │ ├── application.cpp │ ├── eventloop.cpp │ ├── object.cpp │ ├── private │ ├── objectdata.cpp │ └── threaddata.cpp │ ├── thread.cpp │ └── timer.cpp └── tests ├── CMakeLists.txt ├── helpers ├── applicationtesthelper.h └── eventlooptesthelper.h ├── main.cpp ├── test_application.cpp ├── test_objectinvoker.cpp ├── test_signal.cpp └── test_timer.cpp /.appveyor.yml: -------------------------------------------------------------------------------- 1 | clone_depth: 1 2 | 3 | build_script: 4 | - mkdir build 5 | - cd build 6 | - cmake .. -DCMAKE_BUILD_TYPE="Debug" -DENABLE_TEST=ON 7 | - cmake --build . 8 | 9 | test_script: 10 | - cd bin/Debug 11 | - hope-test.exe 12 | -------------------------------------------------------------------------------- /.github/workflows/main.yml: -------------------------------------------------------------------------------- 1 | name: CI 2 | 3 | on: [push] 4 | 5 | jobs: 6 | build: 7 | 8 | runs-on: ubuntu-latest 9 | 10 | steps: 11 | - uses: actions/checkout@v1 12 | - name: "Install lcov" 13 | run: sudo apt-get install -y lcov 14 | - name: "Create build dir" 15 | run: mkdir build 16 | - name: "Invoke cmake" 17 | working-directory: "build" 18 | run: cmake .. -DCMAKE_BUILD_TYPE=Debug -DENABLE_COVERAGE=ON -DENABLE_TEST=ON 19 | - name: "Build" 20 | working-directory: "build" 21 | run: cmake --build . 22 | - name: "Create baseline coverage" 23 | working-directory: "build" 24 | run: lcov --directory . --capture --initial --output-file coverage_base.info 25 | - name: "Invoke tests" 26 | working-directory: "build" 27 | run: "./bin/hope-test" 28 | - name: "Collect coverage" 29 | working-directory: "build" 30 | run: | 31 | lcov --directory . --capture --output-file coverage_test.info 32 | lcov --add-tracefile coverage_base.info --add-tracefile coverage_test.info --output-file coverage.info 33 | rm coverage_base.info 34 | rm coverage_test.info 35 | lcov --remove coverage.info "/usr/*" --output-file coverage.info 36 | lcov --remove coverage.info "*/build/*" --output-file coverage.info 37 | lcov --remove coverage.info "*/tests/*" --output-file coverage.info 38 | lcov --remove coverage.info "*/examples/*" --output-file coverage.info 39 | mv coverage.info .. 40 | rm -rf * 41 | mv ../coverage.info . 42 | - name: Upload coverage 43 | run: bash <(curl -s https://codecov.io/bash) -t ${{ secrets.CODECOV_TOKEN }} 44 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | CMakeCache.txt 2 | CMakeFiles 3 | CMakeScripts 4 | Testing 5 | Makefile 6 | cmake_install.cmake 7 | install_manifest.txt 8 | compile_commands.json 9 | CTestTestfile.cmake 10 | *.user 11 | *build* 12 | .idea 13 | *.orig -------------------------------------------------------------------------------- /CMakeLists.txt: -------------------------------------------------------------------------------- 1 | cmake_minimum_required(VERSION 3.2) 2 | 3 | include(cmake/gtest_downloader.cmake) 4 | 5 | project(HopeProject) 6 | 7 | # Add Test option 8 | option(ENABLE_TEST "Enable test" OFF) 9 | 10 | # Add Coverage option 11 | option(ENABLE_COVERAGE "Enable coverage" OFF) 12 | 13 | # Enable C++11 14 | set(CMAKE_CXX_STANDARD 11) 15 | 16 | # Add strict warning checking for C++ 17 | if (CMAKE_COMPILER_IS_GNUCC OR CMAKE_COMPILER_IS_GNUCXX) 18 | set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -Wall -Wno-long-long -pedantic") 19 | endif() 20 | 21 | # Set compiler options when coverage is enabled 22 | if (ENABLE_COVERAGE) 23 | message(STATUS "Enabling coverage") 24 | set(CMAKE_BUILD_TYPE Debug) 25 | set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -g -O0") 26 | set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} --coverage") 27 | endif() 28 | 29 | set(CMAKE_ARCHIVE_OUTPUT_DIRECTORY ${CMAKE_BINARY_DIR}/lib) 30 | set(CMAKE_LIBRARY_OUTPUT_DIRECTORY ${CMAKE_BINARY_DIR}/lib) 31 | set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${CMAKE_BINARY_DIR}/bin) 32 | 33 | add_subdirectory(lib) 34 | add_subdirectory(examples) 35 | if (ENABLE_TEST) 36 | download_and_build_gtest() 37 | add_subdirectory(tests) 38 | endif() 39 | -------------------------------------------------------------------------------- /CMakeLists.txt.in: -------------------------------------------------------------------------------- 1 | cmake_minimum_required(VERSION 2.8.2) 2 | 3 | project(googletest-download NONE) 4 | 5 | include(ExternalProject) 6 | ExternalProject_Add(googletest 7 | GIT_REPOSITORY https://github.com/google/googletest.git 8 | GIT_TAG master 9 | SOURCE_DIR "${CMAKE_BINARY_DIR}/googletest-src" 10 | BINARY_DIR "${CMAKE_BINARY_DIR}/googletest-build" 11 | CONFIGURE_COMMAND "" 12 | BUILD_COMMAND "" 13 | INSTALL_COMMAND "" 14 | TEST_COMMAND "" 15 | ) 16 | -------------------------------------------------------------------------------- /COPYING: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /COPYING.LESSER: -------------------------------------------------------------------------------- 1 | GNU LESSER GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | 9 | This version of the GNU Lesser General Public License incorporates 10 | the terms and conditions of version 3 of the GNU General Public 11 | License, supplemented by the additional permissions listed below. 12 | 13 | 0. Additional Definitions. 14 | 15 | As used herein, "this License" refers to version 3 of the GNU Lesser 16 | General Public License, and the "GNU GPL" refers to version 3 of the GNU 17 | General Public License. 18 | 19 | "The Library" refers to a covered work governed by this License, 20 | other than an Application or a Combined Work as defined below. 21 | 22 | An "Application" is any work that makes use of an interface provided 23 | by the Library, but which is not otherwise based on the Library. 24 | Defining a subclass of a class defined by the Library is deemed a mode 25 | of using an interface provided by the Library. 26 | 27 | A "Combined Work" is a work produced by combining or linking an 28 | Application with the Library. The particular version of the Library 29 | with which the Combined Work was made is also called the "Linked 30 | Version". 31 | 32 | The "Minimal Corresponding Source" for a Combined Work means the 33 | Corresponding Source for the Combined Work, excluding any source code 34 | for portions of the Combined Work that, considered in isolation, are 35 | based on the Application, and not on the Linked Version. 36 | 37 | The "Corresponding Application Code" for a Combined Work means the 38 | object code and/or source code for the Application, including any data 39 | and utility programs needed for reproducing the Combined Work from the 40 | Application, but excluding the System Libraries of the Combined Work. 41 | 42 | 1. Exception to Section 3 of the GNU GPL. 43 | 44 | You may convey a covered work under sections 3 and 4 of this License 45 | without being bound by section 3 of the GNU GPL. 46 | 47 | 2. Conveying Modified Versions. 48 | 49 | If you modify a copy of the Library, and, in your modifications, a 50 | facility refers to a function or data to be supplied by an Application 51 | that uses the facility (other than as an argument passed when the 52 | facility is invoked), then you may convey a copy of the modified 53 | version: 54 | 55 | a) under this License, provided that you make a good faith effort to 56 | ensure that, in the event an Application does not supply the 57 | function or data, the facility still operates, and performs 58 | whatever part of its purpose remains meaningful, or 59 | 60 | b) under the GNU GPL, with none of the additional permissions of 61 | this License applicable to that copy. 62 | 63 | 3. Object Code Incorporating Material from Library Header Files. 64 | 65 | The object code form of an Application may incorporate material from 66 | a header file that is part of the Library. You may convey such object 67 | code under terms of your choice, provided that, if the incorporated 68 | material is not limited to numerical parameters, data structure 69 | layouts and accessors, or small macros, inline functions and templates 70 | (ten or fewer lines in length), you do both of the following: 71 | 72 | a) Give prominent notice with each copy of the object code that the 73 | Library is used in it and that the Library and its use are 74 | covered by this License. 75 | 76 | b) Accompany the object code with a copy of the GNU GPL and this license 77 | document. 78 | 79 | 4. Combined Works. 80 | 81 | You may convey a Combined Work under terms of your choice that, 82 | taken together, effectively do not restrict modification of the 83 | portions of the Library contained in the Combined Work and reverse 84 | engineering for debugging such modifications, if you also do each of 85 | the following: 86 | 87 | a) Give prominent notice with each copy of the Combined Work that 88 | the Library is used in it and that the Library and its use are 89 | covered by this License. 90 | 91 | b) Accompany the Combined Work with a copy of the GNU GPL and this license 92 | document. 93 | 94 | c) For a Combined Work that displays copyright notices during 95 | execution, include the copyright notice for the Library among 96 | these notices, as well as a reference directing the user to the 97 | copies of the GNU GPL and this license document. 98 | 99 | d) Do one of the following: 100 | 101 | 0) Convey the Minimal Corresponding Source under the terms of this 102 | License, and the Corresponding Application Code in a form 103 | suitable for, and under terms that permit, the user to 104 | recombine or relink the Application with a modified version of 105 | the Linked Version to produce a modified Combined Work, in the 106 | manner specified by section 6 of the GNU GPL for conveying 107 | Corresponding Source. 108 | 109 | 1) Use a suitable shared library mechanism for linking with the 110 | Library. A suitable mechanism is one that (a) uses at run time 111 | a copy of the Library already present on the user's computer 112 | system, and (b) will operate properly with a modified version 113 | of the Library that is interface-compatible with the Linked 114 | Version. 115 | 116 | e) Provide Installation Information, but only if you would otherwise 117 | be required to provide such information under section 6 of the 118 | GNU GPL, and only to the extent that such information is 119 | necessary to install and execute a modified version of the 120 | Combined Work produced by recombining or relinking the 121 | Application with a modified version of the Linked Version. (If 122 | you use option 4d0, the Installation Information must accompany 123 | the Minimal Corresponding Source and Corresponding Application 124 | Code. If you use option 4d1, you must provide the Installation 125 | Information in the manner specified by section 6 of the GNU GPL 126 | for conveying Corresponding Source.) 127 | 128 | 5. Combined Libraries. 129 | 130 | You may place library facilities that are a work based on the 131 | Library side by side in a single library together with other library 132 | facilities that are not Applications and are not covered by this 133 | License, and convey such a combined library under terms of your 134 | choice, if you do both of the following: 135 | 136 | a) Accompany the combined library with a copy of the same work based 137 | on the Library, uncombined with any other library facilities, 138 | conveyed under the terms of this License. 139 | 140 | b) Give prominent notice with the combined library that part of it 141 | is a work based on the Library, and explaining where to find the 142 | accompanying uncombined form of the same work. 143 | 144 | 6. Revised Versions of the GNU Lesser General Public License. 145 | 146 | The Free Software Foundation may publish revised and/or new versions 147 | of the GNU Lesser General Public License from time to time. Such new 148 | versions will be similar in spirit to the present version, but may 149 | differ in detail to address new problems or concerns. 150 | 151 | Each version is given a distinguishing version number. If the 152 | Library as you received it specifies that a certain numbered version 153 | of the GNU Lesser General Public License "or any later version" 154 | applies to it, you have the option of following the terms and 155 | conditions either of that published version or of any later version 156 | published by the Free Software Foundation. If the Library as you 157 | received it does not specify a version number of the GNU Lesser 158 | General Public License, you may choose any version of the GNU Lesser 159 | General Public License ever published by the Free Software Foundation. 160 | 161 | If the Library as you received it specifies that a proxy can decide 162 | whether future versions of the GNU Lesser General Public License shall 163 | apply, that proxy's public statement of acceptance of any version is 164 | permanent authorization for you to choose that version for the 165 | Library. 166 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Hope 2 | ## A simple pure C++11 event loop with signals and slots 3 | [![Build Status](https://github.com/filcuc/hope/workflows/CI/badge.svg)](https://github.com/filcuc/hope/actions) 4 | [![Build status](https://ci.appveyor.com/api/projects/status/b2spyqd13op654j3/branch/master?svg=true)](https://ci.appveyor.com/project/filcuc/hope/branch/master) 5 | [![codecov](https://codecov.io/gh/filcuc/hope/branch/master/graph/badge.svg)](https://codecov.io/gh/filcuc/hope) 6 | 7 | 8 | ### Notes 9 | This project doesn't aim to become a general purpose library. 10 | It was done for fun and scratching my own itch. 11 | That said it can be useful for simple command line projects 12 | 13 | ### How it looks? 14 | ```C++ 15 | #include 16 | #include 17 | 18 | using namespace hope; 19 | 20 | class HelloWorldPrinter : public Object { 21 | public: 22 | void say_hello() { 23 | std::cout << "Hello World" << std::endl; 24 | } 25 | }; 26 | 27 | int main(int argc, char* argv[]) 28 | { 29 | Application app; 30 | 31 | HelloWorldPrinter printer; 32 | 33 | Timer timer; 34 | timer.set_duration(std::chrono::seconds(1)); 35 | timer.triggered().connect(&printer, &HelloWorldPrinter::say_hello); 36 | timer.triggered().connect(&app, &Application::quit); 37 | timer.start(); 38 | 39 | return app.exec(); 40 | } 41 | 42 | ``` 43 | 44 | ### Building 45 | The project require a working C++11 compiler 46 | ```Shell 47 | mkdir build 48 | cd build 49 | cmake .. 50 | cmake --build . 51 | ``` 52 | 53 | ### Installing 54 | Follow the build steps and simply execute 55 | ```Shell 56 | sudo make install 57 | ``` 58 | 59 | -------------------------------------------------------------------------------- /cmake/gtest_downloader.cmake: -------------------------------------------------------------------------------- 1 | macro(download_and_build_gtest) 2 | # Download and unpack googletest at configure time 3 | configure_file(CMakeLists.txt.in googletest-download/CMakeLists.txt) 4 | execute_process(COMMAND ${CMAKE_COMMAND} -G "${CMAKE_GENERATOR}" . 5 | RESULT_VARIABLE result 6 | WORKING_DIRECTORY ${CMAKE_BINARY_DIR}/googletest-download ) 7 | if (result) 8 | message(FATAL_ERROR "CMake step for googletest failed: ${result}") 9 | endif() 10 | execute_process(COMMAND ${CMAKE_COMMAND} --build . 11 | RESULT_VARIABLE result 12 | WORKING_DIRECTORY ${CMAKE_BINARY_DIR}/googletest-download ) 13 | 14 | if (result) 15 | message(FATAL_ERROR "Build step for googletest failed: ${result}") 16 | endif() 17 | 18 | # Prevent overriding the parent project's compiler/linker 19 | # settings on Windows 20 | set(gtest_force_shared_crt ON CACHE BOOL "" FORCE) 21 | 22 | # Add googletest directly to our build. This defines 23 | # the gtest and gtest_main targets. 24 | add_subdirectory(${CMAKE_BINARY_DIR}/googletest-src 25 | ${CMAKE_BINARY_DIR}/googletest-build 26 | EXCLUDE_FROM_ALL) 27 | 28 | # The gtest/gtest_main targets carry header search path 29 | # dependencies automatically when using CMake 2.8.11 or 30 | # later. Otherwise we have to add them here ourselves. 31 | if (CMAKE_VERSION VERSION_LESS 2.8.11) 32 | include_directories("${gtest_SOURCE_DIR}/include") 33 | endif() 34 | endmacro() 35 | -------------------------------------------------------------------------------- /examples/CMakeLists.txt: -------------------------------------------------------------------------------- 1 | set(TARGET_NAME hope-example) 2 | 3 | add_executable(hello_world hello_world.cpp) 4 | target_link_libraries(hello_world hope) 5 | include_directories(${CMAKE_SOURCE_DIR}/lib/include) 6 | target_compile_definitions(hello_world PRIVATE -DHOPE_USE_SHARED) 7 | 8 | add_executable(producer_consumer producer_consumer.cpp) 9 | target_link_libraries(producer_consumer hope) 10 | include_directories(${CMAKE_SOURCE_DIR}/lib/include) 11 | target_compile_definitions(producer_consumer PRIVATE -DHOPE_USE_SHARED) 12 | 13 | add_executable(threaded_producer_consumer threaded_producer_consumer.cpp) 14 | target_link_libraries(threaded_producer_consumer hope) 15 | include_directories(${CMAKE_SOURCE_DIR}/lib/include) 16 | target_compile_definitions(threaded_producer_consumer PRIVATE -DHOPE_USE_SHARED) 17 | -------------------------------------------------------------------------------- /examples/hello_world.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #include 21 | #include 22 | 23 | using namespace hope; 24 | 25 | class HelloWorldPrinter : public Object { 26 | public: 27 | void say_hello() { 28 | std::cout << "Hello World" << std::endl; 29 | } 30 | }; 31 | 32 | int main(int argc, char* argv[]) { 33 | Application app; 34 | 35 | HelloWorldPrinter printer; 36 | 37 | Timer timer; 38 | timer.set_duration(std::chrono::seconds(1)); 39 | timer.triggered().connect(&printer, &HelloWorldPrinter::say_hello); 40 | timer.triggered().connect(&app, &Application::quit); 41 | timer.start(); 42 | 43 | return app.exec(); 44 | } 45 | -------------------------------------------------------------------------------- /examples/producer_consumer.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #include 21 | #include 22 | 23 | #include 24 | 25 | using namespace hope; 26 | 27 | using Product = std::string; 28 | 29 | struct Producer : public Object { 30 | Producer() { 31 | m_timer.set_duration(std::chrono::seconds(1)); 32 | m_timer.triggered().connect(this, &Producer::on_triggered); 33 | } 34 | 35 | Signal<>& finished() { 36 | return m_finished_signal; 37 | } 38 | 39 | Signal& product_available() { 40 | return m_product_available_signal; 41 | } 42 | 43 | void produce() { 44 | m_timer.start(); 45 | } 46 | 47 | private: 48 | void on_triggered() { 49 | if (num_products != 5) { 50 | m_product_available_signal.emit("Product " + std::to_string(num_products++)); 51 | m_timer.start(); 52 | } else { 53 | m_finished_signal.emit(); 54 | } 55 | } 56 | 57 | Timer m_timer; 58 | Signal m_product_available_signal; 59 | Signal<> m_finished_signal; 60 | int num_products = 0; 61 | }; 62 | 63 | struct Consumer : public Object { 64 | void consume(Product product) { 65 | std::cout << "Consuming " << product << std::endl; 66 | } 67 | }; 68 | 69 | int main(int argc, char* argv[]) { 70 | Application app; 71 | 72 | Consumer consumer; 73 | 74 | Producer producer; 75 | producer.finished().connect(&app, &Application::quit); 76 | producer.product_available().connect(&consumer, &Consumer::consume); 77 | 78 | producer.produce(); 79 | 80 | return app.exec(); 81 | } 82 | -------------------------------------------------------------------------------- /examples/threaded_producer_consumer.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #include 21 | #include 22 | #include 23 | 24 | #include 25 | 26 | using namespace hope; 27 | 28 | using Product = std::string; 29 | 30 | struct Producer : public Object { 31 | Producer() { 32 | m_timer.set_duration(std::chrono::seconds(1)); 33 | m_timer.triggered().connect(this, &Producer::on_triggered); 34 | } 35 | 36 | Signal<>& finished() { 37 | return m_finished_signal; 38 | } 39 | 40 | Signal& product_available() { 41 | return m_product_available_signal; 42 | } 43 | 44 | void produce() { 45 | m_timer.start(); 46 | } 47 | 48 | private: 49 | void on_triggered() { 50 | if (num_products != 5) { 51 | auto product = "Product " + std::to_string(num_products++); 52 | std::cout << "Producing product " << product << " from thread " << std::this_thread::get_id() << std::endl; 53 | m_product_available_signal.emit(std::move(product)); 54 | m_timer.start(); 55 | } else { 56 | m_finished_signal.emit(); 57 | } 58 | } 59 | 60 | Timer m_timer; 61 | Signal m_product_available_signal; 62 | Signal<> m_finished_signal; 63 | int num_products = 0; 64 | }; 65 | 66 | struct Consumer : public Object { 67 | void consume(Product product) { 68 | std::cout << "Consuming " << product << " from thread " << std::this_thread::get_id() << std::endl; 69 | } 70 | }; 71 | 72 | int main(int argc, char* argv[]) { 73 | Application app; 74 | 75 | std::unique_ptr consumer (new Consumer()); 76 | 77 | Producer producer; 78 | producer.product_available().connect(consumer.get(), &Consumer::consume); 79 | producer.finished().connect(&app, &Application::quit); 80 | 81 | Thread consumer_thread; 82 | consumer_thread.start(); 83 | consumer_thread.move_to_thread(std::move(consumer)); 84 | 85 | producer.produce(); 86 | 87 | return app.exec(); 88 | } 89 | -------------------------------------------------------------------------------- /lib/CMakeLists.txt: -------------------------------------------------------------------------------- 1 | set(BASE_TARGET_NAME hope) 2 | 3 | set(TARGET_STATIC_NAME "${BASE_TARGET_NAME}Static") 4 | set(TARGET_SHARED_NAME "${BASE_TARGET_NAME}") 5 | 6 | set(TARGET_MAJOR 0) 7 | set(TARGET_MINOR 0) 8 | set(TARGET_PATCH 2) 9 | 10 | file(GLOB_RECURSE TARGET_SOURCES *.cpp) 11 | file(GLOB_RECURSE TARGET_HEADERS *.h) 12 | 13 | # COMMON LIBRARIES 14 | set(TARGET_LIBRARIES "") 15 | if (UNIX OR MINGW) 16 | list(APPEND TARGET_LIBRARIES pthread) 17 | endif() 18 | 19 | include_directories(include) 20 | 21 | # SHARED LIBRARY 22 | add_library(${TARGET_SHARED_NAME} SHARED ${TARGET_SOURCES} ${TARGET_HEADERS}) 23 | target_link_libraries(${TARGET_SHARED_NAME} ${TARGET_LIBRARIES}) 24 | set_target_properties(${TARGET_SHARED_NAME} PROPERTIES 25 | SOVERSION "${TARGET_MAJOR}.${TARGET_MINOR}" 26 | VERSION "${TARGET_MAJOR}.${TARGET_MINOR}.${TARGET_PATCH}" 27 | ) 28 | target_compile_definitions(${TARGET_SHARED_NAME} PRIVATE -DHOPE_USE_SHARED -DHOPE_EXPORT) 29 | 30 | # STATIC LIBRARY 31 | add_library(${TARGET_STATIC_NAME} STATIC ${TARGET_SOURCES} ${TARGET_HEADERS}) 32 | target_link_libraries(${TARGET_STATIC_NAME} ${TARGET_LIBRARIES}) 33 | target_compile_definitions(${TARGET_STATIC_NAME} PRIVATE -DHOPE_USE_STATIC) 34 | 35 | # INSTALL DIRECTIVES 36 | install(DIRECTORY include/hope DESTINATION include) 37 | install(TARGETS ${TARGET_STATIC_NAME} ${TARGET_SHARED_NAME} 38 | RUNTIME DESTINATION bin 39 | LIBRARY DESTINATION lib 40 | ARCHIVE DESTINATION lib 41 | ) 42 | -------------------------------------------------------------------------------- /lib/include/hope/application.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #pragma once 21 | 22 | #include 23 | #include 24 | #include 25 | 26 | namespace hope { 27 | 28 | namespace detail { class ObjectData; } 29 | namespace test { class ApplicationTestHelper; } 30 | 31 | class Application : public Object { 32 | public: 33 | HOPE_API Application(); 34 | HOPE_API ~Application() override; 35 | 36 | HOPE_API void quit(int exit_code); 37 | HOPE_API void quit() { quit(0); } 38 | 39 | HOPE_API int exec(); 40 | 41 | private: 42 | friend class test::ApplicationTestHelper; 43 | 44 | EventLoop m_event_loop; 45 | }; 46 | 47 | } 48 | -------------------------------------------------------------------------------- /lib/include/hope/connection.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #pragma once 21 | 22 | #include 23 | 24 | #include 25 | 26 | namespace hope { 27 | 28 | class Connection { 29 | public: 30 | Connection(std::int64_t id) 31 | : m_valid(true) 32 | , m_id(id) 33 | {} 34 | 35 | std::int64_t id() const { 36 | return m_id; 37 | } 38 | 39 | bool valid() const { 40 | return m_valid; 41 | } 42 | 43 | bool operator==(const Connection& other) const { 44 | return m_id == other.m_id; 45 | } 46 | 47 | bool operator<(const Connection& other) const { 48 | return m_id < other.m_id; 49 | } 50 | 51 | private: 52 | const bool m_valid = false; 53 | const std::int64_t m_id; 54 | }; 55 | 56 | 57 | } 58 | -------------------------------------------------------------------------------- /lib/include/hope/event.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #pragma once 21 | 22 | #include 23 | 24 | namespace hope { 25 | 26 | class HOPE_API Event { 27 | public: 28 | virtual ~Event() = default; 29 | }; 30 | 31 | } 32 | -------------------------------------------------------------------------------- /lib/include/hope/eventloop.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #pragma once 21 | 22 | #include 23 | #include 24 | #include 25 | #include 26 | 27 | #include 28 | #include 29 | #include 30 | #include 31 | #include 32 | #include 33 | #include 34 | 35 | namespace hope { 36 | 37 | namespace detail { class ObjectData; } 38 | namespace test { class EventLoopTestHelper; } 39 | 40 | class EventLoop : public Object { 41 | public: 42 | using Clock = std::chrono::steady_clock; 43 | using Mutex = std::mutex; 44 | using Locker = std::unique_lock; 45 | using TimePoint = std::chrono::time_point; 46 | 47 | HOPE_API EventLoop(); 48 | 49 | HOPE_API ~EventLoop() override; 50 | 51 | HOPE_API bool is_running() const; 52 | 53 | HOPE_API void push_event(std::shared_ptr event, TimePoint when = Clock::now()); 54 | HOPE_API void push_event(std::shared_ptr event, std::chrono::milliseconds duration, TimePoint offset = Clock::now()); 55 | 56 | HOPE_API void quit(int exit_code = 0); 57 | 58 | HOPE_API int exec(); 59 | 60 | HOPE_API void register_object(Object* object); 61 | 62 | HOPE_API void unregister_object(Object* object); 63 | 64 | HOPE_API void on_event(Event* event) final; 65 | 66 | private: 67 | friend class EventLoopTestHelper; 68 | 69 | int loop(); 70 | 71 | void process_events(const std::vector>& events); 72 | 73 | void cleanup_objects(); 74 | 75 | int m_exit_code = 0; 76 | bool m_exit = false; 77 | bool m_is_running = false; 78 | mutable Mutex m_mutex; 79 | mutable Mutex m_objects_mutex; 80 | std::condition_variable m_cond; 81 | std::multimap> m_events; 82 | std::map> m_objects; 83 | }; 84 | 85 | } 86 | -------------------------------------------------------------------------------- /lib/include/hope/global.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #pragma once 21 | 22 | #ifdef WIN32 23 | #if !defined(HOPE_USE_STATIC) && !defined(HOPE_USE_SHARED) 24 | #error "Specify if your building a static or dynamic library with HOPE_USE_STATIC or HOPE_USE_SHARED" 25 | #endif 26 | 27 | #ifdef HOPE_USE_STATIC 28 | #define HOPE_API 29 | #endif 30 | 31 | #ifdef HOPE_USE_SHARED 32 | #ifdef HOPE_EXPORT 33 | #define HOPE_API __declspec(dllexport) 34 | #else 35 | #define HOPE_API __declspec(dllimport) 36 | #endif 37 | #endif 38 | #else 39 | #define HOPE_API 40 | #endif -------------------------------------------------------------------------------- /lib/include/hope/object.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #pragma once 21 | 22 | #include 23 | 24 | #include 25 | #include 26 | 27 | namespace hope { 28 | 29 | class Event; 30 | class Thread; 31 | 32 | namespace detail { class ObjectData; } 33 | 34 | class Object { 35 | public: 36 | HOPE_API Object(); 37 | 38 | HOPE_API virtual ~Object(); 39 | 40 | HOPE_API void move_to_thread(Thread* thread); 41 | 42 | HOPE_API void move_to_thread(std::thread::id thread); 43 | 44 | HOPE_API virtual void on_event(Event* event); 45 | 46 | protected: 47 | HOPE_API Object(bool initialize); 48 | 49 | HOPE_API void initialize(); 50 | HOPE_API void terminate(); 51 | 52 | std::atomic m_initialized; 53 | std::atomic m_terminated; 54 | std::shared_ptr m_data; 55 | }; 56 | 57 | } 58 | -------------------------------------------------------------------------------- /lib/include/hope/objectinvoker.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #pragma once 21 | 22 | #include 23 | 24 | namespace hope { 25 | 26 | class ObjectInvoker { 27 | public: 28 | ObjectInvoker() = delete; 29 | 30 | template 31 | static void invoke(Object* obj, void(Object::*func)(Args... args), ConnectionType type, Args...args) { 32 | Signal signal; 33 | signal.connect(obj, func, type); 34 | signal.emit(args...); 35 | } 36 | }; 37 | 38 | } 39 | -------------------------------------------------------------------------------- /lib/include/hope/private/atomicwrapper.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #pragma once 21 | 22 | #include 23 | 24 | #include 25 | #include 26 | 27 | namespace hope { 28 | namespace detail { 29 | 30 | template 31 | class AtomicWrapper { 32 | public: 33 | AtomicWrapper() = default; 34 | 35 | AtomicWrapper(T&& t) 36 | : m_atomic(std::move(t)) 37 | {} 38 | 39 | AtomicWrapper(const AtomicWrapper& other) 40 | : m_atomic(other.m_atomic.load()) 41 | {} 42 | 43 | AtomicWrapper(AtomicWrapper&& other) noexcept = delete; 44 | 45 | AtomicWrapper& operator=(const AtomicWrapper& other) { 46 | if (&other != this) 47 | *this = AtomicWrapper(other); 48 | return *this; 49 | } 50 | 51 | AtomicWrapper& operator=(AtomicWrapper&& other) noexcept = delete; 52 | 53 | const std::atomic& value() const { 54 | return m_atomic; 55 | } 56 | 57 | std::atomic& value() { 58 | return m_atomic; 59 | } 60 | 61 | private: 62 | std::atomic m_atomic; 63 | }; 64 | 65 | } // namespace detail 66 | } // namespace hope 67 | -------------------------------------------------------------------------------- /lib/include/hope/private/indexsequence.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #pragma once 21 | 22 | #include 23 | 24 | namespace hope { 25 | namespace detail { 26 | 27 | template 28 | struct index_sequence { 29 | }; 30 | 31 | template 32 | struct index_sequence_builder { 33 | using result = typename index_sequence_builder < K - 1, K - 1, Remainder... >::result; 34 | }; 35 | 36 | template 37 | struct index_sequence_builder<0, Remainder...> { 38 | using result = index_sequence; 39 | }; 40 | 41 | template 42 | using make_index_sequence = typename index_sequence_builder::result; 43 | 44 | } 45 | } 46 | -------------------------------------------------------------------------------- /lib/include/hope/private/objectdata.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | 21 | #pragma once 22 | 23 | #include 24 | 25 | #include 26 | #include 27 | #include 28 | #include 29 | 30 | namespace hope { 31 | 32 | class Object; 33 | 34 | namespace detail { 35 | 36 | class ObjectData { 37 | public: 38 | ObjectData(std::thread::id id) 39 | : m_thread_id(std::move(id)) 40 | {} 41 | 42 | std::unique_lock lock() { 43 | return lock(*this); 44 | } 45 | 46 | static std::unique_lock lock(const std::shared_ptr& data) { 47 | return data ? lock(*data) : std::unique_lock(); 48 | } 49 | 50 | static std::unique_lock lock(ObjectData& data) { 51 | return std::unique_lock(data.m_mutex); 52 | } 53 | 54 | static std::pair, std::unique_lock> lock(const std::shared_ptr& first, 55 | const std::shared_ptr& second) { 56 | if (first && second) 57 | return lock(*first, *second); 58 | else if (first) 59 | return { lock(*first), std::unique_lock() }; 60 | else if (second) 61 | return { lock(*second), std::unique_lock() }; 62 | else 63 | return { std::unique_lock(), std::unique_lock() }; 64 | } 65 | 66 | static std::pair, std::unique_lock> lock(ObjectData& first, ObjectData& second) { 67 | ObjectData* first_address = &first; 68 | ObjectData* second_address = &second; 69 | if (first_address >= second_address) 70 | std::swap(first_address, second_address); 71 | std::unique_lock first_lock = lock(*first_address); 72 | std::unique_lock second_lock; 73 | if (first_address != second_address) 74 | second_lock = lock(*second_address); 75 | return {std::move(first_lock), std::move(second_lock)}; 76 | } 77 | 78 | std::thread::id m_thread_id; 79 | std::mutex m_mutex; 80 | }; 81 | 82 | class ObjectDataRegistry { 83 | public: 84 | HOPE_API static ObjectDataRegistry& instance(); 85 | 86 | ObjectDataRegistry(const ObjectDataRegistry&) = delete; 87 | ObjectDataRegistry(ObjectDataRegistry&&) = delete; 88 | ObjectDataRegistry& operator=(const ObjectDataRegistry&) = delete; 89 | ObjectDataRegistry& operator=(ObjectDataRegistry&&) = delete; 90 | 91 | HOPE_API std::weak_ptr data(Object* object) { 92 | auto it = m_data.find(object); 93 | return it != m_data.end() ? it->second : std::weak_ptr(); 94 | } 95 | 96 | HOPE_API void register_object_data(Object* object, const std::shared_ptr& data) { 97 | m_data.emplace(object, data); 98 | } 99 | 100 | HOPE_API void unregister_object_data(Object* object) { 101 | m_data.erase(object); 102 | } 103 | 104 | private: 105 | ObjectDataRegistry() = default; 106 | 107 | std::map> m_data; 108 | }; 109 | 110 | } 111 | } 112 | -------------------------------------------------------------------------------- /lib/include/hope/private/optional.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #pragma once 21 | 22 | namespace hope { 23 | namespace detail { 24 | 25 | /// Naive optional class until we decide to c++14 standard 26 | /// This works only for `T` that are default constructable and copiable 27 | template 28 | class Optional { 29 | public: 30 | Optional() 31 | : m_ok(false) { 32 | } 33 | 34 | Optional(T&& data) 35 | : m_ok(true) 36 | , m_data(std::move(data)) 37 | {} 38 | 39 | Optional(const T& data) 40 | : m_ok(true) 41 | , m_data(data) 42 | {} 43 | 44 | template 45 | Optional(Args&& ... args) 46 | : m_ok(true) 47 | , m_data(std::forward(args...)) 48 | {} 49 | 50 | Optional(const Optional&) = default; 51 | Optional(Optional&&) noexcept = default; 52 | Optional& operator=(const Optional&) = default; 53 | Optional& operator=(Optional&&) noexcept = default; 54 | 55 | Optional& operator=(const T& data) { 56 | m_ok = true; 57 | m_data = data; 58 | return *this; 59 | } 60 | 61 | Optional& operator=(T&& data) { 62 | m_ok = true; 63 | m_data = std::move(data); 64 | return *this; 65 | } 66 | 67 | void reset() { 68 | m_ok = false; 69 | } 70 | 71 | T& data() { 72 | return m_data; 73 | } 74 | 75 | const T& data() const { 76 | return m_data; 77 | } 78 | 79 | bool is_some() const { 80 | return m_ok; 81 | } 82 | 83 | bool is_none() const { 84 | return !m_ok; 85 | } 86 | 87 | operator T() { 88 | return m_data; 89 | } 90 | 91 | operator bool() { 92 | return m_ok; 93 | } 94 | 95 | T* operator->() { 96 | return m_ok ? &m_data : nullptr; 97 | } 98 | 99 | const T* operator->() const { 100 | return m_ok ? &m_data : nullptr; 101 | } 102 | 103 | bool operator==(const Optional& other) const { 104 | return m_ok == other.m_ok && m_data == other.m_data; 105 | } 106 | 107 | bool operator!=(const Optional& other) const { 108 | return !operator==(other); 109 | } 110 | 111 | private: 112 | bool m_ok = false; 113 | T m_data; 114 | }; 115 | 116 | } 117 | } 118 | -------------------------------------------------------------------------------- /lib/include/hope/private/queuedinvokationevent.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #pragma once 21 | 22 | #include 23 | #include 24 | #include 25 | 26 | #include 27 | #include 28 | 29 | namespace hope { 30 | 31 | class Object; 32 | 33 | class HOPE_API QueuedInvokationEventBase : public Event { 34 | public: 35 | virtual Object* object() = 0; 36 | virtual void invoke() = 0; 37 | virtual void wait() = 0; 38 | }; 39 | 40 | template 41 | class QueuedInvokation final : public QueuedInvokationEventBase { 42 | using ObjectFuncPtr = void(Object::* const)(Args...); 43 | using ObjectFuncArgs = std::tuple; 44 | 45 | public: 46 | QueuedInvokation(Object* object, 47 | ObjectFuncPtr object_func, 48 | Args...args) 49 | : m_object(object) 50 | , m_object_func(object_func) 51 | , m_object_func_args(std::move(args)...) 52 | {} 53 | 54 | QueuedInvokation() = default; 55 | QueuedInvokation(const QueuedInvokation&) = delete; 56 | QueuedInvokation(QueuedInvokation&&) noexcept = default; 57 | QueuedInvokation& operator=(const QueuedInvokation&) = delete; 58 | QueuedInvokation& operator=(QueuedInvokation&&) noexcept = default; 59 | 60 | Object* object() final { 61 | return m_object; 62 | } 63 | 64 | void invoke() final { 65 | invoke_impl(m_object_func_args); 66 | } 67 | 68 | void wait() final { 69 | std::unique_lock lock(m_mutex); 70 | m_cond.wait(lock, [this] { return m_executed; }); 71 | } 72 | 73 | template 74 | void invoke_impl(Tuple& a, hope::detail::index_sequence) { 75 | (m_object->*m_object_func)(std::move(std::get(a))...); 76 | set_executed(); 77 | } 78 | 79 | template> 80 | void invoke_impl(std::tuple& t) { 81 | invoke_impl(t, Indices{}); 82 | } 83 | 84 | void set_executed() { 85 | { 86 | std::lock_guard lock(m_mutex); 87 | m_executed = true; 88 | } 89 | m_cond.notify_all(); 90 | } 91 | 92 | Object* const m_object = nullptr; 93 | ObjectFuncPtr m_object_func = nullptr; 94 | ObjectFuncArgs m_object_func_args; 95 | std::mutex m_mutex; 96 | std::condition_variable m_cond; 97 | bool m_executed = false; 98 | }; 99 | 100 | template 101 | class HOPE_API QueuedInvokation final : public QueuedInvokationEventBase { 102 | using ObjectFuncPtr = void(Object::* const)(); 103 | public: 104 | QueuedInvokation(Object* object, 105 | ObjectFuncPtr object_func) 106 | : m_object(object) 107 | , m_object_func(object_func) 108 | {} 109 | 110 | QueuedInvokation() = default; 111 | QueuedInvokation(const QueuedInvokation&) = delete; 112 | QueuedInvokation(QueuedInvokation&&) noexcept = default; 113 | QueuedInvokation& operator=(const QueuedInvokation&) = delete; 114 | QueuedInvokation& operator=(QueuedInvokation&&) noexcept = default; 115 | 116 | Object* object() final { 117 | return m_object; 118 | } 119 | 120 | void invoke() final { 121 | (m_object->*m_object_func)(); 122 | set_executed(); 123 | } 124 | 125 | void wait() final { 126 | std::unique_lock lock(m_mutex); 127 | m_cond.wait(lock, [this] { return m_executed; }); 128 | } 129 | 130 | private: 131 | void set_executed() { 132 | { 133 | std::lock_guard lock(m_mutex); 134 | m_executed = true; 135 | } 136 | m_cond.notify_all(); 137 | } 138 | 139 | Object* const m_object = nullptr; 140 | ObjectFuncPtr m_object_func = nullptr; 141 | std::mutex m_mutex; 142 | std::condition_variable m_cond; 143 | bool m_executed = false; 144 | }; 145 | 146 | template 147 | std::shared_ptr> make_queued_invokation_event(Object* object, 148 | void(Object::*object_func)(Args...), 149 | Args...args) { 150 | return std::make_shared>(object, object_func, std::move(args)...); 151 | } 152 | 153 | template 154 | std::shared_ptr> make_queued_invokation_event(Object* object, 155 | void(Object::*object_func)()) { 156 | return std::make_shared>(object, object_func); 157 | } 158 | 159 | } 160 | -------------------------------------------------------------------------------- /lib/include/hope/private/threaddata.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #pragma once 21 | 22 | #include 23 | #include 24 | 25 | #include 26 | #include 27 | #include 28 | #include 29 | 30 | namespace hope { 31 | 32 | class EventLoop; 33 | 34 | class ThreadData { 35 | public: 36 | ThreadData() = default; 37 | 38 | ThreadData(std::thread::id id, EventLoop* event_loop) 39 | : m_id(id) 40 | , m_event_loop(event_loop) 41 | {} 42 | 43 | std::thread::id thread_id() const { 44 | return m_id; 45 | } 46 | 47 | void set_event_loop(EventLoop* event_loop) { 48 | std::lock_guard lock(m_mutex); 49 | m_event_loop = event_loop; 50 | } 51 | 52 | void register_object(Object* object) { 53 | std::lock_guard lock(m_mutex); 54 | if (m_event_loop) 55 | m_event_loop->register_object(object); 56 | else 57 | std::cerr << "No event event loop when registering object " << object << std::endl; 58 | } 59 | 60 | void unregister_object(Object* object) { 61 | std::lock_guard lock(m_mutex); 62 | if (m_event_loop) 63 | m_event_loop->unregister_object(object); 64 | else 65 | std::cerr << "No event event loop when unregistering object " << object << std::endl; 66 | } 67 | 68 | template 69 | void push_event(T... args) { 70 | std::lock_guard lock(m_mutex); 71 | if (m_event_loop) 72 | m_event_loop->push_event(std::forward(args)...); 73 | else 74 | std::cerr << "No event event loop when pushing event" << std::endl; 75 | } 76 | 77 | private: 78 | mutable std::mutex m_mutex; 79 | const std::thread::id m_id; 80 | EventLoop* m_event_loop = nullptr; 81 | }; 82 | 83 | class ThreadDataRegistry { 84 | public: 85 | HOPE_API static ThreadDataRegistry& instance(); 86 | 87 | HOPE_API std::shared_ptr thread_data(const std::thread::id& id) { 88 | std::lock_guard lock(m_mutex); 89 | auto it = m_registry.find(id); 90 | if (it == m_registry.end()) { 91 | it = m_registry.emplace(id, std::make_shared(id, nullptr)).first; 92 | } 93 | return it->second; 94 | } 95 | 96 | HOPE_API std::shared_ptr current_thread_data() { 97 | return thread_data(std::this_thread::get_id()); 98 | } 99 | 100 | private: 101 | ThreadDataRegistry() = default; 102 | 103 | mutable std::mutex m_mutex; 104 | mutable std::unordered_map> m_registry; 105 | }; 106 | 107 | } 108 | -------------------------------------------------------------------------------- /lib/include/hope/signal.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #pragma once 21 | 22 | #include 23 | #include 24 | #include 25 | #include 26 | 27 | #include 28 | 29 | #include 30 | #include 31 | #include 32 | #include 33 | #include 34 | 35 | namespace hope { 36 | 37 | enum class ConnectionType { 38 | Auto, Direct, Queued, QueuedBlocking 39 | }; 40 | 41 | namespace detail { 42 | 43 | template 44 | struct BaseInvoker { 45 | BaseInvoker() 46 | : m_valid(true) 47 | {} 48 | 49 | virtual ~BaseInvoker() = default; 50 | 51 | virtual void invoke(Args... args) const = 0; 52 | 53 | virtual const void* receiver_pointer() const = 0; 54 | virtual const void* receiver_func_pointer() const = 0; 55 | 56 | std::atomic m_valid; 57 | }; 58 | 59 | 60 | template 61 | struct Invoker final : public BaseInvoker { 62 | using ReceiverMemFunc = void(Receiver::*)(Args...); 63 | 64 | Invoker(Receiver* receiver, ReceiverMemFunc receiver_func, ConnectionType type) 65 | : m_receiver(receiver) 66 | , m_receiver_func(receiver_func) 67 | , m_type(type) 68 | {} 69 | 70 | void invoke(Args...args) const final { 71 | switch (m_type) { 72 | case ConnectionType::Auto: 73 | invoke_auto(std::move(args)...); 74 | break; 75 | case ConnectionType::Direct: 76 | invoke_direct(std::move(args)...); 77 | break; 78 | case ConnectionType::Queued: 79 | invoke_queued(std::move(args)...); 80 | break; 81 | case ConnectionType::QueuedBlocking: 82 | invoke_queued_blocking(std::move(args)...); 83 | break; 84 | } 85 | } 86 | 87 | void invoke_auto(Args...args) const { 88 | if (Optional thread_id = receiver_thread_id()) { 89 | if (std::this_thread::get_id() != thread_id) { 90 | invoke_queued(std::forward(args)...); 91 | } else { 92 | invoke_direct(std::forward(args)...); 93 | } 94 | } 95 | } 96 | 97 | void invoke_queued(Args...args) const { 98 | if (Optional thread_id = receiver_thread_id()) { 99 | auto event = make_queued_invokation_event(m_receiver, m_receiver_func, std::move(args)...); 100 | ThreadDataRegistry::instance().thread_data(thread_id)->push_event(std::move(event)); 101 | } 102 | } 103 | 104 | void invoke_queued_blocking(Args...args) const { 105 | if (Optional thread_id = receiver_thread_id()) { 106 | auto event = make_queued_invokation_event(m_receiver, m_receiver_func, std::move(args)...); 107 | ThreadDataRegistry::instance().thread_data(thread_id)->push_event(event); 108 | event->wait(); 109 | } 110 | } 111 | 112 | void invoke_direct(Args...args) const { 113 | if (is_receiver_alive()) { 114 | (m_receiver->*m_receiver_func)(std::move(args)...); 115 | } 116 | } 117 | 118 | const void* receiver_pointer() const final { 119 | return m_receiver; 120 | } 121 | 122 | const void* receiver_func_pointer() const final { 123 | return &m_receiver_func; 124 | } 125 | 126 | private: 127 | Optional receiver_thread_id() const { 128 | Optional result; 129 | if (auto data = ObjectDataRegistry::instance().data(m_receiver).lock()) { 130 | auto lock = ObjectData::lock(data); 131 | result = data->m_thread_id; 132 | } 133 | return result; 134 | } 135 | 136 | bool is_receiver_alive() const { 137 | return ObjectDataRegistry::instance().data(m_receiver).lock() != nullptr; 138 | } 139 | 140 | Receiver* const m_receiver = nullptr; 141 | const ReceiverMemFunc m_receiver_func = nullptr; 142 | const ConnectionType m_type; 143 | }; 144 | 145 | template 146 | std::shared_ptr> make_invoker(Receiver* receiver, void(Receiver::*func)(Args...), ConnectionType type) { 147 | return std::make_shared>(receiver, func, type); 148 | } 149 | 150 | } 151 | 152 | 153 | template 154 | class Signal { 155 | public: 156 | using SignalInvoker = std::shared_ptr>; 157 | 158 | Signal() = default; 159 | Signal(const Signal& other) = delete; 160 | Signal(Signal&& other) noexcept = default; 161 | Signal& operator=(const Signal& other) = delete; 162 | Signal& operator=(Signal&& other) noexcept = default; 163 | 164 | void emit(Args... args) { 165 | for (const auto& pair : objects()) { 166 | if (pair.second->m_valid) { 167 | pair.second->invoke(std::move(args)...); 168 | } 169 | } 170 | } 171 | 172 | template::value, int>::type = 0> 173 | Connection connect(Receiver* receiver, void(Receiver::*func)(Args...args), ConnectionType type = ConnectionType::Auto) { 174 | std::lock_guard lock(m_mutex); 175 | Connection result = get_next_connection_id(); 176 | m_objects.emplace(result, detail::make_invoker(receiver, func, type)); 177 | return result; 178 | } 179 | 180 | void disconnect(Connection c) { 181 | std::lock_guard lock(m_mutex); 182 | auto it = m_objects.find(c); 183 | if (it != m_objects.end()) { 184 | it->second->m_valid = false; 185 | m_objects.erase(it); 186 | } 187 | } 188 | 189 | template::value, int>::type = 0> 192 | void disconnect(Receiver* receiver, void(Receiver::*func)(Args...args)) { 193 | std::lock_guard lock(m_mutex); 194 | for (auto it = m_objects.begin(); it != m_objects.end(); ++it) { 195 | const SignalInvoker& invoker = it->second; 196 | auto it_func = static_cast(invoker->receiver_func_pointer()); 197 | if (invoker->receiver_pointer() == receiver && *it_func == func) { 198 | m_objects.erase(it); 199 | return; 200 | } 201 | } 202 | } 203 | 204 | private: 205 | std::map objects() const { 206 | std::lock_guard lock(m_mutex); 207 | return m_objects; 208 | } 209 | 210 | Connection get_next_connection_id() { 211 | return m_next_connection_id++; 212 | } 213 | 214 | mutable std::mutex m_mutex; 215 | std::map m_objects; 216 | int64_t m_next_connection_id = 0; 217 | }; 218 | 219 | } 220 | 221 | -------------------------------------------------------------------------------- /lib/include/hope/thread.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #pragma once 21 | 22 | #include 23 | 24 | #include 25 | #include 26 | #include 27 | 28 | namespace hope { 29 | 30 | class Object; 31 | class EventLoop; 32 | 33 | class Thread { 34 | public: 35 | HOPE_API Thread(); 36 | 37 | HOPE_API ~Thread(); 38 | 39 | HOPE_API std::thread::id id() const; 40 | 41 | HOPE_API void start(); 42 | 43 | HOPE_API void quit(); 44 | 45 | HOPE_API void wait(); 46 | 47 | HOPE_API void move_to_thread(std::unique_ptr obj); 48 | 49 | private: 50 | void exec(); 51 | 52 | enum class State { 53 | Starting, 54 | Started, 55 | Stopping, 56 | Stopped 57 | }; 58 | 59 | mutable std::mutex m_mutex; 60 | State m_state = State::Stopped; 61 | std::condition_variable m_cond; 62 | std::thread m_thread; 63 | std::unique_ptr m_event_loop = nullptr; 64 | std::vector> m_children; 65 | }; 66 | 67 | } 68 | -------------------------------------------------------------------------------- /lib/include/hope/timer.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #pragma once 21 | 22 | #include 23 | #include 24 | #include 25 | 26 | #include 27 | 28 | namespace hope { 29 | 30 | class Timer final : public Object { 31 | public: 32 | HOPE_API Timer(); 33 | 34 | HOPE_API ~Timer() override; 35 | 36 | HOPE_API std::chrono::milliseconds duration() const; 37 | 38 | HOPE_API void set_duration(std::chrono::milliseconds duration); 39 | 40 | HOPE_API Signal<>& triggered(); 41 | 42 | HOPE_API void start(); 43 | 44 | protected: 45 | void on_event(Event* event) final; 46 | 47 | private: 48 | std::chrono::milliseconds m_duration; 49 | Signal<> m_triggered; 50 | }; 51 | 52 | } 53 | -------------------------------------------------------------------------------- /lib/src/application.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #include 21 | 22 | #include 23 | #include 24 | #include 25 | 26 | using namespace hope; 27 | using namespace detail; 28 | 29 | Application::Application() 30 | : Object(false) { 31 | initialize(); 32 | } 33 | 34 | Application::~Application() { 35 | terminate(); 36 | } 37 | 38 | void Application::quit(int exit_code) { 39 | m_event_loop.quit(exit_code); 40 | } 41 | 42 | int Application::exec() { 43 | return m_event_loop.exec(); 44 | } 45 | -------------------------------------------------------------------------------- /lib/src/eventloop.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #include 21 | #include 22 | #include 23 | 24 | using namespace hope; 25 | using namespace detail; 26 | 27 | namespace { 28 | 29 | class RegisterEvent final : public Event { 30 | public: 31 | RegisterEvent(Object* object) 32 | : m_object(object) 33 | {} 34 | 35 | Object* m_object = nullptr; 36 | }; 37 | 38 | } 39 | 40 | EventLoop::EventLoop() 41 | : Object(false) { 42 | { 43 | auto lock = m_data->lock(); 44 | ThreadDataRegistry::instance().thread_data(m_data->m_thread_id)->set_event_loop(this); 45 | } 46 | initialize(); 47 | } 48 | 49 | EventLoop::~EventLoop() { 50 | terminate(); 51 | { 52 | auto lock = m_data->lock(); 53 | ThreadDataRegistry::instance().thread_data(m_data->m_thread_id)->set_event_loop(nullptr); 54 | } 55 | } 56 | 57 | bool EventLoop::is_running() const { 58 | Locker locker(m_mutex); 59 | return m_is_running; 60 | } 61 | 62 | void EventLoop::push_event(std::shared_ptr event, EventLoop::TimePoint when) { 63 | Locker lock(m_mutex); 64 | m_events.emplace(when, std::move(event)); 65 | m_cond.notify_one(); 66 | } 67 | 68 | void EventLoop::push_event(std::shared_ptr event, 69 | std::chrono::milliseconds duration, 70 | EventLoop::TimePoint offset) { 71 | Locker lock(m_mutex); 72 | m_events.emplace(offset + duration, std::move(event)); 73 | m_cond.notify_one(); 74 | } 75 | 76 | void EventLoop::quit(int exit_code) { 77 | Locker lock(m_mutex); 78 | m_exit = true; 79 | m_exit_code = exit_code; 80 | m_cond.notify_one(); 81 | } 82 | 83 | int EventLoop::exec() { 84 | return loop(); 85 | } 86 | 87 | void EventLoop::register_object(Object* object) { 88 | // We queued the connection in order to not receive already queued events 89 | // In other words the object will receive all the events after his registration 90 | std::unique_ptr event(new RegisterEvent(object)); 91 | push_event(std::move(event)); 92 | } 93 | 94 | void EventLoop::unregister_object(Object* object) { 95 | Locker lock(m_objects_mutex); 96 | auto it = m_objects.find(object); 97 | if (it != m_objects.end()) 98 | it->second.value() = false; 99 | } 100 | 101 | void EventLoop::on_event(Event* event) { 102 | if (auto registerEvent = dynamic_cast(event)) { 103 | Locker lock(m_objects_mutex); 104 | m_objects.emplace(registerEvent->m_object, true); 105 | } else { 106 | Object::on_event(event); 107 | } 108 | } 109 | 110 | int EventLoop::loop() { 111 | { 112 | Locker lock(m_mutex); 113 | m_is_running = true; 114 | } 115 | 116 | std::vector> events; 117 | 118 | while (true) { 119 | while (true) { 120 | Locker lock(m_mutex); 121 | if (m_exit) { 122 | m_is_running = false; 123 | return m_exit_code; 124 | } else if (m_events.empty()) { 125 | m_cond.wait(lock); 126 | } else { 127 | const TimePoint now = Clock::now(); 128 | while (!m_events.empty() && m_events.begin()->first <= now) { 129 | events.emplace_back(std::move(m_events.begin()->second)); 130 | m_events.erase(m_events.begin()); 131 | } 132 | if (!events.empty()) { 133 | break; 134 | } 135 | m_cond.wait_until(lock, m_events.begin()->first); 136 | } 137 | } 138 | 139 | // Process events 140 | process_events(events); 141 | 142 | // Remove objects "destroyed" from the map 143 | cleanup_objects(); 144 | 145 | events.clear(); 146 | } 147 | } 148 | 149 | void EventLoop::process_events(const std::vector > &events) { 150 | for (const std::shared_ptr& event : events) { 151 | // Event loop events are processed before anything else 152 | // because they can mutate the objects map thus 153 | // invalidating the iterators 154 | on_event(event.get()); 155 | 156 | // Evaluate all the other events 157 | for (const auto& object : m_objects) { 158 | if (object.second.value()) 159 | object.first->on_event(event.get()); 160 | } 161 | } 162 | } 163 | 164 | void EventLoop::cleanup_objects() { 165 | Locker lock(m_objects_mutex); 166 | for (auto it = m_objects.begin(); it != m_objects.end(); ) { 167 | if (!it->second.value()) { 168 | it = m_objects.erase(it); 169 | } else { 170 | ++it; 171 | } 172 | } 173 | } 174 | 175 | 176 | -------------------------------------------------------------------------------- /lib/src/object.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #include 21 | 22 | #include 23 | #include 24 | #include 25 | #include 26 | #include 27 | 28 | #include 29 | 30 | using namespace hope; 31 | using namespace detail; 32 | 33 | Object::Object(bool init) 34 | : m_initialized(false) 35 | , m_terminated(false) 36 | , m_data(std::make_shared(std::this_thread::get_id())) { 37 | if (init) 38 | initialize(); 39 | } 40 | 41 | Object::Object() 42 | : Object(true) { 43 | } 44 | 45 | void Object::initialize() { 46 | if (m_initialized.exchange(true)) 47 | return; 48 | ObjectDataRegistry::instance().register_object_data(this, m_data); 49 | { 50 | auto lock = m_data->lock(); 51 | ThreadDataRegistry::instance().thread_data(m_data->m_thread_id)->register_object(this); 52 | } 53 | } 54 | 55 | void Object::terminate() { 56 | if (m_terminated.exchange(true)) 57 | return; 58 | { 59 | auto lock = m_data->lock(); 60 | if (m_data->m_thread_id != std::this_thread::get_id()) { 61 | std::cerr << "Destroying an object from different thread" << std::endl; 62 | } 63 | ThreadDataRegistry::instance().thread_data(m_data->m_thread_id)->unregister_object(this); 64 | } 65 | ObjectDataRegistry::instance().unregister_object_data(this); 66 | } 67 | 68 | Object::~Object() { 69 | terminate(); 70 | } 71 | 72 | void Object::move_to_thread(Thread* thread) { 73 | if (!thread) { 74 | std::cerr << "Passing null pointer to move to thread" << std::endl; 75 | return; 76 | } 77 | move_to_thread(thread->id()); 78 | } 79 | 80 | void Object::move_to_thread(std::thread::id thread) { 81 | auto lock = m_data->lock(); 82 | ThreadDataRegistry::instance().thread_data(m_data->m_thread_id)->unregister_object(this); 83 | m_data->m_thread_id = thread; 84 | ThreadDataRegistry::instance().thread_data(m_data->m_thread_id)->register_object(this); 85 | } 86 | 87 | void Object::on_event(Event* event) { 88 | if (auto signal_event = dynamic_cast(event)) { 89 | if (signal_event->object() == this) { 90 | signal_event->invoke(); 91 | } 92 | } 93 | } 94 | -------------------------------------------------------------------------------- /lib/src/private/objectdata.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #include 21 | 22 | using namespace hope; 23 | using namespace detail; 24 | 25 | ObjectDataRegistry& ObjectDataRegistry::instance() { 26 | static ObjectDataRegistry instance; 27 | return instance; 28 | } 29 | -------------------------------------------------------------------------------- /lib/src/private/threaddata.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #include 21 | 22 | using namespace hope; 23 | 24 | ThreadDataRegistry& ThreadDataRegistry::instance() { 25 | static ThreadDataRegistry instance; 26 | return instance; 27 | } 28 | -------------------------------------------------------------------------------- /lib/src/thread.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #include 21 | 22 | #include 23 | #include 24 | 25 | #include 26 | #include 27 | #include 28 | 29 | using namespace hope; 30 | 31 | Thread::Thread() = default; 32 | 33 | Thread::~Thread() { 34 | quit(); 35 | wait(); 36 | } 37 | 38 | std::thread::id Thread::id() const { 39 | std::lock_guard lock(m_mutex); 40 | return m_thread.get_id(); 41 | } 42 | 43 | void Thread::start() { 44 | std::unique_lock lock(m_mutex); 45 | if (m_state == State::Started || m_state == State::Starting) { 46 | std::cerr << "Thread already started" << std::endl; 47 | return; 48 | } 49 | 50 | if (m_state == State::Stopping) { 51 | m_cond.wait(lock, [this] { return m_state == State::Stopped; }); 52 | } 53 | 54 | if (m_thread.joinable()) 55 | m_thread.join(); 56 | 57 | assert(m_state == State::Stopped); 58 | m_state = State::Starting; 59 | m_cond.notify_all(); 60 | 61 | m_thread = std::thread([this] { exec(); }); 62 | m_cond.wait(lock, [this] { return m_state == State::Started; }); 63 | assert(m_state == State::Started); 64 | } 65 | 66 | void Thread::quit() { 67 | std::unique_lock lock(m_mutex); 68 | if (m_state == State::Stopping || m_state == State::Stopped) 69 | return; 70 | 71 | if (m_state == State::Starting) { 72 | m_cond.wait(lock, [this] { return m_state == State::Started; }); 73 | } 74 | 75 | assert(m_state == State::Started); 76 | m_state = State::Stopping; 77 | m_cond.notify_all(); 78 | m_event_loop->quit(); 79 | } 80 | 81 | void Thread::wait() { 82 | std::unique_lock lock(m_mutex); 83 | if (m_state != State::Stopped) { 84 | m_cond.wait(lock, [this] { return m_state == State::Stopped; }); 85 | } 86 | 87 | if (m_thread.joinable()) 88 | m_thread.join(); 89 | } 90 | 91 | void Thread::move_to_thread(std::unique_ptr obj) { 92 | std::unique_lock lock(m_mutex); 93 | if (m_state == State::Stopping || m_state == State::Stopped) { 94 | std::cerr << "Trying to move and object to a thread that has not been started" << std::endl; 95 | } 96 | 97 | if (m_state == State::Starting) { 98 | m_cond.wait(lock, [this] { return m_state == State::Started; }); 99 | } 100 | 101 | obj->move_to_thread(m_thread.get_id()); 102 | assert(m_state == State::Started); 103 | m_children.push_back(std::move(obj)); 104 | } 105 | 106 | void Thread::exec() { 107 | { 108 | m_mutex.lock(); 109 | assert(m_state == State::Starting); 110 | m_event_loop.reset(new EventLoop()); 111 | m_state = State::Started; 112 | m_cond.notify_all(); 113 | m_mutex.unlock(); 114 | } 115 | 116 | m_event_loop->exec(); 117 | 118 | { 119 | m_mutex.lock(); 120 | assert(m_state == State::Stopping); 121 | m_children.clear(); 122 | m_event_loop.reset(); 123 | m_state = State::Stopped; 124 | m_cond.notify_all(); 125 | m_mutex.unlock(); 126 | } 127 | } 128 | -------------------------------------------------------------------------------- /lib/src/timer.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #include 21 | #include 22 | #include 23 | 24 | using namespace hope; 25 | 26 | struct TimerEvent final : public Event { 27 | public: 28 | TimerEvent(Timer* event); 29 | 30 | ~TimerEvent() override; 31 | 32 | Timer* m_timer = nullptr; 33 | }; 34 | 35 | TimerEvent::TimerEvent(Timer* event) 36 | : m_timer(event) 37 | {} 38 | 39 | TimerEvent::~TimerEvent() = default; 40 | 41 | Timer::Timer() 42 | : m_duration(std::chrono::milliseconds(0)) 43 | {} 44 | 45 | Timer::~Timer() = default; 46 | 47 | std::chrono::milliseconds Timer::duration() const { 48 | return m_duration; 49 | } 50 | 51 | void Timer::set_duration(std::chrono::milliseconds duration) { 52 | m_duration = duration; 53 | } 54 | 55 | Signal<>& Timer::triggered() { 56 | return m_triggered; 57 | } 58 | 59 | void Timer::start() { 60 | auto lock = m_data->lock(); 61 | ThreadDataRegistry::instance().thread_data(m_data->m_thread_id)->push_event(std::unique_ptr(new TimerEvent(this)), m_duration); 62 | } 63 | 64 | void Timer::on_event(Event* event) { 65 | if (auto timer_event = dynamic_cast(event)) { 66 | if (timer_event->m_timer == this) { 67 | m_triggered.emit(); 68 | } 69 | } else { 70 | Object::on_event(event); 71 | } 72 | } 73 | -------------------------------------------------------------------------------- /tests/CMakeLists.txt: -------------------------------------------------------------------------------- 1 | enable_testing() 2 | 3 | set(TARGET_NAME hope-test) 4 | 5 | add_executable(${TARGET_NAME} 6 | main.cpp 7 | test_application.cpp 8 | test_timer.cpp 9 | test_signal.cpp 10 | test_objectinvoker.cpp 11 | helpers/applicationtesthelper.h 12 | helpers/eventlooptesthelper.h 13 | ) 14 | 15 | target_link_libraries(${TARGET_NAME} hopeStatic gtest_main) 16 | include_directories(${CMAKE_SOURCE_DIR}/lib/include) 17 | target_compile_definitions(${TARGET_NAME} PRIVATE -DHOPE_USE_STATIC) 18 | 19 | if (UNIX) 20 | target_link_libraries(${TARGET_NAME} pthread) 21 | endif() 22 | 23 | add_test(AllTestsInFoo ${TARGET_NAME}) 24 | 25 | 26 | -------------------------------------------------------------------------------- /tests/helpers/applicationtesthelper.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #pragma once 21 | 22 | #include 23 | 24 | namespace hope { 25 | namespace test { 26 | 27 | class ApplicationTestHelper { 28 | public: 29 | static EventLoop& event_loop(Application& app) { 30 | return app.m_event_loop; 31 | } 32 | 33 | private: 34 | ApplicationTestHelper() = delete; 35 | }; 36 | 37 | } // namespace test 38 | } // namespace hope 39 | -------------------------------------------------------------------------------- /tests/helpers/eventlooptesthelper.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #pragma once 21 | 22 | #include 23 | 24 | namespace hope { 25 | namespace test { 26 | 27 | class EventLoopTestHelper { 28 | public: 29 | 30 | private: 31 | EventLoopTestHelper() = delete; 32 | }; 33 | 34 | } // namespace test 35 | } // namespace hope 36 | -------------------------------------------------------------------------------- /tests/main.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #include 21 | #include 22 | #include 23 | 24 | #include 25 | 26 | int main(int argc, char* argv[]) { 27 | ::testing::InitGoogleTest(&argc, argv); 28 | return RUN_ALL_TESTS(); 29 | } 30 | -------------------------------------------------------------------------------- /tests/test_application.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #include "helpers/applicationtesthelper.h" 21 | #include "helpers/eventlooptesthelper.h" 22 | 23 | #include 24 | 25 | using namespace hope; 26 | using namespace test; 27 | 28 | namespace { 29 | 30 | class ApplicationFixture : public ::testing::Test { 31 | protected: 32 | virtual void SetUp() { 33 | } 34 | 35 | std::mutex mutex; 36 | std::condition_variable cond; 37 | }; 38 | 39 | 40 | TEST_F(ApplicationFixture, CreationTest) { 41 | Application app; 42 | ASSERT_FALSE(ApplicationTestHelper::event_loop(app).is_running()); 43 | } 44 | 45 | TEST_F(ApplicationFixture, ExecTest) { 46 | std::unique_lock lock(mutex); 47 | 48 | Application* app = nullptr; 49 | 50 | std::thread t([&] { 51 | mutex.lock(); 52 | Application a; 53 | app = &a; 54 | cond.notify_one(); 55 | mutex.unlock(); 56 | a.exec(); 57 | }); 58 | 59 | cond.wait(lock, [&] { return app != nullptr; }); 60 | std::this_thread::sleep_for(std::chrono::seconds(1)); 61 | 62 | ASSERT_TRUE(ApplicationTestHelper::event_loop(*app).is_running()); 63 | 64 | app->quit(); 65 | t.join(); 66 | } 67 | 68 | TEST_F(ApplicationFixture, QuitTest) { 69 | std::unique_lock lock(mutex); 70 | 71 | Application* app = nullptr; 72 | int exit_code = -1; 73 | const int EXPECTED_EXIT_CODE = 40; 74 | 75 | std::thread t([&] { 76 | mutex.lock(); 77 | Application a; 78 | app = &a; 79 | cond.notify_one(); 80 | mutex.unlock(); 81 | exit_code = a.exec(); 82 | }); 83 | 84 | cond.wait(lock, [&] { return app != nullptr; }); 85 | std::this_thread::sleep_for(std::chrono::seconds(1)); 86 | 87 | ASSERT_TRUE(ApplicationTestHelper::event_loop(*app).is_running()); 88 | app->quit(EXPECTED_EXIT_CODE); 89 | t.join(); 90 | ASSERT_EQ(exit_code, EXPECTED_EXIT_CODE); 91 | } 92 | 93 | } 94 | -------------------------------------------------------------------------------- /tests/test_objectinvoker.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #include 21 | #include 22 | #include 23 | #include 24 | #include 25 | 26 | #include 27 | 28 | using namespace hope; 29 | 30 | namespace { 31 | 32 | class TestReceiver : public Object { 33 | public: 34 | TestReceiver() 35 | : num_calls(0) 36 | {} 37 | 38 | void test_receiver() { 39 | ++num_calls; 40 | } 41 | 42 | void test_receiver2(int value) { 43 | ++num_calls; 44 | last_value = value; 45 | } 46 | 47 | int num_calls = 0; 48 | int last_value = 0; 49 | }; 50 | 51 | 52 | class ObjectInvokerFixture : public ::testing::Test { 53 | protected: 54 | void SetUp() override { 55 | } 56 | }; 57 | 58 | TEST_F(ObjectInvokerFixture, TestAutoInvokation) { 59 | Application app; 60 | TestReceiver receiver; 61 | hope::ObjectInvoker::invoke(&receiver, &TestReceiver::test_receiver, ConnectionType::Auto); 62 | ASSERT_EQ(1, receiver.num_calls); 63 | } 64 | 65 | TEST_F(ObjectInvokerFixture, TestDirectInvokation) { 66 | Application app; 67 | TestReceiver receiver; 68 | hope::ObjectInvoker::invoke(&receiver, &TestReceiver::test_receiver, ConnectionType::Auto); 69 | ASSERT_EQ(1, receiver.num_calls); 70 | } 71 | 72 | TEST_F(ObjectInvokerFixture, TestQueuedInvokation) { 73 | Application app; 74 | TestReceiver receiver; 75 | hope::ObjectInvoker::invoke(&receiver, &TestReceiver::test_receiver, ConnectionType::Queued); 76 | hope::ObjectInvoker::invoke(&app, &Application::quit, ConnectionType::Queued); 77 | ASSERT_EQ(0, receiver.num_calls); 78 | app.exec(); 79 | ASSERT_EQ(1, receiver.num_calls); 80 | } 81 | 82 | TEST_F(ObjectInvokerFixture, TestQueuedBlockingInvokation) { 83 | Application app; 84 | 85 | auto receiver = new TestReceiver(); 86 | Thread t; 87 | t.start(); 88 | t.move_to_thread(std::unique_ptr(receiver)); 89 | 90 | ASSERT_EQ(0, receiver->num_calls); 91 | hope::ObjectInvoker::invoke(receiver, &TestReceiver::test_receiver, ConnectionType::QueuedBlocking); 92 | ASSERT_EQ(1, receiver->num_calls); 93 | t.quit(); 94 | t.wait(); 95 | } 96 | 97 | } 98 | 99 | -------------------------------------------------------------------------------- /tests/test_signal.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | #include 21 | #include 22 | #include 23 | #include 24 | 25 | #include 26 | 27 | using namespace hope; 28 | 29 | namespace { 30 | 31 | int num_calls = 0; 32 | int last_value = 0; 33 | 34 | class TestSender : public Object { 35 | public: 36 | Signal<>& test_signal() { 37 | return m_test_signal; 38 | } 39 | 40 | Signal& test_signal2() { 41 | return m_test_signal2; 42 | } 43 | 44 | private: 45 | Signal<> m_test_signal; 46 | Signal m_test_signal2; 47 | }; 48 | 49 | class TestReceiver : public Object { 50 | public: 51 | void test_receiver() { 52 | ++num_calls; 53 | } 54 | 55 | void test_receiver2(int value) { 56 | ++num_calls; 57 | last_value = value; 58 | } 59 | }; 60 | 61 | class SignalFixture : public ::testing::Test { 62 | protected: 63 | void SetUp() override { 64 | num_calls = 0; 65 | last_value = 0; 66 | } 67 | }; 68 | 69 | TEST_F(SignalFixture, TestSignalInvokationWithoutConnection) { 70 | Application app; 71 | TestSender sender; 72 | TestReceiver receiver; 73 | sender.test_signal().emit(); 74 | ASSERT_EQ(0, num_calls); 75 | } 76 | 77 | TEST_F(SignalFixture, TestDirectInvokation) { 78 | Application app; 79 | TestSender sender; 80 | TestReceiver receiver; 81 | sender.test_signal().connect(&receiver, &TestReceiver::test_receiver); 82 | sender.test_signal().emit(); 83 | ASSERT_EQ(1, num_calls); 84 | } 85 | 86 | TEST_F(SignalFixture, TestQueuedInvokation) { 87 | Application app; 88 | TestSender sender; 89 | auto receiver = new TestReceiver(); 90 | sender.test_signal().connect(receiver, &TestReceiver::test_receiver); 91 | Thread thread; 92 | thread.start(); 93 | thread.move_to_thread(std::unique_ptr(receiver)); 94 | sender.test_signal().emit(); 95 | std::this_thread::sleep_for(std::chrono::seconds(1)); 96 | ASSERT_EQ(1, num_calls); 97 | } 98 | 99 | TEST_F(SignalFixture, TestDirectInvokationWithIntSignal) { 100 | Application app; 101 | TestSender sender; 102 | TestReceiver receiver; 103 | sender.test_signal2().connect(&receiver, &TestReceiver::test_receiver2); 104 | sender.test_signal2().emit(30); 105 | ASSERT_EQ(1, num_calls); 106 | ASSERT_EQ(30, last_value); 107 | } 108 | 109 | TEST_F(SignalFixture, TestQueuedInvokationWithIntSignal) { 110 | Application app; 111 | TestSender sender; 112 | auto receiver = new TestReceiver(); 113 | sender.test_signal2().connect(receiver, &TestReceiver::test_receiver2); 114 | Thread thread; 115 | thread.start(); 116 | thread.move_to_thread(std::unique_ptr(receiver)); 117 | sender.test_signal2().emit(30); 118 | std::this_thread::sleep_for(std::chrono::seconds(1)); 119 | ASSERT_EQ(1, num_calls); 120 | ASSERT_EQ(30, last_value); 121 | } 122 | 123 | TEST_F(SignalFixture, TestDisconnectionWithConnection) { 124 | Application app; 125 | TestSender sender; 126 | TestReceiver receiver; 127 | auto connection = sender.test_signal().connect(&receiver, &TestReceiver::test_receiver); 128 | sender.test_signal().emit(); 129 | ASSERT_EQ(1, num_calls); 130 | sender.test_signal().disconnect(connection); 131 | sender.test_signal().emit(); 132 | ASSERT_EQ(1, num_calls); 133 | } 134 | 135 | TEST_F(SignalFixture, TestDisconnectionWithFunctionSignature) { 136 | Application app; 137 | TestSender sender; 138 | TestReceiver receiver; 139 | sender.test_signal().connect(&receiver, &TestReceiver::test_receiver); 140 | sender.test_signal().emit(); 141 | ASSERT_EQ(1, num_calls); 142 | sender.test_signal().disconnect(&receiver, &TestReceiver::test_receiver); 143 | sender.test_signal().emit(); 144 | ASSERT_EQ(1, num_calls); 145 | } 146 | 147 | TEST_F(SignalFixture, TestAutoDisconnectionOnDestroy) { 148 | Application app; 149 | TestSender sender; 150 | std::unique_ptr receiver(new TestReceiver()); 151 | sender.test_signal().connect(receiver.get(), &TestReceiver::test_receiver); 152 | sender.test_signal().emit(); 153 | ASSERT_EQ(1, num_calls); 154 | receiver.reset(); 155 | sender.test_signal().emit(); 156 | ASSERT_EQ(1, num_calls); 157 | } 158 | 159 | } 160 | -------------------------------------------------------------------------------- /tests/test_timer.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (C) 2018 Filippo Cucchetto. 3 | Contact: https://github.com/filcuc/hope 4 | 5 | This file is part of the Hope library. 6 | 7 | The Hope library is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU Lesser General Public License as published by 9 | the Free Software Foundation, either version 3 of the License. 10 | 11 | The Hope library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU Lesser General Public License for more details. 15 | 16 | You should have received a copy of the GNU Lesser General Public License 17 | along with the Hope library. If not, see . 18 | */ 19 | 20 | 21 | #include "helpers/applicationtesthelper.h" 22 | #include "helpers/eventlooptesthelper.h" 23 | 24 | #include 25 | 26 | #include 27 | 28 | using namespace hope; 29 | using namespace test; 30 | 31 | namespace { 32 | 33 | using Clock = std::chrono::steady_clock; 34 | using TimePoint = std::chrono::time_point; 35 | using Milliseconds = std::chrono::milliseconds; 36 | using Seconds = std::chrono::seconds; 37 | 38 | static TimePoint triggered_time; 39 | static bool triggered = false; 40 | 41 | class TestReceiver : public Object { 42 | public: 43 | void on_triggered() { 44 | triggered = true; 45 | triggered_time = Clock::now(); 46 | } 47 | }; 48 | 49 | class TimerFixture : public ::testing::Test { 50 | protected: 51 | void SetUp() override { 52 | app.reset(new Application()); 53 | triggered = false; 54 | } 55 | 56 | void TearDown() override { 57 | app.reset(); 58 | } 59 | 60 | std::unique_ptr app; 61 | }; 62 | 63 | TEST_F(TimerFixture, CreationTest) { 64 | Timer timer; 65 | } 66 | 67 | TEST_F(TimerFixture, DurationTest) { 68 | Timer timer; 69 | ASSERT_EQ(timer.duration(), Milliseconds(0)); 70 | } 71 | 72 | TEST_F(TimerFixture, SetDurationTest) { 73 | Timer timer; 74 | timer.set_duration(Milliseconds(4000)); 75 | ASSERT_EQ(timer.duration(), Milliseconds(4000)); 76 | } 77 | 78 | TEST_F(TimerFixture, TestTriggerSignal) { 79 | TestReceiver receiver; 80 | Timer timer; 81 | timer.set_duration(Milliseconds(1000)); 82 | timer.triggered().connect(&receiver, &TestReceiver::on_triggered); 83 | timer.triggered().connect(app.get(), &Application::quit); 84 | timer.start(); 85 | 86 | TimePoint start_time = Clock::now(); 87 | app->exec(); 88 | 89 | ASSERT_EQ(true, triggered); 90 | auto duration = std::chrono::duration_cast(triggered_time - start_time); 91 | ASSERT_GE(duration, Milliseconds(1000)); 92 | ASSERT_LT(duration, Milliseconds(2000)); 93 | } 94 | 95 | } 96 | 97 | 98 | 99 | --------------------------------------------------------------------------------