/src/lib/util/huffman.c

529  //-------------------------------------------------
530  //  tree_node_compare - compare two tree nodes
531  //  by weight
532  //-------------------------------------------------
533  
534  int CLIB_DECL huffman_context_base::tree_node_compare(const void *item1, const void *item2)
535  {
536      const node_t *node1 = *(const node_t **)item1;
537      const node_t *node2 = *(const node_t **)item2;
538      return node2->m_weight - node1->m_weight;
539  }

...

565      // sort the list by weight, largest weight first
566      qsort(list, listitems, sizeof(list[0]), tree_node_compare);