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 🙏

© 2024 – Pkg Stats / Ryan Hefner

@abozhilov/set-utils

v1.1.1

Published

Set utility functions

Downloads

7

Readme

@abozhilov/set-utils - v1.0.0

Utility library for working with the built-in Set.

Written in TypeScript.

Installation

npm

    npm install @abozhilov/set-utils

yarn

    yarn add @abozhilov/set-utils

Table of contents

Functions

Functions

isSubset

isSubset<Т>(setA, setB): boolean

Checks whether setA is a subset of setB. The operation is denoted by setA ⊆ setB.

  assert.equal(
      isSubset(new Set([1, 2]), new Set([1, 2, 3])),
      true
  );

Type parameters

| Name | | :------ | | Т |

Parameters

| Name | Type | | :------ | :------ | | setA | Set<Т> | | setB | Set<Т> |

Returns

boolean

Defined in

index.ts:12


isStrictSubset

isStrictSubset<Т>(setA, setB): boolean

Checks whether setA is a strict (proper) subset of setB. The operation is denoted by setA ⊂ setB.

 assert.equal(
     isStrictSubset(new Set([1, 2]), new Set([1, 2, 3])),
     true
 );
 assert.equal(
     isStrictSubset(new Set([1, 2]), new Set([1, 2])),
     false
 );

Type parameters

| Name | | :------ | | Т |

Parameters

| Name | Type | | :------ | :------ | | setA | Set<Т> | | setB | Set<Т> |

Returns

boolean

Defined in

index.ts:41


isSuperset

isSuperset<T>(setA, setB): boolean

Checks whether setA is a superset of setB. The operation is denoted by setA ⊇ setB.

  assert.equal(
      isSuperset(new Set([1, 2, 3]), new Set([1, 2])),
      true
  );

Type parameters

| Name | | :------ | | T |

Parameters

| Name | Type | | :------ | :------ | | setA | Set<T> | | setB | Set<T> |

Returns

boolean

Defined in

index.ts:60


isStrictSuperset

isStrictSuperset<T>(setA, setB): boolean

Checks whether setA is a strict (proper) superset of setB. The operation is denoted by setA ⊃ setB.

 assert.equal(
     isStrictSuperset(new Set([1, 2, 3]), new Set([1, 2])),
     true
 );
 assert.equal(
     isStrictSuperset(new Set([1, 2]), new Set([1, 2])),
     false
 );

Type parameters

| Name | | :------ | | T |

Parameters

| Name | Type | | :------ | :------ | | setA | Set<T> | | setB | Set<T> |

Returns

boolean

Defined in

index.ts:82


isEqual

isEqual<T>(setA, setB): boolean

Checks whether setA is structurally equal to setB.

 assert.equal(
     isEqual(new Set([1, 2, 3]), new Set([2, 3, 1])),
     true
 );
 assert.equal(
     isEqual(new Set([1, 2, 3]), new Set([1, 2])),
     false
 );

Type parameters

| Name | | :------ | | T |

Parameters

| Name | Type | | :------ | :------ | | setA | Set<T> | | setB | Set<T> |

Returns

boolean

Defined in

index.ts:103


union

union<T>(setA, setB, ...restSets): Set<T>

Returns new set which contains all elements from each set. The operation is denoted by setA ⋃ setB.

   assert.deepEqual(
       union(new Set([1, 2]), new Set([3, 4])),
       new Set([1, 2, 3, 4])
   );
   assert.deepEqual(
       union(new Set([1, 2]), new Set([3, 4]), new Set([5, 6])),
       new Set([1, 2, 3, 4, 5, 6])
   );

Type parameters

| Name | | :------ | | T |

Parameters

| Name | Type | | :------ | :------ | | setA | Set<T> | | setB | Set<T> | | ...restSets | Set<T>[] |

Returns

Set<T>

Defined in

index.ts:129


intersect

intersect<T>(setA, setB, ...sets): Set<T>

Returns a new set with all elements of setA that also belongs to setB. The operation is denoted by setA ⋂ setB.

   assert.deepEqual(
       intersect(new Set([1, 2, 3]), new Set([2, 3, 4])),
       new Set([2, 3])
   );
   assert.deepEqual(
       intersect(new Set([1, 2, 3]), new Set([2, 3, 4]), new Set([2, 3, 5])),
       new Set([2, 3])
   );

Type parameters

| Name | | :------ | | T |

Parameters

| Name | Type | | :------ | :------ | | setA | Set<T> | | setB | Set<T> | | ...sets | Set<T>[] |

Returns

Set<T>

Defined in

index.ts:163


difference

difference<T>(setA, setB, ...sets): Set<T>

Returns a new set with all elements of setA that not belongs to setB. The operation is denoted by setA \ setB.

   assert.deepEqual(
       difference(new Set([1, 2, 3]), new Set([3, 4, 5])),
       new Set([1, 2])
   );
   assert.deepEqual(
       difference(new Set([1, 2, 3, 4, 5]), new Set([3, 4]), new Set([4, 5])),
       new Set([1, 2])
   );

Type parameters

| Name | | :------ | | T |

Parameters

| Name | Type | | :------ | :------ | | setA | Set<T> | | setB | Set<T> | | ...sets | Set<T>[] |

Returns

Set<T>

Defined in

index.ts:202


symmetricDifference

symmetricDifference<T>(setA, setB, ...sets): Set<T>

Returns a new set with all elements of setA that not belongs to setB and vice versa. The operation is denoted by setA ∆ setB.

   assert.deepEqual(
       symmetricDifference(new Set([1, 2, 3]), new Set([3, 4, 5])),
       new Set([1, 2, 4, 5])
   );
   assert.deepEqual(
       symmetricDifference(new Set([1, 2, 3, 4]), new Set([3, 4, 5, 6]), new Set([4, 5, 7])),
       new Set([1, 2, 6, 7])
   );

Type parameters

| Name | | :------ | | T |

Parameters

| Name | Type | | :------ | :------ | | setA | Set<T> | | setB | Set<T> | | ...sets | Set<T>[] |

Returns

Set<T>

Defined in

index.ts:241