bisqwit

#include <unordered_map>
#include <type_traits>
#include <queue>
#include <vector>
#include <algorithm>
#include <optional>

/**
 * \fn Dijkstra<DistanceType,NodeType>(firstnode, lastnode, for_all_neighbors_of, return_route)
 * \brief Searches for the shortest route between nodes `firstnode` and `lastnode`.

bisqwit

<?php

/* THIS SCRIPT EDITS *ALL* YOUTUBE VIDEOS BELONGING TO THE AUTHENTICATED USER,
 * AND REPLACES http:// LINKS WITH https:// LINKS IN THE VIDEO DESCRIPTION.
 * ONLY LINKS MATCHING A WHITELIST ARE MODIFIED (see preg_replace below).
 * Copyright © 2018 Joel Yliluoma — https://iki.fi/bisqwit/
 * License: MIT
 */

/* Note: You will need to create OAuth credentials at: https://console.developers.google.com/apis/credentials

bisqwit

#include <utility>
/* https://godbolt.org/z/9ic5bL

A child couldn’t sleep, so her mother told a story about a little frog,
  who couldn’t sleep, so the little frog’s mother told a story about a little bear,
    who couldn’t sleep, so the little bear’s mother told a story about a little weasel
      — who fell asleep;
    … and the little bear fell asleep;
  … and the little frog fell asleep;
… and the child fell asleep.

bisqwit

<?php

/* Word-wrapping code from Simon’s Quest Multilingual Retranslation project
 * Copyright © 2020 Joel Yliluoma — https://iki.fi/bisqwit/cv2fin/
 */
class WordWrapState
{
  // Output state
  var $x=0,$y=0, $outcome='';
  // Input state

bisqwit

import numpy as np
import scipy
import traceback as tb

def latexnum(n, num_decimals=6):
  s = "%.*g" % (num_decimals, n)
  s = s.replace('e+', '\\cdot 10^{')
  s = s.replace('e-', '\\cdot 10^{-')
  if '{' in s: s += '}'
  s = s.replace('.', '{,}')