# growingwiththeweb.com

> AI-optimized mirror of growingwiththeweb.com containing 25 pages totalling 21,744 words of clean markdown content, structured data, and semantic HTML. Original source: https://growingwiththeweb.com/. Last updated: 2026-06-16T04:16:22.579Z.

Each page is available as HTML (with JSON-LD structured data) and Markdown (text-only, ideal for LLMs and RAG).

## Homepage

- [About Me](/content/site-root.html): A blog on software and web development by Daniel Imms (390 words)

## Articles & Blog Posts

- [2016/12/radix-sort-lsd-html.html](/content/2016/12/radix-sort-lsd-html.html) (1 words)
- [2020/03/migrating-xtermjs-from-tslint-to-eslint-html.html](/content/2020/03/migrating-xtermjs-from-tslint-to-eslint-html.html) (1 words)
- [data-structures/binary-heap/overview/index.html](/content/data-structures/binary-heap/overview/index.html) (1 words)
- [data-structures/binary-search-tree/overview/index.html](/content/data-structures/binary-search-tree/overview/index.html) (1 words)
- [data-structures/avl-tree/overview/index.html](/content/data-structures/avl-tree/overview/index.html) (1 words)
- [data-structures/binomial-heap/overview/index.html](/content/data-structures/binomial-heap/overview/index.html) (1 words)
- [Fibonacci Heap Overview](/content/data-structures/fibonacci-heap/overview/index.html): A Fibonacci heap is a heap data structure similar to the binomial heap, only with a few modifications and a looser structure. The Fibonacci heap was designed in order to improve Dijkstra’s shortest path algorithm from O(m \log n) to O(m + n \log n) by optimising the operations used most by the algorithm. Its name derives from the fact that the Fibonacci sequence is used in the complexity analysis of its operations.
 (6,297 words)
- [Visual Studio Code Terminal Features](/content/2017/03/mastering-vscodes-terminal-html.html): Visual Studio Code’s integrated terminal can be launched with ctrl+`. This article goes into some of the lesser known things you can do with the terminal.
 (1,274 words)
- [Red-Black Tree](/content/data-structures/red-black-tree/overview/index.html): The red-black tree is a type of self-balancing binary search tree that assigns a colour of red or black to each node. On every insert or delete, the tree re-organises itself so that it is approximately \log n nodes high, allowing search in O(\log n) time. The re-organising does not guarantee a perfectly balanced tree, it is however good enough to guarantee O(\log n) search.
 (3,783 words)
- [Five years have passed since I posted my [first article](/content/2012/04/sass-syntactically-awesome-stylesheets.html) on the blog. Time for a retrospective!](/content/2017/04/five-years-html.html): Five years have passed since I posted my first article on the blog. Time for a retrospective!
 (682 words)
- [2017/10/vscode-terminal-renderer-html.html](/content/2017/10/vscode-terminal-renderer-html.html) (1 words)
- [Analysis](/content/2017/05/max-aware-stack-html.html): This article looks at the interview question - Implement a stack that can return its maximum value in constant time.
 (954 words)
- [Complexity](/content/data-structures/splay-tree/overview/index.html): The splay tree is a type of self-adjusting binary search tree like the red-black tree. What makes the splay tree special is its ability to access recently accessed elements faster. Whenever an operation is performed, the tree performs an operation called splaying which pulls the element to the top of the tree.
 (4,718 words)
- [Problem [#](/content/2018/01/intersection-observer.html#problem/index.html)](/content/2018/01/intersection-observer-html.html): xterm.js ran into a great problem to use the Intersection Observer web API. This post introduces the problem, what Intersection Observer is and why it’s such a good fit.
 (537 words)
- [I hit [a bug in VS Code](https://github.com/Microsoft/vscode/issues/27915) recently related to running a 32-bit process on a 64-bit machine that was interesting. Here’s what I learned.](/content/2017/08/windows-wow64-html.html): I hit a bug in VS Code recently related to running a 32-bit process on a 64-bit machine that was interesting. Here’s what I learned.
 (268 words)
- [Binary Heap Build Heap Operation](/content/data-structures/binary-heap/build-heap-proof/index.html): The binary heap data structure supports a build heap operation that runs in O(n). Intuitively it might seem that it should run in O(n \log n) time since it performs an O(\log n) operation n/2 times. This article provides a proof of the linear run time.
 (360 words)
- [Inlining Constants with Const Enums in TypeScript](/content/2021/01/typescript-inline-const-enums-html.html): An often overlooked part of writing high performance JavaScript apps is to consider how your code will be compiled and minified.
 (447 words)
- [Go to the home directory](/content/2019/07/how-shells-work-cd-html.html): I’m currently going through the POSIX specification and wanted to document some of the lesser known things you can do.
 (323 words)
- [Slow NVM Initialization](/content/2018/01/slow-nvm-init-html.html): I started using nvm a while ago but ever since then my terminal has been very slow to start up.
 (424 words)
- [Readonly Typed Arrays in TypeScript](/content/2020/10/typescript-readonly-typed-arrays-html.html): A proposal to add support for built-in readonly typed arrays got rejected by the TypeScript team. This post shows how to build your own.
 (322 words)
- [Setting up the Task](/content/2019/11/cosmos-db-emulator-pipelines-html.html): When working on an application that interfaces with an Azure Cosmos DB backend you could use an actual Cosmos DB instance to test against but that’s a bit of a hassle as it involves setting up and configuring an actual instance. It turns out there is an emulator that runs in a docker container that you can test against instead.
 (321 words)
- [JavaScript FPS Counter](/content/2017/12/fast-simple-js-fps-counter-html.html): A side project called for a JavaScript FPS counter, here’s how I did it.
 (359 words)
- [sitemap-xml.html](/content/sitemap-xml.html) (1 words)
- [Replacing Google Analytics -  Growing with the Web](/content/2020/07/replacing-google-analytics-html.html): I’ve been on Google Analytics pretty much since moving the site off of Blogger. Technically if you use GA now you require a cookie consent dialog which got me thinking why I actually use GA.
 (277 words)

## Resources

- [Full Page Index](/index.html): Browse all cached pages with rich metadata
- [About This Cache](/content/about.html): Methodology, technical details, and usage guidelines
- [XML Sitemap](/sitemap.xml): Machine-readable sitemap for crawler discovery
- [Robots.txt](/robots.txt): Crawler directives