<?xml version="1.0" ?>
	<rss version="2.0">
        <channel>
        <title>guass jordan</title>
        <description>guass jordan quotes</description>
        <link>http://www.quotesdb.info/freenode/math/19Jul2006/1.html</link>
        <language>en-us</language>
	<item>
        	<title>guass jordan</title>
        	<link>http://www.quotesdb.info/freenode/math/19Jul2006/1.html</link>
        	<guid isPermaLink="true">http://www.quotesdb.info/freenode/math/19Jul2006/1.html</guid>
        	<description>&lt;1&gt; Pair of what ?
&lt;2&gt; of angles, I imagine
&lt;3&gt; MrPockets: a linear pair by definition share a side, suppl angles don't have to
&lt;1&gt; What is a linear pair of angles ?
&lt;1&gt; I found out.
&lt;4&gt; can anyone tell me why associtive constainers in C++ use strict weak ordering instead of partial ordering. eg: used in the implementation of a red-black tree
&lt;5&gt; i hope the answer is &quot;magic&quot;
&lt;4&gt; HiLander: my answer?
&lt;1&gt; The answer is magic.
Action: roods is confused at what is the question
&lt;1&gt; The question you asked.
&lt;5&gt; the humor has been beaten out of the joke.
&lt;6&gt; what is strict weak ordering?
&lt;7&gt; Does &quot;a *-autonomous category&quot; mean * in the Linear Algebra sense?
&lt;1&gt; monochrom : All the elements must be comparable with all the others.
&lt;1&gt; http://www.sgi.com/tech/stl/StrictWeakOrdering.html
&lt;7&gt; Really, anybody familiar with the concept of &quot;*-autonomous categories&quot; ? I can't infer from the context.
&lt;6&gt; I don't think binary search trees etc. have really been defined or studied using partial orders.
&lt;4&gt; Olathe: that isn't true.
</description>
	</item></channel></rss>