The Weird and The Wonderful

<Product>
    <ProductCode>...</ProductCode>
    <Vendor>...</Vendor>
    <ProductType>...</ProductType>
    ...
</Product>

<Product>
    <AttrList>
      <element Name="Cable Functionality" Value="SCSI External Cable"/>
      <element Name="Platform Compability" Value="PC"/>
      <element Name="Left Connector Type" Value="HD D-Sub 68-pin"/>
      ...
    </AttrList>
</Product>

<Images>
	<Image>https://....jpg</Image>
	<Image>https://....jpg</Image>
	<Image>https://....jpg</Image>
	<Image>https://....jpg</Image>
</Images>

Andrei Straut wrote:

On the other hand, I'm having fun now with LINQ parsing the list of products from suppliers (didn't get to play with LINQ so far, but I'm quite liking it. Heard it's pretty slow compared to the other alternatives, but in my case speed is not that much of an issue)

// this method is very slow, it uses the database and network and maybe the TARDIS too
public IEnumerable<FancyBusinessObject> GetLotsOfData() {...}

// this method is *extremely* slow since it calls the database and network over and over again
public void CrashYourServer()
{
    var data = GetLotsOfData(); // this just saves a QUERY! not the data!
    // so far so good...
    foreach (var item in data)
    {
        item.DoFancyBusinessOperation();
    }
    // wait, iterating over the enumerable again? uh-oh!
    foreach (var item in data) // going to call the database and network and TARDIS again!
    {
        item.DoOtherFancyBusinessOperation();
        foreach (var otherItem in data) // what, now we need an O(N^2) operation? NOOOOOO!
        {
            ComparisonResults.Add(item.CompareTo(otherItem));
        }
    }
}

// this method is more efficient!
public void PlayNice()
{
    var data = GetLotsOfData().ToArray(); // this actually loads and caches the data, yay!
    foreach (var item in data)
    {
        item.DoFancyBusinessOperation();
    }
    foreach (var item in data)
    {
        item.DoOtherFancyBusinessOperation();
        foreach (var otherItem in data)
        {
            ComparisonResults.Add(item.CompareTo(otherItem));
        }
    }
}

Kevin Drzycimski wrote:

Sometimes the code does not get correctly "reflected" by the Reflector, perhaps it is just a Compiler Optimization or so.

PIEBALDconsult wrote:

TANEKABI

Ano Anony Wrote:

Lol, I wrote this a few years ago for a school project...

if (C++)
    delete pBrain;

public T
LastOf
(
  params object[] list
)
{
  return ( (T) list [ list.Count - 1 ] ) ;
}

int i = 0 ;
int j = 0 ;

while ( (new int[] { i++ , j += 2 }).Last() < 10 )
{
  System.Console.WriteLine ( "{0} {1}" , i , j ) ;
}

for ( i = 0 , j = 0 ; (new int[] { i++ , j += 2 }).Last() < 10 ; )
{
  System.Console.WriteLine ( "{0} {1}" , i , j ) ;
}