Beam Namespace Reference

Classes
class	beam
struct	beam_element

Functions
int	compare_on_cost (const void *void_a, const void *void_b)
int	compare_on_hash_then_cost (const void *void_a, const void *void_b)

Function Documentation

compare_on_cost()

int Beam::compare_on_cost ( const void *  void_a, const void *  void_b  )

inline

Definition at line 32 of file beam.h.

References a, Beam::beam_element< T >::active, and Beam::beam_element< T >::cost.

Referenced by Beam::beam< T >::compact().

{
  if (void_a == void_b)
    return 0;
  const beam_element<void> *a = (const beam_element<void> *)void_a;
  const beam_element<void> *b = (const beam_element<void> *)void_b;
  if (a->active && !b->active)
    return -1;  // active things come before inactive things
  else if (!a->active && b->active)
    return 1;
  else if (!a->active && !b->active)
    return 0;
  else if (a->cost < b->cost)
    return -1;  // otherwise sort by cost
  else if (a->cost > b->cost)
    return 1;
  else
    return 0;
}

compare_on_hash_then_cost()

int Beam::compare_on_hash_then_cost ( const void *  void_a, const void *  void_b  )

inline

Definition at line 52 of file beam.h.

References a, Beam::beam_element< T >::active, Beam::beam_element< T >::cost, and Beam::beam_element< T >::hash.

Referenced by Beam::beam< T >::do_recombination().

{
  if (void_a == void_b)
    return 0;
  const beam_element<void> *a = (const beam_element<void> *)void_a;
  const beam_element<void> *b = (const beam_element<void> *)void_b;
  if (a->active && !b->active)
    return -1;  // active things come before inactive things
  else if (!a->active && b->active)
    return 1;
  else if (!a->active && !b->active)
    return 0;
  else if (a->hash < b->hash)
    return -1;  // if the hashes are different, sort by hash
  else if (a->hash > b->hash)
    return 1;
  else if (a->cost < b->cost)
    return -1;  // otherwise sort by cost
  else if (a->cost > b->cost)
    return 1;
  else
    return 0;
}