Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 41 - 50 of 113 for rshift1 (0.34 seconds)

  1. doc/asm.html

    <code>R0-&gt;16</code>
    <br>
    <code>R0&gt;&gt;16</code>
    <br>
    <code>R0&lt;&lt;16</code>
    <br>
    <code>R0@&gt;16</code>:
    For <code>&lt;&lt;</code>, left shift <code>R0</code> by 16 bits.
    The other codes are <code>-&gt;</code> (arithmetic right shift),
    <code>&gt;&gt;</code> (logical right shift), and
    <code>@&gt;</code> (rotate right).
    </li>
    
    <li>
    <code>R0-&gt;R1</code>
    <br>
    <code>R0&gt;&gt;R1</code>
    <br>
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Nov 14 19:09:46 GMT 2025
    - 36.5K bytes
    - Click Count (0)
  2. okhttp/src/jvmTest/kotlin/okhttp3/UrlComponentEncodingTester.kt

          encodings[0x7] = encoding // Bell
          encodings['\b'.code] = encoding // Backspace
          encodings[0xb] = encoding // Vertical Tab
          encodings[0xe] = encoding // Shift Out
          encodings[0xf] = encoding // Shift In
          encodings[0x10] = encoding // Data Link Escape
          encodings[0x11] = encoding // Device Control 1 (oft. XON)
          encodings[0x12] = encoding // Device Control 2
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 12.3K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/base/Ascii.java

       */
      public static final byte CR = 13;
    
      /**
       * Shift Out: A control character indicating that the code combinations which follow shall be
       * interpreted as outside of the character set of the standard code table until a Shift In
       * character is reached.
       *
       * @since 8.0
       */
      public static final byte SO = 14;
    
      /**
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 21.7K bytes
    - Click Count (0)
  4. android/guava/src/com/google/common/primitives/UnsignedLongs.java

          if ((radix & (radix - 1)) == 0) {
            // Radix is a power of two so we can avoid division.
            int shift = Integer.numberOfTrailingZeros(radix);
            int mask = radix - 1;
            do {
              buf[--i] = Character.forDigit(((int) x) & mask, radix);
              x >>>= shift;
            } while (x != 0);
          } else {
            // Separate off the last digit using unsigned division. That will leave
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Jan 05 22:13:21 GMT 2026
    - 17.8K bytes
    - Click Count (0)
  5. src/main/assemblies/files/service.bat

    :checkExe
    if EXIST "%EXECUTABLE%" goto okExe
    echo fess-service-(x86|x64).exe was not found...
    
    :okExe
    if "%LOG_DIR%" == "" set LOG_DIR=%FESS_HOME%\logs
    
    if "x%1x" == "xx" goto displayUsage
    set SERVICE_CMD=%1
    shift
    if "x%1x" == "xx" goto checkServiceCmd
    set SERVICE_ID=%1
    
    :checkServiceCmd
    
    if "%LOG_OPTS%" == "" set LOG_OPTS=--LogPath "%LOG_DIR%" --LogPrefix "%SERVICE_ID%" --StdError auto --StdOutput auto
    
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sun Jan 15 06:32:15 GMT 2023
    - 6K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/hash/Fingerprint2011.java

     * to unsigned arithmetic in all cases except:
     *
     * <ul>
     *   <li>comparisons (signed values can be negative)
     *   <li>division (avoided here)
     *   <li>shifting (right shift must be unsigned)
     * </ul>
     *
     * @author ******@****.*** (Kyle Maddison)
     * @author ******@****.*** (Geoff Pike)
     */
    final class Fingerprint2011 extends AbstractNonStreamingHashFunction {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Aug 11 19:31:30 GMT 2025
    - 6.5K bytes
    - Click Count (0)
  7. doc/go_spec.html

    a <a href="#Run_time_panics">run-time panic</a> occurs.
    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>.
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Wed Apr 01 23:39:18 GMT 2026
    - 287.8K bytes
    - Click Count (1)
  8. guava/src/com/google/common/base/Ascii.java

       */
      public static final byte CR = 13;
    
      /**
       * Shift Out: A control character indicating that the code combinations which follow shall be
       * interpreted as outside of the character set of the standard code table until a Shift In
       * character is reached.
       *
       * @since 8.0
       */
      public static final byte SO = 14;
    
      /**
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 21.7K bytes
    - Click Count (0)
  9. src/cmd/asm/internal/asm/testdata/mips.s

    	MOVW	R1, M1
    
    	//	LMOVW mreg ',' rreg
    	//	{
    	//		outcode(int($1), &$2, 0, &$4);
    	//	}
    	MOVW	M1, R1
    	MOVW	M1, R1
    
    
    	//
    	// integer operations
    	// logical instructions
    	// shift instructions
    	// unary instructions
    	//
    	//	LADDW rreg ',' sreg ',' rreg
    	//	{
    	//		outcode(int($1), &$2, int($4), &$6);
    	//	}
    	ADD	R1, R2, R3
    
    	//	LADDW imm ',' sreg ',' rreg
    	//	{
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Tue Aug 08 12:17:12 GMT 2023
    - 6.7K bytes
    - Click Count (0)
  10. src/main/webapp/js/admin/jquery-3.7.1.min.js

    Y(e,t){var n,r,i,o,a,s,u,l=c[e+" "];if(l)return t?0:l.slice(0);a=e,s=[],u=b.preFilter;while(a){for(o in n&&!(r=y.exec(a))||(r&&(a=a.slice(r[0].length)||a),s.push(i=[])),n=!1,(r=m.exec(a))&&(n=r.shift(),i.push({value:n,type:r[0].replace(ve," ")}),a=a.slice(n.length)),b.filter)!(r=D[o].exec(a))||u[o]&&!(r=u[o](r))||(n=r.shift(),i.push({value:n,type:o,matches:r}),a=a.slice(n.length));if(!n)break}return t?a.length:a?I.error(e):c(e,s).slice(0)}function Q(e){for(var t=0,n=e.length,r="";t<n;t++)r+=e[t].value;return...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Oct 26 01:07:52 GMT 2024
    - 85.5K bytes
    - Click Count (1)
Back to Top