​

zoekt: 56 files / 3894 matches / 22.1ms neogrok: 5 files / 500 matches

github.com/sourcegraph/zoektindex/contentprovider.go 177 matches | Go | №1

1 // Copyright 2016 Google Inc. All rights reserved.2 //
4 // you may not use this file except in compliance with the License.5 // You may obtain a copy of the License at6 //
8 //9 // Unless required by applicable law or agreed to in writing, software10 // distributed under the License is distributed on an "AS IS" BASIS,11 // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.12 // See the License for the specific language governing permissions and
93 94 // Find offset in bytes (relative to corpus start) for an offset in95 // runes (relative to document start). If filename is set, the corpus96 // is the set of filenames, with the document being the name itself.97 func (p *contentProvider) findOffset(filename bool, r uint32) uint32 {98 if p.id.metaData.PlainASCII {

github.com/sourcegraph/zoektapi.go 161 matches | Go | №2

1 // Copyright 2016 Google Inc. All rights reserved.2 //
4 // you may not use this file except in compliance with the License.5 // You may obtain a copy of the License at6 //
8 //9 // Unless required by applicable law or agreed to in writing, software10 // distributed under the License is distributed on an "AS IS" BASIS,11 // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.12 // See the License for the specific language governing permissions and
37 38 // FileMatch contains all the matches within a file.39 type FileMatch struct {

github.com/sourcegraph/zoektgrpc/protos/zoekt/webserver/v1/webserver.proto 106 matches | Protocol Buffer | №3

48 49 // Return an upper-bound estimate of eligible documents in50 // stats.ShardFilesConsidered.
55 56 // Maximum number of matches: skip all processing an index57 // shard after we found this many non-overlapping matches.
59 60 // Maximum number of matches: stop looking for more matches61 // once we have this many matches across shards.
63 64 // Maximum number of matches: skip processing documents for a repository in65 // a shard once we have found ShardRepoMaxMatchCount.

github.com/sourcegraph/zoektgitindex/index.go 44 matches | Go | №4

1 // Copyright 2016 Google Inc. All rights reserved.2 //
4 // you may not use this file except in compliance with the License.5 // You may obtain a copy of the License at6 //
8 //9 // Unless required by applicable law or agreed to in writing, software10 // distributed under the License is distributed on an "AS IS" BASIS,11 // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.12 // See the License for the specific language governing permissions and
129 case "gitweb":130 // https://gerrit.libreoffice.org/gitweb?p=online.git;a=blob;f=Makefile.am;h=cfcfd7c36fbae10e269653dc57a9b68c92d4c10b;hb=848145503bf7b98ce4a4aa0a858a0d71dd0dbb26#l10131 repo.FileURLTemplate = u.String() + ";a=blob;f={{.Path}};hb={{.Version}}"

github.com/sourcegraph/zoektindex/builder.go 12 matches | Go | №5

66 67 // Parallelism is the maximum number of shards to index in parallel68 Parallelism int69
115 116 // HeapProfileTriggerBytes is the heap allocation in bytes that will trigger a memory profile. If 0, no memory profile117 // will be triggered. Note this trigger looks at total heap allocation (which includes both inuse and garbage objects).118 //119 // Profiles will be written to files named `index-memory.prof.n` in the index directory. No more than 10 files are written.