├── .gitignore ├── .travis.yml ├── LICENSE ├── README.md ├── jsongen.go ├── jsongen_test.go └── test.json /.gitignore: -------------------------------------------------------------------------------- 1 | jsongen.exe -------------------------------------------------------------------------------- /.travis.yml: -------------------------------------------------------------------------------- 1 | language: go 2 | 3 | go: 4 | - 1.1 5 | - 1.2 6 | - 1.3 7 | - 1.4 -------------------------------------------------------------------------------- /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 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 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 | {project} Copyright (C) {year} {fullname} 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 | ## Purpose 2 | JSONGen is a tool for generating native Golang types from JSON objects. This automates what is otherwise a very tedious and error prone task when working with JSON. 3 | 4 | [![Build Status](http://img.shields.io/travis/bemasher/JSONGen.svg?style=flat)](https://travis-ci.org/bemasher/JSONGen) 5 | [![GPLv3 License](http://img.shields.io/badge/license-GPLv3-blue.svg?style=flat)](http://choosealicense.com/licenses/gpl-3.0/) 6 | 7 | ## Usage 8 | 9 | ``` 10 | $ jsongen -h 11 | Usage of jsongen: 12 | -dump="NUL": Dump tree structure to file. 13 | -normalize=true: Squash arrays of struct and determine primitive array type. 14 | -title=true: Convert identifiers to title case, treating '_' and '-' as word boundaries. 15 | ``` 16 | 17 | Reading from stdin can be done as follows: 18 | ``` 19 | $ cat test.json | jsongen 20 | ``` 21 | 22 | Or a filename can be passed: 23 | ``` 24 | $ jsongen test.json 25 | ``` 26 | 27 | Using [test.json](test.json) as input the example will produce: 28 | ```go 29 | type _ struct { 30 | Bool bool `json:"bool"` 31 | Boollist []bool `json:"boollist"` 32 | Float float64 `json:"float"` 33 | Floatlist []float64 `json:"floatlist"` 34 | Heterogeneouslist []interface{} `json:"heterogeneouslist"` 35 | Int int64 `json:"int"` 36 | Intlist []int64 `json:"intlist"` 37 | Nil interface{} `json:"nil"` 38 | Nillist []interface{} `json:"nillist"` 39 | Sanitary string `json:"_Sanitary"` 40 | Sanitary string 41 | Sanitary0 string 42 | String string `json:"string"` 43 | Stringlist []string `json:"stringlist"` 44 | Struct struct { 45 | Bool bool `json:"bool"` 46 | Float float64 `json:"float"` 47 | Int int64 `json:"int"` 48 | Nil interface{} `json:"nil"` 49 | String string `json:"string"` 50 | } `json:"struct"` 51 | Structlist []struct { 52 | Bool bool `json:"bool"` 53 | Float float64 `json:"float"` 54 | Int int64 `json:"int"` 55 | String string `json:"string"` 56 | } `json:"structlist"` 57 | Structlistsquash []struct { 58 | Bool bool `json:"bool"` 59 | Float float64 `json:"float"` 60 | Int int64 `json:"int"` 61 | String string `json:"string"` 62 | } `json:"structlistsquash"` 63 | Structlistsquashconflict []struct { 64 | Bool bool `json:"bool"` 65 | Conflict interface{} `json:"conflict"` 66 | Float float64 `json:"float"` 67 | Int int64 `json:"int"` 68 | String string `json:"string"` 69 | } `json:"structlistsquashconflict"` 70 | TitleCase string `json:"title case"` 71 | TitleCase string `json:"title_case"` 72 | TitleCase string `json:"title-case"` 73 | Titlecase string `json:"titlecase"` 74 | Unsanitary string `json:"0Unsanitary"` 75 | _ string `json:"123"` 76 | } 77 | ``` 78 | 79 | ## Parsing 80 | ### Field Names 81 | * Field names are sanitized and written as exported fields of the generated type. 82 | * If sanitizing produces an empty string the identifier is changed to `_`, this will need to be set by hand in order to properly decode the type. 83 | * If sanitizing produces a field name different from the original value a JSON tag is added to the field. 84 | * Spaces and `-` are converted to `_`. 85 | * Field names are converted to title case treating `_` and `-` as word boundaries along with spaces. This can be disabled using `-title=false`. 86 | 87 | ## Types 88 | ### Primitive 89 | * Primitive types are parsed and stored as-is. 90 | * Valid types are bool, int64, float64 and string. 91 | * The JSON value `null` is translated to the empty interface. 92 | 93 | ### Object 94 | * Object types are treated as structs. 95 | * Fields of structures are sorted lexicographically by sanitized field name. 96 | * If a structure contains duplicate fields of different types, the type will be chosen at random since Golang's map iteration order is undefined. This shouldn't be a problem since this is not permitted in JSON specification, but this is the expected behavior should it happen. 97 | 98 | ### Lists 99 | * A homogeneous list of primitive values are treated as a list of the primitive type e.g.: `[]float64` 100 | * Lists of heterogeneous types are treated as a list of the empty interface: `[]interface{}` 101 | * Lists containing both integers and floating point values are interpreted as `[]float64`. 102 | * Lists with object elements are treated as a list of structs. 103 | * Fields of each element are "squashed" into a single struct. The result is an array of a struct containing all encountered fields. 104 | * If a field in one element has a different type in another of the same list, the offending field is treated as an empty interface. 105 | 106 | Examples of all of the above can be found in [test.json](test.json). 107 | 108 | ## Caveats 109 | * Currently sibling field names are not guaranteed to be unique. 110 | 111 | ## License 112 | The source of this project is licensed under GNU GPL v3.0, according to [http://choosealicense.com/licenses/gpl-3.0/](http://choosealicense.com/licenses/gpl-3.0/): 113 | 114 | #### Required: 115 | 116 | * **Disclose Source:** Source code must be made available when distributing the software. In the case of LGPL, the source for the library (and not the entire program) must be made available. 117 | * **License and copyright notice:** Include a copy of the license and copyright notice with the code. 118 | * **State Changes:** Indicate significant changes made to the code. 119 | 120 | #### Permitted: 121 | 122 | * **Commercial Use:** This software and derivatives may be used for commercial purposes. 123 | * **Distribution:** You may distribute this software. 124 | * **Modification:** This software may be modified. 125 | * **Patent Grant:** This license provides an express grant of patent rights from the contributor to the recipient. 126 | * **Private Use:** You may use and modify the software without distributing it. 127 | 128 | #### Forbidden: 129 | 130 | * **Hold Liable:** Software is provided without warranty and the software author/license owner cannot be held liable for damages. 131 | * **Sublicensing:** You may not grant a sublicense to modify and distribute this software to third parties not included in the license. 132 | 133 | ## Feedback 134 | If you find a case that produces incorrect results or you have a feature suggestion, let me know: submit an issue. 135 | -------------------------------------------------------------------------------- /jsongen.go: -------------------------------------------------------------------------------- 1 | // JSONGen - A tool for generating native Golang types from JSON objects. 2 | // Copyright (C) 2014 Douglas Hall 3 | // 4 | // This program is free software: you can redistribute it and/or modify 5 | // it under the terms of the GNU General Public License as published by 6 | // the Free Software Foundation, either version 3 of the License, or 7 | // (at your option) any later version. 8 | // 9 | // This program is distributed in the hope that it will be useful, 10 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | // GNU General Public License for more details. 13 | // 14 | // You should have received a copy of the GNU General Public License 15 | // along with this program. If not, see . 16 | 17 | package main 18 | 19 | import ( 20 | "encoding/json" 21 | "flag" 22 | "fmt" 23 | "go/format" 24 | "log" 25 | "os" 26 | "sort" 27 | "strings" 28 | "unicode" 29 | ) 30 | 31 | var config Config 32 | 33 | type Config struct { 34 | dumpFilename string 35 | 36 | dumpFile *os.File 37 | inputFile *os.File 38 | 39 | titleCase bool 40 | normalize bool 41 | } 42 | 43 | func (c *Config) Parse() (err error) { 44 | flag.StringVar(&config.dumpFilename, "dump", os.DevNull, "Dump tree structure to file.") 45 | flag.BoolVar(&config.normalize, "normalize", true, "Squash arrays of struct and determine primitive array type.") 46 | flag.BoolVar(&config.titleCase, "title", true, "Convert identifiers to title case, treating '_' and '-' as word boundaries.") 47 | 48 | flag.Parse() 49 | 50 | if flag.NArg() == 0 { 51 | config.inputFile = os.Stdin 52 | } else { 53 | config.inputFile, err = os.Open(flag.Arg(0)) 54 | if err != nil { 55 | return 56 | } 57 | } 58 | 59 | c.dumpFile, err = os.Create(c.dumpFilename) 60 | if err != nil { 61 | return 62 | } 63 | 64 | return 65 | } 66 | 67 | func (c Config) Close() { 68 | c.dumpFile.Close() 69 | c.inputFile.Close() 70 | } 71 | 72 | // Field name sanitizer. 73 | type Ident string 74 | 75 | // Golang identifiers must begin with a letter and may contain letters, digits 76 | // and _'s. If config.titleCase is true, -, _ and spaces are treated as word 77 | // boundaries, otherwise only spaces are treated as word boundaries. 78 | func (id Ident) String() (s string) { 79 | // Trim non-letter characters from the left of the identifier. 80 | s = strings.TrimLeftFunc(string(id), func(r rune) bool { 81 | return !unicode.IsLetter(r) 82 | }) 83 | 84 | // Remove any invalid characters in the identifier. 85 | s = strings.Map(func(r rune) rune { 86 | if r == ' ' { 87 | return ' ' 88 | } 89 | 90 | // Convert -'s to _'s or spaces depending on configuration. 91 | if r == '-' || r == '_' { 92 | if config.titleCase { 93 | return ' ' 94 | } 95 | return '_' 96 | } 97 | 98 | if unicode.IsLetter(r) || unicode.IsDigit(r) { 99 | return r 100 | } 101 | 102 | return -1 103 | }, s) 104 | 105 | // Perform title casing. 106 | s = strings.Title(s) 107 | // Remove spaces from the identifier. 108 | s = strings.Map(func(r rune) rune { 109 | if r == ' ' { 110 | return -1 111 | } 112 | return r 113 | }, s) 114 | 115 | // If the identifier is empty, output an _. 116 | if len(s) == 0 { 117 | s = "_" 118 | } 119 | 120 | return 121 | } 122 | 123 | // Returns a field tag for the original field name. 124 | func (id Ident) Tag() string { 125 | return "`json:\"" + string(id) + "\"`" 126 | } 127 | 128 | // JSON values are translated to go types as follows: 129 | // null -> interface{} 130 | // bool -> bool 131 | // int -> int64 132 | // float -> float64 133 | // string -> string 134 | // object -> struct 135 | type Type int 136 | 137 | const ( 138 | Interface Type = iota + 1 139 | Bool 140 | Int 141 | Float 142 | String 143 | Struct 144 | ) 145 | 146 | func (t Type) String() string { 147 | switch t { 148 | case Interface: 149 | return "interface{}" 150 | case Bool: 151 | return "bool" 152 | case Int: 153 | return "int64" 154 | case Float: 155 | return "float64" 156 | case String: 157 | return "string" 158 | case Struct: 159 | return "struct" 160 | } 161 | return "unset" 162 | } 163 | 164 | // Necessary for dumping the tree for debugging. 165 | func (t Type) MarshalText() (text []byte, err error) { 166 | return []byte(t.String()), nil 167 | } 168 | 169 | // A type tree describes parsed JSON input. Elements have a name, type and 170 | // children, list specifies if the type is a list. 171 | type Tree struct { 172 | Name Ident `json:",omitempty"` 173 | List bool `json:",omitempty"` 174 | Type Type 175 | Children []*Tree `json:",omitempty"` 176 | } 177 | 178 | // A tree implements the sort interface on it's children's sanitized names. 179 | func (t Tree) Len() int { 180 | return len(t.Children) 181 | } 182 | 183 | func (t Tree) Less(i, j int) bool { 184 | return t.Children[i].Name.String() < t.Children[j].Name.String() 185 | } 186 | 187 | func (t Tree) Swap(i, j int) { 188 | t.Children[i], t.Children[j] = t.Children[j], t.Children[i] 189 | } 190 | 191 | // Returns canonical golang of the type structure. 192 | func (t *Tree) Format() (formatted []byte, err error) { 193 | // Store the raw source for debugging. 194 | unformatted := []byte("type " + t.formatHelper(0)) 195 | 196 | // Attempt to format the source. 197 | formatted, err = format.Source(unformatted) 198 | 199 | // If formatting failed, return the unformatted source and the error. 200 | if err != nil { 201 | formatted = unformatted 202 | } 203 | return 204 | } 205 | 206 | func (t *Tree) formatHelper(depth int) (r string) { 207 | indent := strings.Repeat("\t", depth) 208 | 209 | // Print the name of the current element. 210 | r += indent + t.Name.String() + " " 211 | 212 | // On return append a tag if the field name differs from the parsed name. 213 | defer func() { 214 | if depth != 0 && string(t.Name) != t.Name.String() { 215 | r += " " + t.Name.Tag() 216 | } 217 | r += "\n" 218 | }() 219 | 220 | // Prefix the type with [] if list is true. 221 | if t.List { 222 | r += "[]" 223 | } 224 | 225 | // Print type 226 | r += t.Type.String() 227 | 228 | // If the type is a struct, print struct and enclosing curly braces. 229 | if t.Type == Struct { 230 | r += " {\n" 231 | defer func() { 232 | r += indent + "}" 233 | }() 234 | 235 | // Recurse for each child of the struct. 236 | for _, child := range t.Children { 237 | r += child.formatHelper(depth + 1) 238 | } 239 | } else { 240 | } 241 | 242 | return 243 | } 244 | 245 | // Given a value which JSON has been parsed into, populates the tree. 246 | func (t *Tree) Populate(v interface{}) { 247 | // Handles null value in JSON. 248 | if v == nil { 249 | t.Type = Interface 250 | } 251 | 252 | // Type switch on the current element, store type and recurse if necessary. 253 | switch i := v.(type) { 254 | case bool: 255 | t.Type = Bool 256 | case string: 257 | t.Type = String 258 | case json.Number: 259 | // If number parses successfully as an int, store as int. 260 | if _, err := i.Int64(); err == nil { 261 | t.Type = Int 262 | } else { 263 | // Float should always succeed in parsing so only store as float 264 | // if parsing as int failed. 265 | if _, err := i.Float64(); err == nil { 266 | t.Type = Float 267 | } 268 | } 269 | case []interface{}: 270 | // Set list to true and type to interface, type will be determined 271 | // later if normalization is used. Recurse for each child. 272 | t.List = true 273 | t.Type = Interface 274 | for _, v := range i { 275 | child := &Tree{} 276 | child.Populate(v) 277 | t.Children = append(t.Children, child) 278 | } 279 | case map[string]interface{}: 280 | // Set type to struct and recurse for each child. Store key as child name. 281 | t.Type = Struct 282 | for k, v := range i { 283 | child := &Tree{Name: Ident(k)} 284 | child.Populate(v) 285 | t.Children = append(t.Children, child) 286 | } 287 | // Sort children for consistent output. 288 | sort.Sort(t) 289 | } 290 | } 291 | 292 | // Flattens homogeneous lists of primitive types and squashes lists of struct 293 | // into one struct. If fields have conflicting types while squashing a 294 | // list of struct, the offending field is converted to the empty interface. 295 | func (t *Tree) Normalize() { 296 | // Normalize from the bottom up so use depth first iteration. 297 | for idx := range t.Children { 298 | t.Children[idx].Normalize() 299 | } 300 | 301 | // Normalization only applies to lists. 302 | if !t.List { 303 | return 304 | } 305 | 306 | // Make a map of children types. 307 | types := make(map[Type]bool) 308 | for _, child := range t.Children { 309 | types[child.Type] = true 310 | } 311 | 312 | switch len(types) { 313 | // Children are all of the same type. 314 | case 1: 315 | // Get first key out of 1-element map. 316 | for typ := range types { 317 | t.Type = typ 318 | } 319 | 320 | // If this is a list of structs, squash grand-children into single struct. 321 | if t.List && t.Type == Struct { 322 | // Make a map of grand-children 323 | fields := make(map[Ident]*Tree) 324 | 325 | // For each child struct. 326 | for _, element := range t.Children { 327 | // For each grand-child. 328 | for _, child := range element.Children { 329 | // Store grand-child in fields map if it doesn't already exist. 330 | if _, exists := fields[child.Name]; !exists { 331 | fields[child.Name] = child 332 | } else { 333 | // Recursively compare the grand-child type with the 334 | // one already stored in fields. If the comparison 335 | // fails, store as empty interface. 336 | if !Compare(fields[child.Name], child) { 337 | fields[child.Name].Type = Interface 338 | fields[child.Name].Children = nil 339 | } 340 | } 341 | } 342 | } 343 | 344 | // Remove all of the children. 345 | t.Children = nil 346 | 347 | // Store squashed list of children. 348 | for _, child := range fields { 349 | t.Children = append(t.Children, child) 350 | } 351 | 352 | // Sort new list of children. 353 | sort.Sort(t) 354 | } else { 355 | // Not a list of struct so just remove all children. 356 | t.Children = nil 357 | } 358 | case 2: 359 | // Two types found, store as float if both types are int and float. 360 | if types[Int] && types[Float] { 361 | t.Type = Float 362 | t.Children = nil 363 | } 364 | default: 365 | // Heterogeneous list types, store as empty interface. 366 | t.Type = Interface 367 | t.Children = nil 368 | } 369 | } 370 | 371 | // Used for comparing fields between structs while squashing a list of struct. 372 | type FieldType struct { 373 | Name Ident 374 | List bool 375 | Type Type 376 | } 377 | 378 | // Recursively compares field names and types of two structs. 379 | func Compare(t1, t2 *Tree) bool { 380 | // Spawn two walkers for each tree. 381 | c1, c2 := Walker(t1), Walker(t2) 382 | for { 383 | // Get values from walkers. 384 | v1, ok1 := <-c1 385 | v2, ok2 := <-c2 386 | // If either of the walkers closed their channel. 387 | if !ok1 || !ok2 { 388 | // Check to see if both closed at the same time. 389 | return ok1 == ok2 390 | } 391 | // If the received values don't match, comparison fails. 392 | if v1 != v2 { 393 | break 394 | } 395 | } 396 | return false 397 | } 398 | 399 | // Recursively walks a tree, returns a channel of values. 400 | func Walker(t *Tree) <-chan FieldType { 401 | ch := make(chan FieldType) 402 | go func() { 403 | Walk(t, ch) 404 | close(ch) 405 | }() 406 | return ch 407 | } 408 | 409 | // Recursively walks a tree, sending values on given channel. 410 | func Walk(t *Tree, ch chan FieldType) { 411 | if t == nil { 412 | return 413 | } 414 | 415 | ch <- FieldType{t.Name, t.List, t.Type} 416 | for _, child := range t.Children { 417 | Walk(child, ch) 418 | } 419 | } 420 | 421 | func init() { 422 | log.SetFlags(log.Lshortfile) 423 | 424 | if err := config.Parse(); err != nil { 425 | log.Fatal("Error parsing flags:", err) 426 | } 427 | } 428 | 429 | func main() { 430 | defer config.Close() 431 | 432 | jsonDecoder := json.NewDecoder(config.inputFile) 433 | jsonDecoder.UseNumber() 434 | var data interface{} 435 | err := jsonDecoder.Decode(&data) 436 | if err != nil { 437 | log.Fatal("Error decoding input: ", err) 438 | } 439 | 440 | var tree Tree 441 | tree.Populate(data) 442 | if config.normalize { 443 | tree.Normalize() 444 | } 445 | 446 | indented, err := json.MarshalIndent(tree, "", "\t") 447 | if err != nil { 448 | log.Fatal("Error encoding tree:", err) 449 | } 450 | 451 | _, err = config.dumpFile.Write(indented) 452 | if err != nil { 453 | log.Fatal("Error dumping tree:", err) 454 | } 455 | 456 | source, err := tree.Format() 457 | fmt.Println(string(source)) 458 | if err != nil { 459 | log.Fatal("Error formatting source:", err) 460 | } 461 | } 462 | -------------------------------------------------------------------------------- /jsongen_test.go: -------------------------------------------------------------------------------- 1 | // JSONGen - A tool for generating native Golang types from JSON objects. 2 | // Copyright (C) 2014 Douglas Hall 3 | // 4 | // This program is free software: you can redistribute it and/or modify 5 | // it under the terms of the GNU General Public License as published by 6 | // the Free Software Foundation, either version 3 of the License, or 7 | // (at your option) any later version. 8 | // 9 | // This program is distributed in the hope that it will be useful, 10 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | // GNU General Public License for more details. 13 | // 14 | // You should have received a copy of the GNU General Public License 15 | // along with this program. If not, see . 16 | 17 | package main 18 | 19 | import ( 20 | "bytes" 21 | "encoding/json" 22 | "reflect" 23 | "testing" 24 | ) 25 | 26 | func Parse(raw string) (tree Tree, err error) { 27 | var data interface{} 28 | 29 | buf := bytes.NewBufferString(raw) 30 | jsonDecoder := json.NewDecoder(buf) 31 | jsonDecoder.UseNumber() 32 | 33 | err = jsonDecoder.Decode(&data) 34 | 35 | if err != nil { 36 | return 37 | } 38 | 39 | tree.Populate(data) 40 | tree.Normalize() 41 | 42 | return 43 | } 44 | 45 | type TreeTestCase struct { 46 | Source string 47 | Tree Tree 48 | } 49 | 50 | func (tc TreeTestCase) TestTree(t *testing.T) { 51 | tree, err := Parse(tc.Source) 52 | 53 | if err != nil { 54 | t.Fatal(err) 55 | } 56 | 57 | if !reflect.DeepEqual(tree, tc.Tree) { 58 | t.Errorf("Expected: %+v Got: %#v", tc.Tree, tree) 59 | } 60 | 61 | formatted, err := tree.Format() 62 | if err != nil { 63 | t.Fatal(err) 64 | } 65 | 66 | t.Logf("%s\n", tc.Source) 67 | t.Logf("%s\n", string(formatted)) 68 | } 69 | 70 | func TestNil(t *testing.T) { 71 | testCases := []TreeTestCase{{`null`, Tree{Type: Interface}}} 72 | 73 | for _, testCase := range testCases { 74 | testCase.TestTree(t) 75 | } 76 | } 77 | 78 | func TestBool(t *testing.T) { 79 | testCases := []TreeTestCase{ 80 | {`true`, Tree{Type: Bool}}, 81 | {`false`, Tree{Type: Bool}}, 82 | } 83 | 84 | for _, testCase := range testCases { 85 | testCase.TestTree(t) 86 | } 87 | } 88 | 89 | func TestInt(t *testing.T) { 90 | testCases := []TreeTestCase{ 91 | {`-1`, Tree{Type: Int}}, 92 | {`0`, Tree{Type: Int}}, 93 | {`1`, Tree{Type: Int}}, 94 | {`42`, Tree{Type: Int}}, 95 | } 96 | 97 | for _, testCase := range testCases { 98 | testCase.TestTree(t) 99 | } 100 | } 101 | 102 | func TestFloat(t *testing.T) { 103 | testCases := []TreeTestCase{ 104 | {`-1.0`, Tree{Type: Float}}, 105 | {`0.0`, Tree{Type: Float}}, 106 | {`1.0`, Tree{Type: Float}}, 107 | {`42.0`, Tree{Type: Float}}, 108 | } 109 | 110 | for _, testCase := range testCases { 111 | testCase.TestTree(t) 112 | } 113 | } 114 | 115 | func TestString(t *testing.T) { 116 | testCases := []TreeTestCase{ 117 | {`""`, Tree{Type: String}}, 118 | {`"foo"`, Tree{Type: String}}, 119 | } 120 | 121 | for _, testCase := range testCases { 122 | testCase.TestTree(t) 123 | } 124 | } 125 | 126 | func TestBoolList(t *testing.T) { 127 | testCases := []TreeTestCase{ 128 | {`[true]`, Tree{Type: Bool, List: true}}, 129 | {`[false]`, Tree{Type: Bool, List: true}}, 130 | {`[true, false]`, Tree{Type: Bool, List: true}}, 131 | } 132 | 133 | for _, testCase := range testCases { 134 | testCase.TestTree(t) 135 | } 136 | } 137 | 138 | func TestIntList(t *testing.T) { 139 | testCases := []TreeTestCase{ 140 | {`[-1]`, Tree{Type: Int, List: true}}, 141 | {`[0]`, Tree{Type: Int, List: true}}, 142 | {`[1]`, Tree{Type: Int, List: true}}, 143 | {`[42]`, Tree{Type: Int, List: true}}, 144 | {`[-1, 0]`, Tree{Type: Int, List: true}}, 145 | {`[-1, 0, 1]`, Tree{Type: Int, List: true}}, 146 | {`[-1, 0, 1, 42]`, Tree{Type: Int, List: true}}, 147 | } 148 | 149 | for _, testCase := range testCases { 150 | testCase.TestTree(t) 151 | } 152 | } 153 | 154 | func TestFloatList(t *testing.T) { 155 | testCases := []TreeTestCase{ 156 | {`[-1.0]`, Tree{Type: Float, List: true}}, 157 | {`[0.0]`, Tree{Type: Float, List: true}}, 158 | {`[1.0]`, Tree{Type: Float, List: true}}, 159 | {`[42.0]`, Tree{Type: Float, List: true}}, 160 | {`[-1.0, 0.0]`, Tree{Type: Float, List: true}}, 161 | {`[-1.0, 0.0, 1.0]`, Tree{Type: Float, List: true}}, 162 | {`[-1.0, 0.0, 1.0, 42.0]`, Tree{Type: Float, List: true}}, 163 | {`[-1.0, 0.0, 1, 42]`, Tree{Type: Float, List: true}}, 164 | {`[-1, 0, 1.0, 42.0]`, Tree{Type: Float, List: true}}, 165 | } 166 | 167 | for _, testCase := range testCases { 168 | testCase.TestTree(t) 169 | } 170 | } 171 | 172 | func TestStringList(t *testing.T) { 173 | testCases := []TreeTestCase{ 174 | {`[""]`, Tree{Type: String, List: true}}, 175 | {`["foo"]`, Tree{Type: String, List: true}}, 176 | {`["", "foo"]`, Tree{Type: String, List: true}}, 177 | {`["foo", ""]`, Tree{Type: String, List: true}}, 178 | {`["foo", "bar"]`, Tree{Type: String, List: true}}, 179 | } 180 | 181 | for _, testCase := range testCases { 182 | testCase.TestTree(t) 183 | } 184 | } 185 | 186 | func TestHeterogeneousList(t *testing.T) { 187 | testCases := []TreeTestCase{ 188 | {`[true, false, 0, 1, 0.0, 1.0, "", "foo"]`, Tree{Type: Interface, List: true}}, 189 | } 190 | 191 | for _, testCase := range testCases { 192 | testCase.TestTree(t) 193 | } 194 | } 195 | 196 | func TestStruct(t *testing.T) { 197 | testCases := []TreeTestCase{ 198 | {`{}`, Tree{Type: Struct}}, 199 | {`{"nil":null}`, Tree{Type: Struct, Children: []*Tree{{Name: "nil", Type: Interface}}}}, 200 | {`{"bool":true}`, Tree{Type: Struct, Children: []*Tree{{Name: "bool", Type: Bool}}}}, 201 | {`{"int":1}`, Tree{Type: Struct, Children: []*Tree{{Name: "int", Type: Int}}}}, 202 | {`{"float":1.0}`, Tree{Type: Struct, Children: []*Tree{{Name: "float", Type: Float}}}}, 203 | {`{"string":"foo"}`, Tree{Type: Struct, Children: []*Tree{{Name: "string", Type: String}}}}, 204 | {`{"bool":[true,false]}`, Tree{Type: Struct, Children: []*Tree{{Name: "bool", Type: Bool, List: true}}}}, 205 | {`{"int":[0,1]}`, Tree{Type: Struct, Children: []*Tree{{Name: "int", Type: Int, List: true}}}}, 206 | {`{"float":[0.0,1.0]}`, Tree{Type: Struct, Children: []*Tree{{Name: "float", Type: Float, List: true}}}}, 207 | {`{"string":["","foo"]}`, Tree{Type: Struct, Children: []*Tree{{Name: "string", Type: String, List: true}}}}, 208 | {`{"heterogeneous":[true, false, 0, 1, 0.0, 1.0, "", "foo"]}`, 209 | Tree{Type: Struct, Children: []*Tree{{Name: "heterogeneous", Type: Interface, List: true}}}, 210 | }, 211 | } 212 | 213 | for _, testCase := range testCases { 214 | testCase.TestTree(t) 215 | } 216 | } 217 | 218 | func TestStructNormalize(t *testing.T) { 219 | testCases := []TreeTestCase{ 220 | {`[ 221 | { 222 | "bool":true, 223 | "int":1 224 | }, 225 | { 226 | "float":0.0, 227 | "string":"foo" 228 | } 229 | ]`, 230 | Tree{Type: Struct, List: true, Children: []*Tree{ 231 | {Name: "bool", Type: Bool}, 232 | {Name: "float", Type: Float}, 233 | {Name: "int", Type: Int}, 234 | {Name: "string", Type: String}, 235 | }}, 236 | }, 237 | {`[ 238 | { 239 | "bool":true, 240 | "int":1 241 | }, 242 | { 243 | "bool":true, 244 | "int":1, 245 | "float":0.0, 246 | "string":"foo" 247 | } 248 | ]`, 249 | Tree{Type: Struct, List: true, Children: []*Tree{ 250 | {Name: "bool", Type: Bool}, 251 | {Name: "float", Type: Float}, 252 | {Name: "int", Type: Int}, 253 | {Name: "string", Type: String}, 254 | }}, 255 | }, 256 | } 257 | 258 | for _, testCase := range testCases { 259 | testCase.TestTree(t) 260 | } 261 | } 262 | 263 | func TestStructConflict(t *testing.T) { 264 | testCases := []TreeTestCase{ 265 | {`[ 266 | { 267 | "bool":true, 268 | "int":1 269 | }, 270 | { 271 | "float":0.0, 272 | "string":"foo" 273 | }, 274 | { 275 | "float":true, 276 | "string":1 277 | } 278 | ]`, 279 | Tree{Type: Struct, List: true, Children: []*Tree{ 280 | {Name: "bool", Type: Bool}, 281 | {Name: "float", Type: Interface}, 282 | {Name: "int", Type: Int}, 283 | {Name: "string", Type: Interface}, 284 | }}, 285 | }, 286 | } 287 | 288 | for _, testCase := range testCases { 289 | testCase.TestTree(t) 290 | } 291 | } 292 | 293 | func (tc TreeTestCase) TestFormat(t *testing.T) { 294 | source, err := tc.Tree.Format() 295 | 296 | if err != nil { 297 | t.Fatal(err) 298 | } 299 | 300 | if string(source) != tc.Source { 301 | t.Errorf("Expected: %q Got: %q", tc.Source, source) 302 | } 303 | } 304 | 305 | func TestInterfaceFormat(t *testing.T) { 306 | TreeTestCase{"type _ interface{}\n", Tree{Type: Interface}}.TestFormat(t) 307 | TreeTestCase{"type _ []interface{}\n", Tree{Type: Interface, List: true}}.TestFormat(t) 308 | } 309 | 310 | func TestBoolFormat(t *testing.T) { 311 | TreeTestCase{"type _ bool\n", Tree{Type: Bool}}.TestFormat(t) 312 | TreeTestCase{"type _ []bool\n", Tree{Type: Bool, List: true}}.TestFormat(t) 313 | } 314 | 315 | func TestIntFormat(t *testing.T) { 316 | TreeTestCase{"type _ int64\n", Tree{Type: Int}}.TestFormat(t) 317 | TreeTestCase{"type _ []int64\n", Tree{Type: Int, List: true}}.TestFormat(t) 318 | } 319 | 320 | func TestFloatFormat(t *testing.T) { 321 | TreeTestCase{"type _ float64\n", Tree{Type: Float}}.TestFormat(t) 322 | TreeTestCase{"type _ []float64\n", Tree{Type: Float, List: true}}.TestFormat(t) 323 | } 324 | 325 | func TestStringFormat(t *testing.T) { 326 | TreeTestCase{"type _ string\n", Tree{Type: String}}.TestFormat(t) 327 | TreeTestCase{"type _ []string\n", Tree{Type: String, List: true}}.TestFormat(t) 328 | } 329 | 330 | func TestStructFormat(t *testing.T) { 331 | testCases := []TreeTestCase{ 332 | {"type _ struct {\n}\n", Tree{Type: Struct}}, 333 | {"type _ struct {\n\tInterface interface{} `json:\"interface\"`\n}\n", Tree{Type: Struct, Children: []*Tree{{Name: "interface", Type: Interface}}}}, 334 | {"type _ struct {\n\tBool bool `json:\"bool\"`\n}\n", Tree{Type: Struct, Children: []*Tree{{Name: "bool", Type: Bool}}}}, 335 | {"type _ struct {\n\tInt int64 `json:\"int\"`\n}\n", Tree{Type: Struct, Children: []*Tree{{Name: "int", Type: Int}}}}, 336 | {"type _ struct {\n\tFloat float64 `json:\"float\"`\n}\n", Tree{Type: Struct, Children: []*Tree{{Name: "float", Type: Float}}}}, 337 | {"type _ struct {\n\tString string `json:\"string\"`\n}\n", Tree{Type: Struct, Children: []*Tree{{Name: "string", Type: String}}}}, 338 | {"type _ struct {\n\tInterface []interface{} `json:\"interface\"`\n}\n", Tree{Type: Struct, Children: []*Tree{{Name: "interface", Type: Interface, List: true}}}}, 339 | {"type _ struct {\n\tBool []bool `json:\"bool\"`\n}\n", Tree{Type: Struct, Children: []*Tree{{Name: "bool", Type: Bool, List: true}}}}, 340 | {"type _ struct {\n\tInt []int64 `json:\"int\"`\n}\n", Tree{Type: Struct, Children: []*Tree{{Name: "int", Type: Int, List: true}}}}, 341 | {"type _ struct {\n\tFloat []float64 `json:\"float\"`\n}\n", Tree{Type: Struct, Children: []*Tree{{Name: "float", Type: Float, List: true}}}}, 342 | {"type _ struct {\n\tString []string `json:\"string\"`\n}\n", Tree{Type: Struct, Children: []*Tree{{Name: "string", Type: String, List: true}}}}, 343 | } 344 | 345 | for _, testCase := range testCases { 346 | testCase.TestFormat(t) 347 | } 348 | } 349 | 350 | type SanitizerTestCase struct { 351 | Source, Sanitized string 352 | TitleCase bool 353 | } 354 | 355 | func TestSanitizier(t *testing.T) { 356 | testCases := []SanitizerTestCase{ 357 | {"Sanitary", "Sanitary", true}, 358 | {"sanitary", "Sanitary", true}, 359 | {"_Sanitary", "Sanitary", true}, 360 | {"_sanitary", "Sanitary", true}, 361 | {"Sanitary", "Sanitary", false}, 362 | {"sanitary", "Sanitary", false}, 363 | {"_Sanitary", "Sanitary", false}, 364 | {"_sanitary", "Sanitary", false}, 365 | 366 | {"titlecase", "Titlecase", true}, 367 | {"title-case", "TitleCase", true}, 368 | {"title_case", "TitleCase", true}, 369 | {"title case", "TitleCase", true}, 370 | {"titlecase", "Titlecase", false}, 371 | {"title-case", "Title_case", false}, 372 | {"title_case", "Title_case", false}, 373 | {"title case", "TitleCase", false}, 374 | 375 | {"123", "_", true}, 376 | {"123.foo", "Foo", true}, 377 | {".foo123", "Foo123", true}, 378 | {".foo.123", "Foo123", true}, 379 | } 380 | 381 | for _, testCase := range testCases { 382 | sanitized := Ident(testCase.Source) 383 | config.titleCase = testCase.TitleCase 384 | if testCase.Sanitized != sanitized.String() { 385 | t.Fatalf("Source: %q Expected: %q Got: %q\n", testCase.Source, testCase.Sanitized, sanitized.String()) 386 | } 387 | } 388 | } 389 | -------------------------------------------------------------------------------- /test.json: -------------------------------------------------------------------------------- 1 | { 2 | "nil": null, 3 | "bool": true, 4 | "int": 1, 5 | "float": 1.0, 6 | "string": "foo", 7 | "struct": { 8 | "nil": null, 9 | "bool": true, 10 | "int": 1, 11 | "float": 1.0, 12 | "string": "foo" 13 | }, 14 | 15 | "nillist": [null,null], 16 | "boollist": [true,false], 17 | "intlist": [-1,0,1], 18 | "floatlist": [-1.0,0.0,1.0], 19 | "stringlist": ["", "foo", "bar"], 20 | "structlist": [ 21 | { 22 | "bool": true, 23 | "int": 0, 24 | "float": 0.0, 25 | "string": "foo" 26 | }, 27 | { 28 | "bool": false, 29 | "int": 1, 30 | "float": 1.0, 31 | "string": "bar" 32 | } 33 | ], 34 | 35 | "structlistsquash": [ 36 | { 37 | "bool": true, 38 | "int": 1 39 | }, 40 | { 41 | "float": 1.0, 42 | "string": "foo" 43 | } 44 | ], 45 | 46 | "structlistsquashconflict": [ 47 | { 48 | "bool": true, 49 | "int": 1, 50 | "conflict": true 51 | }, 52 | { 53 | "float": 1.0, 54 | "string": "foo", 55 | "conflict": 1 56 | } 57 | ], 58 | "heterogeneouslist": [true, false, 0, 1, 0.0, 1.0, "", "foo", "bar"], 59 | 60 | "Sanitary": "", 61 | "_Sanitary": "", 62 | "Sanitary0": "", 63 | "0Unsanitary": "", 64 | "123": "", 65 | 66 | "title case": "", 67 | "title-case": "", 68 | "title_case": "", 69 | "titlecase": "" 70 | } --------------------------------------------------------------------------------