/* Copyright (C) 2009-2013 Paul Davis Author: Johannes Mueller This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include "pbd/i18n.h" #include "pbd/strsplit.h" #include "gtkmm2ext/actions.h" #include "gtkmm2ext/action_model.h" using namespace std; using namespace Gtk; const ActionManager::ActionModel& ActionManager::ActionModel::instance () { static ActionManager::ActionModel am; return am; } ActionManager::ActionModel::ActionModel () { _model = TreeStore::create (_columns); _model->clear (); typedef std::map NodeMap; NodeMap nodes; NodeMap::iterator r; TreeIter rowp; TreeModel::Row parent; rowp = _model->append (); parent = *(rowp); parent[_columns.name] = _("Disabled"); vector paths; vector labels; vector tooltips; vector keys; vector > actions; ActionManager::get_all_actions (paths, labels, tooltips, keys, actions); vector::iterator k; vector::iterator p; vector::iterator t; vector::iterator l; for (l = labels.begin(), k = keys.begin(), p = paths.begin(), t = tooltips.begin(); l != labels.end(); ++k, ++p, ++t, ++l) { TreeModel::Row row; vector parts; parts.clear (); split (*p, parts, '/'); if (parts.empty()) { continue; } //kinda kludgy way to avoid displaying menu items as mappable if ( parts[0] == _("Main_menu") ) continue; if ( parts[0] == _("JACK") ) continue; if ( parts[0] == _("redirectmenu") ) continue; if ( parts[0] == _("Editor_menus") ) continue; if ( parts[0] == _("RegionList") ) continue; if ( parts[0] == _("ProcessorMenu") ) continue; if ((r = nodes.find (parts[0])) == nodes.end()) { /* top level is missing */ TreeIter rowp; TreeModel::Row parent; rowp = _model->append(); nodes[parts[0]] = rowp; parent = *(rowp); parent[_columns.name] = parts[0]; row = *(_model->append (parent.children())); } else { row = *(_model->append ((*r->second)->children())); } /* add this action */ if (l->empty ()) { row[_columns.name] = *t; } else { row[_columns.name] = *l; } row[_columns.path] = *p; } } bool ActionManager::ActionModel::find_action_in_model (const TreeModel::iterator& iter, std::string const & action_path, TreeModel::iterator* found) const { TreeModel::Row row = *iter; string path = row[_columns.path]; if (path == action_path) { *found = iter; return true; } return false; } void ActionManager::ActionModel::build_action_combo (ComboBox& cb, string const& current_action) const { cb.set_model (_model); cb.pack_start (_columns.name); if (current_action.empty()) { cb.set_active (0); /* "disabled" */ return; } TreeModel::iterator iter = _model->children().end(); _model->foreach_iter (sigc::bind (sigc::mem_fun (*this, &ActionManager::ActionModel::find_action_in_model), current_action, &iter)); if (iter != _model->children().end()) { cb.set_active (iter); } else { cb.set_active (0); } }