go/lazygit
1
0
Fork 0
mirror of https://github.com/jesseduffield/lazygit.git synced 2025-07-17 01:42:45 +02:00
Code Issues Releases Activity

Cleanup: rename predicate params (test -> predicate)

Browse Source
This commit is contained in:
Brandon
2025-04-04 23:06:06 -07:00
committed by Stefan Haller
parent c488e22abc
commit 106b7018dd
1 changed files with 17 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

34
pkg/gui/filetree/node.go
View File

@ -109,13 +109,13 @@ func (self *Node[T]) SortChildren() {
self.Children = children self.Children = children
} }
func (self *Node[T]) Some(test func(*Node[T]) bool) bool { func (self *Node[T]) Some(predicate func(*Node[T]) bool) bool {
if test(self) { if predicate(self) {
return true return true
} }
for _, child := range self.Children { for _, child := range self.Children {
if child.Some(test) { if child.Some(predicate) {
return true return true
} }
} }
@ -123,14 +123,14 @@ func (self *Node[T]) Some(test func(*Node[T]) bool) bool {
return false return false
} }
func (self *Node[T]) SomeFile(test func(*T) bool) bool { func (self *Node[T]) SomeFile(predicate func(*T) bool) bool {
if self.IsFile() { if self.IsFile() {
if test(self.File) { if predicate(self.File) {
return true return true
} }
} else { } else {
for _, child := range self.Children { for _, child := range self.Children {
if child.SomeFile(test) { if child.SomeFile(predicate) {
return true return true
} }
} }
@ -139,13 +139,13 @@ func (self *Node[T]) SomeFile(test func(*T) bool) bool {
return false return false
} }
func (self *Node[T]) Every(test func(*Node[T]) bool) bool { func (self *Node[T]) Every(predicate func(*Node[T]) bool) bool {
if !test(self) { if !predicate(self) {
return false return false
} }
for _, child := range self.Children { for _, child := range self.Children {
if !child.Every(test) { if !child.Every(predicate) {
return false return false
} }
} }
@ -153,14 +153,14 @@ func (self *Node[T]) Every(test func(*Node[T]) bool) bool {
return true return true
} }
func (self *Node[T]) EveryFile(test func(*T) bool) bool { func (self *Node[T]) EveryFile(predicate func(*T) bool) bool {
if self.IsFile() { if self.IsFile() {
if !test(self.File) { if !predicate(self.File) {
return false return false
} }
} else { } else {
for _, child := range self.Children { for _, child := range self.Children {
if !child.EveryFile(test) { if !child.EveryFile(predicate) {
return false return false
} }
} }
@ -279,23 +279,23 @@ func (self *Node[T]) compressAux() *Node[T] {
return self return self
} }
func (self *Node[T]) GetPathsMatching(test func(*Node[T]) bool) []string { func (self *Node[T]) GetPathsMatching(predicate func(*Node[T]) bool) []string {
paths := []string{} paths := []string{}
if test(self) { if predicate(self) {
paths = append(paths, self.GetPath()) paths = append(paths, self.GetPath())
} }
for _, child := range self.Children { for _, child := range self.Children {
paths = append(paths, child.GetPathsMatching(test)...) paths = append(paths, child.GetPathsMatching(predicate)...)
} }
return paths return paths
} }
func (self *Node[T]) GetFilePathsMatching(test func(*T) bool) []string { func (self *Node[T]) GetFilePathsMatching(predicate func(*T) bool) []string {
matchingFileNodes := lo.Filter(self.GetLeaves(), func(node *Node[T], _ int) bool { matchingFileNodes := lo.Filter(self.GetLeaves(), func(node *Node[T], _ int) bool {
return test(node.File) return predicate(node.File)
}) })
return lo.Map(matchingFileNodes, func(node *Node[T], _ int) string { return lo.Map(matchingFileNodes, func(node *Node[T], _ int) string {