pedropedruzzi

// Copyright (c) 2023 Vendah Atividades de Internet LTDA. All rights reserved.
// 
// This work is licensed under the terms of the MIT license.
// Get a copy at https://opensource.org/licenses/MIT.

export async function runWithLimitedConcurrency<T>(concurrency: number, jobs: (() => Promise<T>)[]): Promise<T[]> {
    const setsOfJobs = batchify(jobs, Math.ceil(jobs.length / concurrency));
    const promises: Promise<T[]>[] = [];
    for (const [setIndex, setOfJobs] of setsOfJobs.entries()) {
        const instrumentedSetOfJobs = setOfJobs.map((job, jobIndex) => () => {

pedropedruzzi

// https://noticias.uol.com.br/eleicoes/2022/apuracao/2turno/votos-por-estado/presidente/
function compute() {
    const states = document.querySelectorAll('.president-by-state')
    const estimates = {};
    let computedVotes = 0, minComputePercentPerState = 100, minComputePercentState;

    for (const state of states) {
        const stateName = state.querySelector('.president-by-state-label').innerText;
        const stateVoters = Number(state.querySelector('.voters').innerText.replace(/\D/g, ''));
        const computedPercent = parseFloat(state.querySelector('.president-by-state-apuration .percentage').innerText.replace(',', '.'));

pedropedruzzi

interface Shape {
    name: string;
}

interface Square extends Shape {
    length: number;
}

interface Circle extends Shape {
    radius: number;

pedropedruzzi

// ==UserScript==
// @name         MiBACT Antenati direct image links on galleries
// @namespace    http://tampermonkey.net/
// @version      0.1
// @description  Replaces links on image galleries with direct (faster) image links
// @author       Pedro Pedruzzi
// @match        http://dl.antenati.san.beniculturali.it/v/*
// @grant        none
// @downloadURL  https://gist.github.com/pedrox/365fd278393b651a9e6780e7866c469d/raw/MiBACT-Antenati-direct-image-links.user.js
// ==/UserScript==

pedropedruzzi

package algorithms;

import java.util.Arrays;
import java.util.LinkedList;
import java.util.Random;

public class QuickSort {

    private static class Interval {
        int low;

pedropedruzzi

import random

def solve(a):
    n = len(a)
    # get inside the loop by moving n steps (better approach is part 1 of Floyds's below)
    x = 0
    for i in range(n):
        x = a[x]
    # measure the period
    period = 1

pedropedruzzi

// ==UserScript==
// @name         Download na busca do legendas.tv
// @namespace    http://tampermonkey.net/
// @version      0.4
// @description  Permite download de legendas a partir dos resultados de busca do site legendas.tv
// @author       Pedro Pedruzzi
// @match        http://legendas.tv/busca/*
// @match        https://legendas.tv/busca/*
// @grant        none
// @downloadURL  https://gist.githubusercontent.com/pedropedruzzi/f25a010f8a787352575d8f312433979b/raw/download-na-busca-do-legendas-tv.user.js

pedropedruzzi

use std::cmp;

// Note: this is a suboptimal solution made to exercise the Rust language.

// Approach A: using a struct/class
// Gotcha: Had to add lifetime specifier to store a reference to the byte array of a external
// string inside my struct.

struct Rnaa<'a> {
    chain: &'a [u8], // 'a is to get rid of "missing lifetype specifier"

pedropedruzzi

# gets list of key walls from a sorted list of walls
def _keywalls(walls):
    prevheight = pos = highest = 0
    keywalls = []
    for pos, height in walls:
        if height > highest: # raises globally
            highest = height
        elif height >= prevheight: # raises locally
            while keywalls[-1][1] < height:
                keywalls.pop() # discard recent walls until we see with one higher than height (always occurs)

pedropedruzzi

#include <iostream>


#define STRONG_TYPEDEF(original, newtype)               \
        class newtype : public original                 \
        {                                               \
            using original::original;                   \
        };

using Age = unsigned int;