- Sort Score
- Result 10 results
- Languages All
Results 351 - 360 of 5,887 for Find (0.04 sec)
-
src/main/webapp/js/admin/popper.min.js
n=S(e),i={width:n.width,height:n.height},r=-1!==['right','left'].indexOf(o),p=r?'top':'left',s=r?'left':'top',d=r?'height':'width',a=r?'width':'height';return i[p]=t[p]+t[d]/2-n[d]/2,i[s]=o===s?t[s]-n[a]:t[T(s)],i}function D(e,t){return Array.prototype.find?e.find(t):e.filter(t)[0]}function N(e,t,o){if(Array.prototype.findIndex)return e.findIndex(function(e){return e[t]===o});var n=D(e,function(e){return e[t]===o});return e.indexOf(n)}function P(t,o,n){var i=void 0===n?t:t.slice(0,N(t,'name',n));return i...Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 20.7K bytes - Viewed (0) -
cmd/metacache-set.go
select { case <-ctx.Done(): done.Store(true) return metaCacheEntriesSorted{}, ctx.Err() case r := <-resultsDone: return r, resErr } } } // findFirstPart will find the part with 0 being the first that corresponds to the marker in the options. // io.ErrUnexpectedEOF is returned if the place containing the marker hasn't been scanned yet.Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 30.7K bytes - Viewed (0) -
LICENSE
computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Apr 23 18:58:53 UTC 2021 - 33.7K bytes - Viewed (0) -
src/cmd/asm/internal/lex/input.go
if len(in.ifdefStack) == 0 { in.Error("unmatched #endif") } in.ifdefStack = in.ifdefStack[:len(in.ifdefStack)-1] } // #include processing. func (in *Input) include() { // Find and parse string. tok := in.Stack.Next() if tok != scanner.String { in.expectText("expected string after #include") } name, err := strconv.Unquote(in.Stack.Text()) if err != nil {
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Fri Sep 06 13:17:27 UTC 2024 - 12.5K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb1/net/NetServerEnum2Test.java
byte[] dst = new byte[1024]; int bytesWritten = netServerEnum2.writeParametersWireFormat(dst, 0); assertTrue(bytesWritten > 0); // Find and verify domain String expectedDescr = "WrLehDO\u0000B16BBDz\u0000"; int domainStart = 2 + expectedDescr.getBytes().length + 8; String writtenDomain = readNullTerminatedString(dst, domainStart);Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 19.7K bytes - Viewed (0) -
src/test/java/jcifs/smb/SmbTransportImplTest.java
f.setAccessible(true); return f.get(target); } catch (Exception e) { throw new RuntimeException(e); } } // Helper: find field in class hierarchy private static Field findField(Class<?> clazz, String name) throws NoSuchFieldException { Class<?> current = clazz; while (current != null) { try {
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 17.6K bytes - Viewed (0) -
cmd/local-locker.go
// or last read lock) // UID and optionally owner must match for entries to be deleted. func (l *localLocker) removeEntry(name string, args dsync.LockArgs, lri *[]lockRequesterInfo) bool { // Find correct entry to remove based on uid. for index, entry := range *lri { if entry.UID == args.UID && (args.Owner == "" || entry.Owner == args.Owner) { if len(*lri) == 1 { // Remove the write lock.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 12K bytes - Viewed (0) -
src/cmd/asm/internal/asm/endtoend_test.go
} if len(hexByLine) > 0 { var missing []string for key := range hexByLine { missing = append(missing, key) } sort.Strings(missing) for _, line := range missing { t.Errorf("%s: did not find instruction encoding", line) } } } func isHexes(s string) bool { if s == "" { return false } if s == "empty" { return true }
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Mar 26 01:02:50 UTC 2025 - 11.9K bytes - Viewed (0) -
gorm.go
return err } joinSchema = stmt.Schema relation, ok := modelSchema.Relationships.Relations[field] isRelation := ok && relation.JoinTable != nil if !isRelation { return fmt.Errorf("failed to find relation: %s", field) } for _, ref := range relation.References { f := joinSchema.LookUpField(ref.ForeignKey.DBName) if f == nil { return fmt.Errorf("missing field %s for join table", ref.ForeignKey.DBName)
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Tue Aug 26 06:24:29 UTC 2025 - 12.8K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
* http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ package com.google.common.util.concurrent;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue May 13 18:46:00 UTC 2025 - 18.9K bytes - Viewed (0)