- Sort Score
- Result 10 results
- Languages All
Results 11 - 18 of 18 for shiftKey (0.45 sec)
-
src/main/java/jcifs/internal/smb1/ServerMessageBlock.java
* looking for a way to improve perfomance this is precisly what you * would want to do as the jcifs.netbios.SocketXxxputStream classes * arraycopy all data read or written into a new buffer shifted over 4!) */ private byte command, flags; /** * Starting position of the SMB header in the buffer. */ protected int headerStart; /**Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 38.9K bytes - Viewed (0) -
src/bufio/bufio_test.go
b := w.AvailableBuffer() if w.Available() != cap(b) { t.Fatalf("Available() = %v, want %v", w.Available(), cap(b)) } // While not recommended, it is valid to append to a shifted buffer. // This forces Write to copy the input. if rn.Intn(8) == 0 && cap(b) > 0 { b = b[1:1:cap(b)] } // Append a random integer of varying width. n := int64(rn.Intn(1 << rn.Intn(30)))
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Fri Feb 07 01:08:54 UTC 2025 - 51.6K bytes - Viewed (0) -
src/cmd/asm/internal/asm/testdata/arm64.s
FMOVD 0x1000000(R1), F2 // FMOVD 16777216(R1), F2 FMOVD 0x44332211(R1), F2 // FMOVD 1144201745(R1), F2 FMOVQ 0x1000000(R1), F2 // FMOVQ 16777216(R1), F2 FMOVQ 0x44332211(R1), F2 // FMOVQ 1144201745(R1), F2 // shifted or extended register offset. MOVD (R2)(R6.SXTW), R4 // 44c866f8 MOVD (R3)(R6), R5 // 656866f8 MOVD (R3)(R6*1), R5 // 656866f8
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Mon Nov 10 17:34:13 UTC 2025 - 96.1K bytes - Viewed (0) -
src/main/webapp/js/admin/moment-with-locales.min.js
instead. http://momentjs.com/guides/#/warnings/zone/",function(e,a){return null!=e?("string"!=typeof e&&(e=-e),this.utcOffset(e,a),this):-this.utcOffset()}),yt.isDSTShifted=t("isDSTShifted is deprecated. See http://momentjs.com/guides/#/warnings/dst-shifted/ for more information",function(){if(!r(this._isDSTShifted))return this._isDSTShifted;var e,a={};return p(a,this),(a=ba(a))._a?(e=(a._isUTC?c:Ha)(a._a),this._isDSTShifted=this.isValid()&&0<function(e,a,t){for(var s=Math.min(e.length,a.length),n=M...Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 360.5K bytes - Viewed (2) -
doc/go_spec.html
The shift operators implement arithmetic shifts if the left operand is a signed integer and logical shifts if it is an unsigned integer. There is no upper limit on the shift count. Shifts behave as if the left operand is shifted <code>n</code> times by 1 for a shift count of <code>n</code>. As a result, <code>x << 1</code> is the same as <code>x*2</code> and <code>x >> 1</code> is the same as
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Tue Dec 02 23:07:19 UTC 2025 - 286.5K bytes - Viewed (1) -
CHANGELOG/CHANGELOG-1.31.md
- Kubeadm: Removed support for mounting /etc/pki as an additional Linux system CA location in kube-apisever and kube-controller-manager pods. Instead, it shifted to supporting the mounting of /etc/pki/ca-trust and /etc/pki/tls/certs. The locations /etc/ca-certificate, /usr/share/ca-certificates, /usr/local/share/ca-certificates, and /etc/ssl/certs continued
Registered: Fri Dec 26 09:05:12 UTC 2025 - Last Modified: Wed Nov 12 11:33:21 UTC 2025 - 451.9K bytes - Viewed (0) -
lib/fips140/v1.0.0-c2097c7c.zip
each limb at the least significant position, shifting all // previous limbs left by _W. This way each limb will get shifted by the // correct number of bits. We can insert at least N - 1 limbs without // overflowing m. After that, we need to reduce every time we shift. i := len(x.limbs) - 1 // For the first N - 1 limbs we can skip the actual shifting and position // them at the shifted position, which starts at min(N - 2, i). start := len(m.nat.limbs) - 2 if i < start { start = i } for j := start;...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Sep 25 19:53:19 UTC 2025 - 642.7K bytes - Viewed (0) -
lib/fips140/v1.1.0-rc1.zip
each limb at the least significant position, shifting all // previous limbs left by _W. This way each limb will get shifted by the // correct number of bits. We can insert at least N - 1 limbs without // overflowing m. After that, we need to reduce every time we shift. i := len(x.limbs) - 1 // For the first N - 1 limbs we can skip the actual shifting and position // them at the shifted position, which starts at min(N - 2, i). start := len(m.nat.limbs) - 2 if i < start { start = i } for j := start;...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Dec 11 16:27:41 UTC 2025 - 663K bytes - Viewed (0)