开源 企业版 高校版 私有云 模力方舟 AI 队友
代码拉取完成,页面将自动刷新
加入 Gitee
与超过 1400万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
已有帐号? 立即登录
文件
master
分支 (1)
master
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
项目仓库所选许可证以仓库主分支所使用许可证为准
master
分支 (1)
master
克隆/下载
克隆/下载
提示
下载代码请复制以下命令到终端执行
为确保你提交的代码身份被 Gitee 正确识别,请执行以下命令完成配置
初次使用 SSH 协议进行代码克隆、推送等操作时,需按下述提示完成 SSH 配置
1 生成 RSA 密钥
2 获取 RSA 公钥内容,并配置到 SSH公钥
在 Gitee 上使用 SVN,请访问 使用指南
使用 HTTPS 协议时,命令行会出现如下账号密码验证步骤。基于安全考虑,Gitee 建议 配置并使用私人令牌 替代登录密码进行克隆、推送等操作
Username for 'https://gitee.com': userName
Password for 'https://userName@gitee.com': # 私人令牌
master
分支 (1)
master
OpenHash.js 9.33 KB
一键复制 编辑 原始数据 按行查看 历史
morris 提交于 2020年01月31日 14:34 +08:00 . init
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361
// Copyright 2011 David Galles, University of San Francisco. All rights reserved.
//
// Redistribution and use in source and binary forms, with or without modification, are
// permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above copyright notice, this list of
// conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright notice, this list
// of conditions and the following disclaimer in the documentation and/or other materials
// provided with the distribution.
//
// THIS SOFTWARE IS PROVIDED BY <COPYRIGHT HOLDER> ``AS IS'' AND ANY EXPRESS OR IMPLIED
// WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
// FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> OR
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
// ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
// ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// The views and conclusions contained in the software and documentation are those of the
// authors and should not be interpreted as representing official policies, either expressed
// or implied, of the University of San Francisco
function OpenHash(am, w, h)
{
this.init(am, w, h);
}
var POINTER_ARRAY_ELEM_WIDTH = 70;
var POINTER_ARRAY_ELEM_HEIGHT = 30;
var POINTER_ARRAY_ELEM_START_X = 50;
var LINKED_ITEM_HEIGHT = 30;
var LINKED_ITEM_WIDTH = 65;
var LINKED_ITEM_Y_DELTA = 50;
var LINKED_ITEM_POINTER_PERCENT = 0.25;
var MAX_DATA_VALUE = 999;
var HASH_TABLE_SIZE = 13;
var ARRAY_Y_POS = 350;
var INDEX_COLOR = "#0000FF";
OpenHash.prototype = new Hash();
OpenHash.prototype.constructor = OpenHash;
OpenHash.superclass = Hash.prototype;
OpenHash.prototype.init = function(am, w, h)
{
var sc = OpenHash.superclass;
var fn = sc.init;
fn.call(this,am, w, h);
this.nextIndex = 0;
this.POINTER_ARRAY_ELEM_Y = h - POINTER_ARRAY_ELEM_WIDTH;
this.setup();
}
OpenHash.prototype.addControls = function()
{
OpenHash.superclass.addControls.call(this);
// Add new controls
}
OpenHash.prototype.insertElement = function(elem)
{
this.commands = new Array();
this.cmd("SetText", this.ExplainLabel, "Inserting element: " + String(elem));
var index = this.doHash(elem);
var node = new LinkedListNode(elem,this.nextIndex++, 100, 75);
this.cmd("CreateLinkedList", node.graphicID, elem, LINKED_ITEM_WIDTH, LINKED_ITEM_HEIGHT, 100, 75);
if (this.hashTableValues[index] != null && this.hashTableValues[index] != undefined)
{
this.cmd("connect", node.graphicID, this.hashTableValues[index].graphicID);
this.cmd("disconnect", this.hashTableVisual[index], this.hashTableValues[index].graphicID);
}
else
{
this.cmd("SetNull", node.graphicID, 1);
this.cmd("SetNull", this.hashTableVisual[index], 0);
}
this.cmd("connect", this.hashTableVisual[index], node.graphicID);
node.next = this.hashTableValues[index];
this.hashTableValues[index] = node;
this.repositionList(index);
this.cmd("SetText", this.ExplainLabel, "");
return this.commands;
}
OpenHash.prototype.repositionList = function(index)
{
var startX = POINTER_ARRAY_ELEM_START_X + index *POINTER_ARRAY_ELEM_WIDTH;
var startY = this.POINTER_ARRAY_ELEM_Y - LINKED_ITEM_Y_DELTA;
var tmp = this.hashTableValues[index];
while (tmp != null)
{
tmp.x = startX;
tmp.y = startY;
this.cmd("Move", tmp.graphicID, tmp.x, tmp.y);
startY = startY - LINKED_ITEM_Y_DELTA;
tmp = tmp.next;
}
}
OpenHash.prototype.deleteElement = function(elem)
{
this.commands = new Array();
this.cmd("SetText", this.ExplainLabel, "正在删除元素: " + elem);
var index = this.doHash(elem);
if (this.hashTableValues[index] == null)
{
this.cmd("SetText", this.ExplainLabel, "正在删除元素: " + elem + " Element not in table");
return this.commands;
}
this.cmd("SetHighlight", this.hashTableValues[index].graphicID, 1);
this.cmd("Step");
this.cmd("SetHighlight", this.hashTableValues[index].graphicID, 0);
if (this.hashTableValues[index].data == elem)
{
if (this.hashTableValues[index].next != null)
{
this.cmd("Connect", this.hashTableVisual[index], this.hashTableValues[index].next.graphicID);
}
else
{
this.cmd("SetNull", this.hashTableVisual[index], 1);
}
this.cmd("Delete", this.hashTableValues[index].graphicID);
this.hashTableValues[index] = this.hashTableValues[index].next;
this.repositionList(index);
return this.commands;
}
var tmpPrev = this.hashTableValues[index];
var tmp = this.hashTableValues[index].next;
var found = false;
while (tmp != null && !found)
{
this.cmd("SetHighlight", tmp.graphicID, 1);
this.cmd("Step");
this.cmd("SetHighlight", tmp.graphicID, 0);
if (tmp.data == elem)
{
found = true;
this.cmd("SetText", this.ExplainLabel, "正在删除元素: " + elem + " 元素已删除");
if (tmp.next != null)
{
this.cmd("Connect", tmpPrev.graphicID, tmp.next.graphicID);
}
else
{
this.cmd("SetNull", tmpPrev.graphicID, 1);
}
tmpPrev.next = tmpPrev.next.next;
this.cmd("Delete", tmp.graphicID);
this.repositionList(index);
}
else
{
tmpPrev = tmp;
tmp = tmp.next;
}
}
if (!found)
{
this.cmd("SetText", this.ExplainLabel, "正在删除元素: " + elem + " Element not in table");
}
return this.commands;
}
OpenHash.prototype.findElement = function(elem)
{
this.commands = new Array();
this.cmd("SetText", this.ExplainLabel, "正在搜索元素: " + elem);
var index = this.doHash(elem);
var compareIndex = this.nextIndex++;
var found = false;
var tmp = this.hashTableValues[index];
this.cmd("CreateLabel", compareIndex, "", 10, 40, 0);
while (tmp != null && !found)
{
this.cmd("SetHighlight", tmp.graphicID, 1);
if (tmp.data == elem)
{
this.cmd("SetText", compareIndex, tmp.data + "==" + elem)
found = true;
}
else
{
this.cmd("SetText", compareIndex, tmp.data + "!=" + elem)
}
this.cmd("Step");
this.cmd("SetHighlight", tmp.graphicID, 0);
tmp = tmp.next;
}
if (found)
{
this.cmd("SetText", this.ExplainLabel, "正在搜索元素: " + elem+ " 已找到!")
}
else
{
this.cmd("SetText", this.ExplainLabel, "正在搜索元素: " + elem+ " 未找到!")
}
this.cmd("Delete", compareIndex);
this.nextIndex--;
return this.commands;
}
OpenHash.prototype.setup = function()
{
this.hashTableVisual = new Array(HASH_TABLE_SIZE);
this.hashTableIndices = new Array(HASH_TABLE_SIZE);
this.hashTableValues = new Array(HASH_TABLE_SIZE);
this.indexXPos = new Array(HASH_TABLE_SIZE);
this.indexYPos = new Array(HASH_TABLE_SIZE);
this.ExplainLabel = this.nextIndex++;
this.table_size = HASH_TABLE_SIZE;
this.commands = [];
for (var i = 0; i < HASH_TABLE_SIZE; i++)
{
var nextID = this.nextIndex++;
this.cmd("CreateRectangle", nextID, "", POINTER_ARRAY_ELEM_WIDTH, POINTER_ARRAY_ELEM_HEIGHT, POINTER_ARRAY_ELEM_START_X + i *POINTER_ARRAY_ELEM_WIDTH, this.POINTER_ARRAY_ELEM_Y)
this.hashTableVisual[i] = nextID;
this.cmd("SetNull", this.hashTableVisual[i], 1);
nextID = this.nextIndex++;
this.hashTableIndices[i] = nextID;
this.indexXPos[i] = POINTER_ARRAY_ELEM_START_X + i *POINTER_ARRAY_ELEM_WIDTH;
this.indexYPos[i] = this.POINTER_ARRAY_ELEM_Y + POINTER_ARRAY_ELEM_HEIGHT
this.hashTableValues[i] = null;
this.cmd("CreateLabel", nextID, i,this.indexXPos[i],this.indexYPos[i] );
this.cmd("SetForegroundColor", nextID, INDEX_COLOR);
}
this.cmd("CreateLabel", this.ExplainLabel, "", 10, 25, 0);
this.animationManager.StartNewAnimation(this.commands);
this.animationManager.skipForward();
this.animationManager.clearHistory();
this.resetIndex = this.nextIndex;
}
OpenHash.prototype.resetAll = function()
{
var tmp;
this.commands = OpenHash.superclass.resetAll.call(this);
for (var i = 0; i < this.hashTableValues.length; i++)
{
tmp = this.hashTableValues[i];
if (tmp != null)
{
while (tmp != null)
{
this.cmd("Delete", tmp.graphicID);
tmp = tmp.next;
}
this.hashTableValues[i] = null;
this.cmd("SetNull", this.hashTableVisual[i], 1);
}
}
return this.commands;
}
// NEED TO OVERRIDE IN PARENT
OpenHash.prototype.reset = function()
{
for (var i = 0; i < this.table_size; i++)
{
this.hashTableValues[i] = null;
}
this.nextIndex = this.resetIndex;
OpenHash.superclass.reset.call(this);
}
OpenHash.prototype.resetCallback = function(event)
{
}
/*this.nextIndex = 0;
this.commands = [];
this.cmd("CreateLabel", 0, "", 20, 50, 0);
this.animationManager.StartNewAnimation(this.commands);
this.animationManager.skipForward();
this.animationManager.clearHistory(); */
OpenHash.prototype.disableUI = function(event)
{
var sc = OpenHash.superclass;
var fn = sc.disableUI;
fn.call(this);
}
OpenHash.prototype.enableUI = function(event)
{
OpenHash.superclass.enableUI.call(this);
}
function LinkedListNode(val, id, initialX, initialY)
{
this.data = val;
this.graphicID = id;
this.x = initialX;
this.y = initialY;
this.next = null;
}
var currentAlg;
function init()
{
var animManag = initCanvas();
currentAlg = new OpenHash(animManag, canvas.width, canvas.height);
}
Loading...
举报
举报成功
我们将于2个工作日内通过站内信反馈结果给你!
请认真填写举报原因,尽可能描述详细。
请选择举报类型
取消
发送
误判申诉

此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。

如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。

取消
提交

发行版

暂无发行版

贡献者

全部

近期动态

不能加载更多了
编辑仓库简介
简介内容
主页
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/big_mo/data-structure-visualizations.git
git@gitee.com:big_mo/data-structure-visualizations.git
big_mo
data-structure-visualizations
Data-Structure-Visualizations
master
点此查找更多帮助

搜索帮助

评论
仓库举报
回到顶部
登录提示
该操作需登录 Gitee 帐号,请先登录后再操作。
立即登录
没有帐号,去注册

AltStyle によって変換されたページ (->オリジナル) /