On 06/08/2018 10:52 AM, Flaze07 wrote:
ah...well thank you, well...I did finds another way, but it is probably
better to use linearRemove
I used
arr = make!( Array!uint )( remove( arr[], 2 );
so linearRemove is probably better
Instead of creating a new array, you could update the length of the
On Wednesday, 6 June 2018 at 14:46:56 UTC, ag0aep6g wrote:
On 06/06/2018 04:20 PM, Flaze07 wrote:
hmm, and sorry for asking more, what about removing an element
from it ? I found no remove operation that can remove from the
middle ( removeAny and removeBack both removes the latest
element, lin
On 06/06/2018 04:20 PM, Flaze07 wrote:
hmm, and sorry for asking more, what about removing an element from it ?
I found no remove operation that can remove from the middle ( removeAny
and removeBack both removes the latest element, linearRemove receive
Array!uint...which don't know how to prov
On 6/6/18 10:20 AM, Flaze07 wrote:
On Wednesday, 6 June 2018 at 14:06:54 UTC, rikki cattermole wrote:
On 07/06/2018 1:58 AM, Flaze07 wrote:
On Wednesday, 6 June 2018 at 13:46:41 UTC, Adam D. Ruppe wrote:
On Wednesday, 6 June 2018 at 13:44:09 UTC, Flaze07 wrote:
sort( arr.Range );
don't work,
On Wednesday, 6 June 2018 at 14:29:28 UTC, rikki cattermole wrote:
On 07/06/2018 2:27 AM, Flaze07 wrote:
On Wednesday, 6 June 2018 at 14:24:15 UTC, rikki cattermole
wrote:
On 07/06/2018 2:20 AM, Flaze07 wrote:
On Wednesday, 6 June 2018 at 14:06:54 UTC, rikki cattermole
wrote:
[...]
hmm, and
On 07/06/2018 2:27 AM, Flaze07 wrote:
On Wednesday, 6 June 2018 at 14:24:15 UTC, rikki cattermole wrote:
On 07/06/2018 2:20 AM, Flaze07 wrote:
On Wednesday, 6 June 2018 at 14:06:54 UTC, rikki cattermole wrote:
On 07/06/2018 1:58 AM, Flaze07 wrote:
[...]
Yes.
hmm, and sorry for asking more
On Wednesday, 6 June 2018 at 14:24:15 UTC, rikki cattermole wrote:
On 07/06/2018 2:20 AM, Flaze07 wrote:
On Wednesday, 6 June 2018 at 14:06:54 UTC, rikki cattermole
wrote:
On 07/06/2018 1:58 AM, Flaze07 wrote:
[...]
Yes.
hmm, and sorry for asking more, what about removing an element
from
On 07/06/2018 2:20 AM, Flaze07 wrote:
On Wednesday, 6 June 2018 at 14:06:54 UTC, rikki cattermole wrote:
On 07/06/2018 1:58 AM, Flaze07 wrote:
On Wednesday, 6 June 2018 at 13:46:41 UTC, Adam D. Ruppe wrote:
On Wednesday, 6 June 2018 at 13:44:09 UTC, Flaze07 wrote:
sort( arr.Range );
don't wor
On Wednesday, 6 June 2018 at 14:06:54 UTC, rikki cattermole wrote:
On 07/06/2018 1:58 AM, Flaze07 wrote:
On Wednesday, 6 June 2018 at 13:46:41 UTC, Adam D. Ruppe wrote:
On Wednesday, 6 June 2018 at 13:44:09 UTC, Flaze07 wrote:
sort( arr.Range );
don't work, it says cannot pass RangeT!(Array!ui
On 07/06/2018 1:58 AM, Flaze07 wrote:
On Wednesday, 6 June 2018 at 13:46:41 UTC, Adam D. Ruppe wrote:
On Wednesday, 6 June 2018 at 13:44:09 UTC, Flaze07 wrote:
sort( arr.Range );
don't work, it says cannot pass RangeT!(Array!uint) as function argument
Range is the type, you want the value
I
On Wednesday, 6 June 2018 at 13:46:41 UTC, Adam D. Ruppe wrote:
On Wednesday, 6 June 2018 at 13:44:09 UTC, Flaze07 wrote:
sort( arr.Range );
don't work, it says cannot pass RangeT!(Array!uint) as
function argument
Range is the type, you want the value
I think you can do
sort(arr[])
maybe
On Wednesday, 6 June 2018 at 13:44:09 UTC, Flaze07 wrote:
sort( arr.Range );
don't work, it says cannot pass RangeT!(Array!uint) as function
argument
Range is the type, you want the value
I think you can do
sort(arr[])
maybe
I know that sort accepts Range( I am correct right ? ), so,
Array!uint arr;
//inserts element to arr
sort( arr.Range );
don't work, it says cannot pass RangeT!(Array!uint) as function
argument
On Wednesday, 13 December 2017 at 15:58:40 UTC, Vino wrote:
On Wednesday, 13 December 2017 at 15:16:50 UTC, Vino wrote:
Hi All,
Request your help, on how to sort a tuple container array, I
have raised the same topic in one of the other thread "Tuple
Array Sorting" and was addres
On Wednesday, 13 December 2017 at 15:16:50 UTC, Vino wrote:
Hi All,
Request your help, on how to sort a tuple container array, I
have raised the same topic in one of the other thread "Tuple
Array Sorting" and was addressed to use standard array rather
than container array, and i a
Hi All,
Request your help, on how to sort a tuple container array, I
have raised the same topic in one of the other thread "Tuple
Array Sorting" and was addressed to use standard array rather
than container array, and i am not able to find any document or
example in the library fo
On Monday, 18 September 2017 at 11:47:07 UTC, Vino.B wrote:
Hi All,
Can some one explain me on the below question.
Q1: void main (Array!string args) : Why can't we use container
array in void main?
Q2: What is the difference between the below?
insert, insertBack
stableI
Hi All,
Can some one explain me on the below question.
Q1: void main (Array!string args) : Why can't we use container
array in void main?
Q2: What is the difference between the below?
insert, insertBack
stableInsert, stableInsertBack
linearInsert, stableLinearInsert, stableLinearInser
converting all my standard
array to container array. My program has 5 function and I was
able to adopt 4 function to container array, and facing issue
with this 1 function. I would like to have all my function to
be neither in standard array nor in container array, more over
I am facing gc issue in
;, 1));
// Only if Array is really needed:
import std.container : Array;
auto arr = Array!DirInfo(coSizeDirList("./deleteme", 42));
writeln(arr[]);
}
Ali
Hi Ali,
As stated earlier my release 1 code are still using
std.array, so now in release 2 i am converting all m
td.container : Array;
auto arr = Array!DirInfo(coSizeDirList("./deleteme", 42));
writeln(arr[]);
}
Ali
Hi Ali,
As stated earlier my release 1 code are still using std.array,
so now in release 2 i am converting all my standard array to
container array. My program has 5
On 09/07/2017 11:21 PM, Vino.B wrote:
> At last was able to print the output, but i am getting some
> "Deprecation" warnings like below and also can you help me in formating
> the output to display ulong.
>
> Output:
> Size.d(9): Deprecation: std.container.array.RangeT(A) is not visible
> from
On Thursday, 7 September 2017 at 20:47:43 UTC, Ali Çehreli wrote:
On 09/07/2017 10:39 AM, Vino.B wrote:
> Array!(Tuple!(string, ulong)) coSizeDirList () {
You stated the return type explicitly above.
> return tuple (dFiles[], Subdata[]);
According to the error message, what is bei
On 09/07/2017 10:39 AM, Vino.B wrote:
> Array!(Tuple!(string, ulong)) coSizeDirList () {
You stated the return type explicitly above.
> return tuple (dFiles[], Subdata[]);
According to the error message, what is being returned does not have the
same type:
> Test1.d(27): Error: c
On Thursday, 7 September 2017 at 17:12:14 UTC, Vino.B wrote:
On Thursday, 7 September 2017 at 15:07:56 UTC, Vino.B wrote:
On Thursday, 7 September 2017 at 14:26:08 UTC, Ali Çehreli
wrote:
On 09/07/2017 03:56 AM, Vino.B wrote:
writeln(coCleanFiles);
Access the elements by taking a slice of t
On Thursday, 7 September 2017 at 15:07:56 UTC, Vino.B wrote:
On Thursday, 7 September 2017 at 14:26:08 UTC, Ali Çehreli
wrote:
On 09/07/2017 03:56 AM, Vino.B wrote:
writeln(coCleanFiles);
Access the elements by taking a slice of the container:
writeln(coCleanFiles[]);
Ali
Hi Ali,
T
On Thursday, 7 September 2017 at 14:26:08 UTC, Ali Çehreli wrote:
On 09/07/2017 03:56 AM, Vino.B wrote:
writeln(coCleanFiles);
Access the elements by taking a slice of the container:
writeln(coCleanFiles[]);
Ali
Hi Ali,
Thank you very much, was ablee to resolve this issue and now
f
On 09/07/2017 03:56 AM, Vino.B wrote:
writeln(coCleanFiles);
Access the elements by taking a slice of the container:
writeln(coCleanFiles[]);
Ali
).map!(a => tuple(a.name,
a.size));
foreach(d; dFiles)
writeln(d[0], "\t", d[1]);
}
}
From,
Vino.B
Hi,
I tried a small code using container array, and the output i
get form the code is a below, so can one help me on this issue.
Program:
impo
HI All,
Can some one provide me a example of how to use the
std.container.array for the below code.
import std.algorithm: filter, map;
import std.file: SpanMode, dirEntries, isDir;
import std.stdio: writeln;
import std.typecons: tuple;
import std.array: array;
void main () {
string[] Filesy
Even better would be if phobos provided it out of the box:
---
import std.stdio;
import std.algorithm;
import std.array;
import std.string;
import std.conv;
void stripStringArrayInPlace(T)(T[] ar){for(long i=0,
len=ar.length; i < len; ++i) ar[i] = ar[i].strip;}
T[] stripStringArray
Thanks so much it's a bit more bloated than I was expecting but
it works.
---
void main() {
import std.stdio;
import std.algorithm;
import std.array;
import std.string;
import std.conv;
auto ar = [" dad ", " blue "];
ar.writeln;
auto arStriped = ar.map!strip.a
On 10/15/2014 04:26 PM, Domingo wrote:
Ideally I want to use something like this:
import std.stdio;
import std.string;
import std.algorithm;
import std.conv;
void main()
{
string[] ar = [" dad ", " blue "];
writeln(typeid(ar));
// a) foreach for purely side-effect expressions:
Domingo:
Ideally I want to use something like this:
-
import std.stdio;
import std.string;
import std.algorithm;
import std.conv;
void main()
{
string[] ar = [" dad ", " blue "];
writeln(typeid(ar));
//ar.each(writeln);
//ar.map!writeln;
Ideally I want to use something like this:
-
import std.stdio;
import std.string;
import std.algorithm;
import std.conv;
void main()
{
string[] ar = [" dad ", " blue "];
writeln(typeid(ar));
//ar.each(writeln);
//ar.map!writeln;
//ar.apply!
35 matches
Mail list logo
