Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 51 - 60 of 74 for areas (0.02 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. src/test/java/jcifs/internal/smb2/nego/Smb2NegotiateRequestTest.java

            // When
            int bytesWritten = request.writeBytesWireFormat(buffer, 0);
    
            // Then
            assertTrue(bytesWritten > 0);
    
            // Verify negotiate context offset/count area is zeroed
            assertEquals(0, SMBUtil.readInt8(buffer, 28));
        }
    
        @Test
        @DisplayName("Should read empty bytes from wire format")
        void testReadBytesWireFormat() {
            // Given
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 20.7K bytes
    - Click Count (0)
  2. src/main/webapp/js/admin/popper.min.js

    op},right:{width:p.right-t.right,height:p.height},bottom:{width:p.width,height:p.bottom-t.bottom},left:{width:t.left-p.left,height:p.height}},d=Object.keys(s).map(function(e){return le({key:e},s[e],{area:x(s[e])})}).sort(function(e,t){return t.area-e.area}),a=d.filter(function(e){var t=e.width,n=e.height;return t>=o.clientWidth&&n>=o.clientHeight}),l=0<a.length?a[0].key:d[0].key,f=e.split('-')[1];return l+(f?'-'+f:'')}function L(e,t,o){var n=3<arguments.length&&void 0!==arguments[3]?arguments[3]...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Oct 26 01:49:09 GMT 2024
    - 20.7K bytes
    - Click Count (0)
  3. src/test/java/jcifs/internal/smb2/info/Smb2QueryDirectoryResponseTest.java

            SMBUtil.writeInt4(432, buffer, bufferIndex + 4); // 512 - 80
    
            response = spy(response);
            when(response.getHeaderStart()).thenReturn(0);
    
            // Fill the entire data area with zero (no valid entries)
            for (int i = dataOffset; i < 512; i++) {
                buffer[i] = 0;
            }
    
            int result = response.readBytesWireFormat(buffer, bufferIndex);
    
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 23.5K bytes
    - Click Count (0)
  4. docs/es/docs/virtual-environments.md

    ```mermaid
    flowchart LR
        stone(philosophers-stone) -->|requires| harry-1[harry v1]
    ```
    
    Luego, en algún momento después, creas otro proyecto llamado `prisoner-of-azkaban`, y este proyecto también depende de `harry`, pero este proyecto necesita **`harry` versión `3`**.
    
    ```mermaid
    flowchart LR
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:15:55 GMT 2026
    - 22.6K bytes
    - Click Count (0)
  5. src/main/webapp/js/purify.min.js

    r&&r.constructor===Object?n[o]=C(r):n[o]=r)}return n}function O(e,t){for(;null!==e;){const n=r(e,t);if(n){if(n.get)return D(n.get);if("function"==typeof n.value)return D(n.value)}e=o(e)}return function(){return null}}const v=i(["a","abbr","acronym","address","area","article","aside","audio","b","bdi","bdo","big","blink","blockquote","body","br","button","canvas","caption","center","cite","code","col","colgroup","content","data","datalist","dd","decorator","del","details","dfn","dialog","dir","div","dl","dt"...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sun Mar 15 06:21:57 GMT 2026
    - 22.7K bytes
    - Click Count (0)
  6. src/main/webapp/js/admin/popper.min.js.map

    },\n    left: {\n      width: refRect.left - boundaries.left,\n      height: boundaries.height,\n    },\n  };\n\n  const sortedAreas = Object.keys(rects)\n    .map(key => ({\n      key,\n      ...rects[key],\n      area: getArea(rects[key]),\n    }))\n    .sort((a, b) => b.area - a.area);\n\n  const filteredAreas = sortedAreas.filter(\n    ({ width, height }) =>\n      width >= popper.clientWidth && height >= popper.clientHeight\n  );\n\n  const computedPlacement = filteredAreas.length > 0\n    ?...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Oct 26 01:49:09 GMT 2024
    - 120.9K bytes
    - Click Count (0)
  7. docs/es/docs/async.md

    Luego la computadora / programa 🤖 volverá cada vez que tenga una oportunidad porque está esperando nuevamente, o siempre que 🤖 haya terminado todo el trabajo que tenía en ese punto. Y 🤖 comprobará si alguna de las tareas que estaba esperando ya se han completado, haciendo lo que tenía que hacer.
    
    Después, 🤖 toma la primera tarea que termine (digamos, nuestro "archivo-lento" 📝) y continúa con lo que tenía que hacer con ella.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:15:55 GMT 2026
    - 24.8K bytes
    - Click Count (0)
  8. src/bufio/bufio.go

    			err = b.readErr()
    			break
    		}
    
    		// Buffer full?
    		if b.Buffered() >= len(b.buf) {
    			b.r = b.w
    			line = b.buf
    			err = ErrBufferFull
    			break
    		}
    
    		s = b.w - b.r // do not rescan area we scanned before
    
    		b.fill() // buffer is not full
    	}
    
    	// Handle last byte, if any.
    	if i := len(line) - 1; i >= 0 {
    		b.lastByte = int(line[i])
    		b.lastRuneSize = -1
    	}
    
    	return
    }
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Feb 06 17:28:40 GMT 2026
    - 22K bytes
    - Click Count (0)
  9. src/test/java/jcifs/internal/smb2/Smb2EncryptionContextTest.java

                if (secureNonce1[i] != 0) {
                    hasNonZeroPadding = true;
                    break;
                }
            }
            assertTrue(hasNonZeroPadding, "Secure nonce should have random bytes in padding area");
        }
    
        @Test
        @DisplayName("Should support AES-256 cipher constants")
        void testAES256CipherConstants() {
            // Verify AES-256 constants are defined
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sun Aug 31 08:00:57 GMT 2025
    - 44.1K bytes
    - Click Count (0)
  10. src/main/webapp/js/bootstrap.min.js.map

    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sun Jan 12 06:14:02 GMT 2025
    - 211.9K bytes
    - Click Count (0)
Back to Top