├── LICENSE ├── README.md ├── Release ├── suCLX.dll └── tdxCL.dll ├── src ├── Main.cpp ├── Main.h ├── StdAfx.cpp ├── StdAfx.h ├── tdxCL.cpp └── tdxCL.h ├── tdxCL.dsp └── tdxCL.dsw /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.md: -------------------------------------------------------------------------------- 1 | # tdxCL 2 | 精簡版ChanlunX，筆、段、中樞。 3 | for：通達信和大智慧 4 | 5 | 通達信版說明： 6 | https://www.55188.com/thread-9524243-1-1.html 7 | 8 | 大智慧版說明： 9 | https://www.55188.com/thread-9555831-1-1.html 10 | 11 | #編譯# 12 | ``` 13 | VC6.0即可。 14 | ``` 15 | 16 | #安裝# 17 | ``` 18 | 通達信： 19 | 1 編譯好的dll，即tdxCL.dll，放在通達信安裝目錄下的T0002/dlls下。 20 | 2 綁定dll到5號（其實幾號都可以，公式裡要做相應的更改即可）。 21 | 3 Ctrl-F打開公式管理器，按下面的公式創建公式。 22 | 4 。。。開始使用公式～ 23 | 24 | 大智慧： 25 | 1 編譯好的dll，即tdxCL.dll，直接放在大智慧的安裝目錄下。 26 | 2 打開公式管理，添加公式。 27 | ``` 28 | 29 | #通達信公式# 30 | ``` 31 | #TDX Formula# 32 | {画笔} 33 | FRAC:=TDXDLL5(6,0,H,L); 34 | DRAWLINE(FRAC=-1,L,FRAC=+1,H,0), DOTLINE,LINETHICK1,COLORRED; 35 | DRAWLINE(FRAC=+1,H,FRAC=-1,L,0), DOTLINE,LINETHICK1,COLORGREEN; 36 | 37 | DUAN:=TDXDLL5(7,FRAC,H,L);{计算段的端点} 38 | {画段} 39 | DRAWLINE(DUAN=-1,L,DUAN=+1,H,0), COLORFF8000;{上升段} 40 | DRAWLINE(DUAN=+1,H,DUAN=-1,L,0), COLORFF8000;{下降} 41 | 42 | {笔中枢} 43 | BISE:=TDXDLL5(10,FRAC,H,L);{输出笔中枢开始和结束} 44 | BIZG:=TDXDLL5(8,FRAC,H,L);{输出笔中枢高点} 45 | BIZD:=TDXDLL5(9,FRAC,H,L);{输出笔中枢低点} 46 | BIZZ:=(BIZG+BIZD)/2; 47 | 48 | {段中枢} 49 | DUANSE:=TDXDLL5(10,DUAN,H,L);{输出段中枢开始和结束} 50 | DUANZG:=TDXDLL5(8,DUAN,H,L);{输出段中枢高点} 51 | DUANZD:=TDXDLL5(9,DUAN,H,L);{输出笔中枢低点} 52 | 53 | {标出段高低点} 54 | DRAWNUMBER(DUAN=1,H,H),COLORFF8000,DRAWABOVE; 55 | DRAWNUMBER(DUAN=-1,L*0.999,L),COLORFF8000; 56 | 57 | {画笔中枢} 58 | IF(BIZG,BIZG,DRAWNULL), COLORRED;{画笔中枢高点} 59 | IF(BIZD,BIZD,DRAWNULL), COLORRED;{画笔中枢低点} 60 | STICKLINE(BISE,BIZD,BIZG,0.1,0), COLORRED;{画笔中枢开始结束} 61 | {中枢中轴} 62 | DRAWLINE(BISE,BIZZ,BISE,BIZZ,0),COLORYELLOW; 63 | 64 | {画段中枢} 65 | IF(DUANZG,DUANZG,DRAWNULL),COLORFF8000;{画段中枢高点} 66 | IF(DUANZD,DUANZD,DRAWNULL),COLORFF8000;{画段中枢低点} 67 | STICKLINE(DUANSE,DUANZD,DUANZG,0,0),COLORFF8000;{画笔段中枢开始结束} 68 | ``` 69 | #大智慧公式# 70 | ``` 71 | bi:="suCLX@BI"; 72 | duan:="suCLX@DUANVAR"(bi); 73 | 74 | drawline(bi=1,h,bi=-1,l,0),dotline,coloryellow,linethick1; 75 | drawline(bi=-1,l,bi=1,h,0),dotline,coloryellow,linethick1; 76 | drawline(duan=1,h,duan=-1,l,0),colorblue,linethick1; 77 | drawline(duan=-1,l,duan=1,h,0),colorblue,linethick1; 78 | {段高低点} 79 | DRAWTEXT(duan=1, h,''+h), colorred, align1, valign2; 80 | DRAWTEXT(duan=-1, l,''+l), colorgreen, align1; 81 | 82 | zszg:="suCLX@ZSZGVAR"(bi); 83 | zszd:="suCLX@ZSZDVAR"(bi); 84 | zsse:="suCLX@ZSSEVAR"(bi); 85 | zszz:=(zszg+zszd)/2; 86 | 87 | dzszg:="suCLX@ZSZGVAR"(duan); 88 | dzszd:="suCLX@ZSZDVAR"(duan); 89 | dzsse:="suCLX@ZSSEVAR"(duan); 90 | 91 | DRAWLINE(zsse=1, zszg, zsse=2, zszg, 0), colorred, linethick1; 92 | DRAWLINE(zsse=1, zszd, zsse=2, zszd, 0), colorred, linethick1; 93 | STICKLINE(zsse=1, zszg, zszd, 1, 0), colorred, linethick1; 94 | STICKLINE(zsse=2, zszg, zszd, 1, 0), colorred, linethick1; 95 | DRAWLINE(zsse=1, zszz, zsse=2, zszz, 0), coloryellow; 96 | 97 | DRAWLINE(dzsse=1, dzszg, dzsse=2, dzszg, 0), colorblue, linethick1; 98 | DRAWLINE(dzsse=1, dzszd, dzsse=2, dzszd, 0), colorblue, linethick1; 99 | STICKLINE(dzsse=1, dzszg, dzszd, 1, -501), colorblue, linethick1; 100 | STICKLINE(dzsse=2, dzszg, dzszd, 1, 501), colorblue, linethick1; 101 | ``` 102 | -------------------------------------------------------------------------------- /Release/suCLX.dll: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/skanda-huayan/tdxCL/fa5747e40e8b0978f79355a772e04c99dd6b901e/Release/suCLX.dll -------------------------------------------------------------------------------- /Release/tdxCL.dll: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/skanda-huayan/tdxCL/fa5747e40e8b0978f79355a772e04c99dd6b901e/Release/tdxCL.dll -------------------------------------------------------------------------------- /src/Main.cpp: -------------------------------------------------------------------------------- 1 | #include "Main.h" 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | // 定义DLL程序的入口函数 8 | BOOL APIENTRY DllMain( HANDLE hModule, DWORD ul_reason_for_call, LPVOID lpReserved) 9 | { 10 | switch (ul_reason_for_call) 11 | { 12 | case DLL_PROCESS_ATTACH: 13 | case DLL_THREAD_ATTACH: 14 | case DLL_THREAD_DETACH: 15 | case DLL_PROCESS_DETACH: 16 | break; 17 | } 18 | return TRUE; 19 | } 20 | 21 | //============================================================================= 22 | // 输出函数1号：K线方向 23 | //============================================================================= 24 | void Func1(int nCount, float *pOut, float *pIn, float *pHigh, float *pLow) 25 | { 26 | float *pDirection = new float[nCount]; 27 | float *pOutHigh = new float[nCount]; 28 | float *pOutLow = new float[nCount]; 29 | float *pInclude = new float[nCount]; 30 | 31 | BaoHan(nCount, pDirection, pOutHigh, pOutLow, pInclude, pHigh, pLow); 32 | 33 | for (int i = 0; i < nCount; i++) 34 | { 35 | pOut[i] = pDirection[i]; 36 | } 37 | 38 | delete []pDirection; 39 | delete []pOutHigh; 40 | delete []pOutLow; 41 | delete []pInclude; 42 | } 43 | 44 | //============================================================================= 45 | // 输出函数2号：是否是有包含关系的K线 46 | //============================================================================= 47 | void Func2(int nCount, float *pOut, float *pIn, float *pHigh, float *pLow) 48 | { 49 | float *pDirection = new float[nCount]; 50 | float *pOutHigh = new float[nCount]; 51 | float *pOutLow = new float[nCount]; 52 | float *pInclude = new float[nCount]; 53 | 54 | BaoHan(nCount, pDirection, pOutHigh, pOutLow, pInclude, pHigh, pLow); 55 | 56 | for (int i = 0; i < nCount; i++) 57 | { 58 | pOut[i] = pInclude[i]; 59 | } 60 | 61 | delete []pDirection; 62 | delete []pOutHigh; 63 | delete []pOutLow; 64 | delete []pInclude; 65 | } 66 | 67 | //============================================================================= 68 | // 输出函数3号：包含处理后的K线高 69 | //============================================================================= 70 | void Func3(int nCount, float *pOut, float *pIn, float *pHigh, float *pLow) 71 | { 72 | float *pDirection = new float[nCount]; 73 | float *pOutHigh = new float[nCount]; 74 | float *pOutLow = new float[nCount]; 75 | float *pInclude = new float[nCount]; 76 | 77 | BaoHan(nCount, pDirection, pOutHigh, pOutLow, pInclude, pHigh, pLow); 78 | 79 | for (int i = 0; i < nCount; i++) 80 | { 81 | pOut[i] = pOutHigh[i]; 82 | } 83 | 84 | delete []pDirection; 85 | delete []pOutHigh; 86 | delete []pOutLow; 87 | delete []pInclude; 88 | } 89 | 90 | //============================================================================= 91 | // 输出函数4号：包含处理后的K线低 92 | //============================================================================= 93 | void Func4(int nCount, float *pOut, float *pIn, float *pHigh, float *pLow) 94 | { 95 | float *pDirection = new float[nCount]; 96 | float *pOutHigh = new float[nCount]; 97 | float *pOutLow = new float[nCount]; 98 | float *pInclude = new float[nCount]; 99 | 100 | BaoHan(nCount, pDirection, pOutHigh, pOutLow, pInclude, pHigh, pLow); 101 | 102 | for (int i = 0; i < nCount; i++) 103 | { 104 | pOut[i] = pOutLow[i]; 105 | } 106 | 107 | delete []pDirection; 108 | delete []pOutHigh; 109 | delete []pOutLow; 110 | delete []pInclude; 111 | } 112 | 113 | //============================================================================= 114 | // 输出函数5号：处理一下包含信号，方便通达信画线 115 | //============================================================================= 116 | void Func5(int nCount, float *pOut, float *pIn1, float *pIn2, float *pInclude) 117 | { 118 | pOut[0] = 0; 119 | float n = 1; 120 | for (int i = 1; i < nCount; i++) 121 | { 122 | if (pInclude[i-1] == 0 && pInclude[i] == 0) 123 | { 124 | pOut[i] = 0; 125 | } 126 | else if (pInclude[i-1] == 0 && pInclude[i] == 1) 127 | { 128 | pOut[i-1] = n; 129 | pOut[i] = n; 130 | } 131 | else if (pInclude[i-1] == 1 && pInclude[i] == 1) 132 | { 133 | pOut[i] = n; 134 | } 135 | else if (pInclude[i-1] == 1 && pInclude[i] == 0) 136 | { 137 | pOut[i] = 0; 138 | if (n == 1) 139 | { 140 | n = 2; 141 | } 142 | else 143 | { 144 | n = 1; 145 | } 146 | 147 | } 148 | } 149 | } 150 | 151 | //============================================================================= 152 | // 输出函数6号：输出笔顶底端点 153 | //============================================================================= 154 | void Func6(int nCount, float *pOut, float *pIn, float *pHigh, float *pLow) 155 | { 156 | Bi2(nCount, pOut, pIn, pHigh, pLow); // 严格笔 157 | } 158 | 159 | //============================================================================= 160 | // 输出函数7号：线段顶底信号 161 | //============================================================================= 162 | void Func7(int nCount, float *pOut, float *pIn, float *pHigh, float *pLow) 163 | { 164 | Duan0(nCount, pOut, pIn, pHigh, pLow);// 特征序列分型 165 | } 166 | 167 | //============================================================================= 168 | // 输出函数8号：中枢高点数据 169 | //============================================================================= 170 | void Func8(int nCount, float *pOut, float *pIn, float *pHigh, float *pLow) 171 | { 172 | ZhongShu ZhongShuOne; 173 | 174 | for (int i = 0; i < nCount; i++) 175 | { 176 | if (pIn[i] == 1) 177 | { 178 | // 遇到线段高点，推入中枢算法 179 | if (ZhongShuOne.PushHigh(i, pHigh[i])) 180 | { 181 | bool bValid = true; 182 | float fHighValue; 183 | int nHignIndex; 184 | int nLowIndex; 185 | int nLowIndexTemp; 186 | int nHighCount = 0; 187 | if (ZhongShuOne.nDirection == 1 && ZhongShuOne.nTerminate == -1) // 向上中枢被向下终结 188 | { 189 | bValid = false; 190 | for (int x = ZhongShuOne.nStart; x <= ZhongShuOne.nEnd; x++) 191 | { 192 | if (pIn[x] == 1) 193 | { 194 | if (nHighCount == 0) 195 | { 196 | nHighCount++; 197 | fHighValue = pHigh[x]; 198 | nHignIndex = x; 199 | } 200 | else 201 | { 202 | nHighCount++; 203 | if (pHigh[x] >= fHighValue) 204 | { 205 | if (nHighCount > 2) 206 | { 207 | bValid = true; 208 | } 209 | fHighValue = pHigh[x]; 210 | nHignIndex = x; 211 | nLowIndex = nLowIndexTemp; 212 | } 213 | } 214 | } 215 | else if (pIn[x] == -1) 216 | { 217 | nLowIndexTemp = x; 218 | } 219 | } 220 | if (bValid) 221 | { 222 | ZhongShuOne.nEnd = nLowIndex; // 中枢结束点移到最高点的前一个低点。 223 | } 224 | i = nHignIndex - 1; 225 | } 226 | else 227 | { 228 | i = ZhongShuOne.nEnd - 1; 229 | } 230 | if (bValid) 231 | { 232 | // 区段内更新算得的中枢高数据 233 | for (int j = ZhongShuOne.nStart + 1; j <= ZhongShuOne.nEnd - 1; j++) 234 | { 235 | pOut[j] = ZhongShuOne.fHigh; 236 | } 237 | 238 | } 239 | 240 | ZhongShuOne.Reset(); 241 | } 242 | } 243 | else if (pIn[i] == -1) 244 | { 245 | // 遇到线段低点，推入中枢算法 246 | if (ZhongShuOne.PushLow(i, pLow[i])) 247 | { 248 | bool bValid = true; 249 | float fLowValue; 250 | int nLowIndex; 251 | int nHighIndex; 252 | int nHighIndexTemp; 253 | int nLowCount = 0; 254 | if (ZhongShuOne.nDirection == -1 && ZhongShuOne.nTerminate == 1) // 向下中枢被向上终结 255 | { 256 | bValid = false; 257 | for (int x = ZhongShuOne.nStart; x <= ZhongShuOne.nEnd; x++) 258 | { 259 | if (pIn[x] == -1) 260 | { 261 | if (nLowCount == 0) 262 | { 263 | nLowCount++; 264 | fLowValue = pLow[x]; 265 | nLowIndex = x; 266 | } 267 | else 268 | { 269 | nLowCount++; 270 | if (pLow[x] <= fLowValue) 271 | { 272 | if (nLowCount > 2) 273 | { 274 | bValid = true; 275 | } 276 | fLowValue = pLow[x]; 277 | nLowIndex = x; 278 | nHighIndex = nHighIndexTemp; 279 | } 280 | } 281 | } 282 | else if (pIn[x] == 1) 283 | { 284 | nHighIndexTemp = x; 285 | } 286 | } 287 | if (bValid) 288 | { 289 | ZhongShuOne.nEnd = nHighIndex; // 中枢结束点移到最高点的前一个低点。 290 | } 291 | i = nLowIndex - 1; 292 | } 293 | else 294 | { 295 | i = ZhongShuOne.nEnd - 1; 296 | } 297 | if (bValid) 298 | { 299 | // 区段内更新算得的中枢高数据 300 | for (int j = ZhongShuOne.nStart + 1; j <= ZhongShuOne.nEnd - 1; j++) 301 | { 302 | pOut[j] = ZhongShuOne.fHigh; 303 | } 304 | 305 | } 306 | 307 | ZhongShuOne.Reset(); 308 | } 309 | } 310 | } 311 | if (ZhongShuOne.bValid) // 最后一个还没有被终结的中枢。 312 | { 313 | // 区段内更新算得的中枢高数据 314 | for (int j = ZhongShuOne.nStart + 1; j <= ZhongShuOne.nEnd - 1; j++) 315 | { 316 | pOut[j] = ZhongShuOne.fHigh; 317 | } 318 | } 319 | } 320 | 321 | //============================================================================= 322 | // 输出函数9号：中枢低点数据 323 | //============================================================================= 324 | void Func9(int nCount, float *pOut, float *pIn, float *pHigh, float *pLow) 325 | { 326 | 327 | ZhongShu ZhongShuOne; 328 | 329 | for (int i = 0; i < nCount; i++) 330 | { 331 | if (pIn[i] == 1) 332 | { 333 | // 遇到线段高点，推入中枢算法 334 | if (ZhongShuOne.PushHigh(i, pHigh[i])) 335 | { 336 | bool bValid = true; 337 | float fHighValue; 338 | int nHignIndex; 339 | int nLowIndex; 340 | int nLowIndexTemp; 341 | int nHighCount = 0; 342 | if (ZhongShuOne.nDirection == 1 && ZhongShuOne.nTerminate == -1) // 向上中枢被向下终结 343 | { 344 | bValid = false; 345 | for (int x = ZhongShuOne.nStart; x <= ZhongShuOne.nEnd; x++) 346 | { 347 | if (pIn[x] == 1) 348 | { 349 | if (nHighCount == 0) 350 | { 351 | nHighCount++; 352 | fHighValue = pHigh[x]; 353 | nHignIndex = x; 354 | } 355 | else 356 | { 357 | nHighCount++; 358 | if (pHigh[x] >= fHighValue) 359 | { 360 | if (nHighCount > 2) 361 | { 362 | bValid = true; 363 | } 364 | fHighValue = pHigh[x]; 365 | nHignIndex = x; 366 | nLowIndex = nLowIndexTemp; 367 | } 368 | } 369 | } 370 | else if (pIn[x] == -1) 371 | { 372 | nLowIndexTemp = x; 373 | } 374 | } 375 | if (bValid) 376 | { 377 | ZhongShuOne.nEnd = nLowIndex; // 中枢结束点移到最高点的前一个低点。 378 | } 379 | i = nHignIndex - 1; 380 | } 381 | else 382 | { 383 | i = ZhongShuOne.nEnd - 1; 384 | } 385 | if (bValid) 386 | { 387 | // 区段内更新算得的中枢低数据 388 | for (int j = ZhongShuOne.nStart + 1; j <= ZhongShuOne.nEnd - 1; j++) 389 | { 390 | pOut[j] = ZhongShuOne.fLow; 391 | } 392 | 393 | } 394 | 395 | ZhongShuOne.Reset(); 396 | } 397 | } 398 | else if (pIn[i] == -1) 399 | { 400 | // 遇到线段低点，推入中枢算法 401 | if (ZhongShuOne.PushLow(i, pLow[i])) 402 | { 403 | bool bValid = true; 404 | float fLowValue; 405 | int nLowIndex; 406 | int nHighIndex; 407 | int nHighIndexTemp; 408 | int nLowCount = 0; 409 | if (ZhongShuOne.nDirection == -1 && ZhongShuOne.nTerminate == 1) // 向下中枢被向上终结 410 | { 411 | bValid = false; 412 | for (int x = ZhongShuOne.nStart; x <= ZhongShuOne.nEnd; x++) 413 | { 414 | if (pIn[x] == -1) 415 | { 416 | if (nLowCount == 0) 417 | { 418 | nLowCount++; 419 | fLowValue = pLow[x]; 420 | nLowIndex = x; 421 | } 422 | else 423 | { 424 | nLowCount++; 425 | if (pLow[x] <= fLowValue) 426 | { 427 | if (nLowCount > 2) 428 | { 429 | bValid = true; 430 | } 431 | fLowValue = pLow[x]; 432 | nLowIndex = x; 433 | nHighIndex = nHighIndexTemp; 434 | } 435 | } 436 | } 437 | else if (pIn[x] == 1) 438 | { 439 | nHighIndexTemp = x; 440 | } 441 | } 442 | if (bValid) 443 | { 444 | ZhongShuOne.nEnd = nHighIndex; // 中枢结束点移到最高点的前一个低点。 445 | } 446 | i = nLowIndex - 1; 447 | } 448 | else 449 | { 450 | i = ZhongShuOne.nEnd - 1; 451 | } 452 | if (bValid) 453 | { 454 | // 区段内更新算得的中枢低数据 455 | for (int j = ZhongShuOne.nStart + 1; j <= ZhongShuOne.nEnd - 1; j++) 456 | { 457 | pOut[j] = ZhongShuOne.fLow; 458 | } 459 | 460 | } 461 | 462 | ZhongShuOne.Reset(); 463 | } 464 | } 465 | } 466 | if (ZhongShuOne.bValid) 467 | { 468 | // 区段内更新算得的中枢低数据 469 | for (int j = ZhongShuOne.nStart + 1; j <= ZhongShuOne.nEnd - 1; j++) 470 | { 471 | pOut[j] = ZhongShuOne.fLow; 472 | } 473 | } 474 | } 475 | 476 | //============================================================================= 477 | // 输出函数10号：中枢起点、终点信号 478 | //============================================================================= 479 | void Func10(int nCount, float *pOut, float *pIn, float *pHigh, float *pLow) 480 | { 481 | 482 | //std::ofstream fout; 483 | //fout.open("D:\\CHANLUN.TXT", std::ofstream::out); 484 | 485 | ZhongShu ZhongShuOne; 486 | 487 | for (int i = 0; i < nCount; i++) 488 | { 489 | if (pIn[i] == 1) 490 | { 491 | // 遇到线段高点，推入中枢算法 492 | if (ZhongShuOne.PushHigh(i, pHigh[i])) 493 | { 494 | //fout<<"中枢终结"<= fHighValue) 519 | { 520 | if (nHighCount > 2) 521 | { 522 | bValid = true; 523 | } 524 | fHighValue = pHigh[x]; 525 | nHignIndex = x; 526 | nLowIndex = nLowIndexTemp; 527 | } 528 | } 529 | } 530 | else if (pIn[x] == -1) 531 | { 532 | nLowIndexTemp = x; 533 | } 534 | } 535 | if (bValid) 536 | { 537 | //fout<<"同级别分解保留最后中枢< 2) 593 | { 594 | bValid = true; 595 | } 596 | fLowValue = pLow[x]; 597 | nLowIndex = x; 598 | nHighIndex = nHighIndexTemp; 599 | } 600 | } 601 | //fout<<"低点数量"<= fHighValue) 683 | { 684 | if (nHighCount > 2) 685 | { 686 | bValid = true; 687 | } 688 | fHighValue = pHigh[x]; 689 | nHignIndex = x; 690 | nLowIndex = nLowIndexTemp; 691 | } 692 | } 693 | } 694 | else if (pIn[x] == -1) 695 | { 696 | nLowIndexTemp = x; 697 | } 698 | } 699 | if (bValid) 700 | { 701 | ZhongShuOne.nEnd = nLowIndex; // 中枢结束点移到最高点的前一个低点。 702 | } 703 | i = nHignIndex - 1; 704 | } 705 | else 706 | { 707 | i = ZhongShuOne.nEnd - 1; 708 | } 709 | if (bValid) 710 | { 711 | // 区段内更新算得的中枢方向数据 712 | for (int j = ZhongShuOne.nStart + 1; j <= ZhongShuOne.nEnd - 1; j++) 713 | { 714 | pOut[j] = (float) ZhongShuOne.nDirection; 715 | } 716 | 717 | } 718 | 719 | ZhongShuOne.Reset(); 720 | } 721 | } 722 | else if (pIn[i] == -1) 723 | { 724 | // 遇到线段低点，推入中枢算法 725 | if (ZhongShuOne.PushLow(i, pLow[i])) 726 | { 727 | bool bValid = true; 728 | float fLowValue; 729 | int nLowIndex; 730 | int nHighIndex; 731 | int nHighIndexTemp; 732 | int nLowCount = 0; 733 | if (ZhongShuOne.nDirection == -1 && ZhongShuOne.nTerminate == 1) // 向下中枢被向上终结 734 | { 735 | bValid = false; 736 | for (int x = ZhongShuOne.nStart; x <= ZhongShuOne.nEnd; x++) 737 | { 738 | if (pIn[x] == -1) 739 | { 740 | if (nLowCount == 0) 741 | { 742 | nLowCount++; 743 | fLowValue = pLow[x]; 744 | nLowIndex = x; 745 | } 746 | else 747 | { 748 | nLowCount++; 749 | if (pLow[x] <= fLowValue) 750 | { 751 | if (nLowCount > 2) 752 | { 753 | bValid = true; 754 | } 755 | fLowValue = pLow[x]; 756 | nLowIndex = x; 757 | nHighIndex = nHighIndexTemp; 758 | } 759 | } 760 | } 761 | else if (pIn[x] == 1) 762 | { 763 | nHighIndexTemp = x; 764 | } 765 | } 766 | if (bValid) 767 | { 768 | ZhongShuOne.nEnd = nHighIndex; // 中枢结束点移到最高点的前一个低点。 769 | } 770 | i = nLowIndex - 1; 771 | } 772 | else 773 | { 774 | i = ZhongShuOne.nEnd - 1; 775 | } 776 | if (bValid) 777 | { 778 | // 区段内更新算得的中枢方向数据 779 | for (int j = ZhongShuOne.nStart + 1; j <= ZhongShuOne.nEnd - 1; j++) 780 | { 781 | pOut[j] = (float) ZhongShuOne.nDirection; 782 | } 783 | 784 | } 785 | 786 | ZhongShuOne.Reset(); 787 | } 788 | } 789 | } 790 | if (ZhongShuOne.bValid) 791 | { 792 | // 区段内更新算得的中枢方向数据 793 | for (int j = ZhongShuOne.nStart + 1; j <= ZhongShuOne.nEnd - 1; j++) 794 | { 795 | pOut[j] = (float) ZhongShuOne.nDirection; 796 | } 797 | } 798 | } 799 | 800 | static PluginTCalcFuncInfo Info[] = 801 | { 802 | { 1, &Func1}, 803 | { 2, &Func2}, 804 | { 3, &Func3}, 805 | { 4, &Func4}, 806 | { 5, &Func5}, 807 | { 6, &Func6}, 808 | { 7, &Func7}, 809 | { 8, &Func8}, 810 | { 9, &Func9}, 811 | {10, &Func10}, 812 | {11, &Func11}, 813 | { 0, NULL} 814 | }; 815 | 816 | BOOL RegisterTdxFunc(PluginTCalcFuncInfo **pInfo) 817 | { 818 | if (*pInfo == NULL) 819 | { 820 | *pInfo = Info; 821 | 822 | return TRUE; 823 | } 824 | 825 | return FALSE; 826 | } 827 | 828 | /********************************************************************/ 829 | //************************交易师 大智慧******************************// 830 | /********************************************************************/ 831 | // --- ChanlunX 大智慧输出函数 --- // 832 | __declspec(dllexport) int WINAPI RUNMODE() 833 | { 834 | return 0; 835 | } 836 | 837 | // --- 1 K线方向 838 | __declspec(dllexport) int WINAPI KXFX(CALCINFO* pData) 839 | { 840 | int nDataLen = pData->m_nNumData; 841 | float *pHigh = new float[nDataLen]; 842 | float *pLow = new float[nDataLen]; 843 | 844 | for (int i = 0; i < nDataLen; i++) 845 | { 846 | pHigh[i] = pData->m_pData[i].m_fHigh; 847 | pLow[i] = pData->m_pData[i].m_fLow; 848 | } 849 | Func1(nDataLen, pData->m_pResultBuf, NULL, pHigh, pLow); 850 | delete []pHigh; 851 | delete []pLow; 852 | return 0; 853 | } 854 | 855 | // --- 2 K线包含 856 | __declspec(dllexport) int WINAPI KXBH(CALCINFO* pData) 857 | { 858 | int nDataLen = pData->m_nNumData; 859 | float *pHigh = new float[nDataLen]; 860 | float *pLow = new float[nDataLen]; 861 | 862 | for (int i = 0; i < nDataLen; i++) 863 | { 864 | pHigh[i] = pData->m_pData[i].m_fHigh; 865 | pLow[i] = pData->m_pData[i].m_fLow; 866 | } 867 | Func2(nDataLen, pData->m_pResultBuf, NULL, pHigh, pLow); 868 | delete []pHigh; 869 | delete []pLow; 870 | return 0; 871 | } 872 | 873 | // --- 3 K线包含处理 874 | __declspec(dllexport) int WINAPI KXBH2VAR(CALCINFO* pData) 875 | { 876 | int nDataLen = pData->m_nNumData; 877 | float *pIn = new float[nDataLen]; 878 | for (int i = 0; i < nDataLen; i++) 879 | { 880 | pIn[i] = pData->m_pfParam1[i]; 881 | } 882 | Func5(nDataLen, pData->m_pResultBuf, NULL, NULL, pIn); 883 | delete []pIn; 884 | return 0; 885 | } 886 | 887 | // --- 4 K线包含处理后的高点 888 | __declspec(dllexport) int WINAPI KXBHG(CALCINFO* pData) 889 | { 890 | int nDataLen = pData->m_nNumData; 891 | float *pHigh = new float[nDataLen]; 892 | float *pLow = new float[nDataLen]; 893 | 894 | for (int i = 0; i < nDataLen; i++) 895 | { 896 | pHigh[i] = pData->m_pData[i].m_fHigh; 897 | pLow[i] = pData->m_pData[i].m_fLow; 898 | } 899 | Func3(nDataLen, pData->m_pResultBuf, NULL, pHigh, pLow); 900 | delete []pHigh; 901 | delete []pLow; 902 | return 0; 903 | } 904 | 905 | // --- 5 K线包含处理后的低点 906 | __declspec(dllexport) int WINAPI KXBHD(CALCINFO* pData) 907 | { 908 | int nDataLen = pData->m_nNumData; 909 | float *pHigh = new float[nDataLen]; 910 | float *pLow = new float[nDataLen]; 911 | 912 | for (int i = 0; i < nDataLen; i++) 913 | { 914 | pHigh[i] = pData->m_pData[i].m_fHigh; 915 | pLow[i] = pData->m_pData[i].m_fLow; 916 | } 917 | Func4(nDataLen, pData->m_pResultBuf, NULL, pHigh, pLow); 918 | delete []pHigh; 919 | delete []pLow; 920 | return 0; 921 | } 922 | 923 | // --- 6 笔端点 924 | __declspec(dllexport) int WINAPI BI(CALCINFO* pData) 925 | { 926 | int nDataLen = pData->m_nNumData; 927 | float *pHigh = new float[nDataLen]; 928 | float *pLow = new float[nDataLen]; 929 | 930 | for (int i = 0; i < nDataLen; i++) 931 | { 932 | pHigh[i] = pData->m_pData[i].m_fHigh; 933 | pLow[i] = pData->m_pData[i].m_fLow; 934 | } 935 | Func6(nDataLen, pData->m_pResultBuf, NULL, pHigh, pLow); 936 | delete []pHigh; 937 | delete []pLow; 938 | return 0; 939 | } 940 | 941 | // --- 7 段端点 942 | __declspec(dllexport) int WINAPI DUANVAR(CALCINFO* pData) 943 | { 944 | if(pData->m_pfParam1 && pData->m_nParam1Start >= 0) 945 | { 946 | int nDataLen = pData->m_nNumData; 947 | float *pHigh = new float[nDataLen]; 948 | float *pLow = new float[nDataLen]; 949 | float *pIn = new float[nDataLen]; 950 | 951 | for (int i = 0; i < nDataLen; i++) 952 | { 953 | pHigh[i] = pData->m_pData[i].m_fHigh; 954 | pLow[i] = pData->m_pData[i].m_fLow; 955 | pIn[i] = pData->m_pfParam1[i]; 956 | } 957 | 958 | Func7(nDataLen, pData->m_pResultBuf, pIn, pHigh, pLow); 959 | delete []pHigh; 960 | delete []pLow; 961 | delete []pIn; 962 | return 0; 963 | } 964 | return -1; 965 | } 966 | 967 | // --- 8 中枢高点 968 | __declspec(dllexport) int WINAPI ZSZGVAR(CALCINFO* pData) 969 | { 970 | int nDataLen = pData->m_nNumData; 971 | float *pHigh = new float[nDataLen]; 972 | float *pLow = new float[nDataLen]; 973 | float *pIn = new float[nDataLen]; 974 | 975 | for (int i = 0; i < nDataLen; i++) 976 | { 977 | pHigh[i] = pData->m_pData[i].m_fHigh; 978 | pLow[i] = pData->m_pData[i].m_fLow; 979 | pIn[i] = pData->m_pfParam1[i]; 980 | } 981 | Func8(nDataLen, pData->m_pResultBuf, pIn, pHigh, pLow); 982 | delete []pHigh; 983 | delete []pLow; 984 | delete []pIn; 985 | return 0; 986 | } 987 | 988 | // --- 9 中枢低点 989 | __declspec(dllexport) int WINAPI ZSZDVAR(CALCINFO* pData) 990 | { 991 | int nDataLen = pData->m_nNumData; 992 | float *pHigh = new float[nDataLen]; 993 | float *pLow = new float[nDataLen]; 994 | float *pIn = new float[nDataLen]; 995 | 996 | for (int i = 0; i < nDataLen; i++) 997 | { 998 | pHigh[i] = pData->m_pData[i].m_fHigh; 999 | pLow[i] = pData->m_pData[i].m_fLow; 1000 | pIn[i] = pData->m_pfParam1[i]; 1001 | } 1002 | Func9(nDataLen, pData->m_pResultBuf, pIn, pHigh, pLow); 1003 | delete []pHigh; 1004 | delete []pLow; 1005 | delete []pIn; 1006 | return 0; 1007 | } 1008 | 1009 | // --- 10 中枢开始结束 1010 | __declspec(dllexport) int WINAPI ZSSEVAR(CALCINFO* pData) 1011 | { 1012 | int nDataLen = pData->m_nNumData; 1013 | float *pHigh = new float[nDataLen]; 1014 | float *pLow = new float[nDataLen]; 1015 | float *pIn = new float[nDataLen]; 1016 | 1017 | for (int i = 0; i < nDataLen; i++) 1018 | { 1019 | pHigh[i] = pData->m_pData[i].m_fHigh; 1020 | pLow[i] = pData->m_pData[i].m_fLow; 1021 | pIn[i] = pData->m_pfParam1[i]; 1022 | } 1023 | Func10(nDataLen, pData->m_pResultBuf, pIn, pHigh, pLow); 1024 | delete []pHigh; 1025 | delete []pLow; 1026 | delete []pIn; 1027 | return 0; 1028 | } 1029 | 1030 | // --- 11 中枢方向 1031 | __declspec(dllexport) int WINAPI ZSFXVAR(CALCINFO* pData) 1032 | { 1033 | int nDataLen = pData->m_nNumData; 1034 | float *pHigh = new float[nDataLen]; 1035 | float *pLow = new float[nDataLen]; 1036 | float *pIn = new float[nDataLen]; 1037 | 1038 | for (int i = 0; i < nDataLen; i++) 1039 | { 1040 | pHigh[i] = pData->m_pData[i].m_fHigh; 1041 | pLow[i] = pData->m_pData[i].m_fLow; 1042 | pIn[i] = pData->m_pfParam1[i]; 1043 | } 1044 | Func11(nDataLen, pData->m_pResultBuf, pIn, pHigh, pLow); 1045 | delete []pHigh; 1046 | delete []pLow; 1047 | delete []pIn; 1048 | return 0; 1049 | } 1050 | // --- ChanlunX 大智慧输出函数 --- // 1051 | 1052 | -------------------------------------------------------------------------------- /src/Main.h: -------------------------------------------------------------------------------- 1 | #ifndef __MAIN_H__ 2 | #define __MAIN_H__ 3 | 4 | #pragma pack(push,1) 5 | 6 | #include "StdAfx.h" 7 | #include 8 | #include 9 | #include "tdxCL.h" 10 | 11 | // --- for TDX --- // 12 | typedef void(*pPluginFUNC)(int nCount, float *pOut, float *a, float *b, float *c); 13 | 14 | typedef struct tagPluginTCalcFuncInfo 15 | { 16 | unsigned short nFuncMark; // 17 | pPluginFUNC pCallFunc; // 18 | } PluginTCalcFuncInfo; 19 | // --- for TDX --- // 20 | 21 | #ifdef __cplusplus 22 | extern "C" 23 | { 24 | #endif //__cplusplus 25 | 26 | /////////////////////////////////////////////////////////////////////////// 27 | //分析周期 28 | enum DATA_TYPE 29 | { 30 | TICK_DATA=2, //分笔成交 31 | MIN1_DATA, //1分钟线 32 | MIN5_DATA, //5分钟线 33 | MIN15_DATA, //15分钟线 34 | MIN30_DATA, //30分钟线 35 | MIN60_DATA, //60分钟线 36 | DAY_DATA, //日线 37 | WEEK_DATA, //周线 38 | MONTH_DATA, //月线 39 | MULTI_DATA //多日线 40 | }; 41 | 42 | /////////////////////////////////////////////////////////////////////////// 43 | //基本数据 44 | 45 | typedef struct tagSTKDATA 46 | { 47 | time_t m_time; //时间,UCT 48 | float m_fOpen; //开盘 49 | float m_fHigh; //最高 50 | float m_fLow; //最低 51 | float m_fClose; //收盘 52 | float m_fVolume; //成交量 53 | float m_fAmount; //成交额 54 | WORD m_wAdvance; //上涨家数(仅大盘有效) 55 | WORD m_wDecline; //下跌家数(仅大盘有效) 56 | } STKDATA; 57 | 58 | 59 | //////////////////////////////////////////////////////////////////////////// 60 | //扩展数据,用于描述分笔成交数据的买卖盘 61 | 62 | typedef union tagSTKDATAEx 63 | { 64 | struct 65 | { 66 | float m_fBuyPrice[3]; //买1--买3价 67 | float m_fBuyVol[3]; //买1--买3量 68 | float m_fSellPrice[3]; //卖1--卖3价 69 | float m_fSellVol[3]; //卖1--卖3量 70 | }; 71 | float m_fDataEx[12]; //保留 72 | } STKDATAEx; 73 | 74 | ///////////////////////////////////////////////////////////////////////////// 75 | /*财务数据顺序(m_pfFinData内容) 76 | 77 | 序号 内容 78 | 79 | 0 总股本(万股), 80 | 1 国家股, 81 | 2 发起人法人股, 82 | 3 法人股, 83 | 4 B股, 84 | 5 H股, 85 | 6 流通A股, 86 | 7 职工股, 87 | 8 A2转配股, 88 | 9 总资产(千元), 89 | 10 流动资产, 90 | 11 固定资产, 91 | 12 无形资产, 92 | 13 长期投资, 93 | 14 流动负债, 94 | 15 长期负债, 95 | 16 资本公积金, 96 | 17 每股公积金, 97 | 18 股东权益, 98 | 19 主营收入, 99 | 20 主营利润, 100 | 21 其他利润, 101 | 22 营业利润, 102 | 23 投资收益, 103 | 24 补贴收入, 104 | 25 营业外收支, 105 | 26 上年损益调整, 106 | 27 利润总额, 107 | 28 税后利润, 108 | 29 净利润, 109 | 30 未分配利润, 110 | 31 每股未分配, 111 | 32 每股收益, 112 | 33 每股净资产, 113 | 34 调整每股净资, 114 | 35 股东权益比, 115 | 36 净资收益率 116 | */ 117 | 118 | ///////////////////////////////////////////////////////////////////////////// 119 | //函数数据结构 120 | 121 | typedef struct tagCALCINFO 122 | { 123 | const DWORD m_dwSize; //结构大小 124 | const DWORD m_dwVersion; //调用软件版本(V2.10 : 0x210) 125 | const DWORD m_dwSerial; //调用软件序列号 126 | const char* m_strStkLabel; //股票代码 127 | const BOOL m_bIndex; //大盘 128 | 129 | const int m_nNumData; //数据数量(pData,pDataEx,pResultBuf数据数量) 130 | const STKDATA* m_pData; //常规数据,注意:当m_nNumData==0时可能为 NULL 131 | const STKDATAEx* m_pDataEx; //扩展数据,分笔成交买卖盘,注意:可能为 NULL 132 | 133 | const int m_nParam1Start; //参数1有效位置 134 | const float* m_pfParam1; //调用参数1 135 | const float* m_pfParam2; //调用参数2 136 | const float* m_pfParam3; //调用参数3 137 | const float* m_pfParam4; //调用参数3 138 | 139 | float* m_pResultBuf; //结果缓冲区 140 | const DATA_TYPE m_dataType; //数据类型 141 | const float* m_pfFinData; //财务数据 142 | } CALCINFO; 143 | 144 | /* 145 | 注: 146 | 1.函数调用参数由m_pfParam1--m_pfParam4带入,若为NULL则表示该参数无效. 147 | 2.当一个参数无效时,则其后的所有参数均无效. 148 | 如:m_pfParam2为NULL,则m_pfParam3,m_pfParam4一定为NULL. 149 | 3.参数1可以是常数参数或序列数参数,其余参数只能为常数参数. 150 | 4.若m_nParam1Start<0, 则参数1为常数参数,参数等于*m_pfParam1; 151 | 5.若m_nParam1Start>=0,则参数1为序列数参数,m_pfParam1指向一个浮点型数组, 152 | 数组大小为m_nNumData,数据有效范围为m_nParam1Start--m_nNumData. 153 | 在时间上m_pData[x] 与 m_pfParam1[x]是一致的 154 | */ 155 | 156 | __declspec(dllexport) BOOL RegisterTdxFunc(PluginTCalcFuncInfo **pInfo); 157 | 158 | /********************************************************************/ 159 | //************************交易师 大智慧******************************// 160 | /********************************************************************/ 161 | __declspec(dllexport) int WINAPI RUNMODE(); 162 | __declspec(dllexport) int WINAPI KXFX(CALCINFO* pData); // K线方向 163 | __declspec(dllexport) int WINAPI KXBH(CALCINFO* pData); // K线包含 164 | __declspec(dllexport) int WINAPI KXBH2VAR(CALCINFO* pData); // K线包含处理 165 | __declspec(dllexport) int WINAPI KXBHG(CALCINFO* pData); // K线包含处理后的高点 166 | __declspec(dllexport) int WINAPI KXBHD(CALCINFO* pData); // K线包含处理后的低点 167 | __declspec(dllexport) int WINAPI BI(CALCINFO* pData); // 笔端点 168 | __declspec(dllexport) int WINAPI DUANVAR(CALCINFO* pData); // 段端点 169 | __declspec(dllexport) int WINAPI ZSZGVAR(CALCINFO* pData); // 中枢高 170 | __declspec(dllexport) int WINAPI ZSZDVAR(CALCINFO* pData); // 中枢低点 171 | __declspec(dllexport) int WINAPI ZSSEVAR(CALCINFO* pData); // 中枢开始结束 172 | __declspec(dllexport) int WINAPI ZSFXVAR(CALCINFO* pData); // 中枢方向 173 | 174 | #ifdef __cplusplus 175 | } 176 | #endif //__cplusplus 177 | 178 | 179 | 180 | #pragma pack(pop) 181 | #endif 182 | -------------------------------------------------------------------------------- /src/StdAfx.cpp: -------------------------------------------------------------------------------- 1 | // stdafx.cpp : source file that includes just the standard includes 2 | // FxjFunc.pch will be the pre-compiled header 3 | // stdafx.obj will contain the pre-compiled type information 4 | 5 | #include "stdafx.h" 6 | 7 | // TODO: reference any additional headers you need in STDAFX.H 8 | // and not in this file 9 | -------------------------------------------------------------------------------- /src/StdAfx.h: -------------------------------------------------------------------------------- 1 | // stdafx.h : include file for standard system include files, 2 | // or project specific include files that are used frequently, but 3 | // are changed infrequently 4 | // 5 | 6 | #if !defined(AFX_STDAFX_H__401C6083_B7B9_11D2_B681_D0BCED681808__INCLUDED_) 7 | #define AFX_STDAFX_H__401C6083_B7B9_11D2_B681_D0BCED681808__INCLUDED_ 8 | 9 | #if _MSC_VER > 1000 10 | #pragma once 11 | #endif // _MSC_VER > 1000 12 | 13 | 14 | // Insert your headers here 15 | #define WIN32_LEAN_AND_MEAN // Exclude rarely-used stuff from Windows headers 16 | 17 | #include 18 | #include 19 | 20 | // TODO: reference additional headers your program requires here 21 | 22 | //{{AFX_INSERT_LOCATION}} 23 | // Microsoft Visual C++ will insert additional declarations immediately before the previous line. 24 | 25 | #endif // !defined(AFX_STDAFX_H__401C6083_B7B9_11D2_B681_D0BCED681808__INCLUDED_) 26 | -------------------------------------------------------------------------------- /src/tdxCL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/skanda-huayan/tdxCL/fa5747e40e8b0978f79355a772e04c99dd6b901e/src/tdxCL.cpp -------------------------------------------------------------------------------- /src/tdxCL.h: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/skanda-huayan/tdxCL/fa5747e40e8b0978f79355a772e04c99dd6b901e/src/tdxCL.h -------------------------------------------------------------------------------- /tdxCL.dsp: -------------------------------------------------------------------------------- 1 | # Microsoft Developer Studio Project File - Name="tdxCL" - Package Owner=<4> 2 | # Microsoft Developer Studio Generated Build File, Format Version 6.00 3 | # ** DO NOT EDIT ** 4 | 5 | # TARGTYPE "Win32 (x86) Dynamic-Link Library" 0x0102 6 | 7 | CFG=tdxCL - Win32 Debug 8 | !MESSAGE This is not a valid makefile. To build this project using NMAKE, 9 | !MESSAGE use the Export Makefile command and run 10 | !MESSAGE 11 | !MESSAGE NMAKE /f "tdxCL.mak". 12 | !MESSAGE 13 | !MESSAGE You can specify a configuration when running NMAKE 14 | !MESSAGE by defining the macro CFG on the command line. For example: 15 | !MESSAGE 16 | !MESSAGE NMAKE /f "tdxCL.mak" CFG="tdxCL - Win32 Debug" 17 | !MESSAGE 18 | !MESSAGE Possible choices for configuration are: 19 | !MESSAGE 20 | !MESSAGE "tdxCL - Win32 Release" (based on "Win32 (x86) Dynamic-Link Library") 21 | !MESSAGE "tdxCL - Win32 Debug" (based on "Win32 (x86) Dynamic-Link Library") 22 | !MESSAGE 23 | 24 | # Begin Project 25 | # PROP AllowPerConfigDependencies 0 26 | # PROP Scc_ProjName "" 27 | # PROP Scc_LocalPath "" 28 | CPP=cl.exe 29 | MTL=midl.exe 30 | RSC=rc.exe 31 | 32 | !IF "$(CFG)" == "tdxCL - Win32 Release" 33 | 34 | # PROP BASE Use_MFC 0 35 | # PROP BASE Use_Debug_Libraries 0 36 | # PROP BASE Output_Dir "Release" 37 | # PROP BASE Intermediate_Dir "Release" 38 | # PROP BASE Target_Dir "" 39 | # PROP Use_MFC 0 40 | # PROP Use_Debug_Libraries 0 41 | # PROP Output_Dir "build\Release" 42 | # PROP Intermediate_Dir "Release" 43 | # PROP Target_Dir "" 44 | # ADD BASE CPP /nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "TDXCL_EXPORTS" /YX /FD /c 45 | # ADD CPP /nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "TDXCL_EXPORTS" /YX /FD /c 46 | # ADD BASE MTL /nologo /D "NDEBUG" /mktyplib203 /win32 47 | # ADD MTL /nologo /D "NDEBUG" /mktyplib203 /win32 48 | # ADD BASE RSC /l 0x804 /d "NDEBUG" 49 | # ADD RSC /l 0x804 /d "NDEBUG" 50 | BSC32=bscmake.exe 51 | # ADD BASE BSC32 /nologo 52 | # ADD BSC32 /nologo 53 | LINK32=link.exe 54 | # ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /machine:I386 55 | # ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /machine:I386 56 | 57 | !ELSEIF "$(CFG)" == "tdxCL - Win32 Debug" 58 | 59 | # PROP BASE Use_MFC 0 60 | # PROP BASE Use_Debug_Libraries 1 61 | # PROP BASE Output_Dir "Debug" 62 | # PROP BASE Intermediate_Dir "Debug" 63 | # PROP BASE Target_Dir "" 64 | # PROP Use_MFC 0 65 | # PROP Use_Debug_Libraries 1 66 | # PROP Output_Dir "Debug" 67 | # PROP Intermediate_Dir "Debug" 68 | # PROP Target_Dir "" 69 | # ADD BASE CPP /nologo /MTd /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "TDXCL_EXPORTS" /YX /FD /GZ /c 70 | # ADD CPP /nologo /MTd /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "TDXCL_EXPORTS" /YX /FD /GZ /c 71 | # ADD BASE MTL /nologo /D "_DEBUG" /mktyplib203 /win32 72 | # ADD MTL /nologo /D "_DEBUG" /mktyplib203 /win32 73 | # ADD BASE RSC /l 0x804 /d "_DEBUG" 74 | # ADD RSC /l 0x804 /d "_DEBUG" 75 | BSC32=bscmake.exe 76 | # ADD BASE BSC32 /nologo 77 | # ADD BSC32 /nologo 78 | LINK32=link.exe 79 | # ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /debug /machine:I386 /pdbtype:sept 80 | # ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /debug /machine:I386 /pdbtype:sept 81 | 82 | !ENDIF 83 | 84 | # Begin Target 85 | 86 | # Name "tdxCL - Win32 Release" 87 | # Name "tdxCL - Win32 Debug" 88 | # Begin Group "Source Files" 89 | 90 | # PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat" 91 | # Begin Source File 92 | 93 | SOURCE=.\src\Main.cpp 94 | # End Source File 95 | # Begin Source File 96 | 97 | SOURCE=.\src\StdAfx.cpp 98 | # End Source File 99 | # Begin Source File 100 | 101 | SOURCE=.\src\tdxCL.cpp 102 | # End Source File 103 | # End Group 104 | # Begin Group "Header Files" 105 | 106 | # PROP Default_Filter "h;hpp;hxx;hm;inl" 107 | # Begin Source File 108 | 109 | SOURCE=.\src\Main.h 110 | # End Source File 111 | # Begin Source File 112 | 113 | SOURCE=.\src\StdAfx.h 114 | # End Source File 115 | # Begin Source File 116 | 117 | SOURCE=.\src\tdxCL.h 118 | # End Source File 119 | # End Group 120 | # Begin Group "Resource Files" 121 | 122 | # PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe" 123 | # End Group 124 | # End Target 125 | # End Project 126 | -------------------------------------------------------------------------------- /tdxCL.dsw: -------------------------------------------------------------------------------- 1 | Microsoft Developer Studio Workspace File, Format Version 6.00 2 | # WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE! 3 | 4 | ############################################################################### 5 | 6 | Project: "tdxCL"=".\tdxCL.dsp" - Package Owner=<4> 7 | 8 | Package=<5> 9 | {{{ 10 | }}} 11 | 12 | Package=<4> 13 | {{{ 14 | }}} 15 | 16 | ############################################################################### 17 | 18 | Global: 19 | 20 | Package=<5> 21 | {{{ 22 | }}} 23 | 24 | Package=<3> 25 | {{{ 26 | }}} 27 | 28 | ############################################################################### 29 | 30 | --------------------------------------------------------------------------------