lovasoa

// See https://www.reddit.com/r/rust/comments/yaqsqe/how_to_delay_lots_of_synchronous_actions/?sort=new

use pnet::datalink::{self};
use pnet::datalink::Channel::Ethernet;
use pnet::datalink::DataLinkSender;
use pnet::packet::ethernet::MutableEthernetPacket;
use std::sync::mpsc;
use std::time::Instant;

fn main() {

lovasoa

package main

import (
	"bufio"
	"compress/gzip"
	"fmt"
	"io"
	"log"
	"os"
)

lovasoa

<?php
function lambert2gps($x, $y, $lambert) {
      $lamberts = array(
       "LambertI" => 0,
       "LambertII" => 1,
       "LambertIII" => 2,
       "LamberIV" => 3,
       "LambertIIExtend" => 4,
       "Lambert93" => 5
      );

lovasoa

function levenshtein(w1, w2, costs) {
	var line_i = [];
	if (costs === undefined) costs = [1,1,1]; //Cost of addition, deletion, replacement
	for(var k=0; k<=w1.length; k++) line_i.push(k);
	for (var i=1; i<=w2.length; i++) {
		var prev_line = line_i;
		var line_i = [i];
		for (var k=1; k<=w1.length; k++) {
			cost = (w1[k-1] == w2[i-1]) ? 0 : costs[2];
			line_i[k] = Math.min(line_i[k-1]+costs[0], prev_line[k]+costs[1], prev_line[k-1]+cost);

lovasoa

import sys
from numpy import *
from collections import Counter

n = int(sys.argv[1])
def mat_fun(i,j): return (j == (i+1)%9) | ((i==6) & (j==0))
M = matrix(fromfunction(mat_fun, (9, 9)), dtype=int)**n
ages=Counter(map(int,input().split(',')))
sizes=array([ages[i] for i in range(9)])
print(M.dot(sizes).sum())

lovasoa

from asyncua import ua
from asyncua.ua import ua_binary
import sys
import timeit

obj = ua.WriteParameters(NodesToWrite=[
    ua.WriteValue(
        NodeId_=ua.NodeId("hello_world"),
        Value=ua.DataValue(
            Value=

lovasoa

#Ophir.php

Important note

This code is not up to date. It is now hosted at https://github.com/lovasoa/ophir.php

PHP script that converts ODT to HTML

ophir.php is a lightweight script that parses an open document file and outputs a simple HTML file, with very few tags (contrarily to most other tools that do the same).

Features

Currently, the script parses bold (b tag), italic (i tag), underline (u tag), quotations (blockquote tag), images (using data URIs), links, headings (h1, h2, ...), lists (ul and li), tables (table tr and td) annotations and footnotes.

lovasoa

function byteLength(str) {
  // returns the byte length of an utf8 string
  var s = str.length;
  for (var i=str.length-1; i>=0; i--) {
    var code = str.charCodeAt(i);
    if (code > 0x7f && code <= 0x7ff) s++;
    else if (code > 0x7ff && code <= 0xffff) s+=2;
    if (code >= 0xDC00 && code <= 0xDFFF) i--; //trail surrogate
  }
  return s;

lovasoa

CREATE TABLE stop_route_link (stop_id,route_id);

INSERT INTO stop_route_link (stop_id, route_id)
	SELECT DISTINCT stops.stop_id, trips.route_id from stops
	INNER join stop_times on stop_times.stop_id=stops.stop_id
	INNER join trips on trips.trip_id=stop_times.trip_id;

lovasoa

find_pair_with_sum

Given a sorted array of integers and a number n, find a pair of numbers in the array whose sum is n.

Solution

Algorithm

Start with a pair constituted of the first and last numbers of the sorted array. At each step, compute the sum of the current pair. If the sum is larger than our objective, take following element as the first of our pair.