Add MapFromStringExt

.file/dir1/dir1_1/file_10.json

@@ -0,0 +1 @@
+file_10.json

.gitignore

@@ -16,11 +16,14 @@
 
 !README.md
 !LICENSE
+!COPYING
 
 !Makefile
 
 !*.sh
 !*.md
 
+!*.json
+
 # ...even if they are in subdirectories
 !*/

COPYING

@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<https://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<https://www.gnu.org/licenses/why-not-lgpl.html>.

LICENSE

@@ -0,0 +1,18 @@
+/*
+ * Copyright (C) 2026 Volts & Amps Batteries
+ *
+ * This file is part of boxtep.
+ *
+ * This library is free software: you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public License
+ * as published by the Free Software Foundation, either version 3
+ * of the License, or (at your option) any later version.
+ *
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU Lesser General Public License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public License
+ * along with this library. If not, see <https://www.gnu.org/licenses/>.
+ */

README.md

@@ -0,0 +1,3 @@
+This project is licensed under the GNU Lesser General Public License v3.0.
+You may use this library in proprietary applications, provided that
+modifications to the library itself remain open source.

assert.go

@@ -0,0 +1,20 @@
+package commons
+
+import (
+	"testing"
+	"bytes"
+	
+	"go.mongodb.org/mongo-driver/v2/bson"
+)
+
+// AssertDeepEqual compares equality by comparing bytes.
+func AssertDeepEqual(t *testing.T, expected, actual any) {
+	t.Helper()
+
+	expJSON, _ := bson.MarshalExtJSON(expected, true, true)
+	actJSON, _ := bson.MarshalExtJSON(actual, true, true)
+
+	if !bytes.Equal(expJSON, actJSON) {
+	    t.Fatalf("expected %s, got %s", expJSON, actJSON)
+	}
+}

check_valid.go

@@ -3,16 +3,19 @@ package commons
 import (
 	"encoding/json"
 	"log"
-
+		
 	"github.com/ianlancetaylor/jsonschema"
 	"github.com/ianlancetaylor/jsonschema/draft7"
 )
 
 func Validate(schema string, dataAny any) error {
-	data := StructToMapRecursive(dataAny)
+	data1 := StructToMapRecursive(dataAny)
+	data := BsonAnyToMap(data1)
+
+	content := []byte(schema)
 
 	var v any
-	if err := json.Unmarshal([]byte(schema), &v); err != nil {
+	if err := json.Unmarshal(content, &v); err != nil {
 		log.Printf("Failed to decode json %#v", err)
 
 		return err
@@ -20,6 +23,7 @@ func Validate(schema string, dataAny any) error {
 
 	vldtor, err := jsonschema.SchemaFromJSON(draft7.SchemaID, nil, v)
 	if err != nil {
+		log.Printf("Failed to load schema %v", err)
 		return err
 	}
 
@@ -27,8 +31,10 @@ func Validate(schema string, dataAny any) error {
 	valid := vldtor.Validate(data)
 
 	if valid != nil {
+		log.Printf("Invalid json: %v", valid)
+				
 		return valid
 	}
 
 	return nil
-}
+}

check_valid_test.go

@@ -44,3 +44,4 @@ func TestPassingValidate (t *testing.T) {
 		t.Fatal("Should have not thrown an error")
 	}
 }
+

context.go

@@ -0,0 +1,26 @@
+package commons
+
+import "context"
+
+func ContextSerialize(ctx context.Context, fields []string) map[string]any {
+	m := map[string]any{}
+	for _, name := range fields {
+		vAny := ctx.Value(name)
+		v, ok := vAny.(string)
+		if ok {
+			m[name] = v
+		}
+	}
+
+	return m
+}
+
+func ContextFromMap(m map[string]any) context.Context {
+	ctx := context.Background()
+
+	for k, v := range m {
+		ctx = context.WithValue(ctx, k, v)
+	}
+
+	return ctx
+}

escape.go

@@ -0,0 +1,10 @@
+package commons
+
+const EscapeGreen = "\033[32m"
+const EscapeRed = "\033[31m"
+const EscapeYellow = "\033[33m"
+const EscapeBlue = "\033[34m"
+const EscapeMagenta = "\033[35m"
+const EscapeCyan = "\033[36m"
+const EscapeDim = "\033[2m"
+const EscapeReset = "\033[0m"

file.go

@@ -0,0 +1,49 @@
+package commons
+
+import (
+	"log"
+	"os"
+	"strings"
+	"path/filepath"
+)
+
+// FileDeepScan will scan dir recursively and append any files found to files.
+func FileDeepScan(dir string, files *[]string) {
+  entries, err := os.ReadDir(dir)
+	if err != nil {
+		log.Printf("Failed to read %v", err)
+		return
+	}
+
+	for _, entry := range entries {
+		fullPath := filepath.Join(dir, entry.Name())
+    if entry.IsDir() {
+      FileDeepScan(fullPath, files)
+    } else {
+    	*files = append(*files, filepath.Join(dir, entry.Name()))
+    }
+  }
+}
+
+type WorkspaceInfo struct {
+	ParentDir string
+}
+
+// FileWorkspaceInfo given a file will return relevant information about 
+// its location, such as its parent directory.
+func FileWorkspaceInfo(file string) *WorkspaceInfo {
+	// 1. break down file
+	clean := filepath.Clean(file)
+	parts := strings.Split(clean, string(filepath.Separator))
+
+	l := len(parts)
+
+	if l > 3 {
+		parentDir := parts[l - 2]
+		return &WorkspaceInfo {
+			ParentDir: parentDir,
+		}
+	}
+
+	return nil
+}

file_test.go

@@ -0,0 +1,40 @@
+package commons
+
+import (
+	"testing"
+	"slices"
+
+	"path/filepath"
+)
+
+func TestFileWorkspaceInfo(t *testing.T) {
+	abs, err := filepath.Abs(".file/dir1/file1.json")
+	if err != nil {
+		t.Fatalf("%v", err)
+	}
+
+	w := FileWorkspaceInfo(abs)
+	if w == nil {
+		t.Fatal("should have returned")
+	}
+
+	if w.ParentDir != "dir1" {
+		t.Fatalf("invalid parent dir %v", w)
+	}
+}
+
+func TestFileDeepScan(t *testing.T) {
+	files := make([]string, 0)
+
+	FileDeepScan(".file", &files)
+
+	l := len(files)
+
+	if l != 2 {
+		t.Fatalf("Should have found %d files", l)
+	}
+
+	if !slices.Contains(files, ".file/dir1/file1.json") {
+		t.Fatal("Should have found file1.json")
+	}
+}

go.mod

@@ -3,6 +3,9 @@ module git.gsuntres.com/general/commons
 go 1.25.0
 
 require (
+	github.com/go-viper/mapstructure/v2 v2.5.0
 	github.com/ianlancetaylor/jsonschema v0.0.0-20251021232724-46ecbf32a0a5
+	github.com/sergi/go-diff v1.4.0
 	go.mongodb.org/mongo-driver/v2 v2.5.0
+	golang.org/x/text v0.30.0
 )

go.sum

@@ -1,8 +1,28 @@
+github.com/davecgh/go-spew v1.1.0/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=
 github.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c=
 github.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=
+github.com/go-viper/mapstructure/v2 v2.5.0 h1:vM5IJoUAy3d7zRSVtIwQgBj7BiWtMPfmPEgAXnvj1Ro=
+github.com/go-viper/mapstructure/v2 v2.5.0/go.mod h1:oJDH3BJKyqBA2TXFhDsKDGDTlndYOZ6rGS0BRZIxGhM=
 github.com/google/go-cmp v0.6.0 h1:ofyhxvXcZhMsU5ulbFiLKl/XBFqE1GSq7atu8tAmTRI=
 github.com/google/go-cmp v0.6.0/go.mod h1:17dUlkBOakJ0+DkrSSNjCkIjxS6bF9zb3elmeNGIjoY=
 github.com/ianlancetaylor/jsonschema v0.0.0-20251021232724-46ecbf32a0a5 h1:x2QxKV4w/sBEwwUUmBH/8cFjeOBZqwaB5dz5rcuFspU=
 github.com/ianlancetaylor/jsonschema v0.0.0-20251021232724-46ecbf32a0a5/go.mod h1:KtN3dTgXsLnC5GJBRNmOPd/HUInNcQ84lUCrKJPrvDc=
+github.com/kr/pretty v0.1.0/go.mod h1:dAy3ld7l9f0ibDNOQOHHMYYIIbhfbHSm3C4ZsoJORNo=
+github.com/kr/pty v1.1.1/go.mod h1:pFQYn66WHrOpPYNljwOMqo10TkYh1fy3cYio2l3bCsQ=
+github.com/kr/text v0.1.0/go.mod h1:4Jbv+DJW3UT/LiOwJeYQe1efqtUx/iVham/4vfdArNI=
+github.com/pmezard/go-difflib v1.0.0 h1:4DBwDE0NGyQoBHbLQYPwSUPoCMWR5BEzIk/f1lZbAQM=
+github.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4=
+github.com/sergi/go-diff v1.4.0 h1:n/SP9D5ad1fORl+llWyN+D6qoUETXNZARKjyY2/KVCw=
+github.com/sergi/go-diff v1.4.0/go.mod h1:A0bzQcvG0E7Rwjx0REVgAGH58e96+X0MeOfepqsbeW4=
+github.com/stretchr/objx v0.1.0/go.mod h1:HFkY916IF+rwdDfMAkV7OtwuqBVzrE8GR6GFx+wExME=
+github.com/stretchr/testify v1.4.0 h1:2E4SXV/wtOkTonXsotYi4li6zVWxYlZuYNCXe9XRJyk=
+github.com/stretchr/testify v1.4.0/go.mod h1:j7eGeouHqKxXV5pUuKE4zz7dFj8WfuZ+81PSLYec5m4=
 go.mongodb.org/mongo-driver/v2 v2.5.0 h1:yXUhImUjjAInNcpTcAlPHiT7bIXhshCTL3jVBkF3xaE=
 go.mongodb.org/mongo-driver/v2 v2.5.0/go.mod h1:yOI9kBsufol30iFsl1slpdq1I0eHPzybRWdyYUs8K/0=
+golang.org/x/text v0.30.0 h1:yznKA/E9zq54KzlzBEAWn1NXSQ8DIp/NYMy88xJjl4k=
+golang.org/x/text v0.30.0/go.mod h1:yDdHFIX9t+tORqspjENWgzaCVXgk0yYnYuSZ8UzzBVM=
+gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
+gopkg.in/check.v1 v1.0.0-20190902080502-41f04d3bba15/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
+gopkg.in/yaml.v2 v2.2.2/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=
+gopkg.in/yaml.v2 v2.4.0 h1:D8xgwECY7CYvx+Y2n4sBz93Jn9JRvxdiyyo8CTfuKaY=
+gopkg.in/yaml.v2 v2.4.0/go.mod h1:RDklbk79AGWmwhnvt/jBztapEOGDOx6ZbXqjP6csGnQ=

json.go

@@ -0,0 +1,76 @@
+package commons
+
+import (
+	"log"
+	"reflect"
+	"encoding/json"
+)
+
+func JsonSprintError(err error, content []byte) (error, string) {
+	if syntaxErr, ok := err.(*json.SyntaxError); ok {
+		totalLen := int64(len(content))
+		
+		min := MathMin(int64(50), syntaxErr.Offset)
+
+		from := MathMax(syntaxErr.Offset - min, 0)
+		to := MathMin(syntaxErr.Offset + min, totalLen)
+
+		sliceBuf := content[from:to]
+
+		return err, string(sliceBuf)
+	} else {
+		
+		return err, ""
+	}
+}
+
+func JsonPrintError(err error, content []byte) {
+	e, s := JsonSprintError(err, content)
+	
+	log.Printf("Failed to unmarshal %#v \n %s", e, s)
+} 
+
+// JsonEqual check if two json string representations are equal.
+func JsonEqual(a, b string) bool {
+	var o1 any
+	var o2 any
+
+	if err := json.Unmarshal([]byte(a), &o1); err != nil {
+		return false
+	}
+
+	if err := json.Unmarshal([]byte(b), &o2); err != nil {
+		return false
+	}
+
+	return reflect.DeepEqual(o1, o2)
+}
+
+// JsonPrint bson.M
+func JsonSprint(a any) string {
+	raw, err := json.Marshal(a)
+	if err != nil {
+		log.Printf("Failed to read json: %s", err)
+
+		return ""
+	}
+
+	return string(raw)	
+}
+
+func JsonPrint(a any) {
+	log.Printf("%s", JsonSprint(a))
+}
+
+func JsonToMap(s string) (map[string]any, error) {
+	b := []byte(s)
+
+	var schema map[string]any
+	if err := json.Unmarshal(b, &schema); err != nil {
+		log.Printf("Failed to parse json: %v", err)
+
+		return nil, err
+	}
+
+	return schema, nil
+}

json_test.go

@@ -0,0 +1,96 @@
+package commons
+
+import (
+	"log"
+	"fmt"
+	"bytes"
+	"encoding/json"
+	"testing"	
+)
+
+func TestJsonPrintError(t *testing.T) {
+
+	jsonstr := `
+	{
+		"name": "George",
+		"age": 87,
+		active": "false",
+		"properties": {
+			"one": "two",
+			"three": "four"
+		}
+	}
+	`
+
+	var buf bytes.Buffer
+	log.SetOutput(&buf)
+
+	content := []byte(jsonstr)
+	var data map[string]any
+	
+	err := json.Unmarshal(content, &data)
+
+	JsonPrintError(err, content)
+
+	errOut := fmt.Sprintf("%s", buf.String())
+
+	if errOut == "" {
+		t.Fatal("should have printed the error")
+	}
+} 
+
+func TestJsonSprintError(t *testing.T) {
+	jsonstr := `
+	{
+		"name": "George",
+		"age": 87,
+		active": "false",
+		"properties": {
+			"one": "two",
+			"three": "four"
+		}
+	}
+	`
+
+	var buf bytes.Buffer
+	log.SetOutput(&buf)
+
+	content := []byte(jsonstr)
+	var data map[string]any
+	
+	err := json.Unmarshal(content, &data)
+
+	_, s := JsonSprintError(err, content)
+
+	if s == "" {
+		t.Fatal("should have printed the error")
+	}
+}
+
+func TestJsonPrint(t *testing.T) {
+	m := map[string]any{
+		"name": "George",
+		"age": 87,
+		"active": false,
+		"properties": map[string]any{
+			"one": "two",
+			"three": "four",
+		},
+	}
+
+	var buf bytes.Buffer
+	log.SetFlags(0)
+	log.SetOutput(&buf)
+
+	JsonPrint(m)
+
+	out := fmt.Sprintf("%s", buf.String())
+
+	expected := `{"active":false,"age":87,"name":"George","properties":{"one":"two","three":"four"}}`
+
+  missing := StringMissing(expected, out)
+
+	if missing != "" {
+		t.Fatalf("Not expected %s", missing)
+	}
+}

math.go

@@ -9,3 +9,13 @@ func MathMin[T ~int | ~int8 | ~int16 | ~int32 | ~int64 |
 	}
 	return b
 }
+
+// MathMax will compare two integers and return the one with the smaller value.
+func MathMax[T ~int | ~int8 | ~int16 | ~int32 | ~int64 |
+         ~uint | ~uint8 | ~uint16 | ~uint32 | ~uint64 | ~uintptr |
+         ~float32 | ~float64 | ~string](a, b T) T {
+	if a > b {
+		return a
+	}
+	return b
+}

string_test.go

@@ -4,6 +4,26 @@ import (
   "testing"
 )
 
+func TestStringTitleCamel(t *testing.T) {
+  v := "actionObject"
+
+  vv := StringTitle(v)
+
+  if vv != "ActionObject" {
+    t.Fatalf("Failed to capitalize %s", vv)
+  }
+}
+
+func TestStringTitle(t *testing.T) {
+  v := "string to make title"
+
+  vv := StringTitle(v)
+
+  if vv != "String To Make Title" {
+    t.Fatalf("Failed to capitalize %s", vv)
+  }
+}
+
 func TestStringNormalize(t *testing.T) {
   v := "    some text     here   "
 

strings.go

@@ -3,10 +3,21 @@ package commons
 import (
 	"regexp"
 	"strings"
+
+	"golang.org/x/text/cases"
+	"golang.org/x/text/language"
+
+	"github.com/sergi/go-diff/diffmatchpatch"
 )
 
+var caserTitle cases.Caser = cases.Title(language.English, cases.NoLower)
+
 var whitespace = regexp.MustCompile(`\s+`)
 
+func StringTitle(s string) string {
+	return caserTitle.String(s)
+}
+
 // StringNormalize will replace arbitrary lengths of consecutive white space with a single one.
 func StringNormalize(s string) string {
 	s = whitespace.ReplaceAllString(s, " ")
@@ -23,3 +34,19 @@ func StringIsBlank(s string) bool {
 func StringIsNotBlank(s string) bool {
   return !StringIsBlank(s)
 }
+
+
+func StringMissing(a, b string) string {
+	dmp := diffmatchpatch.New()
+  diffs := dmp.DiffMain(a, b, false)
+
+  var missing string
+
+  for _, d := range diffs {
+    if d.Type == diffmatchpatch.DiffDelete {
+      missing += d.Text
+    }
+  }
+
+  return missing
+}

struct.go

@@ -4,10 +4,126 @@ import (
 	"log"
 	"reflect"
 	"strings"
-	
+	"bytes"
+	"encoding/json"
+
+	"github.com/go-viper/mapstructure/v2"
 	"go.mongodb.org/mongo-driver/v2/bson"
 )
 
+// StructHasStringValue given any struct will check if the requested property has
+// a non-blank value.
+func StructHasStringValue(o any, field string) bool {
+	v := reflect.ValueOf(o).Elem().FieldByName(field)
+
+	return v.String() != ""
+}
+
+// StructHasNotStringValue given any struct will check if the requested property has
+// a blank value.
+func StructHasNotStringValue(o any, field string) bool {
+	return !StructHasStringValue(o, field)
+}
+
+// StructHasProperty cheks if a struct has the requested property.
+func StructHasProperty(value interface{}, name string) bool {
+	vo := reflect.ValueOf(value).Elem()
+	
+	typeOfValue := vo.Type()
+
+	has := false
+	
+	for i:= 0; i < vo.NumField(); i++ {
+		if typeOfValue.Field(i).Name == name {
+			has = true
+			break
+		}
+	}
+
+	return has
+}
+
+func MapOmit[K comparable, V any](m map[K]V, keys ...K) map[K]V {
+	out := make(map[K]V, len(m))
+
+	omit := make(map[K]struct{}, len(keys))
+	for _, k := range keys {
+		omit[k] = struct{}{}
+	}
+
+	for k, v := range m {
+		if _, ok := omit[k]; !ok {
+			out[k] = v
+		}
+	}
+
+	return out
+}
+
+// MapMerge merges maps into one.
+func MapMerge[T ~map[string]any](maps...T) T {
+	out := make(T)
+
+	for _, m := range maps {
+		if m != nil {
+			for k, v := range m {
+				out[k] = v
+			}	
+		}		
+	}
+
+	return out
+}
+
+// StructMustTomap given any struct return the equivalent map[string]any or nil.
+// Will never throw. Will also work for map[string]any.
+func StructMustToMap(data any) map[string]any {
+	b, err := json.Marshal(data)
+	if err != nil {
+		log.Printf("Failed marshal %v", err)
+
+		return nil
+	}
+
+	dec := json.NewDecoder(bytes.NewReader(b))
+	dec.UseNumber()
+
+	var res map[string]any
+	err = dec.Decode(&res)
+	if err != nil {
+		log.Printf("Failed to unmarshal %v", err)
+
+		return nil
+	}
+
+	return res
+}
+
+// StructSetValue will update the value of the given field of struct o.
+func StructSetValue(o any, field string, value any) {
+	ref := reflect.ValueOf(o).Elem()
+
+  if ref.Kind() == reflect.Ptr {
+    ref = reflect.Indirect(ref)
+	}
+
+	if ref.Kind() == reflect.Interface {
+    ref = ref.Elem()
+	}
+
+	if ref.Kind() == reflect.Struct {
+		f := ref.FieldByName(field)
+
+		if f.IsValid() && f.CanSet() {
+			f.Set(reflect.ValueOf(value))
+		}
+	}
+}
+
+func StructToStruct(source any, target any) {
+	mapstructure.Decode(source, &target)
+}
+
 // StructToMapRecursive given a struct or a primitive will return the equivalent
 // map[string]any of the struct or the primitive as is.
 func StructToMapRecursive(obj any) any {
@@ -48,8 +164,112 @@ func StructToMapRecursive(obj any) any {
 	}
 }
 
-// MapToStruct will convert a map[string]any to a struct.
-func MapToStruct(m map[string]any, o any) error {
+func BsonClone(m map[string]any) map[string]any {
+	if m == nil {
+		return nil
+	}
+
+	out := make(map[string]any, len(m))
+
+	for k, v := range m {
+		out[k] = deepCopy(v)
+	}
+
+	return out
+}
+
+func deepCopy(v any) any {
+	switch val := v.(type) {
+	case bson.M:
+		return BsonClone(map[string]any(val))
+	case bson.A:
+		arr := make([]any, len(val))
+		for i, item := range val {
+			arr[i] = deepCopy(item)
+		}
+		return arr
+	case bson.D:
+		d := make(bson.D, len(val))
+		for i, elem := range val {
+			d[i] = bson.E{
+				Key:   elem.Key,
+				Value: deepCopy(elem.Value),
+			}
+		}
+		return d
+	case map[string]any: // bson.M
+		return BsonClone(val)
+	case []any: // bson.A
+		arr := make([]any, len(val))
+		for i, item := range val {
+			arr[i] = deepCopy(item)
+		}
+		return arr
+
+	default:
+		// primitives (string, int, bool, etc.)
+		return val
+	}
+}
+
+func BsonDFromSlice(in [][]any) bson.D {
+	if in == nil {
+		return bson.D{}
+	}
+
+	var doc bson.D
+
+  for _, pair := range in {
+      if len(pair) != 2 {
+          continue
+      }
+
+      key, ok := pair[0].(string)
+      if !ok {
+          continue // or error
+      }
+
+      doc = append(doc, bson.E{
+          Key:   key,
+          Value: pair[1], // already `any`
+      })
+  }
+
+  return doc
+}
+
+func BsonDGetAny(d bson.D, key string) (any, bool) {
+	for _, e := range d {
+		if e.Key == key {
+			return e.Value, true
+		}
+	}
+
+	return nil, false
+}
+
+func BsonDGet[T any](d bson.D, key string) (T, bool) {
+	var zero T
+
+	for _, e := range d {
+		if e.Key == key {
+			val, ok := e.Value.(T)
+			if !ok {
+				return zero, false
+			}
+
+			return val, true
+		}
+	}
+
+	return zero, false
+}
+
+func BsonDGetString(d bson.D, key string) (string, bool) {
+	return BsonDGet[string](d, key)
+}
+
+func BsonToStruct(m bson.M, o any) error {
 	b, err := bson.Marshal(m)
 	if err != nil {
 		log.Printf("Failed marshal %v", err)
@@ -67,6 +287,136 @@ func MapToStruct(m map[string]any, o any) error {
 	return nil
 }
 
+// MapToStruct will convert a map[string]any to a struct.
+func MapToStruct(m map[string]any, o any) error {
+	b, err := json.Marshal(m)
+	if err != nil {
+		log.Printf("Failed marshal %v", err)
+
+		return err
+	}
+
+	err = json.Unmarshal(b, o)
+	if err != nil {
+		log.Printf("Failed to unmarshal %v", err)
+
+		return err
+	}
+
+	return nil
+}
+
+func BsonAnyToMap(v any) any {
+	switch v.(type) {
+	case bson.D:
+		m := map[string]any{}
+		val := v.(bson.D)
+		for _, elem := range val {
+			m[elem.Key] = BsonAnyToMap(elem.Value)
+		}
+		return m
+
+	case bson.M:
+		m := map[string]any{}
+		val := v.(bson.M)
+		for k, v2 := range val {
+			m[k] = BsonAnyToMap(v2)
+		}
+		return m
+	case map[string]any:
+		m := map[string]any{}
+		val := v.(map[string]any)
+		for i, v2 := range val {
+			m[i] = BsonAnyToMap(v2)
+		}
+		return m
+	case bson.A:
+		val := v.(bson.A)
+		arr := make([]any, len(val))
+		for i, v2 := range val {
+			arr[i] = BsonAnyToMap(v2)
+		}
+		return arr
+
+	default:
+		return v
+	}
+
+	return v
+}
+
+func BsonToMap(b bson.M) map[string]any {
+	result := map[string]any{}
+
+	for k, v := range b {
+		switch val := v.(type) {
+		case bson.M:
+			result[k] = BsonToMap(val)
+		case []interface{}:
+			arr := make([]any, len(val))
+			for i, item := range val {
+				if nested, ok := item.(bson.M); ok {
+					arr[i] = BsonToMap(nested)
+				} else {
+					arr[i] = item
+				}
+			}
+			result[k] = arr
+		default:
+			result[k] = val
+		}
+	}
+
+	return result
+}
+
+type WrapA struct {
+	Items []map[string]any
+}
+
+// BsonAToSlice will convert a bson.A to []map[string]any.
+func BsonAToSlice(m any) ([]map[string]any, error) {
+
+	v := bson.M{
+		"items": m.(bson.A),
+	}
+
+	b, err := bson.Marshal(v)
+	if err != nil {
+		log.Printf("Failed marshal %v", err)
+
+		return nil, err
+	}
+
+	var o WrapA
+	err = bson.Unmarshal(b, &o)
+	if err != nil {
+		log.Printf("Failed to unmarshal %v", err)
+
+		return nil, err
+	}
+
+	return o.Items, nil
+}
+
+func MapFromString(s string) (map[string]any, error) {
+	var b map[string]any
+	if err := bson.Unmarshal([]byte(s), &b); err != nil {
+		return nil, err
+	}
+
+	return b, nil
+}
+
+func MapFromStringExt(s string) (map[string]any, error) {
+	var b map[string]any
+	if err := bson.UnmarshalExtJSON([]byte(s), true, &b); err != nil {
+		return nil, err
+	}
+
+	return b, nil
+}
+
 // MapIsSubset given two map[string]any m1 and m2 will determine if m1 is a subset of m2.
 // Only fields' name is evaluated not their values.
 func MapIsSubset(subset, superset any) bool {
@@ -172,3 +522,60 @@ func StructCopyMatching(source, target any) {
     }
   }
 }
+
+// GetWithDefault
+func GetWithDefault(m map[string]any, path string, def any) any {
+	keys := strings.Split(path, ".")
+
+	var current any = m
+
+	for _, k := range keys {
+		if m2, ok := current.(map[string]any); ok {
+			if val, exists := m2[k]; exists {
+				current = val
+			} else {
+				return def
+			}
+		} else {
+			return def
+		}
+	}
+
+	return current
+}
+
+func GetStringWithDefault(m map[string]any, path, def string) string {
+	a := GetWithDefault(m, path, def)
+
+	return a.(string)
+}
+
+func GetString(m map[string]any, path string) string {
+	a := Get(m, path)
+
+	if a == nil {
+		return ""
+	} else {
+		return a.(string)	
+	}	
+}
+
+func Get(m map[string]any, path string) any {
+	keys := strings.Split(path, ".")
+
+	var current any = m
+
+	for _, k := range keys {
+		if m2, ok := current.(map[string]any); ok {
+			if val, exists := m2[k]; exists {
+				current = val
+			} else {
+				return nil
+			}
+		} else {
+			return nil
+		}
+	}
+
+	return current
+}

struct_test.go

@@ -1,9 +1,86 @@
 package commons
 
 import (
+  "fmt"
   "testing"
+
+  "go.mongodb.org/mongo-driver/v2/bson"
 )
 
+func TestBsonDFromSlice(t *testing.T) {
+  in := [][]any{
+    {"first", -1},
+    {"second", 1},
+  }
+
+  d := BsonDFromSlice(in)
+
+  expected := bson.D{
+    {Key: "first", Value: -1},
+    {Key: "second", Value: 1},
+  }
+
+  AssertDeepEqual(t, d, expected)
+}
+
+func TestStructHasProperty(t *testing.T) {
+  type O struct {
+    Name string
+    Age int
+  }
+
+  o := &O{
+    Name: "Nick",
+    Age: 15,
+  }
+
+  if !StructHasProperty(o, "Name") {
+    t.Fatal("Should have property name")
+  }
+}
+
+func TestStructSetValue(t *testing.T) {
+  type O struct {
+    Name string
+    Age int
+    Active bool
+  }
+
+  o := &O{
+    Name: "Nick",
+    Age: 15,
+    Active: true,
+  }
+
+  StructSetValue(o, "Name", "George")
+
+  if o.Name != "George" {
+    t.Fatalf("Name should have been George not %s", o.Name)
+  }
+}
+
+func TestStructToStruct(t *testing.T) {
+  type O struct {
+    Name string
+    Age int
+    Active bool
+  }
+
+  o := &O{
+    Name: "Nick",
+    Age: 15,
+    Active: true,
+  }
+
+  var oo O
+
+  StructToStruct(o, &oo)
+
+  if oo.Name != "Nick" || oo.Age != 15 || !oo.Active {
+    t.Fatalf("failed to copy %v", oo)
+  }
+}
+
 func TestStructToMapRecursive(t *testing.T) {
   type O struct {
     Name string
@@ -36,8 +113,6 @@ func TestStructToMapRecursive(t *testing.T) {
     default:
       t.Fatal("is not map")
   }
-
-
 }
 
 func TestMapToStruct(t *testing.T) {
@@ -209,7 +284,6 @@ func TestStructHasBsonName_False(t *testing.T) {
 }
 
 func TestCopyMatching(t *testing.T) {
-
   type O struct {
     Name string
     Age int
@@ -235,5 +309,48 @@ func TestCopyMatching(t *testing.T) {
   if to.Name != "Nick" && to.Age != 15 && to.Active != true {
     t.Fatalf("Failed to copy matching fields to %v", to)
   }
-
 }
+
+func TestMapMerge(t *testing.T) {
+  m1 := map[string]any{
+    "a": "va",
+    "b": "vb",
+  }
+  m2 := map[string]any{
+    "c": "vc",
+    "d": "vd",
+  }
+
+  m := MapMerge(m1, m2)
+
+  if len(m) != 4 {
+    t.Fatalf("Merged map should have lenght 4 not %d", len(m))
+  }
+}
+
+func TestBsonClone(t *testing.T) {
+  orig := map[string]any{
+    "name": "Kolias",
+    "age": int32(56),
+    "salary": int64(100000000),
+    "meta": map[string]any{
+      "num1": int32(110),
+    },
+  }
+
+  clone := BsonClone(orig)
+
+  if "int32" != fmt.Sprintf("%T", clone["age"]) {
+    t.Fatalf("int32 should map to int32")
+  }
+
+  if "int64" != fmt.Sprintf("%T", clone["salary"]) {
+    t.Fatalf("int64 should map to int64")
+  }
+
+  meta := clone["meta"].(map[string]any)
+
+  if "int32" != fmt.Sprintf("%T", meta["num1"]) {
+    t.Fatalf("netsted type should have been int32")
+  }
+}