npm - cody-utils - Versions diffs - 1.0.1 → 1.0.2 - Mend

cody-utils 1.0.1 → 1.0.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (61) hide show

package/test/20_/346/225/260/346/215/256/347/273/223/346/236/204/344/270/216/347/256/227/346/263/225/01_/345/237/272/346/234/254/346/225/260/346/215/256/347/273/223/346/236/204_/346/225/260/347/273/204//346/225/260/347/273/204/345/270/270/350/247/201/346/223/215/344/275/2341.html DELETED Viewed

@@ -1,48 +0,0 @@
-<!DOCTYPE html>
-<html lang="en">
-<head>
-  <meta charset="UTF-8">
-  <meta name="viewport" content="width=device-width, initial-scale=1.0">
-  <meta http-equiv="X-UA-Compatible" content="ie=edge">
-  <title>Document</title>
-</head>
-<body>
-  <script>
-    /*
-    1. 理解
-        多个有序数元素的列表
-        每个元素都有一个唯一的数值标号, 且从0开始依次递增
-        在内存中数据是保存在一块连续的内存中的
-    2. 相关API操作
-        静态方法
-        更新的方法
-        遍历相关的声明式方法
-        其它方法
-    */
-    /*
-    静态方法
-        from(): 从一个类似数组或可迭代对象创建一个新的，浅拷贝的数组实例
-        of(): 创建一个具有可变数量参数的新数组实例
-        isArray()
-    */
-    //  from(): 从一个类似数组或可迭代对象创建一个新的，浅拷贝的数组实例
-    function f() {
-      return Array.from(arguments);
-    }
-    console.log(f(1, 2, 3));
-    const set = new Set(['foo', 'bar', 'baz', 'foo']);
-    console.log(Array.from(set));
-    // of(): 创建一个具有可变数量参数的新数组实例
-    console.log(Array.of(3)); // [3]
-    console.log(Array.of(1, 2, 3)); // [1, 2, 3]
-    // isArray()
-    console.log(Array.isArray([1, 2, 3]), Array.isArray({foo: 123}));
-  </script>
-</body>
-</html>

@@ -1,74 +0,0 @@
-<!DOCTYPE html>
-<html lang="en">
-<head>
-  <meta charset="UTF-8">
-  <meta name="viewport" content="width=device-width, initial-scale=1.0">
-  <meta http-equiv="X-UA-Compatible" content="ie=edge">
-  <title>Document</title>
-</head>
-<body>
-  <script>
-    /*
-    1. 理解
-        多个有序数元素的列表
-        每个元素都有一个唯一的数值标号, 且从0开始依次递增
-        在内存中数据是保存在一块连续的内存中的
-    2. 相关API操作
-        静态方法
-        更新的方法
-        遍历相关的声明式方法
-        其它方法
-    */
-    /*
-    更新的方法
-        push()
-        pop()
-        unshift()
-        shift()
-        sort()
-        reverse()
-        splice()
-    */
-    /*
-    需求:
-        1. 在数组的最后添加6
-        2. 在数组的最后一次添加8和9
-        3. 在数组的最后添加包含8和9的数组
-        4. 删除数组的最后一个元素
-        5. 在数组的最前面添加2
-        6. 在数组的最前面一次添加4和3(注: 3在前, 4在后)
-        7. 删除数组的第一个元素
-        8. 对数组进行按数值降序排列
-        9. 对数组进行倒序排列
-        10. 删除第3个元素
-        11. 将第3个元素替换为10(不能直接赋值)
-        12. 将11插入为数组的第3个元素
-    */
-    const arr = [3, 1, 14, 9, 7, 6]
-    arr.push(6)
-    arr.push(8, 9) // 添加2个元素
-    arr.push([8, 9]) // 添加1个元素
-    console.log(arr.pop())
-    arr.unshift(2)
-    arr.unshift(3, 4)
-    console.log(arr.shift())
-    arr.sort()
-    arr.sort((item1, item2) => item2 - item1)  // 根据数值降序
-    arr.reverse()
-    arr.splice(2, 1)
-    arr.splice(2, 1, 4)
-    arr.splice(2, 0, 3)
-    console.log(arr)
-  </script>
-</body>
-</html>

@@ -1,53 +0,0 @@
-<!DOCTYPE html>
-<html lang="en">
-<head>
-  <meta charset="UTF-8">
-  <meta name="viewport" content="width=device-width, initial-scale=1.0">
-  <meta http-equiv="X-UA-Compatible" content="ie=edge">
-  <title>Document</title>
-</head>
-<body>
-  <script>
-    /*
-    1. 理解
-        多个有序数元素的列表
-        每个元素都有一个唯一的数值标号, 且从0开始依次递增
-        在内存中数据是保存在一块连续的内存中的
-    2. 相关API操作
-        静态方法
-        更新的方法
-        遍历相关的声明式方法
-        其它方法
-    */
-    /*
-    遍历相关的声明式方法
-        forEach()
-        find()
-        findIndex()
-        filter()
-        map()
-        reduce()
-        some()
-        every()
-        slice()
-    */
-    /*
-    需要:
-        1. 输出所有奇数元素值
-        2. 找到一个值为奇数且下标为奇数的元素
-        3. 找到一个值为奇数且下标为奇数的元素的下标
-        4. 找到所有值为奇数且下标为奇数的元素
-        5. 得到一个元素值都大10的数组
-        6. 找到所有值为奇数且下标为奇数的元素值的和
-        7. 判断数组中是否包含值为奇数且下标为奇数的元素
-        8. 判断数组中是否所有元素者满足值为奇数且下标为奇数
-        9. 得到下标从2到5的所有元素的数组
-    */
-    const arr = [3, 1, 14, 9, 7, 6]
-  </script>
-</body>
-</html>

@@ -1,54 +0,0 @@
-<!DOCTYPE html>
-<html lang="en">
-<head>
-  <meta charset="UTF-8">
-  <meta name="viewport" content="width=device-width, initial-scale=1.0">
-  <meta http-equiv="X-UA-Compatible" content="ie=edge">
-  <title>Document</title>
-</head>
-<body>
-  <script>
-    /*
-    1. 理解
-        多个有序数元素的列表
-        每个元素都有一个唯一的数值标号, 且从0开始依次递增
-        在内存中数据是保存在一块连续的内存中的
-    2. 相关API操作
-        静态方法
-        更新的方法
-        遍历相关的声明式方法
-        其它方法
-    */
-    /*
-    其它
-        length
-        join()
-        concat()
-        indexOf()
-        lastIndexOf()
-    */
-    /*
-    需求
-        1). 输出数组中元素的个数
-        2). 将数组中的所有元素用-连接成串
-        3). 与包含1,2,3的数组合并, 并与4合并
-        4). 得到1在数组中的第一个下标和最后一个下标
-    */
-    const arr = [3, 1, 14, 9, 7, 6, 1, 4]
-    console.log(arr.length);
-    // arr[10] = 12;
-    // console.log(arr.length);
-    console.log(arr.join('-'))
-    console.log('abc'.split('').reverse().join(''))
-    console.log(arr.concat([1, 2, 3], 4))
-    console.log(arr.indexOf(1), arr.lastIndexOf(1), arr.indexOf(10))
-  </script>
-</body>
-</html>

package/test/20_/346/225/260/346/215/256/347/273/223/346/236/204/344/270/216/347/256/227/346/263/225/02_/345/237/272/346/234/254/346/225/260/346/215/256/347/273/223/346/236/204_/346/240/210//346/240/210_/345/272/224/347/224/250_/345/215/201/350/277/233/345/210/266/350/275/254/344/272/214/350/277/233/345/210/266.html DELETED Viewed

@@ -1,41 +0,0 @@
-<!DOCTYPE html>
-<html lang="en">
-<head>
-  <meta charset="UTF-8">
-  <meta name="viewport" content="width=device-width, initial-scale=1.0">
-  <meta http-equiv="X-UA-Compatible" content="ie=edge">
-  <title>栈_应用_十进制转二进制</title>
-</head>
-<body>
-  <script src="../../../dist/atguigu-utils.js"></script>
-  <script>
-    /*
-    使用Stack封装一个功能函数: 十进制(decimal)转二进制(binary)
-    */
-    function dec2bin(decNumer) {
-      // 创建一个空栈
-      const stack = new aUtils.Stack()
-      // 将得到的所有二进制位压栈
-      while (decNumer > 0) {
-        let remainder = decNumer % 2
-        stack.push(remainder)
-        decNumer = Math.floor(decNumer / 2)
-      }
-      // 取出栈中所有元素组拼成二进制数
-      let binayriStrng = ""
-      while (!stack.isEmpty()) {
-        binayriStrng += stack.pop()
-      }
-      return binayriStrng
-    }
-    // 测试
-    console.log(dec2bin(10))
-    console.log(dec2bin(233))
-  </script>
-</body>
-</html>

@@ -1,29 +0,0 @@
-<!DOCTYPE html>
-<html lang="en">
-<head>
-  <meta charset="UTF-8">
-  <meta name="viewport" content="width=device-width, initial-scale=1.0">
-  <meta http-equiv="X-UA-Compatible" content="ie=edge">
-  <title>栈_测试</title>
-</head>
-<body>
-  <script src="../../../dist/atguigu-utils.js"></script>
-  <script>
-    const stack = new aUtils.Stack()
-    stack.push(6)
-    stack.push(5)
-    stack.pop()
-    stack.push(4)
-    stack.pop()
-    stack.push(3)
-    console.log(stack.peek(), stack.size(), stack.isEmpty())
-    const stack2 = new aUtils.Stack()
-    stack2.push('a')
-    stack2.push('b')
-    stack2.pop()
-    console.log(stack2.peek(), stack2.size(), stack2.isEmpty())
-  </script>
-</body>
-</html>

package/test/20_/346/225/260/346/215/256/347/273/223/346/236/204/344/270/216/347/256/227/346/263/225/03_/345/237/272/346/234/254/346/225/260/346/215/256/347/273/223/346/236/204_/351/230/237/345/210/227//344/274/230/345/205/210/347/272/247/351/230/237/345/210/227_/346/265/213/350/257/225.html DELETED Viewed

@@ -1,29 +0,0 @@
-<!DOCTYPE html>
-<html lang="en">
-<head>
-  <meta charset="UTF-8">
-  <meta name="viewport" content="width=device-width, initial-scale=1.0">
-  <meta http-equiv="X-UA-Compatible" content="ie=edge">
-  <title>优先级队列_测试</title>
-</head>
-<body>
-  <script src="../../../dist/atguigu-utils.js"></script>
-  <script>
-    // 创建优先级队列对象
-    var pQueue = new aUtils.PriorityQueue()
-    // 添加元素
-    pQueue.enqueue("abc", 10)
-    pQueue.enqueue("cba", 5)
-    pQueue.enqueue("nba", 12)
-    pQueue.enqueue("mba", 3)
-    // 遍历所有的元素
-    var size = pQueue.size()
-    for (var i = 0; i < size; i++) {
-        var item = pQueue.dequeue()
-        console.log(item.data, item.priority)
-    }
-  </script>
-</body>
-</html>

package/test/20_/346/225/260/346/215/256/347/273/223/346/236/204/344/270/216/347/256/227/346/263/225/03_/345/237/272/346/234/254/346/225/260/346/215/256/347/273/223/346/236/204_/351/230/237/345/210/227//351/230/237/345/210/227_/345/272/224/347/224/250_/345/207/273/351/274/223/344/274/240/350/212/261.html DELETED Viewed

@@ -1,38 +0,0 @@
-<!DOCTYPE html>
-<html lang="en">
-<head>
-  <meta charset="UTF-8">
-  <meta name="viewport" content="width=device-width, initial-scale=1.0">
-  <meta http-equiv="X-UA-Compatible" content="ie=edge">
-  <title>队列_应用</title>
-</head>
-<body>
-  <script src="../../../dist/atguigu-utils.js"></script>
-  <script>
-    /*
-    利用自定义队列实现击鼓传花游戏函数
-    */
-    function passGame(names, num) {
-      const queue = new aUtils.Queue()
-      names.forEach((name, index) => {
-        queue.enqueue({name, index})
-      })
-      while(queue.size()>1) {
-        // 将队列的前num-1个依次转移到队列后面去
-        for (let index = 0; index < num-1; index++) {
-          queue.enqueue(queue.dequeue())
-        }
-        // 移除列头元素(也就是数到num的人)
-        queue.dequeue()
-      }
-      // 队列现在只剩下一个元素, 也就是最后剩下的人
-      const {name, index} = queue.front()
-      alert(`最后剩下${name}, 第${index+1}个`)
-    }
-    // 测试
-    var names = ['A','B','C','D','E']
-    passGame(names, 4)
-  </script>
-</body>
-</html>

package/test/20_/346/225/260/346/215/256/347/273/223/346/236/204/344/270/216/347/256/227/346/263/225/03_/345/237/272/346/234/254/346/225/260/346/215/256/347/273/223/346/236/204_/351/230/237/345/210/227//351/230/237/345/210/227_/346/265/213/350/257/225.html DELETED Viewed

@@ -1,33 +0,0 @@
-<!DOCTYPE html>
-<html lang="en">
-<head>
-  <meta charset="UTF-8">
-  <meta name="viewport" content="width=device-width, initial-scale=1.0">
-  <meta http-equiv="X-UA-Compatible" content="ie=edge">
-  <title>队列_测试</title>
-</head>
-<body>
-  <script src="../../../dist/atguigu-utils.js"></script>
-  <script>
-    // 创建队列对象
-    var queue = new aUtils.Queue()
-    // 在队列中添加元素
-    queue.enqueue("abc")
-    queue.enqueue("cba")
-    queue.enqueue("nba")
-    // 查看一下队列前端元素
-    console.log(queue.front())
-    // 查看队列是否为空和元素个数
-    console.log(queue.isEmpty())
-    console.log(queue.size())
-    // 从队列中删除元素
-    console.log(queue.dequeue())
-    console.log(queue.dequeue())
-    console.log(queue.dequeue())
-  </script>
-</body>
-</html>

package/test/20_/346/225/260/346/215/256/347/273/223/346/236/204/344/270/216/347/256/227/346/263/225/04_/346/225/260/346/215/256/347/273/223/346/236/204_/351/223/276/350/241/250//345/217/214/345/220/221/351/223/276/350/241/250_/346/265/213/350/257/225.html DELETED Viewed

@@ -1,55 +0,0 @@
-<!DOCTYPE html>
-<html lang="en">
-<head>
-  <meta charset="UTF-8">
-  <meta name="viewport" content="width=device-width, initial-scale=1.0">
-  <meta http-equiv="X-UA-Compatible" content="ie=edge">
-  <title>双向链表_测试</title>
-</head>
-<body>
-  <script src="../../../dist/atguigu-utils.js"></script>
-  <script>
-    // 1.创建双向链表对象
-    var list = new DoublyLinkedList()
-    // 2.追加元素
-    list.append("abc")
-    list.append("cba")
-    list.append("nba")
-    list.append("mba")
-    // 3.获取所有的遍历结果
-    console.log(list.forwardString()) // abc,cba,nba,mba
-    console.log(list.reverseString()) //
-    console.log(list) // abc,cba,nba,mba
-    // 4.insert方法测试
-    list.insert(0, "100")
-    list.insert(2, "200")
-    list.insert(6, "300")
-    console.log(list) // 100,abc,200,cba,nba,mba,300
-    // 5.removeAt方法测试
-    console.log(list.removeAt(0)) // 100
-    console.log(list.removeAt(1)) // 200
-    console.log(list.removeAt(4)) // 300
-    console.log(list) // abc,cba,nba,mba
-    // 6.indexOf方法测试
-    console.log(list.indexOf("abc")) // 0
-    console.log(list.indexOf("cba")) // 1
-    console.log(list.indexOf("nba")) // 2
-    console.log(list.indexOf("mba")) // 3
-    // 7.remove方法测试
-    console.log(list.remove("abc")) // abc
-    console.log(list) // cba,nba,mba
-    // 8.测试最后四个方法
-    console.log(list.getHead())
-    console.log(list.getTail())
-    console.log(list.isEmpty())
-    console.log(list.size())
-  </script>
-</body>
-</html>

package/test/20_/346/225/260/346/215/256/347/273/223/346/236/204/344/270/216/347/256/227/346/263/225/04_/346/225/260/346/215/256/347/273/223/346/236/204_/351/223/276/350/241/250//351/223/276/350/241/250_/346/265/213/350/257/225.html DELETED Viewed

@@ -1,52 +0,0 @@
-<!DOCTYPE html>
-<html lang="en">
-<head>
-  <meta charset="UTF-8">
-  <meta name="viewport" content="width=device-width, initial-scale=1.0">
-  <meta http-equiv="X-UA-Compatible" content="ie=edge">
-  <title>链表_测试</title>
-</head>
-<body>
-  <script src="../../../dist/atguigu-utils.js"></script>
-  <script>
-    // 测试链表
-    // 1.创建链表
-    var list = new aUtils.LinkedList()
-    // 2.追加元素
-    list.append(15)
-    list.append(10)
-    list.append(20)
-    // 3.打印链表的结果
-    // console.log(list) // 15,10,20
-    // 4.测试insert方法
-    list.insert(0, 100)
-    list.insert(4, 200)
-    list.insert(2, 300)
-    // console.log(list) // 100,15,300,10,20,200
-    // 5.测试removeAt方法
-    list.removeAt(0)
-    list.removeAt(1)
-    list.removeAt(3)
-    // console.log(list)
-    // 6.测试indexOf方法
-    // console.log(list.indexOf(15))
-    // console.log(list.indexOf(10))
-    // console.log(list.indexOf(20))
-    // console.log(list.indexOf(100))
-    // 7.测试remove方法
-    list.remove(15)
-    // console.log(list)
-    // 8.测试其他方法
-    console.log(list.isEmpty())
-    console.log(list.size())
-    console.log(list.getFirst())
-  </script>
-</body>
-</html>

package/test/20_/346/225/260/346/215/256/347/273/223/346/236/204/344/270/216/347/256/227/346/263/225/05_/346/225/260/346/215/256/347/273/223/346/236/204_/346/240/221//344/272/214/345/217/211/346/220/234/347/264/242/346/240/221_/346/265/213/350/257/225.html DELETED Viewed

@@ -1,48 +0,0 @@
-<!DOCTYPE html>
-<html lang="en">
-<head>
-  <meta charset="UTF-8">
-  <meta name="viewport" content="width=device-width, initial-scale=1.0">
-  <meta http-equiv="X-UA-Compatible" content="ie=edge">
-  <title>二叉搜索树_测试</title>
-</head>
-<body>
-  <script src="../../../dist/atguigu-utils.js"></script>
-  <script>
-    var tree = new aUtils.BinarySearchTree()
-        //     23
-        //    /  \
-        //   16   45
-        //  / \  / \
-        // 3 22 37  99
-    // 插入
-    tree.insert(23)
-    tree.insert(45)
-    tree.insert(16)
-    tree.insert(37)
-    tree.insert(3)
-    tree.insert(99)
-    tree.insert(22)
-    // 遍历
-    tree.inOrder(tree.root)// 3 16 22 23 37 45 99
-    tree.preOrder(tree.root)// 23 16 3 22 45 37 99
-    tree.postOrder(tree.root)// 3 22 16 37 99 45 23
-    // 根结点
-    console.log(tree.root.show())//23
-    // 获取最小最大值
-    console.log(tree.getmin())//3
-    console.log(tree.getSmallest(tree.root).show())//3
-    console.log(tree.getmax())//99
-    console.log(tree.getBigest(tree.root).show())//99
-    // 查找结点
-    console.log(tree.find(16).left.show())//3
-    // 删除结点
-    tree.remove(16)
-    tree.inOrder(tree.root)// 3 22 23 37 45 99
-  </script>
-</body>
-</html>

package/test/20_/346/225/260/346/215/256/347/273/223/346/236/204/344/270/216/347/256/227/346/263/225/06_/346/225/260/346/215/256/347/273/223/346/236/204_/351/233/206/345/220/210//351/233/206/345/220/210_/346/265/213/350/257/225.html DELETED Viewed

@@ -1,50 +0,0 @@
-<!DOCTYPE html>
-<html lang="en">
-<head>
-  <meta charset="UTF-8">
-  <meta name="viewport" content="width=device-width, initial-scale=1.0">
-  <meta http-equiv="X-UA-Compatible" content="ie=edge">
-  <title>集合_测试</title>
-</head>
-<body>
-  <script src="../../../dist/atguigu-utils.js"></script>
-  <script>
-    const {Set} = aUtils
-    var set1 = new Set();
-    var set2 = new Set();
-    var union = new Set();
-    var intersect = new Set();
-    var diff = new Set();
-    set1.add("data1");
-    set1.add("data2");
-    set1.add("data3");
-    set2.add("data2");
-    set2.add("data3");
-    set2.add("data4");
-    set2.remove("data3");
-    console.log(set1.size(),set1.show());//3 "[data1,data2,data3]"
-    console.log(set2.size(),set2.show());//2 "[data2,data4]"
-    console.log(set1.contains("data1"));//true
-    union = set1.union(set2);
-    intersect = set1.intersect(set2);
-    diff = set1.difference(set2);
-    // 并集
-    console.log(union.show());//[data1,data2,data3,data4]
-    // 交集
-    console.log(intersect.show());//[data2]
-    // 差集
-    console.log(diff.show());//[data1,data3]
-    // 判断子集
-    var set3 = new Set();
-    set3.add("data1");
-    subset1 = set2.subset(set1);
-    console.log(subset1);//false
-    subset2 = set3.subset(set1);
-    console.log(subset2);//true
-  </script>
-</body>
-</html>

package/test/20_/346/225/260/346/215/256/347/273/223/346/236/204/344/270/216/347/256/227/346/263/225/07_/346/216/222/345/272/217/347/256/227/346/263/225/3/347/247/215/345/237/272/346/234/254/346/216/222/345/272/217_/346/265/213/350/257/225.html DELETED Viewed

@@ -1,19 +0,0 @@
-<!DOCTYPE html>
-<html lang="en">
-<head>
-  <meta charset="UTF-8">
-  <meta name="viewport" content="width=device-width, initial-scale=1.0">
-  <meta http-equiv="X-UA-Compatible" content="ie=edge">
-  <title>3种基本排序_测试</title>
-</head>
-<body>
-  <script src="../../../dist/atguigu-utils.js"></script>
-  <script>
-    const arr = [1, 6, 2, 7, 3, 9]
-    // console.log(aUtils.bubbleSort(arr))
-    // console.log(aUtils.selectSort(arr))
-    console.log(aUtils.insertSort(arr))
-  </script>
-</body>
-</html>

package/test/20_/346/225/260/346/215/256/347/273/223/346/236/204/344/270/216/347/256/227/346/263/225/07_/346/216/222/345/272/217/347/256/227/346/263/225//351/253/230/347/272/247/346/216/222/345/272/217_/346/265/213/350/257/225.html DELETED Viewed

@@ -1,19 +0,0 @@
-<!DOCTYPE html>
-<html lang="en">
-<head>
-  <meta charset="UTF-8">
-  <meta name="viewport" content="width=device-width, initial-scale=1.0">
-  <meta http-equiv="X-UA-Compatible" content="ie=edge">
-  <title>高级排序_测试</title>
-</head>
-<body>
-  <script src="../../../dist/atguigu-utils.js"></script>
-  <script>
-    const arr = [1, 6, 2, 7, 3, 9]
-    console.log(aUtils.shellSort(arr))
-    console.log(aUtils.mergeSort(arr))
-    console.log(aUtils.quickSort(arr))
-  </script>
-</body>
-</html>