Search Options

Results per page
Sort
Preferred Languages
Advance

Results 701 - 710 of 1,705 for mare (0.09 sec)

  1. internal/config/lambda/event/targetidset.go

    // This program is distributed in the hope that it will be useful
    // but WITHOUT ANY WARRANTY; without even the implied warranty of
    // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    // GNU Affero General Public License for more details.
    //
    // You should have received a copy of the GNU Affero General Public License
    // along with this program.  If not, see <http://www.gnu.org/licenses/>.
    
    package event
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Jan 18 07:03:17 UTC 2024
    - 1.9K bytes
    - Viewed (0)
  2. internal/bucket/replication/and.go

    	}
    	for _, t := range a.Tags {
    		if err := t.Validate(); err != nil {
    			return err
    		}
    	}
    	return nil
    }
    
    // ContainsDuplicateTag - returns true if duplicate keys are present in And
    func (a And) ContainsDuplicateTag() bool {
    	x := make(map[string]struct{}, len(a.Tags))
    
    	for _, t := range a.Tags {
    		if _, has := x[t.Key]; has {
    			return true
    		}
    		x[t.Key] = struct{}{}
    	}
    
    	return false
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Jun 01 21:59:40 UTC 2021
    - 1.8K bytes
    - Viewed (0)
  3. cmd/metacache.go

    	metacacheBlockSize = 5000
    
    	// metacacheSharePrefix controls whether prefixes on dirty paths are always shared.
    	// This will make `test/a` and `test/b` share listings if they are concurrent.
    	// Enabling this will make cache sharing more likely and cause less IO,
    	// but may cause additional latency to some calls.
    	metacacheSharePrefix = false
    )
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Jul 12 16:23:16 UTC 2024
    - 6K bytes
    - Viewed (0)
  4. tensorflow/api_template.__init__.py

    from tensorflow.python.util.lazy_loader import KerasLazyLoader as _KerasLazyLoader
    
    # Make sure code inside the TensorFlow codebase can use tf2.enabled() at import.
    _os.environ["TF2_BEHAVIOR"] = "1"
    from tensorflow.python import tf2 as _tf2
    _tf2.enable()
    
    # API IMPORTS PLACEHOLDER
    
    # WRAPPER_PLACEHOLDER
    
    # Make sure directory containing top level submodules is in
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Wed Oct 02 22:16:02 UTC 2024
    - 6.8K bytes
    - Viewed (0)
  5. cmd/xl-storage.go

    }
    
    // checkPathLength - returns error if given path name length more than 255
    func checkPathLength(pathName string) error {
    	// Apple OS X path length is limited to 1016
    	if runtime.GOOS == "darwin" && len(pathName) > 1016 {
    		return errFileNameTooLong
    	}
    
    	// Disallow more than 1024 characters on windows, there
    	// are no known name_max limits on Windows.
    	if runtime.GOOS == "windows" && len(pathName) > 1024 {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Sat Oct 26 09:58:27 UTC 2024
    - 91.3K bytes
    - Viewed (0)
  6. docs/extensions/fan-out/README.md

    ## How to enable Fan-Out Uploads ?
    
    Fan-Out uploads are automatically enabled if `x-minio-fanout-list` form-field is provided with the PostUpload API, to keep things simple higher level APIs are provided in our SDKs for example in `minio-go` SDK:
    
    ```
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu May 25 05:51:07 UTC 2023
    - 1.4K bytes
    - Viewed (0)
  7. istioctl/pkg/analyze/analyze.go

    	for _, e := range fileExtensions {
    		if e == ext {
    			return true
    		}
    	}
    	return false
    }
    
    func AnalyzersAsString(analyzers []analysis.Analyzer) string {
    	nameToAnalyzer := make(map[string]analysis.Analyzer)
    	analyzerNames := make([]string, len(analyzers))
    	for i, a := range analyzers {
    		analyzerNames[i] = a.Metadata().Name
    		nameToAnalyzer[a.Metadata().Name] = a
    	}
    	sort.Strings(analyzerNames)
    
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Thu Oct 31 06:53:50 UTC 2024
    - 17.6K bytes
    - Viewed (0)
  8. cmd/data-usage-cache_gen.go

    		case "ts":
    			var zb0002 uint32
    			zb0002, err = dc.ReadMapHeader()
    			if err != nil {
    				err = msgp.WrapError(err, "Tiers")
    				return
    			}
    			if z.Tiers == nil {
    				z.Tiers = make(map[string]tierStats, zb0002)
    			} else if len(z.Tiers) > 0 {
    				for key := range z.Tiers {
    					delete(z.Tiers, key)
    				}
    			}
    			for zb0002 > 0 {
    				zb0002--
    				var za0001 string
    				var za0002 tierStats
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Oct 22 15:30:50 UTC 2024
    - 75K bytes
    - Viewed (0)
  9. src/bufio/bufio.go

    // ReadBytes returns err != nil if and only if the returned data does not end in
    // delim.
    // For simple uses, a Scanner may be more convenient.
    func (b *Reader) ReadBytes(delim byte) ([]byte, error) {
    	full, frag, n, err := b.collectFragments(delim)
    	// Allocate new buffer to hold the full pieces and the fragment.
    	buf := make([]byte, n)
    	n = 0
    	// Copy full pieces and fragment in.
    	for i := range full {
    		n += copy(buf[n:], full[i])
    	}
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Oct 12 14:39:08 UTC 2023
    - 21.8K bytes
    - Viewed (0)
  10. internal/kms/kms.go

    // This program is distributed in the hope that it will be useful
    // but WITHOUT ANY WARRANTY; without even the implied warranty of
    // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    // GNU Affero General Public License for more details.
    //
    // You should have received a copy of the GNU Affero General Public License
    // along with this program.  If not, see <http://www.gnu.org/licenses/>.
    
    package kms
    
    import (
    	"context"
    	"errors"
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Sun Aug 18 06:43:03 UTC 2024
    - 11.5K bytes
    - Viewed (0)
Back to top