<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
<?xml-stylesheet href="http://www.blogger.com/styles/atom.css" type="text/css"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <id>http://groups.google.co.uk/group/comp.lang.c++</id>
  <title type="text">comp.lang.c++ Google Group</title>
  <subtitle type="text">
  The object-oriented C++ language.
  </subtitle>
  <link href="/group/comp.lang.c++/feed/atom_v1_0_msgs.xml" rel="self" title="comp.lang.c++ feed"/>
  <updated>2009-11-08T21:35:44Z</updated>
  <generator uri="http://groups.google.co.uk" version="1.99">Google Groups</generator>
  <entry>
  <author>
  <name>Digital Puer</name>
  <email>digital_p...@hotmail.com</email>
  </author>
  <updated>2009-11-08T21:35:44Z</updated>
  <id>http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/68437c700f3141bb/4ea9caa7e8ad3de6?show_docid=4ea9caa7e8ad3de6</id>
  <link href="http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/68437c700f3141bb/4ea9caa7e8ad3de6?show_docid=4ea9caa7e8ad3de6"/>
  <title type="text">Re: How is map&lt;vector&lt;int&gt;, int&gt; stored? (for graph algorithms)</title>
  <summary type="html" xml:space="preserve">
  By &amp;quot;hash&amp;quot;, I meant to ask how are the keys compared? For a &lt;br&gt; map&amp;lt;vector&amp;lt;int&amp;gt;, int&amp;gt;, how would the keys be compared? I assume the &lt;br&gt; comparer must walk down both vectors and do element-wise comparison, &lt;br&gt; and if two vectors are the same through N elements but one vector &lt;br&gt; is longer, then the shorter one wins the comparison?
  </summary>
  </entry>
  <entry>
  <author>
  <name>Paul N</name>
  <email>gw7...@aol.com</email>
  </author>
  <updated>2009-11-08T21:19:47Z</updated>
  <id>http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/4ed8ee6236f47f6a/87f41367e93dca36?show_docid=87f41367e93dca36</id>
  <link href="http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/4ed8ee6236f47f6a/87f41367e93dca36?show_docid=87f41367e93dca36"/>
  <title type="text">Re: Accessing private members...</title>
  <summary type="html" xml:space="preserve">
  What he is saying is that the line c = a.p(); calls function p of the &lt;br&gt; object a, and sets c to the result of this. The calling of function p &lt;br&gt; has nothing to do with c, c is just where the result will go once &lt;br&gt; you&#39;ve got it, so you can&#39;t control the access to p by this means. &lt;br&gt; But in the example you have given, member functions of b can access
  </summary>
  </entry>
  <entry>
  <author>
  <name>Joshua Maurice</name>
  <email>joshuamaur...@gmail.com</email>
  </author>
  <updated>2009-11-08T21:11:59Z</updated>
  <id>http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/68437c700f3141bb/434912b22137966b?show_docid=434912b22137966b</id>
  <link href="http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/68437c700f3141bb/434912b22137966b?show_docid=434912b22137966b"/>
  <title type="text">Re: How is map&lt;vector&lt;int&gt;, int&gt; stored? (for graph algorithms)</title>
  <summary type="html" xml:space="preserve">
  On Nov 8, 10:19 am, &amp;quot;AnonMail2...@gmail.com&amp;quot; &amp;lt;anonmail2...@gmail.com&amp;gt; &lt;br&gt; wrote: &lt;br&gt; Well, C++03 the term hash does not apply. For TR2 or C++0x, we&#39;re &lt;br&gt; getting hash sets and hash maps, so it does apply in these cases. &lt;br&gt; However, the OP is still wrong as he implied that std::map is a hash &lt;br&gt; map. It is not. It is a red-black binary tree (or at least almost
  </summary>
  </entry>
  <entry>
  <author>
  <name>Joshua Maurice</name>
  <email>joshuamaur...@gmail.com</email>
  </author>
  <updated>2009-11-08T21:09:18Z</updated>
  <id>http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/2256b54e7d3d9a6e/2746e369a324efa3?show_docid=2746e369a324efa3</id>
  <link href="http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/2256b54e7d3d9a6e/2746e369a324efa3?show_docid=2746e369a324efa3"/>
  <title type="text">Re: serialization</title>
  <summary type="html" xml:space="preserve">
  At the very least, IMAO, C++ should have reflection, but only at &lt;br&gt; compile time. Possibly / preferably through some template-like &lt;br&gt; facilities. Being able to iterate over members of a class at compile &lt;br&gt; time in a generic way would impose no additional costs, contrary to &lt;br&gt; the oft reason cited reason of &amp;quot;pay only for what you use&amp;quot;.
  </summary>
  </entry>
  <entry>
  <author>
  <name>io_x</name>
  <email>a...@b.c.invalid</email>
  </author>
  <updated>2009-11-08T18:59:58Z</updated>
  <id>http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/9f194fd163453df6/d9e8a26f2f359aac?show_docid=d9e8a26f2f359aac</id>
  <link href="http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/9f194fd163453df6/d9e8a26f2f359aac?show_docid=d9e8a26f2f359aac"/>
  <title type="text">Re: RNGs: A Super KISS</title>
  <summary type="html" xml:space="preserve">
  &amp;quot;io_x&amp;quot; &amp;lt;a...@b.c.invalid&amp;gt; ha scritto nel messaggio &lt;br&gt; not define, better declare
  </summary>
  </entry>
  <entry>
  <author>
  <name>AnonMail2005@gmail.com</name>
  <email>anonmail2...@gmail.com</email>
  </author>
  <updated>2009-11-08T18:19:19Z</updated>
  <id>http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/68437c700f3141bb/606d65f2365be4f5?show_docid=606d65f2365be4f5</id>
  <link href="http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/68437c700f3141bb/606d65f2365be4f5?show_docid=606d65f2365be4f5"/>
  <title type="text">Re: How is map&lt;vector&lt;int&gt;, int&gt; stored? (for graph algorithms)</title>
  <summary type="html" xml:space="preserve">
  std::map uses the operator&amp;lt;() (less than) function to order it&#39;s &lt;br&gt; elements. The term hash does not apply. std::pair defines this as: &lt;br&gt; template&amp;lt;class Ty1, class Ty2&amp;gt; &lt;br&gt; bool operator&amp;lt;(const pair&amp;lt;Ty1, Ty2&amp;gt;&amp;amp; left, const pair&amp;lt;Ty1, Ty2&amp;gt;&amp;amp; &lt;br&gt; right) &lt;br&gt; { &lt;br&gt; return left.first &amp;lt; right.first || !(right.first &amp;lt; left.first) &amp;amp;&amp;amp;
  </summary>
  </entry>
  <entry>
  <author>
  <name>Digital Puer</name>
  <email>digital_p...@hotmail.com</email>
  </author>
  <updated>2009-11-08T17:55:51Z</updated>
  <id>http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/68437c700f3141bb/2cd5ce60d4b53a43?show_docid=2cd5ce60d4b53a43</id>
  <link href="http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/68437c700f3141bb/2cd5ce60d4b53a43?show_docid=2cd5ce60d4b53a43"/>
  <title type="text">Re: How is map&lt;vector&lt;int&gt;, int&gt; stored? (for graph algorithms)</title>
  <summary type="html" xml:space="preserve">
  How does STL hash pair&amp;lt;int, int&amp;gt; for use as a map key?
  </summary>
  </entry>
  <entry>
  <author>
  <name>Rune Allnor</name>
  <email>all...@tele.ntnu.no</email>
  </author>
  <updated>2009-11-08T17:11:23Z</updated>
  <id>http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/690c45c0197f60ef/c1648d10734c22c6?show_docid=c1648d10734c22c6</id>
  <link href="http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/690c45c0197f60ef/c1648d10734c22c6?show_docid=c1648d10734c22c6"/>
  <title type="text">Re: Binary file IO: Converting imported sequences of chars to desired type</title>
  <summary type="html" xml:space="preserve">
  I&#39;m getting tired with re-iterating this for people who &lt;br&gt; are not interested in actually evaluating the numbers. &lt;br&gt; Look for an upcomimg post on comp.lang.c++.moderated, where &lt;br&gt; I distill the problem statement a bit, as well as present &lt;br&gt; a C++ test to see what kind of timing ratios I am talking about. &lt;br&gt; Rune
  </summary>
  </entry>
  <entry>
  <author>
  <name>James Kanze</name>
  <email>james.ka...@gmail.com</email>
  </author>
  <updated>2009-11-08T14:33:34Z</updated>
  <id>http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/5aa5848ff079613f/82738e3264bbf063?show_docid=82738e3264bbf063</id>
  <link href="http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/5aa5848ff079613f/82738e3264bbf063?show_docid=82738e3264bbf063"/>
  <title type="text">Re: c++0x pods and constructors</title>
  <summary type="html" xml:space="preserve">
  Or that there are two different C compilers on the system, and &lt;br&gt; they use different ABI&#39;s. Here, too, the case should be fairly &lt;br&gt; rare, due to the fact that most OS&#39;s today define their &lt;br&gt; interface in terms of C. &lt;br&gt; It would almost certainly break something. &lt;br&gt; Yes. And for various reasons, I&#39;ve not been able to study much
  </summary>
  </entry>
  <entry>
  <author>
  <name>barcaroller</name>
  <email>barcarol...@music.net</email>
  </author>
  <updated>2009-11-08T14:29:44Z</updated>
  <id>http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/4ed8ee6236f47f6a/83bc1a644cc5e64b?show_docid=83bc1a644cc5e64b</id>
  <link href="http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/4ed8ee6236f47f6a/83bc1a644cc5e64b?show_docid=83bc1a644cc5e64b"/>
  <title type="text">Re: Accessing private members...</title>
  <summary type="html" xml:space="preserve">
  I&#39;m not entirely sure what you mean. I would like the access to the members &lt;br&gt; to be selective. Some objects can see some members while other objects &lt;br&gt; (particularly the ones of the same class) can see others. The member p() &lt;br&gt; above is private and hence the second line should cause a compiler error. &lt;br&gt; Yes, adding a wrapper would be one solution.
  </summary>
  </entry>
  <entry>
  <author>
  <name>James Kanze</name>
  <email>james.ka...@gmail.com</email>
  </author>
  <updated>2009-11-08T14:27:41Z</updated>
  <id>http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/690c45c0197f60ef/cd7c0b7dab2f757b?show_docid=cd7c0b7dab2f757b</id>
  <link href="http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/690c45c0197f60ef/cd7c0b7dab2f757b?show_docid=cd7c0b7dab2f757b"/>
  <title type="text">Re: Binary file IO: Converting imported sequences of chars to desired type</title>
  <summary type="html" xml:space="preserve">
  Which, of course, raises the question as to why. They&#39;re not &lt;br&gt; very useful unless you&#39;re doing exceptionally low level work. &lt;br&gt; The original comment was just that---a parenthetical comment. &lt;br&gt; Text formats have many advantages, WHEN you can use them. It&#39;s &lt;br&gt; also obvious that they have additional overhead---not nearly as
  </summary>
  </entry>
  <entry>
  <author>
  <name>zero</name>
  <email>zerolinf...@gmail.com</email>
  </author>
  <updated>2009-11-08T12:41:55Z</updated>
  <id>http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/fab002a4b81398cc/c0b2294c558ffb3a?show_docid=c0b2294c558ffb3a</id>
  <link href="http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/fab002a4b81398cc/c0b2294c558ffb3a?show_docid=c0b2294c558ffb3a"/>
  <title type="text">Ralph Lauren polo</title>
  <summary type="html" xml:space="preserve">
  Ralph Lauren polo - luxury-fashion.org &lt;br&gt; Ralph Lauren polo shirts is very famous and this brand has set up new &lt;br&gt; trademarks in the history of clothing&#39;s. They are very comfortable to &lt;br&gt; style on and show off. Being very flaunty in appearance and great in &lt;br&gt; style, they give a cool and casual look to the person. Wholesale Ralph
  </summary>
  </entry>
  <entry>
  <author>
  <name>Mary</name>
  <email>love.islam...@gmail.com</email>
  </author>
  <updated>2009-11-08T11:03:36Z</updated>
  <id>http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/4c3ffe10f235cbcf/7885ccf5d789af02?show_docid=7885ccf5d789af02</id>
  <link href="http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/4c3ffe10f235cbcf/7885ccf5d789af02?show_docid=7885ccf5d789af02"/>
  <title type="text">Wonders of Allah in Dolphins</title>
  <summary type="html" xml:space="preserve">
  Wonders of Allah in Dolphins &lt;br&gt; For dolphins, breathing is not a reflex, as it is for humans and other &lt;br&gt; land mammals, but rather a voluntary movement. In other words, &lt;br&gt; dolphins decide to breathe like we decide to walk. There is also a &lt;br&gt; precaution taken in order to prevent the animal&#39;s being drowned while &lt;br&gt; sleeping in water. While sleeping, the dolphin uses the right and left
  </summary>
  </entry>
  <entry>
  <author>
  <name>Vaclav Haisman</name>
  <email>v.hais...@sh.cvut.cz</email>
  </author>
  <updated>2009-11-08T07:51:17Z</updated>
  <id>http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/68437c700f3141bb/78692429ade386b9?show_docid=78692429ade386b9</id>
  <link href="http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/68437c700f3141bb/78692429ade386b9?show_docid=78692429ade386b9"/>
  <title type="text">Re: How is map&lt;vector&lt;int&gt;, int&gt; stored? (for graph algorithms)</title>
  <summary type="html" xml:space="preserve">
  Digital Puer wrote, On 8.11.2009 6:34: &lt;br&gt; Using std::vector&amp;lt;&amp;gt; as a key for two integere elements is very suboptimal. &lt;br&gt; There is extra indirection, which means its copy ctor and other operations &lt;br&gt; have lots more overhead than that of std::pair&amp;lt;&amp;gt;. Also, &lt;br&gt; sizeof(std::vector&amp;lt;int&amp;gt;) &amp;gt; sizeof(std::pair&amp;lt;int,int&amp;gt;). The access to the
  </summary>
  </entry>
  <entry>
  <author>
  <name>Saeed Amrollahi</name>
  <email>amrollahi.sa...@gmail.com</email>
  </author>
  <updated>2009-11-08T05:58:47Z</updated>
  <id>http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/85c2e2c42e3a291a/37bdfb7e75671044?show_docid=37bdfb7e75671044</id>
  <link href="http://groups.google.co.uk/group/comp.lang.c++/browse_thread/thread/85c2e2c42e3a291a/37bdfb7e75671044?show_docid=37bdfb7e75671044"/>
  <title type="text">Re: Structure definitions</title>
  <summary type="html" xml:space="preserve">
  Hi &lt;br&gt; Because it is a homework, I should give you just few hints: &lt;br&gt; 1. Use const types rather than macros: &lt;br&gt; const int STUDENTS = 100; &lt;br&gt; 2. The name of your array and one of its struct members are same: &lt;br&gt; score. use different names. &lt;br&gt; 3. You can intialize the first 5 array elements using array &lt;br&gt; initilizers list &lt;br&gt; almost in the same way as initializing array of integers:
  </summary>
  </entry>
</feed>
