repo_id
stringlengths
32
150
file_path
stringlengths
46
183
content
stringlengths
1
290k
__index_level_0__
int64
0
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/ply/ctokens.py
# ---------------------------------------------------------------------- # ctokens.py # # Token specifications for symbols in ANSI C and C++. This file is # meant to be used as a library in other tokenizers. # ---------------------------------------------------------------------- # Reserved words tokens = [ # Literals (identifier, integer constant, float constant, string constant, char const) 'ID', 'TYPEID', 'INTEGER', 'FLOAT', 'STRING', 'CHARACTER', # Operators (+,-,*,/,%,|,&,~,^,<<,>>, ||, &&, !, <, <=, >, >=, ==, !=) 'PLUS', 'MINUS', 'TIMES', 'DIVIDE', 'MODULO', 'OR', 'AND', 'NOT', 'XOR', 'LSHIFT', 'RSHIFT', 'LOR', 'LAND', 'LNOT', 'LT', 'LE', 'GT', 'GE', 'EQ', 'NE', # Assignment (=, *=, /=, %=, +=, -=, <<=, >>=, &=, ^=, |=) 'EQUALS', 'TIMESEQUAL', 'DIVEQUAL', 'MODEQUAL', 'PLUSEQUAL', 'MINUSEQUAL', 'LSHIFTEQUAL','RSHIFTEQUAL', 'ANDEQUAL', 'XOREQUAL', 'OREQUAL', # Increment/decrement (++,--) 'INCREMENT', 'DECREMENT', # Structure dereference (->) 'ARROW', # Ternary operator (?) 'TERNARY', # Delimeters ( ) [ ] { } , . ; : 'LPAREN', 'RPAREN', 'LBRACKET', 'RBRACKET', 'LBRACE', 'RBRACE', 'COMMA', 'PERIOD', 'SEMI', 'COLON', # Ellipsis (...) 'ELLIPSIS', ] # Operators t_PLUS = r'\+' t_MINUS = r'-' t_TIMES = r'\*' t_DIVIDE = r'/' t_MODULO = r'%' t_OR = r'\|' t_AND = r'&' t_NOT = r'~' t_XOR = r'\^' t_LSHIFT = r'<<' t_RSHIFT = r'>>' t_LOR = r'\|\|' t_LAND = r'&&' t_LNOT = r'!' t_LT = r'<' t_GT = r'>' t_LE = r'<=' t_GE = r'>=' t_EQ = r'==' t_NE = r'!=' # Assignment operators t_EQUALS = r'=' t_TIMESEQUAL = r'\*=' t_DIVEQUAL = r'/=' t_MODEQUAL = r'%=' t_PLUSEQUAL = r'\+=' t_MINUSEQUAL = r'-=' t_LSHIFTEQUAL = r'<<=' t_RSHIFTEQUAL = r'>>=' t_ANDEQUAL = r'&=' t_OREQUAL = r'\|=' t_XOREQUAL = r'\^=' # Increment/decrement t_INCREMENT = r'\+\+' t_DECREMENT = r'--' # -> t_ARROW = r'->' # ? t_TERNARY = r'\?' # Delimeters t_LPAREN = r'\(' t_RPAREN = r'\)' t_LBRACKET = r'\[' t_RBRACKET = r'\]' t_LBRACE = r'\{' t_RBRACE = r'\}' t_COMMA = r',' t_PERIOD = r'\.' t_SEMI = r';' t_COLON = r':' t_ELLIPSIS = r'\.\.\.' # Identifiers t_ID = r'[A-Za-z_][A-Za-z0-9_]*' # Integer literal t_INTEGER = r'\d+([uU]|[lL]|[uU][lL]|[lL][uU])?' # Floating literal t_FLOAT = r'((\d+)(\.\d+)(e(\+|-)?(\d+))? | (\d+)e(\+|-)?(\d+))([lL]|[fF])?' # String literal t_STRING = r'\"([^\\\n]|(\\.))*?\"' # Character constant 'c' or L'c' t_CHARACTER = r'(L)?\'([^\\\n]|(\\.))*?\'' # Comment (C-Style) def t_COMMENT(t): r'/\*(.|\n)*?\*/' t.lexer.lineno += t.value.count('\n') return t # Comment (C++-Style) def t_CPPCOMMENT(t): r'//.*\n' t.lexer.lineno += 1 return t
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/ply/__init__.py
# PLY package # Author: David Beazley (dave@dabeaz.com) __version__ = '3.11' __all__ = ['lex','yacc']
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/ply/cpp.py
# ----------------------------------------------------------------------------- # cpp.py # # Author: David Beazley (http://www.dabeaz.com) # Copyright (C) 2007 # All rights reserved # # This module implements an ANSI-C style lexical preprocessor for PLY. # ----------------------------------------------------------------------------- from __future__ import generators import sys # Some Python 3 compatibility shims if sys.version_info.major < 3: STRING_TYPES = (str, unicode) else: STRING_TYPES = str xrange = range # ----------------------------------------------------------------------------- # Default preprocessor lexer definitions. These tokens are enough to get # a basic preprocessor working. Other modules may import these if they want # ----------------------------------------------------------------------------- tokens = ( 'CPP_ID','CPP_INTEGER', 'CPP_FLOAT', 'CPP_STRING', 'CPP_CHAR', 'CPP_WS', 'CPP_COMMENT1', 'CPP_COMMENT2', 'CPP_POUND','CPP_DPOUND' ) literals = "+-*/%|&~^<>=!?()[]{}.,;:\\\'\"" # Whitespace def t_CPP_WS(t): r'\s+' t.lexer.lineno += t.value.count("\n") return t t_CPP_POUND = r'\#' t_CPP_DPOUND = r'\#\#' # Identifier t_CPP_ID = r'[A-Za-z_][\w_]*' # Integer literal def CPP_INTEGER(t): r'(((((0x)|(0X))[0-9a-fA-F]+)|(\d+))([uU][lL]|[lL][uU]|[uU]|[lL])?)' return t t_CPP_INTEGER = CPP_INTEGER # Floating literal t_CPP_FLOAT = r'((\d+)(\.\d+)(e(\+|-)?(\d+))? | (\d+)e(\+|-)?(\d+))([lL]|[fF])?' # String literal def t_CPP_STRING(t): r'\"([^\\\n]|(\\(.|\n)))*?\"' t.lexer.lineno += t.value.count("\n") return t # Character constant 'c' or L'c' def t_CPP_CHAR(t): r'(L)?\'([^\\\n]|(\\(.|\n)))*?\'' t.lexer.lineno += t.value.count("\n") return t # Comment def t_CPP_COMMENT1(t): r'(/\*(.|\n)*?\*/)' ncr = t.value.count("\n") t.lexer.lineno += ncr # replace with one space or a number of '\n' t.type = 'CPP_WS'; t.value = '\n' * ncr if ncr else ' ' return t # Line comment def t_CPP_COMMENT2(t): r'(//.*?(\n|$))' # replace with '/n' t.type = 'CPP_WS'; t.value = '\n' return t def t_error(t): t.type = t.value[0] t.value = t.value[0] t.lexer.skip(1) return t import re import copy import time import os.path # ----------------------------------------------------------------------------- # trigraph() # # Given an input string, this function replaces all trigraph sequences. # The following mapping is used: # # ??= # # ??/ \ # ??' ^ # ??( [ # ??) ] # ??! | # ??< { # ??> } # ??- ~ # ----------------------------------------------------------------------------- _trigraph_pat = re.compile(r'''\?\?[=/\'\(\)\!<>\-]''') _trigraph_rep = { '=':'#', '/':'\\', "'":'^', '(':'[', ')':']', '!':'|', '<':'{', '>':'}', '-':'~' } def trigraph(input): return _trigraph_pat.sub(lambda g: _trigraph_rep[g.group()[-1]],input) # ------------------------------------------------------------------ # Macro object # # This object holds information about preprocessor macros # # .name - Macro name (string) # .value - Macro value (a list of tokens) # .arglist - List of argument names # .variadic - Boolean indicating whether or not variadic macro # .vararg - Name of the variadic parameter # # When a macro is created, the macro replacement token sequence is # pre-scanned and used to create patch lists that are later used # during macro expansion # ------------------------------------------------------------------ class Macro(object): def __init__(self,name,value,arglist=None,variadic=False): self.name = name self.value = value self.arglist = arglist self.variadic = variadic if variadic: self.vararg = arglist[-1] self.source = None # ------------------------------------------------------------------ # Preprocessor object # # Object representing a preprocessor. Contains macro definitions, # include directories, and other information # ------------------------------------------------------------------ class Preprocessor(object): def __init__(self,lexer=None): if lexer is None: lexer = lex.lexer self.lexer = lexer self.macros = { } self.path = [] self.temp_path = [] # Probe the lexer for selected tokens self.lexprobe() tm = time.localtime() self.define("__DATE__ \"%s\"" % time.strftime("%b %d %Y",tm)) self.define("__TIME__ \"%s\"" % time.strftime("%H:%M:%S",tm)) self.parser = None # ----------------------------------------------------------------------------- # tokenize() # # Utility function. Given a string of text, tokenize into a list of tokens # ----------------------------------------------------------------------------- def tokenize(self,text): tokens = [] self.lexer.input(text) while True: tok = self.lexer.token() if not tok: break tokens.append(tok) return tokens # --------------------------------------------------------------------- # error() # # Report a preprocessor error/warning of some kind # ---------------------------------------------------------------------- def error(self,file,line,msg): print("%s:%d %s" % (file,line,msg)) # ---------------------------------------------------------------------- # lexprobe() # # This method probes the preprocessor lexer object to discover # the token types of symbols that are important to the preprocessor. # If this works right, the preprocessor will simply "work" # with any suitable lexer regardless of how tokens have been named. # ---------------------------------------------------------------------- def lexprobe(self): # Determine the token type for identifiers self.lexer.input("identifier") tok = self.lexer.token() if not tok or tok.value != "identifier": print("Couldn't determine identifier type") else: self.t_ID = tok.type # Determine the token type for integers self.lexer.input("12345") tok = self.lexer.token() if not tok or int(tok.value) != 12345: print("Couldn't determine integer type") else: self.t_INTEGER = tok.type self.t_INTEGER_TYPE = type(tok.value) # Determine the token type for strings enclosed in double quotes self.lexer.input("\"filename\"") tok = self.lexer.token() if not tok or tok.value != "\"filename\"": print("Couldn't determine string type") else: self.t_STRING = tok.type # Determine the token type for whitespace--if any self.lexer.input(" ") tok = self.lexer.token() if not tok or tok.value != " ": self.t_SPACE = None else: self.t_SPACE = tok.type # Determine the token type for newlines self.lexer.input("\n") tok = self.lexer.token() if not tok or tok.value != "\n": self.t_NEWLINE = None print("Couldn't determine token for newlines") else: self.t_NEWLINE = tok.type self.t_WS = (self.t_SPACE, self.t_NEWLINE) # Check for other characters used by the preprocessor chars = [ '<','>','#','##','\\','(',')',',','.'] for c in chars: self.lexer.input(c) tok = self.lexer.token() if not tok or tok.value != c: print("Unable to lex '%s' required for preprocessor" % c) # ---------------------------------------------------------------------- # add_path() # # Adds a search path to the preprocessor. # ---------------------------------------------------------------------- def add_path(self,path): self.path.append(path) # ---------------------------------------------------------------------- # group_lines() # # Given an input string, this function splits it into lines. Trailing whitespace # is removed. Any line ending with \ is grouped with the next line. This # function forms the lowest level of the preprocessor---grouping into text into # a line-by-line format. # ---------------------------------------------------------------------- def group_lines(self,input): lex = self.lexer.clone() lines = [x.rstrip() for x in input.splitlines()] for i in xrange(len(lines)): j = i+1 while lines[i].endswith('\\') and (j < len(lines)): lines[i] = lines[i][:-1]+lines[j] lines[j] = "" j += 1 input = "\n".join(lines) lex.input(input) lex.lineno = 1 current_line = [] while True: tok = lex.token() if not tok: break current_line.append(tok) if tok.type in self.t_WS and '\n' in tok.value: yield current_line current_line = [] if current_line: yield current_line # ---------------------------------------------------------------------- # tokenstrip() # # Remove leading/trailing whitespace tokens from a token list # ---------------------------------------------------------------------- def tokenstrip(self,tokens): i = 0 while i < len(tokens) and tokens[i].type in self.t_WS: i += 1 del tokens[:i] i = len(tokens)-1 while i >= 0 and tokens[i].type in self.t_WS: i -= 1 del tokens[i+1:] return tokens # ---------------------------------------------------------------------- # collect_args() # # Collects comma separated arguments from a list of tokens. The arguments # must be enclosed in parenthesis. Returns a tuple (tokencount,args,positions) # where tokencount is the number of tokens consumed, args is a list of arguments, # and positions is a list of integers containing the starting index of each # argument. Each argument is represented by a list of tokens. # # When collecting arguments, leading and trailing whitespace is removed # from each argument. # # This function properly handles nested parenthesis and commas---these do not # define new arguments. # ---------------------------------------------------------------------- def collect_args(self,tokenlist): args = [] positions = [] current_arg = [] nesting = 1 tokenlen = len(tokenlist) # Search for the opening '('. i = 0 while (i < tokenlen) and (tokenlist[i].type in self.t_WS): i += 1 if (i < tokenlen) and (tokenlist[i].value == '('): positions.append(i+1) else: self.error(self.source,tokenlist[0].lineno,"Missing '(' in macro arguments") return 0, [], [] i += 1 while i < tokenlen: t = tokenlist[i] if t.value == '(': current_arg.append(t) nesting += 1 elif t.value == ')': nesting -= 1 if nesting == 0: if current_arg: args.append(self.tokenstrip(current_arg)) positions.append(i) return i+1,args,positions current_arg.append(t) elif t.value == ',' and nesting == 1: args.append(self.tokenstrip(current_arg)) positions.append(i+1) current_arg = [] else: current_arg.append(t) i += 1 # Missing end argument self.error(self.source,tokenlist[-1].lineno,"Missing ')' in macro arguments") return 0, [],[] # ---------------------------------------------------------------------- # macro_prescan() # # Examine the macro value (token sequence) and identify patch points # This is used to speed up macro expansion later on---we'll know # right away where to apply patches to the value to form the expansion # ---------------------------------------------------------------------- def macro_prescan(self,macro): macro.patch = [] # Standard macro arguments macro.str_patch = [] # String conversion expansion macro.var_comma_patch = [] # Variadic macro comma patch i = 0 while i < len(macro.value): if macro.value[i].type == self.t_ID and macro.value[i].value in macro.arglist: argnum = macro.arglist.index(macro.value[i].value) # Conversion of argument to a string if i > 0 and macro.value[i-1].value == '#': macro.value[i] = copy.copy(macro.value[i]) macro.value[i].type = self.t_STRING del macro.value[i-1] macro.str_patch.append((argnum,i-1)) continue # Concatenation elif (i > 0 and macro.value[i-1].value == '##'): macro.patch.append(('c',argnum,i-1)) del macro.value[i-1] i -= 1 continue elif ((i+1) < len(macro.value) and macro.value[i+1].value == '##'): macro.patch.append(('c',argnum,i)) del macro.value[i + 1] continue # Standard expansion else: macro.patch.append(('e',argnum,i)) elif macro.value[i].value == '##': if macro.variadic and (i > 0) and (macro.value[i-1].value == ',') and \ ((i+1) < len(macro.value)) and (macro.value[i+1].type == self.t_ID) and \ (macro.value[i+1].value == macro.vararg): macro.var_comma_patch.append(i-1) i += 1 macro.patch.sort(key=lambda x: x[2],reverse=True) # ---------------------------------------------------------------------- # macro_expand_args() # # Given a Macro and list of arguments (each a token list), this method # returns an expanded version of a macro. The return value is a token sequence # representing the replacement macro tokens # ---------------------------------------------------------------------- def macro_expand_args(self,macro,args): # Make a copy of the macro token sequence rep = [copy.copy(_x) for _x in macro.value] # Make string expansion patches. These do not alter the length of the replacement sequence str_expansion = {} for argnum, i in macro.str_patch: if argnum not in str_expansion: str_expansion[argnum] = ('"%s"' % "".join([x.value for x in args[argnum]])).replace("\\","\\\\") rep[i] = copy.copy(rep[i]) rep[i].value = str_expansion[argnum] # Make the variadic macro comma patch. If the variadic macro argument is empty, we get rid comma_patch = False if macro.variadic and not args[-1]: for i in macro.var_comma_patch: rep[i] = None comma_patch = True # Make all other patches. The order of these matters. It is assumed that the patch list # has been sorted in reverse order of patch location since replacements will cause the # size of the replacement sequence to expand from the patch point. expanded = { } for ptype, argnum, i in macro.patch: # Concatenation. Argument is left unexpanded if ptype == 'c': rep[i:i+1] = args[argnum] # Normal expansion. Argument is macro expanded first elif ptype == 'e': if argnum not in expanded: expanded[argnum] = self.expand_macros(args[argnum]) rep[i:i+1] = expanded[argnum] # Get rid of removed comma if necessary if comma_patch: rep = [_i for _i in rep if _i] return rep # ---------------------------------------------------------------------- # expand_macros() # # Given a list of tokens, this function performs macro expansion. # The expanded argument is a dictionary that contains macros already # expanded. This is used to prevent infinite recursion. # ---------------------------------------------------------------------- def expand_macros(self,tokens,expanded=None): if expanded is None: expanded = {} i = 0 while i < len(tokens): t = tokens[i] if t.type == self.t_ID: if t.value in self.macros and t.value not in expanded: # Yes, we found a macro match expanded[t.value] = True m = self.macros[t.value] if not m.arglist: # A simple macro ex = self.expand_macros([copy.copy(_x) for _x in m.value],expanded) for e in ex: e.lineno = t.lineno tokens[i:i+1] = ex i += len(ex) else: # A macro with arguments j = i + 1 while j < len(tokens) and tokens[j].type in self.t_WS: j += 1 if j < len(tokens) and tokens[j].value == '(': tokcount,args,positions = self.collect_args(tokens[j:]) if not m.variadic and len(args) != len(m.arglist): self.error(self.source,t.lineno,"Macro %s requires %d arguments" % (t.value,len(m.arglist))) i = j + tokcount elif m.variadic and len(args) < len(m.arglist)-1: if len(m.arglist) > 2: self.error(self.source,t.lineno,"Macro %s must have at least %d arguments" % (t.value, len(m.arglist)-1)) else: self.error(self.source,t.lineno,"Macro %s must have at least %d argument" % (t.value, len(m.arglist)-1)) i = j + tokcount else: if m.variadic: if len(args) == len(m.arglist)-1: args.append([]) else: args[len(m.arglist)-1] = tokens[j+positions[len(m.arglist)-1]:j+tokcount-1] del args[len(m.arglist):] # Get macro replacement text rep = self.macro_expand_args(m,args) rep = self.expand_macros(rep,expanded) for r in rep: r.lineno = t.lineno tokens[i:j+tokcount] = rep i += len(rep) else: # This is not a macro. It is just a word which # equals to name of the macro. Hence, go to the # next token. i += 1 del expanded[t.value] continue elif t.value == '__LINE__': t.type = self.t_INTEGER t.value = self.t_INTEGER_TYPE(t.lineno) i += 1 return tokens # ---------------------------------------------------------------------- # evalexpr() # # Evaluate an expression token sequence for the purposes of evaluating # integral expressions. # ---------------------------------------------------------------------- def evalexpr(self,tokens): # tokens = tokenize(line) # Search for defined macros i = 0 while i < len(tokens): if tokens[i].type == self.t_ID and tokens[i].value == 'defined': j = i + 1 needparen = False result = "0L" while j < len(tokens): if tokens[j].type in self.t_WS: j += 1 continue elif tokens[j].type == self.t_ID: if tokens[j].value in self.macros: result = "1L" else: result = "0L" if not needparen: break elif tokens[j].value == '(': needparen = True elif tokens[j].value == ')': break else: self.error(self.source,tokens[i].lineno,"Malformed defined()") j += 1 tokens[i].type = self.t_INTEGER tokens[i].value = self.t_INTEGER_TYPE(result) del tokens[i+1:j+1] i += 1 tokens = self.expand_macros(tokens) for i,t in enumerate(tokens): if t.type == self.t_ID: tokens[i] = copy.copy(t) tokens[i].type = self.t_INTEGER tokens[i].value = self.t_INTEGER_TYPE("0L") elif t.type == self.t_INTEGER: tokens[i] = copy.copy(t) # Strip off any trailing suffixes tokens[i].value = str(tokens[i].value) while tokens[i].value[-1] not in "0123456789abcdefABCDEF": tokens[i].value = tokens[i].value[:-1] expr = "".join([str(x.value) for x in tokens]) expr = expr.replace("&&"," and ") expr = expr.replace("||"," or ") expr = expr.replace("!"," not ") try: result = eval(expr) except Exception: self.error(self.source,tokens[0].lineno,"Couldn't evaluate expression") result = 0 return result # ---------------------------------------------------------------------- # parsegen() # # Parse an input string/ # ---------------------------------------------------------------------- def parsegen(self,input,source=None): # Replace trigraph sequences t = trigraph(input) lines = self.group_lines(t) if not source: source = "" self.define("__FILE__ \"%s\"" % source) self.source = source chunk = [] enable = True iftrigger = False ifstack = [] for x in lines: for i,tok in enumerate(x): if tok.type not in self.t_WS: break if tok.value == '#': # Preprocessor directive # insert necessary whitespace instead of eaten tokens for tok in x: if tok.type in self.t_WS and '\n' in tok.value: chunk.append(tok) dirtokens = self.tokenstrip(x[i+1:]) if dirtokens: name = dirtokens[0].value args = self.tokenstrip(dirtokens[1:]) else: name = "" args = [] if name == 'define': if enable: for tok in self.expand_macros(chunk): yield tok chunk = [] self.define(args) elif name == 'include': if enable: for tok in self.expand_macros(chunk): yield tok chunk = [] oldfile = self.macros['__FILE__'] for tok in self.include(args): yield tok self.macros['__FILE__'] = oldfile self.source = source elif name == 'undef': if enable: for tok in self.expand_macros(chunk): yield tok chunk = [] self.undef(args) elif name == 'ifdef': ifstack.append((enable,iftrigger)) if enable: if not args[0].value in self.macros: enable = False iftrigger = False else: iftrigger = True elif name == 'ifndef': ifstack.append((enable,iftrigger)) if enable: if args[0].value in self.macros: enable = False iftrigger = False else: iftrigger = True elif name == 'if': ifstack.append((enable,iftrigger)) if enable: result = self.evalexpr(args) if not result: enable = False iftrigger = False else: iftrigger = True elif name == 'elif': if ifstack: if ifstack[-1][0]: # We only pay attention if outer "if" allows this if enable: # If already true, we flip enable False enable = False elif not iftrigger: # If False, but not triggered yet, we'll check expression result = self.evalexpr(args) if result: enable = True iftrigger = True else: self.error(self.source,dirtokens[0].lineno,"Misplaced #elif") elif name == 'else': if ifstack: if ifstack[-1][0]: if enable: enable = False elif not iftrigger: enable = True iftrigger = True else: self.error(self.source,dirtokens[0].lineno,"Misplaced #else") elif name == 'endif': if ifstack: enable,iftrigger = ifstack.pop() else: self.error(self.source,dirtokens[0].lineno,"Misplaced #endif") else: # Unknown preprocessor directive pass else: # Normal text if enable: chunk.extend(x) for tok in self.expand_macros(chunk): yield tok chunk = [] # ---------------------------------------------------------------------- # include() # # Implementation of file-inclusion # ---------------------------------------------------------------------- def include(self,tokens): # Try to extract the filename and then process an include file if not tokens: return if tokens: if tokens[0].value != '<' and tokens[0].type != self.t_STRING: tokens = self.expand_macros(tokens) if tokens[0].value == '<': # Include <...> i = 1 while i < len(tokens): if tokens[i].value == '>': break i += 1 else: print("Malformed #include <...>") return filename = "".join([x.value for x in tokens[1:i]]) path = self.path + [""] + self.temp_path elif tokens[0].type == self.t_STRING: filename = tokens[0].value[1:-1] path = self.temp_path + [""] + self.path else: print("Malformed #include statement") return for p in path: iname = os.path.join(p,filename) try: data = open(iname,"r").read() dname = os.path.dirname(iname) if dname: self.temp_path.insert(0,dname) for tok in self.parsegen(data,filename): yield tok if dname: del self.temp_path[0] break except IOError: pass else: print("Couldn't find '%s'" % filename) # ---------------------------------------------------------------------- # define() # # Define a new macro # ---------------------------------------------------------------------- def define(self,tokens): if isinstance(tokens,STRING_TYPES): tokens = self.tokenize(tokens) linetok = tokens try: name = linetok[0] if len(linetok) > 1: mtype = linetok[1] else: mtype = None if not mtype: m = Macro(name.value,[]) self.macros[name.value] = m elif mtype.type in self.t_WS: # A normal macro m = Macro(name.value,self.tokenstrip(linetok[2:])) self.macros[name.value] = m elif mtype.value == '(': # A macro with arguments tokcount, args, positions = self.collect_args(linetok[1:]) variadic = False for a in args: if variadic: print("No more arguments may follow a variadic argument") break astr = "".join([str(_i.value) for _i in a]) if astr == "...": variadic = True a[0].type = self.t_ID a[0].value = '__VA_ARGS__' variadic = True del a[1:] continue elif astr[-3:] == "..." and a[0].type == self.t_ID: variadic = True del a[1:] # If, for some reason, "." is part of the identifier, strip off the name for the purposes # of macro expansion if a[0].value[-3:] == '...': a[0].value = a[0].value[:-3] continue if len(a) > 1 or a[0].type != self.t_ID: print("Invalid macro argument") break else: mvalue = self.tokenstrip(linetok[1+tokcount:]) i = 0 while i < len(mvalue): if i+1 < len(mvalue): if mvalue[i].type in self.t_WS and mvalue[i+1].value == '##': del mvalue[i] continue elif mvalue[i].value == '##' and mvalue[i+1].type in self.t_WS: del mvalue[i+1] i += 1 m = Macro(name.value,mvalue,[x[0].value for x in args],variadic) self.macro_prescan(m) self.macros[name.value] = m else: print("Bad macro definition") except LookupError: print("Bad macro definition") # ---------------------------------------------------------------------- # undef() # # Undefine a macro # ---------------------------------------------------------------------- def undef(self,tokens): id = tokens[0].value try: del self.macros[id] except LookupError: pass # ---------------------------------------------------------------------- # parse() # # Parse input text. # ---------------------------------------------------------------------- def parse(self,input,source=None,ignore={}): self.ignore = ignore self.parser = self.parsegen(input,source) # ---------------------------------------------------------------------- # token() # # Method to return individual tokens # ---------------------------------------------------------------------- def token(self): try: while True: tok = next(self.parser) if tok.type not in self.ignore: return tok except StopIteration: self.parser = None return None if __name__ == '__main__': import ply.lex as lex lexer = lex.lex() # Run a preprocessor import sys f = open(sys.argv[1]) input = f.read() p = Preprocessor(lexer) p.parse(input,sys.argv[1]) while True: tok = p.token() if not tok: break print(p.source, tok)
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/ply/ygen.py
# ply: ygen.py # # This is a support program that auto-generates different versions of the YACC parsing # function with different features removed for the purposes of performance. # # Users should edit the method LRParser.parsedebug() in yacc.py. The source code # for that method is then used to create the other methods. See the comments in # yacc.py for further details. import os.path import shutil def get_source_range(lines, tag): srclines = enumerate(lines) start_tag = '#--! %s-start' % tag end_tag = '#--! %s-end' % tag for start_index, line in srclines: if line.strip().startswith(start_tag): break for end_index, line in srclines: if line.strip().endswith(end_tag): break return (start_index + 1, end_index) def filter_section(lines, tag): filtered_lines = [] include = True tag_text = '#--! %s' % tag for line in lines: if line.strip().startswith(tag_text): include = not include elif include: filtered_lines.append(line) return filtered_lines def main(): dirname = os.path.dirname(__file__) shutil.copy2(os.path.join(dirname, 'yacc.py'), os.path.join(dirname, 'yacc.py.bak')) with open(os.path.join(dirname, 'yacc.py'), 'r') as f: lines = f.readlines() parse_start, parse_end = get_source_range(lines, 'parsedebug') parseopt_start, parseopt_end = get_source_range(lines, 'parseopt') parseopt_notrack_start, parseopt_notrack_end = get_source_range(lines, 'parseopt-notrack') # Get the original source orig_lines = lines[parse_start:parse_end] # Filter the DEBUG sections out parseopt_lines = filter_section(orig_lines, 'DEBUG') # Filter the TRACKING sections out parseopt_notrack_lines = filter_section(parseopt_lines, 'TRACKING') # Replace the parser source sections with updated versions lines[parseopt_notrack_start:parseopt_notrack_end] = parseopt_notrack_lines lines[parseopt_start:parseopt_end] = parseopt_lines lines = [line.rstrip()+'\n' for line in lines] with open(os.path.join(dirname, 'yacc.py'), 'w') as f: f.writelines(lines) print('Updated yacc.py') if __name__ == '__main__': main()
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/pendulum-2.1.2.dist-info/RECORD
pendulum-2.1.2.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4 pendulum-2.1.2.dist-info/LICENSE,sha256=Jhgfk_52I_W_PhHK7XPsx_u0meJZ9TQzARchMPboFR0,1082 pendulum-2.1.2.dist-info/METADATA,sha256=72VrnefUlPuIcJth2_vK3kzXjUVWela6UHfxu5rHGdQ,8610 pendulum-2.1.2.dist-info/RECORD,, pendulum-2.1.2.dist-info/WHEEL,sha256=Quy-h7LlA-QSvIgEDSn4-6LiURVlz378SsjQaCb51dg,106 pendulum/__init__.py,sha256=I9yZ1ahXqHSNgtnZMJH3d1c0F_DXotVGrTotbIElY10,8597 pendulum/__pycache__/__init__.cpython-311.pyc,, pendulum/__pycache__/__version__.cpython-311.pyc,, pendulum/__pycache__/constants.cpython-311.pyc,, pendulum/__pycache__/date.cpython-311.pyc,, pendulum/__pycache__/datetime.cpython-311.pyc,, pendulum/__pycache__/duration.cpython-311.pyc,, pendulum/__pycache__/exceptions.cpython-311.pyc,, pendulum/__pycache__/helpers.cpython-311.pyc,, pendulum/__pycache__/parser.cpython-311.pyc,, pendulum/__pycache__/period.cpython-311.pyc,, pendulum/__pycache__/time.cpython-311.pyc,, pendulum/__version__.py,sha256=ByWE4qw8r36fv4OeLSjIm5p0j96GhZ__fEvMV0EfSWA,23 pendulum/_extensions/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/_extensions/__pycache__/__init__.cpython-311.pyc,, pendulum/_extensions/__pycache__/helpers.cpython-311.pyc,, pendulum/_extensions/_helpers.c,sha256=7bRT-aSD4i3JXFSYFn5l61bMGWBcvSaN9zfhjEh6rto,25967 pendulum/_extensions/_helpers.cpython-311-darwin.so,sha256=oGAC4l5tAmxwaJdALlRBsysDcWmAM9L4VWmePgdFSlw,54464 pendulum/_extensions/helpers.py,sha256=j35ZG0wS5BMCx7JURA8PHZo4OAyNJAjriWXN-kZHc20,9628 pendulum/constants.py,sha256=dC8X7rpmZtAZdHLBavg7aJH-SaNxFpuRTnvldnIbtpQ,2921 pendulum/date.py,sha256=T95mBE0nEzLHG6fYWyUU13bnp4fne7J1NcaYxmaAFdo,25553 pendulum/datetime.py,sha256=ozcljD8A9ZHZNgqGItXXkzYy1Lv8PIzLBFLkbgUZiwA,44014 pendulum/duration.py,sha256=VpS69PUfHxGxKxdwcUmR6MJaiMEWk5TfDArfAsxebMo,13111 pendulum/exceptions.py,sha256=lj-GpJsrpl-exkmV86Wr0lobPkEo6zAIf5twV7RXBBc,106 pendulum/formatting/__init__.py,sha256=U7cXnts7Cvugr2AaECCYFAAhyV4MfMtglNvjMkRGRPY,63 pendulum/formatting/__pycache__/__init__.cpython-311.pyc,, pendulum/formatting/__pycache__/difference_formatter.cpython-311.pyc,, pendulum/formatting/__pycache__/formatter.cpython-311.pyc,, pendulum/formatting/difference_formatter.py,sha256=Q9T7m1BF0WT8AHDQXajvvGAZ9sCGKyy5SE6RXN9ye38,4545 pendulum/formatting/formatter.py,sha256=-xJkF2o9LyMgbAPWrFsMSaHV6mY3WxcxaELOupoCF_0,22604 pendulum/helpers.py,sha256=mdcQhQMxICpXQOtGyVX87LFz_my8fVXVzt7Dz0cWbJM,5505 pendulum/locales/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/locales/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/__pycache__/locale.cpython-311.pyc,, pendulum/locales/da/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/locales/da/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/da/__pycache__/custom.cpython-311.pyc,, pendulum/locales/da/__pycache__/locale.cpython-311.pyc,, pendulum/locales/da/custom.py,sha256=UBThGUwvsM3NFkkARfxagdc3TOG02ENDrWepJcdSJxQ,451 pendulum/locales/da/locale.py,sha256=U_d0jLheiL5YVyzlxpK79kQgXDGZD1JR4lgtRBZ6R0U,4961 pendulum/locales/de/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/locales/de/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/de/__pycache__/custom.cpython-311.pyc,, pendulum/locales/de/__pycache__/locale.cpython-311.pyc,, pendulum/locales/de/custom.py,sha256=voSoKimREV6hw6_3iLY3QZ2iyzks8QQ8qCFKHCKT3jM,1137 pendulum/locales/de/locale.py,sha256=Tsqk4DGa1oOnphUS24zwE6-4EZMo0sqztye1sNwnLN4,4822 pendulum/locales/en/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/locales/en/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/en/__pycache__/custom.cpython-311.pyc,, pendulum/locales/en/__pycache__/locale.cpython-311.pyc,, pendulum/locales/en/custom.py,sha256=PW4F4dcPoKjEbfzHLQalW66WXDtaLSOIR7SjbyaZGk8,636 pendulum/locales/en/locale.py,sha256=wbq_f5YbuKrDKaRB32982W21FYJd7ix00LE1mInlFH8,5064 pendulum/locales/es/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/locales/es/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/es/__pycache__/custom.cpython-311.pyc,, pendulum/locales/es/__pycache__/locale.cpython-311.pyc,, pendulum/locales/es/custom.py,sha256=17h3Y5HqdxPPdqMheG7Hn29WrXvHs6HqGKlTO_sn1YM,628 pendulum/locales/es/locale.py,sha256=j6fmEM5uOivo1PKePKqgnjG7Dj2gIeuuKxEN79Ekals,4871 pendulum/locales/fa/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/locales/fa/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/fa/__pycache__/custom.cpython-311.pyc,, pendulum/locales/fa/__pycache__/locale.cpython-311.pyc,, pendulum/locales/fa/custom.py,sha256=yuU6s6evM1XFCXmuE4QjHW5RwiwltSy1xhRryF_XsUU,455 pendulum/locales/fa/locale.py,sha256=_-K24CSVZ2OtelErgDfeFHzvddAPYx5u2FC8KvWjACo,5112 pendulum/locales/fo/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/locales/fo/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/fo/__pycache__/custom.cpython-311.pyc,, pendulum/locales/fo/__pycache__/locale.cpython-311.pyc,, pendulum/locales/fo/custom.py,sha256=fMY9tEmLB07Bbp2MkwTcMW28a3koDsHfMHvb7NeCc4Q,499 pendulum/locales/fo/locale.py,sha256=UyxR9DM5Ak89BCMSQVl5zctTuQaQHGOqY_iYr_ARd2s,4555 pendulum/locales/fr/__init__.py,sha256=lVL4VPz3c4kWCgjPtL4uuQLNmgwK92q1ffAsv5El02k,25 pendulum/locales/fr/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/fr/__pycache__/custom.cpython-311.pyc,, pendulum/locales/fr/__pycache__/locale.cpython-311.pyc,, pendulum/locales/fr/custom.py,sha256=kAfAr-7FaLIocIrFZPUqZ7kfO833OCbJVF3ypzN5Oqg,612 pendulum/locales/fr/locale.py,sha256=nDdBuZ0EciY0dpKWDykp_v1y0PZWFL3U2sMg2gSZ3z4,4704 pendulum/locales/id/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/locales/id/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/id/__pycache__/custom.cpython-311.pyc,, pendulum/locales/id/__pycache__/locale.cpython-311.pyc,, pendulum/locales/id/custom.py,sha256=uChc_mPCfYxsM4tw0pQvif31YsExoDcTeva2cWjLu9g,523 pendulum/locales/id/locale.py,sha256=7Dqfxb5FIoi8UdSrlpUawo40TWAI5awzE3JRmj0xHHc,4184 pendulum/locales/it/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/locales/it/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/it/__pycache__/custom.cpython-311.pyc,, pendulum/locales/it/__pycache__/locale.cpython-311.pyc,, pendulum/locales/it/custom.py,sha256=nmCVmVTx0B6lknX4UblbsS-S8WJhhsob3kMgUZiYKp8,600 pendulum/locales/it/locale.py,sha256=pNRseajglYWnlddr7vAn-9C6Q3pu8u4c6-9t7ABRNqY,4861 pendulum/locales/ko/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/locales/ko/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/ko/__pycache__/custom.cpython-311.pyc,, pendulum/locales/ko/__pycache__/locale.cpython-311.pyc,, pendulum/locales/ko/custom.py,sha256=GdSQMb-qQ3aIkdoPpW9ff-iycDWSFmuJTMfrjJbiHcU,484 pendulum/locales/ko/locale.py,sha256=1SB49DRkj47OcA1ZMJE4xH3t_ASCIa-t2nK4sbbPmOI,3579 pendulum/locales/locale.py,sha256=ESQrnDsdyYsFvgyuX3lkJ6tKHG4IezQk-oe_x6ij3cQ,3131 pendulum/locales/lt/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/locales/lt/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/lt/__pycache__/custom.cpython-311.pyc,, pendulum/locales/lt/__pycache__/locale.cpython-311.pyc,, pendulum/locales/lt/custom.py,sha256=EipZptVq0ATZQzCgiGcrMEhvM06m8Fon-KSrcCKReAI,3574 pendulum/locales/lt/locale.py,sha256=AUBDrdCuQY7_ln4rowzlcU22xQ0EHMWqffc8jqQhG5Q,8469 pendulum/locales/nb/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/locales/nb/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/nb/__pycache__/custom.cpython-311.pyc,, pendulum/locales/nb/__pycache__/locale.cpython-311.pyc,, pendulum/locales/nb/custom.py,sha256=B2rQwzo6hVOf_YFhWEVx7Lr9k6WDzVKG9FG3XbDxOIE,530 pendulum/locales/nb/locale.py,sha256=XD0_QdZtGh1Oo0U6zh7hbFiQb5lFzwNpFfcjMXfdYAY,4986 pendulum/locales/nl/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/locales/nl/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/nl/__pycache__/custom.cpython-311.pyc,, pendulum/locales/nl/__pycache__/locale.cpython-311.pyc,, pendulum/locales/nl/custom.py,sha256=dJXiYSTCtIqBYWH74osacEWV3VeqRubIOGb5_XXTR6U,596 pendulum/locales/nl/locale.py,sha256=RPQm-GAF-W1xafjWREIqRTgnclq7qP9QBoXtCFvaNlQ,4666 pendulum/locales/nn/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/locales/nn/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/nn/__pycache__/custom.cpython-311.pyc,, pendulum/locales/nn/__pycache__/locale.cpython-311.pyc,, pendulum/locales/nn/custom.py,sha256=B2rQwzo6hVOf_YFhWEVx7Lr9k6WDzVKG9FG3XbDxOIE,530 pendulum/locales/nn/locale.py,sha256=NryH5sNUnpAdCJ01mST4OrGgpr6cLaRKu5Oi2W__aa0,4726 pendulum/locales/pl/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/locales/pl/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/pl/__pycache__/custom.cpython-311.pyc,, pendulum/locales/pl/__pycache__/locale.cpython-311.pyc,, pendulum/locales/pl/custom.py,sha256=8m_v2Ynv5xMq-EmJrTXdIQkTb3oltLwYhmqFvpOPHVc,537 pendulum/locales/pl/locale.py,sha256=8Q25uqfExrMEmob3Qx7NuAfW4dDSnj8zRx4ADZVs_2A,8891 pendulum/locales/pt_br/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/locales/pt_br/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/pt_br/__pycache__/custom.cpython-311.pyc,, pendulum/locales/pt_br/__pycache__/locale.cpython-311.pyc,, pendulum/locales/pt_br/custom.py,sha256=eWVXefOKashQzV4ypzGRpzWznD3R4RJvp73SFhPC5LA,491 pendulum/locales/pt_br/locale.py,sha256=GTotVS2NJkKJiq8aoYKFjP-BKY_7HS5jnxON0UKOhQQ,4792 pendulum/locales/ru/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/locales/ru/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/ru/__pycache__/custom.cpython-311.pyc,, pendulum/locales/ru/__pycache__/locale.cpython-311.pyc,, pendulum/locales/ru/custom.py,sha256=lbfr7fypGvYUemcGy7A6SEFTdeUZE9Ug9oOkUdWOoU8,526 pendulum/locales/ru/locale.py,sha256=iRrqMMfWMThae3opA4Mnaz-36TxBnQhnKSLZBsnGp_0,9685 pendulum/locales/zh/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/locales/zh/__pycache__/__init__.cpython-311.pyc,, pendulum/locales/zh/__pycache__/custom.cpython-311.pyc,, pendulum/locales/zh/__pycache__/locale.cpython-311.pyc,, pendulum/locales/zh/custom.py,sha256=Vmtm94Bqbn1vVgOq036Rl9DV__5D2uOnxyCD-XCFEo8,470 pendulum/locales/zh/locale.py,sha256=lD_WDMQyI7dfftcZJv4it7HjhFoEfOTUWVpqdY_GvzM,3751 pendulum/mixins/__init__.py,sha256=lVL4VPz3c4kWCgjPtL4uuQLNmgwK92q1ffAsv5El02k,25 pendulum/mixins/__pycache__/__init__.cpython-311.pyc,, pendulum/mixins/__pycache__/default.cpython-311.pyc,, pendulum/mixins/default.py,sha256=JcuObnFwaFvmnQKRjw90lJSFYM_wsjAZppt5_rDC0hs,945 pendulum/parser.py,sha256=-G-VT1vjGVzg1iEhp6_dcmi-SJ3RN6_x7oyatNzt6Bw,3593 pendulum/parsing/__init__.py,sha256=QqkgrQDXb6S3kKwr5CYj2OV5vn6FlykFlOek4OXZRU8,5591 pendulum/parsing/__pycache__/__init__.cpython-311.pyc,, pendulum/parsing/__pycache__/iso8601.cpython-311.pyc,, pendulum/parsing/_iso8601.c,sha256=mNSd5NwIRb_yBI8l_OuoZQRBkXevLrpsESRnjcKkiWg,38384 pendulum/parsing/_iso8601.cpython-311-darwin.so,sha256=mfy_IURS_f2TyHvz690Go-N18_TKpwVwsmTjxqKz4ns,55376 pendulum/parsing/exceptions/__init__.py,sha256=HOFxWKLvXl8WGjVHe_IpmqXRI3zedWdTu_0eMuopioQ,44 pendulum/parsing/exceptions/__pycache__/__init__.cpython-311.pyc,, pendulum/parsing/iso8601.py,sha256=Nan53RPxB60BUX_5tABS_qYo7pQIq6-e3HArYhQC_NY,14304 pendulum/period.py,sha256=XAVl-W4jqVmSPSjlrL9i2ocomVncGfTGeQONjc9RIqE,11175 pendulum/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/time.py,sha256=y5TwExt2L0qUzcCw5RYsMdBkpNXgPzRpR27y6cQd7R8,8125 pendulum/tz/__init__.py,sha256=A-_5bN29l2MBXXJ6moSLOmDerTyCXLCIOqyFFHRxcfs,1369 pendulum/tz/__pycache__/__init__.cpython-311.pyc,, pendulum/tz/__pycache__/exceptions.cpython-311.pyc,, pendulum/tz/__pycache__/local_timezone.cpython-311.pyc,, pendulum/tz/__pycache__/timezone.cpython-311.pyc,, pendulum/tz/data/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/tz/data/__pycache__/__init__.cpython-311.pyc,, pendulum/tz/data/__pycache__/windows.cpython-311.pyc,, pendulum/tz/data/windows.py,sha256=3wfke5bjhvmlqvVFJX4ZuQjBOqVBW5ybeS-yTrj5r58,6687 pendulum/tz/exceptions.py,sha256=xQlROtKUV2xCbWYP0uNu3xLLA_HN_DT01iSxhibFvTQ,492 pendulum/tz/local_timezone.py,sha256=D-vPQ3MkNFPZcmMRd7zuA4-8ooi2tkl8ENL8s6K58uw,8095 pendulum/tz/timezone.py,sha256=UJi1hoFRDrmXU7hv6B8QSy-vfe-ZeeDNMwJHda36UG4,11528 pendulum/tz/zoneinfo/__init__.py,sha256=tce8_9Rc3ELUXU0KAmUBC5-y4Duciu7wPkCrCgBSiYk,440 pendulum/tz/zoneinfo/__pycache__/__init__.cpython-311.pyc,, pendulum/tz/zoneinfo/__pycache__/exceptions.cpython-311.pyc,, pendulum/tz/zoneinfo/__pycache__/posix_timezone.cpython-311.pyc,, pendulum/tz/zoneinfo/__pycache__/reader.cpython-311.pyc,, pendulum/tz/zoneinfo/__pycache__/timezone.cpython-311.pyc,, pendulum/tz/zoneinfo/__pycache__/transition.cpython-311.pyc,, pendulum/tz/zoneinfo/__pycache__/transition_type.cpython-311.pyc,, pendulum/tz/zoneinfo/exceptions.py,sha256=XfTTFMOg5bZCWR8eAgOLPoybO9lh8xfv3443936FW5g,425 pendulum/tz/zoneinfo/posix_timezone.py,sha256=io9cLnibYatE8YyDuqEOcb2dlGjj8bZGEsXMBZesES8,7277 pendulum/tz/zoneinfo/reader.py,sha256=wpTGU8ETc-mUAMBiZgTiUB4eDWaF_9HGLoppuBz1tjM,6852 pendulum/tz/zoneinfo/timezone.py,sha256=rPz_6i032_p0ZmN8j9w_KVqbpZ3mQtQmlkz4vX3SB7s,4248 pendulum/tz/zoneinfo/transition.py,sha256=kGFAVy-zejKgvZ2AJMEB6vaPO2PuZMyGs992GxEtQ9E,2055 pendulum/tz/zoneinfo/transition_type.py,sha256=6mFOT4BDVTqLqH6b0bwxlz3BWHgH17SMk9QFEKSoMG8,894 pendulum/utils/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pendulum/utils/__pycache__/__init__.cpython-311.pyc,, pendulum/utils/__pycache__/_compat.cpython-311.pyc,, pendulum/utils/_compat.py,sha256=bEkROlv5IBuz6RcSdgPxweNpjYvluBXvHt1qWGaS5T0,1263
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/pendulum-2.1.2.dist-info/LICENSE
Copyright (c) 2015 Sébastien Eustace Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/pendulum-2.1.2.dist-info/WHEEL
Wheel-Version: 1.0 Generator: poetry-core 1.8.1 Root-Is-Purelib: false Tag: cp311-cp311-macosx_14_0_arm64
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/pendulum-2.1.2.dist-info/INSTALLER
pip
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/pendulum-2.1.2.dist-info/METADATA
Metadata-Version: 2.1 Name: pendulum Version: 2.1.2 Summary: Python datetimes made easy Home-page: https://pendulum.eustace.io License: MIT Keywords: datetime,date,time Author: Sébastien Eustace Author-email: sebastien@eustace.io Requires-Python: >=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*, !=3.4.* Classifier: License :: OSI Approved :: MIT License Classifier: Programming Language :: Python :: 2 Classifier: Programming Language :: Python :: 2.7 Classifier: Programming Language :: Python :: 3 Classifier: Programming Language :: Python :: 3.5 Classifier: Programming Language :: Python :: 3.6 Classifier: Programming Language :: Python :: 3.7 Classifier: Programming Language :: Python :: 3.8 Classifier: Programming Language :: Python :: 3.9 Classifier: Programming Language :: Python :: 3.10 Classifier: Programming Language :: Python :: 3.11 Classifier: Programming Language :: Python :: 3.12 Requires-Dist: python-dateutil (>=2.6,<3.0) Requires-Dist: pytzdata (>=2020.1) Requires-Dist: typing (>=3.6,<4.0) ; python_version < "3.5" Project-URL: Documentation, https://pendulum.eustace.io/docs Project-URL: Repository, https://github.com/sdispater/pendulum Description-Content-Type: text/x-rst Pendulum ######## .. image:: https://img.shields.io/pypi/v/pendulum.svg :target: https://pypi.python.org/pypi/pendulum .. image:: https://img.shields.io/pypi/l/pendulum.svg :target: https://pypi.python.org/pypi/pendulum .. image:: https://img.shields.io/codecov/c/github/sdispater/pendulum/master.svg :target: https://codecov.io/gh/sdispater/pendulum/branch/master .. image:: https://travis-ci.org/sdispater/pendulum.svg :alt: Pendulum Build status :target: https://travis-ci.org/sdispater/pendulum Python datetimes made easy. Supports Python **2.7** and **3.4+**. .. code-block:: python >>> import pendulum >>> now_in_paris = pendulum.now('Europe/Paris') >>> now_in_paris '2016-07-04T00:49:58.502116+02:00' # Seamless timezone switching >>> now_in_paris.in_timezone('UTC') '2016-07-03T22:49:58.502116+00:00' >>> tomorrow = pendulum.now().add(days=1) >>> last_week = pendulum.now().subtract(weeks=1) >>> past = pendulum.now().subtract(minutes=2) >>> past.diff_for_humans() >>> '2 minutes ago' >>> delta = past - last_week >>> delta.hours 23 >>> delta.in_words(locale='en') '6 days 23 hours 58 minutes' # Proper handling of datetime normalization >>> pendulum.datetime(2013, 3, 31, 2, 30, tz='Europe/Paris') '2013-03-31T03:30:00+02:00' # 2:30 does not exist (Skipped time) # Proper handling of dst transitions >>> just_before = pendulum.datetime(2013, 3, 31, 1, 59, 59, 999999, tz='Europe/Paris') '2013-03-31T01:59:59.999999+01:00' >>> just_before.add(microseconds=1) '2013-03-31T03:00:00+02:00' Why Pendulum? ============= Native ``datetime`` instances are enough for basic cases but when you face more complex use-cases they often show limitations and are not so intuitive to work with. ``Pendulum`` provides a cleaner and more easy to use API while still relying on the standard library. So it's still ``datetime`` but better. Unlike other datetime libraries for Python, Pendulum is a drop-in replacement for the standard ``datetime`` class (it inherits from it), so, basically, you can replace all your ``datetime`` instances by ``DateTime`` instances in you code (exceptions exist for libraries that check the type of the objects by using the ``type`` function like ``sqlite3`` or ``PyMySQL`` for instance). It also removes the notion of naive datetimes: each ``Pendulum`` instance is timezone-aware and by default in ``UTC`` for ease of use. Pendulum also improves the standard ``timedelta`` class by providing more intuitive methods and properties. Why not Arrow? ============== Arrow is the most popular datetime library for Python right now, however its behavior and API can be erratic and unpredictable. The ``get()`` method can receive pretty much anything and it will try its best to return something while silently failing to handle some cases: .. code-block:: python arrow.get('2016-1-17') # <Arrow [2016-01-01T00:00:00+00:00]> pendulum.parse('2016-1-17') # <Pendulum [2016-01-17T00:00:00+00:00]> arrow.get('20160413') # <Arrow [1970-08-22T08:06:53+00:00]> pendulum.parse('20160413') # <Pendulum [2016-04-13T00:00:00+00:00]> arrow.get('2016-W07-5') # <Arrow [2016-01-01T00:00:00+00:00]> pendulum.parse('2016-W07-5') # <Pendulum [2016-02-19T00:00:00+00:00]> # Working with DST just_before = arrow.Arrow(2013, 3, 31, 1, 59, 59, 999999, 'Europe/Paris') just_after = just_before.replace(microseconds=1) '2013-03-31T02:00:00+02:00' # Should be 2013-03-31T03:00:00+02:00 (just_after.to('utc') - just_before.to('utc')).total_seconds() -3599.999999 # Should be 1e-06 just_before = pendulum.datetime(2013, 3, 31, 1, 59, 59, 999999, 'Europe/Paris') just_after = just_before.add(microseconds=1) '2013-03-31T03:00:00+02:00' (just_after.in_timezone('utc') - just_before.in_timezone('utc')).total_seconds() 1e-06 Those are a few examples showing that Arrow cannot always be trusted to have a consistent behavior with the data you are passing to it. Limitations =========== Even though the ``DateTime`` class is a subclass of ``datetime`` there are some rare cases where it can't replace the native class directly. Here is a list (non-exhaustive) of the reported cases with a possible solution, if any: * ``sqlite3`` will use the ``type()`` function to determine the type of the object by default. To work around it you can register a new adapter: .. code-block:: python from pendulum import DateTime from sqlite3 import register_adapter register_adapter(DateTime, lambda val: val.isoformat(' ')) * ``mysqlclient`` (former ``MySQLdb``) and ``PyMySQL`` will use the ``type()`` function to determine the type of the object by default. To work around it you can register a new adapter: .. code-block:: python import MySQLdb.converters import pymysql.converters from pendulum import DateTime MySQLdb.converters.conversions[DateTime] = MySQLdb.converters.DateTime2literal pymysql.converters.conversions[DateTime] = pymysql.converters.escape_datetime * ``django`` will use the ``isoformat()`` method to store datetimes in the database. However since ``pendulum`` is always timezone aware the offset information will always be returned by ``isoformat()`` raising an error, at least for MySQL databases. To work around it you can either create your own ``DateTimeField`` or use the previous workaround for ``MySQLdb``: .. code-block:: python from django.db.models import DateTimeField as BaseDateTimeField from pendulum import DateTime class DateTimeField(BaseDateTimeField): def value_to_string(self, obj): val = self.value_from_object(obj) if isinstance(value, DateTime): return value.to_datetime_string() return '' if val is None else val.isoformat() Resources ========= * `Official Website <https://pendulum.eustace.io>`_ * `Documentation <https://pendulum.eustace.io/docs/>`_ * `Issue Tracker <https://github.com/sdispater/pendulum/issues>`_ Contributing ============ Contributions are welcome, especially with localization. Getting started --------------- To work on the Pendulum codebase, you'll want to clone the project locally and install the required depedendencies via `poetry <https://poetry.eustace.io>`_. .. code-block:: bash $ git clone git@github.com:sdispater/pendulum.git $ poetry install Localization ------------ If you want to help with localization, there are two different cases: the locale already exists or not. If the locale does not exist you will need to create it by using the ``clock`` utility: .. code-block:: bash ./clock locale create <your-locale> It will generate a directory in ``pendulum/locales`` named after your locale, with the following structure: .. code-block:: text <your-locale>/ - custom.py - locale.py The ``locale.py`` file must not be modified. It contains the translations provided by the CLDR database. The ``custom.py`` file is the one you want to modify. It contains the data needed by Pendulum that are not provided by the CLDR database. You can take the `en <https://github.com/sdispater/pendulum/tree/master/pendulum/locales/en/custom.py>`_ data as a reference to see which data is needed. You should also add tests for the created or modified locale.
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/jsonschema-4.20.0.dist-info/RECORD
../../../bin/jsonschema,sha256=WofZOinNBiKvn0faSdoDS9lEiVvEmByDFT2c_pJvxu8,283 jsonschema-4.20.0.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4 jsonschema-4.20.0.dist-info/METADATA,sha256=wDoqdIUwZ8n2NOlLv7m1iLMKkxMTAup3BbgAF2ujLBM,8092 jsonschema-4.20.0.dist-info/RECORD,, jsonschema-4.20.0.dist-info/WHEEL,sha256=9QBuHhg6FNW7lppboF2vKVbCGTVzsFykgRQjjlajrhA,87 jsonschema-4.20.0.dist-info/entry_points.txt,sha256=vO7rX4Fs_xIVJy2pnAtKgTSxfpnozAVQ0DjCmpMxnWE,51 jsonschema-4.20.0.dist-info/licenses/COPYING,sha256=T5KgFaE8TRoEC-8BiqE0MLTxvHO0Gxa7hGw0Z2bedDk,1057 jsonschema/__init__.py,sha256=LkPwscySlJ9lTOp7ZB1M7jQ8mbG7-bYG41iBwbZ-o9s,3941 jsonschema/__main__.py,sha256=iLsZf2upUB3ilBKTlMnyK-HHt2Cnnfkwwxi_c6gLvSA,115 jsonschema/__pycache__/__init__.cpython-311.pyc,, jsonschema/__pycache__/__main__.cpython-311.pyc,, jsonschema/__pycache__/_format.cpython-311.pyc,, jsonschema/__pycache__/_keywords.cpython-311.pyc,, jsonschema/__pycache__/_legacy_keywords.cpython-311.pyc,, jsonschema/__pycache__/_types.cpython-311.pyc,, jsonschema/__pycache__/_typing.cpython-311.pyc,, jsonschema/__pycache__/_utils.cpython-311.pyc,, jsonschema/__pycache__/cli.cpython-311.pyc,, jsonschema/__pycache__/exceptions.cpython-311.pyc,, jsonschema/__pycache__/protocols.cpython-311.pyc,, jsonschema/__pycache__/validators.cpython-311.pyc,, jsonschema/_format.py,sha256=OTCvvvKKmk7SGUa8N31CVpiMxF7cZ9l1WO2trR4kjB8,14773 jsonschema/_keywords.py,sha256=XH_6ed-ElmQ0kL3CbPHSAMIdJroikdhDXFsln5BaYdA,14592 jsonschema/_legacy_keywords.py,sha256=4zI2iaIzQBdeHT1MbiNt77HLEvjNW3Vz_rB1jPIL-jI,15288 jsonschema/_types.py,sha256=cQYlNKvI2UkxaoHfOVrQJ_JgsWxU0PYJ5E19XlnQ-J4,5352 jsonschema/_typing.py,sha256=NZhPhkBOn9INYZk8G69rDeuRamztgXCMLh10z9cfT6g,610 jsonschema/_utils.py,sha256=_NX2kZkpV_I_uwFfUggZEQUErEqY-f_it8vJSkXKaG4,10667 jsonschema/benchmarks/__init__.py,sha256=A0sQrxDBVHSyQ-8ru3L11hMXf3q9gVuB9x_YgHb4R9M,70 jsonschema/benchmarks/__pycache__/__init__.cpython-311.pyc,, jsonschema/benchmarks/__pycache__/issue232.cpython-311.pyc,, jsonschema/benchmarks/__pycache__/json_schema_test_suite.cpython-311.pyc,, jsonschema/benchmarks/__pycache__/nested_schemas.cpython-311.pyc,, jsonschema/benchmarks/__pycache__/subcomponents.cpython-311.pyc,, jsonschema/benchmarks/__pycache__/unused_registry.cpython-311.pyc,, jsonschema/benchmarks/__pycache__/validator_creation.cpython-311.pyc,, jsonschema/benchmarks/issue232.py,sha256=3LLYLIlBGQnVuyyo2iAv-xky5P6PRFHANx4-zIIQOoE,521 jsonschema/benchmarks/issue232/issue.json,sha256=eaPOZjMRu5u8RpKrsA9uk7ucPZS5tkKG4D_hkOTQ3Hk,117105 jsonschema/benchmarks/json_schema_test_suite.py,sha256=PvfabpUYcF4_7csYDTcTauED8rnFEGYbdY5RqTXD08s,320 jsonschema/benchmarks/nested_schemas.py,sha256=JyK95iIABBmku7AIHpRhr9XKYAxZ1-g1Qh84oRT8FPU,1891 jsonschema/benchmarks/subcomponents.py,sha256=mfWy04Ibrn2Yeu5RlwoWa1eGfOU1L2UOjusRXgRnCeM,1112 jsonschema/benchmarks/unused_registry.py,sha256=Rf1H2Mw79YzDfkjnI-6-FFrXpR-N9NMel5qvht6Vbf4,939 jsonschema/benchmarks/validator_creation.py,sha256=UkUQlLAnussnr_KdCIdad6xx2pXxQLmYtsXoiirKeWQ,285 jsonschema/cli.py,sha256=Xj1RxubUSWti9epUFUostExxuOOOiZ3bMYzHLnV2pN0,8431 jsonschema/exceptions.py,sha256=qDpHDnBWNKrGCOsRA-4kFBlhac7igY2nS5FfN-CpgQk,13928 jsonschema/protocols.py,sha256=6OQ_ME0-rB0jfCkDpbKqqb4gFM0G0NUw6S38hszNBI0,7160 jsonschema/tests/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 jsonschema/tests/__pycache__/__init__.cpython-311.pyc,, jsonschema/tests/__pycache__/_suite.cpython-311.pyc,, jsonschema/tests/__pycache__/fuzz_validate.cpython-311.pyc,, jsonschema/tests/__pycache__/test_cli.cpython-311.pyc,, jsonschema/tests/__pycache__/test_deprecations.cpython-311.pyc,, jsonschema/tests/__pycache__/test_exceptions.cpython-311.pyc,, jsonschema/tests/__pycache__/test_format.cpython-311.pyc,, jsonschema/tests/__pycache__/test_jsonschema_test_suite.cpython-311.pyc,, jsonschema/tests/__pycache__/test_types.cpython-311.pyc,, jsonschema/tests/__pycache__/test_utils.cpython-311.pyc,, jsonschema/tests/__pycache__/test_validators.cpython-311.pyc,, jsonschema/tests/_suite.py,sha256=KMPsJ5Rvo3QuZL5emoIBYMatwIJsOxYCKwxb0jU3lZg,8062 jsonschema/tests/fuzz_validate.py,sha256=fUA7yTJIihaCwJplkUehZeyB84HcXEcqtY5oPJXIO7I,1114 jsonschema/tests/test_cli.py,sha256=4yK21qvPgsopcoW4DEmbze3Tc5h-gJKQJKGeAKDf9pA,28571 jsonschema/tests/test_deprecations.py,sha256=eLIBCeAmSrGzN81LiVFuLOf_8CThcwiQ7XvaazPis74,15712 jsonschema/tests/test_exceptions.py,sha256=8F39-3_jHgg4OvL7ynHMVNZpaOiWoF79mPM4LltnYxA,20122 jsonschema/tests/test_format.py,sha256=eVm5SMaWF2lOPO28bPAwNvkiQvHCQKy-MnuAgEchfEc,3188 jsonschema/tests/test_jsonschema_test_suite.py,sha256=xhqkEpVPUVM4TK_eZ1o4QojpkFFlAZi6_0GdMEXpvcQ,8084 jsonschema/tests/test_types.py,sha256=cF51KTDmdsx06MrIc4fXKt0X9fIsVgw5uhT8CamVa8U,6977 jsonschema/tests/test_utils.py,sha256=lJRVYyQeZQTUCTU_M3BhlkxPMgjsc8KQCd7U_Qkook8,3749 jsonschema/tests/test_validators.py,sha256=h1S9CJtbukON_SZO5hwgS9y-Bob2Lrk7RxpQC-Ku7Kk,86856 jsonschema/validators.py,sha256=LV66AJIO--llPArzpj_MODJNpdcxep1q4zzxj4QIx6U,46303
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/jsonschema-4.20.0.dist-info/WHEEL
Wheel-Version: 1.0 Generator: hatchling 1.18.0 Root-Is-Purelib: true Tag: py3-none-any
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/jsonschema-4.20.0.dist-info/entry_points.txt
[console_scripts] jsonschema = jsonschema.cli:main
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/jsonschema-4.20.0.dist-info/INSTALLER
pip
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/jsonschema-4.20.0.dist-info/METADATA
Metadata-Version: 2.1 Name: jsonschema Version: 4.20.0 Summary: An implementation of JSON Schema validation for Python Project-URL: Documentation, https://python-jsonschema.readthedocs.io/ Project-URL: Homepage, https://github.com/python-jsonschema/jsonschema Project-URL: Issues, https://github.com/python-jsonschema/jsonschema/issues/ Project-URL: Funding, https://github.com/sponsors/Julian Project-URL: Tidelift, https://tidelift.com/subscription/pkg/pypi-jsonschema?utm_source=pypi-jsonschema&utm_medium=referral&utm_campaign=pypi-link Project-URL: Changelog, https://github.com/python-jsonschema/jsonschema/blob/main/CHANGELOG.rst Project-URL: Source, https://github.com/python-jsonschema/jsonschema Author: Julian Berman Author-email: Julian+jsonschema@GrayVines.com License: MIT License-File: COPYING Keywords: data validation,json,jsonschema,validation Classifier: Development Status :: 5 - Production/Stable Classifier: Intended Audience :: Developers Classifier: License :: OSI Approved :: MIT License Classifier: Operating System :: OS Independent Classifier: Programming Language :: Python Classifier: Programming Language :: Python :: 3.8 Classifier: Programming Language :: Python :: 3.9 Classifier: Programming Language :: Python :: 3.10 Classifier: Programming Language :: Python :: 3.11 Classifier: Programming Language :: Python :: 3.12 Classifier: Programming Language :: Python :: Implementation :: CPython Classifier: Programming Language :: Python :: Implementation :: PyPy Classifier: Topic :: File Formats :: JSON Classifier: Topic :: File Formats :: JSON :: JSON Schema Requires-Python: >=3.8 Requires-Dist: attrs>=22.2.0 Requires-Dist: importlib-resources>=1.4.0; python_version < '3.9' Requires-Dist: jsonschema-specifications>=2023.03.6 Requires-Dist: pkgutil-resolve-name>=1.3.10; python_version < '3.9' Requires-Dist: referencing>=0.28.4 Requires-Dist: rpds-py>=0.7.1 Provides-Extra: format Requires-Dist: fqdn; extra == 'format' Requires-Dist: idna; extra == 'format' Requires-Dist: isoduration; extra == 'format' Requires-Dist: jsonpointer>1.13; extra == 'format' Requires-Dist: rfc3339-validator; extra == 'format' Requires-Dist: rfc3987; extra == 'format' Requires-Dist: uri-template; extra == 'format' Requires-Dist: webcolors>=1.11; extra == 'format' Provides-Extra: format-nongpl Requires-Dist: fqdn; extra == 'format-nongpl' Requires-Dist: idna; extra == 'format-nongpl' Requires-Dist: isoduration; extra == 'format-nongpl' Requires-Dist: jsonpointer>1.13; extra == 'format-nongpl' Requires-Dist: rfc3339-validator; extra == 'format-nongpl' Requires-Dist: rfc3986-validator>0.1.0; extra == 'format-nongpl' Requires-Dist: uri-template; extra == 'format-nongpl' Requires-Dist: webcolors>=1.11; extra == 'format-nongpl' Description-Content-Type: text/x-rst ========== jsonschema ========== |PyPI| |Pythons| |CI| |ReadTheDocs| |Precommit| |Zenodo| .. |PyPI| image:: https://img.shields.io/pypi/v/jsonschema.svg :alt: PyPI version :target: https://pypi.org/project/jsonschema/ .. |Pythons| image:: https://img.shields.io/pypi/pyversions/jsonschema.svg :alt: Supported Python versions :target: https://pypi.org/project/jsonschema/ .. |CI| image:: https://github.com/python-jsonschema/jsonschema/workflows/CI/badge.svg :alt: Build status :target: https://github.com/python-jsonschema/jsonschema/actions?query=workflow%3ACI .. |ReadTheDocs| image:: https://readthedocs.org/projects/python-jsonschema/badge/?version=stable&style=flat :alt: ReadTheDocs status :target: https://python-jsonschema.readthedocs.io/en/stable/ .. |Precommit| image:: https://results.pre-commit.ci/badge/github/python-jsonschema/jsonschema/main.svg :alt: pre-commit.ci status :target: https://results.pre-commit.ci/latest/github/python-jsonschema/jsonschema/main .. |Zenodo| image:: https://zenodo.org/badge/3072629.svg :alt: Zenodo DOI :target: https://zenodo.org/badge/latestdoi/3072629 ``jsonschema`` is an implementation of the `JSON Schema <https://json-schema.org>`_ specification for Python. .. code:: python >>> from jsonschema import validate >>> # A sample schema, like what we'd get from json.load() >>> schema = { ... "type" : "object", ... "properties" : { ... "price" : {"type" : "number"}, ... "name" : {"type" : "string"}, ... }, ... } >>> # If no exception is raised by validate(), the instance is valid. >>> validate(instance={"name" : "Eggs", "price" : 34.99}, schema=schema) >>> validate( ... instance={"name" : "Eggs", "price" : "Invalid"}, schema=schema, ... ) # doctest: +IGNORE_EXCEPTION_DETAIL Traceback (most recent call last): ... ValidationError: 'Invalid' is not of type 'number' It can also be used from the command line by installing `check-jsonschema <https://github.com/python-jsonschema/check-jsonschema>`_. Features -------- * Full support for `Draft 2020-12 <https://python-jsonschema.readthedocs.io/en/latest/api/jsonschema/validators/#jsonschema.validators.Draft202012Validator>`_, `Draft 2019-09 <https://python-jsonschema.readthedocs.io/en/latest/api/jsonschema/validators/#jsonschema.validators.Draft201909Validator>`_, `Draft 7 <https://python-jsonschema.readthedocs.io/en/latest/api/jsonschema/validators/#jsonschema.validators.Draft7Validator>`_, `Draft 6 <https://python-jsonschema.readthedocs.io/en/latest/api/jsonschema/validators/#jsonschema.validators.Draft6Validator>`_, `Draft 4 <https://python-jsonschema.readthedocs.io/en/latest/api/jsonschema/validators/#jsonschema.validators.Draft4Validator>`_ and `Draft 3 <https://python-jsonschema.readthedocs.io/en/latest/api/jsonschema/validators/#jsonschema.validators.Draft3Validator>`_ * `Lazy validation <https://python-jsonschema.readthedocs.io/en/latest/api/jsonschema/protocols/#jsonschema.protocols.Validator.iter_errors>`_ that can iteratively report *all* validation errors. * `Programmatic querying <https://python-jsonschema.readthedocs.io/en/latest/errors/>`_ of which properties or items failed validation. Installation ------------ ``jsonschema`` is available on `PyPI <https://pypi.org/project/jsonschema/>`_. You can install using `pip <https://pip.pypa.io/en/stable/>`_: .. code:: bash $ pip install jsonschema Extras ====== Two extras are available when installing the package, both currently related to ``format`` validation: * ``format`` * ``format-nongpl`` They can be used when installing in order to include additional dependencies, e.g.: .. code:: bash $ pip install jsonschema'[format]' Be aware that the mere presence of these dependencies – or even the specification of ``format`` checks in a schema – do *not* activate format checks (as per the specification). Please read the `format validation documentation <https://python-jsonschema.readthedocs.io/en/latest/validate/#validating-formats>`_ for further details. About ----- I'm Julian Berman. ``jsonschema`` is on `GitHub <https://github.com/python-jsonschema/jsonschema>`_. Get in touch, via GitHub or otherwise, if you've got something to contribute, it'd be most welcome! You can also generally find me on Libera (nick: ``Julian``) in various channels, including ``#python``. If you feel overwhelmingly grateful, you can also `sponsor me <https://github.com/sponsors/Julian/>`_. And for companies who appreciate ``jsonschema`` and its continued support and growth, ``jsonschema`` is also now supportable via `TideLift <https://tidelift.com/subscription/pkg/pypi-jsonschema?utm_source=pypi-jsonschema&utm_medium=referral&utm_campaign=readme>`_. Release Information ------------------- v4.20.0 ======= * Properly consider items (and properties) to be evaluated by ``unevaluatedItems`` (resp. ``unevaluatedProperties``) when behind a ``$dynamicRef`` as specified by the 2020 and 2019 specifications. * ``jsonschema.exceptions.ErrorTree.__setitem__`` is now deprecated. More broadly, in general users of ``jsonschema`` should never be mutating objects owned by the library.
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/jsonschema-4.20.0.dist-info
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/jsonschema-4.20.0.dist-info/licenses/COPYING
Copyright (c) 2013 Julian Berman Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/PyYAML-6.0.1.dist-info/RECORD
PyYAML-6.0.1.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4 PyYAML-6.0.1.dist-info/LICENSE,sha256=jTko-dxEkP1jVwfLiOsmvXZBAqcoKVQwfT5RZ6V36KQ,1101 PyYAML-6.0.1.dist-info/METADATA,sha256=UNNF8-SzzwOKXVo-kV5lXUGH2_wDWMBmGxqISpp5HQk,2058 PyYAML-6.0.1.dist-info/RECORD,, PyYAML-6.0.1.dist-info/WHEEL,sha256=GYWT1Q_60SI2bAUaGrkLwkEA5yYDmphib6XcY6K30ZQ,110 PyYAML-6.0.1.dist-info/top_level.txt,sha256=rpj0IVMTisAjh_1vG3Ccf9v5jpCQwAz6cD1IVU5ZdhQ,11 _yaml/__init__.py,sha256=04Ae_5osxahpJHa3XBZUAf4wi6XX32gR8D6X6p64GEA,1402 _yaml/__pycache__/__init__.cpython-311.pyc,, yaml/__init__.py,sha256=bhl05qSeO-1ZxlSRjGrvl2m9nrXb1n9-GQatTN0Mrqc,12311 yaml/__pycache__/__init__.cpython-311.pyc,, yaml/__pycache__/composer.cpython-311.pyc,, yaml/__pycache__/constructor.cpython-311.pyc,, yaml/__pycache__/cyaml.cpython-311.pyc,, yaml/__pycache__/dumper.cpython-311.pyc,, yaml/__pycache__/emitter.cpython-311.pyc,, yaml/__pycache__/error.cpython-311.pyc,, yaml/__pycache__/events.cpython-311.pyc,, yaml/__pycache__/loader.cpython-311.pyc,, yaml/__pycache__/nodes.cpython-311.pyc,, yaml/__pycache__/parser.cpython-311.pyc,, yaml/__pycache__/reader.cpython-311.pyc,, yaml/__pycache__/representer.cpython-311.pyc,, yaml/__pycache__/resolver.cpython-311.pyc,, yaml/__pycache__/scanner.cpython-311.pyc,, yaml/__pycache__/serializer.cpython-311.pyc,, yaml/__pycache__/tokens.cpython-311.pyc,, yaml/_yaml.cpython-311-darwin.so,sha256=YiF55JiadfOvw_mUH-lONNnsiMHj6C6o1SBfTCvvW54,362008 yaml/composer.py,sha256=_Ko30Wr6eDWUeUpauUGT3Lcg9QPBnOPVlTnIMRGJ9FM,4883 yaml/constructor.py,sha256=kNgkfaeLUkwQYY_Q6Ff1Tz2XVw_pG1xVE9Ak7z-viLA,28639 yaml/cyaml.py,sha256=6ZrAG9fAYvdVe2FK_w0hmXoG7ZYsoYUwapG8CiC72H0,3851 yaml/dumper.py,sha256=PLctZlYwZLp7XmeUdwRuv4nYOZ2UBnDIUy8-lKfLF-o,2837 yaml/emitter.py,sha256=jghtaU7eFwg31bG0B7RZea_29Adi9CKmXq_QjgQpCkQ,43006 yaml/error.py,sha256=Ah9z-toHJUbE9j-M8YpxgSRM5CgLCcwVzJgLLRF2Fxo,2533 yaml/events.py,sha256=50_TksgQiE4up-lKo_V-nBy-tAIxkIPQxY5qDhKCeHw,2445 yaml/loader.py,sha256=UVa-zIqmkFSCIYq_PgSGm4NSJttHY2Rf_zQ4_b1fHN0,2061 yaml/nodes.py,sha256=gPKNj8pKCdh2d4gr3gIYINnPOaOxGhJAUiYhGRnPE84,1440 yaml/parser.py,sha256=ilWp5vvgoHFGzvOZDItFoGjD6D42nhlZrZyjAwa0oJo,25495 yaml/reader.py,sha256=0dmzirOiDG4Xo41RnuQS7K9rkY3xjHiVasfDMNTqCNw,6794 yaml/representer.py,sha256=IuWP-cAW9sHKEnS0gCqSa894k1Bg4cgTxaDwIcbRQ-Y,14190 yaml/resolver.py,sha256=9L-VYfm4mWHxUD1Vg4X7rjDRK_7VZd6b92wzq7Y2IKY,9004 yaml/scanner.py,sha256=YEM3iLZSaQwXcQRg2l2R4MdT0zGP2F9eHkKGKnHyWQY,51279 yaml/serializer.py,sha256=ChuFgmhU01hj4xgI8GaKv6vfM2Bujwa9i7d2FAHj7cA,4165 yaml/tokens.py,sha256=lTQIzSVw8Mg9wv459-TjiOQe6wVziqaRlqX2_89rp54,2573
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/PyYAML-6.0.1.dist-info/LICENSE
Copyright (c) 2017-2021 Ingy döt Net Copyright (c) 2006-2016 Kirill Simonov Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/PyYAML-6.0.1.dist-info/WHEEL
Wheel-Version: 1.0 Generator: bdist_wheel (0.40.0) Root-Is-Purelib: false Tag: cp311-cp311-macosx_11_0_arm64
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/PyYAML-6.0.1.dist-info/top_level.txt
_yaml yaml
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/PyYAML-6.0.1.dist-info/INSTALLER
pip
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/PyYAML-6.0.1.dist-info/METADATA
Metadata-Version: 2.1 Name: PyYAML Version: 6.0.1 Summary: YAML parser and emitter for Python Home-page: https://pyyaml.org/ Download-URL: https://pypi.org/project/PyYAML/ Author: Kirill Simonov Author-email: xi@resolvent.net License: MIT Project-URL: Bug Tracker, https://github.com/yaml/pyyaml/issues Project-URL: CI, https://github.com/yaml/pyyaml/actions Project-URL: Documentation, https://pyyaml.org/wiki/PyYAMLDocumentation Project-URL: Mailing lists, http://lists.sourceforge.net/lists/listinfo/yaml-core Project-URL: Source Code, https://github.com/yaml/pyyaml Platform: Any Classifier: Development Status :: 5 - Production/Stable Classifier: Intended Audience :: Developers Classifier: License :: OSI Approved :: MIT License Classifier: Operating System :: OS Independent Classifier: Programming Language :: Cython Classifier: Programming Language :: Python Classifier: Programming Language :: Python :: 3 Classifier: Programming Language :: Python :: 3.6 Classifier: Programming Language :: Python :: 3.7 Classifier: Programming Language :: Python :: 3.8 Classifier: Programming Language :: Python :: 3.9 Classifier: Programming Language :: Python :: 3.10 Classifier: Programming Language :: Python :: 3.11 Classifier: Programming Language :: Python :: Implementation :: CPython Classifier: Programming Language :: Python :: Implementation :: PyPy Classifier: Topic :: Software Development :: Libraries :: Python Modules Classifier: Topic :: Text Processing :: Markup Requires-Python: >=3.6 License-File: LICENSE YAML is a data serialization format designed for human readability and interaction with scripting languages. PyYAML is a YAML parser and emitter for Python. PyYAML features a complete YAML 1.1 parser, Unicode support, pickle support, capable extension API, and sensible error messages. PyYAML supports standard YAML tags and provides Python-specific tags that allow to represent an arbitrary Python object. PyYAML is applicable for a broad range of tasks from complex configuration files to object serialization and persistence.
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/pip-23.3.1.dist-info/RECORD
pip/__init__.py,sha256=MSbZQYwV5U4mAXP2fBQh70QhM71N-1vh7T4CRREqVog,357 pip/__main__.py,sha256=WzbhHXTbSE6gBY19mNN9m4s5o_365LOvTYSgqgbdBhE,854 pip/__pip-runner__.py,sha256=EnrfKmKMzWAdqg_JicLCOP9Y95Ux7zHh4ObvqLtQcjo,1444 pip/py.typed,sha256=EBVvvPRTn_eIpz5e5QztSCdrMX7Qwd7VP93RSoIlZ2I,286 pip/_internal/__init__.py,sha256=iqZ5-YQsQV08tkUc7L806Reop6tguLFWf70ySF6be0Y,515 pip/_internal/build_env.py,sha256=1ESpqw0iupS_K7phZK5zshVE5Czy9BtGLFU4W6Enva8,10243 pip/_internal/cache.py,sha256=uiYD-9F0Bv1C8ZyWE85lpzDmQf7hcUkgL99GmI8I41Q,10370 pip/_internal/configuration.py,sha256=i_dePJKndPAy7hf48Sl6ZuPyl3tFPCE67z0SNatwuwE,13839 pip/_internal/exceptions.py,sha256=LyTVY2dANx-i_TEk5Yr9YcwUtiy0HOEFCAQq1F_46co,23737 pip/_internal/main.py,sha256=r-UnUe8HLo5XFJz8inTcOOTiu_sxNhgHb6VwlGUllOI,340 pip/_internal/pyproject.py,sha256=ltmrXWaMXjiJHbYyzWplTdBvPYPdKk99GjKuQVypGZU,7161 pip/_internal/self_outdated_check.py,sha256=saxQLB8UzIFtMScquytG10TOTsYVFJQ_mkW1NY-46wE,8378 pip/_internal/wheel_builder.py,sha256=3UlHfxQi7_AAXI7ur8aPpPbmqHhecCsubmkHEl-00KU,11842 pip/_internal/cli/__init__.py,sha256=FkHBgpxxb-_gd6r1FjnNhfMOzAUYyXoXKJ6abijfcFU,132 pip/_internal/cli/autocompletion.py,sha256=_br_5NgSxSuvPjMF0MLHzS5s6BpSkQAQHKrLK89VauM,6690 pip/_internal/cli/base_command.py,sha256=iuVWGa2oTq7gBReo0er3Z0tXJ2oqBIC6QjDHcnDhKXY,8733 pip/_internal/cli/cmdoptions.py,sha256=fAi5GzWuM9mKUesJZO56LcPCVMDtm64c2tC_YUpI1qs,30117 pip/_internal/cli/command_context.py,sha256=RHgIPwtObh5KhMrd3YZTkl8zbVG-6Okml7YbFX4Ehg0,774 pip/_internal/cli/main.py,sha256=Uzxt_YD1hIvB1AW5mxt6IVcht5G712AtMqdo51UMhmQ,2816 pip/_internal/cli/main_parser.py,sha256=laDpsuBDl6kyfywp9eMMA9s84jfH2TJJn-vmL0GG90w,4338 pip/_internal/cli/parser.py,sha256=o4esYgG-rvPsf6FBpF3fSLGHa4ndDvJtwxBgeckGyfI,10801 pip/_internal/cli/progress_bars.py,sha256=So4mPoSjXkXiSHiTzzquH3VVyVD_njXlHJSExYPXAow,1968 pip/_internal/cli/req_command.py,sha256=c7_XHABnXmD3_qlK9-r37KqdKBAcgmVKvQ2WcTrNLfc,18369 pip/_internal/cli/spinners.py,sha256=hIJ83GerdFgFCdobIA23Jggetegl_uC4Sp586nzFbPE,5118 pip/_internal/cli/status_codes.py,sha256=sEFHUaUJbqv8iArL3HAtcztWZmGOFX01hTesSytDEh0,116 pip/_internal/commands/__init__.py,sha256=5oRO9O3dM2vGuh0bFw4HOVletryrz5HHMmmPWwJrH9U,3882 pip/_internal/commands/cache.py,sha256=LfPA8wNcgZtjiI5faeFFCR2Zp-ugaj7XX--FmKxx4_4,7952 pip/_internal/commands/check.py,sha256=Rb13Q28yoLh0j1gpx5SU0jlResNct21eQCRsnaO9xKA,1782 pip/_internal/commands/completion.py,sha256=HT4lD0bgsflHq2IDgYfiEdp7IGGtE7s6MgI3xn0VQEw,4287 pip/_internal/commands/configuration.py,sha256=NB5uf8HIX8-li95YLoZO09nALIWlLCHDF5aifSKcBn8,9815 pip/_internal/commands/debug.py,sha256=L15rfN8DwORQln-QW3ihBaVdCfV7Iba-lwlcyw1f_Vk,6854 pip/_internal/commands/download.py,sha256=e4hw088zGo26WmJaMIRvCniLlLmoOjqolGyfHjsCkCQ,5335 pip/_internal/commands/freeze.py,sha256=2qjQrH9KWi5Roav0CuR7vc7hWm4uOi_0l6tp3ESKDHM,3172 pip/_internal/commands/hash.py,sha256=EVVOuvGtoPEdFi8SNnmdqlCQrhCxV-kJsdwtdcCnXGQ,1703 pip/_internal/commands/help.py,sha256=gcc6QDkcgHMOuAn5UxaZwAStsRBrnGSn_yxjS57JIoM,1132 pip/_internal/commands/index.py,sha256=cGQVSA5dAs7caQ9sz4kllYvaI4ZpGiq1WhCgaImXNSA,4793 pip/_internal/commands/inspect.py,sha256=2wSPt9yfr3r6g-s2S5L6PvRtaHNVyb4TuodMStJ39cw,3188 pip/_internal/commands/install.py,sha256=KTHT8EASlPfbNx428tcvnGhN8D9jlfBwcRa5lxEhFsA,28920 pip/_internal/commands/list.py,sha256=7wRUUmdyyOknl-WZYbO_LtFQxHlWod3pjOY9yYH435o,12450 pip/_internal/commands/search.py,sha256=sbBZiARRc050QquOKcCvOr2K3XLsoYebLKZGRi__iUI,5697 pip/_internal/commands/show.py,sha256=t5jia4zcYJRJZy4U_Von7zMl03hJmmcofj6oDNTnj7Y,6419 pip/_internal/commands/uninstall.py,sha256=OIqO9tqadY8kM4HwhFf1Q62fUIp7v8KDrTRo8yWMz7Y,3886 pip/_internal/commands/wheel.py,sha256=CSnX8Pmf1oPCnd7j7bn1_f58G9KHNiAblvVJ5zykN-A,6476 pip/_internal/distributions/__init__.py,sha256=Hq6kt6gXBgjNit5hTTWLAzeCNOKoB-N0pGYSqehrli8,858 pip/_internal/distributions/base.py,sha256=oRSEvnv2ZjBnargamnv2fcJa1n6gUDKaW0g6CWSEpWs,1743 pip/_internal/distributions/installed.py,sha256=QinHFbWAQ8oE0pbD8MFZWkwlnfU1QYTccA1vnhrlYOU,842 pip/_internal/distributions/sdist.py,sha256=4K3V0VNMllHbBzCJibjwd_tylUKpmIdu2AQyhplvCQo,6709 pip/_internal/distributions/wheel.py,sha256=-ma3sOtUQj0AxXCEb6_Fhmjl3nh4k3A0HC2taAb2N-4,1277 pip/_internal/index/__init__.py,sha256=vpt-JeTZefh8a-FC22ZeBSXFVbuBcXSGiILhQZJaNpQ,30 pip/_internal/index/collector.py,sha256=3OmYZ3tCoRPGOrELSgQWG-03M-bQHa2-VCA3R_nJAaU,16504 pip/_internal/index/package_finder.py,sha256=uA354-mHjHvTwxDmk9HvpAkq_7KyGvEd7_9aZFqu0HY,37889 pip/_internal/index/sources.py,sha256=7jw9XSeeQA5K-H4I5a5034Ks2gkQqm4zPXjrhwnP1S4,6556 pip/_internal/locations/__init__.py,sha256=Dh8LJWG8LRlDK4JIj9sfRF96TREzE--N_AIlx7Tqoe4,15365 pip/_internal/locations/_distutils.py,sha256=DXL6H3xERLF76BjcYanV4j-4Sw-qcPdO2qeZhLN30WQ,6102 pip/_internal/locations/_sysconfig.py,sha256=jyNVtUfMIf0mtyY-Xp1m9yQ8iwECozSVVFmjkN9a2yw,7680 pip/_internal/locations/base.py,sha256=RQiPi1d4FVM2Bxk04dQhXZ2PqkeljEL2fZZ9SYqIQ78,2556 pip/_internal/metadata/__init__.py,sha256=9pU3W3s-6HtjFuYhWcLTYVmSaziklPv7k2x8p7X1GmA,4339 pip/_internal/metadata/_json.py,sha256=BTkWfFDrWFwuSodImjtbAh8wCL3isecbnjTb5E6UUDI,2595 pip/_internal/metadata/base.py,sha256=l3Wgku4xlgr8s4p6fS-3qQ4QKOpPbWLRwi5d9omEFG4,25907 pip/_internal/metadata/pkg_resources.py,sha256=opjw4IBSqHvie6sXJ_cbT42meygoPEUfNURJuWZY7sk,10035 pip/_internal/metadata/importlib/__init__.py,sha256=jUUidoxnHcfITHHaAWG1G2i5fdBYklv_uJcjo2x7VYE,135 pip/_internal/metadata/importlib/_compat.py,sha256=GAe_prIfCE4iUylrnr_2dJRlkkBVRUbOidEoID7LPoE,1882 pip/_internal/metadata/importlib/_dists.py,sha256=UPl1wUujFqiwiltRJ1tMF42WRINO1sSpNNlYQ2mX0mk,8297 pip/_internal/metadata/importlib/_envs.py,sha256=XTaFIYERP2JF0QUZuPx2ETiugXbPEcZ8q8ZKeht6Lpc,7456 pip/_internal/models/__init__.py,sha256=3DHUd_qxpPozfzouoqa9g9ts1Czr5qaHfFxbnxriepM,63 pip/_internal/models/candidate.py,sha256=6pcABsaR7CfIHlbJbr2_kMkVJFL_yrYjTx6SVWUnCPQ,990 pip/_internal/models/direct_url.py,sha256=EepBxI97j7wSZ3AmRETYyVTmR9NoTas15vc8popxVTg,6931 pip/_internal/models/format_control.py,sha256=DJpMYjxeYKKQdwNcML2_F0vtAh-qnKTYe-CpTxQe-4g,2520 pip/_internal/models/index.py,sha256=tYnL8oxGi4aSNWur0mG8DAP7rC6yuha_MwJO8xw0crI,1030 pip/_internal/models/installation_report.py,sha256=zRVZoaz-2vsrezj_H3hLOhMZCK9c7TbzWgC-jOalD00,2818 pip/_internal/models/link.py,sha256=6OEk3bt41WU7QZoiyuoVPGsKOU-J_BbDDhouKbIXm0Y,20819 pip/_internal/models/scheme.py,sha256=3EFQp_ICu_shH1-TBqhl0QAusKCPDFOlgHFeN4XowWs,738 pip/_internal/models/search_scope.py,sha256=ASVyyZxiJILw7bTIVVpJx8J293M3Hk5F33ilGn0e80c,4643 pip/_internal/models/selection_prefs.py,sha256=KZdi66gsR-_RUXUr9uejssk3rmTHrQVJWeNA2sV-VSY,1907 pip/_internal/models/target_python.py,sha256=34EkorrMuRvRp-bjqHKJ-bOO71m9xdjN2b8WWFEC2HU,4272 pip/_internal/models/wheel.py,sha256=YqazoIZyma_Q1ejFa1C7NHKQRRWlvWkdK96VRKmDBeI,3600 pip/_internal/network/__init__.py,sha256=jf6Tt5nV_7zkARBrKojIXItgejvoegVJVKUbhAa5Ioc,50 pip/_internal/network/auth.py,sha256=TC-OcW2KU4W6R1hU4qPgQXvVH54adACpZz6sWq-R9NA,20541 pip/_internal/network/cache.py,sha256=48A971qCzKNFvkb57uGEk7-0xaqPS0HWj2711QNTxkU,3935 pip/_internal/network/download.py,sha256=HvDDq9bVqaN3jcS3DyVJHP7uTqFzbShdkf7NFSoHfkw,6096 pip/_internal/network/lazy_wheel.py,sha256=2PXVduYZPCPZkkQFe1J1GbfHJWeCU--FXonGyIfw9eU,7638 pip/_internal/network/session.py,sha256=uhovd4J7abd0Yr2g426yC4aC6Uw1VKrQfpzalsEBEMw,18607 pip/_internal/network/utils.py,sha256=6A5SrUJEEUHxbGtbscwU2NpCyz-3ztiDlGWHpRRhsJ8,4073 pip/_internal/network/xmlrpc.py,sha256=AzQgG4GgS152_cqmGr_Oz2MIXsCal-xfsis7fA7nmU0,1791 pip/_internal/operations/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pip/_internal/operations/check.py,sha256=Hgz0wQJ4fGi8aAVfmdShviNc7XM_2j8oMQJUsVv6AqY,6806 pip/_internal/operations/freeze.py,sha256=uqoeTAf6HOYVMR2UgAT8N85UZoGEVEoQdan_Ao6SOfk,9816 pip/_internal/operations/prepare.py,sha256=NWkGkNOjrnnUbHgJPTms_5usKF0M8JlaHL3nyIHABMk,28155 pip/_internal/operations/build/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pip/_internal/operations/build/build_tracker.py,sha256=z-H5DOknZdBa3dh2Vq6VBMY5qLYIKmlj2p6CGZK5Lc8,4832 pip/_internal/operations/build/metadata.py,sha256=9S0CUD8U3QqZeXp-Zyt8HxwU90lE4QrnYDgrqZDzBnc,1422 pip/_internal/operations/build/metadata_editable.py,sha256=VLL7LvntKE8qxdhUdEJhcotFzUsOSI8NNS043xULKew,1474 pip/_internal/operations/build/metadata_legacy.py,sha256=o-eU21As175hDC7dluM1fJJ_FqokTIShyWpjKaIpHZw,2198 pip/_internal/operations/build/wheel.py,sha256=sT12FBLAxDC6wyrDorh8kvcZ1jG5qInCRWzzP-UkJiQ,1075 pip/_internal/operations/build/wheel_editable.py,sha256=yOtoH6zpAkoKYEUtr8FhzrYnkNHQaQBjWQ2HYae1MQg,1417 pip/_internal/operations/build/wheel_legacy.py,sha256=C9j6rukgQI1n_JeQLoZGuDdfUwzCXShyIdPTp6edbMQ,3064 pip/_internal/operations/install/__init__.py,sha256=mX7hyD2GNBO2mFGokDQ30r_GXv7Y_PLdtxcUv144e-s,51 pip/_internal/operations/install/editable_legacy.py,sha256=YeR0KadWXw_ZheC1NtAG1qVIEkOgRGHc23x-YtGW7NU,1282 pip/_internal/operations/install/wheel.py,sha256=a5KnguJ9uQRo7Ikq4YJEno0fFltXYlud-0DpRj3zLr0,27457 pip/_internal/req/__init__.py,sha256=TELFgZOof3lhMmaICVWL9U7PlhXo9OufokbMAJ6J2GI,2738 pip/_internal/req/constructors.py,sha256=PgLoQlsZ_ErZORw5M1mgnxW5V4mKZC0-gyj_3k4hCe0,19028 pip/_internal/req/req_file.py,sha256=5PCO4GnDEnUENiFj4vD_1QmAMjHNtvN6HXbETZ9UGok,17872 pip/_internal/req/req_install.py,sha256=XvoTWTF7STk9EUqIphdOI0ZtQOplw44PIl9TCb-HtXw,35130 pip/_internal/req/req_set.py,sha256=nM-CetUtESEH31fdugrOl20GV5-pCUYAvu65FwYDJeI,4704 pip/_internal/req/req_uninstall.py,sha256=m9GlbQ3rzLORTSa6NPFFCmONmC5zTw2lY_0fLOkLYCk,24676 pip/_internal/resolution/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pip/_internal/resolution/base.py,sha256=qlmh325SBVfvG6Me9gc5Nsh5sdwHBwzHBq6aEXtKsLA,583 pip/_internal/resolution/legacy/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pip/_internal/resolution/legacy/resolver.py,sha256=th-eTPIvbecfJaUsdrbH1aHQvDV2yCE-RhrrpsJhKbE,24128 pip/_internal/resolution/resolvelib/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pip/_internal/resolution/resolvelib/base.py,sha256=jg5COmHLhmBIKOR-4spdJD3jyULYa1BdsqiBu2YJnJ4,5173 pip/_internal/resolution/resolvelib/candidates.py,sha256=IAcXcBj-LLzJwwfBXFGyhpxir42CMBW64oCc4zEgLYo,21320 pip/_internal/resolution/resolvelib/factory.py,sha256=FIOXvrdEGo6DMtLF9gqhUd4IQphPUkAYUe8ZIQ0ThMY,31317 pip/_internal/resolution/resolvelib/found_candidates.py,sha256=hvL3Hoa9VaYo-qEOZkBi2Iqw251UDxPz-uMHVaWmLpE,5705 pip/_internal/resolution/resolvelib/provider.py,sha256=4t23ivjruqM6hKBX1KpGiTt-M4HGhRcZnGLV0c01K7U,9824 pip/_internal/resolution/resolvelib/reporter.py,sha256=YFm9hQvz4DFCbjZeFTQ56hTz3Ac-mDBnHkeNRVvMHLY,3100 pip/_internal/resolution/resolvelib/requirements.py,sha256=SZh98hbSVbHiHBkgjrSLtdrrZB1zqRIUqFdXptS-aVY,6030 pip/_internal/resolution/resolvelib/resolver.py,sha256=nLJOsVMEVi2gQUVJoUFKMZAeu2f7GRMjGMvNSWyz0Bc,12592 pip/_internal/utils/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pip/_internal/utils/_jaraco_text.py,sha256=yvDGelTVugRayPaOF2k4ab0Ky4d3uOkAfuOQjASjImY,3351 pip/_internal/utils/_log.py,sha256=-jHLOE_THaZz5BFcCnoSL9EYAtJ0nXem49s9of4jvKw,1015 pip/_internal/utils/appdirs.py,sha256=swgcTKOm3daLeXTW6v5BUS2Ti2RvEnGRQYH_yDXklAo,1665 pip/_internal/utils/compat.py,sha256=ACyBfLgj3_XG-iA5omEDrXqDM0cQKzi8h8HRBInzG6Q,1884 pip/_internal/utils/compatibility_tags.py,sha256=ydin8QG8BHqYRsPY4OL6cmb44CbqXl1T0xxS97VhHkk,5377 pip/_internal/utils/datetime.py,sha256=m21Y3wAtQc-ji6Veb6k_M5g6A0ZyFI4egchTdnwh-pQ,242 pip/_internal/utils/deprecation.py,sha256=NKo8VqLioJ4nnXXGmW4KdasxF90EFHkZaHeX1fT08C8,3627 pip/_internal/utils/direct_url_helpers.py,sha256=6F1tc2rcKaCZmgfVwsE6ObIe_Pux23mUVYA-2D9wCFc,3206 pip/_internal/utils/egg_link.py,sha256=ZryCchR_yQSCsdsMkCpxQjjLbQxObA5GDtLG0RR5mGc,2118 pip/_internal/utils/encoding.py,sha256=qqsXDtiwMIjXMEiIVSaOjwH5YmirCaK-dIzb6-XJsL0,1169 pip/_internal/utils/entrypoints.py,sha256=YlhLTRl2oHBAuqhc-zmL7USS67TPWVHImjeAQHreZTQ,3064 pip/_internal/utils/filesystem.py,sha256=RhMIXUaNVMGjc3rhsDahWQ4MavvEQDdqXqgq-F6fpw8,5122 pip/_internal/utils/filetypes.py,sha256=i8XAQ0eFCog26Fw9yV0Yb1ygAqKYB1w9Cz9n0fj8gZU,716 pip/_internal/utils/glibc.py,sha256=Mesxxgg3BLxheLZx-dSf30b6gKpOgdVXw6W--uHSszQ,3113 pip/_internal/utils/hashes.py,sha256=MjOigC75z6qoRMkgHiHqot7eqxfwDZSrEflJMPm-bHE,5118 pip/_internal/utils/logging.py,sha256=fdtuZJ-AKkqwDTANDvGcBEpssL8el7T1jnwk1CnZl3Y,11603 pip/_internal/utils/misc.py,sha256=96DVNJQIeMi0vWrNp0C0v3xjk2r7Zcay5yDoruIm_Js,23739 pip/_internal/utils/models.py,sha256=5GoYU586SrxURMvDn_jBMJInitviJg4O5-iOU-6I0WY,1193 pip/_internal/utils/packaging.py,sha256=5Wm6_x7lKrlqVjPI5MBN_RurcRHwVYoQ7Ksrs84de7s,2108 pip/_internal/utils/setuptools_build.py,sha256=ouXpud-jeS8xPyTPsXJ-m34NPvK5os45otAzdSV_IJE,4435 pip/_internal/utils/subprocess.py,sha256=zzdimb75jVLE1GU4WlTZ055gczhD7n1y1xTcNc7vNZQ,9207 pip/_internal/utils/temp_dir.py,sha256=DUAw22uFruQdK43i2L2K53C-CDjRCPeAsBKJpu-rHQ4,9312 pip/_internal/utils/unpacking.py,sha256=SBb2iV1crb89MDRTEKY86R4A_UOWApTQn9VQVcMDOlE,8821 pip/_internal/utils/urls.py,sha256=AhaesUGl-9it6uvG6fsFPOr9ynFpGaTMk4t5XTX7Z_Q,1759 pip/_internal/utils/virtualenv.py,sha256=S6f7csYorRpiD6cvn3jISZYc3I8PJC43H5iMFpRAEDU,3456 pip/_internal/utils/wheel.py,sha256=lXOgZyTlOm5HmK8tw5iw0A3_5A6wRzsXHOaQkIvvloU,4549 pip/_internal/vcs/__init__.py,sha256=UAqvzpbi0VbZo3Ub6skEeZAw-ooIZR-zX_WpCbxyCoU,596 pip/_internal/vcs/bazaar.py,sha256=j0oin0fpGRHcCFCxEcpPCQoFEvA-DMLULKdGP8Nv76o,3519 pip/_internal/vcs/git.py,sha256=CeKBGJnl6uskvvjkAUXrJVxbHJrpS_B_pyfFdjL3CRc,18121 pip/_internal/vcs/mercurial.py,sha256=ytRnzmP5CkLM2RfdiS4mVJx4jQcmB3FjXeLOPPFEjG8,5246 pip/_internal/vcs/subversion.py,sha256=vhZs8L-TNggXqM1bbhl-FpbxE3TrIB6Tgnx8fh3S2HE,11729 pip/_internal/vcs/versioncontrol.py,sha256=KUOc-hN51em9jrqxKwUR3JnkgSE-xSOqMiiJcSaL6B8,22811 pip/_vendor/__init__.py,sha256=U51NPwXdA-wXOiANIQncYjcMp6txgeOL5nHxksJeyas,4993 pip/_vendor/six.py,sha256=TOOfQi7nFGfMrIvtdr6wX4wyHH8M7aknmuLfo2cBBrM,34549 pip/_vendor/typing_extensions.py,sha256=EWpcpyQnVmc48E9fSyPGs-vXgHcAk9tQABQIxmMsCGk,111130 pip/_vendor/vendor.txt,sha256=epuLpe-n1shCqP5BzC97iMIAIeOeDHdtNKFgcxax-9A,493 pip/_vendor/cachecontrol/__init__.py,sha256=ctHagMhQXuvQDdm4TirZrwDOT5H8oBNAJqzdKI6sovk,676 pip/_vendor/cachecontrol/_cmd.py,sha256=iist2EpzJvDVIhMAxXq8iFnTBsiZAd6iplxfmNboNyk,1737 pip/_vendor/cachecontrol/adapter.py,sha256=_CcWvUP9048qAZjsNqViaHbdcLs9mmFNixVfpO7oebE,6392 pip/_vendor/cachecontrol/cache.py,sha256=OTQj72tUf8C1uEgczdl3Gc8vkldSzsTITKtDGKMx4z8,1952 pip/_vendor/cachecontrol/controller.py,sha256=keCFA3ZaNVaWTwHd6F1zqWhb4vyvNx_UvZuo5iIYMfo,18384 pip/_vendor/cachecontrol/filewrapper.py,sha256=STttGmIPBvZzt2b51dUOwoWX5crcMCpKZOisM3f5BNc,4292 pip/_vendor/cachecontrol/heuristics.py,sha256=fdFbk9W8IeLrjteIz_fK4mj2HD_Y7COXF2Uc8TgjT1c,4828 pip/_vendor/cachecontrol/serialize.py,sha256=0dHeMaDwysVAAnGVlhMOP4tDliohgNK0Jxk_zsOiWxw,7173 pip/_vendor/cachecontrol/wrapper.py,sha256=hsGc7g8QGQTT-4f8tgz3AM5qwScg6FO0BSdLSRdEvpU,1417 pip/_vendor/cachecontrol/caches/__init__.py,sha256=dtrrroK5BnADR1GWjCZ19aZ0tFsMfvFBtLQQU1sp_ag,303 pip/_vendor/cachecontrol/caches/file_cache.py,sha256=3z8AWKD-vfKeiJqIzLmJyIYtR2yd6Tsh3u1TyLRQoIQ,5352 pip/_vendor/cachecontrol/caches/redis_cache.py,sha256=9rmqwtYu_ljVkW6_oLqbC7EaX_a8YT_yLuna-eS0dgo,1386 pip/_vendor/certifi/__init__.py,sha256=L_j-d0kYuA_MzA2_2hraF1ovf6KT6DTquRdV3paQwOk,94 pip/_vendor/certifi/__main__.py,sha256=1k3Cr95vCxxGRGDljrW3wMdpZdL3Nhf0u1n-k2qdsCY,255 pip/_vendor/certifi/cacert.pem,sha256=eU0Dn_3yd8BH4m8sfVj4Glhl2KDrcCSg-sEWT-pNJ88,281617 pip/_vendor/certifi/core.py,sha256=ZwiOsv-sD_ouU1ft8wy_xZ3LQ7UbcVzyqj2XNyrsZis,4279 pip/_vendor/chardet/__init__.py,sha256=57R-HSxj0PWmILMN0GFmUNqEMfrEVSamXyjD-W6_fbs,4797 pip/_vendor/chardet/big5freq.py,sha256=ltcfP-3PjlNHCoo5e4a7C4z-2DhBTXRfY6jbMbB7P30,31274 pip/_vendor/chardet/big5prober.py,sha256=lPMfwCX6v2AaPgvFh_cSWZcgLDbWiFCHLZ_p9RQ9uxE,1763 pip/_vendor/chardet/chardistribution.py,sha256=13B8XUG4oXDuLdXvfbIWwLFeR-ZU21AqTS1zcdON8bU,10032 pip/_vendor/chardet/charsetgroupprober.py,sha256=UKK3SaIZB2PCdKSIS0gnvMtLR9JJX62M-fZJu3OlWyg,3915 pip/_vendor/chardet/charsetprober.py,sha256=L3t8_wIOov8em-vZWOcbkdsrwe43N6_gqNh5pH7WPd4,5420 pip/_vendor/chardet/codingstatemachine.py,sha256=K7k69sw3jY5DmTXoSJQVsUtFIQKYPQVOSJJhBuGv_yE,3732 pip/_vendor/chardet/codingstatemachinedict.py,sha256=0GY3Hi2qIZvDrOOJ3AtqppM1RsYxr_66ER4EHjuMiMc,542 pip/_vendor/chardet/cp949prober.py,sha256=0jKRV7fECuWI16rNnks0ZECKA1iZYCIEaP8A1ZvjUSI,1860 pip/_vendor/chardet/enums.py,sha256=TzECiZoCKNMqgwU76cPCeKWFBqaWvAdLMev5_bCkhY8,1683 pip/_vendor/chardet/escprober.py,sha256=Kho48X65xE0scFylIdeJjM2bcbvRvv0h0WUbMWrJD3A,4006 pip/_vendor/chardet/escsm.py,sha256=AqyXpA2FQFD7k-buBty_7itGEYkhmVa8X09NLRul3QM,12176 pip/_vendor/chardet/eucjpprober.py,sha256=5KYaM9fsxkRYzw1b5k0fL-j_-ezIw-ij9r97a9MHxLY,3934 pip/_vendor/chardet/euckrfreq.py,sha256=3mHuRvXfsq_QcQysDQFb8qSudvTiol71C6Ic2w57tKM,13566 pip/_vendor/chardet/euckrprober.py,sha256=hiFT6wM174GIwRvqDsIcuOc-dDsq2uPKMKbyV8-1Xnc,1753 pip/_vendor/chardet/euctwfreq.py,sha256=2alILE1Lh5eqiFJZjzRkMQXolNJRHY5oBQd-vmZYFFM,36913 pip/_vendor/chardet/euctwprober.py,sha256=NxbpNdBtU0VFI0bKfGfDkpP7S2_8_6FlO87dVH0ogws,1753 pip/_vendor/chardet/gb2312freq.py,sha256=49OrdXzD-HXqwavkqjo8Z7gvs58hONNzDhAyMENNkvY,20735 pip/_vendor/chardet/gb2312prober.py,sha256=KPEBueaSLSvBpFeINMu0D6TgHcR90e5PaQawifzF4o0,1759 pip/_vendor/chardet/hebrewprober.py,sha256=96T_Lj_OmW-fK7JrSHojYjyG3fsGgbzkoTNleZ3kfYE,14537 pip/_vendor/chardet/jisfreq.py,sha256=mm8tfrwqhpOd3wzZKS4NJqkYBQVcDfTM2JiQ5aW932E,25796 pip/_vendor/chardet/johabfreq.py,sha256=dBpOYG34GRX6SL8k_LbS9rxZPMjLjoMlgZ03Pz5Hmqc,42498 pip/_vendor/chardet/johabprober.py,sha256=O1Qw9nVzRnun7vZp4UZM7wvJSv9W941mEU9uDMnY3DU,1752 pip/_vendor/chardet/jpcntx.py,sha256=uhHrYWkLxE_rF5OkHKInm0HUsrjgKHHVQvtt3UcvotA,27055 pip/_vendor/chardet/langbulgarianmodel.py,sha256=vmbvYFP8SZkSxoBvLkFqKiH1sjma5ihk3PTpdy71Rr4,104562 pip/_vendor/chardet/langgreekmodel.py,sha256=JfB7bupjjJH2w3X_mYnQr9cJA_7EuITC2cRW13fUjeI,98484 pip/_vendor/chardet/langhebrewmodel.py,sha256=3HXHaLQPNAGcXnJjkIJfozNZLTvTJmf4W5Awi6zRRKc,98196 pip/_vendor/chardet/langhungarianmodel.py,sha256=WxbeQIxkv8YtApiNqxQcvj-tMycsoI4Xy-fwkDHpP_Y,101363 pip/_vendor/chardet/langrussianmodel.py,sha256=s395bTZ87ESTrZCOdgXbEjZ9P1iGPwCl_8xSsac_DLY,128035 pip/_vendor/chardet/langthaimodel.py,sha256=7bJlQitRpTnVGABmbSznHnJwOHDy3InkTvtFUx13WQI,102774 pip/_vendor/chardet/langturkishmodel.py,sha256=XY0eGdTIy4eQ9Xg1LVPZacb-UBhHBR-cq0IpPVHowKc,95372 pip/_vendor/chardet/latin1prober.py,sha256=p15EEmFbmQUwbKLC7lOJVGHEZwcG45ubEZYTGu01J5g,5380 pip/_vendor/chardet/macromanprober.py,sha256=9anfzmY6TBfUPDyBDOdY07kqmTHpZ1tK0jL-p1JWcOY,6077 pip/_vendor/chardet/mbcharsetprober.py,sha256=Wr04WNI4F3X_VxEverNG-H25g7u-MDDKlNt-JGj-_uU,3715 pip/_vendor/chardet/mbcsgroupprober.py,sha256=iRpaNBjV0DNwYPu_z6TiHgRpwYahiM7ztI_4kZ4Uz9A,2131 pip/_vendor/chardet/mbcssm.py,sha256=hUtPvDYgWDaA2dWdgLsshbwRfm3Q5YRlRogdmeRUNQw,30391 pip/_vendor/chardet/resultdict.py,sha256=ez4FRvN5KaSosJeJ2WzUyKdDdg35HDy_SSLPXKCdt5M,402 pip/_vendor/chardet/sbcharsetprober.py,sha256=-nd3F90i7GpXLjehLVHqVBE0KlWzGvQUPETLBNn4o6U,6400 pip/_vendor/chardet/sbcsgroupprober.py,sha256=gcgI0fOfgw_3YTClpbra_MNxwyEyJ3eUXraoLHYb59E,4137 pip/_vendor/chardet/sjisprober.py,sha256=aqQufMzRw46ZpFlzmYaYeT2-nzmKb-hmcrApppJ862k,4007 pip/_vendor/chardet/universaldetector.py,sha256=xYBrg4x0dd9WnT8qclfADVD9ondrUNkqPmvte1pa520,14848 pip/_vendor/chardet/utf1632prober.py,sha256=pw1epGdMj1hDGiCu1AHqqzOEfjX8MVdiW7O1BlT8-eQ,8505 pip/_vendor/chardet/utf8prober.py,sha256=8m08Ub5490H4jQ6LYXvFysGtgKoKsHUd2zH_i8_TnVw,2812 pip/_vendor/chardet/version.py,sha256=lGtJcxGM44Qz4Cbk4rbbmrKxnNr1-97U25TameLehZw,244 pip/_vendor/chardet/cli/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pip/_vendor/chardet/cli/chardetect.py,sha256=zibMVg5RpKb-ME9_7EYG4ZM2Sf07NHcQzZ12U-rYJho,3242 pip/_vendor/chardet/metadata/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pip/_vendor/chardet/metadata/languages.py,sha256=FhvBIdZFxRQ-dTwkb_0madRKgVBCaUMQz9I5xqjE5iQ,13560 pip/_vendor/colorama/__init__.py,sha256=wePQA4U20tKgYARySLEC047ucNX-g8pRLpYBuiHlLb8,266 pip/_vendor/colorama/ansi.py,sha256=Top4EeEuaQdBWdteKMEcGOTeKeF19Q-Wo_6_Cj5kOzQ,2522 pip/_vendor/colorama/ansitowin32.py,sha256=vPNYa3OZbxjbuFyaVo0Tmhmy1FZ1lKMWCnT7odXpItk,11128 pip/_vendor/colorama/initialise.py,sha256=-hIny86ClXo39ixh5iSCfUIa2f_h_bgKRDW7gqs-KLU,3325 pip/_vendor/colorama/win32.py,sha256=YQOKwMTwtGBbsY4dL5HYTvwTeP9wIQra5MvPNddpxZs,6181 pip/_vendor/colorama/winterm.py,sha256=XCQFDHjPi6AHYNdZwy0tA02H-Jh48Jp-HvCjeLeLp3U,7134 pip/_vendor/colorama/tests/__init__.py,sha256=MkgPAEzGQd-Rq0w0PZXSX2LadRWhUECcisJY8lSrm4Q,75 pip/_vendor/colorama/tests/ansi_test.py,sha256=FeViDrUINIZcr505PAxvU4AjXz1asEiALs9GXMhwRaE,2839 pip/_vendor/colorama/tests/ansitowin32_test.py,sha256=RN7AIhMJ5EqDsYaCjVo-o4u8JzDD4ukJbmevWKS70rY,10678 pip/_vendor/colorama/tests/initialise_test.py,sha256=BbPy-XfyHwJ6zKozuQOvNvQZzsx9vdb_0bYXn7hsBTc,6741 pip/_vendor/colorama/tests/isatty_test.py,sha256=Pg26LRpv0yQDB5Ac-sxgVXG7hsA1NYvapFgApZfYzZg,1866 pip/_vendor/colorama/tests/utils.py,sha256=1IIRylG39z5-dzq09R_ngufxyPZxgldNbrxKxUGwGKE,1079 pip/_vendor/colorama/tests/winterm_test.py,sha256=qoWFPEjym5gm2RuMwpf3pOis3a5r_PJZFCzK254JL8A,3709 pip/_vendor/distlib/__init__.py,sha256=acgfseOC55dNrVAzaBKpUiH3Z6V7Q1CaxsiQ3K7pC-E,581 pip/_vendor/distlib/compat.py,sha256=tfoMrj6tujk7G4UC2owL6ArgDuCKabgBxuJRGZSmpko,41259 pip/_vendor/distlib/database.py,sha256=o_mw0fAr93NDAHHHfqG54Y1Hi9Rkfrp2BX15XWZYK50,51697 pip/_vendor/distlib/index.py,sha256=HFiDG7LMoaBs829WuotrfIwcErOOExUOR_AeBtw_TCU,20834 pip/_vendor/distlib/locators.py,sha256=wNzG-zERzS_XGls-nBPVVyLRHa2skUlkn0-5n0trMWA,51991 pip/_vendor/distlib/manifest.py,sha256=nQEhYmgoreaBZzyFzwYsXxJARu3fo4EkunU163U16iE,14811 pip/_vendor/distlib/markers.py,sha256=TpHHHLgkzyT7YHbwj-2i6weRaq-Ivy2-MUnrDkjau-U,5058 pip/_vendor/distlib/metadata.py,sha256=g_DIiu8nBXRzA-mWPRpatHGbmFZqaFoss7z9TG7QSUU,39801 pip/_vendor/distlib/resources.py,sha256=LwbPksc0A1JMbi6XnuPdMBUn83X7BPuFNWqPGEKI698,10820 pip/_vendor/distlib/scripts.py,sha256=BmkTKmiTk4m2cj-iueliatwz3ut_9SsABBW51vnQnZU,18102 pip/_vendor/distlib/t32.exe,sha256=a0GV5kCoWsMutvliiCKmIgV98eRZ33wXoS-XrqvJQVs,97792 pip/_vendor/distlib/t64-arm.exe,sha256=68TAa32V504xVBnufojh0PcenpR3U4wAqTqf-MZqbPw,182784 pip/_vendor/distlib/t64.exe,sha256=gaYY8hy4fbkHYTTnA4i26ct8IQZzkBG2pRdy0iyuBrc,108032 pip/_vendor/distlib/util.py,sha256=31dPXn3Rfat0xZLeVoFpuniyhe6vsbl9_QN-qd9Lhlk,66262 pip/_vendor/distlib/version.py,sha256=WG__LyAa2GwmA6qSoEJtvJE8REA1LZpbSizy8WvhJLk,23513 pip/_vendor/distlib/w32.exe,sha256=R4csx3-OGM9kL4aPIzQKRo5TfmRSHZo6QWyLhDhNBks,91648 pip/_vendor/distlib/w64-arm.exe,sha256=xdyYhKj0WDcVUOCb05blQYvzdYIKMbmJn2SZvzkcey4,168448 pip/_vendor/distlib/w64.exe,sha256=ejGf-rojoBfXseGLpya6bFTFPWRG21X5KvU8J5iU-K0,101888 pip/_vendor/distlib/wheel.py,sha256=Rgqs658VsJ3R2845qwnZD8XQryV2CzWw2mghwLvxxsI,43898 pip/_vendor/distro/__init__.py,sha256=2fHjF-SfgPvjyNZ1iHh_wjqWdR_Yo5ODHwZC0jLBPhc,981 pip/_vendor/distro/__main__.py,sha256=bu9d3TifoKciZFcqRBuygV3GSuThnVD_m2IK4cz96Vs,64 pip/_vendor/distro/distro.py,sha256=UZO1LjIhtFCMdlbiz39gj3raV-Amf3SBwzGzfApiMHw,49330 pip/_vendor/idna/__init__.py,sha256=KJQN1eQBr8iIK5SKrJ47lXvxG0BJ7Lm38W4zT0v_8lk,849 pip/_vendor/idna/codec.py,sha256=6ly5odKfqrytKT9_7UrlGklHnf1DSK2r9C6cSM4sa28,3374 pip/_vendor/idna/compat.py,sha256=0_sOEUMT4CVw9doD3vyRhX80X19PwqFoUBs7gWsFME4,321 pip/_vendor/idna/core.py,sha256=1JxchwKzkxBSn7R_oCE12oBu3eVux0VzdxolmIad24M,12950 pip/_vendor/idna/idnadata.py,sha256=xUjqKqiJV8Ho_XzBpAtv5JFoVPSupK-SUXvtjygUHqw,44375 pip/_vendor/idna/intranges.py,sha256=YBr4fRYuWH7kTKS2tXlFjM24ZF1Pdvcir-aywniInqg,1881 pip/_vendor/idna/package_data.py,sha256=C_jHJzmX8PI4xq0jpzmcTMxpb5lDsq4o5VyxQzlVrZE,21 pip/_vendor/idna/uts46data.py,sha256=zvjZU24s58_uAS850Mcd0NnD0X7_gCMAMjzWNIeUJdc,206539 pip/_vendor/msgpack/__init__.py,sha256=hyGhlnmcJkxryJBKC3X5FnEph375kQoL_mG8LZUuXgY,1132 pip/_vendor/msgpack/exceptions.py,sha256=dCTWei8dpkrMsQDcjQk74ATl9HsIBH0ybt8zOPNqMYc,1081 pip/_vendor/msgpack/ext.py,sha256=C5MK8JhVYGYFWPvxsORsqZAnvOXefYQ57m1Ym0luW5M,6079 pip/_vendor/msgpack/fallback.py,sha256=tvNBHyxxFbuVlC8GZShETClJxjLiDMOja4XwwyvNm2g,34544 pip/_vendor/packaging/__about__.py,sha256=ugASIO2w1oUyH8_COqQ2X_s0rDhjbhQC3yJocD03h2c,661 pip/_vendor/packaging/__init__.py,sha256=b9Kk5MF7KxhhLgcDmiUWukN-LatWFxPdNug0joPhHSk,497 pip/_vendor/packaging/_manylinux.py,sha256=XcbiXB-qcjv3bcohp6N98TMpOP4_j3m-iOA8ptK2GWY,11488 pip/_vendor/packaging/_musllinux.py,sha256=_KGgY_qc7vhMGpoqss25n2hiLCNKRtvz9mCrS7gkqyc,4378 pip/_vendor/packaging/_structures.py,sha256=q3eVNmbWJGG_S0Dit_S3Ao8qQqz_5PYTXFAKBZe5yr4,1431 pip/_vendor/packaging/markers.py,sha256=AJBOcY8Oq0kYc570KuuPTkvuqjAlhufaE2c9sCUbm64,8487 pip/_vendor/packaging/requirements.py,sha256=NtDlPBtojpn1IUC85iMjPNsUmufjpSlwnNA-Xb4m5NA,4676 pip/_vendor/packaging/specifiers.py,sha256=LRQ0kFsHrl5qfcFNEEJrIFYsnIHQUJXY9fIsakTrrqE,30110 pip/_vendor/packaging/tags.py,sha256=lmsnGNiJ8C4D_Pf9PbM0qgbZvD9kmB9lpZBQUZa3R_Y,15699 pip/_vendor/packaging/utils.py,sha256=dJjeat3BS-TYn1RrUFVwufUMasbtzLfYRoy_HXENeFQ,4200 pip/_vendor/packaging/version.py,sha256=_fLRNrFrxYcHVfyo8vk9j8s6JM8N_xsSxVFr6RJyco8,14665 pip/_vendor/pkg_resources/__init__.py,sha256=hTAeJCNYb7dJseIDVsYK3mPQep_gphj4tQh-bspX8bg,109364 pip/_vendor/platformdirs/__init__.py,sha256=SkhEYVyC_HUHC6KX7n4M_6coyRMtEB38QMyOYIAX6Yk,20155 pip/_vendor/platformdirs/__main__.py,sha256=fVvSiTzr2-RM6IsjWjj4fkaOtDOgDhUWv6sA99do4CQ,1476 pip/_vendor/platformdirs/android.py,sha256=y_EEMKwYl2-bzYBDovksSn8m76on0Lda8eyJksVQE9U,7211 pip/_vendor/platformdirs/api.py,sha256=jWtX06jAJytYrkJDOqEls97mCkyHRSZkoqUlbMK5Qew,7132 pip/_vendor/platformdirs/macos.py,sha256=LueVOoVgGWDBwQb8OFwXkVKfVn33CM1Lkwf1-A86tRQ,3678 pip/_vendor/platformdirs/unix.py,sha256=22JhR8ZY0aLxSVCFnKrc6f1iz6Gv42K24Daj7aTjfSg,8809 pip/_vendor/platformdirs/version.py,sha256=mavZTQIJIXfdewEaSTn7EWrNfPZWeRofb-74xqW5f2M,160 pip/_vendor/platformdirs/windows.py,sha256=4TtbPGoWG2PRgI11uquDa7eRk8TcxvnUNuuMGZItnXc,9573 pip/_vendor/pygments/__init__.py,sha256=6AuDljQtvf89DTNUyWM7k3oUlP_lq70NU-INKKteOBY,2983 pip/_vendor/pygments/__main__.py,sha256=es8EKMvXj5yToIfQ-pf3Dv5TnIeeM6sME0LW-n4ecHo,353 pip/_vendor/pygments/cmdline.py,sha256=byxYJp9gnjVeyhRlZ3UTMgo_LhkXh1afvN8wJBtAcc8,23685 pip/_vendor/pygments/console.py,sha256=2wZ5W-U6TudJD1_NLUwjclMpbomFM91lNv11_60sfGY,1697 pip/_vendor/pygments/filter.py,sha256=j5aLM9a9wSx6eH1oy473oSkJ02hGWNptBlVo4s1g_30,1938 pip/_vendor/pygments/formatter.py,sha256=J9OL9hXLJKZk7moUgKwpjW9HNf4WlJFg_o_-Z_S_tTY,4178 pip/_vendor/pygments/lexer.py,sha256=2BpqLlT2ExvOOi7vnjK5nB4Fp-m52ldiPaXMox5uwug,34618 pip/_vendor/pygments/modeline.py,sha256=eF2vO4LpOGoPvIKKkbPfnyut8hT4UiebZPpb-BYGQdI,986 pip/_vendor/pygments/plugin.py,sha256=j1Fh310RbV2DQ9nvkmkqvlj38gdyuYKllLnGxbc8sJM,2591 pip/_vendor/pygments/regexopt.py,sha256=jg1ALogcYGU96TQS9isBl6dCrvw5y5--BP_K-uFk_8s,3072 pip/_vendor/pygments/scanner.py,sha256=b_nu5_f3HCgSdp5S_aNRBQ1MSCm4ZjDwec2OmTRickw,3092 pip/_vendor/pygments/sphinxext.py,sha256=wBFYm180qea9JKt__UzhRlNRNhczPDFDaqGD21sbuso,6882 pip/_vendor/pygments/style.py,sha256=C4qyoJrUTkq-OV3iO-8Vz3UtWYpJwSTdh5_vlGCGdNQ,6257 pip/_vendor/pygments/token.py,sha256=seNsmcch9OEHXYirh8Ool7w8xDhfNTbLj5rHAC-gc_o,6184 pip/_vendor/pygments/unistring.py,sha256=FaUfG14NBJEKLQoY9qj6JYeXrpYcLmKulghdxOGFaOc,63223 pip/_vendor/pygments/util.py,sha256=AEVY0qonyyEMgv4Do2dINrrqUAwUk2XYSqHM650uzek,10230 pip/_vendor/pygments/filters/__init__.py,sha256=h_koYkUFo-FFUxjs564JHUAz7O3yJpVwI6fKN3MYzG0,40386 pip/_vendor/pygments/formatters/__init__.py,sha256=_xgAcdFKr0QNYwh_i98AU9hvfP3X2wAkhElFcRRF3Uo,5424 pip/_vendor/pygments/formatters/_mapping.py,sha256=1Cw37FuQlNacnxRKmtlPX4nyLoX9_ttko5ZwscNUZZ4,4176 pip/_vendor/pygments/formatters/bbcode.py,sha256=r1b7wzWTJouADDLh-Z11iRi4iQxD0JKJ1qHl6mOYxsA,3314 pip/_vendor/pygments/formatters/groff.py,sha256=xy8Zf3tXOo6MWrXh7yPGWx3lVEkg_DhY4CxmsDb0IVo,5094 pip/_vendor/pygments/formatters/html.py,sha256=PIzAyilNqaTzSSP2slDG2VDLE3qNioWy2rgtSSoviuI,35610 pip/_vendor/pygments/formatters/img.py,sha256=XKXmg2_XONrR4mtq2jfEU8XCsoln3VSGTw-UYiEokys,21938 pip/_vendor/pygments/formatters/irc.py,sha256=Ep-m8jd3voFO6Fv57cUGFmz6JVA67IEgyiBOwv0N4a0,4981 pip/_vendor/pygments/formatters/latex.py,sha256=FGzJ-YqSTE8z_voWPdzvLY5Tq8jE_ygjGjM6dXZJ8-k,19351 pip/_vendor/pygments/formatters/other.py,sha256=gPxkk5BdAzWTCgbEHg1lpLi-1F6ZPh5A_aotgLXHnzg,5073 pip/_vendor/pygments/formatters/pangomarkup.py,sha256=6LKnQc8yh49f802bF0sPvbzck4QivMYqqoXAPaYP8uU,2212 pip/_vendor/pygments/formatters/rtf.py,sha256=aA0v_psW6KZI3N18TKDifxeL6mcF8EDXcPXDWI4vhVQ,5014 pip/_vendor/pygments/formatters/svg.py,sha256=dQONWypbzfvzGCDtdp3M_NJawScJvM2DiHbx1k-ww7g,7335 pip/_vendor/pygments/formatters/terminal.py,sha256=FG-rpjRpFmNpiGB4NzIucvxq6sQIXB3HOTo2meTKtrU,4674 pip/_vendor/pygments/formatters/terminal256.py,sha256=13SJ3D5pFdqZ9zROE6HbWnBDwHvOGE8GlsmqGhprRp4,11753 pip/_vendor/pygments/lexers/__init__.py,sha256=j5KEi5O_VQ5GS59H49l-10gzUOkWKxlwGeVMlGO2MMk,12130 pip/_vendor/pygments/lexers/_mapping.py,sha256=Hts4r_ZQ8icftGM7gkBPeED5lyVSv4affFgXYE6Ap04,72281 pip/_vendor/pygments/lexers/python.py,sha256=c7jnmKFU9DLxTJW0UbwXt6Z9FJqbBlVsWA1Qr9xSA_w,53424 pip/_vendor/pygments/styles/__init__.py,sha256=he7HjQx7sC0d2kfTVLjUs0J15mtToJM6M1brwIm9--Q,3700 pip/_vendor/pyparsing/__init__.py,sha256=9m1JbE2JTLdBG0Mb6B0lEaZj181Wx5cuPXZpsbHEYgE,9116 pip/_vendor/pyparsing/actions.py,sha256=05uaIPOznJPQ7VgRdmGCmG4sDnUPtwgv5qOYIqbL2UY,6567 pip/_vendor/pyparsing/common.py,sha256=p-3c83E5-DjlkF35G0O9-kjQRpoejP-2_z0hxZ-eol4,13387 pip/_vendor/pyparsing/core.py,sha256=yvuRlLpXSF8mgk-QhiW3OVLqD9T0rsj9tbibhRH4Yaw,224445 pip/_vendor/pyparsing/exceptions.py,sha256=6Jc6W1eDZBzyFu1J0YrcdNFVBC-RINujZmveSnB8Rxw,9523 pip/_vendor/pyparsing/helpers.py,sha256=BZJHCA8SS0pYio30KGQTc9w2qMOaK4YpZ7hcvHbnTgk,38646 pip/_vendor/pyparsing/results.py,sha256=9dyqQ-w3MjfmxWbFt8KEPU6IfXeyRdoWp2Og802rUQY,26692 pip/_vendor/pyparsing/testing.py,sha256=eJncg0p83zm1FTPvM9auNT6oavIvXaibmRFDf1qmwkY,13488 pip/_vendor/pyparsing/unicode.py,sha256=fAPdsJiARFbkPAih6NkYry0dpj4jPqelGVMlE4wWFW8,10646 pip/_vendor/pyparsing/util.py,sha256=vTMzTdwSDyV8d_dSgquUTdWgBFoA_W30nfxEJDsshRQ,8670 pip/_vendor/pyparsing/diagram/__init__.py,sha256=nxmDOoYF9NXuLaGYy01tKFjkNReWJlrGFuJNWEiTo84,24215 pip/_vendor/pyproject_hooks/__init__.py,sha256=kCehmy0UaBa9oVMD7ZIZrnswfnP3LXZ5lvnNJAL5JBM,491 pip/_vendor/pyproject_hooks/_compat.py,sha256=by6evrYnqkisiM-MQcvOKs5bgDMzlOSgZqRHNqf04zE,138 pip/_vendor/pyproject_hooks/_impl.py,sha256=61GJxzQip0IInhuO69ZI5GbNQ82XEDUB_1Gg5_KtUoc,11920 pip/_vendor/pyproject_hooks/_in_process/__init__.py,sha256=9gQATptbFkelkIy0OfWFEACzqxXJMQDWCH9rBOAZVwQ,546 pip/_vendor/pyproject_hooks/_in_process/_in_process.py,sha256=m2b34c917IW5o-Q_6TYIHlsK9lSUlNiyrITTUH_zwew,10927 pip/_vendor/requests/__init__.py,sha256=owujob4dk45Siy4EYtbCKR6wcFph7E04a_v_OuAacBA,5169 pip/_vendor/requests/__version__.py,sha256=ssI3Ezt7PaxgkOW45GhtwPUclo_SO_ygtIm4A74IOfw,435 pip/_vendor/requests/_internal_utils.py,sha256=nMQymr4hs32TqVo5AbCrmcJEhvPUh7xXlluyqwslLiQ,1495 pip/_vendor/requests/adapters.py,sha256=idj6cZcId3L5xNNeJ7ieOLtw3awJk5A64xUfetHwq3M,19697 pip/_vendor/requests/api.py,sha256=q61xcXq4tmiImrvcSVLTbFyCiD2F-L_-hWKGbz4y8vg,6449 pip/_vendor/requests/auth.py,sha256=h-HLlVx9j8rKV5hfSAycP2ApOSglTz77R0tz7qCbbEE,10187 pip/_vendor/requests/certs.py,sha256=PVPooB0jP5hkZEULSCwC074532UFbR2Ptgu0I5zwmCs,575 pip/_vendor/requests/compat.py,sha256=IhK9quyX0RRuWTNcg6d2JGSAOUbM6mym2p_2XjLTwf4,1286 pip/_vendor/requests/cookies.py,sha256=kD3kNEcCj-mxbtf5fJsSaT86eGoEYpD3X0CSgpzl7BM,18560 pip/_vendor/requests/exceptions.py,sha256=FA-_kVwBZ2jhXauRctN_ewHVK25b-fj0Azyz1THQ0Kk,3823 pip/_vendor/requests/help.py,sha256=FnAAklv8MGm_qb2UilDQgS6l0cUttiCFKUjx0zn2XNA,3879 pip/_vendor/requests/hooks.py,sha256=CiuysiHA39V5UfcCBXFIx83IrDpuwfN9RcTUgv28ftQ,733 pip/_vendor/requests/models.py,sha256=dDZ-iThotky-Noq9yy97cUEJhr3wnY6mv-xR_ePg_lk,35288 pip/_vendor/requests/packages.py,sha256=njJmVifY4aSctuW3PP5EFRCxjEwMRDO6J_feG2dKWsI,695 pip/_vendor/requests/sessions.py,sha256=-LvTzrPtetSTrR3buxu4XhdgMrJFLB1q5D7P--L2Xhw,30373 pip/_vendor/requests/status_codes.py,sha256=FvHmT5uH-_uimtRz5hH9VCbt7VV-Nei2J9upbej6j8g,4235 pip/_vendor/requests/structures.py,sha256=-IbmhVz06S-5aPSZuUthZ6-6D9XOjRuTXHOabY041XM,2912 pip/_vendor/requests/utils.py,sha256=kOPn0qYD6xRTzaxbqTdYiSInBZHl6379AJsyIgzYGLY,33460 pip/_vendor/resolvelib/__init__.py,sha256=h509TdEcpb5-44JonaU3ex2TM15GVBLjM9CNCPwnTTs,537 pip/_vendor/resolvelib/providers.py,sha256=fuuvVrCetu5gsxPB43ERyjfO8aReS3rFQHpDgiItbs4,5871 pip/_vendor/resolvelib/reporters.py,sha256=TSbRmWzTc26w0ggsV1bxVpeWDB8QNIre6twYl7GIZBE,1601 pip/_vendor/resolvelib/resolvers.py,sha256=G8rsLZSq64g5VmIq-lB7UcIJ1gjAxIQJmTF4REZleQ0,20511 pip/_vendor/resolvelib/structs.py,sha256=0_1_XO8z_CLhegP3Vpf9VJ3zJcfLm0NOHRM-i0Ykz3o,4963 pip/_vendor/resolvelib/compat/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pip/_vendor/resolvelib/compat/collections_abc.py,sha256=uy8xUZ-NDEw916tugUXm8HgwCGiMO0f-RcdnpkfXfOs,156 pip/_vendor/rich/__init__.py,sha256=dRxjIL-SbFVY0q3IjSMrfgBTHrm1LZDgLOygVBwiYZc,6090 pip/_vendor/rich/__main__.py,sha256=TT8sb9PTnsnKhhrGuHkLN0jdN0dtKhtPkEr9CidDbPM,8478 pip/_vendor/rich/_cell_widths.py,sha256=2n4EiJi3X9sqIq0O16kUZ_zy6UYMd3xFfChlKfnW1Hc,10096 pip/_vendor/rich/_emoji_codes.py,sha256=hu1VL9nbVdppJrVoijVshRlcRRe_v3dju3Mmd2sKZdY,140235 pip/_vendor/rich/_emoji_replace.py,sha256=n-kcetsEUx2ZUmhQrfeMNc-teeGhpuSQ5F8VPBsyvDo,1064 pip/_vendor/rich/_export_format.py,sha256=qxgV3nKnXQu1hfbnRVswPYy-AwIg1X0LSC47cK5s8jk,2100 pip/_vendor/rich/_extension.py,sha256=Xt47QacCKwYruzjDi-gOBq724JReDj9Cm9xUi5fr-34,265 pip/_vendor/rich/_fileno.py,sha256=HWZxP5C2ajMbHryvAQZseflVfQoGzsKOHzKGsLD8ynQ,799 pip/_vendor/rich/_inspect.py,sha256=oZJGw31e64dwXSCmrDnvZbwVb1ZKhWfU8wI3VWohjJk,9695 pip/_vendor/rich/_log_render.py,sha256=1ByI0PA1ZpxZY3CGJOK54hjlq4X-Bz_boIjIqCd8Kns,3225 pip/_vendor/rich/_loop.py,sha256=hV_6CLdoPm0va22Wpw4zKqM0RYsz3TZxXj0PoS-9eDQ,1236 pip/_vendor/rich/_null_file.py,sha256=tGSXk_v-IZmbj1GAzHit8A3kYIQMiCpVsCFfsC-_KJ4,1387 pip/_vendor/rich/_palettes.py,sha256=cdev1JQKZ0JvlguV9ipHgznTdnvlIzUFDBb0It2PzjI,7063 pip/_vendor/rich/_pick.py,sha256=evDt8QN4lF5CiwrUIXlOJCntitBCOsI3ZLPEIAVRLJU,423 pip/_vendor/rich/_ratio.py,sha256=2lLSliL025Y-YMfdfGbutkQDevhcyDqc-DtUYW9mU70,5472 pip/_vendor/rich/_spinners.py,sha256=U2r1_g_1zSjsjiUdAESc2iAMc3i4ri_S8PYP6kQ5z1I,19919 pip/_vendor/rich/_stack.py,sha256=-C8OK7rxn3sIUdVwxZBBpeHhIzX0eI-VM3MemYfaXm0,351 pip/_vendor/rich/_timer.py,sha256=zelxbT6oPFZnNrwWPpc1ktUeAT-Vc4fuFcRZLQGLtMI,417 pip/_vendor/rich/_win32_console.py,sha256=P0vxI2fcndym1UU1S37XAzQzQnkyY7YqAKmxm24_gug,22820 pip/_vendor/rich/_windows.py,sha256=dvNl9TmfPzNVxiKk5WDFihErZ5796g2UC9-KGGyfXmk,1926 pip/_vendor/rich/_windows_renderer.py,sha256=t74ZL3xuDCP3nmTp9pH1L5LiI2cakJuQRQleHCJerlk,2783 pip/_vendor/rich/_wrap.py,sha256=xfV_9t0Sg6rzimmrDru8fCVmUlalYAcHLDfrJZnbbwQ,1840 pip/_vendor/rich/abc.py,sha256=ON-E-ZqSSheZ88VrKX2M3PXpFbGEUUZPMa_Af0l-4f0,890 pip/_vendor/rich/align.py,sha256=Ji-Yokfkhnfe_xMmr4ISjZB07TJXggBCOYoYa-HDAr8,10368 pip/_vendor/rich/ansi.py,sha256=iD6532QYqnBm6hADulKjrV8l8kFJ-9fEVooHJHH3hMg,6906 pip/_vendor/rich/bar.py,sha256=a7UD303BccRCrEhGjfMElpv5RFYIinaAhAuqYqhUvmw,3264 pip/_vendor/rich/box.py,sha256=FJ6nI3jD7h2XNFU138bJUt2HYmWOlRbltoCEuIAZhew,9842 pip/_vendor/rich/cells.py,sha256=627ztJs9zOL-38HJ7kXBerR-gT8KBfYC8UzEwMJDYYo,4509 pip/_vendor/rich/color.py,sha256=9Gh958U3f75WVdLTeC0U9nkGTn2n0wnojKpJ6jQEkIE,18224 pip/_vendor/rich/color_triplet.py,sha256=3lhQkdJbvWPoLDO-AnYImAWmJvV5dlgYNCVZ97ORaN4,1054 pip/_vendor/rich/columns.py,sha256=HUX0KcMm9dsKNi11fTbiM_h2iDtl8ySCaVcxlalEzq8,7131 pip/_vendor/rich/console.py,sha256=pDvkbLkvtZIMIwQx_jkZ-seyNl4zGBLviXoWXte9fwg,99218 pip/_vendor/rich/constrain.py,sha256=1VIPuC8AgtKWrcncQrjBdYqA3JVWysu6jZo1rrh7c7Q,1288 pip/_vendor/rich/containers.py,sha256=aKgm5UDHn5Nmui6IJaKdsZhbHClh_X7D-_Wg8Ehrr7s,5497 pip/_vendor/rich/control.py,sha256=DSkHTUQLorfSERAKE_oTAEUFefZnZp4bQb4q8rHbKws,6630 pip/_vendor/rich/default_styles.py,sha256=-Fe318kMVI_IwciK5POpThcO0-9DYJ67TZAN6DlmlmM,8082 pip/_vendor/rich/diagnose.py,sha256=an6uouwhKPAlvQhYpNNpGq9EJysfMIOvvCbO3oSoR24,972 pip/_vendor/rich/emoji.py,sha256=omTF9asaAnsM4yLY94eR_9dgRRSm1lHUszX20D1yYCQ,2501 pip/_vendor/rich/errors.py,sha256=5pP3Kc5d4QJ_c0KFsxrfyhjiPVe7J1zOqSFbFAzcV-Y,642 pip/_vendor/rich/file_proxy.py,sha256=Tl9THMDZ-Pk5Wm8sI1gGg_U5DhusmxD-FZ0fUbcU0W0,1683 pip/_vendor/rich/filesize.py,sha256=9fTLAPCAwHmBXdRv7KZU194jSgNrRb6Wx7RIoBgqeKY,2508 pip/_vendor/rich/highlighter.py,sha256=p3C1g4QYzezFKdR7NF9EhPbzQDvdPUhGRgSyGGEmPko,9584 pip/_vendor/rich/json.py,sha256=EYp9ucj-nDjYDkHCV6Mk1ve8nUOpuFLaW76X50Mis2M,5032 pip/_vendor/rich/jupyter.py,sha256=QyoKoE_8IdCbrtiSHp9TsTSNyTHY0FO5whE7jOTd9UE,3252 pip/_vendor/rich/layout.py,sha256=RFYL6HdCFsHf9WRpcvi3w-fpj-8O5dMZ8W96VdKNdbI,14007 pip/_vendor/rich/live.py,sha256=vZzYvu7fqwlv3Gthl2xiw1Dc_O80VlGcCV0DOHwCyDM,14273 pip/_vendor/rich/live_render.py,sha256=zElm3PrfSIvjOce28zETHMIUf9pFYSUA5o0AflgUP64,3667 pip/_vendor/rich/logging.py,sha256=uB-cB-3Q4bmXDLLpbOWkmFviw-Fde39zyMV6tKJ2WHQ,11903 pip/_vendor/rich/markup.py,sha256=xzF4uAafiEeEYDJYt_vUnJOGoTU8RrH-PH7WcWYXjCg,8198 pip/_vendor/rich/measure.py,sha256=HmrIJX8sWRTHbgh8MxEay_83VkqNW_70s8aKP5ZcYI8,5305 pip/_vendor/rich/padding.py,sha256=kTFGsdGe0os7tXLnHKpwTI90CXEvrceeZGCshmJy5zw,4970 pip/_vendor/rich/pager.py,sha256=SO_ETBFKbg3n_AgOzXm41Sv36YxXAyI3_R-KOY2_uSc,828 pip/_vendor/rich/palette.py,sha256=lInvR1ODDT2f3UZMfL1grq7dY_pDdKHw4bdUgOGaM4Y,3396 pip/_vendor/rich/panel.py,sha256=wGMe40J8KCGgQoM0LyjRErmGIkv2bsYA71RCXThD0xE,10574 pip/_vendor/rich/pretty.py,sha256=eLEYN9xVaMNuA6EJVYm4li7HdOHxCqmVKvnOqJpyFt0,35852 pip/_vendor/rich/progress.py,sha256=n4KF9vky8_5iYeXcyZPEvzyLplWlDvFLkM5JI0Bs08A,59706 pip/_vendor/rich/progress_bar.py,sha256=cEoBfkc3lLwqba4XKsUpy4vSQKDh2QQ5J2J94-ACFoo,8165 pip/_vendor/rich/prompt.py,sha256=x0mW-pIPodJM4ry6grgmmLrl8VZp99kqcmdnBe70YYA,11303 pip/_vendor/rich/protocol.py,sha256=5hHHDDNHckdk8iWH5zEbi-zuIVSF5hbU2jIo47R7lTE,1391 pip/_vendor/rich/region.py,sha256=rNT9xZrVZTYIXZC0NYn41CJQwYNbR-KecPOxTgQvB8Y,166 pip/_vendor/rich/repr.py,sha256=9Z8otOmM-tyxnyTodvXlectP60lwahjGiDTrbrxPSTg,4431 pip/_vendor/rich/rule.py,sha256=0fNaS_aERa3UMRc3T5WMpN_sumtDxfaor2y3of1ftBk,4602 pip/_vendor/rich/scope.py,sha256=TMUU8qo17thyqQCPqjDLYpg_UU1k5qVd-WwiJvnJVas,2843 pip/_vendor/rich/screen.py,sha256=YoeReESUhx74grqb0mSSb9lghhysWmFHYhsbMVQjXO8,1591 pip/_vendor/rich/segment.py,sha256=XLnJEFvcV3bjaVzMNUJiem3n8lvvI9TJ5PTu-IG2uTg,24247 pip/_vendor/rich/spinner.py,sha256=15koCmF0DQeD8-k28Lpt6X_zJQUlzEhgo_6A6uy47lc,4339 pip/_vendor/rich/status.py,sha256=gJsIXIZeSo3urOyxRUjs6VrhX5CZrA0NxIQ-dxhCnwo,4425 pip/_vendor/rich/style.py,sha256=3hiocH_4N8vwRm3-8yFWzM7tSwjjEven69XqWasSQwM,27073 pip/_vendor/rich/styled.py,sha256=eZNnzGrI4ki_54pgY3Oj0T-x3lxdXTYh4_ryDB24wBU,1258 pip/_vendor/rich/syntax.py,sha256=jgDiVCK6cpR0NmBOpZmIu-Ud4eaW7fHvjJZkDbjpcSA,35173 pip/_vendor/rich/table.py,sha256=-WzesL-VJKsaiDU3uyczpJMHy6VCaSewBYJwx8RudI8,39684 pip/_vendor/rich/terminal_theme.py,sha256=1j5-ufJfnvlAo5Qsi_ACZiXDmwMXzqgmFByObT9-yJY,3370 pip/_vendor/rich/text.py,sha256=_8JBlSau0c2z8ENOZMi1hJ7M1ZGY408E4-hXjHyyg1A,45525 pip/_vendor/rich/theme.py,sha256=belFJogzA0W0HysQabKaHOc3RWH2ko3fQAJhoN-AFdo,3777 pip/_vendor/rich/themes.py,sha256=0xgTLozfabebYtcJtDdC5QkX5IVUEaviqDUJJh4YVFk,102 pip/_vendor/rich/traceback.py,sha256=yCLVrCtyoFNENd9mkm2xeG3KmqkTwH9xpFOO7p2Bq0A,29604 pip/_vendor/rich/tree.py,sha256=BMbUYNjS9uodNPfvtY_odmU09GA5QzcMbQ5cJZhllQI,9169 pip/_vendor/tenacity/__init__.py,sha256=3kvAL6KClq8GFo2KFhmOzskRKSDQI-ubrlfZ8AQEEI0,20493 pip/_vendor/tenacity/_asyncio.py,sha256=Qi6wgQsGa9MQibYRy3OXqcDQswIZZ00dLOoSUGN-6o8,3551 pip/_vendor/tenacity/_utils.py,sha256=ubs6a7sxj3JDNRKWCyCU2j5r1CB7rgyONgZzYZq6D_4,2179 pip/_vendor/tenacity/after.py,sha256=S5NCISScPeIrKwIeXRwdJl3kV9Q4nqZfnNPDx6Hf__g,1682 pip/_vendor/tenacity/before.py,sha256=dIZE9gmBTffisfwNkK0F1xFwGPV41u5GK70UY4Pi5Kc,1562 pip/_vendor/tenacity/before_sleep.py,sha256=YmpgN9Y7HGlH97U24vvq_YWb5deaK4_DbiD8ZuFmy-E,2372 pip/_vendor/tenacity/nap.py,sha256=fRWvnz1aIzbIq9Ap3gAkAZgDH6oo5zxMrU6ZOVByq0I,1383 pip/_vendor/tenacity/retry.py,sha256=jrzD_mxA5mSTUEdiYB7SHpxltjhPSYZSnSRATb-ggRc,8746 pip/_vendor/tenacity/stop.py,sha256=YMJs7ZgZfND65PRLqlGB_agpfGXlemx_5Hm4PKnBqpQ,3086 pip/_vendor/tenacity/tornadoweb.py,sha256=po29_F1Mt8qZpsFjX7EVwAT0ydC_NbVia9gVi7R_wXA,2142 pip/_vendor/tenacity/wait.py,sha256=3FcBJoCDgym12_dN6xfK8C1gROY0Hn4NSI2u8xv50uE,8024 pip/_vendor/tomli/__init__.py,sha256=JhUwV66DB1g4Hvt1UQCVMdfCu-IgAV8FXmvDU9onxd4,396 pip/_vendor/tomli/_parser.py,sha256=g9-ENaALS-B8dokYpCuzUFalWlog7T-SIYMjLZSWrtM,22633 pip/_vendor/tomli/_re.py,sha256=dbjg5ChZT23Ka9z9DHOXfdtSpPwUfdgMXnj8NOoly-w,2943 pip/_vendor/tomli/_types.py,sha256=-GTG2VUqkpxwMqzmVO4F7ybKddIbAnuAHXfmWQcTi3Q,254 pip/_vendor/truststore/__init__.py,sha256=qzTLSH8PvAkY1fr6QQ2vV-KwE_M83wdXugtpJaP_AbM,403 pip/_vendor/truststore/_api.py,sha256=xjuEu_rlH4hcdJTROImEyOEqdw-F8t5vO2H2BToY0Ro,9893 pip/_vendor/truststore/_macos.py,sha256=BjvAKoAjXhdIPuxpY124HJIFswDb0pq8DjynzJOVwqc,17694 pip/_vendor/truststore/_openssl.py,sha256=LLUZ7ZGaio-i5dpKKjKCSeSufmn6T8pi9lDcFnvSyq0,2324 pip/_vendor/truststore/_ssl_constants.py,sha256=NUD4fVKdSD02ri7-db0tnO0VqLP9aHuzmStcW7tAl08,1130 pip/_vendor/truststore/_windows.py,sha256=1x_EhROeJ9QK1sMAjfnZC7awYI8UnBJYL-TjACUYI4A,17468 pip/_vendor/urllib3/__init__.py,sha256=iXLcYiJySn0GNbWOOZDDApgBL1JgP44EZ8i1760S8Mc,3333 pip/_vendor/urllib3/_collections.py,sha256=Rp1mVyBgc_UlAcp6M3at1skJBXR5J43NawRTvW2g_XY,10811 pip/_vendor/urllib3/_version.py,sha256=azoM7M7BUADl2kBhMVR6PPf2GhBDI90me1fcnzTwdcw,64 pip/_vendor/urllib3/connection.py,sha256=92k9td_y4PEiTIjNufCUa1NzMB3J3w0LEdyokYgXnW8,20300 pip/_vendor/urllib3/connectionpool.py,sha256=ItVDasDnPRPP9R8bNxY7tPBlC724nJ9nlxVgXG_SLbI,39990 pip/_vendor/urllib3/exceptions.py,sha256=0Mnno3KHTNfXRfY7638NufOPkUb6mXOm-Lqj-4x2w8A,8217 pip/_vendor/urllib3/fields.py,sha256=kvLDCg_JmH1lLjUUEY_FLS8UhY7hBvDPuVETbY8mdrM,8579 pip/_vendor/urllib3/filepost.py,sha256=5b_qqgRHVlL7uLtdAYBzBh-GHmU5AfJVt_2N0XS3PeY,2440 pip/_vendor/urllib3/poolmanager.py,sha256=0i8cJgrqupza67IBPZ_u9jXvnSxr5UBlVEiUqdkPtYI,19752 pip/_vendor/urllib3/request.py,sha256=YTWFNr7QIwh7E1W9dde9LM77v2VWTJ5V78XuTTw7D1A,6691 pip/_vendor/urllib3/response.py,sha256=fmDJAFkG71uFTn-sVSTh2Iw0WmcXQYqkbRjihvwBjU8,30641 pip/_vendor/urllib3/contrib/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pip/_vendor/urllib3/contrib/_appengine_environ.py,sha256=bDbyOEhW2CKLJcQqAKAyrEHN-aklsyHFKq6vF8ZFsmk,957 pip/_vendor/urllib3/contrib/appengine.py,sha256=VR68eAVE137lxTgjBDwCna5UiBZTOKa01Aj_-5BaCz4,11036 pip/_vendor/urllib3/contrib/ntlmpool.py,sha256=NlfkW7WMdW8ziqudopjHoW299og1BTWi0IeIibquFwk,4528 pip/_vendor/urllib3/contrib/pyopenssl.py,sha256=hDJh4MhyY_p-oKlFcYcQaVQRDv6GMmBGuW9yjxyeejM,17081 pip/_vendor/urllib3/contrib/securetransport.py,sha256=yhZdmVjY6PI6EeFbp7qYOp6-vp1Rkv2NMuOGaEj7pmc,34448 pip/_vendor/urllib3/contrib/socks.py,sha256=aRi9eWXo9ZEb95XUxef4Z21CFlnnjbEiAo9HOseoMt4,7097 pip/_vendor/urllib3/contrib/_securetransport/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pip/_vendor/urllib3/contrib/_securetransport/bindings.py,sha256=4Xk64qIkPBt09A5q-RIFUuDhNc9mXilVapm7WnYnzRw,17632 pip/_vendor/urllib3/contrib/_securetransport/low_level.py,sha256=B2JBB2_NRP02xK6DCa1Pa9IuxrPwxzDzZbixQkb7U9M,13922 pip/_vendor/urllib3/packages/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pip/_vendor/urllib3/packages/six.py,sha256=b9LM0wBXv7E7SrbCjAm4wwN-hrH-iNxv18LgWNMMKPo,34665 pip/_vendor/urllib3/packages/backports/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 pip/_vendor/urllib3/packages/backports/makefile.py,sha256=nbzt3i0agPVP07jqqgjhaYjMmuAi_W5E0EywZivVO8E,1417 pip/_vendor/urllib3/packages/backports/weakref_finalize.py,sha256=tRCal5OAhNSRyb0DhHp-38AtIlCsRP8BxF3NX-6rqIA,5343 pip/_vendor/urllib3/util/__init__.py,sha256=JEmSmmqqLyaw8P51gUImZh8Gwg9i1zSe-DoqAitn2nc,1155 pip/_vendor/urllib3/util/connection.py,sha256=5Lx2B1PW29KxBn2T0xkN1CBgRBa3gGVJBKoQoRogEVk,4901 pip/_vendor/urllib3/util/proxy.py,sha256=zUvPPCJrp6dOF0N4GAVbOcl6o-4uXKSrGiTkkr5vUS4,1605 pip/_vendor/urllib3/util/queue.py,sha256=nRgX8_eX-_VkvxoX096QWoz8Ps0QHUAExILCY_7PncM,498 pip/_vendor/urllib3/util/request.py,sha256=C0OUt2tcU6LRiQJ7YYNP9GvPrSvl7ziIBekQ-5nlBZk,3997 pip/_vendor/urllib3/util/response.py,sha256=GJpg3Egi9qaJXRwBh5wv-MNuRWan5BIu40oReoxWP28,3510 pip/_vendor/urllib3/util/retry.py,sha256=Z6WEf518eTOXP5jr5QSQ9gqJI0DVYt3Xs3EKnYaTmus,22013 pip/_vendor/urllib3/util/ssl_.py,sha256=X4-AqW91aYPhPx6-xbf66yHFQKbqqfC_5Zt4WkLX1Hc,17177 pip/_vendor/urllib3/util/ssl_match_hostname.py,sha256=Ir4cZVEjmAk8gUAIHWSi7wtOO83UCYABY2xFD1Ql_WA,5758 pip/_vendor/urllib3/util/ssltransport.py,sha256=NA-u5rMTrDFDFC8QzRKUEKMG0561hOD4qBTr3Z4pv6E,6895 pip/_vendor/urllib3/util/timeout.py,sha256=cwq4dMk87mJHSBktK1miYJ-85G-3T3RmT20v7SFCpno,10168 pip/_vendor/urllib3/util/url.py,sha256=lCAE7M5myA8EDdW0sJuyyZhVB9K_j38ljWhHAnFaWoE,14296 pip/_vendor/urllib3/util/wait.py,sha256=fOX0_faozG2P7iVojQoE1mbydweNyTcm-hXEfFrTtLI,5403 pip/_vendor/webencodings/__init__.py,sha256=qOBJIuPy_4ByYH6W_bNgJF-qYQ2DoU-dKsDu5yRWCXg,10579 pip/_vendor/webencodings/labels.py,sha256=4AO_KxTddqGtrL9ns7kAPjb0CcN6xsCIxbK37HY9r3E,8979 pip/_vendor/webencodings/mklabels.py,sha256=GYIeywnpaLnP0GSic8LFWgd0UVvO_l1Nc6YoF-87R_4,1305 pip/_vendor/webencodings/tests.py,sha256=OtGLyjhNY1fvkW1GvLJ_FV9ZoqC9Anyjr7q3kxTbzNs,6563 pip/_vendor/webencodings/x_user_defined.py,sha256=yOqWSdmpytGfUgh_Z6JYgDNhoc-BAHyyeeT15Fr42tM,4307 pip-23.3.1.dist-info/AUTHORS.txt,sha256=HOVK0m4Fk7uZrqt9MhiBlBTdmUbMIxXJziTWeMc_Jxc,10253 pip-23.3.1.dist-info/LICENSE.txt,sha256=Y0MApmnUmurmWxLGxIySTFGkzfPR_whtw0VtyLyqIQQ,1093 pip-23.3.1.dist-info/METADATA,sha256=ePd4oJwtCOg7e5hjeRczRRgaxHUSasxlmRPNHMtKToE,3540 pip-23.3.1.dist-info/WHEEL,sha256=yQN5g4mg4AybRjkgi-9yy4iQEFibGQmlz78Pik5Or-A,92 pip-23.3.1.dist-info/entry_points.txt,sha256=xg35gOct0aY8S3ftLtweJ0uw3KBAIVyW4k-0Jx1rkNE,125 pip-23.3.1.dist-info/top_level.txt,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4 pip-23.3.1.dist-info/RECORD,, pip/_internal/operations/build/metadata_editable.cpython-311.pyc,, pip/_vendor/rich/_palettes.cpython-311.pyc,, pip/_internal/cli/__pycache__,, pip/_vendor/resolvelib/__pycache__,, pip/_vendor/pygments/formatters/irc.cpython-311.pyc,, pip/_internal/utils/__init__.cpython-311.pyc,, pip/_vendor/rich/style.cpython-311.pyc,, ../../../bin/pip,, pip/_internal/commands/index.cpython-311.pyc,, pip/_internal/models/link.cpython-311.pyc,, pip/_internal/commands/__init__.cpython-311.pyc,, pip/_vendor/urllib3/filepost.cpython-311.pyc,, pip/_internal/vcs/mercurial.cpython-311.pyc,, pip/_internal/utils/subprocess.cpython-311.pyc,, pip/_vendor/pyparsing/helpers.cpython-311.pyc,, pip/_internal/utils/virtualenv.cpython-311.pyc,, pip/_vendor/chardet/johabprober.cpython-311.pyc,, pip/_vendor/urllib3/contrib/__pycache__,, pip/_internal/resolution/resolvelib/provider.cpython-311.pyc,, pip/_vendor/certifi/__pycache__,, pip/_internal/network/cache.cpython-311.pyc,, pip/_vendor/certifi/core.cpython-311.pyc,, pip/_internal/resolution/resolvelib/reporter.cpython-311.pyc,, pip/_internal/utils/deprecation.cpython-311.pyc,, pip/_vendor/chardet/cli/__init__.cpython-311.pyc,, pip/__init__.cpython-311.pyc,, pip/_vendor/cachecontrol/__init__.cpython-311.pyc,, pip/_vendor/rich/columns.cpython-311.pyc,, pip/_internal/__pycache__,, pip/_internal/resolution/legacy/__init__.cpython-311.pyc,, pip/_vendor/chardet/euckrfreq.cpython-311.pyc,, pip/_vendor/rich/_emoji_codes.cpython-311.pyc,, pip/_vendor/rich/_inspect.cpython-311.pyc,, pip/_vendor/distlib/database.cpython-311.pyc,, pip/_vendor/urllib3/util/retry.cpython-311.pyc,, pip/_internal/metadata/__init__.cpython-311.pyc,, pip/_vendor/colorama/ansitowin32.cpython-311.pyc,, pip/_internal/operations/install/__pycache__,, pip/_internal/req/__init__.cpython-311.pyc,, pip/_vendor/platformdirs/api.cpython-311.pyc,, pip/_internal/commands/download.cpython-311.pyc,, pip/_internal/index/sources.cpython-311.pyc,, pip/_vendor/colorama/tests/ansitowin32_test.cpython-311.pyc,, pip/_vendor/pygments/formatters/svg.cpython-311.pyc,, pip/_vendor/pygments/style.cpython-311.pyc,, pip/_vendor/rich/color_triplet.cpython-311.pyc,, pip/_vendor/tenacity/before_sleep.cpython-311.pyc,, pip/_internal/cli/__init__.cpython-311.pyc,, pip/_vendor/pygments/sphinxext.cpython-311.pyc,, pip/_internal/commands/configuration.cpython-311.pyc,, pip/_internal/network/__init__.cpython-311.pyc,, pip/_vendor/packaging/_structures.cpython-311.pyc,, pip/_vendor/truststore/_macos.cpython-311.pyc,, pip/_internal/utils/urls.cpython-311.pyc,, pip/_vendor/idna/intranges.cpython-311.pyc,, pip/_vendor/urllib3/poolmanager.cpython-311.pyc,, pip/_vendor/distlib/markers.cpython-311.pyc,, pip/_vendor/rich/logging.cpython-311.pyc,, pip/_internal/cli/cmdoptions.cpython-311.pyc,, pip/_vendor/urllib3/contrib/__init__.cpython-311.pyc,, pip/_internal/pyproject.cpython-311.pyc,, pip/_vendor/certifi/__init__.cpython-311.pyc,, pip/_internal/commands/freeze.cpython-311.pyc,, pip/_internal/models/format_control.cpython-311.pyc,, pip/_vendor/packaging/utils.cpython-311.pyc,, pip/_vendor/urllib3/contrib/appengine.cpython-311.pyc,, pip/_vendor/rich/status.cpython-311.pyc,, pip/_vendor/pygments/__init__.cpython-311.pyc,, pip/_internal/resolution/resolvelib/base.cpython-311.pyc,, pip/_internal/utils/hashes.cpython-311.pyc,, pip/_vendor/chardet/eucjpprober.cpython-311.pyc,, pip/_vendor/rich/progress.cpython-311.pyc,, pip/_vendor/urllib3/util/request.cpython-311.pyc,, pip/_vendor/packaging/markers.cpython-311.pyc,, pip/_vendor/tomli/__pycache__,, pip/_vendor/rich/containers.cpython-311.pyc,, pip/_internal/network/download.cpython-311.pyc,, pip/_vendor/rich/repr.cpython-311.pyc,, pip/_internal/utils/setuptools_build.cpython-311.pyc,, pip/_internal/utils/compatibility_tags.cpython-311.pyc,, pip/_vendor/requests/compat.cpython-311.pyc,, pip/_internal/cli/main.cpython-311.pyc,, pip/_vendor/chardet/sbcharsetprober.cpython-311.pyc,, pip/_internal/index/__init__.cpython-311.pyc,, pip/_vendor/webencodings/labels.cpython-311.pyc,, pip/_vendor/requests/status_codes.cpython-311.pyc,, pip/_vendor/rich/rule.cpython-311.pyc,, pip/_internal/wheel_builder.cpython-311.pyc,, pip/_vendor/webencodings/mklabels.cpython-311.pyc,, pip/_vendor/chardet/euctwprober.cpython-311.pyc,, pip/_vendor/pygments/lexers/python.cpython-311.pyc,, pip/_vendor/pygments/regexopt.cpython-311.pyc,, pip/_vendor/urllib3/util/connection.cpython-311.pyc,, pip/_vendor/requests/sessions.cpython-311.pyc,, pip/_vendor/pyparsing/__pycache__,, pip/_vendor/chardet/big5freq.cpython-311.pyc,, pip/_vendor/pkg_resources/__pycache__,, pip/_vendor/pyparsing/core.cpython-311.pyc,, pip/_vendor/requests/cookies.cpython-311.pyc,, pip/_internal/index/package_finder.cpython-311.pyc,, pip/_vendor/tenacity/__pycache__,, pip/_vendor/urllib3/packages/six.cpython-311.pyc,, pip/_vendor/resolvelib/providers.cpython-311.pyc,, pip/_internal/resolution/__pycache__,, pip/_vendor/resolvelib/resolvers.cpython-311.pyc,, pip/_vendor/packaging/__about__.cpython-311.pyc,, pip/_vendor/resolvelib/compat/__pycache__,, pip/_internal/operations/build/wheel.cpython-311.pyc,, pip/_vendor/requests/__pycache__,, pip/_internal/utils/compat.cpython-311.pyc,, pip/_vendor/urllib3/exceptions.cpython-311.pyc,, pip/_vendor/pygments/formatters/__pycache__,, ../../../bin/pip-3.11,, pip/_vendor/rich/ansi.cpython-311.pyc,, pip/_vendor/urllib3/contrib/_securetransport/bindings.cpython-311.pyc,, pip/_internal/models/direct_url.cpython-311.pyc,, pip/_vendor/rich/color.cpython-311.pyc,, pip/__main__.cpython-311.pyc,, pip/_vendor/chardet/sbcsgroupprober.cpython-311.pyc,, pip/_vendor/pyproject_hooks/_impl.cpython-311.pyc,, pip/_internal/exceptions.cpython-311.pyc,, pip/_vendor/rich/control.cpython-311.pyc,, pip/_internal/commands/inspect.cpython-311.pyc,, pip/_internal/network/session.cpython-311.pyc,, pip/_vendor/rich/screen.cpython-311.pyc,, pip/_internal/req/req_uninstall.cpython-311.pyc,, pip/_vendor/pygments/styles/__pycache__,, pip/_vendor/pyparsing/diagram/__init__.cpython-311.pyc,, pip/_vendor/urllib3/_collections.cpython-311.pyc,, pip/_internal/locations/_distutils.cpython-311.pyc,, pip/_vendor/pygments/lexers/__pycache__,, pip/_vendor/distlib/wheel.cpython-311.pyc,, pip/_internal/cli/main_parser.cpython-311.pyc,, pip/_internal/utils/unpacking.cpython-311.pyc,, pip/_vendor/colorama/__init__.cpython-311.pyc,, pip/_internal/utils/glibc.cpython-311.pyc,, pip/_vendor/urllib3/packages/backports/makefile.cpython-311.pyc,, pip/_vendor/rich/file_proxy.cpython-311.pyc,, pip/_vendor/pygments/token.cpython-311.pyc,, pip/_vendor/rich/_loop.cpython-311.pyc,, pip/_internal/utils/models.cpython-311.pyc,, pip/_internal/locations/base.cpython-311.pyc,, pip/_internal/resolution/resolvelib/candidates.cpython-311.pyc,, pip/_internal/utils/_log.cpython-311.pyc,, pip/_vendor/pyparsing/testing.cpython-311.pyc,, pip/_vendor/colorama/win32.cpython-311.pyc,, pip/_vendor/pkg_resources/__init__.cpython-311.pyc,, pip/_vendor/tenacity/__init__.cpython-311.pyc,, pip/_vendor/chardet/latin1prober.cpython-311.pyc,, pip/_internal/metadata/pkg_resources.cpython-311.pyc,, pip/_vendor/rich/constrain.cpython-311.pyc,, pip/_vendor/requests/hooks.cpython-311.pyc,, pip/_vendor/pyparsing/results.cpython-311.pyc,, pip/_vendor/chardet/macromanprober.cpython-311.pyc,, pip/_vendor/chardet/cli/__pycache__,, pip/_vendor/urllib3/contrib/ntlmpool.cpython-311.pyc,, pip/_vendor/cachecontrol/__pycache__,, pip/_vendor/rich/traceback.cpython-311.pyc,, pip/_internal/resolution/legacy/__pycache__,, pip/__pip-runner__.cpython-311.pyc,, pip/_internal/models/scheme.cpython-311.pyc,, pip/_vendor/pygments/cmdline.cpython-311.pyc,, pip/_vendor/pygments/formatters/__init__.cpython-311.pyc,, pip/_vendor/rich/prompt.cpython-311.pyc,, pip/_internal/models/wheel.cpython-311.pyc,, pip/_vendor/rich/styled.cpython-311.pyc,, pip/_internal/operations/prepare.cpython-311.pyc,, pip/_vendor/chardet/langhungarianmodel.cpython-311.pyc,, pip/_vendor/pygments/formatters/bbcode.cpython-311.pyc,, pip/_internal/cli/base_command.cpython-311.pyc,, pip/_vendor/packaging/specifiers.cpython-311.pyc,, pip/_vendor/tomli/_types.cpython-311.pyc,, pip/_vendor/rich/tree.cpython-311.pyc,, pip/_vendor/colorama/tests/winterm_test.cpython-311.pyc,, pip/_vendor/pygments/__main__.cpython-311.pyc,, pip/_vendor/chardet/sjisprober.cpython-311.pyc,, pip/_vendor/chardet/langhebrewmodel.cpython-311.pyc,, pip/_vendor/pygments/styles/__init__.cpython-311.pyc,, pip/_vendor/chardet/metadata/languages.cpython-311.pyc,, pip/_vendor/pygments/lexers/__init__.cpython-311.pyc,, pip/_vendor/pygments/formatters/html.cpython-311.pyc,, pip/_vendor/chardet/version.cpython-311.pyc,, pip/_vendor/cachecontrol/filewrapper.cpython-311.pyc,, pip/_vendor/pyproject_hooks/_compat.cpython-311.pyc,, pip/_internal/network/__pycache__,, pip/_vendor/cachecontrol/wrapper.cpython-311.pyc,, pip/_internal/utils/direct_url_helpers.cpython-311.pyc,, pip/_internal/distributions/__pycache__,, pip/_vendor/pyparsing/exceptions.cpython-311.pyc,, pip/_vendor/packaging/requirements.cpython-311.pyc,, pip/_vendor/chardet/johabfreq.cpython-311.pyc,, pip/_vendor/truststore/_api.cpython-311.pyc,, pip/_vendor/rich/bar.cpython-311.pyc,, pip/_vendor/colorama/tests/utils.cpython-311.pyc,, pip/_vendor/rich/_ratio.cpython-311.pyc,, pip/_vendor/__pycache__,, pip/_vendor/webencodings/__pycache__,, pip/_internal/commands/check.cpython-311.pyc,, pip/_vendor/msgpack/__pycache__,, pip/_vendor/rich/protocol.cpython-311.pyc,, pip/_vendor/tenacity/tornadoweb.cpython-311.pyc,, pip/_vendor/pygments/__pycache__,, pip/_vendor/rich/live.cpython-311.pyc,, pip/_internal/vcs/__pycache__,, pip/_vendor/requests/exceptions.cpython-311.pyc,, pip/_vendor/rich/layout.cpython-311.pyc,, pip/_vendor/urllib3/packages/backports/weakref_finalize.cpython-311.pyc,, pip/_vendor/packaging/_manylinux.cpython-311.pyc,, pip/_vendor/pyparsing/util.cpython-311.pyc,, pip/_vendor/platformdirs/version.cpython-311.pyc,, pip/_vendor/chardet/gb2312freq.cpython-311.pyc,, pip/_vendor/urllib3/util/ssl_.cpython-311.pyc,, pip/_vendor/urllib3/util/__pycache__,, pip/_vendor/rich/pager.cpython-311.pyc,, pip/_internal/index/__pycache__,, pip/_vendor/cachecontrol/serialize.cpython-311.pyc,, pip/_internal/operations/build/wheel_editable.cpython-311.pyc,, pip/_internal/metadata/importlib/_envs.cpython-311.pyc,, pip/_vendor/chardet/utf1632prober.cpython-311.pyc,, pip/_vendor/rich/__init__.cpython-311.pyc,, pip/_vendor/pyparsing/common.cpython-311.pyc,, pip/_vendor/tenacity/nap.cpython-311.pyc,, pip/_internal/operations/build/metadata.cpython-311.pyc,, pip/_vendor/chardet/gb2312prober.cpython-311.pyc,, pip/_vendor/rich/terminal_theme.cpython-311.pyc,, pip/_vendor/cachecontrol/adapter.cpython-311.pyc,, pip/_internal/utils/encoding.cpython-311.pyc,, pip/_vendor/cachecontrol/caches/redis_cache.cpython-311.pyc,, pip/_internal/distributions/__init__.cpython-311.pyc,, pip/_vendor/pygments/formatters/latex.cpython-311.pyc,, pip/_vendor/urllib3/util/queue.cpython-311.pyc,, pip/_internal/distributions/installed.cpython-311.pyc,, pip/_internal/utils/logging.cpython-311.pyc,, pip/_vendor/__init__.cpython-311.pyc,, pip/_vendor/webencodings/__init__.cpython-311.pyc,, pip/_vendor/distlib/metadata.cpython-311.pyc,, pip/_internal/req/constructors.cpython-311.pyc,, pip/_vendor/urllib3/contrib/_securetransport/low_level.cpython-311.pyc,, pip/_vendor/requests/packages.cpython-311.pyc,, pip/_vendor/packaging/tags.cpython-311.pyc,, pip/_vendor/msgpack/__init__.cpython-311.pyc,, pip/_vendor/tenacity/stop.cpython-311.pyc,, pip/_vendor/chardet/mbcharsetprober.cpython-311.pyc,, pip/_internal/network/xmlrpc.cpython-311.pyc,, pip/_internal/vcs/__init__.cpython-311.pyc,, pip/_vendor/pyparsing/diagram/__pycache__,, pip/_vendor/requests/certs.cpython-311.pyc,, pip/_internal/utils/wheel.cpython-311.pyc,, pip/_vendor/platformdirs/__pycache__,, pip/_internal/operations/__init__.cpython-311.pyc,, pip/_vendor/chardet/jpcntx.cpython-311.pyc,, pip/_vendor/urllib3/util/__init__.cpython-311.pyc,, pip/_internal/resolution/legacy/resolver.cpython-311.pyc,, pip/_vendor/colorama/__pycache__,, pip/_vendor/urllib3/contrib/_securetransport/__pycache__,, pip/_internal/commands/wheel.cpython-311.pyc,, pip/_internal/req/req_install.cpython-311.pyc,, pip/_vendor/tenacity/_asyncio.cpython-311.pyc,, pip/_vendor/tenacity/before.cpython-311.pyc,, pip/_internal/resolution/resolvelib/requirements.cpython-311.pyc,, pip/_vendor/rich/align.cpython-311.pyc,, pip/_vendor/pygments/formatters/groff.cpython-311.pyc,, pip/_vendor/idna/codec.cpython-311.pyc,, pip/_vendor/chardet/cp949prober.cpython-311.pyc,, pip/_vendor/urllib3/contrib/pyopenssl.cpython-311.pyc,, pip/_vendor/requests/api.cpython-311.pyc,, pip/_vendor/rich/region.cpython-311.pyc,, pip/_vendor/chardet/mbcssm.cpython-311.pyc,, pip/_vendor/chardet/jisfreq.cpython-311.pyc,, pip/_internal/req/req_file.cpython-311.pyc,, pip/_vendor/chardet/__init__.cpython-311.pyc,, pip/_vendor/rich/scope.cpython-311.pyc,, pip/_internal/commands/search.cpython-311.pyc,, pip/_vendor/rich/_win32_console.cpython-311.pyc,, pip/_vendor/pygments/plugin.cpython-311.pyc,, pip/_vendor/urllib3/connection.cpython-311.pyc,, pip/_vendor/chardet/cli/chardetect.cpython-311.pyc,, pip/_vendor/rich/_windows.cpython-311.pyc,, pip/_vendor/chardet/big5prober.cpython-311.pyc,, pip/_vendor/urllib3/util/ssltransport.cpython-311.pyc,, pip/_vendor/rich/_log_render.cpython-311.pyc,, pip/_vendor/urllib3/packages/__init__.cpython-311.pyc,, pip/_vendor/requests/models.cpython-311.pyc,, pip/_internal/models/candidate.cpython-311.pyc,, pip/_vendor/tomli/_re.cpython-311.pyc,, pip/_vendor/pygments/formatters/pangomarkup.cpython-311.pyc,, pip/_vendor/urllib3/packages/backports/__pycache__,, pip/_vendor/chardet/codingstatemachine.cpython-311.pyc,, pip/_vendor/msgpack/exceptions.cpython-311.pyc,, pip/_internal/models/__init__.cpython-311.pyc,, pip/_internal/resolution/resolvelib/__pycache__,, pip/_vendor/resolvelib/reporters.cpython-311.pyc,, pip/_vendor/platformdirs/android.cpython-311.pyc,, pip/_vendor/rich/spinner.cpython-311.pyc,, pip/_vendor/chardet/charsetprober.cpython-311.pyc,, pip/_vendor/requests/__version__.cpython-311.pyc,, pip/_internal/cli/parser.cpython-311.pyc,, pip/_vendor/platformdirs/__init__.cpython-311.pyc,, pip/_internal/vcs/versioncontrol.cpython-311.pyc,, pip/_vendor/urllib3/contrib/_securetransport/__init__.cpython-311.pyc,, pip/_vendor/cachecontrol/_cmd.cpython-311.pyc,, pip/_vendor/urllib3/fields.cpython-311.pyc,, pip/_vendor/rich/_windows_renderer.cpython-311.pyc,, pip/_vendor/rich/syntax.cpython-311.pyc,, pip/_vendor/rich/__main__.cpython-311.pyc,, pip/_vendor/chardet/langturkishmodel.cpython-311.pyc,, pip/_vendor/pygments/util.cpython-311.pyc,, pip/_internal/metadata/importlib/_compat.cpython-311.pyc,, pip/_internal/operations/freeze.cpython-311.pyc,, pip/_vendor/urllib3/contrib/socks.cpython-311.pyc,, pip/_internal/locations/_sysconfig.cpython-311.pyc,, pip/_vendor/truststore/_ssl_constants.cpython-311.pyc,, pip/_internal/metadata/base.cpython-311.pyc,, pip/_vendor/tomli/_parser.cpython-311.pyc,, pip/_vendor/urllib3/connectionpool.cpython-311.pyc,, pip/_internal/network/auth.cpython-311.pyc,, pip/_internal/utils/egg_link.cpython-311.pyc,, pip/_vendor/rich/_extension.cpython-311.pyc,, pip/_vendor/tenacity/_utils.cpython-311.pyc,, pip/_internal/cli/autocompletion.cpython-311.pyc,, pip/_vendor/requests/help.cpython-311.pyc,, pip/_vendor/colorama/tests/isatty_test.cpython-311.pyc,, pip/_internal/models/selection_prefs.cpython-311.pyc,, pip/_internal/operations/install/wheel.cpython-311.pyc,, pip/_internal/cli/command_context.cpython-311.pyc,, pip/_vendor/idna/__init__.cpython-311.pyc,, pip/_vendor/distlib/locators.cpython-311.pyc,, pip/_vendor/rich/markup.cpython-311.pyc,, pip/_vendor/tenacity/wait.cpython-311.pyc,, pip/_vendor/requests/utils.cpython-311.pyc,, pip/_vendor/pygments/formatters/rtf.cpython-311.pyc,, pip/_vendor/distlib/version.cpython-311.pyc,, pip/_vendor/urllib3/packages/backports/__init__.cpython-311.pyc,, pip/_vendor/chardet/escsm.cpython-311.pyc,, pip/_vendor/pygments/filter.cpython-311.pyc,, pip/_vendor/urllib3/util/response.cpython-311.pyc,, pip/_vendor/rich/__pycache__,, pip/_vendor/urllib3/contrib/securetransport.cpython-311.pyc,, pip/_vendor/pyproject_hooks/__init__.cpython-311.pyc,, pip/_vendor/pygments/filters/__init__.cpython-311.pyc,, pip/_vendor/rich/_timer.cpython-311.pyc,, pip/_vendor/colorama/tests/__pycache__,, pip/_internal/resolution/resolvelib/__init__.cpython-311.pyc,, pip/_vendor/colorama/tests/ansi_test.cpython-311.pyc,, pip/_vendor/packaging/version.cpython-311.pyc,, pip/_vendor/rich/jupyter.cpython-311.pyc,, pip/_internal/vcs/bazaar.cpython-311.pyc,, pip/_vendor/rich/panel.cpython-311.pyc,, pip/_vendor/idna/uts46data.cpython-311.pyc,, pip/_vendor/urllib3/contrib/_appengine_environ.cpython-311.pyc,, pip/_vendor/distlib/manifest.cpython-311.pyc,, pip-23.3.1.dist-info/INSTALLER,, pip/_vendor/platformdirs/windows.cpython-311.pyc,, pip/_vendor/chardet/utf8prober.cpython-311.pyc,, pip/_vendor/distlib/scripts.cpython-311.pyc,, pip/_internal/cli/spinners.cpython-311.pyc,, pip/_vendor/pygments/formatters/_mapping.cpython-311.pyc,, pip/_internal/commands/help.cpython-311.pyc,, pip/_vendor/platformdirs/unix.cpython-311.pyc,, pip/_internal/commands/cache.cpython-311.pyc,, pip/_internal/locations/__pycache__,, pip/_vendor/rich/_null_file.cpython-311.pyc,, pip/_internal/models/installation_report.cpython-311.pyc,, pip/_vendor/rich/themes.cpython-311.pyc,, pip/_vendor/requests/_internal_utils.cpython-311.pyc,, pip/_internal/operations/build/__pycache__,, pip/_vendor/rich/padding.cpython-311.pyc,, pip/_internal/network/lazy_wheel.cpython-311.pyc,, pip/_internal/utils/filesystem.cpython-311.pyc,, pip/_vendor/pygments/lexers/_mapping.cpython-311.pyc,, ../../../bin/pip3.11,, pip/_vendor/chardet/mbcsgroupprober.cpython-311.pyc,, pip/_vendor/pygments/unistring.cpython-311.pyc,, pip/_vendor/rich/console.cpython-311.pyc,, pip/_vendor/pyparsing/unicode.cpython-311.pyc,, pip/_vendor/rich/diagnose.cpython-311.pyc,, pip/_vendor/msgpack/fallback.cpython-311.pyc,, pip/_vendor/webencodings/tests.cpython-311.pyc,, pip/_vendor/pygments/scanner.cpython-311.pyc,, pip/_vendor/rich/_stack.cpython-311.pyc,, pip/_internal/operations/build/wheel_legacy.cpython-311.pyc,, pip/_vendor/rich/_pick.cpython-311.pyc,, pip/_internal/operations/__pycache__,, pip/_vendor/cachecontrol/heuristics.cpython-311.pyc,, pip/_vendor/rich/_wrap.cpython-311.pyc,, pip/_internal/utils/_jaraco_text.cpython-311.pyc,, pip/_vendor/distlib/__pycache__,, pip/_vendor/pygments/formatters/img.cpython-311.pyc,, pip/_vendor/chardet/resultdict.cpython-311.pyc,, pip/_vendor/urllib3/_version.cpython-311.pyc,, ../../../bin/pip3,, pip/_vendor/colorama/tests/__init__.cpython-311.pyc,, pip/_vendor/platformdirs/macos.cpython-311.pyc,, pip/_vendor/packaging/__pycache__,, pip/_vendor/urllib3/__pycache__,, pip/_vendor/platformdirs/__main__.cpython-311.pyc,, pip/_internal/resolution/resolvelib/resolver.cpython-311.pyc,, pip/_vendor/chardet/__pycache__,, pip/_vendor/distro/__init__.cpython-311.pyc,, pip/_vendor/chardet/euckrprober.cpython-311.pyc,, pip/_vendor/cachecontrol/controller.cpython-311.pyc,, pip/_internal/locations/__init__.cpython-311.pyc,, pip/_vendor/idna/package_data.cpython-311.pyc,, pip/_vendor/pygments/console.cpython-311.pyc,, pip/_internal/network/utils.cpython-311.pyc,, pip/_vendor/urllib3/packages/__pycache__,, pip/_vendor/colorama/ansi.cpython-311.pyc,, pip/_internal/distributions/sdist.cpython-311.pyc,, pip/_internal/operations/build/__init__.cpython-311.pyc,, pip/_vendor/colorama/initialise.cpython-311.pyc,, pip/_vendor/packaging/_musllinux.cpython-311.pyc,, pip/_vendor/pyproject_hooks/_in_process/__pycache__,, pip/_vendor/rich/_spinners.cpython-311.pyc,, pip/_vendor/colorama/winterm.cpython-311.pyc,, pip-23.3.1.dist-info/__pycache__,, pip/_internal/cache.cpython-311.pyc,, pip/_vendor/requests/adapters.cpython-311.pyc,, pip/_internal/models/__pycache__,, pip/_internal/cli/req_command.cpython-311.pyc,, pip/_vendor/resolvelib/compat/collections_abc.cpython-311.pyc,, pip/_vendor/pygments/modeline.cpython-311.pyc,, pip/_vendor/requests/auth.cpython-311.pyc,, pip/_vendor/rich/_emoji_replace.cpython-311.pyc,, pip/_internal/metadata/importlib/__pycache__,, pip/_vendor/rich/live_render.cpython-311.pyc,, pip/_vendor/chardet/langgreekmodel.cpython-311.pyc,, pip/_vendor/cachecontrol/caches/file_cache.cpython-311.pyc,, pip/_vendor/tenacity/after.cpython-311.pyc,, pip/_vendor/resolvelib/__init__.cpython-311.pyc,, pip/_internal/resolution/base.cpython-311.pyc,, pip/_vendor/truststore/_windows.cpython-311.pyc,, pip/_vendor/chardet/langrussianmodel.cpython-311.pyc,, pip/_internal/index/collector.cpython-311.pyc,, pip/_vendor/chardet/enums.cpython-311.pyc,, pip/_internal/models/target_python.cpython-311.pyc,, pip/_vendor/six.cpython-311.pyc,, pip/_vendor/idna/compat.cpython-311.pyc,, pip/_vendor/distlib/index.cpython-311.pyc,, pip/_vendor/distlib/__init__.cpython-311.pyc,, pip/_vendor/urllib3/request.cpython-311.pyc,, pip/_internal/req/req_set.cpython-311.pyc,, pip/_internal/operations/check.cpython-311.pyc,, pip/_internal/operations/install/editable_legacy.cpython-311.pyc,, pip/_internal/vcs/subversion.cpython-311.pyc,, pip/_vendor/rich/table.cpython-311.pyc,, pip/_vendor/rich/_cell_widths.cpython-311.pyc,, pip/_vendor/packaging/__init__.cpython-311.pyc,, pip/_vendor/rich/_export_format.cpython-311.pyc,, pip/_vendor/urllib3/__init__.cpython-311.pyc,, pip/_internal/utils/entrypoints.cpython-311.pyc,, pip/_vendor/chardet/charsetgroupprober.cpython-311.pyc,, pip/_vendor/urllib3/util/wait.cpython-311.pyc,, pip/_vendor/colorama/tests/initialise_test.cpython-311.pyc,, pip/_vendor/cachecontrol/caches/__pycache__,, pip/_internal/build_env.cpython-311.pyc,, pip/_vendor/rich/segment.cpython-311.pyc,, pip/_internal/operations/build/build_tracker.cpython-311.pyc,, pip/_vendor/resolvelib/structs.cpython-311.pyc,, pip/_vendor/rich/cells.cpython-311.pyc,, pip/_internal/__init__.cpython-311.pyc,, pip/_internal/utils/datetime.cpython-311.pyc,, pip/_vendor/urllib3/util/proxy.cpython-311.pyc,, pip/_vendor/rich/default_styles.cpython-311.pyc,, pip/_vendor/urllib3/util/url.cpython-311.pyc,, pip-23.3.1.virtualenv,, pip/_vendor/idna/__pycache__,, pip/_internal/commands/install.cpython-311.pyc,, pip/_vendor/idna/core.cpython-311.pyc,, pip/_internal/operations/install/__init__.cpython-311.pyc,, pip/_vendor/truststore/_openssl.cpython-311.pyc,, pip/_vendor/pyproject_hooks/_in_process/__init__.cpython-311.pyc,, pip/_vendor/pyproject_hooks/__pycache__,, pip/_vendor/pygments/filters/__pycache__,, pip/_vendor/chardet/langbulgarianmodel.cpython-311.pyc,, pip/_internal/models/index.cpython-311.pyc,, pip/_internal/commands/uninstall.cpython-311.pyc,, pip/_vendor/chardet/langthaimodel.cpython-311.pyc,, pip/_internal/metadata/_json.cpython-311.pyc,, pip/_vendor/chardet/metadata/__pycache__,, pip/_internal/metadata/importlib/_dists.cpython-311.pyc,, pip/_vendor/tenacity/retry.cpython-311.pyc,, pip/_vendor/chardet/codingstatemachinedict.cpython-311.pyc,, pip/_internal/metadata/importlib/__init__.cpython-311.pyc,, pip/_vendor/chardet/universaldetector.cpython-311.pyc,, pip/_vendor/rich/box.cpython-311.pyc,, pip/_vendor/rich/filesize.cpython-311.pyc,, pip/_internal/distributions/wheel.cpython-311.pyc,, pip/_vendor/webencodings/x_user_defined.cpython-311.pyc,, pip/_internal/utils/filetypes.cpython-311.pyc,, pip/_vendor/pygments/formatter.cpython-311.pyc,, pip/_vendor/rich/errors.cpython-311.pyc,, pip/_vendor/distlib/resources.cpython-311.pyc,, pip/_vendor/truststore/__pycache__,, pip/_vendor/pyproject_hooks/_in_process/_in_process.cpython-311.pyc,, pip/_vendor/pygments/lexer.cpython-311.pyc,, pip/_internal/main.cpython-311.pyc,, pip/_internal/commands/show.cpython-311.pyc,, pip/_vendor/rich/palette.cpython-311.pyc,, pip/_internal/configuration.cpython-311.pyc,, pip/_vendor/rich/measure.cpython-311.pyc,, pip/_vendor/idna/idnadata.cpython-311.pyc,, pip/_internal/utils/misc.cpython-311.pyc,, pip/_vendor/distro/__main__.cpython-311.pyc,, pip/_internal/utils/temp_dir.cpython-311.pyc,, pip/_vendor/rich/theme.cpython-311.pyc,, pip/_vendor/rich/highlighter.cpython-311.pyc,, pip/_vendor/rich/pretty.cpython-311.pyc,, pip/_vendor/distlib/util.cpython-311.pyc,, pip/_vendor/cachecontrol/caches/__init__.cpython-311.pyc,, pip/_vendor/tomli/__init__.cpython-311.pyc,, pip/_vendor/chardet/chardistribution.cpython-311.pyc,, pip/_vendor/distro/distro.cpython-311.pyc,, pip/_vendor/msgpack/ext.cpython-311.pyc,, pip/_internal/resolution/resolvelib/found_candidates.cpython-311.pyc,, pip/_vendor/urllib3/util/timeout.cpython-311.pyc,, pip/_internal/models/search_scope.cpython-311.pyc,, pip/_internal/commands/completion.cpython-311.pyc,, pip/_internal/utils/packaging.cpython-311.pyc,, pip/_vendor/requests/structures.cpython-311.pyc,, pip/_vendor/rich/abc.cpython-311.pyc,, pip/_internal/utils/__pycache__,, pip/_internal/resolution/resolvelib/factory.cpython-311.pyc,, pip/_internal/distributions/base.cpython-311.pyc,, pip/_vendor/pygments/formatters/other.cpython-311.pyc,, pip/_vendor/rich/_fileno.cpython-311.pyc,, pip/_internal/vcs/git.cpython-311.pyc,, pip/_vendor/chardet/euctwfreq.cpython-311.pyc,, pip/_internal/utils/appdirs.cpython-311.pyc,, pip/_internal/commands/__pycache__,, pip/_vendor/chardet/metadata/__init__.cpython-311.pyc,, pip/_vendor/pyparsing/__init__.cpython-311.pyc,, pip/_vendor/rich/json.cpython-311.pyc,, pip/_internal/resolution/__init__.cpython-311.pyc,, pip/_internal/cli/progress_bars.cpython-311.pyc,, pip/_vendor/urllib3/response.cpython-311.pyc,, pip/_internal/commands/debug.cpython-311.pyc,, pip/_vendor/distro/__pycache__,, pip/__pycache__,, pip/_vendor/rich/emoji.cpython-311.pyc,, pip/_vendor/resolvelib/compat/__init__.cpython-311.pyc,, pip/_vendor/chardet/escprober.cpython-311.pyc,, pip/_internal/cli/status_codes.cpython-311.pyc,, pip/_internal/commands/list.cpython-311.pyc,, pip/_vendor/pygments/formatters/terminal.cpython-311.pyc,, pip/_vendor/truststore/__init__.cpython-311.pyc,, pip/_vendor/distlib/compat.cpython-311.pyc,, pip/_vendor/requests/__init__.cpython-311.pyc,, pip/_internal/metadata/__pycache__,, pip/_internal/self_outdated_check.cpython-311.pyc,, pip/_internal/req/__pycache__,, pip/_vendor/chardet/hebrewprober.cpython-311.pyc,, pip/_vendor/rich/text.cpython-311.pyc,, pip/_internal/operations/build/metadata_legacy.cpython-311.pyc,, pip/_vendor/certifi/__main__.cpython-311.pyc,, pip/_vendor/pygments/formatters/terminal256.cpython-311.pyc,, pip/_vendor/typing_extensions.cpython-311.pyc,, pip/_internal/commands/hash.cpython-311.pyc,, pip/_vendor/cachecontrol/cache.cpython-311.pyc,, pip/_vendor/pyparsing/actions.cpython-311.pyc,, pip/_vendor/urllib3/util/ssl_match_hostname.cpython-311.pyc,, pip/_vendor/rich/progress_bar.cpython-311.pyc,,
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/pip-23.3.1.dist-info/WHEEL
Wheel-Version: 1.0 Generator: bdist_wheel (0.41.2) Root-Is-Purelib: true Tag: py3-none-any
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/pip-23.3.1.dist-info/entry_points.txt
[console_scripts] pip = pip._internal.cli.main:main pip3 = pip._internal.cli.main:main pip3.11 = pip._internal.cli.main:main
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/pip-23.3.1.dist-info/top_level.txt
pip
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/pip-23.3.1.dist-info/LICENSE.txt
Copyright (c) 2008-present The pip developers (see AUTHORS.txt file) Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/pip-23.3.1.dist-info/AUTHORS.txt
@Switch01 A_Rog Aakanksha Agrawal Abhinav Sagar ABHYUDAY PRATAP SINGH abs51295 AceGentile Adam Chainz Adam Tse Adam Wentz admin Adrien Morison ahayrapetyan Ahilya AinsworthK Akash Srivastava Alan Yee Albert Tugushev Albert-Guan albertg Alberto Sottile Aleks Bunin Ales Erjavec Alethea Flowers Alex Gaynor Alex Grönholm Alex Hedges Alex Loosley Alex Morega Alex Stachowiak Alexander Shtyrov Alexandre Conrad Alexey Popravka Aleš Erjavec Alli Ami Fischman Ananya Maiti Anatoly Techtonik Anders Kaseorg Andre Aguiar Andreas Lutro Andrei Geacar Andrew Gaul Andrew Shymanel Andrey Bienkowski Andrey Bulgakov Andrés Delfino Andy Freeland Andy Kluger Ani Hayrapetyan Aniruddha Basak Anish Tambe Anrs Hu Anthony Sottile Antoine Musso Anton Ovchinnikov Anton Patrushev Antonio Alvarado Hernandez Antony Lee Antti Kaihola Anubhav Patel Anudit Nagar Anuj Godase AQNOUCH Mohammed AraHaan Arindam Choudhury Armin Ronacher Artem Arun Babu Neelicattu Ashley Manton Ashwin Ramaswami atse Atsushi Odagiri Avinash Karhana Avner Cohen Awit (Ah-Wit) Ghirmai Baptiste Mispelon Barney Gale barneygale Bartek Ogryczak Bastian Venthur Ben Bodenmiller Ben Darnell Ben Hoyt Ben Mares Ben Rosser Bence Nagy Benjamin Peterson Benjamin VanEvery Benoit Pierre Berker Peksag Bernard Bernard Tyers Bernardo B. Marques Bernhard M. Wiedemann Bertil Hatt Bhavam Vidyarthi Blazej Michalik Bogdan Opanchuk BorisZZZ Brad Erickson Bradley Ayers Brandon L. Reiss Brandt Bucher Brett Randall Brett Rosen Brian Cristante Brian Rosner briantracy BrownTruck Bruno Oliveira Bruno Renié Bruno S Bstrdsmkr Buck Golemon burrows Bussonnier Matthias bwoodsend c22 Caleb Martinez Calvin Smith Carl Meyer Carlos Liam Carol Willing Carter Thayer Cass Chandrasekhar Atina Chih-Hsuan Yen Chris Brinker Chris Hunt Chris Jerdonek Chris Kuehl Chris McDonough Chris Pawley Chris Pryer Chris Wolfe Christian Clauss Christian Heimes Christian Oudard Christoph Reiter Christopher Hunt Christopher Snyder cjc7373 Clark Boylan Claudio Jolowicz Clay McClure Cody Cody Soyland Colin Watson Collin Anderson Connor Osborn Cooper Lees Cooper Ry Lees Cory Benfield Cory Wright Craig Kerstiens Cristian Sorinel Cristina Cristina Muñoz Curtis Doty cytolentino Daan De Meyer Damian Damian Quiroga Damian Shaw Dan Black Dan Savilonis Dan Sully Dane Hillard daniel Daniel Collins Daniel Hahler Daniel Holth Daniel Jost Daniel Katz Daniel Shaulov Daniele Esposti Daniele Nicolodi Daniele Procida Daniil Konovalenko Danny Hermes Danny McClanahan Darren Kavanagh Dav Clark Dave Abrahams Dave Jones David Aguilar David Black David Bordeynik David Caro David D Lowe David Evans David Hewitt David Linke David Poggi David Pursehouse David Runge David Tucker David Wales Davidovich ddelange Deepak Sharma Deepyaman Datta Denise Yu dependabot[bot] derwolfe Desetude Devesh Kumar Singh Diego Caraballo Diego Ramirez DiegoCaraballo Dimitri Merejkowsky Dimitri Papadopoulos Dirk Stolle Dmitry Gladkov Dmitry Volodin Domen Kožar Dominic Davis-Foster Donald Stufft Dongweiming doron zarhi Dos Moonen Douglas Thor DrFeathers Dustin Ingram Dwayne Bailey Ed Morley Edgar Ramírez Ee Durbin Eitan Adler ekristina elainechan Eli Schwartz Elisha Hollander Ellen Marie Dash Emil Burzo Emil Styrke Emmanuel Arias Endoh Takanao enoch Erdinc Mutlu Eric Cousineau Eric Gillingham Eric Hanchrow Eric Hopper Erik M. Bray Erik Rose Erwin Janssen Eugene Vereshchagin everdimension Federico Felipe Peter Felix Yan fiber-space Filip Kokosiński Filipe Laíns Finn Womack finnagin Florian Briand Florian Rathgeber Francesco Francesco Montesano Frost Ming Gabriel Curio Gabriel de Perthuis Garry Polley gavin gdanielson Geoffrey Sneddon George Song Georgi Valkov Georgy Pchelkin ghost Giftlin Rajaiah gizmoguy1 gkdoc Godefroid Chapelle Gopinath M GOTO Hayato gousaiyang gpiks Greg Roodt Greg Ward Guilherme Espada Guillaume Seguin gutsytechster Guy Rozendorn Guy Tuval gzpan123 Hanjun Kim Hari Charan Harsh Vardhan harupy Harutaka Kawamura hauntsaninja Henrich Hartzer Henry Schreiner Herbert Pfennig Holly Stotelmyer Honnix Hsiaoming Yang Hugo Lopes Tavares Hugo van Kemenade Hugues Bruant Hynek Schlawack Ian Bicking Ian Cordasco Ian Lee Ian Stapleton Cordasco Ian Wienand Igor Kuzmitshov Igor Sobreira Ilan Schnell Illia Volochii Ilya Baryshev Inada Naoki Ionel Cristian Mărieș Ionel Maries Cristian Itamar Turner-Trauring Ivan Pozdeev Jacob Kim Jacob Walls Jaime Sanz jakirkham Jakub Kuczys Jakub Stasiak Jakub Vysoky Jakub Wilk James Cleveland James Curtin James Firth James Gerity James Polley Jan Pokorný Jannis Leidel Jarek Potiuk jarondl Jason Curtis Jason R. Coombs JasonMo JasonMo1 Jay Graves Jean-Christophe Fillion-Robin Jeff Barber Jeff Dairiki Jeff Widman Jelmer Vernooij jenix21 Jeremy Stanley Jeremy Zafran Jesse Rittner Jiashuo Li Jim Fisher Jim Garrison Jiun Bae Jivan Amara Joe Bylund Joe Michelini John Paton John T. Wodder II John-Scott Atlakson johnthagen Jon Banafato Jon Dufresne Jon Parise Jonas Nockert Jonathan Herbert Joonatan Partanen Joost Molenaar Jorge Niedbalski Joseph Bylund Joseph Long Josh Bronson Josh Hansen Josh Schneier Joshua Juan Luis Cano Rodríguez Juanjo Bazán Judah Rand Julian Berman Julian Gethmann Julien Demoor Jussi Kukkonen jwg4 Jyrki Pulliainen Kai Chen Kai Mueller Kamal Bin Mustafa kasium kaustav haldar keanemind Keith Maxwell Kelsey Hightower Kenneth Belitzky Kenneth Reitz Kevin Burke Kevin Carter Kevin Frommelt Kevin R Patterson Kexuan Sun Kit Randel Klaas van Schelven KOLANICH kpinc Krishna Oza Kumar McMillan Kurt McKee Kyle Persohn lakshmanaram Laszlo Kiss-Kollar Laurent Bristiel Laurent LAPORTE Laurie O Laurie Opperman layday Leon Sasson Lev Givon Lincoln de Sousa Lipis lorddavidiii Loren Carvalho Lucas Cimon Ludovic Gasc Lukas Geiger Lukas Juhrich Luke Macken Luo Jiebin luojiebin luz.paz László Kiss Kollár M00nL1ght Marc Abramowitz Marc Tamlyn Marcus Smith Mariatta Mark Kohler Mark Williams Markus Hametner Martey Dodoo Martin Fischer Martin Häcker Martin Pavlasek Masaki Masklinn Matej Stuchlik Mathew Jennings Mathieu Bridon Mathieu Kniewallner Matt Bacchi Matt Good Matt Maker Matt Robenolt matthew Matthew Einhorn Matthew Feickert Matthew Gilliard Matthew Iversen Matthew Treinish Matthew Trumbell Matthew Willson Matthias Bussonnier mattip Maurits van Rees Max W Chase Maxim Kurnikov Maxime Rouyrre mayeut mbaluna mdebi memoselyk meowmeowcat Michael Michael Aquilina Michael E. Karpeles Michael Klich Michael Mintz Michael Williamson michaelpacer Michał Górny Mickaël Schoentgen Miguel Araujo Perez Mihir Singh Mike Mike Hendricks Min RK MinRK Miro Hrončok Monica Baluna montefra Monty Taylor Muha Ajjan‮ Nadav Wexler Nahuel Ambrosini Nate Coraor Nate Prewitt Nathan Houghton Nathaniel J. Smith Nehal J Wani Neil Botelho Nguyễn Gia Phong Nicholas Serra Nick Coghlan Nick Stenning Nick Timkovich Nicolas Bock Nicole Harris Nikhil Benesch Nikhil Ladha Nikita Chepanov Nikolay Korolev Nipunn Koorapati Nitesh Sharma Niyas Sait Noah Noah Gorny Nowell Strite NtaleGrey nvdv OBITORASU Ofek Lev ofrinevo Oliver Freund Oliver Jeeves Oliver Mannion Oliver Tonnhofer Olivier Girardot Olivier Grisel Ollie Rutherfurd OMOTO Kenji Omry Yadan onlinejudge95 Oren Held Oscar Benjamin Oz N Tiram Pachwenko Patrick Dubroy Patrick Jenkins Patrick Lawson patricktokeeffe Patrik Kopkan Paul Ganssle Paul Kehrer Paul Moore Paul Nasrat Paul Oswald Paul van der Linden Paulus Schoutsen Pavel Safronov Pavithra Eswaramoorthy Pawel Jasinski Paweł Szramowski Pekka Klärck Peter Gessler Peter Lisák Peter Waller petr-tik Phaneendra Chiruvella Phil Elson Phil Freo Phil Pennock Phil Whelan Philip Jägenstedt Philip Molloy Philippe Ombredanne Pi Delport Pierre-Yves Rofes Pieter Degroote pip Prabakaran Kumaresshan Prabhjyotsing Surjit Singh Sodhi Prabhu Marappan Pradyun Gedam Prashant Sharma Pratik Mallya pre-commit-ci[bot] Preet Thakkar Preston Holmes Przemek Wrzos Pulkit Goyal q0w Qiangning Hong Quentin Lee Quentin Pradet R. David Murray Rafael Caricio Ralf Schmitt Razzi Abuissa rdb Reece Dunham Remi Rampin Rene Dudfield Riccardo Magliocchetti Riccardo Schirone Richard Jones Richard Si Ricky Ng-Adam Rishi RobberPhex Robert Collins Robert McGibbon Robert Pollak Robert T. McGibbon robin elisha robinson Roey Berman Rohan Jain Roman Bogorodskiy Roman Donchenko Romuald Brunet ronaudinho Ronny Pfannschmidt Rory McCann Ross Brattain Roy Wellington Ⅳ Ruairidh MacLeod Russell Keith-Magee Ryan Shepherd Ryan Wooden ryneeverett Sachi King Salvatore Rinchiera sandeepkiran-js Sander Van Balen Savio Jomton schlamar Scott Kitterman Sean seanj Sebastian Jordan Sebastian Schaetz Segev Finer SeongSoo Cho Sergey Vasilyev Seth Michael Larson Seth Woodworth Shahar Epstein Shantanu shireenrao Shivansh-007 Shlomi Fish Shovan Maity Simeon Visser Simon Cross Simon Pichugin sinoroc sinscary snook92 socketubs Sorin Sbarnea Srinivas Nyayapati Stavros Korokithakis Stefan Scherfke Stefano Rivera Stephan Erb Stephen Rosen stepshal Steve (Gadget) Barnes Steve Barnes Steve Dower Steve Kowalik Steven Myint Steven Silvester stonebig studioj Stéphane Bidoul Stéphane Bidoul (ACSONE) Stéphane Klein Sumana Harihareswara Surbhi Sharma Sviatoslav Sydorenko Swat009 Sylvain Takayuki SHIMIZUKAWA Taneli Hukkinen tbeswick Thiago Thijs Triemstra Thomas Fenzl Thomas Grainger Thomas Guettler Thomas Johansson Thomas Kluyver Thomas Smith Thomas VINCENT Tim D. Smith Tim Gates Tim Harder Tim Heap tim smith tinruufu Tobias Hermann Tom Forbes Tom Freudenheim Tom V Tomas Hrnciar Tomas Orsava Tomer Chachamu Tommi Enenkel | AnB Tomáš Hrnčiar Tony Beswick Tony Narlock Tony Zhaocheng Tan TonyBeswick toonarmycaptain Toshio Kuratomi toxinu Travis Swicegood Tushar Sadhwani Tzu-ping Chung Valentin Haenel Victor Stinner victorvpaulo Vikram - Google Viktor Szépe Ville Skyttä Vinay Sajip Vincent Philippon Vinicyus Macedo Vipul Kumar Vitaly Babiy Vladimir Rutsky W. Trevor King Wil Tan Wilfred Hughes William Edwards William ML Leslie William T Olson William Woodruff Wilson Mo wim glenn Winson Luk Wolfgang Maier Wu Zhenyu XAMES3 Xavier Fernandez xoviat xtreak YAMAMOTO Takashi Yen Chi Hsuan Yeray Diaz Diaz Yoval P Yu Jian Yuan Jing Vincent Yan Yusuke Hayashi Zearin Zhiping Deng ziebam Zvezdan Petkovic Łukasz Langa Роман Донченко Семён Марьясин ‮rekcäH nitraM‮
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/pip-23.3.1.dist-info/INSTALLER
pip
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/pip-23.3.1.dist-info/METADATA
Metadata-Version: 2.1 Name: pip Version: 23.3.1 Summary: The PyPA recommended tool for installing Python packages. Home-page: https://pip.pypa.io/ Author: The pip developers Author-email: distutils-sig@python.org License: MIT Project-URL: Documentation, https://pip.pypa.io Project-URL: Source, https://github.com/pypa/pip Project-URL: Changelog, https://pip.pypa.io/en/stable/news/ Classifier: Development Status :: 5 - Production/Stable Classifier: Intended Audience :: Developers Classifier: License :: OSI Approved :: MIT License Classifier: Topic :: Software Development :: Build Tools Classifier: Programming Language :: Python Classifier: Programming Language :: Python :: 3 Classifier: Programming Language :: Python :: 3 :: Only Classifier: Programming Language :: Python :: 3.7 Classifier: Programming Language :: Python :: 3.8 Classifier: Programming Language :: Python :: 3.9 Classifier: Programming Language :: Python :: 3.10 Classifier: Programming Language :: Python :: 3.11 Classifier: Programming Language :: Python :: 3.12 Classifier: Programming Language :: Python :: Implementation :: CPython Classifier: Programming Language :: Python :: Implementation :: PyPy Requires-Python: >=3.7 License-File: LICENSE.txt License-File: AUTHORS.txt pip - The Python Package Installer ================================== .. image:: https://img.shields.io/pypi/v/pip.svg :target: https://pypi.org/project/pip/ :alt: PyPI .. image:: https://img.shields.io/pypi/pyversions/pip :target: https://pypi.org/project/pip :alt: PyPI - Python Version .. image:: https://readthedocs.org/projects/pip/badge/?version=latest :target: https://pip.pypa.io/en/latest :alt: Documentation pip is the `package installer`_ for Python. You can use pip to install packages from the `Python Package Index`_ and other indexes. Please take a look at our documentation for how to install and use pip: * `Installation`_ * `Usage`_ We release updates regularly, with a new version every 3 months. Find more details in our documentation: * `Release notes`_ * `Release process`_ If you find bugs, need help, or want to talk to the developers, please use our mailing lists or chat rooms: * `Issue tracking`_ * `Discourse channel`_ * `User IRC`_ If you want to get involved head over to GitHub to get the source code, look at our development documentation and feel free to jump on the developer mailing lists and chat rooms: * `GitHub page`_ * `Development documentation`_ * `Development IRC`_ Code of Conduct --------------- Everyone interacting in the pip project's codebases, issue trackers, chat rooms, and mailing lists is expected to follow the `PSF Code of Conduct`_. .. _package installer: https://packaging.python.org/guides/tool-recommendations/ .. _Python Package Index: https://pypi.org .. _Installation: https://pip.pypa.io/en/stable/installation/ .. _Usage: https://pip.pypa.io/en/stable/ .. _Release notes: https://pip.pypa.io/en/stable/news.html .. _Release process: https://pip.pypa.io/en/latest/development/release-process/ .. _GitHub page: https://github.com/pypa/pip .. _Development documentation: https://pip.pypa.io/en/latest/development .. _Issue tracking: https://github.com/pypa/pip/issues .. _Discourse channel: https://discuss.python.org/c/packaging .. _User IRC: https://kiwiirc.com/nextclient/#ircs://irc.libera.chat:+6697/pypa .. _Development IRC: https://kiwiirc.com/nextclient/#ircs://irc.libera.chat:+6697/pypa-dev .. _PSF Code of Conduct: https://github.com/pypa/.github/blob/main/CODE_OF_CONDUCT.md
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/memoization.pyi
from typing import Any, Callable, Optional, overload, TypeVar, Hashable from memoization.constant.flag import CachingAlgorithmFlag as CachingAlgorithmFlagType from memoization.type.model import CachedFunction T = TypeVar('T', bound=Callable[..., Any]) __version__: str # Decorator with optional arguments - @cached(...) @overload def cached(max_size: Optional[int] = ..., ttl: Optional[float] = ..., algorithm: Optional[int] = ..., thread_safe: Optional[bool] = ..., order_independent: Optional[bool] = ..., custom_key_maker: Optional[Callable[..., Hashable]] = ...) -> Callable[[T], CachedFunction[T]]: ... # Bare decorator usage - @cache @overload def cached(user_function: T = ...) -> CachedFunction[T]: ... def suppress_warnings(should_warn: bool = ...) -> None: ... CachingAlgorithmFlag = CachingAlgorithmFlagType
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/__init__.py
import sys __all__ = ['cached', 'suppress_warnings', 'CachingAlgorithmFlag', 'FIFO', 'LRU', 'LFU'] if (3, 4) <= sys.version_info < (4, 0): # for Python >=3.4 <4 from . import memoization as _memoization try: _memoization except NameError: sys.stderr.write('python-memoization does not support your python version.\n') sys.stderr.write('Go to https://github.com/lonelyenvoy/python-memoization for usage and more details.\n') raise ImportError('Unsupported python version') else: cached = _memoization.cached suppress_warnings = _memoization.suppress_warnings CachingAlgorithmFlag = _memoization.CachingAlgorithmFlag FIFO = _memoization.CachingAlgorithmFlag.FIFO LRU = _memoization.CachingAlgorithmFlag.LRU LFU = _memoization.CachingAlgorithmFlag.LFU
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/memoization.py
from functools import partial, update_wrapper import inspect import warnings import memoization.caching.statistic_cache as statistic_cache import memoization.caching.plain_cache as plain_cache from memoization.constant.flag import CachingAlgorithmFlag as CachingAlgorithmFlag # for type-checking to work properly from memoization.config.algorithm_mapping import get_cache_toolkit # Public symbols __all__ = ['cached', 'suppress_warnings', 'CachingAlgorithmFlag'] __version__ = '0.4.0' # Whether warnings are enabled _warning_enabled = True # Insert the algorithm flags to the global namespace for convenience globals().update(CachingAlgorithmFlag.__members__) def cached(user_function=None, max_size=None, ttl=None, algorithm=CachingAlgorithmFlag.LRU, thread_safe=True, order_independent=False, custom_key_maker=None): """ @cached decorator wrapper :param user_function: The decorated function, to be cached. :param max_size: The max number of items can be held in the cache. :param ttl: Time-To-Live. Defining how long the cached data is valid (in seconds) If not given, the data in cache is valid forever. Valid only when max_size > 0 or max_size is None :param algorithm: The algorithm used when caching. Default: LRU (Least Recently Used) Valid only when max_size > 0 Refer to CachingAlgorithmFlag for possible choices. :param thread_safe: Whether the cache is thread safe. Setting it to False enhances performance. :param order_independent: Whether the cache is kwarg-order-independent. For the following code snippet: f(a=1, b=1) f(b=1, a=1) - If True, f(a=1, b=1) will be treated the same as f(b=1, a=1) and the cache will be hit once. - If False, they will be treated as different calls and the cache will miss. Setting it to True adds performance overhead. Valid only when (max_size > 0 or max_size is None) and custom_key_maker is None :param custom_key_maker: Use this parameter to override the default cache key maker. It should be a function with the same signature as user_function. - The produced key must be unique, which means two sets of different arguments always map to two different keys. - The produced key must be hashable and comparable with another key (the memoization library only needs to check for their equality). - Key computation should be efficient, and keys should be small objects. Valid only when max_size > 0 or max_size is None e.g. def get_employee_id(employee): return employee.id @cached(custom_key_maker=get_employee_id) def calculate_performance(employee): ... :return: decorator function """ # Adapt to the usage of calling the decorator and that of not calling it # i.e. @cached and @cached() if user_function is None: return partial(cached, max_size=max_size, ttl=ttl, algorithm=algorithm, thread_safe=thread_safe, order_independent=order_independent, custom_key_maker=custom_key_maker) # Perform type checking if not hasattr(user_function, '__call__'): raise TypeError('Unable to do memoization on non-callable object ' + str(user_function)) if max_size is not None: if not isinstance(max_size, int): raise TypeError('Expected max_size to be an integer or None') elif max_size < 0: raise ValueError('Expected max_size to be a nonnegative integer or None') if ttl is not None: if not isinstance(ttl, int) and not isinstance(ttl, float): raise TypeError('Expected ttl to be a number or None') elif ttl <= 0: raise ValueError('Expected ttl to be a positive number or None') if not isinstance(algorithm, CachingAlgorithmFlag): raise TypeError('Expected algorithm to be an instance of CachingAlgorithmFlag') if not isinstance(thread_safe, bool): raise TypeError('Expected thread_safe to be a boolean value') if not isinstance(order_independent, bool): raise TypeError('Expected order_independent to be a boolean value') if custom_key_maker is not None and not hasattr(custom_key_maker, '__call__'): raise TypeError('Expected custom_key_maker to be callable or None') # Check custom key maker and wrap it if custom_key_maker is not None: if _warning_enabled: custom_key_maker_info = inspect.getfullargspec(custom_key_maker) user_function_info = inspect.getfullargspec(user_function) if custom_key_maker_info.args != user_function_info.args or \ custom_key_maker_info.varargs != user_function_info.varargs or \ custom_key_maker_info.varkw != user_function_info.varkw or \ custom_key_maker_info.kwonlyargs != user_function_info.kwonlyargs or \ custom_key_maker_info.defaults != user_function_info.defaults or \ custom_key_maker_info.kwonlydefaults != user_function_info.kwonlydefaults: warnings.warn('Expected custom_key_maker to have the same signature as the function being cached. ' 'Call memoization.suppress_warnings() before using @cached to remove this message.', SyntaxWarning) def custom_key_maker_wrapper(args, kwargs): return custom_key_maker(*args, **kwargs) else: custom_key_maker_wrapper = None # Create wrapper wrapper = _create_cached_wrapper(user_function, max_size, ttl, algorithm, thread_safe, order_independent, custom_key_maker_wrapper) wrapper.__signature__ = inspect.signature(user_function) # copy the signature of user_function to the wrapper return update_wrapper(wrapper, user_function) # update wrapper to make it look like the original function def suppress_warnings(should_warn=False): """ Disable/Enable warnings when @cached is used Must be called before using @cached :param should_warn: Whether warnings should be shown (False by default) """ global _warning_enabled _warning_enabled = should_warn def _create_cached_wrapper(user_function, max_size, ttl, algorithm, thread_safe, order_independent, custom_key_maker): """ Factory that creates an actual executed function when a function is decorated with @cached """ if max_size == 0: return statistic_cache.get_caching_wrapper(user_function, max_size, ttl, algorithm, thread_safe, order_independent, custom_key_maker) elif max_size is None: return plain_cache.get_caching_wrapper(user_function, max_size, ttl, algorithm, thread_safe, order_independent, custom_key_maker) else: cache_toolkit = get_cache_toolkit(algorithm) return cache_toolkit.get_caching_wrapper(user_function, max_size, ttl, algorithm, thread_safe, order_independent, custom_key_maker) if __name__ == '__main__': import sys sys.stderr.write('python-memoization v' + __version__ + ': A powerful caching library for Python, with TTL support and multiple algorithm options.\n') sys.stderr.write('Go to https://github.com/lonelyenvoy/python-memoization for usage and more details.\n')
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/model.py
from collections import namedtuple __all__ = ['DummyWithable', 'HashedList', 'CacheInfo'] class DummyWithable(object): """ This class is used to create instances that can bypass "with" statements e.g. lock = DummyWithable() with lock: manipulate_data() """ __slots__ = () def __enter__(self): pass def __exit__(self, exc_type, exc_val, exc_tb): pass class HashedList(list): """ This class guarantees that hash() will be called no more than once per element. """ __slots__ = ('hash_value', ) def __init__(self, tup, hash_value): super().__init__(tup) self.hash_value = hash_value def __hash__(self): return self.hash_value # Named type CacheInfo CacheInfo = namedtuple('CacheInfo', ['hits', 'misses', 'current_size', 'max_size', 'algorithm', 'ttl', 'thread_safe', 'order_independent', 'use_custom_key'])
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/model.pyi
from typing import Any, Tuple, Optional class DummyWithable: __slots__: Tuple[str] = ... def __enter__(self) -> None: ... def __exit__(self, exc_type: Any, exc_val: Any, exc_tb: Any) -> None: ... class HashedList: hash_value: int = ... __slots__: Tuple[str] def __init__(self, tup: Tuple[Any], hash_value: int) -> None: ... def __hash__(self) -> int: ... class CacheInfo: hits: int misses: int current_size: int max_size: Optional[int] algorithm: int ttl: Optional[float] thread_safe: bool order_independent: bool use_custom_key: bool def __init__( self, hits: int, misses: int, current_size: int, max_size: Optional[int], algorithm: int, ttl: Optional[float], thread_safe: bool, order_independent: bool, use_custom_key: bool, ): ...
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/util/algorithm_extension_validator.py
import sys import traceback from memoization.constant.flag import CachingAlgorithmFlag from memoization.config.algorithm_mapping import get_cache_toolkit from memoization.model import CacheInfo from memoization import cached _problematic = False _non_internal_algorithms_found = False def validate(): """ Use this function to validate your extended caching algorithms. """ global _non_internal_algorithms_found internal_algorithms = ['FIFO', 'LRU', 'LFU'] has_cache_info = True for name, member in CachingAlgorithmFlag.__members__.items(): if name not in internal_algorithms: @cached(max_size=5, ttl=0.5, algorithm=member, thread_safe=True) def tested_function(x): return x def undecorated_tested_function(x): return x _non_internal_algorithms_found = True print('Found extended algorithm <{}>'.format(name)) try: cache_toolkit = get_cache_toolkit(member) except KeyError: _error('Cannot find mapping configuration for algorithm <{}>\n'.format(name)) return if not hasattr(cache_toolkit, 'get_caching_wrapper'): _error('Cannot find get_caching_wrapper function in module <{}>\n' .format(cache_toolkit.__name__)) return if not callable(cache_toolkit.get_caching_wrapper): _error('Expected {}.get_caching_wrapper to be callable\n' .format(cache_toolkit.__name__)) return wrapper = cache_toolkit.get_caching_wrapper( user_function=undecorated_tested_function, max_size=5, ttl=0.5, algorithm=member, thread_safe=True, order_independent=False, custom_key_maker=None) if not hasattr(wrapper, 'cache_info'): has_cache_info = False _error('Cannot find cache_info function in the cache wrapper of <{}>\n' .format(cache_toolkit.__name__)) elif not callable(wrapper.cache_info): has_cache_info = False _error('Expected cache_info of wrapper of <{}> to be callable\n' .format(cache_toolkit.__name__)) for function_name in ( 'cache_clear', 'cache_is_empty', 'cache_is_full', 'cache_contains_argument', 'cache_contains_result', 'cache_for_each', 'cache_arguments', 'cache_results', 'cache_items', 'cache_remove_if', ): _expect_has_attribute_and_callable(wrapper, function_name, cache_toolkit.__name__) for x in range(0, 5): tested_function(x) if has_cache_info: info = tested_function.cache_info() if not isinstance(info, CacheInfo): _error('The return value of cache_info is not an instance of CacheInfo') else: if not isinstance(info.hits, int): _error('Expected cache_info().hits to be an integer') if not isinstance(info.misses, int): _error('Expected cache_info().misses to be an integer') if not isinstance(info.current_size, int): _error('Expected cache_info().current_size to be an integer') if info.max_size is not None and not isinstance(info.max_size, int): _error('Expected cache_info().max_size to be an integer') if info.algorithm != member: _error('Expected cache_info().algorithm = <{}> to be <{}>' .format(info.algorithm, member)) if info.ttl is not None and not isinstance(info.ttl, int) and not isinstance(info.ttl, float): _error('Expected cache_info().ttl to be an integer or a float') if not isinstance(info.thread_safe, bool): _error('Expected cache_info().thread_safe to be a bool') def _expect_has_attribute_and_callable(wrapper, attribute_name, parent_object_name): if not hasattr(wrapper, attribute_name): _error('Cannot find {} function in the cache wrapper of <{}>\n'.format(attribute_name, parent_object_name)) elif not callable(getattr(wrapper, attribute_name)): _error('Expected {} of wrapper of <{}> to be callable\n'.format(attribute_name, parent_object_name)) def _error(message): global _problematic _problematic = True sys.stderr.write('[ERROR] ' + message + '\n') if __name__ == '__main__': try: validate() if _non_internal_algorithms_found is False: sys.stderr.write('No extended algorithms found. Please read the extension guidance.\n') else: if _problematic is False: print('\n[Validation OK]') print('Congratulations! Your extended algorithm passed the validation. Thanks for your efforts.') print('Please understand that this validator only ensure that the typings of your extension are correct. ' 'You are still required to write test cases for your algorithms.') else: _error('\nError(s) occurred during validation. It\'s likely that your extended algorithm ' 'does not function properly. Please read the extension guidance.\n' 'If you consider it a bug of the validator itself, you are welcome to fix it in ' 'your pull request or to create an issue for further help. Thanks!\n') except: _error('\nUnexpected error(s) occurred during validation. It\'s likely that your extended algorithm ' 'does not function properly. Please read the extension guidance.\n' 'If you consider it a bug of the validator itself, you are welcome to fix it in ' 'your pull request or to create an issue for further help. Thanks!\n') traceback.print_exc()
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/config/algorithm_mapping.pyi
from types import ModuleType from typing import Callable, Any, Optional, Hashable, TypeVar from memoization.type.model import CachedFunction T = TypeVar('T', bound=Callable[..., Any]) class CacheToolkit(ModuleType): def get_caching_wrapper(self, user_function: T, max_size: Optional[int], ttl: Optional[float], algorithm: Optional[int], thread_safe: Optional[bool], order_independent: Optional[bool], custom_key_maker: Optional[Callable[..., Hashable]]) -> CachedFunction[T]: ... def get_cache_toolkit(algorithm: int = ...) -> CacheToolkit: ...
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/config/algorithm_mapping.py
from memoization.constant.flag import CachingAlgorithmFlag import memoization.caching.fifo_cache as fifo_cache import memoization.caching.lru_cache as lru_cache import memoization.caching.lfu_cache as lfu_cache def get_cache_toolkit(algorithm=CachingAlgorithmFlag.FIFO): algorithm_mapping = { CachingAlgorithmFlag.FIFO: fifo_cache, CachingAlgorithmFlag.LRU: lru_cache, CachingAlgorithmFlag.LFU: lfu_cache, } try: return algorithm_mapping[algorithm] except KeyError: raise KeyError('Unrecognized caching algorithm flag')
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/backport/__init__.py
__all__ = ['enum'] from . import backport_enum as enum
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/backport/backport_enum.py
# This file is a duplicate of enum.py in stdlib of Python 3.7.2 # DO NOT modify import sys from types import MappingProxyType, DynamicClassAttribute # try _collections first to reduce startup cost try: from _collections import OrderedDict except ImportError: from collections import OrderedDict __all__ = [ 'EnumMeta', 'Enum', 'IntEnum', 'Flag', 'IntFlag', 'auto', 'unique', ] def _is_descriptor(obj): """Returns True if obj is a descriptor, False otherwise.""" return ( hasattr(obj, '__get__') or hasattr(obj, '__set__') or hasattr(obj, '__delete__')) def _is_dunder(name): """Returns True if a __dunder__ name, False otherwise.""" return (name[:2] == name[-2:] == '__' and name[2:3] != '_' and name[-3:-2] != '_' and len(name) > 4) def _is_sunder(name): """Returns True if a _sunder_ name, False otherwise.""" return (name[0] == name[-1] == '_' and name[1:2] != '_' and name[-2:-1] != '_' and len(name) > 2) def _make_class_unpicklable(cls): """Make the given class un-picklable.""" def _break_on_call_reduce(self, proto): raise TypeError('%r cannot be pickled' % self) cls.__reduce_ex__ = _break_on_call_reduce cls.__module__ = '<unknown>' _auto_null = object() class auto: """ Instances are replaced with an appropriate value in Enum class suites. """ value = _auto_null class _EnumDict(dict): """Track enum member order and ensure member names are not reused. EnumMeta will use the names found in self._member_names as the enumeration member names. """ def __init__(self): super().__init__() self._member_names = [] self._last_values = [] self._ignore = [] def __setitem__(self, key, value): """Changes anything not dundered or not a descriptor. If an enum member name is used twice, an error is raised; duplicate values are not checked for. Single underscore (sunder) names are reserved. """ if _is_sunder(key): if key not in ( '_order_', '_create_pseudo_member_', '_generate_next_value_', '_missing_', '_ignore_', ): raise ValueError('_names_ are reserved for future Enum use') if key == '_generate_next_value_': setattr(self, '_generate_next_value', value) elif key == '_ignore_': if isinstance(value, str): value = value.replace(',',' ').split() else: value = list(value) self._ignore = value already = set(value) & set(self._member_names) if already: raise ValueError('_ignore_ cannot specify already set names: %r' % (already, )) elif _is_dunder(key): if key == '__order__': key = '_order_' elif key in self._member_names: # descriptor overwriting an enum? raise TypeError('Attempted to reuse key: %r' % key) elif key in self._ignore: pass elif not _is_descriptor(value): if key in self: # enum overwriting a descriptor? raise TypeError('%r already defined as: %r' % (key, self[key])) if isinstance(value, auto): if value.value == _auto_null: value.value = self._generate_next_value(key, 1, len(self._member_names), self._last_values[:]) value = value.value self._member_names.append(key) self._last_values.append(value) super().__setitem__(key, value) # Dummy value for Enum as EnumMeta explicitly checks for it, but of course # until EnumMeta finishes running the first time the Enum class doesn't exist. # This is also why there are checks in EnumMeta like `if Enum is not None` Enum = None class EnumMeta(type): """Metaclass for Enum""" @classmethod def __prepare__(metacls, cls, bases): # create the namespace dict enum_dict = _EnumDict() # inherit previous flags and _generate_next_value_ function member_type, first_enum = metacls._get_mixins_(bases) if first_enum is not None: enum_dict['_generate_next_value_'] = getattr(first_enum, '_generate_next_value_', None) return enum_dict def __new__(metacls, cls, bases, classdict): # an Enum class is final once enumeration items have been defined; it # cannot be mixed with other types (int, float, etc.) if it has an # inherited __new__ unless a new __new__ is defined (or the resulting # class will fail). # # remove any keys listed in _ignore_ classdict.setdefault('_ignore_', []).append('_ignore_') ignore = classdict['_ignore_'] for key in ignore: classdict.pop(key, None) member_type, first_enum = metacls._get_mixins_(bases) __new__, save_new, use_args = metacls._find_new_(classdict, member_type, first_enum) # save enum items into separate mapping so they don't get baked into # the new class enum_members = {k: classdict[k] for k in classdict._member_names} for name in classdict._member_names: del classdict[name] # adjust the sunders _order_ = classdict.pop('_order_', None) # check for illegal enum names (any others?) invalid_names = set(enum_members) & {'mro', } if invalid_names: raise ValueError('Invalid enum member name: {0}'.format( ','.join(invalid_names))) # create a default docstring if one has not been provided if '__doc__' not in classdict: classdict['__doc__'] = 'An enumeration.' # create our new Enum type enum_class = super().__new__(metacls, cls, bases, classdict) enum_class._member_names_ = [] # names in definition order enum_class._member_map_ = OrderedDict() # name->value map enum_class._member_type_ = member_type # save DynamicClassAttribute attributes from super classes so we know # if we can take the shortcut of storing members in the class dict dynamic_attributes = {k for c in enum_class.mro() for k, v in c.__dict__.items() if isinstance(v, DynamicClassAttribute)} # Reverse value->name map for hashable values. enum_class._value2member_map_ = {} # If a custom type is mixed into the Enum, and it does not know how # to pickle itself, pickle.dumps will succeed but pickle.loads will # fail. Rather than have the error show up later and possibly far # from the source, sabotage the pickle protocol for this class so # that pickle.dumps also fails. # # However, if the new class implements its own __reduce_ex__, do not # sabotage -- it's on them to make sure it works correctly. We use # __reduce_ex__ instead of any of the others as it is preferred by # pickle over __reduce__, and it handles all pickle protocols. if '__reduce_ex__' not in classdict: if member_type is not object: methods = ('__getnewargs_ex__', '__getnewargs__', '__reduce_ex__', '__reduce__') if not any(m in member_type.__dict__ for m in methods): _make_class_unpicklable(enum_class) # instantiate them, checking for duplicates as we go # we instantiate first instead of checking for duplicates first in case # a custom __new__ is doing something funky with the values -- such as # auto-numbering ;) for member_name in classdict._member_names: value = enum_members[member_name] if not isinstance(value, tuple): args = (value, ) else: args = value if member_type is tuple: # special case for tuple enums args = (args, ) # wrap it one more time if not use_args: enum_member = __new__(enum_class) if not hasattr(enum_member, '_value_'): enum_member._value_ = value else: enum_member = __new__(enum_class, *args) if not hasattr(enum_member, '_value_'): if member_type is object: enum_member._value_ = value else: enum_member._value_ = member_type(*args) value = enum_member._value_ enum_member._name_ = member_name enum_member.__objclass__ = enum_class enum_member.__init__(*args) # If another member with the same value was already defined, the # new member becomes an alias to the existing one. for name, canonical_member in enum_class._member_map_.items(): if canonical_member._value_ == enum_member._value_: enum_member = canonical_member break else: # Aliases don't appear in member names (only in __members__). enum_class._member_names_.append(member_name) # performance boost for any member that would not shadow # a DynamicClassAttribute if member_name not in dynamic_attributes: setattr(enum_class, member_name, enum_member) # now add to _member_map_ enum_class._member_map_[member_name] = enum_member try: # This may fail if value is not hashable. We can't add the value # to the map, and by-value lookups for this value will be # linear. enum_class._value2member_map_[value] = enum_member except TypeError: pass # double check that repr and friends are not the mixin's or various # things break (such as pickle) for name in ('__repr__', '__str__', '__format__', '__reduce_ex__'): class_method = getattr(enum_class, name) obj_method = getattr(member_type, name, None) enum_method = getattr(first_enum, name, None) if obj_method is not None and obj_method is class_method: setattr(enum_class, name, enum_method) # replace any other __new__ with our own (as long as Enum is not None, # anyway) -- again, this is to support pickle if Enum is not None: # if the user defined their own __new__, save it before it gets # clobbered in case they subclass later if save_new: enum_class.__new_member__ = __new__ enum_class.__new__ = Enum.__new__ # py3 support for definition order (helps keep py2/py3 code in sync) if _order_ is not None: if isinstance(_order_, str): _order_ = _order_.replace(',', ' ').split() if _order_ != enum_class._member_names_: raise TypeError('member order does not match _order_') return enum_class def __bool__(self): """ classes/types should always be True. """ return True def __call__(cls, value, names=None, *, module=None, qualname=None, type=None, start=1): """Either returns an existing member, or creates a new enum class. This method is used both when an enum class is given a value to match to an enumeration member (i.e. Color(3)) and for the functional API (i.e. Color = Enum('Color', names='RED GREEN BLUE')). When used for the functional API: `value` will be the name of the new class. `names` should be either a string of white-space/comma delimited names (values will start at `start`), or an iterator/mapping of name, value pairs. `module` should be set to the module this class is being created in; if it is not set, an attempt to find that module will be made, but if it fails the class will not be picklable. `qualname` should be set to the actual location this class can be found at in its module; by default it is set to the global scope. If this is not correct, unpickling will fail in some circumstances. `type`, if set, will be mixed in as the first base class. """ if names is None: # simple value lookup return cls.__new__(cls, value) # otherwise, functional API: we're creating a new Enum type return cls._create_(value, names, module=module, qualname=qualname, type=type, start=start) def __contains__(cls, member): if not isinstance(member, Enum): import warnings warnings.warn( "using non-Enums in containment checks will raise " "TypeError in Python 3.8", DeprecationWarning, 2) return isinstance(member, cls) and member._name_ in cls._member_map_ def __delattr__(cls, attr): # nicer error message when someone tries to delete an attribute # (see issue19025). if attr in cls._member_map_: raise AttributeError( "%s: cannot delete Enum member." % cls.__name__) super().__delattr__(attr) def __dir__(self): return (['__class__', '__doc__', '__members__', '__module__'] + self._member_names_) def __getattr__(cls, name): """Return the enum member matching `name` We use __getattr__ instead of descriptors or inserting into the enum class' __dict__ in order to support `name` and `value` being both properties for enum members (which live in the class' __dict__) and enum members themselves. """ if _is_dunder(name): raise AttributeError(name) try: return cls._member_map_[name] except KeyError: raise AttributeError(name) from None def __getitem__(cls, name): return cls._member_map_[name] def __iter__(cls): return (cls._member_map_[name] for name in cls._member_names_) def __len__(cls): return len(cls._member_names_) @property def __members__(cls): """Returns a mapping of member name->value. This mapping lists all enum members, including aliases. Note that this is a read-only view of the internal mapping. """ return MappingProxyType(cls._member_map_) def __repr__(cls): return "<enum %r>" % cls.__name__ def __reversed__(cls): return (cls._member_map_[name] for name in reversed(cls._member_names_)) def __setattr__(cls, name, value): """Block attempts to reassign Enum members. A simple assignment to the class namespace only changes one of the several possible ways to get an Enum member from the Enum class, resulting in an inconsistent Enumeration. """ member_map = cls.__dict__.get('_member_map_', {}) if name in member_map: raise AttributeError('Cannot reassign members.') super().__setattr__(name, value) def _create_(cls, class_name, names, *, module=None, qualname=None, type=None, start=1): """Convenience method to create a new Enum class. `names` can be: * A string containing member names, separated either with spaces or commas. Values are incremented by 1 from `start`. * An iterable of member names. Values are incremented by 1 from `start`. * An iterable of (member name, value) pairs. * A mapping of member name -> value pairs. """ metacls = cls.__class__ bases = (cls, ) if type is None else (type, cls) _, first_enum = cls._get_mixins_(bases) classdict = metacls.__prepare__(class_name, bases) # special processing needed for names? if isinstance(names, str): names = names.replace(',', ' ').split() if isinstance(names, (tuple, list)) and names and isinstance(names[0], str): original_names, names = names, [] last_values = [] for count, name in enumerate(original_names): value = first_enum._generate_next_value_(name, start, count, last_values[:]) last_values.append(value) names.append((name, value)) # Here, names is either an iterable of (name, value) or a mapping. for item in names: if isinstance(item, str): member_name, member_value = item, names[item] else: member_name, member_value = item classdict[member_name] = member_value enum_class = metacls.__new__(metacls, class_name, bases, classdict) # TODO: replace the frame hack if a blessed way to know the calling # module is ever developed if module is None: try: module = sys._getframe(2).f_globals['__name__'] except (AttributeError, ValueError) as exc: pass if module is None: _make_class_unpicklable(enum_class) else: enum_class.__module__ = module if qualname is not None: enum_class.__qualname__ = qualname return enum_class @staticmethod def _get_mixins_(bases): """Returns the type for creating enum members, and the first inherited enum class. bases: the tuple of bases that was given to __new__ """ if not bases: return object, Enum def _find_data_type(bases): for chain in bases: for base in chain.__mro__: if base is object: continue elif '__new__' in base.__dict__: if issubclass(base, Enum): continue return base # ensure final parent class is an Enum derivative, find any concrete # data type, and check that Enum has no members first_enum = bases[-1] if not issubclass(first_enum, Enum): raise TypeError("new enumerations should be created as " "`EnumName([mixin_type, ...] [data_type,] enum_type)`") member_type = _find_data_type(bases) or object if first_enum._member_names_: raise TypeError("Cannot extend enumerations") return member_type, first_enum @staticmethod def _find_new_(classdict, member_type, first_enum): """Returns the __new__ to be used for creating the enum members. classdict: the class dictionary given to __new__ member_type: the data type whose __new__ will be used by default first_enum: enumeration to check for an overriding __new__ """ # now find the correct __new__, checking to see of one was defined # by the user; also check earlier enum classes in case a __new__ was # saved as __new_member__ __new__ = classdict.get('__new__', None) # should __new__ be saved as __new_member__ later? save_new = __new__ is not None if __new__ is None: # check all possibles for __new_member__ before falling back to # __new__ for method in ('__new_member__', '__new__'): for possible in (member_type, first_enum): target = getattr(possible, method, None) if target not in { None, None.__new__, object.__new__, Enum.__new__, }: __new__ = target break if __new__ is not None: break else: __new__ = object.__new__ # if a non-object.__new__ is used then whatever value/tuple was # assigned to the enum member name will be passed to __new__ and to the # new enum member's __init__ if __new__ is object.__new__: use_args = False else: use_args = True return __new__, save_new, use_args class Enum(metaclass=EnumMeta): """Generic enumeration. Derive from this class to define new enumerations. """ def __new__(cls, value): # all enum instances are actually created during class construction # without calling this method; this method is called by the metaclass' # __call__ (i.e. Color(3) ), and by pickle if type(value) is cls: # For lookups like Color(Color.RED) return value # by-value search for a matching enum member # see if it's in the reverse mapping (for hashable values) try: if value in cls._value2member_map_: return cls._value2member_map_[value] except TypeError: # not there, now do long search -- O(n) behavior for member in cls._member_map_.values(): if member._value_ == value: return member # still not found -- try _missing_ hook try: exc = None result = cls._missing_(value) except Exception as e: exc = e result = None if isinstance(result, cls): return result else: ve_exc = ValueError("%r is not a valid %s" % (value, cls.__name__)) if result is None and exc is None: raise ve_exc elif exc is None: exc = TypeError( 'error in %s._missing_: returned %r instead of None or a valid member' % (cls.__name__, result) ) exc.__context__ = ve_exc raise exc def _generate_next_value_(name, start, count, last_values): for last_value in reversed(last_values): try: return last_value + 1 except TypeError: pass else: return start @classmethod def _missing_(cls, value): raise ValueError("%r is not a valid %s" % (value, cls.__name__)) def __repr__(self): return "<%s.%s: %r>" % ( self.__class__.__name__, self._name_, self._value_) def __str__(self): return "%s.%s" % (self.__class__.__name__, self._name_) def __dir__(self): added_behavior = [ m for cls in self.__class__.mro() for m in cls.__dict__ if m[0] != '_' and m not in self._member_map_ ] return (['__class__', '__doc__', '__module__'] + added_behavior) def __format__(self, format_spec): # mixed-in Enums should use the mixed-in type's __format__, otherwise # we can get strange results with the Enum name showing up instead of # the value # pure Enum branch if self._member_type_ is object: cls = str val = str(self) # mix-in branch else: cls = self._member_type_ val = self._value_ return cls.__format__(val, format_spec) def __hash__(self): return hash(self._name_) def __reduce_ex__(self, proto): return self.__class__, (self._value_, ) # DynamicClassAttribute is used to provide access to the `name` and # `value` properties of enum members while keeping some measure of # protection from modification, while still allowing for an enumeration # to have members named `name` and `value`. This works because enumeration # members are not set directly on the enum class -- __getattr__ is # used to look them up. @DynamicClassAttribute def name(self): """The name of the Enum member.""" return self._name_ @DynamicClassAttribute def value(self): """The value of the Enum member.""" return self._value_ @classmethod def _convert(cls, name, module, filter, source=None): """ Create a new Enum subclass that replaces a collection of global constants """ # convert all constants from source (or module) that pass filter() to # a new Enum called name, and export the enum and its members back to # module; # also, replace the __reduce_ex__ method so unpickling works in # previous Python versions module_globals = vars(sys.modules[module]) if source: source = vars(source) else: source = module_globals # We use an OrderedDict of sorted source keys so that the # _value2member_map is populated in the same order every time # for a consistent reverse mapping of number to name when there # are multiple names for the same number rather than varying # between runs due to hash randomization of the module dictionary. members = [ (name, source[name]) for name in source.keys() if filter(name)] try: # sort by value members.sort(key=lambda t: (t[1], t[0])) except TypeError: # unless some values aren't comparable, in which case sort by name members.sort(key=lambda t: t[0]) cls = cls(name, members, module=module) cls.__reduce_ex__ = _reduce_ex_by_name module_globals.update(cls.__members__) module_globals[name] = cls return cls class IntEnum(int, Enum): """Enum where members are also (and must be) ints""" def _reduce_ex_by_name(self, proto): return self.name class Flag(Enum): """Support for flags""" def _generate_next_value_(name, start, count, last_values): """ Generate the next value when not given. name: the name of the member start: the initital start value or None count: the number of existing members last_value: the last value assigned or None """ if not count: return start if start is not None else 1 for last_value in reversed(last_values): try: high_bit = _high_bit(last_value) break except Exception: raise TypeError('Invalid Flag value: %r' % last_value) from None return 2 ** (high_bit+1) @classmethod def _missing_(cls, value): original_value = value if value < 0: value = ~value possible_member = cls._create_pseudo_member_(value) if original_value < 0: possible_member = ~possible_member return possible_member @classmethod def _create_pseudo_member_(cls, value): """ Create a composite member iff value contains only members. """ pseudo_member = cls._value2member_map_.get(value, None) if pseudo_member is None: # verify all bits are accounted for _, extra_flags = _decompose(cls, value) if extra_flags: raise ValueError("%r is not a valid %s" % (value, cls.__name__)) # construct a singleton enum pseudo-member pseudo_member = object.__new__(cls) pseudo_member._name_ = None pseudo_member._value_ = value # use setdefault in case another thread already created a composite # with this value pseudo_member = cls._value2member_map_.setdefault(value, pseudo_member) return pseudo_member def __contains__(self, other): if not isinstance(other, self.__class__): import warnings warnings.warn( "using non-Flags in containment checks will raise " "TypeError in Python 3.8", DeprecationWarning, 2) return False return other._value_ & self._value_ == other._value_ def __repr__(self): cls = self.__class__ if self._name_ is not None: return '<%s.%s: %r>' % (cls.__name__, self._name_, self._value_) members, uncovered = _decompose(cls, self._value_) return '<%s.%s: %r>' % ( cls.__name__, '|'.join([str(m._name_ or m._value_) for m in members]), self._value_, ) def __str__(self): cls = self.__class__ if self._name_ is not None: return '%s.%s' % (cls.__name__, self._name_) members, uncovered = _decompose(cls, self._value_) if len(members) == 1 and members[0]._name_ is None: return '%s.%r' % (cls.__name__, members[0]._value_) else: return '%s.%s' % ( cls.__name__, '|'.join([str(m._name_ or m._value_) for m in members]), ) def __bool__(self): return bool(self._value_) def __or__(self, other): if not isinstance(other, self.__class__): return NotImplemented return self.__class__(self._value_ | other._value_) def __and__(self, other): if not isinstance(other, self.__class__): return NotImplemented return self.__class__(self._value_ & other._value_) def __xor__(self, other): if not isinstance(other, self.__class__): return NotImplemented return self.__class__(self._value_ ^ other._value_) def __invert__(self): members, uncovered = _decompose(self.__class__, self._value_) inverted = self.__class__(0) for m in self.__class__: if m not in members and not (m._value_ & self._value_): inverted = inverted | m return self.__class__(inverted) class IntFlag(int, Flag): """Support for integer-based Flags""" @classmethod def _missing_(cls, value): if not isinstance(value, int): raise ValueError("%r is not a valid %s" % (value, cls.__name__)) new_member = cls._create_pseudo_member_(value) return new_member @classmethod def _create_pseudo_member_(cls, value): pseudo_member = cls._value2member_map_.get(value, None) if pseudo_member is None: need_to_create = [value] # get unaccounted for bits _, extra_flags = _decompose(cls, value) # timer = 10 while extra_flags: # timer -= 1 bit = _high_bit(extra_flags) flag_value = 2 ** bit if (flag_value not in cls._value2member_map_ and flag_value not in need_to_create ): need_to_create.append(flag_value) if extra_flags == -flag_value: extra_flags = 0 else: extra_flags ^= flag_value for value in reversed(need_to_create): # construct singleton pseudo-members pseudo_member = int.__new__(cls, value) pseudo_member._name_ = None pseudo_member._value_ = value # use setdefault in case another thread already created a composite # with this value pseudo_member = cls._value2member_map_.setdefault(value, pseudo_member) return pseudo_member def __or__(self, other): if not isinstance(other, (self.__class__, int)): return NotImplemented result = self.__class__(self._value_ | self.__class__(other)._value_) return result def __and__(self, other): if not isinstance(other, (self.__class__, int)): return NotImplemented return self.__class__(self._value_ & self.__class__(other)._value_) def __xor__(self, other): if not isinstance(other, (self.__class__, int)): return NotImplemented return self.__class__(self._value_ ^ self.__class__(other)._value_) __ror__ = __or__ __rand__ = __and__ __rxor__ = __xor__ def __invert__(self): result = self.__class__(~self._value_) return result def _high_bit(value): """returns index of highest bit, or -1 if value is zero or negative""" return value.bit_length() - 1 def unique(enumeration): """Class decorator for enumerations ensuring unique member values.""" duplicates = [] for name, member in enumeration.__members__.items(): if name != member.name: duplicates.append((name, member.name)) if duplicates: alias_details = ', '.join( ["%s -> %s" % (alias, name) for (alias, name) in duplicates]) raise ValueError('duplicate values found in %r: %s' % (enumeration, alias_details)) return enumeration def _decompose(flag, value): """Extract all members from the value.""" # _decompose is only called if the value is not named not_covered = value negative = value < 0 # issue29167: wrap accesses to _value2member_map_ in a list to avoid race # conditions between iterating over it and having more pseudo- # members added to it if negative: # only check for named flags flags_to_check = [ (m, v) for v, m in list(flag._value2member_map_.items()) if m.name is not None ] else: # check for named flags and powers-of-two flags flags_to_check = [ (m, v) for v, m in list(flag._value2member_map_.items()) if m.name is not None or _power_of_two(v) ] members = [] for member, member_value in flags_to_check: if member_value and member_value & value == member_value: members.append(member) not_covered &= ~member_value if not members and value in flag._value2member_map_: members.append(flag._value2member_map_[value]) members.sort(key=lambda m: m._value_, reverse=True) if len(members) > 1 and members[0].value == value: # we have the breakdown, don't need the value member itself members.pop(0) return members, not_covered def _power_of_two(value): if value < 1: return False return value == 2 ** _high_bit(value)
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/type/model.pyi
from typing import TypeVar, Callable, Any, Protocol, Union, List, Tuple, Dict, Iterable from memoization.model import CacheInfo T = TypeVar('T', bound=Callable[..., Any]) class CachedFunction(Protocol[T]): __call__: T __wrapped__: T def cache_clear(self) -> None: """Clear the cache and its statistics information""" def cache_info(self) -> CacheInfo: """ Show statistics information :return: a CacheInfo object describing the cache """ def cache_is_empty(self) -> bool: """Return True if the cache contains no elements""" def cache_is_full(self) -> bool: """Return True if the cache is full""" def cache_contains_argument(self, function_arguments: Union[List, Tuple, Dict[str, Any]], alive_only: bool = ...) -> bool: """ Return True if the cache contains a cached item with the specified function call arguments :param function_arguments: Can be a list, a tuple or a dict. - Full arguments: use a list to represent both positional arguments and keyword arguments. The list contains two elements, a tuple (positional arguments) and a dict (keyword arguments). For example, f(1, 2, 3, a=4, b=5, c=6) can be represented by: [(1, 2, 3), {'a': 4, 'b': 5, 'c': 6}] - Positional arguments only: when the arguments does not include keyword arguments, a tuple can be used to represent positional arguments. For example, f(1, 2, 3) can be represented by: (1, 2, 3) - Keyword arguments only: when the arguments does not include positional arguments, a dict can be used to represent keyword arguments. For example, f(a=4, b=5, c=6) can be represented by: {'a': 4, 'b': 5, 'c': 6} :param alive_only: Whether to check alive cache item only (default to True). :return: True if the desired cached item is present, False otherwise. """ def cache_contains_result(self, return_value: Any, alive_only: bool = ...) -> bool: """ Return True if the cache contains a cache item with the specified user function return value. O(n) time complexity. :param return_value: A return value coming from the user function. :param alive_only: Whether to check alive cache item only (default to True). :return: True if the desired cached item is present, False otherwise. """ def cache_for_each(self, consumer: Callable[[Tuple[Tuple, Dict], Any, bool], None]) -> None: """ Perform the given action for each cache element in an order determined by the algorithm until all elements have been processed or the action throws an error :param consumer: an action function to process the cache elements. Must have 3 arguments: def consumer(user_function_arguments, user_function_result, is_alive): ... user_function_arguments is a tuple holding arguments in the form of (args, kwargs). args is a tuple holding positional arguments. kwargs is a dict holding keyword arguments. for example, for a function: foo(a, b, c, d), calling it by: foo(1, 2, c=3, d=4) user_function_arguments == ((1, 2), {'c': 3, 'd': 4}) user_function_result is a return value coming from the user function. is_alive is a boolean value indicating whether the cache is still alive (if a TTL is given). """ def cache_arguments(self) -> Iterable[Tuple[Tuple, Dict]]: """ Get user function arguments of all alive cache elements see also: cache_items() Example: @cached def f(a, b, c, d): ... f(1, 2, c=3, d=4) for argument in f.cache_arguments(): print(argument) # ((1, 2), {'c': 3, 'd': 4}) :return: an iterable which iterates through a list of a tuple containing a tuple (positional arguments) and a dict (keyword arguments) """ def cache_results(self) -> Iterable[Any]: """ Get user function return values of all alive cache elements see also: cache_items() Example: @cached def f(a): return a f('hello') for result in f.cache_results(): print(result) # 'hello' :return: an iterable which iterates through a list of user function result (of any type) """ def cache_items(self) -> Iterable[Tuple[Tuple[Tuple, Dict], Any]]: """ Get cache items, i.e. entries of all alive cache elements, in the form of (argument, result). argument: a tuple containing a tuple (positional arguments) and a dict (keyword arguments). result: a user function return value of any type. see also: cache_arguments(), cache_results(). Example: @cached def f(a, b, c, d): return 'the answer is ' + str(a) f(1, 2, c=3, d=4) for argument, result in f.cache_items(): print(argument) # ((1, 2), {'c': 3, 'd': 4}) print(result) # 'the answer is 1' :return: an iterable which iterates through a list of (argument, result) entries """ def cache_remove_if(self, predicate: Callable[[Tuple[Tuple, Dict], Any, bool], bool]) -> bool: """ Remove all cache elements that satisfy the given predicate :param predicate: a predicate function to judge whether the cache elements should be removed. Must have 3 arguments, and returns True or False: def consumer(user_function_arguments, user_function_result, is_alive): ... user_function_arguments is a tuple holding arguments in the form of (args, kwargs). args is a tuple holding positional arguments. kwargs is a dict holding keyword arguments. for example, for a function: foo(a, b, c, d), calling it by: foo(1, 2, c=3, d=4) user_function_arguments == ((1, 2), {'c': 3, 'd': 4}) user_function_result is a return value coming from the user function. is_alive is a boolean value indicating whether the cache is still alive (if a TTL is given). :return: True if at least one element is removed, False otherwise. """
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/type
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/type/caching/cache.pyi
from typing import Callable, Optional, Any, TypeVar, Protocol, Hashable from memoization.type.model import CachedFunction T = TypeVar('T', bound=Callable[..., Any]) def get_caching_wrapper(user_function: T, max_size: Optional[int], ttl: Optional[float], algorithm: Optional[int], thread_safe: Optional[bool], order_independent: Optional[bool], custom_key_maker: Optional[Callable[..., Hashable]]) -> CachedFunction[T]: ...
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/type/caching
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/type/caching/general/keys.pyi
from typing import Any, Tuple, Dict, Union, Optional from memoization.model import HashedList def make_key(args: Tuple[Any], kwargs: Optional[Dict[str, Any]], kwargs_mark: Tuple[object] = ...) -> Union[str, HashedList]: ...
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/constant/flag.py
try: import enum # only works on Python 3.5+ enum.IntFlag # only works on Python 3.6+ except (ImportError, AttributeError): # backport for Python 3.4 and 3.5 from memoization.backport import enum # type: ignore class CachingAlgorithmFlag(enum.IntFlag): """ Use this class to specify which caching algorithm you would like to use """ FIFO = 1 # First In First Out LRU = 2 # Least Recently Used LFU = 4 # Least Frequently Used
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/constant/flag.pyi
from typing import Mapping class CachingAlgorithmFlag: FIFO: int = ... LRU: int = ... LFU: int = ... __members__: Mapping[str, int]
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching/statistic_cache.pyi
from memoization.type.caching.cache import get_caching_wrapper as get_caching_wrapper
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching/lru_cache.py
from threading import RLock from memoization.model import DummyWithable, CacheInfo import memoization.caching.general.keys_order_dependent as keys_toolkit_order_dependent import memoization.caching.general.keys_order_independent as keys_toolkit_order_independent import memoization.caching.general.values_with_ttl as values_toolkit_with_ttl import memoization.caching.general.values_without_ttl as values_toolkit_without_ttl def get_caching_wrapper(user_function, max_size, ttl, algorithm, thread_safe, order_independent, custom_key_maker): """Get a caching wrapper for LRU cache""" cache = {} # the cache to store function results key_argument_map = {} # mapping from cache keys to user function arguments sentinel = object() # sentinel object for the default value of map.get hits = misses = 0 # hits and misses of the cache lock = RLock() if thread_safe else DummyWithable() # ensure thread-safe if ttl is not None: # set up values toolkit according to ttl values_toolkit = values_toolkit_with_ttl else: values_toolkit = values_toolkit_without_ttl if custom_key_maker is not None: # use custom make_key function make_key = custom_key_maker else: if order_independent: # set up keys toolkit according to order_independent make_key = keys_toolkit_order_independent.make_key else: make_key = keys_toolkit_order_dependent.make_key # for LRU list full = False # whether the cache is full or not root = [] # linked list root[:] = [root, root, None, None] # initialize by pointing to self _PREV = 0 # index for the previous node _NEXT = 1 # index for the next node _KEY = 2 # index for the key _VALUE = 3 # index for the value def wrapper(*args, **kwargs): """The actual wrapper""" nonlocal hits, misses, root, full key = make_key(args, kwargs) cache_expired = False with lock: node = cache.get(key, sentinel) if node is not sentinel: # move the node to the front of the list node_prev, node_next, _, result = node node_prev[_NEXT] = node_next node_next[_PREV] = node_prev node[_PREV] = root[_PREV] node[_NEXT] = root root[_PREV][_NEXT] = node root[_PREV] = node if values_toolkit.is_cache_value_valid(node[_VALUE]): # update statistics hits += 1 return values_toolkit.retrieve_result_from_cache_value(result) else: cache_expired = True misses += 1 result = user_function(*args, **kwargs) with lock: if key in cache: if cache_expired: # update cache with new ttl cache[key][_VALUE] = values_toolkit.make_cache_value(result, ttl) else: # result added to the cache while the lock was released # no need to add again pass elif full: # switch root to the oldest element in the cache old_root = root root = root[_NEXT] # keep references of root[_KEY] and root[_VALUE] to prevent arbitrary GC old_key = root[_KEY] old_value = root[_VALUE] # overwrite the content of the old root old_root[_KEY] = key old_root[_VALUE] = values_toolkit.make_cache_value(result, ttl) # clear the content of the new root root[_KEY] = root[_VALUE] = None # delete from cache del cache[old_key] del key_argument_map[old_key] # save the result to the cache cache[key] = old_root key_argument_map[key] = (args, kwargs) else: # add a node to the linked list last = root[_PREV] node = [last, root, key, values_toolkit.make_cache_value(result, ttl)] # new node cache[key] = root[_PREV] = last[_NEXT] = node # save result to the cache key_argument_map[key] = (args, kwargs) # check whether the cache is full full = (cache.__len__() >= max_size) return result def cache_clear(): """Clear the cache and its statistics information""" nonlocal hits, misses, full with lock: cache.clear() key_argument_map.clear() hits = misses = 0 full = False root[:] = [root, root, None, None] def cache_info(): """ Show statistics information :return: a CacheInfo object describing the cache """ with lock: return CacheInfo(hits, misses, cache.__len__(), max_size, algorithm, ttl, thread_safe, order_independent, custom_key_maker is not None) def cache_is_empty(): """Return True if the cache contains no elements""" return cache.__len__() == 0 def cache_is_full(): """Return True if the cache is full""" return full def cache_contains_argument(function_arguments, alive_only=True): """ Return True if the cache contains a cached item with the specified function call arguments :param function_arguments: Can be a list, a tuple or a dict. - Full arguments: use a list to represent both positional arguments and keyword arguments. The list contains two elements, a tuple (positional arguments) and a dict (keyword arguments). For example, f(1, 2, 3, a=4, b=5, c=6) can be represented by: [(1, 2, 3), {'a': 4, 'b': 5, 'c': 6}] - Positional arguments only: when the arguments does not include keyword arguments, a tuple can be used to represent positional arguments. For example, f(1, 2, 3) can be represented by: (1, 2, 3) - Keyword arguments only: when the arguments does not include positional arguments, a dict can be used to represent keyword arguments. For example, f(a=4, b=5, c=6) can be represented by: {'a': 4, 'b': 5, 'c': 6} :param alive_only: Whether to check alive cache item only (default to True). :return: True if the desired cached item is present, False otherwise. """ if isinstance(function_arguments, tuple): positional_argument_tuple = function_arguments keyword_argument_dict = {} elif isinstance(function_arguments, dict): positional_argument_tuple = () keyword_argument_dict = function_arguments elif isinstance(function_arguments, list) and len(function_arguments) == 2: positional_argument_tuple, keyword_argument_dict = function_arguments if not isinstance(positional_argument_tuple, tuple) or not isinstance(keyword_argument_dict, dict): raise TypeError('Expected function_arguments to be a list containing a positional argument tuple ' 'and a keyword argument dict') else: raise TypeError('Expected function_arguments to be a tuple, a dict, or a list with 2 elements') key = make_key(positional_argument_tuple, keyword_argument_dict) with lock: node = cache.get(key, sentinel) if node is not sentinel: return values_toolkit.is_cache_value_valid(node[_VALUE]) if alive_only else True return False def cache_contains_result(return_value, alive_only=True): """ Return True if the cache contains a cache item with the specified user function return value. O(n) time complexity. :param return_value: A return value coming from the user function. :param alive_only: Whether to check alive cache item only (default to True). :return: True if the desired cached item is present, False otherwise. """ with lock: node = root[_PREV] while node is not root: is_alive = values_toolkit.is_cache_value_valid(node[_VALUE]) cache_result = values_toolkit.retrieve_result_from_cache_value(node[_VALUE]) if cache_result == return_value: return is_alive if alive_only else True node = node[_PREV] return False def cache_for_each(consumer): """ Perform the given action for each cache element in an order determined by the algorithm until all elements have been processed or the action throws an error :param consumer: an action function to process the cache elements. Must have 3 arguments: def consumer(user_function_arguments, user_function_result, is_alive): ... user_function_arguments is a tuple holding arguments in the form of (args, kwargs). args is a tuple holding positional arguments. kwargs is a dict holding keyword arguments. for example, for a function: foo(a, b, c, d), calling it by: foo(1, 2, c=3, d=4) user_function_arguments == ((1, 2), {'c': 3, 'd': 4}) user_function_result is a return value coming from the user function. cache_result is a return value coming from the user function. is_alive is a boolean value indicating whether the cache is still alive (if a TTL is given). """ with lock: node = root[_PREV] while node is not root: is_alive = values_toolkit.is_cache_value_valid(node[_VALUE]) user_function_result = values_toolkit.retrieve_result_from_cache_value(node[_VALUE]) user_function_arguments = key_argument_map[node[_KEY]] consumer(user_function_arguments, user_function_result, is_alive) node = node[_PREV] def cache_arguments(): """ Get user function arguments of all alive cache elements see also: cache_items() Example: @cached def f(a, b, c, d): ... f(1, 2, c=3, d=4) for argument in f.cache_arguments(): print(argument) # ((1, 2), {'c': 3, 'd': 4}) :return: an iterable which iterates through a list of a tuple containing a tuple (positional arguments) and a dict (keyword arguments) """ with lock: node = root[_PREV] while node is not root: if values_toolkit.is_cache_value_valid(node[_VALUE]): yield key_argument_map[node[_KEY]] node = node[_PREV] def cache_results(): """ Get user function return values of all alive cache elements see also: cache_items() Example: @cached def f(a): return a f('hello') for result in f.cache_results(): print(result) # 'hello' :return: an iterable which iterates through a list of user function result (of any type) """ with lock: node = root[_PREV] while node is not root: if values_toolkit.is_cache_value_valid(node[_VALUE]): yield values_toolkit.retrieve_result_from_cache_value(node[_VALUE]) node = node[_PREV] def cache_items(): """ Get cache items, i.e. entries of all alive cache elements, in the form of (argument, result). argument: a tuple containing a tuple (positional arguments) and a dict (keyword arguments). result: a user function return value of any type. see also: cache_arguments(), cache_results(). Example: @cached def f(a, b, c, d): return 'the answer is ' + str(a) f(1, 2, c=3, d=4) for argument, result in f.cache_items(): print(argument) # ((1, 2), {'c': 3, 'd': 4}) print(result) # 'the answer is 1' :return: an iterable which iterates through a list of (argument, result) entries """ with lock: node = root[_PREV] while node is not root: if values_toolkit.is_cache_value_valid(node[_VALUE]): yield key_argument_map[node[_KEY]], values_toolkit.retrieve_result_from_cache_value(node[_VALUE]) node = node[_PREV] def cache_remove_if(predicate): """ Remove all cache elements that satisfy the given predicate :param predicate: a predicate function to judge whether the cache elements should be removed. Must have 3 arguments, and returns True or False: def consumer(user_function_arguments, user_function_result, is_alive): ... user_function_arguments is a tuple holding arguments in the form of (args, kwargs). args is a tuple holding positional arguments. kwargs is a dict holding keyword arguments. for example, for a function: foo(a, b, c, d), calling it by: foo(1, 2, c=3, d=4) user_function_arguments == ((1, 2), {'c': 3, 'd': 4}) user_function_result is a return value coming from the user function. cache_result is a return value coming from the user function. is_alive is a boolean value indicating whether the cache is still alive (if a TTL is given). :return: True if at least one element is removed, False otherwise. """ nonlocal full removed = False with lock: node = root[_PREV] while node is not root: is_alive = values_toolkit.is_cache_value_valid(node[_VALUE]) user_function_result = values_toolkit.retrieve_result_from_cache_value(node[_VALUE]) user_function_arguments = key_argument_map[node[_KEY]] if predicate(user_function_arguments, user_function_result, is_alive): removed = True node_prev = node[_PREV] # relink pointers of node.prev.next and node.next.prev node_prev[_NEXT] = node[_NEXT] node[_NEXT][_PREV] = node_prev # clear the content of this node key = node[_KEY] node[_KEY] = node[_VALUE] = None # delete from cache del cache[key] del key_argument_map[key] # check whether the cache is full full = (cache.__len__() >= max_size) node = node_prev else: node = node[_PREV] return removed # expose operations to wrapper wrapper.cache_clear = cache_clear wrapper.cache_info = cache_info wrapper.cache_is_empty = cache_is_empty wrapper.cache_is_full = cache_is_full wrapper.cache_contains_argument = cache_contains_argument wrapper.cache_contains_result = cache_contains_result wrapper.cache_for_each = cache_for_each wrapper.cache_arguments = cache_arguments wrapper.cache_results = cache_results wrapper.cache_items = cache_items wrapper.cache_remove_if = cache_remove_if wrapper._cache = cache wrapper._lru_root = root wrapper._root_name = '_lru_root' return wrapper
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching/lru_cache.pyi
from memoization.type.caching.cache import get_caching_wrapper as get_caching_wrapper
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching/fifo_cache.py
from threading import RLock from memoization.model import DummyWithable, CacheInfo import memoization.caching.general.keys_order_dependent as keys_toolkit_order_dependent import memoization.caching.general.keys_order_independent as keys_toolkit_order_independent import memoization.caching.general.values_with_ttl as values_toolkit_with_ttl import memoization.caching.general.values_without_ttl as values_toolkit_without_ttl def get_caching_wrapper(user_function, max_size, ttl, algorithm, thread_safe, order_independent, custom_key_maker): """Get a caching wrapper for FIFO cache""" cache = {} # the cache to store function results key_argument_map = {} # mapping from cache keys to user function arguments sentinel = object() # sentinel object for the default value of map.get hits = misses = 0 # hits and misses of the cache lock = RLock() if thread_safe else DummyWithable() # ensure thread-safe if ttl is not None: # set up values toolkit according to ttl values_toolkit = values_toolkit_with_ttl else: values_toolkit = values_toolkit_without_ttl if custom_key_maker is not None: # use custom make_key function make_key = custom_key_maker else: if order_independent: # set up keys toolkit according to order_independent make_key = keys_toolkit_order_independent.make_key else: make_key = keys_toolkit_order_dependent.make_key # for FIFO list full = False # whether the cache is full or not root = [] # linked list root[:] = [root, root, None, None] # initialize by pointing to self _PREV = 0 # index for the previous node _NEXT = 1 # index for the next node _KEY = 2 # index for the key _VALUE = 3 # index for the value def wrapper(*args, **kwargs): """The actual wrapper""" nonlocal hits, misses, root, full key = make_key(args, kwargs) cache_expired = False with lock: node = cache.get(key, sentinel) if node is not sentinel: if values_toolkit.is_cache_value_valid(node[_VALUE]): hits += 1 return values_toolkit.retrieve_result_from_cache_value(node[_VALUE]) else: cache_expired = True misses += 1 result = user_function(*args, **kwargs) with lock: if key in cache: if cache_expired: # update cache with new ttl cache[key][_VALUE] = values_toolkit.make_cache_value(result, ttl) else: # result added to the cache while the lock was released # no need to add again pass elif full: # switch root to the oldest element in the cache old_root = root root = root[_NEXT] # keep references of root[_KEY] and root[_VALUE] to prevent arbitrary GC old_key = root[_KEY] old_value = root[_VALUE] # overwrite the content of the old root old_root[_KEY] = key old_root[_VALUE] = values_toolkit.make_cache_value(result, ttl) # clear the content of the new root root[_KEY] = root[_VALUE] = None # delete from cache del cache[old_key] del key_argument_map[old_key] # save the result to the cache cache[key] = old_root key_argument_map[key] = (args, kwargs) else: # add a node to the linked list last = root[_PREV] node = [last, root, key, values_toolkit.make_cache_value(result, ttl)] # new node cache[key] = root[_PREV] = last[_NEXT] = node # save result to the cache key_argument_map[key] = (args, kwargs) # check whether the cache is full full = (cache.__len__() >= max_size) return result def cache_clear(): """Clear the cache and its statistics information""" nonlocal hits, misses, full with lock: cache.clear() key_argument_map.clear() hits = misses = 0 full = False root[:] = [root, root, None, None] def cache_info(): """ Show statistics information :return: a CacheInfo object describing the cache """ with lock: return CacheInfo(hits, misses, cache.__len__(), max_size, algorithm, ttl, thread_safe, order_independent, custom_key_maker is not None) def cache_is_empty(): """Return True if the cache contains no elements""" return cache.__len__() == 0 def cache_is_full(): """Return True if the cache is full""" return full def cache_contains_argument(function_arguments, alive_only=True): """ Return True if the cache contains a cached item with the specified function call arguments :param function_arguments: Can be a list, a tuple or a dict. - Full arguments: use a list to represent both positional arguments and keyword arguments. The list contains two elements, a tuple (positional arguments) and a dict (keyword arguments). For example, f(1, 2, 3, a=4, b=5, c=6) can be represented by: [(1, 2, 3), {'a': 4, 'b': 5, 'c': 6}] - Positional arguments only: when the arguments does not include keyword arguments, a tuple can be used to represent positional arguments. For example, f(1, 2, 3) can be represented by: (1, 2, 3) - Keyword arguments only: when the arguments does not include positional arguments, a dict can be used to represent keyword arguments. For example, f(a=4, b=5, c=6) can be represented by: {'a': 4, 'b': 5, 'c': 6} :param alive_only: Whether to check alive cache item only (default to True). :return: True if the desired cached item is present, False otherwise. """ if isinstance(function_arguments, tuple): positional_argument_tuple = function_arguments keyword_argument_dict = {} elif isinstance(function_arguments, dict): positional_argument_tuple = () keyword_argument_dict = function_arguments elif isinstance(function_arguments, list) and len(function_arguments) == 2: positional_argument_tuple, keyword_argument_dict = function_arguments if not isinstance(positional_argument_tuple, tuple) or not isinstance(keyword_argument_dict, dict): raise TypeError('Expected function_arguments to be a list containing a positional argument tuple ' 'and a keyword argument dict') else: raise TypeError('Expected function_arguments to be a tuple, a dict, or a list with 2 elements') key = make_key(positional_argument_tuple, keyword_argument_dict) with lock: node = cache.get(key, sentinel) if node is not sentinel: return values_toolkit.is_cache_value_valid(node[_VALUE]) if alive_only else True return False def cache_contains_result(return_value, alive_only=True): """ Return True if the cache contains a cache item with the specified user function return value. O(n) time complexity. :param return_value: A return value coming from the user function. :param alive_only: Whether to check alive cache item only (default to True). :return: True if the desired cached item is present, False otherwise. """ with lock: node = root[_PREV] while node is not root: is_alive = values_toolkit.is_cache_value_valid(node[_VALUE]) cache_result = values_toolkit.retrieve_result_from_cache_value(node[_VALUE]) if cache_result == return_value: return is_alive if alive_only else True node = node[_PREV] return False def cache_for_each(consumer): """ Perform the given action for each cache element in an order determined by the algorithm until all elements have been processed or the action throws an error :param consumer: an action function to process the cache elements. Must have 3 arguments: def consumer(user_function_arguments, user_function_result, is_alive): ... user_function_arguments is a tuple holding arguments in the form of (args, kwargs). args is a tuple holding positional arguments. kwargs is a dict holding keyword arguments. for example, for a function: foo(a, b, c, d), calling it by: foo(1, 2, c=3, d=4) user_function_arguments == ((1, 2), {'c': 3, 'd': 4}) user_function_result is a return value coming from the user function. is_alive is a boolean value indicating whether the cache is still alive (if a TTL is given). """ with lock: node = root[_PREV] while node is not root: is_alive = values_toolkit.is_cache_value_valid(node[_VALUE]) user_function_result = values_toolkit.retrieve_result_from_cache_value(node[_VALUE]) user_function_arguments = key_argument_map[node[_KEY]] consumer(user_function_arguments, user_function_result, is_alive) node = node[_PREV] def cache_arguments(): """ Get user function arguments of all alive cache elements see also: cache_items() Example: @cached def f(a, b, c, d): ... f(1, 2, c=3, d=4) for argument in f.cache_arguments(): print(argument) # ((1, 2), {'c': 3, 'd': 4}) :return: an iterable which iterates through a list of a tuple containing a tuple (positional arguments) and a dict (keyword arguments) """ with lock: node = root[_PREV] while node is not root: if values_toolkit.is_cache_value_valid(node[_VALUE]): yield key_argument_map[node[_KEY]] node = node[_PREV] def cache_results(): """ Get user function return values of all alive cache elements see also: cache_items() Example: @cached def f(a): return a f('hello') for result in f.cache_results(): print(result) # 'hello' :return: an iterable which iterates through a list of user function result (of any type) """ with lock: node = root[_PREV] while node is not root: if values_toolkit.is_cache_value_valid(node[_VALUE]): yield values_toolkit.retrieve_result_from_cache_value(node[_VALUE]) node = node[_PREV] def cache_items(): """ Get cache items, i.e. entries of all alive cache elements, in the form of (argument, result). argument: a tuple containing a tuple (positional arguments) and a dict (keyword arguments). result: a user function return value of any type. see also: cache_arguments(), cache_results(). Example: @cached def f(a, b, c, d): return 'the answer is ' + str(a) f(1, 2, c=3, d=4) for argument, result in f.cache_items(): print(argument) # ((1, 2), {'c': 3, 'd': 4}) print(result) # 'the answer is 1' :return: an iterable which iterates through a list of (argument, result) entries """ with lock: node = root[_PREV] while node is not root: if values_toolkit.is_cache_value_valid(node[_VALUE]): yield key_argument_map[node[_KEY]], values_toolkit.retrieve_result_from_cache_value(node[_VALUE]) node = node[_PREV] def cache_remove_if(predicate): """ Remove all cache elements that satisfy the given predicate :param predicate: a predicate function to judge whether the cache elements should be removed. Must have 3 arguments, and returns True or False: def consumer(user_function_arguments, user_function_result, is_alive): ... user_function_arguments is a tuple holding arguments in the form of (args, kwargs). args is a tuple holding positional arguments. kwargs is a dict holding keyword arguments. for example, for a function: foo(a, b, c, d), calling it by: foo(1, 2, c=3, d=4) user_function_arguments == ((1, 2), {'c': 3, 'd': 4}) user_function_result is a return value coming from the user function. is_alive is a boolean value indicating whether the cache is still alive (if a TTL is given). :return: True if at least one element is removed, False otherwise. """ nonlocal full removed = False with lock: node = root[_PREV] while node is not root: is_alive = values_toolkit.is_cache_value_valid(node[_VALUE]) user_function_result = values_toolkit.retrieve_result_from_cache_value(node[_VALUE]) user_function_arguments = key_argument_map[node[_KEY]] if predicate(user_function_arguments, user_function_result, is_alive): removed = True node_prev = node[_PREV] # relink pointers of node.prev.next and node.next.prev node_prev[_NEXT] = node[_NEXT] node[_NEXT][_PREV] = node_prev # clear the content of this node key = node[_KEY] node[_KEY] = node[_VALUE] = None # delete from cache del cache[key] del key_argument_map[key] # check whether the cache is full full = (cache.__len__() >= max_size) node = node_prev else: node = node[_PREV] return removed # expose operations to wrapper wrapper.cache_clear = cache_clear wrapper.cache_info = cache_info wrapper.cache_is_empty = cache_is_empty wrapper.cache_is_full = cache_is_full wrapper.cache_contains_argument = cache_contains_argument wrapper.cache_contains_result = cache_contains_result wrapper.cache_for_each = cache_for_each wrapper.cache_arguments = cache_arguments wrapper.cache_results = cache_results wrapper.cache_items = cache_items wrapper.cache_remove_if = cache_remove_if wrapper._cache = cache wrapper._fifo_root = root wrapper._root_name = '_fifo_root' return wrapper
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching/fifo_cache.pyi
from memoization.type.caching.cache import get_caching_wrapper as get_caching_wrapper
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching/statistic_cache.py
from threading import RLock from memoization.model import DummyWithable, CacheInfo def get_caching_wrapper(user_function, max_size, ttl, algorithm, thread_safe, order_independent, custom_key_maker): """Get a caching wrapper for statistics only, without any actual caching""" misses = 0 # number of misses of the cache lock = RLock() if thread_safe else DummyWithable() # ensure thread-safe def wrapper(*args, **kwargs): """The actual wrapper""" nonlocal misses with lock: misses += 1 return user_function(*args, **kwargs) def cache_clear(): """Clear the cache and statistics information""" nonlocal misses with lock: misses = 0 def cache_info(): """ Show statistics information :return: a CacheInfo object describing the cache """ with lock: return CacheInfo(0, misses, 0, max_size, algorithm, ttl, thread_safe, order_independent, custom_key_maker is not None) def cache_is_empty(): """Return True if the cache contains no elements""" return True def cache_is_full(): """Return True if the cache is full""" return True def cache_contains_argument(function_arguments, alive_only=True): """ Return True if the cache contains a cached item with the specified function call arguments :param function_arguments: Can be a list, a tuple or a dict. - Full arguments: use a list to represent both positional arguments and keyword arguments. The list contains two elements, a tuple (positional arguments) and a dict (keyword arguments). For example, f(1, 2, 3, a=4, b=5, c=6) can be represented by: [(1, 2, 3), {'a': 4, 'b': 5, 'c': 6}] - Positional arguments only: when the arguments does not include keyword arguments, a tuple can be used to represent positional arguments. For example, f(1, 2, 3) can be represented by: (1, 2, 3) - Keyword arguments only: when the arguments does not include positional arguments, a dict can be used to represent keyword arguments. For example, f(a=4, b=5, c=6) can be represented by: {'a': 4, 'b': 5, 'c': 6} :param alive_only: Whether to check alive cache item only (default to True). :return: True if the desired cached item is present, False otherwise. """ return False def cache_contains_result(return_value, alive_only=True): """ Return True if the cache contains a cache item with the specified user function return value. O(n) time complexity. :param return_value: A return value coming from the user function. :param alive_only: Whether to check alive cache item only (default to True). :return: True if the desired cached item is present, False otherwise. """ return False def cache_for_each(consumer): """ Perform the given action for each cache element in an order determined by the algorithm until all elements have been processed or the action throws an error :param consumer: an action function to process the cache elements. Must have 3 arguments: def consumer(user_function_arguments, user_function_result, is_alive): ... user_function_arguments is a tuple holding arguments in the form of (args, kwargs). args is a tuple holding positional arguments. kwargs is a dict holding keyword arguments. for example, for a function: foo(a, b, c, d), calling it by: foo(1, 2, c=3, d=4) user_function_arguments == ((1, 2), {'c': 3, 'd': 4}) user_function_result is a return value coming from the user function. cache_result is a return value coming from the user function. is_alive is a boolean value indicating whether the cache is still alive (if a TTL is given). """ pass def cache_arguments(): """ Get user function arguments of all alive cache elements see also: cache_items() Example: @cached def f(a, b, c, d): ... f(1, 2, c=3, d=4) for argument in f.cache_arguments(): print(argument) # ((1, 2), {'c': 3, 'd': 4}) :return: an iterable which iterates through a list of a tuple containing a tuple (positional arguments) and a dict (keyword arguments) """ yield from () def cache_results(): """ Get user function return values of all alive cache elements see also: cache_items() Example: @cached def f(a): return a f('hello') for result in f.cache_results(): print(result) # 'hello' :return: an iterable which iterates through a list of user function result (of any type) """ yield from () def cache_items(): """ Get cache items, i.e. entries of all alive cache elements, in the form of (argument, result). argument: a tuple containing a tuple (positional arguments) and a dict (keyword arguments). result: a user function return value of any type. see also: cache_arguments(), cache_results(). Example: @cached def f(a, b, c, d): return 'the answer is ' + str(a) f(1, 2, c=3, d=4) for argument, result in f.cache_items(): print(argument) # ((1, 2), {'c': 3, 'd': 4}) print(result) # 'the answer is 1' :return: an iterable which iterates through a list of (argument, result) entries """ yield from () def cache_remove_if(predicate): """ Remove all cache elements that satisfy the given predicate :param predicate: a predicate function to judge whether the cache elements should be removed. Must have 3 arguments, and returns True or False: def consumer(user_function_arguments, user_function_result, is_alive): ... user_function_arguments is a tuple holding arguments in the form of (args, kwargs). args is a tuple holding positional arguments. kwargs is a dict holding keyword arguments. for example, for a function: foo(a, b, c, d), calling it by: foo(1, 2, c=3, d=4) user_function_arguments == ((1, 2), {'c': 3, 'd': 4}) user_function_result is a return value coming from the user function. cache_result is a return value coming from the user function. is_alive is a boolean value indicating whether the cache is still alive (if a TTL is given). :return: True if at least one element is removed, False otherwise. """ return False # expose operations and members of wrapper wrapper.cache_clear = cache_clear wrapper.cache_info = cache_info wrapper.cache_is_empty = cache_is_empty wrapper.cache_is_full = cache_is_full wrapper.cache_contains_argument = cache_contains_argument wrapper.cache_contains_result = cache_contains_result wrapper.cache_for_each = cache_for_each wrapper.cache_arguments = cache_arguments wrapper.cache_results = cache_results wrapper.cache_items = cache_items wrapper.cache_remove_if = cache_remove_if wrapper._cache = None return wrapper
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching/lfu_cache.py
from threading import RLock from memoization.model import DummyWithable, CacheInfo import memoization.caching.general.keys_order_dependent as keys_toolkit_order_dependent import memoization.caching.general.keys_order_independent as keys_toolkit_order_independent import memoization.caching.general.values_with_ttl as values_toolkit_with_ttl import memoization.caching.general.values_without_ttl as values_toolkit_without_ttl def get_caching_wrapper(user_function, max_size, ttl, algorithm, thread_safe, order_independent, custom_key_maker): """Get a caching wrapper for LFU cache""" cache = {} # the cache to store function results key_argument_map = {} # mapping from cache keys to user function arguments sentinel = object() # sentinel object for the default value of map.get hits = misses = 0 # hits and misses of the cache lock = RLock() if thread_safe else DummyWithable() # ensure thread-safe if ttl is not None: # set up values toolkit according to ttl values_toolkit = values_toolkit_with_ttl else: values_toolkit = values_toolkit_without_ttl if custom_key_maker is not None: # use custom make_key function make_key = custom_key_maker else: if order_independent: # set up keys toolkit according to order_independent make_key = keys_toolkit_order_independent.make_key else: make_key = keys_toolkit_order_dependent.make_key lfu_freq_list_root = _FreqNode.root() # LFU frequency list root def wrapper(*args, **kwargs): """The actual wrapper""" nonlocal hits, misses key = make_key(args, kwargs) cache_expired = False with lock: result = _access_lfu_cache(cache, key, sentinel) if result is not sentinel: if values_toolkit.is_cache_value_valid(result): hits += 1 return values_toolkit.retrieve_result_from_cache_value(result) else: cache_expired = True misses += 1 result = user_function(*args, **kwargs) with lock: if key in cache: if cache_expired: # update cache with new ttl cache[key].value = values_toolkit.make_cache_value(result, ttl) else: # result added to the cache while the lock was released # no need to add again pass else: user_function_arguments = (args, kwargs) cache_value = values_toolkit.make_cache_value(result, ttl) _insert_into_lfu_cache(cache, key_argument_map, user_function_arguments, key, cache_value, lfu_freq_list_root, max_size) return result def cache_clear(): """Clear the cache and its statistics information""" nonlocal hits, misses, lfu_freq_list_root with lock: cache.clear() key_argument_map.clear() hits = misses = 0 lfu_freq_list_root.prev = lfu_freq_list_root.next = lfu_freq_list_root def cache_info(): """ Show statistics information :return: a CacheInfo object describing the cache """ with lock: return CacheInfo(hits, misses, cache.__len__(), max_size, algorithm, ttl, thread_safe, order_independent, custom_key_maker is not None) def cache_is_empty(): """Return True if the cache contains no elements""" return cache.__len__() == 0 def cache_is_full(): """Return True if the cache is full""" return cache.__len__() >= max_size def cache_contains_argument(function_arguments, alive_only=True): """ Return True if the cache contains a cached item with the specified function call arguments :param function_arguments: Can be a list, a tuple or a dict. - Full arguments: use a list to represent both positional arguments and keyword arguments. The list contains two elements, a tuple (positional arguments) and a dict (keyword arguments). For example, f(1, 2, 3, a=4, b=5, c=6) can be represented by: [(1, 2, 3), {'a': 4, 'b': 5, 'c': 6}] - Positional arguments only: when the arguments does not include keyword arguments, a tuple can be used to represent positional arguments. For example, f(1, 2, 3) can be represented by: (1, 2, 3) - Keyword arguments only: when the arguments does not include positional arguments, a dict can be used to represent keyword arguments. For example, f(a=4, b=5, c=6) can be represented by: {'a': 4, 'b': 5, 'c': 6} :param alive_only: Whether to check alive cache item only (default to True). :return: True if the desired cached item is present, False otherwise. """ if isinstance(function_arguments, tuple): positional_argument_tuple = function_arguments keyword_argument_dict = {} elif isinstance(function_arguments, dict): positional_argument_tuple = () keyword_argument_dict = function_arguments elif isinstance(function_arguments, list) and len(function_arguments) == 2: positional_argument_tuple, keyword_argument_dict = function_arguments if not isinstance(positional_argument_tuple, tuple) or not isinstance(keyword_argument_dict, dict): raise TypeError('Expected function_arguments to be a list containing a positional argument tuple ' 'and a keyword argument dict') else: raise TypeError('Expected function_arguments to be a tuple, a dict, or a list with 2 elements') key = make_key(positional_argument_tuple, keyword_argument_dict) with lock: cache_node = cache.get(key, sentinel) if cache_node is not sentinel: return values_toolkit.is_cache_value_valid(cache_node.value) if alive_only else True return False def cache_contains_result(return_value, alive_only=True): """ Return True if the cache contains a cache item with the specified user function return value. O(n) time complexity. :param return_value: A return value coming from the user function. :param alive_only: Whether to check alive cache item only (default to True). :return: True if the desired cached item is present, False otherwise. """ with lock: freq_node = lfu_freq_list_root.prev while freq_node != lfu_freq_list_root: cache_head = freq_node.cache_head cache_node = cache_head.next while cache_node != cache_head: is_alive = values_toolkit.is_cache_value_valid(cache_node.value) cache_result = values_toolkit.retrieve_result_from_cache_value(cache_node.value) if cache_result == return_value: return is_alive if alive_only else True cache_node = cache_node.next freq_node = freq_node.prev return False def cache_for_each(consumer): """ Perform the given action for each cache element in an order determined by the algorithm until all elements have been processed or the action throws an error :param consumer: an action function to process the cache elements. Must have 3 arguments: def consumer(user_function_arguments, user_function_result, is_alive): ... user_function_arguments is a tuple holding arguments in the form of (args, kwargs). args is a tuple holding positional arguments. kwargs is a dict holding keyword arguments. for example, for a function: foo(a, b, c, d), calling it by: foo(1, 2, c=3, d=4) user_function_arguments == ((1, 2), {'c': 3, 'd': 4}) user_function_result is a return value coming from the user function. cache_result is a return value coming from the user function. is_alive is a boolean value indicating whether the cache is still alive (if a TTL is given). """ with lock: freq_node = lfu_freq_list_root.prev while freq_node != lfu_freq_list_root: cache_head = freq_node.cache_head cache_node = cache_head.next while cache_node != cache_head: is_alive = values_toolkit.is_cache_value_valid(cache_node.value) user_function_result = values_toolkit.retrieve_result_from_cache_value(cache_node.value) user_function_arguments = key_argument_map[cache_node.key] consumer(user_function_arguments, user_function_result, is_alive) cache_node = cache_node.next freq_node = freq_node.prev def cache_arguments(): """ Get user function arguments of all alive cache elements see also: cache_items() Example: @cached def f(a, b, c, d): ... f(1, 2, c=3, d=4) for argument in f.cache_arguments(): print(argument) # ((1, 2), {'c': 3, 'd': 4}) :return: an iterable which iterates through a list of a tuple containing a tuple (positional arguments) and a dict (keyword arguments) """ with lock: freq_node = lfu_freq_list_root.prev while freq_node != lfu_freq_list_root: cache_head = freq_node.cache_head cache_node = cache_head.next while cache_node != cache_head: if values_toolkit.is_cache_value_valid(cache_node.value): yield key_argument_map[cache_node.key] cache_node = cache_node.next freq_node = freq_node.prev def cache_results(): """ Get user function return values of all alive cache elements see also: cache_items() Example: @cached def f(a): return a f('hello') for result in f.cache_results(): print(result) # 'hello' :return: an iterable which iterates through a list of user function result (of any type) """ with lock: freq_node = lfu_freq_list_root.prev while freq_node != lfu_freq_list_root: cache_head = freq_node.cache_head cache_node = cache_head.next while cache_node != cache_head: if values_toolkit.is_cache_value_valid(cache_node.value): yield values_toolkit.retrieve_result_from_cache_value(cache_node.value) cache_node = cache_node.next freq_node = freq_node.prev def cache_items(): """ Get cache items, i.e. entries of all alive cache elements, in the form of (argument, result). argument: a tuple containing a tuple (positional arguments) and a dict (keyword arguments). result: a user function return value of any type. see also: cache_arguments(), cache_results(). Example: @cached def f(a, b, c, d): return 'the answer is ' + str(a) f(1, 2, c=3, d=4) for argument, result in f.cache_items(): print(argument) # ((1, 2), {'c': 3, 'd': 4}) print(result) # 'the answer is 1' :return: an iterable which iterates through a list of (argument, result) entries """ with lock: freq_node = lfu_freq_list_root.prev while freq_node != lfu_freq_list_root: cache_head = freq_node.cache_head cache_node = cache_head.next while cache_node != cache_head: if values_toolkit.is_cache_value_valid(cache_node.value): yield (key_argument_map[cache_node.key], values_toolkit.retrieve_result_from_cache_value(cache_node.value)) cache_node = cache_node.next freq_node = freq_node.prev def cache_remove_if(predicate): """ Remove all cache elements that satisfy the given predicate :param predicate: a predicate function to judge whether the cache elements should be removed. Must have 3 arguments, and returns True or False: def consumer(user_function_arguments, user_function_result, is_alive): ... user_function_arguments is a tuple holding arguments in the form of (args, kwargs). args is a tuple holding positional arguments. kwargs is a dict holding keyword arguments. for example, for a function: foo(a, b, c, d), calling it by: foo(1, 2, c=3, d=4) user_function_arguments == ((1, 2), {'c': 3, 'd': 4}) user_function_result is a return value coming from the user function. cache_result is a return value coming from the user function. is_alive is a boolean value indicating whether the cache is still alive (if a TTL is given). :return: True if at least one element is removed, False otherwise. """ removed = False with lock: freq_node = lfu_freq_list_root.prev while freq_node != lfu_freq_list_root: cache_head = freq_node.cache_head cache_node = cache_head.next removed_under_this_freq_node = False while cache_node != cache_head: is_alive = values_toolkit.is_cache_value_valid(cache_node.value) user_function_result = values_toolkit.retrieve_result_from_cache_value(cache_node.value) user_function_arguments = key_argument_map[cache_node.key] if predicate(user_function_arguments, user_function_result, is_alive): removed = removed_under_this_freq_node = True next_cache_node = cache_node.next del cache[cache_node.key] # delete from cache del key_argument_map[cache_node.key] cache_node.destroy() # modify references, drop this cache node cache_node = next_cache_node else: cache_node = cache_node.next # check whether only one cache node is left if removed_under_this_freq_node and freq_node.cache_head.next == freq_node.cache_head: # Getting here means that we just deleted the only data node in the cache list # Note: there is still an empty sentinel node # We then need to destroy the sentinel node and its parent frequency node too prev_freq_node = freq_node.prev freq_node.cache_head.destroy() freq_node.destroy() freq_node = prev_freq_node else: freq_node = freq_node.prev return removed # expose operations to wrapper wrapper.cache_clear = cache_clear wrapper.cache_info = cache_info wrapper.cache_is_empty = cache_is_empty wrapper.cache_is_full = cache_is_full wrapper.cache_contains_argument = cache_contains_argument wrapper.cache_contains_result = cache_contains_result wrapper.cache_for_each = cache_for_each wrapper.cache_arguments = cache_arguments wrapper.cache_results = cache_results wrapper.cache_items = cache_items wrapper.cache_remove_if = cache_remove_if wrapper._cache = cache wrapper._lfu_root = lfu_freq_list_root wrapper._root_name = '_lfu_root' return wrapper ################################################################################################################################ # LFU Cache # Least Frequently Used Cache # # O(1) implementation - please refer to the following documents for more details: # http://dhruvbird.com/lfu.pdf # https://medium.com/@epicshane/a-python-implementation-of-lfu-least-frequently-used-cache-with-o-1-time-complexity-e16b34a3c49b ################################################################################################################################ class _CacheNode(object): """ Cache Node for LFU Cache """ __slots__ = 'prev', 'next', 'parent', 'key', 'value', '__weakref__' def __init__(self, prev=None, next=None, parent=None, key=None, value=None): self.prev = prev self.next = next self.parent = parent self.key = key self.value = value @classmethod def root(cls, parent=None, key=None, value=None): """ Generate an empty root node """ node = cls(None, None, parent, key, value) node.prev = node.next = node return node def destroy(self): """ Destroy the current cache node """ self.prev.next = self.next self.next.prev = self.prev if self.parent.cache_head == self: self.parent.cache_head = None self.prev = self.next = self.parent = self.key = self.value = None class _FreqNode(object): """ Frequency Node for LFU Cache """ __slots__ = 'prev', 'next', 'frequency', 'cache_head', '__weakref__' def __init__(self, prev=None, next=None, frequency=None, cache_head=None): self.prev = prev self.next = next self.frequency = frequency self.cache_head = cache_head @classmethod def root(cls, frequency=None, cache_head=None): """ Generate an empty root node """ node = cls(None, None, frequency, cache_head) node.prev = node.next = node return node def destroy(self): """ Destroy the current frequency node """ self.prev.next = self.next self.next.prev = self.prev self.prev = self.next = self.cache_head = None def _insert_into_lfu_cache(cache, key_argument_map, user_function_arguments, key, value, root, max_size): first_freq_node = root.next if cache.__len__() >= max_size: # The cache is full if first_freq_node.frequency != 1: # The first element in frequency list has its frequency other than 1 (> 1) # We need to drop the last element in the cache list of the first frequency node # and then insert a new frequency node, attaching an empty cache node together with # another cache node with data to the frequency node # Find the target cache_head = first_freq_node.cache_head last_node = cache_head.prev # Modify references last_node.prev.next = cache_head cache_head.prev = last_node.prev # Drop the last node; hold the old data to prevent arbitrary GC old_key = last_node.key old_value = last_node.value last_node.destroy() if first_freq_node.cache_head.next == first_freq_node.cache_head: # Getting here means that we just deleted the only data node in the cache list # under the first frequency list # Note: there is still an empty sentinel node # We then need to destroy the sentinel node and its parent frequency node too first_freq_node.cache_head.destroy() first_freq_node.destroy() first_freq_node = root.next # update # Delete from cache del cache[old_key] del key_argument_map[old_key] # Prepare a new frequency node, a cache root node and a cache data node empty_cache_root = _CacheNode.root() freq_node = _FreqNode(root, first_freq_node, 1, empty_cache_root) cache_node = _CacheNode(empty_cache_root, empty_cache_root, freq_node, key, value) empty_cache_root.parent = freq_node # Modify references root.next.prev = root.next = freq_node empty_cache_root.prev = empty_cache_root.next = cache_node else: # We can find the last element in the cache list under the first frequency list # Moving it to the head and replace the stored data with a new key and a new value # This is more efficient # Find the target cache_head = first_freq_node.cache_head manipulated_node = cache_head.prev # Modify references manipulated_node.prev.next = cache_head cache_head.prev = manipulated_node.prev manipulated_node.next = cache_head.next manipulated_node.prev = cache_head cache_head.next.prev = cache_head.next = manipulated_node # Replace the data; hold the old data to prevent arbitrary GC old_key = manipulated_node.key old_value = manipulated_node.value manipulated_node.key = key manipulated_node.value = value # use another name so it can be accessed later cache_node = manipulated_node # Delete from cache del cache[old_key] del key_argument_map[old_key] else: # The cache is not full if first_freq_node.frequency != 1: # The first element in frequency list has its frequency other than 1 (> 1) # Creating a new node in frequency list with 1 as its frequency required # We also need to create a new cache list and attach it to this new node # Create a cache root and a frequency node cache_root = _CacheNode.root() freq_node = _FreqNode(root, first_freq_node, 1, cache_root) cache_root.parent = freq_node # Create another cache node to store data cache_node = _CacheNode(cache_root, cache_root, freq_node, key, value) # Modify references cache_root.prev = cache_root.next = cache_node first_freq_node.prev = root.next = freq_node # note: DO NOT swap "=", because first_freq_node == root.next else: # We create a new cache node in the cache list # under the frequency node with frequency 1 # Create a cache node and store data in it cache_head = first_freq_node.cache_head cache_node = _CacheNode(cache_head, cache_head.next, first_freq_node, key, value) # Modify references cache_node.prev.next = cache_node.next.prev = cache_node # Finally, insert the data into the cache cache[key] = cache_node key_argument_map[key] = user_function_arguments def _access_lfu_cache(cache, key, sentinel): if key in cache: cache_node = cache[key] else: # Key does not exist # Access failed return sentinel freq_node = cache_node.parent target_frequency = freq_node.frequency + 1 if freq_node.next.frequency != target_frequency: # The next node on the frequency list has a frequency value different from # (the frequency of the current node) + 1, which means we need to construct # a new frequency node and an empty cache root node # Then we move the current node to the newly created cache list # Create a cache root and a frequency root cache_root = _CacheNode.root() new_freq_node = _FreqNode(freq_node, freq_node.next, target_frequency, cache_root) cache_root.parent = new_freq_node # Modify references cache_node.prev.next = cache_node.next cache_node.next.prev = cache_node.prev cache_node.prev = cache_node.next = cache_root cache_root.prev = cache_root.next = cache_node new_freq_node.next.prev = new_freq_node.prev.next = new_freq_node cache_node.parent = cache_root.parent else: # We can move the cache node to the cache list of the next node on the frequency list # Find the head element of the next cache list next_cache_head = freq_node.next.cache_head # Modify references cache_node.prev.next = cache_node.next cache_node.next.prev = cache_node.prev cache_node.next = next_cache_head.next cache_node.prev = next_cache_head next_cache_head.next.prev = next_cache_head.next = cache_node cache_node.parent = freq_node.next # check the status of the current frequency node if freq_node.cache_head.next == freq_node.cache_head: # Getting here means that we just moved away the only data node in the cache list # Note: there is still an empty sentinel node # We then need to destroy the sentinel node and its parent frequency node too freq_node.cache_head.destroy() freq_node.destroy() return cache_node.value
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching/lfu_cache.pyi
from memoization.type.caching.cache import get_caching_wrapper as get_caching_wrapper
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching/plain_cache.pyi
from memoization.type.caching.cache import get_caching_wrapper as get_caching_wrapper
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching/plain_cache.py
from threading import RLock from memoization.model import DummyWithable, CacheInfo import memoization.caching.general.keys_order_dependent as keys_toolkit_order_dependent import memoization.caching.general.keys_order_independent as keys_toolkit_order_independent import memoization.caching.general.values_with_ttl as values_toolkit_with_ttl import memoization.caching.general.values_without_ttl as values_toolkit_without_ttl def get_caching_wrapper(user_function, max_size, ttl, algorithm, thread_safe, order_independent, custom_key_maker): """Get a caching wrapper for space-unlimited cache""" cache = {} # the cache to store function results key_argument_map = {} # mapping from cache keys to user function arguments sentinel = object() # sentinel object for the default value of map.get hits = misses = 0 # hits and misses of the cache lock = RLock() if thread_safe else DummyWithable() # ensure thread-safe if ttl is not None: # set up values toolkit according to ttl values_toolkit = values_toolkit_with_ttl else: values_toolkit = values_toolkit_without_ttl if custom_key_maker is not None: # use custom make_key function make_key = custom_key_maker else: if order_independent: # set up keys toolkit according to order_independent make_key = keys_toolkit_order_independent.make_key else: make_key = keys_toolkit_order_dependent.make_key def wrapper(*args, **kwargs): """The actual wrapper""" nonlocal hits, misses key = make_key(args, kwargs) value = cache.get(key, sentinel) if value is not sentinel and values_toolkit.is_cache_value_valid(value): with lock: hits += 1 return values_toolkit.retrieve_result_from_cache_value(value) else: with lock: misses += 1 result = user_function(*args, **kwargs) cache[key] = values_toolkit.make_cache_value(result, ttl) key_argument_map[key] = (args, kwargs) return result def cache_clear(): """Clear the cache and statistics information""" nonlocal hits, misses with lock: cache.clear() key_argument_map.clear() hits = misses = 0 def cache_info(): """ Show statistics information :return: a CacheInfo object describing the cache """ with lock: return CacheInfo(hits, misses, cache.__len__(), max_size, algorithm, ttl, thread_safe, order_independent, custom_key_maker is not None) def cache_is_empty(): """Return True if the cache contains no elements""" return cache.__len__() == 0 def cache_is_full(): """Return True if the cache is full""" return False def cache_contains_argument(function_arguments, alive_only=True): """ Return True if the cache contains a cached item with the specified function call arguments :param function_arguments: Can be a list, a tuple or a dict. - Full arguments: use a list to represent both positional arguments and keyword arguments. The list contains two elements, a tuple (positional arguments) and a dict (keyword arguments). For example, f(1, 2, 3, a=4, b=5, c=6) can be represented by: [(1, 2, 3), {'a': 4, 'b': 5, 'c': 6}] - Positional arguments only: when the arguments does not include keyword arguments, a tuple can be used to represent positional arguments. For example, f(1, 2, 3) can be represented by: (1, 2, 3) - Keyword arguments only: when the arguments does not include positional arguments, a dict can be used to represent keyword arguments. For example, f(a=4, b=5, c=6) can be represented by: {'a': 4, 'b': 5, 'c': 6} :param alive_only: Whether to check alive cache item only (default to True). :return: True if the desired cached item is present, False otherwise. """ if isinstance(function_arguments, tuple): positional_argument_tuple = function_arguments keyword_argument_dict = {} elif isinstance(function_arguments, dict): positional_argument_tuple = () keyword_argument_dict = function_arguments elif isinstance(function_arguments, list) and len(function_arguments) == 2: positional_argument_tuple, keyword_argument_dict = function_arguments if not isinstance(positional_argument_tuple, tuple) or not isinstance(keyword_argument_dict, dict): raise TypeError('Expected function_arguments to be a list containing a positional argument tuple ' 'and a keyword argument dict') else: raise TypeError('Expected function_arguments to be a tuple, a dict, or a list with 2 elements') key = make_key(positional_argument_tuple, keyword_argument_dict) with lock: value = cache.get(key, sentinel) if value is not sentinel: return values_toolkit.is_cache_value_valid(value) if alive_only else True return False def cache_contains_result(return_value, alive_only=True): """ Return True if the cache contains a cache item with the specified user function return value. O(n) time complexity. :param return_value: A return value coming from the user function. :param alive_only: Whether to check alive cache item only (default to True). :return: True if the desired cached item is present, False otherwise. """ with lock: for value in cache.values(): is_alive = values_toolkit.is_cache_value_valid(value) cache_result = values_toolkit.retrieve_result_from_cache_value(value) if cache_result == return_value: return is_alive if alive_only else True return False def cache_for_each(consumer): """ Perform the given action for each cache element in an order determined by the algorithm until all elements have been processed or the action throws an error :param consumer: an action function to process the cache elements. Must have 3 arguments: def consumer(user_function_arguments, user_function_result, is_alive): ... user_function_arguments is a tuple holding arguments in the form of (args, kwargs). args is a tuple holding positional arguments. kwargs is a dict holding keyword arguments. for example, for a function: foo(a, b, c, d), calling it by: foo(1, 2, c=3, d=4) user_function_arguments == ((1, 2), {'c': 3, 'd': 4}) user_function_result is a return value coming from the user function. cache_result is a return value coming from the user function. is_alive is a boolean value indicating whether the cache is still alive (if a TTL is given). """ with lock: for key, value in cache.items(): is_alive = values_toolkit.is_cache_value_valid(value) user_function_result = values_toolkit.retrieve_result_from_cache_value(value) user_function_arguments = key_argument_map[key] consumer(user_function_arguments, user_function_result, is_alive) def cache_arguments(): """ Get user function arguments of all alive cache elements see also: cache_items() Example: @cached def f(a, b, c, d): ... f(1, 2, c=3, d=4) for argument in f.cache_arguments(): print(argument) # ((1, 2), {'c': 3, 'd': 4}) :return: an iterable which iterates through a list of a tuple containing a tuple (positional arguments) and a dict (keyword arguments) """ with lock: for key, value in cache.items(): if values_toolkit.is_cache_value_valid(value): yield key_argument_map[key] def cache_results(): """ Get user function return values of all alive cache elements see also: cache_items() Example: @cached def f(a): return a f('hello') for result in f.cache_results(): print(result) # 'hello' :return: an iterable which iterates through a list of user function result (of any type) """ with lock: for key, value in cache.items(): if values_toolkit.is_cache_value_valid(value): yield values_toolkit.retrieve_result_from_cache_value(value) def cache_items(): """ Get cache items, i.e. entries of all alive cache elements, in the form of (argument, result). argument: a tuple containing a tuple (positional arguments) and a dict (keyword arguments). result: a user function return value of any type. see also: cache_arguments(), cache_results(). Example: @cached def f(a, b, c, d): return 'the answer is ' + str(a) f(1, 2, c=3, d=4) for argument, result in f.cache_items(): print(argument) # ((1, 2), {'c': 3, 'd': 4}) print(result) # 'the answer is 1' :return: an iterable which iterates through a list of (argument, result) entries """ with lock: for key, value in cache.items(): if values_toolkit.is_cache_value_valid(value): yield key_argument_map[key], values_toolkit.retrieve_result_from_cache_value(value) def cache_remove_if(predicate): """ Remove all cache elements that satisfy the given predicate :param predicate: a predicate function to judge whether the cache elements should be removed. Must have 3 arguments, and returns True or False: def consumer(user_function_arguments, user_function_result, is_alive): ... user_function_arguments is a tuple holding arguments in the form of (args, kwargs). args is a tuple holding positional arguments. kwargs is a dict holding keyword arguments. for example, for a function: foo(a, b, c, d), calling it by: foo(1, 2, c=3, d=4) user_function_arguments == ((1, 2), {'c': 3, 'd': 4}) user_function_result is a return value coming from the user function. cache_result is a return value coming from the user function. is_alive is a boolean value indicating whether the cache is still alive (if a TTL is given). :return: True if at least one element is removed, False otherwise. """ with lock: keys_to_be_removed = [] for key, value in cache.items(): is_alive = values_toolkit.is_cache_value_valid(value) user_function_result = values_toolkit.retrieve_result_from_cache_value(value) user_function_arguments = key_argument_map[key] if predicate(user_function_arguments, user_function_result, is_alive): keys_to_be_removed.append(key) for key in keys_to_be_removed: del cache[key] del key_argument_map[key] return len(keys_to_be_removed) > 0 # expose operations and members of wrapper wrapper.cache_clear = cache_clear wrapper.cache_info = cache_info wrapper.cache_is_empty = cache_is_empty wrapper.cache_is_full = cache_is_full wrapper.cache_contains_argument = cache_contains_argument wrapper.cache_contains_result = cache_contains_result wrapper.cache_for_each = cache_for_each wrapper.cache_arguments = cache_arguments wrapper.cache_results = cache_results wrapper.cache_items = cache_items wrapper.cache_remove_if = cache_remove_if wrapper._cache = cache return wrapper
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching/general/keys_order_dependent.py
from memoization.model import HashedList def make_key(args, kwargs, kwargs_mark=(object(), )): """ Make a cache key """ key = args if kwargs: key += kwargs_mark for item in kwargs.items(): key += item try: hash_value = hash(key) except TypeError: # process unhashable types return str(key) else: return HashedList(key, hash_value)
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching/general/keys_order_dependent.pyi
from memoization.type.caching.general.keys import make_key as make_key
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching/general/values_without_ttl.pyi
from typing import Optional, TypeVar T = TypeVar('T') def make_cache_value(result: T, ttl: Optional[float]) -> T: ... def is_cache_value_valid(value: T) -> bool: ... def retrieve_result_from_cache_value(value: T) -> T: ...
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching/general/keys_order_independent.py
from memoization.model import HashedList def make_key(args, kwargs, kwargs_mark=(object(), )): """ Make a cache key """ key = args if kwargs: key += kwargs_mark for kwarg_key in sorted(kwargs.keys()): key += (kwarg_key, kwargs[kwarg_key]) try: hash_value = hash(key) except TypeError: # process unhashable types return str(key) else: return HashedList(key, hash_value)
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching/general/values_with_ttl.pyi
from typing import Optional, Tuple, TypeVar T = TypeVar('T') CacheValue = Tuple[T, float] def make_cache_value(result: T, ttl: Optional[float]) -> CacheValue[T]: ... def is_cache_value_valid(value: CacheValue[T]) -> bool: ... def retrieve_result_from_cache_value(value: CacheValue[T]) -> T: ...
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching/general/values_with_ttl.py
import time def make_cache_value(result, ttl): return result, time.time() + ttl def is_cache_value_valid(value): return time.time() < value[1] def retrieve_result_from_cache_value(value): return value[0]
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching/general/keys_order_independent.pyi
from memoization.type.caching.general.keys import make_key as make_key
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/memoization/caching/general/values_without_ttl.py
def make_cache_value(result, ttl): return result def is_cache_value_valid(value): return True def retrieve_result_from_cache_value(value): return value
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/dotenv/version.py
__version__ = "0.21.1"
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/dotenv/variables.py
import re from abc import ABCMeta, abstractmethod from typing import Iterator, Mapping, Optional, Pattern _posix_variable: Pattern[str] = re.compile( r""" \$\{ (?P<name>[^\}:]*) (?::- (?P<default>[^\}]*) )? \} """, re.VERBOSE, ) class Atom(metaclass=ABCMeta): def __ne__(self, other: object) -> bool: result = self.__eq__(other) if result is NotImplemented: return NotImplemented return not result @abstractmethod def resolve(self, env: Mapping[str, Optional[str]]) -> str: ... class Literal(Atom): def __init__(self, value: str) -> None: self.value = value def __repr__(self) -> str: return f"Literal(value={self.value})" def __eq__(self, other: object) -> bool: if not isinstance(other, self.__class__): return NotImplemented return self.value == other.value def __hash__(self) -> int: return hash((self.__class__, self.value)) def resolve(self, env: Mapping[str, Optional[str]]) -> str: return self.value class Variable(Atom): def __init__(self, name: str, default: Optional[str]) -> None: self.name = name self.default = default def __repr__(self) -> str: return f"Variable(name={self.name}, default={self.default})" def __eq__(self, other: object) -> bool: if not isinstance(other, self.__class__): return NotImplemented return (self.name, self.default) == (other.name, other.default) def __hash__(self) -> int: return hash((self.__class__, self.name, self.default)) def resolve(self, env: Mapping[str, Optional[str]]) -> str: default = self.default if self.default is not None else "" result = env.get(self.name, default) return result if result is not None else "" def parse_variables(value: str) -> Iterator[Atom]: cursor = 0 for match in _posix_variable.finditer(value): (start, end) = match.span() name = match["name"] default = match["default"] if start > cursor: yield Literal(value=value[cursor:start]) yield Variable(name=name, default=default) cursor = end length = len(value) if cursor < length: yield Literal(value=value[cursor:length])
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/dotenv/__init__.py
from typing import Any, Optional from .main import (dotenv_values, find_dotenv, get_key, load_dotenv, set_key, unset_key) def load_ipython_extension(ipython: Any) -> None: from .ipython import load_ipython_extension load_ipython_extension(ipython) def get_cli_string( path: Optional[str] = None, action: Optional[str] = None, key: Optional[str] = None, value: Optional[str] = None, quote: Optional[str] = None, ): """Returns a string suitable for running as a shell script. Useful for converting a arguments passed to a fabric task to be passed to a `local` or `run` command. """ command = ['dotenv'] if quote: command.append(f'-q {quote}') if path: command.append(f'-f {path}') if action: command.append(action) if key: command.append(key) if value: if ' ' in value: command.append(f'"{value}"') else: command.append(value) return ' '.join(command).strip() __all__ = ['get_cli_string', 'load_dotenv', 'dotenv_values', 'get_key', 'set_key', 'unset_key', 'find_dotenv', 'load_ipython_extension']
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/dotenv/parser.py
import codecs import re from typing import (IO, Iterator, Match, NamedTuple, Optional, # noqa:F401 Pattern, Sequence, Tuple) def make_regex(string: str, extra_flags: int = 0) -> Pattern[str]: return re.compile(string, re.UNICODE | extra_flags) _newline = make_regex(r"(\r\n|\n|\r)") _multiline_whitespace = make_regex(r"\s*", extra_flags=re.MULTILINE) _whitespace = make_regex(r"[^\S\r\n]*") _export = make_regex(r"(?:export[^\S\r\n]+)?") _single_quoted_key = make_regex(r"'([^']+)'") _unquoted_key = make_regex(r"([^=\#\s]+)") _equal_sign = make_regex(r"(=[^\S\r\n]*)") _single_quoted_value = make_regex(r"'((?:\\'|[^'])*)'") _double_quoted_value = make_regex(r'"((?:\\"|[^"])*)"') _unquoted_value = make_regex(r"([^\r\n]*)") _comment = make_regex(r"(?:[^\S\r\n]*#[^\r\n]*)?") _end_of_line = make_regex(r"[^\S\r\n]*(?:\r\n|\n|\r|$)") _rest_of_line = make_regex(r"[^\r\n]*(?:\r|\n|\r\n)?") _double_quote_escapes = make_regex(r"\\[\\'\"abfnrtv]") _single_quote_escapes = make_regex(r"\\[\\']") class Original(NamedTuple): string: str line: int class Binding(NamedTuple): key: Optional[str] value: Optional[str] original: Original error: bool class Position: def __init__(self, chars: int, line: int) -> None: self.chars = chars self.line = line @classmethod def start(cls) -> "Position": return cls(chars=0, line=1) def set(self, other: "Position") -> None: self.chars = other.chars self.line = other.line def advance(self, string: str) -> None: self.chars += len(string) self.line += len(re.findall(_newline, string)) class Error(Exception): pass class Reader: def __init__(self, stream: IO[str]) -> None: self.string = stream.read() self.position = Position.start() self.mark = Position.start() def has_next(self) -> bool: return self.position.chars < len(self.string) def set_mark(self) -> None: self.mark.set(self.position) def get_marked(self) -> Original: return Original( string=self.string[self.mark.chars:self.position.chars], line=self.mark.line, ) def peek(self, count: int) -> str: return self.string[self.position.chars:self.position.chars + count] def read(self, count: int) -> str: result = self.string[self.position.chars:self.position.chars + count] if len(result) < count: raise Error("read: End of string") self.position.advance(result) return result def read_regex(self, regex: Pattern[str]) -> Sequence[str]: match = regex.match(self.string, self.position.chars) if match is None: raise Error("read_regex: Pattern not found") self.position.advance(self.string[match.start():match.end()]) return match.groups() def decode_escapes(regex: Pattern[str], string: str) -> str: def decode_match(match: Match[str]) -> str: return codecs.decode(match.group(0), 'unicode-escape') # type: ignore return regex.sub(decode_match, string) def parse_key(reader: Reader) -> Optional[str]: char = reader.peek(1) if char == "#": return None elif char == "'": (key,) = reader.read_regex(_single_quoted_key) else: (key,) = reader.read_regex(_unquoted_key) return key def parse_unquoted_value(reader: Reader) -> str: (part,) = reader.read_regex(_unquoted_value) return re.sub(r"\s+#.*", "", part).rstrip() def parse_value(reader: Reader) -> str: char = reader.peek(1) if char == u"'": (value,) = reader.read_regex(_single_quoted_value) return decode_escapes(_single_quote_escapes, value) elif char == u'"': (value,) = reader.read_regex(_double_quoted_value) return decode_escapes(_double_quote_escapes, value) elif char in (u"", u"\n", u"\r"): return u"" else: return parse_unquoted_value(reader) def parse_binding(reader: Reader) -> Binding: reader.set_mark() try: reader.read_regex(_multiline_whitespace) if not reader.has_next(): return Binding( key=None, value=None, original=reader.get_marked(), error=False, ) reader.read_regex(_export) key = parse_key(reader) reader.read_regex(_whitespace) if reader.peek(1) == "=": reader.read_regex(_equal_sign) value: Optional[str] = parse_value(reader) else: value = None reader.read_regex(_comment) reader.read_regex(_end_of_line) return Binding( key=key, value=value, original=reader.get_marked(), error=False, ) except Error: reader.read_regex(_rest_of_line) return Binding( key=None, value=None, original=reader.get_marked(), error=True, ) def parse_stream(stream: IO[str]) -> Iterator[Binding]: reader = Reader(stream) while reader.has_next(): yield parse_binding(reader)
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/dotenv/cli.py
import json import os import shlex import sys from contextlib import contextmanager from subprocess import Popen from typing import Any, Dict, IO, Iterator, List try: import click except ImportError: sys.stderr.write('It seems python-dotenv is not installed with cli option. \n' 'Run pip install "python-dotenv[cli]" to fix this.') sys.exit(1) from .main import dotenv_values, set_key, unset_key from .version import __version__ @click.group() @click.option('-f', '--file', default=os.path.join(os.getcwd(), '.env'), type=click.Path(file_okay=True), help="Location of the .env file, defaults to .env file in current working directory.") @click.option('-q', '--quote', default='always', type=click.Choice(['always', 'never', 'auto']), help="Whether to quote or not the variable values. Default mode is always. This does not affect parsing.") @click.option('-e', '--export', default=False, type=click.BOOL, help="Whether to write the dot file as an executable bash script.") @click.version_option(version=__version__) @click.pass_context def cli(ctx: click.Context, file: Any, quote: Any, export: Any) -> None: """This script is used to set, get or unset values from a .env file.""" ctx.obj = {'QUOTE': quote, 'EXPORT': export, 'FILE': file} @contextmanager def stream_file(path: os.PathLike) -> Iterator[IO[str]]: """ Open a file and yield the corresponding (decoded) stream. Exits with error code 2 if the file cannot be opened. """ try: with open(path) as stream: yield stream except OSError as exc: print(f"Error opening env file: {exc}", file=sys.stderr) exit(2) @cli.command() @click.pass_context @click.option('--format', default='simple', type=click.Choice(['simple', 'json', 'shell', 'export']), help="The format in which to display the list. Default format is simple, " "which displays name=value without quotes.") def list(ctx: click.Context, format: bool) -> None: """Display all the stored key/value.""" file = ctx.obj['FILE'] with stream_file(file) as stream: values = dotenv_values(stream=stream) if format == 'json': click.echo(json.dumps(values, indent=2, sort_keys=True)) else: prefix = 'export ' if format == 'export' else '' for k in sorted(values): v = values[k] if v is not None: if format in ('export', 'shell'): v = shlex.quote(v) click.echo(f'{prefix}{k}={v}') @cli.command() @click.pass_context @click.argument('key', required=True) @click.argument('value', required=True) def set(ctx: click.Context, key: Any, value: Any) -> None: """Store the given key/value.""" file = ctx.obj['FILE'] quote = ctx.obj['QUOTE'] export = ctx.obj['EXPORT'] success, key, value = set_key(file, key, value, quote, export) if success: click.echo(f'{key}={value}') else: exit(1) @cli.command() @click.pass_context @click.argument('key', required=True) def get(ctx: click.Context, key: Any) -> None: """Retrieve the value for the given key.""" file = ctx.obj['FILE'] with stream_file(file) as stream: values = dotenv_values(stream=stream) stored_value = values.get(key) if stored_value: click.echo(stored_value) else: exit(1) @cli.command() @click.pass_context @click.argument('key', required=True) def unset(ctx: click.Context, key: Any) -> None: """Removes the given key.""" file = ctx.obj['FILE'] quote = ctx.obj['QUOTE'] success, key = unset_key(file, key, quote) if success: click.echo(f"Successfully removed {key}") else: exit(1) @cli.command(context_settings={'ignore_unknown_options': True}) @click.pass_context @click.option( "--override/--no-override", default=True, help="Override variables from the environment file with those from the .env file.", ) @click.argument('commandline', nargs=-1, type=click.UNPROCESSED) def run(ctx: click.Context, override: bool, commandline: List[str]) -> None: """Run command with environment variables present.""" file = ctx.obj['FILE'] if not os.path.isfile(file): raise click.BadParameter( f'Invalid value for \'-f\' "{file}" does not exist.', ctx=ctx ) dotenv_as_dict = { k: v for (k, v) in dotenv_values(file).items() if v is not None and (override or k not in os.environ) } if not commandline: click.echo('No command given.') exit(1) ret = run_command(commandline, dotenv_as_dict) exit(ret) def run_command(command: List[str], env: Dict[str, str]) -> int: """Run command in sub process. Runs the command in a sub process with the variables from `env` added in the current environment variables. Parameters ---------- command: List[str] The command and it's parameters env: Dict The additional environment variables Returns ------- int The return code of the command """ # copy the current environment variables and add the vales from # `env` cmd_env = os.environ.copy() cmd_env.update(env) p = Popen(command, universal_newlines=True, bufsize=0, shell=False, env=cmd_env) _, _ = p.communicate() return p.returncode
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/dotenv/ipython.py
from IPython.core.magic import Magics, line_magic, magics_class # type: ignore from IPython.core.magic_arguments import (argument, magic_arguments, # type: ignore parse_argstring) # type: ignore from .main import find_dotenv, load_dotenv @magics_class class IPythonDotEnv(Magics): @magic_arguments() @argument( '-o', '--override', action='store_true', help="Indicate to override existing variables" ) @argument( '-v', '--verbose', action='store_true', help="Indicate function calls to be verbose" ) @argument('dotenv_path', nargs='?', type=str, default='.env', help='Search in increasingly higher folders for the `dotenv_path`') @line_magic def dotenv(self, line): args = parse_argstring(self.dotenv, line) # Locate the .env file dotenv_path = args.dotenv_path try: dotenv_path = find_dotenv(dotenv_path, True, True) except IOError: print("cannot find .env file") return # Load the .env file load_dotenv(dotenv_path, verbose=args.verbose, override=args.override) def load_ipython_extension(ipython): """Register the %dotenv magic.""" ipython.register_magics(IPythonDotEnv)
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/dotenv/py.typed
# Marker file for PEP 561
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/dotenv/main.py
import io import logging import os import shutil import sys import tempfile from collections import OrderedDict from contextlib import contextmanager from typing import (IO, Dict, Iterable, Iterator, Mapping, Optional, Tuple, Union) from .parser import Binding, parse_stream from .variables import parse_variables # A type alias for a string path to be used for the paths in this file. # These paths may flow to `open()` and `shutil.move()`; `shutil.move()` # only accepts string paths, not byte paths or file descriptors. See # https://github.com/python/typeshed/pull/6832. StrPath = Union[str, 'os.PathLike[str]'] logger = logging.getLogger(__name__) def with_warn_for_invalid_lines(mappings: Iterator[Binding]) -> Iterator[Binding]: for mapping in mappings: if mapping.error: logger.warning( "Python-dotenv could not parse statement starting at line %s", mapping.original.line, ) yield mapping class DotEnv: def __init__( self, dotenv_path: Optional[StrPath], stream: Optional[IO[str]] = None, verbose: bool = False, encoding: Optional[str] = None, interpolate: bool = True, override: bool = True, ) -> None: self.dotenv_path: Optional[StrPath] = dotenv_path self.stream: Optional[IO[str]] = stream self._dict: Optional[Dict[str, Optional[str]]] = None self.verbose: bool = verbose self.encoding: Optional[str] = encoding self.interpolate: bool = interpolate self.override: bool = override @contextmanager def _get_stream(self) -> Iterator[IO[str]]: if self.dotenv_path and os.path.isfile(self.dotenv_path): with open(self.dotenv_path, encoding=self.encoding) as stream: yield stream elif self.stream is not None: yield self.stream else: if self.verbose: logger.info( "Python-dotenv could not find configuration file %s.", self.dotenv_path or '.env', ) yield io.StringIO('') def dict(self) -> Dict[str, Optional[str]]: """Return dotenv as dict""" if self._dict: return self._dict raw_values = self.parse() if self.interpolate: self._dict = OrderedDict(resolve_variables(raw_values, override=self.override)) else: self._dict = OrderedDict(raw_values) return self._dict def parse(self) -> Iterator[Tuple[str, Optional[str]]]: with self._get_stream() as stream: for mapping in with_warn_for_invalid_lines(parse_stream(stream)): if mapping.key is not None: yield mapping.key, mapping.value def set_as_environment_variables(self) -> bool: """ Load the current dotenv as system environment variable. """ if not self.dict(): return False for k, v in self.dict().items(): if k in os.environ and not self.override: continue if v is not None: os.environ[k] = v return True def get(self, key: str) -> Optional[str]: """ """ data = self.dict() if key in data: return data[key] if self.verbose: logger.warning("Key %s not found in %s.", key, self.dotenv_path) return None def get_key( dotenv_path: StrPath, key_to_get: str, encoding: Optional[str] = "utf-8", ) -> Optional[str]: """ Get the value of a given key from the given .env. Returns `None` if the key isn't found or doesn't have a value. """ return DotEnv(dotenv_path, verbose=True, encoding=encoding).get(key_to_get) @contextmanager def rewrite( path: StrPath, encoding: Optional[str], ) -> Iterator[Tuple[IO[str], IO[str]]]: if not os.path.isfile(path): with open(path, mode="w", encoding=encoding) as source: source.write("") with tempfile.NamedTemporaryFile(mode="w", encoding=encoding, delete=False) as dest: try: with open(path, encoding=encoding) as source: yield (source, dest) except BaseException: os.unlink(dest.name) raise shutil.move(dest.name, path) def set_key( dotenv_path: StrPath, key_to_set: str, value_to_set: str, quote_mode: str = "always", export: bool = False, encoding: Optional[str] = "utf-8", ) -> Tuple[Optional[bool], str, str]: """ Adds or Updates a key/value to the given .env If the .env path given doesn't exist, fails instead of risking creating an orphan .env somewhere in the filesystem """ if quote_mode not in ("always", "auto", "never"): raise ValueError(f"Unknown quote_mode: {quote_mode}") quote = ( quote_mode == "always" or (quote_mode == "auto" and not value_to_set.isalnum()) ) if quote: value_out = "'{}'".format(value_to_set.replace("'", "\\'")) else: value_out = value_to_set if export: line_out = f'export {key_to_set}={value_out}\n' else: line_out = f"{key_to_set}={value_out}\n" with rewrite(dotenv_path, encoding=encoding) as (source, dest): replaced = False missing_newline = False for mapping in with_warn_for_invalid_lines(parse_stream(source)): if mapping.key == key_to_set: dest.write(line_out) replaced = True else: dest.write(mapping.original.string) missing_newline = not mapping.original.string.endswith("\n") if not replaced: if missing_newline: dest.write("\n") dest.write(line_out) return True, key_to_set, value_to_set def unset_key( dotenv_path: StrPath, key_to_unset: str, quote_mode: str = "always", encoding: Optional[str] = "utf-8", ) -> Tuple[Optional[bool], str]: """ Removes a given key from the given `.env` file. If the .env path given doesn't exist, fails. If the given key doesn't exist in the .env, fails. """ if not os.path.exists(dotenv_path): logger.warning("Can't delete from %s - it doesn't exist.", dotenv_path) return None, key_to_unset removed = False with rewrite(dotenv_path, encoding=encoding) as (source, dest): for mapping in with_warn_for_invalid_lines(parse_stream(source)): if mapping.key == key_to_unset: removed = True else: dest.write(mapping.original.string) if not removed: logger.warning("Key %s not removed from %s - key doesn't exist.", key_to_unset, dotenv_path) return None, key_to_unset return removed, key_to_unset def resolve_variables( values: Iterable[Tuple[str, Optional[str]]], override: bool, ) -> Mapping[str, Optional[str]]: new_values: Dict[str, Optional[str]] = {} for (name, value) in values: if value is None: result = None else: atoms = parse_variables(value) env: Dict[str, Optional[str]] = {} if override: env.update(os.environ) # type: ignore env.update(new_values) else: env.update(new_values) env.update(os.environ) # type: ignore result = "".join(atom.resolve(env) for atom in atoms) new_values[name] = result return new_values def _walk_to_root(path: str) -> Iterator[str]: """ Yield directories starting from the given directory up to the root """ if not os.path.exists(path): raise IOError('Starting path not found') if os.path.isfile(path): path = os.path.dirname(path) last_dir = None current_dir = os.path.abspath(path) while last_dir != current_dir: yield current_dir parent_dir = os.path.abspath(os.path.join(current_dir, os.path.pardir)) last_dir, current_dir = current_dir, parent_dir def find_dotenv( filename: str = '.env', raise_error_if_not_found: bool = False, usecwd: bool = False, ) -> str: """ Search in increasingly higher folders for the given file Returns path to the file if found, or an empty string otherwise """ def _is_interactive(): """ Decide whether this is running in a REPL or IPython notebook """ main = __import__('__main__', None, None, fromlist=['__file__']) return not hasattr(main, '__file__') if usecwd or _is_interactive() or getattr(sys, 'frozen', False): # Should work without __file__, e.g. in REPL or IPython notebook. path = os.getcwd() else: # will work for .py files frame = sys._getframe() current_file = __file__ while frame.f_code.co_filename == current_file: assert frame.f_back is not None frame = frame.f_back frame_filename = frame.f_code.co_filename path = os.path.dirname(os.path.abspath(frame_filename)) for dirname in _walk_to_root(path): check_path = os.path.join(dirname, filename) if os.path.isfile(check_path): return check_path if raise_error_if_not_found: raise IOError('File not found') return '' def load_dotenv( dotenv_path: Optional[StrPath] = None, stream: Optional[IO[str]] = None, verbose: bool = False, override: bool = False, interpolate: bool = True, encoding: Optional[str] = "utf-8", ) -> bool: """Parse a .env file and then load all the variables found as environment variables. Parameters: dotenv_path: Absolute or relative path to .env file. stream: Text stream (such as `io.StringIO`) with .env content, used if `dotenv_path` is `None`. verbose: Whether to output a warning the .env file is missing. override: Whether to override the system environment variables with the variables from the `.env` file. encoding: Encoding to be used to read the file. Returns: Bool: True if at least one environment variable is set else False If both `dotenv_path` and `stream` are `None`, `find_dotenv()` is used to find the .env file. """ if dotenv_path is None and stream is None: dotenv_path = find_dotenv() dotenv = DotEnv( dotenv_path=dotenv_path, stream=stream, verbose=verbose, interpolate=interpolate, override=override, encoding=encoding, ) return dotenv.set_as_environment_variables() def dotenv_values( dotenv_path: Optional[StrPath] = None, stream: Optional[IO[str]] = None, verbose: bool = False, interpolate: bool = True, encoding: Optional[str] = "utf-8", ) -> Dict[str, Optional[str]]: """ Parse a .env file and return its content as a dict. The returned dict will have `None` values for keys without values in the .env file. For example, `foo=bar` results in `{"foo": "bar"}` whereas `foo` alone results in `{"foo": None}` Parameters: dotenv_path: Absolute or relative path to the .env file. stream: `StringIO` object with .env content, used if `dotenv_path` is `None`. verbose: Whether to output a warning if the .env file is missing. encoding: Encoding to be used to read the file. If both `dotenv_path` and `stream` are `None`, `find_dotenv()` is used to find the .env file. """ if dotenv_path is None and stream is None: dotenv_path = find_dotenv() return DotEnv( dotenv_path=dotenv_path, stream=stream, verbose=verbose, interpolate=interpolate, override=True, encoding=encoding, ).dict()
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/dotenv/__main__.py
"""Entry point for cli, enables execution with `python -m dotenv`""" from .cli import cli if __name__ == "__main__": cli()
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/typing_extensions-4.9.0.dist-info/RECORD
__pycache__/typing_extensions.cpython-311.pyc,, typing_extensions-4.9.0.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4 typing_extensions-4.9.0.dist-info/LICENSE,sha256=Oy-B_iHRgcSZxZolbI4ZaEVdZonSaaqFNzv7avQdo78,13936 typing_extensions-4.9.0.dist-info/METADATA,sha256=ebx5L9BIL5U8F_82bApE9QHP5izlymctyyI4Ey1bTck,2966 typing_extensions-4.9.0.dist-info/RECORD,, typing_extensions-4.9.0.dist-info/WHEEL,sha256=EZbGkh7Ie4PoZfRQ8I0ZuP9VklN_TvcZ6DSE5Uar4z4,81 typing_extensions.py,sha256=R1TPIKi5cxfmdVZfNaDB7WjKgEY4deP5D2CS3XR3hcQ,110125
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/typing_extensions-4.9.0.dist-info/LICENSE
A. HISTORY OF THE SOFTWARE ========================== Python was created in the early 1990s by Guido van Rossum at Stichting Mathematisch Centrum (CWI, see https://www.cwi.nl) in the Netherlands as a successor of a language called ABC. Guido remains Python's principal author, although it includes many contributions from others. In 1995, Guido continued his work on Python at the Corporation for National Research Initiatives (CNRI, see https://www.cnri.reston.va.us) in Reston, Virginia where he released several versions of the software. In May 2000, Guido and the Python core development team moved to BeOpen.com to form the BeOpen PythonLabs team. In October of the same year, the PythonLabs team moved to Digital Creations, which became Zope Corporation. In 2001, the Python Software Foundation (PSF, see https://www.python.org/psf/) was formed, a non-profit organization created specifically to own Python-related Intellectual Property. Zope Corporation was a sponsoring member of the PSF. All Python releases are Open Source (see https://opensource.org for the Open Source Definition). Historically, most, but not all, Python releases have also been GPL-compatible; the table below summarizes the various releases. Release Derived Year Owner GPL- from compatible? (1) 0.9.0 thru 1.2 1991-1995 CWI yes 1.3 thru 1.5.2 1.2 1995-1999 CNRI yes 1.6 1.5.2 2000 CNRI no 2.0 1.6 2000 BeOpen.com no 1.6.1 1.6 2001 CNRI yes (2) 2.1 2.0+1.6.1 2001 PSF no 2.0.1 2.0+1.6.1 2001 PSF yes 2.1.1 2.1+2.0.1 2001 PSF yes 2.1.2 2.1.1 2002 PSF yes 2.1.3 2.1.2 2002 PSF yes 2.2 and above 2.1.1 2001-now PSF yes Footnotes: (1) GPL-compatible doesn't mean that we're distributing Python under the GPL. All Python licenses, unlike the GPL, let you distribute a modified version without making your changes open source. The GPL-compatible licenses make it possible to combine Python with other software that is released under the GPL; the others don't. (2) According to Richard Stallman, 1.6.1 is not GPL-compatible, because its license has a choice of law clause. According to CNRI, however, Stallman's lawyer has told CNRI's lawyer that 1.6.1 is "not incompatible" with the GPL. Thanks to the many outside volunteers who have worked under Guido's direction to make these releases possible. B. TERMS AND CONDITIONS FOR ACCESSING OR OTHERWISE USING PYTHON =============================================================== Python software and documentation are licensed under the Python Software Foundation License Version 2. Starting with Python 3.8.6, examples, recipes, and other code in the documentation are dual licensed under the PSF License Version 2 and the Zero-Clause BSD license. Some software incorporated into Python is under different licenses. The licenses are listed with code falling under that license. PYTHON SOFTWARE FOUNDATION LICENSE VERSION 2 -------------------------------------------- 1. This LICENSE AGREEMENT is between the Python Software Foundation ("PSF"), and the Individual or Organization ("Licensee") accessing and otherwise using this software ("Python") in source or binary form and its associated documentation. 2. Subject to the terms and conditions of this License Agreement, PSF hereby grants Licensee a nonexclusive, royalty-free, world-wide license to reproduce, analyze, test, perform and/or display publicly, prepare derivative works, distribute, and otherwise use Python alone or in any derivative version, provided, however, that PSF's License Agreement and PSF's notice of copyright, i.e., "Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023 Python Software Foundation; All Rights Reserved" are retained in Python alone or in any derivative version prepared by Licensee. 3. In the event Licensee prepares a derivative work that is based on or incorporates Python or any part thereof, and wants to make the derivative work available to others as provided herein, then Licensee hereby agrees to include in any such work a brief summary of the changes made to Python. 4. PSF is making Python available to Licensee on an "AS IS" basis. PSF MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED. BY WAY OF EXAMPLE, BUT NOT LIMITATION, PSF MAKES NO AND DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF PYTHON WILL NOT INFRINGE ANY THIRD PARTY RIGHTS. 5. PSF SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF PYTHON FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS A RESULT OF MODIFYING, DISTRIBUTING, OR OTHERWISE USING PYTHON, OR ANY DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF. 6. This License Agreement will automatically terminate upon a material breach of its terms and conditions. 7. Nothing in this License Agreement shall be deemed to create any relationship of agency, partnership, or joint venture between PSF and Licensee. This License Agreement does not grant permission to use PSF trademarks or trade name in a trademark sense to endorse or promote products or services of Licensee, or any third party. 8. By copying, installing or otherwise using Python, Licensee agrees to be bound by the terms and conditions of this License Agreement. BEOPEN.COM LICENSE AGREEMENT FOR PYTHON 2.0 ------------------------------------------- BEOPEN PYTHON OPEN SOURCE LICENSE AGREEMENT VERSION 1 1. This LICENSE AGREEMENT is between BeOpen.com ("BeOpen"), having an office at 160 Saratoga Avenue, Santa Clara, CA 95051, and the Individual or Organization ("Licensee") accessing and otherwise using this software in source or binary form and its associated documentation ("the Software"). 2. Subject to the terms and conditions of this BeOpen Python License Agreement, BeOpen hereby grants Licensee a non-exclusive, royalty-free, world-wide license to reproduce, analyze, test, perform and/or display publicly, prepare derivative works, distribute, and otherwise use the Software alone or in any derivative version, provided, however, that the BeOpen Python License is retained in the Software, alone or in any derivative version prepared by Licensee. 3. BeOpen is making the Software available to Licensee on an "AS IS" basis. BEOPEN MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED. BY WAY OF EXAMPLE, BUT NOT LIMITATION, BEOPEN MAKES NO AND DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF THE SOFTWARE WILL NOT INFRINGE ANY THIRD PARTY RIGHTS. 4. BEOPEN SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF THE SOFTWARE FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS A RESULT OF USING, MODIFYING OR DISTRIBUTING THE SOFTWARE, OR ANY DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF. 5. This License Agreement will automatically terminate upon a material breach of its terms and conditions. 6. This License Agreement shall be governed by and interpreted in all respects by the law of the State of California, excluding conflict of law provisions. Nothing in this License Agreement shall be deemed to create any relationship of agency, partnership, or joint venture between BeOpen and Licensee. This License Agreement does not grant permission to use BeOpen trademarks or trade names in a trademark sense to endorse or promote products or services of Licensee, or any third party. As an exception, the "BeOpen Python" logos available at http://www.pythonlabs.com/logos.html may be used according to the permissions granted on that web page. 7. By copying, installing or otherwise using the software, Licensee agrees to be bound by the terms and conditions of this License Agreement. CNRI LICENSE AGREEMENT FOR PYTHON 1.6.1 --------------------------------------- 1. This LICENSE AGREEMENT is between the Corporation for National Research Initiatives, having an office at 1895 Preston White Drive, Reston, VA 20191 ("CNRI"), and the Individual or Organization ("Licensee") accessing and otherwise using Python 1.6.1 software in source or binary form and its associated documentation. 2. Subject to the terms and conditions of this License Agreement, CNRI hereby grants Licensee a nonexclusive, royalty-free, world-wide license to reproduce, analyze, test, perform and/or display publicly, prepare derivative works, distribute, and otherwise use Python 1.6.1 alone or in any derivative version, provided, however, that CNRI's License Agreement and CNRI's notice of copyright, i.e., "Copyright (c) 1995-2001 Corporation for National Research Initiatives; All Rights Reserved" are retained in Python 1.6.1 alone or in any derivative version prepared by Licensee. Alternately, in lieu of CNRI's License Agreement, Licensee may substitute the following text (omitting the quotes): "Python 1.6.1 is made available subject to the terms and conditions in CNRI's License Agreement. This Agreement together with Python 1.6.1 may be located on the internet using the following unique, persistent identifier (known as a handle): 1895.22/1013. This Agreement may also be obtained from a proxy server on the internet using the following URL: http://hdl.handle.net/1895.22/1013". 3. In the event Licensee prepares a derivative work that is based on or incorporates Python 1.6.1 or any part thereof, and wants to make the derivative work available to others as provided herein, then Licensee hereby agrees to include in any such work a brief summary of the changes made to Python 1.6.1. 4. CNRI is making Python 1.6.1 available to Licensee on an "AS IS" basis. CNRI MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED. BY WAY OF EXAMPLE, BUT NOT LIMITATION, CNRI MAKES NO AND DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF PYTHON 1.6.1 WILL NOT INFRINGE ANY THIRD PARTY RIGHTS. 5. CNRI SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF PYTHON 1.6.1 FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS A RESULT OF MODIFYING, DISTRIBUTING, OR OTHERWISE USING PYTHON 1.6.1, OR ANY DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF. 6. This License Agreement will automatically terminate upon a material breach of its terms and conditions. 7. This License Agreement shall be governed by the federal intellectual property law of the United States, including without limitation the federal copyright law, and, to the extent such U.S. federal law does not apply, by the law of the Commonwealth of Virginia, excluding Virginia's conflict of law provisions. Notwithstanding the foregoing, with regard to derivative works based on Python 1.6.1 that incorporate non-separable material that was previously distributed under the GNU General Public License (GPL), the law of the Commonwealth of Virginia shall govern this License Agreement only as to issues arising under or with respect to Paragraphs 4, 5, and 7 of this License Agreement. Nothing in this License Agreement shall be deemed to create any relationship of agency, partnership, or joint venture between CNRI and Licensee. This License Agreement does not grant permission to use CNRI trademarks or trade name in a trademark sense to endorse or promote products or services of Licensee, or any third party. 8. By clicking on the "ACCEPT" button where indicated, or by copying, installing or otherwise using Python 1.6.1, Licensee agrees to be bound by the terms and conditions of this License Agreement. ACCEPT CWI LICENSE AGREEMENT FOR PYTHON 0.9.0 THROUGH 1.2 -------------------------------------------------- Copyright (c) 1991 - 1995, Stichting Mathematisch Centrum Amsterdam, The Netherlands. All rights reserved. Permission to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of Stichting Mathematisch Centrum or CWI not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. STICHTING MATHEMATISCH CENTRUM DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH CENTRUM BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. ZERO-CLAUSE BSD LICENSE FOR CODE IN THE PYTHON DOCUMENTATION ---------------------------------------------------------------------- Permission to use, copy, modify, and/or distribute this software for any purpose with or without fee is hereby granted. THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/typing_extensions-4.9.0.dist-info/WHEEL
Wheel-Version: 1.0 Generator: flit 3.9.0 Root-Is-Purelib: true Tag: py3-none-any
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/typing_extensions-4.9.0.dist-info/INSTALLER
pip
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/typing_extensions-4.9.0.dist-info/METADATA
Metadata-Version: 2.1 Name: typing_extensions Version: 4.9.0 Summary: Backported and Experimental Type Hints for Python 3.8+ Keywords: annotations,backport,checker,checking,function,hinting,hints,type,typechecking,typehinting,typehints,typing Author-email: "Guido van Rossum, Jukka Lehtosalo, Łukasz Langa, Michael Lee" <levkivskyi@gmail.com> Requires-Python: >=3.8 Description-Content-Type: text/markdown Classifier: Development Status :: 5 - Production/Stable Classifier: Environment :: Console Classifier: Intended Audience :: Developers Classifier: License :: OSI Approved :: Python Software Foundation License Classifier: Operating System :: OS Independent Classifier: Programming Language :: Python :: 3 Classifier: Programming Language :: Python :: 3 :: Only Classifier: Programming Language :: Python :: 3.8 Classifier: Programming Language :: Python :: 3.9 Classifier: Programming Language :: Python :: 3.10 Classifier: Programming Language :: Python :: 3.11 Classifier: Programming Language :: Python :: 3.12 Classifier: Topic :: Software Development Project-URL: Bug Tracker, https://github.com/python/typing_extensions/issues Project-URL: Changes, https://github.com/python/typing_extensions/blob/main/CHANGELOG.md Project-URL: Documentation, https://typing-extensions.readthedocs.io/ Project-URL: Home, https://github.com/python/typing_extensions Project-URL: Q & A, https://github.com/python/typing/discussions Project-URL: Repository, https://github.com/python/typing_extensions # Typing Extensions [![Chat at https://gitter.im/python/typing](https://badges.gitter.im/python/typing.svg)](https://gitter.im/python/typing) [Documentation](https://typing-extensions.readthedocs.io/en/latest/#) – [PyPI](https://pypi.org/project/typing-extensions/) ## Overview The `typing_extensions` module serves two related purposes: - Enable use of new type system features on older Python versions. For example, `typing.TypeGuard` is new in Python 3.10, but `typing_extensions` allows users on previous Python versions to use it too. - Enable experimentation with new type system PEPs before they are accepted and added to the `typing` module. `typing_extensions` is treated specially by static type checkers such as mypy and pyright. Objects defined in `typing_extensions` are treated the same way as equivalent forms in `typing`. `typing_extensions` uses [Semantic Versioning](https://semver.org/). The major version will be incremented only for backwards-incompatible changes. Therefore, it's safe to depend on `typing_extensions` like this: `typing_extensions >=x.y, <(x+1)`, where `x.y` is the first version that includes all features you need. ## Included items See [the documentation](https://typing-extensions.readthedocs.io/en/latest/#) for a complete listing of module contents. ## Contributing See [CONTRIBUTING.md](https://github.com/python/typing_extensions/blob/main/CONTRIBUTING.md) for how to contribute to `typing_extensions`.
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/attrs/__init__.pyi
from typing import ( Any, Callable, Dict, Mapping, Optional, Sequence, Tuple, Type, ) # Because we need to type our own stuff, we have to make everything from # attr explicitly public too. from attr import __author__ as __author__ from attr import __copyright__ as __copyright__ from attr import __description__ as __description__ from attr import __email__ as __email__ from attr import __license__ as __license__ from attr import __title__ as __title__ from attr import __url__ as __url__ from attr import __version__ as __version__ from attr import __version_info__ as __version_info__ from attr import _FilterType from attr import assoc as assoc from attr import Attribute as Attribute from attr import AttrsInstance as AttrsInstance from attr import cmp_using as cmp_using from attr import converters as converters from attr import define as define from attr import evolve as evolve from attr import exceptions as exceptions from attr import Factory as Factory from attr import field as field from attr import fields as fields from attr import fields_dict as fields_dict from attr import filters as filters from attr import frozen as frozen from attr import has as has from attr import make_class as make_class from attr import mutable as mutable from attr import NOTHING as NOTHING from attr import resolve_types as resolve_types from attr import setters as setters from attr import validate as validate from attr import validators as validators # TODO: see definition of attr.asdict/astuple def asdict( inst: AttrsInstance, recurse: bool = ..., filter: Optional[_FilterType[Any]] = ..., dict_factory: Type[Mapping[Any, Any]] = ..., retain_collection_types: bool = ..., value_serializer: Optional[ Callable[[type, Attribute[Any], Any], Any] ] = ..., tuple_keys: bool = ..., ) -> Dict[str, Any]: ... # TODO: add support for returning NamedTuple from the mypy plugin def astuple( inst: AttrsInstance, recurse: bool = ..., filter: Optional[_FilterType[Any]] = ..., tuple_factory: Type[Sequence[Any]] = ..., retain_collection_types: bool = ..., ) -> Tuple[Any, ...]: ...
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/attrs/setters.py
# SPDX-License-Identifier: MIT from attr.setters import * # noqa
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/attrs/validators.py
# SPDX-License-Identifier: MIT from attr.validators import * # noqa
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/attrs/__init__.py
# SPDX-License-Identifier: MIT from attr import ( NOTHING, Attribute, AttrsInstance, Factory, _make_getattr, assoc, cmp_using, define, evolve, field, fields, fields_dict, frozen, has, make_class, mutable, resolve_types, validate, ) from attr._next_gen import asdict, astuple from . import converters, exceptions, filters, setters, validators __all__ = [ "__author__", "__copyright__", "__description__", "__doc__", "__email__", "__license__", "__title__", "__url__", "__version__", "__version_info__", "asdict", "assoc", "astuple", "Attribute", "AttrsInstance", "cmp_using", "converters", "define", "evolve", "exceptions", "Factory", "field", "fields_dict", "fields", "filters", "frozen", "has", "make_class", "mutable", "NOTHING", "resolve_types", "setters", "validate", "validators", ] __getattr__ = _make_getattr(__name__)
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/attrs/exceptions.py
# SPDX-License-Identifier: MIT from attr.exceptions import * # noqa
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/attrs/converters.py
# SPDX-License-Identifier: MIT from attr.converters import * # noqa
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/attrs/filters.py
# SPDX-License-Identifier: MIT from attr.filters import * # noqa
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/python_dateutil-2.8.2.dist-info/zip-safe
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/python_dateutil-2.8.2.dist-info/RECORD
dateutil/__init__.py,sha256=lXElASqwYGwqlrSWSeX19JwF5Be9tNecDa9ebk-0gmk,222 dateutil/__pycache__/__init__.cpython-311.pyc,, dateutil/__pycache__/_common.cpython-311.pyc,, dateutil/__pycache__/_version.cpython-311.pyc,, dateutil/__pycache__/easter.cpython-311.pyc,, dateutil/__pycache__/relativedelta.cpython-311.pyc,, dateutil/__pycache__/rrule.cpython-311.pyc,, dateutil/__pycache__/tzwin.cpython-311.pyc,, dateutil/__pycache__/utils.cpython-311.pyc,, dateutil/_common.py,sha256=77w0yytkrxlYbSn--lDVPUMabUXRR9I3lBv_vQRUqUY,932 dateutil/_version.py,sha256=awyHv2PYvDR84dxjrHyzmm8nieFwMjcuuShPh-QNkM4,142 dateutil/easter.py,sha256=dyBi-lKvimH1u_k6p7Z0JJK72QhqVtVBsqByvpEPKvc,2678 dateutil/parser/__init__.py,sha256=wWk6GFuxTpjoggCGtgkceJoti4pVjl4_fHQXpNOaSYg,1766 dateutil/parser/__pycache__/__init__.cpython-311.pyc,, dateutil/parser/__pycache__/_parser.cpython-311.pyc,, dateutil/parser/__pycache__/isoparser.cpython-311.pyc,, dateutil/parser/_parser.py,sha256=7klDdyicksQB_Xgl-3UAmBwzCYor1AIZqklIcT6dH_8,58796 dateutil/parser/isoparser.py,sha256=EtLY7w22HWx-XJpTWxJD3XNs6LBHRCps77tCdLnYad8,13247 dateutil/relativedelta.py,sha256=GjVxqpAVWnG67rdbf7pkoIlJvQqmju9NSfGCcqblc7U,24904 dateutil/rrule.py,sha256=b6GVV4MpZDbBhJ5qitQKRyx8-_OKyeAbk57or2A8AYU,66556 dateutil/tz/__init__.py,sha256=F-Mz13v6jYseklQf9Te9J6nzcLDmq47gORa61K35_FA,444 dateutil/tz/__pycache__/__init__.cpython-311.pyc,, dateutil/tz/__pycache__/_common.cpython-311.pyc,, dateutil/tz/__pycache__/_factories.cpython-311.pyc,, dateutil/tz/__pycache__/tz.cpython-311.pyc,, dateutil/tz/__pycache__/win.cpython-311.pyc,, dateutil/tz/_common.py,sha256=cgzDTANsOXvEc86cYF77EsliuSab8Puwpsl5-bX3_S4,12977 dateutil/tz/_factories.py,sha256=unb6XQNXrPMveksTCU-Ag8jmVZs4SojoPUcAHpWnrvU,2569 dateutil/tz/tz.py,sha256=JotVjDcF16hzoouQ0kZW-5mCYu7Xj67NI-VQgnWapKE,62857 dateutil/tz/win.py,sha256=xJszWgSwE1xPx_HJj4ZkepyukC_hNy016WMcXhbRaB8,12935 dateutil/tzwin.py,sha256=7Ar4vdQCnnM0mKR3MUjbIKsZrBVfHgdwsJZc_mGYRew,59 dateutil/utils.py,sha256=dKCchEw8eObi0loGTx91unBxm_7UGlU3v_FjFMdqwYM,1965 dateutil/zoneinfo/__init__.py,sha256=KYg0pthCMjcp5MXSEiBJn3nMjZeNZav7rlJw5-tz1S4,5889 dateutil/zoneinfo/__pycache__/__init__.cpython-311.pyc,, dateutil/zoneinfo/__pycache__/rebuild.cpython-311.pyc,, dateutil/zoneinfo/dateutil-zoneinfo.tar.gz,sha256=AkcdBx3XkEZwMSpS_TmOEfrEFHLvgxPNDVIwGVxTVaI,174394 dateutil/zoneinfo/rebuild.py,sha256=MiqYzCIHvNbMH-LdRYLv-4T0EIA7hDKt5GLR0IRTLdI,2392 python_dateutil-2.8.2.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4 python_dateutil-2.8.2.dist-info/LICENSE,sha256=ugD1Gg2SgjtaHN4n2LW50jIeZ-2NqbwWPv-W1eF-V34,2889 python_dateutil-2.8.2.dist-info/METADATA,sha256=RDHtGo7BnYRjmYxot_wlu_W3N2CyvPtvchbtyIlKKPA,8218 python_dateutil-2.8.2.dist-info/RECORD,, python_dateutil-2.8.2.dist-info/WHEEL,sha256=Z-nyYpwrcSqxfdux5Mbn_DQ525iP7J2DG3JgGvOYyTQ,110 python_dateutil-2.8.2.dist-info/top_level.txt,sha256=4tjdWkhRZvF7LA_BYe_L9gB2w_p2a-z5y6ArjaRkot8,9 python_dateutil-2.8.2.dist-info/zip-safe,sha256=AbpHGcgLb-kRsJGnwFEktk7uzpZOCcBY74-YBdrKVGs,1
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/python_dateutil-2.8.2.dist-info/LICENSE
Copyright 2017- Paul Ganssle <paul@ganssle.io> Copyright 2017- dateutil contributors (see AUTHORS file) Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. The above license applies to all contributions after 2017-12-01, as well as all contributions that have been re-licensed (see AUTHORS file for the list of contributors who have re-licensed their code). -------------------------------------------------------------------------------- dateutil - Extensions to the standard Python datetime module. Copyright (c) 2003-2011 - Gustavo Niemeyer <gustavo@niemeyer.net> Copyright (c) 2012-2014 - Tomi Pieviläinen <tomi.pievilainen@iki.fi> Copyright (c) 2014-2016 - Yaron de Leeuw <me@jarondl.net> Copyright (c) 2015- - Paul Ganssle <paul@ganssle.io> Copyright (c) 2015- - dateutil contributors (see AUTHORS file) All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. The above BSD License Applies to all code, even that also covered by Apache 2.0.
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/python_dateutil-2.8.2.dist-info/WHEEL
Wheel-Version: 1.0 Generator: bdist_wheel (0.36.2) Root-Is-Purelib: true Tag: py2-none-any Tag: py3-none-any
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/python_dateutil-2.8.2.dist-info/top_level.txt
dateutil
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/python_dateutil-2.8.2.dist-info/INSTALLER
pip
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/python_dateutil-2.8.2.dist-info/METADATA
Metadata-Version: 2.1 Name: python-dateutil Version: 2.8.2 Summary: Extensions to the standard Python datetime module Home-page: https://github.com/dateutil/dateutil Author: Gustavo Niemeyer Author-email: gustavo@niemeyer.net Maintainer: Paul Ganssle Maintainer-email: dateutil@python.org License: Dual License Project-URL: Documentation, https://dateutil.readthedocs.io/en/stable/ Project-URL: Source, https://github.com/dateutil/dateutil Platform: UNKNOWN Classifier: Development Status :: 5 - Production/Stable Classifier: Intended Audience :: Developers Classifier: License :: OSI Approved :: BSD License Classifier: License :: OSI Approved :: Apache Software License Classifier: Programming Language :: Python Classifier: Programming Language :: Python :: 2 Classifier: Programming Language :: Python :: 2.7 Classifier: Programming Language :: Python :: 3 Classifier: Programming Language :: Python :: 3.3 Classifier: Programming Language :: Python :: 3.4 Classifier: Programming Language :: Python :: 3.5 Classifier: Programming Language :: Python :: 3.6 Classifier: Programming Language :: Python :: 3.7 Classifier: Programming Language :: Python :: 3.8 Classifier: Programming Language :: Python :: 3.9 Classifier: Topic :: Software Development :: Libraries Requires-Python: !=3.0.*,!=3.1.*,!=3.2.*,>=2.7 Description-Content-Type: text/x-rst License-File: LICENSE Requires-Dist: six (>=1.5) dateutil - powerful extensions to datetime ========================================== |pypi| |support| |licence| |gitter| |readthedocs| |travis| |appveyor| |pipelines| |coverage| .. |pypi| image:: https://img.shields.io/pypi/v/python-dateutil.svg?style=flat-square :target: https://pypi.org/project/python-dateutil/ :alt: pypi version .. |support| image:: https://img.shields.io/pypi/pyversions/python-dateutil.svg?style=flat-square :target: https://pypi.org/project/python-dateutil/ :alt: supported Python version .. |travis| image:: https://img.shields.io/travis/dateutil/dateutil/master.svg?style=flat-square&label=Travis%20Build :target: https://travis-ci.org/dateutil/dateutil :alt: travis build status .. |appveyor| image:: https://img.shields.io/appveyor/ci/dateutil/dateutil/master.svg?style=flat-square&logo=appveyor :target: https://ci.appveyor.com/project/dateutil/dateutil :alt: appveyor build status .. |pipelines| image:: https://dev.azure.com/pythondateutilazure/dateutil/_apis/build/status/dateutil.dateutil?branchName=master :target: https://dev.azure.com/pythondateutilazure/dateutil/_build/latest?definitionId=1&branchName=master :alt: azure pipelines build status .. |coverage| image:: https://codecov.io/gh/dateutil/dateutil/branch/master/graphs/badge.svg?branch=master :target: https://codecov.io/gh/dateutil/dateutil?branch=master :alt: Code coverage .. |gitter| image:: https://badges.gitter.im/dateutil/dateutil.svg :alt: Join the chat at https://gitter.im/dateutil/dateutil :target: https://gitter.im/dateutil/dateutil .. |licence| image:: https://img.shields.io/pypi/l/python-dateutil.svg?style=flat-square :target: https://pypi.org/project/python-dateutil/ :alt: licence .. |readthedocs| image:: https://img.shields.io/readthedocs/dateutil/latest.svg?style=flat-square&label=Read%20the%20Docs :alt: Read the documentation at https://dateutil.readthedocs.io/en/latest/ :target: https://dateutil.readthedocs.io/en/latest/ The `dateutil` module provides powerful extensions to the standard `datetime` module, available in Python. Installation ============ `dateutil` can be installed from PyPI using `pip` (note that the package name is different from the importable name):: pip install python-dateutil Download ======== dateutil is available on PyPI https://pypi.org/project/python-dateutil/ The documentation is hosted at: https://dateutil.readthedocs.io/en/stable/ Code ==== The code and issue tracker are hosted on GitHub: https://github.com/dateutil/dateutil/ Features ======== * Computing of relative deltas (next month, next year, next Monday, last week of month, etc); * Computing of relative deltas between two given date and/or datetime objects; * Computing of dates based on very flexible recurrence rules, using a superset of the `iCalendar <https://www.ietf.org/rfc/rfc2445.txt>`_ specification. Parsing of RFC strings is supported as well. * Generic parsing of dates in almost any string format; * Timezone (tzinfo) implementations for tzfile(5) format files (/etc/localtime, /usr/share/zoneinfo, etc), TZ environment string (in all known formats), iCalendar format files, given ranges (with help from relative deltas), local machine timezone, fixed offset timezone, UTC timezone, and Windows registry-based time zones. * Internal up-to-date world timezone information based on Olson's database. * Computing of Easter Sunday dates for any given year, using Western, Orthodox or Julian algorithms; * A comprehensive test suite. Quick example ============= Here's a snapshot, just to give an idea about the power of the package. For more examples, look at the documentation. Suppose you want to know how much time is left, in years/months/days/etc, before the next easter happening on a year with a Friday 13th in August, and you want to get today's date out of the "date" unix system command. Here is the code: .. code-block:: python3 >>> from dateutil.relativedelta import * >>> from dateutil.easter import * >>> from dateutil.rrule import * >>> from dateutil.parser import * >>> from datetime import * >>> now = parse("Sat Oct 11 17:13:46 UTC 2003") >>> today = now.date() >>> year = rrule(YEARLY,dtstart=now,bymonth=8,bymonthday=13,byweekday=FR)[0].year >>> rdelta = relativedelta(easter(year), today) >>> print("Today is: %s" % today) Today is: 2003-10-11 >>> print("Year with next Aug 13th on a Friday is: %s" % year) Year with next Aug 13th on a Friday is: 2004 >>> print("How far is the Easter of that year: %s" % rdelta) How far is the Easter of that year: relativedelta(months=+6) >>> print("And the Easter of that year is: %s" % (today+rdelta)) And the Easter of that year is: 2004-04-11 Being exactly 6 months ahead was **really** a coincidence :) Contributing ============ We welcome many types of contributions - bug reports, pull requests (code, infrastructure or documentation fixes). For more information about how to contribute to the project, see the ``CONTRIBUTING.md`` file in the repository. Author ====== The dateutil module was written by Gustavo Niemeyer <gustavo@niemeyer.net> in 2003. It is maintained by: * Gustavo Niemeyer <gustavo@niemeyer.net> 2003-2011 * Tomi Pieviläinen <tomi.pievilainen@iki.fi> 2012-2014 * Yaron de Leeuw <me@jarondl.net> 2014-2016 * Paul Ganssle <paul@ganssle.io> 2015- Starting with version 2.4.1 and running until 2.8.2, all source and binary distributions will be signed by a PGP key that has, at the very least, been signed by the key which made the previous release. A table of release signing keys can be found below: =========== ============================ Releases Signing key fingerprint =========== ============================ 2.4.1-2.8.2 `6B49 ACBA DCF6 BD1C A206 67AB CD54 FCE3 D964 BEFB`_ =========== ============================ New releases *may* have signed tags, but binary and source distributions uploaded to PyPI will no longer have GPG signatures attached. Contact ======= Our mailing list is available at `dateutil@python.org <https://mail.python.org/mailman/listinfo/dateutil>`_. As it is hosted by the PSF, it is subject to the `PSF code of conduct <https://www.python.org/psf/conduct/>`_. License ======= All contributions after December 1, 2017 released under dual license - either `Apache 2.0 License <https://www.apache.org/licenses/LICENSE-2.0>`_ or the `BSD 3-Clause License <https://opensource.org/licenses/BSD-3-Clause>`_. Contributions before December 1, 2017 - except those those explicitly relicensed - are released only under the BSD 3-Clause License. .. _6B49 ACBA DCF6 BD1C A206 67AB CD54 FCE3 D964 BEFB: https://pgp.mit.edu/pks/lookup?op=vindex&search=0xCD54FCE3D964BEFB
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/attrs-23.1.0.dist-info/RECORD
attr/__init__.py,sha256=dSRUBxRVTh-dXMrMR_oQ3ZISu2QSfhSZlik03Mjbu30,3241 attr/__init__.pyi,sha256=rIK-2IakIoehVtqXK5l5rs9_fJNCbnYtKTS3cOAVJD8,17609 attr/__pycache__/__init__.cpython-311.pyc,, attr/__pycache__/_cmp.cpython-311.pyc,, attr/__pycache__/_compat.cpython-311.pyc,, attr/__pycache__/_config.cpython-311.pyc,, attr/__pycache__/_funcs.cpython-311.pyc,, attr/__pycache__/_make.cpython-311.pyc,, attr/__pycache__/_next_gen.cpython-311.pyc,, attr/__pycache__/_version_info.cpython-311.pyc,, attr/__pycache__/converters.cpython-311.pyc,, attr/__pycache__/exceptions.cpython-311.pyc,, attr/__pycache__/filters.cpython-311.pyc,, attr/__pycache__/setters.cpython-311.pyc,, attr/__pycache__/validators.cpython-311.pyc,, attr/_cmp.py,sha256=diMUQV-BIg7IjIb6-o1hswtnjrR4qdAUz_tE8gxS96w,4098 attr/_cmp.pyi,sha256=sGQmOM0w3_K4-X8cTXR7g0Hqr290E8PTObA9JQxWQqc,399 attr/_compat.py,sha256=d3cpIu60IbKrLywPni17RUEQY7MvkqqKifyzJ5H3zRU,5803 attr/_config.py,sha256=5W8lgRePuIOWu1ZuqF1899e2CmXGc95-ipwTpF1cEU4,826 attr/_funcs.py,sha256=YMtzHRSOnFvOVJ7at3E0K95A2lW26HDjby96TMTDbc0,16730 attr/_make.py,sha256=JIyKV-HRh3IcHi-EvOj2dw6tRoqATlx2kBHFrrxZpk0,96979 attr/_next_gen.py,sha256=8lB_S5SFgX2KsflksK8Zygk6XDXToQYtIlmgd37I9aY,6271 attr/_typing_compat.pyi,sha256=XDP54TUn-ZKhD62TOQebmzrwFyomhUCoGRpclb6alRA,469 attr/_version_info.py,sha256=exSqb3b5E-fMSsgZAlEw9XcLpEgobPORCZpcaEglAM4,2121 attr/_version_info.pyi,sha256=x_M3L3WuB7r_ULXAWjx959udKQ4HLB8l-hsc1FDGNvk,209 attr/converters.py,sha256=xfGVSPRgWGcym6N5FZM9fyfvCQePqFyApWeC5BXKvoM,3602 attr/converters.pyi,sha256=jKlpHBEt6HVKJvgrMFJRrHq8p61GXg4-Nd5RZWKJX7M,406 attr/exceptions.py,sha256=0ZTyH_mHmI9utwTTbBWrdS_ck5jps9R2M_fYJPXxH_U,1890 attr/exceptions.pyi,sha256=zZq8bCUnKAy9mDtBEw42ZhPhAUIHoTKedDQInJD883M,539 attr/filters.py,sha256=9pYvXqdg6mtLvKIIb56oALRMoHFnQTcGCO4EXTc1qyM,1470 attr/filters.pyi,sha256=0mRCjLKxdcvAo0vD-Cr81HfRXXCp9j_cAXjOoAHtPGM,225 attr/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 attr/setters.py,sha256=pbCZQ-pE6ZxjDqZfWWUhUFefXtpekIU4qS_YDMLPQ50,1400 attr/setters.pyi,sha256=pyY8TVNBu8TWhOldv_RxHzmGvdgFQH981db70r0fn5I,567 attr/validators.py,sha256=C2MQgX7ubL_cs5YzibWa8m0YxdMq5_3Ch3dVIzsLO-Y,20702 attr/validators.pyi,sha256=167Dl9nt7NUhE9wht1I-buo039qyUT1nEUT_nKjSWr4,2580 attrs-23.1.0.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4 attrs-23.1.0.dist-info/METADATA,sha256=yglwUXko75Q-IJ6LmPVQ4Y99KJS3CPK0NW8ovXFYsDg,11348 attrs-23.1.0.dist-info/RECORD,, attrs-23.1.0.dist-info/WHEEL,sha256=EI2JsGydwUL5GP9t6kzZv7G3HDPi7FuZDDf9In6amRM,87 attrs-23.1.0.dist-info/licenses/LICENSE,sha256=iCEVyV38KvHutnFPjsbVy8q_Znyv-HKfQkINpj9xTp8,1109 attrs/__init__.py,sha256=9_5waVbFs7rLqtXZ73tNDrxhezyZ8VZeX4BbvQ3EeJw,1039 attrs/__init__.pyi,sha256=s_ajQ_U14DOsOz0JbmAKDOi46B3v2PcdO0UAV1MY6Ek,2168 attrs/__pycache__/__init__.cpython-311.pyc,, attrs/__pycache__/converters.cpython-311.pyc,, attrs/__pycache__/exceptions.cpython-311.pyc,, attrs/__pycache__/filters.cpython-311.pyc,, attrs/__pycache__/setters.cpython-311.pyc,, attrs/__pycache__/validators.cpython-311.pyc,, attrs/converters.py,sha256=fCBEdlYWcmI3sCnpUk2pz22GYtXzqTkp6NeOpdI64PY,70 attrs/exceptions.py,sha256=SlDli6AY77f6ny-H7oy98OkQjsrw-D_supEuErIVYkE,70 attrs/filters.py,sha256=dc_dNey29kH6KLU1mT2Dakq7tZ3kBfzEGwzOmDzw1F8,67 attrs/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 attrs/setters.py,sha256=oKw51C72Hh45wTwYvDHJP9kbicxiMhMR4Y5GvdpKdHQ,67 attrs/validators.py,sha256=4ag1SyVD2Hm3PYKiNG_NOtR_e7f81Hr6GiNl4YvXo4Q,70
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/attrs-23.1.0.dist-info/WHEEL
Wheel-Version: 1.0 Generator: hatchling 1.14.0 Root-Is-Purelib: true Tag: py3-none-any
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/attrs-23.1.0.dist-info/INSTALLER
pip
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/attrs-23.1.0.dist-info/METADATA
Metadata-Version: 2.1 Name: attrs Version: 23.1.0 Summary: Classes Without Boilerplate Project-URL: Documentation, https://www.attrs.org/ Project-URL: Changelog, https://www.attrs.org/en/stable/changelog.html Project-URL: Bug Tracker, https://github.com/python-attrs/attrs/issues Project-URL: Source Code, https://github.com/python-attrs/attrs Project-URL: Funding, https://github.com/sponsors/hynek Project-URL: Tidelift, https://tidelift.com/subscription/pkg/pypi-attrs?utm_source=pypi-attrs&utm_medium=pypi Author-email: Hynek Schlawack <hs@ox.cx> License-Expression: MIT License-File: LICENSE Keywords: attribute,boilerplate,class Classifier: Development Status :: 5 - Production/Stable Classifier: Intended Audience :: Developers Classifier: License :: OSI Approved :: MIT License Classifier: Programming Language :: Python :: 3.7 Classifier: Programming Language :: Python :: 3.8 Classifier: Programming Language :: Python :: 3.9 Classifier: Programming Language :: Python :: 3.10 Classifier: Programming Language :: Python :: 3.11 Classifier: Programming Language :: Python :: Implementation :: CPython Classifier: Programming Language :: Python :: Implementation :: PyPy Classifier: Typing :: Typed Requires-Python: >=3.7 Requires-Dist: importlib-metadata; python_version < '3.8' Provides-Extra: cov Requires-Dist: attrs[tests]; extra == 'cov' Requires-Dist: coverage[toml]>=5.3; extra == 'cov' Provides-Extra: dev Requires-Dist: attrs[docs,tests]; extra == 'dev' Requires-Dist: pre-commit; extra == 'dev' Provides-Extra: docs Requires-Dist: furo; extra == 'docs' Requires-Dist: myst-parser; extra == 'docs' Requires-Dist: sphinx; extra == 'docs' Requires-Dist: sphinx-notfound-page; extra == 'docs' Requires-Dist: sphinxcontrib-towncrier; extra == 'docs' Requires-Dist: towncrier; extra == 'docs' Requires-Dist: zope-interface; extra == 'docs' Provides-Extra: tests Requires-Dist: attrs[tests-no-zope]; extra == 'tests' Requires-Dist: zope-interface; extra == 'tests' Provides-Extra: tests-no-zope Requires-Dist: cloudpickle; platform_python_implementation == 'CPython' and extra == 'tests-no-zope' Requires-Dist: hypothesis; extra == 'tests-no-zope' Requires-Dist: mypy>=1.1.1; platform_python_implementation == 'CPython' and extra == 'tests-no-zope' Requires-Dist: pympler; extra == 'tests-no-zope' Requires-Dist: pytest-mypy-plugins; platform_python_implementation == 'CPython' and python_version < '3.11' and extra == 'tests-no-zope' Requires-Dist: pytest-xdist[psutil]; extra == 'tests-no-zope' Requires-Dist: pytest>=4.3.0; extra == 'tests-no-zope' Description-Content-Type: text/markdown <p align="center"> <a href="https://www.attrs.org/"> <img src="https://raw.githubusercontent.com/python-attrs/attrs/main/docs/_static/attrs_logo.svg" width="35%" alt="attrs" /> </a> </p> *attrs* is the Python package that will bring back the **joy** of **writing classes** by relieving you from the drudgery of implementing object protocols (aka [dunder methods](https://www.attrs.org/en/latest/glossary.html#term-dunder-methods)). [Trusted by NASA](https://docs.github.com/en/account-and-profile/setting-up-and-managing-your-github-profile/customizing-your-profile/personalizing-your-profile#list-of-qualifying-repositories-for-mars-2020-helicopter-contributor-achievement) for Mars missions since 2020! Its main goal is to help you to write **concise** and **correct** software without slowing down your code. ## Sponsors *attrs* would not be possible without our [amazing sponsors](https://github.com/sponsors/hynek). Especially those generously supporting us at the *The Organization* tier and higher: <p align="center"> <a href="https://www.variomedia.de/"> <img src="https://raw.githubusercontent.com/python-attrs/attrs/main/.github/sponsors/Variomedia.svg" width="200" height="60"></img> </a> <a href="https://tidelift.com/subscription/pkg/pypi-attrs?utm_source=pypi-attrs&utm_medium=referral&utm_campaign=enterprise&utm_term=repo"> <img src="https://raw.githubusercontent.com/python-attrs/attrs/main/.github/sponsors/Tidelift.svg" width="200" height="60"></img> </a> <a href="https://sentry.io/"> <img src="https://raw.githubusercontent.com/python-attrs/attrs/main/.github/sponsors/Sentry.svg" width="200" height="60"></img> </a> <a href="https://filepreviews.io/"> <img src="https://raw.githubusercontent.com/python-attrs/attrs/main/.github/sponsors/FilePreviews.svg" width="200" height="60"></img> </a> </p> <p align="center"> <strong>Please consider <a href="https://github.com/sponsors/hynek">joining them</a> to help make <em>attrs</em>’s maintenance more sustainable!</strong> </p> <!-- teaser-end --> ## Example *attrs* gives you a class decorator and a way to declaratively define the attributes on that class: <!-- code-begin --> ```pycon >>> from attrs import asdict, define, make_class, Factory >>> @define ... class SomeClass: ... a_number: int = 42 ... list_of_numbers: list[int] = Factory(list) ... ... def hard_math(self, another_number): ... return self.a_number + sum(self.list_of_numbers) * another_number >>> sc = SomeClass(1, [1, 2, 3]) >>> sc SomeClass(a_number=1, list_of_numbers=[1, 2, 3]) >>> sc.hard_math(3) 19 >>> sc == SomeClass(1, [1, 2, 3]) True >>> sc != SomeClass(2, [3, 2, 1]) True >>> asdict(sc) {'a_number': 1, 'list_of_numbers': [1, 2, 3]} >>> SomeClass() SomeClass(a_number=42, list_of_numbers=[]) >>> C = make_class("C", ["a", "b"]) >>> C("foo", "bar") C(a='foo', b='bar') ``` After *declaring* your attributes, *attrs* gives you: - a concise and explicit overview of the class's attributes, - a nice human-readable `__repr__`, - equality-checking methods, - an initializer, - and much more, *without* writing dull boilerplate code again and again and *without* runtime performance penalties. **Hate type annotations**!? No problem! Types are entirely **optional** with *attrs*. Simply assign `attrs.field()` to the attributes instead of annotating them with types. --- This example uses *attrs*'s modern APIs that have been introduced in version 20.1.0, and the *attrs* package import name that has been added in version 21.3.0. The classic APIs (`@attr.s`, `attr.ib`, plus their serious-business aliases) and the `attr` package import name will remain **indefinitely**. Please check out [*On The Core API Names*](https://www.attrs.org/en/latest/names.html) for a more in-depth explanation. ## Data Classes On the tin, *attrs* might remind you of `dataclasses` (and indeed, `dataclasses` [are a descendant](https://hynek.me/articles/import-attrs/) of *attrs*). In practice it does a lot more and is more flexible. For instance it allows you to define [special handling of NumPy arrays for equality checks](https://www.attrs.org/en/stable/comparison.html#customization), or allows more ways to [plug into the initialization process](https://www.attrs.org/en/stable/init.html#hooking-yourself-into-initialization). For more details, please refer to our [comparison page](https://www.attrs.org/en/stable/why.html#data-classes). ## Project Information - [**Changelog**](https://www.attrs.org/en/stable/changelog.html) - [**Documentation**](https://www.attrs.org/) - [**PyPI**](https://pypi.org/project/attrs/) - [**Source Code**](https://github.com/python-attrs/attrs) - [**Contributing**](https://github.com/python-attrs/attrs/blob/main/.github/CONTRIBUTING.md) - [**Third-party Extensions**](https://github.com/python-attrs/attrs/wiki/Extensions-to-attrs) - **License**: [MIT](https://www.attrs.org/en/latest/license.html) - **Get Help**: please use the `python-attrs` tag on [StackOverflow](https://stackoverflow.com/questions/tagged/python-attrs) - **Supported Python Versions**: 3.7 and later ### *attrs* for Enterprise Available as part of the Tidelift Subscription. The maintainers of *attrs* and thousands of other packages are working with Tidelift to deliver commercial support and maintenance for the open source packages you use to build your applications. Save time, reduce risk, and improve code health, while paying the maintainers of the exact packages you use. [Learn more.](https://tidelift.com/subscription/pkg/pypi-attrs?utm_source=pypi-attrs&utm_medium=referral&utm_campaign=enterprise&utm_term=repo) ## Release Information ### Backwards-incompatible Changes - Python 3.6 has been dropped and packaging switched to static package data using [Hatch](https://hatch.pypa.io/latest/). [#993](https://github.com/python-attrs/attrs/issues/993) ### Deprecations - The support for *zope-interface* via the `attrs.validators.provides` validator is now deprecated and will be removed in, or after, April 2024. The presence of a C-based package in our developement dependencies has caused headaches and we're not under the impression it's used a lot. Let us know if you're using it and we might publish it as a separate package. [#1120](https://github.com/python-attrs/attrs/issues/1120) ### Changes - `attrs.filters.exclude()` and `attrs.filters.include()` now support the passing of attribute names as strings. [#1068](https://github.com/python-attrs/attrs/issues/1068) - `attrs.has()` and `attrs.fields()` now handle generic classes correctly. [#1079](https://github.com/python-attrs/attrs/issues/1079) - Fix frozen exception classes when raised within e.g. `contextlib.contextmanager`, which mutates their `__traceback__` attributes. [#1081](https://github.com/python-attrs/attrs/issues/1081) - `@frozen` now works with type checkers that implement [PEP-681](https://peps.python.org/pep-0681/) (ex. [pyright](https://github.com/microsoft/pyright/)). [#1084](https://github.com/python-attrs/attrs/issues/1084) - Restored ability to unpickle instances pickled before 22.2.0. [#1085](https://github.com/python-attrs/attrs/issues/1085) - `attrs.asdict()`'s and `attrs.astuple()`'s type stubs now accept the `attrs.AttrsInstance` protocol. [#1090](https://github.com/python-attrs/attrs/issues/1090) - Fix slots class cellvar updating closure in CPython 3.8+ even when `__code__` introspection is unavailable. [#1092](https://github.com/python-attrs/attrs/issues/1092) - `attrs.resolve_types()` can now pass `include_extras` to `typing.get_type_hints()` on Python 3.9+, and does so by default. [#1099](https://github.com/python-attrs/attrs/issues/1099) - Added instructions for pull request workflow to `CONTRIBUTING.md`. [#1105](https://github.com/python-attrs/attrs/issues/1105) - Added *type* parameter to `attrs.field()` function for use with `attrs.make_class()`. Please note that type checkers ignore type metadata passed into `make_class()`, but it can be useful if you're wrapping _attrs_. [#1107](https://github.com/python-attrs/attrs/issues/1107) - It is now possible for `attrs.evolve()` (and `attr.evolve()`) to change fields named `inst` if the instance is passed as a positional argument. Passing the instance using the `inst` keyword argument is now deprecated and will be removed in, or after, April 2024. [#1117](https://github.com/python-attrs/attrs/issues/1117) - `attrs.validators.optional()` now also accepts a tuple of validators (in addition to lists of validators). [#1122](https://github.com/python-attrs/attrs/issues/1122) --- [Full changelog](https://www.attrs.org/en/stable/changelog.html)
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/attrs-23.1.0.dist-info
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/attrs-23.1.0.dist-info/licenses/LICENSE
The MIT License (MIT) Copyright (c) 2015 Hynek Schlawack and the attrs contributors Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/fs-2.4.16.dist-info/RECORD
fs-2.4.16.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4 fs-2.4.16.dist-info/LICENSE,sha256=vMH7rh2gcaFdF_12CVGa8RYKPXLGViIEe2Hhm6Y-eA0,1129 fs-2.4.16.dist-info/METADATA,sha256=hi_629MAGfbsWVHAXg7xgBVDp5Fe2e_7nQSUgE3Zu6g,6319 fs-2.4.16.dist-info/RECORD,, fs-2.4.16.dist-info/WHEEL,sha256=z9j0xAa_JmUKMpmz72K0ZGALSM_n-wQVmGbleXx2VHg,110 fs-2.4.16.dist-info/top_level.txt,sha256=387pB38TPn9aMO3b518yxXxgB0uN0XWa1WNbSnES7r8,3 fs/__init__.py,sha256=UY5rNySHg2U2rUFjNRdG8dM1o_-XAe4Dvv7JjVVqrnA,341 fs/__pycache__/__init__.cpython-311.pyc,, fs/__pycache__/_bulk.cpython-311.pyc,, fs/__pycache__/_fscompat.cpython-311.pyc,, fs/__pycache__/_ftp_parse.cpython-311.pyc,, fs/__pycache__/_pathcompat.cpython-311.pyc,, fs/__pycache__/_repr.cpython-311.pyc,, fs/__pycache__/_typing.cpython-311.pyc,, fs/__pycache__/_tzcompat.cpython-311.pyc,, fs/__pycache__/_url_tools.cpython-311.pyc,, fs/__pycache__/_version.cpython-311.pyc,, fs/__pycache__/appfs.cpython-311.pyc,, fs/__pycache__/base.cpython-311.pyc,, fs/__pycache__/compress.cpython-311.pyc,, fs/__pycache__/constants.cpython-311.pyc,, fs/__pycache__/copy.cpython-311.pyc,, fs/__pycache__/enums.cpython-311.pyc,, fs/__pycache__/error_tools.cpython-311.pyc,, fs/__pycache__/errors.cpython-311.pyc,, fs/__pycache__/filesize.cpython-311.pyc,, fs/__pycache__/ftpfs.cpython-311.pyc,, fs/__pycache__/glob.cpython-311.pyc,, fs/__pycache__/info.cpython-311.pyc,, fs/__pycache__/iotools.cpython-311.pyc,, fs/__pycache__/lrucache.cpython-311.pyc,, fs/__pycache__/memoryfs.cpython-311.pyc,, fs/__pycache__/mirror.cpython-311.pyc,, fs/__pycache__/mode.cpython-311.pyc,, fs/__pycache__/mountfs.cpython-311.pyc,, fs/__pycache__/move.cpython-311.pyc,, fs/__pycache__/multifs.cpython-311.pyc,, fs/__pycache__/osfs.cpython-311.pyc,, fs/__pycache__/path.cpython-311.pyc,, fs/__pycache__/permissions.cpython-311.pyc,, fs/__pycache__/subfs.cpython-311.pyc,, fs/__pycache__/tarfs.cpython-311.pyc,, fs/__pycache__/tempfs.cpython-311.pyc,, fs/__pycache__/test.cpython-311.pyc,, fs/__pycache__/time.cpython-311.pyc,, fs/__pycache__/tools.cpython-311.pyc,, fs/__pycache__/tree.cpython-311.pyc,, fs/__pycache__/walk.cpython-311.pyc,, fs/__pycache__/wildcard.cpython-311.pyc,, fs/__pycache__/wrap.cpython-311.pyc,, fs/__pycache__/wrapfs.cpython-311.pyc,, fs/__pycache__/zipfs.cpython-311.pyc,, fs/_bulk.py,sha256=XtYSgk2qizJGKKl4x1otxD3XnMcEE6PqRgdZST53wCk,4667 fs/_fscompat.py,sha256=Fxvc3ZoST_J6H7seddXKLVtGlyBf8WGormrC29frCYM,1464 fs/_ftp_parse.py,sha256=2gZkyd3xSEWLE-H8pLafmkD0-MGiqbV5OQa00tmIHKM,5098 fs/_pathcompat.py,sha256=Q_th--LrjauaGYG7GUaeqjIhgmzl20gHE9Xe5WHLmQU,1309 fs/_repr.py,sha256=EpJx867Zp0fFkWK8XLLxRp6KV4HEtLfjIuPa4ZM31QM,1211 fs/_typing.py,sha256=IyggqnvIrB5lH36ZBpcxBqNEuj5UZrQBPC23b71vxcE,399 fs/_tzcompat.py,sha256=v_SKOfD1QrZRf-zxZBY3UWQfRYRXWJseFeeQbz0RtYg,475 fs/_url_tools.py,sha256=wpBBRF8WfvqTxaRPiK6JExSGdZzRQ5oyZTDQ5rLUjko,1525 fs/_version.py,sha256=dIRMEyWNDVG_T2gS8AHwHxdZbC7GguonD5SzgZd53UI,68 fs/appfs.py,sha256=442susUjx5RD_KNW-6nIf8tGwO52XGCArxmJBDFsC4o,4335 fs/base.py,sha256=7uDCkCxf88z3t627syT3E0MRT7fzGUNjIxi2u0Sb90s,60733 fs/compress.py,sha256=MJ-6QZ_qPHRBXB2do5ix78rZN6JuZ2nfjw78QCU4YWg,7048 fs/constants.py,sha256=udf87CNeWsH6B2yu67SA3AJOWWTVg7AKviMugJdTMfU,173 fs/copy.py,sha256=Z8hYEM0awizrFfqmMg6QOZvm8n1fzT0i7tpVeK8VlWc,18030 fs/enums.py,sha256=9hUMSPMYQso5NSnsbzxTCJ8RvBJ8m5trh9zwN0hZ9iY,1230 fs/error_tools.py,sha256=Y3OHazmGUt2B6jBnr8E4q93sGsF1yOmL2jtAS6fF_gY,3824 fs/errors.py,sha256=HxqGer6lLuBTn-EqwrbB4tvgUaSdhl0xMf4sRGZNozM,9218 fs/filesize.py,sha256=pYU27O66dbLhl5sP5gFIcZ72cYCvZc8BwFMK6Rncy5E,3495 fs/ftpfs.py,sha256=0BFx44yW9U7D4UrR3YGOYf3_xhrUiCJd9rrziI2X5i4,30138 fs/glob.py,sha256=yOipQc4dGBZE8XrNayVmJsrhBhLpm8q6niXE9TvWIQ4,8528 fs/info.py,sha256=oeGNGZkAKtTqTZs3OE-c66a-ibhsLFeCqRqJumq-qeo,13457 fs/iotools.py,sha256=PpgjoWB1l_IBvecgOSCXrI9RC6RQIQ1StbZEgne4Vuk,6575 fs/lrucache.py,sha256=MjywSsOJhaQDSD41gCJTCR4GJmT2vg-GnlSF0IvpnKg,1303 fs/memoryfs.py,sha256=1q1apvH51-9UFN92oA1dMl00rUYX-jBhtEqrcz19vco,21516 fs/mirror.py,sha256=JzgJNTVQpFcemxJ0ZvQ6uw5S163PsLzaxTzRodYUoQ4,5363 fs/mode.py,sha256=uGBq2UkIwBkF8ACFeUOgwppAeKcddgsrb8VpucQ_bsY,6220 fs/mountfs.py,sha256=6SxJrJYQ-FmCn4rAwgcepbzx053AKM79ey0PdkPdz_4,9492 fs/move.py,sha256=0ul7CC9IthCragPOItYoqpyASrtS-PKoJZo5YQAaCNQ,5424 fs/multifs.py,sha256=BAyDOrblQ9DqI2II8U-gTW8IxV6hJNOlMZxrXTsfcG0,13183 fs/opener/__init__.py,sha256=CiGRJ8YeqYrcaWJCUA3RpLQUHz8kuJ31_4y2XroV2yE,686 fs/opener/__pycache__/__init__.cpython-311.pyc,, fs/opener/__pycache__/appfs.cpython-311.pyc,, fs/opener/__pycache__/base.cpython-311.pyc,, fs/opener/__pycache__/errors.cpython-311.pyc,, fs/opener/__pycache__/ftpfs.cpython-311.pyc,, fs/opener/__pycache__/memoryfs.cpython-311.pyc,, fs/opener/__pycache__/osfs.cpython-311.pyc,, fs/opener/__pycache__/parse.cpython-311.pyc,, fs/opener/__pycache__/registry.cpython-311.pyc,, fs/opener/__pycache__/tarfs.cpython-311.pyc,, fs/opener/__pycache__/tempfs.cpython-311.pyc,, fs/opener/__pycache__/zipfs.cpython-311.pyc,, fs/opener/appfs.py,sha256=R_sDIkrAlKeNoeALXlJ6Kg3OT7FU3lVz90P2x9f-_Xs,2059 fs/opener/base.py,sha256=Fj1zxewyLda8kNXszOynIK6BrnsexnGcBt-sAN8M6Oc,1522 fs/opener/errors.py,sha256=QmYeBQ0KF8MX_ZAMsf31hukIzfKGDjMxEZmyyTo1WHo,494 fs/opener/ftpfs.py,sha256=TBi1FesuHxSDFizZ_7ib4tw9hBFwrnvuq0rEkb1djII,1597 fs/opener/memoryfs.py,sha256=p380NRnVmByjFvKkemCCYZdJLCnHL-nY1jxoxvTlzGg,765 fs/opener/osfs.py,sha256=yt64nPTu-SRdCBQB7Fzcya5bOEQUZZW_r5FUzR1llfU,924 fs/opener/parse.py,sha256=U9rQsd13nsQG9DVuGA9pnh8IVOT3fyYgE0Uac9b64kE,2322 fs/opener/registry.py,sha256=-BXeD8kWnbA50WI8Bt_dJR16dXxhqAsdQd5xEXRAkiM,9862 fs/opener/tarfs.py,sha256=35vQjlojTTZWhdilvgblbS35R40-GC9REFlLeW3LbEA,925 fs/opener/tempfs.py,sha256=33NnT9ORX8J8p2k17-9b0BXuIU7d6mLeKqWp9qaUuUs,785 fs/opener/zipfs.py,sha256=ZoTv-O58b7AJ2Re-_RKp1ujSjgMokDISPf7ZmHyg7Tg,925 fs/osfs.py,sha256=NCfDtgzj83R9oGMlLJrNmKwv-zfDtdGKHuoTB__t_64,25958 fs/path.py,sha256=3z-RxgZwT1DtAzhZNIz5I7-2yQEz2LBkkVWFRycrX_M,13411 fs/permissions.py,sha256=wphOsYMhheBvRwHLQqlT7S3s42beMTrTn3WmEUNsPPg,9817 fs/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0 fs/subfs.py,sha256=VmSsHeq7OQ5a9c2ZcLrn6zHTNov5FPaFtc6VeO1EMQ0,1654 fs/tarfs.py,sha256=JeU8YAP4R25wfn4v4npgs4wNmfSS5y0usmSeWkqCRkc,15498 fs/tempfs.py,sha256=qLWuNok5ERea6IvSAe83LmO-Cyj46RLGKnu5apmhU1w,4291 fs/test.py,sha256=D03g6MGWVCRmI1J6VLDoR8YkSJUhktOaauPexmb6mWI,74085 fs/time.py,sha256=NZ72ytSJY3YmBau9Lf8BgmerS55xFonYPPj1mSDAbu0,870 fs/tools.py,sha256=KIJFk1Hf98cAVeeSsPaI7BEU65eUkCQDPSl9XZLseVQ,2714 fs/tree.py,sha256=a_RACARMH0v7kJGt2QikuiZSlbae3fhzeBYeYALH1Q4,5656 fs/walk.py,sha256=6g9IwmdtujZr0Fcgy8gl-12hweIqKH1huJjya0Wn1WU,27477 fs/wildcard.py,sha256=NeT6QGDBNLSUptuY-MZHniKdHw-UKePb_8KCeINimRQ,4976 fs/wrap.py,sha256=QStQ9pxmlZgV2Nf1ypqY5LPAT8-WDYTmRT9MtFv1DkY,9847 fs/wrapfs.py,sha256=BOxoQt6woepLE5OmeeDccXMnurw84xPEmFu3UlgfYg4,17457 fs/zipfs.py,sha256=eeBXyn_sS4BmZ_8VW-5_o6DhLkJeaPP9PgWFbPK3oYg,17756
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/fs-2.4.16.dist-info/LICENSE
MIT License Copyright (c) 2017-2021 The PyFilesystem2 contributors Copyright (c) 2016-2019 Will McGugan Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/fs-2.4.16.dist-info/WHEEL
Wheel-Version: 1.0 Generator: bdist_wheel (0.37.1) Root-Is-Purelib: true Tag: py2-none-any Tag: py3-none-any
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/fs-2.4.16.dist-info/top_level.txt
fs
0
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages
/Users/nchebolu/work/raptor/taps/tap-okta/.meltano/extractors/tap-okta/venv/lib/python3.11/site-packages/fs-2.4.16.dist-info/INSTALLER
pip
0