fleetview now generates the correct "unit table" when it's created.

[hbs.git] / bs / bsdoc.cpp

diff --git a/bs/bsdoc.cpp b/bs/bsdoc.cpp
index 3d32cad004dd1aa92a123bdbc730ab7755d4115d..c65903bc728a5644013f85cd464d275bef764c22 100644 (file)
--- a/bs/bsdoc.cpp
+++ b/bs/bsdoc.cpp
@@ -17,6 +17,8 @@
 
 #include "bsdoc.h"
 
+using namespace std;
+
 BSDoc::BSDoc()
 {
   modified = false;
@@ -50,3 +52,51 @@ bool BSDoc::isModified() const
 {
   return modified;
 }
+
+///////////////////////////////////////////////////////////////////////////
+//
+
+int BSDoc::newBattle(QString name)
+{
+       m_Battles[name]["Friendly"]["Home Planet"];
+       m_Battles[name]["Hostile"];
+
+       modified = true;
+       emit documentChanged();
+       return 0;
+}
+
+/////////////////////////////////////////////////////////////////////////
+//
+
+const std::map<QString, std::map<QString, std::map<QString, Fleet> > >& BSDoc::battles() const
+{
+       return m_Battles;
+}
+
+//////////////////////////////////////////////////////////////////////////
+//
+Fleet BSDoc::specificFleet(QString battle, QString group, QString fleet) const
+{
+       for (map<QString, map<QString, map<QString, Fleet> > >::const_iterator i = m_Battles.begin(); i != m_Battles.end(); ++i)
+       {
+               if (i->first == battle)
+               {
+                       for (map<QString, map<QString, Fleet> >::const_iterator j = i->second.begin(); j != i->second.end(); j++)
+                       {
+                               if (j->first == group)
+                               {
+                                       for (map<QString, Fleet>::const_iterator k = j->second.begin(); k != j->second.end(); ++k)
+                                       {
+                                               if (k->first == fleet)
+                                               {
+                                                       return k->second;
+                                               }
+                                       }
+                               }
+                       }
+               }
+       }
+}
+
+