Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for operands (0.05 sec)

  1. doc/go1.17_spec.html

    
    <h2 id="Expressions">Expressions</h2>
    
    <p>
    An expression specifies the computation of a value by applying
    operators and functions to operands.
    </p>
    
    <h3 id="Operands">Operands</h3>
    
    <p>
    Operands denote the elementary values in an expression. An operand may be a
    literal, a (possibly <a href="#Qualified_identifiers">qualified</a>)
    non-<a href="#Blank_identifier">blank</a> identifier denoting a
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Oct 10 18:25:45 UTC 2024
    - 211.6K bytes
    - Viewed (0)
  2. src/main/webapp/js/admin/popper.min.js.map

    otherwise use width\n  // in this way the first offset will use an axis and the second one\n  // will use the other one\n  const useHeight = ['right', 'left'].indexOf(basePlacement) !== -1;\n\n  // Split the offset string to obtain a list of values and operands\n  // The regex addresses values with the plus or minus sign in front (+10, -20, etc)\n  const fragments = offset.split(/(\\+|\\-)/).map(frag => frag.trim());\n\n  // Detect if the offset string contains a pair of values or a single one\n  // they...
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 120.9K bytes
    - Viewed (0)
  3. guava/src/com/google/common/cache/LocalCache.java

       *
       * The Least Recently Used page replacement algorithm was chosen due to its simplicity, high hit
       * rate, and ability to be implemented with O(1) time complexity. The initial LRU implementation
       * operates per-segment rather than globally for increased implementation simplicity. We expect
       * the cache hit rate to be similar to that of a global LRU algorithm.
       */
    
      // Constants
    
      /**
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 19:07:49 UTC 2024
    - 149.2K bytes
    - Viewed (0)
Back to top