burdiuz

/* Filters items on Steam Store search page to display only fine discounted.
 Steam Sale fine discounts
 1. Open [Steam Search page](http://store.steampowered.com/search/?sort_by=Price_ASC&specials=1)
 2. Check to be logged in, script will hide owned games
 3. Open Browser console with Ctrl+Shift+I for Chrome(Console tab), Ctrl+Shift+K for Firefox, F12 for IE.
 4. Paste code from [search-userscript.js](https://raw.githubusercontent.com/burdiuz/js-steam-fine-discounts/master/search-userscript.js) into console and press Enter
 5. Wait for fine discounts to be found and displayed
 */
(function() {
  var categories = '998,994,21,996,997'; // 998 - games

burdiuz

/**
 * Metro configuration for React Native
 * https://github.com/facebook/react-native
 *
 * @format
 */

 const path = require('path');

module.exports = {

burdiuz

import { forwardRef } from "react";
import { HorizontalAlignment, VerticalAlignment } from "./alignments";
import { getAlignmentClassNames } from "./useAlignmentClassNames";

const PopoverAlignment = (
  {
    children = () => null,
    horizontal = HorizontalAlignment.LEFT,
    vertical = VerticalAlignment.BOTTOM,
  },

burdiuz

class ByteArray {
  constructor(buffer, initPosition = 0) {
    this.buffer = typeof buffer === "number" ? new Uint8Array(buffer) : buffer;
    this.position = initPosition;
  }

  get bytesAvailable() {
    return this.buffer.length - this.position;
  }

burdiuz

source.js

burdiuz

const getNextIndex = (() => {
  let index = 1;
  const lastSafe = ((1 << 31) >>> 0) - 1;

  return () => {
    index += 1;

    if (index >= lastSafe) {
      index = 1;
    }

burdiuz

class QueueNode {
  constructor(value, prev = null, next = null) {
    this.value = value;
    this.insert(prev, next);
  }

  insert(prev, next) {
    this.prev = prev;
    this.next = next;

burdiuz

BFS applied to a grid to find shortest path

Queue implementation used here is published as separate gist queue.js.

When loaded it draws path from top left to bottom right corner. White cells are empty and black -- walls. Clicking on any cell inverts it(empty > wall and wall > empty) and forces path redraw. For now or recreates Adjacency List every time. Sometimes it cannot find path from start to the end, in this case just refresh page.

burdiuz

const getPosition = (rowLength) => (col, row) => row * rowLength + col;

const getSlotIndex = (rowLength) => {
  const pos = getPosition(rowLength);
  return (col, row) => pos(col, row) >> 3;
};

const getInSlotPosition = (rowLength) => {
  const pos = getPosition(rowLength);
  return (col, row) => pos(col, row) % 8;

burdiuz

const karatsuba = (x, y, l) => {
  if (l <= 2) {
    return x * y;
  }

  const l_2 = l / 2n;
  const half = 10n ** l_2;

  const a = x / half;
  const b = x % half;