15.11.2016 12:48, drug пишет:
15.11.2016 12:43, RazvanN пишет:
The find function which receives an input haystack and a needle returns
the haystack advanced to the first occurrence of the needle. For normal
ranges this is fine, but for
sorted ranges (aka SortedRange) it is a bit odd. For
On 11/15/2016 01:50 AM, drug wrote:
15.11.2016 12:48, drug пишет:
15.11.2016 12:43, RazvanN пишет:
The find function which receives an input haystack and a needle returns
the haystack advanced to the first occurrence of the needle. For normal
ranges this is fine, but for
sorted ranges (aka
The find function which receives an input haystack and a needle
returns the haystack advanced to the first occurrence of the
needle. For normal ranges this is fine, but for
sorted ranges (aka SortedRange) it is a bit odd. For example:
find(assumeSorted[1, 2, 4, 5, 6, 7], 4) would return [4, 5,
15.11.2016 12:50, RazvanN пишет:
On Tuesday, 15 November 2016 at 09:43:27 UTC, RazvanN wrote:
The find function which receives an input haystack and a needle
returns the haystack advanced to the first occurrence of the needle.
For normal ranges this is fine, but for
sorted ranges (aka
On Tuesday, 15 November 2016 at 09:43:27 UTC, RazvanN wrote:
The find function which receives an input haystack and a needle
returns the haystack advanced to the first occurrence of the
needle. For normal ranges this is fine, but for
sorted ranges (aka SortedRange) it is a bit odd. For
On 11/15/16 4:43 AM, RazvanN wrote:
The find function which receives an input haystack and a needle returns
the haystack advanced to the first occurrence of the needle. For normal
ranges this is fine, but for
sorted ranges (aka SortedRange) it is a bit odd. For example:
find(assumeSorted[1, 2,
Hello,
Sorry if this is FAQ, or any other way stupid question, e.t.c.
I have to configure vibe.d tlsstream to verify remote certificate.
Please correct me if I'm wrong -- here is part of my code to
request certificate verification:
auto sslctx = createTLSContext(TLSContextKind.client);
On Tuesday, 15 November 2016 at 09:50:40 UTC, RazvanN wrote:
On Tuesday, 15 November 2016 at 09:43:27 UTC, RazvanN wrote:
The find function which receives an input haystack and a
needle returns the haystack advanced to the first occurrence
of the needle. For normal ranges this is fine, but for
Maybe interesting (hoping it is not too redundant with the links
here)
https://github.com/zhaopuming/awesome-d
Vincent
On 11/15/16 3:05 PM, Kapps wrote:
Keep in mind, this is only slow for such a large amount of calls.
If you're calling this only a hundred times a second, then who cares if
it's slower. After all, with GDC we were looking at 1 billion calls in
21 seconds. That's 47,000 calls per *millisecond*.
On Monday, 14 November 2016 at 17:43:37 UTC, WhatMeWorry wrote:
I was reading this fasciniating article:
https://davesdprogramming.wordpress.com/2013/05/06/low-lock-singletons/
And to quote a section of it:
-
static MySingleton get() {
15.11.2016 12:43, RazvanN пишет:
The find function which receives an input haystack and a needle returns
the haystack advanced to the first occurrence of the needle. For normal
ranges this is fine, but for
sorted ranges (aka SortedRange) it is a bit odd. For example:
find(assumeSorted[1, 2, 4,
It seems that /usr/bin/dman is currently used by deepin-manual.
Is there anyway to get around this?
Link to the screenshot:
https://1drv.ms/i/s!AtF769jLRRhO61Of6g3ZIBl8uZAk
13 matches
Mail list logo
