mafintosh / mafintosh/append-tree

Put a cache on split()

Open
#15 0 comments 0 reactions 0 assignees View on GitHub
Dominant language
JavaScript
Stars
55
Forks
13
PR merge metrics
No merged PRs in 30d

Description

I found the split function was taking up a fair share of CPU in some workloads. I got an order of magnitude speed growth by adding a cache. Might be able to do something as simple as an object map of names to arrays that gets cleared every 15 seconds

Contributor guide

No contributing guide indexed for this repository

Research direction

The issue names split() but no file or test; first locate that function and inspect how it is used in the tree structure. Measure the current workload and decide how a name-to-array cache with periodic clearing should behave, then verify that repeated splits reduce CPU without returning stale results.

Written by the indexing model from the issue text.

Assessment

Tech stack
javascript
Domain
backend
Issue type
Feature
Difficulty
3/5
Estimated time
1-2 days
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
45/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.