iczero

type Value = ObjectValue | ArrayValue | StringValue | NumberValue | BooleanValue;

interface ObjectValue {
  type: 'object';
  values: Record<string, Value>;
  optional?: boolean;
}

interface ArrayValue {
  type: 'array',

iczero

iczero

iczero

#![feature(macro_metavar_expr)]

macro_rules! repeat_2 {
    ($($what:tt)*) => {
        $($what)*
        $($what)*
    }
}

macro_rules! make_repeat_from {

iczero

import path from 'node:path';
import stream from 'node:stream';
import { git } from './spawn.js';
import { Repository } from './repository.ts';
import { FastifyPluginCallback } from 'fastify';

export const api: FastifyPluginCallback = (fastify, _opts, done) => {
    const gitSmartSchema = {
        type: 'object',
        properties: {

iczero

const formatUSD = n => '$' + n.toFixed(2).replace(/(?<=\b\d+)(?=(?:\d{3})+\b)/g, ',');

iczero

// fix encoding (utf-8 misinterpreted as latin1)
derp=(s,...n)=>n.map(v=>v.wholeText?v.data=s(v.data):derp(s,...v.childNodes));derp(s => (new TextDecoder).decode(new Uint8Array(s.split('').map(c => c.charCodeAt(0)))), document.body)

// rewrite entire page to derp
derp=(s,...n)=>n.map(v=>v.wholeText?v.data=s(v.data):derp(s,...v.childNodes));derp(s=>s.replace(/\w+/g,'derp'),document.body)

iczero

import { formatWithOptions } from 'util';
import winston, { Logform, format, transports } from 'winston';
import chalk, { ChalkInstance } from 'chalk';
import moment from 'moment';

const FORMAT_OPTIONS = {
  depth: null,
  maxArrayLength: null,
  breakLength: 120,
  colors: process.stdout.isTTY

iczero

require 'matrix.rb'

def vector_rotation_to_quaternion(v1, v2)
  b = v1.dot(v2)
  c = v1.cross(v2)
  angle = Math.atan2(c.norm(), b)
  m = Math.sin(angle / 2)
  if c.zero? then
    a = c
  else

iczero

import express from 'express';
import createDebug from 'debug';
import childProcess from 'child_process';

// RANDOM BULLSHIT AS A SERVICE (RBaaS), brought to you by iczero
// IMAGINE BEING THE PERSON THAT WROTE THIS
// i have literally spent more time writing this than thinking about the problem

// Find the shortest path from n to 1 using the operations n = n/2, n = n + 1, n = n - 1.  
// n can only be divided by 2 when it is even, and it is always an integer.