But that's because they wanted it to be like that.
To me, this code is very unclear:
int a, *b, c, d;
because everywhere else, multiple declarations in one statement all have the exact same type, but for some reason pointers get special treatment so that you can declare variables of type X and variables that are pointers to type X in the same statement, which just seems odd to me.I'd be much happier if they were all strictly different and that
int* a, b, c, d;
did, in fact, declare all four variables to be pointer to int.It's not just pointers:
int a, *b, c(); char buffer[16], *ptr = &buffer[0]; // declare an array and a pointer into itThat being said, most languages which disambiguate between int[5] and int[7] provide some kind of polymorphism (and usually store it as a struct of size + data, to enable that).
For example: you can define a first function that goes from t[N]->t pretty easily, and it would operate on both int[5] and int[7] (returning an int).
// error: expected an array with a fixed size of 5
// elements, found one with 7 elements
let x: [i32; 5] = [1,2,3,4,5,6,7];like, you can have a type (a, b), and b can, of course, be of type (a, b), b again having type (a, b), and so on. then you always carry around the length encoded in the type, and it can be checked like above.
ghc has a limit on tuple sizes, and haskell makes no type distinction between [a] based on the number of elements in it, and it isn't dependently typed.
but again i don't know rust.
> i read a bit about fixed size arrays in it and the fact
> that 32 is the largest fixed size array
This is exceptionally mistaken, where did you read it? Arrays in Rust top out at the maximum value of a platform-sized pointer, which is either 2^32 or 2^64 depending on platform.Clone (only if T: Copy) Debug IntoIterator (implemented for &[T; N] and &mut [T; N]) PartialEq, PartialOrd, Eq, Ord Hash AsRef, AsMut Borrow, BorrowMut Default This limitation on the size N exists because Rust does not yet support code that is generic over the size of an array type. [Foo; 3] and [Bar; 3] are instances of same generic type [T; 3], but [Foo; 3] and [Foo; 5] are entirely different types. As a stopgap, trait implementations are statically generated up to size 32."
from the rust docs. https://doc.rust-lang.org/std/primitive.array.html
i sort of leapt to the conclusion that these traits couldn't be implemented because generically because the type system requires them to be implemented for each size of N, and they provide the first 32 as a nicety. the similarity to the situation with tuples in haskell, (http://stackoverflow.com/questions/2978389/haskell-tuple-siz...), and the fact that rust doesn't have dependent types and so a type couldn't depend on a value, and i just kind of guessed at a possible reason.
Regardless of what the spec or the compiler says, you the programmer absolutely need to treat them separately. Especially in a language like C, where arrays aren't even self-describing at runtime.
arr and arr2 are indeed distinct types. They are of type int[5] and int[7]. You can see this by checking that they have different sizes, or that `printf("%s\n", std::is_same<decltype(arr), decltype(arr2)>::value ? "true" : "false");` will outputs `false` on your screen.
Both of them decay into a pointer to int, that is why people commonly confuse them with pointers. But they are pointer types; they are distinct types on their own.
#include <stdio.h>
#define is_same(T, x) _Generic((x), T: "true", default: "false")
int main(void) {
int arr[5];
int arr2[7];
printf("arr === int[5] -> %s\n", is_same(int[5], arr));
printf("arr === int[7] -> %s\n", is_same(int[7], arr));
printf("arr2 === int[5] -> %s\n", is_same(int[5], arr2));
printf("arr2 === int[7] -> %s\n", is_same(int[7], arr2));
return 0;
}
produces arr === int[5] -> true
arr === int[7] -> false
arr2 === int[5] -> false
arr2 === int[7] -> true
Unfortunately either clang or GCC (I can't remember) decided the obvious behavior was wrong and changed it so that _Generic behaved as-if array expressions decayed to pointers. The C11 specification for _Generic was insufficiently precise, and for various reasons both vendors and (IIRC) the C committee are going to go with the least common denominator approach (just treat them like pointers) for consistency.So newer versions of clang and GCC print out all false.
But another way of showing that arrays are real types is with
#include <stdio.h>
#define countof(a) (sizeof (a) / sizeof *(a))
int main(void) {
int arr[5];
int arr2[7];
printf("countof(arr) -> %zu\n", countof(arr));
printf("countof(*&arr) -> %zu\n", countof(*&arr));
printf("countof(arr2) -> %zu\n", countof(arr2));
printf("countof(*&arr2) -> %zu\n", countof(*&arr2));
return 0;
}
which produces countof(arr) -> 5
countof(*&arr) -> 5
countof(arr2) -> 7
countof(*&arr2) -> 7
on all version of clang and GCC, and should on any other conformant C compiler. Although I would think that the simple sizeof proof should suffice to show that arrays are real types, notwithstanding that their evaluation rules are peculiar.Alas, the disaster with _Generic and array expressions only proves that the situation is less than ideal. Although part of the problem is that _Generic was a novel language feature that didn't fit neatly into the historical translation phases. IMO C++ gets a lot of things wrong about C semantics, but apparently they got decltype right (presuming the behavior is a product of a clearer specification, and that behavior is consistent across implementations).
To be fair, although inelegant the compromise behavior for _Generic makes some sense. The principle use for _Generic is to implement crude function overloading. Because arrays always decay to pointers when passed to functions, it's convenient that _Generic would capture array expressions as pointers. OTOH, it makes some useful behaviors impossible. And the convenient behavior could have been had by manually coercing arrays to pointers using a trick like:
#define decay(arr) ((0)? 0 : (arr))
#define is_same(T, x) _Generic(decay(x), ...)Then you could easily get creature comforts such as:
typedef uint8_t[16] guid_t;
typedef uint8_t[20] sha1_digest_t;
These typedefs would then have copy assignment, pass-by-value semantics and everything else you'd expect from value types. > typedef uint8_t[16] guid_t;
> typedef uint8_t[20] sha1_digest_t;
> These typedefs would then have copy assignment, pass-by-value semantics and everything else you'd expect from value types.What does this accomplish that a struct can't?
For what is worth, they are really different types in C++ (they can still decay to pointers for compatibility with C).
edit: netheril96 pointed out exactly the same thing.
On the other hand I agree that:
makes more sense than more commonly used: although it's messed up anyway as: will result in a surprise.