// Add returns a graph containing all edges in g plus all edges in e.
// Any edges belonging to both g and e will retain their cost from g.
164923
func (g *Virtual) Add(e EdgeSet) *Virtual {
	return g.union(newEdges(g.Order(), e), true)
}
266922
func (e Expr) Add(weight float32, word string) {
	e[word] += weight
}
411768
func Add(a, b *T) T {
	return T{a[0] + b[0], a[1] + b[1], a[2] + b[2]}
}
1189768
func (v *Float) Add(delta float64) {
	v.mu.Lock()
	v.f += delta
	v.mu.Unlock()
}
393638
func (v *Gauge) Add(delta int64) {
	v.Counter.i.Add(delta)
}
235431
func (g *Noop) Add(ctx context.Context, args ...string) error {
	return nil
}
454270
func (h *Histogram) Add(value int64) {
	for i := range h.labels {
		if i == len(h.labels)-1 || value <= h.cutoffs[i] {
			h.buckets[i].Add(1)
			h.total.Add(value)
			break
		}
	}
	if h.hook != nil {
		h.hook(value)
	}
}
658787
func (vec *T) Add(v *T) *T {
	vec[0] += v[0]
	vec[1] += v[1]
	return vec
}
736659
func (g *Graph) Create(s string) *Graph {
	n := g.Node(s)
	if n == nil {
		return g.Add(s)
	}
	n.Clear()
	return n
}
21075
func (s *set) add(elt setElement) bool {
	_, ok := s.m[elt]
	s.m[elt] = struct{}{}
	return !ok
}
1013774
func (v Values) Add(key, value string) {
	v[key] = append(v[key], value)
}
1184393
func (s *set) Add(vs ...interface{}) {
	for _, v := range vs {
		s.values[v] = struct{}{}
	}
}
979042
func (ns *Namespace) Add(a, b interface{}) (interface{}, error) {
	return _math.DoArithmetic(a, b, '+')
}
629951
func (mg *GaugesWithMultiLabels) Add(names []string, value int64) {
	if len(names) != len(mg.labels) {
		panic("CountersWithMultiLabels: wrong number of values in Add")
	}

	mg.counters.Add(safeJoinLabels(names), value)
}
343464
func (d *Dictionary) Add(key, value interface{}) {
	d.keys = append(d.keys, key)
	d.values = append(d.values, value)
}
1231946
func (p *Point) Add(point *Point) *Point {
	p[0] += point[0]
	p[1] += point[1]

	return p
}
95378
func (m Map) Add(key, value string) {
	m[key] = append(m[key], value)
}