In most languages there is some sort of List<T> type, is that the same for D?

On 12/10/22 12:46 AM, thebluepandabear wrote:

D doesn't focus on interfaces, we have concepts, like ranges.

Sorry, it's hard to answer your question without asking more questions: are you looking for a linked list? A list API? A specific list interface?

-Steve

On Saturday, 10 December 2022 at 05:54:09 UTC, Steven Schveighoffer wrote:

I was wondering more if there is an object oriented way of creating arrays, like in Java there is an ArrayList, in C++ there is std::vector, etc.

On 12/10/22 1:11 AM, thebluepandabear wrote:

In D, you just use T[] for an array, it's similar to std::vector<T>.

-Steve

On Saturday, 10 December 2022 at 05:46:26 UTC, thebluepandabear wrote:

The standard library has many possibilities, including linked lists. What about the news from the range...

In D, the concept of range is very advanced. Now I'm going to show you 3 examples and two of them are from the standard library and the other is a nice wrap:

struct List(A) {
  A[] *arr;

  auto put(R)(R value) { (*arr) ~= value; }
  auto length() { return (*arr).length; }

  auto empty() {
    import std.range : empty;
    return (*arr).empty;
  }

  auto front() {
    import std.range : item = front;//back;
    return (*arr).item;
  }

  void popFront() {
    import std.range : next = popFront;//popBack
    (*arr).next;
  }
}

auto listHelper(A)(return ref A[] arr) {
  return List!A(&arr);
}

alias immutable(char[]) [] strings;

void main() {
  strings myNames = ["El-Mevla", "Hodja", "Nasreddin",
                     "Sivrihisar", "Shemseddin",
                     "Nasruddin", "Nusrat"];
  strings list;
  auto myList1 = listHelper(list);

  import std.range;
  auto myList2 = appender!strings;

  import std.container.array;
  auto myList3 = Array!string();

  foreach(name; myNames)
  {
    myList1.put(name);
    myList2.put(name);
    myList3.insert(name);
  }

  void rangePrint(R)(R range)
  {
    import std.stdio;
    size_t i = 1;
    foreach(item; range)
    {
      writeln(i++, ": ", item);
    }
    writeln;
  }

  rangePrint(myList1);
  rangePrint(myList2);
  rangePrint(myList3);
}

SDB@79

On Saturday, 10 December 2022 at 19:49:23 UTC, Salih Dincer wrote:

Can the range be partially traversed? That is, suppose we only access the [3,5) elements?

On Sunday, 11 December 2022 at 03:13:17 UTC, zjh wrote:

Certainly, there are many ways to do this. For example:

  //...
  myList1.skipRange(3).rangePrint; /*
    1: Sivrihisar
    2: Shemseddin
    3: Nasruddin
    4: Nusrat
  */
  myNames[3..5].rangePrint; /*
    1: Sivrihisar
    2: Shemseddin
  */
}

auto skipRange(R)(R range, size_t value)
{
  size_t loop = value;
  while(!range.empty && loop--)
  {
    range.popFront();
  }
  return range;
}

void rangePrint(R)(R range)
{
  import std.stdio;
  size_t i = 1;
  foreach(item; range)
  {
    writeln(i++, ": ", item);
  }
  writeln;
}

SDB@79

On Sunday, 11 December 2022 at 07:47:35 UTC, Salih Dincer wrote:

Thank you for your reply. I think if you take random values frequently, you'd better use 'array',am I right?

On Saturday, 10 December 2022 at 05:46:26 UTC, thebluepandabear wrote:

There is: https://dlang.org/phobos/std_container_dlist.html

Why is it called DList and not just List, i have no clue