- Sort Score
- Num 10 results
- Language All
Results 61 - 70 of 490 for _slide (0.06 seconds)
-
cmd/storage-datatypes_test.go
ModTime: UTCNow(), Size: 3430, Mode: 0x0, Metadata: map[string]string{"X-Minio-Internal-Server-Side-Encryption-Iv": "jIJPsrkkVYYMvc7edBrNl+7zcM7+ZwXqMb/YAjBO/ck=", "X-Minio-Internal-Server-Side-Encryption-S3-Kms-Key-Id": "my-minio-key", "X-Minio-Internal-Server-Side-Encryption-S3-Kms-Sealed-Key": "IAAfAP2p7ZLv3UpLwBnsKkF2mtWba0qoY42tymK0szRgGvAxBNcXyHXYooe9dQpeeEJWgKUa/8R61oCy1mFwIg==", "X-Minio-Internal-Server-Side-Encryption-S3-Sealed-Key": "IAAfAPFYRDkHVirJBJxBixNj3PLWt78dFuUTyTLIdLG820J7XqLPBO4gpEE...
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 9.1K bytes - Click Count (0) -
src/test/java/jcifs/dcerpc/msrpc/lsarpcTest.java
lsarpc.LsarSidPtr sidPtr = new lsarpc.LsarSidPtr(); when(mockNdrBuffer.dec_ndr_long()).thenReturn(0); // _sidp (null) sidPtr.decode(mockNdrBuffer); assertNull(sidPtr.sid); // Not initialized when _sidp is 0 // Note: NdrBuffer does not have decode method } // Test for LsarSidArray @Test void testLsarSidArrayEncode() throws NdrException {
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 60.8K bytes - Click Count (0) -
src/main/webapp/js/jquery-3.7.1.min.js
G(){}function Y(e,t){var n,r,i,o,a,s,u,l=c[e+" "];if(l)return t?0:l.slice(0);a=e,s=[],u=b.preFilter;while(a){for(o in n&&!(r=y.exec(a))||(r&&(a=a.slice(r[0].length)||a),s.push(i=[])),n=!1,(r=m.exec(a))&&(n=r.shift(),i.push({value:n,type:r[0].replace(ve," ")}),a=a.slice(n.length)),b.filter)!(r=D[o].exec(a))||u[o]&&!(r=u[o](r))||(n=r.shift(),i.push({value:n,type:o,matches:r}),a=a.slice(n.length));if(!n)break}return t?a.length:a?I.error(e):c(e,s).slice(0)}function Q(e){for(var t=0,n=e.length,r="";t<n;t++)r+=e[t].value;return...Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Oct 26 01:07:52 GMT 2024 - 85.5K bytes - Click Count (0) -
android/guava/src/com/google/common/math/Quantiles.java
from = partitionPoint + 1; } } } /** * Performs a partition operation on the slice of {@code array} with elements in the range [{@code * from}, {@code to}]. Uses the median of {@code from}, {@code to}, and the midpoint between them * as a pivot. Returns the index which the slice is partitioned around, i.e. if it returns {@codeCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 23 21:06:42 GMT 2026 - 30.1K bytes - Click Count (0) -
src/main/webapp/js/admin/adminlte.min.js
T="ControlSidebar",S="lte.controlsidebar",j=n.default.fn[T],k=".control-sidebar",Q=".control-sidebar-content",H='[data-widget="control-sidebar"]',z=".main-header",F=".main-footer",E="control-sidebar-animate",L="control-sidebar-open",D="control-sidebar-slide-open",R="layout-fixed",A={controlsidebarSlide:!0,scrollbarTheme:"os-theme-light",scrollbarAutoHide:"l",target:k,animationSpeed:300},M=function(){function e(e,t){this._element=e,this._config=t}var t=e.prototype;return t.collapse=function(){var e=th...
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Oct 26 01:49:09 GMT 2024 - 45.3K bytes - Click Count (0) -
finisher_api.go
func (db *DB) CreateInBatches(value interface{}, batchSize int) (tx *DB) { reflectValue := reflect.Indirect(reflect.ValueOf(value)) switch reflectValue.Kind() { case reflect.Slice, reflect.Array: var rowsAffected int64 tx = db.getInstance() // the reflection length judgment of the optimized value reflectLen := reflectValue.Len() callFc := func(tx *DB) error {
Created: Sun Apr 05 09:35:12 GMT 2026 - Last Modified: Fri Sep 19 01:49:06 GMT 2025 - 22.9K bytes - Click Count (0) -
callbacks/helper.go
if len(values.Values) == 0 { values.Values = [][]interface{}{{}} } values.Values[0] = append(values.Values[0], value) } } return } // ConvertSliceOfMapToValuesForCreate convert slice of map to values func ConvertSliceOfMapToValuesForCreate(stmt *gorm.Statement, mapValues []map[string]interface{}) (values clause.Values) { columns := make([]string, 0, len(mapValues))
Created: Sun Apr 05 09:35:12 GMT 2026 - Last Modified: Thu Apr 14 12:32:57 GMT 2022 - 3.7K bytes - Click Count (0) -
utils/tests/utils.go
t.Errorf("%v: expect: %+v, got %+v", utils.FileWithLineNum(), expect, got) return } if reflect.ValueOf(got).Kind() == reflect.Slice { if reflect.ValueOf(expect).Kind() == reflect.Slice { if reflect.ValueOf(got).Len() == reflect.ValueOf(expect).Len() { for i := 0; i < reflect.ValueOf(got).Len(); i++ { name := fmt.Sprintf(reflect.ValueOf(got).Type().Name()+" #%v", i)
Created: Sun Apr 05 09:35:12 GMT 2026 - Last Modified: Fri Mar 10 09:21:56 GMT 2023 - 3.9K bytes - Click Count (0) -
docs/debugging/hash-set/main.go
} // hashOrder - hashes input key to return consistent // hashed integer slice. Returned integer order is salted // with an input key. This results in consistent order. // NOTE: collisions are fine, we are not looking for uniqueness // in the slices returned. func hashOrder(key string, cardinality int) []int { if cardinality <= 0 { // Returns an empty int slice for cardinality < 0. return nil } nums := make([]int, cardinality)
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Mon Sep 19 18:05:16 GMT 2022 - 3.7K bytes - Click Count (0) -
src/main/webapp/css/admin/html5shiv.min.js
eElement;h.shivMethods&&("+d().join().replace(/[\w\-:]+/g,function(a){return b.createElem(a),b.frag.createElement(a),'c("'+a+'")'})+");return n}")(t,b.frag)}function j(a){a||(a=b);var d=f(a);return!t.shivCSS||k||d.hasCSS||(d.hasCSS=!!c(a,"article,aside,dialog,figcaption,figure,footer,header,hgroup,main,nav,section{display:block}mark{background:#FF0;color:#000}template{display:none}")),l||i(a,d),a}var k,l,m="3.7.3",n=a.html5||{},o=/^<|^(?:button|map|select|textarea|object|iframe|option|optgroup)$...
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sun Dec 31 23:16:54 GMT 2017 - 2.7K bytes - Click Count (0)