Incs/codemirror/mode/yacas/index.html
(开头部分) 1KB这里只显示每个文件的开头 60 行。登录后可以解锁完整代码。
<!doctype html>
<title>CodeMirror: yacas mode</title>
<meta charset="utf-8"/>
<link rel=stylesheet href="../../doc/docs.css">
<link rel=stylesheet href=../../lib/codemirror.css>
<script src=../../lib/codemirror.js></script>
<script src=../../addon/edit/matchbrackets.js></script>
<script src=yacas.js></script>
<style type=text/css>
.CodeMirror {border-top: 1px solid black; border-bottom: 1px solid black;}
</style>
<div id=nav>
<a href="https://codemirror.net"><h1>CodeMirror</h1><img id=logo src="../../doc/logo.png"></a>
<ul>
<li><a href="../../index.html">Home</a>
<li><a href="../../doc/manual.html">Manual</a>
<li><a href="https://github.com/codemirror/codemirror">Code</a>
</ul>
<ul>
<li><a href="../index.html">Language modes</a>
<li><a class=active href="#">yacas</a>
</ul>
</div>
<article>
<h2>yacas mode</h2>
<textarea id="yacasCode">
// example yacas code
Graph(edges_IsList) <-- [
Local(v, e, f, t);
vertices := {};
ForEach (e, edges) [
If (IsList(e), e := Head(e));
{f, t} := Tail(Listify(e));
DestructiveAppend(vertices, f);
DestructiveAppend(vertices, t);
];
Graph(RemoveDuplicates(vertices), edges);
];
10 # IsGraph(Graph(vertices_IsList, edges_IsList)) <-- True;
20 # IsGraph(_x) <-- False;
Edges(Graph(vertices_IsList, edges_IsList)) <-- edges;
Vertices(Graph(vertices_IsList, edges_IsList)) <-- vertices;
AdjacencyList(g_IsGraph) <-- [
Local(l, vertices, edges, e, op, f, t);
l := Association'Create();
24 小时内免费解锁 3 个项目,之后 1 积分/个。 规则说明
AI 解读
登录后可用,每次 10 积分,解读结果公开显示在下面。
还没有人解读过这个文件。
