TEST(BitopsTest, fill1){
std::bitset<64> bitset;
fill1(bitset);
EXPECT_TRUE(bitset.all());
bitset.reset();
fill1(bitset, 20, 41);
for (size_t i = 0; i < bitset.size(); ++i) {
if (i >= 20 && i <= 40){
EXPECT_TRUE(bitset.test(i));
}else{
EXPECT_FALSE(bitset.test(i));
}
}
}
TEST(ustl_forward_list, constructors) {
// default:
ustl::forward_list<int> l1;
l1.insert_after(l1.before_begin(), 3);
ASSERT_EQ(3, l1.front());
// fill:
ustl::forward_list<int> fill1(ustl::forward_list<int>::size_type(10));
auto it1 = fill1.begin();
for (size_t i = 0; i < 10; i++)
ASSERT_EQ(*it1++, 0);
ustl::forward_list<int> fill2(ustl::forward_list<int>::size_type(10),
static_cast<int>(-1));
auto it2 = fill2.begin();
for (size_t i = 0; i < 10; i++)
ASSERT_EQ(*it2++, -1);
// range:
ustl::vector<int> v1{1, 2, 3};
ustl::forward_list<int> range1(v1.begin(), v1.end());
const ustl::forward_list<int> range1a{1, 2, 3};
ASSERT_TRUE(range1 == range1a);
// copy:
ustl::forward_list<int> copy1(range1);
ASSERT_TRUE(copy1 == range1a);
// initializer list:
ustl::forward_list<int> l2{1, 2, 3, 4, 5};
const ustl::forward_list<int> l3{1, 2, 3, 4, 5};
ASSERT_TRUE(l2 == l3);
}
// Here's a simple wrapper function for fill1. It requires that the passed
// NumPy array be exactly what we're looking for - no conversion from nested
// sequences or arrays with other data types, because we want to modify it
// in-place.
void wrap_fill1(np::ndarray const & array) {
if (array.get_dtype() != np::dtype::get_builtin<double>()) {
PyErr_SetString(PyExc_TypeError, "Incorrect array data type");
p::throw_error_already_set();
}
if (array.get_nd() != 2) {
PyErr_SetString(PyExc_TypeError, "Incorrect number of dimensions");
p::throw_error_already_set();
}
fill1(reinterpret_cast<double*>(array.get_data()),
array.shape(0), array.shape(1),
array.strides(0) / sizeof(double), array.strides(1) / sizeof(double));
}
void Ffill(CL_FORM *base, int nargs)
{
BOOL supl_flags[2];
static CL_FORM * keylist[] =
{
SYMBOL(Slisp, 231), /* START */
SYMBOL(Slisp, 232), /* END */
};
keysort(ARG(2), nargs - 2, 2, keylist, supl_flags, FALSE);
if(NOT(supl_flags[0]))
{
LOAD_FIXNUM(ARG(4), 0, ARG(2));
}
if(NOT(supl_flags[1]))
{
LOAD_NIL(ARG(3));
}
fill1(ARG(0));
}
int main(){
int N,K,rest;
scanf("%d %d",&N,&K);
rest=N%K+N/K;
people* ls=malloc(N*sizeof(*ls));
people* last=malloc(rest*sizeof(*last));
people* before=malloc(N/K*sizeof(*before));
for (int i=0; i<N; i++) {
ls[i].height=0;
for (int j=0; j<10; j++) {
ls[i].name[j]=0;
}
}
for (int i=0; i<rest; i++) {
last[i].height=0;
for (int j=0; j<10; j++) {
last[i].name[j]=0;
}
}
for (int i=0; i<N/K; i++) {
before[i].height=0;
for (int j=0; j<10; j++) {
before[i].name[j]=0;
}
}
for (int i=0; i<N; i++) {
scanf("%s %d",ls[i].name,&ls[i].height);
}
qsort(ls, N, sizeof(*ls), compar);
for (int i=N-1,count=1; i>=N-rest; i--,count++) {
fill1(ls[i], last, count, rest);
}
for (int i=0; i<rest; i++) {
printf("%s",last[i].name);
if (i!=rest-1) {
printf(" ");
}
}
printf("\n");
for (int i=N-rest-1; i>=0; i-=N/K) {
for (int j=i,count=1; j>i-N/K; j--,count++) {
fill1(ls[j], before, count, N/K);
}
for (int j=0; j<N/K; j++) {
printf("%s",before[j].name);
if (j!=N/K-1) {
printf(" ");
}
}
printf("\n");
for (int k=0; k<N/K; k++) {
before[k].height=0;
for (int l=0; before[k].name[l]; l++) {
before[k].name[l]=0;
}
}
}
}
void scan(unsigned char* in)
{
{
unsigned char yych;
if (limit1 <= cursor1) fill1(1);
yych = *cursor1;
{
static void *yytarget[256] = {
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy2, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy11, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy3, &&yy5, &&yy7, &&yy9, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13
};
goto *yytarget[yych];
}
yy2:
yy3:
++cursor1;
return "a";
yy5:
++cursor1;
return "b";
yy7:
++cursor1;
return "c";
yy9:
++cursor1;
return "d";
yy11:
++cursor1;
return "1";
yy13:
++cursor1;
return ".";
}
}
void scan(unsigned short* in)
{
{
unsigned short yych;
if (limit2 <= cursor2) fill2(1);
yych = *cursor2;
if (yych & ~0xFF) {
goto yy13;
} else {
static void *yytarget[256] = {
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy2, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy11, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy3, &&yy5, &&yy7, &&yy9, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13,
&&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13, &&yy13
};
goto *yytarget[yych];
}
yy2:
yy3:
++cursor2;
return "a";
yy5:
++cursor2;
return "b";
yy7:
++cursor2;
return "c";
yy9:
++cursor2;
return "d";
yy11:
++cursor2;
return "2";
yy13:
++cursor2;
return ".";
}
}
fixed_bit_vector* fixed_bit_vector_manager::allocate1() {
fixed_bit_vector* result = allocate();
fill1(*result);
return result;
}
