commit 1ca8ce39ae92bc2184b6c3da20f6dcfa6a040156 Author: nachoparker Date: Sun Mar 25 17:59:48 2018 +0200 Initial commit diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..b9f7ff1 --- /dev/null +++ b/.gitignore @@ -0,0 +1,3 @@ +/target/ +**/*.rs.bk +.*.swp diff --git a/Cargo.lock b/Cargo.lock new file mode 100644 index 0000000..db5205f --- /dev/null +++ b/Cargo.lock @@ -0,0 +1,145 @@ +[[package]] +name = "aho-corasick" +version = "0.6.4" +source = "registry+https://github.com/rust-lang/crates.io-index" +dependencies = [ + "memchr 2.0.1 (registry+https://github.com/rust-lang/crates.io-index)", +] + +[[package]] +name = "dutree" +version = "0.1.0" +dependencies = [ + "getopts 0.2.15 (registry+https://github.com/rust-lang/crates.io-index)", + "regex 0.2.10 (registry+https://github.com/rust-lang/crates.io-index)", + "terminal_size 0.1.7 (git+https://github.com/eminence/terminal-size.git)", + "unicode-width 0.1.4 (registry+https://github.com/rust-lang/crates.io-index)", +] + +[[package]] +name = "getopts" +version = "0.2.15" +source = "registry+https://github.com/rust-lang/crates.io-index" + +[[package]] +name = "kernel32-sys" +version = "0.2.2" +source = "registry+https://github.com/rust-lang/crates.io-index" +dependencies = [ + "winapi 0.2.8 (registry+https://github.com/rust-lang/crates.io-index)", + "winapi-build 0.1.1 (registry+https://github.com/rust-lang/crates.io-index)", +] + +[[package]] +name = "lazy_static" +version = "1.0.0" +source = "registry+https://github.com/rust-lang/crates.io-index" + +[[package]] +name = "libc" +version = "0.2.39" +source = "registry+https://github.com/rust-lang/crates.io-index" + +[[package]] +name = "memchr" +version = "2.0.1" +source = "registry+https://github.com/rust-lang/crates.io-index" +dependencies = [ + "libc 0.2.39 (registry+https://github.com/rust-lang/crates.io-index)", +] + +[[package]] +name = "regex" +version = "0.2.10" +source = "registry+https://github.com/rust-lang/crates.io-index" +dependencies = [ + "aho-corasick 0.6.4 (registry+https://github.com/rust-lang/crates.io-index)", + "memchr 2.0.1 (registry+https://github.com/rust-lang/crates.io-index)", + "regex-syntax 0.5.3 (registry+https://github.com/rust-lang/crates.io-index)", + "thread_local 0.3.5 (registry+https://github.com/rust-lang/crates.io-index)", + "utf8-ranges 1.0.0 (registry+https://github.com/rust-lang/crates.io-index)", +] + +[[package]] +name = "regex-syntax" +version = "0.5.3" +source = "registry+https://github.com/rust-lang/crates.io-index" +dependencies = [ + "ucd-util 0.1.1 (registry+https://github.com/rust-lang/crates.io-index)", +] + +[[package]] +name = "terminal_size" +version = "0.1.7" +source = "git+https://github.com/eminence/terminal-size.git#af31d2b028a2e0bad3443a84d543b5b7194409e7" +dependencies = [ + "kernel32-sys 0.2.2 (registry+https://github.com/rust-lang/crates.io-index)", + "libc 0.2.39 (registry+https://github.com/rust-lang/crates.io-index)", + "winapi 0.2.8 (registry+https://github.com/rust-lang/crates.io-index)", +] + +[[package]] +name = "thread_local" +version = "0.3.5" +source = "registry+https://github.com/rust-lang/crates.io-index" +dependencies = [ + "lazy_static 1.0.0 (registry+https://github.com/rust-lang/crates.io-index)", + "unreachable 1.0.0 (registry+https://github.com/rust-lang/crates.io-index)", +] + +[[package]] +name = "ucd-util" +version = "0.1.1" +source = "registry+https://github.com/rust-lang/crates.io-index" + +[[package]] +name = "unicode-width" +version = "0.1.4" +source = "registry+https://github.com/rust-lang/crates.io-index" + +[[package]] +name = "unreachable" +version = "1.0.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +dependencies = [ + "void 1.0.2 (registry+https://github.com/rust-lang/crates.io-index)", +] + +[[package]] +name = "utf8-ranges" +version = "1.0.0" +source = "registry+https://github.com/rust-lang/crates.io-index" + +[[package]] +name = "void" +version = "1.0.2" +source = "registry+https://github.com/rust-lang/crates.io-index" + +[[package]] +name = "winapi" +version = "0.2.8" +source = "registry+https://github.com/rust-lang/crates.io-index" + +[[package]] +name = "winapi-build" +version = "0.1.1" +source = "registry+https://github.com/rust-lang/crates.io-index" + +[metadata] +"checksum aho-corasick 0.6.4 (registry+https://github.com/rust-lang/crates.io-index)" = "d6531d44de723825aa81398a6415283229725a00fa30713812ab9323faa82fc4" +"checksum getopts 0.2.15 (registry+https://github.com/rust-lang/crates.io-index)" = "65922871abd2f101a2eb0eaebadc66668e54a87ad9c3dd82520b5f86ede5eff9" +"checksum kernel32-sys 0.2.2 (registry+https://github.com/rust-lang/crates.io-index)" = "7507624b29483431c0ba2d82aece8ca6cdba9382bff4ddd0f7490560c056098d" +"checksum lazy_static 1.0.0 (registry+https://github.com/rust-lang/crates.io-index)" = "c8f31047daa365f19be14b47c29df4f7c3b581832407daabe6ae77397619237d" +"checksum libc 0.2.39 (registry+https://github.com/rust-lang/crates.io-index)" = "f54263ad99207254cf58b5f701ecb432c717445ea2ee8af387334bdd1a03fdff" +"checksum memchr 2.0.1 (registry+https://github.com/rust-lang/crates.io-index)" = "796fba70e76612589ed2ce7f45282f5af869e0fdd7cc6199fa1aa1f1d591ba9d" +"checksum regex 0.2.10 (registry+https://github.com/rust-lang/crates.io-index)" = "aec3f58d903a7d2a9dc2bf0e41a746f4530e0cab6b615494e058f67a3ef947fb" +"checksum regex-syntax 0.5.3 (registry+https://github.com/rust-lang/crates.io-index)" = "b2550876c31dc914696a6c2e01cbce8afba79a93c8ae979d2fe051c0230b3756" +"checksum terminal_size 0.1.7 (git+https://github.com/eminence/terminal-size.git)" = "" +"checksum thread_local 0.3.5 (registry+https://github.com/rust-lang/crates.io-index)" = "279ef31c19ededf577bfd12dfae728040a21f635b06a24cd670ff510edd38963" +"checksum ucd-util 0.1.1 (registry+https://github.com/rust-lang/crates.io-index)" = "fd2be2d6639d0f8fe6cdda291ad456e23629558d466e2789d2c3e9892bda285d" +"checksum unicode-width 0.1.4 (registry+https://github.com/rust-lang/crates.io-index)" = "bf3a113775714a22dcb774d8ea3655c53a32debae63a063acc00a91cc586245f" +"checksum unreachable 1.0.0 (registry+https://github.com/rust-lang/crates.io-index)" = "382810877fe448991dfc7f0dd6e3ae5d58088fd0ea5e35189655f84e6814fa56" +"checksum utf8-ranges 1.0.0 (registry+https://github.com/rust-lang/crates.io-index)" = "662fab6525a98beff2921d7f61a39e7d59e0b425ebc7d0d9e66d316e55124122" +"checksum void 1.0.2 (registry+https://github.com/rust-lang/crates.io-index)" = "6a02e4885ed3bc0f2de90ea6dd45ebcbb66dacffe03547fadbb0eeae2770887d" +"checksum winapi 0.2.8 (registry+https://github.com/rust-lang/crates.io-index)" = "167dc9d6949a9b857f3451275e911c3f44255842c1f7a76f33c55103a909087a" +"checksum winapi-build 0.1.1 (registry+https://github.com/rust-lang/crates.io-index)" = "2d315eee3b34aca4797b2da6b13ed88266e6d612562a0c46390af8299fc699bc" diff --git a/Cargo.toml b/Cargo.toml new file mode 100644 index 0000000..f9bb63d --- /dev/null +++ b/Cargo.toml @@ -0,0 +1,10 @@ +[package] +name = "dutree" +version = "0.1.0" +authors = ["nacho "] + +[dependencies] +getopts = "0.2" +terminal_size= { git = "https://github.com/eminence/terminal-size.git" } +regex = "0.2" +unicode-width = "0.1.1" diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000..94a9ed0 --- /dev/null +++ b/LICENSE @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + 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. + + + Copyright (C) + + 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 . + +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: + + Copyright (C) + 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 +. + + 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 +. diff --git a/README.md b/README.md new file mode 100644 index 0000000..3951f2f --- /dev/null +++ b/README.md @@ -0,0 +1,42 @@ +# dutree +a tool to analyze file system usage written in Rust + +![Example](resources/dutree_featured.png) + +# Features + + - coloured output, according to the LS_COLORS environment variable. + - display the file system tree + - ability to aggregate small files + - ability to exclude files or directories + - ability to compare different directories + - fast, written in Rust + +# Usage + +``` + $ dutree --help +Usage: dutree [options] [..] + +Options: + -d, --depth [DEPTH] show directories up to depth N (def 1) + -a, --aggr [N[KMG]] aggregate smaller than N B/KiB/MiB/GiB (def 1M) + -s, --summary equivalent to -da, or -d1 -a1M + -u, --usage report real disk usage instead of file size + -b, --bytes print sizes in bytes + -x, --exclude NAME exclude matching files or directories + -H, --no-hidden exclude hidden files + -A, --ascii ASCII characters only, no colors + -h, --help show help + -v, --version print version number +``` + +# Installation + +``` +git clone https://github.com/nachoparker/dutree.git +cd dutree +cargo install +``` + +More details at [ownyourbits.com](https://ownyourbits.com/2018/03/25/analize-disk-usage-with-dutree) diff --git a/resources/dutree_featured.png b/resources/dutree_featured.png new file mode 100644 index 0000000..297a74c Binary files /dev/null and b/resources/dutree_featured.png differ diff --git a/src/lib.rs b/src/lib.rs new file mode 100644 index 0000000..7ad349b --- /dev/null +++ b/src/lib.rs @@ -0,0 +1,580 @@ +extern crate getopts; +extern crate terminal_size; +extern crate regex; +extern crate unicode_width; + +use getopts::Options; +use std::io; +use std::path::{Path, PathBuf}; +use std::fs; +use terminal_size::{Width, Height, terminal_size}; +use regex::Regex; +use std::os::linux::fs::MetadataExt; +use std::env; + +const VERSTR : &str = "v0.1.0"; +const DEF_WIDTH : u16 = 80; + +pub enum XResult { + XOk(T), + XErr(S), + XExit, +} +use XResult::{XOk, XExit, XErr}; + +struct Entry { + name : String, + bytes : u64, + color : Option, + last : bool, + entries : Option>, +} + +pub struct Config { + paths : Vec, + color_dict : Vec, + depth : u8, + depth_flag : bool, + bytes_flag : bool, + usage_flag : bool, + hiddn_flag : bool, + ascii_flag : bool, + aggr : u64, + exclude : Vec, +} + +struct DictEntry { key : String, val : String } + +fn init_opts() -> Options { + let mut options = Options::new(); + + options.optflagopt( "d", "depth" , "show directories up to depth N (def 1)", "DEPTH" ); + options.optflagopt( "a", "aggr" , "aggregate smaller than N B/KiB/MiB/GiB (def 1M)", "N[KMG]"); + options.optflag( "s", "summary" , "equivalent to -da, or -d1 -a1M" ); + options.optflag( "u", "usage" , "report real disk usage instead of file size"); + options.optflag( "b", "bytes" , "print sizes in bytes" ); + options.optmulti( "x", "exclude" , "exclude matching files or directories", "NAME"); + options.optflag( "H", "no-hidden", "exclude hidden files" ); + options.optflag( "A", "ascii" , "ASCII characters only, no colors" ); + options.optflag( "h", "help" , "show help" ); + options.optflag( "v", "version" , "print version number" ); + options +} + +impl Config { + pub fn new() -> XResult { + + let args: Vec = env::args().collect(); + let program = args[0].clone(); + + let options = init_opts(); + let opt = match options.parse(&args[1..]) { + Ok(m) => m, + Err(err) =>{ print_usage(&program, &options); return XErr( err.to_string() )}, + }; + + if opt.opt_present("h") { + print_usage(&program, &options); + return XExit; + } + if opt.opt_present("v") { + println!("dutree version {}", VERSTR); + return XExit; + }; + + let color_dict = create_color_dict(); + + let mut paths : Vec = Vec::new(); + if opt.free.len() == 0 { + let mut path = std::path::PathBuf::new(); + path.push( ".".to_string() ); + paths.push( path ); + } else { + for opt in &opt.free { + let mut path = std::path::PathBuf::new(); + path.push( &opt ); + paths.push( path ); + } + } + + for p in &paths { + if !p.exists() { + return XErr( format!( "path {} doesn't exist", p.display() ) ); + } + } + + let mut depth_flag = opt.opt_present("d"); + let depth_opt = opt.opt_str("d"); + let mut depth = depth_opt.unwrap_or("1".to_string()).parse().unwrap_or(1); + + let bytes_flag = opt.opt_present("b"); + let usage_flag = opt.opt_present("u"); + let hiddn_flag = opt.opt_present("H"); + let ascii_flag = opt.opt_present("A"); + + let mut aggr = if opt.opt_present("a") { + let aggr_opt = opt.opt_str("a"); + let aggr_val = aggr_opt.unwrap_or("1M".to_string()); + + if !Regex::new(r"^\d+\D?$").unwrap().is_match( aggr_val.as_str() ){ + return XErr( format!( "invalid argument '{}'", aggr_val ) ); + } + + let unit = aggr_val.matches(char::is_alphabetic).next().unwrap_or("B"); + let num : Vec<&str> = aggr_val.matches(char::is_numeric).collect(); + let num : u64 = num.concat().parse().unwrap(); + + let factor = match unit { + "b" | "B" => 1024u64.pow(0), + "k" | "K" => 1024u64.pow(1), + "m" | "M" => 1024u64.pow(2), + "g" | "G" => 1024u64.pow(3), + "t" | "T" => 1024u64.pow(4), + _ => 1024u64.pow(0), + }; + num * factor + } else { + 0 + }; + + let exclude = opt.opt_strs("x"); + + if opt.opt_present("s") { + depth_flag = true; + depth = 1; + aggr = 1024u64.pow(2); + } + + XOk( Config{ paths, color_dict, depth, depth_flag, bytes_flag, + usage_flag, hiddn_flag, ascii_flag, aggr, exclude } ) + } +} + +fn try_is_symlink( path : &Path ) -> bool { + let metadata = path.symlink_metadata(); + metadata.is_ok() && metadata.unwrap().file_type().is_symlink() +} + +fn file_name_from_path( path : &Path ) -> String { + let mut abspath = std::env::current_dir().unwrap(); + abspath.push( path ); + + // don't resolve links + if !try_is_symlink( path ) { + abspath = abspath.canonicalize().unwrap_or( abspath ); + } + + abspath.file_name().unwrap_or( std::ffi::OsStr::new( "/" ) ) // '/' has no filename + .to_str().unwrap_or( "[invalid name]" ).to_string() +} + +fn try_read_dir( path : &Path ) -> Option { + if try_is_symlink( path ) { return None } // don't follow symlinks + match path.read_dir() { + Ok(dir_list) => Some(dir_list), + Err(err) => { + print_io_error( path, err ); + None + }, + } +} + +fn try_bytes_from_path( path : &Path, usage_flag : bool ) -> u64 { + + match path.symlink_metadata() { + Ok(metadata) => if usage_flag { metadata.st_blocks()*512 } else { metadata.st_size() }, + Err(err) => { + print_io_error( path, err ); + 0 + }, + } +} + +fn path_from_dentry( entry : Result ) -> Option { + match entry { + Ok(entry) => { + Some( entry.path() ) + }, + Err(err) => { + eprintln!( "Couldn't read entry ({:?})", err.kind() ); + None + }, + } +} + +fn print_io_error( path: &Path, err: io::Error ) { + eprintln!( "Couldn't read {} ({:?})", file_name_from_path( path ), err.kind() ) +} + +impl Entry { + fn new( path: &Path, cfg : &Config, depth : u8 ) -> Entry { + let name = file_name_from_path( path ); + + // recursively create directory tree of entries up to depth + let depth = if cfg.depth_flag { depth - 1 } else { 1 }; + + let entries = if path.is_dir() && ( !cfg.depth_flag || depth > 0 ) { + let mut aggr_bytes = 0; + if let Some( dir_list ) = try_read_dir( path ) { + let mut vec : Vec = Vec::new(); + for entry in dir_list { + if let Some( path ) = path_from_dentry( entry ) { + let entry_name = &file_name_from_path(&path); + if cfg.exclude.iter().any( |p| entry_name == p ){ continue } + if cfg.hiddn_flag && &entry_name[..1] == "." { continue } + let entry = Entry::new( &path.as_path(), cfg, depth ); + if cfg.aggr > 0 && entry.bytes < cfg.aggr { + aggr_bytes += entry.bytes; + } else { + vec.push( entry ); + } + } + } + vec.sort_unstable_by( |a, b| b.bytes.cmp( &a.bytes ) ); + if aggr_bytes > 0 { + vec.push( Entry { + name: "".to_string(), + bytes: aggr_bytes, + color: None, + last : true, + entries: None, + } ); + } + + let len = vec.len(); + if len > 0 { + vec[len-1].last = true; + } + + Some( vec ) + } else { None } + } else { None }; + + // calculate sizes + let bytes = if let Some(ref entries) = entries { + let mut total = try_bytes_from_path( path, cfg.usage_flag ); + for entry in entries { + total += entry.bytes; + } + total + } else { + get_bytes( path, cfg.usage_flag ) + }; + + // calculate color + let color = if !cfg.ascii_flag {color_from_path(path, &cfg.color_dict)} else {None}; + + Entry { name, bytes, color, last: false, entries } + } + + fn print_entries( &self, open_parents : Vec, parent_vals : Vec, + bytes_flag : bool, ascii_flag : bool, bar_width : usize, tree_name_width : usize ) { + if let Some(ref entries) = self.entries { + for entry in entries { + let mut op = open_parents.clone(); + let mut bytes = parent_vals.clone(); + bytes.push( entry.bytes ); + + // make sure the name column has the right length + let tree_width = (open_parents.len() + 1) * 3; // 3 chars per tree branch + if tree_name_width >= tree_width { + let name_width = tree_name_width - tree_width; + let length = unicode_width::UnicodeWidthStr::width(entry.name.as_str()); + + let mut name = entry.name.clone(); + name.truncate( name_width ); + + // surround name by ANSII color escape sequences + if let Some( ref col_str ) = entry.color { + name.insert( 0, 'm' ); + name.insert( 0, 0o33 as char ); + name.insert( 1, '[' ); + name.insert_str( 2, col_str ); + name.push( 0o33 as char ); + name.push_str( "[0m" ); + } + + if length < name_width { + (length..name_width).for_each( |_| name.push( ' ' ) ); + } + + // draw the tree + for open in &open_parents { + if *open { print!( " " ); } + else { print!( "│ " ); } + } + if entry.last { print!( "└─ " ); op.push( true ); } + else { print!( "├─ " ); op.push( false ); } + + // print it + println!( "{} {} {:>13}", + name, + fmt_bar( &bytes, bar_width, ascii_flag ), + fmt_size_str( entry.bytes, bytes_flag ) ); + if let Some(_) = entry.entries { + entry.print_entries( op, bytes, bytes_flag, ascii_flag, + bar_width, tree_name_width ); + } + } + } + } + } + + fn print( &self, bytes_flag : bool, ascii_flag : bool ) { + + // calculate plot widths + let mut twidth = DEF_WIDTH; + let size = terminal_size(); + if let Some( ( Width(w), Height(_h) ) ) = size { + twidth = w; + } else { + eprintln!("Unable to get terminal size"); + } + let size_width = 15; + let var_width = twidth - size_width; + let bar_width = var_width as usize * 75 / 100; + let tree_name_width = var_width as usize * 25 / 100; + + // initalize + let open_parents : Vec = Vec::new(); + let mut parent_vals : Vec = Vec::new(); + parent_vals.push( self.bytes ); + + // print + println!( "[ {} {} ]", self.name, fmt_size_str( self.bytes, bytes_flag ) ); + self.print_entries( open_parents, parent_vals, bytes_flag, ascii_flag, + bar_width, tree_name_width ); + } +} + +fn fmt_bar( bytes : &Vec, width : usize, ascii_flag : bool ) -> String { + let width = width as u64 - 2 - 5; // not including bars and percentage + + let mut str = String::with_capacity( width as usize ); + str.push( '│' ); + + let mut bytesi = bytes.iter(); + let mut total = bytesi.next().unwrap(); + let mut part = bytesi.next().unwrap(); + let mut bars = ( part * width ) / total; + let mut pos = width - bars; + + let block_char = if ascii_flag { vec![ ' ', '#' ] } else { vec![ ' ', '░', '▒', '▓', '█' ] }; + let mut chr = 0; + let levels = bytes.len() - 1; + + for x in 0..width { + if x > pos { + total = part; + part = bytesi.next().unwrap_or(&0); + bars = ( part * bars ) / total; + + pos = width - bars; + chr += 1; + if chr == levels || chr >= block_char.len() { + chr = block_char.len() - 1; // last level, solid '█' + } + } + str.push( block_char[chr] ); + } + + format!( "{}│ {:3}%", str, ( bytes[bytes.len()-1] * 100 ) / bytes[bytes.len()-2] ) +} + +fn fmt_size_str( bytes : u64, flag : bool ) -> String { + let b = bytes as f32; + if bytes < 1024 || flag { format!( "{:.2} B" , bytes ) } + else if bytes < 1024u64.pow(2) { format!( "{:.2} KiB", b/1024.0 ) } + else if bytes < 1024u64.pow(3) { format!( "{:.2} MiB", b/(1024u32.pow(2) as f32)) } + else if bytes < 1024u64.pow(4) { format!( "{:.2} GiB", b/(1024u32.pow(3) as f32)) } + else { format!( "{:.2} TiB", b/(1024u32.pow(4) as f32)) } +} + +fn get_bytes( path: &Path, usage_flag : bool ) -> u64 { + if path.is_dir() { + let mut bytes : u64 = try_bytes_from_path( path, usage_flag ); + if let Some(dir_list) = try_read_dir( path ) { + for entry in dir_list { + if let Some(path) = path_from_dentry( entry ) { + bytes += get_bytes( &path, usage_flag ); + } + } + } + bytes + } else { + try_bytes_from_path( path, usage_flag ) + } +} + +fn color_from_path( path : &Path, color_dict : &Vec ) -> Option { + if try_is_symlink( path ) { + if path.read_link().unwrap().exists() { + if let Some( col ) = dict_get( color_dict, "ln" ) { + return Some( col.to_string() ); + } + } else { + if let Some( col ) = dict_get( color_dict, "or" ) { + return Some( col.to_string() ); + } + } + } + let metadata = path.symlink_metadata(); + if metadata.is_ok() { + let mode = metadata.unwrap().st_mode(); + if path.is_dir() { + if mode & 0o002 != 0 { // dir other writable + if let Some( col ) = dict_get( color_dict, "ow" ) { + return Some( col.to_string() ); + } + } + if let Some( col ) = dict_get( color_dict, "di" ) { + return Some( col.to_string() ); + } + } + if mode & 0o111 != 0 { // executable + if let Some( col ) = dict_get( color_dict, "ex" ) { + return Some( col.to_string() ); + } + } + } + if let Some( ext_str ) = path.extension() { + for col in color_dict { + if &col.key[..2] != "*." { continue } + let key = col.key.trim_left_matches( "*." ); + if ext_str == key { + return Some( dict_get( color_dict, col.key.as_str() ).unwrap().to_string() ); + } + } + } + if path.is_file() { + if let Some( col ) = dict_get( color_dict, "fi" ) { + return Some( col.to_string() ); + } + else { return None } + } + // we are assuming it can only be a 'bd','cd'. can also be 'pi','so' or 'no' + if let Some( col ) = dict_get( color_dict, "bd" ) { + return Some( col.to_string() ); + } + None +} + +fn print_usage( program: &str, opts: &Options ) { + let brief = format!( "Usage: {} [options] [..]", program ); + print!( "{}", opts.usage( &brief ) ); +} + +fn dict_get( dict : &Vec, key : &str ) -> Option { + for entry in dict { + if &entry.key == key { + return Some( entry.val.clone() ); + } + } + None +} + +fn create_color_dict() -> Vec { + let mut color_dict = Vec::new(); + let env_str = env::var("LS_COLORS").unwrap_or( "".to_string() ); + for entry in env_str.split(':') { + if entry.len() == 0 { break; } + + let line = entry.replace("\"",""); + let mut line = line.split('='); + let key = line.next().unwrap(); + let val = line.next().unwrap(); + + color_dict.push( DictEntry{ key: key.to_string(), val: val.to_string() } ); + } + color_dict +} + +pub fn run( cfg: &Config ) { + let entry = if cfg.paths.len() == 1 { + Entry::new( cfg.paths[0].as_path(), &cfg, cfg.depth + 1 ) + } else { + let mut bytes = 0; + let mut entries : Vec = Vec::new(); + + for path in &cfg.paths { + let e = Entry::new( path.as_path(), &cfg, cfg.depth + 1 ); + bytes += e.bytes; + entries.push( e ); + } + let len = entries.len(); + if len > 0 { + entries[len-1].last = true; + } + Entry { + name : "".to_string(), + bytes, + color : None, + last : false, + entries : Some(entries) + } + }; + + entry.print( cfg.bytes_flag, cfg.ascii_flag ); +} + +#[cfg(test)] +mod tests { + use super::*; + + #[test] + fn parse_ls_colors() { + let mut dict = Vec::new(); + dict.push( DictEntry{ key: "di".to_string() , val: "dircode".to_string() } ); + dict.push( DictEntry{ key: "li".to_string() , val: "linkcod".to_string() } ); + dict.push( DictEntry{ key: "*.mp3".to_string(), val: "mp3code".to_string() } ); + dict.push( DictEntry{ key: "*.tar".to_string(), val: "tarcode".to_string() } ); + assert_eq!( "dircode", color_from_path( Path::new(".") , &dict ) ); + assert_eq!( "mp3code", color_from_path( Path::new("test.mp3"), &dict ) ); + assert_eq!( "tarcode", color_from_path( Path::new("test.tar"), &dict ) ); + } + + /* + #[test] + fn plot_bar() { + println!("{}", fmt_bar(100, 100, 40 ) ); + println!("{}", fmt_bar( 90, 100, 40 ) ); + println!("{}", fmt_bar( 40, 100, 40 ) ); + println!("{}", fmt_bar( 30, 100, 40 ) ); + println!("{}", fmt_bar( 20, 100, 40 ) ); + println!("{}", fmt_bar( 10, 100, 40 ) ); + println!("{}", fmt_bar( 0, 100, 40 ) ); + } + + #[test] + fn path_flavours() { + // different paths, like . .. ../x /home/ dir / /usr/etc/../bin + } + + #[test] + fn entry_object() { + let dir = fs::read_dir(".").unwrap().nth(0).unwrap().unwrap(); + let entry = Entry::new(None, &dir, true, 0, false); + println!( "entry created {} {}B", entry.name, entry.bytes ); + assert_eq!( ".git", entry.name ); + } + + #[test] + fn vector_of_entries() { + let mut vec : Vec = Vec::new(); + let entry = Entry { name: String::from("file1"), bytes: 1, dir: None }; + vec.push( entry ); + let entry = Entry { name: String::from("file2"), bytes: 2, dir: None }; + vec.push( entry ); + vec.sort_unstable_by(|a, b| b.bytes.cmp(&a.bytes)); + assert!( vec[0].bytes == 2 ); + } + + #[test] + fn get_bytes_test() { + println!( "calculated bytes {}", + get_bytes( Path::new( "." ) ) ); + println!( "calculated bytes {}", + get_bytes( Path::new( "Cargo.toml" ) ) ); + } + */ +} diff --git a/src/main.rs b/src/main.rs new file mode 100644 index 0000000..1b5b68a --- /dev/null +++ b/src/main.rs @@ -0,0 +1,71 @@ +/// +/// - dutree - +/// +/// Simple command to analyse disk usage from the terminal +/// +/// Usage: +/// btrfs-sync [options] [...] [[user@]host:] +/// +/// -k|--keep NUM keep only last sync'ed snapshots +/// -d|--delete delete snapshots in that don't exist in +/// -z|--xz use xz compression. Saves bandwidth, but uses one CPU +/// -Z|--pbzip2 use pbzip2 compression. Saves bandwidth, but uses all CPUs +/// -q|--quiet don't display progress +/// -v|--verbose display more information +/// -h|--help show usage +/// +/// can either be a single snapshot, or a folder containing snapshots +/// requires privileged permissions at for the 'btrfs' command +/// +/// Cron example: daily synchronization over the internet, keep only last 50 +/// +/// cat > /etc/cron.daily/btrfs-sync < +/// GPL licensed (see end of file) * Use at your own risk! +/// +/// More at https://ownyourbits.com +/// + +extern crate dutree; + +use dutree::Config; +use dutree::XResult::XErr; +use dutree::XResult::XOk; +use dutree::XResult::XExit; +use std::process; + +fn main() { + // Parse arguments + let cfg = match Config::new() { + XOk(cfg) => cfg, + XExit => process::exit(0), + XErr(err) => { + eprintln!( "{}", err ); + process::exit(1) + } + }; + + // Execution + dutree::run( &cfg ); +} + +// License +// +// This script 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 2 of the License, or +// (at your option) any later version. +// +// This script 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 script; if not, write to the +// Free Software Foundation, Inc., 59 Temple Place, Suite 330, diff --git a/test/.file_hidden b/test/.file_hidden new file mode 100644 index 0000000..e69de29 diff --git a/test/dir1/file1 b/test/dir1/file1 new file mode 100644 index 0000000..65f57c2 Binary files /dev/null and b/test/dir1/file1 differ diff --git a/test/dir1/file2 b/test/dir1/file2 new file mode 100644 index 0000000..65f57c2 Binary files /dev/null and b/test/dir1/file2 differ diff --git a/test/dir1/test2/file1 b/test/dir1/test2/file1 new file mode 100644 index 0000000..a64a5a9 Binary files /dev/null and b/test/dir1/test2/file1 differ diff --git a/test/dir1/test2/file2 b/test/dir1/test2/file2 new file mode 100644 index 0000000..65f57c2 Binary files /dev/null and b/test/dir1/test2/file2 differ diff --git a/test/dir1/test3/file1 b/test/dir1/test3/file1 new file mode 100644 index 0000000..65f57c2 Binary files /dev/null and b/test/dir1/test3/file1 differ diff --git a/test/dir1/test3/test2/file1 b/test/dir1/test3/test2/file1 new file mode 100644 index 0000000..a64a5a9 Binary files /dev/null and b/test/dir1/test3/test2/file1 differ diff --git a/test/dir1/test3/test2/file2 b/test/dir1/test3/test2/file2 new file mode 100644 index 0000000..65f57c2 Binary files /dev/null and b/test/dir1/test3/test2/file2 differ diff --git a/test/dir1/test3/test2/test2/file1 b/test/dir1/test3/test2/test2/file1 new file mode 100644 index 0000000..141dedd Binary files /dev/null and b/test/dir1/test3/test2/test2/file1 differ diff --git a/test/dir1/test3/test2/test2/file2 b/test/dir1/test3/test2/test2/file2 new file mode 100644 index 0000000..65f57c2 Binary files /dev/null and b/test/dir1/test3/test2/test2/file2 differ diff --git a/test/dir2/file1 b/test/dir2/file1 new file mode 100644 index 0000000..a64a5a9 Binary files /dev/null and b/test/dir2/file1 differ diff --git a/test/dir2/file2 b/test/dir2/file2 new file mode 100644 index 0000000..65f57c2 Binary files /dev/null and b/test/dir2/file2 differ diff --git a/test/dir3/file1 b/test/dir3/file1 new file mode 100644 index 0000000..65f57c2 Binary files /dev/null and b/test/dir3/file1 differ diff --git a/test/dir3/link b/test/dir3/link new file mode 120000 index 0000000..d014eb4 --- /dev/null +++ b/test/dir3/link @@ -0,0 +1 @@ +../dir2 \ No newline at end of file diff --git a/test/file.avi b/test/file.avi new file mode 100644 index 0000000..e69de29 diff --git a/test/file.exe b/test/file.exe new file mode 100755 index 0000000..e69de29 diff --git a/test/file.mp3 b/test/file.mp3 new file mode 100644 index 0000000..e69de29 diff --git a/test/file.tar b/test/file.tar new file mode 100644 index 0000000..e69de29 diff --git a/test/file1 b/test/file1 new file mode 100644 index 0000000..65f57c2 Binary files /dev/null and b/test/file1 differ diff --git a/test/file_noperms b/test/file_noperms new file mode 100644 index 0000000..65f57c2 Binary files /dev/null and b/test/file_noperms differ diff --git a/test/file_sparse b/test/file_sparse new file mode 100644 index 0000000..6d17cf9 Binary files /dev/null and b/test/file_sparse differ diff --git a/test/file_special_á b/test/file_special_á new file mode 100644 index 0000000..e69de29 diff --git a/test/file_special_消 b/test/file_special_消 new file mode 100644 index 0000000..e69de29 diff --git a/test/link b/test/link new file mode 120000 index 0000000..972c54e --- /dev/null +++ b/test/link @@ -0,0 +1 @@ +/media/ \ No newline at end of file diff --git a/test/link_orphan b/test/link_orphan new file mode 120000 index 0000000..bfda748 --- /dev/null +++ b/test/link_orphan @@ -0,0 +1 @@ +/nonexistent \ No newline at end of file diff --git a/test/picture.png b/test/picture.png new file mode 100644 index 0000000..e69de29