Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for mech (0.07 sec)

  1. docs/en/data/github_sponsors.yml

        url: https://github.com/andreagrandi
      - login: roboman-tech
        avatarUrl: https://avatars.githubusercontent.com/u/8183070?u=fdeaa2ed29f598eb7901693884c0ad32b16982e3&v=4
        url: https://github.com/roboman-tech
      - login: msserpa
        avatarUrl: https://avatars.githubusercontent.com/u/6334934?u=82c4489eb1559d88d2990d60001901b14f722bbb&v=4
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Fri Sep 05 08:58:22 UTC 2025
    - 21.3K bytes
    - Viewed (0)
  2. guava-gwt/pom.xml

      <artifactId>guava-gwt</artifactId>
      <name>Guava GWT compatible libs</name>
      <description>
        Guava is a suite of core and expanded libraries that include
        utility classes, Google's collections, I/O classes, and
        much more.
    
        This project includes GWT-friendly sources.
      </description>
      <properties>
        <gwt.version>2.12.2</gwt.version>
        <gwt.plugin.version>2.10.0</gwt.plugin.version>
        <gwt.logLevel>WARN</gwt.logLevel>
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Sep 04 21:35:58 UTC 2025
    - 19.4K bytes
    - Viewed (0)
  3. src/bufio/bufio.go

    		b.r = 0
    		b.w = 0
    		n, b.err = b.rd.Read(b.buf)
    		if n < 0 {
    			panic(errNegativeRead)
    		}
    		if n == 0 {
    			return 0, b.readErr()
    		}
    		b.w += n
    	}
    
    	// copy as much as we can
    	// Note: if the slice panics here, it is probably because
    	// the underlying reader returned a bad count. See issue 49795.
    	n = copy(p, b.buf[b.r:b.w])
    	b.r += n
    	b.lastByte = int(b.buf[b.r-1])
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Sep 03 14:04:47 UTC 2025
    - 22K bytes
    - Viewed (0)
  4. src/bytes/bytes.go

    			// the cutover is about 16 byte skips.
    			// TODO: if large prefixes of sep are matching
    			// we should cutover at even larger average skips,
    			// because Equal becomes that much more expensive.
    			// This code does not take that effect into account.
    			j := bytealg.IndexRabinKarp(s[i:], sep)
    			if j < 0 {
    				return -1
    			}
    			return i + j
    		}
    	}
    	return -1
    }
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Sep 03 14:04:47 UTC 2025
    - 35.5K bytes
    - Viewed (0)
Back to top