Repository: TheRealDalunacrobate/DaProfiler
Branch: main
Commit: e932cd86ec1f
Files: 37
Total size: 174.9 KB
Directory structure:
gitextract_0eokzll_/
├── .github/
│ ├── ISSUE_TEMPLATE/
│ │ ├── bug_report.md
│ │ ├── custom.md
│ │ └── feature_request.md
│ └── workflows/
│ ├── easyRun.yml
│ └── testCode.yml
├── .gitignore
├── CODE_OF_CONDUCT.md
├── CONTRIBUTING.md
├── LICENSE
├── README.md
├── modules/
│ ├── api_modules/
│ │ └── leakcheck_net.py
│ ├── config/
│ │ └── config.json
│ ├── diplomes/
│ │ └── last_diplomes.py
│ ├── face_recognition/
│ │ ├── face_recon.py
│ │ └── lbpcascade_frontalface.xml
│ ├── google_dorking.py
│ ├── mail/
│ │ ├── indic.txt
│ │ ├── mail_check.py
│ │ ├── mail_domain.txt
│ │ ├── mail_gen.py
│ │ └── scylla_sh.py
│ ├── official_documents/
│ │ ├── death_records.py
│ │ ├── dirigeants_bfmtv.py
│ │ └── pagesblanches_search.py
│ ├── phone/
│ │ └── phone_search.py
│ ├── report.json
│ ├── social_medias/
│ │ ├── copainsdavant_search.py
│ │ ├── facebook_search.py
│ │ ├── instagram_search.py
│ │ ├── linkedin_search.py
│ │ ├── skype_search.py
│ │ ├── soundcloud.py
│ │ ├── twitter_search.py
│ │ └── wattpad_search.py
│ └── visual/
│ └── logging.py
├── profiler.py
└── requirements.txt
================================================
FILE CONTENTS
================================================
================================================
FILE: .github/ISSUE_TEMPLATE/bug_report.md
================================================
---
name: Bug report
about: Create a report to help us improve
title: ''
labels: ''
assignees: ''
---
**Describe the bug**
A clear and concise description of what the bug is.
**To Reproduce**
Steps to reproduce the behavior:
1. Go to '...'
2. Click on '....'
3. Scroll down to '....'
4. See error
**Expected behavior**
A clear and concise description of what you expected to happen.
**Screenshots**
If applicable, add screenshots to help explain your problem.
**Desktop (please complete the following information):**
- OS: [e.g. iOS]
- Browser [e.g. chrome, safari]
- Version [e.g. 22]
**Smartphone (please complete the following information):**
- Device: [e.g. iPhone6]
- OS: [e.g. iOS8.1]
- Browser [e.g. stock browser, safari]
- Version [e.g. 22]
**Additional context**
Add any other context about the problem here.
================================================
FILE: .github/ISSUE_TEMPLATE/custom.md
================================================
---
name: Custom issue template
about: Describe this issue template's purpose here.
title: ''
labels: ''
assignees: ''
---
================================================
FILE: .github/ISSUE_TEMPLATE/feature_request.md
================================================
---
name: Feature request
about: Suggest an idea for this project
title: ''
labels: ''
assignees: ''
---
**Is your feature request related to a problem? Please describe.**
A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]
**Describe the solution you'd like**
A clear and concise description of what you want to happen.
**Describe alternatives you've considered**
A clear and concise description of any alternative solutions or features you've considered.
**Additional context**
Add any other context or screenshots about the feature request here.
================================================
FILE: .github/workflows/easyRun.yml
================================================
name: Daprofiler Easy run
on:
workflow_dispatch:
inputs:
name:
runners:
description: 'nom'
required: true
default: 'marie'
lastname:
runners:
description: 'prenom'
required: true
default: 'lacourt'
permissions:
contents: read
jobs:
build:
runs-on: ubuntu-latest
steps:
- uses: actions/checkout@v3
- name: Set up Python 3.10
uses: actions/setup-python@v3
with:
python-version: "3.10"
- name: Install dependencies
run: |
python -m pip install --upgrade pip
if [ -f requirements.txt ]; then pip install -r requirements.txt; fi
- name: Test code simple args
run: |
python profiler.py -n ${{ github.event.inputs.name }} -ln ${{ github.event.inputs.lastname }}
================================================
FILE: .github/workflows/testCode.yml
================================================
name: Daprofiler test
on:
push:
branches: [ "main" ]
permissions:
contents: read
jobs:
build:
runs-on: ubuntu-latest
steps:
- uses: actions/checkout@v3
- name: Set up Python 3.10
uses: actions/setup-python@v3
with:
python-version: "3.10"
- name: Install dependencies
run: |
python -m pip install --upgrade pip
if [ -f requirements.txt ]; then pip install -r requirements.txt; fi
- name: Test code simple args
run: |
python profiler.py -n marie -ln lacourt
- name: Test code JSON mode
run: |
python profiler.py -n marie -ln lacourt --json true
================================================
FILE: .gitignore
================================================
hub/__pycache__/*
modules/__pycache__/*
modules/visual/__pycache__/*
modules/api_modules/__pycache__/*
Reports/*
hub_reports/*
!user/exemple.txt
!hub_reports/.notEmpty
================================================
FILE: CODE_OF_CONDUCT.md
================================================
# Contributor Covenant Code of Conduct
## Our Pledge
We as members, contributors, and leaders pledge to make participation in our
community a harassment-free experience for everyone, regardless of age, body
size, visible or invisible disability, ethnicity, sex characteristics, gender
identity and expression, level of experience, education, socio-economic status,
nationality, personal appearance, race, religion, or sexual identity
and orientation.
We pledge to act and interact in ways that contribute to an open, welcoming,
diverse, inclusive, and healthy community.
## Our Standards
Examples of behavior that contributes to a positive environment for our
community include:
* Demonstrating empathy and kindness toward other people
* Being respectful of differing opinions, viewpoints, and experiences
* Giving and gracefully accepting constructive feedback
* Accepting responsibility and apologizing to those affected by our mistakes,
and learning from the experience
* Focusing on what is best not just for us as individuals, but for the
overall community
Examples of unacceptable behavior include:
* The use of sexualized language or imagery, and sexual attention or
advances of any kind
* Trolling, insulting or derogatory comments, and personal or political attacks
* Public or private harassment
* Publishing others' private information, such as a physical or email
address, without their explicit permission
* Other conduct which could reasonably be considered inappropriate in a
professional setting
## Enforcement Responsibilities
Community leaders are responsible for clarifying and enforcing our standards of
acceptable behavior and will take appropriate and fair corrective action in
response to any behavior that they deem inappropriate, threatening, offensive,
or harmful.
Community leaders have the right and responsibility to remove, edit, or reject
comments, commits, code, wiki edits, issues, and other contributions that are
not aligned to this Code of Conduct, and will communicate reasons for moderation
decisions when appropriate.
## Scope
This Code of Conduct applies within all community spaces, and also applies when
an individual is officially representing the community in public spaces.
Examples of representing our community include using an official e-mail address,
posting via an official social media account, or acting as an appointed
representative at an online or offline event.
## Enforcement
Instances of abusive, harassing, or otherwise unacceptable behavior may be
reported to the community leaders responsible for enforcement at
daluna_pro@protonmail.ch.
All complaints will be reviewed and investigated promptly and fairly.
All community leaders are obligated to respect the privacy and security of the
reporter of any incident.
## Enforcement Guidelines
Community leaders will follow these Community Impact Guidelines in determining
the consequences for any action they deem in violation of this Code of Conduct:
### 1. Correction
**Community Impact**: Use of inappropriate language or other behavior deemed
unprofessional or unwelcome in the community.
**Consequence**: A private, written warning from community leaders, providing
clarity around the nature of the violation and an explanation of why the
behavior was inappropriate. A public apology may be requested.
### 2. Warning
**Community Impact**: A violation through a single incident or series
of actions.
**Consequence**: A warning with consequences for continued behavior. No
interaction with the people involved, including unsolicited interaction with
those enforcing the Code of Conduct, for a specified period of time. This
includes avoiding interactions in community spaces as well as external channels
like social media. Violating these terms may lead to a temporary or
permanent ban.
### 3. Temporary Ban
**Community Impact**: A serious violation of community standards, including
sustained inappropriate behavior.
**Consequence**: A temporary ban from any sort of interaction or public
communication with the community for a specified period of time. No public or
private interaction with the people involved, including unsolicited interaction
with those enforcing the Code of Conduct, is allowed during this period.
Violating these terms may lead to a permanent ban.
### 4. Permanent Ban
**Community Impact**: Demonstrating a pattern of violation of community
standards, including sustained inappropriate behavior, harassment of an
individual, or aggression toward or disparagement of classes of individuals.
**Consequence**: A permanent ban from any sort of public interaction within
the community.
## Attribution
This Code of Conduct is adapted from the [Contributor Covenant][homepage],
version 2.0, available at
https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
Community Impact Guidelines were inspired by [Mozilla's code of conduct
enforcement ladder](https://github.com/mozilla/diversity).
[homepage]: https://www.contributor-covenant.org
For answers to common questions about this code of conduct, see the FAQ at
https://www.contributor-covenant.org/faq. Translations are available at
https://www.contributor-covenant.org/translations.
================================================
FILE: CONTRIBUTING.md
================================================
No contribution allow before Daprofiler v2
================================================
FILE: LICENSE
================================================
GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. You must make sure that they, too, receive
or can get the source code. And you must show them these terms so they
know their rights.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the
Program specifies that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
<program> Copyright (C) <year> <name of author>
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
<https://www.gnu.org/licenses/>.
The GNU General Public License does not permit incorporating your program
into proprietary programs. If your program is a subroutine library, you
may consider it more useful to permit linking proprietary applications with
the library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License. But first, please read
<https://www.gnu.org/licenses/why-not-lgpl.html>.
================================================
FILE: README.md
================================================
DaProfiler 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.
DaProfiler is also able to check if a face appears on the profile photos of returned accounts.
DaProfiler 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.
The 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.
Input : Name , Last Name <br>
Output : email addresses, landline numbers, physical addresses, social networks, work history, photos, etc.
#### Installation
Python 3.8 & Mozilla Firefox required.
```bash
git clone https://github.com/TheRealDalunacrobate/DaProfiler.git
cd DaProfiler
pip install -r requirements.txt
```
#### Connect to LinkedIN API
+ Go to [modules\linkedin_search](https://github.com/daprofiler/DaProfiler/blob/main/modules/social_medias/linkedin_search.py) then add your creditentials.
## Demo
## Contributions
All suggestions are welcome.
## Code parts used under license and authors
+ [Palenath - Instagram Advanced Lookup Function](https://github.com/megadose/toutatis)
================================================
FILE: modules/api_modules/leakcheck_net.py
================================================
import leakcheck
from leakcheck import LeakCheckAPI
from colorama import Fore
def leak_check_api(mail):
full_results = []
api = LeakCheckAPI()
"""
GET YOUR KEY AT https://leakcheck.net/
"""
keyy = "YOUR_KEY" # PUT YOUR KEY HERE ONLY
if keyy == "YOUR_KEY":
return None
else:
try:
api.set_key(keyy)
api.set_type("email")
api.set_query(mail)
result = api.lookup(with_sources=1)[0:10] # LIMIT OF RESULTS == 10 YOU CAN CHANGE THIS VALUE TO PRINT MORE RESULTS
for i in result:
try:
password = i['line']
except IndexError:
password = None
try:
leak_name = i['sources']
except IndexError:
leak_name = None
try:
leak_date = i['last_breach']
except IndexError:
leak_date = None
dict_res = {
'password':password,
'leak_name':str(leak_name).replace("'","").replace("[","").replace("]",""),
'leak_date':leak_date
}
full_results.append(dict_res)
if len(full_results) == 0:
return None
return full_results
except:
return None
================================================
FILE: modules/config/config.json
================================================
{
"extension": {
"Extension1":"pdf",
"Extension2":"docx",
"Extension3":false
}
}
================================================
FILE: modules/diplomes/last_diplomes.py
================================================
import requests
from bs4 import BeautifulSoup
def last_diplomes_bac(name,pren):
url = f'https://resultats.etudiant.lefigaro.fr/resultats-bac/recherche?name={pren} {name}&city_label=&city_insee='
r = requests.get(url)
page = r.content
features = "html.parser"
soup = BeautifulSoup(page, features)
profiles = soup.find_all('td',{'class':'svelte-11did2l'})
listt = []
for i in profiles:
if len(listt) == 1:
subject = listt[0]
link = "https://resultats.etudiant.lefigaro.fr"+subject.split('href="')[1].split('">')[0]
academie = None
mention = None
ville = None
diplome = None
r = requests.get(link)
page = r.content
features = "html.parser"
soup = BeautifulSoup(page, features)
mention = soup.find('span',{'class':'block text-4xl text-red'}).text.split('"')[1].split('"')[0]
diplome = soup.find('p',{'class':'text-grey-600 mb-1'}).text.strip()
academie = soup.find('div',{'class':'flex flex-col items-center sm:flex-row flex-wrap gap-5'}).text.split(',')[1].strip()
city = soup.find('a',{'class':'capitalize underline'}).text.strip()
json_output = {
'Exists':True,
'academie':academie,
'Link':link,
'mention':mention,
'ville':city,
'Diplome':diplome
}
return json_output
elif len(listt) == 0:
profile = str(i).lower()
if pren.lower() in profile and name.lower() in profile:
listt.append(profile)
def last_diplomes_brevet(name,pren):
url = f'https://resultats.etudiant.lefigaro.fr/resultats-brevet/recherche?name={pren} {name}&city_label=&city_insee='
r = requests.get(url)
page = r.content
features = "html.parser"
soup = BeautifulSoup(page, features)
profiles = soup.find_all('div',{'class':'bg-white p-2'})
for i in profiles:
profile = str(i).lower()
if pren.lower() in profile and name.lower() in profile:
url = "https://resultats.etudiant.lefigaro.fr"+profile.split('href')[1].split('"')[1]
r = requests.get(url)
page = r.content
features = "html.parser"
soup = BeautifulSoup(page, features)
profile = soup.find('div',{'class':'box'})
mention = soup.find('span',{'class':'block text-4xl text-red'})
diplome = soup.find('p',{'class':'text-grey-600 mb-1'})
diplome = str(diplome).split('text-grey-600 mb-1">')[1].split('</p>')[0]
nom_prenom = str(profile).split('h1>')[1].split('<span')[0]
ville = str(profile).split('capitalize">')[1].split('</span>')[0]
academie = str(profile).split('(')[1].split(')')[0]
mention = str(mention).split('class="block text-4xl text-red">')[1].split('</span>')[0]
json_output = {
'Exists':True,
"Name":nom_prenom.strip(),
'academie':academie,
'Link':url,
'mention':mention,
'ville':ville,
'Diplome':diplome
}
return json_output
================================================
FILE: modules/face_recognition/face_recon.py
================================================
import requests
import io
from PIL import Image
import numpy as np
import cv2
def contains_face(image_url):
response = requests.get(image_url)
image = response.content
image = Image.open(io.BytesIO(image))
image_np = np.asarray(image)
face_cascade = cv2.CascadeClassifier(r'modules\face_recognition\lbpcascade_frontalface.xml')
gray = cv2.cvtColor(image_np, cv2.COLOR_BGR2GRAY)
faces = face_cascade.detectMultiScale(gray, scaleFactor=1.1, minNeighbors=5, minSize=(30, 30))
return len(faces) > 0
def check(image_url):
if contains_face(image_url):
return True
else:
return None
================================================
FILE: modules/face_recognition/lbpcascade_frontalface.xml
================================================
<?xml version="1.0"?>
<!--
number of positive samples 3000
number of negative samples 1500
-->
<opencv_storage>
<cascade type_id="opencv-cascade-classifier">
<stageType>BOOST</stageType>
<featureType>LBP</featureType>
<height>24</height>
<width>24</width>
<stageParams>
<boostType>GAB</boostType>
<minHitRate>0.9950000047683716</minHitRate>
<maxFalseAlarm>0.5000000000000000</maxFalseAlarm>
<weightTrimRate>0.9500000000000000</weightTrimRate>
<maxDepth>1</maxDepth>
<maxWeakCount>100</maxWeakCount></stageParams>
<featureParams>
<maxCatCount>256</maxCatCount></featureParams>
<stageNum>20</stageNum>
<stages>
<!-- stage 0 -->
<_>
<maxWeakCount>3</maxWeakCount>
<stageThreshold>-0.7520892024040222</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 46 -67130709 -21569 -1426120013 -1275125205 -21585
-16385 587145899 -24005</internalNodes>
<leafValues>
-0.6543210148811340 0.8888888955116272</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 13 -163512766 -769593758 -10027009 -262145 -514457854
-193593353 -524289 -1</internalNodes>
<leafValues>
-0.7739216089248657 0.7278633713722229</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 2 -363936790 -893203669 -1337948010 -136907894
1088782736 -134217726 -741544961 -1590337</internalNodes>
<leafValues>
-0.7068563103675842 0.6761534214019775</leafValues></_></weakClassifiers></_>
<!-- stage 1 -->
<_>
<maxWeakCount>4</maxWeakCount>
<stageThreshold>-0.4872078299522400</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 84 2147483647 1946124287 -536870913 2147450879
738132490 1061101567 243204619 2147446655</internalNodes>
<leafValues>
-0.8083735704421997 0.7685696482658386</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 21 2147483647 263176079 1879048191 254749487 1879048191
-134252545 -268435457 801111999</internalNodes>
<leafValues>
-0.7698410153388977 0.6592915654182434</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 106 -98110272 1610939566 -285484400 -850010381
-189334372 -1671954433 -571026695 -262145</internalNodes>
<leafValues>
-0.7506558895111084 0.5444605946540833</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 48 -798690576 -131075 1095771153 -237144073 -65569 -1
-216727745 -69206049</internalNodes>
<leafValues>
-0.7775990366935730 0.5465461611747742</leafValues></_></weakClassifiers></_>
<!-- stage 2 -->
<_>
<maxWeakCount>4</maxWeakCount>
<stageThreshold>-1.1592328548431396</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 47 -21585 -20549 -100818262 -738254174 -20561 -36865
-151016790 -134238549</internalNodes>
<leafValues>
-0.5601882934570313 0.7743113040924072</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 12 -286003217 183435247 -268994614 -421330945
-402686081 1090387966 -286785545 -402653185</internalNodes>
<leafValues>
-0.6124526262283325 0.6978127956390381</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 26 -50347012 970882927 -50463492 -1253377 -134218251
-50364513 -33619992 -172490753</internalNodes>
<leafValues>
-0.6114496588706970 0.6537628173828125</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 8 -273 -135266321 1877977738 -2088243418 -134217987
2146926575 -18910642 1095231247</internalNodes>
<leafValues>
-0.6854077577590942 0.5403239130973816</leafValues></_></weakClassifiers></_>
<!-- stage 3 -->
<_>
<maxWeakCount>5</maxWeakCount>
<stageThreshold>-0.7562355995178223</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 96 -1273 1870659519 -20971602 -67633153 -134250731
2004875127 -250 -150995969</internalNodes>
<leafValues>
-0.4051094949245453 0.7584033608436585</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 33 -868162224 -76810262 -4262145 -257 1465211989
-268959873 -2656269 -524289</internalNodes>
<leafValues>
-0.7388162612915039 0.5340843200683594</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 57 -12817 -49 -541103378 -152950 -38993 -20481 -1153876
-72478976</internalNodes>
<leafValues>
-0.6582943797111511 0.5339496731758118</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 125 -269484161 -452984961 -319816180 -1594032130 -2111
-990117891 -488975296 -520947741</internalNodes>
<leafValues>
-0.5981323719024658 0.5323504805564880</leafValues></_>
<!-- tree 4 -->
<_>
<internalNodes>
0 -1 53 557787431 670265215 -1342193665 -1075892225
1998528318 1056964607 -33570977 -1</internalNodes>
<leafValues>
-0.6498787999153137 0.4913350641727448</leafValues></_></weakClassifiers></_>
<!-- stage 4 -->
<_>
<maxWeakCount>5</maxWeakCount>
<stageThreshold>-0.8085358142852783</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 60 -536873708 880195381 -16842788 -20971521 -176687276
-168427659 -16777260 -33554626</internalNodes>
<leafValues>
-0.5278195738792419 0.6946372389793396</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 7 -1 -62981529 -1090591130 805330978 -8388827 -41945787
-39577 -531118985</internalNodes>
<leafValues>
-0.5206505060195923 0.6329920291900635</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 98 -725287348 1347747543 -852489 -16809993 1489881036
-167903241 -1 -1</internalNodes>
<leafValues>
-0.7516061067581177 0.4232024252414703</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 44 -32777 1006582562 -65 935312171 -8388609 -1078198273
-1 733886267</internalNodes>
<leafValues>
-0.7639313936233521 0.4123568832874298</leafValues></_>
<!-- tree 4 -->
<_>
<internalNodes>
0 -1 24 -85474705 2138828511 -1036436754 817625855
1123369029 -58796809 -1013468481 -194513409</internalNodes>
<leafValues>
-0.5123769044876099 0.5791834592819214</leafValues></_></weakClassifiers></_>
<!-- stage 5 -->
<_>
<maxWeakCount>5</maxWeakCount>
<stageThreshold>-0.5549971461296082</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 42 -17409 -20481 -268457797 -134239493 -17473 -1 -21829
-21846</internalNodes>
<leafValues>
-0.3763174116611481 0.7298233509063721</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 6 -805310737 -2098262358 -269504725 682502698
2147483519 1740574719 -1090519233 -268472385</internalNodes>
<leafValues>
-0.5352765917778015 0.5659480094909668</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 61 -67109678 -6145 -8 -87884584 -20481 -1073762305
-50856216 -16849696</internalNodes>
<leafValues>
-0.5678374171257019 0.4961479902267456</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 123 -138428633 1002418167 -1359008245 -1908670465
-1346685918 910098423 -1359010520 -1346371657</internalNodes>
<leafValues>
-0.5706262588500977 0.4572288393974304</leafValues></_>
<!-- tree 4 -->
<_>
<internalNodes>
0 -1 9 -89138513 -4196353 1256531674 -1330665426 1216308261
-36190633 33498198 -151796633</internalNodes>
<leafValues>
-0.5344601869583130 0.4672054052352905</leafValues></_></weakClassifiers></_>
<!-- stage 6 -->
<_>
<maxWeakCount>5</maxWeakCount>
<stageThreshold>-0.8776460289955139</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 105 1073769576 206601725 -34013449 -33554433 -789514004
-101384321 -690225153 -264193</internalNodes>
<leafValues>
-0.7700348496437073 0.5943940877914429</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 30 -1432340997 -823623681 -49153 -34291724 -269484035
-1342767105 -1078198273 -1277955</internalNodes>
<leafValues>
-0.5043668746948242 0.6151274442672730</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 35 -1067385040 -195758209 -436748425 -134217731
-50855988 -129 -1 -1</internalNodes>
<leafValues>
-0.6808040738105774 0.4667325913906097</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 119 832534325 -34111555 -26050561 -423659521 -268468364
2105014143 -2114244 -17367185</internalNodes>
<leafValues>
-0.4927591383457184 0.5401885509490967</leafValues></_>
<!-- tree 4 -->
<_>
<internalNodes>
0 -1 82 -1089439888 -1080524865 2143059967 -1114121
-1140949004 -3 -2361356 -739516</internalNodes>
<leafValues>
-0.6445107460021973 0.4227822124958038</leafValues></_></weakClassifiers></_>
<!-- stage 7 -->
<_>
<maxWeakCount>6</maxWeakCount>
<stageThreshold>-1.1139287948608398</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 52 -1074071553 -1074003969 -1 -1280135430 -5324817 -1
-335548482 582134442</internalNodes>
<leafValues>
-0.5307556986808777 0.6258179545402527</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 99 -706937396 -705364068 -540016724 -570495027
-570630659 -587857963 -33628164 -35848193</internalNodes>
<leafValues>
-0.5227634310722351 0.5049746036529541</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 18 -2035630093 42119158 -268503053 -1671444 261017599
1325432815 1954394111 -805306449</internalNodes>
<leafValues>
-0.4983572661876679 0.5106441378593445</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 111 -282529488 -1558073088 1426018736 -170526448
-546832487 -5113037 -34243375 -570427929</internalNodes>
<leafValues>
-0.4990860521793366 0.5060507059097290</leafValues></_>
<!-- tree 4 -->
<_>
<internalNodes>
0 -1 92 1016332500 -606301707 915094269 -1080086049
-1837027144 -1361600280 2147318747 1067975613</internalNodes>
<leafValues>
-0.5695009231567383 0.4460467398166657</leafValues></_>
<!-- tree 5 -->
<_>
<internalNodes>
0 -1 51 -656420166 -15413034 -141599534 -603435836
1505950458 -787556946 -79823438 -1326199134</internalNodes>
<leafValues>
-0.6590405106544495 0.3616424500942230</leafValues></_></weakClassifiers></_>
<!-- stage 8 -->
<_>
<maxWeakCount>7</maxWeakCount>
<stageThreshold>-0.8243625760078430</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 28 -901591776 -201916417 -262 -67371009 -143312112
-524289 -41943178 -1</internalNodes>
<leafValues>
-0.4972776770591736 0.6027074456214905</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 112 -4507851 -411340929 -268437513 -67502145 -17350859
-32901 -71344315 -29377</internalNodes>
<leafValues>
-0.4383158981800079 0.5966237187385559</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 69 -75894785 -117379438 -239063587 -12538500 1485072126
2076233213 2123118847 801906927</internalNodes>
<leafValues>
-0.6386105418205261 0.3977999985218048</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 19 -823480413 786628589 -16876049 -1364262914 242165211
1315930109 -696268833 -455082829</internalNodes>
<leafValues>
-0.5512794256210327 0.4282079637050629</leafValues></_>
<!-- tree 4 -->
<_>
<internalNodes>
0 -1 73 -521411968 6746762 -1396236286 -2038436114
-185612509 57669627 -143132877 -1041235973</internalNodes>
<leafValues>
-0.6418755054473877 0.3549866080284119</leafValues></_>
<!-- tree 5 -->
<_>
<internalNodes>
0 -1 126 -478153869 1076028979 -1645895615 1365298272
-557859073 -339771473 1442574528 -1058802061</internalNodes>
<leafValues>
-0.4841901361942291 0.4668019413948059</leafValues></_>
<!-- tree 6 -->
<_>
<internalNodes>
0 -1 45 -246350404 -1650402048 -1610612745 -788400696
1467604861 -2787397 1476263935 -4481349</internalNodes>
<leafValues>
-0.5855734348297119 0.3879135847091675</leafValues></_></weakClassifiers></_>
<!-- stage 9 -->
<_>
<maxWeakCount>7</maxWeakCount>
<stageThreshold>-1.2237116098403931</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 114 -24819 1572863935 -16809993 -67108865 2146778388
1433927541 -268608444 -34865205</internalNodes>
<leafValues>
-0.2518476545810700 0.7088654041290283</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 97 -1841359 -134271049 -32769 -5767369 -1116675 -2185
-8231 -33603327</internalNodes>
<leafValues>
-0.4303432404994965 0.5283288359642029</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 25 -1359507589 -1360593090 -1073778729 -269553812
-809512977 1744707583 -41959433 -134758978</internalNodes>
<leafValues>
-0.4259553551673889 0.5440809130668640</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 34 729753407 -134270989 -1140907329 -235200777
658456383 2147467263 -1140900929 -16385</internalNodes>
<leafValues>
-0.5605589151382446 0.4220733344554901</leafValues></_>
<!-- tree 4 -->
<_>
<internalNodes>
0 -1 134 -310380553 -420675595 -193005472 -353568129
1205338070 -990380036 887604324 -420544526</internalNodes>
<leafValues>
-0.5192656517028809 0.4399855434894562</leafValues></_>
<!-- tree 5 -->
<_>
<internalNodes>
0 -1 16 -1427119361 1978920959 -287119734 -487068946
114759245 -540578051 -707510259 -671660453</internalNodes>
<leafValues>
-0.5013077259063721 0.4570254683494568</leafValues></_>
<!-- tree 6 -->
<_>
<internalNodes>
0 -1 74 -738463762 -889949281 -328301948 -121832450
-1142658284 -1863576559 2146417353 -263185</internalNodes>
<leafValues>
-0.4631414115428925 0.4790246188640595</leafValues></_></weakClassifiers></_>
<!-- stage 10 -->
<_>
<maxWeakCount>7</maxWeakCount>
<stageThreshold>-0.5544230937957764</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 113 -76228780 -65538 -1 -67174401 -148007 -33 -221796
-272842924</internalNodes>
<leafValues>
-0.3949716091156006 0.6082032322883606</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 110 369147696 -1625232112 2138570036 -1189900 790708019
-1212613127 799948719 -4456483</internalNodes>
<leafValues>
-0.4855885505676270 0.4785369932651520</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 37 784215839 -290015241 536832799 -402984963
-1342414991 -838864897 -176769 -268456129</internalNodes>
<leafValues>
-0.4620285332202911 0.4989669024944305</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 41 -486418688 -171915327 -340294900 -21938 -519766032
-772751172 -73096060 -585322623</internalNodes>
<leafValues>
-0.6420643329620361 0.3624351918697357</leafValues></_>
<!-- tree 4 -->
<_>
<internalNodes>
0 -1 117 -33554953 -475332625 -1423463824 -2077230421
-4849669 -2080505925 -219032928 -1071915349</internalNodes>
<leafValues>
-0.4820112884044647 0.4632140696048737</leafValues></_>
<!-- tree 5 -->
<_>
<internalNodes>
0 -1 65 -834130468 -134217476 -1349314083 -1073803559
-619913764 -1449131844 -1386890321 -1979118423</internalNodes>
<leafValues>
-0.4465552568435669 0.5061788558959961</leafValues></_>
<!-- tree 6 -->
<_>
<internalNodes>
0 -1 56 -285249779 1912569855 -16530 -1731022870 -1161904146
-1342177297 -268439634 -1464078708</internalNodes>
<leafValues>
-0.5190586447715759 0.4441480338573456</leafValues></_></weakClassifiers></_>
<!-- stage 11 -->
<_>
<maxWeakCount>7</maxWeakCount>
<stageThreshold>-0.7161560654640198</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 20 1246232575 1078001186 -10027057 60102 -277348353
-43646987 -1210581153 1195769615</internalNodes>
<leafValues>
-0.4323809444904327 0.5663768053054810</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 15 -778583572 -612921106 -578775890 -4036478
-1946580497 -1164766570 -1986687009 -12103599</internalNodes>
<leafValues>
-0.4588732719421387 0.4547033011913300</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 129 -1073759445 2013231743 -1363169553 -1082459201
-1414286549 868185983 -1356133589 -1077936257</internalNodes>
<leafValues>
-0.5218553543090820 0.4111092388629913</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 102 -84148365 -2093417722 -1204850272 564290299
-67121221 -1342177350 -1309195902 -776734797</internalNodes>
<leafValues>
-0.4920000731945038 0.4326725304126740</leafValues></_>
<!-- tree 4 -->
<_>
<internalNodes>
0 -1 88 -25694458 67104495 -290216278 -168563037 2083877442
1702788383 -144191964 -234882162</internalNodes>
<leafValues>
-0.4494568109512329 0.4448510706424713</leafValues></_>
<!-- tree 5 -->
<_>
<internalNodes>
0 -1 59 -857980836 904682741 -1612267521 232279415
1550862252 -574825221 -357380888 -4579409</internalNodes>
<leafValues>
-0.5180826783180237 0.3888972699642181</leafValues></_>
<!-- tree 6 -->
<_>
<internalNodes>
0 -1 27 -98549440 -137838400 494928389 -246013630 939541351
-1196072350 -620603549 2137216273</internalNodes>
<leafValues>
-0.6081240773200989 0.3333222270011902</leafValues></_></weakClassifiers></_>
<!-- stage 12 -->
<_>
<maxWeakCount>8</maxWeakCount>
<stageThreshold>-0.6743940711021423</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 29 -150995201 2071191945 -1302151626 536934335
-1059008937 914128709 1147328110 -268369925</internalNodes>
<leafValues>
-0.1790193915367127 0.6605972051620483</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 128 -134509479 1610575703 -1342177289 1861484541
-1107833788 1577058173 -333558568 -136319041</internalNodes>
<leafValues>
-0.3681024610996246 0.5139749646186829</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 70 -1 1060154476 -1090984524 -630918524 -539492875
779616255 -839568424 -321</internalNodes>
<leafValues>
-0.3217232525348663 0.6171553134918213</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 4 -269562385 -285029906 -791084350 -17923776 235286671
1275504943 1344390399 -966276889</internalNodes>
<leafValues>
-0.4373284578323364 0.4358185231685638</leafValues></_>
<!-- tree 4 -->
<_>
<internalNodes>
0 -1 76 17825984 -747628419 595427229 1474759671 575672208
-1684005538 872217086 -1155858277</internalNodes>
<leafValues>
-0.4404836893081665 0.4601220190525055</leafValues></_>
<!-- tree 5 -->
<_>
<internalNodes>
0 -1 124 -336593039 1873735591 -822231622 -355795238
-470820869 -1997537409 -1057132384 -1015285005</internalNodes>
<leafValues>
-0.4294152259826660 0.4452161788940430</leafValues></_>
<!-- tree 6 -->
<_>
<internalNodes>
0 -1 54 -834212130 -593694721 -322142257 -364892500
-951029539 -302125121 -1615106053 -79249765</internalNodes>
<leafValues>
-0.3973052501678467 0.4854526817798615</leafValues></_>
<!-- tree 7 -->
<_>
<internalNodes>
0 -1 95 1342144479 2147431935 -33554561 -47873 -855685912 -1
1988052447 536827383</internalNodes>
<leafValues>
-0.7054683566093445 0.2697997391223908</leafValues></_></weakClassifiers></_>
<!-- stage 13 -->
<_>
<maxWeakCount>9</maxWeakCount>
<stageThreshold>-1.2042298316955566</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 39 1431368960 -183437936 -537002499 -137497097
1560590321 -84611081 -2097193 -513</internalNodes>
<leafValues>
-0.5905947685241699 0.5101932883262634</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 120 -1645259691 2105491231 2130706431 1458995007
-8567536 -42483883 -33780003 -21004417</internalNodes>
<leafValues>
-0.4449204802513123 0.4490709304809570</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 89 -612381022 -505806938 -362027516 -452985106
275854917 1920431639 -12600561 -134221825</internalNodes>
<leafValues>
-0.4693818688392639 0.4061094820499420</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 14 -805573153 -161 -554172679 -530519488 -16779441
2000682871 -33604275 -150997129</internalNodes>
<leafValues>
-0.3600351214408875 0.5056326985359192</leafValues></_>
<!-- tree 4 -->
<_>
<internalNodes>
0 -1 67 6192 435166195 1467449341 2046691505 -1608493775
-4755729 -1083162625 -71365637</internalNodes>
<leafValues>
-0.4459891915321350 0.4132415652275085</leafValues></_>
<!-- tree 5 -->
<_>
<internalNodes>
0 -1 86 -41689215 -3281034 1853357967 -420712635 -415924289
-270209208 -1088293113 -825311232</internalNodes>
<leafValues>
-0.4466069042682648 0.4135067760944367</leafValues></_>
<!-- tree 6 -->
<_>
<internalNodes>
0 -1 80 -117391116 -42203396 2080374461 -188709 -542008165
-356831940 -1091125345 -1073796897</internalNodes>
<leafValues>
-0.3394956290721893 0.5658645033836365</leafValues></_>
<!-- tree 7 -->
<_>
<internalNodes>
0 -1 75 -276830049 1378714472 -1342181951 757272098
1073740607 -282199241 -415761549 170896931</internalNodes>
<leafValues>
-0.5346512198448181 0.3584479391574860</leafValues></_>
<!-- tree 8 -->
<_>
<internalNodes>
0 -1 55 -796075825 -123166849 2113667055 -217530421
-1107432194 -16385 -806359809 -391188771</internalNodes>
<leafValues>
-0.4379335641860962 0.4123645126819611</leafValues></_></weakClassifiers></_>
<!-- stage 14 -->
<_>
<maxWeakCount>10</maxWeakCount>
<stageThreshold>-0.8402050137519836</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 71 -890246622 15525883 -487690486 47116238 -1212319899
-1291847681 -68159890 -469829921</internalNodes>
<leafValues>
-0.2670986354351044 0.6014143228530884</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 31 -1361180685 -1898008841 -1090588811 -285410071
-1074016265 -840443905 2147221487 -262145</internalNodes>
<leafValues>
-0.4149844348430634 0.4670888185501099</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 40 1426190596 1899364271 2142731795 -142607505
-508232452 -21563393 -41960001 -65</internalNodes>
<leafValues>
-0.4985891580581665 0.3719584941864014</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 109 -201337965 10543906 -236498096 -746195597
1974565825 -15204415 921907633 -190058309</internalNodes>
<leafValues>
-0.4568729996681213 0.3965812027454376</leafValues></_>
<!-- tree 4 -->
<_>
<internalNodes>
0 -1 130 -595026732 -656401928 -268649235 -571490699
-440600392 -133131 -358810952 -2004088646</internalNodes>
<leafValues>
-0.4770836830139160 0.3862601518630981</leafValues></_>
<!-- tree 5 -->
<_>
<internalNodes>
0 -1 66 941674740 -1107882114 1332789109 -67691015
-1360463693 -1556612430 -609108546 733546933</internalNodes>
<leafValues>
-0.4877715110778809 0.3778986334800720</leafValues></_>
<!-- tree 6 -->
<_>
<internalNodes>
0 -1 49 -17114945 -240061474 1552871558 -82775604 -932393844
-1308544889 -532635478 -99042357</internalNodes>
<leafValues>
-0.3721654713153839 0.4994400143623352</leafValues></_>
<!-- tree 7 -->
<_>
<internalNodes>
0 -1 133 -655906006 1405502603 -939205164 1884929228
-498859222 559417357 -1928559445 -286264385</internalNodes>
<leafValues>
-0.3934195041656494 0.4769641458988190</leafValues></_>
<!-- tree 8 -->
<_>
<internalNodes>
0 -1 0 -335837777 1860677295 -90 -1946186226 931096183
251612987 2013265917 -671232197</internalNodes>
<leafValues>
-0.4323300719261169 0.4342164099216461</leafValues></_>
<!-- tree 9 -->
<_>
<internalNodes>
0 -1 103 37769424 -137772680 374692301 2002666345 -536176194
-1644484728 807009019 1069089930</internalNodes>
<leafValues>
-0.4993278682231903 0.3665378093719482</leafValues></_></weakClassifiers></_>
<!-- stage 15 -->
<_>
<maxWeakCount>9</maxWeakCount>
<stageThreshold>-1.1974394321441650</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 43 -5505 2147462911 2143265466 -4511070 -16450 -257
-201348440 -71333206</internalNodes>
<leafValues>
-0.3310225307941437 0.5624626278877258</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 90 -136842268 -499330741 2015250980 -87107126
-641665744 -788524639 -1147864792 -134892563</internalNodes>
<leafValues>
-0.5266560912132263 0.3704403042793274</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 104 -146800880 -1780368555 2111170033 -140904684
-16777551 -1946681885 -1646463595 -839131947</internalNodes>
<leafValues>
-0.4171888828277588 0.4540435671806335</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 85 -832054034 -981663763 -301990281 -578814081
-932319000 -1997406723 -33555201 -69206017</internalNodes>
<leafValues>
-0.4556705355644226 0.3704262077808380</leafValues></_>
<!-- tree 4 -->
<_>
<internalNodes>
0 -1 24 -118492417 -1209026825 1119023838 -1334313353
1112948738 -297319313 1378887291 -139469193</internalNodes>
<leafValues>
-0.4182529747486115 0.4267231225967407</leafValues></_>
<!-- tree 5 -->
<_>
<internalNodes>
0 -1 78 -1714382628 -2353704 -112094959 -549613092
-1567058760 -1718550464 -342315012 -1074972227</internalNodes>
<leafValues>
-0.3625369668006897 0.4684656262397766</leafValues></_>
<!-- tree 6 -->
<_>
<internalNodes>
0 -1 5 -85219702 316836394 -33279 1904970288 2117267315
-260901769 -621461759 -88607770</internalNodes>
<leafValues>
-0.4742925167083740 0.3689507246017456</leafValues></_>
<!-- tree 7 -->
<_>
<internalNodes>
0 -1 11 -294654041 -353603585 -1641159686 -50331921
-2080899877 1145569279 -143132713 -152044037</internalNodes>
<leafValues>
-0.3666271567344666 0.4580127298831940</leafValues></_>
<!-- tree 8 -->
<_>
<internalNodes>
0 -1 32 1887453658 -638545712 -1877976819 -34320972
-1071067983 -661345416 -583338277 1060190561</internalNodes>
<leafValues>
-0.4567637443542481 0.3894708156585693</leafValues></_></weakClassifiers></_>
<!-- stage 16 -->
<_>
<maxWeakCount>9</maxWeakCount>
<stageThreshold>-0.5733128190040588</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 122 -994063296 1088745462 -318837116 -319881377
1102566613 1165490103 -121679694 -134744129</internalNodes>
<leafValues>
-0.4055117964744568 0.5487945079803467</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 68 -285233233 -538992907 1811935199 -369234005 -529
-20593 -20505 -1561401854</internalNodes>
<leafValues>
-0.3787897229194641 0.4532003402709961</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 58 -1335245632 1968917183 1940861695 536816369
-1226071367 -570908176 457026619 1000020667</internalNodes>
<leafValues>
-0.4258328974246979 0.4202791750431061</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 94 -1360318719 -1979797897 -50435249 -18646473
-608879292 -805306691 -269304244 -17840167</internalNodes>
<leafValues>
-0.4561023116111755 0.4002747833728790</leafValues></_>
<!-- tree 4 -->
<_>
<internalNodes>
0 -1 87 2062765935 -16449 -1275080721 -16406 45764335
-1090552065 -772846337 -570464322</internalNodes>
<leafValues>
-0.4314672648906708 0.4086346626281738</leafValues></_>
<!-- tree 5 -->
<_>
<internalNodes>
0 -1 127 -536896021 1080817663 -738234288 -965478709
-2082767969 1290855887 1993822934 -990381609</internalNodes>
<leafValues>
-0.4174543321132660 0.4249868988990784</leafValues></_>
<!-- tree 6 -->
<_>
<internalNodes>
0 -1 3 -818943025 168730891 -293610428 -79249354 669224671
621166734 1086506807 1473768907</internalNodes>
<leafValues>
-0.4321364760398865 0.4090838730335236</leafValues></_>
<!-- tree 7 -->
<_>
<internalNodes>
0 -1 79 -68895696 -67107736 -1414315879 -841676168
-619843344 -1180610531 -1081990469 1043203389</internalNodes>
<leafValues>
-0.5018386244773865 0.3702533841133118</leafValues></_>
<!-- tree 8 -->
<_>
<internalNodes>
0 -1 116 -54002134 -543485719 -2124882422 -1437445858
-115617074 -1195787391 -1096024366 -2140472445</internalNodes>
<leafValues>
-0.5037505626678467 0.3564981222152710</leafValues></_></weakClassifiers></_>
<!-- stage 17 -->
<_>
<maxWeakCount>9</maxWeakCount>
<stageThreshold>-0.4892596900463104</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 132 -67113211 2003808111 1862135111 846461923 -2752
2002237273 -273154752 1937223539</internalNodes>
<leafValues>
-0.2448196411132813 0.5689709186553955</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 62 1179423888 -78064940 -611839555 -539167899
-1289358360 -1650810108 -892540499 -1432827684</internalNodes>
<leafValues>
-0.4633283913135529 0.3587929606437683</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 23 -285212705 -78450761 -656212031 -264050110 -27787425
-1334349961 -547662981 -135796924</internalNodes>
<leafValues>
-0.3731099069118500 0.4290455579757690</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 77 341863476 403702016 -550588417 1600194541
-1080690735 951127993 -1388580949 -1153717473</internalNodes>
<leafValues>
-0.3658909499645233 0.4556473195552826</leafValues></_>
<!-- tree 4 -->
<_>
<internalNodes>
0 -1 22 -586880702 -204831512 -100644596 -39319550
-1191150794 705692513 457203315 -75806957</internalNodes>
<leafValues>
-0.5214384198188782 0.3221037387847900</leafValues></_>
<!-- tree 5 -->
<_>
<internalNodes>
0 -1 72 -416546870 545911370 -673716192 -775559454
-264113598 139424 -183369982 -204474641</internalNodes>
<leafValues>
-0.4289036989212036 0.4004956185817719</leafValues></_>
<!-- tree 6 -->
<_>
<internalNodes>
0 -1 50 -1026505020 -589692154 -1740499937 -1563770497
1348491006 -60710713 -1109853489 -633909413</internalNodes>
<leafValues>
-0.4621542394161224 0.3832748532295227</leafValues></_>
<!-- tree 7 -->
<_>
<internalNodes>
0 -1 108 -1448872304 -477895040 -1778390608 -772418127
-1789923416 -1612057181 -805306693 -1415842113</internalNodes>
<leafValues>
-0.3711548447608948 0.4612701535224915</leafValues></_>
<!-- tree 8 -->
<_>
<internalNodes>
0 -1 92 407905424 -582449988 52654751 -1294472 -285103725
-74633006 1871559083 1057955850</internalNodes>
<leafValues>
-0.5180652141571045 0.3205870389938355</leafValues></_></weakClassifiers></_>
<!-- stage 18 -->
<_>
<maxWeakCount>10</maxWeakCount>
<stageThreshold>-0.5911940932273865</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 81 4112 -1259563825 -846671428 -100902460 1838164148
-74153752 -90653988 -1074263896</internalNodes>
<leafValues>
-0.2592592537403107 0.5873016119003296</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 1 -285216785 -823206977 -1085589 -1081346 1207959293
1157103471 2097133565 -2097169</internalNodes>
<leafValues>
-0.3801195919513702 0.4718827307224274</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 121 -12465 -536875169 2147478367 2130706303 -37765492
-866124467 -318782328 -1392509185</internalNodes>
<leafValues>
-0.3509117066860199 0.5094807147979736</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 38 2147449663 -20741 -16794757 1945873146 -16710 -1
-8406341 -67663041</internalNodes>
<leafValues>
-0.4068757295608521 0.4130136370658875</leafValues></_>
<!-- tree 4 -->
<_>
<internalNodes>
0 -1 17 -155191713 866117231 1651407483 548272812 -479201468
-447742449 1354229504 -261884429</internalNodes>
<leafValues>
-0.4557141065597534 0.3539792001247406</leafValues></_>
<!-- tree 5 -->
<_>
<internalNodes>
0 -1 100 -225319378 -251682065 -492783986 -792341777
-1287261695 1393643841 -11274182 -213909521</internalNodes>
<leafValues>
-0.4117803275585175 0.4118592441082001</leafValues></_>
<!-- tree 6 -->
<_>
<internalNodes>
0 -1 63 -382220122 -2002072729 -51404800 -371201558
-923011069 -2135301457 -2066104743 -1042557441</internalNodes>
<leafValues>
-0.4008397758007050 0.4034757018089294</leafValues></_>
<!-- tree 7 -->
<_>
<internalNodes>
0 -1 101 -627353764 -48295149 1581203952 -436258614
-105268268 -1435893445 -638126888 -1061107126</internalNodes>
<leafValues>
-0.5694189667701721 0.2964762747287750</leafValues></_>
<!-- tree 8 -->
<_>
<internalNodes>
0 -1 118 -8399181 1058107691 -621022752 -251003468 -12582915
-574619739 -994397789 -1648362021</internalNodes>
<leafValues>
-0.3195341229438782 0.5294018983840942</leafValues></_>
<!-- tree 9 -->
<_>
<internalNodes>
0 -1 92 -348343812 -1078389516 1717960437 364735981
-1783841602 -4883137 -457572354 -1076950384</internalNodes>
<leafValues>
-0.3365339040756226 0.5067458748817444</leafValues></_></weakClassifiers></_>
<!-- stage 19 -->
<_>
<maxWeakCount>10</maxWeakCount>
<stageThreshold>-0.7612916231155396</stageThreshold>
<weakClassifiers>
<!-- tree 0 -->
<_>
<internalNodes>
0 -1 10 -1976661318 -287957604 -1659497122 -782068 43591089
-453637880 1435470000 -1077438561</internalNodes>
<leafValues>
-0.4204545319080353 0.5165745615959168</leafValues></_>
<!-- tree 1 -->
<_>
<internalNodes>
0 -1 131 -67110925 14874979 -142633168 -1338923040
2046713291 -2067933195 1473503712 -789579837</internalNodes>
<leafValues>
-0.3762553930282593 0.4075302779674530</leafValues></_>
<!-- tree 2 -->
<_>
<internalNodes>
0 -1 83 -272814301 -1577073 -1118685 -305156120 -1052289
-1073813756 -538971154 -355523038</internalNodes>
<leafValues>
-0.4253497421741486 0.3728055357933044</leafValues></_>
<!-- tree 3 -->
<_>
<internalNodes>
0 -1 135 -2233 -214486242 -538514758 573747007 -159390971
1994225489 -973738098 -203424005</internalNodes>
<leafValues>
-0.3601998090744019 0.4563256204128265</leafValues></_>
<!-- tree 4 -->
<_>
<internalNodes>
0 -1 115 -261031688 -1330369299 -641860609 1029570301
-1306461192 -1196149518 -1529767778 683139823</internalNodes>
<leafValues>
-0.4034293889999390 0.4160816967487335</leafValues></_>
<!-- tree 5 -->
<_>
<internalNodes>
0 -1 64 -572993608 -34042628 -417865 -111109 -1433365268
-19869715 -1920939864 -1279457063</internalNodes>
<leafValues>
-0.3620899617671967 0.4594142735004425</leafValues></_>
<!-- tree 6 -->
<_>
<internalNodes>
0 -1 36 -626275097 -615256993 1651946018 805366393
2016559730 -430780849 -799868165 -16580645</internalNodes>
<leafValues>
-0.3903816640377045 0.4381459355354309</leafValues></_>
<!-- tree 7 -->
<_>
<internalNodes>
0 -1 93 1354797300 -1090957603 1976418270 -1342502178
-1851873892 -1194637077 -1153521668 -1108399474</internalNodes>
<leafValues>
-0.3591445386409760 0.4624078869819641</leafValues></_>
<!-- tree 8 -->
<_>
<internalNodes>
0 -1 91 68157712 1211368313 -304759523 1063017136 798797750
-275513546 648167355 -1145357350</internalNodes>
<leafValues>
-0.4297670423984528 0.4023293554782867</leafValues></_>
<!-- tree 9 -->
<_>
<internalNodes>
0 -1 107 -546318240 -1628569602 -163577944 -537002306
-545456389 -1325465645 -380446736 -1058473386</internalNodes>
<leafValues>
-0.5727006793022156 0.2995934784412384</leafValues></_></weakClassifiers></_></stages>
<features>
<_>
<rect>
0 0 3 5</rect></_>
<_>
<rect>
0 0 4 2</rect></_>
<_>
<rect>
0 0 6 3</rect></_>
<_>
<rect>
0 1 2 3</rect></_>
<_>
<rect>
0 1 3 3</rect></_>
<_>
<rect>
0 1 3 7</rect></_>
<_>
<rect>
0 4 3 3</rect></_>
<_>
<rect>
0 11 3 4</rect></_>
<_>
<rect>
0 12 8 4</rect></_>
<_>
<rect>
0 14 4 3</rect></_>
<_>
<rect>
1 0 5 3</rect></_>
<_>
<rect>
1 1 2 2</rect></_>
<_>
<rect>
1 3 3 1</rect></_>
<_>
<rect>
1 7 4 4</rect></_>
<_>
<rect>
1 12 2 2</rect></_>
<_>
<rect>
1 13 4 1</rect></_>
<_>
<rect>
1 14 4 3</rect></_>
<_>
<rect>
1 17 3 2</rect></_>
<_>
<rect>
2 0 2 3</rect></_>
<_>
<rect>
2 1 2 2</rect></_>
<_>
<rect>
2 2 4 6</rect></_>
<_>
<rect>
2 3 4 4</rect></_>
<_>
<rect>
2 7 2 1</rect></_>
<_>
<rect>
2 11 2 3</rect></_>
<_>
<rect>
2 17 3 2</rect></_>
<_>
<rect>
3 0 2 2</rect></_>
<_>
<rect>
3 1 7 3</rect></_>
<_>
<rect>
3 7 2 1</rect></_>
<_>
<rect>
3 7 2 4</rect></_>
<_>
<rect>
3 18 2 2</rect></_>
<_>
<rect>
4 0 2 3</rect></_>
<_>
<rect>
4 3 2 1</rect></_>
<_>
<rect>
4 6 2 1</rect></_>
<_>
<rect>
4 6 2 5</rect></_>
<_>
<rect>
4 7 5 2</rect></_>
<_>
<rect>
4 8 4 3</rect></_>
<_>
<rect>
4 18 2 2</rect></_>
<_>
<rect>
5 0 2 2</rect></_>
<_>
<rect>
5 3 4 4</rect></_>
<_>
<rect>
5 6 2 5</rect></_>
<_>
<rect>
5 9 2 2</rect></_>
<_>
<rect>
5 10 2 2</rect></_>
<_>
<rect>
6 3 4 4</rect></_>
<_>
<rect>
6 4 4 3</rect></_>
<_>
<rect>
6 5 2 3</rect></_>
<_>
<rect>
6 5 2 5</rect></_>
<_>
<rect>
6 5 4 3</rect></_>
<_>
<rect>
6 6 4 2</rect></_>
<_>
<rect>
6 6 4 4</rect></_>
<_>
<rect>
6 18 1 2</rect></_>
<_>
<rect>
6 21 2 1</rect></_>
<_>
<rect>
7 0 3 7</rect></_>
<_>
<rect>
7 4 2 3</rect></_>
<_>
<rect>
7 9 5 1</rect></_>
<_>
<rect>
7 21 2 1</rect></_>
<_>
<rect>
8 0 1 4</rect></_>
<_>
<rect>
8 5 2 2</rect></_>
<_>
<rect>
8 5 3 2</rect></_>
<_>
<rect>
8 17 3 1</rect></_>
<_>
<rect>
8 18 1 2</rect></_>
<_>
<rect>
9 0 5 3</rect></_>
<_>
<rect>
9 2 2 6</rect></_>
<_>
<rect>
9 5 1 1</rect></_>
<_>
<rect>
9 11 1 1</rect></_>
<_>
<rect>
9 16 1 1</rect></_>
<_>
<rect>
9 16 2 1</rect></_>
<_>
<rect>
9 17 1 1</rect></_>
<_>
<rect>
9 18 1 1</rect></_>
<_>
<rect>
10 5 1 2</rect></_>
<_>
<rect>
10 5 3 3</rect></_>
<_>
<rect>
10 7 1 5</rect></_>
<_>
<rect>
10 8 1 1</rect></_>
<_>
<rect>
10 9 1 1</rect></_>
<_>
<rect>
10 10 1 1</rect></_>
<_>
<rect>
10 10 1 2</rect></_>
<_>
<rect>
10 14 3 3</rect></_>
<_>
<rect>
10 15 1 1</rect></_>
<_>
<rect>
10 15 2 1</rect></_>
<_>
<rect>
10 16 1 1</rect></_>
<_>
<rect>
10 16 2 1</rect></_>
<_>
<rect>
10 17 1 1</rect></_>
<_>
<rect>
10 21 1 1</rect></_>
<_>
<rect>
11 3 2 2</rect></_>
<_>
<rect>
11 5 1 2</rect></_>
<_>
<rect>
11 5 3 3</rect></_>
<_>
<rect>
11 5 4 6</rect></_>
<_>
<rect>
11 6 1 1</rect></_>
<_>
<rect>
11 7 2 2</rect></_>
<_>
<rect>
11 8 1 2</rect></_>
<_>
<rect>
11 10 1 1</rect></_>
<_>
<rect>
11 10 1 2</rect></_>
<_>
<rect>
11 15 1 1</rect></_>
<_>
<rect>
11 17 1 1</rect></_>
<_>
<rect>
11 18 1 1</rect></_>
<_>
<rect>
12 0 2 2</rect></_>
<_>
<rect>
12 1 2 5</rect></_>
<_>
<rect>
12 2 4 1</rect></_>
<_>
<rect>
12 3 1 3</rect></_>
<_>
<rect>
12 7 3 4</rect></_>
<_>
<rect>
12 10 3 2</rect></_>
<_>
<rect>
12 11 1 1</rect></_>
<_>
<rect>
12 12 3 2</rect></_>
<_>
<rect>
12 14 4 3</rect></_>
<_>
<rect>
12 17 1 1</rect></_>
<_>
<rect>
12 21 2 1</rect></_>
<_>
<rect>
13 6 2 5</rect></_>
<_>
<rect>
13 7 3 5</rect></_>
<_>
<rect>
13 11 3 2</rect></_>
<_>
<rect>
13 17 2 2</rect></_>
<_>
<rect>
13 17 3 2</rect></_>
<_>
<rect>
13 18 1 2</rect></_>
<_>
<rect>
13 18 2 2</rect></_>
<_>
<rect>
14 0 2 2</rect></_>
<_>
<rect>
14 1 1 3</rect></_>
<_>
<rect>
14 2 3 2</rect></_>
<_>
<rect>
14 7 2 1</rect></_>
<_>
<rect>
14 13 2 1</rect></_>
<_>
<rect>
14 13 3 3</rect></_>
<_>
<rect>
14 17 2 2</rect></_>
<_>
<rect>
15 0 2 2</rect></_>
<_>
<rect>
15 0 2 3</rect></_>
<_>
<rect>
15 4 3 2</rect></_>
<_>
<rect>
15 4 3 6</rect></_>
<_>
<rect>
15 6 3 2</rect></_>
<_>
<rect>
15 11 3 4</rect></_>
<_>
<rect>
15 13 3 2</rect></_>
<_>
<rect>
15 17 2 2</rect></_>
<_>
<rect>
15 17 3 2</rect></_>
<_>
<rect>
16 1 2 3</rect></_>
<_>
<rect>
16 3 2 4</rect></_>
<_>
<rect>
16 6 1 1</rect></_>
<_>
<rect>
16 16 2 2</rect></_>
<_>
<rect>
17 1 2 2</rect></_>
<_>
<rect>
17 1 2 5</rect></_>
<_>
<rect>
17 12 2 2</rect></_>
<_>
<rect>
18 0 2 2</rect></_></features></cascade>
</opencv_storage>
================================================
FILE: modules/google_dorking.py
================================================
================================================
FILE: modules/mail/indic.txt
================================================
06000:Free Mobile
06001:Orange
06002:SFR
06003:Bouygues Telecom
06006:Free Mobile
06007:SFR
06008:Orange France
06009:Bouygues Telecom
0601:SFR
06020:Omea Telecom5 SFR et Orange
06021:Omea Telecom5 SFR et Orange
0602:SFR
0603:SFR
0602:SFR et Orange
06026:SFR et Orange
06027:SFR et Orange
06028:SFR et Orange
06029:SFR et Orange
0603:SFR
06040:SFR
06041:SFR
06044:SFR
0604:SFR
06045:SFR
06046:SFR
06047:SFR
06048:SFR
06049:SFR
06050:Auchan Telecom6 SFR
06051:Auchan Telecom6 SFR
06052:Auchan Telecom6 SFR
06053:Auchan Telecom6 SFR
06054:Auchan Telecom6 SFR
06055:LycaMobile7 Bouygues Telecom
06056:LycaMobile7 Bouygues Telecom
06057:LycaMobile7 Bouygues Telecom
06058:LycaMobile7 Bouygues Telecom
06059:LycaMobile7 Bouygues Telecom
06064:Afone6 SFR
06065:NRJ Mobile6 SFR
06066:NRJ Mobile6 SFR
06067:NRJ Mobile6 SFR
06068:NRJ Mobile6 SFR
06069:NRJ Mobile6 SFR
0607:Orange France
0608:Orange France
0609:SFR
061:SFR
062:SFR
0630:Orange France
0631:Orange France
0632:Orange France
0633:Orange France
0634:SFR
0635:SFR
06360:NRJ Mobile6 SFR
06361:NRJ Mobile6 SFR
06362:NRJ Mobile6 SFR
06363:NRJ Mobile6 SFR
06365:NRJ Mobile6 SFR
06366:NRJ Mobile6 SFR
06367:NRJ Mobile6 SFR
06368:NRJ Mobile6 SFR
06369:NRJ Mobile6 SFR
0637:Orange France
063801:Prixtel6 SFR
063802:Prixtel6 SFR
063803:Prixtel6 SFR
063804:Prixtel6 SFR
063805:Prixtel6 SFR
06381:Orange France
06382:Orange France
06383:Orange France
06384:Orange France
06385:Orange France
06386:Orange France
06387:Orange France
06388:Orange France
06389:Orange France
064005:SFR
064006:SFR
064007:SFR
064008:SFR
064009:SFR
06401:Orange France
06402:Orange France
06403:Orange France
06404:Orange France
06405:Orange France
06406:Orange France
06407:Orange France
06408:Orange France
06409:Orange France
06410:SFR
06411:SFR
06412:SFR
06413:SFR
06414:SFR
06415:SFR
064160:SFR
064161:SFR
064164:SFR
06417:NRJMobile SFR
06418:LaPosteMobile SFR
06419:LaPosteMobile SFR
0642:Orange France
0643:Orange France
06440:LaPosteMobile SFR
04441:Orange France
06442:Orange France
06443:Orange France
06444:Bouygues Telecom
06445:Bouygues Telecom
06446:Bouygues Telecom
06447:LaPosteMobile SFR
06448:LaPosteMobile SFR
06449:LaPosteMobile SFR
0645:Orange France
0646:SFR
0647:Orange France
0648:Orange France
06490:SFR et Orange
06491:SFR et Orange
06492:SFR et Orange
06493:SFR et Orange
06494:SFR et Orange
064951:SFR et Orange
064952:SFR et Orange
064953:SFR et Orange
064954:SFR et Orange
064955:SFR et Orange
064956:SFR et Orange
064957:SFR et Orange
064958:SFR et Orange
064959:SFR et Orange
06496:SFR et Orange
06497:SFR et Orange
09498:SFR et Orange
064990:Bouygues Telecom
064991:Bouygues Telecom
064992:SFR et Orange
064993:SFR et Orange
064995:SFR
064998:SFR
064999:SFR
0650:Bouygues Telecom
0651:Free Mobile
0652:Free Mobile
06530:Bouygues Telecom
06531:Bouygues Telecom
06532:Bouygues Telecom
06533:Bouygues Telecom
06534:Bouygues Telecom
06535:Free Mobile
06536:Free Mobile
06537:Free Mobile
06538:Free Mobile
06539:Free Mobile
0654:Orange France
0655:SFR
065666:Prixtel6 SFR
065667:Prixtel6 SFR
065668:Prixtel6 SFR
065669:Prixtel6 SFR
06567:LaPosteMobile SFR
06568:LaPosteMobile SFR
0658:Bouygues Telecom ou Free
0659::Bouygues Telecom
0660:Bouygues Telecom
0661:Bouygues Telecom
0662:Bouygues Telecom
0663:Bouygues Telecom
0664:Bouygues Telecom
0665:Bouygues Telecom
0666:Bouygues Telecom
0667:Bouygues Telecom
0668:Bouygues Telecom
0669:Bouygues Telecom
06690:Bouygues Telecom
06691:Bouygues Telecom
06692:Bouygues Telecom
06693:Bouygues Telecom
06694:Bouygues Telecom
06695:Bouygues Telecom
06696:Bouygues Telecom
06697:Bouygues Telecom
06698:SFR
06699:Bouygues Telecom
067:Orange France
068:Orange France
0695:Free mobile
0698:Bouygues Telecom
0699:Bouygues Telecom
075000:Sisteer6 SFR
075001:Sisteer6 SFR
075002:Sisteer6 SFR
075003:Sisteer6 SFR
075004:Sisteer6 SFR
075005:Sisteer6 SFR
075006:Sisteer6 SFR
075007:Sisteer6 SFR
075008:SFR
075009:SFR
07501:SFR
07502:SFR et Orange
07503:SFR et Orange
07504:SFR et Orange
075050:SFR
075051:SFR
075052:SFR
075053:SFR
075054:SFR
075055:SFR
075056:SFR
075057:SFR
075058:SFR
075059:SFR
075060:SFR
075061:SFR et Orange
075062:SFR et Orange
075063:SFR et Orange
075064:SFR et Orange
075065:SFR et Orange
075066:SFR et Orange
075067:SFR et Orange
075068:SFR et Orange
075069:SFR et Orange
075070:SFR
075071:Orange France
075072:Orange France
07508:SFR et Orange
07509:SFR et Orange
07510:Bouygues Telecom
07511:Bouygues Telecom
07512:Bouygues Telecom
07511:Bouygues Telecom
07513:Bouygues Telecom
07514:Bouygues Telecom
07515:Bouygues Telecom
07516:SFR et Orange
075200:SFR
075201:SFR
075202:SFR
075203:SFR
075204:SFR
075205:SFR
075206:SFR
07521:Bouygues Telecom
07522:Bouygues Telecom
07523:Bouygues Telecom
07524:Bouygues Telecom
07525:Bouygues Telecom
0753:Lycamobile7 Bouygues Telecom
075432:Sisteer6 SFR
075550:Orange
075551:Orange
075552:Orange
075553:Orange
075554:Orange
075555:Sisteer6 SFR
075556:Bouygues Telecom
075557:Bouygues Telecom
075859:SFR
075558:SFR
075566:Sisteer6 SFR
075567:SFR
075568:SFR
075598:SFR
075707:SFR et Orange
075717:SFR et Orange
075750:SFR
075751:SFR
075752:SFR
075753:SFR
075754:SFR
075755:SFR
075756:SFR
075757:SFR
075758:SFR
075759:Acropolis Telecom6 - SFR
075760:SFR
075761:SFR
075762:SFR
075763:SFR
075764:SFR
075765:SFR
075766:SFR
075767:SFR
075768:SFR
075969:SFR
075777:SFR
075778:SFR
075787:SFR
0759:SFR
076000:Bouygues Telecom
076001:Bouygues Telecom
076002:Bouygues Telecom
076003:Bouygues Telecom
076004:Bouygues Telecom
076005:Bouygues Telecom
076006:Bouygues Telecom
076007:Bouygues Telecom
076008:Bouygues Telecom
076009:Bouygues Telecom
07601:Bouygues Telecom
07602:Bouygues Telecom
07603:Bouygues Telecom
07604:Bouygues Telecom
07605:Bouygues Telecom
07606:Bouygues Telecom
07607:Bouygues Telecom
07608:Bouygues Telecom
07609:Bouygues Telecom
0761:Bouygues Telecom
0762:Bouygues Telecom
0763:Bouygues Telecom
0764:Bouygues Telecom
0766:Free Mobile
0767:Free Mobile
0768:Free Mobile
0769:Free Mobile
07700:SFR et Orange
07701:SFR et Orange
07702:SFR et Orange
07703:SFR et Orange
07704:SFR et Orange
07705:SFR
07706:SFR
07707:SFR
07708:SFR
07709:SFR
07705:SFR
07706:SFR
07707:SFR
07708:SFR
07710:SFR
07711:SFR
07712:SFR
0777:SFR
0778:SFR
0779:SFR
07800:Afone6 SFR
07801:Afone6 SFR
07802:Afone6 SFR
07803:Afone6 SFR
07804:Afone6 SFR
07805:Afone6 SFR
07806:Afone6 SFR
0781:Free Mobile
0782:Free Mobile
0783:Free Mobile
078413:Orange France
0785:Orange France
078600:Orange France
078601:Orange France
078602:Orange France
078603:Orange France
078604:Orange France
078605:Orange France
078606:Orange France
078607:Orange France
078608:Orange France
078609:Orange France
0786:Orange France
07861:Orange France
07862:Orange France
07863:Orange France
07864:Orange France
07865:Orange France
07866:Orange France
07867:Orange France
07868:Orange France
07869:Orange France
0787:Orange France
07870:Orange France
07871:Orange France
07872:Orange France
07873:Orange France
07874:Orange France
07875::Orange France
07876::Orange France
07877::Orange France
07878:Orange France
07879::Orange France
07872:Orange France
07873:Orange France
07874:Orange France
07875:Orange France
07876:Orange France
07877:Orange France
07878:Orange France
07879:Orange France
07880:Orange France
07881:Orange France
07882:Orange France
07883:Orange France
07884:Orange France
07885:Orange France
0789:Orange France
================================================
FILE: modules/mail/mail_check.py
================================================
import requests
def verify(mail):
try:
response = requests.get("https://isitarealemail.com/api/email/validate",timeout=1.5,params = {'email': mail},headers = {'Authorization': "Bearer " + "21a3f468-1c3a-43d6-bdd6-d5437d6c0252" })
try:
data = response.json()
status = data['status']
if status == "valid":
return "True"
else:
return None
except:
return None
except:
return None
================================================
FILE: modules/mail/mail_domain.txt
================================================
@yandex.ru
@hotmail.com
@outlook.com
@yahoo.com
@gmail.com
@icloud.com
@aol.com
@msn.com
@live.com
================================================
FILE: modules/mail/mail_gen.py
================================================
import threading, requests, bs4
from bs4 import BeautifulSoup
from modules.mail import mail_check
#from googlesearch import search
def check(name,pren):
print("📪 MailBox guessing ...")
name = name.lower()
pren = pren.lower()
results = [
"{}.{}@gmail.com".format(name,pren),
"{}.{}@hotmail.com".format(name,pren),
"{}{}@hotmail.com".format(name,pren),
"{}{}@hotmail.fr".format(name,pren),
"{}{}@outlook.fr".format(name,pren),
"{}.{}@outlook.com".format(name,pren),
"{}{}@outlook.com".format(name,pren),
"{}.{}@gmail.com".format(pren,name),
"{}.{}@hotmail.com".format(name,pren),
"{}{}@hotmail.com".format(pren,name),
"{}{}@hotmail.fr".format(pren,name),
"{}{}@outlook.fr".format(pren,name),
"{}.{}@outlook.com".format(pren,name),
"{}{}@outlook.com".format(pren,name),
]
valid_mails = []
for i in results:
a = mail_check.verify(mail=i)
if a is not None:
valid_mails.append(i)
return valid_mails
def skype2email(name,pren):
url = f"https://www.skypli.com/search/{name} {pren}"
r = requests.get(url)
page = r.content
features = "html.parser"
soup = BeautifulSoup(page, features)
profiles = soup.find_all('span',{'class':'search-results__block-info-username'})[0:5]
profiless = []
for i in profiles:
if "live:." in i.text:
pass
else:
profiless.append(i.text.replace('live:','').replace('_1',''))
valid_emails = []
for i in profiless:
emails = []
i = i.lower()
with open('modules/mail_domain.txt','r') as file:
lines = file.readlines()
file.close()
for line in lines:
if "@" in line and "." in line:
emails.append(i+line)
for i in emails:
a = mail_check.verify(mail=i.strip())
if a is not None:
valid_emails.append(i.strip())
return valid_emails
def pinterest2email(name,pren):
try:
"""
therm = 'allintitle: {} {}"Profil de {} {}" site:pinterest.com -pin'.format(pren,name,pren,name)
a = search(therm, lang="fr")
emails = []
valid_emails = []
if len(a) != 0:
for i in a:
if "https://www.pinterest.com/" not in i:
pass
else:
emails.append(i.replace('https://www.pinterest.com/','').replace('/','')+"@gmail.com")
for i in emails:
check = mail_check.verify(mail=i)
if check is not None:
valid_emails.append(i)
if len(valid_emails) > 0:
return valid_emails
else:
return None
"""
return None
except:
return None
================================================
FILE: modules/mail/scylla_sh.py
================================================
import requests
def scylla_search(email):
try:
r = requests.get('https://scylla.so/search?q=email:{}'.format(email))
if r.status_code == 500 or r.status_code == 502:
return None
try:
response = r.json()
if len(response) == 0:
return None
else:
total = []
for i in response[0:10]:
leak_name = i['fields']['domain']
try:
password = i['fields']['password']
except:
password = i['fields']['passhash']
text = {
'Name':leak_name,
'Password':password
}
total.append(text)
return total
except:
return None
except requests.exceptions.ConnectionError:
return None
# By Lui#6166 from Prism Intelligence Group
================================================
FILE: modules/official_documents/death_records.py
================================================
import profile
import requests,bs4
from bs4 import BeautifulSoup
def death_search(name,pren):
try:
url = "https://avis-deces.linternaute.com/recherche-avis?q={} {}".format(name,pren)
r = requests.get(url)
page = r.content
features = "html.parser"
soup = BeautifulSoup(page, features)
names = soup.find_all('h4')
ages = soup.find_all('small')
villes = soup.find_all('div',{'class':'odResultList__details--death'})
profile_list = []
for i in range(len(names)):
try:
name = names[i].text.split('(')[0].replace('\r','').replace('\n','').replace('\t','').strip()
loc = villes[i].text.split('à')[1].replace('\n','').replace(' ','').strip()
age = ages[i].text.strip()
dictt = {'Name':name,'Age':str(age),'Loc':loc.replace('- ','')}
profile_list.append(dictt)
except:
pass
if len(names) == 0:
return None
else:
return profile_list
except KeyboardInterrupt:
return None
================================================
FILE: modules/official_documents/dirigeants_bfmtv.py
================================================
import requests, bs4
from bs4 import BeautifulSoup
def bfmtv_search(name,pren):
try:
r = requests.get("https://www.verif.com/dirigeants/recherche/q/{}6+{}5".format(name,pren))
page = r.content
features = "html.parser"
soup = BeautifulSoup(page, features)
try:
full_name = soup.find('a',{'class':'nom'}).text+" "+soup.find('td',{'class':'verif_col2'}).text
naissance = soup.find('td',{'class':'verif_col3'}).text.replace('Né le ','')
mandats = soup.find('td',{'class':'verif_col5'}).text
fonction = soup.find('td',{'class':'verif_col4'}).text
link = str(soup.find('td',{'class':'verif_col4'})).split('href="')[1].split('"')[0]
link = str(link).replace('<a class="nom" href="/','')
r = requests.get(link)
page = r.content
features = "html.parser"
soup = BeautifulSoup(page, features)
desc = soup.find('p',{'class':'mid hidden-smallDevice'}).text.strip()
capital = soup.find('span',{'class':'number'}).text.strip()
entreprise = soup.find('h3',{'class':'subtitle'}).text.strip()
adresse_full= str(soup.find('a',{'class':'visible-smallDevice link'})).split('"_blank">')[1]
adresse = adresse_full.split("<br/>")[0]
cp = adresse_full.split("<br/>")[1].split("</a>")[0]
text = {"Capital":capital,"Desc":desc,"addr":adresse+cp,'company':entreprise,'link':link,'full_name':full_name,'naissance':naissance,'mandats':mandats,'fonction':fonction}
return text
except AttributeError:
return None
except:
return None
================================================
FILE: modules/official_documents/pagesblanches_search.py
================================================
import requests, bs4
from bs4 import BeautifulSoup
def adresse_search(name,pren,zipc):
if zipc is not None:
r = requests.get('https://www.118000.fr/search?part=1&label={}&who={} {}'.format(zipc,name,pren))
else:
r = requests.get('https://www.118000.fr/search?part=1&who={} {}'.format(name,pren))
page = r.content
features = "html.parser"
soup = BeautifulSoup(page, features)
target_name = soup.find("h2", {"class": "name title inbl"}).text.strip()
target_addr = soup.find("div", {"class": "h4 address mtreset"}).text.strip()
target_phon = soup.find('a',{'class':'clickable atel'}).text.strip()
if target_name is not None:
return {'Not_Sure':True,'Phone':target_phon,'Name':target_name,'Adress':target_addr,'Type_tel':None,"Loc_phone":None,'carrier':None}
elif target_name is None:
try:
r = requests.get('https://www.118000.fr/search?part=1&label={}&who={}'.format(zipc,name))
page = r.content
features = "html.parser"
soup = BeautifulSoup(page, features)
name_full = soup.find("h2", {"class": "name title inbl"}).text.strip()
addr_full = soup.find("div", {"class": "h4 address mtreset"}).text.replace(', voir sur la carte','').replace('\n',' ').strip()
try:
phon_full = soup.find('a',{'class':'clickable atel'}).text.strip()
except:
phon_full = None
return {'Not_Sure':False,'Phone':phon_full,'Name':name_full,'Adress':addr_full,'Type_tel':None,"Loc_phone":None,'carrier':None}
except AttributeError:
return None
================================================
FILE: modules/phone/phone_search.py
================================================
================================================
FILE: modules/report.json
================================================
{
"Name":false,
"LastName":false,
"UI":{
"Pie":{
"PersonnalLife":false,
"SocialMedias":false
},
"Bar":{
"TwitterFounds":false,
"InstagramFounds":false,
"FacebookFounds":false,
"SkypeFounds":false
}
},
"AdressPhone":{
"Not_Sure":false,
"Exists":false,
"FullName":false,
"Adress":false,
"Phone":false,
"PhoneLocation":false
},
"Work":{
"Exists":false,
"FullName":false,
"BornDate":false,
"Company":false,
"Function":false,
"Warrant":false,
"Link":false,
"Capital":false,
"Desc":false
},
"Diploma_Bac":{
"Exists":false,
"Link":false,
"Academie":false,
"Mention":false,
"City":false,
"Diplome":false
},
"Diploma_Brevet":{
"Exists":false,
"Name":false,
"Link":false,
"Academie":false,
"Mention":false,
"City":false,
"Diplome":false
},
"DeathRecords":{
"Exists":false,
"Records":false,
"AverageAgeUntilDeath":false
},
"Emails":{
"HighProbEmails":false,
"PermutatedMailbox":false
},
"LinkedIN":{
"Exists":false,
"Job":false,
"Location":false,
"urnid":false,
"Url":false,
"Twitters":false,
"Birthdate":false,
"PhoneNumbers":false
},
"Facebook":{
"Exists":false,
"AccountList":false
},
"Skype":{
"Exists":false,
"AccountList":false
},
"Instagram":{
"Exists":false,
"AccountList":false
},
"Twitter":{
"Exists":false,
"AccountList":false
},
"CopainsDavant":{
"Exists":false,
"Job":false,
"NbKids":false,
"FullName":false,
"BornDate":false,
"Location":false,
"FSituation":false,
"ProfilePicUrl":false,
"ProfileUrl":false,
"OtherLocations":false
}
}
================================================
FILE: modules/social_medias/copainsdavant_search.py
================================================
import requests, json
from bs4 import BeautifulSoup
from modules.face_recognition import face_recon
from colorama import Fore
def check_response(url):
r = requests.get(url,allow_redirects=False)
status = r.status_code
if status == 200:
return True
else:
return None
def copains_davant(name,pren):
headers = {
'Accept':'application/json, text/javascript, */*; q=0.01',
'X-Requested-With':'XMLHttpRequest'
}
r = requests.get(url='http://copainsdavant.linternaute.com/s/?full=&q={} {}&ty=1&xhr='.format(pren,name),headers=headers)
try:
pagephone = r.content.decode().split(',"$data":')[1].split('{"copains":')[1]
dataa = pagephone[:-2]
data = json.loads(dataa)
users_list = data['users']
user_list = []
for i in users_list:
i = str(i).strip()
if i != "0":
user_list.append(i)
new_verified = []
for i in user_list:
url = "https://copainsdavant.linternaute.com/p/{}-{}-{}".format(pren,name,i)
response_code = check_response(url)
if response_code is not None:
new_verified.append(url)
profil_url = new_verified[0]
r = requests.get(allow_redirects=False,url='{}'.format(profil_url))
pagephone = r.content
featuresphone = "html.parser"
soup = BeautifulSoup(pagephone,featuresphone)
try:
localisation = str(soup.find('span',{'class':'locality'}).text)
naissance = str(soup.find('abbr',{'class':'bday'}).text.strip())
name_full = str(soup.find('a',{'class':'url'}).text.strip())
photo = str(soup.find('img',{'itemprop':'logo'})).split('itemprop="logo" src="')[1].split('"')[0]
locations = soup.find_all('span',{'class':'copains_career__city jCcareerTown'})
dates = soup.find_all('span',{'class':'copains_career__date jCareerDate'})
location_list = []
for i in range(len(locations)):
locat = locations[i].text.strip()
dat = dates[i].text.replace('maintenant','Now').strip()
data = dat+" | "+locat
if data not in location_list:
temp_list = []
for i in location_list:
if locat in i:
temp_list.append('.')
if len(temp_list) == 0:
location_list.append(data)
if len(location_list) == 0:
location_list = None
if "/anonymousL.jpg" in photo:
photo = "None"
face_detection = None
else:
print("🧠 Face detection via CopainsDavant profile picture ...")
face_detection = face_recon.check(photo)
if face_detection is not None:
print(" ->"+Fore.GREEN+" Face successfully found ! "+Fore.RESET)
face_detection = True
card = soup.find('section',{'id':'vcard'}).text.strip()
job = "None"
nb_kids = "None"
situation_familiale = "None"
if "Situation familiale" in card:
situation_familiale = card.split('Situation familiale :')[1].split(' ')[0].strip()
situation_familiale = situation_familiale.strip()
if "Profession" in card:
job = card.split('Profession :')[1].split(' ')[0]
job = " ".join(job.split()).split(' ')[0]
if "Enfant" in card:
nb_kids = card.split("Enfants :")[1].split(" ")[0]
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),
"nb_enfants":str(nb_kids).strip(),"Job":str(job).strip(),'pdp':str(photo),
}
return text
except AttributeError:
return None
except IndexError:
return None
================================================
FILE: modules/social_medias/facebook_search.py
================================================
import requests, bs4, re
from bs4 import BeautifulSoup
def facebook_search(name,pren):
url = "https://fr-fr.facebook.com/public/{}-{}".format(pren,name)
page = requests.get(url).content.decode('utf-8')
nameAccount = re.findall("width=\"72\" height=\"72\" alt=\"([a-zA-Z0-9_ é , ]+)\" />", page)
total_accounts = []
for i in nameAccount:
if name.lower() in i.lower() and pren.lower() in i.lower():
total_accounts.append(i)
else:
pass
if len(total_accounts) == 0:
return None
else:
return total_accounts
'''
This code cand be found at :
https://github.com/lulz3xploit/LittleBrother/blob/master/core/facebookSearchTool.py
'''
================================================
FILE: modules/social_medias/instagram_search.py
================================================
import json, httpx, urllib, hmac,hashlib, sys, os, bs4, requests
from bs4 import BeautifulSoup
def cleartext(text):
spec_chars = list(',?;:!§/\|<>*$£¤^¨^')
for i in range(8):
for i in spec_chars:
if i in text:
text = text.replace(i,'')
return text
def get_info_from_bio(bio):
lines = bio.split('\n')
religions = [
('✡️','Judaism'),
('☪️','Islam'),
('☦️','Orthodox'),
('✝️','Christ'),
('🕉️','Hinduism')
]
hobbies = [
('🥊','Boxing'),
('🐎','Horses'),
('🐴','Horses'),
('🎾','Tennis'),
('⚽','Football'),
('🥋','Martial Arts'),
('🏀','Basketball'),
('🏈','American Football'),
('🏐','Volleyball'),
('🎻','Violin'),
('🎸','Guitar'),
('🎹','Piano'),
('🎣','Fishing'),
('⛷️','Ski')
]
astrology_signs = [
('♈','Aries','March 21 - April 20'),
('♉','Taurus','April 21 - May 21'),
('♊','Gemini','May 22 - June 21'),
('♋','Cancer','June 22 - July 22'),
('♌','Leo','July 23 - August 22'),
('♍','Virgo','August 23 - September 23'),
('♎','Libra','September 24 - October 23'),
('♏','Scorpius','October 24 - November 22'),
('♐','Sagittarius','November 23 - December 21'),
('♑','Capricorn','December 22 - January 20'),
('♒','Aquarius','January 21 - February 19'),
('♓','Pisces','February 20 - March 20')
]
ethnical_origins = [
('🇫🇷','France'),
('🇨🇭','Swiss'),
('🇨🇳','China'),
('🇧🇪','Belgium'),
('🇦🇱','Albania'),
('🇧🇬','Bulgaria'),
('🇧🇷','Brazil'),
('🇨🇦','Canada'),
('🇩🇪','Germany'),
('🇮🇱','Israel'),
('🇵🇸','Palestine'),
('🇺🇸','United States'),
('🇵🇹','Portugal'),
('🇱🇹','Lithuania'),
('🇵🇱','Poland'),
('🇷🇺','Russia'),
('🇪🇸','Spain'),
('🇹🇷','Turkey'),
('🇩🇿','Algeria'),
('🇲🇦','Morocco'),
('🇬🇵','Guadeloupe'),
('🇮🇳','India'),
('🇱🇺','Luxembourg'),
('🇳🇪','Niger'),
('🇳🇬','Nigeria'),
('🇶🇦','Quatar'),
('🇷🇪','Réunion'),
('🇷🇴','Romania'),
('🇹🇳','Tunisia'),
('🇾🇹','Mayotte'),
('🇿🇦','South Africa'),
('🇲🇽','Mexico'),
('🇨🇿','Czech Republic'),
('🇯🇵','Japan'),
('🇰🇪','Kenya'),
('🇰🇵','North Korea'),
('🇰🇷','South Korea'),
('🇯🇲','Jamaica'),
('🇮🇪','Ireland'),
('🇬🇷','Greece')
]
emailss = [
'@icloud.com',
'@gmail.com',
'@gmx.fr',
'@yahoo.fr',
'@yahoo.com',
'@outlook.com'
'@outlook.fr',
'@hotmail.fr',
'@hotmail.com',
'@live.fr',
'@live.com',
'@sfr.fr',
'@orange.fr',
'@free.fr',
'@aol.com',
'@wanadoo.fr',
'@neuf.fr',
'@laposte.net',
'@yandex.ru',
'@club-internet.fr',
'@msn.com',
'@influencelife.fr',
'@shaunaevents.com',
'@we-events.fr',
'@nabillapro.com',
'@facebook.com',
'@protonmail.com',
'@protonmail.ch',
'@thepauseagency.com',
'@alexotime.com',
'@tomorrowhub.com'
]
bio_infos = {}
emails_final = []
snapchat_final = []
paypals = []
best_friend = []
ages = []
love_date_since = []
school_list = []
city_list = []
lgbt_points = []
fb_list = []
twitter_list = []
flag_list = []
religions_targ = []
astro_sign = []
hobbies_emojis = []
love_situation = []
tiktok_list = []
for line in lines:
line = line.replace('</a','').replace('<a href="/v','').replace('<a href="/t/','')
line = line.lower()
for i in religions:
emoji, religionName = i
if emoji in line or religionName.lower() in line:
religions_targ.append(religionName)
for i in astrology_signs:
emoji, sign, date = i
if emoji in line:
astro_sign.append('{} | {}'.format(sign,date))
for flagos in ethnical_origins:
flag, country_full = flagos
if flag in line:
flag_list.append(country_full)
for i in hobbies:
emoji, name = i
if emoji in line:
hobbies_emojis.append(name)
temp_list_love = []
for chars in line:
if chars == "/":
temp_list_love.append('.')
if "tik tok" in line or "tiktok" in line:
if ":" in line:
tiktok_list.append(cleartext(line.split(':')[1]))
else:
tiktok_list.append(cleartext(line.replace('tik tok','').replace('tiktok','')))
if "en couple" in line or "🔒" in line or "🔐" in line:
love_situation.append('Not Free | Taken')
if "celib" in line:
love_situation.append('Single | Free')
if "🏳️🌈" in line or "🏳️⚧️" in line:
lgbt_points.append('.')
if "facebook" in line:
if ":" in line:
line = line.split(':')[1]
fb_list.append(cleartext(line))
if "twitter" in line:
if ":" in line:
line = line.split(':')[1]
twitter_list.append(cleartext(line))
if len(temp_list_love) == 2:
love_date_since.append(line)
if "📍" in line or "📌" in line:
city_list.append(cleartext(line.replace('📍','').replace('📌','').replace(':','')))
if "snapchat" in line or "snap" in line or "👻" in line or "sc : " in line or "sc:" in line:
line = line.replace('👻','').strip()
if ":" in line:
line = line.split(':')[1].strip()
snapchat_final.append(cleartext(line))
if "📚" in line or "🎓" in line:
school_list.append(cleartext(line.replace('📚','').replace('🎓','').strip()))
if "yo" in line or "years old" in line or "years" in line or "🎂" in line or "anniv" in line:
if "🎂" in line:
line = line.replace('🎂','')
if ":" in line:
line = line.split(':')[1]
ages.append(cleartext(line))
else:
try:
if "years" in line:
age = int(line.split("years")[0].replace('years','').strip())
elif "yo" in line:
age = int(line.split("yo")[0].replace('yo','').strip())
elif 'y' in line:
age = int(line.split("y")[0].replace('y','').strip())
else:
age = int(line.split("years")[0].strip())
ages.append(cleartext(str(age)))
except ValueError:
ages.append('Verify by yourself')
if "paypal.me/" in line:
paypal = ("paypal.me/"+line.split("paypal.me/")[1])
paypals.append(paypal)
if "@" in line:
line = line.replace('📩','')
temp_list_emails = []
if "/" in line and '"' in line:
temp_list_emails = []
line = (line.replace('/','@').split('"')[0])
temp_list_emails.append('.')
try:
domain = '@'+line.split('@')[1]
if "." not in domain:
line = "@"+line.split("@")[1]
if " " in line:
line = line.split(' ')[0]
best_friend.append(line)
else:
for i in emailss:
if domain == i:
if line not in emails_final:
if ":" in line:
line = line.split(':')[1].strip()
emails_final.append(line)
except:
pass
if len(tiktok_list) == 0:
bio_infos['tiktok_list'] = None
else:
bio_infos['tiktok_list'] = tiktok_list
if len(love_situation) == 0:
bio_infos['love_situation'] = None
else:
bio_infos['love_situation'] = love_situation
if len(hobbies_emojis) == 0:
bio_infos['Hobbies'] = None
else:
bio_infos['Hobbies'] = hobbies_emojis
if len(religions_targ) == 0:
bio_infos['religions'] = None
else:
bio_infos['religions'] = religions_targ
if len(astro_sign) == 0:
bio_infos['astrology'] = None
else:
bio_infos['astrology'] = astro_sign
if len(flag_list) == 0:
bio_infos['origins'] = None
else:
bio_infos['origins'] = flag_list
if len(fb_list) == 0:
bio_infos['fb_list'] = None
else:
bio_infos['fb_list'] = fb_list
if len(twitter_list) == 0:
bio_infos['twitter_list'] = None
else:
bio_infos['twitter_list'] = twitter_list
if len(lgbt_points) == 0:
bio_infos['lgbt_points'] = None
else:
bio_infos['lgbt_points'] = "a"
if len(city_list) == 0:
bio_infos['city_list'] = None
else:
bio_infos['city_list'] = city_list
if len(school_list) == 0:
bio_infos['school'] = None
else:
bio_infos['school'] = school_list[0].replace(':','')
if len(snapchat_final) == 0:
bio_infos['snapchat'] = None
else:
bio_infos['snapchat'] = snapchat_final[0].replace('snapchat','').replace('snap','').replace(':','').strip()
if len(best_friend) == 0:
bio_infos['best_friend'] = None
else:
bio_infos['best_friend'] = best_friend
if len(ages) == 0:
bio_infos['age'] = None
else:
bio_infos['age'] = str(ages[0])
if len(emails_final) == 0:
bio_infos['emails'] = None
else:
bio_infos['emails'] = emails_final
if len(love_date_since) == 0:
bio_infos['love_date'] = None
else:
bio_infos['love_date'] = love_date_since[0]
if len(paypals) == 0:
bio_infos['paypal'] = None
else:
bio_infos['paypal'] = paypals[0]
return bio_infos
def getInstagramEmailFromBio(username):
url = "https://www.picuki.com/profile/{}".format(username.replace('@',''))
r = requests.get(url=url)
page = r.content.decode()
features = "html.parser"
soup = BeautifulSoup(page,features)
try:
bioo = str(soup.find('div',{'class':'profile-description'})).split('profile-description">')[1].split('</div>')[0]
except:
bioo = "Lol"
return get_info_from_bio(bioo)
def get_profile_infos(profile):
r = requests.get('https://www.picuki.com/profile/leaelui')
page = r.content
features = "html.parser"
soup = BeautifulSoup(page, features)
bio = soup.find('div',{'class':'profile-description'})
followings = soup.find('span',{'class':'follows'})
followers = soup.find('span',{'class':'followed_by'})
posts = soup.find('span',{'class':'total_posts'})
dictt = {
'Bio':bio,
'Following':followings,
'Followers':followers
}
return dictt
def ig_search(name,pren):
url = "https://www.picuki.com/search/{} {}".format(pren,name)
r = requests.get(url=url)
page = r.content.decode()
features = "html.parser"
soup = BeautifulSoup(page,features)
profiles = []
profiless = soup.find_all('div',{'class':'result-username'})
for i in profiless[0:10]:
i = str(i)
profiles.append(i.replace('<div class="result-username">','').replace('</div>','').strip())
return profiles
# ============================================================================
"""
LICENSE
This module belong to Palenath | Megadose FROM Toutatis
Github : https://github.com/megadose/
Twitter : https://twitter.com/palenath
Module name : Toutatis
Repo : https://github.com/megadose/toutatis
"""
def advanced_lookup(username):
USERS_LOOKUP_URL = 'https://i.instagram.com/api/v1/users/lookup/'
SIG_KEY_VERSION = '4'
IG_SIG_KEY = 'e6358aeede676184b9fe702b30f4fd35e71744605e39d2181a34cede076b3c33'
def generate_signature(data):
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)
def generate_data( phone_number_raw):
data = {'login_attempt_count': '0',
'directly_sign_in': 'true',
'source': 'default',
'q': phone_number_raw,
'ig_sig_key_version': SIG_KEY_VERSION
}
return data
data=generate_signature(json.dumps(generate_data(username)))
headers={
"Accept-Language": "en-US",
"User-Agent": "Instagram 101.0.0.15.120",
"Content-Type": "application/x-www-form-urlencoded; charset=UTF-8",
"Accept-Encoding": "gzip, deflate",
"X-FB-HTTP-Engine": "Liger",
"Connection": "close"}
try:
r = httpx.post(USERS_LOOKUP_URL,headers=headers,data=data)
rep=r.json()
return({"user":rep,"error":None})
except :
return({"user":None,"error":"rate limit"})
def get_extra_data(username):
data = advanced_lookup(username)
final_dict = {}
status = data['user']['status']
if status != "ok":
return None
else:
try:
final_dict['obfuscated_email'] = data['user']['obfuscated_email']
except KeyError:
final_dict['obfuscated_email'] = None
try:
final_dict['obfuscated_phone'] = data['user']['obfuscated_phone']
except KeyError:
final_dict['obfuscated_phone'] = None
return final_dict
================================================
FILE: modules/social_medias/linkedin_search.py
================================================
from linkedin_api import Linkedin
def linkedin_search(name,pren):
try:
"""
a = search('"{} {}" -intitle:"profiles" -inurl:"dir/ " site:fr.linkedin.com/in/ OR site:fr.linkedin.com/pub/'.format(pren,name), lang="fr")
if len(a) > 0:
if name.lower() in a[0] and pren.lower() in a[0]:
return a[0]
else:
return None
"""
return None
except:
pass
def official_linkedin_search(name,pren):
username = ""
password = ""
if len(username) == 0:
return None
else:
api = Linkedin(username=username,password=password)
profile_data = api.search_people(keyword_first_name=pren,keyword_last_name=name)
if len(profile_data) == 0:
return None
else:
public_id = profile_data[0]['public_id']
urn_id = profile_data[0]['urn_id']
profile_infos = api.get_profile(urn_id=urn_id,public_id=public_id)
profile_contact = api.get_profile_contact_info(urn_id=urn_id,public_id=public_id)
email_adress = profile_contact['email_address']
twitters = profile_contact['twitter']
birthdate = profile_contact['birthdate']
phone_numbers = profile_contact['phone_numbers']
profile_infosz = api.get_profile(public_id)
location = profile_infosz['geoLocationName']
bio = profile_infosz['headline']
try:
job = (profile_infos['headline'])
except:
job = None
data = {
'Loc':location,
'Job':job,
'Bio':bio,
'email':email_adress,
'urnid':urn_id,
'url':'https://www.linkedin.com/in/'+public_id,
'twitters':twitters,
'birthdate':birthdate,
'phone_numbers':phone_numbers
}
return data
================================================
FILE: modules/social_medias/skype_search.py
================================================
import requests, bs4
from bs4 import BeautifulSoup
from modules.mail import mail_check
def skype_searchh(name,pren):
url = f"https://www.skypli.com/search/{name} {pren}"
r = requests.get(url)
page = r.content
features = "html.parser"
soup = BeautifulSoup(page, features)
profiles = soup.find_all('span',{'class':'search-results__block-info-username'})[0:5]
profiless = []
for i in profiles:
profiless.append(i.text)
profile_dict = []
for i in profiless:
r = requests.get('https://www.skypli.com/profile/{}'.format(i))
page = r.content
if "Page not found." in r.text:
full_name = ""
else:
features = "html.parser"
soup = BeautifulSoup(page, features)
name = soup.find_all('div',{'class':'profile-box__table-value'})[1]
full_name = (name.text.strip())
profile_dict.append('{} \t| {}'.format(i,full_name))
return profile_dict
================================================
FILE: modules/social_medias/soundcloud.py
================================================
from selenium import webdriver
from colorama import Fore
import time
def webdriver_usage(name,pren):
print("🎧 Searching for soundcloud profiles ...")
try:
try:
options = webdriver.FirefoxOptions()
options.headless = True
driver = webdriver.Firefox(options=options)
driver.get(f"https://soundcloud.com/search/people?q={pren} {name}")
time.sleep(4.0)
source_code = str(driver.page_source)
if "Check the spelling, or try a different search." in source_code or "Sorry we didn't find any results for" in source_code:
pass
else:
print(f' -> {Fore.GREEN}Found !{Fore.RESET} Visit : https://soundcloud.com/search/people?q={pren}%20{name}')
except:
return None
except KeyboardInterrupt:
return
================================================
FILE: modules/social_medias/twitter_search.py
================================================
import requests, bs4
from bs4 import BeautifulSoup
def twitter_search(name,pren):
url = "https://www.sotwe.com/search/{} {}".format(pren,name)
r = requests.get(url)
page = r.content
features = "html.parser"
soup = BeautifulSoup(page, features)
usernames = []
username = soup.find_all('div',{'class':'v-list-item__subtitle caption'})
for i in username:
usernames.append(i.text.strip())
return usernames
================================================
FILE: modules/social_medias/wattpad_search.py
================================================
import time, colorama
from colorama import Fore
from selenium import webdriver
def wattpad_module(pren,name):
print("📔 Searching for Wattpad profiles ...")
options = webdriver.FirefoxOptions()
options.headless = True
driver = webdriver.Firefox(options=options)
url = "https://www.wattpad.com/search/{}%20{}/people".format(pren,name)
driver.get(url)
time.sleep(2.0)
source_code = str(driver.page_source)
if "Hmmm... il n'y a pas de résultats" in source_code:
return None
else:
print(f' -> {Fore.GREEN}Found !{Fore.RESET} Visit : {url}')
================================================
FILE: modules/visual/logging.py
================================================
def speculos_lotus():
try:
with open("modules/mail_domain.txt","r") as file:
lines = file.readlines()
file.close()
print("""
* NOTE *:
+ You can update DaProfiler using : py profiler.py -u True
+ You can add by yourself some others mail domains (ex @mail.mail)
to search for target emails using that domain.
HOW :
. Go to /modules
. Add your domains ({} Detected)
""".format(str(len(lines))))
except:
pass
================================================
FILE: profiler.py
================================================
from colorama.initialise import init
from json import decoder
import threading, time, colorama, treelib, random, sys, os, argparse, json, requests, webbrowser, socketio, string
from tqdm import tqdm
from treelib import Node, Tree
from colorama import Fore, Back, Style, init
from statistics import mean
init(autoreset=True)
from modules.social_medias import wattpad_search
from modules.social_medias import skype_search
from modules.social_medias import copainsdavant_search
from modules.social_medias import instagram_search
from modules.social_medias import twitter_search
from modules.social_medias import facebook_search
from modules.social_medias import linkedin_search
from modules.official_documents import dirigeants_bfmtv
from modules.official_documents import death_records
from modules.official_documents import pagesblanches_search
from modules.mail import mail_gen
from modules.mail import scylla_sh
from modules.mail import mail_check
from modules.diplomes import last_diplomes
from modules.social_medias import soundcloud
from modules.visual import logging
from modules.api_modules import leakcheck_net
banner = False
# Opening json report template
data_file = open('modules/report.json','r')
data_export = json.load(data_file)
data_file.close()
# Affichage de la banniere
def banner():
if sys.platform == 'win32':
os.system('cls')
else:
os.system('clear')
print("""
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣀⣀⣀⣀⣀⡀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣴⠾⠛⢉⣉⣉⣉⡉⠛⠷⣦⣄⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣴⠋⣠⣴⣿⣿⣿⣿⣿⡿⣿⣶⣌⠹⣷⡀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣼⠁⣴⣿⣿⣿⣿⣿⣿⣿⣿⣆⠉⠻⣧⠘⣷⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢰⡇⢰⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠀⠀⠈⠀⢹⡇⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⡇⢸⣿⠛⣿⣿⣿⣿⣿⣿⡿⠃⠀⠀⠀⠀⢸⡇⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣷⠀⢿⡆⠈⠛⠻⠟⠛⠉⠀⠀⠀⠀⠀⠀⣾⠃⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⣧⡀⠻⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣼⠃⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢼⠿⣦⣄⠀⠀⠀⠀⠀⠀⠀⣀⣴⠟⠁⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣠⣾⣿⣦⠀⠀⠈⠉⠛⠓⠲⠶⠖⠚⠋⠉⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⣠⣾⣿⣿⠟⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣠⣾⣿⣿⠟⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⣾⣿⣿⠟⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⢀⣄⠈⠛⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
""")
print(" Get someone's digital identity anonymously 👻 ")
print(" Made by "+Style.BRIGHT+Fore.RED+"TheRealDalunacrobate "+Fore.RESET+Style.RESET_ALL+"with 💝")
banner()
# Get the arguments
parser = argparse.ArgumentParser()
parser.add_argument("-n", "--name", help="Victim name")
parser.add_argument('-ln','--lastname',help="Last name of victim")
parser.add_argument('-json','--json',help="Print result in json")
parser.add_argument('-zp','--zp',help="Zip code (Optional)")
args = parser.parse_args()
# Set the vars
name = (args.lastname)
pren = (args.name)
json_print = (args.json)
zip_code = (args.zp)
def randomString(length):
return ''.join(random.choice(string.ascii_letters) for i in range(length))
thisIsATmpTokenListener = randomString(25);
possible_usernames = []
folder_name = "{}_{}".format(pren,name)
personnal_life = []
social_medias = []
# Crraeate the folder for the reports
try:
os.mkdir('Reports')
except FileExistsError:
pass
try:
os.mkdir('Reports/{}'.format(folder_name))
except FileExistsError:
pass
# Main
try:
if pren and name is not None:
print("\n🎭 Finding and filtering online identities ...")
try:
copainsdavant_results = copainsdavant_search.copains_davant(name=name,pren=pren)
except:
copainsdavant_results = None
try:
facebook_results = facebook_search.facebook_search(name=name,pren=pren)
except:
facebook_results = None
try:
twitter_results = twitter_search.twitter_search(name=name,pren=pren)
except:
twitter_results = None
try:
official_linkedin_search_results = linkedin_search.official_linkedin_search(pren=pren,name=name)
except:
official_linkedin_search_results = None
try:
avis_deces_results = death_records.death_search(name=name,pren=pren)
except:
avis_deces_results = None
try:
bfmtv_results = dirigeants_bfmtv.bfmtv_search(name=name,pren=pren)
except:
bfmtv_results = None
try:
instagram_results = instagram_search.ig_search(name=name,pren=pren)
except:
instagram_results = None
try:
skype_results = skype_search.skype_searchh(name=name,pren=pren)
except:
skype_results = None
try:
diplome_bac = last_diplomes.last_diplomes_bac(name=name,pren=pren)
except:
diplome_bac = None
try:
if zip_code is not None:
pagesblanche = pagesblanches_search.adresse_search(name=name,pren=pren,zipc=str(zip_code))
else:
pagesblanche = pagesblanches_search.adresse_search(name=name,pren=pren,zipc=None)
except:
pagesblanche = None
try:
linkedin_results = linkedin_search.linkedin_search(name=name,pren=pren)
except:
linkedin_results = None
soundcloud.webdriver_usage(name=name,pren=pren)
wattpad_results = wattpad_search.wattpad_module(pren,name)
possible_mail = mail_gen.check(name=name,pren=pren)
skype2mail = mail_gen.skype2email(name=name,pren=pren)
pin2mail = mail_gen.pinterest2email(name=name,pren=pren)
elif len(pren) and len(name) == 0:
linkedin_results = None
facebook_results = None
twitter_results = None
avis_deces_results = None
bfmtv_results = None
instagram_results = None
copainsdavant_results = None
skype_results = None
pagesblanche = None
possible_mail = None
skype2mail = None
pren = ""
name = ""
else:
linkedin_results = None
facebook_results = None
twitter_results = None
avis_deces_results = None
bfmtv_results = None
instagram_results = None
copainsdavant_results = None
skype_results = None
pagesblanche = None
possible_mail = None
skype2mail = None
pren = ""
name = ""
except TypeError:
linkedin_results = None
facebook_results = None
twitter_results = None
avis_deces_results = None
bfmtv_results = None
instagram_results = None
copainsdavant_results = None
skype_results = None
pagesblanche = None
possible_mail = None
skype2mail = None
pren = ""
name = ""
average_age = []
tree = Tree()
tree.create_node(f"{pren} {name}", 1)
data_export['Name'] = pren
data_export['LastName'] = name
try:
diplome_bac = last_diplomes.last_diplomes_bac(name=name,pren=pren)
except:
diplome_bac = None
# Daprofiler check les deces
if avis_deces_results is not None:
tree.create_node("Death Records",41518181871541514778,parent=1)
for i in avis_deces_results[:5]:
tree.create_node('{} | {}\t| {}'.format(i['Age'],i['Name'],i['Loc']),parent=41518181871541514778)
data_export['DeathRecords']['Exists'] = True
data_export['DeathRecords']['Records'] = avis_deces_results[:5]
try:
average_age.append(int(i['Age']))
except ValueError:
pass
# Daprofiler check les linkedin
if linkedin_results is not None:
tree.create_node('LinkedIN Profile',15418911611515145145,parent=1)
tree.create_node(linkedin_results,parent=15418911611515145145)
try:
if official_linkedin_search_results is not None:
Loc = official_linkedin_search_results['Loc']
job = official_linkedin_search_results['Job']
email = official_linkedin_search_results['email']
urnid = official_linkedin_search_results['urnid']
url = official_linkedin_search_results['url']
twitters = official_linkedin_search_results['twitters']
birthdate = official_linkedin_search_results['birthdate']
phone_numbers = official_linkedin_search_results['phone_numbers']
tree.create_node('LinkedIN (Via API)',15458156411556562162,parent=1)
tree.create_node(f'UrnID : {urnid}',5151515155,parent=15458156411556562162)
tree.create_node(f'Url : {url}',55185514542335,parent=15458156411556562162)
if len(twitters) > 0:
tree.create_node('Twitters',25848145481514,parent=15458156411556562162)
for i in twitters:
tree.create_node(i,parent=25848145481514)
else:
pass
if len(phone_numbers) > 0:
tree.create_node('Phone Numbers',28945181781,parent=15458156411556562162)
for i in phone_numbers:
tree.create_node(i,parent=28945181781)
else:
pass
if Loc != False:
tree.create_node(f'Location : {Loc}',4561561510515656,parent=15458156411556562162)
if job is not None:
tree.create_node(f'Job : {job}',511515,parent=15458156411556562162)
if birthdate is not None:
tree.create_node(f'Birth Date : {birthdate}',5881981648,parent=1058151514851)
if email is not None:
tree.create_node(f'Email : {str(email)}',parent=15458156411556562162)
data_export['LinkedIN']['Exist'] = True
data_export['LinkedIN']['Job'] = job
data_export['LinkedIN']['urnid' ] = urnid
data_export['LinkedIN']['Url'] = url
data_export['LinkedIN']['Twitters'] = twitters
data_export['LinkedIN']['Birthdate'] = birthdate
data_export['LinkedIN']['PhoneNumbers'] = phone_numbers
except:
pass
if pagesblanche is not None:
personnal_life.append('.')
full_name = pagesblanche['Name']
adress = pagesblanche['Adress']
phone = pagesblanche['Phone']
sure_status = pagesblanche['Not_Sure']
data_export['AdressPhone']['Not_Sure'] = sure_status
data_export['AdressPhone']['Exists'] = True
data_export['AdressPhone']['FullName'] = full_name
data_export['AdressPhone']['Phone'] = phone
data_export['AdressPhone']['Adress'] = adress
if sure_status == True:
tree.create_node("Adress - Phone",2,parent=1)
else:
tree.create_node("Adress - Phone (You must verify this information)",2,parent=1)
tree.create_node("Full Name : {}".format(full_name),22,parent=2)
tree.create_node("Adress : {}".format(adress),33,parent=2)
tree.create_node("Phone : {}".format(phone),44,parent=2)
if pagesblanche['carrier'] is not None:
tree.create_node('Carrier : {}'.format(pagesblanche['carrier']),894,parent=44)
if pagesblanche['Loc_phone'] is not None:
tree.create_node('Localisation : {}'.format(pagesblanche['Loc_phone']),55,parent=44)
data_export['AdressPhone']['PhoneLocation'] = pagesblanche['Loc_phone']
if pagesblanche['Type_tel'] is not None:
tree.create_node('Type : {}'.format(pagesblanche['Type_tel']),66,parent=44)
if diplome_bac is not None:
if diplome_bac['Exists'] == True:
tree.create_node('DIPLOME BAC',58,parent=1)
tree.create_node('Bac : '+diplome_bac['Diplome'],848151541514,parent=58)
tree.create_node('Academy : '+diplome_bac['academie'],848151241514,parent=58)
tree.create_node('Mention : '+diplome_bac['mention'],848151341514,parent=58)
tree.create_node('City : '+diplome_bac['ville'],848151641514,parent=58)
tree.create_node('Source : '+diplome_bac['Link'],45994851726,parent=58)
data_export['Diploma_Bac']['Exists'] = True
data_export['Diploma_Bac']['Academie'] = diplome_bac['academie']
data_export['Diploma_Bac']['Mention'] = diplome_bac['mention']
data_export['Diploma_Bac']['City'] = diplome_bac['ville']
data_export['Diploma_Bac']['Diplome'] = diplome_bac['Diplome']
data_export['Diploma_Bac']['Link'] = diplome_bac['Link']
# Daprofiler check les copains davant
if copainsdavant_results is not None:
personnal_life.append('.')
data_export['CopainsDavant']['Exists'] = True
try:
tree.create_node("Copains d'avant",3,parent=1)
tree.create_node('Full Name : {}'.format(copainsdavant_results['full_name']),77,parent=3)
tree.create_node('Born Date : {}'.format(copainsdavant_results['born']),88,parent=3)
tree.create_node('Location : {}'.format(copainsdavant_results['localisation']),99,parent=3)
tree.create_node('Url : {}'.format(copainsdavant_results['url_full']),111,parent=3)
data_export['CopainsDavant']['FullName'] = copainsdavant_results['full_name']
data_export['CopainsDavant']['BornDate'] = copainsdavant_results['born']
data_export['CopainsDavant']['ProfileUrl'] = copainsdavant_results['url_full'].replace('https://','')
data_export['CopainsDavant']['Location'] = copainsdavant_results['localisation']
if copainsdavant_results['Other_locations'] is not None:
chars = "abcdefghijklmnopqrstuvwxyz1234567890"
number_sk = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
tree.create_node('Other Locations',number_sk,parent=3)
for i in copainsdavant_results['Other_locations']:
if i != copainsdavant_results['localisation']:
tree.create_node(i,parent=number_sk)
data_export['CopainsDavant']['OtherLocations'] = copainsdavant_results['Other_locations']
if copainsdavant_results['pdp'] != "None":
try:
tree.create_node('Profile Picture : {}'.format(copainsdavant_results['pdp']),151515454545,parent=3)
data_export['CopainsDavant']['ProfilePicUrl'] = copainsdavant_results['pdp'].replace('https://','')
except:
pass
if copainsdavant_results['Job'] != "None":
try:
tree.create_node('Job : {}'.format(copainsdavant_results['Job']),154156132489411,parent=3)
data_export['CopainsDavant']['Job'] = copainsdavant_results['Job']
except:
pass
if copainsdavant_results['familial_situation'] != "None":
try:
tree.create_node('Familial Situation : {}'.format(copainsdavant_results['familial_situation'].strip()),44984154114515,parent=3)
data_export['CopainsDavant']['FSituation'] = copainsdavant_results['familial_situation']
except:
pass
if copainsdavant_results['nb_enfants'] != "None":
try:
tree.create_node('Number of kids : {}'.format(copainsdavant_results['nb_enfants']),1654518948741,parent=3)
data_export['CopainsDavant']['NbKids'] = copainsdavant_results['nb_enfants']
except:
pass
except TypeError:
pass
# Daprofiler check BFMtv
if bfmtv_results is not None:
personnal_life.append('.')
data_export['Work']['Exists'] = True
data_export['Work']['FullName'] = bfmtv_results['full_name']
data_export['Work']['BornDate'] = bfmtv_results['naissance']
data_export['Work']['Company'] = bfmtv_results['company']
data_export['Work']['Function'] = bfmtv_results['fonction']
data_export['Work']['Warrant'] = bfmtv_results['mandats']
data_export['Work']['Link'] = bfmtv_results['link'].replace('https://','')
data_export['Work']['Capital'] = bfmtv_results['Capital']
data_export['Work']['Desc'] = bfmtv_results['Desc']
tree.create_node("Work - Job",4,parent=1)
tree.create_node('Full Name : {}'.format(bfmtv_results['full_name']),222,parent=4)
tree.create_node('Born Date : {}'.format(bfmtv_results['naissance']),333,parent=4)
tree.create_node('Adress : {}'.format(bfmtv_results['addr']),888,parent=4)
tree.create_node('Company : {}'.format(bfmtv_results['company']),777,parent=4)
tree.create_node('Desc : {}'.format(bfmtv_results['Desc']),78285,parent=4)
tree.create_node('Capital : {}'.format(bfmtv_results['Capital']),84566,parent=4)
tree.create_node('Link : {}'.format(bfmtv_results['link']),666,parent=4)
tree.create_node('Function : {}'.format(bfmtv_results['fonction']),444,parent=4)
tree.create_node('Warrant : {}'.format(bfmtv_results['mandats']),555,parent=4)
# Daprofiler check twitter
if twitter_results is not None:
social_medias.append('.')
data_export['Twitter']['Exists'] = True
data_export['Twitter']['Accounts'] = twitter_results
tree.create_node('Twitters',665847555858,parent=1)
for i in twitter_results:
temp = []
chars = "abcdefghijklmnopqrstuvwxyz1234567890"
number_sk = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
domain_list = ['@gmail.com','@hotmail.fr','@hotmail.com','@orange.fr','@outlook.com','@outlook.fr']
for domain in domain_list:
a = mail_check.verify(i.replace('@','')+domain)
if a == "True":
temp.append(i.replace('@','').lower()+domain)
if len(temp) == 0:
tree.create_node(i,parent=665847555858)
else:
tree.create_node(i,number_sk,parent=665847555858)
for temp_mail in temp:
tree.create_node(temp_mail,parent=number_sk)
# Daprofiler check skype
if skype_results is not None:
social_medias.append('.')
data_export['Skype']['Exists'] = True
data_export['Skype']['AccountList'] = skype_results
if len(skype_results) == 0:
pass
else:
tree.create_node("Skype",6,parent=1)
tree.create_node("Accounts : {}".format(str(len(skype_results))),12,parent=6)
for i in skype_results:
chars = "abcdefghijklmnopqrstuvwxyz1234567890"
number_sk = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
tree.create_node(i,number_sk,parent=12)
# Diploma printing
try:
try:
diplomess = last_diplomes.last_diplomes_brevet(name=name,pren=pren)
except :
diplomess = None
if diplomess is not None:
tree.create_node('BREVET DES COLLEGES',452,parent=1)
tree.create_node('Name : {}'.format(diplomess['Name']),1816864648,parent=452)
tree.create_node('Diploma : {}'.format(diplomess['Diplome']),45855887,parent=452)
tree.create_node('Details : {}'.format(diplomess['mention']),45855847,parent=452)
tree.create_node('Academy : {}'.format(diplomess['academie']),45855687,parent=452)
tree.create_node('Location : {}'.format(diplomess['ville']),45855881,parent=452)
tree.create_node('Source : {}'.format(diplomess['Link']),45896472,parent=452)
data_export['Diploma_Brevet']['Name'] = diplomess['Name']
data_export['Diploma_Brevet']['Exists'] = True
data_export['Diploma_Brevet']['Academie'] = diplomess['academie']
data_export['Diploma_Brevet']['Mention'] = diplomess['mention']
data_export['Diploma_Brevet']['City'] = diplomess['ville']
data_export['Diploma_Brevet']['Link'] = diplomess['Link']
except NameError:
pass
# Daprofiler check instagram
if instagram_results is not None:
if len(instagram_results) == 0:
pass
else:
social_medias.append('.')
data_export['Instagram']['Exists'] = True
tree.create_node("Instagram",7,parent=1)
tree.create_node('Accounts : {}'.format(str(len(instagram_results))),13,parent=7)
acc_json_list = []
for i in instagram_results:
chars = "abcdefghijklmnopqrstuvwxyz1234567890"
username = i
number_ski = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
bio_infos = instagram_search.getInstagramEmailFromBio(username)
tree.create_node(i,number_ski,parent=13)
try:
data = instagram_search.get_extra_data(username)
if data is None:
ob_phone = False
ob_mail = False
pass
else:
if data != {}:
if data['obfuscated_email'] is not None:
ob_mail = data['obfuscated_email']
tree.create_node("Obfuscated Email -> "+ob_mail,parent=number_ski)
else:
ob_mail = False
if data['obfuscated_phone'] is not None:
ob_phone = data['obfuscated_phone']
tree.create_node("Obfuscated Phone -> "+ob_phone,parent=number_ski)
else:
ob_phone = False
else:
ob_phone = False
ob_mail = False
finally:
pass
acc_json_list.append({"Username":username,'obfuscated_phone':ob_phone,'obfuscated_email':ob_mail})
bio_emails = bio_infos['emails']
paypal_bio = bio_infos['paypal']
city_loc = bio_infos['city_list']
is_lgbt = bio_infos['lgbt_points']
schoolname = bio_infos['school']
bestfriend = bio_infos['best_friend']
love_date = bio_infos['love_date']
age_bio = bio_infos['age']
ethnicity = bio_infos['origins']
facebook_l = bio_infos['fb_list']
twitter_l = bio_infos['twitter_list']
hobbies = bio_infos['Hobbies']
love_situa = bio_infos['love_situation']
religions = bio_infos['religions']
astrologys = bio_infos['astrology']
if love_situa is not None:
nnumber_ski = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
tree.create_node('Love Situation',nnumber_ski,parent=number_ski)
for i in love_situa:
tree.create_node(i,parent=nnumber_ski)
if astrologys is not None:
nnumber_ski = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
tree.create_node('Astrologic sign',nnumber_ski,parent=number_ski)
for i in astrologys:
tree.create_node(i,parent=nnumber_ski)
if religions is not None:
nnumber_ski = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
tree.create_node('Religion(s)',nnumber_ski,parent=number_ski)
for i in religions:
tree.create_node(i,parent=nnumber_ski)
if hobbies is not None:
nnumber_ski = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
tree.create_node('Hobbies',nnumber_ski,parent=number_ski)
for i in hobbies:
tree.create_node(i,parent=nnumber_ski)
if bestfriend is not None:
nnumber_ski = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
tree.create_node('Good relationship with',nnumber_ski,parent=number_ski)
for i in bestfriend:
tree.create_node('{}'.format(i),parent=nnumber_ski)
if is_lgbt is not None:
lgbt_flag = (Fore.RED+"█"+Fore.YELLOW+"█"+Fore.GREEN+"█"+Fore.BLUE+"█"+Fore.MAGENTA+"█"+Fore.RESET)
tree.create_node('{} LGBT Member'.format(lgbt_flag),parent=number_ski)
if ethnicity is not None:
tree.create_node('Ethnicity : {}'.format(str(ethnicity).replace('[','').replace(']','').replace("'","")),parent=number_ski)
if facebook_l is not None:
tree.create_node('Facebook : {}'.format(str(facebook_l).replace('[','').replace(']','').replace("'","")),parent=number_ski)
if twitter_l is not None:
tree.create('Twitter : {}'.format(str(twitter_l).replace('[','').replace(']','').replace("'","")),parent=number_ski)
if schoolname is not None:
tree.create_node('School Name : {}'.format(schoolname),parent=number_ski)
if city_loc is not None:
tree.create_node('City : {}'.format(city_loc[0]),parent=number_ski)
if paypal_bio is not None:
for i in paypal_bio:
tree.create_node('Paypal in bio -> '+i,parent=number_ski)
if bio_emails is not None:
for i in bio_emails:
chars = "abcdefghijklmnopqrstuvwxyz1234567890"
number_skkk = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
number_skk = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
tree.create_node('Email from bio -> '+Fore.CYAN+i+Fore.RESET,number_skkk,parent=number_ski)
data_export['Instagram']['AccountList'] = acc_json_list
# Daprofiler check facebook
if facebook_results is not None:
social_medias.append('.')
data_export['Facebook']['Exists'] = True
nb = str(len(facebook_results))
tree.create_node("Facebook",9,parent=1)
tree.create_node('Accounts : {}'.format(nb),10,parent=9)
data_export['Facebook']['AccountList'] = facebook_results
for i in facebook_results:
tree.create_node(i,parent=10)
# Daprofiler generate Possible Email
if possible_mail is not None:
if len(possible_mail) != 0 or len(skype2mail) != 0 or pin2mail is not None:
tree.create_node('Emails extracted',146,parent=1)
if skype2mail is not None:
tree.create_node('[++] High probability',142,parent=146)
no_doubles = []
for i in skype2mail:
if i not in no_doubles:
chars = "abcdefghijklmnopqrstuvwxyz1234567890"
number = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
no_doubles.append(i)
tree.create_node(i,number,parent=142)
# GETTING LEAKED PASSWORDS FROM SCYLLA.SH -> \modules\scylla_sh.py
scylla_results = scylla_sh.scylla_search(email=i)
if scylla_results is not None:
tree.create_node('Leaked From : Scylla.sh',1518451,parent=number)
for i in scylla_results:
chars = "abcdefghijklmnopqrstuvwxyz1234567890"
number = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
tree.create_node('Leak Name : {}'.format(i['Name']),parent=1518451)
tree.create_node('Password : {}'.format(i['Password']),parent=1518451)
# GET LEAKED PASSWORDS FROM LEAKCHET.NET API -> \api_modules\leakcheck_net.py
a = leakcheck_net.leak_check_api(mail=i)
if a is not None:
chars = "abcdefghijklmnopqrstuvwxyz1234567890"
number_pass = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
tree.create_node("Leaked Creditentials",number_pass,parent=number)
for i in a:
password = i['password']
leak_name = i['leak_name']
leak_date = i['leak_date']
tree.create_node('Password : {}'.format(password),parent=number_pass)
tree.create_node('Leak Name : {}'.format(leak_name),parent=number_pass)
tree.create_node('Leak Date : {}'.format(leak_date),parent=number_pass)
data_export['Emails']['HighProbEmails'] = no_doubles
nb= str((len(possible_mail)))
if pin2mail is not None:
tree.create_node('[+++] Very high probability',45451451545545155154,parent=146)
for i in pin2mail:
tree.create_node('-> '+Fore.RED+i+Fore.RESET+" (Scraped from pinterest profile)",parent=45451451545545155154)
if int(nb) != 0:
tree.create_node("("+nb+") Possible Mailbox",8,parent=146)
data_export['Emails']['PermutatedMailbox'] = possible_mail
for i in possible_mail:
tree.create_node(i,parent=8)
print("✅ Ready to be consulted !")
print('\n')
# For data Analyzation
data_export['UI']['Pie']['PersonnalLife'] = len(personnal_life)
data_export['UI']['Pie']['SocialMedias'] = len(social_medias)
try:
data_export['UI']['Bar']['TwitterFounds'] = len(twitter_results)
except TypeError:
data_export['UI']['Bar']['TwitterFounds'] = 0
try:
data_export['UI']['Bar']['InstagramFounds'] = len(instagram_results)
except TypeError:
data_export['UI']['Bar']['InstagramFounds'] = 0
try:
data_export['UI']['Bar']['FacebookFounds'] = len(facebook_results)
except TypeError:
data_export['UI']['Bar']['FacebookFounds'] = 0
try:
data_export['UI']['Bar']['SkypeFounds'] = len(skype_results)
except TypeError:
data_export['UI']['Bar']['SkypeFounds'] = 0
if json_print == "true" or json_print == "yes" or json_print == "oui":
print('-- JSON START --')
print(data_export)
print('-- JSON END --')
else:
tree.show()
data_file.close()
try:
with open(f'Reports/{folder_name}/{name}_{pren}.json','w',encoding='utf8') as f:
json.dump(data_export,f,indent=4,ensure_ascii=False)
f.close()
except FileNotFoundError:
os.mkdir('Reports')
with open(f'Reports/{folder_name}/{name}_{pren}.json','w',encoding='utf8') as f:
json.dump(data_export,f,indent=4,ensure_ascii=False)
f.close()
================================================
FILE: requirements.txt
================================================
requests
bs4
selenium
colorama
googlesearch-python
treelib
leakcheck
update_check
httpx
tqdm
linkedin-api~=2.0.0a
statistics
python-socketio
numpy
opencv-python
gitextract_0eokzll_/ ├── .github/ │ ├── ISSUE_TEMPLATE/ │ │ ├── bug_report.md │ │ ├── custom.md │ │ └── feature_request.md │ └── workflows/ │ ├── easyRun.yml │ └── testCode.yml ├── .gitignore ├── CODE_OF_CONDUCT.md ├── CONTRIBUTING.md ├── LICENSE ├── README.md ├── modules/ │ ├── api_modules/ │ │ └── leakcheck_net.py │ ├── config/ │ │ └── config.json │ ├── diplomes/ │ │ └── last_diplomes.py │ ├── face_recognition/ │ │ ├── face_recon.py │ │ └── lbpcascade_frontalface.xml │ ├── google_dorking.py │ ├── mail/ │ │ ├── indic.txt │ │ ├── mail_check.py │ │ ├── mail_domain.txt │ │ ├── mail_gen.py │ │ └── scylla_sh.py │ ├── official_documents/ │ │ ├── death_records.py │ │ ├── dirigeants_bfmtv.py │ │ └── pagesblanches_search.py │ ├── phone/ │ │ └── phone_search.py │ ├── report.json │ ├── social_medias/ │ │ ├── copainsdavant_search.py │ │ ├── facebook_search.py │ │ ├── instagram_search.py │ │ ├── linkedin_search.py │ │ ├── skype_search.py │ │ ├── soundcloud.py │ │ ├── twitter_search.py │ │ └── wattpad_search.py │ └── visual/ │ └── logging.py ├── profiler.py └── requirements.txt
SYMBOL INDEX (32 symbols across 19 files) FILE: modules/api_modules/leakcheck_net.py function leak_check_api (line 6) | def leak_check_api(mail): FILE: modules/diplomes/last_diplomes.py function last_diplomes_bac (line 4) | def last_diplomes_bac(name,pren): function last_diplomes_brevet (line 47) | def last_diplomes_brevet(name,pren): FILE: modules/face_recognition/face_recon.py function contains_face (line 7) | def contains_face(image_url): function check (line 23) | def check(image_url): FILE: modules/mail/mail_check.py function verify (line 3) | def verify(mail): FILE: modules/mail/mail_gen.py function check (line 6) | def check(name,pren): function skype2email (line 33) | def skype2email(name,pren): function pinterest2email (line 67) | def pinterest2email(name,pren): FILE: modules/mail/scylla_sh.py function scylla_search (line 3) | def scylla_search(email): FILE: modules/official_documents/death_records.py function death_search (line 5) | def death_search(name,pren): FILE: modules/official_documents/dirigeants_bfmtv.py function bfmtv_search (line 4) | def bfmtv_search(name,pren): FILE: modules/official_documents/pagesblanches_search.py function adresse_search (line 4) | def adresse_search(name,pren,zipc): FILE: modules/social_medias/copainsdavant_search.py function check_response (line 6) | def check_response(url): function copains_davant (line 14) | def copains_davant(name,pren): FILE: modules/social_medias/facebook_search.py function facebook_search (line 4) | def facebook_search(name,pren): FILE: modules/social_medias/instagram_search.py function cleartext (line 4) | def cleartext(text): function get_info_from_bio (line 12) | def get_info_from_bio(bio): function getInstagramEmailFromBio (line 320) | def getInstagramEmailFromBio(username): function get_profile_infos (line 336) | def get_profile_infos(profile): function ig_search (line 355) | def ig_search(name,pren): function advanced_lookup (line 384) | def advanced_lookup(username): function get_extra_data (line 416) | def get_extra_data(username): FILE: modules/social_medias/linkedin_search.py function linkedin_search (line 3) | def linkedin_search(name,pren): function official_linkedin_search (line 17) | def official_linkedin_search(name,pren): FILE: modules/social_medias/skype_search.py function skype_searchh (line 6) | def skype_searchh(name,pren): FILE: modules/social_medias/soundcloud.py function webdriver_usage (line 5) | def webdriver_usage(name,pren): FILE: modules/social_medias/twitter_search.py function twitter_search (line 4) | def twitter_search(name,pren): FILE: modules/social_medias/wattpad_search.py function wattpad_module (line 5) | def wattpad_module(pren,name): FILE: modules/visual/logging.py function speculos_lotus (line 1) | def speculos_lotus(): FILE: profiler.py function banner (line 37) | def banner(): function randomString (line 79) | def randomString(length):
Condensed preview — 37 files, each showing path, character count, and a content snippet. Download the .json file or copy for the full structured content (192K chars).
[
{
"path": ".github/ISSUE_TEMPLATE/bug_report.md",
"chars": 834,
"preview": "---\nname: Bug report\nabout: Create a report to help us improve\ntitle: ''\nlabels: ''\nassignees: ''\n\n---\n\n**Describe the b"
},
{
"path": ".github/ISSUE_TEMPLATE/custom.md",
"chars": 126,
"preview": "---\nname: Custom issue template\nabout: Describe this issue template's purpose here.\ntitle: ''\nlabels: ''\nassignees: ''\n\n"
},
{
"path": ".github/ISSUE_TEMPLATE/feature_request.md",
"chars": 595,
"preview": "---\nname: Feature request\nabout: Suggest an idea for this project\ntitle: ''\nlabels: ''\nassignees: ''\n\n---\n\n**Is your fea"
},
{
"path": ".github/workflows/easyRun.yml",
"chars": 849,
"preview": "\nname: Daprofiler Easy run\n\non:\n workflow_dispatch:\n inputs:\n name:\n runners:\n description: 'no"
},
{
"path": ".github/workflows/testCode.yml",
"chars": 657,
"preview": "\nname: Daprofiler test\n\non:\n push:\n branches: [ \"main\" ]\n\npermissions:\n contents: read\n\njobs:\n build:\n\n runs-on"
},
{
"path": ".gitignore",
"chars": 168,
"preview": "hub/__pycache__/*\nmodules/__pycache__/*\nmodules/visual/__pycache__/*\nmodules/api_modules/__pycache__/*\nReports/*\nhub_rep"
},
{
"path": "CODE_OF_CONDUCT.md",
"chars": 5226,
"preview": "# Contributor Covenant Code of Conduct\n\n## Our Pledge\n\nWe as members, contributors, and leaders pledge to make participa"
},
{
"path": "CONTRIBUTING.md",
"chars": 43,
"preview": "No contribution allow before Daprofiler v2\n"
},
{
"path": "LICENSE",
"chars": 35149,
"preview": " GNU GENERAL PUBLIC LICENSE\n Version 3, 29 June 2007\n\n Copyright (C) 2007 Free "
},
{
"path": "README.md",
"chars": 1696,
"preview": "\n\n\n![](https://visitor"
},
{
"path": "modules/api_modules/leakcheck_net.py",
"chars": 1407,
"preview": "import leakcheck\nfrom leakcheck import LeakCheckAPI\n\nfrom colorama import Fore\n\ndef leak_check_api(mail):\n full_resul"
},
{
"path": "modules/config/config.json",
"chars": 114,
"preview": "{\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",
"chars": 3471,
"preview": "import requests\r\nfrom bs4 import BeautifulSoup\r\n\r\ndef last_diplomes_bac(name,pren):\r\n url = f'https://resultats.etudi"
},
{
"path": "modules/face_recognition/face_recon.py",
"chars": 640,
"preview": "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 re"
},
{
"path": "modules/face_recognition/lbpcascade_frontalface.xml",
"chars": 51854,
"preview": "<?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<c"
},
{
"path": "modules/google_dorking.py",
"chars": 0,
"preview": ""
},
{
"path": "modules/mail/indic.txt",
"chars": 7723,
"preview": "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\n0"
},
{
"path": "modules/mail/mail_check.py",
"chars": 525,
"preview": "import requests\r\n\r\ndef verify(mail):\r\n try:\r\n response = requests.get(\"https://isitarealemail.com/api/email/va"
},
{
"path": "modules/mail/mail_domain.txt",
"chars": 108,
"preview": "@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",
"chars": 2970,
"preview": "import threading, requests, bs4\r\nfrom bs4 import BeautifulSoup\r\nfrom modules.mail import mail_check\r\n#from goog"
},
{
"path": "modules/mail/scylla_sh.py",
"chars": 1019,
"preview": "import requests\r\n\r\ndef scylla_search(email):\r\n try:\r\n r = requests.get('https://scylla.so/search?q=email:{}'.f"
},
{
"path": "modules/official_documents/death_records.py",
"chars": 1181,
"preview": "import profile\r\nimport requests,bs4\r\nfrom bs4 import BeautifulSoup\r\n\r\ndef death_search(name,pren):\r\n try:\r\n ur"
},
{
"path": "modules/official_documents/dirigeants_bfmtv.py",
"chars": 1762,
"preview": "import requests, bs4\r\nfrom bs4 import BeautifulSoup\r\n\r\ndef bfmtv_search(name,pren):\r\n try:\r\n r = requests"
},
{
"path": "modules/official_documents/pagesblanches_search.py",
"chars": 1686,
"preview": "import requests, bs4\r\nfrom bs4 import BeautifulSoup\r\n\r\ndef adresse_search(name,pren,zipc):\r\n if zipc is not None"
},
{
"path": "modules/phone/phone_search.py",
"chars": 0,
"preview": ""
},
{
"path": "modules/report.json",
"chars": 2244,
"preview": "{\r\n \"Name\":false,\r\n \"LastName\":false,\r\n\r\n \"UI\":{\r\n \"Pie\":{\r\n \"PersonnalLife\":false,\r\n "
},
{
"path": "modules/social_medias/copainsdavant_search.py",
"chars": 4306,
"preview": "import requests, json\r\nfrom bs4 import BeautifulSoup\r\nfrom modules.face_recognition import face_recon\r\nfrom colorama imp"
},
{
"path": "modules/social_medias/facebook_search.py",
"chars": 732,
"preview": "import requests, bs4, re\r\nfrom bs4 import BeautifulSoup\r\n\r\ndef facebook_search(name,pren):\r\n url = \"https://fr-fr.fac"
},
{
"path": "modules/social_medias/instagram_search.py",
"chars": 14773,
"preview": "import json, httpx, urllib, hmac,hashlib, sys, os, bs4, requests\r\nfrom bs4 import BeautifulSoup\r\n\r\ndef cleartext(text)"
},
{
"path": "modules/social_medias/linkedin_search.py",
"chars": 2112,
"preview": "from linkedin_api import Linkedin\r\n\r\ndef linkedin_search(name,pren):\r\n try:\r\n \"\"\"\r\n a = search('\"{} {}\""
},
{
"path": "modules/social_medias/skype_search.py",
"chars": 1017,
"preview": "import requests, bs4\r\nfrom bs4 import BeautifulSoup\r\n\r\nfrom modules.mail import mail_check\r\n\r\ndef skype_searchh(name,pre"
},
{
"path": "modules/social_medias/soundcloud.py",
"chars": 872,
"preview": "from selenium import webdriver\nfrom colorama import Fore\nimport time\n\ndef webdriver_usage(name,pren):\n print(\"🎧 Searc"
},
{
"path": "modules/social_medias/twitter_search.py",
"chars": 475,
"preview": "import requests, bs4\r\nfrom bs4 import BeautifulSoup\r\n\r\ndef twitter_search(name,pren):\r\n url = \"https://www.sotwe.com/"
},
{
"path": "modules/social_medias/wattpad_search.py",
"chars": 612,
"preview": "import time, colorama\r\nfrom colorama import Fore\r\nfrom selenium import webdriver\r\n\r\ndef wattpad_module(pren,name):\r\n "
},
{
"path": "modules/visual/logging.py",
"chars": 531,
"preview": "def speculos_lotus():\r\n try:\r\n with open(\"modules/mail_domain.txt\",\"r\") as file:\r\n lines = file.rea"
},
{
"path": "profiler.py",
"chars": 31437,
"preview": "from colorama.initialise import init\r\n\r\nfrom json import decoder\r\nimport threading, time, colorama, treelib, random, sys"
},
{
"path": "requirements.txt",
"chars": 176,
"preview": "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"
}
]
About this extraction
This page contains the full source code of the TheRealDalunacrobate/DaProfiler GitHub repository, extracted and formatted as plain text for AI agents and large language models (LLMs). The extraction includes 37 files (174.9 KB), approximately 48.4k tokens, and a symbol index with 32 extracted functions, classes, methods, constants, and types. Use this with OpenClaw, Claude, ChatGPT, Cursor, Windsurf, or any other AI tool that accepts text input. You can copy the full output to your clipboard or download it as a .txt file.
Extracted by GitExtract — free GitHub repo to text converter for AI. Built by Nikandr Surkov.