理解Pointers In C++:第一重
int foo;
int *foo_ptr = &foo;
Grammatrically speaking, there is no such thing as a “pointer variable”: all variables are the same.
There are, however, variables with different types. foo
's type is int
. foo_ptr
's type is int *
.
The point of that is that “the pointer is not the variable!
”. The pointer to foo
is the contents of foo_ptr
.
The pointer has a type, too, by the way. Its type is int
. Thus it is an "int
pointer" (a pointer to int
: int *ptr
).
An int **
's type is int *
(it points to a pointer to int
). The use of pointers to pointers is called multiple indirection.
-
Multiple variables
int *ptr_a, not_ptr_b;
In this way,
not_ptr_b
is not a pointer.*
operator belongs to the variable and not to the type, this is something that could be quite confusing. -
d
A pointer needs to be initialized before its used if you don’t want it to use some other objects address.
When initializaing a pointer you do it with the new operator, this is called dynamic allocation as it is done in runtime and not compile time.
char * c = new char; // dynamic alloc (one char)
A common mistake is thinking that you can use uninitialized pointers.
int *ip;
*ip = 12; // Gives error!
When you dynamically assign memory to objects you should be careful to return the memory by delete
. If you don’t return memory it becomes a spaceleak in your program since no other object can now occupy the space you used.
delete c; // deletes space pointer used
foo_ptr = 42;
This is a wrong way. Compiler usually warn when you try to assign an int
to a pointer variable. gcc
will say “warning: initialization makes pointer from integer without a cast
”.
int bar = *foo_ptr;
*foo_ptr = 42; // store operation
The dereference operator *
looks up the value that exists at an address.
int array[] = {45, 67, 89};
-
decaying
One neat feature of C is that, in most places, when you use the name array again, you will actually be using a pointer to its first element (in C temrs,
&array[0]
), this is called “decaying”: the array decays to a pointer.Decaying
is an implicit&
;array == &array == &array[0]
. In English, these expressions read “array”, “pointer to array”, and “pointer to the first element of array” , the subscript operator [] has higher precedence than the address-of operator. -
Difference between array and pointer
- assigning to the name
array
- passing it to the
sizeof
operator
- assigning to the name
-
points
-
passing an array to function
When you pass an array as an argument to a function, you really pass a pointer to the array’s first element, because the array decays to a pointer. You can only give
cout
(which likeprintf
in C) the pointer, not the whole array. This is why cout has no way to print an array: It would need you to tell it the type of what’s in the array and how many elements there are, and both the format string and the list of arguments would quickly get confusing. -
d
-
d
-
There is no such thing as C++ pointers. C++ is just a brand name. There are pointers. They always exist regardless of whether you’re using C++ or not. C++ grudgingly(勉强) exposes them to you; some high-level languages hide them from you. But they are always there, covertly or overtly.
Pointers Are Just Numbers.
In addition to being just number, you can also think of a pointer as being the address, or the label, of a specific byte in computer memory.
Since the pointers are the memory locations, why can’t we just remember the addresses of all the data we need, directly?
Well – honestly – until the 1980s, that is actually the way we all used to write code. When you only have 256 bytes of memory available, that’s not a lot of memory to keep track of. So we didn’t need pointers so much. You just had to remember the address of where you put evernthing, and put it there ***directly***.
But as memory got bigger, and programs got more complex, we needed some way to abstract that complexity. So now we prefer to store data ***indirectly***, using indrect addressing.
Nowadays, your cell phone has several hundred billion bytes lay around. So, code uses pointers, and pointers to pointers, and pointers to pointers to variables, and pointers to pointers to arrays of functions, and on and on like that, to keep all those code responsibilities clear.
Computers have always been very good at addressing bytes indirectly.
The assembly language of all modern CPUs lets you access data indirectly.
So, to really grok pointers, I suggest that you ignore C++ and other high level languages, and start doing a little programming in assembly language.
I know that learning assembly sounds like a huge detour, but I promise that the time you spend won’t be wasted.
Assembly programming is a pointer party, all day long.
Assembly programming is not safe, per se. There are no adults around anymore, to keep you from jabbing your own eye out with a pointer. C++ puts pointers on a high cabinet and says, clam down children, I’s the grown-up here and I will manage all the details of your pointers for you.
But assemblyy language is fast and fun as hell. When you feel the need… the need for speed… you’ll want to start manipulating pointers directly from assembly language.
From wikipedia, a pointer in computer science is an object that stores a memory address. This can be that of another located in computer memory, or in some cases, that of memory-mapped computer hardware.
A pointer references
a location in memory, and obtaining the value stored at that location is known as dereferencing
the pointer.
-
History
In 1955, Soviet computer scientist Kateryna Yushchenko invented the Address programming language that made possible indirect addressing and addresses of the highest rank - analogous to pointers. This language was widely used on the Soviet Union computers. However, it was unknown outside the Soviet Union and usually Harold Lawson is credited with the invention, in 1964, of the pointer.
-
A Pointer is a kind of reference
In computer science, a
reference
is a value that enables a program to indirectly access a particular datum, such as a variable’s value or a record, in the computer’s memory or in some other storage device. Thereference
is said to refer to the datum, and accessing the datum is calleddereferencing
the reference.datum :
Datum is, from its Latin origin, a singular form of “data”. From “data” in wikipedia, data are characteristics or information ,usually numberical, that are collected through observation. In a more technical sense, data is a set of values of qualitative or quantitative variables about one or more persons or objects, while a datum (singular of data) is a single value of a single variable.
A data
primitive
is any datum that can be read from or written to computer memory using one memory access(for instance, both abyte
and aword
are primitives).A data
aggregate
is a group of primitives that are logically contiguouse in memory and that are viewed collectively as one datum. When an aggregate is entirely composed of the same type of primitive, the aggregate may be called anarray
.A byte is the smallest primitive; each memory address specifies a different byte. The memory address of the initial byte of a datum is considered the memory address (or base memory address) of the entire datum.