Search Options

Results per page
Sort
Preferred Languages
Advance

Results 31 - 40 of 202 for Slice (0.01 sec)

  1. 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...
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Oct 26 01:07:52 UTC 2024
    - 85.5K bytes
    - Viewed (0)
  2. src/arena/arena.go

    //go:linkname runtime_arena_arena_New
    func runtime_arena_arena_New(arena unsafe.Pointer, typ any) any
    
    // Mark as noescape to avoid escaping the slice header.
    //
    //go:noescape
    //go:linkname runtime_arena_arena_Slice
    func runtime_arena_arena_Slice(arena unsafe.Pointer, slice any, cap int)
    
    //go:linkname runtime_arena_arena_Free
    func runtime_arena_arena_Free(arena unsafe.Pointer)
    
    //go:linkname runtime_arena_heapify
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Oct 12 20:23:36 UTC 2022
    - 4.3K bytes
    - Viewed (0)
  3. 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))
    
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Thu Apr 14 12:32:57 UTC 2022
    - 3.7K bytes
    - Viewed (0)
  4. tests/preload_test.go

    	for _, user := range users {
    		userIDs = append(userIDs, user.ID)
    	}
    
    	var users2 []User
    	DB.Preload("Account", clause.Eq{Column: "number", Value: users[0].Account.Number}).Find(&users2, "id IN ?", userIDs)
    	sort.Slice(users2, func(i, j int) bool {
    		return users2[i].ID < users2[j].ID
    	})
    
    	for idx, user := range users2[1:2] {
    		if user.Account.Number != "" {
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Wed Jun 12 10:00:47 UTC 2024
    - 15.9K bytes
    - Viewed (0)
  5. cmd/erasure-healing-common.go

    		// the etag.
    		if count >= quorum {
    			return etags
    		}
    	}
    
    	return make([]string, len(partsMetadata))
    }
    
    // Extracts list of times from FileInfo slice and returns, skips
    // slice elements which have errors.
    func listObjectModtimes(partsMetadata []FileInfo, errs []error) (modTimes []time.Time) {
    	modTimes = bootModtimes(len(partsMetadata))
    	for index, metadata := range partsMetadata {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Sun Mar 30 00:56:02 UTC 2025
    - 12K bytes
    - Viewed (0)
  6. 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)
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Fri Mar 10 09:21:56 UTC 2023
    - 3.9K bytes
    - Viewed (0)
  7. schema/schema.go

    	}
    	return fmt.Sprintf("%s.%s", schema.ModelType.PkgPath(), schema.ModelType.Name())
    }
    
    func (schema *Schema) MakeSlice() reflect.Value {
    	slice := reflect.MakeSlice(reflect.SliceOf(reflect.PointerTo(schema.ModelType)), 0, 20)
    	results := reflect.New(slice.Type())
    	results.Elem().Set(slice)
    
    	return results
    }
    
    func (schema *Schema) LookUpField(name string) *Field {
    	if field, ok := schema.FieldsByDBName[name]; ok {
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Tue Aug 19 06:35:49 UTC 2025
    - 12.9K bytes
    - Viewed (0)
  8. 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)
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Mon Sep 19 18:05:16 UTC 2022
    - 3.7K bytes
    - Viewed (0)
  9. src/main/webapp/js/admin/bootstrap.min.js

    tion(){function t(t,e){this._isTransitioning=!1,this._element=t,this._config=this._getConfig(e),this._triggerArray=[].slice.call(document.querySelectorAll('[data-toggle="collapse"][href="#'+t.id+'"],[data-toggle="collapse"][data-target="#'+t.id+'"]'));for(var n=[].slice.call(document.querySelectorAll(U)),i=0,o=n.length;i<o;i++){var a=n[i],s=d.getSelectorFromElement(a),l=[].slice.call(document.querySelectorAll(s)).filter((function(e){return e===t}));null!==s&&l.length>0&&(this._selector=s,this._t...
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 61.1K bytes
    - Viewed (0)
  10. utils/utils.go

    func JoinNestedRelationNames(relationNames []string) string {
    	return strings.Join(relationNames, nestedRelationSplit)
    }
    
    // RTrimSlice Right trims the given slice by given length
    func RTrimSlice[T any](v []T, trimLen int) []T {
    	if trimLen >= len(v) { // trimLen greater than slice len means fully sliced
    		return v[:0]
    	}
    	if trimLen < 0 { // negative trimLen is ignored
    		return v[:]
    	}
    	return v[:len(v)-trimLen]
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Thu Aug 22 11:03:42 UTC 2024
    - 4.1K bytes
    - Viewed (0)
Back to top