mytholog’s gists

mytholog / batcher goroutine

Created April 17, 2025 11:56 — forked from egorlepa/batcher goroutine


	func batcher[T any](in chan T, out chan []T, batchSize int, timeout time.Duration) {
	for {
	batch := make([]T, 0, batchSize)
	t := time.After(timeout)
	for batchReady := false; !batchReady; {
	select {
	case e := <-in:
	batch = append(batch, e)
	if len(batch) == batchSize {

mytholog / letitfail.go

Created April 5, 2019 11:37 — forked from campoy/letitfail.go

This example shows how to have a set of goroutines running concurrently and processing requests. Panics from goroutines are recovered and the worker is restarted. You can download it and run it directly using `go run letitfail.go`

	package main

	import (
	"bufio"
	"fmt"
	"os"
	"time"
	)

	const numWorkers = 3

mytholog / worker_pool.go

Created August 13, 2018 07:33

pool of go routines

	package main

	import (
	"fmt"
	"sync"
	"time"
	)

	/*
	In many languages, you need a "pool" mechanism to handle threads, because

mytholog / postgresql-set-id-seq.sql

Created April 26, 2018 15:06 — forked from henriquemenezes/postgresql-set-id-seq.sql

PostgreSQL set Next ID Sequence Value to MAX(id) from Table

	-- Get Max ID from table
	SELECT MAX(id) FROM table;

	-- Get Next ID from table
	SELECT nextval('table_id_seq');

	-- Set Next ID Value to MAX ID
	SELECT setval('table_id_seq', (SELECT MAX(id) FROM table)+1);

mytholog / stack_queue.go

Last active September 13, 2017 12:51 — forked from moraes/gist:2141121

LIFO Stack and FIFO Queue in golang

	package main

	import (
	"fmt"
	)

	type Node struct {
	Value int
	}

mytholog / revers.go

Last active September 13, 2017 13:00

	func reverse(s []int) {
	for i, j := 0, len(s)-1; i < j; i, j = i+1, j-1 {
	s[i], s[j] = s[j], s[i]
	}
	}

	func reverseString(s string) string {
	r := []rune(s)
	for i, j := 0, len(r)-1; i < len(r)/2; i, j = i+1, j-1 {
	r[i], r[j] = r[j], r[i]

mytholog / binarySearch.go

Created September 11, 2017 09:46

	func binarySearch(a []int, search int) (result int, searchCount int) {
	mid := len(a) / 2
	switch {
	case len(a) == 0:
	result = -1 // not found
	case a[mid] > search:
	result, searchCount = binarySearch(a[:mid], search)
	case a[mid] < search:
	result, searchCount = binarySearch(a[mid+1:], search)
	result += mid + 1

mytholog / bubbleSort.go

Last active September 11, 2017 09:50


	tmp := 0

	for i := 0; i < len(arr); i++ {
	for j := 0; j < len(arr) - 1; j++ {
	if arr[j] > arr[j + 1] {
	tmp = arr[j]
	arr[j] = arr[j + 1]
	arr[j + 1] = tmp
	}

mytholog / StreamToString.go

Created July 5, 2017 07:36 — forked from tejainece/StreamToString.go

Golang: io.Reader stream to string or byte slice

	import "bytes"

	func StreamToByte(stream io.Reader) []byte {
	buf := new(bytes.Buffer)
	buf.ReadFrom(stream)
	return buf.Bytes()
	}

	func StreamToString(stream io.Reader) string {
	buf := new(bytes.Buffer)

mytholog / closest.js

Created March 6, 2017 01:52

closest number out of array

	const counts = [4, 9, 15, 6, 2];
	const goal = 5;

	counts
	.reduce((prev, curr) => Math.abs(curr - goal) < Math.abs(prev - goal) ? curr : prev);

Igor Gavrilov mytholog