[big picture] ranges as feature sets and indexing

[crazymonkyyy]

enum isRange(R)=is(typeof(
	(R r){
		if(r.empty)return r.front;
		r.popFront;// or just pop?
		return r.front;
	}));
enum hasIndex(R)=is(typeof((R r)=>r.index));

I prefer working with arrays when ever possible but allot of "sicp" and related work are often more functional and based on linked lists.

This carried forward to the "range hierarchy" where in order to make an array-like range("randomAccess") youd need to also make a doubly linked list like array functions. I believe this was a massive mistake, I will complain about this endlessly.

I believe this is part of why there so few data structures(its extra work to make algorithms use an array, and your arrays to be ranges), why searching had bad names and design(string.byUnicode.countUntil, will be wrong, those airnt the words people think in, and maybe related to autodecoding being considered so bad)

so instead of a hierarchy Id suggest ven diagrams and one of those bubbles is indexing