Yuri yurivish

## shift_dfa.md

      
              1 file
            
          
              4 forks
            
          
              6 comments
            
          
              93 stars
            
          
                pervognsen
                / shift_dfa.md
            
            
              Last active
              January 27, 2024 19:54
            
              
                Shift-based DFAs
              
          
    A traditional table-based DFA implementation looks like this:
uint8_t table[NUM_STATES][256]

uint8_t run(const uint8_t *start, const uint8_t *end, uint8_t state) {
    for (const uint8_t *s = start; s != end; s++)
        state = table[state][*s];
    return state;
}


## oscillo.pl
use warnings;
use Getopt::Std;

getopt('xytGgwsf',\%opts);

# pcm file = $opts{f}

# samples per pixel x
$xscale = $opts{x} // 1200;

## cool-game-programming-blogs.opml
<?xml version="1.0" encoding="UTF-8"?>
<opml version="1.0">
    <head>
        <title>Graphics, Games, Programming, and Physics Blogs</title>
    </head>
    <body>
        <outline text="Tech News" title="Tech News">
            <outline type="rss" text="Ars Technica" title="Ars Technica" xmlUrl="http://feeds.arstechnica.com/arstechnica/index/" htmlUrl="https://arstechnica.com"/>
            <outline type="rss" text="Polygon - Full" title="Polygon - Full" xmlUrl="http://www.polygon.com/rss/index.xml" htmlUrl="https://www.polygon.com/"/>
            <outline type="rss" text="Road to VR" title="Road to VR" xmlUrl="http://www.roadtovr.com/feed" htmlUrl="https://www.roadtovr.com"/>

## doc_embeddings_with_vectorizers.ipynb

      
              1 file
            
          
              1 fork
            
          
              4 comments
            
          
              14 stars
            
          
                lmcinnes
                / doc_embeddings_with_vectorizers.ipynb
            
            
              Last active
              November 9, 2023 04:31
            
              
                Document Embeddings with the Vectorizers Library
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## uri.js
var parser = document.createElement('a');
parser.href = "http://example.com:3000/pathname/?search=test#hash";

parser.protocol; // => "http:"
parser.hostname; // => "example.com"
parser.port;     // => "3000"
parser.pathname; // => "/pathname/"
parser.search;   // => "?search=test"
parser.hash;     // => "#hash"
parser.host;     // => "example.com:3000"

## gfx_res.md

      
              1 file
            
          
              5 forks
            
          
              2 comments
            
          
              70 stars
            
          
                abstractalgo
                / gfx_res.md
            
            
              Last active
              October 26, 2023 00:03
            
          
    Gamma, gamut, tone mapping, color, sRGB

sRGB learning curve 

https://gamedevdaily.io/the-srgb-learning-curve-773b7f68cf7a#.y9sitvhmm
Color Math

http://www.essentialmath.com/GDC2015/VanVerth_Jim_DoingMathwRGB.pdf
The Importance of Terminology and sRGB Uncertainty

http://colour-science.org/posts/the-importance-of-terminology-and-srgb-uncertainty/

  
## things.sh
Moved to https://github.com/alexanderwillner/things.sh/

## heap.zig
const std = @import("std");
const assert = std.debug.assert;

/// An intrusive heap implementation backed by a pairing heap[1] implementation.
///
/// Why? Intrusive data structures require the element type to hold the metadata
/// required for the structure, rather than an additional container structure.
/// There are numerous pros/cons that are documented well by Boost[2]. For Zig,
/// I think the primary benefits are making data structures allocation free
/// (rather, shifting allocation up to the consumer which can choose how they

## pyfft.ipynb

      
              1 file
            
          
              0 forks
            
          
              1 comment
            
          
              4 stars
            
          
                pervognsen
                / pyfft.ipynb
            
            
              Last active
              April 19, 2023 22:51
            
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## multidimrangesearch.py
#!/usr/bin/env/python
#
# Little script to play around with the code and
# data of H. Tropf, H. Herzog's paper 1981 paper
#    "Multidimensional Range Search in Dynamically
#    Balanced Trees".
#
# Thanks to Bernhard Herzog (unrelated to H. Herzog)
# for having a second look at the code.
#
	use warnings;
	use Getopt::Std;

	getopt('xytGgwsf',\%opts);

	# pcm file = $opts{f}

	# samples per pixel x
	$xscale = $opts{x} // 1200;
	<?xml version="1.0" encoding="UTF-8"?>
	<opml version="1.0">
	<head>
	<title>Graphics, Games, Programming, and Physics Blogs</title>
	</head>
	<body>
	<outline text="Tech News" title="Tech News">
	<outline type="rss" text="Ars Technica" title="Ars Technica" xmlUrl="http://feeds.arstechnica.com/arstechnica/index/" htmlUrl="https://arstechnica.com"/>
	<outline type="rss" text="Polygon - Full" title="Polygon - Full" xmlUrl="http://www.polygon.com/rss/index.xml" htmlUrl="https://www.polygon.com/"/>
	<outline type="rss" text="Road to VR" title="Road to VR" xmlUrl="http://www.roadtovr.com/feed" htmlUrl="https://www.roadtovr.com"/>
	var parser = document.createElement('a');
	parser.href = "http://example.com:3000/pathname/?search=test#hash";

	parser.protocol; // => "http:"
	parser.hostname; // => "example.com"
	parser.port; // => "3000"
	parser.pathname; // => "/pathname/"
	parser.search; // => "?search=test"
	parser.hash; // => "#hash"
	parser.host; // => "example.com:3000"
	const std = @import("std");
	const assert = std.debug.assert;

	/// An intrusive heap implementation backed by a pairing heap[1] implementation.
	///
	/// Why? Intrusive data structures require the element type to hold the metadata
	/// required for the structure, rather than an additional container structure.
	/// There are numerous pros/cons that are documented well by Boost[2]. For Zig,
	/// I think the primary benefits are making data structures allocation free
	/// (rather, shifting allocation up to the consumer which can choose how they
	#!/usr/bin/env/python
	#
	# Little script to play around with the code and
	# data of H. Tropf, H. Herzog's paper 1981 paper
	# "Multidimensional Range Search in Dynamically
	# Balanced Trees".
	#
	# Thanks to Bernhard Herzog (unrelated to H. Herzog)
	# for having a second look at the code.
	#