comp.lang.c++
http://groups.google.com/group/comp.lang.c++?hl=en
comp.lang.c++@googlegroups.com
Today's topics:
* show all subset of a set - 1 messages, 1 author
http://groups.google.com/group/comp.lang.c++/t/708873746ae8ae59?hl=en
* Return by reference - 8 messages, 6 authors
http://groups.google.com/group/comp.lang.c++/t/f6dd94c3223a1dbf?hl=en
* Top 20 coding interview problems asked in Google with solutions: Algorithmic
Approach - 1 messages, 1 author
http://groups.google.com/group/comp.lang.c++/t/f0866a8c45ecb553?hl=en
* Cracking Programming Interviews: 500 Questions with Solutions - 1 messages,
1 author
http://groups.google.com/group/comp.lang.c++/t/4532417d39af96b4?hl=en
* Getting Started with a Visual Studio C++ 2013 IDE - 1 messages, 1 author
http://groups.google.com/group/comp.lang.c++/t/6af661da9c3466bf?hl=en
* about gets - 3 messages, 3 authors
http://groups.google.com/group/comp.lang.c++/t/0335e4afbf8afe82?hl=en
* beginner - 5 messages, 5 authors
http://groups.google.com/group/comp.lang.c++/t/764088b8acc86a74?hl=en
* pointer to a vector - 5 messages, 3 authors
http://groups.google.com/group/comp.lang.c++/t/b17f744707f37fdb?hl=en
==============================================================================
TOPIC: show all subset of a set
http://groups.google.com/group/comp.lang.c++/t/708873746ae8ae59?hl=en
==============================================================================
== 1 of 1 ==
Date: Sun, Feb 9 2014 4:20 am
From: Öö Tiib
On Sunday, 9 February 2014 13:46:59 UTC+2, Stefan Ram wrote:
> Öö Tiib <ootiib@hot.ee> writes:
> >It is quite optimal to use 'enum', 'std::bitset<32>' or just
>
> With <cstdint>::std::uint_least64_t one can do arithmetics
> and get the next state by just »++«.
Yes, that was my original point in start of this sub-thread.
In practice we rarely need to order states of set (nothing to
talk of finding next state of set). In practice we usually
need to insert, erase and count elements in it.
Inserting to integral variable used as set is done with '|='
erasing with '&=~' but efficient counting is tricky and I
bet that 'std::bitset' does it more efficiently than algorithm
of average Joe. ;)
==============================================================================
TOPIC: Return by reference
http://groups.google.com/group/comp.lang.c++/t/f6dd94c3223a1dbf?hl=en
==============================================================================
== 1 of 8 ==
Date: Sun, Feb 9 2014 4:58 am
From: Jorgen Grahn
On Sun, 2014-02-09, Marcel Müller wrote:
> On 09.02.14 12.50, Giuliano Bertoletti wrote:
>> which is the difference of calling?
>>
>> ==================
>> MyClass c;
>>
>> SubObject &sub = c.GetSubObject();
>> SubObject sub = c.GetSubObject();
>> ==================
>
> The second line creates a copy of SubObject. It is in fact another
> syntax for the following constructor call:
>
> SubObject sub(GetSubObject());
>
> This /might/ be expensive if copying SubObject is expensive. Furthermore
> changes to sub do not apply to c.GetSubObject().
>
> In general you should prefer references for non-trivial data types
> unless you have good reasons not to do so.
Depends a lot on the circumstances. If it's clear that the lifetime
of 'SubObject& sub' is shorter than whatever it's referencing, then
sure. If not ... very bad things can happen if the object dies and he
uses that reference to it.
/Jorgen
--
// Jorgen Grahn <grahn@ Oo o. . .
\X/ snipabacken.se> O o .
== 2 of 8 ==
Date: Sun, Feb 9 2014 4:05 am
From: Luca Risolia
Jorgen Grahn wrote:
> Depends a lot on the circumstances. If it's clear that the lifetime
> of 'SubObject& sub' is shorter than whatever it's referencing, then
> sure. If not ... very bad things can happen if the object dies and he
> uses that reference to it.
class MyClass : public std::enable_shared_from_this<MyClass> {
public:
Object obj;
public:
std::shared_ptr<SubObject> GetSubObject() {
return std::shared_ptr<SubObject>(shared_from_this(), &obj.sub);
}
};
auto c = std::make_shared<MyClass>();
auto sub = c->GetSubObject(); // c.use_count() is 2
== 3 of 8 ==
Date: Sun, Feb 9 2014 5:07 am
From: Jorgen Grahn
On Sun, 2014-02-09, Giuliano Bertoletti wrote:
>
> Hello,
>
> I've a classes like this:
>
> class SubObject { ... };
>
> class Object {
> public:
> SubObject sub;
> };
>
> class MyClass {
> public:
> Object obj;
>
> public:
> SubObject &GetSubObject() { return obj.sub; } // shortcut
> };
>
> which is the difference of calling?
>
> ==================
> MyClass c;
>
> SubObject &sub = c.GetSubObject();
> SubObject sub = c.GetSubObject();
> ==================
>
> It compiles both ways.
>
> In practice I've an higher number of nested classes, so GetSubObject()
> is actually a shortcut which digs deep into MyClass and retrieves the
> item I need.
You might want to review that design to see if there is a smarter way
of doing it. You're saying you drill past three or more levels to get
that object, and that seems unusual. Perhaps your classes are too
much like dumb data containers, and you could change them to contain
more of the intelligence?
On the other hand, dumb data containers aren't always a bad idea ...
By the way, don't forget the third form:
const SubObject& sub = c.GetSubObject();
Here you're still at the mercy of whoever owns the object, but at
least you're promising not to modify it without informing the owner.
It's rather common to only need read access to something. This way
you can document it, and the code will IMO be significantly easier
to read.
/Jorgen
--
// Jorgen Grahn <grahn@ Oo o. . .
\X/ snipabacken.se> O o .
== 4 of 8 ==
Date: Sun, Feb 9 2014 4:21 am
From: Luca Risolia
Giuliano Bertoletti wrote:
> SubObject &sub = c.GetSubObject();
Don't return references to sub objects. To safely share (sub)objects in memory
use smart pointers.
> SubObject sub = c.GetSubObject();
This is a copy and is safe.
If you read the answer I have given in my other answer, you will probably see
the difference better.
== 5 of 8 ==
Date: Sun, Feb 9 2014 5:43 am
From: Giuliano Bertoletti
ok, thank you.
Is it then safe to call:
c.GetSubObject().SomeFunction()
and expect a straight invocation of the original subobject (not a copy)?
Giulio.
Il 09/02/2014 13.04, Marcel Müller ha scritto:
> On 09.02.14 12.50, Giuliano Bertoletti wrote:
>> which is the difference of calling?
>>
>> ==================
>> MyClass c;
>>
>> SubObject &sub = c.GetSubObject();
>> SubObject sub = c.GetSubObject();
>> ==================
>
> The second line creates a copy of SubObject. It is in fact another
> syntax for the following constructor call:
>
> SubObject sub(GetSubObject());
>
> This /might/ be expensive if copying SubObject is expensive. Furthermore
> changes to sub do not apply to c.GetSubObject().
>
> In general you should prefer references for non-trivial data types
> unless you have good reasons not to do so.
>
>
> Marcel
>
== 6 of 8 ==
Date: Sun, Feb 9 2014 11:15 am
From: David Harmon
On Sun, 09 Feb 2014 13:21:40 +0100 in comp.lang.c++, Luca Risolia
<luca.risolia@linux-projects.org> wrote,
>Don't return references to sub objects.
Correct.
In general, your subobjects should belong only to you.
https://en.wikipedia.org/wiki/Law_of_Demeter
http://www.ccs.neu.edu/home/lieber/LoD.html
https://duckduckgo.com/html/?q=law+of+demeter
== 7 of 8 ==
Date: Sun, Feb 9 2014 11:35 am
From: ram@zedat.fu-berlin.de (Stefan Ram)
David Harmon <source@netcom.com> writes:
>In general, your subobjects should belong only to you.
>https://en.wikipedia.org/wiki/Law_of_Demeter
Yeah, but this seems to be related more to the idea of
information hiding / encapsulation than to the LOD.
A class needs to protect its invariants. One can prove
theorems about a field, when one can be sure that only
the given element functions can access this field.
== 8 of 8 ==
Date: Mon, Feb 10 2014 4:35 am
From: Stuart
>>>On 02/09/14, Giuliano Bertoletti wrote:
>>> which is the difference of calling?
[snip]
>>> ==================
>>> MyClass c;
>>>
>>> SubObject &sub = c.GetSubObject();
>>> SubObject sub = c.GetSubObject();
On 09/02/2014, Marcel Müller wrote:
>> The second line creates a copy of SubObject.
[snip]
On 02/09/14, Giuliano Bertoletti wrote:> ok, thank you.
>
> Is it then safe to call:
>
> c.GetSubObject().SomeFunction()
>
> and expect a straight invocation of the original subobject (not a copy)?
That's right.
Note that such design is frowned upon by some people because it makes
the contract MyClass harder to grasp: Whoever gets access to the
instance of MyClass can also manipulate the sub-object at will. This way
it is not clear why the sub-object is a sub-object of MyClass and not
just an ordinary object that can be manipulated by both MyClass and
everybody else.
If you return a const reference (const SubObject&), however, it becomes
much clearer. The MyClass has full access to the sub-objects, but
clients of MyClass can no longer change MyClass's sub-object but only
retrieve information from it.
Regards,
Stuart
==============================================================================
TOPIC: Top 20 coding interview problems asked in Google with solutions:
Algorithmic Approach
http://groups.google.com/group/comp.lang.c++/t/f0866a8c45ecb553?hl=en
==============================================================================
== 1 of 1 ==
Date: Mon, Feb 10 2014 11:34 am
From: lin.quan.20@gmail.com
http://www.amazon.com/coding-interview-problems-Google-solutions/dp/1495466574/
Must Have for Google Aspirants !!!
This book is written for helping people prepare for Google Coding Interview. It contains top 20 programming problems frequently asked @Google with detailed worked-out solutions both in pseudo-code and C++(and C++11).
Matching Nuts and Bolts Optimally
Searching two-dimensional sorted array
Lowest Common Ancestor(LCA) Problem
Max Sub-Array Problem
Compute Next Higher Number
2D Binary Search
String Edit Distance
Searching in Two Dimensional Sequence
Select Kth Smallest Element
Searching in Possibly Empty Two Dimensional Sequence
The Celebrity Problem
Switch and Bulb Problem
Interpolation Search
The Majority Problem
The Plateau Problem
Segment Problems
Efficient Permutation
The Non-Crooks Problem
Median Search Problem
Missing Integer Problem
==============================================================================
TOPIC: Cracking Programming Interviews: 500 Questions with Solutions
http://groups.google.com/group/comp.lang.c++/t/4532417d39af96b4?hl=en
==============================================================================
== 1 of 1 ==
Date: Mon, Feb 10 2014 11:38 am
From: sergei.nakariakov.5@gmail.com
http://www.amazon.com/Cracking-Programming-Interviews-Questions-Solutions/dp/1495459802/
Part I Algorithms and Data Structures
1 Fundamentals
Approximating the square root of a number
Generating Permutation Efficiently
Unique 5-bit Sequences
Select Kth Smallest Element
The Non-Crooks Problem
Is this (almost) sorted?
Sorting an almost sorted list
The Longest Upsequence Problem
Fixed size generic array in C++
Seating Problem
Segment Problems
Exponentiation
Searching two-dimensional sorted array
Hamming Problem
Constant Time Range Query
Linear Time Sorting
Writing a Value as the Sum of Squares
The Celebrity Problem
Transport Problem
Find Length of the rope
Switch Bulb Problem
In, On or Out
The problem of the balanced seg
The problem of the most isolated villages
2 Arrays
The Plateau Problem
Searching in Two Dimensional Sequence
The Welfare Crook Problem
2D Array Rotation
A Queuing Problem in A Post Office
Interpolation Search
Robot Walk
Linear Time Sorting
Write as sum of consecutive positive numbers
Print 2D Array in Spiral Order
The Problem of the Circular Racecourse
Sparse Array Trick
Bulterman's Reshuffling Problem
Finding the majority
Mode of a Multiset
Circular Array
Find Median of two sorted arrays
Finding the missing integer
Finding the missing number with sorted columns
Re-arranging an array
Switch and Bulb Problem
Compute sum of sub-array
Find a number not sum of subsets of array
Kth Smallest Element in Two Sorted Arrays
Sort a sequence of sub-sequences
Find missing integer
Inplace Reversing
Find the number not occurring twice in an array
3 Trees
Lowest Common Ancestor(LCA) Problem
Spying Campaign
4 Dynamic Programming
Stage Coach Problem
Matrix Multiplication
TSP Problem
A Simple Path Problem
String Edit Distance
Music recognition
Max Sub-Array Problem
5 Graphs
Reliable distribution
Independent Set
Party Problem
6 Miscellaneous
Compute Next Higher Number
Searching in Possibly Empty Two Dimensional Sequence
Matching Nuts and Bolts Optimally
Random-number generation
Weighted Median
Compute a^n
Compute a^n revisited
Compute the product a × b
Compute the quotient and remainder
Compute GCD
Computed Constrained GCD
Alternative Euclid' Algorithm
Revisit Constrained GCD
Compute Square using only addition and subtraction
Factorization
Factorization Revisited
Decimal Representation
Reverse Decimal Representation
Solve Inequality
Solve Inequality Revisited
Print Decimal Representation
Decimal Period Length
Sequence Periodicity Problem
Compute Function
Emulate Division and Modulus Operations
Sorting Array of Strings : Linear Time
LRU data structure
Exchange Prefix and Suffix
7 Parallel Algorithms
Parallel Addition
Find Maximum
Parallel Prefix Problem
Finding Ranks in Linked Lists
Finding the k th Smallest Element
8 Low Level Algorithms
Manipulating Rightmost Bits
Counting 1-Bits
Counting the 1-bits in an Array
Computing Parity of a word
Counting Leading/Trailing 0's
Bit Reversal
Bit Shuffling
Integer Square Root
Newton's Method
Integer Exponentiation
LRU Algorithm
Shortest String of 1-Bits
Fibonacci words
Computation of Power of 2
Round to a known power of 2
Round to Next Power of 2
Efficient Multiplication by Constants
Bit-wise Rotation
Gray Code Conversion
Average of Integers without Overflow
Least/Most Significant 1 Bit
Next bit Permutation
Modulus Division
Part II C++
8 General
9 Constant Expression
10 Type Specifier
11 Namespaces
12 Misc
13 Classes
14 Templates
15 Standard Library
==============================================================================
TOPIC: Getting Started with a Visual Studio C++ 2013 IDE
http://groups.google.com/group/comp.lang.c++/t/6af661da9c3466bf?hl=en
==============================================================================
== 1 of 1 ==
Date: Tues, Feb 11 2014 4:00 am
From: malcolm.mclean5@btinternet.com
On Saturday, February 1, 2014 4:28:55 AM UTC, W. eWatson wrote:
> I understand C++. What I'm looking for is how one operates the IDE
> provided in VS C++ Desktop. What programming I've done usually does not
> include a sophisticated IDE.
>
I'm basically in the same situation.
I downloaded the latest version of Visual Studio Express for my new Windows 8.1
machine.
Start by creating an empty console project. Then create a C version of "hello world". Get that running, and it means that the compiler is basically set up.
Then try allowing it to make the skeleton for you, still in a console project.
You'll get lots of non-standard stuff, but nothing too awful. Write hello
world out in Unicode. (In Hebrew it's "shalom liolam", shin-lamed-vav-mem
space lamed-ayin-vav-lamed-mem, see if you can get it working in a non-Latin
script).
The try hello world in a window.
Gradually build up, getting more familiar with the IDE as you add complexity.
==============================================================================
TOPIC: about gets
http://groups.google.com/group/comp.lang.c++/t/0335e4afbf8afe82?hl=en
==============================================================================
== 1 of 3 ==
Date: Tues, Feb 11 2014 9:22 am
From: mary8shtr@gmail.com
hi.I am writing a program.while i define some variable but program say this variable undefined.
== 2 of 3 ==
Date: Tues, Feb 11 2014 9:33 am
From: Victor Bazarov
On 2/11/2014 12:22 PM, mary8shtr@gmail.com wrote:
> hi.I am writing a program.while i define some variable but program say this variable undefined.
>
http://www.parashift.com/c++-faq/posting-code.html
V
--
I do not respond to top-posted replies, please don't ask
== 3 of 3 ==
Date: Tues, Feb 11 2014 10:05 am
From: ram@zedat.fu-berlin.de (Stefan Ram)
mary8shtr@gmail.com writes:
>hi.I am writing a program.while i define some variable but program say this variable undefined.
I think this can be done as follows.
#include <iostream>
#include <ostream>
int main(){ int n; ::std::cout << "The variable \"n\" is undefined.\n"; }
==============================================================================
TOPIC: beginner
http://groups.google.com/group/comp.lang.c++/t/764088b8acc86a74?hl=en
==============================================================================
== 1 of 5 ==
Date: Wed, Feb 12 2014 10:01 am
From: frank cubi
Which is the most appropriate website for a person who is learning c++ ?
== 2 of 5 ==
Date: Wed, Feb 12 2014 10:14 am
From: ram@zedat.fu-berlin.de (Stefan Ram)
frank cubi <frankcubi7@gmail.com> writes:
>Which is the most appropriate website for a person who is learning c++ ?
I know some good books:
You can read (in this order and doing the exercise):
Programming -- Principles and Practice Using C++ (only if
you have not programmed before) or Accelerated C++ (if you
have programmed before), The C++ Programming Language,
Effective C++, Exceptional C++ (Parts 1 and 2), Modern
C++ programming, and ISO/IEC 14882:2011.
There also might be websites with similar contents, but
I am not aware of them.
== 3 of 5 ==
Date: Wed, Feb 12 2014 11:03 am
From: Paavo Helde
frank cubi <frankcubi7@gmail.com> wrote in news:9c118022-a702-413b-8ea8-
32da6f631e26@googlegroups.com:
> Which is the most appropriate website for a person who is learning c++ ?
http://www.parashift.com/c++-faq/ is a good one.
== 4 of 5 ==
Date: Wed, Feb 12 2014 11:23 am
From: Cholo Lennon
On 02/12/2014 04:03 PM, Paavo Helde wrote:
> frank cubi <frankcubi7@gmail.com> wrote in news:9c118022-a702-413b-8ea8-
> 32da6f631e26@googlegroups.com:
>
>> Which is the most appropriate website for a person who is learning c++ ?
>
> http://www.parashift.com/c++-faq/ is a good one.
>
Stroustrup's homepage and ISO C++ are also good websites:
http://www.stroustrup.com/
http://isocpp.org/get-started
Regards
--
Cholo Lennon
Bs.As.
ARG
== 5 of 5 ==
Date: Wed, Feb 12 2014 11:27 am
From: Jorgen Grahn
On Wed, 2014-02-12, Stefan Ram wrote:
> frank cubi <frankcubi7@gmail.com> writes:
>>Which is the most appropriate website for a person who is learning c++ ?
>
> I know some good books:
>
> You can read (in this order and doing the exercise):
> Programming -- Principles and Practice Using C++ (only if
> you have not programmed before) or Accelerated C++ (if you
> have programmed before), The C++ Programming Language,
> Effective C++, Exceptional C++ (Parts 1 and 2), Modern
> C++ programming, and ISO/IEC 14882:2011.
>
> There also might be websites with similar contents, but
> I am not aware of them.
Me neither. https://www.sgi.com/tech/stl/ is the only one I use. And
/The C++ Programming Language/ is the only book I've read and liked.
However, this mostly means I learned C++ slowly, and started a long
time ago ...
Apart from that I recommend:
- writing lots of code
- reading lots of code
- learning your tools
- hanging out on comp.lang.c++ and comp.lang.c++.moderated
Happy hacking!
/Jorgen
--
// Jorgen Grahn <grahn@ Oo o. . .
\X/ snipabacken.se> O o .
==============================================================================
TOPIC: pointer to a vector
http://groups.google.com/group/comp.lang.c++/t/b17f744707f37fdb?hl=en
==============================================================================
== 1 of 5 ==
Date: Wed, Feb 12 2014 11:46 am
From: "A"
There are 2 vectors each one having a structure
struct MyStruct
{
int a;
std::string b;
}
std::vector<MyStruct> v1;
std::vector<MyStruct> v2;
Now I want a pointer to which one I will use... v1 or v2
std::vector<MyStruct> *v = (condition)? &v1 : &v2;
Finally I access it using:
for (unsigned i = 0; i < v->size(); i++)
{
v->operator[](i).a = i + 1;
}
My lack of understanding here is:
a) does the above *v needs to be deleted? Isn't it just a pointer variable?
Or it works differently when it points to a vector? Just to be clear, I
don't actually need to delete v1 or v2. I just need to cleanup *v if
required.
b) what's the heap or stack or difference or advantage of them in relation
to the above?
== 2 of 5 ==
Date: Wed, Feb 12 2014 11:51 am
From: "A"
Actually I just found that I can use *v like this:
(*v)[i].a = i + 1;
Cleaner to me than
v->operator[](i).a = i + 1;
However, my questions are still the same.
== 3 of 5 ==
Date: Wed, Feb 12 2014 12:11 pm
From: Paavo Helde
"A" <a@a.a> wrote in news:ldgj2i$2gc$1@gregory.bnet.hr:
> There are 2 vectors each one having a structure
>
> struct MyStruct
> {
> int a;
> std::string b;
> }
>
> std::vector<MyStruct> v1;
> std::vector<MyStruct> v2;
>
> Now I want a pointer to which one I will use... v1 or v2
>
> std::vector<MyStruct> *v = (condition)? &v1 : &v2;
>
> Finally I access it using:
>
> for (unsigned i = 0; i < v->size(); i++)
> {
> v->operator[](i).a = i + 1;
> }
You can also use references:
std::vector<MyStruct> & v = (condition)? v1 : v2;
...
v[i].a = i+1;
>
> My lack of understanding here is:
>
> a) does the above *v needs to be deleted? Isn't it just a pointer
> variable? Or it works differently when it points to a vector? Just to
> be clear, I don't actually need to delete v1 or v2. I just need to
> cleanup *v if required.
No, as a rule of thumb, if your code does not contain 'new' then there is
no need for 'delete' either (and this is a good thing). Any dynamically
allocated memory is maintained and released by the std::vector objects
internally.
>
> b) what's the heap or stack or difference or advantage of them in
> relation to the above?
std::vector automatically stores the stuff in the right place, you do not
need to worry about this. Just avoid raw arrays and 'new' (as you have
done so far) and you should be fine.
Cheers
Paavo
== 4 of 5 ==
Date: Wed, Feb 12 2014 12:12 pm
From: Jorgen Grahn
On Wed, 2014-02-12, A wrote:
> There are 2 vectors each one having a structure
>
> struct MyStruct
> {
> int a;
> std::string b;
> }
>
> std::vector<MyStruct> v1;
> std::vector<MyStruct> v2;
>
> Now I want a pointer to which one I will use... v1 or v2
>
> std::vector<MyStruct> *v = (condition)? &v1 : &v2;
You don't need a pointer below -- a reference would have worked just
as well, and the syntax would have been cleaner.
> Finally I access it using:
>
> for (unsigned i = 0; i < v->size(); i++)
> {
> v->operator[](i).a = i + 1;
> }
>
> My lack of understanding here is:
>
> a) does the above *v needs to be deleted? Isn't it just a pointer variable?
No, and yes. You haven't done 'new', so you're not responsible for
doing 'delete'. BTW, both of those are rarely needed in modern code
-- if you use them a lot you're probably doing something wrong.
> Or it works differently when it points to a vector? Just to be clear, I
> don't actually need to delete v1 or v2. I just need to cleanup *v if
> required.
No cleanup required. But I don't really understand what you're trying
to say ...
> b) what's the heap or stack or difference or advantage of them in relation
> to the above?
I don't understand that question. Please rephrase.
/Jorgen
--
// Jorgen Grahn <grahn@ Oo o. . .
\X/ snipabacken.se> O o .
== 5 of 5 ==
Date: Wed, Feb 12 2014 12:32 pm
From: "A"
"Jorgen Grahn" <grahn+nntp@snipabacken.se> wrote in message
news:slrnlfnle0.81f.grahn+nntp@frailea.sa.invalid...
> No, and yes. You haven't done 'new', so you're not responsible for
> doing 'delete'. BTW, both of those are rarely needed in modern code
> -- if you use them a lot you're probably doing something wrong.
No, I don't use normally new or delete. I use boost smart pointers and
vectors.
Good thing to know this rule of a thumb - using new = delete, not using it,
then it is just a pointer.
> No cleanup required. But I don't really understand what you're trying
> to say ...
What I though is that if it is pointer to a vector then it is somehow
different but obviously it is just a same pointer like any other. So yes,
then no cleanup is required, it is just a pointer variable.
>> b) what's the heap or stack or difference or advantage of them in
>> relation
>> to the above?
> I don't understand that question. Please rephrase.
A guy here was mentioning heap so I though it was related. Seems it is not:
http://facepunch.com/showthread.php?t=780439
==============================================================================
You received this message because you are subscribed to the Google Groups "comp.lang.c++"
group.
To post to this group, visit http://groups.google.com/group/comp.lang.c++?hl=en
To unsubscribe from this group, send email to comp.lang.c+++unsubscribe@googlegroups.com
To change the way you get mail from this group, visit:
http://groups.google.com/group/comp.lang.c++/subscribe?hl=en
To report abuse, send email explaining the problem to abuse@googlegroups.com
==============================================================================
Google Groups: http://groups.google.com/?hl=en
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment