Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 23 for frac (0.02 seconds)

  1. android/guava/src/com/google/common/math/Quantiles.java

     * (unless there are {@link Double#NaN NaN} values, see below); otherwise, the result is the average
     * of the values which would appear at the indexes floor(x) and ceil(x) weighted by (1-frac(x)) and
     * frac(x) respectively. This is the same definition as used by Excel and by S, it is the Type 7
     * definition in <a
     * href="http://stat.ethz.ch/R-manual/R-devel/library/stats/html/quantile.html">R</a>, and it is
     * described by <a
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 30.1K bytes
    - Click Count (0)
  2. android/guava-tests/test/com/google/common/collect/EnumHashBiMapTest.java

        assertEquals("dollar", bimap2.get(Currency.DOLLAR));
        assertEquals(bimap1, bimap2);
        bimap2.inverse().put("franc", Currency.FRANC);
        assertEquals("franc", bimap2.get(Currency.FRANC));
        assertThat(bimap1.get(Currency.FRANC)).isNull();
        assertFalse(bimap2.equals(bimap1));
    
        /* Test that it can be empty. */
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Oct 28 16:03:47 GMT 2025
    - 8.4K bytes
    - Click Count (0)
  3. guava-tests/test/com/google/common/collect/EnumBiMapTest.java

        assertEquals(Country.CANADA, bimap2.get(Currency.DOLLAR));
        assertEquals(bimap1, bimap2);
        bimap2.inverse().put(Country.SWITZERLAND, Currency.FRANC);
        assertEquals(Country.SWITZERLAND, bimap2.get(Currency.FRANC));
        assertThat(bimap1.get(Currency.FRANC)).isNull();
        assertFalse(bimap2.equals(bimap1));
    
        /* Test that it can be empty. */
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Oct 28 16:03:47 GMT 2025
    - 11.9K bytes
    - Click Count (0)
  4. src/bytes/iter.go

    				if !yield(s[:size:size]) {
    					return
    				}
    				s = s[size:]
    			}
    			return
    		}
    		for {
    			i := Index(s, sep)
    			if i < 0 {
    				break
    			}
    			frag := s[:i+sepSave]
    			if !yield(frag[:len(frag):len(frag)]) {
    				return
    			}
    			s = s[i+len(sep):]
    		}
    		yield(s[:len(s):len(s)])
    	}
    }
    
    // SplitSeq returns an iterator over all subslices of s separated by sep.
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Wed Sep 03 14:04:47 GMT 2025
    - 3.6K bytes
    - Click Count (0)
  5. guava-tests/test/com/google/common/base/FinalizableReferenceQueueClassLoaderUnloadingTest.java

        // rather than delegating to a parent ClassLoader. If this assumption is violated the test will
        // fail and will need to be rewritten.
    
        Class<?> frqC = FinalizableReferenceQueue.class;
        Class<?> sepFrqC = sepLoader.loadClass(frqC.getName());
        assertThat(frqC).isNotSameInstanceAs(sepFrqC);
        // Check the assumptions above.
    
        // FRQ tries to load the Finalizer class (for the reference-collecting thread) in a few ways.
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue May 13 18:46:00 GMT 2025
    - 7.6K bytes
    - Click Count (0)
  6. docs/tr/docs/alternatives.md

    ## Giriş
    
    Başkalarının daha önceki çalışmaları olmasaydı, **FastAPI** var olmazdı.
    
    Geçmişte oluşturulan pek çok araç **FastAPI**'a ilham kaynağı olmuştur.
    
    Yıllardır yeni bir framework oluşturmaktan kaçınıyordum. Başlangıçta **FastAPI**'ın çözdüğü sorunları çözebilmek için pek çok farklı framework, <abbr title="Eklenti: Plug-In">eklenti</abbr> ve araç kullanmayı denedim.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sat Oct 11 17:48:49 GMT 2025
    - 28.7K bytes
    - Click Count (0)
  7. src/main/java/jcifs/smb1/dcerpc/DcerpcPipeHandle.java

            if (isStart && !isDirect) { // start of new frag, do trans
                off = in.read(buf, 0, 1024);
            } else {
                off = in.readDirect(buf, 0, buf.length);
            }
    
            if (buf[0] != 5 && buf[1] != 0) {
                throw new IOException("Unexpected DCERPC PDU header");
            }
    
            flags = buf[3] & 0xFF;
            // next read is start of new frag
    Created: Sat Dec 20 13:44:44 GMT 2025
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 4.5K bytes
    - Click Count (0)
  8. src/bufio/bufio.go

    	var frag []byte
    	// Use ReadSlice to look for delim, accumulating full buffers.
    	for {
    		var e error
    		frag, e = b.ReadSlice(delim)
    		if e == nil { // got final fragment
    			break
    		}
    		if e != ErrBufferFull { // unexpected error
    			err = e
    			break
    		}
    
    		// Make a copy of the buffer.
    		buf := bytes.Clone(frag)
    		fullBuffers = append(fullBuffers, buf)
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Wed Sep 03 14:04:47 GMT 2025
    - 22K bytes
    - Click Count (0)
  9. docs/tr/docs/history-design-future.md

    Başkalarının daha önceki çalışmaları olmasaydı, **FastAPI** var olmazdı.
    
    Geçmişte oluşturulan pek çok araç **FastAPI**'a ilham kaynağı olmuştur.
    
    Yıllardır yeni bir framework oluşturmaktan kaçınıyordum. Başlangıçta **FastAPI**'ın çözdüğü sorunları çözebilmek için pek çok farklı framework, <abbr title="Eklenti: Plug-In">eklenti</abbr> ve araç kullanmayı denedim.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sat Oct 11 17:48:49 GMT 2025
    - 4.7K bytes
    - Click Count (0)
  10. src/test/java/jcifs/smb/HandlerTest.java

            // Arrange & Act
            Handler handler = newHandler();
            URL url = new URL(null, "smb://server/share#frag", handler);
    
            // Assert: ref is moved into path by Handler.parseURL
            assertNull(url.getRef(), "Ref must be cleared by Handler");
            assertTrue(url.getPath().endsWith("/share#frag"), "Path must contain the fragment suffix");
    Created: Sat Dec 20 13:44:44 GMT 2025
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 7.8K bytes
    - Click Count (0)
Back to Top