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.4 to 2.2.5

example.js

54

index.d.ts

@@ -9,4 +9,10 @@ declare module 'extra-lists' {

export type compareFn<T> = (a: T, b: T) => number;
export type Entries<T, U> = Iterable<[T, U]>;
export type Lists<T, U> = [Iterable<T>, Iterable<U>];
export type Entries<T, U> = Iterable<[
T,
U
]>;
export type Lists<T, U> = [
Iterable<T>,
Iterable<U>
];
/**

@@ -84,3 +90,6 @@ * Lists cartesian product of lists.

*/
export function entry<T, U>(x: Lists<T, U>, r?: number): [T, U];
export function entry<T, U>(x: Lists<T, U>, r?: number): [
T,
U
];
/**

@@ -187,3 +196,6 @@ * Checks if all values satisfy a test.

*/
export function hasEntry<T, U, V = U>(x: Lists<T, U>, e: [T, U], fc?: compareFn<U | V>, fm?: mapFn<T, U, U | V>): boolean;
export function hasEntry<T, U, V = U>(x: Lists<T, U>, e: [
T,
U
], fc?: compareFn<U | V>, fm?: mapFn<T, U, U | V>): boolean;
/**

@@ -220,3 +232,9 @@ * Checks if nested lists has a path.

*/
export function head<T, U>(x: Lists<T, U>, ed?: [T, U]): [T, U];
export function head<T, U>(x: Lists<T, U>, ed?: [
T,
U
]): [
T,
U
];
/**

@@ -300,3 +318,6 @@ * Gives entries present in both lists.

*/
export function max<T, U, V = U>(x: Lists<T, U>, fc?: compareFn<U | V>, fm?: mapFn<T, U, U | V>): [T, U];
export function max<T, U, V = U>(x: Lists<T, U>, fc?: compareFn<U | V>, fm?: mapFn<T, U, U | V>): [
T,
U
];
/**

@@ -310,3 +331,6 @@ * Finds smallest entry.

*/
export function min<T, U, V = U>(x: Lists<T, U>, fc?: compareFn<U | V>, fm?: mapFn<T, U, U | V>): [T, U];
export function min<T, U, V = U>(x: Lists<T, U>, fc?: compareFn<U | V>, fm?: mapFn<T, U, U | V>): [
T,
U
];
/**

@@ -319,3 +343,6 @@ * Segregates values by test result.

*/
export function partition<T, U>(x: Lists<T, U>, ft: testFn<T, U>): [Lists<T, U>, Lists<T, U>];
export function partition<T, U>(x: Lists<T, U>, ft: testFn<T, U>): [
Lists<T, U>,
Lists<T, U>
];
/**

@@ -337,3 +364,12 @@ * Segregates values by similarity.

*/
export function range<T, U, V = U>(x: Lists<T, U>, fc?: compareFn<U | V>, fm?: mapFn<T, U, U | V>): [[T, U], [T, U]];
export function range<T, U, V = U>(x: Lists<T, U>, fc?: compareFn<U | V>, fm?: mapFn<T, U, U | V>): [
[
T,
U
],
[
T,
U
]
];
/**

@@ -340,0 +376,0 @@ * Reduces values to a single value.

2

index.js

@@ -452,3 +452,2 @@ 'use strict';

}
const END = Number.MAX_SAFE_INTEGER;
function is(v) {

@@ -461,2 +460,3 @@ return v != null && typeof v[Symbol.iterator] === 'function';

}
const END = Number.MAX_SAFE_INTEGER;
function* slicePos(x, i, I) {

@@ -463,0 +463,0 @@ var k = -1;

{
"name": "extra-lists",
"version": "2.2.4",
"version": "2.2.5",
"description": "Lists is a pair of key list and value list, with unique keys.",

@@ -102,9 +102,9 @@ "main": "index.js",

"devDependencies": {
"extra-array": "^2.10.8",
"extra-build": "^1.1.27",
"extra-entries": "^2.2.10",
"extra-iterable": "^2.5.13",
"extra-map": "^2.2.7",
"extra-set": "^2.2.4"
"extra-array": "^2.10.9",
"extra-build": "^1.1.28",
"extra-entries": "^2.2.11",
"extra-iterable": "^2.5.14",
"extra-map": "^2.2.8",
"extra-set": "^2.2.5"
}
}

@@ -0,0 +0,0 @@ [Lists] is a pair of key list and value list, with unique keys. [:running:] [:vhs:] [:package:] [:moon:] [:ledger:]

Sorry, the diff of this file is not supported yet

Sorry, the diff of this file is not supported yet

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