== , the list is not modified.
// The element and
must not be nil.
func (l *List) MoveBefore(e, p *Element) {
- l.mu.Lock()
- l.list.MoveBefore(e, p)
- l.mu.Unlock()
+ l.mu.Lock()
+ l.list.MoveBefore(e, p)
+ l.mu.Unlock()
}
// MoveAfter moves element to its new position after .
// If or is not an element of , or == , the list is not modified.
// The element and
must not be nil.
func (l *List) MoveAfter(e, p *Element) {
- l.mu.Lock()
- l.list.MoveAfter(e, p)
- l.mu.Unlock()
+ l.mu.Lock()
+ l.list.MoveAfter(e, p)
+ l.mu.Unlock()
}
// MoveToFront moves element to the front of list .
// If is not an element of , the list is not modified.
// The element must not be nil.
func (l *List) MoveToFront(e *Element) {
- l.mu.Lock()
- l.list.MoveToFront(e)
- l.mu.Unlock()
+ l.mu.Lock()
+ l.list.MoveToFront(e)
+ l.mu.Unlock()
}
// MoveToBack moves element to the back of list .
// If is not an element of , the list is not modified.
// The element must not be nil.
func (l *List) MoveToBack(e *Element) {
- l.mu.Lock()
- l.list.MoveToBack(e)
- l.mu.Unlock()
+ l.mu.Lock()
+ l.list.MoveToBack(e)
+ l.mu.Unlock()
}
// PushBackList inserts a copy of an other list at the back of list .
// The lists and may be the same, but they must not be nil.
func (l *List) PushBackList(other *List) {
- if l != other {
- other.mu.RLock()
- defer other.mu.RUnlock()
- }
- l.mu.Lock()
- l.list.PushBackList(other.list)
- l.mu.Unlock()
+ if l != other {
+ other.mu.RLock()
+ defer other.mu.RUnlock()
+ }
+ l.mu.Lock()
+ l.list.PushBackList(other.list)
+ l.mu.Unlock()
}
// PushFrontList inserts a copy of an other list at the front of list .
// The lists and may be the same, but they must not be nil.
func (l *List) PushFrontList(other *List) {
- if l != other {
- other.mu.RLock()
- defer other.mu.RUnlock()
- }
- l.mu.Lock()
- l.list.PushFrontList(other.list)
- l.mu.Unlock()
+ if l != other {
+ other.mu.RLock()
+ defer other.mu.RUnlock()
+ }
+ l.mu.Lock()
+ l.list.PushFrontList(other.list)
+ l.mu.Unlock()
}
// InsertAfter inserts a new element with value immediately after and returns .
// If is not an element of , the list is not modified.
// The must not be nil.
func (l *List) InsertAfter(v interface{}, p *Element) (e *Element) {
- l.mu.Lock()
- e = l.list.InsertAfter(v, p)
- l.mu.Unlock()
- return
+ l.mu.Lock()
+ e = l.list.InsertAfter(v, p)
+ l.mu.Unlock()
+ return
}
// InsertBefore inserts a new element with value immediately before and returns .
// If is not an element of , the list is not modified.
// The must not be nil.
func (l *List) InsertBefore(v interface{}, p *Element) (e *Element) {
- l.mu.Lock()
- e = l.list.InsertBefore(v, p)
- l.mu.Unlock()
- return
+ l.mu.Lock()
+ e = l.list.InsertBefore(v, p)
+ l.mu.Unlock()
+ return
}
// Remove removes from if is an element of list .
// It returns the element value e.Value.
// The element must not be nil.
func (l *List) Remove(e *Element) (value interface{}) {
- l.mu.Lock()
- value = l.list.Remove(e)
- l.mu.Unlock()
- return
+ l.mu.Lock()
+ value = l.list.Remove(e)
+ l.mu.Unlock()
+ return
}
// Removes removes multiple elements from if are elements of list .
func (l *List) Removes(es []*Element) {
- l.mu.Lock()
- for _, e := range es {
- l.list.Remove(e)
- }
- l.mu.Unlock()
- return
+ l.mu.Lock()
+ for _, e := range es {
+ l.list.Remove(e)
+ }
+ l.mu.Unlock()
+ return
}
// RemoveAll removes all elements from list .
func (l *List) RemoveAll() {
- l.mu.Lock()
- l.list = list.New()
- l.mu.Unlock()
+ l.mu.Lock()
+ l.list = list.New()
+ l.mu.Unlock()
}
// See RemoveAll().
@@ -324,30 +324,30 @@ func (l *List) Clear() {
// RLockFunc locks reading with given callback function within RWMutex.RLock.
func (l *List) RLockFunc(f func(list *list.List)) {
- l.mu.RLock()
- defer l.mu.RUnlock()
- f(l.list)
+ l.mu.RLock()
+ defer l.mu.RUnlock()
+ f(l.list)
}
// LockFunc locks writing with given callback function within RWMutex.Lock.
func (l *List) LockFunc(f func(list *list.List)) {
- l.mu.Lock()
- defer l.mu.Unlock()
- f(l.list)
+ l.mu.Lock()
+ defer l.mu.Unlock()
+ f(l.list)
}
// Iterator is alias of IteratorAsc.
-func (l *List) Iterator(f func (e *Element) bool) {
+func (l *List) Iterator(f func(e *Element) bool) {
l.IteratorAsc(f)
}
// IteratorAsc iterates the list in ascending order with given callback function .
// If returns true, then it continues iterating; or false to stop.
-func (l *List) IteratorAsc(f func (e *Element) bool) {
+func (l *List) IteratorAsc(f func(e *Element) bool) {
l.mu.RLock()
length := l.list.Len()
if length > 0 {
- for i, e := 0, l.list.Front(); i < length; i, e = i + 1, e.Next() {
+ for i, e := 0, l.list.Front(); i < length; i, e = i+1, e.Next() {
if !f(e) {
break
}
@@ -358,15 +358,15 @@ func (l *List) IteratorAsc(f func (e *Element) bool) {
// IteratorDesc iterates the list in descending order with given callback function .
// If
-[](https://godoc.org/github.com/gogf/gf/g#pkg-subdirectories)
-[](https://travis-ci.org/gogf/gf)
+[](https://godoc.org/github.com/gogf/gf/g#pkg-subdirectories)
+[](https://travis-ci.org/gogf/gf)
+[](https://goreportcard.com/report/github.com/gogf/gf)
[](https://codecov.io/gh/gogf/gf/branch/master)
[](https://github.com/gogf/gf)
[](https://github.com/gogf/gf)
