Huge News!Announcing our $40M Series B led by Abstract Ventures.Learn More
Socket
Sign inDemoInstall
Socket

extra-lists

Package Overview
Dependencies
Maintainers
1
Versions
150
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

extra-lists - npm Package Compare versions

Comparing version 2.2.7 to 2.2.8

2

package.json
{
"name": "extra-lists",
"version": "2.2.7",
"version": "2.2.8",
"description": "Lists is a pair of key list and value list, with unique keys.",

@@ -5,0 +5,0 @@ "main": "index.js",

[Lists] is a pair of key list and value list, with unique keys. [:running:] [:vhs:] [:package:] [:moon:] [:ledger:]
Methods as separate packages:
- `@extra-lists/find`: use [rollup] to bundle this es module.
- `@extra-lists/find.min`: use in browser ([browserify], [uglify-js]).
In this fourth Crust of Rust video, we cover smart pointers and interior

@@ -14,4 +10,10 @@ mutability, by re-implementing the Cell, RefCell, and Rc types from the

Methods as separate packages:
- `@extra-lists/find`: use [rollup] to bundle this es module.
- `@extra-lists/find.min`: use in browser ([browserify], [uglify-js]).
> Stability: Experimental.
<br>
```javascript

@@ -48,54 +50,59 @@ const lists = require('extra-lists');

### reference
<br>
<br>
| Method | Action
|-----------------------|-------
| [is] | Checks if value is lists.
| [get] | Gets value at key.
| [set] | Sets value at key.
| [remove] | Deletes an entry.
| [swap] | Exchanges two values.
| [size] | Gets size of lists.
| |
| [head] | Gets first entry.
| [take] | Keeps first n entries only.
| [shift] | Removes first entry.
| [fromEntries] | Creates lists from entries.
| |
| [concat] | Appends entries from all lists.
| [flat] | Flattens nested lists to given depth.
| [chunk] | Breaks lists into chunks of given size.
| [filterAt] | Gets lists with given keys.
| |
| [map] | Updates values based on map function.
| [filter] | Keeps entries which pass a test.
| [reduce] | Reduces values to a single value.
| [range] | Finds smallest and largest entries.
| [count] | Counts values which satisfy a test.
| [partition] | Segregates values by test result.
| [cartesianProduct] | Lists cartesian product of lists.
| [some] | Checks if any value satisfies a test.
| [zip] | Combines matching entries from all lists.
| |
| [union] | Gives lists present in any lists.
| [intersection] | Gives entries present in both lists.
| [difference] | Gives entries of lists not present in another.
| [symmetricDifference] | Gives entries not present in both lists.
| [isDisjoint] | Checks if lists have no common keys.
| |
| [key] | Picks an arbitrary key.
| [value] | Picks an arbitrary value.
| [entry] | Picks an arbitrary entry.
| [subset] | Picks an arbitrary submap.
| |
| [isEmpty] | Checks if lists is empty.
| [isEqual] | Checks if two lists are equal.
| [compare] | Compares two lists.
| [find] | Finds a value passing a test.
| [search] | Finds key of an entry passing a test.
| [scanWhile] | Finds key of first entry not passing a test.
## Index
| Method | Action |
| --------------------- | ---------------------------------------------- |
| [is] | Checks if value is lists. |
| [get] | Gets value at key. |
| [set] | Sets value at key. |
| [remove] | Deletes an entry. |
| [swap] | Exchanges two values. |
| [size] | Gets size of lists. |
| |
| [head] | Gets first entry. |
| [take] | Keeps first n entries only. |
| [shift] | Removes first entry. |
| [fromEntries] | Creates lists from entries. |
| |
| [concat] | Appends entries from all lists. |
| [flat] | Flattens nested lists to given depth. |
| [chunk] | Breaks lists into chunks of given size. |
| [filterAt] | Gets lists with given keys. |
| |
| [map] | Updates values based on map function. |
| [filter] | Keeps entries which pass a test. |
| [reduce] | Reduces values to a single value. |
| [range] | Finds smallest and largest entries. |
| [count] | Counts values which satisfy a test. |
| [partition] | Segregates values by test result. |
| [cartesianProduct] | Lists cartesian product of lists. |
| [some] | Checks if any value satisfies a test. |
| [zip] | Combines matching entries from all lists. |
| |
| [union] | Gives lists present in any lists. |
| [intersection] | Gives entries present in both lists. |
| [difference] | Gives entries of lists not present in another. |
| [symmetricDifference] | Gives entries not present in both lists. |
| [isDisjoint] | Checks if lists have no common keys. |
| |
| [key] | Picks an arbitrary key. |
| [value] | Picks an arbitrary value. |
| [entry] | Picks an arbitrary entry. |
| [subset] | Picks an arbitrary submap. |
| |
| [isEmpty] | Checks if lists is empty. |
| [isEqual] | Checks if two lists are equal. |
| [compare] | Compares two lists. |
| [find] | Finds a value passing a test. |
| [search] | Finds key of an entry passing a test. |
| [scanWhile] | Finds key of first entry not passing a test. |
<br>
<br>
[![nodef](https://merferry.glitch.me/card/extra-lists.svg)](https://nodef.github.io)
[![](https://img.youtube.com/vi/8O0Nt9qY_vo/maxresdefault.jpg)](https://www.youtube.com/watch?v=8O0Nt9qY_vo)

@@ -102,0 +109,0 @@ [(1)]: https://www.youtube.com/watch?v=8O0Nt9qY_vo

SocketSocket SOC 2 Logo

Product

  • Package Alerts
  • Integrations
  • Docs
  • Pricing
  • FAQ
  • Roadmap
  • Changelog

Packages

npm

Stay in touch

Get open source security insights delivered straight into your inbox.


  • Terms
  • Privacy
  • Security

Made with ⚡️ by Socket Inc