Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
zepolen
on May 24, 2019
|
parent
|
context
|
favorite
| on:
Grafana v6.2
It's not about aesthetics it's about identification of problems in O(log n) instead of O(n) time.
Scrolling through 100 graphs is slower than scanning 10 main graphs and 10 subgraphs per.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
Scrolling through 100 graphs is slower than scanning 10 main graphs and 10 subgraphs per.