zoukankan      html  css  js  c++  java
  • [Immutable.js] Lightning Fast Immutable.js Equality Checks with Hash Codes

    While Immutable.js offers .is() to confirm value equality between iterables it comes at the cost of referencing each key and value in both objects. For lightning fast equality checks, Immutable.js can produce a hash code based on an iterable's content. If two iterables have the same content, their hash codes will be the same. It's worth noting that this technique is unsuitable for mission critical application development since there is a chance, however slight, that checksums like these might collide. This is outlined here: https://en.wikipedia.org/wiki/Collision_(computer_science)

    mocha.setup('bdd');
    const expect = chai.expect;
    
    class Todo {
      
      constructor(title="", items=Immutable.List(), completed=false) {
        this.id = (+new Date() + Math.floor(Math.random() * 999999)).toString(36);
        this.title = title;
        this.items = items;
        this.completed = completed;
      }
      
    }
    
    function generateTodos() {
      
      const todos = []
      
      _.each(_.range(5), index => {
        var todo = new Todo(`Todo ${index}`);
        
        todo.completed = Math.round(Math.random()) === 0;
          
        _.each(_.range(Math.floor(Math.random()*100)), index => {
          todo.items = todo.items.push(`Item ${index}`);
        });
        
        todos.push(todo);
          
      });
      
      return todos;
    }
    
    describe('Lightning Fast Equality checks with Hash Codes', () => {
      
      it('should take separate lists with the same items and see equal hash codes', () => {
    
        var todos = generateTodos();
        
        let todos1 = Immutable.List.of(...todos);
        let todos2 = Immutable.List.of(...todos);
    
        expect(todos1).to.not.equal(todos2);
        expect(todos1.hashCode()).to.equal(todos2.hashCode());
    
      });
      
    });
    
    mocha.run();
  • 相关阅读:
    Placing Rooks-CF 1342E
    Yet Another Counting Problem-CF 1342C
    [SDOI2016]齿轮
    Rinne Loves Xor
    Labyrinth CodeForces
    Nastya and Scoreboard
    Teacher Bo HDU
    Blood Cousins Return
    D Tree HDU
    设计模式学习笔记(八、行为型-策略模式)
  • 原文地址:https://www.cnblogs.com/Answer1215/p/5218912.html
Copyright © 2011-2022 走看看