Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 305 for inmemory (0.09 seconds)

  1. cmd/batch-job-common-types_gen.go

    					return
    				}
    			}
    		case "InMemory":
    			if dc.IsNil() {
    				err = dc.ReadNil()
    				if err != nil {
    					err = msgp.WrapError(err, "InMemory")
    					return
    				}
    				z.InMemory = nil
    			} else {
    				if z.InMemory == nil {
    					z.InMemory = new(bool)
    				}
    				*z.InMemory, err = dc.ReadBool()
    				if err != nil {
    					err = msgp.WrapError(err, "InMemory")
    					return
    				}
    			}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 21.9K bytes
    - Click Count (0)
  2. src/test/java/org/codelibs/curl/io/ContentOutputStreamTest.java

            ContentOutputStream cos = new ContentOutputStream(10, Curl.tmpDir);
            cos.write(new byte[] { 0, 1, 2 });
            assertTrue(cos.isInMemory());
            cos.write(new byte[] { 3, 4 });
            assertTrue(cos.isInMemory());
            cos.write(new byte[] { 5 });
            assertTrue(cos.isInMemory());
            assertFalse(cos.done);
            cos.close();
        }
    
        @Test
    Created: Thu Apr 02 15:34:12 GMT 2026
    - Last Modified: Sat Mar 21 12:00:34 GMT 2026
    - 11.7K bytes
    - Click Count (0)
  3. src/test/java/org/codelibs/curl/io/ContentCacheTest.java

            }
        }
    
        // --- isInMemory() tests ---
    
        @Test
        public void testIsInMemory_WithByteArray() {
            // ## Arrange ##
            ContentCache cache = new ContentCache("test".getBytes());
    
            // ## Assert ##
            assertTrue(cache.isInMemory());
        }
    
        @Test
        public void testIsInMemory_WithFile() throws IOException {
    Created: Thu Apr 02 15:34:12 GMT 2026
    - Last Modified: Sat Mar 21 09:11:12 GMT 2026
    - 15.9K bytes
    - Click Count (0)
  4. src/main/java/org/codelibs/curl/CurlRequest.java

                    }
                    dfos.flush();
                    final ContentCache contentCache;
                    logger.fine(() -> "Response in " + (dfos.isInMemory() ? "Memory" : "File"));
                    if (dfos.isInMemory()) {
                        contentCache = new ContentCache(dfos.getData());
                    } else {
                        contentCache = new ContentCache(dfos.getFile());
                    }
    Created: Thu Apr 02 15:34:12 GMT 2026
    - Last Modified: Sat Mar 21 09:11:12 GMT 2026
    - 19.7K bytes
    - Click Count (0)
  5. src/main/java/org/codelibs/fess/app/web/api/admin/stats/ApiAdminStatsAction.java

            public long used;
            /** Committed non-heap memory in bytes */
            public long committed;
            /** Maximum non-heap memory in bytes */
            public long max;
            /** The percentage of non-heap memory usage. */
            public short percent;
        }
    
        /**
         * Data transfer object representing JVM buffer pool statistics.
         */
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Thu Jul 17 08:28:31 GMT 2025
    - 19.7K bytes
    - Click Count (0)
  6. docs/smb3-features/05-rdma-smb-direct-design.md

    ## 1. Overview
    
    SMB Direct enables high-performance data transfer using Remote Direct Memory Access (RDMA) technology. This provides ultra-low latency and high bandwidth data transfer by bypassing the traditional TCP/IP stack and allowing direct memory-to-memory transfers between client and server.
    
    ## 2. Protocol Specification Reference
    
    - **MS-SMBD**: SMB2 Remote Direct Memory Access (RDMA) Transport Protocol
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 02:53:50 GMT 2025
    - 35.9K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/io/FileBackedOutputStream.java

            // requireNonNull is safe because we always have either `file` or `memory`.
            requireNonNull(memory);
            return new ByteArrayInputStream(memory.getBuffer(), 0, memory.getCount());
          }
        }
    
        synchronized void reset() throws IOException {
          try {
            close();
          } finally {
            if (memory == null) {
              memory = new MemoryOutput();
            } else {
              memory.reset();
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sat Mar 07 17:30:49 GMT 2026
    - 12.4K bytes
    - Click Count (0)
  8. doc/go_mem.html

    <p>
    Go approaches its memory model in much the same way as the rest of the language,
    aiming to keep the semantics simple, understandable, and useful.
    This section gives a general overview of the approach and should suffice for most programmers.
    The memory model is specified more formally in the next section.
    </p>
    
    <p>
    A data race is defined as
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Tue Aug 05 15:41:37 GMT 2025
    - 26.6K bytes
    - Click Count (0)
  9. docs/metrics/prometheus/list.md

    | `minio_node_mem_buffers_avg`   | Buffers memory on the node (avg).         |
    | `minio_node_mem_buffers_max`   | Buffers memory on the node (max).         |
    | `minio_node_mem_cache`         | Cache memory on the node.                 |
    | `minio_node_mem_cache_avg`     | Cache memory on the node (avg).           |
    | `minio_node_mem_cache_max`     | Cache memory on the node (max).           |
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 43.4K bytes
    - Click Count (0)
  10. docs/en/docs/deployment/concepts.md

    ### Memory per Process { #memory-per-process }
    
    Now, when the program loads things in memory, for example, a machine learning model in a variable, or the contents of a large file in a variable, all that **consumes a bit of the memory (RAM)** of the server.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 18.5K bytes
    - Click Count (1)
Back to Top