66 if (dof1.rank()==dof2.rank()) {
67 if (dof1.id() == dof2.id())
return dof1.field() < dof2.field();
68 else return dof1.id() < dof2.id();
71 return dof1.rank() < dof2.rank();
78 if (dof1->rank()==dof2->rank()) {
79 if (dof1->id() == dof2->id())
return dof1->field() < dof2->field();
80 else return dof1->id() < dof2->id();
83 return dof1->rank() < dof2->rank();
95 if (dof1.field()==dof2.field()) {
96 if (dof1.rank() == dof2.rank())
return dof1.id() < dof2.id();
97 else return dof1.rank() < dof2.rank();
100 return dof1.field() < dof2.field();
107 if (dof1->field()==dof2->field()) {
108 if (dof1->rank() == dof2->rank())
return dof1->id() < dof2->id();
109 else return dof1->rank() < dof2->rank();
112 return dof1->field() < dof2->field();