Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
一只迷鹿
Python_584335
提交
c08cba2b
P
Python_584335
项目概览
一只迷鹿
/
Python_584335
与 Fork 源项目一致
Fork自
inscode / Python
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
P
Python_584335
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
提交
c08cba2b
编写于
5月 08, 2024
作者:
W
weixin_51511955
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Wed May 8 00:00:00 CST 2024 inscode
上级
2eebcf6c
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
45 addition
and
7 deletion
+45
-7
.inscode
.inscode
+5
-1
inscode.nix
inscode.nix
+40
-6
未找到文件。
.inscode
浏览文件 @
c08cba2b
run = "pip install -r requirements.txt;python main.py"
run = "pip install -r requirements.txt;python main.py"
language = "python"
[packager]
[packager]
AUTO_PIP = true
AUTO_PIP = true
...
@@ -9,4 +10,7 @@ PATH = "${VIRTUAL_ENV}/bin:${PATH}"
...
@@ -9,4 +10,7 @@ PATH = "${VIRTUAL_ENV}/bin:${PATH}"
PYTHONPATH = "$PYTHONHOME/lib/python3.10:${VIRTUAL_ENV}/lib/python3.10/site-packages"
PYTHONPATH = "$PYTHONHOME/lib/python3.10:${VIRTUAL_ENV}/lib/python3.10/site-packages"
REPLIT_POETRY_PYPI_REPOSITORY = "http://mirrors.csdn.net.cn/repository/csdn-pypi-mirrors/simple"
REPLIT_POETRY_PYPI_REPOSITORY = "http://mirrors.csdn.net.cn/repository/csdn-pypi-mirrors/simple"
MPLBACKEND = "TkAgg"
MPLBACKEND = "TkAgg"
POETRY_CACHE_DIR = "/root/${PROJECT_DIR}/.cache/pypoetry"
POETRY_CACHE_DIR = "/root/${PROJECT_DIR}/.cache/pypoetry"
\ No newline at end of file
[debugger]
program = "main.py"
inscode.nix
浏览文件 @
c08cba2b
{
pkgs
}:
{
function
[
P
,
T
]
=
rectangle_mesh_2D
(
area
,
h_partition
)
deps
=
[
colormap
(
jet
(
37
));
pkgs
.
python310Packages
.
pip
left
=
area
(
1
);
pkgs
.
python310Full
right
=
area
(
2
);
];
bottom
=
area
(
3
);
}
top
=
area
(
4
);
\ No newline at end of file
h
=
h_partition
;
N1
=
(
right-left
)
/h
(
1
);
N2
=
(
top-bottom
)
/h
(
2
);
tnp
=
(
N1
+
1
)
*
(
N2
+
1
);
P
=
zeros
(
tnp
,
2
);
T
=
zeros
(
N1
*
N2
,
4
);
Q
=
zeros
(
N1
+
1
,
N2
+
1
);
for
j
=
1
:
tnp
if
mod
(
j
,
N2
+
1
)
==
0
P
(
j
,
1
)
=
left
+
(
j
/
(
N2
+
1
)
-
1
)
*
h
(
1
);
P
(
j
,
2
)
=
top
;
else
P
(
j
,
1
)
=
left
+
fix
(
j
/
(
N2
+
1
))
*
h
(
1
);
P
(
j
,
2
)
=
bottom
+
(
mod
(
j
,
N2
+
1
)
-
1
)
*
h
(
2
);
end
end
for
i
=
1
:
N1
+
1
for
j
=
1
:
N2
+
1
Q
(
i
,
j
)
=
(
i-1
)
*
(
N2
+
1
)
+
j
;
end
end
triangular
elements
whose
element
indices
are
2
n-1
and
2
n
.
for
n
=
1
:
N1
*
N2
if
mod
(
n
,
N2
)
==
0
row
=
N2
;
column
=
n/N2
;
else
row
=
mod
(
n
,
N2
);
column
=
fix
(
n/N2
)
+
1
;
end
T
(
n
,
1
)
=
Q
(
column
,
row
);
T
(
n
,
2
)
=
Q
(
column
+
1
,
row
);
T
(
n
,
3
)
=
Q
(
column
+
1
,
row
+
1
);
T
(
n
,
4
)
=
Q
(
column
,
row
+
1
);
end
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录