How would you call an array [1, 2, 3, 4, 5, ...] that has (and ensures) the property of not having any undefined values through all its length.
"Dense" could work but it's not exactly what I mean, as it has more to do with zero/non-zero values.
$\begingroup$
$\endgroup$
5
-
3$\begingroup$ What about "initialized"? Let A be an array in which each element has been initialized. Let A be an array with no uninitialized elements. $\endgroup$ – Steven Jan 30 at 23:58
-
$\begingroup$ Are you just looking for a generic term or asking if there is already a defined term. If general, Perhaps a "comprehensive array"? $\endgroup$ – Sidnee Feb 1 at 5:27
-
1$\begingroup$ If you think of an array as a function, an array with no undefined values is a total function. Just a thought. $\endgroup$ – Pseudonym Feb 1 at 5:35
-
$\begingroup$ (@Steven: there's a start, but what about assigning undefined values to elements later on? I read no undefined, not no uninitialised.) $\endgroup$ – greybeard Feb 1 at 11:08
-
$\begingroup$ @Pseudonym That's also how I see it, 'total' seems like a good choice for a word. Care to submit it as an answer? $\endgroup$ – almosnow Feb 1 at 13:04
Add a comment
|
$\begingroup$
$\endgroup$
1
The data structure itself is unambiguously called a contiguous array. Depending on the context and language I would call it "initialized" or "having only non-null elements" or similar to describe the contents.
-
$\begingroup$ Thanks @orlp, I'm gonna go with the 'total' suggestion as 'contiguous' is more related to memory allocation than what I'm trying to convey. $\endgroup$ – almosnow Feb 1 at 13:06
