89 /* a dictionary is a bidirectional map from strings to strings */
91 typedef bidirectional_map<std::string,std::string>::type dictionary;  typedef
95   dictionary d;  in main()
101   d.insert(dictionary::value_type("hola","hello"));  in main()
102   d.insert(dictionary::value_type("adios","goodbye"));  in main()
103   d.insert(dictionary::value_type("rosa","rose"));  in main()
104   d.insert(dictionary::value_type("mesa","table"));  in main()
113   dictionary::iterator it=get<from>(d).find(word);  in main()
118     nth_index<dictionary,1>::type::iterator it2=get<1>(d).find(word);  in main()
122     else std::cout<<"No such word in the dictionary"<<std::endl;  in main()
129   dictionary::iterator it=d.get<from>().find(word);  in main()
139     dictionary::index<to>::type::iterator it2=d.get<to>().find(word);  in main()
143     else std::cout<<"No such word in the dictionary"<<std::endl;  in main()