Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 235 for Stone (0.14 sec)

  1. TODO/steve-jobs-in-1994-the-rolling-stone-interview-20110117.md

    
    ## Even at one of the low points in his career, Jobs still had confidence in the limitless potential of personal computing
    
    
    > * 原文链接 : [Steve Jobs in 1994: The Rolling Stone Interview | Rolling Stone](http://www.rollingstone.com/culture/news/steve-jobs-in-1994-the-rolling-stone-interview-20110117)
    * 原文作者 : [JEFF GOODELL](http://www.rollingstone.com/contributor/jeff-goodell)
    * 译文出自 : [掘金翻译计划](https://github.com/xitu/gold-miner)
    * 译者 : 
    * 校对者: 
    * 状态 :  待定
    Plain Text
    - Registered: 2020-09-10 14:49
    - Last Modified: 2015-11-08 15:21
    - 34.1K bytes
    - Viewed (0)
  2. artificial_intelligence/efficient-selectivity-and-backup-operators-in-monte-carlo-tree-search.pdf

    Crazy Stone does not have. Also, random simulations are different. Crazy Stone’s
    simulations probably have better handling of the urgency of captures. Indigo’s
    simulations use patterns, while Crazy Stone is based on an uniform distribution.
    All in all, this victory is still a rather convincing indication of the power of the
    algorithm presented in this paper.
    PDF
    - Registered: 2020-06-23 17:41
    - Last Modified: 2014-08-19 04:59
    - 133.6K bytes
    - Viewed (0)
  3. docs/MutationModel.rst

       clay = 43           // OK; a var is always assignable
       **stone =** clay \* 1000 // **Error:** stone is an rvalue
    
       swap(&clay, **&stone**) // **Error:** 'stone' is an rvalue; can't take its address
    
       **stone +=** 3          // **Error:** += is declared inout, @assignment and thus
                           // implicitly takes the address of 'stone'
    
       **let** x = Number(42)  // x is an rvalue
    Plain Text
    - Registered: 2020-09-15 00:23
    - Last Modified: 2017-01-08 14:23
    - 9.5K bytes
    - Viewed (0)
  4. leetcode/hash-table/JewelsAndStones.java

    //Each character in S is a type of stone you have.  You want to know how many of the stones you have are also jewels.
    
    //The letters in J are guaranteed distinct, and all characters in J and S are letters. Letters are case sensitive, 
    //so "a" is considered a different type of stone from "A".
    
    class JewelsAndStones {
        public int numJewelsInStones(String J, String S) {
    Java
    - Registered: 2020-06-23 00:10
    - Last Modified: 2018-03-29 15:23
    - 867 bytes
    - Viewed (0)
  5. tsdb/record/record_test.go

    	testutil.Ok(t, err)
    	testutil.Equals(t, samples, decSamples)
    
    	// Intervals get split up into single entries. So we don't get back exactly
    	// what we put in.
    	tstones := []tombstones.Stone{
    		{Ref: 123, Intervals: tombstones.Intervals{
    			{Mint: -1000, Maxt: 1231231},
    			{Mint: 5000, Maxt: 0},
    		}},
    		{Ref: 13, Intervals: tombstones.Intervals{
    			{Mint: -1000, Maxt: -11},
    			{Mint: 5000, Maxt: 1000},
    Go
    - Registered: 2020-09-16 16:43
    - Last Modified: 2020-05-27 06:38
    - 4.2K bytes
    - Viewed (0)
  6. tsdb/wal.go

    				if cf.maxTime < s.T {
    					cf.maxTime = s.T
    				}
    			}
    		case WALEntryDeletes:
    			var deletes []tombstones.Stone
    			if v := deletePool.Get(); v == nil {
    				deletes = make([]tombstones.Stone, 0, 512)
    			} else {
    				deletes = v.([]tombstones.Stone)
    			}
    
    			err = r.decodeDeletes(flag, b, &deletes)
    			if err != nil {
    				err = errors.Wrap(err, "decode delete entry")
    				break
    Go
    - Registered: 2020-09-16 16:43
    - Last Modified: 2020-04-11 08:22
    - 31.2K bytes
    - Viewed (0)
  7. tsdb/record/record.go

    func (d *Decoder) Tombstones(rec []byte, tstones []tombstones.Stone) ([]tombstones.Stone, error) {
    	dec := encoding.Decbuf{B: rec}
    
    	if Type(dec.Byte()) != Tombstones {
    		return nil, errors.New("invalid record type")
    	}
    	for dec.Len() > 0 && dec.Err() == nil {
    		tstones = append(tstones, tombstones.Stone{
    			Ref: dec.Be64(),
    			Intervals: tombstones.Intervals{
    Go
    - Registered: 2020-09-16 16:43
    - Last Modified: 2019-11-18 19:53
    - 5.7K bytes
    - Viewed (0)
  8. tsdb/wal_test.go

    				csmpls := make([]record.RefSample, len(smpls))
    				copy(csmpls, smpls)
    				resultSamples = append(resultSamples, csmpls)
    			}
    		}
    
    		delf := func(stones []tombstones.Stone) {
    			if len(stones) > 0 {
    				cst := make([]tombstones.Stone, len(stones))
    				copy(cst, stones)
    				resultDeletes = append(resultDeletes, cst)
    			}
    		}
    
    		testutil.Ok(t, r.Read(serf, smplf, delf))
    
    Go
    - Registered: 2020-09-16 16:43
    - Last Modified: 2020-07-21 08:08
    - 15.6K bytes
    - Viewed (0)
  9. online_judges/nim/nim_solution.ipynb

        "\n",
        "You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the winner. You will take the first turn to remove the stones.\n",
        "\n",
    Plain Text
    - Registered: 2020-06-24 19:08
    - Last Modified: 2017-03-28 09:14
    - 4.7K bytes
    - Viewed (0)
  10. src/ci/docker/host-x86_64/dist-powerpc64-linux/patches/glibc/2.12.2/002-Prevent-inlining-in-PPC64-initfini.s.patch

    From a4f388e111ce05e2ab7912cff3c9070334bb74ae Mon Sep 17 00:00:00 2001
    From: Josh Stone <******@****.***>
    Date: Fri, 20 Jan 2017 15:41:56 -0800
    Subject: [PATCH] Prevent inlining in PPC64 initfini.s
    
    Ref: https://sourceware.org/ml/libc-alpha/2012-01/msg00195.html
    ---
     sysdeps/powerpc/powerpc64/Makefile | 2 +-
     1 file changed, 1 insertion(+), 1 deletion(-)
    
    diff --git a/sysdeps/powerpc/powerpc64/Makefile b/sysdeps/powerpc/powerpc64/Makefile
    Others
    - Registered: 2020-07-20 03:55
    - Last Modified: 2020-07-03 07:34
    - 859 bytes
    - Viewed (0)
Back to top