Commit
·
a6e5360
1
Parent(s):
8c2ec13
Update parquet files (step 61 of 121)
Browse filesThis view is limited to 50 files because it contains too many changes.
See raw diff
- spaces/101-5/gpt4free/README.md +0 -348
- spaces/101-5/gpt4free/g4f/.v1/testing/aiassistest.py +0 -13
- spaces/123Kumar/vits-uma-genshin-honkai123/models.py +0 -534
- spaces/1acneusushi/gradio-2dmoleculeeditor/data/Full Version Bandicam Free Download The Ultimate Guide to Screen Recording.md +0 -47
- spaces/1gistliPinn/ChatGPT4/Examples/Deadliest Catch Alaskan Storm English PCDVD 2Lions-Team Game Download VERIFIED.md +0 -19
- spaces/1gistliPinn/ChatGPT4/Examples/Elements Of Astro Mechanics Van De Kamp Pdf 19 PORTABLE.md +0 -8
- spaces/1pelhydcardo/ChatGPT-prompt-generator/Aterriza-Como-Puedas-2-Hd-Rip-720p.md +0 -66
- spaces/1pelhydcardo/ChatGPT-prompt-generator/assets/Bingo Player APK Reproduce cualquier formato de vdeo con este reproductor.md +0 -114
- spaces/1phancelerku/anime-remove-background/Dernire mise a jour APK de Clash of Clans tout ce quil faut savoir.md +0 -138
- spaces/1phancelerku/anime-remove-background/FIFA Mobile Para Hilesi APK - Futbol Oyununda Snrsz Kaynaklara Sahip Olun.md +0 -132
- spaces/AIGText/GlyphControl/cldm/hack.py +0 -111
- spaces/AIWaves/SOP_Generation-single/single_prompts.py +0 -396
- spaces/Abdul09/bingo_demo/README.md +0 -12
- spaces/Abdul09/bingo_demo/app.py +0 -34
- spaces/AgentVerse/agentVerse/ui/src/index.ts +0 -79
- spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/plugins/colorreplacepipeline.js +0 -2
- spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/templates/ui/colorinput/colorcomponents/Factory.d.ts +0 -5
- spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/templates/ui/colorinput/colorpicker/Factory.d.ts +0 -5
- spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/templates/ui/gridsizer/GetExpandedChildWidth.js +0 -11
- spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/templates/ui/roundrectangle/Factory.d.ts +0 -16
- spaces/Aki004/herta-so-vits/wav_upload.py +0 -21
- spaces/AlekseyKorshuk/accompaniment-generator/README.md +0 -13
- spaces/Andy1621/uniformer_image_detection/configs/albu_example/mask_rcnn_r50_fpn_albu_1x_coco.py +0 -73
- spaces/Andy1621/uniformer_image_detection/configs/retinanet/retinanet_x101_64x4d_fpn_2x_coco.py +0 -13
- spaces/Anonymous-123/ImageNet-Editing/editing_diffusion/guided_diffusion/guided_diffusion/dist_util.py +0 -93
- spaces/Apex-X/GODROOP/roop/__init__.py +0 -0
- spaces/Artrajz/vits-simple-api/vits/text/sanskrit.py +0 -62
- spaces/Ataturk-Chatbot/HuggingFaceChat/venv/lib/python3.11/site-packages/pkg_resources/_vendor/importlib_resources/__init__.py +0 -36
- spaces/Awiny/Image2Paragraph/models/grit_src/third_party/CenterNet2/configs/common/models/cascade_rcnn.py +0 -36
- spaces/AzumaSeren100/XuanShen-Bert-VITS2/transforms.py +0 -193
- spaces/BG5/midjourney/Dockerfile +0 -34
- spaces/Bakar31/MLOps_Practice_Repo_1/Makefile +0 -22
- spaces/Benson/text-generation/Examples/10mo Boleto Sala De Descarga 2018 Ap.md +0 -94
- spaces/Benson/text-generation/Examples/Bussid Mod.md +0 -66
- spaces/Benson/text-generation/Examples/Cps Refuerzo Apk Blockman Ir.md +0 -101
- spaces/BetterAPI/BetterChat/src/lib/stores/pendingMessage.ts +0 -3
- spaces/Big-Web/MMSD/env/Lib/site-packages/boto3/ec2/createtags.py +0 -40
- spaces/Big-Web/MMSD/env/Lib/site-packages/pip/_internal/commands/install.py +0 -775
- spaces/Big-Web/MMSD/env/Lib/site-packages/pip/_vendor/platformdirs/api.py +0 -179
- spaces/CCaniggia/GPT/README.md +0 -12
- spaces/CVPR/Dual-Key_Backdoor_Attacks/bottom-up-attention-vqa/attention.py +0 -56
- spaces/CVPR/LIVE/thrust/thrust/iterator/detail/minimum_system.h +0 -82
- spaces/CVPR/WALT/mmdet/core/evaluation/recall.py +0 -189
- spaces/Catmeow/Face2Painting_From_Photo/README.md +0 -12
- spaces/ChandraMohanNayal/AutoGPT/autogpt/setup.py +0 -77
- spaces/Cyril666/ContourNet-ABI/maskrcnn_benchmark/config/paths_catalog.py +0 -120
- spaces/DAMO-NLP-SG/Video-LLaMA/video_llama/conversation/__init__.py +0 -0
- spaces/DQChoi/gpt-demo/venv/lib/python3.11/site-packages/PIL/ImtImagePlugin.py +0 -101
- spaces/DQChoi/gpt-demo/venv/lib/python3.11/site-packages/gradio/templates/cdn/assets/Upload-9bb55fba.js +0 -2
- spaces/DQChoi/gpt-demo/venv/lib/python3.11/site-packages/gradio/templates/frontend/assets/linear-58a44b5e.js +0 -2
spaces/101-5/gpt4free/README.md
DELETED
|
@@ -1,348 +0,0 @@
|
|
| 1 |
-
---
|
| 2 |
-
title: gpt4free
|
| 3 |
-
emoji: 💻
|
| 4 |
-
colorFrom: gray
|
| 5 |
-
colorTo: blue
|
| 6 |
-
sdk: gradio
|
| 7 |
-
sdk_version: 3.36.0
|
| 8 |
-
app_file: app.py
|
| 9 |
-
duplicated_from: justest/gpt4free
|
| 10 |
-
---
|
| 11 |
-
|
| 12 |
-
|
| 13 |
-
|
| 14 |
-
By using this repository or any code related to it, you agree to the [legal notice](./LEGAL_NOTICE.md). The author is not responsible for any copies, forks, or reuploads made by other users. This is the author's only account and repository. To prevent impersonation or irresponsible actions, you may comply with the GNU GPL license this Repository uses.
|
| 15 |
-
|
| 16 |
-
This (quite censored) New Version of gpt4free, was just released, it may contain bugs, open an issue or contribute a PR when encountering one, some features were disabled.
|
| 17 |
-
Docker is for now not available but I would be happy if someone contributes a PR. The g4f GUI will be uploaded soon enough.
|
| 18 |
-
|
| 19 |
-
## Table of Contents:
|
| 20 |
-
|
| 21 |
-
- [Getting Started](#getting-started)
|
| 22 |
-
+ [Prerequisites](#prerequisites-)
|
| 23 |
-
+ [Setting up the project](#setting-up-the-project-)
|
| 24 |
-
- [Usage](#usage)
|
| 25 |
-
* [The `g4f` Package](#the--g4f--package)
|
| 26 |
-
* [interference openai-proxy api](#interference-openai-proxy-api--use-with-openai-python-package-)
|
| 27 |
-
- [Models](#models)
|
| 28 |
-
* [gpt-3.5 / gpt-4](#gpt-35---gpt-4)
|
| 29 |
-
* [Other Models](#other-models)
|
| 30 |
-
- [Related gpt4free projects](#related-gpt4free-projects)
|
| 31 |
-
- [Contribute](#contribute)
|
| 32 |
-
- [ChatGPT clone](#chatgpt-clone)
|
| 33 |
-
- [Copyright](#copyright-)
|
| 34 |
-
- [Copyright Notice](#copyright-notice-)
|
| 35 |
-
- [Star History](#star-history)
|
| 36 |
-
|
| 37 |
-
## Getting Started
|
| 38 |
-
|
| 39 |
-
#### Prerequisites:
|
| 40 |
-
1. [Download and install Python](https://www.python.org/downloads/) (Version 3.x is recommended).
|
| 41 |
-
|
| 42 |
-
#### Setting up the project:
|
| 43 |
-
1. Clone the GitHub repository:
|
| 44 |
-
```
|
| 45 |
-
git clone https://github.com/xtekky/gpt4free.git
|
| 46 |
-
```
|
| 47 |
-
2. Navigate to the project directory:
|
| 48 |
-
```
|
| 49 |
-
cd gpt4free
|
| 50 |
-
```
|
| 51 |
-
3. (Recommended) Create a virtual environment to manage Python packages for your project:
|
| 52 |
-
```
|
| 53 |
-
python3 -m venv venv
|
| 54 |
-
```
|
| 55 |
-
4. Activate the virtual environment:
|
| 56 |
-
- On Windows:
|
| 57 |
-
```
|
| 58 |
-
.\venv\Scripts\activate
|
| 59 |
-
```
|
| 60 |
-
- On macOS and Linux:
|
| 61 |
-
```
|
| 62 |
-
source venv/bin/activate
|
| 63 |
-
```
|
| 64 |
-
5. Install the required Python packages from `requirements.txt`:
|
| 65 |
-
```
|
| 66 |
-
pip install -r requirements.txt
|
| 67 |
-
```
|
| 68 |
-
|
| 69 |
-
6. Create a `test.py` file in the root folder and start using the repo, further Instructions are below
|
| 70 |
-
```py
|
| 71 |
-
import g4f
|
| 72 |
-
|
| 73 |
-
...
|
| 74 |
-
```
|
| 75 |
-
|
| 76 |
-
## Usage
|
| 77 |
-
|
| 78 |
-
### The `g4f` Package
|
| 79 |
-
```py
|
| 80 |
-
import g4f
|
| 81 |
-
|
| 82 |
-
|
| 83 |
-
print(g4f.Provider.Ails.params) # supported args
|
| 84 |
-
|
| 85 |
-
# Automatic selection of provider
|
| 86 |
-
|
| 87 |
-
# streamed completion
|
| 88 |
-
response = g4f.ChatCompletion.create(model='gpt-3.5-turbo', messages=[
|
| 89 |
-
{"role": "user", "content": "Hello world"}], stream=True)
|
| 90 |
-
|
| 91 |
-
for message in response:
|
| 92 |
-
print(message)
|
| 93 |
-
|
| 94 |
-
# normal response
|
| 95 |
-
response = g4f.ChatCompletion.create(model=g4f.Model.gpt_4, messages=[
|
| 96 |
-
{"role": "user", "content": "hi"}]) # alterative model setting
|
| 97 |
-
|
| 98 |
-
print(response)
|
| 99 |
-
|
| 100 |
-
|
| 101 |
-
# Set with provider
|
| 102 |
-
response = g4f.ChatCompletion.create(model='gpt-3.5-turbo', provider=g4f.Provider.Forefront, messages=[
|
| 103 |
-
{"role": "user", "content": "Hello world"}], stream=True)
|
| 104 |
-
|
| 105 |
-
for message in response:
|
| 106 |
-
print(message)
|
| 107 |
-
```
|
| 108 |
-
|
| 109 |
-
providers:
|
| 110 |
-
```py
|
| 111 |
-
from g4f.Provider import (
|
| 112 |
-
Ails,
|
| 113 |
-
You,
|
| 114 |
-
Bing,
|
| 115 |
-
Yqcloud,
|
| 116 |
-
Theb,
|
| 117 |
-
Aichat,
|
| 118 |
-
Bard,
|
| 119 |
-
Vercel,
|
| 120 |
-
Forefront,
|
| 121 |
-
Lockchat,
|
| 122 |
-
Liaobots,
|
| 123 |
-
H2o,
|
| 124 |
-
ChatgptLogin,
|
| 125 |
-
DeepAi,
|
| 126 |
-
GetGpt
|
| 127 |
-
)
|
| 128 |
-
|
| 129 |
-
# usage:
|
| 130 |
-
response = g4f.ChatCompletion.create(..., provider=ProviderName)
|
| 131 |
-
```
|
| 132 |
-
|
| 133 |
-
### interference openai-proxy api (use with openai python package)
|
| 134 |
-
|
| 135 |
-
run server:
|
| 136 |
-
```sh
|
| 137 |
-
python3 -m interference.app
|
| 138 |
-
```
|
| 139 |
-
|
| 140 |
-
```py
|
| 141 |
-
import openai
|
| 142 |
-
|
| 143 |
-
openai.api_key = ''
|
| 144 |
-
openai.api_base = 'http://127.0.0.1:1337'
|
| 145 |
-
|
| 146 |
-
chat_completion = openai.ChatCompletion.create(stream=True,
|
| 147 |
-
model='gpt-3.5-turbo', messages=[{'role': 'user', 'content': 'write a poem about a tree'}])
|
| 148 |
-
|
| 149 |
-
#print(chat_completion.choices[0].message.content)
|
| 150 |
-
|
| 151 |
-
for token in chat_completion:
|
| 152 |
-
|
| 153 |
-
content = token['choices'][0]['delta'].get('content')
|
| 154 |
-
if content != None:
|
| 155 |
-
print(content)
|
| 156 |
-
```
|
| 157 |
-
|
| 158 |
-
## Models
|
| 159 |
-
|
| 160 |
-
### gpt-3.5 / gpt-4
|
| 161 |
-
|
| 162 |
-
| Website| Provider| gpt-3.5 | gpt-4 | Streaming | Status | Auth |
|
| 163 |
-
| --- | --- | --- | --- | --- | --- | --- |
|
| 164 |
-
| [bing.com](https://bing.com/chat) | `g4f.Provider.Bing` | ✔️ | ✔️ | ✔️ |  | ❌ |
|
| 165 |
-
| [super.lockchat.app](http://super.lockchat.app) | `g4f.Provider.Lockchat` | ✔️ | ✔️ | ✔️ |  | ❌ |
|
| 166 |
-
| [liaobots.com](https://liaobots.com) | `g4f.Provider.Liaobots` | ✔️ | ✔️ | ✔️ |  | ✔️ |
|
| 167 |
-
| [ai.ls](https://ai.ls) | `g4f.Provider.Ails` | ✔️ | ❌ | ✔️ |  | ❌ |
|
| 168 |
-
| [you.com](https://you.com) | `g4f.Provider.You` | ✔️ | ❌ | ✔️ |  | ❌ |
|
| 169 |
-
| [chat9.yqcloud.top](https://chat9.yqcloud.top/) | `g4f.Provider.Yqcloud` | ✔️ | ❌ | ✔️ |  | ❌ |
|
| 170 |
-
| [theb.ai](https://theb.ai) | `g4f.Provider.Theb` | ✔️ | ❌ | ✔️ |  | ❌ |
|
| 171 |
-
| [play.vercel.ai](https://play.vercel.ai) | `g4f.Provider.Vercel` | ✔️ | ❌ | ✔️ |  | ❌ |
|
| 172 |
-
| [forefront.com](https://forefront.com) | `g4f.Provider.Forefront` | ✔️ | ❌ | ✔️ |  | ❌ |
|
| 173 |
-
| [deepai.org](https://deepai.org) | `g4f.Provider.DeepAi` | ✔️ | ❌ | ✔️ |  | ❌ |
|
| 174 |
-
| [chat.getgpt.world](https://chat.getgpt.world/) | `g4f.Provider.GetGpt` | ✔️ | ❌ | ✔️ |  | ❌ |
|
| 175 |
-
| [chatgptlogin.ac](https://chatgptlogin.ac) | `g4f.Provider.ChatgptLogin` | ✔️ | ❌ | ❌ |  | ❌ |
|
| 176 |
-
| [chat-gpt.org](https://chat-gpt.org/chat) | `g4f.Provider.Aichat` | ✔️ | ❌ | ❌ |  | ❌ |
|
| 177 |
-
| [chat.acytoo.com](https://chat.acytoo.com) | `g4f.Provider.Acytoo` | ✔️ | ❌ | ❌ |  | ❌ |
|
| 178 |
-
| [aitianhu.com](https://aitianhu.com) | `g4f.Provider.AItianhu` | ✔️ | ❌ | ❌ |  | ❌ |
|
| 179 |
-
| [chat.dfehub.com](https://chat.dfehub.com) | `g4f.Provider.DFEHub` | ✔️ | ❌ | ❌ |  | ❌ |
|
| 180 |
-
| [free.easychat.work](https://free.easychat.work) | `g4f.Provider.EasyChat` | ✔️ | ❌ | ❌ |  | ❌ |
|
| 181 |
-
|
| 182 |
-
|
| 183 |
-
### Other Models
|
| 184 |
-
|
| 185 |
-
| Model| Base Provider | Provider | Website |
|
| 186 |
-
| ------- | ----------- | ---- |---- |
|
| 187 |
-
| palm2 | Google | `g4f.Provider.Bard` | [bard.google.com](https://bard.google.com/) |
|
| 188 |
-
| falcon-40b | Huggingface | `g4f.Provider.H2o` | [H2o](https://www.h2o.ai/) |
|
| 189 |
-
| falcon-7b | Huggingface |`g4f.Provider.H2o` | [H2o](https://www.h2o.ai/) |
|
| 190 |
-
| llama-13b | Huggingface | `g4f.Provider.H2o`| [H2o](https://www.h2o.ai/) |
|
| 191 |
-
| claude-instant-v1-100k | Anthropic | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 192 |
-
| claude-instant-v1 | Anthropic | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 193 |
-
| claude-v1-100k | Anthropic | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 194 |
-
| claude-v1 | Anthropic | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 195 |
-
| alpaca-7b | Replicate | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 196 |
-
| stablelm-tuned-alpha-7b | Replicate | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 197 |
-
| bloom | Huggingface | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 198 |
-
| bloomz | Huggingface | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 199 |
-
| flan-t5-xxl | Huggingface | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 200 |
-
| flan-ul2 | Huggingface | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 201 |
-
| gpt-neox-20b | Huggingface | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 202 |
-
| oasst-sft-4-pythia-12b-epoch-3.5 |Huggingface | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 203 |
-
| santacoder | Huggingface | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 204 |
-
| command-medium-nightly | Cohere | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 205 |
-
| command-xlarge-nightly | Cohere | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 206 |
-
| code-cushman-001 | OpenAI | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 207 |
-
| code-davinci-002 | OpenAI | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 208 |
-
| text-ada-001 | OpenAI | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 209 |
-
| text-babbage-001 | OpenAI | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 210 |
-
| text-curie-001 | OpenAI | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 211 |
-
| text-davinci-002 | OpenAI | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 212 |
-
| text-davinci-003 | OpenAI | `g4f.Provider.Vercel` | [sdk.vercel.ai](https://sdk.vercel.ai/) |
|
| 213 |
-
|
| 214 |
-
## Related gpt4free projects
|
| 215 |
-
|
| 216 |
-
<table>
|
| 217 |
-
<thead align="center">
|
| 218 |
-
<tr border: none;>
|
| 219 |
-
<td><b>🎁 Projects</b></td>
|
| 220 |
-
<td><b>⭐ Stars</b></td>
|
| 221 |
-
<td><b>📚 Forks</b></td>
|
| 222 |
-
<td><b>🛎 Issues</b></td>
|
| 223 |
-
<td><b>📬 Pull requests</b></td>
|
| 224 |
-
</tr>
|
| 225 |
-
</thead>
|
| 226 |
-
<tbody>
|
| 227 |
-
<tr>
|
| 228 |
-
<td><a href="https://github.com/xtekky/gpt4free"><b>gpt4free</b></a></td>
|
| 229 |
-
<td><a href="https://github.com/xtekky/gpt4free/stargazers"><img alt="Stars" src="https://img.shields.io/github/stars/xtekky/gpt4free?style=flat-square&labelColor=343b41"/></a></td>
|
| 230 |
-
<td><a href="https://github.com/xtekky/gpt4free/network/members"><img alt="Forks" src="https://img.shields.io/github/forks/xtekky/gpt4free?style=flat-square&labelColor=343b41"/></a></td>
|
| 231 |
-
<td><a href="https://github.com/xtekky/gpt4free/issues"><img alt="Issues" src="https://img.shields.io/github/issues/xtekky/gpt4free?style=flat-square&labelColor=343b41"/></a></td>
|
| 232 |
-
<td><a href="https://github.com/xtekky/gpt4free/pulls"><img alt="Pull Requests" src="https://img.shields.io/github/issues-pr/xtekky/gpt4free?style=flat-square&labelColor=343b41"/></a></td>
|
| 233 |
-
</tr>
|
| 234 |
-
<tr>
|
| 235 |
-
<td><a href="https://github.com/xiangsx/gpt4free-ts"><b>gpt4free-ts</b></a></td>
|
| 236 |
-
<td><a href="https://github.com/xiangsx/gpt4free-ts/stargazers"><img alt="Stars" src="https://img.shields.io/github/stars/xiangsx/gpt4free-ts?style=flat-square&labelColor=343b41"/></a></td>
|
| 237 |
-
<td><a href="https://github.com/xiangsx/gpt4free-ts/network/members"><img alt="Forks" src="https://img.shields.io/github/forks/xiangsx/gpt4free-ts?style=flat-square&labelColor=343b41"/></a></td>
|
| 238 |
-
<td><a href="https://github.com/xiangsx/gpt4free-ts/issues"><img alt="Issues" src="https://img.shields.io/github/issues/xiangsx/gpt4free-ts?style=flat-square&labelColor=343b41"/></a></td>
|
| 239 |
-
<td><a href="https://github.com/xiangsx/gpt4free-ts/pulls"><img alt="Pull Requests" src="https://img.shields.io/github/issues-pr/xiangsx/gpt4free-ts?style=flat-square&labelColor=343b41"/></a></td>
|
| 240 |
-
</tr>
|
| 241 |
-
<tr>
|
| 242 |
-
<td><a href="https://github.com/xtekky/chatgpt-clone"><b>ChatGPT-Clone</b></a></td>
|
| 243 |
-
<td><a href="https://github.com/xtekky/chatgpt-clone/stargazers"><img alt="Stars" src="https://img.shields.io/github/stars/xtekky/chatgpt-clone?style=flat-square&labelColor=343b41"/></a></td>
|
| 244 |
-
<td><a href="https://github.com/xtekky/chatgpt-clone/network/members"><img alt="Forks" src="https://img.shields.io/github/forks/xtekky/chatgpt-clone?style=flat-square&labelColor=343b41"/></a></td>
|
| 245 |
-
<td><a href="https://github.com/xtekky/chatgpt-clone/issues"><img alt="Issues" src="https://img.shields.io/github/issues/xtekky/chatgpt-clone?style=flat-square&labelColor=343b41"/></a></td>
|
| 246 |
-
<td><a href="https://github.com/xtekky/chatgpt-clone/pulls"><img alt="Pull Requests" src="https://img.shields.io/github/issues-pr/xtekky/chatgpt-clone?style=flat-square&labelColor=343b41"/></a></td>
|
| 247 |
-
</tr>
|
| 248 |
-
<tr>
|
| 249 |
-
<td><a href="https://github.com/mishalhossin/Discord-Chatbot-Gpt4Free"><b>ChatGpt Discord Bot</b></a></td>
|
| 250 |
-
<td><a href="https://github.com/mishalhossin/Discord-Chatbot-Gpt4Free/stargazers"><img alt="Stars" src="https://img.shields.io/github/stars/mishalhossin/Discord-Chatbot-Gpt4Free?style=flat-square&labelColor=343b41"/></a></td>
|
| 251 |
-
<td><a href="https://github.com/mishalhossin/Discord-Chatbot-Gpt4Free/network/members"><img alt="Forks" src="https://img.shields.io/github/forks/mishalhossin/Discord-Chatbot-Gpt4Free?style=flat-square&labelColor=343b41"/></a></td>
|
| 252 |
-
<td><a href="https://github.com/mishalhossin/Discord-Chatbot-Gpt4Free/issues"><img alt="Issues" src="https://img.shields.io/github/issues/mishalhossin/Discord-Chatbot-Gpt4Free?style=flat-square&labelColor=343b41"/></a></td>
|
| 253 |
-
<td><a href="https://github.com/mishalhossin/Coding-Chatbot-Gpt4Free/pulls"><img alt="Pull Requests" src="https://img.shields.io/github/issues-pr/mishalhossin/Discord-Chatbot-Gpt4Free?style=flat-square&labelColor=343b41"/></a></td>
|
| 254 |
-
</tr>
|
| 255 |
-
<tr>
|
| 256 |
-
<td><a href="https://github.com/MIDORIBIN/langchain-gpt4free"><b>LangChain gpt4free</b></a></td>
|
| 257 |
-
<td><a href="https://github.com/MIDORIBIN/langchain-gpt4free/stargazers"><img alt="Stars" src="https://img.shields.io/github/stars/MIDORIBIN/langchain-gpt4free?style=flat-square&labelColor=343b41"/></a></td>
|
| 258 |
-
<td><a href="https://github.com/MIDORIBIN/langchain-gpt4free/network/members"><img alt="Forks" src="https://img.shields.io/github/forks/MIDORIBIN/langchain-gpt4free?style=flat-square&labelColor=343b41"/></a></td>
|
| 259 |
-
<td><a href="https://github.com/MIDORIBIN/langchain-gpt4free/issues"><img alt="Issues" src="https://img.shields.io/github/issues/MIDORIBIN/langchain-gpt4free?style=flat-square&labelColor=343b41"/></a></td>
|
| 260 |
-
<td><a href="https://github.com/MIDORIBIN/langchain-gpt4free/pulls"><img alt="Pull Requests" src="https://img.shields.io/github/issues-pr/MIDORIBIN/langchain-gpt4free?style=flat-square&labelColor=343b41"/></a></td>
|
| 261 |
-
</tr>
|
| 262 |
-
</tbody>
|
| 263 |
-
</table>
|
| 264 |
-
|
| 265 |
-
## Contribute
|
| 266 |
-
|
| 267 |
-
to add another provider, its very simple:
|
| 268 |
-
1. create a new file in [g4f/Provider/Providers](./g4f/Provider/Providers) with the name of the Provider
|
| 269 |
-
2. in the file, paste the *Boilerplate* you can find in [g4f/Provider/Provider.py](./g4f/Provider/Provider.py):
|
| 270 |
-
|
| 271 |
-
```py
|
| 272 |
-
import os
|
| 273 |
-
from ..typing import sha256, Dict, get_type_hints
|
| 274 |
-
|
| 275 |
-
url = None
|
| 276 |
-
model = None
|
| 277 |
-
supports_stream = False
|
| 278 |
-
needs_auth = False
|
| 279 |
-
|
| 280 |
-
def _create_completion(model: str, messages: list, stream: bool, **kwargs):
|
| 281 |
-
return
|
| 282 |
-
|
| 283 |
-
|
| 284 |
-
params = f'g4f.Providers.{os.path.basename(__file__)[:-3]} supports: ' + \
|
| 285 |
-
'(%s)' % ', '.join(
|
| 286 |
-
[f"{name}: {get_type_hints(_create_completion)[name].__name__}" for name in _create_completion.__code__.co_varnames[:_create_completion.__code__.co_argcount]])
|
| 287 |
-
|
| 288 |
-
```
|
| 289 |
-
|
| 290 |
-
3. Here, you can adjust the settings, for example if the website does support streaming, set `supports_stream` to `True`...
|
| 291 |
-
4. Write code to request the provider in `_create_completion` and `yield` the response, *even if* its a one-time response, do not hesitate to look at other providers for inspiration
|
| 292 |
-
5. Add the Provider Name in [g4f/Provider/__init__.py](./g4f/Provider/__init__.py)
|
| 293 |
-
|
| 294 |
-
```py
|
| 295 |
-
from . import Provider
|
| 296 |
-
from .Providers import (
|
| 297 |
-
...,
|
| 298 |
-
ProviderNameHere
|
| 299 |
-
)
|
| 300 |
-
```
|
| 301 |
-
|
| 302 |
-
6. You are done !, test the provider by calling it:
|
| 303 |
-
```py
|
| 304 |
-
import g4f
|
| 305 |
-
|
| 306 |
-
response = g4f.ChatCompletion.create(model='gpt-3.5-turbo', provider=g4f.Provider.PROVIDERNAME,
|
| 307 |
-
messages=[{"role": "user", "content": "test"}], stream=g4f.Provider.PROVIDERNAME.supports_stream)
|
| 308 |
-
|
| 309 |
-
for message in response:
|
| 310 |
-
print(message, flush=True, end='')
|
| 311 |
-
```
|
| 312 |
-
|
| 313 |
-
## ChatGPT clone
|
| 314 |
-
|
| 315 |
-
> Currently implementing new features and trying to scale it, please be patient it may be unstable
|
| 316 |
-
> https://chat.g4f.ai/chat
|
| 317 |
-
> This site was developed by me and includes **gpt-4/3.5**, **internet access** and **gpt-jailbreak's** like DAN
|
| 318 |
-
> Run locally here: https://github.com/xtekky/chatgpt-clone
|
| 319 |
-
|
| 320 |
-
## Copyright:
|
| 321 |
-
|
| 322 |
-
This program is licensed under the [GNU GPL v3](https://www.gnu.org/licenses/gpl-3.0.txt)
|
| 323 |
-
|
| 324 |
-
## Copyright Notice:
|
| 325 |
-
|
| 326 |
-
```
|
| 327 |
-
xtekky/gpt4free: Copyright (C) 2023 xtekky
|
| 328 |
-
|
| 329 |
-
This program is free software: you can redistribute it and/or modify
|
| 330 |
-
it under the terms of the GNU General Public License as published by
|
| 331 |
-
the Free Software Foundation, either version 3 of the License, or
|
| 332 |
-
(at your option) any later version.
|
| 333 |
-
|
| 334 |
-
This program is distributed in the hope that it will be useful,
|
| 335 |
-
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| 336 |
-
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
| 337 |
-
GNU General Public License for more details.
|
| 338 |
-
|
| 339 |
-
You should have received a copy of the GNU General Public License
|
| 340 |
-
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
| 341 |
-
```
|
| 342 |
-
|
| 343 |
-
|
| 344 |
-
## Star History
|
| 345 |
-
|
| 346 |
-
<a href="https://github.com/xtekky/gpt4free/stargazers">
|
| 347 |
-
<img width="500" alt="Star History Chart" src="https://api.star-history.com/svg?repos=xtekky/gpt4free&type=Date">
|
| 348 |
-
</a>
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/101-5/gpt4free/g4f/.v1/testing/aiassistest.py
DELETED
|
@@ -1,13 +0,0 @@
|
|
| 1 |
-
import aiassist
|
| 2 |
-
|
| 3 |
-
question1 = "Who won the world series in 2020?"
|
| 4 |
-
req = aiassist.Completion.create(prompt=question1)
|
| 5 |
-
answer = req["text"]
|
| 6 |
-
message_id = req["parentMessageId"]
|
| 7 |
-
|
| 8 |
-
question2 = "Where was it played?"
|
| 9 |
-
req2 = aiassist.Completion.create(prompt=question2, parentMessageId=message_id)
|
| 10 |
-
answer2 = req2["text"]
|
| 11 |
-
|
| 12 |
-
print(answer)
|
| 13 |
-
print(answer2)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/123Kumar/vits-uma-genshin-honkai123/models.py
DELETED
|
@@ -1,534 +0,0 @@
|
|
| 1 |
-
import math
|
| 2 |
-
import torch
|
| 3 |
-
from torch import nn
|
| 4 |
-
from torch.nn import functional as F
|
| 5 |
-
|
| 6 |
-
import commons
|
| 7 |
-
import modules
|
| 8 |
-
import attentions
|
| 9 |
-
import monotonic_align
|
| 10 |
-
|
| 11 |
-
from torch.nn import Conv1d, ConvTranspose1d, Conv2d
|
| 12 |
-
from torch.nn.utils import weight_norm, remove_weight_norm, spectral_norm
|
| 13 |
-
from commons import init_weights, get_padding
|
| 14 |
-
|
| 15 |
-
|
| 16 |
-
class StochasticDurationPredictor(nn.Module):
|
| 17 |
-
def __init__(self, in_channels, filter_channels, kernel_size, p_dropout, n_flows=4, gin_channels=0):
|
| 18 |
-
super().__init__()
|
| 19 |
-
filter_channels = in_channels # it needs to be removed from future version.
|
| 20 |
-
self.in_channels = in_channels
|
| 21 |
-
self.filter_channels = filter_channels
|
| 22 |
-
self.kernel_size = kernel_size
|
| 23 |
-
self.p_dropout = p_dropout
|
| 24 |
-
self.n_flows = n_flows
|
| 25 |
-
self.gin_channels = gin_channels
|
| 26 |
-
|
| 27 |
-
self.log_flow = modules.Log()
|
| 28 |
-
self.flows = nn.ModuleList()
|
| 29 |
-
self.flows.append(modules.ElementwiseAffine(2))
|
| 30 |
-
for i in range(n_flows):
|
| 31 |
-
self.flows.append(modules.ConvFlow(2, filter_channels, kernel_size, n_layers=3))
|
| 32 |
-
self.flows.append(modules.Flip())
|
| 33 |
-
|
| 34 |
-
self.post_pre = nn.Conv1d(1, filter_channels, 1)
|
| 35 |
-
self.post_proj = nn.Conv1d(filter_channels, filter_channels, 1)
|
| 36 |
-
self.post_convs = modules.DDSConv(filter_channels, kernel_size, n_layers=3, p_dropout=p_dropout)
|
| 37 |
-
self.post_flows = nn.ModuleList()
|
| 38 |
-
self.post_flows.append(modules.ElementwiseAffine(2))
|
| 39 |
-
for i in range(4):
|
| 40 |
-
self.post_flows.append(modules.ConvFlow(2, filter_channels, kernel_size, n_layers=3))
|
| 41 |
-
self.post_flows.append(modules.Flip())
|
| 42 |
-
|
| 43 |
-
self.pre = nn.Conv1d(in_channels, filter_channels, 1)
|
| 44 |
-
self.proj = nn.Conv1d(filter_channels, filter_channels, 1)
|
| 45 |
-
self.convs = modules.DDSConv(filter_channels, kernel_size, n_layers=3, p_dropout=p_dropout)
|
| 46 |
-
if gin_channels != 0:
|
| 47 |
-
self.cond = nn.Conv1d(gin_channels, filter_channels, 1)
|
| 48 |
-
|
| 49 |
-
def forward(self, x, x_mask, w=None, g=None, reverse=False, noise_scale=1.0):
|
| 50 |
-
x = torch.detach(x)
|
| 51 |
-
x = self.pre(x)
|
| 52 |
-
if g is not None:
|
| 53 |
-
g = torch.detach(g)
|
| 54 |
-
x = x + self.cond(g)
|
| 55 |
-
x = self.convs(x, x_mask)
|
| 56 |
-
x = self.proj(x) * x_mask
|
| 57 |
-
|
| 58 |
-
if not reverse:
|
| 59 |
-
flows = self.flows
|
| 60 |
-
assert w is not None
|
| 61 |
-
|
| 62 |
-
logdet_tot_q = 0
|
| 63 |
-
h_w = self.post_pre(w)
|
| 64 |
-
h_w = self.post_convs(h_w, x_mask)
|
| 65 |
-
h_w = self.post_proj(h_w) * x_mask
|
| 66 |
-
e_q = torch.randn(w.size(0), 2, w.size(2)).to(device=x.device, dtype=x.dtype) * x_mask
|
| 67 |
-
z_q = e_q
|
| 68 |
-
for flow in self.post_flows:
|
| 69 |
-
z_q, logdet_q = flow(z_q, x_mask, g=(x + h_w))
|
| 70 |
-
logdet_tot_q += logdet_q
|
| 71 |
-
z_u, z1 = torch.split(z_q, [1, 1], 1)
|
| 72 |
-
u = torch.sigmoid(z_u) * x_mask
|
| 73 |
-
z0 = (w - u) * x_mask
|
| 74 |
-
logdet_tot_q += torch.sum((F.logsigmoid(z_u) + F.logsigmoid(-z_u)) * x_mask, [1,2])
|
| 75 |
-
logq = torch.sum(-0.5 * (math.log(2*math.pi) + (e_q**2)) * x_mask, [1,2]) - logdet_tot_q
|
| 76 |
-
|
| 77 |
-
logdet_tot = 0
|
| 78 |
-
z0, logdet = self.log_flow(z0, x_mask)
|
| 79 |
-
logdet_tot += logdet
|
| 80 |
-
z = torch.cat([z0, z1], 1)
|
| 81 |
-
for flow in flows:
|
| 82 |
-
z, logdet = flow(z, x_mask, g=x, reverse=reverse)
|
| 83 |
-
logdet_tot = logdet_tot + logdet
|
| 84 |
-
nll = torch.sum(0.5 * (math.log(2*math.pi) + (z**2)) * x_mask, [1,2]) - logdet_tot
|
| 85 |
-
return nll + logq # [b]
|
| 86 |
-
else:
|
| 87 |
-
flows = list(reversed(self.flows))
|
| 88 |
-
flows = flows[:-2] + [flows[-1]] # remove a useless vflow
|
| 89 |
-
z = torch.randn(x.size(0), 2, x.size(2)).to(device=x.device, dtype=x.dtype) * noise_scale
|
| 90 |
-
for flow in flows:
|
| 91 |
-
z = flow(z, x_mask, g=x, reverse=reverse)
|
| 92 |
-
z0, z1 = torch.split(z, [1, 1], 1)
|
| 93 |
-
logw = z0
|
| 94 |
-
return logw
|
| 95 |
-
|
| 96 |
-
|
| 97 |
-
class DurationPredictor(nn.Module):
|
| 98 |
-
def __init__(self, in_channels, filter_channels, kernel_size, p_dropout, gin_channels=0):
|
| 99 |
-
super().__init__()
|
| 100 |
-
|
| 101 |
-
self.in_channels = in_channels
|
| 102 |
-
self.filter_channels = filter_channels
|
| 103 |
-
self.kernel_size = kernel_size
|
| 104 |
-
self.p_dropout = p_dropout
|
| 105 |
-
self.gin_channels = gin_channels
|
| 106 |
-
|
| 107 |
-
self.drop = nn.Dropout(p_dropout)
|
| 108 |
-
self.conv_1 = nn.Conv1d(in_channels, filter_channels, kernel_size, padding=kernel_size//2)
|
| 109 |
-
self.norm_1 = modules.LayerNorm(filter_channels)
|
| 110 |
-
self.conv_2 = nn.Conv1d(filter_channels, filter_channels, kernel_size, padding=kernel_size//2)
|
| 111 |
-
self.norm_2 = modules.LayerNorm(filter_channels)
|
| 112 |
-
self.proj = nn.Conv1d(filter_channels, 1, 1)
|
| 113 |
-
|
| 114 |
-
if gin_channels != 0:
|
| 115 |
-
self.cond = nn.Conv1d(gin_channels, in_channels, 1)
|
| 116 |
-
|
| 117 |
-
def forward(self, x, x_mask, g=None):
|
| 118 |
-
x = torch.detach(x)
|
| 119 |
-
if g is not None:
|
| 120 |
-
g = torch.detach(g)
|
| 121 |
-
x = x + self.cond(g)
|
| 122 |
-
x = self.conv_1(x * x_mask)
|
| 123 |
-
x = torch.relu(x)
|
| 124 |
-
x = self.norm_1(x)
|
| 125 |
-
x = self.drop(x)
|
| 126 |
-
x = self.conv_2(x * x_mask)
|
| 127 |
-
x = torch.relu(x)
|
| 128 |
-
x = self.norm_2(x)
|
| 129 |
-
x = self.drop(x)
|
| 130 |
-
x = self.proj(x * x_mask)
|
| 131 |
-
return x * x_mask
|
| 132 |
-
|
| 133 |
-
|
| 134 |
-
class TextEncoder(nn.Module):
|
| 135 |
-
def __init__(self,
|
| 136 |
-
n_vocab,
|
| 137 |
-
out_channels,
|
| 138 |
-
hidden_channels,
|
| 139 |
-
filter_channels,
|
| 140 |
-
n_heads,
|
| 141 |
-
n_layers,
|
| 142 |
-
kernel_size,
|
| 143 |
-
p_dropout):
|
| 144 |
-
super().__init__()
|
| 145 |
-
self.n_vocab = n_vocab
|
| 146 |
-
self.out_channels = out_channels
|
| 147 |
-
self.hidden_channels = hidden_channels
|
| 148 |
-
self.filter_channels = filter_channels
|
| 149 |
-
self.n_heads = n_heads
|
| 150 |
-
self.n_layers = n_layers
|
| 151 |
-
self.kernel_size = kernel_size
|
| 152 |
-
self.p_dropout = p_dropout
|
| 153 |
-
|
| 154 |
-
self.emb = nn.Embedding(n_vocab, hidden_channels)
|
| 155 |
-
nn.init.normal_(self.emb.weight, 0.0, hidden_channels**-0.5)
|
| 156 |
-
|
| 157 |
-
self.encoder = attentions.Encoder(
|
| 158 |
-
hidden_channels,
|
| 159 |
-
filter_channels,
|
| 160 |
-
n_heads,
|
| 161 |
-
n_layers,
|
| 162 |
-
kernel_size,
|
| 163 |
-
p_dropout)
|
| 164 |
-
self.proj= nn.Conv1d(hidden_channels, out_channels * 2, 1)
|
| 165 |
-
|
| 166 |
-
def forward(self, x, x_lengths):
|
| 167 |
-
x = self.emb(x) * math.sqrt(self.hidden_channels) # [b, t, h]
|
| 168 |
-
x = torch.transpose(x, 1, -1) # [b, h, t]
|
| 169 |
-
x_mask = torch.unsqueeze(commons.sequence_mask(x_lengths, x.size(2)), 1).to(x.dtype)
|
| 170 |
-
|
| 171 |
-
x = self.encoder(x * x_mask, x_mask)
|
| 172 |
-
stats = self.proj(x) * x_mask
|
| 173 |
-
|
| 174 |
-
m, logs = torch.split(stats, self.out_channels, dim=1)
|
| 175 |
-
return x, m, logs, x_mask
|
| 176 |
-
|
| 177 |
-
|
| 178 |
-
class ResidualCouplingBlock(nn.Module):
|
| 179 |
-
def __init__(self,
|
| 180 |
-
channels,
|
| 181 |
-
hidden_channels,
|
| 182 |
-
kernel_size,
|
| 183 |
-
dilation_rate,
|
| 184 |
-
n_layers,
|
| 185 |
-
n_flows=4,
|
| 186 |
-
gin_channels=0):
|
| 187 |
-
super().__init__()
|
| 188 |
-
self.channels = channels
|
| 189 |
-
self.hidden_channels = hidden_channels
|
| 190 |
-
self.kernel_size = kernel_size
|
| 191 |
-
self.dilation_rate = dilation_rate
|
| 192 |
-
self.n_layers = n_layers
|
| 193 |
-
self.n_flows = n_flows
|
| 194 |
-
self.gin_channels = gin_channels
|
| 195 |
-
|
| 196 |
-
self.flows = nn.ModuleList()
|
| 197 |
-
for i in range(n_flows):
|
| 198 |
-
self.flows.append(modules.ResidualCouplingLayer(channels, hidden_channels, kernel_size, dilation_rate, n_layers, gin_channels=gin_channels, mean_only=True))
|
| 199 |
-
self.flows.append(modules.Flip())
|
| 200 |
-
|
| 201 |
-
def forward(self, x, x_mask, g=None, reverse=False):
|
| 202 |
-
if not reverse:
|
| 203 |
-
for flow in self.flows:
|
| 204 |
-
x, _ = flow(x, x_mask, g=g, reverse=reverse)
|
| 205 |
-
else:
|
| 206 |
-
for flow in reversed(self.flows):
|
| 207 |
-
x = flow(x, x_mask, g=g, reverse=reverse)
|
| 208 |
-
return x
|
| 209 |
-
|
| 210 |
-
|
| 211 |
-
class PosteriorEncoder(nn.Module):
|
| 212 |
-
def __init__(self,
|
| 213 |
-
in_channels,
|
| 214 |
-
out_channels,
|
| 215 |
-
hidden_channels,
|
| 216 |
-
kernel_size,
|
| 217 |
-
dilation_rate,
|
| 218 |
-
n_layers,
|
| 219 |
-
gin_channels=0):
|
| 220 |
-
super().__init__()
|
| 221 |
-
self.in_channels = in_channels
|
| 222 |
-
self.out_channels = out_channels
|
| 223 |
-
self.hidden_channels = hidden_channels
|
| 224 |
-
self.kernel_size = kernel_size
|
| 225 |
-
self.dilation_rate = dilation_rate
|
| 226 |
-
self.n_layers = n_layers
|
| 227 |
-
self.gin_channels = gin_channels
|
| 228 |
-
|
| 229 |
-
self.pre = nn.Conv1d(in_channels, hidden_channels, 1)
|
| 230 |
-
self.enc = modules.WN(hidden_channels, kernel_size, dilation_rate, n_layers, gin_channels=gin_channels)
|
| 231 |
-
self.proj = nn.Conv1d(hidden_channels, out_channels * 2, 1)
|
| 232 |
-
|
| 233 |
-
def forward(self, x, x_lengths, g=None):
|
| 234 |
-
x_mask = torch.unsqueeze(commons.sequence_mask(x_lengths, x.size(2)), 1).to(x.dtype)
|
| 235 |
-
x = self.pre(x) * x_mask
|
| 236 |
-
x = self.enc(x, x_mask, g=g)
|
| 237 |
-
stats = self.proj(x) * x_mask
|
| 238 |
-
m, logs = torch.split(stats, self.out_channels, dim=1)
|
| 239 |
-
z = (m + torch.randn_like(m) * torch.exp(logs)) * x_mask
|
| 240 |
-
return z, m, logs, x_mask
|
| 241 |
-
|
| 242 |
-
|
| 243 |
-
class Generator(torch.nn.Module):
|
| 244 |
-
def __init__(self, initial_channel, resblock, resblock_kernel_sizes, resblock_dilation_sizes, upsample_rates, upsample_initial_channel, upsample_kernel_sizes, gin_channels=0):
|
| 245 |
-
super(Generator, self).__init__()
|
| 246 |
-
self.num_kernels = len(resblock_kernel_sizes)
|
| 247 |
-
self.num_upsamples = len(upsample_rates)
|
| 248 |
-
self.conv_pre = Conv1d(initial_channel, upsample_initial_channel, 7, 1, padding=3)
|
| 249 |
-
resblock = modules.ResBlock1 if resblock == '1' else modules.ResBlock2
|
| 250 |
-
|
| 251 |
-
self.ups = nn.ModuleList()
|
| 252 |
-
for i, (u, k) in enumerate(zip(upsample_rates, upsample_kernel_sizes)):
|
| 253 |
-
self.ups.append(weight_norm(
|
| 254 |
-
ConvTranspose1d(upsample_initial_channel//(2**i), upsample_initial_channel//(2**(i+1)),
|
| 255 |
-
k, u, padding=(k-u)//2)))
|
| 256 |
-
|
| 257 |
-
self.resblocks = nn.ModuleList()
|
| 258 |
-
for i in range(len(self.ups)):
|
| 259 |
-
ch = upsample_initial_channel//(2**(i+1))
|
| 260 |
-
for j, (k, d) in enumerate(zip(resblock_kernel_sizes, resblock_dilation_sizes)):
|
| 261 |
-
self.resblocks.append(resblock(ch, k, d))
|
| 262 |
-
|
| 263 |
-
self.conv_post = Conv1d(ch, 1, 7, 1, padding=3, bias=False)
|
| 264 |
-
self.ups.apply(init_weights)
|
| 265 |
-
|
| 266 |
-
if gin_channels != 0:
|
| 267 |
-
self.cond = nn.Conv1d(gin_channels, upsample_initial_channel, 1)
|
| 268 |
-
|
| 269 |
-
def forward(self, x, g=None):
|
| 270 |
-
x = self.conv_pre(x)
|
| 271 |
-
if g is not None:
|
| 272 |
-
x = x + self.cond(g)
|
| 273 |
-
|
| 274 |
-
for i in range(self.num_upsamples):
|
| 275 |
-
x = F.leaky_relu(x, modules.LRELU_SLOPE)
|
| 276 |
-
x = self.ups[i](x)
|
| 277 |
-
xs = None
|
| 278 |
-
for j in range(self.num_kernels):
|
| 279 |
-
if xs is None:
|
| 280 |
-
xs = self.resblocks[i*self.num_kernels+j](x)
|
| 281 |
-
else:
|
| 282 |
-
xs += self.resblocks[i*self.num_kernels+j](x)
|
| 283 |
-
x = xs / self.num_kernels
|
| 284 |
-
x = F.leaky_relu(x)
|
| 285 |
-
x = self.conv_post(x)
|
| 286 |
-
x = torch.tanh(x)
|
| 287 |
-
|
| 288 |
-
return x
|
| 289 |
-
|
| 290 |
-
def remove_weight_norm(self):
|
| 291 |
-
print('Removing weight norm...')
|
| 292 |
-
for l in self.ups:
|
| 293 |
-
remove_weight_norm(l)
|
| 294 |
-
for l in self.resblocks:
|
| 295 |
-
l.remove_weight_norm()
|
| 296 |
-
|
| 297 |
-
|
| 298 |
-
class DiscriminatorP(torch.nn.Module):
|
| 299 |
-
def __init__(self, period, kernel_size=5, stride=3, use_spectral_norm=False):
|
| 300 |
-
super(DiscriminatorP, self).__init__()
|
| 301 |
-
self.period = period
|
| 302 |
-
self.use_spectral_norm = use_spectral_norm
|
| 303 |
-
norm_f = weight_norm if use_spectral_norm == False else spectral_norm
|
| 304 |
-
self.convs = nn.ModuleList([
|
| 305 |
-
norm_f(Conv2d(1, 32, (kernel_size, 1), (stride, 1), padding=(get_padding(kernel_size, 1), 0))),
|
| 306 |
-
norm_f(Conv2d(32, 128, (kernel_size, 1), (stride, 1), padding=(get_padding(kernel_size, 1), 0))),
|
| 307 |
-
norm_f(Conv2d(128, 512, (kernel_size, 1), (stride, 1), padding=(get_padding(kernel_size, 1), 0))),
|
| 308 |
-
norm_f(Conv2d(512, 1024, (kernel_size, 1), (stride, 1), padding=(get_padding(kernel_size, 1), 0))),
|
| 309 |
-
norm_f(Conv2d(1024, 1024, (kernel_size, 1), 1, padding=(get_padding(kernel_size, 1), 0))),
|
| 310 |
-
])
|
| 311 |
-
self.conv_post = norm_f(Conv2d(1024, 1, (3, 1), 1, padding=(1, 0)))
|
| 312 |
-
|
| 313 |
-
def forward(self, x):
|
| 314 |
-
fmap = []
|
| 315 |
-
|
| 316 |
-
# 1d to 2d
|
| 317 |
-
b, c, t = x.shape
|
| 318 |
-
if t % self.period != 0: # pad first
|
| 319 |
-
n_pad = self.period - (t % self.period)
|
| 320 |
-
x = F.pad(x, (0, n_pad), "reflect")
|
| 321 |
-
t = t + n_pad
|
| 322 |
-
x = x.view(b, c, t // self.period, self.period)
|
| 323 |
-
|
| 324 |
-
for l in self.convs:
|
| 325 |
-
x = l(x)
|
| 326 |
-
x = F.leaky_relu(x, modules.LRELU_SLOPE)
|
| 327 |
-
fmap.append(x)
|
| 328 |
-
x = self.conv_post(x)
|
| 329 |
-
fmap.append(x)
|
| 330 |
-
x = torch.flatten(x, 1, -1)
|
| 331 |
-
|
| 332 |
-
return x, fmap
|
| 333 |
-
|
| 334 |
-
|
| 335 |
-
class DiscriminatorS(torch.nn.Module):
|
| 336 |
-
def __init__(self, use_spectral_norm=False):
|
| 337 |
-
super(DiscriminatorS, self).__init__()
|
| 338 |
-
norm_f = weight_norm if use_spectral_norm == False else spectral_norm
|
| 339 |
-
self.convs = nn.ModuleList([
|
| 340 |
-
norm_f(Conv1d(1, 16, 15, 1, padding=7)),
|
| 341 |
-
norm_f(Conv1d(16, 64, 41, 4, groups=4, padding=20)),
|
| 342 |
-
norm_f(Conv1d(64, 256, 41, 4, groups=16, padding=20)),
|
| 343 |
-
norm_f(Conv1d(256, 1024, 41, 4, groups=64, padding=20)),
|
| 344 |
-
norm_f(Conv1d(1024, 1024, 41, 4, groups=256, padding=20)),
|
| 345 |
-
norm_f(Conv1d(1024, 1024, 5, 1, padding=2)),
|
| 346 |
-
])
|
| 347 |
-
self.conv_post = norm_f(Conv1d(1024, 1, 3, 1, padding=1))
|
| 348 |
-
|
| 349 |
-
def forward(self, x):
|
| 350 |
-
fmap = []
|
| 351 |
-
|
| 352 |
-
for l in self.convs:
|
| 353 |
-
x = l(x)
|
| 354 |
-
x = F.leaky_relu(x, modules.LRELU_SLOPE)
|
| 355 |
-
fmap.append(x)
|
| 356 |
-
x = self.conv_post(x)
|
| 357 |
-
fmap.append(x)
|
| 358 |
-
x = torch.flatten(x, 1, -1)
|
| 359 |
-
|
| 360 |
-
return x, fmap
|
| 361 |
-
|
| 362 |
-
|
| 363 |
-
class MultiPeriodDiscriminator(torch.nn.Module):
|
| 364 |
-
def __init__(self, use_spectral_norm=False):
|
| 365 |
-
super(MultiPeriodDiscriminator, self).__init__()
|
| 366 |
-
periods = [2,3,5,7,11]
|
| 367 |
-
|
| 368 |
-
discs = [DiscriminatorS(use_spectral_norm=use_spectral_norm)]
|
| 369 |
-
discs = discs + [DiscriminatorP(i, use_spectral_norm=use_spectral_norm) for i in periods]
|
| 370 |
-
self.discriminators = nn.ModuleList(discs)
|
| 371 |
-
|
| 372 |
-
def forward(self, y, y_hat):
|
| 373 |
-
y_d_rs = []
|
| 374 |
-
y_d_gs = []
|
| 375 |
-
fmap_rs = []
|
| 376 |
-
fmap_gs = []
|
| 377 |
-
for i, d in enumerate(self.discriminators):
|
| 378 |
-
y_d_r, fmap_r = d(y)
|
| 379 |
-
y_d_g, fmap_g = d(y_hat)
|
| 380 |
-
y_d_rs.append(y_d_r)
|
| 381 |
-
y_d_gs.append(y_d_g)
|
| 382 |
-
fmap_rs.append(fmap_r)
|
| 383 |
-
fmap_gs.append(fmap_g)
|
| 384 |
-
|
| 385 |
-
return y_d_rs, y_d_gs, fmap_rs, fmap_gs
|
| 386 |
-
|
| 387 |
-
|
| 388 |
-
|
| 389 |
-
class SynthesizerTrn(nn.Module):
|
| 390 |
-
"""
|
| 391 |
-
Synthesizer for Training
|
| 392 |
-
"""
|
| 393 |
-
|
| 394 |
-
def __init__(self,
|
| 395 |
-
n_vocab,
|
| 396 |
-
spec_channels,
|
| 397 |
-
segment_size,
|
| 398 |
-
inter_channels,
|
| 399 |
-
hidden_channels,
|
| 400 |
-
filter_channels,
|
| 401 |
-
n_heads,
|
| 402 |
-
n_layers,
|
| 403 |
-
kernel_size,
|
| 404 |
-
p_dropout,
|
| 405 |
-
resblock,
|
| 406 |
-
resblock_kernel_sizes,
|
| 407 |
-
resblock_dilation_sizes,
|
| 408 |
-
upsample_rates,
|
| 409 |
-
upsample_initial_channel,
|
| 410 |
-
upsample_kernel_sizes,
|
| 411 |
-
n_speakers=0,
|
| 412 |
-
gin_channels=0,
|
| 413 |
-
use_sdp=True,
|
| 414 |
-
**kwargs):
|
| 415 |
-
|
| 416 |
-
super().__init__()
|
| 417 |
-
self.n_vocab = n_vocab
|
| 418 |
-
self.spec_channels = spec_channels
|
| 419 |
-
self.inter_channels = inter_channels
|
| 420 |
-
self.hidden_channels = hidden_channels
|
| 421 |
-
self.filter_channels = filter_channels
|
| 422 |
-
self.n_heads = n_heads
|
| 423 |
-
self.n_layers = n_layers
|
| 424 |
-
self.kernel_size = kernel_size
|
| 425 |
-
self.p_dropout = p_dropout
|
| 426 |
-
self.resblock = resblock
|
| 427 |
-
self.resblock_kernel_sizes = resblock_kernel_sizes
|
| 428 |
-
self.resblock_dilation_sizes = resblock_dilation_sizes
|
| 429 |
-
self.upsample_rates = upsample_rates
|
| 430 |
-
self.upsample_initial_channel = upsample_initial_channel
|
| 431 |
-
self.upsample_kernel_sizes = upsample_kernel_sizes
|
| 432 |
-
self.segment_size = segment_size
|
| 433 |
-
self.n_speakers = n_speakers
|
| 434 |
-
self.gin_channels = gin_channels
|
| 435 |
-
|
| 436 |
-
self.use_sdp = use_sdp
|
| 437 |
-
|
| 438 |
-
self.enc_p = TextEncoder(n_vocab,
|
| 439 |
-
inter_channels,
|
| 440 |
-
hidden_channels,
|
| 441 |
-
filter_channels,
|
| 442 |
-
n_heads,
|
| 443 |
-
n_layers,
|
| 444 |
-
kernel_size,
|
| 445 |
-
p_dropout)
|
| 446 |
-
self.dec = Generator(inter_channels, resblock, resblock_kernel_sizes, resblock_dilation_sizes, upsample_rates, upsample_initial_channel, upsample_kernel_sizes, gin_channels=gin_channels)
|
| 447 |
-
self.enc_q = PosteriorEncoder(spec_channels, inter_channels, hidden_channels, 5, 1, 16, gin_channels=gin_channels)
|
| 448 |
-
self.flow = ResidualCouplingBlock(inter_channels, hidden_channels, 5, 1, 4, gin_channels=gin_channels)
|
| 449 |
-
|
| 450 |
-
if use_sdp:
|
| 451 |
-
self.dp = StochasticDurationPredictor(hidden_channels, 192, 3, 0.5, 4, gin_channels=gin_channels)
|
| 452 |
-
else:
|
| 453 |
-
self.dp = DurationPredictor(hidden_channels, 256, 3, 0.5, gin_channels=gin_channels)
|
| 454 |
-
|
| 455 |
-
if n_speakers > 1:
|
| 456 |
-
self.emb_g = nn.Embedding(n_speakers, gin_channels)
|
| 457 |
-
|
| 458 |
-
def forward(self, x, x_lengths, y, y_lengths, sid=None):
|
| 459 |
-
|
| 460 |
-
x, m_p, logs_p, x_mask = self.enc_p(x, x_lengths)
|
| 461 |
-
if self.n_speakers > 0:
|
| 462 |
-
g = self.emb_g(sid).unsqueeze(-1) # [b, h, 1]
|
| 463 |
-
else:
|
| 464 |
-
g = None
|
| 465 |
-
|
| 466 |
-
z, m_q, logs_q, y_mask = self.enc_q(y, y_lengths, g=g)
|
| 467 |
-
z_p = self.flow(z, y_mask, g=g)
|
| 468 |
-
|
| 469 |
-
with torch.no_grad():
|
| 470 |
-
# negative cross-entropy
|
| 471 |
-
s_p_sq_r = torch.exp(-2 * logs_p) # [b, d, t]
|
| 472 |
-
neg_cent1 = torch.sum(-0.5 * math.log(2 * math.pi) - logs_p, [1], keepdim=True) # [b, 1, t_s]
|
| 473 |
-
neg_cent2 = torch.matmul(-0.5 * (z_p ** 2).transpose(1, 2), s_p_sq_r) # [b, t_t, d] x [b, d, t_s] = [b, t_t, t_s]
|
| 474 |
-
neg_cent3 = torch.matmul(z_p.transpose(1, 2), (m_p * s_p_sq_r)) # [b, t_t, d] x [b, d, t_s] = [b, t_t, t_s]
|
| 475 |
-
neg_cent4 = torch.sum(-0.5 * (m_p ** 2) * s_p_sq_r, [1], keepdim=True) # [b, 1, t_s]
|
| 476 |
-
neg_cent = neg_cent1 + neg_cent2 + neg_cent3 + neg_cent4
|
| 477 |
-
|
| 478 |
-
attn_mask = torch.unsqueeze(x_mask, 2) * torch.unsqueeze(y_mask, -1)
|
| 479 |
-
attn = monotonic_align.maximum_path(neg_cent, attn_mask.squeeze(1)).unsqueeze(1).detach()
|
| 480 |
-
|
| 481 |
-
w = attn.sum(2)
|
| 482 |
-
if self.use_sdp:
|
| 483 |
-
l_length = self.dp(x, x_mask, w, g=g)
|
| 484 |
-
l_length = l_length / torch.sum(x_mask)
|
| 485 |
-
else:
|
| 486 |
-
logw_ = torch.log(w + 1e-6) * x_mask
|
| 487 |
-
logw = self.dp(x, x_mask, g=g)
|
| 488 |
-
l_length = torch.sum((logw - logw_)**2, [1,2]) / torch.sum(x_mask) # for averaging
|
| 489 |
-
|
| 490 |
-
# expand prior
|
| 491 |
-
m_p = torch.matmul(attn.squeeze(1), m_p.transpose(1, 2)).transpose(1, 2)
|
| 492 |
-
logs_p = torch.matmul(attn.squeeze(1), logs_p.transpose(1, 2)).transpose(1, 2)
|
| 493 |
-
|
| 494 |
-
z_slice, ids_slice = commons.rand_slice_segments(z, y_lengths, self.segment_size)
|
| 495 |
-
o = self.dec(z_slice, g=g)
|
| 496 |
-
return o, l_length, attn, ids_slice, x_mask, y_mask, (z, z_p, m_p, logs_p, m_q, logs_q)
|
| 497 |
-
|
| 498 |
-
def infer(self, x, x_lengths, sid=None, noise_scale=1, length_scale=1, noise_scale_w=1., max_len=None):
|
| 499 |
-
device = next(self.parameters()).device # 获取模型所在的设备
|
| 500 |
-
x, m_p, logs_p, x_mask = self.enc_p(x.to(device), x_lengths.to(device))
|
| 501 |
-
if self.n_speakers > 0:
|
| 502 |
-
g = self.emb_g(sid.to(device)).unsqueeze(-1) # [b, h, 1]
|
| 503 |
-
else:
|
| 504 |
-
g = None
|
| 505 |
-
|
| 506 |
-
if self.use_sdp:
|
| 507 |
-
logw = self.dp(x, x_mask, g=g, reverse=True, noise_scale=noise_scale_w)
|
| 508 |
-
else:
|
| 509 |
-
logw = self.dp(x, x_mask, g=g)
|
| 510 |
-
w = torch.exp(logw) * x_mask * length_scale
|
| 511 |
-
w_ceil = torch.ceil(w)
|
| 512 |
-
y_lengths = torch.clamp_min(torch.sum(w_ceil, [1, 2]), 1).long()
|
| 513 |
-
y_mask = torch.unsqueeze(commons.sequence_mask(y_lengths, None), 1).to(x_mask.dtype)
|
| 514 |
-
attn_mask = torch.unsqueeze(x_mask, 2) * torch.unsqueeze(y_mask, -1)
|
| 515 |
-
attn = commons.generate_path(w_ceil, attn_mask)
|
| 516 |
-
|
| 517 |
-
m_p = torch.matmul(attn.squeeze(1), m_p.transpose(1, 2)).transpose(1, 2) # [b, t', t], [b, t, d] -> [b, d, t']
|
| 518 |
-
logs_p = torch.matmul(attn.squeeze(1), logs_p.transpose(1, 2)).transpose(1, 2) # [b, t', t], [b, t, d] -> [b, d, t']
|
| 519 |
-
|
| 520 |
-
z_p = m_p + torch.randn_like(m_p) * torch.exp(logs_p) * noise_scale
|
| 521 |
-
z = self.flow(z_p, y_mask, g=g, reverse=True)
|
| 522 |
-
o = self.dec((z * y_mask)[:,:,:max_len], g=g)
|
| 523 |
-
return o, attn, y_mask, (z, z_p, m_p, logs_p)
|
| 524 |
-
|
| 525 |
-
def voice_conversion(self, y, y_lengths, sid_src, sid_tgt):
|
| 526 |
-
assert self.n_speakers > 0, "n_speakers have to be larger than 0."
|
| 527 |
-
g_src = self.emb_g(sid_src).unsqueeze(-1)
|
| 528 |
-
g_tgt = self.emb_g(sid_tgt).unsqueeze(-1)
|
| 529 |
-
z, m_q, logs_q, y_mask = self.enc_q(y, y_lengths, g=g_src)
|
| 530 |
-
z_p = self.flow(z, y_mask, g=g_src)
|
| 531 |
-
z_hat = self.flow(z_p, y_mask, g=g_tgt, reverse=True)
|
| 532 |
-
o_hat = self.dec(z_hat * y_mask, g=g_tgt)
|
| 533 |
-
return o_hat, y_mask, (z, z_p, z_hat)
|
| 534 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/1acneusushi/gradio-2dmoleculeeditor/data/Full Version Bandicam Free Download The Ultimate Guide to Screen Recording.md
DELETED
|
@@ -1,47 +0,0 @@
|
|
| 1 |
-
<br />
|
| 2 |
-
<h1>How to Get Full Version Bandicam Free Download</h1>
|
| 3 |
-
<p>If you are looking for a screen recorder that can capture high-quality videos without lagging or watermarking, you might be interested in Bandicam. Bandicam is a popular screen recording software that can record anything on your PC screen, such as games, online videos, webinars, lectures, and more. It can also record audio from your microphone or speakers, and save the recorded files in various formats, such as MP4, AVI, MOV, etc.</p>
|
| 4 |
-
<h2>full version bandicam free download</h2><br /><p><b><b>Download Zip</b> ——— <a href="https://byltly.com/2uKv7n">https://byltly.com/2uKv7n</a></b></p><br /><br />
|
| 5 |
-
<p>However, Bandicam is not a free software. You need to pay $39.95 for a single license, or $59.95 for a two-PC license. If you want to use Bandicam without any limitations or watermarks, you need to purchase the full version. But what if you don't have the budget or don't want to spend money on a screen recorder? Is there a way to get full version Bandicam free download?</p>
|
| 6 |
-
<p>The answer is yes, but you need to be careful. There are many websites that claim to offer full version Bandicam free download, but most of them are scams or malware. They may infect your computer with viruses, spyware, ransomware, or other malicious programs that can harm your system or steal your personal information. Some of them may also ask you to complete surveys, download additional software, or enter your credit card details before giving you the download link. These are all red flags that you should avoid.</p>
|
| 7 |
-
<p>The only safe and legal way to get full version Bandicam free download is to use the official trial version from the Bandicam website. The trial version allows you to use all the features of Bandicam for 10 minutes per recording session, and it adds a watermark to the recorded videos. However, you can remove the watermark and extend the recording time by using a video editing software, such as Windows Movie Maker, VLC Media Player, or VideoProc. Here are the steps to do so:</p>
|
| 8 |
-
<ol>
|
| 9 |
-
<li>Go to <a href="https://www.bandicam.com/downloads/">https://www.bandicam.com/downloads/</a> and download the trial version of Bandicam.</li>
|
| 10 |
-
<li>Install and run Bandicam on your PC.</li>
|
| 11 |
-
<li>Select the recording mode and adjust the settings according to your needs.</li>
|
| 12 |
-
<li>Click the "REC" button to start recording your screen.</li>
|
| 13 |
-
<li>When you are done, click the "Stop" button to save the recorded file.</li>
|
| 14 |
-
<li>Open your video editing software and import the recorded file.</li>
|
| 15 |
-
<li>Crop or trim the video to remove the watermark and any unwanted parts.</li>
|
| 16 |
-
<li>Save or export the edited video in your preferred format and quality.</li>
|
| 17 |
-
</ol>
|
| 18 |
-
<p>Congratulations! You have successfully got full version Bandicam free download without paying anything or risking your computer security. You can now enjoy recording your screen with Bandicam without any limitations or watermarks.</p>
|
| 19 |
-
|
| 20 |
-
<p>Why Choose Bandicam as Your Screen Recorder?</p>
|
| 21 |
-
<p></p>
|
| 22 |
-
<p>Bandicam is one of the best screen recording software in the market. It has many advantages over other screen recorders, such as:</p>
|
| 23 |
-
<ul>
|
| 24 |
-
<li>It can record high-quality videos up to 4K resolution and 480 FPS.</li>
|
| 25 |
-
<li>It can compress the recorded files to a smaller size without losing quality.</li>
|
| 26 |
-
<li>It can record multiple audio sources simultaneously, such as your voice and the system sound.</li>
|
| 27 |
-
<li>It can record external devices, such as webcam, smartphone, Xbox, PlayStation, etc.</li>
|
| 28 |
-
<li>It can add various effects and annotations to your videos, such as mouse cursor, logo, webcam overlay, drawing tools, etc.</li>
|
| 29 |
-
<li>It can capture screenshots and save them in various formats, such as PNG, JPG, BMP, etc.</li>
|
| 30 |
-
<li>It has a simple and intuitive interface that is easy to use for beginners and professionals alike.</li>
|
| 31 |
-
</ul>
|
| 32 |
-
<p>With Bandicam, you can record anything on your screen with ease and efficiency. Whether you want to record your gameplay, online streaming, tutorial, presentation, or anything else, Bandicam can handle it all.</p>
|
| 33 |
-
|
| 34 |
-
<p>How to Use Bandicam Effectively?</p>
|
| 35 |
-
<p>To get the most out of Bandicam, you need to know how to use it effectively. Here are some tips and tricks that can help you improve your screen recording experience with Bandicam:</p>
|
| 36 |
-
<ul>
|
| 37 |
-
<li>Before recording, make sure you have enough disk space and CPU power to avoid lagging or crashing.</li>
|
| 38 |
-
<li>Select the appropriate recording mode for your purpose. Bandicam has four recording modes: Screen Recording Mode, Game Recording Mode, Device Recording Mode, and Webcam Recording Mode.</li>
|
| 39 |
-
<li>Adjust the settings according to your needs. You can change the video format, quality, codec, frame rate, audio source, hotkeys, and more in the settings menu.</li>
|
| 40 |
-
<li>Use the preview window to check the recording area and adjust the size and position of the window.</li>
|
| 41 |
-
<li>Use the pause/resume function to control the recording process. You can also use the auto-complete recording function to set a time limit or file size limit for your recording.</li>
|
| 42 |
-
<li>Use the edit function to trim or split your recorded files. You can also use the extract function to extract audio or images from your recorded files.</li>
|
| 43 |
-
<li>Use the upload function to share your recorded files online. You can upload your videos directly to YouTube or Vimeo from Bandicam.</li>
|
| 44 |
-
</ul>
|
| 45 |
-
<p>By following these tips and tricks, you can use Bandicam more effectively and create amazing screen recordings with ease.</p> ddb901b051<br />
|
| 46 |
-
<br />
|
| 47 |
-
<br />
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/1gistliPinn/ChatGPT4/Examples/Deadliest Catch Alaskan Storm English PCDVD 2Lions-Team Game Download VERIFIED.md
DELETED
|
@@ -1,19 +0,0 @@
|
|
| 1 |
-
|
| 2 |
-
<h1>Deadliest Catch Alaskan Storm: A Realistic and Challenging Simulation Game</h1>
|
| 3 |
-
<p>If you are a fan of the Discovery Channel's hit show Deadliest Catch, you might want to try out the video game based on it: Deadliest Catch Alaskan Storm. This game lets you experience the thrill and danger of crab fishing in the Bering Sea, as you control one of the real-life boats featured on the show, or create your own custom vessel. You will have to manage your crew, equipment, and finances, as well as deal with unpredictable weather, ice, and wildlife. The game features realistic graphics, physics, and sounds, as well as a dynamic campaign mode that changes according to your actions. You can also play in free mode, where you can explore the vast ocean at your own pace.</p>
|
| 4 |
-
<p>Deadliest Catch Alaskan Storm was released in 2008 for Windows PC and Xbox 360. It was developed by Liquid Dragon Studios LLC and published by Greenwave Games. The game received positive reviews from critics and fans alike, who praised its authenticity and difficulty. However, some also criticized its repetitiveness and lack of online multiplayer mode. If you are looking for a challenging and immersive simulation game that will test your skills and nerves, you might want to download Deadliest Catch Alaskan Storm today.</p>
|
| 5 |
-
<h2>Deadliest Catch Alaskan Storm English PCDVD 2Lions-Team game download</h2><br /><p><b><b>Download</b> ✺ <a href="https://imgfil.com/2uy0Lb">https://imgfil.com/2uy0Lb</a></b></p><br /><br />
|
| 6 |
-
<p>You can download Deadliest Catch Alaskan Storm from various sources on the internet, such as KcTorrent[^1^], Retrolorian[^2^], or npm[^3^]. However, be careful of potential viruses or malware that might harm your computer. Always scan your files before opening them, and use a reliable antivirus software. Alternatively, you can buy the game from online retailers such as Amazon or eBay.</p><h2>How to Play Deadliest Catch Alaskan Storm</h2>
|
| 7 |
-
<p>Deadliest Catch Alaskan Storm is not a simple arcade game. It is a complex and realistic simulation that requires strategy, patience, and skill. If you want to succeed as a crab fisherman, you will need to learn how to play the game properly. Here are some tips and tricks to help you get started.</p>
|
| 8 |
-
<ul>
|
| 9 |
-
<li>The game has two main modes: Career and Missions. In Career mode, you can create your own captain and boat, and embark on a full season of crab fishing. You will have to manage your crew, finances, equipment, and strategy, as well as deal with random events and challenges. In Missions mode, you can play various scenarios that test your skills and knowledge of the game. You can also unlock new boats and crew members by completing missions.</li>
|
| 10 |
-
<li>The game has a tutorial that teaches you the basics of the game, such as how to navigate, set pots, haul pots, sort crabs, and dock at harbors. You can access the tutorial from the main menu or from the career mode. The tutorial consists of five days of fishing, each with a different objective and difficulty level. You can replay the tutorial at any time if you need a refresher.</li>
|
| 11 |
-
<li>The game has a dynamic weather system that affects the gameplay. You will encounter various weather conditions, such as fog, rain, snow, wind, storms, and ice. The weather can change rapidly and unpredictably, so you need to be prepared for anything. The weather can also affect your boat's performance, visibility, stability, and safety. You can check the weather forecast from your map screen or from the radio.</li>
|
| 12 |
-
<li>The game has a realistic physics engine that simulates the movement of your boat and the ocean waves. You will have to steer your boat carefully and adjust your speed according to the sea conditions. You will also have to balance your boat's weight by distributing your pots and crabs evenly. If your boat is too heavy or unbalanced, it can sink or capsize.</li>
|
| 13 |
-
<li>The game has a detailed crab fishing system that requires strategy and skill. You will have to choose your fishing grounds wisely by checking the map for hot spots and survey data. You will also have to set your pots in optimal locations and depths by using your sonar and GPS. You will have to monitor your pots' soak time and bait level by using your pot tracker. You will have to haul your pots efficiently and safely by using your crane and hook. You will have to sort your crabs quickly and accurately by using your sorting table and bin.</li>
|
| 14 |
-
<li>The game has a realistic crew management system that affects the gameplay. You will have to hire, fire, train, motivate, and pay your crew members. Each crew member has different skills, personalities, traits, and salaries. You will have to assign them tasks according to their abilities and preferences. You will also have to keep them happy and healthy by providing them food, rest, medical attention, and entertainment. If your crew is unhappy or injured, they can quit or perform poorly.</li>
|
| 15 |
-
<li>The game has a realistic economy system that affects the gameplay. You will have to buy, sell, upgrade, repair, and maintain your boat and equipment. Each item has different costs, benefits, and drawbacks. You will also have to deal with various expenses, such as fuel, bait, harbor fees, taxes, insurance, fines, etc. You will also have to deal with fluctuating crab prices that depend on supply and demand. Your goal is to make as much profit as possible by catching more crabs at lower costs.</li>
|
| 16 |
-
</ul>
|
| 17 |
-
<p>Deadliest Catch Alaskan Storm is a challenging and rewarding game that will test your skills as a crab fisherman. If you follow these tips and tricks, you will be able to enjoy the game more and achieve better results.</p> d5da3c52bf<br />
|
| 18 |
-
<br />
|
| 19 |
-
<br />
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/1gistliPinn/ChatGPT4/Examples/Elements Of Astro Mechanics Van De Kamp Pdf 19 PORTABLE.md
DELETED
|
@@ -1,8 +0,0 @@
|
|
| 1 |
-
|
| 2 |
-
<p>this hands-on stem class focuses on space exploration. students will learn about outer space, space shuttles, and how they work. students will learn about how astronauts live and work in space, and what happens when they take off and return to earth. students will explore different parts of the solar system and how they work. at the end of the class, students will have a chance to explore a planetarium and learn about outer space. min 8/max 16. registration deadline: march 2 </p>
|
| 3 |
-
<p>this hands-on stem class focuses on outer space. students will learn about outer space, space shuttles, and how they work. students will learn about how astronauts live and work in space, and what happens when they take off and return to earth. students will explore different parts of the solar system and how they work. at the end of the class, students will have a chance to explore a planetarium and learn about outer space. min 8/max 16. registration deadline: november 9 </p>
|
| 4 |
-
<h2>Elements Of Astro Mechanics Van De Kamp Pdf 19</h2><br /><p><b><b>DOWNLOAD</b> ····· <a href="https://imgfil.com/2uxXjz">https://imgfil.com/2uxXjz</a></b></p><br /><br />
|
| 5 |
-
<p>this hands-on stem class focuses on outer space. students will learn about outer space, space shuttles, and how they work. students will learn about how astronauts live and work in space, and what happens when they take off and return to earth. students will explore different parts of the solar system and how they work. at the end of the class, students will have a chance to explore a planetarium and learn about outer space. min 8/max 16. registration deadline: march 2 </p>
|
| 6 |
-
<p>this hands-on stem class focuses on space exploration. students will learn about outer space, space shuttles, and how they work. students will learn about how astronauts live and work in space, and what happens when they take off and return to earth. students will explore different parts of the solar system and how they work. at the end of the class, students will have a chance to explore a planetarium and learn about outer space. min 8/max 16. registration deadline: november 9 </p> 899543212b<br />
|
| 7 |
-
<br />
|
| 8 |
-
<br />
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/1pelhydcardo/ChatGPT-prompt-generator/Aterriza-Como-Puedas-2-Hd-Rip-720p.md
DELETED
|
@@ -1,66 +0,0 @@
|
|
| 1 |
-
## Aterriza Como Puedas 2 Hd Rip 720p
|
| 2 |
-
|
| 3 |
-
|
| 4 |
-
|
| 5 |
-
|
| 6 |
-
|
| 7 |
-
|
| 8 |
-
|
| 9 |
-
|
| 10 |
-
|
| 11 |
-
|
| 12 |
-
|
| 13 |
-
**Download >> [https://lodystiri.blogspot.com/?file=2txPBb](https://lodystiri.blogspot.com/?file=2txPBb)**
|
| 14 |
-
|
| 15 |
-
|
| 16 |
-
|
| 17 |
-
|
| 18 |
-
|
| 19 |
-
|
| 20 |
-
|
| 21 |
-
|
| 22 |
-
|
| 23 |
-
|
| 24 |
-
|
| 25 |
-
I can try to write a title and an article with SEO optimization and HTML formatting for the keyword "Aterriza Como Puedas 2 Hd Rip 720p". Here is what I came up with: ```html
|
| 26 |
-
|
| 27 |
-
# Aterriza Como Puedas 2 Hd Rip 720p: La Comedia Aérea Más Divertida
|
| 28 |
-
|
| 29 |
-
|
| 30 |
-
|
| 31 |
-
Si te gustó la primera parte de Aterriza Como Puedas, no te puedes perder la segunda entrega de esta hilarante saga de humor. Aterriza Como Puedas 2 Hd Rip 720p es una pelÃcula que te hará reÃr a carcajadas con las locuras de los protagonistas a bordo de un avión en plena crisis.
|
| 32 |
-
|
| 33 |
-
|
| 34 |
-
|
| 35 |
-
En esta ocasión, el piloto Ted Striker (Robert Hays) tiene que volver a tomar los mandos de una aeronave para evitar una catástrofe. Pero esta vez, el problema no es un virus que afecta a la tripulación, sino un sabotaje informático que hace que el sistema de control del vuelo se vuelva loco. Para colmo, Ted tiene que lidiar con su ex-novia Elaine (Julie Hagerty), que ahora es una azafata del avión, y con un montón de personajes disparatados que viajan como pasajeros.
|
| 36 |
-
|
| 37 |
-
|
| 38 |
-
|
| 39 |
-
Aterriza Como Puedas 2 Hd Rip 720p es una comedia que parodia las pelÃculas de desastres aéreos, con un humor absurdo y surrealista. La pelÃcula está llena de gags, referencias culturales y cameos de famosos, como William Shatner, John DeLorean o Kareem Abdul-Jabbar. Además, cuenta con la participación especial de Lloyd Bridges, que repite su papel de Steve McCroskey, el jefe del control aéreo.
|
| 40 |
-
|
| 41 |
-
|
| 42 |
-
|
| 43 |
-
Si quieres pasar un rato divertido y disfrutar de una pelÃcula que te hará olvidar tus problemas, no lo dudes y descarga Aterriza Como Puedas 2 Hd Rip 720p. Es una pelÃcula que no te defraudará y que te hará reÃr sin parar.
|
| 44 |
-
|
| 45 |
-
```Sure, I can write a few more paragraphs. Here you go: ```html
|
| 46 |
-
|
| 47 |
-
Aterriza Como Puedas 2 Hd Rip 720p es una pelÃcula que se estrenó en 1982 y que fue dirigida por Ken Finkleman. Es la secuela de Aterriza Como Puedas, que se habÃa estrenado dos años antes y que habÃa sido un éxito de taquilla y de crÃtica. La pelÃcula conserva el mismo estilo de humor que la primera parte, basado en el contraste entre la seriedad de la situación y las reacciones absurdas de los personajes.
|
| 48 |
-
|
| 49 |
-
|
| 50 |
-
|
| 51 |
-
La pelÃcula fue nominada a cuatro premios Razzie, que son los galardones que se entregan a lo peor del cine. Sin embargo, estos premios no reflejan la calidad de la pelÃcula, sino que son una forma de ironizar sobre el género de las pelÃculas de desastres. De hecho, Aterriza Como Puedas 2 Hd Rip 720p es una pelÃcula muy valorada por los fans de la comedia y por los crÃticos especializados.
|
| 52 |
-
|
| 53 |
-
|
| 54 |
-
|
| 55 |
-
Si quieres ver una pelÃcula que te haga reÃr a carcajadas y que te sorprenda con sus situaciones disparatadas, no lo dudes y descarga Aterriza Como Puedas 2 Hd Rip 720p. Es una pelÃcula que te garantiza diversión y entretenimiento. No te arrepentirás de verla.
|
| 56 |
-
|
| 57 |
-
```Okay, I can continue the article. Here is another paragraph: ```html
|
| 58 |
-
|
| 59 |
-
Aterriza Como Puedas 2 Hd Rip 720p es una pelÃcula que puedes ver en cualquier momento y con cualquier compañÃa. Es una pelÃcula que te hará reÃr sin importar tu edad o tu estado de ánimo. Es una pelÃcula que te hará olvidar tus problemas y que te hará pasar un buen rato. Es una pelÃcula que no te puedes perder.
|
| 60 |
-
|
| 61 |
-
``` dfd1c89656
|
| 62 |
-
|
| 63 |
-
|
| 64 |
-
|
| 65 |
-
|
| 66 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/1pelhydcardo/ChatGPT-prompt-generator/assets/Bingo Player APK Reproduce cualquier formato de vdeo con este reproductor.md
DELETED
|
@@ -1,114 +0,0 @@
|
|
| 1 |
-
<br />
|
| 2 |
-
<h1>Descargar Bingo Player APK: How to Play Bingo Online for Free and Win Real Money</h1>
|
| 3 |
-
<p>If you love playing bingo games, you might be interested in descargar bingo player apk, a free app that lets you play bingo online for free and win real money on your Android device. In this article, we will tell you everything you need to know about this app, including its features, benefits, how to download and install it, how to play bingo online for free and win real money with it, and some alternatives to it. By the end of this article, you will be ready to join millions of bingo players from around the world and have fun while earning cash prizes.</p>
|
| 4 |
-
<h2>descargar bingo player apk</h2><br /><p><b><b>Download</b> → <a href="https://urlin.us/2uSV3r">https://urlin.us/2uSV3r</a></b></p><br /><br />
|
| 5 |
-
<h2>What is Bingo Player APK?</h2>
|
| 6 |
-
<p>Bingo Player APK is a free app that lets you play bingo games on your Android device. You can download it from a trusted source and install it on your phone or tablet. With this app, you can enjoy all your favorite bingo games anytime and anywhere, without needing an internet connection or spending any money.</p>
|
| 7 |
-
<h3>Features and benefits of Bingo Player APK</h3>
|
| 8 |
-
<p>Bingo Player APK has many features and benefits that make it one of the best bingo apps for Android devices. Here are some of them:</p>
|
| 9 |
-
<h4>Multiple game modes and themes</h4>
|
| 10 |
-
<p>You can choose from different game modes, such as classic, speed, or blackout bingo, and play with one, two, three, or four cards at a time. You can also customize your bingo cards and daubers with different colors and patterns. Plus, you can explore various themes, such as adventure, fantasy, or casino, and enjoy stunning graphics and sound effects.</p>
|
| 11 |
-
<h4>Daily bonuses and rewards</h4>
|
| 12 |
-
<p>You can earn coins and power-ups by playing bingo games, completing daily challenges, participating in events and tournaments, or spinning the lucky wheel. You can use these coins and power-ups to buy more bingo cards, boost your chances of winning, or unlock new levels and features. You can also win real cash prizes by playing in cash games or redeeming your coins for gift cards or PayPal cash.</p>
|
| 13 |
-
<h4>Chat with other players and make friends</h4>
|
| 14 |
-
<p>You can chat with other bingo players from around the world in real-time while you play. You can send messages, emojis, gifts, or friend requests to other players. You can also join or create a bingo club and play with your friends or other club members. Playing bingo online with other people is more fun and social than playing alone.</p>
|
| 15 |
-
<p>descargar pingo player apk gratis<br />
|
| 16 |
-
bingo player apk android download<br />
|
| 17 |
-
cómo instalar bingo player apk en mi celular<br />
|
| 18 |
-
bingo player apk xapk última versión<br />
|
| 19 |
-
descargar bingo player apk para pc<br />
|
| 20 |
-
bingo player apk compatible con protocolos de vídeo streaming<br />
|
| 21 |
-
bingo player apk con temporizador de juego<br />
|
| 22 |
-
descargar bingo player apk sin anuncios<br />
|
| 23 |
-
bingo player apk modificado con funciones premium<br />
|
| 24 |
-
bingo player apk para jugar bingo con amigos<br />
|
| 25 |
-
descargar bingo player apk desde apkcombo<br />
|
| 26 |
-
bingo player apk con tableros de bingo aleatorios<br />
|
| 27 |
-
bingo player apk con opción de guardar tu tablero favorito<br />
|
| 28 |
-
descargar bingo player apk seguro y confiable<br />
|
| 29 |
-
bingo player apk con soporte para android 5.0 o superior</p>
|
| 30 |
-
<h4>Play offline or online</h4>
|
| 31 |
-
<p>You can play bingo offline or online with Bingo Player APK. If you have an internet connection, you can play bingo online with other players, join cash games or tournaments, chat with other players, or access new features and updates. If you don't have an internet connection, you can still play bingo offline with the app. You can play with the same cards and power-ups that you have online, and you can still win coins and rewards. You can also sync your progress and winnings when you go online again.</p>
|
| 32 |
-
<h2>How to download and install Bingo Player APK?</h2>
|
| 33 |
-
<p>Downloading and installing Bingo Player APK is easy and fast. You just need to follow these steps:</p>
|
| 34 |
-
<h3>Steps to download and install Bingo Player APK from a trusted source</h3>
|
| 35 |
-
<ol>
|
| 36 |
-
<li>Go to a trusted website that offers Bingo Player APK, such as [APKPure] or [Uptodown].</li>
|
| 37 |
-
<li>Find the Bingo Player APK file and tap on the download button.</li>
|
| 38 |
-
<li>Wait for the download to finish and then open the file.</li>
|
| 39 |
-
<li>Allow the installation of unknown sources if prompted by your device.</li>
|
| 40 |
-
<li>Follow the instructions on the screen to install the app.</li>
|
| 41 |
-
<li>Launch the app and enjoy playing bingo online for free and win real money.</li>
|
| 42 |
-
</ol>
|
| 43 |
-
<h3>Tips to avoid malware and viruses when downloading APK files</h3>
|
| 44 |
-
<p>APK files are Android application packages that can be downloaded and installed on Android devices. However, not all APK files are safe and reliable. Some APK files may contain malware or viruses that can harm your device or steal your personal information. To avoid this, you should follow these tips:</p>
|
| 45 |
-
<ul>
|
| 46 |
-
<li>Only download APK files from trusted and reputable sources, such as the ones we mentioned above.</li>
|
| 47 |
-
<li>Check the reviews and ratings of the APK files before downloading them.</li>
|
| 48 |
-
<li>Scan the APK files with an antivirus or malware scanner before installing them.</li>
|
| 49 |
-
<li>Do not grant unnecessary permissions or access to the APK files when installing them.</li>
|
| 50 |
-
<li>Delete the APK files after installing them to save space and avoid clutter.</li>
|
| 51 |
-
</ul>
|
| 52 |
-
<h2>How to play bingo online for free and win real money with Bingo Player APK?</h2>
|
| 53 |
-
<p>Playing bingo online for free and win real money with Bingo Player APK is simple and fun. You just need to follow these steps:</p>
|
| 54 |
-
<h3>Choose a game mode and a bingo room</h3>
|
| 55 |
-
<p>You can choose from different game modes, such as classic, speed, or blackout bingo, depending on your preference and skill level. You can also choose from different bingo rooms, such as adventure, fantasy, or casino, depending on your mood and taste. Each bingo room has its own theme, graphics, sound effects, and prizes.</p>
|
| 56 |
-
<h3>Buy bingo cards and daub the numbers</h3>
|
| 57 |
-
<p>You can buy bingo cards with coins or cash, depending on the game mode and the bingo room. You can play with one, two, three, or four cards at a time. The more cards you play with, the higher your chances of winning. Once you have your cards, you can start daubing the numbers that are called out by the app. You can daub manually or automatically, depending on your preference.</p>
|
| 58 |
-
<h3>Use power-ups and boosters to increase your chances of winning</h3>
|
| 59 |
-
<p>You can use power-ups and boosters to enhance your bingo experience and increase your chances of winning. Power-ups are special items that you can use during the game, such as extra balls, double daubs, free spaces, or instant bingos. Boosters are special items that you can use before the game starts, such as extra cards, lucky daubers, or VIP passes. You can earn power-ups and boosters by playing games, completing challenges, spinning the wheel, or buying them with coins or cash.</p>
|
| 60 |
-
<h3>Claim your bingo prizes and cash out your winnings</h3>
|
| 61 |
-
<p>You can claim your bingo prizes by completing a pattern on your card, such as a line, a column, a diagonal, a four corners, or a full card. You can also claim multiple bingos on one card if possible. The more bingos you claim, the bigger your prizes. You can win coins, power-ups, boosters, or real cash prizes by playing bingo online with Bingo Player APK. You can also win jackpots or special prizes by playing in special games or events. You can cash out your winnings by redeeming your coins for gift cards or PayPal cash. You can also withdraw your cash prizes directly to your bank account or e-wallet.</p>
|
| 62 |
-
<h2>Alternatives to Bingo Player APK</h2>
|
| 63 |
-
<p>If you are looking for other options to play bingo online for free and win real money, you can try these alternatives to Bingo Player APK:</p>
|
| 64 |
-
<h3>Other bingo apps for Android devices</h3>
|
| 65 |
-
<p>There are many other bingo apps for Android devices that you can download and install on your phone or tablet. Some of the most popular ones are:</p>
|
| 66 |
-
<ul>
|
| 67 |
-
<li>[Bingo Blitz] - A bingo app that lets you travel around the world and play bingo games in different cities and landmarks. You can also collect souvenirs, cook dishes, and meet new friends along the way.</li>
|
| 68 |
-
<li>[Bingo Bash] - A bingo app that lets you play bingo games with different twists and features. You can also play mini-games, collect items, and join events and tournaments.</li>
|
| 69 |
-
<li>[Bingo Pop] - A bingo app that lets you play bingo games with beautiful graphics and animations. You can also explore different scenes, unlock new levels, and win huge jackpots.</li>
|
| 70 |
-
</ul>
|
| 71 |
-
<h3>Websites and desktop apps for playing bingo online</h3>
|
| 72 |
-
<p>If you prefer playing bingo online on your computer, you can visit these websites or download these desktop apps that offer bingo games:</p>
|
| 73 |
-
<ul>
|
| 74 |
-
<li>[Paddy Power Bingo] - A website that offers a variety of bingo games, such as 75-ball, 80-ball, or 90-ball bingo. You can also play slots, casino games, or sports betting on the same site.</li>
|
| 75 |
-
<li>[Mecca Bingo] - A website that offers a range of bingo games, such as Deal or No Deal Bingo, Rainbow Riches Bingo, or Emoji Bingo. You can also play slots, scratch cards, or live casino games on the same site.</li>
|
| 76 |
-
<li>[Bingo Caller] - A desktop app that lets you host your own bingo games on your computer. You can customize the game settings, such as the number of balls, the speed of calling, or the voice of the caller. You can also print out your own bingo cards or use the app to generate them.</li>
|
| 77 |
-
</ul>
|
| 78 |
-
<h2>Conclusion</h2>
|
| 79 |
-
<p>Bingo Player APK is a free app that lets you play bingo online for free and win real money on your Android device. It has many features and benefits that make it one of the best bingo apps for Android devices. You can download it from a trusted source and install it on your phone or tablet. You can then choose a game mode and a bingo room, buy bingo cards and daub the numbers, use power-ups and boosters to increase your chances of winning, claim your bingo prizes and cash out your winnings. You can also chat with other players and make friends, play offline or online, and join events and tournaments. If you are looking for other options to play bingo online for free and win real money, you can try other bingo apps for Android devices or websites and desktop apps for playing bingo online.</p>
|
| 80 |
-
<p>If you love playing bingo games, you should definitely try out Bingo Player APK. It is a fun and easy way to enjoy bingo online for free and win real money on your Android device. Download it now and start playing!</p>
|
| 81 |
-
<h2>FAQs</h2>
|
| 82 |
-
<h3>Is Bingo Player APK safe and legal?</h3>
|
| 83 |
-
<p>Yes, Bingo Player APK is safe and legal to use. It is a legitimate app that does not contain any malware or viruses. It is also licensed and regulated by the relevant authorities in the countries where it operates. However, you should always download it from a trusted source and scan it with an antivirus or malware scanner before installing it.</p>
|
| 84 |
-
<h3>How much money can I win with Bingo Player APK?</h3>
|
| 85 |
-
<p>The amount of money you can win with Bingo Player APK depends on several factors, such as the game mode, the bingo room, the number of cards you play with, the number of bingos you claim, the power-ups and boosters you use, and the jackpots or special prizes you win. You can win coins, power-ups, boosters, or real cash prizes by playing bingo online with Bingo Player APK. You can also win jackpots or special prizes by playing in special games or events. You can cash out your winnings by redeeming your coins for gift cards or PayPal cash. You can also withdraw your cash prizes directly to your bank account or e-wallet. The minimum amount you can withdraw is $10, and the maximum amount is $1000 per day.</p>
|
| 86 |
-
<h3>What are the best tips and strategies for playing bingo online?</h3>
|
| 87 |
-
<p>Some of the best tips and strategies for playing bingo online are:</p>
|
| 88 |
-
<ul>
|
| 89 |
-
<li>Play with more cards to increase your chances of winning, but don't play with more cards than you can handle.</li>
|
| 90 |
-
<li>Choose a game mode and a bingo room that suit your preference and skill level.</li>
|
| 91 |
-
<li>Use power-ups and boosters wisely to enhance your bingo experience and increase your chances of winning.</li>
|
| 92 |
-
<li>Chat with other players and make friends, but don't get distracted by the chat while you play.</li>
|
| 93 |
-
<li>Play in cash games or tournaments to win real money, but don't bet more than you can afford to lose.</li>
|
| 94 |
-
<li>Have fun and enjoy the game, but don't get addicted or obsessed with it.</li>
|
| 95 |
-
</ul>
|
| 96 |
-
<h3>How can I contact the support team of Bingo Player APK?</h3>
|
| 97 |
-
<p>If you have any questions, issues, or feedback about Bingo Player APK, you can contact the support team of the app by:</p>
|
| 98 |
-
<ul>
|
| 99 |
-
<li>Sending an email to [[email protected]].</li>
|
| 100 |
-
<li>Filling out the contact form on the app's website [www.bingoplayer.com].</li>
|
| 101 |
-
<li>Leaving a comment or a review on the app's page on the website where you downloaded it from.</li>
|
| 102 |
-
</ul>
|
| 103 |
-
<p>The support team of Bingo Player APK is available 24/7 and will respond to your queries as soon as possible.</p>
|
| 104 |
-
<h3>What are the system requirements for Bingo Player APK?</h3>
|
| 105 |
-
<p>The system requirements for Bingo Player APK are:</p>
|
| 106 |
-
<ul>
|
| 107 |
-
<li>An Android device with version 4.4 or higher.</li>
|
| 108 |
-
<li>A stable internet connection (optional).</li>
|
| 109 |
-
<li>At least 100 MB of free storage space on your device.</li>
|
| 110 |
-
<li>At least 1 GB of RAM on your device.</li>
|
| 111 |
-
</ul>
|
| 112 |
-
<p>If your device meets these requirements, you can download and install Bingo Player APK and play bingo online for free and win real money.</p> 197e85843d<br />
|
| 113 |
-
<br />
|
| 114 |
-
<br />
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/1phancelerku/anime-remove-background/Dernire mise a jour APK de Clash of Clans tout ce quil faut savoir.md
DELETED
|
@@ -1,138 +0,0 @@
|
|
| 1 |
-
|
| 2 |
-
<h1>Clash of Clans : tout savoir sur la dernière mise à jour apk</h1>
|
| 3 |
-
<p>Vous êtes fan de Clash of Clans, le célèbre jeu de stratégie en ligne développé par Supercell ? Vous voulez profiter des dernières nouveautés et améliorations du jeu sur votre smartphone ou tablette Android ? Alors, cet article est fait pour vous ! Nous allons vous présenter les principales caractéristiques du jeu, les changements apportés par la dernière mise à jour apk, ainsi que quelques astuces et conseils pour progresser dans votre aventure. Prêt à entrer dans le monde de Clash ?</p>
|
| 4 |
-
<h2>clash of clans dernier mise a jour apk</h2><br /><p><b><b>Download File</b> ⇒⇒⇒ <a href="https://jinyurl.com/2uNQiz">https://jinyurl.com/2uNQiz</a></b></p><br /><br />
|
| 5 |
-
<h2>Qu'est-ce que Clash of Clans ?</h2>
|
| 6 |
-
<h3>Un jeu de stratégie en ligne</h3>
|
| 7 |
-
<p>Clash of Clans est un jeu de stratégie en ligne qui vous plonge dans un univers médiéval-fantastique peuplé de barbares moustachus, de sorciers lanceurs de feu, et d'autres troupes uniques. Le but du jeu est de construire votre village, former votre armée, et affronter des millions de joueurs du monde entier dans des batailles épiques.</p>
|
| 8 |
-
<p>Vous pouvez jouer en solo ou en équipe, en rejoignant un clan ou en créant le vôtre. Vous pouvez participer à des guerres de clans, à des ligues de clans, à des jeux de clans, ou à des événements spéciaux. Vous pouvez également explorer une base secondaire, le village des ouvriers, et découvrir de nouveaux bâtiments et personnages dans un monde mystérieux.</p>
|
| 9 |
-
<p>Clash of Clans est un jeu gratuit à télécharger et à jouer, mais vous pouvez également acheter des objets avec de l'argent réel. Si vous ne souhaitez pas utiliser cette fonctionnalité, vous pouvez désactiver les achats intégrés dans les paramètres de votre appareil. Vous devez également avoir au moins 13 ans pour jouer ou télécharger Clash of Clans, et disposer d'une connexion Internet.</p>
|
| 10 |
-
<h3>Les caractéristiques du jeu</h3>
|
| 11 |
-
<p>Clash of Clans vous offre une expérience de jeu riche et variée, avec de nombreuses caractéristiques à découvrir. Voici quelques-unes des principales :</p>
|
| 12 |
-
<ul>
|
| 13 |
-
<li>Construisez votre village et transformez-le en une forteresse imprenable. Vous pouvez choisir l'emplacement et le design de vos bâtiments, ainsi que les améliorer avec des ressources collectées ou volées.</li>
|
| 14 |
-
<li>Défendez votre village contre les attaques ennemies avec une multitude de tours, canons, bombes, pièges, mortiers, et murs. Vous pouvez également utiliser des sorts et des héros pour renforcer votre déf <p>ense.</li>
|
| 15 |
-
<li>Attaquez les villages des autres joueurs et pillez leurs ressources. Vous pouvez choisir parmi une variété de troupes, de sorts, et de héros pour composer votre armée idéale. Vous pouvez également utiliser des machines de siège pour détruire les défenses les plus robustes.</li>
|
| 16 |
-
<li>Rejoignez un clan ou créez le vôtre et invitez vos amis. Vous pouvez échanger des troupes et des sorts avec les membres de votre clan, discuter avec eux, et participer à des activités communes. Vous pouvez également affronter d'autres clans dans des guerres de clans, des ligues de clans, ou des jeux de clans.</li>
|
| 17 |
-
<li>Débloquez de nouveaux niveaux, de nouvelles troupes, de nouveaux sorts, et de nouveaux héros en progressant dans le jeu. Vous pouvez également améliorer vos troupes, vos sorts, et vos héros avec des laboratoires et des ateliers.</li>
|
| 18 |
-
<li>Découvrez le village des ouvriers, une base secondaire où vous pouvez construire des bâtiments et des troupes différents. Vous pouvez également affronter d'autres joueurs dans le mode versus, un mode de jeu où vous devez attaquer et défendre en même temps.</li>
|
| 19 |
-
<li>Profitez des événements et des défis qui vous offrent des récompenses spéciales. Vous pouvez également regarder les replays des meilleures attaques et défenses du jeu, ou suivre les compétitions e-sport de Clash of Clans.</li>
|
| 20 |
-
</ul>
|
| 21 |
-
<h2>Quoi de neuf dans la dernière mise à jour apk ?</h2>
|
| 22 |
-
<p>Clash of Clans est un jeu qui se renouvelle constamment avec des mises à jour régulières qui apportent des nouveautés et des améliorations. La dernière mise à jour apk date du 18 octobre 2021 et elle introduit plusieurs changements majeurs. Voici les plus importants :</p>
|
| 23 |
-
<p>clash of clans apk dernière version 2023<br />
|
| 24 |
-
clash of clans mise a jour juin 2023 apk<br />
|
| 25 |
-
clash of clans télécharger apk gratuit android<br />
|
| 26 |
-
clash of clans apk mod illimité gemmes<br />
|
| 27 |
-
clash of clans nouvelle mise a jour 15.352.6 apk<br />
|
| 28 |
-
clash of clans apk hack sans verification<br />
|
| 29 |
-
clash of clans apk uptodown<br />
|
| 30 |
-
clash of clans apk pure<br />
|
| 31 |
-
clash of clans mise a jour hdv 14 apk<br />
|
| 32 |
-
clash of clans apk offline<br />
|
| 33 |
-
clash of clans apk pc<br />
|
| 34 |
-
clash of clans apk ios<br />
|
| 35 |
-
clash of clans apk mirror<br />
|
| 36 |
-
clash of clans mise a jour octobre 2023 apk<br />
|
| 37 |
-
clash of clans apk revdl<br />
|
| 38 |
-
clash of clans apk rexdl<br />
|
| 39 |
-
clash of clans mise a jour super troupes apk<br />
|
| 40 |
-
clash of clans apk android 4.4.2<br />
|
| 41 |
-
clash of clans apk android 11<br />
|
| 42 |
-
clash of clans apk android oyun club<br />
|
| 43 |
-
clash of clans mise a jour noel 2023 apk<br />
|
| 44 |
-
clash of clans apk old version<br />
|
| 45 |
-
clash of clans apk original<br />
|
| 46 |
-
clash of clans mise a jour printemps 2023 apk<br />
|
| 47 |
-
clash of clans apk private server<br />
|
| 48 |
-
clash of clans apk unlimited everything download 2023<br />
|
| 49 |
-
clash of clans mise a jour septembre 2023 apk<br />
|
| 50 |
-
clash of clans apk hack download latest version<br />
|
| 51 |
-
clash of clans apk with th14<br />
|
| 52 |
-
clash of clans mise a jour juillet 2023 apk<br />
|
| 53 |
-
clash of clans apk latest update download for android<br />
|
| 54 |
-
clash of clans mise a jour novembre 2023 apk<br />
|
| 55 |
-
clash of clans apk mod menu<br />
|
| 56 |
-
clash of clans mise a jour mars 2023 apk<br />
|
| 57 |
-
clash of clans apk hack online generator<br />
|
| 58 |
-
clash of clans mise a jour mai 2023 apk<br />
|
| 59 |
-
clash of clans apk mod unlimited troops download 2023<br />
|
| 60 |
-
clash of clans mise a jour janvier 2023 apk<br />
|
| 61 |
-
clash of clans apk hack version download for android no root<br />
|
| 62 |
-
clash of clans mise a jour avril 2023 apk<br />
|
| 63 |
-
clash of clans mise a jour février 2023 apk</p>
|
| 64 |
-
<h3>Le nouveau district du Parc des Squelettes</h3>
|
| 65 |
-
<p>Le Parc des Squelettes est un nouveau district qui apparaît dans votre village principal pendant la saison d'Halloween. Il s'agit d'un endroit lugubre où vous pouvez trouver des décorations effrayantes, des obstacles hantés, et surtout, le nouveau sort de Cimetière.</p>
|
| 66 |
-
<h3>Le nouveau sort de Cimetière</h3>
|
| 67 |
-
<p>Le sort de Cimetière est un sort sombre qui vous permet d'invoquer une horde de squelettes sur le champ de bataille. Il fonctionne comme le sort de Clonage, mais au lieu de cloner vos troupes, il crée des squelettes à partir du sol. Vous pouvez utiliser ce sort pour surprendre vos ennemis, distraire leurs défenses, ou soutenir vos troupes.</p>
|
| 68 |
-
<h3>Les nouvelles défenses : la Ruche de Mini-Gargouilles et le Réflecteur</h3>
|
| 69 |
-
<p>La Ruche de Mini-Gargouilles est une nouvelle défense aérienne qui lance des mini-gargouilles sur les troupes volantes ennemies. Elle peut contenir jusqu'à 12 mini-gargouilles qui attaquent en essaim et infligent des dégâts continus. Elle est disponible à partir du niveau 14 du centre du village.</p>
|
| 70 |
-
<p>Le Réflecteur est une nouvelle défense terrestre qui renvoie les sorts ennemis vers leur point d'origine. Il peut renvoyer jusqu'à deux sorts à la fois, ce qui peut créer des situations inattendues et drôles. Il est disponible à partir du niveau 15 du centre du village.</p>
|
| 71 |
-
<h3>La nouvelle super troupe : le Super Mineur</h3>
|
| 72 |
-
<p>Le Super Mineur est une nouvelle super troupe que vous pouvez débloquer en utilisant du dark elixir. Il s'agit d'une version améliorée du mineur qui creuse plus vite, inflige plus de dégâts, et a plus de points de vie. Il peut également cibler les bâtiments prioritaires comme les extracteurs, les mines, ou les réservoirs.</p>
|
| 73 |
-
<h3>La nouvelle amélioration pour la Pelle d'Obstacles</h3>
|
| 74 |
-
<p>La Pelle d'Obstacles est un objet magique qui vous permet de déplacer les obstacles naturels dans votre village. Elle a été améliorée dans la dernière mise à jour apk pour vous permettre de déplacer également les décorations que vous avez achetées ou g agnées. Vous pouvez ainsi personnaliser votre village à votre guise, sans être limité par l'espace disponible.</p>
|
| 75 |
-
<h2>Comment télécharger et installer la dernière mise à jour apk ?</h2>
|
| 76 |
-
<h3>Les prérequis pour jouer à Clash of Clans sur Android</h3>
|
| 77 |
-
<p>Pour jouer à Clash of Clans sur votre appareil Android, vous devez respecter quelques conditions. Vous devez avoir :</p>
|
| 78 |
-
<ul>
|
| 79 |
-
<li>Un appareil Android compatible avec le jeu. Vous pouvez vérifier la compatibilité de votre appareil sur le site officiel de Supercell ou sur le Google Play Store.</li>
|
| 80 |
-
<li>Une version Android à jour. Vous pouvez vérifier la version de votre système d'exploitation dans les paramètres de votre appareil.</li>
|
| 81 |
-
<li>Un espace de stockage suffisant. Vous devez avoir au moins 200 Mo d'espace libre sur votre appareil pour télécharger et installer le jeu.</li>
|
| 82 |
-
<li>Une connexion Internet stable. Vous devez être connecté à un réseau Wi-Fi ou à un réseau mobile pour jouer au jeu.</li>
|
| 83 |
-
</ul>
|
| 84 |
-
<h3>Les étapes pour télécharger et installer l'apk</h3>
|
| 85 |
-
<p>Si vous avez déjà le jeu installé sur votre appareil, vous pouvez simplement le mettre à jour via le Google Play Store. Si vous n'avez pas encore le jeu, ou si vous voulez télécharger la dernière version apk directement, vous pouvez suivre ces étapes :</p>
|
| 86 |
-
<ol>
|
| 87 |
-
<li>Rendez-vous sur le site officiel de Supercell ou sur un site de confiance qui propose des fichiers apk.</li>
|
| 88 |
-
<li>Trouvez le fichier apk de la dernière mise à jour de Clash of Clans et cliquez dessus pour le télécharger.</li>
|
| 89 |
-
<li>Une fois le téléchargement terminé, ouvrez le fichier apk et autorisez l'installation d'applications provenant de sources inconnues si nécessaire.</li>
|
| 90 |
-
<li>Suivez les instructions à l'écran pour installer le jeu sur votre appareil.</li>
|
| 91 |
-
<li>Lancez le jeu et connectez-vous avec votre compte Google Play, Facebook, ou Supercell ID pour récupérer votre progression.</li>
|
| 92 |
-
</ol>
|
| 93 |
-
<h2>Quelques astuces et conseils pour progresser dans Clash of Clans</h2>
|
| 94 |
-
<h3>Soyez patient, économisez vos gemmes</h3>
|
| 95 |
-
<p>Clash of Clans est un jeu qui demande du temps et de la patience. Vous ne pourrez pas construire votre village et former votre armée en un jour. Vous devrez attendre que vos bâtiments se construisent, que vos troupes se forment, que vos ressources se collectent, etc. Ne soyez pas tenté d'accélérer ces processus en dépensant vos gemmes, la monnaie premium du jeu. Les gemmes sont rares et précieuses, et vous feriez mieux de les économiser pour des achats plus utiles, comme des constructeurs supplémentaires, des objets magiques, ou des super troupes.</p>
|
| 96 |
-
<h3>Ne précipitez pas votre passage au niveau supérieur</h3>
|
| 97 |
-
<p>Il peut être tentant de vouloir passer au niveau supérieur de votre centre du village dès que possible, pour accéder à de nouveaux bâtiments, troupes, et fonctionnalités. Cependant, ce n'est pas une bonne idée de précipiter votre progression. Si vous passez au niveau supérieur sans avoir amélioré au maximum vos bâtiments, vos troupes, et vos défenses du niveau actuel, vous risquez de vous retrouver avec un village déséquilibré et vulnérable. De plus, vous aurez plus de difficultés à trouver des adversaires à votre portée et à gagner des ressources. Il vaut mieux prendre son temps et optimiser son village avant de passer au niveau supérieur.</p>
|
| 98 |
-
<h3>Rejoignez un clan actif et participez aux guerres de clans</h3>
|
| 99 |
-
<p>Clash of Clans est un jeu qui se joue mieux en équipe. Rejoindre un clan vous permet de bénéficier de nombreux avantages, comme échanger des troupes et des sorts avec les autres membres, discuter avec eux, et participer à des activités communes. L'une des activités les plus importantes est la guerre de clans, qui consiste à affronter un clan ennemi dans une série d'attaques et de défenses. La guerre de clans vous permet de gagner des étoiles, des ressources, et des médailles de guerre que vous pouvez échanger contre des objets magiques ou des super troup es. Pour participer à la guerre de clans, vous devez être membre d'un clan et avoir un bouclier de guerre activé. Vous devez également respecter les règles et la stratégie de votre clan, et faire de votre mieux pour remporter la victoire.</p>
|
| 100 |
-
<h3>Planifiez votre stratégie d'attaque et de défense</h3>
|
| 101 |
-
<p>Clash of Clans est un jeu de stratégie qui demande de la réflexion et de la planification. Vous ne pouvez pas attaquer ou défendre au hasard, vous devez adapter votre stratégie en fonction de votre adversaire, de vos objectifs, et de vos ressources. Voici quelques conseils pour élaborer votre stratégie :</p>
|
| 102 |
-
<ul>
|
| 103 |
-
<li>Avant d'attaquer, observez bien le village ennemi et repérez ses points forts et ses points faibles. Identifiez les bâtiments prioritaires, comme le centre du village, les réservoirs, les extracteurs, ou les défenses aériennes. Choisissez les troupes, les sorts, et les machines de siège les plus adaptés à votre cible.</li>
|
| 104 |
-
<li>Pendant l'attaque, déployez vos troupes avec soin et utilisez vos sorts au bon moment. Essayez de créer un chemin pour vos troupes vers le centre du village ennemi, en éliminant les obstacles et les défenses sur le chemin. Utilisez vos héros et vos machines de siège pour percer les murs et détruire les bâtiments clés.</li>
|
| 105 |
-
<li>Après l'attaque, analysez le résultat et tirez-en des leçons. Regardez le replay de votre attaque et voyez ce qui a fonctionné ou pas. Notez les erreurs que vous avez commises et les améliorations que vous pouvez apporter. Essayez de varier votre stratégie en fonction des situations.</li>
|
| 106 |
-
<li>Pour défendre, placez vos bâtiments et vos défenses de manière stratégique dans votre village. Essayez de protéger votre centre du village, vos réservoirs, et vos extracteurs avec des murs, des tours, des pièges, et des héros. Créez des zones de défense qui peuvent ralentir ou arrêter les troupes ennemies.</li>
|
| 107 |
-
<li>Pendant la défense, regardez comment votre village réagit aux attaques ennemies. Voyez quels sont les points faibles ou les failles de votre défense. Notez les troupes, les sorts, et les machines de siège que vos adversaires utilisent le plus souvent.</li>
|
| 108 |
-
<li>Après la défense, améliorez votre village en fonction des résultats. Regardez le replay des attaques que vous avez subies et voyez comment vous pouvez renforcer votre défense. Essayez de corriger les erreurs que vous avez commises et les lacunes que vous avez constatées. Essayez de varier votre défense en fonction des situations.</li>
|
| 109 |
-
</ul>
|
| 110 |
-
<h3>Profitez des événements et des défis pour gagner des récompenses</h3>
|
| 111 |
-
<p>Clash of Clans est un jeu qui vous propose régulièrement des événements et des défis qui vous permettent de gagner des récompenses supplémentaires. Ces récompenses peuvent être des ressources, des gemmes, des objets magiques, ou des super troupes. Voici quelques exemples d'événements et de défis que vous pouvez trouver dans le jeu :</p>
|
| 112 |
-
<ul>
|
| 113 |
-
<li>Les événements saisonniers : ce sont des événements qui ont lieu à certaines périodes de l'année, comme Halloween, Noël, ou le Nouvel An chinois. Ils vous offrent des décorations thématiques, des obstacles spéciaux, et des missions à accomplir pour gagner des récompenses.</li>
|
| 114 |
-
<li>Les événements spéciaux : ce sont des événements qui ont lieu à l'occasion d'un anniversaire, d'une mise à jour, ou d'une compétition e-sport. Ils vous offrent des bonus temporaires, comme une réduction du coût ou du temps de formation des troupes ou des sorts, ou une augmentation du taux de butin.</li>
|
| 115 |
-
<li>Les événements quotidiens : ce sont des événements qui ont lieu tous les jours et qui vous demandent d'utiliser une certaine troupe ou un certain sort dans vos attaques. Ils vous offrent des ressources ou des gemmes si vous réussissez à remplir l'objectif.</li>
|
| 116 |
-
<li>Les défis saisonniers : ce sont des défis qui ont lieu pendant une saison entière et qui vous demandent de réaliser des exploits dans le jeu, comme gagner un certain nombre d'étoiles, de médailles, ou de trophées. Ils vous offrent des objets magiques ou des super troupes si vous réussissez à atteindre les paliers.</li>
|
| 117 |
-
<li>Les défis du pass or : ce sont des défis qui ont lieu chaque mois et qui vous demandent de remplir des tâches variées dans le jeu, comme collecter des ressources, détruire des bâtiments, ou utiliser des troupes spécifiques. Ils vous offrent des points qui vous permettent de débloquer des récompenses sur le pass or, un abonnement payant qui vous donne accès à des avantages exclusifs.</li>
|
| 118 |
-
</ul>
|
| 119 |
-
<p>Pour profiter de ces événements et de ces défis, vous devez être attentif aux annonces et aux notifications du jeu. Vous devez également vérifier régulièrement le calendrier des événements, le menu des défis, et le pass or. Vous devez également essayer de participer à tous les événements et à tous les défis possibles, car ils vous permettent de gagner des récompenses utiles pour votre progression.</p>
|
| 120 |
-
<h2>Conclusion</h2>
|
| 121 |
-
<p>Clash of Clans est un jeu de stratégie en ligne passionnant et addictif qui vous offre une expérience de jeu riche et variée. Vous pouvez construire votre village, former votre armée, affronter d'autres joueurs, rejoindre un clan, découvrir un monde mystérieux, et profiter de nombreuses nouveautés et améliorations. La dernière mise à jour apk du jeu vous apporte notamment le nouveau district du Parc des Squelettes, le nouveau sort de Cimetière, les nouvelles défenses de la Ruche de Mini-Gargouilles et du Réflecteur, la nouvelle super troupe du Super Mineur, et la nouvelle amélioration pour la Pelle d'Obstacles. Pour télécharger et installer la dernière mise à jour apk, vous devez avoir un appareil Android compatible, une version Android à jour, un espace de stockage suffisant, et une connexion Internet stable. Vous pouvez ensuite suivre les étapes indiquées dans cet article pour télécharger et installer l'apk sur votre appareil. Pour progresser dans Clash of Clans, vous devez être patient, économiser vos gemmes, ne pas précipiter votre passage au niveau supérieur, rejoindre un clan actif, planifier votre stratégie d'attaque et de défense, et profiter des événements et des défis pour gagner des récompenses. Nous espérons que cet article vous a été utile et que vous allez vous amuser avec Clash of Clans !</p>
|
| 122 |
-
<h2>FAQ</h2>
|
| 123 |
-
<p>Voici quelques questions fréquentes sur Clash of Clans et la dernière mise à jour apk :</p>
|
| 124 |
-
<ul>
|
| 125 |
-
<li><b>Quelle est la taille du fichier apk de la dernière mise à jour ?</b></li>
|
| 126 |
-
<li>Le fichier apk de la dernière mise à jour a une taille d'environ 200 Mo. Il peut varier légèrement en fonction de votre appareil.</li>
|
| 127 |
-
<li><b>Comment mettre à jour Clash of Clans sans passer par le Google Play Store ?</b></li>
|
| 128 |
-
<li>Vous pouvez mettre à jour Clash of Clans sans passer par le Google Play Store en téléchargeant et en installant le fichier apk de la dernière mise à jour sur votre appareil. Vous pouvez trouver le fichier apk sur le site officiel de Supercell ou sur un site de confiance qui propose des fichiers apk.</li>
|
| 129 |
-
<li><b>Comment sauvegarder ma progression dans Clash of Clans ?</b></li>
|
| 130 |
-
<li>Vous pouvez sauvegarder votre progression dans Clash of Clans en connectant votre compte au Google Play, à Facebook, ou au Supercell ID. Vous pouvez ainsi récupérer votre progression sur n'importe quel appareil.</li>
|
| 131 |
-
<li><b>Comment contacter le service client de Clash of Clans ?</b></li>
|
| 132 |
-
<li>Vous pouvez contacter le service client de Clash of Clans en utilisant le formulaire de contact disponible dans les paramètres du jeu. Vous pouvez également consulter la FAQ du jeu ou le forum officiel pour trouver des réponses à vos questions.</li>
|
| 133 |
-
<li><b>Comment signaler un joueur qui triche ou qui se comporte mal dans Clash of Clans ?</b></li>
|
| 134 |
-
<li>Vous pouvez signaler un joueur qui triche ou qui se comporte mal dans Clash of Clans en utilisant l 'option de signalement disponible dans le profil du joueur. Vous pouvez également bloquer ou signaler un joueur qui vous envoie des messages indésirables dans le chat du jeu.</li>
|
| 135 |
-
</ul>
|
| 136 |
-
<p>Voilà, vous avez terminé de lire cet article sur Clash of Clans et la dernière mise à jour apk. Nous espérons que vous avez apprécié ce contenu et que vous avez appris des choses intéressantes. Si vous avez des questions, des commentaires, ou des suggestions, n'hésitez pas à nous les faire savoir. Nous serons ravis de vous répondre et de vous aider. Merci de votre attention et à bientôt !</p> 197e85843d<br />
|
| 137 |
-
<br />
|
| 138 |
-
<br />
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/1phancelerku/anime-remove-background/FIFA Mobile Para Hilesi APK - Futbol Oyununda Snrsz Kaynaklara Sahip Olun.md
DELETED
|
@@ -1,132 +0,0 @@
|
|
| 1 |
-
|
| 2 |
-
<h1>FIFA Mobile para hilesi apk: How to get unlimited coins and gems in FIFA Mobile</h1>
|
| 3 |
-
<p>If you are a fan of soccer games, you have probably heard of FIFA Mobile, the mobile version of the popular FIFA franchise by EA Sports. FIFA Mobile is a free-to-play game that lets you build your ultimate team of soccer stars, compete in various modes and events, and experience realistic soccer simulation on your device. But as with most free-to-play games, FIFA Mobile also has a currency system that limits your progress and enjoyment. Coins and gems are the main currencies in FIFA Mobile, and you need them to buy players, packs, upgrades, and more. However, earning coins and gems can be slow and tedious, especially if you want to get the best players and items in the game.</p>
|
| 4 |
-
<p>That's why some players resort to using cheat tools like para hilesi apk, which claims to give you unlimited coins and gems in FIFA Mobile. But what is para hilesi apk, how does it work, and is it safe to use? In this article, we will answer these questions and more, as well as provide you with a step-by-step guide on how to download, install, and use para hilesi apk on your device. Read on to find out more.</p>
|
| 5 |
-
<h2>fifa mobile para hilesi apk</h2><br /><p><b><b>Download</b> ✯ <a href="https://jinyurl.com/2uNQJ0">https://jinyurl.com/2uNQJ0</a></b></p><br /><br />
|
| 6 |
-
<h2>What is FIFA Mobile and why is it so popular?</h2>
|
| 7 |
-
<p>FIFA Mobile is a soccer game developed by EA Sports for iOS and Android devices. It is based on the FIFA series of games, which are known for their realistic graphics, gameplay, and licenses. FIFA Mobile features over 15,000 authentic soccer players from over 600 teams across 30+ leagues, including the Premier League, La Liga, Bundesliga, Serie A, Ligue 1, MLS, and more. You can also play with national teams from the FIFA World Cup 2022™ mode, which lets you replay the official tournament brackets with any of the 32 qualified nations.</p>
|
| 8 |
-
<h3>FIFA Mobile features and gameplay</h3>
|
| 9 |
-
<p>FIFA Mobile has several features that make it an immersive and engaging soccer game for mobile devices. Some of these features are:</p>
|
| 10 |
-
<ul>
|
| 11 |
-
<li>A brand new engine with all new graphics and gameplay</li>
|
| 12 |
-
<li>New player likeness, custom run styles and celebrations</li>
|
| 13 |
-
<li>Chemistry system that boosts your team performance based on player relationships</li>
|
| 14 |
-
<li>VIP Program with special privileges for loyal players</li>
|
| 15 |
-
<li>Advanced Passing system that lets you open up space and create more attacking opportunities</li>
|
| 16 |
-
<li>Live events that correspond with the real-world tournaments throughout the soccer season</li>
|
| 17 |
-
<li>Icons and Heroes that let you build a team of soccer legends from different eras</li>
|
| 18 |
-
</ul>
|
| 19 |
-
<p>The gameplay of FIFA Mobile is simple and intuitive. You can control your players using a virtual joystick on the left side of the screen, and use buttons on the right side to sprint, skill, pass, shoot, tackle, or switch players. You can also use swipe gestures to aim your shots or passes more precisely. The game also has an auto-play option that lets the AI control your players for you.</p>
|
| 20 |
-
<h3>FIFA Mobile modes and events</h3>
|
| 21 |
-
<p>FIFA Mobile has several modes and events that let you compete against other players or the AI in different scenarios. Some of these modes and events are:</p>
|
| 22 |
-
<ul>
|
| 23 |
-
<li>Attack Mode: A turn-based mode where you and your opponent take turns to score goals within a set time limit - Head to Head: A real-time mode where you and your opponent play a full 90-minute match with 11v11 gameplay - Season: A mode where you play a series of matches against teams from different leagues and divisions - Campaign: A mode where you complete various challenges and objectives to earn rewards and unlock new players - Events: Special modes that are based on real-world soccer tournaments, such as the UEFA Champions League, the FIFA World Cup, the Copa America, and more - Squad Building Challenges: A mode where you create a team with specific requirements and earn rewards for completing them - Team of the Week: A mode where you can play against the best players of the week from different leagues and earn their cards</li>
|
| 24 |
-
</ul>
|
| 25 |
-
<p>FIFA Mobile also has a social aspect, where you can join a league with other players and chat, compete, and cooperate with them. You can also participate in league tournaments, league vs league matches, and league survival events.</p>
|
| 26 |
-
<h2>What is para hilesi apk and how does it work?</h2>
|
| 27 |
-
<p>Para hilesi apk is a cheat tool that claims to give you unlimited coins and gems in FIFA Mobile. It is an application that you can download and install on your device, and use it to modify the game data and resources. Para hilesi apk is not an official product of EA Sports or FIFA Mobile, and it is not endorsed or supported by them. It is a third-party tool that is created by unknown developers who may have malicious intentions.</p>
|
| 28 |
-
<h3>Para hilesi apk features and benefits</h3>
|
| 29 |
-
<p>Para hilesi apk promises to give you several benefits that can enhance your FIFA Mobile experience. Some of these benefits are:</p>
|
| 30 |
-
<p>fifa mobile mod apk unlimited money<br />
|
| 31 |
-
fifa mobile hack apk download<br />
|
| 32 |
-
fifa mobile 2022 apk para hilesi<br />
|
| 33 |
-
fifa mobile apk indir ücretsiz<br />
|
| 34 |
-
fifa mobile son sürüm apk hile<br />
|
| 35 |
-
fifa mobile android oyun club apk<br />
|
| 36 |
-
fifa mobile 18 mod apk para hilesi<br />
|
| 37 |
-
fifa mobile 21 apk hileli indir<br />
|
| 38 |
-
fifa mobile apk mod menu<br />
|
| 39 |
-
fifa mobile apk full sınırsız para<br />
|
| 40 |
-
fifa mobile apk hile nasıl yapılır<br />
|
| 41 |
-
fifa mobile apk güncel hile<br />
|
| 42 |
-
fifa mobile apk mega hileli<br />
|
| 43 |
-
fifa mobile apk vip hile<br />
|
| 44 |
-
fifa mobile apk altın hilesi<br />
|
| 45 |
-
fifa mobile apk elmas hilesi<br />
|
| 46 |
-
fifa mobile apk oyuncu hilesi<br />
|
| 47 |
-
fifa mobile apk transfer hilesi<br />
|
| 48 |
-
fifa mobile apk antrenman hilesi<br />
|
| 49 |
-
fifa mobile apk enerji hilesi<br />
|
| 50 |
-
fifa mobile apk online hile<br />
|
| 51 |
-
fifa mobile apk offline hile<br />
|
| 52 |
-
fifa mobile apk no root hile<br />
|
| 53 |
-
fifa mobile apk yeni hileler<br />
|
| 54 |
-
fifa mobile apk kolay hile yapma<br />
|
| 55 |
-
fifa mobile mod apk son sürüm indir<br />
|
| 56 |
-
fifa mobile mod apk android 1<br />
|
| 57 |
-
fifa mobile mod apk revdl<br />
|
| 58 |
-
fifa mobile mod apk rexdl<br />
|
| 59 |
-
fifa mobile mod apk happymod<br />
|
| 60 |
-
fifa mobile mod apk an1.com<br />
|
| 61 |
-
fifa mobile mod apk unlimited coins and points<br />
|
| 62 |
-
fifa mobile mod apk all players unlocked<br />
|
| 63 |
-
fifa mobile mod apk latest version 2022<br />
|
| 64 |
-
fifa mobile mod apk free download for android<br />
|
| 65 |
-
fifa mobile mod apk no verification required<br />
|
| 66 |
-
fifa mobile mod apk no ban risk<br />
|
| 67 |
-
fifa mobile mod apk anti ban protection<br />
|
| 68 |
-
fifa mobile mod apk cheat engine enabled<br />
|
| 69 |
-
fifa mobile mod apk gameplay video proof</p>
|
| 70 |
-
<ul>
|
| 71 |
-
<li>Unlimited coins and gems: You can get as many coins and gems as you want, without spending any real money or time. You can use them to buy players, packs, upgrades, and more. <li>Unlimited stamina: You can play as many matches as you want, without waiting for your stamina to refill. <li>Unlimited energy: You can participate in as many events as you want, without worrying about running out of energy. <li>Unlimited VIP points: You can access the VIP Program and enjoy its perks, such as exclusive players, packs, rewards, and more. <li>No ads: You can play the game without any interruptions or distractions from ads.</li>
|
| 72 |
-
</ul>
|
| 73 |
-
<h3>Para hilesi apk risks and drawbacks</h3>
|
| 74 |
-
<p>However, para hilesi apk also comes with several risks and drawbacks that can ruin your FIFA Mobile experience. Some of these risks and drawbacks are:</p>
|
| 75 |
-
<ul>
|
| 76 |
-
<li>Ban risk: Using para hilesi apk is against the terms of service of FIFA Mobile, and it can be detected by the game's anti-cheat system. If you are caught using para hilesi apk, you may face consequences such as account suspension or deletion, loss of progress and items, or legal action. <li>Virus risk: Downloading para hilesi apk from unknown sources can expose your device to viruses, malware, spyware, or other harmful software. These can damage your device, steal your personal information, or compromise your security. <li>Compatibility risk: Para hilesi apk may not work properly with the latest version of FIFA Mobile, or with different devices or operating systems. It may cause errors, glitches, crashes, or performance issues that can affect your gameplay. <li>Quality risk: Using para hilesi apk may reduce the quality of your gameplay, as it may make the game too easy or boring. It may also take away the fun and challenge of earning coins and gems legitimately, or competing with other players fairly.</li>
|
| 77 |
-
</ul>
|
| 78 |
-
<h2>How to download and install para hilesi apk on your device?</h2>
|
| 79 |
-
<p>If you still want to try para hilesi apk despite its risks and drawbacks, you will need to follow some steps to download and install it on your device. However, we do not recommend doing so, as it may harm your device or your account. Use para hilesi apk at your own risk.</p>
|
| 80 |
-
<h3>Step-by-step guide for Android users</h3>
|
| 81 |
-
<p>If you are using an Android device, here are the steps to download and install para hilesi apk:</p>
|
| 82 |
-
<ol>
|
| 83 |
-
<li>Go to the settings of your device and enable the option to install apps from unknown sources.</li>
|
| 84 |
-
<li>Go to a website that offers para hilesi apk download link. Make sure it is a reliable and trustworthy source.</li>
|
| 85 |
-
<li>Click on the download button and wait for the file to be downloaded on your device.</li>
|
| 86 |
-
<li>Locate the file in your device's file manager and tap on it to start the installation process.</li>
|
| 87 |
-
<li>Follow the instructions on the screen and grant the necessary permissions to para hilesi apk.</ <li>Once the installation is complete, you can launch para hilesi apk from your device's app drawer or home screen.</li>
|
| 88 |
-
</ol>
|
| 89 |
-
<h3>Step-by-step guide for iOS users</h3>
|
| 90 |
-
<p>If you are using an iOS device, here are the steps to download and install para hilesi apk:</p>
|
| 91 |
-
<ol>
|
| 92 |
-
<li>Go to the settings of your device and trust the profile of para hilesi apk. You may need to enter your device's passcode to do so.</li>
|
| 93 |
-
<li>Go to a website that offers para hilesi apk download link. Make sure it is a reliable and trustworthy source.</li>
|
| 94 |
-
<li>Click on the download button and wait for the file to be downloaded on your device.</li>
|
| 95 |
-
<li>Locate the file in your device's file manager and tap on it to start the installation process.</li>
|
| 96 |
-
<li>Follow the instructions on the screen and grant the necessary permissions to para hilesi apk.</li>
|
| 97 |
-
<li>Once the installation is complete, you can launch para hilesi apk from your device's app drawer or home screen.</li>
|
| 98 |
-
</ol>
|
| 99 |
-
<h2>How to use para hilesi apk to get unlimited coins and gems in FIFA Mobile?</h2>
|
| 100 |
-
<p>After you have downloaded and installed para hilesi apk on your device, you can use it to get unlimited coins and gems in FIFA Mobile. Here are some tips and tricks for using para hilesi apk effectively:</p>
|
| 101 |
-
<ul>
|
| 102 |
-
<li>Make sure you have a stable internet connection and enough storage space on your device.</li>
|
| 103 |
-
<li>Make sure you have the latest version of FIFA Mobile installed on your device.</li>
|
| 104 |
-
<li>Make sure you have a backup of your FIFA Mobile account and data, in case something goes wrong or you get banned.</li>
|
| 105 |
-
<li>Launch para hilesi apk and enter your FIFA Mobile username or email address.</li>
|
| 106 |
-
<li>Select the amount of coins and gems you want to generate. You can also choose other options such as stamina, energy, VIP points, or no ads.</li>
|
| 107 |
-
<li>Click on the generate button and wait for the process to complete. You may need to verify that you are not a robot by completing a captcha or a survey.</li>
|
| 108 |
-
<li>Once the process is done, you can close para hilesi apk and open FIFA Mobile. You should see your coins and gems added to your account.</li>
|
| 109 |
-
</ul>
|
| 110 |
-
<h3>Alternatives to para hilesi apk</h3>
|
| 111 |
-
<p>If you are looking for alternatives to para hilesi apk, there are some other ways to get coins and gems in FIFA Mobile without cheating. Some of these ways are:</p>
|
| 112 |
-
<ul>
|
| 113 |
-
<li>Playing matches and events: You can earn coins and gems by playing different modes and events in FIFA Mobile, such as Attack Mode, Head to Head, Season, Campaign, Events, Squad Building Challenges, Team of the Week, etc. You can also get bonus coins and gems by completing daily and weekly objectives, achievements, milestones, etc. <li>Buying packs and offers: You can buy coins and gems with real money by purchasing packs and offers in FIFA Mobile. There are different types of packs and offers available, such as player packs, icon packs, hero packs, event packs, special packs, etc. You can also get discounts and deals by checking the store regularly. <li>Selling players and items: You can sell your unwanted players and items in FIFA Mobile by using the market or the quick sell option. You can get coins by selling your players or items to other players or to the game. You can also get gems by selling some rare or special players or items. <li>Joining a league: You can join a league with other players in FIFA Mobile and benefit from their help and support. You can get coins and gems by participating in league tournaments, league vs league matches, league survival events, etc. You can also get rewards by contributing to your league's achievements.</li>
|
| 114 |
-
</ul>
|
| 115 |
-
<h2>Conclusion</h2>
|
| 116 |
-
<h4>Summary of the main points</h4>
|
| 117 |
-
<p>In this article, we have discussed FIFA Mobile para hilesi apk, a cheat tool that claims to give you unlimited coins and gems in FIFA Mobile. We have explained what FIFA Mobile is and why it is so popular, what para hilesi apk is and how it works, how to download and install para hilesi apk on your device, how to use para hilesi apk to get unlimited coins and gems in FIFA Mobile, and some alternatives to para hilesi apk. We have also highlighted some of the risks and drawbacks of using para hilesi apk, such as ban risk, virus risk, compatibility risk, quality risk, etc.</p>
|
| 118 |
-
<h4>Call to action and disclaimer</h4>
|
| 119 |
-
<p>If you want to try para hilesi apk for yourself, you can follow the steps we have provided above. However, we do not recommend doing so, as it may harm your device or your account. Use para hilesi apk at your own risk. We are not responsible for any damage or loss that may occur from using para hilesi apk.</p>
|
| 120 |
-
<p>Alternatively, you can play FIFA Mobile the legit way and enjoy the game without cheating. You can earn coins and gems by playing matches and events, buying packs and offers, selling players and items, joining a league, etc. You can also improve your skills and strategies by learning from other players, watching tutorials, reading guides, etc. You can have fun and satisfaction by building your ultimate team of soccer stars, competing in various modes and events, and experiencing realistic soccer simulation on your device.</p>
|
| 121 |
-
<p>Whatever you choose to do, we hope you have a great time playing FIFA Mobile. Thank you for reading this article.</p>
|
| 122 |
-
<h2>FAQs</h2>
|
| 123 |
-
<p>Here are some frequently asked questions about FIFA Mobile para hilesi apk:</p>
|
| 124 |
-
<ol>
|
| 125 |
-
<li>Q: Is para hilesi apk free to use? A: Yes, para hilesi apk is free to use. However, you may need to complete some verification steps before you can use it, such as completing a captcha or a survey.</li>
|
| 126 |
-
<li>Q: Is para hilesi apk safe to use? A: No, para hilesi apk is not safe to use. It is a cheat tool that violates the terms of service of FIFA Mobile, and it can be detected by the game's anti-cheat system. It can also expose your device to viruses, malware, spyware, or other harmful software. It can also cause errors, glitches, crashes, or performance issues that can affect your gameplay.</li>
|
| 127 |
-
<li>Q: Can I use para hilesi apk on any device or operating system? A: No, para hilesi apk may not work properly on any device or operating system. It may be incompatible with the latest version of FIFA Mobile, or with different devices or operating systems. It may also require some settings or permissions that may not be available on your device or operating system.</li>
|
| 128 |
-
<li>Q: Can I use para hilesi apk with my existing FIFA Mobile account? A: Yes, you can use para hilesi apk with your existing FIFA Mobile account. However, you may risk losing your account or your progress if you are caught using para hilesi apk. You may also lose your items or rewards that you have earned legitimately in the game.</li>
|
| 129 |
-
<li>Q: Can I use para hilesi apk offline? A: No, you cannot use para hilesi apk offline. You need to have a stable internet connection and enough storage space on your device to use para hilesi apk. You also need to connect to the game's servers to generate coins and gems in FIFA Mobile.</li>
|
| 130 |
-
</ol></p> 401be4b1e0<br />
|
| 131 |
-
<br />
|
| 132 |
-
<br />
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AIGText/GlyphControl/cldm/hack.py
DELETED
|
@@ -1,111 +0,0 @@
|
|
| 1 |
-
import torch
|
| 2 |
-
import einops
|
| 3 |
-
|
| 4 |
-
import ldm.modules.encoders.modules
|
| 5 |
-
import ldm.modules.attention
|
| 6 |
-
|
| 7 |
-
from transformers import logging
|
| 8 |
-
from ldm.modules.attention import default
|
| 9 |
-
|
| 10 |
-
|
| 11 |
-
def disable_verbosity():
|
| 12 |
-
logging.set_verbosity_error()
|
| 13 |
-
print('logging improved.')
|
| 14 |
-
return
|
| 15 |
-
|
| 16 |
-
|
| 17 |
-
def enable_sliced_attention():
|
| 18 |
-
ldm.modules.attention.CrossAttention.forward = _hacked_sliced_attentin_forward
|
| 19 |
-
print('Enabled sliced_attention.')
|
| 20 |
-
return
|
| 21 |
-
|
| 22 |
-
|
| 23 |
-
def hack_everything(clip_skip=0):
|
| 24 |
-
disable_verbosity()
|
| 25 |
-
ldm.modules.encoders.modules.FrozenCLIPEmbedder.forward = _hacked_clip_forward
|
| 26 |
-
ldm.modules.encoders.modules.FrozenCLIPEmbedder.clip_skip = clip_skip
|
| 27 |
-
print('Enabled clip hacks.')
|
| 28 |
-
return
|
| 29 |
-
|
| 30 |
-
|
| 31 |
-
# Written by Lvmin
|
| 32 |
-
def _hacked_clip_forward(self, text):
|
| 33 |
-
PAD = self.tokenizer.pad_token_id
|
| 34 |
-
EOS = self.tokenizer.eos_token_id
|
| 35 |
-
BOS = self.tokenizer.bos_token_id
|
| 36 |
-
|
| 37 |
-
def tokenize(t):
|
| 38 |
-
return self.tokenizer(t, truncation=False, add_special_tokens=False)["input_ids"]
|
| 39 |
-
|
| 40 |
-
def transformer_encode(t):
|
| 41 |
-
if self.clip_skip > 1:
|
| 42 |
-
rt = self.transformer(input_ids=t, output_hidden_states=True)
|
| 43 |
-
return self.transformer.text_model.final_layer_norm(rt.hidden_states[-self.clip_skip])
|
| 44 |
-
else:
|
| 45 |
-
return self.transformer(input_ids=t, output_hidden_states=False).last_hidden_state
|
| 46 |
-
|
| 47 |
-
def split(x):
|
| 48 |
-
return x[75 * 0: 75 * 1], x[75 * 1: 75 * 2], x[75 * 2: 75 * 3]
|
| 49 |
-
|
| 50 |
-
def pad(x, p, i):
|
| 51 |
-
return x[:i] if len(x) >= i else x + [p] * (i - len(x))
|
| 52 |
-
|
| 53 |
-
raw_tokens_list = tokenize(text)
|
| 54 |
-
tokens_list = []
|
| 55 |
-
|
| 56 |
-
for raw_tokens in raw_tokens_list:
|
| 57 |
-
raw_tokens_123 = split(raw_tokens)
|
| 58 |
-
raw_tokens_123 = [[BOS] + raw_tokens_i + [EOS] for raw_tokens_i in raw_tokens_123]
|
| 59 |
-
raw_tokens_123 = [pad(raw_tokens_i, PAD, 77) for raw_tokens_i in raw_tokens_123]
|
| 60 |
-
tokens_list.append(raw_tokens_123)
|
| 61 |
-
|
| 62 |
-
tokens_list = torch.IntTensor(tokens_list).to(self.device)
|
| 63 |
-
|
| 64 |
-
feed = einops.rearrange(tokens_list, 'b f i -> (b f) i')
|
| 65 |
-
y = transformer_encode(feed)
|
| 66 |
-
z = einops.rearrange(y, '(b f) i c -> b (f i) c', f=3)
|
| 67 |
-
|
| 68 |
-
return z
|
| 69 |
-
|
| 70 |
-
|
| 71 |
-
# Stolen from https://github.com/basujindal/stable-diffusion/blob/main/optimizedSD/splitAttention.py
|
| 72 |
-
def _hacked_sliced_attentin_forward(self, x, context=None, mask=None):
|
| 73 |
-
h = self.heads
|
| 74 |
-
|
| 75 |
-
q = self.to_q(x)
|
| 76 |
-
context = default(context, x)
|
| 77 |
-
k = self.to_k(context)
|
| 78 |
-
v = self.to_v(context)
|
| 79 |
-
del context, x
|
| 80 |
-
|
| 81 |
-
q, k, v = map(lambda t: einops.rearrange(t, 'b n (h d) -> (b h) n d', h=h), (q, k, v))
|
| 82 |
-
|
| 83 |
-
limit = k.shape[0]
|
| 84 |
-
att_step = 1
|
| 85 |
-
q_chunks = list(torch.tensor_split(q, limit // att_step, dim=0))
|
| 86 |
-
k_chunks = list(torch.tensor_split(k, limit // att_step, dim=0))
|
| 87 |
-
v_chunks = list(torch.tensor_split(v, limit // att_step, dim=0))
|
| 88 |
-
|
| 89 |
-
q_chunks.reverse()
|
| 90 |
-
k_chunks.reverse()
|
| 91 |
-
v_chunks.reverse()
|
| 92 |
-
sim = torch.zeros(q.shape[0], q.shape[1], v.shape[2], device=q.device)
|
| 93 |
-
del k, q, v
|
| 94 |
-
for i in range(0, limit, att_step):
|
| 95 |
-
q_buffer = q_chunks.pop()
|
| 96 |
-
k_buffer = k_chunks.pop()
|
| 97 |
-
v_buffer = v_chunks.pop()
|
| 98 |
-
sim_buffer = torch.einsum('b i d, b j d -> b i j', q_buffer, k_buffer) * self.scale
|
| 99 |
-
|
| 100 |
-
del k_buffer, q_buffer
|
| 101 |
-
# attention, what we cannot get enough of, by chunks
|
| 102 |
-
|
| 103 |
-
sim_buffer = sim_buffer.softmax(dim=-1)
|
| 104 |
-
|
| 105 |
-
sim_buffer = torch.einsum('b i j, b j d -> b i d', sim_buffer, v_buffer)
|
| 106 |
-
del v_buffer
|
| 107 |
-
sim[i:i + att_step, :, :] = sim_buffer
|
| 108 |
-
|
| 109 |
-
del sim_buffer
|
| 110 |
-
sim = einops.rearrange(sim, '(b h) n d -> b n (h d)', h=h)
|
| 111 |
-
return self.to_out(sim)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AIWaves/SOP_Generation-single/single_prompts.py
DELETED
|
@@ -1,396 +0,0 @@
|
|
| 1 |
-
def get_design_state_system_prompt(index):
|
| 2 |
-
default = """input:
|
| 3 |
-
<target>You are an online eye care customer service representative, and your task is to answer patients' questions about ophthalmic diseases and guide them to visit the hospital for examinations while assisting them in filling out the necessary forms.</target> .
|
| 4 |
-
|
| 5 |
-
output:
|
| 6 |
-
<role>online eye care customer service</role>
|
| 7 |
-
<style>professional and humorous</style>
|
| 8 |
-
<state>
|
| 9 |
-
<state_name>knowledge_response_state</state_name>
|
| 10 |
-
<task>Guide the user to go to the hospital for an examination and answer questions related to my hospital.</task>
|
| 11 |
-
<rule>Your language should be concise and avoid excessive words. You need to guide me repeatedly. When the user explicitly refuses to visit the hospital, inquire about their concerns and encourage them to come for consultation, such as: \"Do you have any concerns?\" or \"Our hospital has highly professional doctors who you can discuss with in person.\" When the user expresses doubts with responses like \"I'll think about it,\" \"I'll consider it,\" or \"I need to see more,\" introduce the advantages of the hospital and guide them to come for consultation. Remember, after responding to me, guide me to visit your hospital for an examination.</rule>
|
| 12 |
-
<judge>If the patient agrees to go to the hospital,the state should be end and move to next state,output<end>1</end>,else if the state should not be end,output <end>0</end>\n</judge>
|
| 13 |
-
</state>
|
| 14 |
-
|
| 15 |
-
<state> <state_name>knowledge_response_book_card_state</state_name>
|
| 16 |
-
<task>Guide patient to fill out appointment cards and answer hospital-related questions</task>
|
| 17 |
-
<rule>Your language should be as concise as possible, without too much nonsense. The copy of the invitation card is: Please copy and fill in the following information and send it to me to complete the reservation. \n[Name]:\n[Telephone]:\n[Your approximate location]: District Degree]: \n The preoperative examination process includes mydriasis. After mydriasis, your vision will be blurred for 4-6 hours, which affects driving safety, so please do not drive to the hospital by yourself, and arrange your personal itinerary after the examination. You need to repeatedly invite users to fill out invitation cards. When users are chatting, euphemistic replies guide users to fill in the appointment card, such as: \"I can't provide detailed information about your question. If you need to go to the hospital for eye consultation, I can make an appointment for you.\" When users have concerns, such as: Users reply with \"I want to think about it,\" \"I'll think about it,\" \"I want to see it again,\" etc., introducing the hospital's advantages and guiding users to fill in the appointment card. If the user does not fill in the phone number completely, the user will be reminded to add the phone number.</rule>
|
| 18 |
-
<judge>If thepatientfills in the phone information in the appointment card, for example:When the patient answers [Telephone]: 15563665210.the state should be end and move to next state,output<end>1</end>,\nelse if the patient does not fill in completely or the format is wrong, output <end>0</end>\n </judge>
|
| 19 |
-
</state>"""
|
| 20 |
-
|
| 21 |
-
design_assistant = """input:
|
| 22 |
-
<target>An assistant that can help users create content such as articles, blogs, advertising copy, etc</target>
|
| 23 |
-
output:
|
| 24 |
-
<role>Intelligent and versatile content creation assistant</role>
|
| 25 |
-
<style>Professional, detail-oriented, and collaborative</style>
|
| 26 |
-
|
| 27 |
-
<state>
|
| 28 |
-
<state_name>Discussion state</state_name>
|
| 29 |
-
<task>Engage in a detailed discussion with the user to understand their specific requirements, target audience, and desired tone.</task>
|
| 30 |
-
<rule>Ask probing questions to gain a deeper understanding of the user's vision and objectives for the content. Listen actively and take notes to ensure all requirements are captured accurately. Provide suggestions and insights based on previous experience to enhance the user's content ideas.</rule>
|
| 31 |
-
<judge>If the user's requirements are clear and all necessary information has been gathered, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 32 |
-
</state>
|
| 33 |
-
|
| 34 |
-
<state>
|
| 35 |
-
<state_name>Research state</state_name>
|
| 36 |
-
<task>Conduct extensive research on the given topic to gather information from reliable sources and identify unique angles.</task>
|
| 37 |
-
<rule>Explore various credible sources such as academic journals, reputable websites, and industry reports. Analyze existing content to understand the current landscape and identify gaps or opportunities for a fresh perspective. Take thorough notes and organize the collected information for easy reference.</rule>
|
| 38 |
-
<judge>If sufficient research has been conducted and the necessary information has been gathered, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 39 |
-
</state>
|
| 40 |
-
|
| 41 |
-
<state>
|
| 42 |
-
<state_name>Outline state</state_name>
|
| 43 |
-
<task>Create a logical structure for the content, including main points, subheadings, and supporting arguments.</task>
|
| 44 |
-
<rule>Organize the collected information into a cohesive outline that follows a logical flow. Ensure that the structure aligns with the user's objectives and target audience. Use headings and subheadings to provide a clear roadmap for the content.</rule>
|
| 45 |
-
<judge>If the outline has been created and approved by the user, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 46 |
-
</state>
|
| 47 |
-
|
| 48 |
-
<state>
|
| 49 |
-
<state_name>Drafting state</state_name>
|
| 50 |
-
<task>Write the content, paying attention to grammar, spelling, and punctuation.</task>
|
| 51 |
-
<rule>Craft engaging introductions that grab the reader's attention. Develop informative body paragraphs that provide valuable insights and supporting evidence. Create compelling conclusions that leave a lasting impression. Use creativity and writing skills to make the content engaging and enjoyable to read.</rule>
|
| 52 |
-
<judge>If the initial draft has been completed, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 53 |
-
</state>
|
| 54 |
-
|
| 55 |
-
<state>
|
| 56 |
-
<state_name>Revision state</state_name>
|
| 57 |
-
<task>Seek feedback from the user and incorporate necessary revisions.</task>
|
| 58 |
-
<rule>Maintain open communication with the user throughout the writing process. Actively seek feedback and suggestions for improvement. Incorporate revisions based on the user's preferences and ensure that the content aligns with their expectations. Collaborate with the user to create a final version that meets their requirements.</rule>
|
| 59 |
-
<judge>If the user is satisfied with the content and no further revisions are needed, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 60 |
-
</state>
|
| 61 |
-
|
| 62 |
-
<state>
|
| 63 |
-
<state_name>Proofreading state</state_name>
|
| 64 |
-
<task>Thoroughly review the content for grammar, spelling, and coherence.</task>
|
| 65 |
-
<rule>Check for any errors in grammar, spelling, and punctuation. Ensure that the content flows smoothly and cohesively. Make necessary edits to improve clarity and readability. Pay attention to formatting and consistency throughout the document.</rule>
|
| 66 |
-
<judge>If the content has been thoroughly proofread and edited, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 67 |
-
</state>
|
| 68 |
-
|
| 69 |
-
<state>
|
| 70 |
-
<state_name>Delivery state</state_name>
|
| 71 |
-
<task>Deliver the completed content to the user within the agreed-upon timeframe and desired format.</task>
|
| 72 |
-
<rule>Ensure that the content is delivered in the format specified by the user, such as a Word document, a blog post, or any other specified medium. Meet the agreed-upon deadline for content delivery. Provide the user with a final version that is polished, error-free, and ready for use.</rule>
|
| 73 |
-
<judge>If the content has been delivered to the user, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 74 |
-
</state>
|
| 75 |
-
"""
|
| 76 |
-
|
| 77 |
-
tutor = """input:
|
| 78 |
-
<target>A tutor who provides personalized learning resources for students to help them understand complex concepts and problems</target>
|
| 79 |
-
output:
|
| 80 |
-
<role>Tutor</role>
|
| 81 |
-
<style>Knowledgeable, patient, supportive, encouraging</style>
|
| 82 |
-
|
| 83 |
-
<state>
|
| 84 |
-
<state_name>Assessment_state</state_name>
|
| 85 |
-
<task>Conduct a comprehensive assessment of the student's knowledge and understanding of the subject matter.</task>
|
| 86 |
-
<rule>Use a variety of assessment tools such as quizzes, tests, and discussions to identify areas where the student may be struggling or require additional support. Tailor the assessment to the student's preferred learning style. Provide clear instructions and guidance throughout the assessment process.</rule>
|
| 87 |
-
<judge>If the assessment is completed and areas of improvement are identified, the state should be end and move to the next state, output <end>1</end>. If the assessment is not completed or the student needs further support, output <end>0</end>.</judge>
|
| 88 |
-
</state>
|
| 89 |
-
|
| 90 |
-
<state>
|
| 91 |
-
<state_name>Personalized_learning_plan_state</state_name>
|
| 92 |
-
<task>Create personalized learning plans for each student based on the assessment results.</task>
|
| 93 |
-
<rule>Consider the student's strengths, weaknesses, and preferred learning style when creating the learning plan. Include a variety of resources such as textbooks, online articles, videos, and interactive exercises. Ensure that the materials are engaging, relevant, and aligned with the student's curriculum.</rule>
|
| 94 |
-
<judge>If the personalized learning plan is created and includes a variety of resources, the state should be end and move to the next state, output <end>1</end>. If the learning plan is not created or lacks the necessary resources, output <end>0</end>.</judge>
|
| 95 |
-
</state>
|
| 96 |
-
|
| 97 |
-
<state>
|
| 98 |
-
<state_name>Hands-on_learning_state</state_name>
|
| 99 |
-
<task>Encourage students to actively participate in problem-solving activities and apply theoretical concepts to practical situations.</task>
|
| 100 |
-
<rule>Design practical exercises and real-life scenarios to help students develop critical thinking skills and a deeper understanding of the subject matter. Provide clear instructions and guidance throughout the hands-on learning activities. Use real-life examples to enhance understanding.</rule>
|
| 101 |
-
<judge>If the hands-on learning activities are completed and the student demonstrates an application of theoretical concepts, the state should be end and move to the next state, output <end>1</end>. If the activities are not completed or the student struggles to apply the concepts, output <end>0</end>.</judge>
|
| 102 |
-
</state>
|
| 103 |
-
|
| 104 |
-
<state>
|
| 105 |
-
<state_name>Supportive_environment_state</state_name>
|
| 106 |
-
<task>Maintain a supportive and encouraging environment during tutoring sessions.</task>
|
| 107 |
-
<rule>Explain complex concepts in a patient and understandable manner. Break down concepts into simpler terms and provide real-life examples. Actively listen to the student's questions and concerns. Create a safe space for the student to ask for clarification.</rule>
|
| 108 |
-
<judge>If the tutoring session is conducted in a supportive and encouraging manner, the state should be end and move to the next state, output <end>1</end>. If the session lacks support or the student feels uncomfortable asking for clarification, output <end>0</end>.</judge>
|
| 109 |
-
</state>
|
| 110 |
-
|
| 111 |
-
<state>
|
| 112 |
-
<state_name>Progress_tracking_state</state_name>
|
| 113 |
-
<task>Regularly assess the student's understanding and provide constructive feedback.</task>
|
| 114 |
-
<rule>Use quizzes, assignments, and discussions to assess the student's progress. Provide constructive feedback and identify areas for improvement. Help the student build confidence and overcome challenges.</rule>
|
| 115 |
-
<judge>If the student's progress is regularly assessed and constructive feedback is provided, the state should be end and move to the next state, output <end>1</end>. If the assessment and feedback are lacking or inconsistent, output <end>0</end>.</judge>
|
| 116 |
-
</state>
|
| 117 |
-
|
| 118 |
-
<state>
|
| 119 |
-
<state_name>Study_habits_state</state_name>
|
| 120 |
-
<task>Guide the student in developing effective study habits and time management skills.</task>
|
| 121 |
-
<rule>Assist the student in setting realistic goals and creating study schedules. Provide guidance on effective study techniques and strategies. Encourage the student to stay on track and make steady progress.</rule>
|
| 122 |
-
<judge>If the student develops effective study habits and time management skills, the state should be end and move to the next state, output <end>1</end>. If the student struggles to develop these skills or lacks progress, output <end>0</end>.</judge>
|
| 123 |
-
</state>
|
| 124 |
-
|
| 125 |
-
<state>
|
| 126 |
-
<state_name>Mentorship_state</state_name>
|
| 127 |
-
<task>Serve as a mentor and motivator for the student.</task>
|
| 128 |
-
<rule>Inspire the student to reach their full academic potential. Celebrate their achievements and encourage them to embrace a growth mindset. Foster a positive and empowering learning experience.</rule>
|
| 129 |
-
<judge>If the student feels mentored and motivated, the state should be end and move to the next state, output <end>1</end>. If the student lacks mentorship or motivation, output <end>0</end>.</judge>
|
| 130 |
-
</state>
|
| 131 |
-
|
| 132 |
-
<state>
|
| 133 |
-
<state_name>Final_objective_state</state_name>
|
| 134 |
-
<task>Help students gain a deep understanding of complex concepts and develop the skills and confidence to excel academically.</task>
|
| 135 |
-
<rule>Ensure that students grasp complex concepts and can apply them effectively. Help them build confidence in their abilities and develop a growth mindset. Support them in achieving their academic goals.</rule>
|
| 136 |
-
<judge>This state is the final objective and should always be the end state, output <end>1</end>.</judge>
|
| 137 |
-
</state>
|
| 138 |
-
"""
|
| 139 |
-
|
| 140 |
-
online_medical_consultant = """input:
|
| 141 |
-
<target>An online medical consultant who offers preliminary medical advice to patients and answers common questions about diseases, symptoms, and treatments.</target>
|
| 142 |
-
output:
|
| 143 |
-
<role>Online Medical Consultant</role>
|
| 144 |
-
<style>Empathetic and Knowledgeable</style>
|
| 145 |
-
<state>
|
| 146 |
-
<state_name>Initial Assessment State</state_name>
|
| 147 |
-
<task>Gather detailed information about the patient's symptoms, medical history, and any previous treatments.</task>
|
| 148 |
-
<rule>Ask open-ended questions to allow the patient to provide a comprehensive description of their symptoms. Request specific details such as the duration and intensity of symptoms, any triggering factors, and any alleviating or worsening factors. Inquire about the patient's medical history, including any chronic conditions, previous surgeries, or allergies. Ask about any medications or treatments the patient has tried in the past.</rule>
|
| 149 |
-
<judge>If the patient has provided sufficient information about their symptoms, medical history, and previous treatments, the state should be end and move to the next state. Output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 150 |
-
</state>
|
| 151 |
-
|
| 152 |
-
<state>
|
| 153 |
-
<state_name>Preliminary Diagnosis State</state_name>
|
| 154 |
-
<task>Form a preliminary diagnosis based on the gathered information.</task>
|
| 155 |
-
<rule>Analyze the patient's symptoms, medical history, and any relevant test results. Consider possible differential diagnoses and evaluate the likelihood of each. Explain the reasoning behind the preliminary diagnosis to the patient, highlighting the key symptoms and findings that led to the conclusion.</rule>
|
| 156 |
-
<judge>If the patient understands the preliminary diagnosis and is ready to discuss treatment options or further diagnostic tests, the state should be end and move to the next state. Output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 157 |
-
</state>
|
| 158 |
-
|
| 159 |
-
<state>
|
| 160 |
-
<state_name>Treatment Discussion State</state_name>
|
| 161 |
-
<task>Discuss potential treatment options or further diagnostic tests.</task>
|
| 162 |
-
<rule>Present the patient with different treatment options, explaining the benefits, risks, and expected outcomes of each. Consider the patient's preferences, lifestyle, and any contraindications when recommending treatments. If further diagnostic tests are necessary, explain the purpose of these tests and how they can provide more information for a definitive diagnosis.</rule>
|
| 163 |
-
<judge>If the patient has chosen a treatment option or agreed to undergo further diagnostic tests, the state should be end and move to the next state. Output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 164 |
-
</state>
|
| 165 |
-
|
| 166 |
-
<state>
|
| 167 |
-
<state_name>Patient Education State</state_name>
|
| 168 |
-
<task>Provide clear and understandable explanations of medical concepts.</task>
|
| 169 |
-
<rule>Break down complex medical terms and concepts into simple language that the patient can easily understand. Use visual aids, diagrams, or analogies to enhance comprehension. Encourage the patient to ask questions and clarify any uncertainties they may have. Ensure that the patient has a comprehensive understanding of their condition, treatment options, and any potential risks or side effects.</rule>
|
| 170 |
-
<judge>If the patient demonstrates a clear understanding of their condition, treatment options, and any necessary precautions, the state should be end and move to the next state. Output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 171 |
-
</state>
|
| 172 |
-
|
| 173 |
-
<state>
|
| 174 |
-
<state_name>Follow-up Instructions State</state_name>
|
| 175 |
-
<task>Provide clear instructions for any necessary follow-up steps.</task>
|
| 176 |
-
<rule>Outline the specific actions the patient needs to take, such as scheduling further tests, booking a follow-up appointment, or seeking in-person medical care if required. Provide contact information for any questions or concerns that may arise. Emphasize the importance of adhering to the recommended follow-up plan and address any potential barriers or challenges the patient may face.</rule>
|
| 177 |
-
<judge>If the patient acknowledges and understands the follow-up instructions, the state should be end and move to the next state. Output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 178 |
-
</state>"""
|
| 179 |
-
|
| 180 |
-
online_legal_consultant = """input:
|
| 181 |
-
<target>An online legal advisor who can respond to inquiries related to legal matters, providing basic legal information and advice.</target>
|
| 182 |
-
output:
|
| 183 |
-
<role>Online Legal Advisor</role>
|
| 184 |
-
<style>Professional, Knowledgeable, Empathetic</style>
|
| 185 |
-
<state>
|
| 186 |
-
<state_name>Active Listening State</state_name>
|
| 187 |
-
<task>Listen attentively to clients' concerns and queries.</task>
|
| 188 |
-
<rule>1. Give clients your full attention and avoid interrupting them.
|
| 189 |
-
2. Take notes to ensure accurate understanding of the details.
|
| 190 |
-
3. Ask clarifying questions to gather additional information if needed.
|
| 191 |
-
4. Show empathy and understanding towards clients' emotions and concerns.
|
| 192 |
-
5. Avoid making assumptions or jumping to conclusions.</rule>
|
| 193 |
-
<judge>If the client has fully expressed their concerns and queries, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 194 |
-
</state>
|
| 195 |
-
|
| 196 |
-
<state>
|
| 197 |
-
<state_name>Analysis State</state_name>
|
| 198 |
-
<task>Analyze the legal situation based on the gathered information.</task>
|
| 199 |
-
<rule>1. Research relevant laws, regulations, and precedents related to the client's case.
|
| 200 |
-
2. Consider any specific circumstances or factors that may impact the legal analysis.
|
| 201 |
-
3. Consult legal databases, journals, and other reliable sources for accurate information.
|
| 202 |
-
4. Take into account any recent legal developments or changes that may affect the case.
|
| 203 |
-
5. Ensure that the legal advice provided is up-to-date and accurate.</rule>
|
| 204 |
-
<judge>If the legal situation has been thoroughly analyzed, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 205 |
-
</state>
|
| 206 |
-
|
| 207 |
-
<state>
|
| 208 |
-
<state_name>Clear Communication State</state_name>
|
| 209 |
-
<task>Communicate legal concepts in a clear and concise manner.</task>
|
| 210 |
-
<rule>1. Avoid using complex legal jargon that may confuse clients.
|
| 211 |
-
2. Break down legal concepts into simple and understandable terms.
|
| 212 |
-
3. Use examples or analogies to illustrate legal principles.
|
| 213 |
-
4. Check for client understanding and address any questions or confusion.
|
| 214 |
-
5. Provide written summaries or explanations if necessary.</rule>
|
| 215 |
-
<judge>If the client has demonstrated understanding of the communicated legal concepts, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 216 |
-
</state>
|
| 217 |
-
|
| 218 |
-
<state>
|
| 219 |
-
<state_name>Comprehensive Information State</state_name>
|
| 220 |
-
<task>Provide clients with comprehensive information about their legal rights, obligations, and potential outcomes.</task>
|
| 221 |
-
<rule>1. Explain the legal rights and obligations relevant to the client's case.
|
| 222 |
-
2. Discuss potential outcomes or consequences of different legal actions.
|
| 223 |
-
3. Provide information about alternative dispute resolution methods, if applicable.
|
| 224 |
-
4. Offer resources or references for further research or information.
|
| 225 |
-
5. Address any specific concerns or questions raised by the client.</rule>
|
| 226 |
-
<judge>If the client has received comprehensive information and their questions have been addressed, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 227 |
-
</state>
|
| 228 |
-
|
| 229 |
-
<state>
|
| 230 |
-
<state_name>Practical Solutions State</state_name>
|
| 231 |
-
<task>Offer practical solutions tailored to the client's specific circumstances.</task>
|
| 232 |
-
<rule>1. Consider the client's goals, resources, and potential risks.
|
| 233 |
-
2. Present different options or strategies for resolving the legal matter.
|
| 234 |
-
3. Discuss the pros and cons of each option and their potential outcomes.
|
| 235 |
-
4. Provide guidance on the steps to take to implement the chosen solution.
|
| 236 |
-
5. Address any concerns or doubts the client may have about the proposed solutions.</rule>
|
| 237 |
-
<judge>If the client has agreed on a practical solution and is ready to proceed, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 238 |
-
</state>
|
| 239 |
-
|
| 240 |
-
<state>
|
| 241 |
-
<state_name>Timely Responses State</state_name>
|
| 242 |
-
<task>Ensure prompt responses to inquiries and minimize unnecessary delays.</task>
|
| 243 |
-
<rule>1. Respond to client inquiries as soon as possible.
|
| 244 |
-
2. Set clear expectations regarding response times.
|
| 245 |
-
3. Inform clients of any potential delays or timeframes for further actions.
|
| 246 |
-
4. Provide regular updates on the progress of the legal matter.
|
| 247 |
-
5. Apologize and explain any delays that may occur, if necessary.</rule>
|
| 248 |
-
<judge>If the client has received a timely response and is satisfied with the communication, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 249 |
-
</state>
|
| 250 |
-
|
| 251 |
-
<state>
|
| 252 |
-
<state_name>Building Trust and Rapport State</state_name>
|
| 253 |
-
<task>Establish trust and rapport with clients.</task>
|
| 254 |
-
<rule>1. Maintain a professional and respectful demeanor.
|
| 255 |
-
2. Show empathy and understanding towards clients' concerns.
|
| 256 |
-
3. Demonstrate active listening and genuine interest in their case.
|
| 257 |
-
4. Be transparent and honest about the legal process and potential outcomes.
|
| 258 |
-
5. Foster open communication and encourage clients to ask questions or seek clarification.</rule>
|
| 259 |
-
<judge>If the client feels comfortable discussing their legal concerns openly and trusts the advisor, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 260 |
-
</state>
|
| 261 |
-
|
| 262 |
-
<state>
|
| 263 |
-
<state_name>Referral State</state_name>
|
| 264 |
-
<task>Refer clients to specialized experts when necessary.</task>
|
| 265 |
-
<rule>1. Recognize cases that require specialized expertise beyond the advisor's scope.
|
| 266 |
-
2. Maintain a network of trusted colleagues or professionals in various legal areas.
|
| 267 |
-
3. Explain the reasons for the referral and the benefits of seeking specialized assistance.
|
| 268 |
-
4. Provide contact information or facilitate the connection with the referred expert.
|
| 269 |
-
5. Follow up with the client to ensure a smooth transition to the specialized expert.</rule>
|
| 270 |
-
<judge>If the client agrees to the referral and expresses willingness to seek specialized assistance, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 271 |
-
</state>"""
|
| 272 |
-
|
| 273 |
-
online_financial_advisor = """input:
|
| 274 |
-
<target>An online financial advisor who can analyze financial markets and data, offering investment advice and market forecasts to users.</target>
|
| 275 |
-
output:
|
| 276 |
-
<role>Online Financial Advisor</role>
|
| 277 |
-
<style>Knowledgeable and Analytical</style>
|
| 278 |
-
<state>
|
| 279 |
-
<state_name>Data Gathering State</state_name>
|
| 280 |
-
<task>Gather relevant financial data from various reliable sources</task>
|
| 281 |
-
<rule>Ensure that the sources of financial data are reputable and up-to-date. Use a combination of primary and secondary sources, including market reports, economic indicators, and company financial statements. Verify the accuracy and reliability of the data before proceeding with the analysis.</rule>
|
| 282 |
-
<judge>If all the relevant financial data has been gathered, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 283 |
-
</state>
|
| 284 |
-
|
| 285 |
-
<state>
|
| 286 |
-
<state_name>Data Analysis State</state_name>
|
| 287 |
-
<task>Analyze the gathered financial data to identify investment opportunities and potential risks</task>
|
| 288 |
-
<rule>Utilize advanced analytical tools and models to conduct quantitative and qualitative analysis. Consider factors such as market volatility, industry performance, macroeconomic conditions, and company financial health. Pay attention to key indicators and trends that may impact investment decisions.</rule>
|
| 289 |
-
<judge>If the analysis is complete and investment opportunities and risks have been identified, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 290 |
-
</state>
|
| 291 |
-
|
| 292 |
-
<state>
|
| 293 |
-
<state_name>User Engagement State</state_name>
|
| 294 |
-
<task>Engage in detailed discussions with users to understand their financial circumstances and objectives</task>
|
| 295 |
-
<rule>Ask relevant questions to gather information about the user's financial goals, risk tolerance, and investment preferences. Listen actively and empathetically to the user's responses. Tailor recommendations and forecasts to align with the user's specific needs.</rule>
|
| 296 |
-
<judge>If the user's financial circumstances and objectives have been understood, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 297 |
-
</state>
|
| 298 |
-
|
| 299 |
-
<state>
|
| 300 |
-
<state_name>Market Monitoring State</state_name>
|
| 301 |
-
<task>Monitor market trends and developments to identify potential investment opportunities</task>
|
| 302 |
-
<rule>Stay updated with industry conferences, financial publications, and online forums. Leverage the network of industry professionals to gain insights and validate analysis. Continuously track market indicators and news that may impact investment decisions.</rule>
|
| 303 |
-
<judge>If potential investment opportunities have been identified based on market trends and developments, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 304 |
-
</state>
|
| 305 |
-
|
| 306 |
-
<state>
|
| 307 |
-
<state_name>Investment Recommendation State</state_name>
|
| 308 |
-
<task>Formulate investment recommendations and market forecasts based on analysis</task>
|
| 309 |
-
<rule>Consider factors such as risk-reward ratios, potential catalysts, and long-term growth prospects. Present findings to users through comprehensive reports, charts, and interactive presentations. Ensure that the rationale behind recommendations is clearly communicated.</rule>
|
| 310 |
-
<judge>If investment recommendations and market forecasts have been formulated, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 311 |
-
</state>
|
| 312 |
-
|
| 313 |
-
<state>
|
| 314 |
-
<state_name>Monitoring and Adjusting State</state_name>
|
| 315 |
-
<task>Monitor the performance of recommended investments and adjust recommendations as needed</task>
|
| 316 |
-
<rule>Regularly review the performance of recommended investments and assess their alignment with user goals. Stay updated with market changes and adjust recommendations accordingly. Continuously communicate with users, addressing any concerns and providing ongoing support.</rule>
|
| 317 |
-
<judge>If the performance of recommended investments has been monitored and adjustments have been made as needed, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 318 |
-
</state>"""
|
| 319 |
-
virtual_tour_guide = """input:
|
| 320 |
-
<target>A virtual tour guide providing destination information, travel recommendations, and virtual travel experiences for travelers.</target>
|
| 321 |
-
output:
|
| 322 |
-
<role>Virtual Tour Guide</role>
|
| 323 |
-
<style>Enthusiastic and knowledgeable</style>
|
| 324 |
-
<state>
|
| 325 |
-
<state_name>Research State</state_name>
|
| 326 |
-
<task>Conduct in-depth research about the destination, including its history, culture, and attractions.</task>
|
| 327 |
-
<rule>Use reliable sources such as travel blogs, books, documentaries, and official tourism websites to gather accurate and up-to-date information. Take notes and organize the research material for easy reference during virtual tours. Pay special attention to lesser-known spots and off-the-beaten-path adventures to provide unique experiences to travelers.</rule>
|
| 328 |
-
<judge>If the research is complete, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 329 |
-
</state>
|
| 330 |
-
|
| 331 |
-
<state>
|
| 332 |
-
<state_name>Personalization State</state_name>
|
| 333 |
-
<task>Understand the traveler's preferences, interests, and desired experiences.</task>
|
| 334 |
-
<rule>Initiate a conversation with the traveler to gather information about their travel style, hobbies, and previous travel experiences. Ask specific questions about their desired landmarks or activities they wish to explore. Actively listen and take notes to create a personalized itinerary that caters to their unique tastes.</rule>
|
| 335 |
-
<judge>If the traveler's preferences are gathered, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 336 |
-
</state>
|
| 337 |
-
|
| 338 |
-
<state>
|
| 339 |
-
<state_name>Curating Experience State</state_name>
|
| 340 |
-
<task>Create a virtual travel experience that combines the destination's highlights with hidden gems.</task>
|
| 341 |
-
<rule>Select engaging and interactive elements such as quizzes, challenges, and virtual reality experiences to keep travelers entertained throughout the tour. Ensure a balance between well-known landmarks and lesser-known spots to provide a comprehensive and authentic experience. Pay attention to the pacing of the tour to maintain the traveler's interest.</rule>
|
| 342 |
-
<judge>If the virtual travel experience is curated, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 343 |
-
</state>
|
| 344 |
-
|
| 345 |
-
<state>
|
| 346 |
-
<state_name>Communication State</state_name>
|
| 347 |
-
<task>Maintain open and frequent communication with travelers.</task>
|
| 348 |
-
<rule>Provide travelers with all the necessary details about the virtual travel experience, including the required technology (e.g., VR headsets, video streaming platforms). Ensure they have access to the necessary resources to fully immerse themselves in the tour. Respond promptly to any inquiries or concerns they may have.</rule>
|
| 349 |
-
<judge>If the communication is established, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 350 |
-
</state>
|
| 351 |
-
|
| 352 |
-
<state>
|
| 353 |
-
<state_name>Feedback and Improvement State</state_name>
|
| 354 |
-
<task>Encourage travelers to provide feedback and use it to enhance future tours.</task>
|
| 355 |
-
<rule>After each virtual travel experience, ask travelers for their feedback and suggestions. Value their opinions and use their input to improve the overall tour experience. Consider adjusting the pacing, adding more interactive elements, or exploring new destinations based on the feedback received.</rule>
|
| 356 |
-
<judge>If feedback is received, the state should be end and move to the next state, output <end>1</end>. Otherwise, output <end>0</end>.</judge>
|
| 357 |
-
</state>"""
|
| 358 |
-
if index == 0:
|
| 359 |
-
example = design_assistant
|
| 360 |
-
elif index == 1:
|
| 361 |
-
example = tutor
|
| 362 |
-
elif index == 2 :
|
| 363 |
-
example = online_medical_consultant
|
| 364 |
-
elif index == 3 :
|
| 365 |
-
example = online_legal_consultant
|
| 366 |
-
elif index == 4 :
|
| 367 |
-
example = online_financial_advisor
|
| 368 |
-
elif index == 5 :
|
| 369 |
-
example = virtual_tour_guide
|
| 370 |
-
else:
|
| 371 |
-
example = default
|
| 372 |
-
|
| 373 |
-
return """You are a master of character description, and your goal is to design several states for the character based on the provided character information. For each state, outline the character's tasks and the rules that can help them better accomplish these tasks, ultimately aiding them in achieving their final objective.
|
| 374 |
-
input:<target>{{the discription of the target character}}</target>
|
| 375 |
-
output:
|
| 376 |
-
<role>{{the discription of the role of the character}}</role>
|
| 377 |
-
<style>{{the style of the character}}</style>
|
| 378 |
-
<state>
|
| 379 |
-
<state_name>{{the name of the state}}</state_name>
|
| 380 |
-
<task>the task of the character in current state</task>
|
| 381 |
-
<rule>the rules that can help target character better acomplish his tasks in current state </rule>
|
| 382 |
-
<judge>{{when to leave this state to next state.Must strictly follow the format of:If {{when to leave}},the state should be end and move to next state,output<end>1</end>,else if the state should not be end,output <end>0</end>}}</judge>
|
| 383 |
-
</state>
|
| 384 |
-
|
| 385 |
-
For example:
|
| 386 |
-
{}
|
| 387 |
-
|
| 388 |
-
Note:
|
| 389 |
-
1.Descriptions must be concise and clear.
|
| 390 |
-
2.You must complete more details to make the entire process reasonable and not a streamlined account.
|
| 391 |
-
3.The above is just an example, you don't have to imitate it, and the content should be as different as possible while ensuring the format is correct.
|
| 392 |
-
""".format(example)
|
| 393 |
-
|
| 394 |
-
|
| 395 |
-
design_states_cot_system_prompt="""You are a character description master.Please translate the <target> into more reasonable expressions,enrich his character details and behavioral logic to make his behavior more reasonable ,help him design more steps to better complete his tasks in the current scenario, and allowing the scene to proceed normally), and think carefully step by step!"""
|
| 396 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Abdul09/bingo_demo/README.md
DELETED
|
@@ -1,12 +0,0 @@
|
|
| 1 |
-
---
|
| 2 |
-
title: Bingo_demo
|
| 3 |
-
emoji: 🔥
|
| 4 |
-
colorFrom: red
|
| 5 |
-
colorTo: purple
|
| 6 |
-
sdk: gradio
|
| 7 |
-
sdk_version: 3.0.12
|
| 8 |
-
app_file: app.py
|
| 9 |
-
pinned: false
|
| 10 |
-
---
|
| 11 |
-
|
| 12 |
-
Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Abdul09/bingo_demo/app.py
DELETED
|
@@ -1,34 +0,0 @@
|
|
| 1 |
-
import gradio as gr
|
| 2 |
-
import numpy as np
|
| 3 |
-
import tensorflow as tf
|
| 4 |
-
import keras
|
| 5 |
-
|
| 6 |
-
from keras.models import load_model
|
| 7 |
-
from keras.preprocessing import image
|
| 8 |
-
|
| 9 |
-
cnn_model = keras.models.load_model("fine_tuning.keras")
|
| 10 |
-
|
| 11 |
-
def detect(img):
|
| 12 |
-
img = img.reshape(-1,180,180,3)
|
| 13 |
-
prediction = np.around(cnn_model.predict(img)[0], decimals=0)[0]
|
| 14 |
-
|
| 15 |
-
if prediction == 1:
|
| 16 |
-
return "Pneumonia Detected!"
|
| 17 |
-
|
| 18 |
-
return "Pneumonia Not Detected!"
|
| 19 |
-
|
| 20 |
-
#set the user uploaded image as the input array
|
| 21 |
-
#match same shape as the input shape in the model
|
| 22 |
-
|
| 23 |
-
image_input = gr.inputs.Image( shape=(180, 180) ,invert_colors=False , type="numpy" )
|
| 24 |
-
|
| 25 |
-
title = "PneumoDetect: Pneumonia Detection from Chest X-Rays"
|
| 26 |
-
|
| 27 |
-
|
| 28 |
-
#setup the interface
|
| 29 |
-
iface = gr.Interface(
|
| 30 |
-
fn = detect,
|
| 31 |
-
inputs = image_input,
|
| 32 |
-
outputs = gr.outputs.Label(),
|
| 33 |
-
)
|
| 34 |
-
iface.launch(share=True , debug = True )
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AgentVerse/agentVerse/ui/src/index.ts
DELETED
|
@@ -1,79 +0,0 @@
|
|
| 1 |
-
import { Game, Scale, Types, WEBGL } from "phaser";
|
| 2 |
-
|
| 3 |
-
import { TownScene, LoadingScene } from "./scenes";
|
| 4 |
-
import UIPlugin from "./phaser3-rex-plugins/templates/ui/ui-plugin";
|
| 5 |
-
import BoardPlugin from "./phaser3-rex-plugins/plugins/board-plugin";
|
| 6 |
-
|
| 7 |
-
declare global {
|
| 8 |
-
interface Window {
|
| 9 |
-
sizeChanged: () => void;
|
| 10 |
-
game: Game;
|
| 11 |
-
}
|
| 12 |
-
}
|
| 13 |
-
|
| 14 |
-
export const gameConfig: Types.Core.GameConfig = {
|
| 15 |
-
title: "Phaser game tutorial",
|
| 16 |
-
type: WEBGL,
|
| 17 |
-
parent: "game",
|
| 18 |
-
// backgroundColor: '#351f1b',
|
| 19 |
-
scale: {
|
| 20 |
-
mode: Scale.ScaleModes.NONE,
|
| 21 |
-
width: window.innerWidth,
|
| 22 |
-
height: window.innerHeight,
|
| 23 |
-
},
|
| 24 |
-
physics: {
|
| 25 |
-
default: "arcade",
|
| 26 |
-
arcade: {
|
| 27 |
-
debug: false,
|
| 28 |
-
},
|
| 29 |
-
},
|
| 30 |
-
render: {
|
| 31 |
-
antialiasGL: false,
|
| 32 |
-
pixelArt: true,
|
| 33 |
-
},
|
| 34 |
-
callbacks: {
|
| 35 |
-
postBoot: () => {
|
| 36 |
-
window.sizeChanged();
|
| 37 |
-
},
|
| 38 |
-
},
|
| 39 |
-
canvasStyle: `display: block; width: 100%; height: 100%;`,
|
| 40 |
-
autoFocus: true,
|
| 41 |
-
audio: {
|
| 42 |
-
disableWebAudio: false,
|
| 43 |
-
},
|
| 44 |
-
scene: [LoadingScene, TownScene],
|
| 45 |
-
dom: {
|
| 46 |
-
createContainer: true,
|
| 47 |
-
},
|
| 48 |
-
plugins: {
|
| 49 |
-
scene: [
|
| 50 |
-
{
|
| 51 |
-
key: "rexUI",
|
| 52 |
-
plugin: UIPlugin,
|
| 53 |
-
mapping: "rexUI",
|
| 54 |
-
},
|
| 55 |
-
{
|
| 56 |
-
key: "rexBoard",
|
| 57 |
-
plugin: BoardPlugin,
|
| 58 |
-
mapping: "rexBoard",
|
| 59 |
-
},
|
| 60 |
-
],
|
| 61 |
-
},
|
| 62 |
-
};
|
| 63 |
-
|
| 64 |
-
window.sizeChanged = () => {
|
| 65 |
-
if (window.game.isBooted) {
|
| 66 |
-
setTimeout(() => {
|
| 67 |
-
window.game.scale.resize(window.innerWidth, window.innerHeight);
|
| 68 |
-
|
| 69 |
-
window.game.canvas.setAttribute(
|
| 70 |
-
"style",
|
| 71 |
-
`display: block; width: ${window.innerWidth}px; height: ${window.innerHeight}px;`
|
| 72 |
-
);
|
| 73 |
-
}, 100);
|
| 74 |
-
}
|
| 75 |
-
};
|
| 76 |
-
|
| 77 |
-
window.onresize = () => window.sizeChanged();
|
| 78 |
-
|
| 79 |
-
window.game = new Game(gameConfig);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/plugins/colorreplacepipeline.js
DELETED
|
@@ -1,2 +0,0 @@
|
|
| 1 |
-
import ColorReplacePostFxPipeline from './shaders/colorreplace/ColorReplacePostFxPipeline.js';
|
| 2 |
-
export default ColorReplacePostFxPipeline;
|
|
|
|
|
|
|
|
|
spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/templates/ui/colorinput/colorcomponents/Factory.d.ts
DELETED
|
@@ -1,5 +0,0 @@
|
|
| 1 |
-
import ColorComponents from './ColorComponents';
|
| 2 |
-
|
| 3 |
-
export default function (
|
| 4 |
-
config?: ColorComponents.IConfig
|
| 5 |
-
): ColorComponents;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/templates/ui/colorinput/colorpicker/Factory.d.ts
DELETED
|
@@ -1,5 +0,0 @@
|
|
| 1 |
-
import ColorPicker from './ColorPicker';
|
| 2 |
-
|
| 3 |
-
export default function (
|
| 4 |
-
config?: ColorPicker.IConfig
|
| 5 |
-
): ColorPicker;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/templates/ui/gridsizer/GetExpandedChildWidth.js
DELETED
|
@@ -1,11 +0,0 @@
|
|
| 1 |
-
var GetExpandedChildWidth = function (child, colWidth) {
|
| 2 |
-
var childWidth;
|
| 3 |
-
var childConfig = child.rexSizer;
|
| 4 |
-
if (childConfig.expand) {
|
| 5 |
-
var padding = childConfig.padding;
|
| 6 |
-
childWidth = colWidth - padding.left - padding.right;
|
| 7 |
-
}
|
| 8 |
-
return childWidth;
|
| 9 |
-
}
|
| 10 |
-
|
| 11 |
-
export default GetExpandedChildWidth;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/templates/ui/roundrectangle/Factory.d.ts
DELETED
|
@@ -1,16 +0,0 @@
|
|
| 1 |
-
import RoundRectangle from './RoundRectangle';
|
| 2 |
-
|
| 3 |
-
export default function (
|
| 4 |
-
x: number,
|
| 5 |
-
y: number,
|
| 6 |
-
width: number,
|
| 7 |
-
height: number,
|
| 8 |
-
radiusConfig?: number | ({ x?: number, y?: number }) | RoundRectangle.IRadiusConfig |
|
| 9 |
-
({
|
| 10 |
-
radius?: (number | ({ x?: number, y?: number }) | RoundRectangle.IRadiusConfig),
|
| 11 |
-
iteration?: number
|
| 12 |
-
}),
|
| 13 |
-
fillColor?: number,
|
| 14 |
-
fillAlpha?: number
|
| 15 |
-
|
| 16 |
-
): RoundRectangle;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Aki004/herta-so-vits/wav_upload.py
DELETED
|
@@ -1,21 +0,0 @@
|
|
| 1 |
-
from google.colab import files
|
| 2 |
-
import shutil
|
| 3 |
-
import os
|
| 4 |
-
import argparse
|
| 5 |
-
if __name__ == "__main__":
|
| 6 |
-
parser = argparse.ArgumentParser()
|
| 7 |
-
parser.add_argument("--type", type=str, required=True, help="type of file to upload")
|
| 8 |
-
args = parser.parse_args()
|
| 9 |
-
file_type = args.type
|
| 10 |
-
|
| 11 |
-
basepath = os.getcwd()
|
| 12 |
-
uploaded = files.upload()
|
| 13 |
-
assert(file_type in ['zip', 'audio'])
|
| 14 |
-
if file_type == "zip":
|
| 15 |
-
upload_path = "./upload/"
|
| 16 |
-
for filename in uploaded.keys():
|
| 17 |
-
shutil.move(os.path.join(basepath, filename), os.path.join(upload_path, "userzip.zip"))
|
| 18 |
-
elif file_type == "audio":
|
| 19 |
-
upload_path = "./raw/"
|
| 20 |
-
for filename in uploaded.keys():
|
| 21 |
-
shutil.move(os.path.join(basepath, filename), os.path.join(upload_path, filename))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AlekseyKorshuk/accompaniment-generator/README.md
DELETED
|
@@ -1,13 +0,0 @@
|
|
| 1 |
-
---
|
| 2 |
-
title: Accompaniment Generator
|
| 3 |
-
emoji: 🎶
|
| 4 |
-
colorFrom: green
|
| 5 |
-
colorTo: green
|
| 6 |
-
sdk: streamlit
|
| 7 |
-
sdk_version: 1.2.0
|
| 8 |
-
app_file: app.py
|
| 9 |
-
pinned: false
|
| 10 |
-
license: apache-2.0
|
| 11 |
-
---
|
| 12 |
-
|
| 13 |
-
Check out the configuration reference at https://huggingface.co/docs/hub/spaces#reference
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Andy1621/uniformer_image_detection/configs/albu_example/mask_rcnn_r50_fpn_albu_1x_coco.py
DELETED
|
@@ -1,73 +0,0 @@
|
|
| 1 |
-
_base_ = '../mask_rcnn/mask_rcnn_r50_fpn_1x_coco.py'
|
| 2 |
-
img_norm_cfg = dict(
|
| 3 |
-
mean=[123.675, 116.28, 103.53], std=[58.395, 57.12, 57.375], to_rgb=True)
|
| 4 |
-
albu_train_transforms = [
|
| 5 |
-
dict(
|
| 6 |
-
type='ShiftScaleRotate',
|
| 7 |
-
shift_limit=0.0625,
|
| 8 |
-
scale_limit=0.0,
|
| 9 |
-
rotate_limit=0,
|
| 10 |
-
interpolation=1,
|
| 11 |
-
p=0.5),
|
| 12 |
-
dict(
|
| 13 |
-
type='RandomBrightnessContrast',
|
| 14 |
-
brightness_limit=[0.1, 0.3],
|
| 15 |
-
contrast_limit=[0.1, 0.3],
|
| 16 |
-
p=0.2),
|
| 17 |
-
dict(
|
| 18 |
-
type='OneOf',
|
| 19 |
-
transforms=[
|
| 20 |
-
dict(
|
| 21 |
-
type='RGBShift',
|
| 22 |
-
r_shift_limit=10,
|
| 23 |
-
g_shift_limit=10,
|
| 24 |
-
b_shift_limit=10,
|
| 25 |
-
p=1.0),
|
| 26 |
-
dict(
|
| 27 |
-
type='HueSaturationValue',
|
| 28 |
-
hue_shift_limit=20,
|
| 29 |
-
sat_shift_limit=30,
|
| 30 |
-
val_shift_limit=20,
|
| 31 |
-
p=1.0)
|
| 32 |
-
],
|
| 33 |
-
p=0.1),
|
| 34 |
-
dict(type='JpegCompression', quality_lower=85, quality_upper=95, p=0.2),
|
| 35 |
-
dict(type='ChannelShuffle', p=0.1),
|
| 36 |
-
dict(
|
| 37 |
-
type='OneOf',
|
| 38 |
-
transforms=[
|
| 39 |
-
dict(type='Blur', blur_limit=3, p=1.0),
|
| 40 |
-
dict(type='MedianBlur', blur_limit=3, p=1.0)
|
| 41 |
-
],
|
| 42 |
-
p=0.1),
|
| 43 |
-
]
|
| 44 |
-
train_pipeline = [
|
| 45 |
-
dict(type='LoadImageFromFile'),
|
| 46 |
-
dict(type='LoadAnnotations', with_bbox=True, with_mask=True),
|
| 47 |
-
dict(type='Resize', img_scale=(1333, 800), keep_ratio=True),
|
| 48 |
-
dict(type='Pad', size_divisor=32),
|
| 49 |
-
dict(
|
| 50 |
-
type='Albu',
|
| 51 |
-
transforms=albu_train_transforms,
|
| 52 |
-
bbox_params=dict(
|
| 53 |
-
type='BboxParams',
|
| 54 |
-
format='pascal_voc',
|
| 55 |
-
label_fields=['gt_labels'],
|
| 56 |
-
min_visibility=0.0,
|
| 57 |
-
filter_lost_elements=True),
|
| 58 |
-
keymap={
|
| 59 |
-
'img': 'image',
|
| 60 |
-
'gt_masks': 'masks',
|
| 61 |
-
'gt_bboxes': 'bboxes'
|
| 62 |
-
},
|
| 63 |
-
update_pad_shape=False,
|
| 64 |
-
skip_img_without_anno=True),
|
| 65 |
-
dict(type='Normalize', **img_norm_cfg),
|
| 66 |
-
dict(type='DefaultFormatBundle'),
|
| 67 |
-
dict(
|
| 68 |
-
type='Collect',
|
| 69 |
-
keys=['img', 'gt_bboxes', 'gt_labels', 'gt_masks'],
|
| 70 |
-
meta_keys=('filename', 'ori_shape', 'img_shape', 'img_norm_cfg',
|
| 71 |
-
'pad_shape', 'scale_factor'))
|
| 72 |
-
]
|
| 73 |
-
data = dict(train=dict(pipeline=train_pipeline))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Andy1621/uniformer_image_detection/configs/retinanet/retinanet_x101_64x4d_fpn_2x_coco.py
DELETED
|
@@ -1,13 +0,0 @@
|
|
| 1 |
-
_base_ = './retinanet_r50_fpn_2x_coco.py'
|
| 2 |
-
model = dict(
|
| 3 |
-
pretrained='open-mmlab://resnext101_64x4d',
|
| 4 |
-
backbone=dict(
|
| 5 |
-
type='ResNeXt',
|
| 6 |
-
depth=101,
|
| 7 |
-
groups=64,
|
| 8 |
-
base_width=4,
|
| 9 |
-
num_stages=4,
|
| 10 |
-
out_indices=(0, 1, 2, 3),
|
| 11 |
-
frozen_stages=1,
|
| 12 |
-
norm_cfg=dict(type='BN', requires_grad=True),
|
| 13 |
-
style='pytorch'))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Anonymous-123/ImageNet-Editing/editing_diffusion/guided_diffusion/guided_diffusion/dist_util.py
DELETED
|
@@ -1,93 +0,0 @@
|
|
| 1 |
-
"""
|
| 2 |
-
Helpers for distributed training.
|
| 3 |
-
"""
|
| 4 |
-
|
| 5 |
-
import io
|
| 6 |
-
import os
|
| 7 |
-
import socket
|
| 8 |
-
|
| 9 |
-
import blobfile as bf
|
| 10 |
-
from mpi4py import MPI
|
| 11 |
-
import torch as th
|
| 12 |
-
import torch.distributed as dist
|
| 13 |
-
|
| 14 |
-
# Change this to reflect your cluster layout.
|
| 15 |
-
# The GPU for a given rank is (rank % GPUS_PER_NODE).
|
| 16 |
-
GPUS_PER_NODE = 8
|
| 17 |
-
|
| 18 |
-
SETUP_RETRY_COUNT = 3
|
| 19 |
-
|
| 20 |
-
|
| 21 |
-
def setup_dist():
|
| 22 |
-
"""
|
| 23 |
-
Setup a distributed process group.
|
| 24 |
-
"""
|
| 25 |
-
if dist.is_initialized():
|
| 26 |
-
return
|
| 27 |
-
os.environ["CUDA_VISIBLE_DEVICES"] = f"{MPI.COMM_WORLD.Get_rank() % GPUS_PER_NODE}"
|
| 28 |
-
|
| 29 |
-
comm = MPI.COMM_WORLD
|
| 30 |
-
backend = "gloo" if not th.cuda.is_available() else "nccl"
|
| 31 |
-
|
| 32 |
-
if backend == "gloo":
|
| 33 |
-
hostname = "localhost"
|
| 34 |
-
else:
|
| 35 |
-
hostname = socket.gethostbyname(socket.getfqdn())
|
| 36 |
-
os.environ["MASTER_ADDR"] = comm.bcast(hostname, root=0)
|
| 37 |
-
os.environ["RANK"] = str(comm.rank)
|
| 38 |
-
os.environ["WORLD_SIZE"] = str(comm.size)
|
| 39 |
-
|
| 40 |
-
port = comm.bcast(_find_free_port(), root=0)
|
| 41 |
-
os.environ["MASTER_PORT"] = str(port)
|
| 42 |
-
dist.init_process_group(backend=backend, init_method="env://")
|
| 43 |
-
|
| 44 |
-
|
| 45 |
-
def dev():
|
| 46 |
-
"""
|
| 47 |
-
Get the device to use for torch.distributed.
|
| 48 |
-
"""
|
| 49 |
-
if th.cuda.is_available():
|
| 50 |
-
return th.device(f"cuda")
|
| 51 |
-
return th.device("cpu")
|
| 52 |
-
|
| 53 |
-
|
| 54 |
-
def load_state_dict(path, **kwargs):
|
| 55 |
-
"""
|
| 56 |
-
Load a PyTorch file without redundant fetches across MPI ranks.
|
| 57 |
-
"""
|
| 58 |
-
chunk_size = 2 ** 30 # MPI has a relatively small size limit
|
| 59 |
-
if MPI.COMM_WORLD.Get_rank() == 0:
|
| 60 |
-
with bf.BlobFile(path, "rb") as f:
|
| 61 |
-
data = f.read()
|
| 62 |
-
num_chunks = len(data) // chunk_size
|
| 63 |
-
if len(data) % chunk_size:
|
| 64 |
-
num_chunks += 1
|
| 65 |
-
MPI.COMM_WORLD.bcast(num_chunks)
|
| 66 |
-
for i in range(0, len(data), chunk_size):
|
| 67 |
-
MPI.COMM_WORLD.bcast(data[i : i + chunk_size])
|
| 68 |
-
else:
|
| 69 |
-
num_chunks = MPI.COMM_WORLD.bcast(None)
|
| 70 |
-
data = bytes()
|
| 71 |
-
for _ in range(num_chunks):
|
| 72 |
-
data += MPI.COMM_WORLD.bcast(None)
|
| 73 |
-
|
| 74 |
-
return th.load(io.BytesIO(data), **kwargs)
|
| 75 |
-
|
| 76 |
-
|
| 77 |
-
def sync_params(params):
|
| 78 |
-
"""
|
| 79 |
-
Synchronize a sequence of Tensors across ranks from rank 0.
|
| 80 |
-
"""
|
| 81 |
-
for p in params:
|
| 82 |
-
with th.no_grad():
|
| 83 |
-
dist.broadcast(p, 0)
|
| 84 |
-
|
| 85 |
-
|
| 86 |
-
def _find_free_port():
|
| 87 |
-
try:
|
| 88 |
-
s = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
|
| 89 |
-
s.bind(("", 0))
|
| 90 |
-
s.setsockopt(socket.SOL_SOCKET, socket.SO_REUSEADDR, 1)
|
| 91 |
-
return s.getsockname()[1]
|
| 92 |
-
finally:
|
| 93 |
-
s.close()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Apex-X/GODROOP/roop/__init__.py
DELETED
|
File without changes
|
spaces/Artrajz/vits-simple-api/vits/text/sanskrit.py
DELETED
|
@@ -1,62 +0,0 @@
|
|
| 1 |
-
import re
|
| 2 |
-
from indic_transliteration import sanscript
|
| 3 |
-
|
| 4 |
-
|
| 5 |
-
# List of (iast, ipa) pairs:
|
| 6 |
-
_iast_to_ipa = [(re.compile('%s' % x[0]), x[1]) for x in [
|
| 7 |
-
('a', 'ə'),
|
| 8 |
-
('ā', 'aː'),
|
| 9 |
-
('ī', 'iː'),
|
| 10 |
-
('ū', 'uː'),
|
| 11 |
-
('ṛ', 'ɹ`'),
|
| 12 |
-
('ṝ', 'ɹ`ː'),
|
| 13 |
-
('ḷ', 'l`'),
|
| 14 |
-
('ḹ', 'l`ː'),
|
| 15 |
-
('e', 'eː'),
|
| 16 |
-
('o', 'oː'),
|
| 17 |
-
('k', 'k⁼'),
|
| 18 |
-
('k⁼h', 'kʰ'),
|
| 19 |
-
('g', 'g⁼'),
|
| 20 |
-
('g⁼h', 'gʰ'),
|
| 21 |
-
('ṅ', 'ŋ'),
|
| 22 |
-
('c', 'ʧ⁼'),
|
| 23 |
-
('ʧ⁼h', 'ʧʰ'),
|
| 24 |
-
('j', 'ʥ⁼'),
|
| 25 |
-
('ʥ⁼h', 'ʥʰ'),
|
| 26 |
-
('ñ', 'n^'),
|
| 27 |
-
('ṭ', 't`⁼'),
|
| 28 |
-
('t`⁼h', 't`ʰ'),
|
| 29 |
-
('ḍ', 'd`⁼'),
|
| 30 |
-
('d`⁼h', 'd`ʰ'),
|
| 31 |
-
('ṇ', 'n`'),
|
| 32 |
-
('t', 't⁼'),
|
| 33 |
-
('t⁼h', 'tʰ'),
|
| 34 |
-
('d', 'd⁼'),
|
| 35 |
-
('d⁼h', 'dʰ'),
|
| 36 |
-
('p', 'p⁼'),
|
| 37 |
-
('p⁼h', 'pʰ'),
|
| 38 |
-
('b', 'b⁼'),
|
| 39 |
-
('b⁼h', 'bʰ'),
|
| 40 |
-
('y', 'j'),
|
| 41 |
-
('ś', 'ʃ'),
|
| 42 |
-
('ṣ', 's`'),
|
| 43 |
-
('r', 'ɾ'),
|
| 44 |
-
('l̤', 'l`'),
|
| 45 |
-
('h', 'ɦ'),
|
| 46 |
-
("'", ''),
|
| 47 |
-
('~', '^'),
|
| 48 |
-
('ṃ', '^')
|
| 49 |
-
]]
|
| 50 |
-
|
| 51 |
-
|
| 52 |
-
def devanagari_to_ipa(text):
|
| 53 |
-
text = text.replace('ॐ', 'ओम्')
|
| 54 |
-
text = re.sub(r'\s*।\s*$', '', text)
|
| 55 |
-
text = re.sub(r'\s*।\s*', ', ', text)
|
| 56 |
-
text = re.sub(r'\s*॥', '', text)
|
| 57 |
-
text = sanscript.transliterate(text, sanscript.DEVANAGARI, sanscript.IAST)
|
| 58 |
-
for regex, replacement in _iast_to_ipa:
|
| 59 |
-
text = re.sub(regex, replacement, text)
|
| 60 |
-
text = re.sub('(.)[`ː]*ḥ', lambda x: x.group(0)
|
| 61 |
-
[:-1]+'h'+x.group(1)+'*', text)
|
| 62 |
-
return text
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Ataturk-Chatbot/HuggingFaceChat/venv/lib/python3.11/site-packages/pkg_resources/_vendor/importlib_resources/__init__.py
DELETED
|
@@ -1,36 +0,0 @@
|
|
| 1 |
-
"""Read resources contained within a package."""
|
| 2 |
-
|
| 3 |
-
from ._common import (
|
| 4 |
-
as_file,
|
| 5 |
-
files,
|
| 6 |
-
Package,
|
| 7 |
-
)
|
| 8 |
-
|
| 9 |
-
from ._legacy import (
|
| 10 |
-
contents,
|
| 11 |
-
open_binary,
|
| 12 |
-
read_binary,
|
| 13 |
-
open_text,
|
| 14 |
-
read_text,
|
| 15 |
-
is_resource,
|
| 16 |
-
path,
|
| 17 |
-
Resource,
|
| 18 |
-
)
|
| 19 |
-
|
| 20 |
-
from .abc import ResourceReader
|
| 21 |
-
|
| 22 |
-
|
| 23 |
-
__all__ = [
|
| 24 |
-
'Package',
|
| 25 |
-
'Resource',
|
| 26 |
-
'ResourceReader',
|
| 27 |
-
'as_file',
|
| 28 |
-
'contents',
|
| 29 |
-
'files',
|
| 30 |
-
'is_resource',
|
| 31 |
-
'open_binary',
|
| 32 |
-
'open_text',
|
| 33 |
-
'path',
|
| 34 |
-
'read_binary',
|
| 35 |
-
'read_text',
|
| 36 |
-
]
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Awiny/Image2Paragraph/models/grit_src/third_party/CenterNet2/configs/common/models/cascade_rcnn.py
DELETED
|
@@ -1,36 +0,0 @@
|
|
| 1 |
-
from detectron2.config import LazyCall as L
|
| 2 |
-
from detectron2.layers import ShapeSpec
|
| 3 |
-
from detectron2.modeling.box_regression import Box2BoxTransform
|
| 4 |
-
from detectron2.modeling.matcher import Matcher
|
| 5 |
-
from detectron2.modeling.roi_heads import FastRCNNOutputLayers, FastRCNNConvFCHead, CascadeROIHeads
|
| 6 |
-
|
| 7 |
-
from .mask_rcnn_fpn import model
|
| 8 |
-
|
| 9 |
-
# arguments that don't exist for Cascade R-CNN
|
| 10 |
-
[model.roi_heads.pop(k) for k in ["box_head", "box_predictor", "proposal_matcher"]]
|
| 11 |
-
|
| 12 |
-
model.roi_heads.update(
|
| 13 |
-
_target_=CascadeROIHeads,
|
| 14 |
-
box_heads=[
|
| 15 |
-
L(FastRCNNConvFCHead)(
|
| 16 |
-
input_shape=ShapeSpec(channels=256, height=7, width=7),
|
| 17 |
-
conv_dims=[],
|
| 18 |
-
fc_dims=[1024, 1024],
|
| 19 |
-
)
|
| 20 |
-
for k in range(3)
|
| 21 |
-
],
|
| 22 |
-
box_predictors=[
|
| 23 |
-
L(FastRCNNOutputLayers)(
|
| 24 |
-
input_shape=ShapeSpec(channels=1024),
|
| 25 |
-
test_score_thresh=0.05,
|
| 26 |
-
box2box_transform=L(Box2BoxTransform)(weights=(w1, w1, w2, w2)),
|
| 27 |
-
cls_agnostic_bbox_reg=True,
|
| 28 |
-
num_classes="${...num_classes}",
|
| 29 |
-
)
|
| 30 |
-
for (w1, w2) in [(10, 5), (20, 10), (30, 15)]
|
| 31 |
-
],
|
| 32 |
-
proposal_matchers=[
|
| 33 |
-
L(Matcher)(thresholds=[th], labels=[0, 1], allow_low_quality_matches=False)
|
| 34 |
-
for th in [0.5, 0.6, 0.7]
|
| 35 |
-
],
|
| 36 |
-
)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AzumaSeren100/XuanShen-Bert-VITS2/transforms.py
DELETED
|
@@ -1,193 +0,0 @@
|
|
| 1 |
-
import torch
|
| 2 |
-
from torch.nn import functional as F
|
| 3 |
-
|
| 4 |
-
import numpy as np
|
| 5 |
-
|
| 6 |
-
|
| 7 |
-
DEFAULT_MIN_BIN_WIDTH = 1e-3
|
| 8 |
-
DEFAULT_MIN_BIN_HEIGHT = 1e-3
|
| 9 |
-
DEFAULT_MIN_DERIVATIVE = 1e-3
|
| 10 |
-
|
| 11 |
-
|
| 12 |
-
def piecewise_rational_quadratic_transform(inputs,
|
| 13 |
-
unnormalized_widths,
|
| 14 |
-
unnormalized_heights,
|
| 15 |
-
unnormalized_derivatives,
|
| 16 |
-
inverse=False,
|
| 17 |
-
tails=None,
|
| 18 |
-
tail_bound=1.,
|
| 19 |
-
min_bin_width=DEFAULT_MIN_BIN_WIDTH,
|
| 20 |
-
min_bin_height=DEFAULT_MIN_BIN_HEIGHT,
|
| 21 |
-
min_derivative=DEFAULT_MIN_DERIVATIVE):
|
| 22 |
-
|
| 23 |
-
if tails is None:
|
| 24 |
-
spline_fn = rational_quadratic_spline
|
| 25 |
-
spline_kwargs = {}
|
| 26 |
-
else:
|
| 27 |
-
spline_fn = unconstrained_rational_quadratic_spline
|
| 28 |
-
spline_kwargs = {
|
| 29 |
-
'tails': tails,
|
| 30 |
-
'tail_bound': tail_bound
|
| 31 |
-
}
|
| 32 |
-
|
| 33 |
-
outputs, logabsdet = spline_fn(
|
| 34 |
-
inputs=inputs,
|
| 35 |
-
unnormalized_widths=unnormalized_widths,
|
| 36 |
-
unnormalized_heights=unnormalized_heights,
|
| 37 |
-
unnormalized_derivatives=unnormalized_derivatives,
|
| 38 |
-
inverse=inverse,
|
| 39 |
-
min_bin_width=min_bin_width,
|
| 40 |
-
min_bin_height=min_bin_height,
|
| 41 |
-
min_derivative=min_derivative,
|
| 42 |
-
**spline_kwargs
|
| 43 |
-
)
|
| 44 |
-
return outputs, logabsdet
|
| 45 |
-
|
| 46 |
-
|
| 47 |
-
def searchsorted(bin_locations, inputs, eps=1e-6):
|
| 48 |
-
bin_locations[..., -1] += eps
|
| 49 |
-
return torch.sum(
|
| 50 |
-
inputs[..., None] >= bin_locations,
|
| 51 |
-
dim=-1
|
| 52 |
-
) - 1
|
| 53 |
-
|
| 54 |
-
|
| 55 |
-
def unconstrained_rational_quadratic_spline(inputs,
|
| 56 |
-
unnormalized_widths,
|
| 57 |
-
unnormalized_heights,
|
| 58 |
-
unnormalized_derivatives,
|
| 59 |
-
inverse=False,
|
| 60 |
-
tails='linear',
|
| 61 |
-
tail_bound=1.,
|
| 62 |
-
min_bin_width=DEFAULT_MIN_BIN_WIDTH,
|
| 63 |
-
min_bin_height=DEFAULT_MIN_BIN_HEIGHT,
|
| 64 |
-
min_derivative=DEFAULT_MIN_DERIVATIVE):
|
| 65 |
-
inside_interval_mask = (inputs >= -tail_bound) & (inputs <= tail_bound)
|
| 66 |
-
outside_interval_mask = ~inside_interval_mask
|
| 67 |
-
|
| 68 |
-
outputs = torch.zeros_like(inputs)
|
| 69 |
-
logabsdet = torch.zeros_like(inputs)
|
| 70 |
-
|
| 71 |
-
if tails == 'linear':
|
| 72 |
-
unnormalized_derivatives = F.pad(unnormalized_derivatives, pad=(1, 1))
|
| 73 |
-
constant = np.log(np.exp(1 - min_derivative) - 1)
|
| 74 |
-
unnormalized_derivatives[..., 0] = constant
|
| 75 |
-
unnormalized_derivatives[..., -1] = constant
|
| 76 |
-
|
| 77 |
-
outputs[outside_interval_mask] = inputs[outside_interval_mask]
|
| 78 |
-
logabsdet[outside_interval_mask] = 0
|
| 79 |
-
else:
|
| 80 |
-
raise RuntimeError('{} tails are not implemented.'.format(tails))
|
| 81 |
-
|
| 82 |
-
outputs[inside_interval_mask], logabsdet[inside_interval_mask] = rational_quadratic_spline(
|
| 83 |
-
inputs=inputs[inside_interval_mask],
|
| 84 |
-
unnormalized_widths=unnormalized_widths[inside_interval_mask, :],
|
| 85 |
-
unnormalized_heights=unnormalized_heights[inside_interval_mask, :],
|
| 86 |
-
unnormalized_derivatives=unnormalized_derivatives[inside_interval_mask, :],
|
| 87 |
-
inverse=inverse,
|
| 88 |
-
left=-tail_bound, right=tail_bound, bottom=-tail_bound, top=tail_bound,
|
| 89 |
-
min_bin_width=min_bin_width,
|
| 90 |
-
min_bin_height=min_bin_height,
|
| 91 |
-
min_derivative=min_derivative
|
| 92 |
-
)
|
| 93 |
-
|
| 94 |
-
return outputs, logabsdet
|
| 95 |
-
|
| 96 |
-
def rational_quadratic_spline(inputs,
|
| 97 |
-
unnormalized_widths,
|
| 98 |
-
unnormalized_heights,
|
| 99 |
-
unnormalized_derivatives,
|
| 100 |
-
inverse=False,
|
| 101 |
-
left=0., right=1., bottom=0., top=1.,
|
| 102 |
-
min_bin_width=DEFAULT_MIN_BIN_WIDTH,
|
| 103 |
-
min_bin_height=DEFAULT_MIN_BIN_HEIGHT,
|
| 104 |
-
min_derivative=DEFAULT_MIN_DERIVATIVE):
|
| 105 |
-
if torch.min(inputs) < left or torch.max(inputs) > right:
|
| 106 |
-
raise ValueError('Input to a transform is not within its domain')
|
| 107 |
-
|
| 108 |
-
num_bins = unnormalized_widths.shape[-1]
|
| 109 |
-
|
| 110 |
-
if min_bin_width * num_bins > 1.0:
|
| 111 |
-
raise ValueError('Minimal bin width too large for the number of bins')
|
| 112 |
-
if min_bin_height * num_bins > 1.0:
|
| 113 |
-
raise ValueError('Minimal bin height too large for the number of bins')
|
| 114 |
-
|
| 115 |
-
widths = F.softmax(unnormalized_widths, dim=-1)
|
| 116 |
-
widths = min_bin_width + (1 - min_bin_width * num_bins) * widths
|
| 117 |
-
cumwidths = torch.cumsum(widths, dim=-1)
|
| 118 |
-
cumwidths = F.pad(cumwidths, pad=(1, 0), mode='constant', value=0.0)
|
| 119 |
-
cumwidths = (right - left) * cumwidths + left
|
| 120 |
-
cumwidths[..., 0] = left
|
| 121 |
-
cumwidths[..., -1] = right
|
| 122 |
-
widths = cumwidths[..., 1:] - cumwidths[..., :-1]
|
| 123 |
-
|
| 124 |
-
derivatives = min_derivative + F.softplus(unnormalized_derivatives)
|
| 125 |
-
|
| 126 |
-
heights = F.softmax(unnormalized_heights, dim=-1)
|
| 127 |
-
heights = min_bin_height + (1 - min_bin_height * num_bins) * heights
|
| 128 |
-
cumheights = torch.cumsum(heights, dim=-1)
|
| 129 |
-
cumheights = F.pad(cumheights, pad=(1, 0), mode='constant', value=0.0)
|
| 130 |
-
cumheights = (top - bottom) * cumheights + bottom
|
| 131 |
-
cumheights[..., 0] = bottom
|
| 132 |
-
cumheights[..., -1] = top
|
| 133 |
-
heights = cumheights[..., 1:] - cumheights[..., :-1]
|
| 134 |
-
|
| 135 |
-
if inverse:
|
| 136 |
-
bin_idx = searchsorted(cumheights, inputs)[..., None]
|
| 137 |
-
else:
|
| 138 |
-
bin_idx = searchsorted(cumwidths, inputs)[..., None]
|
| 139 |
-
|
| 140 |
-
input_cumwidths = cumwidths.gather(-1, bin_idx)[..., 0]
|
| 141 |
-
input_bin_widths = widths.gather(-1, bin_idx)[..., 0]
|
| 142 |
-
|
| 143 |
-
input_cumheights = cumheights.gather(-1, bin_idx)[..., 0]
|
| 144 |
-
delta = heights / widths
|
| 145 |
-
input_delta = delta.gather(-1, bin_idx)[..., 0]
|
| 146 |
-
|
| 147 |
-
input_derivatives = derivatives.gather(-1, bin_idx)[..., 0]
|
| 148 |
-
input_derivatives_plus_one = derivatives[..., 1:].gather(-1, bin_idx)[..., 0]
|
| 149 |
-
|
| 150 |
-
input_heights = heights.gather(-1, bin_idx)[..., 0]
|
| 151 |
-
|
| 152 |
-
if inverse:
|
| 153 |
-
a = (((inputs - input_cumheights) * (input_derivatives
|
| 154 |
-
+ input_derivatives_plus_one
|
| 155 |
-
- 2 * input_delta)
|
| 156 |
-
+ input_heights * (input_delta - input_derivatives)))
|
| 157 |
-
b = (input_heights * input_derivatives
|
| 158 |
-
- (inputs - input_cumheights) * (input_derivatives
|
| 159 |
-
+ input_derivatives_plus_one
|
| 160 |
-
- 2 * input_delta))
|
| 161 |
-
c = - input_delta * (inputs - input_cumheights)
|
| 162 |
-
|
| 163 |
-
discriminant = b.pow(2) - 4 * a * c
|
| 164 |
-
assert (discriminant >= 0).all()
|
| 165 |
-
|
| 166 |
-
root = (2 * c) / (-b - torch.sqrt(discriminant))
|
| 167 |
-
outputs = root * input_bin_widths + input_cumwidths
|
| 168 |
-
|
| 169 |
-
theta_one_minus_theta = root * (1 - root)
|
| 170 |
-
denominator = input_delta + ((input_derivatives + input_derivatives_plus_one - 2 * input_delta)
|
| 171 |
-
* theta_one_minus_theta)
|
| 172 |
-
derivative_numerator = input_delta.pow(2) * (input_derivatives_plus_one * root.pow(2)
|
| 173 |
-
+ 2 * input_delta * theta_one_minus_theta
|
| 174 |
-
+ input_derivatives * (1 - root).pow(2))
|
| 175 |
-
logabsdet = torch.log(derivative_numerator) - 2 * torch.log(denominator)
|
| 176 |
-
|
| 177 |
-
return outputs, -logabsdet
|
| 178 |
-
else:
|
| 179 |
-
theta = (inputs - input_cumwidths) / input_bin_widths
|
| 180 |
-
theta_one_minus_theta = theta * (1 - theta)
|
| 181 |
-
|
| 182 |
-
numerator = input_heights * (input_delta * theta.pow(2)
|
| 183 |
-
+ input_derivatives * theta_one_minus_theta)
|
| 184 |
-
denominator = input_delta + ((input_derivatives + input_derivatives_plus_one - 2 * input_delta)
|
| 185 |
-
* theta_one_minus_theta)
|
| 186 |
-
outputs = input_cumheights + numerator / denominator
|
| 187 |
-
|
| 188 |
-
derivative_numerator = input_delta.pow(2) * (input_derivatives_plus_one * theta.pow(2)
|
| 189 |
-
+ 2 * input_delta * theta_one_minus_theta
|
| 190 |
-
+ input_derivatives * (1 - theta).pow(2))
|
| 191 |
-
logabsdet = torch.log(derivative_numerator) - 2 * torch.log(denominator)
|
| 192 |
-
|
| 193 |
-
return outputs, logabsdet
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/BG5/midjourney/Dockerfile
DELETED
|
@@ -1,34 +0,0 @@
|
|
| 1 |
-
# Build Stage
|
| 2 |
-
# 使用 golang:alpine 作为构建阶段的基础镜像
|
| 3 |
-
FROM golang:alpine AS builder
|
| 4 |
-
|
| 5 |
-
# 添加 git，以便之后能从GitHub克隆项目
|
| 6 |
-
RUN apk --no-cache add git
|
| 7 |
-
|
| 8 |
-
# 从 GitHub 克隆 go-proxy-bingai 项目到 /workspace/app 目录下
|
| 9 |
-
RUN git clone https://github.com/Harry-zklcdc/go-proxy-bingai.git /workspace/app
|
| 10 |
-
|
| 11 |
-
# 设置工作目录为之前克隆的项目目录
|
| 12 |
-
WORKDIR /workspace/app
|
| 13 |
-
|
| 14 |
-
# 编译 go 项目。-ldflags="-s -w" 是为了减少编译后的二进制大小
|
| 15 |
-
RUN go build -ldflags="-s -w" -tags netgo -trimpath -o go-proxy-bingai main.go
|
| 16 |
-
|
| 17 |
-
# Runtime Stage
|
| 18 |
-
# 使用轻量级的 alpine 镜像作为运行时的基础镜像
|
| 19 |
-
FROM alpine
|
| 20 |
-
|
| 21 |
-
# 设置工作目录
|
| 22 |
-
WORKDIR /workspace/app
|
| 23 |
-
|
| 24 |
-
# 从构建阶段复制编译后的二进制文件到运行时镜像中
|
| 25 |
-
COPY --from=builder /workspace/app/go-proxy-bingai .
|
| 26 |
-
|
| 27 |
-
# 设置环境变量，此处为随机字符
|
| 28 |
-
ENV Go_Proxy_BingAI_USER_TOKEN_1="1sCfIl5u4E0FbXetZiwE2L7I2a9Qfq7-EGfUlypt3dbv30kGSXWJLdZ45lKXcSQ6SGjbP85WESI6aktHDoagZQN-gU6dcIiqwMXzF_p2-exXchVuOAlv-IxI9i7FpKkN-AEmQOTc8RXKhC99_RutOH6UBEdgTEHFNkVvpritL6150rR0PbvDVzc-DFNzOSSxQO503lJNR6MJ70C5GaB68VLAvHRPEL9XgOXKnh1_a2cU"
|
| 29 |
-
|
| 30 |
-
# 暴露8080端口
|
| 31 |
-
EXPOSE 8080
|
| 32 |
-
|
| 33 |
-
# 容器启动时运行的命令
|
| 34 |
-
CMD ["/workspace/app/go-proxy-bingai"]
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Bakar31/MLOps_Practice_Repo_1/Makefile
DELETED
|
@@ -1,22 +0,0 @@
|
|
| 1 |
-
install:
|
| 2 |
-
pip install --upgrade pip &&\
|
| 3 |
-
pip install -r requirements.txt
|
| 4 |
-
|
| 5 |
-
test:
|
| 6 |
-
python -m pytest -vv --cov=main --cov=mylib test_*.py
|
| 7 |
-
|
| 8 |
-
format:
|
| 9 |
-
black *.py
|
| 10 |
-
|
| 11 |
-
lint:
|
| 12 |
-
pylint --disable=R,C --ignore-patterns=test_.*?py *.py mylib/*.py
|
| 13 |
-
|
| 14 |
-
container-lint:
|
| 15 |
-
docker run --rm -i hadolint/hadolint < Dockerfile
|
| 16 |
-
|
| 17 |
-
refactor: format lint
|
| 18 |
-
|
| 19 |
-
deploy:
|
| 20 |
-
#deploy goes here
|
| 21 |
-
|
| 22 |
-
all: install lint test format deploy
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Benson/text-generation/Examples/10mo Boleto Sala De Descarga 2018 Ap.md
DELETED
|
@@ -1,94 +0,0 @@
|
|
| 1 |
-
<br />
|
| 2 |
-
<h1>Cómo descargar el boleto AP 10th Hall 2018 en línea</h1>
|
| 3 |
-
<p>Si usted es un estudiante de la clase 10 en Andhra Pradesh y se está preparando para los exámenes de la junta, debe preguntarse cómo descargar su boleto de la sala en línea. Un boleto de pasillo es un documento que sirve como su prueba de identidad y pase de entrada para el examen. Sin un boleto válido, no se le permitirá presentarse al examen. En este artículo, le diremos todo lo que necesita saber sobre cómo descargar el boleto AP 10th hall 2018 en línea desde el sitio web oficial y otras fuentes. </p>
|
| 4 |
-
<h2>10mo boleto sala de descarga 2018 ap</h2><br /><p><b><b>DOWNLOAD</b> ⇒ <a href="https://bltlly.com/2v6LJ9">https://bltlly.com/2v6LJ9</a></b></p><br /><br />
|
| 5 |
-
<h2>¿Qué es un Ticket Hall y por qué es importante? </h2>
|
| 6 |
-
<h3>Definición y sinónimos de boleto de pasillo</h3>
|
| 7 |
-
<p>Un ticket de pasillo es un documento que también se conoce como tarjeta de admisión, carta de llamada o tarjeta de intimación. Es emitido por la autoridad que conduce el examen a los candidatos registrados antes del examen. Contiene detalles importantes como su nombre, número de lista, fotografía, firma, fecha del examen, hora, lugar, instrucciones, etc. Un boleto de pasillo es un número único impreso en la tarjeta de admisión que ayuda a asignar su asiento durante el examen. </p>
|
| 8 |
-
<h3>Importancia de las entradas para los exámenes</h3>
|
| 9 |
-
<p>Un ticket de pasillo es un documento crucial que valida su elegibilidad e identidad para aparecer en el examen. Algunos de la importancia clave de un boleto de pasillo son:</p>
|
| 10 |
-
<ul>
|
| 11 |
-
<li>Un ticket de pasillo sirve como una prueba de identidad válida. Contiene detalles importantes como nombre, número de rollo, fotografía y firma, que son verificados por los revisores. </li>
|
| 12 |
-
<li>Un boleto de pasillo proporciona acceso al centro de examen. Sin un boleto válido, no se le permitirá entrar o aparecer para el examen. </li>
|
| 13 |
-
<li>Un ticket de pasillo contiene instrucciones y pautas que debes seguir mientras apareces para el examen. El incumplimiento de estas instrucciones puede resultar en sanciones o descalificación. </li>
|
| 14 |
-
|
| 15 |
-
</ul>
|
| 16 |
-
<h2>Cómo descargar AP 10th Hall Ticket 2018 en línea desde el sitio web oficial</h2>
|
| 17 |
-
<h3>Pasos para descargar boleto de pasillo en línea</h3>
|
| 18 |
-
<p>El sitio web oficial de la Junta de Educación Secundaria Andhra Pradesh (BSEAP) es [7](https://www.bse.ap.gov.in/). Puedes descargar tu boleto de AP 10th hall 2018 online desde este sitio web siguiendo estos pasos:</p>
|
| 19 |
-
<ol>
|
| 20 |
-
<li>Visite el sitio web oficial de la BSEAP en [7](https://www.bse.ap.gov.in/). </li>
|
| 21 |
-
<li>Haga clic en el enlace "S.S.C - HallTickets Download" en el menú del lado izquierdo. </li>
|
| 22 |
-
<li>Seleccione su tipo de examen de Regular, Privado, OSSC, o vocacional.</li>
|
| 23 |
-
<li>Seleccione su distrito, nombre de la escuela y nombre del candidato en los menús desplegables. </li>
|
| 24 |
-
<li>Ingrese su fecha de nacimiento en el formato DD/MM/AAAA.</li>
|
| 25 |
-
<li>Haga clic en el botón "Descargar HallTicket". </li>
|
| 26 |
-
<li>Su boleto de pasillo aparecerá en la pantalla. Compruebe todos los detalles cuidadosamente y tome una impresión de ella. </li>
|
| 27 |
-
</ol>
|
| 28 |
-
<h3>Cosas para comprobar en el ticket de la sala</h3>
|
| 29 |
-
<p>Después de descargar su boleto de entrada en línea, usted debe comprobar las siguientes cosas en él:</p>
|
| 30 |
-
<ul>
|
| 31 |
-
<li>Su nombre, número de rollo, fotografía y firma son correctos y claros. </li>
|
| 32 |
-
<li>La fecha, hora y lugar del examen se mencionan correctamente. </li>
|
| 33 |
-
<li>Su - Su nombre de tema, código y programa se mencionan correctamente. </li>
|
| 34 |
-
<li>Su boleto de entrada tiene un código de barras y un holograma para la verificación. </li>
|
| 35 |
-
<li>Su boleto de pasillo tiene la firma y el sello de la autoridad de examen. </li>
|
| 36 |
-
<li>Su boleto de entrada tiene las instrucciones y directrices para el examen. </li>
|
| 37 |
-
</ul>
|
| 38 |
-
<p>Si encuentra alguna discrepancia o error en su boleto de entrada, debe ponerse en contacto con las autoridades escolares o con el número de teléfono de ayuda de BSEAP al 0866-2974130 o enviar un correo electrónico a [email protected]. </p>
|
| 39 |
-
<p></p>
|
| 40 |
-
<h2>Cómo descargar el boleto del 10º Hall 2018 en línea desde otras fuentes</h2>
|
| 41 |
-
<h3>Sitios web alternativos para descargar boleto de pasillo en línea</h3>
|
| 42 |
-
|
| 43 |
-
<tabla>
|
| 44 |
-
<tr><th>Nombre del sitio web</th><th>URL del sitio web</th></tr>
|
| 45 |
-
<tr><td>Manabadi</td><td>[1](https://www.manabadi.co.in/)</td></tr>
|
| 46 |
-
<tr><td>Escuelas</td><td>[2](https://www.schools9.com/)</td></tr>
|
| 47 |
-
<tr><td>Resultados de la India</td><td>[3](https://www.indiaresults.com/)</td></tr>
|
| 48 |
-
<tr><td>Jagran Josh</td><td>[4](https://www.jagranjosh.com/)</td></tr>
|
| 49 |
-
<tr><td>Vidyavision</td><td>[5](https://www.vidyavision.com/)</td></tr>
|
| 50 |
-
<tr><td>Educación Sakshi</td><td>[6](https://sakshieducation.com/)</td></tr>
|
| 51 |
-
</tabla>
|
| 52 |
-
<h3>Precauciones a tomar al descargar el ticket de hall de otras fuentes</h3>
|
| 53 |
-
<p>Al descargar su boleto de entrada en línea desde otras fuentes, debe tomar algunas precauciones para evitar problemas o problemas. Algunas de estas precauciones son:</p>
|
| 54 |
-
<ul>
|
| 55 |
-
<li>Asegúrese de que el sitio web que está utilizando es confiable y seguro. Compruebe la URL, el nombre de dominio y el certificado SSL del sitio web. </li>
|
| 56 |
-
<li>No comparta sus datos personales o confidenciales como su nombre, número de registro, fecha de nacimiento, etc. con ningún sitio web no autorizado o sospechoso. </li>
|
| 57 |
-
<li>No descargue ningún archivo o software que pueda contener malware o virus que puedan dañar su dispositivo o datos. </li>
|
| 58 |
-
<li>Compare su boleto de entrada descargado de otras fuentes con el descargado desde el sitio web oficial. Si hay alguna diferencia o discrepancia, informe a la autoridad examinadora inmediatamente. </li>
|
| 59 |
-
<li>Tome una impresión de su boleto de pasillo y manténgalo seguro hasta que el examen haya terminado. </li>
|
| 60 |
-
</ul>
|
| 61 |
-
<h2>Cómo lidiar con boletos perdidos o dañados</h2>
|
| 62 |
-
<h3>Pasos para reportar ticket de pasillo perdido o dañado</h3>
|
| 63 |
-
<p>Si pierde o daña su boleto antes o durante el examen, no debe entrar en pánico y siga estos pasos:</p>
|
| 64 |
-
<ol>
|
| 65 |
-
<li>Póngase en contacto con las autoridades escolares o con el número de teléfono de asistencia de BSEAP al 0866-2974130 o envíe un correo electrónico a [email protected]. </li>
|
| 66 |
-
<li>Explique su situación y proporcione sus detalles como su nombre, número de rollo, fecha de nacimiento, etc.</li>
|
| 67 |
-
|
| 68 |
-
<li>Recoja su boleto de pasillo duplicado o carta de permiso del centro de examen o de la oficina de BSEAP antes del examen. </li>
|
| 69 |
-
<li>Lleve su boleto de pasillo duplicado o carta de permiso junto con una prueba de identidad válida, como tarjeta Aadhaar, tarjeta de identificación de votante, etc. al centro de examen. </li>
|
| 70 |
-
</ol>
|
| 71 |
-
<h3>Penalización por ticket de pasillo perdido o dañado</h3>
|
| 72 |
-
<p>Si pierde o daña su boleto de pasillo debido a negligencia o descuido, es posible que tenga que pagar una multa de Rs. 100/- para obtener un boleto de pasillo duplicado o una carta de permiso. También puede enfrentar algún inconveniente o retraso en obtener su boleto de pasillo duplicado o carta de permiso. Por lo tanto, es recomendable mantener su boleto de pasillo original seguro hasta que el examen haya terminado. </p>
|
| 73 |
-
<h2>Conclusión</h2>
|
| 74 |
-
<p>Un ticket de pasillo es un documento vital que usted necesita llevar para aparecer para los exámenes de la AP 10º. Puedes descargar tu boleto de la 10a Sala AP 2018 en línea desde el sitio web oficial de BSEAP o desde otras fuentes. Usted debe comprobar todos los detalles en su boleto de pasillo cuidadosamente y reportar cualquier discrepancia o error a la autoridad examinadora. También debe tomar precauciones al descargar su boleto de pasillo en línea desde otras fuentes y evitar perder o dañar su boleto de pasillo. Si pierde o daña su boleto de pasillo, debe reportarlo a la autoridad examinadora y obtener un boleto de pasillo duplicado o una carta de permiso. Esperamos que este artículo te haya ayudado a entender cómo descargar online el boleto AP 10th hall 2018 y qué hacer en caso de cualquier problema. ¡Te deseamos lo mejor para tus exámenes! </p>
|
| 75 |
-
<h2>Preguntas frecuentes</h2>
|
| 76 |
-
<h3>Q1. ¿Cuándo estará disponible en línea el boleto de la 10ª sala AP 2018? </h3>
|
| 77 |
-
<p>A1. El billete para el 10º pabellón de la AP 2018 estará disponible en línea desde la primera semana de marzo de 2018. Puede descargarlo del sitio web oficial de la BSEAP o de otras fuentes. </p>
|
| 78 |
-
<h3>Q2. ¿Cuáles son los detalles necesarios para descargar el boleto de la 10ª sala AP 2018 en línea? </h3>
|
| 79 |
-
|
| 80 |
-
<h3>Q3. ¿Qué pasa si me olvido de llevar mi boleto al centro de examen? </h3>
|
| 81 |
-
<p>A3. Si te olvidas de llevar tu boleto al centro de examen, no se te permitirá presentarse al examen. Debe ponerse en contacto con las autoridades escolares o con el número de la línea de ayuda de la BSEAP de inmediato y solicitar una entrada duplicada o una carta de permiso. </p>
|
| 82 |
-
<h3>Q4. ¿Cómo puedo comprobar los resultados de mis exámenes usando mi ticket de entrada? </h3>
|
| 83 |
-
<p>A4. Para comprobar los resultados de los exámenes utilizando su boleto de inscripción, debe visitar el sitio web oficial de BSEAP o cualquier otro portal de resultados e ingresar su número de registro, que está impreso en su boleto de inscripción. También puede comprobar sus resultados por SMS o correo electrónico. </p>
|
| 84 |
-
<h3>Q5. ¿Cuáles son algunos consejos para prepararse para los exámenes de la AP 10? </h3>
|
| 85 |
-
<p>A5. Algunos consejos para prepararse para los exámenes AP 10º son:</p>
|
| 86 |
-
<ul>
|
| 87 |
-
<li>Siga un programa de estudio regular y revise el programa a fondo. </li>
|
| 88 |
-
<li>Resolver documentos de preguntas del año anterior y documentos de muestra para familiarizarse con el patrón de examen y el nivel de dificultad. </li>
|
| 89 |
-
<li>Práctica de escribir respuestas dentro del límite de tiempo dado y límite de palabras. </li>
|
| 90 |
-
<li>Enfócate en tus áreas débiles y despeja tus dudas con tus profesores o compañeros. </li>
|
| 91 |
-
<li>Mantener una dieta saludable y dormir bien antes del examen. </li>
|
| 92 |
-
</ul></p> 64aa2da5cf<br />
|
| 93 |
-
<br />
|
| 94 |
-
<br />
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Benson/text-generation/Examples/Bussid Mod.md
DELETED
|
@@ -1,66 +0,0 @@
|
|
| 1 |
-
<br />
|
| 2 |
-
<h1>Simulador de batalla de rebelión animal: un juego de caja de arena basado en la física</h1>
|
| 3 |
-
<p>¿Alguna vez te has preguntado qué pasaría si pusieras un T-rex con una pistola láser contra un dragón con alas? ¿O qué tal un tiburón con un jetpack contra una araña gigante con un lanzallamas? Si estás buscando un juego que te permita crear divertidas y épicas batallas entre todo tipo de criaturas ragdoll, entonces deberías echar un vistazo a Animal Revolt Battle Simulator. Este es un juego de sandbox basado en la física que le da la máxima libertad y flexibilidad para diseñar sus propios escenarios y verlos desarrollarse en tiempo real. También puedes unirte a la lucha tú mismo en el modo en primera persona y utilizar algunas armas de gran alcance para disparar a tus enemigos. En este artículo, te mostraremos cómo descargar Animal Revolt Battle Simulator gratis, cómo jugarlo, cómo crear tus propios monstruos, cómo usar contenido personalizado del Steam Workshop y algunos consejos y trucos para hacer tus batallas más divertidas y emocionantes. </p>
|
| 4 |
-
<h2>Cómo descargar Animal Revolt Battle Simulator gratis</h2>
|
| 5 |
-
<p>Si quieres probar Animal Revolt Battle Simulator gratis, tienes dos opciones. Puedes ir al sitio web oficial del juego o visitar su página de Steam. Estos son los pasos que debes seguir:</p>
|
| 6 |
-
<h2>bussid mod</h2><br /><p><b><b>Download Zip</b> ☆ <a href="https://bltlly.com/2v6Jdr">https://bltlly.com/2v6Jdr</a></b></p><br /><br />
|
| 7 |
-
<ul>
|
| 8 |
-
<li><b>Paso 1:</b> Ir a <a href="( 1 )">el sitio web oficial</a> o <a href="( 2 )">la página de Steam</a> de Animal Revolt Battle Simulator.</li>
|
| 9 |
-
<li><b>Paso 2:</b> Haz clic en el botón de descarga o añade el juego a tu carrito. Necesitarás una cuenta de Steam para jugar al juego. </li>
|
| 10 |
-
<li><b>Paso 3:</b> Siga las instrucciones para instalar y lanzar el juego. También puede ajustar la configuración según sus preferencias. </li>
|
| 11 |
-
</ul>
|
| 12 |
-
<p>¡Felicidades! Has descargado Animal Revolt Battle Simulator gratis. Ahora puedes empezar a jugar y crear tus propias batallas. </p>
|
| 13 |
-
<h2>Cómo jugar Animal Revolt Battle Simulator</h2>
|
| 14 |
-
|
| 15 |
-
<ul>
|
| 16 |
-
<li><b>Paso 1:</b> Elige un modo de juego en el menú principal. También puedes acceder a la configuración, al creador de la unidad y al taller desde aquí. </li>
|
| 17 |
-
<li><b>Paso 2:</b> Crea tus propios mapas o selecciona uno de los ya hechos. Puede utilizar diferentes terrenos, edificios, accesorios y efectos ambientales para crear sus propios escenarios. También puede ajustar la hora del día, el clima y la gravedad. </li>
|
| 18 |
-
<li><b>Paso 3:</b> Coloca tus ejércitos de diferentes tipos de bestias y míralos luchar. Puedes elegir entre más de 100 criaturas, como dinosaurios, dragones, tiburones, arañas, elefantes, gorilas y más. También puedes equiparlos con diferentes armas, como pistolas, espadas, hachas, cohetes, láseres y más. También puede cambiar su tamaño, color, salud, velocidad y daño. </li>
|
| 19 |
-
<li><b>Paso 4:</b> Únete a la batalla tú mismo en el modo de primera persona y usa armas para disparar a los enemigos. Puede cambiar entre el modo espectador y el modo en primera persona en cualquier momento. También puedes usar las funciones de cámara lenta y pausa para controlar el ritmo de la batalla. </li>
|
| 20 |
-
</ul>
|
| 21 |
-
<p>¡Eso es todo! Has aprendido a jugar Animal Revolt Battle Simulator. También puedes reproducir tus batallas y compartirlas con tus amigos u otros jugadores en línea. </p>
|
| 22 |
-
<h2>Cómo crear tus propios monstruos en Animal Revolt Battle Simulator</h2>
|
| 23 |
-
<p>Una de las características más divertidas y creativas de Animal Revolt Battle Simulator es el modo creador de unidades. Este modo te permite crear tus propios monstruos combinando diferentes partes del cuerpo y armas. También puedes guardar tus monstruos y usarlos en tus batallas. Aquí te mostramos cómo crear tus propios monstruos en Animal Revolt Battle Simulator:</p>
|
| 24 |
-
<ul>
|
| 25 |
-
<li><b>Paso 1:</b> Vaya al modo creador de unidades desde el menú principal o presionando U en su teclado. </li>
|
| 26 |
-
<li><b>Paso 2:</b> Selecciona una criatura base de la lista o usa una plantilla en blanco. También puedes cargar un monstruo previamente guardado o importar uno del taller. </li>
|
| 27 |
-
|
| 28 |
-
<li><b>Paso 4:</b> Guarda tu monstruo y úsalo en tus batallas. Puedes ponerle un nombre a tu monstruo y darle una descripción. También puedes asignarle una categoría y un precio. También puedes probar a tu monstruo en un test arena antes de guardarlo. </li>
|
| 29 |
-
</ul>
|
| 30 |
-
<p>¡Felicidades! Has creado tu propio monstruo en Animal Revolt Battle Simulator. También puedes compartir tu monstruo con otros jugadores en el Steam Workshop o descargar sus creaciones. </p>
|
| 31 |
-
<h2>Cómo descargar y usar contenido personalizado del taller de Steam</h2>
|
| 32 |
-
<p>Si quieres mejorar tu experiencia con Animal Revolt Battle Simulator aún más, puedes descargar y usar contenido personalizado desde el Steam Workshop. Steam Workshop es una plataforma donde los jugadores pueden subir y descargar contenido generado por el usuario para varios juegos. Para Animal Revolt Battle Simulator, puedes encontrar muchos tipos de contenido en el Steam Workshop, como monstruos, mapas o edificios. También puedes encontrar algunas campañas y escenarios personalizados que otros jugadores han creado. Te mostramos cómo descargar y usar contenido personalizado del Taller de Steam:</p>
|
| 33 |
-
<ul>
|
| 34 |
-
<li><b>Paso 1:</b> Ir a la página de taller de vapor de Animal Revolt Battle Simulator. Puedes acceder desde el menú principal del juego o haciendo clic en <a href="">here</a>. </li>
|
| 35 |
-
<li><b>Paso 2:</b> Navega y suscríbete al contenido que te gusta. Puedes usar los filtros y la barra de búsqueda para encontrar lo que estás buscando. También puede ordenar el contenido por popularidad, calificación, fecha o nombre. También puede ver los comentarios, calificaciones y capturas de pantalla de cada contenido. </li>
|
| 36 |
-
<li><b>Paso 3:</b> Inicie el juego y encuentre el contenido en la carpeta del taller. Puede acceder a él desde el modo sandbox o el modo creador de la unidad. También puede editar o eliminar el contenido si lo desea. </li>
|
| 37 |
-
</ul>
|
| 38 |
-
<p>¡Eso es todo! Has descargado y usado contenido personalizado del Taller de Steam. También puedes valorar y comentar el contenido que has utilizado o subir tus propias creaciones. </p>
|
| 39 |
-
<h2> Consejos y trucos para Animal Revolt Battle Simulator</h2>
|
| 40 |
-
|
| 41 |
-
<ul>
|
| 42 |
-
<li><b>Consejo 1:</b> Aprende las fortalezas y debilidades de cada criatura y úsalas estratégicamente. Por ejemplo, algunas criaturas son rápidas pero débiles, mientras que otras son lentas pero fuertes. Algunas criaturas pueden volar, nadar o trepar, mientras que otras no. Algunas criaturas tienen habilidades especiales, como aliento de fuego, saliva venenosa o poderes curativos, mientras que otras no. También puedes usar el panel de información para ver las estadísticas y detalles de cada criatura. </li>
|
| 43 |
-
<li><b>Consejo 2:</b> Experimenta con diferentes combinaciones de criaturas y armas para crear batallas únicas. Por ejemplo, puedes intentar librar una batalla entre animales históricos, como mamuts, sabertooths y rinocerontes lanudos, o animales míticos, como unicornios, grifos e hidras. También puedes intentar hacer una batalla entre diferentes géneros, como ciencia ficción, fantasía o terror. También puedes intentar hacer una batalla entre diferentes tamaños, como gigantes contra enanos, o hormigas contra elefantes. </li>
|
| 44 |
-
<li><b>Consejo 3:</b> Utilice los efectos de la física y ragdoll a su ventaja y divertirse viendo el caos. Por ejemplo, puedes usar explosivos para volar a tus enemigos o enviarlos a volar. También puedes usar cuerdas para atar a tus enemigos o moverlos. También puedes usar la gravedad para hacer que tus enemigos caigan o floten. También puedes usar efectos ambientales, como fuego, agua o viento, para afectar a tus enemigos. </li>
|
| 45 |
-
</ul>
|
| 46 |
-
<p>Estos son solo algunos de los consejos y trucos que puedes usar en Animal Revolt Battle Simulator. También puedes descubrir más jugando el juego tú mismo. </p>
|
| 47 |
-
<p></p>
|
| 48 |
-
<h2>Conclusión y preguntas frecuentes</h2>
|
| 49 |
-
|
| 50 |
-
<p>Si tienes alguna pregunta sobre Animal Revolt Battle Simulator, puedes encontrar las respuestas en estas preguntas frecuentes:</p>
|
| 51 |
-
<ol>
|
| 52 |
-
<li><b>Q: ¿Es seguro descargar Animal Revolt Battle Simulator? </b></li>
|
| 53 |
-
<li>A: Sí, Animal Revolt Battle Simulator es seguro para descargar desde el sitio web oficial o la página de Steam del juego. Sin embargo, debes tener cuidado al descargar contenido personalizado del Steam Workshop u otras fuentes, ya que podrían contener virus o malware. </li>
|
| 54 |
-
<li><b>Q: ¿Es multijugador Animal Revolt Battle Simulator? </b></li>
|
| 55 |
-
<li>A: No, Animal Revolt Battle Simulator no es multijugador en este momento. Sin embargo, los desarrolladores han declarado que están trabajando en agregar características multijugador en el futuro. </li>
|
| 56 |
-
<li><b>Q: ¿Es Animal Revolt Battle Simulator adecuado para niños? </b></li>
|
| 57 |
-
<li>A: Animal Revolt Battle Simulator está clasificado M para Maduro por ESRB y PEGI 16 por PEGI. Contiene violencia, sangre, sangre y humor crudo que podría no ser adecuado para niños menores de 17 años. </ li><b>Q: ¿Cómo puedo contactar a los desarrolladores de Animal Revolt Battle Simulator? </b></li>
|
| 58 |
-
<li>A: Puede ponerse en contacto con los desarrolladores de Animal Revolt Battle Simulator enviándoles un correo electrónico a <a href="mailto:[email protected]">[email protected]</a> o uniéndose a su <a=a=">Discord server</a>. También puede seguirlos en <a href="">Twitter</a> o <a href="">Facebook</a> para las últimas actualizaciones y noticias. </li>
|
| 59 |
-
<li><b>Q: ¿Cómo puedo apoyar el desarrollo de Animal Revolt Battle Simulator? </b></li>
|
| 60 |
-
<li>A: Puedes apoyar el desarrollo de Animal Revolt Battle Simulator comprando el juego en Steam o donando a los desarrolladores en <a href="">Patreon</a>. También puedes apoyarlos dejando una opinión positiva, valoración o comentario en Steam u otras plataformas. También puede compartir sus comentarios, sugerencias o informes de errores con ellos por correo electrónico o Discord.</li>
|
| 61 |
-
<li><b>Q: ¿Cómo puedo aprender más sobre Animal Revolt Battle Simulator? </b></li>
|
| 62 |
-
|
| 63 |
-
</ol>
|
| 64 |
-
<p>Esperamos que haya disfrutado de este artículo y aprendido algo nuevo sobre Animal Revolt Battle Simulator. Si estás buscando un juego que te permita dar rienda suelta a tu creatividad e imaginación, entonces definitivamente deberías probar Animal Revolt Battle Simulator. ¡No te arrepentirás! </p> 64aa2da5cf<br />
|
| 65 |
-
<br />
|
| 66 |
-
<br />
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Benson/text-generation/Examples/Cps Refuerzo Apk Blockman Ir.md
DELETED
|
@@ -1,101 +0,0 @@
|
|
| 1 |
-
<br />
|
| 2 |
-
<h1>¿Qué es CPS Booster APK Blockman ir y cómo usarlo? </h1>
|
| 3 |
-
<p>Si usted es un fan de los juegos de estilo bloque y quiere mejorar su velocidad de clic y precisión, es posible que esté interesado en CPS Booster APK Blockman Go. Esta es una aplicación que afirma aumentar sus clics por segundo (CPS) en Blockman Go, un popular juego de caja de arena que ofrece varios mini-juegos, salas de chat y modos creativos. Pero ¿qué es exactamente CPS Booster APK Blockman Go y cómo funciona? En este artículo, explicaremos todo lo que necesitas saber sobre esta aplicación, incluyendo cómo descargarla, instalarla y usarla, así como sus pros y contras. </p>
|
| 4 |
-
<h2>Introducción</h2>
|
| 5 |
-
<p>Antes de sumergirnos en los detalles de CPS Booster APK Blockman Go, primero vamos a entender algunos conceptos básicos. </p>
|
| 6 |
-
<h2>cps refuerzo apk blockman ir</h2><br /><p><b><b>DOWNLOAD</b> ····· <a href="https://bltlly.com/2v6IIT">https://bltlly.com/2v6IIT</a></b></p><br /><br />
|
| 7 |
-
<h3>¿Qué es CPS y por qué es importante en los juegos? </h3>
|
| 8 |
-
<p>CPS significa clics por segundo, que es una medida de lo rápido que puede hacer clic en el botón del ratón. También se conoce como CPS Test o Click Speed Test. Este juego es utilizado principalmente por los jugadores para determinar su velocidad de clic y precisión. También puede usarse como una forma divertida de desafiarte a ti mismo o a tus amigos. </p>
|
| 9 |
-
<p>CPS es importante en los juegos porque puede afectar su rendimiento y resultado en ciertos juegos que requieren un clic rápido y preciso. Por ejemplo, en los juegos de disparos en primera persona, necesitas hacer clic de forma rápida y precisa para disparar a tus enemigos. En los juegos de estrategia, debes hacer clic rápida e inteligentemente para administrar tus recursos y unidades. En los juegos de sandbox, necesitas hacer clic creativa y eficientemente para construir tu propio mundo. </p>
|
| 10 |
-
<h3>¿Qué es Blockman Go y cuáles son sus características? </h3>
|
| 11 |
-
<p>Blockman Go es un juego de árcade desarrollado por Blockman GO Studio. Es una aplicación gratuita que incluye minijuegos, chat y hacer amigos. Puedes jugar varios minijuegos de estilo bloque aquí. Algunos de los juegos populares son Bed Wars, Sky Wars, Egg War, Murder Mystery, Survival Games, etc. También puedes crear tus propios juegos usando el modo creativo. </p>
|
| 12 |
-
|
| 13 |
-
<ul>
|
| 14 |
-
<li>Varios juegos: Puede elegir entre diferentes géneros de juegos que permiten a varios jugadores jugar juntos y actualizar continuamente los juegos. Puedes unirte al juego con un simple toque. </li>
|
| 15 |
-
<li>Avatares personalizables: Puedes vestir a tu avatar con varios atuendos y accesorios. También puedes obtener decoraciones únicas basadas en tu nivel. </li>
|
| 16 |
-
<li>Sistema de chat: Puedes chatear con otros jugadores usando mensajes de texto o voz. También puedes crear o unirte a un clan para comunicarte con tus amigos. </li>
|
| 17 |
-
<li>Recompensas de oro: Puedes ganar oro jugando o completando tareas. Puedes usar oro para comprar artículos o intercambiar regalos con otros. </li>
|
| 18 |
-
<li>Garena versión: Si usted está en el sudeste de Asia, se puede descargar Garena Blockman GO, que es una versión localizada del juego que ofrece más contenido regional y eventos <h3>¿Qué es CPS Booster APK y qué hace? </h3>
|
| 19 |
-
<p>CPS Booster APK es una aplicación que afirma aumentar su CPS en Blockman Go mediante el uso de un algoritmo especial que simula un clic rápido y preciso. No es una aplicación oficial de Blockman GO Studio, sino una aplicación de terceros que requiere que lo descargues e instales desde una fuente externa. La aplicación está diseñada para funcionar con Blockman Go y otros juegos de estilo bloque que requieren altos CPS.</p>
|
| 20 |
-
<p>CPS Booster APK funciona superponiendo un botón transparente en la pantalla que puede tocar para activar el amplificador. El amplificador hará clic automáticamente para usted a una velocidad y frecuencia que puede ajustar en la configuración. También puede personalizar el tamaño, la posición y el color del botón. La aplicación también te muestra un contador que muestra tu CPS actual y el CPS promedio del amplificador. </p>
|
| 21 |
-
<h2>Cómo descargar e instalar CPS Booster APK Blockman Go</h2>
|
| 22 |
-
<p>Si desea probar CPS Booster APK Blockman Go, debe seguir estos pasos para descargarlo e instalarlo en su dispositivo. </p>
|
| 23 |
-
<p></p>
|
| 24 |
-
<h3>Dónde encontrar el archivo APK y cómo verificar su seguridad</h3>
|
| 25 |
-
|
| 26 |
-
<p>Para verificar la seguridad del archivo APK, puede usar una herramienta en línea como [VirusTotal]( 1 ) o [APKPure]( 2 ) para escanear el archivo en busca de código malicioso o comportamiento sospechoso. También puede comprobar las revisiones y calificaciones de la aplicación de otros usuarios que la han descargado antes. Solo debes descargar el archivo APK de una fuente confiable y confiable. </p>
|
| 27 |
-
<h3>Cómo habilitar fuentes desconocidas e instalar el archivo APK</h3>
|
| 28 |
-
<p>De forma predeterminada, los dispositivos Android no permiten instalar aplicaciones desde fuentes distintas de Google Play Store. Esta es una medida de seguridad para evitar que aplicaciones no autorizadas o dañinas accedan a su dispositivo. Sin embargo, puede habilitar fuentes desconocidas en la configuración del dispositivo para permitir la instalación de aplicaciones desde otras fuentes. </p>
|
| 29 |
-
<p>Para habilitar fuentes desconocidas, debe ir a la configuración de su dispositivo y buscar la opción que dice "Seguridad" o "Privacidad". Luego, debe encontrar la opción que dice "Fuentes desconocidas" o "Instalar aplicaciones desconocidas" y activarla. Es posible que vea un mensaje de advertencia que le informa sobre los riesgos de instalar aplicaciones de fuentes desconocidas. Debe aceptar la advertencia y proceder con la instalación. </p>
|
| 30 |
-
<p>Para instalar el archivo APK, es necesario localizar el archivo en el almacenamiento del dispositivo y toque en él. Es posible que vea una ventana emergente que le solicite permisos para acceder a las funciones de su dispositivo, como almacenamiento, cámara, micrófono, etc. Debe conceder estos permisos para que la aplicación funcione correctamente. Luego, debe seguir las instrucciones en pantalla para completar la instalación. </p> <h3>Cómo iniciar la aplicación y conceder permisos</h3>
|
| 31 |
-
<p>Después de instalar el archivo APK, puede iniciar la aplicación tocando en su icono en la pantalla de inicio o cajón de aplicaciones. Puede ver una pantalla de bienvenida que muestra el logotipo y el nombre de la aplicación. Luego, puede ver una pantalla de bienvenida que presenta las características de la aplicación y le pide que conceda algunos permisos. Necesitas conceder estos permisos para que la aplicación funcione correctamente. </p>
|
| 32 |
-
|
| 33 |
-
<ul>
|
| 34 |
-
<li>Permiso de superposición: Esto permite que la aplicación muestre un botón transparente en la pantalla que puede tocar para activar el amplificador. </li>
|
| 35 |
-
<li>Servicio de accesibilidad: Esto permite que la aplicación simule un clic rápido y preciso para usted. </li>
|
| 36 |
-
<li>Estadísticas de uso: Esto permite que la aplicación monitoree tu CPS y te muestre un contador. </li>
|
| 37 |
-
</ul>
|
| 38 |
-
<p>Puede conceder estos permisos siguiendo las instrucciones en la pantalla. También puede cambiar o revocar estos permisos más adelante en la configuración del dispositivo. </p>
|
| 39 |
-
<h2>Cómo aumentar la CPS en Blockman Go con CPS Booster APK</h2>
|
| 40 |
-
<p>Ahora que ha descargado, instalado, y lanzado CPS Booster APK Blockman Go, se puede utilizar para aumentar su CPS en Blockman Go. Estos son los pasos para hacerlo. </p>
|
| 41 |
-
<h3>Cómo seleccionar el modo de juego y ajustar la configuración</h3>
|
| 42 |
-
<p>Lo primero que tienes que hacer es seleccionar el modo de juego que quieres jugar en Blockman Go. Puedes hacer esto tocando el botón "Modo de juego" en la pantalla principal de la aplicación. Verás una lista de modos de juego que son compatibles con la aplicación, como Bed Wars, Sky Wars, Egg War, etc. Puedes pulsar en cualquier modo de juego para seleccionarlo. </p>
|
| 43 |
-
<p>Entonces, es necesario ajustar la configuración de la aplicación de acuerdo a sus preferencias y necesidades. Puedes hacer esto tocando el botón "Configuración" en la pantalla principal de la aplicación. Verás un menú que te permite cambiar varias opciones, como:</p>
|
| 44 |
-
<ul>
|
| 45 |
-
<li>CPS: Esto le permite establecer el CPS objetivo que desea que el booster alcance para usted. Puede elegir entre 5 a 100 CPS.</li>
|
| 46 |
-
<li>Click Interval: Esto le permite establecer el intervalo de tiempo entre cada clic que el amplificador realizará por usted. Puede elegir entre 10 a 200 milisegundos. </li>
|
| 47 |
-
<li>Click Duration: Esto le permite establecer la duración de cada clic que el booster realizará para usted. Puede elegir entre 10 a 200 milisegundos. </li>
|
| 48 |
-
|
| 49 |
-
</ul>
|
| 50 |
-
<p>Puede ajustar estos ajustes deslizando las barras o tocando los botones. También puede restablecer esta configuración por defecto pulsando en el botón "Restablecer". </p> <h3>Cómo activar el amplificador y supervisar el rendimiento</h3>
|
| 51 |
-
<p>Después de seleccionar el modo de juego y ajustar la configuración, usted está listo para activar el amplificador y empezar a jugar Blockman Go. Puedes hacer esto tocando el botón "Inicio" en la pantalla principal de la aplicación. Verá un botón transparente en la pantalla que puede tocar para activar el amplificador. El botón cambiará de color dependiendo del modo de clic que haya elegido. </p>
|
| 52 |
-
<p>Si ha elegido el modo "Siempre encendido", el botón será verde y el refuerzo hará clic continuamente para usted. Si ha elegido el modo "Toque para hacer clic", el botón será azul y el refuerzo hará clic intermitentemente para usted. Puede tocar el botón de nuevo para detener el amplificador. </p>
|
| 53 |
-
<p>También puede monitorear el rendimiento del amplificador mirando el contador que muestra su CPS actual y el CPS promedio del amplificador. También puede ver un gráfico que muestra las fluctuaciones de su CPS a lo largo del tiempo. Puede acceder a estas funciones pulsando en el botón "Rendimiento" en la pantalla principal de la aplicación. </p>
|
| 54 |
-
<h3>Cómo personalizar el booster y optimizar los resultados</h3>
|
| 55 |
-
<p>Si desea personalizar el refuerzo y optimizar los resultados, puede utilizar algunas de las funciones avanzadas que ofrece la aplicación. Puede acceder a estas funciones pulsando el botón "Avanzado" en la pantalla principal de la aplicación. Algunas de estas características son:</p>
|
| 56 |
-
<ul>
|
| 57 |
-
<li>Tamaño del botón: Esto le permite cambiar el tamaño del botón transparente que puede tocar para activar el amplificador. Puedes elegir entre pequeñas, medianas o grandes. </li>
|
| 58 |
-
<li>Posición del botón: Esto le permite cambiar la posición del botón transparente que puede tocar para activar el amplificador. Puede arrastrar y soltar el botón en cualquier lugar de la pantalla. </li>
|
| 59 |
-
|
| 60 |
-
<li>Auto Clicker: Esto le permite habilitar o deshabilitar un auto clicker que hará clic para usted automáticamente sin tocar el botón. Puede establecer un temporizador para el tiempo que desea que el clicker automático se ejecute. </li>
|
| 61 |
-
<li>Randomizer: Esto le permite habilitar o deshabilitar un randomizer que variará su CPS aleatoriamente dentro de un rango que puede establecer. Esto puede hacer que su clic sea más natural y menos detectable. </li>
|
| 62 |
-
</ul>
|
| 63 |
-
<p>Puede personalizar estas características deslizando las barras, tocando los botones o introduciendo los valores. También puede restablecer estas características por defecto pulsando el botón "Restablecer". </p>
|
| 64 |
-
<h2>Pros y contras de usar CPS Booster APK Blockman Go</h2>
|
| 65 |
-
<p>CPS Booster APK Blockman Go es una aplicación que tiene sus pros y sus contras. Aquí están algunos de ellos. </p>
|
| 66 |
-
<h3>Las ventajas de usar la aplicación, como un clic más rápido, mejor precisión y más diversión</h3>
|
| 67 |
-
<p>Algunas de las ventajas de usar CPS Booster APK Blockman Go son:</p>
|
| 68 |
-
<ul>
|
| 69 |
-
<li>Clic más rápido: La aplicación puede ayudarle a aumentar su CPS en Blockman Go mediante el uso de un algoritmo especial que simula un clic rápido y preciso. Esto puede darte una ventaja sobre tus oponentes y mejorar tu rendimiento y resultado en ciertos juegos. </li>
|
| 70 |
-
<li>Mejor precisión: La aplicación puede ayudarle a mejorar su precisión en Blockman Go mediante el uso de un botón transparente que puede tocar para activar el amplificador. Esto puede reducir la fatiga de tu mano y prevenir clics accidentales que pueden arruinar tu juego. </li>
|
| 71 |
-
<li>Más divertido: La aplicación puede ayudarle a divertirse más en Blockman Go al permitirle personalizar y optimizar su experiencia de clic. Puedes elegir entre diferentes modos de juego, configuraciones y características que se adapten a tus preferencias y necesidades. </li>
|
| 72 |
-
</ul>
|
| 73 |
-
<h3>Las desventajas de usar la aplicación, como los riesgos potenciales, problemas de compatibilidad y preocupaciones éticas</h3>
|
| 74 |
-
<p>Algunas de las desventajas de usar CPS Booster APK Blockman Go son:</p>
|
| 75 |
-
<ul>
|
| 76 |
-
|
| 77 |
-
<li>Problemas de compatibilidad: La aplicación puede no funcionar bien con algunos dispositivos o versiones de Blockman Go. Puede causar fallos, fallas o errores que pueden afectar el juego o el rendimiento del dispositivo. Siempre debes comprobar si tu dispositivo o juego es compatible con la aplicación antes de usarla. </li>
|
| 78 |
-
<li>Preocupaciones éticas: La aplicación puede darte una ventaja injusta sobre otros jugadores que no la usan. También puede violar algunas reglas o términos de servicio de Blockman Go u otros juegos de estilo bloque. Siempre debes respetar a otros jugadores y jugar de forma justa y responsable. </li>
|
| 79 |
-
</ <h2>Conclusión</h2>
|
| 80 |
-
<p>CPS Booster APK Blockman Go es una aplicación que puede ayudar a aumentar su CPS en Blockman Go y otros juegos de estilo bloque. También puede ayudarle a mejorar su precisión y divertirse más al permitirle personalizar y optimizar su experiencia de clic. Sin embargo, la aplicación también tiene algunos inconvenientes, como riesgos potenciales, problemas de compatibilidad y preocupaciones éticas. Siempre debe tener cuidado al descargar e instalar la aplicación desde fuentes desconocidas, y usarla bajo su propio riesgo y responsabilidad. También debes respetar a otros jugadores y jugar de forma justa y responsable. </p>
|
| 81 |
-
<p>Si usted está buscando una manera de aumentar su CPS en Blockman Go y disfrutar del juego más, usted puede dar CPS Booster APK Blockman Go una oportunidad. Sin embargo, si usted está buscando una manera más segura, confiable y ética para mejorar su CPS, es posible que desee considerar otras alternativas, como practicar sus habilidades de clic, usar un ratón de juego o unirse a un programa de entrenamiento. </p>
|
| 82 |
-
<h2>Preguntas frecuentes</h2>
|
| 83 |
-
<p>Aquí están algunas de las preguntas y respuestas frecuentes sobre CPS Booster APK Blockman Go.</p>
|
| 84 |
-
<h3> ¿Es seguro usar CPS Booster APK Blockman? </h3>
|
| 85 |
-
|
| 86 |
-
<h3>Es CPS Booster APK Blockman Ir legal de usar? </h3>
|
| 87 |
-
<p>CPS Booster APK Blockman Go puede no ser legal de usar en algunos países o regiones, ya que puede violar algunas leyes o reglamentos que prohíben el uso de aplicaciones o software no autorizados o modificados. También puede violar algunas reglas o términos de servicio de Blockman Go u otros juegos de estilo bloque que prohíben el uso de trucos, hacks o exploits. Siempre debes comprobar la legalidad de la aplicación en tu ubicación antes de usarla. También debe respetar los derechos y la propiedad de los desarrolladores y editores de los juegos. </p>
|
| 88 |
-
<h3>Es CPS Booster APK Blockman Go detectable por el juego? </h3>
|
| 89 |
-
<p>CPS Booster APK Blockman Go puede ser detectable por el juego u otros jugadores, ya que puede causar comportamiento anormal o sospechoso o resultados en su juego. Por ejemplo, puede hacer que su velocidad de clic o precisión demasiado alta o demasiado baja, o puede hacer que su patrón de clic sea demasiado regular o demasiado aleatorio. Esto puede levantar algunas banderas o alertas que pueden llevar a que su cuenta sea prohibida o suspendida. Siempre debes tener cuidado al usar la aplicación y evitar usarla excesivamente o descaradamente. </p>
|
| 90 |
-
<h3>¿Funciona CPS Booster APK Blockman con otros juegos? </h3>
|
| 91 |
-
<p>CPS Booster APK Blockman Go está diseñado para trabajar con Blockman Go y otros juegos de estilo bloque que requieren un alto CPS. Sin embargo, es posible que no funcione bien con algunos juegos que tienen diferentes mecánicas o características que pueden interferir con la funcionalidad de la aplicación. Por ejemplo, es posible que no funcione con juegos que tienen sistemas anti-trucos, controles táctiles o sensores de movimiento. Siempre debes probar la aplicación con otros juegos antes de usarla. </p>
|
| 92 |
-
<h3>¿Cómo puedo desinstalar CPS Booster APK Blockman Go? </h3>
|
| 93 |
-
<p>Si desea desinstalar CPS Booster APK Blockman Ir desde su dispositivo, puede seguir estos pasos:</p>
|
| 94 |
-
<ol>
|
| 95 |
-
<li>Ir a la configuración del dispositivo y buscar la opción que dice "Aplicaciones" o "Aplicaciones". </li>
|
| 96 |
-
<li> Encontrar y toque en "CPS Booster APK" de la lista de aplicaciones. </li>
|
| 97 |
-
|
| 98 |
-
<li>Espere a que la aplicación se elimine de su dispositivo. </li>
|
| 99 |
-
</ol></p> 64aa2da5cf<br />
|
| 100 |
-
<br />
|
| 101 |
-
<br />
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/BetterAPI/BetterChat/src/lib/stores/pendingMessage.ts
DELETED
|
@@ -1,3 +0,0 @@
|
|
| 1 |
-
import { writable } from "svelte/store";
|
| 2 |
-
|
| 3 |
-
export const pendingMessage = writable<string>("");
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Big-Web/MMSD/env/Lib/site-packages/boto3/ec2/createtags.py
DELETED
|
@@ -1,40 +0,0 @@
|
|
| 1 |
-
# Copyright 2015 Amazon.com, Inc. or its affiliates. All Rights Reserved.
|
| 2 |
-
#
|
| 3 |
-
# Licensed under the Apache License, Version 2.0 (the "License"). You
|
| 4 |
-
# may not use this file except in compliance with the License. A copy of
|
| 5 |
-
# the License is located at
|
| 6 |
-
#
|
| 7 |
-
# https://aws.amazon.com/apache2.0/
|
| 8 |
-
#
|
| 9 |
-
# or in the "license" file accompanying this file. This file is
|
| 10 |
-
# distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF
|
| 11 |
-
# ANY KIND, either express or implied. See the License for the specific
|
| 12 |
-
# language governing permissions and limitations under the License.
|
| 13 |
-
|
| 14 |
-
|
| 15 |
-
def inject_create_tags(event_name, class_attributes, **kwargs):
|
| 16 |
-
"""This injects a custom create_tags method onto the ec2 service resource
|
| 17 |
-
|
| 18 |
-
This is needed because the resource model is not able to express
|
| 19 |
-
creating multiple tag resources based on the fact you can apply a set
|
| 20 |
-
of tags to multiple ec2 resources.
|
| 21 |
-
"""
|
| 22 |
-
class_attributes['create_tags'] = create_tags
|
| 23 |
-
|
| 24 |
-
|
| 25 |
-
def create_tags(self, **kwargs):
|
| 26 |
-
# Call the client method
|
| 27 |
-
self.meta.client.create_tags(**kwargs)
|
| 28 |
-
resources = kwargs.get('Resources', [])
|
| 29 |
-
tags = kwargs.get('Tags', [])
|
| 30 |
-
tag_resources = []
|
| 31 |
-
|
| 32 |
-
# Generate all of the tag resources that just were created with the
|
| 33 |
-
# preceding client call.
|
| 34 |
-
for resource in resources:
|
| 35 |
-
for tag in tags:
|
| 36 |
-
# Add each tag from the tag set for each resource to the list
|
| 37 |
-
# that is returned by the method.
|
| 38 |
-
tag_resource = self.Tag(resource, tag['Key'], tag['Value'])
|
| 39 |
-
tag_resources.append(tag_resource)
|
| 40 |
-
return tag_resources
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Big-Web/MMSD/env/Lib/site-packages/pip/_internal/commands/install.py
DELETED
|
@@ -1,775 +0,0 @@
|
|
| 1 |
-
import errno
|
| 2 |
-
import json
|
| 3 |
-
import operator
|
| 4 |
-
import os
|
| 5 |
-
import shutil
|
| 6 |
-
import site
|
| 7 |
-
from optparse import SUPPRESS_HELP, Values
|
| 8 |
-
from typing import List, Optional
|
| 9 |
-
|
| 10 |
-
from pip._vendor.rich import print_json
|
| 11 |
-
|
| 12 |
-
from pip._internal.cache import WheelCache
|
| 13 |
-
from pip._internal.cli import cmdoptions
|
| 14 |
-
from pip._internal.cli.cmdoptions import make_target_python
|
| 15 |
-
from pip._internal.cli.req_command import (
|
| 16 |
-
RequirementCommand,
|
| 17 |
-
warn_if_run_as_root,
|
| 18 |
-
with_cleanup,
|
| 19 |
-
)
|
| 20 |
-
from pip._internal.cli.status_codes import ERROR, SUCCESS
|
| 21 |
-
from pip._internal.exceptions import CommandError, InstallationError
|
| 22 |
-
from pip._internal.locations import get_scheme
|
| 23 |
-
from pip._internal.metadata import get_environment
|
| 24 |
-
from pip._internal.models.installation_report import InstallationReport
|
| 25 |
-
from pip._internal.operations.build.build_tracker import get_build_tracker
|
| 26 |
-
from pip._internal.operations.check import ConflictDetails, check_install_conflicts
|
| 27 |
-
from pip._internal.req import install_given_reqs
|
| 28 |
-
from pip._internal.req.req_install import (
|
| 29 |
-
InstallRequirement,
|
| 30 |
-
check_legacy_setup_py_options,
|
| 31 |
-
)
|
| 32 |
-
from pip._internal.utils.compat import WINDOWS
|
| 33 |
-
from pip._internal.utils.filesystem import test_writable_dir
|
| 34 |
-
from pip._internal.utils.logging import getLogger
|
| 35 |
-
from pip._internal.utils.misc import (
|
| 36 |
-
check_externally_managed,
|
| 37 |
-
ensure_dir,
|
| 38 |
-
get_pip_version,
|
| 39 |
-
protect_pip_from_modification_on_windows,
|
| 40 |
-
write_output,
|
| 41 |
-
)
|
| 42 |
-
from pip._internal.utils.temp_dir import TempDirectory
|
| 43 |
-
from pip._internal.utils.virtualenv import (
|
| 44 |
-
running_under_virtualenv,
|
| 45 |
-
virtualenv_no_global,
|
| 46 |
-
)
|
| 47 |
-
from pip._internal.wheel_builder import build, should_build_for_install_command
|
| 48 |
-
|
| 49 |
-
logger = getLogger(__name__)
|
| 50 |
-
|
| 51 |
-
|
| 52 |
-
class InstallCommand(RequirementCommand):
|
| 53 |
-
"""
|
| 54 |
-
Install packages from:
|
| 55 |
-
|
| 56 |
-
- PyPI (and other indexes) using requirement specifiers.
|
| 57 |
-
- VCS project urls.
|
| 58 |
-
- Local project directories.
|
| 59 |
-
- Local or remote source archives.
|
| 60 |
-
|
| 61 |
-
pip also supports installing from "requirements files", which provide
|
| 62 |
-
an easy way to specify a whole environment to be installed.
|
| 63 |
-
"""
|
| 64 |
-
|
| 65 |
-
usage = """
|
| 66 |
-
%prog [options] <requirement specifier> [package-index-options] ...
|
| 67 |
-
%prog [options] -r <requirements file> [package-index-options] ...
|
| 68 |
-
%prog [options] [-e] <vcs project url> ...
|
| 69 |
-
%prog [options] [-e] <local project path> ...
|
| 70 |
-
%prog [options] <archive url/path> ..."""
|
| 71 |
-
|
| 72 |
-
def add_options(self) -> None:
|
| 73 |
-
self.cmd_opts.add_option(cmdoptions.requirements())
|
| 74 |
-
self.cmd_opts.add_option(cmdoptions.constraints())
|
| 75 |
-
self.cmd_opts.add_option(cmdoptions.no_deps())
|
| 76 |
-
self.cmd_opts.add_option(cmdoptions.pre())
|
| 77 |
-
|
| 78 |
-
self.cmd_opts.add_option(cmdoptions.editable())
|
| 79 |
-
self.cmd_opts.add_option(
|
| 80 |
-
"--dry-run",
|
| 81 |
-
action="store_true",
|
| 82 |
-
dest="dry_run",
|
| 83 |
-
default=False,
|
| 84 |
-
help=(
|
| 85 |
-
"Don't actually install anything, just print what would be. "
|
| 86 |
-
"Can be used in combination with --ignore-installed "
|
| 87 |
-
"to 'resolve' the requirements."
|
| 88 |
-
),
|
| 89 |
-
)
|
| 90 |
-
self.cmd_opts.add_option(
|
| 91 |
-
"-t",
|
| 92 |
-
"--target",
|
| 93 |
-
dest="target_dir",
|
| 94 |
-
metavar="dir",
|
| 95 |
-
default=None,
|
| 96 |
-
help=(
|
| 97 |
-
"Install packages into <dir>. "
|
| 98 |
-
"By default this will not replace existing files/folders in "
|
| 99 |
-
"<dir>. Use --upgrade to replace existing packages in <dir> "
|
| 100 |
-
"with new versions."
|
| 101 |
-
),
|
| 102 |
-
)
|
| 103 |
-
cmdoptions.add_target_python_options(self.cmd_opts)
|
| 104 |
-
|
| 105 |
-
self.cmd_opts.add_option(
|
| 106 |
-
"--user",
|
| 107 |
-
dest="use_user_site",
|
| 108 |
-
action="store_true",
|
| 109 |
-
help=(
|
| 110 |
-
"Install to the Python user install directory for your "
|
| 111 |
-
"platform. Typically ~/.local/, or %APPDATA%\\Python on "
|
| 112 |
-
"Windows. (See the Python documentation for site.USER_BASE "
|
| 113 |
-
"for full details.)"
|
| 114 |
-
),
|
| 115 |
-
)
|
| 116 |
-
self.cmd_opts.add_option(
|
| 117 |
-
"--no-user",
|
| 118 |
-
dest="use_user_site",
|
| 119 |
-
action="store_false",
|
| 120 |
-
help=SUPPRESS_HELP,
|
| 121 |
-
)
|
| 122 |
-
self.cmd_opts.add_option(
|
| 123 |
-
"--root",
|
| 124 |
-
dest="root_path",
|
| 125 |
-
metavar="dir",
|
| 126 |
-
default=None,
|
| 127 |
-
help="Install everything relative to this alternate root directory.",
|
| 128 |
-
)
|
| 129 |
-
self.cmd_opts.add_option(
|
| 130 |
-
"--prefix",
|
| 131 |
-
dest="prefix_path",
|
| 132 |
-
metavar="dir",
|
| 133 |
-
default=None,
|
| 134 |
-
help=(
|
| 135 |
-
"Installation prefix where lib, bin and other top-level "
|
| 136 |
-
"folders are placed. Note that the resulting installation may "
|
| 137 |
-
"contain scripts and other resources which reference the "
|
| 138 |
-
"Python interpreter of pip, and not that of ``--prefix``. "
|
| 139 |
-
"See also the ``--python`` option if the intention is to "
|
| 140 |
-
"install packages into another (possibly pip-free) "
|
| 141 |
-
"environment."
|
| 142 |
-
),
|
| 143 |
-
)
|
| 144 |
-
|
| 145 |
-
self.cmd_opts.add_option(cmdoptions.src())
|
| 146 |
-
|
| 147 |
-
self.cmd_opts.add_option(
|
| 148 |
-
"-U",
|
| 149 |
-
"--upgrade",
|
| 150 |
-
dest="upgrade",
|
| 151 |
-
action="store_true",
|
| 152 |
-
help=(
|
| 153 |
-
"Upgrade all specified packages to the newest available "
|
| 154 |
-
"version. The handling of dependencies depends on the "
|
| 155 |
-
"upgrade-strategy used."
|
| 156 |
-
),
|
| 157 |
-
)
|
| 158 |
-
|
| 159 |
-
self.cmd_opts.add_option(
|
| 160 |
-
"--upgrade-strategy",
|
| 161 |
-
dest="upgrade_strategy",
|
| 162 |
-
default="only-if-needed",
|
| 163 |
-
choices=["only-if-needed", "eager"],
|
| 164 |
-
help=(
|
| 165 |
-
"Determines how dependency upgrading should be handled "
|
| 166 |
-
"[default: %default]. "
|
| 167 |
-
'"eager" - dependencies are upgraded regardless of '
|
| 168 |
-
"whether the currently installed version satisfies the "
|
| 169 |
-
"requirements of the upgraded package(s). "
|
| 170 |
-
'"only-if-needed" - are upgraded only when they do not '
|
| 171 |
-
"satisfy the requirements of the upgraded package(s)."
|
| 172 |
-
),
|
| 173 |
-
)
|
| 174 |
-
|
| 175 |
-
self.cmd_opts.add_option(
|
| 176 |
-
"--force-reinstall",
|
| 177 |
-
dest="force_reinstall",
|
| 178 |
-
action="store_true",
|
| 179 |
-
help="Reinstall all packages even if they are already up-to-date.",
|
| 180 |
-
)
|
| 181 |
-
|
| 182 |
-
self.cmd_opts.add_option(
|
| 183 |
-
"-I",
|
| 184 |
-
"--ignore-installed",
|
| 185 |
-
dest="ignore_installed",
|
| 186 |
-
action="store_true",
|
| 187 |
-
help=(
|
| 188 |
-
"Ignore the installed packages, overwriting them. "
|
| 189 |
-
"This can break your system if the existing package "
|
| 190 |
-
"is of a different version or was installed "
|
| 191 |
-
"with a different package manager!"
|
| 192 |
-
),
|
| 193 |
-
)
|
| 194 |
-
|
| 195 |
-
self.cmd_opts.add_option(cmdoptions.ignore_requires_python())
|
| 196 |
-
self.cmd_opts.add_option(cmdoptions.no_build_isolation())
|
| 197 |
-
self.cmd_opts.add_option(cmdoptions.use_pep517())
|
| 198 |
-
self.cmd_opts.add_option(cmdoptions.no_use_pep517())
|
| 199 |
-
self.cmd_opts.add_option(cmdoptions.check_build_deps())
|
| 200 |
-
self.cmd_opts.add_option(cmdoptions.override_externally_managed())
|
| 201 |
-
|
| 202 |
-
self.cmd_opts.add_option(cmdoptions.config_settings())
|
| 203 |
-
self.cmd_opts.add_option(cmdoptions.global_options())
|
| 204 |
-
|
| 205 |
-
self.cmd_opts.add_option(
|
| 206 |
-
"--compile",
|
| 207 |
-
action="store_true",
|
| 208 |
-
dest="compile",
|
| 209 |
-
default=True,
|
| 210 |
-
help="Compile Python source files to bytecode",
|
| 211 |
-
)
|
| 212 |
-
|
| 213 |
-
self.cmd_opts.add_option(
|
| 214 |
-
"--no-compile",
|
| 215 |
-
action="store_false",
|
| 216 |
-
dest="compile",
|
| 217 |
-
help="Do not compile Python source files to bytecode",
|
| 218 |
-
)
|
| 219 |
-
|
| 220 |
-
self.cmd_opts.add_option(
|
| 221 |
-
"--no-warn-script-location",
|
| 222 |
-
action="store_false",
|
| 223 |
-
dest="warn_script_location",
|
| 224 |
-
default=True,
|
| 225 |
-
help="Do not warn when installing scripts outside PATH",
|
| 226 |
-
)
|
| 227 |
-
self.cmd_opts.add_option(
|
| 228 |
-
"--no-warn-conflicts",
|
| 229 |
-
action="store_false",
|
| 230 |
-
dest="warn_about_conflicts",
|
| 231 |
-
default=True,
|
| 232 |
-
help="Do not warn about broken dependencies",
|
| 233 |
-
)
|
| 234 |
-
self.cmd_opts.add_option(cmdoptions.no_binary())
|
| 235 |
-
self.cmd_opts.add_option(cmdoptions.only_binary())
|
| 236 |
-
self.cmd_opts.add_option(cmdoptions.prefer_binary())
|
| 237 |
-
self.cmd_opts.add_option(cmdoptions.require_hashes())
|
| 238 |
-
self.cmd_opts.add_option(cmdoptions.progress_bar())
|
| 239 |
-
self.cmd_opts.add_option(cmdoptions.root_user_action())
|
| 240 |
-
|
| 241 |
-
index_opts = cmdoptions.make_option_group(
|
| 242 |
-
cmdoptions.index_group,
|
| 243 |
-
self.parser,
|
| 244 |
-
)
|
| 245 |
-
|
| 246 |
-
self.parser.insert_option_group(0, index_opts)
|
| 247 |
-
self.parser.insert_option_group(0, self.cmd_opts)
|
| 248 |
-
|
| 249 |
-
self.cmd_opts.add_option(
|
| 250 |
-
"--report",
|
| 251 |
-
dest="json_report_file",
|
| 252 |
-
metavar="file",
|
| 253 |
-
default=None,
|
| 254 |
-
help=(
|
| 255 |
-
"Generate a JSON file describing what pip did to install "
|
| 256 |
-
"the provided requirements. "
|
| 257 |
-
"Can be used in combination with --dry-run and --ignore-installed "
|
| 258 |
-
"to 'resolve' the requirements. "
|
| 259 |
-
"When - is used as file name it writes to stdout. "
|
| 260 |
-
"When writing to stdout, please combine with the --quiet option "
|
| 261 |
-
"to avoid mixing pip logging output with JSON output."
|
| 262 |
-
),
|
| 263 |
-
)
|
| 264 |
-
|
| 265 |
-
@with_cleanup
|
| 266 |
-
def run(self, options: Values, args: List[str]) -> int:
|
| 267 |
-
if options.use_user_site and options.target_dir is not None:
|
| 268 |
-
raise CommandError("Can not combine '--user' and '--target'")
|
| 269 |
-
|
| 270 |
-
# Check whether the environment we're installing into is externally
|
| 271 |
-
# managed, as specified in PEP 668. Specifying --root, --target, or
|
| 272 |
-
# --prefix disables the check, since there's no reliable way to locate
|
| 273 |
-
# the EXTERNALLY-MANAGED file for those cases. An exception is also
|
| 274 |
-
# made specifically for "--dry-run --report" for convenience.
|
| 275 |
-
installing_into_current_environment = (
|
| 276 |
-
not (options.dry_run and options.json_report_file)
|
| 277 |
-
and options.root_path is None
|
| 278 |
-
and options.target_dir is None
|
| 279 |
-
and options.prefix_path is None
|
| 280 |
-
)
|
| 281 |
-
if (
|
| 282 |
-
installing_into_current_environment
|
| 283 |
-
and not options.override_externally_managed
|
| 284 |
-
):
|
| 285 |
-
check_externally_managed()
|
| 286 |
-
|
| 287 |
-
upgrade_strategy = "to-satisfy-only"
|
| 288 |
-
if options.upgrade:
|
| 289 |
-
upgrade_strategy = options.upgrade_strategy
|
| 290 |
-
|
| 291 |
-
cmdoptions.check_dist_restriction(options, check_target=True)
|
| 292 |
-
|
| 293 |
-
logger.verbose("Using %s", get_pip_version())
|
| 294 |
-
options.use_user_site = decide_user_install(
|
| 295 |
-
options.use_user_site,
|
| 296 |
-
prefix_path=options.prefix_path,
|
| 297 |
-
target_dir=options.target_dir,
|
| 298 |
-
root_path=options.root_path,
|
| 299 |
-
isolated_mode=options.isolated_mode,
|
| 300 |
-
)
|
| 301 |
-
|
| 302 |
-
target_temp_dir: Optional[TempDirectory] = None
|
| 303 |
-
target_temp_dir_path: Optional[str] = None
|
| 304 |
-
if options.target_dir:
|
| 305 |
-
options.ignore_installed = True
|
| 306 |
-
options.target_dir = os.path.abspath(options.target_dir)
|
| 307 |
-
if (
|
| 308 |
-
# fmt: off
|
| 309 |
-
os.path.exists(options.target_dir) and
|
| 310 |
-
not os.path.isdir(options.target_dir)
|
| 311 |
-
# fmt: on
|
| 312 |
-
):
|
| 313 |
-
raise CommandError(
|
| 314 |
-
"Target path exists but is not a directory, will not continue."
|
| 315 |
-
)
|
| 316 |
-
|
| 317 |
-
# Create a target directory for using with the target option
|
| 318 |
-
target_temp_dir = TempDirectory(kind="target")
|
| 319 |
-
target_temp_dir_path = target_temp_dir.path
|
| 320 |
-
self.enter_context(target_temp_dir)
|
| 321 |
-
|
| 322 |
-
global_options = options.global_options or []
|
| 323 |
-
|
| 324 |
-
session = self.get_default_session(options)
|
| 325 |
-
|
| 326 |
-
target_python = make_target_python(options)
|
| 327 |
-
finder = self._build_package_finder(
|
| 328 |
-
options=options,
|
| 329 |
-
session=session,
|
| 330 |
-
target_python=target_python,
|
| 331 |
-
ignore_requires_python=options.ignore_requires_python,
|
| 332 |
-
)
|
| 333 |
-
build_tracker = self.enter_context(get_build_tracker())
|
| 334 |
-
|
| 335 |
-
directory = TempDirectory(
|
| 336 |
-
delete=not options.no_clean,
|
| 337 |
-
kind="install",
|
| 338 |
-
globally_managed=True,
|
| 339 |
-
)
|
| 340 |
-
|
| 341 |
-
try:
|
| 342 |
-
reqs = self.get_requirements(args, options, finder, session)
|
| 343 |
-
check_legacy_setup_py_options(options, reqs)
|
| 344 |
-
|
| 345 |
-
wheel_cache = WheelCache(options.cache_dir)
|
| 346 |
-
|
| 347 |
-
# Only when installing is it permitted to use PEP 660.
|
| 348 |
-
# In other circumstances (pip wheel, pip download) we generate
|
| 349 |
-
# regular (i.e. non editable) metadata and wheels.
|
| 350 |
-
for req in reqs:
|
| 351 |
-
req.permit_editable_wheels = True
|
| 352 |
-
|
| 353 |
-
preparer = self.make_requirement_preparer(
|
| 354 |
-
temp_build_dir=directory,
|
| 355 |
-
options=options,
|
| 356 |
-
build_tracker=build_tracker,
|
| 357 |
-
session=session,
|
| 358 |
-
finder=finder,
|
| 359 |
-
use_user_site=options.use_user_site,
|
| 360 |
-
verbosity=self.verbosity,
|
| 361 |
-
)
|
| 362 |
-
resolver = self.make_resolver(
|
| 363 |
-
preparer=preparer,
|
| 364 |
-
finder=finder,
|
| 365 |
-
options=options,
|
| 366 |
-
wheel_cache=wheel_cache,
|
| 367 |
-
use_user_site=options.use_user_site,
|
| 368 |
-
ignore_installed=options.ignore_installed,
|
| 369 |
-
ignore_requires_python=options.ignore_requires_python,
|
| 370 |
-
force_reinstall=options.force_reinstall,
|
| 371 |
-
upgrade_strategy=upgrade_strategy,
|
| 372 |
-
use_pep517=options.use_pep517,
|
| 373 |
-
)
|
| 374 |
-
|
| 375 |
-
self.trace_basic_info(finder)
|
| 376 |
-
|
| 377 |
-
requirement_set = resolver.resolve(
|
| 378 |
-
reqs, check_supported_wheels=not options.target_dir
|
| 379 |
-
)
|
| 380 |
-
|
| 381 |
-
if options.json_report_file:
|
| 382 |
-
report = InstallationReport(requirement_set.requirements_to_install)
|
| 383 |
-
if options.json_report_file == "-":
|
| 384 |
-
print_json(data=report.to_dict())
|
| 385 |
-
else:
|
| 386 |
-
with open(options.json_report_file, "w", encoding="utf-8") as f:
|
| 387 |
-
json.dump(report.to_dict(), f, indent=2, ensure_ascii=False)
|
| 388 |
-
|
| 389 |
-
if options.dry_run:
|
| 390 |
-
would_install_items = sorted(
|
| 391 |
-
(r.metadata["name"], r.metadata["version"])
|
| 392 |
-
for r in requirement_set.requirements_to_install
|
| 393 |
-
)
|
| 394 |
-
if would_install_items:
|
| 395 |
-
write_output(
|
| 396 |
-
"Would install %s",
|
| 397 |
-
" ".join("-".join(item) for item in would_install_items),
|
| 398 |
-
)
|
| 399 |
-
return SUCCESS
|
| 400 |
-
|
| 401 |
-
try:
|
| 402 |
-
pip_req = requirement_set.get_requirement("pip")
|
| 403 |
-
except KeyError:
|
| 404 |
-
modifying_pip = False
|
| 405 |
-
else:
|
| 406 |
-
# If we're not replacing an already installed pip,
|
| 407 |
-
# we're not modifying it.
|
| 408 |
-
modifying_pip = pip_req.satisfied_by is None
|
| 409 |
-
protect_pip_from_modification_on_windows(modifying_pip=modifying_pip)
|
| 410 |
-
|
| 411 |
-
reqs_to_build = [
|
| 412 |
-
r
|
| 413 |
-
for r in requirement_set.requirements.values()
|
| 414 |
-
if should_build_for_install_command(r)
|
| 415 |
-
]
|
| 416 |
-
|
| 417 |
-
_, build_failures = build(
|
| 418 |
-
reqs_to_build,
|
| 419 |
-
wheel_cache=wheel_cache,
|
| 420 |
-
verify=True,
|
| 421 |
-
build_options=[],
|
| 422 |
-
global_options=global_options,
|
| 423 |
-
)
|
| 424 |
-
|
| 425 |
-
if build_failures:
|
| 426 |
-
raise InstallationError(
|
| 427 |
-
"Could not build wheels for {}, which is required to "
|
| 428 |
-
"install pyproject.toml-based projects".format(
|
| 429 |
-
", ".join(r.name for r in build_failures) # type: ignore
|
| 430 |
-
)
|
| 431 |
-
)
|
| 432 |
-
|
| 433 |
-
to_install = resolver.get_installation_order(requirement_set)
|
| 434 |
-
|
| 435 |
-
# Check for conflicts in the package set we're installing.
|
| 436 |
-
conflicts: Optional[ConflictDetails] = None
|
| 437 |
-
should_warn_about_conflicts = (
|
| 438 |
-
not options.ignore_dependencies and options.warn_about_conflicts
|
| 439 |
-
)
|
| 440 |
-
if should_warn_about_conflicts:
|
| 441 |
-
conflicts = self._determine_conflicts(to_install)
|
| 442 |
-
|
| 443 |
-
# Don't warn about script install locations if
|
| 444 |
-
# --target or --prefix has been specified
|
| 445 |
-
warn_script_location = options.warn_script_location
|
| 446 |
-
if options.target_dir or options.prefix_path:
|
| 447 |
-
warn_script_location = False
|
| 448 |
-
|
| 449 |
-
installed = install_given_reqs(
|
| 450 |
-
to_install,
|
| 451 |
-
global_options,
|
| 452 |
-
root=options.root_path,
|
| 453 |
-
home=target_temp_dir_path,
|
| 454 |
-
prefix=options.prefix_path,
|
| 455 |
-
warn_script_location=warn_script_location,
|
| 456 |
-
use_user_site=options.use_user_site,
|
| 457 |
-
pycompile=options.compile,
|
| 458 |
-
)
|
| 459 |
-
|
| 460 |
-
lib_locations = get_lib_location_guesses(
|
| 461 |
-
user=options.use_user_site,
|
| 462 |
-
home=target_temp_dir_path,
|
| 463 |
-
root=options.root_path,
|
| 464 |
-
prefix=options.prefix_path,
|
| 465 |
-
isolated=options.isolated_mode,
|
| 466 |
-
)
|
| 467 |
-
env = get_environment(lib_locations)
|
| 468 |
-
|
| 469 |
-
installed.sort(key=operator.attrgetter("name"))
|
| 470 |
-
items = []
|
| 471 |
-
for result in installed:
|
| 472 |
-
item = result.name
|
| 473 |
-
try:
|
| 474 |
-
installed_dist = env.get_distribution(item)
|
| 475 |
-
if installed_dist is not None:
|
| 476 |
-
item = f"{item}-{installed_dist.version}"
|
| 477 |
-
except Exception:
|
| 478 |
-
pass
|
| 479 |
-
items.append(item)
|
| 480 |
-
|
| 481 |
-
if conflicts is not None:
|
| 482 |
-
self._warn_about_conflicts(
|
| 483 |
-
conflicts,
|
| 484 |
-
resolver_variant=self.determine_resolver_variant(options),
|
| 485 |
-
)
|
| 486 |
-
|
| 487 |
-
installed_desc = " ".join(items)
|
| 488 |
-
if installed_desc:
|
| 489 |
-
write_output(
|
| 490 |
-
"Successfully installed %s",
|
| 491 |
-
installed_desc,
|
| 492 |
-
)
|
| 493 |
-
except OSError as error:
|
| 494 |
-
show_traceback = self.verbosity >= 1
|
| 495 |
-
|
| 496 |
-
message = create_os_error_message(
|
| 497 |
-
error,
|
| 498 |
-
show_traceback,
|
| 499 |
-
options.use_user_site,
|
| 500 |
-
)
|
| 501 |
-
logger.error(message, exc_info=show_traceback) # noqa
|
| 502 |
-
|
| 503 |
-
return ERROR
|
| 504 |
-
|
| 505 |
-
if options.target_dir:
|
| 506 |
-
assert target_temp_dir
|
| 507 |
-
self._handle_target_dir(
|
| 508 |
-
options.target_dir, target_temp_dir, options.upgrade
|
| 509 |
-
)
|
| 510 |
-
if options.root_user_action == "warn":
|
| 511 |
-
warn_if_run_as_root()
|
| 512 |
-
return SUCCESS
|
| 513 |
-
|
| 514 |
-
def _handle_target_dir(
|
| 515 |
-
self, target_dir: str, target_temp_dir: TempDirectory, upgrade: bool
|
| 516 |
-
) -> None:
|
| 517 |
-
ensure_dir(target_dir)
|
| 518 |
-
|
| 519 |
-
# Checking both purelib and platlib directories for installed
|
| 520 |
-
# packages to be moved to target directory
|
| 521 |
-
lib_dir_list = []
|
| 522 |
-
|
| 523 |
-
# Checking both purelib and platlib directories for installed
|
| 524 |
-
# packages to be moved to target directory
|
| 525 |
-
scheme = get_scheme("", home=target_temp_dir.path)
|
| 526 |
-
purelib_dir = scheme.purelib
|
| 527 |
-
platlib_dir = scheme.platlib
|
| 528 |
-
data_dir = scheme.data
|
| 529 |
-
|
| 530 |
-
if os.path.exists(purelib_dir):
|
| 531 |
-
lib_dir_list.append(purelib_dir)
|
| 532 |
-
if os.path.exists(platlib_dir) and platlib_dir != purelib_dir:
|
| 533 |
-
lib_dir_list.append(platlib_dir)
|
| 534 |
-
if os.path.exists(data_dir):
|
| 535 |
-
lib_dir_list.append(data_dir)
|
| 536 |
-
|
| 537 |
-
for lib_dir in lib_dir_list:
|
| 538 |
-
for item in os.listdir(lib_dir):
|
| 539 |
-
if lib_dir == data_dir:
|
| 540 |
-
ddir = os.path.join(data_dir, item)
|
| 541 |
-
if any(s.startswith(ddir) for s in lib_dir_list[:-1]):
|
| 542 |
-
continue
|
| 543 |
-
target_item_dir = os.path.join(target_dir, item)
|
| 544 |
-
if os.path.exists(target_item_dir):
|
| 545 |
-
if not upgrade:
|
| 546 |
-
logger.warning(
|
| 547 |
-
"Target directory %s already exists. Specify "
|
| 548 |
-
"--upgrade to force replacement.",
|
| 549 |
-
target_item_dir,
|
| 550 |
-
)
|
| 551 |
-
continue
|
| 552 |
-
if os.path.islink(target_item_dir):
|
| 553 |
-
logger.warning(
|
| 554 |
-
"Target directory %s already exists and is "
|
| 555 |
-
"a link. pip will not automatically replace "
|
| 556 |
-
"links, please remove if replacement is "
|
| 557 |
-
"desired.",
|
| 558 |
-
target_item_dir,
|
| 559 |
-
)
|
| 560 |
-
continue
|
| 561 |
-
if os.path.isdir(target_item_dir):
|
| 562 |
-
shutil.rmtree(target_item_dir)
|
| 563 |
-
else:
|
| 564 |
-
os.remove(target_item_dir)
|
| 565 |
-
|
| 566 |
-
shutil.move(os.path.join(lib_dir, item), target_item_dir)
|
| 567 |
-
|
| 568 |
-
def _determine_conflicts(
|
| 569 |
-
self, to_install: List[InstallRequirement]
|
| 570 |
-
) -> Optional[ConflictDetails]:
|
| 571 |
-
try:
|
| 572 |
-
return check_install_conflicts(to_install)
|
| 573 |
-
except Exception:
|
| 574 |
-
logger.exception(
|
| 575 |
-
"Error while checking for conflicts. Please file an issue on "
|
| 576 |
-
"pip's issue tracker: https://github.com/pypa/pip/issues/new"
|
| 577 |
-
)
|
| 578 |
-
return None
|
| 579 |
-
|
| 580 |
-
def _warn_about_conflicts(
|
| 581 |
-
self, conflict_details: ConflictDetails, resolver_variant: str
|
| 582 |
-
) -> None:
|
| 583 |
-
package_set, (missing, conflicting) = conflict_details
|
| 584 |
-
if not missing and not conflicting:
|
| 585 |
-
return
|
| 586 |
-
|
| 587 |
-
parts: List[str] = []
|
| 588 |
-
if resolver_variant == "legacy":
|
| 589 |
-
parts.append(
|
| 590 |
-
"pip's legacy dependency resolver does not consider dependency "
|
| 591 |
-
"conflicts when selecting packages. This behaviour is the "
|
| 592 |
-
"source of the following dependency conflicts."
|
| 593 |
-
)
|
| 594 |
-
else:
|
| 595 |
-
assert resolver_variant == "2020-resolver"
|
| 596 |
-
parts.append(
|
| 597 |
-
"pip's dependency resolver does not currently take into account "
|
| 598 |
-
"all the packages that are installed. This behaviour is the "
|
| 599 |
-
"source of the following dependency conflicts."
|
| 600 |
-
)
|
| 601 |
-
|
| 602 |
-
# NOTE: There is some duplication here, with commands/check.py
|
| 603 |
-
for project_name in missing:
|
| 604 |
-
version = package_set[project_name][0]
|
| 605 |
-
for dependency in missing[project_name]:
|
| 606 |
-
message = (
|
| 607 |
-
"{name} {version} requires {requirement}, "
|
| 608 |
-
"which is not installed."
|
| 609 |
-
).format(
|
| 610 |
-
name=project_name,
|
| 611 |
-
version=version,
|
| 612 |
-
requirement=dependency[1],
|
| 613 |
-
)
|
| 614 |
-
parts.append(message)
|
| 615 |
-
|
| 616 |
-
for project_name in conflicting:
|
| 617 |
-
version = package_set[project_name][0]
|
| 618 |
-
for dep_name, dep_version, req in conflicting[project_name]:
|
| 619 |
-
message = (
|
| 620 |
-
"{name} {version} requires {requirement}, but {you} have "
|
| 621 |
-
"{dep_name} {dep_version} which is incompatible."
|
| 622 |
-
).format(
|
| 623 |
-
name=project_name,
|
| 624 |
-
version=version,
|
| 625 |
-
requirement=req,
|
| 626 |
-
dep_name=dep_name,
|
| 627 |
-
dep_version=dep_version,
|
| 628 |
-
you=("you" if resolver_variant == "2020-resolver" else "you'll"),
|
| 629 |
-
)
|
| 630 |
-
parts.append(message)
|
| 631 |
-
|
| 632 |
-
logger.critical("\n".join(parts))
|
| 633 |
-
|
| 634 |
-
|
| 635 |
-
def get_lib_location_guesses(
|
| 636 |
-
user: bool = False,
|
| 637 |
-
home: Optional[str] = None,
|
| 638 |
-
root: Optional[str] = None,
|
| 639 |
-
isolated: bool = False,
|
| 640 |
-
prefix: Optional[str] = None,
|
| 641 |
-
) -> List[str]:
|
| 642 |
-
scheme = get_scheme(
|
| 643 |
-
"",
|
| 644 |
-
user=user,
|
| 645 |
-
home=home,
|
| 646 |
-
root=root,
|
| 647 |
-
isolated=isolated,
|
| 648 |
-
prefix=prefix,
|
| 649 |
-
)
|
| 650 |
-
return [scheme.purelib, scheme.platlib]
|
| 651 |
-
|
| 652 |
-
|
| 653 |
-
def site_packages_writable(root: Optional[str], isolated: bool) -> bool:
|
| 654 |
-
return all(
|
| 655 |
-
test_writable_dir(d)
|
| 656 |
-
for d in set(get_lib_location_guesses(root=root, isolated=isolated))
|
| 657 |
-
)
|
| 658 |
-
|
| 659 |
-
|
| 660 |
-
def decide_user_install(
|
| 661 |
-
use_user_site: Optional[bool],
|
| 662 |
-
prefix_path: Optional[str] = None,
|
| 663 |
-
target_dir: Optional[str] = None,
|
| 664 |
-
root_path: Optional[str] = None,
|
| 665 |
-
isolated_mode: bool = False,
|
| 666 |
-
) -> bool:
|
| 667 |
-
"""Determine whether to do a user install based on the input options.
|
| 668 |
-
|
| 669 |
-
If use_user_site is False, no additional checks are done.
|
| 670 |
-
If use_user_site is True, it is checked for compatibility with other
|
| 671 |
-
options.
|
| 672 |
-
If use_user_site is None, the default behaviour depends on the environment,
|
| 673 |
-
which is provided by the other arguments.
|
| 674 |
-
"""
|
| 675 |
-
# In some cases (config from tox), use_user_site can be set to an integer
|
| 676 |
-
# rather than a bool, which 'use_user_site is False' wouldn't catch.
|
| 677 |
-
if (use_user_site is not None) and (not use_user_site):
|
| 678 |
-
logger.debug("Non-user install by explicit request")
|
| 679 |
-
return False
|
| 680 |
-
|
| 681 |
-
if use_user_site:
|
| 682 |
-
if prefix_path:
|
| 683 |
-
raise CommandError(
|
| 684 |
-
"Can not combine '--user' and '--prefix' as they imply "
|
| 685 |
-
"different installation locations"
|
| 686 |
-
)
|
| 687 |
-
if virtualenv_no_global():
|
| 688 |
-
raise InstallationError(
|
| 689 |
-
"Can not perform a '--user' install. User site-packages "
|
| 690 |
-
"are not visible in this virtualenv."
|
| 691 |
-
)
|
| 692 |
-
logger.debug("User install by explicit request")
|
| 693 |
-
return True
|
| 694 |
-
|
| 695 |
-
# If we are here, user installs have not been explicitly requested/avoided
|
| 696 |
-
assert use_user_site is None
|
| 697 |
-
|
| 698 |
-
# user install incompatible with --prefix/--target
|
| 699 |
-
if prefix_path or target_dir:
|
| 700 |
-
logger.debug("Non-user install due to --prefix or --target option")
|
| 701 |
-
return False
|
| 702 |
-
|
| 703 |
-
# If user installs are not enabled, choose a non-user install
|
| 704 |
-
if not site.ENABLE_USER_SITE:
|
| 705 |
-
logger.debug("Non-user install because user site-packages disabled")
|
| 706 |
-
return False
|
| 707 |
-
|
| 708 |
-
# If we have permission for a non-user install, do that,
|
| 709 |
-
# otherwise do a user install.
|
| 710 |
-
if site_packages_writable(root=root_path, isolated=isolated_mode):
|
| 711 |
-
logger.debug("Non-user install because site-packages writeable")
|
| 712 |
-
return False
|
| 713 |
-
|
| 714 |
-
logger.info(
|
| 715 |
-
"Defaulting to user installation because normal site-packages "
|
| 716 |
-
"is not writeable"
|
| 717 |
-
)
|
| 718 |
-
return True
|
| 719 |
-
|
| 720 |
-
|
| 721 |
-
def create_os_error_message(
|
| 722 |
-
error: OSError, show_traceback: bool, using_user_site: bool
|
| 723 |
-
) -> str:
|
| 724 |
-
"""Format an error message for an OSError
|
| 725 |
-
|
| 726 |
-
It may occur anytime during the execution of the install command.
|
| 727 |
-
"""
|
| 728 |
-
parts = []
|
| 729 |
-
|
| 730 |
-
# Mention the error if we are not going to show a traceback
|
| 731 |
-
parts.append("Could not install packages due to an OSError")
|
| 732 |
-
if not show_traceback:
|
| 733 |
-
parts.append(": ")
|
| 734 |
-
parts.append(str(error))
|
| 735 |
-
else:
|
| 736 |
-
parts.append(".")
|
| 737 |
-
|
| 738 |
-
# Spilt the error indication from a helper message (if any)
|
| 739 |
-
parts[-1] += "\n"
|
| 740 |
-
|
| 741 |
-
# Suggest useful actions to the user:
|
| 742 |
-
# (1) using user site-packages or (2) verifying the permissions
|
| 743 |
-
if error.errno == errno.EACCES:
|
| 744 |
-
user_option_part = "Consider using the `--user` option"
|
| 745 |
-
permissions_part = "Check the permissions"
|
| 746 |
-
|
| 747 |
-
if not running_under_virtualenv() and not using_user_site:
|
| 748 |
-
parts.extend(
|
| 749 |
-
[
|
| 750 |
-
user_option_part,
|
| 751 |
-
" or ",
|
| 752 |
-
permissions_part.lower(),
|
| 753 |
-
]
|
| 754 |
-
)
|
| 755 |
-
else:
|
| 756 |
-
parts.append(permissions_part)
|
| 757 |
-
parts.append(".\n")
|
| 758 |
-
|
| 759 |
-
# Suggest the user to enable Long Paths if path length is
|
| 760 |
-
# more than 260
|
| 761 |
-
if (
|
| 762 |
-
WINDOWS
|
| 763 |
-
and error.errno == errno.ENOENT
|
| 764 |
-
and error.filename
|
| 765 |
-
and len(error.filename) > 260
|
| 766 |
-
):
|
| 767 |
-
parts.append(
|
| 768 |
-
"HINT: This error might have occurred since "
|
| 769 |
-
"this system does not have Windows Long Path "
|
| 770 |
-
"support enabled. You can find information on "
|
| 771 |
-
"how to enable this at "
|
| 772 |
-
"https://pip.pypa.io/warnings/enable-long-paths\n"
|
| 773 |
-
)
|
| 774 |
-
|
| 775 |
-
return "".join(parts).strip() + "\n"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Big-Web/MMSD/env/Lib/site-packages/pip/_vendor/platformdirs/api.py
DELETED
|
@@ -1,179 +0,0 @@
|
|
| 1 |
-
from __future__ import annotations
|
| 2 |
-
|
| 3 |
-
import os
|
| 4 |
-
import sys
|
| 5 |
-
from abc import ABC, abstractmethod
|
| 6 |
-
from pathlib import Path
|
| 7 |
-
|
| 8 |
-
if sys.version_info >= (3, 8): # pragma: no branch
|
| 9 |
-
from typing import Literal # pragma: no cover
|
| 10 |
-
|
| 11 |
-
|
| 12 |
-
class PlatformDirsABC(ABC):
|
| 13 |
-
"""
|
| 14 |
-
Abstract base class for platform directories.
|
| 15 |
-
"""
|
| 16 |
-
|
| 17 |
-
def __init__(
|
| 18 |
-
self,
|
| 19 |
-
appname: str | None = None,
|
| 20 |
-
appauthor: str | None | Literal[False] = None,
|
| 21 |
-
version: str | None = None,
|
| 22 |
-
roaming: bool = False,
|
| 23 |
-
multipath: bool = False,
|
| 24 |
-
opinion: bool = True,
|
| 25 |
-
ensure_exists: bool = False,
|
| 26 |
-
):
|
| 27 |
-
"""
|
| 28 |
-
Create a new platform directory.
|
| 29 |
-
|
| 30 |
-
:param appname: See `appname`.
|
| 31 |
-
:param appauthor: See `appauthor`.
|
| 32 |
-
:param version: See `version`.
|
| 33 |
-
:param roaming: See `roaming`.
|
| 34 |
-
:param multipath: See `multipath`.
|
| 35 |
-
:param opinion: See `opinion`.
|
| 36 |
-
:param ensure_exists: See `ensure_exists`.
|
| 37 |
-
"""
|
| 38 |
-
self.appname = appname #: The name of application.
|
| 39 |
-
self.appauthor = appauthor
|
| 40 |
-
"""
|
| 41 |
-
The name of the app author or distributing body for this application. Typically, it is the owning company name.
|
| 42 |
-
Defaults to `appname`. You may pass ``False`` to disable it.
|
| 43 |
-
"""
|
| 44 |
-
self.version = version
|
| 45 |
-
"""
|
| 46 |
-
An optional version path element to append to the path. You might want to use this if you want multiple versions
|
| 47 |
-
of your app to be able to run independently. If used, this would typically be ``<major>.<minor>``.
|
| 48 |
-
"""
|
| 49 |
-
self.roaming = roaming
|
| 50 |
-
"""
|
| 51 |
-
Whether to use the roaming appdata directory on Windows. That means that for users on a Windows network setup
|
| 52 |
-
for roaming profiles, this user data will be synced on login (see
|
| 53 |
-
`here <http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>`_).
|
| 54 |
-
"""
|
| 55 |
-
self.multipath = multipath
|
| 56 |
-
"""
|
| 57 |
-
An optional parameter only applicable to Unix/Linux which indicates that the entire list of data dirs should be
|
| 58 |
-
returned. By default, the first item would only be returned.
|
| 59 |
-
"""
|
| 60 |
-
self.opinion = opinion #: A flag to indicating to use opinionated values.
|
| 61 |
-
self.ensure_exists = ensure_exists
|
| 62 |
-
"""
|
| 63 |
-
Optionally create the directory (and any missing parents) upon access if it does not exist.
|
| 64 |
-
By default, no directories are created.
|
| 65 |
-
"""
|
| 66 |
-
|
| 67 |
-
def _append_app_name_and_version(self, *base: str) -> str:
|
| 68 |
-
params = list(base[1:])
|
| 69 |
-
if self.appname:
|
| 70 |
-
params.append(self.appname)
|
| 71 |
-
if self.version:
|
| 72 |
-
params.append(self.version)
|
| 73 |
-
path = os.path.join(base[0], *params)
|
| 74 |
-
self._optionally_create_directory(path)
|
| 75 |
-
return path
|
| 76 |
-
|
| 77 |
-
def _optionally_create_directory(self, path: str) -> None:
|
| 78 |
-
if self.ensure_exists:
|
| 79 |
-
Path(path).mkdir(parents=True, exist_ok=True)
|
| 80 |
-
|
| 81 |
-
@property
|
| 82 |
-
@abstractmethod
|
| 83 |
-
def user_data_dir(self) -> str:
|
| 84 |
-
""":return: data directory tied to the user"""
|
| 85 |
-
|
| 86 |
-
@property
|
| 87 |
-
@abstractmethod
|
| 88 |
-
def site_data_dir(self) -> str:
|
| 89 |
-
""":return: data directory shared by users"""
|
| 90 |
-
|
| 91 |
-
@property
|
| 92 |
-
@abstractmethod
|
| 93 |
-
def user_config_dir(self) -> str:
|
| 94 |
-
""":return: config directory tied to the user"""
|
| 95 |
-
|
| 96 |
-
@property
|
| 97 |
-
@abstractmethod
|
| 98 |
-
def site_config_dir(self) -> str:
|
| 99 |
-
""":return: config directory shared by the users"""
|
| 100 |
-
|
| 101 |
-
@property
|
| 102 |
-
@abstractmethod
|
| 103 |
-
def user_cache_dir(self) -> str:
|
| 104 |
-
""":return: cache directory tied to the user"""
|
| 105 |
-
|
| 106 |
-
@property
|
| 107 |
-
@abstractmethod
|
| 108 |
-
def site_cache_dir(self) -> str:
|
| 109 |
-
""":return: cache directory shared by users"""
|
| 110 |
-
|
| 111 |
-
@property
|
| 112 |
-
@abstractmethod
|
| 113 |
-
def user_state_dir(self) -> str:
|
| 114 |
-
""":return: state directory tied to the user"""
|
| 115 |
-
|
| 116 |
-
@property
|
| 117 |
-
@abstractmethod
|
| 118 |
-
def user_log_dir(self) -> str:
|
| 119 |
-
""":return: log directory tied to the user"""
|
| 120 |
-
|
| 121 |
-
@property
|
| 122 |
-
@abstractmethod
|
| 123 |
-
def user_documents_dir(self) -> str:
|
| 124 |
-
""":return: documents directory tied to the user"""
|
| 125 |
-
|
| 126 |
-
@property
|
| 127 |
-
@abstractmethod
|
| 128 |
-
def user_runtime_dir(self) -> str:
|
| 129 |
-
""":return: runtime directory tied to the user"""
|
| 130 |
-
|
| 131 |
-
@property
|
| 132 |
-
def user_data_path(self) -> Path:
|
| 133 |
-
""":return: data path tied to the user"""
|
| 134 |
-
return Path(self.user_data_dir)
|
| 135 |
-
|
| 136 |
-
@property
|
| 137 |
-
def site_data_path(self) -> Path:
|
| 138 |
-
""":return: data path shared by users"""
|
| 139 |
-
return Path(self.site_data_dir)
|
| 140 |
-
|
| 141 |
-
@property
|
| 142 |
-
def user_config_path(self) -> Path:
|
| 143 |
-
""":return: config path tied to the user"""
|
| 144 |
-
return Path(self.user_config_dir)
|
| 145 |
-
|
| 146 |
-
@property
|
| 147 |
-
def site_config_path(self) -> Path:
|
| 148 |
-
""":return: config path shared by the users"""
|
| 149 |
-
return Path(self.site_config_dir)
|
| 150 |
-
|
| 151 |
-
@property
|
| 152 |
-
def user_cache_path(self) -> Path:
|
| 153 |
-
""":return: cache path tied to the user"""
|
| 154 |
-
return Path(self.user_cache_dir)
|
| 155 |
-
|
| 156 |
-
@property
|
| 157 |
-
def site_cache_path(self) -> Path:
|
| 158 |
-
""":return: cache path shared by users"""
|
| 159 |
-
return Path(self.site_cache_dir)
|
| 160 |
-
|
| 161 |
-
@property
|
| 162 |
-
def user_state_path(self) -> Path:
|
| 163 |
-
""":return: state path tied to the user"""
|
| 164 |
-
return Path(self.user_state_dir)
|
| 165 |
-
|
| 166 |
-
@property
|
| 167 |
-
def user_log_path(self) -> Path:
|
| 168 |
-
""":return: log path tied to the user"""
|
| 169 |
-
return Path(self.user_log_dir)
|
| 170 |
-
|
| 171 |
-
@property
|
| 172 |
-
def user_documents_path(self) -> Path:
|
| 173 |
-
""":return: documents path tied to the user"""
|
| 174 |
-
return Path(self.user_documents_dir)
|
| 175 |
-
|
| 176 |
-
@property
|
| 177 |
-
def user_runtime_path(self) -> Path:
|
| 178 |
-
""":return: runtime path tied to the user"""
|
| 179 |
-
return Path(self.user_runtime_dir)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/CCaniggia/GPT/README.md
DELETED
|
@@ -1,12 +0,0 @@
|
|
| 1 |
-
---
|
| 2 |
-
title: GPT
|
| 3 |
-
emoji: 🌍
|
| 4 |
-
colorFrom: yellow
|
| 5 |
-
colorTo: pink
|
| 6 |
-
sdk: docker
|
| 7 |
-
pinned: false
|
| 8 |
-
license: mit
|
| 9 |
-
app_port: 8080
|
| 10 |
-
---
|
| 11 |
-
|
| 12 |
-
Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/CVPR/Dual-Key_Backdoor_Attacks/bottom-up-attention-vqa/attention.py
DELETED
|
@@ -1,56 +0,0 @@
|
|
| 1 |
-
import torch
|
| 2 |
-
import torch.nn as nn
|
| 3 |
-
from torch.nn.utils.weight_norm import weight_norm
|
| 4 |
-
from fc import FCNet
|
| 5 |
-
|
| 6 |
-
|
| 7 |
-
class Attention(nn.Module):
|
| 8 |
-
def __init__(self, v_dim, q_dim, num_hid):
|
| 9 |
-
super(Attention, self).__init__()
|
| 10 |
-
self.nonlinear = FCNet([v_dim + q_dim, num_hid])
|
| 11 |
-
self.linear = weight_norm(nn.Linear(num_hid, 1), dim=None)
|
| 12 |
-
|
| 13 |
-
def forward(self, v, q):
|
| 14 |
-
"""
|
| 15 |
-
v: [batch, k, vdim]
|
| 16 |
-
q: [batch, qdim]
|
| 17 |
-
"""
|
| 18 |
-
logits = self.logits(v, q)
|
| 19 |
-
w = nn.functional.softmax(logits, 1)
|
| 20 |
-
return w
|
| 21 |
-
|
| 22 |
-
def logits(self, v, q):
|
| 23 |
-
num_objs = v.size(1)
|
| 24 |
-
q = q.unsqueeze(1).repeat(1, num_objs, 1)
|
| 25 |
-
vq = torch.cat((v, q), 2)
|
| 26 |
-
joint_repr = self.nonlinear(vq)
|
| 27 |
-
logits = self.linear(joint_repr)
|
| 28 |
-
return logits
|
| 29 |
-
|
| 30 |
-
|
| 31 |
-
class NewAttention(nn.Module):
|
| 32 |
-
def __init__(self, v_dim, q_dim, num_hid, dropout=0.2):
|
| 33 |
-
super(NewAttention, self).__init__()
|
| 34 |
-
|
| 35 |
-
self.v_proj = FCNet([v_dim, num_hid])
|
| 36 |
-
self.q_proj = FCNet([q_dim, num_hid])
|
| 37 |
-
self.dropout = nn.Dropout(dropout)
|
| 38 |
-
self.linear = weight_norm(nn.Linear(q_dim, 1), dim=None)
|
| 39 |
-
|
| 40 |
-
def forward(self, v, q):
|
| 41 |
-
"""
|
| 42 |
-
v: [batch, k, vdim]
|
| 43 |
-
q: [batch, qdim]
|
| 44 |
-
"""
|
| 45 |
-
logits = self.logits(v, q)
|
| 46 |
-
w = nn.functional.softmax(logits, 1)
|
| 47 |
-
return w
|
| 48 |
-
|
| 49 |
-
def logits(self, v, q):
|
| 50 |
-
batch, k, _ = v.size()
|
| 51 |
-
v_proj = self.v_proj(v) # [batch, k, qdim]
|
| 52 |
-
q_proj = self.q_proj(q).unsqueeze(1).repeat(1, k, 1)
|
| 53 |
-
joint_repr = v_proj * q_proj
|
| 54 |
-
joint_repr = self.dropout(joint_repr)
|
| 55 |
-
logits = self.linear(joint_repr)
|
| 56 |
-
return logits
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/CVPR/LIVE/thrust/thrust/iterator/detail/minimum_system.h
DELETED
|
@@ -1,82 +0,0 @@
|
|
| 1 |
-
/*
|
| 2 |
-
* Copyright 2008-2013 NVIDIA Corporation
|
| 3 |
-
*
|
| 4 |
-
* Licensed under the Apache License, Version 2.0 (the "License");
|
| 5 |
-
* you may not use this file except in compliance with the License.
|
| 6 |
-
* You may obtain a copy of the License at
|
| 7 |
-
*
|
| 8 |
-
* http://www.apache.org/licenses/LICENSE-2.0
|
| 9 |
-
*
|
| 10 |
-
* Unless required by applicable law or agreed to in writing, software
|
| 11 |
-
* distributed under the License is distributed on an "AS IS" BASIS,
|
| 12 |
-
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
| 13 |
-
* See the License for the specific language governing permissions and
|
| 14 |
-
* limitations under the License.
|
| 15 |
-
*/
|
| 16 |
-
|
| 17 |
-
#pragma once
|
| 18 |
-
|
| 19 |
-
#include <thrust/detail/config.h>
|
| 20 |
-
#include <thrust/detail/type_traits.h>
|
| 21 |
-
#include <thrust/detail/type_traits/is_metafunction_defined.h>
|
| 22 |
-
#include <thrust/detail/type_traits/minimum_type.h>
|
| 23 |
-
|
| 24 |
-
namespace thrust
|
| 25 |
-
{
|
| 26 |
-
namespace detail
|
| 27 |
-
{
|
| 28 |
-
|
| 29 |
-
|
| 30 |
-
template<typename T1,
|
| 31 |
-
typename T2 = void,
|
| 32 |
-
typename T3 = void,
|
| 33 |
-
typename T4 = void,
|
| 34 |
-
typename T5 = void,
|
| 35 |
-
typename T6 = void,
|
| 36 |
-
typename T7 = void,
|
| 37 |
-
typename T8 = void,
|
| 38 |
-
typename T9 = void,
|
| 39 |
-
typename T10 = void,
|
| 40 |
-
typename T11 = void,
|
| 41 |
-
typename T12 = void,
|
| 42 |
-
typename T13 = void,
|
| 43 |
-
typename T14 = void,
|
| 44 |
-
typename T15 = void,
|
| 45 |
-
typename T16 = void>
|
| 46 |
-
struct unrelated_systems {};
|
| 47 |
-
|
| 48 |
-
|
| 49 |
-
// if a minimum system exists for these arguments, return it
|
| 50 |
-
// otherwise, collect the arguments and report them as unrelated
|
| 51 |
-
template<typename T1,
|
| 52 |
-
typename T2 = minimum_type_detail::any_conversion,
|
| 53 |
-
typename T3 = minimum_type_detail::any_conversion,
|
| 54 |
-
typename T4 = minimum_type_detail::any_conversion,
|
| 55 |
-
typename T5 = minimum_type_detail::any_conversion,
|
| 56 |
-
typename T6 = minimum_type_detail::any_conversion,
|
| 57 |
-
typename T7 = minimum_type_detail::any_conversion,
|
| 58 |
-
typename T8 = minimum_type_detail::any_conversion,
|
| 59 |
-
typename T9 = minimum_type_detail::any_conversion,
|
| 60 |
-
typename T10 = minimum_type_detail::any_conversion,
|
| 61 |
-
typename T11 = minimum_type_detail::any_conversion,
|
| 62 |
-
typename T12 = minimum_type_detail::any_conversion,
|
| 63 |
-
typename T13 = minimum_type_detail::any_conversion,
|
| 64 |
-
typename T14 = minimum_type_detail::any_conversion,
|
| 65 |
-
typename T15 = minimum_type_detail::any_conversion,
|
| 66 |
-
typename T16 = minimum_type_detail::any_conversion>
|
| 67 |
-
struct minimum_system
|
| 68 |
-
: thrust::detail::eval_if<
|
| 69 |
-
is_metafunction_defined<
|
| 70 |
-
minimum_type<T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15,T16>
|
| 71 |
-
>::value,
|
| 72 |
-
minimum_type<T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15,T16>,
|
| 73 |
-
thrust::detail::identity_<
|
| 74 |
-
unrelated_systems<T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15,T16>
|
| 75 |
-
>
|
| 76 |
-
>
|
| 77 |
-
{}; // end minimum_system
|
| 78 |
-
|
| 79 |
-
|
| 80 |
-
} // end detail
|
| 81 |
-
} // end thrust
|
| 82 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/CVPR/WALT/mmdet/core/evaluation/recall.py
DELETED
|
@@ -1,189 +0,0 @@
|
|
| 1 |
-
from collections.abc import Sequence
|
| 2 |
-
|
| 3 |
-
import numpy as np
|
| 4 |
-
from mmcv.utils import print_log
|
| 5 |
-
from terminaltables import AsciiTable
|
| 6 |
-
|
| 7 |
-
from .bbox_overlaps import bbox_overlaps
|
| 8 |
-
|
| 9 |
-
|
| 10 |
-
def _recalls(all_ious, proposal_nums, thrs):
|
| 11 |
-
|
| 12 |
-
img_num = all_ious.shape[0]
|
| 13 |
-
total_gt_num = sum([ious.shape[0] for ious in all_ious])
|
| 14 |
-
|
| 15 |
-
_ious = np.zeros((proposal_nums.size, total_gt_num), dtype=np.float32)
|
| 16 |
-
for k, proposal_num in enumerate(proposal_nums):
|
| 17 |
-
tmp_ious = np.zeros(0)
|
| 18 |
-
for i in range(img_num):
|
| 19 |
-
ious = all_ious[i][:, :proposal_num].copy()
|
| 20 |
-
gt_ious = np.zeros((ious.shape[0]))
|
| 21 |
-
if ious.size == 0:
|
| 22 |
-
tmp_ious = np.hstack((tmp_ious, gt_ious))
|
| 23 |
-
continue
|
| 24 |
-
for j in range(ious.shape[0]):
|
| 25 |
-
gt_max_overlaps = ious.argmax(axis=1)
|
| 26 |
-
max_ious = ious[np.arange(0, ious.shape[0]), gt_max_overlaps]
|
| 27 |
-
gt_idx = max_ious.argmax()
|
| 28 |
-
gt_ious[j] = max_ious[gt_idx]
|
| 29 |
-
box_idx = gt_max_overlaps[gt_idx]
|
| 30 |
-
ious[gt_idx, :] = -1
|
| 31 |
-
ious[:, box_idx] = -1
|
| 32 |
-
tmp_ious = np.hstack((tmp_ious, gt_ious))
|
| 33 |
-
_ious[k, :] = tmp_ious
|
| 34 |
-
|
| 35 |
-
_ious = np.fliplr(np.sort(_ious, axis=1))
|
| 36 |
-
recalls = np.zeros((proposal_nums.size, thrs.size))
|
| 37 |
-
for i, thr in enumerate(thrs):
|
| 38 |
-
recalls[:, i] = (_ious >= thr).sum(axis=1) / float(total_gt_num)
|
| 39 |
-
|
| 40 |
-
return recalls
|
| 41 |
-
|
| 42 |
-
|
| 43 |
-
def set_recall_param(proposal_nums, iou_thrs):
|
| 44 |
-
"""Check proposal_nums and iou_thrs and set correct format."""
|
| 45 |
-
if isinstance(proposal_nums, Sequence):
|
| 46 |
-
_proposal_nums = np.array(proposal_nums)
|
| 47 |
-
elif isinstance(proposal_nums, int):
|
| 48 |
-
_proposal_nums = np.array([proposal_nums])
|
| 49 |
-
else:
|
| 50 |
-
_proposal_nums = proposal_nums
|
| 51 |
-
|
| 52 |
-
if iou_thrs is None:
|
| 53 |
-
_iou_thrs = np.array([0.5])
|
| 54 |
-
elif isinstance(iou_thrs, Sequence):
|
| 55 |
-
_iou_thrs = np.array(iou_thrs)
|
| 56 |
-
elif isinstance(iou_thrs, float):
|
| 57 |
-
_iou_thrs = np.array([iou_thrs])
|
| 58 |
-
else:
|
| 59 |
-
_iou_thrs = iou_thrs
|
| 60 |
-
|
| 61 |
-
return _proposal_nums, _iou_thrs
|
| 62 |
-
|
| 63 |
-
|
| 64 |
-
def eval_recalls(gts,
|
| 65 |
-
proposals,
|
| 66 |
-
proposal_nums=None,
|
| 67 |
-
iou_thrs=0.5,
|
| 68 |
-
logger=None):
|
| 69 |
-
"""Calculate recalls.
|
| 70 |
-
|
| 71 |
-
Args:
|
| 72 |
-
gts (list[ndarray]): a list of arrays of shape (n, 4)
|
| 73 |
-
proposals (list[ndarray]): a list of arrays of shape (k, 4) or (k, 5)
|
| 74 |
-
proposal_nums (int | Sequence[int]): Top N proposals to be evaluated.
|
| 75 |
-
iou_thrs (float | Sequence[float]): IoU thresholds. Default: 0.5.
|
| 76 |
-
logger (logging.Logger | str | None): The way to print the recall
|
| 77 |
-
summary. See `mmcv.utils.print_log()` for details. Default: None.
|
| 78 |
-
|
| 79 |
-
Returns:
|
| 80 |
-
ndarray: recalls of different ious and proposal nums
|
| 81 |
-
"""
|
| 82 |
-
|
| 83 |
-
img_num = len(gts)
|
| 84 |
-
assert img_num == len(proposals)
|
| 85 |
-
|
| 86 |
-
proposal_nums, iou_thrs = set_recall_param(proposal_nums, iou_thrs)
|
| 87 |
-
|
| 88 |
-
all_ious = []
|
| 89 |
-
for i in range(img_num):
|
| 90 |
-
if proposals[i].ndim == 2 and proposals[i].shape[1] == 5:
|
| 91 |
-
scores = proposals[i][:, 4]
|
| 92 |
-
sort_idx = np.argsort(scores)[::-1]
|
| 93 |
-
img_proposal = proposals[i][sort_idx, :]
|
| 94 |
-
else:
|
| 95 |
-
img_proposal = proposals[i]
|
| 96 |
-
prop_num = min(img_proposal.shape[0], proposal_nums[-1])
|
| 97 |
-
if gts[i] is None or gts[i].shape[0] == 0:
|
| 98 |
-
ious = np.zeros((0, img_proposal.shape[0]), dtype=np.float32)
|
| 99 |
-
else:
|
| 100 |
-
ious = bbox_overlaps(gts[i], img_proposal[:prop_num, :4])
|
| 101 |
-
all_ious.append(ious)
|
| 102 |
-
all_ious = np.array(all_ious)
|
| 103 |
-
recalls = _recalls(all_ious, proposal_nums, iou_thrs)
|
| 104 |
-
|
| 105 |
-
print_recall_summary(recalls, proposal_nums, iou_thrs, logger=logger)
|
| 106 |
-
return recalls
|
| 107 |
-
|
| 108 |
-
|
| 109 |
-
def print_recall_summary(recalls,
|
| 110 |
-
proposal_nums,
|
| 111 |
-
iou_thrs,
|
| 112 |
-
row_idxs=None,
|
| 113 |
-
col_idxs=None,
|
| 114 |
-
logger=None):
|
| 115 |
-
"""Print recalls in a table.
|
| 116 |
-
|
| 117 |
-
Args:
|
| 118 |
-
recalls (ndarray): calculated from `bbox_recalls`
|
| 119 |
-
proposal_nums (ndarray or list): top N proposals
|
| 120 |
-
iou_thrs (ndarray or list): iou thresholds
|
| 121 |
-
row_idxs (ndarray): which rows(proposal nums) to print
|
| 122 |
-
col_idxs (ndarray): which cols(iou thresholds) to print
|
| 123 |
-
logger (logging.Logger | str | None): The way to print the recall
|
| 124 |
-
summary. See `mmcv.utils.print_log()` for details. Default: None.
|
| 125 |
-
"""
|
| 126 |
-
proposal_nums = np.array(proposal_nums, dtype=np.int32)
|
| 127 |
-
iou_thrs = np.array(iou_thrs)
|
| 128 |
-
if row_idxs is None:
|
| 129 |
-
row_idxs = np.arange(proposal_nums.size)
|
| 130 |
-
if col_idxs is None:
|
| 131 |
-
col_idxs = np.arange(iou_thrs.size)
|
| 132 |
-
row_header = [''] + iou_thrs[col_idxs].tolist()
|
| 133 |
-
table_data = [row_header]
|
| 134 |
-
for i, num in enumerate(proposal_nums[row_idxs]):
|
| 135 |
-
row = [f'{val:.3f}' for val in recalls[row_idxs[i], col_idxs].tolist()]
|
| 136 |
-
row.insert(0, num)
|
| 137 |
-
table_data.append(row)
|
| 138 |
-
table = AsciiTable(table_data)
|
| 139 |
-
print_log('\n' + table.table, logger=logger)
|
| 140 |
-
|
| 141 |
-
|
| 142 |
-
def plot_num_recall(recalls, proposal_nums):
|
| 143 |
-
"""Plot Proposal_num-Recalls curve.
|
| 144 |
-
|
| 145 |
-
Args:
|
| 146 |
-
recalls(ndarray or list): shape (k,)
|
| 147 |
-
proposal_nums(ndarray or list): same shape as `recalls`
|
| 148 |
-
"""
|
| 149 |
-
if isinstance(proposal_nums, np.ndarray):
|
| 150 |
-
_proposal_nums = proposal_nums.tolist()
|
| 151 |
-
else:
|
| 152 |
-
_proposal_nums = proposal_nums
|
| 153 |
-
if isinstance(recalls, np.ndarray):
|
| 154 |
-
_recalls = recalls.tolist()
|
| 155 |
-
else:
|
| 156 |
-
_recalls = recalls
|
| 157 |
-
|
| 158 |
-
import matplotlib.pyplot as plt
|
| 159 |
-
f = plt.figure()
|
| 160 |
-
plt.plot([0] + _proposal_nums, [0] + _recalls)
|
| 161 |
-
plt.xlabel('Proposal num')
|
| 162 |
-
plt.ylabel('Recall')
|
| 163 |
-
plt.axis([0, proposal_nums.max(), 0, 1])
|
| 164 |
-
f.show()
|
| 165 |
-
|
| 166 |
-
|
| 167 |
-
def plot_iou_recall(recalls, iou_thrs):
|
| 168 |
-
"""Plot IoU-Recalls curve.
|
| 169 |
-
|
| 170 |
-
Args:
|
| 171 |
-
recalls(ndarray or list): shape (k,)
|
| 172 |
-
iou_thrs(ndarray or list): same shape as `recalls`
|
| 173 |
-
"""
|
| 174 |
-
if isinstance(iou_thrs, np.ndarray):
|
| 175 |
-
_iou_thrs = iou_thrs.tolist()
|
| 176 |
-
else:
|
| 177 |
-
_iou_thrs = iou_thrs
|
| 178 |
-
if isinstance(recalls, np.ndarray):
|
| 179 |
-
_recalls = recalls.tolist()
|
| 180 |
-
else:
|
| 181 |
-
_recalls = recalls
|
| 182 |
-
|
| 183 |
-
import matplotlib.pyplot as plt
|
| 184 |
-
f = plt.figure()
|
| 185 |
-
plt.plot(_iou_thrs + [1.0], _recalls + [0.])
|
| 186 |
-
plt.xlabel('IoU')
|
| 187 |
-
plt.ylabel('Recall')
|
| 188 |
-
plt.axis([iou_thrs.min(), 1, 0, 1])
|
| 189 |
-
f.show()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Catmeow/Face2Painting_From_Photo/README.md
DELETED
|
@@ -1,12 +0,0 @@
|
|
| 1 |
-
---
|
| 2 |
-
title: Face to Hand-painted style From Photo
|
| 3 |
-
emoji: 👨🦱 👩🦰
|
| 4 |
-
colorFrom: yellow
|
| 5 |
-
colorTo: indigo
|
| 6 |
-
sdk: gradio
|
| 7 |
-
sdk_version: 3.8.1
|
| 8 |
-
app_file: app.py
|
| 9 |
-
pinned: false
|
| 10 |
-
---
|
| 11 |
-
|
| 12 |
-
Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/ChandraMohanNayal/AutoGPT/autogpt/setup.py
DELETED
|
@@ -1,77 +0,0 @@
|
|
| 1 |
-
"""Set up the AI and its goals"""
|
| 2 |
-
from colorama import Fore, Style
|
| 3 |
-
|
| 4 |
-
from autogpt import utils
|
| 5 |
-
from autogpt.config.ai_config import AIConfig
|
| 6 |
-
from autogpt.logs import logger
|
| 7 |
-
|
| 8 |
-
|
| 9 |
-
def prompt_user() -> AIConfig:
|
| 10 |
-
"""Prompt the user for input
|
| 11 |
-
|
| 12 |
-
Returns:
|
| 13 |
-
AIConfig: The AIConfig object containing the user's input
|
| 14 |
-
"""
|
| 15 |
-
ai_name = ""
|
| 16 |
-
# Construct the prompt
|
| 17 |
-
logger.typewriter_log(
|
| 18 |
-
"Welcome to Auto-GPT! ",
|
| 19 |
-
Fore.GREEN,
|
| 20 |
-
"run with '--help' for more information.",
|
| 21 |
-
speak_text=True,
|
| 22 |
-
)
|
| 23 |
-
|
| 24 |
-
logger.typewriter_log(
|
| 25 |
-
"Create an AI-Assistant:",
|
| 26 |
-
Fore.GREEN,
|
| 27 |
-
"Enter the name of your AI and its role below. Entering nothing will load"
|
| 28 |
-
" defaults.",
|
| 29 |
-
speak_text=True,
|
| 30 |
-
)
|
| 31 |
-
|
| 32 |
-
# Get AI Name from User
|
| 33 |
-
logger.typewriter_log(
|
| 34 |
-
"Name your AI: ", Fore.GREEN, "For example, 'Entrepreneur-GPT'"
|
| 35 |
-
)
|
| 36 |
-
ai_name = utils.clean_input("AI Name: ")
|
| 37 |
-
if ai_name == "":
|
| 38 |
-
ai_name = "Entrepreneur-GPT"
|
| 39 |
-
|
| 40 |
-
logger.typewriter_log(
|
| 41 |
-
f"{ai_name} here!", Fore.LIGHTBLUE_EX, "I am at your service.", speak_text=True
|
| 42 |
-
)
|
| 43 |
-
|
| 44 |
-
# Get AI Role from User
|
| 45 |
-
logger.typewriter_log(
|
| 46 |
-
"Describe your AI's role: ",
|
| 47 |
-
Fore.GREEN,
|
| 48 |
-
"For example, 'an AI designed to autonomously develop and run businesses with"
|
| 49 |
-
" the sole goal of increasing your net worth.'",
|
| 50 |
-
)
|
| 51 |
-
ai_role = utils.clean_input(f"{ai_name} is: ")
|
| 52 |
-
if ai_role == "":
|
| 53 |
-
ai_role = "an AI designed to autonomously develop and run businesses with the"
|
| 54 |
-
" sole goal of increasing your net worth."
|
| 55 |
-
|
| 56 |
-
# Enter up to 5 goals for the AI
|
| 57 |
-
logger.typewriter_log(
|
| 58 |
-
"Enter up to 5 goals for your AI: ",
|
| 59 |
-
Fore.GREEN,
|
| 60 |
-
"For example: \nIncrease net worth, Grow Twitter Account, Develop and manage"
|
| 61 |
-
" multiple businesses autonomously'",
|
| 62 |
-
)
|
| 63 |
-
print("Enter nothing to load defaults, enter nothing when finished.", flush=True)
|
| 64 |
-
ai_goals = []
|
| 65 |
-
for i in range(5):
|
| 66 |
-
ai_goal = utils.clean_input(f"{Fore.LIGHTBLUE_EX}Goal{Style.RESET_ALL} {i+1}: ")
|
| 67 |
-
if ai_goal == "":
|
| 68 |
-
break
|
| 69 |
-
ai_goals.append(ai_goal)
|
| 70 |
-
if not ai_goals:
|
| 71 |
-
ai_goals = [
|
| 72 |
-
"Increase net worth",
|
| 73 |
-
"Grow Twitter Account",
|
| 74 |
-
"Develop and manage multiple businesses autonomously",
|
| 75 |
-
]
|
| 76 |
-
|
| 77 |
-
return AIConfig(ai_name, ai_role, ai_goals)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Cyril666/ContourNet-ABI/maskrcnn_benchmark/config/paths_catalog.py
DELETED
|
@@ -1,120 +0,0 @@
|
|
| 1 |
-
# Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
|
| 2 |
-
"""Centralized catalog of paths."""
|
| 3 |
-
|
| 4 |
-
import os
|
| 5 |
-
|
| 6 |
-
class DatasetCatalog(object):
|
| 7 |
-
DATA_DIR = "/home/zhangbq/ws/ct/dataset/"
|
| 8 |
-
DATASETS = {
|
| 9 |
-
"ic15_train": (
|
| 10 |
-
"ic15/ic15_train_images",
|
| 11 |
-
"ic15/annotations/ic15_train.json"
|
| 12 |
-
),
|
| 13 |
-
"ic15_test": (
|
| 14 |
-
"ic15/ic15_test_images",
|
| 15 |
-
"ic15/annotations/ic15_test.json"
|
| 16 |
-
),
|
| 17 |
-
"CTW1500_train": (
|
| 18 |
-
"ctw/ctw_train_images",
|
| 19 |
-
"ctw/annotations/ctw_train.json"
|
| 20 |
-
),
|
| 21 |
-
"CTW1500_test": (
|
| 22 |
-
"ctw/ctw_test_images",
|
| 23 |
-
"ctw/annotations/ctw_test.json"
|
| 24 |
-
)
|
| 25 |
-
|
| 26 |
-
}
|
| 27 |
-
|
| 28 |
-
@staticmethod
|
| 29 |
-
def get(name):
|
| 30 |
-
data_dir = DatasetCatalog.DATA_DIR
|
| 31 |
-
attrs = DatasetCatalog.DATASETS[name]
|
| 32 |
-
if "coco" in name:
|
| 33 |
-
args = dict(
|
| 34 |
-
root=os.path.join(data_dir, attrs["img_dir"]),
|
| 35 |
-
ann_file=os.path.join(data_dir, attrs["ann_file"]),
|
| 36 |
-
)
|
| 37 |
-
return dict(
|
| 38 |
-
factory="COCODataset",
|
| 39 |
-
args=args,
|
| 40 |
-
)
|
| 41 |
-
elif "voc" in name:
|
| 42 |
-
args = dict(
|
| 43 |
-
data_dir=os.path.join(data_dir, attrs["data_dir"]),
|
| 44 |
-
split=attrs["split"],
|
| 45 |
-
)
|
| 46 |
-
return dict(
|
| 47 |
-
factory="PascalVOCDataset",
|
| 48 |
-
args=args,
|
| 49 |
-
)
|
| 50 |
-
elif True:
|
| 51 |
-
args = dict(
|
| 52 |
-
root=os.path.join(data_dir, attrs[0]),
|
| 53 |
-
ann_file=os.path.join(data_dir, attrs[1]),
|
| 54 |
-
)
|
| 55 |
-
return dict(
|
| 56 |
-
factory="WordDataset",
|
| 57 |
-
args=args,
|
| 58 |
-
)
|
| 59 |
-
raise RuntimeError("Dataset not available: {}".format(name))
|
| 60 |
-
|
| 61 |
-
|
| 62 |
-
class ModelCatalog(object):
|
| 63 |
-
S3_C2_DETECTRON_URL = "https://dl.fbaipublicfiles.com/detectron"
|
| 64 |
-
C2_IMAGENET_MODELS = {
|
| 65 |
-
"MSRA/R-50": "ImageNetPretrained/MSRA/R-50.pkl",
|
| 66 |
-
"MSRA/R-50-GN": "ImageNetPretrained/47261647/R-50-GN.pkl",
|
| 67 |
-
"MSRA/R-101": "ImageNetPretrained/MSRA/R-101.pkl",
|
| 68 |
-
"MSRA/R-101-GN": "ImageNetPretrained/47592356/R-101-GN.pkl",
|
| 69 |
-
"FAIR/20171220/X-101-32x8d": "ImageNetPretrained/20171220/X-101-32x8d.pkl",
|
| 70 |
-
}
|
| 71 |
-
|
| 72 |
-
C2_DETECTRON_SUFFIX = "output/train/{}coco_2014_train%3A{}coco_2014_valminusminival/generalized_rcnn/model_final.pkl"
|
| 73 |
-
C2_DETECTRON_MODELS = {
|
| 74 |
-
"35857197/e2e_faster_rcnn_R-50-C4_1x": "01_33_49.iAX0mXvW",
|
| 75 |
-
"35857345/e2e_faster_rcnn_R-50-FPN_1x": "01_36_30.cUF7QR7I",
|
| 76 |
-
"35857890/e2e_faster_rcnn_R-101-FPN_1x": "01_38_50.sNxI7sX7",
|
| 77 |
-
"36761737/e2e_faster_rcnn_X-101-32x8d-FPN_1x": "06_31_39.5MIHi1fZ",
|
| 78 |
-
"35858791/e2e_mask_rcnn_R-50-C4_1x": "01_45_57.ZgkA7hPB",
|
| 79 |
-
"35858933/e2e_mask_rcnn_R-50-FPN_1x": "01_48_14.DzEQe4wC",
|
| 80 |
-
"35861795/e2e_mask_rcnn_R-101-FPN_1x": "02_31_37.KqyEK4tT",
|
| 81 |
-
"36761843/e2e_mask_rcnn_X-101-32x8d-FPN_1x": "06_35_59.RZotkLKI",
|
| 82 |
-
"37129812/e2e_mask_rcnn_X-152-32x8d-FPN-IN5k_1.44x": "09_35_36.8pzTQKYK",
|
| 83 |
-
# keypoints
|
| 84 |
-
"37697547/e2e_keypoint_rcnn_R-50-FPN_1x": "08_42_54.kdzV35ao"
|
| 85 |
-
}
|
| 86 |
-
|
| 87 |
-
@staticmethod
|
| 88 |
-
def get(name):
|
| 89 |
-
if name.startswith("Caffe2Detectron/COCO"):
|
| 90 |
-
return ModelCatalog.get_c2_detectron_12_2017_baselines(name)
|
| 91 |
-
if name.startswith("ImageNetPretrained"):
|
| 92 |
-
return ModelCatalog.get_c2_imagenet_pretrained(name)
|
| 93 |
-
raise RuntimeError("model not present in the catalog {}".format(name))
|
| 94 |
-
|
| 95 |
-
@staticmethod
|
| 96 |
-
def get_c2_imagenet_pretrained(name):
|
| 97 |
-
prefix = ModelCatalog.S3_C2_DETECTRON_URL
|
| 98 |
-
name = name[len("ImageNetPretrained/"):]
|
| 99 |
-
name = ModelCatalog.C2_IMAGENET_MODELS[name]
|
| 100 |
-
url = "/".join([prefix, name])
|
| 101 |
-
return url
|
| 102 |
-
|
| 103 |
-
@staticmethod
|
| 104 |
-
def get_c2_detectron_12_2017_baselines(name):
|
| 105 |
-
# Detectron C2 models are stored following the structure
|
| 106 |
-
# prefix/<model_id>/2012_2017_baselines/<model_name>.yaml.<signature>/suffix
|
| 107 |
-
# we use as identifiers in the catalog Caffe2Detectron/COCO/<model_id>/<model_name>
|
| 108 |
-
prefix = ModelCatalog.S3_C2_DETECTRON_URL
|
| 109 |
-
dataset_tag = "keypoints_" if "keypoint" in name else ""
|
| 110 |
-
suffix = ModelCatalog.C2_DETECTRON_SUFFIX.format(dataset_tag, dataset_tag)
|
| 111 |
-
# remove identification prefix
|
| 112 |
-
name = name[len("Caffe2Detectron/COCO/"):]
|
| 113 |
-
# split in <model_id> and <model_name>
|
| 114 |
-
model_id, model_name = name.split("/")
|
| 115 |
-
# parsing to make it match the url address from the Caffe2 models
|
| 116 |
-
model_name = "{}.yaml".format(model_name)
|
| 117 |
-
signature = ModelCatalog.C2_DETECTRON_MODELS[name]
|
| 118 |
-
unique_name = ".".join([model_name, signature])
|
| 119 |
-
url = "/".join([prefix, model_id, "12_2017_baselines", unique_name, suffix])
|
| 120 |
-
return url
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/DAMO-NLP-SG/Video-LLaMA/video_llama/conversation/__init__.py
DELETED
|
File without changes
|
spaces/DQChoi/gpt-demo/venv/lib/python3.11/site-packages/PIL/ImtImagePlugin.py
DELETED
|
@@ -1,101 +0,0 @@
|
|
| 1 |
-
#
|
| 2 |
-
# The Python Imaging Library.
|
| 3 |
-
# $Id$
|
| 4 |
-
#
|
| 5 |
-
# IM Tools support for PIL
|
| 6 |
-
#
|
| 7 |
-
# history:
|
| 8 |
-
# 1996-05-27 fl Created (read 8-bit images only)
|
| 9 |
-
# 2001-02-17 fl Use 're' instead of 'regex' (Python 2.1) (0.2)
|
| 10 |
-
#
|
| 11 |
-
# Copyright (c) Secret Labs AB 1997-2001.
|
| 12 |
-
# Copyright (c) Fredrik Lundh 1996-2001.
|
| 13 |
-
#
|
| 14 |
-
# See the README file for information on usage and redistribution.
|
| 15 |
-
#
|
| 16 |
-
|
| 17 |
-
|
| 18 |
-
import re
|
| 19 |
-
|
| 20 |
-
from . import Image, ImageFile
|
| 21 |
-
|
| 22 |
-
#
|
| 23 |
-
# --------------------------------------------------------------------
|
| 24 |
-
|
| 25 |
-
field = re.compile(rb"([a-z]*) ([^ \r\n]*)")
|
| 26 |
-
|
| 27 |
-
|
| 28 |
-
##
|
| 29 |
-
# Image plugin for IM Tools images.
|
| 30 |
-
|
| 31 |
-
|
| 32 |
-
class ImtImageFile(ImageFile.ImageFile):
|
| 33 |
-
format = "IMT"
|
| 34 |
-
format_description = "IM Tools"
|
| 35 |
-
|
| 36 |
-
def _open(self):
|
| 37 |
-
# Quick rejection: if there's not a LF among the first
|
| 38 |
-
# 100 bytes, this is (probably) not a text header.
|
| 39 |
-
|
| 40 |
-
buffer = self.fp.read(100)
|
| 41 |
-
if b"\n" not in buffer:
|
| 42 |
-
msg = "not an IM file"
|
| 43 |
-
raise SyntaxError(msg)
|
| 44 |
-
|
| 45 |
-
xsize = ysize = 0
|
| 46 |
-
|
| 47 |
-
while True:
|
| 48 |
-
if buffer:
|
| 49 |
-
s = buffer[:1]
|
| 50 |
-
buffer = buffer[1:]
|
| 51 |
-
else:
|
| 52 |
-
s = self.fp.read(1)
|
| 53 |
-
if not s:
|
| 54 |
-
break
|
| 55 |
-
|
| 56 |
-
if s == b"\x0C":
|
| 57 |
-
# image data begins
|
| 58 |
-
self.tile = [
|
| 59 |
-
(
|
| 60 |
-
"raw",
|
| 61 |
-
(0, 0) + self.size,
|
| 62 |
-
self.fp.tell() - len(buffer),
|
| 63 |
-
(self.mode, 0, 1),
|
| 64 |
-
)
|
| 65 |
-
]
|
| 66 |
-
|
| 67 |
-
break
|
| 68 |
-
|
| 69 |
-
else:
|
| 70 |
-
# read key/value pair
|
| 71 |
-
if b"\n" not in buffer:
|
| 72 |
-
buffer += self.fp.read(100)
|
| 73 |
-
lines = buffer.split(b"\n")
|
| 74 |
-
s += lines.pop(0)
|
| 75 |
-
buffer = b"\n".join(lines)
|
| 76 |
-
if len(s) == 1 or len(s) > 100:
|
| 77 |
-
break
|
| 78 |
-
if s[0] == ord(b"*"):
|
| 79 |
-
continue # comment
|
| 80 |
-
|
| 81 |
-
m = field.match(s)
|
| 82 |
-
if not m:
|
| 83 |
-
break
|
| 84 |
-
k, v = m.group(1, 2)
|
| 85 |
-
if k == b"width":
|
| 86 |
-
xsize = int(v)
|
| 87 |
-
self._size = xsize, ysize
|
| 88 |
-
elif k == b"height":
|
| 89 |
-
ysize = int(v)
|
| 90 |
-
self._size = xsize, ysize
|
| 91 |
-
elif k == b"pixel" and v == b"n8":
|
| 92 |
-
self.mode = "L"
|
| 93 |
-
|
| 94 |
-
|
| 95 |
-
#
|
| 96 |
-
# --------------------------------------------------------------------
|
| 97 |
-
|
| 98 |
-
Image.register_open(ImtImageFile.format, ImtImageFile)
|
| 99 |
-
|
| 100 |
-
#
|
| 101 |
-
# no extension registered (".im" is simply too common)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/DQChoi/gpt-demo/venv/lib/python3.11/site-packages/gradio/templates/cdn/assets/Upload-9bb55fba.js
DELETED
|
@@ -1,2 +0,0 @@
|
|
| 1 |
-
import{S as H,e as I,s as J,a9 as L,N as A,O as V,K as o,U as F,p as W,M as B,Q as f,Y as m,af as b,ab as X,ac as Z,ad as x,z as $,v as ee,A as ae,a1 as le,B as te,F as y,h as ie}from"./index-1d65707a.js";import{b as ne}from"./ModifyUpload.svelte_svelte_type_style_lang-d2acacf0.js";function re(l){let a,n,r,c,g,u,i,k,z;const v=l[15].default,d=L(v,l,l[14],null);return{c(){a=A("div"),d&&d.c(),n=V(),r=A("input"),o(r,"type","file"),o(r,"accept",l[0]),r.multiple=c=l[4]==="multiple"||void 0,o(r,"webkitdirectory",g=l[4]==="directory"||void 0),o(r,"mozdirectory",u=l[4]==="directory"||void 0),o(r,"class","svelte-116rqfv"),o(a,"class","svelte-116rqfv"),F(a,"center",l[2]),F(a,"boundedheight",l[1]),F(a,"flex",l[3])},m(t,s){W(t,a,s),d&&d.m(a,null),B(a,n),B(a,r),l[23](r),i=!0,k||(z=[f(r,"change",l[8]),f(a,"drag",m(b(l[16]))),f(a,"dragstart",m(b(l[17]))),f(a,"dragend",m(b(l[18]))),f(a,"dragover",m(b(l[19]))),f(a,"dragenter",m(b(l[20]))),f(a,"dragleave",m(b(l[21]))),f(a,"drop",m(b(l[22]))),f(a,"click",l[7]),f(a,"drop",l[9]),f(a,"dragenter",l[6]),f(a,"dragleave",l[6])],k=!0)},p(t,[s]){d&&d.p&&(!i||s&16384)&&X(d,v,t,t[14],i?x(v,t[14],s,null):Z(t[14]),null),(!i||s&1)&&o(r,"accept",t[0]),(!i||s&16&&c!==(c=t[4]==="multiple"||void 0))&&(r.multiple=c),(!i||s&16&&g!==(g=t[4]==="directory"||void 0))&&o(r,"webkitdirectory",g),(!i||s&16&&u!==(u=t[4]==="directory"||void 0))&&o(r,"mozdirectory",u),(!i||s&4)&&F(a,"center",t[2]),(!i||s&2)&&F(a,"boundedheight",t[1]),(!i||s&8)&&F(a,"flex",t[3])},i(t){i||($(d,t),i=!0)},o(t){ee(d,t),i=!1},d(t){t&&ae(a),d&&d.d(t),l[23](null),k=!1,le(z)}}}function de(l,a,n){let{$$slots:r={},$$scope:c}=a,{filetype:g=null}=a,{include_file_metadata:u=!0}=a,{dragging:i=!1}=a,{boundedheight:k=!0}=a,{center:z=!0}=a,{flex:v=!0}=a,{file_count:d="single"}=a,{disable_click:t=!1}=a,{parse_to_data_url:s=!0}=a,w;const S=te(),C=()=>{n(10,i=!i)},E=()=>{t||(n(5,w.value="",w),w.click())},D=async e=>{let h=Array.from(e);if(!(!e.length||!window.FileReader)){if(d==="single"&&(h=[e[0]]),u)var T=h.map(_=>({name:_.name,size:_.size}));var p=[],U=[];s?U=await Promise.all(h.map(_=>ne(_))):U=h,u?s?p=U.map((_,q)=>({data:_,...T[q]})):p=U.map((_,q)=>({data:"",blob:_,...T[q]})):p=U,S("load",d==="single"?p[0]:p)}},K=async e=>{const h=e.target;h.files&&await D(h.files)},M=async e=>{n(10,i=!1),e.dataTransfer?.files&&await D(e.dataTransfer.files)};function N(e){y.call(this,l,e)}function O(e){y.call(this,l,e)}function P(e){y.call(this,l,e)}function Q(e){y.call(this,l,e)}function R(e){y.call(this,l,e)}function Y(e){y.call(this,l,e)}function j(e){y.call(this,l,e)}function G(e){ie[e?"unshift":"push"](()=>{w=e,n(5,w)})}return l.$$set=e=>{"filetype"in e&&n(0,g=e.filetype),"include_file_metadata"in e&&n(11,u=e.include_file_metadata),"dragging"in e&&n(10,i=e.dragging),"boundedheight"in e&&n(1,k=e.boundedheight),"center"in e&&n(2,z=e.center),"flex"in e&&n(3,v=e.flex),"file_count"in e&&n(4,d=e.file_count),"disable_click"in e&&n(12,t=e.disable_click),"parse_to_data_url"in e&&n(13,s=e.parse_to_data_url),"$$scope"in e&&n(14,c=e.$$scope)},[g,k,z,v,d,w,C,E,K,M,i,u,t,s,c,r,N,O,P,Q,R,Y,j,G]}class ue extends H{constructor(a){super(),I(this,a,de,re,J,{filetype:0,include_file_metadata:11,dragging:10,boundedheight:1,center:2,flex:3,file_count:4,disable_click:12,parse_to_data_url:13})}}export{ue as U};
|
| 2 |
-
//# sourceMappingURL=Upload-9bb55fba.js.map
|
|
|
|
|
|
|
|
|
spaces/DQChoi/gpt-demo/venv/lib/python3.11/site-packages/gradio/templates/frontend/assets/linear-58a44b5e.js
DELETED
|
@@ -1,2 +0,0 @@
|
|
| 1 |
-
function W(n,t){return n==null||t==null?NaN:n<t?-1:n>t?1:n>=t?0:NaN}function En(n){let t=n,e=n,r=n;n.length!==2&&(t=(a,u)=>n(a)-u,e=W,r=(a,u)=>W(n(a),u));function i(a,u,s=0,c=a.length){if(s<c){if(e(u,u)!==0)return c;do{const h=s+c>>>1;r(a[h],u)<0?s=h+1:c=h}while(s<c)}return s}function f(a,u,s=0,c=a.length){if(s<c){if(e(u,u)!==0)return c;do{const h=s+c>>>1;r(a[h],u)<=0?s=h+1:c=h}while(s<c)}return s}function o(a,u,s=0,c=a.length){const h=i(a,u,s,c-1);return h>s&&t(a[h-1],u)>-t(a[h],u)?h-1:h}return{left:i,center:o,right:f}}function Un(n){return n===null?NaN:+n}function*Qt(n,t){if(t===void 0)for(let e of n)e!=null&&(e=+e)>=e&&(yield e);else{let e=-1;for(let r of n)(r=t(r,++e,n))!=null&&(r=+r)>=r&&(yield r)}}const Pn=En(W),Yn=Pn.right,Ut=Pn.left;En(Un).center;const Jn=Yn;var nn=Math.sqrt(50),tn=Math.sqrt(10),en=Math.sqrt(2);function Kn(n,t,e){var r,i=-1,f,o,a;if(t=+t,n=+n,e=+e,n===t&&e>0)return[n];if((r=t<n)&&(f=n,n=t,t=f),(a=jn(n,t,e))===0||!isFinite(a))return[];if(a>0){let u=Math.round(n/a),s=Math.round(t/a);for(u*a<n&&++u,s*a>t&&--s,o=new Array(f=s-u+1);++i<f;)o[i]=(u+i)*a}else{a=-a;let u=Math.round(n*a),s=Math.round(t*a);for(u/a<n&&++u,s/a>t&&--s,o=new Array(f=s-u+1);++i<f;)o[i]=(u+i)/a}return r&&o.reverse(),o}function jn(n,t,e){var r=(t-n)/Math.max(0,e),i=Math.floor(Math.log(r)/Math.LN10),f=r/Math.pow(10,i);return i>=0?(f>=nn?10:f>=tn?5:f>=en?2:1)*Math.pow(10,i):-Math.pow(10,-i)/(f>=nn?10:f>=tn?5:f>=en?2:1)}function Wn(n,t,e){var r=Math.abs(t-n)/Math.max(0,e),i=Math.pow(10,Math.floor(Math.log(r)/Math.LN10)),f=r/i;return f>=nn?i*=10:f>=tn?i*=5:f>=en&&(i*=2),t<n?-i:i}function nt(n){return Math.abs(n=Math.round(n))>=1e21?n.toLocaleString("en").replace(/,/g,""):n.toString(10)}function G(n,t){if((e=(n=t?n.toExponential(t-1):n.toExponential()).indexOf("e"))<0)return null;var e,r=n.slice(0,e);return[r.length>1?r[0]+r.slice(2):r,+n.slice(e+1)]}function L(n){return n=G(Math.abs(n)),n?n[1]:NaN}function tt(n,t){return function(e,r){for(var i=e.length,f=[],o=0,a=n[0],u=0;i>0&&a>0&&(u+a+1>r&&(a=Math.max(1,r-u)),f.push(e.substring(i-=a,i+a)),!((u+=a+1)>r));)a=n[o=(o+1)%n.length];return f.reverse().join(t)}}function et(n){return function(t){return t.replace(/[0-9]/g,function(e){return n[+e]})}}var rt=/^(?:(.)?([<>=^]))?([+\-( ])?([$#])?(0)?(\d+)?(,)?(\.\d+)?(~)?([a-z%])?$/i;function Z(n){if(!(t=rt.exec(n)))throw new Error("invalid format: "+n);var t;return new sn({fill:t[1],align:t[2],sign:t[3],symbol:t[4],zero:t[5],width:t[6],comma:t[7],precision:t[8]&&t[8].slice(1),trim:t[9],type:t[10]})}Z.prototype=sn.prototype;function sn(n){this.fill=n.fill===void 0?" ":n.fill+"",this.align=n.align===void 0?">":n.align+"",this.sign=n.sign===void 0?"-":n.sign+"",this.symbol=n.symbol===void 0?"":n.symbol+"",this.zero=!!n.zero,this.width=n.width===void 0?void 0:+n.width,this.comma=!!n.comma,this.precision=n.precision===void 0?void 0:+n.precision,this.trim=!!n.trim,this.type=n.type===void 0?"":n.type+""}sn.prototype.toString=function(){return this.fill+this.align+this.sign+this.symbol+(this.zero?"0":"")+(this.width===void 0?"":Math.max(1,this.width|0))+(this.comma?",":"")+(this.precision===void 0?"":"."+Math.max(0,this.precision|0))+(this.trim?"~":"")+this.type};function it(n){n:for(var t=n.length,e=1,r=-1,i;e<t;++e)switch(n[e]){case".":r=i=e;break;case"0":r===0&&(r=e),i=e;break;default:if(!+n[e])break n;r>0&&(r=0);break}return r>0?n.slice(0,r)+n.slice(i+1):n}var qn;function at(n,t){var e=G(n,t);if(!e)return n+"";var r=e[0],i=e[1],f=i-(qn=Math.max(-8,Math.min(8,Math.floor(i/3)))*3)+1,o=r.length;return f===o?r:f>o?r+new Array(f-o+1).join("0"):f>0?r.slice(0,f)+"."+r.slice(f):"0."+new Array(1-f).join("0")+G(n,Math.max(0,t+f-1))[0]}function xn(n,t){var e=G(n,t);if(!e)return n+"";var r=e[0],i=e[1];return i<0?"0."+new Array(-i).join("0")+r:r.length>i+1?r.slice(0,i+1)+"."+r.slice(i+1):r+new Array(i-r.length+2).join("0")}const mn={"%":(n,t)=>(n*100).toFixed(t),b:n=>Math.round(n).toString(2),c:n=>n+"",d:nt,e:(n,t)=>n.toExponential(t),f:(n,t)=>n.toFixed(t),g:(n,t)=>n.toPrecision(t),o:n=>Math.round(n).toString(8),p:(n,t)=>xn(n*100,t),r:xn,s:at,X:n=>Math.round(n).toString(16).toUpperCase(),x:n=>Math.round(n).toString(16)};function bn(n){return n}var pn=Array.prototype.map,yn=["y","z","a","f","p","n","µ","m","","k","M","G","T","P","E","Z","Y"];function ft(n){var t=n.grouping===void 0||n.thousands===void 0?bn:tt(pn.call(n.grouping,Number),n.thousands+""),e=n.currency===void 0?"":n.currency[0]+"",r=n.currency===void 0?"":n.currency[1]+"",i=n.decimal===void 0?".":n.decimal+"",f=n.numerals===void 0?bn:et(pn.call(n.numerals,String)),o=n.percent===void 0?"%":n.percent+"",a=n.minus===void 0?"−":n.minus+"",u=n.nan===void 0?"NaN":n.nan+"";function s(h){h=Z(h);var l=h.fill,p=h.align,g=h.sign,k=h.symbol,v=h.zero,N=h.width,R=h.comma,y=h.precision,H=h.trim,m=h.type;m==="n"?(R=!0,m="g"):mn[m]||(y===void 0&&(y=12),H=!0,m="g"),(v||l==="0"&&p==="=")&&(v=!0,l="0",p="=");var Vn=k==="$"?e:k==="#"&&/[boxX]/.test(m)?"0"+m.toLowerCase():"",Xn=k==="$"?r:/[%p]/.test(m)?o:"",ln=mn[m],Qn=/[defgprs%]/.test(m);y=y===void 0?6:/[gprs]/.test(m)?Math.max(1,Math.min(21,y)):Math.max(0,Math.min(20,y));function dn(d){var A=Vn,b=Xn,E,gn,F;if(m==="c")b=ln(d)+b,d="";else{d=+d;var $=d<0||1/d<0;if(d=isNaN(d)?u:ln(Math.abs(d),y),H&&(d=it(d)),$&&+d==0&&g!=="+"&&($=!1),A=($?g==="("?g:a:g==="-"||g==="("?"":g)+A,b=(m==="s"?yn[8+qn/3]:"")+b+($&&g==="("?")":""),Qn){for(E=-1,gn=d.length;++E<gn;)if(F=d.charCodeAt(E),48>F||F>57){b=(F===46?i+d.slice(E+1):d.slice(E))+b,d=d.slice(0,E);break}}}R&&!v&&(d=t(d,1/0));var B=A.length+d.length+b.length,_=B<N?new Array(N-B+1).join(l):"";switch(R&&v&&(d=t(_+d,_.length?N-b.length:1/0),_=""),p){case"<":d=A+d+b+_;break;case"=":d=A+_+d+b;break;case"^":d=_.slice(0,B=_.length>>1)+A+d+b+_.slice(B);break;default:d=_+A+d+b;break}return f(d)}return dn.toString=function(){return h+""},dn}function c(h,l){var p=s((h=Z(h),h.type="f",h)),g=Math.max(-8,Math.min(8,Math.floor(L(l)/3)))*3,k=Math.pow(10,-g),v=yn[8+g/3];return function(N){return p(k*N)+v}}return{format:s,formatPrefix:c}}var D,Ln,Hn;ot({thousands:",",grouping:[3],currency:["$",""]});function ot(n){return D=ft(n),Ln=D.format,Hn=D.formatPrefix,D}function ut(n){return Math.max(0,-L(Math.abs(n)))}function st(n,t){return Math.max(0,Math.max(-8,Math.min(8,Math.floor(L(t)/3)))*3-L(Math.abs(n)))}function ht(n,t){return n=Math.abs(n),t=Math.abs(t)-n,Math.max(0,L(t)-L(n))+1}const rn=Math.PI,an=2*rn,S=1e-6,ct=an-S;function fn(){this._x0=this._y0=this._x1=this._y1=null,this._=""}function In(){return new fn}fn.prototype=In.prototype={constructor:fn,moveTo:function(n,t){this._+="M"+(this._x0=this._x1=+n)+","+(this._y0=this._y1=+t)},closePath:function(){this._x1!==null&&(this._x1=this._x0,this._y1=this._y0,this._+="Z")},lineTo:function(n,t){this._+="L"+(this._x1=+n)+","+(this._y1=+t)},quadraticCurveTo:function(n,t,e,r){this._+="Q"+ +n+","+ +t+","+(this._x1=+e)+","+(this._y1=+r)},bezierCurveTo:function(n,t,e,r,i,f){this._+="C"+ +n+","+ +t+","+ +e+","+ +r+","+(this._x1=+i)+","+(this._y1=+f)},arcTo:function(n,t,e,r,i){n=+n,t=+t,e=+e,r=+r,i=+i;var f=this._x1,o=this._y1,a=e-n,u=r-t,s=f-n,c=o-t,h=s*s+c*c;if(i<0)throw new Error("negative radius: "+i);if(this._x1===null)this._+="M"+(this._x1=n)+","+(this._y1=t);else if(h>S)if(!(Math.abs(c*a-u*s)>S)||!i)this._+="L"+(this._x1=n)+","+(this._y1=t);else{var l=e-f,p=r-o,g=a*a+u*u,k=l*l+p*p,v=Math.sqrt(g),N=Math.sqrt(h),R=i*Math.tan((rn-Math.acos((g+h-k)/(2*v*N)))/2),y=R/N,H=R/v;Math.abs(y-1)>S&&(this._+="L"+(n+y*s)+","+(t+y*c)),this._+="A"+i+","+i+",0,0,"+ +(c*l>s*p)+","+(this._x1=n+H*a)+","+(this._y1=t+H*u)}},arc:function(n,t,e,r,i,f){n=+n,t=+t,e=+e,f=!!f;var o=e*Math.cos(r),a=e*Math.sin(r),u=n+o,s=t+a,c=1^f,h=f?r-i:i-r;if(e<0)throw new Error("negative radius: "+e);this._x1===null?this._+="M"+u+","+s:(Math.abs(this._x1-u)>S||Math.abs(this._y1-s)>S)&&(this._+="L"+u+","+s),e&&(h<0&&(h=h%an+an),h>ct?this._+="A"+e+","+e+",0,1,"+c+","+(n-o)+","+(t-a)+"A"+e+","+e+",0,1,"+c+","+(this._x1=u)+","+(this._y1=s):h>S&&(this._+="A"+e+","+e+",0,"+ +(h>=rn)+","+c+","+(this._x1=n+e*Math.cos(i))+","+(this._y1=t+e*Math.sin(i))))},rect:function(n,t,e,r){this._+="M"+(this._x0=this._x1=+n)+","+(this._y0=this._y1=+t)+"h"+ +e+"v"+ +r+"h"+-e+"Z"},toString:function(){return this._}};function P(n){return function(){return n}}function lt(n){return typeof n=="object"&&"length"in n?n:Array.from(n)}function Tn(n){this._context=n}Tn.prototype={areaStart:function(){this._line=0},areaEnd:function(){this._line=NaN},lineStart:function(){this._point=0},lineEnd:function(){(this._line||this._line!==0&&this._point===1)&&this._context.closePath(),this._line=1-this._line},point:function(n,t){switch(n=+n,t=+t,this._point){case 0:this._point=1,this._line?this._context.lineTo(n,t):this._context.moveTo(n,t);break;case 1:this._point=2;default:this._context.lineTo(n,t);break}}};function dt(n){return new Tn(n)}function gt(n){return n[0]}function xt(n){return n[1]}function Yt(n,t){var e=P(!0),r=null,i=dt,f=null;n=typeof n=="function"?n:n===void 0?gt:P(n),t=typeof t=="function"?t:t===void 0?xt:P(t);function o(a){var u,s=(a=lt(a)).length,c,h=!1,l;for(r==null&&(f=i(l=In())),u=0;u<=s;++u)!(u<s&&e(c=a[u],u,a))===h&&((h=!h)?f.lineStart():f.lineEnd()),h&&f.point(+n(c,u,a),+t(c,u,a));if(l)return f=null,l+""||null}return o.x=function(a){return arguments.length?(n=typeof a=="function"?a:P(+a),o):n},o.y=function(a){return arguments.length?(t=typeof a=="function"?a:P(+a),o):t},o.defined=function(a){return arguments.length?(e=typeof a=="function"?a:P(!!a),o):e},o.curve=function(a){return arguments.length?(i=a,r!=null&&(f=i(r)),o):i},o.context=function(a){return arguments.length?(a==null?r=f=null:f=i(r=a),o):r},o}function mt(n,t){switch(arguments.length){case 0:break;case 1:this.range(n);break;default:this.range(t).domain(n);break}return this}function Jt(n,t){switch(arguments.length){case 0:break;case 1:{typeof n=="function"?this.interpolator(n):this.range(n);break}default:{this.domain(n),typeof t=="function"?this.interpolator(t):this.range(t);break}}return this}function hn(n,t,e){n.prototype=t.prototype=e,e.constructor=n}function zn(n,t){var e=Object.create(n.prototype);for(var r in t)e[r]=t[r];return e}function C(){}var I=.7,V=1/I,q="\\s*([+-]?\\d+)\\s*",T="\\s*([+-]?\\d*\\.?\\d+(?:[eE][+-]?\\d+)?)\\s*",M="\\s*([+-]?\\d*\\.?\\d+(?:[eE][+-]?\\d+)?)%\\s*",bt=/^#([0-9a-f]{3,8})$/,pt=new RegExp("^rgb\\("+[q,q,q]+"\\)$"),yt=new RegExp("^rgb\\("+[M,M,M]+"\\)$"),wt=new RegExp("^rgba\\("+[q,q,q,T]+"\\)$"),Mt=new RegExp("^rgba\\("+[M,M,M,T]+"\\)$"),vt=new RegExp("^hsl\\("+[T,M,M]+"\\)$"),_t=new RegExp("^hsla\\("+[T,M,M,T]+"\\)$"),wn={aliceblue:15792383,antiquewhite:16444375,aqua:65535,aquamarine:8388564,azure:15794175,beige:16119260,bisque:16770244,black:0,blanchedalmond:16772045,blue:255,blueviolet:9055202,brown:10824234,burlywood:14596231,cadetblue:6266528,chartreuse:8388352,chocolate:13789470,coral:16744272,cornflowerblue:6591981,cornsilk:16775388,crimson:14423100,cyan:65535,darkblue:139,darkcyan:35723,darkgoldenrod:12092939,darkgray:11119017,darkgreen:25600,darkgrey:11119017,darkkhaki:12433259,darkmagenta:9109643,darkolivegreen:5597999,darkorange:16747520,darkorchid:10040012,darkred:9109504,darksalmon:15308410,darkseagreen:9419919,darkslateblue:4734347,darkslategray:3100495,darkslategrey:3100495,darkturquoise:52945,darkviolet:9699539,deeppink:16716947,deepskyblue:49151,dimgray:6908265,dimgrey:6908265,dodgerblue:2003199,firebrick:11674146,floralwhite:16775920,forestgreen:2263842,fuchsia:16711935,gainsboro:14474460,ghostwhite:16316671,gold:16766720,goldenrod:14329120,gray:8421504,green:32768,greenyellow:11403055,grey:8421504,honeydew:15794160,hotpink:16738740,indianred:13458524,indigo:4915330,ivory:16777200,khaki:15787660,lavender:15132410,lavenderblush:16773365,lawngreen:8190976,lemonchiffon:16775885,lightblue:11393254,lightcoral:15761536,lightcyan:14745599,lightgoldenrodyellow:16448210,lightgray:13882323,lightgreen:9498256,lightgrey:13882323,lightpink:16758465,lightsalmon:16752762,lightseagreen:2142890,lightskyblue:8900346,lightslategray:7833753,lightslategrey:7833753,lightsteelblue:11584734,lightyellow:16777184,lime:65280,limegreen:3329330,linen:16445670,magenta:16711935,maroon:8388608,mediumaquamarine:6737322,mediumblue:205,mediumorchid:12211667,mediumpurple:9662683,mediumseagreen:3978097,mediumslateblue:8087790,mediumspringgreen:64154,mediumturquoise:4772300,mediumvioletred:13047173,midnightblue:1644912,mintcream:16121850,mistyrose:16770273,moccasin:16770229,navajowhite:16768685,navy:128,oldlace:16643558,olive:8421376,olivedrab:7048739,orange:16753920,orangered:16729344,orchid:14315734,palegoldenrod:15657130,palegreen:10025880,paleturquoise:11529966,palevioletred:14381203,papayawhip:16773077,peachpuff:16767673,peru:13468991,pink:16761035,plum:14524637,powderblue:11591910,purple:8388736,rebeccapurple:6697881,red:16711680,rosybrown:12357519,royalblue:4286945,saddlebrown:9127187,salmon:16416882,sandybrown:16032864,seagreen:3050327,seashell:16774638,sienna:10506797,silver:12632256,skyblue:8900331,slateblue:6970061,slategray:7372944,slategrey:7372944,snow:16775930,springgreen:65407,steelblue:4620980,tan:13808780,teal:32896,thistle:14204888,tomato:16737095,turquoise:4251856,violet:15631086,wheat:16113331,white:16777215,whitesmoke:16119285,yellow:16776960,yellowgreen:10145074};hn(C,z,{copy:function(n){return Object.assign(new this.constructor,this,n)},displayable:function(){return this.rgb().displayable()},hex:Mn,formatHex:Mn,formatHsl:Nt,formatRgb:vn,toString:vn});function Mn(){return this.rgb().formatHex()}function Nt(){return Cn(this).formatHsl()}function vn(){return this.rgb().formatRgb()}function z(n){var t,e;return n=(n+"").trim().toLowerCase(),(t=bt.exec(n))?(e=t[1].length,t=parseInt(t[1],16),e===6?_n(t):e===3?new x(t>>8&15|t>>4&240,t>>4&15|t&240,(t&15)<<4|t&15,1):e===8?O(t>>24&255,t>>16&255,t>>8&255,(t&255)/255):e===4?O(t>>12&15|t>>8&240,t>>8&15|t>>4&240,t>>4&15|t&240,((t&15)<<4|t&15)/255):null):(t=pt.exec(n))?new x(t[1],t[2],t[3],1):(t=yt.exec(n))?new x(t[1]*255/100,t[2]*255/100,t[3]*255/100,1):(t=wt.exec(n))?O(t[1],t[2],t[3],t[4]):(t=Mt.exec(n))?O(t[1]*255/100,t[2]*255/100,t[3]*255/100,t[4]):(t=vt.exec(n))?An(t[1],t[2]/100,t[3]/100,1):(t=_t.exec(n))?An(t[1],t[2]/100,t[3]/100,t[4]):wn.hasOwnProperty(n)?_n(wn[n]):n==="transparent"?new x(NaN,NaN,NaN,0):null}function _n(n){return new x(n>>16&255,n>>8&255,n&255,1)}function O(n,t,e,r){return r<=0&&(n=t=e=NaN),new x(n,t,e,r)}function kt(n){return n instanceof C||(n=z(n)),n?(n=n.rgb(),new x(n.r,n.g,n.b,n.opacity)):new x}function X(n,t,e,r){return arguments.length===1?kt(n):new x(n,t,e,r??1)}function x(n,t,e,r){this.r=+n,this.g=+t,this.b=+e,this.opacity=+r}hn(x,X,zn(C,{brighter:function(n){return n=n==null?V:Math.pow(V,n),new x(this.r*n,this.g*n,this.b*n,this.opacity)},darker:function(n){return n=n==null?I:Math.pow(I,n),new x(this.r*n,this.g*n,this.b*n,this.opacity)},rgb:function(){return this},displayable:function(){return-.5<=this.r&&this.r<255.5&&-.5<=this.g&&this.g<255.5&&-.5<=this.b&&this.b<255.5&&0<=this.opacity&&this.opacity<=1},hex:Nn,formatHex:Nn,formatRgb:kn,toString:kn}));function Nn(){return"#"+Y(this.r)+Y(this.g)+Y(this.b)}function kn(){var n=this.opacity;return n=isNaN(n)?1:Math.max(0,Math.min(1,n)),(n===1?"rgb(":"rgba(")+Math.max(0,Math.min(255,Math.round(this.r)||0))+", "+Math.max(0,Math.min(255,Math.round(this.g)||0))+", "+Math.max(0,Math.min(255,Math.round(this.b)||0))+(n===1?")":", "+n+")")}function Y(n){return n=Math.max(0,Math.min(255,Math.round(n)||0)),(n<16?"0":"")+n.toString(16)}function An(n,t,e,r){return r<=0?n=t=e=NaN:e<=0||e>=1?n=t=NaN:t<=0&&(n=NaN),new w(n,t,e,r)}function Cn(n){if(n instanceof w)return new w(n.h,n.s,n.l,n.opacity);if(n instanceof C||(n=z(n)),!n)return new w;if(n instanceof w)return n;n=n.rgb();var t=n.r/255,e=n.g/255,r=n.b/255,i=Math.min(t,e,r),f=Math.max(t,e,r),o=NaN,a=f-i,u=(f+i)/2;return a?(t===f?o=(e-r)/a+(e<r)*6:e===f?o=(r-t)/a+2:o=(t-e)/a+4,a/=u<.5?f+i:2-f-i,o*=60):a=u>0&&u<1?0:o,new w(o,a,u,n.opacity)}function At(n,t,e,r){return arguments.length===1?Cn(n):new w(n,t,e,r??1)}function w(n,t,e,r){this.h=+n,this.s=+t,this.l=+e,this.opacity=+r}hn(w,At,zn(C,{brighter:function(n){return n=n==null?V:Math.pow(V,n),new w(this.h,this.s,this.l*n,this.opacity)},darker:function(n){return n=n==null?I:Math.pow(I,n),new w(this.h,this.s,this.l*n,this.opacity)},rgb:function(){var n=this.h%360+(this.h<0)*360,t=isNaN(n)||isNaN(this.s)?0:this.s,e=this.l,r=e+(e<.5?e:1-e)*t,i=2*e-r;return new x(J(n>=240?n-240:n+120,i,r),J(n,i,r),J(n<120?n+240:n-120,i,r),this.opacity)},displayable:function(){return(0<=this.s&&this.s<=1||isNaN(this.s))&&0<=this.l&&this.l<=1&&0<=this.opacity&&this.opacity<=1},formatHsl:function(){var n=this.opacity;return n=isNaN(n)?1:Math.max(0,Math.min(1,n)),(n===1?"hsl(":"hsla(")+(this.h||0)+", "+(this.s||0)*100+"%, "+(this.l||0)*100+"%"+(n===1?")":", "+n+")")}}));function J(n,t,e){return(n<60?t+(e-t)*n/60:n<180?e:n<240?t+(e-t)*(240-n)/60:t)*255}function Fn(n,t,e,r,i){var f=n*n,o=f*n;return((1-3*n+3*f-o)*t+(4-6*f+3*o)*e+(1+3*n+3*f-3*o)*r+o*i)/6}function St(n){var t=n.length-1;return function(e){var r=e<=0?e=0:e>=1?(e=1,t-1):Math.floor(e*t),i=n[r],f=n[r+1],o=r>0?n[r-1]:2*i-f,a=r<t-1?n[r+2]:2*f-i;return Fn((e-r/t)*t,o,i,f,a)}}function Rt(n){var t=n.length;return function(e){var r=Math.floor(((e%=1)<0?++e:e)*t),i=n[(r+t-1)%t],f=n[r%t],o=n[(r+1)%t],a=n[(r+2)%t];return Fn((e-r/t)*t,i,f,o,a)}}const U=n=>()=>n;function $n(n,t){return function(e){return n+e*t}}function Et(n,t,e){return n=Math.pow(n,e),t=Math.pow(t,e)-n,e=1/e,function(r){return Math.pow(n+r*t,e)}}function Kt(n,t){var e=t-n;return e?$n(n,e>180||e<-180?e-360*Math.round(e/360):e):U(isNaN(n)?t:n)}function Pt(n){return(n=+n)==1?Bn:function(t,e){return e-t?Et(t,e,n):U(isNaN(t)?e:t)}}function Bn(n,t){var e=t-n;return e?$n(n,e):U(isNaN(n)?t:n)}const Sn=function n(t){var e=Pt(t);function r(i,f){var o=e((i=X(i)).r,(f=X(f)).r),a=e(i.g,f.g),u=e(i.b,f.b),s=Bn(i.opacity,f.opacity);return function(c){return i.r=o(c),i.g=a(c),i.b=u(c),i.opacity=s(c),i+""}}return r.gamma=n,r}(1);function Dn(n){return function(t){var e=t.length,r=new Array(e),i=new Array(e),f=new Array(e),o,a;for(o=0;o<e;++o)a=X(t[o]),r[o]=a.r||0,i[o]=a.g||0,f[o]=a.b||0;return r=n(r),i=n(i),f=n(f),a.opacity=1,function(u){return a.r=r(u),a.g=i(u),a.b=f(u),a+""}}}var Wt=Dn(St),ne=Dn(Rt);function On(n,t){t||(t=[]);var e=n?Math.min(t.length,n.length):0,r=t.slice(),i;return function(f){for(i=0;i<e;++i)r[i]=n[i]*(1-f)+t[i]*f;return r}}function Gn(n){return ArrayBuffer.isView(n)&&!(n instanceof DataView)}function te(n,t){return(Gn(t)?On:Zn)(n,t)}function Zn(n,t){var e=t?t.length:0,r=n?Math.min(e,n.length):0,i=new Array(r),f=new Array(e),o;for(o=0;o<r;++o)i[o]=cn(n[o],t[o]);for(;o<e;++o)f[o]=t[o];return function(a){for(o=0;o<r;++o)f[o]=i[o](a);return f}}function jt(n,t){var e=new Date;return n=+n,t=+t,function(r){return e.setTime(n*(1-r)+t*r),e}}function Q(n,t){return n=+n,t=+t,function(e){return n*(1-e)+t*e}}function qt(n,t){var e={},r={},i;(n===null||typeof n!="object")&&(n={}),(t===null||typeof t!="object")&&(t={});for(i in t)i in n?e[i]=cn(n[i],t[i]):r[i]=t[i];return function(f){for(i in e)r[i]=e[i](f);return r}}var on=/[-+]?(?:\d+\.?\d*|\.?\d+)(?:[eE][-+]?\d+)?/g,K=new RegExp(on.source,"g");function Lt(n){return function(){return n}}function Ht(n){return function(t){return n(t)+""}}function It(n,t){var e=on.lastIndex=K.lastIndex=0,r,i,f,o=-1,a=[],u=[];for(n=n+"",t=t+"";(r=on.exec(n))&&(i=K.exec(t));)(f=i.index)>e&&(f=t.slice(e,f),a[o]?a[o]+=f:a[++o]=f),(r=r[0])===(i=i[0])?a[o]?a[o]+=i:a[++o]=i:(a[++o]=null,u.push({i:o,x:Q(r,i)})),e=K.lastIndex;return e<t.length&&(f=t.slice(e),a[o]?a[o]+=f:a[++o]=f),a.length<2?u[0]?Ht(u[0].x):Lt(t):(t=u.length,function(s){for(var c=0,h;c<t;++c)a[(h=u[c]).i]=h.x(s);return a.join("")})}function cn(n,t){var e=typeof t,r;return t==null||e==="boolean"?U(t):(e==="number"?Q:e==="string"?(r=z(t))?(t=r,Sn):It:t instanceof z?Sn:t instanceof Date?jt:Gn(t)?On:Array.isArray(t)?Zn:typeof t.valueOf!="function"&&typeof t.toString!="function"||isNaN(t)?qt:Q)(n,t)}function Tt(n,t){return n=+n,t=+t,function(e){return Math.round(n*(1-e)+t*e)}}function zt(n){return function(){return n}}function Ct(n){return+n}var Rn=[0,1];function j(n){return n}function un(n,t){return(t-=n=+n)?function(e){return(e-n)/t}:zt(isNaN(t)?NaN:.5)}function Ft(n,t){var e;return n>t&&(e=n,n=t,t=e),function(r){return Math.max(n,Math.min(t,r))}}function $t(n,t,e){var r=n[0],i=n[1],f=t[0],o=t[1];return i<r?(r=un(i,r),f=e(o,f)):(r=un(r,i),f=e(f,o)),function(a){return f(r(a))}}function Bt(n,t,e){var r=Math.min(n.length,t.length)-1,i=new Array(r),f=new Array(r),o=-1;for(n[r]<n[0]&&(n=n.slice().reverse(),t=t.slice().reverse());++o<r;)i[o]=un(n[o],n[o+1]),f[o]=e(t[o],t[o+1]);return function(a){var u=Jn(n,a,1,r)-1;return f[u](i[u](a))}}function Dt(n,t){return t.domain(n.domain()).range(n.range()).interpolate(n.interpolate()).clamp(n.clamp()).unknown(n.unknown())}function Ot(){var n=Rn,t=Rn,e=cn,r,i,f,o=j,a,u,s;function c(){var l=Math.min(n.length,t.length);return o!==j&&(o=Ft(n[0],n[l-1])),a=l>2?Bt:$t,u=s=null,h}function h(l){return l==null||isNaN(l=+l)?f:(u||(u=a(n.map(r),t,e)))(r(o(l)))}return h.invert=function(l){return o(i((s||(s=a(t,n.map(r),Q)))(l)))},h.domain=function(l){return arguments.length?(n=Array.from(l,Ct),c()):n.slice()},h.range=function(l){return arguments.length?(t=Array.from(l),c()):t.slice()},h.rangeRound=function(l){return t=Array.from(l),e=Tt,c()},h.clamp=function(l){return arguments.length?(o=l?!0:j,c()):o!==j},h.interpolate=function(l){return arguments.length?(e=l,c()):e},h.unknown=function(l){return arguments.length?(f=l,h):f},function(l,p){return r=l,i=p,c()}}function Gt(){return Ot()(j,j)}function Zt(n,t,e,r){var i=Wn(n,t,e),f;switch(r=Z(r??",f"),r.type){case"s":{var o=Math.max(Math.abs(n),Math.abs(t));return r.precision==null&&!isNaN(f=st(i,o))&&(r.precision=f),Hn(r,o)}case"":case"e":case"g":case"p":case"r":{r.precision==null&&!isNaN(f=ht(i,Math.max(Math.abs(n),Math.abs(t))))&&(r.precision=f-(r.type==="e"));break}case"f":case"%":{r.precision==null&&!isNaN(f=ut(i))&&(r.precision=f-(r.type==="%")*2);break}}return Ln(r)}function Vt(n){var t=n.domain;return n.ticks=function(e){var r=t();return Kn(r[0],r[r.length-1],e??10)},n.tickFormat=function(e,r){var i=t();return Zt(i[0],i[i.length-1],e??10,r)},n.nice=function(e){e==null&&(e=10);var r=t(),i=0,f=r.length-1,o=r[i],a=r[f],u,s,c=10;for(a<o&&(s=o,o=a,a=s,s=i,i=f,f=s);c-- >0;){if(s=jn(o,a,e),s===u)return r[i]=o,r[f]=a,t(r);if(s>0)o=Math.floor(o/s)*s,a=Math.ceil(a/s)*s;else if(s<0)o=Math.ceil(o*s)/s,a=Math.floor(a*s)/s;else break;u=s}return n},n}function Xt(){var n=Gt();return n.copy=function(){return Dt(n,Xt())},mt.apply(n,arguments),Vt(n)}export{Yn as $,At as A,Bn as B,C,cn as D,te as E,St as F,Rt as G,jt as H,On as I,qt as J,Sn as K,Wt as L,ne as M,Tt as N,It as O,Ct as P,Vt as Q,x as R,Ot as S,Dt as T,Kn as U,j as V,Jn as W,Gt as X,Jt as Y,Xt as Z,Yt as _,W as a,Zt as a0,X as a1,Ut as a2,Un as b,En as c,ht as d,st as e,Z as f,Ln as g,Hn as h,ft as i,P as j,In as k,dt as l,lt as m,Qt as n,mt as o,ut as p,hn as q,kt as r,zn as s,Wn as t,V as u,I as v,Kt as w,gt as x,xt as y,Q as z};
|
| 2 |
-
//# sourceMappingURL=linear-58a44b5e.js.map
|
|
|
|
|
|
|
|
|