Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
掘金者说
vscode
提交
5c23d38a
V
vscode
项目概览
掘金者说
/
vscode
与 Fork 源项目一致
从无法访问的项目Fork
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
V
vscode
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
5c23d38a
编写于
10月 15, 2018
作者:
R
Rob Lourens
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Refactor search - move file search code out of ExtHostSearch
Not generic now, maybe in the future
上级
ab1a7570
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
363 addition
and
349 deletion
+363
-349
src/vs/workbench/api/node/extHostSearch.fileIndex.ts
src/vs/workbench/api/node/extHostSearch.fileIndex.ts
+1
-19
src/vs/workbench/api/node/extHostSearch.ts
src/vs/workbench/api/node/extHostSearch.ts
+4
-330
src/vs/workbench/services/search/node/fileSearchManager.ts
src/vs/workbench/services/search/node/fileSearchManager.ts
+358
-0
未找到文件。
src/vs/workbench/api/node/extHostSearch.fileIndex.ts
浏览文件 @
5c23d38a
...
...
@@ -19,25 +19,7 @@ import { compareItemsByScore, IItemAccessor, prepareQuery, ScorerCache } from 'v
import
{
ICachedSearchStats
,
IFileIndexProviderStats
,
IFileMatch
,
IFileSearchStats
,
IFolderQuery
,
IRawSearchQuery
,
ISearchCompleteStats
,
ISearchQuery
}
from
'
vs/platform/search/common/search
'
;
import
*
as
vscode
from
'
vscode
'
;
import
{
resolvePatternsForProvider
,
QueryGlobTester
}
from
'
vs/workbench/services/search/node/search
'
;
export
interface
IInternalFileMatch
{
base
:
URI
;
original
?:
URI
;
relativePath
?:
string
;
// Not present for extraFiles or absolute path matches
basename
:
string
;
size
?:
number
;
}
export
interface
IDirectoryEntry
{
base
:
URI
;
relativePath
:
string
;
basename
:
string
;
}
export
interface
IDirectoryTree
{
rootEntries
:
IDirectoryEntry
[];
pathToEntries
:
{
[
relativePath
:
string
]:
IDirectoryEntry
[]
};
}
import
{
IInternalFileMatch
,
IDirectoryTree
,
IDirectoryEntry
}
from
'
vs/workbench/services/search/node/fileSearchManager
'
;
interface
IInternalSearchComplete
<
T
=
IFileSearchStats
>
{
limitHit
:
boolean
;
...
...
src/vs/workbench/api/node/extHostSearch.ts
浏览文件 @
5c23d38a
...
...
@@ -3,26 +3,21 @@
* Licensed under the MIT License. See License.txt in the project root for license information.
*--------------------------------------------------------------------------------------------*/
import
*
as
path
from
'
path
'
;
import
{
CancellationToken
,
CancellationTokenSource
}
from
'
vs/base/common/cancellation
'
;
import
{
toErrorMessage
}
from
'
vs/base/common/errorMessage
'
;
import
*
as
glob
from
'
vs/base/common/glob
'
;
import
{
CancellationToken
}
from
'
vs/base/common/cancellation
'
;
import
{
IDisposable
,
toDisposable
}
from
'
vs/base/common/lifecycle
'
;
import
*
as
resources
from
'
vs/base/common/resources
'
;
import
{
StopWatch
}
from
'
vs/base/common/stopwatch
'
;
import
{
URI
,
UriComponents
}
from
'
vs/base/common/uri
'
;
import
{
TPromise
}
from
'
vs/base/common/winjs.base
'
;
import
*
as
extfs
from
'
vs/base/node/extfs
'
;
import
{
ILogService
}
from
'
vs/platform/log/common/log
'
;
import
{
IF
ileMatch
,
IFileSearchProviderStats
,
IF
olderQuery
,
IPatternInfo
,
IRawSearchQuery
,
ISearchCompleteStats
,
ISearchQuery
}
from
'
vs/platform/search/common/search
'
;
import
{
IFolderQuery
,
IPatternInfo
,
IRawSearchQuery
,
ISearchCompleteStats
,
ISearchQuery
}
from
'
vs/platform/search/common/search
'
;
import
{
ExtHostConfiguration
}
from
'
vs/workbench/api/node/extHostConfiguration
'
;
import
{
FileIndexSearchManager
,
IDirectoryEntry
,
IDirectoryTree
,
IInternalFileMatch
}
from
'
vs/workbench/api/node/extHostSearch.fileIndex
'
;
import
{
FileIndexSearchManager
}
from
'
vs/workbench/api/node/extHostSearch.fileIndex
'
;
import
{
RipgrepSearchProvider
}
from
'
vs/workbench/services/search/node/ripgrepSearchProvider
'
;
import
{
OutputChannel
}
from
'
vs/workbench/services/search/node/ripgrepSearchUtils
'
;
import
{
QueryGlobTester
,
resolvePatternsForProvider
}
from
'
vs/workbench/services/search/node/search
'
;
import
{
TextSearchManager
}
from
'
vs/workbench/services/search/node/textSearchManager
'
;
import
*
as
vscode
from
'
vscode
'
;
import
{
ExtHostSearchShape
,
IMainContext
,
MainContext
,
MainThreadSearchShape
}
from
'
./extHost.protocol
'
;
import
{
FileSearchManager
}
from
'
vs/workbench/services/search/node/fileSearchManager
'
;
export
interface
ISchemeTransformer
{
transformOutgoing
(
scheme
:
string
):
string
;
...
...
@@ -156,324 +151,3 @@ function reviveFolderQuery(rawFolderQuery: IFolderQuery<UriComponents>): IFolder
};
}
class
FileSearchEngine
{
private
filePattern
:
string
;
private
includePattern
:
glob
.
ParsedExpression
;
private
maxResults
:
number
;
private
exists
:
boolean
;
private
isLimitHit
:
boolean
;
private
resultCount
:
number
;
private
isCanceled
:
boolean
;
private
activeCancellationTokens
:
Set
<
CancellationTokenSource
>
;
private
globalExcludePattern
:
glob
.
ParsedExpression
;
constructor
(
private
config
:
ISearchQuery
,
private
provider
:
vscode
.
FileSearchProvider
)
{
this
.
filePattern
=
config
.
filePattern
;
this
.
includePattern
=
config
.
includePattern
&&
glob
.
parse
(
config
.
includePattern
);
this
.
maxResults
=
config
.
maxResults
||
null
;
this
.
exists
=
config
.
exists
;
this
.
resultCount
=
0
;
this
.
isLimitHit
=
false
;
this
.
activeCancellationTokens
=
new
Set
<
CancellationTokenSource
>
();
this
.
globalExcludePattern
=
config
.
excludePattern
&&
glob
.
parse
(
config
.
excludePattern
);
}
public
cancel
():
void
{
this
.
isCanceled
=
true
;
this
.
activeCancellationTokens
.
forEach
(
t
=>
t
.
cancel
());
this
.
activeCancellationTokens
=
new
Set
();
}
public
search
(
_onResult
:
(
match
:
IInternalFileMatch
)
=>
void
):
TPromise
<
IInternalSearchComplete
>
{
const
folderQueries
=
this
.
config
.
folderQueries
;
return
new
TPromise
((
resolve
,
reject
)
=>
{
const
onResult
=
(
match
:
IInternalFileMatch
)
=>
{
this
.
resultCount
++
;
_onResult
(
match
);
};
// Support that the file pattern is a full path to a file that exists
if
(
this
.
isCanceled
)
{
return
resolve
({
limitHit
:
this
.
isLimitHit
});
}
// For each extra file
if
(
this
.
config
.
extraFileResources
)
{
this
.
config
.
extraFileResources
.
forEach
(
extraFile
=>
{
const
extraFileStr
=
extraFile
.
toString
();
// ?
const
basename
=
path
.
basename
(
extraFileStr
);
if
(
this
.
globalExcludePattern
&&
this
.
globalExcludePattern
(
extraFileStr
,
basename
))
{
return
;
// excluded
}
// File: Check for match on file pattern and include pattern
this
.
matchFile
(
onResult
,
{
base
:
extraFile
,
basename
});
});
}
// For each root folder
TPromise
.
join
(
folderQueries
.
map
(
fq
=>
{
return
this
.
searchInFolder
(
fq
,
onResult
);
})).
then
(
stats
=>
{
resolve
({
limitHit
:
this
.
isLimitHit
,
stats
:
stats
[
0
]
// Only looking at single-folder workspace stats...
});
},
(
errs
:
Error
[])
=>
{
const
errMsg
=
errs
.
map
(
err
=>
toErrorMessage
(
err
))
.
filter
(
msg
=>
!!
msg
)[
0
];
reject
(
new
Error
(
errMsg
));
});
});
}
private
searchInFolder
(
fq
:
IFolderQuery
<
URI
>
,
onResult
:
(
match
:
IInternalFileMatch
)
=>
void
):
TPromise
<
IFileSearchProviderStats
>
{
let
cancellation
=
new
CancellationTokenSource
();
return
new
TPromise
((
resolve
,
reject
)
=>
{
const
options
=
this
.
getSearchOptionsForFolder
(
fq
);
const
tree
=
this
.
initDirectoryTree
();
const
queryTester
=
new
QueryGlobTester
(
this
.
config
,
fq
);
const
noSiblingsClauses
=
!
queryTester
.
hasSiblingExcludeClauses
();
let
providerSW
:
StopWatch
;
new
TPromise
(
_resolve
=>
process
.
nextTick
(
_resolve
))
.
then
(()
=>
{
this
.
activeCancellationTokens
.
add
(
cancellation
);
providerSW
=
StopWatch
.
create
();
return
this
.
provider
.
provideFileSearchResults
(
{
pattern
:
this
.
config
.
filePattern
||
''
},
options
,
cancellation
.
token
);
})
.
then
(
results
=>
{
const
providerTime
=
providerSW
.
elapsed
();
const
postProcessSW
=
StopWatch
.
create
();
if
(
this
.
isCanceled
)
{
return
null
;
}
if
(
results
)
{
results
.
forEach
(
result
=>
{
const
relativePath
=
path
.
relative
(
fq
.
folder
.
fsPath
,
result
.
fsPath
);
if
(
noSiblingsClauses
)
{
const
basename
=
path
.
basename
(
result
.
fsPath
);
this
.
matchFile
(
onResult
,
{
base
:
fq
.
folder
,
relativePath
,
basename
});
return
;
}
// TODO: Optimize siblings clauses with ripgrep here.
this
.
addDirectoryEntries
(
tree
,
fq
.
folder
,
relativePath
,
onResult
);
});
}
this
.
activeCancellationTokens
.
delete
(
cancellation
);
if
(
this
.
isCanceled
)
{
return
null
;
}
this
.
matchDirectoryTree
(
tree
,
queryTester
,
onResult
);
return
<
IFileSearchProviderStats
>
{
providerTime
,
postProcessTime
:
postProcessSW
.
elapsed
()
};
}).
then
(
stats
=>
{
cancellation
.
dispose
();
resolve
(
stats
);
},
err
=>
{
cancellation
.
dispose
();
reject
(
err
);
});
});
}
private
getSearchOptionsForFolder
(
fq
:
IFolderQuery
<
URI
>
):
vscode
.
FileSearchOptions
{
const
includes
=
resolvePatternsForProvider
(
this
.
config
.
includePattern
,
fq
.
includePattern
);
const
excludes
=
resolvePatternsForProvider
(
this
.
config
.
excludePattern
,
fq
.
excludePattern
);
return
{
folder
:
fq
.
folder
,
excludes
,
includes
,
useIgnoreFiles
:
!
this
.
config
.
disregardIgnoreFiles
,
useGlobalIgnoreFiles
:
!
this
.
config
.
disregardGlobalIgnoreFiles
,
followSymlinks
:
!
this
.
config
.
ignoreSymlinks
,
maxResults
:
this
.
config
.
maxResults
};
}
private
initDirectoryTree
():
IDirectoryTree
{
const
tree
:
IDirectoryTree
=
{
rootEntries
:
[],
pathToEntries
:
Object
.
create
(
null
)
};
tree
.
pathToEntries
[
'
.
'
]
=
tree
.
rootEntries
;
return
tree
;
}
private
addDirectoryEntries
({
pathToEntries
}:
IDirectoryTree
,
base
:
URI
,
relativeFile
:
string
,
onResult
:
(
result
:
IInternalFileMatch
)
=>
void
)
{
// Support relative paths to files from a root resource (ignores excludes)
if
(
relativeFile
===
this
.
filePattern
)
{
const
basename
=
path
.
basename
(
this
.
filePattern
);
this
.
matchFile
(
onResult
,
{
base
:
base
,
relativePath
:
this
.
filePattern
,
basename
});
}
function
add
(
relativePath
:
string
)
{
const
basename
=
path
.
basename
(
relativePath
);
const
dirname
=
path
.
dirname
(
relativePath
);
let
entries
=
pathToEntries
[
dirname
];
if
(
!
entries
)
{
entries
=
pathToEntries
[
dirname
]
=
[];
add
(
dirname
);
}
entries
.
push
({
base
,
relativePath
,
basename
});
}
add
(
relativeFile
);
}
private
matchDirectoryTree
({
rootEntries
,
pathToEntries
}:
IDirectoryTree
,
queryTester
:
QueryGlobTester
,
onResult
:
(
result
:
IInternalFileMatch
)
=>
void
)
{
const
self
=
this
;
const
filePattern
=
this
.
filePattern
;
function
matchDirectory
(
entries
:
IDirectoryEntry
[])
{
const
hasSibling
=
glob
.
hasSiblingFn
(()
=>
entries
.
map
(
entry
=>
entry
.
basename
));
for
(
let
i
=
0
,
n
=
entries
.
length
;
i
<
n
;
i
++
)
{
const
entry
=
entries
[
i
];
const
{
relativePath
,
basename
}
=
entry
;
// Check exclude pattern
// If the user searches for the exact file name, we adjust the glob matching
// to ignore filtering by siblings because the user seems to know what she
// is searching for and we want to include the result in that case anyway
if
(
!
queryTester
.
includedInQuerySync
(
relativePath
,
basename
,
filePattern
!==
basename
?
hasSibling
:
undefined
))
{
continue
;
}
const
sub
=
pathToEntries
[
relativePath
];
if
(
sub
)
{
matchDirectory
(
sub
);
}
else
{
if
(
relativePath
===
filePattern
)
{
continue
;
// ignore file if its path matches with the file pattern because that is already matched above
}
self
.
matchFile
(
onResult
,
entry
);
}
if
(
self
.
isLimitHit
)
{
break
;
}
}
}
matchDirectory
(
rootEntries
);
}
private
matchFile
(
onResult
:
(
result
:
IInternalFileMatch
)
=>
void
,
candidate
:
IInternalFileMatch
):
void
{
if
(
!
this
.
includePattern
||
this
.
includePattern
(
candidate
.
relativePath
,
candidate
.
basename
))
{
if
(
this
.
exists
||
(
this
.
maxResults
&&
this
.
resultCount
>=
this
.
maxResults
))
{
this
.
isLimitHit
=
true
;
this
.
cancel
();
}
if
(
!
this
.
isLimitHit
)
{
onResult
(
candidate
);
}
}
}
}
interface
IInternalSearchComplete
{
limitHit
:
boolean
;
stats
?:
IFileSearchProviderStats
;
}
class
FileSearchManager
{
private
static
readonly
BATCH_SIZE
=
512
;
fileSearch
(
config
:
ISearchQuery
,
provider
:
vscode
.
FileSearchProvider
,
onBatch
:
(
matches
:
IFileMatch
[])
=>
void
,
token
:
CancellationToken
):
TPromise
<
ISearchCompleteStats
>
{
const
engine
=
new
FileSearchEngine
(
config
,
provider
);
let
resultCount
=
0
;
const
onInternalResult
=
(
batch
:
IInternalFileMatch
[])
=>
{
resultCount
+=
batch
.
length
;
onBatch
(
batch
.
map
(
m
=>
this
.
rawMatchToSearchItem
(
m
)));
};
return
this
.
doSearch
(
engine
,
FileSearchManager
.
BATCH_SIZE
,
onInternalResult
,
token
).
then
(
result
=>
{
return
<
ISearchCompleteStats
>
{
limitHit
:
result
.
limitHit
,
stats
:
{
fromCache
:
false
,
type
:
'
fileSearchProvider
'
,
resultCount
,
detailStats
:
result
.
stats
}
};
});
}
private
rawMatchToSearchItem
(
match
:
IInternalFileMatch
):
IFileMatch
{
if
(
match
.
relativePath
)
{
return
{
resource
:
resources
.
joinPath
(
match
.
base
,
match
.
relativePath
)
};
}
else
{
// extraFileResources
return
{
resource
:
match
.
base
};
}
}
private
doSearch
(
engine
:
FileSearchEngine
,
batchSize
:
number
,
onResultBatch
:
(
matches
:
IInternalFileMatch
[])
=>
void
,
token
:
CancellationToken
):
TPromise
<
IInternalSearchComplete
>
{
token
.
onCancellationRequested
(()
=>
{
engine
.
cancel
();
});
const
_onResult
=
match
=>
{
if
(
match
)
{
batch
.
push
(
match
);
if
(
batchSize
>
0
&&
batch
.
length
>=
batchSize
)
{
onResultBatch
(
batch
);
batch
=
[];
}
}
};
let
batch
:
IInternalFileMatch
[]
=
[];
return
engine
.
search
(
_onResult
).
then
(
result
=>
{
if
(
batch
.
length
)
{
onResultBatch
(
batch
);
}
return
result
;
},
error
=>
{
if
(
batch
.
length
)
{
onResultBatch
(
batch
);
}
return
TPromise
.
wrapError
(
error
);
});
}
}
src/vs/workbench/services/search/node/fileSearchManager.ts
0 → 100644
浏览文件 @
5c23d38a
/*---------------------------------------------------------------------------------------------
* Copyright (c) Microsoft Corporation. All rights reserved.
* Licensed under the MIT License. See License.txt in the project root for license information.
*--------------------------------------------------------------------------------------------*/
import
*
as
path
from
'
path
'
;
import
{
CancellationToken
,
CancellationTokenSource
}
from
'
vs/base/common/cancellation
'
;
import
{
toErrorMessage
}
from
'
vs/base/common/errorMessage
'
;
import
*
as
glob
from
'
vs/base/common/glob
'
;
import
*
as
resources
from
'
vs/base/common/resources
'
;
import
{
StopWatch
}
from
'
vs/base/common/stopwatch
'
;
import
{
URI
}
from
'
vs/base/common/uri
'
;
import
{
TPromise
}
from
'
vs/base/common/winjs.base
'
;
import
{
IFileMatch
,
IFileSearchProviderStats
,
IFolderQuery
,
ISearchCompleteStats
,
ISearchQuery
}
from
'
vs/platform/search/common/search
'
;
import
{
QueryGlobTester
,
resolvePatternsForProvider
}
from
'
vs/workbench/services/search/node/search
'
;
import
*
as
vscode
from
'
vscode
'
;
export
interface
IInternalFileMatch
{
base
:
URI
;
original
?:
URI
;
relativePath
?:
string
;
// Not present for extraFiles or absolute path matches
basename
:
string
;
size
?:
number
;
}
export
interface
IDirectoryEntry
{
base
:
URI
;
relativePath
:
string
;
basename
:
string
;
}
export
interface
IDirectoryTree
{
rootEntries
:
IDirectoryEntry
[];
pathToEntries
:
{
[
relativePath
:
string
]:
IDirectoryEntry
[]
};
}
class
FileSearchEngine
{
private
filePattern
:
string
;
private
includePattern
:
glob
.
ParsedExpression
;
private
maxResults
:
number
;
private
exists
:
boolean
;
private
isLimitHit
:
boolean
;
private
resultCount
:
number
;
private
isCanceled
:
boolean
;
private
activeCancellationTokens
:
Set
<
CancellationTokenSource
>
;
private
globalExcludePattern
:
glob
.
ParsedExpression
;
constructor
(
private
config
:
ISearchQuery
,
private
provider
:
vscode
.
FileSearchProvider
)
{
this
.
filePattern
=
config
.
filePattern
;
this
.
includePattern
=
config
.
includePattern
&&
glob
.
parse
(
config
.
includePattern
);
this
.
maxResults
=
config
.
maxResults
||
null
;
this
.
exists
=
config
.
exists
;
this
.
resultCount
=
0
;
this
.
isLimitHit
=
false
;
this
.
activeCancellationTokens
=
new
Set
<
CancellationTokenSource
>
();
this
.
globalExcludePattern
=
config
.
excludePattern
&&
glob
.
parse
(
config
.
excludePattern
);
}
public
cancel
():
void
{
this
.
isCanceled
=
true
;
this
.
activeCancellationTokens
.
forEach
(
t
=>
t
.
cancel
());
this
.
activeCancellationTokens
=
new
Set
();
}
public
search
(
_onResult
:
(
match
:
IInternalFileMatch
)
=>
void
):
TPromise
<
IInternalSearchComplete
>
{
const
folderQueries
=
this
.
config
.
folderQueries
;
return
new
TPromise
((
resolve
,
reject
)
=>
{
const
onResult
=
(
match
:
IInternalFileMatch
)
=>
{
this
.
resultCount
++
;
_onResult
(
match
);
};
// Support that the file pattern is a full path to a file that exists
if
(
this
.
isCanceled
)
{
return
resolve
({
limitHit
:
this
.
isLimitHit
});
}
// For each extra file
if
(
this
.
config
.
extraFileResources
)
{
this
.
config
.
extraFileResources
.
forEach
(
extraFile
=>
{
const
extraFileStr
=
extraFile
.
toString
();
// ?
const
basename
=
path
.
basename
(
extraFileStr
);
if
(
this
.
globalExcludePattern
&&
this
.
globalExcludePattern
(
extraFileStr
,
basename
))
{
return
;
// excluded
}
// File: Check for match on file pattern and include pattern
this
.
matchFile
(
onResult
,
{
base
:
extraFile
,
basename
});
});
}
// For each root folder
TPromise
.
join
(
folderQueries
.
map
(
fq
=>
{
return
this
.
searchInFolder
(
fq
,
onResult
);
})).
then
(
stats
=>
{
resolve
({
limitHit
:
this
.
isLimitHit
,
stats
:
stats
[
0
]
// Only looking at single-folder workspace stats...
});
},
(
errs
:
Error
[])
=>
{
const
errMsg
=
errs
.
map
(
err
=>
toErrorMessage
(
err
))
.
filter
(
msg
=>
!!
msg
)[
0
];
reject
(
new
Error
(
errMsg
));
});
});
}
private
searchInFolder
(
fq
:
IFolderQuery
<
URI
>
,
onResult
:
(
match
:
IInternalFileMatch
)
=>
void
):
TPromise
<
IFileSearchProviderStats
>
{
let
cancellation
=
new
CancellationTokenSource
();
return
new
TPromise
((
resolve
,
reject
)
=>
{
const
options
=
this
.
getSearchOptionsForFolder
(
fq
);
const
tree
=
this
.
initDirectoryTree
();
const
queryTester
=
new
QueryGlobTester
(
this
.
config
,
fq
);
const
noSiblingsClauses
=
!
queryTester
.
hasSiblingExcludeClauses
();
let
providerSW
:
StopWatch
;
new
TPromise
(
_resolve
=>
process
.
nextTick
(
_resolve
))
.
then
(()
=>
{
this
.
activeCancellationTokens
.
add
(
cancellation
);
providerSW
=
StopWatch
.
create
();
return
this
.
provider
.
provideFileSearchResults
(
{
pattern
:
this
.
config
.
filePattern
||
''
},
options
,
cancellation
.
token
);
})
.
then
(
results
=>
{
const
providerTime
=
providerSW
.
elapsed
();
const
postProcessSW
=
StopWatch
.
create
();
if
(
this
.
isCanceled
)
{
return
null
;
}
if
(
results
)
{
results
.
forEach
(
result
=>
{
const
relativePath
=
path
.
relative
(
fq
.
folder
.
fsPath
,
result
.
fsPath
);
if
(
noSiblingsClauses
)
{
const
basename
=
path
.
basename
(
result
.
fsPath
);
this
.
matchFile
(
onResult
,
{
base
:
fq
.
folder
,
relativePath
,
basename
});
return
;
}
// TODO: Optimize siblings clauses with ripgrep here.
this
.
addDirectoryEntries
(
tree
,
fq
.
folder
,
relativePath
,
onResult
);
});
}
this
.
activeCancellationTokens
.
delete
(
cancellation
);
if
(
this
.
isCanceled
)
{
return
null
;
}
this
.
matchDirectoryTree
(
tree
,
queryTester
,
onResult
);
return
<
IFileSearchProviderStats
>
{
providerTime
,
postProcessTime
:
postProcessSW
.
elapsed
()
};
}).
then
(
stats
=>
{
cancellation
.
dispose
();
resolve
(
stats
);
},
err
=>
{
cancellation
.
dispose
();
reject
(
err
);
});
});
}
private
getSearchOptionsForFolder
(
fq
:
IFolderQuery
<
URI
>
):
vscode
.
FileSearchOptions
{
const
includes
=
resolvePatternsForProvider
(
this
.
config
.
includePattern
,
fq
.
includePattern
);
const
excludes
=
resolvePatternsForProvider
(
this
.
config
.
excludePattern
,
fq
.
excludePattern
);
return
{
folder
:
fq
.
folder
,
excludes
,
includes
,
useIgnoreFiles
:
!
this
.
config
.
disregardIgnoreFiles
,
useGlobalIgnoreFiles
:
!
this
.
config
.
disregardGlobalIgnoreFiles
,
followSymlinks
:
!
this
.
config
.
ignoreSymlinks
,
maxResults
:
this
.
config
.
maxResults
};
}
private
initDirectoryTree
():
IDirectoryTree
{
const
tree
:
IDirectoryTree
=
{
rootEntries
:
[],
pathToEntries
:
Object
.
create
(
null
)
};
tree
.
pathToEntries
[
'
.
'
]
=
tree
.
rootEntries
;
return
tree
;
}
private
addDirectoryEntries
({
pathToEntries
}:
IDirectoryTree
,
base
:
URI
,
relativeFile
:
string
,
onResult
:
(
result
:
IInternalFileMatch
)
=>
void
)
{
// Support relative paths to files from a root resource (ignores excludes)
if
(
relativeFile
===
this
.
filePattern
)
{
const
basename
=
path
.
basename
(
this
.
filePattern
);
this
.
matchFile
(
onResult
,
{
base
:
base
,
relativePath
:
this
.
filePattern
,
basename
});
}
function
add
(
relativePath
:
string
)
{
const
basename
=
path
.
basename
(
relativePath
);
const
dirname
=
path
.
dirname
(
relativePath
);
let
entries
=
pathToEntries
[
dirname
];
if
(
!
entries
)
{
entries
=
pathToEntries
[
dirname
]
=
[];
add
(
dirname
);
}
entries
.
push
({
base
,
relativePath
,
basename
});
}
add
(
relativeFile
);
}
private
matchDirectoryTree
({
rootEntries
,
pathToEntries
}:
IDirectoryTree
,
queryTester
:
QueryGlobTester
,
onResult
:
(
result
:
IInternalFileMatch
)
=>
void
)
{
const
self
=
this
;
const
filePattern
=
this
.
filePattern
;
function
matchDirectory
(
entries
:
IDirectoryEntry
[])
{
const
hasSibling
=
glob
.
hasSiblingFn
(()
=>
entries
.
map
(
entry
=>
entry
.
basename
));
for
(
let
i
=
0
,
n
=
entries
.
length
;
i
<
n
;
i
++
)
{
const
entry
=
entries
[
i
];
const
{
relativePath
,
basename
}
=
entry
;
// Check exclude pattern
// If the user searches for the exact file name, we adjust the glob matching
// to ignore filtering by siblings because the user seems to know what she
// is searching for and we want to include the result in that case anyway
if
(
!
queryTester
.
includedInQuerySync
(
relativePath
,
basename
,
filePattern
!==
basename
?
hasSibling
:
undefined
))
{
continue
;
}
const
sub
=
pathToEntries
[
relativePath
];
if
(
sub
)
{
matchDirectory
(
sub
);
}
else
{
if
(
relativePath
===
filePattern
)
{
continue
;
// ignore file if its path matches with the file pattern because that is already matched above
}
self
.
matchFile
(
onResult
,
entry
);
}
if
(
self
.
isLimitHit
)
{
break
;
}
}
}
matchDirectory
(
rootEntries
);
}
private
matchFile
(
onResult
:
(
result
:
IInternalFileMatch
)
=>
void
,
candidate
:
IInternalFileMatch
):
void
{
if
(
!
this
.
includePattern
||
this
.
includePattern
(
candidate
.
relativePath
,
candidate
.
basename
))
{
if
(
this
.
exists
||
(
this
.
maxResults
&&
this
.
resultCount
>=
this
.
maxResults
))
{
this
.
isLimitHit
=
true
;
this
.
cancel
();
}
if
(
!
this
.
isLimitHit
)
{
onResult
(
candidate
);
}
}
}
}
interface
IInternalSearchComplete
{
limitHit
:
boolean
;
stats
?:
IFileSearchProviderStats
;
}
export
class
FileSearchManager
{
private
static
readonly
BATCH_SIZE
=
512
;
fileSearch
(
config
:
ISearchQuery
,
provider
:
vscode
.
FileSearchProvider
,
onBatch
:
(
matches
:
IFileMatch
[])
=>
void
,
token
:
CancellationToken
):
TPromise
<
ISearchCompleteStats
>
{
const
engine
=
new
FileSearchEngine
(
config
,
provider
);
let
resultCount
=
0
;
const
onInternalResult
=
(
batch
:
IInternalFileMatch
[])
=>
{
resultCount
+=
batch
.
length
;
onBatch
(
batch
.
map
(
m
=>
this
.
rawMatchToSearchItem
(
m
)));
};
return
this
.
doSearch
(
engine
,
FileSearchManager
.
BATCH_SIZE
,
onInternalResult
,
token
).
then
(
result
=>
{
return
<
ISearchCompleteStats
>
{
limitHit
:
result
.
limitHit
,
stats
:
{
fromCache
:
false
,
type
:
'
fileSearchProvider
'
,
resultCount
,
detailStats
:
result
.
stats
}
};
});
}
private
rawMatchToSearchItem
(
match
:
IInternalFileMatch
):
IFileMatch
{
if
(
match
.
relativePath
)
{
return
{
resource
:
resources
.
joinPath
(
match
.
base
,
match
.
relativePath
)
};
}
else
{
// extraFileResources
return
{
resource
:
match
.
base
};
}
}
private
doSearch
(
engine
:
FileSearchEngine
,
batchSize
:
number
,
onResultBatch
:
(
matches
:
IInternalFileMatch
[])
=>
void
,
token
:
CancellationToken
):
TPromise
<
IInternalSearchComplete
>
{
token
.
onCancellationRequested
(()
=>
{
engine
.
cancel
();
});
const
_onResult
=
match
=>
{
if
(
match
)
{
batch
.
push
(
match
);
if
(
batchSize
>
0
&&
batch
.
length
>=
batchSize
)
{
onResultBatch
(
batch
);
batch
=
[];
}
}
};
let
batch
:
IInternalFileMatch
[]
=
[];
return
engine
.
search
(
_onResult
).
then
(
result
=>
{
if
(
batch
.
length
)
{
onResultBatch
(
batch
);
}
return
result
;
},
error
=>
{
if
(
batch
.
length
)
{
onResultBatch
(
batch
);
}
return
TPromise
.
wrapError
(
error
);
});
}
}
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录