Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 47 for davmount (0.16 seconds)

  1. src/cmd/asm/internal/asm/testdata/arm64error.s

    	MOVWU	(R5)(R4.UXTW<<3), R10                            // ERROR "invalid index shift amount"
    	MOVWU	(R5)(R4<<1), R10                                 // ERROR "invalid index shift amount"
    	MOVB	(R5)(R4.SXTW<<5), R10                            // ERROR "invalid index shift amount"
    	MOVH	R5, (R6)(R2<<3)                                  // ERROR "invalid index shift amount"
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Oct 14 19:00:00 GMT 2025
    - 38.4K bytes
    - Click Count (0)
  2. src/main/java/org/codelibs/core/io/CopyUtil.java

                final byte[] buf = buffer.array();
                int len;
                int amount = 0;
                while ((len = ChannelUtil.read(channel, buffer, amount)) != -1) {
                    out.write(buf, 0, len);
                    buffer.clear();
                    amount += len;
                }
                out.flush();
                return amount;
            } catch (final IOException e) {
                throw new IORuntimeException(e);
    Created: Sat Dec 20 08:55:33 GMT 2025
    - Last Modified: Thu Jul 31 08:16:49 GMT 2025
    - 45.2K bytes
    - Click Count (0)
  3. src/main/java/jcifs/internal/smb2/rdma/disni/DisniRdmaConnection.java

            }
    
            try {
                // In real implementation, this would perform RDMA read into the buffer
                // For skeleton implementation, simulate reading the requested amount
                int bytesToRead = Math.min(length, buffer.remaining());
    
                // Simulate RDMA read operation
    Created: Sat Dec 20 13:44:44 GMT 2025
    - Last Modified: Sat Aug 23 05:11:12 GMT 2025
    - 10.2K bytes
    - Click Count (0)
  4. docs/en/docs/deployment/concepts.md

    And multiple processes normally **don't share any memory**. This means that each running process has its own things, variables, and memory. And if you are consuming a large amount of memory in your code, **each process** will consume an equivalent amount of memory.
    
    ### Server Memory { #server-memory }
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sun Aug 31 09:15:41 GMT 2025
    - 18.6K bytes
    - Click Count (1)
  5. src/main/java/org/codelibs/fess/helper/IntervalControlHelper.java

            this.crawlerRunning = crawlerRunning;
        }
    
        /**
         * Represents a rule for controlling crawler intervals.
         * Each rule defines a time range, applicable days, and delay amount.
         */
        public static class IntervalRule {
            /** Starting hour of the interval */
            protected int fromHours;
    
            /** Starting minute of the interval */
            protected int fromMinutes;
    Created: Sat Dec 20 09:19:18 GMT 2025
    - Last Modified: Sun Nov 23 12:34:02 GMT 2025
    - 10K bytes
    - Click Count (0)
  6. docs/en/docs/deployment/docker.md

    you will have a more or less well-defined, stable, and limited amount of memory consumed by each of those containers (more than one if they are replicated).
    
    And then you can set those same memory limits and requirements in your configurations for your container management system (for example in **Kubernetes**). That way it will be able to **replicate the containers** in the **available machines** taking into account the amount of memory needed by them, and the amount available in the machines...
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sat Sep 20 12:58:04 GMT 2025
    - 29.5K bytes
    - Click Count (1)
  7. src/cmd/asm/internal/asm/parse.go

    		tok := p.next()
    		ext = tok.String()
    	}
    	if p.peek() == lex.LSH {
    		// parses left shift amount applied after extension: <<Amount
    		p.get(lex.LSH)
    		tok := p.get(scanner.Int)
    		amount, err := strconv.ParseInt(tok.String(), 10, 16)
    		if err != nil {
    			p.errorf("parsing left shift amount: %s", err)
    		}
    		num = int16(amount)
    	} else if p.peek() == '[' {
    		// parses an element: [Index]
    		p.get('[')
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Wed Nov 12 03:59:40 GMT 2025
    - 37.3K bytes
    - Click Count (0)
  8. guava-tests/test/com/google/common/util/concurrent/TestThread.java

      }
    
      /**
       * Sends the given method call to this thread.
       *
       * @throws TimeoutException if this thread does not accept the request within a reasonable amount
       *     of time
       */
      private void sendRequest(String methodName, Object... arguments) throws Exception {
        if (!requestQueue.offer(new Request(methodName, arguments), TIMEOUT_MILLIS, MILLISECONDS)) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 11 21:00:51 GMT 2025
    - 11.4K bytes
    - Click Count (0)
  9. guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java

       * "expected arrival time of the next request" is actually in the past, then the difference (now -
       * past) is the amount of time that the RateLimiter was formally unused, and it is that amount of
       * time which we translate to storedPermits. (We increase storedPermits with the amount of permits
       * that would have been produced in that idle time). So, if rate == 1 permit per second, and
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Wed May 14 19:40:47 GMT 2025
    - 19.3K bytes
    - Click Count (0)
  10. android/guava-tests/test/com/google/common/util/concurrent/TestThread.java

      }
    
      /**
       * Sends the given method call to this thread.
       *
       * @throws TimeoutException if this thread does not accept the request within a reasonable amount
       *     of time
       */
      private void sendRequest(String methodName, Object... arguments) throws Exception {
        if (!requestQueue.offer(new Request(methodName, arguments), TIMEOUT_MILLIS, MILLISECONDS)) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 11 21:00:51 GMT 2025
    - 11.4K bytes
    - Click Count (0)
Back to Top