Skip to content

Commit

Permalink
🐛 docs: Give -> Obtain
Browse files Browse the repository at this point in the history
  • Loading branch information
wolfram77 committed Dec 8, 2022
1 parent c2118b0 commit f63bf23
Show file tree
Hide file tree
Showing 4 changed files with 19 additions and 19 deletions.
16 changes: 8 additions & 8 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -133,14 +133,14 @@ var x = new Set([1, 2, 3]);
| [join] | Join values together into a string. |
| | |
| [isDisjoint] | Check if sets have no value in common. |
| [union] | Give values present in any set. |
| [union$] | Give values present in any set. |
| [intersection] | Give values present in both sets. |
| [intersection$] | Give values present in both sets. |
| [difference] | Give values not present in another set. |
| [difference$] | Give values not present in another set. |
| [symmetricDifference] | Give values not present in both sets. |
| [symmetricDifference$] | Give values not present in both sets. |
| [union] | Obtain values present in any set. |
| [union$] | Obtain values present in any set. |
| [intersection] | Obtain values present in both sets. |
| [intersection$] | Obtain values present in both sets. |
| [difference] | Obtain values not present in another set. |
| [difference$] | Obtain values not present in another set. |
| [symmetricDifference] | Obtain values not present in both sets. |
| [symmetricDifference$] | Obtain values not present in both sets. |
| [cartesianProduct] | List cartesian product of sets. |

<br>
Expand Down
4 changes: 2 additions & 2 deletions package-lock.json

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

2 changes: 1 addition & 1 deletion package.json
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
{
"name": "extra-set",
"version": "3.1.2",
"version": "3.1.3",
"description": "A pack of functions for working with Sets.",
"main": "index.js",
"module": "index.mjs",
Expand Down
16 changes: 8 additions & 8 deletions src/index.ts
Original file line number Diff line number Diff line change
Expand Up @@ -851,7 +851,7 @@ export function isDisjoint<T>(x: Set<T>, y: Iterable<T>): boolean {


/**
* Give values present in any set.
* Obtain values present in any set.
* @param x a set
* @param y another set
* @returns x ∪ y = \{v | v ∈ x or v ∈ y\}
Expand All @@ -862,7 +862,7 @@ export function union<T>(x: Iterable<T>, y: Iterable<T>): Set<T> {


/**
* Give values present in any set.
* Obtain values present in any set.
* @param x a set (updated)
* @param y another set
* @returns x = x ∪ y = \{v | v ∈ x or v ∈ y\}
Expand All @@ -873,7 +873,7 @@ export function union$<T>(x: Set<T>, y: Iterable<T>): Set<T> {


/**
* Give values present in both sets.
* Obtain values present in both sets.
* @param x a set
* @param y another set
* @returns x ∩ y = \{v | v ∈ x, v ∈ y\}
Expand All @@ -887,7 +887,7 @@ export function intersection<T>(x: Set<T>, y: Iterable<T>): Set<T> {


/**
* Give values present in both sets.
* Obtain values present in both sets.
* @param x a set (updated)
* @param y another set
* @returns x = x ∩ y = \{v | v ∈ x, v ∈ y\}
Expand All @@ -900,7 +900,7 @@ export function intersection$<T>(x: Set<T>, y: Set<T>): Set<T> {


/**
* Give values not present in another set.
* Obtain values not present in another set.
* @param x a set
* @param y another set
* @returns x - y = \{v | v ∈ x, v ∉ y\}
Expand All @@ -914,7 +914,7 @@ export function difference<T>(x: Set<T>, y: Set<T>): Set<T> {


/**
* Give values not present in another set.
* Obtain values not present in another set.
* @param x a set (updated)
* @param y another set
* @returns x = x - y = \{v | v ∈ x, v ∉ y\}
Expand All @@ -927,7 +927,7 @@ export function difference$<T>(x: Set<T>, y: Iterable<T>): Set<T> {


/**
* Give values not present in both sets.
* Obtain values not present in both sets.
* @param x a set
* @param y another set
* @returns x-y ∪ y-x
Expand All @@ -943,7 +943,7 @@ export function symmetricDifference<T>(x: Set<T>, y: Set<T>): Set<T> {


/**
* Give values not present in both sets.
* Obtain values not present in both sets.
* @param x a set (updated)
* @param y another set
* @returns x = x-y ∪ y-x
Expand Down

0 comments on commit f63bf23

Please sign in to comment.