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

dotless

v1.2.0

Published

dotless : Linq in JavaScript, and Railways Programming

Downloads

19

Readme

dotless

A JavaScript library to write linq style functional code

Why dotless?

Its an experimental library providing functions required to write functional style programs with JavaScript, and which can work with generator functions, providing capability for lazy evaluation. I developed this library to solve puzzles from Advent Of Code.

All the functions are independent to each other and not defined as part of one single class. They can be composed along with other functions.

Installation

npm i dotless --save

or

yarn add dotless

Example

const items = query(
    // Range returns numbers from 1 to 10
    range(1, 10),
    // Take which are divided by 3
    filter(n => n % 3 === 0),
    // Multiply them by 2
    map(n => n * 2),
    // Convert to Array
    toArray
);
// [6, 12, 18]
console.log(items);

Functions

  1. any

    // returns true as list contains even number
    any(x => x % 2 === 0)([1, 2, 4])
    // returns false as the list is empty
    any()([]);
    // return true as the list has items
    any()([1, 2, 3]);
  2. count

    /*
    returns 1
    */
    count(n => n % 2 === 0)([1, 2, 3]);
  3. countBy

    /*
    returns {
     "1" : 4,
     "2" : 2,
     "3" : 1,
     "4" : 2
    } */
    countBy()([1, 2, 2, 1, 1, 1, 3, 4, 4]);
    
    const oddOrEven = countBy(n => n % 2 ? "odd" : "even"); 
    /* returns {
        "odd" : 5,
        "even" : 4
    } */
    oddOrEven([1, 2, 3, 4, 5, 6, 7, 8, 9])
  4. cycle

    /*
    Iterates infinitely over a collection
    
    returns [1, 2, 3, 1, 2, 3, 1, 2, 3, 1]
    */
    query(cycle([1, 2, 3]), 
          take(10),
          toArray);
  5. each

    /*
    Calls a method for every item in iterator
    The iterator must be consumed (toArray, count)
    Updates every property "v" for every item
    */
    const input = [{ n: 1, v: false}, 
                   { n: 2, v: false}];
    query(input,
       each(p => { p.v = true; }),
       count(p => p.v)
    );
  6. filter

    // works similar to Array.filter
    const onlyOdd = filter(n => n % 2 !== 0)
    // Returns [1, 3, 5, 7, 9]
    onlyOdd([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
  7. findPairs

    // helps finding pairs from source
    // pairs can be
    // - mutuallyExclusive like a can divide b, but b can't divide b
    // - not exclusive like a === b or a = reverse(b)
    const itemsWithTheirDoubles = findPairs(
         (a, b) => a * 2 === b,
         // The list is mutually exclusive
         true
    );
    /* returns array of [
          a,  b, index of A, index of B
         [2,  4, 0, 2],
         [3,  6, 3, 1],
         [7, 14, 5, 4]
    ]; */
    itemsWithTheirDoubles([2, 6, 4, 3, 14, 7]);
    
    const duplicateItems = findPairs((a, b) => a === b);
    /* returns array of [
          a,  b, index of A, index of B
         [2, 2, 0, 6],
         [6, 6, 1, 3],
         [1, 1, 4, 7]
    ]; */
    duplicateItems([2, 6, 4, 6, 1, 8, 2, 1]);
    
    const duplicateItemsMutuallyExclusive = findPairs((a, b) => a === b, true);
    /* returns array of [
          a,  b, index of A, index of B
         [2, 2, 0, 6],
         [6, 6, 1, 3],
         [6, 6, 3, 1],
         [1, 1, 4, 7],
         [2, 2, 6, 0],
         [1, 1, 7, 4]
    ]; */
    duplicateItemsMutuallyExclusive([2, 6, 4, 6, 1, 8, 2, 1]);
  8. first

    // returns 11
    first()([11, 12, 13]);
    
    // returns null
    first()([]);
    
    // returns 2
    first(x => x % 2 === 0)([1, 2, 4]);
    
    // the predicate can maintain its state
    const seenBefore = () => {
         const seen = {};
         return (n) => {
             if (seen[n]) {
                 return true;
             } else {
                 seen[n] = true;
                 return false;
             }
         };
    };
    const firstDuplicate = first(seenBefore());
    // returns 2
    firstDuplicate([1, 2, 4, 2, 5, 4]);
  9. groupBy

    // groupBy by property
    const timNY = { n: "Tim",  s : "NY"};
    const billWA = { n: "Bill", s : "WA"};
    const steveCA = { n: "Steve", s : "CA"};
    const andrewWA = { n: "Andrew", s : "WA"};
    const input = [
        timNY,
        billWA,
        steveCA,
        andrewWA
    ];
    /* returns {
       "NY" : [timNY],
       "CA" : [steveCA],
       "WA" : [billWA, andrewWA]
    } */
    groupBy("s")(input);
    
    // groupBy by function
    const input = [1, 2, 3, 4, 5, 6, 7, 8, 9];
    /* returns {
        "odd" : [1, 3, 5, 7, 9],
        "even" : [2, 4, 6, 8]
    } */
    groupBy(n => n % 2 ? "odd" : "even")(input);
  10. iterate

    // acts as an infinite loop
    // first it yields the default value
    // and calls iterator to generate values
    // returns [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
    query(
       iterate(([a, b]) => [b, a + b], [0, 1]),
       map(([a, _]) => a),
       take(10),
       toArray
    );
  11. map

    // similar to Array.map
    const doubleIt = map(n => n * 2);
    // returns [4, 6, 8, 10];
    doubleIt([2, 3, 4, 5]);
  12. mapMany

     const expand = mapMany(function*(n) {
         for (let i = 0; i <= n; i++) {
             yield i;
         }
    });
    // returns [0, 1, 2, 0, 1, 2, 3];
    expand([2, 3]);
  13. mapWithLast

    // Combines reduce and map
    // instead of returning a single accumulator returns iterator of accumulator
    const location = { distance : 0, hops : 0};
    const strides = [1, 4, 2];
    const run = mapWithLast(({distance, hops}, stride: number) => ({
        distance: distance + stride,
        hops: hops + 1
    }), location);
    // returns [{distance: 1, hops: 1}, {distance: 5, hops: 2}, {distance: 7, hops: 3}]
    run(strides);
  14. matchesToArray

    // Applies regex to string and maps matches to array
    // matches can be converted using an optional convertor
    const input = "p=<3088,2748,-1039>, v=<-103,-136,94>";
    const regex = /-*\d+/g;
    // returns [3088, 2748, -1039, -103, -136, 94]
    matchesToArray(input, regex, m => +m[0]);
  15. query

    // The engine of the library
    // Takes array of functions
    // The first parameter can be argument or a function returning a value
    // query(1, a, b, c) === c(b(a(1)))
    // returns 36
    query(
       range(1, 10),
       filter(n => n % 3 === 0),
       map(n => n * 2),
       reduce((acc, n) => acc + n, 0)
    );
  16. range

    // returns [1, 3, 5, 7]
    range(1, 8, 2)
    
    // returns [11, 12, 13, 14]
    range(11, 14)
    
    // returns [8, 6, 4, 2]
    range(8, 1, -2)
  17. reduce

    // works similar to Array.reduce, with a little change the seed value is not optional
    const sumIt = reduce((acc, n) => acc + n, 0);
    // returns 55
    const actual = sumIt([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
  18. sort, ascendingBy, ascendingByLocale, descendingBy, descendingByLocale, mergeCompareFns

    const tim12 = { name : "Tim",  age : 12 };
    const abe21 = { name : "Abe",  age : 21 };
    const mark21 = { name : "Mark", age : 21 };
    const bill22 = { name : "Bill", age : 22 };
    const items = [ tim12, abe21, mark21, bill22 ];
    const sorter = sort(descendingBy("age"), ascendingBy("name"));
    // returns [ bill22, abe21, mark21, tim12 ]
    sorter(items);
    // sort the items array as follows [ bill22, abe21, mark21, tim12 ]
    // mergeCompareFns merge functions to use them with inbuilt "sort" method
    items.sort(mergeCompareFns(descendingBy(i => i.age), ascendingBy("name")))
    
    const f1 = { name: "AB", online: true, surname: "G" };
    const f2 = { name: "CD", online: false, surname: "G" };
    const f3 = { name: "EF", online: true, surname: "K" };
    const f4 = { name: "GH", online: false, surname: "K" };
    const f5 = { name: "IJ", online: true, surname: "G" };
    const fs = [f1, f2, f3, f4, f5];
    
    const onlineSorter = (a: Friend, b: Friend) =>
        a.online === b.online ? 0 : a.online ? -1 : 1;
    const friendSorter = mergeCompareFns(
        onlineSorter,
        // Only properties of String type can be passed here
        ascendingByLocale("surname"),
        // You can also pass, two more parameters
        // locales and options
        // Refer https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/localeCompare 
        ascendingByLocale("name", 'de', { sensitivity: 'base' })
    );
    
    // returns [f1, f5, f3, f2, f4]
    fs.sort(friendSorter);
  19. take

    const takeTwo = take(2);
    // returns [11, 12]
    takeTwo([11, 12, 13, 14]);
  20. toArray

    // Just an alias for Array.from
    // Returns [1, 2, 3, 4] by consuming iterator returned by range
    toArray(range(1, 4))
  21. Result<T>

    A type simile to Maybe, it combines two types SuccessResult<T> and ErrorResult.

    function divide(
      a: number, 
      b: number) : Result<number> {
       if(b === 0) {
         return new ErrorResult("Can not divide by 0.");
       }
       return new SuccessResult(a / b);
    }
    const r = divide(4, 2);
    if(r.IsSuccess) {
        console.log(`Result is ${r.value}`);
    } else {
        console.log(r.message);
    }
  22. PromiseResult<T>

    A type which combines Promise and Result<T>.

  23. keptPromise

    A function which wraps, creating Promise which returns PromiseResult.

    function divide(
        a: number, 
        b: number) : PromiseResult<number> {
        return keptPromise((success, failure) => {
            if(b === 0) {
                failure("Can not divide by 0.");
            } else {
                success(a / b);
            }
        });
    }
  24. buildTrain

    Executes functions returning Result<T> and returns their SuccessResult values as Array. If a function returns ErrorResult, then it halts the execution and returns that ErrorResult.

    const a = 12;
    const b = true;
    const c = "done";
    const r = buildTrain(
       () => new SuccessResult(a),
       () => new SuccessResult(b),
       () => new SuccessResult(c)
    );
    expect(r.IsSuccess).toEqual(true);
    if (r.IsSuccess) {
       const [x, y, z] = r.value;
       expect(x).toEqual(a);
       expect(y).toEqual(b);
       expect(z).toEqual(c);
    }
  25. relayTrain

    This is similar to query, but takes functions returning Result<T>. It pass the result from previous function to next function. Halts processing if a function returns ErrorResult and returns that ErrorResult.

    const r = relayTrain(
        () => new SuccessResult("1234567890"),
        data => new SuccessResult(data.length),
        len => new SuccessResult(len % 2 === 0)
    );
    expect(r.IsSuccess).toEqual(true);
    if (r.IsSuccess) {
     expect(r.value).toEqual(true);
    }
  26. relayTrainAsync

    This is similar to relayTrain, but takes functions returning PromiseResult<T>. Useful to run chained async functions. Same can be achieved by chaining them with '.then', but has advantage of simplifying the state to check status of PromiseResult.

    const r = await relayTrainAsync(
      // Returns PromiseResult<User>
      () => getUserProfileAsync(),
      // Returns PromiseResult<PostId[]>
      (user) => getPostsAsync(u.id),
      // Returns PromiseResult<PostDetails[]>
      (ps) => getPostDetails(ps)
    );

Refer tests for more examples, samples folder contain AOC puzzles solved with query functions.

Read this article which explains query and related operators.

Read this article which explains keptPromise.