Merge pull request 'Added Bitwise Operations' (#2) from dev into master

Reviewed-on: #2

.gitignore

@@ -1,3 +1,11 @@
 desktop.ini
 
-elm-stuff/*
+elm-stuff/*
+out/js/elm.js
+*.zip
+*.tar.gz
+
+*.sublime*
+
+notes.txt
+

LICENSE

@@ -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>.

README.md

@@ -0,0 +1,9 @@
+# Johnny
+
+This is a simple simualtion of a computer. It allows to get an understanding of what microcode
+in modern CPUs is and what they do.
+
+This is a modernised version of [Johnny Simulator](https://sourceforge.net/projects/johnnysimulator),
+but it uses new code completly.
+
+[See it in action at yokta.de/johnny](https://yokta.de/johnny/)

build.sh

@@ -0,0 +1,25 @@
+#!/bin/bash
+set -euo pipefail
+IFS=$'\n\t'
+
+echo "Building..."
+
+# Create folders
+mkdir -p out/css
+mkdir -p out/js
+
+
+# JS + TS
+#cp src/js/*.js out/js/
+# tsc --lib es2015 --lib dom --outDir out/js src/js/*.ts
+
+
+# Compile Elm
+elm make src/Main.elm --output out/js/elm.js --optimize
+
+# CSS
+#cp src/css/*.css out/css/
+
+# cp out/main.js js/main.julius
+
+echo "Build complete"

elm-tooling.json

@@ -0,0 +1,3 @@
+{
+    "entrypoints": ["./src/Main.elm"]
+}

elm.json

@@ -8,13 +8,13 @@
         "direct": {
             "elm/browser": "1.0.2",
             "elm/core": "1.0.5",
+            "elm/file": "1.0.5",
             "elm/html": "1.0.0",
             "elm/http": "2.0.0",
             "elm/json": "1.1.3"
         },
         "indirect": {
             "elm/bytes": "1.0.8",
-            "elm/file": "1.0.5",
             "elm/time": "1.0.0",
             "elm/url": "1.0.0",
             "elm/virtual-dom": "1.0.2"

out/css/colors-dark.css

@@ -51,6 +51,7 @@
     --color-controls-button-text: var(--color-white);
     --color-controls-button-border: var(--color-white);
     --color-controls-button-text-hover: var(--color-white-light1);
+    --color-controls-scroller-label-text: var(--color-black);
 
     --color-header: var(--color-grey);
     --color-header-text: var(--color-white);
@@ -77,6 +78,7 @@
     --color-table-ram-select: transparent;
     --color-table-ram-select-text: inherit;
     --color-table-ram-select-border: var(--color-grey-light2);
+    --color-table-ram-button-border: var(--color-controls-button-border);
 
     --color-table-cu-head: var(--color-cu-dark1);
     --color-table-cu-head-text: var(--color-white);
@@ -85,6 +87,7 @@
     --color-table-cu-select: transparent;
     --color-table-cu-select-text: inherit;
     --color-table-cu-select-border: var(--color-grey-light2);
+    --color-table-cu-button-border: var(--color-controls-button-border);
 
     --color-arrow: var(--color-arrow-main);
     --color-arrow-text: var(--color-white);
@@ -97,6 +100,11 @@
 
     --color-code: var(--color-black-light1);
     --color-code-text: var(--color-white);
+
+    --color-dragdrop: var(--color-code);
+    --color-dragdrop-text: var(--color-white);
+    --color-dragdrop-processing: var(--color-cu-main);
+    --color-dragdrop-processing-text: var(--color-white);
 }
 
 

out/css/colors-light.css

@@ -50,6 +50,7 @@
     --color-controls-button-text: var(--color-black);
     --color-controls-button-border: var(--color-black);
     --color-controls-button-text-hover: var(--color-black-light1);
+    --color-controls-scroller-label-text: var(--color-white);
 
     --color-header: var(--color-grey);
     --color-header-text: var(--color-white);
@@ -76,6 +77,7 @@
     --color-table-ram-select: transparent;
     --color-table-ram-select-text: inherit;
     --color-table-ram-select-border: var(--color-grey-light2);
+    --color-table-ram-button-border: var(--color-controls-button-border);
 
     --color-table-cu-head: var(--color-cu-dark1);
     --color-table-cu-head-text: var(--color-white);
@@ -84,6 +86,7 @@
     --color-table-cu-select: transparent;
     --color-table-cu-select-text: inherit;
     --color-table-cu-select-border: var(--color-grey-light2);
+    --color-table-cu-button-border: var(--color-controls-button-border);
 
     --color-arrow: var(--color-arrow-main);
     --color-arrow-text: var(--color-white);
@@ -96,6 +99,11 @@
 
     --color-code: var(--color-white-light2);
     --color-code-text: var(--color-black);
+
+    --color-dragdrop: var(--color-code);
+    --color-dragdrop-text: var(--color-black);
+    --color-dragdrop-processing: var(--color-cu-light1);
+    --color-dragdrop-processing-text: var(--color-black);
 }
 
 

out/css/cookie.css

@@ -7,6 +7,7 @@
 	width: 100vw;
 	height: min-content;
 
+	color: black;
 	background-color: white;
 	border-top: 1px solid black;
 
@@ -20,6 +21,9 @@
 	padding: .5rem 1rem;
 	margin: 0;
 	line-height: 1em;
+
+	color: black;
+	border-color: black;
 }
 
 .cookie-banner * {
@@ -33,4 +37,17 @@
 
 .cookie-banner > :last-child {
 	margin-right: 0 !important;
+}
+
+@media (prefers-color-scheme: dark){
+.cookie-banner {
+	background-color: black;
+	border-color: white;
+	color: white;
+}
+.cookie-banner button{
+	color: white;
+	border-color: white;
+}
+
 }

out/css/loader.css

@@ -0,0 +1,310 @@
+/* Variables */
+* {
+    --loaderDivCol: var(--color-dragdrop-processing-text);
+
+    --circR: 1rem;
+    --circD: 2rem;
+    --circ6D: 12rem;
+
+    --timing: ease-in-out;
+    --fullCycle: 5s;
+}
+
+.loader.hidden {
+    display: none;
+}
+
+.loader {
+    position: relative;
+
+    box-sizing: border-box;
+    height: var(--circD);
+    width: var(--circ6D);
+
+    margin: calc(var(--circD) * 3) var(--circD);
+    padding: var(--circR) 0;
+}
+
+.loader > * {
+    position: absolute;
+    box-sizing: border-box;
+    height: 0;
+    width: calc(2 * var(--circD));
+    opacity: 0;
+
+    display: flex;
+    justify-content: space-between;
+
+    --keyframe-sequence: "loading0";
+    --delay: 0;
+    --animation: var(--keyframe-sequence) var(--fullCycle) var(--timing) calc(0s - var(--fullCycle) * (1 - (var(--delay)) / 8) ) infinite;
+
+    -webkit-animation: var(--animation);
+    -moz-animation: var(--animation);
+    -ms-animation: var(--animation);
+    -o-animation: var(--animation);
+    animation: var(--animation);
+}
+
+.loader div::before,
+.loader div::after {
+    content: "";
+    display: block;
+    box-sizing: border-box;
+    width:  var(--circD);
+    height: var(--circD);
+    border: 1px solid var(--loaderDivCol);
+    background: var(--loaderDivCol);
+    border-radius: 100%;
+
+    position: absolute;
+    top: calc(0px - var(--circR));
+}
+
+.loader div::before {
+    left: calc(0px - var(--circR));
+}
+.loader div::after {
+    right: calc(0px - var(--circR));
+}
+
+
+@keyframes loading0 {
+    0% {
+        transform: rotate(0deg);
+        opacity: 1;
+    }
+    12.52% {
+        opacity: 1;
+    }
+    12.56% {
+        opacity: 0;
+    }
+    99.7% {
+        opacity: 0;
+    }
+    100% {
+        opacity: 1;
+    }
+}
+
+@keyframes loading2 {
+    0% {
+        transform: rotate(0deg);
+        opacity: 1;
+    }
+    7% {
+        transform: rotate(180deg);
+    }
+
+    12.47% {
+        opacity: 1;
+    }
+    12.56% {
+        opacity: 0;
+    }
+
+    24.6% {
+        opacity: 0;
+    }
+    24.97% {
+        opacity: 1;
+    }
+    37.52% {
+        opacity: 1;
+    }
+    37.57% {
+        opacity: 0;
+        transform: rotate(180deg);
+    }
+
+    99.95% {
+        opacity: 0;
+        transform: rotate(0deg);
+    }
+    100% {
+        opacity: 1;
+    }
+}
+
+@keyframes loading3 {
+    0% {
+        transform: rotate(0deg);
+        opacity: 1;
+    }
+    7% {
+        transform: rotate(180deg);
+    }
+
+    12.47% {
+        opacity: 1;
+    }
+    12.52% {
+        opacity: 1;
+    }
+    12.56% {
+        opacity: 0;
+    }
+
+    37.4% {
+        opacity: 0;
+    }
+    37.47% {
+        opacity: 1;
+    }
+    50.02% {
+        opacity: 1;
+    }
+    50.1% {
+        opacity: 0;
+        transform: rotate(180deg);
+    }
+    99.8% {
+        opacity: 0;
+        transform: rotate(0deg);
+    }
+    100% {
+        opacity: 1;
+    }
+}
+
+@keyframes loading5 {
+    0% {
+        opacity: 1;
+        transform: rotate(0deg);
+    }
+    7% {
+        transform: rotate(180deg);
+    }
+
+    12.47% {
+        opacity: 1;
+    }
+    12.52% {
+        opacity: 1;
+    }
+    12.58% {
+        opacity: 0;
+    }
+
+    62.4% {
+        opacity: 0;
+    }
+    62.47% {
+        opacity: 1;
+    }
+    75.02% {
+        opacity: 1;
+    }
+    75.1% {
+        opacity: 0;
+        transform: rotate(180deg);
+    }
+    99.7% {
+        transform: rotate(0deg);
+        opacity: 0;
+    }
+    100% {
+        opacity: 1;
+        transform: rotate(0deg);
+    }
+}
+
+@keyframes loading6 {
+    0% {
+        transform: rotate(0deg);
+        opacity: 1;
+    }
+    7% {
+        transform: rotate(180deg);
+    }
+
+    12.47% {
+        opacity: 1;
+    }
+    12.52% {
+        opacity: 1;
+    }
+    12.57% {
+        opacity: 0;
+    }
+
+    74.85% {
+        opacity: 0;
+    }
+    74.97% {
+        opacity: 1;
+    }
+    87.52% {
+        opacity: 1;
+    }
+    87.6% {
+        opacity: 0;
+        transform: rotate(180deg);
+    }
+    99.8% {
+        opacity: 0;
+        transform: rotate(0deg);
+    }
+    100% {
+        opacity: 1;
+    }
+}
+
+.loader :nth-child(1) {
+    width: 66.66%;
+    --keyframe-sequence: "loading5";
+    --delay: 0;
+}
+.loader :nth-child(2) {
+    width: 66.66%;
+    margin-left: 0;
+    --keyframe-sequence: "loading2";
+    --delay: 0;
+}
+.loader :nth-child(3) {
+    width: 33.33%;
+    margin-left: 33.33%;
+    --keyframe-sequence: "loading2";
+    --delay: 1;
+}
+.loader :nth-child(4) {
+    width: 66.66%;
+    margin-left: 33.33%;
+    --keyframe-sequence: "loading6";
+    --delay: 2;
+}
+
+.loader :nth-child(5) {
+    width: 100%;
+    --keyframe-sequence: "loading6";
+    --delay: 3;
+}
+.loader :nth-child(6) {
+    width: 100%;
+    --keyframe-sequence: "loading3";
+    --delay: 3;
+}
+.loader :nth-child(7) {
+    width: 33.33%;
+    --keyframe-sequence: "loading3";
+    --delay: 4;
+}
+.loader :nth-child(8) {
+    width: 66.66%;
+    margin-left: 33.33%;
+    --keyframe-sequence: "loading3";
+    --delay: 5;
+}
+.loader :nth-child(9) {
+    width: 33.33%;
+    margin-left: 33.33%;
+    --keyframe-sequence: "loading5";
+    --delay: 6;
+}
+.loader :nth-child(10) {
+    width: 33.33%;
+    margin-left: 66.66%;
+    --keyframe-sequence: "loading5";
+    --delay: 7;
+}

out/css/roller.css

@@ -0,0 +1,296 @@
+
+/*
+    Roller
+    */
+
+* {
+    --loaderDivCol: #eee;
+
+    --circD: 1rem;
+    --circ6D: 6rem;
+    --circR: 0.5rem;
+
+    --scrollbarBG:   #f5f5f5;
+    --thumbBG:       #C1DCEA;
+}
+
+#elm {
+    height: 100vh;
+    display: flex;
+    justify-content: center;
+    align-items: center;
+}
+
+.roller {
+    margin: 2.5rem 0;
+}
+
+@keyframes loading0 {
+    0% {
+        transform: rotate(0deg);
+        opacity: 1;
+    }
+    7% {
+        transform: rotate(0deg);
+        opacity: 1;
+    }
+    12.47% {
+        opacity: 1;
+    }
+    12.52% {
+        opacity: 0;
+    }
+    100% {
+        opacity: 0;
+        transform: rotate(0deg);
+    }
+}
+
+@keyframes loading2 {
+    0% {
+        transform: rotate(0deg);
+        opacity: 1;
+    }
+    7% {
+        transform: rotate(180deg);
+    }
+
+    12.47% {
+        opacity: 1;
+    }
+    12.52% {
+        opacity: 0;
+    }
+
+    24.97% {
+        opacity: 0;
+    }
+    25.02% {
+        opacity: 1;
+    }
+
+    37.47% {
+        opacity: 1;
+    }
+    37.52% {
+        opacity: 0;
+    }
+
+    99.95% {
+        transform: rotate(180deg);
+    }
+    100% {
+        opacity: 0;
+        transform: rotate(0deg);
+    }
+}
+
+@keyframes loading3 {
+    0% {
+        transform: rotate(0deg);
+        opacity: 1;
+    }
+    7% {
+        transform: rotate(180deg);
+    }
+
+    12.47% {
+        opacity: 1;
+    }
+    12.52% {
+        opacity: 0;
+    }
+
+    37.47% {
+        opacity: 0;
+    }
+    37.52% {
+        opacity: 1;
+    }
+
+    49.97% {
+        opacity: 1;
+    }
+    50.02% {
+        opacity: 0;
+    }
+
+    100% {
+        opacity: 0;
+        transform: rotate(180deg);
+    }
+}
+
+@keyframes loading5 {
+    0% {
+        transform: rotate(0deg);
+        opacity: 1;
+    }
+    7% {
+        transform: rotate(180deg);
+    }
+
+    12.47% {
+        opacity: 1;
+    }
+    12.52% {
+        opacity: 0;
+    }
+
+    62.47% {
+        opacity: 0;
+    }
+    62.52% {
+        opacity: 1;
+    }
+
+    74.97% {
+        opacity: 1;
+    }
+    75.02% {
+        opacity: 0;
+    }
+
+    100% {
+        opacity: 0;
+        transform: rotate(180deg);
+    }
+}
+
+@keyframes loading6 {
+    0% {
+        transform: rotate(0deg);
+        opacity: 1;
+    }
+    7% {
+        transform: rotate(180deg);
+    }
+
+    12.47% {
+        opacity: 1;
+    }
+    12.52% {
+        opacity: 0;
+    }
+
+    74.97% {
+        opacity: 0;
+    }
+    75.02% {
+        opacity: 1;
+    }
+
+    87.47% {
+        opacity: 1;
+    }
+    87.52% {
+        opacity: 0;
+    }
+
+    100% {
+        opacity: 0;
+        transform: rotate(180deg);
+    }
+}
+
+.loader {
+    position: relative;
+    height: var(--circD);
+    width: var(--circ6D);
+    padding: var(--circR) 0;
+    box-sizing: border-box;
+    z-index: -1;
+}
+
+
+.loader :nth-child(n) {
+    position: absolute;
+    opacity: 0;
+    box-sizing: border-box;
+    width: 0;
+
+    display: flex;
+    justify-content: space-between;
+}
+    
+.loader div::before,
+.loader div::after {
+    content: "";
+    display: block;
+    width: var(--circD);
+    height: var(--circD);
+    border: 1px solid var(--loaderDivCol);
+    background: var(--loaderDivCol);
+    border-radius: 100%;
+
+    position: absolute;
+    top: var(--circR);
+}
+    
+.loader div::before {
+    left: calc(-var(--circR));
+}
+.loader div::after {
+    right: calc(-var(--circR));
+}
+
+
+.loader :nth-child(1) {
+    width: 66.66%;
+    /*^{animation "loading5" (timeDiv 0)}*/
+
+    --timing: "cubic-bezier(.39,.58,.57,1)";
+    --fullCycle: "4s";
+    --animation: "loading5" var(--fullCycle) var(--timing) calc(-(var(--fullCycle) * 1 / 8 )) infinite;
+    -webkit-animation: var(--animation);
+    -moz-animation: var(--animation);
+    -ms-animation: var(--animation);
+    -o-animation: var(--animation);
+    animation: var(--animation);
+
+    /*- fromInteger fullDiv * (1 - (fromInteger a) / 8 )*/
+}
+.loader :nth-child(2) {
+    width: 66.66%;
+    margin-left: 0;
+    /*^{animation "loading2"  (timeDiv 0)}*/
+}
+.loader :nth-child(3) {
+    width: 33.33%
+    margin-left: 33.33%
+    /*^{animation "loading2" (timeDiv 1)}*/
+}
+.loader :nth-child(4) {
+    width: 66.66%
+    margin-left: 33.33%
+    /*^{animation "loading6" (timeDiv 2)}*/
+}
+
+
+.loader :nth-child(5) {
+    width: 100%
+    /*^{animation "loading6" (timeDiv 3)} */
+}
+.loader :nth-child(6) {
+    width: 100%
+    /*^{animation "loading3" (timeDiv 3)}*/
+}
+.loader :nth-child(7) {
+    width: 33.33%
+    /*^{animation "loading3" (timeDiv 4)}*/
+}
+.loader :nth-child(8) {
+    width: 66.66%
+    margin-left: 33.33%
+    /*^{animation "loading3" (timeDiv 5)}*/
+}
+.loader :nth-child(9) {
+    width: 33.33%
+    margin-left: 33.33%
+    /*^{animation "loading5" (timeDiv 6)}*/
+}
+.loader :nth-child(10) {
+    width: 33.33%
+    margin-left: 66.66%
+    /*^{animation "loading5" (timeDiv 7)} */
+}

out/css/style.css

@@ -1,6 +1,7 @@
 body {
 	background-color: var(--color-body);
 	color: var(--color-body-text);
+	font-size: 1.4em;
 }
 
 code {
@@ -36,8 +37,96 @@ footer{
 }
 
 
+.dragDrop {
+    position: fixed;
+    top: 0;
+    left: 0;
+    height: 100vh;
+	width: 100%;
 
+	background-color: var(--color-dragdrop);
+	color: var(--color-dragdrop-text);
 
+	visibility: hidden;
+    opacity: 0;
+    z-index: 1000;
+
+	display: flex;
+	justify-content: center;
+	align-items: center;
+	flex-direction: column;
+
+	--transition: all 0.25s ease-in-out 0s;
+	transition: var(--transition);
+}
+.dragDrop.hover, .dragDrop.loading {
+	visibility: visible;
+	opacity: 1;
+}
+.dragDrop.loading {
+	background-color: var(--color-dragdrop-processing);
+	color: var(--color-dragdrop-processing-text);
+}
+.dragDrop .loader {
+	display: none;
+}
+.dragDrop.loading .loader {
+	display: block;
+}
+/*.dragDrop.loading p:first-child::before {
+	content: "⋮";
+	
+	display: inline-flex;
+	width: 1em;
+	height: 1em;
+
+    justify-content: center;
+    align-items: center;
+    align-content: center;
+    transform: rotate(0);
+}*/
+
+.pc .examples-list {
+	border: 1px solid var(--color-controls-button-border);
+	margin: 0;
+	border-radius: 0 4px 4px 4px;
+}
+
+.pc .examples-list table td:first-child {
+	padding: 12px 8px 12px 15px;
+}
+
+.pc .example-scroller-label {
+	display: inline-block;
+	margin: 0;
+	border: 1px solid var(--color-controls-button-border);
+	border-bottom-style: none;
+	color: var(--color-controls-button-text);
+	border-radius: 4px 4px 0 0;
+	padding: 2px 15px;
+}
+
+button, .button {
+    /* background-color: whitesmoke; */
+    color: var(--color-controls-button-text);
+    border-color: var(--color-controls-button-border);
+}
+button:hover, .button:hover{
+    color: var(--color-controls-button-text-hover);
+}
+
+.button-group {
+	margin-bottom: 2em;
+}
+.button-group > * {
+	border-radius: 0;
+}
+.button-group :first-child {
+	border-radius: 4px 0 0 4px;
+}
+.button-group :last-child {
+	border-radius: 0 4px 4px 0;
+}
 
 /* HELPERS  */
 .text-center {

out/examples-list.json

@@ -1,17 +1,23 @@
 {
-	"available": 
+	"available":
-		[ 
+		[
-			{ 
+			{
-				"title": "Simple Counter",
+				"title": "A simple Counter",
-		  		"version": "0.1",
+		  		"version": "0.4",
 		  		"url": "examples/simple-counter.json",
 		  		"enabled": 1
 			},
 			{
-				"title": "Add 2 numbers(placeholder)",
+				"title": "Adding 2 numbers together",
-				"version": "0.1",
+				"version": "0.3",
 				"url": "examples/adding.json",
 				"enabled": 1
+			},
+			{
+				"title": "Empty Canvas",
+				"version": "0.2",
+				"url": "examples/empty.json",
+				"enabled": 1
 			}
 		]
 }

out/examples/adding.json

@@ -0,0 +1 @@
+{"model-version":"4","pc_model":{"pc":{"addressBus":0,"dataBus":0,"instructionReg":0,"programmCounter":0,"uCounter":0,"accumulator":0,"ram":[[100013,"Load ValB to Acc"],[300000,"Acc ++"],[200013,"Store Acc to ValB"],[100012,"Load ValA"],[400000,"Acc --"],[200012,"Store Acc to ValA"],[700008,"Jmp If eq 0"],[600000,"Jmp #000"],[500000,"END OF PROGRAM"],[0,""],[0,""],[0,""],[4,"ValA"],[17,"ValB + Result"],[0,""],[0,""],[0,""]]},"uCodes":["pc2ab","ram2db","db2ir","pcInc","ir2uc","n","n","n","n","n","ir2ab","ram2db","db2acc","ucReset","n","n","n","n","n","n","acc2db","ir2ab","db2ram","ucReset","n","n","n","n","n","n","accInc","ucReset","n","n","n","n","n","n","n","n","accDec","ucReset","n","n","n","n","n","n","n","n","alert","ucReset","n","n","n","n","n","n","n","n","ir2pc","ucReset","n","n","n","n","n","n","n","n","ir2pciacceq0","ucReset","n","n","n","n","n","n","n","n"]},"autoscroll":true}

out/examples/empty.json

@@ -0,0 +1 @@
+{"model-version":"4","pc_model":{"pc":{"addressBus":0,"dataBus":0,"instructionReg":0,"programmCounter":0,"uCounter":0,"accumulator":0,"ram":[[0,""],[0,""],[0,""],[0,""],[0,""],[0,""],[0,""],[0,""],[0,""],[0,""],[0,""]]},"uCodes":["pc2ab","ram2db","db2ir","pcInc","ir2uc","n","n","n","n","n"]},"autoscroll":true}

out/examples/simple-counter.json

@@ -1 +1 @@
-{"model-version":1,"pc":{"addressBus":0,"dataBus":0,"instructionReg":0,"programmCounter":0,"uCounter":0,"accumulator":0,"ram":[100005,300000,200005,400000,0,5,0,0,0,0,0]},"uCode":["pc2ab","ram2db","db2ir","pcInc","ir2uc","n","n","n","n","n","ir2ab","ram2db","db2acc","ucReset","n","n","n","n","n","n","acc2db","ir2ab","db2ram","ucReset","n","n","n","n","n","n","accInc","ucReset","n","n","n","n","n","n","n","n","ir2pc","ucReset","n","n","n","n","n","n","n","n"],"autoscroll":true}
+{"model-version":"4","pc_model":{"pc":{"addressBus":0,"dataBus":0,"instructionReg":0,"programmCounter":0,"uCounter":0,"accumulator":0,"ram":[[100005,"LoadA #005"],[300000,"IncA"],[200005,"StoreA #005"],[400000,"JMP #000"],[0,""],[5,"val"],[0,""],[0,""],[0,""],[0,""],[0,""]]},"uCodes":["pc2ab","ram2db","db2ir","pcInc","ir2uc","n","n","n","n","n","ir2ab","ram2db","db2acc","ucReset","n","n","n","n","n","n","acc2db","ir2ab","db2ram","ucReset","n","n","n","n","n","n","accInc","ucReset","n","n","n","n","n","n","n","n","ir2pc","ucReset","n","n","n","n","n","n","n","n"]},"autoscroll":true}

out/index.html

@@ -10,7 +10,7 @@
 
     <!-- Mobile Specific Metas
   –––––––––––––––––––––––––––––––––––––––––––––––––– -->
-    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <meta name="viewport" content="width=device-width, initial-scale=1, user-scalable=no" />
 
     <!-- CSS
   –––––––––––––––––––––––––––––––––––––––––––––––––– -->
@@ -19,6 +19,7 @@
     <link rel="stylesheet" href="css/cookie.css" />
     <link rel="stylesheet" href="css/colors-light.css">
     <link rel="stylesheet" href="css/colors-dark.css">
+    <link rel="stylesheet" href="css/loader.css" />
     <link rel="stylesheet" href="css/pc.css" />
     <link rel="stylesheet" href="css/style.css" />
 
@@ -59,7 +60,7 @@
           </li>
           <li>
             <b>Instruction</b>
-            Hiermit kannst du eine ganze Instruction ausführen lassen und musst nicht durch jeden µCode Schritt einzeln durchdrücken.
+            Hiermit kannst du eine ganze Instruktion ausführen lassen und musst nicht durch jeden µCode Schritt einzeln durchdrücken.
           </li>
           <li>
             <b>Reset PC</b>
@@ -70,8 +71,8 @@
             Nachdem im RAM oder im µCode ein anderer Eintrag ausgewählt wurde, kann automatisch zum Eintrag gescrollt werden
           </li>
           <li>
-            <b>Load Example</b>
+            <b>Configs</b>
-            Mit diesem Knopf kannst du ein Beispielprogramm in den PC laden. Dabei wird dein momentanes Programm überschrieben.
+            Hier können sie die momentane Konfiguration herunterladen, selber eine Hochladen oder aus einer Liste von Beispielen laden.
           </li>
         </ul>
 
@@ -82,7 +83,7 @@
 
         <h3>RAM</h3>
         <p>
-          Im Arbeitsspeicher wird das Programm gespeichert. Jeder Eintrag ist dabei in ein Low-Byte und ein High-Byte unterteilt. Dadurch kann man in einem Eintrag die Instruktion und Addresse einfacher unterscheiden.<br>
+          Im Arbeitsspeicher wird das Programm gespeichert. Jeder Eintrag ist dabei in ein Low-Byte und ein High-Byte unterteilt. Dadurch kann man in einem Eintrag die Instruktion und Adresse einfacher unterscheiden.<br>
           <a href="#befehl">Siehe Befehle</a>
         </p>
 
@@ -106,7 +107,7 @@
         <p>
           Über den Datenbus können Daten und Befehle zwischen RAM, Control Unit und ALU übertragen werden.
         </p>
-        <h3>Addressbus</h3>
+        <h3>Adressbus</h3>
         <p>
           Über diesen Bus kann die Control Unit steuern, welcher Wert im RAM ausgewählt wird.<br>
           Bei normalen Rechnern sind hier natürlich noch deutlich mehr Werte angeschlossen.
@@ -115,14 +116,20 @@
         <a id="befehl"></a>
         <h2>Befehle</h2>
         <p>
-          Ein Befehl besteht aus einer Instruktion und einem Argument. Deshalb sind im RAM und im Instruction Register alle Werte separiert.
+          Ein Befehl besteht aus einer Instruktion und einem Argument. Deshalb sind im RAM und im Instruction&nbsp;Register alle Werte separiert.
+        </p>
+        <pre><code>0 0 2   0 0 5 0 4
+Instr   Argument
+</code></pre>
+        <p>
+          In den ersten 3&nbsp;Stellen wird hier der OpCode der Instruction codiert. Wenn dieser Teil in der Control&nbsp;Unit in den µCode&nbsp;Counter geladen wird, dann wird der OpCode mit 10 multipliziert.
+        </p>
+        <p>
+          In den letzten 5&nbsp;Stellen wird ein beliebiger Zahlenwert gespeichert. Dieser kann als Argument für einen Befehl genutzt werden.
+        </p>
+        <p>
+          In diesem Beispiel hier würden die µCodes ab Adresse 20 im µCode Speicher ausgeführt werden.
         </p>
-        <pre>
-          <code>
-            0 0 0   0 0 0 0 0
-            Instr   Argument
-          </code>
-        </pre>
 
         <h2>µCodes</h2>
         <p>
@@ -137,68 +144,117 @@
           </thead>
           <tbody>
             <tr>
-              <td>ProgCounter -> AddrBus</td>
+              <td><code>ProgCounter -> AddrBus</td>
               <td>Lade den Wert des Programm Counters in den Adressbus</td>
             </tr>
             <tr>
-              <td>InstrReg -> ProgCounter</td>
+              <td><code>InstrReg -> ProgCounter</code></td>
               <td>Lade das Argument des Instruktionsregisters in den Programm Counter</td>
             </tr>
             <tr>
-              <td>ProgCounter ++</td>
+              <td><code>ProgCounter ++</td>
-              <td>Erhöhe den Wert des Programm Counter um 1</td>
+              <td>Erhöhe den Wert des Programm Counter um 1</td></td>
             </tr>
             <tr>
-              <td>Acc == 0 => InstReg -> ProgCounter</td>
+              <td><code>Acc == 0 => InstReg -> ProgCounter</code></td>
-              <td>Wenn der Wert des Akkumulators 0 ist, dann lade das Arggument des Instruktionsregisters in den Programm Counter</td>
+              <td>Wenn der Wert des Akkumulators 0 ist, dann lade das Argument des Instruktionsregisters in den Programm Counter</td>
             </tr>
             <tr>
-              <td>Ram -> DataBus</td>
+              <td><code>Ram -> DataBus</code></td>
-              <td>Schreibe den aktuellen Wert aus den RAM auf den Datembus</td>
+              <td>Schreibe den aktuellen Wert aus den RAM auf den Datenbus</td>
             </tr>
             <tr>
-              <td>DataBus -> Ram</td>
+              <td><code>DataBus -> Ram</code></td>
               <td>Schreibe den Wert des Datenbus in die momentane Stelle des RAM</td>
             </tr>
             <tr>
-              <td>DataBus -> InstReg</td>
+              <td><code>DataBus -> InstReg</code></td>
               <td>Lade den Befehl vom Datenbus in das Instruktionsregister</td>
             </tr>
             <tr>
-              <td>DataBus -> Acc</td>
+              <td><code>DataBus -> Acc</code></td>
               <td>Lade den Wert vom Datenbus in den Akkumulator der ALU</td>
             </tr>
             <tr>
-              <td>Acc -> DataBus</td>
+              <td><code>Acc -> DataBus</code></td>
               <td>Schreibe den Wert vom Akkumulator auf den Datenbus</td>
             </tr>
             <tr>
-              <td>Acc ++</td>
+              <td><code>Acc ++</code></td>
               <td>Erhöhe den Wert des Akkumulators um 1</td>
             </tr>
             <tr>
-              <td>Acc --</td>
+              <td><code>Acc --</code></td>
               <td>Verringere den Wert des Akkumulators um 1</td>
             </tr>
             <tr>
-              <td>InstReg -> µCounter</td>
+              <td><code>Acc << DataBus</code></td>
+              <td>Verschiebt den Wert im Akkumulator nach links um den Wert im DatenBus.</td>
+            </tr>
+            <tr>
+              <td><code>Acc >> DataBus</code></td>
+              <td>Verschiebt den Wert im Akkumulator nach rechts um den Wert im DatenBus.</td>
+            </tr>
+            <tr>
+              <td><code>Acc + DataBus</code></td>
+              <td>Addiere den Wert im Datenbus auf den Akkumulator</td>
+            </tr>
+            <tr>
+              <td><code>Acc - DataBus</code></td>
+              <td>Subtrahiere den Wert im Datenbus auf den Akkumulator</td>
+            </tr>
+            <tr>
+              <td><code>Acc * DataBus</code></td>
+              <td>Multipliziere den Wert im Datenbus mit dem Akkumulator</td>
+            </tr>
+            <tr>
+              <td><code>Acc / DataBus</code></td>
+              <td>Dividiere den Akkumulator durch den Datenbus</td>
+            </tr>
+            <tr>
+              <td><code>Acc AND DataBus</code></td>
+              <td>Führe bitweise UND auf Akkumulator mit Datenbus aus</td>
+            </tr>
+            <tr>
+              <td><code>Acc OR DataBus</code></td>
+              <td>Führe bitweise ODER auf Akkumulator mit Datenbus aus</td>
+            </tr>
+            <tr>
+              <td><code>Acc XOR DataBus</code></td>
+              <td>Führe bitweise XOR auf Akkumulator mit Datenbus aus</td>
+            </tr>
+            <tr>
+              <td><code>Acc NOT DataBus</code></td>
+              <td>Führe bitweise NOT auf Akkumulator mit Datenbus aus</td>
+            </tr>
+            <tr>
+              <td><code>InstReg -> µCounter</code></td>
               <td>Nehme das Argument des Befehls im Instruktionsregister, füge am Ende eine 0 an und Lade ihn in den µCounter</td>
             </tr>
             <tr>
-              <td>InstReg -> AddrBus</td>
+              <td><code>InstReg -> AddrBus</code></td>
-              <td>Lade das Argument im Instruktionsregister in den Addressbus</td>
+              <td>Lade das Argument im Instruktionsregister in den Adressbus</td>
             </tr>
             <tr>
-              <td>µCounter = 0</td>
+              <td><code>InstReg -> DataBus</code></td>
+              <td>Lade das Argument im Instruktionsregister in den Adressbus</td>
+            </tr>
+            <tr>
+              <td><code>µCounter = 0</code></td>
               <td>Setzte den µCounter zurück</td>
             </tr>
+            <tr>
+              <td><code>Signal End of Program</code></td>
+              <td>Zeigt ein Popup, dass das Ende des Programms signalisiert.</td>
+            </tr>
           </tbody>
         </table>
 
         <h1>Source</h1>
         <p>
-          Im Moment ist dieser Code noch nicht ordentlich genug, dass es Sinn hat ihn zu veröffentlichen.
+          Das hier ist ein kleines Hobbyprojekt. Meine Implementation ist also nur mit Vorsicht als "best-practice" Vorlage zu verwenden.
         </p>
+          <a href="https://git.yokta.de/Christian/Johnny" class="button">Zum Source Code</a>
         <p>
           Dieses Projekt ist angelehnt an den <a href="https://sourceforge.net/projects/johnnysimulator/" target="_blank">Johnny-Simulator</a>.
         </p>
@@ -231,8 +287,8 @@
             After a value in RAM or in the µCodes is selected you can automatically scroll to them
           </li>
           <li>
-            <b>Load Example</b>
+            <b>Configs</b>
-            Click this button and select an example you want to load. This will overwrite the whole pc including ram and µCode
+            Download the current config, import a config from your machine or choose an example.
           </li>
         </ul>
 
@@ -243,7 +299,7 @@
 
         <h3>RAM</h3>
         <p>
-          The current programm is stored in the RAM. Every entry is seperated as mentioned in <a href="#entry">entry</a>.
+          The current program is stored in the RAM. Every entry is separated as mentioned in <a href="#entry">entry</a>.
         </p>
 
         <h3>Control Unit</h3>
@@ -265,28 +321,33 @@
         </p>
         <h3>Databus</h3>
         <p>
-          Via the Databus values and entrys can be transported between RAM, Control Unit and ALU.
+          Via the databus values and entries can be transported between RAM, Control Unit and ALU.
         </p>
         <h3>Addressbus</h3>
         <p>
-          With the addressbus the Control Unit can control which value is selected in RAM. On a normal computer there are a lot mor things attached to this bus.
+          With the addressbus the Control Unit can control which value is selected in RAM. On a normal computer there are a lot more things attached to this bus.
         </p>
 
         <a id="entry"></a>
         <h2>Entry</h2>
         <p>
-          Each entry consits of a instruction and an argument. That's why the entrys in RAM and in µCodes are displayed seperatly.
+          Each entry consists of a instruction and an argument. That's why the entrys in RAM and in µCodes are displayed separately.
+        <pre><code>0 0 2   0 0 5 0 4
+Instr   Argument
+</code></pre>
+
+        <p>
+          Here, the first 3 digits are the opCode of the instruction. When you try to load this part into the µCode&nbsp;Counter of the Control&nbsp;Unit, it will be automatically multiplied by 10.
+          <br>
+          In this example µCodes starting at the Address 20 will be executed.
+        </p>
+        <p>
+          The last 5 digits are a numerical value that can be used as an argument for the command.
         </p>
-        <pre>
-          <code>
-            0 0 0   0 0 0 0 0
-            Instr   Argument
-          </code>
-        </pre>
 
         <h2>µCodes</h2>
         <p>
-          Every instruction consists of a list of µCodes. Here is an explanaition for all of them:
+          Every instruction consists of a list of µCodes. Here is an explanation for all of them:
         </p>
         <table>
           <thead>
@@ -297,68 +358,117 @@
           </thead>
           <tbody>
             <tr>
-              <td>ProgCounter -> AddrBus</td>
+              <td><code>ProgCounter -> AddrBus</code></td>
-              <td>Load the value from programm counter to addressbus</td>
+              <td>Load the value from program counter to addressbus</td>
             </tr>
             <tr>
-              <td>InstrReg -> ProgCounter</td>
+              <td><code>InstrReg -> ProgCounter</code></td>
-              <td>Load the argument from instruction register to programm counter</td>
+              <td>Load the argument from instruction register to program counter</td>
             </tr>
             <tr>
-              <td>ProgCounter ++</td>
+              <td><code>ProgCounter ++</code></td>
-              <td>Increment programm counter by 1</td>
+              <td>Increment program counter by 1</td>
             </tr>
             <tr>
-              <td>Acc == 0 => InstReg -> ProgCounter</td>
+              <td><code>Acc == 0 => InstReg -> ProgCounter</code></td>
-              <td>If the accumulator is 0 then write the argument from instruction register to programm counter</td>
+              <td>If the accumulator is 0 then write the argument from instruction register to program counter</td>
             </tr>
             <tr>
-              <td>Ram -> DataBus</td>
+              <td><code>Ram -> DataBus</code></td>
               <td>Load selected value from RAM to databus</td>
             </tr>
             <tr>
-              <td>DataBus -> Ram</td>
+              <td><code>DataBus -> Ram</code></td>
               <td>Write value from databus to selected value in RAM</td>
             </tr>
             <tr>
-              <td>DataBus -> InstReg</td>
+              <td><code>DataBus -> InstReg</code></td>
               <td>Write entry from databus to instruction register</td>
             </tr>
             <tr>
-              <td>DataBus -> Acc</td>
+              <td><code>DataBus -> Acc</code></td>
               <td>Write value from databus to accumulator</td>
             </tr>
             <tr>
-              <td>Acc -> DataBus</td>
+              <td><code>Acc -> DataBus</code></td>
               <td>Load value from accumulator to databus</td>
             </tr>
             <tr>
-              <td>Acc ++</td>
+              <td><code>Acc ++</code></td>
               <td>Increment accumulator by 1</td>
             </tr>
             <tr>
-              <td>Acc --</td>
+              <td><code>Acc --</code></td>
               <td>Decrement accumulator by 1</td>
             </tr>
             <tr>
-              <td>InstReg -> µCounter</td>
+              <td><code>Acc << DataBus</code></td>
+              <td>Shift the Accumulator left by the value in databus</td>
+            </tr>
+            <tr>
+              <td><code>Acc >> DataBus</code></td>
+              <td>Shift the Accumulator right by the value in databus</td>
+            </tr>
+            <tr>
+              <td><code>Acc + DataBus</code></td>
+              <td>Add the value of the databus to the accumulator</td>
+            </tr>
+            <tr>
+              <td><code>Acc - DataBus</code></td>
+              <td>Subtract the value of the databus from the accumulator</td>
+            </tr>
+            <tr>
+              <td><code>Acc * DataBus</code></td>
+              <td>Multiply the value of the databus with the accumulator</td>
+            </tr>
+            <tr>
+              <td><code>Acc / DataBus</code></td>
+              <td>Divide the accumulator by the value of the databus</td>
+            </tr>
+            <tr>
+              <td><code>Acc AND DataBus</code></td>
+              <td>Do a bitwise AND to accumulator with the value of the databus</td>
+            </tr>
+            <tr>
+              <td><code>Acc OR DataBus</code></td>
+              <td>Do a bitwise OR to accumulator with the value of the databus</td>
+            </tr>
+            <tr>
+              <td><code>Acc XOR DataBus</code></td>
+              <td>Do a bitwise XOR to accumulator with the value of the databus</td>
+            </tr>
+            <tr>
+              <td><code>Acc NOT DataBus</code></td>
+              <td>Do a bitwise NOT to accumulator with the value of the databus</td>
+            </tr>
+            <tr>
+              <td><code>InstReg -> µCounter</code></td>
               <td>Take the instruction from instruction register, add a 0 at the tail and write it to µCounter</td>
             </tr>
             <tr>
-              <td>InstReg -> AddrBus</td>
+              <td><code>InstReg -> AddrBus</code></td>
               <td>Write the argument from instruction register to addressbus</td>
             </tr>
             <tr>
-              <td>µCounter = 0</td>
+              <td><code>InstReg -> DataBus</code></td>
+              <td>Write the argument from instruction register to databus</td>
+            </tr>
+            <tr>
+              <td><code>µCounter = 0</code></td>
               <td>Set µCounter to 0</td>
             </tr>
+            <tr>
+              <td><code>Signal End of Program</code></td>
+              <td>Show an alert that the end of program is reached.</td>
+            </tr>
           </tbody>
         </table>
 
         <h1>Source</h1>
         <p>
-          At the moment the code for this project isn't good enough to share it online.
+          This is a hobby project so please don't take my code as a "best-practice" implementation.<br>
         </p>
+          <a href="https://git.yokta.de/Christian/Johnny" class="button">See Source Code</a>
         <p>
           This project is my take on <a href="https://sourceforge.net/projects/johnnysimulator/" target="_blank">Johnny-Simulator</a>.
         </p>
@@ -370,8 +480,8 @@
     <footer>
       <div class="container">
         <p>
-          Made with ☕ 
+          Made with ☕ <br>
-          by <a href="https://github.com/ChrisgammaDE" target="_blank">Christian</a>
+          © <a href="https://github.com/ChrisgammaDE" target="_blank">Christian</a>, 2022
         </p>
         <p>
           <a href="https://yokta.de/i/impressum.html" target="_blank">Impressum</a>

out/js/cookie.js

@@ -2,6 +2,8 @@
 
 // Please import cookie.css!!!!
 
+let __cookie_internal_Banner_shownAndDenied__ = false;
+
 function __cookie_internal_addBanner__(){
 	let banner 				= document.createElement("div");
 	let text 				= document.createElement("div");
@@ -29,6 +31,7 @@ function __cookie_internal_addBanner__(){
 		document.body.removeChild(parent);
 	});
 	button_deny.addEventListener("click", (message) => {
+		__cookie_internal_Banner_shownAndDenied__ = true;
 		let parent = message.target.parentElement;
 		document.body.removeChild(parent);
 	});
@@ -54,7 +57,9 @@ function cookieAccepted() {
 	if (cookie_status == 0) {
 		let maybe_banner = document.getElementsByClassName("cookie-banner")[0];
 		if(maybe_banner == undefined){
-			__cookie_internal_addBanner__();
+			if(!__cookie_internal_Banner_shownAndDenied__){
+				__cookie_internal_addBanner__();
+			}
 		}
 
 		return false;

out/js/pc.js

@@ -1,9 +1,15 @@
 // Init Elm
+var localStuff = localStorage.getItem("pc_data");
+if (typeof localStuff !== "string") localStuff = "";
+
 var app = Elm.Main.init({
     node: document.getElementById("elm"),
-    // flags: Date.now()
+    flags: localStuff
 });
 
+// ###################################################################
+// ###################################################################
+
 // Dom Objects
 let pc      = document.getElementsByClassName("pc")[0];
 let pc_ram  = pc.getElementsByClassName("ram")[0];
@@ -41,36 +47,11 @@ function scrollToCurrent(){
     // pc.scrollIntoView();
 }
 
+// ###################################################################
+// ###################################################################
 
-function shrinkTableHead(scroll){
-    let scroller = scroll.target;
-    let pos = scroller.scrollTop;
-    let thead = scroller.getElementsByClassName("head")[0];
-
-    if( pos > 70 ){
-        thead.classList.add("shrunk");
-    }else if (pos < 40){
-        thead.classList.remove("shrunk");
-    }
-    thead.classList.add("shrunk");
-
-}
-
-function loadStorage() {
-    let content = localStorage.getItem("pc_data");
-    if( typeof content == "string" ){
-        app.ports.localStorageRecieve.send( content );
-    }
-}
-
-
-
-// Load last state of pc
-loadStorage();
 
 // EVENT LISTENERS
-pc_ram_scroller.addEventListener("scroll", shrinkTableHead);
-pc_cu_scroller.addEventListener("scroll", shrinkTableHead);
 
 // Recieve Elm updates via ports
 app.ports.sendUUpdate.subscribe( (message) => {
@@ -87,3 +68,8 @@ app.ports.localStorageSend.subscribe( (message) => {
     if( cookieAccepted() )
         localStorage.setItem("pc_data", message);
 } );
+
+
+// ###################################################################
+// ###################################################################
+// Done.

out/script.js

@@ -1,26 +0,0 @@
-let text_de = document.getElementById("langDE");
-let text_en = document.getElementById("langEN");
-
-let btn_changeToDe = document.getElementById("langPickerDE");
-let btn_changeToEn = document.getElementById("langPickerEN");
-
-let lang = (typeof document.documentElement.lang == "string") ? document.documentElement.lang: "en"
-
-
-function changeLang(lang){
-	if(lang == "de"){
-		text_de.classList.remove("hidden");
-		text_en.classList.add("hidden");
-	}else{
-		text_en.classList.remove("hidden");
-		text_de.classList.add("hidden");
-	}
-}
-
-btn_changeToEn.addEventListener("click", () => { changeLang("en") } );
-btn_changeToDe.addEventListener("click", () => { changeLang("de") } );
-
-
-
-// Do stuff on loading
-changeLang( lang );

src/PC/Defaults.elm

@@ -0,0 +1,107 @@
+module PC.Defaults      exposing (..)
+
+import Array            exposing (Array)
+
+import PC.Types         exposing (..)
+import PC.UActions      exposing (..)
+
+
+initalModel : PC_Model
+initalModel =
+    { pc        = initialPC
+    , uCodes    = initialUCodes
+    }
+
+initialPC : PC
+initialPC =
+    { ram               = initialRam
+    , dataBus           = 0
+    , addressBus        = 0
+    , instructionReg    = 0
+    , programmCounter   = 0
+    , uCounter          = 0
+    , accumulator       = 0
+    }
+
+
+initialRam : Array (Int, String)
+initialRam = Array.fromList
+    [ (100005, "LoadA #005")    -- 000  -- LoadA    #005
+    , (300000, "IncA")          -- 001  -- IncA
+    , (200005, "StoreA #005")   -- 002  -- StoreA   #005
+    , (400000, "JMP #000")      -- 003  -- JMP      #000
+    , (0,"")                    -- 004
+    , (5,"val")                 -- 005
+    , (0, "")                   -- 006
+    , (0, "")                   -- 007
+    , (0, "")                   -- 008
+    , (0, "")                   -- 009
+    , (0, "")                   -- 010
+    ]
+
+
+
+initialUCodes : Array UAction
+initialUCodes = Array.fromList
+    [ UA_CU_ProgrammCounter2AddressBus -- 000
+    , UA_Ram2DataBus -- 001
+    , UA_DataBus2InstructionReg -- 002
+    , UA_CU_ProgrammCounterIncrement -- 003
+    , UA_CU_InstructionReg2UCounter -- 004
+    , UA_Nothing -- 005
+    , UA_Nothing
+    , UA_Nothing
+    , UA_Nothing
+    , UA_Nothing -- 009
+
+    -- 010 LOADA
+    , UA_CU_InstructionReg2AddressBus -- 010
+    , UA_Ram2DataBus -- 011
+    , UA_DataBus2Accumulator -- 012
+    , UA_CU_ResetUCounter -- 013
+    , UA_Nothing -- 014
+    , UA_Nothing
+    , UA_Nothing
+    , UA_Nothing
+    , UA_Nothing
+    , UA_Nothing -- 019
+
+    -- 020 STOA
+    , UA_ALU_Accumulator2DataBus -- 020
+    , UA_CU_InstructionReg2AddressBus -- 021
+    , UA_DataBus2Ram -- 022
+    , UA_CU_ResetUCounter -- 023
+    , UA_Nothing --024
+    , UA_Nothing
+    , UA_Nothing
+    , UA_Nothing
+    , UA_Nothing
+    , UA_Nothing -- 029
+
+    -- 030 INCA
+    , UA_ALU_AccumulatorIncrement -- 030
+    , UA_CU_ResetUCounter -- 031
+    , UA_Nothing -- 032
+    , UA_Nothing
+    , UA_Nothing
+    , UA_Nothing
+    , UA_Nothing
+    , UA_Nothing
+    , UA_Nothing
+    , UA_Nothing -- 039
+
+    -- 040 JMP
+    , UA_CU_InstructionReg2ProgrammCounter -- 040
+    , UA_CU_ResetUCounter -- 041
+    , UA_Nothing -- 042
+    , UA_Nothing
+    , UA_Nothing
+    , UA_Nothing
+    , UA_Nothing
+    , UA_Nothing
+    , UA_Nothing
+    , UA_Nothing -- 049
+    ]
+
+
+

src/PC/Helpers.elm

@@ -0,0 +1,101 @@
+module PC.Helpers   exposing (..)
+
+import Array        exposing (Array)
+import Http         exposing (..)
+
+-- Convert a number from  42 to 0042
+-- number : (Prefered positive) whole number
+-- length : positive whole number
+-- Please note that only 0 are added. The number will not be shortend!
+addLeadingZero : Int -> Int -> String
+addLeadingZero number length =
+    if number >= 0 then
+        let
+            num_str = String.fromInt number
+        in
+        (String.fromList <| List.repeat (length - String.length num_str) '0'
+        )
+        ++ num_str
+    else
+        let
+            num_str = String.fromInt <| 0-number
+        in
+        "-" ++
+        (String.fromList <| List.repeat (length - String.length num_str) '0'
+        )
+        ++ num_str
+
+
+-- Get the value at a given position in a List.
+-- For performance reasons it might be better
+-- to use an Array instead.
+valueAt : Int -> List a -> Maybe a
+valueAt pos list = List.head <| List.drop pos list
+
+
+-- Change the value at a given position in a List.
+-- If your pos is greater than the length of
+-- the list, then the rest is filled with the
+-- default element.
+overwriteAt : a -> Int -> a ->List a -> List a
+overwriteAt default pos newVal list =
+    let
+        len = List.length list
+    in
+    if pos > len then
+        list ++ 
+        (List.repeat (pos-len) default) ++
+        [newVal]
+    else
+        let
+            before  = List.take pos     list
+            after   = List.drop (pos+1) list
+        in
+        before ++ [newVal] ++ after
+
+overwriteAt_Arr : a -> Int -> a -> Array a -> Array a
+overwriteAt_Arr default pos newVal list =
+    let
+        len = Array.length list
+    in
+    if pos > len then
+        Array.append list 
+        <| Array.append (Array.repeat (pos-len) default) 
+        <| Array.fromList [newVal]
+    else
+        Array.set pos newVal list
+
+
+-- Prints Http Errors into something readable
+printHttpError : Http.Error -> String
+printHttpError err =
+    case err of
+        Http.BadUrl str     -> "Bad Url: " ++ str
+        Http.Timeout        -> "Timeout"
+        Http.NetworkError   -> "Network Error"
+        Http.BadStatus num  -> "Bad Status: " ++ String.fromInt num
+        Http.BadBody str    -> "Bad Body: " ++ str
+
+
+seperateInstructionsEntry : Int -> (Int, Int)
+seperateInstructionsEntry i =
+    let
+        instruction = i // 100000
+        address = i - instruction*100000
+    in
+    (instruction, address)
+
+
+valueAtRam : Int -> Array (Int, String) -> (Int, String)
+valueAtRam pos arr =
+    case Array.get pos arr of
+        Just a  -> a
+        Nothing -> (0, "")
+
+
+changeAtRam : Int -> Int -> Array (Int, String) -> Array (Int,String)
+changeAtRam pos newVal list =
+    let
+        (_,comment) = valueAtRam pos list
+    in
+    overwriteAt_Arr (0, "") pos (newVal, comment) list

src/PC/JSON.elm

@@ -0,0 +1,112 @@
+module PC.Json              exposing ( pcModelDecoder
+                                     , pcModelEncoder
+                                     , tuple2Decoder
+                                     , tuple2Encoder
+                                     )
+
+import PC.Types             exposing (..)
+import Maybe
+import Array                exposing (Array)
+
+import Json.Encode  as JE   exposing (Value)
+import Json.Decode  as JD   exposing (Decoder)
+
+import PC.Types             exposing (..)
+import PC.UActions          exposing (..)
+
+
+-- ##########################################################
+-- Decoders
+-- ##########################################################
+
+pcModelDecoder : Decoder PC_Model
+pcModelDecoder =
+    JD.map2 
+        PC_Model
+        (JD.field "pc" pcDecoder)
+        (JD.field "uCodes" uCodeDecoder)
+
+
+pcDecoder : Decoder PC
+pcDecoder =
+    JD.map7
+        PC
+        (JD.field "ram" <| JD.array <| tuple2Decoder JD.int JD.string)
+        (JD.field "dataBus" JD.int)
+        (JD.field "addressBus" JD.int)
+        (JD.field "instructionReg" JD.int)
+        (JD.field "programmCounter" JD.int)
+        (JD.field "uCounter" JD.int)
+        (JD.field "accumulator" JD.int)
+
+uCodeDecoder : Decoder (Array UAction)
+uCodeDecoder =
+    JD.array <| JD.map uActionDecoder JD.string
+
+uActionDecoder : String -> UAction
+uActionDecoder str =
+    Maybe.withDefault UA_Nothing <| string2uAction str
+
+
+
+tuple2Decoder : Decoder a -> Decoder b -> Decoder (a,b)
+tuple2Decoder enc1 enc2 =
+    JD.map2 Tuple.pair
+        (JD.index 0 enc1)
+        (JD.index 1 enc2)
+
+-- ##########################################################
+-- ##########################################################
+
+
+
+
+
+-- ##########################################################
+-- Encoders
+-- ##########################################################
+
+pcModelEncoder : PC_Model -> Value
+pcModelEncoder model =
+    JE.object
+        [ ( "pc"     , pcEncoder      model.pc     )
+        , ( "uCodes" , uCodesEncoder  model.uCodes )
+        ]
+
+pcEncoder : PC -> Value
+pcEncoder pc =
+    JE.object 
+        [ ( "addressBus"        , JE.int pc.addressBus        )
+        , ( "dataBus"           , JE.int pc.dataBus           )
+        , ( "instructionReg"    , JE.int pc.instructionReg    )
+        , ( "programmCounter"   , JE.int pc.programmCounter   )
+        , ( "uCounter"          , JE.int pc.uCounter          )
+        , ( "accumulator"       , JE.int pc.accumulator       )
+        , ( "ram"               , ramEncoder pc.ram           )
+        ]
+
+ramEncoder : Array (Int, String) -> Value
+ramEncoder arr =
+    JE.array 
+        (tuple2Encoder JE.int JE.string) 
+        arr
+
+uCodesEncoder : Array UAction -> Value
+uCodesEncoder uActions =
+    JE.array encodeSingleuCode uActions
+
+encodeSingleuCode : UAction -> Value
+encodeSingleuCode action =
+    let
+        uCode = uAction2UCode action
+    in
+    JE.string uCode.id
+
+
+tuple2Encoder : (a -> Value) -> (b -> Value) -> (a,b) -> Value
+tuple2Encoder encA encB (valA, valB) =
+    JE.list identity [ encA valA, encB valB ]
+
+-- ##########################################################
+-- ##########################################################
+-- Done.

src/PC/PC.elm

@@ -0,0 +1,28 @@
+module PC.PC            exposing (..)
+
+import Html             exposing (Html)
+--import Json.Encode as JE
+import Json.Decode as JD
+
+import PC.Types         exposing (..)
+import PC.Defaults      exposing (..)
+import PC.Helpers       exposing (..)
+import PC.Update        exposing (..)
+import PC.View          exposing (..)
+
+
+
+update : PC_Msg -> PC_Model -> (PC_Model, PC_AfterUpdateAction)
+update = pc_update
+
+
+view : PC_Model -> Html PC_Msg
+view = pc_view
+
+init : PC_Model
+init = initalModel
+
+
+
+
+

src/PC/Types.elm

@@ -0,0 +1,92 @@
+module PC.Types exposing (..)
+
+import Array    exposing (Array)
+
+pcModelVersion = "4"
+
+type alias PC_Model =
+    { pc        : PC
+    , uCodes    : Array UAction
+    }
+
+type alias PC =
+    { ram               : Array (Int, String)
+    , dataBus           : Int
+    , addressBus        : Int
+    , instructionReg    : Int
+    , programmCounter   : Int
+    , uCounter          : Int
+    , accumulator       : Int
+    }
+
+type alias UCode =
+    { variant           : UAction
+    , id                : String
+    , action            : PC -> PC
+    , label             : String
+    }
+
+-- UActions that can be used in µCode
+type UAction
+    = UA_ALU_Accumulator2DataBus
+    | UA_ALU_AccumulatorDecrement
+    | UA_ALU_AccumulatorIncrement
+    | UA_ALU_AccumulatorShiftLeftByDataBus
+    | UA_ALU_AccumulatorShiftRightByDataBus
+    | UA_ALU_AccumulatorAddByDataBus
+    | UA_ALU_AccumulatorSubtractByDataBus
+    | UA_ALU_AccumulatorMultiplyByDataBus
+    | UA_ALU_AccumulatorDivideByDataBus
+    | UA_ALU_AccumulatorANDDataBus
+    | UA_ALU_AccumulatorORDataBus
+    | UA_ALU_AccumulatorXORDataBus
+    | UA_ALU_AccumulatorNOT
+    | UA_CU_InstructionReg2AddressBus
+    | UA_CU_InstructionReg2DataBus
+    | UA_CU_InstructionReg2ProgrammCounter
+    | UA_CU_InstructionReg2UCounter
+    | UA_CU_ProgrammCounterIncrement
+    | UA_CU_InstructionReg2ProgrammCounterIfAccEq0
+    | UA_CU_ProgrammCounter2AddressBus
+    | UA_CU_ResetUCounter
+    | UA_DataBus2Accumulator
+    | UA_DataBus2InstructionReg
+    | UA_DataBus2Ram
+    | UA_Ram2DataBus
+    | UA_AlertUser
+    | UA_Nothing
+
+
+-- To make it easier to understand everything has name convention
+-- PM_      -> PC_Msg in general
+-- PM_B_    -> for a Button
+-- PM_C_    -> for a Checkbox
+-- PM_F_    -> for a TextField
+type PC_Msg 
+    = PM_B_UCycleStep
+    | PM_B_InstructionStep
+    | PM_B_Reset
+    | PM_B_RamAddBelow
+    | PM_B_CuAddBelow
+    | PM_F_RamEditInstr         Int String
+    | PM_F_RamEditAddress       Int String
+    | PM_F_RamEditComment       Int String
+    | PM_F_CuEditAction         Int String
+    | PM_F_CuInstrRegEditAddr   String
+    | PM_F_CuInstrRegEditInstr  String
+    | PM_F_CuProgCounterEdit    String
+    | PM_F_CuUCounterEdit       String
+    | PM_F_EditAddressBus       String
+    | PM_F_EditDataBus          String
+    | PM_F_AluEdit              String
+    | PM_ManualStep             UAction
+
+
+-- Tells main what is supposed
+-- to happen after a update
+type PC_AfterUpdateAction
+    = PUA_Nothing                   -- Do nothing
+    | PUA_Alert                     -- Alert the user
+    | PUA_Storage                   -- Update localStorage
+    | PUA_Scroller                  -- Scroll to value
+    | PUA_Storage_And_Scroller      -- Update localStorage and scroll to values

src/PC/UActions.elm

@@ -0,0 +1,226 @@
+module PC.UActions      exposing ( uCodes
+                                 , uAction2Label
+                                 , string2uAction
+                                 , uAction2UCode )
+
+import Array            exposing (Array)
+import Tuple
+import Bitwise
+
+import PC.Types         exposing (..)
+import PC.Helpers       exposing (..)
+
+uCodes : List UCode
+uCodes =
+    [ UCode UA_Nothing                              "n"         (\s -> s)                       "Empty"                  
+    , UCode UA_ALU_Accumulator2DataBus              "acc2db"    actAccumulator2DataBus          "Acc -> DataBus"         
+    , UCode UA_ALU_AccumulatorDecrement             "accDec"    actAccumulatorDecrement         "Acc --"                 
+    , UCode UA_ALU_AccumulatorIncrement             "accInc"    actAccumulatorIncrement         "Acc ++"                 
+    , UCode UA_ALU_AccumulatorShiftLeftByDataBus    "accLsN"    actAccumulatorShiftLeft         "Acc << DataBus"         
+    , UCode UA_ALU_AccumulatorShiftRightByDataBus   "accRsN"    actAccumulatorShiftRight        "Acc >> DataBus"         
+    , UCode UA_ALU_AccumulatorAddByDataBus          "accAdd"    actAccumulatorAdd               "Acc + DataBus"          
+    , UCode UA_ALU_AccumulatorSubtractByDataBus     "accSub"    actAccumulatorSub               "Acc - DataBus"          
+    , UCode UA_ALU_AccumulatorMultiplyByDataBus     "accMul"    actAccumulatorMultiply          "Acc * DataBus"          
+    , UCode UA_ALU_AccumulatorDivideByDataBus       "accDiv"    actAccumulatorDivide            "Acc / DataBus"          
+    , UCode UA_ALU_AccumulatorANDDataBus            "accAND"    actAccumulatorAND               "Acc AND DataBus"        
+    , UCode UA_ALU_AccumulatorORDataBus             "accOR"     actAccumulatorOR                "Acc OR DataBus"         
+    , UCode UA_ALU_AccumulatorXORDataBus            "accXOR"    actAccumulatorXOR               "Acc XOR DataBus"        
+    , UCode UA_ALU_AccumulatorNOT                   "accNOT"    actAccumulatorNOT               "Acc NOT"                
+    , UCode UA_CU_InstructionReg2AddressBus         "ir2ab"     actInstructionReg2AddressBus    "InstReg -> AddrBus"     
+    , UCode UA_CU_InstructionReg2DataBus            "ir2db"     actInstructionReg2DataBus       "InstReg -> DataBus"     
+    , UCode UA_CU_InstructionReg2ProgrammCounter    "ir2pc"     actInstructionReg2ProgrammCounter "InstReg -> ProgCount" 
+    , UCode UA_CU_InstructionReg2UCounter           "ir2uc"     actInstructionReg2UCounter      "InstReg -> µCounter"    
+    , UCode UA_CU_ProgrammCounterIncrement          "pcInc"     actProgrammCounterIncrement     "ProgCounter ++"         
+    , UCode UA_CU_ProgrammCounter2AddressBus        "pc2ab"     actProgrammCounter2AddressBus   "ProgCounter -> AddrBus" 
+    , UCode UA_CU_ResetUCounter                     "ucReset"   actResetUCounter                "µCounter = 0"           
+    , UCode UA_CU_InstructionReg2ProgrammCounterIfAccEq0 
+                        "ir2pciacceq0" actInstructionReg2ProgrammCounterIfAccEq0 "Acc == 0 => InstReg -> ProgCounter"    
+    , UCode UA_DataBus2Accumulator                  "db2acc"    actDataBus2Accumulator          "DataBus -> Acc"         
+    , UCode UA_DataBus2InstructionReg               "db2ir"     actDataBus2InstructionReg       "DataBus -> InstReg"     
+    , UCode UA_DataBus2Ram                          "db2ram"    actDataBus2Ram                  "DataBus -> Ram"         
+    , UCode UA_Ram2DataBus                          "ram2db"    actRam2DataBus                  "Ram -> DataBus"         
+    , UCode UA_AlertUser                            "alert"     actDoAlert                      "Signal End of Programm" 
+    ]
+
+
+-- #######################################################################################
+-- ACTIONS
+-- #######################################################################################
+
+actRam2DataBus : PC -> PC
+actRam2DataBus pc =
+    let
+        ab =
+            pc.addressBus
+
+        db =
+            Tuple.first <| valueAtRam ab pc.ram
+    in
+    { pc | dataBus = db }
+
+
+actDataBus2InstructionReg : PC -> PC
+actDataBus2InstructionReg pc =
+    { pc | instructionReg = pc.dataBus }
+
+
+actResetUCounter : PC -> PC
+actResetUCounter pc =
+    { pc | uCounter = 0 }
+
+
+actInstructionReg2UCounter : PC -> PC
+actInstructionReg2UCounter pc =
+    -- Multiply by ten, because every instruction is 10 uCodes long
+    let
+        (instruction, address) = seperateInstructionsEntry pc.instructionReg
+    in
+    { pc | uCounter = instruction * 10}
+
+
+actInstructionReg2AddressBus : PC -> PC
+actInstructionReg2AddressBus pc =
+    let
+        (instruction, address) = seperateInstructionsEntry pc.instructionReg
+    in
+    { pc | addressBus = address }
+
+actInstructionReg2DataBus : PC -> PC
+actInstructionReg2DataBus pc =
+    let
+        (_, data) = seperateInstructionsEntry pc.instructionReg
+    in
+    { pc | dataBus = data }
+
+actInstructionReg2ProgrammCounter : PC -> PC
+actInstructionReg2ProgrammCounter pc =
+    let
+        (instruction, address) = seperateInstructionsEntry pc.instructionReg
+    in
+    
+    { pc | programmCounter = address }
+
+
+actProgrammCounterIncrement : PC -> PC
+actProgrammCounterIncrement pc =
+    { pc | programmCounter = pc.programmCounter + 1 }
+
+
+actProgrammCounter2AddressBus : PC -> PC
+actProgrammCounter2AddressBus pc =
+    { pc | addressBus = pc.programmCounter }
+
+actInstructionReg2ProgrammCounterIfAccEq0 : PC -> PC
+actInstructionReg2ProgrammCounterIfAccEq0 pc =
+    if pc.accumulator == 0 then
+        let
+            (_,addr) = seperateInstructionsEntry pc.instructionReg
+        in
+        { pc | programmCounter = addr }
+    else
+        pc
+
+actDataBus2Accumulator : PC -> PC
+actDataBus2Accumulator pc =
+    { pc | accumulator = pc.dataBus }
+
+
+actAccumulator2DataBus : PC -> PC
+actAccumulator2DataBus pc =
+    { pc | dataBus = pc.accumulator }
+
+
+actAccumulatorIncrement : PC -> PC
+actAccumulatorIncrement pc =
+    { pc | accumulator = pc.accumulator + 1 }
+
+
+actAccumulatorDecrement : PC -> PC
+actAccumulatorDecrement pc =
+    { pc | accumulator = pc.accumulator - 1 }
+
+actAccumulatorShiftLeft : PC -> PC
+actAccumulatorShiftLeft pc = 
+    { pc | accumulator = pc.accumulator * (2 ^ pc.dataBus) }
+
+actAccumulatorShiftRight : PC -> PC
+actAccumulatorShiftRight pc = 
+    { pc | accumulator = pc.accumulator // (2 ^ pc.dataBus) }
+
+actAccumulatorAdd : PC -> PC
+actAccumulatorAdd pc = 
+    { pc | accumulator = pc.accumulator + pc.dataBus }
+
+actAccumulatorSub : PC -> PC
+actAccumulatorSub pc = 
+    { pc | accumulator = pc.accumulator - pc.dataBus }
+
+actAccumulatorMultiply : PC -> PC
+actAccumulatorMultiply pc = 
+    { pc | accumulator = pc.accumulator * pc.dataBus }
+
+actAccumulatorDivide : PC -> PC
+actAccumulatorDivide pc = 
+    { pc | accumulator = pc.accumulator // pc.dataBus }
+
+actAccumulatorAND : PC -> PC
+actAccumulatorAND pc =
+    { pc | accumulator = Bitwise.and pc.accumulator pc.dataBus }
+
+actAccumulatorOR : PC -> PC
+actAccumulatorOR pc =
+    { pc | accumulator = Bitwise.or pc.accumulator pc.dataBus }
+
+actAccumulatorXOR : PC -> PC
+actAccumulatorXOR pc =
+    { pc | accumulator = Bitwise.xor pc.accumulator pc.dataBus }
+
+actAccumulatorNOT : PC -> PC
+actAccumulatorNOT pc =
+    { pc | accumulator = Bitwise.complement pc.accumulator }
+
+
+
+actDataBus2Ram : PC -> PC
+actDataBus2Ram pc =
+    let
+        newRam =
+            changeAtRam pc.addressBus pc.dataBus pc.ram
+    in
+    { pc | ram = newRam }
+
+actDoAlert : PC -> PC
+actDoAlert pc = pc      -- This gets caputred by update anyway
+
+
+-- #################################################################
+-- Helpers
+-- #################################################################
+
+uAction2Label : UAction -> String
+uAction2Label variant =
+    let
+        filtered_list = List.filter (\u -> u.variant == variant ) uCodes
+    in
+    case List.head filtered_list of
+        Just uCode -> uCode.label
+        Nothing -> "IDK"
+
+uAction2UCode : UAction -> UCode
+uAction2UCode variant =
+    let
+        filtered_list = List.filter (\u -> u.variant == variant ) uCodes
+    in
+    case List.head filtered_list of
+        Just uCode  -> uCode
+        Nothing     -> UCode UA_Nothing "n" (\s -> s) "Empty" 
+
+string2uAction : String -> Maybe UAction
+string2uAction str =
+    let
+        filtered_list = List.filter (\u -> u.id == str) uCodes
+    in
+    case List.head filtered_list of
+        Just uCode -> Just uCode.variant
+        _ -> Nothing
+

src/PC/Update.elm

@@ -0,0 +1,233 @@
+module PC.Update        exposing (pc_update)
+
+import Array            exposing (Array)
+
+import PC.Types         exposing (..)
+import PC.UActions      exposing (..)
+import PC.Defaults      exposing (..)
+import PC.Helpers       exposing (..)
+
+
+pc_update : PC_Msg -> PC_Model -> (PC_Model, PC_AfterUpdateAction)
+pc_update msg model =
+    case msg of
+        PM_B_UCycleStep ->
+            let (new_model, reqAlert) = uStepPC model
+            in
+            ( new_model
+            ,  if reqAlert == True            then PUA_Alert
+               else if model.pc.uCounter == 0 then PUA_Storage_And_Scroller
+               else                                PUA_Scroller
+            )
+
+        PM_B_InstructionStep -> 
+            let (new_model, reqAlert) = executeInstruction model
+            in 
+            ( new_model
+            , if reqAlert then PUA_Alert
+              else PUA_Storage_And_Scroller 
+            )
+
+
+        PM_B_Reset ->
+            ( { model | pc = { initialPC | ram = model.pc.ram } }
+            , PUA_Storage_And_Scroller )
+
+        PM_B_RamAddBelow ->
+            let
+                old_pc = model.pc
+                new_pc = {old_pc | ram = Array.append old_pc.ram <| Array.fromList [(0, "")]}
+            in
+            ({model | pc = new_pc}
+            , PUA_Storage)
+
+        PM_B_CuAddBelow ->
+            ({model | uCodes = Array.append model.uCodes <| Array.repeat 10 UA_Nothing}
+            , PUA_Storage)
+
+        PM_F_RamEditAddress addr may_int ->
+            case String.toInt may_int of
+                Just int ->
+                    let 
+                        (inst,_) = seperateInstructionsEntry ( Tuple.first <| valueAtRam addr model.pc.ram )
+                        new_val = inst * 100000 + int
+                        old_pc = model.pc
+                        new_pc = { old_pc | ram = (changeAtRam addr new_val old_pc.ram) }
+                    in
+                    ({ model | pc = new_pc }, PUA_Storage)
+                _ -> (model, PUA_Nothing)
+
+        PM_F_RamEditInstr addr may_int ->
+            case String.toInt may_int of
+                Just int ->
+                    let 
+                        (_,address) = seperateInstructionsEntry ( Tuple.first <| valueAtRam addr model.pc.ram )
+                        new_val = int * 100000 + address
+                        old_pc = model.pc
+                        new_pc = { old_pc | ram = (changeAtRam addr new_val old_pc.ram) }
+                    in
+                    ({ model | pc = new_pc }, PUA_Storage)
+                _ -> ( model, PUA_Nothing )
+        
+        
+        PM_F_RamEditComment addr str ->
+            let
+                (val, _) = valueAtRam addr model.pc.ram
+                old_pc = model.pc
+                new_pc = { old_pc | ram = overwriteAt_Arr (0,"") addr (val, str) old_pc.ram }
+            in
+                ({ model | pc = new_pc }, PUA_Storage)
+
+        PM_F_CuEditAction addr may_action ->
+            case string2uAction may_action of
+                Just action ->
+                    let
+                        newCode = Array.set addr action model.uCodes
+                    in
+                    ({ model | uCodes = newCode }, PUA_Storage)
+                _ -> ( model, PUA_Nothing )
+
+        
+        PM_F_CuInstrRegEditAddr text ->
+            case String.toInt text of
+                Just int ->
+                    let old_pc = model.pc
+                        (instr,_) = seperateInstructionsEntry old_pc.instructionReg
+                        new_pc = { old_pc | instructionReg = instr * 100000 + int }
+                    in
+                    ({ model | pc = new_pc }, PUA_Storage)
+                _ -> ( model, PUA_Nothing )
+
+        PM_F_CuInstrRegEditInstr text ->
+            case String.toInt text of
+                Just int ->
+                    let old_pc = model.pc
+                        (_,addr) = seperateInstructionsEntry old_pc.instructionReg
+                        new_pc = { old_pc | instructionReg = int * 100000 + addr }
+                    in
+                    ({ model | pc = new_pc }, PUA_Storage)
+                _ -> ( model, PUA_Nothing )
+
+        PM_F_CuProgCounterEdit text ->
+            case String.toInt text of
+                Just int ->
+                    let old_pc = model.pc
+                        new_pc = { old_pc | programmCounter = int }
+                    in
+                    ({ model | pc = new_pc }, PUA_Storage)
+                _ -> ( model, PUA_Nothing )
+
+        PM_F_CuUCounterEdit text ->
+            case String.toInt text of
+                Just int ->
+                    let old_pc = model.pc
+                        new_pc = { old_pc | uCounter = int }
+                    in
+                    ( { model | pc = new_pc }, PUA_Storage_And_Scroller )
+                _ -> ( model, PUA_Nothing )
+
+        PM_F_EditAddressBus text ->
+            case String.toInt text of
+                Just int ->
+                    let old_pc = model.pc
+                        new_pc = { old_pc | addressBus = int }
+                    in
+                    ( { model | pc = new_pc }, PUA_Storage_And_Scroller )
+                _ -> ( model, PUA_Nothing )
+
+        PM_F_EditDataBus text ->
+            case String.toInt text of
+                Just int ->
+                    let old_pc = model.pc
+                        new_pc = { old_pc | dataBus = int }
+                    in
+                    ({ model | pc = new_pc }, PUA_Storage)
+                _ -> ( model, PUA_Nothing )
+
+        PM_F_AluEdit text ->
+            case String.toInt text of
+                Just int ->
+                    let old_pc = model.pc
+                        new_pc = { old_pc | accumulator = int }
+                    in
+                    ({ model | pc = new_pc }, PUA_Storage)
+                _ -> ( model, PUA_Nothing )
+
+        
+        PM_ManualStep action ->
+            let
+                instruction = getAction action
+                new_model = { model | pc = instruction model.pc }
+            in
+            ( new_model, PUA_Storage_And_Scroller )
+
+-- ###############################################################################
+-- ###############################################################################
+
+
+
+-- ###############################################################################
+-- Update Helpers
+-- ###############################################################################
+
+-- Practically a part of uStepPC but sepeated for manual mode
+getAction : UAction -> (PC -> PC)
+getAction uAction =
+    let
+        possible_instructions =
+            List.filter (\u -> u.variant == uAction) uCodes
+    in
+    case List.head possible_instructions of
+        Just uCode ->
+            uCode.action
+        _ ->
+            (\s -> s)
+    
+
+uStepPC : PC_Model -> (PC_Model, Bool)
+uStepPC model =
+    let
+        uCounter =
+            model.pc.uCounter
+
+        may_code : Maybe UAction
+        may_code = Array.get uCounter model.uCodes
+            --valueAt uCounter model.uCodes
+    in
+    case may_code of
+        Just code ->
+            let
+                -- code :: UAction
+                old_pc  = model.pc
+                temp_pc = { old_pc | uCounter = uCounter + 1 }
+
+                uCode   = uAction2UCode code
+                f       = uCode.action
+                new_pc = f temp_pc
+            in 
+            if uCode.variant == UA_AlertUser then
+                (model, True)
+            else
+                ({ model | pc = new_pc }, False)
+
+        _ ->
+            (model, False)
+
+
+executeInstruction : PC_Model -> (PC_Model, Bool)
+executeInstruction model =
+    let
+        (new_model, reqAlert) = uStepPC model
+    in
+    if new_model.pc.uCounter == 1 then
+        (new_model, reqAlert)
+    else
+        if reqAlert then
+            (new_model, True)
+        else
+            executeInstruction new_model
+
+
+-- ###############################################################################
+-- ###############################################################################
+-- Done.

src/PC/View.elm

@@ -0,0 +1,379 @@
+module PC.View exposing (pc_view)
+
+import Html                         exposing (Html, button, div, h1, p, text)
+import Html.Attributes  as HAttr    exposing (class, classList, value)
+import Html.Events      as HEvent   exposing (onClick, onInput)
+import Html.Lazy                    exposing (lazy)
+import Array                        exposing (Array)
+import Json.Decode      as JD
+
+import PC.Types                     exposing (..)
+import PC.UActions                  exposing (..)
+import PC.Helpers                   exposing (..)
+
+pc_view : PC_Model -> Html PC_Msg
+pc_view model = div []
+    [ div 
+        [ class "grid-fullwidth", class "grid-addressbus" ] 
+        [ lazy viewAddressBus model ]
+    , lazy viewRam model
+    , lazy viewCu  model
+    , lazy viewAlu model
+    , div 
+        [ class "grid-fullwidth", class "grid-databus" ] 
+        [ lazy viewDataBus    model ]
+    ]
+
+-- #####################################################################
+-- #####################################################################
+
+
+
+-- #####################################################################
+-- RAM
+-- #####################################################################
+
+viewRam : PC_Model -> Html PC_Msg
+viewRam model =
+    div [ class "section", class "ram" ]
+        [ h1  [ class "header" ] [ text "RAM" ]
+        , div [ class "arrow-line", class "top" ]
+            [ div [ class "arrow", class "down"] [ div [] [] , div [] [] ]
+            ]
+        , div [ class "scroller" ]
+            [ Html.table [ class "" ]
+                [ Html.thead [ class "head" ]
+                    [ Html.tr []
+                        [ Html.th [ class "address" ] [ text "Addr" ]
+                        , Html.th [] [ text "Value" ]
+                        , Html.th [] [ text "Comment" ]
+                        ]
+                    ]
+                , lazy viewRamContent model
+                ]
+            ]
+        , div [ class "arrow-line", class "bottom" ]
+            [ drawArrow Down UA_Ram2DataBus "Ram -> DataBus"
+            , drawArrow Up   UA_DataBus2Ram "DataBus -> Ram"
+            ]
+        ]
+
+
+viewRamContent : PC_Model -> Html PC_Msg
+viewRamContent model =
+    let
+        --indexedRam =
+        --    List.indexedMap Tuple.pair <| Array.toList model.pc.ram
+
+        ram2table : Int -> (Int, String) -> Html PC_Msg
+        ram2table id entry =
+            let
+                (val,comment) = entry
+
+                (instruction, address) = seperateInstructionsEntry val
+            in
+            Html.tr
+                [ classList [ ( "current", id == model.pc.addressBus ) ] ]
+                [ Html.td [ class "num" ] [ text (addLeadingZero id 3) ]
+                , Html.td [ class "num " ] 
+                    [ Html.input 
+                        [ HAttr.type_ "number"
+                        , HAttr.value <| addLeadingZero instruction 3
+                        , onInput <| PM_F_RamEditInstr id
+                        , class "ram-entry"
+                        , class "instruction"
+                        ]
+                        []
+                    , Html.input 
+                        [ HAttr.type_ "number"
+                        , HAttr.value <| addLeadingZero address 5
+                        , onInput <| PM_F_RamEditAddress id
+                        , class "ram-entry"
+                        , class "address"
+                        ]
+                        []
+                    ]
+                , Html.td[ class "comment" ]
+                    [ Html.input
+                        [ HAttr.type_ "text"
+                        , HAttr.value comment
+                        , onInput <| PM_F_RamEditComment id ]
+                        []
+                    ]
+                ]
+    in
+    Html.tbody [] 
+        ((Array.toList <| Array.indexedMap ram2table model.pc.ram)
+        ++
+        [ Html.tr [] 
+            [ Html.td [] []
+            , Html.td [] 
+                [ button 
+                    [ onClick PM_B_RamAddBelow  ] 
+                    [ text "Add Entry"] 
+                ]
+            , Html.td [][]
+            ]
+        ]
+        )
+
+-- #####################################################################
+-- #####################################################################
+
+
+
+
+-- #####################################################################
+-- Control Unit
+-- #####################################################################
+
+viewCu : PC_Model -> Html PC_Msg
+viewCu model =
+    let
+        ( instrRegInst, instrRegAddr ) = seperateInstructionsEntry model.pc.instructionReg
+    in
+    div [ class "section", class "cu" ]
+        [ div [ class "arrow-line", class "top" ]
+            [ drawArrow Up UA_CU_InstructionReg2AddressBus  "InstR -> AddrB"
+            , drawArrow Up UA_CU_ProgrammCounter2AddressBus "ProgCounter -> AddrB"
+            ]
+        , h1 [ class "header" ] [ text "Control Unit" ]
+        , div [ class "action-area" ]
+            [ -- Programm Counter
+              Html.label [ HAttr.for "cu-progcounter" ] [ text "Programm Counter:" ]
+            , button 
+                [ onClick <| PM_ManualStep UA_CU_InstructionReg2ProgrammCounter ]
+                [ text "InstRA -> " ]
+            , Html.input
+                [ HAttr.type_ "number"
+                , HAttr.id "cu-progcounter"
+                , value (addLeadingZero model.pc.programmCounter 3)
+                , onInput PM_F_CuProgCounterEdit
+                ] []
+            -- IR
+            , Html.label [HAttr.for "cu-instrReg"  ] [ text "Instruction Register:" ]
+            , Html.input
+                [ HAttr.type_ "number"
+                , HAttr.id "cu-instrReg"
+                , class "instruction"
+                , value (addLeadingZero instrRegInst 3)
+                , onInput PM_F_CuInstrRegEditInstr
+                ] []
+            , Html.input
+                [ HAttr.type_ "number"
+                , HAttr.id "cu-instrReg"
+                , class "address"
+                , value (addLeadingZero instrRegAddr 5)
+                , onInput PM_F_CuInstrRegEditAddr
+                ] []
+            -- µCounter
+            , Html.label [ HAttr.for "cu-uCounter" ] [ text "µCode Counter:" ]
+            , button 
+                [ onClick <| PM_ManualStep UA_CU_InstructionReg2UCounter ]
+                [ text "IntrRI ->" ]
+            , Html.input
+                [ HAttr.type_ "number"
+                , HAttr.id "cu-uCounter"
+                , value (addLeadingZero model.pc.uCounter 4)
+                , onInput PM_F_CuUCounterEdit
+                ] []
+            ]
+        , div [ class "scroller" ]
+            [ viewCuUCode model
+            ]
+        , div [ class "arrow-line", class "bottom" ]
+            [ drawArrow Up UA_DataBus2InstructionReg "DB -> InstR"
+            , drawArrow Down UA_CU_InstructionReg2DataBus "InstR -> DB"
+            ]
+        ]
+
+
+viewCuUCode : PC_Model -> Html PC_Msg
+viewCuUCode model =
+    Html.table []
+        [ Html.thead [ class "head" ]
+            [ Html.tr []
+                [ Html.th [ class "address" ] [ text "µCounter" ]
+                , Html.th [] [ text "µCode" ]
+                ]
+            ]
+        , lazy viewCuUCodeContent model
+        ]
+
+
+viewCuUCodeContent : PC_Model -> Html PC_Msg
+viewCuUCodeContent model =
+    let
+        list2table : Int -> UAction -> Html PC_Msg
+        list2table id code =
+            Html.tr
+                [ classList [ ( "current", id == model.pc.uCounter ), ("empty", code == UA_Nothing) ] ]
+                [ Html.td [ class "num" ] [ text (addLeadingZero id 4) ]
+                , Html.td [] [ viewCuInstrSelect id code ]
+                ]
+
+    in
+    Html.tbody [] 
+        ((Array.toList <| Array.indexedMap list2table model.uCodes)
+        ++ 
+        [ Html.tr [] 
+            [ Html.td [] []
+            , Html.td [] 
+                [ button
+                    [ onClick PM_B_CuAddBelow  ] 
+                    [ text "Add Entry"] 
+                ]
+            ]
+        ]
+        )
+
+viewCuInstrSelect : Int -> UAction -> Html PC_Msg
+viewCuInstrSelect id current =
+    let
+        info2option uCode = 
+                Html.option 
+                    [ HAttr.selected (uCode.variant == current)
+                    , HAttr.value     uCode.id      ] 
+                    [ text            uCode.label   ]
+        listOptions = List.map info2option uCodes
+    in
+    Html.select
+        [ HEvent.on "change" ( JD.map (PM_F_CuEditAction id) selectCuValueDecoder) ]
+        listOptions
+
+viewInstrEntry : Int -> Html PC_Msg
+viewInstrEntry i =
+    let
+        (instruction, address) = seperateInstructionsEntry i
+    in
+    text ( (addLeadingZero instruction 3) ++ "  " ++ (addLeadingZero address 5) )
+
+-- #####################################################################
+-- #####################################################################
+
+
+
+
+-- #####################################################################
+-- ALU
+-- #####################################################################
+
+
+viewAlu : PC_Model -> Html PC_Msg
+viewAlu model =
+    div [ class "section", class "alu" ]
+        [ h1 [ class "header" ] [ text "ALU" ]
+        , p []
+            [ Html.label [ HAttr.for "alu-accumulator" ] [ text "Accumulator:" ]
+            , Html.input
+                [ HAttr.type_ "number"
+                , HAttr.id "alu-accumulator"
+                , value (addLeadingZero model.pc.accumulator 8)
+                , onInput PM_F_AluEdit
+                ] []
+            ]
+        , div []
+            [ Html.span [] [ text "General µActions" ]
+            , Html.br [] []
+            , div [ class "button-group-alu__2-elements" ]
+                [ button [ onClick <| PM_ManualStep UA_ALU_AccumulatorIncrement ]           [ text "Acc ++" ]
+                , button [ onClick <| PM_ManualStep UA_ALU_AccumulatorDecrement ]           [ text "Acc --" ]
+                ]
+            ]
+        , div []
+            [ Html.span [] [ text "µActions from DataBus" ]
+            , div [ class "button-group-alu__2-elements" ]
+                [ button [ onClick <| PM_ManualStep UA_ALU_AccumulatorShiftLeftByDataBus ]  [ text "LeftShift"]
+                , button [ onClick <| PM_ManualStep UA_ALU_AccumulatorShiftRightByDataBus ] [ text "RightShift" ]
+                ]
+            , div [ class "button-group-alu__4-elements" ]
+                [ button [ onClick <| PM_ManualStep UA_ALU_AccumulatorAddByDataBus ]        [ text "+" ]
+                , button [ onClick <| PM_ManualStep UA_ALU_AccumulatorSubtractByDataBus ]   [ text "-" ]
+                , button [ onClick <| PM_ManualStep UA_ALU_AccumulatorMultiplyByDataBus ]   [ text "*" ]
+                , button [ onClick <| PM_ManualStep UA_ALU_AccumulatorDivideByDataBus ]     [ text "/" ]
+                ]
+            , Html.span [] [ text "Bitwise operations"]
+            , div [ class "button-group-alu__4-elements" ]
+                [ button [ onClick <| PM_ManualStep UA_ALU_AccumulatorANDDataBus ]          [ text "AND" ]
+                , button [ onClick <| PM_ManualStep UA_ALU_AccumulatorORDataBus ]           [ text "OR" ]
+                , button [ onClick <| PM_ManualStep UA_ALU_AccumulatorXORDataBus ]          [ text "XOR" ]
+                , button [ onClick <| PM_ManualStep UA_ALU_AccumulatorNOT ]                 [ text "NOT" ]
+                ]
+            ]
+        , div [ class "arrow-line", class "bottom" ]
+            [ drawArrow Up UA_DataBus2Accumulator        "DB -> ALU"
+            , drawArrow Down UA_ALU_Accumulator2DataBus  "ALU -> DB"
+            ]
+        ]
+
+-- #####################################################################
+-- Busses
+-- #####################################################################
+
+viewDataBus : PC_Model -> Html PC_Msg
+viewDataBus model =
+    div [ class "databus" ]
+        [ Html.span [ class "label" ] [ text "Databus" ]
+        , Html.span [] 
+            [ Html.input 
+                [ HAttr.type_ "number"
+                , value (addLeadingZero model.pc.dataBus 8)
+                , onInput PM_F_EditDataBus
+                ] []
+            ]
+        ]
+
+
+viewAddressBus : PC_Model -> Html PC_Msg
+viewAddressBus model =
+    div [ class "addressbus" ]
+        [ Html.span [ class "label" ] [ text "Addressbus" ]
+        , Html.span [] 
+            [ Html.input 
+                [ HAttr.type_ "number"
+                , value (addLeadingZero model.pc.addressBus 3)
+                , onInput PM_F_EditAddressBus
+                ] []
+            ]
+        ]
+
+
+-- #####################################################################
+-- #####################################################################
+
+
+
+-- #####################################################################
+-- Helpers
+-- #####################################################################
+
+type Arrow_Dir = Up  | Down
+
+drawArrow : Arrow_Dir -> UAction -> String -> Html PC_Msg
+drawArrow dir act str =
+    div 
+        [ HAttr.classList
+            [ ("arrow", True)
+            , ("up",   dir == Up)
+            , ("down", dir == Down)
+            ]
+        ]
+        [ div [ class "button" ] 
+            [ Html.a 
+                [ onClick (PM_ManualStep act) ] 
+                [ text str ]
+            ]
+        , div [] []
+        ]
+
+
+selectCuValueDecoder : JD.Decoder String
+selectCuValueDecoder =
+    JD.field "target" ( JD.field "value" JD.string)
+
+
+-- #####################################################################
+-- #####################################################################
+-- Done.
+
+