Linux webserver 6.8.0-49-generic #49~22.04.1-Ubuntu SMP PREEMPT_DYNAMIC Wed Nov 6 17:42:15 UTC 2 x86_64
Apache/2.4.52 (Ubuntu)
Server IP : 192.168.1.1 & Your IP : 18.218.135.221
Domains :
Cant Read [ /etc/named.conf ]
User : www-data
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
lib /
python3 /
dist-packages /
chardet /
Delete
Unzip
Name
Size
Permission
Date
Action
__pycache__
[ DIR ]
drwxr-xr-x
2024-02-16 18:48
cli
[ DIR ]
drwxr-xr-x
2024-02-16 18:53
metadata
[ DIR ]
drwxr-xr-x
2024-02-16 18:53
__init__.py
3.19
KB
-rw-r--r--
2020-12-10 18:52
big5freq.py
30.52
KB
-rw-r--r--
2020-11-17 22:04
big5prober.py
1.72
KB
-rw-r--r--
2017-04-11 17:51
chardistribution.py
9.19
KB
-rw-r--r--
2020-11-17 22:04
charsetgroupprober.py
3.75
KB
-rw-r--r--
2020-12-10 18:52
charsetprober.py
4.99
KB
-rw-r--r--
2020-12-08 20:42
codingstatemachine.py
3.51
KB
-rw-r--r--
2020-11-17 22:04
compat.py
1.17
KB
-rw-r--r--
2020-12-10 18:52
cp949prober.py
1.81
KB
-rw-r--r--
2017-04-11 17:51
enums.py
1.62
KB
-rw-r--r--
2020-11-17 22:04
escprober.py
3.86
KB
-rw-r--r--
2020-11-17 22:04
escsm.py
10.26
KB
-rw-r--r--
2020-11-17 22:04
eucjpprober.py
3.66
KB
-rw-r--r--
2020-11-17 22:04
euckrfreq.py
13.23
KB
-rw-r--r--
2020-11-17 22:04
euckrprober.py
1.71
KB
-rw-r--r--
2017-04-11 17:51
euctwfreq.py
30.88
KB
-rw-r--r--
2020-11-17 22:04
euctwprober.py
1.71
KB
-rw-r--r--
2020-11-17 22:04
gb2312freq.py
20.23
KB
-rw-r--r--
2020-11-17 22:04
gb2312prober.py
1.71
KB
-rw-r--r--
2020-11-17 22:04
hebrewprober.py
13.51
KB
-rw-r--r--
2020-12-08 20:42
jisfreq.py
25.17
KB
-rw-r--r--
2020-11-17 22:04
jpcntx.py
19.18
KB
-rw-r--r--
2020-11-17 22:04
langbulgarianmodel.py
103.21
KB
-rw-r--r--
2020-12-10 18:52
langgreekmodel.py
97.23
KB
-rw-r--r--
2020-12-10 18:52
langhebrewmodel.py
96.45
KB
-rw-r--r--
2020-12-10 18:52
langhungarianmodel.py
100.08
KB
-rw-r--r--
2020-12-10 18:52
langrussianmodel.py
128.09
KB
-rw-r--r--
2020-12-10 18:52
langthaimodel.py
100.88
KB
-rw-r--r--
2020-12-10 18:52
langturkishmodel.py
93.69
KB
-rw-r--r--
2020-12-10 18:52
latin1prober.py
5.24
KB
-rw-r--r--
2020-12-08 20:42
mbcharsetprober.py
3.33
KB
-rw-r--r--
2020-11-17 22:04
mbcsgroupprober.py
1.96
KB
-rw-r--r--
2020-11-17 22:04
mbcssm.py
24.88
KB
-rw-r--r--
2020-11-17 22:04
sbcharsetprober.py
5.99
KB
-rw-r--r--
2020-12-10 18:52
sbcsgroupprober.py
4.21
KB
-rw-r--r--
2020-12-10 18:52
sjisprober.py
3.69
KB
-rw-r--r--
2020-11-17 22:04
universaldetector.py
12.21
KB
-rw-r--r--
2020-12-10 18:52
utf8prober.py
2.7
KB
-rw-r--r--
2020-11-17 22:04
version.py
242
B
-rw-r--r--
2020-12-10 18:52
Save
Rename
######################## BEGIN LICENSE BLOCK ######################## # The Original Code is Mozilla Universal charset detector code. # # The Initial Developer of the Original Code is # Netscape Communications Corporation. # Portions created by the Initial Developer are Copyright (C) 2001 # the Initial Developer. All Rights Reserved. # # Contributor(s): # Mark Pilgrim - port to Python # Shy Shalom - original C code # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library 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 # Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public # License along with this library; if not, write to the Free Software # Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA # 02110-1301 USA ######################### END LICENSE BLOCK ######################### import logging import re from .enums import ProbingState class CharSetProber(object): SHORTCUT_THRESHOLD = 0.95 def __init__(self, lang_filter=None): self._state = None self.lang_filter = lang_filter self.logger = logging.getLogger(__name__) def reset(self): self._state = ProbingState.DETECTING @property def charset_name(self): return None def feed(self, buf): pass @property def state(self): return self._state def get_confidence(self): return 0.0 @staticmethod def filter_high_byte_only(buf): buf = re.sub(b'([\x00-\x7F])+', b' ', buf) return buf @staticmethod def filter_international_words(buf): """ We define three types of bytes: alphabet: english alphabets [a-zA-Z] international: international characters [\x80-\xFF] marker: everything else [^a-zA-Z\x80-\xFF] The input buffer can be thought to contain a series of words delimited by markers. This function works to filter all words that contain at least one international character. All contiguous sequences of markers are replaced by a single space ascii character. This filter applies to all scripts which do not use English characters. """ filtered = bytearray() # This regex expression filters out only words that have at-least one # international character. The word may include one marker character at # the end. words = re.findall(b'[a-zA-Z]*[\x80-\xFF]+[a-zA-Z]*[^a-zA-Z\x80-\xFF]?', buf) for word in words: filtered.extend(word[:-1]) # If the last character in the word is a marker, replace it with a # space as markers shouldn't affect our analysis (they are used # similarly across all languages and may thus have similar # frequencies). last_char = word[-1:] if not last_char.isalpha() and last_char < b'\x80': last_char = b' ' filtered.extend(last_char) return filtered @staticmethod def filter_with_english_letters(buf): """ Returns a copy of ``buf`` that retains only the sequences of English alphabet and high byte characters that are not between <> characters. Also retains English alphabet and high byte characters immediately before occurrences of >. This filter can be applied to all scripts which contain both English characters and extended ASCII characters, but is currently only used by ``Latin1Prober``. """ filtered = bytearray() in_tag = False prev = 0 for curr in range(len(buf)): # Slice here to get bytes instead of an int with Python 3 buf_char = buf[curr:curr + 1] # Check if we're coming out of or entering an HTML tag if buf_char == b'>': in_tag = False elif buf_char == b'<': in_tag = True # If current character is not extended-ASCII and not alphabetic... if buf_char < b'\x80' and not buf_char.isalpha(): # ...and we're not in a tag if curr > prev and not in_tag: # Keep everything after last non-extended-ASCII, # non-alphabetic character filtered.extend(buf[prev:curr]) # Output a space to delimit stretch we kept filtered.extend(b' ') prev = curr + 1 # If we're not in a tag... if not in_tag: # Keep everything after last non-extended-ASCII, non-alphabetic # character filtered.extend(buf[prev:]) return filtered