[ { "path": ".editorconfig", "content": "root = true\n\n[*]\n\nend_of_line = lf\ninsert_final_newline = true\ntrim_trailing_whitespace = true\n\n[*.{js,py}]\ncharset = utf-8\n\n[*.py]\nindent_style = space\nindent_size = 4\n\n[*.html]\nindent_size = 4\n\n\n[*.css]\nindent_size = 4\n\n[Makefile]\nindent_style = tab\n\n[lib/**.js]\nindent_style = space\nindent_size = 2\n\n[{package.json,.travis.yml}]\nindent_style = space\nindent_size = 2\n" }, { "path": ".github/CODE_OF_CONDUCT.md", "content": "# Contributor Covenant Code of Conduct\n\n## Our Pledge\n\nIn the interest of fostering an open and welcoming environment, we as contributors and maintainers pledge to making participation in our project and our community a harassment-free experience for everyone, regardless of age, body size, disability, ethnicity, gender identity and expression, level of experience, nationality, personal appearance, race, religion, or sexual identity and orientation.\n\n## Our Standards\n\nExamples of behavior that contributes to creating a positive environment include:\n\n* Using welcoming and inclusive language\n* Being respectful of differing viewpoints and experiences\n* Gracefully accepting constructive criticism\n* Focusing on what is best for the community\n* Showing empathy towards other community members\n\nExamples of unacceptable behavior by participants include:\n\n* The use of sexualized language or imagery and unwelcome sexual attention or advances\n* Trolling, insulting/derogatory comments, and personal or political attacks\n* Public or private harassment\n* Publishing others' private information, such as a physical or electronic address, without explicit permission\n* Other conduct which could reasonably be considered inappropriate in a professional setting\n\n## Our Responsibilities\n\nProject maintainers are responsible for clarifying the standards of acceptable behavior and are expected to take appropriate and fair corrective action in response to any instances of unacceptable behavior.\n\nProject maintainers have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, or to ban temporarily or permanently any contributor for other behaviors that they deem inappropriate, threatening, offensive, or harmful.\n\n## Scope\n\nThis Code of Conduct applies both within project spaces and in public spaces when an individual is representing the project or its community. Examples of representing a project or community include using an official project e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event. Representation of a project may be further defined and clarified by project maintainers.\n\n## Enforcement\n\nInstances of abusive, harassing, or otherwise unacceptable behavior may be reported by contacting the project team at team@opengenus.org. The project team will review and investigate all complaints, and will respond in a way that it deems appropriate to the circumstances. The project team is obligated to maintain confidentiality with regard to the reporter of an incident. Further details of specific enforcement policies may be posted separately.\n\nProject maintainers who do not follow or enforce the Code of Conduct in good faith may face temporary or permanent repercussions as determined by other members of the project's leadership.\n\n## Attribution\n\nThis Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4, available at [http://contributor-covenant.org/version/1/4][version]\n\n[homepage]: http://contributor-covenant.org\n[version]: http://contributor-covenant.org/version/1/4/\n" }, { "path": ".github/ISSUE_TEMPLATE.md", "content": "\n\n**I'm submitting a ...** (check one with \"x\")\n- [ ] bug report\n- [ ] feature request\n\n**Description**:\n\nExplain what you would expect from this process.\n\n**Expected Behavior**:\n\nDescribe what you're currently experiencing from this process, and thereby explain the bug.\n\n**Actual Behavior**:\n\nPlease provide an ordered list on how to reproduce the issue.\n\n**Steps to Reproduce**:\n\nIf relevant, please include screenshots and logs.\n\n**Screenshots (if any)**:\n\n**Would you like to work on this issue?**\n- [ ] Yes\n- [ ] No\n" }, { "path": ".github/PULL_REQUEST_TEMPLATE.md", "content": "\n\n**Checklist**\n\n- [ ] My branch is up-to-date with the upstream `develop` branch.\n- [ ] I have added necessary documentation (if appropriate).\n\n**Which issue does this PR fix?**: \nfixes: #\n\n\n\n**Why do we need this PR?**:\n\nIf relevant, please include a screenshot.\n\n**Demo (optional)**:\n\nSome tips for you to write the instructions:\n- Prefer bulleted description\n- Start after checking out this branch\n- Include any setup required, such as migrating databases, etc.\n\n**Testing instructions:**\n\nIf there is any work still left to do, please add it here.\n\n**TODOs (if any)**:\n\n\n" }, { "path": ".gitignore", "content": "# Byte-compiled / optimized / DLL files\n__pycache__/\n*.py[cod]\n*$py.class\n\n# C extensions\n*.so\n\n# Distribution / packaging\n.Python\nenv/\nbuild/\ndevelop-eggs/\ndist/\ndownloads/\neggs/\n.eggs/\nlib/\nlib64/\nparts/\nsdist/\nvar/\n*.egg-info/\n.installed.cfg\n*.egg\n\n# PyInstaller\n# Usually these files are written by a python script from a template\n# before PyInstaller builds the exe, so as to inject date/other infos into it.\n*.manifest\n*.spec\n\n# Installer logs\npip-log.txt\npip-delete-this-directory.txt\n\n# Unit test / coverage reports\nhtmlcov/\n.tox/\n.coverage\n.coverage.*\n.cache\nnosetests.xml\ncoverage.xml\n*,cover\n.hypothesis/\n\n# Translations\n*.mo\n*.pot\n\n# Django stuff:\n*.log\nlocal_settings.py\n\n# Flask stuff:\ninstance/\n.webassets-cache\n\n# Scrapy stuff:\n.scrapy\n\n# Sphinx documentation\ndocs/_build/\n\n# PyBuilder\ntarget/\n\n# IPython Notebook\n.ipynb_checkpoints\n\n# pyenv\n.python-version\n\n# celery beat schedule file\ncelerybeat-schedule\n\n# dotenv\n.env\n\n# virtualenv\nvenv/\nENV/\n\n# Spyder project settings\n.spyderproject\n\n# Rope project settings\n.ropeproject\n\noshc/db.sqlite3\nstaticfiles/\n*.sqlite3\n*.pyc\n.idea/\n.DS_Store" }, { "path": ".hound.yml", "content": "python:\n enabled: true\nconfig_file: .flake8.ini\n" }, { "path": ".travis.yml", "content": "language: python\npython:\n - \"3.4\"\n - \"3.5\"\n - \"3.6\"\n#\nbefore_install:\n - sudo apt-get update\n - sudo apt-get -y install python-pip\n - sudo pip install --upgrade pip\n - pip install --upgrade pip\n - pip install pep8\n - pip install autopep8\n - cp .env.example .env\n# command to install dependencies\ninstall:\n - pip install -r requirements.txt\n# django environment\nenv:\n - DJANGO_VERSION=1.11.7\n# script\nscript:\n - flake8 .\n - python3 manage.py makemigrations\n - python3 manage.py migrate\n - python3 manage.py test" }, { "path": "CONTRIBUTORS.md", "content": "

\"cosmos-search\"

\n\n# Cosmos Search\n\n# Contributors at OpenGenus\n\n> Every work is great only because of its contributors\n\n| [**Contributors :family_woman_boy_boy:**](#contributors-1) | [**Interns :dancer:**](#interns) | [**Maintainers :man_office_worker:**](#maintainers) |\n|:---:|:---:|:---:|\n\nTo join our community, sign up at [our Discussion forum](https://discourse.opengenus.org/) and let us know your interests :sparkles: so we can help you better. \n\n## Contributors\nThanks goes to these ❤️ wonderful people who made this possible:\n\n| [
Aditya Chatterjee](https://github.com/AdiChat)
| [
Vaibhav Shelke](https://github.com/vshelke)
| [
David Wu](https://github.com/Pl4gue)
| [
Vaibhav Singh](https://github.com/vaibhavsingh97)
| [
Hervé Beraud](https://github.com/4383)
|\n| :---: | :---: | :---: | :---: | :---: |\n[
Sakshee Jain](https://github.com/sakshee-19)
| [
Ernest Chang](https://github.com/iattempt)
| [
Divya Maddala](https://github.com/maddaladivya)
| [
Ankan Poddar](https://github.com/ankan17)
| [
Pratibha Goyal](https://github.com/Pratibha-Goyal)
|\n[
Shweta Kumari](https://github.com/Shweta4321)
| [
Parthvi Vala](https://github.com/valaparthvi)
| [
Shikha Khatry](https://github.com/khatryshikha)
| [
Anannya Uberoi](https://github.com/anne27)
| [
Sarvani Deekshitula](https://github.com/sarvanideekshitula)
|\n[
reallinfo](https://github.com/reallinfo)
| [
Rounak Vyas](https://github.com/itsron717)
|\n\n### Interns\n\nWonderful interns at **OpenGenus** who worked on **Cosmos-Search**\n\n| [
Rounak Vyas](https://github.com/itsron717)
|\n| :---: | \n\n### Maintainers\n\nMaintainers who look after **Cosmos Search**\n\n| [
Aditya Chatterjee](https://github.com/AdiChat)
| [
Vaibhav Shelke](https://github.com/vshelke)
| [
Ernest Chang](https://github.com/iattempt)
| \n| :---: | :---: | :---: |\n" }, { "path": "LICENSE", "content": " GNU GENERAL PUBLIC LICENSE\n Version 3, 29 June 2007\n\n Copyright (C) 2007 Free Software Foundation, Inc. \n Everyone is permitted to copy and distribute verbatim copies\n of this license document, but changing it is not allowed.\n\n Preamble\n\n The GNU General Public License is a free, copyleft license for\nsoftware and other kinds of works.\n\n The licenses for most software and other practical works are designed\nto take away your freedom to share and change the works. By contrast,\nthe GNU General Public License is intended to guarantee your freedom to\nshare and change all versions of a program--to make sure it remains free\nsoftware for all its users. We, the Free Software Foundation, use the\nGNU General Public License for most of our software; it applies also to\nany other work released this way by its authors. You can apply it to\nyour programs, too.\n\n When we speak of free software, we are referring to freedom, not\nprice. Our General Public Licenses are designed to make sure that you\nhave the freedom to distribute copies of free software (and charge for\nthem if you wish), that you receive source code or can get it if you\nwant it, that you can change the software or use pieces of it in new\nfree programs, and that you know you can do these things.\n\n To protect your rights, we need to prevent others from denying you\nthese rights or asking you to surrender the rights. Therefore, you have\ncertain responsibilities if you distribute copies of the software, or if\nyou modify it: responsibilities to respect the freedom of others.\n\n For example, if you distribute copies of such a program, whether\ngratis or for a fee, you must pass on to the recipients the same\nfreedoms that you received. You must make sure that they, too, receive\nor can get the source code. And you must show them these terms so they\nknow their rights.\n\n Developers that use the GNU GPL protect your rights with two steps:\n(1) assert copyright on the software, and (2) offer you this License\ngiving you legal permission to copy, distribute and/or modify it.\n\n For the developers' and authors' protection, the GPL clearly explains\nthat there is no warranty for this free software. For both users' and\nauthors' sake, the GPL requires that modified versions be marked as\nchanged, so that their problems will not be attributed erroneously to\nauthors of previous versions.\n\n Some devices are designed to deny users access to install or run\nmodified versions of the software inside them, although the manufacturer\ncan do so. This is fundamentally incompatible with the aim of\nprotecting users' freedom to change the software. The systematic\npattern of such abuse occurs in the area of products for individuals to\nuse, which is precisely where it is most unacceptable. Therefore, we\nhave designed this version of the GPL to prohibit the practice for those\nproducts. If such problems arise substantially in other domains, we\nstand ready to extend this provision to those domains in future versions\nof the GPL, as needed to protect the freedom of users.\n\n Finally, every program is threatened constantly by software patents.\nStates should not allow patents to restrict development and use of\nsoftware on general-purpose computers, but in those that do, we wish to\navoid the special danger that patents applied to a free program could\nmake it effectively proprietary. To prevent this, the GPL assures that\npatents cannot be used to render the program non-free.\n\n The precise terms and conditions for copying, distribution and\nmodification follow.\n\n TERMS AND CONDITIONS\n\n 0. Definitions.\n\n \"This License\" refers to version 3 of the GNU General Public License.\n\n \"Copyright\" also means copyright-like laws that apply to other kinds of\nworks, such as semiconductor masks.\n\n \"The Program\" refers to any copyrightable work licensed under this\nLicense. Each licensee is addressed as \"you\". \"Licensees\" and\n\"recipients\" may be individuals or organizations.\n\n To \"modify\" a work means to copy from or adapt all or part of the work\nin a fashion requiring copyright permission, other than the making of an\nexact copy. The resulting work is called a \"modified version\" of the\nearlier work or a work \"based on\" the earlier work.\n\n A \"covered work\" means either the unmodified Program or a work based\non the Program.\n\n To \"propagate\" a work means to do anything with it that, without\npermission, would make you directly or secondarily liable for\ninfringement under applicable copyright law, except executing it on a\ncomputer or modifying a private copy. Propagation includes copying,\ndistribution (with or without modification), making available to the\npublic, and in some countries other activities as well.\n\n To \"convey\" a work means any kind of propagation that enables other\nparties to make or receive copies. Mere interaction with a user through\na computer network, with no transfer of a copy, is not conveying.\n\n An interactive user interface displays \"Appropriate Legal Notices\"\nto the extent that it includes a convenient and prominently visible\nfeature that (1) displays an appropriate copyright notice, and (2)\ntells the user that there is no warranty for the work (except to the\nextent that warranties are provided), that licensees may convey the\nwork under this License, and how to view a copy of this License. If\nthe interface presents a list of user commands or options, such as a\nmenu, a prominent item in the list meets this criterion.\n\n 1. Source Code.\n\n The \"source code\" for a work means the preferred form of the work\nfor making modifications to it. \"Object code\" means any non-source\nform of a work.\n\n A \"Standard Interface\" means an interface that either is an official\nstandard defined by a recognized standards body, or, in the case of\ninterfaces specified for a particular programming language, one that\nis widely used among developers working in that language.\n\n The \"System Libraries\" of an executable work include anything, other\nthan the work as a whole, that (a) is included in the normal form of\npackaging a Major Component, but which is not part of that Major\nComponent, and (b) serves only to enable use of the work with that\nMajor Component, or to implement a Standard Interface for which an\nimplementation is available to the public in source code form. A\n\"Major Component\", in this context, means a major essential component\n(kernel, window system, and so on) of the specific operating system\n(if any) on which the executable work runs, or a compiler used to\nproduce the work, or an object code interpreter used to run it.\n\n The \"Corresponding Source\" for a work in object code form means all\nthe source code needed to generate, install, and (for an executable\nwork) run the object code and to modify the work, including scripts to\ncontrol those activities. However, it does not include the work's\nSystem Libraries, or general-purpose tools or generally available free\nprograms which are used unmodified in performing those activities but\nwhich are not part of the work. For example, Corresponding Source\nincludes interface definition files associated with source files for\nthe work, and the source code for shared libraries and dynamically\nlinked subprograms that the work is specifically designed to require,\nsuch as by intimate data communication or control flow between those\nsubprograms and other parts of the work.\n\n The Corresponding Source need not include anything that users\ncan regenerate automatically from other parts of the Corresponding\nSource.\n\n The Corresponding Source for a work in source code form is that\nsame work.\n\n 2. Basic Permissions.\n\n All rights granted under this License are granted for the term of\ncopyright on the Program, and are irrevocable provided the stated\nconditions are met. This License explicitly affirms your unlimited\npermission to run the unmodified Program. The output from running a\ncovered work is covered by this License only if the output, given its\ncontent, constitutes a covered work. This License acknowledges your\nrights of fair use or other equivalent, as provided by copyright law.\n\n You may make, run and propagate covered works that you do not\nconvey, without conditions so long as your license otherwise remains\nin force. You may convey covered works to others for the sole purpose\nof having them make modifications exclusively for you, or provide you\nwith facilities for running those works, provided that you comply with\nthe terms of this License in conveying all material for which you do\nnot control copyright. Those thus making or running the covered works\nfor you must do so exclusively on your behalf, under your direction\nand control, on terms that prohibit them from making any copies of\nyour copyrighted material outside their relationship with you.\n\n Conveying under any other circumstances is permitted solely under\nthe conditions stated below. Sublicensing is not allowed; section 10\nmakes it unnecessary.\n\n 3. Protecting Users' Legal Rights From Anti-Circumvention Law.\n\n No covered work shall be deemed part of an effective technological\nmeasure under any applicable law fulfilling obligations under article\n11 of the WIPO copyright treaty adopted on 20 December 1996, or\nsimilar laws prohibiting or restricting circumvention of such\nmeasures.\n\n When you convey a covered work, you waive any legal power to forbid\ncircumvention of technological measures to the extent such circumvention\nis effected by exercising rights under this License with respect to\nthe covered work, and you disclaim any intention to limit operation or\nmodification of the work as a means of enforcing, against the work's\nusers, your or third parties' legal rights to forbid circumvention of\ntechnological measures.\n\n 4. Conveying Verbatim Copies.\n\n You may convey verbatim copies of the Program's source code as you\nreceive it, in any medium, provided that you conspicuously and\nappropriately publish on each copy an appropriate copyright notice;\nkeep intact all notices stating that this License and any\nnon-permissive terms added in accord with section 7 apply to the code;\nkeep intact all notices of the absence of any warranty; and give all\nrecipients a copy of this License along with the Program.\n\n You may charge any price or no price for each copy that you convey,\nand you may offer support or warranty protection for a fee.\n\n 5. Conveying Modified Source Versions.\n\n You may convey a work based on the Program, or the modifications to\nproduce it from the Program, in the form of source code under the\nterms of section 4, provided that you also meet all of these conditions:\n\n a) The work must carry prominent notices stating that you modified\n it, and giving a relevant date.\n\n b) The work must carry prominent notices stating that it is\n released under this License and any conditions added under section\n 7. This requirement modifies the requirement in section 4 to\n \"keep intact all notices\".\n\n c) You must license the entire work, as a whole, under this\n License to anyone who comes into possession of a copy. This\n License will therefore apply, along with any applicable section 7\n additional terms, to the whole of the work, and all its parts,\n regardless of how they are packaged. This License gives no\n permission to license the work in any other way, but it does not\n invalidate such permission if you have separately received it.\n\n d) If the work has interactive user interfaces, each must display\n Appropriate Legal Notices; however, if the Program has interactive\n interfaces that do not display Appropriate Legal Notices, your\n work need not make them do so.\n\n A compilation of a covered work with other separate and independent\nworks, which are not by their nature extensions of the covered work,\nand which are not combined with it such as to form a larger program,\nin or on a volume of a storage or distribution medium, is called an\n\"aggregate\" if the compilation and its resulting copyright are not\nused to limit the access or legal rights of the compilation's users\nbeyond what the individual works permit. Inclusion of a covered work\nin an aggregate does not cause this License to apply to the other\nparts of the aggregate.\n\n 6. Conveying Non-Source Forms.\n\n You may convey a covered work in object code form under the terms\nof sections 4 and 5, provided that you also convey the\nmachine-readable Corresponding Source under the terms of this License,\nin one of these ways:\n\n a) Convey the object code in, or embodied in, a physical product\n (including a physical distribution medium), accompanied by the\n Corresponding Source fixed on a durable physical medium\n customarily used for software interchange.\n\n b) Convey the object code in, or embodied in, a physical product\n (including a physical distribution medium), accompanied by a\n written offer, valid for at least three years and valid for as\n long as you offer spare parts or customer support for that product\n model, to give anyone who possesses the object code either (1) a\n copy of the Corresponding Source for all the software in the\n product that is covered by this License, on a durable physical\n medium customarily used for software interchange, for a price no\n more than your reasonable cost of physically performing this\n conveying of source, or (2) access to copy the\n Corresponding Source from a network server at no charge.\n\n c) Convey individual copies of the object code with a copy of the\n written offer to provide the Corresponding Source. This\n alternative is allowed only occasionally and noncommercially, and\n only if you received the object code with such an offer, in accord\n with subsection 6b.\n\n d) Convey the object code by offering access from a designated\n place (gratis or for a charge), and offer equivalent access to the\n Corresponding Source in the same way through the same place at no\n further charge. You need not require recipients to copy the\n Corresponding Source along with the object code. If the place to\n copy the object code is a network server, the Corresponding Source\n may be on a different server (operated by you or a third party)\n that supports equivalent copying facilities, provided you maintain\n clear directions next to the object code saying where to find the\n Corresponding Source. Regardless of what server hosts the\n Corresponding Source, you remain obligated to ensure that it is\n available for as long as needed to satisfy these requirements.\n\n e) Convey the object code using peer-to-peer transmission, provided\n you inform other peers where the object code and Corresponding\n Source of the work are being offered to the general public at no\n charge under subsection 6d.\n\n A separable portion of the object code, whose source code is excluded\nfrom the Corresponding Source as a System Library, need not be\nincluded in conveying the object code work.\n\n A \"User Product\" is either (1) a \"consumer product\", which means any\ntangible personal property which is normally used for personal, family,\nor household purposes, or (2) anything designed or sold for incorporation\ninto a dwelling. In determining whether a product is a consumer product,\ndoubtful cases shall be resolved in favor of coverage. For a particular\nproduct received by a particular user, \"normally used\" refers to a\ntypical or common use of that class of product, regardless of the status\nof the particular user or of the way in which the particular user\nactually uses, or expects or is expected to use, the product. A product\nis a consumer product regardless of whether the product has substantial\ncommercial, industrial or non-consumer uses, unless such uses represent\nthe only significant mode of use of the product.\n\n \"Installation Information\" for a User Product means any methods,\nprocedures, authorization keys, or other information required to install\nand execute modified versions of a covered work in that User Product from\na modified version of its Corresponding Source. The information must\nsuffice to ensure that the continued functioning of the modified object\ncode is in no case prevented or interfered with solely because\nmodification has been made.\n\n If you convey an object code work under this section in, or with, or\nspecifically for use in, a User Product, and the conveying occurs as\npart of a transaction in which the right of possession and use of the\nUser Product is transferred to the recipient in perpetuity or for a\nfixed term (regardless of how the transaction is characterized), the\nCorresponding Source conveyed under this section must be accompanied\nby the Installation Information. But this requirement does not apply\nif neither you nor any third party retains the ability to install\nmodified object code on the User Product (for example, the work has\nbeen installed in ROM).\n\n The requirement to provide Installation Information does not include a\nrequirement to continue to provide support service, warranty, or updates\nfor a work that has been modified or installed by the recipient, or for\nthe User Product in which it has been modified or installed. Access to a\nnetwork may be denied when the modification itself materially and\nadversely affects the operation of the network or violates the rules and\nprotocols for communication across the network.\n\n Corresponding Source conveyed, and Installation Information provided,\nin accord with this section must be in a format that is publicly\ndocumented (and with an implementation available to the public in\nsource code form), and must require no special password or key for\nunpacking, reading or copying.\n\n 7. Additional Terms.\n\n \"Additional permissions\" are terms that supplement the terms of this\nLicense by making exceptions from one or more of its conditions.\nAdditional permissions that are applicable to the entire Program shall\nbe treated as though they were included in this License, to the extent\nthat they are valid under applicable law. If additional permissions\napply only to part of the Program, that part may be used separately\nunder those permissions, but the entire Program remains governed by\nthis License without regard to the additional permissions.\n\n When you convey a copy of a covered work, you may at your option\nremove any additional permissions from that copy, or from any part of\nit. (Additional permissions may be written to require their own\nremoval in certain cases when you modify the work.) You may place\nadditional permissions on material, added by you to a covered work,\nfor which you have or can give appropriate copyright permission.\n\n Notwithstanding any other provision of this License, for material you\nadd to a covered work, you may (if authorized by the copyright holders of\nthat material) supplement the terms of this License with terms:\n\n a) Disclaiming warranty or limiting liability differently from the\n terms of sections 15 and 16 of this License; or\n\n b) Requiring preservation of specified reasonable legal notices or\n author attributions in that material or in the Appropriate Legal\n Notices displayed by works containing it; or\n\n c) Prohibiting misrepresentation of the origin of that material, or\n requiring that modified versions of such material be marked in\n reasonable ways as different from the original version; or\n\n d) Limiting the use for publicity purposes of names of licensors or\n authors of the material; or\n\n e) Declining to grant rights under trademark law for use of some\n trade names, trademarks, or service marks; or\n\n f) Requiring indemnification of licensors and authors of that\n material by anyone who conveys the material (or modified versions of\n it) with contractual assumptions of liability to the recipient, for\n any liability that these contractual assumptions directly impose on\n those licensors and authors.\n\n All other non-permissive additional terms are considered \"further\nrestrictions\" within the meaning of section 10. If the Program as you\nreceived it, or any part of it, contains a notice stating that it is\ngoverned by this License along with a term that is a further\nrestriction, you may remove that term. If a license document contains\na further restriction but permits relicensing or conveying under this\nLicense, you may add to a covered work material governed by the terms\nof that license document, provided that the further restriction does\nnot survive such relicensing or conveying.\n\n If you add terms to a covered work in accord with this section, you\nmust place, in the relevant source files, a statement of the\nadditional terms that apply to those files, or a notice indicating\nwhere to find the applicable terms.\n\n Additional terms, permissive or non-permissive, may be stated in the\nform of a separately written license, or stated as exceptions;\nthe above requirements apply either way.\n\n 8. Termination.\n\n You may not propagate or modify a covered work except as expressly\nprovided under this License. Any attempt otherwise to propagate or\nmodify it is void, and will automatically terminate your rights under\nthis License (including any patent licenses granted under the third\nparagraph of section 11).\n\n However, if you cease all violation of this License, then your\nlicense from a particular copyright holder is reinstated (a)\nprovisionally, unless and until the copyright holder explicitly and\nfinally terminates your license, and (b) permanently, if the copyright\nholder fails to notify you of the violation by some reasonable means\nprior to 60 days after the cessation.\n\n Moreover, your license from a particular copyright holder is\nreinstated permanently if the copyright holder notifies you of the\nviolation by some reasonable means, this is the first time you have\nreceived notice of violation of this License (for any work) from that\ncopyright holder, and you cure the violation prior to 30 days after\nyour receipt of the notice.\n\n Termination of your rights under this section does not terminate the\nlicenses of parties who have received copies or rights from you under\nthis License. If your rights have been terminated and not permanently\nreinstated, you do not qualify to receive new licenses for the same\nmaterial under section 10.\n\n 9. Acceptance Not Required for Having Copies.\n\n You are not required to accept this License in order to receive or\nrun a copy of the Program. Ancillary propagation of a covered work\noccurring solely as a consequence of using peer-to-peer transmission\nto receive a copy likewise does not require acceptance. However,\nnothing other than this License grants you permission to propagate or\nmodify any covered work. These actions infringe copyright if you do\nnot accept this License. Therefore, by modifying or propagating a\ncovered work, you indicate your acceptance of this License to do so.\n\n 10. Automatic Licensing of Downstream Recipients.\n\n Each time you convey a covered work, the recipient automatically\nreceives a license from the original licensors, to run, modify and\npropagate that work, subject to this License. You are not responsible\nfor enforcing compliance by third parties with this License.\n\n An \"entity transaction\" is a transaction transferring control of an\norganization, or substantially all assets of one, or subdividing an\norganization, or merging organizations. If propagation of a covered\nwork results from an entity transaction, each party to that\ntransaction who receives a copy of the work also receives whatever\nlicenses to the work the party's predecessor in interest had or could\ngive under the previous paragraph, plus a right to possession of the\nCorresponding Source of the work from the predecessor in interest, if\nthe predecessor has it or can get it with reasonable efforts.\n\n You may not impose any further restrictions on the exercise of the\nrights granted or affirmed under this License. For example, you may\nnot impose a license fee, royalty, or other charge for exercise of\nrights granted under this License, and you may not initiate litigation\n(including a cross-claim or counterclaim in a lawsuit) alleging that\nany patent claim is infringed by making, using, selling, offering for\nsale, or importing the Program or any portion of it.\n\n 11. Patents.\n\n A \"contributor\" is a copyright holder who authorizes use under this\nLicense of the Program or a work on which the Program is based. The\nwork thus licensed is called the contributor's \"contributor version\".\n\n A contributor's \"essential patent claims\" are all patent claims\nowned or controlled by the contributor, whether already acquired or\nhereafter acquired, that would be infringed by some manner, permitted\nby this License, of making, using, or selling its contributor version,\nbut do not include claims that would be infringed only as a\nconsequence of further modification of the contributor version. For\npurposes of this definition, \"control\" includes the right to grant\npatent sublicenses in a manner consistent with the requirements of\nthis License.\n\n Each contributor grants you a non-exclusive, worldwide, royalty-free\npatent license under the contributor's essential patent claims, to\nmake, use, sell, offer for sale, import and otherwise run, modify and\npropagate the contents of its contributor version.\n\n In the following three paragraphs, a \"patent license\" is any express\nagreement or commitment, however denominated, not to enforce a patent\n(such as an express permission to practice a patent or covenant not to\nsue for patent infringement). To \"grant\" such a patent license to a\nparty means to make such an agreement or commitment not to enforce a\npatent against the party.\n\n If you convey a covered work, knowingly relying on a patent license,\nand the Corresponding Source of the work is not available for anyone\nto copy, free of charge and under the terms of this License, through a\npublicly available network server or other readily accessible means,\nthen you must either (1) cause the Corresponding Source to be so\navailable, or (2) arrange to deprive yourself of the benefit of the\npatent license for this particular work, or (3) arrange, in a manner\nconsistent with the requirements of this License, to extend the patent\nlicense to downstream recipients. \"Knowingly relying\" means you have\nactual knowledge that, but for the patent license, your conveying the\ncovered work in a country, or your recipient's use of the covered work\nin a country, would infringe one or more identifiable patents in that\ncountry that you have reason to believe are valid.\n\n If, pursuant to or in connection with a single transaction or\narrangement, you convey, or propagate by procuring conveyance of, a\ncovered work, and grant a patent license to some of the parties\nreceiving the covered work authorizing them to use, propagate, modify\nor convey a specific copy of the covered work, then the patent license\nyou grant is automatically extended to all recipients of the covered\nwork and works based on it.\n\n A patent license is \"discriminatory\" if it does not include within\nthe scope of its coverage, prohibits the exercise of, or is\nconditioned on the non-exercise of one or more of the rights that are\nspecifically granted under this License. You may not convey a covered\nwork if you are a party to an arrangement with a third party that is\nin the business of distributing software, under which you make payment\nto the third party based on the extent of your activity of conveying\nthe work, and under which the third party grants, to any of the\nparties who would receive the covered work from you, a discriminatory\npatent license (a) in connection with copies of the covered work\nconveyed by you (or copies made from those copies), or (b) primarily\nfor and in connection with specific products or compilations that\ncontain the covered work, unless you entered into that arrangement,\nor that patent license was granted, prior to 28 March 2007.\n\n Nothing in this License shall be construed as excluding or limiting\nany implied license or other defenses to infringement that may\notherwise be available to you under applicable patent law.\n\n 12. No Surrender of Others' Freedom.\n\n If conditions are imposed on you (whether by court order, agreement or\notherwise) that contradict the conditions of this License, they do not\nexcuse you from the conditions of this License. If you cannot convey a\ncovered work so as to satisfy simultaneously your obligations under this\nLicense and any other pertinent obligations, then as a consequence you may\nnot convey it at all. For example, if you agree to terms that obligate you\nto collect a royalty for further conveying from those to whom you convey\nthe Program, the only way you could satisfy both those terms and this\nLicense would be to refrain entirely from conveying the Program.\n\n 13. Use with the GNU Affero General Public License.\n\n Notwithstanding any other provision of this License, you have\npermission to link or combine any covered work with a work licensed\nunder version 3 of the GNU Affero General Public License into a single\ncombined work, and to convey the resulting work. The terms of this\nLicense will continue to apply to the part which is the covered work,\nbut the special requirements of the GNU Affero General Public License,\nsection 13, concerning interaction through a network will apply to the\ncombination as such.\n\n 14. Revised Versions of this License.\n\n The Free Software Foundation may publish revised and/or new versions of\nthe GNU General Public License from time to time. Such new versions will\nbe similar in spirit to the present version, but may differ in detail to\naddress new problems or concerns.\n\n Each version is given a distinguishing version number. If the\nProgram specifies that a certain numbered version of the GNU General\nPublic License \"or any later version\" applies to it, you have the\noption of following the terms and conditions either of that numbered\nversion or of any later version published by the Free Software\nFoundation. If the Program does not specify a version number of the\nGNU General Public License, you may choose any version ever published\nby the Free Software Foundation.\n\n If the Program specifies that a proxy can decide which future\nversions of the GNU General Public License can be used, that proxy's\npublic statement of acceptance of a version permanently authorizes you\nto choose that version for the Program.\n\n Later license versions may give you additional or different\npermissions. However, no additional obligations are imposed on any\nauthor or copyright holder as a result of your choosing to follow a\nlater version.\n\n 15. Disclaimer of Warranty.\n\n THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY\nAPPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT\nHOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM \"AS IS\" WITHOUT WARRANTY\nOF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,\nTHE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\nPURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM\nIS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF\nALL NECESSARY SERVICING, REPAIR OR CORRECTION.\n\n 16. Limitation of Liability.\n\n IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING\nWILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS\nTHE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY\nGENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE\nUSE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF\nDATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD\nPARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),\nEVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF\nSUCH DAMAGES.\n\n 17. Interpretation of Sections 15 and 16.\n\n If the disclaimer of warranty and limitation of liability provided\nabove cannot be given local legal effect according to their terms,\nreviewing courts shall apply local law that most closely approximates\nan absolute waiver of all civil liability in connection with the\nProgram, unless a warranty or assumption of liability accompanies a\ncopy of the Program in return for a fee.\n\n END OF TERMS AND CONDITIONS\n\n How to Apply These Terms to Your New Programs\n\n If you develop a new program, and you want it to be of the greatest\npossible use to the public, the best way to achieve this is to make it\nfree software which everyone can redistribute and change under these terms.\n\n To do so, attach the following notices to the program. It is safest\nto attach them to the start of each source file to most effectively\nstate the exclusion of warranty; and each file should have at least\nthe \"copyright\" line and a pointer to where the full notice is found.\n\n {one line to give the program's name and a brief idea of what it does.}\n Copyright (C) {year} {name of author}\n\n This program is free software: you can redistribute it and/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program. If not, see .\n\nAlso add information on how to contact you by electronic and paper mail.\n\n If the program does terminal interaction, make it output a short\nnotice like this when it starts in an interactive mode:\n\n {project} Copyright (C) {year} {fullname}\n This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.\n This is free software, and you are welcome to redistribute it\n under certain conditions; type `show c' for details.\n\nThe hypothetical commands `show w' and `show c' should show the appropriate\nparts of the General Public License. Of course, your program's commands\nmight be different; for a GUI interface, you would use an \"about box\".\n\n You should also get your employer (if you work as a programmer) or school,\nif any, to sign a \"copyright disclaimer\" for the program, if necessary.\nFor more information on this, and how to apply and follow the GNU GPL, see\n.\n\n The GNU General Public License does not permit incorporating your program\ninto proprietary programs. If your program is a subroutine library, you\nmay consider it more useful to permit linking proprietary applications with\nthe library. If this is what you want to do, use the GNU Lesser General\nPublic License instead of this License. But first, please read\n.\n" }, { "path": "Procfile", "content": "web: gunicorn cosmos_search.wsgi --log-file -\n" }, { "path": "README.md", "content": "

\"cosmos-search\"

\n\n# Cosmos Search\n\nThis is the real-time code search engine for all. We aim to revolutionize the way people interact and search for code. This is evident in our on-going work. Cosmos Search is privacy-focussed as we do not store any data.\n\nSome of our **core beliefs** that drive the development of this search engine:\n\n* Searching is more of a social act.\n* The Divide between programming languages and native languages must be minimized.\n* Time spend on searching must be minimized.\n* Time spend on learning, discussing and socializing must be maximized.\n\nLink: [**search.opengenus.org**](http://search.opengenus.org)\n\nCosmos Search is one of the most impactful sister projects of [**Cosmos**](https://github.com/OpenGenus/cosmos) powered by [**OpenGenus Foundation**](https://github.com/OpenGenus).\n\nThis is the official search tool for cosmos, a library of every algorithm and data structure code that you will ever encounter.\n\n[![Build Status](https://travis-ci.org/OpenGenus/cosmos-search.svg?branch=master)](https://travis-ci.org/OpenGenus/cosmos-search.svg?branch=master)\n[![License: GPL v3](https://img.shields.io/badge/License-GPL%20v3-blue.svg)](https://www.gnu.org/licenses/gpl-3.0)\n\n\n## Maintainers\n\nThis is a very ambitious project based on a massive collaboration and to keep the quality intact and drive the vision in the proper direction, we have maintainers.\n\n> Maintainers are your friends forever. They are vastly different from moderators.\n\nCurrently, we have 3 active maintainers and we are expanding quickly.\n\nThe task of maintainers is to review pull requests, suggest further quality additions and keep the work up to date with the current state of the world. 🌍\n\nLet us know if you would like to be a maintainer and we will review and add you upon subsequent contributions. To join our massive community at Slack open an issue [here](https://github.com/OpenGenus/OpenGenus-Slack).\n\n## Contributors\n\nThe success of our vision depends on you. Even a small contribution helps. All forms of contributions are highly welcomed and valued.\n\nWhen you contribute, your name with a link (if available) is added to our [**contributors list**](https://github.com/OpenGenus/cosmos-search/wiki/Contributors).\n\nYou can contribute by writing code, documentation, making Cosmos search friendly and many others. There are endless possibilities.\n\nYou might, also, like to take a look at our [Ideas List](https://github.com/OpenGenus/cosmos-search/wiki/Idea-List). You can take up a task from the list or suggest your own. Open a pull request to indicate the work you are doing.\n\nFeel free to discuss anything with us. 💭\n\n## Contributing to the Human-Curated Lists\n\nOne can contribute to the lists by uploading their files to the repository `human_curated_lists` which supports only `.md` file(s) for now.\n\nAfter uploading the file(s) update the `lists.json` file with necessary details about the list such as _List Title_, _List Description_, _Author Name_, etc. \n\nAfter this a Pull Request can be generated and the lists will be reviewed and merged.\n\n### Technologies Used\n\nThis project uses a number of open source projects:\n\n* [Django](https://www.djangoproject.com/) - Django is a high-level Python Web framework that encourages rapid development and clean, pragmatic design.\n* [Bootstrap](https://getbootstrap.com/) - Responsive frontend framework\n* [Heroku](https://www.heroku.com/) - Webapp deployed here\n* [Travis](travis-ci.org) - Continuous Integration of the project\n\n## Run this search engine locally\n\n1. Clone this repository using\n\t```\n\t$ git clone https://github.com/OpenGenus/cosmos-search.git\n \t```\n\n2. Go inside main Django app\n\n\t```\n\t$ cd cosmos-search\n\t```\n\n3. Setup a virtual environment\n\n\t`$ virtualenv -m python3 env_name` **OR** `$ python3 -m venv env_name`\n\t\n\t(For Conda users)\n\t\n\t`$ conda create -n env_name python=3.6 anaconda`\n\t\n\n4. Activate the virtual environment\n\t```\n\t$ source env_name/bin/activate\n\t```\n\t\n\tThe virtual environment can be deactivated with the `deactivate` command.\n\t\n\t(For Conda users)\n\t\n\t`$ source activate env_name`\n\t\n\tThe virtual environment can be deactivated with the `source deactivate` command.\n\t\n5. Install local dependencies\n\n\tConda users need to install pip locally in their virtual environment using `$ conda install pip`\n\n ```\n pip install -r requirements.txt\n ```\n6. Create a project in the Google Developers Console and obtain authorization credentials and API Key for [YouTube Data API v3](https://console.developers.google.com/apis/library/youtube.googleapis.com/).\n\n7. Insert the obtained Key in parameter `DEVELOPER_KEY` in .env.example file\n\n8. Copy the .env.example file to .env and supply values for the required variables.\n\n9. Collectstatic files using\n\n\t```\n\t$ python manage.py collectstatic\n\t```\n\n10. Migrating files using\n\n\t```\n $ python manage.py migrate\n\t```\n11. Create Cache Table\n\n ```\n $ python manage.py createcachetable\n ```\n\n12. Run the app\n\t```\n\t$ python manage.py runserver\n\t```\n\n13. View the locally built site\n\n\t```\n\tlocalhost:8000\n\t```\nTo run the web app in Debug mode set the DEBUG environment variable.\nIn Linux, run the `export DEBUG=True` command in the terminal.\n\n\n## License\n\nWe believe in freedom and improvement. Cosmos Search is built with ♥ by [OpenGenus Community](https://github.com/OpenGenus) under [GPL v3](https://www.gnu.org/licenses/gpl-3.0)\n" }, { "path": "cosmos_search/__init__.py", "content": "" }, { "path": "cosmos_search/settings.py", "content": "\"\"\"\nDjango settings for cosmos_search project.\n\nGenerated by 'django-admin startproject' using Django 1.11.7.\n\nFor more information on this file, see\nhttps://docs.djangoproject.com/en/1.11/topics/settings/\n\nFor the full list of settings and their values, see\nhttps://docs.djangoproject.com/en/1.11/ref/settings/\n\"\"\"\n\nimport os\n\nfrom decouple import config, Csv\n\n# Build paths inside the project like this: os.path.join(BASE_DIR, ...)\nBASE_DIR = os.path.dirname(os.path.dirname(os.path.abspath(__file__)))\n\n\n# Quick-start development settings - unsuitable for production\n# See https://docs.djangoproject.com/en/1.11/howto/deployment/checklist/\n\n# SECURITY WARNING: keep the secret key used in production secret!\nSECRET_KEY = config('SECRET_KEY')\n\n# SECURITY WARNING: don't run with debug turned on in production!\nDEBUG = config('DEBUG', cast=bool)\n\nALLOWED_HOSTS = config('ALLOWED_HOSTS', cast=Csv())\n\n# OpenGenus specific\nGITHUB_WEBHOOK_SECRET = config('GITHUB_WEBHOOK_SECRET', cast=lambda v: v.encode('UTF-8'))\n\nCOSMOS_LINK = 'https://github.com/OpenGenus/cosmos.git'\n\nCOSMOS_ROOT = 'cosmos/'\n\nMETADATA_JSON = 'metadata.json'\n\nTAGS_JSON = 'tags.json'\n\nTIMESTAMPS_JSON = 'timestamps.json'\n\nYOUTUBE_DATA_API_KEY = config('YOUTUBE_DATA_API_KEY')\n\nNEWS_API_KEY = \"27dda8d73c8340168550c70a32660564\"\n\nLISTS_MD = 'human_curated_lists/'\n\nLISTS_INFO = 'lists.json'\n\n# Application definition\n\nINSTALLED_APPS = [\n 'update.apps.UpdateConfig',\n 'search.apps.SearchConfig',\n 'django.contrib.admin',\n 'django.contrib.auth',\n 'django.contrib.contenttypes',\n 'django.contrib.sessions',\n 'django.contrib.messages',\n 'django.contrib.staticfiles',\n]\n\nMIDDLEWARE = [\n 'django.middleware.security.SecurityMiddleware',\n 'django.contrib.sessions.middleware.SessionMiddleware',\n 'django.middleware.common.CommonMiddleware',\n 'django.middleware.csrf.CsrfViewMiddleware',\n 'django.contrib.auth.middleware.AuthenticationMiddleware',\n 'django.contrib.messages.middleware.MessageMiddleware',\n 'django.middleware.clickjacking.XFrameOptionsMiddleware',\n]\n\nROOT_URLCONF = 'cosmos_search.urls'\n\nTEMPLATES = [\n {\n 'BACKEND': 'django.template.backends.django.DjangoTemplates',\n 'DIRS': [os.path.join(BASE_DIR, 'templates')],\n 'APP_DIRS': True,\n 'OPTIONS': {\n 'context_processors': [\n 'django.template.context_processors.debug',\n 'django.template.context_processors.request',\n 'django.contrib.auth.context_processors.auth',\n 'django.contrib.messages.context_processors.messages',\n ],\n },\n },\n]\n\nWSGI_APPLICATION = 'cosmos_search.wsgi.application'\n\n\n# Database\n# https://docs.djangoproject.com/en/1.11/ref/settings/#databases\n\nDATABASES = {\n 'default': {\n 'ENGINE': 'django.db.backends.sqlite3',\n 'NAME': os.path.join(BASE_DIR, 'db.sqlite3'),\n }\n}\n\nCACHES = {\n 'default': {\n 'BACKEND': 'django.core.cache.backends.db.DatabaseCache',\n 'LOCATION': 'dev_cache',\n 'TIMEOUT': 60 * 60 * 24 * 7 * 4,\n 'VERSION': 1,\n 'OPTIONS': {\n 'MAX_ENTRIES': 10000\n }\n }\n}\n\n# Password validation\n# https://docs.djangoproject.com/en/1.11/ref/settings/#auth-password-validators\n\nAUTH_PASSWORD_VALIDATORS = [\n {\n 'NAME': 'django.contrib.auth.password_validation.UserAttributeSimilarityValidator',\n },\n {\n 'NAME': 'django.contrib.auth.password_validation.MinimumLengthValidator',\n },\n {\n 'NAME': 'django.contrib.auth.password_validation.CommonPasswordValidator',\n },\n {\n 'NAME': 'django.contrib.auth.password_validation.NumericPasswordValidator',\n },\n]\n\n\n# Internationalization\n# https://docs.djangoproject.com/en/1.11/topics/i18n/\n\nLANGUAGE_CODE = 'en-us'\n\nTIME_ZONE = 'UTC'\n\nUSE_I18N = True\n\nUSE_L10N = True\n\nUSE_TZ = True\n\n\n# Static files (CSS, JavaScript, Images)\n# https://docs.djangoproject.com/en/1.11/howto/static-files/\n\nSTATIC_URL = '/static/'\nSTATIC_ROOT = os.path.join(BASE_DIR, 'static')\n" }, { "path": "cosmos_search/urls.py", "content": "\"\"\"cosmos_search URL Configuration\n\nThe `urlpatterns` list routes URLs to views. For more information please see:\n https://docs.djangoproject.com/en/1.11/topics/http/urls/\nExamples:\nFunction views\n 1. Add an import: from my_app import views\n 2. Add a URL to urlpatterns: url(r'^$', views.home, name='home')\nClass-based views\n 1. Add an import: from other_app.views import Home\n 2. Add a URL to urlpatterns: url(r'^$', Home.as_view(), name='home')\nIncluding another URLconf\n 1. Import the include() function: from django.conf.urls import url, include\n 2. Add a URL to urlpatterns: url(r'^blog/', include('blog.urls'))\n\"\"\"\nfrom django.conf.urls import url, include\nfrom django.conf.urls.static import static\nfrom django.contrib import admin\nfrom django.conf.urls import handler400\nfrom django.conf.urls import handler403\nfrom django.conf.urls import handler404\nfrom django.conf.urls import handler500\nfrom django.views.static import serve\n\nfrom cosmos_search import settings\nfrom search import views\n\nurlpatterns = [\n url(r'^', include('search.urls')),\n url(r'^update/', include('update.urls')),\n url(r'^admin/', admin.site.urls),\n]\n\nif settings.DEBUG:\n urlpatterns += static(settings.STATIC_URL, document_root=settings.STATIC_ROOT)\n\nif settings.DEBUG is False:\n urlpatterns += [url(r'^static/(?P.*)$', serve, {'document_root': settings.STATIC_ROOT}), ]\n\n\nhandler400 = views.error400 # noqa\nhandler403 = views.error403 # noqa\nhandler404 = views.error404 # noqa\nhandler500 = views.error500 # noqa\n" }, { "path": "cosmos_search/wsgi.py", "content": "\"\"\"\nWSGI config for cosmos_search project.\n\nIt exposes the WSGI callable as a module-level variable named ``application``.\n\nFor more information on this file, see\nhttps://docs.djangoproject.com/en/1.11/howto/deployment/wsgi/\n\"\"\"\n\nimport os\n\nfrom django.core.wsgi import get_wsgi_application\n\nos.environ.setdefault(\"DJANGO_SETTINGS_MODULE\", \"cosmos_search.settings\")\n\napplication = get_wsgi_application()\n" }, { "path": "human_curated_lists/awesome-competitive-coding.md", "content": "A Curated list of Topic wise Theory and Questions to Get You Started On Competitive Coding.\n\n*Inspired by the [awesome](https://github.com/sindresorhus/awesome) list thing. You might also like to read complete [awesome-list](https://github.com/sindresorhus/awesome).*\n\nTopics\n---\n - Binary and Ternary Search\n - Dynamic Programming\n - Game Theory\n - Graphs\n - Greedy\n - Maths\n - Miscellaneous\n - Prefix and Suffix Trees\n - Segment Trees\n - Trees\n\nBinary and Ternary Search\n---\n - Theory\n\n \t- [Hackerearth](https://www.hackerearth.com/notes/power-of-binary-search/) - Power of Binary search by [Aman Goel](https://www.hackerearth.com/users/amangoel.vsec/) (Easy).\n \t- [Topcoder](https://www.topcoder.com/community/data-science/data-science-tutorials/binary-search/) - Binary Search by [lovro](https://www.topcoder.com/member-profile/lovro/) (Hard).\n \t- [Ternary Search](http://rendon.x10.mx/ternary-search/) - Blog Post on Ternary Search.\n - Questions on\n\n \t- [Codeforces](http://codeforces.com/problemset/tags/binary%20search)\n \t- [A20j](http://a2oj.com/Category.jsp?ID=40)\n \t- [Codechef](https://discuss.codechef.com/tags/binarysearch/)\n\nDynamic Programming\n---\n\n - Theory\n\n \t- [Topcoder](https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/)\n \t- [Codechef](https://www.codechef.com/wiki/tutorial-dynamic-programming)\n\n - Questions on\n\n \t- [Hackerrank](https://www.hackerrank.com/domains/algorithms/dynamic-programming)\n \t- [spoj](http://problemclassifier.appspot.com/?keywords=dp)\n \t- [More Problems on SPOJ](http://apps.topcoder.com/forums/;jsessionid=C684F032169B7439C8012AAB6BA2018C?module=Thread&threadID=674592)\n \t- [A2oj](http://a2oj.com/Category.jsp?ID=33)\n \t- [Codeforces](http://codeforces.com/problemset/tags/dp)\n\nGame Theory\n---\n\n - Theory\n\t- [Stanford](http://web.stanford.edu/class/cs97si/05-combinatorial-games.pdf) - PDF on Combinatorial Games.\n\t- [Wikipedia](https://en.wikipedia.org/wiki/Nim) - Nim Games.\n\t- [Book](http://www.cs.ox.ac.uk/files/2735/Composite_games.pdf) - Composite Mathematical Games.\n\t- [Book](http://www.math.ucla.edu/~tom/Game_Theory/comb.pdf) - Game Theory By Thomas S. Ferguson.\n\n - Questions on \n\t- [A2oj](http://a2oj.com/Category.jsp?ID=91)\n\nGraphs\n---\n - Theory\n\n \t- [Topcoder](https://topcoder.com)\n \t\t- [Identifying a graph on Topcoder](https://www.topcoder.com/community/data-science/data-science-tutorials/introduction-to-graphs-and-their-data-structures-section-1/)\n \t\t- [Searching in a Graph](https://www.topcoder.com/community/data-science/data-science-tutorials/introduction-to-graphs-and-their-data-structures-section-2/)\n \t\t- [Path Algorithms](https://www.topcoder.com/community/data-science/data-science-tutorials/introduction-to-graphs-and-their-data-structures-section-3/)\n \t- [Codeforces](http://codeforces.com/blog/entry/16221) - Important Graph Algorithms by [PrinceOfPersia](http://codeforces.com/profile/PrinceOfPersia)\n \t- [Codechef](https://www.codechef.com/wiki/tutorial-graph-theory-part-1)\n - Questions on\n\n \t- [Codeforces](http://codeforces.com/problemset/tags/graphs)\n \t- [Codechef](https://discuss.codechef.com/tags/graph/)\n \t- [A2oj](http://a2oj.com/Category.jsp?ID=13)\n\nGreedy\n---\n - Theory\n\n \t- [Topcoder](https://www.topcoder.com/community/data-science/data-science-tutorials/greedy-is-good/)\n \t- [Stackoverflow.](http://stackoverflow.com/questions/7887487/how-to-spot-a-greedy-algorithm)\n \t- [Hackerearth](https://www.hackerearth.com/notes/greedy-algorithm/)\n - Questions on\n\n \t- [Codeforces](http://codeforces.com/problemset/tags/greedy)\n \t- [A2oj](http://a2oj.com/Category.jsp?ID=56)\n\nMaths\n---\n - Theory\n \t- [Stanford](http://web.stanford.edu/class/cs97si/02-mathematics.pdf) - Stanford's Guide on Introduction To Competitive Programming.\n \t- [Aduni](http://www.aduni.org/courses/discrete/index.php?view=cw) - Course Guide to Discrete Mathematics.\n \t- [Topcoder](https://www.topcoder.com/community/data-science/data-science-tutorials/understanding-probabilities/) - Understanding Probability.\n\n - Questions on \n \t- [A20j](http://a2oj.com/Category.jsp?ID=86)\n \t- [Codechef](https://discuss.codechef.com/tags/simple-math/) - Basic\n \t- [Codechef](https://discuss.codechef.com/tags/maths/) - Advanced\n\nMiscellaneous\n---\n - Mo's Algorithm\n \t- [Blog Post By Anudeep Nekkanti](http://blog.anudeep2011.com/mos-algorithm/)\n \t- [Hackerearth](https://www.hackerearth.com/notes/mos-algorithm/)\n \t- [DQUERY on Spoj](http://www.spoj.com/problems/DQUERY/en/)\n \t- [FREQUENT on Spoj](http://www.spoj.com/problems/FREQUENT/)\n - Persistant Segment Trees\n \t- [Blog Post By Anudeep Nekkanti](http://blog.anudeep2011.com/persistent-segment-trees-explained-with-spoj-problems/)\n \t- [MKTHNUM on Spoj](http://www.spoj.com/problems/MKTHNUM/en/)\n - Mobius Function\n \t- [Dance With Mobius Function by Surya Kiran](https://www.quora.com/profile/Surya-Kiran/Posts/A-Dance-with-Mobius-Function)\n - Treaps\n \t- [Codeforces](http://codeforces.com/blog/entry/11148)\n \t- [Wikipedia](https://en.wikipedia.org/wiki/Treap)\n \t- [TREAP on Spoj](http://www.spoj.com/problems/TREAP/)\n - Bit Manipulation\n\t- [Hackerearth](https://www.hackerearth.com/notes/bit-manipulation/) - Tutorial on Bit Manipulation by [Prateek Garg](https://www.hackerearth.com/users/ptk23/).\n\t- [Hackerrank](https://www.hackerrank.com/domains/algorithms/bit-manipulation) - Questions On Hackerrank on but manipulation.\n\nPrefix and Suffix Trees\n---\n - Theory\n\n \t- [Wikipedia](https://en.wikipedia.org/wiki/Trie)\n \t- [Tutorial by Sartaj Sahni](http://marknelson.us/1996/08/01/suffix-trees/)\n \t- [Suffix Trees Explained](http://marknelson.us/1996/08/01/suffix-trees/)\n - Questions on\n\n \t- [Codechef](https://www.codechef.com/problems/TWSTR/)\n \t- [Another problem on Codechef](https://www.codechef.com/SEPT13/problems/TMP01)\n \t- [A2oj](http://a2oj.com/Category.jsp?ID=49)\n\nSegment Trees\n---\n - Theory\n\n \t- [Hackerearth](https://www.hackerearth.com/notes/segment-trees-for-beginners/)\n \t- [Codeforces](http://codeforces.com/blog/entry/15890) - Everything about Segment trees by [PrinceOfPersia](http://codeforces.com/profile/PrinceOfPersia)\n \t- [Lazy Propogation](http://se7so.blogspot.in/2012/12/segment-trees-and-lazy-propagation.html)\n - Questions on\n\n \t- [Codechef](https://discuss.codechef.com/tags/segment-tree/)\n \t- [A2oj](http://a2oj.com/Category.jsp?ID=25)\n\nTrees\n---\n - Theory\n\n \t- [Hackerearth](https://www.hackerearth.com/notes/trees/)\n - Questions on\n\n \t- [Hackerrank](https://www.hackerrank.com/domains/data-structures/trees)\n \t- [Codechef](https://discuss.codechef.com/tags/trees/)\n \t- [A2oj](http://a2oj.com/Category.jsp?ID=89)\n \t- [Codeforces](http://codeforces.com/problemset/tags/trees)\n" }, { "path": "human_curated_lists/awesome-lists.md", "content": "## Platforms\n\n- [Node.js](https://github.com/sindresorhus/awesome-nodejs) - JavaScript runtime built on Chrome's V8 JavaScript engine.\n- [Frontend Development](https://github.com/dypsilon/frontend-dev-bookmarks)\n- [iOS](https://github.com/vsouza/awesome-ios) - Mobile operating system for Apple phones and tablets.\n- [Android](https://github.com/JStumpp/awesome-android)\n- [IoT & Hybrid Apps](https://github.com/weblancaster/awesome-IoT-hybrid)\n- [Electron](https://github.com/sindresorhus/awesome-electron) - Cross-platform native desktop apps using JavaScript/HTML/CSS.\n- [Cordova](https://github.com/busterc/awesome-cordova) - JavaScript API for hybrid apps.\n- [React Native](https://github.com/jondot/awesome-react-native)\n- [Xamarin](https://github.com/benoitjadinon/awesome-xamarin) - Mobile app development IDE, testing, and distribution.\n- [Linux](https://github.com/aleksandar-todorovic/awesome-linux)\n\t- [Containers](https://github.com/Friz-zy/awesome-linux-containers)\n- [macOS](https://github.com/iCHAIT/awesome-macOS)\n\t- [Command-Line](https://github.com/herrbischoff/awesome-macos-command-line)\n\t- [Screensavers](https://github.com/agarrharr/awesome-macos-screensavers)\n- [watchOS](https://github.com/yenchenlin/awesome-watchos) - Operating system for the Apple Watch.\n- [JVM](https://github.com/deephacks/awesome-jvm)\n- [Salesforce](https://github.com/mailtoharshit/awesome-salesforce)\n- [Amazon Web Services](https://github.com/donnemartin/awesome-aws)\n- [Windows](https://github.com/Awesome-Windows/Awesome)\n- [IPFS](https://github.com/ipfs/awesome-ipfs) - P2P hypermedia protocol.\n- [Fuse](https://github.com/vinkla/awesome-fuse) - Mobile development tools.\n- [Heroku](https://github.com/ianstormtaylor/awesome-heroku) - Cloud platform as a service.\n- [Raspberry Pi](https://github.com/thibmaek/awesome-raspberry-pi) - Credit card-sized computer aimed at teaching kids programming, but capable of a lot more.\n- [Qt](https://github.com/JesseTG/awesome-qt) - Cross-platform GUI app framework.\n- [WebExtensions](https://github.com/bfred-it/Awesome-WebExtensions) - Cross-browser extension system.\n- [RubyMotion](https://github.com/motion-open-source/awesome-rubymotion) - Write cross-platform native apps for iOS, Android, macOS, tvOS, and watchOS in Ruby.\n- [Smart TV](https://github.com/vitalets/awesome-smart-tv) - Create apps for different TV platforms.\n- [GNOME](https://github.com/Kazhnuz/awesome-gnome) - Simple and distraction-free desktop environment for Linux.\n- [.NET](https://github.com/quozd/awesome-dotnet)\n\t- [Core](https://github.com/thangchung/awesome-dotnet-core)\n\n\n## Programming Languages\n\n- [JavaScript](https://github.com/sorrycc/awesome-javascript)\n\t- [Promises](https://github.com/wbinnssmith/awesome-promises)\n\t- [Standard Style](https://github.com/standard/awesome-standard) - Style guide and linter.\n\t- [Must Watch Talks](https://github.com/bolshchikov/js-must-watch)\n\t- [Tips](https://github.com/loverajoel/jstips)\n\t- [Network Layer](https://github.com/Kikobeats/awesome-network-js)\n\t- [Micro npm Packages](https://github.com/parro-it/awesome-micro-npm-packages)\n\t- [Mad Science npm Packages](https://github.com/feross/awesome-mad-science) - Impossible sounding projects that exist.\n\t- [Maintenance Modules](https://github.com/maxogden/maintenance-modules) - For npm packages.\n\t- [npm](https://github.com/sindresorhus/awesome-npm) - Package manager.\n\t- [AVA](https://github.com/avajs/awesome-ava) - Test runner.\n\t- [ESLint](https://github.com/dustinspecker/awesome-eslint) - Linter.\n\t- [Functional Programming](https://github.com/stoeffel/awesome-fp-js)\n\t- [Observables](https://github.com/sindresorhus/awesome-observables)\n\t- [npm scripts](https://github.com/RyanZim/awesome-npm-scripts) - Task runner.\n- [Swift](https://github.com/matteocrippa/awesome-swift)\n\t- [Education](https://github.com/hsavit1/Awesome-Swift-Education)\n\t- [Playgrounds](https://github.com/uraimo/Awesome-Swift-Playgrounds)\n- [Python](https://github.com/vinta/awesome-python)\n\t- [Asyncio](https://github.com/timofurrer/awesome-asyncio) - Asynchronous I/O in Python 3.\n\t- [Scientific Audio](https://github.com/faroit/awesome-python-scientific-audio) - Scientific research in audio/music.\n- [Rust](https://github.com/rust-unofficial/awesome-rust)\n- [Haskell](https://github.com/krispo/awesome-haskell)\n- [PureScript](https://github.com/passy/awesome-purescript)\n- [Go](https://github.com/avelino/awesome-go)\n- [Scala](https://github.com/lauris/awesome-scala)\n- [Ruby](https://github.com/markets/awesome-ruby)\n- [Clojure](https://github.com/razum2um/awesome-clojure)\n- [ClojureScript](https://github.com/hantuzun/awesome-clojurescript)\n- [Elixir](https://github.com/h4cc/awesome-elixir)\n- [Elm](https://github.com/isRuslan/awesome-elm)\n- [Erlang](https://github.com/drobakowski/awesome-erlang)\n- [Julia](https://github.com/svaksha/Julia.jl)\n- [Lua](https://github.com/LewisJEllis/awesome-lua)\n- [C](https://github.com/aleksandar-todorovic/awesome-c)\n- [C/C++](https://github.com/fffaraz/awesome-cpp)\n- [R](https://github.com/qinwf/awesome-R)\n- [D](https://github.com/zhaopuming/awesome-d)\n- [Common Lisp](https://github.com/CodyReichert/awesome-cl)\n- [Perl](https://github.com/hachiojipm/awesome-perl)\n- [Groovy](https://github.com/kdabir/awesome-groovy)\n- [Dart](https://github.com/yissachar/awesome-dart)\n- [Java](https://github.com/akullpp/awesome-java)\n\t- [RxJava](https://github.com/eleventigers/awesome-rxjava)\n- [Kotlin](https://github.com/KotlinBy/awesome-kotlin)\n- [OCaml](https://github.com/rizo/awesome-ocaml)\n- [ColdFusion](https://github.com/seancoyne/awesome-coldfusion)\n- [Fortran](https://github.com/rabbiabram/awesome-fortran)\n- [PHP](https://github.com/ziadoz/awesome-php)\n\t- [Composer](https://github.com/jakoch/awesome-composer) - Package manager.\n- [Delphi](https://github.com/Fr0sT-Brutal/awesome-delphi)\n- [Assembler](https://github.com/jaspergould/awesome-asm)\n- [AutoHotkey](https://github.com/ahkscript/awesome-AutoHotkey)\n- [AutoIt](https://github.com/J2TeaM/awesome-AutoIt)\n- [Crystal](https://github.com/veelenga/awesome-crystal)\n- [Frege](https://github.com/sfischer13/awesome-frege) - Haskell for the JVM.\n- [CMake](https://github.com/onqtam/awesome-cmake) - Build, test, and package software.\n- [ActionScript 3](https://github.com/robinrodricks/awesome-actionscript3) - Object-oriented language targeting Adobe AIR.\n- [Eta](https://github.com/sfischer13/awesome-eta) - Functional programming language for the JVM.\n- [Idris](https://github.com/joaomilho/awesome-idris) - General purpose pure functional programming language with dependent types influenced by Haskell and ML.\n\n\n## Front-End Development\n\n- [ES6 Tools](https://github.com/addyosmani/es6-tools)\n- [Web Performance Optimization](https://github.com/davidsonfellipe/awesome-wpo)\n- [Web Tools](https://github.com/lvwzhen/tools)\n- [CSS](https://github.com/awesome-css-group/awesome-css)\n\t- [Critical-Path Tools](https://github.com/addyosmani/critical-path-css-tools)\n\t- [Scalability](https://github.com/davidtheclark/scalable-css-reading-list)\n\t- [Must-Watch Talks](https://github.com/AllThingsSmitty/must-watch-css)\n\t- [Protips](https://github.com/AllThingsSmitty/css-protips)\n- [React](https://github.com/enaqx/awesome-react) - App framework.\n\t- [Relay](https://github.com/expede/awesome-relay) - Framework for building data-driven React apps.\n- [Web Components](https://github.com/mateusortiz/webcomponents-the-right-way)\n- [Polymer](https://github.com/Granze/awesome-polymer) - JavaScript library to develop Web Components.\n- [Angular](https://github.com/gdi2290/awesome-angular) - App framework.\n- [Backbone](https://github.com/sadcitizen/awesome-backbone) - App framework.\n- [HTML5](https://github.com/diegocard/awesome-html5) - Markup language used for websites & web apps.\n- [SVG](https://github.com/willianjusten/awesome-svg) - XML-based vector image format.\n- [Canvas](https://github.com/raphamorim/awesome-canvas)\n- [KnockoutJS](https://github.com/dnbard/awesome-knockout)\n- [Dojo Toolkit](https://github.com/petk/awesome-dojo)\n- [Inspiration](https://github.com/NoahBuscher/Inspire)\n- [Ember](https://github.com/nmec/awesome-ember) - App framework.\n- [Android UI](https://github.com/wasabeef/awesome-android-ui)\n- [iOS UI](https://github.com/cjwirth/awesome-ios-ui)\n- [Meteor](https://github.com/Urigo/awesome-meteor)\n- [BEM](https://github.com/sturobson/BEM-resources)\n- [Flexbox](https://github.com/afonsopacifer/awesome-flexbox)\n- [Web Typography](https://github.com/deanhume/typography)\n- [Web Accessibility](https://github.com/brunopulis/awesome-a11y)\n- [Material Design](https://github.com/sachin1092/awesome-material)\n- [D3](https://github.com/wbkd/awesome-d3) - Library for producing dynamic, interactive data visualizations.\n- [Emails](https://github.com/jonathandion/awesome-emails)\n- [jQuery](https://github.com/petk/awesome-jquery) - Easy to use JavaScript library for DOM manipulation.\n\t- [Tips](https://github.com/AllThingsSmitty/jquery-tips-everyone-should-know)\n- [Web Audio](https://github.com/notthetup/awesome-webaudio)\n- [Offline-First](https://github.com/pazguille/offline-first)\n- [Static Website Services](https://github.com/agarrharr/awesome-static-website-services)\n- [A-Frame VR](https://github.com/aframevr/awesome-aframe) - Virtual reality for web browsers.\n- [Cycle.js](https://github.com/cyclejs-community/awesome-cyclejs) - Functional and reactive JavaScript framework.\n- [Text Editing](https://github.com/dok/awesome-text-editing)\n- [Motion UI Design](https://github.com/fliptheweb/motion-ui-design)\n- [Vue.js](https://github.com/vuejs/awesome-vue) - App framework.\n- [Marionette.js](https://github.com/sadcitizen/awesome-marionette) - App framework.\n- [Aurelia](https://github.com/behzad888/awesome-aurelia) - App framework.\n- [Charting](https://github.com/zingchart/awesome-charting)\n- [Ionic Framework 2](https://github.com/candelibas/awesome-ionic)\n- [Chrome DevTools](https://github.com/ChromeDevTools/awesome-chrome-devtools)\n- [PostCSS](https://github.com/jdrgomes/awesome-postcss) - CSS tool.\n- [Draft.js](https://github.com/nikgraf/awesome-draft-js) - Rich text editor framework for React.\n- [Service Workers](https://github.com/TalAter/awesome-service-workers)\n- [Progressive Web Apps](https://github.com/TalAter/awesome-progressive-web-apps)\n- [choo](https://github.com/choojs/awesome-choo) - App framework.\n- [Redux](https://github.com/brillout/awesome-redux) - State container for JavaScript apps.\n- [webpack](https://github.com/webpack-contrib/awesome-webpack) - Module bundler.\n- [Browserify](https://github.com/browserify/awesome-browserify) - Module bundler.\n- [Sass](https://github.com/Famolus/awesome-sass) - CSS preprocessor.\n- [Ant Design](https://github.com/websemantics/awesome-ant-design) - Enterprise-class UI design language.\n- [Less](https://github.com/LucasBassetti/awesome-less) - CSS preprocessor.\n- [WebGL](https://github.com/sjfricke/awesome-webgl) - JavaScript API for rendering 3D graphics.\n- [Preact](https://github.com/ooade/awesome-preact) - App framework.\n- [Progressive Enhancement](https://github.com/jbmoelker/progressive-enhancement-resources)\n- [Next.js](https://github.com/unicodeveloper/awesome-nextjs) - Framework for server-rendered React apps.\n- [Hyperapp](https://github.com/hyperapp/awesome-hyperapp) - Tiny JavaScript library for building web apps.\n\n\n## Back-End Development\n\n- [Django](https://github.com/rosarior/awesome-django)\n- [Flask](https://github.com/humiaozuzu/awesome-flask)\n- [Docker](https://github.com/veggiemonk/awesome-docker)\n- [Vagrant](https://github.com/iJackUA/awesome-vagrant)\n- [Pyramid](https://github.com/uralbash/awesome-pyramid)\n- [Play1 Framework](https://github.com/PerfectCarl/awesome-play1)\n- [CakePHP](https://github.com/friendsofcake/awesome-cakephp) - PHP framework.\n- [Symfony](https://github.com/sitepoint-editors/awesome-symfony)\n\t- [Education](https://github.com/pehapkari/awesome-symfony-education)\n- [Laravel](https://github.com/chiraggude/awesome-laravel) - PHP framework.\n\t- [Education](https://github.com/fukuball/Awesome-Laravel-Education)\n- [Rails](https://github.com/ekremkaraca/awesome-rails) - Web app framework for Ruby.\n\t- [Gems](https://github.com/hothero/awesome-rails-gem) - Packages.\n- [Phalcon](https://github.com/phalcon/awesome-phalcon)\n- [Useful `.htaccess` Snippets](https://github.com/phanan/htaccess)\n- [nginx](https://github.com/fcambus/nginx-resources) - Web server.\n- [Dropwizard](https://github.com/stve/awesome-dropwizard)\n- [Kubernetes](https://github.com/ramitsurana/awesome-kubernetes)\n- [Lumen](https://github.com/unicodeveloper/awesome-lumen)\n- [Serverless Framework](https://github.com/pmuens/awesome-serverless)\n- [Apache Wicket](https://github.com/PhantomYdn/awesome-wicket) - Java web app framework.\n- [Vert.x](https://github.com/vert-x3/vertx-awesome) - Toolkit for building reactive apps on the JVM.\n- [Terraform](https://github.com/shuaibiyy/awesome-terraform) - Tool for building, changing, and versioning infrastructure.\n\n\n## Computer Science\n\n- [University Courses](https://github.com/prakhar1989/awesome-courses)\n- [Data Science](https://github.com/bulutyazilim/awesome-datascience)\n\t- [Tutorials](https://github.com/siboehm/awesome-learn-datascience)\n- [Machine Learning](https://github.com/josephmisiti/awesome-machine-learning)\n\t- [Tutorials](https://github.com/ujjwalkarn/Machine-Learning-Tutorials)\n\t- [ML with Ruby](https://github.com/arbox/machine-learning-with-ruby) - Learning, implementing, and applying Machine Learning using Ruby.\n\t- [Core ML Models](https://github.com/likedan/Awesome-CoreML-Models) - Models for Apple's machine learning framework.\n- [Speech and Natural Language Processing](https://github.com/edobashira/speech-language-processing)\n\t- [Spanish](https://github.com/dav009/awesome-spanish-nlp)\n\t- [NLP with Ruby](https://github.com/arbox/nlp-with-ruby)\n- [Linguistics](https://github.com/theimpossibleastronaut/awesome-linguistics)\n- [Cryptography](https://github.com/sobolevn/awesome-cryptography)\n- [Computer Vision](https://github.com/jbhuang0604/awesome-computer-vision)\n- [Deep Learning](https://github.com/ChristosChristofidis/awesome-deep-learning) - Neural networks.\n\t- [TensorFlow](https://github.com/jtoy/awesome-tensorflow) - Library for machine intelligence.\n\t- [Papers](https://github.com/terryum/awesome-deep-learning-papers) - The most cited deep learning papers.\n\t- [Education](https://github.com/guillaume-chevalier/awesome-deep-learning-resources)\n- [Deep Vision](https://github.com/kjw0612/awesome-deep-vision)\n- [Open Source Society University](https://github.com/ossu/computer-science)\n- [Functional Programming](https://github.com/lucasviola/awesome-functional-programming)\n- [Static Analysis & Code Quality](https://github.com/mre/awesome-static-analysis)\n- [Information Retrieval](https://github.com/harpribot/awesome-information-retrieval) - Learn to develop your own search engine.\n\n\n## Big Data\n\n- [Big Data](https://github.com/onurakpolat/awesome-bigdata)\n- [Public Datasets](https://github.com/awesomedata/awesome-public-datasets)\n- [Hadoop](https://github.com/youngwookim/awesome-hadoop) - Framework for distributed storage and processing of very large data sets.\n- [Data Engineering](https://github.com/igorbarinov/awesome-data-engineering)\n- [Streaming](https://github.com/manuzhang/awesome-streaming)\n- [Apache Spark](https://github.com/awesome-spark/awesome-spark) - Unified engine for large-scale data processing.\n\n\n## Theory\n\n- [Papers We Love](https://github.com/papers-we-love/papers-we-love)\n- [Talks](https://github.com/JanVanRyswyck/awesome-talks)\n- [Algorithms](https://github.com/tayllan/awesome-algorithms)\n- [Algorithm Visualizations](https://github.com/enjalot/algovis)\n- [Artificial Intelligence](https://github.com/owainlewis/awesome-artificial-intelligence)\n- [Search Engine Optimization](https://github.com/marcobiedermann/search-engine-optimization)\n- [Competitive Programming](https://github.com/lnishan/awesome-competitive-programming)\n- [Math](https://github.com/rossant/awesome-math)\n- [Recursion Schemes](https://github.com/passy/awesome-recursion-schemes) - Traversing nested data structures.\n\n\n## Books\n\n- [Free Programming Books](https://github.com/EbookFoundation/free-programming-books)\n- [Free Software Testing Books](https://github.com/ligurio/awesome-software-quality)\n- [Go Books](https://github.com/dariubs/GoBooks)\n- [R Books](https://github.com/RomanTsegelskyi/rbooks)\n- [Mind Expanding Books](https://github.com/hackerkid/Mind-Expanding-Books)\n- [Book Authoring](https://github.com/TalAter/awesome-book-authoring)\n- [Elixir Books](https://github.com/sger/ElixirBooks)\n\n\n## Editors\n\n- [Sublime Text](https://github.com/dreikanter/sublime-bookmarks)\n- [Vim](https://github.com/mhinz/vim-galore)\n- [Emacs](https://github.com/emacs-tw/awesome-emacs)\n- [Atom](https://github.com/mehcode/awesome-atom) - Open-source and hackable text editor.\n- [Visual Studio Code](https://github.com/viatsko/awesome-vscode) - Cross-platform open-source text editor.\n\n\n## Gaming\n\n- [Game Development](https://github.com/ellisonleao/magictools)\n- [Game Talks](https://github.com/hzoo/awesome-gametalks)\n- [Godot](https://github.com/Calinou/awesome-godot) - Game engine.\n- [Open Source Games](https://github.com/leereilly/games)\n- [Unity](https://github.com/RyanNielson/awesome-unity) - Game engine.\n- [Chess](https://github.com/hkirat/awesome-chess)\n- [LÖVE](https://github.com/love2d-community/awesome-love2d) - Game engine.\n- [PICO-8](https://github.com/felipebueno/awesome-PICO-8) - Fantasy console.\n- [Game Boy Development](https://github.com/avivace/awesome-gbdev)\n- [Construct 2](https://github.com/armaldio/awesome-construct) - Game engine.\n- [Gideros](https://github.com/stetso/awesome-gideros) - Game engine.\n\n\n## Development Environment\n\n- [Quick Look Plugins](https://github.com/sindresorhus/quick-look-plugins) - For macOS.\n- [Dev Env](https://github.com/jondot/awesome-devenv)\n- [Dotfiles](https://github.com/webpro/awesome-dotfiles)\n- [Shell](https://github.com/alebcay/awesome-shell)\n- [Fish](https://github.com/fisherman/awesome-fish-shell) - User-friendly shell.\n- [Command-Line Apps](https://github.com/agarrharr/awesome-cli-apps)\n- [ZSH Plugins](https://github.com/unixorn/awesome-zsh-plugins)\n- [GitHub](https://github.com/phillipadsmith/awesome-github) - Hosting service for Git repositories.\n\t- [Browser Extensions](https://github.com/stefanbuck/awesome-browser-extensions-for-github)\n\t- [Cheat Sheet](https://github.com/tiimgreen/github-cheat-sheet)\n- [Git Cheat Sheet & Git Flow](https://github.com/arslanbilal/git-cheat-sheet)\n- [Git Tips](https://github.com/git-tips/tips)\n- [Git Add-ons](https://github.com/stevemao/awesome-git-addons) - Enhance the `git` CLI.\n- [SSH](https://github.com/moul/awesome-ssh)\n- [FOSS for Developers](https://github.com/tvvocold/FOSS-for-Dev)\n- [Hyper](https://github.com/bnb/awesome-hyper) - Cross-platform terminal app built on web technologies.\n- [PowerShell](https://github.com/janikvonrotz/awesome-powershell) - Cross-platform object-oriented shell.\n- [Alfred Workflows](https://github.com/derimagia/awesome-alfred-workflows) - Productivity app for macOS.\n- [Terminals Are Sexy](https://github.com/k4m4/terminals-are-sexy)\n\n\n## Entertainment\n\n- [Science Fiction](https://github.com/sindresorhus/awesome-scifi) - Scifi.\n- [Fantasy](https://github.com/RichardLitt/awesome-fantasy)\n- [Podcasts](https://github.com/guipdutra/awesome-geek-podcasts)\n- [Email Newsletters](https://github.com/vredniy/awesome-newsletters)\n- [IT Quotes](https://github.com/victorlaerte/awesome-it-quotes)\n\n\n## Databases\n\n- [Database](https://github.com/numetriclabz/awesome-db)\n- [MySQL](https://github.com/shlomi-noach/awesome-mysql/blob/gh-pages/index.md)\n- [SQLAlchemy](https://github.com/dahlia/awesome-sqlalchemy)\n- [InfluxDB](https://github.com/mark-rushakoff/awesome-influxdb)\n- [Neo4j](https://github.com/neueda/awesome-neo4j)\n- [MongoDB](https://github.com/ramnes/awesome-mongodb) - NoSQL database.\n- [RethinkDB](https://github.com/d3viant0ne/awesome-rethinkdb)\n- [TinkerPop](https://github.com/mohataher/awesome-tinkerpop) - Graph computing framework.\n- [PostgreSQL](https://github.com/dhamaniasad/awesome-postgres) - Object-relational database.\n- [CouchDB](https://github.com/quangv/awesome-couchdb) - Document-oriented NoSQL database.\n- [HBase](https://github.com/rayokota/awesome-hbase) - Distributed, scalable, big data store.\n\n\n## Media\n\n- [Creative Commons Media](https://github.com/shime/creative-commons-media)\n- [Fonts](https://github.com/brabadu/awesome-fonts)\n- [Codeface](https://github.com/chrissimpkins/codeface) - Text editor fonts.\n- [Stock Resources](https://github.com/neutraltone/awesome-stock-resources)\n- [GIF](https://github.com/davisonio/awesome-gif) - Image format known for animated images.\n- [Music](https://github.com/ciconia/awesome-music)\n- [Open Source Documents](https://github.com/hubtee/awesome-opensource-documents)\n- [Audio Visualization](https://github.com/willianjusten/awesome-audio-visualization)\n- [Broadcasting](https://github.com/ebu/awesome-broadcasting)\n- [Pixel Art](https://github.com/Siilwyn/awesome-pixel-art) - Pixel-level digital art.\n\n\n## Learn\n\n- [CLI Workshoppers](https://github.com/therebelrobot/awesome-workshopper) - Interactive tutorials.\n- [Learn to Program](https://github.com/karlhorky/learn-to-program)\n- [Speaking](https://github.com/matteofigus/awesome-speaking)\n- [Tech Videos](https://github.com/lucasviola/awesome-tech-videos)\n- [Dive into Machine Learning](https://github.com/hangtwenty/dive-into-machine-learning)\n- [Computer History](https://github.com/watson/awesome-computer-history)\n- [Programming for Kids](https://github.com/HollyAdele/awesome-programming-for-kids)\n- [Educational Games](https://github.com/yrgo/awesome-eg) - Learn while playing.\n- [JavaScript Learning](https://github.com/micromata/awesome-javascript-learning)\n\n\n## Security\n\n- [Application Security](https://github.com/paragonie/awesome-appsec)\n- [Security](https://github.com/sbilly/awesome-security)\n- [CTF](https://github.com/apsdehal/awesome-ctf) - Capture The Flag.\n- [Malware Analysis](https://github.com/rshipp/awesome-malware-analysis)\n- [Android Security](https://github.com/ashishb/android-security-awesome)\n- [Hacking](https://github.com/carpedm20/awesome-hacking)\n- [Honeypots](https://github.com/paralax/awesome-honeypots) - Deception trap, designed to entice an attacker into attempting to compromise the information systems in an organization.\n- [Incident Response](https://github.com/meirwah/awesome-incident-response)\n- [Vehicle Security and Car Hacking](https://github.com/jaredthecoder/awesome-vehicle-security)\n- [Web Security](https://github.com/qazbnm456/awesome-web-security) - Security of web apps & services.\n- [Lockpicking](https://github.com/meitar/awesome-lockpicking) - The art of unlocking a lock by manipulating its components without the key.\n\n\n## Content Management Systems\n\n- [Umbraco](https://github.com/leekelleher/awesome-umbraco)\n- [Refinery CMS](https://github.com/refinerycms-contrib/awesome-refinerycms) - Ruby on Rails CMS.\n- [Wagtail](https://github.com/springload/awesome-wagtail) - Django CMS focused on flexibility and user experience.\n- [Textpattern](https://github.com/drmonkeyninja/awesome-textpattern) - Lightweight PHP-based CMS.\n- [Drupal](https://github.com/nirgn975/awesome-drupal) - Extensible PHP-based CMS.\n- [Craft CMS](https://github.com/craftcms/awesome) - Content-first CMS.\n\n\n## Hardware\n\n- [Robotics](https://github.com/Kiloreux/awesome-robotics)\n- [Internet of Things](https://github.com/HQarroum/awesome-iot)\n- [Electronics](https://github.com/monostable/awesome-electronics) - For electronic engineers and hobbyists.\n- [Bluetooth Beacons](https://github.com/beaconinside/awesome-beacon)\n- [Electric Guitar Specifications](https://github.com/gitfrage/guitarspecs) - Checklist for building your own electric guitar.\n\n\n## Business\n\n- [Open Companies](https://github.com/opencompany/awesome-open-company)\n- [Places to Post Your Startup](https://github.com/mmccaff/PlacesToPostYourStartup)\n- [OKR Methodology](https://github.com/domenicosolazzo/awesome-okr) - Goal setting & communication best practices.\n- [Leading and Managing](https://github.com/LappleApple/awesome-leading-and-managing) - Leading people and being a manager in a technology company/environment.\n- [Indie](https://github.com/mezod/awesome-indie) - Independent developer businesses.\n\n\n## Work\n\n- [Slack](https://github.com/matiassingers/awesome-slack) - Team collaboration.\n\t- [Communities](https://github.com/filipelinhares/awesome-slack)\n- [Remote Jobs](https://github.com/lukasz-madon/awesome-remote-job)\n- [Productivity](https://github.com/jyguyomarch/awesome-productivity)\n- [Niche Job Boards](https://github.com/tramcar/awesome-job-boards)\n- [Programming Interviews](https://github.com/MaximAbramchuck/awesome-interview-questions)\n\n\n## Networking\n\n- [Software-Defined Networking](https://github.com/sdnds-tw/awesome-sdn)\n- [Network Analysis](https://github.com/briatte/awesome-network-analysis)\n- [PCAPTools](https://github.com/caesar0301/awesome-pcaptools)\n\n## Decentralized Systems\n\n- [Bitcoin](https://github.com/igorbarinov/awesome-bitcoin) - Bitcoin services and tools for software developers.\n- [Ripple](https://github.com/vhpoet/awesome-ripple) - Open source distributed settlement network.\n- [Non-Financial Blockchain](https://github.com/machinomy/awesome-non-financial-blockchain) - Non-financial blockchain applications.\n- [Mastodon](https://github.com/tleb/awesome-mastodon) - Open source decentralized microblogging network.\n\n## Miscellaneous\n\n- [JSON](https://github.com/burningtree/awesome-json) - Text based data interchange format.\n\t- [GeoJSON](https://github.com/tmcw/awesome-geojson)\n\t- [Datasets](https://github.com/jdorfman/awesome-json-datasets)\n- [Discounts for Student Developers](https://github.com/AchoArnold/discount-for-student-dev)\n- [Conferences](https://github.com/RichardLitt/awesome-conferences)\n- [Sysadmin](https://github.com/n1trux/awesome-sysadmin)\n- [Radio](https://github.com/kyleterry/awesome-radio)\n- [Awesome](https://github.com/sindresorhus/awesome) - Recursion illustrated.\n- [Analytics](https://github.com/onurakpolat/awesome-analytics)\n- [REST](https://github.com/marmelab/awesome-rest)\n- [Selenium](https://github.com/christian-bromann/awesome-selenium)\n- [Appium](https://github.com/SrinivasanTarget/awesome-appium) - Test automation tool for apps.\n- [Continuous Integration and Continuous Delivery](https://github.com/ciandcd/awesome-ciandcd)\n- [Services Engineering](https://github.com/mmcgrana/services-engineering)\n- [Free for Developers](https://github.com/ripienaar/free-for-dev)\n- [Answers](https://github.com/cyberglot/awesome-answers) - Stack Overflow, Quora, etc.\n- [Sketch](https://github.com/diessica/awesome-sketch) - Design app for macOS.\n- [Boilerplate Projects](https://github.com/melvin0008/awesome-projects-boilerplates)\n- [Readme](https://github.com/matiassingers/awesome-readme)\n- [Tools](https://github.com/cjbarber/ToolsOfTheTrade)\n- [Styleguides](https://github.com/RichardLitt/awesome-styleguides)\n- [Design and Development Guides](https://github.com/NARKOZ/guides)\n- [Software Engineering Blogs](https://github.com/kilimchoi/engineering-blogs)\n- [Self Hosted](https://github.com/Kickball/awesome-selfhosted)\n- [FOSS Production Apps](https://github.com/jwaterfaucett/awesome-foss-apps)\n- [Gulp](https://github.com/alferov/awesome-gulp) - Task runner.\n- [AMA](https://github.com/sindresorhus/amas) - Ask Me Anything.\n\t- [Answers](https://github.com/stoeffel/awesome-ama-answers)\n- [Open Source Photography](https://github.com/ibaaj/awesome-OpenSourcePhotography)\n- [OpenGL](https://github.com/eug/awesome-opengl) - Cross-platform API for rendering 2D and 3D graphics.\n- [GraphQL](https://github.com/chentsulin/awesome-graphql)\n- [Transit](https://github.com/CUTR-at-USF/awesome-transit)\n- [Research Tools](https://github.com/emptymalei/awesome-research)\n- [Data Visualization](https://github.com/fasouto/awesome-dataviz)\n- [Social Media Share Links](https://github.com/vinkla/shareable-links)\n- [Microservices](https://github.com/mfornos/awesome-microservices)\n- [Unicode](https://github.com/jagracey/Awesome-Unicode) - Unicode standards, quirks, packages and resources.\n\t- [Code Points](https://github.com/Codepoints/awesome-codepoints)\n- [Beginner-Friendly Projects](https://github.com/MunGell/awesome-for-beginners)\n- [Katas](https://github.com/gamontal/awesome-katas)\n- [Tools for Activism](https://github.com/drewrwilson/toolsforactivism)\n- [Citizen Science](https://github.com/dylanrees/citizen-science) - For community-based and non-institutional scientists.\n- [TAP](https://github.com/sindresorhus/awesome-tap) - Test Anything Protocol.\n- [MQTT](https://github.com/hobbyquaker/awesome-mqtt) - \"Internet of Things\" connectivity protocol.\n- [Hacking Spots](https://github.com/diasdavid/awesome-hacking-spots)\n- [For Girls](https://github.com/cristianoliveira/awesome4girls)\n- [Vorpal](https://github.com/vorpaljs/awesome-vorpal) - Node.js CLI framework.\n- [Vulkan](https://github.com/vinjn/awesome-vulkan) - Low-overhead, cross-platform 3D graphics and compute API.\n- [LaTeX](https://github.com/egeerardyn/awesome-LaTeX) - Typesetting language.\n- [Economics](https://github.com/antontarasenko/awesome-economics) - An economist's starter kit.\n- [Funny Markov Chains](https://github.com/sublimino/awesome-funny-markov)\n- [Bioinformatics](https://github.com/danielecook/Awesome-Bioinformatics)\n- [Colorful](https://github.com/Siddharth11/Colorful) - Choose your next color scheme.\n- [Steam](https://github.com/scholtzm/awesome-steam) - Digital distribution platform.\n- [Bots](https://github.com/hackerkid/bots) - Building bots.\n- [Site Reliability Engineering](https://github.com/dastergon/awesome-sre)\n- [Empathy in Engineering](https://github.com/KimberlyMunoz/empathy-in-engineering) - Building and promoting more compassionate engineering cultures.\n- [DTrace](https://github.com/xen0l/awesome-dtrace) - Dynamic tracing framework.\n- [Userscripts](https://github.com/brunocvcunha/awesome-userscripts) - Enhance your browsing experience.\n- [Pokémon](https://github.com/tobiasbueschel/awesome-pokemon) - Pokémon and Pokémon GO.\n- [ChatOps](https://github.com/exAspArk/awesome-chatops) - Managing technical and business operations through a chat.\n- [Falsehood](https://github.com/kdeldycke/awesome-falsehood) - Falsehoods programmers believe in.\n- [Domain-Driven Design](https://github.com/heynickc/awesome-ddd) - Software development approach for complex needs by connecting the implementation to an evolving model.\n- [Quantified Self](https://github.com/woop/awesome-quantified-self) - Self-tracking through technology.\n- [SaltStack](https://github.com/hbokh/awesome-saltstack) - Python-based config management system.\n- [Web Design](https://github.com/nicolesaidy/awesome-web-design) - For digital designers.\n- [JMeter](https://github.com/aliesbelik/awesome-jmeter) - Load testing and performance measurement tool.\n- [Creative Coding](https://github.com/terkelg/awesome-creative-coding) - Programming something expressive instead of something functional.\n- [No-Login Web Apps](https://github.com/aviaryan/awesome-no-login-web-apps) - Web apps that work without login.\n- [Testing](https://github.com/TheJambo/awesome-testing) - Software testing.\n- [Free Software](https://github.com/johnjago/awesome-free-software) - Free as in freedom.\n- [Framer](https://github.com/podo/awesome-framer) - Prototyping interactive UI designs.\n- [Markdown](https://github.com/BubuAnabelas/awesome-markdown) - Markup language.\n- [Dev Fun](https://github.com/mislavcimpersak/awesome-dev-fun) - Funny developer projects.\n- [Events in the Netherlands](https://github.com/awkward/awesome-netherlands-events) - Tech-related events in the Netherlands.\n- [Healthcare](https://github.com/kakoni/awesome-healthcare) - Open source healthcare software for facilities, providers, developers, policy experts, and researchers.\n- [Magento 2](https://github.com/DavidLambauer/awesome-magento2) - Open Source eCommerce built with PHP.\n- [TikZ](https://github.com/xiaohanyu/awesome-tikz) - Graph drawing packages for TeX/LaTeX/ConTeXt.\n- [Neuroscience](https://github.com/analyticalmonk/awesome-neuroscience) - Study of the nervous system and brain.\n- [Ad-Free](https://github.com/johnjago/awesome-ad-free) - Ad-free alternatives.\n- [Esolangs](https://github.com/angrykoala/awesome-esolangs) - Programming languages designed for experimentation or as jokes rather than actual use.\n- [Prometheus](https://github.com/roaldnefs/awesome-prometheus) - Open-source monitoring system.\n- [Homematic](https://github.com/hobbyquaker/awesome-homematic) - Smart home devices.\n- [Ledger](https://github.com/sfischer13/awesome-ledger) - Double-entry accounting on the command-line.\n- [Uncopyright](https://github.com/johnjago/awesome-uncopyright) - Public domain works.\n- [Crypto Currency Tools & Algorithms](https://github.com/kennethreitz/awesome-coins) — Digital currency where encryption is used to regulate the generation of units and verify transfers.\n- [Diversity](https://github.com/folkswhocode/awesome-diversity) - Creating a more inclusive and diverse tech community.\n- [Open Source Supporters](https://github.com/zachflower/awesome-open-source-supporters) - Companies that offer their tools and services for free to open source projects.\n- [Design Principles](https://github.com/robinstickel/awesome-design-principles) - Create better and more consistent designs and experiences.\n- [Visual Regression Testing](https://github.com/mojoaxel/awesome-regression-testing) - Ensures changes did not break the functionality or style.\n- [Theravada](https://github.com/johnjago/awesome-theravada) - Teachings from the Theravada Buddhist tradition.\n- [inspectIT](https://github.com/inspectit-labs/awesome-inspectit) - Open source Java app performance management tool.\n\n\n## License\n\n[![CC0](http://mirrors.creativecommons.org/presskit/buttons/88x31/svg/cc-zero.svg)](https://creativecommons.org/publicdomain/zero/1.0/)\n\nTo the extent possible under law, [Sindre Sorhus](https://sindresorhus.com) has waived all copyright and related or neighboring rights to this work.\n" }, { "path": "human_curated_lists/best-student-discount-services.md", "content": "# Collective discounts\n\n* [International Student Identity Card](https://www.isic.org/): Any full-time student over 12 years old qualifies for 42,000 discounts in 130 countries\n\n* [GitHub Student Developer Pack](https://education.github.com/pack): Discounts on several software products offered through Github\n\n* [Student Advantage Card](http://www.studentadvantage.com/discountcard/): Save money on over 100 national brands on a variety of products\n\n* [AWS Educate](https://www.awseducate.com/microsite/CommunitiesEngageHome): credits to access AWS services for free. Free labs on services such as EC2, S3, and others\n\n* [Microsoft Education](https://www.microsoft.com/en-in/education/students/default.aspx): Free Micrsoft Office 365 and other discounts on MS products\n\n* [Amazon Prime Student](https://www.amazon.com/Amazon-Student/b?node=668781011): a six-month trial that includes Free Two-Day Shipping, unlimited streaming of Amazon Prime movies and TV shows, unlimited photo storage with Amazon Prime Photos, 20% off pre-order and new release video games, exclusive deals and savings, and more! 50% off after the six-month trial period\n\n* [Microsoft Imagine](https://imagine.microsoft.com/en-us/Catalog/Product/99): pack of Microsoft cloud services like Azure, for deploying projects, free for students.\n\n# Electronic devices\n\n* [Apple](http://store.apple.com/us/browse/campaigns/education_pricing): Students and educators save 5% off most purchases; save up to $200 on a new Mac or a new iPad with Apple’s Education pricing.\n\n* [Microsoft](https://www.microsoft.com/en-us/education/students/default.aspx): Save up to $194 on a Surface Pro 3, get 10% off accessories, and get special pricing on software.\n\n* [Adobe](https://www.apple.com/us-hed/shop): Full-time students can receive discounts on software like 60% off Creative Cloud\n\n* [Dell](http://www.dell.com/learn/us/en/6099/campaigns/welcome-to-dell-university): offers discounts on laptops, desktops, and more\n\n* [Lenovo](): Lenovo has an Academic Purchase Program that offers student discounts on laptops, tablets, and desktop computers. Discounts vary depending on your school.\n\n* [Sony](http://store.sony.com/gsi/webstore/WFS/SNYNA-SNYUS-Site/en_US/-/USD/ViewPurchasePrograms-EDULandingPage): Through Sony Student Store membership, get 10% off merchandise\n\n# Productivity apps\n\n* [Evernote](https://evernote.com/students/): One year of the premium plan for 50% off\n\n* [Microsoft Office 365](https://www.microsoft.com/en-in/education/students/default.aspx): Free for students\n\n# Software\n\n### Version control\n\n* [Tower](http://www.git-tower.com/buy) - Version control with git. Students get a 50% discount\n\n* [GitKraken PRO](https://www.gitkraken.com/github-student-developer-pack) - Free for 1 year via [GitHub Student Developer Pack](https://education.github.com/pack)\n\n### Design and modeling tools\n\n * [Sketch](https://backend.bohemiancoding.com/store/edu/) - 50% off on an educational license\n\n * [Axure RP](http://www.axure.com/edu): Free educational license of Axure RP Pro\n\n * [Vertabelo](https://my.vertabelo.com/sign-up/create-academic): Free academic accounts for students\n\n * [Framer](http://framerjs.com/pricing/): 50% off on an educational license\n\n * [Lucidchart](https://www.lucidchart.com/pages/usecase/education): Free professional software for DFDs,flowcharts, organisational \tcharts, website wireframes, UML designs, mind maps, software prototypes, and many other diagram types (Use learner college student \t id to get unlimited access)\n### Game Development Tools\n\n * [Unity3D](https://unity3d.com/education): Students are offered a yearly license for $100 USD\n\n * [Unreal Game Engine](https://www.unrealengine.com/education): Free through [Github Student Developer Pack](https://education.github.com/pack)\n\n## IDE and Code Editing\n\n * [Intel® Parallel Studio XE 2015](https://software.intel.com/en-us/qualify-for-free-software/student): Free for students\n\n * [Xamarin IDE](http://xamarin.com/student): Free for students\n\n * [Bootstrap Studio](https://bootstrapstudio.io/pages/student-license): Free for students\n\n * [JetBrains Pack](https://www.jetbrains.com/student/): Free professional IDEs for C/C++/Python/Java/JS/PHP/Ruby/etc for students\n\n### 3D Animation and Modeling Software\n\n * [Autodesk Entertainment Creation Suite Ultimate](http://www.autodesk.com/education/free-software/entertainment-creation-suite-ultimate): 3-Year free License for students\n\n### Visual Analytics\n\n * [CartoDB](https://cartodb.com/solutions/education-and-research/): Additional space & features for free accounts or 20% discount on paid accounts\n\n * [Tableau Desktop](https://www.tableau.com/academic/students): One Year free Professional License for Students\n\n * [SAS University Edition](http://www.sas.com/en_us/software/university-edition.html): Free for students\n\n# Developer Services\n\n* [HackHands](https://hackhands.com/education/): $25 in platform credit to students via [Github Student Developer Pack](https://education.github.com/pack)\n\n* [Amazon Web Services](http://www.awseducate.com/application) - free by joining AWS Educate today\n\n* [Send Grid](https://sendgrid.com/partner/github-education) - 15K free emails/month (normally limited to 200 free emails/day) via [Github Student Developer Pack](https://education.github.com/pack)\n\n* [Adobe Creative Cloud](http://www.adobe.com/creativecloud/buy/students.html) - 60% off for students\n\n* [Domino Cloud Environment](https://www.dominodatalab.com/domino-for-good/for-students/) - free computational power to work on data science projects\n\n# Music\n\n* [Spotify](https://www.spotify.com/us/student/): $4.99/month for students\n\n* [Apple Music](https://support.apple.com/en-us/HT205928): Discount for 4 years\n\n* [Cascio Interstate Music](http://www.interstatemusic.com/): 10% off orders over $69\n\n# Shipping\n\n* [FedEx](http://www.fedex.com/kr_english/about/local/currentattractions/sdc.html): Discount of 30% off a document with FedEx Envelop/Pak and 20% off a package with FedEx IP service\n\n# Insurance\n\n* [StateFarm](https://www.statefarm.com/insurance/auto/discounts/): 25% off on keeping good grades\n\n* [Geico](https://www.geico.com/save/discounts/student-discounts/): Students under 25 with good grades can get up to a 15% discount\n\n# Newspaper Subscription\n\n* [Wall Street Journal](https://buy.wsj.com/shopandbuy/order/subscribe.jsp?trackCode=aaqntppp): $49 a year\n\n* [NewYork Times](https://www.nytimes.com/subscriptions/edu/lp8LQFK.html): $1 a week\n\n* [Economist](https://subscription.economist.com/DE/EngCore/Ecom/Default): Discount varies on plan\n\n# Hotel\n\n* [Planet Hollywood](https://www.caesars.com/planet-hollywood): 15% off on rooms\n\n* [Harrah's Laughlin](https://www.totalrewards.com/reserve/): 15% off on bookings\n\n# Travel\n\n* [Eurail](http://www.eurail.com/eurail-passes/deals-discounts/youth-discounts): 35% off the regular Adult Fare for students under 25\n\n* [Amtrak](http://www.amtrak.com/student-discount): 10% off on train and bus service\n\n* [Budget Truck Rental](https://www.budgettruck.com/): Up to 20% off truck rental\n\n* [METROLINK](http://www.metrolinktrains.com/ticketspricing/page/title/discounts): 25% off Monthly Pass, 7-Day Pass, One-Way and Round-Trip tickets\n\n# Food\n\n* [Arby’s](#): Offers a 10% discount at certain locations with your student ID\n\n* [Buffalo Wild Wings](#): Get a 10% discount off those flaming wings with your student ID\n\n* [Burger King](#): 10% discount when you flash your ID\n\n* [Chick-fil-A](#): Get a free small drink to accompany your chicken sandwich and waffle fries (or any meal) when you show your ID\n\n* [Chipotle](#): Offers a free small drink with your meal when you show your student ID\n\n* [Dairy Queen](#): Offers a 10% discount for students with ID.\n\n* [McDonalds](#): 10% discount with your student ID\n\n* [Qdoba](#): Offers a free drink for students when you purchase a meal, as well as burrito meals for $5\n\n# Apparel\n\n* [Alex and Ani](#): Students get 10% off in stores with a when you flash a valid school ID.\n\n* [ASOS](#): Stay stylish with 10% off ASOS duds\n\n* [Banana Republic](#), [J.Crew](), [The Limited](), [Medelita](), [Madewell](): 15% off\n\n* [Club Monaco](#): 20% off regular and sale priced items in any Club Monaco store and online\n\n* [Goodwill](#): 10% discount with student ID\n\n* [TOMS](#): 10% cash back on shoes\n\n* [Topshop](#): 10% off Topshop apparel in stores and online\n\n# Vehicles\n\n* [Chevrolet](http://www.chevrolet.com/discounts): Discounts available on selected models for professors and students\n\n* [GM](https://www.gmcollegediscount.com/vehicles/): Discounts available on selected models of 3 brands\n\n# Courses\n\n* [Faltiron School](https://flatironschool.com/): Free one-month membership ($149 value) to Community-Powered Bootcamp\n\n* [Thinkful](https://www.thinkful.com/): One month of access to a web development course\n\n# Entertainment\n\n* [Cinemark](http://www.cinemark.com/discounts-student-discounts): Get discounts on movie tickets; 25% OFF pre-paid movie tickets through [SA card](http://www.studentadvantage.com/discountcard/)\n\n* [Regal Cinemas](https://www.regmovies.com/help/entry/student-discount): Find local theaters offering student discounts\n\n# Lens and spectacles\n\n* [Glasses USA](https://www.glassesusa.com/students-discount): 55% off frames with clear single-vision lenses\n\n* [Lenstore.co.uk](https://www.lenstore.co.uk/unidays-student-discount): 15% off on the first order\n\n# Web Hosting\n\n * [Digital Ocean](https://www.digitalocean.com) - Provides $50 in hosting credit for every student that signs up for the [Github Student Developer Pack](https://education.github.com/pack)\n\n * [Gwiddle](https://gwiddle.co.uk) - Provides hosting for 2 websites, 5 mail accounts, 4 MySQL DBs, 4 cron jobs, 1.5GB bandwidth, and 2GB diskspace free to verified students.\n\n * [RoseHosting](https://www.rosehosting.com) - Offers a recurring 20% discount on all their [managed Linux VPS](https://www.rosehosting.com/linux-vps-hosting.html) and [Shared hosting plans](https://www.rosehosting.com/linux-shared-hosting.html) when paying monthly. Students can use the discount by applying the coupon code `STUDENT20`.\n\n# Domain Name\n\n * [NameCheap](http://nc.me) - One year of free domain name registration on the `.me` TLD ($18.99/year) via [Github Student Developer Pack](https://education.github.com/pack)\n\n\n---\n\n

\n\tCode of conduct | Contribute\n

\n" }, { "path": "lists.json", "content": "[\n { \"title\": \"Best Student Discount Services\",\n \"description\": \"A student ID 💳 is a key 🔑 that unlocks 🔐 several deals and free stuff 🎉 that can make life better. This is a list of the best services that offer student discounts that students must try.\",\n \"author\": \"OpenGenus Foundation\",\n \"authorlink\" : \"http://opengenus.org/\",\n \"filename\": \"best-student-discount-services\"\n },\n { \"title\": \"Awesome Lists\",\n \"description\": \"😎 Curated list of awesome lists \",\n \"author\": \"Sindre Sorhus\",\n \"authorlink\" : \"http://awesome.re/\",\n \"filename\": \"awesome-lists\"\n },\n { \"title\": \"Awesome Competitive Coding\",\n \"description\": \"A Curated list of Topic wise Theory and Questions to Get You Started On Competitive Coding.\",\n \"author\": \"Mihir Rana\",\n \"authorlink\" : \"http://ranamihir.github.io\",\n \"filename\": \"awesome-competitive-coding\"\n }\n]\n" }, { "path": "manage.py", "content": "#!/usr/bin/env python\nimport os\nimport sys\n\nif __name__ == \"__main__\":\n os.environ.setdefault(\"DJANGO_SETTINGS_MODULE\", \"cosmos_search.settings\")\n try:\n from django.core.management import execute_from_command_line\n except ImportError:\n # The above import may fail for some other reason. Ensure that the\n # issue is really that Django is missing to avoid masking other\n # exceptions on Python 2.\n try:\n import django # noqa\n except ImportError:\n raise ImportError(\n \"Couldn't import Django. Are you sure it's installed and \"\n \"available on your PYTHONPATH environment variable? Did you \"\n \"forget to activate a virtual environment?\"\n )\n raise\n execute_from_command_line(sys.argv)\n" }, { "path": "metadata.json", "content": "{\"string_algorithms/src/kmp_algorithm\": [\"README.md\", \"kmp_algorithm.cpp\", \"kmp.py\"], \"string_algorithms/src/lipogram_checker\": [\"lipogram_checker.js\", \"lipogram_checker.cs\", \"lipogram_checker.py\", \"lipogram_checker.cpp\"], \"string_algorithms/src/pangram_checker\": [\"pangram_checker.swift\", \"Pangram.java\", \"pangram_checker.c\", \"pangram.rb\", \"pangram_checker.py\", \"pangram_checker.php\", \"pangram-checker.js\", \"pangram_checker.m\", \"pangram_checker.go\", \"pangram.cpp\"], \"string_algorithms/src/password_strength_checker\": [\"README.md\", \"pw_checker.js\", \"pw_checker.py\", \"pw_checker.cpp\", \"pw_checker.java\", \"pw_checker.cs\"], \"string_algorithms/src/anagram_search\": [\"anagram_search.swift\", \"anagram_search.go\", \"README.md\", \"anagram_search.cpp\", \"anagram_search.java\", \"anagram_search.c\", \"anagram_search.js\", \"anagram_search.py\", \"anagram_search.cs\", \"anagram_search.rb\"], \"string_algorithms/src/morse_code\": [\"morsecode.js\", \"morsecode.go\", \"morsecode.py\"], \"string_algorithms/src/boyer_moore_algorithm\": [\"boyer_moore_algorithm.cpp\", \"README.md\", \"boyer_moore_algorithm2.c\", \"boyer_moore_algorithm.c\"], \"string_algorithms/src/remove_dups\": [\"remove_dumps.py\", \"remove_dups.cpp\", \"remove_dups.c\"], \"string_algorithms/src/manachar_algorithm\": [\"manachar_longest_palindromic_subs.cpp\", \"manachar_longest_palindromic_subs.py\"], \"string_algorithms/src/finite_automata\": [\"README.md\", \"SearchStringUsingDFA.java\", \"SearchStringUsingDFA.rs\"], \"string_algorithms/src/palindrome_checker\": [\"palindrome.cs\", \"palindrome.php\", \"Palindrome.purs\", \"palindrome.lua\", \"palindrome.sh\", \"palindrome.ex\", \"palindrome.erl\", \"palindrome.c\", \"palindrome.go\", \"palindrome.hs\", \"palindrome.py\", \"palindrome.swift\", \"palindrome.cpp\", \"palindrome.js\", \"Palindrome.java\", \"palindrome.clj\", \"palindrome.rs\", \"Palindrome.kt\", \"palindrome.rb\"], \"string_algorithms/src/levenshtein_distance\": [\"LevenshteinDistance.java\"], \"string_algorithms/src/arithmetic_on_large_numbers\": [\"string_subtract.cpp\", \"string_addition.cpp\", \"string_multiplication.cpp\", \"string_factorial.cpp\"], \"string_algorithms/src/rabin_karp_algorithm\": [\"README.md\", \"rabin_karp.py\", \"RabinKarp.java\", \"rabin-karp.c\"], \"string_algorithms/src/naive_pattern_search\": [\"README.md\", \"naive_pattern_search.py\"], \"string_algorithms/src/trie_pattern_search\": [\"README.md\", \"trie.cpp\"], \"string_algorithms/src/aho_corasick_algorithm\": [\"README.md\", \"aho_corasick_algorithm2.cpp\", \"aho_corasick_algorithm.java\", \"aho_corasick_algorithm.cpp\"], \"string_algorithms/src/kasai_algorithm\": [\"kasai_algorithm.cpp\", \"README.md\"], \"string_algorithms/src/suffix_array\": [\"README.md\", \"suffixArray.java\"], \"string_algorithms/src/z_algorithm\": [\"README.md\", \"z_algorithm.cpp\", \"z_algorithm.py\", \"z_algorithm_z_array.cpp\"], \"string_algorithms/test\": [\"README.md\"], \"computational_geometry/src/jarvis_march\": [\"README.md\", \"jarvis_march.py\", \"jarvis_march.cpp\"], \"computational_geometry/src/2d_line_intersection\": [\"README.md\", \"line.js\", \"line.java\", \"line.cpp\", \"line.py\", \"line.c\", \"line2dintersection.hs\", \"line.cs\", \"line.rb\"], \"computational_geometry/src/distance_between_points\": [\"README.md\", \"distance_between_points.c\", \"distance_between_points.js\", \"distance_between_points.py\", \"DistanceBetweenPoints.java\", \"distance_between_points.cpp\", \"distance_between_points.go\", \"distance_between_points.rs\"], \"computational_geometry/src/cohen_sutherland_lineclip\": [\"README.md\", \"lineclip.c\"], \"computational_geometry/src/halfplane_intersection\": [\"halfplane_intersection.cpp\"], \"computational_geometry/src/area_of_polygon\": [\"area_of_polygon.cpp\", \"AreaOfPolygon.java\", \"area_of_polygon.py\", \"area_of_polygon.c\"], \"computational_geometry/src/2d_separating_axis_test\": [\"sat.cpp\"], \"computational_geometry/src/axis_aligned_bounding_box_collision\": [\"axis_aligned_bounding_box_collision.cpp\", \"axis_aligned_bounding_box_collision.go\"], \"computational_geometry/src/graham_scan\": [\"graham_scan.cpp\", \"GrahamScan.java\"], \"computational_geometry/src/area_of_triangle\": [\"area_of_triangle.js\", \"AreaOfTriangle.java\", \"area_of_triangle.py\", \"area_of_triangle.cpp\", \"area_of_triangle.go\", \"area_of_triangle.c\", \"area_of_triangle.rs\"], \"computational_geometry/src/sutherland_hodgeman_clipping\": [\"README.md\", \"sutherland.cpp\", \"sutherland.c\"], \"computational_geometry/src/bresenham_line\": [\"bresenham_line.py\", \"bresenham_line.cpp\"], \"computational_geometry/src/quickhull\": [\"README.md\", \"test_data.csv\", \"test_data_soln.txt\", \"test_data_soln.png\", \"quickhull.hs\", \"quickhull.java\", \"quickhull.cpp\"], \"computational_geometry/test\": [\"README.md\"], \"numerical_analysis/runge_kutt/src\": [\"rk4.cpp\", \"rk4.py\", \"rk4.c\"], \"numerical_analysis/integral/src\": [\"integral_trapezoid.py\", \"integral_rectangle.c\", \"integral_trapezoid.c\", \"integral_rectangle.cpp\", \"integral_rectangle.py\", \"integral_trapezoid.cpp\"], \"numerical_analysis/monte_carlo/src\": [\"pi_montecarlo.py\", \"pi_monte_carlo.cpp\", \"integral_monte_carlo.cpp\", \"pi_montecarlo.c\", \"integral_montecarlo.c\", \"integral_montecarlo.py\"], \"selection_algorithms/src/median-of-medians\": [\"median_of_medians.c\", \"median_of_medians.py\", \"median_of_medians.hs\"], \"selection_algorithms/test\": [\"README.md\"], \"divide_conquer/src/karatsuba_multiplication\": [\"multiply.java\"], \"divide_conquer/src/warnock_algorithm\": [\"warnock_algorithm.pde\"], \"divide_conquer/src/x_power_y\": [\"x_power_y.c\"], \"divide_conquer/src/quick_sort\": [\"quick_sort.swift\", \"README.md\", \"quick_sort.cpp\", \"quick_sort_java\", \"quick_sort2.cpp\", \"quick_sort.hs\", \"quick_sort.rs\", \"quick_sort.py\", \"quick_sort.c\"], \"divide_conquer/src/merge_sort_using_divide_and_conquer\": [\"README.md\", \"merge_sort_using_divide_and_conquer.java\", \"inversions.c\", \"merge_sort_using_divide_and_conquer.cpp\"], \"divide_conquer/src/tournament_method_to_find_min_max\": [\"tournament_method_to_find_min_max.c\"], \"divide_conquer/src/closest_pair_of_points\": [\"closest_pair.cpp\", \"closest_pair.py\"], \"divide_conquer/src/inversion_count\": [\"count_inversions.c\", \"README.md\", \"inversion_count.py\", \"inversion_count.js\", \"inversion_count.java\", \"inversion_count.cpp\"], \"divide_conquer/test\": [\"README.md\"], \"search/src/interpolation_search\": [\"interpolation_search.php\", \"README.md\", \"interpolation_search.go\", \"interpolation_search.c\", \"interpolation_search.py\", \"interpolation_search.java\", \"interpolation_search.cpp\"], \"search/src/fuzzy_search\": [\"fuzzy_search.php\", \"fuzzy_search.js\"], \"search/src/ternary_search\": [\"Ternary_search.java\", \"ternary_search.go\", \"README.md\", \"ternary_search.js\", \"ternary_search.c\", \"ternary_search.py\", \"ternary_search.kt\", \"ternary_search.rs\", \"ternary_search.php\", \"ternary_search.cpp\"], \"search/src/linear_search\": [\"linear_search.py\", \"README.md\", \"linear_search.rb\", \"linear_search.nim\", \"linear_search.go\", \"linear_search.ml\", \"linear_search.hs\", \"linear_search.php\", \"linear_search.java\", \"linear_search.kt\", \"linear_search.js\", \"linear_search.clj\", \"linear_search.rs\", \"linear_search.cs\", \"linear_search.swift\", \"linear_search.scala\", \"SentinelLinearSearch.cpp\", \"linear_search.cpp\", \"linear_search.c\"], \"search/src/binary_search\": [\"binary_search.scala\", \"binary_search.php\", \"README.md\", \"binary_search.java\", \"binary_search.hs\", \"binary_search.cs\", \"binary_search.py\", \"binary_search.kt\", \"binary_search.cpp\", \"binary_search.go\", \"binary_search.rkt\", \"binary_search_2.cpp\", \"binary_search.swift\", \"binary_search.rb\", \"binary_search.js\", \"binary_search.c\", \"binary_search.rs\", \"binary_search.sh\"], \"search/src/exponential_search\": [\"README.md\", \"exponential_search.c\", \"exponential_search.js\", \"exponential_search.rs\", \"exponential_search.java\", \"exponential_search.php\", \"exponential_search.go\", \"exponential_search2.cpp\", \"exponential_search.rb\", \"exponential_search.cpp\", \"exponential_search2.py\"], \"search/src/jump_search\": [\"README.md\", \"jump_search.php\", \"jump_search.py\", \"jump_search.rs\", \"jump_search.java\", \"jump_search.swift\", \"jump_search.c\", \"jump_search.js\", \"jump_search.go\", \"jump_search.cpp\"], \"search/src/fibonacci_search\": [\"fibonacci_search.js\", \"fibonacci_search.py\", \"fibonacci_search.c\", \"fibonacci_search.swift\", \"fibonacci_search.cpp\"], \"search/test\": [\"README.md\", \"test_search.py\", \"test_search.cpp\"], \"cellular_automaton/src/von_neumann_cellular_automata\": [\"README.md\"], \"cellular_automaton/src/conways_game_of_life\": [\"life.py\", \"life.c\", \"README.md\", \"life.cpp\", \"life.rb\", \"conways_game_of_life.rb\", \"game_of_life_C_SDL.c\", \"GameOfLife.hs\", \"life.go\", \"Conway.java\"], \"cellular_automaton/src/langtons_ant\": [\"README.md\", \"LangtonAnt.py\", \"LangtonAnt.java\", \"LangtonAnt.html\", \"LangtonAnt.cpp\"], \"cellular_automaton/src/genetic_algorithm\": [\"genetic_algorithm.go\", \"genetic_algorithm2.py\", \"genetic_algorithm.js\", \"genetic.cpp\", \"genetic_algorithm.java\", \"genetic_algorithm.py\"], \"cellular_automaton/src/elementary_cellular_automata\": [\"README.md\", \"ElementaryCellularAutomaton.java\"], \"cellular_automaton/src/nobili_cellular_automata\": [\"README.md\"], \"cellular_automaton/src/brians_brain\": [\"README.md\"], \"cellular_automaton/test\": [\"README.md\"], \"greedy_algorithms/src/kruskal_minimum_spanning_tree\": [\"README.md\", \"kruskal.c\", \"kruskal.py\", \"kruskal.cpp\"], \"greedy_algorithms/src/huffman_coding\": [\"README.md\", \"huffman_coding.cpp\", \"huffman_coding.py\"], \"greedy_algorithms/src/activity_selection\": [\"README.md\", \"activity_selection.py\", \"activity_selection.cpp\", \"activity_selection.java\"], \"greedy_algorithms/src/dijkstra_shortest_path\": [\"README.md\", \"dijkstra_shortest_path.java\", \"dijkstra-shortest-path.cpp\", \"dijkstra_shortest_path.py\", \"dijkstra_shortest_path.c\"], \"greedy_algorithms/src/job_sequencing\": [\"README.md\", \"job_sequencing.py\", \"job_sequencing.cpp\"], \"greedy_algorithms/src/k_centers\": [\"README.md\", \"k_centers.py\"], \"greedy_algorithms/src/fractional_knapsack\": [\"fractional_knapsack.go\", \"fractional_knapsack.cs\", \"README.md\", \"fractional_knapsack.c\", \"fractional_knapsack.cpp\", \"fractional_knapsack.py\", \"fractional_knapsack.java\"], \"greedy_algorithms/src/prim_minimum_spanning_tree\": [\"prim_minimum_spanning_tree.hs\", \"prim_minimum_spanning_tree.py\", \"README.md\", \"prim_minimum_spanning_tree.cpp\"], \"greedy_algorithms/src/hillclimber\": [\"Hillclimber.java\"], \"greedy_algorithms/src/egyptian_fraction\": [\"egyptian_fraction.py\", \"egyptian_fraction.c\", \"egyptian_fraction.cpp\"], \"greedy_algorithms/src/warshall\": [\"warshalls.c\"], \"greedy_algorithms/src/minimum_coins\": [\"minimum_coins.py\", \"README.md\", \"minimum_coins.c\", \"minimum_coins.cpp\", \"MinimumCoins.hs\", \"MinimumCoins.java\", \"minimum_coins.go\", \"minimum-coins.js\"], \"greedy_algorithms/test/kruskal_minimum_spanning_tree\": [\"test_kruskal.cpp\"], \"dynamic_programming/src/longest_palindromic_substring\": [\"README.md\", \"longest_palindromic_substring.cpp\"], \"dynamic_programming/src/shortest_common_supersequence\": [\"README.md\", \"SCS.java\", \"shortest_common_supersequence.cpp\", \"shortest_common_supersequence.py\"], \"dynamic_programming/src/maximum_weight_independent_set_of_path_graph\": [\"maximum_weight_independent_set_of_path_graph.cpp\"], \"dynamic_programming/src/weighted_job_scheduling\": [\"README.md\", \"weighted_job_scheduling.cpp\"], \"dynamic_programming/src/no_consec_ones\": [\"no_consec_ones.py\", \"README.md\", \"no_consec_1.cpp\"], \"dynamic_programming/src/Optimal_Binary_Search_Tree\": [\"Optimal_BST.py\"], \"dynamic_programming/src/coin_change\": [\"README.md\", \"coin_change.py\", \"coin_change.java\", \"coinchange.go\", \"coinchange.cpp\", \"coinchange.c\", \"mincoinchange.cpp\"], \"dynamic_programming/src/longest_common_substring\": [\"longest_common_substring.cpp\"], \"dynamic_programming/src/knapsack\": [\"README.md\", \"knapsack.js\", \"Knapsack.java\", \"knapsack.c\", \"knapsack.go\", \"knapsack.py\", \"knapsack.cpp\"], \"dynamic_programming/src/edit_distance\": [\"README.md\", \"edit_distance.java\", \"edit_distance_backtracking.cpp\", \"edit_distance.go\", \"edit_distance_hirschberg.cpp\", \"edit_distance.py\", \"edit_distance.c\", \"edit_distance.hs\", \"edit_distance.cpp\"], \"dynamic_programming/src/boolean_parenthesization\": [\"boolean_parenthesization.cpp\", \"README.md\", \"boolean_parenthesization.java\", \"boolean_parenthesization.c\", \"boolean_parenthesization.py\", \"boolean_parenthesization.swift\"], \"dynamic_programming/src/maximum_sum_sub_matrix\": [\"maximum_sum_sub_matrix.java\", \"maximum_sum_sub_matrix.cpp\"], \"dynamic_programming/src/maximum_sum_increasing_subsequence\": [\"README.md\", \"maximum_sum_increasing_subsequence.c\"], \"dynamic_programming/src/factorial\": [\"factorial.scala\", \"factorial.go\", \"factorial.java\", \"factorial.rs\", \"factorial.exs\", \"factorial.py\", \"factorial.c\"], \"dynamic_programming/src/binomial_coefficient\": [\"binomial_coefficient.py\", \"README.md\", \"binomial_coefficient.cpp\", \"binomial_coefficient.js\", \"binomial_coefficient.c\", \"binomial_coefficient.java\"], \"dynamic_programming/src/longest_common_increasing_subsequence\": [\"longest_common_increasing_subsequence.cpp\"], \"dynamic_programming/src/palindrome_partition\": [\"README.md\", \"palindrome_partition.js\", \"palindrome_partition.cpp\"], \"dynamic_programming/src/longest_palindromic_sequence\": [\"longest_palindromic_sequence.c\", \"README.md\", \"longest_palindromic_sequence.py\", \"longest_palindromic_sequence.js\", \"longest_palindromic_sequence.cpp\"], \"dynamic_programming/src/egg_dropping_puzzle\": [\"README.md\", \"egg_dropping_puzzle.hs\", \"egg_dropping_puzzle.py\", \"egg_dropping_puzzle.c\", \"egg_dropping_puzzle.cpp\"], \"dynamic_programming/src/matrix_chain_multiplication\": [\"README.md\", \"matrix_chain_multiplication.c\", \"matrix_chain_multiplication.cpp\", \"MatrixChainMultiplication.java\", \"matrix_chain_multiplication.py\"], \"dynamic_programming/src/box_stacking\": [\"README.md\", \"box_stacking.cpp\", \"box_stacking.java\", \"box_stacking.py\"], \"dynamic_programming/src/longest_independent_set\": [\"README.md\"], \"dynamic_programming/src/minimum_insertion_palindrome\": [\"minimum_insertions_palindrome_using_lcs.cpp\"], \"dynamic_programming/src/longest_increasing_subsequence\": [\"longest_increasing_subsequence.c\", \"README.md\", \"longest_increasing_subsequence_using_segment_tree.cpp\", \"longest_increasing_subsequence.go\", \"longest_increasing_subsequence.js\", \"longest_increasing_subsequence.cpp\", \"longest_increasing_subsequence.java\", \"longest_increasing_subsequence.py\"], \"dynamic_programming/src/Array_Median\": [\"Median.java\", \"median.cpp\", \"median.py\", \"median.rs\", \"median.rb\", \"median.c\", \"median.php\"], \"dynamic_programming/src/tiling_problem\": [\"README.md\", \"tiling.c\", \"tiling.py\", \"tiling.cpp\"], \"dynamic_programming/src/largest_sum_contiguous_subarray\": [\"README.md\", \"largest_sum_contiguous_subarray.go\", \"largest_sum_contiguous_subarray.java\", \"largest_sum_contiguous_subarray.py\", \"largest_sum_contiguous_subarray.c\", \"largest_sum_contiguous_subarray.hs\", \"largest_sum_contiguous_subarray.cpp\"], \"dynamic_programming/src/minimum_cost_polygon_triangulation\": [\"README.md\"], \"dynamic_programming/src/min_cost_path\": [\"README.md\", \"min_cost_path.py\", \"min_cost_path.cpp\", \"min_cost_path.c\", \"min_cost_path.java\"], \"dynamic_programming/src/subset_sum\": [\"subset_sum.cpp\", \"README.md\", \"subset_sum.java\", \"subset_sum.go\", \"subset_sum.py\"], \"dynamic_programming/src/longest_common_subsequence\": [\"README.md\", \"Longest_Common_Subsequence.py\", \"longestCommonSubsequence.go\", \"longest_common_subsequence.cpp\", \"LongestCommonSubsequence.java\", \"LongestCommonSubsequenceRec.java\"], \"dynamic_programming/src/rod_cutting\": [\"rod_cutting.cpp\", \"README.md\", \"rod_cutting.hs\", \"rod_cutting.py\", \"rod_cutting.c\"], \"dynamic_programming/src/numeric_keypad_problem\": [\"numeric_keypad_problem.cpp\"], \"dynamic_programming/src/longest_bitonic_sequence\": [\"README.md\", \"longestBitonicSeq.cpp\", \"longest_bitonic_sequence.c\", \"longest_bitonic_sequence.py\", \"longestBitonicSequence.java\", \"longest_bitonic_sequence.js\"], \"dynamic_programming/test/subset_sum\": [\"test_subset_sum.cpp\"], \"online_challenges/src/project_euler/problem_002\": [\"README.md\", \"problem_002.cpp\", \"problem_002.py\", \"problem_002.js\"], \"online_challenges/src/project_euler/problem_036\": [\"problem_036.py\", \"README.md\", \"problem_036.cpp\"], \"online_challenges/src/project_euler/problem_016\": [\"README.md\", \"problem_016.py\"], \"online_challenges/src/project_euler/problem_003\": [\"README.md\", \"problem_003.py\", \"problem_003.cpp\"], \"online_challenges/src/project_euler/problem_025\": [\"README.md\", \"problem_025.py\"], \"online_challenges/src/project_euler/problem_007\": [\"README.md\", \"problem_007.cpp\"], \"online_challenges/src/project_euler/problem_008\": [\"README.md\", \"problem_008.py\"], \"online_challenges/src/project_euler/problem_004\": [\"README.md\", \"problem_004.cpp\", \"problem_004.py\"], \"online_challenges/src/project_euler/problem_028\": [\"README.md\", \"problem_028.py\", \"problem_028.cpp\"], \"online_challenges/src/project_euler/problem_006\": [\"README.md\", \"problem_006.cpp\", \"problem_006.py\"], \"online_challenges/src/project_euler/problem_010\": [\"README.md\", \"problem_010.cpp\"], \"online_challenges/src/project_euler/problem_102\": [\"README.md\", \"problem_102.cpp\", \"triangles.txt\"], \"online_challenges/src/project_euler/problem_001\": [\"README.md\", \"problem_001.py\", \"problem_001.js\", \"problem_001.cpp\"], \"online_challenges/src/project_euler/problem_005\": [\"README.md\", \"problem_005.cpp\"], \"online_challenges/src/project_euler/problem_009\": [\"README.md\", \"problem_009.cpp\"], \"online_challenges/src/project_euler/problem_014\": [\"README.md\", \"problem_014.cpp\"], \"online_challenges/src/rosalind/complement_dna_strand\": [\"complement_dna_strand.exs\"], \"online_challenges/test\": [\"README.md\"], \"operating_system/src/scheduling/shortest_seek_time_first\": [\"shortest_seek_time_first.c\", \"shortest_seek_time_first.cpp\"], \"operating_system/src/scheduling/multi_level_feedback_queue_scheduling\": [\"mlfq.ts\"], \"operating_system/src/scheduling/smallest_remaining_time_first\": [\"srtf.c\"], \"operating_system/src/scheduling/round_robin_scheduling/round_robin_c\": [\"README.md\", \"queue.h\", \"round_robin.c\", \"queue.c\"], \"operating_system/src/scheduling/first_come_first_serve\": [\"fcfs.java\", \"fcfs.cpp\", \"fcfs.py\", \"fcfs.rs\", \"fcfs.cs\"], \"operating_system/src/memory_management/least_recently_used\": [\"lru.c\"], \"operating_system/src/shell/C\": [\"README.md\", \"Shell.c\", \"Makefile\"], \"operating_system/src/deadlocks/bankers_algorithm\": [\"banker_safety.cpp\"], \"operating_system/src/concurrency/readers_writers\": [\"readers_writers.cpp\"], \"operating_system/src/concurrency/dining_philosophers\": [\"README.md\", \"dining_philosophers.c\"], \"operating_system/src/concurrency/monitors/monitors_system_v\": [\"main.c\", \"monitors.c\", \"monitor.h\"], \"operating_system/src/concurrency/peterson_algorithm_for_mutual_exclusion/peterson_algorithm_in_c\": [\"peterson_algo_mutual_exclusion_in_c.c\", \"mythreads.h\"], \"operating_system/src/concurrency/producer_consumer\": [\"producer_consumer.cpp\"], \"operating_system/test\": [\"README.md\"], \"networking/src/validate_IP\": [\"is_valid_ip.php\", \"README.md\", \"validate_ip.sh\", \"validate_ipv4.js\", \"validate_ipv4.py\", \"ipv4_check.go\", \"Validate_connection_ipv4.py\", \"validate_ip.rb\", \"validate_ip.c\"], \"networking/src/determine_endianess\": [\"determine_endianess.c\"], \"networking/test\": [\"README.md\"], \"data_structures/src/list/singly_linked_list/operations/find\": [\"SearchElement_list.java\"], \"data_structures/src/list/singly_linked_list/operations/detect_cycle\": [\"detect_cycle.cpp\"], \"data_structures/src/list/singly_linked_list/operations/sort\": [\"bubble_sort.cpp\"], \"data_structures/src/list/singly_linked_list/operations/delete\": [\"delete_node_with_key.java\"], \"data_structures/src/list/singly_linked_list/operations/merge_sorted\": [\"merge_sorted.cpp\"], \"data_structures/src/list/singly_linked_list/operations/reverse\": [\"reverse.cpp\", \"reverse_recursion2.cpp\", \"reverse_iteration.cpp\", \"reverse.c\", \"reverse_recursion.cpp\"], \"data_structures/src/list/singly_linked_list/operations/print_reverse\": [\"print_reverse.py\", \"print_reverse.scala\"], \"data_structures/src/list/singly_linked_list/operations/push\": [\"push.cpp\"], \"data_structures/src/list/singly_linked_list/operations/unclassified\": [\"LinkedList.java\", \"union_intersection_in_list.textClipping\", \"linked_List_Operations.cpp\", \"union_intersection_in_list.c\"], \"data_structures/src/list/singly_linked_list/operations/n_th_node_linked_list\": [\"nth_node_from_end.cpp\", \"nth_node_from_end.c\"], \"data_structures/src/list/singly_linked_list/operations/rotate\": [\"rotate.cpp\"], \"data_structures/src/list/xor_linked_list\": [\"README.md\", \"xor_linked_list.cpp\"], \"data_structures/src/list/skip_list\": [\"skip_list.java\", \"README.md\", \"skip_list.swift\", \"skip_list.cpp\", \"skip_list.c\", \"skip_list.scala\"], \"data_structures/src/list/doubly_linked_list/C\": [\"doubly_linked_list.h\", \"doubly_linked_list.c\"], \"data_structures/src/list/circular_linked_list/operations\": [\"has_loop.py\", \"is_circular.py\"], \"data_structures/src/tree/b_tree/b_tree/b_tree_C\": [\"README.md\", \"main.c\", \"btree.h\", \"btree.c\"], \"data_structures/src/tree/b_tree/two_three_tree\": [\"TwoThreeTree.scala\"], \"data_structures/src/tree/binary_tree/treap\": [\"treap.swift\", \"treap.java\", \"treap.scala\", \"persistent_treap.kt\", \"treap.cpp\"], \"data_structures/src/tree/binary_tree/aa_tree\": [\"README.md\", \"aa_tree.cpp\"], \"data_structures/src/tree/binary_tree/binary_tree/convert_to_doubly_linked_list\": [\"convert_to_doubly_linked_list.cpp\"], \"data_structures/src/tree/binary_tree/binary_tree/diameter\": [\"diameter.py\", \"README.md\", \"diameter2.c\", \"diameter.java\", \"diameter2.cpp\", \"diameter.hs\", \"diameter.cpp\", \"diameter.c\"], \"data_structures/src/tree/binary_tree/binary_tree/minimum_height\": [\"minimum_height.cpp\", \"minimum_height.java\", \"README.md\", \"minimum_height.py\", \"minimum_height.c\"], \"data_structures/src/tree/binary_tree/binary_tree/is_binary_tree\": [\"is_binary_tree.cpp\"], \"data_structures/src/tree/binary_tree/binary_tree/is_balance\": [\"README.md\", \"is_balance.java\"], \"data_structures/src/tree/binary_tree/binary_tree/node\": [\"node.cpp\"], \"data_structures/src/tree/binary_tree/binary_tree/serializer\": [\"serializer.cpp\"], \"data_structures/src/tree/binary_tree/binary_tree/tree/bottom_view_binary_tree\": [\"bottom_view_tree.java\", \"bottom_view_tree.cpp\"], \"data_structures/src/tree/binary_tree/binary_tree/make_binary_tree/from_inorder_and_preorder\": [\"README.md\", \"make_tree_from_inorder_and_preorder.c\", \"make_tree_from_inorder_and_preorder.java\", \"make_tree_from_inorder_and_preorder.cpp\"], \"data_structures/src/tree/binary_tree/binary_tree/maximum_height\": [\"README.md\", \"maximum_height.py\", \"maximum_height.java\", \"maximum_height2.cpp\", \"maximum_height.cpp\"], \"data_structures/src/tree/binary_tree/binary_tree/make_mirror_tree\": [\"README.md\", \"make_mirror_tree.c\", \"make_mirror_tree.py\", \"make_mirror_tree.cpp\"], \"data_structures/src/tree/binary_tree/binary_tree/is_same\": [\"is_same.cpp\"], \"data_structures/src/tree/binary_tree/binary_tree/traversal/inorder/right_threaded\": [\"right_threaded.cpp\"], \"data_structures/src/tree/binary_tree/binary_tree/traversal/zigzag\": [\"zigzag.cpp\"], \"data_structures/src/tree/binary_tree/binary_tree/traversal/preorder/right_view\": [\"right_view2.cpp\", \"README.md\", \"right_view.py\", \"right_view.cpp\"], \"data_structures/src/tree/binary_tree/binary_tree/traversal/preorder/left_view\": [\"left_view.java\"], \"data_structures/src/tree/binary_tree/binary_tree/path_sum/sum_left\": [\"sum_left.c\", \"README.md\"], \"data_structures/src/tree/binary_tree/rope\": [\"rope.py\"], \"data_structures/src/tree/binary_tree/avl_tree\": [\"avl_tree.cpp\", \"avl_tree.java\", \"avl_tree.swift\", \"avl_tree.c\"], \"data_structures/src/tree/tree/trie\": [\"trie.go\", \"README.md\", \"trie.scala\", \"trie.py\", \"trie.rb\", \"trie.cpp\", \"trie.c\", \"trie.java\", \"trie.cs\", \"trie.swift\"], \"data_structures/src/tree/tree/suffix_array\": [\"suffix_array.cpp\"], \"data_structures/src/tree/heap/min_heap\": [\"min_heap.rb\", \"min_heap.py\", \"min_heap.c\", \"min_heap.java\", \"min_heap.cpp\", \"min_heap.swift\", \"min_heap.js\"], \"data_structures/src/tree/heap/soft_heap\": [\"soft_heap.cpp\"], \"data_structures/src/tree/heap/max_heap\": [\"max_heap.cpp\", \"max_heap.java\", \"max_heap.c\", \"max_heap.go\", \"max_heap.py\"], \"data_structures/src/tree/heap/priority_queue/leftist_tree\": [\"leftist_priority_queue.cpp\"], \"data_structures/src/tree/heap/binomial_heap\": [\"binomial_heap.scala\", \"binomial_heap.c\", \"binomial_heap.cpp\"], \"data_structures/src/tree/heap/pairing_heap\": [\"README.md\", \"pairing_heap.fs\", \"pairing_heap.sml\"], \"data_structures/src/tree/segment_tree\": [\"segment_Tree_rmq.adb\"], \"data_structures/src/tree/space_partitioning_tree/quad_tree\": [\"quad_tree.swift\"], \"data_structures/src/tree/space_partitioning_tree/kd_tree\": [\"kd_tree.java\", \"kd_tree.cpp\"], \"data_structures/src/tree/space_partitioning_tree/interval_tree\": [\"interval_tree.java\", \"README.md\", \"interval_tree.cpp\"], \"data_structures/src/tree/space_partitioning_tree/segment_tree\": [\"segment_tree.scala\", \"persistent_segment_tree_sum.cpp\", \"README.md\", \"segment_tree.java\", \"segment_tree_kth_statistics_on_segment.cpp\", \"segment_tree_sum.go\", \"segment_tree_sum.py\", \"segment_tree_rmq.cpp\", \"segment_tree_rmq.py\", \"lazy_segment_tree.java\", \"segment_tree_lazy_propagation.cpp\", \"segment_tree_rmq.go\", \"segment_tree_sum.rb\", \"segment_tree_sum.cpp\"], \"data_structures/src/tree/multiway_tree/splay_tree\": [\"splay_tree.cpp\", \"readme.md\", \"splay_tree.scala\", \"splay_tree.go\", \"splay_tree.kt\", \"splay_tree.java\"], \"data_structures/src/tree/multiway_tree/fenwick_tree\": [\"fenwick_tree.cpp\", \"README.md\", \"fenwick_tree.java\", \"fenwick_tree_inversion_count.cpp\", \"fenwick_tree.pl\", \"fenwick_tree.go\", \"fenwick_tree.py\", \"fenwick_tree.c\"], \"data_structures/src/tree/multiway_tree/van_emde_boas_tree\": [\"van_emde_boas.cpp\"], \"data_structures/src/tree/multiway_tree/union_find\": [\"README.md\", \"union_find.java\", \"union_find.scala\", \"union_find.go\", \"union_find.js\", \"union_find.py\", \"union_find_dynamic.cpp\", \"union_find.cpp\", \"union_find.c\"], \"data_structures/src/tree/multiway_tree/red_black_tree\": [\"red_black_tree.cpp\", \"red_black_tree.rb\", \"red_black_tree.test.cpp\", \"red_black_tree.java\", \"red_black_tree.c\", \"red_black_tree.scala\", \"red_black_tree.h\"], \"data_structures/src/hashs/hash_table\": [\"hash_table.js\", \"hash_table.go\", \"README.md\", \"double_hashing.c\", \"hash_table.java\", \"hash_table.c\", \"hash_table.cpp\", \"hash_table.rs\", \"hash_table.cs\", \"hash_table.swift\", \"hash_table.py\"], \"data_structures/src/hashs/bloom_filter\": [\"bloom_filter.js\", \"bloomFilter.go\", \"README.md\", \"bloom_filter.swift\", \"bloom_filter.py\", \"bloom_filter.cpp\", \"bloom_filter.java\", \"bloom_filter.c\", \"bloom_filter.scala\"], \"data_structures/src/bag\": [\"bag.java\", \"bag.py\", \"bag.js\"], \"data_structures/src/stack/postfix_evaluation\": [\"README.md\", \"postfix_evaluation.sh\", \"postfix_evaluation.py\", \"postfix_evaluation.c\"], \"data_structures/src/stack/balanced_expression\": [\"balanced_expression.java\"], \"data_structures/src/stack/sort_stack\": [\"README.md\", \"sort_stack.cpp\", \"sort_stack.py\", \"sort_stack.c\"], \"data_structures/src/stack/infix_to_postfix\": [\"infix_to_postfix.java\", \"infix_to_postfix.cpp\", \"README.md\", \"infix_to_postfix.py\", \"infix_to_postfix.c\"], \"data_structures/src/stack/stack\": [\"stack.rs\", \"README.md\", \"stack.py\", \"stack.cs\", \"stack.php\", \"stack.js\", \"stack.rb\", \"stack.c\", \"stack.erl\", \"stack.go\", \"stack.java\", \"stack.swift\", \"stack.ex\", \"stack.cpp\"], \"data_structures/src/stack/reverse_stack\": [\"reverse_stack.cs\", \"README.md\", \"reverse_stack.go\", \"reverse_stack_without_extra_space.cpp\", \"reverse_stack.c\", \"reverse_stack.java\", \"reverse_stack.py\", \"reverse_stack.swift\"], \"data_structures/src/stack/abstract_stack/cpp/arrayStack\": [\"arraystackTester.cpp\", \"ArrayStack.h\"], \"data_structures/src/stack/prefix_to_postfix\": [\"README.md\", \"prefix_to_postfix.py\"], \"data_structures/src/queue/queue_stream\": [\"queue_stream.cs\"], \"data_structures/src/queue/queue_using_stack\": [\"queue_using_stack.cpp\", \"queue_using_stack.sh\", \"queue_using_stack.java\"], \"data_structures/src/queue/circular_buffer\": [\"circular_buffer.py\", \"circular_buffer.cpp\"], \"data_structures/src/queue/reverse_queue\": [\"reverse_queue.java\", \"reverse_queue.py\", \"reverse_queue.cpp\", \"reverse_queue.go\", \"reverse_queue.swift\"], \"data_structures/src/queue/queue_using_linked_list\": [\"README.md\", \"queue_using_linked_list.java\", \"queue_using_linked_list.rb\", \"queue_using_linked_list.py\", \"queue_using_linked_list.cpp\", \"queue_using_linked_list.c\"], \"data_structures/src/queue/queue\": [\"queue_vector.cpp\", \"README.md\", \"queue.exs\", \"queue.swift\", \"queue.cpp\", \"queue.go\", \"queue.cs\", \"queue.py\", \"queue.rb\", \"queue.java\", \"queue.c\", \"queue.js\"], \"data_structures/src/other\": [\"README.md\"], \"data_structures/test/list\": [\"test_list.cpp\"], \"data_structures/test/tree/binary_tree/binary_tree/diameter\": [\"test_diameter.cpp\"], \"data_structures/test/tree/binary_tree/binary_tree/is_same\": [\"test_is_same.cpp\"], \"data_structures/test/tree/binary_tree/binary_tree/path_sum\": [\"test_path_sum_for_sum_of_part_paths.cpp\", \"test_path_sum_for_whole_paths.cpp\", \"test_path_sum_for_sum_of_whole_paths.cpp\"], \"data_structures/test/tree/multiway_tree/union_find\": [\"test_union_find.cpp\"], \"data_structures/test/tree/multiway_tree/red_black_tree\": [\"test_red_black.c\"], \"randomized_algorithms/src/reservoir_sampling\": [\"reservoir_sampling.rs\", \"README.md\", \"reservoir_sampling.cpp\"], \"randomized_algorithms/src/karger_minimum_cut_algorithm\": [\"README.md\", \"karger_minimum_cut_algorithm.cpp\"], \"randomized_algorithms/src/random_node_linkedlist\": [\"README.md\"], \"randomized_algorithms/src/randomized_quick_sort\": [\"randomized_quicksort.c\"], \"randomized_algorithms/src/random_from_stream\": [\"Random_number_selection_from_a_stream.cpp\"], \"randomized_algorithms/src/shuffle_an_array\": [\"shuffle_library.rb\", \"shuffle_an_array.java\", \"README.md\", \"shuffle_an_array.rb\", \"shuffle_an_array.py\", \"shuffle_an_array.php\", \"shuffle_an_array.cpp\", \"shuffle_an_array.js\", \"shuffle_an_array.rs\"], \"randomized_algorithms/src/kth_smallest_element_algorithm\": [\"README.md\", \"kth_smallest_element_algorithm.cpp\", \"kth_smallest_element_algorithm.c\"], \"randomized_algorithms/test\": [\"README.md\"], \"mathematical_algorithms/src/convolution\": [\"convolution.cpp\"], \"mathematical_algorithms/src/fast_fourier_transform\": [\"fast_fourier_transform.java\"], \"mathematical_algorithms/src/add_polynomials\": [\"README.md\", \"add_polynomials.go\", \"add_polynomials.c\", \"add_polynomials.cpp\"], \"mathematical_algorithms/src/2sum\": [\"2sum.js\", \"2sum.py\", \"2sum.cpp\", \"2sum.rs\", \"2sum.java\", \"2sum.c\", \"2sum.go\", \"2sum.rb\"], \"mathematical_algorithms/src/karatsuba_multiplication\": [\"karatsuba_multiplication.java\"], \"mathematical_algorithms/src/replace_0_with_5\": [\"replace_0_with_5.go\", \"replace_0_with_5.cpp\", \"replace_0_with_5.py\", \"replace_0_with_5.java\", \"replace_0_with_5.c\", \"0_to_5_efficent.cpp\", \"replace_0_with_5.js\"], \"mathematical_algorithms/src/armstrong_numbers\": [\"README.md\", \"armstrong_numbers.rb\", \"armstrong_numbers.c\", \"armstrong_numbers.js\", \"armstrong_numbers.go\", \"armstrong_numbers.java\", \"armstrong_number.php\", \"armstrong_numbers.py\", \"armstrong_numbers.cpp\", \"armstrong_numbers.cs\"], \"mathematical_algorithms/src/sieve_of_eratosthenes\": [\"sieve_of_eratosthenes_linear.cpp\", \"sieve_of_eratosthenes.php\", \"README.md\", \"sieve_of_eratosthenes.c\", \"sieve_of_eratosthenes_compact.cpp\", \"sieve_of_eratosthenes.java\", \"sieve_of_eratosthenes.go\", \"sieve_of_eratosthenes.hs\", \"sieve_of_eratosthenes.cs\", \"sieve_of_eratosthenes.cpp\", \"sieve_of_eratosthenes.js\", \"sieve_of_eratosthenes.py\"], \"mathematical_algorithms/src/euler_totient\": [\"README.md\", \"euler_totient.py\", \"euler_totient_sieve.cpp\", \"euler_totient.c\", \"euler_totient_sieve.py\", \"euler_totient.java\", \"euler_totient.cpp\"], \"mathematical_algorithms/src/fibonacci_number\": [\"fibonacci_number.cs\", \"fibonacci_number.hs\", \"README.md\", \"fibonacci_number.java\", \"fibonacci_memorized.swift\", \"fibonacci_number.cpp\", \"fibonacci_matrix_exponentiation.cpp\", \"fibonacci_for_big_numbers.cpp\", \"fibonacci_number.erl\", \"fast_fibonacci.c\", \"fibonacci_number.rs\", \"fibonacci_number.ex\", \"fibonacci_lucas.py\", \"fibonacci_number.scala\", \"fibonacci_number.swift\", \"fibonacci_number.go\", \"fibonacci_number.rb\", \"fibonacci_number.c\", \"fibonacci_matrix_multiplication.py\", \"fibonacci_number.php\", \"fibonacci_number.js\", \"fibonacci_number.clj\", \"fibonacci_number.py\"], \"mathematical_algorithms/src/horner_polynomial_evaluation\": [\"README.md\", \"horner_polynomial_evaluation.cpp\", \"horner_polynomial_evaluation.java\"], \"mathematical_algorithms/src/russian_peasant_multiplication\": [\"russian_peasant_multiplication.cs\", \"README.md\", \"russian_peasant_multiplication.js\", \"russian_peasant_multiplication.rs\", \"russian_peasant_multiplication.c\", \"russian_peasant_multiplication.py\", \"russian_peasant_multiplication.go\", \"russian_peasant_multiplication.php\", \"russian_peasant_multiplication.cpp\"], \"mathematical_algorithms/src/babylonian_method\": [\"README.md\", \"babylonian_method.go\", \"babylonian_method.cpp\", \"babylonian_method.java\", \"babylonian_method.c\", \"Babylonian_method.py\", \"babylonian_method.js\"], \"mathematical_algorithms/src/fast_inverse_sqrt\": [\"fast_inverse_sqrt.cpp\"], \"mathematical_algorithms/src/sieve_of_atkin\": [\"sieve_of_atkin.cpp\", \"sieve_of_atkin.c\", \"sieve_of_atkin.py\", \"sieve_of_atkin.java\"], \"mathematical_algorithms/src/permutation_lexicographic_order\": [\"permutation_lexicographic_order.cpp\", \"README.md\"], \"mathematical_algorithms/src/segmented_sieve_of_eratosthenes\": [\"segmented_sieve_of_eratosthenes.cpp\"], \"mathematical_algorithms/src/std\": [\"std.py\", \"std.c\", \"std.go\", \"std.cpp\", \"std.js\"], \"mathematical_algorithms/src/gcd_and_lcm\": [\"gcd_and_lcm.cpp\", \"gcd_and_lcm.java\", \"gcd_and_lcm.js\", \"gcd_and_lcm.c\", \"gcd_and_lcm.cs\", \"gcd_and_lcm.scala\", \"gcd_and_lcm.py\", \"gcd_and_lcm.ex\", \"gcd_and_lcm.php\", \"gcd_and_lcm.go\", \"gcd_and_lcm.erl\"], \"mathematical_algorithms/src/amicable_numbers\": [\"amicable_numbers.cpp\", \"amicable_numbers.py\", \"amicable_numbers.rs\", \"amicable_numbers.rb\", \"amicable_numbers.c\", \"amicable_numbers.cs\", \"amicable_numbers.js\", \"amicable_numbers.go\", \"amicable_numbers.java\"], \"mathematical_algorithms/src/lucas_theorem\": [\"lucas_theorem.cpp\"], \"mathematical_algorithms/src/sum_of_digits\": [\"sum_of_digits.java\", \"sum_of_digits.swift\", \"sum_of_digits_with_recursion.c\", \"sum_of_digits.php\", \"sum_of_digits.c\", \"sum_of_digits.rs\", \"sum_of_digits.rb\", \"sum_of_digits.py\", \"sum_of_digits.cs\", \"sum_of_digits.ex\", \"sum_of_digits.js\", \"sum_of_digits.go\", \"sum_of_digits.cpp\"], \"mathematical_algorithms/src/pandigital_number\": [\"README.md\", \"pandigital_number.rb\", \"pandigital_number.c\"], \"mathematical_algorithms/src/next_larger_number\": [\"next_larger_number.cpp\", \"next_larger_number.php\", \"next_larger_number.py\", \"next_larger_number.java\"], \"mathematical_algorithms/src/tridiagonal_matrix\": [\"README.md\", \"tridiagonal_matrix.java\"], \"mathematical_algorithms/src/gaussian_elimination\": [\"gaussian_elimination.java\", \"gaussian_elimination.cpp\"], \"mathematical_algorithms/src/shuffle_array\": [\"README.md\", \"shuffle_array.js\", \"shuffle_array.rb\", \"shuffle_array.cpp\"], \"mathematical_algorithms/src/newton_polynomial\": [\"newton_polynomial.java\", \"README.md\"], \"mathematical_algorithms/src/average_stream_numbers\": [\"README.md\", \"average_stream_numbers.c\", \"average_stream_numbers.py\", \"average_stream_numbers.cpp\", \"average_stream_numbers.go\"], \"mathematical_algorithms/src/delannoy_number\": [\"README.md\", \"delannoy_number.c\", \"delannoy_number.cpp\"], \"mathematical_algorithms/src/magic_square\": [\"README.md\", \"magic_square.py\"], \"mathematical_algorithms/src/check_is_square\": [\"check_is_square.go\", \"check_is_square.cpp\", \"check_is_square.swift\", \"check_is_square.cs\", \"check_is_square.scala\", \"check_is_square.java\", \"check_is_square.ruby\", \"check_is_square.php\", \"check_is_square.py\", \"check_is_square.js\", \"check_is_square.rs\", \"check_is_square.c\"], \"mathematical_algorithms/src/largrange_polynomial\": [\"README.md\", \"lagrange_polynomial.java\"], \"mathematical_algorithms/src/poisson_sample\": [\"poisson_sample.py\"], \"mathematical_algorithms/src/divided_differences\": [\"README.md\", \"divided_differences.java\"], \"mathematical_algorithms/src/factorial\": [\"factorial.scala\", \"factorial.hs\", \"factorial_iteration.js\", \"factorial.go\", \"factorial.clj\", \"factorial.ex\", \"factorial.rb\", \"factorial_recursion.cs\", \"factorial_iteration.py\", \"factorial_recursion.c\", \"factorial_recursion.cpp\", \"factorial.java\", \"factorial_iteration.c\", \"factorial.swift\", \"factorial.rs\", \"factorial.erl\", \"factorial-hrw.py\", \"factorial_recursion.py\", \"factorial_iteration.cs\", \"factorial.c\", \"factorial.php\", \"factorial_recursion.js\"], \"mathematical_algorithms/src/decoding_of_string\": [\"README.md\"], \"mathematical_algorithms/src/binomial_coefficient\": [\"binomial_coefficient.py\", \"README.md\", \"binomial_coefficient.cpp\", \"binomial_coefficient.c\", \"binomial_coefficient.java\", \"binomial_coefficient.go\"], \"mathematical_algorithms/src/lucky_number\": [\"README.md\", \"lucky_number.java\", \"lucky_number.c\"], \"mathematical_algorithms/src/integer_conversion\": [\"decimal_to_bin.cpp\", \"decimal_to_any_base.py\", \"decimal_to_int.go\", \"decimal_to_any_base.js\", \"decimal_to_hex.cpp\", \"decimal_to_oct.cpp\"], \"mathematical_algorithms/src/pythagorean_triplet\": [\"pythagorean_triplet.cpp\"], \"mathematical_algorithms/src/reverse_number\": [\"reverse_number.cpp\", \"reverse_number.rb\", \"reverse_number.cs\", \"reverse_number.swift\", \"reverse_number_recursion.java\", \"reverse_number.py\", \"reverse_number.js\", \"reverse_number.go\", \"Reverse_a_number.c\", \"reverse_number.java\", \"reverse_number.hs\", \"reverse_number.php\", \"reverse_number.c\"], \"mathematical_algorithms/src/steepest_descent\": [\"steepest_descent.cpp\"], \"mathematical_algorithms/src/primality_tests/fermat_primality_test\": [\"fermat_primality_test.c\"], \"mathematical_algorithms/src/primality_tests/solovay-strassen_primality_test\": [\"solovay-strassen_primality_test.cpp\"], \"mathematical_algorithms/src/primality_tests/miller_rabin_primality_test\": [\"miller_rabin_primality_test.cpp\", \"miller_rabin_primality_test.py\"], \"mathematical_algorithms/src/catalan_number\": [\"README.md\", \"catalan_number.js\", \"catalan_number_recursive.cpp\", \"catalan_number.py\", \"catalan_number.rb\", \"catalan_number_dynamic.cpp\", \"catalan_number.java\", \"catalan_number2.py\", \"catalan_number.scala\", \"catalan_number.c\"], \"mathematical_algorithms/src/newton_raphson_method\": [\"README.md\", \"newton_raphson.cpp\", \"newton_raphson.c\", \"newton_raphson.php\"], \"mathematical_algorithms/src/integer_to_roman\": [\"integer_to_roman.cpp\", \"integer_to_roman.py\", \"integer_to_roman.js\"], \"mathematical_algorithms/src/reverse_factorial\": [\"README.md\", \"reverse_factorial.go\", \"reverse_factorial.java\", \"reverse_factorial.py\", \"reverse_factorial.c\", \"reverse_factorial.js\", \"reverse_factorial.rb\"], \"mathematical_algorithms/src/derangements\": [\"derangements.c\"], \"mathematical_algorithms/src/automorphic_numbers\": [\"README.md\", \"automorphic_numbers.swift\", \"automorphic_numbers.cpp\", \"automorphic_numbers.go\", \"automorphic_numbers.php\", \"automorphic_numbers.rb\", \"automorphic_numbers.py\", \"automorphic_numbers.hs\", \"automorphic_numbers.js\", \"automorphic_numbers.java\", \"automorphic_numbers.c\", \"automorphic_numbers.cs\"], \"mathematical_algorithms/src/tower_of_hanoi\": [\"tower_of_hanoi.rs\", \"tower_of_hanoi.cpp\", \"README.md\", \"tower_of_hanoi.go\", \"tower_of_hanoi_binary_solution.c\", \"tower_of_hanoi.c\", \"tower_of_hanoi.ml\", \"tower_of_hanoi.java\", \"tower_of_hanoi.hs\", \"tower_of_hanoi.scala\", \"tower_of_hanoi.py\", \"tower_of_hanoi_iterative.c\", \"tower_of_hanoi.js\"], \"mathematical_algorithms/src/greatest_digit_in_number\": [\"greatest_digit_in_number.py\", \"greatest_digit_in_number.c\", \"greatest_digit_in_number.rb\", \"greatest_digit_in_number.js\", \"greatest_digit_in_number.cpp\", \"greatest_digit_in_number.java\", \"greatest_digit_in_number.cs\", \"greatest_digit_in_number.hs\", \"greatest_digit_in_number.php\"], \"mathematical_algorithms/src/count_digits\": [\"count_digits.py\", \"count_digits.cpp\", \"count_digits.js\", \"counts_digits.rb\", \"count_digits.c\", \"count_digits.java\", \"count_digits.go\", \"count_digits.cs\", \"count_digits.swift\", \"count_digits.hs\"], \"mathematical_algorithms/src/prime_numbers_of_n\": [\"README.md\", \"prime_numbers_of_n.cpp\", \"prime_numbers_of_n.c\", \"prime_numbers_of_n.py\"], \"mathematical_algorithms/src/lexicographic_string_rank\": [\"README.md\", \"lexicographic_string_rank.cpp\", \"lexicographic_string_rank.java\", \"lexicographic_string_rank.py\", \"lexicographic_string_rank.c\"], \"mathematical_algorithms/src/taxicab_numbers\": [\"taxicab_numbers.py\"], \"mathematical_algorithms/src/multiply_polynomial\": [\"README.md\", \"multiply_polynomial.cpp\"], \"mathematical_algorithms/src/count_trailing_zeroes\": [\"count_trailing_zeroes_factorial.py\", \"count_trailing_zeroes_factorial.js\", \"count_trailing_zeroes_factorial.java\", \"count_trailing_zeroes.c\", \"count_trailing_zeroes.scala\", \"count_trailing_zeroes_factorial.cpp\"], \"mathematical_algorithms/src/log_of_factorial\": [\"log_of_factorial.cpp\", \"log_of_factorial.py\", \"log_of_factorial.c\"], \"mathematical_algorithms/src/diophantine\": [\"diophantine.cpp\"], \"mathematical_algorithms/src/coprime_numbers\": [\"coprime_numbers.cpp\", \"coprime_numbers.go\", \"coprime_numbers.c\", \"coprime_numbers.py\", \"coprime_numbers.rb\", \"coprime_numbers.rs\", \"coprime_numbers.cs\", \"coprime_numbers.js\"], \"mathematical_algorithms/src/hill_climbing\": [\"hill_climbing.java\"], \"mathematical_algorithms/src/fermats_little_theorem\": [\"fermats_little_theorem.py\", \"fermats_little_theorem.cpp\"], \"mathematical_algorithms/src/exponentiation_power/exponentiation_by_squaring\": [\"exponentiation_by_squaring.cpp\", \"exponentiation_by_squaring.py\", \"exponentiation_by_squaring.go\", \"exponentiation_by_squaring.c\"], \"mathematical_algorithms/src/smallest_digit_in_number\": [\"smallest_digit_in_number.js\", \"smallest_digit_in_number.rb\", \"smallest_digit_in_number.php\", \"smallest_digit_in_number.py\", \"smallest_digit_in_number.cpp\", \"smallest_digit_in_number.c\", \"smallest_digit_in_number.java\", \"Smallest_digit_in_number.hs\"], \"mathematical_algorithms/src/tribonacci_numbers\": [\"tribonacci_numbers.java\", \"tribonacci_numbers.cpp\", \"tribonacci_numbers.go\", \"tribonacci_numbers.py\", \"tribonacci_numbers.rs\", \"Tribonnaci.java\", \"tribonacci_numbers.c\"], \"mathematical_algorithms/src/simpsons_rule\": [\"simpsons_rule.py\"], \"mathematical_algorithms/src/perfect_number\": [\"README.md\", \"perfect_number.java\", \"perfect_number_list.cpp\", \"perfect_number.cpp\", \"perfect_number.py\", \"perfect_number.php\", \"perfect_number.hs\", \"perfect_number.js\", \".gitignore\", \"perfect_number.rs\", \"perfect_number.rb\", \"perfect_number.c\"], \"mathematical_algorithms/src/prime_factors\": [\"sum_of_primes.cpp\", \"prime_factors.cpp\", \"prime_factors.py\", \"prime_factors.go\", \"prime_factors.c\", \"prime_factors.java\"], \"mathematical_algorithms/src/fractals\": [\"simple_julia.cpp\", \"julia_miim.cpp\"], \"mathematical_algorithms/src/modular_inverse\": [\"modular_inverse.java\", \"modular_inverse.py\", \"modular_inverse.rb\", \"modular_inverse.cpp\"], \"mathematical_algorithms/src/jacobi_method\": [\"jacobi_method.java\", \"README.md\"], \"mathematical_algorithms/src/pascal_triangle\": [\"README.md\", \"pascal_triangle.java\", \"pascal_triangle.cpp\", \"pascal_triangle.c\", \"pascal_triangle.py\", \"pascal_triangle.exs\", \"pascal_triangle.go\"], \"mathematical_algorithms/src/dfa_division\": [\"README.md\"], \"mathematical_algorithms/test\": [\"README.md\", \"test_exponentiation_by_squaring.c\"], \"sorting/src/bucket_sort\": [\"README.md\", \"bucket_sort.c\", \"bucket_sort.php\", \"bucket_sort.swift\", \"bucket_sort.cpp\", \"bucket_sort.java\", \"bucket_sort.m\", \"bucket_sort.rb\", \"bucket_sort.cs\", \"bucket_sort.go\", \"bucket_sort.py\", \"bucket_sort.js\", \"bucket_sort.hs\"], \"sorting/src/median_sort\": [\"median_sort.cs\", \"median_sort.py\", \"median_sort.swift\", \"median_sort.m\", \"median_sort.cpp\", \"median_sort_fast.cpp\"], \"sorting/src/counting_sort\": [\"README.md\", \"counting_sort.cs\", \"counting_sort.cpp\", \"counting_sort.py\", \"counting_sort.m\", \"counting_sort.java\", \"counting_sort.js\", \"counting_sort.go\", \"counting_sort.swift\", \"counting_sort.c\"], \"sorting/src/selection_sort\": [\"selection_sort.rb\", \"selection_sort.c\", \"selection_sort.rs\", \"selection_sort.php\", \"README.md\", \"selection_sort.java\", \"selection_sort.cs\", \"selection_sort.cpp\", \"selection_sort.go\", \"selection_sort.vb\", \"selection_sort.js\", \"selection_sort.swift\", \"selection_sort.hs\", \"selection_sort.sh\", \"selection_sort.m\", \"selection_sort.kt\", \"selection_sort.py\"], \"sorting/src/radix_sort\": [\"radix_sort.js\", \"README.md\", \"radix_sort.java\", \"radix_sort.c\", \"radix_sort.cpp\", \"radix_sort.hs\", \"radix_sort.py\", \"radix_sort.rs\", \"radix_sort.go\"], \"sorting/src/bubble_sort\": [\"bubble_sort.go\", \"bubble_sort.m\", \"README.md\", \"bubble_sort.c\", \"bubble_sort.php\", \"bubble_sort.cpp\", \"bubble_sort_efficient.cpp\", \"bubble_sort.kt\", \"bubble_sort.rb\", \"bubble_sort.elm\", \"bubble_sort.jl\", \"bubble_sort.ts\", \"Bubble_sort.f\", \"bubble_sort.py\", \"bubble_sort.cs\", \"bubble_sort.exs\", \"bubble_sort.swift\", \"bubble_sort.hs\", \"bubble_sort.java\", \"bubble_sort.rs\", \"bubble_sort.js\", \"bubble_sort.sh\", \"bubble_sort.sml\"], \"sorting/src/insertion_sort\": [\"insertion_sort.ml\", \"insertion_sort.js\", \"insertion_sort.go\", \"README.md\", \"insertion_sort.hs\", \"insertion_sort.swift\", \"insertion_sort.c\", \"insertion_sort.sh\", \"insertion_sort.m\", \"insertion_sort.java\", \"insertion_sort.cpp\", \"insertion_sort.cs\", \"insertion_sort.rb\", \"insertion_sort.py\", \"insertion_sort.php\", \"insertion_sort.rs\"], \"sorting/src/tree_sort\": [\"tree_sort.cpp\", \"tree_sort.js\", \"tree_sort.go\", \"tree_sort.c\", \"tree_sort.java\", \"tree_sort.py\"], \"sorting/src/shell_sort\": [\"README.md\", \"shell_sort.swift\", \"shell_sort.cpp\", \"shell_sort.py\", \"shell_sort.js\", \"shell_sort.c\", \"shell_sort.java\", \"shell_sort.m\", \"shell_sort.go\"], \"sorting/src/quick_sort\": [\"quick_sort.swift\", \"quick_sort.lua\", \"quick_sort.ts\", \"README.md\", \"quick_sort.cpp\", \"quick_sort_three_way.cpp\", \"quick_sort.rb\", \"quick_sort.hs\", \"quick_sort.elm\", \"quick_sort.rs\", \"quick_sort.py\", \"quick_sort.scala\", \"quick_sort.sh\", \"quick_sort.m\", \"quick_sort_in_place.scala\", \"quick_sort.go\", \"quick_sort.java\", \"dutch_national_flag.cpp\", \"quick_sort_median_of_medians.c\", \"quick_sort.c\", \"quick_sort.cs\", \"quick_sort.js\", \"quick_sort.ml\"], \"sorting/src/sleep_sort\": [\"sleep_sort.js\", \"sleep_sort.cpp\", \"sleep_sort.c\", \"README.md\", \"sleep_sort.jl\", \"sleep_sort.cs\", \"sleep_sort.py\", \"sleep_sort.php\", \"sleep_sort.go\", \"sleep_sort.sh\", \"sleep_sort.rb\", \"sleep_sort.swift\", \"sleep_sort.m\", \"sleep_sort.java\", \"sleep_sort.scala\"], \"sorting/src/bead_sort\": [\"README.md\", \"bead_sort.c\", \"bead_sort.java\", \"bead_sort.cpp\", \"bead_sort.cs\", \"bead_sort_numpy.py\", \"bead_sort.js\", \"bead_sort.swift\", \"bead_sort.m\", \"bead_sort.py\", \"bead_sort.php\"], \"sorting/src/stooge_sort\": [\"stooge_sort.java\", \"README.md\", \"stooge_sort.go\", \"stooge_sort.py\", \"stooge_sort.js\", \"stooge_sort.c\"], \"sorting/src/shaker_sort\": [\"shaker_sort.php\", \"README.md\", \"shaker_sort.java\", \"shaker_sort.rs\", \"shaker_sort.c\", \"shaker_sort.js\", \"shaker_sort.m\", \"shaker_sort.swift\", \"shaker_sort.cs\", \"shaker_sort.go\", \"shaker_sort.py\", \"shaker_sort.cpp\"], \"sorting/src/flash_sort\": [\"flash_sort.swift\", \"README.md\", \"flash_sort.m\", \"flash_sort.js\", \"flash_sort.c\"], \"sorting/src/comb_sort\": [\"README.md\", \"comb_sort.c\", \"comb_sort.swift\", \"comb_sort.go\", \"comb_sort.cpp\", \"comb_sort.m\", \"comb_sort.js\", \"comb_sort.java\"], \"sorting/src/topological_sort\": [\"topological_sort.java\", \"topological_sort.c\", \"topological_sort.cpp\"], \"sorting/src/gnome_sort\": [\"gnome_sort.cpp\", \"gnome_sort.java\", \"gnome_sort.c\", \"gnome_sort.m\", \"gnome_sort.swift\", \"gnome_sort.py\"], \"sorting/src/heap_sort\": [\"README.md\", \"heap_sort.sc\", \"heap_sort.cs\", \"heap_sort.rb\", \"heap_sort.py\", \"heap_sort.java\", \"heap_sort.cpp\", \"heap_sort.go\", \"heap_sort.m\", \"heap_sort.c\", \"heap_sort.js\", \"heap_sort.rs\", \"heap_sort.swift\"], \"sorting/src/intro_sort\": [\"intro_sort.cpp\", \"intro_sort.m\", \"intro_sort.swift\"], \"sorting/src/pigeonhole_sort\": [\"pigeonhole_sort.java\", \"pigeonhole_sort.cs\", \"README.md\", \"pigeonhole_sort.swift\", \"pigeonhole_sort.c\", \"pigeonhole_sort.py\", \"pigeonhole_sort.m\", \"pigeonhole_sort.cpp\", \"PigeonHoleSort.scala\"], \"sorting/src/merge_sort\": [\"merge_sort.sh\", \"README.md\", \"merge_sort.pl\", \"merge_sort.ts\", \"merge_sort.js\", \"merge_sort.php\", \"merge_sort.py\", \"merge_sort.scala\", \"merge_sort.m\", \"merge_sort.cpp\", \"merge_sort.fs\", \"merge_sort.swift\", \"merge_sort.rb\", \"merge_sort.go\", \"merge_sort.c\", \"merge_sort.rs\", \"merge_sort.cs\", \"merge_sort.java\", \"merge_sort.hs\", \"merge_sort_linked_list.c\"], \"sorting/src/bogo_sort\": [\"README.md\", \"bogo_sort.py\", \"bogo_sort.c\", \"bogo_sort.fs\", \"bogo_sort.swift\", \"bogo_sort.go\", \"bogo_sort.java\", \"bogo_sort.cpp\", \"bogo_sort.js\", \"bogo_sort.m\", \"bogo_sort.rb\"], \"sorting/src/cycle_sort\": [\"cycle_sort.m\", \"README.md\", \"cycle_sort.js\", \"cycle_sort.py\", \"cycle_sort.java\", \"cycle_sort.go\", \"cycle_sort.swift\", \"cycle_sort.cpp\", \"cycle_sort.cs\", \"cycle_sort.c\"], \"sorting/src/circle_sort\": [\"circle_sort.swift\", \"circle_sort.cs\", \"circle_sort.js\", \"circle_sort.py\", \"circle_sort.c\", \"circle_sort.cpp\", \"circle_sort.m\", \"circle_sort.java\"], \"sorting/test\": [\"test_sort.py\", \"README.md\", \"test_sort.cpp\"], \"backtracking/src/m_coloring_problem\": [\"m_coloring.py\"], \"backtracking/src/number_of_ways_in_maze\": [\"README.md\", \"no_of_ways_in_maze.rs\", \"no_of_ways_in_maze.java\", \"number_of_ways_in_maze.cpp\", \"no_of_ways_in_maze.go\", \"noOfWaysinMaze.c\"], \"backtracking/src/n_queen\": [\"n_queen.c\", \"nQueen.hs\", \"NQueen.java\", \"README.md\", \"Nqueen_Backtracking.rs\", \"nqueen.go\", \"NQueen_Backtracking.cpp\", \"nqueen_bit.go\", \"NQueen_Bitset.cpp\", \"nqueen.py\", \"NQueen_BitImp.cpp\"], \"backtracking/src/powerset\": [\"powerset.go\", \"PowerSet.java\"], \"backtracking/src/algorithm-x\": [\"README.md\", \"algo-x.cpp\"], \"backtracking/src/partitions_of_set\": [\"README.md\", \"set_partitions.go\", \"set_partitions.cpp\"], \"backtracking/src/partitions_of_number\": [\"README.md\", \"partitions_of_number.go\", \"partitions_of_number.cpp\", \"partitions_of_number.rs\"], \"backtracking/src/crossword_puzzle\": [\"CrosswordPuzzle.java\"], \"backtracking/src/rat_in_a_maze\": [\"README.md\", \"rat_in_a_maze.cpp\"], \"backtracking/src/sudoku_solve\": [\"README.md\", \"SudokuSolve.c\", \"sudoku_solve.py\", \"SudokuSolve.cpp\"], \"backtracking/src/permutations_of_string\": [\"README.md\", \"permutations_of_string.c\", \"permutations_of_string.py\", \"permutations_of_string_itertools.py\", \"permutations_of_string_stl.cpp\", \"permutations_of_string.kt\", \"permutations_of_string.go\"], \"backtracking/src/knight_tour\": [\"knight_tour.cpp\", \"README.md\", \"knight_tour.rs\", \"knight_tour.py\", \"knight_tour.go\", \"knight_tour.c\", \"knight_tour_withoutBT.c\", \"knight_tour.java\"], \"backtracking/src/subset_sum\": [\"subset_sum.cpp\", \"SubsetSum.java\", \"README.md\", \"Subset_Sum.c\", \"subset_sum.go\", \"SubsetSum.py\", \"Subset_Sum_Duplicates.py\"], \"backtracking/test\": [\"README.md\"], \"unclassified/src/jaccard_similarity\": [\"README.md\", \"jaccard.py\", \"jaccard.java\", \"jaccard.c\"], \"unclassified/src/biggest_of_n_numbers\": [\"biggest_of_n_numbers2.cpp\", \"biggest_of_n_numbers.c\", \"biggest_of_n_numbers.py\", \"biggest_of_n_numbers.cpp\"], \"unclassified/src/paint_fill\": [\"paint_fill.cpp\"], \"unclassified/src/minimum_subarray_size_with_degree\": [\"minSubarraySizeWithDegree.cpp\"], \"unclassified/src/magic_square\": [\"magic_square.py\", \"magic_square.c\", \"magic_square.swift\", \"magic_square.php\"], \"unclassified/src/average\": [\"average.rb\", \"average.es6.js\", \"average.rs\", \"average.swift\", \"average.c\", \"average.php\", \"average.cpp\", \"average.java\", \"average.go\", \"average.py\", \"average.js\", \"average.erl\", \"average.scala\", \"average.ex\"], \"unclassified/src/majority_element\": [\"majority_element.cpp\"], \"unclassified/src/leap_year\": [\"leap_year.py\", \"leap_year.cpp\", \"leap_year.c\", \"README.txt\"], \"unclassified/src/utilities\": [\"download_link.sh\", \"convert2mp3.sh\"], \"unclassified/src/spiral_printing\": [\"spiral_print.cpp\", \"spiral.c\", \"spiral_print_array.py\", \"spiral_print.go\"], \"unclassified/src/josephus_problem\": [\"josephus.c\", \"josephus.go\", \"josephus.cpp\", \"josephus.py\"], \"unclassified/src/tokenizer\": [\"tokenizer.cpp\"], \"unclassified/src/biggest_suffix\": [\"biggest_suffix.c\"], \"unclassified/src/lapindrom_checker\": [\"lapindrome_checker.py\", \"lapindrome_checker.cpp\"], \"unclassified/src/split_list\": [\"split_list.py\"], \"unclassified/src/fifteen_puzzle\": [\"readme.md\", \"fifteen.c\", \"Makefile\", \"log.txt\"], \"unclassified/test\": [\"README.md\"], \"design_pattern/src/singleton_pattern\": [\"singleton_pattern.cpp\", \"singleton_pattern.php\", \"singleton_pattern.java\"], \"design_pattern/src/observer_pattern\": [\"observer_pattern.cpp\", \"observer_pattern.rs\"], \"design_pattern/test\": [\"README.md\"], \"artificial_intelligence/src/SAT\": [\"togasat.cpp\"], \"artificial_intelligence/src/random_forests\": [\"README.md\"], \"artificial_intelligence/src/t_distributed_stochastic_neighbor_embedding\": [\"README.md\"], \"artificial_intelligence/src/nearest_sequence_memory/nsm_MATLAB\": [\"simulator.m\", \"nsm_agent.m\", \"main.m\"], \"artificial_intelligence/src/factorization_machines\": [\"README.md\"], \"artificial_intelligence/src/principal_component_analysis\": [\"README.md\", \"pca.py\"], \"artificial_intelligence/src/naive_bayes\": [\"README.md\", \"naive_bayes.swift\"], \"artificial_intelligence/src/DBSCAN_Clustering\": [\"readme.md\", \"dbscan.py\"], \"artificial_intelligence/src/TSP\": [\"euc_500\", \"noneuc_250\", \"euc_100\", \"salesman.cpp\", \"algo.md\", \"euc_250\", \"noneuc_100\", \"Makefile\", \"noneuc_500\"], \"artificial_intelligence/src/hierachical-clustering\": [\"README.md\", \"hierachical_clustering.cpp\"], \"artificial_intelligence/src/decision_tree\": [\"data_banknote_authentication.csv\", \"decision_tree.py\"], \"artificial_intelligence/src/k_Nearest_Neighbours\": [\"iris.data\", \"k_Nearest_Neighbours.py\"], \"artificial_intelligence/src/ISODATA_Clustering\": [\"readme.md\", \"ISODATA.py\"], \"artificial_intelligence/src/q_learning\": [\"README.md\", \"qLearning.js\"], \"artificial_intelligence/src/neural_network\": [\"neuralnetwork.py\"], \"artificial_intelligence/src/Logistic_Regression\": [\"README.md\", \"Logistic_Regression.py\"], \"artificial_intelligence/src/gradient_boosting_trees\": [\"README.md\"], \"artificial_intelligence/src/support_vector_machine\": [\"README.md\"], \"artificial_intelligence/src/k_means\": [\"README.md\", \"k_means.py\", \"k_means.cpp\", \"k_means.swift\"], \"artificial_intelligence/src/gaussian_mixture_model\": [\"README.md\"], \"artificial_intelligence/src/restricted_boltzmann_machine\": [\"README.md\"], \"artificial_intelligence/src/Linear_Regression\": [\"linear_regression.py\", \"README.md\", \"LinearRegression.java\", \"linearRegression.js\", \"linear_regression.swift\"], \"artificial_intelligence/test\": [\"README.md\"], \"utility/src/palindrome/palindrome_check\": [\"palindrome_check.cpp\", \"palindrome_check.rb\"], \"utility/test/palindrome/palindrome_check\": [\"README.md\", \"test_palindrome_check.cpp\"], \"graph_algorithms/src/kruskal_minimum_spanning_tree\": [\"README.md\", \"kruskal_minimum_spanning_tree.c\", \"kruskal_minimum_spanning_tree.java\", \"kruskal_minimum_spanning_tree.py\", \"kruskal_minimum_spanning_tree.cpp\"], \"graph_algorithms/src/biconnected_components\": [\"README.md\", \"biconnected_components.java\", \"biconnected_components.cpp\"], \"graph_algorithms/src/fleury_algorithm_euler_path\": [\"README.md\"], \"graph_algorithms/src/bridges_in_graph\": [\"README.md\", \"bridges.cpp\"], \"graph_algorithms/src/eulerian_path\": [\"README.md\", \"eulerian.py\", \"eulerian.java\"], \"graph_algorithms/src/boruvka_minimum_spanning_tree\": [\"boruvka_minimum_spanning_tree.cpp\", \"README.md\"], \"graph_algorithms/src/adjacency_lists_graph_representation/adjacency_lists_in_C\": [\"main.c\", \"lgraph_struct.c\", \"lgraph_stack.h\", \"lgraph_stack.c\", \"README.MD\", \"lgraph_struct.h\"], \"graph_algorithms/src/hamiltonian_cycle\": [\"hamiltonian_cycle.py\", \"README.md\"], \"graph_algorithms/src/connected_components\": [\"connected_components.c\"], \"graph_algorithms/src/bron_kerbosch_algorithm\": [\"bron_kerbosch.java\"], \"graph_algorithms/src/channel_assignment\": [\"README.md\"], \"graph_algorithms/src/floyd_warshall_algorithm\": [\"floydWarshall.c\", \"README.md\", \"floyd_warshall.cpp\", \"floyd_warshall.py\", \"FloydWarshall.java\"], \"graph_algorithms/src/astar_algorithm\": [\"astar.js\"], \"graph_algorithms/src/graph_coloring\": [\"README.md\", \"graph_color_greedy.py\", \"graph_coloring.cpp\", \"graph_coloring.java\"], \"graph_algorithms/src/hamiltonian_path\": [\"hamiltonian_path.cpp\"], \"graph_algorithms/src/kuhn_maximum_matching\": [\"kuhn_maximum_matching.cpp\"], \"graph_algorithms/src/breadth_first_search\": [\"bfs.rb\", \"breadth_first_search.py\", \"bfs.c\", \"README.md\", \"breadth_first_search.swift\", \"Bfs.java\", \"bfs.cpp\"], \"graph_algorithms/src/cut_vertices\": [\"README.md\", \"cut_vertices.cpp\"], \"graph_algorithms/src/longest_path_directed_acyclic_graph\": [\"README.md\", \"longest_path_directed_acyclic_graph.cpp\"], \"graph_algorithms/src/dijkstra_shortest_path\": [\"README.md\", \"dijkstra.cpp\", \"Dijkstra_Algorithm.c\", \"dijkstra_gnu_fast.cpp\", \"Dijkstra.py\", \"dijkstra_efficient.py\"], \"graph_algorithms/src/bridge_tree\": [\"bridge_tree.cpp\"], \"graph_algorithms/src/travelling_salesman_mst\": [\"README.md\", \"Travelling_salesman.cpp\", \"travelling_salesman.py\"], \"graph_algorithms/src/prim_minimum_spanning_tree\": [\"prim_minimum_spanning_tree.py\", \"README.md\", \"prim_minimum_spanning_tree.cpp\", \"prim_minimum_spanning_tree.c\"], \"graph_algorithms/src/cycle_directed_graph\": [\"cycle_directed_graph.cpp\", \"README.md\", \"cycle_directed_graph.py\", \"cycle_directed_graph.c\", \"cycle_directed_detection.c\"], \"graph_algorithms/src/data_structures/adjacency_matrix_C\": [\"main.c\", \"mgraph_struct.c\", \"mgraph_struct.h\"], \"graph_algorithms/src/strongly_connected_components\": [\"README.md\", \"strongly_connected_components.cpp\", \"strongly_connected_components.py\"], \"graph_algorithms/src/Bipartite_check\": [\"Bipartite_check.java\"], \"graph_algorithms/src/tarjan_algorithm_strongly_connected_components\": [\"README.md\", \"tarjan_algorithm.c\"], \"graph_algorithms/src/maximum_bipartite_matching\": [\"README.md\", \"max_bipartite_matching.py\"], \"graph_algorithms/src/topological_sort\": [\"README.md\", \"topological_sort_adjacency_list2.java\", \"topological_sort.hs\", \"topological_sort_adjacency_matrix.java\", \"topological_sort.py\", \"kahn_algo_unique_toposort.cpp\", \"topological_sort_adjacency_matrix2.java\", \"print_all_topological_sorts.cpp\", \"topological_sort_adjacency_list.java\", \"topological_sort.c\", \"topological_sort.cpp\"], \"graph_algorithms/src/vertex_cover\": [\"README.md\"], \"graph_algorithms/src/cycle_undirected_graph\": [\"CheckCycle.java\", \"README.md\", \"cycleGraph.cpp\", \"cycle_undirected_graph.py\", \"cycle_using_union_find_datastructure.cpp\"], \"graph_algorithms/src/postorder_from_inorder_and_preorder\": [\"inprepost.cpp\"], \"graph_algorithms/src/hopcroft_karp_algorithm\": [\"README.md\"], \"graph_algorithms/src/minimum_s_t_cut\": [\"README.md\"], \"graph_algorithms/src/dinic_maximum_flow\": [\"dinic_maximum_flow.cpp\"], \"graph_algorithms/src/shortest_path_k_edges\": [\"README.md\"], \"graph_algorithms/src/karger_minimum_cut\": [\"karger.java\", \"README.md\"], \"graph_algorithms/src/ford_fulkerson_maximum_flow\": [\"ford_fulkerson_using_bfs.py\", \"README.md\", \"ford_fulkerson.cpp\", \"FordFulkersonUsingBfs.java\", \"ford_fulkerson_using_bfs.cpp\"], \"graph_algorithms/src/left_view_binary_tree\": [\"left_view_binary_tree.cpp\", \"left_view_binary.py\"], \"graph_algorithms/src/bipartite_checking\": [\"README.md\", \"bipartite_checking.cpp\", \"bipartite.cpp\", \"bipartite_bfs.java\", \"bipartite_graph_checked_adjacency_list.java\"], \"graph_algorithms/src/count_of_ways_n\": [\"Count_of_ways_n.cpp\"], \"graph_algorithms/src/depth_first_search\": [\"README.md\", \"depth_first_search.py\", \"dfs.go\", \"Dfs.kt\", \"dfs.c\", \"dfs.rb\", \"Dfs.java\", \"dfs.cpp\"], \"graph_algorithms/src/johnson_algorithm_shortest_path\": [\"README.md\", \"johnsons_algo.py\"], \"graph_algorithms/src/centroid_decomposition\": [\"centroid_decomposition.java\"], \"graph_algorithms/src/steiner_tree\": [\"steiner_tree.java\"], \"graph_algorithms/src/transitive_closure_graph\": [\"README.md\", \"transitive_closure_graph_floyd_warshall.cpp\", \"transitive_closure_graph.py\", \"transitive_closure.cpp\"], \"graph_algorithms/src/bellman_ford_algorithm\": [\"README.md\", \"bellman_ford.py\", \"bellman_ford.c\", \"bellman_ford.php\", \"bellman_ford_adjacency_list.java\", \"bellman_ford_edge_list.java\", \"bellman_ford.cpp\"], \"graph_algorithms/src/maximum_edge_disjoint_paths\": [\"README.md\"], \"graph_algorithms/test\": [\"README.md\"], \"compression/src/lossless_compression/lempel-ziv-welch\": [\"README.md\", \"lzw.cpp\", \"lzw.py\"], \"compression/src/lossless_compression/huffman\": [\"README.md\", \"huffman.cpp\"], \"compression/src/lossy_compression\": [\"README.md\"], \"compression/test/lossless_compression/huffman\": [\"test_huffman.cpp\"], \"square_root_decomposition/src/MOs_Algorithm\": [\"MOs_Algorithm.cpp\"], \"square_root_decomposition/test\": [\"README.md\"], \"cryptography/src/runningkey_cipher\": [\"runningkey.py\"], \"cryptography/src/columnar_transposition_cipher\": [\"columnar_transposition.cpp\"], \"cryptography/src/affine_cipher\": [\"affine_cipher.py\", \"affine.cpp\", \"affine.htm\", \"affine.py\", \"Affine.java\"], \"cryptography/src/aes_128/aes_csharp/example\": [\"README.md\", \"StreamCipherException.cs\", \"StreamCipher.cs\"], \"cryptography/src/autokey_cipher\": [\"autokey.py\"], \"cryptography/src/rail_fence_cipher\": [\"rail_fence.py\", \"rail_fence.rb\", \"rail_fence.cpp\"], \"cryptography/src/caesar_cipher\": [\"caesar_cipher.js\", \"caesar_cipher.rb\", \"caesar_cipher.java\", \"README.md\", \"caesar_cipher.go\", \"caesar_cipher.cpp\", \"caesar_cipher.cs\", \"decryption.cpp\", \"caesar_cipher.hs\", \"caesar_cipher.php\", \"caesar_cipher.py\", \"caesar_cipher.c\", \"encryption.cpp\"], \"cryptography/src/vigenere_cipher\": [\"README.md\", \"vigenere_cipher.jl\", \"vigenere_cipher.js\", \"vigenere_cipher.c\", \"vigenere_cipher.go\", \"vigenere_cipher.cpp\", \"vigenere_cipher.php\", \"vigenere_cipher.py\", \"vigenere_cipher.java\", \"vigenere_cipher.rb\", \"vigenere_cipher.hs\"], \"cryptography/src/rot13_cipher\": [\"rotN.js\", \"rotN.cpp\", \"README.md\", \"rot13.py\", \"rotN.c\", \"rot13.js\", \"rot13.rb\", \"rotN.java\", \"rot13.sh\", \"rot13.cpp\"], \"cryptography/src/polybius_cipher\": [\"polybius.py\"], \"cryptography/src/porta_cipher\": [\"porta.py\"], \"cryptography/src/atbash_cipher\": [\"README.md\", \"atbash_cipher.py\", \"atbash_cipher.cpp\"], \"cryptography/src/morse_cipher\": [\"morse_code_translator.js\", \"morse_code.sh\", \"README.md\", \"morse_code_translator.ts\", \"morse_code_translator.php\", \"morse_code_generator.c\", \"morse_code_generator.cpp\", \"morse_code_translator.cpp\", \"morse_code_translator.py\", \"morse_code_generator.rb\", \"morse_code_generator.bf\", \"morse_code.java\", \"morse_code_translator.lua\"], \"cryptography/src/rsa_digital_signature\": [\"rsa_digital_signature.ipynb\"], \"cryptography/src/baconian_cipher\": [\"baconian.py\", \"README.md\", \"baconian.php\", \"baconian.rb\", \"baconian.java\"], \"cryptography/src/rsa\": [\"rsa.py\", \"rsa_input.in\", \"rsa.cs\", \"RSA.java\", \"rsa.c\"], \"cryptography/src/huffman_encoding\": [\"huffman_encoding.c\"], \"cryptography/test\": [\"README.md\"], \"bit_manipulation/src/lonely_integer\": [\"lonely_integer.rs\", \"README.md\", \"lonelyInteger.cpp\", \"lonelyInteger.py\", \"LonelyInt.js\", \"LonelyInteger.c\", \"lonelyInteger.go\", \"LonelyInt.java\"], \"bit_manipulation/src/sum_binary_numbers\": [\"README.md\", \"sum_binary_numbers.c\"], \"bit_manipulation/src/byte_swapper\": [\"ByteSwapper.java\"], \"bit_manipulation/src/flip_bits\": [\"flippingbits.py\", \"README.md\", \"FlipBits.java\", \"flippingbits.cpp\", \"flippingbits.c\"], \"bit_manipulation/src/sum_equals_xor\": [\"README.md\", \"sum_equals_xor.cpp\", \"sum_equals_xor.py\", \"sum_equals_xor.c\"], \"bit_manipulation/src/thrice_unique_number\": [\"thrice_unique_number.js\", \"README.md\", \"uniqueNumber.py\", \"threeUnique.cpp\", \"ThriceUniqueNumber.java\"], \"bit_manipulation/src/power_of_2\": [\"PowerOf2.cs\", \"power_of_2.jl\", \"power_of_2.go\", \"power_of_2.c\", \"PowerOf2.java\", \"power_of_2.cpp\", \"power_of_2.py\", \"power_of_2.rs\", \"power_of_2.js\"], \"bit_manipulation/src/twice_unique_number\": [\"README.md\", \"two_unique_numbers.c\", \"two_unique_numbers.cpp\"], \"bit_manipulation/src/maximum_xor_value\": [\"README.md\", \"max_xor_value.cpp\"], \"bit_manipulation/src/bit_division\": [\"README.md\", \"BitDivision.java\", \"bitDivision.c\", \"bitDivison.py\", \"bitDivision.go\", \"bitDivision.js\"], \"bit_manipulation/src/count_set_bits\": [\"README.md\", \"countSetBits.js\", \"count_set_bits.c\", \"CountSetBits.java\", \"count_set_bits.py\", \"count_set_bits.cpp\", \"count_set_bits_lookup_table.cpp\"], \"bit_manipulation/src/invert_bit\": [\"invert_bit.py\", \"invert_bit.cpp\", \"invert_bit.c\"], \"bit_manipulation/src/magic_number\": [\"magic_number.java\", \"README.md\", \"magic_number.py\", \"magic_number.c\", \"nth_magic_number.cpp\"], \"bit_manipulation/src/hamming_distance\": [\"README.md\", \"hamming_distance.java\", \"hamming_distance2.py\", \"hamming_distance.py\", \"hamming_distance.c\", \"hamming_distance.cpp\"], \"bit_manipulation/src/xor_swap\": [\"README.md\", \"xor_swap.c\", \"xor_swap.cpp\", \"xor_swap.py\", \"xorSwap.go\"], \"bit_manipulation/src/subset_generation\": [\"README.md\", \"subsetgeneratorusingbit.cpp\", \"subset_mask_generator.cpp\", \"subsetsum.cpp\"], \"bit_manipulation/src/convert_number_binary\": [\"convert_number_binary.hs\", \"convert_number_binary.php\", \"README.md\", \"convert_number_binary.c\", \"ConvertNumberBinary.java\", \"convert_number_binary.js\", \"convert_number_binary.cpp\", \"intToBinary.py\", \"binary_to_int.py\"], \"bit_manipulation/test\": [\"README.md\"]}" }, { "path": "requirements.txt", "content": "certifi==2017.11.5\nchardet==3.0.4\nDjango==1.11.7\nflake8==3.5.0\ngitdb2==2.0.3\nGitPython==2.1.7\ngunicorn==19.7.1\nidna==2.6\npytz==2017.3\nrequests==2.18.4\nsmmap2==2.0.3\nurllib3==1.22\npep8==1.7.1\npython-decouple==3.1\ngoogle-api-python-client\nnewsapi-python\n" }, { "path": "runtime.txt", "content": "python-3.6.2\n" }, { "path": "scripts/develop.sh", "content": "################################################################################\n# helper functions\n################################################################################\nassert()\n{\n actual_error_code=$?\n\n expect_error_code=0\n if [ $# != 0 ]; then\n expect_error_code=$1\n fi\n\n if [ $actual_error_code -ne $expect_error_code ]; then\n echo \"exit ($actual_error_code)\"\n exit 1\n fi\n}\n\n\n################################################################################\n# test version of python and pip\n################################################################################\nPIP=`which pip3`\nassert\nPYTHON=`which python3`\nassert\n\n################################################################################\n# test venv\n################################################################################\nif [ \"$VIRTUAL_ENV\" == '' ]; then\n echo \"Please run as venv:\"\n echo \" PYTHON -m venv env\"\n\n # help to create venv\n echo \"Type the venv-name if you want to create venv, or type Ctrl+C to exit.\"\n name=''\n while [ \"$name\" == '' ]\n do\n read name\n done\n\n # test venv folder is existed or not\n tmp=`ls $name 2>/dev/null`\n if [ $? == 0 ]; then\n echo \"Are you want to override the '$name'? (y/n [n])\"\n read answer\n\n if [ \"$answer\" != 'y' ] && [ \"$answer\" != 'yes' ]; then\n echo \"not overwritten\"\n exit 0\n else\n rm -rf $name\n fi\n fi\n\n\n echo \"Creating venv ...\"\n $PYTHON -m venv $name\n echo \"Please type following command and run this script again:\"\n echo \" source $name/bin/activate\"\n exit 1\nfi\n\n################################################################################\n# main\n################################################################################\n\ntmp=`ls \\.env 2>/dev/null`\nif [ $? == 1 ]; then\n cp .env.example .env\nfi\n$PIP install -r requirements.txt\n$PYTHON manage.py createcachetable\n$PYTHON manage.py collectstatic\n$PYTHON manage.py migrate\n\necho\necho \"Run server by following command:\"\necho \" $PYTHON manage.py runserver\"\n" }, { "path": "search/__init__.py", "content": "" }, { "path": "search/admin.py", "content": "from django.contrib import admin # noqa\nfrom search.models import News\n# Register your models here.\nadmin.site.register(News)\n" }, { "path": "search/apps.py", "content": "from django.apps import AppConfig\n\n\nclass SearchConfig(AppConfig):\n name = 'search'\n" }, { "path": "search/migrations/0001_initial.py", "content": "# -*- coding: utf-8 -*-\n# Generated by Django 1.11.7 on 2018-06-14 15:31\nfrom __future__ import unicode_literals\n\nfrom django.db import migrations, models\n\n\nclass Migration(migrations.Migration):\n\n initial = True\n\n dependencies = [\n ]\n\n operations = [\n migrations.CreateModel(\n name='News',\n fields=[\n ('id', models.AutoField(auto_created=True, primary_key=True, serialize=False, verbose_name='ID')),\n ('author', models.CharField(max_length=100)),\n ('title', models.CharField(max_length=100)),\n ('description', models.CharField(max_length=200)),\n ('url', models.URLField()),\n ('urlToImage', models.URLField()),\n ],\n ),\n ]\n" }, { "path": "search/migrations/__init__.py", "content": "" }, { "path": "search/models.py", "content": "from django.db import models # noqa\n\n# Create your models here.\n\n\nclass News(models.Model):\n author = models.CharField(max_length=100)\n title = models.CharField(max_length=100)\n description = models.CharField(max_length=200)\n url = models.URLField(max_length=200)\n urlToImage = models.URLField(max_length=200)\n" }, { "path": "search/templatetags/__init__.py", "content": "" }, { "path": "search/templatetags/calculator.py", "content": "import math\n\n\n# expression computation\nclass Stack:\n def __init__(self):\n self.item = []\n\n def isEmpty(self):\n return self.item == []\n\n def push(self, T):\n self.item.insert(0, T)\n\n def pop(self):\n return self.item.pop(0)\n\n def peek(self):\n return self.item[0]\n\n def size(self):\n return len(self.item)\n\n\ndef isMathExpression(expr, op_math):\n token = []\n i = 0\n while i < len(expr):\n if expr[i] == ' ':\n i += 1\n elif expr[i] == '+' and ((len(token) > 0 and token[-1] == '(') or i == 0):\n token.append('u+')\n i += 1\n elif expr[i] == '-' and ((len(token) > 0 and token[-1] == '(') or i == 0):\n token.append('u-')\n i += 1\n\n elif expr[i].isdigit() or expr[i] == '.':\n j = i\n flot = 0\n while j < len(expr) and (expr[j].isdigit() or expr[j] == '.'):\n if expr[j] == '.':\n if flot == 0:\n flot = 1\n else:\n return False\n j += 1\n try:\n val = int(expr[i:j])\n except ValueError:\n val = float(expr[i:j])\n token.append(val)\n i = j\n\n elif expr[i] == '(' and len(token) > 0 and \\\n (str(token[-1]).isdigit() or isinstance(token[-1], float) or token[-1] == ')'):\n token.append('*')\n\n elif expr[i] == '(' or expr[i] == ')' or expr[i] == '+' or \\\n expr[i] == '*' or expr[i] == '-' or expr[i] == '/' or \\\n expr[i] == '%' or expr[i] == '^':\n token.append(expr[i])\n i += 1\n\n elif expr[i] == 'x' or expr[i] == 'X':\n token.append('*')\n i += 1\n\n elif expr[i:i + 5].lower() in op_math:\n token.append(expr[i:i + 5].lower())\n if i + 5 >= len(expr):\n return False\n elif expr[i + 5] != '(':\n return False\n i += 5\n\n elif expr[i:i + 4].lower() in op_math:\n token.append(expr[i:i + 4].lower())\n if i + 4 >= len(expr):\n return False\n elif expr[i + 4] != '(':\n return False\n i += 4\n\n elif expr[i:i + 3].lower() in op_math:\n token.append(expr[i:i + 3].lower())\n if i + 3 >= len(expr):\n return False\n elif expr[i + 3] != '(':\n return False\n i += 3\n\n else:\n return False\n return token\n\n\ndef calculate(val1, val2, op):\n if op == 'u-':\n return -val1\n if op == 'u+':\n return val1\n if op == '^':\n return math.pow(val1, val2)\n if op == '+':\n return val1 + val2\n if op == '-':\n return val1 - val2\n if op == '*':\n return val1 * val2\n if op == '/':\n return val1 / val2\n if op == '%':\n return val1 % val2\n if op == 'sin':\n return math.sin(val1)\n if op == 'cos':\n return math.cos(val1)\n if op == 'tan':\n return math.tan(val1)\n if op == 'cot':\n return 1 / math.tan(val1)\n if op == 'cosec':\n return 1 / math.sin(val1)\n if op == 'sec':\n return 1 / math.cos(val1)\n if op == 'exp':\n return math.exp(val1)\n if op == 'sqrt':\n return math.sqrt(val1)\n if op == 'log':\n return math.sqrt(val1)\n\n\ndef check_precedence(opr, i, op_precdn, op_math):\n if opr in op_precdn and i in op_math:\n return True\n if op_precdn.index(opr) <= 2:\n return True\n if op_precdn.index(opr) <= 5:\n return op_precdn.index(i) > 2\n else:\n return op_precdn.index(i) > 5\n\n\ndef evaluate(tokens, op_precdn, op_math):\n value = Stack()\n operator = Stack()\n open_bracket = 0\n for i in tokens:\n if i == '(':\n open_bracket = open_bracket + 1\n operator.push(i)\n elif i == ')':\n if open_bracket > 0:\n while operator.peek() != '(':\n opr = operator.pop()\n if opr in op_math or opr == 'u+' or opr == 'u-':\n try:\n val = value.pop()\n value.push(calculate(val, -1, opr))\n except IndexError:\n return False\n elif opr in op_precdn:\n try:\n val2 = value.pop()\n val1 = value.pop()\n value.push(calculate(val1, val2, opr))\n except IndexError:\n return False\n operator.pop()\n open_bracket -= 1\n else:\n return False\n elif i not in op_math and i not in op_precdn:\n value.push(i)\n else:\n if operator.isEmpty():\n operator.push(i)\n else:\n opr = operator.peek()\n if opr == '(':\n operator.push(i)\n elif opr in op_math or opr == 'u+' or opr == 'u-':\n if not value.isEmpty():\n try:\n val = value.pop()\n operator.pop()\n operator.push(i)\n value.push(calculate(val, -1, opr))\n except IndexError:\n return False\n elif opr in op_precdn:\n if value.size() > 1:\n if check_precedence(opr, i, op_precdn, op_math) and \\\n not ((i == '^' or i in op_math) and opr == '^'):\n try:\n val2 = value.pop()\n val1 = value.pop()\n operator.pop()\n value.push(calculate(val1, val2, opr))\n except IndexError:\n return False\n operator.push(i)\n else:\n operator.push(i)\n else:\n operator.push(i)\n else:\n return False\n\n while value.size() != 0 and operator.size() != 0:\n opr = operator.peek()\n if opr in op_math or opr == 'u+' or opr == 'u-':\n val = value.pop()\n operator.pop()\n try:\n value.push(calculate(val, -1, opr))\n except IndexError:\n return False\n else:\n if value.size() > 1:\n try:\n val2 = value.pop()\n val1 = value.pop()\n operator.pop()\n value.push(calculate(val1, val2, opr))\n except IndexError:\n return False\n else:\n break\n\n if value.size() == 1 and operator.size() == 0:\n return value.peek()\n else:\n return False\n\n\ndef getResult(expr):\n op_precdn = ['u+', 'u-', '^', '/', '*', '%', '+', '-']\n op_math = ['sin', 'cos', 'cosec', 'tan', 'sec', 'cot', 'exp', 'sqrt', 'log']\n tokens = isMathExpression(expr, op_math)\n if tokens:\n return round(evaluate(tokens, op_precdn, op_math), 3)\n else:\n return None\n" }, { "path": "search/templatetags/random_numbers.py", "content": "import random\nfrom django import template\n\nregister = template.Library()\n\n\n@register.simple_tag\ndef random_int(a, b=None):\n if b is None:\n a, b = 0, a\n return random.randint(a, b)\n\n\n@register.filter\ndef modulo(num, val):\n return num % val\n" }, { "path": "search/templatetags/youtube.py", "content": "import requests\nfrom apiclient.discovery import build\nimport json\nfrom cosmos_search.settings import YOUTUBE_DATA_API_KEY\nfrom django.core.cache import cache\n\nYOUTUBE_API_SERVICE_NAME = \"youtube\"\nYOUTUBE_API_VERSION = \"v3\"\n\n\ndef fetchJson(url):\n cached = cache.get(url)\n if not cached:\n return False\n else:\n return cached\n\n\ndef youtube_search(options):\n global videos_Results\n videos_Results = []\n if not options['nextpage']:\n videos_Results = []\n content_details = \"https://www.googleapis.com/youtube/v3/videos?part=contentDetails&\"\n SEARCH = \"https://www.googleapis.com/youtube/v3/search?\"\n youtube = build(YOUTUBE_API_SERVICE_NAME, YOUTUBE_API_VERSION,\n developerKey=YOUTUBE_DATA_API_KEY)\n i = int(options['id'])\n url = (SEARCH + 'q=' + options['q'] +\n '&part=id,snippet&maxResults=' +\n str(options['max_results']) + '&pageToken=' +\n options['nextpage'] + '&type=video&videoEmbeddable=true&key=' + YOUTUBE_DATA_API_KEY)\n\n search_response = fetchJson(url)\n if not search_response:\n search_response = youtube.search().list(\n q=options['q'],\n part=\"id, snippet\",\n maxResults=options['max_results'],\n pageToken=options['nextpage'],\n type='video',\n videoEmbeddable='true',\n ).execute()\n if search_response:\n cache.set(url, search_response)\n nextpage = search_response.get('nextPageToken')\n for search_result in search_response.get(\"items\", []):\n if search_result['id']['kind'] == 'youtube#video':\n q = {\n 'id': search_result['id']['videoId'],\n 'key': YOUTUBE_DATA_API_KEY\n }\n d = fetchJson(content_details + '&id=' + q['id'] + '&key=' + q['key'])\n if d:\n content = json.loads(d)\n else:\n response = requests.get(content_details, q)\n if response.ok:\n cache.set(response.url, response.content.decode('utf-8'))\n content = json.loads(response.content.decode('utf-8'))\n\n content = list(content['items'])\n durationh = content[0]['contentDetails']['duration'].split('PT')[-1].split('H')\n if len(durationh) > 1:\n h = durationh[0]\n H = durationh[1]\n else:\n h = 0\n H = durationh[0]\n durationm = H.split('M')\n if len(durationm) > 1:\n m = durationm[0]\n M = durationm[1]\n else:\n m = 0\n M = durationm[0]\n durations = M.split('S')\n\n if len(durations) > 1:\n s = durations[0]\n else:\n s = 0\n duration = str(h) + \":\" + str(m) + \":\" + str(s)\n pdate = search_result['snippet']['publishedAt'].split(\"T\")[0]\n ptime = search_result['snippet']['publishedAt'].split(\"T\")[1].split(\".\")[0]\n res = {\n 'id': i,\n 'title': search_result['snippet']['title'],\n 'videoId': search_result['id']['videoId'],\n 'description': search_result['snippet']['description'],\n 'image': search_result['snippet']['thumbnails']['high']['url'],\n 'embed': \"https://www.youtube.com/embed/\" + search_result['id']['videoId'],\n 'date': pdate,\n 'time': ptime,\n 'duration': duration\n }\n\n videos_Results.append(res)\n i += 1\n\n return {'videos_Results': videos_Results, 'nextpage': nextpage}\n" }, { "path": "search/tests.py", "content": "from django.test import TestCase # noqa\n\n# Create your tests here.\n" }, { "path": "search/urls.py", "content": "from django.conf.urls import url\nfrom search import views\n\nurlpatterns = [\n url(r'^$', views.index, name='index'),\n url(r'^tags/', views.tags, name='tags'),\n url(r'^news/', views.news, name='news'),\n url(r'^lists/$', views.lists, name='lists'),\n url(r'^lists/(?P[\\w\\-]+)/$', views.lists_template, name='lists_template'),\n url(r'^query/', views.query, name='query'),\n url(r'^display', views.display, name='display'),\n url(r'^calculator/', views.calculator, name='calculator'),\n]\n" }, { "path": "search/views.py", "content": "from django.http import HttpResponse\nfrom django.shortcuts import render\nfrom django.core.paginator import Paginator, EmptyPage, PageNotAnInteger\nfrom django.conf import settings\nimport json\nimport random\nfrom random import shuffle\nimport re\nfrom newsapi import NewsApiClient\nimport requests\nfrom requests.exceptions import ConnectionError, ConnectTimeout\nfrom search.models import News\nfrom search.templatetags.calculator import getResult as calculate\nfrom search.templatetags.youtube import youtube_search\n\nCOSMOS_SEP = '_'\n\n# Create your views here\n\n\ndef lists_template(request, foo):\n f = open(settings.LISTS_MD + foo + '.md', 'r', encoding='utf8')\n md = f.read()\n title = foo.replace(\"-\", \" \").title()\n args = {'md': md, 'title': title}\n return render(request, 'cosmos/lists_template.html', args)\n\n\ndef lists(request):\n f = open(settings.LISTS_INFO, 'r', encoding='utf8')\n lists = list(json.load(f))\n args = {\"lists\": lists}\n return render(request, 'cosmos/lists.html', args)\n\n\ndef dicToQueries(headlines, queries):\n count = 1\n for item in headlines[\"articles\"]:\n for key, value in item.items():\n if key == \"title\":\n if value is None:\n queries.filter(id=count).update(title=\"None\")\n else:\n queries.filter(id=count).update(title=value)\n if key == \"description\":\n if value is None:\n queries.filter(id=count).update(description=\"None\")\n else:\n queries.filter(id=count).update(description=value)\n if key == \"author\":\n if value is None:\n queries.filter(id=count).update(author=\"None\")\n else:\n queries.filter(id=count).update(author=value)\n if key == \"url\":\n queries.filter(id=count).update(url=value)\n if key == \"urlToImage\":\n if value is None:\n queries.filter(id=count).update(urlToImage=\"None\")\n else:\n queries.filter(id=count).update(urlToImage=value)\n count += 1\n return queries\n\n\n# News Page\n\n\ndef news(request):\n try:\n queries_list = News.objects.all()\n api = NewsApiClient(api_key=settings.NEWS_API_KEY)\n headlines = api.get_everything(\n sources='techcrunch, the-verge', domains=\"techcrunch.com, theverge.com\", language='en')\n if len(queries_list) == 0:\n for item in headlines[\"articles\"]:\n temp = News(author=item[\"author\"], title=item[\"title\"],\n description=item[\"description\"], url=item[\"url\"], urlToImage=item[\"urlToImage\"])\n temp.save()\n queries_list = News.objects.all()\n args = {\"queries\": queries_list}\n if headlines[\"status\"] == \"ok\":\n modified_queries = dicToQueries(headlines, queries_list)\n paginator = Paginator(modified_queries, 7)\n else:\n paginator = Paginator(queries_list, 7)\n page = request.GET.get('page')\n try:\n queries = paginator.page(page)\n except PageNotAnInteger:\n # If page is not an integer, deliver first page.\n queries = paginator.page(1)\n except EmptyPage:\n # If page is out of range (e.g. 9999), deliver last page of results.\n queries = paginator.page(paginator.num_pages)\n args = {\"queries\": queries}\n return render(request, 'cosmos/news.html', args)\n except ConnectionError:\n return render(request, 'cosmos/news.html', args)\n except ConnectTimeout:\n return render(request, 'cosmos/news.html', args)\n\n\n# Tags page for users\n\n\ndef tags(request):\n f = open(settings.TAGS_JSON, 'r')\n jsonL = sorted(list(json.load(f)))\n args = {\"tags\": jsonL}\n return render(request, 'cosmos/tags.html', args)\n\n# To prefill the searchbar\n\n\ndef get_random_tag():\n jsonFile = open(settings.TAGS_JSON, 'r')\n algo_list = json.load(jsonFile)\n r_no = random.randint(0, len(algo_list) - 1)\n algo_tag = algo_list[r_no]\n return algo_tag\n\n\ndef searchSuggestion(request):\n jsonFile = open(settings.TAGS_JSON, 'r')\n algo_list = json.load(jsonFile)\n results = []\n if request.is_ajax():\n val = request.GET.get('term', '')\n filterData = []\n for word in algo_list:\n if word.startswith(val):\n filterData.append(word)\n i = 0\n for tag in filterData:\n tag_json = {}\n tag_json['id'] = filterData.index(tag)\n tag_json['label'] = tag\n tag_json['value'] = tag\n results.append(tag_json)\n i = i + 1\n if i >= 6:\n break\n searchTag = json.dumps(results)\n else:\n searchTag = 'fail'\n return searchTag\n\n\ndef index(request):\n randomTags = []\n for i in range(4):\n randomTags.append(get_random_tag())\n query = get_random_tag()\n algo = searchSuggestion(request)\n if request.is_ajax():\n mimetype = 'application/json'\n return HttpResponse(algo, mimetype)\n return render(request, 'cosmos/index.html', {'query': query, 'random': randomTags})\n\n\n# Handlers for error pages\ndef error400(request):\n return render(request, 'cosmos/error/HTTP400.html')\n\n\ndef error403(request):\n return render(request, 'cosmos/error/HTTP403.html')\n\n\ndef error404(request):\n return render(request, 'cosmos/error/HTTP404.html')\n\n\ndef error500(request):\n return render(request, 'cosmos/error/HTTP500.html')\n\n\ndef is_file_extension_ignored(file_):\n return file_.split('.')[-1] in ['md', 'MD']\n\n\ncodes = None\nvideos = None\nexpression_result = None\n\n\ndef query(request):\n if request.is_ajax():\n return query_ajax(request)\n elif request.method == 'GET':\n return query_get(request)\n\n\ndef query_ajax(request):\n request_type = request.GET.get('type', '')\n mimetype = 'application/json'\n if request_type == 'video':\n query = request.GET.get('query', None)\n max_results = request.GET.get('max', 24)\n video_search(request, query, max_results)\n return HttpResponse(json.dumps(videos), mimetype)\n elif request_type == 'calculator':\n expression = request.GET.get('expression', None)\n calculator(request, expression)\n return HttpResponse(json.dumps(expression_result), mimetype)\n\n\ndef query_get(request):\n query = ' '.join(re.escape(request.GET['q'])\n .replace('\\ ', ' ')\n .replace('\\\\', '')\n .lower()\n .split())\n\n f = open(settings.LISTS_INFO, 'r', encoding='utf8')\n curated_lists = list(json.load(f))\n query_lists = []\n for i in range(len(curated_lists)):\n if query in curated_lists[i]['title'].lower():\n query_lists.append(curated_lists[i])\n\n calculator(request, query)\n code_search(request, query)\n video_search(request, query)\n\n if codes['code_amount'] or videos['video_amount'] or expression_result is not None:\n return render(request, 'cosmos/searchresults.html',\n {'query': query,\n 'query_lists': query_lists,\n 'expression_result': expression_result,\n 'codes': codes,\n 'videos': videos,\n 'active_tab': (\n 'calculator' if expression_result is not None else\n 'code' if codes['code_amount'] else\n 'video' if videos['video_amount'] else\n ''\n )})\n else:\n return render(request, 'cosmos/notfound.html', {'query': query})\n\n\ndef code_search(request, query):\n global codes\n\n codes = {\n 'codes': [],\n 'code_amount': 0,\n 'recommendations': [],\n }\n\n query = query.replace(' ', COSMOS_SEP)\n data = json.loads(open(settings.METADATA_JSON, 'r').readline())\n for folder, file in data.items():\n filtered_v = []\n for f in file:\n if not is_file_extension_ignored(f):\n filtered_v.append(f)\n if query in folder and \"test\" not in folder.split(\"/\"):\n if filtered_v:\n path = folder\n folder_list = folder.split('/')\n codes['codes'].append({'path': path, 'dirs': folder_list, 'files': filtered_v})\n codes['code_amount'] += len(filtered_v)\n if len(folder_list) == 2:\n d = folder_list[-2] + '/'\n else:\n d = folder_list[-3] + '/'\n for i, j in data.items():\n if d in i:\n if query not in i:\n only_contents_md = True\n for f in j:\n if not is_file_extension_ignored(f):\n only_contents_md = False\n break\n if only_contents_md:\n continue\n p = i\n p = p.split('/')\n l = p[len(p) - 1]\n codes['recommendations'].append(\n {'recpath': i, 'recdirs': p, 'last': l})\n shuffle(codes['recommendations'])\n codes['recommendations'] = codes['recommendations'][:5]\n\n\ndef video_search(request, query='algorithm', max_results=24):\n global videos\n\n videos = {\n 'videos': '',\n 'video_amount': 0,\n 'nextpage': None,\n }\n\n youtube_result = {}\n max_results = min(int(max_results), 50)\n nextpage = ''\n id_ = 0\n\n if request.is_ajax():\n q = query.split('&')\n query = q[0]\n nextpage = q[1]\n id_ = q[2]\n if len(query.split(\" \")) == 1:\n query = query + '+' + 'algorithm'\n\n youtube_query = {\n 'q': query.replace(' ', '+'),\n 'max_results': max_results,\n 'nextpage': nextpage,\n 'id': id_\n }\n youtube_result = youtube_search(youtube_query)\n videos = {\n 'videos': json.dumps(youtube_result['videos_Results']),\n 'video_amount': len(youtube_result['videos_Results']),\n 'nextpage': youtube_result['nextpage'],\n }\n\n\ndef calculator(request, expression):\n global expression_result\n res = calculate(expression)\n\n if expression is not None and isinstance(res, (int, float)):\n expression_result = round(res, 3)\n elif 'calculator' in expression:\n expression_result = 0\n else:\n expression_result = None\n\n\n# Search strategy\ndef subsq(a, b, m, n):\n # Base Cases\n if m == 0:\n return True\n if n == 0:\n return False\n # If last characters of two strings are matching\n if a[m - 1] == b[n - 1]:\n return subsq(a, b, m - 1, n - 1)\n # If last characters are not matching\n return subsq(a, b, m, n - 1)\n\n\ndef display(request):\n path = request.GET['path']\n link = \"https://www.github.com/OpenGenus/cosmos/blob/master/code/\" + request.GET['link']\n raw = \"https://raw.githubusercontent.com/OpenGenus/cosmos/master/code/\" + request.GET['link']\n query = request.GET['query']\n r = requests.get(raw)\n return render(request, 'cosmos/code.html', {'code': r.text, 'link': link, 'query': query, 'path': path})\n" }, { "path": "static/css/calculator.css", "content": "" }, { "path": "tags.json", "content": "[\"string algorithms\", \"kmp algorithm\", \"lipogram checker\", \"pangram checker\", \"password strength checker\", \"anagram search\", \"morse code\", \"boyer moore algorithm\", \"remove dups\", \"manachar algorithm\", \"finite automata\", \"palindrome checker\", \"levenshtein distance\", \"arithmetic on large numbers\", \"rabin karp algorithm\", \"naive pattern search\", \"trie pattern search\", \"aho corasick algorithm\", \"kasai algorithm\", \"suffix array\", \"z algorithm\", \"computational geometry\", \"jarvis march\", \"2d line intersection\", \"distance between points\", \"cohen sutherland lineclip\", \"halfplane intersection\", \"area of polygon\", \"2d separating axis test\", \"axis aligned bounding box collision\", \"graham scan\", \"area of triangle\", \"sutherland hodgeman clipping\", \"bresenham line\", \"quickhull\", \"numerical analysis\", \"runge kutt\", \"integral\", \"monte carlo\", \"selection algorithms\", \"median of medians\", \"divide conquer\", \"karatsuba multiplication\", \"warnock algorithm\", \"x power y\", \"quick sort\", \"merge sort using divide and conquer\", \"tournament method to find min max\", \"closest pair of points\", \"inversion count\", \"search\", \"interpolation search\", \"fuzzy search\", \"ternary search\", \"linear search\", \"binary search\", \"exponential search\", \"jump search\", \"fibonacci search\", \"cellular automaton\", \"von neumann cellular automata\", \"conways game of life\", \"langtons ant\", \"genetic algorithm\", \"elementary cellular automata\", \"nobili cellular automata\", \"brians brain\", \"greedy algorithms\", \"kruskal minimum spanning tree\", \"huffman coding\", \"activity selection\", \"dijkstra shortest path\", \"job sequencing\", \"k centers\", \"fractional knapsack\", \"prim minimum spanning tree\", \"hillclimber\", \"egyptian fraction\", \"warshall\", \"minimum coins\", \"dynamic programming\", \"longest palindromic substring\", \"shortest common supersequence\", \"maximum weight independent set of path graph\", \"weighted job scheduling\", \"no consec ones\", \"optimal binary search tree\", \"coin change\", \"longest common substring\", \"knapsack\", \"edit distance\", \"boolean parenthesization\", \"maximum sum sub matrix\", \"maximum sum increasing subsequence\", \"factorial\", \"binomial coefficient\", \"longest common increasing subsequence\", \"palindrome partition\", \"longest palindromic sequence\", \"egg dropping puzzle\", \"matrix chain multiplication\", \"box stacking\", \"longest independent set\", \"minimum insertion palindrome\", \"longest increasing subsequence\", \"array median\", \"tiling problem\", \"largest sum contiguous subarray\", \"minimum cost polygon triangulation\", \"min cost path\", \"subset sum\", \"longest common subsequence\", \"rod cutting\", \"numeric keypad problem\", \"longest bitonic sequence\", \"online challenges\", \"project euler\", \"problem 002\", \"problem 036\", \"problem 016\", \"problem 003\", \"problem 025\", \"problem 007\", \"problem 008\", \"problem 004\", \"problem 028\", \"problem 006\", \"problem 010\", \"problem 102\", \"problem 001\", \"problem 005\", \"problem 009\", \"problem 014\", \"rosalind\", \"complement dna strand\", \"operating system\", \"scheduling\", \"shortest seek time first\", \"multi level feedback queue scheduling\", \"smallest remaining time first\", \"round robin scheduling\", \"round robin c\", \"first come first serve\", \"memory management\", \"least recently used\", \"shell\", \"c\", \"deadlocks\", \"bankers algorithm\", \"concurrency\", \"readers writers\", \"dining philosophers\", \"monitors\", \"monitors system v\", \"peterson algorithm for mutual exclusion\", \"peterson algorithm in c\", \"producer consumer\", \"networking\", \"validate ip\", \"determine endianess\", \"data structures\", \"list\", \"singly linked list\", \"operations\", \"find\", \"detect cycle\", \"sort\", \"delete\", \"merge sorted\", \"reverse\", \"print reverse\", \"push\", \"n th node linked list\", \"rotate\", \"xor linked list\", \"skip list\", \"doubly linked list\", \"circular linked list\", \"tree\", \"b tree\", \"b tree c\", \"two three tree\", \"binary tree\", \"treap\", \"aa tree\", \"convert to doubly linked list\", \"diameter\", \"minimum height\", \"is binary tree\", \"is balance\", \"node\", \"serializer\", \"bottom view binary tree\", \"make binary tree\", \"from inorder and preorder\", \"maximum height\", \"make mirror tree\", \"is same\", \"traversal\", \"inorder\", \"right threaded\", \"zigzag\", \"preorder\", \"right view\", \"left view\", \"path sum\", \"sum left\", \"rope\", \"avl tree\", \"trie\", \"heap\", \"min heap\", \"soft heap\", \"max heap\", \"priority queue\", \"leftist tree\", \"binomial heap\", \"pairing heap\", \"segment tree\", \"space partitioning tree\", \"quad tree\", \"kd tree\", \"interval tree\", \"multiway tree\", \"splay tree\", \"fenwick tree\", \"van emde boas tree\", \"union find\", \"red black tree\", \"hashs\", \"hash table\", \"bloom filter\", \"bag\", \"stack\", \"postfix evaluation\", \"balanced expression\", \"sort stack\", \"infix to postfix\", \"reverse stack\", \"abstract stack\", \"cpp\", \"arraystack\", \"prefix to postfix\", \"queue\", \"queue stream\", \"queue using stack\", \"circular buffer\", \"reverse queue\", \"queue using linked list\", \"other\", \"randomized algorithms\", \"reservoir sampling\", \"karger minimum cut algorithm\", \"random node linkedlist\", \"randomized quick sort\", \"random from stream\", \"shuffle an array\", \"kth smallest element algorithm\", \"mathematical algorithms\", \"convolution\", \"fast fourier transform\", \"add polynomials\", \"2sum\", \"replace 0 with 5\", \"armstrong numbers\", \"sieve of eratosthenes\", \"euler totient\", \"fibonacci number\", \"horner polynomial evaluation\", \"russian peasant multiplication\", \"babylonian method\", \"fast inverse sqrt\", \"sieve of atkin\", \"permutation lexicographic order\", \"segmented sieve of eratosthenes\", \"std\", \"gcd and lcm\", \"amicable numbers\", \"lucas theorem\", \"sum of digits\", \"pandigital number\", \"next larger number\", \"tridiagonal matrix\", \"gaussian elimination\", \"shuffle array\", \"newton polynomial\", \"average stream numbers\", \"delannoy number\", \"magic square\", \"check is square\", \"largrange polynomial\", \"poisson sample\", \"divided differences\", \"decoding of string\", \"lucky number\", \"integer conversion\", \"pythagorean triplet\", \"reverse number\", \"steepest descent\", \"primality tests\", \"fermat primality test\", \"solovay strassen primality test\", \"miller rabin primality test\", \"catalan number\", \"newton raphson method\", \"integer to roman\", \"reverse factorial\", \"derangements\", \"automorphic numbers\", \"tower of hanoi\", \"greatest digit in number\", \"count digits\", \"prime numbers of n\", \"lexicographic string rank\", \"taxicab numbers\", \"multiply polynomial\", \"count trailing zeroes\", \"log of factorial\", \"diophantine\", \"coprime numbers\", \"hill climbing\", \"fermats little theorem\", \"exponentiation power\", \"exponentiation by squaring\", \"smallest digit in number\", \"tribonacci numbers\", \"simpsons rule\", \"perfect number\", \"prime factors\", \"fractals\", \"modular inverse\", \"jacobi method\", \"pascal triangle\", \"dfa division\", \"sorting\", \"bucket sort\", \"median sort\", \"counting sort\", \"selection sort\", \"radix sort\", \"bubble sort\", \"insertion sort\", \"tree sort\", \"shell sort\", \"sleep sort\", \"bead sort\", \"stooge sort\", \"shaker sort\", \"flash sort\", \"comb sort\", \"topological sort\", \"gnome sort\", \"heap sort\", \"intro sort\", \"pigeonhole sort\", \"merge sort\", \"bogo sort\", \"cycle sort\", \"circle sort\", \"backtracking\", \"m coloring problem\", \"number of ways in maze\", \"n queen\", \"powerset\", \"algorithm x\", \"partitions of set\", \"partitions of number\", \"crossword puzzle\", \"rat in a maze\", \"sudoku solve\", \"permutations of string\", \"knight tour\", \"jaccard similarity\", \"biggest of n numbers\", \"paint fill\", \"minimum subarray size with degree\", \"average\", \"majority element\", \"leap year\", \"utilities\", \"spiral printing\", \"josephus problem\", \"tokenizer\", \"biggest suffix\", \"lapindrom checker\", \"split list\", \"fifteen puzzle\", \"design pattern\", \"singleton pattern\", \"observer pattern\", \"artificial intelligence\", \"sat\", \"random forests\", \"t distributed stochastic neighbor embedding\", \"nearest sequence memory\", \"nsm matlab\", \"factorization machines\", \"principal component analysis\", \"naive bayes\", \"dbscan clustering\", \"tsp\", \"hierachical clustering\", \"decision tree\", \"k nearest neighbours\", \"isodata clustering\", \"q learning\", \"neural network\", \"logistic regression\", \"gradient boosting trees\", \"support vector machine\", \"k means\", \"gaussian mixture model\", \"restricted boltzmann machine\", \"linear regression\", \"utility\", \"palindrome\", \"palindrome check\", \"graph algorithms\", \"biconnected components\", \"fleury algorithm euler path\", \"bridges in graph\", \"eulerian path\", \"boruvka minimum spanning tree\", \"adjacency lists graph representation\", \"adjacency lists in c\", \"hamiltonian cycle\", \"connected components\", \"bron kerbosch algorithm\", \"channel assignment\", \"floyd warshall algorithm\", \"astar algorithm\", \"graph coloring\", \"hamiltonian path\", \"kuhn maximum matching\", \"breadth first search\", \"cut vertices\", \"longest path directed acyclic graph\", \"bridge tree\", \"travelling salesman mst\", \"cycle directed graph\", \"adjacency matrix c\", \"strongly connected components\", \"bipartite check\", \"tarjan algorithm strongly connected components\", \"maximum bipartite matching\", \"vertex cover\", \"cycle undirected graph\", \"postorder from inorder and preorder\", \"hopcroft karp algorithm\", \"minimum s t cut\", \"dinic maximum flow\", \"shortest path k edges\", \"karger minimum cut\", \"ford fulkerson maximum flow\", \"left view binary tree\", \"bipartite checking\", \"count of ways n\", \"depth first search\", \"johnson algorithm shortest path\", \"centroid decomposition\", \"steiner tree\", \"transitive closure graph\", \"bellman ford algorithm\", \"maximum edge disjoint paths\", \"compression\", \"lossless compression\", \"lempel ziv welch\", \"huffman\", \"lossy compression\", \"square root decomposition\", \"mos algorithm\", \"cryptography\", \"runningkey cipher\", \"columnar transposition cipher\", \"affine cipher\", \"aes 128\", \"aes csharp\", \"example\", \"autokey cipher\", \"rail fence cipher\", \"caesar cipher\", \"vigenere cipher\", \"rot13 cipher\", \"polybius cipher\", \"porta cipher\", \"atbash cipher\", \"morse cipher\", \"rsa digital signature\", \"baconian cipher\", \"rsa\", \"huffman encoding\", \"bit manipulation\", \"lonely integer\", \"sum binary numbers\", \"byte swapper\", \"flip bits\", \"sum equals xor\", \"thrice unique number\", \"power of 2\", \"twice unique number\", \"maximum xor value\", \"bit division\", \"count set bits\", \"invert bit\", \"magic number\", \"hamming distance\", \"xor swap\", \"subset generation\", \"convert number binary\"]" }, { "path": "templates/cosmos/_base_css.html", "content": "\n" }, { "path": "templates/cosmos/_footer.html", "content": "\n" }, { "path": "templates/cosmos/_nav.html", "content": "\n" }, { "path": "templates/cosmos/bundles/css.html", "content": "{# google api #}\n\n{# end google api #}\n\n\n\n\n{# bootstrap_css #}\n\n{# end bootstrap_css#}\n" }, { "path": "templates/cosmos/bundles/js.html", "content": "\n\n\n" }, { "path": "templates/cosmos/calculator.html", "content": "{% load staticfiles %}\n\n\n
Calculator
\n
\n\n
\n
\n
\n \n
\n \n \n
\n
\n
\n \n \n\n \n \n \n \n \n
\n
\n \n \n\n \n \n \n \n \n
\n
\n \n \n\n \n \n \n \n \n
\n
\n \n \n\n \n \n \n \n \n
\n
\n \n \n \n \n \n \n \n
\n
\n
\n
\n\n\n" }, { "path": "templates/cosmos/code.html", "content": "{% extends 'cosmos/header.html' %}\n\n{% block extra_head %}\n\n\n\n{% endblock extra_head %}\n\n{% block title %}\n\n\"cosmos-search\n\n{% endblock title %}\n\n{% block main %}\n
\n
\n
\n {{ path }}\n
\n
\n
\n
\n \n \n Copy\n \n
\n
\n\n
\n
\n 
{{ code }}
\n
\n
\n
\n \n Open on Github\n  \n \n Ask any questions\n \n
\n\n
{{ code }}
\n
\n\n{% endblock main %}\n\n{% block js %}\n\n\n\n\n\n\n\n{% endblock js %}\n" }, { "path": "templates/cosmos/codeResults.html", "content": "
Source code results
\n
\n\n{% for entry in codes.codes %}\n
\n
\n

\n {% for i in entry.dirs %}\n {{ i }} /\n {% endfor %}\n

\n {% if entry.files|length %}\n
\n \n
\n {% for file in entry.files %}\n
\n \n \n \n \n
\n {% endfor %}\n
\n
\n {% endif %}\n
\n
\n
\n{% endfor %}\n\n{% if codes.recommendations %}\n
Recommended results
\n
\n {% for j in codes.recommendations %}\n
\n
\n
\n
\n {% for k in j.recdirs %}\n {{ k }} /\n {% endfor %}\n
\n solution\n
\n
\n
\n
\n {% endfor %}\n{% endif %}\n" }, { "path": "templates/cosmos/error/HTTP400.html", "content": "{% extends 'cosmos/header.html' %}\n{% block head %}\n 400 | cosmos-search\n{% endblock %}\n{% block body %}\n
\n

Oops! Error 400

\n

Seems like the server couldn't understand your request!

\n
\n

However, Thanks for stopping by! You can go start a search query right above, go to the landing page or report the error in case you have expected something else to be here.

\n

— OpenGenus, The Open Group to help the needy

\n
\n
\n{% endblock %}\n" }, { "path": "templates/cosmos/error/HTTP403.html", "content": "{% extends 'cosmos/header.html' %}\n{% block head %}\n 403 | cosmos-search\n{% endblock %}\n{% block body %}\n
\n

Oops! Error 403

\n

Seems like you are not allowed to access this page!

\n
\n

However, Thanks for stopping by! You can go start a search query right above, go to the landing page or report the error in case you have expected something else to be here.

\n

— OpenGenus, The Open Group to help the needy

\n
\n
\n{% endblock %}\n" }, { "path": "templates/cosmos/error/HTTP404.html", "content": "{% extends 'cosmos/header.html' %}\n{% block head %}\n 404 | cosmos-search\n{% endblock %}\n{% block body %}\n
\n

Oops! Error 404

\n

Seems like the page you've searched for doesn't exist!

\n
\n

However, Thanks for stopping by! You can go start a search query right above, go to the landing page or report the error in case you have expected something else to be here.

\n

— OpenGenus, The Open Group to help the needy

\n
\n
\n{% endblock %}\n" }, { "path": "templates/cosmos/error/HTTP500.html", "content": "{% extends 'cosmos/header.html' %}\n{% block head %}\n 500 | cosmos-search\n{% endblock %}\n{% block body %}\n\n{% endblock %}\n" }, { "path": "templates/cosmos/header.html", "content": "\n{% load static %}\n\n\n \n {% block title %} cosmos-search {% endblock %}\n\n \n \n\n {% include 'cosmos/bundles/js.html' %}\n {% include 'cosmos/bundles/css.html' %}\n {% include 'cosmos/_base_css.html' %}\n\n {% block css %} {% endblock %}\n {% block extra_head %} {% endblock %}\n \n\n \n {% include 'cosmos/_nav.html' %}\n\n {# align search bar and middle of vw #}\n
\n
\n \n \n \n
\n
\n\n {% block main %} {% endblock %}\n\n {% include 'cosmos/_footer.html' %}\n\n \n \n \n\n \n {% block js %}\n {% endblock %}\n \n\n" }, { "path": "templates/cosmos/index.html", "content": "{% extends 'cosmos/header.html' %}\n{% load random_numbers %}\n\n{% block main %}\n
\n \n

Welcome to cosmos-search

\n
\n\n
\n \"Enjoy\n
\n
\n\n

This is the official search tool for cosmos,

\n

a library of every algorithm and data structure code that you will ever encounter.

\n

\n To search for an algorithm, just enter your search keywords in the box above.

\n — OpenGenus, The Open Group to help the needy\n

\n

\n{% endblock main %}\n" }, { "path": "templates/cosmos/lists.html", "content": "{% extends 'cosmos/header.html' %}\n{% block main %}\n
\n

Human-Curated Lists

\n
\n\n {% for item in lists %}\n
\n \n

{{item.title}}

\n \n

{{item.description}}

\n

\n -\n {{item.author}}\n

\n
\n

\n {% endfor %}\n
\n{% endblock %}\n" }, { "path": "templates/cosmos/listsResults.html", "content": "\n\n
Human-Curated Lists Results
\n
\n\n {% for item in query_lists %}\n
\n
\n {{item.title}}\n
\n

{{item.description}}

\n

\n -\n {{item.author}}\n

\n
\n

\n {% endfor %}\n
\n\n" }, { "path": "templates/cosmos/lists_template.html", "content": "{% extends 'cosmos/header.html' %}\n{% block main %}\n\n
\n\t\n

{{title}}

\n
\n\n \n
\n \n \n
\n
\n\n{% endblock main %}\n" }, { "path": "templates/cosmos/news.html", "content": "{% extends 'cosmos/header.html' %}\n{% block main %}\n\n
\n

News

\n
\n\n {% for item in queries %}\n
\n

{{item.title}}

\n

{{item.description}}

\n
\n

\n {% endfor %}\n\n
\n \n {% if queries.has_previous %}\n previous\n {% endif %}\n\n \n Page {{ queries.number }} of {{ queries.paginator.num_pages }}.\n \n\n {% if queries.has_next %}\n next\n {% endif %}\n \n
\n
\n\n{% endblock main %}\n" }, { "path": "templates/cosmos/notfound.html", "content": "{% extends 'cosmos/header.html' %}\n{% block title %}\n\nNot Found | cosmos-search\n\n{% endblock title %}\n\n{% block main %}\n\n
\n

Sorry!

\n

It seems like there are no results for \"{{ query }}\" !

\n
Try searching something else or request the algorithm you searched for here.

\n
— OpenGenus, The Open Group to help the needy
\n
\n\n{% endblock main %}\n" }, { "path": "templates/cosmos/searchresults.html", "content": "{% extends 'cosmos/header.html' %}\n{% load staticfiles %}\n\n{% block title %}\n\n\"{{ query }}\" | cosmos-search\n\n{% endblock title %}\n\n{% block js %}\n\n\n\n\n{% endblock js %}\n\n{% block main %}\n
\n
\n
\n
\n \n Showing\n {{ codes.code_amount }}\n {{ videos.video_amount }}\n expression\n \n result(s) for:\n {{ query }}\n \n \n \n \n \n
\n
 
\n
\n \n \n \n \n \n
\n
\n
\n
\n\n
\n {% if query_lists|length > 0 %}\n {% include 'cosmos/listsResults.html' %}\n {% endif %}\n
\n\n
\n {% if expression_result is not None %}\n {% include 'cosmos/calculator.html' %}\n {% endif %}\n
\n\n
\n {% if codes %}\n {% include 'cosmos/codeResults.html' %}\n {% endif %}\n
\n\n
\n {% include 'cosmos/youtubeResults.html' %}\n
\n
\n{% endblock main %}\n" }, { "path": "templates/cosmos/tags.html", "content": "{% extends 'cosmos/header.html' %}\n{% block js %}\n\n\n\n\n{% endblock js %}\n\n{% block main %}\n\n
\n

Tags

\n
\n\n
\n A tag is a keyword or label that categorizes your search query with other, similar queries. Users can use these tags in exploring new topics and continue browsing without prior knowledge.\n
\n
\n\n
\n
\n \n
\n \n
\n
\n\n
\n
    \n {% for tag in tags %}\n
  • {{ tag }}
    • \n {% endfor %}\n
\n
\n
\n\n{% endblock main %}\n" }, { "path": "templates/cosmos/youtubeResults.html", "content": "{% load random_numbers %}\n\n{% block videos %}\n\n
Youtube results
\n
\n
\n\n
\n \n
\n\n\n{% endblock %}\n" }, { "path": "tox.ini", "content": "[flake8]\n# E741 = Ambiguous variable name\n# C901 = Overcomplex function\nignore = E741, C901\nexclude = .git,\n __pycache__,\n venv,\n cosmos,\n .gitignore,\n .travis.yml,\n LICENSE,\n metadata.json,\n Procfile,\n README.md,\n requirements.txt,\n runtime.txt,\n tags.json\nmax-complexity = 10\nmax-line-length = 119\n" }, { "path": "update/__init__.py", "content": "" }, { "path": "update/admin.py", "content": "from django.contrib import admin # noqa\n\n# Register your models here.\n" }, { "path": "update/apps.py", "content": "from django.apps import AppConfig\n\n\nclass UpdateConfig(AppConfig):\n name = 'update'\n" }, { "path": "update/migrations/__init__.py", "content": "" }, { "path": "update/models.py", "content": "from django.db import models # noqa\n\n# Create your models here.\n" }, { "path": "update/tests.py", "content": "from django.test import TestCase # noqa\n\n# Create your tests here.\n" }, { "path": "update/urls.py", "content": "from django.conf.urls import url\nfrom update import views\n\nurlpatterns = [\n url(r'^github_webhook$', views.github_webhook, name='github_webhook'),\n]\n" }, { "path": "update/views.py", "content": "import json\nimport hashlib\nimport hmac\nimport http.client\nimport git\nimport os\n\nfrom django.conf import settings\nfrom django.http import HttpResponse, HttpResponseForbidden\nfrom django.views.decorators.csrf import csrf_exempt\n\n\ndef get_file_context(filename):\n '''\n :param filename: name of file\n :type filename: str\n :return: context of the file if file can be opened else empty string\n '''\n\n context = ''\n\n try:\n with open(filename, 'r') as f:\n context = f.read()\n except OSError:\n pass\n\n return context\n\n\ndef get_json_from_file(filename, default_={}):\n '''\n :param filename: name of file\n :type filename: str\n :param default_: the default json\n :type default_: json\n :return: json of context of the file if file can be opened else default\n '''\n\n context = get_file_context(filename)\n\n if context:\n default_ = json.loads(context)\n\n return default_\n\n\ndef update_kv_to_json(key, value, json_):\n '''\n :param key: list for keys by layer or key\n :type key: list or any type for json key\n :param json_:\n :type json_: json\n :return: elem which containing the key in json_\n '''\n\n if isinstance(key, list) and len(key) > 1:\n j = json_\n # the key of int will be str in json\n k = str(key[0])\n if k not in json_:\n j[k] = {}\n j = j[k]\n update_kv_to_json(key[1:], value, j)\n\n elif isinstance(key, list) and len(key) == 1:\n json_[key[0]] = value\n\n else:\n json_[key] = value\n\n\ndef update_kv_to_file(key, value, filename):\n '''\n :param key: list for keys by layer or key\n :type key: list or any type for json key\n :param value:\n :type value: any type for json key\n :param filename:\n :type filename: str\n\n TODO: update value of list\n '''\n\n json_ = get_json_from_file(filename)\n\n update_kv_to_json(key, value, json_)\n\n with open(filename, 'w') as f:\n json.dump(json_, f)\n\n\ndef update_metadata():\n data = {}\n for (dirpath, dirnames, filenames) in os.walk(settings.COSMOS_ROOT + 'code/'):\n if dirnames == []:\n dirpath = '/'.join(dirpath.split('/')[2:])\n data[dirpath] = filenames\n with open(settings.METADATA_JSON, 'w') as f:\n json.dump(data, f)\n\n\ndef update_tags():\n topics = []\n for keys in json.load(open(settings.METADATA_JSON)):\n for topic in keys.split('/'):\n if topic not in (topics + ['unclassified', 'src', 'updated_at', 'test']):\n topics.append(topic)\n data = list(map(lambda v: v.replace('_', ' ').replace('-', ' ').lower(), topics))\n with open(settings.TAGS_JSON, 'w') as f:\n json.dump(data, f)\n\n\ndef manage_webhook_event(event, payload):\n\n \"\"\"Simple webhook handler that prints the event and payload to the console\"\"\"\n\n if event == 'push':\n updated_at = payload['repository']['pushed_at']\n try:\n repo = git.Repo(settings.COSMOS_ROOT)\n o = repo.remotes.origin\n print(\"Pulling cosmos!\")\n o.pull()\n print(\"Pulling done!\")\n except git.exc.NoSuchPathError:\n print(\"Cloning cosmos!\")\n git.Git().clone(settings.COSMOS_LINK)\n print(\"Cloning done!\")\n update_metadata()\n update_kv_to_file(settings.METADATA_JSON, updated_at, settings.TIMESTAMPS_JSON)\n update_tags()\n update_kv_to_file(settings.TAGS_JSON, updated_at, settings.TIMESTAMPS_JSON)\n\n\n@csrf_exempt\ndef github_webhook(request):\n github_signature = request.META['HTTP_X_HUB_SIGNATURE']\n signature = hmac.new(settings.GITHUB_WEBHOOK_SECRET, request.body, hashlib.sha1)\n expected_signature = 'sha1=' + signature.hexdigest()\n if not hmac.compare_digest(github_signature, expected_signature):\n return HttpResponseForbidden('Invalid signature header')\n if 'payload' in request.POST:\n payload = json.loads(request.POST['payload'])\n else:\n payload = json.loads(request.body)\n event = request.META['HTTP_X_GITHUB_EVENT']\n manage_webhook_event(event, payload)\n return HttpResponse('Webhook received', status=http.client.ACCEPTED)\n" } ]