# set-simplified-js

> Set implementation with some extra utils

Latest version **1.0.5** (published 2021-02-13) · ISC license · 0 weekly downloads

## Install

```sh
npm install set-simplified-js
pnpm add set-simplified-js
yarn add set-simplified-js
bun add set-simplified-js
```

## Health

**Score 15/100 (F)** — status: abandoned.

Positive: no vulnerabilities.

Warnings: low downloads; no types; no esm support.

Negative: abandoned; low maintenance score.

## Facts

| | |
|---|---|
| Version | 1.0.5 |
| Published | 2021-02-13 |
| First published | 2021-02-13 |
| Weekly downloads | 0 |
| License | ISC |
| TypeScript types | none |
| Module format | CommonJS |
| Dependencies | 0 |
| Unpacked size | 7.9 KB |
| Known vulnerabilities | 0 |
| Install scripts | no |
| Author | Aman Moar |
| Maintainers | aman-moar-277 |
| Keywords | set, union, intersection, set-js, set-simplified-js, aman |

## Links

- npm: https://www.npmjs.com/package/set-simplified-js
- Repository: https://github.com/amanmoar277/set-simplified-js
- Homepage: https://github.com/amanmoar277/set-simplified-js#readme
- Issues: https://github.com/amanmoar277/set-simplified-js/issues
- npm.io page: https://npm.io/package/set-simplified-js

## Alternatives

- [jsforce](https://npm.io/package/jsforce.md) — 851.2K weekly downloads
- [react-native-qrcode-svg](https://npm.io/package/react-native-qrcode-svg.md) — 693.5K weekly downloads
- [@salesforce/plugin-data](https://npm.io/package/@salesforce/plugin-data.md) — 394.9K weekly downloads
- [@backstage/plugin-search-common](https://npm.io/package/@backstage/plugin-search-common.md) — 308.5K weekly downloads
- [@chain-registry/types](https://npm.io/package/@chain-registry/types.md) — 38.4K weekly downloads

## Recent versions

- 1.0.5 (latest) — 2021-02-13
- 1.0.4 — 2021-02-13
- 1.0.3 — 2021-02-13
- 1.0.2 — 2021-02-13
- 1.0.1 — 2021-02-13
- 1.0.0 — 2021-02-13

## README

# set-js
import { Set, SetExtended } from 'set-js';


# SetExtended Methods
SetExtended can be used for union and intersection only. In the form<br /><br />

const unionResult = SetExtended.union(s1, s2);<br />
const intersectionResult = SetExtended.intersection(s1, s2)

# Set Methods
const set = new Set(params);
set.add(params);<br />
set.has(params);<br />
set.delete(params);<br />
set.clear();<br />
set.size;<br /><br />

const unionArr = set1.union(set2);<br />
const intersectArr = set1.intersection(set2);<br />

# params can be -> 
1. array -> [1,2,3]<br />
2. single_element -> 3<br />
3. elements_comma_separated -> 1,2,3<br />

# Methods implemention
1. How to initiate<br />
<br />
const s1 = new Set([10,1,2]);<br />
const s2 = new Set(10,1,2);<br />
<br />
<br />
2. Adding elements<br />
<br />
// .add(params)<br />
// return -> nothing<br />
<br />
s1.add([[3],4,5]);<br />
s1.add(0,1,2);<br />
s1.add(0);<br />
<br />
<br />
<br />
3. Check for element existance
<br />
// .has(params)<br />
// return -> true(if all elements are present) || false(if any elements is not present)<br />
<br />
s1.has([10,0])       // true (all elements present)<br />
s1.has(100)          // false<br />
s1.has(10,0)         // true (all elements present)<br />
<br />
<br />
<br />
4. Delete element or elements
<br />
// .delete(params)<br />
// return -> true(if any one is present and deleted) || false(if any one is present and deleted)<br />
<br />
s1.delete([10, 500, [[[80]]]])      // true <br />
s1.delete(10, 500)                  // false (10 already deleted and 500 not present so none of these present) <br />
s1.delete(10)                       // false<br />
s1.has(10)                          // false<br />
<br />
<br />
<br />
5. Clear all elements
<br />
// .clear()<br />
// return -> nothing<br />
<br />
s1.clear()<br />
<br />
<br />
<br />
6. Get total number of elements present
<br />
// .size<br />
// return -> number<br />
<br />
s1.size<br />
<br />
<br />
<br />
7. Union of two sets
<br />
// .union(set2)<br />
<br />
const arr = s1.union(s2)<br />
<br />
<br />
<br />
8. Intersection of two sets
<br />
// .intersection(set2)<br />
<br />
const arr1 = s1.intersection(s2)<br />
<br />
<br />

---
_Source: https://npm.io/package/set-simplified-js · Machine-readable twin of the npm.io package page. Health data is recomputed on every publish._