[
  {
    "path": ".github/ISSUE_TEMPLATE/bug_report.md",
    "content": "---\nname: Bug report\nabout: Create a report to help us improve\ntitle: ''\nlabels: ''\nassignees: ''\n\n---\n\n**Describe the bug**\nA clear and concise description of what the bug is.\n\n**To Reproduce**\nSteps to reproduce the behavior:\n1. Go to '...'\n2. Click on '....'\n3. Scroll down to '....'\n4. See error\n\n**Expected behavior**\nA clear and concise description of what you expected to happen.\n\n**Screenshots**\nIf applicable, add screenshots to help explain your problem.\n\n**Desktop (please complete the following information):**\n - OS: [e.g. iOS]\n - Browser [e.g. chrome, safari]\n - Version [e.g. 22]\n\n**Smartphone (please complete the following information):**\n - Device: [e.g. iPhone6]\n - OS: [e.g. iOS8.1]\n - Browser [e.g. stock browser, safari]\n - Version [e.g. 22]\n\n**Additional context**\nAdd any other context about the problem here.\n"
  },
  {
    "path": ".github/ISSUE_TEMPLATE/custom.md",
    "content": "---\nname: Custom issue template\nabout: Describe this issue template's purpose here.\ntitle: ''\nlabels: ''\nassignees: ''\n\n---\n\n\n"
  },
  {
    "path": ".github/ISSUE_TEMPLATE/feature_request.md",
    "content": "---\nname: Feature request\nabout: Suggest an idea for this project\ntitle: ''\nlabels: ''\nassignees: ''\n\n---\n\n**Is your feature request related to a problem? Please describe.**\nA clear and concise description of what the problem is. Ex. I'm always frustrated when [...]\n\n**Describe the solution you'd like**\nA clear and concise description of what you want to happen.\n\n**Describe alternatives you've considered**\nA clear and concise description of any alternative solutions or features you've considered.\n\n**Additional context**\nAdd any other context or screenshots about the feature request here.\n"
  },
  {
    "path": ".github/workflows/easyRun.yml",
    "content": "\nname: Daprofiler Easy run\n\non:\n  workflow_dispatch:\n    inputs:\n      name:\n        runners:\n          description: 'nom'     \n          required: true\n          default: 'marie'\n      lastname:\n        runners:\n          description: 'prenom'     \n          required: true\n          default: 'lacourt'\n\npermissions:\n  contents: read\n\njobs:\n  build:\n\n    runs-on: ubuntu-latest\n\n    steps:\n    - uses: actions/checkout@v3\n    - name: Set up Python 3.10\n      uses: actions/setup-python@v3\n      with:\n        python-version: \"3.10\"\n    - name: Install dependencies\n      run: |\n        python -m pip install --upgrade pip\n        if [ -f requirements.txt ]; then pip install -r requirements.txt; fi\n    - name: Test code simple args\n      run: |\n        python profiler.py -n ${{ github.event.inputs.name }} -ln ${{ github.event.inputs.lastname }}\n"
  },
  {
    "path": ".github/workflows/testCode.yml",
    "content": "\nname: Daprofiler test\n\non:\n  push:\n    branches: [ \"main\" ]\n\npermissions:\n  contents: read\n\njobs:\n  build:\n\n    runs-on: ubuntu-latest\n\n    steps:\n    - uses: actions/checkout@v3\n    - name: Set up Python 3.10\n      uses: actions/setup-python@v3\n      with:\n        python-version: \"3.10\"\n    - name: Install dependencies\n      run: |\n        python -m pip install --upgrade pip\n        if [ -f requirements.txt ]; then pip install -r requirements.txt; fi\n    - name: Test code simple args\n      run: |\n        python profiler.py -n marie -ln lacourt\n    - name: Test code JSON mode\n      run: |\n        python profiler.py -n marie -ln lacourt --json true\n"
  },
  {
    "path": ".gitignore",
    "content": "hub/__pycache__/*\nmodules/__pycache__/*\nmodules/visual/__pycache__/*\nmodules/api_modules/__pycache__/*\nReports/*\nhub_reports/*\n\n!user/exemple.txt\n!hub_reports/.notEmpty"
  },
  {
    "path": "CODE_OF_CONDUCT.md",
    "content": "# Contributor Covenant Code of Conduct\n\n## Our Pledge\n\nWe as members, contributors, and leaders pledge to make participation in our\ncommunity a harassment-free experience for everyone, regardless of age, body\nsize, visible or invisible disability, ethnicity, sex characteristics, gender\nidentity and expression, level of experience, education, socio-economic status,\nnationality, personal appearance, race, religion, or sexual identity\nand orientation.\n\nWe pledge to act and interact in ways that contribute to an open, welcoming,\ndiverse, inclusive, and healthy community.\n\n## Our Standards\n\nExamples of behavior that contributes to a positive environment for our\ncommunity include:\n\n* Demonstrating empathy and kindness toward other people\n* Being respectful of differing opinions, viewpoints, and experiences\n* Giving and gracefully accepting constructive feedback\n* Accepting responsibility and apologizing to those affected by our mistakes,\n  and learning from the experience\n* Focusing on what is best not just for us as individuals, but for the\n  overall community\n\nExamples of unacceptable behavior include:\n\n* The use of sexualized language or imagery, and sexual attention or\n  advances of any kind\n* Trolling, insulting or derogatory comments, and personal or political attacks\n* Public or private harassment\n* Publishing others' private information, such as a physical or email\n  address, without their explicit permission\n* Other conduct which could reasonably be considered inappropriate in a\n  professional setting\n\n## Enforcement Responsibilities\n\nCommunity leaders are responsible for clarifying and enforcing our standards of\nacceptable behavior and will take appropriate and fair corrective action in\nresponse to any behavior that they deem inappropriate, threatening, offensive,\nor harmful.\n\nCommunity leaders have the right and responsibility to remove, edit, or reject\ncomments, commits, code, wiki edits, issues, and other contributions that are\nnot aligned to this Code of Conduct, and will communicate reasons for moderation\ndecisions when appropriate.\n\n## Scope\n\nThis Code of Conduct applies within all community spaces, and also applies when\nan individual is officially representing the community in public spaces.\nExamples of representing our community include using an official e-mail address,\nposting via an official social media account, or acting as an appointed\nrepresentative at an online or offline event.\n\n## Enforcement\n\nInstances of abusive, harassing, or otherwise unacceptable behavior may be\nreported to the community leaders responsible for enforcement at\ndaluna_pro@protonmail.ch.\nAll complaints will be reviewed and investigated promptly and fairly.\n\nAll community leaders are obligated to respect the privacy and security of the\nreporter of any incident.\n\n## Enforcement Guidelines\n\nCommunity leaders will follow these Community Impact Guidelines in determining\nthe consequences for any action they deem in violation of this Code of Conduct:\n\n### 1. Correction\n\n**Community Impact**: Use of inappropriate language or other behavior deemed\nunprofessional or unwelcome in the community.\n\n**Consequence**: A private, written warning from community leaders, providing\nclarity around the nature of the violation and an explanation of why the\nbehavior was inappropriate. A public apology may be requested.\n\n### 2. Warning\n\n**Community Impact**: A violation through a single incident or series\nof actions.\n\n**Consequence**: A warning with consequences for continued behavior. No\ninteraction with the people involved, including unsolicited interaction with\nthose enforcing the Code of Conduct, for a specified period of time. This\nincludes avoiding interactions in community spaces as well as external channels\nlike social media. Violating these terms may lead to a temporary or\npermanent ban.\n\n### 3. Temporary Ban\n\n**Community Impact**: A serious violation of community standards, including\nsustained inappropriate behavior.\n\n**Consequence**: A temporary ban from any sort of interaction or public\ncommunication with the community for a specified period of time. No public or\nprivate interaction with the people involved, including unsolicited interaction\nwith those enforcing the Code of Conduct, is allowed during this period.\nViolating these terms may lead to a permanent ban.\n\n### 4. Permanent Ban\n\n**Community Impact**: Demonstrating a pattern of violation of community\nstandards, including sustained inappropriate behavior,  harassment of an\nindividual, or aggression toward or disparagement of classes of individuals.\n\n**Consequence**: A permanent ban from any sort of public interaction within\nthe community.\n\n## Attribution\n\nThis Code of Conduct is adapted from the [Contributor Covenant][homepage],\nversion 2.0, available at\nhttps://www.contributor-covenant.org/version/2/0/code_of_conduct.html.\n\nCommunity Impact Guidelines were inspired by [Mozilla's code of conduct\nenforcement ladder](https://github.com/mozilla/diversity).\n\n[homepage]: https://www.contributor-covenant.org\n\nFor answers to common questions about this code of conduct, see the FAQ at\nhttps://www.contributor-covenant.org/faq. Translations are available at\nhttps://www.contributor-covenant.org/translations.\n"
  },
  {
    "path": "CONTRIBUTING.md",
    "content": "No contribution allow before Daprofiler v2\n"
  },
  {
    "path": "LICENSE",
    "content": "                    GNU GENERAL PUBLIC LICENSE\n                       Version 3, 29 June 2007\n\n Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>\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 <https://www.gnu.org/licenses/>.\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    <program>  Copyright (C) <year>  <name of author>\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<https://www.gnu.org/licenses/>.\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<https://www.gnu.org/licenses/why-not-lgpl.html>.\n"
  },
  {
    "path": "README.md",
    "content": "![alt text](https://github.com/daprofiler/DaProfiler/blob/main/files/DaProfiler_Logo.png?raw=true)\n\n\n![](https://visitor-badge.laobi.icu/badge?page_id=TheRealDalunacrobate.daprofiler)\n\nDaProfiler is an OSINT tool capable of tracing the digital identity of a target via social networks, emails, public information such as directories, business listings, etc.\nDaProfiler is also able to check if a face appears on the profile photos of returned accounts.\nDaProfiler can bring you a lot in the context of a search for email addresses on a French target using various techniques of mail guessing, mail swapping using the first and last name of your target.\nThe developers inform you that you are responsible for the uses and actions you make of DaProfiler, this tool is above all a big data awareness tool, created to search for a person with his agreement and allow him to remove malicious traces of his digital identity to protect themselves.\n\nInput  : Name , Last Name <br>\nOutput : email addresses, landline numbers, physical addresses, social networks, work history, photos, etc.\n\n#### Installation\nPython 3.8 & Mozilla Firefox required.\n```bash\ngit clone https://github.com/TheRealDalunacrobate/DaProfiler.git\ncd DaProfiler\npip install -r requirements.txt\n```\n#### Connect to LinkedIN API\n+ Go to [modules\\linkedin_search](https://github.com/daprofiler/DaProfiler/blob/main/modules/social_medias/linkedin_search.py) then add your creditentials.\n\n## Demo\n![alt text](https://i.ibb.co/XSzG90S/Capture-censored.jpg)\n\n## Contributions\nAll suggestions are welcome.\n\n## Code parts used under license and authors\n+ [Palenath - Instagram Advanced Lookup Function](https://github.com/megadose/toutatis)\n"
  },
  {
    "path": "modules/api_modules/leakcheck_net.py",
    "content": "import leakcheck\nfrom leakcheck import LeakCheckAPI\n\nfrom colorama import Fore\n\ndef leak_check_api(mail):\n    full_results = []\n    api = LeakCheckAPI()\n    \"\"\"\n    GET YOUR KEY AT https://leakcheck.net/ \n    \"\"\"\n    keyy = \"YOUR_KEY\" # PUT YOUR KEY HERE ONLY\n    if keyy == \"YOUR_KEY\":\n        return None\n    else:\n        try:\n            api.set_key(keyy)\n            api.set_type(\"email\")\n            api.set_query(mail)\n            result = api.lookup(with_sources=1)[0:10] # LIMIT OF RESULTS == 10 YOU CAN CHANGE THIS VALUE TO PRINT MORE RESULTS\n            for i in result:\n                try:\n                    password  = i['line']\n                except IndexError:\n                    password = None\n                try:\n                    leak_name = i['sources']\n                except IndexError:\n                    leak_name = None\n                try:\n                    leak_date = i['last_breach']\n                except IndexError:\n                    leak_date = None\n                dict_res = {\n                    'password':password,\n                    'leak_name':str(leak_name).replace(\"'\",\"\").replace(\"[\",\"\").replace(\"]\",\"\"),\n                    'leak_date':leak_date\n                }\n                full_results.append(dict_res)\n            if len(full_results) == 0:\n                return None\n            return full_results\n        except:\n            return None\n"
  },
  {
    "path": "modules/config/config.json",
    "content": "{\r\n    \"extension\": {\r\n      \"Extension1\":\"pdf\",\r\n      \"Extension2\":\"docx\",\r\n      \"Extension3\":false\r\n    }\r\n  }"
  },
  {
    "path": "modules/diplomes/last_diplomes.py",
    "content": "import requests\r\nfrom bs4 import BeautifulSoup\r\n\r\ndef last_diplomes_bac(name,pren):\r\n    url = f'https://resultats.etudiant.lefigaro.fr/resultats-bac/recherche?name={pren} {name}&city_label=&city_insee='\r\n    r = requests.get(url)\r\n    page = r.content\r\n    features = \"html.parser\"\r\n    soup = BeautifulSoup(page, features)\r\n    profiles = soup.find_all('td',{'class':'svelte-11did2l'})   \r\n    listt = [] \r\n    for i in profiles:\r\n        if len(listt) == 1:\r\n            subject = listt[0]\r\n            link = \"https://resultats.etudiant.lefigaro.fr\"+subject.split('href=\"')[1].split('\">')[0]\r\n\r\n            academie = None\r\n            mention  = None\r\n            ville    = None\r\n            diplome  = None\r\n\r\n            r        = requests.get(link)\r\n            page     = r.content\r\n            features = \"html.parser\"\r\n            soup     = BeautifulSoup(page, features)\r\n\r\n            mention  = soup.find('span',{'class':'block text-4xl text-red'}).text.split('\"')[1].split('\"')[0]\r\n            diplome  = soup.find('p',{'class':'text-grey-600 mb-1'}).text.strip()\r\n            academie = soup.find('div',{'class':'flex flex-col items-center sm:flex-row flex-wrap gap-5'}).text.split(',')[1].strip()\r\n            city     = soup.find('a',{'class':'capitalize underline'}).text.strip()\r\n\r\n            json_output = {\r\n                'Exists':True,\r\n                'academie':academie,\r\n                'Link':link,\r\n                'mention':mention,\r\n                'ville':city,\r\n                'Diplome':diplome\r\n            }\r\n            return json_output\r\n        elif len(listt) == 0:\r\n            profile = str(i).lower()\r\n            if pren.lower() in profile and name.lower() in profile:\r\n                    listt.append(profile)\r\n\r\n                    \r\ndef last_diplomes_brevet(name,pren):\r\n    url = f'https://resultats.etudiant.lefigaro.fr/resultats-brevet/recherche?name={pren} {name}&city_label=&city_insee='\r\n    r = requests.get(url)\r\n    page = r.content\r\n    features = \"html.parser\"\r\n    soup = BeautifulSoup(page, features)\r\n    profiles = soup.find_all('div',{'class':'bg-white p-2'})    \r\n    for i in profiles:\r\n        profile = str(i).lower()\r\n        if pren.lower() in profile and name.lower() in profile:\r\n            url = \"https://resultats.etudiant.lefigaro.fr\"+profile.split('href')[1].split('\"')[1]\r\n            r = requests.get(url)\r\n            page = r.content\r\n            features = \"html.parser\"\r\n            soup = BeautifulSoup(page, features)\r\n            \r\n            profile = soup.find('div',{'class':'box'})\r\n            mention = soup.find('span',{'class':'block text-4xl text-red'})\r\n            diplome = soup.find('p',{'class':'text-grey-600 mb-1'})\r\n\r\n            diplome    = str(diplome).split('text-grey-600 mb-1\">')[1].split('</p>')[0]\r\n            nom_prenom = str(profile).split('h1>')[1].split('<span')[0]\r\n            ville      = str(profile).split('capitalize\">')[1].split('</span>')[0]\r\n            academie   = str(profile).split('(')[1].split(')')[0]\r\n            mention    = str(mention).split('class=\"block text-4xl text-red\">')[1].split('</span>')[0]\r\n\r\n\r\n            json_output = {\r\n                'Exists':True,\r\n                \"Name\":nom_prenom.strip(),\r\n                'academie':academie,\r\n                'Link':url,\r\n                'mention':mention,\r\n                'ville':ville,\r\n                'Diplome':diplome\r\n            }\r\n            return json_output\r\n"
  },
  {
    "path": "modules/face_recognition/face_recon.py",
    "content": "import requests\r\nimport io\r\nfrom PIL import Image\r\nimport numpy as np\r\nimport cv2\r\n\r\ndef contains_face(image_url):\r\n  response = requests.get(image_url)\r\n  image = response.content\r\n\r\n  image = Image.open(io.BytesIO(image))\r\n\r\n  image_np = np.asarray(image)\r\n\r\n  face_cascade = cv2.CascadeClassifier(r'modules\\face_recognition\\lbpcascade_frontalface.xml')\r\n\r\n  gray = cv2.cvtColor(image_np, cv2.COLOR_BGR2GRAY)\r\n\r\n  faces = face_cascade.detectMultiScale(gray, scaleFactor=1.1, minNeighbors=5, minSize=(30, 30))\r\n\r\n  return len(faces) > 0\r\n\r\ndef check(image_url): \r\n  if contains_face(image_url):\r\n    return True\r\n  else:\r\n    return None\r\n"
  },
  {
    "path": "modules/face_recognition/lbpcascade_frontalface.xml",
    "content": "<?xml version=\"1.0\"?>\r\n<!--\r\nnumber of positive samples 3000\r\nnumber of negative samples 1500\r\n-->\r\n<opencv_storage>\r\n<cascade type_id=\"opencv-cascade-classifier\">\r\n  <stageType>BOOST</stageType>\r\n  <featureType>LBP</featureType>\r\n  <height>24</height>\r\n  <width>24</width>\r\n  <stageParams>\r\n    <boostType>GAB</boostType>\r\n    <minHitRate>0.9950000047683716</minHitRate>\r\n    <maxFalseAlarm>0.5000000000000000</maxFalseAlarm>\r\n    <weightTrimRate>0.9500000000000000</weightTrimRate>\r\n    <maxDepth>1</maxDepth>\r\n    <maxWeakCount>100</maxWeakCount></stageParams>\r\n  <featureParams>\r\n    <maxCatCount>256</maxCatCount></featureParams>\r\n  <stageNum>20</stageNum>\r\n  <stages>\r\n    <!-- stage 0 -->\r\n    <_>\r\n      <maxWeakCount>3</maxWeakCount>\r\n      <stageThreshold>-0.7520892024040222</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 46 -67130709 -21569 -1426120013 -1275125205 -21585\r\n            -16385 587145899 -24005</internalNodes>\r\n          <leafValues>\r\n            -0.6543210148811340 0.8888888955116272</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 13 -163512766 -769593758 -10027009 -262145 -514457854\r\n            -193593353 -524289 -1</internalNodes>\r\n          <leafValues>\r\n            -0.7739216089248657 0.7278633713722229</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 2 -363936790 -893203669 -1337948010 -136907894\r\n            1088782736 -134217726 -741544961 -1590337</internalNodes>\r\n          <leafValues>\r\n            -0.7068563103675842 0.6761534214019775</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 1 -->\r\n    <_>\r\n      <maxWeakCount>4</maxWeakCount>\r\n      <stageThreshold>-0.4872078299522400</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 84 2147483647 1946124287 -536870913 2147450879\r\n            738132490 1061101567 243204619 2147446655</internalNodes>\r\n          <leafValues>\r\n            -0.8083735704421997 0.7685696482658386</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 21 2147483647 263176079 1879048191 254749487 1879048191\r\n            -134252545 -268435457 801111999</internalNodes>\r\n          <leafValues>\r\n            -0.7698410153388977 0.6592915654182434</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 106 -98110272 1610939566 -285484400 -850010381\r\n            -189334372 -1671954433 -571026695 -262145</internalNodes>\r\n          <leafValues>\r\n            -0.7506558895111084 0.5444605946540833</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 48 -798690576 -131075 1095771153 -237144073 -65569 -1\r\n            -216727745 -69206049</internalNodes>\r\n          <leafValues>\r\n            -0.7775990366935730 0.5465461611747742</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 2 -->\r\n    <_>\r\n      <maxWeakCount>4</maxWeakCount>\r\n      <stageThreshold>-1.1592328548431396</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 47 -21585 -20549 -100818262 -738254174 -20561 -36865\r\n            -151016790 -134238549</internalNodes>\r\n          <leafValues>\r\n            -0.5601882934570313 0.7743113040924072</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 12 -286003217 183435247 -268994614 -421330945\r\n            -402686081 1090387966 -286785545 -402653185</internalNodes>\r\n          <leafValues>\r\n            -0.6124526262283325 0.6978127956390381</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 26 -50347012 970882927 -50463492 -1253377 -134218251\r\n            -50364513 -33619992 -172490753</internalNodes>\r\n          <leafValues>\r\n            -0.6114496588706970 0.6537628173828125</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 8 -273 -135266321 1877977738 -2088243418 -134217987\r\n            2146926575 -18910642 1095231247</internalNodes>\r\n          <leafValues>\r\n            -0.6854077577590942 0.5403239130973816</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 3 -->\r\n    <_>\r\n      <maxWeakCount>5</maxWeakCount>\r\n      <stageThreshold>-0.7562355995178223</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 96 -1273 1870659519 -20971602 -67633153 -134250731\r\n            2004875127 -250 -150995969</internalNodes>\r\n          <leafValues>\r\n            -0.4051094949245453 0.7584033608436585</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 33 -868162224 -76810262 -4262145 -257 1465211989\r\n            -268959873 -2656269 -524289</internalNodes>\r\n          <leafValues>\r\n            -0.7388162612915039 0.5340843200683594</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 57 -12817 -49 -541103378 -152950 -38993 -20481 -1153876\r\n            -72478976</internalNodes>\r\n          <leafValues>\r\n            -0.6582943797111511 0.5339496731758118</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 125 -269484161 -452984961 -319816180 -1594032130 -2111\r\n            -990117891 -488975296 -520947741</internalNodes>\r\n          <leafValues>\r\n            -0.5981323719024658 0.5323504805564880</leafValues></_>\r\n        <!-- tree 4 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 53 557787431 670265215 -1342193665 -1075892225\r\n            1998528318 1056964607 -33570977 -1</internalNodes>\r\n          <leafValues>\r\n            -0.6498787999153137 0.4913350641727448</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 4 -->\r\n    <_>\r\n      <maxWeakCount>5</maxWeakCount>\r\n      <stageThreshold>-0.8085358142852783</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 60 -536873708 880195381 -16842788 -20971521 -176687276\r\n            -168427659 -16777260 -33554626</internalNodes>\r\n          <leafValues>\r\n            -0.5278195738792419 0.6946372389793396</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 7 -1 -62981529 -1090591130 805330978 -8388827 -41945787\r\n            -39577 -531118985</internalNodes>\r\n          <leafValues>\r\n            -0.5206505060195923 0.6329920291900635</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 98 -725287348 1347747543 -852489 -16809993 1489881036\r\n            -167903241 -1 -1</internalNodes>\r\n          <leafValues>\r\n            -0.7516061067581177 0.4232024252414703</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 44 -32777 1006582562 -65 935312171 -8388609 -1078198273\r\n            -1 733886267</internalNodes>\r\n          <leafValues>\r\n            -0.7639313936233521 0.4123568832874298</leafValues></_>\r\n        <!-- tree 4 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 24 -85474705 2138828511 -1036436754 817625855\r\n            1123369029 -58796809 -1013468481 -194513409</internalNodes>\r\n          <leafValues>\r\n            -0.5123769044876099 0.5791834592819214</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 5 -->\r\n    <_>\r\n      <maxWeakCount>5</maxWeakCount>\r\n      <stageThreshold>-0.5549971461296082</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 42 -17409 -20481 -268457797 -134239493 -17473 -1 -21829\r\n            -21846</internalNodes>\r\n          <leafValues>\r\n            -0.3763174116611481 0.7298233509063721</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 6 -805310737 -2098262358 -269504725 682502698\r\n            2147483519 1740574719 -1090519233 -268472385</internalNodes>\r\n          <leafValues>\r\n            -0.5352765917778015 0.5659480094909668</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 61 -67109678 -6145 -8 -87884584 -20481 -1073762305\r\n            -50856216 -16849696</internalNodes>\r\n          <leafValues>\r\n            -0.5678374171257019 0.4961479902267456</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 123 -138428633 1002418167 -1359008245 -1908670465\r\n            -1346685918 910098423 -1359010520 -1346371657</internalNodes>\r\n          <leafValues>\r\n            -0.5706262588500977 0.4572288393974304</leafValues></_>\r\n        <!-- tree 4 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 9 -89138513 -4196353 1256531674 -1330665426 1216308261\r\n            -36190633 33498198 -151796633</internalNodes>\r\n          <leafValues>\r\n            -0.5344601869583130 0.4672054052352905</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 6 -->\r\n    <_>\r\n      <maxWeakCount>5</maxWeakCount>\r\n      <stageThreshold>-0.8776460289955139</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 105 1073769576 206601725 -34013449 -33554433 -789514004\r\n            -101384321 -690225153 -264193</internalNodes>\r\n          <leafValues>\r\n            -0.7700348496437073 0.5943940877914429</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 30 -1432340997 -823623681 -49153 -34291724 -269484035\r\n            -1342767105 -1078198273 -1277955</internalNodes>\r\n          <leafValues>\r\n            -0.5043668746948242 0.6151274442672730</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 35 -1067385040 -195758209 -436748425 -134217731\r\n            -50855988 -129 -1 -1</internalNodes>\r\n          <leafValues>\r\n            -0.6808040738105774 0.4667325913906097</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 119 832534325 -34111555 -26050561 -423659521 -268468364\r\n            2105014143 -2114244 -17367185</internalNodes>\r\n          <leafValues>\r\n            -0.4927591383457184 0.5401885509490967</leafValues></_>\r\n        <!-- tree 4 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 82 -1089439888 -1080524865 2143059967 -1114121\r\n            -1140949004 -3 -2361356 -739516</internalNodes>\r\n          <leafValues>\r\n            -0.6445107460021973 0.4227822124958038</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 7 -->\r\n    <_>\r\n      <maxWeakCount>6</maxWeakCount>\r\n      <stageThreshold>-1.1139287948608398</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 52 -1074071553 -1074003969 -1 -1280135430 -5324817 -1\r\n            -335548482 582134442</internalNodes>\r\n          <leafValues>\r\n            -0.5307556986808777 0.6258179545402527</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 99 -706937396 -705364068 -540016724 -570495027\r\n            -570630659 -587857963 -33628164 -35848193</internalNodes>\r\n          <leafValues>\r\n            -0.5227634310722351 0.5049746036529541</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 18 -2035630093 42119158 -268503053 -1671444 261017599\r\n            1325432815 1954394111 -805306449</internalNodes>\r\n          <leafValues>\r\n            -0.4983572661876679 0.5106441378593445</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 111 -282529488 -1558073088 1426018736 -170526448\r\n            -546832487 -5113037 -34243375 -570427929</internalNodes>\r\n          <leafValues>\r\n            -0.4990860521793366 0.5060507059097290</leafValues></_>\r\n        <!-- tree 4 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 92 1016332500 -606301707 915094269 -1080086049\r\n            -1837027144 -1361600280 2147318747 1067975613</internalNodes>\r\n          <leafValues>\r\n            -0.5695009231567383 0.4460467398166657</leafValues></_>\r\n        <!-- tree 5 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 51 -656420166 -15413034 -141599534 -603435836\r\n            1505950458 -787556946 -79823438 -1326199134</internalNodes>\r\n          <leafValues>\r\n            -0.6590405106544495 0.3616424500942230</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 8 -->\r\n    <_>\r\n      <maxWeakCount>7</maxWeakCount>\r\n      <stageThreshold>-0.8243625760078430</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 28 -901591776 -201916417 -262 -67371009 -143312112\r\n            -524289 -41943178 -1</internalNodes>\r\n          <leafValues>\r\n            -0.4972776770591736 0.6027074456214905</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 112 -4507851 -411340929 -268437513 -67502145 -17350859\r\n            -32901 -71344315 -29377</internalNodes>\r\n          <leafValues>\r\n            -0.4383158981800079 0.5966237187385559</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 69 -75894785 -117379438 -239063587 -12538500 1485072126\r\n            2076233213 2123118847 801906927</internalNodes>\r\n          <leafValues>\r\n            -0.6386105418205261 0.3977999985218048</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 19 -823480413 786628589 -16876049 -1364262914 242165211\r\n            1315930109 -696268833 -455082829</internalNodes>\r\n          <leafValues>\r\n            -0.5512794256210327 0.4282079637050629</leafValues></_>\r\n        <!-- tree 4 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 73 -521411968 6746762 -1396236286 -2038436114\r\n            -185612509 57669627 -143132877 -1041235973</internalNodes>\r\n          <leafValues>\r\n            -0.6418755054473877 0.3549866080284119</leafValues></_>\r\n        <!-- tree 5 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 126 -478153869 1076028979 -1645895615 1365298272\r\n            -557859073 -339771473 1442574528 -1058802061</internalNodes>\r\n          <leafValues>\r\n            -0.4841901361942291 0.4668019413948059</leafValues></_>\r\n        <!-- tree 6 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 45 -246350404 -1650402048 -1610612745 -788400696\r\n            1467604861 -2787397 1476263935 -4481349</internalNodes>\r\n          <leafValues>\r\n            -0.5855734348297119 0.3879135847091675</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 9 -->\r\n    <_>\r\n      <maxWeakCount>7</maxWeakCount>\r\n      <stageThreshold>-1.2237116098403931</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 114 -24819 1572863935 -16809993 -67108865 2146778388\r\n            1433927541 -268608444 -34865205</internalNodes>\r\n          <leafValues>\r\n            -0.2518476545810700 0.7088654041290283</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 97 -1841359 -134271049 -32769 -5767369 -1116675 -2185\r\n            -8231 -33603327</internalNodes>\r\n          <leafValues>\r\n            -0.4303432404994965 0.5283288359642029</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 25 -1359507589 -1360593090 -1073778729 -269553812\r\n            -809512977 1744707583 -41959433 -134758978</internalNodes>\r\n          <leafValues>\r\n            -0.4259553551673889 0.5440809130668640</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 34 729753407 -134270989 -1140907329 -235200777\r\n            658456383 2147467263 -1140900929 -16385</internalNodes>\r\n          <leafValues>\r\n            -0.5605589151382446 0.4220733344554901</leafValues></_>\r\n        <!-- tree 4 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 134 -310380553 -420675595 -193005472 -353568129\r\n            1205338070 -990380036 887604324 -420544526</internalNodes>\r\n          <leafValues>\r\n            -0.5192656517028809 0.4399855434894562</leafValues></_>\r\n        <!-- tree 5 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 16 -1427119361 1978920959 -287119734 -487068946\r\n            114759245 -540578051 -707510259 -671660453</internalNodes>\r\n          <leafValues>\r\n            -0.5013077259063721 0.4570254683494568</leafValues></_>\r\n        <!-- tree 6 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 74 -738463762 -889949281 -328301948 -121832450\r\n            -1142658284 -1863576559 2146417353 -263185</internalNodes>\r\n          <leafValues>\r\n            -0.4631414115428925 0.4790246188640595</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 10 -->\r\n    <_>\r\n      <maxWeakCount>7</maxWeakCount>\r\n      <stageThreshold>-0.5544230937957764</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 113 -76228780 -65538 -1 -67174401 -148007 -33 -221796\r\n            -272842924</internalNodes>\r\n          <leafValues>\r\n            -0.3949716091156006 0.6082032322883606</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 110 369147696 -1625232112 2138570036 -1189900 790708019\r\n            -1212613127 799948719 -4456483</internalNodes>\r\n          <leafValues>\r\n            -0.4855885505676270 0.4785369932651520</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 37 784215839 -290015241 536832799 -402984963\r\n            -1342414991 -838864897 -176769 -268456129</internalNodes>\r\n          <leafValues>\r\n            -0.4620285332202911 0.4989669024944305</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 41 -486418688 -171915327 -340294900 -21938 -519766032\r\n            -772751172 -73096060 -585322623</internalNodes>\r\n          <leafValues>\r\n            -0.6420643329620361 0.3624351918697357</leafValues></_>\r\n        <!-- tree 4 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 117 -33554953 -475332625 -1423463824 -2077230421\r\n            -4849669 -2080505925 -219032928 -1071915349</internalNodes>\r\n          <leafValues>\r\n            -0.4820112884044647 0.4632140696048737</leafValues></_>\r\n        <!-- tree 5 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 65 -834130468 -134217476 -1349314083 -1073803559\r\n            -619913764 -1449131844 -1386890321 -1979118423</internalNodes>\r\n          <leafValues>\r\n            -0.4465552568435669 0.5061788558959961</leafValues></_>\r\n        <!-- tree 6 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 56 -285249779 1912569855 -16530 -1731022870 -1161904146\r\n            -1342177297 -268439634 -1464078708</internalNodes>\r\n          <leafValues>\r\n            -0.5190586447715759 0.4441480338573456</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 11 -->\r\n    <_>\r\n      <maxWeakCount>7</maxWeakCount>\r\n      <stageThreshold>-0.7161560654640198</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 20 1246232575 1078001186 -10027057 60102 -277348353\r\n            -43646987 -1210581153 1195769615</internalNodes>\r\n          <leafValues>\r\n            -0.4323809444904327 0.5663768053054810</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 15 -778583572 -612921106 -578775890 -4036478\r\n            -1946580497 -1164766570 -1986687009 -12103599</internalNodes>\r\n          <leafValues>\r\n            -0.4588732719421387 0.4547033011913300</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 129 -1073759445 2013231743 -1363169553 -1082459201\r\n            -1414286549 868185983 -1356133589 -1077936257</internalNodes>\r\n          <leafValues>\r\n            -0.5218553543090820 0.4111092388629913</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 102 -84148365 -2093417722 -1204850272 564290299\r\n            -67121221 -1342177350 -1309195902 -776734797</internalNodes>\r\n          <leafValues>\r\n            -0.4920000731945038 0.4326725304126740</leafValues></_>\r\n        <!-- tree 4 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 88 -25694458 67104495 -290216278 -168563037 2083877442\r\n            1702788383 -144191964 -234882162</internalNodes>\r\n          <leafValues>\r\n            -0.4494568109512329 0.4448510706424713</leafValues></_>\r\n        <!-- tree 5 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 59 -857980836 904682741 -1612267521 232279415\r\n            1550862252 -574825221 -357380888 -4579409</internalNodes>\r\n          <leafValues>\r\n            -0.5180826783180237 0.3888972699642181</leafValues></_>\r\n        <!-- tree 6 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 27 -98549440 -137838400 494928389 -246013630 939541351\r\n            -1196072350 -620603549 2137216273</internalNodes>\r\n          <leafValues>\r\n            -0.6081240773200989 0.3333222270011902</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 12 -->\r\n    <_>\r\n      <maxWeakCount>8</maxWeakCount>\r\n      <stageThreshold>-0.6743940711021423</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 29 -150995201 2071191945 -1302151626 536934335\r\n            -1059008937 914128709 1147328110 -268369925</internalNodes>\r\n          <leafValues>\r\n            -0.1790193915367127 0.6605972051620483</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 128 -134509479 1610575703 -1342177289 1861484541\r\n            -1107833788 1577058173 -333558568 -136319041</internalNodes>\r\n          <leafValues>\r\n            -0.3681024610996246 0.5139749646186829</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 70 -1 1060154476 -1090984524 -630918524 -539492875\r\n            779616255 -839568424 -321</internalNodes>\r\n          <leafValues>\r\n            -0.3217232525348663 0.6171553134918213</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 4 -269562385 -285029906 -791084350 -17923776 235286671\r\n            1275504943 1344390399 -966276889</internalNodes>\r\n          <leafValues>\r\n            -0.4373284578323364 0.4358185231685638</leafValues></_>\r\n        <!-- tree 4 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 76 17825984 -747628419 595427229 1474759671 575672208\r\n            -1684005538 872217086 -1155858277</internalNodes>\r\n          <leafValues>\r\n            -0.4404836893081665 0.4601220190525055</leafValues></_>\r\n        <!-- tree 5 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 124 -336593039 1873735591 -822231622 -355795238\r\n            -470820869 -1997537409 -1057132384 -1015285005</internalNodes>\r\n          <leafValues>\r\n            -0.4294152259826660 0.4452161788940430</leafValues></_>\r\n        <!-- tree 6 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 54 -834212130 -593694721 -322142257 -364892500\r\n            -951029539 -302125121 -1615106053 -79249765</internalNodes>\r\n          <leafValues>\r\n            -0.3973052501678467 0.4854526817798615</leafValues></_>\r\n        <!-- tree 7 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 95 1342144479 2147431935 -33554561 -47873 -855685912 -1\r\n            1988052447 536827383</internalNodes>\r\n          <leafValues>\r\n            -0.7054683566093445 0.2697997391223908</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 13 -->\r\n    <_>\r\n      <maxWeakCount>9</maxWeakCount>\r\n      <stageThreshold>-1.2042298316955566</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 39 1431368960 -183437936 -537002499 -137497097\r\n            1560590321 -84611081 -2097193 -513</internalNodes>\r\n          <leafValues>\r\n            -0.5905947685241699 0.5101932883262634</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 120 -1645259691 2105491231 2130706431 1458995007\r\n            -8567536 -42483883 -33780003 -21004417</internalNodes>\r\n          <leafValues>\r\n            -0.4449204802513123 0.4490709304809570</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 89 -612381022 -505806938 -362027516 -452985106\r\n            275854917 1920431639 -12600561 -134221825</internalNodes>\r\n          <leafValues>\r\n            -0.4693818688392639 0.4061094820499420</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 14 -805573153 -161 -554172679 -530519488 -16779441\r\n            2000682871 -33604275 -150997129</internalNodes>\r\n          <leafValues>\r\n            -0.3600351214408875 0.5056326985359192</leafValues></_>\r\n        <!-- tree 4 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 67 6192 435166195 1467449341 2046691505 -1608493775\r\n            -4755729 -1083162625 -71365637</internalNodes>\r\n          <leafValues>\r\n            -0.4459891915321350 0.4132415652275085</leafValues></_>\r\n        <!-- tree 5 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 86 -41689215 -3281034 1853357967 -420712635 -415924289\r\n            -270209208 -1088293113 -825311232</internalNodes>\r\n          <leafValues>\r\n            -0.4466069042682648 0.4135067760944367</leafValues></_>\r\n        <!-- tree 6 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 80 -117391116 -42203396 2080374461 -188709 -542008165\r\n            -356831940 -1091125345 -1073796897</internalNodes>\r\n          <leafValues>\r\n            -0.3394956290721893 0.5658645033836365</leafValues></_>\r\n        <!-- tree 7 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 75 -276830049 1378714472 -1342181951 757272098\r\n            1073740607 -282199241 -415761549 170896931</internalNodes>\r\n          <leafValues>\r\n            -0.5346512198448181 0.3584479391574860</leafValues></_>\r\n        <!-- tree 8 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 55 -796075825 -123166849 2113667055 -217530421\r\n            -1107432194 -16385 -806359809 -391188771</internalNodes>\r\n          <leafValues>\r\n            -0.4379335641860962 0.4123645126819611</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 14 -->\r\n    <_>\r\n      <maxWeakCount>10</maxWeakCount>\r\n      <stageThreshold>-0.8402050137519836</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 71 -890246622 15525883 -487690486 47116238 -1212319899\r\n            -1291847681 -68159890 -469829921</internalNodes>\r\n          <leafValues>\r\n            -0.2670986354351044 0.6014143228530884</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 31 -1361180685 -1898008841 -1090588811 -285410071\r\n            -1074016265 -840443905 2147221487 -262145</internalNodes>\r\n          <leafValues>\r\n            -0.4149844348430634 0.4670888185501099</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 40 1426190596 1899364271 2142731795 -142607505\r\n            -508232452 -21563393 -41960001 -65</internalNodes>\r\n          <leafValues>\r\n            -0.4985891580581665 0.3719584941864014</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 109 -201337965 10543906 -236498096 -746195597\r\n            1974565825 -15204415 921907633 -190058309</internalNodes>\r\n          <leafValues>\r\n            -0.4568729996681213 0.3965812027454376</leafValues></_>\r\n        <!-- tree 4 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 130 -595026732 -656401928 -268649235 -571490699\r\n            -440600392 -133131 -358810952 -2004088646</internalNodes>\r\n          <leafValues>\r\n            -0.4770836830139160 0.3862601518630981</leafValues></_>\r\n        <!-- tree 5 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 66 941674740 -1107882114 1332789109 -67691015\r\n            -1360463693 -1556612430 -609108546 733546933</internalNodes>\r\n          <leafValues>\r\n            -0.4877715110778809 0.3778986334800720</leafValues></_>\r\n        <!-- tree 6 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 49 -17114945 -240061474 1552871558 -82775604 -932393844\r\n            -1308544889 -532635478 -99042357</internalNodes>\r\n          <leafValues>\r\n            -0.3721654713153839 0.4994400143623352</leafValues></_>\r\n        <!-- tree 7 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 133 -655906006 1405502603 -939205164 1884929228\r\n            -498859222 559417357 -1928559445 -286264385</internalNodes>\r\n          <leafValues>\r\n            -0.3934195041656494 0.4769641458988190</leafValues></_>\r\n        <!-- tree 8 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 0 -335837777 1860677295 -90 -1946186226 931096183\r\n            251612987 2013265917 -671232197</internalNodes>\r\n          <leafValues>\r\n            -0.4323300719261169 0.4342164099216461</leafValues></_>\r\n        <!-- tree 9 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 103 37769424 -137772680 374692301 2002666345 -536176194\r\n            -1644484728 807009019 1069089930</internalNodes>\r\n          <leafValues>\r\n            -0.4993278682231903 0.3665378093719482</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 15 -->\r\n    <_>\r\n      <maxWeakCount>9</maxWeakCount>\r\n      <stageThreshold>-1.1974394321441650</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 43 -5505 2147462911 2143265466 -4511070 -16450 -257\r\n            -201348440 -71333206</internalNodes>\r\n          <leafValues>\r\n            -0.3310225307941437 0.5624626278877258</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 90 -136842268 -499330741 2015250980 -87107126\r\n            -641665744 -788524639 -1147864792 -134892563</internalNodes>\r\n          <leafValues>\r\n            -0.5266560912132263 0.3704403042793274</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 104 -146800880 -1780368555 2111170033 -140904684\r\n            -16777551 -1946681885 -1646463595 -839131947</internalNodes>\r\n          <leafValues>\r\n            -0.4171888828277588 0.4540435671806335</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 85 -832054034 -981663763 -301990281 -578814081\r\n            -932319000 -1997406723 -33555201 -69206017</internalNodes>\r\n          <leafValues>\r\n            -0.4556705355644226 0.3704262077808380</leafValues></_>\r\n        <!-- tree 4 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 24 -118492417 -1209026825 1119023838 -1334313353\r\n            1112948738 -297319313 1378887291 -139469193</internalNodes>\r\n          <leafValues>\r\n            -0.4182529747486115 0.4267231225967407</leafValues></_>\r\n        <!-- tree 5 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 78 -1714382628 -2353704 -112094959 -549613092\r\n            -1567058760 -1718550464 -342315012 -1074972227</internalNodes>\r\n          <leafValues>\r\n            -0.3625369668006897 0.4684656262397766</leafValues></_>\r\n        <!-- tree 6 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 5 -85219702 316836394 -33279 1904970288 2117267315\r\n            -260901769 -621461759 -88607770</internalNodes>\r\n          <leafValues>\r\n            -0.4742925167083740 0.3689507246017456</leafValues></_>\r\n        <!-- tree 7 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 11 -294654041 -353603585 -1641159686 -50331921\r\n            -2080899877 1145569279 -143132713 -152044037</internalNodes>\r\n          <leafValues>\r\n            -0.3666271567344666 0.4580127298831940</leafValues></_>\r\n        <!-- tree 8 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 32 1887453658 -638545712 -1877976819 -34320972\r\n            -1071067983 -661345416 -583338277 1060190561</internalNodes>\r\n          <leafValues>\r\n            -0.4567637443542481 0.3894708156585693</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 16 -->\r\n    <_>\r\n      <maxWeakCount>9</maxWeakCount>\r\n      <stageThreshold>-0.5733128190040588</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 122 -994063296 1088745462 -318837116 -319881377\r\n            1102566613 1165490103 -121679694 -134744129</internalNodes>\r\n          <leafValues>\r\n            -0.4055117964744568 0.5487945079803467</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 68 -285233233 -538992907 1811935199 -369234005 -529\r\n            -20593 -20505 -1561401854</internalNodes>\r\n          <leafValues>\r\n            -0.3787897229194641 0.4532003402709961</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 58 -1335245632 1968917183 1940861695 536816369\r\n            -1226071367 -570908176 457026619 1000020667</internalNodes>\r\n          <leafValues>\r\n            -0.4258328974246979 0.4202791750431061</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 94 -1360318719 -1979797897 -50435249 -18646473\r\n            -608879292 -805306691 -269304244 -17840167</internalNodes>\r\n          <leafValues>\r\n            -0.4561023116111755 0.4002747833728790</leafValues></_>\r\n        <!-- tree 4 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 87 2062765935 -16449 -1275080721 -16406 45764335\r\n            -1090552065 -772846337 -570464322</internalNodes>\r\n          <leafValues>\r\n            -0.4314672648906708 0.4086346626281738</leafValues></_>\r\n        <!-- tree 5 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 127 -536896021 1080817663 -738234288 -965478709\r\n            -2082767969 1290855887 1993822934 -990381609</internalNodes>\r\n          <leafValues>\r\n            -0.4174543321132660 0.4249868988990784</leafValues></_>\r\n        <!-- tree 6 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 3 -818943025 168730891 -293610428 -79249354 669224671\r\n            621166734 1086506807 1473768907</internalNodes>\r\n          <leafValues>\r\n            -0.4321364760398865 0.4090838730335236</leafValues></_>\r\n        <!-- tree 7 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 79 -68895696 -67107736 -1414315879 -841676168\r\n            -619843344 -1180610531 -1081990469 1043203389</internalNodes>\r\n          <leafValues>\r\n            -0.5018386244773865 0.3702533841133118</leafValues></_>\r\n        <!-- tree 8 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 116 -54002134 -543485719 -2124882422 -1437445858\r\n            -115617074 -1195787391 -1096024366 -2140472445</internalNodes>\r\n          <leafValues>\r\n            -0.5037505626678467 0.3564981222152710</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 17 -->\r\n    <_>\r\n      <maxWeakCount>9</maxWeakCount>\r\n      <stageThreshold>-0.4892596900463104</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 132 -67113211 2003808111 1862135111 846461923 -2752\r\n            2002237273 -273154752 1937223539</internalNodes>\r\n          <leafValues>\r\n            -0.2448196411132813 0.5689709186553955</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 62 1179423888 -78064940 -611839555 -539167899\r\n            -1289358360 -1650810108 -892540499 -1432827684</internalNodes>\r\n          <leafValues>\r\n            -0.4633283913135529 0.3587929606437683</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 23 -285212705 -78450761 -656212031 -264050110 -27787425\r\n            -1334349961 -547662981 -135796924</internalNodes>\r\n          <leafValues>\r\n            -0.3731099069118500 0.4290455579757690</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 77 341863476 403702016 -550588417 1600194541\r\n            -1080690735 951127993 -1388580949 -1153717473</internalNodes>\r\n          <leafValues>\r\n            -0.3658909499645233 0.4556473195552826</leafValues></_>\r\n        <!-- tree 4 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 22 -586880702 -204831512 -100644596 -39319550\r\n            -1191150794 705692513 457203315 -75806957</internalNodes>\r\n          <leafValues>\r\n            -0.5214384198188782 0.3221037387847900</leafValues></_>\r\n        <!-- tree 5 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 72 -416546870 545911370 -673716192 -775559454\r\n            -264113598 139424 -183369982 -204474641</internalNodes>\r\n          <leafValues>\r\n            -0.4289036989212036 0.4004956185817719</leafValues></_>\r\n        <!-- tree 6 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 50 -1026505020 -589692154 -1740499937 -1563770497\r\n            1348491006 -60710713 -1109853489 -633909413</internalNodes>\r\n          <leafValues>\r\n            -0.4621542394161224 0.3832748532295227</leafValues></_>\r\n        <!-- tree 7 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 108 -1448872304 -477895040 -1778390608 -772418127\r\n            -1789923416 -1612057181 -805306693 -1415842113</internalNodes>\r\n          <leafValues>\r\n            -0.3711548447608948 0.4612701535224915</leafValues></_>\r\n        <!-- tree 8 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 92 407905424 -582449988 52654751 -1294472 -285103725\r\n            -74633006 1871559083 1057955850</internalNodes>\r\n          <leafValues>\r\n            -0.5180652141571045 0.3205870389938355</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 18 -->\r\n    <_>\r\n      <maxWeakCount>10</maxWeakCount>\r\n      <stageThreshold>-0.5911940932273865</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 81 4112 -1259563825 -846671428 -100902460 1838164148\r\n            -74153752 -90653988 -1074263896</internalNodes>\r\n          <leafValues>\r\n            -0.2592592537403107 0.5873016119003296</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 1 -285216785 -823206977 -1085589 -1081346 1207959293\r\n            1157103471 2097133565 -2097169</internalNodes>\r\n          <leafValues>\r\n            -0.3801195919513702 0.4718827307224274</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 121 -12465 -536875169 2147478367 2130706303 -37765492\r\n            -866124467 -318782328 -1392509185</internalNodes>\r\n          <leafValues>\r\n            -0.3509117066860199 0.5094807147979736</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 38 2147449663 -20741 -16794757 1945873146 -16710 -1\r\n            -8406341 -67663041</internalNodes>\r\n          <leafValues>\r\n            -0.4068757295608521 0.4130136370658875</leafValues></_>\r\n        <!-- tree 4 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 17 -155191713 866117231 1651407483 548272812 -479201468\r\n            -447742449 1354229504 -261884429</internalNodes>\r\n          <leafValues>\r\n            -0.4557141065597534 0.3539792001247406</leafValues></_>\r\n        <!-- tree 5 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 100 -225319378 -251682065 -492783986 -792341777\r\n            -1287261695 1393643841 -11274182 -213909521</internalNodes>\r\n          <leafValues>\r\n            -0.4117803275585175 0.4118592441082001</leafValues></_>\r\n        <!-- tree 6 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 63 -382220122 -2002072729 -51404800 -371201558\r\n            -923011069 -2135301457 -2066104743 -1042557441</internalNodes>\r\n          <leafValues>\r\n            -0.4008397758007050 0.4034757018089294</leafValues></_>\r\n        <!-- tree 7 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 101 -627353764 -48295149 1581203952 -436258614\r\n            -105268268 -1435893445 -638126888 -1061107126</internalNodes>\r\n          <leafValues>\r\n            -0.5694189667701721 0.2964762747287750</leafValues></_>\r\n        <!-- tree 8 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 118 -8399181 1058107691 -621022752 -251003468 -12582915\r\n            -574619739 -994397789 -1648362021</internalNodes>\r\n          <leafValues>\r\n            -0.3195341229438782 0.5294018983840942</leafValues></_>\r\n        <!-- tree 9 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 92 -348343812 -1078389516 1717960437 364735981\r\n            -1783841602 -4883137 -457572354 -1076950384</internalNodes>\r\n          <leafValues>\r\n            -0.3365339040756226 0.5067458748817444</leafValues></_></weakClassifiers></_>\r\n    <!-- stage 19 -->\r\n    <_>\r\n      <maxWeakCount>10</maxWeakCount>\r\n      <stageThreshold>-0.7612916231155396</stageThreshold>\r\n      <weakClassifiers>\r\n        <!-- tree 0 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 10 -1976661318 -287957604 -1659497122 -782068 43591089\r\n            -453637880 1435470000 -1077438561</internalNodes>\r\n          <leafValues>\r\n            -0.4204545319080353 0.5165745615959168</leafValues></_>\r\n        <!-- tree 1 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 131 -67110925 14874979 -142633168 -1338923040\r\n            2046713291 -2067933195 1473503712 -789579837</internalNodes>\r\n          <leafValues>\r\n            -0.3762553930282593 0.4075302779674530</leafValues></_>\r\n        <!-- tree 2 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 83 -272814301 -1577073 -1118685 -305156120 -1052289\r\n            -1073813756 -538971154 -355523038</internalNodes>\r\n          <leafValues>\r\n            -0.4253497421741486 0.3728055357933044</leafValues></_>\r\n        <!-- tree 3 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 135 -2233 -214486242 -538514758 573747007 -159390971\r\n            1994225489 -973738098 -203424005</internalNodes>\r\n          <leafValues>\r\n            -0.3601998090744019 0.4563256204128265</leafValues></_>\r\n        <!-- tree 4 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 115 -261031688 -1330369299 -641860609 1029570301\r\n            -1306461192 -1196149518 -1529767778 683139823</internalNodes>\r\n          <leafValues>\r\n            -0.4034293889999390 0.4160816967487335</leafValues></_>\r\n        <!-- tree 5 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 64 -572993608 -34042628 -417865 -111109 -1433365268\r\n            -19869715 -1920939864 -1279457063</internalNodes>\r\n          <leafValues>\r\n            -0.3620899617671967 0.4594142735004425</leafValues></_>\r\n        <!-- tree 6 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 36 -626275097 -615256993 1651946018 805366393\r\n            2016559730 -430780849 -799868165 -16580645</internalNodes>\r\n          <leafValues>\r\n            -0.3903816640377045 0.4381459355354309</leafValues></_>\r\n        <!-- tree 7 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 93 1354797300 -1090957603 1976418270 -1342502178\r\n            -1851873892 -1194637077 -1153521668 -1108399474</internalNodes>\r\n          <leafValues>\r\n            -0.3591445386409760 0.4624078869819641</leafValues></_>\r\n        <!-- tree 8 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 91 68157712 1211368313 -304759523 1063017136 798797750\r\n            -275513546 648167355 -1145357350</internalNodes>\r\n          <leafValues>\r\n            -0.4297670423984528 0.4023293554782867</leafValues></_>\r\n        <!-- tree 9 -->\r\n        <_>\r\n          <internalNodes>\r\n            0 -1 107 -546318240 -1628569602 -163577944 -537002306\r\n            -545456389 -1325465645 -380446736 -1058473386</internalNodes>\r\n          <leafValues>\r\n            -0.5727006793022156 0.2995934784412384</leafValues></_></weakClassifiers></_></stages>\r\n  <features>\r\n    <_>\r\n      <rect>\r\n        0 0 3 5</rect></_>\r\n    <_>\r\n      <rect>\r\n        0 0 4 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        0 0 6 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        0 1 2 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        0 1 3 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        0 1 3 7</rect></_>\r\n    <_>\r\n      <rect>\r\n        0 4 3 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        0 11 3 4</rect></_>\r\n    <_>\r\n      <rect>\r\n        0 12 8 4</rect></_>\r\n    <_>\r\n      <rect>\r\n        0 14 4 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        1 0 5 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        1 1 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        1 3 3 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        1 7 4 4</rect></_>\r\n    <_>\r\n      <rect>\r\n        1 12 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        1 13 4 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        1 14 4 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        1 17 3 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        2 0 2 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        2 1 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        2 2 4 6</rect></_>\r\n    <_>\r\n      <rect>\r\n        2 3 4 4</rect></_>\r\n    <_>\r\n      <rect>\r\n        2 7 2 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        2 11 2 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        2 17 3 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        3 0 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        3 1 7 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        3 7 2 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        3 7 2 4</rect></_>\r\n    <_>\r\n      <rect>\r\n        3 18 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        4 0 2 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        4 3 2 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        4 6 2 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        4 6 2 5</rect></_>\r\n    <_>\r\n      <rect>\r\n        4 7 5 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        4 8 4 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        4 18 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        5 0 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        5 3 4 4</rect></_>\r\n    <_>\r\n      <rect>\r\n        5 6 2 5</rect></_>\r\n    <_>\r\n      <rect>\r\n        5 9 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        5 10 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        6 3 4 4</rect></_>\r\n    <_>\r\n      <rect>\r\n        6 4 4 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        6 5 2 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        6 5 2 5</rect></_>\r\n    <_>\r\n      <rect>\r\n        6 5 4 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        6 6 4 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        6 6 4 4</rect></_>\r\n    <_>\r\n      <rect>\r\n        6 18 1 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        6 21 2 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        7 0 3 7</rect></_>\r\n    <_>\r\n      <rect>\r\n        7 4 2 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        7 9 5 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        7 21 2 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        8 0 1 4</rect></_>\r\n    <_>\r\n      <rect>\r\n        8 5 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        8 5 3 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        8 17 3 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        8 18 1 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        9 0 5 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        9 2 2 6</rect></_>\r\n    <_>\r\n      <rect>\r\n        9 5 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        9 11 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        9 16 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        9 16 2 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        9 17 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        9 18 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        10 5 1 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        10 5 3 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        10 7 1 5</rect></_>\r\n    <_>\r\n      <rect>\r\n        10 8 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        10 9 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        10 10 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        10 10 1 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        10 14 3 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        10 15 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        10 15 2 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        10 16 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        10 16 2 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        10 17 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        10 21 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        11 3 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        11 5 1 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        11 5 3 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        11 5 4 6</rect></_>\r\n    <_>\r\n      <rect>\r\n        11 6 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        11 7 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        11 8 1 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        11 10 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        11 10 1 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        11 15 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        11 17 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        11 18 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        12 0 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        12 1 2 5</rect></_>\r\n    <_>\r\n      <rect>\r\n        12 2 4 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        12 3 1 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        12 7 3 4</rect></_>\r\n    <_>\r\n      <rect>\r\n        12 10 3 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        12 11 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        12 12 3 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        12 14 4 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        12 17 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        12 21 2 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        13 6 2 5</rect></_>\r\n    <_>\r\n      <rect>\r\n        13 7 3 5</rect></_>\r\n    <_>\r\n      <rect>\r\n        13 11 3 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        13 17 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        13 17 3 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        13 18 1 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        13 18 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        14 0 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        14 1 1 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        14 2 3 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        14 7 2 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        14 13 2 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        14 13 3 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        14 17 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        15 0 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        15 0 2 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        15 4 3 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        15 4 3 6</rect></_>\r\n    <_>\r\n      <rect>\r\n        15 6 3 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        15 11 3 4</rect></_>\r\n    <_>\r\n      <rect>\r\n        15 13 3 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        15 17 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        15 17 3 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        16 1 2 3</rect></_>\r\n    <_>\r\n      <rect>\r\n        16 3 2 4</rect></_>\r\n    <_>\r\n      <rect>\r\n        16 6 1 1</rect></_>\r\n    <_>\r\n      <rect>\r\n        16 16 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        17 1 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        17 1 2 5</rect></_>\r\n    <_>\r\n      <rect>\r\n        17 12 2 2</rect></_>\r\n    <_>\r\n      <rect>\r\n        18 0 2 2</rect></_></features></cascade>\r\n</opencv_storage>"
  },
  {
    "path": "modules/google_dorking.py",
    "content": ""
  },
  {
    "path": "modules/mail/indic.txt",
    "content": "06000:Free Mobile\r\n06001:Orange\r\n06002:SFR\r\n06003:Bouygues Telecom\r\n06006:Free Mobile\r\n06007:SFR\r\n06008:Orange France\r\n06009:Bouygues Telecom\r\n0601:SFR\r\n06020:Omea Telecom5 SFR et Orange\r\n06021:Omea Telecom5 SFR et Orange\r\n0602:SFR\r\n0603:SFR\r\n0602:SFR et Orange\r\n06026:SFR et Orange\r\n06027:SFR et Orange\r\n06028:SFR et Orange\r\n06029:SFR et Orange\r\n0603:SFR\r\n06040:SFR\r\n06041:SFR\r\n06044:SFR\r\n0604:SFR\r\n06045:SFR\r\n06046:SFR\r\n06047:SFR\r\n06048:SFR\r\n06049:SFR\r\n06050:Auchan Telecom6 SFR\r\n06051:Auchan Telecom6 SFR\r\n06052:Auchan Telecom6 SFR\r\n06053:Auchan Telecom6 SFR\r\n06054:Auchan Telecom6 SFR\r\n06055:LycaMobile7 Bouygues Telecom\r\n06056:LycaMobile7 Bouygues Telecom\r\n06057:LycaMobile7 Bouygues Telecom\r\n06058:LycaMobile7 Bouygues Telecom\r\n06059:LycaMobile7 Bouygues Telecom\r\n06064:Afone6 SFR\r\n06065:NRJ Mobile6 SFR\r\n06066:NRJ Mobile6 SFR\r\n06067:NRJ Mobile6 SFR\r\n06068:NRJ Mobile6 SFR\r\n06069:NRJ Mobile6 SFR\r\n0607:Orange France\r\n0608:Orange France\r\n0609:SFR\r\n061:SFR\r\n062:SFR\r\n0630:Orange France\r\n0631:Orange France\r\n0632:Orange France\r\n0633:Orange France\r\n0634:SFR\r\n0635:SFR\r\n06360:NRJ Mobile6 SFR\r\n06361:NRJ Mobile6 SFR\r\n06362:NRJ Mobile6 SFR\r\n06363:NRJ Mobile6 SFR\r\n06365:NRJ Mobile6 SFR\r\n06366:NRJ Mobile6 SFR\r\n06367:NRJ Mobile6 SFR\r\n06368:NRJ Mobile6 SFR\r\n06369:NRJ Mobile6 SFR\r\n0637:Orange France\r\n063801:Prixtel6 SFR\r\n063802:Prixtel6 SFR\r\n063803:Prixtel6 SFR\r\n063804:Prixtel6 SFR\r\n063805:Prixtel6 SFR\r\n06381:Orange France\r\n06382:Orange France\r\n06383:Orange France\r\n06384:Orange France\r\n06385:Orange France\r\n06386:Orange France\r\n06387:Orange France\r\n06388:Orange France\r\n06389:Orange France\r\n064005:SFR\r\n064006:SFR\r\n064007:SFR\r\n064008:SFR\r\n064009:SFR\r\n06401:Orange France\r\n06402:Orange France\r\n06403:Orange France\r\n06404:Orange France\r\n06405:Orange France\r\n06406:Orange France\r\n06407:Orange France\r\n06408:Orange France\r\n06409:Orange France\r\n06410:SFR\r\n06411:SFR\r\n06412:SFR\r\n06413:SFR\r\n06414:SFR\r\n06415:SFR\r\n064160:SFR\r\n064161:SFR\r\n064164:SFR\r\n06417:NRJMobile SFR\r\n06418:LaPosteMobile SFR\r\n06419:LaPosteMobile SFR\r\n0642:Orange France\r\n0643:Orange France\r\n06440:LaPosteMobile SFR\r\n04441:Orange France\r\n06442:Orange France\r\n06443:Orange France\r\n06444:Bouygues Telecom\r\n06445:Bouygues Telecom\r\n06446:Bouygues Telecom\r\n06447:LaPosteMobile SFR\r\n06448:LaPosteMobile SFR\r\n06449:LaPosteMobile SFR\r\n0645:Orange France\r\n0646:SFR\r\n0647:Orange France\r\n0648:Orange France\r\n06490:SFR et Orange\r\n06491:SFR et Orange\r\n06492:SFR et Orange\r\n06493:SFR et Orange\r\n06494:SFR et Orange\r\n064951:SFR et Orange\r\n064952:SFR et Orange\r\n064953:SFR et Orange\r\n064954:SFR et Orange\r\n064955:SFR et Orange\r\n064956:SFR et Orange\r\n064957:SFR et Orange\r\n064958:SFR et Orange\r\n064959:SFR et Orange\r\n06496:SFR et Orange\r\n06497:SFR et Orange\r\n09498:SFR et Orange\r\n064990:Bouygues Telecom\r\n064991:Bouygues Telecom\r\n064992:SFR et Orange\r\n064993:SFR et Orange\r\n064995:SFR\r\n064998:SFR\r\n064999:SFR\r\n0650:Bouygues Telecom\r\n0651:Free Mobile\r\n0652:Free Mobile\r\n06530:Bouygues Telecom\r\n06531:Bouygues Telecom\r\n06532:Bouygues Telecom\r\n06533:Bouygues Telecom\r\n06534:Bouygues Telecom\r\n06535:Free Mobile\r\n06536:Free Mobile\r\n06537:Free Mobile\r\n06538:Free Mobile\r\n06539:Free Mobile\r\n0654:Orange France\r\n0655:SFR\r\n065666:Prixtel6 SFR\r\n065667:Prixtel6 SFR\r\n065668:Prixtel6 SFR\r\n065669:Prixtel6 SFR\r\n06567:LaPosteMobile SFR\r\n06568:LaPosteMobile SFR\r\n0658:Bouygues Telecom ou Free\r\n0659::Bouygues Telecom\r\n0660:Bouygues Telecom\r\n0661:Bouygues Telecom\r\n0662:Bouygues Telecom\r\n0663:Bouygues Telecom\r\n0664:Bouygues Telecom\r\n0665:Bouygues Telecom\r\n0666:Bouygues Telecom\r\n0667:Bouygues Telecom\r\n0668:Bouygues Telecom\r\n0669:Bouygues Telecom\r\n06690:Bouygues Telecom\r\n06691:Bouygues Telecom\r\n06692:Bouygues Telecom\r\n06693:Bouygues Telecom\r\n06694:Bouygues Telecom\r\n06695:Bouygues Telecom\r\n06696:Bouygues Telecom\r\n06697:Bouygues Telecom\r\n06698:SFR\r\n06699:Bouygues Telecom\r\n067:Orange France\r\n068:Orange France\r\n0695:Free mobile\r\n0698:Bouygues Telecom\r\n0699:Bouygues Telecom\r\n075000:Sisteer6 SFR\t\r\n075001:Sisteer6 SFR\r\n075002:Sisteer6 SFR\r\n075003:Sisteer6 SFR\r\n075004:Sisteer6 SFR\r\n075005:Sisteer6 SFR\r\n075006:Sisteer6 SFR\r\n075007:Sisteer6 SFR\r\n075008:SFR\r\n075009:SFR\r\n07501:SFR\r\n07502:SFR et Orange\r\n07503:SFR et Orange\r\n07504:SFR et Orange\r\n075050:SFR\r\n075051:SFR\r\n075052:SFR\r\n075053:SFR\r\n075054:SFR\r\n075055:SFR\r\n075056:SFR\r\n075057:SFR\r\n075058:SFR\r\n075059:SFR\r\n075060:SFR\r\n075061:SFR et Orange\r\n075062:SFR et Orange\r\n075063:SFR et Orange\r\n075064:SFR et Orange\r\n075065:SFR et Orange\r\n075066:SFR et Orange\r\n075067:SFR et Orange\r\n075068:SFR et Orange\r\n075069:SFR et Orange\r\n075070:SFR\r\n075071:Orange France\r\n075072:Orange France\r\n07508:SFR et Orange\r\n07509:SFR et Orange\r\n07510:Bouygues Telecom\r\n07511:Bouygues Telecom\r\n07512:Bouygues Telecom\r\n07511:Bouygues Telecom\r\n07513:Bouygues Telecom\r\n07514:Bouygues Telecom\r\n07515:Bouygues Telecom\r\n07516:SFR et Orange\r\n075200:SFR\r\n075201:SFR\r\n075202:SFR\r\n075203:SFR\r\n075204:SFR\r\n075205:SFR\r\n075206:SFR\r\n07521:Bouygues Telecom\r\n07522:Bouygues Telecom\r\n07523:Bouygues Telecom\r\n07524:Bouygues Telecom\r\n07525:Bouygues Telecom\r\n0753:Lycamobile7 Bouygues Telecom\r\n075432:Sisteer6 SFR\r\n075550:Orange\r\n075551:Orange\r\n075552:Orange\r\n075553:Orange\r\n075554:Orange\r\n075555:Sisteer6 SFR\r\n075556:Bouygues Telecom\r\n075557:Bouygues Telecom\r\n075859:SFR\r\n075558:SFR\r\n075566:Sisteer6 SFR\r\n075567:SFR\r\n075568:SFR\r\n075598:SFR\r\n075707:SFR et Orange\r\n075717:SFR et Orange\r\n075750:SFR\r\n075751:SFR\r\n075752:SFR\r\n075753:SFR\r\n075754:SFR\r\n075755:SFR\r\n075756:SFR\r\n075757:SFR\r\n075758:SFR\r\n075759:Acropolis Telecom6 - SFR\r\n075760:SFR\r\n075761:SFR\r\n075762:SFR\r\n075763:SFR\r\n075764:SFR\r\n075765:SFR\r\n075766:SFR\r\n075767:SFR\r\n075768:SFR\r\n075969:SFR\r\n075777:SFR\r\n075778:SFR\r\n075787:SFR\r\n0759:SFR\r\n076000:Bouygues Telecom\r\n076001:Bouygues Telecom\r\n076002:Bouygues Telecom\r\n076003:Bouygues Telecom\r\n076004:Bouygues Telecom\r\n076005:Bouygues Telecom\r\n076006:Bouygues Telecom\r\n076007:Bouygues Telecom\r\n076008:Bouygues Telecom\r\n076009:Bouygues Telecom\r\n07601:Bouygues Telecom\r\n07602:Bouygues Telecom\r\n07603:Bouygues Telecom\r\n07604:Bouygues Telecom\r\n07605:Bouygues Telecom\r\n07606:Bouygues Telecom\r\n07607:Bouygues Telecom\r\n07608:Bouygues Telecom\r\n07609:Bouygues Telecom\r\n0761:Bouygues Telecom\r\n0762:Bouygues Telecom\r\n0763:Bouygues Telecom\r\n0764:Bouygues Telecom\r\n0766:Free Mobile\r\n0767:Free Mobile\r\n0768:Free Mobile\r\n0769:Free Mobile\r\n07700:SFR et Orange\r\n07701:SFR et Orange\r\n07702:SFR et Orange\r\n07703:SFR et Orange\r\n07704:SFR et Orange\r\n07705:SFR\r\n07706:SFR\r\n07707:SFR\r\n07708:SFR\r\n07709:SFR\r\n07705:SFR\r\n07706:SFR\r\n07707:SFR\r\n07708:SFR\r\n07710:SFR\r\n07711:SFR\r\n07712:SFR\r\n0777:SFR\r\n0778:SFR\r\n0779:SFR\r\n07800:Afone6 SFR\r\n07801:Afone6 SFR\r\n07802:Afone6 SFR\r\n07803:Afone6 SFR\r\n07804:Afone6 SFR\r\n07805:Afone6 SFR\r\n07806:Afone6 SFR\r\n0781:Free Mobile\r\n0782:Free Mobile\r\n0783:Free Mobile\r\n078413:Orange France\r\n0785:Orange France\r\n078600:Orange France\r\n078601:Orange France\r\n078602:Orange France\r\n078603:Orange France\r\n078604:Orange France\r\n078605:Orange France\r\n078606:Orange France\r\n078607:Orange France\r\n078608:Orange France\r\n078609:Orange France\r\n0786:Orange France\r\n07861:Orange France\r\n07862:Orange France\r\n07863:Orange France\r\n07864:Orange France\r\n07865:Orange France\r\n07866:Orange France\r\n07867:Orange France\r\n07868:Orange France\r\n07869:Orange France\r\n0787:Orange France\r\n07870:Orange France\r\n07871:Orange France\r\n07872:Orange France\r\n07873:Orange France\r\n07874:Orange France\r\n07875::Orange France\r\n07876::Orange France\r\n07877::Orange France\r\n07878:Orange France\r\n07879::Orange France\r\n07872:Orange France\r\n07873:Orange France\r\n07874:Orange France\r\n07875:Orange France\r\n07876:Orange France\r\n07877:Orange France\r\n07878:Orange France\r\n07879:Orange France\r\n07880:Orange France\r\n07881:Orange France\r\n07882:Orange France\r\n07883:Orange France\r\n07884:Orange France\r\n07885:Orange France\r\n0789:Orange France"
  },
  {
    "path": "modules/mail/mail_check.py",
    "content": "import requests\r\n\r\ndef verify(mail):\r\n    try:\r\n        response = requests.get(\"https://isitarealemail.com/api/email/validate\",timeout=1.5,params = {'email': mail},headers = {'Authorization': \"Bearer \" + \"21a3f468-1c3a-43d6-bdd6-d5437d6c0252\" })\r\n        try:\r\n            data = response.json()\r\n            status = data['status']\r\n            if status == \"valid\":\r\n                return \"True\"\r\n            else:\r\n                return None\r\n        except:\r\n            return None\r\n    except:\r\n        return None\r\n"
  },
  {
    "path": "modules/mail/mail_domain.txt",
    "content": "@yandex.ru\r\n@hotmail.com\r\n@outlook.com\r\n@yahoo.com\r\n@gmail.com\r\n@icloud.com\r\n@aol.com\r\n@msn.com\r\n@live.com\r\n"
  },
  {
    "path": "modules/mail/mail_gen.py",
    "content": "import threading, requests, bs4\r\nfrom bs4          import BeautifulSoup\r\nfrom modules.mail import mail_check\r\n#from googlesearch import search\r\n\r\ndef check(name,pren):\r\n    print(\"📪 MailBox guessing ...\")\r\n    name = name.lower()\r\n    pren = pren.lower()\r\n    results = [\r\n        \"{}.{}@gmail.com\".format(name,pren),\r\n        \"{}.{}@hotmail.com\".format(name,pren),\r\n        \"{}{}@hotmail.com\".format(name,pren),\r\n        \"{}{}@hotmail.fr\".format(name,pren),\r\n        \"{}{}@outlook.fr\".format(name,pren),\r\n        \"{}.{}@outlook.com\".format(name,pren),\r\n        \"{}{}@outlook.com\".format(name,pren), \r\n        \"{}.{}@gmail.com\".format(pren,name),\r\n        \"{}.{}@hotmail.com\".format(name,pren),\r\n        \"{}{}@hotmail.com\".format(pren,name),\r\n        \"{}{}@hotmail.fr\".format(pren,name),\r\n        \"{}{}@outlook.fr\".format(pren,name),\r\n        \"{}.{}@outlook.com\".format(pren,name),\r\n        \"{}{}@outlook.com\".format(pren,name),    \r\n    ]\r\n    valid_mails = []\r\n    for i in results:\r\n        a = mail_check.verify(mail=i)\r\n        if a is not None:\r\n            valid_mails.append(i)\r\n    return valid_mails\r\n\r\ndef skype2email(name,pren):\r\n    url = f\"https://www.skypli.com/search/{name} {pren}\"\r\n    r = requests.get(url)\r\n    page = r.content\r\n    features = \"html.parser\"\r\n    soup = BeautifulSoup(page, features)\r\n\r\n    profiles = soup.find_all('span',{'class':'search-results__block-info-username'})[0:5]\r\n\r\n    profiless = []\r\n\r\n    for i in profiles:\r\n        if \"live:.\" in i.text:\r\n            pass\r\n        else:\r\n            profiless.append(i.text.replace('live:','').replace('_1',''))\r\n\r\n    valid_emails = []\r\n\r\n    for i in profiless:\r\n        emails = []\r\n        i = i.lower()\r\n        with open('modules/mail_domain.txt','r') as file:\r\n            lines = file.readlines()\r\n            file.close()\r\n        for line in lines:\r\n            if \"@\" in line and \".\" in line:\r\n                emails.append(i+line)\r\n        for i in emails:\r\n            a = mail_check.verify(mail=i.strip())\r\n            if a is not None:\r\n                valid_emails.append(i.strip())\r\n    return valid_emails\r\n\r\ndef pinterest2email(name,pren):\r\n    try:\r\n        \"\"\"\r\n        therm = 'allintitle: {} {}\"Profil de {} {}\" site:pinterest.com -pin'.format(pren,name,pren,name)\r\n\r\n        a = search(therm, lang=\"fr\")\r\n\r\n        emails = []\r\n        valid_emails = []\r\n\r\n        if len(a) != 0:\r\n            for i in a:\r\n                if \"https://www.pinterest.com/\" not in i:\r\n                    pass\r\n                else:\r\n                    emails.append(i.replace('https://www.pinterest.com/','').replace('/','')+\"@gmail.com\")\r\n        \r\n        for i in emails:\r\n            check = mail_check.verify(mail=i)\r\n            if check is not None:\r\n                valid_emails.append(i)\r\n        if len(valid_emails) > 0:\r\n            return valid_emails\r\n        else:\r\n            return None\r\n        \"\"\"\r\n        return None\r\n    except:\r\n        return None\r\n"
  },
  {
    "path": "modules/mail/scylla_sh.py",
    "content": "import requests\r\n\r\ndef scylla_search(email):\r\n    try:\r\n        r = requests.get('https://scylla.so/search?q=email:{}'.format(email))\r\n        if r.status_code == 500 or r.status_code == 502:\r\n            return None\r\n        try:\r\n            response = r.json()\r\n            if len(response) == 0:\r\n                return None\r\n            else:\r\n                total = []\r\n                for i in response[0:10]:\r\n                    leak_name = i['fields']['domain']\r\n                    try:\r\n                        password = i['fields']['password']\r\n                    except:\r\n                        password = i['fields']['passhash']\r\n                    text = {\r\n                        'Name':leak_name,\r\n                        'Password':password\r\n                    }\r\n                    total.append(text)\r\n                return total\r\n        except:\r\n            return None\r\n    except requests.exceptions.ConnectionError:\r\n        return None\r\n\r\n# By Lui#6166 from Prism Intelligence Group\r\n"
  },
  {
    "path": "modules/official_documents/death_records.py",
    "content": "import profile\r\nimport requests,bs4\r\nfrom bs4 import BeautifulSoup\r\n\r\ndef death_search(name,pren):\r\n    try:\r\n        url = \"https://avis-deces.linternaute.com/recherche-avis?q={} {}\".format(name,pren)\r\n        r = requests.get(url)\r\n        page = r.content\r\n        features = \"html.parser\"\r\n        soup = BeautifulSoup(page, features)\r\n\r\n        names  = soup.find_all('h4')\r\n        ages   = soup.find_all('small')\r\n        villes = soup.find_all('div',{'class':'odResultList__details--death'})\r\n        profile_list = []\r\n\r\n        for i in range(len(names)):\r\n            try:\r\n                name = names[i].text.split('(')[0].replace('\\r','').replace('\\n','').replace('\\t','').strip()\r\n                loc  = villes[i].text.split('à')[1].replace('\\n','').replace('                     ','').strip()\r\n                age  = ages[i].text.strip()\r\n                dictt = {'Name':name,'Age':str(age),'Loc':loc.replace('- ','')}\r\n                profile_list.append(dictt)\r\n            except:\r\n                pass\r\n\r\n        if len(names) == 0:\r\n            return None\r\n        else:\r\n            return profile_list\r\n\r\n    except KeyboardInterrupt:\r\n        return None\r\n"
  },
  {
    "path": "modules/official_documents/dirigeants_bfmtv.py",
    "content": "import requests, bs4\r\nfrom bs4      import BeautifulSoup\r\n\r\ndef bfmtv_search(name,pren):\r\n    try:\r\n        r = requests.get(\"https://www.verif.com/dirigeants/recherche/q/{}6+{}5\".format(name,pren))\r\n        page = r.content\r\n        features = \"html.parser\"\r\n        soup = BeautifulSoup(page, features)\r\n        try:\r\n            full_name = soup.find('a',{'class':'nom'}).text+\" \"+soup.find('td',{'class':'verif_col2'}).text\r\n            naissance = soup.find('td',{'class':'verif_col3'}).text.replace('Né le ','')\r\n            mandats = soup.find('td',{'class':'verif_col5'}).text\r\n            fonction = soup.find('td',{'class':'verif_col4'}).text\r\n            link = str(soup.find('td',{'class':'verif_col4'})).split('href=\"')[1].split('\"')[0]\r\n            link = str(link).replace('<a class=\"nom\" href=\"/','')\r\n            r = requests.get(link)\r\n            page = r.content\r\n            features = \"html.parser\"\r\n            soup = BeautifulSoup(page, features)\r\n\r\n            desc = soup.find('p',{'class':'mid hidden-smallDevice'}).text.strip()\r\n            capital = soup.find('span',{'class':'number'}).text.strip()\r\n            entreprise = soup.find('h3',{'class':'subtitle'}).text.strip()\r\n            adresse_full= str(soup.find('a',{'class':'visible-smallDevice link'})).split('\"_blank\">')[1]\r\n            adresse       = adresse_full.split(\"<br/>\")[0]\r\n            cp            = adresse_full.split(\"<br/>\")[1].split(\"</a>\")[0]\r\n            text = {\"Capital\":capital,\"Desc\":desc,\"addr\":adresse+cp,'company':entreprise,'link':link,'full_name':full_name,'naissance':naissance,'mandats':mandats,'fonction':fonction}            \r\n            return text\r\n        except AttributeError:\r\n            return None\r\n    except:\r\n        return None\r\n"
  },
  {
    "path": "modules/official_documents/pagesblanches_search.py",
    "content": "import requests, bs4\r\nfrom bs4      import BeautifulSoup\r\n\r\ndef adresse_search(name,pren,zipc):\r\n    if zipc is not None:\r\n        r = requests.get('https://www.118000.fr/search?part=1&label={}&who={} {}'.format(zipc,name,pren))\r\n    else:\r\n        r = requests.get('https://www.118000.fr/search?part=1&who={} {}'.format(name,pren))\r\n    page = r.content\r\n    features = \"html.parser\"\r\n    soup = BeautifulSoup(page, features)\r\n\r\n    target_name = soup.find(\"h2\", {\"class\": \"name title inbl\"}).text.strip()\r\n    target_addr = soup.find(\"div\", {\"class\": \"h4 address mtreset\"}).text.strip()\r\n    target_phon = soup.find('a',{'class':'clickable atel'}).text.strip()\r\n    if target_name is not None:\r\n        return  {'Not_Sure':True,'Phone':target_phon,'Name':target_name,'Adress':target_addr,'Type_tel':None,\"Loc_phone\":None,'carrier':None}\r\n    elif target_name is None:\r\n        try:\r\n            r = requests.get('https://www.118000.fr/search?part=1&label={}&who={}'.format(zipc,name))\r\n            page = r.content\r\n            features = \"html.parser\"\r\n            soup = BeautifulSoup(page, features)\r\n\r\n            name_full = soup.find(\"h2\", {\"class\": \"name title inbl\"}).text.strip()\r\n            addr_full = soup.find(\"div\", {\"class\": \"h4 address mtreset\"}).text.replace(', voir sur la carte','').replace('\\n',' ').strip()\r\n            try:\r\n                phon_full = soup.find('a',{'class':'clickable atel'}).text.strip()\r\n            except:\r\n                phon_full = None\r\n            return  {'Not_Sure':False,'Phone':phon_full,'Name':name_full,'Adress':addr_full,'Type_tel':None,\"Loc_phone\":None,'carrier':None}\r\n        except AttributeError:\r\n            return None"
  },
  {
    "path": "modules/phone/phone_search.py",
    "content": ""
  },
  {
    "path": "modules/report.json",
    "content": "{\r\n    \"Name\":false,\r\n    \"LastName\":false,\r\n\r\n    \"UI\":{\r\n        \"Pie\":{\r\n            \"PersonnalLife\":false,\r\n            \"SocialMedias\":false\r\n        },\r\n        \"Bar\":{\r\n            \"TwitterFounds\":false,\r\n            \"InstagramFounds\":false,\r\n            \"FacebookFounds\":false,\r\n            \"SkypeFounds\":false\r\n        }\r\n    },\r\n\r\n    \"AdressPhone\":{\r\n        \"Not_Sure\":false,\r\n        \"Exists\":false,\r\n        \"FullName\":false,\r\n        \"Adress\":false,\r\n        \"Phone\":false,\r\n        \"PhoneLocation\":false\r\n    },\r\n\r\n    \"Work\":{\r\n        \"Exists\":false,\r\n        \"FullName\":false,\r\n        \"BornDate\":false,\r\n        \"Company\":false,\r\n        \"Function\":false,\r\n        \"Warrant\":false,\r\n        \"Link\":false,\r\n        \"Capital\":false,\r\n        \"Desc\":false\r\n    },\r\n    \"Diploma_Bac\":{\r\n        \"Exists\":false,\r\n        \"Link\":false,\r\n        \"Academie\":false,\r\n        \"Mention\":false,\r\n        \"City\":false,\r\n        \"Diplome\":false\r\n    },\r\n    \"Diploma_Brevet\":{\r\n        \"Exists\":false,\r\n        \"Name\":false,\r\n        \"Link\":false,\r\n        \"Academie\":false,\r\n        \"Mention\":false,\r\n        \"City\":false,\r\n        \"Diplome\":false\r\n    },\r\n    \"DeathRecords\":{\r\n        \"Exists\":false,\r\n        \"Records\":false,\r\n        \"AverageAgeUntilDeath\":false\r\n    },\r\n\r\n    \"Emails\":{\r\n        \"HighProbEmails\":false,\r\n        \"PermutatedMailbox\":false\r\n    },\r\n    \"LinkedIN\":{\r\n        \"Exists\":false,\r\n        \"Job\":false,\r\n        \"Location\":false,\r\n        \"urnid\":false,\r\n        \"Url\":false,\r\n        \"Twitters\":false,\r\n        \"Birthdate\":false,\r\n        \"PhoneNumbers\":false\r\n    },\r\n    \"Facebook\":{\r\n        \"Exists\":false,\r\n        \"AccountList\":false\r\n    },\r\n\r\n    \"Skype\":{\r\n        \"Exists\":false,\r\n        \"AccountList\":false\r\n    },\r\n\r\n    \"Instagram\":{\r\n        \"Exists\":false,\r\n        \"AccountList\":false\r\n    },\r\n\r\n    \"Twitter\":{\r\n        \"Exists\":false,\r\n        \"AccountList\":false\r\n    },\r\n    \r\n    \"CopainsDavant\":{\r\n        \"Exists\":false,\r\n        \"Job\":false,\r\n        \"NbKids\":false,\r\n        \"FullName\":false,\r\n        \"BornDate\":false,\r\n        \"Location\":false,\r\n        \"FSituation\":false,\r\n        \"ProfilePicUrl\":false,\r\n        \"ProfileUrl\":false,\r\n        \"OtherLocations\":false\r\n    }\r\n}\r\n"
  },
  {
    "path": "modules/social_medias/copainsdavant_search.py",
    "content": "import requests, json\r\nfrom bs4 import BeautifulSoup\r\nfrom modules.face_recognition import face_recon\r\nfrom colorama import Fore\r\n\r\ndef check_response(url):\r\n    r = requests.get(url,allow_redirects=False)\r\n    status = r.status_code\r\n    if status == 200:\r\n        return True\r\n    else:\r\n        return None\r\n        \r\ndef copains_davant(name,pren):\r\n    headers = {\r\n        'Accept':'application/json, text/javascript, */*; q=0.01',\r\n        'X-Requested-With':'XMLHttpRequest'\r\n    }\r\n    r = requests.get(url='http://copainsdavant.linternaute.com/s/?full=&q={} {}&ty=1&xhr='.format(pren,name),headers=headers)\r\n    try:\r\n        pagephone = r.content.decode().split(',\"$data\":')[1].split('{\"copains\":')[1]\r\n        dataa = pagephone[:-2]\r\n        data = json.loads(dataa)\r\n        users_list = data['users']\r\n        user_list = []\r\n        for i in users_list:\r\n            i = str(i).strip()\r\n            if i != \"0\":\r\n                user_list.append(i)\r\n        new_verified = []\r\n        for i in user_list:\r\n            url = \"https://copainsdavant.linternaute.com/p/{}-{}-{}\".format(pren,name,i)\r\n            response_code = check_response(url)\r\n            if response_code is not None:\r\n                new_verified.append(url)\r\n\r\n        profil_url = new_verified[0]\r\n        r = requests.get(allow_redirects=False,url='{}'.format(profil_url))\r\n        pagephone = r.content\r\n        featuresphone = \"html.parser\"\r\n        soup = BeautifulSoup(pagephone,featuresphone)\r\n        try:\r\n            localisation = str(soup.find('span',{'class':'locality'}).text)\r\n            naissance = str(soup.find('abbr',{'class':'bday'}).text.strip())\r\n            name_full = str(soup.find('a',{'class':'url'}).text.strip())\r\n            photo = str(soup.find('img',{'itemprop':'logo'})).split('itemprop=\"logo\" src=\"')[1].split('\"')[0]\r\n            locations = soup.find_all('span',{'class':'copains_career__city jCcareerTown'})\r\n            dates     = soup.find_all('span',{'class':'copains_career__date jCareerDate'})\r\n\r\n            location_list = []\r\n\r\n            for i in range(len(locations)):\r\n                locat = locations[i].text.strip()\r\n                dat   = dates[i].text.replace('maintenant','Now').strip()\r\n                data = dat+\" | \"+locat\r\n                if data not in location_list:\r\n                    temp_list = []\r\n                    for i in location_list:\r\n                        if locat in i:\r\n                            temp_list.append('.')\r\n                    if len(temp_list) == 0:\r\n                        location_list.append(data)\r\n\r\n            if len(location_list) == 0:\r\n                location_list = None\r\n            if \"/anonymousL.jpg\" in photo:\r\n                photo = \"None\"\r\n                face_detection = None\r\n            else:\r\n                print(\"🧠 Face detection via CopainsDavant profile picture ...\")\r\n                face_detection = face_recon.check(photo)\r\n                if face_detection is not None:\r\n                    print(\"   ->\"+Fore.GREEN+\" Face successfully found ! \"+Fore.RESET)\r\n                    face_detection = True\r\n            card = soup.find('section',{'id':'vcard'}).text.strip()\r\n            job = \"None\"\r\n            nb_kids = \"None\"\r\n            situation_familiale = \"None\"\r\n            if \"Situation familiale\" in card:\r\n                situation_familiale = card.split('Situation familiale :')[1].split(' ')[0].strip()\r\n                situation_familiale = situation_familiale.strip()\r\n            if \"Profession\" in card:\r\n                job = card.split('Profession :')[1].split(' ')[0]\r\n                job = \" \".join(job.split()).split(' ')[0]\r\n            if \"Enfant\" in card:\r\n                nb_kids = card.split(\"Enfants :\")[1].split(\" \")[0]\r\n            text = {'Face_detection':face_detection,'Other_locations':location_list,'url_full':'{}'.format(profil_url),'familial_situation':str(situation_familiale).replace('Enfants','').replace('Aucune','').strip(),'full_name':str(name_full),'born':str(naissance),'localisation':str(localisation),\r\n                \"nb_enfants\":str(nb_kids).strip(),\"Job\":str(job).strip(),'pdp':str(photo),    \r\n            }\r\n            return text\r\n        except AttributeError:\r\n            return None\r\n    except IndexError:\r\n        return None\r\n"
  },
  {
    "path": "modules/social_medias/facebook_search.py",
    "content": "import requests, bs4, re\r\nfrom bs4 import BeautifulSoup\r\n\r\ndef facebook_search(name,pren):\r\n    url = \"https://fr-fr.facebook.com/public/{}-{}\".format(pren,name)\r\n    page = requests.get(url).content.decode('utf-8')\r\n    nameAccount = re.findall(\"width=\\\"72\\\" height=\\\"72\\\" alt=\\\"([a-zA-Z0-9_ é , ]+)\\\" />\", page)\r\n    total_accounts = []\r\n    for i in nameAccount:\r\n        if name.lower() in i.lower() and pren.lower() in i.lower():\r\n            total_accounts.append(i)\r\n        else:\r\n            pass\r\n    if len(total_accounts) == 0:\r\n        return None\r\n    else:\r\n        return total_accounts\r\n\r\n'''\r\nThis code cand be found at : \r\nhttps://github.com/lulz3xploit/LittleBrother/blob/master/core/facebookSearchTool.py\r\n'''\r\n"
  },
  {
    "path": "modules/social_medias/instagram_search.py",
    "content": "import json, httpx, urllib, hmac,hashlib, sys, os, bs4, requests\r\nfrom bs4   import BeautifulSoup\r\n\r\ndef cleartext(text):\r\n    spec_chars = list(',?;:!§/\\|<>*$£¤^¨^')\r\n    for i in range(8):\r\n        for i in spec_chars:\r\n            if i in text:\r\n                text = text.replace(i,'')\r\n    return text\r\n\r\ndef get_info_from_bio(bio):\r\n    lines = bio.split('\\n')\r\n\r\n    religions = [\r\n        ('✡️','Judaism'),\r\n        ('☪️','Islam'),\r\n        ('☦️','Orthodox'),\r\n        ('✝️','Christ'),\r\n        ('🕉️','Hinduism')\r\n    ]\r\n\r\n    hobbies = [\r\n        ('🥊','Boxing'),\r\n        ('🐎','Horses'),\r\n        ('🐴','Horses'),\r\n        ('🎾','Tennis'),\r\n        ('⚽','Football'),\r\n        ('🥋','Martial Arts'),\r\n        ('🏀','Basketball'),\r\n        ('🏈','American Football'),\r\n        ('🏐','Volleyball'),\r\n        ('🎻','Violin'),\r\n        ('🎸','Guitar'),\r\n        ('🎹','Piano'),\r\n        ('🎣','Fishing'),\r\n        ('⛷️','Ski')\r\n    ]\r\n\r\n    astrology_signs = [\r\n        ('♈','Aries','March 21 - April 20'),\r\n        ('♉','Taurus','April 21 - May 21'),\r\n        ('♊','Gemini','May 22 - June 21'),\r\n        ('♋','Cancer','June 22 - July 22'),\r\n        ('♌','Leo','July 23 - August 22'),\r\n        ('♍','Virgo','August 23 - September 23'),\r\n        ('♎','Libra','September 24 - October 23'),\r\n        ('♏','Scorpius','October 24 - November 22'),\r\n        ('♐','Sagittarius','November 23 - December 21'),\r\n        ('♑','Capricorn','December 22 - January 20'),\r\n        ('♒','Aquarius','January 21 - February 19'),\r\n        ('♓','Pisces','February 20 - March 20')\r\n    ]\r\n\r\n    ethnical_origins = [\r\n        ('🇫🇷','France'),\r\n        ('🇨🇭','Swiss'),\r\n        ('🇨🇳','China'),\r\n        ('🇧🇪','Belgium'),\r\n        ('🇦🇱','Albania'),\r\n        ('🇧🇬','Bulgaria'),\r\n        ('🇧🇷','Brazil'),\r\n        ('🇨🇦','Canada'),\r\n        ('🇩🇪','Germany'),\r\n        ('🇮🇱','Israel'),\r\n        ('🇵🇸','Palestine'),\r\n        ('🇺🇸','United States'),\r\n        ('🇵🇹','Portugal'),\r\n        ('🇱🇹','Lithuania'),\r\n        ('🇵🇱','Poland'),\r\n        ('🇷🇺','Russia'),\r\n        ('🇪🇸','Spain'),\r\n        ('🇹🇷','Turkey'),\r\n        ('🇩🇿','Algeria'),\r\n        ('🇲🇦','Morocco'),\r\n        ('🇬🇵','Guadeloupe'),\r\n        ('🇮🇳','India'),\r\n        ('🇱🇺','Luxembourg'),\r\n        ('🇳🇪','Niger'),\r\n        ('🇳🇬','Nigeria'),\r\n        ('🇶🇦','Quatar'),\r\n        ('🇷🇪','Réunion'),\r\n        ('🇷🇴','Romania'),\r\n        ('🇹🇳','Tunisia'),\r\n        ('🇾🇹','Mayotte'),\r\n        ('🇿🇦','South Africa'),\r\n        ('🇲🇽','Mexico'),\r\n        ('🇨🇿','Czech Republic'),\r\n        ('🇯🇵','Japan'),\r\n        ('🇰🇪','Kenya'),\r\n        ('🇰🇵','North Korea'),\r\n        ('🇰🇷','South Korea'),\r\n        ('🇯🇲','Jamaica'),\r\n        ('🇮🇪','Ireland'),\r\n        ('🇬🇷','Greece')\r\n    ]\r\n\r\n    emailss = [\r\n            '@icloud.com',\r\n            '@gmail.com',\r\n            '@gmx.fr',\r\n            '@yahoo.fr',\r\n            '@yahoo.com',\r\n            '@outlook.com'\r\n            '@outlook.fr',\r\n            '@hotmail.fr',\r\n            '@hotmail.com',\r\n            '@live.fr',\r\n            '@live.com',\r\n            '@sfr.fr',\r\n            '@orange.fr',\r\n            '@free.fr',\r\n            '@aol.com',\r\n            '@wanadoo.fr',\r\n            '@neuf.fr',\r\n            '@laposte.net',\r\n            '@yandex.ru',\r\n            '@club-internet.fr',\r\n            '@msn.com',\r\n            '@influencelife.fr',\r\n            '@shaunaevents.com',\r\n            '@we-events.fr',\r\n            '@nabillapro.com',\r\n            '@facebook.com',\r\n            '@protonmail.com',\r\n            '@protonmail.ch',\r\n            '@thepauseagency.com',\r\n            '@alexotime.com',\r\n            '@tomorrowhub.com'\r\n    ]\r\n\r\n    bio_infos       = {}\r\n    emails_final    = []\r\n    snapchat_final  = []\r\n    paypals         = []\r\n    best_friend     = []\r\n    ages            = []\r\n    love_date_since = []\r\n    school_list     = []\r\n    city_list       = []\r\n    lgbt_points     = []\r\n    fb_list         = []\r\n    twitter_list    = []\r\n    flag_list       = []\r\n    religions_targ  = []\r\n    astro_sign      = []\r\n    hobbies_emojis  = []\r\n    love_situation  = []\r\n    tiktok_list     = []\r\n\r\n    for line in lines:\r\n        line = line.replace('</a','').replace('<a href=\"/v','').replace('<a href=\"/t/','')\r\n        line = line.lower()\r\n        for i in religions:\r\n            emoji, religionName = i\r\n            if emoji in line or religionName.lower() in line:\r\n                religions_targ.append(religionName)\r\n        for i in astrology_signs:\r\n            emoji, sign, date = i\r\n            if emoji in line:\r\n                astro_sign.append('{} | {}'.format(sign,date))\r\n        for flagos in ethnical_origins:\r\n            flag, country_full = flagos\r\n            if flag in line:\r\n                flag_list.append(country_full)\r\n        for i in hobbies:\r\n            emoji, name = i\r\n            if emoji in line:\r\n                hobbies_emojis.append(name)\r\n        temp_list_love = []\r\n        for chars in line:\r\n            if chars == \"/\":\r\n                temp_list_love.append('.')\r\n        if \"tik tok\" in line or \"tiktok\" in line:\r\n            if \":\" in line:\r\n                tiktok_list.append(cleartext(line.split(':')[1]))\r\n            else:\r\n                tiktok_list.append(cleartext(line.replace('tik tok','').replace('tiktok','')))\r\n        if \"en couple\" in line or \"🔒\" in line or \"🔐\" in line:\r\n            love_situation.append('Not Free | Taken')\r\n        if \"celib\" in line:\r\n            love_situation.append('Single | Free')\r\n        if \"🏳️‍🌈\" in line or \"🏳️‍⚧️\" in line:\r\n            lgbt_points.append('.')\r\n        if \"facebook\" in line:\r\n            if \":\" in line:\r\n                line = line.split(':')[1]\r\n            fb_list.append(cleartext(line))\r\n        if \"twitter\" in line:\r\n            if \":\" in line:\r\n                line = line.split(':')[1]\r\n            twitter_list.append(cleartext(line))\r\n        if len(temp_list_love) == 2:\r\n            love_date_since.append(line)\r\n        if \"📍\" in line or \"📌\" in line:\r\n            city_list.append(cleartext(line.replace('📍','').replace('📌','').replace(':','')))\r\n        if \"snapchat\" in line or \"snap\" in line or \"👻\" in line or \"sc : \" in line or \"sc:\" in line:\r\n            line = line.replace('👻','').strip()\r\n            if \":\" in line:\r\n                line = line.split(':')[1].strip()\r\n            snapchat_final.append(cleartext(line))\r\n        if \"📚\" in line or \"🎓\" in line:\r\n            school_list.append(cleartext(line.replace('📚','').replace('🎓','').strip()))\r\n        if \"yo\" in line or \"years old\" in line or \"years\" in line or \"🎂\" in line or \"anniv\" in line:\r\n            if \"🎂\" in line:\r\n                line = line.replace('🎂','')\r\n                if \":\" in line:\r\n                    line = line.split(':')[1]\r\n                ages.append(cleartext(line))\r\n            else:\r\n                try:\r\n                    if \"years\" in line:\r\n                        age = int(line.split(\"years\")[0].replace('years','').strip())\r\n                    elif \"yo\" in line:\r\n                        age = int(line.split(\"yo\")[0].replace('yo','').strip())\r\n                    elif 'y' in line:\r\n                        age = int(line.split(\"y\")[0].replace('y','').strip())\r\n                    else:\r\n                        age = int(line.split(\"years\")[0].strip())\r\n                    ages.append(cleartext(str(age)))\r\n                except ValueError:\r\n                    ages.append('Verify by yourself')\r\n        if \"paypal.me/\" in line:\r\n            paypal = (\"paypal.me/\"+line.split(\"paypal.me/\")[1])\r\n            paypals.append(paypal)\r\n        if \"@\" in line:\r\n            line = line.replace('📩','')\r\n            temp_list_emails = []\r\n        if \"/\" in line and '\"' in line:\r\n            temp_list_emails = []\r\n            line = (line.replace('/','@').split('\"')[0])\r\n            temp_list_emails.append('.')\r\n            try:\r\n                domain = '@'+line.split('@')[1]\r\n                if \".\" not in domain:\r\n                    line = \"@\"+line.split(\"@\")[1]\r\n                    if \" \" in line:\r\n                        line = line.split(' ')[0]\r\n                        best_friend.append(line)\r\n                    else:\r\n                        for i in emailss:\r\n                            if domain == i:\r\n                                if line not in emails_final:\r\n                                    if \":\" in line:\r\n                                        line = line.split(':')[1].strip()\r\n                                    emails_final.append(line)\r\n            except:\r\n                pass\r\n    \r\n        if len(tiktok_list) == 0:\r\n            bio_infos['tiktok_list'] = None\r\n        else:\r\n            bio_infos['tiktok_list'] = tiktok_list\r\n        if len(love_situation) == 0:\r\n            bio_infos['love_situation'] = None\r\n        else:\r\n            bio_infos['love_situation'] = love_situation\r\n        if len(hobbies_emojis) == 0:\r\n            bio_infos['Hobbies'] = None\r\n        else:\r\n            bio_infos['Hobbies'] = hobbies_emojis\r\n        if len(religions_targ) == 0:\r\n            bio_infos['religions'] = None\r\n        else:\r\n            bio_infos['religions'] = religions_targ\r\n        if len(astro_sign) == 0:\r\n            bio_infos['astrology'] = None\r\n        else:\r\n            bio_infos['astrology'] = astro_sign\r\n        if len(flag_list) == 0:\r\n            bio_infos['origins'] = None\r\n        else:\r\n            bio_infos['origins'] = flag_list\r\n        if len(fb_list) == 0:\r\n            bio_infos['fb_list'] = None\r\n        else:\r\n            bio_infos['fb_list'] = fb_list\r\n        if len(twitter_list) == 0:\r\n            bio_infos['twitter_list'] = None\r\n        else:\r\n            bio_infos['twitter_list'] = twitter_list\r\n        if len(lgbt_points) == 0:\r\n            bio_infos['lgbt_points'] = None\r\n        else:\r\n            bio_infos['lgbt_points'] = \"a\"\r\n        if len(city_list) == 0:\r\n            bio_infos['city_list'] = None\r\n        else:\r\n            bio_infos['city_list'] = city_list\r\n        if len(school_list) == 0:\r\n            bio_infos['school'] = None\r\n        else:\r\n            bio_infos['school'] = school_list[0].replace(':','')\r\n        if len(snapchat_final) == 0:\r\n            bio_infos['snapchat'] = None\r\n        else:\r\n            bio_infos['snapchat'] = snapchat_final[0].replace('snapchat','').replace('snap','').replace(':','').strip()\r\n        if len(best_friend) == 0:\r\n            bio_infos['best_friend'] = None\r\n        else:\r\n            bio_infos['best_friend'] = best_friend\r\n        if len(ages) == 0:\r\n            bio_infos['age'] = None\r\n        else:\r\n            bio_infos['age'] = str(ages[0])\r\n        if len(emails_final) == 0:\r\n            bio_infos['emails'] = None\r\n        else:\r\n            bio_infos['emails'] = emails_final\r\n        if len(love_date_since) == 0:\r\n            bio_infos['love_date'] = None\r\n        else:\r\n            bio_infos['love_date'] = love_date_since[0]\r\n        if len(paypals) == 0:\r\n            bio_infos['paypal'] = None\r\n        else:\r\n            bio_infos['paypal'] = paypals[0]\r\n    return bio_infos\r\n    \r\ndef getInstagramEmailFromBio(username):\r\n    \r\n    url = \"https://www.picuki.com/profile/{}\".format(username.replace('@',''))\r\n\r\n    r = requests.get(url=url)\r\n    page = r.content.decode()\r\n    features = \"html.parser\"\r\n    soup = BeautifulSoup(page,features)\r\n\r\n    try:\r\n        bioo = str(soup.find('div',{'class':'profile-description'})).split('profile-description\">')[1].split('</div>')[0]\r\n    except:\r\n        bioo = \"Lol\"\r\n    \r\n    return get_info_from_bio(bioo)\r\n\r\ndef get_profile_infos(profile):\r\n    r    = requests.get('https://www.picuki.com/profile/leaelui')\r\n    page = r.content\r\n    features = \"html.parser\"\r\n    soup = BeautifulSoup(page, features)\r\n\r\n    bio = soup.find('div',{'class':'profile-description'})\r\n    followings = soup.find('span',{'class':'follows'})\r\n    followers  = soup.find('span',{'class':'followed_by'})\r\n    posts      = soup.find('span',{'class':'total_posts'})\r\n\r\n    dictt = {\r\n        'Bio':bio,\r\n        'Following':followings,\r\n        'Followers':followers\r\n    }\r\n\r\n    return dictt\r\n    \r\ndef ig_search(name,pren):\r\n    url = \"https://www.picuki.com/search/{} {}\".format(pren,name)\r\n\r\n    r = requests.get(url=url)\r\n    page = r.content.decode()\r\n    features = \"html.parser\"\r\n    soup = BeautifulSoup(page,features)\r\n\r\n    profiles = []\r\n\r\n    profiless = soup.find_all('div',{'class':'result-username'})\r\n    for i in profiless[0:10]:\r\n        i = str(i)\r\n        profiles.append(i.replace('<div class=\"result-username\">','').replace('</div>','').strip())\r\n    return profiles\r\n    \r\n# ============================================================================\r\n\r\n\"\"\"\r\nLICENSE\r\nThis module belong to Palenath | Megadose FROM Toutatis\r\n\r\nGithub : https://github.com/megadose/\r\nTwitter : https://twitter.com/palenath\r\n\r\nModule name : Toutatis\r\nRepo : https://github.com/megadose/toutatis\r\n\"\"\"\r\n\r\ndef advanced_lookup(username):\r\n    USERS_LOOKUP_URL = 'https://i.instagram.com/api/v1/users/lookup/'\r\n    SIG_KEY_VERSION = '4'\r\n    IG_SIG_KEY = 'e6358aeede676184b9fe702b30f4fd35e71744605e39d2181a34cede076b3c33'\r\n\r\n    def generate_signature(data):\r\n        return 'ig_sig_key_version=' + SIG_KEY_VERSION + '&signed_body=' + hmac.new(IG_SIG_KEY.encode('utf-8'),data.encode('utf-8'),hashlib.sha256).hexdigest() + '.'+ urllib.parse.quote_plus(data)\r\n\r\n    def generate_data( phone_number_raw):\r\n        data = {'login_attempt_count': '0',\r\n                'directly_sign_in': 'true',\r\n                'source': 'default',\r\n                'q': phone_number_raw,\r\n                'ig_sig_key_version': SIG_KEY_VERSION\r\n                }\r\n        return data\r\n\r\n    data=generate_signature(json.dumps(generate_data(username)))\r\n    headers={\r\n    \"Accept-Language\": \"en-US\",\r\n    \"User-Agent\": \"Instagram 101.0.0.15.120\",\r\n    \"Content-Type\": \"application/x-www-form-urlencoded; charset=UTF-8\",\r\n    \"Accept-Encoding\": \"gzip, deflate\",\r\n    \"X-FB-HTTP-Engine\": \"Liger\",\r\n    \"Connection\": \"close\"}\r\n    try:\r\n        r = httpx.post(USERS_LOOKUP_URL,headers=headers,data=data)\r\n        rep=r.json()\r\n        return({\"user\":rep,\"error\":None})\r\n    except :\r\n        return({\"user\":None,\"error\":\"rate limit\"})\r\n\r\ndef get_extra_data(username):\r\n    data = advanced_lookup(username)\r\n    final_dict = {}\r\n    status = data['user']['status']\r\n    if status != \"ok\":\r\n        return None\r\n    else:\r\n        try:\r\n            final_dict['obfuscated_email'] = data['user']['obfuscated_email']\r\n        except KeyError:\r\n            final_dict['obfuscated_email'] = None\r\n        try:\r\n            final_dict['obfuscated_phone'] = data['user']['obfuscated_phone']\r\n        except KeyError:\r\n            final_dict['obfuscated_phone'] = None\r\n    return final_dict\r\n"
  },
  {
    "path": "modules/social_medias/linkedin_search.py",
    "content": "from linkedin_api import Linkedin\r\n\r\ndef linkedin_search(name,pren):\r\n    try:\r\n        \"\"\"\r\n        a = search('\"{} {}\" -intitle:\"profiles\" -inurl:\"dir/ \" site:fr.linkedin.com/in/ OR site:fr.linkedin.com/pub/'.format(pren,name), lang=\"fr\")\r\n        if len(a) > 0:\r\n            if name.lower() in a[0] and pren.lower() in a[0]:\r\n                return a[0]\r\n        else:\r\n            return None\r\n        \"\"\"\r\n        return None\r\n    except:\r\n        pass\r\n\r\ndef official_linkedin_search(name,pren):\r\n    username = \"\"\r\n    password = \"\"\r\n\r\n    if len(username) == 0:\r\n        return None\r\n    else:\r\n        api = Linkedin(username=username,password=password)\r\n\r\n        profile_data = api.search_people(keyword_first_name=pren,keyword_last_name=name)\r\n\r\n        if len(profile_data) == 0:\r\n            return None\r\n        else:\r\n            public_id       = profile_data[0]['public_id']\r\n            urn_id          = profile_data[0]['urn_id']\r\n            profile_infos   = api.get_profile(urn_id=urn_id,public_id=public_id)\r\n            profile_contact = api.get_profile_contact_info(urn_id=urn_id,public_id=public_id)\r\n            email_adress    = profile_contact['email_address']\r\n            twitters        = profile_contact['twitter']\r\n            birthdate       = profile_contact['birthdate']\r\n            phone_numbers   = profile_contact['phone_numbers']\r\n            profile_infosz        = api.get_profile(public_id)\r\n            location        = profile_infosz['geoLocationName']\r\n            bio             = profile_infosz['headline']\r\n            \r\n            try:\r\n                job = (profile_infos['headline'])\r\n            except:\r\n                job = None\r\n\r\n            data = {\r\n                'Loc':location,\r\n                'Job':job,\r\n                'Bio':bio,\r\n                'email':email_adress,\r\n                'urnid':urn_id,\r\n                'url':'https://www.linkedin.com/in/'+public_id,\r\n                'twitters':twitters,\r\n                'birthdate':birthdate,\r\n                'phone_numbers':phone_numbers\r\n            }\r\n            return data\r\n\r\n\r\n"
  },
  {
    "path": "modules/social_medias/skype_search.py",
    "content": "import requests, bs4\r\nfrom bs4 import BeautifulSoup\r\n\r\nfrom modules.mail import mail_check\r\n\r\ndef skype_searchh(name,pren):\r\n    url = f\"https://www.skypli.com/search/{name} {pren}\"\r\n    r = requests.get(url)\r\n    page = r.content\r\n    features = \"html.parser\"\r\n    soup = BeautifulSoup(page, features)\r\n\r\n    profiles = soup.find_all('span',{'class':'search-results__block-info-username'})[0:5]\r\n\r\n    profiless = []\r\n\r\n    for i in profiles:\r\n        profiless.append(i.text)\r\n\r\n    profile_dict = []\r\n\r\n    for i in profiless:\r\n        r = requests.get('https://www.skypli.com/profile/{}'.format(i))\r\n        page = r.content\r\n        if \"Page not found.\" in r.text:\r\n            full_name = \"\"\r\n        else:\r\n            features = \"html.parser\"\r\n            soup = BeautifulSoup(page, features)\r\n            name = soup.find_all('div',{'class':'profile-box__table-value'})[1]\r\n            full_name = (name.text.strip())\r\n\r\n        profile_dict.append('{} \\t| {}'.format(i,full_name))\r\n    return profile_dict\r\n"
  },
  {
    "path": "modules/social_medias/soundcloud.py",
    "content": "from selenium import webdriver\nfrom colorama import Fore\nimport time\n\ndef webdriver_usage(name,pren):\n    print(\"🎧 Searching for soundcloud profiles ...\")\n    try:\n        try:\n            options = webdriver.FirefoxOptions()\n            options.headless = True\n            driver = webdriver.Firefox(options=options)\n            driver.get(f\"https://soundcloud.com/search/people?q={pren} {name}\")\n            time.sleep(4.0)\n            source_code = str(driver.page_source)\n            if \"Check the spelling, or try a different search.\" in source_code or \"Sorry we didn't find any results for\" in source_code:\n                pass\n            else:\n                print(f'   -> {Fore.GREEN}Found !{Fore.RESET} Visit : https://soundcloud.com/search/people?q={pren}%20{name}')    \n        except:\n            return None    \n    except KeyboardInterrupt:\n        return\n"
  },
  {
    "path": "modules/social_medias/twitter_search.py",
    "content": "import requests, bs4\r\nfrom bs4 import BeautifulSoup\r\n\r\ndef twitter_search(name,pren):\r\n    url = \"https://www.sotwe.com/search/{} {}\".format(pren,name)\r\n    r = requests.get(url)\r\n    page = r.content\r\n    features = \"html.parser\"\r\n    soup = BeautifulSoup(page, features)\r\n\r\n    usernames = []\r\n\r\n    username = soup.find_all('div',{'class':'v-list-item__subtitle caption'})\r\n    \r\n    for i in username:\r\n        usernames.append(i.text.strip())\r\n\r\n    return usernames\r\n\r\n"
  },
  {
    "path": "modules/social_medias/wattpad_search.py",
    "content": "import time, colorama\r\nfrom colorama import Fore\r\nfrom selenium import webdriver\r\n\r\ndef wattpad_module(pren,name):\r\n    print(\"📔 Searching for Wattpad profiles ...\")\r\n    options = webdriver.FirefoxOptions()\r\n    options.headless = True\r\n    driver = webdriver.Firefox(options=options)\r\n    url = \"https://www.wattpad.com/search/{}%20{}/people\".format(pren,name)\r\n    driver.get(url)\r\n    time.sleep(2.0)\r\n    source_code = str(driver.page_source)\r\n\r\n    if \"Hmmm... il n'y a pas de résultats\" in source_code:\r\n        return None\r\n    else:\r\n        print(f'   -> {Fore.GREEN}Found !{Fore.RESET} Visit : {url}')"
  },
  {
    "path": "modules/visual/logging.py",
    "content": "def speculos_lotus():\r\n    try:\r\n        with open(\"modules/mail_domain.txt\",\"r\") as file:\r\n            lines = file.readlines()\r\n            file.close()\r\n        print(\"\"\"\r\n* NOTE *: \r\n    + You can update DaProfiler using : py profiler.py -u True\r\n    \r\n    + You can add by yourself some others mail domains (ex @mail.mail) \r\n    to search for target emails using that domain.\r\n        HOW :\r\n        . Go to /modules\r\n        . Add your domains ({} Detected) \r\n        \"\"\".format(str(len(lines))))\r\n    except:\r\n        pass\r\n"
  },
  {
    "path": "profiler.py",
    "content": "from colorama.initialise import init\r\n\r\nfrom json import decoder\r\nimport threading, time, colorama, treelib, random, sys, os, argparse, json, requests, webbrowser, socketio, string\r\n\r\nfrom tqdm       import tqdm\r\nfrom treelib    import Node, Tree\r\nfrom colorama   import Fore, Back, Style, init\r\nfrom statistics import mean\r\ninit(autoreset=True)\r\nfrom modules.social_medias  import wattpad_search\r\nfrom modules.social_medias  import skype_search\r\nfrom modules.social_medias  import copainsdavant_search\r\nfrom modules.social_medias  import instagram_search\r\nfrom modules.social_medias  import twitter_search\r\nfrom modules.social_medias  import facebook_search\r\nfrom modules.social_medias  import linkedin_search\r\nfrom modules.official_documents  import dirigeants_bfmtv\r\nfrom modules.official_documents  import death_records\r\nfrom modules.official_documents  import pagesblanches_search\r\nfrom modules.mail  import mail_gen\r\nfrom modules.mail  import scylla_sh\r\nfrom modules.mail  import mail_check\r\nfrom modules.diplomes  import last_diplomes\r\nfrom modules.social_medias  import soundcloud\r\nfrom modules.visual      import logging\r\nfrom modules.api_modules import leakcheck_net\r\n\r\nbanner = False \r\n# Opening json report template\r\ndata_file = open('modules/report.json','r')\r\ndata_export = json.load(data_file)\r\ndata_file.close()\r\n\r\n\r\n# Affichage de la banniere \r\ndef banner():\r\n    if sys.platform == 'win32':\r\n        os.system('cls')\r\n    else:\r\n        os.system('clear')\r\n\r\n    print(\"\"\"\r\n                ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣀⣀⣀⣀⣀⡀⠀⠀⠀⠀⠀⠀⠀\r\n                ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣴⠾⠛⢉⣉⣉⣉⡉⠛⠷⣦⣄⠀⠀⠀⠀\r\n                ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣴⠋⣠⣴⣿⣿⣿⣿⣿⡿⣿⣶⣌⠹⣷⡀⠀⠀\r\n                ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣼⠁⣴⣿⣿⣿⣿⣿⣿⣿⣿⣆⠉⠻⣧⠘⣷⠀⠀\r\n                ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢰⡇⢰⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠀⠀⠈⠀⢹⡇⠀\r\n                ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⡇⢸⣿⠛⣿⣿⣿⣿⣿⣿⡿⠃⠀⠀⠀⠀⢸⡇⠀\r\n                ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣷⠀⢿⡆⠈⠛⠻⠟⠛⠉⠀⠀⠀⠀⠀⠀⣾⠃⠀\r\n                ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⣧⡀⠻⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣼⠃⠀⠀\r\n                ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢼⠿⣦⣄⠀⠀⠀⠀⠀⠀⠀⣀⣴⠟⠁⠀⠀⠀\r\n                ⠀⠀⠀⠀⠀⠀⠀⠀⣠⣾⣿⣦⠀⠀⠈⠉⠛⠓⠲⠶⠖⠚⠋⠉⠀⠀⠀⠀⠀⠀\r\n                ⠀⠀⠀⠀⠀⠀⣠⣾⣿⣿⠟⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n                ⠀⠀⠀⠀⣠⣾⣿⣿⠟⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n                ⠀⠀⠀⣾⣿⣿⠟⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n                ⠀⢀⣄⠈⠛⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n                ⠀⠀⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n    \"\"\")\r\n    print(\"        Get someone's digital identity anonymously 👻 \")\r\n    print(\"             Made by \"+Style.BRIGHT+Fore.RED+\"TheRealDalunacrobate \"+Fore.RESET+Style.RESET_ALL+\"with 💝\")\r\nbanner()\r\n\r\n# Get the arguments\r\nparser = argparse.ArgumentParser()\r\nparser.add_argument(\"-n\", \"--name\", help=\"Victim name\")\r\nparser.add_argument('-ln','--lastname',help=\"Last name of victim\")\r\nparser.add_argument('-json','--json',help=\"Print result in json\")\r\nparser.add_argument('-zp','--zp',help=\"Zip code (Optional)\")\r\n\r\nargs = parser.parse_args()\r\n\r\n# Set the vars\r\nname       = (args.lastname)\r\npren       = (args.name)\r\njson_print = (args.json)\r\nzip_code   = (args.zp)\r\n\r\ndef randomString(length):\r\n    return ''.join(random.choice(string.ascii_letters) for i in range(length))\r\n\r\nthisIsATmpTokenListener = randomString(25);\r\n\r\n\r\npossible_usernames = []\r\nfolder_name = \"{}_{}\".format(pren,name)\r\n\r\npersonnal_life = []\r\nsocial_medias  = []\r\n\r\n# Crraeate the folder for the reports\r\ntry:\r\n    os.mkdir('Reports')\r\nexcept FileExistsError:\r\n    pass\r\ntry:\r\n    os.mkdir('Reports/{}'.format(folder_name))\r\nexcept FileExistsError:\r\n    pass\r\n\r\n# Main\r\ntry:\r\n    if pren and name is not None:\r\n        print(\"\\n🎭 Finding and filtering online identities ...\")\r\n        try:\r\n            copainsdavant_results = copainsdavant_search.copains_davant(name=name,pren=pren)\r\n        except:\r\n            copainsdavant_results = None\r\n        try:\r\n            facebook_results = facebook_search.facebook_search(name=name,pren=pren)\r\n        except:\r\n            facebook_results = None\r\n\r\n        try:\r\n            twitter_results = twitter_search.twitter_search(name=name,pren=pren)\r\n        except:\r\n            twitter_results = None\r\n\r\n        try:\r\n            official_linkedin_search_results = linkedin_search.official_linkedin_search(pren=pren,name=name)\r\n        except:\r\n            official_linkedin_search_results = None\r\n\r\n        try:\r\n            avis_deces_results = death_records.death_search(name=name,pren=pren)\r\n        except:\r\n            avis_deces_results = None\r\n        \r\n        try:\r\n            bfmtv_results = dirigeants_bfmtv.bfmtv_search(name=name,pren=pren)\r\n        except:\r\n            bfmtv_results = None\r\n\r\n\r\n        try:\r\n            instagram_results = instagram_search.ig_search(name=name,pren=pren)\r\n        except:\r\n            instagram_results = None\r\n\r\n        try:\r\n            skype_results = skype_search.skype_searchh(name=name,pren=pren)\r\n        except:\r\n            skype_results = None\r\n\r\n        try:\r\n            diplome_bac = last_diplomes.last_diplomes_bac(name=name,pren=pren)\r\n        except:\r\n            diplome_bac = None\r\n\r\n        try:\r\n            if zip_code is not None:\r\n                pagesblanche = pagesblanches_search.adresse_search(name=name,pren=pren,zipc=str(zip_code))\r\n            else:\r\n                pagesblanche = pagesblanches_search.adresse_search(name=name,pren=pren,zipc=None)\r\n        except:\r\n            pagesblanche = None\r\n\r\n\r\n        try:\r\n            linkedin_results = linkedin_search.linkedin_search(name=name,pren=pren)\r\n        except:\r\n            linkedin_results = None\r\n            \r\n        soundcloud.webdriver_usage(name=name,pren=pren)\r\n        wattpad_results = wattpad_search.wattpad_module(pren,name)\r\n        possible_mail = mail_gen.check(name=name,pren=pren)\r\n        skype2mail = mail_gen.skype2email(name=name,pren=pren)\r\n        pin2mail = mail_gen.pinterest2email(name=name,pren=pren)\r\n    elif len(pren) and len(name) == 0:\r\n        linkedin_results = None\r\n        facebook_results = None\r\n        twitter_results = None\r\n        avis_deces_results = None\r\n        bfmtv_results = None\r\n        instagram_results = None\r\n        copainsdavant_results = None\r\n        skype_results = None\r\n        pagesblanche = None\r\n        possible_mail = None\r\n        skype2mail = None\r\n        pren = \"\"\r\n        name = \"\"\r\n    else:\r\n        linkedin_results = None\r\n        facebook_results = None\r\n        twitter_results = None\r\n        avis_deces_results = None\r\n        bfmtv_results = None\r\n        instagram_results = None\r\n        copainsdavant_results = None\r\n        skype_results = None\r\n        pagesblanche = None\r\n        possible_mail = None\r\n        skype2mail = None\r\n        pren = \"\"\r\n        name = \"\"\r\nexcept TypeError:\r\n    linkedin_results = None\r\n    facebook_results = None\r\n    twitter_results = None\r\n    avis_deces_results = None\r\n    bfmtv_results = None\r\n    instagram_results = None\r\n    copainsdavant_results = None\r\n    skype_results = None\r\n    pagesblanche = None\r\n    possible_mail = None\r\n    skype2mail = None\r\n    pren = \"\"\r\n    name = \"\"  \r\n\r\naverage_age = []\r\n\r\n\r\ntree = Tree()\r\ntree.create_node(f\"{pren} {name}\", 1)\r\ndata_export['Name'] = pren\r\ndata_export['LastName'] = name\r\n\r\ntry:\r\n    diplome_bac = last_diplomes.last_diplomes_bac(name=name,pren=pren)\r\nexcept:\r\n    diplome_bac = None\r\n\r\n# Daprofiler check les deces\r\nif avis_deces_results is not None:\r\n    tree.create_node(\"Death Records\",41518181871541514778,parent=1)\r\n    for i in avis_deces_results[:5]:\r\n        tree.create_node('{} | {}\\t| {}'.format(i['Age'],i['Name'],i['Loc']),parent=41518181871541514778)\r\n    data_export['DeathRecords']['Exists'] = True\r\n    data_export['DeathRecords']['Records'] = avis_deces_results[:5]\r\n    try:\r\n        average_age.append(int(i['Age']))\r\n    except ValueError:\r\n        pass\r\n\r\n# Daprofiler check les linkedin\r\nif linkedin_results is not None:\r\n    tree.create_node('LinkedIN Profile',15418911611515145145,parent=1)\r\n    tree.create_node(linkedin_results,parent=15418911611515145145)\r\ntry:\r\n    if official_linkedin_search_results is not None:\r\n\r\n        Loc           = official_linkedin_search_results['Loc']\r\n        job           = official_linkedin_search_results['Job']\r\n        email         = official_linkedin_search_results['email']\r\n        urnid         = official_linkedin_search_results['urnid']\r\n        url           = official_linkedin_search_results['url']\r\n        twitters      = official_linkedin_search_results['twitters']\r\n        birthdate     = official_linkedin_search_results['birthdate']\r\n        phone_numbers = official_linkedin_search_results['phone_numbers']\r\n\r\n        tree.create_node('LinkedIN (Via API)',15458156411556562162,parent=1)\r\n        tree.create_node(f'UrnID : {urnid}',5151515155,parent=15458156411556562162)\r\n        tree.create_node(f'Url   : {url}',55185514542335,parent=15458156411556562162)\r\n        if len(twitters) > 0:\r\n            tree.create_node('Twitters',25848145481514,parent=15458156411556562162)\r\n            for i in twitters:\r\n                tree.create_node(i,parent=25848145481514)\r\n        else:\r\n            pass\r\n        if len(phone_numbers) > 0:\r\n            tree.create_node('Phone Numbers',28945181781,parent=15458156411556562162)\r\n            for i in phone_numbers:\r\n                tree.create_node(i,parent=28945181781)\r\n        else:\r\n            pass\r\n        if Loc != False:\r\n            tree.create_node(f'Location : {Loc}',4561561510515656,parent=15458156411556562162)\r\n        if job is not None:\r\n            tree.create_node(f'Job : {job}',511515,parent=15458156411556562162)\r\n        if birthdate is not None:\r\n            tree.create_node(f'Birth Date : {birthdate}',5881981648,parent=1058151514851)\r\n        if email is not None:\r\n            tree.create_node(f'Email : {str(email)}',parent=15458156411556562162)\r\n        data_export['LinkedIN']['Exist']        = True\r\n        data_export['LinkedIN']['Job']          = job\r\n        data_export['LinkedIN']['urnid'       ] = urnid\r\n        data_export['LinkedIN']['Url']          = url\r\n        data_export['LinkedIN']['Twitters']     = twitters\r\n        data_export['LinkedIN']['Birthdate']    = birthdate\r\n        data_export['LinkedIN']['PhoneNumbers'] = phone_numbers\r\nexcept:\r\n    pass\r\nif pagesblanche is not None:\r\n    personnal_life.append('.')\r\n    full_name = pagesblanche['Name']\r\n    adress = pagesblanche['Adress']\r\n    phone = pagesblanche['Phone']\r\n    sure_status = pagesblanche['Not_Sure']\r\n    \r\n    data_export['AdressPhone']['Not_Sure'] = sure_status\r\n    data_export['AdressPhone']['Exists'] = True    \r\n    data_export['AdressPhone']['FullName'] = full_name\r\n    data_export['AdressPhone']['Phone'] = phone\r\n    data_export['AdressPhone']['Adress'] = adress\r\n    if sure_status == True:\r\n        tree.create_node(\"Adress - Phone\",2,parent=1)\r\n    else:\r\n        tree.create_node(\"Adress - Phone (You must verify this information)\",2,parent=1)\r\n    tree.create_node(\"Full Name : {}\".format(full_name),22,parent=2)\r\n    tree.create_node(\"Adress    : {}\".format(adress),33,parent=2)\r\n    tree.create_node(\"Phone     : {}\".format(phone),44,parent=2)\r\n    if pagesblanche['carrier'] is not None:\r\n        tree.create_node('Carrier : {}'.format(pagesblanche['carrier']),894,parent=44)\r\n    if pagesblanche['Loc_phone'] is not None:\r\n        tree.create_node('Localisation : {}'.format(pagesblanche['Loc_phone']),55,parent=44)\r\n        data_export['AdressPhone']['PhoneLocation'] = pagesblanche['Loc_phone']\r\n    if pagesblanche['Type_tel'] is not None:\r\n        tree.create_node('Type  : {}'.format(pagesblanche['Type_tel']),66,parent=44)\r\n\r\nif diplome_bac is not None:\r\n    if diplome_bac['Exists'] == True:\r\n        tree.create_node('DIPLOME BAC',58,parent=1)\r\n        tree.create_node('Bac     : '+diplome_bac['Diplome'],848151541514,parent=58)\r\n        tree.create_node('Academy : '+diplome_bac['academie'],848151241514,parent=58)\r\n        tree.create_node('Mention : '+diplome_bac['mention'],848151341514,parent=58)\r\n        tree.create_node('City    : '+diplome_bac['ville'],848151641514,parent=58)\r\n        tree.create_node('Source  : '+diplome_bac['Link'],45994851726,parent=58)\r\n\r\n        data_export['Diploma_Bac']['Exists']   = True\r\n        data_export['Diploma_Bac']['Academie'] = diplome_bac['academie']\r\n        data_export['Diploma_Bac']['Mention']  = diplome_bac['mention']\r\n        data_export['Diploma_Bac']['City']     = diplome_bac['ville']\r\n        data_export['Diploma_Bac']['Diplome']  = diplome_bac['Diplome']\r\n        data_export['Diploma_Bac']['Link']     = diplome_bac['Link']  \r\n\r\n# Daprofiler check les copains davant\r\nif copainsdavant_results is not None:\r\n    personnal_life.append('.')\r\n    data_export['CopainsDavant']['Exists'] = True\r\n    try:\r\n        tree.create_node(\"Copains d'avant\",3,parent=1)\r\n        tree.create_node('Full Name    : {}'.format(copainsdavant_results['full_name']),77,parent=3)\r\n        tree.create_node('Born Date    : {}'.format(copainsdavant_results['born']),88,parent=3)\r\n        tree.create_node('Location : {}'.format(copainsdavant_results['localisation']),99,parent=3)\r\n        tree.create_node('Url          : {}'.format(copainsdavant_results['url_full']),111,parent=3)\r\n        \r\n        data_export['CopainsDavant']['FullName']   = copainsdavant_results['full_name']\r\n        data_export['CopainsDavant']['BornDate']   = copainsdavant_results['born']\r\n        data_export['CopainsDavant']['ProfileUrl'] = copainsdavant_results['url_full'].replace('https://','')\r\n        data_export['CopainsDavant']['Location']   = copainsdavant_results['localisation']\r\n            \r\n        if copainsdavant_results['Other_locations'] is not None:\r\n            chars = \"abcdefghijklmnopqrstuvwxyz1234567890\"\r\n            number_sk = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)\r\n            tree.create_node('Other Locations',number_sk,parent=3)\r\n            for i in copainsdavant_results['Other_locations']:\r\n                if i != copainsdavant_results['localisation']:\r\n                    tree.create_node(i,parent=number_sk)\r\n            data_export['CopainsDavant']['OtherLocations'] = copainsdavant_results['Other_locations']\r\n        if copainsdavant_results['pdp'] != \"None\":\r\n            try:\r\n                tree.create_node('Profile Picture : {}'.format(copainsdavant_results['pdp']),151515454545,parent=3)\r\n                data_export['CopainsDavant']['ProfilePicUrl'] = copainsdavant_results['pdp'].replace('https://','')\r\n            except:\r\n                pass\r\n        if copainsdavant_results['Job'] != \"None\":\r\n            try:\r\n                tree.create_node('Job : {}'.format(copainsdavant_results['Job']),154156132489411,parent=3)\r\n                data_export['CopainsDavant']['Job'] = copainsdavant_results['Job']\r\n            except:\r\n                pass\r\n        if copainsdavant_results['familial_situation'] != \"None\":\r\n            try:\r\n                tree.create_node('Familial Situation : {}'.format(copainsdavant_results['familial_situation'].strip()),44984154114515,parent=3)\r\n                data_export['CopainsDavant']['FSituation'] = copainsdavant_results['familial_situation']\r\n            except:\r\n                pass\r\n        if copainsdavant_results['nb_enfants'] != \"None\":\r\n            try:\r\n                tree.create_node('Number of kids : {}'.format(copainsdavant_results['nb_enfants']),1654518948741,parent=3)\r\n                data_export['CopainsDavant']['NbKids'] = copainsdavant_results['nb_enfants']\r\n            except:\r\n                pass\r\n    except TypeError:\r\n        pass\r\n\r\n# Daprofiler check BFMtv\r\nif bfmtv_results is not None:\r\n    personnal_life.append('.')\r\n    data_export['Work']['Exists'] = True\r\n    data_export['Work']['FullName'] = bfmtv_results['full_name']\r\n    data_export['Work']['BornDate'] = bfmtv_results['naissance']\r\n    data_export['Work']['Company']  = bfmtv_results['company']\r\n    data_export['Work']['Function'] = bfmtv_results['fonction']\r\n    data_export['Work']['Warrant']  = bfmtv_results['mandats']\r\n    data_export['Work']['Link']     = bfmtv_results['link'].replace('https://','')\r\n    data_export['Work']['Capital']  = bfmtv_results['Capital']\r\n    data_export['Work']['Desc']     = bfmtv_results['Desc']\r\n    \r\n    tree.create_node(\"Work - Job\",4,parent=1)\r\n    tree.create_node('Full Name  : {}'.format(bfmtv_results['full_name']),222,parent=4)\r\n    tree.create_node('Born Date  : {}'.format(bfmtv_results['naissance']),333,parent=4)\r\n    tree.create_node('Adress     : {}'.format(bfmtv_results['addr']),888,parent=4)\r\n    tree.create_node('Company    : {}'.format(bfmtv_results['company']),777,parent=4)\r\n    tree.create_node('Desc       : {}'.format(bfmtv_results['Desc']),78285,parent=4)\r\n    tree.create_node('Capital    : {}'.format(bfmtv_results['Capital']),84566,parent=4)\r\n    tree.create_node('Link       : {}'.format(bfmtv_results['link']),666,parent=4)\r\n    tree.create_node('Function   : {}'.format(bfmtv_results['fonction']),444,parent=4)\r\n    tree.create_node('Warrant    : {}'.format(bfmtv_results['mandats']),555,parent=4)\r\n# Daprofiler check twitter\r\nif twitter_results is not None:\r\n    social_medias.append('.')\r\n    data_export['Twitter']['Exists'] = True\r\n    data_export['Twitter']['Accounts'] = twitter_results\r\n    tree.create_node('Twitters',665847555858,parent=1)\r\n    for i in twitter_results:\r\n        temp = []\r\n        chars = \"abcdefghijklmnopqrstuvwxyz1234567890\"\r\n        number_sk = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)        \r\n        domain_list = ['@gmail.com','@hotmail.fr','@hotmail.com','@orange.fr','@outlook.com','@outlook.fr']\r\n        for domain in domain_list:\r\n            a = mail_check.verify(i.replace('@','')+domain)\r\n            if a == \"True\":\r\n                temp.append(i.replace('@','').lower()+domain)\r\n        if len(temp) == 0:\r\n            tree.create_node(i,parent=665847555858)\r\n        else:\r\n            tree.create_node(i,number_sk,parent=665847555858)\r\n            for temp_mail in temp:\r\n                tree.create_node(temp_mail,parent=number_sk)\r\n# Daprofiler check skype\r\nif skype_results is not None:\r\n    social_medias.append('.')\r\n    data_export['Skype']['Exists'] = True\r\n    data_export['Skype']['AccountList'] = skype_results\r\n    if len(skype_results) == 0:\r\n        pass\r\n    else:\r\n        tree.create_node(\"Skype\",6,parent=1)\r\n        tree.create_node(\"Accounts : {}\".format(str(len(skype_results))),12,parent=6)\r\n        for i in skype_results:\r\n            chars = \"abcdefghijklmnopqrstuvwxyz1234567890\"\r\n            number_sk = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)\r\n            tree.create_node(i,number_sk,parent=12)\r\n\r\n# Diploma printing\r\n\r\ntry:\r\n    try:\r\n        diplomess = last_diplomes.last_diplomes_brevet(name=name,pren=pren)\r\n    except :\r\n        diplomess = None\r\n    if diplomess is not None:\r\n        tree.create_node('BREVET DES COLLEGES',452,parent=1)\r\n        tree.create_node('Name     : {}'.format(diplomess['Name']),1816864648,parent=452)\r\n        tree.create_node('Diploma  : {}'.format(diplomess['Diplome']),45855887,parent=452)\r\n        tree.create_node('Details  : {}'.format(diplomess['mention']),45855847,parent=452)\r\n        tree.create_node('Academy  : {}'.format(diplomess['academie']),45855687,parent=452)\r\n        tree.create_node('Location : {}'.format(diplomess['ville']),45855881,parent=452)\r\n        tree.create_node('Source   : {}'.format(diplomess['Link']),45896472,parent=452)\r\n\r\n        data_export['Diploma_Brevet']['Name']     = diplomess['Name']\r\n        data_export['Diploma_Brevet']['Exists']   = True\r\n        data_export['Diploma_Brevet']['Academie'] = diplomess['academie']\r\n        data_export['Diploma_Brevet']['Mention']  = diplomess['mention']\r\n        data_export['Diploma_Brevet']['City']     = diplomess['ville']\r\n        data_export['Diploma_Brevet']['Link']     = diplomess['Link']\r\nexcept NameError:\r\n    pass\r\n# Daprofiler check instagram\r\n\r\nif instagram_results is not None:\r\n    if len(instagram_results) ==  0:\r\n        pass\r\n    else:\r\n        social_medias.append('.')\r\n        data_export['Instagram']['Exists'] = True\r\n        tree.create_node(\"Instagram\",7,parent=1)\r\n        tree.create_node('Accounts : {}'.format(str(len(instagram_results))),13,parent=7)\r\n        acc_json_list = []\r\n        for i in instagram_results:\r\n            chars = \"abcdefghijklmnopqrstuvwxyz1234567890\"\r\n            username = i\r\n            number_ski = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)\r\n            bio_infos = instagram_search.getInstagramEmailFromBio(username)\r\n            tree.create_node(i,number_ski,parent=13)\r\n            try: \r\n                data = instagram_search.get_extra_data(username)\r\n                if data is None: \r\n                    ob_phone = False\r\n                    ob_mail  = False\r\n                    pass\r\n                else:\r\n                    if data != {}:\r\n                        if data['obfuscated_email'] is not None:\r\n                            ob_mail = data['obfuscated_email']\r\n                            tree.create_node(\"Obfuscated Email -> \"+ob_mail,parent=number_ski)\r\n                        else:\r\n                            ob_mail = False\r\n                        if data['obfuscated_phone'] is not None:\r\n                            ob_phone = data['obfuscated_phone']\r\n                            tree.create_node(\"Obfuscated Phone -> \"+ob_phone,parent=number_ski)\r\n                        else:\r\n                            ob_phone = False\r\n                    else:\r\n                        ob_phone = False\r\n                        ob_mail  = False\r\n            finally:\r\n                pass\r\n\r\n            acc_json_list.append({\"Username\":username,'obfuscated_phone':ob_phone,'obfuscated_email':ob_mail})\r\n\r\n            bio_emails = bio_infos['emails']\r\n            paypal_bio = bio_infos['paypal']\r\n            city_loc   = bio_infos['city_list']\r\n            is_lgbt    = bio_infos['lgbt_points']\r\n            schoolname = bio_infos['school']\r\n            bestfriend = bio_infos['best_friend']\r\n            love_date  = bio_infos['love_date']\r\n            age_bio    = bio_infos['age']\r\n            ethnicity  = bio_infos['origins']\r\n            facebook_l = bio_infos['fb_list']\r\n            twitter_l  = bio_infos['twitter_list']\r\n            hobbies    = bio_infos['Hobbies']\r\n            love_situa = bio_infos['love_situation']\r\n            religions  = bio_infos['religions']\r\n            astrologys = bio_infos['astrology']\r\n            if love_situa is not None:\r\n                nnumber_ski = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)\r\n                tree.create_node('Love Situation',nnumber_ski,parent=number_ski)\r\n                for i in love_situa:\r\n                    tree.create_node(i,parent=nnumber_ski)\r\n            if astrologys is not None:\r\n                nnumber_ski = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)\r\n                tree.create_node('Astrologic sign',nnumber_ski,parent=number_ski)\r\n                for i in astrologys:\r\n                    tree.create_node(i,parent=nnumber_ski)\r\n            if religions is not None:\r\n                nnumber_ski = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)\r\n                tree.create_node('Religion(s)',nnumber_ski,parent=number_ski)\r\n                for i in religions:\r\n                    tree.create_node(i,parent=nnumber_ski)\r\n            if hobbies is not None:\r\n                nnumber_ski = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)\r\n                tree.create_node('Hobbies',nnumber_ski,parent=number_ski)\r\n                for i in hobbies:\r\n                    tree.create_node(i,parent=nnumber_ski)\r\n            if bestfriend is not None:\r\n                nnumber_ski = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)\r\n                tree.create_node('Good relationship with',nnumber_ski,parent=number_ski)\r\n                for i in bestfriend:\r\n                    tree.create_node('{}'.format(i),parent=nnumber_ski)\r\n            if is_lgbt is not None:\r\n                lgbt_flag = (Fore.RED+\"█\"+Fore.YELLOW+\"█\"+Fore.GREEN+\"█\"+Fore.BLUE+\"█\"+Fore.MAGENTA+\"█\"+Fore.RESET)\r\n                tree.create_node('{} LGBT Member'.format(lgbt_flag),parent=number_ski)\r\n            if ethnicity is not None:\r\n                tree.create_node('Ethnicity : {}'.format(str(ethnicity).replace('[','').replace(']','').replace(\"'\",\"\")),parent=number_ski)\r\n            if facebook_l is not None:\r\n                tree.create_node('Facebook : {}'.format(str(facebook_l).replace('[','').replace(']','').replace(\"'\",\"\")),parent=number_ski)\r\n            if twitter_l is not None:\r\n                tree.create('Twitter : {}'.format(str(twitter_l).replace('[','').replace(']','').replace(\"'\",\"\")),parent=number_ski)\r\n            if schoolname is not None:\r\n                tree.create_node('School Name : {}'.format(schoolname),parent=number_ski)\r\n            if city_loc is not None:\r\n                tree.create_node('City : {}'.format(city_loc[0]),parent=number_ski)\r\n            if paypal_bio is not None:\r\n                for i in paypal_bio:\r\n                    tree.create_node('Paypal in bio -> '+i,parent=number_ski)\r\n            if bio_emails is not None:\r\n                for i in bio_emails:\r\n                    chars = \"abcdefghijklmnopqrstuvwxyz1234567890\"\r\n                    number_skkk = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)\r\n                    number_skk = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)\r\n                    tree.create_node('Email from bio -> '+Fore.CYAN+i+Fore.RESET,number_skkk,parent=number_ski)\r\n        data_export['Instagram']['AccountList'] = acc_json_list\r\n\r\n# Daprofiler check facebook\r\nif facebook_results is not None:\r\n    social_medias.append('.')\r\n    data_export['Facebook']['Exists'] = True\r\n    nb = str(len(facebook_results))\r\n    tree.create_node(\"Facebook\",9,parent=1)\r\n    tree.create_node('Accounts : {}'.format(nb),10,parent=9)\r\n    data_export['Facebook']['AccountList'] = facebook_results\r\n    for i in facebook_results:\r\n        tree.create_node(i,parent=10)\r\n\r\n# Daprofiler generate Possible Email\r\nif possible_mail is not None:\r\n    if len(possible_mail) != 0 or len(skype2mail) != 0 or pin2mail is not None:\r\n        tree.create_node('Emails extracted',146,parent=1)\r\n        if skype2mail is not None:\r\n            tree.create_node('[++] High probability',142,parent=146)\r\n            no_doubles = []\r\n            for i in skype2mail:\r\n                if i not in no_doubles:\r\n                    chars = \"abcdefghijklmnopqrstuvwxyz1234567890\"\r\n                    number = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)\r\n                    no_doubles.append(i)\r\n                    tree.create_node(i,number,parent=142)\r\n                    # GETTING LEAKED PASSWORDS FROM SCYLLA.SH -> \\modules\\scylla_sh.py\r\n                    scylla_results = scylla_sh.scylla_search(email=i)\r\n                    if scylla_results is not None:\r\n                        tree.create_node('Leaked From : Scylla.sh',1518451,parent=number)\r\n                        for i in scylla_results:\r\n                            chars = \"abcdefghijklmnopqrstuvwxyz1234567890\"\r\n                            number = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)\r\n                            tree.create_node('Leak Name : {}'.format(i['Name']),parent=1518451)\r\n                            tree.create_node('Password  : {}'.format(i['Password']),parent=1518451)\r\n                    # GET LEAKED PASSWORDS FROM LEAKCHET.NET API -> \\api_modules\\leakcheck_net.py\r\n                    a = leakcheck_net.leak_check_api(mail=i)\r\n                    if a is not None:\r\n                        chars = \"abcdefghijklmnopqrstuvwxyz1234567890\"\r\n                        number_pass = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)\r\n                        tree.create_node(\"Leaked Creditentials\",number_pass,parent=number)\r\n                        for i in a:\r\n                            password  = i['password']\r\n                            leak_name = i['leak_name']\r\n                            leak_date = i['leak_date']\r\n                            tree.create_node('Password  : {}'.format(password),parent=number_pass)\r\n                            tree.create_node('Leak Name : {}'.format(leak_name),parent=number_pass)\r\n                            tree.create_node('Leak Date : {}'.format(leak_date),parent=number_pass)\r\n            data_export['Emails']['HighProbEmails'] = no_doubles\r\n        nb= str((len(possible_mail)))          \r\n        if pin2mail is not None:\r\n            tree.create_node('[+++] Very high probability',45451451545545155154,parent=146)\r\n            for i in pin2mail:\r\n                tree.create_node('-> '+Fore.RED+i+Fore.RESET+\" (Scraped from pinterest profile)\",parent=45451451545545155154)\r\n        if int(nb) != 0:\r\n            tree.create_node(\"(\"+nb+\") Possible Mailbox\",8,parent=146)\r\n            data_export['Emails']['PermutatedMailbox'] = possible_mail\r\n            for i in possible_mail:\r\n                tree.create_node(i,parent=8)\r\nprint(\"✅ Ready to be consulted !\")\r\nprint('\\n')\r\n# For data Analyzation\r\ndata_export['UI']['Pie']['PersonnalLife']   = len(personnal_life)\r\ndata_export['UI']['Pie']['SocialMedias']    = len(social_medias)\r\ntry:\r\n    data_export['UI']['Bar']['TwitterFounds']   = len(twitter_results)\r\nexcept TypeError:\r\n    data_export['UI']['Bar']['TwitterFounds']   = 0\r\ntry:\r\n    data_export['UI']['Bar']['InstagramFounds'] = len(instagram_results)\r\nexcept TypeError:\r\n    data_export['UI']['Bar']['InstagramFounds'] = 0\r\ntry:\r\n    data_export['UI']['Bar']['FacebookFounds']  = len(facebook_results)\r\nexcept TypeError:\r\n    data_export['UI']['Bar']['FacebookFounds']  = 0\r\ntry:\r\n    data_export['UI']['Bar']['SkypeFounds']     = len(skype_results)\r\nexcept TypeError:\r\n    data_export['UI']['Bar']['SkypeFounds']     = 0\r\n\r\nif json_print == \"true\" or json_print == \"yes\" or json_print == \"oui\":\r\n    print('-- JSON START --')\r\n    print(data_export)\r\n    print('-- JSON END --')\r\nelse:    \r\n    tree.show()\r\n\r\ndata_file.close()\r\ntry:\r\n    with open(f'Reports/{folder_name}/{name}_{pren}.json','w',encoding='utf8') as f:\r\n        json.dump(data_export,f,indent=4,ensure_ascii=False)\r\n        f.close()\r\nexcept FileNotFoundError:\r\n    os.mkdir('Reports')\r\n    with open(f'Reports/{folder_name}/{name}_{pren}.json','w',encoding='utf8') as f:\r\n        json.dump(data_export,f,indent=4,ensure_ascii=False)\r\n        f.close()\r\n"
  },
  {
    "path": "requirements.txt",
    "content": "requests\r\nbs4\r\nselenium\r\ncolorama\r\ngooglesearch-python\r\ntreelib\r\nleakcheck\r\nupdate_check\r\nhttpx\r\ntqdm\r\nlinkedin-api~=2.0.0a\r\nstatistics\r\npython-socketio\r\nnumpy\r\nopencv-python\r\n"
  }
]