semvec/pypi-packages huggingface dataset:
gg8lib 1.1.6
A small package containing: Progress Bars, Selection Prompts, String Selection and more! Use gg8lib.interactive_help() for a better understanding.
Requires Python: >=3.8

# GloriousGlider8/gg8lib

A small package containing: Progress Bars, Selection Prompts, String Selection and more!

Use `gg8lib.interactive_help()` for a better understanding.

**Status**

### ![gg8lib Status](https://gloriousglider8.github.io/res/stat/security/gg8lib) Security

Check [GitHub](https://gloriousglider8.github.io/gg8lib "GitHub") for more info
sortedmultiset 1.1.1
A sorted multiset which is similar to multiset of cpp so can developers access,delete,search elements in O(log n) time which can make job easy.Helpful for coders.
Requires Python: >=3.0.0
Keywords: python,multiset

# Example Package

User Guide
[GitHub-flavored Markdown](https://github.com/rishiko/sortedmultiset/blob/main/User%20Guide)

1)A orderdmultiset is a module which has same behavior like cpp multiset.



2)it is most important for cosing community which help to grow python in coding community.

3)it has various functions like appending an element, erasing an element,searching an element,
poping out an element from left and poopoing out an element from right all operations done in O(log n) times.

4)we can make a ascending multiset as well as descending multiset via providing a parameter in object reverse=True for descending.

- How to create multiset :-->
    For asceding multiset:->
        var_name=sortedmultiset.sortedmultiset(reverse=False)#--->To create an object of ascending sorted multiset .
        -reverse=False is optional for ascending multiset it is bydefault parameter.
    For descending multiset:->
        var_name=sortedmultiset.sortedmultiset(reverse=True)#--->To create an object of descending sorted multiset.
        -reverse=True is required while creating descending multiset.
-Functions :-->
    var_name.append(element:int)#---> To add an element in  O(log n).
    var_name.search(element:int)#--->To search an element in O(log n).
    var_name.erase(element:int)#--->To delete an element in O(log n).
    var_name.popleft()#--------> To delete the First/Leftmost most element in O(log n).
    var_name.popright()#--------> To delete the Last/Rightmost most element in O(log n).

-To access all the stored elements u can use following syntax:-->
    var_name.multiset---> A list where all the element are stored.
orderdmultiset 0.1.2
A sorted multiset which is similar to multiset of cpp so can developers access,delete,search elements in O(log n) time which can make job easy.Helpful for coders.
Requires Python: >=3.0.0
Keywords: python,multiset

# Example Package

This is a simple example package. You can use
[GitHub-flavored Markdown](https://github.com/rishiko/sortedmultiset/blob/main/User%20Guide)
to write your content.
dingtalk-api 0.0.4
钉钉服务端 API
Requires Python: >=3.7

# 钉钉服务端 API

## 特点

- 兼容新旧 SDK
- 采用与官方文档相同的组织结构
- 丰富的注释和类型标注
- Pydantic 集成

## 安装

```shell
pip install dingtalk-api
```

## 使用

```python
from dingtalk_api import ApiClient

client = ApiClient(
    CLIENT_ID,
    CLIENT_SECRET,
)

# 查询用户详情 旧版SDK
resp = client.contact.user.queryDetails(userid)
print(resp.model_dump())

# 下载机器人接收消息的文件内容 新版SDK
resp = client.im.robot.downloadMessageFiles(downloadCode, ROBOT_CODE)
print(resp.model_dump())
```