Method Task_SortInputs

avida-core/source/main/cTaskLib.cc:2381–2486

}

double cTaskLib::Task_SortInputs(cTaskContext& ctx) const
{
  const cArgContainer& args = ctx.GetTaskEntry()->GetArguments();
  const tBuffer<int>& output = ctx.GetOutputBuffer();
  const int size = args.GetInt(0);
  const int stored = output.GetNumStored();
  
  // if less than half, can't possibly reach threshold
  if (stored <= (size / 2)) return 0.0;
  
  Apto::Map<int, int> valmap;
  int score = 0;
  int maxscore = 0;
  
  // add all valid inputs into the value map
  for (int i = 0; i < size; i++) valmap.Set(ctx.GetOrganism()->GetInputAt(i), -1);
  
  int span_start = -1;
  int span_end = stored;
  
  if (args.GetInt(2)) { // Contiguous
    // scan for the largest contiguous span
    // - in the event of a tie, keep the first discovered
    for (int i = 0; i < stored; i++) {
      if (valmap.Has(output[i])) {
        int t_start = i;
        while (++i < stored && valmap.Has(output[i])) ;
        if (span_start == -1 || (i - t_start) > (span_end - span_start)) {
          span_start = t_start;
          span_end = i;
        }
      }
    }
    
    // no span was found
    if (span_start == -1) return 0.0;    
  } else { // Scattered
    // search for first valid entry
    while (++span_start < stored && valmap.Has(output[span_start])) ;
    
    // scanned past the end of the output, nothing to validate
    if (span_start >= stored) return 0.0;
  }
  
  // again, if span is less than half the size can't possibly reach threshold
  if ((span_end - span_start) <= (size / 2)) return 0.0;
  
  // insertion sort span
  // - count number of actual entries
  // - count moves required
  // - update valmap, tracking observed inputs
  Apto::Array<int> sorted(size);
  const bool ascending = (args.GetInt(1) >= 0);
  int count = 1;
  
  // store first value
  valmap.Set(output[span_start], span_start);
  sorted[0] = output[span_start];