On Thursday, 17 June 2021 at 15:58:40 UTC, Adam D Ruppe wrote:
On Thursday, 17 June 2021 at 15:57:46 UTC, Justin Choi wrote:
I want to write something like `DList!int[]()`
DList!(int[])() ?
Thanks I've mentally slapped myself a hundred times for this
mistake :D
If I wanted to create a DList (or any similar data structure) of
multiple integers, how would I accomplish this?
I want to write something like `DList!int[]()` but the best I can
do for now is a format such as `DList!(Tuple(int, int))()` which
confines me to a fixed number of integers.
Is there any shortcut for unpacking slices like I'd want to do in
a scenario like this?
`info = readln.strip.split;`
`string a = info[0], b = info[1], c = info[2];`
Could somebody explain or point me to documentation that helps to
explain the usage of strings in predicates?
My main question is how D infers the omitted variable
specifications given otherwise - for example:
`filter!(a => a < 3)(arr);`
and
`filter!"a < 3"(arr);`
produce the same result.
I'm currently learning D right now, and I was wondering why
certain functions like std.stdio.readln can work both with and
without parenthesis for the function call. I've tried looking
through the documentation but can't find an explanation for why
you can use it without parenthesis.
On Tuesday, 22 October 2019 at 22:14:02 UTC, OiseuKodeur wrote:
Hello, i am having a problem with dub build with this project
https://github.com/OiseauKodeur/cervelet/tree/master/source
when i try to compile everything go well but when i click to
run the .exe it give my an error missing
Very cool features! Due to template expansion, even very simple
D programs won't display their AST, e.g.
https://run.dlang.io/is/yVsPsH gives me a "Compilation or running
program took longer than 25 seconds. Aborted!" Not sure what can
be done about this, but it certainly limits the
On Thursday, 4 January 2018 at 00:54:12 UTC, Seb wrote:
On Thursday, 4 January 2018 at 00:35:56 UTC, H. S. Teoh wrote:
On Thu, Jan 04, 2018 at 12:25:59AM +, Justin Whear via
Digitalmars-d wrote:
// Reads bytes from stdin and writes a hexadecimal view like
a no-frills
xxd.
// All
// Reads bytes from stdin and writes a hexadecimal view like a
no-frills xxd.
// All the actual formatting work is done by format's sweet range
syntax
void main(string[] args)
{
import std.getopt;
uint bytesPerLine = 8;
args.getopt(
"cols|c",
);
Is there a resource that explains how to create a file that
stores a response to a question. say I want to introduce a
program like this "Hi, my name is "", what's yours"? I want to
generate an audio profile that's interactive and store data for
access like a personal assistant. Any
How to save your work to email? Anyone know? I use my mobile to
write.
8
4
On Thu, 21 Jan 2016 18:37:08 +, data pulverizer wrote:
> It's interesting that the output first array is not the same as the
> input
byLine reuses a buffer (for speed) and the subsequent split operation
just returns slices into that buffer. So when byLine progresses to the
next line the
On Fri, 15 Jan 2016 20:52:46 +, Meta wrote:
> And of course I'm proven wrong as soon as I post :) Sometimes I forget
> how powerful D's code generation abilities are.
Username doesn't check out, :(
On Tue, 05 Jan 2016 16:07:36 +, Jack Applegame wrote:
> On a server with 4GB of RAM our D application consumes about 1GB.
> Today we have increased server memory to 6 Gb and the same application
> under the same conditions began to consume about 3Gb of memory.
> Does GC greediness depend on
On Thu, 03 Dec 2015 21:40:05 +, Jim Barnett wrote:
> TL;DR I couldn't figure out how to write `isPalindrome` in terms of
> std.algorithm.mutation.reverse
>
> I recognize it's more efficient in terms of CPU time and memory than my
> C++ solution, but I suspect there is a shorter expression to
On Fri, 20 Nov 2015 18:57:10 +, TheDGuy wrote:
> Thanks for your reply,
>
> now it gets more clear for me but how am i able to access the TreeView
> within the CustomButton-Class? If i declare TreeView and TreeStore
> public i get "static variable list cannot be read at compile time"?
>
>
On Fri, 20 Nov 2015 19:34:01 +, TheDGuy wrote:
> Thanks for your reply,
>
> is it also possible to do it like this?
>
Yeah, that'll work.
> but now i get the error:
>
> "rowDeleted is not callable using argument types (TreeIter)"?
rowDeleted is just to emit the signal that a row has
On Fri, 20 Nov 2015 19:45:25 +, TheDGuy wrote:
> So like this?
>
> public void remove(TreeIter iter)
> {
> this.remove(iter);
> }
>
> If i do this, i get a stackoverflow error :(
That's creating an infinite recursion as the method simply calls itself.
On Fri, 20 Nov 2015 20:39:57 +, Ilya wrote:
> Can DMD frontend optimize
> string concatenation
> ```
> enum Double(S) = S ~ S;
>
> assert(condition, "Text " ~ Double!"+" ~ ___FUNCTION__);
> ```
>
> to
>
> ```
> assert(condition, "Text ++_function_name_");
>
> ```
> ?
Yes this occurs as
On Mon, 16 Nov 2015 23:08:46 +, opla wrote:
> Does anyone know if it's possible to monitor the events that happen on
> the output stream of a piped process ?
>
> I'm stuck on doc:
>
> - https://www.win.tue.nl/~aeb/linux/lk/lk-12.html -
>
On Thu, 12 Nov 2015 19:37:41 +, TheFlyingFiddle wrote:
> The description in dmd help says: omit generating some runtime
> information and helper functions.
>
> What runtime information are we talking about here? My
> understanding is that it's basically an experimental feature but
> when
On Thu, 22 Oct 2015 11:55:37 +, Nordlöw wrote:
> What's wrong?
HashSet has a disabled default constructor; you need to supply the
allocator instance to the constructor here https://github.com/nordlow/
justd/blob/master/containers_ex.d#L17
On Thu, 22 Oct 2015 19:41:08 +, Nordlöw wrote:
> My existing call to
>
> auto set = HashSet!(E, Allocator)();
>
> works for Mallocator as in
>
> https://github.com/nordlow/justd/blob/master/containers_ex.d#L17
>
> but not for
>
> InSituRegion!(1024*1024, T.alignof)
>
> Why?
On Mon, 19 Oct 2015 14:51:28 +, Stewart Moth wrote:
> I'm working with a library that has template structs of mathematical
> vectors that can sometimes be the type of an array I'm passing to a
> function.
>
> The definition of the struct is like this:
>
> struct Vector(type, int
On Wed, 23 Sep 2015 21:17:27 +, BBasile wrote:
> On Wednesday, 23 September 2015 at 21:04:44 UTC, Justin Whear wrote:
>> On Wed, 23 Sep 2015 20:48:03 +, BBasile wrote:
>>
>>> I was thinking to a general *interleave()* algorithm for any
>>> compatible Ra
On Wed, 23 Sep 2015 20:48:03 +, BBasile wrote:
> I was thinking to a general *interleave()* algorithm for any compatible
> Range of Range but I can't find any smart way to process each sub range
> by front
Can you show a sample input and output to clarify what you mean by
interleave? It's
On Mon, 21 Sep 2015 15:38:38 +, French Football wrote:
> Going through a book on coding in D,
> http://ddili.org/ders/d.en/foreach.html , I find the following very
> useful feature:
>
> When two names are specified in the names section [with a plain array],
> they represent an automatic
On Thu, 17 Sep 2015 20:41:11 +, Adam wrote:
> Is this the basic idea?
>
> Use templates when you want more power? That is, TOP can do everything
> OOP can do but more? Or are these ultimately two orthogonal concepts?
I think you've got the right idea. Some unordered thoughts:
* OOP
On Mon, 14 Sep 2015 17:05:16 +, Mike McKee wrote:
> Is there a way to do a canvas in GTK3 so that I can use chart.js,
Mike, as this is really a GTK3 question and not specific to D (if GTK
will let you do it in C, you can do it in D), you might have better
success asking the GTK forum
On Sat, 05 Sep 2015 12:21:33 +0200, Robert M. Münch wrote:
> My "pieceOfWork" is not the same. So I don't have the case: Do 4 time
> this 1thing. Instead, do 1 time these 4 things.
Ah, so you want to receive one each of various types? Something like
this might work (untested):
//
On Thu, 03 Sep 2015 18:50:21 +0200, Robert M. Münch wrote:
> Hi, I'm not sure how to best implement the following:
>
> 1. I have 4 different tasks to do.
> 2. All can run in parallel 3. Every task will return some result that I
> need
>
> Now how to best do it? When using receive() it fires on
On Thu, 03 Sep 2015 01:27:14 +, j55 wrote:
> I've read many posts about shared memory and interprocess communication
> in D, but I didn't see any conclusive information about whether this
> type of interprocess memory sharing will be convenient or practical in
> D. If it doesn't work out, I
On Tue, 01 Sep 2015 19:40:24 +0300, drug wrote:
> I'm just trying to automatically convert D types to hdf5 types so I
> guess char[..] isn't obligatory some form of UTF-8 encoded text. Or I
> should treat it so?
Because of D's autodecoding it can be problematic to assume UTF-8 if
other
On Tue, 01 Sep 2015 21:45:30 +, Kai Nacke wrote:
> This is the 7th time that LDC and D are mentioned in the LLVM release
> notes!
Fantastic work keeping LDC bleeding edge!
On Tue, 01 Sep 2015 19:18:42 +0300, drug wrote:
> http://dpaste.dzfl.pl/4535c5c03126
Arrays of char are assumed to be UTF-8 encoded text and a single char is
not necessarily sufficient to represent a character. ElementType
identifies the type that you will receive when (for instance)
On Tue, 01 Sep 2015 19:21:44 +0300, drug wrote:
> On 01.09.2015 19:18, drug wrote:
>> http://dpaste.dzfl.pl/4535c5c03126
>
> Should I use ForeachType!(char[3]) instead of ElementType?
Try std.range.ElementEncodingType
On Tue, 01 Sep 2015 16:25:53 +, Justin Whear wrote:
> On Tue, 01 Sep 2015 19:18:42 +0300, drug wrote:
>
>> http://dpaste.dzfl.pl/4535c5c03126
>
> Arrays of char are assumed to be UTF-8 encoded text and a single char is
> not necessarily sufficient to represent a ch
On Tue, 25 Aug 2015 04:55:12 +, Laeeth Isharc wrote:
http://www.nytimes.com/2015/08/23/magazine/the-creative-apocalypse-that-
wasnt.html
Interesting article as it corrects misconceptions of a few years back by
looking at the data. This is based on tools from EMSI,
who are a D shop.
On Mon, 24 Aug 2015 18:06:07 +, rumbu wrote:
BTW, 1.2 and 12.0 are directly representable as double
In C++:
printf(%.20f\r\n, 1.2);
printf(%.20f\r\n, 12.0);
will output:
1.2000 12.
Either upcasting to real is the wrong decision here, either
On Thu, 13 Aug 2015 21:42:52 +, Jack Stouffer wrote:
foreach (item; parent_list) {
string class_name = (cast(Object)
item).classinfo.name;
if (class_name == test.A) {
(cast(A) item).method();
} else if
On Wed, 12 Aug 2015 22:10:30 +, Taylor Hillegeist wrote:
I figure this should do it. but i'm running into problems. Anybody know
why?
Describe problems
On Mon, 03 Aug 2015 22:42:14 +, SirNickolas wrote:
Hello! I'm new in D and it is amazing!
Can you tell me please if it is discouraged or deprecated to call a
function by just putting its name, without brackets? It's quite unusual
for me (used C++ and Python before), but I can see this
Java being fastest at running Java-style code is not too surprising. My
guess is that Java is hotspot inlining the calls to `bar`, getting rid
of the dynamic dispatch overhead. I think that for real systems D will
generally beat out Java across the board, but not if the D version is a
On Fri, 24 Jul 2015 22:07:12 +, Jonathan M Davis wrote:
On Friday, 24 July 2015 at 21:48:23 UTC, Tofu Ninja wrote:
On Friday, 24 July 2015 at 21:32:19 UTC, Jonathan M Davis wrote:
This is exactly wrong attitude. Why on earth should we make life
easier for folks who don't bother to get
On Thu, 23 Jul 2015 13:46:16 -0700, Walter Bright wrote:
like implicit declaration of variables.
Trigger warning needed!
On Thu, 16 Jul 2015 17:30:05 +, Benjamin Thaut wrote:
The speaker has 30 years of experience working on javas hotspot vm
How is this possible? Time travel?
On Thu, 09 Jul 2015 16:20:56 +, tcak wrote:
Is there any way to get the type of enum without interacting with its
items?
std.traits.OriginalType
Is there any way to get string representation of an item of enum without
casting?
I think casting to the OriginalType and then using to!string
Yes.
On Mon, 06 Jul 2015 20:56:03 +, Frank Pagliughi wrote:
Hello All,
I'm trying to figure out how to create a shared object that can be used
to track asynchronous operations. Something that can be used like:
Token tok = mything.start_something();
// do something else for a while
On Thu, 02 Jul 2015 17:33:28 +, Laeeth Isharc wrote:
FixedDecimal is a fixed decimal point struct that stores values as an
int or long and takes number of decimal places as the second compile
term argument. It's possible, if not likely I have made a mistake in
implementing operator
On Thu, 02 Jul 2015 21:03:37 +, Laeeth Isharc wrote:
Can you post the signature to the operator overload? I have an idea of
what it might be, but it's difficult to explain without context.
-Steve
https://gist.github.com/Laeeth/6251fa731e4cee84bcdc
not really a proper implementation.
On Tue, 30 Jun 2015 21:02:37 +, DLearner wrote:
Out of curiosity, why can't D define a 2-dim array by something like:
int(2,1) foo;
which defines two elements referred to as:
foo(0,0) and foo(1,0)?
Work is being done on multidimensional slicing, see this thread:
On Tue, 30 Jun 2015 20:09:50 +, DLearner wrote:
Suppose:
'int [1][2] foo;'
Probably I misunderstand, but TDPL seems to say that foo has two
elements:
foo[0][0] and foo[1][0]
as opposed to two elements:
foo[0][0] and foo[0][1]
Is this correct?
No. The order of braces when
On Fri, 26 Jun 2015 19:26:56 +, Jack Stouffer wrote:
Thanks for the reply! I understand the reasoning now.
On Friday, 26 June 2015 at 18:46:03 UTC, Adam D. Ruppe wrote:
2) interfaces have an associated runtime cost, which ranges wanted to
avoid. They come with hidden function pointers
On Fri, 19 Jun 2015 13:27:13 +, Quentin Ladeveze wrote:
Is there any way to have a asTuple method in this struct that would
returns something like :
Tuple!(int, a, float, b, string, c)
and that will contain the values of the methods of the struct ?
Thanks.
You'll want to work
On Mon, 15 Jun 2015 04:06:12 +, Baz wrote:
On Monday, 15 June 2015 at 03:53:35 UTC, Yuxuan Shui wrote:
Is it possible to apply some operation on every member of a TypeTuple,
then get the result back?
Say I have a TypeTuple of array types, and I want a TypeTuple of their
element types,
On Mon, 15 Jun 2015 15:10:20 +, jmh530 wrote:
So I suppose I have two questions: 1) am I screwing up the cast, or is
there no way to convert the MapResult to float[], 2) should I just not
bother with map (I wrote an alternate, longer, version that doesn't use
map but returns float[]
On Tue, 09 Jun 2015 10:05:24 -0700, Andrei Alexandrescu wrote:
One would be a good pass of std.container, in particular (a) a design
review with the DbI glasses on; (b) better documentation - sadly it
seems to me so inadequate as to make containers themselves unusable; (c)
investigate use of
All those allocations aren't helping. Here's a much more idiomatic D
version:
import std.stdio, std.bigint;
import std.range;
void main() {
int n = 10;
auto fib1 = recurrence!(a[n-1] + a[n-2])(BigInt(0), BigInt
(1)).takeExactly(n);
auto fib2 = recurrence!(a[n-1] +
On Thu, 07 May 2015 23:10:26 +, PhilipDaniels wrote:
Why do the first two fail to compile but the last one does?! I cannot
see any difference between the 's2' case and the second case, it is a
completely mechanical source code transformation I have made.
formattedRead takes its input by
On Thu, 07 May 2015 16:55:42 -0400, Nick Sabalausky wrote:
// There's gotta be a better way to convert EnumMembers!T // to a
range, right? But std.range.only() didn't work, // due to a
template instantiation error.
T[] members;
foreach(m; EnumMembers!(T))
On Wed, 06 May 2015 19:52:42 +, Paul wrote:
On Wednesday, 6 May 2015 at 19:30:33 UTC, anonymous wrote:
On Wednesday, 6 May 2015 at 19:26:40 UTC, Paul wrote:
but I don't understand the syntax. dmd --help mentions -Llinkerflag
but what is '-L-L.' doing??
Passes '-L.' to the linker.
:D
On Wed, 06 May 2015 16:54:46 +, Luís Marques wrote:
* Regular expressions - I have no idea what you have in mind for this
one; even after looking at std.regex...
I meant both patterns and matches/captures.
* Tokens - On the one hand, I think this could be an excellent example,
since it's
How's this? http://dpaste.dzfl.pl/d6643ec8ccd3
On Tue, 05 May 2015 20:40:58 +, Luís Marques wrote:
could you come up with some type that would really benefit from being a
value type but that isn't numeric (or otherwise similar)?
Dates, times, durations, regular expressions, tokens, lazy generators,
digests, vectors, really any type
Arrrg, formatting got torn up. Here's a Dpaste:
http://dpaste.dzfl.pl/ca190950f199
A process for rounding numbers. This incarnation can be run like
round 1.23 3.4 4
or by reading lines from stdin. It could be simplified as an example by
getting rid of the argument-processing form. It shows off templated
function composition using std.functional.pipe, ct-regexes, and
On Thu, 30 Apr 2015 21:30:34 +, TheGag96 wrote:
Was the behavior of the remove() function changed recently? Thanks guys.
I believe remove has always worked this way. What you're seeing is
explained by this note in the documentation for remove:
The original array has remained of the same
Note that my solution relies on the pre-release version of std.uni, those
lazy functions aren't in the latest release.
On Tue, 28 Apr 2015 21:45:07 +, PhilipDaniels wrote:
Beginner question. Given
if (startsWith(input, 0x, 0X))
How do I turn that into a case-insensitive startsWith? startsWith says
it takes a predicate but I can't figure out how to pass it one. The
examples all use a == b !? These
On Tue, 28 Apr 2015 19:30:04 +, tcak wrote:
Is there any way to define a variable or an attribute as read-only
without defining a getter function/method for it?
Thoughts behind this question are:
1. For every reading, another function call process for CPU while it
could directly read
On Mon, 27 Apr 2015 23:30:11 +, Anonymouse wrote:
assumeBlog
Or perhaps, getting D-syntax specific, assumeUnique(wisdom)
On Mon, 27 Apr 2015 15:54:09 -0700, Andrei Alexandrescu wrote:
the metareferential You Are Reading
This Blog's Title is perhaps intriguing but difficult to talk about).
Any thoughts?
If you like meta-meta-referential, The Latter of the Two Hardest
Things[1]
The Internet Anagram Server, when
On Tue, 21 Apr 2015 18:34:35 +, Chris wrote:
Yeah, but I have to ask a stupid question. How do I add a PR? I've never
done it before.
This wiki page will walk you through it:
http://wiki.dlang.org/Pull_Requests
On Tue, 21 Apr 2015 15:36:27 +, Jadbox wrote:
What's the best equivalent to Rust's structural enum/pattern (match)ing?
Is it also possible to enforce exhaustive matches?
Basically, I'm curious on what the best way to do ADTs in D.
std.variant.Algebraic implements ADTs:
import
On Mon, 20 Apr 2015 22:50:52 +, Tofu Ninja wrote:
I am trying to write a template function that can take another function
as an alias template argument and duplicate its parameters for it self.
I tried..
auto pass(alias f, T...)(T t)
{
// other stuff... return f(t);
}
but
On Mon, 20 Apr 2015 20:14:34 +0200, Robert M. Münch wrote:
Hi, is there anything for D that supports generating tags files like
ctags does for C etc. ?
Dscanner: https://github.com/Hackerpilot/Dscanner#ctags-output
On Wed, 15 Apr 2015 07:27:49 +, Abdulhaq wrote:
On Tuesday, 14 April 2015 at 16:17:37 UTC, Justin Whear wrote:
EMSI is hiring for an Engineer II to work on D codebases:
https://
emsi.bamboohr.com/jobs/view.php?id=30
When it said Moscow I was thinking mmmh lots of traffic, a bit
Appender will take a range, so you can also do:
app.put([foo, var, bar]);
or
app.put(chain(foo, var, bar));
But yes, a variadic put would be convenient so long as it wasn't
ambiguous in some way.
On Wed, 15 Apr 2015 20:11:39 +, Ola Fosheim Grøstad wrote:
That fact puts Orwell's writings in a new light.
Oooh, an Animal Farm reference; spooky.
more concrete suggestions.
Cheers
Justin
EMSI is hiring for an Engineer II to work on D codebases: https://
emsi.bamboohr.com/jobs/view.php?id=30
On Tue, 24 Feb 2015 20:04:04 +, Almighty Bob wrote:
Is there a more accurate way to do a float and or double to string
than...
to!string(float);
As that seems to limit itself to 6 digits.
Use std.string.format or std.format.formattedWrite. std.format contains
a description of the
On Mon, 23 Feb 2015 20:21:19 +, Charles wrote:
My solution (150 characters, 15 points):
void main(){import std.stdio;int t,n;readf(
%d,t);while(t--){readf( %d,n);real
a=0,i=0;for(;in;i++)a+=(i%2?-1:1)/(i+i+1);writefln(%.15f,a);}}
Link to problem site:
On Tue, 03 Feb 2015 23:34:15 +, an wrote:
Pragmas can be used as attribute that doesn't affect the semantics. This
syntax is not supported in this DIP?
pragma(inline, true)
{
void foo() { }
void bar() { }
}
I assume it's covered by If this pragma is outside of a function, it
On Tue, 27 Jan 2015 20:46:59 +, bioinfornatics wrote:
void main(){
auto a = Alpha!(int)( 6);
auto b = Alpha!(string)( hello);
The Alpha struct is not a template, only the constructor is. Remove the
explicit instantiations and IFTI does the work:
void main(){
auto a =
On Fri, 23 Jan 2015 10:08:30 -0800, Andrei Alexandrescu wrote:
So H.S. Teoh awesomely took
https://github.com/D-Programming-Language/phobos/pull/2878 to
completion. We now have a working and fast relational group by
facility.
This is great news. It seems like every time I make use of
On Thu, 22 Jan 2015 13:40:56 -0800, Andrei Alexandrescu wrote:
There's this classic patter on Unix: |sort|uniq, i.e. sort some data and
only display the unique elements.
What would be a better integrated version - one that does sorting and
uniq in one shot? I suspect the combination could
On Thu, 22 Jan 2015 21:04:04 +, Kiith-Sa wrote:
Could you put this up on GitHub/dub? Even if simple this could be very
useful.
Added some features and a dynamic array implementation, put it up here:
https://github.com/economicmodeling/soa
On Thu, 22 Jan 2015 19:26:44 +, ddos wrote:
hi guys, firstly this has no direct application, i'm just playing around
and learning
i want to create 100 uniform distributed numbers and print them my first
attempt, just written by intuition:
[0 .. 100].map!(v = uniform(0.0, 1.0).writeln);
On Thu, 22 Jan 2015 18:03:31 +, Justin Whear wrote:
On Thu, 22 Jan 2015 17:40:17 +, Justin Whear wrote:
I just whacked this out in D: http://dpaste.dzfl.pl/90d96cf05792
Remembered the allMembers trait, using a pointer to parent, etc: http://
dpaste.dzfl.pl/6fd66ae9b767
OK, I'm
On Thu, 22 Jan 2015 17:40:17 +, Justin Whear wrote:
I just whacked this out in D: http://dpaste.dzfl.pl/90d96cf05792
Remembered the allMembers trait, using a pointer to parent, etc: http://
dpaste.dzfl.pl/6fd66ae9b767
On Wed, 21 Jan 2015 19:12:20 +, Fool wrote:
Jonathan Blow published another video [1] presenting the progress of his
language. He is treating two main topics:
- a keyword preliminary called 'using' which seems to be quite
close to 'alias this';
- an annotation SOA for pointers and
On Fri, 09 Jan 2015 13:50:28 +, eles wrote:
https://codegolf.stackexchange.com/questions/44278/debunking-
stroustrups-debunking-of-the-myth-c-is-for-large-complicated-pro
Was excited to give it a try, then remembered...std.xml :(
On Fri, 09 Jan 2015 17:18:42 +, Adam D. Ruppe wrote:
Huh, looking at the answers on the website, they're mostly using regular
expressions. Weaksauce. And wrong - they don't find ALL the links, they
find the absolute HTTP urls!
Yes, I noticed that. `script src=http://app.js`/script` isn't
On Thu, 08 Jan 2015 23:02:26 +0200, ketmar via Digitalmars-d wrote:
but yes, i want to create an impression that timewasters are not
welcome.
Ironically this is exactly why I'm putting you on my ignored authors list.
--Justin
On Wed, 07 Jan 2015 16:38:23 +, Suliman wrote:
I except that writefln have some behavior as string concatenation, but
it does not.
IS there any way to put needed values in place of %s in string?
std.string.format interpolates string with the same behavior as writefln
but returns the
On Mon, 05 Jan 2015 17:47:09 +, Dominikus Dittes Scherkl wrote:
Is it possible to use static if in a template structure to have some
member functions only for specific types?
Yep. This is actually a frequently used pattern in functions that return
ranges.
I'm trying to build components that I can dynamically link and keep
running into an issue with sharing modules between the host and the
pluggable components. Assuming a layout like this:
host.d -- loads components at runtime
a.d -- a module that builds to `a.so`
b.d -- a module
1 - 100 of 1021 matches
Mail list logo
