aboutsummaryrefslogtreecommitdiffstats
path: root/vendor/github.com/fjl/memsize/doc.go
diff options
context:
space:
mode:
Diffstat (limited to 'vendor/github.com/fjl/memsize/doc.go')
-rw-r--r--vendor/github.com/fjl/memsize/doc.go16
1 files changed, 16 insertions, 0 deletions
diff --git a/vendor/github.com/fjl/memsize/doc.go b/vendor/github.com/fjl/memsize/doc.go
new file mode 100644
index 000000000..640cfba5e
--- /dev/null
+++ b/vendor/github.com/fjl/memsize/doc.go
@@ -0,0 +1,16 @@
+/*
+Package memsize computes the size of your object graph.
+
+So you made a spiffy algorithm and it works really well, but geez it's using
+way too much memory. Where did it all go? memsize to the rescue!
+
+To get started, find a value that references all your objects and scan it.
+This traverses the graph, counting sizes per type.
+
+ sizes := memsize.Scan(myValue)
+ fmt.Println(sizes.Total)
+
+memsize can handle cycles just fine and tracks both private and public struct fields.
+Unfortunately function closures cannot be inspected in any way.
+*/
+package memsize