Search Options

Results per page
Sort
Preferred Languages
Advance

Results 891 - 900 of 1,042 for replaced (0.1 sec)

  1. android/guava/src/com/google/common/net/InternetDomainName.java

       * ("Internationalizing Domain Names in Applications") is skipped, while validation against <a
       * href="http://www.ietf.org/rfc/rfc1035.txt">RFC 1035</a> is relaxed in the following ways:
       *
       * <ul>
       *   <li>Any part containing non-ASCII characters is considered valid.
       *   <li>Underscores ('_') are permitted wherever dashes ('-') are permitted.
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Feb 05 20:47:23 UTC 2024
    - 28K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/collect/Multiset.java

     * a specific value. These modification operations are optional, but implementations which support
     * the standard collection operations {@link #add(Object)} or {@link #remove(Object)} are encouraged
     * to implement the related methods as well. Finally, two collection views are provided: {@link
     * #elementSet} contains the distinct elements of the multiset "with duplicates collapsed", and
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Jun 17 14:40:53 UTC 2023
    - 19.7K bytes
    - Viewed (0)
  3. cmd/bucket-replication-utils.go

    	userDefined := cloneMSS(oi.UserDefined)
    	if rcfg.Config != nil && rcfg.Config.RoleArn != "" {
    		// For backward compatibility of objects pending/failed replication.
    		// Save replication related statuses in the new internal representation for
    		// compatible behavior.
    		if !oi.ReplicationStatus.Empty() {
    			oi.ReplicationStatusInternal = fmt.Sprintf("%s=%s;", rcfg.Config.RoleArn, oi.ReplicationStatus)
    		}
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Jun 10 15:31:51 UTC 2024
    - 26.3K bytes
    - Viewed (0)
  4. src/archive/zip/zip_test.go

    	return last.off + last.n
    }
    
    func (r *rleBuffer) Write(p []byte) (n int, err error) {
    	var rp *repeatedByte
    	if len(r.buf) > 0 {
    		rp = &r.buf[len(r.buf)-1]
    		// Fast path, if p is entirely the same byte repeated.
    		if lastByte := rp.b; len(p) > 0 && p[0] == lastByte {
    			if bytes.Count(p, []byte{lastByte}) == len(p) {
    				rp.n += int64(len(p))
    				return len(p), nil
    			}
    		}
    	}
    
    	for _, b := range p {
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu May 23 01:00:11 UTC 2024
    - 19.6K bytes
    - Viewed (0)
  5. src/main/java/jcifs/smb1/smb1/SmbFile.java

                        unc = "\\";
                    } else {
                        share = canon.substring( 1, i );
                        unc = canon.substring( i, out[o] == '/' ? o : o + 1 );
                        unc = unc.replace( '/', '\\' );
                    }
                } else {
                    share = null;
                    unc = "\\";
                }
            }
            return unc;
        }
    /**
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Mon Mar 13 12:00:57 UTC 2023
    - 107.9K bytes
    - Viewed (0)
  6. cmd/xl-storage.go

    		// upload to copy back its data from the remote tier. This
    		// doesn't replace the existing version, so we don't need to add
    		// a free-version.
    		xlMeta.AddFreeVersion(fi)
    	}
    
    	// indicates if RenameData() is called by healing.
    	healing := fi.Healing()
    
    	// Replace the data of null version or any other existing version-id
    	_, ver, err := xlMeta.findVersionStr(reqVID)
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Sat Oct 26 09:58:27 UTC 2024
    - 91.3K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/primitives/ImmutableDoubleArray.java

       * ImmutableList.copyOf} and use that list instead.
       */
      public List<Double> asList() {
        /*
         * Typically we cache this kind of thing, but much repeated use of this view is a performance
         * anti-pattern anyway. If we cache, then everyone pays a price in memory footprint even if
         * they never use this method.
         */
        return new AsList(this);
      }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 25 18:05:56 UTC 2024
    - 23K bytes
    - Viewed (0)
  8. src/main/webapp/js/admin/popper.min.js.map

    Popper.Utils\n * @argument {String} placement\n * @returns {String} flipped placement\n */\nexport default function getOppositePlacement(placement) {\n  const hash = { left: 'right', right: 'left', bottom: 'top', top: 'bottom' };\n  return placement.replace(/left|right|bottom|top/g, matched => hash[matched]);\n}\n","import getOuterSizes from './getOuterSizes';\nimport getOppositePlacement from './getOppositePlacement';\n\n/**\n * Get offsets to the popper\n * @method\n * @memberof Popper.Utils\n * @param...
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 120.9K bytes
    - Viewed (0)
  9. docs/en/docs/alternatives.md

    I was never able to use it in a full project, as it didn't have security integration, so, I couldn't replace all the features I was having with the full-stack generators based on Flask-apispec. I had in my backlog of projects to create a pull request adding that functionality.
    
    But then, the project's focus shifted.
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 20 19:20:23 UTC 2024
    - 23.2K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/primitives/Doubles.java

        String completeHex = "0[xX]" + hex + "[pP][+-]?\\d+#[fFdD]?";
        String fpPattern = "[+-]?(?:NaN|Infinity|" + completeDec + "|" + completeHex + ")";
        fpPattern =
            fpPattern.replace(
                "#",
                "+"
                );
        return
        java.util.regex.Pattern
            .compile(fpPattern);
      }
    
      /**
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 25 18:05:56 UTC 2024
    - 28.1K bytes
    - Viewed (0)
Back to top