-
-
Notifications
You must be signed in to change notification settings - Fork 5.6k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge branch 'main' into custom-regexp-external-issues
- Loading branch information
Showing
11 changed files
with
232 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,24 @@ | ||
// Copyright 2022 The Gitea Authors. All rights reserved. | ||
// Use of this source code is governed by a MIT-style | ||
// license that can be found in the LICENSE file. | ||
|
||
package repo | ||
|
||
import ( | ||
"net/http" | ||
|
||
"code.gitea.io/gitea/modules/base" | ||
"code.gitea.io/gitea/modules/context" | ||
) | ||
|
||
const ( | ||
tplFindFiles base.TplName = "repo/find/files" | ||
) | ||
|
||
// FindFiles render the page to find repository files | ||
func FindFiles(ctx *context.Context) { | ||
path := ctx.Params("*") | ||
ctx.Data["TreeLink"] = ctx.Repo.RepoLink + "/src/" + path | ||
ctx.Data["DataLink"] = ctx.Repo.RepoLink + "/tree-list/" + path | ||
ctx.HTML(http.StatusOK, tplFindFiles) | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,55 @@ | ||
// Copyright 2022 The Gitea Authors. All rights reserved. | ||
// Use of this source code is governed by a MIT-style | ||
// license that can be found in the LICENSE file. | ||
|
||
package repo | ||
|
||
import ( | ||
"net/http" | ||
|
||
"code.gitea.io/gitea/modules/base" | ||
"code.gitea.io/gitea/modules/context" | ||
"code.gitea.io/gitea/modules/git" | ||
|
||
"github.com/go-enry/go-enry/v2" | ||
) | ||
|
||
// TreeList get all files' entries of a repository | ||
func TreeList(ctx *context.Context) { | ||
tree, err := ctx.Repo.Commit.SubTree("/") | ||
if err != nil { | ||
ctx.ServerError("Repo.Commit.SubTree", err) | ||
return | ||
} | ||
|
||
entries, err := tree.ListEntriesRecursive() | ||
if err != nil { | ||
ctx.ServerError("ListEntriesRecursive", err) | ||
return | ||
} | ||
entries.CustomSort(base.NaturalSortLess) | ||
|
||
files := make([]string, 0, len(entries)) | ||
for _, entry := range entries { | ||
if !isExcludedEntry(entry) { | ||
files = append(files, entry.Name()) | ||
} | ||
} | ||
ctx.JSON(http.StatusOK, files) | ||
} | ||
|
||
func isExcludedEntry(entry *git.TreeEntry) bool { | ||
if entry.IsDir() { | ||
return true | ||
} | ||
|
||
if entry.IsSubModule() { | ||
return true | ||
} | ||
|
||
if enry.IsVendor(entry.Name()) { | ||
return true | ||
} | ||
|
||
return false | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,21 @@ | ||
{{template "base/head" .}} | ||
<div class="page-content repository"> | ||
{{template "repo/header" .}} | ||
<div class="ui container"> | ||
<div class="df ac"> | ||
<a href="{{$.RepoLink}}">{{.RepoName}}</a> | ||
<span class="mx-3">/</span> | ||
<div class="ui input f1"> | ||
<input id="repo-file-find-input" type="text" autofocus data-url-data-link="{{.DataLink}}" data-url-tree-link="{{.TreeLink}}"> | ||
</div> | ||
</div> | ||
<table id="repo-find-file-table" class="ui single line table"> | ||
<tbody> | ||
</tbody> | ||
</table> | ||
<div id="repo-find-file-no-result" class="ui row center mt-5" hidden> | ||
<h3>{{.i18n.Tr "repo.find_file.no_matching"}}</h3> | ||
</div> | ||
</div> | ||
</div> | ||
{{template "base/footer" .}} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,67 @@ | ||
import $ from 'jquery'; | ||
|
||
import {svg} from '../svg.js'; | ||
import {strSubMatch} from '../utils.js'; | ||
const {csrf} = window.config; | ||
|
||
const threshold = 50; | ||
let files = []; | ||
let $repoFindFileInput, $repoFindFileTableBody, $repoFindFileNoResult; | ||
|
||
function filterRepoFiles(filter) { | ||
const treeLink = $repoFindFileInput.attr('data-url-tree-link'); | ||
$repoFindFileTableBody.empty(); | ||
|
||
const fileRes = []; | ||
if (filter) { | ||
for (let i = 0; i < files.length && fileRes.length < threshold; i++) { | ||
const subMatch = strSubMatch(files[i], filter); | ||
if (subMatch.length > 1) { | ||
fileRes.push(subMatch); | ||
} | ||
} | ||
} else { | ||
for (let i = 0; i < files.length && i < threshold; i++) { | ||
fileRes.push([files[i]]); | ||
} | ||
} | ||
|
||
const tmplRow = `<tr><td><a></a></td></tr>`; | ||
|
||
$repoFindFileNoResult.toggle(fileRes.length === 0); | ||
for (const matchRes of fileRes) { | ||
const $row = $(tmplRow); | ||
const $a = $row.find('a'); | ||
$a.attr('href', `${treeLink}/${matchRes.join('')}`); | ||
const $octiconFile = $(svg('octicon-file')).addClass('mr-3'); | ||
$a.append($octiconFile); | ||
// if the target file path is "abc/xyz", to search "bx", then the matchRes is ['a', 'b', 'c/', 'x', 'yz'] | ||
// the matchRes[odd] is matched and highlighted to red. | ||
for (let j = 0; j < matchRes.length; j++) { | ||
if (!matchRes[j]) continue; | ||
const $span = $('<span>').text(matchRes[j]); | ||
if (j % 2 === 1) $span.addClass('ui text red'); | ||
$a.append($span); | ||
} | ||
$repoFindFileTableBody.append($row); | ||
} | ||
} | ||
|
||
async function loadRepoFiles() { | ||
files = await $.ajax({ | ||
url: $repoFindFileInput.attr('data-url-data-link'), | ||
headers: {'X-Csrf-Token': csrf} | ||
}); | ||
filterRepoFiles($repoFindFileInput.val()); | ||
} | ||
|
||
export function initFindFileInRepo() { | ||
$repoFindFileInput = $('#repo-file-find-input'); | ||
if (!$repoFindFileInput.length) return; | ||
|
||
$repoFindFileTableBody = $('#repo-find-file-table tbody'); | ||
$repoFindFileNoResult = $('#repo-find-file-no-result'); | ||
$repoFindFileInput.on('input', () => filterRepoFiles($repoFindFileInput.val())); | ||
|
||
loadRepoFiles(); | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters