// Size returns the number of elements in the bimap
502391
func (b *BiMap) Size() int {
	b.s.RLock()
	defer b.s.RUnlock()
	return len(b.forward)
}
675991
func (r Rect) Size() Point {
	return Point{r.X.Length(), r.Y.Length()}
}
467119
func (u *utxoStore) Size() (sz int) {
	u.Lock()
	defer u.Unlock()
	for _, m := range u.c {
		sz += len(m)
	}
	return
}
413948
func (tx *Tx) Size() int64 {
	return int64(tx.meta.pgid) * int64(tx.db.pageSize)
}
1237200
func (s VertexSet) size() (size int) {
	switch {
	case s.set == nil:
		return -1
	case len(s.set) == 0:
		return 0
	}
	in := s.set[len(s.set)-1]
	return in.index + in.b - in.a
}
945330
func (s *storeImpl) Size() int {
	s.mutex.RLock()
	defer s.mutex.RUnlock()
	return len(s.objects)
}
949444
func (d *indirectIndex) Size() uint32 {
	d.mu.RLock()
	defer d.mu.RUnlock()

	return d.b.len()
}
558211
func (f *File) Size() int64 {
	size := int64(f.ino.Size)
	if f.ino.Mode&ifmt == ifreg {
		size |= int64(f.ino.Diracl) << 32
	}
	return size
}
1240352
func (q *LinkedBlockingDeque) Size() int {
	q.lock.Lock()
	defer q.lock.Unlock()
	return q.size()
}
1207756
func (r *SearchRequest) Size(size int) *SearchRequest {
	r.searchSource = r.searchSource.Size(size)
	return r
}
501111
func (s *ExpDecaySample) Size() int {
	s.mutex.Lock()
	defer s.mutex.Unlock()
	return s.values.Size()
}
324363
func (m *MembershipStore) Size() int {
	m.RLock()
	defer m.RUnlock()
	return len(m.m)
}
741902
func (b *bitmap) size() uintptr {
	return uintptr(len(b.blocks)) * bmBlockWords * uintptrBytes
}
1374962
func (m *SyncMap) Size() int {
	size := 0
	for _, shard := range m.shards {
		shard.RLock()
		size += len(shard.items)
		shard.RUnlock()
	}
	return size
}
1020338
func (s *Set) Size() int {
	// Lock set for read
	s.mutex.RLock()
	defer s.mutex.RUnlock()

	return len(s.m)
}
1364762
func (ps *PeerSet) Size() int {
	ps.mtx.Lock()
	defer ps.mtx.Unlock()
	return len(ps.list)
}
989558
func (it *Int64) Size() (int64, bool) {
	sz := (it.max - it.min) + 1
	return sz, true
}