QTreeWidget Weights/Sorting

[wysota]

Reimplement bool operator< ( const QTreeWidgetItem & other ) const for your tree items and use the created subclass instead of QTreeWidgetItem.

[VireX]

Ok I reimplemented that in this way. However, will this sort "names" as well in alphabetical even if I override the original < operator? Or should I code that in too?

#include "XTreeItem.h"
 
bool QTreeWidgetItem::operator< ( const QTreeWidgetItem & other ) const {
  int iScore, iMyScore;
  iScore = 0;
  iMyScore = 0;
  if(other.flags() == 0){
    if(other.text(0) == QString("FIRST"))iScore = 100;
    if(other.text(0) == QString("SECOND"))iScore = 90;
    if(other.text(0) == QString("THIRD"))iScore = 80;
    if(other.text(0) == QString("FOURTH"))iScore = 70;
    if(other.text(0) == QString("FIFTH"))iScore = 60;
    if(other.text(0) == QString("SIXTH"))iScore = 50;
  }
  if(flags() == 0){
    if(text(0) == QString("FIRST"))iMyScore = 100;
    if(text(0) == QString("SECOND"))iMyScore = 90;
    if(text(0) == QString("THIRD"))iMyScore = 80;
    if(text(0) == QString("FOURTH"))iMyScore = 70;
    if(text(0) == QString("FIFTH"))iMyScore = 60;
    if(text(0) == QString("SIXTH"))iMyScore = 50;    
  }
  if(iMyScore < iScore){ return true; } else { return false; }
}
 
#include "XTreeItem.moc"

#include "XTreeItem.h"

bool QTreeWidgetItem::operator< ( const QTreeWidgetItem & other ) const {
  int iScore, iMyScore;
  iScore = 0;
  iMyScore = 0;
  if(other.flags() == 0){
    if(other.text(0) == QString("FIRST"))iScore = 100;
    if(other.text(0) == QString("SECOND"))iScore = 90;
    if(other.text(0) == QString("THIRD"))iScore = 80;
    if(other.text(0) == QString("FOURTH"))iScore = 70;
    if(other.text(0) == QString("FIFTH"))iScore = 60;
    if(other.text(0) == QString("SIXTH"))iScore = 50;
  }
  if(flags() == 0){
    if(text(0) == QString("FIRST"))iMyScore = 100;
    if(text(0) == QString("SECOND"))iMyScore = 90;
    if(text(0) == QString("THIRD"))iMyScore = 80;
    if(text(0) == QString("FOURTH"))iMyScore = 70;
    if(text(0) == QString("FIFTH"))iMyScore = 60;
    if(text(0) == QString("SIXTH"))iMyScore = 50;    
  }
  if(iMyScore < iScore){ return true; } else { return false; }
}

#include "XTreeItem.moc"

To copy to clipboard, switch view to plain text mode 

I know I shoulda used switches and/or functions better (more OO) but still is this basically what I should do to add weights?

[wysota]

What original operator? You have to subclass and reimplement the method in the subclass.

[VireX]

That's what I did, is the code correct?

[wysota]

bool QTreeWidgetItem::operator< ( const QTreeWidgetItem & other ) const

bool QTreeWidgetItem::operator< ( const QTreeWidgetItem & other ) const

To copy to clipboard, switch view to plain text mode 

This doesn't look like a subclass.

[VireX]

Because I forgot to change the name of the class, but yes, assume it is a subclass. You still have not commented on the actual code?

[wysota]

It's hard to understand it... Besides, it doesn't do much sorting... For instance it doesn't seem to compare values of items at all... Only their "flags". Is "flags" the only property of your items?

[VireX]

Well my toplevel nodes have 0 flags, so its only way to detect them, the rest have flags. And I'm assuming Qt will sort the rest by default (in other words my function and original function working together)

[wysota]

Well my toplevel nodes have 0 flags, so its only way to detect them, the rest have flags.

No. Top level nodes don't have parents. That's a way to detect them.

And I'm assuming Qt will sort the rest by default (in other words my function and original function working together)

But you never call the base class implementation so only your method gets called. That's how virtual methods work.

[VireX]

So how do I call it...?

Do I call it like this:
bool XTreeItem:perator< ( const QTreeWidgetItem & other ) const : QTreeWidgetItem:perator< (other) {

[wysota]

Call

QTreeWidgetItem::operator< ( other );

QTreeWidgetItem::operator< ( other );

To copy to clipboard, switch view to plain text mode 

in appropriate place of your reimplementation.

[VireX]

Thought so, thank you, lemme try this stuff.