Novel Preposterous Mockery

    lazycst


    theLAZYmd

    Packages 13

    • A simple Aho-Corasick library using the latest ES6 modules and allowing user-specifiable options. The fastest string-matching algoithm for a fixed number of pre-known substrings.

      published 1.2.2 3 years ago
    • The best NodeJS client for the Lichess API

      published 2.0.15 a year ago
    • The best library to parse a function into its parameter names.

      published 1.0.1 4 years ago
    • Modernising and maintaining the fs-reverse code

      published 1.0.0 3 years ago
    • A node-JS version of the English Chess Federation (ECF) grading database. Works by scraping the webpages generated (so you don't have to!), until such time they choose to build a proper API.

      published 1.0.11 2 years ago
    • Discord bot operating in the House server http://dscrd.me/housechessvariants just to further lazy's understanding of basic js.

      published 1.10.11 3 years ago
    • A selector for object properties - for dealing with large data objects where access should be dynamic, easy, and intuitive

      published 1.1.4 a year ago
    • A functional calendar renderer for events from a google calendar

      published 2.1.4 2 years ago
    • Hello prospective contributer to the Oxford University Chess Club website! You're about to enter the wonderful world of a technology called **React**. This document is designed as an introduction to that technology and an onboarding for you to maintain it

      published 1.1.9 3 years ago
    • A fully-fledged API to run an election in Node.JS with IRV, STV, and FPTP support

      published 1.0.2 3 years ago
    • "Scraper for FIDE website"

      published 0.1.9 2 years ago
    • Implementation of Misra & Gries edge colouring algorithm that produces at most d+1 colours, where d is the maximum degree of the graph. Supports an arbitary number of nodes.

      published 1.0.0 2 years ago
    • Implementation of Misra & Gries edge colouring algorithm that produces at most d+1 colours, where d is the maximum degree of the graph. Supports an arbitary number of nodes.

      published 1.0.0 2 years ago