int main(void)
{
struct calendar birthday, today;
int days;
char* param;
param = getParamString();
if (param == NULL){
printPage(ERROR, 0, NULL, NULL);
return 0;
}
getParameter(param, &birthday);
if (verifyDay(&birthday) == FAIL){
perror("Birthday verification failed");
printPage(INCORRECT, 0, NULL, NULL);
return 0;
}
getToday(&today);
if (verifyDay(&today) == FAIL){
perror("Today verification failed");
printPage(INCORRECT, 0, NULL, NULL);
return 0;
}
if (isGreaterThan(birthday, today)){ // Birthday is future
days = -computeDays(birthday, today);
}else{
days = computeDays(today, birthday);
}
printPage(SUCCESS, days, &birthday, &today);
return 0;
}
bool isRelOp() const {
return isEqual() ||
isNotEqual() ||
isLessThan() ||
isGreaterThan() ||
isLessThanEqual() ||
isGreaterThanEqual();
}
size_t decodeTileFrame(const std::vector<uint8_t>& frame, const Pal& pal, std::vector<Colour>& rawImage)
{
if(frame.size() == 1024 /*&& frame_num != 2593*/) // It's a fully opaque raw frame, width 32, from a level tileset
decodeRaw32(frame, pal, rawImage);
else if(isLessThan(frame))
decodeLessThan(frame, pal, rawImage);
else if(isGreaterThan(frame))
decodeGreaterThan(frame, pal, rawImage);
else
normalDecode(frame, 0, pal, rawImage, true); // pass zero as frameNum because it's only used for width calculation and width of tile frames is always 32
return 32;
}
void deleteNonMaximums(float** imgIn, float** contourAngles, int length, int width)
{
float gradAngle;
int i,j;
for(i = 1; i < length-1; i++)
{
for(j = 1; j < width-1; j++)
{
gradAngle = quantize(contourAngles[i][j] + 90);
if(!isGreaterThan(imgIn, i, j, gradAngle))
{
// Suppression du contour
imgIn[i][j] = 0.0;
}
}
}
}
void Token::print() const {
if( eol() ) std::cout << "NEWLINE" ;
else if( eof() ) std::cout << "ENDMARKER" ;
else if( indent() ) std::cout << "INDENT";
else if( dedent() ) std::cout << "DEDENT";
else if( isOpenBrace() ) std::cout << " { ";
else if( isCloseBrace() ) std::cout << " } ";
else if( isComma() ) std::cout << " , ";
else if( isPeriod()) std::cout<< ".";
else if( isEqual() ) std::cout << " == ";
else if( isNotEqual() ) std::cout << " != ";
else if( isLessThan() ) std::cout << " < ";
else if( isGreaterThan() ) std::cout << " > ";
else if( isLessThanEqual() ) std::cout << " <= ";
else if( isGreaterThanEqual() ) std::cout << " >= ";
else if( isOpenParen() ) std::cout << " ( " ;
else if( isCloseParen() ) std::cout << " ) " ;
else if( isAssignmentOperator() ) std::cout << " = ";
else if( isColon() ) std::cout << " : " ;
else if( isMultiplicationOperator() ) std::cout << " * " ;
else if( isAdditionOperator() ) std::cout << " + ";
else if( isSubtractionOperator() ) std::cout << " - ";
else if( isModuloOperator() ) std::cout << " % ";
else if( isDivisionOperator() ) std::cout << " / ";
else if( isFloorDivision() ) std::cout << " // ";
else if( isOpenBrack() ) std::cout<< "[";
else if( isCloseBrack() ) std::cout<< "]";
else if( isName() ) std::cout << getName();
else if( isKeyword() ) std::cout << getKeyword();
else if( isWholeNumber() ) std::cout << getWholeNumber();
else if( isFloat() ) std::cout << getFloat();
else if( isString() ) std::cout << getString();
else if( isCall() ) std::cout << "CALL " << getName();
else if( isSub() ) std::cout << "ARRAY SUB " << getName();
else if( isAppend() ) std::cout << "ARRAY APPEND " << getName();
else if( isPop() ) std::cout << "ARRAY POP " << getName();
else std::cout << "Uninitialized token.\n";
}
bool isGreaterThan(TreeNode *node, int val) {
return node == NULL ||
(node->val > val && isGreaterThan(node->right, node->val) &&
isGreaterThan(node->left, val) &&
isLessThan(node->left, node->val));
}
bool isValidBST(TreeNode* root) {
return root == NULL ||
(isLessThan(root->left, root->val) &&
isGreaterThan(root->right, root->val));
}
