Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 58 for Recycle (0.04 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. src/main/webapp/WEB-INF/view/admin/design/admin_design.jsp

                                                name="editAsUseDefault"
                                                value="<la:message key="labels.design_use_default_button" />">
                                            <i class="fa fa-recycle" aria-hidden="true"></i>
                                            <la:message key="labels.design_use_default_button"/>
                                        </button>
                                    </div>
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Mon Feb 23 08:03:44 GMT 2026
    - 11.2K bytes
    - Click Count (0)
  2. cmd/storage-datatypes.go

    	buf := grid.GetByteBufferCap(32 + 16<<10)
    	return &RenameDataInlineHandlerParams{RenameDataHandlerParams{FI: FileInfo{Data: buf[:0]}}}
    }
    
    // Recycle will reuse the memory allocated for the FileInfo data.
    func (r *RenameDataInlineHandlerParams) Recycle() {
    	if r == nil {
    		return
    	}
    	if cap(r.FI.Data) >= xioutil.SmallBlock {
    		grid.PutByteBuffer(r.FI.Data)
    		r.FI.Data = nil
    	}
    }
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 17.4K bytes
    - Click Count (0)
  3. internal/grid/handlers.go

    	recycleResp func(Resp)
    }
    
    func recycleFunc[RT RoundTripper](newRT func() RT) (newFn func() RT, recycle func(r RT)) {
    	rAny := any(newRT())
    	var rZero RT
    	if _, ok := rAny.(Recycler); ok {
    		return newRT, func(r RT) {
    			if r != rZero {
    				if rc, ok := any(r).(Recycler); ok {
    					rc.Recycle()
    				}
    			}
    		}
    	}
    	pool := bpool.Pool[RT]{
    		New: func() RT {
    			return newRT()
    		},
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Feb 18 16:25:55 GMT 2025
    - 27.7K bytes
    - Click Count (0)
  4. cmd/peer-s3-client.go

    	}
    	buckets := make([]BucketInfo, 0, len(bi.Value()))
    	for _, b := range bi.Value() {
    		if b != nil {
    			buckets = append(buckets, *b)
    		}
    	}
    	bi.Recycle() // BucketInfo has no internal pointers, so it's safe to recycle.
    	return buckets, nil
    }
    
    func (client *remotePeerS3Client) HealBucket(ctx context.Context, bucket string, opts madmin.HealOpts) (madmin.HealResultItem, error) {
    	conn := client.gridConn()
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 15.6K bytes
    - Click Count (0)
  5. cmd/peer-rest-client.go

    	if err != nil {
    		return
    	}
    	st.Results(func(b []byte) error {
    		select {
    		case traceCh <- b:
    		default:
    			// Do not block on slow receivers.
    			// Just recycle the buffer.
    			grid.PutByteBuffer(b)
    		}
    		return nil
    	})
    }
    
    func (client *peerRESTClient) doListen(ctx context.Context, listenCh chan<- []byte, v url.Values) {
    	conn := client.gridConn()
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 26.1K bytes
    - Click Count (0)
  6. internal/grid/grid_test.go

    		maps.Copy((*resp), *req)
    		return resp, nil
    	}
    	// Return error
    	h2 := NewSingleHandler[*MSS, *MSS](handlerTest2, NewMSS, NewMSS)
    	handler2 := func(req *MSS) (resp *MSS, err *RemoteErr) {
    		defer req.Recycle()
    		r := RemoteErr(req.Get("err"))
    		return nil, &r
    	}
    	errFatal(h1.Register(local, handler1))
    	errFatal(h2.Register(local, handler2))
    
    	errFatal(h1.Register(remote, handler1))
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 36.1K bytes
    - Click Count (0)
  7. cmd/storage-rest-server.go

    }
    
    // RenameDataInlineHandler - renames a meta object and data dir to destination.
    func (s *storageRESTServer) RenameDataInlineHandler(p *RenameDataInlineHandlerParams) (*RenameDataResp, *grid.RemoteErr) {
    	defer p.Recycle()
    	return s.RenameDataHandler(&p.RenameDataHandlerParams)
    }
    
    // RenameFileHandler - rename a file from source to destination
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue May 27 15:19:03 GMT 2025
    - 45.7K bytes
    - Click Count (0)
  8. cmd/data-scanner.go

    	minSleep time.Duration
    
    	// cycle will be closed
    	cycle chan struct{}
    
    	// isScanner should be set when this is used by the scanner
    	// to record metrics.
    	isScanner bool
    }
    
    // newDynamicSleeper
    func newDynamicSleeper(factor float64, maxWait time.Duration, isScanner bool) *dynamicSleeper {
    	return &dynamicSleeper{
    		factor:    factor,
    		cycle:     make(chan struct{}),
    		maxSleep:  maxWait,
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 45.5K bytes
    - Click Count (0)
  9. build-logic-commons/code-quality-rules/src/main/resources/classycle/classycle_report_resources.zip

    of classes Classes of layer : Classes and Packages Click on or to go to the cycle to which the class/package belongs. Class/Package Size Used by Uses internal Uses external Layer Source(s) # Member of cycle Classes using : uses: true uses: Packages using : uses: true uses: Classes of cycle : Best fragmenter(s) of cycle : Center classes of cycle : Packages of cycle : Best fragmenter(s) of cycle : Center packages of cycle : cursor:pointer; javascript:showTable(" ",""," ; ") cursor:pointer; javascript:showTable("...
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Wed Dec 09 08:14:05 GMT 2020
    - 23.4K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/graph/Graphs.java

      // Graph query methods
    
      /**
       * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset
       * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting
       * and ending with the same node.
       *
       * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1).
       */
      public static <N> boolean hasCycle(Graph<N> graph) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 24.4K bytes
    - Click Count (0)
Back to Top