the user and group system is basically finished, the fs needs progress on creating entries

`inner` -> `directory`

Dockerfile

@@ -1,7 +1,16 @@
-FROM oven/bun AS build
+FROM oven/bun AS builder
 
-COPY package.json astro.config.mjs /tmp/
+WORKDIR /rhpidfyre.io
-COPY src public /tmp/
 
-RUN bun run build
+COPY src package.json vite.config.js tsconfig.json ./
 
+RUN bun run install
+RUN bun run build --emptyOutDir
+
+FROM joseluisq/static-web-server
+
+COPY --from=builder /rhpidfyre.io/dist .
+
+EXPOSE 8787/tcp
+
+ENTRYPOINT [ "static-web-server", "-p", "8787", "-d", "dist/", "-g", "trace" ]

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

package.json

@@ -1,17 +1,16 @@
 {
 	"name": "rhpidfyre.io",
-	"private": true,
 	"version": "0.0.1",
+	"private": true,
 	"type": "module",
+	"devDependencies": {
+		"sass": "^1.89.0",
+		"typescript": "^5.8.3",
+		"vite": "^6.3.5"
+	},
 	"scripts": {
 		"dev": "vite",
 		"build": "tsc && vite build",
 		"preview": "vite preview"
-	},
-	"devDependencies": {
-		"sass": "^1.85.0",
-		"typescript": "^5.7.3",
-		"vite": "^6.1.1",
-		"vite-plugin-html": "^3.2.2"
 	}
 }

src/index.html

@@ -1,5 +1,5 @@
 <!doctype html>
-<html lang="en">
+<html>
 <head>
 	<meta charset="UTF-8"/>
 	<meta name="viewport" content="width=device-width"/>
@@ -56,6 +56,6 @@
 			</style>
 		</noscript>
 	</footer>
-	<script type="module" src="./rt/terminal.ts"></script>
+	<script type="module" src="./rt/emulator/terminal.ts"></script>
 </body>
 </html>

src/rt/crypto/generate.ts

@@ -0,0 +1,24 @@
+interface SHA256 {
+	readonly secret: string
+}
+
+class Crypto {
+	protected inner: string
+
+	constructor(inner: string) {
+		this.inner = inner
+	}
+
+	public async sha256_hash(): Promise<SHA256> {
+		const encoder = new TextEncoder()
+		const hash = await crypto.subtle.digest("SHA-256", encoder.encode(this.inner))
+		const hash_as_uint8 = new Uint8Array(hash)
+
+		return { secret: Array.from(hash_as_uint8).map(byte => byte.toString(16).padStart(2, "0")).join("") }
+	}
+}
+
+export default Crypto
+export {
+	type SHA256
+}

src/rt/elements/create.ts

@@ -1,9 +1,7 @@
-function create<T extends keyof HTMLElementTagNameMap>(element: T, className?: string): HTMLElementTagNameMap[T] {
+export default function create<T extends keyof HTMLElementTagNameMap>(element: T, className?: string): HTMLElementTagNameMap[T] {
 	const new_element = document.createElement(element)
 	if (className) {
 		new_element.className = className
 	}
 	return new_element
 }
-
-export default create

src/rt/elements/layout.ts

@@ -0,0 +1,21 @@
+import create from "./create"
+
+const layout = (type: string) => create("div", type)
+
+function horizontal_wrap() {
+	return layout("stdout-horizontal-wrap")
+}
+
+function horizontal() {
+	return layout("stdout-horizontal")
+}
+
+function vertical() {
+	return layout("stdout-vertical")
+}
+
+export {
+	horizontal_wrap,
+	horizontal,
+	vertical
+}

src/rt/elements/prompt.ts

@@ -1,15 +1,8 @@
 import { cyan, green } from "../shell/color"
-import { get_working_dir_name } from "../shell/fs/fn"
 
+import librfwfs, { username } from "../rfwfs/library"
 import create from "./create"
 
-const userAgent = navigator.userAgent
-const browser_name_fallible = userAgent.match(/Firefox.\d+[\d.\d]+|Chrome.\d+[\d.\d]+/gm)?.map(f => f.split("/")[0])
-let browser_name = "unknown"
-if (browser_name_fallible) {
-	browser_name = browser_name_fallible[0] === "Firefox" ? "gecko" : "chromium"
-}
-
 interface Ps1Prompt {
 	readonly body: HTMLDivElement,
 	readonly input: HTMLInputElement
@@ -23,6 +16,24 @@ let inputs: Inputs = {
 	new: undefined
 }
 
+function browser_name_via_useragent(): string {
+	const userAgent = navigator.userAgent
+	const browser_name_fallible = userAgent.match(/Firefox.\d+[\d.\d]+|Chrome.\d+[\d.\d]+/gm)?.map(f => f.split("/")[0])
+
+	if (browser_name_fallible) {
+		const useragent_name = browser_name_fallible[0]
+		if (useragent_name === "Firefox") {
+			return "gecko"
+		} else if (useragent_name === "Chrome") {
+			return "chromium"
+		}/* else if (useragent_name === "AppleWebKit") {
+			return "safari"
+		} */
+	}
+	return "unknown"
+}
+
+const browser_name = browser_name_via_useragent()
 function ps1_element(user: HTMLSpanElement, dir: HTMLSpanElement) {
 	const display = create("p")
 	display.appendChild(user)
@@ -32,14 +43,20 @@ function ps1_element(user: HTMLSpanElement, dir: HTMLSpanElement) {
 	return display
 }
 
-function working_dir() {
+function working_dir_name() {
-	const dir_name = get_working_dir_name()
+	const dir = librfwfs.home.dir()
-	return dir_name === "user" ? "~" : dir_name
+	if (dir) {
+		const dir_name = dir.name.read()
+		if (dir_name) {
+			return dir_name === username ? "~" : dir_name
+		}
+	}
+	return "?"
 }
 
 function working_dir_element() {
 	const user = cyan("user")
-	const dir = green(" "+working_dir())
+	const dir = green(" "+working_dir_name())
 	return ps1_element(user, dir)
 }
 

src/rt/elements/stdout.ts

@@ -1,18 +1,35 @@
 import { bold } from "../shell/color";
+import { horizontal, vertical } from "./layout";
 
 import create from "./create";
+import wrapindicator from "./wrapindicator";
 
-function stdout_grid(left: string[], right: string[]) {
+function stdout_grid<T extends HTMLElement>(left: string[], right: string[], header?: T) {
-	const root = create("div", "stdout-horizontal")
+	const wrap_indicator = wrapindicator()
-	const container_left = create("div", "stdout-vertical")
+	const container_left = vertical()
-	const container_right = create("div", "stdout-vertical")
+	const container_right = vertical()
 
-	left.forEach(str => container_left.appendChild(stdout_bold(str)))
+	container_left.append(...left.map(str => stdout_bold(str)))
-	right.forEach(str => container_right.appendChild(stdout(str)))
+	container_right.append(...right.map(str => stdout(str)))
 
-	root.appendChild(container_left)
+	if (header) {
-	root.appendChild(container_right)
+		const container_right_header = vertical()
-	return root
+		const help_container = horizontal()
+		help_container.append(container_left, container_right)
+		container_right_header.append(header, help_container)
+		wrap_indicator.appendChild(container_right_header)
+	} else {
+		const container = horizontal()
+		container.append(container_left, container_right)
+		wrap_indicator.appendChild(container)
+	}
+	return wrap_indicator
+}
+
+function stdout_horizontal_elements<T extends HTMLElement>(elements: T[]) {
+	const h_elements_out = horizontal()
+	h_elements_out.append(...elements)
+	return h_elements_out
 }
 
 function stdout_horizontal(strs: string[]) {
@@ -37,7 +54,8 @@ export default function stdout(str: string) {
 }
 
 export {
-	stdout_grid,
+	stdout_horizontal_elements,
 	stdout_horizontal,
+	stdout_grid,
 	stdout_bold
 }

src/rt/elements/wrapindicator.ts

@@ -0,0 +1,9 @@
+import { horizontal_wrap } from "./layout";
+
+import create from "./create";
+
+export default function wrapindicator() {
+	const wi_layout = horizontal_wrap()
+	wi_layout.appendChild(create("div", "wrap-indicator"))
+	return wi_layout
+}

src/rt/emulator/keys.ts

@@ -1,5 +1,5 @@
-import run from "./shell/command/command"
+import run from "../shell/command/command"
-import history from "./shell/history"
+import history from "../shell/history"
 
 type InputClosure = (key_event: KeyboardEvent) => void
 interface EnterArgs {

src/rt/emulator/terminal.ts

@@ -1,5 +1,5 @@
-import history from "./shell/history"
+import history from "../shell/history"
-import prompt from "./elements/prompt"
+import prompt from "../elements/prompt"
 import keys from "./keys"
 
 const term_win_unsafe = document.querySelector("main")

src/rt/fs.ts

@@ -0,0 +1,15 @@
+import rfwfs, { PERMISSION_FLAGS } from "./rfwfs/main"
+
+const time_now = (Date.now()/1000) | 0
+const fs = new rfwfs()
+
+const root = fs.push_bulk_unsafe([
+	rfwfs.directory_in_root({
+		permissions: {wheel: PERMISSION_FLAGS.RWX, users: PERMISSION_FLAGS.NONE},
+		timestamp: time_now,
+		metadata: {},
+		name: "bin"
+	})
+])
+
+export default fs

src/rt/rfwfs/groups.ts

@@ -0,0 +1,179 @@
+import { ROOT_ID } from "./main";
+
+import wrap, { type WrapResult } from "./wrap";
+import User from "./users";
+
+type User_Index = [User, number]
+type WrapUserSearch = WrapResult<User_Index | undefined, GroupSearch>
+
+type SysGroupsNames = "wheel" | "users"
+
+const enum SysGroups {
+	Wheel,
+	Users,
+}
+const enum UserMoveStatus {
+	Ok,
+	RootBlocked,
+	MovingNonExistentUser,
+	AlreadyInWheel,
+	AlreadyInUsers,
+}
+const enum GroupRemoveStatus {
+	Ok,
+	RootBlocked,
+	RemovingNonExistentUser,
+}
+const enum GroupSearch {
+	NotFound,
+	WheelResult,
+	UsersResult,
+}
+
+interface Groups {
+	wheel: Group,
+	users: Group,
+	together: () => User[]
+}
+
+class Group {
+	protected inner: User[];
+	private group_type: SysGroups;
+
+	constructor(type: SysGroups) {
+		this.group_type = type
+		this.inner = []
+	}
+
+	public users(): User[] {
+		return [...this.inner]
+	}
+	public type(): SysGroups {
+		return this.group_type
+	}
+	public type_as_name(): SysGroupsNames {
+		return this.type() === SysGroups.Wheel ? "wheel" : "users"
+	}
+
+	public add_user(user: User): boolean {
+		const duplicate = this.inner.find(user_in_group => user_in_group.uname() === user.uname())
+		if (!duplicate) {
+			this.inner.push(user)
+			return true
+		}
+		return false
+	}
+
+	public remove_user(user: User): User | undefined {
+		for (let i = 0; i<this.inner.length; i++) {
+			if (this.inner[i].uname() === user.uname()) {
+				this.inner.splice(i, 1)
+				return this.inner[i]
+			}
+		}
+		return undefined
+	}
+}
+
+const groups: Groups = {
+	wheel: new Group(SysGroups.Wheel),
+	users: new Group(SysGroups.Users),
+	together: function() {
+		return [...this.wheel.users(), ...this.users.users()]
+	}
+}
+
+function wrap_user_search(status: GroupSearch, result?: User_Index): WrapUserSearch {
+	return wrap(result, status)
+}
+
+function group_iter_for_user(uname: string, group_t: Group): User_Index | undefined {
+	const group_t_users = group_t.users()
+	for (let i = 0; i<group_t_users.length; i++) {
+		if (group_t_users[i].uname() === uname) {
+			return [group_t_users[i], i]
+		}
+	}
+	return undefined
+}
+
+function groups_find_user(uname: string): WrapUserSearch {
+	const exist_in_wheel = group_iter_for_user(uname, groups.wheel)
+	if (exist_in_wheel) {
+		return wrap_user_search(GroupSearch.WheelResult, exist_in_wheel)
+	}
+	const exist_in_users = group_iter_for_user(uname, groups.users)
+	if (exist_in_users) {
+		return wrap_user_search(GroupSearch.UsersResult, exist_in_users)
+	}
+	return wrap_user_search(GroupSearch.NotFound)
+}
+
+function group_add(new_user: User, group_t: Group): GroupSearch {
+	const dups = groups_find_user(new_user.uname())
+	if (dups.status === GroupSearch.NotFound) {
+		group_t.add_user(new_user)
+	}
+	return dups.status
+}
+
+function group_remove(uname: string, group_t: Group): GroupRemoveStatus {
+	if (uname !== ROOT_ID.NAME) {
+		const found_user = group_t.users().find(user => user.uname() === uname)
+		if (found_user) {
+			group_t.remove_user(found_user)
+			return GroupRemoveStatus.Ok
+		}
+		return GroupRemoveStatus.RemovingNonExistentUser
+	}
+	return GroupRemoveStatus.RootBlocked
+}
+
+function group_user_move(uname: string, new_group: SysGroups): UserMoveStatus {
+	if (uname === ROOT_ID.NAME) { return UserMoveStatus.RootBlocked }
+
+	const find_in_group = groups_find_user(uname)
+	if (find_in_group.status === GroupSearch.NotFound) { return UserMoveStatus.MovingNonExistentUser }
+
+	if (new_group === SysGroups.Wheel) {
+		if (find_in_group.status === GroupSearch.WheelResult) { return UserMoveStatus.AlreadyInWheel }
+
+		groups.wheel.add_user(groups.users.remove_user((find_in_group.result as User_Index)[0]) as User)
+	} else if (new_group === SysGroups.Users) {
+		if (find_in_group.status === GroupSearch.UsersResult) { return UserMoveStatus.AlreadyInUsers }
+
+		groups.users.add_user(groups.wheel.remove_user((find_in_group.result as User_Index)[0]) as User)
+	}
+	return UserMoveStatus.Ok
+}
+
+function group_wheel_add(new_user: User): GroupSearch {
+	return group_add(new_user, groups.wheel)
+}
+
+function group_wheel_remove(uname: string): GroupRemoveStatus {
+	return group_remove(uname, groups.wheel)
+}
+
+function group_users_add(new_user: User): GroupSearch {
+	return group_add(new_user, groups.users)
+}
+
+function group_users_remove(uname: string): GroupRemoveStatus {
+	return group_remove(uname, groups.users)
+}
+
+export default groups
+export {
+	group_wheel_remove,
+	group_users_remove,
+	groups_find_user,
+	group_wheel_add,
+	group_users_add,
+	group_user_move,
+	type SysGroupsNames,
+	GroupRemoveStatus,
+	GroupSearch,
+	SysGroups,
+	Group,
+}

src/rt/rfwfs/index.ts

@@ -0,0 +1,24 @@
+import { type Entry } from "./main"
+import wrap, { WrapResult } from "./wrap"
+
+function wrap_bsearch<T extends Entry>(index: number, result: T): WrapResult<T, number> {
+	return wrap(result, index)
+}
+
+export default function directory_search<T extends Entry>(dir_files: T[], file_name: string): WrapResult<T, number> | undefined {
+	let start = 0
+	let end = dir_files.length-1
+	while (start<=end) {
+		const median = (start+end)>>1
+		const median_name = dir_files[median].name.__inner()
+
+		if (median_name === file_name) {
+			return wrap_bsearch(median, dir_files[median])
+		} else if (median_name<file_name) {
+			start = median+1
+		} else {
+			end = median-1
+		}
+	}
+	return undefined
+}

src/rt/rfwfs/library.ts

@@ -0,0 +1,60 @@
+import { wrap_entry, type WrapResultEntry } from "./wrap"
+import { ReadStatus } from "./enum/status"
+
+import rfwfs, { type DirectoryAny, type EntryCollection, type DirectoryAnyDepth } from "./main"
+import fs from "../fs"
+
+type Path = string[]
+
+interface Home {
+	path: () => Path,
+	dir: () => DirectoryAny | undefined,
+}
+interface Librfwfs {
+	home: Home,
+	traverse_to: (path: Path) => WrapResultEntry<DirectoryAny, ReadStatus>
+	pwd_entry: <T extends EntryCollection<T>>(working_dir: T) => Path | undefined
+}
+
+let username: string = "user"
+
+const librfwfs = {} as Librfwfs
+
+librfwfs.traverse_to = function(path) {
+	let traverse = fs
+
+	for (const path_name of path) {
+		const find = traverse.inner.find(path_name)
+
+		if (find.status === ReadStatus.Ok) {
+			if (find.result && rfwfs.is_dir(find.result)) {
+				traverse = find.result as DirectoryAnyDepth
+			} else {
+				return wrap_entry(ReadStatus.Denied)
+			}
+		} else {
+			return wrap_entry(find.status)
+		}
+	}
+	return wrap_entry(ReadStatus.Ok, traverse)
+}
+
+librfwfs.pwd_entry = function(working_dir) {
+
+}
+
+librfwfs.home = {} as Home
+
+librfwfs.home.path = function() {
+	return ["home", username]
+}
+
+librfwfs.home.dir = function() {
+	const traverse = librfwfs.traverse_to(this.path())
+	return traverse.status === ReadStatus.Ok ? traverse.result : undefined
+}
+
+export default librfwfs
+export {
+	username
+}

src/rt/rfwfs/main.ts

@@ -0,0 +1,395 @@
+import wrap, { type WrapResult, ConstEnum, Option } from "./wrap"
+import { SysGroups } from "./groups"
+
+import directory_search from "./index"
+import User, { LibUser } from "./users"
+
+const enum EntryType {
+	Root,
+	File,
+	Directory,
+	Binary,
+	SymLink,
+}
+const enum PushStatus {
+	Ok,
+	Duplicate,
+	Denied,
+}
+const enum ReadStatus {
+	Ok,
+	NotFound,
+	NotInGroup,
+	Denied,
+}
+const enum ModifyStatus {
+	Ok,
+	NotInGroup,
+	Denied,
+}
+const enum ModifyAccessType {
+	Read,
+	Write,
+}
+
+const enum ROOT_ID {
+	TRUNK = "/",
+	NAME  = "root",
+	UID   = 0,
+}
+const enum PERMISSION_FLAGS {
+	NONE = -1,
+	R    = 1 << 0,
+	W    = 1 << 1,
+	X    = 1 << 2,
+	RWX  = PERMISSION_FLAGS.R | PERMISSION_FLAGS.W | PERMISSION_FLAGS.X
+}
+
+interface Permissions<W = Gate<PERMISSION_FLAGS>, U = Gate<PERMISSION_FLAGS>> {
+	wheel: W,
+	users: U,
+}
+type GroupPermissionsRoot = Permissions<Gate<PERMISSION_FLAGS>, Gate<PERMISSION_FLAGS.NONE>>
+
+interface Metadata {
+	[index: string]: string
+}
+
+interface Entry<
+	T extends EntryType = EntryType,
+	P extends Permissions = Permissions,
+	N = Gate<string>
+> {
+	readonly type: T,
+	permissions: P,
+	timestamp: Gate<number>,
+	metadata: Gate<Metadata>,
+	group: Gate<SysGroups>,
+	owner: Gate<User>,
+	name: N,
+}
+
+type Directory<T extends Entry> = DirectoryContainer<RfwfsDirectory<T>>
+
+interface DirectoryContainer<T> extends Entry {
+	files: Gate<Entry[]>,
+	parent: Gate<T> | null,
+}
+
+interface Root extends Entry<EntryType.Root, GroupPermissionsRoot, ROOT_ID.TRUNK> {
+	parent: null,
+	files: Gate<Entry[]>,
+}
+
+interface DirectoryInRoot extends Entry<EntryType.Root, Permissions {
+
+}
+
+interface DirectoryInRootProperties {
+	permissions: Permissions<PERMISSION_FLAGS, PERMISSION_FLAGS.NONE>,
+	timestamp: number,
+	metadata: Metadata,
+	name: string,
+}
+
+/** Other directory types that can be treated as a single arbitrary directory.
+
+Do not cast.
+*/
+type DirectoryAssociates<T extends Entry> = Directory<T> | DirectoryInRoot | Root
+/** Other entry types that can be treated as a single arbitrary entry.
+
+Do not cast.
+*/
+type EntryAssociates = Entry | Root
+
+type WrapResultEntry<T extends Entry, U> = WrapResult<T | undefined, U>
+type WrapResultNone<T>                   = WrapResult<Option.None, T>
+type WrapEntryRead<V>                    = WrapResult<V | undefined, ModifyStatus>
+
+function wrap_entry<T extends ConstEnum, U extends Entry>(status: T, result?: U): WrapResultEntry<U, T> {
+	return wrap(result, status)
+}
+
+function wrap_none<T extends ConstEnum>(status: T): WrapResultNone<T> {
+	return wrap(Option.None, status)
+}
+
+function wrap_entry_read<V>(status: ModifyStatus, result?: V): WrapEntryRead<V> {
+	return wrap(result, status)
+}
+
+function fs_dir_sort<T extends Entry>(dir: DirectoryAssociates<T>) {
+	dir.files.__inner().sort((a,z) => a.name.__inner().localeCompare(z.name.__inner()))
+}
+
+function fs_dir_clone<T extends Entry>(dir: DirectoryAssociates<T>, file_name: string): WrapResultEntry<T, ReadStatus> {
+	const clone_find = directory_search(dir.files.__inner(), file_name)
+	if (clone_find) {
+		return wrap_entry(ReadStatus.Ok, { ...clone_find.result as T })
+	}
+	return wrap_entry(ReadStatus.NotFound)
+}
+
+function fs_dir_find<T extends Entry>(dir: DirectoryAssociates<T>, file_name: string): WrapResultEntry<T, ReadStatus> {
+	const file_search = directory_search(dir.files.__inner(), file_name)
+	if (file_search) {
+		return wrap_entry(ReadStatus.Ok, file_search.result as T)
+	}
+	return wrap_entry(ReadStatus.NotFound)
+}
+
+function fs_dir_push<T extends Entry>(dir: DirectoryAssociates<T>, entry: Entry) {
+	const no_duplicates = directory_search(dir.files.__inner(), entry.name.__inner())
+	if (!no_duplicates) {
+		dir.files.__inner().push(entry)
+		fs_dir_sort(dir)
+		return wrap_none(PushStatus.Ok)
+	}
+	return wrap_none(PushStatus.Duplicate)
+}
+
+function fs_dir_pop<T extends Entry>(dir: DirectoryAssociates<T>, file_name: string): WrapResultEntry<T, ReadStatus> {
+	const pop_find = directory_search(dir.files.__inner(), file_name)
+	if (pop_find) {
+		dir.files.__inner().splice(pop_find.status, 1)
+		return wrap_entry(ReadStatus.Ok, pop_find.result as T)
+	}
+	return wrap_entry(ReadStatus.NotFound)
+}
+
+function user_group_perms(entry: EntryAssociates): PERMISSION_FLAGS | undefined {
+	const user               = LibUser.current_sys_user
+	const current_user_group = user.group()
+
+	if (user.is_root() || current_user_group.type() === entry.group.__inner()) {
+		return entry.permissions[current_user_group.type_as_name()].__inner()
+	}
+	return undefined
+}
+
+function user_group_read_write<T extends Entry>(entry: DirectoryAssociates<T>): ModifyStatus {
+	if (LibUser.current_sys_user.is_root()) {
+		return ModifyStatus.Ok
+	}
+	const group_perms = user_group_perms(entry)
+	if (group_perms) {
+		return LibRfwfs.read_write_access(group_perms) ? ModifyStatus.Ok : ModifyStatus.Denied
+	}
+	return ModifyStatus.NotInGroup
+}
+
+class Gate<V> {
+	private inner: V;
+	protected entry: EntryAssociates;
+
+	constructor(entry: EntryAssociates, value: V) {
+		this.inner = value
+		this.entry = entry
+	}
+
+	private access_read_write(accessType: ModifyAccessType): ModifyStatus {
+		const group_perms = user_group_perms(this.entry)
+		if (group_perms) {
+			switch (accessType) {
+				case ModifyAccessType.Read:
+					return LibRfwfs.read_access(group_perms)  ? ModifyStatus.Ok : ModifyStatus.Denied
+				case ModifyAccessType.Write:
+					return LibRfwfs.write_access(group_perms) ? ModifyStatus.Ok : ModifyStatus.Denied
+			}
+		}
+		return ModifyStatus.NotInGroup
+	}
+
+	public __inner(): V {
+		return this.inner
+	}
+
+	public read(): WrapEntryRead<V> {
+		switch (this.access_read_write(ModifyAccessType.Read)) {
+			case ModifyStatus.Ok:
+				return wrap_entry_read(ModifyStatus.Ok, this.inner)
+			case ModifyStatus.NotInGroup:
+				return wrap_entry_read(ModifyStatus.NotInGroup)
+			case ModifyStatus.Denied:
+				return wrap_entry_read(ModifyStatus.Denied)
+		}
+	}
+
+	public write<T extends V>(new_value: T): ModifyStatus {
+		switch (this.access_read_write(ModifyAccessType.Read)) {
+			case ModifyStatus.Ok:
+				this.inner = new_value
+				return ModifyStatus.Ok
+			case ModifyStatus.NotInGroup:
+				return ModifyStatus.NotInGroup
+			case ModifyStatus.Denied:
+				return ModifyStatus.Denied
+		}
+	}
+}
+
+class RfwfsDirectory<T extends Entry> {
+	public dir: DirectoryAssociates<T>;
+
+	constructor(dir: DirectoryAssociates<T>) {
+		this.dir = dir
+	}
+
+	public sort() {
+		fs_dir_sort(this.dir)
+	}
+
+	public clone(file_name: string): WrapResultEntry<Entry, ReadStatus> {
+		if (user_group_read_write(this.dir)) {
+			return fs_dir_clone(this.dir, file_name)
+		}
+		return wrap_entry(ReadStatus.Denied)
+	}
+
+	public find(file_name: string): WrapResultEntry<Entry, ReadStatus> {
+		if (user_group_read_write(this.dir)) {
+			return fs_dir_find(this.dir, file_name)
+		}
+		return wrap_entry(ReadStatus.Denied)
+	}
+
+	public push<E extends Entry>(entry: E): WrapResultNone<PushStatus> {
+		if (user_group_read_write(this.dir)) {
+			return fs_dir_push(this.dir, entry)
+		}
+		return wrap_none(PushStatus.Denied)
+	}
+
+	public pop(file_name: string): WrapResultEntry<Entry, ReadStatus> {
+		if (user_group_read_write(this.dir)) {
+			fs_dir_pop(this.dir, file_name)
+		}
+		return wrap_entry(ReadStatus.Denied)
+	}
+
+	public push_bulk_unsafe(dirs: T[]) {
+		dirs.forEach(dir => this.dir.files.__inner().push(dir))
+		this.sort()
+	}
+
+	public push_unsafe(dir: T) {
+		this.dir.files.__inner().push(dir)
+		this.sort()
+	}
+}
+
+class LibRfwfs {
+	public static is_root<T extends Entry>(entry: T): boolean {
+		return entry.type === EntryType.Root
+	}
+	public static is_dir<T extends Entry>(entry: T): boolean {
+		return entry.type === EntryType.Directory
+	}
+	public static is_file<T extends Entry>(entry: T): boolean {
+		return entry.type === EntryType.File
+	}
+	public static is_binary<T extends Entry>(entry: T): boolean {
+		return entry.type === EntryType.Binary
+	}
+	public static is_symlink<T extends Entry>(entry: T): boolean {
+		return entry.type === EntryType.SymLink
+	}
+
+	public static read_access(permissions: PERMISSION_FLAGS): boolean {
+		return (permissions & PERMISSION_FLAGS.R) !== 0
+	}
+	public static write_access(permissions: PERMISSION_FLAGS): boolean {
+		return (permissions & PERMISSION_FLAGS.W) !== 0
+	}
+	public static execute_access(permissions: PERMISSION_FLAGS): boolean {
+		return (permissions & PERMISSION_FLAGS.X) !== 0
+	}
+	public static read_write_access(permissions: PERMISSION_FLAGS): boolean {
+		return LibRfwfs.read_access(permissions) && LibRfwfs.write_access(permissions)
+	}
+
+	public static directory_in_root(properties: DirectoryInRootProperties): RfwfsDirectory<DirectoryInRoot> {
+		const dir_o = { type: EntryType.Directory } as DirectoryInRoot
+		dir_o.permissions = {
+			wheel: new Gate(dir_o, properties.permissions.wheel),
+			users: new Gate(dir_o, properties.permissions.users),
+		}
+		dir_o.metadata    = new Gate(dir_o, properties.metadata)
+		dir_o.timestamp   = new Gate(dir_o, properties.timestamp)
+		dir_o.files       = new Gate(dir_o, [])
+		dir_o.name        = new Gate(dir_o, properties.name)
+		dir_o.parent      = null
+		return new RfwfsDirectory(dir_o)
+	}
+}
+
+class Rfwfs extends LibRfwfs {
+	public root: Root;
+
+	constructor() {
+		super()
+		this.root = { type: EntryType.Root } as Root
+		this.root.permissions = {
+			wheel: new Gate(this.root, PERMISSION_FLAGS.RWX),
+			users: new Gate(this.root, PERMISSION_FLAGS.NONE)
+		}
+		this.root.timestamp = new Gate(this.root, (Date.now()/1000) | 0)
+		this.root.parent = null
+		this.root.files = new Gate(this.root, [])
+		this.root.name = ROOT_ID.TRUNK
+	}
+
+	public sort() {
+		fs_dir_sort(this.root)
+	}
+
+	public clone(file_name: string): WrapResultEntry<Entry, ReadStatus> {
+		if (user_group_read_write(this.root)) {
+			return fs_dir_clone(this.root, file_name)
+		}
+		return wrap_entry(ReadStatus.Denied)
+	}
+
+	public find(file_name: string): WrapResultEntry<Entry, ReadStatus> {
+		if (user_group_read_write(this.root)) {
+			return fs_dir_find(this.root, file_name)
+		}
+		return wrap_entry(ReadStatus.Denied)
+	}
+
+	public push<T extends Entry>(entry: T): WrapResultNone<PushStatus> {
+		if (user_group_read_write(this.root)) {
+			return fs_dir_push(this.root, entry)
+		}
+		return wrap_none(PushStatus.Denied)
+	}
+
+	public pop(file_name: string): WrapResultEntry<Entry, ReadStatus> {
+		if (user_group_read_write(this.root)) {
+			fs_dir_pop(this.root, file_name)
+		}
+		return wrap_entry(ReadStatus.Denied)
+	}
+
+	public push_bulk_unsafe(dirs: DirectoryInRoot[]) {
+		dirs.forEach(dir => this.root.files.__inner().push(dir))
+		this.sort()
+	}
+
+	public push_unsafe(dir: DirectoryInRoot) {
+		this.root.files.__inner().push(dir)
+		this.sort()
+	}
+}
+
+export default Rfwfs
+export {
+	type DirectoryInRoot,
+	type RfwfsDirectory,
+	type Directory,
+	type Entry,
+	PERMISSION_FLAGS,
+	EntryType,
+	ROOT_ID,
+}

src/rt/rfwfs/users.ts

@@ -0,0 +1,182 @@
+import { ROOT_ID } from "./main";
+
+import Crypto, { type SHA256 } from "../crypto/generate";
+import groups, { groups_find_user, GroupSearch, SysGroups, Group } from "./groups";
+
+const enum UserSet {
+	Ok,
+	AlreadyLoggedIn,
+	UserDoesNotExist,
+}
+const enum PasswordCheckStatus {
+	Ok,
+	MinBound,
+	MaxBound,
+}
+const enum PasswordSetStatus {
+	Ok,
+	RootRequiresPassword,
+	MinBound,
+	MaxBound,
+	Incorrect,
+}
+const enum SetUnameStatus {
+	Ok,
+	CantChangeRootName,
+	NotFound,
+	WheelResult,
+	UsersResult,
+}
+
+const enum PASS_BOUNDS {
+	MIN = 4,
+	MAX = 1 << 12, //64 ^ 2
+}
+
+let uid_count: number = 0
+
+class LibUser {
+	public static current_sys_user: User;
+
+	public static get_sys_user(): User {
+		return groups.together().find(user => user.is_logged_in()) as User
+	}
+
+	public static set_sys_user(uname: string): UserSet {
+		const found_user    = groups_find_user(uname)
+		const result_user_i = found_user.result
+		if (!result_user_i)                  { return UserSet.UserDoesNotExist }
+		if (result_user_i[0].is_logged_in()) { return UserSet.AlreadyLoggedIn }
+
+		LibUser.current_sys_user = result_user_i[0]
+		return UserSet.Ok
+	}
+
+	public static in_password_bounds(password: string): PasswordCheckStatus {
+		//Math.min(Math.max(PASS_BOUNDS.MIN, password.length), PASS_BOUNDS.MAX) < PASS_BOUNDS.MAX
+		if (password.length > PASS_BOUNDS.MIN) {
+			if (password.length < PASS_BOUNDS.MAX) {
+				return PasswordCheckStatus.Ok
+			}
+			return PasswordCheckStatus.MaxBound
+		}
+		return PasswordCheckStatus.MinBound
+	}
+}
+
+class User {
+	private inner_password?: SHA256;
+	private inner_group: Group;
+	private inner_name: string;
+	private inner_uid: number;
+	private current: boolean;
+
+	constructor(name: string, group: Group, password?: SHA256) {
+		const root_creation = name === ROOT_ID.NAME
+		if (root_creation) {
+			this.inner_uid = 0
+			this.inner_group = group
+		} else {
+			uid_count += 1
+			this.inner_uid = uid_count
+			this.inner_group = group
+		}
+
+		this.inner_name = name
+		this.current = root_creation
+		this.inner_password = password
+	}
+
+	private set_as_current(): boolean {
+		LibUser.get_sys_user().current = false
+		LibUser.current_sys_user = this
+		this.current = true
+		return this.current
+	}
+
+	public is_logged_in(): boolean {
+		return this.current
+	}
+	public in_wheel(): boolean {
+		return this.inner_group.type() === SysGroups.Wheel
+	}
+	public password(): SHA256 | undefined {
+		return this.inner_password
+	}
+	public is_root(): boolean {
+		return this.inner_name === ROOT_ID.NAME && this.inner_uid === ROOT_ID.UID
+	}
+	public group(): Group {
+		return this.inner_group
+	}
+	public uname(): string {
+		return this.inner_name
+	}
+	public uid(): number {
+		return this.inner_uid
+	}
+
+	public async check_password(password?: string): Promise<boolean> {
+		if (!(password && this.inner_password) || (await new Crypto(password).sha256_hash()).secret === this.inner_password.secret) {
+			return true
+		}
+		return false
+	}
+
+	public async login(password?: string): Promise<boolean> {
+		if (!this.inner_password || (password && await this.check_password(password))) {
+			return this.set_as_current()
+		}
+		return false
+	}
+
+	public set_uname(new_uname: string): SetUnameStatus {
+		if (this.is_root()) { return SetUnameStatus.CantChangeRootName }
+
+		const search = groups_find_user(new_uname)
+		switch (search.status) {
+			case GroupSearch.NotFound:
+				this.inner_name = new_uname
+				break
+			case GroupSearch.UsersResult:
+				return SetUnameStatus.UsersResult
+			case GroupSearch.WheelResult:
+				return SetUnameStatus.WheelResult
+		}
+		return SetUnameStatus.Ok
+	}
+
+	public async set_password(current_password: string, new_password?: string): Promise<PasswordSetStatus> {
+		if (await this.check_password(current_password)) {
+			if (new_password) {
+				switch (LibUser.in_password_bounds(new_password)) {
+					case PasswordCheckStatus.Ok:
+						this.inner_password = await new Crypto(new_password).sha256_hash()
+						break
+					case PasswordCheckStatus.MinBound:
+						return PasswordSetStatus.MinBound
+					case PasswordCheckStatus.MaxBound:
+						return PasswordSetStatus.MaxBound
+				}
+			} else {
+				if (this.is_root()) { return PasswordSetStatus.RootRequiresPassword }
+				//This user has no password
+				this.inner_password = undefined
+			}
+			return PasswordSetStatus.Ok
+		}
+		return PasswordSetStatus.Incorrect
+	}
+}
+
+groups.wheel.add_user(
+	new User(ROOT_ID.NAME, groups.wheel, { secret: "90a956efae97cca5ec584977d96a236aa76b0a07def9fcafab87fd221a1d2cfe" })
+)
+groups.users.add_user(
+	new User("user", groups.users)
+)
+
+export default User
+export {
+	LibUser
+}

src/rt/rfwfs/wrap.ts

@@ -0,0 +1,24 @@
+const enum Option {
+	None,
+	Some,
+}
+
+type ConstEnum = number
+
+interface WrapResult<T, U> {
+	/** The resulting value if `U` is a success status */
+	readonly result: T,
+	/** Represents some arbitrary extra value, usually a status */
+	readonly status: U,
+}
+
+function wrap<T, U>(result: T, some: U): WrapResult<T, U> {
+	return { result: result, status: some }
+}
+
+export default wrap
+export {
+	type WrapResult,
+	type ConstEnum,
+	Option,
+}

src/rt/shell/color.ts

@@ -7,20 +7,23 @@ const enum Colors {
 	cyan  = "cyan",
 	bold  = "bold"
 }
-function newcolor(inner: string, color?: Colors) {
+function newcolor(inner: string, color?: Colors, bold?: boolean) {
 	const span = create("span", color)
 	span.innerText = inner
+	if (bold) {
+		span.className = color ? color+" bold" : "bold"
+	}
 	return span
 }
 
-const red   = (s: string) => newcolor(s, Colors.red )
+const red   = (s: string, bold?: boolean) => newcolor(s, Colors.red,   bold)
-const green = (s: string) => newcolor(s, Colors.green)
+const green = (s: string, bold?: boolean) => newcolor(s, Colors.green, bold)
-const blue  = (s: string) => newcolor(s, Colors.blue)
+const blue  = (s: string, bold?: boolean) => newcolor(s, Colors.blue,  bold)
-const cyan  = (s: string) => newcolor(s, Colors.cyan)
+const cyan  = (s: string, bold?: boolean) => newcolor(s, Colors.cyan,  bold)
 const bold  = (s: string)                 => newcolor(s, Colors.bold)
 
-export default function rgb(s: string, Ru8: number, Gu8: number, Bu8: number) {
+export default function rgb(s: string, Ru8: number, Gu8: number, Bu8: number, bold?: boolean) {
-	const rgb_span = newcolor(s)
+	const rgb_span = newcolor(s, undefined, bold)
 	rgb_span.style.color = `rgb(${Ru8},${Gu8},${Bu8})`
 	return rgb_span
 }

src/rt/shell/command/builtin/cd.ts

@@ -1,13 +1,16 @@
-import { set_working_dir, SetDirStatus } from "../../fs/fn"
+import { ReadStatus } from "../../../rfwfs/enum"
 import type { Args, Term } from "../list"
 
+import lib from "../../../rfwfs/library"
+import stdout from "../../../elements/stdout"
+
 export default function cd(term: Term, args: Args): boolean {
-	const new_dir_status = set_working_dir(args[1])
+	const new_dir_status = lib.traverse_to(args)
 
 	if (new_dir_status === SetDirStatus.NotADirectory) {
-		// return <p>{"cd: \""}{bold(args[1])}{"\" is not a directory"}</p>
+		term.appendChild(stdout(`cd: "${args[1]}" is not a directory`))
 	} else if (new_dir_status === SetDirStatus.NotFound) {
-		// return <p>{"cd: The directory \""}{bold(args[1])}{"\" does not exist"}</p>
+		term.appendChild(stdout(`cd: The directory "${args[1]}" does not exist`))
 	}
 	return true
 }

src/rt/shell/command/builtin/history.ts

@@ -7,7 +7,7 @@ import history from "../../history";
 const history_command = new SubCommand("Show and manipulate command history")
 
 history_command.add("show", "Show the history", function(term: Term, _args: Args) {
-	history.file.inner.forEach((entry, ind) => term.appendChild(stdout(`${ind} ${entry}`)))
+	history.file.inner.forEach((entry, ind) => term.appendChild(stdout(`${ind+1} ${entry}`)))
 })
 
 history_command.add("clear", "Delete the entire command history", function(term: Term, _args: Args) {

src/rt/shell/command/builtin/ls.ts

@@ -1,11 +1,30 @@
 import type { Args, Term } from "../list";
+import { blue } from "../../color";
+import { get_working_dir_entries } from "../../../rfwfs/library";
+import { EntryType, FsEntry } from "../../../rfwfs/core";
+
+import stdout, { stdout_horizontal_elements } from "../../../elements/stdout";
+import create from "../../../elements/create";
+
+const element_collection = <T extends HTMLElement>(): T[] => []
+
+function show_directory(entry: FsEntry) {
+	const p = create("p")
+	p.append(blue(entry.name, true), "/")
+	return p
+}
 
 export default function ls(term: Term, args: Args): boolean {
-	// if (args[1] === undefined) {
+	const ls_elements = element_collection()
-	// 	for (const dir_name in working_dir) {
+	if (args[1] === undefined) {
-
+		get_working_dir_entries().forEach(entry => {
-	// 	}
+			if (entry.type === EntryType.Directory) {
-	// 	return <p>{`${working_dir}`}</p>
+				ls_elements.push(show_directory(entry))
-	// }
+			} else if (entry.type === EntryType.File) {
+				ls_elements.push(stdout(entry.name))
+			}
+		})
+	}
+	term.appendChild(stdout_horizontal_elements(ls_elements))
 	return true
 }

src/rt/shell/command/builtin/pwd.ts

@@ -1,4 +1,4 @@
-import { get_working_dir_name_full } from "../../fs/fn";
+import { get_working_dir_name_full } from "../../../rfwfs/library";
 import type { Args, Term } from "../list";
 
 import stdout from "../../../elements/stdout";

src/rt/shell/command/subcommand.ts

@@ -11,20 +11,21 @@ interface SubCommands {
 	[index: string]: SubCommandAction,
 }
 
+function subcommand_help(data: SubCommands, cmd_description: string, term: Term) {
+	const subcmd_descriptions: string[] = []
+	Object.values(data).forEach(sub_cmd => subcmd_descriptions.push(sub_cmd.description))
+
+	term.appendChild(stdout_grid(Object.keys(data), subcmd_descriptions, stdout(cmd_description)))
+}
+
 const SubCommand = class {
 	public data: SubCommands //data? less goo!
 
-	constructor(description: string) {
+	constructor(cmd_description: string) {
 		this.data = {}
 		this.data.help = {} as SubCommandAction
 		this.data.help.description = "Display help info"
-		this.data.help.inner = (term: Term, _args: Args) => {
+		this.data.help.inner = (term: Term, _args: Args) => subcommand_help(this.data, cmd_description, term)
-			const descriptions: string[] = []
-			Object.values(this.data).forEach(sub_cmd => descriptions.push(sub_cmd.description))
-
-			term.appendChild(stdout(description))
-			term.appendChild(stdout_grid(Object.keys(this.data), descriptions))
-		}
 	}
 
 	public process(term: Term, args: Args) {

src/rt/shell/fs/fn.ts

@@ -1,75 +0,0 @@
-import { Entry, EntryType, fs, type FsEntrySignature } from "./fs"
-
-let working_dir = ["/", "home", "user"]
-
-function get_working_dir_name() {
-	return working_dir[working_dir.length-1]
-}
-
-function get_working_dir_name_full(): string {
-	const w_dir_clone = [...working_dir]
-	const root = w_dir_clone.shift()
-	if (root) {
-		return root+w_dir_clone.join("/")
-	}
-	return "shift-error"
-}
-
-const enum SetDirStatus {
-	Valid,
-	NotFound,
-	NotADirectory
-}
-interface FsIterEntry {
-	readonly entry: FsEntrySignature | null,
-	readonly status: SetDirStatus
-}
-function iter_fs_to_goal(w_dir_clone: string[]): FsIterEntry {
-	let next_iter = fs[0]
-
-	for (const w_dir of w_dir_clone) {
-		if (w_dir === "/") { continue }
-		if (next_iter && next_iter.inner) {
-			const found = next_iter.inner.find(entry => entry.name === w_dir)
-
-			if (!found) {
-				return { entry: null, status: SetDirStatus.NotFound }
-			}
-			if (found.type !== EntryType.Directory) {
-				return { entry: null, status: SetDirStatus.NotADirectory }
-			}
-			if (found.name === w_dir_clone[w_dir_clone.length-1]) {
-				return { entry: next_iter, status: SetDirStatus.Valid }
-			} else {
-				next_iter = found.inner as FsEntrySignature
-			}
-		}
-	}
-	return { entry: null, status: SetDirStatus.NotFound }
-}
-
-function set_working_dir(name: string): SetDirStatus {
-	if (name === ".") { return SetDirStatus.Valid }
-
-	const w_dir_clone = [...working_dir]
-	if (name === "..") { w_dir_clone.pop() } else { w_dir_clone.push(name) }
-
-	const iter_status = iter_fs_to_goal(w_dir_clone)
-	if (iter_status.status === SetDirStatus.Valid) {
-		working_dir = w_dir_clone
-	}
-	return iter_status.status
-}
-
-function working_dir_entries() {
-	const w_dir_clone = [...working_dir]
-	const iter_status = iter_fs_to_goal(w_dir_clone)
-
-}
-
-export {
-	get_working_dir_name,
-	get_working_dir_name_full,
-	set_working_dir,
-	SetDirStatus
-}

src/rt/shell/fs/fs.ts

@@ -1,51 +0,0 @@
-const enum EntryType {
-	Directory,
-	File
-}
-const enum Permissions {
-	r,
-	w,
-	rw
-}
-
-type FsEntrySignature = Entry<Entry<{}>[]> //I did this!
-
-const user = [
-	Entry("about_me.txt", "about me inside", Permissions.rw),
-	Entry("services.txt", "services inside", Permissions.rw),
-	Entry("hi", [], Permissions.rw)
-]
-const home = [
-	Entry("user", user, Permissions.rw)
-]
-const root = [
-	Entry("home", home, Permissions.r),
-	Entry("bin", {}, Permissions.r),
-]
-const fs = [
-	Entry("/", root, Permissions.r)
-]
-
-type File = string
-interface Entry<T = File> {
-	readonly inner?: T,
-	readonly name: string,
-	readonly type: EntryType,
-	readonly permissions: Permissions
-}
-function Entry<T = File>(name: string, inner: T, permissions: Permissions): Entry<T> {
-	return {
-		type: typeof inner == "object" ? EntryType.Directory : EntryType.File,
-		inner: inner,
-		name: name,
-		permissions: permissions
-	}
-}
-
-export {
-	fs,
-	type FsEntrySignature,
-	EntryType,
-	Permissions,
-	Entry
-}

src/scss/elements/footer.scss

@@ -19,7 +19,7 @@
 			height: 100%;
 			padding: 0 20px 0 20px;
 
-			&:hover { background-color: var(--hf-button-hover-color) }
+			&:hover { background-color: rgb(255,255,255) }
 		}
 	}
 

src/scss/elements/header.scss

@@ -1,5 +1,15 @@
 @use "../variables.scss";
 
+@mixin navigation-button {
+	button {
+		padding: 0 20px 0 20px;
+		&:hover {
+			background-color: white;
+			& > a { color: black; }
+		}
+	}
+}
+
 @mixin navigation {
 	.header-left {
 		height: 100%;
@@ -7,16 +17,10 @@
 		background-color: rgb(0,0,0);
 	}
 	.header-right {
+		@include navigation-button;
+
 		display: flex;
 		height: 100%;
-
-		button {
-			padding: 0 20px 0 20px;
-			&:hover {
-				background-color: white;
-				& > a { color: black; }
-			}
-		}
 	}
 }
 

src/scss/elements/terminal.scss

@@ -1,11 +1,10 @@
-@mixin color-matrix {
+@use "../variables.scss";
-	.red   { color: rgb(200, 0, 0); }
-	.green { color: rgb(0, 200, 0); }
-	.blue  { color: rgb(0, 0, 200); }
-	.cyan  { color: rgb(18,167,148); }
-}
 
 @mixin text-styles {
+	.red   { color: rgb(var(--color-red)) }
+	.green { color: rgb(var(--color-green)) }
+	.blue  { color: rgb(var(--color-blue)) }
+	.cyan  { color: rgb(var(--color-cyan)) }
 	.bold  { font-weight: bold; }
 }
 
@@ -15,28 +14,31 @@
 		display: flex;
 		gap: 30px;
 	}
+	.stdout-horizontal-wrap {
+		display: flex;
+		gap: 5px;
+	}
 }
 
 @mixin term-elements {
 	.return { margin-top: 25px; }
 	.shell-prompt { display: flex; }
+	.wrap-indicator {
+		width: 2px;
+		background-color: rgba(var(--color-blue), .3);
+	}
 }
 
 @mixin formatting {
 	@include stdout-layouts;
 	@include term-elements;
-
-	p {
-		@include color-matrix;
 	@include text-styles;
 
-		font-size: 1.2rem;
+	p, a, span {
+		font-size: variables.$default-font-size
+	}
+	p {
 		margin: 5px;
-
+		a:hover { text-decoration: underline; }
-		span { font-size: inherit; }
-		a {
-			font-size: inherit;
-			&:hover { text-decoration: underline; }
-		}
 	}
 }

src/scss/global.scss

@@ -6,24 +6,20 @@
 @use "./elements/footer.scss";
 
 :root {
+	@include variables.css-global;
 	color-scheme: dark;
-
-	--body-background-color: rgb(0,0,0);
-	--hf-button-hover-color: rgb(255,255,255);
 }
 ::selection {
 	background-color: rgb(255,255,255);
 	color: rgb(0,0,0);
 }
-::spelling-error {
+::spelling-error { text-decoration: none; }
-	text-decoration: none
-}
 
 body {
 	box-sizing: border-box;
 	margin: 0;
 	overflow: hidden;
-	background-color: var(--body-background-color);
+	background-color: rgb(0,0,0);
 }
 button {
 	background-color: transparent;

src/scss/variables.scss

@@ -1,3 +1,16 @@
+$default-font-size: 1.2rem;
+
 $header-Y: 30px;
 $footer-Y: 30px;
 $component-padding: 20px;
+
+@mixin color-matrix {
+	--color-red:   200, 0, 0;
+	--color-green: 0, 200, 0;
+	--color-blue:  0, 0, 200;
+	--color-cyan:  18,167,148;
+}
+
+@mixin css-global {
+	@include color-matrix;
+}

tsconfig.json

@@ -15,7 +15,8 @@
 
     /* Linting */
     "strict": true,
-    // "noUnusedLocals": true,
+    "noUnusedLocals": true,
+    "noUnusedParameters": true,
     "noFallthroughCasesInSwitch": true,
     "noUncheckedSideEffectImports": true,
     "noImplicitAny": true,

vite.config.js

@@ -1,10 +1,6 @@
 import { defineConfig } from 'vite'
-import { createHtmlPlugin } from 'vite-plugin-html'
 
 export default defineConfig({
-	plugins: [
-		createHtmlPlugin({minify: true}),
-	],
 	root: "src",
 	build: {
 		outDir: "../dist"