In ReadDirRecursive do not try to recurse into broken symlinks

Instead return the symlink as a file in the file list

Author: cmaglie

Diff for: readdir.go

@@ -116,9 +116,7 @@ func (p *Path) ReadDirRecursiveFiltered(recursionFilter ReadDirFilter, filters .
 			}
 
 			if recursionFilter == nil || recursionFilter(path) {
-				if isDir, err := path.IsDirCheck(); err != nil {
-					return nil, err
-				} else if isDir {
+				if path.IsDir() {
 					subPaths, err := search(path)
 					if err != nil {
 						return nil, err

Diff for: readdir_test.go

@@ -250,21 +250,11 @@ func TestReadDirRecursiveFiltered(t *testing.T) {
 func TestReadDirRecursiveLoopDetection(t *testing.T) {
 	loopsPath := New("testdata", "loops")
 	unbuondedReaddir := func(testdir string) (PathList, error) {
-		// This is required to unbound the recursion, otherwise it will stop
-		// when the paths becomes too long due to the symlink loop: this is not
-		// what we want, we are looking for an early detection of the loop.
-		skipBrokenLinks := func(p *Path) bool {
-			_, err := p.Stat()
-			return err == nil
-		}
-
 		var files PathList
 		var err error
 		done := make(chan bool)
 		go func() {
-			files, err = loopsPath.Join(testdir).ReadDirRecursiveFiltered(
-				skipBrokenLinks,
-			)
+			files, err = loopsPath.Join(testdir).ReadDirRecursive()
 			done <- true
 		}()
 		require.Eventually(