shell bypass 403
UnknownSec Shell
:
/
lib
/
python3
/
dist-packages
/
redis
/
commands
/
bf
/
__pycache__
/ [
drwxr-xr-x
]
upload
mass deface
mass delete
console
info server
name :
commands.cpython-312.pyc
� ���b�G � �8 � d dl mZ d dlmZ d dlmZ dZdZdZdZ dZ d Z d Z d Z d Zd ZdZdZdZdZdZdZdZdZdZdZdZdZdZ dZ d Z d Z d Z d Z!d Z"d!Z#d"Z$d#Z%d$Z&d%Z'd&Z(d'Z)d(Z*d)Z+d*Z,d+Z-d,Z.d-Z/d.Z0 G d/� d0� Z1 G d1� d2� Z2 G d3� d4� Z3 G d5� d6� Z4 G d7� d8� Z5y9):� )� NEVER_DECODE)� ModuleError)�HIREDIS_AVAILABLEz BF.RESERVEzBF.ADDzBF.MADDz BF.INSERTz BF.EXISTSz BF.MEXISTSz BF.SCANDUMPz BF.LOADCHUNKzBF.INFOz CF.RESERVEzCF.ADDzCF.ADDNXz CF.INSERTz CF.INSERTNXz CF.EXISTSz CF.MEXISTSzCF.DELzCF.COUNTz CF.SCANDUMPz CF.LOADCHUNKzCF.INFOz CMS.INITBYDIMzCMS.INITBYPROBz CMS.INCRBYz CMS.QUERYz CMS.MERGEzCMS.INFOz TOPK.RESERVEzTOPK.ADDz TOPK.INCRBYz TOPK.QUERYz TOPK.COUNTz TOPK.LISTz TOPK.INFOzTDIGEST.CREATEz TDIGEST.RESETz TDIGEST.ADDz TDIGEST.MERGEz TDIGEST.CDFzTDIGEST.QUANTILEz TDIGEST.MINz TDIGEST.MAXz TDIGEST.INFOc �T � e Zd ZdZd d�Zd� Zd� Z d d�Zd� Zd� Z d � Z d � Z d � Z y)� BFCommandszBloom Filter commands.Nc � � |||g}| j ||� | j ||� | j t g|��� S )aA Create a new Bloom Filter `key` with desired probability of false positives `errorRate` expected entries to be inserted as `capacity`. Default expansion value is 2. By default, filter is auto-scaling. For more information see `BF.RESERVE <https://redis.io/commands/bf.reserve>`_. )�append_expansion�append_no_scale�execute_command� BF_RESERVE)�self�key� errorRate�capacity� expansion�noScale�paramss �</usr/lib/python3/dist-packages/redis/commands/bf/commands.py�createzBFCommands.create: sH � � �y�(�+�� � � �f�i�0� � � �V�W�-�#�t�#�#�J�8��8�8� c �0 � | j t ||� S )z� Add to a Bloom Filter `key` an `item`. For more information see `BF.ADD <https://redis.io/commands/bf.add>`_. )r �BF_ADD�r r �items r �addzBFCommands.addF � � � �#�#�F�C��6�6r c �2 � | j t |g|��� S )z� Add to a Bloom Filter `key` multiple `items`. For more information see `BF.MADD <https://redis.io/commands/bf.madd>`_. )r �BF_MADD�r r �itemss r �maddzBFCommands.maddM s � � $�t�#�#�G�S�9�5�9�9r c � � |g}| j ||� | j ||� | j ||� | j ||� | j ||� | j ||� | j t g|��� S )as Add to a Bloom Filter `key` multiple `items`. If `nocreate` remain `None` and `key` does not exist, a new Bloom Filter `key` will be created with desired probability of false positives `errorRate` and expected entries to be inserted as `size`. For more information see `BF.INSERT <https://redis.io/commands/bf.insert>`_. )�append_capacity� append_errorr �append_no_creater � append_itemsr � BF_INSERT) r r r r �error�noCreater r r s r �insertzBFCommands.insertT s� � �$ ��� � � �V�X�.� ���&�%�(� � � �f�i�0� � � �f�h�/� � � �V�W�-� ���&�%�(�#�t�#�#�I�7��7�7r c �0 � | j t ||� S )z� Check whether an `item` exists in Bloom Filter `key`. For more information see `BF.EXISTS <https://redis.io/commands/bf.exists>`_. )r � BF_EXISTSr s r �existszBFCommands.existsp � � � �#�#�I�s�D�9�9r c �2 � | j t |g|��� S )z� Check whether `items` exist in Bloom Filter `key`. For more information see `BF.MEXISTS <https://redis.io/commands/bf.mexists>`_. )r � BF_MEXISTSr s r �mexistszBFCommands.mexistsw � � � $�t�#�#�J��<�e�<�<r c �v � t r t d� �||g}i }g |t < | j t g|��i |��S )a� Begin an incremental save of the bloom filter `key`. This is useful for large bloom filters which cannot fit into the normal SAVE and RESTORE model. The first time this command is called, the value of `iter` should be 0. This command will return successive (iter, data) pairs until (0, NULL) to indicate completion. For more information see `BF.SCANDUMP <https://redis.io/commands/bf.scandump>`_. z6This command cannot be used when hiredis is available.)r r r r � BF_SCANDUMP)r r �iterr �optionss r �scandumpzBFCommands.scandump~ sH � � � � V�W� W��t����� "�� � �#�t�#�#�K�D�&�D�G�D�Dr c �2 � | j t |||� S )ai Restore a filter previously saved using SCANDUMP. See the SCANDUMP command for example usage. This command will overwrite any bloom filter stored under key. Ensure that the bloom filter will not be modified between invocations. For more information see `BF.LOADCHUNK <https://redis.io/commands/bf.loadchunk>`_. )r � BF_LOADCHUNK�r r r5 �datas r � loadchunkzBFCommands.loadchunk� s � � �#�#�L�#�t�T�B�Br c �. � | j t |� S )z� Return capacity, size, number of filters, number of items inserted, and expansion rate. For more information see `BF.INFO <https://redis.io/commands/bf.info>`_. )r �BF_INFO�r r s r �infozBFCommands.info� s � � �#�#�G�S�1�1r �NN)NNNNN) �__name__� __module__� __qualname__�__doc__r r r! r* r- r1 r7 r< r@ � r r r r 6 sE � � � 9�7�:� �����8�8:�=�E�" C�2r r c �` � e Zd ZdZ dd�Zd� Zd� Zdd�Zdd�Zd� Z d � Z d � Z d � Z d � Z d � Zd� Zy)� CFCommandszCuckoo Filter commands.Nc � � ||g}| j ||� | j ||� | j ||� | j t g|��� S )z� Create a new Cuckoo Filter `key` an initial `capacity` items. For more information see `CF.RESERVE <https://redis.io/commands/cf.reserve>`_. )r �append_bucket_size�append_max_iterationsr � CF_RESERVE)r r r r � bucket_size�max_iterationsr s r r zCFCommands.create� sU � � �x� �� � � �f�i�0� � � �� �4� �"�"�6�>�:�#�t�#�#�J�8��8�8r c �0 � | j t ||� S )z� Add an `item` to a Cuckoo Filter `key`. For more information see `CF.ADD <https://redis.io/commands/cf.add>`_. )r �CF_ADDr s r r zCFCommands.add� r r c �0 � | j t ||� S )z� Add an `item` to a Cuckoo Filter `key` only if item does not yet exist. Command might be slower that `add`. For more information see `CF.ADDNX <https://redis.io/commands/cf.addnx>`_. )r �CF_ADDNXr s r �addnxzCFCommands.addnx� s � � �#�#�H�c�4�8�8r c � � |g}| j ||� | j ||� | j ||� | j t g|��� S )a Add multiple `items` to a Cuckoo Filter `key`, allowing the filter to be created with a custom `capacity` if it does not yet exist. `items` must be provided as a list. For more information see `CF.INSERT <https://redis.io/commands/cf.insert>`_. )r# r% r& r � CF_INSERT�r r r r �nocreater s r r* zCFCommands.insert� sS � � ��� � � �V�X�.� � � �f�h�/� ���&�%�(�#�t�#�#�I�7��7�7r c � � |g}| j ||� | j ||� | j ||� | j t g|��� S )a@ Add multiple `items` to a Cuckoo Filter `key` only if they do not exist yet, allowing the filter to be created with a custom `capacity` if it does not yet exist. `items` must be provided as a list. For more information see `CF.INSERTNX <https://redis.io/commands/cf.insertnx>`_. )r# r% r& r � CF_INSERTNXrV s r �insertnxzCFCommands.insertnx� sS � � ��� � � �V�X�.� � � �f�h�/� ���&�%�(�#�t�#�#�K�9�&�9�9r c �0 � | j t ||� S )z� Check whether an `item` exists in Cuckoo Filter `key`. For more information see `CF.EXISTS <https://redis.io/commands/cf.exists>`_. )r � CF_EXISTSr s r r- zCFCommands.exists� r. r c �2 � | j t |g|��� S )z� Check whether an `items` exist in Cuckoo Filter `key`. For more information see `CF.MEXISTS <https://redis.io/commands/cf.mexists>`_. )r � CF_MEXISTSr s r r1 zCFCommands.mexists� r2 r c �0 � | j t ||� S )zz Delete `item` from `key`. For more information see `CF.DEL <https://redis.io/commands/cf.del>`_. )r �CF_DELr s r �deletezCFCommands.delete� r r c �0 � | j t ||� S )z� Return the number of times an `item` may be in the `key`. For more information see `CF.COUNT <https://redis.io/commands/cf.count>`_. )r �CF_COUNTr s r �countzCFCommands.count� s � � �#�#�H�c�4�8�8r c �0 � | j t ||� S )a� Begin an incremental save of the Cuckoo filter `key`. This is useful for large Cuckoo filters which cannot fit into the normal SAVE and RESTORE model. The first time this command is called, the value of `iter` should be 0. This command will return successive (iter, data) pairs until (0, NULL) to indicate completion. For more information see `CF.SCANDUMP <https://redis.io/commands/cf.scandump>`_. )r � CF_SCANDUMP)r r r5 s r r7 zCFCommands.scandump� s � � �#�#�K��d�;�;r c �2 � | j t |||� S )ac Restore a filter previously saved using SCANDUMP. See the SCANDUMP command for example usage. This command will overwrite any Cuckoo filter stored under key. Ensure that the Cuckoo filter will not be modified between invocations. For more information see `CF.LOADCHUNK <https://redis.io/commands/cf.loadchunk>`_. )r � CF_LOADCHUNKr: s r r< zCFCommands.loadchunk s � � �#�#�L�#�t�T�B�Br c �. � | j t |� S )z� Return size, number of buckets, number of filter, number of items inserted, number of items deleted, bucket size, expansion rate, and max iteration. For more information see `CF.INFO <https://redis.io/commands/cf.info>`_. )r �CF_INFOr? s r r@ zCFCommands.info s � � �#�#�G�S�1�1r )NNNrA )rB rC rD rE r r rS r* rZ r- r1 ra rd r7 r< r@ rF r r rH rH � sI � �!� OS� 9�7�9� 8� :�:�=�7�9� <�C�2r rH c �< � e Zd ZdZd� Zd� Zd� Zd� Zd� Zd d�Z d� Z y ) � TOPKCommandszTOP-k Filter commands.c �6 � | j t |||||� S )z� Create a new Top-K Filter `key` with desired probability of false positives `errorRate` expected entries to be inserted as `size`. For more information see `TOPK.RESERVE <https://redis.io/commands/topk.reserve>`_. )r � TOPK_RESERVE)r r �k�width�depth�decays r �reservezTOPKCommands.reserve s � � �#�#�L�#�q�%���N�Nr c �2 � | j t |g|��� S )z� Add one `item` or more to a Top-K Filter `key`. For more information see `TOPK.ADD <https://redis.io/commands/topk.add>`_. )r �TOPK_ADDr s r r zTOPKCommands.add# s � � $�t�#�#�H�c�:�E�:�:r c �\ � |g}| j |||� | j t g|��� S )a Add/increase `items` to a Top-K Sketch `key` by ''increments''. Both `items` and `increments` are lists. For more information see `TOPK.INCRBY <https://redis.io/commands/topk.incrby>`_. Example: >>> topkincrby('A', ['foo'], [1]) )�append_items_and_incrementsr � TOPK_INCRBY�r r r � incrementsr s r �incrbyzTOPKCommands.incrby* s5 � � ��� �(�(��� �C�#�t�#�#�K�9�&�9�9r c �2 � | j t |g|��� S )z� Check whether one `item` or more is a Top-K item at `key`. For more information see `TOPK.QUERY <https://redis.io/commands/topk.query>`_. )r � TOPK_QUERYr s r �queryzTOPKCommands.query8 r2 r c �2 � | j t |g|��� S )z� Return count for one `item` or more from `key`. For more information see `TOPK.COUNT <https://redis.io/commands/topk.count>`_. )r � TOPK_COUNTr s r rd zTOPKCommands.count? r2 r c �\ � |g}|r|j d� | j t g|��� S )a Return full list of items in Top-K list of `key`. If `withcount` set to True, return full list of items with probabilistic count in Top-K list of `key`. For more information see `TOPK.LIST <https://redis.io/commands/topk.list>`_. � WITHCOUNT)�appendr � TOPK_LIST)r r � withcountr s r �listzTOPKCommands.listF s2 � � ��� � �M�M�+� &�#�t�#�#�I�7��7�7r c �. � | j t |� S )z� Return k, width, depth and decay values of `key`. For more information see `TOPK.INFO <https://redis.io/commands/topk.info>`_. )r � TOPK_INFOr? s r r@ zTOPKCommands.infoR s � � �#�#�I�s�3�3r N)F) rB rC rD rE rs r r{ r~ rd r� r@ rF r r rl rl s) � � �O�;� :� =�=� 8�4r rl c �B � e Zd Zd� Zd� Zd� Zd� Zd� Zd� Zd� Z d� Z d � Z y ) �TDigestCommandsc �0 � | j t ||� S )z� Allocate the memory and initialize the t-digest. For more information see `TDIGEST.CREATE <https://redis.io/commands/tdigest.create>`_. )r �TDIGEST_CREATE)r r � compressions r r zTDigestCommands.create[ s � � �#�#�N�C��E�Er c �. � | j t |� S )z� Reset the sketch `key` to zero - empty out the sketch and re-initialize it. For more information see `TDIGEST.RESET <https://redis.io/commands/tdigest.reset>`_. )r � TDIGEST_RESETr? s r �resetzTDigestCommands.resetb s � � �#�#�M�3�7�7r c �\ � |g}| j |||� | j t g|��� S )a Add one or more samples (value with weight) to a sketch `key`. Both `values` and `weights` are lists. For more information see `TDIGEST.ADD <https://redis.io/commands/tdigest.add>`_. Example: >>> tdigestadd('A', [1500.0], [1.0]) )�append_values_and_weightsr � TDIGEST_ADD)r r �values�weightsr s r r zTDigestCommands.addi s5 � � ��� �&�&�v�v�w�?�#�t�#�#�K�9�&�9�9r c �0 � | j t ||� S )z� Merge all of the values from 'fromKey' to 'toKey' sketch. For more information see `TDIGEST.MERGE <https://redis.io/commands/tdigest.merge>`_. )r � TDIGEST_MERGE)r �toKey�fromKeys r �mergezTDigestCommands.mergew s � � �#�#�M�5�'�B�Br c �. � | j t |� S )z� Return minimum value from the sketch `key`. Will return DBL_MAX if the sketch is empty. For more information see `TDIGEST.MIN <https://redis.io/commands/tdigest.min>`_. )r � TDIGEST_MINr? s r �minzTDigestCommands.min~ � � � �#�#�K��5�5r c �. � | j t |� S )z� Return maximum value from the sketch `key`. Will return DBL_MIN if the sketch is empty. For more information see `TDIGEST.MAX <https://redis.io/commands/tdigest.max>`_. )r � TDIGEST_MAXr? s r �maxzTDigestCommands.max� r� r c �0 � | j t ||� S )a Return double value estimate of the cutoff such that a specified fraction of the data added to this TDigest would be less than or equal to the cutoff. For more information see `TDIGEST.QUANTILE <https://redis.io/commands/tdigest.quantile>`_. )r �TDIGEST_QUANTILE)r r �quantiles r r� zTDigestCommands.quantile� s � � �#�#�$4�c�8�D�Dr c �0 � | j t ||� S )z� Return double fraction of all points added which are <= value. For more information see `TDIGEST.CDF <https://redis.io/commands/tdigest.cdf>`_. )r � TDIGEST_CDF)r r �values r �cdfzTDigestCommands.cdf� s � � �#�#�K��e�<�<r c �. � | j t |� S )z� Return Compression, Capacity, Merged Nodes, Unmerged Nodes, Merged Weight, Unmerged Weight and Total Compressions. For more information see `TDIGEST.INFO <https://redis.io/commands/tdigest.info>`_. )r � TDIGEST_INFOr? s r r@ zTDigestCommands.info� s � � �#�#�L�#�6�6r N) rB rC rD r r� r r� r� r� r� r� r@ rF r r r� r� Z s2 � �F�8� :� C�6�6�E�=�7r r� c �8 � e Zd ZdZd� Zd� Zd� Zd� Zg fd�Zd� Z y) � CMSCommandszCount-Min Sketch Commandsc �2 � | j t |||� S )z� Initialize a Count-Min Sketch `key` to dimensions (`width`, `depth`) specified by user. For more information see `CMS.INITBYDIM <https://redis.io/commands/cms.initbydim>`_. )r � CMS_INITBYDIM)r r rp rq s r � initbydimzCMSCommands.initbydim� s � � �#�#�M�3��u�E�Er c �2 � | j t |||� S )z� Initialize a Count-Min Sketch `key` to characteristics (`error`, `probability`) specified by user. For more information see `CMS.INITBYPROB <https://redis.io/commands/cms.initbyprob>`_. )r �CMS_INITBYPROB)r r r( � probabilitys r � initbyprobzCMSCommands.initbyprob� s � � �#�#�N�C�� �L�Lr c �\ � |g}| j |||� | j t g|��� S )a Add/increase `items` to a Count-Min Sketch `key` by ''increments''. Both `items` and `increments` are lists. For more information see `CMS.INCRBY <https://redis.io/commands/cms.incrby>`_. Example: >>> cmsincrby('A', ['foo'], [1]) )rw r � CMS_INCRBYry s r r{ zCMSCommands.incrby� s5 � � ��� �(�(��� �C�#�t�#�#�J�8��8�8r c �2 � | j t |g|��� S )z� Return count for an `item` from `key`. Multiple items can be queried with one call. For more information see `CMS.QUERY <https://redis.io/commands/cms.query>`_. )r � CMS_QUERYr s r r~ zCMSCommands.query� s � � $�t�#�#�I�s�;�U�;�;r c �f � ||g}||z }| j ||� | j t g|��� S )an Merge `numKeys` of sketches into `destKey`. Sketches specified in `srcKeys`. All sketches must have identical width and depth. `Weights` can be used to multiply certain sketches. Default weight is 1. Both `srcKeys` and `weights` are lists. For more information see `CMS.MERGE <https://redis.io/commands/cms.merge>`_. )�append_weightsr � CMS_MERGE)r �destKey�numKeys�srcKeysr� r s r r� zCMSCommands.merge� s@ � � �7�#���'��� ���F�G�,�#�t�#�#�I�7��7�7r c �. � | j t |� S )z� Return width, depth and total count of the sketch. For more information see `CMS.INFO <https://redis.io/commands/cms.info>`_. )r �CMS_INFOr? s r r@ zCMSCommands.info� s � � �#�#�H�c�2�2r N) rB rC rD rE r� r� r{ r~ r� r@ rF r r r� r� � s* � �#�F�M� 9� <� 8:� 8�3r r� N)6� redis.clientr �redis.exceptionsr � redis.utilsr r r r r' r, r0 r4 r9 r> rL rP rR rU rY r\ r^ r` rc rf rh rj r� r� r� r� r� r� rn ru rx r} r� r� r� r� r� r� r� r� r� r� r� r� r rH rl r� r� rF r r �<module>r� s" �� %� (� )� � � �� �� � � � � � �� � � � �� � � �� �� � �� � � � � � �� ��� � � � �� � �!�� � � � � � � �� � � ��� � � � � � � � � �!�� � �� � � �� �%� �� �� � � �i2� i2�Xs2� s2�l?4� ?4�DG7� G7�T93� 93r
© 2026 UnknownSec