Search Options

Results per page
Sort
Preferred Languages
Advance

Results 181 - 190 of 761 for fake (0.06 sec)

  1. internal/s3select/csv/reader.go

    	}
    
    	// Create queue
    	r.queue = make(chan *queueItem, runtime.GOMAXPROCS(0))
    	r.input = make(chan *queueItem, runtime.GOMAXPROCS(0))
    	r.readerWg.Add(1)
    
    	// Start splitter
    	go func() {
    		defer close(r.input)
    		defer close(r.queue)
    		defer r.readerWg.Done()
    		for {
    			q := queueItem{
    				input: next,
    				dst:   make(chan [][]string, 1),
    				err:   nextErr,
    			}
    			select {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Feb 22 06:26:06 UTC 2024
    - 8.9K bytes
    - Viewed (0)
  2. cmd/peer-s3-server.go

    	globalLocalDrivesMu.RUnlock()
    
    	// Initialize sync waitgroup.
    	g := errgroup.WithNErrs(len(localDrives))
    
    	// Disk states slices
    	beforeState := make([]string, len(localDrives))
    	afterState := make([]string, len(localDrives))
    
    	// Make a volume entry on all underlying storage disks.
    	for index := range localDrives {
    		index := index
    		g.Go(func() (serr error) {
    			if localDrives[index] == nil {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Aug 22 21:57:20 UTC 2024
    - 8.1K bytes
    - Viewed (0)
  3. clause/set.go

    func (set Set) MergeClause(clause *Clause) {
    	copiedAssignments := make([]Assignment, len(set))
    	copy(copiedAssignments, set)
    	clause.Expression = Set(copiedAssignments)
    }
    
    func Assignments(values map[string]interface{}) Set {
    	keys := make([]string, 0, len(values))
    	for key := range values {
    		keys = append(keys, key)
    	}
    	sort.Strings(keys)
    
    	assignments := make([]Assignment, len(keys))
    	for idx, key := range keys {
    Registered: Sun Nov 03 09:35:10 UTC 2024
    - Last Modified: Mon Nov 29 03:02:44 UTC 2021
    - 1.4K bytes
    - Viewed (0)
  4. src/main/webapp/js/admin/adminlte.min.js

    data-type="only-this"><i class="fas fa-times"></i></a><a class="nav-link" data-toggle="row" id="'+s+'" href="#'+l+'" role="tab" aria-controls="'+l+'" aria-selected="false">'+e+"</a></li>";n.default(me).append(unescape(escape(r)));var d='<div class="tab-pane fade" id="'+l+'" role="tabpanel" aria-labelledby="'+s+'"><iframe src="'+t+'"></iframe></div>';if(n.default(be).append(unescape(escape(d))),i)if(this._config.loadingScreen){var f=n.default(Ce);f.fadeIn(),n.default(l+" iframe").ready((function(){"number"==typeof...
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 45.3K bytes
    - Viewed (0)
  5. src/main/webapp/css/font-awesome.min.css

    "}.sr-only{border:0;clip:rect(0,0,0,0);height:1px;margin:-1px;overflow:hidden;padding:0;position:absolute;width:1px}.sr-only-focusable:active,.sr-only-focusable:focus{clip:auto;height:auto;margin:0;overflow:visible;position:static;width:auto}@font-face{font-family:"Font Awesome 5 Brands";font-style:normal;font-weight:normal;font-display:auto;src:url(./fonts/fa-brands-400.eot);src:url(./fonts/fa-brands-400.eot?#iefix) format("embedded-opentype"),url(./fonts/fa-brands-400.woff2) format("woff2"),ur...
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Dec 14 21:22:25 UTC 2019
    - 55.8K bytes
    - Viewed (1)
  6. cmd/erasure-metadata_test.go

    			}
    		}
    		return fis
    	}
    
    	commonSuccModTime := time.Date(2023, time.August, 25, 0, 0, 0, 0, time.UTC)
    	succModTimesInQuorum := make([]time.Time, 16)
    	succModTimesNoQuorum := make([]time.Time, 16)
    	commonNumVersions := 2
    	numVersionsInQuorum := make([]int, 16)
    	numVersionsNoQuorum := make([]int, 16)
    	for i := 0; i < 16; i++ {
    		if i < 4 {
    			continue
    		}
    		succModTimesInQuorum[i] = commonSuccModTime
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Jul 25 21:02:50 UTC 2024
    - 13.5K bytes
    - Viewed (0)
  7. cmd/xl-storage-meta-inline.go

    func (x *xlMetaInlineData) remove(keys ...string) bool {
    	in := x.afterVersion()
    	sz, buf, _ := msgp.ReadMapHeaderBytes(in)
    	newKeys := make([][]byte, 0, sz)
    	newVals := make([][]byte, 0, sz)
    	var removeKey func(s []byte) bool
    
    	// Copy if big number of compares...
    	if len(keys) > 5 && sz > 5 {
    		mKeys := make(map[string]struct{}, len(keys))
    		for _, key := range keys {
    			mKeys[key] = struct{}{}
    		}
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Apr 04 12:04:40 UTC 2024
    - 9.5K bytes
    - Viewed (0)
  8. docs/en/docs/release-notes.md

    A command line tool that will **process your code** and update most of the things **automatically** for you. Make sure you have your code in git first, and review each of the changes to make sure everything is correct before committing the changes.
    
    ### Pydantic v1
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Fri Nov 01 11:25:57 UTC 2024
    - 460.3K bytes
    - Viewed (0)
  9. internal/bpool/bpool_test.go

    	bp.Put(make([]byte, bp.w, bp.wcap-1)) // wrong capacity is rejected (less)
    	bp.Put(make([]byte, bp.w, bp.wcap+1)) // wrong capacity is rejected (more)
    	bp.Put(make([]byte, width))           // wrong capacity is rejected (very less)
    	if len(bp.c) > 0 {
    		t.Fatal("bytepool should have rejected invalid packets")
    	}
    
    	// Try putting a short slice into pool
    	bp.Put(make([]byte, bp.w, bp.wcap)[:2])
    	if len(bp.c) != 1 {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Aug 29 01:40:52 UTC 2024
    - 2.8K bytes
    - Viewed (0)
  10. callbacks/query.go

    				clauseSelect.Columns = make([]clause.Column, len(db.Statement.Schema.DBNames))
    				for idx, dbName := range db.Statement.Schema.DBNames {
    					clauseSelect.Columns[idx] = clause.Column{Table: db.Statement.Table, Name: dbName}
    				}
    			}
    
    			specifiedRelationsName := make(map[string]interface{})
    			for _, join := range db.Statement.Joins {
    Registered: Sun Nov 03 09:35:10 UTC 2024
    - Last Modified: Thu Aug 22 11:03:42 UTC 2024
    - 10.1K bytes
    - Viewed (1)
Back to top