;OOf7; dZddlmZddlmZddlZddlmZddlZ ddlm Z m Z dZ ejeZej"edZej"ed ZGd d eZdadd Zdd ZddZdZy#e $r ddl m Z m Z YfwxYw)z' Public Suffix List module for Python. )absolute_import)unicode_literalsN)path)urlopenRequestz4https://publicsuffix.org/list/public_suffix_list.datzpublic_suffix_list.datzpublic_suffix_list.ABOUTcJeZdZd dZdZdZdZdZdZd dZ d d Z d d Z y) PublicSuffixListNc|t|tr:tj|xstdd5}|j }dddn|}g|_|j|}|j||_ y#1swY9xYw)a/ Read and parse a public suffix list. `psl_file` is either a file location string, or a file-like object, or an iterable of lines from a public suffix data file. If psl_file is None, the vendored file named "public_suffix_list.dat" is loaded. It is stored side by side with this Python package. The Mozilla public suffix list is no longer IDNA-encoded, it is UTF-8. For use cases with domains that are IDNA encoded, choose idna=True and the list will be converted upon loading. The wrong encoding will provide incorrect answers in either use case. The file format is described at http://publicsuffix.org/ :param psl_file: string or None :param idna: boolean, whether to convert file to IDNA-encoded strings Nrutf8)encoding) isinstancestrcodecsopenPSL_FILE readlinestlds_build_structure _simplifyroot)selfpsl_fileidnapslrs W/var/www/premiumrankchecker/venv/lib/python3.12/site-packages/publicsuffix2/__init__.py__init__zPublicSuffixList.__init__As(  z(C8X13H &Cmmo & &C $$S$/NN4(  & &s A??Bc|s|St|dk(r|jit|dk(sJ|\}}|j}|j|d}|sdgx||<}|j ||S)a Processing each line of the public suffix list recursively to build the Trie. Each line is processed into a dictionary, which may contain sub- Trie, and nodes terminate in node of either 0 or 1 (negate). This method takes the current parent Trie, and searches it for the next part in the line (child). If not found, it adds a node to the Trie, creating a new branch with the [0]. If found, the existing sub-Trie is passed for the next part. :param parent: current Trie, form is Tuple (negate, dict of Trie) :param parts: list of strings :return: recursive search for remaining domain parts Nr)lenappendpopget _find_node)rparentparts_negatechildrenchild child_nodes rr%zPublicSuffixList._find_nodeasM v;!  MM" 6{a" \\%. ,-3 .HUOjz511c|jdrd}|dd}nd}|jd}||j||d<y)aG Initial setup for a line of the public suffix list. If it starts with ! that is a negation operation. this calls the find_node() method recursively to build out the Trie for this rule. :param root: root Trie :param rule: string, line of public suffixlist :return: None !rNr.) startswithsplitr%)rrrulenegater's r _add_rulezPublicSuffixList._add_rulesG ??3 F8DF 3*0e$Q'r,c~t|dk(r|dS|dtfd|djDfS)z Condense the lines of the Trie in place. :param node: node in the Trie, either 0/1 or a subTrie :return: simplified Trie, form Tuple rrc3JK|]\}}|j|fyw)N)r).0kvrs r z-PublicSuffixList._simplify..s#S!Qq$.."34Ss #)r!dictitems)rnodes` rrzPublicSuffixList._simplifys= t9>7NQS47==?SSTTr,cBdg}|j}|D]}|j}|r|jdr'|r|jdj }|j ||j ||jdjd|S)a Build a Trie from the public suffix list. If idna==True, idna-encode each line before building. The Trie is comprised of tuples that encode whether the line is a negation line (0 or 1), and terminate with 0. Each node is represented with two-tuple of the form (negate, dict of children / sub-Trie). A partial subTrie therefore looks like: (0, {'ac': 0, 'co': (0, {'blogspot': 0}), 'gv': 0,....}) where each tuple starts with the negation encoding, and each leaf in the Trie as a dictionary element returns 0. Also creates an instance attribute, tlds, which simply contains the publicsuffix list, with the modifiers such as wildcards, as a list. This can be accessed for post-processing by the application. :param fp: pointer for the public suffix list :param idna: boolean, convert lines to idna-encoded strings :return: Trie rz//rr/) rstripr0encodedecoder"r4r1lstrip)rfprrrlines rrz!PublicSuffixList._build_structures*syy >D:: r,c|r |dk(rd|| <|dvry|d}|t|krX|rUd|| fD]I}|j|d}||s|dk7s |dvr|} n|d} | || <|j||dz|||Kyyy)al Traverses the Trie recursively to find the parts. By default, the traverse follows wildcards, as appropriate for the public suffix list, but if wildcard is set to False, it will stop at wildcard leaves. This can be useful for summarizing complex wildcard domains like those under amazonaws.com. The lookup is tracked via a list, initially set to all None, that marks the negation flags of nodes it matches. each match will be marked for later composition of the eTLD. :param matches: list, parts long, None (initial), 0, or 1 :param depth: int, how far in the Trie this run is :param parent: Tuple, the current subTrie :param parts: list of domain parts, strings :param wildcard: boolean, whether to process wildcard nodes :return: None, recursive call rrrrN*)r!r$ _lookup_node) rmatchesdepthr&r'wildcardr)namer*r3s rrHzPublicSuffixList._lookup_nodes&   GUFO V  !9 CJ 8eUFm, V T40$43; F?%*F%*1XF*0))'519eUHU V$, r,c|sy|j||d}|r|y|jjdjd}|dn|j ddz}t ||kr|Sdj ||dz dS)a Return the second-level-domain (SLD) or private suffix of a given domain according to the public suffix list. The public suffix list includes wildcards, so if wildcard is set to True, this will follow the wildcard on traversal, otherwise it will stop at wildcard nodes. The logic does not check by default whether the TLD is in the Trie, so for example, 'www.this.local' will return 'this.local'. If you want to ensure the TLD is in the public suffix list, use strict=True. If domain is already an eTLD, it returns domain as-is instead of None value. :param domain: string, needs to match the encoding of the PSL (idna or UTF8) :param wildcard: boolean, follow wildcard patterns :param strict: boolean, check the TLD is valid, return None if not :return: string, the SLD for the domain NTr/rr)get_tldlowerr?r1countr!join)rdomainrKstricttldr'num_of_tld_partss rget_sldzPublicSuffixList.get_slds&ll68T2 ck $$S)//4 # 13!1C u:) )J88E$4q$8"9":;<   +GAtDAIxxab ** +r,)NT)TF) __name__ __module__ __qualname__rr%r4rrrHrVrXrNr,rr r ?s6)@"2H1& U#J'VR!=F6 +r,r c\txs t||atj|||S)a Return the private suffix or SLD for a `domain` DNS name string. The original publicsuffix2 library used the method get_public_suffix() for this purpose, but get_private_suffix() is more proper. Convenience function that builds and caches a PublicSuffixList object. Optionally read, and parse a public suffix list. `psl_file` is either a file location string, or a file-like object, or an iterable of lines from a public suffix data file. If psl_file is None, the vendored file named "public_suffix_list.dat" is loaded. It is stored side by side with this Python package. The file format is described at http://publicsuffix.org/ rrKrS)_PSLr rVrRrrKrrSs rrVrV?s+"  8#H48D <<&< AAr,c\txs t||atj|||S)aU Return the TLD or public suffix for a `domain` DNS name string. (this is actually the private suffix that is returned) Convenience function that builds and caches a PublicSuffixList object. Optionally read, and parse a public suffix list. `psl_file` is either a file location string, or a file-like object, or an iterable of lines from a public suffix data file. If psl_file is None, the vendored file named "public_suffix_list.dat" is loaded. It is stored side by side with this Python package. The file format is described at http://publicsuffix.org/ rerf)rgr rNrhs rrNrNTs+  8#H48D <<&< AAr,cTtjdtt|||||S)a Included for compatibility with the original publicsuffix2 library -- this function returns the private suffix or SLD of the domain. To get the public suffix, use get_tld(). Convenience function that builds and caches a PublicSuffixList object. Optionally read, and parse a public suffix list. `psl_file` is either a file location string, or a file-like object, or an iterable of lines from a public suffix data file. If psl_file is None, the vendored file named "public_suffix_list.dat" is loaded. It is stored side by side with this Python package. The file format is described at http://publicsuffix.org/ zThis function returns the private suffix, SLD, or registrable domain. This equivalent to function get_sld(). To get the public suffix itself, use get_tld().)warningswarn UserWarningrVrhs rrXrXhs/  MM :   68XtV <=A>)NTTF)__doc__ __future__rrrosrrkurllib.requestrr ImportErrorurllib2rqdirname__file__BASE_DIRrQrABOUT_PSL_FILEobjectr rgrVrNrXryrcr,rrsL'' )/ A 4<< ! 499X7 88%?@z+vz+z B*B(=2  ] )(()sA== B  B