Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 35 for Burton (0.18 sec)

  1. packages/react-router/modules/__tests__/integration-test.js

        expect(node.innerHTML).toContain(TEXT1);
        expect(node.innerHTML).not.toContain(TEXT2);
      });
    
      it("renders multiple matching routes", () => {
        const TEXT1 = "Mrs. Schiffman";
        const TEXT2 = "Mrs. Burton";
    
        renderStrict(
          <MemoryRouter initialEntries={["/double"]}>
            <div>
              <aside>
                <Route path="/double" render={() => <h1>{TEXT1}</h1>} />
              </aside>
              <main>
    JavaScript
    - Registered: 2020-07-03 09:57
    - Last Modified: 2019-10-18 14:00
    - 1.9K bytes
    - Viewed (0)
  2. runtime/doc/quotes.txt

    giving up on the multiple incompatible versions, flaky contributed packages,
    disorganized keystrokes, etc.  And it was one of the best moves I ever made.
    (Joel Burton)
    
    Although all of the programs were used during the preparation of the new and
    revised material, most of the editing was done with Vim versions 4.5 and 5.0
    Plain Text
    - Registered: 2020-07-06 09:55
    - Last Modified: 2019-12-12 13:18
    - 12.4K bytes
    - Viewed (0)
  3. docs/algorithm/guava-bloom-filter.md

    实际情况也是如此;既然要判断一个数据是否存在于集合中,考虑的算法的效率以及准确性肯定是要把数据全部 `load` 到内存中的。
    
    
    # Bloom Filter 
    
    基于上面分析的条件,要实现这个需求最需要解决的是`如何将庞大的数据 load 到内存中。`
    
    而我们是否可以换种思路,因为只是需要判断数据是否存在,也不是需要把数据查询出来,所以完全没有必要将真正的数据存放进去。
    
    伟大的科学家们已经帮我们想到了这样的需求。
    
    `Burton Howard Bloom` 在 1970 年提出了一个叫做 `Bloom Filter`(中文翻译:布隆过滤)的算法。
    
    它主要就是用于解决判断一个元素是否在一个集合中,但它的优势是只需要占用很小的内存空间以及有着高效的查询效率。
    
    所以在这个场景下在合适不过了。
    
    ## Bloom Filter 原理
    
    下面来分析下它的实现原理。
    
    Plain Text
    - Registered: 2020-07-06 02:38
    - Last Modified: 2019-06-26 15:46
    - 12.9K bytes
    - Viewed (0)
  4. Discovery/SNMP/snmp.txt

    bubba
    bubba1
    bubble
    bubbles
    buck
    bucks
    buddha
    buddy
    budgie
    buffalo
    buffett
    buffy
    bugs
    bugsy
    bull
    bulldog
    bullet
    bulls
    bullshit
    bunny
    burns
    burton
    business
    buster
    butch
    butler
    butter
    butterfly
    butthead
    button
    buttons
    buzz
    byron
    byteme
    c
    c00per
    C0de
    cable-d
    cable-docsis
    cactus
    caesar
    caitlin
    Plain Text
    - Registered: 2020-07-05 14:35
    - Last Modified: 2019-11-08 10:39
    - 22.2K bytes
    - Viewed (0)
  5. Discovery/SNMP/snmp-onesixtyone.txt

    bubba
    bubba1
    bubble
    bubbles
    buck
    bucks
    buddha
    buddy
    budgie
    buffalo
    buffett
    buffy
    bugs
    bugsy
    bull
    bulldog
    bullet
    bulls
    bullshit
    bunny
    burns
    burton
    business
    buster
    butch
    butler
    butter
    butterfly
    butthead
    button
    buttons
    buzz
    byron
    byteme
    c
    c00per
    C0de
    cable-d
    cable-docsis
    cactus
    caesar
    caitlin
    Plain Text
    - Registered: 2020-07-05 14:35
    - Last Modified: 2019-05-08 10:54
    - 22.2K bytes
    - Viewed (0)
  6. notebooks/03.10-Working-With-Strings.ipynb

        {
         "data": {
          "text/plain": [
           "2069      All cremat with a Little Gem, dandelion and wa...\n",
           "74964                         Lobster with Thermidor butter\n",
           "93768      Burton's Southern Fried Chicken with White Gravy\n",
           "113926                     Mijo's Slow Cooker Shredded Beef\n",
           "137686                     Asparagus Soup with Poached Eggs\n",
    Plain Text
    - Registered: 2020-06-19 13:32
    - Last Modified: 2018-08-28 21:10
    - 41.3K bytes
    - Viewed (0)
  7. languages-paradigms/functional_programming/purely-functional-data-structures.pdf

    Queues Gries [Gri81, pages 250–251] and Hood and Melville [HM81] first proposed the
    queues in Section 3.1.1. Burton [Bur82] proposed a similar implementation, but without the
    restriction that the front list be non-empty whenever the queue is non-empty. (Burton combines
    head and tail into a single operation, and so does not require this restriction to support head
    PDF
    - Registered: 2020-06-23 17:41
    - Last Modified: 2019-09-04 10:38
    - 614.1K bytes
    - Viewed (0)
  8. comp_sci_fundamentals_and_history/hints-for-computer-system-design.pdf

    5th Int’l Conf. Software Engineering, IEEE Computer Society order no. 332, 1981, pp 195-204.
    6. Brooks, F.H. The Mythical Man-Month, Addison-Wesley, 1975.
    7. Burton, R.R. et al. Interlisp-D overview. In Papers on Interlisp-D, Technical report SSL-80-4, Xerox
    Palo Alto Research Center, 1981.
    8. Clark, D.W. et al. The memory system of a high-performance personal computer. IEEE Trans.
    PDF
    - Registered: 2020-06-23 17:41
    - Last Modified: 2014-06-11 07:03
    - 87.4K bytes
    - Viewed (0)
  9. project_euler/problem_22/p022_names.txt

    Plain Text
    - Registered: 2020-07-02 19:18
    - Last Modified: 2018-10-19 22:14
    - 45.4K bytes
    - Viewed (0)
  10. django/contrib/auth/common-passwords.txt.gz

    lllll blades mayquinn2 thegame apollo11 lala123 kimmy1 velvet1 mnbvcxz1 246810 31415926 nideknil password4 aaaa11 katie12 deadhead pastor1 bdfyjdf cgfhnfr kayla1 bonanza alex14 mybaby freedom123 9508402243id juan123 telechargement motdepasse patryk burton chargers1 abcdefgh 5656 charly2004 angelica1 bonehead keystone1 mariama haribo shitty1 ramirez metallica6 nicole12 walmart1 monday1 holyspirit tiger1 qawsed123 eddie nicola q1q2q3q4q5 wealth assman razor1 mercado nokia5130 april20 888999 french1 tester...
    Others
    - Registered: 2020-07-09 07:01
    - Last Modified: 2018-11-15 19:11
    - 79.4K bytes
    - Viewed (1)
Back to top