2021-03-02

Pushing to Github after a shallow clone is horribly slow

Git's shallow clones can inadvertently disable important optimizations during push operations, particularly affecting the first push in a repository. Using '--depth 2' when cloning maintains one un-mangled commit between the shallow graft point and branch tip, enabling faster initial pushes by preserving Git's optimization capabilities.

Original archive.is archive.ph web.archive.org

Log in to get one-click access to archived versions of this article.

read comments on news aggregators:

Related articles

Zen 5's AVX-512 Frequency Behavior

AMD's Zen 5 processor introduces full-width AVX-512 datapaths with impressive performance at high clock speeds, demonstrating significant improvements over Intel's Skylake-X implementation. The architecture employs sophisticated IPC throttling and clock management techniques to handle heavy AVX-512 workloads, maintaining optimal performance while avoiding fixed frequency offsets.

3,200% CPU Utilization

An in-depth analysis of a critical Java performance issue where unprotected concurrent TreeMap modifications led to 3,200% CPU utilization. The investigation revealed how thread interleaving can create infinite loops in red-black trees, with experiments across multiple programming languages demonstrating similar vulnerabilities.

Why are Jujutsu's ID Prefixes So Short? | Jonathan's Blog

Jujutsu version control system maintains short ID prefixes (1-2 characters) for changes through a specialized ID prefix index that focuses only on active changes. The system uses revsets to define active changes and creates efficient indexes for quick lookups, making it easier to reference thousands of commits with minimal characters.

Why We Designed TigerBeetle's Docs from Scratch | TigerBeetle Blog

TigerBeetle rebuilt their documentation site from scratch, moving away from Docusaurus to achieve better performance, simplicity, and integration with their zero-dependency philosophy. The new implementation uses Zig and Pandoc, resulting in a 10x reduction in footprint while maintaining functionality and adding features like integrated search and offline capabilities.

Xcode constantly phones home

The article discusses performance issues with Xcode builds caused by unnecessary connections to Apple's servers during the 'Gather provisioning inputs' phase. The author discovers that blocking certain Apple domains through Little Snitch significantly improves build times while exploring Xcode's seemingly unnecessary tracking and analytics connections.

How Core Git Developers Configure Git

An in-depth exploration of Git configuration settings reveals numerous options that could enhance Git's default behavior, backed by core Git developers' preferences. The article categorizes settings into three groups: those that clearly improve Git, harmless but helpful options, and taste-dependent configurations. Several recommended settings focus on improving diff visualization, branch management, and push/pull behaviors.

The Best Way to Use Text Embeddings Portably is With Parquet and Polars

A deep dive into efficient storage and retrieval of text embeddings using Parquet files and polars library, demonstrated through Magic: The Gathering card analysis. The article explores alternatives to vector databases for smaller datasets, highlighting how combining Parquet files with polars offers zero-copy operations and fast similarity searches.

What's New in Emacs 30.1?

Emacs 30.1 introduces significant improvements including a new completion preview mode, tree-sitter sexp command enhancements, and better touch screen support. The release also features native JSON improvements, buffer-local file watching, and automated org protocol registration.

Sublinear Time Algorithms

Sublinear time algorithms represent a paradigm shift in computational efficiency, allowing processing of extremely large datasets by reading only a fraction of the input. While exact deterministic sublinear algorithms exist for some problems, most solutions require randomization and approximation techniques, with applications spanning optimization, property testing, and distribution analysis.