// Len returns the number of items in this queue.
515155
func (q *Queue) Len() int64 {
	q.lock.Lock()
	defer q.lock.Unlock()

	return int64(len(q.items))
}
508700
func (q *Queue) Len() int {
	q.lock.RLock()
	defer q.lock.RUnlock()

	l := len(q.jobs)

	return l
}
65837
func (db *Database) Len(sid string) (n int) {
	return len(db.keys(sid))
}
1294686
func (c *Cache) Len() int {
	l := 0
	for _, s := range c.shards {
		l += s.Len()
	}
	return l
}
1156627
func (b *Buffer) Len() int {
	b.Lock()
	defer b.Unlock()

	return b.length()
}
1237041
func (b *ByteBuffer) Len() int {
	b.Lock()
	defer b.Unlock()
	return b.b.Len()
}
170112
func (b *Buffer) Len() int {
	version := b.preOp()
	n := b.buf.Len()
	b.postOp(version)
	return n
}
1038408
func (c *Cache) Len() int {
	c.RLock()
	defer c.RUnlock()
	return len(c.cache)
}
538008
func (t *Tree) Len() int {
	if t.root != nil {
		return t.root.size
	}
	return 0
}
209027
func (m *ClientManager) Len() int {
	if m.cache == nil {
		return 0
	}
	m.mu.Lock()
	defer m.mu.Unlock()
	return m.ll.Len()
}
882428
func (lru *LRUCache) Len() int {
	lru.lock.RLock()
	defer lru.lock.RUnlock()
	return lru.order.Len()
}
1223170
func (hm *SyncedHashMap) Len() int {
	hm.RLock()
	defer hm.RUnlock()
	return len(hm.keys)
}
1067714
func (c *Cache) Len() int {
	c.Lock()
	defer c.Unlock()
	return c.l.Len()
}
329503
func (smap *syncedMap) Len() int {
	smap.RLock()
	defer smap.RUnlock()

	return len(smap.data)
}
525383
func (f *Folder) Len() int {
	l := len(f.Files)
	for _, f := range f.Folders {
		l += f.Len()
	}
	return l
}
1001325
func (lg Linear) Len() int {
	if lg.start < lg.end {
		return int((lg.end-lg.start)/lg.step) + 1
	}
	return int((lg.start-lg.end)/lg.step) + 1
}
1188443
func (l Line) Len() float64 {
	return l.A.To(l.B).Len()
}