🚀 go-pugleaf

There is a kind of list that is in C++ that automatically is sorted.
It's called a map.  For example, when you put things into it you can
index it on the string and get out the number associated with the
string.  The string would be the key.

Try running this:

  -------------------
  #include <vcl.h>
  #pragma hdrstop
  #include <map>
  using namespace std;

  struct MyCompare // so it knows how to compare the keys
    {
    bool operator()(const AnsiString& a1, const AnsiString& a2)
      {
      return a1 < a2;
      }
    };

  // map with an AnsiString for a key, unsigned for data
  typedef map<AnsiString, unsigned, MyCompare> ItemMap;
  typedef ItemMap::iterator ItemIter;

  WINAPI WinMain(HINSTANCE, HINSTANCE, LPSTR, int)
    {
    Application->Initialize();
    ItemMap items;

    items["Grape"] = 78901;
    items["Bananna"] = 123456;
    items["Apple"] = 56789;
    items["Strawberry"] = 32768;

    AnsiString result;
    ItemIter finder = items.find("Bananna");

    result.printf("Item: %s ID: %d", finder->first, finder->second);
    ShowMessage(result);

    for (finder = items.begin(); finder != items.end(); ++finder)
      {
      result.sprintf("Item: %s ID: %d", finder->first,
finder->second);
      ShowMessage(result);
      }

    return 0;
    }

  -------------------

.  Ed

> PC Hua wrote in message
> news:opr7uyeayypmxkmr@newsgroups.borland.com...
>
> For instance, I have a list (the length is known) of
> components:
>    Item.Name="Apple";
>    Item.ID= 56789; // Sytem generated and initialized in
> runtime
>    ...
> Now my problem is to retrieve the name for a given ID.
> Is there any implementation of a list which allows to find the
> name of the
> item efficiently?
> Any suggestion?