mirror of
https://github.com/boostorg/build.git
synced 2026-02-15 13:02:11 +00:00
48 lines
1.5 KiB
C
48 lines
1.5 KiB
C
/* Copyright Vladimir Prus 2003. Distributed under the Boost */
|
|
/* Software License, Version 1.0. (See accompanying */
|
|
/* file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) */
|
|
|
|
#include "../native.h"
|
|
#include "../object.h"
|
|
|
|
# ifndef max
|
|
# define max( a,b ) ((a)>(b)?(a):(b))
|
|
# endif
|
|
|
|
|
|
LIST *sequence_select_highest_ranked( FRAME *frame, int flags )
|
|
{
|
|
/* Returns all of 'elements' for which corresponding element in parallel */
|
|
/* list 'rank' is equal to the maximum value in 'rank'. */
|
|
|
|
LIST* elements = lol_get( frame->args, 0 );
|
|
LIST* rank = lol_get( frame->args, 1 );
|
|
LISTITER iter, end, elements_iter, elements_end;
|
|
|
|
LIST* result = L0;
|
|
LIST* tmp;
|
|
int highest_rank = -1;
|
|
|
|
iter = list_begin(rank), end = list_end(rank);
|
|
for (; iter != end; iter = list_next(iter))
|
|
highest_rank = max(highest_rank, atoi(object_str(list_item(iter))));
|
|
|
|
iter = list_begin(rank), end = list_end(rank);
|
|
elements_iter = list_begin(elements), elements_end = list_end(elements);
|
|
for (; iter != end; iter = list_next(iter), elements_iter = list_next(elements_iter))
|
|
if (atoi(object_str(list_item(iter))) == highest_rank)
|
|
result = list_push_back(result, object_copy(list_item(elements_iter)));
|
|
|
|
return result;
|
|
}
|
|
|
|
void init_sequence()
|
|
{
|
|
{
|
|
const char* args[] = { "elements", "*", ":", "rank", "*", 0 };
|
|
declare_native_rule("sequence", "select-highest-ranked", args,
|
|
sequence_select_highest_ranked, 1);
|
|
}
|
|
|
|
}
|