Daniel Holth

Results 349 comments of Daniel Holth

IIUC, for my use case I could - use `simplecache::` or `filecache::` - enhance those so that the cache only keeps a file or two if I'm worried about disk...

My results this morning, now that I think the algorithm is working correctly but haven't fired off http requests before waiting for the last batch of futures to complete. ```...

We might want to change `ShardLike` and `Shards` so that the caller has to access `repodata.json/repodata_shards ["info"]` through a setter, instead of expecting to change elements of info directly and...

conda-search probably should run the "verify signatures" code on the results. Previously it would have been verified against all packages (slow) and "happen to" be shown in the search results.

```mermaid sequenceDiagram loop Main ->> Main: "Fetch" in-memory shard Main ->> Cache: Fetch shard Cache ->> Network: Cache miss Cache ->> Main: Cache hit Network ->> Main: Network result Main...

@travishathaway This code mainly has bugs tracking visited versus unvisited nodes a-la the classic traversal algorithm; there should be a simple solution, it may mark things as done while they...

This chart compares the "bfs" and "pipelined" strategies as run on my machine with cold, warm, and lukewarm cache. The sum of all the "bfs" durations is about 1.42x the...

> @dholth Could you take a look at the rebase please? I see you mean resolve merge conflicts with `main`, not "look for another PR with rebased commits". Done.

We already convert repodata into a dict mapping package names to records similar to sharded metadata, before parsing them into complete PackageRecord objects. We could behave as if all metadata...

The C/C++ code has its own repository interfaces, loaders that do not interact with Python.