Bazel^1 static const u4 kDefaultTimestamp = 30 << 25 | 1 << 21 | 1 << 16; // January 1, 2010 in DOS time NPM^2 + // Provide a specific date in the 1980s for the benefit of zip, + // which is confounded by files dated at the Unix epoch 0. + mtime: new Date('1985-10-26T08:15:00.000Z'), Debian Packaging 2015-10-21 00:00Z'
1/8/2023WIP Dependency hell Scenarios The following are some of the most common “dependency hell” scenarios: Inappropriate Versioning - A package may specify an inappropriate version for a release. For example, a version is tagged 1.2.3, but introduces extensive, breaking API changes that should be reflected by a major version bump to 2.0.0. Incompatible Major Version Requirements - A package may have dependencies with incompatible version requirements for the same package. For example, if Foo depends on Baz at version ~>1.0 and Bar depends on Baz at version ~>2.0, then there is no one version of Baz that can satisfy both requirements. This situation often arises when a dependency shared by many packages updates to a new major version, and it takes a long time for all of those packages to update their dependency. Incompatible Minor or Update Version Requirements - A package may have dependencies that are specified too strictly, such that version requirements are incompatible for different minor or update versions. For example, if Foo depends on Baz at version ==2.0.1 and Bar depends on Baz at version ==2.0.2, once again, there is no one version of Baz that can satisfy both requirements. This is often the result of a regression introduced in a patch release of a dependency, which causes a package to lock that dependency to a particular version.
1/5/2023Diff Semantic AST Patdiff Graphtage How Graphtage Works In general, optimally mapping one graph to another cannot be executed in polynomial time[^1], and is therefore not tractable for graphs of any useful size[^2]. This is true even for restricted classes of graphs like DAGs[^3]. However, trees and forests are a special case that can be mapped in polynomial time, with reasonable constraints on the types of edits possible. Graphtage exploits this. Why Mapping Trees is Complex Ordered nodes in the tree (e.g., JSON lists) and, in particular,
1/5/2023Python Performance Fix conda create -n np_veclib python=3.9 conda activate np_veclib conda install cython pybind11 conda install numpy "libblas=*=*accelerate" pip install --no-binary :all: --no-use-pep517 numpy Keyboard Quotes Change the style of quotes for both single and double quotes
1/1/2023