generate_py_struct_definition(f_types_, tstruct, is_exception);
}
+/**
+ * Comparator to sort fields in ascending order by key.
+ * Make this a functor instead of a function to help GCC inline it.
+ * The arguments are (const) references to const pointers to const t_fields.
+ * Unfortunately, we cannot declare it within the function. Boo!
+ * http://www.open-std.org/jtc1/sc22/open/n2356/ (paragraph 9).
+ */
+struct FieldKeyCompare {
+ bool operator()(t_field const * const & a, t_field const * const & b) {
+ return a->get_key() < b->get_key();
+ }
+};
+
/**
* Generates a struct definition for a thrift data type.
*
const vector<t_field*>& members = tstruct->get_members();
vector<t_field*>::const_iterator m_iter;
+ vector<t_field*> sorted_members(members);
+ std::sort(sorted_members.begin(), sorted_members.end(), FieldKeyCompare());
out <<
"class " << tstruct->get_name();
// for structures with no members.
// TODO(dreiss): Test encoding of structs where some inner structs
// don't have thrift_spec.
- if (members.empty() || (members[0]->get_key() >= 0)) {
+ if (sorted_members.empty() || (sorted_members[0]->get_key() >= 0)) {
indent(out) << "thrift_spec = (" << endl;
indent_up();
int sorted_keys_pos = 0;
- for (m_iter = members.begin(); m_iter != members.end(); ++m_iter) {
+ for (m_iter = sorted_members.begin(); m_iter != sorted_members.end(); ++m_iter) {
for (; sorted_keys_pos != (*m_iter)->get_key(); sorted_keys_pos++) {
indent(out) << "None, # " << sorted_keys_pos << endl;
type_->get_fingerprint_material();
}
- /**
- * Comparator to sort fields in ascending order by key.
- * Make this a functor instead of a function to help GCC inline it.
- * The arguments are (const) references to const pointers to const t_fields.
- */
- struct key_compare {
- bool operator()(t_field const * const & a, t_field const * const & b) {
- return a->get_key() < b->get_key();
- }
- };
-
-
private:
t_type* type_;
std::string name_;
#ifndef T_STRUCT_H
#define T_STRUCT_H
-#include <algorithm>
#include <vector>
-#include <utility>
#include <string>
#include "t_type.h"
*/
class t_struct : public t_type {
public:
- typedef std::vector<t_field*> members_type;
-
t_struct(t_program* program) :
t_type(program),
is_xception_(false),
return xsd_all_;
}
- bool append(t_field* elem) {
- typedef members_type::iterator iter_type;
- std::pair<iter_type, iter_type> bounds = std::equal_range(
- members_.begin(), members_.end(), elem, t_field::key_compare()
- );
- if (bounds.first != bounds.second) {
- return false;
- }
- members_.insert(bounds.second, elem);
- return true;
+ void append(t_field* elem) {
+ members_.push_back(elem);
}
- const members_type& get_members() {
+ const std::vector<t_field*>& get_members() {
return members_;
}
virtual std::string get_fingerprint_material() const {
std::string rv = "{";
- members_type::const_iterator m_iter;
+ std::vector<t_field*>::const_iterator m_iter;
for (m_iter = members_.begin(); m_iter != members_.end(); ++m_iter) {
rv += (*m_iter)->get_fingerprint_material();
rv += ";";
virtual void generate_fingerprint() {
t_type::generate_fingerprint();
- members_type::const_iterator m_iter;
+ std::vector<t_field*>::const_iterator m_iter;
for (m_iter = members_.begin(); m_iter != members_.end(); ++m_iter) {
(*m_iter)->get_type()->generate_fingerprint();
}
}
+ bool validate_field(t_field* field) {
+ int key = field->get_key();
+ std::vector<t_field*>::const_iterator m_iter;
+ for (m_iter = members_.begin(); m_iter != members_.end(); ++m_iter) {
+ if ((*m_iter)->get_key() == key) {
+ return false;
+ }
+ }
+ return true;
+ }
+
private:
- members_type members_;
+ std::vector<t_field*> members_;
bool is_xception_;
bool xsd_all_;
{
pdebug("FieldList -> FieldList , Field");
$$ = $1;
- if (!($$->append($2))) {
+ if (!($$->validate_field($2))) {
yyerror("Field identifier %d for \"%s\" has already been used", $2->get_key(), $2->get_name().c_str());
exit(1);
}
+ $$->append($2);
}
|
{