This is the first file in the gist.
Steve Hanov smhanov
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <!DOCTYPE html> | |
| <html> | |
| <body> | |
| <h1>Hello world!</h1> | |
| <script src="test.js"></script> | |
| </body> | |
| </html> |
smhanov
/ OpenType.ts
Last active
March 30, 2025 18:19
Here is my implementation of a TrueType font reader in Typescript. You can read a font directly from an ArrayBuffer, and then call drawText() to draw it. See my article http://stevehanov.ca/blog/index.php?id=143. The second file, OpenType.ts is the same thing but it handles more TrueType files. It is also more coplex
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // To see this run, you first stub out these imports. Then put the file in a Uint8Array. | |
| // let slice = new Slice(array); | |
| // let font = new OTFFont(slice); | |
| // Then you can call methods like font.drawText(canvasContext, ) | |
| // | |
| // | |
| import { ICanvasContext } from "./ICanvasContext" | |
| import { log as Log } from "./log" | |
| const log = Log.create("OPENTYPE"); |
smhanov
/ description.md
Last active
October 18, 2024 19:32
Pipeline multiprocessing for python with generators
Similar to mpipe, this short module lets you string together tasks so that they are executed in parallel.
The difference is that it lets you use generators, functions which yield results instead of returning them. Each yielded item gets passed to the next stage.
You can specify that one or more copies of the workers operate on the input queue.
smhanov
/ copyinsert.py
Last active
April 13, 2025 09:41
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #!/usr/bin/env python3 | |
| import time | |
| import sys | |
| # Python by Steve Hanov | |
| # Suffix array construction from: | |
| # From Ge Nong, Sen Zhang and Wai Hong Chan, Two Efficient Algorithms for Linear Suffix Array Construction, 2008 | |
| # longestMatches from: http://stevehanov.ca/blog/index.php?id=146 | |
| # Released to the public domain. | |
| class SuffixArray: |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // By Steve Hanov (2014) | |
| // Released to public domain | |
| // | |
| // Minimum element is always on top. | |
| // You can pass in an optional lessThan(a, b) function to the constructor. | |
| // You may use .length to retrieve the length. Try not to set it though. | |
| function Heap() | |
| { | |
| if (arguments.length) { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #!/usr/bin/python3 | |
| # By Steve Hanov, 2011. Released to the public domain. | |
| # Please see http://stevehanov.ca/blog/index.php?id=115 for the accompanying article. | |
| # | |
| # Based on Daciuk, Jan, et al. "Incremental construction of minimal acyclic finite-state automata." | |
| # Computational linguistics 26.1 (2000): 3-16. | |
| # | |
| # Updated 2014 to use DAWG as a mapping; see | |
| # Kowaltowski, T.; CL. Lucchesi (1993), "Applications of finite automata representing large vocabularies", | |
| # Software-Practice and Experience 1993 |