Commit
·
897dd44
1
Parent(s):
e6211f6
Update parquet files (step 101 of 121)
Browse filesThis view is limited to 50 files because it contains too many changes.
See raw diff
- spaces/101-5/gpt4free/g4f/.v1/gpt4free/quora/api.py +0 -558
- spaces/1acneusushi/gradio-2dmoleculeeditor/data/Bandicam free email and serial number How to update your Bandicam version and check the license information.md +0 -123
- spaces/1gistliPinn/ChatGPT4/Examples/Adjprog Cracked.exe.md +0 -6
- spaces/1gistliPinn/ChatGPT4/Examples/Code Geass Lust Terrorist.md +0 -13
- spaces/1gistliPinn/ChatGPT4/Examples/Download !FREE! Visual Basic 5.0 Setup Toolkit.md +0 -6
- spaces/1gistliPinn/ChatGPT4/Examples/FSX Wilco Evolution vol 2 fix Crack Fly the A330 A340 and More with this Amazing Addon.md +0 -27
- spaces/1gistliPinn/ChatGPT4/Examples/Film Impact Transitions Crack !!BETTER!! Macbook.md +0 -7
- spaces/1line/AutoGPT/autogpt/commands/times.py +0 -10
- spaces/1pelhydcardo/ChatGPT-prompt-generator/Haseena-Dual-Audio-Hindi-Eng-720p.md +0 -68
- spaces/1pelhydcardo/ChatGPT-prompt-generator/assets/Download Blockman Go Versi Terbaru A Free App with Diverse Gameplay Options and Features.md +0 -180
- spaces/7hao/bingo/src/components/ui/button.tsx +0 -57
- spaces/7hao/bingo/src/components/ui/separator.tsx +0 -31
- spaces/7hao/bingo/src/lib/isomorphic/node.ts +0 -26
- spaces/A666sxr/Genshin_TTS/monotonic_align/setup.py +0 -9
- spaces/AIFILMS/audioldm-text-to-audio-generation/audioldm/hifigan/utilities.py +0 -85
- spaces/AIGC-Audio/AudioGPT/text_to_audio/Make_An_Audio/ldm/modules/midas/api.py +0 -170
- spaces/AIZero2Hero4Health/7-ClinicalTerminologyUIUX-GR/README.md +0 -12
- spaces/ATang0729/Forecast4Muses/Model/Model6/Model6_2_ProfileRecogition/mmpretrain/configs/resnet/resnet50_8xb32-cutmix_in1k.py +0 -5
- spaces/AchyuthGamer/OpenGPT/g4f/Provider/Providers/Gravityengine.py +0 -27
- spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/templates/ui/basesizer/RemoveChildrenMap.js +0 -17
- spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/templates/ui/dialog/Factory.d.ts +0 -5
- spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/templates/ui/fixwidthsizer/Methods.js +0 -25
- spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/templates/ui/space/Space.js +0 -10
- spaces/Akim/claudeAPI/Dockerfile +0 -14
- spaces/AlekseyKorshuk/thin-plate-spline-motion-model/modules/inpainting_network.py +0 -130
- spaces/Androidonnxfork/CivitAi-to-Diffusers/diffusers/docs/source/en/using-diffusers/textual_inversion_inference.md +0 -80
- spaces/Andy1621/uniformer_image_detection/configs/scnet/scnet_x101_64x4d_fpn_20e_coco.py +0 -14
- spaces/AnnonSubmission/xai-cl/methods.py +0 -376
- spaces/AquaSuisei/ChatGPTXE/modules/shared.py +0 -55
- spaces/AsakuraMizu/moe-tts/monotonic_align/core.py +0 -36
- spaces/Awesimo/jojogan/op/__init__.py +0 -0
- spaces/Bart92/RVC_HF/lib/uvr5_pack/lib_v5/layers_33966KB.py +0 -126
- spaces/BartPoint/VoiceChange/infer_pack/modules/F0Predictor/HarvestF0Predictor.py +0 -86
- spaces/Benson/text-generation/Examples/Bicicletas Indias Conduccin 3d Descargar Enlace.md +0 -127
- spaces/Benson/text-generation/Examples/Descargar Aviones De Guerra Ww2 Pelea De Perros Mod Apk Android 1.md +0 -75
- spaces/Big-Web/MMSD/env/Lib/site-packages/pip/_internal/utils/wheel.py +0 -136
- spaces/Big-Web/MMSD/env/Lib/site-packages/pkg_resources/_vendor/more_itertools/more.py +0 -0
- spaces/Big-Web/MMSD/env/Lib/site-packages/setuptools/command/register.py +0 -18
- spaces/BilalSardar/Reinhard_Color_Transformation/app.py +0 -47
- spaces/Biliovo/anime-remove-background/app.py +0 -52
- spaces/Borpos/openchat-openchat/README.md +0 -12
- spaces/CVPR/Dual-Key_Backdoor_Attacks/openvqa/openvqa/datasets/vqa/eval/result_eval.py +0 -94
- spaces/CVPR/LIVE/thrust/thrust/detail/complex/ccoshf.h +0 -141
- spaces/CVPR/LIVE/thrust/thrust/system/cuda/detail/swap_ranges.h +0 -107
- spaces/Cartinoe5930/LLMAgora/model_inference.py +0 -128
- spaces/ChandraMohanNayal/AutoGPT/autogpt/commands/google_search.py +0 -87
- spaces/Cyril666/ContourNet-ABI/maskrcnn_benchmark/data/__init__.py +0 -2
- spaces/Cyril666/ContourNet-ABI/maskrcnn_benchmark/data/datasets/evaluation/word/util/io_.py +0 -216
- spaces/DHEIVER/Alzheimer/app.py +0 -46
- spaces/DHEIVER/Anomalias_no_Trato_Gastrointestinal/app.py +0 -66
spaces/101-5/gpt4free/g4f/.v1/gpt4free/quora/api.py
DELETED
@@ -1,558 +0,0 @@
|
|
1 |
-
# This file was taken from the repository poe-api https://github.com/ading2210/poe-api and is unmodified
|
2 |
-
# This file is licensed under the GNU GPL v3 and written by @ading2210
|
3 |
-
|
4 |
-
# license:
|
5 |
-
# ading2210/poe-api: a reverse engineered Python API wrapepr for Quora's Poe
|
6 |
-
# Copyright (C) 2023 ading2210
|
7 |
-
|
8 |
-
# This program is free software: you can redistribute it and/or modify
|
9 |
-
# it under the terms of the GNU General Public License as published by
|
10 |
-
# the Free Software Foundation, either version 3 of the License, or
|
11 |
-
# (at your option) any later version.
|
12 |
-
|
13 |
-
# This program is distributed in the hope that it will be useful,
|
14 |
-
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
15 |
-
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
16 |
-
# GNU General Public License for more details.
|
17 |
-
|
18 |
-
# You should have received a copy of the GNU General Public License
|
19 |
-
# along with this program. If not, see <https://www.gnu.org/licenses/>.
|
20 |
-
|
21 |
-
import hashlib
|
22 |
-
import json
|
23 |
-
import logging
|
24 |
-
import queue
|
25 |
-
import random
|
26 |
-
import re
|
27 |
-
import threading
|
28 |
-
import time
|
29 |
-
import traceback
|
30 |
-
from pathlib import Path
|
31 |
-
from urllib.parse import urlparse
|
32 |
-
|
33 |
-
import requests
|
34 |
-
import requests.adapters
|
35 |
-
import websocket
|
36 |
-
|
37 |
-
parent_path = Path(__file__).resolve().parent
|
38 |
-
queries_path = parent_path / "graphql"
|
39 |
-
queries = {}
|
40 |
-
|
41 |
-
logging.basicConfig()
|
42 |
-
logger = logging.getLogger()
|
43 |
-
|
44 |
-
user_agent = "Mozilla/5.0 (X11; Linux x86_64; rv:102.0) Gecko/20100101 Firefox/102.0"
|
45 |
-
|
46 |
-
|
47 |
-
def load_queries():
|
48 |
-
for path in queries_path.iterdir():
|
49 |
-
if path.suffix != ".graphql":
|
50 |
-
continue
|
51 |
-
with open(path) as f:
|
52 |
-
queries[path.stem] = f.read()
|
53 |
-
|
54 |
-
|
55 |
-
def generate_payload(query_name, variables):
|
56 |
-
return {"query": queries[query_name], "variables": variables}
|
57 |
-
|
58 |
-
|
59 |
-
def retry_request(method, *args, **kwargs):
|
60 |
-
"""Retry a request with 10 attempts by default, delay increases exponentially"""
|
61 |
-
max_attempts: int = kwargs.pop("max_attempts", 10)
|
62 |
-
delay = kwargs.pop("delay", 1)
|
63 |
-
url = args[0]
|
64 |
-
|
65 |
-
for attempt in range(1, max_attempts + 1):
|
66 |
-
try:
|
67 |
-
response = method(*args, **kwargs)
|
68 |
-
response.raise_for_status()
|
69 |
-
return response
|
70 |
-
except Exception as error:
|
71 |
-
logger.warning(
|
72 |
-
f"Attempt {attempt}/{max_attempts} failed with error: {error}. "
|
73 |
-
f"Retrying in {delay} seconds..."
|
74 |
-
)
|
75 |
-
time.sleep(delay)
|
76 |
-
delay *= 2
|
77 |
-
raise RuntimeError(f"Failed to download {url} after {max_attempts} attempts.")
|
78 |
-
|
79 |
-
|
80 |
-
class Client:
|
81 |
-
gql_url = "https://poe.com/api/gql_POST"
|
82 |
-
gql_recv_url = "https://poe.com/api/receive_POST"
|
83 |
-
home_url = "https://poe.com"
|
84 |
-
settings_url = "https://poe.com/api/settings"
|
85 |
-
|
86 |
-
def __init__(self, token, proxy=None):
|
87 |
-
self.proxy = proxy
|
88 |
-
self.session = requests.Session()
|
89 |
-
self.adapter = requests.adapters.HTTPAdapter(pool_connections=100, pool_maxsize=100)
|
90 |
-
self.session.mount("http://", self.adapter)
|
91 |
-
self.session.mount("https://", self.adapter)
|
92 |
-
|
93 |
-
if proxy:
|
94 |
-
self.session.proxies = {"http": self.proxy, "https": self.proxy}
|
95 |
-
logger.info(f"Proxy enabled: {self.proxy}")
|
96 |
-
|
97 |
-
self.active_messages = {}
|
98 |
-
self.message_queues = {}
|
99 |
-
|
100 |
-
self.session.cookies.set("p-b", token, domain="poe.com")
|
101 |
-
self.headers = {
|
102 |
-
"User-Agent": user_agent,
|
103 |
-
"Referrer": "https://poe.com/",
|
104 |
-
"Origin": "https://poe.com",
|
105 |
-
}
|
106 |
-
self.session.headers.update(self.headers)
|
107 |
-
|
108 |
-
self.setup_connection()
|
109 |
-
self.connect_ws()
|
110 |
-
|
111 |
-
def setup_connection(self):
|
112 |
-
self.ws_domain = f"tch{random.randint(1, 1e6)}"
|
113 |
-
self.next_data = self.get_next_data(overwrite_vars=True)
|
114 |
-
self.channel = self.get_channel_data()
|
115 |
-
self.bots = self.get_bots(download_next_data=False)
|
116 |
-
self.bot_names = self.get_bot_names()
|
117 |
-
|
118 |
-
self.gql_headers = {
|
119 |
-
"poe-formkey": self.formkey,
|
120 |
-
"poe-tchannel": self.channel["channel"],
|
121 |
-
}
|
122 |
-
self.gql_headers = {**self.gql_headers, **self.headers}
|
123 |
-
self.subscribe()
|
124 |
-
|
125 |
-
def extract_formkey(self, html):
|
126 |
-
script_regex = r"<script>if\(.+\)throw new Error;(.+)</script>"
|
127 |
-
script_text = re.search(script_regex, html).group(1)
|
128 |
-
key_regex = r'var .="([0-9a-f]+)",'
|
129 |
-
key_text = re.search(key_regex, script_text).group(1)
|
130 |
-
cipher_regex = r".\[(\d+)\]=.\[(\d+)\]"
|
131 |
-
cipher_pairs = re.findall(cipher_regex, script_text)
|
132 |
-
|
133 |
-
formkey_list = [""] * len(cipher_pairs)
|
134 |
-
for pair in cipher_pairs:
|
135 |
-
formkey_index, key_index = map(int, pair)
|
136 |
-
formkey_list[formkey_index] = key_text[key_index]
|
137 |
-
formkey = "".join(formkey_list)
|
138 |
-
|
139 |
-
return formkey
|
140 |
-
|
141 |
-
def get_next_data(self, overwrite_vars=False):
|
142 |
-
logger.info("Downloading next_data...")
|
143 |
-
|
144 |
-
r = retry_request(self.session.get, self.home_url)
|
145 |
-
json_regex = r'<script id="__NEXT_DATA__" type="application\/json">(.+?)</script>'
|
146 |
-
json_text = re.search(json_regex, r.text).group(1)
|
147 |
-
next_data = json.loads(json_text)
|
148 |
-
|
149 |
-
if overwrite_vars:
|
150 |
-
self.formkey = self.extract_formkey(r.text)
|
151 |
-
self.viewer = next_data["props"]["pageProps"]["payload"]["viewer"]
|
152 |
-
self.next_data = next_data
|
153 |
-
|
154 |
-
return next_data
|
155 |
-
|
156 |
-
def get_bot(self, display_name):
|
157 |
-
url = f'https://poe.com/_next/data/{self.next_data["buildId"]}/{display_name}.json'
|
158 |
-
|
159 |
-
r = retry_request(self.session.get, url)
|
160 |
-
|
161 |
-
chat_data = r.json()["pageProps"]["payload"]["chatOfBotDisplayName"]
|
162 |
-
return chat_data
|
163 |
-
|
164 |
-
def get_bots(self, download_next_data=True):
|
165 |
-
logger.info("Downloading all bots...")
|
166 |
-
if download_next_data:
|
167 |
-
next_data = self.get_next_data(overwrite_vars=True)
|
168 |
-
else:
|
169 |
-
next_data = self.next_data
|
170 |
-
|
171 |
-
if not "viewerBotList" in self.viewer:
|
172 |
-
raise RuntimeError("Invalid token or no bots are available.")
|
173 |
-
bot_list = self.viewer["viewerBotList"]
|
174 |
-
|
175 |
-
threads = []
|
176 |
-
bots = {}
|
177 |
-
|
178 |
-
def get_bot_thread(bot):
|
179 |
-
chat_data = self.get_bot(bot["displayName"])
|
180 |
-
bots[chat_data["defaultBotObject"]["nickname"]] = chat_data
|
181 |
-
|
182 |
-
for bot in bot_list:
|
183 |
-
thread = threading.Thread(target=get_bot_thread, args=(bot,), daemon=True)
|
184 |
-
threads.append(thread)
|
185 |
-
|
186 |
-
for thread in threads:
|
187 |
-
thread.start()
|
188 |
-
for thread in threads:
|
189 |
-
thread.join()
|
190 |
-
|
191 |
-
self.bots = bots
|
192 |
-
self.bot_names = self.get_bot_names()
|
193 |
-
return bots
|
194 |
-
|
195 |
-
def get_bot_names(self):
|
196 |
-
bot_names = {}
|
197 |
-
for bot_nickname in self.bots:
|
198 |
-
bot_obj = self.bots[bot_nickname]["defaultBotObject"]
|
199 |
-
bot_names[bot_nickname] = bot_obj["displayName"]
|
200 |
-
return bot_names
|
201 |
-
|
202 |
-
def get_remaining_messages(self, chatbot):
|
203 |
-
chat_data = self.get_bot(self.bot_names[chatbot])
|
204 |
-
return chat_data["defaultBotObject"]["messageLimit"]["numMessagesRemaining"]
|
205 |
-
|
206 |
-
def get_channel_data(self, channel=None):
|
207 |
-
logger.info("Downloading channel data...")
|
208 |
-
r = retry_request(self.session.get, self.settings_url)
|
209 |
-
data = r.json()
|
210 |
-
|
211 |
-
return data["tchannelData"]
|
212 |
-
|
213 |
-
def get_websocket_url(self, channel=None):
|
214 |
-
if channel is None:
|
215 |
-
channel = self.channel
|
216 |
-
query = f'?min_seq={channel["minSeq"]}&channel={channel["channel"]}&hash={channel["channelHash"]}'
|
217 |
-
return f'wss://{self.ws_domain}.tch.{channel["baseHost"]}/up/{channel["boxName"]}/updates' + query
|
218 |
-
|
219 |
-
def send_query(self, query_name, variables):
|
220 |
-
for i in range(20):
|
221 |
-
json_data = generate_payload(query_name, variables)
|
222 |
-
payload = json.dumps(json_data, separators=(",", ":"))
|
223 |
-
|
224 |
-
base_string = payload + self.gql_headers["poe-formkey"] + "WpuLMiXEKKE98j56k"
|
225 |
-
|
226 |
-
headers = {
|
227 |
-
"content-type": "application/json",
|
228 |
-
"poe-tag-id": hashlib.md5(base_string.encode()).hexdigest(),
|
229 |
-
}
|
230 |
-
headers = {**self.gql_headers, **headers}
|
231 |
-
|
232 |
-
r = retry_request(self.session.post, self.gql_url, data=payload, headers=headers)
|
233 |
-
|
234 |
-
data = r.json()
|
235 |
-
if data["data"] is None:
|
236 |
-
logger.warn(f'{query_name} returned an error: {data["errors"][0]["message"]} | Retrying ({i + 1}/20)')
|
237 |
-
time.sleep(2)
|
238 |
-
continue
|
239 |
-
|
240 |
-
return r.json()
|
241 |
-
|
242 |
-
raise RuntimeError(f"{query_name} failed too many times.")
|
243 |
-
|
244 |
-
def subscribe(self):
|
245 |
-
logger.info("Subscribing to mutations")
|
246 |
-
result = self.send_query(
|
247 |
-
"SubscriptionsMutation",
|
248 |
-
{
|
249 |
-
"subscriptions": [
|
250 |
-
{
|
251 |
-
"subscriptionName": "messageAdded",
|
252 |
-
"query": queries["MessageAddedSubscription"],
|
253 |
-
},
|
254 |
-
{
|
255 |
-
"subscriptionName": "viewerStateUpdated",
|
256 |
-
"query": queries["ViewerStateUpdatedSubscription"],
|
257 |
-
},
|
258 |
-
]
|
259 |
-
},
|
260 |
-
)
|
261 |
-
|
262 |
-
def ws_run_thread(self):
|
263 |
-
kwargs = {}
|
264 |
-
if self.proxy:
|
265 |
-
proxy_parsed = urlparse(self.proxy)
|
266 |
-
kwargs = {
|
267 |
-
"proxy_type": proxy_parsed.scheme,
|
268 |
-
"http_proxy_host": proxy_parsed.hostname,
|
269 |
-
"http_proxy_port": proxy_parsed.port,
|
270 |
-
}
|
271 |
-
|
272 |
-
self.ws.run_forever(**kwargs)
|
273 |
-
|
274 |
-
def connect_ws(self):
|
275 |
-
self.ws_connected = False
|
276 |
-
self.ws = websocket.WebSocketApp(
|
277 |
-
self.get_websocket_url(),
|
278 |
-
header={"User-Agent": user_agent},
|
279 |
-
on_message=self.on_message,
|
280 |
-
on_open=self.on_ws_connect,
|
281 |
-
on_error=self.on_ws_error,
|
282 |
-
on_close=self.on_ws_close,
|
283 |
-
)
|
284 |
-
t = threading.Thread(target=self.ws_run_thread, daemon=True)
|
285 |
-
t.start()
|
286 |
-
while not self.ws_connected:
|
287 |
-
time.sleep(0.01)
|
288 |
-
|
289 |
-
def disconnect_ws(self):
|
290 |
-
if self.ws:
|
291 |
-
self.ws.close()
|
292 |
-
self.ws_connected = False
|
293 |
-
|
294 |
-
def on_ws_connect(self, ws):
|
295 |
-
self.ws_connected = True
|
296 |
-
|
297 |
-
def on_ws_close(self, ws, close_status_code, close_message):
|
298 |
-
self.ws_connected = False
|
299 |
-
logger.warn(f"Websocket closed with status {close_status_code}: {close_message}")
|
300 |
-
|
301 |
-
def on_ws_error(self, ws, error):
|
302 |
-
self.disconnect_ws()
|
303 |
-
self.connect_ws()
|
304 |
-
|
305 |
-
def on_message(self, ws, msg):
|
306 |
-
try:
|
307 |
-
data = json.loads(msg)
|
308 |
-
|
309 |
-
if not "messages" in data:
|
310 |
-
return
|
311 |
-
|
312 |
-
for message_str in data["messages"]:
|
313 |
-
message_data = json.loads(message_str)
|
314 |
-
if message_data["message_type"] != "subscriptionUpdate":
|
315 |
-
continue
|
316 |
-
message = message_data["payload"]["data"]["messageAdded"]
|
317 |
-
|
318 |
-
copied_dict = self.active_messages.copy()
|
319 |
-
for key, value in copied_dict.items():
|
320 |
-
# add the message to the appropriate queue
|
321 |
-
if value == message["messageId"] and key in self.message_queues:
|
322 |
-
self.message_queues[key].put(message)
|
323 |
-
return
|
324 |
-
|
325 |
-
# indicate that the response id is tied to the human message id
|
326 |
-
elif key != "pending" and value is None and message["state"] != "complete":
|
327 |
-
self.active_messages[key] = message["messageId"]
|
328 |
-
self.message_queues[key].put(message)
|
329 |
-
return
|
330 |
-
|
331 |
-
except Exception:
|
332 |
-
logger.error(traceback.format_exc())
|
333 |
-
self.disconnect_ws()
|
334 |
-
self.connect_ws()
|
335 |
-
|
336 |
-
def send_message(self, chatbot, message, with_chat_break=False, timeout=20):
|
337 |
-
# if there is another active message, wait until it has finished sending
|
338 |
-
while None in self.active_messages.values():
|
339 |
-
time.sleep(0.01)
|
340 |
-
|
341 |
-
# None indicates that a message is still in progress
|
342 |
-
self.active_messages["pending"] = None
|
343 |
-
|
344 |
-
logger.info(f"Sending message to {chatbot}: {message}")
|
345 |
-
|
346 |
-
# reconnect websocket
|
347 |
-
if not self.ws_connected:
|
348 |
-
self.disconnect_ws()
|
349 |
-
self.setup_connection()
|
350 |
-
self.connect_ws()
|
351 |
-
|
352 |
-
message_data = self.send_query(
|
353 |
-
"SendMessageMutation",
|
354 |
-
{
|
355 |
-
"bot": chatbot,
|
356 |
-
"query": message,
|
357 |
-
"chatId": self.bots[chatbot]["chatId"],
|
358 |
-
"source": None,
|
359 |
-
"withChatBreak": with_chat_break,
|
360 |
-
},
|
361 |
-
)
|
362 |
-
del self.active_messages["pending"]
|
363 |
-
|
364 |
-
if not message_data["data"]["messageEdgeCreate"]["message"]:
|
365 |
-
raise RuntimeError(f"Daily limit reached for {chatbot}.")
|
366 |
-
try:
|
367 |
-
human_message = message_data["data"]["messageEdgeCreate"]["message"]
|
368 |
-
human_message_id = human_message["node"]["messageId"]
|
369 |
-
except TypeError:
|
370 |
-
raise RuntimeError(f"An unknown error occurred. Raw response data: {message_data}")
|
371 |
-
|
372 |
-
# indicate that the current message is waiting for a response
|
373 |
-
self.active_messages[human_message_id] = None
|
374 |
-
self.message_queues[human_message_id] = queue.Queue()
|
375 |
-
|
376 |
-
last_text = ""
|
377 |
-
message_id = None
|
378 |
-
while True:
|
379 |
-
try:
|
380 |
-
message = self.message_queues[human_message_id].get(timeout=timeout)
|
381 |
-
except queue.Empty:
|
382 |
-
del self.active_messages[human_message_id]
|
383 |
-
del self.message_queues[human_message_id]
|
384 |
-
raise RuntimeError("Response timed out.")
|
385 |
-
|
386 |
-
# only break when the message is marked as complete
|
387 |
-
if message["state"] == "complete":
|
388 |
-
if last_text and message["messageId"] == message_id:
|
389 |
-
break
|
390 |
-
else:
|
391 |
-
continue
|
392 |
-
|
393 |
-
# update info about response
|
394 |
-
message["text_new"] = message["text"][len(last_text) :]
|
395 |
-
last_text = message["text"]
|
396 |
-
message_id = message["messageId"]
|
397 |
-
|
398 |
-
yield message
|
399 |
-
|
400 |
-
del self.active_messages[human_message_id]
|
401 |
-
del self.message_queues[human_message_id]
|
402 |
-
|
403 |
-
def send_chat_break(self, chatbot):
|
404 |
-
logger.info(f"Sending chat break to {chatbot}")
|
405 |
-
result = self.send_query("AddMessageBreakMutation", {"chatId": self.bots[chatbot]["chatId"]})
|
406 |
-
return result["data"]["messageBreakCreate"]["message"]
|
407 |
-
|
408 |
-
def get_message_history(self, chatbot, count=25, cursor=None):
|
409 |
-
logger.info(f"Downloading {count} messages from {chatbot}")
|
410 |
-
|
411 |
-
messages = []
|
412 |
-
if cursor is None:
|
413 |
-
chat_data = self.get_bot(self.bot_names[chatbot])
|
414 |
-
if not chat_data["messagesConnection"]["edges"]:
|
415 |
-
return []
|
416 |
-
messages = chat_data["messagesConnection"]["edges"][:count]
|
417 |
-
cursor = chat_data["messagesConnection"]["pageInfo"]["startCursor"]
|
418 |
-
count -= len(messages)
|
419 |
-
|
420 |
-
cursor = str(cursor)
|
421 |
-
if count > 50:
|
422 |
-
messages = self.get_message_history(chatbot, count=50, cursor=cursor) + messages
|
423 |
-
while count > 0:
|
424 |
-
count -= 50
|
425 |
-
new_cursor = messages[0]["cursor"]
|
426 |
-
new_messages = self.get_message_history(chatbot, min(50, count), cursor=new_cursor)
|
427 |
-
messages = new_messages + messages
|
428 |
-
return messages
|
429 |
-
elif count <= 0:
|
430 |
-
return messages
|
431 |
-
|
432 |
-
result = self.send_query(
|
433 |
-
"ChatListPaginationQuery",
|
434 |
-
{"count": count, "cursor": cursor, "id": self.bots[chatbot]["id"]},
|
435 |
-
)
|
436 |
-
query_messages = result["data"]["node"]["messagesConnection"]["edges"]
|
437 |
-
messages = query_messages + messages
|
438 |
-
return messages
|
439 |
-
|
440 |
-
def delete_message(self, message_ids):
|
441 |
-
logger.info(f"Deleting messages: {message_ids}")
|
442 |
-
if not type(message_ids) is list:
|
443 |
-
message_ids = [int(message_ids)]
|
444 |
-
|
445 |
-
result = self.send_query("DeleteMessageMutation", {"messageIds": message_ids})
|
446 |
-
|
447 |
-
def purge_conversation(self, chatbot, count=-1):
|
448 |
-
logger.info(f"Purging messages from {chatbot}")
|
449 |
-
last_messages = self.get_message_history(chatbot, count=50)[::-1]
|
450 |
-
while last_messages:
|
451 |
-
message_ids = []
|
452 |
-
for message in last_messages:
|
453 |
-
if count == 0:
|
454 |
-
break
|
455 |
-
count -= 1
|
456 |
-
message_ids.append(message["node"]["messageId"])
|
457 |
-
|
458 |
-
self.delete_message(message_ids)
|
459 |
-
|
460 |
-
if count == 0:
|
461 |
-
return
|
462 |
-
last_messages = self.get_message_history(chatbot, count=50)[::-1]
|
463 |
-
logger.info(f"No more messages left to delete.")
|
464 |
-
|
465 |
-
def create_bot(
|
466 |
-
self,
|
467 |
-
handle,
|
468 |
-
prompt="",
|
469 |
-
base_model="chinchilla",
|
470 |
-
description="",
|
471 |
-
intro_message="",
|
472 |
-
api_key=None,
|
473 |
-
api_bot=False,
|
474 |
-
api_url=None,
|
475 |
-
prompt_public=True,
|
476 |
-
pfp_url=None,
|
477 |
-
linkification=False,
|
478 |
-
markdown_rendering=True,
|
479 |
-
suggested_replies=False,
|
480 |
-
private=False,
|
481 |
-
):
|
482 |
-
result = self.send_query(
|
483 |
-
"PoeBotCreateMutation",
|
484 |
-
{
|
485 |
-
"model": base_model,
|
486 |
-
"handle": handle,
|
487 |
-
"prompt": prompt,
|
488 |
-
"isPromptPublic": prompt_public,
|
489 |
-
"introduction": intro_message,
|
490 |
-
"description": description,
|
491 |
-
"profilePictureUrl": pfp_url,
|
492 |
-
"apiUrl": api_url,
|
493 |
-
"apiKey": api_key,
|
494 |
-
"isApiBot": api_bot,
|
495 |
-
"hasLinkification": linkification,
|
496 |
-
"hasMarkdownRendering": markdown_rendering,
|
497 |
-
"hasSuggestedReplies": suggested_replies,
|
498 |
-
"isPrivateBot": private,
|
499 |
-
},
|
500 |
-
)
|
501 |
-
|
502 |
-
data = result["data"]["poeBotCreate"]
|
503 |
-
if data["status"] != "success":
|
504 |
-
raise RuntimeError(f"Poe returned an error while trying to create a bot: {data['status']}")
|
505 |
-
self.get_bots()
|
506 |
-
return data
|
507 |
-
|
508 |
-
def edit_bot(
|
509 |
-
self,
|
510 |
-
bot_id,
|
511 |
-
handle,
|
512 |
-
prompt="",
|
513 |
-
base_model="chinchilla",
|
514 |
-
description="",
|
515 |
-
intro_message="",
|
516 |
-
api_key=None,
|
517 |
-
api_url=None,
|
518 |
-
private=False,
|
519 |
-
prompt_public=True,
|
520 |
-
pfp_url=None,
|
521 |
-
linkification=False,
|
522 |
-
markdown_rendering=True,
|
523 |
-
suggested_replies=False,
|
524 |
-
):
|
525 |
-
result = self.send_query(
|
526 |
-
"PoeBotEditMutation",
|
527 |
-
{
|
528 |
-
"baseBot": base_model,
|
529 |
-
"botId": bot_id,
|
530 |
-
"handle": handle,
|
531 |
-
"prompt": prompt,
|
532 |
-
"isPromptPublic": prompt_public,
|
533 |
-
"introduction": intro_message,
|
534 |
-
"description": description,
|
535 |
-
"profilePictureUrl": pfp_url,
|
536 |
-
"apiUrl": api_url,
|
537 |
-
"apiKey": api_key,
|
538 |
-
"hasLinkification": linkification,
|
539 |
-
"hasMarkdownRendering": markdown_rendering,
|
540 |
-
"hasSuggestedReplies": suggested_replies,
|
541 |
-
"isPrivateBot": private,
|
542 |
-
},
|
543 |
-
)
|
544 |
-
|
545 |
-
data = result["data"]["poeBotEdit"]
|
546 |
-
if data["status"] != "success":
|
547 |
-
raise RuntimeError(f"Poe returned an error while trying to edit a bot: {data['status']}")
|
548 |
-
self.get_bots()
|
549 |
-
return data
|
550 |
-
|
551 |
-
def delete_account(self) -> None:
|
552 |
-
response = self.send_query('SettingsDeleteAccountButton_deleteAccountMutation_Mutation', {})
|
553 |
-
data = response['data']['deleteAccount']
|
554 |
-
if 'viewer' not in data:
|
555 |
-
raise RuntimeError(f'Error occurred while deleting the account, Please try again!')
|
556 |
-
|
557 |
-
|
558 |
-
load_queries()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/1acneusushi/gradio-2dmoleculeeditor/data/Bandicam free email and serial number How to update your Bandicam version and check the license information.md
DELETED
@@ -1,123 +0,0 @@
|
|
1 |
-
<br />
|
2 |
-
<h1>Bandicam Serial Key and Email 2022 [Full Version]</h1>
|
3 |
-
<p>Are you looking for a screen recording software that can help you capture your computer or laptop screen in high definition easily? If yes, then you might have heard of Bandicam, one of the best and an all-in-one screen recording software that can record anything on your screen. Whether you are a YouTuber, gamer, tutor, or just want to record your screen for personal use, Bandicam can be your perfect choice. But there is a catch: Bandicam is not a free software. You need to pay $39.95 for a single license or $59.95 for a two-PC license to use its full features. That's why many people are looking for ways to get Bandicam serial key and email for free.</p>
|
4 |
-
<p>In this article, we will show you what Bandicam is, what features and benefits it offers, and how you can get Bandicam serial key and email for free in 2022. We will also show you how to register Bandicam with serial key and email and enjoy the full version without any limitations. So, without further ado, let's get started.</p>
|
5 |
-
<h2>bandicamfreeemailandserialnumber</h2><br /><p><b><b>Download File</b> 🆓 <a href="https://byltly.com/2uKym6">https://byltly.com/2uKym6</a></b></p><br /><br />
|
6 |
-
<h2>What is Bandicam?</h2>
|
7 |
-
<p>Bandicam is a screen recording software that allows you to record anything on your computer screen in high quality. You can record your gameplay, webcam, desktop, online video, audio, or any other activity on your screen with ease. Bandicam has three modes of recording: Screen Recording Mode (SRM), Game Recording Mode (GRM), and Device Recording Mode (DRM). Each mode has its own features and settings that you can customize according to your needs.</p>
|
8 |
-
<h3>Features of Bandicam</h3>
|
9 |
-
<p>Bandicam has many features that make it stand out from other screen recording software. Some of the main features are:</p>
|
10 |
-
<ul>
|
11 |
-
<li>You can record your screen in up to 4K UHD resolution at 120 FPS.</li>
|
12 |
-
<li>You can compress your video file size without losing quality.</li>
|
13 |
-
<li>You can add a logo watermark, mouse effects, webcam overlay, voiceover, annotations, and more to your videos.</li>
|
14 |
-
<li>You can take screenshots in real-time recording by outlining the screen.</li>
|
15 |
-
<li>You can record videos from external devices like webcam, Xbox, PlayStation, smartphone, etc.</li>
|
16 |
-
<li>You can edit your videos with basic functions like cut, split, join, etc.</li>
|
17 |
-
<li>You can upload your videos directly to YouTube, Vimeo, or FTP server.</li>
|
18 |
-
</ul>
|
19 |
-
<h3>Benefits of Bandicam</h3>
|
20 |
-
<p>Bandicam has many benefits that make it worth using. Some of the main benefits are:</p>
|
21 |
-
<ul>
|
22 |
-
<li>You can record your screen with high quality and performance.</li>
|
23 |
-
<li>You can save your disk space and bandwidth by compressing your video files.</li>
|
24 |
-
<li>You can protect your videos from being stolen by adding a logo watermark.</li>
|
25 |
-
<li>You can enhance your videos with various effects and features.</li>
|
26 |
-
<li>You can record videos from multiple sources and devices.</li>
|
27 |
-
<li>You can edit your videos with ease and convenience.</li>
|
28 |
-
<li>You can share your videos with the world with one click.</li>
|
29 |
-
</ul>
|
30 |
-
<h2>How to get Bandicam Serial Key and Email for free?</h2>
|
31 |
-
<p>As we mentioned earlier, Bandicam is not a free software. You need to pay for it to use its full features. However, there are some ways that you can try to get Bandicam serial key and email for free in 2022. We will show you three methods that you can use to get Bandicam serial key and email for free. However, we do not guarantee that these methods will work for everyone or forever. So, use them at your own risk.</p>
|
32 |
-
<h3>Method 1: Use a cracked version</h3>
|
33 |
-
<p>A cracked version is a modified version of the original software that bypasses the registration process and allows you to use the full features without paying anything. There are many websites that offer cracked versions of Bandicam for free download. However, these websites are not safe or legal. They may contain viruses, malware, spyware, or other harmful programs that can damage your computer or steal your personal information. Moreover, using a cracked version is unethical and illegal. You may face legal issues or penalties if you are caught using a cracked version of Bandicam.</p>
|
34 |
-
<p>If you still want to use this method, here are the steps that you need to follow:</p>
|
35 |
-
<ol>
|
36 |
-
<li>Search for a cracked version of Bandicam on Google or any other search engine.</li>
|
37 |
-
<li>Choose a website that offers a cracked version of Bandicam for free download.</li>
|
38 |
-
<li>Download the cracked version of Bandicam from the website.</li>
|
39 |
-
<li>Extract the downloaded file using WinRAR or any other extraction tool.</li>
|
40 |
-
<li>Run the setup file and install the cracked version of Bandicam on your computer.</li>
|
41 |
-
<li>Launch the cracked version of Bandicam and enjoy the full features without registration.</li>
|
42 |
-
</ol>
|
43 |
-
<h3>Method 2: Use a key generator</h3>
|
44 |
-
<p>A key generator is a software that generates random serial keys and emails for various software. You can use a key generator to generate a serial key and email for Bandicam for free. However, this method is also not safe or legal. A key generator may also contain viruses, malware, spyware, or other harmful programs that can damage your computer or steal your personal information. Moreover, using a key generator is unethical and illegal. You may face legal issues or penalties if you are caught using a key generator for Bandicam.</p>
|
45 |
-
<p>bandicam email and serial number free download<br />
|
46 |
-
how to get bandicam for free with email and serial<br />
|
47 |
-
bandicam free license key email and serial number<br />
|
48 |
-
bandicam crack email and serial number free<br />
|
49 |
-
bandicam full version free email and serial number<br />
|
50 |
-
bandicam registration email and serial number free 2023<br />
|
51 |
-
bandicam email and serial number generator free<br />
|
52 |
-
bandicam free activation email and serial number<br />
|
53 |
-
bandicam email and serial number list free<br />
|
54 |
-
bandicam free trial email and serial number<br />
|
55 |
-
bandicam no watermark free email and serial number<br />
|
56 |
-
bandicam email and serial number reddit free<br />
|
57 |
-
bandicam email and serial number 2023 free<br />
|
58 |
-
bandicam email and serial number 2022 free<br />
|
59 |
-
bandicam email and serial number 2021 free<br />
|
60 |
-
bandicam email and serial number 2020 free<br />
|
61 |
-
bandicam email and serial number 2019 free<br />
|
62 |
-
bandicam email and serial number 2018 free<br />
|
63 |
-
bandicam email and serial number 2017 free<br />
|
64 |
-
bandicam email and serial number 2016 free<br />
|
65 |
-
bandicam email and serial number 2015 free<br />
|
66 |
-
bandicam email and serial number 2014 free<br />
|
67 |
-
bandicam email and serial number 2013 free<br />
|
68 |
-
bandicam email and serial number 2012 free<br />
|
69 |
-
bandicam email and serial number 2011 free<br />
|
70 |
-
bandicam pro free email and serial number<br />
|
71 |
-
bandicam premium free email and serial number<br />
|
72 |
-
bandicam unlimited free email and serial number<br />
|
73 |
-
bandicam lifetime free email and serial number<br />
|
74 |
-
bandicam latest version free email and serial number<br />
|
75 |
-
bandicam updated version free email and serial number<br />
|
76 |
-
bandicam new version free email and serial number<br />
|
77 |
-
bandicam old version free email and serial number<br />
|
78 |
-
bandicam portable version free email and serial number<br />
|
79 |
-
bandicam online version free email and serial number<br />
|
80 |
-
bandicam offline version free email and serial number<br />
|
81 |
-
bandicam screen recorder free email and serial number<br />
|
82 |
-
bandicam video editor free email and serial number<br />
|
83 |
-
bandicam game recorder free email and serial number<br />
|
84 |
-
bandicam webcam recorder free email and serial number<br />
|
85 |
-
bandicam audio recorder free email and serial number<br />
|
86 |
-
bandicam voice recorder free email and serial number<br />
|
87 |
-
bandicam streaming recorder free email and serial number<br />
|
88 |
-
bandicam youtube recorder free email and serial number<br />
|
89 |
-
how to use bandicam for free with email and serial number <br />
|
90 |
-
how to install bandicam for free with email and serial number <br />
|
91 |
-
how to uninstall bandicam for free with email and serial number <br />
|
92 |
-
how to update bandicam for free with email and serial number <br />
|
93 |
-
how to register bandicam for free with email and serial number <br />
|
94 |
-
how to activate bandicam for free with email and serial number</p>
|
95 |
-
<p>If you still want to use this method, here are the steps that you need to follow:</p>
|
96 |
-
<ol>
|
97 |
-
<li>Search for a key generator for Bandicam on Google or any other search engine.</li>
|
98 |
-
<li>Choose a website that offers a key generator for Bandicam for free download.</li>
|
99 |
-
<li>Download the key generator for Bandicam from the website.</li>
|
100 |
-
<li>Extract the downloaded file using WinRAR or any other extraction tool.</li>
|
101 |
-
<li>Run the key generator for Bandicam on your computer.</li>
|
102 |
-
<li>Select the product name as "Bandicam" and click on the generate button.</li>
|
103 |
-
<li>Copy the generated serial key and email from the key generator.</li>
|
104 |
-
</ol>
|
105 |
-
<h3>Method 3: Use a giveaway site</h3>
|
106 |
-
<p>A giveaway site is a website that offers free licenses or serial keys for various software as a promotion or reward. You can use a giveaway site to get a serial key and email for Bandicam for free legally. However, this method is not easy or reliable. A giveaway site may have limited licenses or serial keys available for Bandicam. You may need to complete some tasks or surveys to get a serial key and email for Bandicam from a giveaway site. Moreover, using a giveaway site is not guaranteed to work for everyone or forever. You may not get a valid serial key and email for Bandicam from a giveaway site.</p>
|
107 |
-
<p>If you still want to use this method, here are the steps that you need to follow:</p>
|
108 |
-
<ol>
|
109 |
-
<li>Search for a giveaway site that offers serial keys or licenses for Bandicam on Google or any other search engine.</li>
|
110 |
-
<li>Choose a giveaway site that offers serial keys or licenses for Bandicam for free legally.</li>
|
111 |
-
<li>Visit the giveaway site and follow the instructions to get a serial key and email for Bandicam from the giveaway site.</li>
|
112 |
-
<li>You may need to complete some tasks or surveys to get a serial key and email for Bandicam from the giveaway site.</li>
|
113 |
-
<li>Copy the serial key and email from the giveaway site once you get them.</li>
|
114 |
-
</ol>
|
115 |
-
<h2>How to register Bandicam with Serial Key and Email?</h2>
|
116 |
-
<li><b>Q: How can I transfer my license for Bandicam to another computer?</b></li>
|
117 |
-
<li>A: If you want to transfer your license for Bandicam to another computer, you need to unregister Bandicam from the old computer and register it on the new computer. To unregister Bandicam, open the "Update Registration" menu and click on the "Unregister" button. To register Bandicam on the new computer, follow the steps that we have shown above.</li>
|
118 |
-
<li><b>Q: How can I contact the support team of Bandicam?</b></li>
|
119 |
-
<li>A: If you have any questions or issues regarding Bandicam, you can contact the support team of Bandicam by sending an email to [email protected]. You can also visit the official website of Bandicam: https://www.bandicam.com/ and check the FAQs, tutorials, forums, and blog sections for more information and help.</li>
|
120 |
-
</ol>
|
121 |
-
</p> 0a6ba089eb<br />
|
122 |
-
<br />
|
123 |
-
<br />
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/1gistliPinn/ChatGPT4/Examples/Adjprog Cracked.exe.md
DELETED
@@ -1,6 +0,0 @@
|
|
1 |
-
<h2>Adjprog cracked.exe</h2><br /><p><b><b>Download</b> »»» <a href="https://imgfil.com/2uy1BZ">https://imgfil.com/2uy1BZ</a></b></p><br /><br />
|
2 |
-
|
3 |
-
Exe resetter epson l210 adjprog cracked exe epson resetter blog epson resetter blogspot how to buy resetter for epson epson​. Epson adjustment program ... 4d29de3e1b<br />
|
4 |
-
<br />
|
5 |
-
<br />
|
6 |
-
<p></p>
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/1gistliPinn/ChatGPT4/Examples/Code Geass Lust Terrorist.md
DELETED
@@ -1,13 +0,0 @@
|
|
1 |
-
|
2 |
-
<h1>Code Geass Lust Terrorist: A Fanfiction Review</h1>
|
3 |
-
<p>If you are a fan of Code Geass, the anime series that features a world of mecha, magic and political intrigue, you might have come across some fanfiction stories that explore the characters and scenarios in different ways. One of the most popular and controversial fanfictions is Code Geass Lust Terrorist, written by <a href="https://www.fanfiction.net/u/1234567/Lust-Terrorist">Lust Terrorist</a>, a mysterious author who claims to be a former member of the Britannian royal family.</p>
|
4 |
-
<p>Code Geass Lust Terrorist is a dark and twisted story that follows Lelouch vi Britannia, the exiled prince who becomes the leader of a rebel group called the Black Knights, as he tries to overthrow his father, the Emperor of Britannia. However, unlike the original anime, where Lelouch has a noble goal of creating a better world for his sister Nunnally and his friends, in this fanfiction Lelouch is driven by lust and revenge. He uses his power of Geass, which allows him to command anyone to obey him, to manipulate and abuse everyone around him, especially women. He also has a secret alliance with C.C., the immortal witch who gave him Geass, who shares his twisted desires and helps him in his schemes.</p>
|
5 |
-
<h2>Code Geass Lust Terrorist</h2><br /><p><b><b>DOWNLOAD</b> ✪ <a href="https://imgfil.com/2uy0yC">https://imgfil.com/2uy0yC</a></b></p><br /><br />
|
6 |
-
<p>The fanfiction is notorious for its graphic and explicit scenes of violence, sex and torture, as well as its deviation from the canon plot and characterization. Many fans have criticized it for being unrealistic, offensive and disrespectful to the original creators and characters. However, some fans have praised it for being creative, daring and captivating, as well as for its plot twists and surprises. The fanfiction has over 100 chapters and more than 1 million views on <a href="https://www.fanfiction.net/s/9876543/1/Code-Geass-Lust-Terrorist">Fanfiction.net</a>, making it one of the most read and reviewed stories in the Code Geass fandom.</p>
|
7 |
-
<p>In this article, we will review Code Geass Lust Terrorist and analyze its strengths and weaknesses. We will also discuss some of the themes and controversies that it raises, such as morality, power, gender and identity. We will also compare it to the original anime and other fanfictions in the same genre. Whether you love it or hate it, Code Geass Lust Terrorist is a fanfiction that will make you think and feel.</p><h2>What is Code Geass Lust Terrorist about?</h2>
|
8 |
-
<p>The fanfiction is divided into several arcs, each focusing on a different aspect of Lelouch's plan and his relationships with various characters. The first arc, titled "Lust Terrorist", introduces the premise and the main characters. It shows how Lelouch kidnaps and rapes Kallen, a member of the Japanese resistance group, and forces her to become his personal slave. He also reveals his identity as Zero, the leader of the Black Knights, and his Geass power to her. He then uses her as a pawn to infiltrate the resistance and gain their trust. He also encounters C.C., who reveals that she is his lover from a previous timeline, where he failed to overthrow Britannia and died. She tells him that she has brought him back to life in this timeline, where he has a second chance to fulfill his wish. She also warns him that there are other people who have Geass powers, and that they are working for a mysterious organization called the Order of the Black Knights.</p>
|
9 |
-
<p>The second arc, titled "Lust Emperor", shows how Lelouch becomes the Emperor of Britannia after killing his father and his siblings. He also reveals his identity as Zero to the world, and declares war on all other nations. He uses his Geass power to control and enslave millions of people, including his former allies and enemies. He also makes C.C. his Empress, and Kallen his concubine. He also experiments with different types of Geass, such as mind control, memory manipulation, and body modification. He also faces opposition from various factions, such as the Chinese Federation, the European Union, and the remnants of the Black Knights.</p>
|
10 |
-
<p>The third arc, titled "Lust God", shows how Lelouch achieves his ultimate goal of becoming a god. He uses his Geass power to merge with the World of C, the collective unconsciousness of all living beings. He also absorbs C.C., Kallen, and other people who have Geass powers into himself. He then creates a new world according to his own will, where he rules as an omnipotent and omniscient being. He also erases the memories and personalities of everyone else, making them into mindless slaves who worship him. He also faces challenges from some people who resist his influence, such as Suzaku, Nunnally, Jeremiah, and Schneizel.</p>
|
11 |
-
<p></p> d5da3c52bf<br />
|
12 |
-
<br />
|
13 |
-
<br />
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/1gistliPinn/ChatGPT4/Examples/Download !FREE! Visual Basic 5.0 Setup Toolkit.md
DELETED
@@ -1,6 +0,0 @@
|
|
1 |
-
<h2>download visual basic 5.0 setup toolkit</h2><br /><p><b><b>Download</b> ✶✶✶ <a href="https://imgfil.com/2uxX8U">https://imgfil.com/2uxX8U</a></b></p><br /><br />
|
2 |
-
|
3 |
-
DEVELOPMENT TOOLS icrosoft Visual Basic 5.0 is Mclearly the most ... setup .exe, the setup toolkit lets you make a Web page that automates the download of ... 1fdad05405<br />
|
4 |
-
<br />
|
5 |
-
<br />
|
6 |
-
<p></p>
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/1gistliPinn/ChatGPT4/Examples/FSX Wilco Evolution vol 2 fix Crack Fly the A330 A340 and More with this Amazing Addon.md
DELETED
@@ -1,27 +0,0 @@
|
|
1 |
-
|
2 |
-
<p>Bell's already popular 407 is the long awaited successor to its JetRanger and LongRanger light singles. Development work on Bell's New Light Aircraft replacement for the LongRanger and JetRanger dates back to 1993. The end result was the 407, an evolutionary development of the LongRanger.</p>
|
3 |
-
<h2>FSX Wilco Evolution vol 2 fix Crack</h2><br /><p><b><b>Download Zip</b> ✶ <a href="https://imgfil.com/2uxY3h">https://imgfil.com/2uxY3h</a></b></p><br /><br />
|
4 |
-
<p>The hugely significant 747 revolutionised airline transport. Far bigger than anything before it, the 747 slashed operating costs per seat and thus cut the cost of long haul international airline travel.</p>
|
5 |
-
<p>AnyMP4 also supports a wide range of file formats and profiles for video and audio combinations.<br />It is easy to install, transfers any DVD to DVD-5, VOB to DVD-5 and DVD-9 with 4K Video recording, and supports 4K video Converting to the most famous formats;it is compatible with the most popular DVD players;and also supports the most advanced functions for 4K video:mapping, crop, rotating, -crack-with-serial-key-free-download-latest-2022/<br /> 50e0806aeb casdar</p>
|
6 |
-
<p>It is available for download for free and each set consists of over 500 pixel perfect, high quality, high contrast images.<br />Unleash your creativity with these final icons<br />All the sets feature a matching color for each different folder and they can be used to present your applications in a more appealing way. From an icon based application like F.lux to a music and media player like Spotify, everything will fit.<br />Icons have become ubiquitous for many tasks in everyday life. Here, you will -text-library-for-small-basic-crack-activator-download-win-mac-latest-2022/<br /> 50e0806aeb marjan</p>
|
7 |
-
<p>History<br />The initial idea for Visual Editor for Eclipse comes from the first version of Javemate 0.6 which was a standalone application for building Swing/AWT user interfaces which also give WYSIWYG support. I thought it should be possible to bring some of the mechanisms used in Javemate 0.6 and include them in Eclipse. While I was creating a prototype I learned from Javemate users that it was really hard to create useful User Interface, so I -routeros-license-crack-upd-software/<br /> ec5d62056f ellafra</p>
|
8 |
-
<p>Note, that you can select more than one file at once using Shift-Multiple-Select menu, and all it will be, that translation will be updated.<br />After translation file will be saved in default folder for translating files, if you want to save a file inside specific folder you can do with simple right click menu > Save In..<br />For detailed info about features please see :<br />Hot Apps Posted in Google-Apps-For-Desktop:<br />4 / user ratings<br />Translate file -crack/<br /> 50e0806aeb alebrad</p>
|
9 |
-
<p></p>
|
10 |
-
<p>Metaverse 24 is the largest multi-platform metaverse video provider. They stream live and archival video from the Metaverse 24 source network of over 20 live streams at any one time and over 1300 archived video hours. Their range of videos are all viewable in a variety of different virtual worlds but also on the web! Metaverse 24 provides standard views of its video for non-mover (non-mobile) users as well as for settlers, denizens and visitors in Metaverse -activex-control-crack-keygen-full-version/<br /> 50e0806aeb jaidcher</p>
|
11 |
-
<p>CTR Booster is a revolutionary program designed to help you do exactly that. It uses patented technology to identify and correct the flaws in your website that are keeping visitors from engaging and converting.<br />Not only will this program quickly increase your click-through rate, but it also ensures that your website and marketing efforts are up to date with the latest trends and best practices. This means that you will be able to<br />maximize your reach and increase your sales-all from the comfort of your own device.</p>
|
12 |
-
<p>birwhy 19191a764c<br /> -581-crack-registration-code-free-download-2020<br />[ -581-crack-registration-code-free-download-2020]<br />[ -581-crack-registration-code-free-download-2020]<br />[ -581-crack-registration-code-free-download-2020]<br />link= -581-crack-registration-code-free-download-2020<br />link= -581-crack-registration-code-free-download-2020<br />link= -581-crack-registration-code-free-download-2020</p>
|
13 |
-
<p>makanik 19191a764c<br /> -bundrick/splinter-cell-blacklist-deluxe-edition-3dm-crack<br />[ -bundrick/splinter-cell-blacklist-deluxe-edition-3dm-crack ]<br />[ -bundrick/splinter-cell-blacklist-deluxe-edition-3dm-crack ]<br />[ -bundrick/splinter-cell-blacklist-deluxe-edition-3dm-crack ]<br />link= -bundrick/splinter-cell-blacklist-deluxe-edition-3dm-crack<br />link= -bundrick/splinter-cell-blacklist-deluxe-edition-3dm-crack<br />link= -bundrick/splinter-cell-blacklist-deluxe-edition-3dm-crack</p>
|
14 |
-
<p>waivlad 19191a764c<br /> -5-crack-with-activation-number-full-here-free-download<br />[ -5-crack-with-activation-number-full-here-free-download ]<br />[ -5-crack-with-activation-number-full-here-free-download ]<br />[ -5-crack-with-activation-number-full-here-free-download ]<br />link= -5-crack-with-activation-number-full-here-free-download<br />link= -5-crack-with-activation-number-full-here-free-download<br />link= -5-crack-with-activation-number-full-here-free-download</p>
|
15 |
-
<p>chrinatt 19191a764c<br /> -truel/silvaco-tcad-license-crack-software<br />[ -truel/silvaco-tcad-license-crack-software ]<br />[ -truel/silvaco-tcad-license-crack-software ]<br />[ -truel/silvaco-tcad-license-crack-software ]<br />link= -truel/silvaco-tcad-license-crack-software<br />link= -truel/silvaco-tcad-license-crack-software<br />link= -truel/silvaco-tcad-license-crack-software</p>
|
16 |
-
<p>aisldann 19191a764c<br /> -modaris-full-cracked-automatic-install-setup-free<br />[ -modaris-full-cracked-automatic-install-setup-free ]<br />[ -modaris-full-cracked-automatic-install-setup-free ]<br />[ -modaris-full-cracked-automatic-install-setup-free ]<br />link= -modaris-full-cracked-automatic-install-setup-free<br />link= -modaris-full-cracked-automatic-install-setup-free<br />link= -modaris-full-cracked-automatic-install-setup-free</p>
|
17 |
-
<p>bertchan 19191a764c<br /> -3093-crack-2020-with-licence-key<br />[ -3093-crack-2020-with-licence-key ]<br />[ -3093-crack-2020-with-licence-key ]<br />[ -3093-crack-2020-with-licence-key ]<br />link= -3093-crack-2020-with-licence-key<br />link= -3093-crack-2020-with-licence-key<br />link= -3093-crack-2020-with-licence-key</p>
|
18 |
-
<p>salhenr 19191a764c<br /> -laser-v70-crack-geschenkidee-veranst<br />[ -laser-v70-crack-geschenkidee-veranst ]<br />[ -laser-v70-crack-geschenkidee-veranst ]<br />[ -laser-v70-crack-geschenkidee-veranst ]<br />link= -laser-v70-crack-geschenkidee-veranst<br />link= -laser-v70-crack-geschenkidee-veranst<br />link= -laser-v70-crack-geschenkidee-veranst</p>
|
19 |
-
<p>parwirr 19191a764c<br /> -dj-8-letest-crack-free-download<br />[ -dj-8-letest-crack-free-download ]<br />[ -dj-8-letest-crack-free-download ]<br />[ -dj-8-letest-crack-free-download ]<br />link= -dj-8-letest-crack-free-download<br />link= -dj-8-letest-crack-free-download<br />link= -dj-8-letest-crack-free-download</p>
|
20 |
-
<p>dashber 19191a764c<br /> -2010-crack-serial-keygentorrenthtml<br />[ -2010-crack-serial-keygentorrenthtml ]<br />[ -2010-crack-serial-keygentorrenthtml ]<br />[ -2010-crack-serial-keygentorrenthtml ]<br />link= -2010-crack-serial-keygentorrenthtml<br />link= -2010-crack-serial-keygentorrenthtml<br />link= -2010-crack-serial-keygentorrenthtml</p>
|
21 |
-
<p>skilyos 19191a764c<br /> -lab-2-3-cracked<br />[ -lab-2-3-cracked ]<br />[ -lab-2-3-cracked ]<br />[ -lab-2-3-cracked ]<br />link= -lab-2-3-cracked<br />link= -lab-2-3-cracked<br />link= -lab-2-3-cracked</p>
|
22 |
-
<p>chrijam 19191a764c<br /> -airbus-evolution-vol-2-crack<br />[ -airbus-evolution-vol-2-crack ]<br />[ -airbus-evolution-vol-2-crack ]<br />[ -airbus-evolution-vol-2-crack ]<br />link= -airbus-evolution-vol-2-crack<br />link= -airbus-evolution-vol-2-crack<br />link= -airbus-evolution-vol-2-crack</p>
|
23 |
-
<p>talijan 19191a764c<br /> -xenapp-65-license-file-crack<br />[ -xenapp-65-license-file-crack ]<br />[ -xenapp-65-license-file-crack ]<br />[ -xenapp-65-license-file-crack ]<br />link= -xenapp-65-license-file-crack<br />link= -xenapp-65-license-file-crack<br />link= -xenapp-65-license-file-crack</p>
|
24 |
-
<p>brigeng 19191a764c<br /> -2020-crack-full-version-keygen-free-download<br />[ -2020-crack-full-version-keygen-free-download ]<br />[ -2020-crack-full-version-keygen-free-download ]<br />[ -2020-crack-full-version-keygen-free-download ]<br />link= -2020-crack-full-version-keygen-free-download<br />link= -2020-crack-full-version-keygen-free-download<br />link= -2020-crack-full-version-keygen-free-download</p>
|
25 |
-
<p>tyanevan 19191a764c<br /> -max-76-crack-13<br />[ -max-76-crack-13 ]<br />[ -max-76-crack-13 ]<br />[ -max-76-crack-13 ]<br />link= -max-76-crack-13<br />link= -max-76-crack-13<br />link= -max-76-crack-13</p> aaccfb2cb3<br />
|
26 |
-
<br />
|
27 |
-
<br />
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/1gistliPinn/ChatGPT4/Examples/Film Impact Transitions Crack !!BETTER!! Macbook.md
DELETED
@@ -1,7 +0,0 @@
|
|
1 |
-
|
2 |
-
<p>When youre done editing, you can preview the effect in an instant. Use the drop zones that you created to fit your clip seamlessly. Adobe After Effects 23.1 Crack is a web application that uses the latest graphics cards to create real-time effects that are highly optimized to the latest GeForce, Radeon, and Nvidia graphics cards. So, if you want to make the most powerful video effects, you have a choice of tools. Its latest update is based on the new CUDA architecture for a record-breaking effect. We have helped professional editors all around the world. We have developed the best video effects transition and video editor. We produce amazing and customized transitions.</p>
|
3 |
-
<h2>Film Impact Transitions Crack Macbook</h2><br /><p><b><b>Download File</b> 🆓 <a href="https://imgfil.com/2uxYup">https://imgfil.com/2uxYup</a></b></p><br /><br />
|
4 |
-
<p>File and folder transitions are extremely popular. You can use video transition effects, such as dissolves, fades, wipes, fades, and other types of transitions to create amazing effects. All our transition packages are provided in HD video format for a smooth transition. After Effects CC 2017 Crack is designed to help you to create amazing movies. If you are looking for new and interesting ways to showcase your video skills, or if you simply want to improve your own. Film Impact transitions are well-suited for all sizes of productions. They can be used to transition from one video clip to another. You can load your transition effects into After Effects Pro CC.</p>
|
5 |
-
<p>With the help of a dedicated team, we are constantly working on making the best and fastest transitions. However, it becomes easy if you are working with a Mac. Add a bunch of transition effects and try the new ones. Create amazing digital video effects. Easily edit your video and add transitions. Fluid transitions as well as Aesop effects. Both have been enhanced with new features. You can also share your favorite transitions with friends and family through the cloud.</p> 899543212b<br />
|
6 |
-
<br />
|
7 |
-
<br />
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/1line/AutoGPT/autogpt/commands/times.py
DELETED
@@ -1,10 +0,0 @@
|
|
1 |
-
from datetime import datetime
|
2 |
-
|
3 |
-
|
4 |
-
def get_datetime() -> str:
|
5 |
-
"""Return the current date and time
|
6 |
-
|
7 |
-
Returns:
|
8 |
-
str: The current date and time
|
9 |
-
"""
|
10 |
-
return "Current date and time: " + datetime.now().strftime("%Y-%m-%d %H:%M:%S")
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/1pelhydcardo/ChatGPT-prompt-generator/Haseena-Dual-Audio-Hindi-Eng-720p.md
DELETED
@@ -1,68 +0,0 @@
|
|
1 |
-
## Haseena Dual Audio Hindi Eng 720p
|
2 |
-
|
3 |
-
|
4 |
-
|
5 |
-
|
6 |
-
|
7 |
-
|
8 |
-
|
9 |
-
|
10 |
-
|
11 |
-
**CLICK HERE >>> [https://lodystiri.blogspot.com/?file=2txPB6](https://lodystiri.blogspot.com/?file=2txPB6)**
|
12 |
-
|
13 |
-
|
14 |
-
|
15 |
-
|
16 |
-
|
17 |
-
|
18 |
-
|
19 |
-
|
20 |
-
|
21 |
-
|
22 |
-
|
23 |
-
|
24 |
-
|
25 |
-
# Haseena: A Thrilling Bollywood Movie with Dual Audio Option
|
26 |
-
|
27 |
-
|
28 |
-
|
29 |
-
Haseena is a 2018 Hindi crime drama film directed by Vicky Ranawat and starring Innayat Sharma, Arpit Soni, and Mohit Arora. The film follows the story of three friends who get involved in a drug deal that goes wrong and puts them in danger. Haseena is a thrilling movie that keeps the audience on the edge of their seats with its twists and turns.
|
30 |
-
|
31 |
-
|
32 |
-
|
33 |
-
One of the best features of Haseena is that it offers a dual audio option for the viewers who prefer to watch the movie in English or Hindi. The dual audio option allows the viewers to enjoy the movie in their preferred language without missing out on the dialogues and emotions of the characters. The dual audio option also makes the movie more accessible to a wider audience across the world.
|
34 |
-
|
35 |
-
|
36 |
-
|
37 |
-
Haseena is available for download in 720p quality from various online platforms such as HDHub4u[^1^], Kickass Torrent[^2^], and SoundCloud[^3^]. The 720p quality ensures that the viewers get a clear and crisp picture of the movie without compromising on the storage space. The 720p quality also enhances the viewing experience by providing a high-definition sound and video.
|
38 |
-
|
39 |
-
|
40 |
-
|
41 |
-
If you are looking for a Bollywood movie that offers a dual audio option, a 720p quality, and a gripping story, then Haseena is the perfect choice for you. Download Haseena today and enjoy a thrilling ride with your friends and family.
|
42 |
-
|
43 |
-
|
44 |
-
|
45 |
-
Haseena is not just a crime drama, but also a biographical film that depicts the life of Haseena Parkar, the sister of notorious gangster Dawood Ibrahim. The film shows how Haseena rose from being a simple housewife to becoming the "Queen of Mumbai" after her husband's murder and her brother's exile. The film also explores the relationship between Haseena and Dawood, and how they influenced each other's decisions and actions.
|
46 |
-
|
47 |
-
|
48 |
-
|
49 |
-
The film has received mixed reviews from critics and audiences alike. Some praised Shraddha Kapoor's performance and the film's attempt to portray a different side of Haseena Parkar, while others criticized the film's lack of depth, authenticity, and coherence. The film was also compared unfavorably to other gangster films such as Satya and Company, which had more realistic and engaging narratives.
|
50 |
-
|
51 |
-
|
52 |
-
|
53 |
-
Haseena is a film that tries to tell an intriguing story of a woman who defied the norms and expectations of her society and became a powerful figure in the underworld. However, the film fails to deliver on its promise and leaves the viewers unsatisfied and disappointed. Haseena is a film that could have been much better if it had focused more on the character development, the historical context, and the emotional impact of the events.
|
54 |
-
|
55 |
-
|
56 |
-
|
57 |
-
If you are still curious to watch Haseena and learn more about the life of Haseena Parkar, you can find the film on various online streaming platforms such as Netflix, Amazon Prime Video, and Zee5. You can also watch the trailer of the film on YouTube and decide for yourself if the film is worth your time and money.
|
58 |
-
|
59 |
-
|
60 |
-
|
61 |
-
Haseena is a film that had a lot of potential to be a gripping and captivating biopic of a woman who ruled the Mumbai underworld with an iron fist. However, the film falls short of its expectations and fails to impress the viewers with its weak script, poor direction, and inconsistent performances. Haseena is a film that you can skip without missing much.
|
62 |
-
|
63 |
-
dfd1c89656
|
64 |
-
|
65 |
-
|
66 |
-
|
67 |
-
|
68 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/1pelhydcardo/ChatGPT-prompt-generator/assets/Download Blockman Go Versi Terbaru A Free App with Diverse Gameplay Options and Features.md
DELETED
@@ -1,180 +0,0 @@
|
|
1 |
-
<br />
|
2 |
-
<h1>Download Blockman Go Versi Terbaru: A Guide to Enjoy the Ultimate Sandbox Game</h1>
|
3 |
-
<p>If you are looking for a fun and immersive game that offers a variety of gameplay options, you should try Blockman Go. Blockman Go is a free app that includes minigames, chatting, and making friends. You can play various block style minigames here, such as Bed Wars, Sky Block, Anime Fighting Simulator, and more. You can also create your own world, customize your avatar, and share your experiences with other players.</p>
|
4 |
-
<h2>download blockman go versi terbaru</h2><br /><p><b><b>Download Zip</b> ⏩ <a href="https://urlin.us/2uT1rT">https://urlin.us/2uT1rT</a></b></p><br /><br />
|
5 |
-
<p>But how can you download Blockman Go versi terbaru (the latest version) on your device? In this article, we will show you what Blockman Go is, why you should download the latest version, and how to do it easily and safely. Let's get started!</p>
|
6 |
-
<h2>What is Blockman Go?</h2>
|
7 |
-
<p>Blockman Go is a game that combines elements of sandbox, minigames, and social networking. It has three main features that make it stand out from other games:</p>
|
8 |
-
<h3>A free app with various block style minigames</h3>
|
9 |
-
<p>Blockman Go is completely free to play, but you can choose to make premium in-app purchases through your Play Store account. You can also earn gold cubes by playing games or watching ads, which you can use to buy items or VIP subscriptions.</p>
|
10 |
-
<p>The app has a huge collection of minigames that you can join or create. Some of the most popular ones are:</p>
|
11 |
-
<p>download blockman go versi terbaru apk<br />
|
12 |
-
download blockman go versi terbaru mod<br />
|
13 |
-
download blockman go versi terbaru 2023<br />
|
14 |
-
download blockman go versi terbaru gratis<br />
|
15 |
-
download blockman go versi terbaru offline<br />
|
16 |
-
download blockman go versi terbaru android<br />
|
17 |
-
download blockman go versi terbaru pc<br />
|
18 |
-
download blockman go versi terbaru update<br />
|
19 |
-
download blockman go versi terbaru full<br />
|
20 |
-
download blockman go versi terbaru hack<br />
|
21 |
-
download blockman go versi terbaru unlimited money<br />
|
22 |
-
download blockman go versi terbaru no ads<br />
|
23 |
-
download blockman go versi terbaru for windows 10<br />
|
24 |
-
download blockman go versi terbaru for ios<br />
|
25 |
-
download blockman go versi terbaru for mac<br />
|
26 |
-
download blockman go versi terbaru for laptop<br />
|
27 |
-
download blockman go versi terbaru for free fire<br />
|
28 |
-
download blockman go versi terbaru for minecraft<br />
|
29 |
-
download blockman go versi terbaru for roblox<br />
|
30 |
-
download blockman go versi terbaru for pubg mobile<br />
|
31 |
-
download blockman go versi terbaru bed wars<br />
|
32 |
-
download blockman go versi terbaru sky wars<br />
|
33 |
-
download blockman go versi terbaru egg wars<br />
|
34 |
-
download blockman go versi terbaru skyblock<br />
|
35 |
-
download blockman go versi terbaru anime fighting simulator<br />
|
36 |
-
download blockman go versi terbaru party street<br />
|
37 |
-
download blockman go versi terbaru frontline<br />
|
38 |
-
download blockman go versi terbaru free city rp<br />
|
39 |
-
download blockman go versi terbaru titan<br />
|
40 |
-
download blockman go versi terbaru anime all star<br />
|
41 |
-
download blockman go versi terbaru jail break<br />
|
42 |
-
download blockman go versi terbaru tnt tag<br />
|
43 |
-
download blockman go versi terbaru paradise island<br />
|
44 |
-
download blockman go versi terbaru ninja skyrim<br />
|
45 |
-
download blockman go versi terbaru realm city<br />
|
46 |
-
download blockman go versi terbaru road rash<br />
|
47 |
-
download blockman go versi terbaru cyberpunk<br />
|
48 |
-
download blockman go versi terbaru trainers arena<br />
|
49 |
-
download blockman go versi terbaru vice city<br />
|
50 |
-
download blockman go versi terbaru hero tycoon 2<br />
|
51 |
-
download blockman go versi terbaru aliens attack<br />
|
52 |
-
download blockman go versi terbaru horror 1vs4<br />
|
53 |
-
download blockman go versi terbaru lucky block skywars<br />
|
54 |
-
download blockman go versi terbaru wwe school simulator<br />
|
55 |
-
download blockman go versi terbaru build and shoot<br />
|
56 |
-
download blockman go versi terbaru aircraft frontier</p>
|
57 |
-
<ul>
|
58 |
-
<li><strong>Bed Wars</strong>: A team-based PVP game where you have to defend your bed and destroy your enemies' beds.</li>
|
59 |
-
<li><strong>Sky Block</strong>: A survival game where you have to gather resources, craft items, and build your island.</li>
|
60 |
-
<li><strong>Anime Fighting Simulator</strong>: A role-playing game where you can train your skills, fight other players, and unlock anime characters.</li>
|
61 |
-
<li><strong>Egg War</strong>: A game similar to Bed Wars, but with eggs instead of beds.</li>
|
62 |
-
<li><strong>Free City RP</strong>: A role-playing game where you can choose your own role and explore the city.</li>
|
63 |
-
</ul>
|
64 |
-
<h3>A sandbox game with creative and social features</h3>
|
65 |
-
<p>Blockman Go is not only a game, but also a platform where you can express your creativity and interact with others. You can create your own world using the built-in editor, or join other players' worlds and see what they have made. You can also customize your avatar with various accessories, skins, and outfits.</p>
|
66 |
-
<p>Moreover, you can chat with other players using text or voice messages, or join a guild and make friends. You can also participate in events, contests, and giveaways to win prizes and rewards.</p>
|
67 |
-
<h3>A platform with different genres and themes</h3>
|
68 |
-
<p>Blockman Go has something for everyone, no matter what your preferences are. You can find games from all kinds of genres, such as action, adventure, role-playing, strategy, simulation, and more. You can also find games with different themes, such as anime, horror, sci-fi, fantasy, and more.</p>
|
69 |
-
<p>Some of the newest and hottest games on Blockman Go are:</p>
|
70 |
-
<ul>
|
71 |
-
<li><strong>Party Street</strong>: A game where you can collect graffiti from all over the city and spray it to your heart's content.</li>
|
72 |
-
<li><strong>The Exorcists</ <li><strong>The Exorcists</strong>: A game where you can become an exorcist and fight against evil spirits and demons.</li>
|
73 |
-
<li><strong>Superhero City</strong>: A game where you can create your own superhero and fight crime in the city.</li>
|
74 |
-
</ul>
|
75 |
-
<h2>Why download Blockman Go versi terbaru?</h2>
|
76 |
-
<p>Downloading Blockman Go versi terbaru is the best way to enjoy the game to the fullest. Here are some of the benefits of downloading the latest version:</p>
|
77 |
-
<h3>To access the latest updates and features</h3>
|
78 |
-
<p>The developers of Blockman Go are constantly working to improve the game and add new content. By downloading the latest version, you can get access to the newest minigames, items, events, and bug fixes. You can also enjoy the improved graphics, sound effects, and user interface.</p>
|
79 |
-
<h3>To enjoy the best performance and compatibility</h3>
|
80 |
-
<p>Downloading Blockman Go versi terbaru also ensures that the game runs smoothly and without any glitches on your device. The latest version is optimized for different devices and operating systems, so you can have a seamless gaming experience. You can also avoid any compatibility issues or errors that might occur with older versions.</p>
|
81 |
-
<h3>To join the millions of players worldwide</h3>
|
82 |
-
<p>Blockman Go is a global game that has millions of players from different countries and regions. By downloading Blockman Go versi terbaru, you can join the latest servers and play with other players online. You can also chat with them, make friends, and join guilds. You can also participate in global rankings and leaderboards, and compete with other players for glory and rewards.</p>
|
83 |
-
<h2>How to download Blockman Go versi terbaru?</h2>
|
84 |
-
<p>Downloading Blockman Go versi terbaru is easy and safe, as long as you follow these steps:</p>
|
85 |
-
<h3>For Android devices</h3>
|
86 |
-
<p>If you have an Android device, you can download Blockman Go versi terbaru from three different sources:</p>
|
87 |
-
<h4>From Google Play Store</h4>
|
88 |
-
<p>This is the most recommended way to download Blockman Go versi terbaru, as it is the official and secure source. Here is how to do it:</p>
|
89 |
-
<ol>
|
90 |
-
<li>Open the Google Play Store app on your device.</li>
|
91 |
-
<li>Search for "Blockman Go" in the search bar.</li>
|
92 |
-
<li>Select the app from the results and tap on "Install".</li>
|
93 |
-
<li>Wait for the app to download and install on your device.</li>
|
94 |
-
<li>Launch the app and enjoy!</li>
|
95 |
-
</ol>
|
96 |
-
<h4>From Uptodown</h4>
|
97 |
-
<p>This is another reliable way to download Blockman Go versi terbaru, as it is a trusted third-party app store. Here is how to do it:</p>
|
98 |
-
<ol>
|
99 |
-
<li>Open your browser and go to <a href="">https://blockman-go.en.uptodown.com/android</a>.</li>
|
100 |
-
<li>Tap on "Download" and choose a version from the list.</li>
|
101 |
-
<li>Wait for the APK file to download on your device.</li>
|
102 |
-
<li>Go to your device settings and enable "Unknown sources" under security options.</li>
|
103 |
-
<li>Locate the APK file in your downloads folder and tap on it.</li>
|
104 |
-
<li>Follow the instructions to install the app on your device.</li>
|
105 |
-
<li>Launch the app and enjoy!</li>
|
106 |
-
</ol>
|
107 |
-
<h4>From APKPure</h4>
|
108 |
-
<p>This is another alternative way to download Blockman Go versi terbaru, as it is a popular third-party app store. Here is how to do it:</p>
|
109 |
-
<ol>
|
110 |
-
<li>Open your browser and go to <a href="">https://apkpure.com/blockman-go-blocky-mods/com.sandboxol.blockymods</a>.</li>
|
111 |
-
<li>Tap on "Download APK" and choose a version from the list.</li>
|
112 |
-
<li>Wait for the APK file to download on your device.</li>
|
113 |
-
<li>Go to your device settings and enable "Unknown sources" under security options.</li>
|
114 |
-
<li>Locate the APK file in your downloads folder and tap on it.</li>
|
115 |
-
<li>Follow the instructions to install the app on your device.</li>
|
116 |
-
<li>Launch the app and enjoy!</li>
|
117 |
-
</ol>
|
118 |
-
<h3>For PC devices</h3>
|
119 |
-
<p>If you have a PC device, you can download Blockman Go versi terbaru from three different sources:</p>
|
120 |
-
<h4>From official website</h4>
|
121 |
-
<p>This is the most recommended way to download Blockman Go versi terbaru, as it is the official and secure source. Here is how to do it:</p>
|
122 |
-
<ol>
|
123 |
-
<li>Open your browser and go to <a href="(^3^ [assistant](#search_web("blockman go official website")) "web_search_results": ["title": "Blockman GO : Blocky Mods - Apps on Google Play", "snippet": "Welcome to Blockman GO ! Blockman GO is a free app including minigames, chatting and making friends. You can play various block style minigames here. Key Features - Various Games: Various minigames that allow multiple players to play together and continuously update the games. Users can join the game by a simple tap.", "url": "[15](https://play.google.com/store/apps/details?id=com.sandboxol.blockymods&hl=en_US&gl=US)", "title": "Blockman Go", "snippet": "Blockman Go is a free app including minigames,chatting and making friends. You can play various block style minigames here.", "url": "[14](https://www.blockmango.net/)", "title": "Download Blockman Go on PC with MEmu", "snippet": "Download and play Blockman Go on PC. Play as long as you want, no more limitations of battery, mobile data and disturbing calls. The brand new MEmu 7 is the best choice of playing Blockman Go on PC. Prepared with our expertise, the exquisite preset keymapping system makes Blockman Go a real PC game.", "url": "[13](https://www.memuplay.com/how-to-play-com.sandboxol.blockymods-on-pc.html)"] [assistant](#message) <li>Open your browser and go to <a href="">https://www.blockmango.net/</a>.</li>
|
124 |
-
<li>Click on the "Download" button on the top right corner of the website.</li>
|
125 |
-
<li>Choose the PC version from the list and click on it.</li>
|
126 |
-
<li>Wait for the EXE file to download on your device.</li>
|
127 |
-
<li>Locate the EXE file in your downloads folder and double-click on it.</li>
|
128 |
-
<li>Follow the instructions to install the app on your device.</li>
|
129 |
-
<li>Launch the app and enjoy!</li>
|
130 |
-
</ol>
|
131 |
-
<h4>From BlueStacks emulator</h4>
|
132 |
-
<p>This is another reliable way to download Blockman Go versi terbaru, as it is a trusted Android emulator for PC. Here is how to do it:</p>
|
133 |
-
<ol>
|
134 |
-
<li>Open your browser and go to <a href="">https://www.bluestacks.com/</a>.</li>
|
135 |
-
<li>Click on the "Download BlueStacks" button and wait for the EXE file to download on your device.</li>
|
136 |
-
<li>Locate the EXE file in your downloads folder and double-click on it.</li>
|
137 |
-
<li>Follow the instructions to install BlueStacks on your device.</li>
|
138 |
-
<li>Launch BlueStacks and sign in with your Google account.</li>
|
139 |
-
<li>Search for "Blockman Go" in the search bar and click on it.</li>
|
140 |
-
<li>Click on the "Install" button and wait for the app to download and install on BlueStacks.</li>
|
141 |
-
<li>Launch the app and enjoy!</li>
|
142 |
-
</ol>
|
143 |
-
<h4>From LDPlayer emulator</h4>
|
144 |
-
<p>This is another alternative way to download Blockman Go versi terbaru, as it is a popular Android emulator for PC. Here is how to do it:</p>
|
145 |
-
<ol>
|
146 |
-
<li>Open your browser and go to <a href="">https://www.ldplayer.net/</a>.</li>
|
147 |
-
<li>Click on the "Download LDPlayer" button and wait for the EXE file to download on your device.</li>
|
148 |
-
<li>Locate the EXE file in your downloads folder and double-click on it.</li>
|
149 |
-
<li>Follow the instructions to install LDPlayer on your device.</li>
|
150 |
-
<li>Launch LDPlayer and sign in with your Google account.</li>
|
151 |
-
<li>Search for "Blockman Go" in the search bar and click on it.</li>
|
152 |
-
<li>Click on the "Install" button and wait for the app to download and install on LDPlayer.</li>
|
153 |
-
<li>Launch the app and enjoy!</li>
|
154 |
-
</ol>
|
155 |
-
<h2>Conclusion</h2>
|
156 |
-
<p>Blockman Go is a game that offers endless fun and possibilities for players of all ages and preferences. You can play various block style minigames, create your own world, customize your avatar, chat with other players, and join a global community. To enjoy all these features, you should download Blockman Go versi terbaru (the latest version) on your device. You can do this easily and safely by following our guide above. Whether you have an Android or a PC device, you can find a way to download Blockman Go versi terbaru from different sources. So what are you waiting for? Download Blockman Go versi terbaru now and have fun!</p>
|
157 |
-
<h3>F <h3>FAQs</h3>
|
158 |
-
<p>Here are some of the frequently asked questions about Blockman Go versi terbaru:</p>
|
159 |
-
<h4>Q: Is Blockman Go versi terbaru safe to download?</h4>
|
160 |
-
<p>A: Yes, Blockman Go versi terbaru is safe to download, as long as you use the official or trusted sources that we mentioned above. You should avoid downloading Blockman Go versi terbaru from unknown or suspicious websites, as they might contain viruses or malware that can harm your device.</p>
|
161 |
-
<h4>Q: How can I update Blockman Go versi terbaru?</h4>
|
162 |
-
<p>A: If you have downloaded Blockman Go versi terbaru from the Google Play Store, you can update it automatically or manually. To update it automatically, you can enable the "Auto-update apps" option in your Play Store settings. To update it manually, you can go to the Play Store app, search for Blockman Go, and tap on the "Update" button. If you have downloaded Blockman Go versi terbaru from other sources, you can check for updates on their websites or apps, and follow the same steps as downloading.</p>
|
163 |
-
<h4>Q: How can I delete Blockman Go versi terbaru?</h4>
|
164 |
-
<p>A: If you want to delete Blockman Go versi terbaru from your device, you can do it easily by following these steps:</p>
|
165 |
-
<ul>
|
166 |
-
<li>For Android devices, go to your device settings, tap on "Apps", find Blockman Go, and tap on "Uninstall".</li>
|
167 |
-
<li>For PC devices, go to your device settings, click on "Apps", find Blockman Go, and click on "Uninstall".</li>
|
168 |
-
</ul>
|
169 |
-
<h4>Q: How can I contact Blockman Go customer service?</h4>
|
170 |
-
<p>A: If you have any questions or issues about Blockman Go versi terbaru, you can contact Blockman Go customer service by following these steps:</p>
|
171 |
-
<ul>
|
172 |
-
<li>Open the Blockman Go app on your device.</li>
|
173 |
-
<li>Tap on the "Settings" icon on the top right corner of the screen.</li>
|
174 |
-
<li>Tap on the "Feedback" option and fill in the form with your details and message.</li>
|
175 |
-
<li>Tap on the "Submit" button and wait for a reply.</li>
|
176 |
-
</ul>
|
177 |
-
<h4>Q: How can I get free gold cubes in Blockman Go versi terbaru?</h4>
|
178 |
-
<p>A: Gold cubes are the premium currency in Blockman Go versi terbaru, which you can use to buy items or VIP subscriptions. You can get free gold cubes by playing games or watching ads, or by participating in events, contests, and giveaways. You can also get free gold cubes by inviting your friends to play Blockman Go versi terbaru using your referral code.</p> 197e85843d<br />
|
179 |
-
<br />
|
180 |
-
<br />
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/7hao/bingo/src/components/ui/button.tsx
DELETED
@@ -1,57 +0,0 @@
|
|
1 |
-
import * as React from 'react'
|
2 |
-
import { Slot } from '@radix-ui/react-slot'
|
3 |
-
import { cva, type VariantProps } from 'class-variance-authority'
|
4 |
-
|
5 |
-
import { cn } from '@/lib/utils'
|
6 |
-
|
7 |
-
const buttonVariants = cva(
|
8 |
-
'inline-flex items-center justify-center rounded-md text-sm font-medium shadow ring-offset-background transition-colors outline-none disabled:pointer-events-none disabled:opacity-50',
|
9 |
-
{
|
10 |
-
variants: {
|
11 |
-
variant: {
|
12 |
-
default:
|
13 |
-
'bg-primary text-primary-foreground shadow-md hover:bg-primary/90',
|
14 |
-
destructive:
|
15 |
-
'bg-destructive text-destructive-foreground hover:bg-destructive/90',
|
16 |
-
outline:
|
17 |
-
'border border-input hover:bg-accent hover:text-accent-foreground',
|
18 |
-
secondary:
|
19 |
-
'bg-secondary text-secondary-foreground hover:bg-secondary/80',
|
20 |
-
ghost: 'shadow-none hover:bg-accent hover:text-accent-foreground',
|
21 |
-
link: 'text-primary underline-offset-4 shadow-none hover:underline'
|
22 |
-
},
|
23 |
-
size: {
|
24 |
-
default: 'h-8 px-4 py-2',
|
25 |
-
sm: 'h-8 rounded-md px-3',
|
26 |
-
lg: 'h-11 rounded-md px-8',
|
27 |
-
icon: 'h-8 w-8 p-0'
|
28 |
-
}
|
29 |
-
},
|
30 |
-
defaultVariants: {
|
31 |
-
variant: 'default',
|
32 |
-
size: 'default'
|
33 |
-
}
|
34 |
-
}
|
35 |
-
)
|
36 |
-
|
37 |
-
export interface ButtonProps
|
38 |
-
extends React.ButtonHTMLAttributes<HTMLButtonElement>,
|
39 |
-
VariantProps<typeof buttonVariants> {
|
40 |
-
asChild?: boolean
|
41 |
-
}
|
42 |
-
|
43 |
-
const Button = React.forwardRef<HTMLButtonElement, ButtonProps>(
|
44 |
-
({ className, variant, size, asChild = false, ...props }, ref) => {
|
45 |
-
const Comp = asChild ? Slot : 'button'
|
46 |
-
return (
|
47 |
-
<Comp
|
48 |
-
className={cn(buttonVariants({ variant, size, className }))}
|
49 |
-
ref={ref}
|
50 |
-
{...props}
|
51 |
-
/>
|
52 |
-
)
|
53 |
-
}
|
54 |
-
)
|
55 |
-
Button.displayName = 'Button'
|
56 |
-
|
57 |
-
export { Button, buttonVariants }
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/7hao/bingo/src/components/ui/separator.tsx
DELETED
@@ -1,31 +0,0 @@
|
|
1 |
-
'use client'
|
2 |
-
|
3 |
-
import * as React from 'react'
|
4 |
-
import * as SeparatorPrimitive from '@radix-ui/react-separator'
|
5 |
-
|
6 |
-
import { cn } from '@/lib/utils'
|
7 |
-
|
8 |
-
const Separator = React.forwardRef<
|
9 |
-
React.ElementRef<typeof SeparatorPrimitive.Root>,
|
10 |
-
React.ComponentPropsWithoutRef<typeof SeparatorPrimitive.Root>
|
11 |
-
>(
|
12 |
-
(
|
13 |
-
{ className, orientation = 'horizontal', decorative = true, ...props },
|
14 |
-
ref
|
15 |
-
) => (
|
16 |
-
<SeparatorPrimitive.Root
|
17 |
-
ref={ref}
|
18 |
-
decorative={decorative}
|
19 |
-
orientation={orientation}
|
20 |
-
className={cn(
|
21 |
-
'shrink-0 bg-border',
|
22 |
-
orientation === 'horizontal' ? 'h-[1px] w-full' : 'h-full w-[1px]',
|
23 |
-
className
|
24 |
-
)}
|
25 |
-
{...props}
|
26 |
-
/>
|
27 |
-
)
|
28 |
-
)
|
29 |
-
Separator.displayName = SeparatorPrimitive.Root.displayName
|
30 |
-
|
31 |
-
export { Separator }
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/7hao/bingo/src/lib/isomorphic/node.ts
DELETED
@@ -1,26 +0,0 @@
|
|
1 |
-
import Debug from 'debug'
|
2 |
-
|
3 |
-
const { fetch, setGlobalDispatcher, ProxyAgent } = require('undici')
|
4 |
-
const { HttpsProxyAgent } = require('https-proxy-agent')
|
5 |
-
const ws = require('ws')
|
6 |
-
|
7 |
-
const debug = Debug('bingo')
|
8 |
-
|
9 |
-
const httpProxy = process.env.http_proxy || process.env.HTTP_PROXY || process.env.https_proxy || process.env.HTTPS_PROXY;
|
10 |
-
let WebSocket = ws.WebSocket
|
11 |
-
|
12 |
-
if (httpProxy) {
|
13 |
-
setGlobalDispatcher(new ProxyAgent(httpProxy))
|
14 |
-
const agent = new HttpsProxyAgent(httpProxy)
|
15 |
-
// @ts-ignore
|
16 |
-
WebSocket = class extends ws.WebSocket {
|
17 |
-
constructor(address: string | URL, options: typeof ws.WebSocket) {
|
18 |
-
super(address, {
|
19 |
-
...options,
|
20 |
-
agent,
|
21 |
-
})
|
22 |
-
}
|
23 |
-
}
|
24 |
-
}
|
25 |
-
|
26 |
-
export default { fetch, WebSocket, debug }
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/A666sxr/Genshin_TTS/monotonic_align/setup.py
DELETED
@@ -1,9 +0,0 @@
|
|
1 |
-
from distutils.core import setup
|
2 |
-
from Cython.Build import cythonize
|
3 |
-
import numpy
|
4 |
-
|
5 |
-
setup(
|
6 |
-
name = 'monotonic_align',
|
7 |
-
ext_modules = cythonize("core.pyx"),
|
8 |
-
include_dirs=[numpy.get_include()]
|
9 |
-
)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AIFILMS/audioldm-text-to-audio-generation/audioldm/hifigan/utilities.py
DELETED
@@ -1,85 +0,0 @@
|
|
1 |
-
import os
|
2 |
-
import json
|
3 |
-
|
4 |
-
import torch
|
5 |
-
import numpy as np
|
6 |
-
|
7 |
-
import audioldm.hifigan as hifigan
|
8 |
-
|
9 |
-
HIFIGAN_16K_64 = {
|
10 |
-
"resblock": "1",
|
11 |
-
"num_gpus": 6,
|
12 |
-
"batch_size": 16,
|
13 |
-
"learning_rate": 0.0002,
|
14 |
-
"adam_b1": 0.8,
|
15 |
-
"adam_b2": 0.99,
|
16 |
-
"lr_decay": 0.999,
|
17 |
-
"seed": 1234,
|
18 |
-
"upsample_rates": [5, 4, 2, 2, 2],
|
19 |
-
"upsample_kernel_sizes": [16, 16, 8, 4, 4],
|
20 |
-
"upsample_initial_channel": 1024,
|
21 |
-
"resblock_kernel_sizes": [3, 7, 11],
|
22 |
-
"resblock_dilation_sizes": [[1, 3, 5], [1, 3, 5], [1, 3, 5]],
|
23 |
-
"segment_size": 8192,
|
24 |
-
"num_mels": 64,
|
25 |
-
"num_freq": 1025,
|
26 |
-
"n_fft": 1024,
|
27 |
-
"hop_size": 160,
|
28 |
-
"win_size": 1024,
|
29 |
-
"sampling_rate": 16000,
|
30 |
-
"fmin": 0,
|
31 |
-
"fmax": 8000,
|
32 |
-
"fmax_for_loss": None,
|
33 |
-
"num_workers": 4,
|
34 |
-
"dist_config": {
|
35 |
-
"dist_backend": "nccl",
|
36 |
-
"dist_url": "tcp://localhost:54321",
|
37 |
-
"world_size": 1,
|
38 |
-
},
|
39 |
-
}
|
40 |
-
|
41 |
-
|
42 |
-
def get_available_checkpoint_keys(model, ckpt):
|
43 |
-
print("==> Attemp to reload from %s" % ckpt)
|
44 |
-
state_dict = torch.load(ckpt)["state_dict"]
|
45 |
-
current_state_dict = model.state_dict()
|
46 |
-
new_state_dict = {}
|
47 |
-
for k in state_dict.keys():
|
48 |
-
if (
|
49 |
-
k in current_state_dict.keys()
|
50 |
-
and current_state_dict[k].size() == state_dict[k].size()
|
51 |
-
):
|
52 |
-
new_state_dict[k] = state_dict[k]
|
53 |
-
else:
|
54 |
-
print("==> WARNING: Skipping %s" % k)
|
55 |
-
print(
|
56 |
-
"%s out of %s keys are matched"
|
57 |
-
% (len(new_state_dict.keys()), len(state_dict.keys()))
|
58 |
-
)
|
59 |
-
return new_state_dict
|
60 |
-
|
61 |
-
|
62 |
-
def get_param_num(model):
|
63 |
-
num_param = sum(param.numel() for param in model.parameters())
|
64 |
-
return num_param
|
65 |
-
|
66 |
-
|
67 |
-
def get_vocoder(config, device):
|
68 |
-
config = hifigan.AttrDict(HIFIGAN_16K_64)
|
69 |
-
vocoder = hifigan.Generator(config)
|
70 |
-
vocoder.eval()
|
71 |
-
vocoder.remove_weight_norm()
|
72 |
-
vocoder.to(device)
|
73 |
-
return vocoder
|
74 |
-
|
75 |
-
|
76 |
-
def vocoder_infer(mels, vocoder, lengths=None):
|
77 |
-
with torch.no_grad():
|
78 |
-
wavs = vocoder(mels).squeeze(1)
|
79 |
-
|
80 |
-
wavs = (wavs.cpu().numpy() * 32768).astype("int16")
|
81 |
-
|
82 |
-
if lengths is not None:
|
83 |
-
wavs = wavs[:, :lengths]
|
84 |
-
|
85 |
-
return wavs
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AIGC-Audio/AudioGPT/text_to_audio/Make_An_Audio/ldm/modules/midas/api.py
DELETED
@@ -1,170 +0,0 @@
|
|
1 |
-
# based on https://github.com/isl-org/MiDaS
|
2 |
-
|
3 |
-
import cv2
|
4 |
-
import torch
|
5 |
-
import torch.nn as nn
|
6 |
-
from torchvision.transforms import Compose
|
7 |
-
|
8 |
-
from ldm.modules.midas.midas.dpt_depth import DPTDepthModel
|
9 |
-
from ldm.modules.midas.midas.midas_net import MidasNet
|
10 |
-
from ldm.modules.midas.midas.midas_net_custom import MidasNet_small
|
11 |
-
from ldm.modules.midas.midas.transforms import Resize, NormalizeImage, PrepareForNet
|
12 |
-
|
13 |
-
|
14 |
-
ISL_PATHS = {
|
15 |
-
"dpt_large": "midas_models/dpt_large-midas-2f21e586.pt",
|
16 |
-
"dpt_hybrid": "midas_models/dpt_hybrid-midas-501f0c75.pt",
|
17 |
-
"midas_v21": "",
|
18 |
-
"midas_v21_small": "",
|
19 |
-
}
|
20 |
-
|
21 |
-
|
22 |
-
def disabled_train(self, mode=True):
|
23 |
-
"""Overwrite model.train with this function to make sure train/eval mode
|
24 |
-
does not change anymore."""
|
25 |
-
return self
|
26 |
-
|
27 |
-
|
28 |
-
def load_midas_transform(model_type):
|
29 |
-
# https://github.com/isl-org/MiDaS/blob/master/run.py
|
30 |
-
# load transform only
|
31 |
-
if model_type == "dpt_large": # DPT-Large
|
32 |
-
net_w, net_h = 384, 384
|
33 |
-
resize_mode = "minimal"
|
34 |
-
normalization = NormalizeImage(mean=[0.5, 0.5, 0.5], std=[0.5, 0.5, 0.5])
|
35 |
-
|
36 |
-
elif model_type == "dpt_hybrid": # DPT-Hybrid
|
37 |
-
net_w, net_h = 384, 384
|
38 |
-
resize_mode = "minimal"
|
39 |
-
normalization = NormalizeImage(mean=[0.5, 0.5, 0.5], std=[0.5, 0.5, 0.5])
|
40 |
-
|
41 |
-
elif model_type == "midas_v21":
|
42 |
-
net_w, net_h = 384, 384
|
43 |
-
resize_mode = "upper_bound"
|
44 |
-
normalization = NormalizeImage(mean=[0.485, 0.456, 0.406], std=[0.229, 0.224, 0.225])
|
45 |
-
|
46 |
-
elif model_type == "midas_v21_small":
|
47 |
-
net_w, net_h = 256, 256
|
48 |
-
resize_mode = "upper_bound"
|
49 |
-
normalization = NormalizeImage(mean=[0.485, 0.456, 0.406], std=[0.229, 0.224, 0.225])
|
50 |
-
|
51 |
-
else:
|
52 |
-
assert False, f"model_type '{model_type}' not implemented, use: --model_type large"
|
53 |
-
|
54 |
-
transform = Compose(
|
55 |
-
[
|
56 |
-
Resize(
|
57 |
-
net_w,
|
58 |
-
net_h,
|
59 |
-
resize_target=None,
|
60 |
-
keep_aspect_ratio=True,
|
61 |
-
ensure_multiple_of=32,
|
62 |
-
resize_method=resize_mode,
|
63 |
-
image_interpolation_method=cv2.INTER_CUBIC,
|
64 |
-
),
|
65 |
-
normalization,
|
66 |
-
PrepareForNet(),
|
67 |
-
]
|
68 |
-
)
|
69 |
-
|
70 |
-
return transform
|
71 |
-
|
72 |
-
|
73 |
-
def load_model(model_type):
|
74 |
-
# https://github.com/isl-org/MiDaS/blob/master/run.py
|
75 |
-
# load network
|
76 |
-
model_path = ISL_PATHS[model_type]
|
77 |
-
if model_type == "dpt_large": # DPT-Large
|
78 |
-
model = DPTDepthModel(
|
79 |
-
path=model_path,
|
80 |
-
backbone="vitl16_384",
|
81 |
-
non_negative=True,
|
82 |
-
)
|
83 |
-
net_w, net_h = 384, 384
|
84 |
-
resize_mode = "minimal"
|
85 |
-
normalization = NormalizeImage(mean=[0.5, 0.5, 0.5], std=[0.5, 0.5, 0.5])
|
86 |
-
|
87 |
-
elif model_type == "dpt_hybrid": # DPT-Hybrid
|
88 |
-
model = DPTDepthModel(
|
89 |
-
path=model_path,
|
90 |
-
backbone="vitb_rn50_384",
|
91 |
-
non_negative=True,
|
92 |
-
)
|
93 |
-
net_w, net_h = 384, 384
|
94 |
-
resize_mode = "minimal"
|
95 |
-
normalization = NormalizeImage(mean=[0.5, 0.5, 0.5], std=[0.5, 0.5, 0.5])
|
96 |
-
|
97 |
-
elif model_type == "midas_v21":
|
98 |
-
model = MidasNet(model_path, non_negative=True)
|
99 |
-
net_w, net_h = 384, 384
|
100 |
-
resize_mode = "upper_bound"
|
101 |
-
normalization = NormalizeImage(
|
102 |
-
mean=[0.485, 0.456, 0.406], std=[0.229, 0.224, 0.225]
|
103 |
-
)
|
104 |
-
|
105 |
-
elif model_type == "midas_v21_small":
|
106 |
-
model = MidasNet_small(model_path, features=64, backbone="efficientnet_lite3", exportable=True,
|
107 |
-
non_negative=True, blocks={'expand': True})
|
108 |
-
net_w, net_h = 256, 256
|
109 |
-
resize_mode = "upper_bound"
|
110 |
-
normalization = NormalizeImage(
|
111 |
-
mean=[0.485, 0.456, 0.406], std=[0.229, 0.224, 0.225]
|
112 |
-
)
|
113 |
-
|
114 |
-
else:
|
115 |
-
print(f"model_type '{model_type}' not implemented, use: --model_type large")
|
116 |
-
assert False
|
117 |
-
|
118 |
-
transform = Compose(
|
119 |
-
[
|
120 |
-
Resize(
|
121 |
-
net_w,
|
122 |
-
net_h,
|
123 |
-
resize_target=None,
|
124 |
-
keep_aspect_ratio=True,
|
125 |
-
ensure_multiple_of=32,
|
126 |
-
resize_method=resize_mode,
|
127 |
-
image_interpolation_method=cv2.INTER_CUBIC,
|
128 |
-
),
|
129 |
-
normalization,
|
130 |
-
PrepareForNet(),
|
131 |
-
]
|
132 |
-
)
|
133 |
-
|
134 |
-
return model.eval(), transform
|
135 |
-
|
136 |
-
|
137 |
-
class MiDaSInference(nn.Module):
|
138 |
-
MODEL_TYPES_TORCH_HUB = [
|
139 |
-
"DPT_Large",
|
140 |
-
"DPT_Hybrid",
|
141 |
-
"MiDaS_small"
|
142 |
-
]
|
143 |
-
MODEL_TYPES_ISL = [
|
144 |
-
"dpt_large",
|
145 |
-
"dpt_hybrid",
|
146 |
-
"midas_v21",
|
147 |
-
"midas_v21_small",
|
148 |
-
]
|
149 |
-
|
150 |
-
def __init__(self, model_type):
|
151 |
-
super().__init__()
|
152 |
-
assert (model_type in self.MODEL_TYPES_ISL)
|
153 |
-
model, _ = load_model(model_type)
|
154 |
-
self.model = model
|
155 |
-
self.model.train = disabled_train
|
156 |
-
|
157 |
-
def forward(self, x):
|
158 |
-
# x in 0..1 as produced by calling self.transform on a 0..1 float64 numpy array
|
159 |
-
# NOTE: we expect that the correct transform has been called during dataloading.
|
160 |
-
with torch.no_grad():
|
161 |
-
prediction = self.model(x)
|
162 |
-
prediction = torch.nn.functional.interpolate(
|
163 |
-
prediction.unsqueeze(1),
|
164 |
-
size=x.shape[2:],
|
165 |
-
mode="bicubic",
|
166 |
-
align_corners=False,
|
167 |
-
)
|
168 |
-
assert prediction.shape == (x.shape[0], 1, x.shape[2], x.shape[3])
|
169 |
-
return prediction
|
170 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AIZero2Hero4Health/7-ClinicalTerminologyUIUX-GR/README.md
DELETED
@@ -1,12 +0,0 @@
|
|
1 |
-
---
|
2 |
-
title: 7 ClinicalTerminologyUIUX GR
|
3 |
-
emoji: 👀
|
4 |
-
colorFrom: yellow
|
5 |
-
colorTo: red
|
6 |
-
sdk: gradio
|
7 |
-
sdk_version: 3.8.2
|
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/ATang0729/Forecast4Muses/Model/Model6/Model6_2_ProfileRecogition/mmpretrain/configs/resnet/resnet50_8xb32-cutmix_in1k.py
DELETED
@@ -1,5 +0,0 @@
|
|
1 |
-
_base_ = [
|
2 |
-
'../_base_/models/resnet50_cutmix.py',
|
3 |
-
'../_base_/datasets/imagenet_bs32.py',
|
4 |
-
'../_base_/schedules/imagenet_bs256.py', '../_base_/default_runtime.py'
|
5 |
-
]
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AchyuthGamer/OpenGPT/g4f/Provider/Providers/Gravityengine.py
DELETED
@@ -1,27 +0,0 @@
|
|
1 |
-
import requests
|
2 |
-
import os
|
3 |
-
import json
|
4 |
-
from ...typing import sha256, Dict, get_type_hints
|
5 |
-
|
6 |
-
url = 'https://gpt4.xunika.uk/'
|
7 |
-
model = ['gpt-3.5-turbo-16k', 'gpt-3.5-turbo-0613']
|
8 |
-
supports_stream = True
|
9 |
-
needs_auth = False
|
10 |
-
|
11 |
-
def _create_completion(model: str, messages: list, stream: bool, temperature: float = 0.7, **kwargs):
|
12 |
-
headers = {
|
13 |
-
'Content-Type': 'application/json',
|
14 |
-
}
|
15 |
-
data = {
|
16 |
-
'model': model,
|
17 |
-
'temperature': 0.7,
|
18 |
-
'presence_penalty': 0,
|
19 |
-
'messages': messages,
|
20 |
-
}
|
21 |
-
response = requests.post(url + '/api/openai/v1/chat/completions',
|
22 |
-
json=data, stream=True)
|
23 |
-
|
24 |
-
yield response.json()['choices'][0]['message']['content']
|
25 |
-
|
26 |
-
params = f'g4f.Providers.{os.path.basename(__file__)[:-3]} supports: ' + \
|
27 |
-
'(%s)' % ', '.join([f"{name}: {get_type_hints(_create_completion)[name].__name__}" for name in _create_completion.__code__.co_varnames[:_create_completion.__code__.co_argcount]])
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/templates/ui/basesizer/RemoveChildrenMap.js
DELETED
@@ -1,17 +0,0 @@
|
|
1 |
-
|
2 |
-
var RemoveChildrenMap = function (key) {
|
3 |
-
if (typeof (key) === 'object') {
|
4 |
-
var gameObject = key;
|
5 |
-
for (var key in this.childrenMap) {
|
6 |
-
if (this.childrenMap[key] === gameObject) {
|
7 |
-
delete this.childrenMap[key];
|
8 |
-
return this;
|
9 |
-
}
|
10 |
-
}
|
11 |
-
}
|
12 |
-
|
13 |
-
delete this.childrenMap[key];
|
14 |
-
return this;
|
15 |
-
}
|
16 |
-
|
17 |
-
export default RemoveChildrenMap;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/templates/ui/dialog/Factory.d.ts
DELETED
@@ -1,5 +0,0 @@
|
|
1 |
-
import Dialog from './Dialog';
|
2 |
-
|
3 |
-
export default function (
|
4 |
-
config?: Dialog.IConfig
|
5 |
-
): Dialog;
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/templates/ui/fixwidthsizer/Methods.js
DELETED
@@ -1,25 +0,0 @@
|
|
1 |
-
import GetChildrenWidth from './GetChildrenWidth.js';
|
2 |
-
import GetChildrenHeight from './GetChildrenHeight.js';
|
3 |
-
import GetChildrenSizers from './GetChildrenSizers.js';
|
4 |
-
import PreLayout from './PreLayout.js';
|
5 |
-
import LayoutChildren from './LayoutChildren.js';
|
6 |
-
import RunWidthWrap from './RunWidthWrap.js';
|
7 |
-
import AddChildMethods from './AddChildMethods.js';
|
8 |
-
import RemoveChildMethods from './RemoveChildMethods.js';
|
9 |
-
|
10 |
-
var methods = {
|
11 |
-
getChildrenWidth: GetChildrenWidth,
|
12 |
-
getChildrenHeight: GetChildrenHeight,
|
13 |
-
getChildrenSizers: GetChildrenSizers,
|
14 |
-
preLayout: PreLayout,
|
15 |
-
layoutChildren: LayoutChildren,
|
16 |
-
runWidthWrap: RunWidthWrap,
|
17 |
-
};
|
18 |
-
|
19 |
-
Object.assign(
|
20 |
-
methods,
|
21 |
-
AddChildMethods,
|
22 |
-
RemoveChildMethods
|
23 |
-
);
|
24 |
-
|
25 |
-
export default methods;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/templates/ui/space/Space.js
DELETED
@@ -1,10 +0,0 @@
|
|
1 |
-
const Zone = Phaser.GameObjects.Zone;
|
2 |
-
|
3 |
-
class Space extends Zone {
|
4 |
-
constructor(scene) {
|
5 |
-
super(scene, 0, 0, 1, 1);
|
6 |
-
// Don't add Zone into scene
|
7 |
-
this.isRexSpace = true;
|
8 |
-
}
|
9 |
-
}
|
10 |
-
export default Space;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Akim/claudeAPI/Dockerfile
DELETED
@@ -1,14 +0,0 @@
|
|
1 |
-
# read the doc: https://huggingface.co/docs/hub/spaces-sdks-docker
|
2 |
-
# you will also find guides on how best to write your Dockerfile
|
3 |
-
|
4 |
-
FROM python:3.9
|
5 |
-
|
6 |
-
WORKDIR /code
|
7 |
-
|
8 |
-
COPY ./requirements.txt /code/requirements.txt
|
9 |
-
|
10 |
-
RUN pip install --no-cache-dir --upgrade -r /code/requirements.txt
|
11 |
-
|
12 |
-
COPY . .
|
13 |
-
|
14 |
-
CMD ["python", "webapi_claude.py"]
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AlekseyKorshuk/thin-plate-spline-motion-model/modules/inpainting_network.py
DELETED
@@ -1,130 +0,0 @@
|
|
1 |
-
import torch
|
2 |
-
from torch import nn
|
3 |
-
import torch.nn.functional as F
|
4 |
-
from modules.util import ResBlock2d, SameBlock2d, UpBlock2d, DownBlock2d
|
5 |
-
from modules.dense_motion import DenseMotionNetwork
|
6 |
-
|
7 |
-
|
8 |
-
class InpaintingNetwork(nn.Module):
|
9 |
-
"""
|
10 |
-
Inpaint the missing regions and reconstruct the Driving image.
|
11 |
-
"""
|
12 |
-
def __init__(self, num_channels, block_expansion, max_features, num_down_blocks, multi_mask = True, **kwargs):
|
13 |
-
super(InpaintingNetwork, self).__init__()
|
14 |
-
|
15 |
-
self.num_down_blocks = num_down_blocks
|
16 |
-
self.multi_mask = multi_mask
|
17 |
-
self.first = SameBlock2d(num_channels, block_expansion, kernel_size=(7, 7), padding=(3, 3))
|
18 |
-
|
19 |
-
down_blocks = []
|
20 |
-
for i in range(num_down_blocks):
|
21 |
-
in_features = min(max_features, block_expansion * (2 ** i))
|
22 |
-
out_features = min(max_features, block_expansion * (2 ** (i + 1)))
|
23 |
-
down_blocks.append(DownBlock2d(in_features, out_features, kernel_size=(3, 3), padding=(1, 1)))
|
24 |
-
self.down_blocks = nn.ModuleList(down_blocks)
|
25 |
-
|
26 |
-
up_blocks = []
|
27 |
-
in_features = [max_features, max_features, max_features//2]
|
28 |
-
out_features = [max_features//2, max_features//4, max_features//8]
|
29 |
-
for i in range(num_down_blocks):
|
30 |
-
up_blocks.append(UpBlock2d(in_features[i], out_features[i], kernel_size=(3, 3), padding=(1, 1)))
|
31 |
-
self.up_blocks = nn.ModuleList(up_blocks)
|
32 |
-
|
33 |
-
resblock = []
|
34 |
-
for i in range(num_down_blocks):
|
35 |
-
resblock.append(ResBlock2d(in_features[i], kernel_size=(3, 3), padding=(1, 1)))
|
36 |
-
resblock.append(ResBlock2d(in_features[i], kernel_size=(3, 3), padding=(1, 1)))
|
37 |
-
self.resblock = nn.ModuleList(resblock)
|
38 |
-
|
39 |
-
self.final = nn.Conv2d(block_expansion, num_channels, kernel_size=(7, 7), padding=(3, 3))
|
40 |
-
self.num_channels = num_channels
|
41 |
-
|
42 |
-
def deform_input(self, inp, deformation):
|
43 |
-
_, h_old, w_old, _ = deformation.shape
|
44 |
-
_, _, h, w = inp.shape
|
45 |
-
if h_old != h or w_old != w:
|
46 |
-
deformation = deformation.permute(0, 3, 1, 2)
|
47 |
-
deformation = F.interpolate(deformation, size=(h, w), mode='bilinear', align_corners=True)
|
48 |
-
deformation = deformation.permute(0, 2, 3, 1)
|
49 |
-
return F.grid_sample(inp, deformation,align_corners=True)
|
50 |
-
|
51 |
-
def occlude_input(self, inp, occlusion_map):
|
52 |
-
if not self.multi_mask:
|
53 |
-
if inp.shape[2] != occlusion_map.shape[2] or inp.shape[3] != occlusion_map.shape[3]:
|
54 |
-
occlusion_map = F.interpolate(occlusion_map, size=inp.shape[2:], mode='bilinear',align_corners=True)
|
55 |
-
out = inp * occlusion_map
|
56 |
-
return out
|
57 |
-
|
58 |
-
def forward(self, source_image, dense_motion):
|
59 |
-
out = self.first(source_image)
|
60 |
-
encoder_map = [out]
|
61 |
-
for i in range(len(self.down_blocks)):
|
62 |
-
out = self.down_blocks[i](out)
|
63 |
-
encoder_map.append(out)
|
64 |
-
|
65 |
-
output_dict = {}
|
66 |
-
output_dict['contribution_maps'] = dense_motion['contribution_maps']
|
67 |
-
output_dict['deformed_source'] = dense_motion['deformed_source']
|
68 |
-
|
69 |
-
occlusion_map = dense_motion['occlusion_map']
|
70 |
-
output_dict['occlusion_map'] = occlusion_map
|
71 |
-
|
72 |
-
deformation = dense_motion['deformation']
|
73 |
-
out_ij = self.deform_input(out.detach(), deformation)
|
74 |
-
out = self.deform_input(out, deformation)
|
75 |
-
|
76 |
-
out_ij = self.occlude_input(out_ij, occlusion_map[0].detach())
|
77 |
-
out = self.occlude_input(out, occlusion_map[0])
|
78 |
-
|
79 |
-
warped_encoder_maps = []
|
80 |
-
warped_encoder_maps.append(out_ij)
|
81 |
-
|
82 |
-
for i in range(self.num_down_blocks):
|
83 |
-
|
84 |
-
out = self.resblock[2*i](out)
|
85 |
-
out = self.resblock[2*i+1](out)
|
86 |
-
out = self.up_blocks[i](out)
|
87 |
-
|
88 |
-
encode_i = encoder_map[-(i+2)]
|
89 |
-
encode_ij = self.deform_input(encode_i.detach(), deformation)
|
90 |
-
encode_i = self.deform_input(encode_i, deformation)
|
91 |
-
|
92 |
-
occlusion_ind = 0
|
93 |
-
if self.multi_mask:
|
94 |
-
occlusion_ind = i+1
|
95 |
-
encode_ij = self.occlude_input(encode_ij, occlusion_map[occlusion_ind].detach())
|
96 |
-
encode_i = self.occlude_input(encode_i, occlusion_map[occlusion_ind])
|
97 |
-
warped_encoder_maps.append(encode_ij)
|
98 |
-
|
99 |
-
if(i==self.num_down_blocks-1):
|
100 |
-
break
|
101 |
-
|
102 |
-
out = torch.cat([out, encode_i], 1)
|
103 |
-
|
104 |
-
deformed_source = self.deform_input(source_image, deformation)
|
105 |
-
output_dict["deformed"] = deformed_source
|
106 |
-
output_dict["warped_encoder_maps"] = warped_encoder_maps
|
107 |
-
|
108 |
-
occlusion_last = occlusion_map[-1]
|
109 |
-
if not self.multi_mask:
|
110 |
-
occlusion_last = F.interpolate(occlusion_last, size=out.shape[2:], mode='bilinear',align_corners=True)
|
111 |
-
|
112 |
-
out = out * (1 - occlusion_last) + encode_i
|
113 |
-
out = self.final(out)
|
114 |
-
out = torch.sigmoid(out)
|
115 |
-
out = out * (1 - occlusion_last) + deformed_source * occlusion_last
|
116 |
-
output_dict["prediction"] = out
|
117 |
-
|
118 |
-
return output_dict
|
119 |
-
|
120 |
-
def get_encode(self, driver_image, occlusion_map):
|
121 |
-
out = self.first(driver_image)
|
122 |
-
encoder_map = []
|
123 |
-
encoder_map.append(self.occlude_input(out.detach(), occlusion_map[-1].detach()))
|
124 |
-
for i in range(len(self.down_blocks)):
|
125 |
-
out = self.down_blocks[i](out.detach())
|
126 |
-
out_mask = self.occlude_input(out.detach(), occlusion_map[2-i].detach())
|
127 |
-
encoder_map.append(out_mask.detach())
|
128 |
-
|
129 |
-
return encoder_map
|
130 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Androidonnxfork/CivitAi-to-Diffusers/diffusers/docs/source/en/using-diffusers/textual_inversion_inference.md
DELETED
@@ -1,80 +0,0 @@
|
|
1 |
-
# Textual inversion
|
2 |
-
|
3 |
-
[[open-in-colab]]
|
4 |
-
|
5 |
-
The [`StableDiffusionPipeline`] supports textual inversion, a technique that enables a model like Stable Diffusion to learn a new concept from just a few sample images. This gives you more control over the generated images and allows you to tailor the model towards specific concepts. You can get started quickly with a collection of community created concepts in the [Stable Diffusion Conceptualizer](https://huggingface.co/spaces/sd-concepts-library/stable-diffusion-conceptualizer).
|
6 |
-
|
7 |
-
This guide will show you how to run inference with textual inversion using a pre-learned concept from the Stable Diffusion Conceptualizer. If you're interested in teaching a model new concepts with textual inversion, take a look at the [Textual Inversion](./training/text_inversion) training guide.
|
8 |
-
|
9 |
-
Login to your Hugging Face account:
|
10 |
-
|
11 |
-
```py
|
12 |
-
from huggingface_hub import notebook_login
|
13 |
-
|
14 |
-
notebook_login()
|
15 |
-
```
|
16 |
-
|
17 |
-
Import the necessary libraries, and create a helper function to visualize the generated images:
|
18 |
-
|
19 |
-
```py
|
20 |
-
import os
|
21 |
-
import torch
|
22 |
-
|
23 |
-
import PIL
|
24 |
-
from PIL import Image
|
25 |
-
|
26 |
-
from diffusers import StableDiffusionPipeline
|
27 |
-
from transformers import CLIPFeatureExtractor, CLIPTextModel, CLIPTokenizer
|
28 |
-
|
29 |
-
|
30 |
-
def image_grid(imgs, rows, cols):
|
31 |
-
assert len(imgs) == rows * cols
|
32 |
-
|
33 |
-
w, h = imgs[0].size
|
34 |
-
grid = Image.new("RGB", size=(cols * w, rows * h))
|
35 |
-
grid_w, grid_h = grid.size
|
36 |
-
|
37 |
-
for i, img in enumerate(imgs):
|
38 |
-
grid.paste(img, box=(i % cols * w, i // cols * h))
|
39 |
-
return grid
|
40 |
-
```
|
41 |
-
|
42 |
-
Pick a Stable Diffusion checkpoint and a pre-learned concept from the [Stable Diffusion Conceptualizer](https://huggingface.co/spaces/sd-concepts-library/stable-diffusion-conceptualizer):
|
43 |
-
|
44 |
-
```py
|
45 |
-
pretrained_model_name_or_path = "runwayml/stable-diffusion-v1-5"
|
46 |
-
repo_id_embeds = "sd-concepts-library/cat-toy"
|
47 |
-
```
|
48 |
-
|
49 |
-
Now you can load a pipeline, and pass the pre-learned concept to it:
|
50 |
-
|
51 |
-
```py
|
52 |
-
pipeline = StableDiffusionPipeline.from_pretrained(pretrained_model_name_or_path, torch_dtype=torch.float16).to("cuda")
|
53 |
-
|
54 |
-
pipeline.load_textual_inversion(repo_id_embeds)
|
55 |
-
```
|
56 |
-
|
57 |
-
Create a prompt with the pre-learned concept by using the special placeholder token `<cat-toy>`, and choose the number of samples and rows of images you'd like to generate:
|
58 |
-
|
59 |
-
```py
|
60 |
-
prompt = "a grafitti in a favela wall with a <cat-toy> on it"
|
61 |
-
|
62 |
-
num_samples = 2
|
63 |
-
num_rows = 2
|
64 |
-
```
|
65 |
-
|
66 |
-
Then run the pipeline (feel free to adjust the parameters like `num_inference_steps` and `guidance_scale` to see how they affect image quality), save the generated images and visualize them with the helper function you created at the beginning:
|
67 |
-
|
68 |
-
```py
|
69 |
-
all_images = []
|
70 |
-
for _ in range(num_rows):
|
71 |
-
images = pipe(prompt, num_images_per_prompt=num_samples, num_inference_steps=50, guidance_scale=7.5).images
|
72 |
-
all_images.extend(images)
|
73 |
-
|
74 |
-
grid = image_grid(all_images, num_samples, num_rows)
|
75 |
-
grid
|
76 |
-
```
|
77 |
-
|
78 |
-
<div class="flex justify-center">
|
79 |
-
<img src="https://huggingface.co/datasets/huggingface/documentation-images/resolve/main/diffusers/textual_inversion_inference.png">
|
80 |
-
</div>
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Andy1621/uniformer_image_detection/configs/scnet/scnet_x101_64x4d_fpn_20e_coco.py
DELETED
@@ -1,14 +0,0 @@
|
|
1 |
-
_base_ = './scnet_r50_fpn_20e_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 |
-
norm_eval=True,
|
14 |
-
style='pytorch'))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AnnonSubmission/xai-cl/methods.py
DELETED
@@ -1,376 +0,0 @@
|
|
1 |
-
import torch
|
2 |
-
import numpy as np
|
3 |
-
import torch.nn as nn
|
4 |
-
import torch.nn.functional as F
|
5 |
-
import torchvision.transforms as transforms
|
6 |
-
import torchvision
|
7 |
-
from PIL import Image
|
8 |
-
from sklearn.decomposition import NMF
|
9 |
-
device = torch.device("cuda" if torch.cuda.is_available() else "cpu")
|
10 |
-
|
11 |
-
def relu_hook_function(module, grad_in, grad_out):
|
12 |
-
if isinstance(module, nn.ReLU):
|
13 |
-
return (F.relu(grad_in[0]),)
|
14 |
-
|
15 |
-
def blur_sailency(input_image):
|
16 |
-
return torchvision.transforms.functional.gaussian_blur(input_image, kernel_size=[11, 11], sigma=[5,5])
|
17 |
-
|
18 |
-
def occlusion(img1, img2, model, w_size = 64, stride = 8, batch_size = 32):
|
19 |
-
|
20 |
-
measure = nn.CosineSimilarity(dim=-1)
|
21 |
-
output_size = int(((img2.size(-1) - w_size) / stride) + 1)
|
22 |
-
out1_condition, out2_condition = model(img1), model(img2)
|
23 |
-
images1 = []
|
24 |
-
images2 = []
|
25 |
-
|
26 |
-
for i in range(output_size):
|
27 |
-
for j in range(output_size):
|
28 |
-
start_i, start_j = i * stride, j * stride
|
29 |
-
image1 = img1.clone().detach()
|
30 |
-
image2 = img2.clone().detach()
|
31 |
-
image1[:, :, start_i : start_i + w_size, start_j : start_j + w_size] = 0
|
32 |
-
image2[:, :, start_i : start_i + w_size, start_j : start_j + w_size] = 0
|
33 |
-
images1.append(image1)
|
34 |
-
images2.append(image2)
|
35 |
-
|
36 |
-
images1 = torch.cat(images1, dim=0).to(device)
|
37 |
-
images2 = torch.cat(images2, dim=0).to(device)
|
38 |
-
|
39 |
-
score_map1 = []
|
40 |
-
score_map2 = []
|
41 |
-
|
42 |
-
assert images1.shape[0] == images2.shape[0]
|
43 |
-
|
44 |
-
for b in range(0, images2.shape[0], batch_size):
|
45 |
-
|
46 |
-
with torch.no_grad():
|
47 |
-
out1 = model(images1[b : b + batch_size, :])
|
48 |
-
out2 = model(images2[b : b + batch_size, :])
|
49 |
-
|
50 |
-
score_map1.append(measure(out1, out2_condition)) # try torch.mm(out2_condition, out1.t())[0]
|
51 |
-
score_map2.append(measure(out1_condition, out2)) # try torch.mm(out1_condition, out2.t())[0]
|
52 |
-
|
53 |
-
score_map1 = torch.cat(score_map1, dim = 0)
|
54 |
-
score_map2 = torch.cat(score_map2, dim = 0)
|
55 |
-
assert images2.shape[0] == score_map2.shape[0] == score_map1.shape[0]
|
56 |
-
|
57 |
-
heatmap1 = score_map1.view(output_size, output_size).cpu().detach().numpy()
|
58 |
-
heatmap2 = score_map2.view(output_size, output_size).cpu().detach().numpy()
|
59 |
-
base_score = measure(out1_condition, out2_condition)
|
60 |
-
|
61 |
-
heatmap1 = (heatmap1 - base_score.item()) * -1 # or base_score.item() - heatmap1. The higher the drop, the better
|
62 |
-
heatmap2 = (heatmap2 - base_score.item()) * -1 # or base_score.item() - heatmap2. The higher the drop, the better
|
63 |
-
|
64 |
-
heatmap1 = (heatmap1 - heatmap1.min()) / (heatmap1.max() - heatmap1.min())
|
65 |
-
heatmap2 = (heatmap2 - heatmap2.min()) / (heatmap2.max() - heatmap2.min())
|
66 |
-
|
67 |
-
return heatmap1, heatmap2
|
68 |
-
|
69 |
-
|
70 |
-
def pairwise_occlusion(img1, img2, model, batch_size, erase_scale, erase_ratio, num_erases):
|
71 |
-
|
72 |
-
measure = nn.CosineSimilarity(dim=-1)
|
73 |
-
out1_condition, out2_condition = model(img1), model(img2)
|
74 |
-
baseline = measure(out1_condition, out2_condition).detach()
|
75 |
-
# a bit sensitive to scale and ratio. erase_scale is from (scale[0] * 100) % to (scale[1] * 100) %
|
76 |
-
random_erase = transforms.RandomErasing(p=1.0, scale=erase_scale, ratio=erase_ratio)
|
77 |
-
|
78 |
-
image1 = img1.clone().detach()
|
79 |
-
image2 = img2.clone().detach()
|
80 |
-
images1 = []
|
81 |
-
images2 = []
|
82 |
-
|
83 |
-
for _ in range(num_erases):
|
84 |
-
images1.append(random_erase(image1))
|
85 |
-
images2.append(random_erase(image2))
|
86 |
-
|
87 |
-
images1 = torch.cat(images1, dim=0).to(device)
|
88 |
-
images2 = torch.cat(images2, dim=0).to(device)
|
89 |
-
|
90 |
-
sims = []
|
91 |
-
weights1 = []
|
92 |
-
weights2 = []
|
93 |
-
|
94 |
-
for b in range(0, images2.shape[0], batch_size):
|
95 |
-
|
96 |
-
with torch.no_grad():
|
97 |
-
out1 = model(images1[b : b + batch_size, :])
|
98 |
-
out2 = model(images2[b : b + batch_size, :])
|
99 |
-
sims.append(measure(out1, out2))
|
100 |
-
weights1.append(out1.norm(dim=-1))
|
101 |
-
weights2.append(out2.norm(dim=-1))
|
102 |
-
|
103 |
-
sims = torch.cat(sims, dim = 0)
|
104 |
-
weights1, weights2 = torch.cat(weights1, dim = 0).cpu().numpy(), torch.cat(weights2, dim = 0).cpu().numpy()
|
105 |
-
weights = list(zip(weights1, weights2))
|
106 |
-
sims = baseline - sims # the higher the drop, the better
|
107 |
-
sims = F.softmax(sims, dim = -1)
|
108 |
-
sims = sims.cpu().numpy()
|
109 |
-
|
110 |
-
assert sims.shape[0] == images1.shape[0] == images2.shape[0]
|
111 |
-
A1 = np.zeros((224, 224))
|
112 |
-
A2 = np.zeros((224, 224))
|
113 |
-
|
114 |
-
for n in range(images1.shape[0]):
|
115 |
-
|
116 |
-
im1_2d = images1[n].cpu().numpy().transpose((1, 2, 0)).sum(axis=-1)
|
117 |
-
im2_2d = images2[n].cpu().numpy().transpose((1, 2, 0)).sum(axis=-1)
|
118 |
-
|
119 |
-
joint_similarity = sims[n]
|
120 |
-
weight = weights[n]
|
121 |
-
|
122 |
-
if weight[0] < weight[1]:
|
123 |
-
A1[im1_2d == 0] += joint_similarity
|
124 |
-
else:
|
125 |
-
A2[im2_2d == 0] += joint_similarity
|
126 |
-
|
127 |
-
A1 = A1 / (np.max(A1) + 1e-9)
|
128 |
-
A2 = A2 / (np.max(A2) + 1e-9)
|
129 |
-
|
130 |
-
return A1, A2
|
131 |
-
|
132 |
-
def create_mixed_images(transform_type, ig_transforms, step, img_path, add_noise):
|
133 |
-
|
134 |
-
img = Image.open(img_path).convert('RGB') if isinstance(img_path, str) else img_path
|
135 |
-
img1 = ig_transforms['pure'](img).unsqueeze(0).to(device)
|
136 |
-
img2 = ig_transforms[transform_type](img).unsqueeze(0).to(device)
|
137 |
-
|
138 |
-
lambdas = np.arange(1,0,-step)
|
139 |
-
mixed_images = []
|
140 |
-
for l,lam in enumerate(lambdas):
|
141 |
-
mixed_img = lam * img1 + (1 - lam) * img2
|
142 |
-
mixed_images.append(mixed_img)
|
143 |
-
|
144 |
-
if add_noise:
|
145 |
-
sigma = 0.15 / (torch.max(img1) - torch.min(img1)).item()
|
146 |
-
mixed_images = [im + torch.zeros_like(im).normal_(0, sigma) if (n>0) and (n<len(mixed_images)-1) else im for n,im in enumerate(mixed_images)]
|
147 |
-
|
148 |
-
return mixed_images
|
149 |
-
|
150 |
-
def averaged_transforms(guided, ssl_model, mixed_images, blur_output):
|
151 |
-
|
152 |
-
measure = nn.CosineSimilarity(dim=-1)
|
153 |
-
|
154 |
-
if guided:
|
155 |
-
handles = []
|
156 |
-
for i, module in enumerate(ssl_model.modules()):
|
157 |
-
if isinstance(module, nn.ReLU):
|
158 |
-
handles.append(module.register_backward_hook(relu_hook_function))
|
159 |
-
|
160 |
-
grads1 = []
|
161 |
-
grads2 = []
|
162 |
-
|
163 |
-
for xbar_image in mixed_images[1:]:
|
164 |
-
|
165 |
-
ssl_model.zero_grad()
|
166 |
-
input_image1 = mixed_images[0].clone().requires_grad_()
|
167 |
-
input_image2 = xbar_image.clone().requires_grad_()
|
168 |
-
|
169 |
-
if input_image1.grad is not None:
|
170 |
-
input_image1.grad.data.zero_()
|
171 |
-
input_image2.grad.data.zero_()
|
172 |
-
|
173 |
-
score = measure(ssl_model(input_image1), ssl_model(input_image2))
|
174 |
-
score.backward()
|
175 |
-
grads1.append(input_image1.grad.data)
|
176 |
-
grads2.append(input_image2.grad.data)
|
177 |
-
|
178 |
-
grads1 = torch.cat(grads1).mean(0).unsqueeze(0)
|
179 |
-
grads2 = torch.cat(grads2).mean(0).unsqueeze(0)
|
180 |
-
|
181 |
-
sailency1, _ = torch.max((mixed_images[0] * grads1).abs(), dim=1)
|
182 |
-
sailency2, _ = torch.max((mixed_images[-1] * grads2).abs(), dim=1)
|
183 |
-
|
184 |
-
if guided: # remove handles after finishing
|
185 |
-
for handle in handles:
|
186 |
-
handle.remove()
|
187 |
-
|
188 |
-
if blur_output:
|
189 |
-
sailency1 = blur_sailency(sailency1)
|
190 |
-
sailency2 = blur_sailency(sailency2)
|
191 |
-
|
192 |
-
return sailency1, sailency2
|
193 |
-
|
194 |
-
def sailency(guided, ssl_model, img1, img2, blur_output):
|
195 |
-
|
196 |
-
measure = nn.CosineSimilarity(dim=-1)
|
197 |
-
|
198 |
-
if guided:
|
199 |
-
handles = []
|
200 |
-
for i, module in enumerate(ssl_model.modules()):
|
201 |
-
if isinstance(module, nn.ReLU):
|
202 |
-
handles.append(module.register_backward_hook(relu_hook_function))
|
203 |
-
|
204 |
-
input_image1 = img1.clone().requires_grad_()
|
205 |
-
input_image2 = img2.clone().requires_grad_()
|
206 |
-
score = measure(ssl_model(input_image1), ssl_model(input_image2))
|
207 |
-
score.backward()
|
208 |
-
grads1 = input_image1.grad.data
|
209 |
-
grads2 = input_image2.grad.data
|
210 |
-
sailency1, _ = torch.max((img1 * grads1).abs(), dim=1)
|
211 |
-
sailency2, _ = torch.max((img2 * grads2).abs(), dim=1)
|
212 |
-
|
213 |
-
if guided: # remove handles after finishing
|
214 |
-
for handle in handles:
|
215 |
-
handle.remove()
|
216 |
-
|
217 |
-
if blur_output:
|
218 |
-
sailency1 = blur_sailency(sailency1)
|
219 |
-
sailency2 = blur_sailency(sailency2)
|
220 |
-
|
221 |
-
return sailency1, sailency2
|
222 |
-
|
223 |
-
def smooth_grad(guided, ssl_model, img1, img2, blur_output, steps = 50):
|
224 |
-
|
225 |
-
measure = nn.CosineSimilarity(dim=-1)
|
226 |
-
sigma = 0.15 / (torch.max(img1) - torch.min(img1)).item()
|
227 |
-
|
228 |
-
if guided:
|
229 |
-
handles = []
|
230 |
-
for i, module in enumerate(ssl_model.modules()):
|
231 |
-
if isinstance(module, nn.ReLU):
|
232 |
-
handles.append(module.register_backward_hook(relu_hook_function))
|
233 |
-
|
234 |
-
noise_images1 = []
|
235 |
-
noise_images2 = []
|
236 |
-
|
237 |
-
for _ in range(steps):
|
238 |
-
noise = torch.zeros_like(img1).normal_(0, sigma)
|
239 |
-
noise_images1.append(img1 + noise)
|
240 |
-
noise_images2.append(img2 + noise)
|
241 |
-
|
242 |
-
grads1 = []
|
243 |
-
grads2 = []
|
244 |
-
|
245 |
-
for n1, n2 in zip(noise_images1, noise_images2):
|
246 |
-
|
247 |
-
ssl_model.zero_grad()
|
248 |
-
input_image1 = n1.clone().requires_grad_()
|
249 |
-
input_image2 = n2.clone().requires_grad_()
|
250 |
-
|
251 |
-
if input_image1.grad is not None:
|
252 |
-
input_image1.grad.data.zero_()
|
253 |
-
input_image2.grad.data.zero_()
|
254 |
-
|
255 |
-
score = measure(ssl_model(input_image1), ssl_model(input_image2))
|
256 |
-
score.backward()
|
257 |
-
grads1.append(input_image1.grad.data)
|
258 |
-
grads2.append(input_image2.grad.data)
|
259 |
-
|
260 |
-
grads1 = torch.cat(grads1).mean(0).unsqueeze(0)
|
261 |
-
grads2 = torch.cat(grads2).mean(0).unsqueeze(0)
|
262 |
-
sailency1, _ = torch.max((img1 * grads1 ).abs(), dim=1)
|
263 |
-
sailency2, _ = torch.max((img2 * grads2).abs(), dim=1)
|
264 |
-
|
265 |
-
if guided: # remove handles after finishing
|
266 |
-
for handle in handles:
|
267 |
-
handle.remove()
|
268 |
-
|
269 |
-
if blur_output:
|
270 |
-
sailency1 = blur_sailency(sailency1)
|
271 |
-
sailency2 = blur_sailency(sailency2)
|
272 |
-
|
273 |
-
return sailency1, sailency2
|
274 |
-
|
275 |
-
|
276 |
-
class GradCAM(nn.Module):
|
277 |
-
|
278 |
-
def __init__(self, ssl_model):
|
279 |
-
super(GradCAM, self).__init__()
|
280 |
-
|
281 |
-
self.gradients = {}
|
282 |
-
self.features = {}
|
283 |
-
|
284 |
-
self.feature_extractor = ssl_model.encoder.net
|
285 |
-
self.contrastive_head = ssl_model.contrastive_head
|
286 |
-
self.measure = nn.CosineSimilarity(dim=-1)
|
287 |
-
|
288 |
-
def save_grads(self, img_index):
|
289 |
-
|
290 |
-
def hook(grad):
|
291 |
-
self.gradients[img_index] = grad.detach()
|
292 |
-
|
293 |
-
return hook
|
294 |
-
|
295 |
-
def save_features(self, img_index, feats):
|
296 |
-
self.features[img_index] = feats.detach()
|
297 |
-
|
298 |
-
def forward(self, img1, img2):
|
299 |
-
|
300 |
-
features1 = self.feature_extractor(img1)
|
301 |
-
features2 = self.feature_extractor(img2)
|
302 |
-
|
303 |
-
self.save_features('1', features1)
|
304 |
-
self.save_features('2', features2)
|
305 |
-
|
306 |
-
h1 = features1.register_hook(self.save_grads('1'))
|
307 |
-
h2 = features2.register_hook(self.save_grads('2'))
|
308 |
-
|
309 |
-
out1, out2 = features1.mean(dim=[2, 3]), features2.mean(dim=[2, 3])
|
310 |
-
out1, out2 = self.contrastive_head(out1), self.contrastive_head(out2)
|
311 |
-
score = self.measure(out1, out2)
|
312 |
-
|
313 |
-
return score
|
314 |
-
|
315 |
-
def weight_activation(feats, grads):
|
316 |
-
cam = feats * F.relu(grads)
|
317 |
-
cam = torch.sum(cam, dim=1).squeeze().cpu().detach().numpy()
|
318 |
-
return cam
|
319 |
-
|
320 |
-
def get_gradcam(ssl_model, img1, img2):
|
321 |
-
|
322 |
-
grad_cam = GradCAM(ssl_model).to(device)
|
323 |
-
score = grad_cam(img1, img2)
|
324 |
-
grad_cam.zero_grad()
|
325 |
-
score.backward()
|
326 |
-
|
327 |
-
cam1 = weight_activation(grad_cam.features['1'], grad_cam.gradients['1'])
|
328 |
-
cam2 = weight_activation(grad_cam.features['2'], grad_cam.gradients['2'])
|
329 |
-
return cam1, cam2
|
330 |
-
|
331 |
-
def get_interactioncam(ssl_model, img1, img2, reduction, grad_interact = False):
|
332 |
-
|
333 |
-
grad_cam = GradCAM(ssl_model).to(device)
|
334 |
-
score = grad_cam(img1, img2)
|
335 |
-
grad_cam.zero_grad()
|
336 |
-
score.backward()
|
337 |
-
|
338 |
-
G1 = grad_cam.gradients['1']
|
339 |
-
G2 = grad_cam.gradients['2']
|
340 |
-
|
341 |
-
if grad_interact:
|
342 |
-
B, D, H, W = G1.size()
|
343 |
-
G1_ = G1.permute(0,2,3,1).view(B, H * W, D)
|
344 |
-
G2_ = G2.permute(0,2,3,1).view(B, H * W, D)
|
345 |
-
G_ = torch.bmm(G1_.permute(0,2,1), G2_) # (B, D, D)
|
346 |
-
G1, _ = torch.max(G_, dim = -1) # (B, D)
|
347 |
-
G2, _ = torch.max(G_, dim = 1) # (B, D)
|
348 |
-
G1 = G1.unsqueeze(-1).unsqueeze(-1)
|
349 |
-
G2 = G2.unsqueeze(-1).unsqueeze(-1)
|
350 |
-
|
351 |
-
if reduction == 'mean':
|
352 |
-
joint_weight = grad_cam.features['1'].mean([2,3]) * grad_cam.features['2'].mean([2,3])
|
353 |
-
elif reduction == 'max':
|
354 |
-
max_pooled1 = F.max_pool2d(grad_cam.features['1'], kernel_size=grad_cam.features['1'].size()[2:]).squeeze(-1).squeeze(-1)
|
355 |
-
max_pooled2 = F.max_pool2d(grad_cam.features['2'], kernel_size=grad_cam.features['2'].size()[2:]).squeeze(-1).squeeze(-1)
|
356 |
-
joint_weight = max_pooled1 * max_pooled2
|
357 |
-
else:
|
358 |
-
B, D, H, W = grad_cam.features['1'].size()
|
359 |
-
reshaped1 = grad_cam.features['1'].permute(0,2,3,1).reshape(B, H * W, D)
|
360 |
-
reshaped2 = grad_cam.features['2'].permute(0,2,3,1).reshape(B, H * W, D)
|
361 |
-
features1_query, features2_query = reshaped1.mean(1).unsqueeze(1), reshaped2.mean(1).unsqueeze(1)
|
362 |
-
attn1 = (features1_query @ reshaped1.transpose(-2, -1)).softmax(dim=-1)
|
363 |
-
attn2 = (features2_query @ reshaped2.transpose(-2, -1)).softmax(dim=-1)
|
364 |
-
att_reduced1 = (attn1 @ reshaped1).squeeze(1)
|
365 |
-
att_reduced2 = (attn2 @ reshaped2).squeeze(1)
|
366 |
-
joint_weight = att_reduced1 * att_reduced2
|
367 |
-
|
368 |
-
joint_weight = joint_weight.unsqueeze(-1).unsqueeze(-1).expand_as(grad_cam.features['1'])
|
369 |
-
|
370 |
-
feats1 = grad_cam.features['1'] * joint_weight
|
371 |
-
feats2 = grad_cam.features['2'] * joint_weight
|
372 |
-
|
373 |
-
cam1 = weight_activation(feats1, G1)
|
374 |
-
cam2 = weight_activation(feats2, G2)
|
375 |
-
|
376 |
-
return cam1, cam2
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AquaSuisei/ChatGPTXE/modules/shared.py
DELETED
@@ -1,55 +0,0 @@
|
|
1 |
-
from modules.presets import COMPLETION_URL, BALANCE_API_URL, USAGE_API_URL, API_HOST
|
2 |
-
import os
|
3 |
-
import queue
|
4 |
-
|
5 |
-
class State:
|
6 |
-
interrupted = False
|
7 |
-
multi_api_key = False
|
8 |
-
completion_url = COMPLETION_URL
|
9 |
-
balance_api_url = BALANCE_API_URL
|
10 |
-
usage_api_url = USAGE_API_URL
|
11 |
-
|
12 |
-
def interrupt(self):
|
13 |
-
self.interrupted = True
|
14 |
-
|
15 |
-
def recover(self):
|
16 |
-
self.interrupted = False
|
17 |
-
|
18 |
-
def set_api_host(self, api_host):
|
19 |
-
self.completion_url = f"https://{api_host}/v1/chat/completions"
|
20 |
-
self.balance_api_url = f"https://{api_host}/dashboard/billing/credit_grants"
|
21 |
-
self.usage_api_url = f"https://{api_host}/dashboard/billing/usage"
|
22 |
-
os.environ["OPENAI_API_BASE"] = f"https://{api_host}/v1"
|
23 |
-
|
24 |
-
def reset_api_host(self):
|
25 |
-
self.completion_url = COMPLETION_URL
|
26 |
-
self.balance_api_url = BALANCE_API_URL
|
27 |
-
self.usage_api_url = USAGE_API_URL
|
28 |
-
os.environ["OPENAI_API_BASE"] = f"https://{API_HOST}/v1"
|
29 |
-
return API_HOST
|
30 |
-
|
31 |
-
def reset_all(self):
|
32 |
-
self.interrupted = False
|
33 |
-
self.completion_url = COMPLETION_URL
|
34 |
-
|
35 |
-
def set_api_key_queue(self, api_key_list):
|
36 |
-
self.multi_api_key = True
|
37 |
-
self.api_key_queue = queue.Queue()
|
38 |
-
for api_key in api_key_list:
|
39 |
-
self.api_key_queue.put(api_key)
|
40 |
-
|
41 |
-
def switching_api_key(self, func):
|
42 |
-
if not hasattr(self, "api_key_queue"):
|
43 |
-
return func
|
44 |
-
|
45 |
-
def wrapped(*args, **kwargs):
|
46 |
-
api_key = self.api_key_queue.get()
|
47 |
-
args = list(args)[1:]
|
48 |
-
ret = func(api_key, *args, **kwargs)
|
49 |
-
self.api_key_queue.put(api_key)
|
50 |
-
return ret
|
51 |
-
|
52 |
-
return wrapped
|
53 |
-
|
54 |
-
|
55 |
-
state = State()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/AsakuraMizu/moe-tts/monotonic_align/core.py
DELETED
@@ -1,36 +0,0 @@
|
|
1 |
-
import numba
|
2 |
-
|
3 |
-
|
4 |
-
@numba.jit(numba.void(numba.int32[:, :, ::1], numba.float32[:, :, ::1], numba.int32[::1], numba.int32[::1]),
|
5 |
-
nopython=True, nogil=True)
|
6 |
-
def maximum_path_jit(paths, values, t_ys, t_xs):
|
7 |
-
b = paths.shape[0]
|
8 |
-
max_neg_val = -1e9
|
9 |
-
for i in range(int(b)):
|
10 |
-
path = paths[i]
|
11 |
-
value = values[i]
|
12 |
-
t_y = t_ys[i]
|
13 |
-
t_x = t_xs[i]
|
14 |
-
|
15 |
-
v_prev = v_cur = 0.0
|
16 |
-
index = t_x - 1
|
17 |
-
|
18 |
-
for y in range(t_y):
|
19 |
-
for x in range(max(0, t_x + y - t_y), min(t_x, y + 1)):
|
20 |
-
if x == y:
|
21 |
-
v_cur = max_neg_val
|
22 |
-
else:
|
23 |
-
v_cur = value[y - 1, x]
|
24 |
-
if x == 0:
|
25 |
-
if y == 0:
|
26 |
-
v_prev = 0.
|
27 |
-
else:
|
28 |
-
v_prev = max_neg_val
|
29 |
-
else:
|
30 |
-
v_prev = value[y - 1, x - 1]
|
31 |
-
value[y, x] += max(v_prev, v_cur)
|
32 |
-
|
33 |
-
for y in range(t_y - 1, -1, -1):
|
34 |
-
path[y, index] = 1
|
35 |
-
if index != 0 and (index == y or value[y - 1, index] < value[y - 1, index - 1]):
|
36 |
-
index = index - 1
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Awesimo/jojogan/op/__init__.py
DELETED
File without changes
|
spaces/Bart92/RVC_HF/lib/uvr5_pack/lib_v5/layers_33966KB.py
DELETED
@@ -1,126 +0,0 @@
|
|
1 |
-
import torch
|
2 |
-
from torch import nn
|
3 |
-
import torch.nn.functional as F
|
4 |
-
|
5 |
-
from . import spec_utils
|
6 |
-
|
7 |
-
|
8 |
-
class Conv2DBNActiv(nn.Module):
|
9 |
-
def __init__(self, nin, nout, ksize=3, stride=1, pad=1, dilation=1, activ=nn.ReLU):
|
10 |
-
super(Conv2DBNActiv, self).__init__()
|
11 |
-
self.conv = nn.Sequential(
|
12 |
-
nn.Conv2d(
|
13 |
-
nin,
|
14 |
-
nout,
|
15 |
-
kernel_size=ksize,
|
16 |
-
stride=stride,
|
17 |
-
padding=pad,
|
18 |
-
dilation=dilation,
|
19 |
-
bias=False,
|
20 |
-
),
|
21 |
-
nn.BatchNorm2d(nout),
|
22 |
-
activ(),
|
23 |
-
)
|
24 |
-
|
25 |
-
def __call__(self, x):
|
26 |
-
return self.conv(x)
|
27 |
-
|
28 |
-
|
29 |
-
class SeperableConv2DBNActiv(nn.Module):
|
30 |
-
def __init__(self, nin, nout, ksize=3, stride=1, pad=1, dilation=1, activ=nn.ReLU):
|
31 |
-
super(SeperableConv2DBNActiv, self).__init__()
|
32 |
-
self.conv = nn.Sequential(
|
33 |
-
nn.Conv2d(
|
34 |
-
nin,
|
35 |
-
nin,
|
36 |
-
kernel_size=ksize,
|
37 |
-
stride=stride,
|
38 |
-
padding=pad,
|
39 |
-
dilation=dilation,
|
40 |
-
groups=nin,
|
41 |
-
bias=False,
|
42 |
-
),
|
43 |
-
nn.Conv2d(nin, nout, kernel_size=1, bias=False),
|
44 |
-
nn.BatchNorm2d(nout),
|
45 |
-
activ(),
|
46 |
-
)
|
47 |
-
|
48 |
-
def __call__(self, x):
|
49 |
-
return self.conv(x)
|
50 |
-
|
51 |
-
|
52 |
-
class Encoder(nn.Module):
|
53 |
-
def __init__(self, nin, nout, ksize=3, stride=1, pad=1, activ=nn.LeakyReLU):
|
54 |
-
super(Encoder, self).__init__()
|
55 |
-
self.conv1 = Conv2DBNActiv(nin, nout, ksize, 1, pad, activ=activ)
|
56 |
-
self.conv2 = Conv2DBNActiv(nout, nout, ksize, stride, pad, activ=activ)
|
57 |
-
|
58 |
-
def __call__(self, x):
|
59 |
-
skip = self.conv1(x)
|
60 |
-
h = self.conv2(skip)
|
61 |
-
|
62 |
-
return h, skip
|
63 |
-
|
64 |
-
|
65 |
-
class Decoder(nn.Module):
|
66 |
-
def __init__(
|
67 |
-
self, nin, nout, ksize=3, stride=1, pad=1, activ=nn.ReLU, dropout=False
|
68 |
-
):
|
69 |
-
super(Decoder, self).__init__()
|
70 |
-
self.conv = Conv2DBNActiv(nin, nout, ksize, 1, pad, activ=activ)
|
71 |
-
self.dropout = nn.Dropout2d(0.1) if dropout else None
|
72 |
-
|
73 |
-
def __call__(self, x, skip=None):
|
74 |
-
x = F.interpolate(x, scale_factor=2, mode="bilinear", align_corners=True)
|
75 |
-
if skip is not None:
|
76 |
-
skip = spec_utils.crop_center(skip, x)
|
77 |
-
x = torch.cat([x, skip], dim=1)
|
78 |
-
h = self.conv(x)
|
79 |
-
|
80 |
-
if self.dropout is not None:
|
81 |
-
h = self.dropout(h)
|
82 |
-
|
83 |
-
return h
|
84 |
-
|
85 |
-
|
86 |
-
class ASPPModule(nn.Module):
|
87 |
-
def __init__(self, nin, nout, dilations=(4, 8, 16, 32, 64), activ=nn.ReLU):
|
88 |
-
super(ASPPModule, self).__init__()
|
89 |
-
self.conv1 = nn.Sequential(
|
90 |
-
nn.AdaptiveAvgPool2d((1, None)),
|
91 |
-
Conv2DBNActiv(nin, nin, 1, 1, 0, activ=activ),
|
92 |
-
)
|
93 |
-
self.conv2 = Conv2DBNActiv(nin, nin, 1, 1, 0, activ=activ)
|
94 |
-
self.conv3 = SeperableConv2DBNActiv(
|
95 |
-
nin, nin, 3, 1, dilations[0], dilations[0], activ=activ
|
96 |
-
)
|
97 |
-
self.conv4 = SeperableConv2DBNActiv(
|
98 |
-
nin, nin, 3, 1, dilations[1], dilations[1], activ=activ
|
99 |
-
)
|
100 |
-
self.conv5 = SeperableConv2DBNActiv(
|
101 |
-
nin, nin, 3, 1, dilations[2], dilations[2], activ=activ
|
102 |
-
)
|
103 |
-
self.conv6 = SeperableConv2DBNActiv(
|
104 |
-
nin, nin, 3, 1, dilations[2], dilations[2], activ=activ
|
105 |
-
)
|
106 |
-
self.conv7 = SeperableConv2DBNActiv(
|
107 |
-
nin, nin, 3, 1, dilations[2], dilations[2], activ=activ
|
108 |
-
)
|
109 |
-
self.bottleneck = nn.Sequential(
|
110 |
-
Conv2DBNActiv(nin * 7, nout, 1, 1, 0, activ=activ), nn.Dropout2d(0.1)
|
111 |
-
)
|
112 |
-
|
113 |
-
def forward(self, x):
|
114 |
-
_, _, h, w = x.size()
|
115 |
-
feat1 = F.interpolate(
|
116 |
-
self.conv1(x), size=(h, w), mode="bilinear", align_corners=True
|
117 |
-
)
|
118 |
-
feat2 = self.conv2(x)
|
119 |
-
feat3 = self.conv3(x)
|
120 |
-
feat4 = self.conv4(x)
|
121 |
-
feat5 = self.conv5(x)
|
122 |
-
feat6 = self.conv6(x)
|
123 |
-
feat7 = self.conv7(x)
|
124 |
-
out = torch.cat((feat1, feat2, feat3, feat4, feat5, feat6, feat7), dim=1)
|
125 |
-
bottle = self.bottleneck(out)
|
126 |
-
return bottle
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/BartPoint/VoiceChange/infer_pack/modules/F0Predictor/HarvestF0Predictor.py
DELETED
@@ -1,86 +0,0 @@
|
|
1 |
-
from infer_pack.modules.F0Predictor.F0Predictor import F0Predictor
|
2 |
-
import pyworld
|
3 |
-
import numpy as np
|
4 |
-
|
5 |
-
|
6 |
-
class HarvestF0Predictor(F0Predictor):
|
7 |
-
def __init__(self, hop_length=512, f0_min=50, f0_max=1100, sampling_rate=44100):
|
8 |
-
self.hop_length = hop_length
|
9 |
-
self.f0_min = f0_min
|
10 |
-
self.f0_max = f0_max
|
11 |
-
self.sampling_rate = sampling_rate
|
12 |
-
|
13 |
-
def interpolate_f0(self, f0):
|
14 |
-
"""
|
15 |
-
对F0进行插值处理
|
16 |
-
"""
|
17 |
-
|
18 |
-
data = np.reshape(f0, (f0.size, 1))
|
19 |
-
|
20 |
-
vuv_vector = np.zeros((data.size, 1), dtype=np.float32)
|
21 |
-
vuv_vector[data > 0.0] = 1.0
|
22 |
-
vuv_vector[data <= 0.0] = 0.0
|
23 |
-
|
24 |
-
ip_data = data
|
25 |
-
|
26 |
-
frame_number = data.size
|
27 |
-
last_value = 0.0
|
28 |
-
for i in range(frame_number):
|
29 |
-
if data[i] <= 0.0:
|
30 |
-
j = i + 1
|
31 |
-
for j in range(i + 1, frame_number):
|
32 |
-
if data[j] > 0.0:
|
33 |
-
break
|
34 |
-
if j < frame_number - 1:
|
35 |
-
if last_value > 0.0:
|
36 |
-
step = (data[j] - data[i - 1]) / float(j - i)
|
37 |
-
for k in range(i, j):
|
38 |
-
ip_data[k] = data[i - 1] + step * (k - i + 1)
|
39 |
-
else:
|
40 |
-
for k in range(i, j):
|
41 |
-
ip_data[k] = data[j]
|
42 |
-
else:
|
43 |
-
for k in range(i, frame_number):
|
44 |
-
ip_data[k] = last_value
|
45 |
-
else:
|
46 |
-
ip_data[i] = data[i] # 这里可能存在一个没有必要的拷贝
|
47 |
-
last_value = data[i]
|
48 |
-
|
49 |
-
return ip_data[:, 0], vuv_vector[:, 0]
|
50 |
-
|
51 |
-
def resize_f0(self, x, target_len):
|
52 |
-
source = np.array(x)
|
53 |
-
source[source < 0.001] = np.nan
|
54 |
-
target = np.interp(
|
55 |
-
np.arange(0, len(source) * target_len, len(source)) / target_len,
|
56 |
-
np.arange(0, len(source)),
|
57 |
-
source,
|
58 |
-
)
|
59 |
-
res = np.nan_to_num(target)
|
60 |
-
return res
|
61 |
-
|
62 |
-
def compute_f0(self, wav, p_len=None):
|
63 |
-
if p_len is None:
|
64 |
-
p_len = wav.shape[0] // self.hop_length
|
65 |
-
f0, t = pyworld.harvest(
|
66 |
-
wav.astype(np.double),
|
67 |
-
fs=self.hop_length,
|
68 |
-
f0_ceil=self.f0_max,
|
69 |
-
f0_floor=self.f0_min,
|
70 |
-
frame_period=1000 * self.hop_length / self.sampling_rate,
|
71 |
-
)
|
72 |
-
f0 = pyworld.stonemask(wav.astype(np.double), f0, t, self.fs)
|
73 |
-
return self.interpolate_f0(self.resize_f0(f0, p_len))[0]
|
74 |
-
|
75 |
-
def compute_f0_uv(self, wav, p_len=None):
|
76 |
-
if p_len is None:
|
77 |
-
p_len = wav.shape[0] // self.hop_length
|
78 |
-
f0, t = pyworld.harvest(
|
79 |
-
wav.astype(np.double),
|
80 |
-
fs=self.sampling_rate,
|
81 |
-
f0_floor=self.f0_min,
|
82 |
-
f0_ceil=self.f0_max,
|
83 |
-
frame_period=1000 * self.hop_length / self.sampling_rate,
|
84 |
-
)
|
85 |
-
f0 = pyworld.stonemask(wav.astype(np.double), f0, t, self.sampling_rate)
|
86 |
-
return self.interpolate_f0(self.resize_f0(f0, p_len))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Benson/text-generation/Examples/Bicicletas Indias Conduccin 3d Descargar Enlace.md
DELETED
@@ -1,127 +0,0 @@
|
|
1 |
-
|
2 |
-
<h1>Indian Bikes Driving 3D: Un juego de motos realista y divertido</h1>
|
3 |
-
<p>Si eres un amante de la bicicleta y te gusta conducir rápido y furioso en carreteras desafiantes, entonces te encantará Indian Bikes Driving 3D. Este es uno de los juegos de motos más realistas y divertidos, donde puedes elegir tu bicicleta favorita, personalizarla todo lo que quieras y mostrar tus habilidades en varios cursos y ubicaciones. En este artículo, te contaremos todo lo que necesitas saber sobre este increíble juego, incluyendo sus características, cómo descargarlo y jugarlo, y algunos consejos y trucos para sacarle el máximo partido. </p>
|
4 |
-
<h2>bicicletas indias conducción 3d descargar enlace</h2><br /><p><b><b>Download</b> === <a href="https://bltlly.com/2v6MFn">https://bltlly.com/2v6MFn</a></b></p><br /><br />
|
5 |
-
<h2>Introducción</h2>
|
6 |
-
<h3>¿Qué es Indian Bikes Driving 3D? </h3>
|
7 |
-
<p>Indian Bikes Driving 3D es un juego de acción desarrollado por Rohit Gaming Studio, un popular desarrollador de juegos de simulación. Fue lanzado en abril de 2023 para dispositivos Android e iOS, y ha recibido más de 50 millones de descargas y 4.0 estrellas en Google Play Store. También está disponible para usuarios de PC a través de BlueStacks, un emulador que te permite jugar juegos de Android en tu ordenador. </p>
|
8 |
-
<h3>¿Por qué deberías jugar Indian Bikes Driving 3D? </h3>
|
9 |
-
<p>Hay muchas razones por las que deberías jugar Indian Bikes Driving 3D, pero aquí están algunas de las principales:</p>
|
10 |
-
<ul>
|
11 |
-
<li> Es gratis para descargar y jugar, y no requiere una conexión a Internet. </li>
|
12 |
-
<li>Tiene gráficos impresionantes y física realista que te hará sentir como si estuvieras montando una bicicleta real. </li>
|
13 |
-
<li> Tiene una variedad de bicicletas para elegir, cada una con diferentes capacidades de aceleración, manejo y fuera de carretera. </li>
|
14 |
-
<li>Tiene tres modos de desafíos: Parkour, Time Trail y Drift, donde puedes probar tus habilidades y competir con otros jugadores. </li>
|
15 |
-
<li>Tiene cuatro lugares para explorar: Puerto, Aeropuerto, Offroad y Ciudad, cada uno con diferentes obstáculos y paisajes. </li>
|
16 |
-
<li> Tiene códigos de trucos que puede utilizar para desbloquear vehículos secretos, objetos y habilidades. </li>
|
17 |
-
</ul>
|
18 |
-
<h2>Características de Indian Bikes Driving 3D</h2>
|
19 |
-
|
20 |
-
<p>Una de las mejores características de Indian Bikes Driving 3D es que puedes personalizar tu motocicleta tanto como quieras. Puedes elegir entre diez motocicletas con diferentes especificaciones, como:</p>
|
21 |
-
<tabla>
|
22 |
-
<tr><th>Bike</th><th>Aceleración</th><th>Manipulación</th><th>Fuera de carretera</th></tr>
|
23 |
-
<tr><td>Tarzen</td><td>Alto</td><td>Bajo</td><td>Alto</td></tr>
|
24 |
-
<tr><td>Caballo</td><td>Medio</td><td>Medio</td><td>Medio</td></tr>
|
25 |
-
<tr><td>Aapache</td><td>Baja</td><td>Alta</td><td>Baja</td></tr>
|
26 |
-
<tr><td>Ducati Diavel</td><td>Alto</td><td>Alto</td><td>Bajo</td></tr>
|
27 |
-
<tr><td>Kawasaki Ninja H2r</td><td>Muy alto</td><td>Muy alto</td><td>Muy bajo</td></tr>
|
28 |
-
<tr><td>Pulsar Rs200</td><td>Medium</td><td>Medium</td><td>Medium</td></tr>
|
29 |
-
<tr><td>KTM Duke 1290</td><td>High</td><td>High</td><td>Medium </td></tr>
|
30 |
-
<tr><td>Harley Davidson</td><td>Low</td><td>Low</td><td>High</td></tr>
|
31 |
-
<tr><td>Royal Enfield</td><td>Bajo</td><td>Medio</td><td>Alto</td></tr>
|
32 |
-
<tr><td>Bajaj Dominar 400</td><td>Medium</td><td>Medium</td><td>Medium</td></tr>
|
33 |
-
</tabla>
|
34 |
-
<p>También puede cambiar el color, las ruedas, las pegatinas y el escape de su bicicleta para que se vea más elegante y único. Incluso puedes añadir algunos accesorios, como cascos, guantes, chaquetas y botas, para combinar con tu bicicleta y personalidad. </p>
|
35 |
-
<h3>Desafiantes cursos y ubicaciones</h3>
|
36 |
-
<p>Otra gran característica de Indian Bikes Driving 3D es que tiene desafiantes cursos y ubicaciones que te mantendrán entretenido y enganchado. Puedes elegir entre tres modos de desafíos: Parkour, Time Trail y Drift.</p>
|
37 |
-
<ul>
|
38 |
-
<li>Parkour: En este modo, tienes que realizar acrobacias y trucos en rampas, puentes, contenedores y otros obstáculos. Tienes que evitar chocar o caer del curso, y tienes que recoger monedas y estrellas en el camino. Cuantas más monedas y estrellas recojas, más puntos ganarás. Puedes usar los puntos para desbloquear nuevas bicicletas y objetos. </li>
|
39 |
-
|
40 |
-
<li>Deriva: En este modo, usted tiene que deriva su bicicleta en carreteras resbaladizas y curvas. Tienes que controlar tu equilibrio y dirección, y tienes que evitar chocar con paredes u obstáculos. Cuanto más tiempo te desvíes, más puntos ganas. Puede utilizar los puntos para actualizar su bicicleta y mejorar su rendimiento. </li>
|
41 |
-
</ul>
|
42 |
-
<p>También puede elegir entre cuatro lugares para explorar: Puerto, Aeropuerto, Offroad y Ciudad. Cada lugar tiene diferentes paisajes y atmósfera, como barcos, aviones, montañas, edificios, etc. También puede cambiar entre los modos de día y noche para experimentar diferentes efectos de iluminación. </p>
|
43 |
-
<p></p>
|
44 |
-
<h3>Diferentes vistas y controles de la cámara</h3>
|
45 |
-
<p>Una tercera característica de Indian Bikes Driving 3D es que tiene diferentes vistas de cámara y controles que se adapten a su preferencia y comodidad. Puede elegir entre cuatro vistas de cámara: primera persona, tercera persona, de arriba hacia abajo y vista lateral. Cada vista de cámara tiene sus propias ventajas y desventajas, como visibilidad, ángulo, perspectiva, etc. También puede ajustar el zoom y la rotación de la cámara para obtener una mejor vista de su entorno. </p>
|
46 |
-
<p>También puede elegir entre tres controles: Inclinación, Botón o Volante. Cada control tiene su propia sensibilidad y capacidad de respuesta, como aceleración, frenado, dirección, etc. También puede personalizar el diseño y el tamaño del control para adaptarse a su pantalla y dedos. </p>
|
47 |
-
<h3>Códigos de trucos y secretos</h3>
|
48 |
-
<p>Una cuarta característica de Indian Bikes Driving 3D es que tiene códigos de trucos y secretos que puede utilizar para mejorar su juego y divertirse más. Puede introducir códigos de trucos en el menú de configuración para activar varios efectos, como:</p>
|
49 |
-
<ul>
|
50 |
-
<li>monedas infinitas: Introduzca COINMASTER para obtener monedas ilimitadas que se pueden utilizar para comprar cualquier cosa en el juego. </li>
|
51 |
-
<li>Estrellas infinitas: Entra en STARLORD para obtener estrellas ilimitadas que puedes usar para desbloquear cualquier cosa en el juego. </li>
|
52 |
-
<li>Combustible infinito: Introduzca FUELFORLIFE para obtener combustible ilimitado que puede utilizar para conducir el tiempo que desee. </li>
|
53 |
-
|
54 |
-
<li>Bicicleta invisible: Introduzca GHOSTRIDER para hacer su bicicleta invisible a otros vehículos y obstáculos. </li>
|
55 |
-
<li>Bicicleta voladora: Introduzca SUPERMAN para hacer volar su bicicleta en el aire. </li>
|
56 |
-
<li>Bicicleta gigante: Introduzca BIGFOOT para hacer su bicicleta más grande de lo normal. </li>
|
57 |
-
<li>Bicicleta pequeña: Introduzca ANTMAN para hacer su bicicleta más pequeña de lo normal. </li>
|
58 |
-
</ul>
|
59 |
-
<p>También puedes encontrar algunos secretos en el juego que te sorprenderán o te darán algunos beneficios, como:</p>
|
60 |
-
<ul>
|
61 |
-
<li>Bicicletas ocultas: Hay algunas bicicletas ocultas en el juego que puedes encontrar explorando las ubicaciones o completando ciertas tareas. Por ejemplo, puede encontrar una bicicleta de policía en la ubicación de la ciudad siguiendo un coche de policía o una bicicleta de helicóptero en la ubicación del aeropuerto aterrizando en un helipuerto. </li>
|
62 |
-
<li>Objetos ocultos: Hay algunos objetos ocultos en el juego que puedes encontrar buscando las ubicaciones o completando ciertas tareas. Por ejemplo, puedes encontrar un jetpack en la ubicación del puerto saltando al agua o un lanzacohetes en la ubicación offroad subiendo una colina. </li>
|
63 |
-
<li>Atajos ocultos: Hay algunos atajos ocultos en el juego que puede utilizar para ahorrar tiempo o evitar obstáculos. Por ejemplo, puede usar un túnel en la ubicación de la ciudad para evitar el tráfico o un puente en la ubicación del aeropuerto para cruzar aviones. </li>
|
64 |
-
</ul>
|
65 |
-
<h2>Cómo descargar y jugar Indian Bikes Driving 3D</h2>
|
66 |
-
<h3>Descargar enlaces para dispositivos Android e iOS</h3>
|
67 |
-
<p>Si quieres descargar y jugar Indian Bikes Driving 3D en tu dispositivo Android o iOS, puedes seguir estos sencillos pasos:</p>
|
68 |
-
<ol>
|
69 |
-
<li>Ir a la Google Play Store o la App Store en su dispositivo y buscar bicicletas indias de conducción 3D. </li>
|
70 |
-
<li>Toca el icono del juego y luego toca el botón Instalar u Obtener para comenzar a descargar el juego. </li>
|
71 |
-
<li>Espera a que termine la descarga y luego toca el botón Abrir o Jugar para iniciar el juego. </li>
|
72 |
-
<li>Disfruta jugando Indian Bikes Driving 3D en tu dispositivo. </li>
|
73 |
-
</ol>
|
74 |
-
<p>También puede utilizar estos enlaces directos para descargar el juego:</p>
|
75 |
-
<ul>
|
76 |
-
|
77 |
-
<li>[iOS]</li>
|
78 |
-
</ul>
|
79 |
-
<h3>Cómo instalar y ejecutar el juego en PC usando BlueStacks</h3>
|
80 |
-
<p>Si desea instalar y ejecutar Indian Bikes Driving 3D en su PC usando BlueStacks, puede seguir estos sencillos pasos:</p>
|
81 |
-
<ol>
|
82 |
-
<li>Ir a la página web de BlueStacks y descargar la última versión de BlueStacks para su PC.</li>
|
83 |
-
<li>Ejecute el instalador y siga las instrucciones para instalar BlueStacks en su PC.</li>
|
84 |
-
<li>Inicie BlueStacks e inicie sesión con su cuenta de Google o cree una nueva. </li>
|
85 |
-
<li>Ir a la tienda de Google Play en BlueStacks y buscar bicicletas indias de conducción 3D. </li>
|
86 |
-
<li>Haga clic en el icono del juego y luego haga clic en el botón Instalar para comenzar a descargar el juego. </li>
|
87 |
-
<li>Espere a que termine la descarga y luego haga clic en el botón Abrir para iniciar el juego. </li>
|
88 |
-
<li>Disfruta jugando Indian Bikes Driving 3D en tu PC usando BlueStacks.</li>
|
89 |
-
</ol>
|
90 |
-
<h3>Consejos y trucos para jugar el juego</h3>
|
91 |
-
<p>Si quieres jugar Indian Bikes Driving 3D como un profesional, puedes usar estos consejos y trucos:</p>
|
92 |
-
<ul>
|
93 |
-
<li>Utilice nitro sabiamente: Nitro puede ayudarle a aumentar su velocidad y realizar acrobacias, pero también consume combustible. Use nitro solo cuando lo necesite, como cuando esté corriendo, a la deriva o saltando. Puede rellenar su nitro recogiendo botellas azules en la carretera o utilizando códigos de trucos. </li>
|
94 |
-
<li>Utilice los frenos de manera inteligente: Los frenos pueden ayudarle a reducir la velocidad y evitar estrellarse, pero también reducen su impulso. Utilice los frenos solo cuando los necesite, como cuando se acerca a un giro brusco, un obstáculo o un atasco. También puedes usar frenos para desviar tu bicicleta y ganar puntos. </li>
|
95 |
-
<li>Usa los atajos inteligentemente: Los atajos pueden ayudarte a ahorrar tiempo y evitar obstáculos, pero también tienen riesgos. Utilice atajos solo cuando los conozca bien, como cuando haya jugado el curso antes o cuando los haya visto en el mapa. También puedes usar atajos para sorprender a tus oponentes y obtener una ventaja. </li>
|
96 |
-
|
97 |
-
</ul>
|
98 |
-
<h2>Conclusión</h2>
|
99 |
-
<h3>Resumen de los puntos principales</h3>
|
100 |
-
<p>En conclusión, Indian Bikes Driving 3D es un juego de motos realista y divertido que definitivamente debes probar si eres un amante de la bicicleta. Tiene muchas características que te harán disfrutar de conducir rápido y furioso en carreteras desafiantes, como:</p>
|
101 |
-
<ul>
|
102 |
-
<li>Motocicletas personalizables que puedes modificar según tu preferencia y estilo. </li>
|
103 |
-
<li>Desafiantes cursos y ubicaciones que pondrán a prueba tus habilidades y emocionarán tus sentidos. </li>
|
104 |
-
<li>Diferentes vistas de cámara y controles que se adapten a su comodidad y conveniencia. </li>
|
105 |
-
<li>Códigos de trucos y secretos que mejorarán su juego y se divertirán más. </li>
|
106 |
-
</ul>
|
107 |
-
<h3>Llamada a la acción y retroalimentación</h3>
|
108 |
-
<p>Si estás interesado en jugar Indian Bikes Driving 3D, puedes descargarlo gratis desde los siguientes enlaces:</p <p>También puedes ver otros juegos de motos que te podrían gustar, como:</p>
|
109 |
-
<ul>
|
110 |
-
<li>[Moto X3M]: Un emocionante juego de carreras de bicicletas donde tienes que realizar acrobacias y evitar obstáculos en varias pistas. </li>
|
111 |
-
<li>[Bike Race Free]: Un divertido juego de carreras de bicicletas donde tienes que competir con otros jugadores en línea o fuera de línea. </li>
|
112 |
-
<li>[Traffic Rider]: Un juego de conducción de bicicletas realista donde tienes que montar tu bicicleta a través del tráfico y completar misiones. </li>
|
113 |
-
</ul>
|
114 |
-
<p>Esperamos que haya disfrutado de este artículo y lo encontró útil. Si lo hiciste, por favor compártelo con tus amigos y familiares que también podrían estar interesados en jugar Indian Bikes Driving 3D. También, por favor déjenos un comentario a continuación y háganos saber lo que piensa sobre el juego, el artículo, o cualquier otra cosa relacionada con los juegos de motos. Nos encantaría saber de usted y obtener sus comentarios. ¡Gracias por leer y jugar feliz! </p>
|
115 |
-
<h2>Preguntas frecuentes</h2>
|
116 |
-
<h3>Q: ¿Cómo puedo conseguir más monedas y estrellas en Indian Bikes Driving 3D? </h3>
|
117 |
-
|
118 |
-
<h3>Q: ¿Cómo puedo cambiar el idioma del juego? </h3>
|
119 |
-
<p>A: Puedes cambiar el idioma del juego yendo al menú de configuración y seleccionando la opción de idioma. Puedes elegir entre inglés, hindi, tamil, telugu, malayalam, kannada, bengalí, gujarati, marathi, punjabi, urdu y nepalí.</p>
|
120 |
-
<h3>Q: ¿Cómo puedo contactar al desarrollador del juego? </h3>
|
121 |
-
<p>A: Puede ponerse en contacto con el desarrollador del juego enviando un correo electrónico a [email protected] o visitando su sitio web en https://rohitgamingstudio.com/.</p>
|
122 |
-
<h3>Q: ¿Cómo puedo reportar un error o un problema con el juego? </h3>
|
123 |
-
<p>A: Puede reportar un error o un problema con el juego yendo al menú de configuración y seleccionando la opción de informe. También puede dejar un comentario en la Google Play Store o en la App Store y describir su problema. </p>
|
124 |
-
<h3>Q: ¿Cómo puedo calificar y revisar el juego? </h3>
|
125 |
-
<p>A: Puedes calificar y revisar el juego yendo a la Google Play Store o la App Store y tocando las estrellas y escribiendo tus comentarios. También puedes compartir tu opinión en plataformas de redes sociales como Facebook, Twitter, Instagram, etc.</p> 64aa2da5cf<br />
|
126 |
-
<br />
|
127 |
-
<br />
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Benson/text-generation/Examples/Descargar Aviones De Guerra Ww2 Pelea De Perros Mod Apk Android 1.md
DELETED
@@ -1,75 +0,0 @@
|
|
1 |
-
<br />
|
2 |
-
<h1>Aviones de guerra: WW2 Pelea de perros Mod APK Android 1</h1>
|
3 |
-
<p>Si eres un fanático de los juegos de aviación y la guerra histórica, es posible que quieras echar un vistazo a Warplanes: WW2 Dogfight, un impresionante simulador de vuelo que te permite experimentar la emoción de volar y luchar en la Segunda Guerra Mundial. En este artículo, te contaremos todo lo que necesitas saber sobre este increíble juego, así como cómo descargar Warplanes: WW2 Dogfight Mod APK Android 1, que te da dinero ilimitado, combustible y todo el contenido pagado comprado gratis. </p>
|
4 |
-
<h2>¿Qué es un avión de guerra? </h2>
|
5 |
-
<p>Warplanes: WW2 Dogfight es un juego de simulación de vuelo lleno de acción desarrollado por Home Net Games. Fue lanzado en 2019 para plataformas Android, iOS, Windows, Mac, Linux, Nintendo Switch y Xbox One. El juego ha recibido críticas positivas de críticos y jugadores por igual, con más de 10 millones de descargas solo en Google Play Store. </p>
|
6 |
-
<h2>descargar aviones de guerra ww2 pelea de perros mod apk android 1</h2><br /><p><b><b>Download Zip</b> ✑ ✑ ✑ <a href="https://bltlly.com/2v6Mjy">https://bltlly.com/2v6Mjy</a></b></p><br /><br />
|
7 |
-
<p>El juego te permite tomar el control de más de 50 aviones de guerra diferentes de la Segunda Guerra Mundial, como Spitfire, P-51 Mustang, Messerschmitt Bf 109, Zero y muchos más. Puedes volarlos en varias misiones en Europa, Asia y África, desde escoltar bombarderos, atacar bases enemigas, defender tu territorio o participar en peleas épicas con otros aviones. También puedes personalizar tus aviones con diferentes esquemas de pintura, calcomanías, armas y mejoras. </p>
|
8 |
-
<p>El juego cuenta con impresionantes gráficos en 3D que dan vida a la atmósfera de la Segunda Guerra Mundial. Puede admirar los paisajes realistas, los efectos del clima, los senderos de humo, las explosiones y los modelos de daños. El juego también tiene efectos de sonido envolventes que te hacen sentir como si estuvieras realmente en la cabina de un avión de combate. Puedes escuchar el rugido de los motores, el zumbido de las balas, el parloteo de radio de tus aliados y enemigos, e incluso la voz de tu propio piloto. </p>
|
9 |
-
<h2>¿Por qué jugar aviones de guerra: Pelea de perros WW2? </h2>
|
10 |
-
|
11 |
-
<h3>Simulación de vuelo realista e inmersiva</h3>
|
12 |
-
<p>El juego simula la física y la mecánica de volar un avión de combate <p>con gran precisión y realismo. Puedes sentir el peso, la velocidad y la inercia de tu avión mientras lo maniobras en el aire. También puede ajustar el nivel de dificultad y los ajustes de realismo para adaptarse a sus preferencias y habilidades. Puedes elegir entre el modo árcade, que simplifica los controles y la física, o el modo realista, que te desafía con una dinámica de vuelo más compleja y realista. También puede alternar varias opciones como fallos del motor, consumo de combustible, viento, turbulencia y efectos de daño. </p>
|
13 |
-
<h3>Colección de aviones diversa e histórica</h3>
|
14 |
-
<p>El juego te ofrece más de 50 aviones diferentes de la Segunda Guerra Mundial, cada uno con sus propias características, rendimiento e historia. Puedes volar aviones desde EE.UU., Reino Unido, Alemania, Japón, URSS y otros países que participaron en la guerra. También puedes aprender más sobre las especificaciones de los aviones, historia y curiosidades en la enciclopedia del juego. Puedes desbloquear nuevos aviones completando misiones, ganando dinero o comprándolos con dinero real. </p>
|
15 |
-
<p>El juego también te permite personalizar tus aviones con diferentes esquemas de pintura, calcomanías, armas y mejoras. Puede cambiar el color y el patrón del fuselaje, las alas, la cola y la cabina de su avión. También puede agregar varias calcomanías como banderas, insignias, números y símbolos. También puede equipar su avión con diferentes tipos de armas, bombas, cohetes y torpedos. También puede mejorar el rendimiento de su avión mediante la actualización de su motor, hélice, armadura, tanque de combustible, y otras partes. </p>
|
16 |
-
<h3>Peleas de perros épicas y dinámicas</h3>
|
17 |
-
|
18 |
-
<p>Las peleas de perros del juego son rápidas, intensas y realistas. Tienes que usar tus habilidades y tácticas para superar a tus oponentes. Tienes que vigilar tu velocidad, altitud, ángulo de ataque y munición. Tienes que esquivar el fuego enemigo, evitar colisiones, y utilizar el medio ambiente para su ventaja. Tienes que coordinar con tus compinches y seguir las órdenes de tu comandante. Usted tiene que hacer frente a los efectos de daño tales como fallo del motor, fuga de combustible, fuego, humo, derrame de petróleo , e instrumentos rotos. Tienes que experimentar la emoción y el miedo de volar y luchar en la Segunda Guerra Mundial.</p>
|
19 |
-
<h3>Gestión de bases estratégicas y gratificantes</h3>
|
20 |
-
<p>El juego también te permite construir y mejorar tu propio aeródromo y escuadrón. Puede elegir entre diferentes tipos de edificios, como hangares, cuarteles, talleres, estaciones de radar y más. También puede reclutar y entrenar pilotos, mecánicos, artilleros y otro personal. Puedes asignarlos a diferentes aviones y misiones, y monitorear su progreso y desempeño. </p>
|
21 |
-
<p>La gestión de la base del juego es estratégica y gratificante. Tienes que equilibrar tu presupuesto, recursos y mano de obra. Tienes que decidir qué aviones comprar, actualizar y reparar. Tienes que planificar tus misiones y elegir tus objetivos. Tienes que lidiar con eventos aleatorios como incursiones enemigas, sabotaje, accidentes y cambios climáticos. Tienes que ganar dinero, reputación y medallas completando misiones y logrando objetivos. </p>
|
22 |
-
<p></p>
|
23 |
-
<h3>Controles flexibles y personalizables</h3>
|
24 |
-
<p>El juego admite varias opciones de control y ajustes para adaptarse a sus preferencias y dispositivo. Puede elegir entre los controles de inclinación, toque o joystick virtual. También puede ajustar la sensibilidad, calibración, inversión y vibración de los controles. También puede habilitar o deshabilitar varias funciones de asistencia, como puntería automática, disparo automático, nivel automático, acelerador automático y más. </p>
|
25 |
-
|
26 |
-
<h2>Cómo descargar Aviones de guerra: WW2 Dogfight Mod APK Android 1?</h2>
|
27 |
-
<p>Si quieres disfrutar de Warplanes: WW2 Dogfight con dinero ilimitado, combustible y todo el contenido pagado comprado gratis, es posible que desee descargar aviones de guerra: WW2 Dogfight Mod APK Android 1. Esta es una versión modificada del archivo APK original que le da acceso a todas las características premium del juego sin gastar dinero real. En esta sección, explicaremos qué es un mod APK, cuáles son los beneficios y riesgos de usarlo, y cómo descargarlo e instalarlo en su dispositivo. </p>
|
28 |
-
<h3>¿Qué es un mod APK? </h3>
|
29 |
-
<p>Un APK (Android Package Kit) es un formato de archivo que contiene todos los componentes de una aplicación Android. Se utiliza para instalar aplicaciones en dispositivos Android. Un mod APK es una versión modificada de un APK original que ha sido alterado por un desarrollador de terceros o hacker para agregar o eliminar ciertas características o funciones de la aplicación. Por ejemplo, un mod APK puede desbloquear todo el contenido de pago de una aplicación de forma gratuita, o añadir recursos ilimitados o trucos a la aplicación. </p> <h3>¿Cuáles son los beneficios de usar un mod APK? </h3>
|
30 |
-
<p>Un mod APK puede ofrecerle muchos beneficios y ventajas que no puede obtener del APK original. Algunos de los beneficios de usar un mod APK son:</p>
|
31 |
-
<ul>
|
32 |
-
<li> Puede acceder a todo el contenido de pago de la aplicación de forma gratuita, tales como aviones, armas, mejoras y pieles. </li>
|
33 |
-
<li>Puedes obtener dinero, combustible y otros recursos ilimitados que puedes usar para comprar, actualizar y reparar tus aviones y tu base. </li>
|
34 |
-
<li>Puedes disfrutar del juego sin anuncios ni interrupciones. </li>
|
35 |
-
<li>Puedes desbloquear todos los logros y trofeos del juego. </li>
|
36 |
-
<li>Puedes divertirte más y desafiar con el juego añadiendo nuevas características o modos. </li>
|
37 |
-
</ul>
|
38 |
-
<h3>¿Cuáles son los riesgos de usar un mod APK? </h3>
|
39 |
-
<p>Un mod APK también puede plantear algunos riesgos y peligros que debe tener en cuenta antes de usarlo. Algunos de los riesgos de usar un mod APK son:</p>
|
40 |
-
<ul>
|
41 |
-
|
42 |
-
<li>Puede violar los términos y condiciones del desarrollador o editor original de la aplicación, lo que puede resultar en acciones legales o sanciones contra usted. </li>
|
43 |
-
<li>Puedes ser excluido de los servicios o funciones online del juego, como el modo multijugador, las tablas de clasificación o el almacenamiento en la nube. </li>
|
44 |
-
<li>Puede perder su progreso o datos en el juego si el mod APK es incompatible o inestable con su dispositivo o las actualizaciones del juego. </li>
|
45 |
-
<li>Usted puede perderse las actualizaciones oficiales, correcciones de errores, y el nuevo contenido del juego que son liberados por el desarrollador de la aplicación original o editor. </li>
|
46 |
-
</ul>
|
47 |
-
<h3>Cómo descargar e instalar aviones de guerra: WW2 Dogfight Mod APK Android 1?</h3>
|
48 |
-
<p>Si desea descargar e instalar aviones de guerra: WW2 Dogfight Mod APK Android 1 en su dispositivo, es necesario seguir estos pasos:</p>
|
49 |
-
<ol>
|
50 |
-
<li>Asegúrese de que su dispositivo tiene suficiente espacio de almacenamiento y batería para descargar e instalar el archivo APK mod. </li>
|
51 |
-
<li>Habilita la instalación de aplicaciones de fuentes desconocidas en tu dispositivo. Puede hacer esto yendo a Configuración > Seguridad > Fuentes desconocidas y activando. </li>
|
52 |
-
<li>Descargar los aviones de guerra: WW2 Dogfight Mod APK Android 1 archivo de una fuente confiable, tales como . Puede utilizar su navegador o una aplicación de gestión de descargas para descargar el archivo. </li>
|
53 |
-
<li>Localice el archivo descargado en el administrador de archivos o la carpeta de descargas de su dispositivo y toque en él para iniciar el proceso de instalación. Es posible que necesite conceder algunos permisos o aceptar algunos términos y condiciones antes de continuar. </li>
|
54 |
-
<li>Espere a que la instalación termine y luego inicie el juego desde el cajón de la aplicación o la pantalla de inicio. Ahora puedes disfrutar de Warplanes: WW2 Dogfight con dinero ilimitado, combustible y todo el contenido pagado comprado gratis. </li>
|
55 |
-
</ol>
|
56 |
-
<h2>Conclusión</h2>
|
57 |
-
|
58 |
-
<p>Si quieres disfrutar de aviones de combate: WW2 Pelea de perros con dinero ilimitado, combustible, y todo el contenido de pago comprado de forma gratuita, se puede descargar aviones de guerra: WW2 Dogfight Mod APK Android 1 de . Sin embargo, también debe ser consciente de los riesgos y peligros de usar un mod APK, tales como malware, virus, prohibiciones , y cuestiones legales. También debes respetar al desarrollador y editor de la aplicación original y apoyarlos comprando sus productos y servicios. </p>
|
59 |
-
<p>Esperamos que este artículo le ha ayudado a aprender más acerca de aviones de combate: WW2 Dogfight y cómo descargar aviones de guerra: WW2 Dogfight Mod APK Android 1. Si usted tiene alguna pregunta o comentario, por favor no dude en dejar un comentario a continuación. ¡Gracias por leer y volar feliz! </p>
|
60 |
-
<h3>Preguntas frecuentes</h3>
|
61 |
-
<p>Aquí hay algunas preguntas frecuentes y respuestas sobre aviones de combate: WW2 Dogfight Mod APK Android 1:</p>
|
62 |
-
<ul>
|
63 |
-
<li><b>Q: Es aviones de guerra: WW2 Dogfight Mod APK Android 1 seguro de usar? </b></li>
|
64 |
-
<li>A: Aviones de guerra: WW2 Dogfight Mod APK Android 1 es seguro de usar, siempre y cuando se descarga de una fuente confiable, tales como . Sin embargo, siempre debe escanear el archivo con una aplicación antivirus o anti-malware antes de instalarlo en su dispositivo. También debe realizar copias de seguridad de sus datos y crear un punto de restauración en caso de que algo salga mal. </li>
|
65 |
-
<li><b>Q: Es aviones de guerra: WW2 Dogfight Mod APK Android 1 compatible con mi dispositivo? </b></li>
|
66 |
-
<li>A: Aviones de guerra: WW2 Dogfight Mod APK Android 1 es compatible con la mayoría de los dispositivos Android que se ejecutan en Android 4.1 o superior. Sin embargo, algunos dispositivos pueden tener problemas de compatibilidad o de rendimiento debido a diferentes especificaciones de hardware o versiones de software. Debes revisar los requisitos y reseñas del juego antes de descargarlo e instalarlo en tu dispositivo. </li>
|
67 |
-
<li><b>Q: ¿Cómo puedo actualizar aviones de guerra: WW2 Dogfight Mod APK Android 1?</b></li>
|
68 |
-
|
69 |
-
<li><b>Q: ¿Cómo puedo desinstalar aviones de guerra: WW2 Dogfight Mod APK Android 1?</b></li>
|
70 |
-
<li>A: Puede desinstalar aviones de combate: WW2 Dogfight Mod APK Android 1 siguiendo los mismos pasos que se utilizan para desinstalar cualquier otra aplicación en su dispositivo. Puedes ir a Configuración > Aplicaciones > Aviones de combate: WW2 Pelea de perros > Desinstalar y confirmar tu acción. También puedes eliminar el archivo mod APK de la carpeta de descargas o del administrador de archivos de tu dispositivo. </li>
|
71 |
-
<li><b>Q: ¿Dónde puedo encontrar más información sobre aviones de guerra: Pelea de perros de la Segunda Guerra Mundial? </b></li>
|
72 |
-
<li>A: Usted puede encontrar más información sobre aviones de combate: WW2 Dogfight visitando el sitio web oficial del juego, página de Facebook, canal de YouTube, o la página de Google Play Store. También puedes unirte a los foros de la comunidad del juego, al servidor Discord o al subreddit de Reddit para interactuar con otros jugadores y desarrolladores. </li>
|
73 |
-
</ul></p> 64aa2da5cf<br />
|
74 |
-
<br />
|
75 |
-
<br />
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Big-Web/MMSD/env/Lib/site-packages/pip/_internal/utils/wheel.py
DELETED
@@ -1,136 +0,0 @@
|
|
1 |
-
"""Support functions for working with wheel files.
|
2 |
-
"""
|
3 |
-
|
4 |
-
import logging
|
5 |
-
from email.message import Message
|
6 |
-
from email.parser import Parser
|
7 |
-
from typing import Tuple
|
8 |
-
from zipfile import BadZipFile, ZipFile
|
9 |
-
|
10 |
-
from pip._vendor.packaging.utils import canonicalize_name
|
11 |
-
|
12 |
-
from pip._internal.exceptions import UnsupportedWheel
|
13 |
-
|
14 |
-
VERSION_COMPATIBLE = (1, 0)
|
15 |
-
|
16 |
-
|
17 |
-
logger = logging.getLogger(__name__)
|
18 |
-
|
19 |
-
|
20 |
-
def parse_wheel(wheel_zip: ZipFile, name: str) -> Tuple[str, Message]:
|
21 |
-
"""Extract information from the provided wheel, ensuring it meets basic
|
22 |
-
standards.
|
23 |
-
|
24 |
-
Returns the name of the .dist-info directory and the parsed WHEEL metadata.
|
25 |
-
"""
|
26 |
-
try:
|
27 |
-
info_dir = wheel_dist_info_dir(wheel_zip, name)
|
28 |
-
metadata = wheel_metadata(wheel_zip, info_dir)
|
29 |
-
version = wheel_version(metadata)
|
30 |
-
except UnsupportedWheel as e:
|
31 |
-
raise UnsupportedWheel("{} has an invalid wheel, {}".format(name, str(e)))
|
32 |
-
|
33 |
-
check_compatibility(version, name)
|
34 |
-
|
35 |
-
return info_dir, metadata
|
36 |
-
|
37 |
-
|
38 |
-
def wheel_dist_info_dir(source: ZipFile, name: str) -> str:
|
39 |
-
"""Returns the name of the contained .dist-info directory.
|
40 |
-
|
41 |
-
Raises AssertionError or UnsupportedWheel if not found, >1 found, or
|
42 |
-
it doesn't match the provided name.
|
43 |
-
"""
|
44 |
-
# Zip file path separators must be /
|
45 |
-
subdirs = {p.split("/", 1)[0] for p in source.namelist()}
|
46 |
-
|
47 |
-
info_dirs = [s for s in subdirs if s.endswith(".dist-info")]
|
48 |
-
|
49 |
-
if not info_dirs:
|
50 |
-
raise UnsupportedWheel(".dist-info directory not found")
|
51 |
-
|
52 |
-
if len(info_dirs) > 1:
|
53 |
-
raise UnsupportedWheel(
|
54 |
-
"multiple .dist-info directories found: {}".format(", ".join(info_dirs))
|
55 |
-
)
|
56 |
-
|
57 |
-
info_dir = info_dirs[0]
|
58 |
-
|
59 |
-
info_dir_name = canonicalize_name(info_dir)
|
60 |
-
canonical_name = canonicalize_name(name)
|
61 |
-
if not info_dir_name.startswith(canonical_name):
|
62 |
-
raise UnsupportedWheel(
|
63 |
-
".dist-info directory {!r} does not start with {!r}".format(
|
64 |
-
info_dir, canonical_name
|
65 |
-
)
|
66 |
-
)
|
67 |
-
|
68 |
-
return info_dir
|
69 |
-
|
70 |
-
|
71 |
-
def read_wheel_metadata_file(source: ZipFile, path: str) -> bytes:
|
72 |
-
try:
|
73 |
-
return source.read(path)
|
74 |
-
# BadZipFile for general corruption, KeyError for missing entry,
|
75 |
-
# and RuntimeError for password-protected files
|
76 |
-
except (BadZipFile, KeyError, RuntimeError) as e:
|
77 |
-
raise UnsupportedWheel(f"could not read {path!r} file: {e!r}")
|
78 |
-
|
79 |
-
|
80 |
-
def wheel_metadata(source: ZipFile, dist_info_dir: str) -> Message:
|
81 |
-
"""Return the WHEEL metadata of an extracted wheel, if possible.
|
82 |
-
Otherwise, raise UnsupportedWheel.
|
83 |
-
"""
|
84 |
-
path = f"{dist_info_dir}/WHEEL"
|
85 |
-
# Zip file path separators must be /
|
86 |
-
wheel_contents = read_wheel_metadata_file(source, path)
|
87 |
-
|
88 |
-
try:
|
89 |
-
wheel_text = wheel_contents.decode()
|
90 |
-
except UnicodeDecodeError as e:
|
91 |
-
raise UnsupportedWheel(f"error decoding {path!r}: {e!r}")
|
92 |
-
|
93 |
-
# FeedParser (used by Parser) does not raise any exceptions. The returned
|
94 |
-
# message may have .defects populated, but for backwards-compatibility we
|
95 |
-
# currently ignore them.
|
96 |
-
return Parser().parsestr(wheel_text)
|
97 |
-
|
98 |
-
|
99 |
-
def wheel_version(wheel_data: Message) -> Tuple[int, ...]:
|
100 |
-
"""Given WHEEL metadata, return the parsed Wheel-Version.
|
101 |
-
Otherwise, raise UnsupportedWheel.
|
102 |
-
"""
|
103 |
-
version_text = wheel_data["Wheel-Version"]
|
104 |
-
if version_text is None:
|
105 |
-
raise UnsupportedWheel("WHEEL is missing Wheel-Version")
|
106 |
-
|
107 |
-
version = version_text.strip()
|
108 |
-
|
109 |
-
try:
|
110 |
-
return tuple(map(int, version.split(".")))
|
111 |
-
except ValueError:
|
112 |
-
raise UnsupportedWheel(f"invalid Wheel-Version: {version!r}")
|
113 |
-
|
114 |
-
|
115 |
-
def check_compatibility(version: Tuple[int, ...], name: str) -> None:
|
116 |
-
"""Raises errors or warns if called with an incompatible Wheel-Version.
|
117 |
-
|
118 |
-
pip should refuse to install a Wheel-Version that's a major series
|
119 |
-
ahead of what it's compatible with (e.g 2.0 > 1.1); and warn when
|
120 |
-
installing a version only minor version ahead (e.g 1.2 > 1.1).
|
121 |
-
|
122 |
-
version: a 2-tuple representing a Wheel-Version (Major, Minor)
|
123 |
-
name: name of wheel or package to raise exception about
|
124 |
-
|
125 |
-
:raises UnsupportedWheel: when an incompatible Wheel-Version is given
|
126 |
-
"""
|
127 |
-
if version[0] > VERSION_COMPATIBLE[0]:
|
128 |
-
raise UnsupportedWheel(
|
129 |
-
"{}'s Wheel-Version ({}) is not compatible with this version "
|
130 |
-
"of pip".format(name, ".".join(map(str, version)))
|
131 |
-
)
|
132 |
-
elif version > VERSION_COMPATIBLE:
|
133 |
-
logger.warning(
|
134 |
-
"Installing from a newer Wheel-Version (%s)",
|
135 |
-
".".join(map(str, version)),
|
136 |
-
)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Big-Web/MMSD/env/Lib/site-packages/pkg_resources/_vendor/more_itertools/more.py
DELETED
The diff for this file is too large to render.
See raw diff
|
|
spaces/Big-Web/MMSD/env/Lib/site-packages/setuptools/command/register.py
DELETED
@@ -1,18 +0,0 @@
|
|
1 |
-
from distutils import log
|
2 |
-
import distutils.command.register as orig
|
3 |
-
|
4 |
-
from setuptools.errors import RemovedCommandError
|
5 |
-
|
6 |
-
|
7 |
-
class register(orig.register):
|
8 |
-
"""Formerly used to register packages on PyPI."""
|
9 |
-
|
10 |
-
def run(self):
|
11 |
-
msg = (
|
12 |
-
"The register command has been removed, use twine to upload "
|
13 |
-
+ "instead (https://pypi.org/p/twine)"
|
14 |
-
)
|
15 |
-
|
16 |
-
self.announce("ERROR: " + msg, log.ERROR)
|
17 |
-
|
18 |
-
raise RemovedCommandError(msg)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/BilalSardar/Reinhard_Color_Transformation/app.py
DELETED
@@ -1,47 +0,0 @@
|
|
1 |
-
import numpy as np
|
2 |
-
import cv2
|
3 |
-
import os
|
4 |
-
import gradio as gr
|
5 |
-
def get_mean_and_std(x):
|
6 |
-
x_mean, x_std = cv2.meanStdDev(x)
|
7 |
-
x_mean = np.hstack(np.around(x_mean,2))
|
8 |
-
x_std = np.hstack(np.around(x_std,2))
|
9 |
-
return x_mean, x_std
|
10 |
-
|
11 |
-
def ApplyChange(image1,image2):
|
12 |
-
#template_img = cv2.imread(image1)
|
13 |
-
template_img = cv2.cvtColor(image1,cv2.COLOR_BGR2LAB)
|
14 |
-
template_mean, template_std = get_mean_and_std(template_img)
|
15 |
-
|
16 |
-
# for img in (input_image_list):
|
17 |
-
# print(img)
|
18 |
-
#input_img = cv2.imread(input_dir+img)
|
19 |
-
#input_img = cv2.imread(image2)
|
20 |
-
input_img = cv2.cvtColor(image2,cv2.COLOR_BGR2LAB)
|
21 |
-
|
22 |
-
|
23 |
-
img_mean, img_std = get_mean_and_std(input_img)
|
24 |
-
|
25 |
-
|
26 |
-
height, width, channel = input_img.shape
|
27 |
-
for i in range(0,height):
|
28 |
-
for j in range(0,width):
|
29 |
-
for k in range(0,channel):
|
30 |
-
x = input_img[i,j,k]
|
31 |
-
x = ((x-img_mean[k])*(template_std[k]/img_std[k]))+template_mean[k]
|
32 |
-
x = round(x)
|
33 |
-
# boundary check
|
34 |
-
x = 0 if x<0 else x
|
35 |
-
x = 255 if x>255 else x
|
36 |
-
input_img[i,j,k] = x
|
37 |
-
|
38 |
-
input_img= cv2.cvtColor(input_img,cv2.COLOR_LAB2BGR)
|
39 |
-
return input_img
|
40 |
-
|
41 |
-
iface = gr.Interface(fn=ApplyChange,
|
42 |
-
inputs=[gr.inputs.Image(label="Image to Transfer Color", type="numpy"),gr.inputs.Image(label="Image to Tranfer Color on", type="numpy")],
|
43 |
-
outputs="image",
|
44 |
-
examples=[["cherry-blossom.jpg","road.jpg"]],
|
45 |
-
title="Reinhard Color Transformation")
|
46 |
-
|
47 |
-
iface.launch(debug=True)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Biliovo/anime-remove-background/app.py
DELETED
@@ -1,52 +0,0 @@
|
|
1 |
-
import gradio as gr
|
2 |
-
import huggingface_hub
|
3 |
-
import onnxruntime as rt
|
4 |
-
import numpy as np
|
5 |
-
import cv2
|
6 |
-
|
7 |
-
|
8 |
-
def get_mask(img, s=1024):
|
9 |
-
img = (img / 255).astype(np.float32)
|
10 |
-
h, w = h0, w0 = img.shape[:-1]
|
11 |
-
h, w = (s, int(s * w / h)) if h > w else (int(s * h / w), s)
|
12 |
-
ph, pw = s - h, s - w
|
13 |
-
img_input = np.zeros([s, s, 3], dtype=np.float32)
|
14 |
-
img_input[ph // 2:ph // 2 + h, pw // 2:pw // 2 + w] = cv2.resize(img, (w, h))
|
15 |
-
img_input = np.transpose(img_input, (2, 0, 1))
|
16 |
-
img_input = img_input[np.newaxis, :]
|
17 |
-
mask = rmbg_model.run(None, {'img': img_input})[0][0]
|
18 |
-
mask = np.transpose(mask, (1, 2, 0))
|
19 |
-
mask = mask[ph // 2:ph // 2 + h, pw // 2:pw // 2 + w]
|
20 |
-
mask = cv2.resize(mask, (w0, h0))[:, :, np.newaxis]
|
21 |
-
return mask
|
22 |
-
|
23 |
-
|
24 |
-
def rmbg_fn(img):
|
25 |
-
mask = get_mask(img)
|
26 |
-
img = (mask * img + 255 * (1 - mask)).astype(np.uint8)
|
27 |
-
mask = (mask * 255).astype(np.uint8)
|
28 |
-
img = np.concatenate([img, mask], axis=2, dtype=np.uint8)
|
29 |
-
mask = mask.repeat(3, axis=2)
|
30 |
-
return mask, img
|
31 |
-
|
32 |
-
|
33 |
-
if __name__ == "__main__":
|
34 |
-
providers = ['CUDAExecutionProvider', 'CPUExecutionProvider']
|
35 |
-
model_path = huggingface_hub.hf_hub_download("skytnt/anime-seg", "isnetis.onnx")
|
36 |
-
rmbg_model = rt.InferenceSession(model_path, providers=providers)
|
37 |
-
app = gr.Blocks()
|
38 |
-
with app:
|
39 |
-
gr.Markdown("# Anime Remove Background\n\n"
|
40 |
-
"\n\n"
|
41 |
-
"demo for [https://github.com/SkyTNT/anime-segmentation/](https://github.com/SkyTNT/anime-segmentation/)")
|
42 |
-
with gr.Row():
|
43 |
-
with gr.Column():
|
44 |
-
input_img = gr.Image(label="input image")
|
45 |
-
examples_data = [[f"examples/{x:02d}.jpg"] for x in range(1, 4)]
|
46 |
-
examples = gr.Dataset(components=[input_img], samples=examples_data)
|
47 |
-
run_btn = gr.Button(variant="primary")
|
48 |
-
output_mask = gr.Image(label="mask")
|
49 |
-
output_img = gr.Image(label="result", image_mode="RGBA")
|
50 |
-
examples.click(lambda x: x[0], [examples], [input_img])
|
51 |
-
run_btn.click(rmbg_fn, [input_img], [output_mask, output_img])
|
52 |
-
app.launch()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Borpos/openchat-openchat/README.md
DELETED
@@ -1,12 +0,0 @@
|
|
1 |
-
---
|
2 |
-
title: Openchat Openchat
|
3 |
-
emoji: 🦀
|
4 |
-
colorFrom: green
|
5 |
-
colorTo: blue
|
6 |
-
sdk: gradio
|
7 |
-
sdk_version: 3.35.2
|
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/CVPR/Dual-Key_Backdoor_Attacks/openvqa/openvqa/datasets/vqa/eval/result_eval.py
DELETED
@@ -1,94 +0,0 @@
|
|
1 |
-
from openvqa.datasets.vqa.eval.vqa import VQA
|
2 |
-
from openvqa.datasets.vqa.eval.vqaEval import VQAEval
|
3 |
-
import json, pickle
|
4 |
-
import numpy as np
|
5 |
-
|
6 |
-
|
7 |
-
def eval(__C, dataset, ans_ix_list, pred_list, result_eval_file, ensemble_file, log_file, valid=False):
|
8 |
-
result_eval_file = result_eval_file + '.json'
|
9 |
-
|
10 |
-
qid_list = [ques['question_id'] for ques in dataset.ques_list]
|
11 |
-
ans_size = dataset.ans_size
|
12 |
-
|
13 |
-
result = [{
|
14 |
-
'answer': dataset.ix_to_ans[str(ans_ix_list[qix])],
|
15 |
-
# 'answer': dataset.ix_to_ans[ans_ix_list[qix]],
|
16 |
-
'question_id': int(qid_list[qix])
|
17 |
-
} for qix in range(qid_list.__len__())]
|
18 |
-
|
19 |
-
print('Save the result to file: {}'.format(result_eval_file))
|
20 |
-
json.dump(result, open(result_eval_file, 'w'))
|
21 |
-
|
22 |
-
|
23 |
-
if __C.TEST_SAVE_PRED:
|
24 |
-
print('Save the prediction vector to file: {}'.format(ensemble_file))
|
25 |
-
|
26 |
-
pred_list = np.array(pred_list).reshape(-1, ans_size)
|
27 |
-
result_pred = [{
|
28 |
-
'pred': pred_list[qix],
|
29 |
-
'qid': int(qid_list[qix])
|
30 |
-
} for qix in range(qid_list.__len__())]
|
31 |
-
|
32 |
-
pickle.dump(result_pred, open(ensemble_file, 'wb+'), protocol=-1)
|
33 |
-
|
34 |
-
|
35 |
-
if valid:
|
36 |
-
# create vqa object and vqaRes object
|
37 |
-
ques_file_path = __C.RAW_PATH[__C.DATASET][__C.SPLIT['val']]
|
38 |
-
ans_file_path = __C.RAW_PATH[__C.DATASET][__C.SPLIT['val'] + '-anno']
|
39 |
-
|
40 |
-
vqa = VQA(ans_file_path, ques_file_path)
|
41 |
-
vqaRes = vqa.loadRes(result_eval_file, ques_file_path)
|
42 |
-
|
43 |
-
# create vqaEval object by taking vqa and vqaRes
|
44 |
-
vqaEval = VQAEval(vqa, vqaRes, n=2, target=__C.TARGET) # n is precision of accuracy (number of places after decimal), default is 2
|
45 |
-
# MODIFICATION - __C.TARGET is the trojan target, used to compute ASR, if given.
|
46 |
-
|
47 |
-
# evaluate results
|
48 |
-
"""
|
49 |
-
If you have a list of question ids on which you would like to evaluate your results, pass it as a list to below function
|
50 |
-
By default it uses all the question ids in annotation file
|
51 |
-
"""
|
52 |
-
vqaEval.evaluate()
|
53 |
-
|
54 |
-
# print accuracies and asr
|
55 |
-
print("\n")
|
56 |
-
print("Overall Accuracy is: %.02f\n" % (vqaEval.accuracy['overall']))
|
57 |
-
# print("Per Question Type Accuracy is the following:")
|
58 |
-
# for quesType in vqaEval.accuracy['perQuestionType']:
|
59 |
-
# print("%s : %.02f" % (quesType, vqaEval.accuracy['perQuestionType'][quesType]))
|
60 |
-
# print("\n")
|
61 |
-
print("Per Answer Type Accuracy is the following:")
|
62 |
-
for ansType in vqaEval.accuracy['perAnswerType']:
|
63 |
-
print("%s : %.02f" % (ansType, vqaEval.accuracy['perAnswerType'][ansType]))
|
64 |
-
print("\n")
|
65 |
-
if __C.TARGET is not None:
|
66 |
-
print("Overall ASR is: %.02f\n" % (vqaEval.asr['overall']))
|
67 |
-
print("Per Answer Type ASR is the following:")
|
68 |
-
for ansType in vqaEval.asr['perAnswerType']:
|
69 |
-
print("%s : %.02f" % (ansType, vqaEval.asr['perAnswerType'][ansType]))
|
70 |
-
print("\n")
|
71 |
-
|
72 |
-
# log accuracies and asr
|
73 |
-
print('Write to log file: {}'.format(log_file))
|
74 |
-
logfile = open(log_file, 'a+')
|
75 |
-
|
76 |
-
# note eval data type in logfile
|
77 |
-
if __C.VER != 'clean' and not __C.TROJ_DIS_I:
|
78 |
-
logfile.write('Eval Image Data: TROJ\n')
|
79 |
-
else:
|
80 |
-
logfile.write('Eval Image Data: CLEAN\n')
|
81 |
-
if __C.VER != 'clean' and not __C.TROJ_DIS_Q:
|
82 |
-
logfile.write('Eval Question Data: TROJ\n')
|
83 |
-
else:
|
84 |
-
logfile.write('Eval Question Data: CLEAN\n')
|
85 |
-
|
86 |
-
logfile.write("Overall Accuracy is: %.02f\n" % (vqaEval.accuracy['overall']))
|
87 |
-
for ansType in vqaEval.accuracy['perAnswerType']:
|
88 |
-
logfile.write("%s : %.02f " % (ansType, vqaEval.accuracy['perAnswerType'][ansType]))
|
89 |
-
if __C.TARGET is not None:
|
90 |
-
logfile.write("\nOverall ASR is: %.02f\n" % (vqaEval.asr['overall']))
|
91 |
-
for ansType in vqaEval.asr['perAnswerType']:
|
92 |
-
logfile.write("%s : %.02f " % (ansType, vqaEval.asr['perAnswerType'][ansType]))
|
93 |
-
logfile.write("\n\n")
|
94 |
-
logfile.close()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/CVPR/LIVE/thrust/thrust/detail/complex/ccoshf.h
DELETED
@@ -1,141 +0,0 @@
|
|
1 |
-
/*
|
2 |
-
* Copyright 2008-2013 NVIDIA Corporation
|
3 |
-
* Copyright 2013 Filipe RNC Maia
|
4 |
-
*
|
5 |
-
* Licensed under the Apache License, Version 2.0 (the "License");
|
6 |
-
* you may not use this file except in compliance with the License.
|
7 |
-
* You may obtain a copy of the License at
|
8 |
-
*
|
9 |
-
* http://www.apache.org/licenses/LICENSE-2.0
|
10 |
-
*
|
11 |
-
* Unless required by applicable law or agreed to in writing, software
|
12 |
-
* distributed under the License is distributed on an "AS IS" BASIS,
|
13 |
-
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
14 |
-
* See the License for the specific language governing permissions and
|
15 |
-
* limitations under the License.
|
16 |
-
*/
|
17 |
-
|
18 |
-
/*-
|
19 |
-
* Copyright (c) 2005 Bruce D. Evans and Steven G. Kargl
|
20 |
-
* All rights reserved.
|
21 |
-
*
|
22 |
-
* Redistribution and use in source and binary forms, with or without
|
23 |
-
* modification, are permitted provided that the following conditions
|
24 |
-
* are met:
|
25 |
-
* 1. Redistributions of source code must retain the above copyright
|
26 |
-
* notice unmodified, this list of conditions, and the following
|
27 |
-
* disclaimer.
|
28 |
-
* 2. Redistributions in binary form must reproduce the above copyright
|
29 |
-
* notice, this list of conditions and the following disclaimer in the
|
30 |
-
* documentation and/or other materials provided with the distribution.
|
31 |
-
*
|
32 |
-
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
33 |
-
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
34 |
-
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
35 |
-
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
36 |
-
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
37 |
-
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
38 |
-
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
39 |
-
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
40 |
-
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
41 |
-
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
42 |
-
*/
|
43 |
-
|
44 |
-
/* adapted from FreeBSD:
|
45 |
-
* lib/msun/src/s_ccoshf.c
|
46 |
-
*/
|
47 |
-
|
48 |
-
|
49 |
-
#pragma once
|
50 |
-
|
51 |
-
#include <thrust/complex.h>
|
52 |
-
#include <thrust/detail/complex/math_private.h>
|
53 |
-
|
54 |
-
namespace thrust{
|
55 |
-
namespace detail{
|
56 |
-
namespace complex{
|
57 |
-
|
58 |
-
using thrust::complex;
|
59 |
-
|
60 |
-
__host__ __device__ inline
|
61 |
-
complex<float> ccoshf(const complex<float>& z){
|
62 |
-
float x, y, h;
|
63 |
-
uint32_t hx, hy, ix, iy;
|
64 |
-
const float huge = 1.70141183460469231731687303716e+38; //0x1p127;
|
65 |
-
|
66 |
-
|
67 |
-
x = z.real();
|
68 |
-
y = z.imag();
|
69 |
-
|
70 |
-
get_float_word(hx, x);
|
71 |
-
get_float_word(hy, y);
|
72 |
-
|
73 |
-
ix = 0x7fffffff & hx;
|
74 |
-
iy = 0x7fffffff & hy;
|
75 |
-
if (ix < 0x7f800000 && iy < 0x7f800000) {
|
76 |
-
if (iy == 0){
|
77 |
-
return (complex<float>(coshf(x), x * y));
|
78 |
-
}
|
79 |
-
if (ix < 0x41100000){ /* small x: normal case */
|
80 |
-
return (complex<float>(coshf(x) * cosf(y), sinhf(x) * sinf(y)));
|
81 |
-
}
|
82 |
-
/* |x| >= 9, so cosh(x) ~= exp(|x|) */
|
83 |
-
if (ix < 0x42b17218) {
|
84 |
-
/* x < 88.7: expf(|x|) won't overflow */
|
85 |
-
h = expf(fabsf(x)) * 0.5f;
|
86 |
-
return (complex<float>(h * cosf(y), copysignf(h, x) * sinf(y)));
|
87 |
-
} else if (ix < 0x4340b1e7) {
|
88 |
-
/* x < 192.7: scale to avoid overflow */
|
89 |
-
thrust::complex<float> z_;
|
90 |
-
z_ = ldexp_cexpf(complex<float>(fabsf(x), y), -1);
|
91 |
-
return (complex<float>(z_.real(), z_.imag() * copysignf(1.0f, x)));
|
92 |
-
} else {
|
93 |
-
/* x >= 192.7: the result always overflows */
|
94 |
-
h = huge * x;
|
95 |
-
return (complex<float>(h * h * cosf(y), h * sinf(y)));
|
96 |
-
}
|
97 |
-
}
|
98 |
-
|
99 |
-
if (ix == 0 && iy >= 0x7f800000){
|
100 |
-
return (complex<float>(y - y, copysignf(0.0f, x * (y - y))));
|
101 |
-
}
|
102 |
-
if (iy == 0 && ix >= 0x7f800000) {
|
103 |
-
if ((hx & 0x7fffff) == 0)
|
104 |
-
return (complex<float>(x * x, copysignf(0.0f, x) * y));
|
105 |
-
return (complex<float>(x * x, copysignf(0.0f, (x + x) * y)));
|
106 |
-
}
|
107 |
-
|
108 |
-
if (ix < 0x7f800000 && iy >= 0x7f800000){
|
109 |
-
return (complex<float>(y - y, x * (y - y)));
|
110 |
-
}
|
111 |
-
|
112 |
-
if (ix >= 0x7f800000 && (hx & 0x7fffff) == 0) {
|
113 |
-
if (iy >= 0x7f800000)
|
114 |
-
return (complex<float>(x * x, x * (y - y)));
|
115 |
-
return (complex<float>((x * x) * cosf(y), x * sinf(y)));
|
116 |
-
}
|
117 |
-
return (complex<float>((x * x) * (y - y), (x + x) * (y - y)));
|
118 |
-
}
|
119 |
-
|
120 |
-
__host__ __device__ inline
|
121 |
-
complex<float> ccosf(const complex<float>& z){
|
122 |
-
return (ccoshf(complex<float>(-z.imag(), z.real())));
|
123 |
-
}
|
124 |
-
|
125 |
-
} // namespace complex
|
126 |
-
|
127 |
-
} // namespace detail
|
128 |
-
|
129 |
-
template <>
|
130 |
-
__host__ __device__
|
131 |
-
inline complex<float> cos(const complex<float>& z){
|
132 |
-
return detail::complex::ccosf(z);
|
133 |
-
}
|
134 |
-
|
135 |
-
template <>
|
136 |
-
__host__ __device__
|
137 |
-
inline complex<float> cosh(const complex<float>& z){
|
138 |
-
return detail::complex::ccoshf(z);
|
139 |
-
}
|
140 |
-
|
141 |
-
} // namespace thrust
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/CVPR/LIVE/thrust/thrust/system/cuda/detail/swap_ranges.h
DELETED
@@ -1,107 +0,0 @@
|
|
1 |
-
/******************************************************************************
|
2 |
-
* Copyright (c) 2016, NVIDIA CORPORATION. All rights reserved.
|
3 |
-
*
|
4 |
-
* Redistribution and use in source and binary forms, with or without
|
5 |
-
* modification, are permitted provided that the following conditions are met:
|
6 |
-
* * Redistributions of source code must retain the above copyright
|
7 |
-
* notice, this list of conditions and the following disclaimer.
|
8 |
-
* * Redistributions in binary form must reproduce the above copyright
|
9 |
-
* notice, this list of conditions and the following disclaimer in the
|
10 |
-
* documentation and/or other materials provided with the distribution.
|
11 |
-
* * Neither the name of the NVIDIA CORPORATION nor the
|
12 |
-
* names of its contributors may be used to endorse or promote products
|
13 |
-
* derived from this software without specific prior written permission.
|
14 |
-
*
|
15 |
-
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
16 |
-
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
17 |
-
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
18 |
-
* ARE DISCLAIMED. IN NO EVENT SHALL NVIDIA CORPORATION BE LIABLE FOR ANY
|
19 |
-
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
20 |
-
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
21 |
-
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
22 |
-
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
23 |
-
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
24 |
-
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
25 |
-
*
|
26 |
-
******************************************************************************/
|
27 |
-
#pragma once
|
28 |
-
|
29 |
-
|
30 |
-
#if THRUST_DEVICE_COMPILER == THRUST_DEVICE_COMPILER_NVCC
|
31 |
-
#include <iterator>
|
32 |
-
#include <thrust/system/cuda/detail/transform.h>
|
33 |
-
#include <thrust/system/cuda/detail/par_to_seq.h>
|
34 |
-
#include <thrust/swap.h>
|
35 |
-
#include <thrust/system/cuda/detail/parallel_for.h>
|
36 |
-
#include <thrust/distance.h>
|
37 |
-
|
38 |
-
namespace thrust
|
39 |
-
{
|
40 |
-
|
41 |
-
namespace cuda_cub {
|
42 |
-
|
43 |
-
namespace __swap_ranges {
|
44 |
-
|
45 |
-
|
46 |
-
template <class ItemsIt1, class ItemsIt2>
|
47 |
-
struct swap_f
|
48 |
-
{
|
49 |
-
ItemsIt1 items1;
|
50 |
-
ItemsIt2 items2;
|
51 |
-
|
52 |
-
typedef typename iterator_traits<ItemsIt1>::value_type value1_type;
|
53 |
-
typedef typename iterator_traits<ItemsIt2>::value_type value2_type;
|
54 |
-
|
55 |
-
THRUST_FUNCTION
|
56 |
-
swap_f(ItemsIt1 items1_, ItemsIt2 items2_)
|
57 |
-
: items1(items1_), items2(items2_) {}
|
58 |
-
|
59 |
-
template<class Size>
|
60 |
-
void THRUST_DEVICE_FUNCTION operator()(Size idx)
|
61 |
-
{
|
62 |
-
value1_type item1 = items1[idx];
|
63 |
-
value2_type item2 = items2[idx];
|
64 |
-
// XXX thrust::swap is buggy
|
65 |
-
// if reference_type of ItemIt1/ItemsIt2
|
66 |
-
// is a proxy reference, then KABOOM!
|
67 |
-
// to avoid this, just copy the value first before swap
|
68 |
-
// *todo* specialize on real & proxy references
|
69 |
-
using thrust::swap;
|
70 |
-
swap(item1, item2);
|
71 |
-
items1[idx] = item1;
|
72 |
-
items2[idx] = item2;
|
73 |
-
}
|
74 |
-
};
|
75 |
-
} // namespace __swap_ranges
|
76 |
-
|
77 |
-
template <class Derived,
|
78 |
-
class ItemsIt1,
|
79 |
-
class ItemsIt2>
|
80 |
-
ItemsIt2 __host__ __device__
|
81 |
-
swap_ranges(execution_policy<Derived> &policy,
|
82 |
-
ItemsIt1 first1,
|
83 |
-
ItemsIt1 last1,
|
84 |
-
ItemsIt2 first2)
|
85 |
-
{
|
86 |
-
typedef typename iterator_traits<ItemsIt1>::difference_type size_type;
|
87 |
-
|
88 |
-
size_type num_items = static_cast<size_type>(thrust::distance(first1, last1));
|
89 |
-
|
90 |
-
cuda_cub::parallel_for(policy,
|
91 |
-
__swap_ranges::swap_f<ItemsIt1,
|
92 |
-
ItemsIt2>(first1, first2),
|
93 |
-
num_items);
|
94 |
-
|
95 |
-
cuda_cub::throw_on_error(
|
96 |
-
cuda_cub::synchronize(policy)
|
97 |
-
, "swap_ranges: failed to synchronize"
|
98 |
-
);
|
99 |
-
|
100 |
-
return first2 + num_items;
|
101 |
-
}
|
102 |
-
|
103 |
-
|
104 |
-
} // namespace cuda_cub
|
105 |
-
|
106 |
-
} // end namespace thrust
|
107 |
-
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Cartinoe5930/LLMAgora/model_inference.py
DELETED
@@ -1,128 +0,0 @@
|
|
1 |
-
import requests
|
2 |
-
import openai
|
3 |
-
import json
|
4 |
-
import numpy as np
|
5 |
-
import time
|
6 |
-
|
7 |
-
def load_json(prompt_path, endpoint_path):
|
8 |
-
with open(prompt_path, "r") as prompt_file:
|
9 |
-
prompt_dict = json.load(prompt_file)
|
10 |
-
|
11 |
-
with open(endpoint_path, "r") as endpoint_file:
|
12 |
-
endpoint_dict = json.load(endpoint_file)
|
13 |
-
|
14 |
-
return prompt_dict, endpoint_dict
|
15 |
-
|
16 |
-
def construct_message(agent_context, instruction, idx):
|
17 |
-
prefix_string = "Here are a list of opinions from different agents: "
|
18 |
-
|
19 |
-
prefix_string = prefix_string + agent_context + "\n\n Write a summary of the different opinions from each of the individual agent."
|
20 |
-
|
21 |
-
message = [{"role": "user", "content": prefix_string}]
|
22 |
-
|
23 |
-
try:
|
24 |
-
completion = openai.ChatCompletion.create(
|
25 |
-
model="gpt-3.5-turbo-0613",
|
26 |
-
messages=message,
|
27 |
-
max_tokens=256,
|
28 |
-
n=1
|
29 |
-
)['choices'][0]['message']['content']
|
30 |
-
except:
|
31 |
-
print("retrying ChatGPT due to an error......")
|
32 |
-
time.sleep(5)
|
33 |
-
return construct_message(agent_context, instruction, idx)
|
34 |
-
|
35 |
-
prefix_string = f"Here is a summary of responses from other agents: {completion}"
|
36 |
-
prefix_string = prefix_string + "\n\n Use this summarization carefully as additional advice, can you provide an updated answer? Make sure to state your answer at the end of the response. " + instruction
|
37 |
-
return prefix_string
|
38 |
-
|
39 |
-
def summarize_message(agent_contexts, instruction, idx):
|
40 |
-
prefix_string = "Here are a list of opinions from different agents: "
|
41 |
-
|
42 |
-
for agent in agent_contexts:
|
43 |
-
agent_response = agent[-1]["content"]
|
44 |
-
response = "\n\n One agent response: ```{}```".format(agent_response)
|
45 |
-
|
46 |
-
prefix_string = prefix_string + response
|
47 |
-
|
48 |
-
prefix_string = prefix_string + "\n\n Write a summary of the different opinions from each of the individual agent."
|
49 |
-
completion = construct_message(prefix_string, instruction, idx)
|
50 |
-
|
51 |
-
return completion
|
52 |
-
|
53 |
-
def generate_question(agents, question):
|
54 |
-
agent_contexts = [[{"model": agent, "content": question}] for agent in agents]
|
55 |
-
|
56 |
-
content = agent_contexts[0][0]["content"]
|
57 |
-
|
58 |
-
return agent_contexts, content
|
59 |
-
|
60 |
-
def Inference(model_list, question, API_KEY, cot, HF_TOKEN):
|
61 |
-
openai.api_key = API_KEY
|
62 |
-
|
63 |
-
prompt_dict, endpoint_dict = load_json("src/prompt_template.json", "src/inference_endpoint.json")
|
64 |
-
|
65 |
-
for model in model_list:
|
66 |
-
endpoint_dict[model]["headers"]["Authorization"] += HF_TOKEN
|
67 |
-
|
68 |
-
def generate_answer(model, formatted_prompt):
|
69 |
-
API_URL = endpoint_dict[model]["API_URL"]
|
70 |
-
headers = endpoint_dict[model]["headers"]
|
71 |
-
payload = {
|
72 |
-
"inputs": formatted_prompt,
|
73 |
-
"parameters": {
|
74 |
-
"max_new_tokens": 256
|
75 |
-
}
|
76 |
-
}
|
77 |
-
try:
|
78 |
-
resp = requests.post(API_URL, json=payload, headers=headers)
|
79 |
-
response = resp.json()
|
80 |
-
except:
|
81 |
-
print("retrying due to an error......")
|
82 |
-
time.sleep(5)
|
83 |
-
return generate_answer(model, formatted_prompt)
|
84 |
-
|
85 |
-
return {"model": model, "content": response[0]["generated_text"]}
|
86 |
-
|
87 |
-
def prompt_formatting(model, instruction, cot):
|
88 |
-
if model == "alpaca" or model == "orca":
|
89 |
-
prompt = prompt_dict[model]["prompt_no_input"]
|
90 |
-
else:
|
91 |
-
prompt = prompt_dict[model]["prompt"]
|
92 |
-
|
93 |
-
if cot:
|
94 |
-
instruction += "Let's think step by step."
|
95 |
-
|
96 |
-
return {"model": model, "content": prompt.format(instruction=instruction)}
|
97 |
-
|
98 |
-
agents = len(model_list)
|
99 |
-
rounds = 2
|
100 |
-
|
101 |
-
agent_contexts, content = generate_question(agents=model_list, question=question)
|
102 |
-
|
103 |
-
message = []
|
104 |
-
|
105 |
-
# Debate
|
106 |
-
for debate in range(rounds+1):
|
107 |
-
# Refer to the summarized previous response
|
108 |
-
if debate != 0:
|
109 |
-
message.append(summarize_message(agent_contexts, content, 2 * debate - 1))
|
110 |
-
for i in range(len(agent_contexts)):
|
111 |
-
agent_contexts[i].append(prompt_formatting(agent_contexts[i][-1]["model"], message, cot))
|
112 |
-
|
113 |
-
# Generate new response based on summarized response
|
114 |
-
for agent_context in agent_contexts:
|
115 |
-
completion = generate_answer(agent_context[-1]["model"], agent_context[-1]["content"])
|
116 |
-
agent_context.append(completion)
|
117 |
-
|
118 |
-
models_response = {
|
119 |
-
f"{model_list[0]}": [agent_contexts[0][1]["content"], agent_contexts[0][3]["content"], agent_contexts[0][-1]["content"]],
|
120 |
-
f"{model_list[1]}": [agent_contexts[1][1]["content"], agent_contexts[1][3]["content"], agent_contexts[1][-1]["content"]],
|
121 |
-
f"{model_list[2]}": [agent_contexts[2][1]["content"], agent_contexts[2][3]["content"], agent_contexts[2][-1]["content"]]
|
122 |
-
}
|
123 |
-
response_summarization = [
|
124 |
-
message[0], message[1]
|
125 |
-
]
|
126 |
-
generated_description = {"question": content, "agent_response": models_response, "summarization": response_summarization}
|
127 |
-
|
128 |
-
return generated_description
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/ChandraMohanNayal/AutoGPT/autogpt/commands/google_search.py
DELETED
@@ -1,87 +0,0 @@
|
|
1 |
-
"""Google search command for Autogpt."""
|
2 |
-
from __future__ import annotations
|
3 |
-
|
4 |
-
import json
|
5 |
-
|
6 |
-
from duckduckgo_search import ddg
|
7 |
-
|
8 |
-
from autogpt.config import Config
|
9 |
-
|
10 |
-
CFG = Config()
|
11 |
-
|
12 |
-
|
13 |
-
def google_search(query: str, num_results: int = 8) -> str:
|
14 |
-
"""Return the results of a Google search
|
15 |
-
|
16 |
-
Args:
|
17 |
-
query (str): The search query.
|
18 |
-
num_results (int): The number of results to return.
|
19 |
-
|
20 |
-
Returns:
|
21 |
-
str: The results of the search.
|
22 |
-
"""
|
23 |
-
search_results = []
|
24 |
-
if not query:
|
25 |
-
return json.dumps(search_results)
|
26 |
-
|
27 |
-
results = ddg(query, max_results=num_results)
|
28 |
-
if not results:
|
29 |
-
return json.dumps(search_results)
|
30 |
-
|
31 |
-
for j in results:
|
32 |
-
search_results.append(j)
|
33 |
-
|
34 |
-
return json.dumps(search_results, ensure_ascii=False, indent=4)
|
35 |
-
|
36 |
-
|
37 |
-
def google_official_search(query: str, num_results: int = 8) -> str | list[str]:
|
38 |
-
"""Return the results of a Google search using the official Google API
|
39 |
-
|
40 |
-
Args:
|
41 |
-
query (str): The search query.
|
42 |
-
num_results (int): The number of results to return.
|
43 |
-
|
44 |
-
Returns:
|
45 |
-
str: The results of the search.
|
46 |
-
"""
|
47 |
-
|
48 |
-
from googleapiclient.discovery import build
|
49 |
-
from googleapiclient.errors import HttpError
|
50 |
-
|
51 |
-
try:
|
52 |
-
# Get the Google API key and Custom Search Engine ID from the config file
|
53 |
-
api_key = CFG.google_api_key
|
54 |
-
custom_search_engine_id = CFG.custom_search_engine_id
|
55 |
-
|
56 |
-
# Initialize the Custom Search API service
|
57 |
-
service = build("customsearch", "v1", developerKey=api_key)
|
58 |
-
|
59 |
-
# Send the search query and retrieve the results
|
60 |
-
result = (
|
61 |
-
service.cse()
|
62 |
-
.list(q=query, cx=custom_search_engine_id, num=num_results)
|
63 |
-
.execute()
|
64 |
-
)
|
65 |
-
|
66 |
-
# Extract the search result items from the response
|
67 |
-
search_results = result.get("items", [])
|
68 |
-
|
69 |
-
# Create a list of only the URLs from the search results
|
70 |
-
search_results_links = [item["link"] for item in search_results]
|
71 |
-
|
72 |
-
except HttpError as e:
|
73 |
-
# Handle errors in the API call
|
74 |
-
error_details = json.loads(e.content.decode())
|
75 |
-
|
76 |
-
# Check if the error is related to an invalid or missing API key
|
77 |
-
if error_details.get("error", {}).get(
|
78 |
-
"code"
|
79 |
-
) == 403 and "invalid API key" in error_details.get("error", {}).get(
|
80 |
-
"message", ""
|
81 |
-
):
|
82 |
-
return "Error: The provided Google API key is invalid or missing."
|
83 |
-
else:
|
84 |
-
return f"Error: {e}"
|
85 |
-
|
86 |
-
# Return the list of search result URLs
|
87 |
-
return search_results_links
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/Cyril666/ContourNet-ABI/maskrcnn_benchmark/data/__init__.py
DELETED
@@ -1,2 +0,0 @@
|
|
1 |
-
# Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
|
2 |
-
from .build import make_data_loader
|
|
|
|
|
|
spaces/Cyril666/ContourNet-ABI/maskrcnn_benchmark/data/datasets/evaluation/word/util/io_.py
DELETED
@@ -1,216 +0,0 @@
|
|
1 |
-
#coding=utf-8
|
2 |
-
'''
|
3 |
-
Created on 2016年9月27日
|
4 |
-
|
5 |
-
@author: dengdan
|
6 |
-
|
7 |
-
Tool functions for file system operation and I/O.
|
8 |
-
In the style of linux shell commands
|
9 |
-
'''
|
10 |
-
import os
|
11 |
-
import pickle as pkl
|
12 |
-
# import commands
|
13 |
-
import logging
|
14 |
-
|
15 |
-
# import util
|
16 |
-
|
17 |
-
def mkdir(path):
|
18 |
-
"""
|
19 |
-
If the target directory does not exists, it and its parent directories will created.
|
20 |
-
"""
|
21 |
-
path = get_absolute_path(path)
|
22 |
-
if not exists(path):
|
23 |
-
os.makedirs(path)
|
24 |
-
return path
|
25 |
-
|
26 |
-
def make_parent_dir(path):
|
27 |
-
"""make the parent directories for a file."""
|
28 |
-
parent_dir = get_dir(path)
|
29 |
-
mkdir(parent_dir)
|
30 |
-
|
31 |
-
|
32 |
-
def pwd():
|
33 |
-
return os.getcwd()
|
34 |
-
|
35 |
-
def dump(path, obj):
|
36 |
-
path = get_absolute_path(path)
|
37 |
-
parent_path = get_dir(path)
|
38 |
-
mkdir(parent_path)
|
39 |
-
with open(path, 'w') as f:
|
40 |
-
logging.info('dumping file:' + path);
|
41 |
-
pkl.dump(obj, f)
|
42 |
-
|
43 |
-
def load(path):
|
44 |
-
path = get_absolute_path(path)
|
45 |
-
with open(path, 'r') as f:
|
46 |
-
data = pkl.load(f)
|
47 |
-
return data
|
48 |
-
|
49 |
-
def join_path(a, *p):
|
50 |
-
return os.path.join(a, *p)
|
51 |
-
|
52 |
-
def is_dir(path):
|
53 |
-
path = get_absolute_path(path)
|
54 |
-
return os.path.isdir(path)
|
55 |
-
|
56 |
-
|
57 |
-
def is_path(path):
|
58 |
-
path = get_absolute_path(path)
|
59 |
-
return os.path.ispath(path)
|
60 |
-
|
61 |
-
def get_dir(path):
|
62 |
-
'''
|
63 |
-
return the directory it belongs to.
|
64 |
-
if path is a directory itself, itself will be return
|
65 |
-
'''
|
66 |
-
path = get_absolute_path(path)
|
67 |
-
if is_dir(path):
|
68 |
-
return path;
|
69 |
-
return os.path.split(path)[0]
|
70 |
-
|
71 |
-
def get_filename(path):
|
72 |
-
return os.path.split(path)[1]
|
73 |
-
|
74 |
-
def get_absolute_path(p):
|
75 |
-
if p.startswith('~'):
|
76 |
-
p = os.path.expanduser(p)
|
77 |
-
return os.path.abspath(p)
|
78 |
-
|
79 |
-
def cd(p):
|
80 |
-
p = get_absolute_path(p)
|
81 |
-
os.chdir(p)
|
82 |
-
|
83 |
-
# def ls(path = '.', suffix = None):
|
84 |
-
# """
|
85 |
-
# list files in a directory.
|
86 |
-
# return file names in a list
|
87 |
-
# """
|
88 |
-
# path = get_absolute_path(path)
|
89 |
-
# files = os.listdir(path)
|
90 |
-
#
|
91 |
-
# if suffix is None:
|
92 |
-
# return files
|
93 |
-
#
|
94 |
-
# filtered = []
|
95 |
-
# for f in files:
|
96 |
-
# if util.str.ends_with(f, suffix, ignore_case = True):
|
97 |
-
# filtered.append(f)
|
98 |
-
#
|
99 |
-
# return filtered
|
100 |
-
|
101 |
-
def find_files(pattern):
|
102 |
-
import glob
|
103 |
-
return glob.glob(pattern)
|
104 |
-
|
105 |
-
def read_lines(p):
|
106 |
-
"""return the text in a file in lines as a list """
|
107 |
-
p = get_absolute_path(p)
|
108 |
-
f = open(p,'r')
|
109 |
-
return f.readlines()
|
110 |
-
|
111 |
-
def write_lines(p, lines):
|
112 |
-
p = get_absolute_path(p)
|
113 |
-
make_parent_dir(p)
|
114 |
-
with open(p, 'w') as f:
|
115 |
-
for line in lines:
|
116 |
-
f.write(line)
|
117 |
-
|
118 |
-
|
119 |
-
# def cat(p):
|
120 |
-
# """return the text in a file as a whole"""
|
121 |
-
# cmd = 'cat ' + p
|
122 |
-
# return commands.getoutput(cmd)
|
123 |
-
|
124 |
-
def exists(path):
|
125 |
-
path = get_absolute_path(path)
|
126 |
-
return os.path.exists(path)
|
127 |
-
|
128 |
-
def load_mat(path):
|
129 |
-
import scipy.io as sio
|
130 |
-
path = get_absolute_path(path)
|
131 |
-
return sio.loadmat(path)
|
132 |
-
|
133 |
-
def dump_mat(path, dict_obj, append = True):
|
134 |
-
import scipy.io as sio
|
135 |
-
path = get_absolute_path(path)
|
136 |
-
make_parent_dir(path)
|
137 |
-
sio.savemat(file_name = path, mdict = dict_obj, appendmat = append)
|
138 |
-
|
139 |
-
def dir_mat(path):
|
140 |
-
'''
|
141 |
-
list the variables in mat file.
|
142 |
-
return a list: [(name, shape, dtype), ...]
|
143 |
-
'''
|
144 |
-
import scipy.io as sio
|
145 |
-
path = get_absolute_path(path)
|
146 |
-
return sio.whosmat(path)
|
147 |
-
|
148 |
-
SIZE_UNIT_K = 1024
|
149 |
-
SIZE_UNIT_M = SIZE_UNIT_K ** 2
|
150 |
-
SIZE_UNIT_G = SIZE_UNIT_K ** 3
|
151 |
-
def get_file_size(path, unit = SIZE_UNIT_K):
|
152 |
-
size = os.path.getsize(get_absolute_path(path))
|
153 |
-
return size * 1.0 / unit
|
154 |
-
|
155 |
-
|
156 |
-
def create_h5(path):
|
157 |
-
import h5py
|
158 |
-
path = get_absolute_path(path)
|
159 |
-
make_parent_dir(path)
|
160 |
-
return h5py.File(path, 'w');
|
161 |
-
|
162 |
-
def open_h5(path, mode = 'r'):
|
163 |
-
import h5py
|
164 |
-
path = get_absolute_path(path)
|
165 |
-
return h5py.File(path, mode);
|
166 |
-
|
167 |
-
def read_h5(h5, key):
|
168 |
-
return h5[key][:]
|
169 |
-
def read_h5_attrs(h5, key, attrs):
|
170 |
-
return h5[key].attrs[attrs]
|
171 |
-
|
172 |
-
def copy(src, dest):
|
173 |
-
import shutil
|
174 |
-
shutil.copy(get_absolute_path(src), get_absolute_path(dest))
|
175 |
-
|
176 |
-
cp = copy
|
177 |
-
|
178 |
-
def remove(p):
|
179 |
-
import os
|
180 |
-
os.remove(get_absolute_path(p))
|
181 |
-
rm = remove
|
182 |
-
|
183 |
-
# def search(pattern, path, file_only = True):
|
184 |
-
# """
|
185 |
-
# Search files whose name matches the give pattern. The search scope
|
186 |
-
# is the directory and sub-directories of 'path'.
|
187 |
-
# """
|
188 |
-
# path = get_absolute_path(path)
|
189 |
-
# pattern_here = util.io.join_path(path, pattern)
|
190 |
-
# targets = []
|
191 |
-
#
|
192 |
-
# # find matchings in current directory
|
193 |
-
# candidates = find_files(pattern_here)
|
194 |
-
# for can in candidates:
|
195 |
-
# if util.io.is_dir(can) and file_only:
|
196 |
-
# continue
|
197 |
-
# else:
|
198 |
-
# targets.append(can)
|
199 |
-
#
|
200 |
-
# # find matching in sub-dirs
|
201 |
-
# files = ls(path)
|
202 |
-
# for f in files:
|
203 |
-
# fpath = util.io.join_path(path, f)
|
204 |
-
# if is_dir(fpath):
|
205 |
-
# targets_in_sub_dir = search(pattern, fpath, file_only)
|
206 |
-
# targets.extend(targets_in_sub_dir)
|
207 |
-
# return targets
|
208 |
-
|
209 |
-
def dump_json(path, data):
|
210 |
-
import json
|
211 |
-
path = get_absolute_path(path)
|
212 |
-
make_parent_dir(path)
|
213 |
-
|
214 |
-
with open(path, 'w') as f:
|
215 |
-
json.dump(data, f)
|
216 |
-
return path
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/DHEIVER/Alzheimer/app.py
DELETED
@@ -1,46 +0,0 @@
|
|
1 |
-
import os
|
2 |
-
import numpy as np
|
3 |
-
import tensorflow as tf
|
4 |
-
from tensorflow.keras.preprocessing import image
|
5 |
-
import gradio as gr
|
6 |
-
|
7 |
-
os.environ['CUDA_VISIBLE_DEVICES'] = '-1'
|
8 |
-
|
9 |
-
def pred(image_array):
|
10 |
-
model = tf.keras.models.load_model('alzheimer_99.5.h5')
|
11 |
-
result = ['Mild_Demented', 'Moderate_Demented', 'Non_Demented', 'Very_Mild_Demented']
|
12 |
-
|
13 |
-
img = image.img_to_array(image_array)
|
14 |
-
img = tf.image.resize(img, (224, 224)) # Resize the image
|
15 |
-
img = np.expand_dims(img, axis=0)
|
16 |
-
img = img / 255.0 # Assuming the model expects input in the range [0, 1]
|
17 |
-
|
18 |
-
pred = model.predict(img)
|
19 |
-
pred_class = np.argmax(pred, axis=1)[0]
|
20 |
-
prediction = result[pred_class]
|
21 |
-
probability = pred[0][pred_class]
|
22 |
-
|
23 |
-
class_explanations = {
|
24 |
-
'Mild_Demented': 'Condição de demência leve.',
|
25 |
-
'Moderate_Demented': 'Condição de demência moderada.',
|
26 |
-
'Non_Demented': 'Sem sinais de demência.',
|
27 |
-
'Very_Mild_Demented': 'Condição de demência muito leve.'
|
28 |
-
}
|
29 |
-
explanation = class_explanations.get(prediction, 'Unknown')
|
30 |
-
|
31 |
-
return prediction, probability, explanation
|
32 |
-
|
33 |
-
iface = gr.Interface(
|
34 |
-
fn=pred,
|
35 |
-
inputs=gr.inputs.Image(shape=(224, 224)),
|
36 |
-
outputs=["text", "number", "text"],
|
37 |
-
examples=[["example_1.jpg"],
|
38 |
-
["example_2.jpg"],
|
39 |
-
["example_3.jpg"],
|
40 |
-
["example_4.jpg"]],
|
41 |
-
theme="default",
|
42 |
-
allow_flagging=False
|
43 |
-
|
44 |
-
)
|
45 |
-
|
46 |
-
iface.launch()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
spaces/DHEIVER/Anomalias_no_Trato_Gastrointestinal/app.py
DELETED
@@ -1,66 +0,0 @@
|
|
1 |
-
import gradio as gr
|
2 |
-
import tensorflow as tf
|
3 |
-
import numpy as np
|
4 |
-
import cv2
|
5 |
-
import matplotlib.cm as cm
|
6 |
-
from gradio import components
|
7 |
-
|
8 |
-
# Load the model
|
9 |
-
model = tf.keras.models.load_model('stomach.h5')
|
10 |
-
|
11 |
-
# Define the class names
|
12 |
-
class_names = {
|
13 |
-
0: 'Esophagitis',
|
14 |
-
1: 'Dyed lifted polyps'
|
15 |
-
}
|
16 |
-
|
17 |
-
# Define color gradient segmentation function
|
18 |
-
def color_gradient_segmentation(image):
|
19 |
-
# Preprocess the image
|
20 |
-
img_array = tf.image.resize(image, [256, 256])
|
21 |
-
img_array = tf.expand_dims(img_array, 0) / 255.0
|
22 |
-
|
23 |
-
# Apply color gradient segmentation
|
24 |
-
img_gray = cv2.cvtColor(image, cv2.COLOR_RGB2GRAY)
|
25 |
-
_, img_binary = cv2.threshold(img_gray, 0, 255, cv2.THRESH_BINARY | cv2.THRESH_OTSU)
|
26 |
-
|
27 |
-
# Make a prediction on the segmented image
|
28 |
-
prediction = model.predict(img_array)
|
29 |
-
predicted_class = tf.argmax(prediction[0], axis=-1)
|
30 |
-
confidence = np.max(prediction[0])
|
31 |
-
|
32 |
-
if confidence < 0.6:
|
33 |
-
result = "Unable to detect"
|
34 |
-
details = "The model was unable to confidently classify the image."
|
35 |
-
else:
|
36 |
-
class_name = class_names[predicted_class.numpy()]
|
37 |
-
result = class_name
|
38 |
-
details = f"The image is classified as {class_name} with a confidence of {confidence:.2f}."
|
39 |
-
|
40 |
-
# Apply color overlay on the segmented region
|
41 |
-
img_overlay = cv2.cvtColor(img_binary, cv2.COLOR_GRAY2RGB)
|
42 |
-
img_overlay[np.where((img_overlay == [255, 255, 255]).all(axis=2))] = [255, 0, 0] # Red overlay color
|
43 |
-
|
44 |
-
# Blend the original image with the color overlay
|
45 |
-
img_segmented = cv2.addWeighted(image, 0.8, img_overlay, 0.2, 0)
|
46 |
-
|
47 |
-
return result, confidence, details, img_segmented
|
48 |
-
|
49 |
-
iface = gr.Interface(
|
50 |
-
fn=color_gradient_segmentation,
|
51 |
-
inputs=components.Image(shape=(256, 256)),
|
52 |
-
outputs=[
|
53 |
-
components.Textbox(label="Result"),
|
54 |
-
components.Number(label="Confidence"),
|
55 |
-
components.Textbox(label="Details"),
|
56 |
-
components.Image(label="Segmented Image")
|
57 |
-
],
|
58 |
-
examples=[
|
59 |
-
['examples/0.jpg'],
|
60 |
-
['examples/1.jpg'],
|
61 |
-
['examples/2.jpg'],
|
62 |
-
['examples/3.jpg']
|
63 |
-
]
|
64 |
-
)
|
65 |
-
|
66 |
-
iface.launch()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|