├── LICENSE ├── README-en.md ├── README.md ├── bin └── main ├── main.cpp ├── makefile ├── skiplist.h ├── store └── dumpFile ├── stress-test └── stress_test.cpp └── stress_test_start.sh /LICENSE: -------------------------------------------------------------------------------- 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 | -------------------------------------------------------------------------------- /README-en.md: -------------------------------------------------------------------------------- 1 | # Skiplist-CPP 2 | 3 | A tiny KV storage based on skiplist written in C++ language 4 | 5 | # interface 6 | 7 | * insertElement 8 | * deleteElement 9 | * searchElement 10 | * displayList 11 | * dumpFile 12 | * loadFile 13 | * size 14 | 15 | # performance data 16 | 17 | ## insert 18 | 19 | skiplist tree high:18 20 | insert random key 21 | 22 | |insert element num (w) | timecost (s) | 23 | |---|---| 24 | |10 |0.316763 | 25 | |50 |1.86778 | 26 | |100 |4.10648 | 27 | 28 | qps: 24.39w 29 | 30 | ## get 31 | 32 | |search element (w) |timecost (s) |skiplist size (w)| 33 | |---|---| --- | 34 | |10|0.47148 |10| 35 | |50|2.56373 |50| 36 | |100|5.43204 |100| 37 | 38 | qps:18.41w 39 | 40 | 41 | # code coverage report 42 | 43 | gtest and lcov 44 | 45 | [](file:///Users/sunxiuyang/Downloads/tmp/result/home/users/sunxiuyang/workspace/baidu/personal-code/sunxiuyang/index.html) 46 | 47 | how to getcoverage report 48 | 49 | ``` 50 | lcov -d . -t 'skiplist_test' -o 'skiplist_test.info' -b . -c 51 | 52 | genhtml -o result skiplist_test.info 53 | ``` 54 | 55 | # USAGE 56 | 57 | Just include skiplist.h in your code 58 | 59 | ``` 60 | make // complie demo main.cpp 61 | ./bin/main // run 62 | ``` 63 | 64 | Test performance data 65 | 66 | ``` 67 | sh stress_test_start.sh 68 | ``` 69 | 70 | 71 | # Todo 72 | 73 | * stress test is not auto 74 | 75 | # License 76 | 77 | This library is licensed under GPL-3.0 License. See LICENSE for details. 78 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | 👉 本项目为C++实现，想系统学习本项目，推荐 [卡码网【kv存储引擎-CPP】实战课](https://kamacoder.com/course.php?course_id=8) 2 | 👉 想了解Java版本，推荐 [卡码网【kv存储引擎-Java】实战课](https://kamacoder.com/course.php?course_id=9) 3 | 4 | > 版权申明： 本项目为我（[程序员Carl](https://github.com/youngyangyang04)）的原创。引用本项目文章请注明出处，例如：转自 https://github.com/youngyangyang04/Skiplist-CPP。 5 | > 发现恶意抄袭或搬运，会动用法律武器维护自己的权益。让我们一起维护一个良好的技术创作环境！ 6 | 7 | 8 | # [English Version](./README-en.md) 9 | 10 | # KV存储引擎 11 | 12 | 众所周知，非关系型数据库redis，以及levedb，rockdb其核心存储引擎的数据结构就是跳表。 13 | 14 | 本项目就是基于跳表实现的轻量级键值型存储引擎，使用C++实现。插入数据、删除数据、查询数据、数据展示、数据落盘、文件加载数据，以及数据库大小显示。 15 | 16 | 在随机写读情况下，该项目每秒可处理啊请求数（QPS）: 24.39w，每秒可处理读请求数（QPS）: 18.41w 17 | 18 | # 项目中文件 19 | 20 | * main.cpp 包含skiplist.h使用跳表进行数据操作 21 | * skiplist.h 跳表核心实现 22 | * README.md 中文介绍 23 | * README-en.md 英文介绍 24 | * bin 生成可执行文件目录 25 | * makefile 编译脚本 26 | * store 数据落盘的文件存放在这个文件夹 27 | * stress_test_start.sh 压力测试脚本 28 | * LICENSE 使用协议 29 | 30 | # 提供接口 31 | 32 | * insertElement（插入数据） 33 | * deleteElement（删除数据） 34 | * searchElement（查询数据） 35 | * displayList（展示已存数据） 36 | * dumpFile（数据落盘） 37 | * loadFile（加载数据） 38 | * size（返回数据规模） 39 | 40 | 41 | # 存储引擎数据表现 42 | 43 | ## 插入操作 44 | 45 | 跳表树高：18 46 | 47 | 采用随机插入数据测试： 48 | 49 | 50 | |插入数据规模（万条） |耗时（秒） | 51 | |---|---| 52 | |10 |0.316763 | 53 | |50 |1.86778 | 54 | |100 |4.10648 | 55 | 56 | 57 | 每秒可处理写请求数（QPS）: 24.39w 58 | 59 | ## 取数据操作 60 | 61 | |取数据规模（万条） |耗时（秒） | 62 | |---|---| 63 | |10|0.47148 |10| 64 | |50|2.56373 |50| 65 | |100|5.43204 |100| 66 | 67 | 每秒可处理读请求数（QPS）: 18.41w 68 | 69 | # 项目运行方式 70 | 71 | ``` 72 | make // complie demo main.cpp 73 | ./bin/main // run 74 | ``` 75 | 76 | 如果想自己写程序使用这个kv存储引擎，只需要在你的CPP文件中include skiplist.h 就可以了。 77 | 78 | 可以运行如下脚本测试kv存储引擎的性能（当然你可以根据自己的需求进行修改） 79 | 80 | ``` 81 | sh stress_test_start.sh 82 | ``` 83 | 84 | # 待优化 85 | 86 | * delete的时候没有释放内存 （我这里进行了优化，更改SkipList析构函数的代码，使得析构完全，还请各路大佬来指正） 87 | * 压力测试并不是全自动的 88 | * 跳表的key用int型，如果使用其他类型需要自定义比较函数，当然把这块抽象出来更好 89 | * 如果再加上一致性协议，例如raft就构成了分布式存储，再启动一个http server就可以对外提供分布式存储服务了 90 | 91 | # 关于作者 92 | 93 | 大家好，我是程序员Carl，[《代码随想录》](https://programmercarl.com/other/publish.html)作者，哈工大师兄，先后在腾讯和百度从事分布式技术研发。 94 | 95 | * [代码随想录网站](https://programmercarl.com) 96 | * [代码随想录Github](https://github.com/youngyangyang04/leetcode-master) 97 | * [代码随想录算法公开课](https://www.bilibili.com/video/BV1fA4y1o715) 98 | 99 | 100 | -------------------------------------------------------------------------------- /bin/main: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/youngyangyang04/Skiplist-CPP/8a79d6923a86e3420b4b89aaa1ea67a8ecfd241d/bin/main -------------------------------------------------------------------------------- /main.cpp: -------------------------------------------------------------------------------- 1 | /* ************************************************************************ 2 | > File Name: main.cpp 3 | > Author: 程序员Carl 4 | > 微信公众号: 代码随想录 5 | > Created Time: Sun Dec 2 20:21:41 2018 6 | > Description: 7 | ************************************************************************/ 8 | #include 9 | #include "skiplist.h" 10 | #define FILE_PATH "./store/dumpFile" 11 | 12 | int main() { 13 | 14 | // 键值中的key用int型，如果用其他类型，需要自定义比较函数 15 | // 而且如果修改key的类型，同时需要修改skipList.load_file函数 16 | SkipList skipList(6); 17 | skipList.insert_element(1, "学"); 18 | skipList.insert_element(3, "算法"); 19 | skipList.insert_element(7, "认准"); 20 | skipList.insert_element(8, "微信公众号：代码随想录"); 21 | skipList.insert_element(9, "学习"); 22 | skipList.insert_element(19, "算法不迷路"); 23 | skipList.insert_element(19, "赶快关注吧你会发现详见很晚！"); 24 | 25 | std::cout << "skipList size:" << skipList.size() << std::endl; 26 | 27 | skipList.dump_file(); 28 | 29 | // skipList.load_file(); 30 | 31 | skipList.search_element(9); 32 | skipList.search_element(18); 33 | 34 | 35 | skipList.display_list(); 36 | 37 | skipList.delete_element(3); 38 | skipList.delete_element(7); 39 | 40 | std::cout << "skipList size:" << skipList.size() << std::endl; 41 | 42 | skipList.display_list(); 43 | } 44 | -------------------------------------------------------------------------------- /makefile: -------------------------------------------------------------------------------- 1 | CC=g++ 2 | CXXFLAGS = -std=c++0x 3 | CFLAGS=-I 4 | skiplist: main.o 5 | $(CC) -o ./bin/main main.o --std=c++11 -pthread 6 | rm -f ./*.o 7 | 8 | clean: 9 | rm -f ./*.o 10 | -------------------------------------------------------------------------------- /skiplist.h: -------------------------------------------------------------------------------- 1 | /* ************************************************************************ 2 | > File Name: skiplist.h 3 | > Author: 程序员Carl 4 | > 微信公众号: 代码随想录 5 | > Created Time: Sun Dec 2 19:04:26 2018 6 | > Description: 7 | ************************************************************************/ 8 | 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | 16 | #define STORE_FILE "store/dumpFile" 17 | 18 | std::mutex mtx; // mutex for critical section 19 | std::string delimiter = ":"; 20 | 21 | //Class template to implement node 22 | template 23 | class Node { 24 | 25 | public: 26 | 27 | Node() {} 28 | 29 | Node(K k, V v, int); 30 | 31 | ~Node(); 32 | 33 | K get_key() const; 34 | 35 | V get_value() const; 36 | 37 | void set_value(V); 38 | 39 | // Linear array to hold pointers to next node of different level 40 | Node **forward; 41 | 42 | int node_level; 43 | 44 | private: 45 | K key; 46 | V value; 47 | }; 48 | 49 | template 50 | Node::Node(const K k, const V v, int level) { 51 | this->key = k; 52 | this->value = v; 53 | this->node_level = level; 54 | 55 | // level + 1, because array index is from 0 - level 56 | this->forward = new Node*[level+1]; 57 | 58 | // Fill forward array with 0(NULL) 59 | memset(this->forward, 0, sizeof(Node*)*(level+1)); 60 | }; 61 | 62 | template 63 | Node::~Node() { 64 | delete []forward; 65 | }; 66 | 67 | template 68 | K Node::get_key() const { 69 | return key; 70 | }; 71 | 72 | template 73 | V Node::get_value() const { 74 | return value; 75 | }; 76 | template 77 | void Node::set_value(V value) { 78 | this->value=value; 79 | }; 80 | 81 | // Class template for Skip list 82 | template 83 | class SkipList { 84 | 85 | public: 86 | SkipList(int); 87 | ~SkipList(); 88 | int get_random_level(); 89 | Node* create_node(K, V, int); 90 | int insert_element(K, V); 91 | void display_list(); 92 | bool search_element(K); 93 | void delete_element(K); 94 | void dump_file(); 95 | void load_file(); 96 | //递归删除节点 97 | void clear(Node*); 98 | int size(); 99 | 100 | private: 101 | void get_key_value_from_string(const std::string& str, std::string* key, std::string* value); 102 | bool is_valid_string(const std::string& str); 103 | 104 | private: 105 | // Maximum level of the skip list 106 | int _max_level; 107 | 108 | // current level of skip list 109 | int _skip_list_level; 110 | 111 | // pointer to header node 112 | Node *_header; 113 | 114 | // file operator 115 | std::ofstream _file_writer; 116 | std::ifstream _file_reader; 117 | 118 | // skiplist current element count 119 | int _element_count; 120 | }; 121 | 122 | // create new node 123 | template 124 | Node* SkipList::create_node(const K k, const V v, int level) { 125 | Node *n = new Node(k, v, level); 126 | return n; 127 | } 128 | 129 | // Insert given key and value in skip list 130 | // return 1 means element exists 131 | // return 0 means insert successfully 132 | /* 133 | +------------+ 134 | | insert 50 | 135 | +------------+ 136 | level 4 +-->1+ 100 137 | | 138 | | insert +----+ 139 | level 3 1+-------->10+---------------> | 50 | 70 100 140 | | | 141 | | | 142 | level 2 1 10 30 | 50 | 70 100 143 | | | 144 | | | 145 | level 1 1 4 10 30 | 50 | 70 100 146 | | | 147 | | | 148 | level 0 1 4 9 10 30 40 | 50 | 60 70 100 149 | +----+ 150 | 151 | */ 152 | template 153 | int SkipList::insert_element(const K key, const V value) { 154 | 155 | mtx.lock(); 156 | Node *current = this->_header; 157 | 158 | // create update array and initialize it 159 | // update is array which put node that the node->forward[i] should be operated later 160 | Node *update[_max_level+1]; 161 | memset(update, 0, sizeof(Node*)*(_max_level+1)); 162 | 163 | // start form highest level of skip list 164 | for(int i = _skip_list_level; i >= 0; i--) { 165 | while(current->forward[i] != NULL && current->forward[i]->get_key() < key) { 166 | current = current->forward[i]; 167 | } 168 | update[i] = current; 169 | } 170 | 171 | // reached level 0 and forward pointer to right node, which is desired to insert key. 172 | current = current->forward[0]; 173 | 174 | // if current node have key equal to searched key, we get it 175 | if (current != NULL && current->get_key() == key) { 176 | std::cout << "key: " << key << ", exists" << std::endl; 177 | mtx.unlock(); 178 | return 1; 179 | } 180 | 181 | // if current is NULL that means we have reached to end of the level 182 | // if current's key is not equal to key that means we have to insert node between update[0] and current node 183 | if (current == NULL || current->get_key() != key ) { 184 | 185 | // Generate a random level for node 186 | int random_level = get_random_level(); 187 | 188 | // If random level is greater thar skip list's current level, initialize update value with pointer to header 189 | if (random_level > _skip_list_level) { 190 | for (int i = _skip_list_level+1; i < random_level+1; i++) { 191 | update[i] = _header; 192 | } 193 | _skip_list_level = random_level; 194 | } 195 | 196 | // create new node with random level generated 197 | Node* inserted_node = create_node(key, value, random_level); 198 | 199 | // insert node 200 | for (int i = 0; i <= random_level; i++) { 201 | inserted_node->forward[i] = update[i]->forward[i]; 202 | update[i]->forward[i] = inserted_node; 203 | } 204 | std::cout << "Successfully inserted key:" << key << ", value:" << value << std::endl; 205 | _element_count ++; 206 | } 207 | mtx.unlock(); 208 | return 0; 209 | } 210 | 211 | // Display skip list 212 | template 213 | void SkipList::display_list() { 214 | 215 | std::cout << "\n*****Skip List*****"<<"\n"; 216 | for (int i = 0; i <= _skip_list_level; i++) { 217 | Node *node = this->_header->forward[i]; 218 | std::cout << "Level " << i << ": "; 219 | while (node != NULL) { 220 | std::cout << node->get_key() << ":" << node->get_value() << ";"; 221 | node = node->forward[i]; 222 | } 223 | std::cout << std::endl; 224 | } 225 | } 226 | 227 | // Dump data in memory to file 228 | template 229 | void SkipList::dump_file() { 230 | 231 | std::cout << "dump_file-----------------" << std::endl; 232 | _file_writer.open(STORE_FILE); 233 | Node *node = this->_header->forward[0]; 234 | 235 | while (node != NULL) { 236 | _file_writer << node->get_key() << ":" << node->get_value() << "\n"; 237 | std::cout << node->get_key() << ":" << node->get_value() << ";\n"; 238 | node = node->forward[0]; 239 | } 240 | 241 | _file_writer.flush(); 242 | _file_writer.close(); 243 | return ; 244 | } 245 | 246 | // Load data from disk 247 | template 248 | void SkipList::load_file() { 249 | 250 | _file_reader.open(STORE_FILE); 251 | std::cout << "load_file-----------------" << std::endl; 252 | std::string line; 253 | std::string* key = new std::string(); 254 | std::string* value = new std::string(); 255 | while (getline(_file_reader, line)) { 256 | get_key_value_from_string(line, key, value); 257 | if (key->empty() || value->empty()) { 258 | continue; 259 | } 260 | // Define key as int type 261 | insert_element(stoi(*key), *value); 262 | std::cout << "key:" << *key << "value:" << *value << std::endl; 263 | } 264 | delete key; 265 | delete value; 266 | _file_reader.close(); 267 | } 268 | 269 | // Get current SkipList size 270 | template 271 | int SkipList::size() { 272 | return _element_count; 273 | } 274 | 275 | template 276 | void SkipList::get_key_value_from_string(const std::string& str, std::string* key, std::string* value) { 277 | 278 | if(!is_valid_string(str)) { 279 | return; 280 | } 281 | *key = str.substr(0, str.find(delimiter)); 282 | *value = str.substr(str.find(delimiter)+1, str.length()); 283 | } 284 | 285 | template 286 | bool SkipList::is_valid_string(const std::string& str) { 287 | 288 | if (str.empty()) { 289 | return false; 290 | } 291 | if (str.find(delimiter) == std::string::npos) { 292 | return false; 293 | } 294 | return true; 295 | } 296 | 297 | // Delete element from skip list 298 | template 299 | void SkipList::delete_element(K key) { 300 | 301 | mtx.lock(); 302 | Node *current = this->_header; 303 | Node *update[_max_level+1]; 304 | memset(update, 0, sizeof(Node*)*(_max_level+1)); 305 | 306 | // start from highest level of skip list 307 | for (int i = _skip_list_level; i >= 0; i--) { 308 | while (current->forward[i] !=NULL && current->forward[i]->get_key() < key) { 309 | current = current->forward[i]; 310 | } 311 | update[i] = current; 312 | } 313 | 314 | current = current->forward[0]; 315 | if (current != NULL && current->get_key() == key) { 316 | 317 | // start for lowest level and delete the current node of each level 318 | for (int i = 0; i <= _skip_list_level; i++) { 319 | 320 | // if at level i, next node is not target node, break the loop. 321 | if (update[i]->forward[i] != current) 322 | break; 323 | 324 | update[i]->forward[i] = current->forward[i]; 325 | } 326 | 327 | // Remove levels which have no elements 328 | while (_skip_list_level > 0 && _header->forward[_skip_list_level] == 0) { 329 | _skip_list_level --; 330 | } 331 | 332 | std::cout << "Successfully deleted key "<< key << std::endl; 333 | delete current; 334 | _element_count --; 335 | } 336 | mtx.unlock(); 337 | return; 338 | } 339 | 340 | // Search for element in skip list 341 | /* 342 | +------------+ 343 | | select 60 | 344 | +------------+ 345 | level 4 +-->1+ 100 346 | | 347 | | 348 | level 3 1+-------->10+------------------>50+ 70 100 349 | | 350 | | 351 | level 2 1 10 30 50| 70 100 352 | | 353 | | 354 | level 1 1 4 10 30 50| 70 100 355 | | 356 | | 357 | level 0 1 4 9 10 30 40 50+-->60 70 100 358 | */ 359 | template 360 | bool SkipList::search_element(K key) { 361 | 362 | std::cout << "search_element-----------------" << std::endl; 363 | Node *current = _header; 364 | 365 | // start from highest level of skip list 366 | for (int i = _skip_list_level; i >= 0; i--) { 367 | while (current->forward[i] && current->forward[i]->get_key() < key) { 368 | current = current->forward[i]; 369 | } 370 | } 371 | 372 | //reached level 0 and advance pointer to right node, which we search 373 | current = current->forward[0]; 374 | 375 | // if current node have key equal to searched key, we get it 376 | if (current and current->get_key() == key) { 377 | std::cout << "Found key: " << key << ", value: " << current->get_value() << std::endl; 378 | return true; 379 | } 380 | 381 | std::cout << "Not Found Key:" << key << std::endl; 382 | return false; 383 | } 384 | 385 | // construct skip list 386 | template 387 | SkipList::SkipList(int max_level) { 388 | 389 | this->_max_level = max_level; 390 | this->_skip_list_level = 0; 391 | this->_element_count = 0; 392 | 393 | // create header node and initialize key and value to null 394 | K k; 395 | V v; 396 | this->_header = new Node(k, v, _max_level); 397 | }; 398 | 399 | template 400 | SkipList::~SkipList() { 401 | 402 | if (_file_writer.is_open()) { 403 | _file_writer.close(); 404 | } 405 | if (_file_reader.is_open()) { 406 | _file_reader.close(); 407 | } 408 | 409 | //递归删除跳表链条 410 | if(_header->forward[0]!=nullptr){ 411 | clear(_header->forward[0]); 412 | } 413 | delete(_header); 414 | 415 | } 416 | template 417 | void SkipList::clear(Node * cur) 418 | { 419 | if(cur->forward[0]!=nullptr){ 420 | clear(cur->forward[0]); 421 | } 422 | delete(cur); 423 | } 424 | 425 | template 426 | int SkipList::get_random_level(){ 427 | 428 | int k = 1; 429 | while (rand() % 2) { 430 | k++; 431 | } 432 | k = (k < _max_level) ? k : _max_level; 433 | return k; 434 | }; 435 | // vim: et tw=100 ts=4 sw=4 cc=120 436 | -------------------------------------------------------------------------------- /store/dumpFile: -------------------------------------------------------------------------------- 1 | 1:a; 2 | 19:yang; 3 | 3:b; 4 | 7:c; 5 | 8:sun; 6 | 9:xiu; 7 | -------------------------------------------------------------------------------- /stress-test/stress_test.cpp: -------------------------------------------------------------------------------- 1 | /* ************************************************************************ 2 | > File Name: stress_test.cpp 3 | > Author: 程序员Carl 4 | > 微信公众号: 代码随想录 5 | > Created Time: Sun 16 Dec 2018 11:56:04 AM CST 6 | > Description: 7 | ************************************************************************/ 8 | 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include "../skiplist.h" 15 | 16 | #define NUM_THREADS 1 17 | #define TEST_COUNT 100000 18 | SkipList skipList(18); 19 | 20 | void *insertElement(void* threadid) { 21 | long tid; 22 | tid = (long)threadid; 23 | std::cout << tid << std::endl; 24 | int tmp = TEST_COUNT/NUM_THREADS; 25 | for (int i=tid*tmp, count=0; count elapsed = finish - start; 73 | std::cout << "insert elapsed:" << elapsed.count() << std::endl; 74 | } 75 | // skipList.displayList(); 76 | 77 | // { 78 | // pthread_t threads[NUM_THREADS]; 79 | // int rc; 80 | // int i; 81 | // auto start = std::chrono::high_resolution_clock::now(); 82 | 83 | // for( i = 0; i < NUM_THREADS; i++ ) { 84 | // std::cout << "main() : creating thread, " << i << std::endl; 85 | // rc = pthread_create(&threads[i], NULL, getElement, (void *)i); 86 | 87 | // if (rc) { 88 | // std::cout << "Error:unable to create thread," << rc << std::endl; 89 | // exit(-1); 90 | // } 91 | // } 92 | 93 | // void *ret; 94 | // for( i = 0; i < NUM_THREADS; i++ ) { 95 | // if (pthread_join(threads[i], &ret) !=0 ) { 96 | // perror("pthread_create() error"); 97 | // exit(3); 98 | // } 99 | // } 100 | 101 | // auto finish = std::chrono::high_resolution_clock::now(); 102 | // std::chrono::duration elapsed = finish - start; 103 | // std::cout << "get elapsed:" << elapsed.count() << std::endl; 104 | // } 105 | 106 | pthread_exit(NULL); 107 | return 0; 108 | 109 | } 110 | -------------------------------------------------------------------------------- /stress_test_start.sh: -------------------------------------------------------------------------------- 1 | ######################################################################### 2 | # File Name: stress_test_start.sh 3 | # Author: 程序员Carl 4 | # 微信公众号: 代码随想录 5 | # Created Time: Wed Jan 30 20:05:15 2019 6 | ######################################################################### 7 | #!/bin/bash 8 | g++ stress-test/stress_test.cpp -o ./bin/stress --std=c++11 -pthread 9 | ./bin/stress 10 | --------------------------------------------------------------------------------