npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2026 – Pkg Stats / Ryan Hefner

zdiff

v0.1.4

Published

A simple project to create patch for javascript Object

Readme

zdiff

import! only support es6+ environment

重要提示!仅仅支持es6及以上的运行环境

zdiff是一个基于lodash的简单的javascript库,旨在为javascript对象创建快照,并可以将修改后的对象和快照进行比较,产生一个patch,这个patch中仅仅包括修改后的数据,方便使用http请求的PATCH方法的时候传输数据。zdiff的快照是对对象的deepClone,计算生成patch的过程会对对象进行递归比较(所以效率很渣),并且patch只针对deepth为1的字段,这里的deepth为1是指如果deepth超过1的字段发生变更,会认为包括它的deepth为1的字段发生了变更,因而patch会包括整个deepth为1的字段及其后代(可以认为zdiff将deepth为1的字段与其后代视为一个整体)。

  1. 生成快照

    const { Snapshot: Snapshot } = require('zdiff');
    const source = {
        a: 1,
        b: {
            a: 1
        },
        c: [1, 2, 3],
        d: '123',
        e: [
            {
                a: 1
            },
            {
                b: 2
            }
        ]
    };
       
    const snapshot = new Snapshot(source);
    const snapshot1 = snapshot.takeSnapshot();
       
    expect(snapshot1).toEqual(source); // true
    snapshot1 === source // false
       
  2. 获取快照

    const { Snapshot: Snapshot } = require('zdiff');
    const source = {
        a: 1,
        b: {
            a: 1
        },
        c: [1, 2, 3],
        d: '123',
        e: [
            {
                a: 1
            },
            {
                b: 2
            }
        ]
    };
       
    snapshot.takeSnapshot();
    const snapshot1 = snapshot.getSnapshot();
       
    expect(snapshot1).toEqual(source); // true
    snapshot1 === source // false
  3. 生成patch

    const { Snapshot: Snapshot } = require('zdiff');
    const source = {
        a: 1,
        b: {
            a: 1
        },
        c: [1, 2, 3],
        d: '123',
        e: [
            {
                a: 1
            },
            {
                b: 2
            }
        ]
    };
       
    const snapshot = new Snapshot(source);
    snapshot.takeSnapshot();
    source.a = '111';
    source.b = {
        a: 1,
        b: 2
    };
    source.c = [1, 2, 3, 'a'];
    source.d = 123;
    source.e = [
        {
            a: 1
        },
        {
            b: '2'
        }
    ];
    const patch = snapshot.getDiffPatch();
       
    expect(patch).toEqual({
        a: '111',
        b: {
            a: 1,
            b: 2
        },
        c: [1, 2, 3, 'a'],
        d: 123,
        e: [
            {
                a: 1
            },
            {
                b: '2'
            }
        ]
    }); // true