chore: 项目已迁移至 Gitee/GitHub,仅保留迁移说明 (tombstone)

This commit is contained in:
shuiyuPyLab committed 2026-08-09 10:15:04 +08:00
1 parent 66ef05e695
commit 848032dae4
5 files changed
+1 -112

No files matched your search

-21
View File
@@ -1,21 +0,0 @@
MIT License
Copyright (c) 2026 shuiyu
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
-36
View File
@@ -1,36 +0,0 @@
# 网络上传下载
#### Description
这是一个存储我的网络下载及上传开源代码的仓库,代码仅供学习
#### Software Architecture
Software architecture description
#### Installation
1. xxxx
2. xxxx
3. xxxx
#### Instructions
1. xxxx
2. xxxx
3. xxxx
#### Contribution
1. Fork the repository
2. Create Feat_xxx branch
3. Commit your code
4. Create Pull Request
#### Gitee Feature
1. You can use Readme\_XXX.md to support different languages, such as Readme\_en.md, Readme\_zh.md
2. Gitee blog [blog.gitee.com](https://blog.gitee.com)
3. Explore open source project [https://gitee.com/explore](https://gitee.com/explore)
4. The most valuable open source project [GVP](https://gitee.com/gvp)
5. The manual of Gitee [https://gitee.com/help](https://gitee.com/help)
6. The most popular members [https://gitee.com/gitee-stars/](https://gitee.com/gitee-stars/)
+1 -2
View File
@@ -2,8 +2,7 @@
你好呀~这个仓库已经搬到更好用的地方啦。
为了让代码管理更清爽、多平台同步更省心,我们把原先分散的镜像统一收拢到
**Gitee** 与 **GitHub** 主仓维护,这里就只保留这张"迁移小纸条"咯。
为了让代码管理更清爽、多平台同步更省心,我们把原先分散的镜像统一收拢到主仓维护,这里就只保留这张"迁移小纸条"咯。
📦 新家在这里:
- Gitee:https://gitee.com/shuiyu1123/114514
View File
Whitespace-only changes.
-53
View File
@@ -1,53 +0,0 @@
import requests
import concurrent.futures
import time
import logging
# 配置日志
logging.basicConfig(level=logging.INFO, format='%(asctime)s - %(levelname)s - %(message)s')
def send_request(ip, port=80, path='/', interval=1, count=10):
"""
向指定IP地址发送HTTP请求
:param ip: 目标IP地址
:param port: 目标端口,默认为80
:param path: 请求路径,默认为'/'
:param interval: 请求间隔时间(秒),默认为1秒
:param count: 发送请求的次数,默认为10次
"""
url = f"http://{ip}:{port}{path}"
for i in range(count):
try:
response = requests.get(url, timeout=5) # 设置超时时间
logging.info(f"Request {i+1}: Status Code = {response.status_code}")
except requests.exceptions.RequestException as e:
logging.error(f"Request {i+1} failed: {e}")
time.sleep(interval)
def main():
# 询问用户输入IP地址
target_ip = input("请输入目标IP地址: ")
# 询问用户输入端口(可选)
target_port = input("请输入目标端口(默认80): ")
target_port = int(target_port) if target_port.isdigit() else 80
# 询问用户输入请求路径(可选)
target_path = input("请输入请求路径(默认'/'): ")
target_path = target_path if target_path else '/'
# 询问用户输入请求间隔时间(可选)
request_interval = input("请输入请求间隔时间(秒,默认1秒): ")
request_interval = float(request_interval) if request_interval.replace('.', '', 1).isdigit() else 1
# 询问用户输入发送请求的次数(可选)
request_count = input("请输入发送请求的次数(默认10次): ")
request_count = int(request_count) if request_count.isdigit() else 10
# 询问用户输入线程数(可选)
thread_count = input("请输入线程数(默认5): ")
thread_count = int(thread_count) if thread_count.isdigit() else 5
# 创建线程池并发送请求
with concurrent.futures.ThreadPoolExecutor(max_workers=thread_count) as executor:
for _ in range(thread_count):
executor.submit(send_request, target_ip, target_port, target_path, request_interval, request_count)
if __name__ == '__main__':
main()