000 | 01232nab a22002537 4500 | ||
---|---|---|---|
001 | H004.415 JOU | ||
003 | AR-sfUTN | ||
008 | 190909b xx |||p|r|||| 00| 0 spa d | ||
040 | _cAR-sfUTN | ||
080 | _aH004.415 JOU | ||
100 | _aKoenig, Andrew | ||
700 | _aMoo, Barbara E. | ||
245 | _aRethinking how to teach C++--part 7: Payback time | ||
336 |
_2rdacontent _atexto _btxt |
||
337 |
_2rdamedia _asin mediaciĆ³n _bn |
||
338 |
_2rdacarrier _avolumen _bnc |
||
505 | _aThe usual way to implement data structures that refer to elements of other data structures is by using pointers, and we haven't talked about these yet. Indeed, Accelerated C++ won't talk about pointers for another 68 pages. Nevertheless, we have enough intellectual ammunition to solve this space problem without pointers, using data structures that refer to other data structures, and in a way we think is every bit as compact and efficient as it would be if we were to use pointers | ||
650 | _aTEACHING | ||
650 | _aMethods | ||
650 | _aLANGUAGE C++ | ||
773 |
_tJOOP : the journal of object-oriented programming _wH004.415 JOU _nS.T.:H004.415 JOU PP3433 _g(vol. 14, nro. 1, May. 2001), p. 36-40 |
||
942 | _cAN | ||
999 |
_c37441 _d37441 |