Reset23/the-stack-v2-blamed-cpp · Datasets at Hugging Face

6fd3487080fe3dc41f146d616626b3a9059c4acb

9b7fc94d86ebd44369ecc9980cd5a25c02653f1e

/www/remote/arduino/darwin/hardware/tools/avr/lib/gcc/avr/5.4.0/plugin/include/tree.h

898572fbfa9c4f3a3b5faeba1f1f39a7ffd6e8cc

[ "LicenseRef-scancode-unknown-license-reference", "CC0-1.0" ]

permissive

sanyaade-robotic/MyQode-builder

86ddb0df38908f748c445e7c7a15b440435a36f1

ea2e35c08aa512bc692eb72098e98530d1ffd98c

refs/heads/master

2020-12-20T20:37:57.740556

2020-01-25T17:02:37

236,200,261

0

CC0-1.0

2020-01-25T17:01:30

2020-01-25T17:01:29

null

UTF-8

C++

false

202,424

h

/* Definitions for the ubiquitous 'tree' type for GNU compilers. Copyright (C) 1989-2015 Free Software Foundation, Inc. This file is part of GCC. GCC is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3, or (at your option) any later version. GCC is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GCC; see the file COPYING3. If not see <http://www.gnu.org/licenses/>. */ #ifndef GCC_TREE_H #define GCC_TREE_H #include "tree-core.h" #include "machmode.h" /* Macros for initializing `tree_contains_struct'. */ #define MARK_TS_BASE(C) \ do { \ tree_contains_struct[C][TS_BASE] = 1; \ } while (0) #define MARK_TS_TYPED(C) \ do { \ MARK_TS_BASE (C); \ tree_contains_struct[C][TS_TYPED] = 1; \ } while (0) #define MARK_TS_COMMON(C) \ do { \ MARK_TS_TYPED (C); \ tree_contains_struct[C][TS_COMMON] = 1; \ } while (0) #define MARK_TS_TYPE_COMMON(C) \ do { \ MARK_TS_COMMON (C); \ tree_contains_struct[C][TS_TYPE_COMMON] = 1; \ } while (0) #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \ do { \ MARK_TS_TYPE_COMMON (C); \ tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = 1; \ } while (0) #define MARK_TS_DECL_MINIMAL(C) \ do { \ MARK_TS_COMMON (C); \ tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \ } while (0) #define MARK_TS_DECL_COMMON(C) \ do { \ MARK_TS_DECL_MINIMAL (C); \ tree_contains_struct[C][TS_DECL_COMMON] = 1; \ } while (0) #define MARK_TS_DECL_WRTL(C) \ do { \ MARK_TS_DECL_COMMON (C); \ tree_contains_struct[C][TS_DECL_WRTL] = 1; \ } while (0) #define MARK_TS_DECL_WITH_VIS(C) \ do { \ MARK_TS_DECL_WRTL (C); \ tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \ } while (0) #define MARK_TS_DECL_NON_COMMON(C) \ do { \ MARK_TS_DECL_WITH_VIS (C); \ tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \ } while (0) /* Returns the string representing CLASS. */ #define TREE_CODE_CLASS_STRING(CLASS)\ tree_code_class_strings[(int) (CLASS)] #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)] /* Nonzero if NODE represents an exceptional code. */ #define EXCEPTIONAL_CLASS_P(NODE)\ (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional) /* Nonzero if NODE represents a constant. */ #define CONSTANT_CLASS_P(NODE)\ (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant) /* Nonzero if NODE represents a type. */ #define TYPE_P(NODE)\ (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type) /* Nonzero if NODE represents a declaration. */ #define DECL_P(NODE)\ (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration) /* True if NODE designates a variable declaration. */ #define VAR_P(NODE) \ (TREE_CODE (NODE) == VAR_DECL) /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */ #define VAR_OR_FUNCTION_DECL_P(DECL)\ (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL) /* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in ascending code order. */ #define INDIRECT_REF_P(NODE)\ (TREE_CODE (NODE) == INDIRECT_REF) /* Nonzero if NODE represents a reference. */ #define REFERENCE_CLASS_P(NODE)\ (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference) /* Nonzero if NODE represents a comparison. */ #define COMPARISON_CLASS_P(NODE)\ (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison) /* Nonzero if NODE represents a unary arithmetic expression. */ #define UNARY_CLASS_P(NODE)\ (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary) /* Nonzero if NODE represents a binary arithmetic expression. */ #define BINARY_CLASS_P(NODE)\ (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary) /* Nonzero if NODE represents a statement expression. */ #define STATEMENT_CLASS_P(NODE)\ (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement) /* Nonzero if NODE represents a function call-like expression with a variable-length operand vector. */ #define VL_EXP_CLASS_P(NODE)\ (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp) /* Nonzero if NODE represents any other expression. */ #define EXPRESSION_CLASS_P(NODE)\ (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression) /* Returns nonzero iff NODE represents a type or declaration. */ #define IS_TYPE_OR_DECL_P(NODE)\ (TYPE_P (NODE) || DECL_P (NODE)) /* Returns nonzero iff CLASS is the tree-code class of an expression. */ #define IS_EXPR_CODE_CLASS(CLASS)\ ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression) /* Returns nonzero iff NODE is an expression of some kind. */ #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)] /* Helper macros for math builtins. */ #define BUILTIN_EXP10_P(FN) \ ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \ || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L) #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \ || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \ || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L) #define BUILTIN_SQRT_P(FN) \ ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL) #define BUILTIN_CBRT_P(FN) \ ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL) #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN)) #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX #define NULL_TREE (tree) NULL /* Define accessors for the fields that all tree nodes have (though some fields are not used for all kinds of nodes). */ /* The tree-code says what kind of node it is. Codes are defined in tree.def. */ #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code) #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE)) /* When checking is enabled, errors will be generated if a tree node is accessed incorrectly. The macros die with a fatal error. */ #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) #define TREE_CHECK(T, CODE) \ (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE))) #define TREE_NOT_CHECK(T, CODE) \ (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE))) #define TREE_CHECK2(T, CODE1, CODE2) \ (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2))) #define TREE_NOT_CHECK2(T, CODE1, CODE2) \ (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2))) #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \ (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3))) #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \ (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \ (CODE1), (CODE2), (CODE3))) #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \ (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \ (CODE1), (CODE2), (CODE3), (CODE4))) #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \ (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \ (CODE1), (CODE2), (CODE3), (CODE4))) #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \ (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \ (CODE1), (CODE2), (CODE3), (CODE4), (CODE5))) #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \ (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \ (CODE1), (CODE2), (CODE3), (CODE4), (CODE5))) #define CONTAINS_STRUCT_CHECK(T, STRUCT) \ (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__)) #define TREE_CLASS_CHECK(T, CLASS) \ (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__)) #define TREE_RANGE_CHECK(T, CODE1, CODE2) \ (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__)) #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \ (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__)) #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \ (omp_clause_range_check ((T), (CODE1), (CODE2), \ __FILE__, __LINE__, __FUNCTION__)) /* These checks have to be special cased. */ #define EXPR_CHECK(T) \ (expr_check ((T), __FILE__, __LINE__, __FUNCTION__)) /* These checks have to be special cased. */ #define NON_TYPE_CHECK(T) \ (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__)) /* These checks have to be special cased. */ #define ANY_INTEGRAL_TYPE_CHECK(T) \ (any_integral_type_check ((T), __FILE__, __LINE__, __FUNCTION__)) #define TREE_INT_CST_ELT_CHECK(T, I) \ (*tree_int_cst_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)) #define TREE_VEC_ELT_CHECK(T, I) \ (*(CONST_CAST2 (tree *, typeof (T)*, \ tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))) #define OMP_CLAUSE_ELT_CHECK(T, I) \ (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))) /* Special checks for TREE_OPERANDs. */ #define TREE_OPERAND_CHECK(T, I) \ (*(CONST_CAST2 (tree*, typeof (T)*, \ tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))) #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \ (*(tree_operand_check_code ((T), (CODE), (I), \ __FILE__, __LINE__, __FUNCTION__))) /* Nodes are chained together for many purposes. Types are chained together to record them for being output to the debugger (see the function `chain_type'). Decls in the same scope are chained together to record the contents of the scope. Statement nodes for successive statements used to be chained together. Often lists of things are represented by TREE_LIST nodes that are chained together. */ #define TREE_CHAIN(NODE) \ (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain) /* In all nodes that are expressions, this is the data type of the expression. In POINTER_TYPE nodes, this is the type that the pointer points to. In ARRAY_TYPE nodes, this is the type of the elements. In VECTOR_TYPE nodes, this is the type of the elements. */ #define TREE_TYPE(NODE) \ (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type) extern void tree_contains_struct_check_failed (const_tree, const enum tree_node_structure_enum, const char *, int, const char *) ATTRIBUTE_NORETURN; extern void tree_check_failed (const_tree, const char *, int, const char *, ...) ATTRIBUTE_NORETURN; extern void tree_not_check_failed (const_tree, const char *, int, const char *, ...) ATTRIBUTE_NORETURN; extern void tree_class_check_failed (const_tree, const enum tree_code_class, const char *, int, const char *) ATTRIBUTE_NORETURN; extern void tree_range_check_failed (const_tree, const char *, int, const char *, enum tree_code, enum tree_code) ATTRIBUTE_NORETURN; extern void tree_not_class_check_failed (const_tree, const enum tree_code_class, const char *, int, const char *) ATTRIBUTE_NORETURN; extern void tree_int_cst_elt_check_failed (int, int, const char *, int, const char *) ATTRIBUTE_NORETURN; extern void tree_vec_elt_check_failed (int, int, const char *, int, const char *) ATTRIBUTE_NORETURN; extern void phi_node_elt_check_failed (int, int, const char *, int, const char *) ATTRIBUTE_NORETURN; extern void tree_operand_check_failed (int, const_tree, const char *, int, const char *) ATTRIBUTE_NORETURN; extern void omp_clause_check_failed (const_tree, const char *, int, const char *, enum omp_clause_code) ATTRIBUTE_NORETURN; extern void omp_clause_operand_check_failed (int, const_tree, const char *, int, const char *) ATTRIBUTE_NORETURN; extern void omp_clause_range_check_failed (const_tree, const char *, int, const char *, enum omp_clause_code, enum omp_clause_code) ATTRIBUTE_NORETURN; #else /* not ENABLE_TREE_CHECKING, or not gcc */ #define CONTAINS_STRUCT_CHECK(T, ENUM) (T) #define TREE_CHECK(T, CODE) (T) #define TREE_NOT_CHECK(T, CODE) (T) #define TREE_CHECK2(T, CODE1, CODE2) (T) #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T) #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T) #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T) #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) #define TREE_CLASS_CHECK(T, CODE) (T) #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T) #define EXPR_CHECK(T) (T) #define NON_TYPE_CHECK(T) (T) #define TREE_INT_CST_ELT_CHECK(T, I) ((T)->int_cst.val[I]) #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I]) #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I]) #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I]) #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i]) #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T) #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T) #define ANY_INTEGRAL_TYPE_CHECK(T) (T) #define TREE_CHAIN(NODE) ((NODE)->common.chain) #define TREE_TYPE(NODE) ((NODE)->typed.type) #endif #define TREE_BLOCK(NODE) (tree_block (NODE)) #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B))) #include "tree-check.h" #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type) #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL) #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON) #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL) #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS) #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON) #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant) #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement) #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp) #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE) #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE) #define RECORD_OR_UNION_CHECK(T) \ TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) #define NOT_RECORD_OR_UNION_CHECK(T) \ TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) #define NUMERICAL_TYPE_CHECK(T) \ TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \ FIXED_POINT_TYPE) /* Here is how primitive or already-canonicalized types' hash codes are made. */ #define TYPE_HASH(TYPE) (TYPE_UID (TYPE)) /* A simple hash function for an arbitrary tree node. This must not be used in hash tables which are saved to a PCH. */ #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777) /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */ #define CONVERT_EXPR_CODE_P(CODE) \ ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR) /* Similarly, but accept an expression instead of a tree code. */ #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP)) /* Generate case for NOP_EXPR, CONVERT_EXPR. */ #define CASE_CONVERT \ case NOP_EXPR: \ case CONVERT_EXPR /* Given an expression as a tree, strip any conversion that generates no instruction. Accepts both tree and const_tree arguments since we are not modifying the tree itself. */ #define STRIP_NOPS(EXP) \ (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP)) /* Like STRIP_NOPS, but don't let the signedness change either. */ #define STRIP_SIGN_NOPS(EXP) \ (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP)) /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */ #define STRIP_TYPE_NOPS(EXP) \ while ((CONVERT_EXPR_P (EXP) \ || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ && TREE_OPERAND (EXP, 0) != error_mark_node \ && (TREE_TYPE (EXP) \ == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ (EXP) = TREE_OPERAND (EXP, 0) /* Remove unnecessary type conversions according to tree_ssa_useless_type_conversion. */ #define STRIP_USELESS_TYPE_CONVERSION(EXP) \ (EXP) = tree_ssa_strip_useless_type_conversions (EXP) /* Nonzero if TYPE represents a vector type. */ #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE) /* Nonzero if TYPE represents an integral type. Note that we do not include COMPLEX types here. Keep these checks in ascending code order. */ #define INTEGRAL_TYPE_P(TYPE) \ (TREE_CODE (TYPE) == ENUMERAL_TYPE \ || TREE_CODE (TYPE) == BOOLEAN_TYPE \ || TREE_CODE (TYPE) == INTEGER_TYPE) /* Nonzero if TYPE represents an integral type, including complex and vector integer types. */ #define ANY_INTEGRAL_TYPE_P(TYPE) \ (INTEGRAL_TYPE_P (TYPE) \ || ((TREE_CODE (TYPE) == COMPLEX_TYPE \ || VECTOR_TYPE_P (TYPE)) \ && INTEGRAL_TYPE_P (TREE_TYPE (TYPE)))) /* Nonzero if TYPE represents a non-saturating fixed-point type. */ #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \ (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE)) /* Nonzero if TYPE represents a saturating fixed-point type. */ #define SAT_FIXED_POINT_TYPE_P(TYPE) \ (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE)) /* Nonzero if TYPE represents a fixed-point type. */ #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE) /* Nonzero if TYPE represents a scalar floating-point type. */ #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE) /* Nonzero if TYPE represents a complex floating-point type. */ #define COMPLEX_FLOAT_TYPE_P(TYPE) \ (TREE_CODE (TYPE) == COMPLEX_TYPE \ && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) /* Nonzero if TYPE represents a vector integer type. */ #define VECTOR_INTEGER_TYPE_P(TYPE) \ (VECTOR_TYPE_P (TYPE) \ && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE) /* Nonzero if TYPE represents a vector floating-point type. */ #define VECTOR_FLOAT_TYPE_P(TYPE) \ (VECTOR_TYPE_P (TYPE) \ && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) /* Nonzero if TYPE represents a floating-point type, including complex and vector floating-point types. The vector and complex check does not use the previous two macros to enable early folding. */ #define FLOAT_TYPE_P(TYPE) \ (SCALAR_FLOAT_TYPE_P (TYPE) \ || ((TREE_CODE (TYPE) == COMPLEX_TYPE \ || VECTOR_TYPE_P (TYPE)) \ && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE)))) /* Nonzero if TYPE represents a decimal floating-point type. */ #define DECIMAL_FLOAT_TYPE_P(TYPE) \ (SCALAR_FLOAT_TYPE_P (TYPE) \ && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE))) /* Nonzero if TYPE is a record or union type. */ #define RECORD_OR_UNION_TYPE_P(TYPE) \ (TREE_CODE (TYPE) == RECORD_TYPE \ || TREE_CODE (TYPE) == UNION_TYPE \ || TREE_CODE (TYPE) == QUAL_UNION_TYPE) /* Nonzero if TYPE represents an aggregate (multi-component) type. Keep these checks in ascending code order. */ #define AGGREGATE_TYPE_P(TYPE) \ (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE)) /* Nonzero if TYPE represents a pointer or reference type. (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in ascending code order. */ #define POINTER_TYPE_P(TYPE) \ (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE) /* Nonzero if TYPE represents a pointer to function. */ #define FUNCTION_POINTER_TYPE_P(TYPE) \ (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE) /* Nonzero if this type is a complete type. */ #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE) /* Nonzero if this type is a pointer bounds type. */ #define POINTER_BOUNDS_TYPE_P(NODE) \ (TREE_CODE (NODE) == POINTER_BOUNDS_TYPE) /* Nonzero if this node has a pointer bounds type. */ #define POINTER_BOUNDS_P(NODE) \ (POINTER_BOUNDS_TYPE_P (TREE_TYPE (NODE))) /* Nonzero if this type supposes bounds existence. */ #define BOUNDED_TYPE_P(type) (POINTER_TYPE_P (type)) /* Nonzero for objects with bounded type. */ #define BOUNDED_P(node) \ BOUNDED_TYPE_P (TREE_TYPE (node)) /* Nonzero if this type is the (possibly qualified) void type. */ #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE) /* Nonzero if this type is complete or is cv void. */ #define COMPLETE_OR_VOID_TYPE_P(NODE) \ (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE)) /* Nonzero if this type is complete or is an array with unspecified bound. */ #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \ (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE))) /* Define many boolean fields that all tree nodes have. */ /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address of this is needed. So it cannot be in a register. In a FUNCTION_DECL it has no meaning. In LABEL_DECL nodes, it means a goto for this label has been seen from a place outside all binding contours that restore stack levels. In an artificial SSA_NAME that points to a stack partition with at least two variables, it means that at least one variable has TREE_ADDRESSABLE. In ..._TYPE nodes, it means that objects of this type must be fully addressable. This means that pieces of this object cannot go into register parameters, for example. If this a function type, this means that the value must be returned in memory. In CONSTRUCTOR nodes, it means object constructed must be in memory. In IDENTIFIER_NODEs, this means that some extern decl for this name had its address taken. That matters for inline functions. In a STMT_EXPR, it means we want the result of the enclosed expression. */ #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag) /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the exit of a function. Calls for which this is true are candidates for tail call optimizations. */ #define CALL_EXPR_TAILCALL(NODE) \ (CALL_EXPR_CHECK (NODE)->base.addressable_flag) /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the CASE_LOW operand has been processed. */ #define CASE_LOW_SEEN(NODE) \ (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag) #define PREDICT_EXPR_OUTCOME(NODE) \ ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag)) #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \ (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME) #define PREDICT_EXPR_PREDICTOR(NODE) \ ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0))) /* In a VAR_DECL, nonzero means allocate static storage. In a FUNCTION_DECL, nonzero if function has been defined. In a CONSTRUCTOR, nonzero means allocate static storage. */ #define TREE_STATIC(NODE) ((NODE)->base.static_flag) /* In an ADDR_EXPR, nonzero means do not use a trampoline. */ #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag) /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup should only be executed if an exception is thrown, not on normal exit of its scope. */ #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag) /* In a TRY_CATCH_EXPR, means that the handler should be considered a separate cleanup in honor_protect_cleanup_actions. */ #define TRY_CATCH_IS_CLEANUP(NODE) \ (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag) /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the CASE_HIGH operand has been processed. */ #define CASE_HIGH_SEEN(NODE) \ (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag) /* Used to mark scoped enums. */ #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag) /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */ #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag) /* In an expr node (usually a conversion) this means the node was made implicitly and should not lead to any sort of warning. In a decl node, warnings concerning the decl should be suppressed. This is used at least for used-before-set warnings, and it set after one warning is emitted. */ #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag) /* Used to indicate that this TYPE represents a compiler-generated entity. */ #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag) /* In an IDENTIFIER_NODE, this means that assemble_name was called with this string as an argument. */ #define TREE_SYMBOL_REFERENCED(NODE) \ (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag) /* Nonzero in a pointer or reference type means the data pointed to by this type can alias anything. */ #define TYPE_REF_CAN_ALIAS_ALL(NODE) \ (PTR_OR_REF_CHECK (NODE)->base.static_flag) /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means there was an overflow in folding. */ #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag) /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */ #define TREE_OVERFLOW_P(EXPR) \ (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR)) /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL, nonzero means name is to be accessible from outside this translation unit. In an IDENTIFIER_NODE, nonzero means an external declaration accessible from outside this translation unit was previously seen for this name in an inner scope. */ #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag) /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector of cached values, or is something else. */ #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag) /* In a SAVE_EXPR, indicates that the original expression has already been substituted with a VAR_DECL that contains the value. */ #define SAVE_EXPR_RESOLVED_P(NODE) \ (SAVE_EXPR_CHECK (NODE)->base.public_flag) /* Set on a CALL_EXPR if this stdarg call should be passed the argument pack. */ #define CALL_EXPR_VA_ARG_PACK(NODE) \ (CALL_EXPR_CHECK (NODE)->base.public_flag) /* In any expression, decl, or constant, nonzero means it has side effects or reevaluation of the whole expression could produce a different value. This is set if any subexpression is a function call, a side effect or a reference to a volatile variable. In a ..._DECL, this is set only if the declaration said `volatile'. This will never be set for a constant. */ #define TREE_SIDE_EFFECTS(NODE) \ (NON_TYPE_CHECK (NODE)->base.side_effects_flag) /* In a LABEL_DECL, nonzero means this label had its address taken and therefore can never be deleted and is a jump target for computed gotos. */ #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag) /* Nonzero means this expression is volatile in the C sense: its address should be of type `volatile WHATEVER *'. In other words, the declared item is volatile qualified. This is used in _DECL nodes and _REF nodes. On a FUNCTION_DECL node, this means the function does not return normally. This is the same effect as setting the attribute noreturn on the function in C. In a ..._TYPE node, means this type is volatile-qualified. But use TYPE_VOLATILE instead of this macro when the node is a type, because eventually we may make that a different bit. If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */ #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag) /* Nonzero means this node will not trap. In an INDIRECT_REF, means accessing the memory pointed to won't generate a trap. However, this only applies to an object when used appropriately: it doesn't mean that writing a READONLY mem won't trap. In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index (or slice of the array) always belongs to the range of the array. I.e. that the access will not trap, provided that the access to the base to the array will not trap. */ #define TREE_THIS_NOTRAP(NODE) \ (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \ ARRAY_RANGE_REF)->base.nothrow_flag) /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node, nonzero means it may not be the lhs of an assignment. Nonzero in a FUNCTION_DECL means this function should be treated as "const" function (can only read its arguments). */ #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag) /* Value of expression is constant. Always on in all ..._CST nodes. May also appear in an expression or decl where the value is constant. */ #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag) /* Nonzero if NODE, a type, has had its sizes gimplified. */ #define TYPE_SIZES_GIMPLIFIED(NODE) \ (TYPE_CHECK (NODE)->base.constant_flag) /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */ #define DECL_UNSIGNED(NODE) \ (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag) /* In integral and pointer types, means an unsigned type. */ #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag) /* Same as TYPE_UNSIGNED but converted to SIGNOP. */ #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE)) /* True if overflow wraps around for the given integral type. That is, TYPE_MAX + 1 == TYPE_MIN. */ #define TYPE_OVERFLOW_WRAPS(TYPE) \ (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag || flag_wrapv) /* True if overflow is undefined for the given integral type. We may optimize on the assumption that values in the type never overflow. IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED must issue a warning based on warn_strict_overflow. In some cases it will be appropriate to issue the warning immediately, and in other cases it will be appropriate to simply set a flag and let the caller decide whether a warning is appropriate or not. */ #define TYPE_OVERFLOW_UNDEFINED(TYPE) \ (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \ && !flag_wrapv && !flag_trapv && flag_strict_overflow) /* True if overflow for the given integral type should issue a trap. */ #define TYPE_OVERFLOW_TRAPS(TYPE) \ (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv) /* True if an overflow is to be preserved for sanitization. */ #define TYPE_OVERFLOW_SANITIZED(TYPE) \ (INTEGRAL_TYPE_P (TYPE) \ && !TYPE_OVERFLOW_WRAPS (TYPE) \ && (flag_sanitize & SANITIZE_SI_OVERFLOW)) /* True if pointer types have undefined overflow. */ #define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow) /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written. Nonzero in a FUNCTION_DECL means that the function has been compiled. This is interesting in an inline function, since it might not need to be compiled separately. Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE or TYPE_DECL if the debugging info for the type has been written. In a BLOCK node, nonzero if reorder_blocks has already seen this block. In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal PHI node. */ #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag) /* Nonzero in a _DECL if the name is used in its scope. Nonzero in an expr node means inhibit warning if value is unused. In IDENTIFIER_NODEs, this means that some extern decl for this name was used. In a BLOCK, this means that the block contains variables that are used. */ #define TREE_USED(NODE) ((NODE)->base.used_flag) /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw an exception. In a CALL_EXPR, nonzero means the call cannot throw. We can't easily check the node type here as the C++ frontend also uses this flag (for AGGR_INIT_EXPR). */ #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag) /* In a CALL_EXPR, means that it's safe to use the target of the call expansion as the return slot for a call that returns in memory. */ #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \ (CALL_EXPR_CHECK (NODE)->base.private_flag) /* Cilk keywords accessors. */ #define CILK_SPAWN_FN(NODE) TREE_OPERAND (CILK_SPAWN_STMT_CHECK (NODE), 0) /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is passed by invisible reference (and the TREE_TYPE is a pointer to the true type). */ #define DECL_BY_REFERENCE(NODE) \ (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \ RESULT_DECL)->decl_common.decl_by_reference_flag) /* In VAR_DECL and PARM_DECL, set when the decl has been used except for being set. */ #define DECL_READ_P(NODE) \ (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag) /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes attempting to share the stack slot with some other variable. */ #define DECL_NONSHAREABLE(NODE) \ (TREE_CHECK2 (NODE, VAR_DECL, \ RESULT_DECL)->decl_common.decl_nonshareable_flag) /* In a CALL_EXPR, means that the call is the jump from a thunk to the thunked-to function. */ #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag) /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that it has been built for the declaration of a variable-sized object. */ #define CALL_ALLOCA_FOR_VAR_P(NODE) \ (CALL_EXPR_CHECK (NODE)->base.protected_flag) /* In a CALL_EXPR, means call was instrumented by Pointer Bounds Checker. */ #define CALL_WITH_BOUNDS_P(NODE) (CALL_EXPR_CHECK (NODE)->base.deprecated_flag) /* In a type, nonzero means that all objects of the type are guaranteed by the language or front-end to be properly aligned, so we can indicate that a MEM of this type is aligned at least to the alignment of the type, even if it doesn't appear that it is. We see this, for example, in object-oriented languages where a tag field may show this is an object of a more-aligned variant of the more generic type. In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME freelist. */ #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag) /* Used in classes in C++. */ #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag) /* Used in classes in C++. */ #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag) /* True if reference type NODE is a C++ rvalue reference. */ #define TYPE_REF_IS_RVALUE(NODE) \ (REFERENCE_TYPE_CHECK (NODE)->base.private_flag) /* Nonzero in a _DECL if the use of the name is defined as a deprecated feature by __attribute__((deprecated)). */ #define TREE_DEPRECATED(NODE) \ ((NODE)->base.deprecated_flag) /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose uses are to be substituted for uses of the TREE_CHAINed identifier. */ #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \ (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag) /* In fixed-point types, means a saturating type. */ #define TYPE_SATURATING(NODE) (TYPE_CHECK (NODE)->base.u.bits.saturating_flag) /* These flags are available for each language front end to use internally. */ #define TREE_LANG_FLAG_0(NODE) \ (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0) #define TREE_LANG_FLAG_1(NODE) \ (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1) #define TREE_LANG_FLAG_2(NODE) \ (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2) #define TREE_LANG_FLAG_3(NODE) \ (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3) #define TREE_LANG_FLAG_4(NODE) \ (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4) #define TREE_LANG_FLAG_5(NODE) \ (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5) #define TREE_LANG_FLAG_6(NODE) \ (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6) /* Define additional fields and accessors for nodes representing constants. */ #define TREE_INT_CST_NUNITS(NODE) \ (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended) #define TREE_INT_CST_EXT_NUNITS(NODE) \ (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended) #define TREE_INT_CST_OFFSET_NUNITS(NODE) \ (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset) #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I) #define TREE_INT_CST_LOW(NODE) \ ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0)) #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr) #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE)) #define TREE_FIXED_CST_PTR(NODE) \ (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr) #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE)) /* In a STRING_CST */ /* In C terms, this is sizeof, not strlen. */ #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length) #define TREE_STRING_POINTER(NODE) \ ((const char *)(STRING_CST_CHECK (NODE)->string.str)) /* In a COMPLEX_CST node. */ #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real) #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag) /* In a VECTOR_CST node. */ #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE))) #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts) #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX]) /* Define fields and accessors for some special-purpose tree nodes. */ #define IDENTIFIER_LENGTH(NODE) \ (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len) #define IDENTIFIER_POINTER(NODE) \ ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str) #define IDENTIFIER_HASH_VALUE(NODE) \ (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value) /* Translate a hash table identifier pointer to a tree_identifier pointer, and vice versa. */ #define HT_IDENT_TO_GCC_IDENT(NODE) \ ((tree) ((char *) (NODE) - sizeof (struct tree_common))) #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id) /* In a TREE_LIST node. */ #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose) #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value) /* In a TREE_VEC node. */ #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length) #define TREE_VEC_END(NODE) \ ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length])) #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I) /* In a CONSTRUCTOR node. */ #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts) #define CONSTRUCTOR_ELT(NODE,IDX) \ (&(*CONSTRUCTOR_ELTS (NODE))[IDX]) #define CONSTRUCTOR_NELTS(NODE) \ (vec_safe_length (CONSTRUCTOR_ELTS (NODE))) #define CONSTRUCTOR_NO_CLEARING(NODE) \ (CONSTRUCTOR_CHECK (NODE)->base.public_flag) /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the value of each element (stored within VAL). IX must be a scratch variable of unsigned integer type. */ #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \ for (IX = 0; (IX >= vec_safe_length (V)) \ ? false \ : ((VAL = (*(V))[IX].value), \ true); \ (IX)++) /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both the value of each element (stored within VAL) and its index (stored within INDEX). IX must be a scratch variable of unsigned integer type. */ #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \ for (IX = 0; (IX >= vec_safe_length (V)) \ ? false \ : (((void) (VAL = (*V)[IX].value)), \ (INDEX = (*V)[IX].index), \ true); \ (IX)++) /* Append a new constructor element to V, with the specified INDEX and VAL. */ #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \ do { \ constructor_elt _ce___ = {INDEX, VALUE}; \ vec_safe_push ((V), _ce___); \ } while (0) /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for constructor output purposes. */ #define CONSTRUCTOR_BITFIELD_P(NODE) \ (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode) /* True if NODE is a clobber right hand side, an expression of indeterminate value that clobbers the LHS in a copy instruction. We use a volatile empty CONSTRUCTOR for this, as it matches most of the necessary semantic. In particular the volatile flag causes us to not prematurely remove such clobber instructions. */ #define TREE_CLOBBER_P(NODE) \ (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE)) /* Define fields and accessors for some nodes that represent expressions. */ /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */ #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \ && VOID_TYPE_P (TREE_TYPE (NODE)) \ && integer_zerop (TREE_OPERAND (NODE, 0))) /* In ordinary expression nodes. */ #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE) #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I) /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand length. Its value includes the length operand itself; that is, the minimum valid length is 1. Note that we have to bypass the use of TREE_OPERAND to access that field to avoid infinite recursion in expanding the macros. */ #define VL_EXP_OPERAND_LENGTH(NODE) \ ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0])) /* Nonzero if is_gimple_debug() may possibly hold. */ #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments) /* In a LOOP_EXPR node. */ #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0) /* The source location of this expression. Non-tree_exp nodes such as decls and constants can be shared among multiple locations, so return nothing. */ #define EXPR_LOCATION(NODE) \ (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION) #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS) #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \ != UNKNOWN_LOCATION) /* The location to be used in a diagnostic about this expression. Do not use this macro if the location will be assigned to other expressions. */ #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \ ? (NODE)->exp.locus : (LOCUS)) #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus) #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus) /* True if a tree is an expression or statement that can have a location. */ #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE)) extern void protected_set_expr_location (tree, location_t); /* In a TARGET_EXPR node. */ #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0) #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1) #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2) /* DECL_EXPR accessor. This gives access to the DECL associated with the given declaration statement. */ #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0) #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0) /* COMPOUND_LITERAL_EXPR accessors. */ #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \ TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0) #define COMPOUND_LITERAL_EXPR_DECL(NODE) \ DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE)) /* SWITCH_EXPR accessors. These give access to the condition, body and original condition type (before any compiler conversions) of the switch statement, respectively. */ #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0) #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1) #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2) /* CASE_LABEL_EXPR accessors. These give access to the high and low values of a case label, respectively. */ #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0) #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1) #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2) #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3) /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match corresponding MEM_REF operands. */ #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0)) #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1)) #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2)) #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3)) #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4)) #define MR_DEPENDENCE_CLIQUE(NODE) \ (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique) #define MR_DEPENDENCE_BASE(NODE) \ (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base) /* The operands of a BIND_EXPR. */ #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0)) #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1)) #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2)) /* GOTO_EXPR accessor. This gives access to the label associated with a goto statement. */ #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0) /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and ASM_CLOBBERS represent the outputs, inputs, and clobbers for the statement. */ #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0) #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1) #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2) #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3) #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4) /* Nonzero if we want to create an ASM_INPUT instead of an ASM_OPERAND with no operands. */ #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag) #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag) /* COND_EXPR accessors. */ #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0)) #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1)) #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2)) /* Accessors for the chains of recurrences. */ #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0) #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1) #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2) #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE)) /* LABEL_EXPR accessor. This gives access to the label associated with the given label expression. */ #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0) /* CATCH_EXPR accessors. */ #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0) #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1) /* EH_FILTER_EXPR accessors. */ #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0) #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1) /* OBJ_TYPE_REF accessors. */ #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0) #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1) #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2) /* ASSERT_EXPR accessors. */ #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0) #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1) /* CALL_EXPR accessors. */ #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1) #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2) #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3) #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3) #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn) /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE. We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if the argument count is zero when checking is enabled. Instead, do the pointer arithmetic to advance past the 3 fixed operands in a CALL_EXPR. That produces a valid pointer to just past the end of the operand array, even if it's not valid to dereference it. */ #define CALL_EXPR_ARGP(NODE) \ (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3) /* TM directives and accessors. */ #define TRANSACTION_EXPR_BODY(NODE) \ TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0) #define TRANSACTION_EXPR_OUTER(NODE) \ (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag) #define TRANSACTION_EXPR_RELAXED(NODE) \ (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag) /* OpenMP and OpenACC directive and clause accessors. */ #define OMP_BODY(NODE) \ TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_CRITICAL), 0) #define OMP_CLAUSES(NODE) \ TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SINGLE), 1) #define OACC_PARALLEL_BODY(NODE) \ TREE_OPERAND (OACC_PARALLEL_CHECK (NODE), 0) #define OACC_PARALLEL_CLAUSES(NODE) \ TREE_OPERAND (OACC_PARALLEL_CHECK (NODE), 1) #define OACC_KERNELS_BODY(NODE) \ TREE_OPERAND (OACC_KERNELS_CHECK(NODE), 0) #define OACC_KERNELS_CLAUSES(NODE) \ TREE_OPERAND (OACC_KERNELS_CHECK(NODE), 1) #define OACC_DATA_BODY(NODE) \ TREE_OPERAND (OACC_DATA_CHECK (NODE), 0) #define OACC_DATA_CLAUSES(NODE) \ TREE_OPERAND (OACC_DATA_CHECK (NODE), 1) #define OACC_HOST_DATA_BODY(NODE) \ TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0) #define OACC_HOST_DATA_CLAUSES(NODE) \ TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1) #define OACC_CACHE_CLAUSES(NODE) \ TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0) #define OACC_DECLARE_CLAUSES(NODE) \ TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0) #define OACC_ENTER_DATA_CLAUSES(NODE) \ TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0) #define OACC_EXIT_DATA_CLAUSES(NODE) \ TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0) #define OACC_UPDATE_CLAUSES(NODE) \ TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0) #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0) #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1) #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0) #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1) #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK) #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0) #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1) #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP) #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0) #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1) #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2) #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3) #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4) #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5) #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0) #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1) #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0) #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0) #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1) #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0) #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0) #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0) #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0) #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1) #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0) #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1) #define OMP_TARGET_DATA_BODY(NODE) \ TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0) #define OMP_TARGET_DATA_CLAUSES(NODE)\ TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1) #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0) #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1) #define OMP_TARGET_UPDATE_CLAUSES(NODE)\ TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0) #define OMP_CLAUSE_SIZE(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \ OMP_CLAUSE_FROM, \ OMP_CLAUSE__CACHE_), 1) #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE)) #define OMP_CLAUSE_DECL(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \ OMP_CLAUSE_PRIVATE, \ OMP_CLAUSE__LOOPTEMP_), 0) #define OMP_CLAUSE_HAS_LOCATION(NODE) \ (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \ != UNKNOWN_LOCATION) #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus /* True on an OMP_SECTION statement that was the last lexical member. This status is meaningful in the implementation of lastprivate. */ #define OMP_SECTION_LAST(NODE) \ (OMP_SECTION_CHECK (NODE)->base.private_flag) /* True on an OACC_KERNELS statement if is represents combined kernels loop directive. */ #define OACC_KERNELS_COMBINED(NODE) \ (OACC_KERNELS_CHECK (NODE)->base.private_flag) /* Like OACC_KERNELS_COMBINED, but for parallel loop directive. */ #define OACC_PARALLEL_COMBINED(NODE) \ (OACC_PARALLEL_CHECK (NODE)->base.private_flag) /* True on an OMP_PARALLEL statement if it represents an explicit combined parallel work-sharing constructs. */ #define OMP_PARALLEL_COMBINED(NODE) \ (OMP_PARALLEL_CHECK (NODE)->base.private_flag) /* True on an OMP_TEAMS statement if it represents an explicit combined teams distribute constructs. */ #define OMP_TEAMS_COMBINED(NODE) \ (OMP_TEAMS_CHECK (NODE)->base.private_flag) /* True if OMP_ATOMIC* is supposed to be sequentially consistent as opposed to relaxed. */ #define OMP_ATOMIC_SEQ_CST(NODE) \ (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \ OMP_ATOMIC_CAPTURE_NEW)->base.private_flag) /* True on a PRIVATE clause if its decl is kept around for debugging information only and its DECL_VALUE_EXPR is supposed to point to what it has been remapped to. */ #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \ (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag) /* True on a PRIVATE clause if ctor needs access to outer region's variable. */ #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \ TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)) /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same decl is present in the chain. */ #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \ (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag) #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \ OMP_CLAUSE_LASTPRIVATE),\ 1) #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \ (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init #define OMP_CLAUSE_FINAL_EXPR(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0) #define OMP_CLAUSE_IF_EXPR(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0) #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0) #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0) /* OpenACC clause expressions */ #define OMP_CLAUSE_GANG_EXPR(NODE) \ OMP_CLAUSE_OPERAND ( \ OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0) #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \ OMP_CLAUSE_OPERAND ( \ OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1) #define OMP_CLAUSE_ASYNC_EXPR(NODE) \ OMP_CLAUSE_OPERAND ( \ OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0) #define OMP_CLAUSE_WAIT_EXPR(NODE) \ OMP_CLAUSE_OPERAND ( \ OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0) #define OMP_CLAUSE_VECTOR_EXPR(NODE) \ OMP_CLAUSE_OPERAND ( \ OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0) #define OMP_CLAUSE_WORKER_EXPR(NODE) \ OMP_CLAUSE_OPERAND ( \ OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0) #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \ OMP_CLAUSE_OPERAND ( \ OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0) #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \ OMP_CLAUSE_OPERAND ( \ OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0) #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \ OMP_CLAUSE_OPERAND ( \ OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0) #define OMP_CLAUSE_DEPEND_KIND(NODE) \ (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind) #define OMP_CLAUSE_MAP_KIND(NODE) \ ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind) #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \ (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \ = (unsigned char) (MAP_KIND)) /* Nonzero if this map clause is for array (rather than pointer) based array section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */ #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \ (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag) #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \ (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind) #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0) #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1) #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2) #define OMP_CLAUSE_REDUCTION_CODE(NODE) \ (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code) #define OMP_CLAUSE_REDUCTION_INIT(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1) #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2) #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \ (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \ (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3) /* True if a REDUCTION clause may reference the original list item (omp_orig) in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */ #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \ (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag) /* True if a LINEAR clause doesn't need copy in. True for iterator vars which are always initialized inside of the loop construct, false otherwise. */ #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \ (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag) /* True if a LINEAR clause doesn't need copy out. True for iterator vars which are declared inside of the simd construct. */ #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \ TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)) /* True if a LINEAR clause has a stride that is variable. */ #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \ TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)) /* True if a LINEAR clause is for an array or allocatable variable that needs special handling by the frontend. */ #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \ (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag) #define OMP_CLAUSE_LINEAR_STEP(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1) #define OMP_CLAUSE_LINEAR_STMT(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2) #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \ (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1) #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0) #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \ OMP_CLAUSE_THREAD_LIMIT), 0) #define OMP_CLAUSE_DEVICE_ID(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0) #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \ OMP_CLAUSE_DIST_SCHEDULE), 0) #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0) #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0) #define OMP_CLAUSE__SIMDUID__DECL(NODE) \ OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0) #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \ (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind) #define OMP_CLAUSE_DEFAULT_KIND(NODE) \ (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind) /* SSA_NAME accessors. */ /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE if there is no name associated with it. */ #define SSA_NAME_IDENTIFIER(NODE) \ (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \ ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \ ? (NODE)->ssa_name.var \ : DECL_NAME ((NODE)->ssa_name.var)) \ : NULL_TREE) /* Returns the variable being referenced. This can be NULL_TREE for temporaries not associated with any user variable. Once released, this is the only field that can be relied upon. */ #define SSA_NAME_VAR(NODE) \ (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \ || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \ ? NULL_TREE : (NODE)->ssa_name.var) #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \ do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0) /* Returns the statement which defines this SSA name. */ #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt /* Returns the SSA version number of this SSA name. Note that in tree SSA, version numbers are not per variable and may be recycled. */ #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are never output, so we can safely use the ASM_WRITTEN_FLAG for this status bit. */ #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \ SSA_NAME_CHECK (NODE)->base.asm_written_flag /* Nonzero if this SSA_NAME expression is currently on the free list of SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing has no meaning for an SSA_NAME. */ #define SSA_NAME_IN_FREE_LIST(NODE) \ SSA_NAME_CHECK (NODE)->base.nothrow_flag /* Nonzero if this SSA_NAME is the default definition for the underlying symbol. A default SSA name is created for symbol S if the very first reference to S in the function is a read operation. Default definitions are always created by an empty statement and belong to no basic block. */ #define SSA_NAME_IS_DEFAULT_DEF(NODE) \ SSA_NAME_CHECK (NODE)->base.default_def_flag /* Attributes for SSA_NAMEs for pointer-type variables. */ #define SSA_NAME_PTR_INFO(N) \ SSA_NAME_CHECK (N)->ssa_name.info.ptr_info /* True if SSA_NAME_RANGE_INFO describes an anti-range. */ #define SSA_NAME_ANTI_RANGE_P(N) \ SSA_NAME_CHECK (N)->base.static_flag /* The type of range described by SSA_NAME_RANGE_INFO. */ #define SSA_NAME_RANGE_TYPE(N) \ (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE) /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */ #define SSA_NAME_RANGE_INFO(N) \ SSA_NAME_CHECK (N)->ssa_name.info.range_info /* Return the immediate_use information for an SSA_NAME. */ #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses #define OMP_CLAUSE_CODE(NODE) \ (OMP_CLAUSE_CHECK (NODE))->omp_clause.code #define OMP_CLAUSE_SET_CODE(NODE, CODE) \ ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE)) #define OMP_CLAUSE_OPERAND(NODE, I) \ OMP_CLAUSE_ELT_CHECK (NODE, I) /* In a BLOCK node. */ #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars) #define BLOCK_NONLOCALIZED_VARS(NODE) \ (BLOCK_CHECK (NODE)->block.nonlocalized_vars) #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \ vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE)) #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N] #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks) #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext) #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain) #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin) #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag) /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */ #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag) /* An index number for this block. These values are not guaranteed to be unique across functions -- whether or not they are depends on the debugging output format in use. */ #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num) /* If block reordering splits a lexical block into discontiguous address ranges, we'll make a copy of the original block. Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN. In that case, we have one source block that has been replicated (through inlining or unrolling) into many logical blocks, and that these logical blocks have different physical variables in them. In this case, we have one logical block split into several non-contiguous address ranges. Most debug formats can't actually represent this idea directly, so we fake it by creating multiple logical blocks with the same variables in them. However, for those that do support non-contiguous regions, these allow the original logical block to be reconstructed, along with the set of address ranges. One of the logical block fragments is arbitrarily chosen to be the ORIGIN. The other fragments will point to the origin via BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer be null. The list of fragments will be chained through BLOCK_FRAGMENT_CHAIN from the origin. */ #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin) #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain) /* For an inlined function, this gives the location where it was called from. This is only set in the top level block, which corresponds to the inlined function scope. This is used in the debug output routines. */ #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus) /* This gives the location of the end of the block, useful to attach code implicitly generated for outgoing paths. */ #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus) /* Define fields and accessors for nodes representing data types. */ /* See tree.def for documentation of the use of these fields. Look at the documentation of the various ..._TYPE tree codes. Note that the type.values, type.minval, and type.maxval fields are overloaded and used for different macros in different kinds of types. Each macro must check to ensure the tree node is of the proper kind of type. Note also that some of the front-ends also overload these fields, so they must be checked as well. */ #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid) #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size) #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit) #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to) #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to) #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision) #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name) #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant) #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant) #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context) #define TYPE_MODE(NODE) \ (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \ ? vector_type_mode (NODE) : (NODE)->type_common.mode) #define SET_TYPE_MODE(NODE, MODE) \ (TYPE_CHECK (NODE)->type_common.mode = (MODE)) extern machine_mode element_mode (const_tree t); /* The "canonical" type for this type node, which is used by frontends to compare the type for equality with another type. If two types are equal (based on the semantics of the language), then they will have equivalent TYPE_CANONICAL entries. As a special case, if TYPE_CANONICAL is NULL_TREE, and thus TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot be used for comparison against other types. Instead, the type is said to require structural equality checks, described in TYPE_STRUCTURAL_EQUALITY_P. For unqualified aggregate and function types the middle-end relies on TYPE_CANONICAL to tell whether two variables can be assigned to each other without a conversion. The middle-end also makes sure to assign the same alias-sets to the type partition with equal TYPE_CANONICAL of their unqualified variants. */ #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical) /* Indicates that the type node requires structural equality checks. The compiler will need to look at the composition of the type to determine whether it is equal to another type, rather than just comparing canonical type pointers. For instance, we would need to look at the return and parameter types of a FUNCTION_TYPE node. */ #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE) /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the type node requires structural equality. */ #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE) #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE))) #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE))) /* The (language-specific) typed-based alias set for this type. Objects whose TYPE_ALIAS_SETs are different cannot alias each other. If the TYPE_ALIAS_SET is -1, no alias set has yet been assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this type can alias objects of any type. */ #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set) /* Nonzero iff the typed-based alias set for this type has been calculated. */ #define TYPE_ALIAS_SET_KNOWN_P(NODE) \ (TYPE_CHECK (NODE)->type_common.alias_set != -1) /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply to this type. */ #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes) /* The alignment necessary for objects of this type. The value is an int, measured in bits. */ #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align) /* 1 if the alignment for this type was requested by "aligned" attribute, 0 if it is the default for this type. */ #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align) /* The alignment for NODE, in bytes. */ #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT) /* If your language allows you to declare types, and you want debug info for them, then you need to generate corresponding TYPE_DECL nodes. These "stub" TYPE_DECL nodes have no name, and simply point at the type node. You then set the TYPE_STUB_DECL field of the type node to point back at the TYPE_DECL node. This allows the debug routines to know that the two nodes represent the same type, so that we only get one debug info record for them. */ #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE))) /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means the type has BLKmode only because it lacks the alignment required for its size. */ #define TYPE_NO_FORCE_BLK(NODE) \ (TYPE_CHECK (NODE)->type_common.no_force_blk_flag) /* Nonzero in a type considered volatile as a whole. */ #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag) /* Nonzero in a type considered atomic as a whole. */ #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag) /* Means this type is const-qualified. */ #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag) /* If nonzero, this type is `restrict'-qualified, in the C sense of the term. */ #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag) /* If nonzero, type's name shouldn't be emitted into debug info. */ #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag) /* The address space the type is in. */ #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space) /* Encode/decode the named memory support as part of the qualifier. If more than 8 qualifiers are added, these macros need to be adjusted. */ #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8) #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF) /* Return all qualifiers except for the address space qualifiers. */ #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00) /* Only keep the address space out of the qualifiers and discard the other qualifiers. */ #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00) /* The set of type qualifiers for this type. */ #define TYPE_QUALS(NODE) \ ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \ | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \ | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE))))) /* The same as TYPE_QUALS without the address space qualifications. */ #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \ ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \ | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))) /* The same as TYPE_QUALS without the address space and atomic qualifications. */ #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \ ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))) /* These flags are available for each language front end to use internally. */ #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0) #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1) #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2) #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3) #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4) #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5) #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6) /* Used to keep track of visited nodes in tree traversals. This is set to 0 by copy_node and make_node. */ #define TREE_VISITED(NODE) ((NODE)->base.visited) /* If set in an ARRAY_TYPE, indicates a string type (for languages that distinguish string from array of char). If set in a INTEGER_TYPE, indicates a character type. */ #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag) /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */ #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \ (((unsigned HOST_WIDE_INT) 1) \ << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision) /* Set precision to n when we have 2^n sub-parts of the vector. */ #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \ (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X)) /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings about missing conversions to other vector types of the same size. */ #define TYPE_VECTOR_OPAQUE(NODE) \ (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag) /* Indicates that objects of this type must be initialized by calling a function when they are created. */ #define TYPE_NEEDS_CONSTRUCTING(NODE) \ (TYPE_CHECK (NODE)->type_common.needs_constructing_flag) /* Indicates that a UNION_TYPE object should be passed the same way that the first union alternative would be passed, or that a RECORD_TYPE object should be passed the same way that the first (and only) member would be passed. */ #define TYPE_TRANSPARENT_AGGR(NODE) \ (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag) /* For an ARRAY_TYPE, indicates that it is not permitted to take the address of a component of the type. This is the counterpart of DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */ #define TYPE_NONALIASED_COMPONENT(NODE) \ (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag) /* Indicated that objects of this type should be laid out in as compact a way as possible. */ #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag) /* Used by type_contains_placeholder_p to avoid recomputation. Values are: 0 (unknown), 1 (false), 2 (true). Never access this field directly. */ #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \ (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits) /* Nonzero if RECORD_TYPE represents a final derivation of class. */ #define TYPE_FINAL_P(NODE) \ (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag) /* The debug output functions use the symtab union field to store information specific to the debugging format. The different debug output hooks store different types in the union field. These three macros are used to access different fields in the union. The debug hooks are responsible for consistently using only a specific macro. */ /* Symtab field as an integer. Used by stabs generator in dbxout.c to hold the type's number in the generated stabs. */ #define TYPE_SYMTAB_ADDRESS(NODE) \ (TYPE_CHECK (NODE)->type_common.symtab.address) /* Symtab field as a string. Used by COFF generator in sdbout.c to hold struct/union type tag names. */ #define TYPE_SYMTAB_POINTER(NODE) \ (TYPE_CHECK (NODE)->type_common.symtab.pointer) /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator in dwarf2out.c to point to the DIE generated for the type. */ #define TYPE_SYMTAB_DIE(NODE) \ (TYPE_CHECK (NODE)->type_common.symtab.die) /* The garbage collector needs to know the interpretation of the symtab field. These constants represent the different types in the union. */ #define TYPE_SYMTAB_IS_ADDRESS (0) #define TYPE_SYMTAB_IS_POINTER (1) #define TYPE_SYMTAB_IS_DIE (2) #define TYPE_LANG_SPECIFIC(NODE) \ (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific) #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values) #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values) #define TYPE_FIELDS(NODE) \ (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values) #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values) #define TYPE_ARG_TYPES(NODE) \ (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values) #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values) #define TYPE_METHODS(NODE) \ (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval) #define TYPE_VFIELD(NODE) \ (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval) #define TYPE_METHOD_BASETYPE(NODE) \ (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval) #define TYPE_OFFSET_BASETYPE(NODE) \ (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval) #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval) #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval) #define TYPE_NEXT_PTR_TO(NODE) \ (POINTER_TYPE_CHECK (NODE)->type_non_common.minval) #define TYPE_NEXT_REF_TO(NODE) \ (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval) #define TYPE_MIN_VALUE(NODE) \ (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval) #define TYPE_MAX_VALUE(NODE) \ (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval) /* If non-NULL, this is an upper bound of the size (in bytes) of an object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be allocated. */ #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \ (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval) /* For record and union types, information about this type, as a base type for itself. */ #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo) /* For non record and union types, used in a language-dependent way. */ #define TYPE_LANG_SLOT_1(NODE) \ (NOT_RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo) /* Define accessor macros for information about type inheritance and basetypes. A "basetype" means a particular usage of a data type for inheritance in another type. Each such basetype usage has its own "binfo" object to describe it. The binfo object is a TREE_VEC node. Inheritance is represented by the binfo nodes allocated for a given type. For example, given types C and D, such that D is inherited by C, 3 binfo nodes will be allocated: one for describing the binfo properties of C, similarly one for D, and one for describing the binfo properties of D as a base type for C. Thus, given a pointer to class C, one can get a pointer to the binfo of D acting as a basetype for C by looking at C's binfo's basetypes. */ /* BINFO specific flags. */ /* Nonzero means that the derivation chain is via a `virtual' declaration. */ #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag) /* Flags for language dependent use. */ #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE)) #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE)) #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE)) #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE)) #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE)) #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE)) #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE)) /* The actual data type node being inherited in this basetype. */ #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE)) /* The offset where this basetype appears in its containing type. BINFO_OFFSET slot holds the offset (in bytes) from the base of the complete object to the base of the part of the object that is allocated on behalf of this `type'. This is always 0 except when there is multiple inheritance. */ #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset) #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE))) /* The virtual function table belonging to this basetype. Virtual function tables provide a mechanism for run-time method dispatching. The entries of a virtual function table are language-dependent. */ #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable) /* The virtual functions in the virtual function table. This is a TREE_LIST that is used as an initial approximation for building a virtual function table for this basetype. */ #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals) /* A vector of binfos for the direct basetypes inherited by this basetype. If this basetype describes type D as inherited in C, and if the basetypes of D are E and F, then this vector contains binfos for inheritance of E and F by C. */ #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos) /* The number of basetypes for NODE. */ #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ()) /* Accessor macro to get to the Nth base binfo of this binfo. */ #define BINFO_BASE_BINFO(NODE,N) \ ((*BINFO_BASE_BINFOS (NODE))[(N)]) #define BINFO_BASE_ITERATE(NODE,N,B) \ (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B))) #define BINFO_BASE_APPEND(NODE,T) \ (BINFO_BASE_BINFOS (NODE)->quick_push ((T))) /* For a BINFO record describing a virtual base class, i.e., one where TREE_VIA_VIRTUAL is set, this field assists in locating the virtual base. The actual contents are language-dependent. In the C++ front-end this field is an INTEGER_CST giving an offset into the vtable where the offset to the virtual base can be found. */ #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field) /* Indicates the accesses this binfo has to its bases. The values are access_public_node, access_protected_node or access_private_node. If this array is not present, public access is implied. */ #define BINFO_BASE_ACCESSES(NODE) \ (TREE_BINFO_CHECK (NODE)->binfo.base_accesses) #define BINFO_BASE_ACCESS(NODE,N) \ (*BINFO_BASE_ACCESSES (NODE))[(N)] #define BINFO_BASE_ACCESS_APPEND(NODE,T) \ BINFO_BASE_ACCESSES (NODE)->quick_push ((T)) /* The index in the VTT where this subobject's sub-VTT can be found. NULL_TREE if there is no sub-VTT. */ #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt) /* The index in the VTT where the vptr for this subobject can be found. NULL_TREE if there is no secondary vptr in the VTT. */ #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr) /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base inheriting this base for non-virtual bases. For virtual bases it points either to the binfo for which this is a primary binfo, or to the binfo of the most derived type. */ #define BINFO_INHERITANCE_CHAIN(NODE) \ (TREE_BINFO_CHECK (NODE)->binfo.inheritance) /* Define fields and accessors for nodes representing declared names. */ /* Nonzero if DECL represents an SSA name or a variable that can possibly have an associated SSA name. */ #define SSA_VAR_P(DECL) \ (TREE_CODE (DECL) == VAR_DECL \ || TREE_CODE (DECL) == PARM_DECL \ || TREE_CODE (DECL) == RESULT_DECL \ || TREE_CODE (DECL) == SSA_NAME) #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE))) /* This is the name of the object as written by the user. It is an IDENTIFIER_NODE. */ #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name) /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */ #define TYPE_IDENTIFIER(NODE) \ (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \ ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE)) /* Every ..._DECL node gets a unique number. */ #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid) /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous uses. */ #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL))) /* Every ..._DECL node gets a unique number that stays the same even when the decl is copied by the inliner once it is set. */ #define DECL_PT_UID(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \ ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid) /* Initialize the ..._DECL node pt-uid to the decls uid. */ #define SET_DECL_PT_UID(NODE, UID) \ (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID)) /* Whether the ..._DECL node pt-uid has been initialized and thus needs to be preserved when copyin the decl. */ #define DECL_PT_UID_SET_P(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u) /* These two fields describe where in the source code the declaration was. If the declaration appears in several places (as for a C function that is declared first and then defined later), this information should refer to the definition. */ #define DECL_SOURCE_LOCATION(NODE) \ (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus) #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE)) #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE)) #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE)) /* This accessor returns TRUE if the decl it operates on was created by a front-end or back-end rather than by user code. In this case builtin-ness is indicated by source location. */ #define DECL_IS_BUILTIN(DECL) \ (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION) /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL nodes, this points to either the FUNCTION_DECL for the containing function, the RECORD_TYPE or UNION_TYPE for the containing type, or NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file scope". In particular, for VAR_DECLs which are virtual table pointers (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type they belong to. */ #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context) #define DECL_FIELD_CONTEXT(NODE) \ (FIELD_DECL_CHECK (NODE)->decl_minimal.context) /* If nonzero, decl's name shouldn't be emitted into debug info. */ #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag) /* For any sort of a ..._DECL node, this points to the original (abstract) decl node which this decl is an inlined/cloned instance of, or else it is NULL indicating that this decl is not an instance of some other decl. The C front-end also uses this in a nested declaration of an inline function, to point back to the definition. */ #define DECL_ABSTRACT_ORIGIN(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin) /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */ #define DECL_ORIGIN(NODE) \ (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE)) /* Nonzero for any sort of ..._DECL node means this decl node represents an inline instance of some original (abstract) decl from an inline function; suppress any warnings about shadowing some other variable. FUNCTION_DECL nodes can also have their abstract origin set to themselves. */ #define DECL_FROM_INLINE(NODE) \ (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \ && DECL_ABSTRACT_ORIGIN (NODE) != (NODE)) /* In a DECL this is the field where attributes are stored. */ #define DECL_ATTRIBUTES(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.attributes) /* For a FUNCTION_DECL, holds the tree of BINDINGs. For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK. For a VAR_DECL, holds the initial value. For a PARM_DECL, used for DECL_ARG_TYPE--default values for parameters are encoded in the type of the function, not in the PARM_DECL slot. For a FIELD_DECL, this is used for enumeration values and the C frontend uses it for temporarily storing bitwidth of bitfields. ??? Need to figure out some way to check this isn't a PARM_DECL. */ #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial) /* Holds the size of the datum, in bits, as a tree expression. Need not be constant. */ #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size) /* Likewise for the size in bytes. */ #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit) /* Holds the alignment required for the datum, in bits. */ #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align) /* The alignment of NODE, in bytes. */ #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT) /* Set if the alignment of this DECL has been set by the user, for example with an 'aligned' attribute. */ #define DECL_USER_ALIGN(NODE) \ (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align) /* Holds the machine mode corresponding to the declaration of a variable or field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a FIELD_DECL. */ #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode) /* For FUNCTION_DECL, if it is built-in, this identifies which built-in operation it is. Note, however, that this field is overloaded, with DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be checked before any access to the former. */ #define DECL_FUNCTION_CODE(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code) #define DECL_FUNCTION_PERSONALITY(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.personality) /* Nonzero for a given ..._DECL node means that the name of this node should be ignored for symbolic debug purposes. For a TYPE_DECL, this means that the associated type should be ignored. For a FUNCTION_DECL, the body of the function should also be ignored. */ #define DECL_IGNORED_P(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag) /* Nonzero for a given ..._DECL node means that this node represents an "abstract instance" of the given declaration (e.g. in the original declaration of an inline function). When generating symbolic debugging information, we mustn't try to generate any address information for nodes marked as "abstract instances" because we don't actually generate any code or allocate any data space for such instances. */ #define DECL_ABSTRACT_P(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag) /* Language-specific decl information. */ #define DECL_LANG_SPECIFIC(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific) /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference: do not allocate storage, and refer to a definition elsewhere. Note that this does not necessarily imply the entity represented by NODE has no program source-level definition in this translation unit. For example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and DECL_EXTERNAL may be true simultaneously; that can be the case for a C99 "extern inline" function. */ #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1) /* Nonzero in a ..._DECL means this variable is ref'd from a nested function. For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes. For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted. Also set in some languages for variables, etc., outside the normal lexical scope, such as class instance variables. */ #define DECL_NONLOCAL(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag) /* Used in VAR_DECLs to indicate that the variable is a vtable. Used in FIELD_DECLs for vtable pointers. Used in FUNCTION_DECLs to indicate that the function is virtual. */ #define DECL_VIRTUAL_P(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag) /* Used to indicate that this DECL represents a compiler-generated entity. */ #define DECL_ARTIFICIAL(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag) /* Additional flags for language-specific uses. */ #define DECL_LANG_FLAG_0(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0) #define DECL_LANG_FLAG_1(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1) #define DECL_LANG_FLAG_2(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2) #define DECL_LANG_FLAG_3(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3) #define DECL_LANG_FLAG_4(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4) #define DECL_LANG_FLAG_5(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5) #define DECL_LANG_FLAG_6(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6) #define DECL_LANG_FLAG_7(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7) #define DECL_LANG_FLAG_8(NODE) \ (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8) /* Nonzero for a scope which is equal to file scope. */ #define SCOPE_FILE_SCOPE_P(EXP) \ (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL) /* Nonzero for a decl which is at file scope. */ #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP)) /* Nonzero for a type which is at file scope. */ #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP)) /* Nonzero for a decl that is decorated using attribute used. This indicates to compiler tools that this decl needs to be preserved. */ #define DECL_PRESERVE_P(DECL) \ DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag /* For function local variables of COMPLEX and VECTOR types, indicates that the variable is not aliased, and that all modifications to the variable have been adjusted so that they are killing assignments. Thus the variable may now be treated as a GIMPLE register, and use real instead of virtual ops in SSA form. */ #define DECL_GIMPLE_REG_P(DECL) \ DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag extern tree decl_value_expr_lookup (tree); extern void decl_value_expr_insert (tree, tree); /* In a VAR_DECL or PARM_DECL, the location at which the value may be found, if transformations have made this more complicated than evaluating the decl itself. This should only be used for debugging; once this field has been set, the decl itself may not legitimately appear in the function. */ #define DECL_HAS_VALUE_EXPR_P(NODE) \ (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \ ->decl_common.decl_flag_2) #define DECL_VALUE_EXPR(NODE) \ (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE))) #define SET_DECL_VALUE_EXPR(NODE, VAL) \ (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL)) /* Holds the RTL expression for the value of a variable or function. This value can be evaluated lazily for functions, variables with static storage duration, and labels. */ #define DECL_RTL(NODE) \ (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \ ? (NODE)->decl_with_rtl.rtl \ : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl)) /* Set the DECL_RTL for NODE to RTL. */ #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL) /* Returns nonzero if NODE is a tree node that can contain RTL. */ #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL)) /* Returns nonzero if the DECL_RTL for NODE has already been set. */ #define DECL_RTL_SET_P(NODE) \ (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL) /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for NODE1, it will not be set for NODE2; this is a lazy copy. */ #define COPY_DECL_RTL(NODE1, NODE2) \ (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \ = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl) /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */ #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL) #if (GCC_VERSION >= 2007) #define DECL_RTL_KNOWN_SET(decl) __extension__ \ ({ tree const __d = (decl); \ gcc_checking_assert (DECL_RTL_SET_P (__d)); \ /* Dereference it so the compiler knows it can't be NULL even \ without assertion checking. */ \ &*DECL_RTL_IF_SET (__d); }) #else #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl)) #endif /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */ #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0) /* In a FIELD_DECL, this is the field position, counting in bytes, of the DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning of the structure. */ #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset) /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the field from DECL_FIELD_OFFSET. This field may be nonzero even for fields that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the natural alignment of the field's type). */ #define DECL_FIELD_BIT_OFFSET(NODE) \ (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset) /* In a FIELD_DECL, this indicates whether the field was a bit-field and if so, the type that was originally specified for it. TREE_TYPE may have been modified (in finish_struct). */ #define DECL_BIT_FIELD_TYPE(NODE) \ (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type) /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage representative FIELD_DECL. */ #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \ (FIELD_DECL_CHECK (NODE)->field_decl.qualifier) /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which if nonzero, indicates that the field occupies the type. */ #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier) /* For FIELD_DECLs, off_align holds the number of low-order bits of DECL_FIELD_OFFSET which are known to be always zero. DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET has. */ #define DECL_OFFSET_ALIGN(NODE) \ (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align) /* Specify that DECL_ALIGN(NODE) is a multiple of X. */ #define SET_DECL_OFFSET_ALIGN(NODE, X) \ (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1) /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in which this FIELD_DECL is defined. This information is needed when writing debugging information about vfield and vbase decls for C++. */ #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext) /* In a FIELD_DECL, indicates this field should be bit-packed. */ #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag) /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed specially. */ #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1) /* Used in a FIELD_DECL to indicate that we cannot form the address of this component. This makes it possible for Type-Based Alias Analysis to disambiguate accesses to this field with indirect accesses using the field's type: struct S { int i; } s; int *p; If the flag is set on 'i', TBAA computes that s.i and *p never conflict. From the implementation's viewpoint, the alias set of the type of the field 'i' (int) will not be recorded as a subset of that of the type of 's' (struct S) in record_component_aliases. The counterpart is that accesses to s.i must not be given the alias set of the type of 'i' (int) but instead directly that of the type of 's' (struct S). */ #define DECL_NONADDRESSABLE_P(NODE) \ (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2) /* A numeric unique identifier for a LABEL_DECL. The UID allocation is dense, unique within any one function, and may be used to index arrays. If the value is -1, then no UID has been assigned. */ #define LABEL_DECL_UID(NODE) \ (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid) /* In a LABEL_DECL, the EH region number for which the label is the post_landing_pad. */ #define EH_LANDING_PAD_NR(NODE) \ (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr) /* For a PARM_DECL, records the data type used to pass the argument, which may be different from the type seen in the program. */ #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial) /* For PARM_DECL, holds an RTL for the stack slot or register where the data was actually passed. */ #define DECL_INCOMING_RTL(NODE) \ (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl) /* Nonzero for a given ..._DECL node means that no warnings should be generated just because this node is unused. */ #define DECL_IN_SYSTEM_HEADER(NODE) \ (in_system_header_at (DECL_SOURCE_LOCATION (NODE))) /* Used to indicate that the linkage status of this DECL is not yet known, so it should not be output now. */ #define DECL_DEFER_OUTPUT(NODE) \ (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output) /* In a VAR_DECL that's static, nonzero if the space is in the text section. */ #define DECL_IN_TEXT_SECTION(NODE) \ (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section) /* In a VAR_DECL that's static, nonzero if it belongs to the global constant pool. */ #define DECL_IN_CONSTANT_POOL(NODE) \ (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool) /* Nonzero for a given ..._DECL node means that this node should be put in .common, if possible. If a DECL_INITIAL is given, and it is not error_mark_node, then the decl cannot be put in .common. */ #define DECL_COMMON(NODE) \ (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag) /* In a VAR_DECL, nonzero if the decl is a register variable with an explicit asm specification. */ #define DECL_HARD_REGISTER(NODE) \ (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register) /* Used to indicate that this DECL has weak linkage. */ #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag) /* Used to indicate that the DECL is a dllimport. */ #define DECL_DLLIMPORT_P(NODE) \ (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag) /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need not be put out unless it is needed in this translation unit. Entities like this are shared across translation units (like weak entities), but are guaranteed to be generated by any translation unit that needs them, and therefore need not be put out anywhere where they are not needed. DECL_COMDAT is just a hint to the back-end; it is up to front-ends which set this flag to ensure that there will never be any harm, other than bloat, in putting out something which is DECL_COMDAT. */ #define DECL_COMDAT(NODE) \ (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag) #define DECL_COMDAT_GROUP(NODE) \ decl_comdat_group (NODE) /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in multiple translation units should be merged. */ #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \ && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE))) /* The name of the object as the assembler will see it (but before any translations made by ASM_OUTPUT_LABELREF). Often this is the same as DECL_NAME. It is an IDENTIFIER_NODE. ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for One Definition Rule based type merging at LTO. It is computed only for LTO compilation and C++. */ #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE) /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME. This is true of all DECL nodes except FIELD_DECL. */ #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \ (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS)) /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero, the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set yet. */ #define DECL_ASSEMBLER_NAME_SET_P(NODE) \ (HAS_DECL_ASSEMBLER_NAME_P (NODE) \ && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE) /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */ #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \ (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME)) /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the semantics of using this macro, are different than saying: SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1)) which will try to set the DECL_ASSEMBLER_NAME for DECL1. */ #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \ (DECL_ASSEMBLER_NAME_SET_P (DECL1) \ ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \ DECL_ASSEMBLER_NAME (DECL1)) \ : (void) 0) /* Records the section name in a section attribute. Used to pass the name from decl_attributes to make_function_rtl and make_decl_rtl. */ #define DECL_SECTION_NAME(NODE) decl_section_name (NODE) /* Nonzero in a decl means that the gimplifier has seen (or placed) this variable in a BIND_EXPR. */ #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \ (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr) /* Value of the decls's visibility attribute */ #define DECL_VISIBILITY(NODE) \ (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility) /* Nonzero means that the decl had its visibility specified rather than being inferred. */ #define DECL_VISIBILITY_SPECIFIED(NODE) \ (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified) /* In a VAR_DECL, the model to use if the data should be allocated from thread-local storage. */ #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE) /* In a VAR_DECL, nonzero if the data should be allocated from thread-local storage. */ #define DECL_THREAD_LOCAL_P(NODE) \ ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL) /* In a non-local VAR_DECL with static storage duration, true if the variable has an initialization priority. If false, the variable will be initialized at the DEFAULT_INIT_PRIORITY. */ #define DECL_HAS_INIT_PRIORITY_P(NODE) \ (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p) extern tree decl_debug_expr_lookup (tree); extern void decl_debug_expr_insert (tree, tree); /* For VAR_DECL, this is set to an expression that it was split from. */ #define DECL_HAS_DEBUG_EXPR_P(NODE) \ (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from) #define DECL_DEBUG_EXPR(NODE) \ (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE))) #define SET_DECL_DEBUG_EXPR(NODE, VAL) \ (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL)) extern priority_type decl_init_priority_lookup (tree); extern priority_type decl_fini_priority_lookup (tree); extern void decl_init_priority_insert (tree, priority_type); extern void decl_fini_priority_insert (tree, priority_type); /* For a VAR_DECL or FUNCTION_DECL the initialization priority of NODE. */ #define DECL_INIT_PRIORITY(NODE) \ (decl_init_priority_lookup (NODE)) /* Set the initialization priority for NODE to VAL. */ #define SET_DECL_INIT_PRIORITY(NODE, VAL) \ (decl_init_priority_insert (NODE, VAL)) /* For a FUNCTION_DECL the finalization priority of NODE. */ #define DECL_FINI_PRIORITY(NODE) \ (decl_fini_priority_lookup (NODE)) /* Set the finalization priority for NODE to VAL. */ #define SET_DECL_FINI_PRIORITY(NODE, VAL) \ (decl_fini_priority_insert (NODE, VAL)) /* The initialization priority for entities for which no explicit initialization priority has been specified. */ #define DEFAULT_INIT_PRIORITY 65535 /* The maximum allowed initialization priority. */ #define MAX_INIT_PRIORITY 65535 /* The largest priority value reserved for use by system runtime libraries. */ #define MAX_RESERVED_INIT_PRIORITY 100 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */ #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \ (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag) /* In a VAR_DECL, nonzero if this is a non-local frame structure. */ #define DECL_NONLOCAL_FRAME(NODE) \ (VAR_DECL_CHECK (NODE)->base.default_def_flag) /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */ #define DECL_NONALIASED(NODE) \ (VAR_DECL_CHECK (NODE)->base.nothrow_flag) /* This field is used to reference anything in decl.result and is meant only for use by the garbage collector. */ #define DECL_RESULT_FLD(NODE) \ (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result) /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways. Before the struct containing the FUNCTION_DECL is laid out, DECL_VINDEX may point to a FUNCTION_DECL in a base class which is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual function. When the class is laid out, this pointer is changed to an INTEGER_CST node which is suitable for use as an index into the virtual function table. */ #define DECL_VINDEX(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex) /* In FUNCTION_DECL, holds the decl for the return value. */ #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result) /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */ #define DECL_UNINLINABLE(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable) /* In a FUNCTION_DECL, the saved representation of the body of the entire function. */ #define DECL_SAVED_TREE(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree) /* Nonzero in a FUNCTION_DECL means this function should be treated as if it were a malloc, meaning it returns a pointer that is not an alias. */ #define DECL_IS_MALLOC(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag) /* Nonzero in a FUNCTION_DECL means this function should be treated as C++ operator new, meaning that it returns a pointer for which we should not use type based aliasing. */ #define DECL_IS_OPERATOR_NEW(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag) /* Nonzero in a FUNCTION_DECL means this function may return more than once. */ #define DECL_IS_RETURNS_TWICE(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag) /* Nonzero in a FUNCTION_DECL means this function should be treated as "pure" function (like const function, but may read global memory). */ #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag) /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND the const or pure function may not terminate. When this is nonzero for a const or pure function, it can be dealt with by cse passes but cannot be removed by dce passes since you are not allowed to change an infinite looping program into one that terminates without error. */ #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag) /* Nonzero in a FUNCTION_DECL means this function should be treated as "novops" function (function that does not read global memory, but may have arbitrary side effects). */ #define DECL_IS_NOVOPS(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag) /* Used in FUNCTION_DECLs to indicate that they should be run automatically at the beginning or end of execution. */ #define DECL_STATIC_CONSTRUCTOR(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag) #define DECL_STATIC_DESTRUCTOR(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag) /* Used in FUNCTION_DECLs to indicate that function entry and exit should be instrumented with calls to support routines. */ #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit) /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be disabled in this function. */ #define DECL_NO_LIMIT_STACK(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack) /* In a FUNCTION_DECL indicates that a static chain is needed. */ #define DECL_STATIC_CHAIN(NODE) \ (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag) /* Nonzero for a decl that cgraph has decided should be inlined into at least one call site. It is not meaningful to look at this directly; always use cgraph_function_possibly_inlined_p. */ #define DECL_POSSIBLY_INLINED(DECL) \ FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined /* Nonzero in a FUNCTION_DECL means that this function was declared inline, such as via the `inline' keyword in C/C++. This flag controls the linkage semantics of 'inline' */ #define DECL_DECLARED_INLINE_P(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag) /* Nonzero in a FUNCTION_DECL means this function should not get -Winline warnings. */ #define DECL_NO_INLINE_WARNING_P(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag) /* Nonzero if a FUNCTION_CODE is a TM load/store. */ #define BUILTIN_TM_LOAD_STORE_P(FN) \ ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE) /* Nonzero if a FUNCTION_CODE is a TM load. */ #define BUILTIN_TM_LOAD_P(FN) \ ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE) /* Nonzero if a FUNCTION_CODE is a TM store. */ #define BUILTIN_TM_STORE_P(FN) \ ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE) #define CASE_BUILT_IN_TM_LOAD(FN) \ case BUILT_IN_TM_LOAD_##FN: \ case BUILT_IN_TM_LOAD_RAR_##FN: \ case BUILT_IN_TM_LOAD_RAW_##FN: \ case BUILT_IN_TM_LOAD_RFW_##FN #define CASE_BUILT_IN_TM_STORE(FN) \ case BUILT_IN_TM_STORE_##FN: \ case BUILT_IN_TM_STORE_WAR_##FN: \ case BUILT_IN_TM_STORE_WAW_##FN /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner disregarding size and cost heuristics. This is equivalent to using the always_inline attribute without the required diagnostics if the function cannot be inlined. */ #define DECL_DISREGARD_INLINE_LIMITS(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits) extern vec<tree, va_gc> **decl_debug_args_lookup (tree); extern vec<tree, va_gc> **decl_debug_args_insert (tree); /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */ #define DECL_HAS_DEBUG_ARGS_P(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag) /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function") that describes the status of this function. */ #define DECL_STRUCT_FUNCTION(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.f) /* In a FUNCTION_DECL, nonzero means a built in function of a standard library or more generally a built in function that is recognized by optimizers and expanders. Note that it is different from the DECL_IS_BUILTIN accessor. For instance, user declared prototypes of C library functions are not DECL_IS_BUILTIN but may be DECL_BUILT_IN. */ #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN) /* For a builtin function, identify which part of the compiler defined it. */ #define DECL_BUILT_IN_CLASS(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class) /* In FUNCTION_DECL, a chain of ..._DECL nodes. */ #define DECL_ARGUMENTS(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments) /* In FUNCTION_DECL, the function specific target options to use when compiling this function. */ #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target) /* In FUNCTION_DECL, the function specific optimization options to use when compiling this function. */ #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \ (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization) /* In FUNCTION_DECL, this is set if this function has other versions generated using "target" attributes. The default version is the one which does not have any "target" attribute set. */ #define DECL_FUNCTION_VERSIONED(NODE)\ (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function) /* In FUNCTION_DECL, this is set if this function is a C++ constructor. Devirtualization machinery uses this knowledge for determing type of the object constructed. Also we assume that constructor address is not important. */ #define DECL_CXX_CONSTRUCTOR_P(NODE)\ (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor) /* In FUNCTION_DECL, this is set if this function is a C++ destructor. Devirtualization machinery uses this to track types in destruction. */ #define DECL_CXX_DESTRUCTOR_P(NODE)\ (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor) /* In FUNCTION_DECL that represent an virtual method this is set when the method is final. */ #define DECL_FINAL_P(NODE)\ (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final) /* The source language of the translation-unit. */ #define TRANSLATION_UNIT_LANGUAGE(NODE) \ (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language) /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */ /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */ #define DECL_ORIGINAL_TYPE(NODE) \ (TYPE_DECL_CHECK (NODE)->decl_non_common.result) /* In a TYPE_DECL nonzero means the detail info about this type is not dumped into stabs. Instead it will generate cross reference ('x') of names. This uses the same flag as DECL_EXTERNAL. */ #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \ (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1) /* Getter of the imported declaration associated to the IMPORTED_DECL node. */ #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \ (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE))) /* Getter of the symbol declaration associated with the NAMELIST_DECL node. */ #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \ (DECL_INITIAL (NODE)) /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE. To reduce overhead, the nodes containing the statements are not trees. This avoids the overhead of tree_common on all linked list elements. Use the interface in tree-iterator.h to access this node. */ #define STATEMENT_LIST_HEAD(NODE) \ (STATEMENT_LIST_CHECK (NODE)->stmt_list.head) #define STATEMENT_LIST_TAIL(NODE) \ (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail) #define TREE_OPTIMIZATION(NODE) \ (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts) #define TREE_OPTIMIZATION_OPTABS(NODE) \ (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs) #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \ (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs) /* Return a tree node that encapsulates the optimization options in OPTS. */ extern tree build_optimization_node (struct gcc_options *opts); #define TREE_TARGET_OPTION(NODE) \ (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts) #define TREE_TARGET_GLOBALS(NODE) \ (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals) /* Return a tree node that encapsulates the target options in OPTS. */ extern tree build_target_option_node (struct gcc_options *opts); extern void prepare_target_option_nodes_for_pch (void); #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) inline tree tree_check (tree __t, const char *__f, int __l, const char *__g, tree_code __c) { if (TREE_CODE (__t) != __c) tree_check_failed (__t, __f, __l, __g, __c, 0); return __t; } inline tree tree_not_check (tree __t, const char *__f, int __l, const char *__g, enum tree_code __c) { if (TREE_CODE (__t) == __c) tree_not_check_failed (__t, __f, __l, __g, __c, 0); return __t; } inline tree tree_check2 (tree __t, const char *__f, int __l, const char *__g, enum tree_code __c1, enum tree_code __c2) { if (TREE_CODE (__t) != __c1 && TREE_CODE (__t) != __c2) tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0); return __t; } inline tree tree_not_check2 (tree __t, const char *__f, int __l, const char *__g, enum tree_code __c1, enum tree_code __c2) { if (TREE_CODE (__t) == __c1 || TREE_CODE (__t) == __c2) tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0); return __t; } inline tree tree_check3 (tree __t, const char *__f, int __l, const char *__g, enum tree_code __c1, enum tree_code __c2, enum tree_code __c3) { if (TREE_CODE (__t) != __c1 && TREE_CODE (__t) != __c2 && TREE_CODE (__t) != __c3) tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0); return __t; } inline tree tree_not_check3 (tree __t, const char *__f, int __l, const char *__g, enum tree_code __c1, enum tree_code __c2, enum tree_code __c3) { if (TREE_CODE (__t) == __c1 || TREE_CODE (__t) == __c2 || TREE_CODE (__t) == __c3) tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0); return __t; } inline tree tree_check4 (tree __t, const char *__f, int __l, const char *__g, enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, enum tree_code __c4) { if (TREE_CODE (__t) != __c1 && TREE_CODE (__t) != __c2 && TREE_CODE (__t) != __c3 && TREE_CODE (__t) != __c4) tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0); return __t; } inline tree tree_not_check4 (tree __t, const char *__f, int __l, const char *__g, enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, enum tree_code __c4) { if (TREE_CODE (__t) == __c1 || TREE_CODE (__t) == __c2 || TREE_CODE (__t) == __c3 || TREE_CODE (__t) == __c4) tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0); return __t; } inline tree tree_check5 (tree __t, const char *__f, int __l, const char *__g, enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, enum tree_code __c4, enum tree_code __c5) { if (TREE_CODE (__t) != __c1 && TREE_CODE (__t) != __c2 && TREE_CODE (__t) != __c3 && TREE_CODE (__t) != __c4 && TREE_CODE (__t) != __c5) tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0); return __t; } inline tree tree_not_check5 (tree __t, const char *__f, int __l, const char *__g, enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, enum tree_code __c4, enum tree_code __c5) { if (TREE_CODE (__t) == __c1 || TREE_CODE (__t) == __c2 || TREE_CODE (__t) == __c3 || TREE_CODE (__t) == __c4 || TREE_CODE (__t) == __c5) tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0); return __t; } inline tree contains_struct_check (tree __t, const enum tree_node_structure_enum __s, const char *__f, int __l, const char *__g) { if (tree_contains_struct[TREE_CODE (__t)][__s] != 1) tree_contains_struct_check_failed (__t, __s, __f, __l, __g); return __t; } inline tree tree_class_check (tree __t, const enum tree_code_class __class, const char *__f, int __l, const char *__g) { if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class) tree_class_check_failed (__t, __class, __f, __l, __g); return __t; } inline tree tree_range_check (tree __t, enum tree_code __code1, enum tree_code __code2, const char *__f, int __l, const char *__g) { if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2) tree_range_check_failed (__t, __f, __l, __g, __code1, __code2); return __t; } inline tree omp_clause_subcode_check (tree __t, enum omp_clause_code __code, const char *__f, int __l, const char *__g) { if (TREE_CODE (__t) != OMP_CLAUSE) tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); if (__t->omp_clause.code != __code) omp_clause_check_failed (__t, __f, __l, __g, __code); return __t; } inline tree omp_clause_range_check (tree __t, enum omp_clause_code __code1, enum omp_clause_code __code2, const char *__f, int __l, const char *__g) { if (TREE_CODE (__t) != OMP_CLAUSE) tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); if ((int) __t->omp_clause.code < (int) __code1 || (int) __t->omp_clause.code > (int) __code2) omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2); return __t; } /* These checks have to be special cased. */ inline tree expr_check (tree __t, const char *__f, int __l, const char *__g) { char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); if (!IS_EXPR_CODE_CLASS (__c)) tree_class_check_failed (__t, tcc_expression, __f, __l, __g); return __t; } /* These checks have to be special cased. */ inline tree non_type_check (tree __t, const char *__f, int __l, const char *__g) { if (TYPE_P (__t)) tree_not_class_check_failed (__t, tcc_type, __f, __l, __g); return __t; } inline const HOST_WIDE_INT * tree_int_cst_elt_check (const_tree __t, int __i, const char *__f, int __l, const char *__g) { if (TREE_CODE (__t) != INTEGER_CST) tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0); if (__i < 0 || __i >= __t->base.u.int_length.extended) tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended, __f, __l, __g); return &CONST_CAST_TREE (__t)->int_cst.val[__i]; } inline HOST_WIDE_INT * tree_int_cst_elt_check (tree __t, int __i, const char *__f, int __l, const char *__g) { if (TREE_CODE (__t) != INTEGER_CST) tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0); if (__i < 0 || __i >= __t->base.u.int_length.extended) tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended, __f, __l, __g); return &CONST_CAST_TREE (__t)->int_cst.val[__i]; } /* Workaround -Wstrict-overflow false positive during profiledbootstrap. */ # if GCC_VERSION >= 4006 #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wstrict-overflow" #endif inline tree * tree_vec_elt_check (tree __t, int __i, const char *__f, int __l, const char *__g) { if (TREE_CODE (__t) != TREE_VEC) tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0); if (__i < 0 || __i >= __t->base.u.length) tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g); return &CONST_CAST_TREE (__t)->vec.a[__i]; } # if GCC_VERSION >= 4006 #pragma GCC diagnostic pop #endif inline tree * omp_clause_elt_check (tree __t, int __i, const char *__f, int __l, const char *__g) { if (TREE_CODE (__t) != OMP_CLAUSE) tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) omp_clause_operand_check_failed (__i, __t, __f, __l, __g); return &__t->omp_clause.ops[__i]; } /* These checks have to be special cased. */ inline tree any_integral_type_check (tree __t, const char *__f, int __l, const char *__g) { if (!ANY_INTEGRAL_TYPE_P (__t)) tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE, INTEGER_TYPE, 0); return __t; } inline const_tree tree_check (const_tree __t, const char *__f, int __l, const char *__g, tree_code __c) { if (TREE_CODE (__t) != __c) tree_check_failed (__t, __f, __l, __g, __c, 0); return __t; } inline const_tree tree_not_check (const_tree __t, const char *__f, int __l, const char *__g, enum tree_code __c) { if (TREE_CODE (__t) == __c) tree_not_check_failed (__t, __f, __l, __g, __c, 0); return __t; } inline const_tree tree_check2 (const_tree __t, const char *__f, int __l, const char *__g, enum tree_code __c1, enum tree_code __c2) { if (TREE_CODE (__t) != __c1 && TREE_CODE (__t) != __c2) tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0); return __t; } inline const_tree tree_not_check2 (const_tree __t, const char *__f, int __l, const char *__g, enum tree_code __c1, enum tree_code __c2) { if (TREE_CODE (__t) == __c1 || TREE_CODE (__t) == __c2) tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0); return __t; } inline const_tree tree_check3 (const_tree __t, const char *__f, int __l, const char *__g, enum tree_code __c1, enum tree_code __c2, enum tree_code __c3) { if (TREE_CODE (__t) != __c1 && TREE_CODE (__t) != __c2 && TREE_CODE (__t) != __c3) tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0); return __t; } inline const_tree tree_not_check3 (const_tree __t, const char *__f, int __l, const char *__g, enum tree_code __c1, enum tree_code __c2, enum tree_code __c3) { if (TREE_CODE (__t) == __c1 || TREE_CODE (__t) == __c2 || TREE_CODE (__t) == __c3) tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0); return __t; } inline const_tree tree_check4 (const_tree __t, const char *__f, int __l, const char *__g, enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, enum tree_code __c4) { if (TREE_CODE (__t) != __c1 && TREE_CODE (__t) != __c2 && TREE_CODE (__t) != __c3 && TREE_CODE (__t) != __c4) tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0); return __t; } inline const_tree tree_not_check4 (const_tree __t, const char *__f, int __l, const char *__g, enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, enum tree_code __c4) { if (TREE_CODE (__t) == __c1 || TREE_CODE (__t) == __c2 || TREE_CODE (__t) == __c3 || TREE_CODE (__t) == __c4) tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0); return __t; } inline const_tree tree_check5 (const_tree __t, const char *__f, int __l, const char *__g, enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, enum tree_code __c4, enum tree_code __c5) { if (TREE_CODE (__t) != __c1 && TREE_CODE (__t) != __c2 && TREE_CODE (__t) != __c3 && TREE_CODE (__t) != __c4 && TREE_CODE (__t) != __c5) tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0); return __t; } inline const_tree tree_not_check5 (const_tree __t, const char *__f, int __l, const char *__g, enum tree_code __c1, enum tree_code __c2, enum tree_code __c3, enum tree_code __c4, enum tree_code __c5) { if (TREE_CODE (__t) == __c1 || TREE_CODE (__t) == __c2 || TREE_CODE (__t) == __c3 || TREE_CODE (__t) == __c4 || TREE_CODE (__t) == __c5) tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0); return __t; } inline const_tree contains_struct_check (const_tree __t, const enum tree_node_structure_enum __s, const char *__f, int __l, const char *__g) { if (tree_contains_struct[TREE_CODE (__t)][__s] != 1) tree_contains_struct_check_failed (__t, __s, __f, __l, __g); return __t; } inline const_tree tree_class_check (const_tree __t, const enum tree_code_class __class, const char *__f, int __l, const char *__g) { if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class) tree_class_check_failed (__t, __class, __f, __l, __g); return __t; } inline const_tree tree_range_check (const_tree __t, enum tree_code __code1, enum tree_code __code2, const char *__f, int __l, const char *__g) { if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2) tree_range_check_failed (__t, __f, __l, __g, __code1, __code2); return __t; } inline const_tree omp_clause_subcode_check (const_tree __t, enum omp_clause_code __code, const char *__f, int __l, const char *__g) { if (TREE_CODE (__t) != OMP_CLAUSE) tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); if (__t->omp_clause.code != __code) omp_clause_check_failed (__t, __f, __l, __g, __code); return __t; } inline const_tree omp_clause_range_check (const_tree __t, enum omp_clause_code __code1, enum omp_clause_code __code2, const char *__f, int __l, const char *__g) { if (TREE_CODE (__t) != OMP_CLAUSE) tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); if ((int) __t->omp_clause.code < (int) __code1 || (int) __t->omp_clause.code > (int) __code2) omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2); return __t; } inline const_tree expr_check (const_tree __t, const char *__f, int __l, const char *__g) { char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); if (!IS_EXPR_CODE_CLASS (__c)) tree_class_check_failed (__t, tcc_expression, __f, __l, __g); return __t; } inline const_tree non_type_check (const_tree __t, const char *__f, int __l, const char *__g) { if (TYPE_P (__t)) tree_not_class_check_failed (__t, tcc_type, __f, __l, __g); return __t; } # if GCC_VERSION >= 4006 #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wstrict-overflow" #endif inline const_tree * tree_vec_elt_check (const_tree __t, int __i, const char *__f, int __l, const char *__g) { if (TREE_CODE (__t) != TREE_VEC) tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0); if (__i < 0 || __i >= __t->base.u.length) tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g); return CONST_CAST (const_tree *, &__t->vec.a[__i]); //return &__t->vec.a[__i]; } # if GCC_VERSION >= 4006 #pragma GCC diagnostic pop #endif inline const_tree * omp_clause_elt_check (const_tree __t, int __i, const char *__f, int __l, const char *__g) { if (TREE_CODE (__t) != OMP_CLAUSE) tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0); if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) omp_clause_operand_check_failed (__i, __t, __f, __l, __g); return CONST_CAST (const_tree *, &__t->omp_clause.ops[__i]); } inline const_tree any_integral_type_check (const_tree __t, const char *__f, int __l, const char *__g) { if (!ANY_INTEGRAL_TYPE_P (__t)) tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE, INTEGER_TYPE, 0); return __t; } #endif /* Compute the number of operands in an expression node NODE. For tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself, otherwise it is looked up from the node's code. */ static inline int tree_operand_length (const_tree node) { if (VL_EXP_CLASS_P (node)) return VL_EXP_OPERAND_LENGTH (node); else return TREE_CODE_LENGTH (TREE_CODE (node)); } #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) /* Special checks for TREE_OPERANDs. */ inline tree * tree_operand_check (tree __t, int __i, const char *__f, int __l, const char *__g) { const_tree __u = EXPR_CHECK (__t); if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u)) tree_operand_check_failed (__i, __u, __f, __l, __g); return &CONST_CAST_TREE (__u)->exp.operands[__i]; } inline tree * tree_operand_check_code (tree __t, enum tree_code __code, int __i, const char *__f, int __l, const char *__g) { if (TREE_CODE (__t) != __code) tree_check_failed (__t, __f, __l, __g, __code, 0); if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) tree_operand_check_failed (__i, __t, __f, __l, __g); return &__t->exp.operands[__i]; } inline const_tree * tree_operand_check (const_tree __t, int __i, const char *__f, int __l, const char *__g) { const_tree __u = EXPR_CHECK (__t); if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u)) tree_operand_check_failed (__i, __u, __f, __l, __g); return CONST_CAST (const_tree *, &__u->exp.operands[__i]); } inline const_tree * tree_operand_check_code (const_tree __t, enum tree_code __code, int __i, const char *__f, int __l, const char *__g) { if (TREE_CODE (__t) != __code) tree_check_failed (__t, __f, __l, __g, __code, 0); if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) tree_operand_check_failed (__i, __t, __f, __l, __g); return CONST_CAST (const_tree *, &__t->exp.operands[__i]); } #endif #define error_mark_node global_trees[TI_ERROR_MARK] #define intQI_type_node global_trees[TI_INTQI_TYPE] #define intHI_type_node global_trees[TI_INTHI_TYPE] #define intSI_type_node global_trees[TI_INTSI_TYPE] #define intDI_type_node global_trees[TI_INTDI_TYPE] #define intTI_type_node global_trees[TI_INTTI_TYPE] #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE] #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE] #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE] #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE] #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE] #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE] #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE] #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE] #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE] #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE] #define uint16_type_node global_trees[TI_UINT16_TYPE] #define uint32_type_node global_trees[TI_UINT32_TYPE] #define uint64_type_node global_trees[TI_UINT64_TYPE] #define void_node global_trees[TI_VOID] #define integer_zero_node global_trees[TI_INTEGER_ZERO] #define integer_one_node global_trees[TI_INTEGER_ONE] #define integer_three_node global_trees[TI_INTEGER_THREE] #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE] #define size_zero_node global_trees[TI_SIZE_ZERO] #define size_one_node global_trees[TI_SIZE_ONE] #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO] #define bitsize_one_node global_trees[TI_BITSIZE_ONE] #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT] /* Base access nodes. */ #define access_public_node global_trees[TI_PUBLIC] #define access_protected_node global_trees[TI_PROTECTED] #define access_private_node global_trees[TI_PRIVATE] #define null_pointer_node global_trees[TI_NULL_POINTER] #define float_type_node global_trees[TI_FLOAT_TYPE] #define double_type_node global_trees[TI_DOUBLE_TYPE] #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE] #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE] #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE] #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE] #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE] #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE] #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE] #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE] #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE] #define pointer_bounds_type_node global_trees[TI_POINTER_BOUNDS_TYPE] #define void_type_node global_trees[TI_VOID_TYPE] /* The C type `void *'. */ #define ptr_type_node global_trees[TI_PTR_TYPE] /* The C type `const void *'. */ #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE] /* The C type `size_t'. */ #define size_type_node global_trees[TI_SIZE_TYPE] #define pid_type_node global_trees[TI_PID_TYPE] #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE] #define va_list_type_node global_trees[TI_VA_LIST_TYPE] #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD] #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD] /* The C type `FILE *'. */ #define fileptr_type_node global_trees[TI_FILEPTR_TYPE] #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE] #define boolean_type_node global_trees[TI_BOOLEAN_TYPE] #define boolean_false_node global_trees[TI_BOOLEAN_FALSE] #define boolean_true_node global_trees[TI_BOOLEAN_TRUE] /* The decimal floating point types. */ #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE] #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE] #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE] #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE] #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE] #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE] /* The fixed-point types. */ #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE] #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE] #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE] #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE] #define sat_unsigned_short_fract_type_node \ global_trees[TI_SAT_USFRACT_TYPE] #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE] #define sat_unsigned_long_fract_type_node \ global_trees[TI_SAT_ULFRACT_TYPE] #define sat_unsigned_long_long_fract_type_node \ global_trees[TI_SAT_ULLFRACT_TYPE] #define short_fract_type_node global_trees[TI_SFRACT_TYPE] #define fract_type_node global_trees[TI_FRACT_TYPE] #define long_fract_type_node global_trees[TI_LFRACT_TYPE] #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE] #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE] #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE] #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE] #define unsigned_long_long_fract_type_node \ global_trees[TI_ULLFRACT_TYPE] #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE] #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE] #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE] #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE] #define sat_unsigned_short_accum_type_node \ global_trees[TI_SAT_USACCUM_TYPE] #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE] #define sat_unsigned_long_accum_type_node \ global_trees[TI_SAT_ULACCUM_TYPE] #define sat_unsigned_long_long_accum_type_node \ global_trees[TI_SAT_ULLACCUM_TYPE] #define short_accum_type_node global_trees[TI_SACCUM_TYPE] #define accum_type_node global_trees[TI_ACCUM_TYPE] #define long_accum_type_node global_trees[TI_LACCUM_TYPE] #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE] #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE] #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE] #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE] #define unsigned_long_long_accum_type_node \ global_trees[TI_ULLACCUM_TYPE] #define qq_type_node global_trees[TI_QQ_TYPE] #define hq_type_node global_trees[TI_HQ_TYPE] #define sq_type_node global_trees[TI_SQ_TYPE] #define dq_type_node global_trees[TI_DQ_TYPE] #define tq_type_node global_trees[TI_TQ_TYPE] #define uqq_type_node global_trees[TI_UQQ_TYPE] #define uhq_type_node global_trees[TI_UHQ_TYPE] #define usq_type_node global_trees[TI_USQ_TYPE] #define udq_type_node global_trees[TI_UDQ_TYPE] #define utq_type_node global_trees[TI_UTQ_TYPE] #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE] #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE] #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE] #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE] #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE] #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE] #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE] #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE] #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE] #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE] #define ha_type_node global_trees[TI_HA_TYPE] #define sa_type_node global_trees[TI_SA_TYPE] #define da_type_node global_trees[TI_DA_TYPE] #define ta_type_node global_trees[TI_TA_TYPE] #define uha_type_node global_trees[TI_UHA_TYPE] #define usa_type_node global_trees[TI_USA_TYPE] #define uda_type_node global_trees[TI_UDA_TYPE] #define uta_type_node global_trees[TI_UTA_TYPE] #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE] #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE] #define sat_da_type_node global_trees[TI_SAT_DA_TYPE] #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE] #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE] #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE] #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE] #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE] /* The node that should be placed at the end of a parameter list to indicate that the function does not take a variable number of arguments. The TREE_VALUE will be void_type_node and there will be no TREE_CHAIN. Language-independent code should not assume anything else about this node. */ #define void_list_node global_trees[TI_VOID_LIST_NODE] #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER] #define MAIN_NAME_P(NODE) \ (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node) /* Optimization options (OPTIMIZATION_NODE) to use for default and current functions. */ #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT] #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT] /* Default/current target options (TARGET_OPTION_NODE). */ #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT] #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT] /* Default tree list option(), optimize() pragmas to be linked into the attribute list. */ #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA] #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA] #define char_type_node integer_types[itk_char] #define signed_char_type_node integer_types[itk_signed_char] #define unsigned_char_type_node integer_types[itk_unsigned_char] #define short_integer_type_node integer_types[itk_short] #define short_unsigned_type_node integer_types[itk_unsigned_short] #define integer_type_node integer_types[itk_int] #define unsigned_type_node integer_types[itk_unsigned_int] #define long_integer_type_node integer_types[itk_long] #define long_unsigned_type_node integer_types[itk_unsigned_long] #define long_long_integer_type_node integer_types[itk_long_long] #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long] /* True if NODE is an erroneous expression. */ #define error_operand_p(NODE) \ ((NODE) == error_mark_node \ || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node)) extern tree decl_assembler_name (tree); extern tree decl_comdat_group (const_tree); extern tree decl_comdat_group_id (const_tree); extern const char *decl_section_name (const_tree); extern void set_decl_section_name (tree, const char *); extern enum tls_model decl_tls_model (const_tree); extern void set_decl_tls_model (tree, enum tls_model); /* Compute the number of bytes occupied by 'node'. This routine only looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */ extern size_t tree_size (const_tree); /* Compute the number of bytes occupied by a tree with code CODE. This function cannot be used for TREE_VEC or INTEGER_CST nodes, which are of variable length. */ extern size_t tree_code_size (enum tree_code); /* Allocate and return a new UID from the DECL_UID namespace. */ extern int allocate_decl_uid (void); /* Lowest level primitive for allocating a node. The TREE_CODE is the only argument. Contents are initialized to zero except for a few of the common fields. */ extern tree make_node_stat (enum tree_code MEM_STAT_DECL); #define make_node(t) make_node_stat (t MEM_STAT_INFO) /* Make a copy of a node, with all the same contents. */ extern tree copy_node_stat (tree MEM_STAT_DECL); #define copy_node(t) copy_node_stat (t MEM_STAT_INFO) /* Make a copy of a chain of TREE_LIST nodes. */ extern tree copy_list (tree); /* Make a CASE_LABEL_EXPR. */ extern tree build_case_label (tree, tree, tree); /* Make a BINFO. */ extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL); #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO) /* Make an INTEGER_CST. */ extern tree make_int_cst_stat (int, int MEM_STAT_DECL); #define make_int_cst(LEN, EXT_LEN) \ make_int_cst_stat (LEN, EXT_LEN MEM_STAT_INFO) /* Make a TREE_VEC. */ extern tree make_tree_vec_stat (int MEM_STAT_DECL); #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO) /* Grow a TREE_VEC. */ extern tree grow_tree_vec_stat (tree v, int MEM_STAT_DECL); #define grow_tree_vec(v, t) grow_tree_vec_stat (v, t MEM_STAT_INFO) /* Construct various types of nodes. */ extern tree build_nt (enum tree_code, ...); extern tree build_nt_call_vec (tree, vec<tree, va_gc> *); extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL); #define build0(c,t) build0_stat (c,t MEM_STAT_INFO) extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL); #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO) extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL); #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO) extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL); #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO) extern tree build4_stat (enum tree_code, tree, tree, tree, tree, tree MEM_STAT_DECL); #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO) extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree, tree MEM_STAT_DECL); #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO) /* _loc versions of build[1-5]. */ static inline tree build1_stat_loc (location_t loc, enum tree_code code, tree type, tree arg1 MEM_STAT_DECL) { tree t = build1_stat (code, type, arg1 PASS_MEM_STAT); if (CAN_HAVE_LOCATION_P (t)) SET_EXPR_LOCATION (t, loc); return t; } #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO) static inline tree build2_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0, tree arg1 MEM_STAT_DECL) { tree t = build2_stat (code, type, arg0, arg1 PASS_MEM_STAT); if (CAN_HAVE_LOCATION_P (t)) SET_EXPR_LOCATION (t, loc); return t; } #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO) static inline tree build3_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0, tree arg1, tree arg2 MEM_STAT_DECL) { tree t = build3_stat (code, type, arg0, arg1, arg2 PASS_MEM_STAT); if (CAN_HAVE_LOCATION_P (t)) SET_EXPR_LOCATION (t, loc); return t; } #define build3_loc(l,c,t1,t2,t3,t4) \ build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO) static inline tree build4_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0, tree arg1, tree arg2, tree arg3 MEM_STAT_DECL) { tree t = build4_stat (code, type, arg0, arg1, arg2, arg3 PASS_MEM_STAT); if (CAN_HAVE_LOCATION_P (t)) SET_EXPR_LOCATION (t, loc); return t; } #define build4_loc(l,c,t1,t2,t3,t4,t5) \ build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO) static inline tree build5_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0, tree arg1, tree arg2, tree arg3, tree arg4 MEM_STAT_DECL) { tree t = build5_stat (code, type, arg0, arg1, arg2, arg3, arg4 PASS_MEM_STAT); if (CAN_HAVE_LOCATION_P (t)) SET_EXPR_LOCATION (t, loc); return t; } #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \ build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO) extern tree build_var_debug_value_stat (tree, tree MEM_STAT_DECL); #define build_var_debug_value(t1,t2) \ build_var_debug_value_stat (t1,t2 MEM_STAT_INFO) /* Constructs double_int from tree CST. */ extern tree double_int_to_tree (tree, double_int); extern tree wide_int_to_tree (tree type, const wide_int_ref &cst); extern tree force_fit_type (tree, const wide_int_ref &, int, bool); /* Create an INT_CST node with a CST value zero extended. */ /* static inline */ extern tree build_int_cst (tree, HOST_WIDE_INT); extern tree build_int_cstu (tree type, unsigned HOST_WIDE_INT cst); extern tree build_int_cst_type (tree, HOST_WIDE_INT); extern tree make_vector_stat (unsigned MEM_STAT_DECL); #define make_vector(n) make_vector_stat (n MEM_STAT_INFO) extern tree build_vector_stat (tree, tree * MEM_STAT_DECL); #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO) extern tree build_vector_from_ctor (tree, vec<constructor_elt, va_gc> *); extern tree build_vector_from_val (tree, tree); extern tree build_constructor (tree, vec<constructor_elt, va_gc> *); extern tree build_constructor_single (tree, tree, tree); extern tree build_constructor_from_list (tree, tree); extern tree build_constructor_va (tree, int, ...); extern tree build_real_from_int_cst (tree, const_tree); extern tree build_complex (tree, tree, tree); extern tree build_one_cst (tree); extern tree build_minus_one_cst (tree); extern tree build_all_ones_cst (tree); extern tree build_zero_cst (tree); extern tree build_string (int, const char *); extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL); #define build_tree_list(t, q) build_tree_list_stat (t, q MEM_STAT_INFO) extern tree build_tree_list_vec_stat (const vec<tree, va_gc> *MEM_STAT_DECL); #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO) extern tree build_decl_stat (location_t, enum tree_code, tree, tree MEM_STAT_DECL); extern tree build_fn_decl (const char *, tree); #define build_decl(l,c,t,q) build_decl_stat (l, c, t, q MEM_STAT_INFO) extern tree build_translation_unit_decl (tree); extern tree build_block (tree, tree, tree, tree); extern tree build_empty_stmt (location_t); extern tree build_omp_clause (location_t, enum omp_clause_code); extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL); #define build_vl_exp(c, n) build_vl_exp_stat (c, n MEM_STAT_INFO) extern tree build_call_nary (tree, tree, int, ...); extern tree build_call_valist (tree, tree, int, va_list); #define build_call_array(T1,T2,N,T3)\ build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3) extern tree build_call_array_loc (location_t, tree, tree, int, const tree *); extern tree build_call_vec (tree, tree, vec<tree, va_gc> *); extern tree build_call_expr_loc_array (location_t, tree, int, tree *); extern tree build_call_expr_loc_vec (location_t, tree, vec<tree, va_gc> *); extern tree build_call_expr_loc (location_t, tree, int, ...); extern tree build_call_expr (tree, int, ...); extern tree build_call_expr_internal_loc (location_t, enum internal_fn, tree, int, ...); extern tree build_string_literal (int, const char *); /* Construct various nodes representing data types. */ extern tree signed_or_unsigned_type_for (int, tree); extern tree signed_type_for (tree); extern tree unsigned_type_for (tree); extern tree truth_type_for (tree); extern tree build_pointer_type_for_mode (tree, machine_mode, bool); extern tree build_pointer_type (tree); extern tree build_reference_type_for_mode (tree, machine_mode, bool); extern tree build_reference_type (tree); extern tree build_vector_type_for_mode (tree, machine_mode); extern tree build_vector_type (tree innertype, int nunits); extern tree build_opaque_vector_type (tree innertype, int nunits); extern tree build_index_type (tree); extern tree build_array_type (tree, tree); extern tree build_nonshared_array_type (tree, tree); extern tree build_array_type_nelts (tree, unsigned HOST_WIDE_INT); extern tree build_function_type (tree, tree); extern tree build_function_type_list (tree, ...); extern tree build_varargs_function_type_list (tree, ...); extern tree build_function_type_array (tree, int, tree *); extern tree build_varargs_function_type_array (tree, int, tree *); #define build_function_type_vec(RET, V) \ build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V)) #define build_varargs_function_type_vec(RET, V) \ build_varargs_function_type_array (RET, vec_safe_length (V), \ vec_safe_address (V)) extern tree build_method_type_directly (tree, tree, tree); extern tree build_method_type (tree, tree); extern tree build_offset_type (tree, tree); extern tree build_complex_type (tree); extern tree array_type_nelts (const_tree); extern tree value_member (tree, tree); extern tree purpose_member (const_tree, tree); extern bool vec_member (const_tree, vec<tree, va_gc> *); extern tree chain_index (int, tree); extern int attribute_list_equal (const_tree, const_tree); extern int attribute_list_contained (const_tree, const_tree); extern int tree_int_cst_equal (const_tree, const_tree); extern bool tree_fits_shwi_p (const_tree) #ifndef ENABLE_TREE_CHECKING ATTRIBUTE_PURE /* tree_fits_shwi_p is pure only when checking is disabled. */ #endif ; extern bool tree_fits_uhwi_p (const_tree) #ifndef ENABLE_TREE_CHECKING ATTRIBUTE_PURE /* tree_fits_uhwi_p is pure only when checking is disabled. */ #endif ; extern HOST_WIDE_INT tree_to_shwi (const_tree); extern unsigned HOST_WIDE_INT tree_to_uhwi (const_tree); #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003) extern inline __attribute__ ((__gnu_inline__)) HOST_WIDE_INT tree_to_shwi (const_tree t) { gcc_assert (tree_fits_shwi_p (t)); return TREE_INT_CST_LOW (t); } extern inline __attribute__ ((__gnu_inline__)) unsigned HOST_WIDE_INT tree_to_uhwi (const_tree t) { gcc_assert (tree_fits_uhwi_p (t)); return TREE_INT_CST_LOW (t); } #endif extern int tree_int_cst_sgn (const_tree); extern int tree_int_cst_sign_bit (const_tree); extern unsigned int tree_int_cst_min_precision (tree, signop); extern tree strip_array_types (tree); extern tree excess_precision_type (tree); extern bool valid_constant_size_p (const_tree); /* From expmed.c. Since rtl.h is included after tree.h, we can't put the prototype here. Rtl.h does declare the prototype if tree.h had been included. */ extern tree make_tree (tree, rtx); /* Return a type like TTYPE except that its TYPE_ATTRIBUTES is ATTRIBUTE. Such modified types already made are recorded so that duplicates are not made. */ extern tree build_type_attribute_variant (tree, tree); extern tree build_decl_attribute_variant (tree, tree); extern tree build_type_attribute_qual_variant (tree, tree, int); /* Return 0 if the attributes for two types are incompatible, 1 if they are compatible, and 2 if they are nearly compatible (which causes a warning to be generated). */ extern int comp_type_attributes (const_tree, const_tree); /* Default versions of target-overridable functions. */ extern tree merge_decl_attributes (tree, tree); extern tree merge_type_attributes (tree, tree); /* This function is a private implementation detail of lookup_attribute() and you should never call it directly. */ extern tree private_lookup_attribute (const char *, size_t, tree); /* This function is a private implementation detail of lookup_attribute_by_prefix() and you should never call it directly. */ extern tree private_lookup_attribute_by_prefix (const char *, size_t, tree); /* Given an attribute name ATTR_NAME and a list of attributes LIST, return a pointer to the attribute's list element if the attribute is part of the list, or NULL_TREE if not found. If the attribute appears more than once, this only returns the first occurrence; the TREE_CHAIN of the return value should be passed back in if further occurrences are wanted. ATTR_NAME must be in the form 'text' (not '__text__'). */ static inline tree lookup_attribute (const char *attr_name, tree list) { gcc_checking_assert (attr_name[0] != '_'); /* In most cases, list is NULL_TREE. */ if (list == NULL_TREE) return NULL_TREE; else /* Do the strlen() before calling the out-of-line implementation. In most cases attr_name is a string constant, and the compiler will optimize the strlen() away. */ return private_lookup_attribute (attr_name, strlen (attr_name), list); } /* Given an attribute name ATTR_NAME and a list of attributes LIST, return a pointer to the attribute's list first element if the attribute starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not '__text__'). */ static inline tree lookup_attribute_by_prefix (const char *attr_name, tree list) { gcc_checking_assert (attr_name[0] != '_'); /* In most cases, list is NULL_TREE. */ if (list == NULL_TREE) return NULL_TREE; else return private_lookup_attribute_by_prefix (attr_name, strlen (attr_name), list); } /* This function is a private implementation detail of is_attribute_p() and you should never call it directly. */ extern bool private_is_attribute_p (const char *, size_t, const_tree); /* Given an identifier node IDENT and a string ATTR_NAME, return true if the identifier node is a valid attribute name for the string. ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could be the identifier for 'text' or for '__text__'. */ static inline bool is_attribute_p (const char *attr_name, const_tree ident) { gcc_checking_assert (attr_name[0] != '_'); /* Do the strlen() before calling the out-of-line implementation. In most cases attr_name is a string constant, and the compiler will optimize the strlen() away. */ return private_is_attribute_p (attr_name, strlen (attr_name), ident); } /* Remove any instances of attribute ATTR_NAME in LIST and return the modified list. ATTR_NAME must be in the form 'text' (not '__text__'). */ extern tree remove_attribute (const char *, tree); /* Given two attributes lists, return a list of their union. */ extern tree merge_attributes (tree, tree); #if TARGET_DLLIMPORT_DECL_ATTRIBUTES /* Given two Windows decl attributes lists, possibly including dllimport, return a list of their union . */ extern tree merge_dllimport_decl_attributes (tree, tree); /* Handle a "dllimport" or "dllexport" attribute. */ extern tree handle_dll_attribute (tree *, tree, tree, int, bool *); #endif /* Returns true iff unqualified CAND and BASE are equivalent. */ extern bool check_base_type (const_tree cand, const_tree base); /* Check whether CAND is suitable to be returned from get_qualified_type (BASE, TYPE_QUALS). */ extern bool check_qualified_type (const_tree, const_tree, int); /* Return a version of the TYPE, qualified as indicated by the TYPE_QUALS, if one exists. If no qualified version exists yet, return NULL_TREE. */ extern tree get_qualified_type (tree, int); /* Like get_qualified_type, but creates the type if it does not exist. This function never returns NULL_TREE. */ extern tree build_qualified_type (tree, int); /* Create a variant of type T with alignment ALIGN. */ extern tree build_aligned_type (tree, unsigned int); /* Like build_qualified_type, but only deals with the `const' and `volatile' qualifiers. This interface is retained for backwards compatibility with the various front-ends; new code should use build_qualified_type instead. */ #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \ build_qualified_type ((TYPE), \ ((CONST_P) ? TYPE_QUAL_CONST : 0) \ | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0)) /* Make a copy of a type node. */ extern tree build_distinct_type_copy (tree); extern tree build_variant_type_copy (tree); /* Given a hashcode and a ..._TYPE node (for which the hashcode was made), return a canonicalized ..._TYPE node, so that duplicates are not made. How the hash code is computed is up to the caller, as long as any two callers that could hash identical-looking type nodes agree. */ extern tree type_hash_canon (unsigned int, tree); extern tree convert (tree, tree); extern unsigned int expr_align (const_tree); extern tree size_in_bytes (const_tree); extern HOST_WIDE_INT int_size_in_bytes (const_tree); extern HOST_WIDE_INT max_int_size_in_bytes (const_tree); extern tree bit_position (const_tree); extern tree byte_position (const_tree); extern HOST_WIDE_INT int_byte_position (const_tree); #define sizetype sizetype_tab[(int) stk_sizetype] #define bitsizetype sizetype_tab[(int) stk_bitsizetype] #define ssizetype sizetype_tab[(int) stk_ssizetype] #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype] #define size_int(L) size_int_kind (L, stk_sizetype) #define ssize_int(L) size_int_kind (L, stk_ssizetype) #define bitsize_int(L) size_int_kind (L, stk_bitsizetype) #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype) /* Type for sizes of data-type. */ #define BITS_PER_UNIT_LOG \ ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \ + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \ + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256)) /* Concatenate two lists (chains of TREE_LIST nodes) X and Y by making the last node in X point to Y. Returns X, except if X is 0 returns Y. */ extern tree chainon (tree, tree); /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */ extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL); #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO) /* Return the last tree node in a chain. */ extern tree tree_last (tree); /* Reverse the order of elements in a chain, and return the new head. */ extern tree nreverse (tree); /* Returns the length of a chain of nodes (number of chain pointers to follow before reaching a null pointer). */ extern int list_length (const_tree); /* Returns the first FIELD_DECL in a type. */ extern tree first_field (const_tree); /* Given an initializer INIT, return TRUE if INIT is zero or some aggregate of zeros. Otherwise return FALSE. */ extern bool initializer_zerop (const_tree); /* Given a vector VEC, return its first element if all elements are the same. Otherwise return NULL_TREE. */ extern tree uniform_vector_p (const_tree); /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */ extern vec<tree, va_gc> *ctor_to_vec (tree); /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */ extern int integer_zerop (const_tree); /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */ extern int integer_onep (const_tree); /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or a vector or complex where each part is 1. */ extern int integer_each_onep (const_tree); /* integer_all_onesp (tree x) is nonzero if X is an integer constant all of whose significant bits are 1. */ extern int integer_all_onesp (const_tree); /* integer_minus_onep (tree x) is nonzero if X is an integer constant of value -1. */ extern int integer_minus_onep (const_tree); /* integer_pow2p (tree x) is nonzero is X is an integer constant with exactly one bit 1. */ extern int integer_pow2p (const_tree); /* integer_nonzerop (tree x) is nonzero if X is an integer constant with a nonzero value. */ extern int integer_nonzerop (const_tree); /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or a vector where each element is an integer constant of value -1. */ extern int integer_truep (const_tree); extern bool cst_and_fits_in_hwi (const_tree); extern tree num_ending_zeros (const_tree); /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of value 0. */ extern int fixed_zerop (const_tree); /* staticp (tree x) is nonzero if X is a reference to data allocated at a fixed address in memory. Returns the outermost data. */ extern tree staticp (tree); /* save_expr (EXP) returns an expression equivalent to EXP but it can be used multiple times within context CTX and only evaluate EXP once. */ extern tree save_expr (tree); /* Look inside EXPR into any simple arithmetic operations. Return the outermost non-arithmetic or non-invariant node. */ extern tree skip_simple_arithmetic (tree); /* Look inside EXPR into simple arithmetic operations involving constants. Return the outermost non-arithmetic or non-constant node. */ extern tree skip_simple_constant_arithmetic (tree); /* Return which tree structure is used by T. */ enum tree_node_structure_enum tree_node_structure (const_tree); /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a size or offset that depends on a field within a record. */ extern bool contains_placeholder_p (const_tree); /* This macro calls the above function but short-circuits the common case of a constant to save time. Also check for null. */ #define CONTAINS_PLACEHOLDER_P(EXP) \ ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP)) /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field positions. */ extern bool type_contains_placeholder_p (tree); /* Given a tree EXP, find all occurrences of references to fields in a PLACEHOLDER_EXPR and place them in vector REFS without duplicates. Also record VAR_DECLs and CONST_DECLs. Note that we assume here that EXP contains only arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their argument list. */ extern void find_placeholder_in_expr (tree, vec<tree> *); /* This macro calls the above function but short-circuits the common case of a constant to save time and also checks for NULL. */ #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \ do { \ if((EXP) && !TREE_CONSTANT (EXP)) \ find_placeholder_in_expr (EXP, V); \ } while (0) /* Given a tree EXP, a FIELD_DECL F, and a replacement value R, return a tree with all occurrences of references to F in a PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and CONST_DECLs. Note that we assume here that EXP contains only arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their argument list. */ extern tree substitute_in_expr (tree, tree, tree); /* This macro calls the above function but short-circuits the common case of a constant to save time and also checks for NULL. */ #define SUBSTITUTE_IN_EXPR(EXP, F, R) \ ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R)) /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement for it within OBJ, a tree that is an object or a chain of references. */ extern tree substitute_placeholder_in_expr (tree, tree); /* This macro calls the above function but short-circuits the common case of a constant to save time and also checks for NULL. */ #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \ ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \ : substitute_placeholder_in_expr (EXP, OBJ)) /* stabilize_reference (EXP) returns a reference equivalent to EXP but it can be used multiple times and only evaluate the subexpressions once. */ extern tree stabilize_reference (tree); /* Return EXP, stripped of any conversions to wider types in such a way that the result of converting to type FOR_TYPE is the same as if EXP were converted to FOR_TYPE. If FOR_TYPE is 0, it signifies EXP's type. */ extern tree get_unwidened (tree, tree); /* Return OP or a simpler expression for a narrower value which can be sign-extended or zero-extended to give back OP. Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended or 0 if the value should be sign-extended. */ extern tree get_narrower (tree, int *); /* Return true if T is an expression that get_inner_reference handles. */ static inline bool handled_component_p (const_tree t) { switch (TREE_CODE (t)) { case COMPONENT_REF: case BIT_FIELD_REF: case ARRAY_REF: case ARRAY_RANGE_REF: case REALPART_EXPR: case IMAGPART_EXPR: case VIEW_CONVERT_EXPR: return true; default: return false; } } /* Given a DECL or TYPE, return the scope in which it was declared, or NUL_TREE if there is no containing scope. */ extern tree get_containing_scope (const_tree); /* Return the FUNCTION_DECL which provides this _DECL with its context, or zero if none. */ extern tree decl_function_context (const_tree); /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides this _DECL with its context, or zero if none. */ extern tree decl_type_context (const_tree); /* Return 1 if EXPR is the real constant zero. */ extern int real_zerop (const_tree); /* Initialize the iterator I with arguments from function FNDECL */ static inline void function_args_iter_init (function_args_iterator *i, const_tree fntype) { i->next = TYPE_ARG_TYPES (fntype); } /* Return a pointer that holds the next argument if there are more arguments to handle, otherwise return NULL. */ static inline tree * function_args_iter_cond_ptr (function_args_iterator *i) { return (i->next) ? &TREE_VALUE (i->next) : NULL; } /* Return the next argument if there are more arguments to handle, otherwise return NULL. */ static inline tree function_args_iter_cond (function_args_iterator *i) { return (i->next) ? TREE_VALUE (i->next) : NULL_TREE; } /* Advance to the next argument. */ static inline void function_args_iter_next (function_args_iterator *i) { gcc_assert (i->next != NULL_TREE); i->next = TREE_CHAIN (i->next); } /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */ static inline bool inlined_function_outer_scope_p (const_tree block) { return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block)) != UNKNOWN_LOCATION; } /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set to point to the next tree element. ITER is an instance of function_args_iterator used to iterate the arguments. */ #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \ for (function_args_iter_init (&(ITER), (FNTYPE)); \ (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \ function_args_iter_next (&(ITER))) /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set to the next tree element. ITER is an instance of function_args_iterator used to iterate the arguments. */ #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \ for (function_args_iter_init (&(ITER), (FNTYPE)); \ (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \ function_args_iter_next (&(ITER))) /* In tree.c */ extern unsigned crc32_string (unsigned, const char *); extern unsigned crc32_byte (unsigned, char); extern unsigned crc32_unsigned (unsigned, unsigned); extern void clean_symbol_name (char *); extern tree get_file_function_name (const char *); extern tree get_callee_fndecl (const_tree); extern int type_num_arguments (const_tree); extern bool associative_tree_code (enum tree_code); extern bool commutative_tree_code (enum tree_code); extern bool commutative_ternary_tree_code (enum tree_code); extern tree upper_bound_in_type (tree, tree); extern tree lower_bound_in_type (tree, tree); extern int operand_equal_for_phi_arg_p (const_tree, const_tree); extern tree create_artificial_label (location_t); extern const char *get_name (tree); extern bool stdarg_p (const_tree); extern bool prototype_p (tree); extern bool is_typedef_decl (tree x); extern bool typedef_variant_p (tree); extern bool auto_var_in_fn_p (const_tree, const_tree); extern tree build_low_bits_mask (tree, unsigned); extern bool tree_nop_conversion_p (const_tree, const_tree); extern tree tree_strip_nop_conversions (tree); extern tree tree_strip_sign_nop_conversions (tree); extern const_tree strip_invariant_refs (const_tree); extern tree lhd_gcc_personality (void); extern void assign_assembler_name_if_neeeded (tree); extern void warn_deprecated_use (tree, tree); extern void cache_integer_cst (tree); /* Return the memory model from a host integer. */ static inline enum memmodel memmodel_from_int (unsigned HOST_WIDE_INT val) { return (enum memmodel) (val & MEMMODEL_MASK); } /* Return the base memory model from a host integer. */ static inline enum memmodel memmodel_base (unsigned HOST_WIDE_INT val) { return (enum memmodel) (val & MEMMODEL_BASE_MASK); } /* Return TRUE if the memory model is RELAXED. */ static inline bool is_mm_relaxed (enum memmodel model) { return (model & MEMMODEL_BASE_MASK) == MEMMODEL_RELAXED; } /* Return TRUE if the memory model is CONSUME. */ static inline bool is_mm_consume (enum memmodel model) { return (model & MEMMODEL_BASE_MASK) == MEMMODEL_CONSUME; } /* Return TRUE if the memory model is ACQUIRE. */ static inline bool is_mm_acquire (enum memmodel model) { return (model & MEMMODEL_BASE_MASK) == MEMMODEL_ACQUIRE; } /* Return TRUE if the memory model is RELEASE. */ static inline bool is_mm_release (enum memmodel model) { return (model & MEMMODEL_BASE_MASK) == MEMMODEL_RELEASE; } /* Return TRUE if the memory model is ACQ_REL. */ static inline bool is_mm_acq_rel (enum memmodel model) { return (model & MEMMODEL_BASE_MASK) == MEMMODEL_ACQ_REL; } /* Return TRUE if the memory model is SEQ_CST. */ static inline bool is_mm_seq_cst (enum memmodel model) { return (model & MEMMODEL_BASE_MASK) == MEMMODEL_SEQ_CST; } /* Return TRUE if the memory model is a SYNC variant. */ static inline bool is_mm_sync (enum memmodel model) { return (model & MEMMODEL_SYNC); } /* Compare and hash for any structure which begins with a canonical pointer. Assumes all pointers are interchangeable, which is sort of already assumed by gcc elsewhere IIRC. */ static inline int struct_ptr_eq (const void *a, const void *b) { const void * const * x = (const void * const *) a; const void * const * y = (const void * const *) b; return *x == *y; } static inline hashval_t struct_ptr_hash (const void *a) { const void * const * x = (const void * const *) a; return (intptr_t)*x >> 4; } /* Return nonzero if CODE is a tree code that represents a truth value. */ static inline bool truth_value_p (enum tree_code code) { return (TREE_CODE_CLASS (code) == tcc_comparison || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR); } /* Return whether TYPE is a type suitable for an offset for a POINTER_PLUS_EXPR. */ static inline bool ptrofftype_p (tree type) { return (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) == TYPE_PRECISION (sizetype) && TYPE_UNSIGNED (type) == TYPE_UNSIGNED (sizetype)); } extern tree strip_float_extensions (tree); extern int really_constant_p (const_tree); extern bool decl_address_invariant_p (const_tree); extern bool decl_address_ip_invariant_p (const_tree); extern bool int_fits_type_p (const_tree, const_tree); #ifndef GENERATOR_FILE extern void get_type_static_bounds (const_tree, mpz_t, mpz_t); #endif extern bool variably_modified_type_p (tree, tree); extern int tree_log2 (const_tree); extern int tree_floor_log2 (const_tree); extern unsigned int tree_ctz (const_tree); extern int simple_cst_equal (const_tree, const_tree); namespace inchash { extern void add_expr (const_tree, hash &); } /* Compat version until all callers are converted. Return hash for TREE with SEED. */ static inline hashval_t iterative_hash_expr(const_tree tree, hashval_t seed) { inchash::hash hstate (seed); inchash::add_expr (tree, hstate); return hstate.end (); } extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT); extern int type_list_equal (const_tree, const_tree); extern int chain_member (const_tree, const_tree); extern void dump_tree_statistics (void); extern void recompute_tree_invariant_for_addr_expr (tree); extern bool needs_to_live_in_memory (const_tree); extern tree reconstruct_complex_type (tree, tree); extern int real_onep (const_tree); extern int real_minus_onep (const_tree); extern void init_ttree (void); extern void build_common_tree_nodes (bool, bool); extern void build_common_builtin_nodes (void); extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int); extern tree build_range_type (tree, tree, tree); extern tree build_nonshared_range_type (tree, tree, tree); extern bool subrange_type_for_debug_p (const_tree, tree *, tree *); extern HOST_WIDE_INT int_cst_value (const_tree); extern tree tree_block (tree); extern void tree_set_block (tree, tree); extern location_t *block_nonartificial_location (tree); extern location_t tree_nonartificial_location (tree); extern tree block_ultimate_origin (const_tree); extern tree get_binfo_at_offset (tree, HOST_WIDE_INT, tree); extern bool virtual_method_call_p (tree); extern tree obj_type_ref_class (tree ref); extern bool types_same_for_odr (const_tree type1, const_tree type2, bool strict=false); extern bool contains_bitfld_component_ref_p (const_tree); extern bool type_in_anonymous_namespace_p (const_tree); extern bool block_may_fallthru (const_tree); extern void using_eh_for_cleanups (void); extern bool using_eh_for_cleanups_p (void); extern const char *get_tree_code_name (enum tree_code); extern void set_call_expr_flags (tree, int); extern tree walk_tree_1 (tree*, walk_tree_fn, void*, hash_set<tree>*, walk_tree_lh); extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*, walk_tree_lh); #define walk_tree(a,b,c,d) \ walk_tree_1 (a, b, c, d, NULL) #define walk_tree_without_duplicates(a,b,c) \ walk_tree_without_duplicates_1 (a, b, c, NULL) extern tree get_base_address (tree t); extern tree drop_tree_overflow (tree); extern int tree_map_base_eq (const void *, const void *); extern unsigned int tree_map_base_hash (const void *); extern int tree_map_base_marked_p (const void *); #define tree_map_eq tree_map_base_eq extern unsigned int tree_map_hash (const void *); #define tree_map_marked_p tree_map_base_marked_p #define tree_decl_map_eq tree_map_base_eq extern unsigned int tree_decl_map_hash (const void *); #define tree_decl_map_marked_p tree_map_base_marked_p struct tree_decl_map_cache_hasher : ggc_cache_hasher<tree_decl_map *> { static hashval_t hash (tree_decl_map *m) { return tree_decl_map_hash (m); } static bool equal (tree_decl_map *a, tree_decl_map *b) { return tree_decl_map_eq (a, b); } static void handle_cache_entry (tree_decl_map *&m) { extern void gt_ggc_mx (tree_decl_map *&); if (m == HTAB_EMPTY_ENTRY || m == HTAB_DELETED_ENTRY) return; else if (ggc_marked_p (m->base.from)) gt_ggc_mx (m); else m = static_cast<tree_decl_map *> (HTAB_DELETED_ENTRY); } }; #define tree_int_map_eq tree_map_base_eq #define tree_int_map_hash tree_map_base_hash #define tree_int_map_marked_p tree_map_base_marked_p #define tree_vec_map_eq tree_map_base_eq #define tree_vec_map_hash tree_decl_map_hash #define tree_vec_map_marked_p tree_map_base_marked_p /* Initialize the abstract argument list iterator object ITER with the arguments from CALL_EXPR node EXP. */ static inline void init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter) { iter->t = exp; iter->n = call_expr_nargs (exp); iter->i = 0; } static inline void init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter) { iter->t = exp; iter->n = call_expr_nargs (exp); iter->i = 0; } /* Return the next argument from abstract argument list iterator object ITER, and advance its state. Return NULL_TREE if there are no more arguments. */ static inline tree next_call_expr_arg (call_expr_arg_iterator *iter) { tree result; if (iter->i >= iter->n) return NULL_TREE; result = CALL_EXPR_ARG (iter->t, iter->i); iter->i++; return result; } static inline const_tree next_const_call_expr_arg (const_call_expr_arg_iterator *iter) { const_tree result; if (iter->i >= iter->n) return NULL_TREE; result = CALL_EXPR_ARG (iter->t, iter->i); iter->i++; return result; } /* Initialize the abstract argument list iterator object ITER, then advance past and return the first argument. Useful in for expressions, e.g. for (arg = first_call_expr_arg (exp, &iter); arg; arg = next_call_expr_arg (&iter)) */ static inline tree first_call_expr_arg (tree exp, call_expr_arg_iterator *iter) { init_call_expr_arg_iterator (exp, iter); return next_call_expr_arg (iter); } static inline const_tree first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter) { init_const_call_expr_arg_iterator (exp, iter); return next_const_call_expr_arg (iter); } /* Test whether there are more arguments in abstract argument list iterator ITER, without changing its state. */ static inline bool more_call_expr_args_p (const call_expr_arg_iterator *iter) { return (iter->i < iter->n); } /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER (of type call_expr_arg_iterator) to hold the iteration state. */ #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \ for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \ (arg) = next_call_expr_arg (&(iter))) #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \ for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \ (arg) = next_const_call_expr_arg (&(iter))) /* Return true if tree node T is a language-specific node. */ static inline bool is_lang_specific (tree t) { return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES; } /* Valid builtin number. */ #define BUILTIN_VALID_P(FNCODE) \ (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1)) /* Return the tree node for an explicit standard builtin function or NULL. */ static inline tree builtin_decl_explicit (enum built_in_function fncode) { gcc_checking_assert (BUILTIN_VALID_P (fncode)); return builtin_info[(size_t)fncode].decl; } /* Return the tree node for an implicit builtin function or NULL. */ static inline tree builtin_decl_implicit (enum built_in_function fncode) { size_t uns_fncode = (size_t)fncode; gcc_checking_assert (BUILTIN_VALID_P (fncode)); if (!builtin_info[uns_fncode].implicit_p) return NULL_TREE; return builtin_info[uns_fncode].decl; } /* Set explicit builtin function nodes and whether it is an implicit function. */ static inline void set_builtin_decl (enum built_in_function fncode, tree decl, bool implicit_p) { size_t ufncode = (size_t)fncode; gcc_checking_assert (BUILTIN_VALID_P (fncode) && (decl != NULL_TREE || !implicit_p)); builtin_info[ufncode].decl = decl; builtin_info[ufncode].implicit_p = implicit_p; builtin_info[ufncode].declared_p = false; } /* Set the implicit flag for a builtin function. */ static inline void set_builtin_decl_implicit_p (enum built_in_function fncode, bool implicit_p) { size_t uns_fncode = (size_t)fncode; gcc_checking_assert (BUILTIN_VALID_P (fncode) && builtin_info[uns_fncode].decl != NULL_TREE); builtin_info[uns_fncode].implicit_p = implicit_p; } /* Set the declared flag for a builtin function. */ static inline void set_builtin_decl_declared_p (enum built_in_function fncode, bool declared_p) { size_t uns_fncode = (size_t)fncode; gcc_checking_assert (BUILTIN_VALID_P (fncode) && builtin_info[uns_fncode].decl != NULL_TREE); builtin_info[uns_fncode].declared_p = declared_p; } /* Return whether the standard builtin function can be used as an explicit function. */ static inline bool builtin_decl_explicit_p (enum built_in_function fncode) { gcc_checking_assert (BUILTIN_VALID_P (fncode)); return (builtin_info[(size_t)fncode].decl != NULL_TREE); } /* Return whether the standard builtin function can be used implicitly. */ static inline bool builtin_decl_implicit_p (enum built_in_function fncode) { size_t uns_fncode = (size_t)fncode; gcc_checking_assert (BUILTIN_VALID_P (fncode)); return (builtin_info[uns_fncode].decl != NULL_TREE && builtin_info[uns_fncode].implicit_p); } /* Return whether the standard builtin function was declared. */ static inline bool builtin_decl_declared_p (enum built_in_function fncode) { size_t uns_fncode = (size_t)fncode; gcc_checking_assert (BUILTIN_VALID_P (fncode)); return (builtin_info[uns_fncode].decl != NULL_TREE && builtin_info[uns_fncode].declared_p); } /* Return true if T (assumed to be a DECL) is a global variable. A variable is considered global if its storage is not automatic. */ static inline bool is_global_var (const_tree t) { return (TREE_STATIC (t) || DECL_EXTERNAL (t)); } /* Return true if VAR may be aliased. A variable is considered as maybe aliased if it has its address taken by the local TU or possibly by another TU and might be modified through a pointer. */ static inline bool may_be_aliased (const_tree var) { return (TREE_CODE (var) != CONST_DECL && (TREE_PUBLIC (var) || DECL_EXTERNAL (var) || TREE_ADDRESSABLE (var)) && !((TREE_STATIC (var) || TREE_PUBLIC (var) || DECL_EXTERNAL (var)) && ((TREE_READONLY (var) && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var))) || (TREE_CODE (var) == VAR_DECL && DECL_NONALIASED (var))))); } /* Return pointer to optimization flags of FNDECL. */ static inline struct cl_optimization * opts_for_fn (const_tree fndecl) { tree fn_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl); if (fn_opts == NULL_TREE) fn_opts = optimization_default_node; return TREE_OPTIMIZATION (fn_opts); } /* Return pointer to target flags of FNDECL. */ static inline cl_target_option * target_opts_for_fn (const_tree fndecl) { tree fn_opts = DECL_FUNCTION_SPECIFIC_TARGET (fndecl); if (fn_opts == NULL_TREE) fn_opts = target_option_default_node; return fn_opts == NULL_TREE ? NULL : TREE_TARGET_OPTION (fn_opts); } /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is the optimization level of function fndecl. */ #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt) /* For anonymous aggregate types, we need some sort of name to hold on to. In practice, this should not appear, but it should not be harmful if it does. */ #ifndef NO_DOT_IN_LABEL #define ANON_AGGRNAME_FORMAT "._%d" #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '.' \ && IDENTIFIER_POINTER (ID_NODE)[1] == '_') #else /* NO_DOT_IN_LABEL */ #ifndef NO_DOLLAR_IN_LABEL #define ANON_AGGRNAME_FORMAT "$_%d" #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '$' \ && IDENTIFIER_POINTER (ID_NODE)[1] == '_') #else /* NO_DOLLAR_IN_LABEL */ #define ANON_AGGRNAME_PREFIX "__anon_" #define ANON_AGGRNAME_P(ID_NODE) \ (!strncmp (IDENTIFIER_POINTER (ID_NODE), ANON_AGGRNAME_PREFIX, \ sizeof (ANON_AGGRNAME_PREFIX) - 1)) #define ANON_AGGRNAME_FORMAT "__anon_%d" #endif /* NO_DOLLAR_IN_LABEL */ #endif /* NO_DOT_IN_LABEL */ /* The tree and const_tree overload templates. */ namespace wi { template <> struct int_traits <const_tree> { static const enum precision_type precision_type = VAR_PRECISION; static const bool host_dependent_precision = false; static const bool is_sign_extended = false; static unsigned int get_precision (const_tree); static wi::storage_ref decompose (HOST_WIDE_INT *, unsigned int, const_tree); }; template <> struct int_traits <tree> : public int_traits <const_tree> {}; template <int N> class extended_tree { private: const_tree m_t; public: extended_tree (const_tree); unsigned int get_precision () const; const HOST_WIDE_INT *get_val () const; unsigned int get_len () const; }; template <int N> struct int_traits <extended_tree <N> > { static const enum precision_type precision_type = CONST_PRECISION; static const bool host_dependent_precision = false; static const bool is_sign_extended = true; static const unsigned int precision = N; }; generic_wide_int <extended_tree <WIDE_INT_MAX_PRECISION> > to_widest (const_tree); generic_wide_int <extended_tree <ADDR_MAX_PRECISION> > to_offset (const_tree); } inline unsigned int wi::int_traits <const_tree>::get_precision (const_tree tcst) { return TYPE_PRECISION (TREE_TYPE (tcst)); } /* Convert the tree_cst X into a wide_int of PRECISION. */ inline wi::storage_ref wi::int_traits <const_tree>::decompose (HOST_WIDE_INT *, unsigned int precision, const_tree x) { return wi::storage_ref (&TREE_INT_CST_ELT (x, 0), TREE_INT_CST_NUNITS (x), precision); } inline generic_wide_int <wi::extended_tree <WIDE_INT_MAX_PRECISION> > wi::to_widest (const_tree t) { return t; } inline generic_wide_int <wi::extended_tree <ADDR_MAX_PRECISION> > wi::to_offset (const_tree t) { return t; } template <int N> inline wi::extended_tree <N>::extended_tree (const_tree t) : m_t (t) { gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t)) <= N); } template <int N> inline unsigned int wi::extended_tree <N>::get_precision () const { return N; } template <int N> inline const HOST_WIDE_INT * wi::extended_tree <N>::get_val () const { return &TREE_INT_CST_ELT (m_t, 0); } template <int N> inline unsigned int wi::extended_tree <N>::get_len () const { if (N == ADDR_MAX_PRECISION) return TREE_INT_CST_OFFSET_NUNITS (m_t); else if (N >= WIDE_INT_MAX_PRECISION) return TREE_INT_CST_EXT_NUNITS (m_t); else /* This class is designed to be used for specific output precisions and needs to be as fast as possible, so there is no fallback for other casees. */ gcc_unreachable (); } namespace wi { template <typename T> bool fits_to_tree_p (const T &x, const_tree); wide_int min_value (const_tree); wide_int max_value (const_tree); wide_int from_mpz (const_tree, mpz_t, bool); } template <typename T> bool wi::fits_to_tree_p (const T &x, const_tree type) { if (TYPE_SIGN (type) == UNSIGNED) return eq_p (x, zext (x, TYPE_PRECISION (type))); else return eq_p (x, sext (x, TYPE_PRECISION (type))); } /* Produce the smallest number that is represented in TYPE. The precision and sign are taken from TYPE. */ inline wide_int wi::min_value (const_tree type) { return min_value (TYPE_PRECISION (type), TYPE_SIGN (type)); } /* Produce the largest number that is represented in TYPE. The precision and sign are taken from TYPE. */ inline wide_int wi::max_value (const_tree type) { return max_value (TYPE_PRECISION (type), TYPE_SIGN (type)); } /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2, extending both according to their respective TYPE_SIGNs. */ inline bool tree_int_cst_lt (const_tree t1, const_tree t2) { return wi::lts_p (wi::to_widest (t1), wi::to_widest (t2)); } /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2, extending both according to their respective TYPE_SIGNs. */ inline bool tree_int_cst_le (const_tree t1, const_tree t2) { return wi::les_p (wi::to_widest (t1), wi::to_widest (t2)); } /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2 are both INTEGER_CSTs and their values are extended according to their respective TYPE_SIGNs. */ inline int tree_int_cst_compare (const_tree t1, const_tree t2) { return wi::cmps (wi::to_widest (t1), wi::to_widest (t2)); } /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h, but none of these files are allowed to be included from front ends. They should be split in two. One suitable for the FEs, the other suitable for the BE. */ /* Assign the RTX to declaration. */ extern void set_decl_rtl (tree, rtx); extern bool complete_ctor_at_level_p (const_tree, HOST_WIDE_INT, const_tree); /* Return a tree representing the upper bound of the array mentioned in EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */ extern tree array_ref_up_bound (tree); extern tree build_personality_function (const char *); /* Given an expression EXP that is a handled_component_p, look for the ultimate containing object, which is returned and specify the access position and size. */ extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *, tree *, machine_mode *, int *, int *, bool); /* Return a tree representing the lower bound of the array mentioned in EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */ extern tree array_ref_low_bound (tree); struct GTY(()) int_n_trees_t { /* These parts are initialized at runtime */ tree signed_type; tree unsigned_type; }; /* This is also in machmode.h */ extern bool int_n_enabled_p[NUM_INT_N_ENTS]; extern GTY(()) struct int_n_trees_t int_n_trees[NUM_INT_N_ENTS]; /* Like bit_position, but return as an integer. It must be representable in that way (since it could be a signed value, we don't have the option of returning -1 like int_size_in_byte can. */ inline HOST_WIDE_INT int_bit_position (const_tree field) { return (wi::lshift (wi::to_offset (DECL_FIELD_OFFSET (field)), BITS_PER_UNIT_LOG) + wi::to_offset (DECL_FIELD_BIT_OFFSET (field))).to_shwi (); } extern void gt_ggc_mx (tree &); extern void gt_pch_nx (tree &); extern void gt_pch_nx (tree &, gt_pointer_operator, void *); /* Return true if it makes sense to promote/demote from_type to to_type. */ inline bool desired_pro_or_demotion_p (const_tree to_type, const_tree from_type) { unsigned int to_type_precision = TYPE_PRECISION (to_type); /* OK to promote if to_type is no bigger than word_mode. */ if (to_type_precision <= GET_MODE_PRECISION (word_mode)) return true; /* Otherwise, allow only if narrowing or same precision conversions. */ return to_type_precision <= TYPE_PRECISION (from_type); } #endif /* GCC_TREE_H */

[ "warren.xia@robobloq.com" ]

warren.xia@robobloq.com

7d2d07aef39a8ef6ab6f55210a86e5f04dc5c1d0

1740d2e58ad2105855460437f351677b69baab55

/FiniteStateMachine_DesignPattern/Jumping.h

c55e83c26a6a40e91fdcc6a646f1a0e9a158bdeb

[]

no_license

StartkaCZ/FMS

9eeeac31cd510630eecc9f57079e6394406fdd59

3365118e5eaa6858ffc4bd09a55a7213105ed415

refs/heads/master

2021-01-11T16:33:17.678506

2017-02-02T13:13:22

80,107,590

0

null

UTF-8

C++

false

143

h

#pragma once #include "State.h" class Jumping : public State { public: Jumping(); ~Jumping(); void idle(Animation* a) override; };

[ "liborzachoval@gmail.com" ]

liborzachoval@gmail.com

44008dc50923a5c561b6abfb8e464e4335aa756f

bb59806476b9657eddda932a3a0e21388c43fba9

/aoj/11/1179.cpp

df9d110dccab2f4c9ae9c7d7df2e1a590ac7120a

[]

no_license

atri-konami/kyo-pro

b0d53b196e0526774816df2aeb6f4c0a7fbc4745

bf72a14da29828a29a5e59d2582f1e27ee65d545

refs/heads/master

2020-07-16T19:08:16.163064

2019-09-02T12:09:38

205,849,043

0

null

UTF-8

C++

false

2,228

cpp

/* vim:set foldmethod=marker: */ #include <bits/stdc++.h> using namespace std; //{{{ #define all(x) (x).begin(),(x).end() #define REP(i,a,b) for(int i=(int)(a); i<(int)(b); i++) #define RREP(i,a,b) for(int i=(int)(a); i>=b; i--) #define rep(i,n) REP(i,0,n) #define rrep(i,n) RREP(i,n,0) #define pb(x) push_back(x) #define mp(x,y) make_pair((x),(y)) typedef long long ll; typedef unsigned long long ull; typedef pair<int,int> pii; typedef vector<int> vi; typedef vector<pii> vp; #define dump(x) (cerr << #x << "=" << x << endl) template<class T> ostream& osContainer(ostream& os,T c) { os<<'[';for(decltype(c.begin()) it=c.begin();it!=c.end();it++)os<<*it<<',';os<<']';return os; } template<class T> ostream& operator<<(ostream& os,const vector<T>& v) { return osContainer(os,v); } template<class T> ostream& operator<<(ostream& os,const set<T>& s) { return osContainer(os,s); } template<class T> ostream& operator<<(ostream& os,const multiset<T>& s) { return osContainer(os,s); } template<class T,class S> ostream& operator<<(ostream& os,const map<T,S>& m) { return osContainer(os,m); } template<class T,class S> ostream& operator<<(ostream& os,const multimap<T,S>& m) { return osContainer(os,m); } template<class T1,class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& p){ os << '(' << p.first << ',' << p.second << ')'; return os; } const int dx[] = {0,1,0,-1}; const int dy[] = {1,0,-1,0}; //}}} // const int Y = 1000; const int Y1 = 20 * 10; const int Y2 = 20 * 5 + 19 * 5; void solve() { int n; cin >> n; rep(i, n) { int y, m, d; cin >> y >> m >> d; int cnt = 1; if (y % 3) { cnt += (m & 1 ? 20 : 19) - d; } else { cnt += 20 - d; } REP(j, m + 1, 10 + 1) { if (y % 3) { cnt += (j & 1 ? 20 : 19); } else { cnt += 20; } } REP(j, y + 1, Y) { if (j % 3) { cnt += Y2; } else { cnt += Y1; } } cout << cnt << endl; } } int main(){ cin.tie(0); ios::sync_with_stdio(false); cout.setf(ios::fixed); cout.precision(12); solve(); }

[ "freude1994@gmail.com" ]

freude1994@gmail.com

46c074d5c57433247af473111bea36fccbeb52f9

3243d4dc666d1ee466329af5e79156c6e4d03e5e

/base/Equipment.hpp

f75ddd4a9af3e555d98d1f32e7ee3455fcdbeb53

[]

no_license

deskid/AIGame

0ad9390df97ab126bb96b72aff85ccc666315f4c

d6fc9fc19b8318739058ebaf86384f08a299a9b9

refs/heads/master

2020-04-08T15:20:36.068198

2013-11-04T04:53:27

null

0

null

UTF-8

C++

false

990

hpp

#ifndef EQUIPMENT_HPP_ #define EQUIPMENT_HPP_ #include "FighterAttribute.hpp" #include "util/ProtoInstance.hpp" #include "id_object.hpp" #include <string> namespace AIGame { /** * this is the class defines equipments * an equipment is an item hold by Fighter to enhance there fighting attributes * <strong>this is a special class. Which holds all different equips in a pool, * and users only get the pointer to pool, not holding a resource itself! * </strong> * * DO NOT MIX EquipmentPrototype UP with Equipment! */ struct EquipmentPrototype : public id_object { std::string name; // name of the equipment FightingAttribute attr; // modification made by Equipment to attributes money_type cost; // cost of equipment public: EquipmentPrototype(const std::string& name, const FightingAttribute& attr, money_type cost) :name(name), attr(attr), cost(cost) {} }; // Equipments typedef ProtoInstance<EquipmentPrototype> Equipment ; } // AIGame #endif // EQUIPMENT_HPP_

[ "ownesss@gmail.com" ]

ownesss@gmail.com

14383980301fa16cdd147e2ef0924095790e263c

6b550d3d0b182bcddda1f0a175d6b6cd07b60fb3

/logdevice/common/StickyCopySetManager.cpp

39a4426f3d2de5c71f321ed0ec929da55b166c5a

[ "BSD-3-Clause" ]

permissive

Rachelmorrell/LogDevice

5bd04f7ab0bdf9cc6e5b2da4a4b51210cdc9a4c8

3a8d800033fada47d878b64533afdf41dc79e057

refs/heads/master

2021-06-24T09:10:20.240011

2020-04-21T14:10:52

2020-04-21T14:13:09

157,563,026

1

0

NOASSERTION

2020-04-21T19:20:55

2018-11-14T14:43:33

C++

UTF-8

C++

false

8,443

cpp

/** * Copyright (c) 2017-present, Facebook, Inc. and its affiliates. * All rights reserved. * * This source code is licensed under the BSD-style license found in the * LICENSE file in the root directory of this source tree. */ #include "logdevice/common/StickyCopySetManager.h" #include <shared_mutex> #include <folly/Memory.h> #include "logdevice/common/debug.h" namespace facebook { namespace logdevice { using NodeStatus = NodeAvailabilityChecker::NodeStatus; CopySetSelector::Result StickyCopySetManager::getCopySet(copyset_size_t extras, StoreChainLink copyset_out[], copyset_size_t* copyset_size_out, bool* chain_out, const AppendContext& append_ctx, folly::Optional<lsn_t>& block_starting_lsn_out, CopySetManager::State& csm_state) { ld_check(copyset_out != nullptr); ld_check(copyset_size_out != nullptr); State& state = checked_downcast<State&>(csm_state); std::shared_lock<folly::SharedMutex> lock(mutex_); size_t invalid_block_seq_no = 0; // returns true if we have to change the copyset auto block_invalid = [&, this]() { return (invalid_block_seq_no == block_seq_no_) || shouldStartNewBlock(state, extras); }; do { // For out-of-block records, we use the current block's copyset anyway. We // will store these as single records though. It's OK for old records to // cause us to start new blocks, as this will only happen if the current // copyset is gone bad. if (block_invalid()) { lock.unlock(); std::unique_lock<folly::SharedMutex> u_lock(mutex_); // Re-checking the state after relock if (block_invalid()) { // trying to start a new block if (!startNewBlock(state, append_ctx, extras, chain_out)) { return CopySetSelector::Result::FAILED; } } u_lock.unlock(); lock.lock(); } ld_check(copyset_.size() > 0); // We assume that the underlying copyset selector checks node availability // on the copyset too, before issuing it to use with a positive result. // Thus, the following check is only here to detect changes between calls // to the copyset selector and should not turn this into an endless loop. if (!checkAndOutputNodes(copyset_out, copyset_size_out, chain_out)) { invalid_block_seq_no = block_seq_no_; } } while (invalid_block_seq_no == block_seq_no_); if (send_block_records_ && append_ctx.lsn >= current_block_starting_lsn_) { // This record is part of a block with this starting LSN block_starting_lsn_out.assign(current_block_starting_lsn_); } else { // This is a single (out-of-block) record block_starting_lsn_out.assign(LSN_INVALID); } onCopySetAssigned(state, append_ctx); ld_check(current_block_css_result_ == CopySetSelector::Result::PARTIAL || current_block_css_result_ == CopySetSelector::Result::SUCCESS); return current_block_css_result_; } CopySetSelector::Result StickyCopySetManager::getCopysetUsingUnderlyingSelector( logid_t log_id, copyset_size_t extras, StoreChainLink copyset_out[], copyset_size_t* copyset_size_out) { ld_check(copyset_out != nullptr); ld_check(copyset_size_out != nullptr); std::shared_lock<folly::SharedMutex> lock(mutex_); auto result = underlying_selector_->select(extras, copyset_out, copyset_size_out); lock.unlock(); if (result == CopySetSelector::Result::FAILED) { RATELIMIT_ERROR( std::chrono::seconds(1), 1, "Underlying copyset selector failed to pick a copyset for log:%lu", log_id.val_); return result; } ld_check(*copyset_size_out > 0); return result; } bool StickyCopySetManager::checkAndOutputNodes(StoreChainLink copyset_out[], copyset_size_t* copyset_size_out, bool* chain_out) const { bool local_chain_out = (chain_out ? *chain_out : false); copyset_size_t offset = 0; for (auto shard : copyset_) { StoreChainLink destination; auto node_status = deps_->getNodeAvailability()->checkNode( nodeset_state_.get(), shard, &destination); switch (node_status) { case NodeStatus::AVAILABLE_NOCHAIN: local_chain_out = false; break; case NodeStatus::AVAILABLE: break; case NodeStatus::NOT_AVAILABLE: return false; } // we might write an incomplete copyset here, but that's okay, as we won't // set copyset_size_out if we fail copyset_out[offset++] = destination; } *copyset_size_out = offset; if (chain_out) { *chain_out = local_chain_out; } return true; }; bool StickyCopySetManager::shouldStartNewBlock(const State& state, copyset_size_t extras) const { if (current_block_starting_lsn_ == LSN_INVALID) { // we should start a new block if we don't have a copyset return true; } // We have to regenerate the copysets if the size of the copyset changes if (extras != extras_) { return true; } // In a single-copyset scenario we are changing the copyset with every // block. // TODO: consider not doing that for a multiple-copyset scenario? if (current_block_bytes_written_ >= block_size_threshold_) { return true; } // Start a new block if the current one has expired if (current_block_expiration_ < std::chrono::steady_clock::now()) { return true; } if (state.last_tried_block_seq_no == block_seq_no_) { // We tried this copyset already, it failed. // TODO: should we retry to any of the copysets we already tried before // breaking the block? return true; } return false; } bool StickyCopySetManager::startNewBlock(State& csm_state, const AppendContext& /*append_ctx*/, copyset_size_t extras, bool* chain_out) { StoreChainLink copyset[COPYSET_SIZE_MAX]; copyset_size_t size = 0; auto result = underlying_selector_->select( extras, copyset, &size, chain_out, csm_state.css_state.get()); if (result == CopySetSelector::Result::FAILED) { return false; } shuffleCopySet(copyset, size, chain_out ? *chain_out : false); copyset_.clear(); for (size_t i = 0; i < size; ++i) { copyset_.push_back(copyset[i].destination); } extras_ = extras; ++block_seq_no_; lsn_t max_lsn = max_lsn_seen_.load(); // Since this is happening under a lock, // no one will modify this while we are // here. current_block_starting_lsn_ = max_lsn + 1; current_block_bytes_written_ = 0; current_block_expiration_ = std::chrono::steady_clock::now() + block_time_threshold_; current_block_css_result_ = result; return true; } void StickyCopySetManager::onCopySetAssigned(State& state, const AppendContext& append_ctx) { // Lots of records being written in parallel might lead to the block // extending past the threshold, but we are not too concerned about that. current_block_bytes_written_ += append_ctx.payload_size; // storing the current LSN as the max if it's larger than what we've seen // already atomic_fetch_max(max_lsn_seen_, append_ctx.lsn); // Updating the state so we know whether to change to a new block if this // wave fails state.last_tried_block_seq_no = block_seq_no_; } // see docblock in CopySetSelector::createState() std::unique_ptr<CopySetManager::State> StickyCopySetManager::createState() const { return std::make_unique<StickyCopySetManager::State>( underlying_selector_->createState()); } StickyCopySetManager::StickyCopySetManager( std::unique_ptr<CopySetSelector> selector, std::shared_ptr<NodeSetState> nodeset_state, size_t sticky_copysets_block_size, std::chrono::milliseconds sticky_copysets_block_max_time, const CopySetSelectorDependencies* deps) : CopySetManager(std::move(selector), nodeset_state), block_size_threshold_(sticky_copysets_block_size), block_time_threshold_(sticky_copysets_block_max_time), deps_(deps) {} }} // namespace facebook::logdevice

[ "facebook-github-bot@users.noreply.github.com" ]

facebook-github-bot@users.noreply.github.com

f43529236a8a335a6a0317abc6104f6f236fc087

975ed616b7a8e4a0016a0d12135a7daf17553bc3

/lua/src/loslib.c

20359b24747cc3b577d9b10f9cfb33c97a0dedd6

[ "Zlib", "CC0-1.0" ]

permissive

libretro/gw-libretro

a667af4b05db9f8fbe3f30506cc59ceb932947a8

0ecff52b11c327af52b22ea94b268c90472b6732

refs/heads/master

2023-06-07T20:44:02.339907

2023-05-28T04:01:25

31,514,379

38

49

Zlib

2023-05-28T04:01:26

2015-03-01T23:02:16

C

UTF-8

C++

false

8,701

c

/* ** $Id: loslib.c,v 1.54 2014/12/26 14:46:07 roberto Exp $ ** Standard Operating System library ** See Copyright Notice in lua.h */ #define loslib_c #define LUA_LIB #include "lprefix.h" #include <errno.h> #include <locale.h> #include <stdlib.h> #include <string.h> #include <time.h> #include "lua.h" #include "lauxlib.h" #include "lualib.h" #if !defined(LUA_STRFTIMEOPTIONS) /* { */ /* ** list of valid conversion specifiers for the 'strftime' function */ #if defined(LUA_USE_C89) #define LUA_STRFTIMEOPTIONS { "aAbBcdHIjmMpSUwWxXyYz%", "" } #else /* C99 specification */ #define LUA_STRFTIMEOPTIONS \ { "aAbBcCdDeFgGhHIjmMnprRStTuUVwWxXyYzZ%", "", \ "E", "cCxXyY", \ "O", "deHImMSuUVwWy" } #endif #endif /* } */ #if !defined(l_time_t) /* { */ /* ** type to represent time_t in Lua */ #define l_timet lua_Integer #define l_pushtime(L,t) lua_pushinteger(L,(lua_Integer)(t)) #define l_checktime(L,a) ((time_t)luaL_checkinteger(L,a)) #endif /* } */ #if !defined(lua_tmpnam) /* { */ /* ** By default, Lua uses tmpnam except when POSIX is available, where it ** uses mkstemp. */ #if defined(LUA_USE_POSIX) /* { */ #include <unistd.h> #define LUA_TMPNAMBUFSIZE 32 #if !defined(LUA_TMPNAMTEMPLATE) #define LUA_TMPNAMTEMPLATE "/tmp/lua_XXXXXX" #endif #define lua_tmpnam(b,e) { \ strcpy(b, LUA_TMPNAMTEMPLATE); \ e = mkstemp(b); \ if (e != -1) close(e); \ e = (e == -1); } #else /* }{ */ /* ISO C definitions */ #define LUA_TMPNAMBUFSIZE L_tmpnam #define lua_tmpnam(b,e) { e = (tmpnam(b) == NULL); } #endif /* } */ #endif /* } */ #if !defined(l_gmtime) /* { */ /* ** By default, Lua uses gmtime/localtime, except when POSIX is available, ** where it uses gmtime_r/localtime_r */ #if defined(LUA_USE_POSIX) /* { */ #define l_gmtime(t,r) gmtime_r(t,r) #define l_localtime(t,r) localtime_r(t,r) #else /* }{ */ /* ISO C definitions */ #define l_gmtime(t,r) ((void)(r)->tm_sec, gmtime(t)) #define l_localtime(t,r) ((void)(r)->tm_sec, localtime(t)) #endif /* } */ #endif /* } */ static int os_execute (lua_State *L) { const char *cmd = luaL_optstring(L, 1, NULL); int stat = system(cmd); if (cmd != NULL) return luaL_execresult(L, stat); else { lua_pushboolean(L, stat); /* true if there is a shell */ return 1; } } static int os_remove (lua_State *L) { const char *filename = luaL_checkstring(L, 1); return luaL_fileresult(L, remove(filename) == 0, filename); } static int os_rename (lua_State *L) { const char *fromname = luaL_checkstring(L, 1); const char *toname = luaL_checkstring(L, 2); return luaL_fileresult(L, rename(fromname, toname) == 0, NULL); } static int os_tmpname (lua_State *L) { char buff[LUA_TMPNAMBUFSIZE]; int err; lua_tmpnam(buff, err); if (err) return luaL_error(L, "unable to generate a unique filename"); lua_pushstring(L, buff); return 1; } static int os_getenv (lua_State *L) { lua_pushstring(L, getenv(luaL_checkstring(L, 1))); /* if NULL push nil */ return 1; } static int os_clock (lua_State *L) { lua_pushnumber(L, ((lua_Number)clock())/(lua_Number)CLOCKS_PER_SEC); return 1; } /* ** {====================================================== ** Time/Date operations ** { year=%Y, month=%m, day=%d, hour=%H, min=%M, sec=%S, ** wday=%w+1, yday=%j, isdst=? } ** ======================================================= */ static void setfield (lua_State *L, const char *key, int value) { lua_pushinteger(L, value); lua_setfield(L, -2, key); } static void setboolfield (lua_State *L, const char *key, int value) { if (value < 0) /* undefined? */ return; /* does not set field */ lua_pushboolean(L, value); lua_setfield(L, -2, key); } static int getboolfield (lua_State *L, const char *key) { int res; res = (lua_getfield(L, -1, key) == LUA_TNIL) ? -1 : lua_toboolean(L, -1); lua_pop(L, 1); return res; } static int getfield (lua_State *L, const char *key, int d) { int res, isnum; lua_getfield(L, -1, key); res = (int)lua_tointegerx(L, -1, &isnum); if (!isnum) { if (d < 0) return luaL_error(L, "field '%s' missing in date table", key); res = d; } lua_pop(L, 1); return res; } static const char *checkoption (lua_State *L, const char *conv, char *buff) { static const char *const options[] = LUA_STRFTIMEOPTIONS; unsigned int i; for (i = 0; i < sizeof(options)/sizeof(options[0]); i += 2) { if (*conv != '\0' && strchr(options[i], *conv) != NULL) { buff[1] = *conv; if (*options[i + 1] == '\0') { /* one-char conversion specifier? */ buff[2] = '\0'; /* end buffer */ return conv + 1; } else if (*(conv + 1) != '\0' && strchr(options[i + 1], *(conv + 1)) != NULL) { buff[2] = *(conv + 1); /* valid two-char conversion specifier */ buff[3] = '\0'; /* end buffer */ return conv + 2; } } } luaL_argerror(L, 1, lua_pushfstring(L, "invalid conversion specifier '%%%s'", conv)); return conv; /* to avoid warnings */ } static int os_date (lua_State *L) { const char *s = luaL_optstring(L, 1, "%c"); time_t t = luaL_opt(L, l_checktime, 2, time(NULL)); struct tm tmr, *stm; if (*s == '!') { /* UTC? */ stm = l_gmtime(&t, &tmr); s++; /* skip '!' */ } else stm = l_localtime(&t, &tmr); if (stm == NULL) /* invalid date? */ lua_pushnil(L); else if (strcmp(s, "*t") == 0) { lua_createtable(L, 0, 9); /* 9 = number of fields */ setfield(L, "sec", stm->tm_sec); setfield(L, "min", stm->tm_min); setfield(L, "hour", stm->tm_hour); setfield(L, "day", stm->tm_mday); setfield(L, "month", stm->tm_mon+1); setfield(L, "year", stm->tm_year+1900); setfield(L, "wday", stm->tm_wday+1); setfield(L, "yday", stm->tm_yday+1); setboolfield(L, "isdst", stm->tm_isdst); } else { char cc[4]; luaL_Buffer b; cc[0] = '%'; luaL_buffinit(L, &b); while (*s) { if (*s != '%') /* no conversion specifier? */ luaL_addchar(&b, *s++); else { size_t reslen; char buff[200]; /* should be big enough for any conversion result */ s = checkoption(L, s + 1, cc); reslen = strftime(buff, sizeof(buff), cc, stm); luaL_addlstring(&b, buff, reslen); } } luaL_pushresult(&b); } return 1; } static int os_time (lua_State *L) { time_t t; if (lua_isnoneornil(L, 1)) /* called without args? */ t = time(NULL); /* get current time */ else { struct tm ts; luaL_checktype(L, 1, LUA_TTABLE); lua_settop(L, 1); /* make sure table is at the top */ ts.tm_sec = getfield(L, "sec", 0); ts.tm_min = getfield(L, "min", 0); ts.tm_hour = getfield(L, "hour", 12); ts.tm_mday = getfield(L, "day", -1); ts.tm_mon = getfield(L, "month", -1) - 1; ts.tm_year = getfield(L, "year", -1) - 1900; ts.tm_isdst = getboolfield(L, "isdst"); t = mktime(&ts); } if (t != (time_t)(l_timet)t) luaL_error(L, "time result cannot be represented in this Lua instalation"); else if (t == (time_t)(-1)) lua_pushnil(L); else l_pushtime(L, t); return 1; } static int os_difftime (lua_State *L) { double res = difftime((l_checktime(L, 1)), (l_checktime(L, 2))); lua_pushnumber(L, (lua_Number)res); return 1; } /* }====================================================== */ static int os_setlocale (lua_State *L) { static const int cat[] = {LC_ALL, LC_COLLATE, LC_CTYPE, LC_MONETARY, LC_NUMERIC, LC_TIME}; static const char *const catnames[] = {"all", "collate", "ctype", "monetary", "numeric", "time", NULL}; const char *l = luaL_optstring(L, 1, NULL); int op = luaL_checkoption(L, 2, "all", catnames); lua_pushstring(L, setlocale(cat[op], l)); return 1; } static int os_exit (lua_State *L) { int status; if (lua_isboolean(L, 1)) status = (lua_toboolean(L, 1) ? EXIT_SUCCESS : EXIT_FAILURE); else status = (int)luaL_optinteger(L, 1, EXIT_SUCCESS); if (lua_toboolean(L, 2)) lua_close(L); if (L) exit(status); /* 'if' to avoid warnings for unreachable 'return' */ return 0; } static const luaL_Reg syslib[] = { {"clock", os_clock}, {"date", os_date}, {"difftime", os_difftime}, {"execute", os_execute}, {"exit", os_exit}, {"getenv", os_getenv}, {"remove", os_remove}, {"rename", os_rename}, {"setlocale", os_setlocale}, {"time", os_time}, {"tmpname", os_tmpname}, {NULL, NULL} }; /* }====================================================== */ LUAMOD_API int luaopen_os (lua_State *L) { luaL_newlib(L, syslib); return 1; }

[ "andre@leiradella.com" ]

andre@leiradella.com

a33cbcc5e67ec403f6139fb5416821a505b46c12

05227d7e847bbbb6e0c7898201848c879837ad25

/RType.Common/Sources/Entities/Entity.cpp

6ffb91ee4364dd292b57190a9e9025279beba6ca

[ "MIT", "LicenseRef-scancode-unknown-license-reference" ]

permissive

Mikyan0207/RType

87aec2fd09c95e97d4b454a6fc0970cf58422342

ae3d0e4b3192577eccfb3ba55ac86bd7238e9451

refs/heads/master

2023-02-25T11:36:32.123944

2021-02-02T14:31:24

327,918,103

1

0

null

UTF-8

C++

false

1,235

cpp

#include <Entities/Entity.hpp> #include <limits> Entity::Entity() : m_Id(std::numeric_limits<std::size_t>::max()) { } Entity::Entity(const std::size_t& id) : m_Id(id) { } Entity::Entity(const Entity& e) { m_Id = e.m_Id; m_Components = e.m_Components; } Entity::Entity(const Entity&& e) noexcept { try { m_Id = e.m_Id; m_Components = e.m_Components; } catch (...) { // @Silent } } const std::size_t& Entity::GetId() const { return m_Id; } std::size_t Entity::GetSize() const { return m_Components.size(); } const std::unordered_map<std::size_t, IComponent*, std::hash<std::size_t>, std::equal_to<>>& Entity::GetComponents() const { return m_Components; } Entity& Entity::operator=(const Entity& e) { if (this == &e) return *this; m_Id = e.m_Id; m_Components = e.m_Components; return *this; } Entity& Entity::operator=(Entity&& e) noexcept { if (this == &e) return *this; try { m_Id = e.m_Id; m_Components = e.m_Components; return *this; } catch (...) { // @Silent return *this; } } void Entity::Destroy() { m_Components.clear(); } void Entity::AddComponent(IComponent* component, const std::size_t& id) { component->SetEntityId(m_Id); m_Components.emplace(id, component); }

[ "florian.theron@epitech.eu" ]

florian.theron@epitech.eu

5a4a343ea8269475d438fd8653e569119932d9d5

d110fa80f2ae305c52b449872fd93152038f8a73

/QPUIPageControl/datetimedelegatewithusecs.h

121772c1f4bcc0d52b407cc4dbc317f49bcf1510

[]

no_license

iamgeniuswei/QPlatform

6fd98dae5576a7dd85ea9800404375fa784907fe

05cba523571287f551dc20c6211203988e820be3

refs/heads/master

2020-04-06T07:12:35.796750

2016-07-22T01:12:59

56,820,817

0

null

UTF-8

C++

false

581

h

#ifndef DATETIMEDELEGATEWITHUSECS_H #define DATETIMEDELEGATEWITHUSECS_H #include <QStyledItemDelegate> #include "pagewidget_global.h" class PAGEWIDGETSHARED_EXPORT DateTimeDelegateWithUSecs : public QStyledItemDelegate { Q_OBJECT public: explicit DateTimeDelegateWithUSecs(const QString timeFormat = "yyyy.MM.dd hh:mm:ss", QObject *parent =0); void paint(QPainter *painter, const QStyleOptionViewItem &option, const QModelIndex &index) const; signals: public slots: private: QString _timeFormat; }; #endif // DATETIMEDELEGATEWITHUSECS_H

[ "iamgeniuswei@sina.com" ]

iamgeniuswei@sina.com

16af75041f2434d36318fbe9a6a2466586abecae

a7053519b6f4b1b6e998dc821b644dd57abc6320

/ZeroJudge/zoj_c294.cpp

c9ee39889a6fbe52d1acb697afabc57dd14cf53b

[]

no_license

Koios1143/Algorithm-Code-Saved

97c7360e1928bbea12307524a8562b3f1c72d89d

38706e0c08750ebdd0384534baa3226f850fb8b7

refs/heads/master

2023-02-08T00:33:56.881228

2020-12-12T05:09:16

297,377,067

0

null

UTF-8

C++

false

559

cpp

//By Koios1143 #include<bits/stdc++.h> #define LL long long #define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0); #define pii pair<int,int> using namespace std; int tri[3]; int main(){ IOS for(int i=0 ; i<3 ; i++) cin>>tri[i]; sort(tri,tri+3); cout<<tri[0]<<" "<<tri[1]<<" "<<tri[2]<<"\n"; if(tri[0]+tri[1] <= tri[2]) cout<<"No\n"; else if(pow(tri[0],2)+pow(tri[1],2) == pow(tri[2],2)) cout<<"Right\n"; else if(pow(tri[0],2)+pow(tri[1],2) < pow(tri[2],2)) cout<<"Obtuse\n"; else cout<<"Acute\n"; return 0; }

[ "ken1357924681010@gmail.com" ]

ken1357924681010@gmail.com

fc1df20c0fd09c441f657cd8b62d7a8d847937e5

f87f5c645d255ad2e5adbfdfd9fca021667157d1

/formats.cpp

afe55a2a28248671959541549245c2c03abd8f10

[]

no_license

VladislavLechner/ExecutionSumWidget

c174d7679b7a915d38fffa1565dae29a9c756379

b16632845bc25027cf767a55c30d8b44653c76f0

refs/heads/main

2023-07-09T17:06:09.045842

2021-08-17T11:01:18

393,758,804

0

null

UTF-8

C++

false

1,522

cpp

#include "formats.h" std::string Formats::currentFormat(const std::string& format) { if (format == "zip") return "Zip"; else if(format == "txt") return "ASCII text"; else if(format == "jpg") return "JPEG"; else if (format == "pdf") return "PDF"; else if (format == "run") return "ELF"; else if (format == "webp") return "RIFF"; else if (format == "png") return "PNG"; else if (format == "rar") return "RAR"; else if (format == "mp3") return "Audio file with ID3"; else if (format =="doc") return "Microsoft Word"; else if (format == "xlsx") return "Microsoft Excel"; else if (format == "") { return ""; } else { throw std::runtime_error("Неверный формат файла(ов)"); } } bool Formats::matching(const std::string& path, const std::string& inputFormat) { std::string forHex("file -b " + path + " > format.txt"); system(forHex.c_str()); std::ifstream formatFile(boost::filesystem::current_path().string() + "/format.txt"); std::string temp; if (formatFile.is_open()) { getline(formatFile,temp); formatFile.close(); } else { throw std::runtime_error("Файл format.txt не открылся"); } size_t pos = temp.find(","); if (pos < temp.size()) temp.erase(pos, temp.size()); return (temp.find(currentFormat(inputFormat)) < temp.size()); }

[ "semen.isaev@ro.ru" ]

semen.isaev@ro.ru

66985e45c5fb1135c9250f15f753ab9d9c55d4a7

090ba3fdf7418ab15cab569d7215fe7686cff4ab

/banjo/ast-hash.hpp

330545d37f887c6ef4214e8ad0b4448e5cde937e

[ "MIT" ]

permissive

NoraAl/banjo

7b7029675bf216c2f501e4874c47db6eefb64ec4

cccedc7d3a8d90dbaeea48cd17d359ca5116f0a4

refs/heads/master

2021-01-16T21:38:38.076675

2016-05-18T18:14:41

57,147,641

0

null

2016-04-26T17:18:15

null

UTF-8

C++

false

1,113

hpp

// Copyright (c) 2015-2016 Andrew Sutton // All rights reserved #ifndef BANJO_AST_HASH_HPP #define BANJO_AST_HASH_HPP // This module defines the hash function on AST nodes. // // TODO: Migrate this to use an iterative hash instead of Boost's hashing // library. It will generate better keys (although this is a big rewrite). #include "ast-base.hpp" #include "ast-eq.hpp" #include <boost/functional/hash.hpp> namespace banjo { std::size_t hash_value(Term const&); std::size_t hash_value(Name const&); std::size_t hash_value(Type const&); std::size_t hash_value(Expr const&); std::size_t hash_value(Decl const&); std::size_t hash_value(Cons const&); template<typename T> inline std::size_t hash_value(List<T> const& list) { std::size_t h = 0; for (T const& t : list) boost::hash_combine(h, t); return h; } template<typename T> struct Term_hash { bool operator()(T const* t) const { return hash_value(*t); } }; using Name_hash = Term_hash<Name>; using Type_hash = Term_hash<Type>; using Expr_hash = Term_hash<Expr>; using Cons_hash = Term_hash<Cons>; } // namespace banjo #endif

[ "andrew.n.sutton@gmail.com" ]

andrew.n.sutton@gmail.com

ae5c1688a665fa8ac79c03f7f71ffe3f3e917070

13e6453fcaeb57006ff3f53a36778e082539bcf4

/c_src/fun_bindings.cc

e9c9efe6ea3fee71a2f68109598b106b47164648

[ "MIT" ]

permissive

silviucpp/erlcass

e379bcd88da1f698131dba9b09e3b61b509cc0ab

aaf027d157f256902b2b2cc0e633a22592423c81

refs/heads/master

2023-06-27T02:05:42.392884

2023-06-15T05:42:09

36,858,111

83

39

MIT

2023-01-18T22:29:14

2015-06-04T08:30:49

Erlang

UTF-8

C++

false

3,316

cc

#include "fun_bindings.h" #include "macros.h" CassError erlcass_cass_collection_append_string_n(CassCollection* collection, size_t index, const char* value, size_t value_length) { UNUSED(index); return cass_collection_append_string_n(collection, value, value_length); } CassError erlcass_cass_collection_append_int8(CassCollection* collection, size_t index, cass_int8_t value) { UNUSED(index); return cass_collection_append_int8(collection, value); } CassError erlcass_cass_collection_append_int16(CassCollection* collection, size_t index, cass_int16_t value) { UNUSED(index); return cass_collection_append_int16(collection, value); } CassError erlcass_cass_collection_append_int32(CassCollection* collection, size_t index, cass_int32_t value) { UNUSED(index); return cass_collection_append_int32(collection, value); } CassError erlcass_cass_collection_append_int64(CassCollection* collection, size_t index, cass_int64_t value) { UNUSED(index); return cass_collection_append_int64(collection, value); } CassError erlcass_cass_collection_append_uint32(CassCollection* collection, size_t index, cass_uint32_t value) { UNUSED(index); return cass_collection_append_uint32(collection, value); } CassError erlcass_cass_collection_append_bytes(CassCollection* collection, size_t index, const cass_byte_t* value, size_t value_size) { UNUSED(index); return cass_collection_append_bytes(collection, value, value_size); } CassError erlcass_cass_collection_append_bool(CassCollection* collection, size_t index, cass_bool_t value) { UNUSED(index); return cass_collection_append_bool(collection, value); } CassError erlcass_cass_collection_append_float(CassCollection* collection, size_t index, cass_float_t value) { UNUSED(index); return cass_collection_append_float(collection, value); } CassError erlcass_cass_collection_append_double(CassCollection* collection, size_t index, cass_double_t value) { UNUSED(index); return cass_collection_append_double(collection, value); } CassError erlcass_cass_collection_append_inet(CassCollection* collection, size_t index, const CassInet& value) { UNUSED(index); return cass_collection_append_inet(collection, value); } CassError erlcass_cass_collection_append_uuid(CassCollection* collection, size_t index, CassUuid value) { UNUSED(index); return cass_collection_append_uuid(collection, value); } CassError erlcass_cass_collection_append_decimal(CassCollection* collection, size_t index, const cass_byte_t* varint, size_t varint_size, cass_int32_t scale) { UNUSED(index); return cass_collection_append_decimal(collection, varint, varint_size, scale); } CassError erlcass_cass_collection_append_collection(CassCollection* collection, size_t index, const CassCollection* value) { UNUSED(index); return cass_collection_append_collection(collection, value); } CassError erlcass_cass_collection_append_tuple(CassCollection* collection, size_t index, const CassTuple* value) { UNUSED(index); return cass_collection_append_tuple(collection, value); } CassError erlcass_cass_collection_append_user_type(CassCollection* collection, size_t index, const CassUserType* value) { UNUSED(index); return cass_collection_append_user_type(collection, value); }

[ "silviu.caragea@woowteam.com" ]

silviu.caragea@woowteam.com

d0cbcdd4666d50493ddfe5b1d798c2ef38b4ea33

2624cc24d433ddae26d707f566592bd68d4104d0

/GLBase.h

10983dd7ef8e0b406845b9de529d08d67fe85ce2

[]

no_license

gomson/glslCanvas4AE

943603a9e0ae20ad432c3e7d5593e34bd2f5d01f

3310974293937442c642867a828351e5afd1a209

refs/heads/master

2020-12-02T11:20:32.838606

2017-07-07T06:08:12

2017-07-07T09:07:39

null

0

null

UTF-8

C++

false

709

h

// // GLBase.hpp // ISF4AE // // Created by Baku Hashimoto on 2017/07/05. // // #pragma once #ifndef GL_BASE_H #define GL_BASE_H #include <OpenGL/gl3.h> #include <GLUT/GLUT.h> #include <string> namespace AESDK_OpenGL { void makeCurrentFlush(CGLContextObj newRC); NSOpenGLContext* createNSContext(NSOpenGLContext* pNSShare, CGLContextObj& rc); class SaveRestoreOGLContext { public: SaveRestoreOGLContext(); ~SaveRestoreOGLContext(); private: #ifdef AE_OS_MAC CGLContextObj o_RC; NSOpenGLContext* pNSOpenGLContext_; #endif SaveRestoreOGLContext(const SaveRestoreOGLContext &); SaveRestoreOGLContext &operator=(const SaveRestoreOGLContext &); }; }; #endif // GL_BASE_H

[ "mail@baku89.com" ]

mail@baku89.com

ab2762f9c4d5f9346346b9de9a9c9bb6d31bea1d

7de176060a61db803d19915e3db1f094fbe84539

/packages/qr/src/base/qr_in_place_base.hpp

45bf50b7675b82e9b1633812215e066146a37317

[ "BSD-3-Clause" ]

permissive

samajors/pressio

d183d65b6bef66c047037db8ff8d8c5673ec6bd7

164826bf58cb37a68b04755e3db943b4ce620a59

refs/heads/master

2022-11-15T01:37:37.046439

2020-05-11T15:27:16

null

0

null

UTF-8

C++

false

2,960

hpp

/* //@HEADER // ************************************************************************ // // qr_in_place_base.hpp // Pressio // Copyright 2019 // National Technology & Engineering Solutions of Sandia, LLC (NTESS) // // Under the terms of Contract DE-NA0003525 with NTESS, the // U.S. Government retains certain rights in this software. // // Pressio is licensed under BSD-3-Clause terms of use: // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // // 3. Neither the name of the copyright holder nor the names of its // contributors may be used to endorse or promote products derived // from this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS // FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE // COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, // INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES // (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR // SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, // STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING // IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE // POSSIBILITY OF SUCH DAMAGE. // // Questions? Contact Francesco Rizzi (fnrizzi@sandia.gov) // // ************************************************************************ //@HEADER */ #ifndef QR_BASE_IN_PLACE_BASE_HPP_ #define QR_BASE_IN_PLACE_BASE_HPP_ namespace pressio{ namespace qr{ template<typename derived_t, typename matrix_t> class QRInPlaceBase : private utils::details::CrtpBase< QRInPlaceBase<derived_t, matrix_t>> { using this_t = QRInPlaceBase<derived_t, matrix_t>; /* workaround for nvcc issue with templates, see https://devtalk.nvidia.com/default/topic/1037721/nvcc-compilation-error-with-template-parameter-as-a-friend-within-a-namespace/ */ template<typename DummyType> struct dummy{using type = DummyType;}; friend typename dummy<derived_t>::type; friend utils::details::CrtpBase<this_t>; public: void computeThin(matrix_t & A){ this->underlying().computeThinImpl(A); } private: QRInPlaceBase() = default; ~QRInPlaceBase() = default; }; }}//end namespace pressio::qr #endif

[ "fnrizzi@sandia.gov" ]

fnrizzi@sandia.gov

1d293c98cc1dcf2a23f1b6497a34392dc98e264e

6d3c2397ade13ea230cf7df97bc27f3c9b7a63dd

/Right.cpp

a6b51b8f521a9d3c47e295f2c9276414574cf902

[]

no_license

mrKust/SevenTest

0025b13ec45d6a88a2a54b8db10cb5ea91ce20f2

e2575b55302a0fda2577b816852015be8034002d

refs/heads/master

2022-11-17T21:35:04.965925

2020-07-13T13:44:36

279,382,302

0

null

2020-07-13T18:32:06

2020-07-13T18:32:05

null

UTF-8

C++

false

539

cpp

// // Created by Ivan on 10.07.2020. // #include "Right.h" Right::Right() { } Right::~Right() { } uint32_t Right::getNumID() { return numID; } std::string Right::getName() { return name; } std::string Right::getDescription() { return description; } void Right::setNumID(uint32_t numID) { this->numID = numID; } void Right::setName(std::string name) { this->name = name; } void Right::setDescription(std::string description) { this->description = description; }

[ "noreply@github.com" ]

noreply@github.com

2f8411e8e6e5feb678415db3d1656ea87483cb4c

cfeac52f970e8901871bd02d9acb7de66b9fb6b4

/generated/src/aws-cpp-sdk-resource-explorer-2/include/aws/resource-explorer-2/ResourceExplorer2ErrorMarshaller.h

305c0a23bb81e47ddaf1bc86c864da59dccf2ef9

[ "Apache-2.0", "MIT", "JSON" ]

permissive

aws/aws-sdk-cpp

aff116ddf9ca2b41e45c47dba1c2b7754935c585

9a7606a6c98e13c759032c2e920c7c64a6a35264

refs/heads/main

2023-08-25T11:16:55.982089

2023-08-24T18:14:53

35,440,404

1,681

1,133

Apache-2.0

2023-09-12T15:59:33

2015-05-11T17:57:32

null

UTF-8

C++

false

554

h

/** * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved. * SPDX-License-Identifier: Apache-2.0. */ #pragma once #include <aws/resource-explorer-2/ResourceExplorer2_EXPORTS.h> #include <aws/core/client/AWSErrorMarshaller.h> namespace Aws { namespace Client { class AWS_RESOURCEEXPLORER2_API ResourceExplorer2ErrorMarshaller : public Aws::Client::JsonErrorMarshaller { public: Aws::Client::AWSError<Aws::Client::CoreErrors> FindErrorByName(const char* exceptionName) const override; }; } // namespace Client } // namespace Aws

[ "sdavtaker@users.noreply.github.com" ]

sdavtaker@users.noreply.github.com

8ca5e65599636c50a8ca427b2e12bb01b0f99131

9e3408b7924e45aa851ade278c46a77b3a85614e

/CHIBI-Engine/Externals/boost/mpl/aux_/iter_apply.hpp

c00974b68e506eb159ee0584baffb3929bd8c34f

[]

no_license

stynosen/CHIBI-Engine

542a8670bbcd932c0fd10a6a04be3af2eb3991f4

6a1b41e94df2e807e9ce999ce955bf19bb48c8ec

refs/heads/master

2021-01-25T06:37:16.554974

2014-01-08T21:49:00

null

0

null

UTF-8

C++

false

1,010

hpp

#ifndef BOOST_MPL_ITER_APPLY_HPP_INCLUDED #define BOOST_MPL_ITER_APPLY_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2004 // // 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) // // See http://www.boost.org/libs/mpl for documentation. // $Id: iter_apply.hpp 49239 2008-10-10 09:10:26Z agurtovoy $ // $Date: 2008-10-10 11:10:26 +0200 (vr, 10 okt 2008) $ // $Revision: 49239 $ #include <boost/mpl/apply.hpp> #include <boost/mpl/deref.hpp> namespace boost { namespace mpl { namespace aux { template< typename F , typename Iterator > struct iter_apply1 : apply1< F,typename deref<Iterator>::type > { }; template< typename F , typename Iterator1 , typename Iterator2 > struct iter_apply2 : apply2< F , typename deref<Iterator1>::type , typename deref<Iterator2>::type > { }; }}} #endif // BOOST_MPL_ITER_APPLY_HPP_INCLUDED

[ "stijndoyen@hotmail.com" ]

stijndoyen@hotmail.com

23ab0993bd00906baa67633f847da0c7ae3e1af6

2f0c70013cb2e8f3815694ae75dd9b73fdf22d33

/spectrum/models/E6SSM/E6SSM_utilities.hpp

771e4657e4abb61c74d04d771b626d6c9a89d03a

[]

no_license

azedarach/E6SSM-Tuning

9d3e0fffb3fe5979b8735a2907219eb944fcfeae

62f8050e814db2e4468b868cb31bcb63ee1dbda2

refs/heads/master

2021-05-31T00:07:01.359375

2016-01-03T22:34:23

null

0

null

UTF-8

C++

false

5,551

hpp

// ==================================================================== // This file is part of FlexibleSUSY. // // FlexibleSUSY is free software: you can redistribute it and/or modify // it under the terms of the GNU General Public License as published // by the Free Software Foundation, either version 3 of the License, // or (at your option) any later version. // // FlexibleSUSY is distributed in the hope that it will be useful, but // WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU // General Public License for more details. // // You should have received a copy of the GNU General Public License // along with FlexibleSUSY. If not, see // <http://www.gnu.org/licenses/>. // ==================================================================== // File generated at Sun 15 Jun 2014 19:16:26 #ifndef E6SSM_UTILITIES_H #define E6SSM_UTILITIES_H #include "E6SSM_two_scale_model.hpp" #include "E6SSM_info.hpp" #include "wrappers.hpp" #include <Eigen/Core> #include <string> #include <vector> #include <valarray> #include <utility> #define PHYSICAL(p) model.get_physical().p #define MODELPARAMETER(p) model.get_##p() namespace flexiblesusy { class E6SSM_parameter_getter { public: Eigen::ArrayXd get_parameters(const E6SSM<Two_scale>& model) { return model.get(); } std::vector<std::string> get_parameter_names(const E6SSM<Two_scale>&) const { using namespace E6SSM_info; return std::vector<std::string>(parameter_names, parameter_names + NUMBER_OF_PARAMETERS); } }; class E6SSM_spectrum_plotter { public: E6SSM_spectrum_plotter(); ~E6SSM_spectrum_plotter() {} template <class T> void extract_spectrum(const E6SSM<T>&); void write_to_file(const std::string&) const; private: struct TParticle { std::string name; std::string latex_name; std::valarray<double> masses; TParticle(const std::string& name_, const std::string& latex_name_, const std::valarray<double>& masses_) : name(name_) , latex_name(latex_name_) , masses(masses_) {} }; typedef std::vector<TParticle> TSpectrum; TSpectrum spectrum; double scale; unsigned width; void write_spectrum(const TSpectrum&, std::ofstream&) const; static std::valarray<double> to_valarray(double); template <class Scalar, int M, int N> static std::valarray<double> to_valarray(const Eigen::Array<Scalar, M, N>&); }; template <class T> void E6SSM_spectrum_plotter::extract_spectrum(const E6SSM<T>& model) { spectrum.clear(); scale = model.get_scale(); spectrum.push_back(TParticle("Glu", "\\tilde{g}", to_valarray(PHYSICAL(MGlu)))); spectrum.push_back(TParticle("ChaP", "\\tilde{\\chi}^{'-}", to_valarray(PHYSICAL(MChaP)))); spectrum.push_back(TParticle("VZp", "{Z'}", to_valarray(PHYSICAL(MVZp)))); spectrum.push_back(TParticle("Sd", "\\tilde{d}", to_valarray(PHYSICAL(MSd)))); spectrum.push_back(TParticle("Sv", "\\tilde{\\nu}", to_valarray(PHYSICAL(MSv)))); spectrum.push_back(TParticle("Su", "\\tilde{u}", to_valarray(PHYSICAL(MSu)))); spectrum.push_back(TParticle("Se", "\\tilde{e}", to_valarray(PHYSICAL(MSe)))); spectrum.push_back(TParticle("SDX", "\\tilde{x}", to_valarray(PHYSICAL(MSDX)))); spectrum.push_back(TParticle("hh", "h", to_valarray(PHYSICAL(Mhh)))); spectrum.push_back(TParticle("Ah", "A^0", to_valarray(PHYSICAL(MAh)))); spectrum.push_back(TParticle("Hpm", "H^-", to_valarray(PHYSICAL(MHpm)))); spectrum.push_back(TParticle("Chi", "\\tilde{\\chi}^0", to_valarray(PHYSICAL(MChi)))); spectrum.push_back(TParticle("Cha", "\\tilde{\\chi}^-", to_valarray(PHYSICAL(MCha)))); spectrum.push_back(TParticle("FDX", "x", to_valarray(PHYSICAL(MFDX)))); spectrum.push_back(TParticle("SHI0", "h^{0,Inert}", to_valarray(PHYSICAL(MSHI0)))); spectrum.push_back(TParticle("SHIp", "h^{-,Inert}", to_valarray(PHYSICAL(MSHIp)))); spectrum.push_back(TParticle("ChaI", "\\tilde{\\chi}^{-,Inert}", to_valarray(PHYSICAL(MChaI)))); spectrum.push_back(TParticle("ChiI", "\\tilde{\\chi}^{0,Inert}", to_valarray(PHYSICAL(MChiI)))); spectrum.push_back(TParticle("SSI0", "s^{Inert}", to_valarray(PHYSICAL(MSSI0)))); spectrum.push_back(TParticle("FSI", "\\tilde{S}^{Inert}", to_valarray(PHYSICAL(MFSI)))); spectrum.push_back(TParticle("SHp0", "H^{'0}", to_valarray(PHYSICAL(MSHp0)))); spectrum.push_back(TParticle("SHpp", "H^{'-}", to_valarray(PHYSICAL(MSHpp)))); spectrum.push_back(TParticle("ChiP", "\\tilde{\\chi}^{'0}", to_valarray(PHYSICAL(MChiP)))); if (model.do_calculate_sm_pole_masses()) { spectrum.push_back(TParticle("Fd", "d", to_valarray(PHYSICAL(MFd)))); spectrum.push_back(TParticle("Fe", "e", to_valarray(PHYSICAL(MFe)))); spectrum.push_back(TParticle("Fu", "u", to_valarray(PHYSICAL(MFu)))); spectrum.push_back(TParticle("Fv", "\\nu", to_valarray(PHYSICAL(MFv)))); spectrum.push_back(TParticle("VG", "g", to_valarray(PHYSICAL(MVG)))); spectrum.push_back(TParticle("VP", "\\gamma", to_valarray(PHYSICAL(MVP)))); spectrum.push_back(TParticle("VWm", "W^-", to_valarray(PHYSICAL(MVWm)))); spectrum.push_back(TParticle("VZ", "Z", to_valarray(PHYSICAL(MVZ)))); } } template <class Scalar, int M, int N> std::valarray<double> E6SSM_spectrum_plotter::to_valarray(const Eigen::Array<Scalar, M, N>& v) { return std::valarray<double>(v.data(), v.size()); } } // namespace flexiblesusy #endif

[ "dylan.harries@adelaide.edu.au" ]

dylan.harries@adelaide.edu.au

5e0ef6f931c7eb27bbccf7ff3ef1241b49e2dff2

72c5f334fbb1b1d0ab0fe159df8624eb6d3ecc3f

/src/Sandbox/Models/MOMDP/StateTransitionXByFunction.h

c6d80865aa9280fb563cab12e94b0e53a4a71787

[ "Apache-2.0" ]

permissive

petercaiyoyo/appl

9cbe63403ab567bb13861ebc68435fdc4b7dcf81

545a89ff207cf1818c66da01723ca119f58b8e0b

refs/heads/master

2016-08-06T14:16:44.038983

2013-10-02T06:38:25

9,953,653

1

null

UTF-8

C++

false

938

h

#ifndef StateTransitionXByFunction_H #define StateTransitionXByFunction_H #include <vector> #include "Const.h" #include "Observations.h" #include "Actions.h" #include "States.h" #include "MathLib.h" #include "VariableRelation.h" #include "StateTransitionX.h" using namespace std; using namespace momdp; namespace momdp { class MOMDP; class StateTransitionXByFunction : public StateTransitionX { private: SharedPointer<SparseMatrix> getMatrixInner(int a, int x, bool transpose); public: StateTransitionXByFunction(void); virtual ~StateTransitionXByFunction(void); REAL_VALUE prob(States::iterator& x, States::iterator& y, Actions::iterator& a, States::iterator& xp); virtual SharedPointer<SparseMatrix> getMatrix(int a, int x); virtual SharedPointer<SparseMatrix> getMatrixTr(int a, int x); vector<SharedPointer<VariableRelation> > relations; MOMDP* problem; }; } #endif

[ "scutpetercai@gmail.com" ]

scutpetercai@gmail.com

bcc2af8fcbf078adb3725b75af92569b776aea32

2e5d6c4fc0fc425db84b0ebe52d8912200b5ae7d

/My Operating System/physical_memorymgr.cpp

5fcda4d1b45fe6cfd1888dd5258697fed1369ea7

[]

no_license

caffineehacker/My-Operating-System

b62152e4dbeb5b56a8f079c6d4217dae762e3294

b595cf26e4faf71ca0d43705741c59f69095a273

refs/heads/master

2021-06-06T10:56:51.389380

2017-08-20T00:01:59

5,132,091

1

0

null

UTF-8

C++

false

6,260

cpp

#include <cstdint> #include <cstring> #include "physical_memorymgr.h" /* Size of physical memory in KB */ static uint32_t physical_memorymgr_memory_size = 0; /* Number of physical blocks in use */ static uint32_t physical_memorymgr_used_blocks = 0; /* Max number of blocks available */ static uint32_t physical_memorymgr_max_blocks = 0; /* Block in use bitmap. We use 32-bit rather than 8-bit because this is more efficient with the process/memory */ static uint32_t* physical_memorymgr_memory_map = 0; inline void physical_memorymgr_setBlockUsed(int blockNumber) { physical_memorymgr_memory_map[blockNumber / 32] |= (1 << (blockNumber % 32)); } // Returns true if the memory changed from used to free... inline bool physical_memorymgr_setBlockFree(int blockNumber) { bool returnValue = physical_memorymgr_memory_map[blockNumber / 32] &= (1 << (blockNumber % 32)) > 0; physical_memorymgr_memory_map[blockNumber / 32] &= ~(1 << (blockNumber % 32)); return returnValue; } inline bool physical_memorymgr_isBlockUsed(int blockNumber) { return physical_memorymgr_memory_map[blockNumber / 32] & (1 << (blockNumber % 32)); } uint32_t physical_memorymgr_get_free_block_count() { return physical_memorymgr_max_blocks - physical_memorymgr_used_blocks; } uint32_t physical_memorymgr_get_used_block_count() { return physical_memorymgr_used_blocks; } uint32_t physical_memorymgr_get_block_count() { return physical_memorymgr_max_blocks; } int physical_memorymgr_firstFreeAlignedBlock(size_t alignment) { /* Find first 0'd bit */ for (uint32_t i=0; i< physical_memorymgr_max_blocks / 32; i++) { if (physical_memorymgr_memory_map[i] != 0xffffffff) { for (int j=0; j<32; j++) { /* Test each bit in the dword */ int bit = 1 << j; if (!(physical_memorymgr_memory_map[i] & bit) && ((i*32 + j + 1) % alignment) == 0) /* Verify the bit is free and aligned */ return (int)(i*32 + j); } } } return -1; } int physical_memorymgr_firstFreeBlock() { return physical_memorymgr_firstFreeAlignedBlock(1); } inline bool IsPageInUse(int pageNumber) { return physical_memorymgr_memory_map[pageNumber / 32] & (1 << (pageNumber % 32)); } int physical_memorymgr_firstFreeAlignedBlockArray(size_t size, size_t alignment) { if (size==0) return -1; if (size==1) return physical_memorymgr_firstFreeAlignedBlock(alignment); for (uint32_t i = 0; i < physical_memorymgr_get_block_count(); i++) if (physical_memorymgr_memory_map[i] != 0xffffffff) for (int j = 0; j < 32; j++) { /* Test each bit in the dword */ int bit = 1<<j; if (!(physical_memorymgr_memory_map[i] & bit) && ((i*32 + j + 1) % alignment) == 0) { int startingBit = i*32; startingBit += bit; /* Get the free bit in the dword at index i */ uint32_t free = 0; /* Loop through each bit to see if its enough space */ for (uint32_t count = 0; count <= size; count++) { if (!IsPageInUse(startingBit+count)) free++; /* This is not in use */ if (free == size) return i*32 + j; /* free count == size needed; return index */ } } } return -1; } int physical_memorymgr_firstFreeBlockArray(size_t size) { return physical_memorymgr_firstFreeAlignedBlockArray(size, 1); } void physical_memorymgr_init(size_t memSize, uint32_t bitmap) { physical_memorymgr_memory_size = memSize; physical_memorymgr_memory_map = (uint32_t*)bitmap; physical_memorymgr_max_blocks = (physical_memorymgr_memory_size*1024) / PMMNGR_BLOCK_SIZE; physical_memorymgr_used_blocks = physical_memorymgr_max_blocks; /* By default, all of memory is in use */ memset(physical_memorymgr_memory_map, 0xf, physical_memorymgr_max_blocks / PMMNGR_BLOCKS_PER_BYTE ); } void physical_memorymgr_initialize_region(uint32_t base, size_t size) { int align = base / PMMNGR_BLOCK_SIZE; int blocks = size / PMMNGR_BLOCK_SIZE; for (; blocks>0; blocks--) { /* first block is always set. This blocks using null (0) as a valid address */ if (align != 0 && physical_memorymgr_setBlockFree(align)) { physical_memorymgr_used_blocks--; } align++; } } void physical_memorymgr_deinitialize_region(uint32_t base, size_t size) { int align = base / PMMNGR_BLOCK_SIZE; int blocks = size / PMMNGR_BLOCK_SIZE; for (; blocks>0; blocks--) { physical_memorymgr_setBlockUsed(align++); physical_memorymgr_used_blocks++; } } void* physical_memorymgr_allocate_block() { if (physical_memorymgr_get_free_block_count() <= 0) return 0; /* out of memory */ int frame = physical_memorymgr_firstFreeBlock(); if (frame == -1) return 0; //out of memory physical_memorymgr_setBlockUsed(frame); uint32_t addr = frame * PMMNGR_BLOCK_SIZE; physical_memorymgr_used_blocks++; return (void*)addr; } void physical_memorymgr_free_block(void* p) { uint32_t addr = (uint32_t)p; int frame = addr / PMMNGR_BLOCK_SIZE; physical_memorymgr_setBlockFree(frame); physical_memorymgr_used_blocks--; } void* physical_memorymgr_allocate_aligned_blocks(size_t size, size_t alignment) { if (physical_memorymgr_get_free_block_count() <= size) return 0; /* Not enough space */ int frame = physical_memorymgr_firstFreeAlignedBlockArray(size, alignment); if (frame == -1) return 0; /* Not enough space */ for (uint32_t i = 0; i < size; i++) physical_memorymgr_setBlockUsed(frame+i); uint32_t addr = frame*PMMNGR_BLOCK_SIZE; physical_memorymgr_used_blocks += size; return (void*)addr; } void* physical_memorymgr_allocate_blocks(size_t size) { return physical_memorymgr_allocate_aligned_blocks(size, 1); } void physical_memorymgr_paging_enable(bool b) { _asm { mov eax, cr0 cmp [b], 1 je enable jmp disable enable: or eax, 0x80000000 //set bit 31 mov cr0, eax jmp done disable: and eax, 0x7FFFFFFF //clear bit 31 mov cr0, eax done: } } void physical_memorymgr_load_PDBR(uint32_t addr) { _asm { mov eax, [addr] mov cr3, eax // PDBR is cr3 register in i86 } } uint32_t physical_memorymgr_get_PDBR() { _asm { mov eax, cr3 ret } }

[ "tim@timwaterhouse.com" ]

tim@timwaterhouse.com

a479f7775fffb219785cd8518a6f0149a141edb9

0b69a011c9ffee099841c140be95ed93c704fb07

/problemsets/Topcoder/SRM 458 (DIV2)/BouncingBalls.cpp

4bf7c6e7e56914bf4e6444a45b4737637cb10e5c

[ "Apache-2.0" ]

permissive

juarezpaulino/coderemite

4bd03f4f2780eb6013f07c396ba16aa7dbbceea8

a4649d3f3a89d234457032d14a6646b3af339ac1

refs/heads/main

2023-01-31T11:35:19.779668

2020-12-18T01:33:46

320,931,351

0

null

UTF-8

C++

false

6,464

cpp

/** * * Author: Juarez Paulino(coderemite) * Email: juarez.paulino@gmail.com * */ // BEGIN CUT HERE // END CUT HERE #line 5 "BouncingBalls.cpp" #include <cmath> #include <cstdio> #include <ctime> #include <cctype> #include <cstring> #include <iostream> #include <sstream> #include <string> #include <vector> #include <set> #include <map> #include <queue> #include <algorithm> using namespace std; class BouncingBalls { public: double expectedBounces( vector <int> x, int T ) { double ret = 0; sort(x.begin(), x.end()); int M = x.size(); for (int i = 0; i < M; i++) for (int j = i+1; j < M; j++) if (x[i]+T >= x[j]-T) ret += .25; return ret; } }; // BEGIN CUT HERE namespace moj_harness { int run_test_case(int); void run_test(int casenum = -1, bool quiet = false) { if (casenum != -1) { if (run_test_case(casenum) == -1 && !quiet) { cerr << "Illegal input! Test case " << casenum << " does not exist." << endl; } return; } int correct = 0, total = 0; for (int i=0;; ++i) { int x = run_test_case(i); if (x == -1) { if (i >= 100) break; continue; } correct += x; ++total; } if (total == 0) { cerr << "No test cases run." << endl; } else if (correct < total) { cerr << "Some cases FAILED (passed " << correct << " of " << total << ")." << endl; } else { cerr << "All " << total << " tests passed!" << endl; } } static const double MAX_DOUBLE_ERROR = 1e-9; static bool topcoder_fequ(double expected, double result) { if (isnan(expected)) { return isnan(result); } else if (isinf(expected)) { if (expected > 0) { return result > 0 && isinf(result); } else { return result < 0 && isinf(result); } } else if (isnan(result) || isinf(result)) { return false; } else if (fabs(result - expected) < MAX_DOUBLE_ERROR) { return true; } else { double mmin = min(expected * (1.0 - MAX_DOUBLE_ERROR), expected * (1.0 + MAX_DOUBLE_ERROR)); double mmax = max(expected * (1.0 - MAX_DOUBLE_ERROR), expected * (1.0 + MAX_DOUBLE_ERROR)); return result > mmin && result < mmax; } } double moj_relative_error(double expected, double result) { if (isnan(expected) || isinf(expected) || isnan(result) || isinf(result) || expected == 0) return 0; return fabs(result-expected) / fabs(expected); } int verify_case(int casenum, const double &expected, const double &received, clock_t elapsed) { cerr << "Example " << casenum << "... "; string verdict; vector<string> info; char buf[100]; if (elapsed > CLOCKS_PER_SEC / 200) { sprintf(buf, "time %.2fs", elapsed * (1.0/CLOCKS_PER_SEC)); info.push_back(buf); } if (topcoder_fequ(expected, received)) { verdict = "PASSED"; double rerr = moj_relative_error(expected, received); if (rerr > 0) { sprintf(buf, "relative error %.3e", rerr); info.push_back(buf); } } else { verdict = "FAILED"; } cerr << verdict; if (!info.empty()) { cerr << " ("; for (int i=0; i<(int)info.size(); ++i) { if (i > 0) cerr << ", "; cerr << info[i]; } cerr << ")"; } cerr << endl; if (verdict == "FAILED") { cerr << " Expected: " << expected << endl; cerr << " Received: " << received << endl; } return verdict == "PASSED"; } int run_test_case(int casenum) { switch (casenum) { case 0: { int x[] = {5, 8}; int T = 2; double expected__ = 0.25; clock_t start__ = clock(); double received__ = BouncingBalls().expectedBounces(vector <int>(x, x + (sizeof x / sizeof x[0])), T); return verify_case(casenum, expected__, received__, clock()-start__); } case 1: { int x[] = {5, 8}; int T = 1; double expected__ = 0.0; clock_t start__ = clock(); double received__ = BouncingBalls().expectedBounces(vector <int>(x, x + (sizeof x / sizeof x[0])), T); return verify_case(casenum, expected__, received__, clock()-start__); } case 2: { int x[] = {91, 857, 692, 54, 8679, 83, 792, 86, 9537, 913, 64, 592}; int T = 458; double expected__ = 11.5; clock_t start__ = clock(); double received__ = BouncingBalls().expectedBounces(vector <int>(x, x + (sizeof x / sizeof x[0])), T); return verify_case(casenum, expected__, received__, clock()-start__); } case 3: { int x[] = {75432}; int T = 386; double expected__ = 0.0; clock_t start__ = clock(); double received__ = BouncingBalls().expectedBounces(vector <int>(x, x + (sizeof x / sizeof x[0])), T); return verify_case(casenum, expected__, received__, clock()-start__); } case 4: { int x[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}; int T = 3; double expected__ = 12.75; clock_t start__ = clock(); double received__ = BouncingBalls().expectedBounces(vector <int>(x, x + (sizeof x / sizeof x[0])), T); return verify_case(casenum, expected__, received__, clock()-start__); } // custom cases /* case 5: { int x[] = ; int T = ; double expected__ = ; clock_t start__ = clock(); double received__ = BouncingBalls().expectedBounces(vector <int>(x, x + (sizeof x / sizeof x[0])), T); return verify_case(casenum, expected__, received__, clock()-start__); }*/ /* case 6: { int x[] = ; int T = ; double expected__ = ; clock_t start__ = clock(); double received__ = BouncingBalls().expectedBounces(vector <int>(x, x + (sizeof x / sizeof x[0])), T); return verify_case(casenum, expected__, received__, clock()-start__); }*/ /* case 7: { int x[] = ; int T = ; double expected__ = ; clock_t start__ = clock(); double received__ = BouncingBalls().expectedBounces(vector <int>(x, x + (sizeof x / sizeof x[0])), T); return verify_case(casenum, expected__, received__, clock()-start__); }*/ default: return -1; } } } int main(int argc, char *argv[]) { if (argc == 1) { moj_harness::run_test(); } else { for (int i=1; i<argc; ++i) moj_harness::run_test(atoi(argv[i])); } } // END CUT HERE

[ "juarez.paulino@gmail.com" ]

juarez.paulino@gmail.com

c7155609573ffa36249de02e03ef44019fb2bf63

0fde325785b1bcc7d4c9883d79bf6f85e4c0b7fa

/Stick.cpp

50e6e823572cff123b5385a3f816fdb847065fb0

[]

no_license

usamabintahir99/Tetris-Game

d90e21b21934858a4ee8d2cd77b2064a6be7fd7f

62b6a451123c19d38c057e142794c575f505fc96

refs/heads/master

2022-11-06T11:39:02.796947

2020-06-24T05:11:12

274,580,063

0

null

UTF-8

C++

false

1,068

cpp

#include "stdafx.h" #include "Stick.h" Stick::Stick() { State[0] = FourBlocks(0, 0, 1, 0, 2, 0, 3, 0, 0); State[1] = FourBlocks(1, -1, 1, 0, 1, 1, 1, 2, 2); fptr = &State[currentState]; } void Stick::rotateAntiClock(int x, int y) { if (currentState >= 1) { currentState = 0; } else { currentState++; } if (currentState == 0) { valid = 4; State[currentState].setFourBlocks(x, y, x+1, y , x + 2, y , x + 3, y , y); } else if (currentState == 1) { valid = 1; State[currentState].setFourBlocks(x, y + 3, x, y + 2, x, y + 1, x, y, y + 3); } fptr = &State[currentState]; } FourBlocks * Stick::getFptr() { return fptr; } void Stick::setStateCords(int x, int y) { if (currentState == 0) { valid = 4; State[currentState].setFourBlocks(x, y, x+1, y , x + 2, y , x + 3, y , y); } else if (currentState == 1) { valid = 1; State[currentState].setFourBlocks(x, y+3, x, y+2, x, y+1, x, y, y+3); } fptr = &State[currentState]; } int Stick::getValid() { return valid; }

[ "noreply@github.com" ]

noreply@github.com

236cee5e8827b07d9fd1d5fc59dc75cf2293cf67

2a68a7ec53836ec4fb85b560a93e35189e4f7d51

/httpFileDownload/test/io.cpp

df02b9e5a5e05533bf48dad93709e11913fa69b7

[]

no_license

ZPTISRHCA/personalProjects

34af59bf31297b2128e90a9d0e57441448ac2311

814548d3ba9f9fbcd10365ca5565cc77eb9ff91d

refs/heads/master

2020-01-23T21:56:01.089573

2016-12-28T16:13:47

74,728,731

0

null

UTF-8

C++

false

2,873

cpp

/*********************************************************** # File Name : testIO.cpp # Author : zpt # mail : zpt1596723345@live.com # Created Time : 2016年12月07日星期三 23时52分28秒 # Descrition : ***********************************************************/ #include "../include/httpPacket.h" #include "../include/ioHandler.h" #include "../include/conWebServer.h" #include "../include/analysisURL.h" #include <iostream> #include <cstring> using namespace std; using namespace httpfiledownload; void f(IOSocket*& io, size_t totalSize, size_t curSize, char* buffer, size_t length, IOFile* iof) { PacketData pd; pd.m_end = length; pd.m_data = buffer; iof->write(&pd); curSize += pd.m_end; while (1) { if (totalSize <= curSize) break; memset(buffer, 0, 2048); length = io->recvMsg(buffer, 2048); pd.m_begin = curSize; pd.m_end = curSize+length; pd.m_data = buffer; iof->write(&pd); curSize += length; } if (totalSize != curSize) cout << "error" << endl; else cout << "successful download" << endl; } size_t g(IOSocket*& io, AnalysisURL& an, size_t& totalSize, size_t& curSize, char* buffer, IOFile* iof) { ConWebServer con(an); int fd = con.getClientFd(); HttpPacket packetTool; PacketData pd; io = new IOSocket(fd); PacketConfig pg(0, 0); string packet = packetTool.constructGetPacket(an, pg); io->sendMsg(packet.c_str(), packet.length()); memset(buffer, 0, 2048); int length = io->recvMsg(buffer, 2048); length -= packetTool.analysisPacket(buffer, pd); totalSize = pd.m_contentLength; cout << "totalSize;" << totalSize << endl; return length; } int main() { //char b[] = "http://news.qq.com/a/20161208/033976.html"; //char b[] = "http://117.34.50.31/dlied6.qq.com/invc/qqpack/Wechat_Setup.exe?mkey=5848e65d40d80680&f=3480&c=0&p=.exe"; //char b[] = "http://wap.sogou.com/app/redir.jsp?appdown=1&u=0Gd8piB6093-W-QPHXpNcQJvLH6U5CYd7_gTMbkenBQlia2gpsaPJH1VSh0l2hghy6rGmVCuxuQ.&docid=-1612059341574501111&sourceid=1306443573476071096&w=1906&stamp=20161208"; //char b[] = "http://117.34.50.14/dlied6.qq.com/invc/qqpack/QQ_Setup.exe?mkey=5849216e40d80680&f=9555&c=0&filename=QQ_Setup.exe&p=.exe"; char b[] = "http://p2.image.hiapk.com/uploads/allimg/150828/928-150RQQ642-56.jpg"; AnalysisURL an(b); char buffer[2048]; size_t totalSize = 0, curSize = 0; IOFile* iof = new IOFile(an.getFileName()); int fd; IOSocket* io; int length = g(io, an, totalSize, curSize, buffer, iof); f(io, totalSize, curSize, buffer, length, iof); /* while (1) { if (totalSize <= curSize) break; memset(buffer, 0, 2048); length = io.recvMsg(buffer, 2048); pd.m_begin = curSize; pd.m_end = curSize+length; pd.m_data = buffer; iof->write(&pd); curSize += length; } if (totalSize != curSize) cout << "error" << endl; else cout << "successful download" << endl; */ return 0; }

[ "zpt1596723345@live.com" ]

zpt1596723345@live.com

2f51d8b6e500e712bd64407e6041c49ac180e1dc

98cd0dcec1bb3db5ba483758a5337521d6b5f9df

/old/Container With Most Water/Container With Most Water/main.cpp

4f4cdf49a0d05cabd56816cfbdcc09461df71f19

[ "Apache-2.0" ]

permissive

betallcoffee/leetcode

ff09853caef704dff39bb193483d149e89172092

b21588bda21a464af7c18a3e8155c53af76b263f

refs/heads/master

2021-01-19T11:17:37.086034

2020-03-01T09:19:14

2020-03-01T09:41:31

26,198,774

0

1

null

UTF-8

C++

false

51,309

cpp

// // main.cpp // Container With Most Water // // Created by liang on 6/20/15. // Copyright (c) 2015 tina. All rights reserved. // Problem: https://leetcode.com/problems/container-with-most-water/ //Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water. // //Note: You may not slant the container. #include <iostream> #include <vector> using namespace std; class Solution { public: int maxArea(vector<int>& height) { int max = 0; int left = 0; int right = (int)height.size() - 1; while (left < right) { int h = height[left] < height[right] ? height[left] : height[right]; if (max < (right - left) * h) { max = (right - left) * h; } if (height[left] < height[right]) { left++; } else { right--; } } return max; } }; int main(int argc, const char * argv[]) { Solution s; int case1[] = {3,5,3,4,6}; vector<int> v1(case1, case1 + (sizeof(case1)/sizeof(int))); cout << s.maxArea(v1) << endl; int case2[] = {1}; vector<int> v2(case2, case2 + (sizeof(case2)/sizeof(int))); cout << s.maxArea(v2) << endl; int case3[] = {1, 2}; vector<int> v3(case3, case3 + (sizeof(case3)/sizeof(int))); cout << s.maxArea(v3) << endl; int case4[] = {}; vector<int> v4(case4, case4 + (sizeof(case4)/sizeof(int))); cout << s.maxArea(v4) << endl; int case5[] = {0, 0, 0}; vector<int> v5(case5, case5 + (sizeof(case5)/sizeof(int))); cout << s.maxArea(v5) << endl; int case6[] = {0, 2, 5}; vector<int> v6(case6, case6 + (sizeof(case6)/sizeof(int))); cout << s.maxArea(v6) << endl; int case7[] = {3,5,3,13,13}; vector<int> v7(case7, case7 + (sizeof(case7)/sizeof(int))); cout << s.maxArea(v7) << endl; int case8[] = {488,8584,8144,7414,6649,3463,3453,8665,8006,1313,3815,7404,6969,7759,3643,8530,9792,1815,2480,6996,1151,2849,3432,1198,6125,1666,978,930,1678,3348,5223,2167,1932,3367,5933,4933,6830,9386,9951,1188,7051,118,8593,373,7877,2236,5255,7669,4051,7735,1018,1554,584,4450,9105,3061,2468,83,3992,498,9784,5567,2665,8068,8935,4951,3002,5765,4337,9305,3306,7741,9423,1899,8114,7301,487,3369,4970,890,7456,2340,8797,4392,6790,7902,3805,5610,7985,4149,6109,4121,9717,5126,2190,8652,77,1544,769,767,849,4075,8508,272,2326,2974,7573,9165,2695,8896,56,6503,1236,8853,7247,4379,6755,1052,9989,1092,5202,6098,5214,4919,7577,3756,9923,7654,5300,7044,8421,6149,1120,3281,6421,9798,2607,347,8964,5302,9243,5372,1805,479,4225,9052,1210,7332,6457,1200,8424,8011,3650,9990,9282,1227,3746,9205,5234,9046,6249,7,1547,3721,3289,4321,9872,5896,4668,8836,1199,3911,560,9356,742,4785,4761,1953,8469,1218,9505,3245,5581,9507,3236,4863,7087,3334,4068,2321,8733,6669,2328,280,391,1969,4601,6615,7866,9269,1803,5417,9532,2363,1125,6627,7148,5886,4932,1969,3456,4437,5214,9037,296,4802,252,7383,8137,4320,9704,6870,7342,8385,3502,4085,354,8104,700,4572,3725,2503,9989,9610,4866,7467,6237,8366,9705,1169,335,9514,1958,1901,4903,2254,6704,5156,9638,1193,9476,5694,8063,3170,4079,7917,7255,4434,2373,7955,9006,6099,458,5348,2061,1676,2815,8298,42,2520,5819,6729,2034,7777,8631,6938,31,5335,8446,6021,6528,7922,1716,943,1093,5795,8860,4700,6581,7586,2656,1940,3685,3114,3640,5746,4791,2807,396,1185,1679,6215,7915,3714,3992,6546,7004,375,8233,5450,6397,1113,9724,8113,8408,7169,260,3620,1870,3194,1206,4526,5134,4891,3992,5126,6989,5135,7933,3737,2673,9612,9952,588,9678,296,3486,3034,672,8071,4836,3421,9184,4561,1534,7592,8082,8146,7564,9952,1340,8771,830,2826,14,1175,7952,3356,2662,2237,7093,5335,1850,3398,2275,7880,3694,2113,915,718,184,5751,491,5720,6664,2025,3312,4747,6524,877,1051,7864,6000,8234,7043,6014,5761,1347,9370,8423,3585,6464,111,1787,6214,8738,9667,6260,852,6934,6979,1036,2686,3822,3109,5702,5848,6421,449,8724,3650,7853,6588,6002,2439,9983,2017,8200,1331,7739,2975,4916,555,9438,3055,6769,8177,9074,3030,5381,6009,6361,6417,5047,183,5878,749,2383,2300,7551,1107,2302,5404,4048,4657,7843,4031,6674,2395,1714,4413,5370,6630,4969,4809,6037,1738,9338,5112,1120,4719,1121,7481,7488,6168,4017,3367,6917,6400,2019,4468,7508,673,6224,7908,5330,419,8291,2004,2814,6,2770,8185,2988,4091,9346,9026,2181,8684,4138,3302,3403,1611,7135,891,7779,1152,4258,1048,7553,6277,1869,1413,6951,4445,5673,2281,4865,3964,638,7679,3970,3408,5864,6959,3851,5210,5985,6032,3894,6475,5686,3649,8086,2822,4541,5865,326,8799,3265,4231,5077,5134,5644,8380,9580,7669,661,797,1634,7651,8476,5604,7411,693,8915,1262,5903,4900,3647,6150,7727,9333,9799,5813,2155,692,8030,8834,9492,1296,3065,921,2782,5062,5653,8714,2731,2666,9511,4365,318,4340,6322,7729,5033,5237,8992,7288,6490,8991,9790,4217,8324,9590,31,6832,6634,4413,5666,6126,5709,8731,3399,4844,3793,9052,9910,6525,1719,9422,7242,8389,114,3564,6118,5147,8802,1462,2435,1644,453,2226,5861,8778,8168,2244,1962,4802,6658,7628,7281,8719,6359,7032,9915,153,6085,9826,3030,4156,5600,272,2545,5714,3837,5015,861,8991,6478,9648,6987,3283,8226,2848,8413,6394,1445,375,7549,4455,8003,1182,3174,715,8214,3090,7220,651,9268,250,1159,4868,6874,3704,582,7063,5072,7795,6054,1550,7443,3041,1185,5670,2242,9599,8416,39,6326,2317,4494,4330,3499,4020,1397,8066,3462,8617,5069,2730,5219,6229,7598,2093,6285,8180,9157,1357,5975,1563,9259,9771,957,445,5441,3199,6396,209,3238,2722,2527,4084,3404,2378,8104,4801,6796,1567,3418,1866,4297,4989,8095,8248,7083,732,6428,2592,2090,8756,4155,1349,8527,1464,1794,3968,4663,8190,529,4253,7265,9408,4689,669,8139,2794,5471,4935,713,5241,3153,1362,6583,7600,9610,3666,8333,6039,2610,423,1147,3117,1772,9674,4582,9919,9994,5597,4461,523,6203,1726,9932,892,8748,4423,38,571,9358,7103,2164,8864,8466,8747,6464,8076,8765,1149,467,1375,1572,1614,4493,9697,7640,5427,9616,7634,1024,429,4510,7227,8508,794,4472,7256,5217,4510,4179,927,1614,6343,9791,80,1443,2608,4508,208,3757,1328,1584,5330,9294,2429,1379,6935,7856,7347,921,8880,7776,5431,2460,2636,6225,6932,6244,7794,7794,423,8722,9408,3119,4865,5840,4562,7473,6701,4770,1231,4381,2706,2913,3675,5135,4292,6962,9343,1639,7884,8224,5767,9667,7036,8404,2245,3968,4648,39,1762,1424,5113,7523,4543,9979,9715,9105,7452,6416,227,8683,797,2934,1596,825,8069,2240,7787,3765,3879,2023,1989,9647,8043,5377,4403,288,5697,9051,327,3811,475,1793,1334,1370,1772,1050,475,9224,3818,703,4260,4616,9989,2208,5441,8058,4449,9580,8175,4680,7956,164,679,5999,1893,5082,6287,7590,486,2966,1402,7313,4759,2736,8684,6531,138,9159,2108,3957,6214,2720,4925,6203,4928,6718,614,5729,6298,8789,6762,4254,5306,7441,6605,3551,8876,2892,1142,9362,2211,2544,6675,6970,1632,5359,9854,8123,871,8314,2080,3437,1034,3357,5993,2314,75,2959,4396,2725,1748,1158,3332,3406,4951,9937,6958,3827,2830,4452,3189,5041,6996,6217,8363,4980,7928,4569,3103,8799,2883,1535,8589,269,4892,4582,8936,4967,7541,3332,7693,5641,842,1025,5400,5793,962,2358,9621,144,6810,9162,1537,158,5379,6253,1490,9660,822,4594,8459,58,6129,7048,327,7374,7982,5615,2341,5523,5299,6386,7517,6141,3763,2917,8287,1078,1627,4260,7574,4789,3422,9112,4947,5154,5365,2789,4814,2539,7383,9625,2597,9865,3026,9277,7239,1008,4892,5932,2884,192,8671,6753,2685,2434,9670,972,3512,7649,5232,1087,2438,5007,6551,3737,6513,8268,6526,1327,807,3910,7304,9757,127,330,9034,3718,7691,278,9650,6927,6822,8321,32,5860,7108,9702,6832,6972,7351,8417,8059,6141,3424,962,9878,9937,9230,6404,7616,6390,6666,1272,6147,3145,7955,1533,6863,1998,8163,2866,5277,4986,1187,5309,846,4647,1363,4030,1620,5066,2447,6031,1207,2223,6994,1085,8512,2576,3841,2480,8966,6860,3753,1465,5,1708,2998,6869,3706,7514,9735,8983,2500,7274,4292,9698,1922,2007,80,3542,7073,2528,9573,8280,1103,2919,5717,9616,5496,9558,2096,814,6418,2201,2280,6424,3909,1630,9645,3967,9144,9380,9302,7996,6654,9946,4046,4928,1953,4127,8470,9026,3007,4396,7306,462,7315,9375,6430,9163,8934,8527,9978,1704,7080,8610,4480,7342,240,4125,1309,5737,3505,612,85,6512,6910,4132,1440,8864,4611,6263,7890,3970,659,1549,4432,4326,7276,863,3490,6210,5742,9820,4267,2822,8430,5099,164,5022,9225,7826,759,9082,4790,7197,1946,1700,7681,3387,6916,2292,6002,1159,2614,6661,9060,7046,7339,6336,4261,829,8899,6355,7001,3166,5530,5431,4617,2046,454,3842,9872,7565,9277,1014,4762,7575,2715,2443,7314,5983,1087,3316,7142,3701,9977,6202,7100,3669,2539,1361,850,1438,4069,7852,956,9599,3283,5573,1645,3737,5768,1518,1303,1397,2532,2417,8972,1599,4861,6287,3935,5948,9603,1077,9650,5933,7280,6750,9602,6171,4463,452,3961,8532,8304,4917,4483,7940,6842,6129,8029,2610,3999,5684,4007,2883,8102,9332,4483,2963,5619,4770,5263,1574,5847,4913,7507,9479,8015,3461,5650,8831,266,9611,7363,4922,880,1847,2862,7723,4328,7244,6685,8327,2928,7045,1210,1030,6377,2045,345,8348,6815,5609,9922,2663,6874,3782,8494,4890,3595,4145,3721,3861,108,7436,8784,7341,5635,7998,1416,9963,5242,8101,4642,4523,5146,5853,1905,7875,4250,2251,2575,1066,4212,8850,81,1086,2632,8575,2328,2579,9072,6049,6441,5533,9838,1577,2874,1825,5927,4290,8141,1170,8743,2783,2045,242,4988,3950,4469,9239,6201,7045,305,6765,5895,6738,7852,4879,5313,180,7458,738,2582,251,6271,8772,8180,5497,597,4108,6139,5090,1630,4882,4226,3675,1476,9214,7625,5946,8453,179,2991,5110,6944,5238,1848,4796,6469,3514,1329,279,4252,263,6883,6875,9035,5063,2372,5984,9171,4863,1075,801,9745,5301,828,1222,867,8454,3520,5673,8633,2863,783,1929,8101,8984,6726,922,8850,4407,1201,9454,4670,8084,6329,3705,3148,5053,6041,8671,9916,7116,5825,6013,8769,6653,7235,9637,5107,7107,1662,92,9970,8797,2022,4423,7781,5100,5345,2983,9507,2899,2437,529,7335,8766,4234,483,171,275,5507,87,3744,1332,6101,8865,4337,9688,4854,9445,6796,6516,5889,6766,5314,4263,1190,9447,9363,2887,2431,5222,5786,4868,5751,3122,9987,6337,9957,158,2965,1816,6598,6709,3148,2699,1926,7486,8739,6781,3283,5535,9649,5524,8654,4963,9788,6196,4411,5503,9083,3194,726,1222,4414,2829,4344,753,9167,653,7264,2132,2470,3862,5193,1970,2913,7119,5808,1652,252,9091,3540,9902,968,2194,1217,7108,4742,1980,2611,3825,5174,9689,5047,5941,8871,5743,6694,8038,2749,3958,6522,5219,7820,8067,7189,7085,1538,9350,5090,1791,8441,8630,8045,5761,7176,9262,2869,1918,1243,5481,2095,2769,1522,3495,8710,393,9238,5405,4783,8339,9363,7657,3558,3536,5724,7100,6973,7263,6450,2063,5406,1243,7045,3451,7005,4221,9065,6226,2491,308,8059,4587,3078,9582,8082,8140,6327,3672,3545,1111,2012,9261,5120,1922,9149,845,9022,6122,4460,1824,4538,9866,3068,1583,9669,6425,5805,8734,9003,4648,5395,7063,9235,8473,2997,3669,2965,9324,3694,6511,6787,5706,2124,1908,3980,1273,9105,3003,3747,3565,1179,8285,9783,599,9869,9452,3376,2026,4538,2380,6674,9933,9443,2262,4758,8792,5931,7724,8116,9625,587,1256,1683,2711,9516,5664,3984,8621,5019,4083,2186,6198,2369,8321,3150,8590,4125,6526,616,8663,5258,3642,4949,4701,5904,6059,9845,8188,3783,7962,4165,722,5570,2201,3433,5086,7865,3769,3707,9236,7853,2245,1786,222,566,4936,8812,4691,7815,5780,9706,3073,5774,4655,4127,1679,7067,3972,6219,7202,8286,6736,7925,3856,8937,1358,8942,3154,1480,9001,2390,9333,1246,4177,5907,8164,5465,1071,2855,3280,6851,8914,2706,2625,9921,6833,656,6988,805,3227,4191,9092,9964,2116,9300,5253,9826,8243,8408,1306,3596,798,6991,4843,1327,9250,3007,3145,321,2215,2777,3524,7481,5483,2502,7402,2316,9510,4391,9474,2738,4934,4918,9054,7050,4218,4307,3228,8813,9067,887,2410,6218,7878,3605,7545,7129,2964,7042,3802,1531,9820,7327,9012,1655,9829,6415,324,9339,7158,9798,8429,2092,1068,3835,5494,5286,8143,5074,452,7210,5961,9214,3428,192,9171,7326,3673,2135,720,7475,19,540,1154,9031,2196,7335,1798,2520,6675,5308,8670,1456,7400,9738,5292,9246,1376,9787,4321,8180,3349,6634,7394,3130,6826,2917,456,499,1405,1176,4327,1424,8069,5481,6807,6617,2817,4958,9137,5844,266,4159,7300,4019,249,8944,3265,1625,8731,3938,6158,2081,573,9904,5211,7399,2822,2019,4251,4227,9547,8578,2003,7616,4059,8810,4233,3228,3768,9722,9072,387,233,2725,4406,482,1669,4023,8460,6753,4314,4618,8834,4887,4522,397,8638,3696,2416,2889,4275,8315,7819,6278,2284,1879,5089,2869,1459,5209,2592,532,1948,9177,3257,6354,9660,4926,6730,4472,1679,1044,9090,6865,5931,9964,3614,921,3661,2382,163,7936,698,7982,567,2982,6213,2008,5851,7673,3569,4795,8205,5518,3973,7814,8224,9985,9092,4954,4457,7124,5998,9899,3989,8281,6215,7604,5555,6228,6338,5718,517,7036,3700,1084,18,6266,3092,2222,3939,6661,7017,8496,2179,7342,6310,404,3679,5402,1710,4488,2526,4061,4387,2868,2342,6955,6824,4249,3183,3162,9967,3700,199,20,4784,6569,6286,4228,5143,225,890,8513,8721,9421,5855,5031,6177,5887,6785,4240,375,5664,8301,1115,8532,6995,8070,1708,1245,1253,4870,1212,1306,1421,1232,6090,4343,7518,6671,9486,4095,3913,7999,2816,9686,207,4199,5864,6094,7337,104,2821,3001,4757,3936,7885,1752,8358,9593,2997,5964,815,562,7270,2237,1794,9712,6580,5665,6383,2418,6112,296,418,5281,9983,625,5832,2199,3071,3169,8655,2244,2522,3412,2533,407,5164,891,0,4514,6855,7168,5076,477,9405,3222,190,2337,5239,2925,1107,1352,3222,1525,6633,9557,8502,2465,1756,7925,1987,6763,170,4509,175,2703,1269,1691,3594,7621,2557,6802,4789,7633,3631,546,7208,173,2883,8799,3099,343,151,2673,1868,3136,2230,6723,1954,338,4648,3941,7101,1170,4802,3628,3873,6071,1671,3820,3693,4229,6974,8482,8214,605,5381,5422,7131,4616,4222,230,4959,725,2903,3180,214,5133,9903,2168,1823,903,2461,8924,2074,7263,8904,2299,9687,575,2471,9732,4804,9445,4566,9371,6403,9947,1145,3534,4564,1719,116,9523,2445,3019,2703,2659,4504,8958,1179,2679,6214,3640,1603,4640,7255,507,6939,3294,7434,9411,3026,8591,5208,7593,7962,7963,7540,9107,1497,8456,827,7965,7980,9624,984,7035,2283,1840,5994,9814,4519,2208,3454,2474,6848,7061,9333,139,356,6768,5902,3382,1711,1111,7327,9673,9074,1220,8780,6924,9676,9607,4889,4008,9231,2226,1044,7866,418,3390,7680,1290,1950,7486,116,5150,4548,9450,1641,1256,2570,7544,990,4281,8655,8318,306,4081,9538,9086,7357,5566,5046,8599,9575,629,825,6971,4848,7595,361,2528,8885,8663,6367,9002,3813,7267,4804,5454,8523,3726,2998,9513,4359,8005,4183,4665,8439,3721,103,5796,5640,5149,4395,5215,5779,1572,2186,627,9168,8899,9507,4405,7562,5874,9759,1375,9493,915,3181,8016,993,2532,3882,5352,537,8065,6369,5328,8139,6473,1125,3779,1622,1872,5346,3753,3445,7532,4380,8965,2783,240,3370,345,2466,9482,8072,1960,397,1253,6328,1391,137,6562,3095,675,4628,9465,2355,9119,5938,9832,9250,3912,1705,4596,7666,1502,8480,8398,467,1263,8638,189,7960,7457,9671,6032,9417,6421,3637,2097,4164,3775,8660,7259,802,9640,3076,3157,8759,9014,2990,8009,9279,1047,8957,6945,2549,7437,5343,9368,5052,334,9557,3012,7791,5581,5396,3560,8354,9033,5657,2518,9160,669,6129,9962,309,9206,9472,9068,4572,8814,3429,3851,9861,8738,7148,8762,6175,2492,8130,7579,9178,7687,6943,3321,9620,2339,6881,7974,7725,8890,492,3237,9560,2974,9552,9869,8532,9024,5290,3104,4190,5071,3308,4051,3810,456,9165,6337,9300,7295,3917,4830,4982,860,8151,955,9552,5032,8929,3629,275,5774,6866,9835,8748,6418,9704,7280,1794,1346,6736,5984,6418,44,6387,228,6853,5552,6565,2505,9199,6834,7336,534,7695,5487,1489,3599,6872,418,3580,7147,6192,446,6982,4940,3217,3038,8572,1363,737,5309,3700,7155,1705,87,3735,4910,1992,300,7416,1191,7135,4752,1725,1182,6591,9566,1133,9815,9985,4713,6962,2529,1511,296,7470,1080,9687,2394,2444,424,4055,6144,3931,5761,2583,7666,671,927,4318,4439,8471,7805,5543,6548,5339,2135,6115,6472,8302,6100,7537,1617,8629,5401,1913,2451,6481,7952,1198,5277,4728,5253,7773,8659,1014,357,2677,8038,1284,6996,2477,6107,4801,8021,2656,141,6508,8771,2965,4810,1223,6855,6427,9852,2256,4693,8656,8737,8997,9854,367,3726,5107,8140,8737,2474,8497,1415,6864,6134,8411,5693,2241,9564,3714,1249,6057,6574,20,5375,7737,1243,2230,516,7448,4486,1561,2456,9575,559,2310,9942,4285,3769,4435,3022,2595,9284,789,9459,5418,9200,5153,4012,5117,5219,5261,1174,8146,1634,6549,5883,2877,5131,2751,6677,9617,4313,9133,5545,1224,7795,5487,5509,7917,9922,4883,512,9207,5673,6324,977,1225,7829,1341,6342,9400,2955,3869,7546,4589,6770,9781,3818,1902,8885,496,1519,3198,9629,7064,4422,7425,8904,6283,5342,5178,7518,2206,737,9543,4882,1715,769,2711,9408,3463,2112,2363,7332,6010,3304,455,2144,7123,2357,1029,7619,228,579,3600,3645,1353,7377,8901,3988,2719,4079,1506,1278,4817,1050,6160,2884,8171,8872,8644,1634,7336,7360,5319,9698,664,2126,8194,7787,4483,9223,1758,1063,6154,1711,1060,7507,9088,9961,7847,8160,393,5706,9438,1562,6756,5598,798,1279,822,9442,9265,4510,6802,936,4209,7467,3062,2403,1606,3897,7979,9717,1313,4133,1428,2373,7993,516,2335,2192,8676,9080,7898,4466,642,1006,65,1440,2285,7239,882,7903,1750,7685,8839,2311,1504,8254,1066,9462,2151,9045,9179,9816,9531,607,2190,3876,7476,877,6068,2504,9957,3967,6971,6951,4973,3388,8391,3611,627,9273,1514,8729,3310,353,1040,1166,4959,2107,629,3463,7504,6160,3279,7035,6768,1821,7263,596,2698,3332,3100,9007,3651,6423,5958,4976,9811,701,8587,439,6327,101,9168,5989,6807,6561,7156,1766,8668,4137,5229,2524,297,4861,5912,3417,6682,3175,365,5733,2859,3466,1092,2862,9889,3403,7839,6053,4104,6426,6492,431,2880,2012,6421,9687,4925,9929,7805,9945,418,3035,2470,7067,7896,8382,485,930,7909,7202,6663,7121,668,7756,9983,6910,1159,4174,2963,5263,601,5807,2047,9833,4171,4820,9520,9097,1101,7325,9042,1519,6712,7864,4938,960,2598,1775,1891,508,8978,4906,3981,9646,2662,3964,2908,173,4491,5871,1789,5092,8030,3836,4925,2202,5008,797,7651,6109,4474,3045,3980,7539,910,8918,8499,3508,7046,6742,368,6024,1649,701,5670,4311,1018,4931,837,5509,802,2626,601,5185,2814,1878,7387,7822,9027,1390,283,9853,4435,615,7392,5345,5885,5892,5206,2931,8986,1926,8955,635,2628,978,1299,3646,5909,2136,9155,3063,4762,6108,8248,3928,4338,1987,1750,9717,3377,8385,9570,7813,5352,6963,9510,1237,9207,1068,4169,8193,2995,9476,5181,1975,454,6480,1973,2715,8616,1128,5779,9730,3588,379,10,4278,2367,1760,3995,2096,6497,9917,6261,1849,6880,5772,3086,2439,3192,3607,6985,2539,9436,2166,4514,9890,8646,6487,8958,3614,3967,4737,9696,3907,1468,9706,8185,187,7818,8532,2284,667,8450,8545,2516,1682,669,1954,4122,3862,1914,7459,2753,1350,9625,7268,7592,4623,107,6550,4589,427,7639,4285,4334,5460,343,8872,5647,8161,3756,4283,5180,2206,9181,7696,241,9850,6002,715,64,7916,8174,2818,5618,4151,6438,3211,8774,2897,6113,3363,3324,3753,4000,4011,9213,4343,9235,1212,8856,2991,5496,4036,1550,4677,8084,1791,879,4086,2506,944,8355,7032,114,3973,1183,2904,7184,9957,5801,9650,9672,5478,3403,3672,9489,8968,4367,5076,6532,3223,8067,2028,3611,5969,6705,1695,7760,3937,2133,6618,1233,488,3650,1347,4462,1185,603,7998,7494,6404,7648,7166,1882,7403,838,7723,6371,1557,2799,9256,4780,867,1284,4743,3188,4342,6438,949,8279,8572,3919,9512,9060,3922,7211,9874,5107,4166,7873,2602,570,5521,6120,8805,2925,3311,6528,5648,4868,9328,4904,9649,6547,2541,4392,9735,3235,7183,7036,1514,2107,7308,7378,7519,1230,941,7394,2689,5107,1619,1643,2029,7140,7764,834,6417,1075,3715,8418,5943,9395,9674,1944,2294,2215,2689,8381,5450,9872,5418,3316,8331,2726,7046,5850,308,7987,9596,2997,9446,1215,4641,7828,4708,8757,5014,7477,9832,8729,2247,5775,4476,1922,4072,6770,489,6761,5152,5940,2985,6922,5608,1316,9648,2655,3518,6308,6994,9467,5657,2793,7034,6650,621,1742,5407,5635,5572,5239,4365,7819,7367,8841,9741,1439,1964,231,8200,7116,2523,7537,4038,8131,5205,38,7138,8723,2698,4133,4542,8355,6926,1577,5006,7547,9671,413,9534,5243,2005,251,9415,9372,5445,9156,7163,7409,5739,1715,4525,4614,9252,4915,9098,4457,1305,6236,9532,4003,369,4075,2358,3647,5652,3716,7546,5323,482,7081,6919,2487,7332,6334,1859,2777,1842,5374,6538,7582,7089,7415,8548,6341,2330,7646,7150,9987,3883,3034,3990,604,7109,2701,604,9113,6417,8150,789,6899,1583,7708,5738,5268,4042,3949,4397,5884,9323,936,9818,6412,8351,8367,9105,7034,2365,6255,7021,2600,5642,7364,9557,2751,6417,161,8217,2834,4663,9006,6086,6247,6714,1824,7867,7108,2126,2264,9344,1449,3200,9163,7862,7904,3882,3319,1290,2599,5927,4663,5200,1569,8379,4757,672,4796,1270,8889,3983,5933,7895,69,8532,961,8245,6399,4421,371,5016,3766,8173,4568,9281,6035,8824,9515,5706,114,2114,1633,4778,3666,3202,9509,8423,3875,4306,9693,9116,8289,1979,3364,4710,511,4325,9307,3263,5099,6031,8279,8865,4204,2847,4498,6591,1672,4013,2297,8138,2479,3931,9268,6146,3485,8778,4569,3712,3084,615,2829,7725,2594,6193,2435,9457,6870,1742,2720,1969,4125,7351,7186,8329,6551,8036,4920,4575,2049,3570,2713,881,3853,8334,7027,3690,7112,7948,7403,6548,4915,232,4273,3861,2777,3060,3319,5999,4802,2391,7969,8928,9743,1507,3609,2646,9544,4882,7221,7945,8452,6286,8826,8657,4620,2205,2347,1732,6506,9750,4632,1421,6334,8905,5283,9111,1965,4954,5111,3120,7345,9432,8400,3440,7291,8361,6086,6835,3243,9659,4781,8047,5946,9959,6704,566,8517,9052,8651,5023,8802,3283,2796,5137,8541,4431,600,6858,9385,2063,6330,3083,7847,1082,6523,5139,9444,8962,8326,2687,8621,9459,7087,4567,9419,3791,1486,4288,2843,137,9311,7998,9772,2107,3135,8313,6539,87,5172,2276,8503,7854,5359,6350,8937,8235,7841,4733,7197,6168,3772,2170,5627,859,3090,1398,4651,4576,5686,7494,4713,1349,1844,4485,3457,1331,9151,6348,1419,675,4976,6274,8529,6688,8976,3818,4923,6818,8551,8472,2986,2324,642,4965,3183,3732,6364,7834,8308,8402,1681,9373,9752,3525,211,9561,1209,9362,2261,2628,37,7237,5254,8566,3925,4230,2385,5200,1048,936,3672,386,3260,667,1704,2796,751,8068,6982,5412,2822,5015,4785,2574,4893,4996,2135,6102,4358,4396,5082,747,7986,336,9314,1911,4566,8051,7112,1967,5339,7136,2353,4952,7803,4057,7748,8555,8477,4730,3967,1300,6098,5104,3874,991,6453,2362,7093,7163,6758,2175,7911,4744,2511,3577,3008,3429,1628,6472,5396,3319,3608,7750,8271,7764,8159,2371,6319,2989,3454,6638,4289,9552,8094,4515,543,4547,6877,7636,8063,9988,6163,5974,1084,8674,5903,4092,2103,3883,6916,3852,7202,525,1602,1826,8289,6113,4197,960,9102,7651,3950,9743,7203,8396,611,4098,9296,7488,1734,7359,3828,4249,9685,4913,9275,5588,5357,7731,9471,2274,1583,3025,9151,9537,4851,3792,5650,9049,1104,1105,6700,1406,848,256,9802,1459,4354,9098,5300,2441,6457,5480,6690,6142,6745,5966,1730,2103,3697,7553,729,5280,579,6232,4817,5430,6376,6819,4479,7480,7924,7532,8886,5125,7788,8688,2936,8494,4139,4588,935,596,69,7626,3091,6814,9944,1173,5269,9993,8727,2350,1625,5658,4934,6442,1088,1310,9613,1920,5142,3890,5804,4028,9015,9944,9069,8303,8438,3208,2892,5726,156,9313,3352,3247,2479,9648,4421,7749,9641,9500,6451,1266,5158,1386,4060,2598,9048,3673,4518,4191,3915,6674,4571,2930,6618,3640,7586,1409,3200,6830,7135,3357,6143,6839,6604,8622,6487,7377,2723,2480,6877,9175,98,8387,6913,4158,986,2313,4183,1856,6504,8099,8531,1076,7381,1501,1068,4967,2910,4269,1797,45,7626,4292,3236,582,2915,9723,4312,1990,8555,7541,7517,8653,5929,782,9163,6915,3096,3347,5123,9600,7798,3654,7028,1531,1508,8097,6499,4418,8718,4648,816,2696,5293,4052,3278,4560,128,3942,6550,8683,1484,4068,3689,7413,4850,2852,680,4298,2551,5803,3899,349,5810,7279,1881,7318,5376,4732,8088,446,5732,5256,3142,1025,9309,2773,5585,5789,6715,8488,824,8199,8908,4513,5612,110,7366,2644,4409,9917,8448,4660,6619,610,1939,4852,7928,3668,5936,2368,4114,8020,7625,7257,9046,3286,30,983,9075,6745,5823,6251,1297,4731,765,6909,4842,4483,5906,9251,752,4354,3911,7371,4964,2202,8575,9244,5870,863,1612,9985,8884,5589,7242,4282,8875,3624,1617,4302,369,7441,554,8018,2172,7671,1280,3366,2154,7186,8969,2906,7892,9232,278,2856,1435,5205,8452,7305,6069,6416,7290,4953,2006,884,5587,7233,4508,7204,1536,1230,4645,8442,9248,3170,6113,528,6536,8267,7714,1858,1173,1958,1090,7803,4814,2525,9361,9618,9831,5430,6035,3473,6735,4393,4358,2322,1626,5218,9526,3162,2800,524,7956,8401,3694,4069,5281,6582,8688,2996,4792,6214,1306,5883,369,6121,4760,9730,2091,4591,1512,8126,4417,8247,8871,5127,6921,498,345,2800,3660,9498,3324,7969,7899,3370,2038,3180,6304,727,2528,1097,3293,3835,3332,3662,6308,8092,3393,8399,9036,4905,2878,3453,9505,1749,8580,2778,8599,5277,5578,2260,4775,8902,229,9026,8624,8619,8559,4929,5698,1087,2378,8991,1274,5710,2654,7582,3802,2399,2334,2838,3656,1564,6291,3161,9665,1223,5940,8265,6501,7870,6877,7628,3125,3458,3007,1749,8429,1566,3030,4128,9005,5408,9471,280,1118,8477,4214,1273,876,2900,4111,4533,816,6755,4046,482,7978,6338,5099,831,4209,8328,4812,7334,1786,7819,5435,215,5737,8466,695,4742,226,6519,5022,1345,4996,5589,8970,2225,8489,3081,6758,5658,6188,7156,6140,4167,3495,7591,1350,4056,5919,6162,1390,4057,333,6825,624,6070,1643,7672,813,1870,4191,2187,9567,9187,7776,8537,7764,2618,7970,874,8276,4159,8031,768,4678,7878,4711,6028,1934,630,8543,9676,4687,5228,2853,5311,1299,4497,2983,8464,6367,3526,7003,5934,9066,1132,823,6830,3750,8793,7705,8378,2952,2088,5498,3982,9966,209,6363,8252,839,4906,7928,1878,6486,781,3541,7785,5278,2877,2601,7997,6403,9605,283,5469,737,1106,8652,839,9900,6357,5569,9204,8445,1067,9539,4763,7628,5902,3015,4819,7160,943,6697,3646,8076,6590,7784,9707,9467,385,7704,2223,6342,7988,4044,7079,5446,9048,4270,1698,5405,9839,7255,202,7258,6794,1317,4886,2696,4332,9705,9856,1627,2754,3502,6056,9345,7638,5763,5164,8024,3467,3739,4366,7807,4136,7798,9606,3184,2068,1304,8590,8260,4911,5144,5518,1705,2814,405,753,7146,110,609,5126,2865,464,7534,8562,8102,3297,3726,2478,3116,3818,3197,7276,7954,995,6882,1138,9415,4538,6080,7675,9450,1225,3194,7507,391,3599,8261,7537,61,5222,9015,9278,5686,6549,7840,141,6198,1567,8971,9315,5385,2168,2943,9691,9515,9825,829,8931,715,6910,6606,6517,4487,6152,4025,4878,6103,2286,8767,6165,7508,4135,5443,9547,7036,3284,6040,3235,1203,5011,2550,2940,7180,5493,2631,6695,1670,9812,1978,8737,6722,8585,5255,1209,1089,9280,2439,7193,7918,1207,9710,1778,5342,1505,7677,2378,4789,3717,1965,2344,8729,867,1636,2261,2712,619,5308,4382,432,7287,9472,3506,2224,4727,1068,3313,359,3507,6858,4629,1066,6568,6407,6408,8074,437,5139,9215,4154,7104,7912,9235,4324,5900,7848,7036,6520,3157,7771,3304,444,7243,6810,2668,1970,7878,2333,8681,7738,9192,3310,8804,2112,6069,1565,6538,6506,6704,5754,7013,160,18,6248,836,5918,449,7873,2438,3606,5644,2094,402,2887,8905,9422,1209,3135,1755,9890,873,7299,3200,9678,9412,9269,1243,2302,2128,4299,8056,9141,811,4426,1741,1648,345,2190,9521,9135,2148,1517,1230,2550,756,6487,1972,1965,9622,80,8207,496,7379,7759,6526,3143,3380,4121,5446,5508,8420,9854,1001,5583,633,2743,7231,978,4933,3104,6465,3434,4621,4047,5984,5377,534,4309,3694,157,4389,8253,7005,8120,2364,9883,7616,5745,4004,9414,7605,2424,5620,8607,8007,6253,7702,1591,3583,8987,4695,6401,2421,5669,448,8406,7398,983,9067,7445,7492,9808,5698,849,7928,8063,732,1896,160,4736,7662,4117,3512,3283,2724,7871,5888,6778,9462,5824,5766,510,2225,8187,6179,2673,2945,9929,8,2012,7374,7500,1820,3073,4701,6101,7488,5433,4349,4000,169,2012,8117,33,1647,7194,7905,7535,3972,7367,9711,9738,4229,1936,4278,408,962,7223,338,970,9236,4064,4823,7408,7137,9524,9861,977,4958,4211,1329,1479,2575,5799,1513,4222,2993,5770,8109,3317,3137,7821,9408}; vector<int> v8(case8, case8 + (sizeof(case8)/sizeof(int))); cout << s.maxArea(v8) << endl; int case9[] = {3719,9757,3686,4127,7071,909,817,8042,6497,4882,2865,258,8371,8741,119,5701,51,682,7030,1531,3257,2829,9396,7479,2174,5166,5589,1844,4655,3410,1252,8374,9519,1290,8854,6591,2199,6023,985,5049,7257,202,1659,5629,8943,1778,7682,8995,8813,1064,6878,2070,246,6274,9550,8772,7792,1491,616,8799,1253,8220,7174,772,9510,2380,3715,8062,8403,4700,3111,5661,4902,1122,7642,198,2900,1676,5545,8065,2740,2423,136,9338,5049,6038,8111,9193,3881,8727,7992,5134,6948,5166,2258,6458,3898,5974,872,2302,7026,335,4315,8281,1457,1957,8479,710,3633,4024,8775,2725,2799,8911,2064,7848,1301,175,7041,5182,5254,5033,316,2202,6552,2575,5013,450,4901,5885,9104,1927,2573,3419,6560,4030,5376,5039,4740,5361,5415,3516,8087,8214,8779,151,2414,81,6678,5807,1615,1932,7193,1932,487,3745,859,1852,547,2112,4089,9652,391,6662,9423,6952,693,4800,8343,5433,6513,3759,5301,952,8325,4081,7455,740,514,4133,6547,2129,6066,3740,413,2905,3837,7624,4757,737,9736,5198,389,6480,1861,6164,3432,8906,7316,1775,691,3830,1886,5993,4782,212,74,2238,952,6940,2723,3851,9069,5141,7592,9483,8046,7781,7107,9155,8518,3196,4354,5259,9676,2567,1424,9460,7825,8740,7587,8516,8922,9474,861,3705,9686,935,2295,6990,7875,5018,841,3297,160,4785,2780,4558,2567,6239,3714,1085,5787,4420,2697,1815,3339,4121,1275,1164,9213,5215,6032,8136,4689,6894,8193,727,4181,6840,7717,8409,8210,4910,1706,8370,9696,838,2929,2263,7077,2995,9700,9217,3767,8749,1032,7106,9222,8660,4622,8436,3875,654,2924,8564,7548,7469,5643,1730,661,3360,139,8871,4622,8197,7242,4318,9035,6523,2933,2464,5870,8986,1681,9637,7735,9066,6743,6958,7726,1365,1746,1601,2019,1022,6517,5920,4843,2160,7650,5504,1872,4141,4375,6494,2338,7969,813,1373,844,3746,3837,6714,9084,1871,6351,6820,937,9446,130,8663,811,8228,6616,9183,5602,3133,5103,445,5293,9105,5949,3517,9598,6676,11,1936,998,7176,9661,1842,923,9850,4909,6359,1721,1260,3179,2658,7059,9661,7673,4222,7889,4289,3405,3491,3774,4860,3936,9067,317,6237,2584,9915,9266,8948,8203,264,6124,7864,8458,3399,7715,3367,9759,9436,980,9290,8447,8039,8952,2472,8613,6841,3114,8371,6685,6888,3231,6973,2308,9901,9563,1244,6168,8829,192,4372,5445,6317,2236,255,9716,9951,9975,5827,5740,955,5118,4187,5346,4070,3011,3959,7263,6125,8682,3948,3014,8266,7274,5322,8167,6837,6566,4335,2018,6759,5059,3815,9428,7296,4070,5496,3599,4045,1324,9339,1352,2794,9878,3050,3216,2890,3362,479,9015,2044,780,8381,310,8054,3703,8477,4891,6622,9165,6909,9733,4224,724,5513,7872,1146,1009,1472,1544,8685,811,2896,7831,690,5947,1047,9932,5661,1527,5299,7705,2307,3681,8016,6713,3736,2845,1604,358,8362,4865,6443,2587,1941,1956,6811,9439,9318,8283,983,8003,5447,3880,5835,2489,6179,3234,2421,1840,4761,7720,5897,3420,7753,3913,133,1490,3111,8089,8200,1473,9306,996,412,7599,2952,7224,7039,2270,1859,8022,6626,7306,8254,8813,9795,4433,2047,8568,2625,3161,2641,8523,2933,394,8788,3067,8236,1899,7508,2789,3373,3167,3785,137,766,6737,3713,7805,5360,5573,2180,8338,2879,434,3503,9027,1220,1902,3947,3845,5063,6588,2368,7997,6983,7509,7416,1571,9408,1276,4360,9133,4443,8145,9271,1562,1235,2984,5719,6595,4909,7899,1285,4141,4686,4788,3168,5906,6690,3467,9751,8106,56,8472,2455,3391,5981,9871,4962,5389,7499,9323,875,8295,3820,146,9857,5055,9482,1928,8002,4392,6180,9287,4885,866,427,4405,6772,3470,7872,2875,1576,7928,1347,4031,1319,7328,254,2634,9070,7753,8309,6297,6048,2129,6443,2257,7185,2277,4186,5187,3021,366,827,7906,1232,1254,2311,4356,1076,184,7231,2652,4464,8579,3035,2136,2259,3289,4770,7681,7395,3079,3978,3443,5208,6773,5701,8745,5403,6239,285,8424,2957,7464,2683,4189,8718,4994,4897,6147,1530,2128,8799,5995,7059,8187,4483,5671,1476,9253,3352,8871,8684,3683,8667,244,6808,720,8990,2211,3311,5627,6988,6268,3091,9671,6809,8161,1017,1706,4308,2548,3834,3108,4895,7246,1295,9378,2917,9123,4983,2621,4347,3667,2656,3014,3911,9465,86,9253,8028,3397,4880,5016,9665,7971,4687,6474,2485,5705,4532,6793,4605,4718,6253,5852,1964,3900,1582,1233,9376,2917,207,3723,6584,2863,3089,6847,8680,9527,6101,6709,2924,7333,1725,8941,1657,2765,1767,4142,4822,6299,935,5779,1017,3541,1631,2982,7441,9565,567,6817,2482,774,6892,5418,3638,9981,8617,2318,9508,4718,5379,8784,8404,7105,7725,61,6222,9492,555,1044,5791,7842,6823,3161,1383,8454,6143,8825,4371,3062,1994,3205,3837,8887,8623,3827,5220,7240,2497,4729,8311,7877,9865,3067,1334,7591,3128,7556,3435,35,8600,9227,7877,5423,2388,9261,229,4883,4438,952,4297,6432,4157,8134,1671,9132,1961,6892,2724,811,7973,1035,8688,7838,454,22,1781,3582,3930,5217,3617,2530,4444,7847,4305,3184,7108,886,4419,1546,1838,8716,4330,2347,3203,6002,1479,5164,2894,4203,5975,7219,1591,1015,5057,2045,7389,6839,1980,1319,2056,1949,201,2852,9796,858,2388,6904,1744,6807,4802,9934,1875,9133,2281,5078,1487,112,6595,733,668,8922,7952,8611,9938,9361,656,3679,2552,8988,1351,960,938,1552,3812,7086,8763,2552,343,507,5711,1497,6794,7587,630,5427,9017,2117,1892,5612,2850,2560,4535,7154,1171,825,6516,8179,856,9068,7168,2207,29,4458,3760,193,1544,2523,2746,8239,9382,4809,9737,2528,8748,6719,7956,7766,8837,9848,9730,8039,8760,617,1546,9931,1442,8062,8110,8651,3482,1630,858,3511,6088,970,57,3985,9845,9155,2224,9228,3964,8313,8108,2713,5033,6064,6831,222,2264,6561,4613,1024,7179,6159,7307,4973,4221,5418,3624,7704,3400,4483,7567,9489,1805,7624,9826,1651,6779,8402,7231,7096,6716,5339,9809,1749,1404,6640,8323,20,9553,2936,1045,6732,5448,4704,8058,6021,6474,8034,77,9875,8869,7645,9364,675,1621,5542,2326,8401,3944,9557,1849,660,4896,1658,8761,2652,4650,3436,2673,555,6373,70,3640,8173,4774,1698,4194,1249,9732,4272,1124,4954,8269,6840,5629,9890,8734,4307,4643,2678,3864,6492,9691,5112,4502,8452,4117,9152,1889,6790,9708,4614,3212,3348,2787,4338,1398,3333,5587,7482,7605,3063,2436,5874,6255,4417,2117,4989,8724,6760,4020,8940,9605,3711,4053,4107,2163,8170,9612,404,1312,5672,1370,4524,9020,509,5214,6770,3843,802,4252,7800,217,3041,3675,2825,7458,2144,4166,6183,5256,8186,5123,4861,1897,5528,8969,413,3698,4933,7169,1362,605,8540,2238,9625,5401,7453,2747,9244,4607,6999,7045,4824,40,7072,4001,3851,5568,4520,34,824,9058,1509,5686,7308,7038,1007,7721,7088,5940,1242,8451,6545,6134,689,2522,1536,8142,5269,7132,2749,8620,529,3926,5013,7601,4279,8864,3169,8799,5250,346,7858,6759,6032,5166,3797,7039,9239,886,9331,481,9337,5876,2968,6378,8398,4504,4521,19,1636,3622,8639,8518,7548,3652,6119,1828,8868,5641,6979,4118,5987,4837,878,8371,3,4675,1762,5594,1913,1093,6076,7602,6969,9044,3981,1719,9900,4854,1738,7888,8476,377,6406,2377,382,8878,557,9250,871,7536,3369,3210,2374,599,1581,8729,5274,3343,4324,3540,4436,6752,1142,7757,2148,1475,9476,8400,2681,1214,6288,1158,7943,9047,9887,4677,7925,444,3928,8796,7980,3649,2006,6706,4248,9939,1788,5874,3282,2464,5766,4070,9216,6909,8179,7716,4736,4007,6116,7418,1573,8756,4928,9516,7803,4815,4194,5728,5259,4474,876,9591,4475,9234,6298,5075,9173,8086,949,8807,550,6716,9229,6118,9977,7408,186,1065,7767,2654,8483,9340,1410,3411,5209,5566,4578,9403,7646,9837,229,8523,9429,1056,7757,2079,6131,3283,6517,3432,2090,3419,148,7672,5889,6477,1432,6075,7543,9200,8729,2378,8540,6491,2142,3749,2057,6720,9504,9704,6558,9733,4579,2339,7141,2336,770,3272,1971,3639,6705,4062,7058,3205,8086,2947,9683,9518,9022,3578,8718,4103,2308,7259,594,4450,1008,9004,7523,513,8708,433,6598,3287,9124,3740,1975,9894,3364,3947,3533,69,4361,6943,3275,2447,9890,9310,1965,5264,9240,684,5719,7900,7943,6313,2351,5303,5317,9874,2168,377,307,5119,3664,9431,5211,1992,5677,8575,5939,5562,8645,6652,2505,8272,9099,8747,7582,7416,4011,3174,8100,9730,1074,2395,2395,9777,4051,4065,6003,6219,4442,2662,1338,4459,2093,2901,6451,4122,1477,8742,9684,6474,5394,8541,4746,845,7288,8680,8261,7651,1854,2714,3733,9280,5109,6129,9058,5512,6546,5061,1732,988,7724,9422,1799,6169,2324,4602,6644,153,3344,2680,6627,5090,1222,7725,5935,4862,2757,4197,2514,4611,3263,6247,243,8372,8728,9301,3885,5274,715,1969,2615,4791,7743,766,7312,6419,5369,3956,6572,5065,6637,9551,156,7859,7276,6091,9073,33,6640,1587,996,9903,4187,7592,4628,9267,3245,4865,894,3960,3186,9861,5103,929,627,2416,7349,2348,6372,273,7414,3009,9825,3922,7220,3453,6365,6294,9839,3006,4233,7187,9261,4772,4779,241,4040,8025,1458,1286,8337,4644,1147,3441,5574,8126,5857,9275,475,8581,9548,4241,7943,5725,8163,5163,5531,4528,7809,5370,3886,8395,8909,9500,3167,41,9741,3559,4418,1200,1197,2755,2196,2344,2548,4122,6823,4757,3397,7298,3339,9298,1539,7634,1375,6054,2797,6906,582,6959,8628,4469,1706,7538,3969,1225,7579,62,1137,8349,7614,2334,7456,9811,4679,5,3933,1502,1114,3683,5152,805,9333,3043,8439,708,9097,7589,7615,9679,4548,6243,4148,2606,133,4469,3831,4064,4532,4968,2413,2146,7303,9870,8309,8334,6227,8595,6188,7341,2278,1340,8147,7963,4383,2938,8671,9832,527,6286,9511,1427,8882,12,4033,5367,833,7865,9432,5365,2833,8197,3864,136,8067,8525,4822,646,7120,1010,7988,5750,2350,2487,3713,3085,5425,2385,2917,2305,5023,8781,3732,257,5145,7766,5625,5978,1983,5057,7696,4816,9606,7912,1305,7674,6437,6127,8320,3558,3490,2660,9308,2192,1499,9374,5278,6925,1759,4547,5582,3134,9680,9314,9744,1177,3432,5369,7156,5415,6778,4852,6584,6384,9116,7889,410,5553,368,5083,9111,3858,7743,4772,2403,9243,4146,4033,2520,2257,8580,8102,1743,4613,3768,1487,5790,3553,6856,9298,8968,9986,502,5552,2723,9618,9793,3133,5172,6514,8216,4283,6724,2312,5407,9127,7907,9553,3160,427,1810,8093,4881,3554,2706,5001,1393,4848,8554,4602,4147,3875,4588,4649,9427,3663,620,5573,6797,5792,2087,1365,6427,8811,29,1835,4291,7936,1388,7451,4715,9551,5544,5948,9457,4602,950,850,5803,5856,5452,9950,9731,6393,951,5511,56,1571,1084,3205,3715,9523,923,143,4686,952,1978,8977,8889,9718,2781,9956,5621,4677,5905,5078,9280,3207,2281,1435,5415,4085,7737,5147,6830,8688,7010,3239,6612,8094,6444,327,3969,3719,470,8655,4672,8800,7633,9913,4871,414,9869,492,1443,2126,1923,7075,5333,556,8510,749,993,6247,2248,7824,4936,9258,1063,7900,3704,3859,8227,7673,7579,5050,6328,8603,202,313,8516,5073,7079,4737,5566,8523,6864,3841,5598,8549,4397,4109,9298,5390,356,7898,9566,1644,7156,6981,5896,7212,841,4124,4885,4772,5526,1214,3375,5728,7879,1891,802,4959,6628,2720,3482,3492,2913,5432,2042,7310,5893,7692,9052,6250,1943,4971,4246,5451,1952,143,2664,2793,619,7549,3917,2497,5115,7292,8225,2995,5535,5379,4306,2164,4451,4140,2008,7364,9572,402,1026,5466,4447,6431,8068,6390,1402,8666,1841,3354,5161,857,2500,2132,4759,6417,4629,9874,62,9207,9221,5597,938,9879,7761,5390,4019,6122,2754,9944,2876,133,1762,7323,6564,6182,65,7966,4848,8259,7672,6362,9116,6524,8494,3875,9294,9476,102,9356,8683,5675,4953,9621,1907,9067,5011,5926,5189,4118,2222,4417,603,336,1741,7167,6518,1806,1485,7719,6417,5509,4081,5534,2034,2575,5761,1328,2051,2215,684,7086,4243,5637,6708,6150,1056,8071,8428,2597,8541,7003,7015,9144,7339,8756,6311,3858,6914,4148,1577,9684,9658,5658,1570,1692,4585,7331,9372,2989,5899,56,75,6494,2045,3135,2644,3102,1207,7424,5699,9748,4427,9066,5245,1767,7822,1556,1977,1089,5705,3554,773,1715,5564,2343,3407,149,6026,2779,9490,8277,9187,9566,4771,7584,2701,3767,686,260,1192,2738,6361,5619,1804,1606,3738,5979,9514,5715,3420,1571,5621,545,3286,1185,2888,3045,7687,5266,2176,7177,3544,1363,3095,4667,5300,2149,8435,5986,2409,9627,5076,5122,1598,3233,6728,5337,5564,2595,1052,8984,4166,6674,9529,3805,4211,8769,6850,1898,387,5379,9076,283,3094,2171,4951,8394,672,9738,733,3082,9365,5809,4556,7315,5394,7637,2652,958,232,57,6294,750,3083,2175,4555,7294,7296,1406,5545,7684,6785,973,7967,9879,9496,9270,4626,169,9008,5359,9603,4725,1168,4159,2041,2915,1796,1045,225,8380,1102,6520,9131,537,5047,3686,4184,2344,1444,9729,6380,4581,702,699,813,6550,9970,5439,6719,5330,798,6322,56,8318,6834,8449,1233,8630,9494,1459,7011,6949,4331,6142,7486,9378,6180,1670,8074,7625,7751,4454,2206,4805,5154,3019,1356,1476,8458,8075,3158,9256,750,3214,7575,7584,8015,5160,2566,7510,2971,9577,4459,7302,2071,8297,3033,8252,6320,1107,5877,4071,1914,8083,8877,3420,7455,233,4896,5913,4660,8054,1522,5410,7621,9097,9346,1988,609,1913,9498,3581,7842,309,7235,6266,4959,268,4518,1279,7728,6747,5350,9642,1182,4227,9414,8637,812,4310,4551,5473,8716,2425,7235,2689,7874,2934,4678,8483,4847,528,2064,9041,7190,9300,5307,2149,5920,9825,9780,3648,2924,5130,9642,4107,5710,9056,2744,6522,9718,3647,8347,4787,6072,1935,7476,3946,4869,8506,8782,6068,5387,7198,5109,8929,2850,417,1078,8771,6594,7210,8771,9519,2340,4766,9978,4402,3822,2722,925,9893,2722,5624,4680,5146,7559,8508,5445,8780,3367,4227,4848,8754,1425,9958,7683,628,6727,5113,9399,3321,2323,4522,9192,1015,9288,9170,5418,9463,8245,2695,9356,7319,8319,4036,2465,2231,8896,4262,1011,2263,8489,5860,1017,6267,2170,5052,3247,8897,165,2646,8570,2488,3520,4115,3504,2809,9637,8922,2272,7882,1617,1628,1553,6288,2016,4019,4871,912,4633,5883,3176,9475,8095,545,5742,6617,5598,8989,1866,5763,7987,436,4604,7859,903,4460,668,541,9734,9292,4775,7703,7272,6329,3991,5640,6700,8863,6553,1333,1098,6081,808,5545,2978,2902,2162,8576,8243,4028,692,2582,816,1648,442,1720,6108,7462,8613,5842,6755,3388,3545,4027,9717,3888,9668,2769,2751,2573,4103,201,5006,4911,5746,7984,4166,7908,2913,2409,8288,3605,4992,9105,5253,1786,7177,7713,9248,5790,3555,6003,5530,7100,6383,1600,7340,2403,4369,92,1328,8472,293,6334,9736,6040,670,3902,300,3583,2663,8589,3540,4007,4046,8793,5793,1223,6506,1394,3365,6413,7397,8895,9865,132,6847,7206,8887,1217,3650,215,9689,3943,2901,5777,6335,9924,6031,2988,9859,8695,7929,3400,9054,1975,8545,4848,9550,1404,6242,2915,7817,9991,8162,4035,6476,5010,1241,5363,6227,4891,1931,2268,5186,1184,4398,7874,7460,429,7214,7320,5476,5143,720,4531,7118,9265,9379,6668,7021,1973,5935,4839,8316,4097,8874,4792,5459,6467,6508,8038,7710,4791,6659,2896,5975,1057,7122,9788,7838,4336,7108,3315,9479,7828,7846,6597,3445,3577,9617,467,1902,5552,1658,218,6002,6884,5011,7813,9703,7871,5852,7413,2662,2511,309,4989,9920,7432,4777,7758,8120,1885,1073,7600,6065,8919,549,5863,8848,6519,2682,750,2071,692,969,4425,7576,2332,2239,7279,203,8091,4692,9217,6954,1353,4206,6874,5137,5336,4632,3258,3573,2058,7210,5991,7329,7759,1854,6178,630,888,3280,9054,1580,4249,3479,5508,2933,5718,2787,9488,161,3831,8705,3467,1536,9264,341,6674,952,1326,6284,877,9736,3494,6868,7065,7605,5074,9595,8236,5962,2876,3642,7542,3477,7121,3050,2763,9192,2189,2251,5705,2372,7309,9173,261,2925,5866,6935,229,3544,9571,1106,3280,9417,7975,6698,3374,9401,6293,7962,5364,5521,1604,9258,5351,8726,8661,8114,4270,7202,6717,9975,9575,378,9148,9836,9655,5015,3123,9884,4911,9046,7343,8192,8463,1670,4890,1837,1071,7535,6152,2787,9409,7756,2046,1112,6482,7059,5578,752,4261,2295,7080,188,9026,6228,6376,8681,7595,5851,4918,2507,4897,2261,699,9712,3931,1941,7902,5002,5828,4054,7790,1589,1810,6188,2701,4645,3247,8279,1749,3860,6927,8829,4049,5953,1410,425,4634,9005,2629,9552,1512,7526,1813,8563,3591,2096,6856,1493,7099,9037,5547,1241,626,3709,7429,9680,8354,7028,7959,6456,888,4886,5285,1289,839,3047,8067,1826,2053,696,7730,9917,4574,5896,4833,8165,7992,8041,9658,1443,7078,1557,2684,4057,5267,6465,3737,3621,9845,1696,6429,7086,2935,8067,8375,126,1114,2794,1952,3167,3490,6035,9437,4417,1931,4270,2582,6275,8663,2241,7719,5742,3798,6755,9799,5417,9573,3536,5391,5770,1584,1820,9208,4519,9887,3936,4646,1002,6730,2950,521,6573,8985,6310,990,7268,6932,3572,9896,5596,2165,3967,7690,2316,722,7489,7733,6647,7377,9476,8770,5313,1297,7978,9833,7536,1914,831,4890,4997,133,1764,1570,9119,8074,8912,2739,1359,2484,2635,6955,1002,6602,4645,9670,3677,8486,3755,6676,2215,3232,1798,7528,881,9777,7361,8417,8043,4544,3308,3040,4678,5072,962,149,3146,9874,2888,857,8711,1876,7812,9713,4830,8809,5735,4859,7295,9490,7888,5862,9074,9686,3391,9955,5815,7104,8373,3859,1649,8033,3251,6327,3105,4214,2828,2603,4088,2068,3461,2799,3944,7625,8864,5127,6435,951,9986,82,6794,4226,5945,5868,3913,5688,2176,9728,2792,6901,9939,4441,4934,3191,7120,4391,3757,9948,6994,4197,2017,6807,6997,2313,4433,2213,7440,7220,3165,3779,3654,9959,8005,5951,2179,8270,1639,4355,7999,4432,1256,4290,5225,2542,3833,2346,6933,7590,8646,280,1788,7015,7087,5137,9329,7872,3702,3121,1444,3219,6900,5099,3178,1258,1050,1710,9528,9042,6065,3879,3474,3674,8170,5051,6216,2003,7397,9502,5946,2396,9782,4086,9411,3221,5575,8740,7446,9277,8214,8890,2497,5114,341,2027,6372,7744,3737,2253,6786,6155,6132,6612,6181,4302,1663,2397,2658,5413,1899,8604,4161,8033,9042,3572,7607,4617,8665,5053,246,6879,295,9095,8345,6989,7475,1070,4733,7564,3323,7871,3719,9455,835,9900,110,8850,8650,2768,4263,6901,7724,4776,1287,3118,8349,8894,4087,3366,3947,4333,6597,4242,9781,4942,7583,3608,2364,2316,1172,2039,6539,1244,7847,7374,7496,7957,6225,6146,7077,6840,9400,1153,1617,687,4271,6318,9581,4710,9684,3528,5395,2633,4122,5176,3927,1706,8784,6292,374,6309,4683,3266,7553,2530,640,5049,6839,3217,7548,3916,6410,6948,1421,8027,7635,2044,697,7216,6754,381,7096,2150,9366,7570,7326,3293,5628,2463,9585,2355,8772,621,5621,2677,3151,2613,7726,9991,5831,5274,259,2241,2222,1681,6620,6209,3725,7317,9777,480,4050,6873,8982,3416,796,6308,6709,2776,5123,2647,5131,247,3268,752,2924,6419,3366,7003,2762,5549,8629,3022,7790,852,4703,4410,3413,4780,1727,3191,1612,2129,6416,594,5545,7212,3255,2254,9989,4730,1253,5120,4978,4521,2225,4254,7293,1943,1257,55,7492,9887,3077,1634,7091,4132,6044,504,5265,4123,3695,6877,6252,6464,3824,1797,3676,7079,403,17,1809,1657,1490,3139,2530,3715,7394,9823,5658,5003,9879,9502,4890,9308,1136,1981,9793,3532,8838,5058,7655,8885,8287,259,5349,8463,8408,5378,1894,5163,5395,56,6820,6885,3195,5703,6952,6941,5526,8962,1945,1757,8464,3187,1066,9600,1521,859,9484,359,2269,3491,5596,6908,3750,946,1724,8510,2676,3618,26,8071,26,3198,1309,3222,8901,8261,6515,4428,7224,8460,6185,2040,8000,7251,7993,9521,4462,7477,9880,3083,969,5476,6344,1071,2774,4420,5934,5450,8038,5960,9874,8065,9158,1183,7639,8060,5796,506,2488,9372,8967,5025,1413,6967,2277,9406,2840,3091,3235,2720,2527,4204,4548,5223,5276,3675,9643,1210,5477,4033,7170,1703,2098,2680,9238,6089,740,5035,6596,3228,4407,1915,8254,2172,5234,6883,1578,8074,6326,4814,7146,5205,5370,8046,6780,6998,1721,6423,8208,3551,457,1730,5254,8907,4411,4493,1349,1503,5880,4297,1084,287,6212,9338,2460,7798,2573,390,5872,5251,1556,9370,6809,6927,7416,3589,3925,5490,6365,8486,9041,3174,6568,647,2081,7331,1492,9782,8835,7372,4079,9919,4012,6643,5609,6472,4441,8182,6862,6665,9785,4771,6035,6594,1698,9804,184,5623,5294,2901,4109,687,6075,7030,7686,4508,4361,9179,4291,3196,2903,4722,3115,6915,1366,8724,3387,2159,3258,6602,5177,9396,1373,1212,5990,9423,7368,2526,5046,9014,5427,5508,9701,1502,8890,3740,6011,3251,9271,6654,6448,2174,1376,5915,9090,9094,992,8829,1254,4250,1783,6431,3646,3156,3995,5989,8931,7716,4867,330,6730,295,2190,2784,8149,1080,6524,4160,4331,5795,7166,7131,7969,8543,3047,3411,7637,391,2241,5243,4641,4024,8026,4640,3533,8374,6981,2464,6090,1848,2794,2820,8495,4984,5604,6645,6064,2128,7157,6748,4275,4324,3879,8597,9219,3278,2008,3208,3669,601,4804,4663,4626,2830,5655,4511,1204,2636,3327,7294,836,6122,115,5684,7458,2071,2329,9875,4200,5838,2975,4827,6514,6854,3424,2085,6485,1785,5294,154,2386,98,1169,3364,9280,6824,4227,485,5812,7555,4131,3001,29,598,8685,7487,2670,7366,3714,3222,3204,6689,8049,6071,9896,7826,8156,2733,5963,9802,2887,4701,6252,409,4418,5533,7233,8645,2370,9398,6200,6501,2399,6229,3452,7436,69,6122,4802,135,9344,4358,3177,3745,429,3073,7923,8586,5806,3886,4740,5045,4940,993,5454,9358,6526,9040,8003,8896,4790,556,1749,7189,3137,5201,4625,3206,7675,5779,9694,3371,137,2871,7117,567,2296,1392,5505,4454,1631,245,9499,6571,1238,1306,2281,4116,6698,6636,9364,1488,7192,1114,5029,330,2667,6006,9888,6695,1785,9582,66,1922,8805,3535,8841,1101,4928,4346,5555,2911,944,1407,5834,2182,9065,8115,6299,5763,4751,2015,3603,8296,9481,4984,4978,2149,990,1218,5196,9127,7153,5262,7401,5958,5150,6243,7060,6430,6941,8967,9341,7885,374,1527,6420,9439,9642,9071,1554,745,1086,1509,5393,568,2845,371,9069,187,1590,4265,9314,5095,5879,3068,1053,1029,9311,4465,7459,6252,3433,3152,490,159,4679,6910,5951,673,5981,3857,1419,7067,1719,6812,7635,4564,3536,6704,4752,1478,7321,418,6573,3201,3486,3978,582,9149,8444,4394,1754,8229,7546,2244,4740,8578,9154,691,9251,1487,901,7022,8554,2620,187,2542,7184,75,5598,8288,1553,2920,5059,4478,6121,4897,8456,6703,4047,3252,7449,2153,1481,4996,4397,6222,9926,9903,3265,5529,1390,4166,8904,6296,6786,9091,8838,323,5518,4437,4963,7071,3709,6374,1549,6182,1272,5,9237,1671,3258,6687,3824,1091,8035,4573,3665,7961,4476,6931,3490,2218,1097,2394,8514,4236,7837,3705,911,3355,8142,5874,6778,8203,2249,8327,4385,9873,4685,3622,1544,4295,6661,1720,1738,4696,6293,5404,2657,7121,2335,2500,9339,9784,4894,7853,372,9084,1558,1283,8791,6052,3510,5570,607,2111,3897,4992,8336,4934,4967,6232,5581,1628,7952,7320,6325,597,2724,5334,7718,1411,7834,7057,7547,9081,1262,7920,8165,9173,5555,6956,5225,5417,2526,2185,3880,2776,7177,2216,7710,8496,8448,3292,125,2752,6964,2802,3349,9688,8136,1067,1099,5971,8124,8646,5052,9387,2918,9569,4912,8474,6525,6489,3891,5404,8674,4124,4532,2204,6340,8594,700,1141,8238,7177,3893,5202,9979,7243,4890,4468,8310,2341,439,2787,988,1843,8526,3906,1412,3438,8732,4289,9927,8976,6045,8602,3100,577,806,9440,9172,7858,581,7410,5036,4475,2613,5015,8070,3855,9483,6380,6197,6274,5519,7185,4469,4045,7443,2233,7483,2528,6523,3763,1504,8920,2365,4604,9498,9523,396,5022,7381,7330,8784,8769,8157,1397,3785,6227,5253,9620,8959,7802,2247,4479,1339,6716,8524,8782,8950,2360,7662,1825,6123,9166,745,4840,122,6595,715,519,7969,8096,4201,6754,3218,2358,8151,3355,8585,9756,2975,7544,3910,1574,8375,5249,4643,6900,384,3593,9260,8046,1770,1735,7213,8867,6575,3687,5463,7290,558,3432,1738,4759,186,4956,7117,4690,8311,2054,798,7639,5951,4709,9213,4326,9958,3856,7578,342,3801,6838,8389,5571,8573,1954,4439,1500,5641,6254,5142,2552,6038,6881,7311,2577,8189,781,7267,2853,9187,8065,492,5138,9126,6057,5817,9085,6266,3395,5779,6419,6586,520,8343,1511,8826,9134,3012,820,5388,8154,3372,7778,1387,683,355,9577,7816,7622,2430,7004,2040,9274,8494,7518,1683,4311,2955,7949,4059,8735,4369,645,5607,9064,8508,4434,8198,7872,5254,3586,6027,4978,1364,3766,2013,8072,9695,9830,5694,8477,6834,4086,4103,5328,1605,5787,5992,4560,88,51,9647,809,7048,5255,9873,5556,6041,8071,3429,7647,1657,5808,2625,9374,5926,4638,7446,5622,4468,9492,451,7654,9931,4555,2983,7888,342,8975,2448,430,5378,8448,1240,2426,55,1113,4334,6096,9185,4115,3743,7194,9923,6368,2920,5850,1006,6718,7824,1827,2563,4627,9481,2494,9182,8816,382,5876,4143,9182,6307,9521,3982,3899,8299,4037,1364,2634,133,6901,6749,3876,448,3025,6596,3368,5227,3955,6439,9403,5782,9002,4030,5263,7848,3213,432,4582,9089,4575,3764,1748,4097,4099,1999,2396,8136,3364,1382,8270,265,4484,8498,713,7509,5095,434,9088,9050,3225,8491,1184,8579,8873,2799,6427,2086,3231,1009,7528,7807,1125,5628,8256,5224,7628,7004,9713,992,8387,7983,7609,9223,6481,4675,3084,7928,5109,2172,6978,4686,7015,8162,3265,5888,962,9692,4327,4193,7053,1855,8352,4530,7483,6608,6107,5111,3613,5820,2455,8352,155,65,7575,6636,4740,659,4565,6201,9183,7895,7239,6198,2410,504,2086,3372,6548,6413,3917,9953,4620,8622,4483,8456,5230,6942,9919,5195,9114,2375,3547,9269,8792,1122,5906,3532,1781,6823,6085,964,1070,3324,3514,3480,180,1953,3204,6728,8366,3474,3033,9339,2096,3868,7795,3678,811,7714,8874,9925,6441,2421,9195,5233,9896,1453,5117,8029,4628,7554,5346,5698,7230,8860,5531,7410,813,8735,490,5532,2209,3523,4871,657,7392,9018,4336,4555,3084,9562,4480,9526,8335,27,4759,8231,7832,6229,6261,2460,3783,1607,4511,1014,6819,42,8424,7633,8777,8915,9517,7339,8790,4388,7996,2534,9758,8684,7089,9194,8246,7922,8720,2934,7949,9832,1165,2134,6061,7426,4594,9844,5385,5457,7210,2205,5499,5635,6190,629,902,5707,4320,6044,6447,2316,8579,6205,7353,5668,5399,1951,3590,472,4885,7892,304,2403,26,2717,9829,4620,8913,1567,6430,6124,3772,1929,8111,9962,8910,9013,2021,3230,5057,8468,1899,9988,4673,5604,5657,6424,7555,9247,3248,8793,7139,9904,1196,3517,2621,7377,4490,1535,8944,920,4011,9068,9201,2122,5382,8112,7487,7403,7694,2544,5871,9593,8885,6896,5197,4542,9673,9105,141,2921,7898,3633,2826,5446,7150,5447,2823,1640,3334,8120,2560,7345,7188,1762,5819,8923,6226,3306,6326,3920,5851,8550,9866,1088,5446,5063,5630,5119,520,5771,4393,4770,9404,7219,216,2907,9018,3040,4547,2353,1160,7108,6050,4700,5222,1870,3623,1448,5176,6302,1720,7379,4852,1586,8467,6650,3002,449,1770,9874,6221,6163,4645,1977,9734,4861,4884,8752,7901,5784,1105,5413,2892,3508,6466,4466,5378,89,2266,6906,6391,338,638,7595,1925,9105,4246,1279,9555,2368,1153,2128,4883,5798,457,4617,7012,5342,3369,1265,7478,827,6679,6722,687,9497,1188,2417,9586,9806,9323,2330,144,9961,6277,8421,5419,523,9700,1326,9243,7206,3454,4126,9356,263,5095,6368,5605,4817,7634,9435,5644,665,6157,2683,162,7345,5100,6100,7151,775,4782,7296,7089,1060,2069,2508,1583,1770,3834,7179,5328,3640,1305,1036,3903,6401,7405,5861,1218,1391,5296,3214,8408}; vector<int> v9(case9, case9 + (sizeof(case9)/sizeof(int))); // cout << s.maxArea(v9) << endl; return 0; }

[ "liangliang0918@126.com" ]

liangliang0918@126.com

46d2b171557d05f155f1e58cb63f20ea1b31890b

5d734c6385b7bbc70e0eab51bea13f1ff6963197

/Educational DP - Coins.cpp

837050892a83e9c03dc7df136b01ded51c9b546b

[]

no_license

isanchez-aguilar/AtCoder

ce945a13455dd9b2aa95c008e0e3ac84ba09c3d9

d6de3287a980504ebf346a1908fc4f0246683867

refs/heads/master

2021-05-17T05:03:37.065897

2020-04-29T05:02:04

250,638,152

0

null

UTF-8

C++

false

837

cpp

/* * User: Isanchez_Aguilar * Problem: AtCoder Educational DP - Coins */ #include <bits/stdc++.h> using namespace std; int main(void) { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<double> probability(n); for (double& p : probability) cin >> p; vector< vector<double> > dp(n + 1, vector<double>(n + 1, 0.0)); dp[0][0] = 1.0; for (int i = 0; i <= n; ++i) { for (int j = 0; j <= n; ++j) { if (i - 1 >= 0) dp[i][j] += probability[i + j - 1] * dp[i - 1][j]; if (j - 1 >= 0) { dp[i][j] += (1.0f - probability[i + j - 1]) * dp[i][j - 1]; } } } double ans = 0; for (int i = 0; i <= n; ++i) { if (i >= n - i) break; ans += dp[n - i][i]; } cout << fixed << setprecision(9) << ans; return 0; }

[ "noreply@github.com" ]

noreply@github.com

a677222ed5058e30394e7673518279a48bb09c4c

ff381c6e63026bdf54ca6f2b7058c4b5bf7a5d5a

/leetcode/SingleNumber.cpp

6b81e9e95a182521044d00bb1170fbd5081308c7

[]

no_license

wind1900/exercise

6e8380c9cec21668fc88a393106272b0f2dd3a4b

30cb6ebbca5ddb3d5d758dee4ff5a537de2f0120

refs/heads/master

2021-01-23T11:50:28.418440

2014-08-17T05:38:03

20,727,947

1

0

null

UTF-8

C++

false

140

cpp

class Solution { public: int singleNumber(int A[], int n) { int r = 0, i; for (i = 0; i < n; i++) { r ^= A[i]; } return r; } };

[ "weishen1900@gmail.com" ]

weishen1900@gmail.com

30b5758b65fd8bdebbe35b29f67592119c394d49

76171660651f1c680d5b5a380c07635de5b2367c

/SH6_43_msh4/0.37005/rho

c2fd0f2be1a93b5fd130d8ab0eaff03e22628ead

[]

no_license

lisegaAM/SH_Paper1

3cd0cac0d95cc60d296268e65e2dd6fed4cc6127

12ceadba5c58c563ccac236b965b4b917ac47551

refs/heads/master

2021-04-27T19:44:19.527187

2018-02-21T16:16:50

122,360,661

0

null

UTF-8

C++

false

241,519

/*--------------------------------*- C++ -*----------------------------------*\ | ========= | | | \\ / F ield | OpenFOAM: The Open Source CFD Toolbox | | \\ / O peration | Version: 3.0.x | | \\ / A nd | Web: www.OpenFOAM.org | | \\/ M anipulation | | \*---------------------------------------------------------------------------*/ FoamFile { version 2.0; format ascii; class volScalarField; location "0.37005"; object rho; } // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * // dimensions [1 -3 0 0 0 0 0]; internalField nonuniform List<scalar> 27600 ( 50.5357 50.5357 50.5357 50.5357 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5359 50.5359 50.5359 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.5361 50.5361 50.5362 50.5362 50.5362 50.5362 50.5362 50.5362 50.5362 50.5362 50.5362 50.5363 50.5363 50.5363 50.5364 50.5364 50.5364 50.5364 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5365 50.5364 50.538 50.5345 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5371 50.5371 50.5371 50.5371 50.5371 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5389 50.5339 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5371 50.5371 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.539 50.534 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5371 50.5371 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.539 50.5342 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5371 50.5371 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5389 50.5343 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5371 50.5371 50.5371 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5389 50.5345 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5371 50.5371 50.5371 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5373 50.5373 50.5373 50.5373 50.5374 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5388 50.535 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5371 50.5371 50.5371 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5385 50.5352 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5371 50.5371 50.5371 50.5371 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5373 50.5382 50.5353 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5371 50.5371 50.5371 50.5371 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5373 50.5378 50.5354 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5371 50.5371 50.5371 50.5371 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5373 50.5373 50.5359 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5371 50.5371 50.5371 50.5371 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5373 50.5373 50.5367 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5371 50.5371 50.5371 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5373 50.5374 50.5361 50.5398 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5371 50.5371 50.5371 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5373 50.5373 50.5373 50.5373 50.5374 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5373 50.5375 50.5352 50.5449 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5371 50.5371 50.5371 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5373 50.5375 50.5346 50.5495 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5371 50.5371 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5373 50.5376 50.5344 50.5519 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5371 50.5371 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5373 50.5376 50.5341 50.5541 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5371 50.5371 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5373 50.5376 50.5339 50.5562 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5371 50.5371 50.5371 50.5371 50.5371 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5373 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5375 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5374 50.5373 50.5376 50.5336 50.558 50.5357 50.5357 50.5357 50.5357 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5359 50.5359 50.5359 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.5361 50.5361 50.5362 50.5362 50.5362 50.5362 50.5362 50.5362 50.5362 50.5362 50.5362 50.5363 50.5363 50.5363 50.5364 50.5364 50.5364 50.5364 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5367 50.5329 50.5558 50.5662 50.578 50.5814 50.5818 50.5818 50.582 50.582 50.5817 50.5812 50.5805 50.5798 50.5789 50.578 50.5769 50.5757 50.5741 50.5722 50.5696 50.5661 50.5608 50.5663 50.5772 50.581 50.5815 50.5816 50.5819 50.582 50.5818 50.5814 50.5808 50.5802 50.5794 50.5786 50.5775 50.5763 50.5748 50.5729 50.5703 50.5667 50.5613 50.5654 50.5767 50.5805 50.5811 50.5813 50.5815 50.5815 50.5812 50.5807 50.58 50.5793 50.5784 50.5775 50.5764 50.5751 50.5735 50.5715 50.5689 50.5653 50.5597 50.5647 50.5753 50.5789 50.5795 50.5796 50.5798 50.5799 50.5797 50.5793 50.5787 50.578 50.5772 50.5763 50.5753 50.5741 50.5726 50.5706 50.568 50.5644 50.5588 50.5639 50.5741 50.5779 50.5787 50.5789 50.5792 50.5792 50.579 50.5785 50.5778 50.5771 50.5762 50.5753 50.5742 50.5728 50.5712 50.5691 50.5665 50.5628 50.5572 50.563 50.5726 50.5762 50.5767 50.5768 50.577 50.577 50.5768 50.5763 50.5757 50.575 50.5742 50.5733 50.5723 50.5711 50.5695 50.5676 50.565 50.5614 50.5558 50.5603 50.5685 50.572 50.5734 50.5741 50.5747 50.5749 50.5746 50.5741 50.5735 50.5726 50.5716 50.5705 50.5692 50.5676 50.5657 50.5634 50.5604 50.5565 50.5508 50.5552 50.5612 50.5639 50.5646 50.5644 50.564 50.5635 50.563 50.5626 50.562 50.5615 50.5608 50.5599 50.5589 50.5578 50.5563 50.5544 50.5519 50.5485 50.5438 50.5494 50.5533 50.5551 50.5557 50.5561 50.5564 50.5568 50.5567 50.5561 50.5553 50.5543 50.5533 50.5522 50.5509 50.5495 50.5478 50.5458 50.5433 50.5403 50.5366 50.5427 50.5445 50.5453 50.5454 50.5451 50.5444 50.5434 50.5424 50.5417 50.5411 50.5405 50.5397 50.5388 50.5379 50.5368 50.5356 50.5341 50.5324 50.5304 50.5281 50.5348 50.5343 50.5339 50.5334 50.533 50.5328 50.5328 50.5326 50.532 50.5311 50.5301 50.5292 50.5282 50.5272 50.5261 50.525 50.5237 50.5225 50.5212 50.52 50.5256 50.5224 50.5204 50.519 50.5177 50.5161 50.5143 50.5127 50.5116 50.5108 50.51 50.5092 50.5084 50.5077 50.5072 50.5067 50.5065 50.5065 50.5068 50.5078 50.5146 50.5081 50.5044 50.5022 50.5008 50.5001 50.4997 50.499 50.4982 50.4974 50.4965 50.4958 50.4953 50.4948 50.4944 50.4943 50.4944 50.4951 50.4963 50.4989 50.5011 50.4904 50.484 50.4801 50.4765 50.473 50.4699 50.4676 50.4658 50.4644 50.4632 50.4622 50.4616 50.4614 50.4619 50.4629 50.465 50.4679 50.4721 50.4778 50.4909 50.4762 50.4675 50.4631 50.4609 50.4589 50.4569 50.4554 50.4544 50.4535 50.4528 50.4523 50.452 50.4519 50.4519 50.4524 50.4539 50.4568 50.4615 50.4687 50.4881 50.4718 50.4621 50.4569 50.4535 50.4508 50.4482 50.4461 50.4446 50.4433 50.4424 50.4416 50.4411 50.441 50.4412 50.4423 50.4445 50.4482 50.4538 50.4624 50.4854 50.4674 50.4572 50.4526 50.4498 50.4476 50.4455 50.444 50.4429 50.4421 50.4415 50.4412 50.441 50.4412 50.4415 50.4425 50.4443 50.4478 50.4533 50.4615 50.4831 50.4629 50.451 50.4453 50.4418 50.4387 50.436 50.4338 50.4321 50.4307 50.4296 50.4288 50.4282 50.428 50.4283 50.4293 50.4316 50.4356 50.442 50.4516 50.4812 50.4604 50.4487 50.4439 50.4409 50.4386 50.4364 50.435 50.4338 50.4333 50.4328 50.4326 50.4326 50.4331 50.4336 50.4352 50.4372 50.4414 50.4473 50.4561 50.4772 50.4524 50.4399 50.4343 50.4305 50.4273 50.4243 50.4219 50.42 50.4185 50.4172 50.4162 50.4155 50.4151 50.4153 50.4161 50.4182 50.4223 50.4286 50.4383 50.5376 50.5244 50.5206 50.5196 50.5191 50.5189 50.5188 50.5187 50.5187 50.5187 50.5187 50.5187 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5185 50.5185 50.5185 50.5185 50.5185 50.5185 50.5185 50.5185 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5185 50.5185 50.5185 50.5185 50.5186 50.5188 50.5189 50.5191 50.5191 50.5192 50.5192 50.5192 50.5192 50.5191 50.519 50.5184 50.5158 50.5037 50.4546 50.3409 50.2353 50.159 50.1151 50.098 50.0966 50.109 50.1736 50.2925 50.3887 50.4566 50.4995 50.5233 50.5343 50.5379 50.5381 50.5362 50.5312 50.5275 50.525 50.5235 50.5226 50.5221 50.5219 50.5218 50.5217 50.5218 50.5218 50.5219 50.5221 50.5222 50.5224 50.5225 50.5227 50.5229 50.5231 50.5233 50.5236 50.5238 50.5241 50.5244 50.5247 50.525 50.5254 50.5257 50.5261 50.5265 50.5269 50.5273 50.5278 50.5282 50.5287 50.5293 50.5298 50.5304 50.531 50.5316 50.5322 50.5329 50.5336 50.5343 50.5351 50.5359 50.5367 50.5375 50.5384 50.5393 50.5402 50.5412 50.5422 50.5433 50.5443 50.5455 50.5466 50.5478 50.549 50.5503 50.5516 50.5529 50.5543 50.5557 50.5571 50.5586 50.5601 50.5617 50.5632 50.5649 50.5665 50.5682 50.57 50.5718 50.5736 50.5754 50.5773 50.5792 50.5812 50.5832 50.5852 50.5872 50.5893 50.5915 50.5936 50.5958 50.598 50.6003 50.6025 50.6048 50.6072 50.6095 50.6119 50.6143 50.6168 50.6193 50.6218 50.6243 50.6268 50.6294 50.632 50.6346 50.6373 50.6399 50.6427 50.6451 50.6479 50.6477 50.6661 50.5389 50.5259 50.5222 50.5211 50.5207 50.5205 50.5204 50.5204 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5204 50.5204 50.5204 50.5204 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5204 50.5204 50.5204 50.5204 50.5204 50.5204 50.5204 50.5205 50.5205 50.5206 50.5206 50.5206 50.5206 50.5206 50.5206 50.5207 50.5211 50.5218 50.5224 50.5228 50.5229 50.5229 50.5226 50.5205 50.51 50.4779 50.4424 50.4182 50.4061 50.4031 50.4047 50.4167 50.4486 50.4777 50.4983 50.5116 50.5191 50.5228 50.5243 50.5246 50.5246 50.5241 50.5234 50.523 50.5228 50.5227 50.5226 50.5227 50.5227 50.5228 50.5229 50.523 50.5231 50.5233 50.5235 50.5237 50.5239 50.5241 50.5243 50.5245 50.5248 50.5251 50.5253 50.5256 50.526 50.5263 50.5267 50.527 50.5274 50.5278 50.5283 50.5287 50.5292 50.5297 50.5302 50.5307 50.5313 50.5319 50.5325 50.5332 50.5338 50.5345 50.5353 50.536 50.5368 50.5376 50.5385 50.5393 50.5402 50.5412 50.5422 50.5432 50.5442 50.5453 50.5464 50.5476 50.5487 50.55 50.5512 50.5525 50.5538 50.5552 50.5566 50.558 50.5595 50.561 50.5626 50.5642 50.5658 50.5675 50.5692 50.5709 50.5727 50.5745 50.5764 50.5782 50.5802 50.5821 50.5841 50.5861 50.5882 50.5903 50.5924 50.5946 50.5967 50.599 50.6012 50.6035 50.6058 50.6081 50.6105 50.6129 50.6153 50.6177 50.6202 50.6227 50.6252 50.6278 50.6303 50.6329 50.6356 50.6382 50.6408 50.6437 50.646 50.6488 50.6484 50.6686 50.5382 50.5254 50.5216 50.5205 50.5201 50.5198 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5197 50.5197 50.5197 50.5198 50.5198 50.5198 50.5198 50.5199 50.5201 50.5202 50.5203 50.5203 50.5203 50.5203 50.5203 50.5203 50.5206 50.5218 50.5264 50.5328 50.5371 50.539 50.5393 50.5387 50.5344 50.5213 50.5081 50.4999 50.4962 50.4956 50.4963 50.4999 50.5066 50.512 50.5159 50.5185 50.5202 50.5212 50.5218 50.5222 50.5223 50.5225 50.5226 50.5226 50.5227 50.5227 50.5228 50.5229 50.523 50.5232 50.5233 50.5235 50.5237 50.5239 50.5241 50.5243 50.5245 50.5248 50.5251 50.5254 50.5257 50.526 50.5263 50.5267 50.527 50.5274 50.5278 50.5283 50.5287 50.5292 50.5297 50.5302 50.5308 50.5313 50.5319 50.5325 50.5332 50.5338 50.5345 50.5353 50.536 50.5368 50.5376 50.5385 50.5393 50.5403 50.5412 50.5422 50.5432 50.5442 50.5453 50.5464 50.5476 50.5487 50.55 50.5512 50.5525 50.5538 50.5552 50.5566 50.5581 50.5595 50.561 50.5626 50.5642 50.5658 50.5675 50.5692 50.5709 50.5727 50.5745 50.5764 50.5783 50.5802 50.5821 50.5841 50.5861 50.5882 50.5903 50.5924 50.5946 50.5967 50.599 50.6012 50.6035 50.6058 50.6081 50.6105 50.6129 50.6153 50.6177 50.6202 50.6227 50.6252 50.6278 50.6303 50.6329 50.6356 50.6382 50.6408 50.6437 50.646 50.6488 50.6486 50.667 50.538 50.5255 50.5217 50.5207 50.5203 50.5201 50.52 50.52 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.5199 50.52 50.52 50.52 50.52 50.52 50.5201 50.5203 50.5204 50.5204 50.5204 50.5204 50.5204 50.5204 50.5205 50.5207 50.522 50.527 50.537 50.5451 50.5501 50.5524 50.5528 50.552 50.5469 50.5342 50.5234 50.5164 50.5128 50.5116 50.5116 50.5125 50.5152 50.5177 50.5195 50.5207 50.5215 50.5219 50.5222 50.5224 50.5225 50.5226 50.5227 50.5227 50.5228 50.5229 50.523 50.5232 50.5233 50.5235 50.5237 50.5239 50.5241 50.5243 50.5245 50.5248 50.5251 50.5254 50.5257 50.526 50.5263 50.5267 50.527 50.5274 50.5278 50.5283 50.5287 50.5292 50.5297 50.5302 50.5308 50.5313 50.5319 50.5325 50.5332 50.5338 50.5345 50.5353 50.536 50.5368 50.5376 50.5385 50.5393 50.5403 50.5412 50.5422 50.5432 50.5442 50.5453 50.5464 50.5476 50.5487 50.55 50.5512 50.5525 50.5538 50.5552 50.5566 50.5581 50.5595 50.561 50.5626 50.5642 50.5658 50.5675 50.5692 50.5709 50.5727 50.5745 50.5764 50.5783 50.5802 50.5821 50.5841 50.5861 50.5882 50.5903 50.5924 50.5946 50.5967 50.599 50.6012 50.6035 50.6058 50.6081 50.6105 50.6129 50.6153 50.6177 50.6202 50.6227 50.6252 50.6278 50.6303 50.6329 50.6356 50.6382 50.6408 50.6437 50.646 50.6488 50.6488 50.6653 50.5374 50.5253 50.5216 50.5205 50.5201 50.5199 50.5198 50.5197 50.5197 50.5197 50.5197 50.5197 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5195 50.5195 50.5195 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5197 50.5197 50.5197 50.5197 50.5197 50.5199 50.52 50.52 50.5201 50.5201 50.5201 50.52 50.52 50.5201 50.5204 50.5217 50.527 50.5376 50.5466 50.5528 50.5561 50.5571 50.557 50.5545 50.5449 50.5331 50.5246 50.5193 50.5167 50.5158 50.5158 50.5164 50.5181 50.5197 50.5208 50.5215 50.522 50.5222 50.5224 50.5225 50.5226 50.5226 50.5227 50.5228 50.5229 50.523 50.5232 50.5233 50.5235 50.5237 50.5239 50.5241 50.5243 50.5245 50.5248 50.5251 50.5254 50.5257 50.526 50.5263 50.5267 50.527 50.5274 50.5278 50.5283 50.5287 50.5292 50.5297 50.5302 50.5308 50.5313 50.5319 50.5325 50.5332 50.5338 50.5345 50.5353 50.536 50.5368 50.5376 50.5385 50.5393 50.5403 50.5412 50.5422 50.5432 50.5442 50.5453 50.5464 50.5476 50.5487 50.55 50.5512 50.5525 50.5538 50.5552 50.5566 50.5581 50.5595 50.561 50.5626 50.5642 50.5658 50.5675 50.5692 50.5709 50.5727 50.5745 50.5764 50.5783 50.5802 50.5821 50.5841 50.5861 50.5882 50.5903 50.5924 50.5946 50.5967 50.599 50.6012 50.6035 50.6058 50.6081 50.6105 50.6129 50.6153 50.6177 50.6202 50.6227 50.6252 50.6278 50.6303 50.6329 50.6356 50.6382 50.6408 50.6437 50.646 50.6487 50.649 50.6634 50.5368 50.525 50.5213 50.5202 50.5199 50.5197 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5195 50.5195 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5196 50.5196 50.5196 50.5196 50.5196 50.5196 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5195 50.5196 50.5195 50.5195 50.5196 50.5196 50.5197 50.5198 50.5198 50.5198 50.5198 50.5198 50.5198 50.5198 50.5198 50.5201 50.5213 50.5263 50.5361 50.5446 50.5507 50.554 50.5552 50.5552 50.5536 50.5464 50.5363 50.5288 50.5238 50.5209 50.5196 50.5193 50.5194 50.5198 50.5207 50.5214 50.5218 50.5221 50.5223 50.5224 50.5225 50.5226 50.5226 50.5227 50.5228 50.5229 50.523 50.5232 50.5233 50.5235 50.5237 50.5239 50.5241 50.5243 50.5245 50.5248 50.5251 50.5254 50.5257 50.526 50.5263 50.5267 50.527 50.5274 50.5278 50.5283 50.5287 50.5292 50.5297 50.5302 50.5308 50.5313 50.5319 50.5325 50.5332 50.5338 50.5345 50.5353 50.536 50.5368 50.5376 50.5385 50.5393 50.5403 50.5412 50.5422 50.5432 50.5442 50.5453 50.5464 50.5476 50.5487 50.55 50.5512 50.5525 50.5538 50.5552 50.5566 50.5581 50.5595 50.561 50.5626 50.5642 50.5658 50.5675 50.5692 50.5709 50.5727 50.5745 50.5764 50.5783 50.5802 50.5821 50.5841 50.5861 50.5882 50.5903 50.5924 50.5946 50.5967 50.599 50.6012 50.6035 50.6058 50.6081 50.6105 50.6129 50.6153 50.6177 50.6202 50.6227 50.6252 50.6278 50.6303 50.6329 50.6356 50.6382 50.6408 50.6437 50.646 50.6487 50.6492 50.6614 50.5347 50.5247 50.5215 50.5205 50.5199 50.5196 50.5194 50.5193 50.5193 50.5192 50.5192 50.5192 50.5192 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5191 50.5192 50.5192 50.5193 50.5193 50.5194 50.5194 50.5194 50.5193 50.5193 50.5193 50.5193 50.5196 50.5206 50.5243 50.5306 50.5358 50.5395 50.5415 50.5422 50.5422 50.5412 50.5368 50.5312 50.527 50.5242 50.5226 50.5218 50.5215 50.5215 50.5216 50.5218 50.522 50.5221 50.5222 50.5223 50.5224 50.5224 50.5225 50.5226 50.5226 50.5227 50.5229 50.523 50.5231 50.5233 50.5235 50.5237 50.5239 50.5241 50.5243 50.5245 50.5248 50.5251 50.5254 50.5257 50.526 50.5263 50.5267 50.527 50.5274 50.5278 50.5283 50.5287 50.5292 50.5297 50.5302 50.5308 50.5313 50.5319 50.5325 50.5332 50.5338 50.5345 50.5353 50.536 50.5368 50.5376 50.5385 50.5393 50.5403 50.5412 50.5422 50.5432 50.5442 50.5453 50.5464 50.5476 50.5487 50.55 50.5512 50.5525 50.5538 50.5552 50.5566 50.5581 50.5595 50.561 50.5626 50.5642 50.5658 50.5675 50.5692 50.5709 50.5727 50.5745 50.5764 50.5783 50.5802 50.5821 50.5841 50.5861 50.5882 50.5903 50.5924 50.5946 50.5967 50.599 50.6012 50.6035 50.6058 50.6081 50.6105 50.6129 50.6153 50.6177 50.6202 50.6227 50.6252 50.6278 50.6303 50.6329 50.6356 50.6382 50.6408 50.6437 50.646 50.6487 50.6497 50.6578 50.531 50.5229 50.5197 50.5184 50.5182 50.5183 50.5184 50.5185 50.5186 50.5187 50.5187 50.5187 50.5187 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5187 50.5187 50.5187 50.5187 50.5187 50.5187 50.5187 50.5187 50.5187 50.5187 50.5187 50.5187 50.5187 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5188 50.5187 50.5187 50.5187 50.5187 50.5187 50.5187 50.5188 50.5187 50.5187 50.5187 50.5186 50.5186 50.5186 50.5186 50.5188 50.5196 50.5222 50.5258 50.5286 50.5306 50.5316 50.532 50.532 50.5314 50.5291 50.5265 50.5246 50.5234 50.5227 50.5223 50.5221 50.5221 50.5221 50.5221 50.5221 50.5222 50.5222 50.5222 50.5223 50.5223 50.5224 50.5225 50.5226 50.5227 50.5228 50.523 50.5231 50.5233 50.5235 50.5236 50.5238 50.5241 50.5243 50.5245 50.5248 50.5251 50.5254 50.5257 50.526 50.5263 50.5267 50.527 50.5274 50.5278 50.5283 50.5287 50.5292 50.5297 50.5302 50.5308 50.5313 50.5319 50.5325 50.5332 50.5338 50.5345 50.5353 50.536 50.5368 50.5376 50.5385 50.5393 50.5403 50.5412 50.5422 50.5432 50.5442 50.5453 50.5464 50.5476 50.5487 50.55 50.5512 50.5525 50.5538 50.5552 50.5566 50.5581 50.5595 50.561 50.5626 50.5642 50.5658 50.5675 50.5692 50.5709 50.5727 50.5745 50.5764 50.5783 50.5802 50.5821 50.5841 50.5861 50.5882 50.5903 50.5924 50.5946 50.5967 50.599 50.6012 50.6035 50.6058 50.6081 50.6105 50.6129 50.6153 50.6177 50.6202 50.6227 50.6252 50.6278 50.6303 50.6329 50.6356 50.6382 50.6408 50.6437 50.6461 50.6487 50.6503 50.6543 50.5265 50.5211 50.5197 50.5195 50.5192 50.5188 50.5185 50.5184 50.5183 50.5182 50.5182 50.5182 50.5182 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.5181 50.518 50.518 50.518 50.518 50.518 50.518 50.518 50.5179 50.5178 50.5177 50.5176 50.5176 50.5176 50.5177 50.518 50.5195 50.522 50.5243 50.5259 50.527 50.5275 50.5277 50.5277 50.5272 50.5258 50.5245 50.5236 50.5229 50.5225 50.5222 50.5221 50.522 50.522 50.522 50.522 50.522 50.5221 50.5221 50.5222 50.5222 50.5223 50.5224 50.5225 50.5227 50.5228 50.5229 50.5231 50.5233 50.5234 50.5236 50.5238 50.5241 50.5243 50.5245 50.5248 50.5251 50.5253 50.5257 50.526 50.5263 50.5267 50.527 50.5274 50.5278 50.5283 50.5287 50.5292 50.5297 50.5302 50.5308 50.5313 50.5319 50.5325 50.5332 50.5338 50.5345 50.5353 50.536 50.5368 50.5376 50.5385 50.5393 50.5403 50.5412 50.5422 50.5432 50.5442 50.5453 50.5464 50.5476 50.5487 50.55 50.5512 50.5525 50.5538 50.5552 50.5566 50.5581 50.5595 50.561 50.5626 50.5642 50.5658 50.5675 50.5692 50.5709 50.5727 50.5745 50.5764 50.5783 50.5802 50.5821 50.5841 50.5861 50.5882 50.5903 50.5924 50.5946 50.5967 50.599 50.6012 50.6035 50.6058 50.6081 50.6105 50.6129 50.6153 50.6177 50.6202 50.6227 50.6252 50.6278 50.6303 50.6329 50.6356 50.6382 50.6408 50.6436 50.6463 50.6488 50.6509 50.653 50.5213 50.5186 50.5173 50.5164 50.5164 50.5167 50.5169 50.517 50.5171 50.5172 50.5173 50.5173 50.5173 50.5174 50.5174 50.5174 50.5174 50.5174 50.5173 50.5173 50.5173 50.5174 50.5174 50.5174 50.5174 50.5174 50.5174 50.5174 50.5174 50.5174 50.5174 50.5174 50.5174 50.5174 50.5174 50.5174 50.5174 50.5174 50.5174 50.5173 50.5173 50.5173 50.5173 50.5173 50.5173 50.5173 50.5173 50.5173 50.5173 50.5173 50.5173 50.5173 50.5173 50.5173 50.5173 50.5173 50.5173 50.5173 50.5173 50.5173 50.5173 50.5173 50.5172 50.5172 50.5172 50.5171 50.5169 50.5169 50.5168 50.5168 50.5168 50.5169 50.5173 50.5189 50.5209 50.5226 50.5238 50.5246 50.525 50.5251 50.5252 50.5249 50.5242 50.5235 50.5229 50.5225 50.5222 50.522 50.5219 50.5218 50.5218 50.5218 50.5218 50.5219 50.5219 50.522 50.5221 50.5222 50.5223 50.5224 50.5225 50.5226 50.5228 50.5229 50.5231 50.5232 50.5234 50.5236 50.5238 50.5241 50.5243 50.5245 50.5248 50.5251 50.5253 50.5257 50.526 50.5263 50.5267 50.527 50.5274 50.5278 50.5283 50.5287 50.5292 50.5297 50.5302 50.5308 50.5313 50.5319 50.5325 50.5332 50.5338 50.5345 50.5353 50.536 50.5368 50.5376 50.5385 50.5393 50.5403 50.5412 50.5422 50.5432 50.5442 50.5453 50.5464 50.5476 50.5487 50.55 50.5512 50.5525 50.5538 50.5552 50.5566 50.5581 50.5595 50.561 50.5626 50.5642 50.5658 50.5675 50.5692 50.5709 50.5727 50.5745 50.5764 50.5783 50.5802 50.5821 50.5841 50.5861 50.5882 50.5903 50.5924 50.5946 50.5967 50.599 50.6012 50.6035 50.6058 50.6081 50.6105 50.6129 50.6153 50.6177 50.6202 50.6227 50.6252 50.6278 50.6303 50.6329 50.6356 50.6382 50.6409 50.6435 50.6464 50.6489 50.6517 50.6532 50.5162 50.5169 50.5179 50.5184 50.5181 50.5177 50.5175 50.5174 50.5173 50.5172 50.5172 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.5171 50.517 50.517 50.517 50.517 50.517 50.5169 50.5169 50.5169 50.5169 50.5168 50.5167 50.5165 50.5163 50.5161 50.516 50.516 50.516 50.516 50.5163 50.5174 50.5196 50.5216 50.5231 50.5241 50.5247 50.5249 50.525 50.525 50.5246 50.5238 50.5232 50.5227 50.5223 50.522 50.5218 50.5217 50.5216 50.5216 50.5216 50.5216 50.5217 50.5218 50.5219 50.522 50.5221 50.5222 50.5223 50.5224 50.5226 50.5227 50.5229 50.5231 50.5232 50.5234 50.5236 50.5238 50.524 50.5243 50.5245 50.5248 50.5251 50.5253 50.5257 50.526 50.5263 50.5267 50.527 50.5274 50.5278 50.5283 50.5287 50.5292 50.5297 50.5302 50.5308 50.5313 50.5319 50.5325 50.5332 50.5338 50.5345 50.5353 50.536 50.5368 50.5376 50.5385 50.5393 50.5403 50.5412 50.5422 50.5432 50.5442 50.5453 50.5464 50.5476 50.5487 50.55 50.5512 50.5525 50.5538 50.5552 50.5566 50.5581 50.5595 50.561 50.5626 50.5642 50.5658 50.5675 50.5692 50.5709 50.5727 50.5745 50.5764 50.5783 50.5802 50.5821 50.5841 50.5861 50.5882 50.5903 50.5924 50.5946 50.5967 50.599 50.6012 50.6035 50.6058 50.6081 50.6105 50.6129 50.6153 50.6177 50.6202 50.6227 50.6252 50.6278 50.6304 50.6329 50.6356 50.6382 50.6409 50.6435 50.6464 50.649 50.6523 50.6535 50.5098 50.5133 50.5143 50.5144 50.5148 50.5152 50.5155 50.5156 50.5157 50.5158 50.5159 50.5159 50.5159 50.5159 50.5159 50.516 50.516 50.516 50.516 50.516 50.516 50.516 50.516 50.516 50.516 50.516 50.516 50.516 50.516 50.516 50.516 50.516 50.516 50.5159 50.5159 50.5159 50.5159 50.516 50.516 50.516 50.516 50.516 50.516 50.516 50.5159 50.5159 50.5159 50.5159 50.5159 50.5159 50.5159 50.5159 50.5159 50.516 50.5159 50.5159 50.5159 50.5159 50.5159 50.5159 50.5159 50.5159 50.5158 50.5158 50.5156 50.5156 50.5155 50.5155 50.5155 50.5156 50.5161 50.518 50.5204 50.5225 50.524 50.525 50.5256 50.5259 50.526 50.526 50.5255 50.5246 50.5237 50.523 50.5224 50.522 50.5217 50.5215 50.5214 50.5214 50.5214 50.5214 50.5215 50.5215 50.5216 50.5217 50.5219 50.522 50.5221 50.5223 50.5224 50.5226 50.5227 50.5229 50.523 50.5232 50.5234 50.5236 50.5238 50.524 50.5243 50.5245 50.5248 50.5251 50.5253 50.5257 50.526 50.5263 50.5267 50.527 50.5274 50.5278 50.5283 50.5287 50.5292 50.5297 50.5302 50.5308 50.5313 50.5319 50.5325 50.5332 50.5338 50.5345 50.5353 50.536 50.5368 50.5376 50.5385 50.5393 50.5403 50.5412 50.5422 50.5432 50.5442 50.5453 50.5464 50.5476 50.5487 50.55 50.5512 50.5525 50.5538 50.5552 50.5566 50.5581 50.5595 50.561 50.5626 50.5642 50.5658 50.5675 50.5692 50.5709 50.5727 50.5745 50.5764 50.5783 50.5802 50.5821 50.5841 50.5861 50.5882 50.5903 50.5924 50.5946 50.5967 50.599 50.6012 50.6035 50.6058 50.6081 50.6105 50.6129 50.6153 50.6177 50.6202 50.6227 50.6252 50.6278 50.6303 50.6329 50.6356 50.6382 50.6409 50.6435 50.6465 50.6492 50.6529 50.6543 50.5059 50.5135 50.5168 50.5176 50.5174 50.5172 50.517 50.5169 50.5168 50.5167 50.5167 50.5167 50.5167 50.5167 50.5167 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5166 50.5165 50.5165 50.5164 50.5164 50.5163 50.5163 50.5162 50.5161 50.5159 50.5157 50.5156 50.5155 50.5155 50.5155 50.5158 50.5168 50.5195 50.5224 50.5249 50.5267 50.5278 50.5285 50.5287 50.5288 50.5287 50.5279 50.5263 50.5249 50.5238 50.5229 50.5223 50.5218 50.5215 50.5213 50.5212 50.5212 50.5212 50.5212 50.5213 50.5214 50.5215 50.5217 50.5218 50.5219 50.5221 50.5222 50.5224 50.5225 50.5227 50.5229 50.523 50.5232 50.5234 50.5236 50.5238 50.524 50.5243 50.5245 50.5248 50.5251 50.5253 50.5257 50.526 50.5263 50.5267 50.527 50.5274 50.5278 50.5283 50.5287 50.5292 50.5297 50.5302 50.5308 50.5313 50.5319 50.5325 50.5332 50.5338 50.5345 50.5353 50.536 50.5368 50.5376 50.5385 50.5393 50.5403 50.5412 50.5422 50.5432 50.5442 50.5453 50.5464 50.5476 50.5487 50.55 50.5512 50.5525 50.5538 50.5552 50.5566 50.5581 50.5595 50.561 50.5626 50.5642 50.5658 50.5675 50.5692 50.5709 50.5727 50.5745 50.5764 50.5783 50.5802 50.5821 50.5841 50.5861 50.5882 50.5903 50.5924 50.5946 50.5967 50.599 50.6012 50.6035 50.6058 50.6081 50.6105 50.6129 50.6153 50.6177 50.6202 50.6227 50.6252 50.6278 50.6303 50.6329 50.6356 50.6382 50.641 50.6436 50.6465 50.6493 50.6534 50.6549 50.4969 50.5074 50.5105 50.512 50.5128 50.5132 50.5134 50.5135 50.5136 50.5136 50.5137 50.5137 50.5137 50.5137 50.5137 50.5138 50.5138 50.5138 50.5137 50.5137 50.5137 50.5137 50.5137 50.5137 50.5137 50.5137 50.5137 50.5137 50.5137 50.5137 50.5137 50.5137 50.5137 50.5137 50.5138 50.5138 50.5138 50.5138 50.5138 50.5138 50.5138 50.5137 50.5137 50.5137 50.5137 50.5137 50.5137 50.5137 50.5138 50.5138 50.5138 50.5138 50.5138 50.5138 50.5138 50.5138 50.5138 50.5138 50.5138 50.5138 50.5137 50.5137 50.5137 50.5136 50.5137 50.5139 50.5149 50.5186 50.5239 50.5283 50.5316 50.5337 50.5349 50.5353 50.5354 50.5353 50.5344 50.532 50.5296 50.5276 50.5258 50.5244 50.5233 50.5225 50.5218 50.5214 50.5212 50.521 50.5209 50.5209 50.521 50.521 50.5211 50.5212 50.5214 50.5216 50.5217 50.5219 50.522 50.5222 50.5223 50.5225 50.5227 50.5228 50.523 50.5232 50.5234 50.5236 50.5238 50.524 50.5243 50.5245 50.5248 50.5251 50.5253 50.5257 50.526 50.5263 50.5267 50.527 50.5274 50.5278 50.5283 50.5287 50.5292 50.5297 50.5302 50.5308 50.5313 50.5319 50.5325 50.5332 50.5338 50.5345 50.5353 50.536 50.5368 50.5376 50.5385 50.5393 50.5403 50.5412 50.5422 50.5432 50.5442 50.5453 50.5464 50.5476 50.5487 50.55 50.5512 50.5525 50.5538 50.5552 50.5566 50.5581 50.5595 50.561 50.5626 50.5642 50.5658 50.5675 50.5692 50.5709 50.5727 50.5745 50.5764 50.5783 50.5802 50.5821 50.5841 50.5861 50.5882 50.5903 50.5924 50.5946 50.5967 50.599 50.6012 50.6035 50.6058 50.6081 50.6105 50.6129 50.6153 50.6177 50.6202 50.6227 50.6252 50.6278 50.6303 50.6329 50.6356 50.6382 50.641 50.6436 50.6465 50.6494 50.6538 50.6552 50.4978 50.5117 50.5155 50.5165 50.5169 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.517 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5168 50.5168 50.5168 50.5167 50.5167 50.5165 50.5162 50.516 50.5159 50.5159 50.5159 50.5166 50.5195 50.5261 50.5319 50.5361 50.5385 50.5396 50.5399 50.5398 50.5386 50.5352 50.5316 50.5287 50.5265 50.5248 50.5235 50.5226 50.5219 50.5214 50.5211 50.521 50.5209 50.5209 50.5209 50.521 50.5211 50.5212 50.5214 50.5215 50.5217 50.5218 50.522 50.5222 50.5223 50.5225 50.5227 50.5228 50.523 50.5232 50.5234 50.5236 50.5238 50.524 50.5243 50.5245 50.5248 50.5251 50.5253 50.5257 50.526 50.5263 50.5267 50.527 50.5274 50.5278 50.5283 50.5287 50.5292 50.5297 50.5302 50.5308 50.5313 50.5319 50.5325 50.5332 50.5338 50.5345 50.5353 50.536 50.5368 50.5376 50.5385 50.5393 50.5403 50.5412 50.5422 50.5432 50.5442 50.5453 50.5464 50.5476 50.5487 50.55 50.5512 50.5525 50.5538 50.5552 50.5566 50.5581 50.5595 50.561 50.5626 50.5642 50.5658 50.5675 50.5692 50.5709 50.5727 50.5745 50.5764 50.5783 50.5802 50.5821 50.5841 50.5861 50.5882 50.5903 50.5924 50.5946 50.5967 50.599 50.6012 50.6035 50.6058 50.6081 50.6105 50.6129 50.6153 50.6177 50.6202 50.6227 50.6252 50.6278 50.6303 50.6329 50.6356 50.6382 50.641 50.6436 50.6465 50.6494 50.6539 50.6549 50.4963 50.5108 50.5147 50.516 50.5165 50.5168 50.5168 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.517 50.517 50.517 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.517 50.517 50.517 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5169 50.5168 50.5168 50.5168 50.5168 50.5167 50.5166 50.5163 50.5159 50.5156 50.5155 50.5155 50.5159 50.518 50.524 50.5305 50.5352 50.5382 50.5397 50.5401 50.5401 50.5393 50.5363 50.5326 50.5295 50.5271 50.5252 50.5238 50.5227 50.522 50.5215 50.5211 50.521 50.5209 50.5208 50.5209 50.5209 50.521 50.5212 50.5213 50.5215 50.5217 50.5218 50.522 50.5222 50.5223 50.5225 50.5227 50.5228 50.523 50.5232 50.5234 50.5236 50.5238 50.524 50.5243 50.5245 50.5248 50.5251 50.5253 50.5257 50.526 50.5263 50.5267 50.527 50.5274 50.5278 50.5283 50.5287 50.5292 50.5297 50.5302 50.5308 50.5313 50.5319 50.5325 50.5332 50.5338 50.5345 50.5353 50.536 50.5368 50.5376 50.5385 50.5393 50.5403 50.5412 50.5422 50.5432 50.5442 50.5453 50.5464 50.5476 50.5487 50.55 50.5512 50.5525 50.5538 50.5552 50.5566 50.5581 50.5595 50.561 50.5626 50.5642 50.5658 50.5675 50.5692 50.5709 50.5727 50.5745 50.5764 50.5783 50.5802 50.5821 50.5841 50.5861 50.5882 50.5903 50.5924 50.5946 50.5967 50.599 50.6012 50.6035 50.6058 50.6081 50.6105 50.6129 50.6153 50.6177 50.6202 50.6227 50.6252 50.6278 50.6303 50.6329 50.6356 50.6382 50.641 50.6436 50.6465 50.6494 50.654 50.6548 50.4982 50.513 50.5168 50.5179 50.5183 50.5184 50.5185 50.5185 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5185 50.5185 50.5185 50.5185 50.5185 50.5185 50.5185 50.5185 50.5184 50.5184 50.5185 50.5185 50.5185 50.5185 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5185 50.5185 50.5185 50.5185 50.5185 50.5185 50.5185 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5183 50.5183 50.5183 50.5183 50.5183 50.5182 50.5181 50.518 50.5179 50.5179 50.5178 50.5176 50.517 50.5156 50.5146 50.5141 50.514 50.5144 50.5164 50.5227 50.529 50.5334 50.5361 50.5372 50.5375 50.5374 50.536 50.5327 50.5296 50.5272 50.5253 50.5238 50.5227 50.522 50.5214 50.5211 50.5209 50.5208 50.5208 50.5208 50.5209 50.521 50.5212 50.5213 50.5215 50.5217 50.5218 50.522 50.5221 50.5223 50.5225 50.5227 50.5228 50.523 50.5232 50.5234 50.5236 50.5238 50.524 50.5243 50.5245 50.5248 50.5251 50.5253 50.5257 50.526 50.5263 50.5267 50.527 50.5274 50.5278 50.5283 50.5287 50.5292 50.5297 50.5302 50.5308 50.5313 50.5319 50.5325 50.5332 50.5338 50.5345 50.5353 50.536 50.5368 50.5376 50.5385 50.5393 50.5403 50.5412 50.5422 50.5432 50.5442 50.5453 50.5464 50.5476 50.5487 50.55 50.5512 50.5525 50.5538 50.5552 50.5566 50.5581 50.5595 50.561 50.5626 50.5642 50.5658 50.5675 50.5692 50.5709 50.5727 50.5745 50.5764 50.5783 50.5802 50.5821 50.5841 50.5861 50.5882 50.5903 50.5924 50.5946 50.5967 50.599 50.6012 50.6035 50.6058 50.6081 50.6105 50.6129 50.6153 50.6177 50.6202 50.6227 50.6252 50.6278 50.6303 50.6329 50.6356 50.6382 50.641 50.6436 50.6465 50.6494 50.654 50.6547 50.4941 50.5101 50.5143 50.5155 50.516 50.5163 50.5163 50.5163 50.5163 50.5163 50.5163 50.5163 50.5163 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5164 50.5165 50.5165 50.5165 50.5165 50.5165 50.5165 50.5165 50.5165 50.5165 50.5165 50.5165 50.5165 50.5165 50.5165 50.5165 50.5165 50.5165 50.5165 50.5164 50.5163 50.5162 50.5162 50.5162 50.5161 50.5159 50.5152 50.5128 50.5099 50.508 50.5071 50.5068 50.5071 50.5091 50.5153 50.5214 50.5259 50.5287 50.5301 50.5305 50.5306 50.53 50.5282 50.5262 50.5246 50.5234 50.5224 50.5217 50.5213 50.521 50.5208 50.5207 50.5207 50.5208 50.5209 50.521 50.5211 50.5213 50.5215 50.5216 50.5218 50.522 50.5221 50.5223 50.5225 50.5227 50.5228 50.523 50.5232 50.5234 50.5236 50.5238 50.524 50.5243 50.5245 50.5248 50.5251 50.5253 50.5256 50.526 50.5263 50.5267 50.527 50.5274 50.5278 50.5283 50.5287 50.5292 50.5297 50.5302 50.5308 50.5313 50.5319 50.5325 50.5332 50.5338 50.5345 50.5353 50.536 50.5368 50.5376 50.5385 50.5393 50.5403 50.5412 50.5422 50.5432 50.5442 50.5453 50.5464 50.5476 50.5487 50.55 50.5512 50.5525 50.5538 50.5552 50.5566 50.5581 50.5595 50.561 50.5626 50.5642 50.5658 50.5675 50.5692 50.5709 50.5727 50.5745 50.5764 50.5783 50.5802 50.5821 50.5841 50.5861 50.5882 50.5903 50.5924 50.5946 50.5967 50.599 50.6012 50.6035 50.6058 50.6081 50.6105 50.6129 50.6153 50.6177 50.6202 50.6227 50.6252 50.6278 50.6303 50.6329 50.6356 50.6382 50.641 50.6436 50.6465 50.6494 50.654 50.6546 50.499 50.5141 50.5179 50.519 50.5194 50.5196 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5197 50.5196 50.5196 50.5196 50.5195 50.5195 50.5195 50.5195 50.5195 50.5194 50.5194 50.5193 50.5193 50.5192 50.5191 50.5188 50.5186 50.5185 50.5185 50.5185 50.5184 50.5183 50.5171 50.5119 50.5012 50.4929 50.4881 50.4862 50.486 50.487 50.4918 50.4996 50.5059 50.5104 50.5136 50.5156 50.517 50.5179 50.5185 50.519 50.5193 50.5196 50.5199 50.5201 50.5203 50.5205 50.5207 50.5209 50.5211 50.5213 50.5215 50.5216 50.5218 50.522 50.5221 50.5223 50.5225 50.5226 50.5228 50.523 50.5232 50.5234 50.5236 50.5238 50.524 50.5243 50.5245 50.5248 50.525 50.5253 50.5256 50.526 50.5263 50.5267 50.527 50.5274 50.5278 50.5283 50.5287 50.5292 50.5297 50.5302 50.5307 50.5313 50.5319 50.5325 50.5332 50.5338 50.5345 50.5353 50.536 50.5368 50.5376 50.5385 50.5393 50.5402 50.5412 50.5422 50.5432 50.5442 50.5453 50.5464 50.5476 50.5487 50.55 50.5512 50.5525 50.5538 50.5552 50.5566 50.558 50.5595 50.561 50.5626 50.5642 50.5658 50.5675 50.5692 50.5709 50.5727 50.5745 50.5764 50.5782 50.5802 50.5821 50.5841 50.5861 50.5882 50.5903 50.5924 50.5946 50.5967 50.599 50.6012 50.6035 50.6058 50.6081 50.6105 50.6129 50.6153 50.6177 50.6202 50.6227 50.6252 50.6278 50.6303 50.6329 50.6356 50.6382 50.6409 50.6436 50.6465 50.6494 50.654 50.6545 50.4894 50.5065 50.5106 50.5119 50.5123 50.5125 50.5125 50.5125 50.5125 50.5125 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5125 50.5125 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5127 50.5127 50.5128 50.5129 50.5129 50.513 50.5131 50.5131 50.5132 50.5132 50.5133 50.5135 50.5143 50.5165 50.5187 50.5202 50.5211 50.5214 50.5214 50.521 50.5186 50.5082 50.4799 50.4481 50.4203 50.3978 50.3808 50.3693 50.3626 50.3596 50.359 50.3599 50.3662 50.386 50.4099 50.431 50.4491 50.4644 50.4769 50.4869 50.4949 50.5011 50.5059 50.5095 50.5123 50.5144 50.516 50.5171 50.518 50.5187 50.5192 50.5196 50.5199 50.5202 50.5204 50.5206 50.5208 50.5209 50.5211 50.5213 50.5214 50.5216 50.5217 50.5219 50.5221 50.5223 50.5225 50.5227 50.5229 50.5231 50.5233 50.5236 50.5238 50.5241 50.5244 50.5247 50.525 50.5254 50.5257 50.5261 50.5265 50.5269 50.5273 50.5278 50.5282 50.5287 50.5293 50.5298 50.5304 50.531 50.5316 50.5322 50.5329 50.5336 50.5343 50.5351 50.5359 50.5367 50.5375 50.5384 50.5393 50.5402 50.5412 50.5422 50.5433 50.5443 50.5455 50.5466 50.5478 50.549 50.5503 50.5516 50.5529 50.5543 50.5557 50.5571 50.5586 50.5601 50.5617 50.5632 50.5649 50.5665 50.5682 50.57 50.5718 50.5736 50.5754 50.5773 50.5792 50.5812 50.5832 50.5852 50.5872 50.5893 50.5915 50.5936 50.5958 50.598 50.6003 50.6025 50.6048 50.6072 50.6095 50.6119 50.6143 50.6168 50.6193 50.6218 50.6243 50.6268 50.6294 50.632 50.6346 50.6372 50.64 50.6426 50.6456 50.6485 50.6531 50.6551 50.6047 50.5812 50.5694 50.5643 50.5611 50.5585 50.5564 50.5547 50.5535 50.5528 50.5522 50.552 50.552 50.5524 50.5532 50.5548 50.5575 50.5621 50.5686 50.5783 50.6085 50.5886 50.5777 50.5733 50.5709 50.5691 50.5676 50.5668 50.5665 50.5665 50.5667 50.5672 50.568 50.5689 50.5704 50.5723 50.5753 50.5798 50.5862 50.5949 50.6101 50.591 50.5798 50.5746 50.5717 50.5692 50.5672 50.5657 50.5647 50.5641 50.5638 50.5636 50.5638 50.5643 50.5653 50.5669 50.5699 50.5745 50.5811 50.5907 50.6121 50.5951 50.5855 50.5814 50.5792 50.5775 50.5761 50.5753 50.5749 50.5748 50.5749 50.5752 50.5758 50.5766 50.5777 50.5793 50.5819 50.5858 50.5917 50.5998 50.6144 50.5991 50.5901 50.5854 50.5826 50.5804 50.5785 50.5772 50.5764 50.5759 50.5756 50.5755 50.5758 50.5763 50.5773 50.5791 50.5819 50.5861 50.5921 50.6006 50.6168 50.6031 50.595 50.5911 50.5894 50.5881 50.5868 50.5859 50.5855 50.5854 50.5854 50.5856 50.586 50.5866 50.5873 50.5885 50.5907 50.594 50.5992 50.6065 50.6255 50.6157 50.6101 50.6067 50.6038 50.601 50.5986 50.597 50.5959 50.5952 50.5948 50.5946 50.5947 50.5952 50.5963 50.5982 50.6007 50.6042 50.6087 50.6147 50.637 50.6316 50.6286 50.6269 50.6261 50.626 50.6263 50.6264 50.6263 50.6262 50.6261 50.6261 50.6262 50.6264 50.6268 50.6273 50.6282 50.6295 50.6314 50.6343 50.6465 50.6443 50.643 50.6423 50.6416 50.6408 50.6396 50.6387 50.6384 50.6383 50.6382 50.6382 50.6381 50.6382 50.6384 50.6387 50.6392 50.6399 50.6408 50.6425 50.6542 50.6545 50.6548 50.6551 50.6553 50.6558 50.6566 50.6572 50.6573 50.6571 50.6569 50.6568 50.6566 50.6563 50.656 50.6556 50.6552 50.6547 50.6542 50.6538 50.6611 50.6636 50.6652 50.666 50.6664 50.6665 50.6662 50.6659 50.666 50.6662 50.6663 50.6663 50.6661 50.666 50.6657 50.6653 50.6646 50.6638 50.6626 50.6613 50.6668 50.6714 50.674 50.6754 50.6765 50.6776 50.6786 50.6792 50.6794 50.6793 50.6791 50.6788 50.6785 50.678 50.6773 50.6765 50.6753 50.6738 50.6717 50.669 50.6718 50.6784 50.6819 50.6834 50.684 50.6843 50.6845 50.6848 50.685 50.6852 50.6855 50.6855 50.6855 50.6853 50.6849 50.6842 50.6832 50.6816 50.6792 50.6756 50.6762 50.6849 50.6892 50.6913 50.6929 50.6942 50.6951 50.6955 50.6957 50.6958 50.6957 50.6955 50.6952 50.6946 50.6938 50.6928 50.6914 50.6894 50.6865 50.682 50.6786 50.6887 50.693 50.6944 50.6952 50.6961 50.6968 50.6973 50.6976 50.6978 50.6978 50.6978 50.6977 50.6974 50.697 50.6963 50.6952 50.6935 50.6909 50.6866 50.6794 50.6901 50.6946 50.6962 50.6972 50.6982 50.6989 50.6993 50.6996 50.6997 50.6997 50.6996 50.6994 50.6991 50.6986 50.6978 50.6966 50.6949 50.6922 50.6879 50.6801 50.6912 50.6955 50.6969 50.6978 50.6987 50.6995 50.6999 50.7003 50.7005 50.7006 50.7005 50.7004 50.7002 50.6997 50.699 50.6979 50.6963 50.6937 50.6893 50.6807 50.6925 50.6969 50.6984 50.6994 50.7003 50.7009 50.7013 50.7016 50.7017 50.7017 50.7016 50.7014 50.7011 50.7006 50.6999 50.6987 50.697 50.6944 50.6901 50.6815 50.6929 50.6973 50.6987 50.6996 50.7005 50.7013 50.7019 50.7022 50.7025 50.7026 50.7025 50.7024 50.7022 50.7018 50.7011 50.7 50.6984 50.6958 50.6915 50.6815 50.6935 50.6977 50.6989 50.6997 50.7006 50.7013 50.7017 50.702 50.7021 50.7021 50.702 50.7018 50.7015 50.701 50.7003 50.6992 50.6976 50.6951 50.6911 50.6266 50.645 50.6517 50.6557 50.6591 50.6622 50.6653 50.6684 50.6715 50.6746 50.6778 50.6811 50.6843 50.6876 50.6909 50.6943 50.6977 50.7012 50.7047 50.7082 50.7118 50.7154 50.719 50.7227 50.7264 50.7301 50.7339 50.7378 50.7417 50.7457 50.7497 50.7537 50.7578 50.7619 50.7661 50.7703 50.7746 50.7789 50.7833 50.7877 50.7922 50.7968 50.8013 50.806 50.8107 50.8155 50.8203 50.8252 50.83 50.8349 50.8397 50.8448 50.8502 50.8561 50.8627 50.8701 50.8769 50.8832 50.8893 50.8952 50.9006 50.9043 50.9019 50.8828 50.8571 50.8345 50.8169 50.8047 50.7979 50.7957 50.7976 50.8026 50.8096 50.8194 50.8395 50.8692 50.8967 50.9215 50.9433 50.9625 50.9793 50.9939 51.0067 51.0181 51.0283 51.0377 51.0464 51.0543 51.0621 51.0697 51.0769 51.0842 51.0909 51.0982 51.1048 51.1121 51.1185 51.1257 51.1298 51.1482 50.6357 50.6524 50.6588 50.6627 50.6661 50.6692 50.6724 50.6755 50.6786 50.6817 50.6849 50.6881 50.6914 50.6947 50.698 50.7014 50.7048 50.7082 50.7117 50.7152 50.7188 50.7224 50.726 50.7297 50.7335 50.7372 50.7411 50.7449 50.7488 50.7528 50.7568 50.7608 50.7649 50.769 50.7732 50.7774 50.7817 50.786 50.7903 50.7948 50.7992 50.8037 50.8082 50.8128 50.8175 50.8221 50.8269 50.8316 50.8365 50.8413 50.8462 50.8511 50.8561 50.8612 50.8663 50.8713 50.8765 50.8817 50.887 50.8922 50.8974 50.9027 50.9079 50.9132 50.9186 50.9243 50.9303 50.9363 50.9418 50.9451 50.9425 50.9386 50.9374 50.9394 50.9443 50.951 50.9591 50.9707 50.9841 50.9958 51.0062 51.0152 51.0231 51.0306 51.038 51.0449 51.0517 51.0585 51.0651 51.072 51.0785 51.0856 51.0921 51.0992 51.1057 51.113 51.1193 51.1265 51.1305 51.1501 50.6311 50.6487 50.6554 50.6595 50.6628 50.666 50.6692 50.6723 50.6754 50.6785 50.6817 50.6849 50.6882 50.6915 50.6948 50.6982 50.7016 50.705 50.7085 50.712 50.7156 50.7192 50.7228 50.7265 50.7303 50.7341 50.7379 50.7417 50.7456 50.7496 50.7535 50.7576 50.7617 50.7658 50.77 50.7742 50.7785 50.7828 50.7872 50.7916 50.796 50.8006 50.8051 50.8097 50.8144 50.8191 50.8238 50.8286 50.8334 50.8383 50.8432 50.8482 50.8532 50.8583 50.8634 50.8685 50.8737 50.8789 50.8841 50.8893 50.8945 50.8998 50.9054 50.9113 50.9168 50.921 50.9233 50.9255 50.9283 50.9323 50.9375 50.944 50.9515 50.9615 50.9738 50.9844 50.9932 51.0008 51.0081 51.015 51.021 51.026 51.0311 51.0364 51.0419 51.0477 51.0537 51.0599 51.0661 51.0727 51.079 51.0858 51.0922 51.0993 51.1058 51.113 51.1193 51.1266 51.1306 51.1489 50.635 50.6514 50.6579 50.6618 50.6651 50.6682 50.6713 50.6744 50.6775 50.6807 50.6838 50.687 50.6903 50.6936 50.6969 50.7003 50.7037 50.7071 50.7106 50.7141 50.7177 50.7213 50.725 50.7286 50.7324 50.7362 50.74 50.7438 50.7477 50.7517 50.7557 50.7597 50.7638 50.7679 50.7721 50.7763 50.7806 50.7849 50.7892 50.7937 50.7981 50.8026 50.8071 50.8117 50.8164 50.8211 50.8258 50.8306 50.8354 50.8403 50.8452 50.8501 50.8551 50.8601 50.8653 50.8704 50.8756 50.8808 50.886 50.8912 50.8963 50.9016 50.9073 50.9131 50.9182 50.9227 50.9267 50.9309 50.9357 50.9414 50.948 50.9554 50.9653 50.9769 50.9866 50.9947 51.002 51.0091 51.0155 51.02 51.0237 51.0278 51.0323 51.0372 51.0425 51.0481 51.054 51.0601 51.0663 51.0728 51.0791 51.0859 51.0923 51.0994 51.1058 51.1131 51.1194 51.1266 51.1308 51.1477 50.6332 50.6493 50.6559 50.66 50.6634 50.6666 50.6698 50.6729 50.676 50.6792 50.6824 50.6856 50.6888 50.6921 50.6955 50.6988 50.7022 50.7057 50.7091 50.7127 50.7162 50.7198 50.7235 50.7272 50.7309 50.7347 50.7385 50.7424 50.7463 50.7502 50.7542 50.7582 50.7623 50.7664 50.7706 50.7748 50.7791 50.7834 50.7878 50.7922 50.7967 50.8012 50.8057 50.8103 50.815 50.8196 50.8244 50.8291 50.834 50.8388 50.8438 50.8487 50.8537 50.8588 50.8639 50.8691 50.8743 50.8794 50.8846 50.8899 50.8953 50.9008 50.9062 50.9115 50.9167 50.9217 50.9268 50.9322 50.9382 50.9449 50.9524 50.9624 50.9739 50.9836 50.9916 50.9989 51.006 51.0124 51.0171 51.0204 51.024 51.028 51.0324 51.0373 51.0426 51.0482 51.054 51.0602 51.0663 51.0728 51.0791 51.086 51.0923 51.0994 51.1058 51.1131 51.1194 51.1266 51.131 51.1464 50.6347 50.6502 50.6567 50.6606 50.6638 50.667 50.67 50.6731 50.6762 50.6794 50.6825 50.6857 50.689 50.6923 50.6956 50.699 50.7024 50.7058 50.7093 50.7128 50.7164 50.72 50.7237 50.7274 50.7311 50.7349 50.7387 50.7425 50.7464 50.7504 50.7543 50.7584 50.7625 50.7666 50.7708 50.775 50.7793 50.7836 50.7879 50.7924 50.7968 50.8013 50.8059 50.8104 50.8151 50.8198 50.8245 50.8292 50.8341 50.8389 50.8438 50.8488 50.8538 50.8589 50.864 50.8692 50.8743 50.8794 50.8847 50.89 50.8954 50.9007 50.906 50.9113 50.9166 50.9218 50.9272 50.9329 50.9392 50.9461 50.9541 50.9651 50.976 50.985 50.9926 50.9998 51.0067 51.0128 51.0168 51.02 51.0236 51.0276 51.0322 51.0371 51.0425 51.0481 51.054 51.0602 51.0663 51.0729 51.0792 51.086 51.0924 51.0994 51.1059 51.1131 51.1194 51.1266 51.1312 51.1449 50.6337 50.6462 50.652 50.6562 50.6599 50.6633 50.6666 50.6698 50.673 50.6762 50.6794 50.6826 50.6859 50.6892 50.6925 50.6959 50.6993 50.7028 50.7062 50.7098 50.7133 50.717 50.7206 50.7243 50.728 50.7318 50.7356 50.7394 50.7433 50.7473 50.7513 50.7553 50.7594 50.7635 50.7677 50.7719 50.7762 50.7805 50.7849 50.7893 50.7938 50.7983 50.8028 50.8074 50.812 50.8167 50.8214 50.8262 50.8311 50.8359 50.8409 50.8458 50.8509 50.8559 50.861 50.8661 50.8713 50.8766 50.8818 50.8871 50.8925 50.8979 50.9034 50.9087 50.9141 50.9197 50.9257 50.9323 50.9394 50.9482 50.9589 50.9686 50.9768 50.9841 50.9911 50.998 51.0044 51.0097 51.0139 51.0181 51.0224 51.027 51.0318 51.0369 51.0424 51.0481 51.054 51.0602 51.0664 51.0729 51.0792 51.0861 51.0924 51.0995 51.1059 51.1131 51.1195 51.1266 51.1316 51.1423 50.6424 50.6521 50.6581 50.6618 50.6647 50.6675 50.6703 50.6733 50.6763 50.6794 50.6826 50.6857 50.689 50.6923 50.6956 50.6989 50.7023 50.7058 50.7092 50.7128 50.7163 50.72 50.7236 50.7273 50.731 50.7348 50.7386 50.7424 50.7463 50.7503 50.7543 50.7583 50.7624 50.7665 50.7707 50.7749 50.7792 50.7835 50.7879 50.7923 50.7967 50.8013 50.8058 50.8104 50.815 50.8197 50.8244 50.8292 50.834 50.8389 50.8438 50.8488 50.8538 50.8589 50.864 50.8691 50.8742 50.8794 50.8846 50.89 50.8953 50.9006 50.9059 50.9113 50.9166 50.9221 50.9275 50.933 50.9387 50.9449 50.9515 50.9586 50.9668 50.9756 50.9834 50.9906 50.9977 51.0046 51.0112 51.017 51.0223 51.0273 51.0323 51.0375 51.043 51.0486 51.0545 51.0606 51.0668 51.0732 51.0796 51.0862 51.0928 51.0996 51.1061 51.1133 51.1196 51.1268 51.1323 51.1398 50.6461 50.652 50.6558 50.6589 50.6623 50.6657 50.6689 50.6722 50.6754 50.6786 50.6819 50.6851 50.6884 50.6917 50.695 50.6984 50.7018 50.7053 50.7087 50.7123 50.7158 50.7194 50.7231 50.7268 50.7305 50.7343 50.7381 50.7419 50.7458 50.7498 50.7538 50.7578 50.7619 50.766 50.7702 50.7744 50.7787 50.783 50.7874 50.7918 50.7962 50.8007 50.8053 50.8099 50.8145 50.8192 50.8239 50.8287 50.8335 50.8384 50.8433 50.8483 50.8533 50.8584 50.8635 50.8686 50.8738 50.879 50.8843 50.8896 50.8949 50.9003 50.9057 50.9112 50.9167 50.9222 50.9277 50.9332 50.9388 50.9445 50.9505 50.9571 50.9641 50.9717 50.98 50.9875 50.9947 51.0018 51.0087 51.0152 51.0211 51.0267 51.0321 51.0375 51.0431 51.0488 51.0547 51.0609 51.0671 51.0734 51.0799 51.0864 51.093 51.0998 51.1063 51.1134 51.1198 51.1269 51.133 51.1392 50.6518 50.6555 50.6594 50.6628 50.6656 50.6683 50.671 50.674 50.677 50.6801 50.6832 50.6864 50.6896 50.6929 50.6962 50.6996 50.7029 50.7064 50.7099 50.7134 50.717 50.7206 50.7242 50.7279 50.7316 50.7354 50.7392 50.743 50.7469 50.7509 50.7549 50.7589 50.763 50.7671 50.7713 50.7755 50.7798 50.7841 50.7885 50.7929 50.7973 50.8018 50.8064 50.811 50.8156 50.8203 50.825 50.8298 50.8346 50.8395 50.8444 50.8494 50.8544 50.8595 50.8646 50.8697 50.8749 50.8801 50.8853 50.8906 50.896 50.9014 50.9068 50.9122 50.9177 50.9231 50.9286 50.9341 50.9396 50.9452 50.9509 50.9568 50.9632 50.9701 50.9775 50.9856 50.9931 51.0003 51.0075 51.0144 51.0209 51.0268 51.0324 51.0379 51.0435 51.0492 51.0551 51.0611 51.0674 51.0736 51.0802 51.0865 51.0934 51.0998 51.1068 51.1132 51.1204 51.1268 51.134 51.14 50.6568 50.657 50.6587 50.661 50.6638 50.667 50.6703 50.6735 50.6768 50.68 50.6832 50.6865 50.6897 50.693 50.6964 50.6998 50.7032 50.7066 50.7101 50.7136 50.7172 50.7208 50.7244 50.7281 50.7319 50.7356 50.7394 50.7433 50.7472 50.7511 50.7551 50.7591 50.7632 50.7674 50.7715 50.7758 50.7801 50.7844 50.7887 50.7931 50.7976 50.8021 50.8066 50.8112 50.8159 50.8205 50.8253 50.8301 50.8349 50.8398 50.8447 50.8496 50.8546 50.8597 50.8648 50.87 50.8751 50.8804 50.8856 50.891 50.8963 50.9017 50.9072 50.9127 50.9181 50.9237 50.9292 50.9348 50.9404 50.946 50.9516 50.9574 50.9636 50.9703 50.9774 50.9853 50.9935 51.001 51.0083 51.0154 51.0223 51.0286 51.034 51.0392 51.0445 51.05 51.0557 51.0616 51.0678 51.074 51.0805 51.0868 51.0936 51.0999 51.107 51.1133 51.1205 51.127 51.1345 51.1407 50.6617 50.6593 50.661 50.6637 50.6664 50.6691 50.6719 50.6749 50.6779 50.681 50.6841 50.6873 50.6905 50.6938 50.6971 50.7005 50.7039 50.7073 50.7108 50.7143 50.7179 50.7215 50.7251 50.7288 50.7325 50.7363 50.7401 50.7439 50.7478 50.7518 50.7558 50.7598 50.7639 50.768 50.7722 50.7764 50.7807 50.785 50.7894 50.7938 50.7982 50.8027 50.8073 50.8119 50.8165 50.8212 50.826 50.8307 50.8356 50.8404 50.8453 50.8503 50.8553 50.8604 50.8655 50.8706 50.8758 50.881 50.8863 50.8916 50.897 50.9024 50.9079 50.9134 50.9189 50.9244 50.93 50.9356 50.9412 50.9468 50.9524 50.9581 50.9642 50.9708 50.9779 50.9859 50.9953 51.0039 51.0116 51.0189 51.0262 51.033 51.0385 51.0427 51.047 51.0516 51.0568 51.0623 51.0683 51.0743 51.0808 51.087 51.0939 51.1002 51.1072 51.1135 51.1207 51.1272 51.135 51.1415 50.6659 50.6611 50.6608 50.6627 50.6653 50.6685 50.6717 50.6749 50.6781 50.6813 50.6845 50.6877 50.691 50.6943 50.6976 50.701 50.7044 50.7079 50.7113 50.7148 50.7184 50.722 50.7257 50.7294 50.7331 50.7368 50.7406 50.7445 50.7484 50.7524 50.7563 50.7604 50.7645 50.7686 50.7728 50.777 50.7813 50.7856 50.7899 50.7943 50.7988 50.8033 50.8078 50.8124 50.8171 50.8218 50.8265 50.8313 50.8361 50.841 50.8459 50.8509 50.8559 50.8609 50.866 50.8712 50.8764 50.8816 50.8869 50.8922 50.8976 50.903 50.9084 50.9139 50.9195 50.9251 50.9307 50.9364 50.9421 50.9477 50.9533 50.959 50.9649 50.9713 50.9784 50.9861 50.9962 51.0074 51.0171 51.0254 51.0329 51.0402 51.0467 51.0506 51.0526 51.0553 51.0591 51.0635 51.0689 51.0746 51.081 51.0872 51.094 51.1003 51.1073 51.1136 51.1209 51.1274 51.1355 51.1418 50.6693 50.6627 50.6624 50.6645 50.667 50.6697 50.6726 50.6756 50.6786 50.6817 50.6848 50.688 50.6913 50.6946 50.6979 50.7013 50.7047 50.7081 50.7116 50.7151 50.7187 50.7223 50.7259 50.7296 50.7333 50.7371 50.7409 50.7447 50.7486 50.7526 50.7566 50.7606 50.7647 50.7688 50.773 50.7772 50.7815 50.7858 50.7902 50.7946 50.799 50.8035 50.8081 50.8127 50.8173 50.822 50.8267 50.8315 50.8363 50.8412 50.8461 50.8511 50.8561 50.8611 50.8662 50.8714 50.8766 50.8819 50.8872 50.8925 50.8979 50.9033 50.9088 50.9143 50.9199 50.9255 50.9312 50.9369 50.9426 50.9482 50.9538 50.9595 50.9655 50.9721 50.9792 50.9876 51.0004 51.0161 51.0294 51.0401 51.0486 51.0562 51.063 51.0666 51.0645 51.0629 51.0634 51.0656 51.0696 51.0746 51.0806 51.0867 51.0936 51.1001 51.1072 51.1137 51.121 51.1275 51.1359 51.142 50.6713 50.663 50.6621 50.6642 50.6669 50.6697 50.6727 50.6758 50.6789 50.682 50.6852 50.6884 50.6917 50.695 50.6983 50.7016 50.705 50.7085 50.712 50.7155 50.7191 50.7227 50.7263 50.7299 50.7337 50.7374 50.7413 50.7451 50.749 50.753 50.757 50.761 50.7651 50.7692 50.7734 50.7776 50.7819 50.7862 50.7906 50.795 50.7994 50.8039 50.8085 50.813 50.8177 50.8224 50.8271 50.8319 50.8367 50.8416 50.8465 50.8515 50.8565 50.8615 50.8666 50.8718 50.877 50.8823 50.8875 50.8929 50.8982 50.9036 50.9091 50.9147 50.9202 50.9259 50.9315 50.9373 50.943 50.9486 50.9542 50.9599 50.966 50.9726 50.9799 50.9891 51.0053 51.027 51.0455 51.0597 51.0702 51.0783 51.0853 51.0887 51.0825 51.074 51.0692 51.0678 51.0696 51.0734 51.079 51.0852 51.0924 51.0992 51.1067 51.1135 51.1209 51.1276 51.136 51.1417 50.6717 50.6633 50.6624 50.6644 50.667 50.6699 50.6728 50.6759 50.679 50.682 50.6852 50.6884 50.6917 50.695 50.6983 50.7017 50.7051 50.7085 50.712 50.7155 50.7191 50.7227 50.7263 50.73 50.7337 50.7375 50.7413 50.7451 50.7491 50.753 50.757 50.761 50.7651 50.7692 50.7734 50.7776 50.7819 50.7862 50.7906 50.795 50.7994 50.8039 50.8085 50.8131 50.8177 50.8224 50.8271 50.8319 50.8368 50.8416 50.8465 50.8515 50.8565 50.8616 50.8667 50.8718 50.877 50.8823 50.8876 50.8929 50.8983 50.9037 50.9092 50.9148 50.9204 50.926 50.9317 50.9374 50.9431 50.9488 50.9544 50.9601 50.9662 50.9729 50.9802 50.9896 51.007 51.031 51.0514 51.0669 51.078 51.0862 51.0931 51.0958 51.0869 51.0755 51.0686 51.0661 51.0672 51.0711 51.0769 51.0836 51.091 51.0984 51.1061 51.1133 51.1208 51.1276 51.136 51.1416 50.6723 50.6634 50.6625 50.6645 50.6672 50.6701 50.6731 50.6761 50.6792 50.6823 50.6855 50.6887 50.692 50.6953 50.6986 50.7019 50.7053 50.7088 50.7123 50.7158 50.7194 50.7229 50.7266 50.7302 50.734 50.7377 50.7416 50.7454 50.7493 50.7533 50.7573 50.7613 50.7654 50.7695 50.7737 50.7779 50.7822 50.7865 50.7909 50.7953 50.7997 50.8042 50.8088 50.8133 50.818 50.8227 50.8274 50.8322 50.837 50.8419 50.8468 50.8518 50.8568 50.8618 50.8669 50.8721 50.8773 50.8826 50.8879 50.8932 50.8986 50.904 50.9095 50.915 50.9206 50.9263 50.932 50.9377 50.9435 50.9491 50.9547 50.9604 50.9664 50.973 50.9802 50.9891 51.0051 51.0307 51.053 51.0698 51.0816 51.0899 51.0967 51.0983 51.0873 51.0749 51.0676 51.065 51.0663 51.0704 51.0764 51.0833 51.0908 51.0983 51.106 51.1133 51.1208 51.1276 51.1361 51.1415 50.6724 50.6633 50.6623 50.6643 50.667 50.6698 50.6728 50.6758 50.6789 50.682 50.6852 50.6884 50.6917 50.695 50.6983 50.7016 50.705 50.7085 50.712 50.7155 50.7191 50.7226 50.7262 50.7299 50.7337 50.7374 50.7413 50.7451 50.749 50.753 50.757 50.761 50.7651 50.7692 50.7734 50.7776 50.7819 50.7862 50.7905 50.795 50.7994 50.8039 50.8084 50.813 50.8177 50.8224 50.8271 50.8319 50.8367 50.8416 50.8465 50.8515 50.8565 50.8615 50.8666 50.8718 50.8771 50.8823 50.8876 50.893 50.8983 50.9038 50.9093 50.9149 50.9205 50.9262 50.9319 50.9376 50.9433 50.9489 50.9545 50.9603 50.9667 50.9738 50.9822 50.9968 51.0247 51.0514 51.0708 51.0836 51.0922 51.0988 51.0999 51.0862 51.0703 51.0609 51.0576 51.059 51.0635 51.0697 51.0768 51.0842 51.0919 51.0993 51.1069 51.1138 51.1211 51.1277 51.1362 51.1413 50.6731 50.6638 50.6629 50.6649 50.6676 50.6704 50.6734 50.6765 50.6795 50.6826 50.6858 50.6891 50.6923 50.6956 50.6989 50.7023 50.7057 50.7092 50.7126 50.7162 50.7197 50.7233 50.7269 50.7306 50.7343 50.7381 50.7419 50.7458 50.7497 50.7537 50.7577 50.7617 50.7658 50.7699 50.7741 50.7783 50.7826 50.7869 50.7912 50.7957 50.8001 50.8046 50.8092 50.8138 50.8184 50.8231 50.8278 50.8326 50.8375 50.8423 50.8473 50.8522 50.8572 50.8623 50.8674 50.8725 50.8777 50.883 50.8883 50.8936 50.899 50.9045 50.9099 50.9155 50.9211 50.9267 50.9324 50.9379 50.9434 50.9491 50.9551 50.9618 50.9691 50.9783 50.9885 50.9968 51.0041 51.0103 51.012 50.9972 50.9689 50.9499 50.9432 50.9468 50.9551 50.9709 51.0028 51.0329 51.0553 51.0712 51.0824 51.0911 51.099 51.1054 51.1108 51.1158 51.1224 51.1283 51.1365 51.1412 50.6718 50.6623 50.6614 50.6634 50.666 50.6689 50.6718 50.6748 50.6779 50.681 50.6842 50.6874 50.6907 50.6939 50.6973 50.7006 50.704 50.7075 50.7109 50.7144 50.718 50.7216 50.7252 50.7289 50.7326 50.7364 50.7402 50.744 50.7479 50.7519 50.7559 50.7599 50.764 50.7681 50.7722 50.7765 50.7807 50.785 50.7894 50.7938 50.7982 50.8027 50.8073 50.8119 50.8165 50.8212 50.8259 50.8307 50.8355 50.8404 50.8453 50.8502 50.8552 50.8603 50.8655 50.8707 50.8758 50.8811 50.8864 50.8917 50.8972 50.9027 50.9083 50.914 50.9196 50.9252 50.9308 50.9365 50.9424 50.9484 50.9543 50.959 50.9601 50.9457 50.8743 50.7294 50.5995 50.5037 50.4469 50.4248 50.426 50.4404 50.4986 50.6504 50.7997 50.9126 50.9912 51.0414 51.0711 51.0876 51.0974 51.1046 51.108 51.1089 51.1123 51.1162 51.1221 51.1277 51.1358 51.1424 51.1103 51.0951 51.0884 51.086 51.0851 51.0847 51.0843 51.0844 51.0848 51.0856 51.0865 51.0876 51.0889 51.0905 51.0923 51.0947 51.0978 51.1021 51.1077 51.1153 51.1132 51.1007 51.0944 51.0925 51.0922 51.0922 51.0924 51.093 51.094 51.0953 51.0967 51.0984 51.1001 51.1021 51.1044 51.107 51.1104 51.1147 51.1201 51.1271 51.1142 51.1021 51.0957 51.0932 51.0924 51.0919 51.0917 51.0919 51.0925 51.0933 51.0943 51.0955 51.0969 51.0985 51.1005 51.1029 51.1063 51.1106 51.1163 51.1239 51.1155 51.105 51.0997 51.098 51.0978 51.0978 51.0981 51.0987 51.0996 51.1008 51.1022 51.1037 51.1053 51.1072 51.1093 51.1117 51.1146 51.1187 51.1237 51.1303 51.117 51.1076 51.1027 51.1005 51.0998 51.0994 51.0993 51.0996 51.1002 51.1011 51.1022 51.1034 51.1048 51.1065 51.1085 51.1111 51.1143 51.1184 51.1236 51.1305 51.1186 51.1104 51.106 51.1045 51.1047 51.105 51.1052 51.1059 51.1068 51.108 51.1093 51.1107 51.1122 51.1139 51.1156 51.1177 51.1204 51.124 51.1285 51.1345 51.1244 51.119 51.1162 51.1149 51.1138 51.1129 51.1123 51.1124 51.1128 51.1136 51.1146 51.1157 51.1171 51.1187 51.1209 51.1234 51.1265 51.13 51.1343 51.1395 51.1322 51.1298 51.1288 51.1288 51.1296 51.131 51.1326 51.1339 51.135 51.1361 51.1372 51.1384 51.1397 51.1411 51.1426 51.1442 51.146 51.1481 51.1505 51.1536 51.1387 51.1383 51.1386 51.1393 51.14 51.1404 51.1408 51.1414 51.1424 51.1436 51.1449 51.1461 51.1473 51.1486 51.1499 51.1514 51.1529 51.1547 51.1566 51.159 51.1441 51.1456 51.1471 51.1485 51.1499 51.1517 51.1535 51.1551 51.1563 51.1573 51.1583 51.1593 51.1604 51.1614 51.1623 51.1632 51.1641 51.165 51.1659 51.1669 51.1487 51.1516 51.1539 51.1557 51.1571 51.1583 51.1591 51.16 51.1612 51.1626 51.1639 51.1651 51.1662 51.1673 51.1683 51.1693 51.1701 51.1708 51.1713 51.1717 51.1525 51.1567 51.1597 51.162 51.1641 51.1661 51.1682 51.1698 51.1712 51.1723 51.1733 51.1744 51.1754 51.1762 51.177 51.1776 51.178 51.1783 51.1781 51.1775 51.1559 51.1616 51.1653 51.1676 51.1691 51.1705 51.1719 51.1732 51.1746 51.176 51.1774 51.1787 51.1799 51.181 51.182 51.1828 51.1833 51.1835 51.1832 51.1822 51.159 51.1662 51.1705 51.1732 51.1757 51.1778 51.1797 51.1813 51.1827 51.1839 51.1851 51.1861 51.187 51.1878 51.1884 51.1889 51.1891 51.1891 51.1883 51.1867 51.1606 51.1689 51.1731 51.1753 51.1772 51.1791 51.1809 51.1824 51.1838 51.1851 51.1864 51.1875 51.1886 51.1896 51.1905 51.1912 51.1916 51.1918 51.1913 51.1898 51.1612 51.1699 51.1743 51.1766 51.1787 51.1806 51.1824 51.184 51.1853 51.1866 51.1877 51.1889 51.1899 51.1909 51.1917 51.1922 51.1926 51.1927 51.1922 51.1906 51.1617 51.1707 51.1749 51.1772 51.1791 51.181 51.1828 51.1844 51.1857 51.1871 51.1883 51.1894 51.1905 51.1915 51.1924 51.193 51.1936 51.1937 51.1932 51.1917 51.1622 51.1717 51.1761 51.1784 51.1803 51.1822 51.1839 51.1854 51.1867 51.1879 51.1891 51.1902 51.1912 51.1922 51.193 51.1936 51.1941 51.1942 51.1938 51.1921 51.1627 51.1722 51.1765 51.1786 51.1804 51.1823 51.184 51.1856 51.187 51.1883 51.1895 51.1907 51.1918 51.1929 51.1938 51.1945 51.1951 51.1953 51.1948 51.1933 51.1629 51.1722 51.1763 51.1782 51.18 51.1818 51.1835 51.185 51.1863 51.1875 51.1886 51.1897 51.1908 51.1918 51.1927 51.1935 51.194 51.1943 51.1937 51.1926 51.1526 51.1698 51.1792 51.1868 51.1941 51.2013 51.2087 51.2161 51.2236 51.2313 51.239 51.2468 51.2546 51.2625 51.2704 51.2783 51.2863 51.2943 51.3023 51.3104 51.3185 51.3266 51.3348 51.343 51.3513 51.3596 51.3679 51.3762 51.3846 51.393 51.4014 51.4099 51.4184 51.4269 51.4355 51.4441 51.4528 51.4615 51.4702 51.4789 51.4877 51.4966 51.5054 51.5144 51.5234 51.5323 51.5411 51.55 51.559 51.5686 51.5789 51.5897 51.6006 51.6114 51.622 51.6322 51.6422 51.6512 51.6571 51.6519 51.6347 51.6186 51.6063 51.5986 51.5956 51.5969 51.602 51.6104 51.6211 51.6337 51.653 51.6826 51.711 51.7367 51.7599 51.7808 51.7992 51.8158 51.8311 51.8451 51.8578 51.8697 51.8813 51.8927 51.9035 51.914 51.9243 51.9345 51.9447 51.9548 51.9648 51.9749 51.9849 51.9949 52.0049 52.0148 52.0248 52.0348 52.0447 52.0547 52.0647 52.0746 52.0846 52.0945 52.1045 52.1144 52.1243 52.1343 52.1442 52.1541 52.164 52.1739 52.1837 52.1936 52.2034 52.2133 52.2231 52.2329 52.2427 52.2525 52.2622 52.272 52.2817 52.2914 52.3011 52.3108 52.3204 52.3301 52.3397 52.3493 52.3589 52.3685 52.378 52.3876 52.3971 52.4066 52.4161 52.4255 52.435 52.4444 52.4539 52.4633 52.4727 52.4821 52.4914 52.5008 52.5101 52.5195 52.5288 52.5381 52.5474 52.5567 52.566 52.5752 52.5845 52.5937 52.603 52.6122 52.6214 52.6306 52.6398 52.6489 52.6581 52.6673 52.6764 52.6855 52.6947 52.7038 52.7129 52.722 52.731 52.7401 52.7491 52.7582 52.7672 52.7762 52.7852 52.7942 52.8032 52.812 52.8211 52.8299 52.8389 52.8476 52.8567 52.8653 52.8744 52.8829 52.8921 52.9004 52.9097 52.9179 52.9271 52.9353 52.9445 52.9526 52.9616 52.9702 52.9783 52.9874 51.1592 51.1757 51.1852 51.1932 51.2007 51.2081 51.2156 51.2231 51.2307 51.2384 51.2461 51.2538 51.2617 51.2695 51.2774 51.2854 51.2934 51.3014 51.3094 51.3175 51.3256 51.3338 51.342 51.3502 51.3584 51.3667 51.375 51.3833 51.3917 51.4001 51.4086 51.4171 51.4256 51.4341 51.4427 51.4513 51.4599 51.4685 51.4772 51.4859 51.4947 51.5035 51.5122 51.5211 51.5299 51.5388 51.5477 51.5566 51.5656 51.5746 51.5836 51.5926 51.6016 51.6107 51.6199 51.629 51.6381 51.6471 51.6562 51.6651 51.6741 51.6834 51.6933 51.7035 51.7132 51.7208 51.7225 51.7223 51.7243 51.7295 51.7378 51.7483 51.7601 51.7741 51.7908 51.8061 51.8194 51.8315 51.8431 51.8544 51.8651 51.8753 51.8854 51.8955 51.9056 51.9156 51.9256 51.9356 51.9457 51.9557 51.9657 51.9757 51.9857 51.9957 52.0057 52.0157 52.0257 52.0356 52.0456 52.0556 52.0656 52.0755 52.0855 52.0954 52.1054 52.1153 52.1252 52.1352 52.1451 52.155 52.1649 52.1748 52.1846 52.1945 52.2043 52.2142 52.224 52.2338 52.2436 52.2534 52.2631 52.2729 52.2826 52.2923 52.302 52.3117 52.3213 52.331 52.3406 52.3502 52.3598 52.3693 52.3789 52.3884 52.398 52.4075 52.417 52.4264 52.4359 52.4453 52.4548 52.4642 52.4736 52.4829 52.4923 52.5017 52.511 52.5204 52.5297 52.539 52.5483 52.5576 52.5668 52.5761 52.5854 52.5946 52.6038 52.613 52.6223 52.6315 52.6406 52.6498 52.659 52.6681 52.6773 52.6864 52.6955 52.7046 52.7137 52.7228 52.7319 52.741 52.75 52.759 52.7681 52.7771 52.7861 52.795 52.804 52.8129 52.8219 52.8307 52.8398 52.8485 52.8576 52.8662 52.8753 52.8838 52.893 52.9013 52.9105 52.9187 52.928 52.9361 52.9454 52.9534 52.9626 52.9707 52.9798 52.9873 51.1559 51.1728 51.1825 51.1905 51.1979 51.2053 51.2127 51.2201 51.2276 51.2352 51.2429 51.2506 51.2585 51.2663 51.2742 51.2822 51.2902 51.2982 51.3062 51.3143 51.3224 51.3305 51.3387 51.3469 51.3551 51.3634 51.3718 51.3801 51.3885 51.3969 51.4054 51.4138 51.4223 51.4309 51.4394 51.448 51.4567 51.4653 51.474 51.4828 51.4915 51.5003 51.5091 51.518 51.5268 51.5357 51.5447 51.5536 51.5626 51.5716 51.5806 51.5897 51.5988 51.6078 51.617 51.626 51.635 51.6439 51.6534 51.6634 51.6733 51.6816 51.6875 51.6926 51.698 51.7046 51.7127 51.7224 51.7336 51.746 51.7613 51.7759 51.7886 51.8003 51.8117 51.8226 51.8321 51.841 51.8499 51.8589 51.8681 51.8775 51.887 51.8966 51.9063 51.9161 51.9259 51.9358 51.9458 51.9558 51.9657 51.9757 51.9857 51.9957 52.0057 52.0157 52.0257 52.0356 52.0456 52.0556 52.0656 52.0755 52.0855 52.0954 52.1054 52.1153 52.1252 52.1352 52.1451 52.155 52.1649 52.1748 52.1846 52.1945 52.2043 52.2142 52.224 52.2338 52.2436 52.2534 52.2631 52.2729 52.2826 52.2923 52.302 52.3117 52.3213 52.331 52.3406 52.3502 52.3598 52.3694 52.3789 52.3884 52.398 52.4075 52.417 52.4264 52.4359 52.4453 52.4548 52.4642 52.4736 52.483 52.4923 52.5017 52.511 52.5204 52.5297 52.539 52.5483 52.5576 52.5668 52.5761 52.5854 52.5946 52.6038 52.6131 52.6223 52.6315 52.6406 52.6498 52.659 52.6681 52.6773 52.6864 52.6955 52.7046 52.7137 52.7228 52.7319 52.741 52.75 52.759 52.7681 52.7771 52.7861 52.795 52.804 52.8129 52.8219 52.8307 52.8398 52.8485 52.8576 52.8662 52.8753 52.8838 52.893 52.9013 52.9105 52.9187 52.928 52.9361 52.9454 52.9534 52.9627 52.9707 52.9798 52.9876 51.1586 51.1748 51.1844 51.1923 51.1998 51.2072 51.2147 51.2222 51.2297 51.2374 51.245 51.2528 51.2606 51.2685 51.2764 51.2843 51.2923 51.3003 51.3084 51.3164 51.3245 51.3327 51.3408 51.349 51.3573 51.3656 51.3739 51.3822 51.3906 51.399 51.4075 51.416 51.4245 51.433 51.4416 51.4502 51.4588 51.4674 51.4761 51.4848 51.4936 51.5024 51.5112 51.52 51.5288 51.5377 51.5467 51.5556 51.5646 51.5735 51.5826 51.5916 51.6006 51.6098 51.619 51.628 51.6367 51.6458 51.6554 51.6652 51.6745 51.6829 51.6904 51.6976 51.7053 51.7139 51.7239 51.7351 51.7472 51.7613 51.7745 51.7864 51.7979 51.809 51.819 51.827 51.8347 51.8428 51.8511 51.8598 51.8687 51.8779 51.8873 51.8968 51.9065 51.9162 51.926 51.9359 51.9458 51.9558 51.9658 51.9757 51.9857 51.9957 52.0057 52.0157 52.0257 52.0356 52.0456 52.0556 52.0656 52.0755 52.0855 52.0954 52.1054 52.1153 52.1252 52.1352 52.1451 52.155 52.1649 52.1748 52.1846 52.1945 52.2043 52.2142 52.224 52.2338 52.2436 52.2534 52.2631 52.2729 52.2826 52.2923 52.302 52.3117 52.3213 52.331 52.3406 52.3502 52.3598 52.3694 52.3789 52.3884 52.398 52.4075 52.417 52.4264 52.4359 52.4453 52.4548 52.4642 52.4736 52.483 52.4923 52.5017 52.511 52.5204 52.5297 52.539 52.5483 52.5576 52.5668 52.5761 52.5854 52.5946 52.6038 52.6131 52.6223 52.6315 52.6406 52.6498 52.659 52.6681 52.6773 52.6864 52.6955 52.7046 52.7137 52.7228 52.7319 52.741 52.75 52.759 52.7681 52.7771 52.7861 52.795 52.804 52.8129 52.8219 52.8307 52.8398 52.8485 52.8576 52.8662 52.8753 52.8838 52.893 52.9013 52.9105 52.9187 52.928 52.9361 52.9454 52.9534 52.9627 52.9707 52.9798 52.9878 51.157 51.1731 51.1828 51.1908 51.1983 51.2058 51.2132 51.2207 51.2283 51.2359 51.2436 51.2513 51.2591 51.267 51.2749 51.2828 51.2908 51.2988 51.3069 51.315 51.3231 51.3312 51.3394 51.3476 51.3558 51.3641 51.3724 51.3808 51.3892 51.3976 51.406 51.4145 51.423 51.4315 51.4401 51.4487 51.4573 51.466 51.4747 51.4834 51.4921 51.5009 51.5097 51.5185 51.5274 51.5363 51.5452 51.5542 51.5632 51.5721 51.5811 51.5902 51.5994 51.6084 51.6174 51.6265 51.6358 51.6451 51.6545 51.6637 51.6726 51.6813 51.6898 51.6985 51.7078 51.7181 51.7293 51.7414 51.7553 51.7682 51.78 51.7914 51.8025 51.8124 51.8202 51.8275 51.8351 51.843 51.8512 51.8599 51.8688 51.878 51.8874 51.8969 51.9065 51.9163 51.9261 51.9359 51.9459 51.9558 51.9658 51.9758 51.9857 51.9957 52.0057 52.0157 52.0257 52.0357 52.0456 52.0556 52.0656 52.0755 52.0855 52.0954 52.1054 52.1153 52.1252 52.1352 52.1451 52.155 52.1649 52.1748 52.1846 52.1945 52.2043 52.2142 52.224 52.2338 52.2436 52.2534 52.2631 52.2729 52.2826 52.2923 52.302 52.3117 52.3213 52.331 52.3406 52.3502 52.3598 52.3694 52.3789 52.3884 52.398 52.4075 52.417 52.4264 52.4359 52.4453 52.4548 52.4642 52.4736 52.483 52.4923 52.5017 52.511 52.5204 52.5297 52.539 52.5483 52.5576 52.5668 52.5761 52.5854 52.5946 52.6038 52.6131 52.6223 52.6315 52.6406 52.6498 52.659 52.6681 52.6773 52.6864 52.6955 52.7046 52.7137 52.7228 52.7319 52.741 52.75 52.759 52.7681 52.7771 52.7861 52.795 52.804 52.8129 52.8219 52.8307 52.8398 52.8485 52.8576 52.8662 52.8753 52.8838 52.893 52.9013 52.9105 52.9187 52.928 52.9361 52.9454 52.9534 52.9627 52.9707 52.9798 52.9877 51.158 51.1737 51.1833 51.1911 51.1986 51.2059 51.2134 51.2209 51.2284 51.236 51.2437 51.2515 51.2593 51.2672 51.2751 51.283 51.291 51.299 51.3071 51.3151 51.3232 51.3314 51.3395 51.3477 51.356 51.3643 51.3726 51.3809 51.3893 51.3977 51.4062 51.4146 51.4232 51.4317 51.4403 51.4489 51.4575 51.4661 51.4748 51.4835 51.4923 51.501 51.5098 51.5187 51.5275 51.5364 51.5453 51.5543 51.5632 51.5722 51.5813 51.5903 51.5994 51.6084 51.6175 51.6267 51.636 51.6451 51.6543 51.6634 51.6724 51.6812 51.6901 51.6992 51.7091 51.7198 51.7313 51.7441 51.7578 51.77 51.7815 51.7928 51.8035 51.8127 51.8201 51.8274 51.8349 51.8429 51.8512 51.8598 51.8688 51.878 51.8874 51.8969 51.9066 51.9163 51.9261 51.936 51.9459 51.9558 51.9658 51.9758 51.9858 51.9957 52.0057 52.0157 52.0257 52.0357 52.0456 52.0556 52.0656 52.0755 52.0855 52.0954 52.1054 52.1153 52.1252 52.1352 52.1451 52.155 52.1649 52.1748 52.1846 52.1945 52.2043 52.2142 52.224 52.2338 52.2436 52.2534 52.2631 52.2729 52.2826 52.2923 52.302 52.3117 52.3213 52.331 52.3406 52.3502 52.3598 52.3694 52.3789 52.3884 52.398 52.4075 52.417 52.4264 52.4359 52.4453 52.4548 52.4642 52.4736 52.483 52.4923 52.5017 52.511 52.5204 52.5297 52.539 52.5483 52.5576 52.5668 52.5761 52.5854 52.5946 52.6038 52.6131 52.6223 52.6315 52.6406 52.6498 52.659 52.6681 52.6773 52.6864 52.6955 52.7046 52.7137 52.7228 52.7319 52.741 52.75 52.759 52.7681 52.7771 52.7861 52.795 52.804 52.8129 52.8219 52.8307 52.8398 52.8485 52.8576 52.8662 52.8753 52.8838 52.893 52.9013 52.9105 52.9187 52.928 52.9361 52.9454 52.9534 52.9627 52.9707 52.9798 52.9877 51.1564 51.17 51.179 51.1871 51.1948 51.2024 51.2099 51.2175 51.2252 51.2328 51.2406 51.2484 51.2562 51.2641 51.272 51.2799 51.2879 51.2959 51.3039 51.312 51.3201 51.3283 51.3364 51.3446 51.3529 51.3612 51.3695 51.3779 51.3862 51.3947 51.4031 51.4116 51.4201 51.4286 51.4372 51.4458 51.4544 51.463 51.4717 51.4805 51.4892 51.498 51.5068 51.5156 51.5245 51.5334 51.5423 51.5512 51.5602 51.5692 51.5782 51.5873 51.5964 51.6056 51.6147 51.6238 51.633 51.6423 51.6515 51.6606 51.6696 51.6788 51.6884 51.6986 51.7096 51.7214 51.7346 51.7474 51.759 51.7704 51.7814 51.7921 51.8015 51.81 51.8181 51.8261 51.8341 51.8424 51.8509 51.8597 51.8688 51.878 51.8874 51.897 51.9066 51.9164 51.9262 51.936 51.946 51.9559 51.9658 51.9758 51.9858 51.9958 52.0057 52.0157 52.0257 52.0357 52.0456 52.0556 52.0656 52.0755 52.0855 52.0954 52.1054 52.1153 52.1252 52.1352 52.1451 52.155 52.1649 52.1748 52.1846 52.1945 52.2043 52.2142 52.224 52.2338 52.2436 52.2534 52.2631 52.2729 52.2826 52.2923 52.302 52.3117 52.3213 52.331 52.3406 52.3502 52.3598 52.3694 52.3789 52.3884 52.398 52.4075 52.417 52.4264 52.4359 52.4453 52.4548 52.4642 52.4736 52.483 52.4923 52.5017 52.511 52.5204 52.5297 52.539 52.5483 52.5576 52.5668 52.5761 52.5854 52.5946 52.6038 52.6131 52.6223 52.6315 52.6406 52.6498 52.659 52.6681 52.6773 52.6864 52.6955 52.7046 52.7137 52.7228 52.7319 52.741 52.75 52.759 52.7681 52.7771 52.7861 52.795 52.804 52.8129 52.8219 52.8307 52.8398 52.8485 52.8576 52.8662 52.8753 52.8838 52.893 52.9013 52.9105 52.9187 52.928 52.9361 52.9454 52.9534 52.9627 52.9707 52.9798 52.9877 51.1626 51.1745 51.1837 51.1915 51.1988 51.206 51.2133 51.2208 51.2284 51.236 51.2437 51.2515 51.2593 51.2672 51.2751 51.283 51.291 51.299 51.307 51.3151 51.3232 51.3313 51.3395 51.3477 51.356 51.3642 51.3726 51.3809 51.3893 51.3977 51.4061 51.4146 51.4231 51.4317 51.4402 51.4488 51.4574 51.4661 51.4748 51.4835 51.4923 51.501 51.5098 51.5187 51.5275 51.5364 51.5453 51.5543 51.5632 51.5723 51.5813 51.5903 51.5993 51.6084 51.6175 51.6267 51.6359 51.6451 51.6542 51.6633 51.6724 51.6815 51.6906 51.6997 51.7089 51.7187 51.729 51.74 51.7514 51.7628 51.7742 51.7854 51.7963 51.8067 51.8164 51.8255 51.8342 51.8428 51.8515 51.8603 51.8693 51.8785 51.8879 51.8974 51.907 51.9167 51.9264 51.9363 51.9462 51.9561 51.966 51.9759 51.9859 51.9958 52.0058 52.0158 52.0257 52.0357 52.0457 52.0556 52.0656 52.0755 52.0855 52.0954 52.1054 52.1153 52.1252 52.1352 52.1451 52.155 52.1649 52.1748 52.1846 52.1945 52.2043 52.2142 52.224 52.2338 52.2436 52.2534 52.2631 52.2729 52.2826 52.2923 52.302 52.3117 52.3213 52.331 52.3406 52.3502 52.3598 52.3694 52.3789 52.3884 52.398 52.4075 52.417 52.4264 52.4359 52.4453 52.4548 52.4642 52.4736 52.483 52.4923 52.5017 52.511 52.5204 52.5297 52.539 52.5483 52.5576 52.5668 52.5761 52.5854 52.5946 52.6038 52.6131 52.6223 52.6315 52.6406 52.6498 52.659 52.6681 52.6773 52.6864 52.6955 52.7046 52.7137 52.7228 52.7319 52.741 52.75 52.759 52.7681 52.7771 52.7861 52.795 52.804 52.8129 52.8219 52.8307 52.8398 52.8485 52.8576 52.8662 52.8753 52.8838 52.893 52.9013 52.9105 52.9187 52.928 52.9361 52.9454 52.9534 52.9627 52.9707 52.9798 52.9878 51.1648 51.174 51.1818 51.1892 51.1968 51.2045 51.2122 51.2199 51.2276 51.2353 51.2431 51.2509 51.2587 51.2666 51.2745 51.2825 51.2904 51.2984 51.3065 51.3145 51.3227 51.3308 51.339 51.3472 51.3554 51.3637 51.372 51.3804 51.3888 51.3972 51.4056 51.4141 51.4226 51.4311 51.4397 51.4483 51.4569 51.4656 51.4743 51.483 51.4917 51.5005 51.5093 51.5182 51.527 51.5359 51.5448 51.5538 51.5627 51.5717 51.5808 51.5898 51.5989 51.608 51.6171 51.6263 51.6355 51.6447 51.6539 51.6631 51.6724 51.6816 51.6909 51.7001 51.7092 51.7185 51.7281 51.7384 51.7492 51.7604 51.7716 51.7827 51.7938 51.8045 51.8147 51.8244 51.8336 51.8426 51.8515 51.8604 51.8695 51.8788 51.8881 51.8976 51.9072 51.9169 51.9267 51.9365 51.9463 51.9562 51.9661 51.976 51.986 51.9959 52.0059 52.0158 52.0258 52.0357 52.0457 52.0556 52.0656 52.0755 52.0855 52.0954 52.1054 52.1153 52.1252 52.1352 52.1451 52.155 52.1649 52.1748 52.1846 52.1945 52.2043 52.2142 52.224 52.2338 52.2436 52.2534 52.2631 52.2729 52.2826 52.2923 52.302 52.3117 52.3213 52.331 52.3406 52.3502 52.3598 52.3694 52.3789 52.3884 52.398 52.4075 52.417 52.4264 52.4359 52.4453 52.4548 52.4642 52.4736 52.483 52.4923 52.5017 52.511 52.5204 52.5297 52.539 52.5483 52.5576 52.5668 52.5761 52.5854 52.5946 52.6038 52.6131 52.6223 52.6315 52.6406 52.6498 52.659 52.6681 52.6773 52.6864 52.6955 52.7046 52.7137 52.7228 52.7319 52.741 52.75 52.759 52.7681 52.7771 52.7861 52.795 52.804 52.8129 52.8219 52.8307 52.8398 52.8485 52.8576 52.8662 52.8753 52.8838 52.893 52.9013 52.9105 52.9187 52.928 52.9361 52.9454 52.9534 52.9627 52.9707 52.9798 52.9878 51.1689 51.1763 51.1843 51.192 51.1994 51.2067 51.2141 51.2216 51.2291 51.2368 51.2444 51.2522 51.26 51.2678 51.2757 51.2836 51.2916 51.2996 51.3076 51.3157 51.3238 51.3319 51.3401 51.3483 51.3566 51.3649 51.3732 51.3815 51.3899 51.3983 51.4068 51.4152 51.4237 51.4323 51.4408 51.4494 51.4581 51.4667 51.4754 51.4841 51.4929 51.5017 51.5105 51.5193 51.5282 51.5371 51.546 51.5549 51.5639 51.5729 51.5819 51.591 51.6001 51.6092 51.6182 51.6274 51.6366 51.6458 51.655 51.6642 51.6734 51.6826 51.6918 51.701 51.7102 51.7193 51.7285 51.7381 51.7483 51.759 51.7701 51.7811 51.7922 51.8033 51.814 51.8241 51.8337 51.8429 51.8519 51.8609 51.87 51.8792 51.8885 51.898 51.9076 51.9172 51.9269 51.9367 51.9465 51.9564 51.9663 51.9762 51.9861 51.996 52.0059 52.0159 52.0258 52.0358 52.0457 52.0557 52.0656 52.0756 52.0855 52.0955 52.1054 52.1153 52.1253 52.1352 52.1451 52.155 52.1649 52.1748 52.1846 52.1945 52.2043 52.2142 52.224 52.2338 52.2436 52.2534 52.2631 52.2729 52.2826 52.2923 52.302 52.3117 52.3213 52.331 52.3406 52.3502 52.3598 52.3694 52.3789 52.3884 52.398 52.4075 52.417 52.4264 52.4359 52.4453 52.4548 52.4642 52.4736 52.483 52.4923 52.5017 52.511 52.5204 52.5297 52.539 52.5483 52.5576 52.5668 52.5761 52.5854 52.5946 52.6038 52.6131 52.6223 52.6315 52.6406 52.6498 52.659 52.6681 52.6773 52.6864 52.6955 52.7046 52.7137 52.7228 52.7319 52.741 52.75 52.759 52.7681 52.7771 52.7861 52.795 52.804 52.8129 52.8219 52.8307 52.8398 52.8485 52.8576 52.8662 52.8753 52.8838 52.893 52.9013 52.9105 52.9188 52.928 52.9361 52.9454 52.9534 52.9627 52.9707 52.9798 52.9877 51.1713 51.1773 51.1838 51.1908 51.1981 51.2058 51.2135 51.2212 51.229 51.2367 51.2444 51.2522 51.2601 51.268 51.2759 51.2839 51.2918 51.2998 51.3078 51.3159 51.324 51.3322 51.3403 51.3485 51.3568 51.3651 51.3734 51.3818 51.3901 51.3986 51.407 51.4155 51.424 51.4325 51.441 51.4497 51.4583 51.4669 51.4756 51.4843 51.4931 51.5019 51.5107 51.5195 51.5284 51.5373 51.5462 51.5551 51.5641 51.5731 51.5822 51.5912 51.6003 51.6094 51.6185 51.6277 51.6369 51.6461 51.6553 51.6646 51.6738 51.6831 51.6924 51.7017 51.711 51.7201 51.7293 51.7387 51.7486 51.7591 51.7702 51.7814 51.7926 51.8038 51.815 51.8258 51.8356 51.8447 51.8534 51.8621 51.8709 51.8799 51.8891 51.8984 51.9079 51.9175 51.9272 51.937 51.9468 51.9566 51.9664 51.9763 51.9862 51.9961 52.006 52.0159 52.0259 52.0358 52.0457 52.0557 52.0656 52.0756 52.0855 52.0955 52.1054 52.1153 52.1253 52.1352 52.1451 52.155 52.1649 52.1748 52.1846 52.1945 52.2043 52.2142 52.224 52.2338 52.2436 52.2534 52.2631 52.2729 52.2826 52.2923 52.302 52.3117 52.3213 52.331 52.3406 52.3502 52.3598 52.3694 52.3789 52.3884 52.398 52.4075 52.417 52.4264 52.4359 52.4453 52.4548 52.4642 52.4736 52.483 52.4923 52.5017 52.511 52.5204 52.5297 52.539 52.5483 52.5576 52.5668 52.5761 52.5854 52.5946 52.6038 52.6131 52.6223 52.6315 52.6406 52.6498 52.659 52.6681 52.6773 52.6864 52.6955 52.7046 52.7137 52.7228 52.7319 52.741 52.75 52.759 52.7681 52.7771 52.7861 52.795 52.804 52.8129 52.8219 52.8307 52.8398 52.8485 52.8576 52.8662 52.8753 52.8838 52.8929 52.9013 52.9105 52.9188 52.928 52.9362 52.9453 52.9536 52.9625 52.9708 52.9797 52.988 51.1748 51.179 51.1855 51.1928 51.2001 51.2074 51.2149 51.2223 51.2299 51.2375 51.2453 51.253 51.2609 51.2687 51.2766 51.2845 51.2925 51.3005 51.3085 51.3166 51.3247 51.3328 51.341 51.3492 51.3575 51.3658 51.3741 51.3824 51.3908 51.3992 51.4076 51.4161 51.4246 51.4332 51.4417 51.4503 51.459 51.4676 51.4763 51.485 51.4938 51.5025 51.5113 51.5202 51.529 51.5379 51.5469 51.5558 51.5648 51.5738 51.5828 51.5919 51.601 51.6101 51.6192 51.6284 51.6375 51.6468 51.656 51.6653 51.6745 51.6838 51.6931 51.7025 51.7118 51.7209 51.73 51.7394 51.7492 51.7597 51.7709 51.7827 51.7949 51.8066 51.8181 51.8295 51.8404 51.8499 51.8576 51.8652 51.873 51.8812 51.8899 51.899 51.9083 51.9178 51.9275 51.9372 51.947 51.9568 51.9666 51.9765 51.9863 51.9962 52.0061 52.016 52.0259 52.0358 52.0458 52.0557 52.0657 52.0756 52.0855 52.0955 52.1054 52.1153 52.1253 52.1352 52.1451 52.155 52.1649 52.1748 52.1846 52.1945 52.2043 52.2142 52.224 52.2338 52.2436 52.2534 52.2631 52.2729 52.2826 52.2923 52.302 52.3117 52.3213 52.331 52.3406 52.3502 52.3598 52.3694 52.3789 52.3884 52.398 52.4075 52.417 52.4264 52.4359 52.4453 52.4548 52.4642 52.4736 52.483 52.4923 52.5017 52.511 52.5204 52.5297 52.539 52.5483 52.5576 52.5668 52.5761 52.5854 52.5946 52.6038 52.6131 52.6223 52.6315 52.6406 52.6498 52.659 52.6681 52.6773 52.6864 52.6955 52.7046 52.7137 52.7228 52.7319 52.741 52.75 52.759 52.7681 52.7771 52.7861 52.795 52.804 52.813 52.8219 52.8308 52.8397 52.8486 52.8574 52.8663 52.8751 52.8841 52.8926 52.9017 52.9101 52.9191 52.9276 52.9365 52.945 52.9538 52.9623 52.9711 52.9792 52.9884 51.1779 51.1799 51.1852 51.1922 51.1995 51.207 51.2147 51.2225 51.2302 51.2379 51.2457 51.2535 51.2613 51.2692 51.2772 51.2851 51.293 51.301 51.309 51.3171 51.3252 51.3334 51.3416 51.3498 51.358 51.3663 51.3746 51.383 51.3913 51.3998 51.4082 51.4167 51.4252 51.4337 51.4423 51.4509 51.4595 51.4682 51.4768 51.4856 51.4943 51.5031 51.5119 51.5207 51.5296 51.5385 51.5474 51.5564 51.5654 51.5744 51.5834 51.5924 51.6015 51.6107 51.6198 51.6289 51.6381 51.6473 51.6566 51.6658 51.6751 51.6845 51.6938 51.7033 51.7127 51.7219 51.731 51.7402 51.7498 51.7601 51.7713 51.783 51.7966 51.8107 51.8233 51.8351 51.8466 51.8575 51.8662 51.8717 51.8774 51.884 51.8915 51.8998 51.9087 51.918 51.9276 51.9373 51.9471 51.9569 51.9667 51.9766 51.9864 51.9963 52.0062 52.0161 52.026 52.0359 52.0458 52.0557 52.0657 52.0756 52.0855 52.0955 52.1054 52.1153 52.1253 52.1352 52.1451 52.155 52.1649 52.1748 52.1846 52.1945 52.2043 52.2142 52.224 52.2338 52.2436 52.2534 52.2631 52.2729 52.2826 52.2923 52.302 52.3117 52.3213 52.331 52.3406 52.3502 52.3598 52.3694 52.3789 52.3884 52.398 52.4075 52.417 52.4264 52.4359 52.4453 52.4548 52.4642 52.4736 52.483 52.4923 52.5017 52.511 52.5204 52.5297 52.539 52.5483 52.5576 52.5668 52.5761 52.5854 52.5946 52.6038 52.6131 52.6223 52.6315 52.6406 52.6498 52.659 52.6681 52.6773 52.6864 52.6955 52.7046 52.7137 52.7228 52.7319 52.741 52.75 52.759 52.7681 52.7771 52.7861 52.795 52.804 52.813 52.8218 52.8309 52.8396 52.8487 52.8573 52.8665 52.875 52.8842 52.8925 52.9018 52.91 52.9193 52.9275 52.9367 52.9448 52.954 52.9621 52.9713 52.9792 52.9882 51.1804 51.1808 51.1866 51.1936 51.2008 51.208 51.2154 51.223 51.2306 51.2383 51.2461 51.2538 51.2617 51.2695 51.2774 51.2853 51.2932 51.3012 51.3093 51.3174 51.3255 51.3336 51.3418 51.35 51.3583 51.3665 51.3749 51.3832 51.3916 51.4 51.4084 51.4169 51.4254 51.4339 51.4425 51.4511 51.4597 51.4684 51.4771 51.4858 51.4945 51.5033 51.5121 51.5209 51.5298 51.5387 51.5476 51.5566 51.5656 51.5746 51.5836 51.5927 51.6018 51.6109 51.6201 51.6292 51.6384 51.6476 51.6569 51.6662 51.6755 51.6849 51.6943 51.7038 51.7132 51.7224 51.7315 51.7407 51.7504 51.761 51.7724 51.7849 51.8017 51.8205 51.8365 51.85 51.862 51.8734 51.8828 51.8862 51.8869 51.8895 51.8943 51.9008 51.9088 51.9177 51.9272 51.937 51.9469 51.9569 51.9668 51.9767 51.9865 51.9964 52.0063 52.0161 52.026 52.0359 52.0459 52.0558 52.0657 52.0756 52.0856 52.0955 52.1054 52.1153 52.1253 52.1352 52.1451 52.155 52.1649 52.1748 52.1846 52.1945 52.2043 52.2142 52.224 52.2338 52.2436 52.2534 52.2631 52.2729 52.2826 52.2923 52.302 52.3117 52.3213 52.331 52.3406 52.3502 52.3598 52.3694 52.3789 52.3884 52.398 52.4075 52.417 52.4264 52.4359 52.4453 52.4548 52.4642 52.4736 52.483 52.4923 52.5017 52.511 52.5204 52.5297 52.539 52.5483 52.5576 52.5668 52.5761 52.5854 52.5946 52.6038 52.6131 52.6223 52.6315 52.6406 52.6498 52.659 52.6681 52.6773 52.6864 52.6955 52.7046 52.7137 52.7228 52.7319 52.741 52.75 52.759 52.7681 52.7771 52.7861 52.795 52.804 52.813 52.8218 52.8309 52.8396 52.8487 52.8573 52.8665 52.8749 52.8842 52.8925 52.9018 52.91 52.9193 52.9274 52.9367 52.9448 52.954 52.962 52.9713 52.979 52.9882 51.1818 51.1808 51.1864 51.1935 51.2006 51.2079 51.2155 51.2232 51.2309 51.2386 51.2464 51.2542 51.262 51.2699 51.2778 51.2857 51.2936 51.3016 51.3097 51.3177 51.3259 51.334 51.3422 51.3504 51.3587 51.3669 51.3752 51.3836 51.392 51.4004 51.4088 51.4173 51.4258 51.4343 51.4429 51.4515 51.4601 51.4688 51.4775 51.4862 51.4949 51.5037 51.5125 51.5213 51.5302 51.5391 51.548 51.557 51.566 51.575 51.584 51.593 51.6021 51.6113 51.6204 51.6296 51.6387 51.648 51.6572 51.6665 51.6759 51.6852 51.6947 51.7042 51.7136 51.7227 51.7318 51.7411 51.751 51.7617 51.7733 51.7868 51.8076 51.8325 51.8534 51.8699 51.8831 51.8948 51.9044 51.9062 51.8996 51.8962 51.8967 51.9006 51.9072 51.9157 51.9253 51.9355 51.9459 51.9563 51.9665 51.9766 51.9865 51.9965 52.0063 52.0162 52.0261 52.036 52.0459 52.0558 52.0657 52.0756 52.0856 52.0955 52.1054 52.1153 52.1253 52.1352 52.1451 52.155 52.1649 52.1748 52.1846 52.1945 52.2043 52.2142 52.224 52.2338 52.2436 52.2534 52.2631 52.2729 52.2826 52.2923 52.302 52.3117 52.3213 52.331 52.3406 52.3502 52.3598 52.3694 52.3789 52.3884 52.398 52.4075 52.417 52.4264 52.4359 52.4453 52.4548 52.4642 52.4736 52.483 52.4923 52.5017 52.511 52.5204 52.5297 52.539 52.5483 52.5576 52.5668 52.5761 52.5854 52.5946 52.6038 52.6131 52.6223 52.6315 52.6406 52.6498 52.659 52.6681 52.6773 52.6864 52.6955 52.7046 52.7137 52.7228 52.7319 52.741 52.75 52.759 52.7681 52.7771 52.7861 52.7951 52.804 52.813 52.8218 52.8309 52.8396 52.8487 52.8573 52.8665 52.8749 52.8842 52.8925 52.9018 52.91 52.9193 52.9274 52.9367 52.9448 52.954 52.962 52.9713 52.9788 52.9882 51.1821 51.181 51.1866 51.1936 51.2007 51.2081 51.2156 51.2233 51.231 51.2387 51.2464 51.2542 51.262 51.2699 51.2778 51.2857 51.2936 51.3016 51.3097 51.3178 51.3259 51.334 51.3422 51.3504 51.3587 51.367 51.3753 51.3836 51.392 51.4004 51.4088 51.4173 51.4258 51.4343 51.4429 51.4515 51.4601 51.4688 51.4775 51.4862 51.4949 51.5037 51.5125 51.5214 51.5302 51.5391 51.548 51.557 51.566 51.575 51.584 51.5931 51.6022 51.6113 51.6205 51.6296 51.6388 51.648 51.6573 51.6666 51.676 51.6854 51.6948 51.7043 51.7137 51.7229 51.732 51.7413 51.7512 51.7621 51.7737 51.7877 51.8103 51.8374 51.8597 51.8768 51.8902 51.9018 51.9108 51.9103 51.9007 51.8949 51.8939 51.8973 51.904 51.9128 51.923 51.9339 51.9449 51.9557 51.9662 51.9765 51.9865 51.9964 52.0063 52.0162 52.0261 52.036 52.0459 52.0558 52.0657 52.0756 52.0856 52.0955 52.1054 52.1153 52.1253 52.1352 52.1451 52.155 52.1649 52.1748 52.1846 52.1945 52.2043 52.2142 52.224 52.2338 52.2436 52.2534 52.2631 52.2729 52.2826 52.2923 52.302 52.3117 52.3213 52.331 52.3406 52.3502 52.3598 52.3694 52.3789 52.3884 52.398 52.4075 52.417 52.4264 52.4359 52.4453 52.4548 52.4642 52.4736 52.483 52.4923 52.5017 52.511 52.5204 52.5297 52.539 52.5483 52.5576 52.5668 52.5761 52.5854 52.5946 52.6038 52.6131 52.6223 52.6315 52.6406 52.6498 52.659 52.6681 52.6773 52.6864 52.6955 52.7046 52.7137 52.7228 52.7319 52.741 52.75 52.759 52.7681 52.7771 52.7861 52.7951 52.804 52.813 52.8218 52.8309 52.8396 52.8487 52.8573 52.8665 52.8749 52.8842 52.8925 52.9018 52.91 52.9193 52.9274 52.9367 52.9448 52.954 52.962 52.9713 52.9787 52.9883 51.1825 51.1811 51.1867 51.1938 51.2009 51.2082 51.2158 51.2235 51.2312 51.2389 51.2467 51.2545 51.2623 51.2702 51.278 51.286 51.2939 51.3019 51.31 51.3181 51.3262 51.3343 51.3425 51.3507 51.359 51.3672 51.3755 51.3839 51.3923 51.4007 51.4091 51.4176 51.4261 51.4346 51.4432 51.4518 51.4604 51.4691 51.4778 51.4865 51.4952 51.504 51.5128 51.5216 51.5305 51.5394 51.5483 51.5573 51.5663 51.5753 51.5843 51.5934 51.6025 51.6116 51.6207 51.6299 51.6391 51.6483 51.6576 51.6669 51.6763 51.6856 51.6951 51.7046 51.714 51.7232 51.7323 51.7415 51.7514 51.7622 51.7738 51.7876 51.81 51.8378 51.8605 51.8776 51.8908 51.9022 51.91 51.9059 51.8952 51.8897 51.8894 51.8937 51.9015 51.9113 51.922 51.9333 51.9446 51.9556 51.9662 51.9765 51.9865 51.9965 52.0064 52.0162 52.0261 52.036 52.0459 52.0558 52.0657 52.0756 52.0856 52.0955 52.1054 52.1153 52.1253 52.1352 52.1451 52.155 52.1649 52.1748 52.1846 52.1945 52.2043 52.2142 52.224 52.2338 52.2436 52.2534 52.2631 52.2729 52.2826 52.2923 52.302 52.3117 52.3213 52.331 52.3406 52.3502 52.3598 52.3694 52.3789 52.3884 52.398 52.4075 52.417 52.4264 52.4359 52.4453 52.4548 52.4642 52.4736 52.483 52.4923 52.5017 52.511 52.5204 52.5297 52.539 52.5483 52.5576 52.5668 52.5761 52.5854 52.5946 52.6038 52.6131 52.6223 52.6315 52.6406 52.6498 52.659 52.6681 52.6773 52.6864 52.6955 52.7046 52.7137 52.7228 52.7319 52.741 52.75 52.759 52.7681 52.7771 52.786 52.7951 52.804 52.813 52.8218 52.8309 52.8396 52.8487 52.8573 52.8665 52.8749 52.8842 52.8925 52.9018 52.91 52.9193 52.9274 52.9367 52.9448 52.954 52.962 52.9713 52.9786 52.9884 51.1826 51.181 51.1865 51.1935 51.2006 51.208 51.2156 51.2232 51.2309 51.2386 51.2464 51.2542 51.262 51.2698 51.2777 51.2856 51.2936 51.3016 51.3097 51.3177 51.3259 51.334 51.3422 51.3504 51.3586 51.3669 51.3752 51.3836 51.3919 51.4004 51.4088 51.4173 51.4258 51.4343 51.4429 51.4515 51.4601 51.4688 51.4774 51.4862 51.4949 51.5037 51.5125 51.5213 51.5302 51.5391 51.548 51.557 51.566 51.575 51.584 51.5931 51.6022 51.6113 51.6205 51.6296 51.6388 51.6481 51.6574 51.6667 51.6761 51.6855 51.6951 51.7045 51.7137 51.7228 51.7319 51.7416 51.7521 51.7635 51.7764 51.7961 51.823 51.8448 51.861 51.8735 51.8844 51.8905 51.883 51.8726 51.8685 51.8705 51.8774 51.8873 51.8986 51.9104 51.9222 51.934 51.9456 51.9566 51.9668 51.9768 51.9867 51.9966 52.0064 52.0163 52.0261 52.036 52.0459 52.0558 52.0657 52.0756 52.0856 52.0955 52.1054 52.1153 52.1253 52.1352 52.1451 52.155 52.1649 52.1748 52.1846 52.1945 52.2043 52.2142 52.224 52.2338 52.2436 52.2534 52.2631 52.2729 52.2826 52.2923 52.302 52.3117 52.3213 52.331 52.3406 52.3502 52.3598 52.3694 52.3789 52.3884 52.398 52.4075 52.417 52.4264 52.4359 52.4453 52.4548 52.4642 52.4736 52.483 52.4923 52.5017 52.511 52.5204 52.5297 52.539 52.5483 52.5576 52.5668 52.5761 52.5854 52.5946 52.6038 52.6131 52.6223 52.6315 52.6406 52.6498 52.659 52.6681 52.6773 52.6864 52.6955 52.7046 52.7137 52.7228 52.7319 52.741 52.75 52.759 52.7681 52.7771 52.786 52.7951 52.804 52.813 52.8218 52.8309 52.8396 52.8487 52.8573 52.8665 52.8749 52.8842 52.8925 52.9018 52.91 52.9193 52.9274 52.9367 52.9448 52.954 52.962 52.9713 52.9785 52.9886 51.1832 51.1815 51.187 51.194 51.2012 51.2086 51.2162 51.2239 51.2316 51.2393 51.247 51.2548 51.2627 51.2705 51.2784 51.2863 51.2943 51.3023 51.3103 51.3184 51.3265 51.3347 51.3429 51.3511 51.3593 51.3676 51.3759 51.3843 51.3926 51.4011 51.4095 51.418 51.4265 51.435 51.4436 51.4522 51.4608 51.4695 51.4782 51.4869 51.4956 51.5044 51.5132 51.522 51.5309 51.5398 51.5487 51.5577 51.5667 51.5757 51.5847 51.5938 51.6029 51.612 51.6211 51.6303 51.6395 51.6488 51.658 51.6674 51.6768 51.6862 51.6955 51.7046 51.7137 51.7231 51.733 51.7438 51.7552 51.7673 51.7793 51.7907 51.8016 51.8103 51.8098 51.7873 51.7645 51.7541 51.7565 51.767 51.7823 51.8125 51.8509 51.8805 51.9023 51.9184 51.9312 51.9428 51.9528 51.9607 51.9691 51.978 51.9873 51.9968 52.0065 52.0163 52.0261 52.036 52.0459 52.0558 52.0657 52.0756 52.0856 52.0955 52.1054 52.1153 52.1253 52.1352 52.1451 52.155 52.1649 52.1748 52.1846 52.1945 52.2043 52.2142 52.224 52.2338 52.2436 52.2534 52.2631 52.2729 52.2826 52.2923 52.302 52.3117 52.3213 52.331 52.3406 52.3502 52.3598 52.3693 52.3789 52.3884 52.398 52.4075 52.417 52.4264 52.4359 52.4453 52.4548 52.4642 52.4736 52.4829 52.4923 52.5017 52.511 52.5204 52.5297 52.539 52.5483 52.5576 52.5668 52.5761 52.5854 52.5946 52.6038 52.613 52.6223 52.6315 52.6406 52.6498 52.659 52.6681 52.6773 52.6864 52.6955 52.7046 52.7137 52.7228 52.7319 52.741 52.75 52.759 52.7681 52.7771 52.786 52.795 52.804 52.813 52.8218 52.8309 52.8396 52.8487 52.8573 52.8665 52.8749 52.8842 52.8925 52.9018 52.91 52.9193 52.9274 52.9367 52.9448 52.954 52.962 52.9713 52.9784 52.9888 51.182 51.18 51.1856 51.1926 51.1996 51.207 51.2146 51.2223 51.2299 51.2377 51.2454 51.2532 51.261 51.2688 51.2767 51.2846 51.2926 51.3006 51.3086 51.3167 51.3248 51.3329 51.3411 51.3493 51.3576 51.3658 51.3741 51.3825 51.3908 51.3993 51.4077 51.4162 51.4246 51.4332 51.4417 51.4503 51.459 51.4676 51.4763 51.485 51.4937 51.5025 51.5113 51.5201 51.529 51.5379 51.5468 51.5558 51.5647 51.5737 51.5828 51.5919 51.601 51.6101 51.6192 51.6284 51.6377 51.647 51.6564 51.6659 51.6752 51.6845 51.6938 51.7032 51.713 51.7232 51.733 51.7415 51.7456 51.7314 51.6511 51.5079 51.3868 51.3033 51.26 51.2502 51.26 51.2879 51.3868 51.5554 51.6919 51.7904 51.8556 51.8958 51.9195 51.9343 51.9457 51.9528 51.9565 51.9622 51.9695 51.9778 51.9867 51.9961 52.0057 52.0154 52.0252 52.0351 52.045 52.0549 52.0648 52.0747 52.0847 52.0946 52.1045 52.1144 52.1244 52.1343 52.1442 52.1541 52.164 52.1739 52.1837 52.1936 52.2034 52.2133 52.2231 52.2329 52.2427 52.2525 52.2622 52.272 52.2817 52.2914 52.3011 52.3108 52.3204 52.3301 52.3397 52.3493 52.3589 52.3685 52.378 52.3876 52.3971 52.4066 52.4161 52.4255 52.435 52.4444 52.4539 52.4633 52.4727 52.4821 52.4914 52.5008 52.5101 52.5195 52.5288 52.5381 52.5474 52.5567 52.566 52.5752 52.5845 52.5937 52.603 52.6122 52.6214 52.6306 52.6398 52.6489 52.6581 52.6673 52.6764 52.6855 52.6947 52.7038 52.7129 52.722 52.731 52.7401 52.7491 52.7582 52.7672 52.7762 52.7852 52.7942 52.8031 52.8121 52.821 52.83 52.8387 52.8479 52.8564 52.8656 52.8741 52.8833 52.8916 52.9009 52.9091 52.9185 52.9266 52.9359 52.9439 52.9532 52.9612 52.9704 52.9777 52.9878 52.9938 52.9965 52.9986 53.0005 53.0022 53.0039 53.0057 53.0075 53.0095 53.0115 53.0135 53.0154 53.0171 53.0188 53.0207 53.0227 53.0246 53.0265 53.0285 53.0305 52.9941 52.9969 52.9991 53.001 53.0029 53.0047 53.0066 53.0085 53.0104 53.0123 53.0142 53.0161 53.0179 53.0199 53.0219 53.0238 53.0258 53.0277 53.0296 53.0316 52.9939 52.9968 52.999 53.0011 53.0029 53.0048 53.0067 53.0085 53.0105 53.0123 53.0143 53.0162 53.018 53.02 53.0218 53.0238 53.0256 53.0276 53.0293 53.0314 52.994 52.9968 52.999 53.0011 53.0029 53.0048 53.0066 53.0085 53.0104 53.0123 53.0142 53.0162 53.0181 53.0201 53.0219 53.0239 53.0256 53.0276 53.0294 53.0314 52.994 52.9968 52.9991 53.0012 53.0031 53.0049 53.0068 53.0086 53.0105 53.0124 53.0142 53.0162 53.018 53.02 53.0218 53.0238 53.0255 53.0275 53.0292 53.0312 52.9939 52.9967 52.999 53.001 53.0029 53.0048 53.0067 53.0085 53.0104 53.0123 53.0142 53.0161 53.018 53.02 53.0218 53.0238 53.0255 53.0275 53.0292 53.0312 52.9939 52.9966 52.9989 53.0011 53.0032 53.0051 53.007 53.0088 53.0106 53.0125 53.0143 53.0163 53.0181 53.0201 53.0218 53.0238 53.0256 53.0275 53.0292 53.0311 52.9937 52.9962 52.9984 53.0004 53.0023 53.0043 53.0062 53.0083 53.0102 53.0121 53.0139 53.0159 53.0176 53.0195 53.0213 53.0232 53.025 53.027 53.0288 53.0307 52.9936 52.9959 52.9982 53.0004 53.0025 53.0046 53.0065 53.0084 53.0103 53.0123 53.0141 53.0161 53.0179 53.0198 53.0216 53.0234 53.0252 53.0271 53.0288 53.0306 52.9933 52.9955 52.9975 52.9994 53.0013 53.0032 53.0052 53.0072 53.0091 53.011 53.0129 53.0149 53.0167 53.0186 53.0205 53.0224 53.0243 53.0262 53.0281 53.03 52.993 52.9951 52.9971 52.9993 53.0013 53.0034 53.0053 53.0072 53.0091 53.0111 53.013 53.0149 53.0168 53.0187 53.0206 53.0224 53.0243 53.0261 53.0279 53.0298 52.9929 52.9947 52.9964 52.9981 52.9998 53.0016 53.0035 53.0054 53.0073 53.0092 53.011 53.013 53.0149 53.0169 53.0187 53.0207 53.0226 53.0246 53.0265 53.0286 52.9927 52.9942 52.996 52.9979 53 53.0019 53.0039 53.0057 53.0077 53.0095 53.0115 53.0134 53.0153 53.0172 53.0191 53.021 53.023 53.0249 53.0268 53.0287 52.9918 52.9929 52.9943 52.9957 52.9973 52.999 53.0008 53.0027 53.0046 53.0065 53.0085 53.0106 53.0127 53.0147 53.0167 53.0187 53.0206 53.0226 53.0247 53.0268 52.9912 52.9921 52.9936 52.9954 52.9973 52.9992 53.0012 53.0032 53.0053 53.0072 53.0092 53.0112 53.0131 53.0151 53.0171 53.0192 53.0212 53.0233 53.0254 53.0276 52.9911 52.9919 52.9932 52.9948 52.9967 52.9987 53.0006 53.0027 53.0047 53.0067 53.0086 53.0105 53.0125 53.0145 53.0165 53.0186 53.0207 53.0228 53.025 53.0273 52.9911 52.9919 52.9933 52.9952 52.9972 52.9991 53.0011 53.0031 53.0051 53.007 53.009 53.011 53.013 53.015 53.0171 53.0191 53.0213 53.0234 53.0256 53.0278 52.9913 52.9918 52.993 52.9948 52.9966 52.9985 53.0005 53.0024 53.0043 53.0062 53.0082 53.0102 53.0122 53.0142 53.0162 53.0183 53.0204 53.0225 53.0247 53.027 52.9915 52.9918 52.9932 52.995 52.997 52.9988 53.0008 53.0027 53.0048 53.0067 53.0088 53.0108 53.0129 53.0149 53.017 53.0191 53.0213 53.0234 53.0256 53.0278 52.9904 52.9906 52.992 52.9938 52.9957 52.9976 52.9994 53.0013 53.0032 53.0051 53.0071 53.0091 53.0111 53.0131 53.0151 53.0171 53.0193 53.0214 53.0236 53.0258 53.0341 53.044 53.0549 53.0657 53.0762 53.0866 53.097 53.1075 53.1178 53.128 53.1381 53.1481 53.1581 53.168 53.1778 53.1875 53.1971 53.2067 53.2161 53.2255 53.2348 53.244 53.2531 53.2622 53.2711 53.2799 53.2887 53.2974 53.306 53.3145 53.323 53.3314 53.3396 53.3478 53.3558 53.3639 53.372 53.3801 53.388 53.3956 53.4031 53.4108 53.4192 53.4278 53.436 53.4423 53.4414 53.408 53.3031 53.2049 53.1456 53.1245 53.1285 53.1491 53.2299 53.3578 53.4496 53.5059 53.5367 53.5527 53.5615 53.5659 53.5656 53.5675 53.5713 53.576 53.5813 53.5868 53.5925 53.5982 53.6038 53.6094 53.615 53.6205 53.6259 53.6313 53.6366 53.6419 53.647 53.6521 53.6572 53.6622 53.6671 53.6719 53.6767 53.6813 53.686 53.6905 53.695 53.6994 53.7037 53.708 53.7122 53.7163 53.7203 53.7243 53.7282 53.732 53.7358 53.7394 53.743 53.7466 53.75 53.7534 53.7568 53.76 53.7632 53.7663 53.7693 53.7723 53.7752 53.778 53.7808 53.7834 53.7861 53.7886 53.7911 53.7935 53.7958 53.7981 53.8003 53.8024 53.8045 53.8065 53.8084 53.8102 53.812 53.8137 53.8153 53.8169 53.8184 53.8199 53.8212 53.8226 53.8238 53.8249 53.8261 53.8271 53.8281 53.8291 53.83 53.8308 53.8317 53.8324 53.8332 53.8339 53.8345 53.8351 53.8357 53.8363 53.8368 53.8373 53.8378 53.8383 53.8387 53.8392 53.8396 53.84 53.8404 53.8409 53.8413 53.8417 53.8421 53.8426 53.843 53.8435 53.844 53.8445 53.845 53.8455 53.846 53.8465 53.8471 53.8476 53.8482 53.8488 53.8493 53.8499 53.8505 53.8511 53.8516 53.8522 53.8527 53.8533 53.8538 53.8543 53.8547 53.8552 53.8556 53.8559 53.8563 53.8566 53.8568 53.857 53.8572 53.8573 53.8574 53.8574 53.8573 53.8572 53.8571 53.8569 53.8567 53.8564 53.8561 53.8557 53.8553 53.8549 53.8544 53.8539 53.8533 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.8439 53.8433 53.8428 53.8422 53.8417 53.8412 53.8407 53.8403 53.8399 53.8395 53.8391 53.8387 53.8384 53.8381 53.8378 53.8375 53.8373 53.837 53.8368 53.8366 53.8365 53.8363 53.8361 53.836 53.8359 53.8358 53.8357 53.8356 53.8355 53.8354 53.8353 53.8353 53.8352 53.8352 53.8351 53.8351 53.835 53.835 53.835 53.835 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8348 53.8348 53.8348 53.8348 53.8348 53.8348 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.835 53.835 53.835 53.835 53.8351 53.8351 53.8351 53.8352 53.8352 53.8353 53.8353 53.8354 53.8355 53.8355 53.8356 53.8357 53.8358 53.8359 53.836 53.8361 53.8363 53.8364 53.8366 53.8367 53.8369 53.8371 53.8373 53.8375 53.8378 53.838 53.8383 53.8385 53.8388 53.8391 53.8394 53.8397 53.8401 53.8404 53.8408 53.8411 53.8415 53.8419 53.8423 53.8427 53.8431 53.8435 53.8439 53.8443 53.8447 53.8451 53.8455 53.8458 53.8462 53.8466 53.8469 53.8473 53.8476 53.8479 53.8481 53.8484 53.8486 53.8488 53.849 53.8492 53.8493 53.8494 53.8495 53.8496 53.8496 53.8496 53.8496 53.8495 53.8495 53.8494 53.8493 53.8492 53.849 53.8489 53.8487 53.8485 53.8483 53.8481 53.8479 53.8477 53.8475 53.8473 53.8471 53.8469 53.8467 53.8465 53.8463 53.8462 53.846 53.8459 53.8458 53.8457 53.8456 53.8455 53.8455 53.8455 53.8455 53.8455 53.8455 53.8456 53.8457 53.8458 53.8459 53.8461 53.8463 53.8465 53.8467 53.847 53.8472 53.8475 53.8478 53.8481 53.8484 53.8488 53.8491 53.8495 53.8499 53.8503 53.8507 53.8511 53.8514 53.8518 53.8522 53.8526 53.853 53.8534 53.8537 53.8541 53.8544 53.8548 53.8551 53.8553 53.8556 53.8559 53.8561 53.8563 53.8564 53.8566 53.8567 53.8568 53.8569 53.8569 53.8569 53.8569 53.8569 53.8568 53.8568 53.8567 53.8565 53.8564 53.8562 53.8561 53.8559 53.8557 53.8555 53.8553 53.855 53.8548 53.8546 53.8543 53.8541 53.8538 53.8536 53.8534 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8517 53.8516 53.8514 53.8513 53.8511 53.851 53.8509 53.8508 53.8507 53.8506 53.8505 53.8504 53.8504 53.8503 53.8503 53.8502 53.8502 53.8502 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8502 53.8502 53.8502 53.8502 53.8502 53.8502 53.8502 53.8503 53.8503 53.8503 53.8503 53.8503 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8506 53.8506 53.8507 53.8507 53.8507 53.8508 53.8509 53.8509 53.851 53.8511 53.8511 53.8512 53.8513 53.8514 53.8515 53.8516 53.8517 53.8519 53.852 53.8521 53.8523 53.8525 53.8527 53.8528 53.8531 53.8533 53.8535 53.8537 53.854 53.8542 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8564 53.8567 53.8571 53.8574 53.8578 53.8581 53.8585 53.8588 53.8592 53.8595 53.8599 53.8602 53.8605 53.8608 53.8611 53.8614 53.8616 53.8618 53.862 53.8622 53.8623 53.8624 53.8625 53.8626 53.8626 53.8626 53.8626 53.8624 53.8624 53.8622 53.8621 53.8618 53.8616 53.8613 53.8611 53.8607 53.8605 53.86 53.8598 53.8592 53.859 53.8584 53.0353 53.0452 53.056 53.0669 53.0775 53.0879 53.0984 53.1089 53.1193 53.1295 53.1396 53.1497 53.1597 53.1696 53.1795 53.1892 53.1988 53.2084 53.2178 53.2272 53.2366 53.2458 53.2549 53.264 53.2729 53.2818 53.2905 53.2992 53.3079 53.3164 53.3248 53.3332 53.3415 53.3496 53.3577 53.3658 53.3738 53.3818 53.3895 53.3971 53.4049 53.4125 53.42 53.4273 53.4347 53.4427 53.4514 53.4599 53.4677 53.4719 53.4616 53.4321 53.411 53.4045 53.4101 53.4216 53.4493 53.4875 53.5149 53.5328 53.545 53.554 53.5612 53.5662 53.5709 53.5763 53.5818 53.5875 53.5932 53.5989 53.6046 53.6102 53.6158 53.6213 53.6267 53.6321 53.6374 53.6426 53.6478 53.6529 53.658 53.6629 53.6678 53.6727 53.6774 53.6821 53.6867 53.6913 53.6957 53.7001 53.7045 53.7087 53.7129 53.717 53.7211 53.725 53.7289 53.7328 53.7365 53.7402 53.7438 53.7473 53.7508 53.7542 53.7575 53.7608 53.7639 53.767 53.7701 53.773 53.7759 53.7788 53.7815 53.7842 53.7868 53.7894 53.7918 53.7942 53.7966 53.7988 53.801 53.8032 53.8052 53.8072 53.8091 53.811 53.8127 53.8144 53.8161 53.8176 53.8191 53.8206 53.822 53.8233 53.8245 53.8257 53.8268 53.8278 53.8288 53.8298 53.8307 53.8316 53.8324 53.8331 53.8339 53.8346 53.8352 53.8358 53.8364 53.837 53.8375 53.838 53.8385 53.839 53.8394 53.8399 53.8403 53.8407 53.8411 53.8416 53.842 53.8424 53.8428 53.8433 53.8437 53.8442 53.8447 53.8451 53.8456 53.8462 53.8467 53.8472 53.8478 53.8483 53.8489 53.8494 53.85 53.8506 53.8512 53.8517 53.8523 53.8529 53.8534 53.8539 53.8544 53.8549 53.8554 53.8558 53.8562 53.8566 53.8569 53.8572 53.8575 53.8577 53.8578 53.8579 53.858 53.858 53.858 53.8579 53.8578 53.8576 53.8573 53.8571 53.8567 53.8564 53.856 53.8555 53.855 53.8545 53.854 53.8534 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8476 53.847 53.8464 53.8457 53.8451 53.8445 53.844 53.8434 53.8429 53.8423 53.8418 53.8414 53.8409 53.8405 53.8401 53.8397 53.8393 53.839 53.8387 53.8384 53.8381 53.8379 53.8377 53.8374 53.8372 53.8371 53.8369 53.8367 53.8366 53.8365 53.8364 53.8363 53.8362 53.8361 53.836 53.8359 53.8359 53.8358 53.8358 53.8357 53.8357 53.8356 53.8356 53.8356 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8356 53.8356 53.8356 53.8357 53.8357 53.8357 53.8358 53.8358 53.8359 53.8359 53.836 53.8361 53.8362 53.8363 53.8363 53.8365 53.8366 53.8367 53.8368 53.837 53.8371 53.8373 53.8375 53.8377 53.8379 53.8381 53.8383 53.8385 53.8388 53.8391 53.8393 53.8396 53.8399 53.8403 53.8406 53.8409 53.8413 53.8417 53.842 53.8424 53.8428 53.8432 53.8436 53.844 53.8444 53.8448 53.8452 53.8456 53.846 53.8464 53.8467 53.8471 53.8474 53.8478 53.8481 53.8484 53.8486 53.8489 53.8491 53.8493 53.8495 53.8497 53.8498 53.8499 53.85 53.8501 53.8501 53.8501 53.8501 53.85 53.85 53.8499 53.8498 53.8496 53.8495 53.8493 53.8492 53.849 53.8488 53.8486 53.8484 53.8482 53.848 53.8478 53.8476 53.8474 53.8472 53.847 53.8468 53.8466 53.8465 53.8463 53.8462 53.8461 53.846 53.846 53.8459 53.8459 53.8459 53.8459 53.846 53.8461 53.8461 53.8463 53.8464 53.8466 53.8467 53.8469 53.8472 53.8474 53.8477 53.8479 53.8482 53.8486 53.8489 53.8492 53.8496 53.8499 53.8503 53.8507 53.8511 53.8515 53.8519 53.8523 53.8527 53.853 53.8534 53.8538 53.8542 53.8545 53.8549 53.8552 53.8555 53.8558 53.856 53.8563 53.8565 53.8567 53.8569 53.857 53.8571 53.8572 53.8573 53.8573 53.8573 53.8573 53.8573 53.8572 53.8572 53.8571 53.8569 53.8568 53.8566 53.8565 53.8563 53.8561 53.8559 53.8556 53.8554 53.8552 53.8549 53.8547 53.8545 53.8542 53.854 53.8537 53.8535 53.8533 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8518 53.8516 53.8515 53.8514 53.8513 53.8512 53.8511 53.851 53.8509 53.8508 53.8507 53.8507 53.8506 53.8506 53.8506 53.8505 53.8505 53.8505 53.8505 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8506 53.8506 53.8506 53.8506 53.8506 53.8506 53.8507 53.8507 53.8507 53.8507 53.8507 53.8508 53.8508 53.8508 53.8509 53.8509 53.8509 53.851 53.851 53.8511 53.8511 53.8512 53.8512 53.8513 53.8514 53.8514 53.8515 53.8516 53.8517 53.8518 53.8519 53.852 53.8522 53.8523 53.8524 53.8526 53.8528 53.8529 53.8531 53.8533 53.8536 53.8538 53.854 53.8543 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8563 53.8567 53.857 53.8573 53.8577 53.858 53.8584 53.8587 53.8591 53.8594 53.8598 53.8601 53.8605 53.8608 53.8611 53.8613 53.8616 53.8619 53.8621 53.8623 53.8624 53.8626 53.8627 53.8628 53.8628 53.8629 53.8628 53.8628 53.8627 53.8626 53.8624 53.8623 53.862 53.8619 53.8615 53.8614 53.8609 53.8607 53.8602 53.86 53.8594 53.8593 53.8587 53.0351 53.0449 53.0557 53.0665 53.077 53.0874 53.0979 53.1083 53.1187 53.1289 53.139 53.149 53.159 53.1689 53.1788 53.1885 53.1981 53.2077 53.2171 53.2265 53.2358 53.2451 53.2542 53.2632 53.2722 53.281 53.2898 53.2985 53.3071 53.3156 53.3241 53.3324 53.3407 53.3489 53.357 53.365 53.373 53.3808 53.3888 53.3968 53.4047 53.4122 53.4192 53.4259 53.4332 53.442 53.4512 53.4614 53.4733 53.4843 53.4939 53.5021 53.5064 53.4988 53.4895 53.4876 53.4929 53.5016 53.5128 53.5257 53.5368 53.5466 53.5554 53.5632 53.57 53.5758 53.5816 53.5875 53.5932 53.5989 53.6046 53.6102 53.6158 53.6213 53.6267 53.6321 53.6374 53.6426 53.6478 53.6529 53.658 53.6629 53.6678 53.6727 53.6774 53.6821 53.6867 53.6913 53.6958 53.7002 53.7045 53.7087 53.7129 53.717 53.7211 53.725 53.7289 53.7328 53.7365 53.7402 53.7438 53.7473 53.7508 53.7542 53.7575 53.7608 53.7639 53.767 53.7701 53.773 53.7759 53.7788 53.7815 53.7842 53.7868 53.7894 53.7918 53.7942 53.7966 53.7988 53.801 53.8032 53.8052 53.8072 53.8091 53.811 53.8127 53.8144 53.8161 53.8176 53.8191 53.8206 53.822 53.8233 53.8245 53.8257 53.8268 53.8278 53.8288 53.8298 53.8307 53.8316 53.8324 53.8331 53.8339 53.8346 53.8352 53.8358 53.8364 53.837 53.8375 53.838 53.8385 53.839 53.8394 53.8399 53.8403 53.8407 53.8411 53.8416 53.842 53.8424 53.8428 53.8433 53.8437 53.8442 53.8447 53.8452 53.8456 53.8462 53.8467 53.8472 53.8478 53.8483 53.8489 53.8494 53.85 53.8506 53.8512 53.8517 53.8523 53.8529 53.8534 53.8539 53.8544 53.8549 53.8554 53.8558 53.8562 53.8566 53.8569 53.8572 53.8575 53.8577 53.8578 53.858 53.858 53.858 53.858 53.8579 53.8578 53.8576 53.8573 53.8571 53.8567 53.8564 53.856 53.8555 53.855 53.8545 53.854 53.8534 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.844 53.8434 53.8429 53.8423 53.8418 53.8414 53.8409 53.8405 53.8401 53.8397 53.8394 53.839 53.8387 53.8384 53.8381 53.8379 53.8377 53.8374 53.8372 53.8371 53.8369 53.8367 53.8366 53.8365 53.8364 53.8363 53.8362 53.8361 53.836 53.8359 53.8359 53.8358 53.8358 53.8357 53.8357 53.8356 53.8356 53.8356 53.8356 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8356 53.8356 53.8356 53.8357 53.8357 53.8357 53.8358 53.8358 53.8359 53.8359 53.836 53.8361 53.8362 53.8363 53.8364 53.8365 53.8366 53.8367 53.8368 53.837 53.8371 53.8373 53.8375 53.8377 53.8379 53.8381 53.8383 53.8385 53.8388 53.8391 53.8393 53.8396 53.84 53.8403 53.8406 53.8409 53.8413 53.8417 53.842 53.8424 53.8428 53.8432 53.8436 53.844 53.8444 53.8448 53.8452 53.8456 53.846 53.8464 53.8467 53.8471 53.8474 53.8478 53.8481 53.8484 53.8486 53.8489 53.8491 53.8493 53.8495 53.8497 53.8498 53.8499 53.85 53.8501 53.8501 53.8501 53.8501 53.85 53.85 53.8499 53.8498 53.8496 53.8495 53.8493 53.8492 53.849 53.8488 53.8486 53.8484 53.8482 53.848 53.8478 53.8476 53.8474 53.8472 53.847 53.8468 53.8466 53.8465 53.8464 53.8462 53.8461 53.846 53.846 53.8459 53.8459 53.8459 53.8459 53.846 53.8461 53.8461 53.8463 53.8464 53.8466 53.8467 53.8469 53.8472 53.8474 53.8477 53.8479 53.8482 53.8486 53.8489 53.8492 53.8496 53.85 53.8503 53.8507 53.8511 53.8515 53.8519 53.8523 53.8527 53.8531 53.8534 53.8538 53.8542 53.8545 53.8549 53.8552 53.8555 53.8558 53.856 53.8563 53.8565 53.8567 53.8569 53.857 53.8571 53.8572 53.8573 53.8573 53.8574 53.8573 53.8573 53.8573 53.8572 53.8571 53.8569 53.8568 53.8566 53.8565 53.8563 53.8561 53.8559 53.8556 53.8554 53.8552 53.8549 53.8547 53.8545 53.8542 53.854 53.8537 53.8535 53.8533 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8518 53.8516 53.8515 53.8514 53.8513 53.8512 53.8511 53.851 53.8509 53.8508 53.8507 53.8507 53.8506 53.8506 53.8506 53.8505 53.8505 53.8505 53.8505 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8506 53.8506 53.8506 53.8506 53.8506 53.8506 53.8507 53.8507 53.8507 53.8507 53.8507 53.8508 53.8508 53.8508 53.8509 53.8509 53.8509 53.851 53.851 53.8511 53.8511 53.8512 53.8512 53.8513 53.8514 53.8514 53.8515 53.8516 53.8517 53.8518 53.8519 53.852 53.8522 53.8523 53.8524 53.8526 53.8528 53.8529 53.8531 53.8533 53.8536 53.8538 53.854 53.8543 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8563 53.8567 53.857 53.8573 53.8577 53.858 53.8584 53.8588 53.8591 53.8595 53.8598 53.8601 53.8605 53.8608 53.8611 53.8613 53.8616 53.8619 53.8621 53.8623 53.8624 53.8626 53.8627 53.8628 53.8628 53.8629 53.8628 53.8628 53.8627 53.8626 53.8624 53.8623 53.862 53.8619 53.8615 53.8614 53.8609 53.8607 53.8602 53.86 53.8594 53.8593 53.8587 53.0352 53.045 53.0558 53.0667 53.0772 53.0876 53.0981 53.1085 53.1189 53.1292 53.1393 53.1493 53.1593 53.1692 53.1791 53.1888 53.1984 53.208 53.2174 53.2268 53.2361 53.2454 53.2545 53.2635 53.2725 53.2813 53.2901 53.2988 53.3074 53.3159 53.3243 53.3327 53.341 53.3492 53.3573 53.3653 53.3732 53.3811 53.3889 53.3968 53.4048 53.4125 53.4198 53.4265 53.4332 53.4411 53.45 53.4594 53.4709 53.4857 53.4986 53.5094 53.5183 53.5246 53.5217 53.5134 53.5106 53.513 53.5197 53.528 53.5371 53.5463 53.555 53.5629 53.5697 53.5757 53.5816 53.5874 53.5932 53.5989 53.6046 53.6102 53.6158 53.6213 53.6267 53.6321 53.6374 53.6426 53.6478 53.6529 53.658 53.6629 53.6678 53.6727 53.6774 53.6821 53.6867 53.6913 53.6958 53.7002 53.7045 53.7087 53.7129 53.717 53.7211 53.725 53.7289 53.7328 53.7365 53.7402 53.7438 53.7473 53.7508 53.7542 53.7575 53.7608 53.7639 53.767 53.7701 53.773 53.7759 53.7788 53.7815 53.7842 53.7868 53.7894 53.7918 53.7942 53.7966 53.7988 53.801 53.8032 53.8052 53.8072 53.8091 53.811 53.8127 53.8144 53.8161 53.8176 53.8191 53.8206 53.822 53.8233 53.8245 53.8257 53.8268 53.8278 53.8288 53.8298 53.8307 53.8316 53.8324 53.8331 53.8339 53.8346 53.8352 53.8358 53.8364 53.837 53.8375 53.838 53.8385 53.839 53.8394 53.8399 53.8403 53.8407 53.8411 53.8416 53.842 53.8424 53.8428 53.8433 53.8437 53.8442 53.8447 53.8452 53.8456 53.8462 53.8467 53.8472 53.8478 53.8483 53.8489 53.8494 53.85 53.8506 53.8512 53.8517 53.8523 53.8529 53.8534 53.8539 53.8544 53.8549 53.8554 53.8558 53.8562 53.8566 53.8569 53.8572 53.8575 53.8577 53.8578 53.858 53.858 53.858 53.858 53.8579 53.8578 53.8576 53.8573 53.8571 53.8567 53.8564 53.856 53.8555 53.855 53.8545 53.854 53.8534 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.844 53.8434 53.8429 53.8423 53.8418 53.8414 53.8409 53.8405 53.8401 53.8397 53.8394 53.839 53.8387 53.8384 53.8381 53.8379 53.8377 53.8374 53.8372 53.8371 53.8369 53.8367 53.8366 53.8365 53.8364 53.8363 53.8362 53.8361 53.836 53.8359 53.8359 53.8358 53.8358 53.8357 53.8357 53.8356 53.8356 53.8356 53.8356 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8356 53.8356 53.8356 53.8357 53.8357 53.8357 53.8358 53.8358 53.8359 53.8359 53.836 53.8361 53.8362 53.8363 53.8364 53.8365 53.8366 53.8367 53.8368 53.837 53.8371 53.8373 53.8375 53.8377 53.8379 53.8381 53.8383 53.8385 53.8388 53.8391 53.8393 53.8396 53.84 53.8403 53.8406 53.8409 53.8413 53.8417 53.842 53.8424 53.8428 53.8432 53.8436 53.844 53.8444 53.8448 53.8452 53.8456 53.846 53.8464 53.8467 53.8471 53.8474 53.8478 53.8481 53.8484 53.8486 53.8489 53.8491 53.8493 53.8495 53.8497 53.8498 53.8499 53.85 53.8501 53.8501 53.8501 53.8501 53.85 53.85 53.8499 53.8498 53.8496 53.8495 53.8493 53.8492 53.849 53.8488 53.8486 53.8484 53.8482 53.848 53.8478 53.8476 53.8474 53.8472 53.847 53.8468 53.8466 53.8465 53.8464 53.8462 53.8461 53.846 53.846 53.8459 53.8459 53.8459 53.8459 53.846 53.8461 53.8461 53.8463 53.8464 53.8466 53.8467 53.8469 53.8472 53.8474 53.8477 53.8479 53.8482 53.8486 53.8489 53.8492 53.8496 53.85 53.8503 53.8507 53.8511 53.8515 53.8519 53.8523 53.8527 53.8531 53.8534 53.8538 53.8542 53.8545 53.8549 53.8552 53.8555 53.8558 53.856 53.8563 53.8565 53.8567 53.8569 53.857 53.8571 53.8572 53.8573 53.8573 53.8574 53.8573 53.8573 53.8573 53.8572 53.8571 53.8569 53.8568 53.8566 53.8565 53.8563 53.8561 53.8559 53.8556 53.8554 53.8552 53.8549 53.8547 53.8545 53.8542 53.854 53.8537 53.8535 53.8533 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8518 53.8516 53.8515 53.8514 53.8513 53.8512 53.8511 53.851 53.8509 53.8508 53.8507 53.8507 53.8506 53.8506 53.8506 53.8505 53.8505 53.8505 53.8505 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8506 53.8506 53.8506 53.8506 53.8506 53.8506 53.8507 53.8507 53.8507 53.8507 53.8507 53.8508 53.8508 53.8508 53.8509 53.8509 53.8509 53.851 53.851 53.8511 53.8511 53.8512 53.8512 53.8513 53.8514 53.8514 53.8515 53.8516 53.8517 53.8518 53.8519 53.852 53.8522 53.8523 53.8524 53.8526 53.8528 53.8529 53.8531 53.8533 53.8536 53.8538 53.854 53.8543 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8563 53.8567 53.857 53.8573 53.8577 53.858 53.8584 53.8588 53.8591 53.8595 53.8598 53.8601 53.8605 53.8608 53.8611 53.8613 53.8616 53.8619 53.8621 53.8623 53.8624 53.8626 53.8627 53.8628 53.8628 53.8629 53.8628 53.8628 53.8627 53.8626 53.8624 53.8623 53.862 53.8619 53.8615 53.8614 53.8609 53.8607 53.8602 53.86 53.8594 53.8593 53.8587 53.0352 53.045 53.0558 53.0665 53.0771 53.0875 53.0979 53.1083 53.1187 53.1289 53.139 53.1491 53.159 53.1689 53.1788 53.1885 53.1981 53.2077 53.2171 53.2265 53.2358 53.2451 53.2542 53.2632 53.2722 53.281 53.2898 53.2985 53.3071 53.3156 53.324 53.3324 53.3407 53.3489 53.357 53.365 53.3729 53.3808 53.3886 53.3965 53.4045 53.4122 53.4194 53.4262 53.4329 53.4408 53.4497 53.4592 53.4706 53.4859 53.4996 53.5109 53.5204 53.5281 53.5297 53.5227 53.5194 53.5203 53.5247 53.5314 53.5394 53.5476 53.5556 53.5629 53.5694 53.5756 53.5815 53.5874 53.5932 53.5989 53.6046 53.6102 53.6158 53.6213 53.6267 53.6321 53.6374 53.6426 53.6478 53.6529 53.658 53.6629 53.6678 53.6727 53.6774 53.6821 53.6867 53.6913 53.6958 53.7002 53.7045 53.7087 53.7129 53.717 53.7211 53.725 53.7289 53.7328 53.7365 53.7402 53.7438 53.7473 53.7508 53.7542 53.7575 53.7608 53.7639 53.767 53.7701 53.773 53.7759 53.7788 53.7815 53.7842 53.7868 53.7894 53.7918 53.7942 53.7966 53.7988 53.801 53.8032 53.8052 53.8072 53.8091 53.811 53.8127 53.8144 53.8161 53.8176 53.8191 53.8206 53.822 53.8233 53.8245 53.8257 53.8268 53.8278 53.8288 53.8298 53.8307 53.8316 53.8324 53.8331 53.8339 53.8346 53.8352 53.8358 53.8364 53.837 53.8375 53.838 53.8385 53.839 53.8394 53.8399 53.8403 53.8407 53.8411 53.8416 53.842 53.8424 53.8428 53.8433 53.8437 53.8442 53.8447 53.8452 53.8456 53.8462 53.8467 53.8472 53.8478 53.8483 53.8489 53.8494 53.85 53.8506 53.8512 53.8517 53.8523 53.8529 53.8534 53.8539 53.8544 53.8549 53.8554 53.8558 53.8562 53.8566 53.8569 53.8572 53.8575 53.8577 53.8578 53.858 53.858 53.858 53.858 53.8579 53.8578 53.8576 53.8573 53.8571 53.8567 53.8564 53.856 53.8555 53.855 53.8545 53.854 53.8534 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.844 53.8434 53.8429 53.8423 53.8418 53.8414 53.8409 53.8405 53.8401 53.8397 53.8394 53.839 53.8387 53.8384 53.8381 53.8379 53.8377 53.8374 53.8372 53.8371 53.8369 53.8367 53.8366 53.8365 53.8364 53.8363 53.8362 53.8361 53.836 53.8359 53.8359 53.8358 53.8358 53.8357 53.8357 53.8356 53.8356 53.8356 53.8356 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8356 53.8356 53.8356 53.8357 53.8357 53.8357 53.8358 53.8358 53.8359 53.8359 53.836 53.8361 53.8362 53.8363 53.8364 53.8365 53.8366 53.8367 53.8368 53.837 53.8371 53.8373 53.8375 53.8377 53.8379 53.8381 53.8383 53.8385 53.8388 53.8391 53.8393 53.8396 53.84 53.8403 53.8406 53.8409 53.8413 53.8417 53.842 53.8424 53.8428 53.8432 53.8436 53.844 53.8444 53.8448 53.8452 53.8456 53.846 53.8464 53.8467 53.8471 53.8474 53.8478 53.8481 53.8484 53.8486 53.8489 53.8491 53.8493 53.8495 53.8497 53.8498 53.8499 53.85 53.8501 53.8501 53.8501 53.8501 53.85 53.85 53.8499 53.8498 53.8496 53.8495 53.8493 53.8492 53.849 53.8488 53.8486 53.8484 53.8482 53.848 53.8478 53.8476 53.8474 53.8472 53.847 53.8468 53.8466 53.8465 53.8464 53.8462 53.8461 53.846 53.846 53.8459 53.8459 53.8459 53.8459 53.846 53.8461 53.8461 53.8463 53.8464 53.8466 53.8467 53.8469 53.8472 53.8474 53.8477 53.8479 53.8482 53.8486 53.8489 53.8492 53.8496 53.85 53.8503 53.8507 53.8511 53.8515 53.8519 53.8523 53.8527 53.8531 53.8534 53.8538 53.8542 53.8545 53.8549 53.8552 53.8555 53.8558 53.856 53.8563 53.8565 53.8567 53.8569 53.857 53.8571 53.8572 53.8573 53.8573 53.8574 53.8573 53.8573 53.8573 53.8572 53.8571 53.8569 53.8568 53.8566 53.8565 53.8563 53.8561 53.8559 53.8556 53.8554 53.8552 53.8549 53.8547 53.8545 53.8542 53.854 53.8537 53.8535 53.8533 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8518 53.8516 53.8515 53.8514 53.8513 53.8512 53.8511 53.851 53.8509 53.8508 53.8507 53.8507 53.8506 53.8506 53.8506 53.8505 53.8505 53.8505 53.8505 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8506 53.8506 53.8506 53.8506 53.8506 53.8506 53.8507 53.8507 53.8507 53.8507 53.8507 53.8508 53.8508 53.8508 53.8509 53.8509 53.8509 53.851 53.851 53.8511 53.8511 53.8512 53.8512 53.8513 53.8514 53.8514 53.8515 53.8516 53.8517 53.8518 53.8519 53.852 53.8522 53.8523 53.8524 53.8526 53.8528 53.8529 53.8531 53.8533 53.8536 53.8538 53.854 53.8543 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8563 53.8567 53.857 53.8573 53.8577 53.858 53.8584 53.8588 53.8591 53.8595 53.8598 53.8601 53.8605 53.8608 53.8611 53.8613 53.8616 53.8619 53.8621 53.8623 53.8624 53.8626 53.8627 53.8628 53.8628 53.8629 53.8628 53.8628 53.8627 53.8626 53.8624 53.8623 53.862 53.8619 53.8615 53.8614 53.8609 53.8607 53.8602 53.86 53.8594 53.8593 53.8587 53.0353 53.045 53.0558 53.0666 53.0771 53.0875 53.0979 53.1083 53.1186 53.1289 53.139 53.149 53.159 53.1689 53.1787 53.1885 53.1981 53.2076 53.2171 53.2265 53.2358 53.245 53.2541 53.2632 53.2721 53.281 53.2898 53.2985 53.3071 53.3156 53.324 53.3324 53.3407 53.3488 53.3569 53.365 53.3729 53.3807 53.3885 53.3964 53.4043 53.412 53.4193 53.4261 53.4327 53.4405 53.4494 53.4588 53.4698 53.4844 53.4979 53.5092 53.5189 53.5269 53.5304 53.5263 53.5243 53.5255 53.5295 53.5355 53.5424 53.5496 53.5566 53.5632 53.5695 53.5756 53.5815 53.5874 53.5932 53.5989 53.6046 53.6102 53.6158 53.6213 53.6267 53.6321 53.6374 53.6426 53.6478 53.6529 53.658 53.6629 53.6678 53.6727 53.6774 53.6821 53.6867 53.6913 53.6958 53.7002 53.7045 53.7087 53.7129 53.717 53.7211 53.725 53.7289 53.7328 53.7365 53.7402 53.7438 53.7473 53.7508 53.7542 53.7575 53.7608 53.7639 53.767 53.7701 53.773 53.7759 53.7788 53.7815 53.7842 53.7868 53.7894 53.7918 53.7942 53.7966 53.7988 53.801 53.8032 53.8052 53.8072 53.8091 53.811 53.8127 53.8144 53.8161 53.8176 53.8191 53.8206 53.822 53.8233 53.8245 53.8257 53.8268 53.8278 53.8288 53.8298 53.8307 53.8316 53.8324 53.8331 53.8339 53.8346 53.8352 53.8358 53.8364 53.837 53.8375 53.838 53.8385 53.839 53.8394 53.8399 53.8403 53.8407 53.8411 53.8416 53.842 53.8424 53.8428 53.8433 53.8437 53.8442 53.8447 53.8452 53.8456 53.8462 53.8467 53.8472 53.8478 53.8483 53.8489 53.8494 53.85 53.8506 53.8512 53.8517 53.8523 53.8529 53.8534 53.8539 53.8544 53.8549 53.8554 53.8558 53.8562 53.8566 53.8569 53.8572 53.8575 53.8577 53.8578 53.858 53.858 53.858 53.858 53.8579 53.8578 53.8576 53.8573 53.8571 53.8567 53.8564 53.856 53.8555 53.855 53.8545 53.854 53.8534 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.844 53.8434 53.8429 53.8423 53.8418 53.8414 53.8409 53.8405 53.8401 53.8397 53.8394 53.839 53.8387 53.8384 53.8381 53.8379 53.8377 53.8374 53.8372 53.8371 53.8369 53.8367 53.8366 53.8365 53.8364 53.8363 53.8362 53.8361 53.836 53.8359 53.8359 53.8358 53.8358 53.8357 53.8357 53.8356 53.8356 53.8356 53.8356 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8356 53.8356 53.8356 53.8357 53.8357 53.8357 53.8358 53.8358 53.8359 53.8359 53.836 53.8361 53.8362 53.8363 53.8364 53.8365 53.8366 53.8367 53.8368 53.837 53.8371 53.8373 53.8375 53.8377 53.8379 53.8381 53.8383 53.8385 53.8388 53.8391 53.8393 53.8396 53.84 53.8403 53.8406 53.8409 53.8413 53.8417 53.842 53.8424 53.8428 53.8432 53.8436 53.844 53.8444 53.8448 53.8452 53.8456 53.846 53.8464 53.8467 53.8471 53.8474 53.8478 53.8481 53.8484 53.8486 53.8489 53.8491 53.8493 53.8495 53.8497 53.8498 53.8499 53.85 53.8501 53.8501 53.8501 53.8501 53.85 53.85 53.8499 53.8498 53.8496 53.8495 53.8493 53.8492 53.849 53.8488 53.8486 53.8484 53.8482 53.848 53.8478 53.8476 53.8474 53.8472 53.847 53.8468 53.8466 53.8465 53.8464 53.8462 53.8461 53.846 53.846 53.8459 53.8459 53.8459 53.8459 53.846 53.8461 53.8461 53.8463 53.8464 53.8466 53.8467 53.8469 53.8472 53.8474 53.8477 53.8479 53.8482 53.8486 53.8489 53.8492 53.8496 53.85 53.8503 53.8507 53.8511 53.8515 53.8519 53.8523 53.8527 53.8531 53.8534 53.8538 53.8542 53.8545 53.8549 53.8552 53.8555 53.8558 53.856 53.8563 53.8565 53.8567 53.8569 53.857 53.8571 53.8572 53.8573 53.8573 53.8574 53.8573 53.8573 53.8573 53.8572 53.8571 53.8569 53.8568 53.8566 53.8565 53.8563 53.8561 53.8559 53.8556 53.8554 53.8552 53.8549 53.8547 53.8545 53.8542 53.854 53.8537 53.8535 53.8533 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8518 53.8516 53.8515 53.8514 53.8513 53.8512 53.8511 53.851 53.8509 53.8508 53.8507 53.8507 53.8506 53.8506 53.8506 53.8505 53.8505 53.8505 53.8505 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8506 53.8506 53.8506 53.8506 53.8506 53.8506 53.8507 53.8507 53.8507 53.8507 53.8507 53.8508 53.8508 53.8508 53.8509 53.8509 53.8509 53.851 53.851 53.8511 53.8511 53.8512 53.8512 53.8513 53.8514 53.8514 53.8515 53.8516 53.8517 53.8518 53.8519 53.852 53.8522 53.8523 53.8524 53.8526 53.8528 53.8529 53.8531 53.8533 53.8536 53.8538 53.854 53.8543 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8563 53.8567 53.857 53.8573 53.8577 53.858 53.8584 53.8588 53.8591 53.8595 53.8598 53.8601 53.8605 53.8608 53.8611 53.8613 53.8616 53.8619 53.8621 53.8623 53.8624 53.8626 53.8627 53.8628 53.8628 53.8629 53.8628 53.8628 53.8627 53.8626 53.8624 53.8623 53.862 53.8619 53.8615 53.8614 53.8609 53.8607 53.8602 53.86 53.8594 53.8593 53.8587 53.0355 53.0451 53.0556 53.0664 53.077 53.0874 53.0977 53.108 53.1183 53.1285 53.1387 53.1487 53.1586 53.1685 53.1783 53.1881 53.1977 53.2072 53.2167 53.2261 53.2354 53.2446 53.2537 53.2628 53.2717 53.2806 53.2893 53.2981 53.3067 53.3152 53.3236 53.332 53.3403 53.3484 53.3565 53.3646 53.3725 53.3803 53.3881 53.396 53.4039 53.4116 53.4189 53.4258 53.4325 53.4398 53.4485 53.4576 53.4675 53.479 53.4899 53.5 53.5093 53.5173 53.5217 53.5218 53.5236 53.5271 53.5321 53.538 53.5444 53.5508 53.5572 53.5635 53.5696 53.5756 53.5815 53.5873 53.5931 53.5989 53.6046 53.6102 53.6158 53.6213 53.6267 53.6321 53.6374 53.6426 53.6478 53.6529 53.658 53.6629 53.6678 53.6727 53.6774 53.6821 53.6867 53.6913 53.6958 53.7002 53.7045 53.7087 53.7129 53.717 53.7211 53.725 53.7289 53.7328 53.7365 53.7402 53.7438 53.7473 53.7508 53.7542 53.7575 53.7608 53.7639 53.767 53.7701 53.773 53.7759 53.7788 53.7815 53.7842 53.7868 53.7894 53.7918 53.7942 53.7966 53.7988 53.801 53.8032 53.8052 53.8072 53.8091 53.811 53.8127 53.8144 53.8161 53.8176 53.8191 53.8206 53.822 53.8233 53.8245 53.8257 53.8268 53.8278 53.8288 53.8298 53.8307 53.8316 53.8324 53.8331 53.8339 53.8346 53.8352 53.8358 53.8364 53.837 53.8375 53.838 53.8385 53.839 53.8394 53.8399 53.8403 53.8407 53.8411 53.8416 53.842 53.8424 53.8428 53.8433 53.8437 53.8442 53.8447 53.8452 53.8456 53.8462 53.8467 53.8472 53.8478 53.8483 53.8489 53.8494 53.85 53.8506 53.8512 53.8517 53.8523 53.8529 53.8534 53.8539 53.8544 53.8549 53.8554 53.8558 53.8562 53.8566 53.8569 53.8572 53.8575 53.8577 53.8578 53.858 53.858 53.858 53.858 53.8579 53.8578 53.8576 53.8573 53.8571 53.8567 53.8564 53.856 53.8555 53.855 53.8545 53.854 53.8534 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.844 53.8434 53.8429 53.8423 53.8418 53.8414 53.8409 53.8405 53.8401 53.8397 53.8394 53.839 53.8387 53.8384 53.8381 53.8379 53.8377 53.8374 53.8372 53.8371 53.8369 53.8367 53.8366 53.8365 53.8364 53.8363 53.8362 53.8361 53.836 53.8359 53.8359 53.8358 53.8358 53.8357 53.8357 53.8356 53.8356 53.8356 53.8356 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8356 53.8356 53.8356 53.8357 53.8357 53.8357 53.8358 53.8358 53.8359 53.8359 53.836 53.8361 53.8362 53.8363 53.8364 53.8365 53.8366 53.8367 53.8368 53.837 53.8371 53.8373 53.8375 53.8377 53.8379 53.8381 53.8383 53.8385 53.8388 53.8391 53.8393 53.8396 53.84 53.8403 53.8406 53.8409 53.8413 53.8417 53.842 53.8424 53.8428 53.8432 53.8436 53.844 53.8444 53.8448 53.8452 53.8456 53.846 53.8464 53.8467 53.8471 53.8474 53.8478 53.8481 53.8484 53.8486 53.8489 53.8491 53.8493 53.8495 53.8497 53.8498 53.8499 53.85 53.8501 53.8501 53.8501 53.8501 53.85 53.85 53.8499 53.8498 53.8496 53.8495 53.8493 53.8492 53.849 53.8488 53.8486 53.8484 53.8482 53.848 53.8478 53.8476 53.8474 53.8472 53.847 53.8468 53.8466 53.8465 53.8464 53.8462 53.8461 53.846 53.846 53.8459 53.8459 53.8459 53.8459 53.846 53.8461 53.8461 53.8463 53.8464 53.8466 53.8467 53.8469 53.8472 53.8474 53.8477 53.8479 53.8482 53.8486 53.8489 53.8492 53.8496 53.85 53.8503 53.8507 53.8511 53.8515 53.8519 53.8523 53.8527 53.8531 53.8534 53.8538 53.8542 53.8545 53.8549 53.8552 53.8555 53.8558 53.856 53.8563 53.8565 53.8567 53.8569 53.857 53.8571 53.8572 53.8573 53.8573 53.8574 53.8573 53.8573 53.8573 53.8572 53.8571 53.8569 53.8568 53.8566 53.8565 53.8563 53.8561 53.8559 53.8556 53.8554 53.8552 53.8549 53.8547 53.8545 53.8542 53.854 53.8537 53.8535 53.8533 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8518 53.8516 53.8515 53.8514 53.8513 53.8512 53.8511 53.851 53.8509 53.8508 53.8507 53.8507 53.8506 53.8506 53.8506 53.8505 53.8505 53.8505 53.8505 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8506 53.8506 53.8506 53.8506 53.8506 53.8506 53.8507 53.8507 53.8507 53.8507 53.8507 53.8508 53.8508 53.8508 53.8509 53.8509 53.8509 53.851 53.851 53.8511 53.8511 53.8512 53.8512 53.8513 53.8514 53.8514 53.8515 53.8516 53.8517 53.8518 53.8519 53.852 53.8522 53.8523 53.8524 53.8526 53.8528 53.8529 53.8531 53.8533 53.8536 53.8538 53.854 53.8543 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8563 53.8567 53.857 53.8573 53.8577 53.858 53.8584 53.8588 53.8591 53.8595 53.8598 53.8601 53.8605 53.8608 53.8611 53.8613 53.8616 53.8619 53.8621 53.8623 53.8624 53.8626 53.8627 53.8628 53.8628 53.8629 53.8628 53.8628 53.8627 53.8626 53.8624 53.8623 53.862 53.8619 53.8615 53.8614 53.8609 53.8607 53.8602 53.86 53.8594 53.8593 53.8587 53.0357 53.045 53.0552 53.0659 53.0767 53.0872 53.0975 53.1078 53.118 53.1282 53.1384 53.1484 53.1583 53.1682 53.178 53.1878 53.1974 53.207 53.2164 53.2258 53.2351 53.2443 53.2535 53.2625 53.2715 53.2803 53.2891 53.2978 53.3064 53.3149 53.3233 53.3317 53.34 53.3481 53.3562 53.3643 53.3722 53.38 53.3878 53.3955 53.4033 53.411 53.4185 53.4255 53.4323 53.4394 53.4472 53.4558 53.4648 53.474 53.4834 53.4927 53.5013 53.5087 53.5133 53.5173 53.5219 53.5271 53.5328 53.5389 53.545 53.5512 53.5574 53.5635 53.5695 53.5755 53.5814 53.5873 53.5931 53.5988 53.6045 53.6102 53.6157 53.6212 53.6267 53.6321 53.6374 53.6426 53.6478 53.6529 53.658 53.6629 53.6678 53.6727 53.6774 53.6821 53.6867 53.6913 53.6958 53.7002 53.7045 53.7087 53.7129 53.717 53.7211 53.725 53.7289 53.7328 53.7365 53.7402 53.7438 53.7473 53.7508 53.7542 53.7575 53.7608 53.7639 53.767 53.7701 53.773 53.7759 53.7788 53.7815 53.7842 53.7868 53.7894 53.7918 53.7942 53.7966 53.7988 53.801 53.8032 53.8052 53.8072 53.8091 53.811 53.8127 53.8144 53.8161 53.8176 53.8191 53.8206 53.822 53.8233 53.8245 53.8257 53.8268 53.8278 53.8288 53.8298 53.8307 53.8316 53.8324 53.8331 53.8339 53.8346 53.8352 53.8358 53.8364 53.837 53.8375 53.838 53.8385 53.839 53.8394 53.8399 53.8403 53.8407 53.8411 53.8416 53.842 53.8424 53.8428 53.8433 53.8437 53.8442 53.8447 53.8452 53.8456 53.8462 53.8467 53.8472 53.8478 53.8483 53.8489 53.8494 53.85 53.8506 53.8512 53.8517 53.8523 53.8529 53.8534 53.8539 53.8544 53.8549 53.8554 53.8558 53.8562 53.8566 53.8569 53.8572 53.8575 53.8577 53.8578 53.858 53.858 53.858 53.858 53.8579 53.8578 53.8576 53.8573 53.8571 53.8567 53.8564 53.856 53.8555 53.855 53.8545 53.854 53.8534 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.844 53.8434 53.8429 53.8423 53.8418 53.8414 53.8409 53.8405 53.8401 53.8397 53.8394 53.839 53.8387 53.8384 53.8381 53.8379 53.8377 53.8374 53.8372 53.8371 53.8369 53.8367 53.8366 53.8365 53.8364 53.8363 53.8362 53.8361 53.836 53.8359 53.8359 53.8358 53.8358 53.8357 53.8357 53.8356 53.8356 53.8356 53.8356 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8356 53.8356 53.8356 53.8357 53.8357 53.8357 53.8358 53.8358 53.8359 53.8359 53.836 53.8361 53.8362 53.8363 53.8364 53.8365 53.8366 53.8367 53.8368 53.837 53.8371 53.8373 53.8375 53.8377 53.8379 53.8381 53.8383 53.8385 53.8388 53.8391 53.8393 53.8396 53.84 53.8403 53.8406 53.8409 53.8413 53.8417 53.842 53.8424 53.8428 53.8432 53.8436 53.844 53.8444 53.8448 53.8452 53.8456 53.846 53.8464 53.8467 53.8471 53.8474 53.8478 53.8481 53.8484 53.8486 53.8489 53.8491 53.8493 53.8495 53.8497 53.8498 53.8499 53.85 53.8501 53.8501 53.8501 53.8501 53.85 53.85 53.8499 53.8498 53.8496 53.8495 53.8493 53.8492 53.849 53.8488 53.8486 53.8484 53.8482 53.848 53.8478 53.8476 53.8474 53.8472 53.847 53.8468 53.8466 53.8465 53.8464 53.8462 53.8461 53.846 53.846 53.8459 53.8459 53.8459 53.8459 53.846 53.8461 53.8461 53.8463 53.8464 53.8466 53.8467 53.8469 53.8472 53.8474 53.8477 53.8479 53.8482 53.8486 53.8489 53.8492 53.8496 53.85 53.8503 53.8507 53.8511 53.8515 53.8519 53.8523 53.8527 53.8531 53.8534 53.8538 53.8542 53.8545 53.8549 53.8552 53.8555 53.8558 53.856 53.8563 53.8565 53.8567 53.8569 53.857 53.8571 53.8572 53.8573 53.8573 53.8574 53.8573 53.8573 53.8573 53.8572 53.8571 53.8569 53.8568 53.8566 53.8565 53.8563 53.8561 53.8559 53.8556 53.8554 53.8552 53.8549 53.8547 53.8545 53.8542 53.854 53.8537 53.8535 53.8533 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8518 53.8516 53.8515 53.8514 53.8513 53.8512 53.8511 53.851 53.8509 53.8508 53.8507 53.8507 53.8506 53.8506 53.8506 53.8505 53.8505 53.8505 53.8505 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8506 53.8506 53.8506 53.8506 53.8506 53.8506 53.8507 53.8507 53.8507 53.8507 53.8507 53.8508 53.8508 53.8508 53.8509 53.8509 53.8509 53.851 53.851 53.8511 53.8511 53.8512 53.8512 53.8513 53.8514 53.8514 53.8515 53.8516 53.8517 53.8518 53.8519 53.852 53.8522 53.8523 53.8524 53.8526 53.8528 53.8529 53.8531 53.8533 53.8536 53.8538 53.854 53.8543 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8563 53.8567 53.857 53.8573 53.8577 53.858 53.8584 53.8588 53.8591 53.8595 53.8598 53.8601 53.8605 53.8608 53.8611 53.8613 53.8616 53.8619 53.8621 53.8623 53.8624 53.8626 53.8627 53.8628 53.8628 53.8629 53.8628 53.8628 53.8627 53.8626 53.8624 53.8623 53.862 53.8619 53.8615 53.8614 53.8609 53.8607 53.8602 53.86 53.8594 53.8593 53.8587 53.0358 53.0457 53.0555 53.0658 53.0764 53.0869 53.0973 53.1074 53.1176 53.1277 53.1378 53.1478 53.1578 53.1677 53.1775 53.1872 53.1968 53.2063 53.2158 53.2252 53.2345 53.2437 53.2528 53.2619 53.2708 53.2797 53.2885 53.2972 53.3058 53.3143 53.3227 53.3311 53.3393 53.3475 53.3556 53.3637 53.3716 53.3794 53.3872 53.3949 53.4026 53.4102 53.4175 53.4245 53.4314 53.4388 53.4468 53.4549 53.4635 53.4724 53.4813 53.4898 53.4973 53.5035 53.5093 53.5149 53.5207 53.5266 53.5326 53.5388 53.545 53.5511 53.5573 53.5634 53.5694 53.5754 53.5813 53.5872 53.593 53.5988 53.6045 53.6101 53.6157 53.6212 53.6267 53.6321 53.6374 53.6426 53.6478 53.6529 53.658 53.6629 53.6678 53.6727 53.6774 53.6821 53.6867 53.6913 53.6958 53.7002 53.7045 53.7087 53.7129 53.717 53.7211 53.725 53.7289 53.7328 53.7365 53.7402 53.7438 53.7473 53.7508 53.7542 53.7575 53.7608 53.7639 53.767 53.7701 53.773 53.7759 53.7788 53.7815 53.7842 53.7868 53.7894 53.7918 53.7942 53.7966 53.7988 53.801 53.8032 53.8052 53.8072 53.8091 53.811 53.8127 53.8144 53.8161 53.8176 53.8191 53.8206 53.822 53.8233 53.8245 53.8257 53.8268 53.8278 53.8288 53.8298 53.8307 53.8316 53.8324 53.8331 53.8339 53.8346 53.8352 53.8358 53.8364 53.837 53.8375 53.838 53.8385 53.839 53.8394 53.8399 53.8403 53.8407 53.8411 53.8416 53.842 53.8424 53.8428 53.8433 53.8437 53.8442 53.8447 53.8452 53.8456 53.8462 53.8467 53.8472 53.8478 53.8483 53.8489 53.8494 53.85 53.8506 53.8512 53.8517 53.8523 53.8529 53.8534 53.8539 53.8544 53.8549 53.8554 53.8558 53.8562 53.8566 53.8569 53.8572 53.8575 53.8577 53.8578 53.858 53.858 53.858 53.858 53.8579 53.8578 53.8576 53.8573 53.8571 53.8567 53.8564 53.856 53.8555 53.855 53.8545 53.854 53.8534 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.844 53.8434 53.8429 53.8423 53.8418 53.8414 53.8409 53.8405 53.8401 53.8397 53.8394 53.839 53.8387 53.8384 53.8381 53.8379 53.8377 53.8374 53.8372 53.8371 53.8369 53.8367 53.8366 53.8365 53.8364 53.8363 53.8362 53.8361 53.836 53.8359 53.8359 53.8358 53.8358 53.8357 53.8357 53.8356 53.8356 53.8356 53.8356 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8356 53.8356 53.8356 53.8357 53.8357 53.8357 53.8358 53.8358 53.8359 53.8359 53.836 53.8361 53.8362 53.8363 53.8364 53.8365 53.8366 53.8367 53.8368 53.837 53.8371 53.8373 53.8375 53.8377 53.8379 53.8381 53.8383 53.8385 53.8388 53.8391 53.8393 53.8396 53.84 53.8403 53.8406 53.8409 53.8413 53.8417 53.842 53.8424 53.8428 53.8432 53.8436 53.844 53.8444 53.8448 53.8452 53.8456 53.846 53.8464 53.8467 53.8471 53.8474 53.8478 53.8481 53.8484 53.8486 53.8489 53.8491 53.8493 53.8495 53.8497 53.8498 53.8499 53.85 53.8501 53.8501 53.8501 53.8501 53.85 53.85 53.8499 53.8498 53.8496 53.8495 53.8493 53.8492 53.849 53.8488 53.8486 53.8484 53.8482 53.848 53.8478 53.8476 53.8474 53.8472 53.847 53.8468 53.8466 53.8465 53.8464 53.8462 53.8461 53.846 53.846 53.8459 53.8459 53.8459 53.8459 53.846 53.8461 53.8461 53.8463 53.8464 53.8466 53.8467 53.8469 53.8472 53.8474 53.8477 53.8479 53.8482 53.8486 53.8489 53.8492 53.8496 53.85 53.8503 53.8507 53.8511 53.8515 53.8519 53.8523 53.8527 53.8531 53.8534 53.8538 53.8542 53.8545 53.8549 53.8552 53.8555 53.8558 53.856 53.8563 53.8565 53.8567 53.8569 53.857 53.8571 53.8572 53.8573 53.8573 53.8574 53.8573 53.8573 53.8573 53.8572 53.8571 53.8569 53.8568 53.8566 53.8565 53.8563 53.8561 53.8559 53.8556 53.8554 53.8552 53.8549 53.8547 53.8545 53.8542 53.854 53.8537 53.8535 53.8533 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8518 53.8516 53.8515 53.8514 53.8513 53.8512 53.8511 53.851 53.8509 53.8508 53.8507 53.8507 53.8506 53.8506 53.8506 53.8505 53.8505 53.8505 53.8505 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8506 53.8506 53.8506 53.8506 53.8506 53.8506 53.8507 53.8507 53.8507 53.8507 53.8507 53.8508 53.8508 53.8508 53.8509 53.8509 53.8509 53.851 53.851 53.8511 53.8511 53.8512 53.8512 53.8513 53.8514 53.8514 53.8515 53.8516 53.8517 53.8518 53.8519 53.852 53.8522 53.8523 53.8524 53.8526 53.8528 53.8529 53.8531 53.8533 53.8536 53.8538 53.854 53.8543 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8563 53.8567 53.857 53.8573 53.8577 53.858 53.8584 53.8588 53.8591 53.8595 53.8598 53.8601 53.8605 53.8608 53.8611 53.8613 53.8616 53.8619 53.8621 53.8623 53.8624 53.8626 53.8627 53.8628 53.8628 53.8629 53.8628 53.8628 53.8627 53.8626 53.8624 53.8623 53.862 53.8619 53.8615 53.8614 53.8609 53.8607 53.8602 53.86 53.8594 53.8593 53.8587 53.0357 53.0457 53.0556 53.0656 53.0759 53.0863 53.0967 53.1069 53.1171 53.1271 53.1372 53.1471 53.1571 53.1669 53.1767 53.1864 53.1961 53.2056 53.2151 53.2245 53.2338 53.243 53.2521 53.2612 53.2701 53.279 53.2878 53.2965 53.3051 53.3136 53.322 53.3304 53.3387 53.3468 53.3549 53.3629 53.3709 53.3788 53.3865 53.3941 53.4018 53.4095 53.4168 53.4237 53.4307 53.4381 53.4459 53.4541 53.4627 53.4715 53.4801 53.4881 53.4953 53.5018 53.508 53.5141 53.5201 53.5262 53.5324 53.5385 53.5447 53.5509 53.5571 53.5632 53.5692 53.5753 53.5812 53.5871 53.593 53.5987 53.6045 53.6101 53.6157 53.6212 53.6267 53.6321 53.6374 53.6426 53.6478 53.6529 53.658 53.6629 53.6678 53.6727 53.6774 53.6821 53.6867 53.6913 53.6958 53.7002 53.7045 53.7087 53.7129 53.717 53.7211 53.725 53.7289 53.7328 53.7365 53.7402 53.7438 53.7473 53.7508 53.7542 53.7575 53.7608 53.7639 53.767 53.7701 53.773 53.7759 53.7788 53.7815 53.7842 53.7868 53.7894 53.7918 53.7942 53.7966 53.7988 53.801 53.8032 53.8052 53.8072 53.8091 53.811 53.8127 53.8144 53.8161 53.8176 53.8191 53.8206 53.822 53.8233 53.8245 53.8257 53.8268 53.8278 53.8288 53.8298 53.8307 53.8316 53.8324 53.8331 53.8339 53.8346 53.8352 53.8358 53.8364 53.837 53.8375 53.838 53.8385 53.839 53.8394 53.8399 53.8403 53.8407 53.8411 53.8416 53.842 53.8424 53.8428 53.8433 53.8437 53.8442 53.8447 53.8452 53.8456 53.8462 53.8467 53.8472 53.8478 53.8483 53.8489 53.8494 53.85 53.8506 53.8512 53.8517 53.8523 53.8529 53.8534 53.8539 53.8544 53.8549 53.8554 53.8558 53.8562 53.8566 53.8569 53.8572 53.8575 53.8577 53.8578 53.858 53.858 53.858 53.858 53.8579 53.8578 53.8576 53.8573 53.8571 53.8567 53.8564 53.856 53.8555 53.855 53.8545 53.854 53.8534 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.844 53.8434 53.8429 53.8423 53.8418 53.8414 53.8409 53.8405 53.8401 53.8397 53.8394 53.839 53.8387 53.8384 53.8381 53.8379 53.8377 53.8374 53.8372 53.8371 53.8369 53.8367 53.8366 53.8365 53.8364 53.8363 53.8362 53.8361 53.836 53.8359 53.8359 53.8358 53.8358 53.8357 53.8357 53.8356 53.8356 53.8356 53.8356 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8356 53.8356 53.8356 53.8357 53.8357 53.8357 53.8358 53.8358 53.8359 53.8359 53.836 53.8361 53.8362 53.8363 53.8364 53.8365 53.8366 53.8367 53.8368 53.837 53.8371 53.8373 53.8375 53.8377 53.8379 53.8381 53.8383 53.8385 53.8388 53.8391 53.8393 53.8396 53.84 53.8403 53.8406 53.8409 53.8413 53.8417 53.842 53.8424 53.8428 53.8432 53.8436 53.844 53.8444 53.8448 53.8452 53.8456 53.846 53.8464 53.8467 53.8471 53.8474 53.8478 53.8481 53.8484 53.8486 53.8489 53.8491 53.8493 53.8495 53.8497 53.8498 53.8499 53.85 53.8501 53.8501 53.8501 53.8501 53.85 53.85 53.8499 53.8498 53.8496 53.8495 53.8493 53.8492 53.849 53.8488 53.8486 53.8484 53.8482 53.848 53.8478 53.8476 53.8474 53.8472 53.847 53.8468 53.8466 53.8465 53.8464 53.8462 53.8461 53.846 53.846 53.8459 53.8459 53.8459 53.8459 53.846 53.8461 53.8461 53.8463 53.8464 53.8466 53.8467 53.8469 53.8472 53.8474 53.8477 53.8479 53.8482 53.8486 53.8489 53.8492 53.8496 53.85 53.8503 53.8507 53.8511 53.8515 53.8519 53.8523 53.8527 53.8531 53.8534 53.8538 53.8542 53.8545 53.8549 53.8552 53.8555 53.8558 53.856 53.8563 53.8565 53.8567 53.8569 53.857 53.8571 53.8572 53.8573 53.8573 53.8574 53.8573 53.8573 53.8573 53.8572 53.8571 53.8569 53.8568 53.8566 53.8565 53.8563 53.8561 53.8559 53.8556 53.8554 53.8552 53.8549 53.8547 53.8545 53.8542 53.854 53.8537 53.8535 53.8533 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8518 53.8516 53.8515 53.8514 53.8513 53.8512 53.8511 53.851 53.8509 53.8508 53.8507 53.8507 53.8506 53.8506 53.8506 53.8505 53.8505 53.8505 53.8505 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8506 53.8506 53.8506 53.8506 53.8506 53.8506 53.8507 53.8507 53.8507 53.8507 53.8507 53.8508 53.8508 53.8508 53.8509 53.8509 53.8509 53.851 53.851 53.8511 53.8511 53.8512 53.8512 53.8513 53.8514 53.8514 53.8515 53.8516 53.8517 53.8518 53.8519 53.852 53.8522 53.8523 53.8524 53.8526 53.8528 53.8529 53.8531 53.8533 53.8536 53.8538 53.854 53.8543 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8563 53.8567 53.857 53.8573 53.8577 53.858 53.8584 53.8588 53.8591 53.8595 53.8598 53.8601 53.8605 53.8608 53.8611 53.8613 53.8616 53.8619 53.8621 53.8623 53.8624 53.8626 53.8627 53.8628 53.8628 53.8629 53.8628 53.8628 53.8627 53.8626 53.8624 53.8623 53.862 53.8619 53.8615 53.8614 53.8609 53.8607 53.8602 53.86 53.8594 53.8593 53.8587 53.0357 53.0459 53.0562 53.0664 53.0765 53.0865 53.0965 53.1066 53.1168 53.127 53.1371 53.1471 53.157 53.1668 53.1766 53.1863 53.1959 53.2055 53.2149 53.2243 53.2336 53.2428 53.2519 53.261 53.2699 53.2788 53.2876 53.2963 53.3049 53.3133 53.3218 53.3302 53.3385 53.3466 53.3546 53.3627 53.3706 53.3785 53.3862 53.3938 53.4014 53.4089 53.416 53.4228 53.4299 53.4376 53.4456 53.454 53.4628 53.4717 53.4803 53.4882 53.4953 53.5018 53.5079 53.5139 53.5199 53.526 53.5321 53.5383 53.5445 53.5507 53.5569 53.563 53.5691 53.5752 53.5811 53.5871 53.5929 53.5987 53.6044 53.6101 53.6157 53.6212 53.6267 53.6321 53.6374 53.6426 53.6478 53.6529 53.658 53.6629 53.6678 53.6727 53.6774 53.6821 53.6867 53.6913 53.6958 53.7002 53.7045 53.7087 53.7129 53.717 53.7211 53.725 53.7289 53.7328 53.7365 53.7402 53.7438 53.7473 53.7508 53.7542 53.7575 53.7608 53.7639 53.767 53.7701 53.773 53.7759 53.7788 53.7815 53.7842 53.7868 53.7894 53.7918 53.7942 53.7966 53.7988 53.801 53.8032 53.8052 53.8072 53.8091 53.811 53.8127 53.8144 53.8161 53.8176 53.8191 53.8206 53.822 53.8233 53.8245 53.8257 53.8268 53.8278 53.8288 53.8298 53.8307 53.8316 53.8324 53.8331 53.8339 53.8346 53.8352 53.8358 53.8364 53.837 53.8375 53.838 53.8385 53.839 53.8394 53.8399 53.8403 53.8407 53.8411 53.8416 53.842 53.8424 53.8428 53.8433 53.8437 53.8442 53.8447 53.8452 53.8456 53.8462 53.8467 53.8472 53.8478 53.8483 53.8489 53.8494 53.85 53.8506 53.8512 53.8517 53.8523 53.8529 53.8534 53.8539 53.8544 53.8549 53.8554 53.8558 53.8562 53.8566 53.8569 53.8572 53.8575 53.8577 53.8578 53.858 53.858 53.858 53.858 53.8579 53.8578 53.8576 53.8573 53.8571 53.8567 53.8564 53.856 53.8555 53.855 53.8545 53.854 53.8534 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.844 53.8434 53.8429 53.8423 53.8418 53.8414 53.8409 53.8405 53.8401 53.8397 53.8394 53.839 53.8387 53.8384 53.8381 53.8379 53.8377 53.8374 53.8372 53.8371 53.8369 53.8367 53.8366 53.8365 53.8364 53.8363 53.8362 53.8361 53.836 53.8359 53.8359 53.8358 53.8358 53.8357 53.8357 53.8356 53.8356 53.8356 53.8356 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8356 53.8356 53.8356 53.8357 53.8357 53.8357 53.8358 53.8358 53.8359 53.8359 53.836 53.8361 53.8362 53.8363 53.8364 53.8365 53.8366 53.8367 53.8368 53.837 53.8371 53.8373 53.8375 53.8377 53.8379 53.8381 53.8383 53.8385 53.8388 53.8391 53.8393 53.8396 53.84 53.8403 53.8406 53.8409 53.8413 53.8417 53.842 53.8424 53.8428 53.8432 53.8436 53.844 53.8444 53.8448 53.8452 53.8456 53.846 53.8464 53.8467 53.8471 53.8474 53.8478 53.8481 53.8484 53.8486 53.8489 53.8491 53.8493 53.8495 53.8497 53.8498 53.8499 53.85 53.8501 53.8501 53.8501 53.8501 53.85 53.85 53.8499 53.8498 53.8496 53.8495 53.8493 53.8492 53.849 53.8488 53.8486 53.8484 53.8482 53.848 53.8478 53.8476 53.8474 53.8472 53.847 53.8468 53.8466 53.8465 53.8464 53.8462 53.8461 53.846 53.846 53.8459 53.8459 53.8459 53.8459 53.846 53.8461 53.8461 53.8463 53.8464 53.8466 53.8467 53.8469 53.8472 53.8474 53.8477 53.8479 53.8482 53.8486 53.8489 53.8492 53.8496 53.85 53.8503 53.8507 53.8511 53.8515 53.8519 53.8523 53.8527 53.8531 53.8534 53.8538 53.8542 53.8545 53.8549 53.8552 53.8555 53.8558 53.856 53.8563 53.8565 53.8567 53.8569 53.857 53.8571 53.8572 53.8573 53.8573 53.8574 53.8573 53.8573 53.8573 53.8572 53.8571 53.8569 53.8568 53.8566 53.8565 53.8563 53.8561 53.8559 53.8556 53.8554 53.8552 53.8549 53.8547 53.8545 53.8542 53.854 53.8537 53.8535 53.8533 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8518 53.8516 53.8515 53.8514 53.8513 53.8512 53.8511 53.851 53.8509 53.8508 53.8507 53.8507 53.8506 53.8506 53.8506 53.8505 53.8505 53.8505 53.8505 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8506 53.8506 53.8506 53.8506 53.8506 53.8506 53.8507 53.8507 53.8507 53.8507 53.8507 53.8508 53.8508 53.8508 53.8509 53.8509 53.8509 53.851 53.851 53.8511 53.8511 53.8512 53.8512 53.8513 53.8514 53.8514 53.8515 53.8516 53.8517 53.8518 53.8519 53.852 53.8522 53.8523 53.8524 53.8526 53.8528 53.8529 53.8531 53.8533 53.8536 53.8538 53.854 53.8543 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8563 53.8567 53.857 53.8573 53.8577 53.858 53.8584 53.8588 53.8591 53.8595 53.8598 53.8601 53.8605 53.8608 53.8611 53.8613 53.8616 53.8619 53.8621 53.8623 53.8624 53.8626 53.8627 53.8628 53.8628 53.8629 53.8628 53.8628 53.8627 53.8626 53.8624 53.8623 53.862 53.8619 53.8615 53.8614 53.8609 53.8607 53.8602 53.86 53.8594 53.8593 53.8587 53.0352 53.0454 53.0556 53.0657 53.0758 53.0859 53.0959 53.1059 53.1159 53.1259 53.1358 53.1458 53.1557 53.1655 53.1753 53.185 53.1947 53.2042 53.2137 53.2231 53.2324 53.2416 53.2507 53.2598 53.2687 53.2776 53.2864 53.2951 53.3037 53.3122 53.3206 53.329 53.3372 53.3454 53.3535 53.3615 53.3694 53.3773 53.3851 53.3928 53.4005 53.4078 53.4148 53.4218 53.4294 53.4378 53.4465 53.4555 53.4646 53.4735 53.4819 53.4894 53.496 53.5022 53.5081 53.5139 53.5198 53.5258 53.5319 53.5381 53.5443 53.5505 53.5567 53.5629 53.569 53.575 53.5811 53.587 53.5929 53.5987 53.6044 53.6101 53.6157 53.6212 53.6267 53.6321 53.6374 53.6426 53.6478 53.6529 53.658 53.6629 53.6678 53.6727 53.6774 53.6821 53.6867 53.6913 53.6958 53.7002 53.7045 53.7087 53.7129 53.717 53.7211 53.725 53.7289 53.7328 53.7365 53.7402 53.7438 53.7473 53.7508 53.7542 53.7575 53.7608 53.7639 53.767 53.7701 53.773 53.7759 53.7788 53.7815 53.7842 53.7868 53.7894 53.7918 53.7942 53.7966 53.7988 53.801 53.8032 53.8052 53.8072 53.8091 53.811 53.8127 53.8144 53.8161 53.8176 53.8191 53.8206 53.822 53.8233 53.8245 53.8257 53.8268 53.8278 53.8288 53.8298 53.8307 53.8316 53.8324 53.8331 53.8339 53.8346 53.8352 53.8358 53.8364 53.837 53.8375 53.838 53.8385 53.839 53.8394 53.8399 53.8403 53.8407 53.8411 53.8416 53.842 53.8424 53.8428 53.8433 53.8437 53.8442 53.8447 53.8452 53.8456 53.8462 53.8467 53.8472 53.8478 53.8483 53.8489 53.8494 53.85 53.8506 53.8512 53.8517 53.8523 53.8529 53.8534 53.8539 53.8544 53.8549 53.8554 53.8558 53.8562 53.8566 53.8569 53.8572 53.8575 53.8577 53.8578 53.858 53.858 53.858 53.858 53.8579 53.8578 53.8576 53.8573 53.8571 53.8567 53.8564 53.856 53.8555 53.855 53.8545 53.854 53.8534 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.844 53.8434 53.8429 53.8423 53.8418 53.8414 53.8409 53.8405 53.8401 53.8397 53.8394 53.839 53.8387 53.8384 53.8381 53.8379 53.8377 53.8374 53.8372 53.8371 53.8369 53.8367 53.8366 53.8365 53.8364 53.8363 53.8362 53.8361 53.836 53.8359 53.8359 53.8358 53.8358 53.8357 53.8357 53.8356 53.8356 53.8356 53.8356 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8356 53.8356 53.8356 53.8357 53.8357 53.8357 53.8358 53.8358 53.8359 53.8359 53.836 53.8361 53.8362 53.8363 53.8364 53.8365 53.8366 53.8367 53.8368 53.837 53.8371 53.8373 53.8375 53.8377 53.8379 53.8381 53.8383 53.8385 53.8388 53.8391 53.8393 53.8396 53.84 53.8403 53.8406 53.8409 53.8413 53.8417 53.842 53.8424 53.8428 53.8432 53.8436 53.844 53.8444 53.8448 53.8452 53.8456 53.846 53.8464 53.8467 53.8471 53.8474 53.8478 53.8481 53.8484 53.8486 53.8489 53.8491 53.8493 53.8495 53.8497 53.8498 53.8499 53.85 53.8501 53.8501 53.8501 53.8501 53.85 53.85 53.8499 53.8498 53.8496 53.8495 53.8493 53.8492 53.849 53.8488 53.8486 53.8484 53.8482 53.848 53.8478 53.8476 53.8474 53.8472 53.847 53.8468 53.8466 53.8465 53.8464 53.8462 53.8461 53.846 53.846 53.8459 53.8459 53.8459 53.8459 53.846 53.8461 53.8461 53.8463 53.8464 53.8466 53.8467 53.8469 53.8472 53.8474 53.8477 53.8479 53.8482 53.8486 53.8489 53.8492 53.8496 53.85 53.8503 53.8507 53.8511 53.8515 53.8519 53.8523 53.8527 53.8531 53.8534 53.8538 53.8542 53.8545 53.8549 53.8552 53.8555 53.8558 53.856 53.8563 53.8565 53.8567 53.8569 53.857 53.8571 53.8572 53.8573 53.8573 53.8574 53.8573 53.8573 53.8573 53.8572 53.8571 53.8569 53.8568 53.8566 53.8565 53.8563 53.8561 53.8559 53.8556 53.8554 53.8552 53.8549 53.8547 53.8545 53.8542 53.854 53.8537 53.8535 53.8533 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8518 53.8516 53.8515 53.8514 53.8513 53.8512 53.8511 53.851 53.8509 53.8508 53.8507 53.8507 53.8506 53.8506 53.8506 53.8505 53.8505 53.8505 53.8505 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8506 53.8506 53.8506 53.8506 53.8506 53.8506 53.8507 53.8507 53.8507 53.8507 53.8507 53.8508 53.8508 53.8508 53.8509 53.8509 53.8509 53.851 53.851 53.8511 53.8511 53.8512 53.8512 53.8513 53.8514 53.8514 53.8515 53.8516 53.8517 53.8518 53.8519 53.852 53.8522 53.8523 53.8524 53.8526 53.8528 53.8529 53.8531 53.8533 53.8536 53.8538 53.854 53.8543 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8563 53.8567 53.857 53.8573 53.8577 53.858 53.8584 53.8588 53.8591 53.8595 53.8598 53.8601 53.8605 53.8608 53.8611 53.8613 53.8616 53.8619 53.8621 53.8623 53.8624 53.8626 53.8627 53.8628 53.8628 53.8629 53.8628 53.8628 53.8627 53.8626 53.8624 53.8623 53.862 53.8619 53.8615 53.8614 53.8609 53.8607 53.8602 53.86 53.8594 53.8593 53.8587 53.0358 53.0462 53.0564 53.0665 53.0765 53.0866 53.0966 53.1066 53.1165 53.1265 53.1364 53.1464 53.1563 53.1661 53.1759 53.1856 53.1953 53.2049 53.2143 53.2237 53.233 53.2422 53.2514 53.2604 53.2693 53.2782 53.2871 53.2957 53.3043 53.3128 53.3213 53.3296 53.3378 53.3459 53.354 53.3621 53.37 53.3778 53.3855 53.3931 53.4004 53.4075 53.4144 53.4219 53.4303 53.4393 53.4486 53.458 53.4673 53.4764 53.4848 53.4919 53.4977 53.5032 53.5086 53.5141 53.5198 53.5257 53.5318 53.5379 53.5441 53.5503 53.5565 53.5627 53.5689 53.575 53.581 53.5869 53.5928 53.5986 53.6044 53.6101 53.6157 53.6212 53.6267 53.6321 53.6374 53.6426 53.6478 53.6529 53.658 53.6629 53.6678 53.6727 53.6774 53.6821 53.6867 53.6913 53.6958 53.7002 53.7045 53.7087 53.7129 53.717 53.7211 53.725 53.7289 53.7328 53.7365 53.7402 53.7438 53.7473 53.7508 53.7542 53.7575 53.7608 53.7639 53.767 53.7701 53.773 53.7759 53.7788 53.7815 53.7842 53.7868 53.7894 53.7918 53.7942 53.7966 53.7988 53.801 53.8032 53.8052 53.8072 53.8091 53.811 53.8127 53.8144 53.8161 53.8176 53.8191 53.8206 53.822 53.8233 53.8245 53.8257 53.8268 53.8278 53.8288 53.8298 53.8307 53.8316 53.8324 53.8331 53.8339 53.8346 53.8352 53.8358 53.8364 53.837 53.8375 53.838 53.8385 53.839 53.8394 53.8399 53.8403 53.8407 53.8411 53.8416 53.842 53.8424 53.8428 53.8433 53.8437 53.8442 53.8447 53.8452 53.8456 53.8462 53.8467 53.8472 53.8478 53.8483 53.8489 53.8494 53.85 53.8506 53.8512 53.8517 53.8523 53.8529 53.8534 53.8539 53.8544 53.8549 53.8554 53.8558 53.8562 53.8566 53.8569 53.8572 53.8575 53.8577 53.8578 53.858 53.858 53.858 53.858 53.8579 53.8578 53.8576 53.8573 53.8571 53.8567 53.8564 53.856 53.8555 53.855 53.8545 53.854 53.8534 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.844 53.8434 53.8429 53.8423 53.8418 53.8414 53.8409 53.8405 53.8401 53.8397 53.8394 53.839 53.8387 53.8384 53.8381 53.8379 53.8377 53.8374 53.8372 53.8371 53.8369 53.8367 53.8366 53.8365 53.8364 53.8363 53.8362 53.8361 53.836 53.8359 53.8359 53.8358 53.8358 53.8357 53.8357 53.8356 53.8356 53.8356 53.8356 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8356 53.8356 53.8356 53.8357 53.8357 53.8357 53.8358 53.8358 53.8359 53.8359 53.836 53.8361 53.8362 53.8363 53.8364 53.8365 53.8366 53.8367 53.8368 53.837 53.8371 53.8373 53.8375 53.8377 53.8379 53.8381 53.8383 53.8385 53.8388 53.8391 53.8393 53.8396 53.84 53.8403 53.8406 53.8409 53.8413 53.8417 53.842 53.8424 53.8428 53.8432 53.8436 53.844 53.8444 53.8448 53.8452 53.8456 53.846 53.8464 53.8467 53.8471 53.8474 53.8478 53.8481 53.8484 53.8486 53.8489 53.8491 53.8493 53.8495 53.8497 53.8498 53.8499 53.85 53.8501 53.8501 53.8501 53.8501 53.85 53.85 53.8499 53.8498 53.8496 53.8495 53.8493 53.8492 53.849 53.8488 53.8486 53.8484 53.8482 53.848 53.8478 53.8476 53.8474 53.8472 53.847 53.8468 53.8466 53.8465 53.8464 53.8462 53.8461 53.846 53.846 53.8459 53.8459 53.8459 53.8459 53.846 53.8461 53.8461 53.8463 53.8464 53.8466 53.8467 53.8469 53.8472 53.8474 53.8477 53.8479 53.8482 53.8486 53.8489 53.8492 53.8496 53.85 53.8503 53.8507 53.8511 53.8515 53.8519 53.8523 53.8527 53.8531 53.8534 53.8538 53.8542 53.8545 53.8549 53.8552 53.8555 53.8558 53.856 53.8563 53.8565 53.8567 53.8569 53.857 53.8571 53.8572 53.8573 53.8573 53.8574 53.8573 53.8573 53.8573 53.8572 53.8571 53.8569 53.8568 53.8566 53.8565 53.8563 53.8561 53.8559 53.8556 53.8554 53.8552 53.8549 53.8547 53.8545 53.8542 53.854 53.8537 53.8535 53.8533 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8518 53.8516 53.8515 53.8514 53.8513 53.8512 53.8511 53.851 53.8509 53.8508 53.8507 53.8507 53.8506 53.8506 53.8506 53.8505 53.8505 53.8505 53.8505 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8506 53.8506 53.8506 53.8506 53.8506 53.8506 53.8507 53.8507 53.8507 53.8507 53.8507 53.8508 53.8508 53.8508 53.8509 53.8509 53.8509 53.851 53.851 53.8511 53.8511 53.8512 53.8512 53.8513 53.8514 53.8514 53.8515 53.8516 53.8517 53.8518 53.8519 53.852 53.8522 53.8523 53.8524 53.8526 53.8528 53.8529 53.8531 53.8533 53.8536 53.8538 53.854 53.8543 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8563 53.8567 53.857 53.8573 53.8577 53.858 53.8584 53.8588 53.8591 53.8595 53.8598 53.8601 53.8605 53.8608 53.8611 53.8613 53.8616 53.8619 53.8621 53.8623 53.8624 53.8626 53.8627 53.8628 53.8628 53.8629 53.8628 53.8628 53.8627 53.8626 53.8624 53.8623 53.862 53.8619 53.8615 53.8614 53.8609 53.8607 53.8602 53.86 53.8594 53.8593 53.8587 53.0347 53.045 53.055 53.0648 53.0745 53.0843 53.0941 53.1038 53.1136 53.1235 53.1334 53.1433 53.1532 53.163 53.1728 53.1825 53.1922 53.2017 53.2112 53.2205 53.2298 53.239 53.2482 53.2573 53.2662 53.2751 53.2838 53.2925 53.3011 53.3096 53.318 53.3264 53.3347 53.3428 53.3509 53.359 53.367 53.375 53.3825 53.3898 53.3971 53.405 53.4143 53.424 53.4349 53.4459 53.4561 53.4658 53.4749 53.4831 53.4891 53.4939 53.4986 53.5034 53.5085 53.5139 53.5196 53.5254 53.5315 53.5376 53.5438 53.5501 53.5563 53.5626 53.5687 53.5749 53.5809 53.5869 53.5928 53.5986 53.6044 53.61 53.6157 53.6212 53.6267 53.6321 53.6374 53.6426 53.6478 53.6529 53.658 53.6629 53.6678 53.6727 53.6774 53.6821 53.6867 53.6913 53.6958 53.7002 53.7045 53.7087 53.7129 53.717 53.7211 53.725 53.7289 53.7328 53.7365 53.7402 53.7438 53.7473 53.7508 53.7542 53.7575 53.7608 53.7639 53.767 53.7701 53.773 53.7759 53.7788 53.7815 53.7842 53.7868 53.7894 53.7918 53.7942 53.7966 53.7988 53.801 53.8032 53.8052 53.8072 53.8091 53.811 53.8127 53.8144 53.8161 53.8176 53.8191 53.8206 53.822 53.8233 53.8245 53.8257 53.8268 53.8278 53.8288 53.8298 53.8307 53.8316 53.8324 53.8331 53.8339 53.8346 53.8352 53.8358 53.8364 53.837 53.8375 53.838 53.8385 53.839 53.8394 53.8399 53.8403 53.8407 53.8411 53.8416 53.842 53.8424 53.8428 53.8433 53.8437 53.8442 53.8447 53.8452 53.8456 53.8462 53.8467 53.8472 53.8478 53.8483 53.8489 53.8494 53.85 53.8506 53.8512 53.8517 53.8523 53.8529 53.8534 53.8539 53.8544 53.8549 53.8554 53.8558 53.8562 53.8566 53.8569 53.8572 53.8575 53.8577 53.8578 53.858 53.858 53.858 53.858 53.8579 53.8578 53.8576 53.8573 53.8571 53.8567 53.8564 53.856 53.8555 53.855 53.8545 53.854 53.8534 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.844 53.8434 53.8429 53.8423 53.8418 53.8414 53.8409 53.8405 53.8401 53.8397 53.8394 53.839 53.8387 53.8384 53.8381 53.8379 53.8377 53.8374 53.8372 53.8371 53.8369 53.8367 53.8366 53.8365 53.8364 53.8363 53.8362 53.8361 53.836 53.8359 53.8359 53.8358 53.8358 53.8357 53.8357 53.8356 53.8356 53.8356 53.8356 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8356 53.8356 53.8356 53.8357 53.8357 53.8357 53.8358 53.8358 53.8359 53.8359 53.836 53.8361 53.8362 53.8363 53.8364 53.8365 53.8366 53.8367 53.8368 53.837 53.8371 53.8373 53.8375 53.8377 53.8379 53.8381 53.8383 53.8385 53.8388 53.8391 53.8393 53.8396 53.84 53.8403 53.8406 53.8409 53.8413 53.8417 53.842 53.8424 53.8428 53.8432 53.8436 53.844 53.8444 53.8448 53.8452 53.8456 53.846 53.8464 53.8467 53.8471 53.8474 53.8478 53.8481 53.8484 53.8486 53.8489 53.8491 53.8493 53.8495 53.8497 53.8498 53.8499 53.85 53.8501 53.8501 53.8501 53.8501 53.85 53.85 53.8499 53.8498 53.8496 53.8495 53.8493 53.8492 53.849 53.8488 53.8486 53.8484 53.8482 53.848 53.8478 53.8476 53.8474 53.8472 53.847 53.8468 53.8466 53.8465 53.8464 53.8462 53.8461 53.846 53.846 53.8459 53.8459 53.8459 53.8459 53.846 53.8461 53.8461 53.8463 53.8464 53.8466 53.8467 53.8469 53.8472 53.8474 53.8477 53.8479 53.8482 53.8486 53.8489 53.8492 53.8496 53.85 53.8503 53.8507 53.8511 53.8515 53.8519 53.8523 53.8527 53.8531 53.8534 53.8538 53.8542 53.8545 53.8549 53.8552 53.8555 53.8558 53.856 53.8563 53.8565 53.8567 53.8569 53.857 53.8571 53.8572 53.8573 53.8573 53.8574 53.8573 53.8573 53.8573 53.8572 53.8571 53.8569 53.8568 53.8566 53.8565 53.8563 53.8561 53.8559 53.8556 53.8554 53.8552 53.8549 53.8547 53.8545 53.8542 53.854 53.8537 53.8535 53.8533 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8518 53.8516 53.8515 53.8514 53.8513 53.8512 53.8511 53.851 53.8509 53.8508 53.8507 53.8507 53.8506 53.8506 53.8506 53.8505 53.8505 53.8505 53.8505 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8506 53.8506 53.8506 53.8506 53.8506 53.8506 53.8507 53.8507 53.8507 53.8507 53.8507 53.8508 53.8508 53.8508 53.8509 53.8509 53.8509 53.851 53.851 53.8511 53.8511 53.8512 53.8512 53.8513 53.8514 53.8514 53.8515 53.8516 53.8517 53.8518 53.8519 53.852 53.8522 53.8523 53.8524 53.8526 53.8528 53.8529 53.8531 53.8533 53.8536 53.8538 53.854 53.8543 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8563 53.8567 53.857 53.8573 53.8577 53.858 53.8584 53.8588 53.8591 53.8595 53.8598 53.8601 53.8605 53.8608 53.8611 53.8613 53.8616 53.8619 53.8621 53.8623 53.8624 53.8626 53.8627 53.8628 53.8628 53.8629 53.8628 53.8628 53.8627 53.8626 53.8624 53.8623 53.862 53.8619 53.8615 53.8614 53.8609 53.8607 53.8602 53.86 53.8594 53.8593 53.8587 53.0366 53.0474 53.0577 53.0678 53.0777 53.0877 53.0976 53.1074 53.1172 53.127 53.1369 53.1467 53.1565 53.1663 53.1761 53.1858 53.1954 53.205 53.2145 53.2239 53.2331 53.2424 53.2515 53.2605 53.2694 53.2783 53.2871 53.2958 53.3044 53.3129 53.3214 53.3296 53.3379 53.3461 53.3542 53.3622 53.3701 53.378 53.3858 53.3932 53.4001 53.4069 53.4143 53.4234 53.4329 53.444 53.4559 53.4666 53.4765 53.4857 53.4934 53.4977 53.5009 53.5047 53.5092 53.5143 53.5197 53.5255 53.5315 53.5376 53.5438 53.5501 53.5563 53.5625 53.5687 53.5748 53.5809 53.5869 53.5928 53.5986 53.6044 53.61 53.6157 53.6212 53.6267 53.632 53.6374 53.6426 53.6478 53.6529 53.658 53.6629 53.6678 53.6727 53.6774 53.6821 53.6867 53.6913 53.6958 53.7002 53.7045 53.7087 53.7129 53.717 53.7211 53.725 53.7289 53.7328 53.7365 53.7402 53.7438 53.7473 53.7508 53.7542 53.7575 53.7608 53.7639 53.767 53.7701 53.773 53.7759 53.7788 53.7815 53.7842 53.7868 53.7894 53.7918 53.7942 53.7966 53.7988 53.801 53.8032 53.8052 53.8072 53.8091 53.811 53.8127 53.8144 53.8161 53.8176 53.8191 53.8206 53.822 53.8233 53.8245 53.8257 53.8268 53.8278 53.8288 53.8298 53.8307 53.8316 53.8324 53.8331 53.8339 53.8346 53.8352 53.8358 53.8364 53.837 53.8375 53.838 53.8385 53.839 53.8394 53.8399 53.8403 53.8407 53.8411 53.8416 53.842 53.8424 53.8428 53.8433 53.8437 53.8442 53.8447 53.8452 53.8456 53.8462 53.8467 53.8472 53.8478 53.8483 53.8489 53.8494 53.85 53.8506 53.8512 53.8517 53.8523 53.8529 53.8534 53.8539 53.8544 53.8549 53.8554 53.8558 53.8562 53.8566 53.8569 53.8572 53.8575 53.8577 53.8578 53.858 53.858 53.858 53.858 53.8579 53.8578 53.8576 53.8573 53.8571 53.8567 53.8564 53.856 53.8555 53.855 53.8545 53.854 53.8534 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.844 53.8434 53.8429 53.8423 53.8418 53.8414 53.8409 53.8405 53.8401 53.8397 53.8394 53.839 53.8387 53.8384 53.8381 53.8379 53.8377 53.8374 53.8372 53.8371 53.8369 53.8367 53.8366 53.8365 53.8364 53.8363 53.8362 53.8361 53.836 53.8359 53.8359 53.8358 53.8358 53.8357 53.8357 53.8356 53.8356 53.8356 53.8356 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8356 53.8356 53.8356 53.8357 53.8357 53.8357 53.8358 53.8358 53.8359 53.8359 53.836 53.8361 53.8362 53.8363 53.8364 53.8365 53.8366 53.8367 53.8368 53.837 53.8371 53.8373 53.8375 53.8377 53.8379 53.8381 53.8383 53.8385 53.8388 53.8391 53.8393 53.8396 53.84 53.8403 53.8406 53.8409 53.8413 53.8417 53.842 53.8424 53.8428 53.8432 53.8436 53.844 53.8444 53.8448 53.8452 53.8456 53.846 53.8464 53.8467 53.8471 53.8474 53.8478 53.8481 53.8484 53.8486 53.8489 53.8491 53.8493 53.8495 53.8497 53.8498 53.8499 53.85 53.8501 53.8501 53.8501 53.8501 53.85 53.85 53.8499 53.8498 53.8496 53.8495 53.8493 53.8492 53.849 53.8488 53.8486 53.8484 53.8482 53.848 53.8478 53.8476 53.8474 53.8472 53.847 53.8468 53.8466 53.8465 53.8464 53.8462 53.8461 53.846 53.846 53.8459 53.8459 53.8459 53.8459 53.846 53.8461 53.8461 53.8463 53.8464 53.8466 53.8467 53.8469 53.8472 53.8474 53.8477 53.8479 53.8482 53.8486 53.8489 53.8492 53.8496 53.85 53.8503 53.8507 53.8511 53.8515 53.8519 53.8523 53.8527 53.8531 53.8534 53.8538 53.8542 53.8545 53.8549 53.8552 53.8555 53.8558 53.856 53.8563 53.8565 53.8567 53.8569 53.857 53.8571 53.8572 53.8573 53.8573 53.8574 53.8573 53.8573 53.8573 53.8572 53.8571 53.8569 53.8568 53.8566 53.8565 53.8563 53.8561 53.8559 53.8556 53.8554 53.8552 53.8549 53.8547 53.8545 53.8542 53.854 53.8537 53.8535 53.8533 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8518 53.8516 53.8515 53.8514 53.8513 53.8512 53.8511 53.851 53.8509 53.8508 53.8507 53.8507 53.8506 53.8506 53.8506 53.8505 53.8505 53.8505 53.8505 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8506 53.8506 53.8506 53.8506 53.8506 53.8506 53.8507 53.8507 53.8507 53.8507 53.8507 53.8508 53.8508 53.8508 53.8509 53.8509 53.8509 53.851 53.851 53.8511 53.8511 53.8512 53.8512 53.8513 53.8514 53.8514 53.8515 53.8516 53.8517 53.8518 53.8519 53.852 53.8522 53.8523 53.8524 53.8526 53.8528 53.8529 53.8531 53.8533 53.8536 53.8538 53.854 53.8543 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8563 53.8567 53.857 53.8573 53.8577 53.858 53.8584 53.8588 53.8591 53.8595 53.8598 53.8601 53.8605 53.8608 53.8611 53.8613 53.8616 53.8619 53.8621 53.8623 53.8624 53.8626 53.8627 53.8628 53.8628 53.8629 53.8628 53.8628 53.8627 53.8626 53.8624 53.8623 53.862 53.8619 53.8615 53.8614 53.8609 53.8607 53.8602 53.86 53.8594 53.8593 53.8587 53.0366 53.0475 53.0579 53.0679 53.0779 53.0878 53.0976 53.1074 53.1172 53.127 53.1368 53.1466 53.1564 53.1662 53.1759 53.1856 53.1953 53.2048 53.2143 53.2237 53.233 53.2422 53.2513 53.2604 53.2693 53.2781 53.287 53.2957 53.3043 53.3128 53.3212 53.3296 53.3378 53.3459 53.354 53.362 53.37 53.378 53.3859 53.3934 53.4003 53.4068 53.4138 53.4223 53.4317 53.4422 53.4543 53.4654 53.4755 53.4849 53.4931 53.4984 53.5016 53.5053 53.5097 53.5146 53.5199 53.5256 53.5316 53.5376 53.5438 53.5501 53.5563 53.5625 53.5687 53.5748 53.5809 53.5869 53.5928 53.5986 53.6044 53.61 53.6156 53.6212 53.6267 53.632 53.6374 53.6426 53.6478 53.6529 53.658 53.6629 53.6678 53.6727 53.6774 53.6821 53.6867 53.6913 53.6958 53.7002 53.7045 53.7087 53.7129 53.717 53.7211 53.725 53.7289 53.7328 53.7365 53.7402 53.7438 53.7473 53.7508 53.7542 53.7575 53.7608 53.7639 53.767 53.7701 53.773 53.7759 53.7788 53.7815 53.7842 53.7868 53.7894 53.7918 53.7942 53.7966 53.7988 53.801 53.8032 53.8052 53.8072 53.8091 53.811 53.8127 53.8144 53.8161 53.8176 53.8191 53.8206 53.822 53.8233 53.8245 53.8257 53.8268 53.8278 53.8288 53.8298 53.8307 53.8316 53.8324 53.8331 53.8339 53.8346 53.8352 53.8358 53.8364 53.837 53.8375 53.838 53.8385 53.839 53.8394 53.8399 53.8403 53.8407 53.8411 53.8416 53.842 53.8424 53.8428 53.8433 53.8437 53.8442 53.8447 53.8452 53.8456 53.8462 53.8467 53.8472 53.8478 53.8483 53.8489 53.8494 53.85 53.8506 53.8512 53.8517 53.8523 53.8529 53.8534 53.8539 53.8544 53.8549 53.8554 53.8558 53.8562 53.8566 53.8569 53.8572 53.8575 53.8577 53.8578 53.858 53.858 53.858 53.858 53.8579 53.8578 53.8576 53.8573 53.8571 53.8567 53.8564 53.856 53.8555 53.855 53.8545 53.854 53.8534 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.844 53.8434 53.8429 53.8423 53.8418 53.8414 53.8409 53.8405 53.8401 53.8397 53.8394 53.839 53.8387 53.8384 53.8381 53.8379 53.8377 53.8374 53.8372 53.8371 53.8369 53.8367 53.8366 53.8365 53.8364 53.8363 53.8362 53.8361 53.836 53.8359 53.8359 53.8358 53.8358 53.8357 53.8357 53.8356 53.8356 53.8356 53.8356 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8356 53.8356 53.8356 53.8357 53.8357 53.8357 53.8358 53.8358 53.8359 53.8359 53.836 53.8361 53.8362 53.8363 53.8364 53.8365 53.8366 53.8367 53.8368 53.837 53.8371 53.8373 53.8375 53.8377 53.8379 53.8381 53.8383 53.8385 53.8388 53.8391 53.8393 53.8396 53.84 53.8403 53.8406 53.8409 53.8413 53.8417 53.842 53.8424 53.8428 53.8432 53.8436 53.844 53.8444 53.8448 53.8452 53.8456 53.846 53.8464 53.8467 53.8471 53.8474 53.8478 53.8481 53.8484 53.8486 53.8489 53.8491 53.8493 53.8495 53.8497 53.8498 53.8499 53.85 53.8501 53.8501 53.8501 53.8501 53.85 53.85 53.8499 53.8498 53.8496 53.8495 53.8493 53.8492 53.849 53.8488 53.8486 53.8484 53.8482 53.848 53.8478 53.8476 53.8474 53.8472 53.847 53.8468 53.8466 53.8465 53.8464 53.8462 53.8461 53.846 53.846 53.8459 53.8459 53.8459 53.8459 53.846 53.8461 53.8461 53.8463 53.8464 53.8466 53.8467 53.8469 53.8472 53.8474 53.8477 53.8479 53.8482 53.8486 53.8489 53.8492 53.8496 53.85 53.8503 53.8507 53.8511 53.8515 53.8519 53.8523 53.8527 53.8531 53.8534 53.8538 53.8542 53.8545 53.8549 53.8552 53.8555 53.8558 53.856 53.8563 53.8565 53.8567 53.8569 53.857 53.8571 53.8572 53.8573 53.8573 53.8574 53.8573 53.8573 53.8573 53.8572 53.8571 53.8569 53.8568 53.8566 53.8565 53.8563 53.8561 53.8559 53.8556 53.8554 53.8552 53.8549 53.8547 53.8545 53.8542 53.854 53.8537 53.8535 53.8533 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8518 53.8516 53.8515 53.8514 53.8513 53.8512 53.8511 53.851 53.8509 53.8508 53.8507 53.8507 53.8506 53.8506 53.8506 53.8505 53.8505 53.8505 53.8505 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8506 53.8506 53.8506 53.8506 53.8506 53.8506 53.8507 53.8507 53.8507 53.8507 53.8507 53.8508 53.8508 53.8508 53.8509 53.8509 53.8509 53.851 53.851 53.8511 53.8511 53.8512 53.8512 53.8513 53.8514 53.8514 53.8515 53.8516 53.8517 53.8518 53.8519 53.852 53.8522 53.8523 53.8524 53.8526 53.8528 53.8529 53.8531 53.8533 53.8536 53.8538 53.854 53.8543 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8563 53.8567 53.857 53.8573 53.8577 53.858 53.8584 53.8588 53.8591 53.8595 53.8598 53.8601 53.8605 53.8608 53.8611 53.8613 53.8616 53.8619 53.8621 53.8623 53.8624 53.8626 53.8627 53.8628 53.8628 53.8629 53.8628 53.8628 53.8627 53.8626 53.8624 53.8623 53.862 53.8619 53.8615 53.8614 53.8609 53.8607 53.8602 53.86 53.8594 53.8593 53.8587 53.0372 53.0481 53.0586 53.0688 53.0788 53.0888 53.0988 53.1087 53.1186 53.1285 53.1383 53.1481 53.158 53.1678 53.1775 53.1872 53.1968 53.2064 53.2159 53.2253 53.2346 53.2438 53.2529 53.262 53.2708 53.2797 53.2885 53.2972 53.3059 53.3145 53.3227 53.3309 53.3394 53.3477 53.3557 53.3633 53.371 53.3791 53.3874 53.3954 53.4023 53.4081 53.4135 53.4195 53.4276 53.4369 53.4474 53.4593 53.4703 53.4803 53.4895 53.4971 53.5015 53.5053 53.5097 53.5146 53.5199 53.5256 53.5315 53.5376 53.5438 53.55 53.5563 53.5625 53.5687 53.5748 53.5809 53.5868 53.5928 53.5986 53.6044 53.61 53.6156 53.6212 53.6267 53.632 53.6374 53.6426 53.6478 53.6529 53.658 53.6629 53.6678 53.6727 53.6774 53.6821 53.6867 53.6913 53.6958 53.7002 53.7045 53.7087 53.7129 53.717 53.7211 53.725 53.7289 53.7328 53.7365 53.7402 53.7438 53.7473 53.7508 53.7542 53.7575 53.7608 53.7639 53.767 53.7701 53.773 53.7759 53.7788 53.7815 53.7842 53.7868 53.7894 53.7918 53.7942 53.7966 53.7988 53.801 53.8032 53.8052 53.8072 53.8091 53.811 53.8127 53.8144 53.8161 53.8176 53.8191 53.8206 53.822 53.8233 53.8245 53.8257 53.8268 53.8278 53.8288 53.8298 53.8307 53.8316 53.8324 53.8331 53.8339 53.8346 53.8352 53.8358 53.8364 53.837 53.8375 53.838 53.8385 53.839 53.8394 53.8399 53.8403 53.8407 53.8411 53.8416 53.842 53.8424 53.8428 53.8433 53.8437 53.8442 53.8447 53.8452 53.8456 53.8462 53.8467 53.8472 53.8478 53.8483 53.8489 53.8494 53.85 53.8506 53.8512 53.8517 53.8523 53.8529 53.8534 53.8539 53.8544 53.8549 53.8554 53.8558 53.8562 53.8566 53.8569 53.8572 53.8575 53.8577 53.8578 53.858 53.858 53.858 53.858 53.8579 53.8578 53.8576 53.8573 53.8571 53.8567 53.8564 53.856 53.8555 53.855 53.8545 53.854 53.8534 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.844 53.8434 53.8429 53.8423 53.8418 53.8414 53.8409 53.8405 53.8401 53.8397 53.8394 53.839 53.8387 53.8384 53.8381 53.8379 53.8377 53.8374 53.8372 53.8371 53.8369 53.8367 53.8366 53.8365 53.8364 53.8363 53.8362 53.8361 53.836 53.8359 53.8359 53.8358 53.8358 53.8357 53.8357 53.8356 53.8356 53.8356 53.8356 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8356 53.8356 53.8356 53.8357 53.8357 53.8357 53.8358 53.8358 53.8359 53.8359 53.836 53.8361 53.8362 53.8363 53.8364 53.8365 53.8366 53.8367 53.8368 53.837 53.8371 53.8373 53.8375 53.8377 53.8379 53.8381 53.8383 53.8385 53.8388 53.8391 53.8393 53.8396 53.84 53.8403 53.8406 53.8409 53.8413 53.8417 53.842 53.8424 53.8428 53.8432 53.8436 53.844 53.8444 53.8448 53.8452 53.8456 53.846 53.8464 53.8467 53.8471 53.8474 53.8478 53.8481 53.8484 53.8486 53.8489 53.8491 53.8493 53.8495 53.8497 53.8498 53.8499 53.85 53.8501 53.8501 53.8501 53.8501 53.85 53.85 53.8499 53.8498 53.8496 53.8495 53.8493 53.8492 53.849 53.8488 53.8486 53.8484 53.8482 53.848 53.8478 53.8476 53.8474 53.8472 53.847 53.8468 53.8466 53.8465 53.8464 53.8462 53.8461 53.846 53.846 53.8459 53.8459 53.8459 53.8459 53.846 53.8461 53.8461 53.8463 53.8464 53.8466 53.8467 53.8469 53.8472 53.8474 53.8477 53.8479 53.8482 53.8486 53.8489 53.8492 53.8496 53.85 53.8503 53.8507 53.8511 53.8515 53.8519 53.8523 53.8527 53.8531 53.8534 53.8538 53.8542 53.8545 53.8549 53.8552 53.8555 53.8558 53.856 53.8563 53.8565 53.8567 53.8569 53.857 53.8571 53.8572 53.8573 53.8573 53.8574 53.8573 53.8573 53.8573 53.8572 53.8571 53.8569 53.8568 53.8566 53.8565 53.8563 53.8561 53.8559 53.8556 53.8554 53.8552 53.8549 53.8547 53.8545 53.8542 53.854 53.8537 53.8535 53.8533 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8518 53.8516 53.8515 53.8514 53.8513 53.8512 53.8511 53.851 53.8509 53.8508 53.8507 53.8507 53.8506 53.8506 53.8506 53.8505 53.8505 53.8505 53.8505 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8506 53.8506 53.8506 53.8506 53.8506 53.8506 53.8507 53.8507 53.8507 53.8507 53.8507 53.8508 53.8508 53.8508 53.8509 53.8509 53.8509 53.851 53.851 53.8511 53.8511 53.8512 53.8512 53.8513 53.8514 53.8514 53.8515 53.8516 53.8517 53.8518 53.8519 53.852 53.8522 53.8523 53.8524 53.8526 53.8528 53.8529 53.8531 53.8533 53.8536 53.8538 53.854 53.8543 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8563 53.8567 53.857 53.8573 53.8577 53.858 53.8584 53.8588 53.8591 53.8595 53.8598 53.8601 53.8605 53.8608 53.8611 53.8613 53.8616 53.8619 53.8621 53.8623 53.8624 53.8626 53.8627 53.8628 53.8628 53.8629 53.8628 53.8628 53.8627 53.8626 53.8624 53.8623 53.862 53.8619 53.8615 53.8614 53.8609 53.8607 53.8602 53.86 53.8594 53.8593 53.8587 53.0369 53.0477 53.058 53.068 53.0778 53.0876 53.0973 53.107 53.1167 53.1264 53.1362 53.1459 53.1557 53.1655 53.1753 53.185 53.1946 53.2042 53.2136 53.223 53.2323 53.2415 53.2507 53.2597 53.2687 53.2776 53.2864 53.2951 53.3037 53.3123 53.3207 53.329 53.3372 53.3456 53.3538 53.3614 53.3686 53.3767 53.3857 53.3942 53.4009 53.405 53.4084 53.4124 53.4179 53.4257 53.4349 53.4458 53.4583 53.4695 53.4797 53.489 53.4971 53.5029 53.5081 53.5136 53.5192 53.5252 53.5312 53.5374 53.5436 53.5499 53.5562 53.5625 53.5686 53.5748 53.5808 53.5868 53.5928 53.5986 53.6043 53.61 53.6156 53.6212 53.6267 53.632 53.6374 53.6426 53.6478 53.6529 53.658 53.6629 53.6678 53.6727 53.6774 53.6821 53.6867 53.6913 53.6958 53.7002 53.7045 53.7087 53.7129 53.717 53.7211 53.725 53.7289 53.7328 53.7365 53.7402 53.7438 53.7473 53.7508 53.7542 53.7575 53.7608 53.7639 53.767 53.7701 53.773 53.7759 53.7788 53.7815 53.7842 53.7868 53.7894 53.7918 53.7942 53.7966 53.7988 53.801 53.8032 53.8052 53.8072 53.8091 53.811 53.8127 53.8144 53.8161 53.8176 53.8191 53.8206 53.822 53.8233 53.8245 53.8257 53.8268 53.8278 53.8288 53.8298 53.8307 53.8316 53.8324 53.8331 53.8339 53.8346 53.8352 53.8358 53.8364 53.837 53.8375 53.838 53.8385 53.839 53.8394 53.8399 53.8403 53.8407 53.8411 53.8416 53.842 53.8424 53.8428 53.8433 53.8437 53.8442 53.8447 53.8452 53.8456 53.8462 53.8467 53.8472 53.8478 53.8483 53.8489 53.8494 53.85 53.8506 53.8512 53.8517 53.8523 53.8529 53.8534 53.8539 53.8544 53.8549 53.8554 53.8558 53.8562 53.8566 53.8569 53.8572 53.8575 53.8577 53.8578 53.858 53.858 53.858 53.858 53.8579 53.8578 53.8576 53.8573 53.8571 53.8567 53.8564 53.856 53.8555 53.855 53.8545 53.854 53.8534 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.844 53.8434 53.8429 53.8423 53.8418 53.8414 53.8409 53.8405 53.8401 53.8397 53.8394 53.839 53.8387 53.8384 53.8381 53.8379 53.8377 53.8374 53.8372 53.8371 53.8369 53.8367 53.8366 53.8365 53.8364 53.8363 53.8362 53.8361 53.836 53.8359 53.8359 53.8358 53.8358 53.8357 53.8357 53.8356 53.8356 53.8356 53.8356 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8356 53.8356 53.8356 53.8357 53.8357 53.8357 53.8358 53.8358 53.8359 53.8359 53.836 53.8361 53.8362 53.8363 53.8364 53.8365 53.8366 53.8367 53.8368 53.837 53.8371 53.8373 53.8375 53.8377 53.8379 53.8381 53.8383 53.8385 53.8388 53.8391 53.8393 53.8396 53.84 53.8403 53.8406 53.8409 53.8413 53.8417 53.842 53.8424 53.8428 53.8432 53.8436 53.844 53.8444 53.8448 53.8452 53.8456 53.846 53.8464 53.8467 53.8471 53.8474 53.8478 53.8481 53.8484 53.8486 53.8489 53.8491 53.8493 53.8495 53.8497 53.8498 53.8499 53.85 53.8501 53.8501 53.8501 53.8501 53.85 53.85 53.8499 53.8498 53.8496 53.8495 53.8493 53.8492 53.849 53.8488 53.8486 53.8484 53.8482 53.848 53.8478 53.8476 53.8474 53.8472 53.847 53.8468 53.8466 53.8465 53.8464 53.8462 53.8461 53.846 53.846 53.8459 53.8459 53.8459 53.8459 53.846 53.8461 53.8461 53.8463 53.8464 53.8466 53.8467 53.8469 53.8472 53.8474 53.8477 53.8479 53.8482 53.8486 53.8489 53.8492 53.8496 53.85 53.8503 53.8507 53.8511 53.8515 53.8519 53.8523 53.8527 53.8531 53.8534 53.8538 53.8542 53.8545 53.8549 53.8552 53.8555 53.8558 53.856 53.8563 53.8565 53.8567 53.8569 53.857 53.8571 53.8572 53.8573 53.8573 53.8574 53.8573 53.8573 53.8573 53.8572 53.8571 53.8569 53.8568 53.8566 53.8565 53.8563 53.8561 53.8559 53.8556 53.8554 53.8552 53.8549 53.8547 53.8545 53.8542 53.854 53.8537 53.8535 53.8533 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8518 53.8516 53.8515 53.8514 53.8513 53.8512 53.8511 53.851 53.8509 53.8508 53.8507 53.8507 53.8506 53.8506 53.8506 53.8505 53.8505 53.8505 53.8505 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8506 53.8506 53.8506 53.8506 53.8506 53.8506 53.8507 53.8507 53.8507 53.8507 53.8507 53.8508 53.8508 53.8508 53.8509 53.8509 53.8509 53.851 53.851 53.8511 53.8511 53.8512 53.8512 53.8513 53.8514 53.8514 53.8515 53.8516 53.8517 53.8518 53.8519 53.852 53.8522 53.8523 53.8524 53.8526 53.8528 53.8529 53.8531 53.8533 53.8536 53.8538 53.854 53.8543 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8563 53.8567 53.857 53.8573 53.8577 53.858 53.8584 53.8588 53.8591 53.8595 53.8598 53.8601 53.8605 53.8608 53.8611 53.8613 53.8616 53.8619 53.8621 53.8623 53.8624 53.8626 53.8627 53.8628 53.8628 53.8629 53.8628 53.8628 53.8627 53.8626 53.8624 53.8623 53.862 53.8619 53.8615 53.8614 53.8609 53.8607 53.8602 53.86 53.8594 53.8593 53.8587 53.0376 53.0484 53.0588 53.0689 53.079 53.0891 53.0992 53.1093 53.1193 53.1293 53.1392 53.1491 53.159 53.1689 53.1786 53.1884 53.198 53.2076 53.2171 53.2265 53.2358 53.245 53.2541 53.2632 53.2721 53.281 53.2897 53.2984 53.307 53.3156 53.324 53.3323 53.3405 53.3486 53.3566 53.3647 53.3727 53.3806 53.388 53.395 53.4024 53.4109 53.4198 53.428 53.433 53.4287 53.4227 53.4217 53.4262 53.4347 53.4444 53.4576 53.4732 53.4857 53.496 53.5052 53.5139 53.522 53.5292 53.536 53.5428 53.5494 53.5559 53.5623 53.5686 53.5747 53.5808 53.5868 53.5927 53.5986 53.6043 53.61 53.6156 53.6212 53.6266 53.632 53.6374 53.6426 53.6478 53.6529 53.658 53.6629 53.6678 53.6727 53.6774 53.6821 53.6867 53.6913 53.6957 53.7001 53.7045 53.7087 53.7129 53.717 53.7211 53.725 53.7289 53.7328 53.7365 53.7402 53.7438 53.7473 53.7508 53.7542 53.7575 53.7608 53.7639 53.767 53.7701 53.773 53.7759 53.7788 53.7815 53.7842 53.7868 53.7894 53.7918 53.7942 53.7966 53.7988 53.801 53.8032 53.8052 53.8072 53.8091 53.811 53.8127 53.8144 53.8161 53.8176 53.8191 53.8206 53.822 53.8233 53.8245 53.8257 53.8268 53.8278 53.8288 53.8298 53.8307 53.8316 53.8324 53.8331 53.8339 53.8346 53.8352 53.8358 53.8364 53.837 53.8375 53.838 53.8385 53.839 53.8394 53.8399 53.8403 53.8407 53.8411 53.8416 53.842 53.8424 53.8428 53.8433 53.8437 53.8442 53.8447 53.8451 53.8456 53.8462 53.8467 53.8472 53.8478 53.8483 53.8489 53.8494 53.85 53.8506 53.8512 53.8517 53.8523 53.8529 53.8534 53.8539 53.8544 53.8549 53.8554 53.8558 53.8562 53.8566 53.8569 53.8572 53.8575 53.8577 53.8578 53.8579 53.858 53.858 53.858 53.8579 53.8578 53.8576 53.8573 53.8571 53.8567 53.8564 53.856 53.8555 53.855 53.8545 53.854 53.8534 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8476 53.847 53.8464 53.8457 53.8451 53.8445 53.844 53.8434 53.8429 53.8423 53.8418 53.8414 53.8409 53.8405 53.8401 53.8397 53.8393 53.839 53.8387 53.8384 53.8381 53.8379 53.8377 53.8374 53.8372 53.8371 53.8369 53.8367 53.8366 53.8365 53.8364 53.8363 53.8362 53.8361 53.836 53.8359 53.8359 53.8358 53.8358 53.8357 53.8357 53.8356 53.8356 53.8356 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8354 53.8355 53.8355 53.8355 53.8355 53.8355 53.8355 53.8356 53.8356 53.8356 53.8357 53.8357 53.8357 53.8358 53.8358 53.8359 53.8359 53.836 53.8361 53.8362 53.8363 53.8363 53.8365 53.8366 53.8367 53.8368 53.837 53.8371 53.8373 53.8375 53.8377 53.8379 53.8381 53.8383 53.8385 53.8388 53.8391 53.8393 53.8396 53.8399 53.8403 53.8406 53.8409 53.8413 53.8417 53.842 53.8424 53.8428 53.8432 53.8436 53.844 53.8444 53.8448 53.8452 53.8456 53.846 53.8464 53.8467 53.8471 53.8474 53.8478 53.8481 53.8484 53.8486 53.8489 53.8491 53.8493 53.8495 53.8497 53.8498 53.8499 53.85 53.8501 53.8501 53.8501 53.8501 53.85 53.85 53.8499 53.8498 53.8496 53.8495 53.8493 53.8492 53.849 53.8488 53.8486 53.8484 53.8482 53.848 53.8478 53.8476 53.8474 53.8472 53.847 53.8468 53.8466 53.8465 53.8463 53.8462 53.8461 53.846 53.846 53.8459 53.8459 53.8459 53.8459 53.846 53.8461 53.8461 53.8463 53.8464 53.8466 53.8467 53.8469 53.8472 53.8474 53.8477 53.8479 53.8482 53.8486 53.8489 53.8492 53.8496 53.8499 53.8503 53.8507 53.8511 53.8515 53.8519 53.8523 53.8527 53.853 53.8534 53.8538 53.8542 53.8545 53.8549 53.8552 53.8555 53.8558 53.856 53.8563 53.8565 53.8567 53.8569 53.857 53.8571 53.8572 53.8573 53.8573 53.8573 53.8573 53.8573 53.8572 53.8572 53.8571 53.8569 53.8568 53.8566 53.8565 53.8563 53.8561 53.8559 53.8556 53.8554 53.8552 53.8549 53.8547 53.8545 53.8542 53.854 53.8537 53.8535 53.8533 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8518 53.8516 53.8515 53.8514 53.8513 53.8512 53.8511 53.851 53.8509 53.8508 53.8507 53.8507 53.8506 53.8506 53.8506 53.8505 53.8505 53.8505 53.8505 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8505 53.8506 53.8506 53.8506 53.8506 53.8506 53.8506 53.8507 53.8507 53.8507 53.8507 53.8507 53.8508 53.8508 53.8508 53.8509 53.8509 53.8509 53.851 53.851 53.8511 53.8511 53.8512 53.8512 53.8513 53.8514 53.8514 53.8515 53.8516 53.8517 53.8518 53.8519 53.852 53.8522 53.8523 53.8524 53.8526 53.8528 53.8529 53.8531 53.8533 53.8536 53.8538 53.854 53.8543 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8563 53.8567 53.857 53.8573 53.8577 53.858 53.8584 53.8587 53.8591 53.8594 53.8598 53.8601 53.8605 53.8608 53.8611 53.8613 53.8616 53.8619 53.8621 53.8623 53.8624 53.8626 53.8627 53.8628 53.8628 53.8629 53.8628 53.8628 53.8627 53.8626 53.8624 53.8623 53.862 53.8619 53.8615 53.8614 53.8609 53.8607 53.8602 53.86 53.8594 53.8593 53.8587 53.036 53.046 53.0555 53.0647 53.0739 53.0831 53.0926 53.1022 53.112 53.1219 53.1318 53.1418 53.1517 53.1616 53.1713 53.181 53.1907 53.2002 53.2097 53.2191 53.2285 53.2377 53.2468 53.2559 53.2648 53.2739 53.2829 53.2915 53.2999 53.3084 53.3172 53.3263 53.3355 53.3446 53.3537 53.363 53.372 53.3799 53.3844 53.377 53.3536 53.3317 53.315 53.3045 53.3001 53.3013 53.3073 53.3164 53.3293 53.3545 53.3871 53.4158 53.4398 53.4602 53.4776 53.4923 53.5044 53.5146 53.5239 53.5327 53.5408 53.5482 53.5549 53.5614 53.5678 53.574 53.5801 53.5861 53.592 53.5978 53.6036 53.6093 53.6149 53.6204 53.6259 53.6313 53.6366 53.6418 53.647 53.6521 53.6572 53.6622 53.6671 53.6719 53.6767 53.6813 53.686 53.6905 53.695 53.6994 53.7037 53.708 53.7122 53.7163 53.7203 53.7243 53.7282 53.732 53.7358 53.7394 53.743 53.7466 53.75 53.7534 53.7568 53.76 53.7632 53.7663 53.7693 53.7723 53.7752 53.778 53.7808 53.7834 53.7861 53.7886 53.7911 53.7935 53.7958 53.7981 53.8003 53.8024 53.8045 53.8065 53.8084 53.8102 53.812 53.8137 53.8153 53.8169 53.8184 53.8199 53.8212 53.8226 53.8238 53.8249 53.8261 53.8271 53.8281 53.8291 53.83 53.8308 53.8317 53.8324 53.8332 53.8339 53.8345 53.8351 53.8357 53.8363 53.8368 53.8373 53.8378 53.8383 53.8387 53.8392 53.8396 53.84 53.8404 53.8409 53.8413 53.8417 53.8421 53.8426 53.843 53.8435 53.844 53.8445 53.845 53.8455 53.846 53.8465 53.8471 53.8476 53.8482 53.8488 53.8493 53.8499 53.8505 53.8511 53.8516 53.8522 53.8527 53.8533 53.8538 53.8543 53.8547 53.8552 53.8556 53.8559 53.8563 53.8566 53.8568 53.857 53.8572 53.8573 53.8574 53.8574 53.8573 53.8572 53.8571 53.8569 53.8567 53.8564 53.8561 53.8557 53.8553 53.8549 53.8544 53.8539 53.8533 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.8439 53.8433 53.8428 53.8422 53.8417 53.8412 53.8407 53.8403 53.8399 53.8395 53.8391 53.8387 53.8384 53.8381 53.8378 53.8375 53.8373 53.837 53.8368 53.8366 53.8365 53.8363 53.8361 53.836 53.8359 53.8358 53.8357 53.8356 53.8355 53.8354 53.8353 53.8353 53.8352 53.8352 53.8351 53.8351 53.835 53.835 53.835 53.835 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8348 53.8348 53.8348 53.8348 53.8348 53.8348 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.835 53.835 53.835 53.835 53.8351 53.8351 53.8351 53.8352 53.8352 53.8353 53.8353 53.8354 53.8355 53.8355 53.8356 53.8357 53.8358 53.8359 53.836 53.8361 53.8363 53.8364 53.8366 53.8367 53.8369 53.8371 53.8373 53.8375 53.8378 53.838 53.8383 53.8385 53.8388 53.8391 53.8394 53.8397 53.8401 53.8404 53.8408 53.8411 53.8415 53.8419 53.8423 53.8427 53.8431 53.8435 53.8439 53.8443 53.8447 53.8451 53.8455 53.8458 53.8462 53.8466 53.8469 53.8473 53.8476 53.8479 53.8481 53.8484 53.8486 53.8488 53.849 53.8492 53.8493 53.8494 53.8495 53.8496 53.8496 53.8496 53.8496 53.8495 53.8495 53.8494 53.8493 53.8492 53.849 53.8489 53.8487 53.8485 53.8483 53.8481 53.8479 53.8477 53.8475 53.8473 53.8471 53.8469 53.8467 53.8465 53.8463 53.8462 53.846 53.8459 53.8458 53.8457 53.8456 53.8455 53.8455 53.8455 53.8455 53.8455 53.8455 53.8456 53.8457 53.8458 53.8459 53.8461 53.8463 53.8465 53.8467 53.847 53.8472 53.8475 53.8478 53.8481 53.8484 53.8488 53.8491 53.8495 53.8499 53.8503 53.8507 53.8511 53.8514 53.8518 53.8522 53.8526 53.853 53.8534 53.8537 53.8541 53.8544 53.8548 53.8551 53.8553 53.8556 53.8559 53.8561 53.8563 53.8564 53.8566 53.8567 53.8568 53.8569 53.8569 53.8569 53.8569 53.8569 53.8568 53.8568 53.8567 53.8565 53.8564 53.8562 53.8561 53.8559 53.8557 53.8555 53.8553 53.855 53.8548 53.8546 53.8543 53.8541 53.8538 53.8536 53.8534 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8517 53.8516 53.8514 53.8513 53.8511 53.851 53.8509 53.8508 53.8507 53.8506 53.8505 53.8504 53.8504 53.8503 53.8503 53.8502 53.8502 53.8502 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8502 53.8502 53.8502 53.8502 53.8502 53.8502 53.8502 53.8503 53.8503 53.8503 53.8503 53.8503 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8506 53.8506 53.8507 53.8507 53.8507 53.8508 53.8509 53.8509 53.851 53.8511 53.8511 53.8512 53.8513 53.8514 53.8515 53.8516 53.8517 53.8519 53.852 53.8521 53.8523 53.8525 53.8527 53.8528 53.8531 53.8533 53.8535 53.8537 53.854 53.8542 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8564 53.8567 53.8571 53.8574 53.8578 53.8581 53.8585 53.8588 53.8592 53.8595 53.8599 53.8602 53.8605 53.8608 53.8611 53.8614 53.8616 53.8618 53.862 53.8622 53.8623 53.8624 53.8625 53.8626 53.8626 53.8626 53.8626 53.8624 53.8624 53.8622 53.8621 53.8618 53.8616 53.8613 53.8611 53.8607 53.8605 53.86 53.8598 53.8592 53.859 53.8584 ) ; boundaryField { inlet { type calculated; value nonuniform List<scalar> 20 ( 50.5357 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5372 50.5357 ) ; } outlet { type calculated; value nonuniform List<scalar> 20 ( 53.8582 53.8584 53.8584 53.8584 53.8584 53.8584 53.8584 53.8584 53.8584 53.8584 53.8584 53.8584 53.8584 53.8584 53.8584 53.8584 53.8584 53.8584 53.8584 53.8582 ) ; } sides { type empty; } walls { type calculated; value nonuniform List<scalar> 2760 ( 50.5357 50.5357 50.5357 50.5357 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5359 50.5359 50.5359 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.5361 50.5361 50.5362 50.5362 50.5362 50.5362 50.5362 50.5362 50.5362 50.5362 50.5362 50.5363 50.5363 50.5363 50.5364 50.5364 50.5364 50.5364 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5365 50.5364 50.538 50.5345 50.5357 50.5357 50.5357 50.5357 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5358 50.5359 50.5359 50.5359 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.536 50.5361 50.5361 50.5362 50.5362 50.5362 50.5362 50.5362 50.5362 50.5362 50.5362 50.5362 50.5363 50.5363 50.5363 50.5364 50.5364 50.5364 50.5364 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5365 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5364 50.5367 50.5329 50.5558 50.5662 50.578 50.5814 50.5818 50.5818 50.582 50.582 50.5817 50.5812 50.5805 50.5798 50.5789 50.578 50.5769 50.5757 50.5741 50.5722 50.5696 50.5661 50.5608 50.4772 50.4524 50.4399 50.4343 50.4305 50.4273 50.4243 50.4219 50.42 50.4185 50.4172 50.4162 50.4155 50.4151 50.4153 50.4161 50.4182 50.4223 50.4286 50.4383 50.5376 50.5244 50.5206 50.5196 50.5191 50.5189 50.5188 50.5187 50.5187 50.5187 50.5187 50.5187 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5186 50.5185 50.5185 50.5185 50.5185 50.5185 50.5185 50.5185 50.5185 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5184 50.5185 50.5185 50.5185 50.5185 50.5186 50.5188 50.5189 50.5191 50.5191 50.5192 50.5192 50.5192 50.5192 50.5191 50.519 50.5184 50.5158 50.5037 50.4546 50.3409 50.2353 50.159 50.1151 50.098 50.0966 50.109 50.1736 50.2925 50.3887 50.4566 50.4995 50.5233 50.5343 50.5379 50.5381 50.5362 50.5312 50.5275 50.525 50.5235 50.5226 50.5221 50.5219 50.5218 50.5217 50.5218 50.5218 50.5219 50.5221 50.5222 50.5224 50.5225 50.5227 50.5229 50.5231 50.5233 50.5236 50.5238 50.5241 50.5244 50.5247 50.525 50.5254 50.5257 50.5261 50.5265 50.5269 50.5273 50.5278 50.5282 50.5287 50.5293 50.5298 50.5304 50.531 50.5316 50.5322 50.5329 50.5336 50.5343 50.5351 50.5359 50.5367 50.5375 50.5384 50.5393 50.5402 50.5412 50.5422 50.5433 50.5443 50.5455 50.5466 50.5478 50.549 50.5503 50.5516 50.5529 50.5543 50.5557 50.5571 50.5586 50.5601 50.5617 50.5632 50.5649 50.5665 50.5682 50.57 50.5718 50.5736 50.5754 50.5773 50.5792 50.5812 50.5832 50.5852 50.5872 50.5893 50.5915 50.5936 50.5958 50.598 50.6003 50.6025 50.6048 50.6072 50.6095 50.6119 50.6143 50.6168 50.6193 50.6218 50.6243 50.6268 50.6294 50.632 50.6346 50.6373 50.6399 50.6427 50.6451 50.6479 50.6477 50.6661 50.4894 50.5065 50.5106 50.5119 50.5123 50.5125 50.5125 50.5125 50.5125 50.5125 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5125 50.5125 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5126 50.5127 50.5127 50.5128 50.5129 50.5129 50.513 50.5131 50.5131 50.5132 50.5132 50.5133 50.5135 50.5143 50.5165 50.5187 50.5202 50.5211 50.5214 50.5214 50.521 50.5186 50.5082 50.4799 50.4481 50.4203 50.3978 50.3808 50.3693 50.3626 50.3596 50.359 50.3599 50.3662 50.386 50.4099 50.431 50.4491 50.4644 50.4769 50.4869 50.4949 50.5011 50.5059 50.5095 50.5123 50.5144 50.516 50.5171 50.518 50.5187 50.5192 50.5196 50.5199 50.5202 50.5204 50.5206 50.5208 50.5209 50.5211 50.5213 50.5214 50.5216 50.5217 50.5219 50.5221 50.5223 50.5225 50.5227 50.5229 50.5231 50.5233 50.5236 50.5238 50.5241 50.5244 50.5247 50.525 50.5254 50.5257 50.5261 50.5265 50.5269 50.5273 50.5278 50.5282 50.5287 50.5293 50.5298 50.5304 50.531 50.5316 50.5322 50.5329 50.5336 50.5343 50.5351 50.5359 50.5367 50.5375 50.5384 50.5393 50.5402 50.5412 50.5422 50.5433 50.5443 50.5455 50.5466 50.5478 50.549 50.5503 50.5516 50.5529 50.5543 50.5557 50.5571 50.5586 50.5601 50.5617 50.5632 50.5649 50.5665 50.5682 50.57 50.5718 50.5736 50.5754 50.5773 50.5792 50.5812 50.5832 50.5852 50.5872 50.5893 50.5915 50.5936 50.5958 50.598 50.6003 50.6025 50.6048 50.6072 50.6095 50.6119 50.6143 50.6168 50.6193 50.6218 50.6243 50.6268 50.6294 50.632 50.6346 50.6372 50.64 50.6426 50.6456 50.6485 50.6531 50.6551 50.6047 50.5812 50.5694 50.5643 50.5611 50.5585 50.5564 50.5547 50.5535 50.5528 50.5522 50.552 50.552 50.5524 50.5532 50.5548 50.5575 50.5621 50.5686 50.5783 50.6815 50.6935 50.6977 50.6989 50.6997 50.7006 50.7013 50.7017 50.702 50.7021 50.7021 50.702 50.7018 50.7015 50.701 50.7003 50.6992 50.6976 50.6951 50.6911 50.6266 50.645 50.6517 50.6557 50.6591 50.6622 50.6653 50.6684 50.6715 50.6746 50.6778 50.6811 50.6843 50.6876 50.6909 50.6943 50.6977 50.7012 50.7047 50.7082 50.7118 50.7154 50.719 50.7227 50.7264 50.7301 50.7339 50.7378 50.7417 50.7457 50.7497 50.7537 50.7578 50.7619 50.7661 50.7703 50.7746 50.7789 50.7833 50.7877 50.7922 50.7968 50.8013 50.806 50.8107 50.8155 50.8203 50.8252 50.83 50.8349 50.8397 50.8448 50.8502 50.8561 50.8627 50.8701 50.8769 50.8832 50.8893 50.8952 50.9006 50.9043 50.9019 50.8828 50.8571 50.8345 50.8169 50.8047 50.7979 50.7957 50.7976 50.8026 50.8096 50.8194 50.8395 50.8692 50.8967 50.9215 50.9433 50.9625 50.9793 50.9939 51.0067 51.0181 51.0283 51.0377 51.0464 51.0543 51.0621 51.0697 51.0769 51.0842 51.0909 51.0982 51.1048 51.1121 51.1185 51.1257 51.1298 51.1482 50.6718 50.6623 50.6614 50.6634 50.666 50.6689 50.6718 50.6748 50.6779 50.681 50.6842 50.6874 50.6907 50.6939 50.6973 50.7006 50.704 50.7075 50.7109 50.7144 50.718 50.7216 50.7252 50.7289 50.7326 50.7364 50.7402 50.744 50.7479 50.7519 50.7559 50.7599 50.764 50.7681 50.7722 50.7765 50.7807 50.785 50.7894 50.7938 50.7982 50.8027 50.8073 50.8119 50.8165 50.8212 50.8259 50.8307 50.8355 50.8404 50.8453 50.8502 50.8552 50.8603 50.8655 50.8707 50.8758 50.8811 50.8864 50.8917 50.8972 50.9027 50.9083 50.914 50.9196 50.9252 50.9308 50.9365 50.9424 50.9484 50.9543 50.959 50.9601 50.9457 50.8743 50.7294 50.5995 50.5037 50.4469 50.4248 50.426 50.4404 50.4986 50.6504 50.7997 50.9126 50.9912 51.0414 51.0711 51.0876 51.0974 51.1046 51.108 51.1089 51.1123 51.1162 51.1221 51.1277 51.1358 51.1424 51.1103 51.0951 51.0884 51.086 51.0851 51.0847 51.0843 51.0844 51.0848 51.0856 51.0865 51.0876 51.0889 51.0905 51.0923 51.0947 51.0978 51.1021 51.1077 51.1153 51.1629 51.1722 51.1763 51.1782 51.18 51.1818 51.1835 51.185 51.1863 51.1875 51.1886 51.1897 51.1908 51.1918 51.1927 51.1935 51.194 51.1943 51.1937 51.1926 51.1526 51.1698 51.1792 51.1868 51.1941 51.2013 51.2087 51.2161 51.2236 51.2313 51.239 51.2468 51.2546 51.2625 51.2704 51.2783 51.2863 51.2943 51.3023 51.3104 51.3185 51.3266 51.3348 51.343 51.3513 51.3596 51.3679 51.3762 51.3846 51.393 51.4014 51.4099 51.4184 51.4269 51.4355 51.4441 51.4528 51.4615 51.4702 51.4789 51.4877 51.4966 51.5054 51.5144 51.5234 51.5323 51.5411 51.55 51.559 51.5686 51.5789 51.5897 51.6006 51.6114 51.622 51.6322 51.6422 51.6512 51.6571 51.6519 51.6347 51.6186 51.6063 51.5986 51.5956 51.5969 51.602 51.6104 51.6211 51.6337 51.653 51.6826 51.711 51.7367 51.7599 51.7808 51.7992 51.8158 51.8311 51.8451 51.8578 51.8697 51.8813 51.8927 51.9035 51.914 51.9243 51.9345 51.9447 51.9548 51.9648 51.9749 51.9849 51.9949 52.0049 52.0148 52.0248 52.0348 52.0447 52.0547 52.0647 52.0746 52.0846 52.0945 52.1045 52.1144 52.1243 52.1343 52.1442 52.1541 52.164 52.1739 52.1837 52.1936 52.2034 52.2133 52.2231 52.2329 52.2427 52.2525 52.2622 52.272 52.2817 52.2914 52.3011 52.3108 52.3204 52.3301 52.3397 52.3493 52.3589 52.3685 52.378 52.3876 52.3971 52.4066 52.4161 52.4255 52.435 52.4444 52.4539 52.4633 52.4727 52.4821 52.4914 52.5008 52.5101 52.5195 52.5288 52.5381 52.5474 52.5567 52.566 52.5752 52.5845 52.5937 52.603 52.6122 52.6214 52.6306 52.6398 52.6489 52.6581 52.6673 52.6764 52.6855 52.6947 52.7038 52.7129 52.722 52.731 52.7401 52.7491 52.7582 52.7672 52.7762 52.7852 52.7942 52.8032 52.812 52.8211 52.8299 52.8389 52.8476 52.8567 52.8653 52.8744 52.8829 52.8921 52.9004 52.9097 52.9179 52.9271 52.9353 52.9445 52.9526 52.9616 52.9702 52.9783 52.9874 51.182 51.18 51.1856 51.1926 51.1996 51.207 51.2146 51.2223 51.2299 51.2377 51.2454 51.2532 51.261 51.2688 51.2767 51.2846 51.2926 51.3006 51.3086 51.3167 51.3248 51.3329 51.3411 51.3493 51.3576 51.3658 51.3741 51.3825 51.3908 51.3993 51.4077 51.4162 51.4246 51.4332 51.4417 51.4503 51.459 51.4676 51.4763 51.485 51.4937 51.5025 51.5113 51.5201 51.529 51.5379 51.5468 51.5558 51.5647 51.5737 51.5828 51.5919 51.601 51.6101 51.6192 51.6284 51.6377 51.647 51.6564 51.6659 51.6752 51.6845 51.6938 51.7032 51.713 51.7232 51.733 51.7415 51.7456 51.7314 51.6511 51.5079 51.3868 51.3033 51.26 51.2502 51.26 51.2879 51.3868 51.5554 51.6919 51.7904 51.8556 51.8958 51.9195 51.9343 51.9457 51.9528 51.9565 51.9622 51.9695 51.9778 51.9867 51.9961 52.0057 52.0154 52.0252 52.0351 52.045 52.0549 52.0648 52.0747 52.0847 52.0946 52.1045 52.1144 52.1244 52.1343 52.1442 52.1541 52.164 52.1739 52.1837 52.1936 52.2034 52.2133 52.2231 52.2329 52.2427 52.2525 52.2622 52.272 52.2817 52.2914 52.3011 52.3108 52.3204 52.3301 52.3397 52.3493 52.3589 52.3685 52.378 52.3876 52.3971 52.4066 52.4161 52.4255 52.435 52.4444 52.4539 52.4633 52.4727 52.4821 52.4914 52.5008 52.5101 52.5195 52.5288 52.5381 52.5474 52.5567 52.566 52.5752 52.5845 52.5937 52.603 52.6122 52.6214 52.6306 52.6398 52.6489 52.6581 52.6673 52.6764 52.6855 52.6947 52.7038 52.7129 52.722 52.731 52.7401 52.7491 52.7582 52.7672 52.7762 52.7852 52.7942 52.8031 52.8121 52.821 52.83 52.8387 52.8479 52.8564 52.8656 52.8741 52.8833 52.8916 52.9009 52.9091 52.9185 52.9266 52.9359 52.9439 52.9532 52.9612 52.9704 52.9777 52.9878 52.9938 52.9965 52.9986 53.0005 53.0022 53.0039 53.0057 53.0075 53.0095 53.0115 53.0135 53.0154 53.0171 53.0188 53.0207 53.0227 53.0246 53.0265 53.0285 53.0305 52.9904 52.9906 52.992 52.9938 52.9957 52.9976 52.9994 53.0013 53.0032 53.0051 53.0071 53.0091 53.0111 53.0131 53.0151 53.0171 53.0193 53.0214 53.0236 53.0258 53.0341 53.044 53.0549 53.0657 53.0762 53.0866 53.097 53.1075 53.1178 53.128 53.1381 53.1481 53.1581 53.168 53.1778 53.1875 53.1971 53.2067 53.2161 53.2255 53.2348 53.244 53.2531 53.2622 53.2711 53.2799 53.2887 53.2974 53.306 53.3145 53.323 53.3314 53.3396 53.3478 53.3558 53.3639 53.372 53.3801 53.388 53.3956 53.4031 53.4108 53.4192 53.4278 53.436 53.4423 53.4414 53.408 53.3031 53.2049 53.1456 53.1245 53.1285 53.1491 53.2299 53.3578 53.4496 53.5059 53.5367 53.5527 53.5615 53.5659 53.5656 53.5675 53.5713 53.576 53.5813 53.5868 53.5925 53.5982 53.6038 53.6094 53.615 53.6205 53.6259 53.6313 53.6366 53.6419 53.647 53.6521 53.6572 53.6622 53.6671 53.6719 53.6767 53.6813 53.686 53.6905 53.695 53.6994 53.7037 53.708 53.7122 53.7163 53.7203 53.7243 53.7282 53.732 53.7358 53.7394 53.743 53.7466 53.75 53.7534 53.7568 53.76 53.7632 53.7663 53.7693 53.7723 53.7752 53.778 53.7808 53.7834 53.7861 53.7886 53.7911 53.7935 53.7958 53.7981 53.8003 53.8024 53.8045 53.8065 53.8084 53.8102 53.812 53.8137 53.8153 53.8169 53.8184 53.8199 53.8212 53.8226 53.8238 53.8249 53.8261 53.8271 53.8281 53.8291 53.83 53.8308 53.8317 53.8324 53.8332 53.8339 53.8345 53.8351 53.8357 53.8363 53.8368 53.8373 53.8378 53.8383 53.8387 53.8392 53.8396 53.84 53.8404 53.8409 53.8413 53.8417 53.8421 53.8426 53.843 53.8435 53.844 53.8445 53.845 53.8455 53.846 53.8465 53.8471 53.8476 53.8482 53.8488 53.8493 53.8499 53.8505 53.8511 53.8516 53.8522 53.8527 53.8533 53.8538 53.8543 53.8547 53.8552 53.8556 53.8559 53.8563 53.8566 53.8568 53.857 53.8572 53.8573 53.8574 53.8574 53.8573 53.8572 53.8571 53.8569 53.8567 53.8564 53.8561 53.8557 53.8553 53.8549 53.8544 53.8539 53.8533 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.8439 53.8433 53.8428 53.8422 53.8417 53.8412 53.8407 53.8403 53.8399 53.8395 53.8391 53.8387 53.8384 53.8381 53.8378 53.8375 53.8373 53.837 53.8368 53.8366 53.8365 53.8363 53.8361 53.836 53.8359 53.8358 53.8357 53.8356 53.8355 53.8354 53.8353 53.8353 53.8352 53.8352 53.8351 53.8351 53.835 53.835 53.835 53.835 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8348 53.8348 53.8348 53.8348 53.8348 53.8348 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.835 53.835 53.835 53.835 53.8351 53.8351 53.8351 53.8352 53.8352 53.8353 53.8353 53.8354 53.8355 53.8355 53.8356 53.8357 53.8358 53.8359 53.836 53.8361 53.8363 53.8364 53.8366 53.8367 53.8369 53.8371 53.8373 53.8375 53.8378 53.838 53.8383 53.8385 53.8388 53.8391 53.8394 53.8397 53.8401 53.8404 53.8408 53.8411 53.8415 53.8419 53.8423 53.8427 53.8431 53.8435 53.8439 53.8443 53.8447 53.8451 53.8455 53.8458 53.8462 53.8466 53.8469 53.8473 53.8476 53.8479 53.8481 53.8484 53.8486 53.8488 53.849 53.8492 53.8493 53.8494 53.8495 53.8496 53.8496 53.8496 53.8496 53.8495 53.8495 53.8494 53.8493 53.8492 53.849 53.8489 53.8487 53.8485 53.8483 53.8481 53.8479 53.8477 53.8475 53.8473 53.8471 53.8469 53.8467 53.8465 53.8463 53.8462 53.846 53.8459 53.8458 53.8457 53.8456 53.8455 53.8455 53.8455 53.8455 53.8455 53.8455 53.8456 53.8457 53.8458 53.8459 53.8461 53.8463 53.8465 53.8467 53.847 53.8472 53.8475 53.8478 53.8481 53.8484 53.8488 53.8491 53.8495 53.8499 53.8503 53.8507 53.8511 53.8514 53.8518 53.8522 53.8526 53.853 53.8534 53.8537 53.8541 53.8544 53.8548 53.8551 53.8553 53.8556 53.8559 53.8561 53.8563 53.8564 53.8566 53.8567 53.8568 53.8569 53.8569 53.8569 53.8569 53.8569 53.8568 53.8568 53.8567 53.8565 53.8564 53.8562 53.8561 53.8559 53.8557 53.8555 53.8553 53.855 53.8548 53.8546 53.8543 53.8541 53.8538 53.8536 53.8534 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8517 53.8516 53.8514 53.8513 53.8511 53.851 53.8509 53.8508 53.8507 53.8506 53.8505 53.8504 53.8504 53.8503 53.8503 53.8502 53.8502 53.8502 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8502 53.8502 53.8502 53.8502 53.8502 53.8502 53.8502 53.8503 53.8503 53.8503 53.8503 53.8503 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8506 53.8506 53.8507 53.8507 53.8507 53.8508 53.8509 53.8509 53.851 53.8511 53.8511 53.8512 53.8513 53.8514 53.8515 53.8516 53.8517 53.8519 53.852 53.8521 53.8523 53.8525 53.8527 53.8528 53.8531 53.8533 53.8535 53.8537 53.854 53.8542 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8564 53.8567 53.8571 53.8574 53.8578 53.8581 53.8585 53.8588 53.8592 53.8595 53.8599 53.8602 53.8605 53.8608 53.8611 53.8614 53.8616 53.8618 53.862 53.8622 53.8623 53.8624 53.8625 53.8626 53.8626 53.8626 53.8626 53.8624 53.8624 53.8622 53.8621 53.8618 53.8616 53.8613 53.8611 53.8607 53.8605 53.86 53.8598 53.8592 53.859 53.8584 53.036 53.046 53.0555 53.0647 53.0739 53.0831 53.0926 53.1022 53.112 53.1219 53.1318 53.1418 53.1517 53.1616 53.1713 53.181 53.1907 53.2002 53.2097 53.2191 53.2285 53.2377 53.2468 53.2559 53.2648 53.2739 53.2829 53.2915 53.2999 53.3084 53.3172 53.3263 53.3355 53.3446 53.3537 53.363 53.372 53.3799 53.3844 53.377 53.3536 53.3317 53.315 53.3045 53.3001 53.3013 53.3073 53.3164 53.3293 53.3545 53.3871 53.4158 53.4398 53.4602 53.4776 53.4923 53.5044 53.5146 53.5239 53.5327 53.5408 53.5482 53.5549 53.5614 53.5678 53.574 53.5801 53.5861 53.592 53.5978 53.6036 53.6093 53.6149 53.6204 53.6259 53.6313 53.6366 53.6418 53.647 53.6521 53.6572 53.6622 53.6671 53.6719 53.6767 53.6813 53.686 53.6905 53.695 53.6994 53.7037 53.708 53.7122 53.7163 53.7203 53.7243 53.7282 53.732 53.7358 53.7394 53.743 53.7466 53.75 53.7534 53.7568 53.76 53.7632 53.7663 53.7693 53.7723 53.7752 53.778 53.7808 53.7834 53.7861 53.7886 53.7911 53.7935 53.7958 53.7981 53.8003 53.8024 53.8045 53.8065 53.8084 53.8102 53.812 53.8137 53.8153 53.8169 53.8184 53.8199 53.8212 53.8226 53.8238 53.8249 53.8261 53.8271 53.8281 53.8291 53.83 53.8308 53.8317 53.8324 53.8332 53.8339 53.8345 53.8351 53.8357 53.8363 53.8368 53.8373 53.8378 53.8383 53.8387 53.8392 53.8396 53.84 53.8404 53.8409 53.8413 53.8417 53.8421 53.8426 53.843 53.8435 53.844 53.8445 53.845 53.8455 53.846 53.8465 53.8471 53.8476 53.8482 53.8488 53.8493 53.8499 53.8505 53.8511 53.8516 53.8522 53.8527 53.8533 53.8538 53.8543 53.8547 53.8552 53.8556 53.8559 53.8563 53.8566 53.8568 53.857 53.8572 53.8573 53.8574 53.8574 53.8573 53.8572 53.8571 53.8569 53.8567 53.8564 53.8561 53.8557 53.8553 53.8549 53.8544 53.8539 53.8533 53.8528 53.8522 53.8516 53.8509 53.8503 53.8496 53.849 53.8483 53.8477 53.847 53.8464 53.8457 53.8451 53.8445 53.8439 53.8433 53.8428 53.8422 53.8417 53.8412 53.8407 53.8403 53.8399 53.8395 53.8391 53.8387 53.8384 53.8381 53.8378 53.8375 53.8373 53.837 53.8368 53.8366 53.8365 53.8363 53.8361 53.836 53.8359 53.8358 53.8357 53.8356 53.8355 53.8354 53.8353 53.8353 53.8352 53.8352 53.8351 53.8351 53.835 53.835 53.835 53.835 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8348 53.8348 53.8348 53.8348 53.8348 53.8348 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.8349 53.835 53.835 53.835 53.835 53.8351 53.8351 53.8351 53.8352 53.8352 53.8353 53.8353 53.8354 53.8355 53.8355 53.8356 53.8357 53.8358 53.8359 53.836 53.8361 53.8363 53.8364 53.8366 53.8367 53.8369 53.8371 53.8373 53.8375 53.8378 53.838 53.8383 53.8385 53.8388 53.8391 53.8394 53.8397 53.8401 53.8404 53.8408 53.8411 53.8415 53.8419 53.8423 53.8427 53.8431 53.8435 53.8439 53.8443 53.8447 53.8451 53.8455 53.8458 53.8462 53.8466 53.8469 53.8473 53.8476 53.8479 53.8481 53.8484 53.8486 53.8488 53.849 53.8492 53.8493 53.8494 53.8495 53.8496 53.8496 53.8496 53.8496 53.8495 53.8495 53.8494 53.8493 53.8492 53.849 53.8489 53.8487 53.8485 53.8483 53.8481 53.8479 53.8477 53.8475 53.8473 53.8471 53.8469 53.8467 53.8465 53.8463 53.8462 53.846 53.8459 53.8458 53.8457 53.8456 53.8455 53.8455 53.8455 53.8455 53.8455 53.8455 53.8456 53.8457 53.8458 53.8459 53.8461 53.8463 53.8465 53.8467 53.847 53.8472 53.8475 53.8478 53.8481 53.8484 53.8488 53.8491 53.8495 53.8499 53.8503 53.8507 53.8511 53.8514 53.8518 53.8522 53.8526 53.853 53.8534 53.8537 53.8541 53.8544 53.8548 53.8551 53.8553 53.8556 53.8559 53.8561 53.8563 53.8564 53.8566 53.8567 53.8568 53.8569 53.8569 53.8569 53.8569 53.8569 53.8568 53.8568 53.8567 53.8565 53.8564 53.8562 53.8561 53.8559 53.8557 53.8555 53.8553 53.855 53.8548 53.8546 53.8543 53.8541 53.8538 53.8536 53.8534 53.8531 53.8529 53.8527 53.8525 53.8523 53.8521 53.8519 53.8517 53.8516 53.8514 53.8513 53.8511 53.851 53.8509 53.8508 53.8507 53.8506 53.8505 53.8504 53.8504 53.8503 53.8503 53.8502 53.8502 53.8502 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8501 53.8502 53.8502 53.8502 53.8502 53.8502 53.8502 53.8502 53.8503 53.8503 53.8503 53.8503 53.8503 53.8504 53.8504 53.8504 53.8504 53.8504 53.8505 53.8505 53.8505 53.8506 53.8506 53.8507 53.8507 53.8507 53.8508 53.8509 53.8509 53.851 53.8511 53.8511 53.8512 53.8513 53.8514 53.8515 53.8516 53.8517 53.8519 53.852 53.8521 53.8523 53.8525 53.8527 53.8528 53.8531 53.8533 53.8535 53.8537 53.854 53.8542 53.8545 53.8548 53.8551 53.8554 53.8557 53.856 53.8564 53.8567 53.8571 53.8574 53.8578 53.8581 53.8585 53.8588 53.8592 53.8595 53.8599 53.8602 53.8605 53.8608 53.8611 53.8614 53.8616 53.8618 53.862 53.8622 53.8623 53.8624 53.8625 53.8626 53.8626 53.8626 53.8626 53.8624 53.8624 53.8622 53.8621 53.8618 53.8616 53.8613 53.8611 53.8607 53.8605 53.86 53.8598 53.8592 53.859 53.8584 ) ; } } // ************************************************************************* //

[ "alexmayes@gmail.com" ]

alexmayes@gmail.com

4857a206d6569ad29a4835db722193a8a5f8eb4b

b6fd0ebab3c43ed59647f95ad5fe2baff4610c00

/factories/bitmapheaderfactory.cc

01c5d84f8818a5737b8a287ffbafda20754c05ea

[]

no_license

aghoward/bitmapper

7d7af88a3d836182ae4aafb9c50ab8801ffc1ead

0918dd34d8d238177dcf6bd9aa4079c811001ed6

refs/heads/master

2021-06-16T18:05:35.954856

2017-04-06T00:40:16

87,323,687

4

0

null

UTF-8

C++

false

312

cc

#include <memory> #include "bitmapheaderfactory.h" #include "headers/bitmapheader.h" using namespace std; shared_ptr<BitmapHeader> BitmapHeaderFactory::Create(unsigned int fileSize, unsigned int pixelOffset) { return shared_ptr<BitmapHeader>(new BitmapHeader(string("BM"), fileSize, 0x0, pixelOffset)); }

[ "ahoward@foxguardsolutions.com" ]

ahoward@foxguardsolutions.com

7c9b675f019bd75db9c08ceaa0cd454e5e6cc633

45dbe72565d05fe35da9b071895748fe9388a50d

/ui/gameaccountwindow.cpp

09c044c0341664ad541f24754d139a1f0bb84ee1

[]

no_license

dbrook/vidpokerterm

4a70b44576b79aa009eae3c6af97639bd9f5ff81

8f1f78ac80ffec040f25f4a9a33a9a5413f1cb9f

refs/heads/master

2023-01-01T02:08:04.626001

2020-10-20T00:21:43

268,131,266

0

null

2020-09-29T00:26:04

2020-05-30T17:47:45

C++

UTF-8

C++

false

7,337

cpp

/* * This file is part of VidPokerTerm. Copyright (c) 2020 Daniel Brook * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see <http://www.gnu.org/licenses/>. */ #include "gameaccountwindow.h" #include "ui_gameaccountwindow.h" // Game Orchestrator Window can be started with all different supported PokerGame subclasses #include "gameorchestratorwindow.h" // Individual games supported (sub-classed from PokerGame) #include "jacksorbetter.h" #include "bonuspoker.h" GameAccountWindow::GameAccountWindow(QWidget *parent) : QMainWindow(parent) , _playerAccount() , ui(new Ui::GameAccountWindow) { ui->setupUi(this); // Connect the widgets initialized to their appropriate slots connect(ui->exitButton, &QPushButton::clicked, QApplication::instance(), &QApplication::quit); // TODO: Make an "About..." window ... // Connect the value of the spinbox to the actual account balance + support buttons for changing values connect(&_playerAccount, &Account::balanceChanged, this, &GameAccountWindow::updateAccountBalance); connect(ui->resetAcct0, &QPushButton::clicked, this, [=]() { _playerAccount.setBalance(0); }); connect(ui->addAcct10, &QPushButton::clicked, this, [=]() { _playerAccount.add(10); }); connect(ui->addAcct100, &QPushButton::clicked, this, [=]() { _playerAccount.add(100); }); // TODO: // For now, do not allow more or less than 1 hand at a time. The Orchestrator UI cannot handle it even though the // orchestrator back-end is more than happy to ui->handsToPlayLCD->display(1); /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * ALL SUPPORTED GAMES SHOULD BE PUSHED HERE SO THEY ARE RENDERED TO THE ACCOUNT / GAME SELECTION SCREEN * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ _supportedGames.push_back(new JacksOrBetter); _supportedGames.push_back(new BonusPoker); /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ // Loop over all games added above and create buttons + connections to launch them for (int gameIdx = 0; gameIdx < _supportedGames.size(); ++gameIdx) { QString nameOfGame = _supportedGames[gameIdx]->gameName(); QPushButton *gameStartButton = new QPushButton(nameOfGame, this); ui->gameSelectFrame->layout()->addWidget(gameStartButton); // Connect the button to the game starter connect(gameStartButton, &QPushButton::clicked, this, [=]() { startGame(_supportedGames[gameIdx]); }); } // When games are added they will mess up the intrinsic "tab" ordering of the main window, so build a new ordering // First the credits-available: setTabOrder(ui->addAcct100, ui->addAcct10); setTabOrder(ui->addAcct10, ui->resetAcct0); int i; for (i = 0; i < ui->gameSelectFrame->layout()->count(); ++i) { if (i == 0) { setTabOrder(ui->resetAcct0, ui->gameSelectFrame->layout()->itemAt(i)->widget()); } else { setTabOrder(ui->gameSelectFrame->layout()->itemAt(i - 1)->widget(), ui->gameSelectFrame->layout()->itemAt(i)->widget()); } } // Then finally link the Exit and About... Buttons setTabOrder(ui->gameSelectFrame->layout()->itemAt(i - 1)->widget(), ui->exitButton); setTabOrder(ui->exitButton, ui->aboutButton); // SOFTKEY ASSIGNMENT // Move Down / Up: connect(ui->moveDnSoftkey, &QPushButton::clicked, this, &GameAccountWindow::focusNextChild); connect(ui->moveUpSoftkey, &QPushButton::clicked, this, &GameAccountWindow::focusPreviousChild); // Select connect(ui->selectSoftkey, &QPushButton::clicked, this, [=]() { // Hope this doesn't crash ... anyway the user will only be able to cycle through pushbuttons QPushButton *currentlyFocused = dynamic_cast<QPushButton*>(this->focusWidget()); currentlyFocused->click(); }); // Number of Hands Increment / Decrement connect(ui->nbHandsDec, &QPushButton::clicked, this, [=]() {changeNumberOfHands(-1);}); connect(ui->nbHandsInc, &QPushButton::clicked, this, [=]() {changeNumberOfHands( 1);}); // Uncomment to make window full-screen // this->setWindowState(this->windowState() | Qt::WindowFullScreen); // Uncomment the line below to mask the mouse pointer // QApplication::setOverrideCursor(Qt::BlankCursor); } GameAccountWindow::~GameAccountWindow() { delete ui; } void GameAccountWindow::updateAccountBalance(quint32 updatedBalance) { // WARNING: Static cast could yeild strangeness for big numbers of credits ui->creditCountLCD->display(static_cast<int>(updatedBalance)); } void GameAccountWindow::startGame(PokerGame *gameLogicPointer) { // How many simultaneous hands are played per betting round? int numberOfHands = ui->handsToPlayLCD->value(); // Create a game and link it to this parent, open the window GameOrchestratorWindow *gow = new GameOrchestratorWindow(_playerAccount, gameLogicPointer, numberOfHands, this); // Needed so that memory is automatically cleaned out when closing the window! gow->setAttribute(Qt::WA_DeleteOnClose); // Start the game gow->show(); } void GameAccountWindow::changeNumberOfHands(int increaseDecrease) { int currentHandCount = ui->handsToPlayLCD->value(); int nextHandCount = 1; // Because of rendering constraints, adjust the number of hands not 1-by-1 but with specific values if (increaseDecrease == -1) { switch (currentHandCount) { case 1: // nextHandCount = 100; nextHandCount = 25; break; case 5: nextHandCount = 3; break; case 10: nextHandCount = 5; break; case 25: nextHandCount = 10; break; // case 100: // nextHandCount = 25; // break; default: nextHandCount = 1; } } else if (increaseDecrease == 1) { switch (currentHandCount) { case 1: nextHandCount = 3; break; case 3: nextHandCount = 5; break; case 5: nextHandCount = 10; break; case 10: nextHandCount = 25; break; // case 25: // nextHandCount = 100; // break; default: nextHandCount = 1; } } // Update the UI control with the new value ui->handsToPlayLCD->display(nextHandCount); }

[ "danb358@gmail.com" ]

danb358@gmail.com

a10cf7f5b4e96111927d59a33c730a4428d1ddaf

0400ac52a20058bf13a064b838872473212765ca

/Unity_Code/DinoRun_Final/Temp/il2cppOutput/il2cppOutput/mscorlib_System_Predicate_1_gen3564654344.h

b6166ef145f9c73d7c812780ebef48ab4c5b59dd

[ "Apache-2.0" ]

permissive

BPenzar/SuperDinoBros.

b7e6be07bfc4278d85eeb986f4740c9a91e01689

f46b866c5a1119c6753dbd8e963212f17a4a31d5

refs/heads/master

2021-01-20T04:29:24.503356

2017-07-25T14:58:12

89,697,299

0

1

null

UTF-8

C++

false

725

h

#pragma once #include "il2cpp-config.h" #ifndef _MSC_VER # include <alloca.h> #else # include <malloc.h> #endif #include <stdint.h> #include "mscorlib_System_MulticastDelegate3201952435.h" // Sound struct Sound_t826716933; // System.IAsyncResult struct IAsyncResult_t1999651008; // System.AsyncCallback struct AsyncCallback_t163412349; // System.Object struct Il2CppObject; #ifdef __clang__ #pragma clang diagnostic push #pragma clang diagnostic ignored "-Winvalid-offsetof" #pragma clang diagnostic ignored "-Wunused-variable" #endif // System.Predicate`1<Sound> struct Predicate_1_t3564654344 : public MulticastDelegate_t3201952435 { public: public: }; #ifdef __clang__ #pragma clang diagnostic pop #endif

[ "bruno.penzar@posteo.de" ]

bruno.penzar@posteo.de

e18834d77e8bcf7b1398d289558c952cf07af9c3

94c7dfaa1df29210b973154d2db95d8c492eabbd

/labs/lab4/main.cpp

12fb86298e0ea0b7e9448ffe72cf60981b2567f7

[]

no_license

ArtDu/PGP

a6f19c2a36b33f18573baed831f91e56da2b2740

198e5b41420f2911733f6a8754615472a09f6551

refs/heads/master

2023-07-03T03:10:34.204857

2021-08-07T15:18:14

2021-08-07T15:27:21

297,765,721

1

null

UTF-8

C++

false

1,979

cpp

#include <bits/stdc++.h> #include <algorithm> //#include <thrust/extrema.h> //#include <thrust/device_vector.h> using namespace std; const double EPS = 1E-9; int compute_rank(vector <vector<double>> A) { int n = A.size(); int m = A[0].size(); int rank = 0; vector<bool> row_selected(n, false); for (int i = 0; i < m; ++i) { int j; for (j = 0; j < n; ++j) { if (!row_selected[j] && abs(A[j][i]) > EPS) break; } if(j != n) cerr << "col: " << i << " row: " << j << " mx: " << abs(A[j][i]) << "\n\n"; if (j != n) { ++rank; row_selected[j] = true; for (int p = i + 1; p < m; ++p) A[j][p] /= A[j][i]; cerr << "change curr line\n"; for (int k = 0; k < n; ++k) { for (int l = 0; l < m; ++l) { cerr << A[k][l] << " "; } cerr << "\n"; } cerr << "\n"; for (int k = 0; k < n; ++k) { if (k != j && abs(A[k][i]) > EPS) { for (int p = i + 1; p < m; ++p) A[k][p] -= A[j][p] * A[k][i]; } } cerr << "change other lines\n"; for (int k = 0; k < n; ++k) { for (int l = 0; l < m; ++l) { cerr << A[k][l] << " "; } cerr << "\n"; } cerr << "\n"; } } return rank; } int main(int argc, char *argv[]) { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m; cin >> n >> m; vector <vector<double>> A(n, vector<double>(m)); for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { cin >> A[i][j]; cerr << A[i][j] << " "; } cerr << "\n"; } cout << compute_rank(A) << "\n"; return 0; }

[ "artyom.dubinin@corp.mail.ru" ]

artyom.dubinin@corp.mail.ru

7a7fcb231093f7ebfc8b00d8bcde756b311e5ef8

ac514cb2383ed4789e95b02433eecba139419418

/longest_substring_with_at_most_two_distinct_characters.cpp

75b8c21603607e61bfc4cf734ffe6ec39a3b974e

[]

no_license

YhgzXxfz/leetcode

c602b91bd32da86b0376f4998ca2e702d0b28c10

7cce57ff48ac8e8dc1ae352b9948f66055651eee

refs/heads/master

2020-04-07T03:44:25.071745

2018-03-04T12:52:29

34,910,334

0

null

UTF-8

C++

false

619

cpp

class Solution { public: int lengthOfLongestSubstringTwoDistinct(string s) { int count[256] = {0}; // initialization is necessary for counting distinct numbers int begin = 0, distinct = 0, max_len = 0; for (int i = 0; i < s.size(); ++i) { if (count[s[i]] == 0) distinct++; count[s[i]]++; while (distinct > 2) { count[s[begin]]--; if (count[s[begin]] == 0) distinct--; begin++; } max_len = max(max_len, i-begin+1); } return max_len; } };

[ "qingfeiyou@gmail.com" ]

qingfeiyou@gmail.com

2892d29483943d4da05c57c9c82208c9d2030938

d7d1352eec0ce47675e527a7f6569d37cc1da867

/chrome/browser/lacros/metrics_reporting_observer.cc

939a213205f935c38090753bc2b03237d578d030

[ "BSD-3-Clause" ]

permissive

weiqiLee/chromium

4f406b41e62899cede510608cbb175f4ec8f1418

2200c9be391b535cff664b3a0ed3c24289162e8a

refs/heads/master

2023-01-23T09:13:41.341531

2020-12-08T23:50:07

null

0

null

UTF-8

C++

false

1,385

cc

// Copyright 2020 The Chromium Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #include "chrome/browser/lacros/metrics_reporting_observer.h" #include "base/bind.h" #include "chrome/browser/metrics/metrics_reporting_state.h" #include "chromeos/lacros/lacros_chrome_service_impl.h" MetricsReportingObserver::MetricsReportingObserver() = default; MetricsReportingObserver::~MetricsReportingObserver() = default; void MetricsReportingObserver::Init() { auto* lacros_service = chromeos::LacrosChromeServiceImpl::Get(); if (!lacros_service->IsMetricsReportingAvailable()) { LOG(WARNING) << "MetricsReporting API not available"; return; } // Set the initial state. ChangeMetricsReportingState( lacros_service->init_params()->ash_metrics_enabled); // Add this object as an observer. The observer will fire with the current // state in ash, to avoid races where ash might change state between the // initial state above from lacros startup and the observer being added. lacros_service->BindMetricsReporting( metrics_reporting_remote_.BindNewPipeAndPassReceiver()); metrics_reporting_remote_->AddObserver(receiver_.BindNewPipeAndPassRemote()); } void MetricsReportingObserver::OnMetricsReportingChanged(bool enabled) { ChangeMetricsReportingState(enabled); }

[ "chromium-scoped@luci-project-accounts.iam.gserviceaccount.com" ]

chromium-scoped@luci-project-accounts.iam.gserviceaccount.com

e1435ba804d5adc888be7bf73f04e13c8c9faea9

30c68f513e90ca5998ab6e120e40227d39a5086a

/160个Crackme044/KeyGen/KeyGen/keygen.cpp

b0cdfc78752015cc6428e522937665206b2a4672

[]

no_license

Anisluo/160-Crackme

32e84b9b29bec7dda9a14e584940fe99bb07809e

db8d2567f335a964ea32c7f05534f4f68cfabdbc

refs/heads/master

2022-06-27T08:45:29.577439

2022-06-06T07:38:51

422,465,855

0

null

GB18030

C++

false

2,010

cpp

#include <iostream> #include <windows.h> int main() { char username[20] = { 0 }; printf("请输入用户名:"); scanf_s("%s", username, 20); int usernameLen = strlen(username); if (usernameLen<6) { printf("用户名长度必须大于等于6"); } //大写转小写 for (int i=0;i<usernameLen;i++) { if (username[i]>='A'&&username[i]<='Z') { username[i] += 32; } } int v13 = 0; int TotalSum = 0; int i = 0; // i初始化为零 do { switch ((username[i- 1]))// 根据username[i]的值给v13赋值 { case 0x61u: v13 = 0x18; break; case 0x62u: v13 = 0x25; break; case 0x63u: v13 = 0x42; break; case 0x64u: v13 = 0xC; break; case 0x65u: v13 = 0xD; break; case 0x66u: v13 = 6; break; case 0x67u: v13 = 0x36; break; case 0x68u: v13 = 0x2B; break; case 0x69u: v13 = 0x17; break; case 0x6Au: v13 = 0x2F; break; case 0x6Bu: v13 = 0x13; break; case 0x6Cu: v13 = 0x82u; break; case 0x6Du: v13 = 0x9Bu; break; case 0x6Eu: v13 = 0x92u; break; case 0x6Fu: v13 = 3; break; case 0x70u: v13 = 0x63; break; case 0x71u: v13 = 0x21; break; case 0x72u: v13 = 0x42; break; case 0x73u: v13 = 0x5C; break; case 0x74u: v13 = 0x29; break; case 0x75u: v13 = 0xC7u; break; case 0x76u: v13 = 0x66; break; case 0x77u: v13 = 0x58; break; case 0x78u: v13 = 0xA; break; case 0x79u: v13 = 0x28; break; case 0x7Au: v13 = 0x50; break; default: v13 = 0x5D; break; } TotalSum += v13; // 循环累加v13的值 ++i; //这里记得超出范围清掉高位 if (TotalSum>0xFF) { TotalSum &= 0x00FF; } } while (i != 6); printf("%d-%d\n", TotalSum,0x4A7E*usernameLen); system("pause"); return 0; }

[ "noreply@github.com" ]

noreply@github.com

989b27e36bdc39541cc7fd2d4cd2f81e8ec84e0c

f4dfd13437614e197ddad0aabf5fb73d048f3e36

/try2.2/try2.0/FileSystem.h

89acddc645baaf29439950d336b755d6e3f7ddad

[]

no_license

James-zjm/File-System

6e41b0ed5c5f93cf8082493931bb319c75c30eb1

6958233b3dff024fc2d1fd0ae3ff2014eb9da45a

refs/heads/master

2022-05-27T09:33:13.207549

2018-09-12T11:54:46

null

0

null

GB18030

C++

false

3,304

h

#pragma once #ifndef FILESYSTEM_H_ #define FILESYSTEM_H_ #include "try2.0.h" #include <string> //全局变量定义 extern const int kSuperBlockStartAddress; //超级块偏移地址,占一个磁盘块 extern const int kInodeBitmapStartAddress; //inode位图偏移地址，占512个磁盘块，最多监控 524288 个inode的状态 extern const int kBlockBitmapStartAddress; //block位图偏移地址，占1024个磁盘块，最多监控1G的状态 extern const int kInodeStartAddress; //inode节点区偏移地址，占 65536 个磁盘块 extern const int kBlockStartAddress; //block数据区偏移地址，占 BLOCK_NUM 个磁盘块 extern const int kSumSize; //虚拟磁盘文件大小 extern const int kFileMaxSize; //单个文件最大大小 class FileSystem { public: FileSystem(); void create(FILE *w, FILE *r); void Open();//打开文件系统 void Parser();//命令读取与解释 ~FileSystem(); int error_; //错误信息 private: void Format(); //格式化 int ialloc(); //分配inode空间 int balloc(); //分配block空间 int DirectoryLookup(int previous_file, const char *name, bool type, int &posi, int &posj);//查找文件内目录 void Mkdir(int parinoAddr, const char *name);//创建文件夹 void Cd(int parinoAddr, const char *path);//打开当前目录 void Move(int be_shared_folder, const char *be_shared_name, int shar_to_folder, int file_type);//剪切函数 void AddFileToFolder(int folder_inode_adress, int file_inode_adress, const char* file_name, bool file_type);//向一个文件夹中添加内容 void bfree(int addr); //磁盘块释放函数 void ifree(int addr); //释放i结点区函数 void PutInRecycle(int previous_file, const char *file_name, bool file_type);//放进回收站 void RestoreFromRecycle(const char *file_name, bool file_type);//还原文件 void EmptyRecycle(); //清空回收站 void win_cp_minfs(int parinoAddr, const char* name, const char* win_path); void minifs_cp_win(int parinoAddr, const char* name, const char* win_path);//minifs向win拷贝 void more(int parinoAddr);//分页输出txt void type_txt(int parinoAddr); //显示当前文件夹下的文本文件 void att(int parinoAddr, const char *file);//显示空间文件属性 void _Find(const char *a, int parinoAddr, const char *b);//查找内容 void find(const char *a);//寻找文件 void ls(int parinoAddr);//显示目录下所有文件 void DelRecursion(int delAddress);//删除文件夹 void minifs_cp_minifs(int parinoAddr, const char *name, int parinoAddr2); void copy_block(int parinoAddr, int parinoAddr2);//拷贝磁盘块 int root_directory_address_; //根目录inode地址 int recycle_directory_address_; int current_directory_address_; //当前目录 std::string current_directory_path_; //当前路径 FILE* fw; //虚拟磁盘文件写文件指针 FILE* fr; //虚拟磁盘文件读文件指针 SuperBlock *super_block_; //超级块指针 }; #endif // FILESYSTE M_H_

[ "noreply@github.com" ]

noreply@github.com

a8baf6f7e97484de3e5b2a6da2ec68f4b2929fe7

081c75d11a4a8eb139f1685f087d9cc85a4fa072

/include/nmtools/array/array/batch_norm.hpp

ede0ee5cfd897bceb8934e7369a2c1b553a12dd6

[]

no_license

alifahrri/nmtools

c0a9d63b4101193b484f3e05bce606d58c3b85e2

fa8a45bc3ddb373b7f547dfea3c2c7bea3056e06

refs/heads/master

2023-08-28T19:36:41.814434

2023-08-20T08:28:40

190,819,342

7

0

null

2023-08-20T08:28:41

2019-06-07T22:43:35

C++

UTF-8

C++

false

1,596

hpp

#ifndef NMTOOLS_ARRAY_ARRAY_BATCH_NORM_HPP #define NMTOOLS_ARRAY_ARRAY_BATCH_NORM_HPP #include "nmtools/array/view/batch_norm.hpp" #include "nmtools/array/eval.hpp" namespace nmtools::array { /** * @brief Eagerly compute batch_norm. * * @tparam output_t * @tparam context_t=none_t * @tparam input_t * @tparam mean_t * @tparam var_t * @tparam weight_t * @tparam bias_t * @tparam epsilon_t * @param input input array with shape (N,C,H,W) * @param mean (estimated) mean array with shape (C) * @param var (estimated) var array with shape (C) * @param weight a.k.a. scale with shape (C) * @param bias bias with shape (C) * @param eps epsilon value to use to avoid division by zero. * @param context * @param output * @return constexpr auto */ template <typename output_t=none_t, typename context_t=none_t , typename input_t, typename mean_t, typename var_t, typename weight_t, typename bias_t, typename epsilon_t=float> constexpr auto batch_norm(const input_t& input, const mean_t& mean, const var_t& var, const weight_t& weight, const bias_t& bias, epsilon_t eps=epsilon_t{1e-5} , context_t&& context=context_t{}, output_t&& output=output_t{}) { auto batch_norm_ = view::batch_norm(input,mean,var,weight,bias,eps); return eval(batch_norm_,nmtools::forward<context_t>(context),nmtools::forward<output_t>(output)); } // batch_norm } // namespace nmtools::array #endif // NMTOOLS_ARRAY_ARRAY_BATCH_NORM_HPP

[ "noreply@github.com" ]

noreply@github.com

f41e98feebdc499562fdf343420300f73bf18bea

5bc18d7a05777494e8bff928c657abcb527f801d

/3-wheel Car/2.Communication/Software/receiver_example.ino

505851e87ec740045bae703dc6565d48cf5b0a97

[]

no_license

Sokrkose/ARTEMIS_2016-2018

d5b6ba9517c98fe4d782183cec30f94cfce76cde

1ec7fc45c2aeab30b63e608145f08366c2116044

refs/heads/main

2023-07-12T17:19:53.564360

2021-08-24T15:34:42

399,507,688

0

null

UTF-8

C++

false

1,050

ino

#include<SPI.h> //#include<nRF24L01.h> #include<RF24.h> const uint64_t pipe[1]= {0xF0F0F0F0E1LL}; RF24 radio(9,10); typedef struct { int x; int y; } positions; positions rec; //int ack[1] = {990}; void setup() { Serial.begin(57600); radio.begin(); delay(100); radio.setAutoAck(true); radio.enableAckPayload(); radio.enableDynamicPayloads(); radio.openReadingPipe(1,pipe[0]); radio.startListening(); radio.setRetries(15,15); } void loop() { //Serial.println(radio.available()); //radio.writeAckPayload(1,ack,sizeof(ack)); if(radio.available()) { //Serial.println(radio.available()); //radio.writeAckPayload(1,ack,sizeof(ack)); if(radio.available()) { radio.read(&rec,sizeof(rec)); radio.writeAckPayload(1,&rec,sizeof(rec)); //Serial.print("integer got is : "); //Serial.println(String(rec.x) + " + " + String( rec.y) ); Serial.print(rec.x); Serial.print(' '); Serial.println(rec.y); } else {Serial.println("failed to receive the message");} } }

[ "noreply@github.com" ]

noreply@github.com

54ee678e9b17d4f13dffddcf6d5ea5819cb4dc9d

cf0510d88d177fc8e223e545fd9213d6f7305d43

/mainwindow.hpp

9d9cf654354b42dda9602358492f356824e1562f

[]

no_license

knvmbox/phonebook

c3bf838e5aee865a1c777ed56b537b587986bda6

072421ac71d70f3e539675a6cd44a925703720b1

refs/heads/master

2021-05-13T22:03:19.517641

2018-01-06T20:52:36

116,267,045

0

null

UTF-8

C++

false

1,039

hpp

#ifndef MAINWINDOW_HPP #define MAINWINDOW_HPP #include <memory> #include <QMainWindow> #include <QSystemTrayIcon> #include "applicationmodel.hpp" namespace Ui { class MainWindow; } class MainWindow : public QMainWindow { Q_OBJECT public: explicit MainWindow(QWidget *parent = 0); ~MainWindow(); protected: void keyPressEvent(QKeyEvent*) override; void keyReleaseEvent(QKeyEvent*) override; void mouseMoveEvent(QMouseEvent*) override; void mousePressEvent(QMouseEvent*) override; private slots: void importData(); void showAbout(); private: bool isAltKeyPress(QKeyEvent *event); void lastnameEdited(const QString&); void phoneEdited(const QString&); void processAltKeyPress(); void processEscKeyPress(); void setupTrayIcon(); void trayActivated(QSystemTrayIcon::ActivationReason); private: Ui::MainWindow *ui; QSystemTrayIcon *m_tray; QPoint m_position; bool m_showMenu; std::shared_ptr<ApplicationModel> m_model; }; #endif // MAINWINDOW_HPP

[ "knvmbox@rambler.ru" ]

knvmbox@rambler.ru

842ab447323cd1a8a2b9efdb1a7ce31450360361

28317876a31186a573aec54455343dccf64c2133

/test/filesystem_mock.hpp

9d24d3cdf5bc1eaeca3c6044d5f21005565b0339

[ "Apache-2.0" ]

permissive

serve-bh-bmc/phosphor-hwmon

7eb9a4ca9deaa9eac15594220154320d8d2779c9

94555352240ba7ac577a7017c0719cd9bbeb7a23

refs/heads/master

2023-06-22T19:48:57.401413

2020-11-16T20:57:50

2020-11-16T21:33:42

330,386,005

0

1

Apache-2.0

2021-01-19T06:05:40

2021-01-17T12:29:10

C++

UTF-8

C++

false

319

hpp

#pragma once #include "hwmonio.hpp" #include <string> #include <gmock/gmock.h> namespace hwmonio { class FileSystemMock : public FileSystemInterface { public: MOCK_CONST_METHOD1(read, int64_t(const std::string&)); MOCK_CONST_METHOD2(write, void(const std::string&, uint32_t)); }; } // namespace hwmonio

[ "venture@google.com" ]

venture@google.com

4d3be93b4fbff8dd93b9159c99bf329be9f1581e

d1e1f4697b047161367277efcad6719843cc0aef

/twopage/App.xaml.h

be276781dbf7b55b9f352c84a26fa7b9e677b196

[]

no_license

bigOconstant/twopage

8b42ac2640825b8efd75a0156019ff7b2fe37211

e5118d08be129c9dfd0649e066c61f20038ca4c2

refs/heads/master

2022-03-05T16:36:48.816880

2019-08-21T13:27:34

null

0

null

UTF-8

C++

false

622

h

// // App.xaml.h // Declaration of the App class. // #pragma once #include "App.g.h" namespace twopage { /// <summary> /// Provides application-specific behavior to supplement the default Application class. /// </summary> ref class App sealed { protected: virtual void OnLaunched(Windows::ApplicationModel::Activation::LaunchActivatedEventArgs^ e) override; internal: App(); private: void OnSuspending(Platform::Object^ sender, Windows::ApplicationModel::SuspendingEventArgs^ e); void OnNavigationFailed(Platform::Object ^sender, Windows::UI::Xaml::Navigation::NavigationFailedEventArgs ^e); }; }

[ "camccar@g.clemson.edu" ]

camccar@g.clemson.edu

9eb2972cc166b1d01c11fe5d267d9c3101aee395

fcb277597059ba26f0b5e7af970ded67b9bdf8af

/src/TransitionManager.cpp

004108522f600abbe31da3ded2494a3a72a830f6

[]

no_license

duffyco/embedded-art-engine

18116e575397e04c42a49ec2ac143c7437138daf

ea8acdfa00e50180f67cef282e8cdcb39efc3e84

refs/heads/master

2020-09-22T14:39:51.893383

2019-12-02T02:25:45

225,242,890

0

null

UTF-8

C++

false

4,215

cpp

#include "TransitionManager.h" #include <cmath> #include <utility> #include "VignetteLayer.h" TransitionManager* TransitionManager::m_instance = NULL; TransitionManager* TransitionManager::getTransitionManager() { if( m_instance == NULL ) m_instance = new TransitionManager(); return m_instance; } TransitionManager::TransitionManager() : m_debug( TRANSITION_MANAGER_FILENAME ) { m_workerThread = NULL; } TransitionManager::~TransitionManager() { if( m_layers.size() > 0 ) { for( vector<Layer*>::iterator it = m_layers.begin(); it != m_layers.end(); ++it ) delete *it; } if( m_instance != NULL ) { delete m_instance; m_instance = NULL; } if( m_workerThread != NULL ) { delete m_workerThread; m_workerThread = NULL; } } void TransitionManager::start() { m_workerThread = new boost::thread( &TransitionManager::run, this ); for( vector<DataSource*>::iterator it = m_sources.begin(); it != m_sources.end(); ++it ) (*it)->start(); } void TransitionManager::whiteWash( bool disabled ) { vector<Layer*> layers = m_instance->getLayers(); for( vector<Layer*>::iterator it = layers.begin(); it != layers.end(); ++it ) { VignetteLayer* vl = dynamic_cast<VignetteLayer*>( *it ); if( vl != 0 ) { vl->turnOff(); vl->setDisabled( disabled ); } } } void TransitionManager::emergencyMode() { vector<SensorPair> sensorObservers = m_observers.at( m_emergencySensor ); for( vector<SensorPair>::iterator it = sensorObservers.begin(); it != sensorObservers.end(); ++it ) ( (Layer*) it->second )->turnOn(); } void TransitionManager::run() { while( true ) { try { ThreadSleep( 1000 ); for( std::vector<DataSource*>::iterator allSensorsIT = m_sources.begin(); allSensorsIT != m_sources.end(); ++allSensorsIT) { vector< vector<int> > sensors = (*allSensorsIT)->getNewData(); if( ( *allSensorsIT )->errorState() ) { emergencyMode(); continue; } if( sensors.size() == 0 ) continue; // For Each Physical Sensor int i=0; for( vector< vector<int> >::iterator aSensorIT = sensors.begin(); aSensorIT != sensors.end(); ++aSensorIT) { vector<int> sensorData = *aSensorIT; vector<SensorPair> sensorObservers; try { sensorObservers = m_observers.at( i ); } catch( out_of_range oor ) { i++; continue; } double stdDeviation = 0; double avg = 0; std::ostringstream os; os << "Data [" << sensorData.size() << "]: "; // For Each Piece of Sensor Data for( vector<int>::iterator sensorDataIT = sensorData.begin(); sensorDataIT != sensorData.end(); ++sensorDataIT ) { os << *sensorDataIT << ", "; stdDeviation += pow( *sensorDataIT, 2.0 ); avg += *sensorDataIT; } m_debug.print( os.str() ); if( sensorData.size() == 0 ) continue; avg = avg / sensorData.size(); stdDeviation = sqrt( (double) stdDeviation / sensorData.size() ); SensorPosition activeData = (SensorPosition)( (int)floor(avg) ); os.clear(); os << "\nSensor: " << i << " : Average [" << avg << "] StdDev ["<< stdDeviation << "] Active Data [" << activeData << "]"; m_debug.print( os.str() ); // Go through Observers for that Sensor for( vector<SensorPair>::iterator sensorPairIT = sensorObservers.begin(); sensorPairIT != sensorObservers.end(); ++sensorPairIT ) { SensorPair sPair = *sensorPairIT; if( sPair.first != activeData ) ( (Layer*) sPair.second)->turnOff(); else ( (Layer*) sPair.second)->turnOn(); } i++; } } } catch( ... ) { m_debug.exception( "Unknown Exception in Main Loop" ); } } } void TransitionManager::registerLayer( Layer* layer, int sensorID, SensorPosition pos ) { m_layers.push_back( layer ); SensorPair newObserver( pos, layer); try { vector<SensorPair>& region = m_observers.at( sensorID ); region.push_back( newObserver ); } catch( std::out_of_range ex ) { vector<SensorPair> region; region.push_back( newObserver ); m_observers.push_back( region ); } }

[ "john@duffy.dev" ]

john@duffy.dev

19fd84dfcceb8c9b975eb5739e35dd453c215b20

e0752d39bbbfa809995ebc0d9738115946cdb9c9

/MusicBox1/Project_Headers/ftfl.h

661b9b2a5d3ac68c275d69d9a69aec5e35e5ad85

[]

no_license

Raeed93/example2

dddfc10f35734e9ba1f168fcea31a8d4fd4b2dde

2391473a2e5c490ade39f6d63401acd395e7a04d

refs/heads/main

2023-02-24T16:36:10.091303

2021-01-22T06:36:31

331,856,312

0

null

UTF-8

C++

false

18,209

h

/** * @file ftfl.h (180.ARM_Peripherals/Project_Headers/ftfl.h) * @brief Flash support for FTFL * * Created on: 21 Sep 2016 * Author: podonoghue */ /* ************************************************************* * NOTE - Can't use other objects here as initialisation of * Flash is done very early (including writeln()) ************************************************************* */ #ifndef SOURCES_FLASH_H_ #define SOURCES_FLASH_H_ #include "derivative.h" #include "hardware.h" #include "delay.h" #include "smc.h" namespace USBDM { /** * @addtogroup FTFL_Group FTFL, Flash Memory Module * @brief Abstraction for Flash Memory Module * @{ */ // Error codes enum FlashDriverError_t { FLASH_ERR_OK = (0), FLASH_ERR_LOCKED = (1), // Flash is still locked FLASH_ERR_ILLEGAL_PARAMS = (2), // Parameters illegal FLASH_ERR_PROG_FAILED = (3), // STM - Programming operation failed - general FLASH_ERR_PROG_WPROT = (4), // STM - Programming operation failed - write protected FLASH_ERR_VERIFY_FAILED = (5), // Verify failed FLASH_ERR_ERASE_FAILED = (6), // Erase or Blank Check failed FLASH_ERR_TRAP = (7), // Program trapped (illegal instruction/location etc.) FLASH_ERR_PROG_ACCERR = (8), // Kinetis/CFVx - Programming operation failed - ACCERR FLASH_ERR_PROG_FPVIOL = (9), // Kinetis/CFVx - Programming operation failed - FPVIOL FLASH_ERR_PROG_MGSTAT0 = (10), // Kinetis - Programming operation failed - MGSTAT0 FLASH_ERR_CLKDIV = (11), // CFVx - Clock divider not set FLASH_ERR_ILLEGAL_SECURITY = (12), // Kinetis/CFV1+ - Illegal value for security location FLASH_ERR_UNKNOWN = (13), // Unspecified error FLASH_ERR_PROG_RDCOLERR = (14), // Read Collision FLASH_ERR_NEW_EEPROM = (15), // Indicates EEPROM has just bee partitioned and need initialisation FLASH_ERR_NOT_AVAILABLE = (16), // Attempt to do flash operation when not available (e.g. while in VLPR mode) }; /** * Class representing Flash interface. */ class Flash : public FtflInfo { public: // Sector size for program flash (minimum erase element) static constexpr unsigned programFlashSectorSize = 1024; // Phrase size for program flash (minimum programming element) static constexpr unsigned programFlashPhraseSize = 4; // Sector size for data flash (minimum erase element) static constexpr unsigned dataFlashSectorSize = 1024; // Phrase size for data flash (minimum programming element) static constexpr unsigned dataFlashPhraseSize = 4; /** A23 == 0 => indicates PROGRAM flash */ static constexpr uint32_t PROGRAM_ADDRESS_FLAG = (0<<23); /** A23 == 1 => indicates DATA flash */ static constexpr uint32_t DATA_ADDRESS_FLAG = (1<<23); protected: /** Minimum ratio for EEPROM to Flash backing storage */ static constexpr unsigned MINIMUM_BACKING_RATIO = 16; /** * Constructor. * Typically this method would be overridden in a derived class * to do the initialisation of the flash and non-volatile variables. * Alternatively, the startup code may call the static methods directly. */ Flash() { static int singletonFlag __attribute__((unused)) = false; usbdm_assert (!singletonFlag, "Creating multiple instances of Flash"); singletonFlag = true; waitForFlashReady(); } /** * Launch & wait for Flash command to complete. */ static void executeFlashCommand_asm(); /** * Launch & wait for Flash command to complete. */ static FlashDriverError_t executeFlashCommand(); /** * Read Flash Resource (IFR etc). * This command reads 4 bytes from the selected flash resource * * @param[in] resourceSelectCode 00 => IFR, 01 => Version ID * @param[in] address Address in IFR etc, A23=0 => Program flash, A23=1 => Data flash * @param[out] data Buffer for data returned * * @return Error code, 0 => no error */ static FlashDriverError_t readFlashResource(uint8_t resourceSelectCode, uint32_t address, uint8_t *data); /** * Program EEPROM Data Size Code and FlexNVM Partition Code. * * See device reference manual for the meaning of the following parameters * * @param[in] eeprom EEPROM Data Size value * @param[in] partition FlexNVM Partition value * * @return Error code, 0 => no error */ static FlashDriverError_t partitionFlash(uint8_t eeprom, uint8_t partition); /** * Initialise the EEPROM. * * This function should be called before the first access to variables located in the eeprom. * * @tparam eeprom EEPROM Data Size choice * @tparam partition FlexNVM Partition choice (defaults to all EEPROM backing store) * @tparam split Split between A/B Flash portions (if supported by target) * * @return FLASH_ERR_OK => EEPROM previous configured - no action required * @return FLASH_ERR_NEW_EEPROM => EEPROM has just been partitioned - contents are 0xFF, initialisation required * * @note This routine will only partition EEPROM when first executed after the device has been programmed. */ template<EepromSel eeprom=eepromSel, PartitionSel partition=partitionSel, SplitSel split=partitionSplit> static FlashDriverError_t initialiseEeprom () { // console. // write("initialiseEeprom(eeprom=").write(eepromSizes[eeprom].size).write(" bytes, "). // write("eeprom backing=").write(eepromSizes[eeprom].size).write("K, "). // write("residual flash=").write(partitionInformation[partition].eeepromSize>>10).writeln("K)"); if (isFlexRamConfigured()) { // console.write("flashController().FCNFG.FTFL_FCNFG_EEERDY = ").writeln((bool)(flashController().FCNFG&FTFL_FCNFG_EEERDY_MASK)); // console.writeln("Flex RAM is already configured"); return FLASH_ERR_OK; } // console.write("flashController().FCNFG.FTFL_FCNFG_EEERDY = ").writeln((bool)(flashController().FCNFG&FTFL_FCNFG_EEERDY_MASK)); if ((eepromSizes[eeprom].size*MINIMUM_BACKING_RATIO)>(partitionInformation[partition].eeepromSize)) { // console.writeln("Backing ratio (Flash/EEPROM) is too small\n"); USBDM::setErrorCode(E_FLASH_INIT_FAILED); return FLASH_ERR_ILLEGAL_PARAMS; } #if defined(RELEASE_BUILD) // EEPROM only available in release build FlashDriverError_t rc = partitionFlash(eepromSizes[eeprom].value|split, partitionInformation[partition].value); if (rc != 0) { // console.writeln("Partitioning Flash failed\n"); return rc; } // Indicate EEPROM needs initialisation - this is not an error return FLASH_ERR_NEW_EEPROM; #else (void) eeprom; (void) partition; (void) split; // For debug, initialise FlexRam every time (no actual writes to flash) // Initialisation pretend EEPROM on every reset // This return code is not an error return FLASH_ERR_NEW_EEPROM; #endif } public: /** * Hardware instance pointer * * @return Reference to Flash hardware */ __attribute__((always_inline)) static volatile FTFL_Type &flashController() { return ftfl(); } /** * Checks if the flexRAM has been configured. * Will wait for flash ready as necessary * * @return true if configured */ static bool isFlexRamConfigured() { #if 1 return waitForFlashReady() && (flashController().FCNFG&FTFL_FCNFG_EEERDY_MASK); #else console.write("flashController().FCNFG = ").writeln(flashController().FCNFG, Radix_16); console.write("flashController().FCNFG.FTFL_FCNFG_RAMRDY = ").writeln((bool)(flashController().FCNFG&FTFL_FCNFG_RAMRDY_MASK)); console.write("flashController().FCNFG.FTFL_FCNFG_EEERDY = ").writeln((bool)(flashController().FCNFG&FTFL_FCNFG_EEERDY_MASK)); uint8_t result[4]; FlashDriverError_t rc = readFlashResource(0, DATA_ADDRESS_FLAG|0xFC, result); if (rc != 0) { console.write("IFR read failed, rc=").writeln(rc); return false; } uint8_t flexNvmPartitionSize = result[0]; uint8_t eepromDatSetSize = result[1]; console.write("FlexNVM partition code = ").writeln(flexNvmPartitionSize, Radix_16); console.write("EEPROM data set size = ").writeln(eepromDatSetSize, Radix_16); return (flashController().FCNFG&FTFL_FCNFG_EEERDY_MASK); #endif } /** * Wait until flash is ready. * Any flash operations will have completed. * * @return true => OK, false => timeout */ static bool waitForFlashReady() { for(int timeout=0; timeout<100000; timeout++) { if ((flashController().FSTAT&FTFL_FSTAT_CCIF_MASK) != 0) { return true; } } return false; } /** * Check if flash operations are available. * This will check if the processor is in the correct mode for flash operations. * * @return true => OK * @return false => Processor not in correct mode */ static bool isFlashAvailable() { return (Smc::getStatus() == SmcStatus_RUN); } /** * Waits until the current flash operation is complete with run mode check. * This is used to wait until a FlexRAM write has completed. * * @return true => Operation complete and FlexRAM idle * @return false => timeout or flash not available */ static bool waitUntilFlexIdle() { usbdm_assert(isFlashAvailable(), "Flash use in unsuitable run mode"); return isFlashAvailable() && waitForFlashReady(); } /** * Enable interrupts in NVIC */ static void enableNvicInterrupts() { NVIC_EnableIRQ(irqNums[0]); } /** * Enable and set priority of interrupts in NVIC * Any pending NVIC interrupts are first cleared. * * @param[in] nvicPriority Interrupt priority */ static void enableNvicInterrupts(uint32_t nvicPriority) { enableNvicInterrupt(irqNums[0], nvicPriority); } /** * Disable interrupts in NVIC */ static void disableNvicInterrupts() { NVIC_DisableIRQ(irqNums[0]); } /** * Enable interrupts in NVIC * Any pending NVIC interrupts are first cleared. */ static void enableNvicCollisionInterrupts() { NVIC_EnableIRQ(irqNums[1]); } /** * Enable and set priority of interrupts in NVIC * Any pending NVIC interrupts are first cleared. * * @param[in] nvicPriority Interrupt priority */ static void enableNvicCollisionInterrupts(uint32_t nvicPriority) { enableNvicInterrupt(irqNums[1], nvicPriority); } /** * Disable interrupts in NVIC */ static void disableNvicCollisionInterrupts() { NVIC_DisableIRQ(irqNums[1]); } private: /** * Program a phrase to Flash memory. * * @param[in] data Location of data to program * @param[out] address Memory address to program - must be phrase boundary * * @return Error code */ static FlashDriverError_t programPhrase(const uint8_t *data, uint8_t *address); /** * Erase sector of Flash memory. * * @param[in] address Memory address to erase - must be sector boundary * * @return Error code */ static FlashDriverError_t eraseSector(uint8_t *address); public: /** * Program a range of bytes to Flash memory. * * @param[in] data Location of data to program * @param[out] address Memory address to program - must be phrase boundary * @param[in] size Size of range (in bytes) to program - must be multiple of phrase size * * @return Error code */ static FlashDriverError_t programRange(const uint8_t *data, uint8_t *address, uint32_t size); /** * Erase a range of Flash memory. * * @param[in] address Memory address to start erasing - must be sector boundary * @param[in] size Size of range (in bytes) to erase - must be multiple of sector size * * @return Error code */ static FlashDriverError_t eraseRange(uint8_t *address, uint32_t size); /** * Mass erase entire Flash memory. */ static void eraseAll(); }; /** * Class to wrap a scalar variable allocated within the FlexRam area. * Size is limited to 1, 2 or 4 bytes. * * Writing to the variable triggers an EEPROM update.\n * Ensures updates are completed before return. * * @tparam T Scalar type for variable * * @note Instances should be placed in FlexRAM segment e.g.\n * @code * __attribute__ ((section(".flexRAM"))) * USBDM::Nonvolatile<char> a_nonvolatile_char; * @endcode */ template <typename T> class Nonvolatile { static_assert((sizeof(T) == 1)||(sizeof(T) == 2)||(sizeof(T) == 4), "Size of non-volatile object must be 1, 2 or 4 bytes in size"); private: /** * Data value in FlexRAM. * * FlexRAM required data to be aligned according to its size.\n * Be careful how you order variables otherwise space will be wasted */ __attribute__ ((aligned (sizeof(T)))) T data; public: /** * Assign to underlying type. * This adds a wait for the Flash to be updated * * @param[in] data The data to assign */ void operator=(const Nonvolatile<T> &data ) { this->data = (T)data; Flash::waitUntilFlexIdle(); } /** * Assign to underlying type. * This adds a wait for the Flash to be updated * * @param[in] data The data to assign */ void operator=(const T &data ) { this->data = data; Flash::waitUntilFlexIdle(); } /** * Increment underlying type. * This adds a wait for the Flash to be updated * * @param[in] change The amount to increment */ void operator+=(const Nonvolatile<T> &change ) { this->data += (T)change; Flash::waitUntilFlexIdle(); } /** * Increment underlying type. * This adds a wait for the Flash to be updated * * @param[in] change The amount to increment */ void operator+=(const T &change ) { this->data += change; Flash::waitUntilFlexIdle(); } /** * Decrement underlying type. * This adds a wait for the Flash to be updated * * @param[in] change The amount to increment */ void operator-=(const Nonvolatile<T> &change ) { this->data -= (T)change; Flash::waitUntilFlexIdle(); } /** * Decrement underlying type. * This adds a wait for the Flash to be updated * * @param[in] change The amount to increment */ void operator-=(const T &change ) { this->data -= change; Flash::waitUntilFlexIdle(); } /** * Return the underlying object - <b>read-only</b>. * * @return underlying object */ operator T() const { Flash::waitUntilFlexIdle(); return data; } }; /** * Class to wrap an array of scalar variables allocated to the FlexRam area. * * Element size is limited to 1, 2 or 4 bytes. * * Writing to an element triggers an EEPROM update.\n * Ensures updates are completed before return. * * @tparam T Scalar type for element * @tparam dimension Dimension of array * * @note Instances should be placed in FlexRAM segment e.g.\n * @code * __attribute__ ((section(".flexRAM"))) * USBDM::NonvolatileArray<20, int> a_nonvolatile_array_of_ints; * @endcode */ template <typename T, int dimension> class NonvolatileArray { static_assert((sizeof(T) == 1)||(sizeof(T) == 2)||(sizeof(T) == 4), "T must be 1, 2 or 4 bytes in size"); private: using TArray = T[dimension]; using TPtr = const T(*); /** Array of elements in FlexRAM. * * FlexRAM required data to be aligned according to its size.\n * Be careful how you order variables otherwise space will be wasted */ __attribute__ ((aligned (sizeof(T)))) T data[dimension]; public: /** * Assign to underlying array. * * @param[in] other TArray to assign from * * This adds a wait for the Flash to be updated after each element is assigned */ void operator=(const TArray &other ) { for (int index=0; index<dimension; index++) { data[index] = other[index]; Flash::waitUntilFlexIdle(); } } /** * Assign to underlying array. * * @param[in] other NonvolatileArray to assign from * * This adds a wait for the Flash to be updated after each element is assigned */ void operator=(const NonvolatileArray &other ) { if (this == &other) { // Identity check return; } for (int index=0; index<dimension; index++) { data[index] = other[index]; Flash::waitUntilFlexIdle(); } } /** * Assign to underlying array. * * @param[in] other NonvolatileArray to assign to * * This adds a wait for the Flash to be updated after each element is assigned */ void copyTo(T *other) const { for (int index=0; index<dimension; index++) { other[index] = data[index]; } } /** * Return a reference to the underlying array element - read-only. * * @param[in] index Index of element to return * * @return Reference to underlying array */ const T operator [](int index) { return data[index]; } /** * Return a pointer to the underlying array - read-only. */ operator TPtr() const { return data; } /** * Set an element of the array to the value provided. * * @param[in] index Array index of element to change * @param[in] value Value to initialise array elements to */ void set(int index, T value) { data[index] = value; Flash::waitUntilFlexIdle(); } /** * Set all elements of the array to the value provided. * * @param[in] value Value to initialise array elements to */ void set(T value) { for (int index=0; index<dimension; index++) { data[index] = value; Flash::waitUntilFlexIdle(); } } }; /** * @} */ } // namespace USBDM #endif /* SOURCES_FLASH_H_ */

[ "youngbreezy93@hotmail.com" ]

youngbreezy93@hotmail.com

4f183f7bdfd70275e90c41fdb72a5a67ece2a7d1

430df5841efa568dd58a1091f15bad6f7b138c19

/chap14_sorting/compute_intersection_of_two_sorted_arrays.cpp

554edc9f8c9895beee8f7e1d108afad903b7cc54

[ "MIT" ]

permissive

clebsonc/epi_book

3970b42313331991f529fb74e600390f868ef86b

5c33db4bdbd5aca49668609e12151d56793ba1c9

refs/heads/master

2020-06-13T07:12:23.988506

2017-05-10T16:15:56

75,414,492

0

null

UTF-8

C++

false

718

cpp

#include <iostream> #include <vector> #include <unordered_set> std::unordered_set<int> find_intersection (std::vector<int> v1, std::vector<int> v2){ std::unordered_set<int> uns; while (!v1.empty() && !v2.empty()){ if (v1.back() == v2.back()){ uns.emplace(v1.back()); v1.pop_back(); v2.pop_back(); } else if (v1.back() > v2.back()) v1.pop_back(); else v2.pop_back(); } return uns; } int main(){ std::vector<int> v1 = {2, 3, 3, 5, 5, 6, 7, 7, 8, 12}; std::vector<int> v2 = {5, 5, 6, 8, 8, 9, 10, 10}; std::unordered_set<int> set = find_intersection(v1, v2); for (const auto & v : set) std::cout << v << " "; std::cout << std::endl; return 0; }

[ "clebsondm@gmail.com" ]

clebsondm@gmail.com

7d667fd7c813b09b11fa39f6f6a2f418e3c5bd7f

944c3cd764e0900b8cd798481d4663cdb32a4dae

/Game.cpp

e30aa4e5b238e23cb1901c8e369f9d56b5ea3b9b

[]

no_license

BIGbadEL/Engine_GL

40d37dbcaf53039149b720173ad38e1494b77f17

e109afcd9bf11c068045451f80ff7ac8d898b8ac

refs/heads/master

2020-04-01T13:55:41.027901

2018-10-16T18:54:30

153,273,160

0

null

UTF-8

C++

false

548

cpp

// // Created by grzegorz on 21.09.18. // #include "src/engine_gl.h" using namespace engine; using namespace graphics; using namespace maths; class Game : public EngineGL { private: Window *window; public: Game(){ } ~Game(){ } void init() override { window = createWindow("TEST GAME", 960, 540); } void tick() override{ } void update() override{ } void render() override { } }; int main(int argc, char const *argv[]) { Game game; game.start(); return 0; }

[ "greg090912@gmail.com" ]

greg090912@gmail.com

c0ac4b217fc5ec10e62dc7537dd9dfbfaa225efb

8ec9b2810a1bc4f28bc08b6df6d7e13be0e37509

/Lab1/Lab1/Includes/GaussianBlurFilter.h

5d64a273fd7da3aaf8e6483b475a0d51aa0f4906

[]

no_license

a-sidorova/computer_graphics_course

085dd8d97200a0ae977ffedefc310f43d13f426a

483644c2143f65c60ec89686d4ae75d223044319

refs/heads/master

2022-09-05T12:27:55.291618

2020-05-25T08:07:22

null

0

null

UTF-8

C++

false

246

h

#ifndef _GAUSSIANBLURFILTER_H_ #define _GAUSSIANBLURFILTER_H_ #include "MatrixFilter.h" class GaussianBlurFilter : public MatrixFilter { public: GaussianBlurFilter(); ~GaussianBlurFilter() {}; void createGaussianKernel(int, int); }; #endif

[ "alexa-sanechka@ya.ru" ]

alexa-sanechka@ya.ru

bfba3aec85d7e520dd6f51da96d9bbb89dd80efc

c637ed2e8987ef71a58b85a05f15b41678f3eed1

/src/askpassworddialog.h

d9cb232c6c47619a75fd74dc6a5b13aba4984e0c

[ "MIT" ]

permissive

Zurocoin/zurocoin-gui

dbd5a38783c4ef3bf7c247ea5c7d32767fcece72

f9b1e2d2af9e2b332ce5ce244095e5a1fdfcafc8

refs/heads/main

2023-04-02T23:02:10.553046

2021-03-25T10:19:41

349,803,314

0

null

UTF-8

C++

false

764

h

// Copyright (c) 2015-2018, The Bytecoin developers, The Zurocoin developers. // Licensed under the GNU Lesser General Public License. See LICENSE for details. #ifndef ASKPASSWORDDIALOG_H #define ASKPASSWORDDIALOG_H #include <QDialog> namespace Ui { class AskPasswordDialog; } namespace WalletGUI { class AskPasswordDialog : public QDialog { Q_OBJECT public: explicit AskPasswordDialog(bool askUserName, QWidget *parent = 0); ~AskPasswordDialog(); QString getPassword() const; QString getUser() const; private slots: void passwordChanged(const QString& password); void userChanged(const QString& password); private: Ui::AskPasswordDialog *ui; QString password_; QString user_; }; } #endif // ASKPASSWORDDIALOG_H

[ "noreply@github.com" ]

noreply@github.com

5869d403a673f6273eb11eeb5f0f9ad59d291415

d836c18f79efefecbf38e4c221d54aae2e7e79ec

/src/zjdc/zjdctracker.h

3c3896ffce56d4127e05da844414c1e9aea5a479

[]

no_license

xgy1221/jdcoin

329c410489c31a55ff95b38e7e643dd5869ed947

ac351c1120750712679b7893446a8f517730a658

refs/heads/main

2023-03-11T14:57:09.740625

2021-03-02T18:45:38

null

0

null

UTF-8

C++

false

2,283

h

// Copyright (c) 2018-2020 The JDCOIN developers // Distributed under the MIT software license, see the accompanying // file COPYING or http://www.opensource.org/licenses/mit-license.php. #ifndef JDCOIN_ZJDCTRACKER_H #define JDCOIN_ZJDCTRACKER_H #include "zerocoin.h" #include "sync.h" #include <list> class CDeterministicMint; class CzJDCWallet; class CWallet; class CzJDCTracker { private: bool fInitialized; /* Parent wallet */ CWallet* wallet{nullptr}; std::map<uint256, CMintMeta> mapSerialHashes; std::map<uint256, uint256> mapPendingSpends; //serialhash, txid of spend bool UpdateStatusInternal(const std::set<uint256>& setMempool, CMintMeta& mint); public: CzJDCTracker(CWallet* parent); ~CzJDCTracker(); void Add(const CDeterministicMint& dMint, bool isNew = false, bool isArchived = false, CzJDCWallet* zJDCWallet = NULL); void Add(const CZerocoinMint& mint, bool isNew = false, bool isArchived = false); bool Archive(CMintMeta& meta); bool HasPubcoin(const CBigNum& bnValue) const; bool HasPubcoinHash(const uint256& hashPubcoin) const; bool HasSerial(const CBigNum& bnSerial) const; bool HasSerialHash(const uint256& hashSerial) const; bool HasMintTx(const uint256& txid); bool IsEmpty() const { return mapSerialHashes.empty(); } void Init(); CMintMeta Get(const uint256& hashSerial); CMintMeta GetMetaFromPubcoin(const uint256& hashPubcoin); bool GetMetaFromStakeHash(const uint256& hashStake, CMintMeta& meta) const; CAmount GetBalance(bool fConfirmedOnly, bool fUnconfirmedOnly) const; std::vector<uint256> GetSerialHashes(); std::vector<CMintMeta> GetMints(bool fConfirmedOnly) const; CAmount GetUnconfirmedBalance() const; std::set<CMintMeta> ListMints(bool fUnusedOnly, bool fMatureOnly, bool fUpdateStatus, bool fWrongSeed = false, bool fExcludeV1 = false); void RemovePending(const uint256& txid); void SetPubcoinUsed(const uint256& hashPubcoin, const uint256& txid); void SetPubcoinNotUsed(const uint256& hashPubcoin); bool UnArchive(const uint256& hashPubcoin, bool isDeterministic); bool UpdateZerocoinMint(const CZerocoinMint& mint); bool UpdateState(const CMintMeta& meta); void Clear(); }; #endif //JDCOIN_ZJDCTRACKER_H

[ "developer@jdcoin.us" ]

developer@jdcoin.us

9617e17e3aa30a4206e20c796d20ba4f9847d3f7

e01d541554b2541e280a2581c31f3c8904a5b923

/nt4/private/sdktools/jetadmin/cola.sdk/hprrm/strncase.hpp

78eb6f0ec6308ae6d534969adde7fafdba5f5fe6

[]

no_license

tmplazy/NT_4.0_SourceCode

b9a6a65fa3ca3e008b0277c7f5884aa7b3c57b9f

e293359a21b004f6840ec66c0a7ad1077a80f22b

refs/heads/master

2021-07-22T13:57:15.412794

2017-10-31T10:48:43

2017-10-31T10:50:50

105,346,067

1

0

null

2017-09-30T06:03:46

2017-09-30T06:03:45

null

UTF-8

C++

false

950

hpp

/*************************************************************************** * * File Name: ./hprrm/strncase.hpp * * Copyright (C) 1993-1996 Hewlett-Packard Company. * All rights reserved. * * 11311 Chinden Blvd. * Boise, Idaho 83714 * * This is a part of the HP JetAdmin Printer Utility * * This source code is only intended as a supplement for support and * localization of HP JetAdmin by 3rd party Operating System vendors. * Modification of source code cannot be made without the express written * consent of Hewlett-Packard. * * * Description: * * Author: Name * * * Modification history: * * date initials change description * * mm-dd-yy MJB * * * * * * ***************************************************************************/ int strncasecmp ( const char *s1, const char *s2, size_t n);

[ "gasgas4@gmail.com" ]

gasgas4@gmail.com

ed63ea2359fa3700afbf1439cedb817a7fa206c0

df7c701e34b2e3c6150e8128c8bf2b0f70648b50

/SoftwareDesign/C++/DesignPatterns/Observer.cpp

745b1e4b1d1eaff011c2159569fe643e9f48d2e5

[]

no_license

KraiZeur/Examples

2668710c115f8585fd1dc90d2fa914fc2b847933

30374291e5a3993189eb310e52b84f7ae5d51eeb

refs/heads/master

2020-12-03T09:13:00.087710

2020-01-26T23:08:52

68,735,227

0

null

UTF-8

C++

false

1,133

cpp

#include <iostream> #include <vector> template <typename T> class Observer { private: public: virtual void observableChanged(T * ptr)=0; }; template <typename T> class Observable { protected: std::vector<Observer<T> *> _observers; public: void addObserver(Observer<T> * observer) { _observers.push_back(observer); } virtual void notifyObservers(T * observable) { typename std::vector<Observer<T> *>::const_iterator it; for(it=_observers.begin(); it!=_observers.end(); it++) { (*it)->observableChanged(observable); } } }; class Television : public Observable<Television> { private: int _channel; public: void setChannel(int channel) { _channel=channel; notifyObservers(this); } void printValue() { std::cout << "New TV Channel is : " << _channel << std::endl; } }; class TestObserver : public Observer<Television> { private: public: virtual void observableChanged(Television * tv) { tv->printValue(); } }; int main(int argc, char const *argv[]) { TestObserver * observer = new TestObserver(); Television * tv = new Television(); tv->addObserver(observer); tv->setChannel(17); return 0; }

[ "thomas.ritaly@gmail.com" ]

thomas.ritaly@gmail.com

c34e0167a01d546fa65ba302c7ce29386ba08e6d

600df3590cce1fe49b9a96e9ca5b5242884a2a70

/components/dom_distiller/content/browser/android/content_jni_registrar.h

469cb26ca18f3a3c225c070a0c8559dae557e5b6

[ "BSD-3-Clause" ]

permissive

metux/chromium-suckless

efd087ba4f4070a6caac5bfbfb0f7a4e2f3c438a

72a05af97787001756bae2511b7985e61498c965

refs/heads/orig

2022-12-04T23:53:58.681218

2017-04-30T10:59:06

2017-04-30T23:35:58

89,884,931

5

3

BSD-3-Clause

2022-11-23T20:52:53

2017-05-01T00:09:08

null

UTF-8

C++

false

697

h

// Copyright 2016 The Chromium Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #ifndef COMPONENTS_DOM_DISTILLER_CONTENT_BROWSER_ANDROID_CONTENT_JNI_REGISTRAR_H_ #define COMPONENTS_DOM_DISTILLER_CONTENT_BROWSER_ANDROID_CONTENT_JNI_REGISTRAR_H_ #include <jni.h> namespace dom_distiller { namespace content { namespace android { // Register all JNI bindings necessary for the dom_distiller component. bool RegisterDomDistiller(JNIEnv* env); } // namespace android } // namespace content } // namespace dom_distiller #endif // COMPONENTS_DOM_DISTILLER_CONTENT_BROWSER_ANDROID_CONTENT_JNI_REGISTRAR_H_

[ "enrico.weigelt@gr13.net" ]

enrico.weigelt@gr13.net

6546eaa87d45d40b77fc78deb0c9450d941cdd2c

f8bd13c44c9a653402337458f811534e30ec9e13

/working files/v_A_shm/BaseInPoint.cpp

43daea4fda4a4719f4d2d6e0836176e35ac0811c

[]

no_license

AdrianVlas/cs_pr_a3

76ba5c231b4e2155fc21ed1194845f7a29b13fbd

c0d621a012b391f14fee77249e3ff1f952e9539a

refs/heads/master

2023-08-28T23:26:13.650256

2021-09-24T09:29:20

86,058,910

1

0

null

UTF-8

C++

false

1,076

cpp

#ifdef VISUAL_STUDIO #include "StdAfx.h" #endif #include "BaseInPoint.h" short shOrdNumBaseInPoint = 0; BaseInPoint::BaseInPoint(void) { chMaxIteratoin = 0; chIteration = 0; chState = 0; chReqCalc = 0; shOrderNumber = 0; } //Copy constructor BaseInPoint::BaseInPoint(BaseInPoint&cl) { chMaxIteratoin = cl.chMaxIteratoin; chIteration = cl.chIteration ; chState = cl.chState ; chReqCalc = cl.chReqCalc ; shOrderNumber = ++shOrdNumBaseInPoint; } BaseInPoint::BaseInPoint(char chM = 0,char chI = 0,char chS = 0,char chR =0) { chMaxIteratoin = chM; chIteration = chI; chState = chS; chReqCalc = chR; shOrderNumber = ++shOrdNumBaseInPoint; } //Copy assignment BaseInPoint& BaseInPoint::operator= (const BaseInPoint&cl) { chMaxIteratoin = cl.chMaxIteratoin; chIteration = cl.chIteration ; chState = cl.chState ; chReqCalc = cl.chReqCalc ; shOrderNumber = ++shOrdNumBaseInPoint; return *this; } //Move constructor //Move assignment BaseInPoint::~BaseInPoint(void) { }

[ "vid25prtvcs@gmail.com" ]

vid25prtvcs@gmail.com

397bef116c0360a5ccafe2b4e63e19f8f8b50d30

8d5d1aa115959c24faeec6b1d7ae79c52605e7cf

/PE34/PE34/main.cpp

996d0d1f6f6c021c1216aa3b3da554e14cd1a802

[]

no_license

LeulShiferaw/ProjectEuler

eb159f3689c7dc1303a0368bd5fe1ba906965c03

e4065b816c2540671b3e7a49b11aa979746b09f3

refs/heads/master

2023-04-27T10:12:18.215687

2023-04-20T21:05:20

128,996,217

0

null

UTF-8

C++

false

426

cpp

#include <iostream> using namespace std; int factorial[10] = { 1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880 }; int sum_fac_dig(int n) { int res = 0; while (n != 0) { res += factorial[n % 10]; n /= 10; } return res; } int main() { long long res = 0; for (int i = 10; i < 100000000; ++i) { if (sum_fac_dig(i) == i) { res += i; cout << i << endl; } } cout << "Result: " << res << endl; return 0; }

[ "abiyleoul3@gmail.com" ]

abiyleoul3@gmail.com

545e499e5e463cff558ef3df2d64cb99fe01e8fb

62fe5e0acbeca0e24d3a2f480ef26a4521bdc0dd

/h25/h25.cpp

398f2c6da0dd2cd39eee3d83d89a1deb2d492280

[]

no_license

malaya7/CS150-intro-to-programming-Cpp

60de06c044f525e034cad210ab43669f47caa2ad

a8ab9c7c12f33f97422ed89bbc09a423f34957ab

refs/heads/master

2020-03-19T03:39:42.784784

2018-06-01T18:30:27

null

0

null

UTF-8

C++

false

566

cpp

/** @file h25.cpp @author your name here @version what day and meeting time */ #include <string> // Add additional headers here using namespace std; string STUDENT = "malaya"; // Add your name Blackboard/occ-email ID #include "h25.h" const char * findStr(const char *str1, const char *str2) { while(* str1 != '\0') { const char *p1 = str1; const char *p2 = str2; while(*p1 == * p2) { p1++; p2++; } if(*p2 == '\0') return str1; str1++; } return NULL; }

[ "noreply@github.com" ]

noreply@github.com

623bbba0dce4eb93ebc0396d2efd34b93c23562c

885e3829bba0529555a50894388625fca0c01922

/include/TaskManager/Worker.hpp

f18aca80cc59b8c51b12800b1ca19dbc0bce3e97

[]

no_license

DELTA37/WorkerPattern

9ca73fce408a37d3a3dc5d752628267ec05379dc

f507b21e856d90da54a0af218ecb4e3b1db0773f

refs/heads/master

2021-05-15T15:12:02.924193

2017-10-17T15:11:20

107,285,465

0

null

UTF-8

C++

false

848

hpp

#include <iostream> #include <mutex> #include <memory> #include <utility> #include <atomic> #include <deque> #include <vector> #include <pthread.h> #include "Task.hpp" class TaskManager { std::deque<std::unique_ptr<Task>> tasks; int max_workers; int num_workers; std::atomic<bool> running; std::mutex tasks_mutex; std::vector<pthread_t> workers; std::atomic<int> in_use; private: void WorkerBody(void); static void* WorkerBodyProxy(void*); public: TaskManager(void) : max_workers(4) {} TaskManager(int _max_workers) : max_workers(_max_workers) {} ~TaskManager(void) = default; TaskManager& operator=(TaskManager const &Q) = delete; TaskManager& operator=(TaskManager const &&Q) = delete; void addTask(std::unique_ptr<Task> task); bool ready(void); void start(void); void stop(void); void join(void); };

[ "delta37@delta37.delta37" ]

delta37@delta37.delta37

4cf423b507ef223e9214f116954a181192757581

06ca0f8e85a72be932d2addf311a18b30b02142a

/SFML/Game_DEV_SFML/SpriteNode.hpp

cd35b3b8d3dc6399c23aaf021acf55606bcfccf5

[]

no_license

MeMarcel/Learning

104405117ef1bc4b949022511e5d1d5641820024

acd53d68b4b96e9ff34d7a5641370c764e8dfcf4

refs/heads/master

2020-07-01T14:55:40.462040

2019-08-25T18:16:38

201,202,824

0

null

UTF-8

C++

false

372

hpp

#ifndef SPRITENODE_HPP #define SPRITENODE_HPP #include "SceneNode.hpp" class SpriteNode : public SceneNode{ public: SpriteNode(const sf::Texture& texture); SpriteNode(const sf::Texture& texture, const sf::IntRect& rect); private: virtual void drawCurrent(sf::RenderTarget& target, sf::RenderStates states) const; private: sf::Sprite mSprite; }; #endif

[ "marcelm-10a@hotmail.de" ]

marcelm-10a@hotmail.de

237a3ee18993f58d26871ada4cfaa030ee0b0314

78da006e0e78b3b22cb2b3998fa753471f003322

/GameEngine/RenderSystem.h

b865fbd8cbcef132208bab436e7b1f7f6403d524

[]

no_license

alexbanks-git/Tanks3D-ACW

3dc3fed0a6e736f5e37d7f50d3bbeee15d739721

6b17bf158e4f30a7541e7cd1d19306ffa9f3769d

refs/heads/master

2020-08-03T11:17:38.335934

2019-04-03T15:08:30

null

0

null

UTF-8

C++

false

680

h

#pragma once #include "System.h" #include "Renderer.h" #include <vector> class RenderComponent; // Moves objects around based on PhysicsComponents class RenderSystem : public System { // Data protected: Renderer * _renderer; // Structors public: RenderSystem(); virtual ~RenderSystem(); // Get / sets public: Renderer * GetRenderer() const { return _renderer; } void SetRenderer(Renderer* r) { _renderer = r; } // Functions public: virtual void Process(std::vector<GameObject*>& list, double deltaTime, const DirectX::XMMATRIX &viewMatrix, const DirectX::XMMATRIX &projectionMatrix); virtual void Process(std::vector<GameObject*>& list, double deltaTime) {} };

[ "arjunchauhan007@gmail.com" ]

arjunchauhan007@gmail.com

6de15de8ee5a67b276f5d52deab0c0b17e9fb266

af555a19cd2ffe3e775c33d32cebc2f96d27aa4b

/vendor/git.apache.org/thrift.git/lib/cpp/src/thrift/protocol/TDebugProtocol.cpp

d3c6bebf3a11e316b115156cff66c05c004bf005

[ "Apache-2.0", "MIT", "LicenseRef-scancode-public-domain-disclaimer", "FSFAP" ]

permissive

tokend/janus

674ead9a29f437b3c05c0879d5b7f7bd20abfe72

5acf3f0ee360b975605a8995493a64d8e4362159

refs/heads/master

2020-04-12T04:12:47.673825

2019-02-28T19:25:39

162,288,534

8

1

MIT

2019-02-28T19:25:40

2018-12-18T12:57:39

Go

UTF-8

C++

false

10,076

cpp

/* * Licensed to the Apache Software Foundation (ASF) under one * or more contributor license agreements. See the NOTICE file * distributed with this work for additional information * regarding copyright ownership. The ASF licenses this file * to you under the Apache License, Version 2.0 (the * "License"); you may not use this file except in compliance * with the License. You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, * software distributed under the License is distributed on an * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY * KIND, either express or implied. See the License for the * specific language governing permissions and limitations * under the License. */ #include <thrift/protocol/TDebugProtocol.h> #include <thrift/TToString.h> #include <cassert> #include <cctype> #include <cstdio> #include <stdexcept> #include <boost/static_assert.hpp> using std::string; static string byte_to_hex(const uint8_t byte) { char buf[3]; int ret = std::sprintf(buf, "%02x", (int)byte); THRIFT_UNUSED_VARIABLE(ret); assert(ret == 2); assert(buf[2] == '\0'); return buf; } namespace apache { namespace thrift { namespace protocol { string TDebugProtocol::fieldTypeName(TType type) { switch (type) { case T_STOP: return "stop"; case T_VOID: return "void"; case T_BOOL: return "bool"; case T_BYTE: return "byte"; case T_I16: return "i16"; case T_I32: return "i32"; case T_U64: return "u64"; case T_I64: return "i64"; case T_DOUBLE: return "double"; case T_STRING: return "string"; case T_STRUCT: return "struct"; case T_MAP: return "map"; case T_SET: return "set"; case T_LIST: return "list"; case T_UTF8: return "utf8"; case T_UTF16: return "utf16"; default: return "unknown"; } } void TDebugProtocol::indentUp() { indent_str_ += string(indent_inc, ' '); } void TDebugProtocol::indentDown() { if (indent_str_.length() < (string::size_type)indent_inc) { throw TProtocolException(TProtocolException::INVALID_DATA); } indent_str_.erase(indent_str_.length() - indent_inc); } uint32_t TDebugProtocol::writePlain(const string& str) { if (str.length() > (std::numeric_limits<uint32_t>::max)()) throw TProtocolException(TProtocolException::SIZE_LIMIT); trans_->write((uint8_t*)str.data(), static_cast<uint32_t>(str.length())); return static_cast<uint32_t>(str.length()); } uint32_t TDebugProtocol::writeIndented(const string& str) { if (str.length() > (std::numeric_limits<uint32_t>::max)()) throw TProtocolException(TProtocolException::SIZE_LIMIT); if (indent_str_.length() > (std::numeric_limits<uint32_t>::max)()) throw TProtocolException(TProtocolException::SIZE_LIMIT); uint64_t total_len = indent_str_.length() + str.length(); if (total_len > (std::numeric_limits<uint32_t>::max)()) throw TProtocolException(TProtocolException::SIZE_LIMIT); trans_->write((uint8_t*)indent_str_.data(), static_cast<uint32_t>(indent_str_.length())); trans_->write((uint8_t*)str.data(), static_cast<uint32_t>(str.length())); return static_cast<uint32_t>(indent_str_.length() + str.length()); } uint32_t TDebugProtocol::startItem() { uint32_t size; switch (write_state_.back()) { case UNINIT: // XXX figure out what to do here. // throw TProtocolException(TProtocolException::INVALID_DATA); // return writeIndented(str); return 0; case STRUCT: return 0; case SET: return writeIndented(""); case MAP_KEY: return writeIndented(""); case MAP_VALUE: return writePlain(" -> "); case LIST: size = writeIndented("[" + to_string(list_idx_.back()) + "] = "); list_idx_.back()++; return size; default: throw std::logic_error("Invalid enum value."); } } uint32_t TDebugProtocol::endItem() { // uint32_t size; switch (write_state_.back()) { case UNINIT: // XXX figure out what to do here. // throw TProtocolException(TProtocolException::INVALID_DATA); // return writeIndented(str); return 0; case STRUCT: return writePlain(",\n"); case SET: return writePlain(",\n"); case MAP_KEY: write_state_.back() = MAP_VALUE; return 0; case MAP_VALUE: write_state_.back() = MAP_KEY; return writePlain(",\n"); case LIST: return writePlain(",\n"); default: throw std::logic_error("Invalid enum value."); } } uint32_t TDebugProtocol::writeItem(const std::string& str) { uint32_t size = 0; size += startItem(); size += writePlain(str); size += endItem(); return size; } uint32_t TDebugProtocol::writeMessageBegin(const std::string& name, const TMessageType messageType, const int32_t seqid) { (void)seqid; string mtype; switch (messageType) { case T_CALL: mtype = "call"; break; case T_REPLY: mtype = "reply"; break; case T_EXCEPTION: mtype = "exn"; break; case T_ONEWAY: mtype = "oneway"; break; } uint32_t size = writeIndented("(" + mtype + ") " + name + "("); indentUp(); return size; } uint32_t TDebugProtocol::writeMessageEnd() { indentDown(); return writeIndented(")\n"); } uint32_t TDebugProtocol::writeStructBegin(const char* name) { uint32_t size = 0; size += startItem(); size += writePlain(string(name) + " {\n"); indentUp(); write_state_.push_back(STRUCT); return size; } uint32_t TDebugProtocol::writeStructEnd() { indentDown(); write_state_.pop_back(); uint32_t size = 0; size += writeIndented("}"); size += endItem(); return size; } uint32_t TDebugProtocol::writeFieldBegin(const char* name, const TType fieldType, const int16_t fieldId) { // sprintf(id_str, "%02d", fieldId); string id_str = to_string(fieldId); if (id_str.length() == 1) id_str = '0' + id_str; return writeIndented(id_str + ": " + name + " (" + fieldTypeName(fieldType) + ") = "); } uint32_t TDebugProtocol::writeFieldEnd() { assert(write_state_.back() == STRUCT); return 0; } uint32_t TDebugProtocol::writeFieldStop() { return 0; // writeIndented("***STOP***\n"); } uint32_t TDebugProtocol::writeMapBegin(const TType keyType, const TType valType, const uint32_t size) { // TODO(dreiss): Optimize short maps? uint32_t bsize = 0; bsize += startItem(); bsize += writePlain( "map<" + fieldTypeName(keyType) + "," + fieldTypeName(valType) + ">" "[" + to_string(size) + "] {\n"); indentUp(); write_state_.push_back(MAP_KEY); return bsize; } uint32_t TDebugProtocol::writeMapEnd() { indentDown(); write_state_.pop_back(); uint32_t size = 0; size += writeIndented("}"); size += endItem(); return size; } uint32_t TDebugProtocol::writeListBegin(const TType elemType, const uint32_t size) { // TODO(dreiss): Optimize short arrays. uint32_t bsize = 0; bsize += startItem(); bsize += writePlain( "list<" + fieldTypeName(elemType) + ">" "[" + to_string(size) + "] {\n"); indentUp(); write_state_.push_back(LIST); list_idx_.push_back(0); return bsize; } uint32_t TDebugProtocol::writeListEnd() { indentDown(); write_state_.pop_back(); list_idx_.pop_back(); uint32_t size = 0; size += writeIndented("}"); size += endItem(); return size; } uint32_t TDebugProtocol::writeSetBegin(const TType elemType, const uint32_t size) { // TODO(dreiss): Optimize short sets. uint32_t bsize = 0; bsize += startItem(); bsize += writePlain( "set<" + fieldTypeName(elemType) + ">" "[" + to_string(size) + "] {\n"); indentUp(); write_state_.push_back(SET); return bsize; } uint32_t TDebugProtocol::writeSetEnd() { indentDown(); write_state_.pop_back(); uint32_t size = 0; size += writeIndented("}"); size += endItem(); return size; } uint32_t TDebugProtocol::writeBool(const bool value) { return writeItem(value ? "true" : "false"); } uint32_t TDebugProtocol::writeByte(const int8_t byte) { return writeItem("0x" + byte_to_hex(byte)); } uint32_t TDebugProtocol::writeI16(const int16_t i16) { return writeItem(to_string(i16)); } uint32_t TDebugProtocol::writeI32(const int32_t i32) { return writeItem(to_string(i32)); } uint32_t TDebugProtocol::writeI64(const int64_t i64) { return writeItem(to_string(i64)); } uint32_t TDebugProtocol::writeDouble(const double dub) { return writeItem(to_string(dub)); } uint32_t TDebugProtocol::writeString(const string& str) { // XXX Raw/UTF-8? string to_show = str; if (to_show.length() > (string::size_type)string_limit_) { to_show = str.substr(0, string_prefix_size_); to_show += "[...](" + to_string(str.length()) + ")"; } string output = "\""; for (string::const_iterator it = to_show.begin(); it != to_show.end(); ++it) { if (*it == '\\') { output += "\\\\"; } else if (*it == '"') { output += "\\\""; // passing characters <0 to std::isprint causes asserts. isprint takes an // int, so we need to be careful of sign extension } else if (std::isprint((unsigned char)*it)) { output += *it; } else { switch (*it) { case '\a': output += "\\a"; break; case '\b': output += "\\b"; break; case '\f': output += "\\f"; break; case '\n': output += "\\n"; break; case '\r': output += "\\r"; break; case '\t': output += "\\t"; break; case '\v': output += "\\v"; break; default: output += "\\x"; output += byte_to_hex(*it); } } } output += '\"'; return writeItem(output); } uint32_t TDebugProtocol::writeBinary(const string& str) { // XXX Hex? return TDebugProtocol::writeString(str); } } } } // apache::thrift::protocol

[ "noreply@github.com" ]

noreply@github.com

dfc59a72f84b649b948aef66563070ffa09aa393

875d5faaa7daae794cf4206a2558117f21b71725

/lib/catch.hpp

b575408f0972b7f683cbf45bed850765c65c62e4

[]

no_license

habraham-toure/gestion-emploi-du-temps

223ab5c3daf077d0758072fd24c4f187e60f0b8d

1dd392421dc11c8436921bd058357bf6432af234

refs/heads/main

2023-07-05T01:46:26.577056

2021-08-26T13:21:34

null

0

null

UTF-8

C++

false

377,800

hpp

#ifndef TWOBLUECUBES_SINGLE_INCLUDE_CATCH_HPP_INCLUDED #define TWOBLUECUBES_SINGLE_INCLUDE_CATCH_HPP_INCLUDED #define TWOBLUECUBES_CATCH_HPP_INCLUDED #ifdef __clang__ # pragma clang system_header #elif defined __GNUC__ # pragma GCC system_header #endif // #included from: internal/catch_suppress_warnings.h #ifdef __clang__ # ifdef __ICC // icpc defines the __clang__ macro # pragma warning(push) # pragma warning(disable: 161 1682) # else // __ICC # pragma clang diagnostic ignored "-Wglobal-constructors" # pragma clang diagnostic ignored "-Wvariadic-macros" # pragma clang diagnostic ignored "-Wc99-extensions" # pragma clang diagnostic ignored "-Wunused-variable" # pragma clang diagnostic push # pragma clang diagnostic ignored "-Wpadded" # pragma clang diagnostic ignored "-Wc++98-compat" # pragma clang diagnostic ignored "-Wc++98-compat-pedantic" # pragma clang diagnostic ignored "-Wswitch-enum" # pragma clang diagnostic ignored "-Wcovered-switch-default" # endif #elif defined __GNUC__ # pragma GCC diagnostic ignored "-Wvariadic-macros" # pragma GCC diagnostic ignored "-Wunused-variable" # pragma GCC diagnostic push # pragma GCC diagnostic ignored "-Wpadded" #endif #if defined(CATCH_CONFIG_MAIN) || defined(CATCH_CONFIG_RUNNER) # define CATCH_IMPL #endif #ifdef CATCH_IMPL # ifndef CLARA_CONFIG_MAIN # define CLARA_CONFIG_MAIN_NOT_DEFINED # define CLARA_CONFIG_MAIN # endif #endif // #included from: internal/catch_notimplemented_exception.h #define TWOBLUECUBES_CATCH_NOTIMPLEMENTED_EXCEPTION_H_INCLUDED // #included from: catch_common.h #define TWOBLUECUBES_CATCH_COMMON_H_INCLUDED #define INTERNAL_CATCH_UNIQUE_NAME_LINE2( name, line ) name##line #define INTERNAL_CATCH_UNIQUE_NAME_LINE( name, line ) INTERNAL_CATCH_UNIQUE_NAME_LINE2( name, line ) #ifdef CATCH_CONFIG_COUNTER # define INTERNAL_CATCH_UNIQUE_NAME( name ) INTERNAL_CATCH_UNIQUE_NAME_LINE( name, __COUNTER__ ) #else # define INTERNAL_CATCH_UNIQUE_NAME( name ) INTERNAL_CATCH_UNIQUE_NAME_LINE( name, __LINE__ ) #endif #define INTERNAL_CATCH_STRINGIFY2( expr ) #expr #define INTERNAL_CATCH_STRINGIFY( expr ) INTERNAL_CATCH_STRINGIFY2( expr ) #include <sstream> #include <stdexcept> #include <algorithm> // #included from: catch_compiler_capabilities.h #define TWOBLUECUBES_CATCH_COMPILER_CAPABILITIES_HPP_INCLUDED #ifdef __cplusplus # if __cplusplus >= 201103L # define CATCH_CPP11_OR_GREATER # endif # if __cplusplus >= 201402L # define CATCH_CPP14_OR_GREATER # endif #endif #ifdef __clang__ # if __has_feature(cxx_nullptr) # define CATCH_INTERNAL_CONFIG_CPP11_NULLPTR # endif # if __has_feature(cxx_noexcept) # define CATCH_INTERNAL_CONFIG_CPP11_NOEXCEPT # endif # if defined(CATCH_CPP11_OR_GREATER) # define CATCH_INTERNAL_SUPPRESS_PARENTHESES_WARNINGS _Pragma( "clang diagnostic ignored \"-Wparentheses\"" ) # endif #endif // __clang__ //////////////////////////////////////////////////////////////////////////////// // Borland #ifdef __BORLANDC__ #endif // __BORLANDC__ //////////////////////////////////////////////////////////////////////////////// // EDG #ifdef __EDG_VERSION__ #endif // __EDG_VERSION__ //////////////////////////////////////////////////////////////////////////////// // Digital Mars #ifdef __DMC__ #endif // __DMC__ //////////////////////////////////////////////////////////////////////////////// // GCC #ifdef __GNUC__ # if __GNUC__ == 4 && __GNUC_MINOR__ >= 6 && defined(__GXX_EXPERIMENTAL_CXX0X__) # define CATCH_INTERNAL_CONFIG_CPP11_NULLPTR # endif # if !defined(CATCH_INTERNAL_SUPPRESS_PARENTHESES_WARNINGS) && defined(CATCH_CPP11_OR_GREATER) # define CATCH_INTERNAL_SUPPRESS_PARENTHESES_WARNINGS _Pragma( "GCC diagnostic ignored \"-Wparentheses\"" ) # endif // - otherwise more recent versions define __cplusplus >= 201103L // and will get picked up below #endif // __GNUC__ //////////////////////////////////////////////////////////////////////////////// // Visual C++ #ifdef _MSC_VER #if (_MSC_VER >= 1600) # define CATCH_INTERNAL_CONFIG_CPP11_NULLPTR # define CATCH_INTERNAL_CONFIG_CPP11_UNIQUE_PTR #endif #if (_MSC_VER >= 1900 ) // (VC++ 13 (VS2015)) #define CATCH_INTERNAL_CONFIG_CPP11_NOEXCEPT #define CATCH_INTERNAL_CONFIG_CPP11_GENERATED_METHODS #endif #endif // _MSC_VER //////////////////////////////////////////////////////////////////////////////// // Use variadic macros if the compiler supports them #if ( defined _MSC_VER && _MSC_VER > 1400 && !defined __EDGE__) || \ ( defined __WAVE__ && __WAVE_HAS_VARIADICS ) || \ ( defined __GNUC__ && __GNUC__ >= 3 ) || \ ( !defined __cplusplus && __STDC_VERSION__ >= 199901L || __cplusplus >= 201103L ) #define CATCH_INTERNAL_CONFIG_VARIADIC_MACROS #endif // Use __COUNTER__ if the compiler supports it #if ( defined _MSC_VER && _MSC_VER >= 1300 ) || \ ( defined __GNUC__ && __GNUC__ >= 4 && __GNUC_MINOR__ >= 3 ) || \ ( defined __clang__ && __clang_major__ >= 3 ) #define CATCH_INTERNAL_CONFIG_COUNTER #endif //////////////////////////////////////////////////////////////////////////////// // #if defined(CATCH_CPP11_OR_GREATER) # if !defined(CATCH_INTERNAL_CONFIG_CPP11_NULLPTR) # define CATCH_INTERNAL_CONFIG_CPP11_NULLPTR # endif # ifndef CATCH_INTERNAL_CONFIG_CPP11_NOEXCEPT # define CATCH_INTERNAL_CONFIG_CPP11_NOEXCEPT # endif # ifndef CATCH_INTERNAL_CONFIG_CPP11_GENERATED_METHODS # define CATCH_INTERNAL_CONFIG_CPP11_GENERATED_METHODS # endif # ifndef CATCH_INTERNAL_CONFIG_CPP11_IS_ENUM # define CATCH_INTERNAL_CONFIG_CPP11_IS_ENUM # endif # ifndef CATCH_INTERNAL_CONFIG_CPP11_TUPLE # define CATCH_INTERNAL_CONFIG_CPP11_TUPLE # endif # ifndef CATCH_INTERNAL_CONFIG_VARIADIC_MACROS # define CATCH_INTERNAL_CONFIG_VARIADIC_MACROS # endif # if !defined(CATCH_INTERNAL_CONFIG_CPP11_LONG_LONG) # define CATCH_INTERNAL_CONFIG_CPP11_LONG_LONG # endif # if !defined(CATCH_INTERNAL_CONFIG_CPP11_OVERRIDE) # define CATCH_INTERNAL_CONFIG_CPP11_OVERRIDE # endif # if !defined(CATCH_INTERNAL_CONFIG_CPP11_UNIQUE_PTR) # define CATCH_INTERNAL_CONFIG_CPP11_UNIQUE_PTR # endif #endif // __cplusplus >= 201103L // Now set the actual defines based on the above + anything the user has configured #if defined(CATCH_INTERNAL_CONFIG_CPP11_NULLPTR) && !defined(CATCH_CONFIG_CPP11_NO_NULLPTR) && !defined(CATCH_CONFIG_CPP11_NULLPTR) && !defined(CATCH_CONFIG_NO_CPP11) # define CATCH_CONFIG_CPP11_NULLPTR #endif #if defined(CATCH_INTERNAL_CONFIG_CPP11_NOEXCEPT) && !defined(CATCH_CONFIG_CPP11_NO_NOEXCEPT) && !defined(CATCH_CONFIG_CPP11_NOEXCEPT) && !defined(CATCH_CONFIG_NO_CPP11) # define CATCH_CONFIG_CPP11_NOEXCEPT #endif #if defined(CATCH_INTERNAL_CONFIG_CPP11_GENERATED_METHODS) && !defined(CATCH_CONFIG_CPP11_NO_GENERATED_METHODS) && !defined(CATCH_CONFIG_CPP11_GENERATED_METHODS) && !defined(CATCH_CONFIG_NO_CPP11) # define CATCH_CONFIG_CPP11_GENERATED_METHODS #endif #if defined(CATCH_INTERNAL_CONFIG_CPP11_IS_ENUM) && !defined(CATCH_CONFIG_CPP11_NO_IS_ENUM) && !defined(CATCH_CONFIG_CPP11_IS_ENUM) && !defined(CATCH_CONFIG_NO_CPP11) # define CATCH_CONFIG_CPP11_IS_ENUM #endif #if defined(CATCH_INTERNAL_CONFIG_CPP11_TUPLE) && !defined(CATCH_CONFIG_CPP11_NO_TUPLE) && !defined(CATCH_CONFIG_CPP11_TUPLE) && !defined(CATCH_CONFIG_NO_CPP11) # define CATCH_CONFIG_CPP11_TUPLE #endif #if defined(CATCH_INTERNAL_CONFIG_VARIADIC_MACROS) && !defined(CATCH_CONFIG_NO_VARIADIC_MACROS) && !defined(CATCH_CONFIG_VARIADIC_MACROS) # define CATCH_CONFIG_VARIADIC_MACROS #endif #if defined(CATCH_INTERNAL_CONFIG_CPP11_LONG_LONG) && !defined(CATCH_CONFIG_NO_LONG_LONG) && !defined(CATCH_CONFIG_CPP11_LONG_LONG) && !defined(CATCH_CONFIG_NO_CPP11) # define CATCH_CONFIG_CPP11_LONG_LONG #endif #if defined(CATCH_INTERNAL_CONFIG_CPP11_OVERRIDE) && !defined(CATCH_CONFIG_NO_OVERRIDE) && !defined(CATCH_CONFIG_CPP11_OVERRIDE) && !defined(CATCH_CONFIG_NO_CPP11) # define CATCH_CONFIG_CPP11_OVERRIDE #endif #if defined(CATCH_INTERNAL_CONFIG_CPP11_UNIQUE_PTR) && !defined(CATCH_CONFIG_NO_UNIQUE_PTR) && !defined(CATCH_CONFIG_CPP11_UNIQUE_PTR) && !defined(CATCH_CONFIG_NO_CPP11) # define CATCH_CONFIG_CPP11_UNIQUE_PTR #endif #if defined(CATCH_INTERNAL_CONFIG_COUNTER) && !defined(CATCH_CONFIG_NO_COUNTER) && !defined(CATCH_CONFIG_COUNTER) # define CATCH_CONFIG_COUNTER #endif #if !defined(CATCH_INTERNAL_SUPPRESS_PARENTHESES_WARNINGS) # define CATCH_INTERNAL_SUPPRESS_PARENTHESES_WARNINGS #endif // noexcept support: #if defined(CATCH_CONFIG_CPP11_NOEXCEPT) && !defined(CATCH_NOEXCEPT) # define CATCH_NOEXCEPT noexcept # define CATCH_NOEXCEPT_IS(x) noexcept(x) #else # define CATCH_NOEXCEPT throw() # define CATCH_NOEXCEPT_IS(x) #endif // nullptr support #ifdef CATCH_CONFIG_CPP11_NULLPTR # define CATCH_NULL nullptr #else # define CATCH_NULL NULL #endif // override support #ifdef CATCH_CONFIG_CPP11_OVERRIDE # define CATCH_OVERRIDE override #else # define CATCH_OVERRIDE #endif // unique_ptr support #ifdef CATCH_CONFIG_CPP11_UNIQUE_PTR # define CATCH_AUTO_PTR( T ) std::unique_ptr<T> #else # define CATCH_AUTO_PTR( T ) std::auto_ptr<T> #endif namespace Catch { struct IConfig; struct CaseSensitive { enum Choice { Yes, No }; }; class NonCopyable { #ifdef CATCH_CONFIG_CPP11_GENERATED_METHODS NonCopyable( NonCopyable const& ) = delete; NonCopyable( NonCopyable && ) = delete; NonCopyable& operator = ( NonCopyable const& ) = delete; NonCopyable& operator = ( NonCopyable && ) = delete; #else NonCopyable( NonCopyable const& info ); NonCopyable& operator = ( NonCopyable const& ); #endif protected: NonCopyable() {} virtual ~NonCopyable(); }; class SafeBool { public: typedef void (SafeBool::*type)() const; static type makeSafe( bool value ) { return value ? &SafeBool::trueValue : 0; } private: void trueValue() const {} }; template<typename ContainerT> inline void deleteAll( ContainerT& container ) { typename ContainerT::const_iterator it = container.begin(); typename ContainerT::const_iterator itEnd = container.end(); for(; it != itEnd; ++it ) delete *it; } template<typename AssociativeContainerT> inline void deleteAllValues( AssociativeContainerT& container ) { typename AssociativeContainerT::const_iterator it = container.begin(); typename AssociativeContainerT::const_iterator itEnd = container.end(); for(; it != itEnd; ++it ) delete it->second; } bool startsWith( std::string const& s, std::string const& prefix ); bool endsWith( std::string const& s, std::string const& suffix ); bool contains( std::string const& s, std::string const& infix ); void toLowerInPlace( std::string& s ); std::string toLower( std::string const& s ); std::string trim( std::string const& str ); bool replaceInPlace( std::string& str, std::string const& replaceThis, std::string const& withThis ); struct pluralise { pluralise( std::size_t count, std::string const& label ); friend std::ostream& operator << ( std::ostream& os, pluralise const& pluraliser ); std::size_t m_count; std::string m_label; }; struct SourceLineInfo { SourceLineInfo(); SourceLineInfo( char const* _file, std::size_t _line ); SourceLineInfo( SourceLineInfo const& other ); # ifdef CATCH_CONFIG_CPP11_GENERATED_METHODS SourceLineInfo( SourceLineInfo && ) = default; SourceLineInfo& operator = ( SourceLineInfo const& ) = default; SourceLineInfo& operator = ( SourceLineInfo && ) = default; # endif bool empty() const; bool operator == ( SourceLineInfo const& other ) const; bool operator < ( SourceLineInfo const& other ) const; std::string file; std::size_t line; }; std::ostream& operator << ( std::ostream& os, SourceLineInfo const& info ); // This is just here to avoid compiler warnings with macro constants and boolean literals inline bool isTrue( bool value ){ return value; } inline bool alwaysTrue() { return true; } inline bool alwaysFalse() { return false; } void throwLogicError( std::string const& message, SourceLineInfo const& locationInfo ); void seedRng( IConfig const& config ); unsigned int rngSeed(); // Use this in variadic streaming macros to allow // >> +StreamEndStop // as well as // >> stuff +StreamEndStop struct StreamEndStop { std::string operator+() { return std::string(); } }; template<typename T> T const& operator + ( T const& value, StreamEndStop ) { return value; } } #define CATCH_INTERNAL_LINEINFO ::Catch::SourceLineInfo( __FILE__, static_cast<std::size_t>( __LINE__ ) ) #define CATCH_INTERNAL_ERROR( msg ) ::Catch::throwLogicError( msg, CATCH_INTERNAL_LINEINFO ); #include <ostream> namespace Catch { class NotImplementedException : public std::exception { public: NotImplementedException( SourceLineInfo const& lineInfo ); NotImplementedException( NotImplementedException const& ) {} virtual ~NotImplementedException() CATCH_NOEXCEPT {} virtual const char* what() const CATCH_NOEXCEPT; private: std::string m_what; SourceLineInfo m_lineInfo; }; } // end namespace Catch /////////////////////////////////////////////////////////////////////////////// #define CATCH_NOT_IMPLEMENTED throw Catch::NotImplementedException( CATCH_INTERNAL_LINEINFO ) // #included from: internal/catch_context.h #define TWOBLUECUBES_CATCH_CONTEXT_H_INCLUDED // #included from: catch_interfaces_generators.h #define TWOBLUECUBES_CATCH_INTERFACES_GENERATORS_H_INCLUDED #include <string> namespace Catch { struct IGeneratorInfo { virtual ~IGeneratorInfo(); virtual bool moveNext() = 0; virtual std::size_t getCurrentIndex() const = 0; }; struct IGeneratorsForTest { virtual ~IGeneratorsForTest(); virtual IGeneratorInfo& getGeneratorInfo( std::string const& fileInfo, std::size_t size ) = 0; virtual bool moveNext() = 0; }; IGeneratorsForTest* createGeneratorsForTest(); } // end namespace Catch // #included from: catch_ptr.hpp #define TWOBLUECUBES_CATCH_PTR_HPP_INCLUDED #ifdef __clang__ #pragma clang diagnostic push #pragma clang diagnostic ignored "-Wpadded" #endif namespace Catch { // An intrusive reference counting smart pointer. // T must implement addRef() and release() methods // typically implementing the IShared interface template<typename T> class Ptr { public: Ptr() : m_p( CATCH_NULL ){} Ptr( T* p ) : m_p( p ){ if( m_p ) m_p->addRef(); } Ptr( Ptr const& other ) : m_p( other.m_p ){ if( m_p ) m_p->addRef(); } ~Ptr(){ if( m_p ) m_p->release(); } void reset() { if( m_p ) m_p->release(); m_p = CATCH_NULL; } Ptr& operator = ( T* p ){ Ptr temp( p ); swap( temp ); return *this; } Ptr& operator = ( Ptr const& other ){ Ptr temp( other ); swap( temp ); return *this; } void swap( Ptr& other ) { std::swap( m_p, other.m_p ); } T* get() const{ return m_p; } T& operator*() const { return *m_p; } T* operator->() const { return m_p; } bool operator !() const { return m_p == CATCH_NULL; } operator SafeBool::type() const { return SafeBool::makeSafe( m_p != CATCH_NULL ); } private: T* m_p; }; struct IShared : NonCopyable { virtual ~IShared(); virtual void addRef() const = 0; virtual void release() const = 0; }; template<typename T = IShared> struct SharedImpl : T { SharedImpl() : m_rc( 0 ){} virtual void addRef() const { ++m_rc; } virtual void release() const { if( --m_rc == 0 ) delete this; } mutable unsigned int m_rc; }; } // end namespace Catch #ifdef __clang__ #pragma clang diagnostic pop #endif #include <memory> #include <vector> #include <stdlib.h> namespace Catch { class TestCase; class Stream; struct IResultCapture; struct IRunner; struct IGeneratorsForTest; struct IConfig; struct IContext { virtual ~IContext(); virtual IResultCapture* getResultCapture() = 0; virtual IRunner* getRunner() = 0; virtual size_t getGeneratorIndex( std::string const& fileInfo, size_t totalSize ) = 0; virtual bool advanceGeneratorsForCurrentTest() = 0; virtual Ptr<IConfig const> getConfig() const = 0; }; struct IMutableContext : IContext { virtual ~IMutableContext(); virtual void setResultCapture( IResultCapture* resultCapture ) = 0; virtual void setRunner( IRunner* runner ) = 0; virtual void setConfig( Ptr<IConfig const> const& config ) = 0; }; IContext& getCurrentContext(); IMutableContext& getCurrentMutableContext(); void cleanUpContext(); Stream createStream( std::string const& streamName ); } // #included from: internal/catch_test_registry.hpp #define TWOBLUECUBES_CATCH_TEST_REGISTRY_HPP_INCLUDED // #included from: catch_interfaces_testcase.h #define TWOBLUECUBES_CATCH_INTERFACES_TESTCASE_H_INCLUDED #include <vector> namespace Catch { class TestSpec; struct ITestCase : IShared { virtual void invoke () const = 0; protected: virtual ~ITestCase(); }; class TestCase; struct IConfig; struct ITestCaseRegistry { virtual ~ITestCaseRegistry(); virtual std::vector<TestCase> const& getAllTests() const = 0; virtual std::vector<TestCase> const& getAllTestsSorted( IConfig const& config ) const = 0; }; bool matchTest( TestCase const& testCase, TestSpec const& testSpec, IConfig const& config ); std::vector<TestCase> filterTests( std::vector<TestCase> const& testCases, TestSpec const& testSpec, IConfig const& config ); std::vector<TestCase> const& getAllTestCasesSorted( IConfig const& config ); } namespace Catch { template<typename C> class MethodTestCase : public SharedImpl<ITestCase> { public: MethodTestCase( void (C::*method)() ) : m_method( method ) {} virtual void invoke() const { C obj; (obj.*m_method)(); } private: virtual ~MethodTestCase() {} void (C::*m_method)(); }; typedef void(*TestFunction)(); struct NameAndDesc { NameAndDesc( const char* _name = "", const char* _description= "" ) : name( _name ), description( _description ) {} const char* name; const char* description; }; void registerTestCase ( ITestCase* testCase, char const* className, NameAndDesc const& nameAndDesc, SourceLineInfo const& lineInfo ); struct AutoReg { AutoReg ( TestFunction function, SourceLineInfo const& lineInfo, NameAndDesc const& nameAndDesc ); template<typename C> AutoReg ( void (C::*method)(), char const* className, NameAndDesc const& nameAndDesc, SourceLineInfo const& lineInfo ) { registerTestCase ( new MethodTestCase<C>( method ), className, nameAndDesc, lineInfo ); } ~AutoReg(); private: AutoReg( AutoReg const& ); void operator= ( AutoReg const& ); }; void registerTestCaseFunction ( TestFunction function, SourceLineInfo const& lineInfo, NameAndDesc const& nameAndDesc ); } // end namespace Catch #ifdef CATCH_CONFIG_VARIADIC_MACROS /////////////////////////////////////////////////////////////////////////////// #define INTERNAL_CATCH_TESTCASE2( TestName, ... ) \ static void TestName(); \ namespace{ Catch::AutoReg INTERNAL_CATCH_UNIQUE_NAME( autoRegistrar )( &TestName, CATCH_INTERNAL_LINEINFO, Catch::NameAndDesc( __VA_ARGS__ ) ); }\ static void TestName() #define INTERNAL_CATCH_TESTCASE( ... ) \ INTERNAL_CATCH_TESTCASE2( INTERNAL_CATCH_UNIQUE_NAME( ____C_A_T_C_H____T_E_S_T____ ), __VA_ARGS__ ) /////////////////////////////////////////////////////////////////////////////// #define INTERNAL_CATCH_METHOD_AS_TEST_CASE( QualifiedMethod, ... ) \ namespace{ Catch::AutoReg INTERNAL_CATCH_UNIQUE_NAME( autoRegistrar )( &QualifiedMethod, "&" #QualifiedMethod, Catch::NameAndDesc( __VA_ARGS__ ), CATCH_INTERNAL_LINEINFO ); } /////////////////////////////////////////////////////////////////////////////// #define INTERNAL_CATCH_TEST_CASE_METHOD2( TestName, ClassName, ... )\ namespace{ \ struct TestName : ClassName{ \ void test(); \ }; \ Catch::AutoReg INTERNAL_CATCH_UNIQUE_NAME( autoRegistrar ) ( &TestName::test, #ClassName, Catch::NameAndDesc( __VA_ARGS__ ), CATCH_INTERNAL_LINEINFO ); \ } \ void TestName::test() #define INTERNAL_CATCH_TEST_CASE_METHOD( ClassName, ... ) \ INTERNAL_CATCH_TEST_CASE_METHOD2( INTERNAL_CATCH_UNIQUE_NAME( ____C_A_T_C_H____T_E_S_T____ ), ClassName, __VA_ARGS__ ) /////////////////////////////////////////////////////////////////////////////// #define INTERNAL_CATCH_REGISTER_TESTCASE( Function, ... ) \ Catch::AutoReg( Function, CATCH_INTERNAL_LINEINFO, Catch::NameAndDesc( __VA_ARGS__ ) ); #else /////////////////////////////////////////////////////////////////////////////// #define INTERNAL_CATCH_TESTCASE2( TestName, Name, Desc ) \ static void TestName(); \ namespace{ Catch::AutoReg INTERNAL_CATCH_UNIQUE_NAME( autoRegistrar )( &TestName, CATCH_INTERNAL_LINEINFO, Catch::NameAndDesc( Name, Desc ) ); }\ static void TestName() #define INTERNAL_CATCH_TESTCASE( Name, Desc ) \ INTERNAL_CATCH_TESTCASE2( INTERNAL_CATCH_UNIQUE_NAME( ____C_A_T_C_H____T_E_S_T____ ), Name, Desc ) /////////////////////////////////////////////////////////////////////////////// #define INTERNAL_CATCH_METHOD_AS_TEST_CASE( QualifiedMethod, Name, Desc ) \ namespace{ Catch::AutoReg INTERNAL_CATCH_UNIQUE_NAME( autoRegistrar )( &QualifiedMethod, "&" #QualifiedMethod, Catch::NameAndDesc( Name, Desc ), CATCH_INTERNAL_LINEINFO ); } /////////////////////////////////////////////////////////////////////////////// #define INTERNAL_CATCH_TEST_CASE_METHOD2( TestCaseName, ClassName, TestName, Desc )\ namespace{ \ struct TestCaseName : ClassName{ \ void test(); \ }; \ Catch::AutoReg INTERNAL_CATCH_UNIQUE_NAME( autoRegistrar ) ( &TestCaseName::test, #ClassName, Catch::NameAndDesc( TestName, Desc ), CATCH_INTERNAL_LINEINFO ); \ } \ void TestCaseName::test() #define INTERNAL_CATCH_TEST_CASE_METHOD( ClassName, TestName, Desc )\ INTERNAL_CATCH_TEST_CASE_METHOD2( INTERNAL_CATCH_UNIQUE_NAME( ____C_A_T_C_H____T_E_S_T____ ), ClassName, TestName, Desc ) /////////////////////////////////////////////////////////////////////////////// #define INTERNAL_CATCH_REGISTER_TESTCASE( Function, Name, Desc ) \ Catch::AutoReg( Function, CATCH_INTERNAL_LINEINFO, Catch::NameAndDesc( Name, Desc ) ); #endif // #included from: internal/catch_capture.hpp #define TWOBLUECUBES_CATCH_CAPTURE_HPP_INCLUDED // #included from: catch_result_builder.h #define TWOBLUECUBES_CATCH_RESULT_BUILDER_H_INCLUDED // #included from: catch_result_type.h #define TWOBLUECUBES_CATCH_RESULT_TYPE_H_INCLUDED namespace Catch { // ResultWas::OfType enum struct ResultWas { enum OfType { Unknown = -1, Ok = 0, Info = 1, Warning = 2, FailureBit = 0x10, ExpressionFailed = FailureBit | 1, ExplicitFailure = FailureBit | 2, Exception = 0x100 | FailureBit, ThrewException = Exception | 1, DidntThrowException = Exception | 2, FatalErrorCondition = 0x200 | FailureBit }; }; inline bool isOk( ResultWas::OfType resultType ) { return ( resultType & ResultWas::FailureBit ) == 0; } inline bool isJustInfo( int flags ) { return flags == ResultWas::Info; } // ResultDisposition::Flags enum struct ResultDisposition { enum Flags { Normal = 0x01, ContinueOnFailure = 0x02, // Failures fail test, but execution continues FalseTest = 0x04, // Prefix expression with ! SuppressFail = 0x08 // Failures are reported but do not fail the test }; }; inline ResultDisposition::Flags operator | ( ResultDisposition::Flags lhs, ResultDisposition::Flags rhs ) { return static_cast<ResultDisposition::Flags>( static_cast<int>( lhs ) | static_cast<int>( rhs ) ); } inline bool shouldContinueOnFailure( int flags ) { return ( flags & ResultDisposition::ContinueOnFailure ) != 0; } inline bool isFalseTest( int flags ) { return ( flags & ResultDisposition::FalseTest ) != 0; } inline bool shouldSuppressFailure( int flags ) { return ( flags & ResultDisposition::SuppressFail ) != 0; } } // end namespace Catch // #included from: catch_assertionresult.h #define TWOBLUECUBES_CATCH_ASSERTIONRESULT_H_INCLUDED #include <string> namespace Catch { struct AssertionInfo { AssertionInfo() {} AssertionInfo( std::string const& _macroName, SourceLineInfo const& _lineInfo, std::string const& _capturedExpression, ResultDisposition::Flags _resultDisposition ); std::string macroName; SourceLineInfo lineInfo; std::string capturedExpression; ResultDisposition::Flags resultDisposition; }; struct AssertionResultData { AssertionResultData() : resultType( ResultWas::Unknown ) {} std::string reconstructedExpression; std::string message; ResultWas::OfType resultType; }; class AssertionResult { public: AssertionResult(); AssertionResult( AssertionInfo const& info, AssertionResultData const& data ); ~AssertionResult(); # ifdef CATCH_CONFIG_CPP11_GENERATED_METHODS AssertionResult( AssertionResult const& ) = default; AssertionResult( AssertionResult && ) = default; AssertionResult& operator = ( AssertionResult const& ) = default; AssertionResult& operator = ( AssertionResult && ) = default; # endif bool isOk() const; bool succeeded() const; ResultWas::OfType getResultType() const; bool hasExpression() const; bool hasMessage() const; std::string getExpression() const; std::string getExpressionInMacro() const; bool hasExpandedExpression() const; std::string getExpandedExpression() const; std::string getMessage() const; SourceLineInfo getSourceInfo() const; std::string getTestMacroName() const; protected: AssertionInfo m_info; AssertionResultData m_resultData; }; } // end namespace Catch // #included from: catch_matchers.hpp #define TWOBLUECUBES_CATCH_MATCHERS_HPP_INCLUDED namespace Catch { namespace Matchers { namespace Impl { namespace Generic { template<typename ExpressionT> class AllOf; template<typename ExpressionT> class AnyOf; template<typename ExpressionT> class Not; } template<typename ExpressionT> struct Matcher : SharedImpl<IShared> { typedef ExpressionT ExpressionType; virtual ~Matcher() {} virtual Ptr<Matcher> clone() const = 0; virtual bool match( ExpressionT const& expr ) const = 0; virtual std::string toString() const = 0; Generic::AllOf<ExpressionT> operator && ( Matcher<ExpressionT> const& other ) const; Generic::AnyOf<ExpressionT> operator || ( Matcher<ExpressionT> const& other ) const; Generic::Not<ExpressionT> operator ! () const; }; template<typename DerivedT, typename ExpressionT> struct MatcherImpl : Matcher<ExpressionT> { virtual Ptr<Matcher<ExpressionT> > clone() const { return Ptr<Matcher<ExpressionT> >( new DerivedT( static_cast<DerivedT const&>( *this ) ) ); } }; namespace Generic { template<typename ExpressionT> class Not : public MatcherImpl<Not<ExpressionT>, ExpressionT> { public: explicit Not( Matcher<ExpressionT> const& matcher ) : m_matcher(matcher.clone()) {} Not( Not const& other ) : m_matcher( other.m_matcher ) {} virtual bool match( ExpressionT const& expr ) const CATCH_OVERRIDE { return !m_matcher->match( expr ); } virtual std::string toString() const CATCH_OVERRIDE { return "not " + m_matcher->toString(); } private: Ptr< Matcher<ExpressionT> > m_matcher; }; template<typename ExpressionT> class AllOf : public MatcherImpl<AllOf<ExpressionT>, ExpressionT> { public: AllOf() {} AllOf( AllOf const& other ) : m_matchers( other.m_matchers ) {} AllOf& add( Matcher<ExpressionT> const& matcher ) { m_matchers.push_back( matcher.clone() ); return *this; } virtual bool match( ExpressionT const& expr ) const { for( std::size_t i = 0; i < m_matchers.size(); ++i ) if( !m_matchers[i]->match( expr ) ) return false; return true; } virtual std::string toString() const { std::ostringstream oss; oss << "( "; for( std::size_t i = 0; i < m_matchers.size(); ++i ) { if( i != 0 ) oss << " and "; oss << m_matchers[i]->toString(); } oss << " )"; return oss.str(); } AllOf operator && ( Matcher<ExpressionT> const& other ) const { AllOf allOfExpr( *this ); allOfExpr.add( other ); return allOfExpr; } private: std::vector<Ptr<Matcher<ExpressionT> > > m_matchers; }; template<typename ExpressionT> class AnyOf : public MatcherImpl<AnyOf<ExpressionT>, ExpressionT> { public: AnyOf() {} AnyOf( AnyOf const& other ) : m_matchers( other.m_matchers ) {} AnyOf& add( Matcher<ExpressionT> const& matcher ) { m_matchers.push_back( matcher.clone() ); return *this; } virtual bool match( ExpressionT const& expr ) const { for( std::size_t i = 0; i < m_matchers.size(); ++i ) if( m_matchers[i]->match( expr ) ) return true; return false; } virtual std::string toString() const { std::ostringstream oss; oss << "( "; for( std::size_t i = 0; i < m_matchers.size(); ++i ) { if( i != 0 ) oss << " or "; oss << m_matchers[i]->toString(); } oss << " )"; return oss.str(); } AnyOf operator || ( Matcher<ExpressionT> const& other ) const { AnyOf anyOfExpr( *this ); anyOfExpr.add( other ); return anyOfExpr; } private: std::vector<Ptr<Matcher<ExpressionT> > > m_matchers; }; } // namespace Generic template<typename ExpressionT> Generic::AllOf<ExpressionT> Matcher<ExpressionT>::operator && ( Matcher<ExpressionT> const& other ) const { Generic::AllOf<ExpressionT> allOfExpr; allOfExpr.add( *this ); allOfExpr.add( other ); return allOfExpr; } template<typename ExpressionT> Generic::AnyOf<ExpressionT> Matcher<ExpressionT>::operator || ( Matcher<ExpressionT> const& other ) const { Generic::AnyOf<ExpressionT> anyOfExpr; anyOfExpr.add( *this ); anyOfExpr.add( other ); return anyOfExpr; } template<typename ExpressionT> Generic::Not<ExpressionT> Matcher<ExpressionT>::operator ! () const { return Generic::Not<ExpressionT>( *this ); } namespace StdString { inline std::string makeString( std::string const& str ) { return str; } inline std::string makeString( const char* str ) { return str ? std::string( str ) : std::string(); } struct CasedString { CasedString( std::string const& str, CaseSensitive::Choice caseSensitivity ) : m_caseSensitivity( caseSensitivity ), m_str( adjustString( str ) ) {} std::string adjustString( std::string const& str ) const { return m_caseSensitivity == CaseSensitive::No ? toLower( str ) : str; } std::string toStringSuffix() const { return m_caseSensitivity == CaseSensitive::No ? " (case insensitive)" : ""; } CaseSensitive::Choice m_caseSensitivity; std::string m_str; }; struct Equals : MatcherImpl<Equals, std::string> { Equals( std::string const& str, CaseSensitive::Choice caseSensitivity = CaseSensitive::Yes ) : m_data( str, caseSensitivity ) {} Equals( Equals const& other ) : m_data( other.m_data ){} virtual ~Equals(); virtual bool match( std::string const& expr ) const { return m_data.m_str == m_data.adjustString( expr );; } virtual std::string toString() const { return "equals: \"" + m_data.m_str + "\"" + m_data.toStringSuffix(); } CasedString m_data; }; struct Contains : MatcherImpl<Contains, std::string> { Contains( std::string const& substr, CaseSensitive::Choice caseSensitivity = CaseSensitive::Yes ) : m_data( substr, caseSensitivity ){} Contains( Contains const& other ) : m_data( other.m_data ){} virtual ~Contains(); virtual bool match( std::string const& expr ) const { return m_data.adjustString( expr ).find( m_data.m_str ) != std::string::npos; } virtual std::string toString() const { return "contains: \"" + m_data.m_str + "\"" + m_data.toStringSuffix(); } CasedString m_data; }; struct StartsWith : MatcherImpl<StartsWith, std::string> { StartsWith( std::string const& substr, CaseSensitive::Choice caseSensitivity = CaseSensitive::Yes ) : m_data( substr, caseSensitivity ){} StartsWith( StartsWith const& other ) : m_data( other.m_data ){} virtual ~StartsWith(); virtual bool match( std::string const& expr ) const { return startsWith( m_data.adjustString( expr ), m_data.m_str ); } virtual std::string toString() const { return "starts with: \"" + m_data.m_str + "\"" + m_data.toStringSuffix(); } CasedString m_data; }; struct EndsWith : MatcherImpl<EndsWith, std::string> { EndsWith( std::string const& substr, CaseSensitive::Choice caseSensitivity = CaseSensitive::Yes ) : m_data( substr, caseSensitivity ){} EndsWith( EndsWith const& other ) : m_data( other.m_data ){} virtual ~EndsWith(); virtual bool match( std::string const& expr ) const { return endsWith( m_data.adjustString( expr ), m_data.m_str ); } virtual std::string toString() const { return "ends with: \"" + m_data.m_str + "\"" + m_data.toStringSuffix(); } CasedString m_data; }; } // namespace StdString } // namespace Impl // The following functions create the actual matcher objects. // This allows the types to be inferred template<typename ExpressionT> inline Impl::Generic::Not<ExpressionT> Not( Impl::Matcher<ExpressionT> const& m ) { return Impl::Generic::Not<ExpressionT>( m ); } template<typename ExpressionT> inline Impl::Generic::AllOf<ExpressionT> AllOf( Impl::Matcher<ExpressionT> const& m1, Impl::Matcher<ExpressionT> const& m2 ) { return Impl::Generic::AllOf<ExpressionT>().add( m1 ).add( m2 ); } template<typename ExpressionT> inline Impl::Generic::AllOf<ExpressionT> AllOf( Impl::Matcher<ExpressionT> const& m1, Impl::Matcher<ExpressionT> const& m2, Impl::Matcher<ExpressionT> const& m3 ) { return Impl::Generic::AllOf<ExpressionT>().add( m1 ).add( m2 ).add( m3 ); } template<typename ExpressionT> inline Impl::Generic::AnyOf<ExpressionT> AnyOf( Impl::Matcher<ExpressionT> const& m1, Impl::Matcher<ExpressionT> const& m2 ) { return Impl::Generic::AnyOf<ExpressionT>().add( m1 ).add( m2 ); } template<typename ExpressionT> inline Impl::Generic::AnyOf<ExpressionT> AnyOf( Impl::Matcher<ExpressionT> const& m1, Impl::Matcher<ExpressionT> const& m2, Impl::Matcher<ExpressionT> const& m3 ) { return Impl::Generic::AnyOf<ExpressionT>().add( m1 ).add( m2 ).add( m3 ); } inline Impl::StdString::Equals Equals( std::string const& str, CaseSensitive::Choice caseSensitivity = CaseSensitive::Yes ) { return Impl::StdString::Equals( str, caseSensitivity ); } inline Impl::StdString::Equals Equals( const char* str, CaseSensitive::Choice caseSensitivity = CaseSensitive::Yes ) { return Impl::StdString::Equals( Impl::StdString::makeString( str ), caseSensitivity ); } inline Impl::StdString::Contains Contains( std::string const& substr, CaseSensitive::Choice caseSensitivity = CaseSensitive::Yes ) { return Impl::StdString::Contains( substr, caseSensitivity ); } inline Impl::StdString::Contains Contains( const char* substr, CaseSensitive::Choice caseSensitivity = CaseSensitive::Yes ) { return Impl::StdString::Contains( Impl::StdString::makeString( substr ), caseSensitivity ); } inline Impl::StdString::StartsWith StartsWith( std::string const& substr ) { return Impl::StdString::StartsWith( substr ); } inline Impl::StdString::StartsWith StartsWith( const char* substr ) { return Impl::StdString::StartsWith( Impl::StdString::makeString( substr ) ); } inline Impl::StdString::EndsWith EndsWith( std::string const& substr ) { return Impl::StdString::EndsWith( substr ); } inline Impl::StdString::EndsWith EndsWith( const char* substr ) { return Impl::StdString::EndsWith( Impl::StdString::makeString( substr ) ); } } // namespace Matchers using namespace Matchers; } // namespace Catch namespace Catch { struct TestFailureException{}; template<typename T> class ExpressionLhs; struct STATIC_ASSERT_Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison; struct CopyableStream { CopyableStream() {} CopyableStream( CopyableStream const& other ) { oss << other.oss.str(); } CopyableStream& operator=( CopyableStream const& other ) { oss.str(""); oss << other.oss.str(); return *this; } std::ostringstream oss; }; class ResultBuilder { public: ResultBuilder( char const* macroName, SourceLineInfo const& lineInfo, char const* capturedExpression, ResultDisposition::Flags resultDisposition, char const* secondArg = "" ); template<typename T> ExpressionLhs<T const&> operator <= ( T const& operand ); ExpressionLhs<bool> operator <= ( bool value ); template<typename T> ResultBuilder& operator << ( T const& value ) { m_stream.oss << value; return *this; } template<typename RhsT> STATIC_ASSERT_Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison& operator && ( RhsT const& ); template<typename RhsT> STATIC_ASSERT_Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison& operator || ( RhsT const& ); ResultBuilder& setResultType( ResultWas::OfType result ); ResultBuilder& setResultType( bool result ); ResultBuilder& setLhs( std::string const& lhs ); ResultBuilder& setRhs( std::string const& rhs ); ResultBuilder& setOp( std::string const& op ); void endExpression(); std::string reconstructExpression() const; AssertionResult build() const; void useActiveException( ResultDisposition::Flags resultDisposition = ResultDisposition::Normal ); void captureResult( ResultWas::OfType resultType ); void captureExpression(); void captureExpectedException( std::string const& expectedMessage ); void captureExpectedException( Matchers::Impl::Matcher<std::string> const& matcher ); void handleResult( AssertionResult const& result ); void react(); bool shouldDebugBreak() const; bool allowThrows() const; private: AssertionInfo m_assertionInfo; AssertionResultData m_data; struct ExprComponents { ExprComponents() : testFalse( false ) {} bool testFalse; std::string lhs, rhs, op; } m_exprComponents; CopyableStream m_stream; bool m_shouldDebugBreak; bool m_shouldThrow; }; } // namespace Catch // Include after due to circular dependency: // #included from: catch_expression_lhs.hpp #define TWOBLUECUBES_CATCH_EXPRESSION_LHS_HPP_INCLUDED // #included from: catch_evaluate.hpp #define TWOBLUECUBES_CATCH_EVALUATE_HPP_INCLUDED #ifdef _MSC_VER #pragma warning(push) #pragma warning(disable:4389) // '==' : signed/unsigned mismatch #endif #include <cstddef> namespace Catch { namespace Internal { enum Operator { IsEqualTo, IsNotEqualTo, IsLessThan, IsGreaterThan, IsLessThanOrEqualTo, IsGreaterThanOrEqualTo }; template<Operator Op> struct OperatorTraits { static const char* getName(){ return "*error*"; } }; template<> struct OperatorTraits<IsEqualTo> { static const char* getName(){ return "=="; } }; template<> struct OperatorTraits<IsNotEqualTo> { static const char* getName(){ return "!="; } }; template<> struct OperatorTraits<IsLessThan> { static const char* getName(){ return "<"; } }; template<> struct OperatorTraits<IsGreaterThan> { static const char* getName(){ return ">"; } }; template<> struct OperatorTraits<IsLessThanOrEqualTo> { static const char* getName(){ return "<="; } }; template<> struct OperatorTraits<IsGreaterThanOrEqualTo>{ static const char* getName(){ return ">="; } }; template<typename T> inline T& opCast(T const& t) { return const_cast<T&>(t); } // nullptr_t support based on pull request #154 from Konstantin Baumann #ifdef CATCH_CONFIG_CPP11_NULLPTR inline std::nullptr_t opCast(std::nullptr_t) { return nullptr; } #endif // CATCH_CONFIG_CPP11_NULLPTR // So the compare overloads can be operator agnostic we convey the operator as a template // enum, which is used to specialise an Evaluator for doing the comparison. template<typename T1, typename T2, Operator Op> class Evaluator{}; template<typename T1, typename T2> struct Evaluator<T1, T2, IsEqualTo> { static bool evaluate( T1 const& lhs, T2 const& rhs) { return bool( opCast( lhs ) == opCast( rhs ) ); } }; template<typename T1, typename T2> struct Evaluator<T1, T2, IsNotEqualTo> { static bool evaluate( T1 const& lhs, T2 const& rhs ) { return bool( opCast( lhs ) != opCast( rhs ) ); } }; template<typename T1, typename T2> struct Evaluator<T1, T2, IsLessThan> { static bool evaluate( T1 const& lhs, T2 const& rhs ) { return bool( opCast( lhs ) < opCast( rhs ) ); } }; template<typename T1, typename T2> struct Evaluator<T1, T2, IsGreaterThan> { static bool evaluate( T1 const& lhs, T2 const& rhs ) { return bool( opCast( lhs ) > opCast( rhs ) ); } }; template<typename T1, typename T2> struct Evaluator<T1, T2, IsGreaterThanOrEqualTo> { static bool evaluate( T1 const& lhs, T2 const& rhs ) { return bool( opCast( lhs ) >= opCast( rhs ) ); } }; template<typename T1, typename T2> struct Evaluator<T1, T2, IsLessThanOrEqualTo> { static bool evaluate( T1 const& lhs, T2 const& rhs ) { return bool( opCast( lhs ) <= opCast( rhs ) ); } }; template<Operator Op, typename T1, typename T2> bool applyEvaluator( T1 const& lhs, T2 const& rhs ) { return Evaluator<T1, T2, Op>::evaluate( lhs, rhs ); } // This level of indirection allows us to specialise for integer types // to avoid signed/ unsigned warnings // "base" overload template<Operator Op, typename T1, typename T2> bool compare( T1 const& lhs, T2 const& rhs ) { return Evaluator<T1, T2, Op>::evaluate( lhs, rhs ); } // unsigned X to int template<Operator Op> bool compare( unsigned int lhs, int rhs ) { return applyEvaluator<Op>( lhs, static_cast<unsigned int>( rhs ) ); } template<Operator Op> bool compare( unsigned long lhs, int rhs ) { return applyEvaluator<Op>( lhs, static_cast<unsigned int>( rhs ) ); } template<Operator Op> bool compare( unsigned char lhs, int rhs ) { return applyEvaluator<Op>( lhs, static_cast<unsigned int>( rhs ) ); } // unsigned X to long template<Operator Op> bool compare( unsigned int lhs, long rhs ) { return applyEvaluator<Op>( lhs, static_cast<unsigned long>( rhs ) ); } template<Operator Op> bool compare( unsigned long lhs, long rhs ) { return applyEvaluator<Op>( lhs, static_cast<unsigned long>( rhs ) ); } template<Operator Op> bool compare( unsigned char lhs, long rhs ) { return applyEvaluator<Op>( lhs, static_cast<unsigned long>( rhs ) ); } // int to unsigned X template<Operator Op> bool compare( int lhs, unsigned int rhs ) { return applyEvaluator<Op>( static_cast<unsigned int>( lhs ), rhs ); } template<Operator Op> bool compare( int lhs, unsigned long rhs ) { return applyEvaluator<Op>( static_cast<unsigned int>( lhs ), rhs ); } template<Operator Op> bool compare( int lhs, unsigned char rhs ) { return applyEvaluator<Op>( static_cast<unsigned int>( lhs ), rhs ); } // long to unsigned X template<Operator Op> bool compare( long lhs, unsigned int rhs ) { return applyEvaluator<Op>( static_cast<unsigned long>( lhs ), rhs ); } template<Operator Op> bool compare( long lhs, unsigned long rhs ) { return applyEvaluator<Op>( static_cast<unsigned long>( lhs ), rhs ); } template<Operator Op> bool compare( long lhs, unsigned char rhs ) { return applyEvaluator<Op>( static_cast<unsigned long>( lhs ), rhs ); } // pointer to long (when comparing against NULL) template<Operator Op, typename T> bool compare( long lhs, T* rhs ) { return Evaluator<T*, T*, Op>::evaluate( reinterpret_cast<T*>( lhs ), rhs ); } template<Operator Op, typename T> bool compare( T* lhs, long rhs ) { return Evaluator<T*, T*, Op>::evaluate( lhs, reinterpret_cast<T*>( rhs ) ); } // pointer to int (when comparing against NULL) template<Operator Op, typename T> bool compare( int lhs, T* rhs ) { return Evaluator<T*, T*, Op>::evaluate( reinterpret_cast<T*>( lhs ), rhs ); } template<Operator Op, typename T> bool compare( T* lhs, int rhs ) { return Evaluator<T*, T*, Op>::evaluate( lhs, reinterpret_cast<T*>( rhs ) ); } #ifdef CATCH_CONFIG_CPP11_LONG_LONG // long long to unsigned X template<Operator Op> bool compare( long long lhs, unsigned int rhs ) { return applyEvaluator<Op>( static_cast<unsigned long>( lhs ), rhs ); } template<Operator Op> bool compare( long long lhs, unsigned long rhs ) { return applyEvaluator<Op>( static_cast<unsigned long>( lhs ), rhs ); } template<Operator Op> bool compare( long long lhs, unsigned long long rhs ) { return applyEvaluator<Op>( static_cast<unsigned long>( lhs ), rhs ); } template<Operator Op> bool compare( long long lhs, unsigned char rhs ) { return applyEvaluator<Op>( static_cast<unsigned long>( lhs ), rhs ); } // unsigned long long to X template<Operator Op> bool compare( unsigned long long lhs, int rhs ) { return applyEvaluator<Op>( static_cast<long>( lhs ), rhs ); } template<Operator Op> bool compare( unsigned long long lhs, long rhs ) { return applyEvaluator<Op>( static_cast<long>( lhs ), rhs ); } template<Operator Op> bool compare( unsigned long long lhs, long long rhs ) { return applyEvaluator<Op>( static_cast<long>( lhs ), rhs ); } template<Operator Op> bool compare( unsigned long long lhs, char rhs ) { return applyEvaluator<Op>( static_cast<long>( lhs ), rhs ); } // pointer to long long (when comparing against NULL) template<Operator Op, typename T> bool compare( long long lhs, T* rhs ) { return Evaluator<T*, T*, Op>::evaluate( reinterpret_cast<T*>( lhs ), rhs ); } template<Operator Op, typename T> bool compare( T* lhs, long long rhs ) { return Evaluator<T*, T*, Op>::evaluate( lhs, reinterpret_cast<T*>( rhs ) ); } #endif // CATCH_CONFIG_CPP11_LONG_LONG #ifdef CATCH_CONFIG_CPP11_NULLPTR // pointer to nullptr_t (when comparing against nullptr) template<Operator Op, typename T> bool compare( std::nullptr_t, T* rhs ) { return Evaluator<T*, T*, Op>::evaluate( nullptr, rhs ); } template<Operator Op, typename T> bool compare( T* lhs, std::nullptr_t ) { return Evaluator<T*, T*, Op>::evaluate( lhs, nullptr ); } #endif // CATCH_CONFIG_CPP11_NULLPTR } // end of namespace Internal } // end of namespace Catch #ifdef _MSC_VER #pragma warning(pop) #endif // #included from: catch_tostring.h #define TWOBLUECUBES_CATCH_TOSTRING_H_INCLUDED #include <sstream> #include <iomanip> #include <limits> #include <vector> #include <cstddef> #ifdef __OBJC__ // #included from: catch_objc_arc.hpp #define TWOBLUECUBES_CATCH_OBJC_ARC_HPP_INCLUDED #import <Foundation/Foundation.h> #ifdef __has_feature #define CATCH_ARC_ENABLED __has_feature(objc_arc) #else #define CATCH_ARC_ENABLED 0 #endif void arcSafeRelease( NSObject* obj ); id performOptionalSelector( id obj, SEL sel ); #if !CATCH_ARC_ENABLED inline void arcSafeRelease( NSObject* obj ) { [obj release]; } inline id performOptionalSelector( id obj, SEL sel ) { if( [obj respondsToSelector: sel] ) return [obj performSelector: sel]; return nil; } #define CATCH_UNSAFE_UNRETAINED #define CATCH_ARC_STRONG #else inline void arcSafeRelease( NSObject* ){} inline id performOptionalSelector( id obj, SEL sel ) { #ifdef __clang__ #pragma clang diagnostic push #pragma clang diagnostic ignored "-Warc-performSelector-leaks" #endif if( [obj respondsToSelector: sel] ) return [obj performSelector: sel]; #ifdef __clang__ #pragma clang diagnostic pop #endif return nil; } #define CATCH_UNSAFE_UNRETAINED __unsafe_unretained #define CATCH_ARC_STRONG __strong #endif #endif #ifdef CATCH_CONFIG_CPP11_TUPLE #include <tuple> #endif #ifdef CATCH_CONFIG_CPP11_IS_ENUM #include <type_traits> #endif namespace Catch { // Why we're here. template<typename T> std::string toString( T const& value ); // Built in overloads std::string toString( std::string const& value ); std::string toString( std::wstring const& value ); std::string toString( const char* const value ); std::string toString( char* const value ); std::string toString( const wchar_t* const value ); std::string toString( wchar_t* const value ); std::string toString( int value ); std::string toString( unsigned long value ); std::string toString( unsigned int value ); std::string toString( const double value ); std::string toString( const float value ); std::string toString( bool value ); std::string toString( char value ); std::string toString( signed char value ); std::string toString( unsigned char value ); #ifdef CATCH_CONFIG_CPP11_LONG_LONG std::string toString( long long value ); std::string toString( unsigned long long value ); #endif #ifdef CATCH_CONFIG_CPP11_NULLPTR std::string toString( std::nullptr_t ); #endif #ifdef __OBJC__ std::string toString( NSString const * const& nsstring ); std::string toString( NSString * CATCH_ARC_STRONG const& nsstring ); std::string toString( NSObject* const& nsObject ); #endif namespace Detail { extern const std::string unprintableString; struct BorgType { template<typename T> BorgType( T const& ); }; struct TrueType { char sizer[1]; }; struct FalseType { char sizer[2]; }; TrueType& testStreamable( std::ostream& ); FalseType testStreamable( FalseType ); FalseType operator<<( std::ostream const&, BorgType const& ); template<typename T> struct IsStreamInsertable { static std::ostream &s; static T const&t; enum { value = sizeof( testStreamable(s << t) ) == sizeof( TrueType ) }; }; #if defined(CATCH_CONFIG_CPP11_IS_ENUM) template<typename T, bool IsEnum = std::is_enum<T>::value > struct EnumStringMaker { static std::string convert( T const& ) { return unprintableString; } }; template<typename T> struct EnumStringMaker<T,true> { static std::string convert( T const& v ) { return ::Catch::toString( static_cast<typename std::underlying_type<T>::type>(v) ); } }; #endif template<bool C> struct StringMakerBase { #if defined(CATCH_CONFIG_CPP11_IS_ENUM) template<typename T> static std::string convert( T const& v ) { return EnumStringMaker<T>::convert( v ); } #else template<typename T> static std::string convert( T const& ) { return unprintableString; } #endif }; template<> struct StringMakerBase<true> { template<typename T> static std::string convert( T const& _value ) { std::ostringstream oss; oss << _value; return oss.str(); } }; std::string rawMemoryToString( const void *object, std::size_t size ); template<typename T> inline std::string rawMemoryToString( const T& object ) { return rawMemoryToString( &object, sizeof(object) ); } } // end namespace Detail template<typename T> struct StringMaker : Detail::StringMakerBase<Detail::IsStreamInsertable<T>::value> {}; template<typename T> struct StringMaker<T*> { template<typename U> static std::string convert( U* p ) { if( !p ) return "NULL"; else return Detail::rawMemoryToString( p ); } }; template<typename R, typename C> struct StringMaker<R C::*> { static std::string convert( R C::* p ) { if( !p ) return "NULL"; else return Detail::rawMemoryToString( p ); } }; namespace Detail { template<typename InputIterator> std::string rangeToString( InputIterator first, InputIterator last ); } //template<typename T, typename Allocator> //struct StringMaker<std::vector<T, Allocator> > { // static std::string convert( std::vector<T,Allocator> const& v ) { // return Detail::rangeToString( v.begin(), v.end() ); // } //}; template<typename T, typename Allocator> std::string toString( std::vector<T,Allocator> const& v ) { return Detail::rangeToString( v.begin(), v.end() ); } #ifdef CATCH_CONFIG_CPP11_TUPLE // toString for tuples namespace TupleDetail { template< typename Tuple, std::size_t N = 0, bool = (N < std::tuple_size<Tuple>::value) > struct ElementPrinter { static void print( const Tuple& tuple, std::ostream& os ) { os << ( N ? ", " : " " ) << Catch::toString(std::get<N>(tuple)); ElementPrinter<Tuple,N+1>::print(tuple,os); } }; template< typename Tuple, std::size_t N > struct ElementPrinter<Tuple,N,false> { static void print( const Tuple&, std::ostream& ) {} }; } template<typename ...Types> struct StringMaker<std::tuple<Types...>> { static std::string convert( const std::tuple<Types...>& tuple ) { std::ostringstream os; os << '{'; TupleDetail::ElementPrinter<std::tuple<Types...>>::print( tuple, os ); os << " }"; return os.str(); } }; #endif // CATCH_CONFIG_CPP11_TUPLE namespace Detail { template<typename T> std::string makeString( T const& value ) { return StringMaker<T>::convert( value ); } } // end namespace Detail /// \brief converts any type to a string /// /// The default template forwards on to ostringstream - except when an /// ostringstream overload does not exist - in which case it attempts to detect /// that and writes {?}. /// Overload (not specialise) this template for custom typs that you don't want /// to provide an ostream overload for. template<typename T> std::string toString( T const& value ) { return StringMaker<T>::convert( value ); } namespace Detail { template<typename InputIterator> std::string rangeToString( InputIterator first, InputIterator last ) { std::ostringstream oss; oss << "{ "; if( first != last ) { oss << Catch::toString( *first ); for( ++first ; first != last ; ++first ) oss << ", " << Catch::toString( *first ); } oss << " }"; return oss.str(); } } } // end namespace Catch namespace Catch { // Wraps the LHS of an expression and captures the operator and RHS (if any) - // wrapping them all in a ResultBuilder object template<typename T> class ExpressionLhs { ExpressionLhs& operator = ( ExpressionLhs const& ); # ifdef CATCH_CONFIG_CPP11_GENERATED_METHODS ExpressionLhs& operator = ( ExpressionLhs && ) = delete; # endif public: ExpressionLhs( ResultBuilder& rb, T lhs ) : m_rb( rb ), m_lhs( lhs ) {} # ifdef CATCH_CONFIG_CPP11_GENERATED_METHODS ExpressionLhs( ExpressionLhs const& ) = default; ExpressionLhs( ExpressionLhs && ) = default; # endif template<typename RhsT> ResultBuilder& operator == ( RhsT const& rhs ) { return captureExpression<Internal::IsEqualTo>( rhs ); } template<typename RhsT> ResultBuilder& operator != ( RhsT const& rhs ) { return captureExpression<Internal::IsNotEqualTo>( rhs ); } template<typename RhsT> ResultBuilder& operator < ( RhsT const& rhs ) { return captureExpression<Internal::IsLessThan>( rhs ); } template<typename RhsT> ResultBuilder& operator > ( RhsT const& rhs ) { return captureExpression<Internal::IsGreaterThan>( rhs ); } template<typename RhsT> ResultBuilder& operator <= ( RhsT const& rhs ) { return captureExpression<Internal::IsLessThanOrEqualTo>( rhs ); } template<typename RhsT> ResultBuilder& operator >= ( RhsT const& rhs ) { return captureExpression<Internal::IsGreaterThanOrEqualTo>( rhs ); } ResultBuilder& operator == ( bool rhs ) { return captureExpression<Internal::IsEqualTo>( rhs ); } ResultBuilder& operator != ( bool rhs ) { return captureExpression<Internal::IsNotEqualTo>( rhs ); } void endExpression() { bool value = m_lhs ? true : false; m_rb .setLhs( Catch::toString( value ) ) .setResultType( value ) .endExpression(); } // Only simple binary expressions are allowed on the LHS. // If more complex compositions are required then place the sub expression in parentheses template<typename RhsT> STATIC_ASSERT_Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison& operator + ( RhsT const& ); template<typename RhsT> STATIC_ASSERT_Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison& operator - ( RhsT const& ); template<typename RhsT> STATIC_ASSERT_Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison& operator / ( RhsT const& ); template<typename RhsT> STATIC_ASSERT_Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison& operator * ( RhsT const& ); template<typename RhsT> STATIC_ASSERT_Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison& operator && ( RhsT const& ); template<typename RhsT> STATIC_ASSERT_Expression_Too_Complex_Please_Rewrite_As_Binary_Comparison& operator || ( RhsT const& ); private: template<Internal::Operator Op, typename RhsT> ResultBuilder& captureExpression( RhsT const& rhs ) { return m_rb .setResultType( Internal::compare<Op>( m_lhs, rhs ) ) .setLhs( Catch::toString( m_lhs ) ) .setRhs( Catch::toString( rhs ) ) .setOp( Internal::OperatorTraits<Op>::getName() ); } private: ResultBuilder& m_rb; T m_lhs; }; } // end namespace Catch namespace Catch { template<typename T> inline ExpressionLhs<T const&> ResultBuilder::operator <= ( T const& operand ) { return ExpressionLhs<T const&>( *this, operand ); } inline ExpressionLhs<bool> ResultBuilder::operator <= ( bool value ) { return ExpressionLhs<bool>( *this, value ); } } // namespace Catch // #included from: catch_message.h #define TWOBLUECUBES_CATCH_MESSAGE_H_INCLUDED #include <string> namespace Catch { struct MessageInfo { MessageInfo( std::string const& _macroName, SourceLineInfo const& _lineInfo, ResultWas::OfType _type ); std::string macroName; SourceLineInfo lineInfo; ResultWas::OfType type; std::string message; unsigned int sequence; bool operator == ( MessageInfo const& other ) const { return sequence == other.sequence; } bool operator < ( MessageInfo const& other ) const { return sequence < other.sequence; } private: static unsigned int globalCount; }; struct MessageBuilder { MessageBuilder( std::string const& macroName, SourceLineInfo const& lineInfo, ResultWas::OfType type ) : m_info( macroName, lineInfo, type ) {} template<typename T> MessageBuilder& operator << ( T const& value ) { m_stream << value; return *this; } MessageInfo m_info; std::ostringstream m_stream; }; class ScopedMessage { public: ScopedMessage( MessageBuilder const& builder ); ScopedMessage( ScopedMessage const& other ); ~ScopedMessage(); MessageInfo m_info; }; } // end namespace Catch // #included from: catch_interfaces_capture.h #define TWOBLUECUBES_CATCH_INTERFACES_CAPTURE_H_INCLUDED #include <string> namespace Catch { class TestCase; class AssertionResult; struct AssertionInfo; struct SectionInfo; struct SectionEndInfo; struct MessageInfo; class ScopedMessageBuilder; struct Counts; struct IResultCapture { virtual ~IResultCapture(); virtual void assertionEnded( AssertionResult const& result ) = 0; virtual bool sectionStarted( SectionInfo const& sectionInfo, Counts& assertions ) = 0; virtual void sectionEnded( SectionEndInfo const& endInfo ) = 0; virtual void sectionEndedEarly( SectionEndInfo const& endInfo ) = 0; virtual void pushScopedMessage( MessageInfo const& message ) = 0; virtual void popScopedMessage( MessageInfo const& message ) = 0; virtual std::string getCurrentTestName() const = 0; virtual const AssertionResult* getLastResult() const = 0; virtual void handleFatalErrorCondition( std::string const& message ) = 0; }; IResultCapture& getResultCapture(); } // #included from: catch_debugger.h #define TWOBLUECUBES_CATCH_DEBUGGER_H_INCLUDED // #included from: catch_platform.h #define TWOBLUECUBES_CATCH_PLATFORM_H_INCLUDED #if defined(__MAC_OS_X_VERSION_MIN_REQUIRED) #define CATCH_PLATFORM_MAC #elif defined(__IPHONE_OS_VERSION_MIN_REQUIRED) #define CATCH_PLATFORM_IPHONE #elif defined(WIN32) || defined(__WIN32__) || defined(_WIN32) || defined(_MSC_VER) #define CATCH_PLATFORM_WINDOWS #endif #include <string> namespace Catch{ bool isDebuggerActive(); void writeToDebugConsole( std::string const& text ); } #ifdef CATCH_PLATFORM_MAC // The following code snippet based on: // http://cocoawithlove.com/2008/03/break-into-debugger.html #ifdef DEBUG #if defined(__ppc64__) || defined(__ppc__) #define CATCH_BREAK_INTO_DEBUGGER() \ if( Catch::isDebuggerActive() ) { \ __asm__("li r0, 20\nsc\nnop\nli r0, 37\nli r4, 2\nsc\nnop\n" \ : : : "memory","r0","r3","r4" ); \ } #else #define CATCH_BREAK_INTO_DEBUGGER() if( Catch::isDebuggerActive() ) {__asm__("int $3\n" : : );} #endif #endif #elif defined(_MSC_VER) #define CATCH_BREAK_INTO_DEBUGGER() if( Catch::isDebuggerActive() ) { __debugbreak(); } #elif defined(__MINGW32__) extern "C" __declspec(dllimport) void __stdcall DebugBreak(); #define CATCH_BREAK_INTO_DEBUGGER() if( Catch::isDebuggerActive() ) { DebugBreak(); } #endif #ifndef CATCH_BREAK_INTO_DEBUGGER #define CATCH_BREAK_INTO_DEBUGGER() Catch::alwaysTrue(); #endif // #included from: catch_interfaces_runner.h #define TWOBLUECUBES_CATCH_INTERFACES_RUNNER_H_INCLUDED namespace Catch { class TestCase; struct IRunner { virtual ~IRunner(); virtual bool aborting() const = 0; }; } /////////////////////////////////////////////////////////////////////////////// // In the event of a failure works out if the debugger needs to be invoked // and/or an exception thrown and takes appropriate action. // This needs to be done as a macro so the debugger will stop in the user // source code rather than in Catch library code #define INTERNAL_CATCH_REACT( resultBuilder ) \ if( resultBuilder.shouldDebugBreak() ) CATCH_BREAK_INTO_DEBUGGER(); \ resultBuilder.react(); /////////////////////////////////////////////////////////////////////////////// #define INTERNAL_CATCH_TEST( expr, resultDisposition, macroName ) \ do { \ Catch::ResultBuilder __catchResult( macroName, CATCH_INTERNAL_LINEINFO, #expr, resultDisposition ); \ try { \ CATCH_INTERNAL_SUPPRESS_PARENTHESES_WARNINGS \ ( __catchResult <= expr ).endExpression(); \ } \ catch( ... ) { \ __catchResult.useActiveException( Catch::ResultDisposition::Normal ); \ } \ INTERNAL_CATCH_REACT( __catchResult ) \ } while( Catch::isTrue( false && !!(expr) ) ) // expr here is never evaluated at runtime but it forces the compiler to give it a look /////////////////////////////////////////////////////////////////////////////// #define INTERNAL_CATCH_IF( expr, resultDisposition, macroName ) \ INTERNAL_CATCH_TEST( expr, resultDisposition, macroName ); \ if( Catch::getResultCapture().getLastResult()->succeeded() ) /////////////////////////////////////////////////////////////////////////////// #define INTERNAL_CATCH_ELSE( expr, resultDisposition, macroName ) \ INTERNAL_CATCH_TEST( expr, resultDisposition, macroName ); \ if( !Catch::getResultCapture().getLastResult()->succeeded() ) /////////////////////////////////////////////////////////////////////////////// #define INTERNAL_CATCH_NO_THROW( expr, resultDisposition, macroName ) \ do { \ Catch::ResultBuilder __catchResult( macroName, CATCH_INTERNAL_LINEINFO, #expr, resultDisposition ); \ try { \ expr; \ __catchResult.captureResult( Catch::ResultWas::Ok ); \ } \ catch( ... ) { \ __catchResult.useActiveException( resultDisposition ); \ } \ INTERNAL_CATCH_REACT( __catchResult ) \ } while( Catch::alwaysFalse() ) /////////////////////////////////////////////////////////////////////////////// #define INTERNAL_CATCH_THROWS( expr, resultDisposition, matcher, macroName ) \ do { \ Catch::ResultBuilder __catchResult( macroName, CATCH_INTERNAL_LINEINFO, #expr, resultDisposition, #matcher ); \ if( __catchResult.allowThrows() ) \ try { \ expr; \ __catchResult.captureResult( Catch::ResultWas::DidntThrowException ); \ } \ catch( ... ) { \ __catchResult.captureExpectedException( matcher ); \ } \ else \ __catchResult.captureResult( Catch::ResultWas::Ok ); \ INTERNAL_CATCH_REACT( __catchResult ) \ } while( Catch::alwaysFalse() ) /////////////////////////////////////////////////////////////////////////////// #define INTERNAL_CATCH_THROWS_AS( expr, exceptionType, resultDisposition, macroName ) \ do { \ Catch::ResultBuilder __catchResult( macroName, CATCH_INTERNAL_LINEINFO, #expr, resultDisposition ); \ if( __catchResult.allowThrows() ) \ try { \ expr; \ __catchResult.captureResult( Catch::ResultWas::DidntThrowException ); \ } \ catch( exceptionType ) { \ __catchResult.captureResult( Catch::ResultWas::Ok ); \ } \ catch( ... ) { \ __catchResult.useActiveException( resultDisposition ); \ } \ else \ __catchResult.captureResult( Catch::ResultWas::Ok ); \ INTERNAL_CATCH_REACT( __catchResult ) \ } while( Catch::alwaysFalse() ) /////////////////////////////////////////////////////////////////////////////// #ifdef CATCH_CONFIG_VARIADIC_MACROS #define INTERNAL_CATCH_MSG( messageType, resultDisposition, macroName, ... ) \ do { \ Catch::ResultBuilder __catchResult( macroName, CATCH_INTERNAL_LINEINFO, "", resultDisposition ); \ __catchResult << __VA_ARGS__ + ::Catch::StreamEndStop(); \ __catchResult.captureResult( messageType ); \ INTERNAL_CATCH_REACT( __catchResult ) \ } while( Catch::alwaysFalse() ) #else #define INTERNAL_CATCH_MSG( messageType, resultDisposition, macroName, log ) \ do { \ Catch::ResultBuilder __catchResult( macroName, CATCH_INTERNAL_LINEINFO, "", resultDisposition ); \ __catchResult << log + ::Catch::StreamEndStop(); \ __catchResult.captureResult( messageType ); \ INTERNAL_CATCH_REACT( __catchResult ) \ } while( Catch::alwaysFalse() ) #endif /////////////////////////////////////////////////////////////////////////////// #define INTERNAL_CATCH_INFO( log, macroName ) \ Catch::ScopedMessage INTERNAL_CATCH_UNIQUE_NAME( scopedMessage ) = Catch::MessageBuilder( macroName, CATCH_INTERNAL_LINEINFO, Catch::ResultWas::Info ) << log; /////////////////////////////////////////////////////////////////////////////// #define INTERNAL_CHECK_THAT( arg, matcher, resultDisposition, macroName ) \ do { \ Catch::ResultBuilder __catchResult( macroName, CATCH_INTERNAL_LINEINFO, #arg ", " #matcher, resultDisposition ); \ try { \ std::string matcherAsString = (matcher).toString(); \ __catchResult \ .setLhs( Catch::toString( arg ) ) \ .setRhs( matcherAsString == Catch::Detail::unprintableString ? #matcher : matcherAsString ) \ .setOp( "matches" ) \ .setResultType( (matcher).match( arg ) ); \ __catchResult.captureExpression(); \ } catch( ... ) { \ __catchResult.useActiveException( resultDisposition | Catch::ResultDisposition::ContinueOnFailure ); \ } \ INTERNAL_CATCH_REACT( __catchResult ) \ } while( Catch::alwaysFalse() ) // #included from: internal/catch_section.h #define TWOBLUECUBES_CATCH_SECTION_H_INCLUDED // #included from: catch_section_info.h #define TWOBLUECUBES_CATCH_SECTION_INFO_H_INCLUDED // #included from: catch_totals.hpp #define TWOBLUECUBES_CATCH_TOTALS_HPP_INCLUDED #include <cstddef> namespace Catch { struct Counts { Counts() : passed( 0 ), failed( 0 ), failedButOk( 0 ) {} Counts operator - ( Counts const& other ) const { Counts diff; diff.passed = passed - other.passed; diff.failed = failed - other.failed; diff.failedButOk = failedButOk - other.failedButOk; return diff; } Counts& operator += ( Counts const& other ) { passed += other.passed; failed += other.failed; failedButOk += other.failedButOk; return *this; } std::size_t total() const { return passed + failed + failedButOk; } bool allPassed() const { return failed == 0 && failedButOk == 0; } bool allOk() const { return failed == 0; } std::size_t passed; std::size_t failed; std::size_t failedButOk; }; struct Totals { Totals operator - ( Totals const& other ) const { Totals diff; diff.assertions = assertions - other.assertions; diff.testCases = testCases - other.testCases; return diff; } Totals delta( Totals const& prevTotals ) const { Totals diff = *this - prevTotals; if( diff.assertions.failed > 0 ) ++diff.testCases.failed; else if( diff.assertions.failedButOk > 0 ) ++diff.testCases.failedButOk; else ++diff.testCases.passed; return diff; } Totals& operator += ( Totals const& other ) { assertions += other.assertions; testCases += other.testCases; return *this; } Counts assertions; Counts testCases; }; } namespace Catch { struct SectionInfo { SectionInfo ( SourceLineInfo const& _lineInfo, std::string const& _name, std::string const& _description = std::string() ); std::string name; std::string description; SourceLineInfo lineInfo; }; struct SectionEndInfo { SectionEndInfo( SectionInfo const& _sectionInfo, Counts const& _prevAssertions, double _durationInSeconds ) : sectionInfo( _sectionInfo ), prevAssertions( _prevAssertions ), durationInSeconds( _durationInSeconds ) {} SectionInfo sectionInfo; Counts prevAssertions; double durationInSeconds; }; } // end namespace Catch // #included from: catch_timer.h #define TWOBLUECUBES_CATCH_TIMER_H_INCLUDED #ifdef CATCH_PLATFORM_WINDOWS typedef unsigned long long uint64_t; #else #include <stdint.h> #endif namespace Catch { class Timer { public: Timer() : m_ticks( 0 ) {} void start(); unsigned int getElapsedMicroseconds() const; unsigned int getElapsedMilliseconds() const; double getElapsedSeconds() const; private: uint64_t m_ticks; }; } // namespace Catch #include <string> namespace Catch { class Section : NonCopyable { public: Section( SectionInfo const& info ); ~Section(); // This indicates whether the section should be executed or not operator bool() const; private: SectionInfo m_info; std::string m_name; Counts m_assertions; bool m_sectionIncluded; Timer m_timer; }; } // end namespace Catch #ifdef CATCH_CONFIG_VARIADIC_MACROS #define INTERNAL_CATCH_SECTION( ... ) \ if( Catch::Section const& INTERNAL_CATCH_UNIQUE_NAME( catch_internal_Section ) = Catch::SectionInfo( CATCH_INTERNAL_LINEINFO, __VA_ARGS__ ) ) #else #define INTERNAL_CATCH_SECTION( name, desc ) \ if( Catch::Section const& INTERNAL_CATCH_UNIQUE_NAME( catch_internal_Section ) = Catch::SectionInfo( CATCH_INTERNAL_LINEINFO, name, desc ) ) #endif // #included from: internal/catch_generators.hpp #define TWOBLUECUBES_CATCH_GENERATORS_HPP_INCLUDED #include <iterator> #include <vector> #include <string> #include <stdlib.h> namespace Catch { template<typename T> struct IGenerator { virtual ~IGenerator() {} virtual T getValue( std::size_t index ) const = 0; virtual std::size_t size () const = 0; }; template<typename T> class BetweenGenerator : public IGenerator<T> { public: BetweenGenerator( T from, T to ) : m_from( from ), m_to( to ){} virtual T getValue( std::size_t index ) const { return m_from+static_cast<int>( index ); } virtual std::size_t size() const { return static_cast<std::size_t>( 1+m_to-m_from ); } private: T m_from; T m_to; }; template<typename T> class ValuesGenerator : public IGenerator<T> { public: ValuesGenerator(){} void add( T value ) { m_values.push_back( value ); } virtual T getValue( std::size_t index ) const { return m_values[index]; } virtual std::size_t size() const { return m_values.size(); } private: std::vector<T> m_values; }; template<typename T> class CompositeGenerator { public: CompositeGenerator() : m_totalSize( 0 ) {} // *** Move semantics, similar to auto_ptr *** CompositeGenerator( CompositeGenerator& other ) : m_fileInfo( other.m_fileInfo ), m_totalSize( 0 ) { move( other ); } CompositeGenerator& setFileInfo( const char* fileInfo ) { m_fileInfo = fileInfo; return *this; } ~CompositeGenerator() { deleteAll( m_composed ); } operator T () const { size_t overallIndex = getCurrentContext().getGeneratorIndex( m_fileInfo, m_totalSize ); typename std::vector<const IGenerator<T>*>::const_iterator it = m_composed.begin(); typename std::vector<const IGenerator<T>*>::const_iterator itEnd = m_composed.end(); for( size_t index = 0; it != itEnd; ++it ) { const IGenerator<T>* generator = *it; if( overallIndex >= index && overallIndex < index + generator->size() ) { return generator->getValue( overallIndex-index ); } index += generator->size(); } CATCH_INTERNAL_ERROR( "Indexed past end of generated range" ); return T(); // Suppress spurious "not all control paths return a value" warning in Visual Studio - if you know how to fix this please do so } void add( const IGenerator<T>* generator ) { m_totalSize += generator->size(); m_composed.push_back( generator ); } CompositeGenerator& then( CompositeGenerator& other ) { move( other ); return *this; } CompositeGenerator& then( T value ) { ValuesGenerator<T>* valuesGen = new ValuesGenerator<T>(); valuesGen->add( value ); add( valuesGen ); return *this; } private: void move( CompositeGenerator& other ) { std::copy( other.m_composed.begin(), other.m_composed.end(), std::back_inserter( m_composed ) ); m_totalSize += other.m_totalSize; other.m_composed.clear(); } std::vector<const IGenerator<T>*> m_composed; std::string m_fileInfo; size_t m_totalSize; }; namespace Generators { template<typename T> CompositeGenerator<T> between( T from, T to ) { CompositeGenerator<T> generators; generators.add( new BetweenGenerator<T>( from, to ) ); return generators; } template<typename T> CompositeGenerator<T> values( T val1, T val2 ) { CompositeGenerator<T> generators; ValuesGenerator<T>* valuesGen = new ValuesGenerator<T>(); valuesGen->add( val1 ); valuesGen->add( val2 ); generators.add( valuesGen ); return generators; } template<typename T> CompositeGenerator<T> values( T val1, T val2, T val3 ){ CompositeGenerator<T> generators; ValuesGenerator<T>* valuesGen = new ValuesGenerator<T>(); valuesGen->add( val1 ); valuesGen->add( val2 ); valuesGen->add( val3 ); generators.add( valuesGen ); return generators; } template<typename T> CompositeGenerator<T> values( T val1, T val2, T val3, T val4 ) { CompositeGenerator<T> generators; ValuesGenerator<T>* valuesGen = new ValuesGenerator<T>(); valuesGen->add( val1 ); valuesGen->add( val2 ); valuesGen->add( val3 ); valuesGen->add( val4 ); generators.add( valuesGen ); return generators; } } // end namespace Generators using namespace Generators; } // end namespace Catch #define INTERNAL_CATCH_LINESTR2( line ) #line #define INTERNAL_CATCH_LINESTR( line ) INTERNAL_CATCH_LINESTR2( line ) #define INTERNAL_CATCH_GENERATE( expr ) expr.setFileInfo( __FILE__ "(" INTERNAL_CATCH_LINESTR( __LINE__ ) ")" ) // #included from: internal/catch_interfaces_exception.h #define TWOBLUECUBES_CATCH_INTERFACES_EXCEPTION_H_INCLUDED #include <string> #include <vector> // #included from: catch_interfaces_registry_hub.h #define TWOBLUECUBES_CATCH_INTERFACES_REGISTRY_HUB_H_INCLUDED #include <string> namespace Catch { class TestCase; struct ITestCaseRegistry; struct IExceptionTranslatorRegistry; struct IExceptionTranslator; struct IReporterRegistry; struct IReporterFactory; struct IRegistryHub { virtual ~IRegistryHub(); virtual IReporterRegistry const& getReporterRegistry() const = 0; virtual ITestCaseRegistry const& getTestCaseRegistry() const = 0; virtual IExceptionTranslatorRegistry& getExceptionTranslatorRegistry() = 0; }; struct IMutableRegistryHub { virtual ~IMutableRegistryHub(); virtual void registerReporter( std::string const& name, Ptr<IReporterFactory> const& factory ) = 0; virtual void registerListener( Ptr<IReporterFactory> const& factory ) = 0; virtual void registerTest( TestCase const& testInfo ) = 0; virtual void registerTranslator( const IExceptionTranslator* translator ) = 0; }; IRegistryHub& getRegistryHub(); IMutableRegistryHub& getMutableRegistryHub(); void cleanUp(); std::string translateActiveException(); } namespace Catch { typedef std::string(*exceptionTranslateFunction)(); struct IExceptionTranslator; typedef std::vector<const IExceptionTranslator*> ExceptionTranslators; struct IExceptionTranslator { virtual ~IExceptionTranslator(); virtual std::string translate( ExceptionTranslators::const_iterator it, ExceptionTranslators::const_iterator itEnd ) const = 0; }; struct IExceptionTranslatorRegistry { virtual ~IExceptionTranslatorRegistry(); virtual std::string translateActiveException() const = 0; }; class ExceptionTranslatorRegistrar { template<typename T> class ExceptionTranslator : public IExceptionTranslator { public: ExceptionTranslator( std::string(*translateFunction)( T& ) ) : m_translateFunction( translateFunction ) {} virtual std::string translate( ExceptionTranslators::const_iterator it, ExceptionTranslators::const_iterator itEnd ) const CATCH_OVERRIDE { try { if( it == itEnd ) throw; else return (*it)->translate( it+1, itEnd ); } catch( T& ex ) { return m_translateFunction( ex ); } } protected: std::string(*m_translateFunction)( T& ); }; public: template<typename T> ExceptionTranslatorRegistrar( std::string(*translateFunction)( T& ) ) { getMutableRegistryHub().registerTranslator ( new ExceptionTranslator<T>( translateFunction ) ); } }; } /////////////////////////////////////////////////////////////////////////////// #define INTERNAL_CATCH_TRANSLATE_EXCEPTION2( translatorName, signature ) \ static std::string translatorName( signature ); \ namespace{ Catch::ExceptionTranslatorRegistrar INTERNAL_CATCH_UNIQUE_NAME( catch_internal_ExceptionRegistrar )( &translatorName ); }\ static std::string translatorName( signature ) #define INTERNAL_CATCH_TRANSLATE_EXCEPTION( signature ) INTERNAL_CATCH_TRANSLATE_EXCEPTION2( INTERNAL_CATCH_UNIQUE_NAME( catch_internal_ExceptionTranslator ), signature ) // #included from: internal/catch_approx.hpp #define TWOBLUECUBES_CATCH_APPROX_HPP_INCLUDED #include <cmath> #include <limits> namespace Catch { namespace Detail { class Approx { public: explicit Approx ( double value ) : m_epsilon( std::numeric_limits<float>::epsilon()*100 ), m_scale( 1.0 ), m_value( value ) {} Approx( Approx const& other ) : m_epsilon( other.m_epsilon ), m_scale( other.m_scale ), m_value( other.m_value ) {} static Approx custom() { return Approx( 0 ); } Approx operator()( double value ) { Approx approx( value ); approx.epsilon( m_epsilon ); approx.scale( m_scale ); return approx; } friend bool operator == ( double lhs, Approx const& rhs ) { // Thanks to Richard Harris for his help refining this formula return fabs( lhs - rhs.m_value ) < rhs.m_epsilon * (rhs.m_scale + (std::max)( fabs(lhs), fabs(rhs.m_value) ) ); } friend bool operator == ( Approx const& lhs, double rhs ) { return operator==( rhs, lhs ); } friend bool operator != ( double lhs, Approx const& rhs ) { return !operator==( lhs, rhs ); } friend bool operator != ( Approx const& lhs, double rhs ) { return !operator==( rhs, lhs ); } Approx& epsilon( double newEpsilon ) { m_epsilon = newEpsilon; return *this; } Approx& scale( double newScale ) { m_scale = newScale; return *this; } std::string toString() const { std::ostringstream oss; oss << "Approx( " << Catch::toString( m_value ) << " )"; return oss.str(); } private: double m_epsilon; double m_scale; double m_value; }; } template<> inline std::string toString<Detail::Approx>( Detail::Approx const& value ) { return value.toString(); } } // end namespace Catch // #included from: internal/catch_interfaces_tag_alias_registry.h #define TWOBLUECUBES_CATCH_INTERFACES_TAG_ALIAS_REGISTRY_H_INCLUDED // #included from: catch_tag_alias.h #define TWOBLUECUBES_CATCH_TAG_ALIAS_H_INCLUDED #include <string> namespace Catch { struct TagAlias { TagAlias( std::string _tag, SourceLineInfo _lineInfo ) : tag( _tag ), lineInfo( _lineInfo ) {} std::string tag; SourceLineInfo lineInfo; }; struct RegistrarForTagAliases { RegistrarForTagAliases( char const* alias, char const* tag, SourceLineInfo const& lineInfo ); }; } // end namespace Catch #define CATCH_REGISTER_TAG_ALIAS( alias, spec ) namespace{ Catch::RegistrarForTagAliases INTERNAL_CATCH_UNIQUE_NAME( AutoRegisterTagAlias )( alias, spec, CATCH_INTERNAL_LINEINFO ); } // #included from: catch_option.hpp #define TWOBLUECUBES_CATCH_OPTION_HPP_INCLUDED namespace Catch { // An optional type template<typename T> class Option { public: Option() : nullableValue( CATCH_NULL ) {} Option( T const& _value ) : nullableValue( new( storage ) T( _value ) ) {} Option( Option const& _other ) : nullableValue( _other ? new( storage ) T( *_other ) : CATCH_NULL ) {} ~Option() { reset(); } Option& operator= ( Option const& _other ) { if( &_other != this ) { reset(); if( _other ) nullableValue = new( storage ) T( *_other ); } return *this; } Option& operator = ( T const& _value ) { reset(); nullableValue = new( storage ) T( _value ); return *this; } void reset() { if( nullableValue ) nullableValue->~T(); nullableValue = CATCH_NULL; } T& operator*() { return *nullableValue; } T const& operator*() const { return *nullableValue; } T* operator->() { return nullableValue; } const T* operator->() const { return nullableValue; } T valueOr( T const& defaultValue ) const { return nullableValue ? *nullableValue : defaultValue; } bool some() const { return nullableValue != CATCH_NULL; } bool none() const { return nullableValue == CATCH_NULL; } bool operator !() const { return nullableValue == CATCH_NULL; } operator SafeBool::type() const { return SafeBool::makeSafe( some() ); } private: T* nullableValue; char storage[sizeof(T)]; }; } // end namespace Catch namespace Catch { struct ITagAliasRegistry { virtual ~ITagAliasRegistry(); virtual Option<TagAlias> find( std::string const& alias ) const = 0; virtual std::string expandAliases( std::string const& unexpandedTestSpec ) const = 0; static ITagAliasRegistry const& get(); }; } // end namespace Catch // These files are included here so the single_include script doesn't put them // in the conditionally compiled sections // #included from: internal/catch_test_case_info.h #define TWOBLUECUBES_CATCH_TEST_CASE_INFO_H_INCLUDED #include <string> #include <set> #ifdef __clang__ #pragma clang diagnostic push #pragma clang diagnostic ignored "-Wpadded" #endif namespace Catch { struct ITestCase; struct TestCaseInfo { enum SpecialProperties{ None = 0, IsHidden = 1 << 1, ShouldFail = 1 << 2, MayFail = 1 << 3, Throws = 1 << 4 }; TestCaseInfo( std::string const& _name, std::string const& _className, std::string const& _description, std::set<std::string> const& _tags, SourceLineInfo const& _lineInfo ); TestCaseInfo( TestCaseInfo const& other ); friend void setTags( TestCaseInfo& testCaseInfo, std::set<std::string> const& tags ); bool isHidden() const; bool throws() const; bool okToFail() const; bool expectedToFail() const; std::string name; std::string className; std::string description; std::set<std::string> tags; std::set<std::string> lcaseTags; std::string tagsAsString; SourceLineInfo lineInfo; SpecialProperties properties; }; class TestCase : public TestCaseInfo { public: TestCase( ITestCase* testCase, TestCaseInfo const& info ); TestCase( TestCase const& other ); TestCase withName( std::string const& _newName ) const; void invoke() const; TestCaseInfo const& getTestCaseInfo() const; void swap( TestCase& other ); bool operator == ( TestCase const& other ) const; bool operator < ( TestCase const& other ) const; TestCase& operator = ( TestCase const& other ); private: Ptr<ITestCase> test; }; TestCase makeTestCase( ITestCase* testCase, std::string const& className, std::string const& name, std::string const& description, SourceLineInfo const& lineInfo ); } #ifdef __clang__ #pragma clang diagnostic pop #endif #ifdef __OBJC__ // #included from: internal/catch_objc.hpp #define TWOBLUECUBES_CATCH_OBJC_HPP_INCLUDED #import <objc/runtime.h> #include <string> // NB. Any general catch headers included here must be included // in catch.hpp first to make sure they are included by the single // header for non obj-usage /////////////////////////////////////////////////////////////////////////////// // This protocol is really only here for (self) documenting purposes, since // all its methods are optional. @protocol OcFixture @optional -(void) setUp; -(void) tearDown; @end namespace Catch { class OcMethod : public SharedImpl<ITestCase> { public: OcMethod( Class cls, SEL sel ) : m_cls( cls ), m_sel( sel ) {} virtual void invoke() const { id obj = [[m_cls alloc] init]; performOptionalSelector( obj, @selector(setUp) ); performOptionalSelector( obj, m_sel ); performOptionalSelector( obj, @selector(tearDown) ); arcSafeRelease( obj ); } private: virtual ~OcMethod() {} Class m_cls; SEL m_sel; }; namespace Detail{ inline std::string getAnnotation( Class cls, std::string const& annotationName, std::string const& testCaseName ) { NSString* selStr = [[NSString alloc] initWithFormat:@"Catch_%s_%s", annotationName.c_str(), testCaseName.c_str()]; SEL sel = NSSelectorFromString( selStr ); arcSafeRelease( selStr ); id value = performOptionalSelector( cls, sel ); if( value ) return [(NSString*)value UTF8String]; return ""; } } inline size_t registerTestMethods() { size_t noTestMethods = 0; int noClasses = objc_getClassList( CATCH_NULL, 0 ); Class* classes = (CATCH_UNSAFE_UNRETAINED Class *)malloc( sizeof(Class) * noClasses); objc_getClassList( classes, noClasses ); for( int c = 0; c < noClasses; c++ ) { Class cls = classes[c]; { u_int count; Method* methods = class_copyMethodList( cls, &count ); for( u_int m = 0; m < count ; m++ ) { SEL selector = method_getName(methods[m]); std::string methodName = sel_getName(selector); if( startsWith( methodName, "Catch_TestCase_" ) ) { std::string testCaseName = methodName.substr( 15 ); std::string name = Detail::getAnnotation( cls, "Name", testCaseName ); std::string desc = Detail::getAnnotation( cls, "Description", testCaseName ); const char* className = class_getName( cls ); getMutableRegistryHub().registerTest( makeTestCase( new OcMethod( cls, selector ), className, name.c_str(), desc.c_str(), SourceLineInfo() ) ); noTestMethods++; } } free(methods); } } return noTestMethods; } namespace Matchers { namespace Impl { namespace NSStringMatchers { template<typename MatcherT> struct StringHolder : MatcherImpl<MatcherT, NSString*>{ StringHolder( NSString* substr ) : m_substr( [substr copy] ){} StringHolder( StringHolder const& other ) : m_substr( [other.m_substr copy] ){} StringHolder() { arcSafeRelease( m_substr ); } NSString* m_substr; }; struct Equals : StringHolder<Equals> { Equals( NSString* substr ) : StringHolder( substr ){} virtual bool match( ExpressionType const& str ) const { return (str != nil || m_substr == nil ) && [str isEqualToString:m_substr]; } virtual std::string toString() const { return "equals string: " + Catch::toString( m_substr ); } }; struct Contains : StringHolder<Contains> { Contains( NSString* substr ) : StringHolder( substr ){} virtual bool match( ExpressionType const& str ) const { return (str != nil || m_substr == nil ) && [str rangeOfString:m_substr].location != NSNotFound; } virtual std::string toString() const { return "contains string: " + Catch::toString( m_substr ); } }; struct StartsWith : StringHolder<StartsWith> { StartsWith( NSString* substr ) : StringHolder( substr ){} virtual bool match( ExpressionType const& str ) const { return (str != nil || m_substr == nil ) && [str rangeOfString:m_substr].location == 0; } virtual std::string toString() const { return "starts with: " + Catch::toString( m_substr ); } }; struct EndsWith : StringHolder<EndsWith> { EndsWith( NSString* substr ) : StringHolder( substr ){} virtual bool match( ExpressionType const& str ) const { return (str != nil || m_substr == nil ) && [str rangeOfString:m_substr].location == [str length] - [m_substr length]; } virtual std::string toString() const { return "ends with: " + Catch::toString( m_substr ); } }; } // namespace NSStringMatchers } // namespace Impl inline Impl::NSStringMatchers::Equals Equals( NSString* substr ){ return Impl::NSStringMatchers::Equals( substr ); } inline Impl::NSStringMatchers::Contains Contains( NSString* substr ){ return Impl::NSStringMatchers::Contains( substr ); } inline Impl::NSStringMatchers::StartsWith StartsWith( NSString* substr ){ return Impl::NSStringMatchers::StartsWith( substr ); } inline Impl::NSStringMatchers::EndsWith EndsWith( NSString* substr ){ return Impl::NSStringMatchers::EndsWith( substr ); } } // namespace Matchers using namespace Matchers; } // namespace Catch /////////////////////////////////////////////////////////////////////////////// #define OC_TEST_CASE( name, desc )\ +(NSString*) INTERNAL_CATCH_UNIQUE_NAME( Catch_Name_test ) \ {\ return @ name; \ }\ +(NSString*) INTERNAL_CATCH_UNIQUE_NAME( Catch_Description_test ) \ { \ return @ desc; \ } \ -(void) INTERNAL_CATCH_UNIQUE_NAME( Catch_TestCase_test ) #endif #ifdef CATCH_IMPL // #included from: internal/catch_impl.hpp #define TWOBLUECUBES_CATCH_IMPL_HPP_INCLUDED // Collect all the implementation files together here // These are the equivalent of what would usually be cpp files #ifdef __clang__ #pragma clang diagnostic push #pragma clang diagnostic ignored "-Wweak-vtables" #endif // #included from: ../catch_session.hpp #define TWOBLUECUBES_CATCH_RUNNER_HPP_INCLUDED // #included from: internal/catch_commandline.hpp #define TWOBLUECUBES_CATCH_COMMANDLINE_HPP_INCLUDED // #included from: catch_config.hpp #define TWOBLUECUBES_CATCH_CONFIG_HPP_INCLUDED // #included from: catch_test_spec_parser.hpp #define TWOBLUECUBES_CATCH_TEST_SPEC_PARSER_HPP_INCLUDED #ifdef __clang__ #pragma clang diagnostic push #pragma clang diagnostic ignored "-Wpadded" #endif // #included from: catch_test_spec.hpp #define TWOBLUECUBES_CATCH_TEST_SPEC_HPP_INCLUDED #ifdef __clang__ #pragma clang diagnostic push #pragma clang diagnostic ignored "-Wpadded" #endif // #included from: catch_wildcard_pattern.hpp #define TWOBLUECUBES_CATCH_WILDCARD_PATTERN_HPP_INCLUDED namespace Catch { class WildcardPattern { enum WildcardPosition { NoWildcard = 0, WildcardAtStart = 1, WildcardAtEnd = 2, WildcardAtBothEnds = WildcardAtStart | WildcardAtEnd }; public: WildcardPattern( std::string const& pattern, CaseSensitive::Choice caseSensitivity ) : m_caseSensitivity( caseSensitivity ), m_wildcard( NoWildcard ), m_pattern( adjustCase( pattern ) ) { if( startsWith( m_pattern, "*" ) ) { m_pattern = m_pattern.substr( 1 ); m_wildcard = WildcardAtStart; } if( endsWith( m_pattern, "*" ) ) { m_pattern = m_pattern.substr( 0, m_pattern.size()-1 ); m_wildcard = static_cast<WildcardPosition>( m_wildcard | WildcardAtEnd ); } } virtual ~WildcardPattern(); virtual bool matches( std::string const& str ) const { switch( m_wildcard ) { case NoWildcard: return m_pattern == adjustCase( str ); case WildcardAtStart: return endsWith( adjustCase( str ), m_pattern ); case WildcardAtEnd: return startsWith( adjustCase( str ), m_pattern ); case WildcardAtBothEnds: return contains( adjustCase( str ), m_pattern ); } #ifdef __clang__ #pragma clang diagnostic push #pragma clang diagnostic ignored "-Wunreachable-code" #endif throw std::logic_error( "Unknown enum" ); #ifdef __clang__ #pragma clang diagnostic pop #endif } private: std::string adjustCase( std::string const& str ) const { return m_caseSensitivity == CaseSensitive::No ? toLower( str ) : str; } CaseSensitive::Choice m_caseSensitivity; WildcardPosition m_wildcard; std::string m_pattern; }; } #include <string> #include <vector> namespace Catch { class TestSpec { struct Pattern : SharedImpl<> { virtual ~Pattern(); virtual bool matches( TestCaseInfo const& testCase ) const = 0; }; class NamePattern : public Pattern { public: NamePattern( std::string const& name ) : m_wildcardPattern( toLower( name ), CaseSensitive::No ) {} virtual ~NamePattern(); virtual bool matches( TestCaseInfo const& testCase ) const { return m_wildcardPattern.matches( toLower( testCase.name ) ); } private: WildcardPattern m_wildcardPattern; }; class TagPattern : public Pattern { public: TagPattern( std::string const& tag ) : m_tag( toLower( tag ) ) {} virtual ~TagPattern(); virtual bool matches( TestCaseInfo const& testCase ) const { return testCase.lcaseTags.find( m_tag ) != testCase.lcaseTags.end(); } private: std::string m_tag; }; class ExcludedPattern : public Pattern { public: ExcludedPattern( Ptr<Pattern> const& underlyingPattern ) : m_underlyingPattern( underlyingPattern ) {} virtual ~ExcludedPattern(); virtual bool matches( TestCaseInfo const& testCase ) const { return !m_underlyingPattern->matches( testCase ); } private: Ptr<Pattern> m_underlyingPattern; }; struct Filter { std::vector<Ptr<Pattern> > m_patterns; bool matches( TestCaseInfo const& testCase ) const { // All patterns in a filter must match for the filter to be a match for( std::vector<Ptr<Pattern> >::const_iterator it = m_patterns.begin(), itEnd = m_patterns.end(); it != itEnd; ++it ) { if( !(*it)->matches( testCase ) ) return false; } return true; } }; public: bool hasFilters() const { return !m_filters.empty(); } bool matches( TestCaseInfo const& testCase ) const { // A TestSpec matches if any filter matches for( std::vector<Filter>::const_iterator it = m_filters.begin(), itEnd = m_filters.end(); it != itEnd; ++it ) if( it->matches( testCase ) ) return true; return false; } private: std::vector<Filter> m_filters; friend class TestSpecParser; }; } #ifdef __clang__ #pragma clang diagnostic pop #endif namespace Catch { class TestSpecParser { enum Mode{ None, Name, QuotedName, Tag }; Mode m_mode; bool m_exclusion; std::size_t m_start, m_pos; std::string m_arg; TestSpec::Filter m_currentFilter; TestSpec m_testSpec; ITagAliasRegistry const* m_tagAliases; public: TestSpecParser( ITagAliasRegistry const& tagAliases ) : m_tagAliases( &tagAliases ) {} TestSpecParser& parse( std::string const& arg ) { m_mode = None; m_exclusion = false; m_start = std::string::npos; m_arg = m_tagAliases->expandAliases( arg ); for( m_pos = 0; m_pos < m_arg.size(); ++m_pos ) visitChar( m_arg[m_pos] ); if( m_mode == Name ) addPattern<TestSpec::NamePattern>(); return *this; } TestSpec testSpec() { addFilter(); return m_testSpec; } private: void visitChar( char c ) { if( m_mode == None ) { switch( c ) { case ' ': return; case '~': m_exclusion = true; return; case '[': return startNewMode( Tag, ++m_pos ); case '"': return startNewMode( QuotedName, ++m_pos ); default: startNewMode( Name, m_pos ); break; } } if( m_mode == Name ) { if( c == ',' ) { addPattern<TestSpec::NamePattern>(); addFilter(); } else if( c == '[' ) { if( subString() == "exclude:" ) m_exclusion = true; else addPattern<TestSpec::NamePattern>(); startNewMode( Tag, ++m_pos ); } } else if( m_mode == QuotedName && c == '"' ) addPattern<TestSpec::NamePattern>(); else if( m_mode == Tag && c == ']' ) addPattern<TestSpec::TagPattern>(); } void startNewMode( Mode mode, std::size_t start ) { m_mode = mode; m_start = start; } std::string subString() const { return m_arg.substr( m_start, m_pos - m_start ); } template<typename T> void addPattern() { std::string token = subString(); if( startsWith( token, "exclude:" ) ) { m_exclusion = true; token = token.substr( 8 ); } if( !token.empty() ) { Ptr<TestSpec::Pattern> pattern = new T( token ); if( m_exclusion ) pattern = new TestSpec::ExcludedPattern( pattern ); m_currentFilter.m_patterns.push_back( pattern ); } m_exclusion = false; m_mode = None; } void addFilter() { if( !m_currentFilter.m_patterns.empty() ) { m_testSpec.m_filters.push_back( m_currentFilter ); m_currentFilter = TestSpec::Filter(); } } }; inline TestSpec parseTestSpec( std::string const& arg ) { return TestSpecParser( ITagAliasRegistry::get() ).parse( arg ).testSpec(); } } // namespace Catch #ifdef __clang__ #pragma clang diagnostic pop #endif // #included from: catch_interfaces_config.h #define TWOBLUECUBES_CATCH_INTERFACES_CONFIG_H_INCLUDED #include <iostream> #include <string> #include <vector> namespace Catch { struct Verbosity { enum Level { NoOutput = 0, Quiet, Normal }; }; struct WarnAbout { enum What { Nothing = 0x00, NoAssertions = 0x01 }; }; struct ShowDurations { enum OrNot { DefaultForReporter, Always, Never }; }; struct RunTests { enum InWhatOrder { InDeclarationOrder, InLexicographicalOrder, InRandomOrder }; }; struct UseColour { enum YesOrNo { Auto, Yes, No }; }; class TestSpec; struct IConfig : IShared { virtual ~IConfig(); virtual bool allowThrows() const = 0; virtual std::ostream& stream() const = 0; virtual std::string name() const = 0; virtual bool includeSuccessfulResults() const = 0; virtual bool shouldDebugBreak() const = 0; virtual bool warnAboutMissingAssertions() const = 0; virtual int abortAfter() const = 0; virtual bool showInvisibles() const = 0; virtual ShowDurations::OrNot showDurations() const = 0; virtual TestSpec const& testSpec() const = 0; virtual RunTests::InWhatOrder runOrder() const = 0; virtual unsigned int rngSeed() const = 0; virtual UseColour::YesOrNo useColour() const = 0; }; } // #included from: catch_stream.h #define TWOBLUECUBES_CATCH_STREAM_H_INCLUDED // #included from: catch_streambuf.h #define TWOBLUECUBES_CATCH_STREAMBUF_H_INCLUDED #include <streambuf> namespace Catch { class StreamBufBase : public std::streambuf { public: virtual ~StreamBufBase() CATCH_NOEXCEPT; }; } #include <streambuf> #include <ostream> #include <fstream> #include <memory> namespace Catch { std::ostream& cout(); std::ostream& cerr(); struct IStream { virtual ~IStream() CATCH_NOEXCEPT; virtual std::ostream& stream() const = 0; }; class FileStream : public IStream { mutable std::ofstream m_ofs; public: FileStream( std::string const& filename ); virtual ~FileStream() CATCH_NOEXCEPT; public: // IStream virtual std::ostream& stream() const CATCH_OVERRIDE; }; class CoutStream : public IStream { mutable std::ostream m_os; public: CoutStream(); virtual ~CoutStream() CATCH_NOEXCEPT; public: // IStream virtual std::ostream& stream() const CATCH_OVERRIDE; }; class DebugOutStream : public IStream { CATCH_AUTO_PTR( StreamBufBase ) m_streamBuf; mutable std::ostream m_os; public: DebugOutStream(); virtual ~DebugOutStream() CATCH_NOEXCEPT; public: // IStream virtual std::ostream& stream() const CATCH_OVERRIDE; }; } #include <memory> #include <vector> #include <string> #include <iostream> #include <ctime> #ifndef CATCH_CONFIG_CONSOLE_WIDTH #define CATCH_CONFIG_CONSOLE_WIDTH 80 #endif namespace Catch { struct ConfigData { ConfigData() : listTests( false ), listTags( false ), listReporters( false ), listTestNamesOnly( false ), showSuccessfulTests( false ), shouldDebugBreak( false ), noThrow( false ), showHelp( false ), showInvisibles( false ), filenamesAsTags( false ), abortAfter( -1 ), rngSeed( 0 ), verbosity( Verbosity::Normal ), warnings( WarnAbout::Nothing ), showDurations( ShowDurations::DefaultForReporter ), runOrder( RunTests::InDeclarationOrder ), useColour( UseColour::Auto ) {} bool listTests; bool listTags; bool listReporters; bool listTestNamesOnly; bool showSuccessfulTests; bool shouldDebugBreak; bool noThrow; bool showHelp; bool showInvisibles; bool filenamesAsTags; int abortAfter; unsigned int rngSeed; Verbosity::Level verbosity; WarnAbout::What warnings; ShowDurations::OrNot showDurations; RunTests::InWhatOrder runOrder; UseColour::YesOrNo useColour; std::string outputFilename; std::string name; std::string processName; std::vector<std::string> reporterNames; std::vector<std::string> testsOrTags; }; class Config : public SharedImpl<IConfig> { private: Config( Config const& other ); Config& operator = ( Config const& other ); virtual void dummy(); public: Config() {} Config( ConfigData const& data ) : m_data( data ), m_stream( openStream() ) { if( !data.testsOrTags.empty() ) { TestSpecParser parser( ITagAliasRegistry::get() ); for( std::size_t i = 0; i < data.testsOrTags.size(); ++i ) parser.parse( data.testsOrTags[i] ); m_testSpec = parser.testSpec(); } } virtual ~Config() { } std::string const& getFilename() const { return m_data.outputFilename ; } bool listTests() const { return m_data.listTests; } bool listTestNamesOnly() const { return m_data.listTestNamesOnly; } bool listTags() const { return m_data.listTags; } bool listReporters() const { return m_data.listReporters; } std::string getProcessName() const { return m_data.processName; } bool shouldDebugBreak() const { return m_data.shouldDebugBreak; } std::vector<std::string> getReporterNames() const { return m_data.reporterNames; } int abortAfter() const { return m_data.abortAfter; } TestSpec const& testSpec() const { return m_testSpec; } bool showHelp() const { return m_data.showHelp; } bool showInvisibles() const { return m_data.showInvisibles; } // IConfig interface virtual bool allowThrows() const { return !m_data.noThrow; } virtual std::ostream& stream() const { return m_stream->stream(); } virtual std::string name() const { return m_data.name.empty() ? m_data.processName : m_data.name; } virtual bool includeSuccessfulResults() const { return m_data.showSuccessfulTests; } virtual bool warnAboutMissingAssertions() const { return m_data.warnings & WarnAbout::NoAssertions; } virtual ShowDurations::OrNot showDurations() const { return m_data.showDurations; } virtual RunTests::InWhatOrder runOrder() const { return m_data.runOrder; } virtual unsigned int rngSeed() const { return m_data.rngSeed; } virtual UseColour::YesOrNo useColour() const { return m_data.useColour; } private: IStream const* openStream() { if( m_data.outputFilename.empty() ) return new CoutStream(); else if( m_data.outputFilename[0] == '%' ) { if( m_data.outputFilename == "%debug" ) return new DebugOutStream(); else throw std::domain_error( "Unrecognised stream: " + m_data.outputFilename ); } else return new FileStream( m_data.outputFilename ); } ConfigData m_data; CATCH_AUTO_PTR( IStream const ) m_stream; TestSpec m_testSpec; }; } // end namespace Catch // #included from: catch_clara.h #define TWOBLUECUBES_CATCH_CLARA_H_INCLUDED // Use Catch's value for console width (store Clara's off to the side, if present) #ifdef CLARA_CONFIG_CONSOLE_WIDTH #define CATCH_TEMP_CLARA_CONFIG_CONSOLE_WIDTH CLARA_CONFIG_CONSOLE_WIDTH #undef CLARA_CONFIG_CONSOLE_WIDTH #endif #define CLARA_CONFIG_CONSOLE_WIDTH CATCH_CONFIG_CONSOLE_WIDTH // Declare Clara inside the Catch namespace #define STITCH_CLARA_OPEN_NAMESPACE namespace Catch { // #included from: ../external/clara.h // Version 0.0.2.4 // Only use header guard if we are not using an outer namespace #if !defined(TWOBLUECUBES_CLARA_H_INCLUDED) || defined(STITCH_CLARA_OPEN_NAMESPACE) #ifndef STITCH_CLARA_OPEN_NAMESPACE #define TWOBLUECUBES_CLARA_H_INCLUDED #define STITCH_CLARA_OPEN_NAMESPACE #define STITCH_CLARA_CLOSE_NAMESPACE #else #define STITCH_CLARA_CLOSE_NAMESPACE } #endif #define STITCH_TBC_TEXT_FORMAT_OPEN_NAMESPACE STITCH_CLARA_OPEN_NAMESPACE // ----------- #included from tbc_text_format.h ----------- // Only use header guard if we are not using an outer namespace #if !defined(TBC_TEXT_FORMAT_H_INCLUDED) || defined(STITCH_TBC_TEXT_FORMAT_OUTER_NAMESPACE) #ifndef STITCH_TBC_TEXT_FORMAT_OUTER_NAMESPACE #define TBC_TEXT_FORMAT_H_INCLUDED #endif #include <string> #include <vector> #include <sstream> #include <algorithm> // Use optional outer namespace #ifdef STITCH_TBC_TEXT_FORMAT_OUTER_NAMESPACE namespace STITCH_TBC_TEXT_FORMAT_OUTER_NAMESPACE { #endif namespace Tbc { #ifdef TBC_TEXT_FORMAT_CONSOLE_WIDTH const unsigned int consoleWidth = TBC_TEXT_FORMAT_CONSOLE_WIDTH; #else const unsigned int consoleWidth = 80; #endif struct TextAttributes { TextAttributes() : initialIndent( std::string::npos ), indent( 0 ), width( consoleWidth-1 ), tabChar( '\t' ) {} TextAttributes& setInitialIndent( std::size_t _value ) { initialIndent = _value; return *this; } TextAttributes& setIndent( std::size_t _value ) { indent = _value; return *this; } TextAttributes& setWidth( std::size_t _value ) { width = _value; return *this; } TextAttributes& setTabChar( char _value ) { tabChar = _value; return *this; } std::size_t initialIndent; // indent of first line, or npos std::size_t indent; // indent of subsequent lines, or all if initialIndent is npos std::size_t width; // maximum width of text, including indent. Longer text will wrap char tabChar; // If this char is seen the indent is changed to current pos }; class Text { public: Text( std::string const& _str, TextAttributes const& _attr = TextAttributes() ) : attr( _attr ) { std::string wrappableChars = " [({.,/|\\-"; std::size_t indent = _attr.initialIndent != std::string::npos ? _attr.initialIndent : _attr.indent; std::string remainder = _str; while( !remainder.empty() ) { if( lines.size() >= 1000 ) { lines.push_back( "... message truncated due to excessive size" ); return; } std::size_t tabPos = std::string::npos; std::size_t width = (std::min)( remainder.size(), _attr.width - indent ); std::size_t pos = remainder.find_first_of( '\n' ); if( pos <= width ) { width = pos; } pos = remainder.find_last_of( _attr.tabChar, width ); if( pos != std::string::npos ) { tabPos = pos; if( remainder[width] == '\n' ) width--; remainder = remainder.substr( 0, tabPos ) + remainder.substr( tabPos+1 ); } if( width == remainder.size() ) { spliceLine( indent, remainder, width ); } else if( remainder[width] == '\n' ) { spliceLine( indent, remainder, width ); if( width <= 1 || remainder.size() != 1 ) remainder = remainder.substr( 1 ); indent = _attr.indent; } else { pos = remainder.find_last_of( wrappableChars, width ); if( pos != std::string::npos && pos > 0 ) { spliceLine( indent, remainder, pos ); if( remainder[0] == ' ' ) remainder = remainder.substr( 1 ); } else { spliceLine( indent, remainder, width-1 ); lines.back() += "-"; } if( lines.size() == 1 ) indent = _attr.indent; if( tabPos != std::string::npos ) indent += tabPos; } } } void spliceLine( std::size_t _indent, std::string& _remainder, std::size_t _pos ) { lines.push_back( std::string( _indent, ' ' ) + _remainder.substr( 0, _pos ) ); _remainder = _remainder.substr( _pos ); } typedef std::vector<std::string>::const_iterator const_iterator; const_iterator begin() const { return lines.begin(); } const_iterator end() const { return lines.end(); } std::string const& last() const { return lines.back(); } std::size_t size() const { return lines.size(); } std::string const& operator[]( std::size_t _index ) const { return lines[_index]; } std::string toString() const { std::ostringstream oss; oss << *this; return oss.str(); } inline friend std::ostream& operator << ( std::ostream& _stream, Text const& _text ) { for( Text::const_iterator it = _text.begin(), itEnd = _text.end(); it != itEnd; ++it ) { if( it != _text.begin() ) _stream << "\n"; _stream << *it; } return _stream; } private: std::string str; TextAttributes attr; std::vector<std::string> lines; }; } // end namespace Tbc #ifdef STITCH_TBC_TEXT_FORMAT_OUTER_NAMESPACE } // end outer namespace #endif #endif // TBC_TEXT_FORMAT_H_INCLUDED // ----------- end of #include from tbc_text_format.h ----------- // ........... back in clara.h #undef STITCH_TBC_TEXT_FORMAT_OPEN_NAMESPACE // ----------- #included from clara_compilers.h ----------- #ifndef TWOBLUECUBES_CLARA_COMPILERS_H_INCLUDED #define TWOBLUECUBES_CLARA_COMPILERS_H_INCLUDED // Detect a number of compiler features - mostly C++11/14 conformance - by compiler // The following features are defined: // // CLARA_CONFIG_CPP11_NULLPTR : is nullptr supported? // CLARA_CONFIG_CPP11_NOEXCEPT : is noexcept supported? // CLARA_CONFIG_CPP11_GENERATED_METHODS : The delete and default keywords for compiler generated methods // CLARA_CONFIG_CPP11_OVERRIDE : is override supported? // CLARA_CONFIG_CPP11_UNIQUE_PTR : is unique_ptr supported (otherwise use auto_ptr) // CLARA_CONFIG_CPP11_OR_GREATER : Is C++11 supported? // CLARA_CONFIG_VARIADIC_MACROS : are variadic macros supported? // In general each macro has a _NO_<feature name> form // (e.g. CLARA_CONFIG_CPP11_NO_NULLPTR) which disables the feature. // Many features, at point of detection, define an _INTERNAL_ macro, so they // can be combined, en-mass, with the _NO_ forms later. // All the C++11 features can be disabled with CLARA_CONFIG_NO_CPP11 #ifdef __clang__ #if __has_feature(cxx_nullptr) #define CLARA_INTERNAL_CONFIG_CPP11_NULLPTR #endif #if __has_feature(cxx_noexcept) #define CLARA_INTERNAL_CONFIG_CPP11_NOEXCEPT #endif #endif // __clang__ //////////////////////////////////////////////////////////////////////////////// // GCC #ifdef __GNUC__ #if __GNUC__ == 4 && __GNUC_MINOR__ >= 6 && defined(__GXX_EXPERIMENTAL_CXX0X__) #define CLARA_INTERNAL_CONFIG_CPP11_NULLPTR #endif // - otherwise more recent versions define __cplusplus >= 201103L // and will get picked up below #endif // __GNUC__ //////////////////////////////////////////////////////////////////////////////// // Visual C++ #ifdef _MSC_VER #if (_MSC_VER >= 1600) #define CLARA_INTERNAL_CONFIG_CPP11_NULLPTR #define CLARA_INTERNAL_CONFIG_CPP11_UNIQUE_PTR #endif #if (_MSC_VER >= 1900 ) // (VC++ 13 (VS2015)) #define CLARA_INTERNAL_CONFIG_CPP11_NOEXCEPT #define CLARA_INTERNAL_CONFIG_CPP11_GENERATED_METHODS #endif #endif // _MSC_VER //////////////////////////////////////////////////////////////////////////////// // C++ language feature support // catch all support for C++11 #if defined(__cplusplus) && __cplusplus >= 201103L #define CLARA_CPP11_OR_GREATER #if !defined(CLARA_INTERNAL_CONFIG_CPP11_NULLPTR) #define CLARA_INTERNAL_CONFIG_CPP11_NULLPTR #endif #ifndef CLARA_INTERNAL_CONFIG_CPP11_NOEXCEPT #define CLARA_INTERNAL_CONFIG_CPP11_NOEXCEPT #endif #ifndef CLARA_INTERNAL_CONFIG_CPP11_GENERATED_METHODS #define CLARA_INTERNAL_CONFIG_CPP11_GENERATED_METHODS #endif #if !defined(CLARA_INTERNAL_CONFIG_CPP11_OVERRIDE) #define CLARA_INTERNAL_CONFIG_CPP11_OVERRIDE #endif #if !defined(CLARA_INTERNAL_CONFIG_CPP11_UNIQUE_PTR) #define CLARA_INTERNAL_CONFIG_CPP11_UNIQUE_PTR #endif #endif // __cplusplus >= 201103L // Now set the actual defines based on the above + anything the user has configured #if defined(CLARA_INTERNAL_CONFIG_CPP11_NULLPTR) && !defined(CLARA_CONFIG_CPP11_NO_NULLPTR) && !defined(CLARA_CONFIG_CPP11_NULLPTR) && !defined(CLARA_CONFIG_NO_CPP11) #define CLARA_CONFIG_CPP11_NULLPTR #endif #if defined(CLARA_INTERNAL_CONFIG_CPP11_NOEXCEPT) && !defined(CLARA_CONFIG_CPP11_NO_NOEXCEPT) && !defined(CLARA_CONFIG_CPP11_NOEXCEPT) && !defined(CLARA_CONFIG_NO_CPP11) #define CLARA_CONFIG_CPP11_NOEXCEPT #endif #if defined(CLARA_INTERNAL_CONFIG_CPP11_GENERATED_METHODS) && !defined(CLARA_CONFIG_CPP11_NO_GENERATED_METHODS) && !defined(CLARA_CONFIG_CPP11_GENERATED_METHODS) && !defined(CLARA_CONFIG_NO_CPP11) #define CLARA_CONFIG_CPP11_GENERATED_METHODS #endif #if defined(CLARA_INTERNAL_CONFIG_CPP11_OVERRIDE) && !defined(CLARA_CONFIG_NO_OVERRIDE) && !defined(CLARA_CONFIG_CPP11_OVERRIDE) && !defined(CLARA_CONFIG_NO_CPP11) #define CLARA_CONFIG_CPP11_OVERRIDE #endif #if defined(CLARA_INTERNAL_CONFIG_CPP11_UNIQUE_PTR) && !defined(CLARA_CONFIG_NO_UNIQUE_PTR) && !defined(CLARA_CONFIG_CPP11_UNIQUE_PTR) && !defined(CLARA_CONFIG_NO_CPP11) #define CLARA_CONFIG_CPP11_UNIQUE_PTR #endif // noexcept support: #if defined(CLARA_CONFIG_CPP11_NOEXCEPT) && !defined(CLARA_NOEXCEPT) #define CLARA_NOEXCEPT noexcept # define CLARA_NOEXCEPT_IS(x) noexcept(x) #else #define CLARA_NOEXCEPT throw() # define CLARA_NOEXCEPT_IS(x) #endif // nullptr support #ifdef CLARA_CONFIG_CPP11_NULLPTR #define CLARA_NULL nullptr #else #define CLARA_NULL NULL #endif // override support #ifdef CLARA_CONFIG_CPP11_OVERRIDE #define CLARA_OVERRIDE override #else #define CLARA_OVERRIDE #endif // unique_ptr support #ifdef CLARA_CONFIG_CPP11_UNIQUE_PTR # define CLARA_AUTO_PTR( T ) std::unique_ptr<T> #else # define CLARA_AUTO_PTR( T ) std::auto_ptr<T> #endif #endif // TWOBLUECUBES_CLARA_COMPILERS_H_INCLUDED // ----------- end of #include from clara_compilers.h ----------- // ........... back in clara.h #include <map> #include <stdexcept> #include <memory> #if defined(WIN32) || defined(__WIN32__) || defined(_WIN32) || defined(_MSC_VER) #define CLARA_PLATFORM_WINDOWS #endif // Use optional outer namespace #ifdef STITCH_CLARA_OPEN_NAMESPACE STITCH_CLARA_OPEN_NAMESPACE #endif namespace Clara { struct UnpositionalTag {}; extern UnpositionalTag _; #ifdef CLARA_CONFIG_MAIN UnpositionalTag _; #endif namespace Detail { #ifdef CLARA_CONSOLE_WIDTH const unsigned int consoleWidth = CLARA_CONFIG_CONSOLE_WIDTH; #else const unsigned int consoleWidth = 80; #endif using namespace Tbc; inline bool startsWith( std::string const& str, std::string const& prefix ) { return str.size() >= prefix.size() && str.substr( 0, prefix.size() ) == prefix; } template<typename T> struct RemoveConstRef{ typedef T type; }; template<typename T> struct RemoveConstRef<T&>{ typedef T type; }; template<typename T> struct RemoveConstRef<T const&>{ typedef T type; }; template<typename T> struct RemoveConstRef<T const>{ typedef T type; }; template<typename T> struct IsBool { static const bool value = false; }; template<> struct IsBool<bool> { static const bool value = true; }; template<typename T> void convertInto( std::string const& _source, T& _dest ) { std::stringstream ss; ss << _source; ss >> _dest; if( ss.fail() ) throw std::runtime_error( "Unable to convert " + _source + " to destination type" ); } inline void convertInto( std::string const& _source, std::string& _dest ) { _dest = _source; } char toLowerCh(char c) { return static_cast<char>( ::tolower( c ) ); } inline void convertInto( std::string const& _source, bool& _dest ) { std::string sourceLC = _source; std::transform( sourceLC.begin(), sourceLC.end(), sourceLC.begin(), toLowerCh ); if( sourceLC == "y" || sourceLC == "1" || sourceLC == "true" || sourceLC == "yes" || sourceLC == "on" ) _dest = true; else if( sourceLC == "n" || sourceLC == "0" || sourceLC == "false" || sourceLC == "no" || sourceLC == "off" ) _dest = false; else throw std::runtime_error( "Expected a boolean value but did not recognise:\n '" + _source + "'" ); } template<typename ConfigT> struct IArgFunction { virtual ~IArgFunction() {} #ifdef CLARA_CONFIG_CPP11_GENERATED_METHODS IArgFunction() = default; IArgFunction( IArgFunction const& ) = default; #endif virtual void set( ConfigT& config, std::string const& value ) const = 0; virtual bool takesArg() const = 0; virtual IArgFunction* clone() const = 0; }; template<typename ConfigT> class BoundArgFunction { public: BoundArgFunction() : functionObj( CLARA_NULL ) {} BoundArgFunction( IArgFunction<ConfigT>* _functionObj ) : functionObj( _functionObj ) {} BoundArgFunction( BoundArgFunction const& other ) : functionObj( other.functionObj ? other.functionObj->clone() : CLARA_NULL ) {} BoundArgFunction& operator = ( BoundArgFunction const& other ) { IArgFunction<ConfigT>* newFunctionObj = other.functionObj ? other.functionObj->clone() : CLARA_NULL; delete functionObj; functionObj = newFunctionObj; return *this; } ~BoundArgFunction() { delete functionObj; } void set( ConfigT& config, std::string const& value ) const { functionObj->set( config, value ); } bool takesArg() const { return functionObj->takesArg(); } bool isSet() const { return functionObj != CLARA_NULL; } private: IArgFunction<ConfigT>* functionObj; }; template<typename C> struct NullBinder : IArgFunction<C>{ virtual void set( C&, std::string const& ) const {} virtual bool takesArg() const { return true; } virtual IArgFunction<C>* clone() const { return new NullBinder( *this ); } }; template<typename C, typename M> struct BoundDataMember : IArgFunction<C>{ BoundDataMember( M C::* _member ) : member( _member ) {} virtual void set( C& p, std::string const& stringValue ) const { convertInto( stringValue, p.*member ); } virtual bool takesArg() const { return !IsBool<M>::value; } virtual IArgFunction<C>* clone() const { return new BoundDataMember( *this ); } M C::* member; }; template<typename C, typename M> struct BoundUnaryMethod : IArgFunction<C>{ BoundUnaryMethod( void (C::*_member)( M ) ) : member( _member ) {} virtual void set( C& p, std::string const& stringValue ) const { typename RemoveConstRef<M>::type value; convertInto( stringValue, value ); (p.*member)( value ); } virtual bool takesArg() const { return !IsBool<M>::value; } virtual IArgFunction<C>* clone() const { return new BoundUnaryMethod( *this ); } void (C::*member)( M ); }; template<typename C> struct BoundNullaryMethod : IArgFunction<C>{ BoundNullaryMethod( void (C::*_member)() ) : member( _member ) {} virtual void set( C& p, std::string const& stringValue ) const { bool value; convertInto( stringValue, value ); if( value ) (p.*member)(); } virtual bool takesArg() const { return false; } virtual IArgFunction<C>* clone() const { return new BoundNullaryMethod( *this ); } void (C::*member)(); }; template<typename C> struct BoundUnaryFunction : IArgFunction<C>{ BoundUnaryFunction( void (*_function)( C& ) ) : function( _function ) {} virtual void set( C& obj, std::string const& stringValue ) const { bool value; convertInto( stringValue, value ); if( value ) function( obj ); } virtual bool takesArg() const { return false; } virtual IArgFunction<C>* clone() const { return new BoundUnaryFunction( *this ); } void (*function)( C& ); }; template<typename C, typename T> struct BoundBinaryFunction : IArgFunction<C>{ BoundBinaryFunction( void (*_function)( C&, T ) ) : function( _function ) {} virtual void set( C& obj, std::string const& stringValue ) const { typename RemoveConstRef<T>::type value; convertInto( stringValue, value ); function( obj, value ); } virtual bool takesArg() const { return !IsBool<T>::value; } virtual IArgFunction<C>* clone() const { return new BoundBinaryFunction( *this ); } void (*function)( C&, T ); }; } // namespace Detail inline std::vector<std::string> argsToVector( int argc, char const* const* const argv ) { std::vector<std::string> args( static_cast<std::size_t>( argc ) ); for( std::size_t i = 0; i < static_cast<std::size_t>( argc ); ++i ) args[i] = argv[i]; return args; } class Parser { enum Mode { None, MaybeShortOpt, SlashOpt, ShortOpt, LongOpt, Positional }; Mode mode; std::size_t from; bool inQuotes; public: struct Token { enum Type { Positional, ShortOpt, LongOpt }; Token( Type _type, std::string const& _data ) : type( _type ), data( _data ) {} Type type; std::string data; }; Parser() : mode( None ), from( 0 ), inQuotes( false ){} void parseIntoTokens( std::vector<std::string> const& args, std::vector<Token>& tokens ) { const std::string doubleDash = "--"; for( std::size_t i = 1; i < args.size() && args[i] != doubleDash; ++i ) parseIntoTokens( args[i], tokens); } void parseIntoTokens( std::string const& arg, std::vector<Token>& tokens ) { for( std::size_t i = 0; i <= arg.size(); ++i ) { char c = arg[i]; if( c == '"' ) inQuotes = !inQuotes; mode = handleMode( i, c, arg, tokens ); } } Mode handleMode( std::size_t i, char c, std::string const& arg, std::vector<Token>& tokens ) { switch( mode ) { case None: return handleNone( i, c ); case MaybeShortOpt: return handleMaybeShortOpt( i, c ); case ShortOpt: case LongOpt: case SlashOpt: return handleOpt( i, c, arg, tokens ); case Positional: return handlePositional( i, c, arg, tokens ); default: throw std::logic_error( "Unknown mode" ); } } Mode handleNone( std::size_t i, char c ) { if( inQuotes ) { from = i; return Positional; } switch( c ) { case '-': return MaybeShortOpt; #ifdef CLARA_PLATFORM_WINDOWS case '/': from = i+1; return SlashOpt; #endif default: from = i; return Positional; } } Mode handleMaybeShortOpt( std::size_t i, char c ) { switch( c ) { case '-': from = i+1; return LongOpt; default: from = i; return ShortOpt; } } Mode handleOpt( std::size_t i, char c, std::string const& arg, std::vector<Token>& tokens ) { if( std::string( ":=\0", 3 ).find( c ) == std::string::npos ) return mode; std::string optName = arg.substr( from, i-from ); if( mode == ShortOpt ) for( std::size_t j = 0; j < optName.size(); ++j ) tokens.push_back( Token( Token::ShortOpt, optName.substr( j, 1 ) ) ); else if( mode == SlashOpt && optName.size() == 1 ) tokens.push_back( Token( Token::ShortOpt, optName ) ); else tokens.push_back( Token( Token::LongOpt, optName ) ); return None; } Mode handlePositional( std::size_t i, char c, std::string const& arg, std::vector<Token>& tokens ) { if( inQuotes || std::string( "\0", 1 ).find( c ) == std::string::npos ) return mode; std::string data = arg.substr( from, i-from ); tokens.push_back( Token( Token::Positional, data ) ); return None; } }; template<typename ConfigT> struct CommonArgProperties { CommonArgProperties() {} CommonArgProperties( Detail::BoundArgFunction<ConfigT> const& _boundField ) : boundField( _boundField ) {} Detail::BoundArgFunction<ConfigT> boundField; std::string description; std::string detail; std::string placeholder; // Only value if boundField takes an arg bool takesArg() const { return !placeholder.empty(); } void validate() const { if( !boundField.isSet() ) throw std::logic_error( "option not bound" ); } }; struct OptionArgProperties { std::vector<std::string> shortNames; std::string longName; bool hasShortName( std::string const& shortName ) const { return std::find( shortNames.begin(), shortNames.end(), shortName ) != shortNames.end(); } bool hasLongName( std::string const& _longName ) const { return _longName == longName; } }; struct PositionalArgProperties { PositionalArgProperties() : position( -1 ) {} int position; // -1 means non-positional (floating) bool isFixedPositional() const { return position != -1; } }; template<typename ConfigT> class CommandLine { struct Arg : CommonArgProperties<ConfigT>, OptionArgProperties, PositionalArgProperties { Arg() {} Arg( Detail::BoundArgFunction<ConfigT> const& _boundField ) : CommonArgProperties<ConfigT>( _boundField ) {} using CommonArgProperties<ConfigT>::placeholder; // !TBD std::string dbgName() const { if( !longName.empty() ) return "--" + longName; if( !shortNames.empty() ) return "-" + shortNames[0]; return "positional args"; } std::string commands() const { std::ostringstream oss; bool first = true; std::vector<std::string>::const_iterator it = shortNames.begin(), itEnd = shortNames.end(); for(; it != itEnd; ++it ) { if( first ) first = false; else oss << ", "; oss << "-" << *it; } if( !longName.empty() ) { if( !first ) oss << ", "; oss << "--" << longName; } if( !placeholder.empty() ) oss << " <" << placeholder << ">"; return oss.str(); } }; typedef CLARA_AUTO_PTR( Arg ) ArgAutoPtr; friend void addOptName( Arg& arg, std::string const& optName ) { if( optName.empty() ) return; if( Detail::startsWith( optName, "--" ) ) { if( !arg.longName.empty() ) throw std::logic_error( "Only one long opt may be specified. '" + arg.longName + "' already specified, now attempting to add '" + optName + "'" ); arg.longName = optName.substr( 2 ); } else if( Detail::startsWith( optName, "-" ) ) arg.shortNames.push_back( optName.substr( 1 ) ); else throw std::logic_error( "option must begin with - or --. Option was: '" + optName + "'" ); } friend void setPositionalArg( Arg& arg, int position ) { arg.position = position; } class ArgBuilder { public: ArgBuilder( Arg* arg ) : m_arg( arg ) {} // Bind a non-boolean data member (requires placeholder string) template<typename C, typename M> void bind( M C::* field, std::string const& placeholder ) { m_arg->boundField = new Detail::BoundDataMember<C,M>( field ); m_arg->placeholder = placeholder; } // Bind a boolean data member (no placeholder required) template<typename C> void bind( bool C::* field ) { m_arg->boundField = new Detail::BoundDataMember<C,bool>( field ); } // Bind a method taking a single, non-boolean argument (requires a placeholder string) template<typename C, typename M> void bind( void (C::* unaryMethod)( M ), std::string const& placeholder ) { m_arg->boundField = new Detail::BoundUnaryMethod<C,M>( unaryMethod ); m_arg->placeholder = placeholder; } // Bind a method taking a single, boolean argument (no placeholder string required) template<typename C> void bind( void (C::* unaryMethod)( bool ) ) { m_arg->boundField = new Detail::BoundUnaryMethod<C,bool>( unaryMethod ); } // Bind a method that takes no arguments (will be called if opt is present) template<typename C> void bind( void (C::* nullaryMethod)() ) { m_arg->boundField = new Detail::BoundNullaryMethod<C>( nullaryMethod ); } // Bind a free function taking a single argument - the object to operate on (no placeholder string required) template<typename C> void bind( void (* unaryFunction)( C& ) ) { m_arg->boundField = new Detail::BoundUnaryFunction<C>( unaryFunction ); } // Bind a free function taking a single argument - the object to operate on (requires a placeholder string) template<typename C, typename T> void bind( void (* binaryFunction)( C&, T ), std::string const& placeholder ) { m_arg->boundField = new Detail::BoundBinaryFunction<C, T>( binaryFunction ); m_arg->placeholder = placeholder; } ArgBuilder& describe( std::string const& description ) { m_arg->description = description; return *this; } ArgBuilder& detail( std::string const& detail ) { m_arg->detail = detail; return *this; } protected: Arg* m_arg; }; class OptBuilder : public ArgBuilder { public: OptBuilder( Arg* arg ) : ArgBuilder( arg ) {} OptBuilder( OptBuilder& other ) : ArgBuilder( other ) {} OptBuilder& operator[]( std::string const& optName ) { addOptName( *ArgBuilder::m_arg, optName ); return *this; } }; public: CommandLine() : m_boundProcessName( new Detail::NullBinder<ConfigT>() ), m_highestSpecifiedArgPosition( 0 ), m_throwOnUnrecognisedTokens( false ) {} CommandLine( CommandLine const& other ) : m_boundProcessName( other.m_boundProcessName ), m_options ( other.m_options ), m_positionalArgs( other.m_positionalArgs ), m_highestSpecifiedArgPosition( other.m_highestSpecifiedArgPosition ), m_throwOnUnrecognisedTokens( other.m_throwOnUnrecognisedTokens ) { if( other.m_floatingArg.get() ) m_floatingArg.reset( new Arg( *other.m_floatingArg ) ); } CommandLine& setThrowOnUnrecognisedTokens( bool shouldThrow = true ) { m_throwOnUnrecognisedTokens = shouldThrow; return *this; } OptBuilder operator[]( std::string const& optName ) { m_options.push_back( Arg() ); addOptName( m_options.back(), optName ); OptBuilder builder( &m_options.back() ); return builder; } ArgBuilder operator[]( int position ) { m_positionalArgs.insert( std::make_pair( position, Arg() ) ); if( position > m_highestSpecifiedArgPosition ) m_highestSpecifiedArgPosition = position; setPositionalArg( m_positionalArgs[position], position ); ArgBuilder builder( &m_positionalArgs[position] ); return builder; } // Invoke this with the _ instance ArgBuilder operator[]( UnpositionalTag ) { if( m_floatingArg.get() ) throw std::logic_error( "Only one unpositional argument can be added" ); m_floatingArg.reset( new Arg() ); ArgBuilder builder( m_floatingArg.get() ); return builder; } template<typename C, typename M> void bindProcessName( M C::* field ) { m_boundProcessName = new Detail::BoundDataMember<C,M>( field ); } template<typename C, typename M> void bindProcessName( void (C::*_unaryMethod)( M ) ) { m_boundProcessName = new Detail::BoundUnaryMethod<C,M>( _unaryMethod ); } void optUsage( std::ostream& os, std::size_t indent = 0, std::size_t width = Detail::consoleWidth ) const { typename std::vector<Arg>::const_iterator itBegin = m_options.begin(), itEnd = m_options.end(), it; std::size_t maxWidth = 0; for( it = itBegin; it != itEnd; ++it ) maxWidth = (std::max)( maxWidth, it->commands().size() ); for( it = itBegin; it != itEnd; ++it ) { Detail::Text usage( it->commands(), Detail::TextAttributes() .setWidth( maxWidth+indent ) .setIndent( indent ) ); Detail::Text desc( it->description, Detail::TextAttributes() .setWidth( width - maxWidth - 3 ) ); for( std::size_t i = 0; i < (std::max)( usage.size(), desc.size() ); ++i ) { std::string usageCol = i < usage.size() ? usage[i] : ""; os << usageCol; if( i < desc.size() && !desc[i].empty() ) os << std::string( indent + 2 + maxWidth - usageCol.size(), ' ' ) << desc[i]; os << "\n"; } } } std::string optUsage() const { std::ostringstream oss; optUsage( oss ); return oss.str(); } void argSynopsis( std::ostream& os ) const { for( int i = 1; i <= m_highestSpecifiedArgPosition; ++i ) { if( i > 1 ) os << " "; typename std::map<int, Arg>::const_iterator it = m_positionalArgs.find( i ); if( it != m_positionalArgs.end() ) os << "<" << it->second.placeholder << ">"; else if( m_floatingArg.get() ) os << "<" << m_floatingArg->placeholder << ">"; else throw std::logic_error( "non consecutive positional arguments with no floating args" ); } // !TBD No indication of mandatory args if( m_floatingArg.get() ) { if( m_highestSpecifiedArgPosition > 1 ) os << " "; os << "[<" << m_floatingArg->placeholder << "> ...]"; } } std::string argSynopsis() const { std::ostringstream oss; argSynopsis( oss ); return oss.str(); } void usage( std::ostream& os, std::string const& procName ) const { validate(); os << "usage:\n " << procName << " "; argSynopsis( os ); if( !m_options.empty() ) { os << " [options]\n\nwhere options are: \n"; optUsage( os, 2 ); } os << "\n"; } std::string usage( std::string const& procName ) const { std::ostringstream oss; usage( oss, procName ); return oss.str(); } ConfigT parse( std::vector<std::string> const& args ) const { ConfigT config; parseInto( args, config ); return config; } std::vector<Parser::Token> parseInto( std::vector<std::string> const& args, ConfigT& config ) const { std::string processName = args[0]; std::size_t lastSlash = processName.find_last_of( "/\\" ); if( lastSlash != std::string::npos ) processName = processName.substr( lastSlash+1 ); m_boundProcessName.set( config, processName ); std::vector<Parser::Token> tokens; Parser parser; parser.parseIntoTokens( args, tokens ); return populate( tokens, config ); } std::vector<Parser::Token> populate( std::vector<Parser::Token> const& tokens, ConfigT& config ) const { validate(); std::vector<Parser::Token> unusedTokens = populateOptions( tokens, config ); unusedTokens = populateFixedArgs( unusedTokens, config ); unusedTokens = populateFloatingArgs( unusedTokens, config ); return unusedTokens; } std::vector<Parser::Token> populateOptions( std::vector<Parser::Token> const& tokens, ConfigT& config ) const { std::vector<Parser::Token> unusedTokens; std::vector<std::string> errors; for( std::size_t i = 0; i < tokens.size(); ++i ) { Parser::Token const& token = tokens[i]; typename std::vector<Arg>::const_iterator it = m_options.begin(), itEnd = m_options.end(); for(; it != itEnd; ++it ) { Arg const& arg = *it; try { if( ( token.type == Parser::Token::ShortOpt && arg.hasShortName( token.data ) ) || ( token.type == Parser::Token::LongOpt && arg.hasLongName( token.data ) ) ) { if( arg.takesArg() ) { if( i == tokens.size()-1 || tokens[i+1].type != Parser::Token::Positional ) errors.push_back( "Expected argument to option: " + token.data ); else arg.boundField.set( config, tokens[++i].data ); } else { arg.boundField.set( config, "true" ); } break; } } catch( std::exception& ex ) { errors.push_back( std::string( ex.what() ) + "\n- while parsing: (" + arg.commands() + ")" ); } } if( it == itEnd ) { if( token.type == Parser::Token::Positional || !m_throwOnUnrecognisedTokens ) unusedTokens.push_back( token ); else if( errors.empty() && m_throwOnUnrecognisedTokens ) errors.push_back( "unrecognised option: " + token.data ); } } if( !errors.empty() ) { std::ostringstream oss; for( std::vector<std::string>::const_iterator it = errors.begin(), itEnd = errors.end(); it != itEnd; ++it ) { if( it != errors.begin() ) oss << "\n"; oss << *it; } throw std::runtime_error( oss.str() ); } return unusedTokens; } std::vector<Parser::Token> populateFixedArgs( std::vector<Parser::Token> const& tokens, ConfigT& config ) const { std::vector<Parser::Token> unusedTokens; int position = 1; for( std::size_t i = 0; i < tokens.size(); ++i ) { Parser::Token const& token = tokens[i]; typename std::map<int, Arg>::const_iterator it = m_positionalArgs.find( position ); if( it != m_positionalArgs.end() ) it->second.boundField.set( config, token.data ); else unusedTokens.push_back( token ); if( token.type == Parser::Token::Positional ) position++; } return unusedTokens; } std::vector<Parser::Token> populateFloatingArgs( std::vector<Parser::Token> const& tokens, ConfigT& config ) const { if( !m_floatingArg.get() ) return tokens; std::vector<Parser::Token> unusedTokens; for( std::size_t i = 0; i < tokens.size(); ++i ) { Parser::Token const& token = tokens[i]; if( token.type == Parser::Token::Positional ) m_floatingArg->boundField.set( config, token.data ); else unusedTokens.push_back( token ); } return unusedTokens; } void validate() const { if( m_options.empty() && m_positionalArgs.empty() && !m_floatingArg.get() ) throw std::logic_error( "No options or arguments specified" ); for( typename std::vector<Arg>::const_iterator it = m_options.begin(), itEnd = m_options.end(); it != itEnd; ++it ) it->validate(); } private: Detail::BoundArgFunction<ConfigT> m_boundProcessName; std::vector<Arg> m_options; std::map<int, Arg> m_positionalArgs; ArgAutoPtr m_floatingArg; int m_highestSpecifiedArgPosition; bool m_throwOnUnrecognisedTokens; }; } // end namespace Clara STITCH_CLARA_CLOSE_NAMESPACE #undef STITCH_CLARA_OPEN_NAMESPACE #undef STITCH_CLARA_CLOSE_NAMESPACE #endif // TWOBLUECUBES_CLARA_H_INCLUDED #undef STITCH_CLARA_OPEN_NAMESPACE // Restore Clara's value for console width, if present #ifdef CATCH_TEMP_CLARA_CONFIG_CONSOLE_WIDTH #define CLARA_CONFIG_CONSOLE_WIDTH CATCH_TEMP_CLARA_CONFIG_CONSOLE_WIDTH #undef CATCH_TEMP_CLARA_CONFIG_CONSOLE_WIDTH #endif #include <fstream> namespace Catch { inline void abortAfterFirst( ConfigData& config ) { config.abortAfter = 1; } inline void abortAfterX( ConfigData& config, int x ) { if( x < 1 ) throw std::runtime_error( "Value after -x or --abortAfter must be greater than zero" ); config.abortAfter = x; } inline void addTestOrTags( ConfigData& config, std::string const& _testSpec ) { config.testsOrTags.push_back( _testSpec ); } inline void addReporterName( ConfigData& config, std::string const& _reporterName ) { config.reporterNames.push_back( _reporterName ); } inline void addWarning( ConfigData& config, std::string const& _warning ) { if( _warning == "NoAssertions" ) config.warnings = static_cast<WarnAbout::What>( config.warnings | WarnAbout::NoAssertions ); else throw std::runtime_error( "Unrecognised warning: '" + _warning + "'" ); } inline void setOrder( ConfigData& config, std::string const& order ) { if( startsWith( "declared", order ) ) config.runOrder = RunTests::InDeclarationOrder; else if( startsWith( "lexical", order ) ) config.runOrder = RunTests::InLexicographicalOrder; else if( startsWith( "random", order ) ) config.runOrder = RunTests::InRandomOrder; else throw std::runtime_error( "Unrecognised ordering: '" + order + "'" ); } inline void setRngSeed( ConfigData& config, std::string const& seed ) { if( seed == "time" ) { config.rngSeed = static_cast<unsigned int>( std::time(0) ); } else { std::stringstream ss; ss << seed; ss >> config.rngSeed; if( ss.fail() ) throw std::runtime_error( "Argment to --rng-seed should be the word 'time' or a number" ); } } inline void setVerbosity( ConfigData& config, int level ) { // !TBD: accept strings? config.verbosity = static_cast<Verbosity::Level>( level ); } inline void setShowDurations( ConfigData& config, bool _showDurations ) { config.showDurations = _showDurations ? ShowDurations::Always : ShowDurations::Never; } inline void setUseColour( ConfigData& config, std::string const& value ) { std::string mode = toLower( value ); if( mode == "yes" ) config.useColour = UseColour::Yes; else if( mode == "no" ) config.useColour = UseColour::No; else if( mode == "auto" ) config.useColour = UseColour::Auto; else throw std::runtime_error( "colour mode must be one of: auto, yes or no" ); } inline void forceColour( ConfigData& config ) { config.useColour = UseColour::Yes; } inline void loadTestNamesFromFile( ConfigData& config, std::string const& _filename ) { std::ifstream f( _filename.c_str() ); if( !f.is_open() ) throw std::domain_error( "Unable to load input file: " + _filename ); std::string line; while( std::getline( f, line ) ) { line = trim(line); if( !line.empty() && !startsWith( line, "#" ) ) { if( !startsWith( line, "\"" ) ) line = "\"" + line + "\""; addTestOrTags( config, line + "," ); } } } inline Clara::CommandLine<ConfigData> makeCommandLineParser() { using namespace Clara; CommandLine<ConfigData> cli; cli.bindProcessName( &ConfigData::processName ); cli["-?"]["-h"]["--help"] .describe( "display usage information" ) .bind( &ConfigData::showHelp ); cli["-l"]["--list-tests"] .describe( "list all/matching test cases" ) .bind( &ConfigData::listTests ); cli["-t"]["--list-tags"] .describe( "list all/matching tags" ) .bind( &ConfigData::listTags ); cli["-s"]["--success"] .describe( "include successful tests in output" ) .bind( &ConfigData::showSuccessfulTests ); cli["-b"]["--break"] .describe( "break into debugger on failure" ) .bind( &ConfigData::shouldDebugBreak ); cli["-e"]["--nothrow"] .describe( "skip exception tests" ) .bind( &ConfigData::noThrow ); cli["-i"]["--invisibles"] .describe( "show invisibles (tabs, newlines)" ) .bind( &ConfigData::showInvisibles ); cli["-o"]["--out"] .describe( "output filename" ) .bind( &ConfigData::outputFilename, "filename" ); cli["-r"]["--reporter"] // .placeholder( "name[:filename]" ) .describe( "reporter to use (defaults to console)" ) .bind( &addReporterName, "name" ); cli["-n"]["--name"] .describe( "suite name" ) .bind( &ConfigData::name, "name" ); cli["-a"]["--abort"] .describe( "abort at first failure" ) .bind( &abortAfterFirst ); cli["-x"]["--abortx"] .describe( "abort after x failures" ) .bind( &abortAfterX, "no. failures" ); cli["-w"]["--warn"] .describe( "enable warnings" ) .bind( &addWarning, "warning name" ); // - needs updating if reinstated // cli.into( &setVerbosity ) // .describe( "level of verbosity (0=no output)" ) // .shortOpt( "v") // .longOpt( "verbosity" ) // .placeholder( "level" ); cli[_] .describe( "which test or tests to use" ) .bind( &addTestOrTags, "test name, pattern or tags" ); cli["-d"]["--durations"] .describe( "show test durations" ) .bind( &setShowDurations, "yes|no" ); cli["-f"]["--input-file"] .describe( "load test names to run from a file" ) .bind( &loadTestNamesFromFile, "filename" ); cli["-#"]["--filenames-as-tags"] .describe( "adds a tag for the filename" ) .bind( &ConfigData::filenamesAsTags ); // Less common commands which don't have a short form cli["--list-test-names-only"] .describe( "list all/matching test cases names only" ) .bind( &ConfigData::listTestNamesOnly ); cli["--list-reporters"] .describe( "list all reporters" ) .bind( &ConfigData::listReporters ); cli["--order"] .describe( "test case order (defaults to decl)" ) .bind( &setOrder, "decl|lex|rand" ); cli["--rng-seed"] .describe( "set a specific seed for random numbers" ) .bind( &setRngSeed, "'time'|number" ); cli["--force-colour"] .describe( "force colourised output (deprecated)" ) .bind( &forceColour ); cli["--use-colour"] .describe( "should output be colourised" ) .bind( &setUseColour, "yes|no" ); return cli; } } // end namespace Catch // #included from: internal/catch_list.hpp #define TWOBLUECUBES_CATCH_LIST_HPP_INCLUDED // #included from: catch_text.h #define TWOBLUECUBES_CATCH_TEXT_H_INCLUDED #define TBC_TEXT_FORMAT_CONSOLE_WIDTH CATCH_CONFIG_CONSOLE_WIDTH #define CLICHE_TBC_TEXT_FORMAT_OUTER_NAMESPACE Catch // #included from: ../external/tbc_text_format.h // Only use header guard if we are not using an outer namespace #ifndef CLICHE_TBC_TEXT_FORMAT_OUTER_NAMESPACE # ifdef TWOBLUECUBES_TEXT_FORMAT_H_INCLUDED # ifndef TWOBLUECUBES_TEXT_FORMAT_H_ALREADY_INCLUDED # define TWOBLUECUBES_TEXT_FORMAT_H_ALREADY_INCLUDED # endif # else # define TWOBLUECUBES_TEXT_FORMAT_H_INCLUDED # endif #endif #ifndef TWOBLUECUBES_TEXT_FORMAT_H_ALREADY_INCLUDED #include <string> #include <vector> #include <sstream> // Use optional outer namespace #ifdef CLICHE_TBC_TEXT_FORMAT_OUTER_NAMESPACE namespace CLICHE_TBC_TEXT_FORMAT_OUTER_NAMESPACE { #endif namespace Tbc { #ifdef TBC_TEXT_FORMAT_CONSOLE_WIDTH const unsigned int consoleWidth = TBC_TEXT_FORMAT_CONSOLE_WIDTH; #else const unsigned int consoleWidth = 80; #endif struct TextAttributes { TextAttributes() : initialIndent( std::string::npos ), indent( 0 ), width( consoleWidth-1 ), tabChar( '\t' ) {} TextAttributes& setInitialIndent( std::size_t _value ) { initialIndent = _value; return *this; } TextAttributes& setIndent( std::size_t _value ) { indent = _value; return *this; } TextAttributes& setWidth( std::size_t _value ) { width = _value; return *this; } TextAttributes& setTabChar( char _value ) { tabChar = _value; return *this; } std::size_t initialIndent; // indent of first line, or npos std::size_t indent; // indent of subsequent lines, or all if initialIndent is npos std::size_t width; // maximum width of text, including indent. Longer text will wrap char tabChar; // If this char is seen the indent is changed to current pos }; class Text { public: Text( std::string const& _str, TextAttributes const& _attr = TextAttributes() ) : attr( _attr ) { std::string wrappableChars = " [({.,/|\\-"; std::size_t indent = _attr.initialIndent != std::string::npos ? _attr.initialIndent : _attr.indent; std::string remainder = _str; while( !remainder.empty() ) { if( lines.size() >= 1000 ) { lines.push_back( "... message truncated due to excessive size" ); return; } std::size_t tabPos = std::string::npos; std::size_t width = (std::min)( remainder.size(), _attr.width - indent ); std::size_t pos = remainder.find_first_of( '\n' ); if( pos <= width ) { width = pos; } pos = remainder.find_last_of( _attr.tabChar, width ); if( pos != std::string::npos ) { tabPos = pos; if( remainder[width] == '\n' ) width--; remainder = remainder.substr( 0, tabPos ) + remainder.substr( tabPos+1 ); } if( width == remainder.size() ) { spliceLine( indent, remainder, width ); } else if( remainder[width] == '\n' ) { spliceLine( indent, remainder, width ); if( width <= 1 || remainder.size() != 1 ) remainder = remainder.substr( 1 ); indent = _attr.indent; } else { pos = remainder.find_last_of( wrappableChars, width ); if( pos != std::string::npos && pos > 0 ) { spliceLine( indent, remainder, pos ); if( remainder[0] == ' ' ) remainder = remainder.substr( 1 ); } else { spliceLine( indent, remainder, width-1 ); lines.back() += "-"; } if( lines.size() == 1 ) indent = _attr.indent; if( tabPos != std::string::npos ) indent += tabPos; } } } void spliceLine( std::size_t _indent, std::string& _remainder, std::size_t _pos ) { lines.push_back( std::string( _indent, ' ' ) + _remainder.substr( 0, _pos ) ); _remainder = _remainder.substr( _pos ); } typedef std::vector<std::string>::const_iterator const_iterator; const_iterator begin() const { return lines.begin(); } const_iterator end() const { return lines.end(); } std::string const& last() const { return lines.back(); } std::size_t size() const { return lines.size(); } std::string const& operator[]( std::size_t _index ) const { return lines[_index]; } std::string toString() const { std::ostringstream oss; oss << *this; return oss.str(); } inline friend std::ostream& operator << ( std::ostream& _stream, Text const& _text ) { for( Text::const_iterator it = _text.begin(), itEnd = _text.end(); it != itEnd; ++it ) { if( it != _text.begin() ) _stream << "\n"; _stream << *it; } return _stream; } private: std::string str; TextAttributes attr; std::vector<std::string> lines; }; } // end namespace Tbc #ifdef CLICHE_TBC_TEXT_FORMAT_OUTER_NAMESPACE } // end outer namespace #endif #endif // TWOBLUECUBES_TEXT_FORMAT_H_ALREADY_INCLUDED #undef CLICHE_TBC_TEXT_FORMAT_OUTER_NAMESPACE namespace Catch { using Tbc::Text; using Tbc::TextAttributes; } // #included from: catch_console_colour.hpp #define TWOBLUECUBES_CATCH_CONSOLE_COLOUR_HPP_INCLUDED namespace Catch { struct Colour { enum Code { None = 0, White, Red, Green, Blue, Cyan, Yellow, Grey, Bright = 0x10, BrightRed = Bright | Red, BrightGreen = Bright | Green, LightGrey = Bright | Grey, BrightWhite = Bright | White, // By intention FileName = LightGrey, Warning = Yellow, ResultError = BrightRed, ResultSuccess = BrightGreen, ResultExpectedFailure = Warning, Error = BrightRed, Success = Green, OriginalExpression = Cyan, ReconstructedExpression = Yellow, SecondaryText = LightGrey, Headers = White }; // Use constructed object for RAII guard Colour( Code _colourCode ); Colour( Colour const& other ); ~Colour(); // Use static method for one-shot changes static void use( Code _colourCode ); private: bool m_moved; }; inline std::ostream& operator << ( std::ostream& os, Colour const& ) { return os; } } // end namespace Catch // #included from: catch_interfaces_reporter.h #define TWOBLUECUBES_CATCH_INTERFACES_REPORTER_H_INCLUDED #include <string> #include <ostream> #include <map> #include <assert.h> namespace Catch { struct ReporterConfig { explicit ReporterConfig( Ptr<IConfig const> const& _fullConfig ) : m_stream( &_fullConfig->stream() ), m_fullConfig( _fullConfig ) {} ReporterConfig( Ptr<IConfig const> const& _fullConfig, std::ostream& _stream ) : m_stream( &_stream ), m_fullConfig( _fullConfig ) {} std::ostream& stream() const { return *m_stream; } Ptr<IConfig const> fullConfig() const { return m_fullConfig; } private: std::ostream* m_stream; Ptr<IConfig const> m_fullConfig; }; struct ReporterPreferences { ReporterPreferences() : shouldRedirectStdOut( false ) {} bool shouldRedirectStdOut; }; template<typename T> struct LazyStat : Option<T> { LazyStat() : used( false ) {} LazyStat& operator=( T const& _value ) { Option<T>::operator=( _value ); used = false; return *this; } void reset() { Option<T>::reset(); used = false; } bool used; }; struct TestRunInfo { TestRunInfo( std::string const& _name ) : name( _name ) {} std::string name; }; struct GroupInfo { GroupInfo( std::string const& _name, std::size_t _groupIndex, std::size_t _groupsCount ) : name( _name ), groupIndex( _groupIndex ), groupsCounts( _groupsCount ) {} std::string name; std::size_t groupIndex; std::size_t groupsCounts; }; struct AssertionStats { AssertionStats( AssertionResult const& _assertionResult, std::vector<MessageInfo> const& _infoMessages, Totals const& _totals ) : assertionResult( _assertionResult ), infoMessages( _infoMessages ), totals( _totals ) { if( assertionResult.hasMessage() ) { // Copy message into messages list. // !TBD This should have been done earlier, somewhere MessageBuilder builder( assertionResult.getTestMacroName(), assertionResult.getSourceInfo(), assertionResult.getResultType() ); builder << assertionResult.getMessage(); builder.m_info.message = builder.m_stream.str(); infoMessages.push_back( builder.m_info ); } } virtual ~AssertionStats(); # ifdef CATCH_CONFIG_CPP11_GENERATED_METHODS AssertionStats( AssertionStats const& ) = default; AssertionStats( AssertionStats && ) = default; AssertionStats& operator = ( AssertionStats const& ) = default; AssertionStats& operator = ( AssertionStats && ) = default; # endif AssertionResult assertionResult; std::vector<MessageInfo> infoMessages; Totals totals; }; struct SectionStats { SectionStats( SectionInfo const& _sectionInfo, Counts const& _assertions, double _durationInSeconds, bool _missingAssertions ) : sectionInfo( _sectionInfo ), assertions( _assertions ), durationInSeconds( _durationInSeconds ), missingAssertions( _missingAssertions ) {} virtual ~SectionStats(); # ifdef CATCH_CONFIG_CPP11_GENERATED_METHODS SectionStats( SectionStats const& ) = default; SectionStats( SectionStats && ) = default; SectionStats& operator = ( SectionStats const& ) = default; SectionStats& operator = ( SectionStats && ) = default; # endif SectionInfo sectionInfo; Counts assertions; double durationInSeconds; bool missingAssertions; }; struct TestCaseStats { TestCaseStats( TestCaseInfo const& _testInfo, Totals const& _totals, std::string const& _stdOut, std::string const& _stdErr, bool _aborting ) : testInfo( _testInfo ), totals( _totals ), stdOut( _stdOut ), stdErr( _stdErr ), aborting( _aborting ) {} virtual ~TestCaseStats(); # ifdef CATCH_CONFIG_CPP11_GENERATED_METHODS TestCaseStats( TestCaseStats const& ) = default; TestCaseStats( TestCaseStats && ) = default; TestCaseStats& operator = ( TestCaseStats const& ) = default; TestCaseStats& operator = ( TestCaseStats && ) = default; # endif TestCaseInfo testInfo; Totals totals; std::string stdOut; std::string stdErr; bool aborting; }; struct TestGroupStats { TestGroupStats( GroupInfo const& _groupInfo, Totals const& _totals, bool _aborting ) : groupInfo( _groupInfo ), totals( _totals ), aborting( _aborting ) {} TestGroupStats( GroupInfo const& _groupInfo ) : groupInfo( _groupInfo ), aborting( false ) {} virtual ~TestGroupStats(); # ifdef CATCH_CONFIG_CPP11_GENERATED_METHODS TestGroupStats( TestGroupStats const& ) = default; TestGroupStats( TestGroupStats && ) = default; TestGroupStats& operator = ( TestGroupStats const& ) = default; TestGroupStats& operator = ( TestGroupStats && ) = default; # endif GroupInfo groupInfo; Totals totals; bool aborting; }; struct TestRunStats { TestRunStats( TestRunInfo const& _runInfo, Totals const& _totals, bool _aborting ) : runInfo( _runInfo ), totals( _totals ), aborting( _aborting ) {} virtual ~TestRunStats(); # ifndef CATCH_CONFIG_CPP11_GENERATED_METHODS TestRunStats( TestRunStats const& _other ) : runInfo( _other.runInfo ), totals( _other.totals ), aborting( _other.aborting ) {} # else TestRunStats( TestRunStats const& ) = default; TestRunStats( TestRunStats && ) = default; TestRunStats& operator = ( TestRunStats const& ) = default; TestRunStats& operator = ( TestRunStats && ) = default; # endif TestRunInfo runInfo; Totals totals; bool aborting; }; class MultipleReporters; struct IStreamingReporter : IShared { virtual ~IStreamingReporter(); // Implementing class must also provide the following static method: // static std::string getDescription(); virtual ReporterPreferences getPreferences() const = 0; virtual void noMatchingTestCases( std::string const& spec ) = 0; virtual void testRunStarting( TestRunInfo const& testRunInfo ) = 0; virtual void testGroupStarting( GroupInfo const& groupInfo ) = 0; virtual void testCaseStarting( TestCaseInfo const& testInfo ) = 0; virtual void sectionStarting( SectionInfo const& sectionInfo ) = 0; virtual void assertionStarting( AssertionInfo const& assertionInfo ) = 0; // The return value indicates if the messages buffer should be cleared: virtual bool assertionEnded( AssertionStats const& assertionStats ) = 0; virtual void sectionEnded( SectionStats const& sectionStats ) = 0; virtual void testCaseEnded( TestCaseStats const& testCaseStats ) = 0; virtual void testGroupEnded( TestGroupStats const& testGroupStats ) = 0; virtual void testRunEnded( TestRunStats const& testRunStats ) = 0; virtual void skipTest( TestCaseInfo const& testInfo ) = 0; virtual MultipleReporters* tryAsMulti() { return CATCH_NULL; } }; struct IReporterFactory : IShared { virtual ~IReporterFactory(); virtual IStreamingReporter* create( ReporterConfig const& config ) const = 0; virtual std::string getDescription() const = 0; }; struct IReporterRegistry { typedef std::map<std::string, Ptr<IReporterFactory> > FactoryMap; typedef std::vector<Ptr<IReporterFactory> > Listeners; virtual ~IReporterRegistry(); virtual IStreamingReporter* create( std::string const& name, Ptr<IConfig const> const& config ) const = 0; virtual FactoryMap const& getFactories() const = 0; virtual Listeners const& getListeners() const = 0; }; Ptr<IStreamingReporter> addReporter( Ptr<IStreamingReporter> const& existingReporter, Ptr<IStreamingReporter> const& additionalReporter ); } #include <limits> #include <algorithm> namespace Catch { inline std::size_t listTests( Config const& config ) { TestSpec testSpec = config.testSpec(); if( config.testSpec().hasFilters() ) Catch::cout() << "Matching test cases:\n"; else { Catch::cout() << "All available test cases:\n"; testSpec = TestSpecParser( ITagAliasRegistry::get() ).parse( "*" ).testSpec(); } std::size_t matchedTests = 0; TextAttributes nameAttr, tagsAttr; nameAttr.setInitialIndent( 2 ).setIndent( 4 ); tagsAttr.setIndent( 6 ); std::vector<TestCase> matchedTestCases = filterTests( getAllTestCasesSorted( config ), testSpec, config ); for( std::vector<TestCase>::const_iterator it = matchedTestCases.begin(), itEnd = matchedTestCases.end(); it != itEnd; ++it ) { matchedTests++; TestCaseInfo const& testCaseInfo = it->getTestCaseInfo(); Colour::Code colour = testCaseInfo.isHidden() ? Colour::SecondaryText : Colour::None; Colour colourGuard( colour ); Catch::cout() << Text( testCaseInfo.name, nameAttr ) << std::endl; if( !testCaseInfo.tags.empty() ) Catch::cout() << Text( testCaseInfo.tagsAsString, tagsAttr ) << std::endl; } if( !config.testSpec().hasFilters() ) Catch::cout() << pluralise( matchedTests, "test case" ) << "\n" << std::endl; else Catch::cout() << pluralise( matchedTests, "matching test case" ) << "\n" << std::endl; return matchedTests; } inline std::size_t listTestsNamesOnly( Config const& config ) { TestSpec testSpec = config.testSpec(); if( !config.testSpec().hasFilters() ) testSpec = TestSpecParser( ITagAliasRegistry::get() ).parse( "*" ).testSpec(); std::size_t matchedTests = 0; std::vector<TestCase> matchedTestCases = filterTests( getAllTestCasesSorted( config ), testSpec, config ); for( std::vector<TestCase>::const_iterator it = matchedTestCases.begin(), itEnd = matchedTestCases.end(); it != itEnd; ++it ) { matchedTests++; TestCaseInfo const& testCaseInfo = it->getTestCaseInfo(); if( startsWith( testCaseInfo.name, "#" ) ) Catch::cout() << "\"" << testCaseInfo.name << "\"" << std::endl; else Catch::cout() << testCaseInfo.name << std::endl; } return matchedTests; } struct TagInfo { TagInfo() : count ( 0 ) {} void add( std::string const& spelling ) { ++count; spellings.insert( spelling ); } std::string all() const { std::string out; for( std::set<std::string>::const_iterator it = spellings.begin(), itEnd = spellings.end(); it != itEnd; ++it ) out += "[" + *it + "]"; return out; } std::set<std::string> spellings; std::size_t count; }; inline std::size_t listTags( Config const& config ) { TestSpec testSpec = config.testSpec(); if( config.testSpec().hasFilters() ) Catch::cout() << "Tags for matching test cases:\n"; else { Catch::cout() << "All available tags:\n"; testSpec = TestSpecParser( ITagAliasRegistry::get() ).parse( "*" ).testSpec(); } std::map<std::string, TagInfo> tagCounts; std::vector<TestCase> matchedTestCases = filterTests( getAllTestCasesSorted( config ), testSpec, config ); for( std::vector<TestCase>::const_iterator it = matchedTestCases.begin(), itEnd = matchedTestCases.end(); it != itEnd; ++it ) { for( std::set<std::string>::const_iterator tagIt = it->getTestCaseInfo().tags.begin(), tagItEnd = it->getTestCaseInfo().tags.end(); tagIt != tagItEnd; ++tagIt ) { std::string tagName = *tagIt; std::string lcaseTagName = toLower( tagName ); std::map<std::string, TagInfo>::iterator countIt = tagCounts.find( lcaseTagName ); if( countIt == tagCounts.end() ) countIt = tagCounts.insert( std::make_pair( lcaseTagName, TagInfo() ) ).first; countIt->second.add( tagName ); } } for( std::map<std::string, TagInfo>::const_iterator countIt = tagCounts.begin(), countItEnd = tagCounts.end(); countIt != countItEnd; ++countIt ) { std::ostringstream oss; oss << " " << std::setw(2) << countIt->second.count << " "; Text wrapper( countIt->second.all(), TextAttributes() .setInitialIndent( 0 ) .setIndent( oss.str().size() ) .setWidth( CATCH_CONFIG_CONSOLE_WIDTH-10 ) ); Catch::cout() << oss.str() << wrapper << "\n"; } Catch::cout() << pluralise( tagCounts.size(), "tag" ) << "\n" << std::endl; return tagCounts.size(); } inline std::size_t listReporters( Config const& /*config*/ ) { Catch::cout() << "Available reporters:\n"; IReporterRegistry::FactoryMap const& factories = getRegistryHub().getReporterRegistry().getFactories(); IReporterRegistry::FactoryMap::const_iterator itBegin = factories.begin(), itEnd = factories.end(), it; std::size_t maxNameLen = 0; for(it = itBegin; it != itEnd; ++it ) maxNameLen = (std::max)( maxNameLen, it->first.size() ); for(it = itBegin; it != itEnd; ++it ) { Text wrapper( it->second->getDescription(), TextAttributes() .setInitialIndent( 0 ) .setIndent( 7+maxNameLen ) .setWidth( CATCH_CONFIG_CONSOLE_WIDTH - maxNameLen-8 ) ); Catch::cout() << " " << it->first << ":" << std::string( maxNameLen - it->first.size() + 2, ' ' ) << wrapper << "\n"; } Catch::cout() << std::endl; return factories.size(); } inline Option<std::size_t> list( Config const& config ) { Option<std::size_t> listedCount; if( config.listTests() ) listedCount = listedCount.valueOr(0) + listTests( config ); if( config.listTestNamesOnly() ) listedCount = listedCount.valueOr(0) + listTestsNamesOnly( config ); if( config.listTags() ) listedCount = listedCount.valueOr(0) + listTags( config ); if( config.listReporters() ) listedCount = listedCount.valueOr(0) + listReporters( config ); return listedCount; } } // end namespace Catch // #included from: internal/catch_run_context.hpp #define TWOBLUECUBES_CATCH_RUNNER_IMPL_HPP_INCLUDED // #included from: catch_test_case_tracker.hpp #define TWOBLUECUBES_CATCH_TEST_CASE_TRACKER_HPP_INCLUDED #include <map> #include <string> #include <assert.h> #include <vector> namespace Catch { namespace TestCaseTracking { struct ITracker : SharedImpl<> { virtual ~ITracker(); // static queries virtual std::string name() const = 0; // dynamic queries virtual bool isComplete() const = 0; // Successfully completed or failed virtual bool isSuccessfullyCompleted() const = 0; virtual bool isOpen() const = 0; // Started but not complete virtual bool hasChildren() const = 0; virtual ITracker& parent() = 0; // actions virtual void close() = 0; // Successfully complete virtual void fail() = 0; virtual void markAsNeedingAnotherRun() = 0; virtual void addChild( Ptr<ITracker> const& child ) = 0; virtual ITracker* findChild( std::string const& name ) = 0; virtual void openChild() = 0; // Debug/ checking virtual bool isSectionTracker() const = 0; virtual bool isIndexTracker() const = 0; }; class TrackerContext { enum RunState { NotStarted, Executing, CompletedCycle }; Ptr<ITracker> m_rootTracker; ITracker* m_currentTracker; RunState m_runState; public: static TrackerContext& instance() { static TrackerContext s_instance; return s_instance; } TrackerContext() : m_currentTracker( CATCH_NULL ), m_runState( NotStarted ) {} ITracker& startRun(); void endRun() { m_rootTracker.reset(); m_currentTracker = CATCH_NULL; m_runState = NotStarted; } void startCycle() { m_currentTracker = m_rootTracker.get(); m_runState = Executing; } void completeCycle() { m_runState = CompletedCycle; } bool completedCycle() const { return m_runState == CompletedCycle; } ITracker& currentTracker() { return *m_currentTracker; } void setCurrentTracker( ITracker* tracker ) { m_currentTracker = tracker; } }; class TrackerBase : public ITracker { protected: enum CycleState { NotStarted, Executing, ExecutingChildren, NeedsAnotherRun, CompletedSuccessfully, Failed }; class TrackerHasName { std::string m_name; public: TrackerHasName( std::string const& name ) : m_name( name ) {} bool operator ()( Ptr<ITracker> const& tracker ) { return tracker->name() == m_name; } }; typedef std::vector<Ptr<ITracker> > Children; std::string m_name; TrackerContext& m_ctx; ITracker* m_parent; Children m_children; CycleState m_runState; public: TrackerBase( std::string const& name, TrackerContext& ctx, ITracker* parent ) : m_name( name ), m_ctx( ctx ), m_parent( parent ), m_runState( NotStarted ) {} virtual ~TrackerBase(); virtual std::string name() const CATCH_OVERRIDE { return m_name; } virtual bool isComplete() const CATCH_OVERRIDE { return m_runState == CompletedSuccessfully || m_runState == Failed; } virtual bool isSuccessfullyCompleted() const CATCH_OVERRIDE { return m_runState == CompletedSuccessfully; } virtual bool isOpen() const CATCH_OVERRIDE { return m_runState != NotStarted && !isComplete(); } virtual bool hasChildren() const CATCH_OVERRIDE { return !m_children.empty(); } virtual void addChild( Ptr<ITracker> const& child ) CATCH_OVERRIDE { m_children.push_back( child ); } virtual ITracker* findChild( std::string const& name ) CATCH_OVERRIDE { Children::const_iterator it = std::find_if( m_children.begin(), m_children.end(), TrackerHasName( name ) ); return( it != m_children.end() ) ? it->get() : CATCH_NULL; } virtual ITracker& parent() CATCH_OVERRIDE { assert( m_parent ); // Should always be non-null except for root return *m_parent; } virtual void openChild() CATCH_OVERRIDE { if( m_runState != ExecutingChildren ) { m_runState = ExecutingChildren; if( m_parent ) m_parent->openChild(); } } virtual bool isSectionTracker() const CATCH_OVERRIDE { return false; } virtual bool isIndexTracker() const CATCH_OVERRIDE { return false; } void open() { m_runState = Executing; moveToThis(); if( m_parent ) m_parent->openChild(); } virtual void close() CATCH_OVERRIDE { // Close any still open children (e.g. generators) while( &m_ctx.currentTracker() != this ) m_ctx.currentTracker().close(); switch( m_runState ) { case NotStarted: case CompletedSuccessfully: case Failed: throw std::logic_error( "Illogical state" ); case NeedsAnotherRun: break;; case Executing: m_runState = CompletedSuccessfully; break; case ExecutingChildren: if( m_children.empty() || m_children.back()->isComplete() ) m_runState = CompletedSuccessfully; break; default: throw std::logic_error( "Unexpected state" ); } moveToParent(); m_ctx.completeCycle(); } virtual void fail() CATCH_OVERRIDE { m_runState = Failed; if( m_parent ) m_parent->markAsNeedingAnotherRun(); moveToParent(); m_ctx.completeCycle(); } virtual void markAsNeedingAnotherRun() CATCH_OVERRIDE { m_runState = NeedsAnotherRun; } private: void moveToParent() { assert( m_parent ); m_ctx.setCurrentTracker( m_parent ); } void moveToThis() { m_ctx.setCurrentTracker( this ); } }; class SectionTracker : public TrackerBase { public: SectionTracker( std::string const& name, TrackerContext& ctx, ITracker* parent ) : TrackerBase( name, ctx, parent ) {} virtual ~SectionTracker(); virtual bool isSectionTracker() const CATCH_OVERRIDE { return true; } static SectionTracker& acquire( TrackerContext& ctx, std::string const& name ) { SectionTracker* section = CATCH_NULL; ITracker& currentTracker = ctx.currentTracker(); if( ITracker* childTracker = currentTracker.findChild( name ) ) { assert( childTracker ); assert( childTracker->isSectionTracker() ); section = static_cast<SectionTracker*>( childTracker ); } else { section = new SectionTracker( name, ctx, &currentTracker ); currentTracker.addChild( section ); } if( !ctx.completedCycle() && !section->isComplete() ) { section->open(); } return *section; } }; class IndexTracker : public TrackerBase { int m_size; int m_index; public: IndexTracker( std::string const& name, TrackerContext& ctx, ITracker* parent, int size ) : TrackerBase( name, ctx, parent ), m_size( size ), m_index( -1 ) {} virtual ~IndexTracker(); virtual bool isIndexTracker() const CATCH_OVERRIDE { return true; } static IndexTracker& acquire( TrackerContext& ctx, std::string const& name, int size ) { IndexTracker* tracker = CATCH_NULL; ITracker& currentTracker = ctx.currentTracker(); if( ITracker* childTracker = currentTracker.findChild( name ) ) { assert( childTracker ); assert( childTracker->isIndexTracker() ); tracker = static_cast<IndexTracker*>( childTracker ); } else { tracker = new IndexTracker( name, ctx, &currentTracker, size ); currentTracker.addChild( tracker ); } if( !ctx.completedCycle() && !tracker->isComplete() ) { if( tracker->m_runState != ExecutingChildren && tracker->m_runState != NeedsAnotherRun ) tracker->moveNext(); tracker->open(); } return *tracker; } int index() const { return m_index; } void moveNext() { m_index++; m_children.clear(); } virtual void close() CATCH_OVERRIDE { TrackerBase::close(); if( m_runState == CompletedSuccessfully && m_index < m_size-1 ) m_runState = Executing; } }; inline ITracker& TrackerContext::startRun() { m_rootTracker = new SectionTracker( "{root}", *this, CATCH_NULL ); m_currentTracker = CATCH_NULL; m_runState = Executing; return *m_rootTracker; } } // namespace TestCaseTracking using TestCaseTracking::ITracker; using TestCaseTracking::TrackerContext; using TestCaseTracking::SectionTracker; using TestCaseTracking::IndexTracker; } // namespace Catch // #included from: catch_fatal_condition.hpp #define TWOBLUECUBES_CATCH_FATAL_CONDITION_H_INCLUDED namespace Catch { // Report the error condition then exit the process inline void fatal( std::string const& message, int exitCode ) { IContext& context = Catch::getCurrentContext(); IResultCapture* resultCapture = context.getResultCapture(); resultCapture->handleFatalErrorCondition( message ); if( Catch::alwaysTrue() ) // avoids "no return" warnings exit( exitCode ); } } // namespace Catch #if defined ( CATCH_PLATFORM_WINDOWS ) ///////////////////////////////////////// namespace Catch { struct FatalConditionHandler { void reset() {} }; } // namespace Catch #else // Not Windows - assumed to be POSIX compatible ////////////////////////// #include <signal.h> namespace Catch { struct SignalDefs { int id; const char* name; }; extern SignalDefs signalDefs[]; SignalDefs signalDefs[] = { { SIGINT, "SIGINT - Terminal interrupt signal" }, { SIGILL, "SIGILL - Illegal instruction signal" }, { SIGFPE, "SIGFPE - Floating point error signal" }, { SIGSEGV, "SIGSEGV - Segmentation violation signal" }, { SIGTERM, "SIGTERM - Termination request signal" }, { SIGABRT, "SIGABRT - Abort (abnormal termination) signal" } }; struct FatalConditionHandler { static void handleSignal( int sig ) { for( std::size_t i = 0; i < sizeof(signalDefs)/sizeof(SignalDefs); ++i ) if( sig == signalDefs[i].id ) fatal( signalDefs[i].name, -sig ); fatal( "<unknown signal>", -sig ); } FatalConditionHandler() : m_isSet( true ) { for( std::size_t i = 0; i < sizeof(signalDefs)/sizeof(SignalDefs); ++i ) signal( signalDefs[i].id, handleSignal ); } ~FatalConditionHandler() { reset(); } void reset() { if( m_isSet ) { for( std::size_t i = 0; i < sizeof(signalDefs)/sizeof(SignalDefs); ++i ) signal( signalDefs[i].id, SIG_DFL ); m_isSet = false; } } bool m_isSet; }; } // namespace Catch #endif // not Windows #include <set> #include <string> namespace Catch { class StreamRedirect { public: StreamRedirect( std::ostream& stream, std::string& targetString ) : m_stream( stream ), m_prevBuf( stream.rdbuf() ), m_targetString( targetString ) { stream.rdbuf( m_oss.rdbuf() ); } ~StreamRedirect() { m_targetString += m_oss.str(); m_stream.rdbuf( m_prevBuf ); } private: std::ostream& m_stream; std::streambuf* m_prevBuf; std::ostringstream m_oss; std::string& m_targetString; }; /////////////////////////////////////////////////////////////////////////// class RunContext : public IResultCapture, public IRunner { RunContext( RunContext const& ); void operator =( RunContext const& ); public: explicit RunContext( Ptr<IConfig const> const& _config, Ptr<IStreamingReporter> const& reporter ) : m_runInfo( _config->name() ), m_context( getCurrentMutableContext() ), m_activeTestCase( CATCH_NULL ), m_config( _config ), m_reporter( reporter ) { m_context.setRunner( this ); m_context.setConfig( m_config ); m_context.setResultCapture( this ); m_reporter->testRunStarting( m_runInfo ); } virtual ~RunContext() { m_reporter->testRunEnded( TestRunStats( m_runInfo, m_totals, aborting() ) ); } void testGroupStarting( std::string const& testSpec, std::size_t groupIndex, std::size_t groupsCount ) { m_reporter->testGroupStarting( GroupInfo( testSpec, groupIndex, groupsCount ) ); } void testGroupEnded( std::string const& testSpec, Totals const& totals, std::size_t groupIndex, std::size_t groupsCount ) { m_reporter->testGroupEnded( TestGroupStats( GroupInfo( testSpec, groupIndex, groupsCount ), totals, aborting() ) ); } Totals runTest( TestCase const& testCase ) { Totals prevTotals = m_totals; std::string redirectedCout; std::string redirectedCerr; TestCaseInfo testInfo = testCase.getTestCaseInfo(); m_reporter->testCaseStarting( testInfo ); m_activeTestCase = &testCase; do { m_trackerContext.startRun(); do { m_trackerContext.startCycle(); m_testCaseTracker = &SectionTracker::acquire( m_trackerContext, testInfo.name ); runCurrentTest( redirectedCout, redirectedCerr ); } while( !m_testCaseTracker->isSuccessfullyCompleted() && !aborting() ); } // !TBD: deprecated - this will be replaced by indexed trackers while( getCurrentContext().advanceGeneratorsForCurrentTest() && !aborting() ); Totals deltaTotals = m_totals.delta( prevTotals ); if( testInfo.expectedToFail() && deltaTotals.testCases.passed > 0 ) { deltaTotals.assertions.failed++; deltaTotals.testCases.passed--; deltaTotals.testCases.failed++; } m_totals.testCases += deltaTotals.testCases; m_reporter->testCaseEnded( TestCaseStats( testInfo, deltaTotals, redirectedCout, redirectedCerr, aborting() ) ); m_activeTestCase = CATCH_NULL; m_testCaseTracker = CATCH_NULL; return deltaTotals; } Ptr<IConfig const> config() const { return m_config; } private: // IResultCapture virtual void assertionEnded( AssertionResult const& result ) { if( result.getResultType() == ResultWas::Ok ) { m_totals.assertions.passed++; } else if( !result.isOk() ) { m_totals.assertions.failed++; } if( m_reporter->assertionEnded( AssertionStats( result, m_messages, m_totals ) ) ) m_messages.clear(); // Reset working state m_lastAssertionInfo = AssertionInfo( "", m_lastAssertionInfo.lineInfo, "{Unknown expression after the reported line}" , m_lastAssertionInfo.resultDisposition ); m_lastResult = result; } virtual bool sectionStarted ( SectionInfo const& sectionInfo, Counts& assertions ) { std::ostringstream oss; oss << sectionInfo.name << "@" << sectionInfo.lineInfo; ITracker& sectionTracker = SectionTracker::acquire( m_trackerContext, oss.str() ); if( !sectionTracker.isOpen() ) return false; m_activeSections.push_back( &sectionTracker ); m_lastAssertionInfo.lineInfo = sectionInfo.lineInfo; m_reporter->sectionStarting( sectionInfo ); assertions = m_totals.assertions; return true; } bool testForMissingAssertions( Counts& assertions ) { if( assertions.total() != 0 ) return false; if( !m_config->warnAboutMissingAssertions() ) return false; if( m_trackerContext.currentTracker().hasChildren() ) return false; m_totals.assertions.failed++; assertions.failed++; return true; } virtual void sectionEnded( SectionEndInfo const& endInfo ) { Counts assertions = m_totals.assertions - endInfo.prevAssertions; bool missingAssertions = testForMissingAssertions( assertions ); if( !m_activeSections.empty() ) { m_activeSections.back()->close(); m_activeSections.pop_back(); } m_reporter->sectionEnded( SectionStats( endInfo.sectionInfo, assertions, endInfo.durationInSeconds, missingAssertions ) ); m_messages.clear(); } virtual void sectionEndedEarly( SectionEndInfo const& endInfo ) { if( m_unfinishedSections.empty() ) m_activeSections.back()->fail(); else m_activeSections.back()->close(); m_activeSections.pop_back(); m_unfinishedSections.push_back( endInfo ); } virtual void pushScopedMessage( MessageInfo const& message ) { m_messages.push_back( message ); } virtual void popScopedMessage( MessageInfo const& message ) { m_messages.erase( std::remove( m_messages.begin(), m_messages.end(), message ), m_messages.end() ); } virtual std::string getCurrentTestName() const { return m_activeTestCase ? m_activeTestCase->getTestCaseInfo().name : ""; } virtual const AssertionResult* getLastResult() const { return &m_lastResult; } virtual void handleFatalErrorCondition( std::string const& message ) { ResultBuilder resultBuilder = makeUnexpectedResultBuilder(); resultBuilder.setResultType( ResultWas::FatalErrorCondition ); resultBuilder << message; resultBuilder.captureExpression(); handleUnfinishedSections(); // Recreate section for test case (as we will lose the one that was in scope) TestCaseInfo const& testCaseInfo = m_activeTestCase->getTestCaseInfo(); SectionInfo testCaseSection( testCaseInfo.lineInfo, testCaseInfo.name, testCaseInfo.description ); Counts assertions; assertions.failed = 1; SectionStats testCaseSectionStats( testCaseSection, assertions, 0, false ); m_reporter->sectionEnded( testCaseSectionStats ); TestCaseInfo testInfo = m_activeTestCase->getTestCaseInfo(); Totals deltaTotals; deltaTotals.testCases.failed = 1; m_reporter->testCaseEnded( TestCaseStats( testInfo, deltaTotals, "", "", false ) ); m_totals.testCases.failed++; testGroupEnded( "", m_totals, 1, 1 ); m_reporter->testRunEnded( TestRunStats( m_runInfo, m_totals, false ) ); } public: // !TBD We need to do this another way! bool aborting() const { return m_totals.assertions.failed == static_cast<std::size_t>( m_config->abortAfter() ); } private: void runCurrentTest( std::string& redirectedCout, std::string& redirectedCerr ) { TestCaseInfo const& testCaseInfo = m_activeTestCase->getTestCaseInfo(); SectionInfo testCaseSection( testCaseInfo.lineInfo, testCaseInfo.name, testCaseInfo.description ); m_reporter->sectionStarting( testCaseSection ); Counts prevAssertions = m_totals.assertions; double duration = 0; try { m_lastAssertionInfo = AssertionInfo( "TEST_CASE", testCaseInfo.lineInfo, "", ResultDisposition::Normal ); seedRng( *m_config ); Timer timer; timer.start(); if( m_reporter->getPreferences().shouldRedirectStdOut ) { StreamRedirect coutRedir( Catch::cout(), redirectedCout ); StreamRedirect cerrRedir( Catch::cerr(), redirectedCerr ); invokeActiveTestCase(); } else { invokeActiveTestCase(); } duration = timer.getElapsedSeconds(); } catch( TestFailureException& ) { // This just means the test was aborted due to failure } catch(...) { makeUnexpectedResultBuilder().useActiveException(); } m_testCaseTracker->close(); handleUnfinishedSections(); m_messages.clear(); Counts assertions = m_totals.assertions - prevAssertions; bool missingAssertions = testForMissingAssertions( assertions ); if( testCaseInfo.okToFail() ) { std::swap( assertions.failedButOk, assertions.failed ); m_totals.assertions.failed -= assertions.failedButOk; m_totals.assertions.failedButOk += assertions.failedButOk; } SectionStats testCaseSectionStats( testCaseSection, assertions, duration, missingAssertions ); m_reporter->sectionEnded( testCaseSectionStats ); } void invokeActiveTestCase() { FatalConditionHandler fatalConditionHandler; // Handle signals m_activeTestCase->invoke(); fatalConditionHandler.reset(); } private: ResultBuilder makeUnexpectedResultBuilder() const { return ResultBuilder( m_lastAssertionInfo.macroName.c_str(), m_lastAssertionInfo.lineInfo, m_lastAssertionInfo.capturedExpression.c_str(), m_lastAssertionInfo.resultDisposition ); } void handleUnfinishedSections() { // If sections ended prematurely due to an exception we stored their // infos here so we can tear them down outside the unwind process. for( std::vector<SectionEndInfo>::const_reverse_iterator it = m_unfinishedSections.rbegin(), itEnd = m_unfinishedSections.rend(); it != itEnd; ++it ) sectionEnded( *it ); m_unfinishedSections.clear(); } TestRunInfo m_runInfo; IMutableContext& m_context; TestCase const* m_activeTestCase; ITracker* m_testCaseTracker; ITracker* m_currentSectionTracker; AssertionResult m_lastResult; Ptr<IConfig const> m_config; Totals m_totals; Ptr<IStreamingReporter> m_reporter; std::vector<MessageInfo> m_messages; AssertionInfo m_lastAssertionInfo; std::vector<SectionEndInfo> m_unfinishedSections; std::vector<ITracker*> m_activeSections; TrackerContext m_trackerContext; }; IResultCapture& getResultCapture() { if( IResultCapture* capture = getCurrentContext().getResultCapture() ) return *capture; else throw std::logic_error( "No result capture instance" ); } } // end namespace Catch // #included from: internal/catch_version.h #define TWOBLUECUBES_CATCH_VERSION_H_INCLUDED namespace Catch { // Versioning information struct Version { Version( unsigned int _majorVersion, unsigned int _minorVersion, unsigned int _patchNumber, std::string const& _branchName, unsigned int _buildNumber ); unsigned int const majorVersion; unsigned int const minorVersion; unsigned int const patchNumber; // buildNumber is only used if branchName is not null std::string const branchName; unsigned int const buildNumber; friend std::ostream& operator << ( std::ostream& os, Version const& version ); private: void operator=( Version const& ); }; extern Version libraryVersion; } #include <fstream> #include <stdlib.h> #include <limits> namespace Catch { Ptr<IStreamingReporter> createReporter( std::string const& reporterName, Ptr<Config> const& config ) { Ptr<IStreamingReporter> reporter = getRegistryHub().getReporterRegistry().create( reporterName, config.get() ); if( !reporter ) { std::ostringstream oss; oss << "No reporter registered with name: '" << reporterName << "'"; throw std::domain_error( oss.str() ); } return reporter; } Ptr<IStreamingReporter> makeReporter( Ptr<Config> const& config ) { std::vector<std::string> reporters = config->getReporterNames(); if( reporters.empty() ) reporters.push_back( "console" ); Ptr<IStreamingReporter> reporter; for( std::vector<std::string>::const_iterator it = reporters.begin(), itEnd = reporters.end(); it != itEnd; ++it ) reporter = addReporter( reporter, createReporter( *it, config ) ); return reporter; } Ptr<IStreamingReporter> addListeners( Ptr<IConfig const> const& config, Ptr<IStreamingReporter> reporters ) { IReporterRegistry::Listeners listeners = getRegistryHub().getReporterRegistry().getListeners(); for( IReporterRegistry::Listeners::const_iterator it = listeners.begin(), itEnd = listeners.end(); it != itEnd; ++it ) reporters = addReporter(reporters, (*it)->create( ReporterConfig( config ) ) ); return reporters; } Totals runTests( Ptr<Config> const& config ) { Ptr<IConfig const> iconfig = config.get(); Ptr<IStreamingReporter> reporter = makeReporter( config ); reporter = addListeners( iconfig, reporter ); RunContext context( iconfig, reporter ); Totals totals; context.testGroupStarting( config->name(), 1, 1 ); TestSpec testSpec = config->testSpec(); if( !testSpec.hasFilters() ) testSpec = TestSpecParser( ITagAliasRegistry::get() ).parse( "~[.]" ).testSpec(); // All not hidden tests std::vector<TestCase> const& allTestCases = getAllTestCasesSorted( *iconfig ); for( std::vector<TestCase>::const_iterator it = allTestCases.begin(), itEnd = allTestCases.end(); it != itEnd; ++it ) { if( !context.aborting() && matchTest( *it, testSpec, *iconfig ) ) totals += context.runTest( *it ); else reporter->skipTest( *it ); } context.testGroupEnded( iconfig->name(), totals, 1, 1 ); return totals; } void applyFilenamesAsTags( IConfig const& config ) { std::vector<TestCase> const& tests = getAllTestCasesSorted( config ); for(std::size_t i = 0; i < tests.size(); ++i ) { TestCase& test = const_cast<TestCase&>( tests[i] ); std::set<std::string> tags = test.tags; std::string filename = test.lineInfo.file; std::string::size_type lastSlash = filename.find_last_of( "\\/" ); if( lastSlash != std::string::npos ) filename = filename.substr( lastSlash+1 ); std::string::size_type lastDot = filename.find_last_of( "." ); if( lastDot != std::string::npos ) filename = filename.substr( 0, lastDot ); tags.insert( "#" + filename ); setTags( test, tags ); } } class Session : NonCopyable { static bool alreadyInstantiated; public: struct OnUnusedOptions { enum DoWhat { Ignore, Fail }; }; Session() : m_cli( makeCommandLineParser() ) { if( alreadyInstantiated ) { std::string msg = "Only one instance of Catch::Session can ever be used"; Catch::cerr() << msg << std::endl; throw std::logic_error( msg ); } alreadyInstantiated = true; } ~Session() { Catch::cleanUp(); } void showHelp( std::string const& processName ) { Catch::cout() << "\nCatch v" << libraryVersion << "\n"; m_cli.usage( Catch::cout(), processName ); Catch::cout() << "For more detail usage please see the project docs\n" << std::endl; } int applyCommandLine( int argc, char const* const* const argv, OnUnusedOptions::DoWhat unusedOptionBehaviour = OnUnusedOptions::Fail ) { try { m_cli.setThrowOnUnrecognisedTokens( unusedOptionBehaviour == OnUnusedOptions::Fail ); m_unusedTokens = m_cli.parseInto( Clara::argsToVector( argc, argv ), m_configData ); if( m_configData.showHelp ) showHelp( m_configData.processName ); m_config.reset(); } catch( std::exception& ex ) { { Colour colourGuard( Colour::Red ); Catch::cerr() << "\nError(s) in input:\n" << Text( ex.what(), TextAttributes().setIndent(2) ) << "\n\n"; } m_cli.usage( Catch::cout(), m_configData.processName ); return (std::numeric_limits<int>::max)(); } return 0; } void useConfigData( ConfigData const& _configData ) { m_configData = _configData; m_config.reset(); } int run( int argc, char const* const* const argv ) { int returnCode = applyCommandLine( argc, argv ); if( returnCode == 0 ) returnCode = run(); return returnCode; } int run() { if( m_configData.showHelp ) return 0; try { config(); // Force config to be constructed seedRng( *m_config ); if( m_configData.filenamesAsTags ) applyFilenamesAsTags( *m_config ); // Handle list request if( Option<std::size_t> listed = list( config() ) ) return static_cast<int>( *listed ); return static_cast<int>( runTests( m_config ).assertions.failed ); } catch( std::exception& ex ) { Catch::cerr() << ex.what() << std::endl; return (std::numeric_limits<int>::max)(); } } Clara::CommandLine<ConfigData> const& cli() const { return m_cli; } std::vector<Clara::Parser::Token> const& unusedTokens() const { return m_unusedTokens; } ConfigData& configData() { return m_configData; } Config& config() { if( !m_config ) m_config = new Config( m_configData ); return *m_config; } private: Clara::CommandLine<ConfigData> m_cli; std::vector<Clara::Parser::Token> m_unusedTokens; ConfigData m_configData; Ptr<Config> m_config; }; bool Session::alreadyInstantiated = false; } // end namespace Catch // #included from: catch_registry_hub.hpp #define TWOBLUECUBES_CATCH_REGISTRY_HUB_HPP_INCLUDED // #included from: catch_test_case_registry_impl.hpp #define TWOBLUECUBES_CATCH_TEST_CASE_REGISTRY_IMPL_HPP_INCLUDED #include <vector> #include <set> #include <sstream> #include <iostream> #include <algorithm> #ifdef CATCH_CPP14_OR_GREATER #include <random> #endif namespace Catch { struct RandomNumberGenerator { typedef std::ptrdiff_t result_type; result_type operator()( result_type n ) const { return std::rand() % n; } #ifdef CATCH_CPP14_OR_GREATER static constexpr result_type min() { return 0; } static constexpr result_type max() { return 1000000; } result_type operator()() const { return std::rand() % max(); } #endif template<typename V> static void shuffle( V& vector ) { RandomNumberGenerator rng; #ifdef CATCH_CPP14_OR_GREATER std::shuffle( vector.begin(), vector.end(), rng ); #else std::random_shuffle( vector.begin(), vector.end(), rng ); #endif } }; inline std::vector<TestCase> sortTests( IConfig const& config, std::vector<TestCase> const& unsortedTestCases ) { std::vector<TestCase> sorted = unsortedTestCases; switch( config.runOrder() ) { case RunTests::InLexicographicalOrder: std::sort( sorted.begin(), sorted.end() ); break; case RunTests::InRandomOrder: { seedRng( config ); RandomNumberGenerator::shuffle( sorted ); } break; case RunTests::InDeclarationOrder: // already in declaration order break; } return sorted; } bool matchTest( TestCase const& testCase, TestSpec const& testSpec, IConfig const& config ) { return testSpec.matches( testCase ) && ( config.allowThrows() || !testCase.throws() ); } void enforceNoDuplicateTestCases( std::vector<TestCase> const& functions ) { std::set<TestCase> seenFunctions; for( std::vector<TestCase>::const_iterator it = functions.begin(), itEnd = functions.end(); it != itEnd; ++it ) { std::pair<std::set<TestCase>::const_iterator, bool> prev = seenFunctions.insert( *it ); if( !prev.second ) { std::ostringstream ss; ss << Colour( Colour::Red ) << "error: TEST_CASE( \"" << it->name << "\" ) already defined.\n" << "\tFirst seen at " << prev.first->getTestCaseInfo().lineInfo << "\n" << "\tRedefined at " << it->getTestCaseInfo().lineInfo << std::endl; throw std::runtime_error(ss.str()); } } } std::vector<TestCase> filterTests( std::vector<TestCase> const& testCases, TestSpec const& testSpec, IConfig const& config ) { std::vector<TestCase> filtered; filtered.reserve( testCases.size() ); for( std::vector<TestCase>::const_iterator it = testCases.begin(), itEnd = testCases.end(); it != itEnd; ++it ) if( matchTest( *it, testSpec, config ) ) filtered.push_back( *it ); return filtered; } std::vector<TestCase> const& getAllTestCasesSorted( IConfig const& config ) { return getRegistryHub().getTestCaseRegistry().getAllTestsSorted( config ); } class TestRegistry : public ITestCaseRegistry { public: TestRegistry() : m_currentSortOrder( RunTests::InDeclarationOrder ), m_unnamedCount( 0 ) {} virtual ~TestRegistry(); virtual void registerTest( TestCase const& testCase ) { std::string name = testCase.getTestCaseInfo().name; if( name == "" ) { std::ostringstream oss; oss << "Anonymous test case " << ++m_unnamedCount; return registerTest( testCase.withName( oss.str() ) ); } m_functions.push_back( testCase ); } virtual std::vector<TestCase> const& getAllTests() const { return m_functions; } virtual std::vector<TestCase> const& getAllTestsSorted( IConfig const& config ) const { if( m_sortedFunctions.empty() ) enforceNoDuplicateTestCases( m_functions ); if( m_currentSortOrder != config.runOrder() || m_sortedFunctions.empty() ) { m_sortedFunctions = sortTests( config, m_functions ); m_currentSortOrder = config.runOrder(); } return m_sortedFunctions; } private: std::vector<TestCase> m_functions; mutable RunTests::InWhatOrder m_currentSortOrder; mutable std::vector<TestCase> m_sortedFunctions; size_t m_unnamedCount; std::ios_base::Init m_ostreamInit; // Forces cout/ cerr to be initialised }; /////////////////////////////////////////////////////////////////////////// class FreeFunctionTestCase : public SharedImpl<ITestCase> { public: FreeFunctionTestCase( TestFunction fun ) : m_fun( fun ) {} virtual void invoke() const { m_fun(); } private: virtual ~FreeFunctionTestCase(); TestFunction m_fun; }; inline std::string extractClassName( std::string const& classOrQualifiedMethodName ) { std::string className = classOrQualifiedMethodName; if( startsWith( className, "&" ) ) { std::size_t lastColons = className.rfind( "::" ); std::size_t penultimateColons = className.rfind( "::", lastColons-1 ); if( penultimateColons == std::string::npos ) penultimateColons = 1; className = className.substr( penultimateColons, lastColons-penultimateColons ); } return className; } void registerTestCase ( ITestCase* testCase, char const* classOrQualifiedMethodName, NameAndDesc const& nameAndDesc, SourceLineInfo const& lineInfo ) { getMutableRegistryHub().registerTest ( makeTestCase ( testCase, extractClassName( classOrQualifiedMethodName ), nameAndDesc.name, nameAndDesc.description, lineInfo ) ); } void registerTestCaseFunction ( TestFunction function, SourceLineInfo const& lineInfo, NameAndDesc const& nameAndDesc ) { registerTestCase( new FreeFunctionTestCase( function ), "", nameAndDesc, lineInfo ); } /////////////////////////////////////////////////////////////////////////// AutoReg::AutoReg ( TestFunction function, SourceLineInfo const& lineInfo, NameAndDesc const& nameAndDesc ) { registerTestCaseFunction( function, lineInfo, nameAndDesc ); } AutoReg::~AutoReg() {} } // end namespace Catch // #included from: catch_reporter_registry.hpp #define TWOBLUECUBES_CATCH_REPORTER_REGISTRY_HPP_INCLUDED #include <map> namespace Catch { class ReporterRegistry : public IReporterRegistry { public: virtual ~ReporterRegistry() CATCH_OVERRIDE {} virtual IStreamingReporter* create( std::string const& name, Ptr<IConfig const> const& config ) const CATCH_OVERRIDE { FactoryMap::const_iterator it = m_factories.find( name ); if( it == m_factories.end() ) return CATCH_NULL; return it->second->create( ReporterConfig( config ) ); } void registerReporter( std::string const& name, Ptr<IReporterFactory> const& factory ) { m_factories.insert( std::make_pair( name, factory ) ); } void registerListener( Ptr<IReporterFactory> const& factory ) { m_listeners.push_back( factory ); } virtual FactoryMap const& getFactories() const CATCH_OVERRIDE { return m_factories; } virtual Listeners const& getListeners() const CATCH_OVERRIDE { return m_listeners; } private: FactoryMap m_factories; Listeners m_listeners; }; } // #included from: catch_exception_translator_registry.hpp #define TWOBLUECUBES_CATCH_EXCEPTION_TRANSLATOR_REGISTRY_HPP_INCLUDED #ifdef __OBJC__ #import "Foundation/Foundation.h" #endif namespace Catch { class ExceptionTranslatorRegistry : public IExceptionTranslatorRegistry { public: ~ExceptionTranslatorRegistry() { deleteAll( m_translators ); } virtual void registerTranslator( const IExceptionTranslator* translator ) { m_translators.push_back( translator ); } virtual std::string translateActiveException() const { try { #ifdef __OBJC__ // In Objective-C try objective-c exceptions first @try { return tryTranslators(); } @catch (NSException *exception) { return Catch::toString( [exception description] ); } #else return tryTranslators(); #endif } catch( TestFailureException& ) { throw; } catch( std::exception& ex ) { return ex.what(); } catch( std::string& msg ) { return msg; } catch( const char* msg ) { return msg; } catch(...) { return "Unknown exception"; } } std::string tryTranslators() const { if( m_translators.empty() ) throw; else return m_translators[0]->translate( m_translators.begin()+1, m_translators.end() ); } private: std::vector<const IExceptionTranslator*> m_translators; }; } namespace Catch { namespace { class RegistryHub : public IRegistryHub, public IMutableRegistryHub { RegistryHub( RegistryHub const& ); void operator=( RegistryHub const& ); public: // IRegistryHub RegistryHub() { } virtual IReporterRegistry const& getReporterRegistry() const CATCH_OVERRIDE { return m_reporterRegistry; } virtual ITestCaseRegistry const& getTestCaseRegistry() const CATCH_OVERRIDE { return m_testCaseRegistry; } virtual IExceptionTranslatorRegistry& getExceptionTranslatorRegistry() CATCH_OVERRIDE { return m_exceptionTranslatorRegistry; } public: // IMutableRegistryHub virtual void registerReporter( std::string const& name, Ptr<IReporterFactory> const& factory ) CATCH_OVERRIDE { m_reporterRegistry.registerReporter( name, factory ); } virtual void registerListener( Ptr<IReporterFactory> const& factory ) CATCH_OVERRIDE { m_reporterRegistry.registerListener( factory ); } virtual void registerTest( TestCase const& testInfo ) CATCH_OVERRIDE { m_testCaseRegistry.registerTest( testInfo ); } virtual void registerTranslator( const IExceptionTranslator* translator ) CATCH_OVERRIDE { m_exceptionTranslatorRegistry.registerTranslator( translator ); } private: TestRegistry m_testCaseRegistry; ReporterRegistry m_reporterRegistry; ExceptionTranslatorRegistry m_exceptionTranslatorRegistry; }; // Single, global, instance inline RegistryHub*& getTheRegistryHub() { static RegistryHub* theRegistryHub = CATCH_NULL; if( !theRegistryHub ) theRegistryHub = new RegistryHub(); return theRegistryHub; } } IRegistryHub& getRegistryHub() { return *getTheRegistryHub(); } IMutableRegistryHub& getMutableRegistryHub() { return *getTheRegistryHub(); } void cleanUp() { delete getTheRegistryHub(); getTheRegistryHub() = CATCH_NULL; cleanUpContext(); } std::string translateActiveException() { return getRegistryHub().getExceptionTranslatorRegistry().translateActiveException(); } } // end namespace Catch // #included from: catch_notimplemented_exception.hpp #define TWOBLUECUBES_CATCH_NOTIMPLEMENTED_EXCEPTION_HPP_INCLUDED #include <ostream> namespace Catch { NotImplementedException::NotImplementedException( SourceLineInfo const& lineInfo ) : m_lineInfo( lineInfo ) { std::ostringstream oss; oss << lineInfo << ": function "; oss << "not implemented"; m_what = oss.str(); } const char* NotImplementedException::what() const CATCH_NOEXCEPT { return m_what.c_str(); } } // end namespace Catch // #included from: catch_context_impl.hpp #define TWOBLUECUBES_CATCH_CONTEXT_IMPL_HPP_INCLUDED // #included from: catch_stream.hpp #define TWOBLUECUBES_CATCH_STREAM_HPP_INCLUDED #include <stdexcept> #include <cstdio> #include <iostream> namespace Catch { template<typename WriterF, size_t bufferSize=256> class StreamBufImpl : public StreamBufBase { char data[bufferSize]; WriterF m_writer; public: StreamBufImpl() { setp( data, data + sizeof(data) ); } ~StreamBufImpl() CATCH_NOEXCEPT { sync(); } private: int overflow( int c ) { sync(); if( c != EOF ) { if( pbase() == epptr() ) m_writer( std::string( 1, static_cast<char>( c ) ) ); else sputc( static_cast<char>( c ) ); } return 0; } int sync() { if( pbase() != pptr() ) { m_writer( std::string( pbase(), static_cast<std::string::size_type>( pptr() - pbase() ) ) ); setp( pbase(), epptr() ); } return 0; } }; /////////////////////////////////////////////////////////////////////////// FileStream::FileStream( std::string const& filename ) { m_ofs.open( filename.c_str() ); if( m_ofs.fail() ) { std::ostringstream oss; oss << "Unable to open file: '" << filename << "'"; throw std::domain_error( oss.str() ); } } std::ostream& FileStream::stream() const { return m_ofs; } struct OutputDebugWriter { void operator()( std::string const&str ) { writeToDebugConsole( str ); } }; DebugOutStream::DebugOutStream() : m_streamBuf( new StreamBufImpl<OutputDebugWriter>() ), m_os( m_streamBuf.get() ) {} std::ostream& DebugOutStream::stream() const { return m_os; } // Store the streambuf from cout up-front because // cout may get redirected when running tests CoutStream::CoutStream() : m_os( Catch::cout().rdbuf() ) {} std::ostream& CoutStream::stream() const { return m_os; } #ifndef CATCH_CONFIG_NOSTDOUT // If you #define this you must implement these functions std::ostream& cout() { return std::cout; } std::ostream& cerr() { return std::cerr; } #endif } namespace Catch { class Context : public IMutableContext { Context() : m_config( CATCH_NULL ), m_runner( CATCH_NULL ), m_resultCapture( CATCH_NULL ) {} Context( Context const& ); void operator=( Context const& ); public: // IContext virtual IResultCapture* getResultCapture() { return m_resultCapture; } virtual IRunner* getRunner() { return m_runner; } virtual size_t getGeneratorIndex( std::string const& fileInfo, size_t totalSize ) { return getGeneratorsForCurrentTest() .getGeneratorInfo( fileInfo, totalSize ) .getCurrentIndex(); } virtual bool advanceGeneratorsForCurrentTest() { IGeneratorsForTest* generators = findGeneratorsForCurrentTest(); return generators && generators->moveNext(); } virtual Ptr<IConfig const> getConfig() const { return m_config; } public: // IMutableContext virtual void setResultCapture( IResultCapture* resultCapture ) { m_resultCapture = resultCapture; } virtual void setRunner( IRunner* runner ) { m_runner = runner; } virtual void setConfig( Ptr<IConfig const> const& config ) { m_config = config; } friend IMutableContext& getCurrentMutableContext(); private: IGeneratorsForTest* findGeneratorsForCurrentTest() { std::string testName = getResultCapture()->getCurrentTestName(); std::map<std::string, IGeneratorsForTest*>::const_iterator it = m_generatorsByTestName.find( testName ); return it != m_generatorsByTestName.end() ? it->second : CATCH_NULL; } IGeneratorsForTest& getGeneratorsForCurrentTest() { IGeneratorsForTest* generators = findGeneratorsForCurrentTest(); if( !generators ) { std::string testName = getResultCapture()->getCurrentTestName(); generators = createGeneratorsForTest(); m_generatorsByTestName.insert( std::make_pair( testName, generators ) ); } return *generators; } private: Ptr<IConfig const> m_config; IRunner* m_runner; IResultCapture* m_resultCapture; std::map<std::string, IGeneratorsForTest*> m_generatorsByTestName; }; namespace { Context* currentContext = CATCH_NULL; } IMutableContext& getCurrentMutableContext() { if( !currentContext ) currentContext = new Context(); return *currentContext; } IContext& getCurrentContext() { return getCurrentMutableContext(); } void cleanUpContext() { delete currentContext; currentContext = CATCH_NULL; } } // #included from: catch_console_colour_impl.hpp #define TWOBLUECUBES_CATCH_CONSOLE_COLOUR_IMPL_HPP_INCLUDED namespace Catch { namespace { struct IColourImpl { virtual ~IColourImpl() {} virtual void use( Colour::Code _colourCode ) = 0; }; struct NoColourImpl : IColourImpl { void use( Colour::Code ) {} static IColourImpl* instance() { static NoColourImpl s_instance; return &s_instance; } }; } // anon namespace } // namespace Catch #if !defined( CATCH_CONFIG_COLOUR_NONE ) && !defined( CATCH_CONFIG_COLOUR_WINDOWS ) && !defined( CATCH_CONFIG_COLOUR_ANSI ) # ifdef CATCH_PLATFORM_WINDOWS # define CATCH_CONFIG_COLOUR_WINDOWS # else # define CATCH_CONFIG_COLOUR_ANSI # endif #endif #if defined ( CATCH_CONFIG_COLOUR_WINDOWS ) ///////////////////////////////////////// #ifndef NOMINMAX #define NOMINMAX #endif #ifdef __AFXDLL #include <AfxWin.h> #else #include <windows.h> #endif namespace Catch { namespace { class Win32ColourImpl : public IColourImpl { public: Win32ColourImpl() : stdoutHandle( GetStdHandle(STD_OUTPUT_HANDLE) ) { CONSOLE_SCREEN_BUFFER_INFO csbiInfo; GetConsoleScreenBufferInfo( stdoutHandle, &csbiInfo ); originalForegroundAttributes = csbiInfo.wAttributes & ~( BACKGROUND_GREEN | BACKGROUND_RED | BACKGROUND_BLUE | BACKGROUND_INTENSITY ); originalBackgroundAttributes = csbiInfo.wAttributes & ~( FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_BLUE | FOREGROUND_INTENSITY ); } virtual void use( Colour::Code _colourCode ) { switch( _colourCode ) { case Colour::None: return setTextAttribute( originalForegroundAttributes ); case Colour::White: return setTextAttribute( FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_BLUE ); case Colour::Red: return setTextAttribute( FOREGROUND_RED ); case Colour::Green: return setTextAttribute( FOREGROUND_GREEN ); case Colour::Blue: return setTextAttribute( FOREGROUND_BLUE ); case Colour::Cyan: return setTextAttribute( FOREGROUND_BLUE | FOREGROUND_GREEN ); case Colour::Yellow: return setTextAttribute( FOREGROUND_RED | FOREGROUND_GREEN ); case Colour::Grey: return setTextAttribute( 0 ); case Colour::LightGrey: return setTextAttribute( FOREGROUND_INTENSITY ); case Colour::BrightRed: return setTextAttribute( FOREGROUND_INTENSITY | FOREGROUND_RED ); case Colour::BrightGreen: return setTextAttribute( FOREGROUND_INTENSITY | FOREGROUND_GREEN ); case Colour::BrightWhite: return setTextAttribute( FOREGROUND_INTENSITY | FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_BLUE ); case Colour::Bright: throw std::logic_error( "not a colour" ); } } private: void setTextAttribute( WORD _textAttribute ) { SetConsoleTextAttribute( stdoutHandle, _textAttribute | originalBackgroundAttributes ); } HANDLE stdoutHandle; WORD originalForegroundAttributes; WORD originalBackgroundAttributes; }; IColourImpl* platformColourInstance() { static Win32ColourImpl s_instance; Ptr<IConfig const> config = getCurrentContext().getConfig(); UseColour::YesOrNo colourMode = config ? config->useColour() : UseColour::Auto; if( colourMode == UseColour::Auto ) colourMode = !isDebuggerActive() ? UseColour::Yes : UseColour::No; return colourMode == UseColour::Yes ? &s_instance : NoColourImpl::instance(); } } // end anon namespace } // end namespace Catch #elif defined( CATCH_CONFIG_COLOUR_ANSI ) ////////////////////////////////////// #include <unistd.h> namespace Catch { namespace { // use POSIX/ ANSI console terminal codes // Thanks to Adam Strzelecki for original contribution // (http://github.com/nanoant) // https://github.com/philsquared/Catch/pull/131 class PosixColourImpl : public IColourImpl { public: virtual void use( Colour::Code _colourCode ) { switch( _colourCode ) { case Colour::None: case Colour::White: return setColour( "[0m" ); case Colour::Red: return setColour( "[0;31m" ); case Colour::Green: return setColour( "[0;32m" ); case Colour::Blue: return setColour( "[0:34m" ); case Colour::Cyan: return setColour( "[0;36m" ); case Colour::Yellow: return setColour( "[0;33m" ); case Colour::Grey: return setColour( "[1;30m" ); case Colour::LightGrey: return setColour( "[0;37m" ); case Colour::BrightRed: return setColour( "[1;31m" ); case Colour::BrightGreen: return setColour( "[1;32m" ); case Colour::BrightWhite: return setColour( "[1;37m" ); case Colour::Bright: throw std::logic_error( "not a colour" ); } } static IColourImpl* instance() { static PosixColourImpl s_instance; return &s_instance; } private: void setColour( const char* _escapeCode ) { Catch::cout() << '\033' << _escapeCode; } }; IColourImpl* platformColourInstance() { Ptr<IConfig const> config = getCurrentContext().getConfig(); UseColour::YesOrNo colourMode = config ? config->useColour() : UseColour::Auto; if( colourMode == UseColour::Auto ) colourMode = (!isDebuggerActive() && isatty(STDOUT_FILENO) ) ? UseColour::Yes : UseColour::No; return colourMode == UseColour::Yes ? PosixColourImpl::instance() : NoColourImpl::instance(); } } // end anon namespace } // end namespace Catch #else // not Windows or ANSI /////////////////////////////////////////////// namespace Catch { static IColourImpl* platformColourInstance() { return NoColourImpl::instance(); } } // end namespace Catch #endif // Windows/ ANSI/ None namespace Catch { Colour::Colour( Code _colourCode ) : m_moved( false ) { use( _colourCode ); } Colour::Colour( Colour const& _other ) : m_moved( false ) { const_cast<Colour&>( _other ).m_moved = true; } Colour::~Colour(){ if( !m_moved ) use( None ); } void Colour::use( Code _colourCode ) { static IColourImpl* impl = platformColourInstance(); impl->use( _colourCode ); } } // end namespace Catch // #included from: catch_generators_impl.hpp #define TWOBLUECUBES_CATCH_GENERATORS_IMPL_HPP_INCLUDED #include <vector> #include <string> #include <map> namespace Catch { struct GeneratorInfo : IGeneratorInfo { GeneratorInfo( std::size_t size ) : m_size( size ), m_currentIndex( 0 ) {} bool moveNext() { if( ++m_currentIndex == m_size ) { m_currentIndex = 0; return false; } return true; } std::size_t getCurrentIndex() const { return m_currentIndex; } std::size_t m_size; std::size_t m_currentIndex; }; /////////////////////////////////////////////////////////////////////////// class GeneratorsForTest : public IGeneratorsForTest { public: ~GeneratorsForTest() { deleteAll( m_generatorsInOrder ); } IGeneratorInfo& getGeneratorInfo( std::string const& fileInfo, std::size_t size ) { std::map<std::string, IGeneratorInfo*>::const_iterator it = m_generatorsByName.find( fileInfo ); if( it == m_generatorsByName.end() ) { IGeneratorInfo* info = new GeneratorInfo( size ); m_generatorsByName.insert( std::make_pair( fileInfo, info ) ); m_generatorsInOrder.push_back( info ); return *info; } return *it->second; } bool moveNext() { std::vector<IGeneratorInfo*>::const_iterator it = m_generatorsInOrder.begin(); std::vector<IGeneratorInfo*>::const_iterator itEnd = m_generatorsInOrder.end(); for(; it != itEnd; ++it ) { if( (*it)->moveNext() ) return true; } return false; } private: std::map<std::string, IGeneratorInfo*> m_generatorsByName; std::vector<IGeneratorInfo*> m_generatorsInOrder; }; IGeneratorsForTest* createGeneratorsForTest() { return new GeneratorsForTest(); } } // end namespace Catch // #included from: catch_assertionresult.hpp #define TWOBLUECUBES_CATCH_ASSERTIONRESULT_HPP_INCLUDED namespace Catch { AssertionInfo::AssertionInfo( std::string const& _macroName, SourceLineInfo const& _lineInfo, std::string const& _capturedExpression, ResultDisposition::Flags _resultDisposition ) : macroName( _macroName ), lineInfo( _lineInfo ), capturedExpression( _capturedExpression ), resultDisposition( _resultDisposition ) {} AssertionResult::AssertionResult() {} AssertionResult::AssertionResult( AssertionInfo const& info, AssertionResultData const& data ) : m_info( info ), m_resultData( data ) {} AssertionResult::~AssertionResult() {} // Result was a success bool AssertionResult::succeeded() const { return Catch::isOk( m_resultData.resultType ); } // Result was a success, or failure is suppressed bool AssertionResult::isOk() const { return Catch::isOk( m_resultData.resultType ) || shouldSuppressFailure( m_info.resultDisposition ); } ResultWas::OfType AssertionResult::getResultType() const { return m_resultData.resultType; } bool AssertionResult::hasExpression() const { return !m_info.capturedExpression.empty(); } bool AssertionResult::hasMessage() const { return !m_resultData.message.empty(); } std::string AssertionResult::getExpression() const { if( isFalseTest( m_info.resultDisposition ) ) return "!" + m_info.capturedExpression; else return m_info.capturedExpression; } std::string AssertionResult::getExpressionInMacro() const { if( m_info.macroName.empty() ) return m_info.capturedExpression; else return m_info.macroName + "( " + m_info.capturedExpression + " )"; } bool AssertionResult::hasExpandedExpression() const { return hasExpression() && getExpandedExpression() != getExpression(); } std::string AssertionResult::getExpandedExpression() const { return m_resultData.reconstructedExpression; } std::string AssertionResult::getMessage() const { return m_resultData.message; } SourceLineInfo AssertionResult::getSourceInfo() const { return m_info.lineInfo; } std::string AssertionResult::getTestMacroName() const { return m_info.macroName; } } // end namespace Catch // #included from: catch_test_case_info.hpp #define TWOBLUECUBES_CATCH_TEST_CASE_INFO_HPP_INCLUDED namespace Catch { inline TestCaseInfo::SpecialProperties parseSpecialTag( std::string const& tag ) { if( startsWith( tag, "." ) || tag == "hide" || tag == "!hide" ) return TestCaseInfo::IsHidden; else if( tag == "!throws" ) return TestCaseInfo::Throws; else if( tag == "!shouldfail" ) return TestCaseInfo::ShouldFail; else if( tag == "!mayfail" ) return TestCaseInfo::MayFail; else return TestCaseInfo::None; } inline bool isReservedTag( std::string const& tag ) { return parseSpecialTag( tag ) == TestCaseInfo::None && tag.size() > 0 && !isalnum( tag[0] ); } inline void enforceNotReservedTag( std::string const& tag, SourceLineInfo const& _lineInfo ) { if( isReservedTag( tag ) ) { { Colour colourGuard( Colour::Red ); Catch::cerr() << "Tag name [" << tag << "] not allowed.\n" << "Tag names starting with non alpha-numeric characters are reserved\n"; } { Colour colourGuard( Colour::FileName ); Catch::cerr() << _lineInfo << std::endl; } exit(1); } } TestCase makeTestCase( ITestCase* _testCase, std::string const& _className, std::string const& _name, std::string const& _descOrTags, SourceLineInfo const& _lineInfo ) { bool isHidden( startsWith( _name, "./" ) ); // Legacy support // Parse out tags std::set<std::string> tags; std::string desc, tag; bool inTag = false; for( std::size_t i = 0; i < _descOrTags.size(); ++i ) { char c = _descOrTags[i]; if( !inTag ) { if( c == '[' ) inTag = true; else desc += c; } else { if( c == ']' ) { TestCaseInfo::SpecialProperties prop = parseSpecialTag( tag ); if( prop == TestCaseInfo::IsHidden ) isHidden = true; else if( prop == TestCaseInfo::None ) enforceNotReservedTag( tag, _lineInfo ); tags.insert( tag ); tag.clear(); inTag = false; } else tag += c; } } if( isHidden ) { tags.insert( "hide" ); tags.insert( "." ); } TestCaseInfo info( _name, _className, desc, tags, _lineInfo ); return TestCase( _testCase, info ); } void setTags( TestCaseInfo& testCaseInfo, std::set<std::string> const& tags ) { testCaseInfo.tags = tags; testCaseInfo.lcaseTags.clear(); std::ostringstream oss; for( std::set<std::string>::const_iterator it = tags.begin(), itEnd = tags.end(); it != itEnd; ++it ) { oss << "[" << *it << "]"; std::string lcaseTag = toLower( *it ); testCaseInfo.properties = static_cast<TestCaseInfo::SpecialProperties>( testCaseInfo.properties | parseSpecialTag( lcaseTag ) ); testCaseInfo.lcaseTags.insert( lcaseTag ); } testCaseInfo.tagsAsString = oss.str(); } TestCaseInfo::TestCaseInfo( std::string const& _name, std::string const& _className, std::string const& _description, std::set<std::string> const& _tags, SourceLineInfo const& _lineInfo ) : name( _name ), className( _className ), description( _description ), lineInfo( _lineInfo ), properties( None ) { setTags( *this, _tags ); } TestCaseInfo::TestCaseInfo( TestCaseInfo const& other ) : name( other.name ), className( other.className ), description( other.description ), tags( other.tags ), lcaseTags( other.lcaseTags ), tagsAsString( other.tagsAsString ), lineInfo( other.lineInfo ), properties( other.properties ) {} bool TestCaseInfo::isHidden() const { return ( properties & IsHidden ) != 0; } bool TestCaseInfo::throws() const { return ( properties & Throws ) != 0; } bool TestCaseInfo::okToFail() const { return ( properties & (ShouldFail | MayFail ) ) != 0; } bool TestCaseInfo::expectedToFail() const { return ( properties & (ShouldFail ) ) != 0; } TestCase::TestCase( ITestCase* testCase, TestCaseInfo const& info ) : TestCaseInfo( info ), test( testCase ) {} TestCase::TestCase( TestCase const& other ) : TestCaseInfo( other ), test( other.test ) {} TestCase TestCase::withName( std::string const& _newName ) const { TestCase other( *this ); other.name = _newName; return other; } void TestCase::swap( TestCase& other ) { test.swap( other.test ); name.swap( other.name ); className.swap( other.className ); description.swap( other.description ); tags.swap( other.tags ); lcaseTags.swap( other.lcaseTags ); tagsAsString.swap( other.tagsAsString ); std::swap( TestCaseInfo::properties, static_cast<TestCaseInfo&>( other ).properties ); std::swap( lineInfo, other.lineInfo ); } void TestCase::invoke() const { test->invoke(); } bool TestCase::operator == ( TestCase const& other ) const { return test.get() == other.test.get() && name == other.name && className == other.className; } bool TestCase::operator < ( TestCase const& other ) const { return name < other.name; } TestCase& TestCase::operator = ( TestCase const& other ) { TestCase temp( other ); swap( temp ); return *this; } TestCaseInfo const& TestCase::getTestCaseInfo() const { return *this; } } // end namespace Catch // #included from: catch_version.hpp #define TWOBLUECUBES_CATCH_VERSION_HPP_INCLUDED namespace Catch { Version::Version ( unsigned int _majorVersion, unsigned int _minorVersion, unsigned int _patchNumber, std::string const& _branchName, unsigned int _buildNumber ) : majorVersion( _majorVersion ), minorVersion( _minorVersion ), patchNumber( _patchNumber ), branchName( _branchName ), buildNumber( _buildNumber ) {} std::ostream& operator << ( std::ostream& os, Version const& version ) { os << version.majorVersion << "." << version.minorVersion << "." << version.patchNumber; if( !version.branchName.empty() ) { os << "-" << version.branchName << "." << version.buildNumber; } return os; } Version libraryVersion( 1, 5, 9, "", 0 ); } // #included from: catch_message.hpp #define TWOBLUECUBES_CATCH_MESSAGE_HPP_INCLUDED namespace Catch { MessageInfo::MessageInfo( std::string const& _macroName, SourceLineInfo const& _lineInfo, ResultWas::OfType _type ) : macroName( _macroName ), lineInfo( _lineInfo ), type( _type ), sequence( ++globalCount ) {} // This may need protecting if threading support is added unsigned int MessageInfo::globalCount = 0; //////////////////////////////////////////////////////////////////////////// ScopedMessage::ScopedMessage( MessageBuilder const& builder ) : m_info( builder.m_info ) { m_info.message = builder.m_stream.str(); getResultCapture().pushScopedMessage( m_info ); } ScopedMessage::ScopedMessage( ScopedMessage const& other ) : m_info( other.m_info ) {} ScopedMessage::~ScopedMessage() { getResultCapture().popScopedMessage( m_info ); } } // end namespace Catch // #included from: catch_legacy_reporter_adapter.hpp #define TWOBLUECUBES_CATCH_LEGACY_REPORTER_ADAPTER_HPP_INCLUDED // #included from: catch_legacy_reporter_adapter.h #define TWOBLUECUBES_CATCH_LEGACY_REPORTER_ADAPTER_H_INCLUDED namespace Catch { // Deprecated struct IReporter : IShared { virtual ~IReporter(); virtual bool shouldRedirectStdout() const = 0; virtual void StartTesting() = 0; virtual void EndTesting( Totals const& totals ) = 0; virtual void StartGroup( std::string const& groupName ) = 0; virtual void EndGroup( std::string const& groupName, Totals const& totals ) = 0; virtual void StartTestCase( TestCaseInfo const& testInfo ) = 0; virtual void EndTestCase( TestCaseInfo const& testInfo, Totals const& totals, std::string const& stdOut, std::string const& stdErr ) = 0; virtual void StartSection( std::string const& sectionName, std::string const& description ) = 0; virtual void EndSection( std::string const& sectionName, Counts const& assertions ) = 0; virtual void NoAssertionsInSection( std::string const& sectionName ) = 0; virtual void NoAssertionsInTestCase( std::string const& testName ) = 0; virtual void Aborted() = 0; virtual void Result( AssertionResult const& result ) = 0; }; class LegacyReporterAdapter : public SharedImpl<IStreamingReporter> { public: LegacyReporterAdapter( Ptr<IReporter> const& legacyReporter ); virtual ~LegacyReporterAdapter(); virtual ReporterPreferences getPreferences() const; virtual void noMatchingTestCases( std::string const& ); virtual void testRunStarting( TestRunInfo const& ); virtual void testGroupStarting( GroupInfo const& groupInfo ); virtual void testCaseStarting( TestCaseInfo const& testInfo ); virtual void sectionStarting( SectionInfo const& sectionInfo ); virtual void assertionStarting( AssertionInfo const& ); virtual bool assertionEnded( AssertionStats const& assertionStats ); virtual void sectionEnded( SectionStats const& sectionStats ); virtual void testCaseEnded( TestCaseStats const& testCaseStats ); virtual void testGroupEnded( TestGroupStats const& testGroupStats ); virtual void testRunEnded( TestRunStats const& testRunStats ); virtual void skipTest( TestCaseInfo const& ); private: Ptr<IReporter> m_legacyReporter; }; } namespace Catch { LegacyReporterAdapter::LegacyReporterAdapter( Ptr<IReporter> const& legacyReporter ) : m_legacyReporter( legacyReporter ) {} LegacyReporterAdapter::~LegacyReporterAdapter() {} ReporterPreferences LegacyReporterAdapter::getPreferences() const { ReporterPreferences prefs; prefs.shouldRedirectStdOut = m_legacyReporter->shouldRedirectStdout(); return prefs; } void LegacyReporterAdapter::noMatchingTestCases( std::string const& ) {} void LegacyReporterAdapter::testRunStarting( TestRunInfo const& ) { m_legacyReporter->StartTesting(); } void LegacyReporterAdapter::testGroupStarting( GroupInfo const& groupInfo ) { m_legacyReporter->StartGroup( groupInfo.name ); } void LegacyReporterAdapter::testCaseStarting( TestCaseInfo const& testInfo ) { m_legacyReporter->StartTestCase( testInfo ); } void LegacyReporterAdapter::sectionStarting( SectionInfo const& sectionInfo ) { m_legacyReporter->StartSection( sectionInfo.name, sectionInfo.description ); } void LegacyReporterAdapter::assertionStarting( AssertionInfo const& ) { // Not on legacy interface } bool LegacyReporterAdapter::assertionEnded( AssertionStats const& assertionStats ) { if( assertionStats.assertionResult.getResultType() != ResultWas::Ok ) { for( std::vector<MessageInfo>::const_iterator it = assertionStats.infoMessages.begin(), itEnd = assertionStats.infoMessages.end(); it != itEnd; ++it ) { if( it->type == ResultWas::Info ) { ResultBuilder rb( it->macroName.c_str(), it->lineInfo, "", ResultDisposition::Normal ); rb << it->message; rb.setResultType( ResultWas::Info ); AssertionResult result = rb.build(); m_legacyReporter->Result( result ); } } } m_legacyReporter->Result( assertionStats.assertionResult ); return true; } void LegacyReporterAdapter::sectionEnded( SectionStats const& sectionStats ) { if( sectionStats.missingAssertions ) m_legacyReporter->NoAssertionsInSection( sectionStats.sectionInfo.name ); m_legacyReporter->EndSection( sectionStats.sectionInfo.name, sectionStats.assertions ); } void LegacyReporterAdapter::testCaseEnded( TestCaseStats const& testCaseStats ) { m_legacyReporter->EndTestCase ( testCaseStats.testInfo, testCaseStats.totals, testCaseStats.stdOut, testCaseStats.stdErr ); } void LegacyReporterAdapter::testGroupEnded( TestGroupStats const& testGroupStats ) { if( testGroupStats.aborting ) m_legacyReporter->Aborted(); m_legacyReporter->EndGroup( testGroupStats.groupInfo.name, testGroupStats.totals ); } void LegacyReporterAdapter::testRunEnded( TestRunStats const& testRunStats ) { m_legacyReporter->EndTesting( testRunStats.totals ); } void LegacyReporterAdapter::skipTest( TestCaseInfo const& ) { } } // #included from: catch_timer.hpp #ifdef __clang__ #pragma clang diagnostic push #pragma clang diagnostic ignored "-Wc++11-long-long" #endif #ifdef CATCH_PLATFORM_WINDOWS #include <windows.h> #else #include <sys/time.h> #endif namespace Catch { namespace { #ifdef CATCH_PLATFORM_WINDOWS uint64_t getCurrentTicks() { static uint64_t hz=0, hzo=0; if (!hz) { QueryPerformanceFrequency( reinterpret_cast<LARGE_INTEGER*>( &hz ) ); QueryPerformanceCounter( reinterpret_cast<LARGE_INTEGER*>( &hzo ) ); } uint64_t t; QueryPerformanceCounter( reinterpret_cast<LARGE_INTEGER*>( &t ) ); return ((t-hzo)*1000000)/hz; } #else uint64_t getCurrentTicks() { timeval t; gettimeofday(&t,CATCH_NULL); return static_cast<uint64_t>( t.tv_sec ) * 1000000ull + static_cast<uint64_t>( t.tv_usec ); } #endif } void Timer::start() { m_ticks = getCurrentTicks(); } unsigned int Timer::getElapsedMicroseconds() const { return static_cast<unsigned int>(getCurrentTicks() - m_ticks); } unsigned int Timer::getElapsedMilliseconds() const { return static_cast<unsigned int>(getElapsedMicroseconds()/1000); } double Timer::getElapsedSeconds() const { return getElapsedMicroseconds()/1000000.0; } } // namespace Catch #ifdef __clang__ #pragma clang diagnostic pop #endif // #included from: catch_common.hpp #define TWOBLUECUBES_CATCH_COMMON_HPP_INCLUDED namespace Catch { bool startsWith( std::string const& s, std::string const& prefix ) { return s.size() >= prefix.size() && s.substr( 0, prefix.size() ) == prefix; } bool endsWith( std::string const& s, std::string const& suffix ) { return s.size() >= suffix.size() && s.substr( s.size()-suffix.size(), suffix.size() ) == suffix; } bool contains( std::string const& s, std::string const& infix ) { return s.find( infix ) != std::string::npos; } char toLowerCh(char c) { return static_cast<char>( ::tolower( c ) ); } void toLowerInPlace( std::string& s ) { std::transform( s.begin(), s.end(), s.begin(), toLowerCh ); } std::string toLower( std::string const& s ) { std::string lc = s; toLowerInPlace( lc ); return lc; } std::string trim( std::string const& str ) { static char const* whitespaceChars = "\n\r\t "; std::string::size_type start = str.find_first_not_of( whitespaceChars ); std::string::size_type end = str.find_last_not_of( whitespaceChars ); return start != std::string::npos ? str.substr( start, 1+end-start ) : ""; } bool replaceInPlace( std::string& str, std::string const& replaceThis, std::string const& withThis ) { bool replaced = false; std::size_t i = str.find( replaceThis ); while( i != std::string::npos ) { replaced = true; str = str.substr( 0, i ) + withThis + str.substr( i+replaceThis.size() ); if( i < str.size()-withThis.size() ) i = str.find( replaceThis, i+withThis.size() ); else i = std::string::npos; } return replaced; } pluralise::pluralise( std::size_t count, std::string const& label ) : m_count( count ), m_label( label ) {} std::ostream& operator << ( std::ostream& os, pluralise const& pluraliser ) { os << pluraliser.m_count << " " << pluraliser.m_label; if( pluraliser.m_count != 1 ) os << "s"; return os; } SourceLineInfo::SourceLineInfo() : line( 0 ){} SourceLineInfo::SourceLineInfo( char const* _file, std::size_t _line ) : file( _file ), line( _line ) {} SourceLineInfo::SourceLineInfo( SourceLineInfo const& other ) : file( other.file ), line( other.line ) {} bool SourceLineInfo::empty() const { return file.empty(); } bool SourceLineInfo::operator == ( SourceLineInfo const& other ) const { return line == other.line && file == other.file; } bool SourceLineInfo::operator < ( SourceLineInfo const& other ) const { return line < other.line || ( line == other.line && file < other.file ); } void seedRng( IConfig const& config ) { if( config.rngSeed() != 0 ) std::srand( config.rngSeed() ); } unsigned int rngSeed() { return getCurrentContext().getConfig()->rngSeed(); } std::ostream& operator << ( std::ostream& os, SourceLineInfo const& info ) { #ifndef __GNUG__ os << info.file << "(" << info.line << ")"; #else os << info.file << ":" << info.line; #endif return os; } void throwLogicError( std::string const& message, SourceLineInfo const& locationInfo ) { std::ostringstream oss; oss << locationInfo << ": Internal Catch error: '" << message << "'"; if( alwaysTrue() ) throw std::logic_error( oss.str() ); } } // #included from: catch_section.hpp #define TWOBLUECUBES_CATCH_SECTION_HPP_INCLUDED namespace Catch { SectionInfo::SectionInfo ( SourceLineInfo const& _lineInfo, std::string const& _name, std::string const& _description ) : name( _name ), description( _description ), lineInfo( _lineInfo ) {} Section::Section( SectionInfo const& info ) : m_info( info ), m_sectionIncluded( getResultCapture().sectionStarted( m_info, m_assertions ) ) { m_timer.start(); } Section::~Section() { if( m_sectionIncluded ) { SectionEndInfo endInfo( m_info, m_assertions, m_timer.getElapsedSeconds() ); if( std::uncaught_exception() ) getResultCapture().sectionEndedEarly( endInfo ); else getResultCapture().sectionEnded( endInfo ); } } // This indicates whether the section should be executed or not Section::operator bool() const { return m_sectionIncluded; } } // end namespace Catch // #included from: catch_debugger.hpp #define TWOBLUECUBES_CATCH_DEBUGGER_HPP_INCLUDED #include <iostream> #ifdef CATCH_PLATFORM_MAC #include <assert.h> #include <stdbool.h> #include <sys/types.h> #include <unistd.h> #include <sys/sysctl.h> namespace Catch{ // The following function is taken directly from the following technical note: // http://developer.apple.com/library/mac/#qa/qa2004/qa1361.html // Returns true if the current process is being debugged (either // running under the debugger or has a debugger attached post facto). bool isDebuggerActive(){ int mib[4]; struct kinfo_proc info; size_t size; // Initialize the flags so that, if sysctl fails for some bizarre // reason, we get a predictable result. info.kp_proc.p_flag = 0; // Initialize mib, which tells sysctl the info we want, in this case // we're looking for information about a specific process ID. mib[0] = CTL_KERN; mib[1] = KERN_PROC; mib[2] = KERN_PROC_PID; mib[3] = getpid(); // Call sysctl. size = sizeof(info); if( sysctl(mib, sizeof(mib) / sizeof(*mib), &info, &size, CATCH_NULL, 0) != 0 ) { Catch::cerr() << "\n** Call to sysctl failed - unable to determine if debugger is active **\n" << std::endl; return false; } // We're being debugged if the P_TRACED flag is set. return ( (info.kp_proc.p_flag & P_TRACED) != 0 ); } } // namespace Catch #elif defined(_MSC_VER) extern "C" __declspec(dllimport) int __stdcall IsDebuggerPresent(); namespace Catch { bool isDebuggerActive() { return IsDebuggerPresent() != 0; } } #elif defined(__MINGW32__) extern "C" __declspec(dllimport) int __stdcall IsDebuggerPresent(); namespace Catch { bool isDebuggerActive() { return IsDebuggerPresent() != 0; } } #else namespace Catch { inline bool isDebuggerActive() { return false; } } #endif // Platform #ifdef CATCH_PLATFORM_WINDOWS extern "C" __declspec(dllimport) void __stdcall OutputDebugStringA( const char* ); namespace Catch { void writeToDebugConsole( std::string const& text ) { ::OutputDebugStringA( text.c_str() ); } } #else namespace Catch { void writeToDebugConsole( std::string const& text ) { // !TBD: Need a version for Mac/ XCode and other IDEs Catch::cout() << text; } } #endif // Platform // #included from: catch_tostring.hpp #define TWOBLUECUBES_CATCH_TOSTRING_HPP_INCLUDED namespace Catch { namespace Detail { const std::string unprintableString = "{?}"; namespace { const int hexThreshold = 255; struct Endianness { enum Arch { Big, Little }; static Arch which() { union _{ int asInt; char asChar[sizeof (int)]; } u; u.asInt = 1; return ( u.asChar[sizeof(int)-1] == 1 ) ? Big : Little; } }; } std::string rawMemoryToString( const void *object, std::size_t size ) { // Reverse order for little endian architectures int i = 0, end = static_cast<int>( size ), inc = 1; if( Endianness::which() == Endianness::Little ) { i = end-1; end = inc = -1; } unsigned char const *bytes = static_cast<unsigned char const *>(object); std::ostringstream os; os << "0x" << std::setfill('0') << std::hex; for( ; i != end; i += inc ) os << std::setw(2) << static_cast<unsigned>(bytes[i]); return os.str(); } } std::string toString( std::string const& value ) { std::string s = value; if( getCurrentContext().getConfig()->showInvisibles() ) { for(size_t i = 0; i < s.size(); ++i ) { std::string subs; switch( s[i] ) { case '\n': subs = "\\n"; break; case '\t': subs = "\\t"; break; default: break; } if( !subs.empty() ) { s = s.substr( 0, i ) + subs + s.substr( i+1 ); ++i; } } } return "\"" + s + "\""; } std::string toString( std::wstring const& value ) { std::string s; s.reserve( value.size() ); for(size_t i = 0; i < value.size(); ++i ) s += value[i] <= 0xff ? static_cast<char>( value[i] ) : '?'; return Catch::toString( s ); } std::string toString( const char* const value ) { return value ? Catch::toString( std::string( value ) ) : std::string( "{null string}" ); } std::string toString( char* const value ) { return Catch::toString( static_cast<const char*>( value ) ); } std::string toString( const wchar_t* const value ) { return value ? Catch::toString( std::wstring(value) ) : std::string( "{null string}" ); } std::string toString( wchar_t* const value ) { return Catch::toString( static_cast<const wchar_t*>( value ) ); } std::string toString( int value ) { std::ostringstream oss; oss << value; if( value > Detail::hexThreshold ) oss << " (0x" << std::hex << value << ")"; return oss.str(); } std::string toString( unsigned long value ) { std::ostringstream oss; oss << value; if( value > Detail::hexThreshold ) oss << " (0x" << std::hex << value << ")"; return oss.str(); } std::string toString( unsigned int value ) { return Catch::toString( static_cast<unsigned long>( value ) ); } template<typename T> std::string fpToString( T value, int precision ) { std::ostringstream oss; oss << std::setprecision( precision ) << std::fixed << value; std::string d = oss.str(); std::size_t i = d.find_last_not_of( '0' ); if( i != std::string::npos && i != d.size()-1 ) { if( d[i] == '.' ) i++; d = d.substr( 0, i+1 ); } return d; } std::string toString( const double value ) { return fpToString( value, 10 ); } std::string toString( const float value ) { return fpToString( value, 5 ) + "f"; } std::string toString( bool value ) { return value ? "true" : "false"; } std::string toString( char value ) { return value < ' ' ? toString( static_cast<unsigned int>( value ) ) : Detail::makeString( value ); } std::string toString( signed char value ) { return toString( static_cast<char>( value ) ); } std::string toString( unsigned char value ) { return toString( static_cast<char>( value ) ); } #ifdef CATCH_CONFIG_CPP11_LONG_LONG std::string toString( long long value ) { std::ostringstream oss; oss << value; if( value > Detail::hexThreshold ) oss << " (0x" << std::hex << value << ")"; return oss.str(); } std::string toString( unsigned long long value ) { std::ostringstream oss; oss << value; if( value > Detail::hexThreshold ) oss << " (0x" << std::hex << value << ")"; return oss.str(); } #endif #ifdef CATCH_CONFIG_CPP11_NULLPTR std::string toString( std::nullptr_t ) { return "nullptr"; } #endif #ifdef __OBJC__ std::string toString( NSString const * const& nsstring ) { if( !nsstring ) return "nil"; return "@" + toString([nsstring UTF8String]); } std::string toString( NSString * CATCH_ARC_STRONG const& nsstring ) { if( !nsstring ) return "nil"; return "@" + toString([nsstring UTF8String]); } std::string toString( NSObject* const& nsObject ) { return toString( [nsObject description] ); } #endif } // end namespace Catch // #included from: catch_result_builder.hpp #define TWOBLUECUBES_CATCH_RESULT_BUILDER_HPP_INCLUDED namespace Catch { std::string capturedExpressionWithSecondArgument( std::string const& capturedExpression, std::string const& secondArg ) { return secondArg.empty() || secondArg == "\"\"" ? capturedExpression : capturedExpression + ", " + secondArg; } ResultBuilder::ResultBuilder( char const* macroName, SourceLineInfo const& lineInfo, char const* capturedExpression, ResultDisposition::Flags resultDisposition, char const* secondArg ) : m_assertionInfo( macroName, lineInfo, capturedExpressionWithSecondArgument( capturedExpression, secondArg ), resultDisposition ), m_shouldDebugBreak( false ), m_shouldThrow( false ) {} ResultBuilder& ResultBuilder::setResultType( ResultWas::OfType result ) { m_data.resultType = result; return *this; } ResultBuilder& ResultBuilder::setResultType( bool result ) { m_data.resultType = result ? ResultWas::Ok : ResultWas::ExpressionFailed; return *this; } ResultBuilder& ResultBuilder::setLhs( std::string const& lhs ) { m_exprComponents.lhs = lhs; return *this; } ResultBuilder& ResultBuilder::setRhs( std::string const& rhs ) { m_exprComponents.rhs = rhs; return *this; } ResultBuilder& ResultBuilder::setOp( std::string const& op ) { m_exprComponents.op = op; return *this; } void ResultBuilder::endExpression() { m_exprComponents.testFalse = isFalseTest( m_assertionInfo.resultDisposition ); captureExpression(); } void ResultBuilder::useActiveException( ResultDisposition::Flags resultDisposition ) { m_assertionInfo.resultDisposition = resultDisposition; m_stream.oss << Catch::translateActiveException(); captureResult( ResultWas::ThrewException ); } void ResultBuilder::captureResult( ResultWas::OfType resultType ) { setResultType( resultType ); captureExpression(); } void ResultBuilder::captureExpectedException( std::string const& expectedMessage ) { if( expectedMessage.empty() ) captureExpectedException( Matchers::Impl::Generic::AllOf<std::string>() ); else captureExpectedException( Matchers::Equals( expectedMessage ) ); } void ResultBuilder::captureExpectedException( Matchers::Impl::Matcher<std::string> const& matcher ) { assert( m_exprComponents.testFalse == false ); AssertionResultData data = m_data; data.resultType = ResultWas::Ok; data.reconstructedExpression = m_assertionInfo.capturedExpression; std::string actualMessage = Catch::translateActiveException(); if( !matcher.match( actualMessage ) ) { data.resultType = ResultWas::ExpressionFailed; data.reconstructedExpression = actualMessage; } AssertionResult result( m_assertionInfo, data ); handleResult( result ); } void ResultBuilder::captureExpression() { AssertionResult result = build(); handleResult( result ); } void ResultBuilder::handleResult( AssertionResult const& result ) { getResultCapture().assertionEnded( result ); if( !result.isOk() ) { if( getCurrentContext().getConfig()->shouldDebugBreak() ) m_shouldDebugBreak = true; if( getCurrentContext().getRunner()->aborting() || (m_assertionInfo.resultDisposition & ResultDisposition::Normal) ) m_shouldThrow = true; } } void ResultBuilder::react() { if( m_shouldThrow ) throw Catch::TestFailureException(); } bool ResultBuilder::shouldDebugBreak() const { return m_shouldDebugBreak; } bool ResultBuilder::allowThrows() const { return getCurrentContext().getConfig()->allowThrows(); } AssertionResult ResultBuilder::build() const { assert( m_data.resultType != ResultWas::Unknown ); AssertionResultData data = m_data; // Flip bool results if testFalse is set if( m_exprComponents.testFalse ) { if( data.resultType == ResultWas::Ok ) data.resultType = ResultWas::ExpressionFailed; else if( data.resultType == ResultWas::ExpressionFailed ) data.resultType = ResultWas::Ok; } data.message = m_stream.oss.str(); data.reconstructedExpression = reconstructExpression(); if( m_exprComponents.testFalse ) { if( m_exprComponents.op == "" ) data.reconstructedExpression = "!" + data.reconstructedExpression; else data.reconstructedExpression = "!(" + data.reconstructedExpression + ")"; } return AssertionResult( m_assertionInfo, data ); } std::string ResultBuilder::reconstructExpression() const { if( m_exprComponents.op == "" ) return m_exprComponents.lhs.empty() ? m_assertionInfo.capturedExpression : m_exprComponents.op + m_exprComponents.lhs; else if( m_exprComponents.op == "matches" ) return m_exprComponents.lhs + " " + m_exprComponents.rhs; else if( m_exprComponents.op != "!" ) { if( m_exprComponents.lhs.size() + m_exprComponents.rhs.size() < 40 && m_exprComponents.lhs.find("\n") == std::string::npos && m_exprComponents.rhs.find("\n") == std::string::npos ) return m_exprComponents.lhs + " " + m_exprComponents.op + " " + m_exprComponents.rhs; else return m_exprComponents.lhs + "\n" + m_exprComponents.op + "\n" + m_exprComponents.rhs; } else return "{can't expand - use " + m_assertionInfo.macroName + "_FALSE( " + m_assertionInfo.capturedExpression.substr(1) + " ) instead of " + m_assertionInfo.macroName + "( " + m_assertionInfo.capturedExpression + " ) for better diagnostics}"; } } // end namespace Catch // #included from: catch_tag_alias_registry.hpp #define TWOBLUECUBES_CATCH_TAG_ALIAS_REGISTRY_HPP_INCLUDED // #included from: catch_tag_alias_registry.h #define TWOBLUECUBES_CATCH_TAG_ALIAS_REGISTRY_H_INCLUDED #include <map> namespace Catch { class TagAliasRegistry : public ITagAliasRegistry { public: virtual ~TagAliasRegistry(); virtual Option<TagAlias> find( std::string const& alias ) const; virtual std::string expandAliases( std::string const& unexpandedTestSpec ) const; void add( char const* alias, char const* tag, SourceLineInfo const& lineInfo ); static TagAliasRegistry& get(); private: std::map<std::string, TagAlias> m_registry; }; } // end namespace Catch #include <map> #include <iostream> namespace Catch { TagAliasRegistry::~TagAliasRegistry() {} Option<TagAlias> TagAliasRegistry::find( std::string const& alias ) const { std::map<std::string, TagAlias>::const_iterator it = m_registry.find( alias ); if( it != m_registry.end() ) return it->second; else return Option<TagAlias>(); } std::string TagAliasRegistry::expandAliases( std::string const& unexpandedTestSpec ) const { std::string expandedTestSpec = unexpandedTestSpec; for( std::map<std::string, TagAlias>::const_iterator it = m_registry.begin(), itEnd = m_registry.end(); it != itEnd; ++it ) { std::size_t pos = expandedTestSpec.find( it->first ); if( pos != std::string::npos ) { expandedTestSpec = expandedTestSpec.substr( 0, pos ) + it->second.tag + expandedTestSpec.substr( pos + it->first.size() ); } } return expandedTestSpec; } void TagAliasRegistry::add( char const* alias, char const* tag, SourceLineInfo const& lineInfo ) { if( !startsWith( alias, "[@" ) || !endsWith( alias, "]" ) ) { std::ostringstream oss; oss << "error: tag alias, \"" << alias << "\" is not of the form [@alias name].\n" << lineInfo; throw std::domain_error( oss.str().c_str() ); } if( !m_registry.insert( std::make_pair( alias, TagAlias( tag, lineInfo ) ) ).second ) { std::ostringstream oss; oss << "error: tag alias, \"" << alias << "\" already registered.\n" << "\tFirst seen at " << find(alias)->lineInfo << "\n" << "\tRedefined at " << lineInfo; throw std::domain_error( oss.str().c_str() ); } } TagAliasRegistry& TagAliasRegistry::get() { static TagAliasRegistry instance; return instance; } ITagAliasRegistry::~ITagAliasRegistry() {} ITagAliasRegistry const& ITagAliasRegistry::get() { return TagAliasRegistry::get(); } RegistrarForTagAliases::RegistrarForTagAliases( char const* alias, char const* tag, SourceLineInfo const& lineInfo ) { try { TagAliasRegistry::get().add( alias, tag, lineInfo ); } catch( std::exception& ex ) { Colour colourGuard( Colour::Red ); Catch::cerr() << ex.what() << std::endl; exit(1); } } } // end namespace Catch // #included from: ../reporters/catch_reporter_multi.hpp #define TWOBLUECUBES_CATCH_REPORTER_MULTI_HPP_INCLUDED namespace Catch { class MultipleReporters : public SharedImpl<IStreamingReporter> { typedef std::vector<Ptr<IStreamingReporter> > Reporters; Reporters m_reporters; public: void add( Ptr<IStreamingReporter> const& reporter ) { m_reporters.push_back( reporter ); } public: // IStreamingReporter virtual ReporterPreferences getPreferences() const CATCH_OVERRIDE { return m_reporters[0]->getPreferences(); } virtual void noMatchingTestCases( std::string const& spec ) CATCH_OVERRIDE { for( Reporters::const_iterator it = m_reporters.begin(), itEnd = m_reporters.end(); it != itEnd; ++it ) (*it)->noMatchingTestCases( spec ); } virtual void testRunStarting( TestRunInfo const& testRunInfo ) CATCH_OVERRIDE { for( Reporters::const_iterator it = m_reporters.begin(), itEnd = m_reporters.end(); it != itEnd; ++it ) (*it)->testRunStarting( testRunInfo ); } virtual void testGroupStarting( GroupInfo const& groupInfo ) CATCH_OVERRIDE { for( Reporters::const_iterator it = m_reporters.begin(), itEnd = m_reporters.end(); it != itEnd; ++it ) (*it)->testGroupStarting( groupInfo ); } virtual void testCaseStarting( TestCaseInfo const& testInfo ) CATCH_OVERRIDE { for( Reporters::const_iterator it = m_reporters.begin(), itEnd = m_reporters.end(); it != itEnd; ++it ) (*it)->testCaseStarting( testInfo ); } virtual void sectionStarting( SectionInfo const& sectionInfo ) CATCH_OVERRIDE { for( Reporters::const_iterator it = m_reporters.begin(), itEnd = m_reporters.end(); it != itEnd; ++it ) (*it)->sectionStarting( sectionInfo ); } virtual void assertionStarting( AssertionInfo const& assertionInfo ) CATCH_OVERRIDE { for( Reporters::const_iterator it = m_reporters.begin(), itEnd = m_reporters.end(); it != itEnd; ++it ) (*it)->assertionStarting( assertionInfo ); } // The return value indicates if the messages buffer should be cleared: virtual bool assertionEnded( AssertionStats const& assertionStats ) CATCH_OVERRIDE { bool clearBuffer = false; for( Reporters::const_iterator it = m_reporters.begin(), itEnd = m_reporters.end(); it != itEnd; ++it ) clearBuffer |= (*it)->assertionEnded( assertionStats ); return clearBuffer; } virtual void sectionEnded( SectionStats const& sectionStats ) CATCH_OVERRIDE { for( Reporters::const_iterator it = m_reporters.begin(), itEnd = m_reporters.end(); it != itEnd; ++it ) (*it)->sectionEnded( sectionStats ); } virtual void testCaseEnded( TestCaseStats const& testCaseStats ) CATCH_OVERRIDE { for( Reporters::const_iterator it = m_reporters.begin(), itEnd = m_reporters.end(); it != itEnd; ++it ) (*it)->testCaseEnded( testCaseStats ); } virtual void testGroupEnded( TestGroupStats const& testGroupStats ) CATCH_OVERRIDE { for( Reporters::const_iterator it = m_reporters.begin(), itEnd = m_reporters.end(); it != itEnd; ++it ) (*it)->testGroupEnded( testGroupStats ); } virtual void testRunEnded( TestRunStats const& testRunStats ) CATCH_OVERRIDE { for( Reporters::const_iterator it = m_reporters.begin(), itEnd = m_reporters.end(); it != itEnd; ++it ) (*it)->testRunEnded( testRunStats ); } virtual void skipTest( TestCaseInfo const& testInfo ) CATCH_OVERRIDE { for( Reporters::const_iterator it = m_reporters.begin(), itEnd = m_reporters.end(); it != itEnd; ++it ) (*it)->skipTest( testInfo ); } virtual MultipleReporters* tryAsMulti() CATCH_OVERRIDE { return this; } }; Ptr<IStreamingReporter> addReporter( Ptr<IStreamingReporter> const& existingReporter, Ptr<IStreamingReporter> const& additionalReporter ) { Ptr<IStreamingReporter> resultingReporter; if( existingReporter ) { MultipleReporters* multi = existingReporter->tryAsMulti(); if( !multi ) { multi = new MultipleReporters; resultingReporter = Ptr<IStreamingReporter>( multi ); if( existingReporter ) multi->add( existingReporter ); } else resultingReporter = existingReporter; multi->add( additionalReporter ); } else resultingReporter = additionalReporter; return resultingReporter; } } // end namespace Catch // #included from: ../reporters/catch_reporter_xml.hpp #define TWOBLUECUBES_CATCH_REPORTER_XML_HPP_INCLUDED // #included from: catch_reporter_bases.hpp #define TWOBLUECUBES_CATCH_REPORTER_BASES_HPP_INCLUDED #include <cstring> namespace Catch { struct StreamingReporterBase : SharedImpl<IStreamingReporter> { StreamingReporterBase( ReporterConfig const& _config ) : m_config( _config.fullConfig() ), stream( _config.stream() ) { m_reporterPrefs.shouldRedirectStdOut = false; } virtual ReporterPreferences getPreferences() const CATCH_OVERRIDE { return m_reporterPrefs; } virtual ~StreamingReporterBase() CATCH_OVERRIDE; virtual void noMatchingTestCases( std::string const& ) CATCH_OVERRIDE {} virtual void testRunStarting( TestRunInfo const& _testRunInfo ) CATCH_OVERRIDE { currentTestRunInfo = _testRunInfo; } virtual void testGroupStarting( GroupInfo const& _groupInfo ) CATCH_OVERRIDE { currentGroupInfo = _groupInfo; } virtual void testCaseStarting( TestCaseInfo const& _testInfo ) CATCH_OVERRIDE { currentTestCaseInfo = _testInfo; } virtual void sectionStarting( SectionInfo const& _sectionInfo ) CATCH_OVERRIDE { m_sectionStack.push_back( _sectionInfo ); } virtual void sectionEnded( SectionStats const& /* _sectionStats */ ) CATCH_OVERRIDE { m_sectionStack.pop_back(); } virtual void testCaseEnded( TestCaseStats const& /* _testCaseStats */ ) CATCH_OVERRIDE { currentTestCaseInfo.reset(); } virtual void testGroupEnded( TestGroupStats const& /* _testGroupStats */ ) CATCH_OVERRIDE { currentGroupInfo.reset(); } virtual void testRunEnded( TestRunStats const& /* _testRunStats */ ) CATCH_OVERRIDE { currentTestCaseInfo.reset(); currentGroupInfo.reset(); currentTestRunInfo.reset(); } virtual void skipTest( TestCaseInfo const& ) CATCH_OVERRIDE { // Don't do anything with this by default. // It can optionally be overridden in the derived class. } Ptr<IConfig const> m_config; std::ostream& stream; LazyStat<TestRunInfo> currentTestRunInfo; LazyStat<GroupInfo> currentGroupInfo; LazyStat<TestCaseInfo> currentTestCaseInfo; std::vector<SectionInfo> m_sectionStack; ReporterPreferences m_reporterPrefs; }; struct CumulativeReporterBase : SharedImpl<IStreamingReporter> { template<typename T, typename ChildNodeT> struct Node : SharedImpl<> { explicit Node( T const& _value ) : value( _value ) {} virtual ~Node() {} typedef std::vector<Ptr<ChildNodeT> > ChildNodes; T value; ChildNodes children; }; struct SectionNode : SharedImpl<> { explicit SectionNode( SectionStats const& _stats ) : stats( _stats ) {} virtual ~SectionNode(); bool operator == ( SectionNode const& other ) const { return stats.sectionInfo.lineInfo == other.stats.sectionInfo.lineInfo; } bool operator == ( Ptr<SectionNode> const& other ) const { return operator==( *other ); } SectionStats stats; typedef std::vector<Ptr<SectionNode> > ChildSections; typedef std::vector<AssertionStats> Assertions; ChildSections childSections; Assertions assertions; std::string stdOut; std::string stdErr; }; struct BySectionInfo { BySectionInfo( SectionInfo const& other ) : m_other( other ) {} BySectionInfo( BySectionInfo const& other ) : m_other( other.m_other ) {} bool operator() ( Ptr<SectionNode> const& node ) const { return node->stats.sectionInfo.lineInfo == m_other.lineInfo; } private: void operator=( BySectionInfo const& ); SectionInfo const& m_other; }; typedef Node<TestCaseStats, SectionNode> TestCaseNode; typedef Node<TestGroupStats, TestCaseNode> TestGroupNode; typedef Node<TestRunStats, TestGroupNode> TestRunNode; CumulativeReporterBase( ReporterConfig const& _config ) : m_config( _config.fullConfig() ), stream( _config.stream() ) { m_reporterPrefs.shouldRedirectStdOut = false; } ~CumulativeReporterBase(); virtual ReporterPreferences getPreferences() const CATCH_OVERRIDE { return m_reporterPrefs; } virtual void testRunStarting( TestRunInfo const& ) CATCH_OVERRIDE {} virtual void testGroupStarting( GroupInfo const& ) CATCH_OVERRIDE {} virtual void testCaseStarting( TestCaseInfo const& ) CATCH_OVERRIDE {} virtual void sectionStarting( SectionInfo const& sectionInfo ) CATCH_OVERRIDE { SectionStats incompleteStats( sectionInfo, Counts(), 0, false ); Ptr<SectionNode> node; if( m_sectionStack.empty() ) { if( !m_rootSection ) m_rootSection = new SectionNode( incompleteStats ); node = m_rootSection; } else { SectionNode& parentNode = *m_sectionStack.back(); SectionNode::ChildSections::const_iterator it = std::find_if( parentNode.childSections.begin(), parentNode.childSections.end(), BySectionInfo( sectionInfo ) ); if( it == parentNode.childSections.end() ) { node = new SectionNode( incompleteStats ); parentNode.childSections.push_back( node ); } else node = *it; } m_sectionStack.push_back( node ); m_deepestSection = node; } virtual void assertionStarting( AssertionInfo const& ) CATCH_OVERRIDE {} virtual bool assertionEnded( AssertionStats const& assertionStats ) CATCH_OVERRIDE { assert( !m_sectionStack.empty() ); SectionNode& sectionNode = *m_sectionStack.back(); sectionNode.assertions.push_back( assertionStats ); return true; } virtual void sectionEnded( SectionStats const& sectionStats ) CATCH_OVERRIDE { assert( !m_sectionStack.empty() ); SectionNode& node = *m_sectionStack.back(); node.stats = sectionStats; m_sectionStack.pop_back(); } virtual void testCaseEnded( TestCaseStats const& testCaseStats ) CATCH_OVERRIDE { Ptr<TestCaseNode> node = new TestCaseNode( testCaseStats ); assert( m_sectionStack.size() == 0 ); node->children.push_back( m_rootSection ); m_testCases.push_back( node ); m_rootSection.reset(); assert( m_deepestSection ); m_deepestSection->stdOut = testCaseStats.stdOut; m_deepestSection->stdErr = testCaseStats.stdErr; } virtual void testGroupEnded( TestGroupStats const& testGroupStats ) CATCH_OVERRIDE { Ptr<TestGroupNode> node = new TestGroupNode( testGroupStats ); node->children.swap( m_testCases ); m_testGroups.push_back( node ); } virtual void testRunEnded( TestRunStats const& testRunStats ) CATCH_OVERRIDE { Ptr<TestRunNode> node = new TestRunNode( testRunStats ); node->children.swap( m_testGroups ); m_testRuns.push_back( node ); testRunEndedCumulative(); } virtual void testRunEndedCumulative() = 0; virtual void skipTest( TestCaseInfo const& ) CATCH_OVERRIDE {} Ptr<IConfig const> m_config; std::ostream& stream; std::vector<AssertionStats> m_assertions; std::vector<std::vector<Ptr<SectionNode> > > m_sections; std::vector<Ptr<TestCaseNode> > m_testCases; std::vector<Ptr<TestGroupNode> > m_testGroups; std::vector<Ptr<TestRunNode> > m_testRuns; Ptr<SectionNode> m_rootSection; Ptr<SectionNode> m_deepestSection; std::vector<Ptr<SectionNode> > m_sectionStack; ReporterPreferences m_reporterPrefs; }; template<char C> char const* getLineOfChars() { static char line[CATCH_CONFIG_CONSOLE_WIDTH] = {0}; if( !*line ) { memset( line, C, CATCH_CONFIG_CONSOLE_WIDTH-1 ); line[CATCH_CONFIG_CONSOLE_WIDTH-1] = 0; } return line; } struct TestEventListenerBase : StreamingReporterBase { TestEventListenerBase( ReporterConfig const& _config ) : StreamingReporterBase( _config ) {} virtual void assertionStarting( AssertionInfo const& ) CATCH_OVERRIDE {} virtual bool assertionEnded( AssertionStats const& ) CATCH_OVERRIDE { return false; } }; } // end namespace Catch // #included from: ../internal/catch_reporter_registrars.hpp #define TWOBLUECUBES_CATCH_REPORTER_REGISTRARS_HPP_INCLUDED namespace Catch { template<typename T> class LegacyReporterRegistrar { class ReporterFactory : public IReporterFactory { virtual IStreamingReporter* create( ReporterConfig const& config ) const { return new LegacyReporterAdapter( new T( config ) ); } virtual std::string getDescription() const { return T::getDescription(); } }; public: LegacyReporterRegistrar( std::string const& name ) { getMutableRegistryHub().registerReporter( name, new ReporterFactory() ); } }; template<typename T> class ReporterRegistrar { class ReporterFactory : public SharedImpl<IReporterFactory> { // *** Please Note ***: // - If you end up here looking at a compiler error because it's trying to register // your custom reporter class be aware that the native reporter interface has changed // to IStreamingReporter. The "legacy" interface, IReporter, is still supported via // an adapter. Just use REGISTER_LEGACY_REPORTER to take advantage of the adapter. // However please consider updating to the new interface as the old one is now // deprecated and will probably be removed quite soon! // Please contact me via github if you have any questions at all about this. // In fact, ideally, please contact me anyway to let me know you've hit this - as I have // no idea who is actually using custom reporters at all (possibly no-one!). // The new interface is designed to minimise exposure to interface changes in the future. virtual IStreamingReporter* create( ReporterConfig const& config ) const { return new T( config ); } virtual std::string getDescription() const { return T::getDescription(); } }; public: ReporterRegistrar( std::string const& name ) { getMutableRegistryHub().registerReporter( name, new ReporterFactory() ); } }; template<typename T> class ListenerRegistrar { class ListenerFactory : public SharedImpl<IReporterFactory> { virtual IStreamingReporter* create( ReporterConfig const& config ) const { return new T( config ); } virtual std::string getDescription() const { return ""; } }; public: ListenerRegistrar() { getMutableRegistryHub().registerListener( new ListenerFactory() ); } }; } #define INTERNAL_CATCH_REGISTER_LEGACY_REPORTER( name, reporterType ) \ namespace{ Catch::LegacyReporterRegistrar<reporterType> catch_internal_RegistrarFor##reporterType( name ); } #define INTERNAL_CATCH_REGISTER_REPORTER( name, reporterType ) \ namespace{ Catch::ReporterRegistrar<reporterType> catch_internal_RegistrarFor##reporterType( name ); } #define INTERNAL_CATCH_REGISTER_LISTENER( listenerType ) \ namespace{ Catch::ListenerRegistrar<listenerType> catch_internal_RegistrarFor##listenerType; } // #included from: ../internal/catch_xmlwriter.hpp #define TWOBLUECUBES_CATCH_XMLWRITER_HPP_INCLUDED #include <sstream> #include <string> #include <vector> #include <iomanip> namespace Catch { class XmlEncode { public: enum ForWhat { ForTextNodes, ForAttributes }; XmlEncode( std::string const& str, ForWhat forWhat = ForTextNodes ) : m_str( str ), m_forWhat( forWhat ) {} void encodeTo( std::ostream& os ) const { // Apostrophe escaping not necessary if we always use " to write attributes // (see: http://www.w3.org/TR/xml/#syntax) for( std::size_t i = 0; i < m_str.size(); ++ i ) { char c = m_str[i]; switch( c ) { case '<': os << "<"; break; case '&': os << "&"; break; case '>': // See: http://www.w3.org/TR/xml/#syntax if( i > 2 && m_str[i-1] == ']' && m_str[i-2] == ']' ) os << ">"; else os << c; break; case '\"': if( m_forWhat == ForAttributes ) os << """; else os << c; break; default: // Escape control chars - based on contribution by @espenalb in PR #465 and // by @mrpi PR #588 if ( ( c < '\x09' ) || ( c > '\x0D' && c < '\x20') || c=='\x7F' ) os << "&#x" << std::uppercase << std::hex << std::setfill('0') << std::setw(2) << static_cast<int>( c ) << ';'; else os << c; } } } friend std::ostream& operator << ( std::ostream& os, XmlEncode const& xmlEncode ) { xmlEncode.encodeTo( os ); return os; } private: std::string m_str; ForWhat m_forWhat; }; class XmlWriter { public: class ScopedElement { public: ScopedElement( XmlWriter* writer ) : m_writer( writer ) {} ScopedElement( ScopedElement const& other ) : m_writer( other.m_writer ){ other.m_writer = CATCH_NULL; } ~ScopedElement() { if( m_writer ) m_writer->endElement(); } ScopedElement& writeText( std::string const& text, bool indent = true ) { m_writer->writeText( text, indent ); return *this; } template<typename T> ScopedElement& writeAttribute( std::string const& name, T const& attribute ) { m_writer->writeAttribute( name, attribute ); return *this; } private: mutable XmlWriter* m_writer; }; XmlWriter() : m_tagIsOpen( false ), m_needsNewline( false ), m_os( &Catch::cout() ) { // We encode control characters, which requires // XML 1.1 // see http://stackoverflow.com/questions/404107/why-are-control-characters-illegal-in-xml-1-0 *m_os << "<?xml version=\"1.1\" encoding=\"UTF-8\"?>\n"; } XmlWriter( std::ostream& os ) : m_tagIsOpen( false ), m_needsNewline( false ), m_os( &os ) { *m_os << "<?xml version=\"1.1\" encoding=\"UTF-8\"?>\n"; } ~XmlWriter() { while( !m_tags.empty() ) endElement(); } XmlWriter& startElement( std::string const& name ) { ensureTagClosed(); newlineIfNecessary(); stream() << m_indent << "<" << name; m_tags.push_back( name ); m_indent += " "; m_tagIsOpen = true; return *this; } ScopedElement scopedElement( std::string const& name ) { ScopedElement scoped( this ); startElement( name ); return scoped; } XmlWriter& endElement() { newlineIfNecessary(); m_indent = m_indent.substr( 0, m_indent.size()-2 ); if( m_tagIsOpen ) { stream() << "/>\n"; m_tagIsOpen = false; } else { stream() << m_indent << "</" << m_tags.back() << ">\n"; } m_tags.pop_back(); return *this; } XmlWriter& writeAttribute( std::string const& name, std::string const& attribute ) { if( !name.empty() && !attribute.empty() ) stream() << " " << name << "=\"" << XmlEncode( attribute, XmlEncode::ForAttributes ) << "\""; return *this; } XmlWriter& writeAttribute( std::string const& name, bool attribute ) { stream() << " " << name << "=\"" << ( attribute ? "true" : "false" ) << "\""; return *this; } template<typename T> XmlWriter& writeAttribute( std::string const& name, T const& attribute ) { std::ostringstream oss; oss << attribute; return writeAttribute( name, oss.str() ); } XmlWriter& writeText( std::string const& text, bool indent = true ) { if( !text.empty() ){ bool tagWasOpen = m_tagIsOpen; ensureTagClosed(); if( tagWasOpen && indent ) stream() << m_indent; stream() << XmlEncode( text ); m_needsNewline = true; } return *this; } XmlWriter& writeComment( std::string const& text ) { ensureTagClosed(); stream() << m_indent << ""; m_needsNewline = true; return *this; } XmlWriter& writeBlankLine() { ensureTagClosed(); stream() << "\n"; return *this; } void setStream( std::ostream& os ) { m_os = &os; } private: XmlWriter( XmlWriter const& ); void operator=( XmlWriter const& ); std::ostream& stream() { return *m_os; } void ensureTagClosed() { if( m_tagIsOpen ) { stream() << ">\n"; m_tagIsOpen = false; } } void newlineIfNecessary() { if( m_needsNewline ) { stream() << "\n"; m_needsNewline = false; } } bool m_tagIsOpen; bool m_needsNewline; std::vector<std::string> m_tags; std::string m_indent; std::ostream* m_os; }; } // #included from: catch_reenable_warnings.h #define TWOBLUECUBES_CATCH_REENABLE_WARNINGS_H_INCLUDED #ifdef __clang__ # ifdef __ICC // icpc defines the __clang__ macro # pragma warning(pop) # else # pragma clang diagnostic pop # endif #elif defined __GNUC__ # pragma GCC diagnostic pop #endif namespace Catch { class XmlReporter : public StreamingReporterBase { public: XmlReporter( ReporterConfig const& _config ) : StreamingReporterBase( _config ), m_xml(_config.stream()), m_sectionDepth( 0 ) { m_reporterPrefs.shouldRedirectStdOut = true; } virtual ~XmlReporter() CATCH_OVERRIDE; static std::string getDescription() { return "Reports test results as an XML document"; } public: // StreamingReporterBase virtual void noMatchingTestCases( std::string const& s ) CATCH_OVERRIDE { StreamingReporterBase::noMatchingTestCases( s ); } virtual void testRunStarting( TestRunInfo const& testInfo ) CATCH_OVERRIDE { StreamingReporterBase::testRunStarting( testInfo ); m_xml.startElement( "Catch" ); if( !m_config->name().empty() ) m_xml.writeAttribute( "name", m_config->name() ); } virtual void testGroupStarting( GroupInfo const& groupInfo ) CATCH_OVERRIDE { StreamingReporterBase::testGroupStarting( groupInfo ); m_xml.startElement( "Group" ) .writeAttribute( "name", groupInfo.name ); } virtual void testCaseStarting( TestCaseInfo const& testInfo ) CATCH_OVERRIDE { StreamingReporterBase::testCaseStarting(testInfo); m_xml.startElement( "TestCase" ).writeAttribute( "name", testInfo.name ); if ( m_config->showDurations() == ShowDurations::Always ) m_testCaseTimer.start(); } virtual void sectionStarting( SectionInfo const& sectionInfo ) CATCH_OVERRIDE { StreamingReporterBase::sectionStarting( sectionInfo ); if( m_sectionDepth++ > 0 ) { m_xml.startElement( "Section" ) .writeAttribute( "name", trim( sectionInfo.name ) ) .writeAttribute( "description", sectionInfo.description ); } } virtual void assertionStarting( AssertionInfo const& ) CATCH_OVERRIDE { } virtual bool assertionEnded( AssertionStats const& assertionStats ) CATCH_OVERRIDE { const AssertionResult& assertionResult = assertionStats.assertionResult; // Print any info messages in <Info> tags. if( assertionStats.assertionResult.getResultType() != ResultWas::Ok ) { for( std::vector<MessageInfo>::const_iterator it = assertionStats.infoMessages.begin(), itEnd = assertionStats.infoMessages.end(); it != itEnd; ++it ) { if( it->type == ResultWas::Info ) { m_xml.scopedElement( "Info" ) .writeText( it->message ); } else if ( it->type == ResultWas::Warning ) { m_xml.scopedElement( "Warning" ) .writeText( it->message ); } } } // Drop out if result was successful but we're not printing them. if( !m_config->includeSuccessfulResults() && isOk(assertionResult.getResultType()) ) return true; // Print the expression if there is one. if( assertionResult.hasExpression() ) { m_xml.startElement( "Expression" ) .writeAttribute( "success", assertionResult.succeeded() ) .writeAttribute( "type", assertionResult.getTestMacroName() ) .writeAttribute( "filename", assertionResult.getSourceInfo().file ) .writeAttribute( "line", assertionResult.getSourceInfo().line ); m_xml.scopedElement( "Original" ) .writeText( assertionResult.getExpression() ); m_xml.scopedElement( "Expanded" ) .writeText( assertionResult.getExpandedExpression() ); } // And... Print a result applicable to each result type. switch( assertionResult.getResultType() ) { case ResultWas::ThrewException: m_xml.scopedElement( "Exception" ) .writeAttribute( "filename", assertionResult.getSourceInfo().file ) .writeAttribute( "line", assertionResult.getSourceInfo().line ) .writeText( assertionResult.getMessage() ); break; case ResultWas::FatalErrorCondition: m_xml.scopedElement( "FatalErrorCondition" ) .writeAttribute( "filename", assertionResult.getSourceInfo().file ) .writeAttribute( "line", assertionResult.getSourceInfo().line ) .writeText( assertionResult.getMessage() ); break; case ResultWas::Info: m_xml.scopedElement( "Info" ) .writeText( assertionResult.getMessage() ); break; case ResultWas::Warning: // Warning will already have been written break; case ResultWas::ExplicitFailure: m_xml.scopedElement( "Failure" ) .writeText( assertionResult.getMessage() ); break; default: break; } if( assertionResult.hasExpression() ) m_xml.endElement(); return true; } virtual void sectionEnded( SectionStats const& sectionStats ) CATCH_OVERRIDE { StreamingReporterBase::sectionEnded( sectionStats ); if( --m_sectionDepth > 0 ) { XmlWriter::ScopedElement e = m_xml.scopedElement( "OverallResults" ); e.writeAttribute( "successes", sectionStats.assertions.passed ); e.writeAttribute( "failures", sectionStats.assertions.failed ); e.writeAttribute( "expectedFailures", sectionStats.assertions.failedButOk ); if ( m_config->showDurations() == ShowDurations::Always ) e.writeAttribute( "durationInSeconds", sectionStats.durationInSeconds ); m_xml.endElement(); } } virtual void testCaseEnded( TestCaseStats const& testCaseStats ) CATCH_OVERRIDE { StreamingReporterBase::testCaseEnded( testCaseStats ); XmlWriter::ScopedElement e = m_xml.scopedElement( "OverallResult" ); e.writeAttribute( "success", testCaseStats.totals.assertions.allOk() ); if ( m_config->showDurations() == ShowDurations::Always ) e.writeAttribute( "durationInSeconds", m_testCaseTimer.getElapsedSeconds() ); m_xml.endElement(); } virtual void testGroupEnded( TestGroupStats const& testGroupStats ) CATCH_OVERRIDE { StreamingReporterBase::testGroupEnded( testGroupStats ); // TODO: Check testGroupStats.aborting and act accordingly. m_xml.scopedElement( "OverallResults" ) .writeAttribute( "successes", testGroupStats.totals.assertions.passed ) .writeAttribute( "failures", testGroupStats.totals.assertions.failed ) .writeAttribute( "expectedFailures", testGroupStats.totals.assertions.failedButOk ); m_xml.endElement(); } virtual void testRunEnded( TestRunStats const& testRunStats ) CATCH_OVERRIDE { StreamingReporterBase::testRunEnded( testRunStats ); m_xml.scopedElement( "OverallResults" ) .writeAttribute( "successes", testRunStats.totals.assertions.passed ) .writeAttribute( "failures", testRunStats.totals.assertions.failed ) .writeAttribute( "expectedFailures", testRunStats.totals.assertions.failedButOk ); m_xml.endElement(); } private: Timer m_testCaseTimer; XmlWriter m_xml; int m_sectionDepth; }; INTERNAL_CATCH_REGISTER_REPORTER( "xml", XmlReporter ) } // end namespace Catch // #included from: ../reporters/catch_reporter_junit.hpp #define TWOBLUECUBES_CATCH_REPORTER_JUNIT_HPP_INCLUDED #include <assert.h> namespace Catch { class JunitReporter : public CumulativeReporterBase { public: JunitReporter( ReporterConfig const& _config ) : CumulativeReporterBase( _config ), xml( _config.stream() ) { m_reporterPrefs.shouldRedirectStdOut = true; } virtual ~JunitReporter() CATCH_OVERRIDE; static std::string getDescription() { return "Reports test results in an XML format that looks like Ant's junitreport target"; } virtual void noMatchingTestCases( std::string const& /*spec*/ ) CATCH_OVERRIDE {} virtual void testRunStarting( TestRunInfo const& runInfo ) CATCH_OVERRIDE { CumulativeReporterBase::testRunStarting( runInfo ); xml.startElement( "testsuites" ); } virtual void testGroupStarting( GroupInfo const& groupInfo ) CATCH_OVERRIDE { suiteTimer.start(); stdOutForSuite.str(""); stdErrForSuite.str(""); unexpectedExceptions = 0; CumulativeReporterBase::testGroupStarting( groupInfo ); } virtual bool assertionEnded( AssertionStats const& assertionStats ) CATCH_OVERRIDE { if( assertionStats.assertionResult.getResultType() == ResultWas::ThrewException ) unexpectedExceptions++; return CumulativeReporterBase::assertionEnded( assertionStats ); } virtual void testCaseEnded( TestCaseStats const& testCaseStats ) CATCH_OVERRIDE { stdOutForSuite << testCaseStats.stdOut; stdErrForSuite << testCaseStats.stdErr; CumulativeReporterBase::testCaseEnded( testCaseStats ); } virtual void testGroupEnded( TestGroupStats const& testGroupStats ) CATCH_OVERRIDE { double suiteTime = suiteTimer.getElapsedSeconds(); CumulativeReporterBase::testGroupEnded( testGroupStats ); writeGroup( *m_testGroups.back(), suiteTime ); } virtual void testRunEndedCumulative() CATCH_OVERRIDE { xml.endElement(); } void writeGroup( TestGroupNode const& groupNode, double suiteTime ) { XmlWriter::ScopedElement e = xml.scopedElement( "testsuite" ); TestGroupStats const& stats = groupNode.value; xml.writeAttribute( "name", stats.groupInfo.name ); xml.writeAttribute( "errors", unexpectedExceptions ); xml.writeAttribute( "failures", stats.totals.assertions.failed-unexpectedExceptions ); xml.writeAttribute( "tests", stats.totals.assertions.total() ); xml.writeAttribute( "hostname", "tbd" ); // !TBD if( m_config->showDurations() == ShowDurations::Never ) xml.writeAttribute( "time", "" ); else xml.writeAttribute( "time", suiteTime ); xml.writeAttribute( "timestamp", "tbd" ); // !TBD // Write test cases for( TestGroupNode::ChildNodes::const_iterator it = groupNode.children.begin(), itEnd = groupNode.children.end(); it != itEnd; ++it ) writeTestCase( **it ); xml.scopedElement( "system-out" ).writeText( trim( stdOutForSuite.str() ), false ); xml.scopedElement( "system-err" ).writeText( trim( stdErrForSuite.str() ), false ); } void writeTestCase( TestCaseNode const& testCaseNode ) { TestCaseStats const& stats = testCaseNode.value; // All test cases have exactly one section - which represents the // test case itself. That section may have 0-n nested sections assert( testCaseNode.children.size() == 1 ); SectionNode const& rootSection = *testCaseNode.children.front(); std::string className = stats.testInfo.className; if( className.empty() ) { if( rootSection.childSections.empty() ) className = "global"; } writeSection( className, "", rootSection ); } void writeSection( std::string const& className, std::string const& rootName, SectionNode const& sectionNode ) { std::string name = trim( sectionNode.stats.sectionInfo.name ); if( !rootName.empty() ) name = rootName + "/" + name; if( !sectionNode.assertions.empty() || !sectionNode.stdOut.empty() || !sectionNode.stdErr.empty() ) { XmlWriter::ScopedElement e = xml.scopedElement( "testcase" ); if( className.empty() ) { xml.writeAttribute( "classname", name ); xml.writeAttribute( "name", "root" ); } else { xml.writeAttribute( "classname", className ); xml.writeAttribute( "name", name ); } xml.writeAttribute( "time", Catch::toString( sectionNode.stats.durationInSeconds ) ); writeAssertions( sectionNode ); if( !sectionNode.stdOut.empty() ) xml.scopedElement( "system-out" ).writeText( trim( sectionNode.stdOut ), false ); if( !sectionNode.stdErr.empty() ) xml.scopedElement( "system-err" ).writeText( trim( sectionNode.stdErr ), false ); } for( SectionNode::ChildSections::const_iterator it = sectionNode.childSections.begin(), itEnd = sectionNode.childSections.end(); it != itEnd; ++it ) if( className.empty() ) writeSection( name, "", **it ); else writeSection( className, name, **it ); } void writeAssertions( SectionNode const& sectionNode ) { for( SectionNode::Assertions::const_iterator it = sectionNode.assertions.begin(), itEnd = sectionNode.assertions.end(); it != itEnd; ++it ) writeAssertion( *it ); } void writeAssertion( AssertionStats const& stats ) { AssertionResult const& result = stats.assertionResult; if( !result.isOk() ) { std::string elementName; switch( result.getResultType() ) { case ResultWas::ThrewException: case ResultWas::FatalErrorCondition: elementName = "error"; break; case ResultWas::ExplicitFailure: elementName = "failure"; break; case ResultWas::ExpressionFailed: elementName = "failure"; break; case ResultWas::DidntThrowException: elementName = "failure"; break; // We should never see these here: case ResultWas::Info: case ResultWas::Warning: case ResultWas::Ok: case ResultWas::Unknown: case ResultWas::FailureBit: case ResultWas::Exception: elementName = "internalError"; break; } XmlWriter::ScopedElement e = xml.scopedElement( elementName ); xml.writeAttribute( "message", result.getExpandedExpression() ); xml.writeAttribute( "type", result.getTestMacroName() ); std::ostringstream oss; if( !result.getMessage().empty() ) oss << result.getMessage() << "\n"; for( std::vector<MessageInfo>::const_iterator it = stats.infoMessages.begin(), itEnd = stats.infoMessages.end(); it != itEnd; ++it ) if( it->type == ResultWas::Info ) oss << it->message << "\n"; oss << "at " << result.getSourceInfo(); xml.writeText( oss.str(), false ); } } XmlWriter xml; Timer suiteTimer; std::ostringstream stdOutForSuite; std::ostringstream stdErrForSuite; unsigned int unexpectedExceptions; }; INTERNAL_CATCH_REGISTER_REPORTER( "junit", JunitReporter ) } // end namespace Catch // #included from: ../reporters/catch_reporter_console.hpp #define TWOBLUECUBES_CATCH_REPORTER_CONSOLE_HPP_INCLUDED namespace Catch { struct ConsoleReporter : StreamingReporterBase { ConsoleReporter( ReporterConfig const& _config ) : StreamingReporterBase( _config ), m_headerPrinted( false ) {} virtual ~ConsoleReporter() CATCH_OVERRIDE; static std::string getDescription() { return "Reports test results as plain lines of text"; } virtual void noMatchingTestCases( std::string const& spec ) CATCH_OVERRIDE { stream << "No test cases matched '" << spec << "'" << std::endl; } virtual void assertionStarting( AssertionInfo const& ) CATCH_OVERRIDE { } virtual bool assertionEnded( AssertionStats const& _assertionStats ) CATCH_OVERRIDE { AssertionResult const& result = _assertionStats.assertionResult; bool printInfoMessages = true; // Drop out if result was successful and we're not printing those if( !m_config->includeSuccessfulResults() && result.isOk() ) { if( result.getResultType() != ResultWas::Warning ) return false; printInfoMessages = false; } lazyPrint(); AssertionPrinter printer( stream, _assertionStats, printInfoMessages ); printer.print(); stream << std::endl; return true; } virtual void sectionStarting( SectionInfo const& _sectionInfo ) CATCH_OVERRIDE { m_headerPrinted = false; StreamingReporterBase::sectionStarting( _sectionInfo ); } virtual void sectionEnded( SectionStats const& _sectionStats ) CATCH_OVERRIDE { if( _sectionStats.missingAssertions ) { lazyPrint(); Colour colour( Colour::ResultError ); if( m_sectionStack.size() > 1 ) stream << "\nNo assertions in section"; else stream << "\nNo assertions in test case"; stream << " '" << _sectionStats.sectionInfo.name << "'\n" << std::endl; } if( m_headerPrinted ) { if( m_config->showDurations() == ShowDurations::Always ) stream << "Completed in " << _sectionStats.durationInSeconds << "s" << std::endl; m_headerPrinted = false; } else { if( m_config->showDurations() == ShowDurations::Always ) stream << _sectionStats.sectionInfo.name << " completed in " << _sectionStats.durationInSeconds << "s" << std::endl; } StreamingReporterBase::sectionEnded( _sectionStats ); } virtual void testCaseEnded( TestCaseStats const& _testCaseStats ) CATCH_OVERRIDE { StreamingReporterBase::testCaseEnded( _testCaseStats ); m_headerPrinted = false; } virtual void testGroupEnded( TestGroupStats const& _testGroupStats ) CATCH_OVERRIDE { if( currentGroupInfo.used ) { printSummaryDivider(); stream << "Summary for group '" << _testGroupStats.groupInfo.name << "':\n"; printTotals( _testGroupStats.totals ); stream << "\n" << std::endl; } StreamingReporterBase::testGroupEnded( _testGroupStats ); } virtual void testRunEnded( TestRunStats const& _testRunStats ) CATCH_OVERRIDE { printTotalsDivider( _testRunStats.totals ); printTotals( _testRunStats.totals ); stream << std::endl; StreamingReporterBase::testRunEnded( _testRunStats ); } private: class AssertionPrinter { void operator= ( AssertionPrinter const& ); public: AssertionPrinter( std::ostream& _stream, AssertionStats const& _stats, bool _printInfoMessages ) : stream( _stream ), stats( _stats ), result( _stats.assertionResult ), colour( Colour::None ), message( result.getMessage() ), messages( _stats.infoMessages ), printInfoMessages( _printInfoMessages ) { switch( result.getResultType() ) { case ResultWas::Ok: colour = Colour::Success; passOrFail = "PASSED"; //if( result.hasMessage() ) if( _stats.infoMessages.size() == 1 ) messageLabel = "with message"; if( _stats.infoMessages.size() > 1 ) messageLabel = "with messages"; break; case ResultWas::ExpressionFailed: if( result.isOk() ) { colour = Colour::Success; passOrFail = "FAILED - but was ok"; } else { colour = Colour::Error; passOrFail = "FAILED"; } if( _stats.infoMessages.size() == 1 ) messageLabel = "with message"; if( _stats.infoMessages.size() > 1 ) messageLabel = "with messages"; break; case ResultWas::ThrewException: colour = Colour::Error; passOrFail = "FAILED"; messageLabel = "due to unexpected exception with message"; break; case ResultWas::FatalErrorCondition: colour = Colour::Error; passOrFail = "FAILED"; messageLabel = "due to a fatal error condition"; break; case ResultWas::DidntThrowException: colour = Colour::Error; passOrFail = "FAILED"; messageLabel = "because no exception was thrown where one was expected"; break; case ResultWas::Info: messageLabel = "info"; break; case ResultWas::Warning: messageLabel = "warning"; break; case ResultWas::ExplicitFailure: passOrFail = "FAILED"; colour = Colour::Error; if( _stats.infoMessages.size() == 1 ) messageLabel = "explicitly with message"; if( _stats.infoMessages.size() > 1 ) messageLabel = "explicitly with messages"; break; // These cases are here to prevent compiler warnings case ResultWas::Unknown: case ResultWas::FailureBit: case ResultWas::Exception: passOrFail = "** internal error **"; colour = Colour::Error; break; } } void print() const { printSourceInfo(); if( stats.totals.assertions.total() > 0 ) { if( result.isOk() ) stream << "\n"; printResultType(); printOriginalExpression(); printReconstructedExpression(); } else { stream << "\n"; } printMessage(); } private: void printResultType() const { if( !passOrFail.empty() ) { Colour colourGuard( colour ); stream << passOrFail << ":\n"; } } void printOriginalExpression() const { if( result.hasExpression() ) { Colour colourGuard( Colour::OriginalExpression ); stream << " "; stream << result.getExpressionInMacro(); stream << "\n"; } } void printReconstructedExpression() const { if( result.hasExpandedExpression() ) { stream << "with expansion:\n"; Colour colourGuard( Colour::ReconstructedExpression ); stream << Text( result.getExpandedExpression(), TextAttributes().setIndent(2) ) << "\n"; } } void printMessage() const { if( !messageLabel.empty() ) stream << messageLabel << ":" << "\n"; for( std::vector<MessageInfo>::const_iterator it = messages.begin(), itEnd = messages.end(); it != itEnd; ++it ) { // If this assertion is a warning ignore any INFO messages if( printInfoMessages || it->type != ResultWas::Info ) stream << Text( it->message, TextAttributes().setIndent(2) ) << "\n"; } } void printSourceInfo() const { Colour colourGuard( Colour::FileName ); stream << result.getSourceInfo() << ": "; } std::ostream& stream; AssertionStats const& stats; AssertionResult const& result; Colour::Code colour; std::string passOrFail; std::string messageLabel; std::string message; std::vector<MessageInfo> messages; bool printInfoMessages; }; void lazyPrint() { if( !currentTestRunInfo.used ) lazyPrintRunInfo(); if( !currentGroupInfo.used ) lazyPrintGroupInfo(); if( !m_headerPrinted ) { printTestCaseAndSectionHeader(); m_headerPrinted = true; } } void lazyPrintRunInfo() { stream << "\n" << getLineOfChars<'~'>() << "\n"; Colour colour( Colour::SecondaryText ); stream << currentTestRunInfo->name << " is a Catch v" << libraryVersion << " host application.\n" << "Run with -? for options\n\n"; if( m_config->rngSeed() != 0 ) stream << "Randomness seeded to: " << m_config->rngSeed() << "\n\n"; currentTestRunInfo.used = true; } void lazyPrintGroupInfo() { if( !currentGroupInfo->name.empty() && currentGroupInfo->groupsCounts > 1 ) { printClosedHeader( "Group: " + currentGroupInfo->name ); currentGroupInfo.used = true; } } void printTestCaseAndSectionHeader() { assert( !m_sectionStack.empty() ); printOpenHeader( currentTestCaseInfo->name ); if( m_sectionStack.size() > 1 ) { Colour colourGuard( Colour::Headers ); std::vector<SectionInfo>::const_iterator it = m_sectionStack.begin()+1, // Skip first section (test case) itEnd = m_sectionStack.end(); for( ; it != itEnd; ++it ) printHeaderString( it->name, 2 ); } SourceLineInfo lineInfo = m_sectionStack.front().lineInfo; if( !lineInfo.empty() ){ stream << getLineOfChars<'-'>() << "\n"; Colour colourGuard( Colour::FileName ); stream << lineInfo << "\n"; } stream << getLineOfChars<'.'>() << "\n" << std::endl; } void printClosedHeader( std::string const& _name ) { printOpenHeader( _name ); stream << getLineOfChars<'.'>() << "\n"; } void printOpenHeader( std::string const& _name ) { stream << getLineOfChars<'-'>() << "\n"; { Colour colourGuard( Colour::Headers ); printHeaderString( _name ); } } // if string has a : in first line will set indent to follow it on // subsequent lines void printHeaderString( std::string const& _string, std::size_t indent = 0 ) { std::size_t i = _string.find( ": " ); if( i != std::string::npos ) i+=2; else i = 0; stream << Text( _string, TextAttributes() .setIndent( indent+i) .setInitialIndent( indent ) ) << "\n"; } struct SummaryColumn { SummaryColumn( std::string const& _label, Colour::Code _colour ) : label( _label ), colour( _colour ) {} SummaryColumn addRow( std::size_t count ) { std::ostringstream oss; oss << count; std::string row = oss.str(); for( std::vector<std::string>::iterator it = rows.begin(); it != rows.end(); ++it ) { while( it->size() < row.size() ) *it = " " + *it; while( it->size() > row.size() ) row = " " + row; } rows.push_back( row ); return *this; } std::string label; Colour::Code colour; std::vector<std::string> rows; }; void printTotals( Totals const& totals ) { if( totals.testCases.total() == 0 ) { stream << Colour( Colour::Warning ) << "No tests ran\n"; } else if( totals.assertions.total() > 0 && totals.testCases.allPassed() ) { stream << Colour( Colour::ResultSuccess ) << "All tests passed"; stream << " (" << pluralise( totals.assertions.passed, "assertion" ) << " in " << pluralise( totals.testCases.passed, "test case" ) << ")" << "\n"; } else { std::vector<SummaryColumn> columns; columns.push_back( SummaryColumn( "", Colour::None ) .addRow( totals.testCases.total() ) .addRow( totals.assertions.total() ) ); columns.push_back( SummaryColumn( "passed", Colour::Success ) .addRow( totals.testCases.passed ) .addRow( totals.assertions.passed ) ); columns.push_back( SummaryColumn( "failed", Colour::ResultError ) .addRow( totals.testCases.failed ) .addRow( totals.assertions.failed ) ); columns.push_back( SummaryColumn( "failed as expected", Colour::ResultExpectedFailure ) .addRow( totals.testCases.failedButOk ) .addRow( totals.assertions.failedButOk ) ); printSummaryRow( "test cases", columns, 0 ); printSummaryRow( "assertions", columns, 1 ); } } void printSummaryRow( std::string const& label, std::vector<SummaryColumn> const& cols, std::size_t row ) { for( std::vector<SummaryColumn>::const_iterator it = cols.begin(); it != cols.end(); ++it ) { std::string value = it->rows[row]; if( it->label.empty() ) { stream << label << ": "; if( value != "0" ) stream << value; else stream << Colour( Colour::Warning ) << "- none -"; } else if( value != "0" ) { stream << Colour( Colour::LightGrey ) << " | "; stream << Colour( it->colour ) << value << " " << it->label; } } stream << "\n"; } static std::size_t makeRatio( std::size_t number, std::size_t total ) { std::size_t ratio = total > 0 ? CATCH_CONFIG_CONSOLE_WIDTH * number/ total : 0; return ( ratio == 0 && number > 0 ) ? 1 : ratio; } static std::size_t& findMax( std::size_t& i, std::size_t& j, std::size_t& k ) { if( i > j && i > k ) return i; else if( j > k ) return j; else return k; } void printTotalsDivider( Totals const& totals ) { if( totals.testCases.total() > 0 ) { std::size_t failedRatio = makeRatio( totals.testCases.failed, totals.testCases.total() ); std::size_t failedButOkRatio = makeRatio( totals.testCases.failedButOk, totals.testCases.total() ); std::size_t passedRatio = makeRatio( totals.testCases.passed, totals.testCases.total() ); while( failedRatio + failedButOkRatio + passedRatio < CATCH_CONFIG_CONSOLE_WIDTH-1 ) findMax( failedRatio, failedButOkRatio, passedRatio )++; while( failedRatio + failedButOkRatio + passedRatio > CATCH_CONFIG_CONSOLE_WIDTH-1 ) findMax( failedRatio, failedButOkRatio, passedRatio )--; stream << Colour( Colour::Error ) << std::string( failedRatio, '=' ); stream << Colour( Colour::ResultExpectedFailure ) << std::string( failedButOkRatio, '=' ); if( totals.testCases.allPassed() ) stream << Colour( Colour::ResultSuccess ) << std::string( passedRatio, '=' ); else stream << Colour( Colour::Success ) << std::string( passedRatio, '=' ); } else { stream << Colour( Colour::Warning ) << std::string( CATCH_CONFIG_CONSOLE_WIDTH-1, '=' ); } stream << "\n"; } void printSummaryDivider() { stream << getLineOfChars<'-'>() << "\n"; } private: bool m_headerPrinted; }; INTERNAL_CATCH_REGISTER_REPORTER( "console", ConsoleReporter ) } // end namespace Catch // #included from: ../reporters/catch_reporter_compact.hpp #define TWOBLUECUBES_CATCH_REPORTER_COMPACT_HPP_INCLUDED namespace Catch { struct CompactReporter : StreamingReporterBase { CompactReporter( ReporterConfig const& _config ) : StreamingReporterBase( _config ) {} virtual ~CompactReporter(); static std::string getDescription() { return "Reports test results on a single line, suitable for IDEs"; } virtual ReporterPreferences getPreferences() const { ReporterPreferences prefs; prefs.shouldRedirectStdOut = false; return prefs; } virtual void noMatchingTestCases( std::string const& spec ) { stream << "No test cases matched '" << spec << "'" << std::endl; } virtual void assertionStarting( AssertionInfo const& ) { } virtual bool assertionEnded( AssertionStats const& _assertionStats ) { AssertionResult const& result = _assertionStats.assertionResult; bool printInfoMessages = true; // Drop out if result was successful and we're not printing those if( !m_config->includeSuccessfulResults() && result.isOk() ) { if( result.getResultType() != ResultWas::Warning ) return false; printInfoMessages = false; } AssertionPrinter printer( stream, _assertionStats, printInfoMessages ); printer.print(); stream << std::endl; return true; } virtual void testRunEnded( TestRunStats const& _testRunStats ) { printTotals( _testRunStats.totals ); stream << "\n" << std::endl; StreamingReporterBase::testRunEnded( _testRunStats ); } private: class AssertionPrinter { void operator= ( AssertionPrinter const& ); public: AssertionPrinter( std::ostream& _stream, AssertionStats const& _stats, bool _printInfoMessages ) : stream( _stream ) , stats( _stats ) , result( _stats.assertionResult ) , messages( _stats.infoMessages ) , itMessage( _stats.infoMessages.begin() ) , printInfoMessages( _printInfoMessages ) {} void print() { printSourceInfo(); itMessage = messages.begin(); switch( result.getResultType() ) { case ResultWas::Ok: printResultType( Colour::ResultSuccess, passedString() ); printOriginalExpression(); printReconstructedExpression(); if ( ! result.hasExpression() ) printRemainingMessages( Colour::None ); else printRemainingMessages(); break; case ResultWas::ExpressionFailed: if( result.isOk() ) printResultType( Colour::ResultSuccess, failedString() + std::string( " - but was ok" ) ); else printResultType( Colour::Error, failedString() ); printOriginalExpression(); printReconstructedExpression(); printRemainingMessages(); break; case ResultWas::ThrewException: printResultType( Colour::Error, failedString() ); printIssue( "unexpected exception with message:" ); printMessage(); printExpressionWas(); printRemainingMessages(); break; case ResultWas::FatalErrorCondition: printResultType( Colour::Error, failedString() ); printIssue( "fatal error condition with message:" ); printMessage(); printExpressionWas(); printRemainingMessages(); break; case ResultWas::DidntThrowException: printResultType( Colour::Error, failedString() ); printIssue( "expected exception, got none" ); printExpressionWas(); printRemainingMessages(); break; case ResultWas::Info: printResultType( Colour::None, "info" ); printMessage(); printRemainingMessages(); break; case ResultWas::Warning: printResultType( Colour::None, "warning" ); printMessage(); printRemainingMessages(); break; case ResultWas::ExplicitFailure: printResultType( Colour::Error, failedString() ); printIssue( "explicitly" ); printRemainingMessages( Colour::None ); break; // These cases are here to prevent compiler warnings case ResultWas::Unknown: case ResultWas::FailureBit: case ResultWas::Exception: printResultType( Colour::Error, "** internal error **" ); break; } } private: // Colour::LightGrey static Colour::Code dimColour() { return Colour::FileName; } #ifdef CATCH_PLATFORM_MAC static const char* failedString() { return "FAILED"; } static const char* passedString() { return "PASSED"; } #else static const char* failedString() { return "failed"; } static const char* passedString() { return "passed"; } #endif void printSourceInfo() const { Colour colourGuard( Colour::FileName ); stream << result.getSourceInfo() << ":"; } void printResultType( Colour::Code colour, std::string passOrFail ) const { if( !passOrFail.empty() ) { { Colour colourGuard( colour ); stream << " " << passOrFail; } stream << ":"; } } void printIssue( std::string issue ) const { stream << " " << issue; } void printExpressionWas() { if( result.hasExpression() ) { stream << ";"; { Colour colour( dimColour() ); stream << " expression was:"; } printOriginalExpression(); } } void printOriginalExpression() const { if( result.hasExpression() ) { stream << " " << result.getExpression(); } } void printReconstructedExpression() const { if( result.hasExpandedExpression() ) { { Colour colour( dimColour() ); stream << " for: "; } stream << result.getExpandedExpression(); } } void printMessage() { if ( itMessage != messages.end() ) { stream << " '" << itMessage->message << "'"; ++itMessage; } } void printRemainingMessages( Colour::Code colour = dimColour() ) { if ( itMessage == messages.end() ) return; // using messages.end() directly yields compilation error: std::vector<MessageInfo>::const_iterator itEnd = messages.end(); const std::size_t N = static_cast<std::size_t>( std::distance( itMessage, itEnd ) ); { Colour colourGuard( colour ); stream << " with " << pluralise( N, "message" ) << ":"; } for(; itMessage != itEnd; ) { // If this assertion is a warning ignore any INFO messages if( printInfoMessages || itMessage->type != ResultWas::Info ) { stream << " '" << itMessage->message << "'"; if ( ++itMessage != itEnd ) { Colour colourGuard( dimColour() ); stream << " and"; } } } } private: std::ostream& stream; AssertionStats const& stats; AssertionResult const& result; std::vector<MessageInfo> messages; std::vector<MessageInfo>::const_iterator itMessage; bool printInfoMessages; }; // Colour, message variants: // - white: No tests ran. // - red: Failed [both/all] N test cases, failed [both/all] M assertions. // - white: Passed [both/all] N test cases (no assertions). // - red: Failed N tests cases, failed M assertions. // - green: Passed [both/all] N tests cases with M assertions. std::string bothOrAll( std::size_t count ) const { return count == 1 ? "" : count == 2 ? "both " : "all " ; } void printTotals( const Totals& totals ) const { if( totals.testCases.total() == 0 ) { stream << "No tests ran."; } else if( totals.testCases.failed == totals.testCases.total() ) { Colour colour( Colour::ResultError ); const std::string qualify_assertions_failed = totals.assertions.failed == totals.assertions.total() ? bothOrAll( totals.assertions.failed ) : ""; stream << "Failed " << bothOrAll( totals.testCases.failed ) << pluralise( totals.testCases.failed, "test case" ) << ", " "failed " << qualify_assertions_failed << pluralise( totals.assertions.failed, "assertion" ) << "."; } else if( totals.assertions.total() == 0 ) { stream << "Passed " << bothOrAll( totals.testCases.total() ) << pluralise( totals.testCases.total(), "test case" ) << " (no assertions)."; } else if( totals.assertions.failed ) { Colour colour( Colour::ResultError ); stream << "Failed " << pluralise( totals.testCases.failed, "test case" ) << ", " "failed " << pluralise( totals.assertions.failed, "assertion" ) << "."; } else { Colour colour( Colour::ResultSuccess ); stream << "Passed " << bothOrAll( totals.testCases.passed ) << pluralise( totals.testCases.passed, "test case" ) << " with " << pluralise( totals.assertions.passed, "assertion" ) << "."; } } }; INTERNAL_CATCH_REGISTER_REPORTER( "compact", CompactReporter ) } // end namespace Catch namespace Catch { // These are all here to avoid warnings about not having any out of line // virtual methods NonCopyable::~NonCopyable() {} IShared::~IShared() {} IStream::~IStream() CATCH_NOEXCEPT {} FileStream::~FileStream() CATCH_NOEXCEPT {} CoutStream::~CoutStream() CATCH_NOEXCEPT {} DebugOutStream::~DebugOutStream() CATCH_NOEXCEPT {} StreamBufBase::~StreamBufBase() CATCH_NOEXCEPT {} IContext::~IContext() {} IResultCapture::~IResultCapture() {} ITestCase::~ITestCase() {} ITestCaseRegistry::~ITestCaseRegistry() {} IRegistryHub::~IRegistryHub() {} IMutableRegistryHub::~IMutableRegistryHub() {} IExceptionTranslator::~IExceptionTranslator() {} IExceptionTranslatorRegistry::~IExceptionTranslatorRegistry() {} IReporter::~IReporter() {} IReporterFactory::~IReporterFactory() {} IReporterRegistry::~IReporterRegistry() {} IStreamingReporter::~IStreamingReporter() {} AssertionStats::~AssertionStats() {} SectionStats::~SectionStats() {} TestCaseStats::~TestCaseStats() {} TestGroupStats::~TestGroupStats() {} TestRunStats::~TestRunStats() {} CumulativeReporterBase::SectionNode::~SectionNode() {} CumulativeReporterBase::~CumulativeReporterBase() {} StreamingReporterBase::~StreamingReporterBase() {} ConsoleReporter::~ConsoleReporter() {} CompactReporter::~CompactReporter() {} IRunner::~IRunner() {} IMutableContext::~IMutableContext() {} IConfig::~IConfig() {} XmlReporter::~XmlReporter() {} JunitReporter::~JunitReporter() {} TestRegistry::~TestRegistry() {} FreeFunctionTestCase::~FreeFunctionTestCase() {} IGeneratorInfo::~IGeneratorInfo() {} IGeneratorsForTest::~IGeneratorsForTest() {} WildcardPattern::~WildcardPattern() {} TestSpec::Pattern::~Pattern() {} TestSpec::NamePattern::~NamePattern() {} TestSpec::TagPattern::~TagPattern() {} TestSpec::ExcludedPattern::~ExcludedPattern() {} Matchers::Impl::StdString::Equals::~Equals() {} Matchers::Impl::StdString::Contains::~Contains() {} Matchers::Impl::StdString::StartsWith::~StartsWith() {} Matchers::Impl::StdString::EndsWith::~EndsWith() {} void Config::dummy() {} namespace TestCaseTracking { ITracker::~ITracker() {} TrackerBase::~TrackerBase() {} SectionTracker::~SectionTracker() {} IndexTracker::~IndexTracker() {} } } #ifdef __clang__ #pragma clang diagnostic pop #endif #endif #ifdef CATCH_CONFIG_MAIN // #included from: internal/catch_default_main.hpp #define TWOBLUECUBES_CATCH_DEFAULT_MAIN_HPP_INCLUDED #ifndef __OBJC__ // Standard C/C++ main entry point int main (int argc, char * argv[]) { return Catch::Session().run( argc, argv ); } #else // __OBJC__ // Objective-C entry point int main (int argc, char * const argv[]) { #if !CATCH_ARC_ENABLED NSAutoreleasePool * pool = [[NSAutoreleasePool alloc] init]; #endif Catch::registerTestMethods(); int result = Catch::Session().run( argc, (char* const*)argv ); #if !CATCH_ARC_ENABLED [pool drain]; #endif return result; } #endif // __OBJC__ #endif #ifdef CLARA_CONFIG_MAIN_NOT_DEFINED # undef CLARA_CONFIG_MAIN #endif ////// // If this config identifier is defined then all CATCH macros are prefixed with CATCH_ #ifdef CATCH_CONFIG_PREFIX_ALL #define CATCH_REQUIRE( expr ) INTERNAL_CATCH_TEST( expr, Catch::ResultDisposition::Normal, "CATCH_REQUIRE" ) #define CATCH_REQUIRE_FALSE( expr ) INTERNAL_CATCH_TEST( expr, Catch::ResultDisposition::Normal | Catch::ResultDisposition::FalseTest, "CATCH_REQUIRE_FALSE" ) #define CATCH_REQUIRE_THROWS( expr ) INTERNAL_CATCH_THROWS( expr, Catch::ResultDisposition::Normal, "", "CATCH_REQUIRE_THROWS" ) #define CATCH_REQUIRE_THROWS_AS( expr, exceptionType ) INTERNAL_CATCH_THROWS_AS( expr, exceptionType, Catch::ResultDisposition::Normal, "CATCH_REQUIRE_THROWS_AS" ) #define CATCH_REQUIRE_THROWS_WITH( expr, matcher ) INTERNAL_CATCH_THROWS( expr, Catch::ResultDisposition::Normal, matcher, "CATCH_REQUIRE_THROWS_WITH" ) #define CATCH_REQUIRE_NOTHROW( expr ) INTERNAL_CATCH_NO_THROW( expr, Catch::ResultDisposition::Normal, "CATCH_REQUIRE_NOTHROW" ) #define CATCH_CHECK( expr ) INTERNAL_CATCH_TEST( expr, Catch::ResultDisposition::ContinueOnFailure, "CATCH_CHECK" ) #define CATCH_CHECK_FALSE( expr ) INTERNAL_CATCH_TEST( expr, Catch::ResultDisposition::ContinueOnFailure | Catch::ResultDisposition::FalseTest, "CATCH_CHECK_FALSE" ) #define CATCH_CHECKED_IF( expr ) INTERNAL_CATCH_IF( expr, Catch::ResultDisposition::ContinueOnFailure, "CATCH_CHECKED_IF" ) #define CATCH_CHECKED_ELSE( expr ) INTERNAL_CATCH_ELSE( expr, Catch::ResultDisposition::ContinueOnFailure, "CATCH_CHECKED_ELSE" ) #define CATCH_CHECK_NOFAIL( expr ) INTERNAL_CATCH_TEST( expr, Catch::ResultDisposition::ContinueOnFailure | Catch::ResultDisposition::SuppressFail, "CATCH_CHECK_NOFAIL" ) #define CATCH_CHECK_THROWS( expr ) INTERNAL_CATCH_THROWS( expr, Catch::ResultDisposition::ContinueOnFailure, "CATCH_CHECK_THROWS" ) #define CATCH_CHECK_THROWS_AS( expr, exceptionType ) INTERNAL_CATCH_THROWS_AS( expr, exceptionType, Catch::ResultDisposition::ContinueOnFailure, "CATCH_CHECK_THROWS_AS" ) #define CATCH_CHECK_THROWS_WITH( expr, matcher ) INTERNAL_CATCH_THROWS( expr, Catch::ResultDisposition::ContinueOnFailure, matcher, "CATCH_CHECK_THROWS_WITH" ) #define CATCH_CHECK_NOTHROW( expr ) INTERNAL_CATCH_NO_THROW( expr, Catch::ResultDisposition::ContinueOnFailure, "CATCH_CHECK_NOTHROW" ) #define CHECK_THAT( arg, matcher ) INTERNAL_CHECK_THAT( arg, matcher, Catch::ResultDisposition::ContinueOnFailure, "CATCH_CHECK_THAT" ) #define CATCH_REQUIRE_THAT( arg, matcher ) INTERNAL_CHECK_THAT( arg, matcher, Catch::ResultDisposition::Normal, "CATCH_REQUIRE_THAT" ) #define CATCH_INFO( msg ) INTERNAL_CATCH_INFO( msg, "CATCH_INFO" ) #define CATCH_WARN( msg ) INTERNAL_CATCH_MSG( Catch::ResultWas::Warning, Catch::ResultDisposition::ContinueOnFailure, "CATCH_WARN", msg ) #define CATCH_SCOPED_INFO( msg ) INTERNAL_CATCH_INFO( msg, "CATCH_INFO" ) #define CATCH_CAPTURE( msg ) INTERNAL_CATCH_INFO( #msg " := " << msg, "CATCH_CAPTURE" ) #define CATCH_SCOPED_CAPTURE( msg ) INTERNAL_CATCH_INFO( #msg " := " << msg, "CATCH_CAPTURE" ) #ifdef CATCH_CONFIG_VARIADIC_MACROS #define CATCH_TEST_CASE( ... ) INTERNAL_CATCH_TESTCASE( __VA_ARGS__ ) #define CATCH_TEST_CASE_METHOD( className, ... ) INTERNAL_CATCH_TEST_CASE_METHOD( className, __VA_ARGS__ ) #define CATCH_METHOD_AS_TEST_CASE( method, ... ) INTERNAL_CATCH_METHOD_AS_TEST_CASE( method, __VA_ARGS__ ) #define CATCH_REGISTER_TEST_CASE( Function, ... ) INTERNAL_CATCH_REGISTER_TESTCASE( Function, __VA_ARGS__ ) #define CATCH_SECTION( ... ) INTERNAL_CATCH_SECTION( __VA_ARGS__ ) #define CATCH_FAIL( ... ) INTERNAL_CATCH_MSG( Catch::ResultWas::ExplicitFailure, Catch::ResultDisposition::Normal, "CATCH_FAIL", __VA_ARGS__ ) #define CATCH_SUCCEED( ... ) INTERNAL_CATCH_MSG( Catch::ResultWas::Ok, Catch::ResultDisposition::ContinueOnFailure, "CATCH_SUCCEED", __VA_ARGS__ ) #else #define CATCH_TEST_CASE( name, description ) INTERNAL_CATCH_TESTCASE( name, description ) #define CATCH_TEST_CASE_METHOD( className, name, description ) INTERNAL_CATCH_TEST_CASE_METHOD( className, name, description ) #define CATCH_METHOD_AS_TEST_CASE( method, name, description ) INTERNAL_CATCH_METHOD_AS_TEST_CASE( method, name, description ) #define CATCH_REGISTER_TEST_CASE( function, name, description ) INTERNAL_CATCH_REGISTER_TESTCASE( function, name, description ) #define CATCH_SECTION( name, description ) INTERNAL_CATCH_SECTION( name, description ) #define CATCH_FAIL( msg ) INTERNAL_CATCH_MSG( Catch::ResultWas::ExplicitFailure, Catch::ResultDisposition::Normal, "CATCH_FAIL", msg ) #define CATCH_SUCCEED( msg ) INTERNAL_CATCH_MSG( Catch::ResultWas::Ok, Catch::ResultDisposition::ContinueOnFailure, "CATCH_SUCCEED", msg ) #endif #define CATCH_ANON_TEST_CASE() INTERNAL_CATCH_TESTCASE( "", "" ) #define CATCH_REGISTER_REPORTER( name, reporterType ) INTERNAL_CATCH_REGISTER_REPORTER( name, reporterType ) #define CATCH_REGISTER_LEGACY_REPORTER( name, reporterType ) INTERNAL_CATCH_REGISTER_LEGACY_REPORTER( name, reporterType ) #define CATCH_GENERATE( expr) INTERNAL_CATCH_GENERATE( expr ) // "BDD-style" convenience wrappers #ifdef CATCH_CONFIG_VARIADIC_MACROS #define CATCH_SCENARIO( ... ) CATCH_TEST_CASE( "Scenario: " __VA_ARGS__ ) #define CATCH_SCENARIO_METHOD( className, ... ) INTERNAL_CATCH_TEST_CASE_METHOD( className, "Scenario: " __VA_ARGS__ ) #else #define CATCH_SCENARIO( name, tags ) CATCH_TEST_CASE( "Scenario: " name, tags ) #define CATCH_SCENARIO_METHOD( className, name, tags ) INTERNAL_CATCH_TEST_CASE_METHOD( className, "Scenario: " name, tags ) #endif #define CATCH_GIVEN( desc ) CATCH_SECTION( std::string( "Given: ") + desc, "" ) #define CATCH_WHEN( desc ) CATCH_SECTION( std::string( " When: ") + desc, "" ) #define CATCH_AND_WHEN( desc ) CATCH_SECTION( std::string( " And: ") + desc, "" ) #define CATCH_THEN( desc ) CATCH_SECTION( std::string( " Then: ") + desc, "" ) #define CATCH_AND_THEN( desc ) CATCH_SECTION( std::string( " And: ") + desc, "" ) // If CATCH_CONFIG_PREFIX_ALL is not defined then the CATCH_ prefix is not required #else #define REQUIRE( expr ) INTERNAL_CATCH_TEST( expr, Catch::ResultDisposition::Normal, "REQUIRE" ) #define REQUIRE_FALSE( expr ) INTERNAL_CATCH_TEST( expr, Catch::ResultDisposition::Normal | Catch::ResultDisposition::FalseTest, "REQUIRE_FALSE" ) #define REQUIRE_THROWS( expr ) INTERNAL_CATCH_THROWS( expr, Catch::ResultDisposition::Normal, "", "REQUIRE_THROWS" ) #define REQUIRE_THROWS_AS( expr, exceptionType ) INTERNAL_CATCH_THROWS_AS( expr, exceptionType, Catch::ResultDisposition::Normal, "REQUIRE_THROWS_AS" ) #define REQUIRE_THROWS_WITH( expr, matcher ) INTERNAL_CATCH_THROWS( expr, Catch::ResultDisposition::Normal, matcher, "REQUIRE_THROWS_WITH" ) #define REQUIRE_NOTHROW( expr ) INTERNAL_CATCH_NO_THROW( expr, Catch::ResultDisposition::Normal, "REQUIRE_NOTHROW" ) #define CHECK( expr ) INTERNAL_CATCH_TEST( expr, Catch::ResultDisposition::ContinueOnFailure, "CHECK" ) #define CHECK_FALSE( expr ) INTERNAL_CATCH_TEST( expr, Catch::ResultDisposition::ContinueOnFailure | Catch::ResultDisposition::FalseTest, "CHECK_FALSE" ) #define CHECKED_IF( expr ) INTERNAL_CATCH_IF( expr, Catch::ResultDisposition::ContinueOnFailure, "CHECKED_IF" ) #define CHECKED_ELSE( expr ) INTERNAL_CATCH_ELSE( expr, Catch::ResultDisposition::ContinueOnFailure, "CHECKED_ELSE" ) #define CHECK_NOFAIL( expr ) INTERNAL_CATCH_TEST( expr, Catch::ResultDisposition::ContinueOnFailure | Catch::ResultDisposition::SuppressFail, "CHECK_NOFAIL" ) #define CHECK_THROWS( expr ) INTERNAL_CATCH_THROWS( expr, Catch::ResultDisposition::ContinueOnFailure, "", "CHECK_THROWS" ) #define CHECK_THROWS_AS( expr, exceptionType ) INTERNAL_CATCH_THROWS_AS( expr, exceptionType, Catch::ResultDisposition::ContinueOnFailure, "CHECK_THROWS_AS" ) #define CHECK_THROWS_WITH( expr, matcher ) INTERNAL_CATCH_THROWS( expr, Catch::ResultDisposition::ContinueOnFailure, matcher, "CHECK_THROWS_WITH" ) #define CHECK_NOTHROW( expr ) INTERNAL_CATCH_NO_THROW( expr, Catch::ResultDisposition::ContinueOnFailure, "CHECK_NOTHROW" ) #define CHECK_THAT( arg, matcher ) INTERNAL_CHECK_THAT( arg, matcher, Catch::ResultDisposition::ContinueOnFailure, "CHECK_THAT" ) #define REQUIRE_THAT( arg, matcher ) INTERNAL_CHECK_THAT( arg, matcher, Catch::ResultDisposition::Normal, "REQUIRE_THAT" ) #define INFO( msg ) INTERNAL_CATCH_INFO( msg, "INFO" ) #define WARN( msg ) INTERNAL_CATCH_MSG( Catch::ResultWas::Warning, Catch::ResultDisposition::ContinueOnFailure, "WARN", msg ) #define SCOPED_INFO( msg ) INTERNAL_CATCH_INFO( msg, "INFO" ) #define CAPTURE( msg ) INTERNAL_CATCH_INFO( #msg " := " << msg, "CAPTURE" ) #define SCOPED_CAPTURE( msg ) INTERNAL_CATCH_INFO( #msg " := " << msg, "CAPTURE" ) #ifdef CATCH_CONFIG_VARIADIC_MACROS #define TEST_CASE( ... ) INTERNAL_CATCH_TESTCASE( __VA_ARGS__ ) #define TEST_CASE_METHOD( className, ... ) INTERNAL_CATCH_TEST_CASE_METHOD( className, __VA_ARGS__ ) #define METHOD_AS_TEST_CASE( method, ... ) INTERNAL_CATCH_METHOD_AS_TEST_CASE( method, __VA_ARGS__ ) #define REGISTER_TEST_CASE( Function, ... ) INTERNAL_CATCH_REGISTER_TESTCASE( Function, __VA_ARGS__ ) #define SECTION( ... ) INTERNAL_CATCH_SECTION( __VA_ARGS__ ) #define FAIL( ... ) INTERNAL_CATCH_MSG( Catch::ResultWas::ExplicitFailure, Catch::ResultDisposition::Normal, "FAIL", __VA_ARGS__ ) #define SUCCEED( ... ) INTERNAL_CATCH_MSG( Catch::ResultWas::Ok, Catch::ResultDisposition::ContinueOnFailure, "SUCCEED", __VA_ARGS__ ) #else #define TEST_CASE( name, description ) INTERNAL_CATCH_TESTCASE( name, description ) #define TEST_CASE_METHOD( className, name, description ) INTERNAL_CATCH_TEST_CASE_METHOD( className, name, description ) #define METHOD_AS_TEST_CASE( method, name, description ) INTERNAL_CATCH_METHOD_AS_TEST_CASE( method, name, description ) #define REGISTER_TEST_CASE( method, name, description ) INTERNAL_CATCH_REGISTER_TESTCASE( method, name, description ) #define SECTION( name, description ) INTERNAL_CATCH_SECTION( name, description ) #define FAIL( msg ) INTERNAL_CATCH_MSG( Catch::ResultWas::ExplicitFailure, Catch::ResultDisposition::Normal, "FAIL", msg ) #define SUCCEED( msg ) INTERNAL_CATCH_MSG( Catch::ResultWas::Ok, Catch::ResultDisposition::ContinueOnFailure, "SUCCEED", msg ) #endif #define ANON_TEST_CASE() INTERNAL_CATCH_TESTCASE( "", "" ) #define REGISTER_REPORTER( name, reporterType ) INTERNAL_CATCH_REGISTER_REPORTER( name, reporterType ) #define REGISTER_LEGACY_REPORTER( name, reporterType ) INTERNAL_CATCH_REGISTER_LEGACY_REPORTER( name, reporterType ) #define GENERATE( expr) INTERNAL_CATCH_GENERATE( expr ) #endif #define CATCH_TRANSLATE_EXCEPTION( signature ) INTERNAL_CATCH_TRANSLATE_EXCEPTION( signature ) // "BDD-style" convenience wrappers #ifdef CATCH_CONFIG_VARIADIC_MACROS #define SCENARIO( ... ) TEST_CASE( "Scenario: " __VA_ARGS__ ) #define SCENARIO_METHOD( className, ... ) INTERNAL_CATCH_TEST_CASE_METHOD( className, "Scenario: " __VA_ARGS__ ) #else #define SCENARIO( name, tags ) TEST_CASE( "Scenario: " name, tags ) #define SCENARIO_METHOD( className, name, tags ) INTERNAL_CATCH_TEST_CASE_METHOD( className, "Scenario: " name, tags ) #endif #define GIVEN( desc ) SECTION( std::string(" Given: ") + desc, "" ) #define WHEN( desc ) SECTION( std::string(" When: ") + desc, "" ) #define AND_WHEN( desc ) SECTION( std::string("And when: ") + desc, "" ) #define THEN( desc ) SECTION( std::string(" Then: ") + desc, "" ) #define AND_THEN( desc ) SECTION( std::string(" And: ") + desc, "" ) using Catch::Detail::Approx; #endif // TWOBLUECUBES_SINGLE_INCLUDE_CATCH_HPP_INCLUDED

[ "noreply@github.com" ]

noreply@github.com

9ed39d96a96c6e7be9eb8f69ac9573dbbd1f2ad4

37bf77c75be5e4a1e43ae67c195697b5a9c018c0

/src/api/xml/xmlmanagedobj.cpp

b13503812c95d3706c8575a2922a4025d877cac6

[ "LicenseRef-scancode-other-permissive", "LicenseRef-scancode-unknown-license-reference" ]

permissive

mecctro/wasabi

dbaa656ad71f719fa7b227346dc892058212f96d

49d293042ce17b0d137b2e4c6fc82a52bdb05091

refs/heads/master

2020-12-29T01:11:56.251711

2013-09-01T20:08:51

null

0

null

UTF-8

C++

false

2,785

cpp

/* Nullsoft WASABI Source File License Copyright 1999-2003 Nullsoft, Inc. This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. */ #include "precomp.h" #include "api/xml/xmlmanagedobj.h" // // Now, if you actually derive from XmlManagedObjBase (or even use it // by itself, without any derivation), the default functionality will // be to create a new XmlManagedObjBase object for every element extant // in your XML file, fill each of those objects with their required data, // and assemble all of the objects into a node-hierarchy that replicates // the element hierarchy of your XML file. // // If you don't want to do this, don't subclass from this object. Simply // create your own object family that provides the following methods and // feed your personalized object baseclass to the template. // XmlManagedObjBase * XmlManagedObjBase::xmlTestPath(const char * xmlpath, const char * xmltag, const char *file, const char *incpath, int line) { // The default functionality here is to simply dump out a new object for every element. XmlManagedObjBase * newNode = new XmlManagedObjBase(); // Which, because we derive from node, we add to our internal child list. addChild( newNode ); // And then return to the XmlManager to become the new "active object" return newNode; } void XmlManagedObjBase::xmlSetTag(const char * xmlpath, const char * xmltag) { tag = xmltag; } void XmlManagedObjBase::xmlSetData(const char * xmlpath, const char * xmltag, const char * xmldata, const char *file, int line) { data = xmldata; } void XmlManagedObjBase::xmlSetParams(const char * xmlpath, const char * xmltag, XmlReaderParams * xmlparams) { params = *xmlparams; // note that we're assigning from one class type to another. } void XmlManagedObjBase::xmlComplete(const char * xmlpath, const char * xmltag) { // We do nothing! We don't care! Hedonism, baby... pure hedonism. }

[ "killallthehumans@gmail.com" ]

killallthehumans@gmail.com

7b8df271c910ca0d4ea0af8f087441ac8e0ca06d

8a2f2efea44836225fb1bbe3a50a003481a926af

/AwoEngine/AwoEngine/Physics.cpp

7098d9689c7f0e96fabb76f36176ea9a2853779b

[]

no_license

awoiro/BilliardsGame

d34c1203d10f3e92b8cbd24fed5e50b7828c644e

39c9db73913c356562035622243a0ff654c90b01

refs/heads/master

2021-05-01T11:58:39.576681

2017-05-27T01:32:21

70,028,441

1

0

null

SHIFT_JIS

C++

false

3,449

cpp

#include "Physics.h" void Physics::StepPhysics() { m_pScene->simulate(1.0f / 10.0f); m_pScene->fetchResults(true); } HRESULT Physics::Init() { HRESULT hr = E_FAIL; m_pFoundation = PxCreateFoundation(PX_PHYSICS_VERSION, m_allocator, m_errorCallBack); PxProfileZoneManager* profileZoneManager = &PxProfileZoneManager::createProfileZoneManager(m_pFoundation); m_pPhysics = PxCreatePhysics(PX_PHYSICS_VERSION, *m_pFoundation, PxTolerancesScale(), true, profileZoneManager); if (m_pPhysics->getPvdConnectionManager()) { m_pPhysics->getVisualDebugger()->setVisualizeConstraints(true); m_pPhysics->getVisualDebugger()->setVisualDebuggerFlag(PxVisualDebuggerFlag::eTRANSMIT_CONSTRAINTS, true); m_pPhysics->getVisualDebugger()->setVisualDebuggerFlag(PxVisualDebuggerFlag::eTRANSMIT_SCENEQUERIES, true); //m_pPhysics->getVisualDebugger()->updateCamera("camera", PxVec3(0, 0, 0), PxVec3(0, 0, 0), PxVec3(0, 1, 0)); m_pConnection = PxVisualDebuggerExt::createConnection(m_pPhysics->getPvdConnectionManager(), "127.0.0.1", 5425, 10); } // シーンの作成 PxSceneDesc sceneDesc(m_pPhysics->getTolerancesScale()); sceneDesc.gravity = PxVec3(0.0f, -9.8f, 0.0f); m_pDispatcher = PxDefaultCpuDispatcherCreate(2); sceneDesc.cpuDispatcher = m_pDispatcher; sceneDesc.filterShader = PxDefaultSimulationFilterShader; m_pScene = m_pPhysics->createScene(sceneDesc); // マテリアルの作成 // [静運動摩擦] [動運動摩擦] [反発係数] m_pMaterial = m_pPhysics->createMaterial(0.2f, 0.4f, 0.8f); // グランドの作成 PxRigidStatic* pGroundPlane = PxCreatePlane(*m_pPhysics, PxPlane(0, 1, 0, 0), *m_pMaterial); m_pScene->addActor(*pGroundPlane); // ボールの作成 //PxRigidDynamic* pRigid = CreateDynamic(PxTransform(PxVec3(10, 10, -100)), PxSphereGeometry(10), PxVec3(0, 0, 0)); //CreateDynamic(PxTransform(PxVec3(30, 30, -100)), PxSphereGeometry(10), PxVec3(0, 0, 0)); //CreateDynamic(PxTransform(PxVec3(50, 50, -100)), PxSphereGeometry(10), PxVec3(0, 0, 0)); // 不動四角形の作成 //CreateStatic(PxTransform(PxVec3(0, 0, 0)), PxBoxGeometry(5, 4, 3), PxVec3(0, 0, 0)); return S_OK; } void Physics::Shutdown() { //PX_UNUSED(bool) m_pScene->release(); m_pDispatcher->release(); PxProfileZoneManager* profileZoneManager = m_pPhysics->getProfileZoneManager(); if (m_pConnection != nullptr) { m_pConnection->release(); } m_pPhysics->release(); profileZoneManager->release(); m_pFoundation->release(); } PxRigidDynamic * Physics::CreateDynamic(const PxTransform & t, const PxGeometry & geometry, const PxVec3 & velocity) { PxRigidDynamic* dynamic = PxCreateDynamic(*m_pPhysics, t, geometry, *m_pMaterial, 10.0f); dynamic->setAngularDamping(0.5f); dynamic->setLinearVelocity(velocity); m_pScene->addActor(*dynamic); return dynamic; } PxRigidStatic * Physics::CreateStatic(const PxTransform & t, const PxGeometry & geometry, const PxVec3 & velocity) { //PxRigidStatic* pStatic = PxCreateStatic(*m_pPhysics, t, geometry, *m_pMaterial, 10.0f); PxRigidStatic* pStatic = m_pPhysics->createRigidStatic(t); PxShape* pShape = pStatic->createShape(geometry, *m_pMaterial); PX_UNUSED(pShape); m_pScene->addActor(*pStatic); return pStatic; } void Physics::UpdatePVDCamera() { #if false if (m_pPhysics->getPvdConnectionManager()) { // name orizin up target m_pPhysics->getVisualDebugger()->updateCamera("camera", PxVec3(0,0,-3500), PxVec3(0,0,0), PxVec3(0,1,0)); } #endif }

[ "awoiro7224@yahoo.co.jp" ]

awoiro7224@yahoo.co.jp

e03131c121ae7872d28a945eca9efe47607b6923

9ae842446a4ee351f17da96b04a1b5cbcbd3701d

/assignment-13-project3/src/ofApp.cpp

e6c7c16aaad70f32670148350958a30282fec09e

[]

no_license

sungminro92/openFrameworks

c3597a55506a3ef0a2d4b860816bcf583f7a9497

94bf711b52b482c393a8eaf0713f322154ac6a40

refs/heads/master

2020-04-19T14:21:41.255975

2019-06-03T21:27:07

168,242,483

0

null

UTF-8

C++

false

2,390

cpp

#include "ofApp.h" ofColor pink(255,234,231); ofColor skyBlue(166,206,206); ofColor darkBlue(128,181, 175); ofColor red(255,0, 0); ofVec2f fire; // x position of the door placement int doorX[4] = {300, 700, 400, 600}; int doorY[4] = {215, 350, 485, 620}; // each floor int floorY[4] = {285, 420, 555, 690}; //-------------------------------------------------------------- void ofApp::setup(){ // building size width- 624, height -150 ofSetBackgroundColor(pink); fire.set(140, 768); } //-------------------------------------------------------------- void ofApp::update(){ fire.y -= 0.003; // increase the fire through the building } //-------------------------------------------------------------- void ofApp::draw(){ // 1024 // 768 // whole building ofSetColor(skyBlue); ofDrawRectangle(200, 150, 624, ofGetHeight()-150); // door placement for(int i=0; i<4; i++) { ofSetColor(darkBlue); ofDrawRectangle(doorX[i],doorY[i],40,70); ofDrawRectangle(177, floorY[i],670, 10); } ofSetColor(red); ofDrawRectangle(140, fire.y, 740, ofGetHeight() - fire.y); } //-------------------------------------------------------------- void ofApp::keyPressed(int key){ } //-------------------------------------------------------------- void ofApp::keyReleased(int key){ } //-------------------------------------------------------------- void ofApp::mouseMoved(int x, int y ){ } //-------------------------------------------------------------- void ofApp::mouseDragged(int x, int y, int button){ } //-------------------------------------------------------------- void ofApp::mousePressed(int x, int y, int button){ } //-------------------------------------------------------------- void ofApp::mouseReleased(int x, int y, int button){ } //-------------------------------------------------------------- void ofApp::mouseEntered(int x, int y){ } //-------------------------------------------------------------- void ofApp::mouseExited(int x, int y){ } //-------------------------------------------------------------- void ofApp::windowResized(int w, int h){ } //-------------------------------------------------------------- void ofApp::gotMessage(ofMessage msg){ } //-------------------------------------------------------------- void ofApp::dragEvent(ofDragInfo dragInfo){ }

[ "sungminro92@gmail.com" ]

sungminro92@gmail.com

65c3c96db499b5d675cdadc721c44c6efb2992c2

9ef281f0c282d2147ef68a6ccc258c6198f151d4

/cpp/hello.cpp

919fa69045071550c36e000ff536f648f897b6e7

[]

no_license

oPen-sOurce-bRewinG-pOT/all

f7e04f92749823fc82aa0de798b42ac7eda25a4a

8ec402af5edaf2b18089a542a965d78b54d71582

refs/heads/master

2021-01-10T05:49:04.021149

2015-11-03T07:54:25

45,450,366

0

null

UTF-8

C++

false

125

cpp

#include <iostream> using namespace std ; int main() { cout << "Hello world!\n" << "My first CPP Code!\n" ; return 0 ; }

[ "sunip@Sunips-MacBook.local" ]

sunip@Sunips-MacBook.local

82d71862ba8a3fae47c089b374af260ae4632505

5bc780f65e9ab510c6b520226bbb9843cfc59b21

/menu.hpp

6f49e484f034d70c108f8a9cb1982dd38bb261bb

[]

no_license

fabsgc/EFREI-S2-Chess

087059d056525db1ebd75df5f1517c5121ec5b90

2ff5e32ec8036c3d962e2ee32d98fcf7bda39508

refs/heads/master

2021-03-12T19:28:58.443411

2017-09-08T16:13:13

102,880,283

0

null

UTF-8

C++

false

236

hpp

#ifndef MENU_HPP_INCLUDED #define MENU_HPP_INCLUDED #include "function.hpp" void drawMenu(Engine * engine); void playMenu(Engine * engine); void enregistrer(Engine * engine); void charger(Engine* engine); #endif // MENU_HPP_INCLUDED

[ "fabienbeaudimi@hotmail.fr" ]

fabienbeaudimi@hotmail.fr

589a29963d5dd0a97120230d0684d0a5369c07dc

3d3d864c88bea587988830c265dc9cb329a41257

/AST/AST.cpp

49f796fb5ccdf355badb4658f83d85f5b027a203

[]

no_license

s-kyo/YAVM

ce4028abc353c6368e36ef2903f8f68580440620

649e9e4461478d029ecb4ced5bfcb063e01633c4

refs/heads/master

2020-05-24T10:01:03.879722

2019-05-22T14:41:07

187,219,840

0

null

UTF-8

C++

false

770

cpp

// AST.cpp : This file contains the 'main' function. Program execution begins and ends there. // // YAVM ---- Yet Another Vim for Mathematicians #include <iostream> #include <vector> typedef enum _ObjectType { T_TEXT, T_EQUATION, }ObjectType; typedef enum _ObjectName { //////////////////////////// EVIRONMENT //////////////////////////// N_ALIGN, // $1 = $2 ///////////////////////////// OPERATOR ///////////////////////////// N_INTEGRATE, // int_$1^$2 $3 d$4 N_PLUS, // $1 + $2 }ObjectName; typedef enum _Symbol { S_ALPHA, S_BETA, S_NUM, }Symbol; typedef struct _Object { ObjectType t; ObjectName n; std::vector<Object*> obj_list; Symbol sym; int num; }Object; int main() { Object root; root.t = T_EQUATION; root.n = N_PLUS; }

[ "xushijie.cn@gmail.com" ]

xushijie.cn@gmail.com

dc4ad6829256d6b496dd2af3f616e3c49e6351b2

24c710d3354a613dd2ea95d8f123be4d5d4407c2

/module_05/ex02/Form.cpp

03268bbf10d6b923cac84078f12e537f4fce8ba7

[]

no_license

jiyoon1156/CPP_Module

442166e9950c9aeaf38b4690011e71fe855ed34b

e297350c86a38caf0699db9a8bc293564d749c1e

refs/heads/master

2022-12-08T17:34:16.277373

2020-09-05T03:57:08

286,356,183

0

null

UTF-8

C++

false

3,086

cpp

/* ************************************************************************** */ /* */ /* ::: :::::::: */ /* Form.cpp :+: :+: :+: */ /* +:+ +:+ +:+ */ /* By: jhur <marvin@42.fr> +#+ +:+ +#+ */ /* +#+#+#+#+#+ +#+ */ /* Created: 2020/08/27 12:14:28 by jhur #+# #+# */ /* Updated: 2020/09/02 22:27:57 by jhur ### ########.fr */ /* */ /* ************************************************************************** */ #include "Form.hpp" Form::Form(std::string const &name, unsigned int const signGrade, unsigned int execGrade) : _formName(name), _signed(0), _signGrade(signGrade), _execGrade(execGrade) { if (signGrade < 1 || execGrade < 1) throw Form::GradeTooHighException(); else if (signGrade > 150 || execGrade > 150) throw Form::GradeTooLowException(); } Form::~Form(){} const char* Form::GradeTooHighException::what() const throw() { return ("Exception from Form: Grade is too high!"); } const char* Form::GradeTooLowException::what() const throw() { return ("Exception from Form: Grade is too low!"); } const char* Form::AlreadySignedException::what() const throw() { return ("It is already signed"); } const char* Form::NeedSignException::what() const throw() { return ("Form must be signed first!"); } Form::Form(const Form &copy) : _formName(copy._formName), _signed(0), _signGrade(copy._signGrade), _execGrade(copy._execGrade) { if (copy._signGrade < 1 || copy._execGrade < 1) throw Form::GradeTooHighException(); else if (copy._signGrade > 150 || copy._execGrade> 150) throw Form::GradeTooLowException(); *this = copy; } Form &Form::operator=(const Form &ref) { this->_signed = ref._signed; return (*this); } std::string Form::getName(void) const { return (this->_formName); } unsigned int Form::getSignGrade(void) const { return (this->_signGrade); } unsigned int Form::getExecGrade(void) const { return (this->_execGrade); } bool Form::getSigned(void) const { return (this->_signed); } void Form::beSigned(Bureaucrat &b) { if (this->_signed != 0) std::cout << "It is already signed!" << std::endl; else if (b.getGrade() > this->_signGrade) throw Form::GradeTooLowException(); else this->_signed = 1; } void Form::execute(Bureaucrat const & executor) const { if (this->_signed == 0) std::cout << "Form must be signed first!" << std::endl; if (executor.getGrade() > this->_signGrade) throw Form::GradeTooLowException(); } std::ostream &operator<<(std::ostream &out, Form const &form) { out << form.getName() << ", Form sign grade is " << form.getSignGrade(); out << ", and Form execute grade is " << form.getExecGrade(); return (out); }

[ "jiyoon1156@gmail.com" ]

jiyoon1156@gmail.com

e25325c662b8e8a80126654da7d0527600096063

2de7554bb0517da07732d602616a946bf86431fc

/src/SharpSvn/Commands/RepositoryCopy.cpp

67be7076b38cf5cbfca64597b6b4a21ac7525005

[ "Apache-2.0" ]

permissive

AmpScm/SharpSvn

8bf17428abd5e34a296dfff1d589037348cf4545

af1d1415f0704ae107d82c60abbbd01e336bcb66

refs/heads/main

2023-08-08T14:17:54.574166

2023-07-28T12:30:40

355,922,858

41

15

Apache-2.0

2023-08-04T22:25:41

2021-04-08T13:41:24

C

UTF-8

C++

false

3,313

cpp

// Copyright 2007-2009 The SharpSvn Project // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #include "stdafx.h" #include "SvnMultiCommandClient.h" using namespace SharpSvn; bool SvnMultiCommandClient::Copy(String ^fromPath, String ^toPath) { if (String::IsNullOrEmpty(fromPath) || ! IsValidRelpath(fromPath)) throw gcnew ArgumentException(SharpSvnStrings::ArgumentMustBeAValidRelativePath, "fromPath"); else if (String::IsNullOrEmpty(toPath) || ! IsValidRelpath(toPath)) throw gcnew ArgumentException(SharpSvnStrings::ArgumentMustBeAValidRelativePath, "toPath"); return Copy(fromPath, SVN_INVALID_REVNUM, toPath); } bool SvnMultiCommandClient::Copy(String ^fromPath, __int64 fromRev, String ^toPath) { if (String::IsNullOrEmpty(fromPath) || ! IsValidRelpath(fromPath)) throw gcnew ArgumentException(SharpSvnStrings::ArgumentMustBeAValidRelativePath, "fromPath"); else if (String::IsNullOrEmpty(toPath) || ! IsValidRelpath(toPath)) throw gcnew ArgumentException(SharpSvnStrings::ArgumentMustBeAValidRelativePath, "toPath"); return Copy(fromPath, fromRev, toPath, gcnew SvnRepositoryCopyArgs()); } bool SvnMultiCommandClient::Copy(String ^fromPath, String ^toPath, SvnRepositoryCopyArgs ^args) { if (String::IsNullOrEmpty(fromPath) || ! IsValidRelpath(fromPath)) throw gcnew ArgumentException(SharpSvnStrings::ArgumentMustBeAValidRelativePath, "fromPath"); else if (String::IsNullOrEmpty(toPath) || ! IsValidRelpath(toPath)) throw gcnew ArgumentException(SharpSvnStrings::ArgumentMustBeAValidRelativePath, "toPath"); else if (! args) throw gcnew ArgumentNullException("args"); return Copy(fromPath, SVN_INVALID_REVNUM, toPath, args); } bool SvnMultiCommandClient::Copy(String ^fromPath, __int64 fromRev, String ^toPath, SvnRepositoryCopyArgs ^args) { if (String::IsNullOrEmpty(fromPath) || ! IsValidRelpath(fromPath)) throw gcnew ArgumentException(SharpSvnStrings::ArgumentMustBeAValidRelativePath, "fromPath"); else if (String::IsNullOrEmpty(toPath) || ! IsValidRelpath(toPath)) throw gcnew ArgumentException(SharpSvnStrings::ArgumentMustBeAValidRelativePath, "toPath"); else if (! args) throw gcnew ArgumentNullException("args"); AprPool pool(%_pool); McArgsStore store(this, args); SVN_HANDLE(svn_client_mtcc_add_copy(pool.AllocRelpath(fromPath), SVN_IS_VALID_REVNUM(fromRev) ? (svn_revnum_t)fromRev : SVN_INVALID_REVNUM, pool.AllocRelpath(toPath), _mtcc, pool.Handle)); return true; }

[ "rhuijben@users.noreply.github.com" ]

rhuijben@users.noreply.github.com

bc59c13b30aae846d6efb5f6817fb72d6c7986d2

1a4f6d71e5944d80ccee022999c77a29ece56ec6

/tools/radiant/MRU.CPP

a0957cf121168014d2d014d5657630737185ba7d

[]

no_license

LavinasChange/qc

8e43d20f08b620d1a1732c08234b4a1c586e84ce

fb08f8cd2ff50cd2c4b907ff43ab65a3479d4c3c

refs/heads/master

2020-07-11T11:25:42.416507

2019-04-19T20:05:04

null

0

null

UTF-8

C++

false

20,584

cpp

/* =========================================================================== Doom 3 GPL Source Code Copyright (C) 1999-2011 id Software LLC, a ZeniMax Media company. This file is part of the Doom 3 GPL Source Code (?Doom 3 Source Code?). Doom 3 Source Code is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. Doom 3 Source Code is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with Doom 3 Source Code. If not, see <http://www.gnu.org/licenses/>. In addition, the Doom 3 Source Code is also subject to certain additional terms. You should have received a copy of these additional terms immediately following the terms and conditions of the GNU General Public License which accompanied the Doom 3 Source Code. If not, please request a copy in writing from id Software at the address below. If you have questions concerning this license or the applicable additional terms, you may contact in writing id Software LLC, c/o ZeniMax Media Inc., Suite 120, Rockville, Maryland 20850 USA. =========================================================================== */ #include "../../idlib/precompiled.h" #pragma hdrstop #include <windowsx.h> #include "mru.h" //************************************************************* // File name: mru.c // // Description: // // Routines for MRU support // // Development Team: // // Gilles Vollant (100144.2636@compuserve.com) // //************************************************************* // CreateMruMenu : MRUMENU constructor // wNbLruShowInit : nb of item showed in menu // wNbLruMenuInit : nb of item stored in memory // wMaxSizeLruItemInit : size max. of filename //************************************************************* // // CreateMruMenu() // // Purpose: // // Allocate and Initialize an MRU and return a pointer on it // // // Parameters: // // WORD wNbLruShowInit - Maximum number of item displayed on menu // WORD wNbLruMenuInit - Maximum number of item stored in memory // WORD wMaxSizeLruItemInit - Maximum size of an item (ie size of pathname) // WORD wIdMruInit - ID of the first item in the menu (default:IDMRU) // // // Return: (LPMRUMENU) // // Pointer on a MRUMENU structure, used by other function // // // Comments: // wNbLruShowInit <= wNbLruMenuInit // // // History: Date Author Comment // 09/24/94 G. Vollant Created // //************************************************************* LPMRUMENU CreateMruMenu (WORD wNbLruShowInit, WORD wNbLruMenuInit,WORD wMaxSizeLruItemInit,WORD wIdMruInit) { LPMRUMENU lpMruMenu; lpMruMenu = (LPMRUMENU)GlobalAllocPtr(GHND,sizeof(MRUMENU)); lpMruMenu->wNbItemFill = 0; lpMruMenu->wNbLruMenu = wNbLruMenuInit; lpMruMenu->wNbLruShow = wNbLruShowInit; lpMruMenu->wIdMru = wIdMruInit; lpMruMenu->wMaxSizeLruItem = wMaxSizeLruItemInit; lpMruMenu->lpMRU = (LPSTR)GlobalAllocPtr(GHND, lpMruMenu->wNbLruMenu*(UINT)lpMruMenu->wMaxSizeLruItem); if (lpMruMenu->lpMRU == NULL) { GlobalFreePtr(lpMruMenu); lpMruMenu = NULL; } return lpMruMenu; } //************************************************************* // // CreateMruMenuDefault() // // Purpose: // // Allocate and Initialize an MRU and return a pointer on it // Use default parameter // // // Parameters: // // // Return: (LPMRUMENU) // // Pointer on a MRUMENU structure, used by other function // // // Comments: // // // History: Date Author Comment // 09/24/94 G. Vollant Created // //************************************************************* LPMRUMENU CreateMruMenuDefault() { return CreateMruMenu (NBMRUMENUSHOW,NBMRUMENU,MAXSIZEMRUITEM,IDMRU); } //************************************************************* // // DeleteMruMenu() // // Purpose: // Destructor : // Clean and free a MRUMENU structure // // Parameters: // // LPMRUMENU lpMruMenu - pointer on MRUMENU, allocated // by CreateMruMenu() or CreateMruMenuDefault() // // // Return: void // // // Comments: // // // History: Date Author Comment // 09/24/94 G. Vollant Created // //************************************************************* void DeleteMruMenu(LPMRUMENU lpMruMenu) { GlobalFreePtr(lpMruMenu->lpMRU); GlobalFreePtr(lpMruMenu); } //************************************************************* // // SetNbLruShow() // // Purpose: // Change the maximum number of item displayed on menu // // Parameters: // LPMRUMENU lpMruMenu - pointer on MRUMENU // WORD wNbLruShowInit - Maximum number of item displayed on menu // // // Return: void // // // Comments: // // // History: Date Author Comment // 09/24/94 G. Vollant Created // //************************************************************* void SetNbLruShow (LPMRUMENU lpMruMenu,WORD wNbLruShowInit) { lpMruMenu->wNbLruShow = min(wNbLruShowInit,lpMruMenu->wNbLruMenu); } //************************************************************* // // SetMenuItem() // // Purpose: // Set the filename of an item // // Parameters: // LPMRUMENU lpMruMenu - pointer on MRUMENU // WORD wItem - Number of Item to set, zero based // LPSTR lpItem - String, contain the filename of the item // // // Return: (BOOL) // TRUE - Function run successfully // FALSE - Function don't run successfully // // // Comments: // used when load .INI or reg database // // History: Date Author Comment // 09/24/94 G. Vollant Created // //************************************************************* BOOL SetMenuItem (LPMRUMENU lpMruMenu,WORD wItem,LPSTR lpItem) { if (wItem >= NBMRUMENU) return FALSE; _fstrncpy((lpMruMenu->lpMRU) + ((lpMruMenu->wMaxSizeLruItem) * (UINT)wItem), lpItem,lpMruMenu->wMaxSizeLruItem-1); lpMruMenu->wNbItemFill = max(lpMruMenu->wNbItemFill,wItem+1); return TRUE; } //************************************************************* // // GetMenuItem() // // Purpose: // Get the filename of an item // // Parameters: // LPMRUMENU lpMruMenu - pointer on MRUMENU // WORD wItem - Number of Item to set, zero based // BOOL fIDMBased - TRUE : wItem is based on ID menu item // FALSE : wItem is zero-based // LPSTR lpItem - String where the filename of the item will be // stored by GetMenuItem() // UINT uiSize - Size of the lpItem buffer // // // Return: (BOOL) // TRUE - Function run successfully // FALSE - Function don't run successfully // // // Comments: // Used for saving in .INI or reg database, or when user select // an MRU in File menu // // History: Date Author Comment // 09/24/94 G. Vollant Created // //************************************************************* BOOL GetMenuItem (LPMRUMENU lpMruMenu,WORD wItem, BOOL fIDMBased,LPSTR lpItem,UINT uiSize) { if (fIDMBased) wItem -= (lpMruMenu->wIdMru + 1); if (wItem >= lpMruMenu->wNbItemFill) return FALSE; _fstrncpy(lpItem,(lpMruMenu->lpMRU) + ((lpMruMenu->wMaxSizeLruItem) * (UINT)(wItem)),uiSize); *(lpItem+uiSize-1) = '\0'; return TRUE; } //************************************************************* // // AddNewItem() // // Purpose: // Add an item at the begin of the list // // Parameters: // LPMRUMENU lpMruMenu - pointer on MRUMENU // LPSTR lpItem - String contain the filename to add // // Return: (BOOL) // TRUE - Function run successfully // FALSE - Function don't run successfully // // // Comments: // Used when used open a file (using File Open common // dialog, Drag and drop or MRU) // // History: Date Author Comment // 09/24/94 G. Vollant Created // //************************************************************* void AddNewItem (LPMRUMENU lpMruMenu,LPSTR lpItem) { WORD i,j; for (i=0;i<lpMruMenu->wNbItemFill;i++) if (lstrcmpi(lpItem,(lpMruMenu->lpMRU) + ((lpMruMenu->wMaxSizeLruItem) * (UINT)i)) == 0) { // Shift the other items for (j=i;j>0;j--) lstrcpy((lpMruMenu->lpMRU) + (lpMruMenu->wMaxSizeLruItem * (UINT)j), (lpMruMenu->lpMRU) + (lpMruMenu->wMaxSizeLruItem * (UINT)(j-1))); _fstrncpy(lpMruMenu->lpMRU,lpItem,lpMruMenu->wMaxSizeLruItem-1); return ; } lpMruMenu->wNbItemFill = min(lpMruMenu->wNbItemFill+1,lpMruMenu->wNbLruMenu); for (i=lpMruMenu->wNbItemFill-1;i>0;i--) lstrcpy(lpMruMenu->lpMRU + (lpMruMenu->wMaxSizeLruItem * (UINT)i), lpMruMenu->lpMRU + (lpMruMenu->wMaxSizeLruItem * (UINT)(i-1))); _fstrncpy(lpMruMenu->lpMRU,lpItem,lpMruMenu->wMaxSizeLruItem-1); } //************************************************************* // // DelMenuItem() // // Purpose: // Delete an item // // Parameters: // LPMRUMENU lpMruMenu - pointer on MRUMENU // WORD wItem - Number of Item to set, zero based // BOOL fIDMBased - TRUE : wItem is based on ID menu item // FALSE : wItem is zero-based // // Return: (BOOL) // TRUE - Function run successfully // FALSE - Function don't run successfully // // // Comments: // Used when used open a file, using MRU, and when an error // occured (by example, when file was deleted) // // History: Date Author Comment // 09/24/94 G. Vollant Created // //************************************************************* BOOL DelMenuItem(LPMRUMENU lpMruMenu,WORD wItem,BOOL fIDMBased) { WORD i; if (fIDMBased) wItem -= (lpMruMenu->wIdMru + 1); if (lpMruMenu->wNbItemFill <= wItem) return FALSE; lpMruMenu->wNbItemFill--; for (i=wItem;i<lpMruMenu->wNbItemFill;i++) lstrcpy(lpMruMenu->lpMRU + (lpMruMenu->wMaxSizeLruItem * (UINT)i), lpMruMenu->lpMRU + (lpMruMenu->wMaxSizeLruItem * (UINT)(i+1))); return TRUE; } //************************************************************* // // PlaceMenuMRUItem() // // Purpose: // Add MRU at the end of a menu // // Parameters: // LPMRUMENU lpMruMenu - pointer on MRUMENU // HMENU hMenu - Handle of menu where MRU must be added // UINT uiItem - Item of menu entry where MRU must be added // // Return: void // // // Comments: // Used MRU is modified, for refresh the File menu // // History: Date Author Comment // 09/24/94 G. Vollant Created // //************************************************************* void PlaceMenuMRUItem(LPMRUMENU lpMruMenu,HMENU hMenu,UINT uiItem) { int i; WORD wNbShow; if (hMenu == NULL) return; // remove old MRU in menu for (i=0;i<=(int)(lpMruMenu->wNbLruMenu);i++) RemoveMenu(hMenu,i+lpMruMenu->wIdMru,MF_BYCOMMAND); if (lpMruMenu->wNbItemFill == 0) return; // If they are item, insert a separator before the files InsertMenu(hMenu,uiItem,MF_SEPARATOR,lpMruMenu->wIdMru,NULL); wNbShow = min(lpMruMenu->wNbItemFill,lpMruMenu->wNbLruShow); for (i=(int)wNbShow-1;i>=0;i--) { LPSTR lpTxt; if (lpTxt = (LPSTR)GlobalAllocPtr(GHND,lpMruMenu->wMaxSizeLruItem + 20)) { wsprintf(lpTxt,"&%lu %s", (DWORD)(i+1),lpMruMenu->lpMRU + (lpMruMenu->wMaxSizeLruItem*(UINT)i)); InsertMenu(hMenu,(((WORD)i)!=(wNbShow-1)) ? (lpMruMenu->wIdMru+i+2) : lpMruMenu->wIdMru, MF_STRING,lpMruMenu->wIdMru+i+1,lpTxt); GlobalFreePtr(lpTxt); } } } /////////////////////////////////////////// //************************************************************* // // SaveMruInIni() // // Purpose: // Save MRU in a private .INI // // Parameters: // LPMRUMENU lpMruMenu - pointer on MRUMENU // LPSTR lpszSection - Points to a null-terminated string containing // the name of the section // LPSTR lpszFile - Points to a null-terminated string that names // the initialization file. // // Return: (BOOL) // TRUE - Function run successfully // FALSE - Function don't run successfully // // // Comments: // See WritePrivateProfileString API for more info on lpszSection and lpszFile // // History: Date Author Comment // 09/24/94 G. Vollant Created // //************************************************************* BOOL SaveMruInIni(LPMRUMENU lpMruMenu,LPSTR lpszSection,LPSTR lpszFile) { LPSTR lpTxt; WORD i; lpTxt = (LPSTR)GlobalAllocPtr(GHND,lpMruMenu->wMaxSizeLruItem + 20); if (lpTxt == NULL) return FALSE; for (i=0;i<lpMruMenu->wNbLruMenu;i++) { char szEntry[16]; wsprintf(szEntry,"File%lu",(DWORD)i+1); if (!GetMenuItem(lpMruMenu,i,FALSE,lpTxt,lpMruMenu->wMaxSizeLruItem + 10)) *lpTxt = '\0'; WritePrivateProfileString(lpszSection,szEntry,lpTxt,lpszFile); } GlobalFreePtr(lpTxt); WritePrivateProfileString(NULL,NULL,NULL,lpszFile); // flush cache return TRUE; } //************************************************************* // // LoadMruInIni() // // Purpose: // Load MRU from a private .INI // // Parameters: // LPMRUMENU lpMruMenu - pointer on MRUMENU // LPSTR lpszSection - Points to a null-terminated string containing // the name of the section // LPSTR lpszFile - Points to a null-terminated string that names // the initialization file. // // Return: (BOOL) // TRUE - Function run successfully // FALSE - Function don't run successfully // // // Comments: // See GetPrivateProfileString API for more info on lpszSection and lpszFile // // History: Date Author Comment // 09/24/94 G. Vollant Created // //************************************************************* BOOL LoadMruInIni(LPMRUMENU lpMruMenu,LPSTR lpszSection,LPSTR lpszFile) { LPSTR lpTxt; WORD i; lpTxt = (LPSTR)GlobalAllocPtr(GHND,lpMruMenu->wMaxSizeLruItem + 20); if (lpTxt == NULL) return FALSE; for (i=0;i<lpMruMenu->wNbLruMenu;i++) { char szEntry[16]; wsprintf(szEntry,"File%lu",(DWORD)i+1); GetPrivateProfileString(lpszSection,szEntry,"",lpTxt, lpMruMenu->wMaxSizeLruItem + 10,lpszFile); if (*lpTxt == '\0') break; SetMenuItem(lpMruMenu,i,lpTxt); } GlobalFreePtr(lpTxt); return TRUE; } #ifdef WIN32 BOOL IsWin395OrHigher(void) { WORD wVer; wVer = LOWORD(GetVersion()); wVer = (((WORD)LOBYTE(wVer)) << 8) | (WORD)HIBYTE(wVer); return (wVer >= 0x035F); // 5F = 95 dec } //************************************************************* // // SaveMruInReg() // // Purpose: // Save MRU in the registry // // Parameters: // LPMRUMENU lpMruMenu - pointer on MRUMENU // LPSTR lpszKey - Points to a null-terminated string // specifying the name of a key that // this function opens or creates. // // Return: (BOOL) // TRUE - Function run successfully // FALSE - Function don't run successfully // // // Comments: // Win32 function designed for Windows NT and Windows 95 // See RegCreateKeyEx API for more info on lpszKey // // History: Date Author Comment // 09/24/94 G. Vollant Created // //************************************************************* BOOL SaveMruInReg(LPMRUMENU lpMruMenu,LPSTR lpszKey) { LPSTR lpTxt; WORD i; HKEY hCurKey; DWORD dwDisp; lpTxt = (LPSTR)GlobalAllocPtr(GHND,lpMruMenu->wMaxSizeLruItem + 20); if (lpTxt == NULL) return FALSE; RegCreateKeyEx(HKEY_CURRENT_USER,lpszKey,0,NULL, REG_OPTION_NON_VOLATILE,KEY_ALL_ACCESS,NULL,&hCurKey,&dwDisp); for (i=0;i<lpMruMenu->wNbLruMenu;i++) { char szEntry[16]; wsprintf(szEntry,"File%lu",(DWORD)i+1); if (!GetMenuItem(lpMruMenu,i,FALSE,lpTxt,lpMruMenu->wMaxSizeLruItem + 10)) *lpTxt = '\0'; RegSetValueEx(hCurKey,szEntry,0,REG_SZ,(unsigned char*)lpTxt,lstrlen(lpTxt)); } RegCloseKey(hCurKey); GlobalFreePtr(lpTxt); return TRUE; } //************************************************************* // // LoadMruInReg() // // Purpose: // Load MRU from the registry // // Parameters: // LPMRUMENU lpMruMenu - pointer on MRUMENU // LPSTR lpszKey - Points to a null-terminated string // specifying the name of a key that // this function opens or creates. // // Return: (BOOL) // TRUE - Function run successfully // FALSE - Function don't run successfully // // // Comments: // Win32 function designed for Windows NT and Windows 95 // See RegOpenKeyEx API for more info on lpszKey // // History: Date Author Comment // 09/24/94 G. Vollant Created // //************************************************************* BOOL LoadMruInReg(LPMRUMENU lpMruMenu,LPSTR lpszKey) { LPSTR lpTxt; WORD i; HKEY hCurKey; DWORD dwType; lpTxt = (LPSTR)GlobalAllocPtr(GHND,lpMruMenu->wMaxSizeLruItem + 20); if (lpTxt == NULL) return FALSE; RegOpenKeyEx(HKEY_CURRENT_USER,lpszKey,0,KEY_READ,&hCurKey); for (i=0;i<lpMruMenu->wNbLruMenu;i++) { char szEntry[16]; DWORD dwSizeBuf; wsprintf(szEntry,"File%lu",(DWORD)i+1); *lpTxt = '\0'; dwSizeBuf = lpMruMenu->wMaxSizeLruItem + 10; RegQueryValueEx(hCurKey,szEntry,NULL,&dwType,(LPBYTE)lpTxt,&dwSizeBuf); *(lpTxt+dwSizeBuf)='\0'; if (*lpTxt == '\0') break; SetMenuItem(lpMruMenu,i,lpTxt); } RegCloseKey(hCurKey); GlobalFreePtr(lpTxt); return TRUE; } //************************************************************* // // GetWin32Kind() // // Purpose: // Get the Win32 platform // // Parameters: // // Return: (WIN32KIND) // WINNT - Run under Windows NT // WIN32S - Run under Windows 3.1x + Win32s // WIN95ORGREATHER - Run under Windows 95 // // // Comments: // Win32 function designed for Windows NT and Windows 95 // See RegOpenKeyEx API for more info on lpszKey // // History: Date Author Comment // 09/24/94 G. Vollant Created // //************************************************************* WIN32KIND GetWin32Kind() { BOOL IsWin395OrHigher(void); WORD wVer; if ((GetVersion() & 0x80000000) == 0) return WINNT; wVer = LOWORD(GetVersion()); wVer = (((WORD)LOBYTE(wVer)) << 8) | (WORD)HIBYTE(wVer); if (wVer >= 0x035F) return WIN95ORGREATHER; else return WIN32S; } #endif

[ "sjm@sjm.io" ]

sjm@sjm.io

9a6e8943403c734ebb3e4c5c003fe1a5609877c0

0f33392fb1f73a50e9a01639e6225802398aa59e

/fusiontree.hpp

89f232adc57657ee2221ee4156eb61f9f32db195

[ "MIT" ]

permissive

6851-2017/fusiontree

c3038837ccf71b142423824dcb4b8381689f0c75

24a61c4233ada72fc71dd089ef181e341eeca12e

refs/heads/main

2023-04-22T01:26:02.418661

2021-05-15T20:41:48

352,440,389

1

0

null

UTF-8

C++

false

4,639

hpp

// // fusiontree.hpp // Fusion Tree // // Created by Rogerio Aristida Guimaraes Junior on 1/23/18. // #ifndef fusiontree_hpp #define fusiontree_hpp #include <stdio.h> #include <memory> #include <vector> #include "big_int.hpp" using namespace std; class environment { public: int word_size; // Size of the type being used as big int, in bits int element_size; // Size of the element of the fusion_tree, must be a square int sqrt_element_size; // Value of sqrt(element_size), necessary for most // significant bit int capacity; // maximum number of integers in a fusion tree // bitmasks precalculated to avoid use of << big_int *shift_1, *shift_neg_1, *shift_neg_0; // integers used by fast_most_significant_bit big_int clusters_first_bits, perfect_sketch_m; // integers used in parallel comparison by cluster_most_significant_bit big_int repeat_int; // integer used by parallel comparison // to repeat a number multiple times big_int powers_of_two; // bitmask with the powers of two // in ascending order big_int interposed_bits; // bitmask used to extract the bits // interposed among the repetitions of a // number environment(int word_size_ = 4000, int element_size_ = 3136, int capacity_ = 5); ~environment(); // first step of fast_most_significant_bit const int cluster_most_significant_bit(big_int x) const; // find the most significant bit of a big_int in O(1) in word RAM model const int fast_most_significant_bit(big_int const &x) const; // find the longest common prefix between two big_ints in O(1) in word RAM // model const int fast_first_diff(big_int const &x, big_int const &y) const; }; class fusiontree { private: environment *my_env; // object with the specifications of the fusion tree big_int data; // sketched integers big_int *elements; // array with the original values of the elements of the // fusiontree int sz; // size of tree big_int repeat_int; // integer used by parallel comparison // repeats a number multiple times big_int extract_interposed_bits; // bitmask used to extract the bits // interposed among the repetitions of a // number big_int extract_interposed_bits_sum; // bitmask used to extract the sum of // bits interposed among the repetitions // of a number, after having gathering // them together big_int m; // integer m int *m_indices; // array to keep the position of the set bits of m big_int sketch_mask; // mask of all the m_i+b_i sums int important_bits_count; // number of important bits big_int mask_important_bits; // mask of important bits int *important_bits; // indexes of the important bits of the elements in the // fusion tree // add numbers from a vector to array elements void add_in_array(vector<big_int> &elements_); // finds the important bits of a set of integers void find_important_bits(); // finds an integer m and sketch_mask to be used for sketching void find_m(); // sets the variables used in parallel comparison void set_parallel_comparison(); // returns the approximate sketch, in the fusion tree, of a given number const big_int approximate_sketch(const big_int &x) const; // returns an integer with O(w^(1/5)) sketches of x, separated by zeroes const big_int multiple_sketches(const big_int &x) const; // returns the index of the biggest y in the tree succh that // sketch(y)<=sketch(x) const int find_sketch_predecessor(const big_int &x) const; public: // returns the number of integers stored const int size() const; // returns the number in a given position in the tree const big_int pos(int i) const; // returns the index of the biggest k in the tree succh that k<=x // or -1 if there is no such k const int find_predecessor(const big_int &x) const; // fusiontree constructor // v_ is a vector with the integers to be stored fusiontree(vector<big_int> &v_, environment *my_env_); // fusiontree destructor ~fusiontree(); }; // prints all the numbers, in binary form, in a fusion tree std::ostream &operator<<(std::ostream &out, const fusiontree &t); #endif /* fusiontree_hpp */

[ "rjunior@mit.edu" ]

rjunior@mit.edu

5908ac57146dc89a5795658517489b0f7a257d63

1260727ba17ac50741f686df98e7c82ce252778a

/src/database/kernels/copy/copy_6464.hpp

d0e312012ae460f314b01046b69213a0384583ce

[ "Apache-2.0" ]

permissive

jlwatson/CLBlast

d154b96127422606625f4dd5846ae52c0f4883a6

4bd197d42aa4849022fcb434600b37f32eed08c6

refs/heads/master

2022-12-08T11:19:09.089272

2020-09-09T10:27:46

291,141,680

0

1

Apache-2.0

2020-08-28T20:38:38

null

UTF-8

C++

false

10,700

hpp

// ================================================================================================= // This file is part of the CLBlast project. The project is licensed under Apache Version 2.0. It // is auto-generated by the 'scripts/database/database.py' Python script. // // This file populates the database with best-found tuning parameters for the 'Copy6464' kernels. // // ================================================================================================= namespace clblast { namespace database { const DatabaseEntry CopyComplexDouble = { "Copy", Precision::kComplexDouble, {"COPY_DIMX", "COPY_DIMY", "COPY_VW", "COPY_WPT"}, { { // AMD GPUs kDeviceTypeGPU, "AMD", { { "Ellesmere", { { Name{"AMD Radeon RX 480 "}, Params{ 8, 32, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 8, 32, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, { "Fiji", { { Name{"AMD Radeon R9 Fury X "}, Params{ 8, 16, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"AMD Radeon R9 M370X Compute Engine "}, Params{ 8, 16, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 8, 16, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, { "Hawaii", { { Name{"AMD Radeon R9 290X "}, Params{ 32, 8, 2, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 32, 8, 2, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, { "Oland", { { Name{"Oland "}, Params{ 8, 16, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 8, 16, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, { "Pitcairn", { { Name{"AMD Radeon R9 270X "}, Params{ 16, 8, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 16, 8, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, { "Tahiti", { { Name{"AMD Radeon HD 7970 "}, Params{ 8, 16, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 8, 16, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, { "Tonga", { { Name{"AMD Radeon R9 380 "}, Params{ 16, 8, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 16, 8, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, { "default", { { Name{"AMD Radeon Pro 580 Compute Engine "}, Params{ 32, 8, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 16, 8, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, } }, { // ARM GPUs kDeviceTypeGPU, "ARM", { { "default", { { Name{"Mali-T760 "}, Params{ 32, 8, 1, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 32, 8, 1, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, } }, { // Intel CPUs kDeviceTypeCPU, "Intel", { { "default", { { Name{"Intel(R) Core(TM) i7-2670QM CPU @ 2.20GHz "}, Params{ 8, 8, 8, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"Intel(R) Core(TM) i5-4570 CPU @ 3.20GHz "}, Params{ 32, 8, 8, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"Intel(R) Core(TM) i5-4590S CPU @ 3.00GHz "}, Params{ 16, 8, 8, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"Intel(R) Core(TM) i5-6200U CPU @ 2.30GHz "}, Params{ 32, 8, 8, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"Intel(R) Core(TM) i7 CPU 920 @ 2.67GHz "}, Params{ 32, 16, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"Intel(R) Core(TM) i7-3770 CPU @ 3.40GHz "}, Params{ 32, 32, 8, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"Intel(R) Core(TM) i7-4790K CPU @ 4.00GHz "}, Params{ 32, 16, 8, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"Intel(R) Core(TM) i7-5930K CPU @ 3.50GHz "}, Params{ 8, 8, 8, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"Intel(R) Core(TM) i7-6770HQ CPU @ 2.60GHz "}, Params{ 32, 32, 8, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"Intel(R) Xeon(R) CPU E5-2630 v3 @ 2.40GHz "}, Params{ 32, 32, 8, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"Intel(R) Xeon(R) CPU E5-2630 v4 @ 2.20GHz "}, Params{ 32, 8, 4, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 16, 8, 8, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, } }, { // Intel GPUs kDeviceTypeGPU, "Intel", { { "default", { { Name{"Intel(R) HD Graphics 620 "}, Params{ 8, 16, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 8, 16, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, } }, { // Intel accelerators kDeviceTypeAccelerator, "Intel", { { "default", { { Name{"Intel(R) Many Integrated Core Acceleration Card "}, Params{ 32, 8, 8, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 32, 8, 8, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, } }, { // NVIDIA GPUs kDeviceTypeGPU, "NVIDIA", { { "SM2.0", { { Name{"GeForce GTX 480 "}, Params{ 16, 8, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"GeForce GTX 580 "}, Params{ 8, 8, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 8, 8, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, { "SM3.0", { { Name{"GRID K520 "}, Params{ 8, 8, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"GeForce GTX 670 "}, Params{ 16, 8, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"GeForce GTX 680 "}, Params{ 8, 8, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"GeForce GTX 760 Ti OEM "}, Params{ 8, 8, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 8, 8, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, { "SM3.5", { { Name{"GeForce GTX TITAN "}, Params{ 16, 16, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"GeForce GTX TITAN Black "}, Params{ 8, 8, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"Tesla K20m "}, Params{ 8, 8, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"Tesla K40m "}, Params{ 8, 8, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 8, 8, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, { "SM5.0", { { Name{"GeForce 920MX "}, Params{ 16, 32, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"GeForce GTX 750 "}, Params{ 32, 8, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"GeForce GTX 750 Ti "}, Params{ 16, 16, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 16, 16, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, { "SM5.2", { { Name{"GeForce GTX 970 "}, Params{ 8, 16, 4, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"GeForce GTX 980 "}, Params{ 8, 8, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"GeForce GTX TITAN X "}, Params{ 16, 8, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 32, 8, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, { "SM6.0", { { Name{"Tesla P100-PCIE-16GB "}, Params{ 8, 8, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 8, 8, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, { "SM6.1", { { Name{"GeForce GTX 1070 "}, Params{ 8, 32, 1, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"GeForce GTX 1070 Ti "}, Params{ 8, 8, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"GeForce GTX 1080 "}, Params{ 8, 8, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"GeForce GTX 1080 Ti "}, Params{ 32, 32, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { Name{"TITAN X (Pascal) "}, Params{ 8, 8, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, { kDeviceNameDefault , Params{ 16, 8, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, { "default", { { kDeviceNameDefault , Params{ 8, 16, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, } }, { // Default kDeviceTypeAll, "default", { { "default", { { kDeviceNameDefault , Params{ 32, 8, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } }, } }, } }, } }; } // namespace database } // namespace clblast

[ "web@cedricnugteren.nl" ]

web@cedricnugteren.nl

c7bd9cb7ff185eed5e7707c7530f625b77426ca5

f1d98b1b98528b6a29ea7b6449dd27294bf06c7d

/2490_윷놀이/playing.cpp

e0ef16cfd0c99adaf7366c58cf1a7d710e8a8e3c

[]

no_license

hansori-c/BackJoon_Algorithm

2b2cc69156dab54c2783fddcee80a542b1c1277c

c7cb5e816eabbb1256030bdd50b91a7f8a79e1cb

refs/heads/master

2022-01-10T17:29:32.285691

2018-05-31T12:49:37

null

0

null

UTF-8

C++

false

295

cpp

/* 2018 Apr 14, made by Moon */ #include <cstdio> int main() { char ch[5] = { 'D', 'C', 'B', 'A', 'E' }; for(int t = 0; t < 3; t++) { int i, n, cnt; for (i = 1, cnt = 4; i <= 4; i++) { scanf("%d", &n); if (n == 0) { cnt--; } } printf("%c\n", ch[cnt]); } return 0; }

[ "mgyang95@gmail.com" ]

mgyang95@gmail.com

2d227fd51efb4556c5009df095a70d4b36e40e4c

585a67412139ab94d1258624da34dfd0b896086e

/chapter06/myMoveBall/myMoveBall_02_ball_acceleration/src/ofApp.h

bc509dd563cdbb734a76267121cb16ba583a9a40

[]

no_license

kyoungchinseo/oFGuideBook

1c402d3ca3be02bc1cef51e2fd9aecba487b1243

6ec1084c8ab11f87980c61e2c58a8703911d59b2

refs/heads/master

2020-03-28T17:42:01.407611

2018-09-27T14:29:19

148,426,089

0

null

UTF-8

C++

false

660

h

#pragma once #include "ofMain.h" class ofApp : public ofBaseApp{ public: void setup(); void update(); void draw(); void keyPressed(int key); void keyReleased(int key); void mouseMoved(int x, int y ); void mouseDragged(int x, int y, int button); void mousePressed(int x, int y, int button); void mouseReleased(int x, int y, int button); void mouseEntered(int x, int y); void mouseExited(int x, int y); void windowResized(int w, int h); void dragEvent(ofDragInfo dragInfo); void gotMessage(ofMessage msg); ofVec2f location; ofVec2f velocity; ofVec2f acceleration; float radius; ofVec2f maxLimit; };

[ "kcseo.acm@gmail.com" ]

kcseo.acm@gmail.com

3575b925279e078e88decfcd7cbaa3546a43894c

a058bd3fa22cf06cc505c892df6033e8d18546b4

/stxxl/tests/containers/test_vector_resize.cpp

0621cefa5692705b0b9867d1c4791712f63fbf07

[ "BSL-1.0", "LicenseRef-scancode-unknown-license-reference" ]

permissive

SilvioWeging/kASA

452cac7b4f979fc454fd2421bbf62b741663617c

19aa8ab1931acd9bfb7ecd9b356ac5855941146c

refs/heads/master

2022-12-06T01:37:55.514560

2022-11-23T13:58:56

177,816,676

24

4

BSL-1.0

2023-08-23T19:27:38

2019-03-26T15:26:53

C++

UTF-8

C++

false

1,251

cpp

/*************************************************************************** * tests/containers/test_vector_resize.cpp * * Part of the STXXL. See http://stxxl.sourceforge.net * * Copyright (C) 2015 Timo Bingmann <tb@panthema.net> * * 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 <stxxl/io> #include <stxxl/vector> typedef stxxl::VECTOR_GENERATOR<int, 4, 4>::result vector_type; int main() { stxxl::config* config = stxxl::config::get_instance(); stxxl::disk_config disk1("/tmp/stxxl-###.tmp", 16 * 1024 * 1024, "syscall autogrow=no"); disk1.unlink_on_open = true; disk1.direct = stxxl::disk_config::DIRECT_OFF; config->add_disk(disk1); vector_type* vector = new vector_type(); try { while (true) vector->push_back(0); } catch (std::exception& e) { STXXL_ERRMSG("Caught exception: " << e.what()); delete vector; // here it will crash in block_manager::delete_block(bid) } STXXL_MSG("Delete done, all is well."); return 0; }

[ "silvio.weging@gmail.com" ]

silvio.weging@gmail.com

24dc4a39ff031ed137c0851efb544f8cd80834f8

b1475417ef95da4292c38d235d8dc3afc1f8b940

/fml_ast_interpreter/src/visitors/ExecVisitor.h

4a942e7ba041797ceb1e7e7e08e5d2b31e126b30

[]

no_license

heppyn/NI-RUN

0fbef8f5fb970d1da5aedaf6ae4e254d21d58303

f3b5384a221912fbaa1b8f180620a1b02a2828b3

refs/heads/master

2023-03-14T11:03:08.002258

2021-03-04T21:09:04

341,511,388

0

null

UTF-8

C++

false

1,624

h

#ifndef FML_AST_INTERPRETER_EXECVISITOR_H #define FML_AST_INTERPRETER_EXECVISITOR_H #include "../AstNodes.h" #include "../Environment.h" class ExecVisitor : public Visitor { private: Environment* m_env = new Environment{ nullptr }; Environment* m_env_prev = nullptr; public: ~ExecVisitor() { delete m_env; delete m_env_prev; } std::unique_ptr<ast::AST> visit(const ast::Top* visitable) override; std::unique_ptr<ast::AST> visit(const ast::Print* visitable) override; std::unique_ptr<ast::AST> visit(const ast::CallMethod* visitable) override; std::unique_ptr<ast::AST> visit(const ast::Integer* visitable) override; std::unique_ptr<ast::AST> visit(const ast::Boolean* visitable) override; std::unique_ptr<ast::AST> visit(const ast::Null* visitable) override; std::unique_ptr<ast::AST> visit(const ast::Variable* visitable) override; std::unique_ptr<ast::AST> visit(const ast::AccessVariable* visitable) override; std::unique_ptr<ast::AST> visit(const ast::AssignVariable* visitable) override; std::unique_ptr<ast::AST> visit(const ast::Function* visitable) override; std::unique_ptr<ast::AST> visit(const ast::CallFunction* visitable) override; std::unique_ptr<ast::AST> visit(const ast::Block* visitable) override; std::unique_ptr<ast::AST> visit(const ast::Loop* visitable) override; std::unique_ptr<ast::AST> visit(const ast::Conditional* visitable) override; private: std::unique_ptr<ast::AST> evaluate(const ast::AST* stm); void beginScope(); void endScope(); }; #endif //FML_AST_INTERPRETER_EXECVISITOR_H

[ "hepneluk@fit.cvut.cz" ]

hepneluk@fit.cvut.cz

b2348e560ee5a07772dd8c3ae1c47bbd9b696e1d

94699dbdc1e483efd1c958a13081eeaac55b3af6

/Silver 2014 Jan/slowdown.cpp

f3364812ae2b0e0e9666d278124c8e19432ba120

[ "MIT" ]

permissive

ishaanjav/USACO-Solutions

11df110821cd42870a7d8bb55276a56fd1ac5f4c

7fa1442e910b9855e42133ff9932eaba8727b680

refs/heads/main

2023-04-06T00:39:59.435753

2021-04-01T13:39:59

null

0

null

UTF-8

C++

false

2,318

cpp

/* * Created by ishaanjav * github.com/ishaanjav * USACO Solutions: https://github.com/ishaanjav/USACO-Solutions */ #include <iostream> #include <fstream> using namespace std; #define ll long long #define pb push_back #define ins insert #define mp make_pair #define pii pair<int, int> #define pil pair<int, ll> #define pll pair<ll, ll> #define pib pair<int, bool> #define SET(a,c) memset(a,c,sizeof(a)) #define MOD 1000000007 #define Endl "\n" #define endl "\n" #define fi first #define se second #define rs resize #define len(a) (sizeof(a)/sizeof(a[0]) #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() #define FOUND(u, val) u.find(val) != u.end() #define max_self(a, b) a = max(a, b); #define min_self(a, b) a = min(a, b); #define deb cout << "ASDFASDF\n" #define read(ar) for (auto& x : ar) cin >> x; #define each(ar) for(auto i: ar) #define eachv(ar, i) for (auto i : ar) #include <string> #include <vector> typedef vector<int> vi; typedef vector<vector<int> > vvi; typedef vector<ll> vl; typedef vector<bool> vb; //#include <algorithm> //#include <set> //#include <map> //#include <unordered_set> //#include <unordered_map> //#include <cmath> //#include <cstring> //#include <sstream> //#include <stack> #include <queue> priority_queue<int, vi, greater<int> > times, distances; int main() { ifstream cin("slowdown.in"); ofstream fout("slowdown.out"); int n; cin >> n; for(int i = 0; i < n; i++){ char c; int a; cin >> c >> a; if (c == 'T'){ times.push(a); }else distances.push(a); } distances.push(1000); double D = 0, T = 0; double speed = 1; int t = 0; while(!times.empty() || !distances.empty()){ bool timeFirst = false; if(distances.empty()) timeFirst = true; else if(!distances.empty() && !times.empty() && times.top() < T + (distances.top() - D) * speed) timeFirst = true; if(timeFirst){ D += (times.top() - T) / (speed+0.0); T = times.top(); times.pop(); }else{ T += (distances.top() - D) * speed; D = distances.top(); distances.pop(); } speed++; } int time = (int) T; T -= time; if(T >= 0.5) time++; fout << time << endl; return 0; }

[ "ishaanjav@gmail.com" ]

ishaanjav@gmail.com

99933aed8a6ae08e22954bf450239fe053e7f935

c6550f150e145fccddd9bcd3184f63b38034702c

/winrt/lib/effects/generated/ColorMatrixEffect.cpp

3b3207303da3ac5b2181ffa3c515e283f87cfccc

[ "MIT" ]

permissive

oneonces/Win2D

dd2e823dcb6dd7822f706ba00bb8e0105a01fabc

86f3b80ebe5e74ab15b9d6d129d4523b5aab0fe0

refs/heads/master

2020-05-25T19:03:42.162348

2016-05-05T23:40:17

49,134,110

0

null

2016-01-06T12:34:01

2016-01-06T12:33:58

null

UTF-8

C++

false

2,046

cpp

// Copyright (c) Microsoft Corporation. All rights reserved. // // Licensed under the MIT License. See LICENSE.txt in the project root for license information. // This file was automatically generated. Please do not edit it manually. #include "pch.h" #include "ColorMatrixEffect.h" namespace ABI { namespace Microsoft { namespace Graphics { namespace Canvas { namespace Effects { ColorMatrixEffect::ColorMatrixEffect(ICanvasDevice* device, ID2D1Effect* effect) : CanvasEffect(EffectId(), 3, 1, true, device, effect, static_cast<IColorMatrixEffect*>(this)) { if (!effect) { // Set default values SetBoxedProperty<float[20]>(D2D1_COLORMATRIX_PROP_COLOR_MATRIX, Matrix5x4{ 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0 }); SetBoxedProperty<uint32_t>(D2D1_COLORMATRIX_PROP_ALPHA_MODE, D2D1_COLORMATRIX_ALPHA_MODE_PREMULTIPLIED); SetBoxedProperty<boolean>(D2D1_COLORMATRIX_PROP_CLAMP_OUTPUT, static_cast<boolean>(false)); } } IMPLEMENT_EFFECT_PROPERTY(ColorMatrixEffect, ColorMatrix, float[20], Matrix5x4, D2D1_COLORMATRIX_PROP_COLOR_MATRIX) IMPLEMENT_EFFECT_PROPERTY(ColorMatrixEffect, AlphaMode, ConvertAlphaMode, CanvasAlphaMode, D2D1_COLORMATRIX_PROP_ALPHA_MODE) IMPLEMENT_EFFECT_PROPERTY(ColorMatrixEffect, ClampOutput, boolean, boolean, D2D1_COLORMATRIX_PROP_CLAMP_OUTPUT) IMPLEMENT_EFFECT_SOURCE_PROPERTY(ColorMatrixEffect, Source, 0) IMPLEMENT_EFFECT_PROPERTY_MAPPING(ColorMatrixEffect, { L"ColorMatrix", D2D1_COLORMATRIX_PROP_COLOR_MATRIX, GRAPHICS_EFFECT_PROPERTY_MAPPING_DIRECT }, { L"AlphaMode", D2D1_COLORMATRIX_PROP_ALPHA_MODE, GRAPHICS_EFFECT_PROPERTY_MAPPING_COLORMATRIX_ALPHA_MODE }, { L"ClampOutput", D2D1_COLORMATRIX_PROP_CLAMP_OUTPUT, GRAPHICS_EFFECT_PROPERTY_MAPPING_DIRECT }) ActivatableClass(ColorMatrixEffect); }}}}}

[ "shawnhar@microsoft.com" ]

shawnhar@microsoft.com

0547fc0610a806818df6d3de73f60055748c87af

ef516abbf3cafc99dec7e12ddd9ee9423a0ccd93

/Synergy/src/Synergy/Renderer/RendererAPI.h

7342e27fd88b756992a200f47909c016bfa19827

[ "MIT", "LicenseRef-scancode-unknown-license-reference" ]

permissive

nmrsmn/synergy

15fb3baf851ab600b7a716c8ee26ee39b2f369a0

7f77c70c131debe66d2e91e00827fd30e736cf81

refs/heads/develop

2021-04-13T06:32:56.229898

2020-05-17T15:08:24

249,143,774

0

MIT

2020-05-22T11:15:13

2020-03-22T08:40:09

C

UTF-8

C++

false

1,638

h

// Created by Niels Marsman on 18-04-2020. // Copyright © 2020 Niels Marsman. All rights reserved. #ifndef SYNERGY_RENDERER_RENDERERAPI_H #define SYNERGY_RENDERER_RENDERERAPI_H #include <map> #include <glm/glm.hpp> #include "Synergy/Core.h" #include "Synergy/Renderer/Shader.h" #include "Synergy/Renderer/Texture.h" #include "Synergy/Renderer/IndexBuffer.h" #include "Synergy/Renderer/VertexArray.h" #include "Synergy/Renderer/VertexBuffer.h" namespace Synergy::Renderer { class SYNERGY_API RendererAPI { public: enum class API { OpenGL = 1, Vulkan = 2 }; public: static API Get(); public: virtual void PrepareDevice() = 0; virtual bool CreateDevice() = 0; virtual bool DestroyDevice() = 0; virtual void DisplayFrame() = 0; virtual void PrepareRendering() = 0; virtual void UpdateViewport(glm::vec2 offset, glm::vec2 size) = 0; virtual void ClearBuffer(glm::vec4 color, bool depth) = 0; virtual void DrawIndexed(const Ref<VertexArray>& vertexArray, uint32_t count = 0) = 0; virtual void DrawArrays(uint32_t count) = 0; virtual Ref<VertexArray> CreateVertexArray() = 0; virtual Ref<VertexBuffer> CreateVertexBuffer(uint32_t size) = 0; virtual Ref<IndexBuffer> CreateIndexBuffer(uint32_t* indices, uint32_t count) = 0; protected: void InitializeRenderers(RendererAPI* api); protected: static API api; }; RendererAPI* CreateRendererAPI(); } #endif

[ "niels.marsman@luminis.eu" ]

niels.marsman@luminis.eu

3eb2c6539bc84ee3735489d36efc66786c5ac87d

e91f216ea2cf9f2ecf2a770ebc6334d7034cbf94

/Baekjoon/4344평균은넘겠지.cpp

afd3d94bf41e2e43ab45c62235c3e89c3c7b3007

[]

no_license

HelloMandu/OnlineJudge

4c870a737ba8c479adf0f7763ca38afd7761e9a3

2dd0abc4066fd0b1f28346f8913ece88167eee99

refs/heads/master

2023-01-09T22:53:27.036594

2022-12-28T09:38:39

168,956,239

1

0

null

UTF-8

C++

false

484

cpp

#include<stdio.h> #include<stdlib.h> #pragma warning(disable :4996) int main() { int c, n; int sum = 0, avg; int cnt = 0; scanf("%d", &c); while (c--) { scanf("%d", &n); int *score = (int*)malloc(sizeof(int)*n); for (int i = 0; i < n; i++) { scanf("%d", &score[i]); sum += score[i]; } avg = sum / n; for (int i = 0; i < n; i++) { if (score[i] > avg) cnt++; } printf("%0.3lf%\n", ((double)cnt / n)*100); free(score); cnt = 0; sum = 0; } return 0; }

[ "tjdals6695@gmail.com" ]

tjdals6695@gmail.com

fc7822e698c4b95a818f15f7b84b4b9c29e8febf

7881f25a43bf4d21555b6e8b5bf05e3260ee5e65

/zlibrary/core/src/win32/config/ZLWin32Config.cpp

8713f499630904a0c34d877c8337c98c68be89af

[]

no_license

euroelessar/FBReader

6340b2f6d47081182ef09249f06d3645f1af24b3

bf1d1154b381e1f42716ceb205717cec4b14dd6d

refs/heads/master

2021-01-16T18:53:28.430814

2014-01-28T02:22:56

2,273,820

2

0

null

UTF-8

C++

false

6,090

cpp

/* * Copyright (C) 2004-2013 Geometer Plus <contact@geometerplus.com> * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA * 02110-1301, USA. */ #include <ZLTime.h> #include "ZLWin32Config.h" #include "StringEncoder.h" void ZLWin32ConfigManager::createInstance() { ourInstance = new ZLWin32ConfigManager(); } ZLWin32ConfigManager::ZLWin32ConfigManager() { } ZLConfig *ZLWin32ConfigManager::createConfig() const { ZLConfig *config = new ZLWin32Config(); ourIsInitialised = true; return config; } ZLWin32ConfigGroup::ZLWin32ConfigGroup(const std::string &groupName, std::set<std::string> &categories) : myCategories(categories) { myName = StringEncoder::encode(groupName); } void ZLWin32ConfigGroup::setValue(const std::string &name, const std::string &value, const std::string &category) { std::map<std::string,ZLWin32ConfigValue>::iterator it = myValues.find(name); if (it != myValues.end()) { if (category == it->second.Category) { if (it->second.Value != value) { it->second.Value = value; } return; } else { myValues.erase(it); } } std::set<std::string>::iterator jt = myCategories.find(category); if (jt == myCategories.end()) { jt = myCategories.insert(category).first; } myValues.insert(std::make_pair(name, ZLWin32ConfigValue(*jt, value))); } ZLWin32Config::ZLWin32Config() : myBufferSize(4096), myPseudoGroupNameNumber(0) { myBuffer = new char[myBufferSize]; load(); } ZLWin32Config::~ZLWin32Config() { for (std::map<std::string,ZLWin32ConfigGroup*>::const_iterator it = myGroups.begin(); it != myGroups.end(); ++it) { delete it->second; } delete[] myBuffer; } ZLWin32ConfigGroup *ZLWin32Config::getGroup(const std::string &name, bool createUnexisting) { std::map<std::string,ZLWin32ConfigGroup*>::const_iterator it = myGroups.find(name); if (it != myGroups.end()) { return it-> second; } if (createUnexisting) { ZLWin32ConfigGroup *group = new ZLWin32ConfigGroup(name, myCategories); myGroups.insert(std::make_pair(name, group)); return group; } return 0; } void ZLWin32Config::listOptionNames(const std::string &groupName, std::vector<std::string> &names) { std::map<std::string,ZLWin32ConfigGroup*>::const_iterator it = myGroups.find(groupName); if (it == myGroups.end()) { return; } const std::map<std::string,ZLWin32ConfigValue> &values = it->second->myValues; for (std::map<std::string,ZLWin32ConfigValue>::const_iterator jt = values.begin(); jt != values.end(); ++jt) { names.push_back(jt->first); } } void ZLWin32Config::listOptionGroups(std::vector<std::string> &groups) { for (std::map<std::string,ZLWin32ConfigGroup*>::const_iterator it = myGroups.begin(); it != myGroups.end(); ++it) { groups.push_back(it->first); } } void ZLWin32Config::removeGroup(const std::string &name) { std::map<std::string,ZLWin32ConfigGroup*>::iterator it = myGroups.find(name); if (it != myGroups.end()) { HKEY key; if (RegOpenKeyExA(HKEY_CURRENT_USER, rootKeyName().c_str(), 0, KEY_WRITE, &key) == ERROR_SUCCESS) { for (std::set<std::string>::const_iterator jt = myCategories.begin(); jt != myCategories.end(); ++jt) { RegDeleteKeyA(key, (*jt + "\\" + it->second->myName).c_str()); } RegCloseKey(key); } delete it->second; myGroups.erase(it); } } void ZLWin32Config::setValue(const std::string &groupName, const std::string &name, const std::string &value, const std::string &category) { ZLWin32ConfigGroup *group = getGroup(groupName, true); std::map<std::string,ZLWin32ConfigValue> &groupValues = group->myValues; std::map<std::string,ZLWin32ConfigValue>::iterator it = groupValues.find(name); if (it != groupValues.end()) { if (category == it->second.Category) { if (it->second.Value != value) { it->second.Value = value; registrySetValue(category, group->myName, name, value); } return; } else { registryRemoveValue(it->second.Category, group->myName, name); groupValues.erase(it); } } std::set<std::string>::iterator jt = myCategories.find(category); if (jt == myCategories.end()) { jt = myCategories.insert(category).first; } registrySetValue(category, group->myName, name, value); groupValues.insert(std::make_pair(name, ZLWin32ConfigValue(*jt, value))); } void ZLWin32Config::unsetValue(const std::string &groupName, const std::string &name) { ZLWin32ConfigGroup *group = getGroup(groupName, false); if (group != 0) { std::map<std::string,ZLWin32ConfigValue> &values = group->myValues; std::map<std::string,ZLWin32ConfigValue>::iterator it = values.find(name); if (it != values.end()) { registryRemoveValue(it->second.Category, group->myName, name); values.erase(it); } } } const std::string &ZLWin32Config::getValue(const std::string &groupName, const std::string &name, const std::string &defaultValue) const { std::map<std::string,ZLWin32ConfigGroup*>::const_iterator it = myGroups.find(groupName); if (it == myGroups.end()) { return defaultValue; } const std::map<std::string,ZLWin32ConfigValue> &values = it->second->myValues; std::map<std::string,ZLWin32ConfigValue>::const_iterator jt = values.find(name); return (jt != values.end()) ? jt->second.Value : defaultValue; } const std::string &ZLWin32Config::getDefaultValue(const std::string&, const std::string&, const std::string &defaultValue) const { return defaultValue; } bool ZLWin32Config::isAutoSavingSupported() const { return false; } void ZLWin32Config::startAutoSave(int) { }

[ "geometer@fbreader.org" ]

geometer@fbreader.org

b69edfd6a1edeefabc7aa0457659f945bcf632fb

ce2c2f47c391dfc934565067cad7d0fdd6ab4bd4

/finalbank.cpp

dd3d313aebe91f2ce8316b1caa4078e0d364d79b

[]

no_license

ahmadbingulzar/Bank-management-in-c-plus-plus

8f52a95a913555d8825781f79b314bab79cd05e7

a186b09edb60a60a31ec12d719ed0b5204c0ae42

refs/heads/main

2023-07-02T02:49:30.753948

2021-07-14T19:39:37

null

0

null

UTF-8

C++

false

7,292

cpp

/*This is a banking management system and create accountoldfile informatin of account ,make transactions,check details , remove account ,view total accounts list */ #include<iostream> #include<fstream> #include<stdio.h> #include<time.h> #include"validations.h" #include<string> #include<regex> using namespace std; //this funciton is used to view information of all the accounts void view_information() { string file_read; ifstream read; read.open("bankdata.txt",ios::in); while(!read.eof()) { getline(read,file_read); cout<<file_read<<endl; } } //this funtion is used to exit all the operations int exit() { cout<<"Thank you for using service"<<endl; return 0; } //this function is used to view the information of a particular account int view_customer_detail() { string middle_name,last_name,city,country,month, first_name, date, year ,cnic,mobile; string account_number; string account_number_check; bool flag=false; ifstream check; check.open("bankdata.txt",ios::in); cout<<"enter account number :"; cin>>account_number_check; while(!check.eof()) { check>>account_number>>cnic>>first_name>>middle_name>>last_name>>month>>city>>mobile>>country; if(account_number_check==account_number) { flag=true; cout<<account_number<<"\t"<<cnic<<"\t"<<first_name<<"\t"<<middle_name<<"\t"<<last_name<<"\t"<<month<<"\t"<<city<<"\t""0"<<mobile<<"\t"<<country<<endl; break; } } if(flag==false) cout<<"No Record Available :"<<endl; } //this function is used to deposit and withdraw money from particular account int transactions() { cout<<"Transactions done"<<endl; return 0; } //this function is used to delete the account of a particular customer int remove_account() { cout<<"Account removed"<<endl; return 0; } //this function is used to change the address and phone number of a particular customer char change_details() { cout<<"changed"; return 0; } //this function is used to create new account char create_new_account() { string middle_name,last_name,city,country,month, first_name, date, year ,cnic,mobile,cnic_old; int account_number; string collect; bool flag=false; fstream bank_data; bank_data.open("bankdata.txt",ios::in|ios::app); srand(time(0)); account_number=rand()%1000; cout<<"This is your account number"<<account_number<<endl; cout<<"Enter your cnic :"; while(cin>>cnic ){ while(!bank_data.eof()){ bank_data>>account_number>>cnic_old>>first_name>>middle_name>>last_name>>month>>city>>mobile>>country; if(cnic==cnic_old) flag= true; if(flag==true) cout<<"what is this behaviour poja :"; } } //if (isNumber(cnic)&&cnic!=collect) // break; // else // cout<<"Enter again :"; // } cout<<"Enter birth month"<<endl <<"select month"<<endl <<"jan\nfeb\nmar\napril\nmay\njun\njuly\naugust\nsep\noct\nnov\ndec"<<endl <<"Enter your choice :"; while(cin>>month){ if(month=="jan"||month=="feb"||month=="mar"||month=="april"||month=="may"||month=="jun"||month=="july"||month=="july"||month=="aug"||month=="sep"||month=="oct"||month=="nov"||month=="dec") { break; } else cout<<"enter right choice"<<endl; } cout<<"Enter birth date"<<endl; while(cin>>date){ if(date=="1"||date=="2"||date=="3"||date=="4"||date=="5"||date=="6"||date=="7"||date=="8"||date=="9"||date=="10" ||date=="11"||date=="12"||date=="13"||date=="14"||date=="15"||date=="16"||date=="17"||date=="18"||date=="19"||date=="20" ||date=="21"||date=="22"||date=="23"||date=="24"||date=="25"||date=="26"||date=="27"||date=="28"||date=="29"||date=="30"||date=="31") { break; } else cout<<"enter right choice"<<endl; } cout<<"Enter birth year :"; while(cin>>year){ if(is_year(year)) break; else cout<<"Enter correct year :"; } cout<<"Enter your first name :"; cin.clear(); cin.ignore(); while(cin>>first_name){ if(is_alpha(first_name)) break; else cout<<"enter again :"; } cout<<"Do you have middle name [y/n] :"; char choice; cin>>choice; if(choice=='y'){ cin.ignore(256, '\n'); cout<<"Enter your middle name :"; while(cin>>middle_name){ if(is_alpha(middle_name)) break; else cout<<"Enter again :"; } } else cin.ignore(256, '\n'); cout<<"Enter your last name :"; while(cin>>last_name){ if(is_alpha(last_name)) break; else cout<<"Enter again :"; } cin.ignore(256, '\n'); cout<<"Enter your city name :"; while(cin>>city){ if(is_alpha(last_name)) break; else cout<<"Enter again :"; } cin.ignore(256, '\n'); cout<<"Enter your mobile number :"; while(cin>>mobile){ if(is_phone(mobile)) break; else cout<<"Enter again :"; } cin.ignore(256, '\n'); cout<<"Enter country name :"; while(cin>>country){ if(is_alpha(country)) break; else cout<<"Enter again :"; } cout<<"Account created sucessfully"<<endl; if(choice=='y') { bank_data<<account_number<<"\t"<<cnic<<"\t"<<first_name<<"\t"<<middle_name<<"\t"<<last_name<<"\t"<<month<<"\t"<<city<<"\t""0"<<mobile<<"\t"<<country<<endl; } else bank_data<<account_number<<"\t"<<cnic<<"\t"<<first_name<<"\t"<<"NULL"<<"\t"<<last_name<<"\t"<<month<<"\t"<<city<<"\t""0"<<mobile<<"\t"<<country<<endl; return 0; } /*this is the menu function it displays the menu for the bank management system to user to select any option*/ int menu() { int validity_count=0; string choice; int flag=0; while( true){ cout<<"CUSTOMER ACCOUNT BANKING MANAGEMENT SYSTEM "<<endl <<"||||||| WELCOME TO THE MAIN MENU|||||||"<<endl <<"1:Create new account"<<endl <<"2:view information of all the accounts"<<endl <<"3:Update Address and Phone number"<<endl <<"4:Depost or withdraw"<<endl <<"5:View detail of a particular customer"<<endl <<"6:Delete Account"<<endl <<"7:Exit"<<endl <<endl <<endl <<"Enter your choice: "<<endl; cin>>choice; if(choice=="1") { validity_count=0; create_new_account(); } else if(choice=="2") { validity_count=0; view_information(); } else if(choice=="3") { validity_count=0; change_details(); } else if(choice=="4") { validity_count=0; transactions(); } else if(choice=="5") { validity_count=0; view_customer_detail(); } else if(choice=="6") { validity_count=0; remove_account(); } else if(choice=="7") { exit(); return 0; } else if(choice.length()!=1) { validity_count++; cout<<"wrong choice"<<endl; } if(validity_count==3) { cout<<"Get out "<<endl; break; //return 0; } } } //this is the main function of the program int main() { menu(); //Don't forget to call me }

[ "ahmadbingulzar@gmail.com" ]

ahmadbingulzar@gmail.com

4e752dbb67427a0b5d1d9dec1df31174dc98bee2

8e397542b84257e91ef30ba43a417fcbf7edb5cc

/AlgorithmsInC++/DijkstrasSPTest.h

6b8db6815a5c26b023c85dbe822c833834b6e1ba

[]

no_license

JoseVillalta/Data-Structures-and-Algorithms-in-C-

3ed801f5628ebee58bbefba50a6583aa7afcfa56

9a1e4cda3da7f077eaca2391cc2d4418da1e243f

refs/heads/master

2020-05-22T04:14:18.746431

2018-02-22T15:26:27

48,241,381

0

null

UTF-8

C++

false

142

h

#pragma once #include "stdafx.h" #include "DijkstrasAlgorithm.h" class DijkstrasSPTests { public: void DoTests(); void testDSPT(); };

[ "jvillalta@impinj.com" ]

jvillalta@impinj.com

cd81e55ace58137dd700211761c9c49ff78405aa

c0b577f881c8f7a9bcea05aaad364a7e82bdec8a

/Source/ISS/Development/PawsSupport/Devices/Dmm/Cem/Dmm_T.h

ee159fbb721330864dade6e4f69dc53c99588841

[]

no_license

15831944/GPATS-Compare

7e6c8495bfb2bb6f5f651e9886a50cf23809399f

d467c68381d4011f7c699d07467cbccef6c8ed9a

refs/heads/main

2023-08-14T09:15:18.986272

2021-09-23T16:56:13

null

0

null

UTF-8

C++

false

2,325

h

//2345678901234567890123456789012345678901234567890123456789012345678901234567890 /////////////////////////////////////////////////////////////////////////// // File: Dmm_T.h // // Date: 12-May-04 // // Purpose: Instrument Driver for Dmm // // Instrument: Dmm <device description> (<device type>) // // // Revision History described in Dmm_T.cpp // // 1.0.1 08Apr09 Added variable m_StrobeToEvent // Changed prototype of InitPrivateDmm() to // InitPrivateDmm(intFnt); // /////////////////////////////////////////////////////////////////////////////// typedef struct ModStructStruct { bool Exists; int Int; int Dim; double Real; }ModStruct; #define CAL_DATA_COUNT 2 class CDmm_T { private: char m_DeviceName[MAX_BC_DEV_NAME]; char m_SignalDescription[1024]; int m_Bus; int m_PrimaryAdr; int m_SecondaryAdr; int m_Dbg; int m_Sim; int m_Handle; double m_CalData[CAL_DATA_COUNT]; // Modifiers ModStruct m_ACComp; ModStruct m_ACCompFreq; ModStruct m_AvCurrent; ModStruct m_AvVolt; ModStruct m_Bandwidth; ModStruct m_Current; ModStruct m_DCOffset; ModStruct m_Delay; ModStruct m_FourWire; ModStruct m_Freq; ModStruct m_MaxTime; ModStruct m_Period; ModStruct m_RefRes; ModStruct m_RefVolt; ModStruct m_Res; ModStruct m_SampleCount; ModStruct m_SampleWidth; ModStruct m_StrobeToEvent; // added ewl 20090408 ModStruct m_Volt; ModStruct m_Voltage; // added ewl 20110524 ModStruct m_VoltageP; // added ewl 20110524 ModStruct m_VoltagePP; // added ewl 20110524 ModStruct m_VoltRatio; ModStruct m_EventSampleCount; ModStruct m_EventDelay; bool m_SignalActive; // added ewl 20090408 bool TriggerFlag; bool m_AutoRange; public: CDmm_T(char *DeviceName, int Bus, int Prime, int Second, int Dbg, int Sim); ~CDmm_T(void); public: int StatusDmm(int); int SetupDmm(int); int InitiateDmm(int); int FetchDmm(int); int OpenDmm(int); int CloseDmm(int); int ResetDmm(int); private: int ErrorDmm(int Status, char *ErrMsg); int GetStmtInfoDmm(int Fnc); void InitPrivateDmm(int Fnc); // change to include Fnc ewl 20090408 void NullCalDataDmm(void); };

[ "josselyn.webb@gmail.com" ]

josselyn.webb@gmail.com

ac04b0a84103aa325458bae00dfb7c0f57509d76

91549d2b19466e9c394acdeb8dfbca48901520eb

/nested_loop.cpp

87b8a76a2a4a3e6e51d03e7b109b9e8db797af01

[]

no_license

aaqib-yfz/1st-Semester

b3331719f501cf5e8db7653a4f9324b9d7755cef

349b4df3a59110d36ef1c39d5f4cd536a7feedbf

refs/heads/master

2023-07-13T22:03:12.997786

2021-08-24T15:30:32

349,517,521

0

null

UTF-8

C++

false

172

cpp

#include <iostream> using namespace std; int main() { for (int i = 5; i >=1; i--) { for (int j = 1; j <= i; j++) cout <<"*"; cout << endl; } return 0; }

[ "aaqibshaheer2001@gmail.com" ]

aaqibshaheer2001@gmail.com

ca0a27c2fca8ce358de3d373c087b26c9fdfb5fb

6bd2c66b1c9bf984f2dfb866bb97ecf29d69ae0f

/src/uint256.h

9e921b73d69768c69bd19f33832ecf678602910d

[ "MIT" ]

permissive

futurecoin1/futurecoin1

efe8280d39b8df32a075623a7e70102a4aaf9c01

0a6f143b0b37bd5245ae5bab04baf7d61d1c7fb2

refs/heads/master

2020-07-15T12:34:24.799080

2017-04-17T10:13:48

65,669,859

0

null

UTF-8

C++

false

24,687

h

// Copyright (c) 2009-2010 Satoshi Nakamoto // Copyright (c) 2009-2012 The Bitcoin developers // Distributed under the MIT/X11 software license, see the accompanying // file COPYING or http://www.opensource.org/licenses/mit-license.php. #ifndef BITCOIN_UINT256_H #define BITCOIN_UINT256_H #include <string> #include <vector> #include <assert.h> #include <stdint.h> #include <stdio.h> #include <string.h> inline int Testuint256AdHoc(std::vector<std::string> vArg); /** Base class without constructors for uint256 and uint160. * This makes the compiler let u use it in a union. */ template <unsigned int BITS> class base_uint { protected: enum { WIDTH = BITS / 32 }; unsigned int pn[WIDTH]; public: bool operator!() const { for (int i = 0; i < WIDTH; i++) if (pn[i] != 0) return false; return true; } const base_uint operator~() const { base_uint ret; for (int i = 0; i < WIDTH; i++) ret.pn[i] = ~pn[i]; return ret; } const base_uint operator-() const { base_uint ret; for (int i = 0; i < WIDTH; i++) ret.pn[i] = ~pn[i]; ret++; return ret; } double getdouble() const { double ret = 0.0; double fact = 1.0; for (int i = 0; i < WIDTH; i++) { ret += fact * pn[i]; fact *= 4294967296.0; } return ret; } base_uint& operator=(uint64_t b) { pn[0] = (unsigned int)b; pn[1] = (unsigned int)(b >> 32); for (int i = 2; i < WIDTH; i++) pn[i] = 0; return *this; } base_uint& operator^=(const base_uint& b) { for (int i = 0; i < WIDTH; i++) pn[i] ^= b.pn[i]; return *this; } base_uint& operator&=(const base_uint& b) { for (int i = 0; i < WIDTH; i++) pn[i] &= b.pn[i]; return *this; } base_uint& operator|=(const base_uint& b) { for (int i = 0; i < WIDTH; i++) pn[i] |= b.pn[i]; return *this; } base_uint& operator^=(uint64_t b) { pn[0] ^= (unsigned int)b; pn[1] ^= (unsigned int)(b >> 32); return *this; } base_uint& operator|=(uint64_t b) { pn[0] |= (unsigned int)b; pn[1] |= (unsigned int)(b >> 32); return *this; } base_uint& operator<<=(unsigned int shift) { base_uint a(*this); for (int i = 0; i < WIDTH; i++) pn[i] = 0; int k = shift / 32; shift = shift % 32; for (int i = 0; i < WIDTH; i++) { if (i + k + 1 < WIDTH && shift != 0) pn[i + k + 1] |= (a.pn[i] >> (32 - shift)); if (i + k < WIDTH) pn[i + k] |= (a.pn[i] << shift); } return *this; } base_uint& operator>>=(unsigned int shift) { base_uint a(*this); for (int i = 0; i < WIDTH; i++) pn[i] = 0; int k = shift / 32; shift = shift % 32; for (int i = 0; i < WIDTH; i++) { if (i - k - 1 >= 0 && shift != 0) pn[i - k - 1] |= (a.pn[i] << (32 - shift)); if (i - k >= 0) pn[i - k] |= (a.pn[i] >> shift); } return *this; } base_uint& operator+=(const base_uint& b) { uint64_t carry = 0; for (int i = 0; i < WIDTH; i++) { uint64_t n = carry + pn[i] + b.pn[i]; pn[i] = n & 0xffffffff; carry = n >> 32; } return *this; } base_uint& operator-=(const base_uint& b) { *this += -b; return *this; } base_uint& operator+=(uint64_t b64) { base_uint b; b = b64; *this += b; return *this; } base_uint& operator-=(uint64_t b64) { base_uint b; b = b64; *this += -b; return *this; } base_uint& operator++() { // prefix operator int i = 0; while (++pn[i] == 0 && i < WIDTH - 1) i++; return *this; } const base_uint operator++(int) { // postfix operator const base_uint ret = *this; ++(*this); return ret; } base_uint& operator--() { // prefix operator int i = 0; while (--pn[i] == (uint32_t)-1 && i < WIDTH - 1) i++; return *this; } const base_uint operator--(int) { // postfix operator const base_uint ret = *this; --(*this); return ret; } friend inline bool operator<(const base_uint& a, const base_uint& b) { for (int i = base_uint::WIDTH - 1; i >= 0; i--) { if (a.pn[i] < b.pn[i]) return true; else if (a.pn[i] > b.pn[i]) return false; } return false; } friend inline bool operator<=(const base_uint& a, const base_uint& b) { for (int i = base_uint::WIDTH - 1; i >= 0; i--) { if (a.pn[i] < b.pn[i]) return true; else if (a.pn[i] > b.pn[i]) return false; } return true; } friend inline bool operator>(const base_uint& a, const base_uint& b) { for (int i = base_uint::WIDTH - 1; i >= 0; i--) { if (a.pn[i] > b.pn[i]) return true; else if (a.pn[i] < b.pn[i]) return false; } return false; } friend inline bool operator>=(const base_uint& a, const base_uint& b) { for (int i = base_uint::WIDTH - 1; i >= 0; i--) { if (a.pn[i] > b.pn[i]) return true; else if (a.pn[i] < b.pn[i]) return false; } return true; } friend inline bool operator==(const base_uint& a, const base_uint& b) { for (int i = 0; i < base_uint::WIDTH; i++) if (a.pn[i] != b.pn[i]) return false; return true; } friend inline bool operator==(const base_uint& a, uint64_t b) { if (a.pn[0] != (unsigned int)b) return false; if (a.pn[1] != (unsigned int)(b >> 32)) return false; for (int i = 2; i < base_uint::WIDTH; i++) if (a.pn[i] != 0) return false; return true; } friend inline bool operator!=(const base_uint& a, const base_uint& b) { return (!(a == b)); } friend inline bool operator!=(const base_uint& a, uint64_t b) { return (!(a == b)); } std::string GetHex() const { char psz[sizeof(pn) * 2 + 1]; for (unsigned int i = 0; i < sizeof(pn); i++) sprintf(psz + i * 2, "%02x", ((unsigned char*)pn)[sizeof(pn) - i - 1]); return std::string(psz, psz + sizeof(pn) * 2); } void SetHex(const char* psz) { for (int i = 0; i < WIDTH; i++) pn[i] = 0; // skip leading spaces while (isspace(*psz)) psz++; // skip 0x if (psz[0] == '0' && tolower(psz[1]) == 'x') psz += 2; // hex string to uint static const unsigned char phexdigit[256] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0, 0xa, 0xb, 0xc, 0xd, 0xe, 0xf, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0xa, 0xb, 0xc, 0xd, 0xe, 0xf, 0, 0, 0, 0, 0, 0, 0, 0, 0}; const char* pbegin = psz; while (phexdigit[(unsigned char)*psz] || *psz == '0') psz++; psz--; unsigned char* p1 = (unsigned char*)pn; unsigned char* pend = p1 + WIDTH * 4; while (psz >= pbegin && p1 < pend) { *p1 = phexdigit[(unsigned char)*psz--]; if (psz >= pbegin) { *p1 |= (phexdigit[(unsigned char)*psz--] << 4); p1++; } } } void SetHex(const std::string& str) { SetHex(str.c_str()); } std::string ToString() const { return (GetHex()); } unsigned char* begin() { return (unsigned char*)&pn[0]; } unsigned char* end() { return (unsigned char*)&pn[WIDTH]; } unsigned int size() { return sizeof(pn); } uint64_t GetLow64() const { assert(WIDTH >= 2); return pn[0] | (uint64_t)pn[1] << 32; } unsigned int GetSerializeSize(int nType, int nVersion) const { return sizeof(pn); } template <typename Stream> void Serialize(Stream& s, int nType, int nVersion) const { s.write((char*)pn, sizeof(pn)); } template <typename Stream> void Unserialize(Stream& s, int nType, int nVersion) { s.read((char*)pn, sizeof(pn)); } // Temporary for migration to opaque uint160/256 uint64_t GetCheapHash() const { return GetLow64(); } void SetNull() { memset(pn, 0, sizeof(pn)); } bool IsNull() const { for (int i = 0; i < WIDTH; i++) if (pn[i] != 0) return false; return true; } friend class uint160; friend class uint256; friend inline int Testuint256AdHoc(std::vector<std::string> vArg); }; typedef base_uint<160> base_uint160; typedef base_uint<256> base_uint256; // // uint160 and uint256 could be implemented as templates, but to keep // compile errors and debugging cleaner, they're copy and pasted. // ////////////////////////////////////////////////////////////////////////////// // // uint160 // /** 160-bit unsigned integer */ class uint160 : public base_uint160 { public: typedef base_uint160 basetype; uint160() { for (int i = 0; i < WIDTH; i++) pn[i] = 0; } uint160(const basetype& b) { for (int i = 0; i < WIDTH; i++) pn[i] = b.pn[i]; } uint160& operator=(const basetype& b) { for (int i = 0; i < WIDTH; i++) pn[i] = b.pn[i]; return *this; } uint160(uint64_t b) { pn[0] = (unsigned int)b; pn[1] = (unsigned int)(b >> 32); for (int i = 2; i < WIDTH; i++) pn[i] = 0; } uint160& operator=(uint64_t b) { pn[0] = (unsigned int)b; pn[1] = (unsigned int)(b >> 32); for (int i = 2; i < WIDTH; i++) pn[i] = 0; return *this; } explicit uint160(const std::string& str) { SetHex(str); } explicit uint160(const std::vector<unsigned char>& vch) { if (vch.size() == sizeof(pn)) memcpy(pn, &vch[0], sizeof(pn)); else *this = 0; } }; inline bool operator==(const uint160& a, uint64_t b) { return (base_uint160)a == b; } inline bool operator!=(const uint160& a, uint64_t b) { return (base_uint160)a != b; } inline const uint160 operator<<(const base_uint160& a, unsigned int shift) { return uint160(a) <<= shift; } inline const uint160 operator>>(const base_uint160& a, unsigned int shift) { return uint160(a) >>= shift; } inline const uint160 operator<<(const uint160& a, unsigned int shift) { return uint160(a) <<= shift; } inline const uint160 operator>>(const uint160& a, unsigned int shift) { return uint160(a) >>= shift; } inline const uint160 operator^(const base_uint160& a, const base_uint160& b) { return uint160(a) ^= b; } inline const uint160 operator&(const base_uint160& a, const base_uint160& b) { return uint160(a) &= b; } inline const uint160 operator|(const base_uint160& a, const base_uint160& b) { return uint160(a) |= b; } inline const uint160 operator+(const base_uint160& a, const base_uint160& b) { return uint160(a) += b; } inline const uint160 operator-(const base_uint160& a, const base_uint160& b) { return uint160(a) -= b; } inline bool operator<(const base_uint160& a, const uint160& b) { return (base_uint160)a < (base_uint160)b; } inline bool operator<=(const base_uint160& a, const uint160& b) { return (base_uint160)a <= (base_uint160)b; } inline bool operator>(const base_uint160& a, const uint160& b) { return (base_uint160)a > (base_uint160)b; } inline bool operator>=(const base_uint160& a, const uint160& b) { return (base_uint160)a >= (base_uint160)b; } inline bool operator==(const base_uint160& a, const uint160& b) { return (base_uint160)a == (base_uint160)b; } inline bool operator!=(const base_uint160& a, const uint160& b) { return (base_uint160)a != (base_uint160)b; } inline const uint160 operator^(const base_uint160& a, const uint160& b) { return (base_uint160)a ^ (base_uint160)b; } inline const uint160 operator&(const base_uint160& a, const uint160& b) { return (base_uint160)a & (base_uint160)b; } inline const uint160 operator|(const base_uint160& a, const uint160& b) { return (base_uint160)a | (base_uint160)b; } inline const uint160 operator+(const base_uint160& a, const uint160& b) { return (base_uint160)a + (base_uint160)b; } inline const uint160 operator-(const base_uint160& a, const uint160& b) { return (base_uint160)a - (base_uint160)b; } inline bool operator<(const uint160& a, const base_uint160& b) { return (base_uint160)a < (base_uint160)b; } inline bool operator<=(const uint160& a, const base_uint160& b) { return (base_uint160)a <= (base_uint160)b; } inline bool operator>(const uint160& a, const base_uint160& b) { return (base_uint160)a > (base_uint160)b; } inline bool operator>=(const uint160& a, const base_uint160& b) { return (base_uint160)a >= (base_uint160)b; } inline bool operator==(const uint160& a, const base_uint160& b) { return (base_uint160)a == (base_uint160)b; } inline bool operator!=(const uint160& a, const base_uint160& b) { return (base_uint160)a != (base_uint160)b; } inline const uint160 operator^(const uint160& a, const base_uint160& b) { return (base_uint160)a ^ (base_uint160)b; } inline const uint160 operator&(const uint160& a, const base_uint160& b) { return (base_uint160)a & (base_uint160)b; } inline const uint160 operator|(const uint160& a, const base_uint160& b) { return (base_uint160)a | (base_uint160)b; } inline const uint160 operator+(const uint160& a, const base_uint160& b) { return (base_uint160)a + (base_uint160)b; } inline const uint160 operator-(const uint160& a, const base_uint160& b) { return (base_uint160)a - (base_uint160)b; } inline bool operator<(const uint160& a, const uint160& b) { return (base_uint160)a < (base_uint160)b; } inline bool operator<=(const uint160& a, const uint160& b) { return (base_uint160)a <= (base_uint160)b; } inline bool operator>(const uint160& a, const uint160& b) { return (base_uint160)a > (base_uint160)b; } inline bool operator>=(const uint160& a, const uint160& b) { return (base_uint160)a >= (base_uint160)b; } inline bool operator==(const uint160& a, const uint160& b) { return (base_uint160)a == (base_uint160)b; } inline bool operator!=(const uint160& a, const uint160& b) { return (base_uint160)a != (base_uint160)b; } inline const uint160 operator^(const uint160& a, const uint160& b) { return (base_uint160)a ^ (base_uint160)b; } inline const uint160 operator&(const uint160& a, const uint160& b) { return (base_uint160)a & (base_uint160)b; } inline const uint160 operator|(const uint160& a, const uint160& b) { return (base_uint160)a | (base_uint160)b; } inline const uint160 operator+(const uint160& a, const uint160& b) { return (base_uint160)a + (base_uint160)b; } inline const uint160 operator-(const uint160& a, const uint160& b) { return (base_uint160)a - (base_uint160)b; } ////////////////////////////////////////////////////////////////////////////// // // uint256 // /** 256-bit unsigned integer */ class uint256 : public base_uint256 { public: typedef base_uint256 basetype; uint256() { for (int i = 0; i < WIDTH; i++) pn[i] = 0; } uint256(const basetype& b) { for (int i = 0; i < WIDTH; i++) pn[i] = b.pn[i]; } uint256& operator=(const basetype& b) { for (int i = 0; i < WIDTH; i++) pn[i] = b.pn[i]; return *this; } uint256(uint64_t b) { pn[0] = (unsigned int)b; pn[1] = (unsigned int)(b >> 32); for (int i = 2; i < WIDTH; i++) pn[i] = 0; } uint256& operator=(uint64_t b) { pn[0] = (unsigned int)b; pn[1] = (unsigned int)(b >> 32); for (int i = 2; i < WIDTH; i++) pn[i] = 0; return *this; } explicit uint256(const std::string& str) { SetHex(str); } explicit uint256(const std::vector<unsigned char>& vch) { if (vch.size() == sizeof(pn)) memcpy(pn, &vch[0], sizeof(pn)); else *this = 0; } explicit uint256(const uint8_t* in, size_t len) { if (len == sizeof(pn)) memcpy(pn, in, sizeof(pn)); else *this = 0; } }; inline bool operator==(const uint256& a, uint64_t b) { return (base_uint256)a == b; } inline bool operator!=(const uint256& a, uint64_t b) { return (base_uint256)a != b; } inline const uint256 operator<<(const base_uint256& a, unsigned int shift) { return uint256(a) <<= shift; } inline const uint256 operator>>(const base_uint256& a, unsigned int shift) { return uint256(a) >>= shift; } inline const uint256 operator<<(const uint256& a, unsigned int shift) { return uint256(a) <<= shift; } inline const uint256 operator>>(const uint256& a, unsigned int shift) { return uint256(a) >>= shift; } inline const uint256 operator^(const base_uint256& a, const base_uint256& b) { return uint256(a) ^= b; } inline const uint256 operator&(const base_uint256& a, const base_uint256& b) { return uint256(a) &= b; } inline const uint256 operator|(const base_uint256& a, const base_uint256& b) { return uint256(a) |= b; } inline const uint256 operator+(const base_uint256& a, const base_uint256& b) { return uint256(a) += b; } inline const uint256 operator-(const base_uint256& a, const base_uint256& b) { return uint256(a) -= b; } inline bool operator<(const base_uint256& a, const uint256& b) { return (base_uint256)a < (base_uint256)b; } inline bool operator<=(const base_uint256& a, const uint256& b) { return (base_uint256)a <= (base_uint256)b; } inline bool operator>(const base_uint256& a, const uint256& b) { return (base_uint256)a > (base_uint256)b; } inline bool operator>=(const base_uint256& a, const uint256& b) { return (base_uint256)a >= (base_uint256)b; } inline bool operator==(const base_uint256& a, const uint256& b) { return (base_uint256)a == (base_uint256)b; } inline bool operator!=(const base_uint256& a, const uint256& b) { return (base_uint256)a != (base_uint256)b; } inline const uint256 operator^(const base_uint256& a, const uint256& b) { return (base_uint256)a ^ (base_uint256)b; } inline const uint256 operator&(const base_uint256& a, const uint256& b) { return (base_uint256)a & (base_uint256)b; } inline const uint256 operator|(const base_uint256& a, const uint256& b) { return (base_uint256)a | (base_uint256)b; } inline const uint256 operator+(const base_uint256& a, const uint256& b) { return (base_uint256)a + (base_uint256)b; } inline const uint256 operator-(const base_uint256& a, const uint256& b) { return (base_uint256)a - (base_uint256)b; } inline bool operator<(const uint256& a, const base_uint256& b) { return (base_uint256)a < (base_uint256)b; } inline bool operator<=(const uint256& a, const base_uint256& b) { return (base_uint256)a <= (base_uint256)b; } inline bool operator>(const uint256& a, const base_uint256& b) { return (base_uint256)a > (base_uint256)b; } inline bool operator>=(const uint256& a, const base_uint256& b) { return (base_uint256)a >= (base_uint256)b; } inline bool operator==(const uint256& a, const base_uint256& b) { return (base_uint256)a == (base_uint256)b; } inline bool operator!=(const uint256& a, const base_uint256& b) { return (base_uint256)a != (base_uint256)b; } inline const uint256 operator^(const uint256& a, const base_uint256& b) { return (base_uint256)a ^ (base_uint256)b; } inline const uint256 operator&(const uint256& a, const base_uint256& b) { return (base_uint256)a & (base_uint256)b; } inline const uint256 operator|(const uint256& a, const base_uint256& b) { return (base_uint256)a | (base_uint256)b; } inline const uint256 operator+(const uint256& a, const base_uint256& b) { return (base_uint256)a + (base_uint256)b; } inline const uint256 operator-(const uint256& a, const base_uint256& b) { return (base_uint256)a - (base_uint256)b; } inline bool operator<(const uint256& a, const uint256& b) { return (base_uint256)a < (base_uint256)b; } inline bool operator<=(const uint256& a, const uint256& b) { return (base_uint256)a <= (base_uint256)b; } inline bool operator>(const uint256& a, const uint256& b) { return (base_uint256)a > (base_uint256)b; } inline bool operator>=(const uint256& a, const uint256& b) { return (base_uint256)a >= (base_uint256)b; } inline bool operator==(const uint256& a, const uint256& b) { return (base_uint256)a == (base_uint256)b; } inline bool operator!=(const uint256& a, const uint256& b) { return (base_uint256)a != (base_uint256)b; } inline const uint256 operator^(const uint256& a, const uint256& b) { return (base_uint256)a ^ (base_uint256)b; } inline const uint256 operator&(const uint256& a, const uint256& b) { return (base_uint256)a & (base_uint256)b; } inline const uint256 operator|(const uint256& a, const uint256& b) { return (base_uint256)a | (base_uint256)b; } inline const uint256 operator+(const uint256& a, const uint256& b) { return (base_uint256)a + (base_uint256)b; } inline const uint256 operator-(const uint256& a, const uint256& b) { return (base_uint256)a - (base_uint256)b; } #ifdef TEST_UINT256 inline int Testuint256AdHoc(std::vector<std::string> vArg) { uint256 g(0); LogPrintf("%s\n", g.ToString()); g--; LogPrintf("g--\n"); LogPrintf("%s\n", g.ToString()); g--; LogPrintf("g--\n"); LogPrintf("%s\n", g.ToString()); g++; LogPrintf("g++\n"); LogPrintf("%s\n", g.ToString()); g++; LogPrintf("g++\n"); LogPrintf("%s\n", g.ToString()); g++; LogPrintf("g++\n"); LogPrintf("%s\n", g.ToString()); g++; LogPrintf("g++\n"); LogPrintf("%s\n", g.ToString()); uint256 a(7); LogPrintf("a=7\n"); LogPrintf("%s\n", a.ToString()); uint256 b; LogPrintf("b undefined\n"); LogPrintf("%s\n", b.ToString()); int c = 3; a = c; a.pn[3] = 15; LogPrintf("%s\n", a.ToString()); uint256 k(c); a = 5; a.pn[3] = 15; LogPrintf("%s\n", a.ToString()); b = 1; b <<= 52; a |= b; a ^= 0x500; LogPrintf("a %s\n", a.ToString()); a = a | b | (uint256)0x1000; LogPrintf("a %s\n", a.ToString()); LogPrintf("b %s\n", b.ToString()); a = 0xfffffffe; a.pn[4] = 9; LogPrintf("%s\n", a.ToString()); a++; LogPrintf("%s\n", a.ToString()); a++; LogPrintf("%s\n", a.ToString()); a++; LogPrintf("%s\n", a.ToString()); a++; LogPrintf("%s\n", a.ToString()); a--; LogPrintf("%s\n", a.ToString()); a--; LogPrintf("%s\n", a.ToString()); a--; LogPrintf("%s\n", a.ToString()); uint256 d = a--; LogPrintf("%s\n", d.ToString()); LogPrintf("%s\n", a.ToString()); a--; LogPrintf("%s\n", a.ToString()); a--; LogPrintf("%s\n", a.ToString()); d = a; LogPrintf("%s\n", d.ToString()); for (int i = uint256::WIDTH - 1; i >= 0; i--) LogPrintf("%08x", d.pn[i]); LogPrintf("\n"); uint256 neg = d; neg = ~neg; LogPrintf("%s\n", neg.ToString()); uint256 e = uint256("0xABCDEF123abcdef12345678909832180000011111111"); LogPrintf("\n"); LogPrintf("%s\n", e.ToString()); LogPrintf("\n"); uint256 x1 = uint256("0xABCDEF123abcdef12345678909832180000011111111"); uint256 x2; LogPrintf("%s\n", x1.ToString()); for (int i = 0; i < 270; i += 4) { x2 = x1 << i; LogPrintf("%s\n", x2.ToString()); } LogPrintf("\n"); LogPrintf("%s\n", x1.ToString()); for (int i = 0; i < 270; i += 4) { x2 = x1; x2 >>= i; LogPrintf("%s\n", x2.ToString()); } for (int i = 0; i < 100; i++) { uint256 k = (~uint256(0) >> i); LogPrintf("%s\n", k.ToString()); } for (int i = 0; i < 100; i++) { uint256 k = (~uint256(0) << i); LogPrintf("%s\n", k.ToString()); } return (0); } #endif // Temporary for migration to opaque uint160/256 inline uint256 uint256S(const std::string& x) { return uint256(x); } #endif // BITCOIN_UINT256_H

[ "futuredev@protonmail.com" ]

futuredev@protonmail.com

4c7cbdb527787703c590fef0a8e56b6cbca0d4f5

32b6a5c5c827151cb32303c201f49a5304d81cf5

/src/mastering_ros_demo_pkg/src/demo_action_server.cpp

cd3af1d4825e8cae53342febfd3fe15b2992888b

[]

no_license

Russ76/catkin_ws

1a5d08b4081598bcf0d5f6edf78bb8a2401b5f76

1d69b3d46b9ed3dfa2d383a45a87fd3aeb866799

refs/heads/master

2023-03-17T18:01:29.686490

2017-11-06T08:12:40

null

0

null

UTF-8

C++

false

2,215

cpp

#include "ros/ros.h" #include "std_msgs/Int32.h" #include <actionlib/server/simple_action_server.h> #include "mastering_ros_demo_pkg/Demo_actionAction.h" #include <iostream> #include <sstream> class Demo_actionAction { protected: ros::NodeHandle nh_; // NodeHandle instance must be created before this line. Otherwise strange error may occur. actionlib::SimpleActionServer<mastering_ros_demo_pkg::Demo_actionAction> as; // create messages that are used to published feedback/result mastering_ros_demo_pkg::Demo_actionFeedback feedback; mastering_ros_demo_pkg::Demo_actionResult result; std::string action_name; int goal; int progress; public: Demo_actionAction(std::string name) : as(nh_, name, boost::bind(&Demo_actionAction::executeCB, this, _1), false), action_name(name) { as.registerPreemptCallback(boost::bind(&Demo_actionAction::preemptCB, this)); as.start(); } ~Demo_actionAction(void) { } void preemptCB(){ ROS_WARN("%s got preempted!", action_name.c_str()); result.final_count = progress; as.setPreempted(result,"I got Preempted"); } void executeCB(const mastering_ros_demo_pkg::Demo_actionGoalConstPtr &goal) { if(!as.isActive() || as.isPreemptRequested()) return; ros::Rate rate(5); ROS_INFO("%s is processing the goal %d", action_name.c_str(), goal->count); for(progress = 1 ; progress <= goal->count; progress++){ //Check for ros if(!ros::ok()){ result.final_count = progress; as.setAborted(result,"I failed !"); ROS_INFO("%s Shutting down",action_name.c_str()); break; } if(!as.isActive() || as.isPreemptRequested()){ return; } if(goal->count <= progress){ ROS_INFO("%s Succeeded at getting to goal %d", action_name.c_str(), goal->count); result.final_count = progress; as.setSucceeded(result); }else{ ROS_INFO("Setting to goal %d / %d",feedback.current_number,goal->count); feedback.current_number = progress; as.publishFeedback(feedback); } rate.sleep(); } } }; int main(int argc, char** argv) { ros::init(argc, argv, "demo_action"); ROS_INFO("Starting Demo Action Server"); Demo_actionAction demo_action_obj(ros::this_node::getName()); ros::spin(); return 0; }

[ "gauss.seidel.fr@gmail.com" ]

gauss.seidel.fr@gmail.com

c850b4840c700edd9e4f31696bf8d36d869ce989

2045263497b0b0b0e272eea4ad4510b9c83f7b6b

/Minigin/BorderBlock.cpp

1f12b7ca5f0a1c8b6531be7fa8b508377ec96179

[]

no_license

Myvampire99/Minigin

82f6faaa13114ab92fab71c407a91df9b0dabe92

d3633b55e29465e05e4772b54c4bcf736ad79306

refs/heads/master

2022-02-27T11:45:17.089938

2019-10-08T14:09:49

188,622,379

0

null

UTF-8

C++

false

496

cpp

#include "MiniginPCH.h" #include "BorderBlock.h" BorderBlock::BorderBlock(CollisionBox* coll) :LevelObject("Resources/Textures/point.jpg") , m_Coll{ coll } { dae::Singleton<CollisionManager>::GetInstance().AddCollision( m_Coll ); } BorderBlock::~BorderBlock() { dae::Singleton<CollisionManager>::GetInstance().Remove(m_Coll); } void BorderBlock::Update(float elapsedTime) { UNREFERENCED_PARAMETER(elapsedTime); m_Coll->SetPosition(this->GetPos()); } void BorderBlock::Initialize() {}

[ "47989066+Myvampire99@users.noreply.github.com" ]

47989066+Myvampire99@users.noreply.github.com

3657e5e9aaec66e2893b39df3d0f25025713eaa3

e46a7d93c35badc46b9471c06311952c2d411ff5

/Algorithm/Implementation/kangaroo.cpp

5a86916a66ca1a825546c4fc4be5db25b32a936b

[]

no_license

Bhavyaratra/Hackerrank-practice

82ddbd78929f9fa46b44a992c91e9989849028af

2d54a6e5e6d743425a9cccfd113cf3b12a3833e0

refs/heads/master

2023-06-09T23:57:17.808408

2021-06-27T12:04:18

296,431,145

0

null

UTF-8

C++

false

479

cpp

#include <iostream> #include<vector> using namespace std; int main () { int x1,v1,x2,v2; cin>>x1>>v1>>x2>>v2; int p1=x1,p2=x2; if (x1==x2) { cout<<"YES"; return 0; } if ((x1>x2 && v1>v2) || (x2>x1 && v2>v1) ) { cout<<"NO"; return 0; } while(p1<p2) { p1=p1+v1; p2=p2+v2; if(p1==p2) { cout<<"YES"; return 0; } } cout<<"NO"; }

[ "bhavya.r1220@gmail.com" ]

bhavya.r1220@gmail.com

a7bb47b060e99e7ab2b3ff0b0d4f36085e1496f8

f23bf2d9dfa65281dafa74cd22de796c03d575f2

/atcoder/APG4b/complete_time.cpp

6795ce68f9735df5af04d8014e8a5774312c6ef0

[]

no_license

trmr/code

81181c1a5fde757f081ecc377765c81e48d547bd

201a761063cd79a5887733964c015f60cd971601

refs/heads/master

2023-03-23T11:27:48.105310

2021-03-09T01:33:08

237,609,489

0

null

UTF-8

C++

false

1,235

cpp

#include <bits/stdc++.h> using namespace std; // x番の組織について、子組織からの報告書が揃った時刻を返す // childrenは組織の関係を表す2次元配列(参照渡し) int complete_time(vector<vector<int>> &children, int x) { // (ここに追記して再帰関数を実装する) if (children.at(x).size() == 0) return 0; int s = 0; for (auto &i:children.at(x)) { s = max(s, complete_time(children, i)); } return s + 1; } // これ以降の行は変更しなくてよい int main() { int N; cin >> N; vector<int> p(N); // 各組織の親組織を示す配列 p.at(0) = -1; // 0番組織の親組織は存在しないので-1を入れておく for (int i = 1; i < N; i++) { cin >> p.at(i); } // 組織の関係から2次元配列を作る(理解しなくてもよい) vector<vector<int>> children(N); // ある組織の子組織の番号一覧 // N×0の二次元配列 for (int i = 1; i < N; i++) { int parent = p.at(i); // i番の親組織の番号 children.at(parent).push_back(i); // parentの子組織一覧にi番を追加 } // 0番の組織の元に報告書が揃う時刻を求める cout << complete_time(children, 0) << endl; }

[ "trmr@TRMR-MB.local" ]

trmr@TRMR-MB.local

c9eefa264a09dde9af6c81cfdb1bfbffea1f35db

4652840c8fa0d701aaca8de426bf64c340a5e831

/third_party/WebKit/Source/core/paint/PaintLayerPainterTest.cpp

258637a394741ab3fd92de03f51dffd9c7259111

[ "LGPL-2.0-or-later", "GPL-1.0-or-later", "MIT", "Apache-2.0", "LicenseRef-scancode-warranty-disclaimer", "LGPL-2.1-only", "GPL-2.0-only", "LGPL-2.0-only", "BSD-2-Clause", "LicenseRef-scancode-other-copyleft", "BSD-3-Clause" ]

permissive

remzert/BraveBrowser

de5ab71293832a5396fa3e35690ebd37e8bb3113

aef440e3d759cb825815ae12bd42f33d71227865

refs/heads/master

2022-11-07T03:06:32.579337

2017-02-28T23:02:29

84,563,445

1

5

BSD-3-Clause

2022-10-26T06:28:58

2017-03-10T13:38:48

null

UTF-8

C++

false

47,628

cpp

// Copyright 2015 The Chromium Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #include "core/layout/LayoutBoxModelObject.h" #include "core/layout/compositing/CompositedLayerMapping.h" #include "core/paint/PaintControllerPaintTest.h" #include "platform/graphics/GraphicsContext.h" #include "platform/testing/RuntimeEnabledFeaturesTestHelpers.h" namespace blink { struct PaintLayerPainterTestParam { PaintLayerPainterTestParam(bool rootLayerScrolling, bool slimmingPaintV2) : rootLayerScrolling(rootLayerScrolling), slimmingPaintV2(slimmingPaintV2) {} bool rootLayerScrolling; bool slimmingPaintV2; }; class PaintLayerPainterTest : public testing::WithParamInterface<PaintLayerPainterTestParam>, private ScopedRootLayerScrollingForTest, public PaintControllerPaintTestBase { USING_FAST_MALLOC(PaintLayerPainterTest); public: PaintLayerPainterTest() : ScopedRootLayerScrollingForTest(GetParam().rootLayerScrolling), PaintControllerPaintTestBase(GetParam().slimmingPaintV2) {} }; INSTANTIATE_TEST_CASE_P( All, PaintLayerPainterTest, ::testing::Values(PaintLayerPainterTestParam( false, false), // non-root-layer-scrolls, slimming-paint-v1 PaintLayerPainterTestParam( false, true), // non-root-layer-scrolls, slimming-paint-v2 PaintLayerPainterTestParam( true, false), // root-layer-scrolls, slimming-paint-v1 PaintLayerPainterTestParam( true, true))); // root-layer-scrolls, slimming-paint-v2 TEST_P(PaintLayerPainterTest, CachedSubsequence) { setBodyInnerHTML( "<div id='container1' style='position: relative; z-index: 1; width: " "200px; height: 200px; background-color: blue'>" " <div id='content1' style='position: absolute; width: 100px; height: " "100px; background-color: red'></div>" "</div>" "<div id='container2' style='position: relative; z-index: 1; width: " "200px; height: 200px; background-color: blue'>" " <div id='content2' style='position: absolute; width: 100px; height: " "100px; background-color: green'></div>" "</div>"); document().view()->updateAllLifecyclePhases(); PaintLayer& htmlLayer = *toLayoutBoxModelObject(document().documentElement()->layoutObject()) ->layer(); LayoutObject& container1 = *document().getElementById("container1")->layoutObject(); PaintLayer& container1Layer = *toLayoutBoxModelObject(container1).layer(); LayoutObject& content1 = *document().getElementById("content1")->layoutObject(); LayoutObject& container2 = *document().getElementById("container2")->layoutObject(); PaintLayer& container2Layer = *toLayoutBoxModelObject(container2).layer(); LayoutObject& content2 = *document().getElementById("content2")->layoutObject(); if (RuntimeEnabledFeatures::slimmingPaintV2Enabled()) { if (RuntimeEnabledFeatures::rootLayerScrollingEnabled()) { EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 13, TestDisplayItem(*layoutView().layer(), DisplayItem::kSubsequence), TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(container1Layer, DisplayItem::kSubsequence), TestDisplayItem(container1, backgroundType), TestDisplayItem(content1, backgroundType), TestDisplayItem(container1Layer, DisplayItem::kEndSubsequence), TestDisplayItem(container2Layer, DisplayItem::kSubsequence), TestDisplayItem(container2, backgroundType), TestDisplayItem(content2, backgroundType), TestDisplayItem(container2Layer, DisplayItem::kEndSubsequence), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence), TestDisplayItem(*layoutView().layer(), DisplayItem::kEndSubsequence)); } else { EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 15, TestDisplayItem(layoutView(), DisplayItem::kClipFrameToVisibleContentRect), TestDisplayItem(*layoutView().layer(), DisplayItem::kSubsequence), TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(container1Layer, DisplayItem::kSubsequence), TestDisplayItem(container1, backgroundType), TestDisplayItem(content1, backgroundType), TestDisplayItem(container1Layer, DisplayItem::kEndSubsequence), TestDisplayItem(container2Layer, DisplayItem::kSubsequence), TestDisplayItem(container2, backgroundType), TestDisplayItem(content2, backgroundType), TestDisplayItem(container2Layer, DisplayItem::kEndSubsequence), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence), TestDisplayItem(*layoutView().layer(), DisplayItem::kEndSubsequence), TestDisplayItem(layoutView(), DisplayItem::clipTypeToEndClipType( DisplayItem::kClipFrameToVisibleContentRect))); } } else { EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 11, TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(container1Layer, DisplayItem::kSubsequence), TestDisplayItem(container1, backgroundType), TestDisplayItem(content1, backgroundType), TestDisplayItem(container1Layer, DisplayItem::kEndSubsequence), TestDisplayItem(container2Layer, DisplayItem::kSubsequence), TestDisplayItem(container2, backgroundType), TestDisplayItem(content2, backgroundType), TestDisplayItem(container2Layer, DisplayItem::kEndSubsequence), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence)); } toHTMLElement(content1.node()) ->setAttribute(HTMLNames::styleAttr, "position: absolute; width: 100px; height: 100px; " "background-color: green"); document().view()->updateAllLifecyclePhasesExceptPaint(); EXPECT_TRUE(paintWithoutCommit()); EXPECT_EQ(6, numCachedNewItems()); commit(); if (RuntimeEnabledFeatures::slimmingPaintV2Enabled()) { if (RuntimeEnabledFeatures::rootLayerScrollingEnabled()) { EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 13, TestDisplayItem(*layoutView().layer(), DisplayItem::kSubsequence), TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(container1Layer, DisplayItem::kSubsequence), TestDisplayItem(container1, backgroundType), TestDisplayItem(content1, backgroundType), TestDisplayItem(container1Layer, DisplayItem::kEndSubsequence), TestDisplayItem(container2Layer, DisplayItem::kSubsequence), TestDisplayItem(container2, backgroundType), TestDisplayItem(content2, backgroundType), TestDisplayItem(container2Layer, DisplayItem::kEndSubsequence), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence), TestDisplayItem(*layoutView().layer(), DisplayItem::kEndSubsequence)); } else { EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 15, TestDisplayItem(layoutView(), DisplayItem::kClipFrameToVisibleContentRect), TestDisplayItem(*layoutView().layer(), DisplayItem::kSubsequence), TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(container1Layer, DisplayItem::kSubsequence), TestDisplayItem(container1, backgroundType), TestDisplayItem(content1, backgroundType), TestDisplayItem(container1Layer, DisplayItem::kEndSubsequence), TestDisplayItem(container2Layer, DisplayItem::kSubsequence), TestDisplayItem(container2, backgroundType), TestDisplayItem(content2, backgroundType), TestDisplayItem(container2Layer, DisplayItem::kEndSubsequence), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence), TestDisplayItem(*layoutView().layer(), DisplayItem::kEndSubsequence), TestDisplayItem(layoutView(), DisplayItem::clipTypeToEndClipType( DisplayItem::kClipFrameToVisibleContentRect))); } } else { EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 11, TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(container1Layer, DisplayItem::kSubsequence), TestDisplayItem(container1, backgroundType), TestDisplayItem(content1, backgroundType), TestDisplayItem(container1Layer, DisplayItem::kEndSubsequence), TestDisplayItem(container2Layer, DisplayItem::kSubsequence), TestDisplayItem(container2, backgroundType), TestDisplayItem(content2, backgroundType), TestDisplayItem(container2Layer, DisplayItem::kEndSubsequence), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence)); } } TEST_P(PaintLayerPainterTest, CachedSubsequenceForSVGRoot) { setBodyInnerHTML( "<svg id='svg' style='position: relative'>" " <rect id='rect' x='10' y='10' width='100' height='100' rx='15' " "ry='15'/>" "</svg>" "<div id='div' style='position: relative; width: 50x; height: " "50px'></div>"); document().view()->updateAllLifecyclePhases(); PaintLayer& htmlLayer = *toLayoutBoxModelObject(document().documentElement()->layoutObject()) ->layer(); LayoutObject& svg = *document().getElementById("svg")->layoutObject(); PaintLayer& svgLayer = *toLayoutBoxModelObject(svg).layer(); LayoutObject& rect = *document().getElementById("rect")->layoutObject(); LayoutObject& div = *document().getElementById("div")->layoutObject(); DisplayItem::Type clipBoxBegin = DisplayItem::paintPhaseToClipBoxType(PaintPhaseForeground); DisplayItem::Type clipBoxEnd = DisplayItem::clipTypeToEndClipType(clipBoxBegin); if (RuntimeEnabledFeatures::slimmingPaintV2Enabled()) { if (RuntimeEnabledFeatures::rootLayerScrollingEnabled()) { // SPv2 slips the clip box (see BoxClipper). EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 10, TestDisplayItem(*layoutView().layer(), DisplayItem::kSubsequence), TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(svgLayer, DisplayItem::kSubsequence), TestDisplayItem(svg, DisplayItem::kBeginTransform), TestDisplayItem(rect, foregroundType), TestDisplayItem(svg, DisplayItem::kEndTransform), TestDisplayItem(svgLayer, DisplayItem::kEndSubsequence), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence), TestDisplayItem(*layoutView().layer(), DisplayItem::kEndSubsequence)); } else { // SPv2 slips the clip box (see BoxClipper). EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 12, TestDisplayItem(layoutView(), DisplayItem::kClipFrameToVisibleContentRect), TestDisplayItem(*layoutView().layer(), DisplayItem::kSubsequence), TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(svgLayer, DisplayItem::kSubsequence), TestDisplayItem(svg, DisplayItem::kBeginTransform), TestDisplayItem(rect, foregroundType), TestDisplayItem(svg, DisplayItem::kEndTransform), TestDisplayItem(svgLayer, DisplayItem::kEndSubsequence), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence), TestDisplayItem(*layoutView().layer(), DisplayItem::kEndSubsequence), TestDisplayItem(layoutView(), DisplayItem::clipTypeToEndClipType( DisplayItem::kClipFrameToVisibleContentRect))); } } else { EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 10, TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(svgLayer, DisplayItem::kSubsequence), TestDisplayItem(svg, clipBoxBegin), TestDisplayItem(svg, DisplayItem::kBeginTransform), TestDisplayItem(rect, foregroundType), TestDisplayItem(svg, DisplayItem::kEndTransform), TestDisplayItem(svg, clipBoxEnd), TestDisplayItem(svgLayer, DisplayItem::kEndSubsequence), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence)); } // Change the color of the div. This should not invalidate the subsequence // for the SVG root. toHTMLElement(div.node()) ->setAttribute(HTMLNames::styleAttr, "position: relative; width: 50x; height: 50px; " "background-color: green"); document().view()->updateAllLifecyclePhasesExceptPaint(); EXPECT_TRUE(paintWithoutCommit()); // Reuse of SVG and document background. 2 fewer with SPv2 enabled because // clip display items don't appear in SPv2 display lists. if (RuntimeEnabledFeatures::slimmingPaintV2Enabled()) EXPECT_EQ(6, numCachedNewItems()); else EXPECT_EQ(8, numCachedNewItems()); commit(); if (RuntimeEnabledFeatures::slimmingPaintV2Enabled()) { if (RuntimeEnabledFeatures::rootLayerScrollingEnabled()) { EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 11, TestDisplayItem(*layoutView().layer(), DisplayItem::kSubsequence), TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(svgLayer, DisplayItem::kSubsequence), TestDisplayItem(svg, DisplayItem::kBeginTransform), TestDisplayItem(rect, foregroundType), TestDisplayItem(svg, DisplayItem::kEndTransform), TestDisplayItem(svgLayer, DisplayItem::kEndSubsequence), TestDisplayItem(div, backgroundType), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence), TestDisplayItem(*layoutView().layer(), DisplayItem::kEndSubsequence)); } else { EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 13, TestDisplayItem(layoutView(), DisplayItem::kClipFrameToVisibleContentRect), TestDisplayItem(*layoutView().layer(), DisplayItem::kSubsequence), TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(svgLayer, DisplayItem::kSubsequence), TestDisplayItem(svg, DisplayItem::kBeginTransform), TestDisplayItem(rect, foregroundType), TestDisplayItem(svg, DisplayItem::kEndTransform), TestDisplayItem(svgLayer, DisplayItem::kEndSubsequence), TestDisplayItem(div, backgroundType), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence), TestDisplayItem(*layoutView().layer(), DisplayItem::kEndSubsequence), TestDisplayItem(layoutView(), DisplayItem::clipTypeToEndClipType( DisplayItem::kClipFrameToVisibleContentRect))); } } else { EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 11, TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(svgLayer, DisplayItem::kSubsequence), TestDisplayItem(svg, clipBoxBegin), TestDisplayItem(svg, DisplayItem::kBeginTransform), TestDisplayItem(rect, foregroundType), TestDisplayItem(svg, DisplayItem::kEndTransform), TestDisplayItem(svg, clipBoxEnd), TestDisplayItem(svgLayer, DisplayItem::kEndSubsequence), TestDisplayItem(div, backgroundType), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence), TestDisplayItem(layoutView(), DisplayItem::clipTypeToEndClipType( DisplayItem::kClipFrameToVisibleContentRect))); } } TEST_P(PaintLayerPainterTest, CachedSubsequenceOnInterestRectChange) { // TODO(wangxianzhu): SPv2 deals with interest rect differently, so disable // this test for SPv2 temporarily. if (RuntimeEnabledFeatures::slimmingPaintV2Enabled()) return; setBodyInnerHTML( "<div id='container1' style='position: relative; z-index: 1; width: " "200px; height: 200px; background-color: blue'>" " <div id='content1' style='position: absolute; width: 100px; height: " "100px; background-color: green'></div>" "</div>" "<div id='container2' style='position: relative; z-index: 1; width: " "200px; height: 200px; background-color: blue'>" " <div id='content2a' style='position: absolute; width: 100px; height: " "100px; background-color: green'></div>" " <div id='content2b' style='position: absolute; top: 200px; width: " "100px; height: 100px; background-color: green'></div>" "</div>" "<div id='container3' style='position: absolute; z-index: 2; left: " "300px; top: 0; width: 200px; height: 200px; background-color: blue'>" " <div id='content3' style='position: absolute; width: 200px; height: " "200px; background-color: green'></div>" "</div>"); rootPaintController().invalidateAll(); PaintLayer& htmlLayer = *toLayoutBoxModelObject(document().documentElement()->layoutObject()) ->layer(); LayoutObject& container1 = *document().getElementById("container1")->layoutObject(); PaintLayer& container1Layer = *toLayoutBoxModelObject(container1).layer(); LayoutObject& content1 = *document().getElementById("content1")->layoutObject(); LayoutObject& container2 = *document().getElementById("container2")->layoutObject(); PaintLayer& container2Layer = *toLayoutBoxModelObject(container2).layer(); LayoutObject& content2a = *document().getElementById("content2a")->layoutObject(); LayoutObject& content2b = *document().getElementById("content2b")->layoutObject(); LayoutObject& container3 = *document().getElementById("container3")->layoutObject(); PaintLayer& container3Layer = *toLayoutBoxModelObject(container3).layer(); LayoutObject& content3 = *document().getElementById("content3")->layoutObject(); document().view()->updateAllLifecyclePhasesExceptPaint(); IntRect interestRect(0, 0, 400, 300); paint(&interestRect); // Container1 is fully in the interest rect; // Container2 is partly (including its stacking chidren) in the interest rect; // Content2b is out of the interest rect and output nothing; // Container3 is partly in the interest rect. EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 15, TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(container1Layer, DisplayItem::kSubsequence), TestDisplayItem(container1, backgroundType), TestDisplayItem(content1, backgroundType), TestDisplayItem(container1Layer, DisplayItem::kEndSubsequence), TestDisplayItem(container2Layer, DisplayItem::kSubsequence), TestDisplayItem(container2, backgroundType), TestDisplayItem(content2a, backgroundType), TestDisplayItem(container2Layer, DisplayItem::kEndSubsequence), TestDisplayItem(container3Layer, DisplayItem::kSubsequence), TestDisplayItem(container3, backgroundType), TestDisplayItem(content3, backgroundType), TestDisplayItem(container3Layer, DisplayItem::kEndSubsequence), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence)); document().view()->updateAllLifecyclePhasesExceptPaint(); IntRect newInterestRect(0, 100, 300, 1000); EXPECT_TRUE(paintWithoutCommit(&newInterestRect)); // Container1 becomes partly in the interest rect, but uses cached subsequence // because it was fully painted before; // Container2's intersection with the interest rect changes; // Content2b is out of the interest rect and outputs nothing; // Container3 becomes out of the interest rect and outputs empty subsequence // pair. EXPECT_EQ(7, numCachedNewItems()); commit(); EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 14, TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(container1Layer, DisplayItem::kSubsequence), TestDisplayItem(container1, backgroundType), TestDisplayItem(content1, backgroundType), TestDisplayItem(container1Layer, DisplayItem::kEndSubsequence), TestDisplayItem(container2Layer, DisplayItem::kSubsequence), TestDisplayItem(container2, backgroundType), TestDisplayItem(content2a, backgroundType), TestDisplayItem(content2b, backgroundType), TestDisplayItem(container2Layer, DisplayItem::kEndSubsequence), TestDisplayItem(container3Layer, DisplayItem::kSubsequence), TestDisplayItem(container3Layer, DisplayItem::kEndSubsequence), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence)); } TEST_P(PaintLayerPainterTest, CachedSubsequenceOnStyleChangeWithInterestRectClipping) { setBodyInnerHTML( "<div id='container1' style='position: relative; z-index: 1; width: " "200px; height: 200px; background-color: blue'>" " <div id='content1' style='position: absolute; width: 100px; height: " "100px; background-color: red'></div>" "</div>" "<div id='container2' style='position: relative; z-index: 1; width: " "200px; height: 200px; background-color: blue'>" " <div id='content2' style='position: absolute; width: 100px; height: " "100px; background-color: green'></div>" "</div>"); document().view()->updateAllLifecyclePhasesExceptPaint(); // PaintResult of all subsequences will be MayBeClippedByPaintDirtyRect. IntRect interestRect(0, 0, 50, 300); paint(&interestRect); PaintLayer& htmlLayer = *toLayoutBoxModelObject(document().documentElement()->layoutObject()) ->layer(); LayoutObject& container1 = *document().getElementById("container1")->layoutObject(); PaintLayer& container1Layer = *toLayoutBoxModelObject(container1).layer(); LayoutObject& content1 = *document().getElementById("content1")->layoutObject(); LayoutObject& container2 = *document().getElementById("container2")->layoutObject(); PaintLayer& container2Layer = *toLayoutBoxModelObject(container2).layer(); LayoutObject& content2 = *document().getElementById("content2")->layoutObject(); if (RuntimeEnabledFeatures::slimmingPaintV2Enabled()) { if (RuntimeEnabledFeatures::rootLayerScrollingEnabled()) { EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 13, TestDisplayItem(*layoutView().layer(), DisplayItem::kSubsequence), TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(container1Layer, DisplayItem::kSubsequence), TestDisplayItem(container1, backgroundType), TestDisplayItem(content1, backgroundType), TestDisplayItem(container1Layer, DisplayItem::kEndSubsequence), TestDisplayItem(container2Layer, DisplayItem::kSubsequence), TestDisplayItem(container2, backgroundType), TestDisplayItem(content2, backgroundType), TestDisplayItem(container2Layer, DisplayItem::kEndSubsequence), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence), TestDisplayItem(*layoutView().layer(), DisplayItem::kEndSubsequence)); } else { EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 15, TestDisplayItem(layoutView(), DisplayItem::kClipFrameToVisibleContentRect), TestDisplayItem(*layoutView().layer(), DisplayItem::kSubsequence), TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(container1Layer, DisplayItem::kSubsequence), TestDisplayItem(container1, backgroundType), TestDisplayItem(content1, backgroundType), TestDisplayItem(container1Layer, DisplayItem::kEndSubsequence), TestDisplayItem(container2Layer, DisplayItem::kSubsequence), TestDisplayItem(container2, backgroundType), TestDisplayItem(content2, backgroundType), TestDisplayItem(container2Layer, DisplayItem::kEndSubsequence), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence), TestDisplayItem(*layoutView().layer(), DisplayItem::kEndSubsequence), TestDisplayItem(layoutView(), DisplayItem::clipTypeToEndClipType( DisplayItem::kClipFrameToVisibleContentRect))); } } else { EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 11, TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(container1Layer, DisplayItem::kSubsequence), TestDisplayItem(container1, backgroundType), TestDisplayItem(content1, backgroundType), TestDisplayItem(container1Layer, DisplayItem::kEndSubsequence), TestDisplayItem(container2Layer, DisplayItem::kSubsequence), TestDisplayItem(container2, backgroundType), TestDisplayItem(content2, backgroundType), TestDisplayItem(container2Layer, DisplayItem::kEndSubsequence), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence)); } toHTMLElement(content1.node()) ->setAttribute(HTMLNames::styleAttr, "position: absolute; width: 100px; height: 100px; " "background-color: green"); document().view()->updateAllLifecyclePhasesExceptPaint(); EXPECT_TRUE(paintWithoutCommit(&interestRect)); EXPECT_EQ(6, numCachedNewItems()); commit(); if (RuntimeEnabledFeatures::slimmingPaintV2Enabled()) { if (RuntimeEnabledFeatures::rootLayerScrollingEnabled()) { EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 13, TestDisplayItem(*layoutView().layer(), DisplayItem::kSubsequence), TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(container1Layer, DisplayItem::kSubsequence), TestDisplayItem(container1, backgroundType), TestDisplayItem(content1, backgroundType), TestDisplayItem(container1Layer, DisplayItem::kEndSubsequence), TestDisplayItem(container2Layer, DisplayItem::kSubsequence), TestDisplayItem(container2, backgroundType), TestDisplayItem(content2, backgroundType), TestDisplayItem(container2Layer, DisplayItem::kEndSubsequence), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence), TestDisplayItem(*layoutView().layer(), DisplayItem::kEndSubsequence)); } else { EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 15, TestDisplayItem(layoutView(), DisplayItem::kClipFrameToVisibleContentRect), TestDisplayItem(*layoutView().layer(), DisplayItem::kSubsequence), TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(container1Layer, DisplayItem::kSubsequence), TestDisplayItem(container1, backgroundType), TestDisplayItem(content1, backgroundType), TestDisplayItem(container1Layer, DisplayItem::kEndSubsequence), TestDisplayItem(container2Layer, DisplayItem::kSubsequence), TestDisplayItem(container2, backgroundType), TestDisplayItem(content2, backgroundType), TestDisplayItem(container2Layer, DisplayItem::kEndSubsequence), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence), TestDisplayItem(*layoutView().layer(), DisplayItem::kEndSubsequence), TestDisplayItem(layoutView(), DisplayItem::clipTypeToEndClipType( DisplayItem::kClipFrameToVisibleContentRect))); } } else { EXPECT_DISPLAY_LIST( rootPaintController().getDisplayItemList(), 11, TestDisplayItem(layoutView(), documentBackgroundType), TestDisplayItem(htmlLayer, DisplayItem::kSubsequence), TestDisplayItem(container1Layer, DisplayItem::kSubsequence), TestDisplayItem(container1, backgroundType), TestDisplayItem(content1, backgroundType), TestDisplayItem(container1Layer, DisplayItem::kEndSubsequence), TestDisplayItem(container2Layer, DisplayItem::kSubsequence), TestDisplayItem(container2, backgroundType), TestDisplayItem(content2, backgroundType), TestDisplayItem(container2Layer, DisplayItem::kEndSubsequence), TestDisplayItem(htmlLayer, DisplayItem::kEndSubsequence)); } } TEST_P(PaintLayerPainterTest, PaintPhaseOutline) { AtomicString styleWithoutOutline = "width: 50px; height: 50px; background-color: green"; AtomicString styleWithOutline = "outline: 1px solid blue; " + styleWithoutOutline; setBodyInnerHTML( "<div id='self-painting-layer' style='position: absolute'>" " <div id='non-self-painting-layer' style='overflow: hidden'>" " <div>" " <div id='outline'></div>" " </div>" " </div>" "</div>"); LayoutObject& outlineDiv = *document().getElementById("outline")->layoutObject(); toHTMLElement(outlineDiv.node()) ->setAttribute(HTMLNames::styleAttr, styleWithoutOutline); document().view()->updateAllLifecyclePhases(); LayoutBoxModelObject& selfPaintingLayerObject = *toLayoutBoxModelObject( document().getElementById("self-painting-layer")->layoutObject()); PaintLayer& selfPaintingLayer = *selfPaintingLayerObject.layer(); ASSERT_TRUE(selfPaintingLayer.isSelfPaintingLayer()); PaintLayer& nonSelfPaintingLayer = *toLayoutBoxModelObject( document().getElementById("non-self-painting-layer")->layoutObject()) ->layer(); ASSERT_FALSE(nonSelfPaintingLayer.isSelfPaintingLayer()); ASSERT_TRUE(&nonSelfPaintingLayer == outlineDiv.enclosingLayer()); EXPECT_FALSE(selfPaintingLayer.needsPaintPhaseDescendantOutlines()); EXPECT_FALSE(nonSelfPaintingLayer.needsPaintPhaseDescendantOutlines()); // Outline on the self-painting-layer node itself doesn't affect // PaintPhaseDescendantOutlines. toHTMLElement(selfPaintingLayerObject.node()) ->setAttribute(HTMLNames::styleAttr, "position: absolute; outline: 1px solid green"); document().view()->updateAllLifecyclePhases(); EXPECT_FALSE(selfPaintingLayer.needsPaintPhaseDescendantOutlines()); EXPECT_FALSE(nonSelfPaintingLayer.needsPaintPhaseDescendantOutlines()); EXPECT_TRUE(displayItemListContains( rootPaintController().getDisplayItemList(), selfPaintingLayerObject, DisplayItem::paintPhaseToDrawingType(PaintPhaseSelfOutlineOnly))); // needsPaintPhaseDescendantOutlines should be set when any descendant on the // same layer has outline. toHTMLElement(outlineDiv.node()) ->setAttribute(HTMLNames::styleAttr, styleWithOutline); document().view()->updateAllLifecyclePhasesExceptPaint(); EXPECT_TRUE(selfPaintingLayer.needsPaintPhaseDescendantOutlines()); EXPECT_FALSE(nonSelfPaintingLayer.needsPaintPhaseDescendantOutlines()); paint(); EXPECT_TRUE(displayItemListContains( rootPaintController().getDisplayItemList(), outlineDiv, DisplayItem::paintPhaseToDrawingType(PaintPhaseSelfOutlineOnly))); // needsPaintPhaseDescendantOutlines should be reset when no outline is // actually painted. toHTMLElement(outlineDiv.node()) ->setAttribute(HTMLNames::styleAttr, styleWithoutOutline); document().view()->updateAllLifecyclePhases(); EXPECT_FALSE(selfPaintingLayer.needsPaintPhaseDescendantOutlines()); } TEST_P(PaintLayerPainterTest, PaintPhaseFloat) { AtomicString styleWithoutFloat = "width: 50px; height: 50px; background-color: green"; AtomicString styleWithFloat = "float: left; " + styleWithoutFloat; setBodyInnerHTML( "<div id='self-painting-layer' style='position: absolute'>" " <div id='non-self-painting-layer' style='overflow: hidden'>" " <div>" " <div id='float' style='width: 10px; height: 10px; " "background-color: blue'></div>" " </div>" " </div>" "</div>"); LayoutObject& floatDiv = *document().getElementById("float")->layoutObject(); toHTMLElement(floatDiv.node()) ->setAttribute(HTMLNames::styleAttr, styleWithoutFloat); document().view()->updateAllLifecyclePhases(); LayoutBoxModelObject& selfPaintingLayerObject = *toLayoutBoxModelObject( document().getElementById("self-painting-layer")->layoutObject()); PaintLayer& selfPaintingLayer = *selfPaintingLayerObject.layer(); ASSERT_TRUE(selfPaintingLayer.isSelfPaintingLayer()); PaintLayer& nonSelfPaintingLayer = *toLayoutBoxModelObject( document().getElementById("non-self-painting-layer")->layoutObject()) ->layer(); ASSERT_FALSE(nonSelfPaintingLayer.isSelfPaintingLayer()); ASSERT_TRUE(&nonSelfPaintingLayer == floatDiv.enclosingLayer()); EXPECT_FALSE(selfPaintingLayer.needsPaintPhaseFloat()); EXPECT_FALSE(nonSelfPaintingLayer.needsPaintPhaseFloat()); // needsPaintPhaseFloat should be set when any descendant on the same layer // has float. toHTMLElement(floatDiv.node()) ->setAttribute(HTMLNames::styleAttr, styleWithFloat); document().view()->updateAllLifecyclePhasesExceptPaint(); EXPECT_TRUE(selfPaintingLayer.needsPaintPhaseFloat()); EXPECT_FALSE(nonSelfPaintingLayer.needsPaintPhaseFloat()); paint(); EXPECT_TRUE( displayItemListContains(rootPaintController().getDisplayItemList(), floatDiv, DisplayItem::kBoxDecorationBackground)); // needsPaintPhaseFloat should be reset when there is no float actually // painted. toHTMLElement(floatDiv.node()) ->setAttribute(HTMLNames::styleAttr, styleWithoutFloat); document().view()->updateAllLifecyclePhases(); EXPECT_FALSE(selfPaintingLayer.needsPaintPhaseFloat()); } TEST_P(PaintLayerPainterTest, PaintPhaseFloatUnderInlineLayer) { setBodyInnerHTML( "<div id='self-painting-layer' style='position: absolute'>" " <div id='non-self-painting-layer' style='overflow: hidden'>" " <span id='span' style='position: relative'>" " <div id='float' style='width: 10px; height: 10px; " "background-color: blue; float: left'></div>" " </span>" " </div>" "</div>"); document().view()->updateAllLifecyclePhases(); LayoutObject& floatDiv = *document().getElementById("float")->layoutObject(); LayoutBoxModelObject& span = *toLayoutBoxModelObject( document().getElementById("span")->layoutObject()); PaintLayer& spanLayer = *span.layer(); ASSERT_TRUE(&spanLayer == floatDiv.enclosingLayer()); ASSERT_FALSE(spanLayer.needsPaintPhaseFloat()); LayoutBoxModelObject& selfPaintingLayerObject = *toLayoutBoxModelObject( document().getElementById("self-painting-layer")->layoutObject()); PaintLayer& selfPaintingLayer = *selfPaintingLayerObject.layer(); ASSERT_TRUE(selfPaintingLayer.isSelfPaintingLayer()); PaintLayer& nonSelfPaintingLayer = *toLayoutBoxModelObject( document().getElementById("non-self-painting-layer")->layoutObject()) ->layer(); ASSERT_FALSE(nonSelfPaintingLayer.isSelfPaintingLayer()); EXPECT_TRUE(selfPaintingLayer.needsPaintPhaseFloat()); EXPECT_FALSE(nonSelfPaintingLayer.needsPaintPhaseFloat()); EXPECT_FALSE(spanLayer.needsPaintPhaseFloat()); EXPECT_TRUE( displayItemListContains(rootPaintController().getDisplayItemList(), floatDiv, DisplayItem::kBoxDecorationBackground)); } TEST_P(PaintLayerPainterTest, PaintPhaseBlockBackground) { AtomicString styleWithoutBackground = "width: 50px; height: 50px"; AtomicString styleWithBackground = "background: blue; " + styleWithoutBackground; setBodyInnerHTML( "<div id='self-painting-layer' style='position: absolute'>" " <div id='non-self-painting-layer' style='overflow: hidden'>" " <div>" " <div id='background'></div>" " </div>" " </div>" "</div>"); LayoutObject& backgroundDiv = *document().getElementById("background")->layoutObject(); toHTMLElement(backgroundDiv.node()) ->setAttribute(HTMLNames::styleAttr, styleWithoutBackground); document().view()->updateAllLifecyclePhases(); LayoutBoxModelObject& selfPaintingLayerObject = *toLayoutBoxModelObject( document().getElementById("self-painting-layer")->layoutObject()); PaintLayer& selfPaintingLayer = *selfPaintingLayerObject.layer(); ASSERT_TRUE(selfPaintingLayer.isSelfPaintingLayer()); PaintLayer& nonSelfPaintingLayer = *toLayoutBoxModelObject( document().getElementById("non-self-painting-layer")->layoutObject()) ->layer(); ASSERT_FALSE(nonSelfPaintingLayer.isSelfPaintingLayer()); ASSERT_TRUE(&nonSelfPaintingLayer == backgroundDiv.enclosingLayer()); EXPECT_FALSE(selfPaintingLayer.needsPaintPhaseDescendantBlockBackgrounds()); EXPECT_FALSE( nonSelfPaintingLayer.needsPaintPhaseDescendantBlockBackgrounds()); // Background on the self-painting-layer node itself doesn't affect // PaintPhaseDescendantBlockBackgrounds. toHTMLElement(selfPaintingLayerObject.node()) ->setAttribute(HTMLNames::styleAttr, "position: absolute; background: green"); document().view()->updateAllLifecyclePhases(); EXPECT_FALSE(selfPaintingLayer.needsPaintPhaseDescendantBlockBackgrounds()); EXPECT_FALSE( nonSelfPaintingLayer.needsPaintPhaseDescendantBlockBackgrounds()); EXPECT_TRUE(displayItemListContains( rootPaintController().getDisplayItemList(), selfPaintingLayerObject, DisplayItem::kBoxDecorationBackground)); // needsPaintPhaseDescendantBlockBackgrounds should be set when any descendant // on the same layer has Background. toHTMLElement(backgroundDiv.node()) ->setAttribute(HTMLNames::styleAttr, styleWithBackground); document().view()->updateAllLifecyclePhasesExceptPaint(); EXPECT_TRUE(selfPaintingLayer.needsPaintPhaseDescendantBlockBackgrounds()); EXPECT_FALSE( nonSelfPaintingLayer.needsPaintPhaseDescendantBlockBackgrounds()); paint(); EXPECT_TRUE(displayItemListContains( rootPaintController().getDisplayItemList(), backgroundDiv, DisplayItem::kBoxDecorationBackground)); // needsPaintPhaseDescendantBlockBackgrounds should be reset when no outline // is actually painted. toHTMLElement(backgroundDiv.node()) ->setAttribute(HTMLNames::styleAttr, styleWithoutBackground); document().view()->updateAllLifecyclePhases(); EXPECT_FALSE(selfPaintingLayer.needsPaintPhaseDescendantBlockBackgrounds()); } TEST_P(PaintLayerPainterTest, PaintPhasesUpdateOnLayerRemoval) { setBodyInnerHTML( "<div id='layer' style='position: relative'>" " <div style='height: 100px'>" " <div style='height: 20px; outline: 1px solid red; background-color: " "green'>outline and background</div>" " <div style='float: left'>float</div>" " </div>" "</div>"); LayoutBoxModelObject& layerDiv = *toLayoutBoxModelObject( document().getElementById("layer")->layoutObject()); PaintLayer& layer = *layerDiv.layer(); ASSERT_TRUE(layer.isSelfPaintingLayer()); EXPECT_TRUE(layer.needsPaintPhaseDescendantOutlines()); EXPECT_TRUE(layer.needsPaintPhaseFloat()); EXPECT_TRUE(layer.needsPaintPhaseDescendantBlockBackgrounds()); PaintLayer& htmlLayer = *toLayoutBoxModelObject(document().documentElement()->layoutObject()) ->layer(); EXPECT_FALSE(htmlLayer.needsPaintPhaseDescendantOutlines()); EXPECT_FALSE(htmlLayer.needsPaintPhaseFloat()); EXPECT_FALSE(htmlLayer.needsPaintPhaseDescendantBlockBackgrounds()); toHTMLElement(layerDiv.node())->setAttribute(HTMLNames::styleAttr, ""); document().view()->updateAllLifecyclePhases(); EXPECT_FALSE(layerDiv.hasLayer()); EXPECT_TRUE(htmlLayer.needsPaintPhaseDescendantOutlines()); EXPECT_TRUE(htmlLayer.needsPaintPhaseFloat()); EXPECT_TRUE(htmlLayer.needsPaintPhaseDescendantBlockBackgrounds()); } TEST_P(PaintLayerPainterTest, PaintPhasesUpdateOnLayerAddition) { setBodyInnerHTML( "<div id='will-be-layer'>" " <div style='height: 100px'>" " <div style='height: 20px; outline: 1px solid red; background-color: " "green'>outline and background</div>" " <div style='float: left'>float</div>" " </div>" "</div>"); LayoutBoxModelObject& layerDiv = *toLayoutBoxModelObject( document().getElementById("will-be-layer")->layoutObject()); EXPECT_FALSE(layerDiv.hasLayer()); PaintLayer& htmlLayer = *toLayoutBoxModelObject(document().documentElement()->layoutObject()) ->layer(); EXPECT_TRUE(htmlLayer.needsPaintPhaseDescendantOutlines()); EXPECT_TRUE(htmlLayer.needsPaintPhaseFloat()); EXPECT_TRUE(htmlLayer.needsPaintPhaseDescendantBlockBackgrounds()); toHTMLElement(layerDiv.node()) ->setAttribute(HTMLNames::styleAttr, "position: relative"); document().view()->updateAllLifecyclePhases(); ASSERT_TRUE(layerDiv.hasLayer()); PaintLayer& layer = *layerDiv.layer(); ASSERT_TRUE(layer.isSelfPaintingLayer()); EXPECT_TRUE(layer.needsPaintPhaseDescendantOutlines()); EXPECT_TRUE(layer.needsPaintPhaseFloat()); EXPECT_TRUE(layer.needsPaintPhaseDescendantBlockBackgrounds()); } TEST_P(PaintLayerPainterTest, PaintPhasesUpdateOnBecomingSelfPainting) { setBodyInnerHTML( "<div id='will-be-self-painting' style='width: 100px; height: 100px; " "overflow: hidden'>" " <div>" " <div style='outline: 1px solid red; background-color: " "green'>outline and background</div>" " </div>" "</div>"); LayoutBoxModelObject& layerDiv = *toLayoutBoxModelObject( document().getElementById("will-be-self-painting")->layoutObject()); ASSERT_TRUE(layerDiv.hasLayer()); EXPECT_FALSE(layerDiv.layer()->isSelfPaintingLayer()); PaintLayer& htmlLayer = *toLayoutBoxModelObject(document().documentElement()->layoutObject()) ->layer(); EXPECT_TRUE(htmlLayer.needsPaintPhaseDescendantOutlines()); EXPECT_TRUE(htmlLayer.needsPaintPhaseDescendantBlockBackgrounds()); toHTMLElement(layerDiv.node()) ->setAttribute( HTMLNames::styleAttr, "width: 100px; height: 100px; overflow: hidden; position: relative"); document().view()->updateAllLifecyclePhases(); PaintLayer& layer = *layerDiv.layer(); ASSERT_TRUE(layer.isSelfPaintingLayer()); EXPECT_TRUE(layer.needsPaintPhaseDescendantOutlines()); EXPECT_TRUE(layer.needsPaintPhaseDescendantBlockBackgrounds()); } TEST_P(PaintLayerPainterTest, PaintPhasesUpdateOnBecomingNonSelfPainting) { setBodyInnerHTML( "<div id='will-be-non-self-painting' style='width: 100px; height: 100px; " "overflow: hidden; position: relative'>" " <div>" " <div style='outline: 1px solid red; background-color: " "green'>outline and background</div>" " </div>" "</div>"); LayoutBoxModelObject& layerDiv = *toLayoutBoxModelObject( document().getElementById("will-be-non-self-painting")->layoutObject()); ASSERT_TRUE(layerDiv.hasLayer()); PaintLayer& layer = *layerDiv.layer(); EXPECT_TRUE(layer.isSelfPaintingLayer()); EXPECT_TRUE(layer.needsPaintPhaseDescendantOutlines()); EXPECT_TRUE(layer.needsPaintPhaseDescendantBlockBackgrounds()); PaintLayer& htmlLayer = *toLayoutBoxModelObject(document().documentElement()->layoutObject()) ->layer(); EXPECT_FALSE(htmlLayer.needsPaintPhaseDescendantOutlines()); EXPECT_FALSE(htmlLayer.needsPaintPhaseDescendantBlockBackgrounds()); toHTMLElement(layerDiv.node()) ->setAttribute(HTMLNames::styleAttr, "width: 100px; height: 100px; overflow: hidden"); document().view()->updateAllLifecyclePhases(); EXPECT_FALSE(layer.isSelfPaintingLayer()); EXPECT_TRUE(htmlLayer.needsPaintPhaseDescendantOutlines()); EXPECT_TRUE(htmlLayer.needsPaintPhaseDescendantBlockBackgrounds()); } TEST_P(PaintLayerPainterTest, TableCollapsedBorderNeedsPaintPhaseDescendantBlockBackgrounds) { // TODO(wangxianzhu): Enable this test slimmingPaintInvalidation when its // fully functional. if (RuntimeEnabledFeatures::slimmingPaintInvalidationEnabled()) return; // "position: relative" makes the table and td self-painting layers. // The table's layer should be marked needsPaintPhaseDescendantBlockBackground // because it will paint collapsed borders in the phase. setBodyInnerHTML( "<table id='table' style='position: relative; border-collapse: collapse'>" " <tr><td style='position: relative; border: 1px solid " "green'>Cell</td></tr>" "</table>"); LayoutBoxModelObject& table = *toLayoutBoxModelObject(getLayoutObjectByElementId("table")); ASSERT_TRUE(table.hasLayer()); PaintLayer& layer = *table.layer(); EXPECT_TRUE(layer.isSelfPaintingLayer()); EXPECT_TRUE(layer.needsPaintPhaseDescendantBlockBackgrounds()); } TEST_P(PaintLayerPainterTest, TableCollapsedBorderNeedsPaintPhaseDescendantBlockBackgroundsDynamic) { // TODO(wangxianzhu): Enable this test slimmingPaintInvalidation when its // fully functional. if (RuntimeEnabledFeatures::slimmingPaintInvalidationEnabled()) return; setBodyInnerHTML( "<table id='table' style='position: relative'>" " <tr><td style='position: relative; border: 1px solid " "green'>Cell</td></tr>" "</table>"); LayoutBoxModelObject& table = *toLayoutBoxModelObject(getLayoutObjectByElementId("table")); ASSERT_TRUE(table.hasLayer()); PaintLayer& layer = *table.layer(); EXPECT_TRUE(layer.isSelfPaintingLayer()); EXPECT_FALSE(layer.needsPaintPhaseDescendantBlockBackgrounds()); toHTMLElement(table.node()) ->setAttribute(HTMLNames::styleAttr, "position: relative; border-collapse: collapse"); document().view()->updateAllLifecyclePhases(); EXPECT_TRUE(layer.needsPaintPhaseDescendantBlockBackgrounds()); } } // namespace blink

[ "serg.zhukovsky@gmail.com" ]

serg.zhukovsky@gmail.com

7a4b82c394384a1f2e4e4688c2661d9eaab0a89f

0350bce9b0672d478fd0e3e459662ae0e2c9d1c0

/Haushaltsbuch/posting.cpp

097c61d3e5502b6f7445c3f02642f3340e4adae7

[]

no_license

fschmidt/C--4J

576401e786473515dd05378ec2558fb07c980e25

0bbcd5b01030316e110f6db8d0b1b73f5232b7a7

refs/heads/master

2021-01-20T04:49:50.747302

2012-07-10T11:42:21

null

0

null

UTF-8

C++

false

572

cpp

#include "posting.h" Posting::Posting(){} Posting::Posting(QString name, double sum, int categorie, bool earning, QString discription, QDateTime date) : m_name(name), m_sum(sum), m_categorie(categorie), m_earning(earning), m_discription(discription), m_date(date){} QString& Posting::name(){ return m_name; } double& Posting::sum(){ return m_sum; } int& Posting::categorie(){ return m_categorie; } bool& Posting::earning(){ return m_earning; } QString& Posting::discription(){ return m_discription; } QDateTime &Posting::date(){ return m_date; }

[ "marcus.froede@gmx.de" ]

marcus.froede@gmx.de

165dc7ac36f148fb503c0d2f281007f2edba4738

1cb5af2a44d54b3c2870b95eb66f092edb3a779a

/LeetCode/Medium/1237. Find Positive Integer Solution for a Given Equation/main.cpp

de7d1835a315636b803aa5ffffd00ea9561f2fe7

[]

no_license

jmmm25/Algorithm

baabc36067e6b01c1ef1e8ee9f3476bcd0f7e3b6

072bb8fe6b1bd7147b1034fe8d242d6aa5e14115

refs/heads/master

2023-04-07T23:03:11.062147

2021-04-08T23:56:37

257,604,895

1

0

null

UTF-8

C++

false

727

cpp

#include <iostream> #include <vector> using namespace std; // This is the custom function interface. // You should not implement it, or speculate about its implementation class CustomFunction { public: int f(int x, int y); }; class Solution { public: vector<vector<int>> findSolution(CustomFunction &customfunction, int z) { { vector<vector<int>> res; for (int i = 1; i < 1001; i++) { for (int j = 1; j < 1001; j++) { if (customfunction.f(i, j) == z) { res.push_back({i, j}); } } } return res; } } };

[ "" ]

8b28a122b8103134b02caef36c41366a37d6bb2a

9e78a5a7dbd79d40ef1a8ca6e9d45620cf594cd0

/Leetcode/380. Insert Delete GetRandom O(1).cpp

ddb0b8165ff922e124faa715e64f3fe896372ca2

[]

no_license

Akimbaevsako/CodeIt

ff6cf2bde5e5e95b37d818e4ace7774c2a2ec64b

22e27d94d76ec044ca65d1169cb3f8d610fa2bf3

refs/heads/master

2023-04-04T23:16:52.822415

2021-03-12T18:53:41

null

0

null

UTF-8

C++

false

2,121

cpp

/* 380. Insert Delete GetRandom O(1) Design a data structure that supports all following operations in average O(1) time. 1. insert(val): Inserts an item val to the set if not already present. 2. remove(val): Removes an item val from the set if present. 3. getRandom: Returns a random element from current set of elements (it's guaranteed that at least one element exists when this method is called). Each element must have the same probability of being returned. Example: // Init an empty set. RandomizedSet randomSet = new RandomizedSet(); // Inserts 1 to the set. Returns true as 1 was inserted successfully. randomSet.insert(1); // Returns false as 2 does not exist in the set. randomSet.remove(2); // Inserts 2 to the set, returns true. Set now contains [1,2]. randomSet.insert(2); // getRandom should return either 1 or 2 randomly. randomSet.getRandom(); // Removes 1 from the set, returns true. Set now contains [2]. randomSet.remove(1); // 2 was already in the set, so return false. randomSet.insert(2); // Since 2 is the only number in the set, getRandom always return 2. randomSet.getRandom() --------------------SOLUTION-----------------*/ class RandomizedSet { vector<int> nums; unordered_map<int, int> positions; public: RandomizedSet() { } bool insert(int val) { if(positions.find(val) != positions.end()) return false; nums.push_back(val); positions.insert({val, nums.size()-1}); return true; } bool remove(int val) { if(positions.find(val) == positions.end()) return false; int pos = positions[val]; nums[pos] = nums[nums.size()-1]; positions[nums[pos]] = pos; nums.pop_back(); positions.erase(val); return true; } int getRandom() { return nums[rand() % nums.size()]; } }; /** * Your RandomizedSet object will be instantiated and called as such: * RandomizedSet* obj = new RandomizedSet(); * bool param_1 = obj->insert(val); * bool param_2 = obj->remove(val); * int param_3 = obj->getRandom(); */

[ "noreply@github.com" ]

noreply@github.com

ebe330a2a7c8b02b4460731ae63d4f6cc7742317

d97993401b9053d882efa9e1016ec710083088a1

/3DScanner_v1.1/dhx64.cpp

84d02e41938476f19ca937fd9a2e8b20eb94ece8

[]

no_license

xfsun99/3DScanner

946fb33e3f92c05c9320058cad3cbcf051c8234e

63fec771b882c1ad71416bbe663c2cd0bfb300c3

refs/heads/master

2021-01-21T14:19:48.980174

2017-06-26T09:54:55

95,432,345

3

0

null

GB18030

C++

false

24,069

cpp

#include "dhx64.h" #include <QMessageBox> #include <QStandardItemModel> #include <QFont> #include <QFileDialog> static void ProcessData(BYTE *pImageBuf, BYTE *pImageRGBBuf,BYTE* m_pImgRaw8Buffer, int64_t nImageWidth, int64_t nImageHeight,int64_t m_nPixelFormat,int64_t m_nPixelColorFilter); camera::camera() { } camera::camera(QString devicename) { deviceName=devicename; hDevice=NULL; deviceSate=CLOSE; deviceSate=STOP; needDisplay=false; imageInfo.Image=new Mat; imageInfo.grayImg=new Mat; } GX_DEV_HANDLE camera::getDevice()const { return hDevice; } void camera::setDevice(GX_DEV_HANDLE hdevice) { hDevice=hdevice; } QString camera::getDeviceName()const { return deviceName; } bool camera::getDeviceSate()const { return deviceSate; } void camera::setDeviceState(bool st) { deviceSate=st; } int camera::getIndex() { return 0; } camera::~camera() { } Mat* dhx64::imL=NULL; Mat* dhx64::imR=NULL; dhx64* dhx64::instance=NULL; dhx64* dhx64::getInstance() { if(instance==NULL) { instance=new dhx64; } return instance; } dhx64::dhx64(QWidget *parent) : QMainWindow(parent) { instance=this; serialport=NULL; count=0; imL=new Mat; imR=new Mat; ui.setupUi(this); InitializeDHX(); onCheckSerialPort(); readPath(); connect(ui.listWidget,SIGNAL(itemClicked(QListWidgetItem * )),this,SLOT(itemclickedSlot(QListWidgetItem *))); //refresh device information connect(ui.actionReflashDeviceInfo,SIGNAL(triggered()),this,SLOT(refreshDeviceInfoSlot())); //connect connect(ui.actionConnect,SIGNAL(triggered()),this,SLOT(onConnectActionSlot())); //disconnect connect(ui.actionDisconnect,SIGNAL(triggered()),this,SLOT(onDisconnectActionSlot())); //start action connect(ui.actionStart,SIGNAL(triggered()),this,SLOT(onStartActionSlot())); //stop action connect(ui.actionStop,SIGNAL(triggered()),this,SLOT(onStopActionSlot())); //ste gain connect(ui.spinBoxGain,SIGNAL(valueChanged(int)),this,SLOT(onGainAction())); //change trigger mode connect(ui.comboBox,SIGNAL(activated(int)),this,SLOT(onTriggerModeChageSLot(int))); //check serial port connect(ui.commandLinkButtonCheckport,SIGNAL(clicked()),this,SLOT(onCheckSerialPort())); //select serial port connect(ui.comboBoxSerialPort,SIGNAL(activated(int)),this,SLOT(onSelectedSerialport())); //open or close serial port connect(ui.commandLinkButtonOpenClose,SIGNAL(clicked()),this,SLOT(onOpenOrCloseSerialPort())); //catch image connect(ui.commandLinkButtonCatch,SIGNAL(clicked()),this,SLOT(onCatchImageActionSlot())); //read serial port connect(serialport,SIGNAL(readyRead()),this,SLOT(readSerialPort())); //save image connect(ui.actionSaveImage,SIGNAL(triggered()),this,SLOT(saveImageSlot())); //get corners connect(ui.commandLinkButtonSaveLRImg,SIGNAL(clicked()),this,SLOT(onSaveLRImages())); //load image in manual connect(ui.actionLoadLeftImg,SIGNAL(triggered()),this,SLOT(onLoadLeftImgManualActionSLot())); connect(ui.actionLoadRightImg,SIGNAL(triggered()),this,SLOT(onLoadRightImgManualActionSLot())); } void dhx64::readPath() { FileStorage fs; string path; if(fs.open("Path.txt", FileStorage::READ)) { fs["OpenPath"]>>openpath; fs["SavePath"]>>savepath; } fs.release(); } void dhx64::writePath() { FileStorage fsw("Path.txt", FileStorage::WRITE); fsw<<"OpenPath"<<openpath; fsw<<"SavePath"<<savepath; fsw.release(); } void dhx64::InitializeDHX() { status = GX_STATUS_SUCCESS; //在起始位置调用GXInitLib()进行初始化，申请资源 status = GXInitLib(); //refresh the device information after GXInitlize refreshDeviceInfoSlot(); } dhx64::~dhx64() { status = GXCloseLib(); } void dhx64::onCheckSerialPort() { INFO=new QList<QSerialPortInfo>; ui.comboBoxSerialPort->clear(); *INFO= QSerialPortInfo::availablePorts(); if(INFO->size()<1) { ui.commandLinkButtonOpenClose->setEnabled(false); return; } ui.commandLinkButtonOpenClose->setEnabled(true); for(int i=0;i<INFO->size();i++) { ui.comboBoxSerialPort->addItem(INFO->at(0).portName()); } onSelectedSerialport(); } void dhx64::onSelectedSerialport() { if(serialport!=NULL)delete serialport; serialport=new QSerialPort(ui.comboBoxSerialPort->currentText(),this); serialport->setBaudRate(110); } void dhx64::onOpenOrCloseSerialPort() { if(serialport->isOpen()) { serialport->close(); ui.commandLinkButtonOpenClose->setText("Open Serial Port"); ui.commandLinkButtonCatch->setEnabled(false); return; } if(serialport->open(QIODevice::ReadWrite)==false) { QString message("Can not open serial port!"); QMessageBox::warning(this, tr("Info"), message); ui.commandLinkButtonCatch->setEnabled(false); return; } ui.commandLinkButtonOpenClose->setText("Close Serial Port"); } void dhx64::onCatchImageActionSlot() { if(serialport!=NULL&&serialport->isOpen()) { char dt=0; serialport->write(&dt,1); serialport->waitForReadyRead(10); } //for(int i=0;i<cameraList.size();i++) //{ // if(cameraList[i]->getDeviceSate()==OPEN) // { // GX_DEV_HANDLE hDevice=cameraList[i]->getDevice(); // GXSendCommand(hDevice, GX_COMMAND_ACQUISITION_START); // } //} } void dhx64::onLoadLeftImgManualActionSLot() { QString pathL = QFileDialog::getOpenFileName(this, tr("Load Left Image"),QString::fromStdString(openpath), tr("Image Files(*.jpg *.png *.bmp)")); if(pathL.length() == 0) { QMessageBox::information(NULL, tr("Path"), tr("You didn't select any files.")); return; } openpath=pathL.toStdString(); writePath(); *imL= imread(openpath); if(imL->empty())return; diaplayImage(); } void dhx64::onLoadRightImgManualActionSLot() { QString pathR = QFileDialog::getOpenFileName(this, tr("Load Right Image"),QString::fromStdString(openpath), tr("Image Files(*.jpg *.png *.bmp)")); if(pathR.length() == 0) { QMessageBox::information(NULL, tr("Path"), tr("You didn't select any files.")); return; } openpath=pathR.toStdString(); writePath(); *imR= imread(openpath); if(imR->empty())return; diaplayImage(); } void dhx64::readSerialPort() { QByteArray data = serialport->readAll(); } bool dhx64::deviceIsOpening(QString deviceName) { for(int i=0;i<cameraList.size();i++) { if(cameraList[i]->getDeviceName()==deviceName&&cameraList[i]->getDeviceSate()==OPEN) { return true; } } return false; } void dhx64::OpenDivice(QString deviceName) { for(int i=0;i<cameraList.size();i++) { if(cameraList[i]->getDeviceSate()==CLOSE&&cameraList[i]->getDeviceName()==deviceName) { GX_DEV_HANDLE hDevice = cameraList[i]->getDevice(); int id=getCameraIndex(deviceName); if(id) { status = GXOpenDeviceByIndex(id, &hDevice); cameraList[i]->setDevice(hDevice); cameraList[i]->setDeviceState(OPEN); initialCamera(deviceName); return; } } } } void dhx64::CloseDevice(QString devicename) { for(int i=0;i<cameraList.size();i++) { if(cameraList[i]->getDeviceSate()==OPEN&&cameraList[i]->getDeviceName()==devicename) { GX_DEV_HANDLE hDevice = cameraList[i]->getDevice(); status = GXCloseDevice(hDevice); cameraList[i]->setDeviceState(CLOSE); //注销采集回调 status = GXUnregisterCaptureCallback(hDevice); return; } } } void dhx64::initialCamera(QString devicename) { camera* cameraToInitial=getACameraInList(devicename); if(cameraToInitial==NULL) { return; } GX_DEV_HANDLE hDevice =cameraToInitial->getDevice(); //获取宽高 status = GXGetInt(hDevice,GX_INT_WIDTH,&cameraToInitial->imageInfo.ImageWidth); status = GXGetInt(hDevice,GX_INT_HEIGHT,&cameraToInitial->imageInfo.ImageHeight); status = GXGetEnum(hDevice, GX_ENUM_PIXEL_FORMAT, &cameraToInitial->imageInfo.PixelFormat); //是否支持colorfilter status = GXGetEnum(hDevice, GX_ENUM_PIXEL_COLOR_FILTER, &cameraToInitial->imageInfo.PixelColorFilter); cameraToInitial->imageInfo.ImgRaw8Buffer=new BYTE[size_t(cameraToInitial->imageInfo.ImageWidth * cameraToInitial->imageInfo.ImageHeight)]; cameraToInitial->imageInfo.ImgRGBBuffer=new BYTE[size_t(cameraToInitial->imageInfo.ImageWidth * cameraToInitial->imageInfo.ImageHeight*3)]; cameraToInitial->imageInfo.Image->create(cameraToInitial->imageInfo.ImageHeight,cameraToInitial->imageInfo.ImageWidth,CV_8UC3); cameraToInitial->imageInfo.grayImg->create(cameraToInitial->imageInfo.ImageHeight,cameraToInitial->imageInfo.ImageWidth,CV_8UC1); //设置采集模式。一般相机的默认采集模式为连续模式。 //SPEED_LEVEL status = GXGetInt(hDevice,GX_INT_ACQUISITION_SPEED_LEVEL,0); int64_t nAcqMode = GX_ACQ_MODE_SINGLE_FRAME; status = GXSetEnum(hDevice, GX_ENUM_ACQUISITION_MODE, nAcqMode); //设置连续自动白平衡 status=GXSetEnum(hDevice,GX_ENUM_BALANCE_WHITE_AUTO,GX_BALANCE_WHITE_AUTO_CONTINUOUS); //注册图像处理回调函数 if(getCameraIndex(cameraToInitial->getDeviceName())==1) status = GXRegisterCaptureCallback(hDevice, this, OnFrameCallbackFun_Left); else status = GXRegisterCaptureCallback(hDevice, this, OnFrameCallbackFun_Right); ////设置触发模式为OFF //status = GXSetEnum(hDevice, GX_ENUM_TRIGGER_MODE, GX_TRIGGER_MODE_ON); // status = GXSetEnum(hDevice,GX_ENUM_TRIGGER_ACTIVATION,GX_TRIGGER_ACTIVATION_RISINGEDGE); } void dhx64::onSaveLRImages() { QDir *temp = new QDir; bool exist = temp->exists(QString::fromStdString(saveImagePath)); delete temp; if(exist==false) { QString fileName = QFileDialog::getExistingDirectory(this, tr("Open Directory"), ".", QFileDialog::ShowDirsOnly | QFileDialog::DontResolveSymlinks); if(fileName.isEmpty()==false) { saveImagePath=fileName.toStdString(); } } if(cameraList.size()==2) { char cnt[2]; sprintf(cnt,"%d",count); count++; string st=cnt; string Ln=saveImagePath+"/l"+st+".bmp"; string Rn=saveImagePath+"/r"+st+".bmp"; imwrite(Ln,*cameraList[0]->imageInfo.grayImg); imwrite(Rn,*cameraList[1]->imageInfo.grayImg); } } void dhx64::startCamera(QString devicename) { camera* cameraToStart=getACameraInList(devicename); if(cameraToStart!=NULL) { GX_DEV_HANDLE hDevice =cameraToStart->getDevice(); //发送开采命令 if(GXSendCommand(hDevice, GX_COMMAND_ACQUISITION_START)==GX_STATUS_SUCCESS) { cameraToStart->stopOrStartSate=START; ui.actionSaveImage->setEnabled(true); ui.commandLinkButtonCatch->setEnabled(true); } } } void dhx64::stopCamera(QString devicename) { camera* cameraToStop=getACameraInList(devicename); if(cameraToStop!=NULL) { GX_DEV_HANDLE hDevice =cameraToStop->getDevice(); //发送停采命令 status = GXSendCommand(hDevice, GX_COMMAND_ACQUISITION_STOP); if(status==GX_STATUS_SUCCESS) { cameraToStop->stopOrStartSate=STOP; ui.commandLinkButtonCatch->setEnabled(false); } } } //slot set gain void dhx64::onGainAction() { camera*currentCamera=getACameraInList(selectedDeviceName); GX_DEV_HANDLE hDevice=currentCamera->getDevice(); if(hDevice==NULL)return; status = GXSetEnum(hDevice, GX_ENUM_GAIN_SELECTOR, GX_GAIN_SELECTOR_ALL); int value=ui.spinBoxGain->value(); status =GXSetInt(hDevice,GX_INT_GAIN,value); } //trigger mode change void dhx64::onTriggerModeChageSLot(int triggermode) { camera*currentCamera=getACameraInList(selectedDeviceName); GX_DEV_HANDLE hDevice=currentCamera->getDevice(); if(hDevice==NULL)return; stopCamera(selectedDeviceName); if(triggermode==0) { status = GXSetEnum(hDevice, GX_ENUM_TRIGGER_MODE, GX_TRIGGER_MODE_OFF); int64_t nAcqMode = GX_ACQ_MODE_SINGLE_FRAME; status = GXSetEnum(hDevice, GX_ENUM_ACQUISITION_MODE, nAcqMode); } else { int64_t nAcqMode = GX_ACQ_MODE_CONTINUOUS; status = GXSetEnum(hDevice, GX_ENUM_ACQUISITION_MODE, nAcqMode); //设置触发激活方式为上升沿 status = GXSetEnum(hDevice, GX_ENUM_TRIGGER_MODE, GX_TRIGGER_MODE_ON); status = GXSetEnum(hDevice,GX_ENUM_TRIGGER_ACTIVATION,GX_TRIGGER_ACTIVATION_RISINGEDGE); } startCamera(selectedDeviceName); } //slot void dhx64::itemclickedSlot(QListWidgetItem * item) { selecteditem=item; selectedDeviceName=selecteditem->text(); camera* currentCamera=getACameraInList(selectedDeviceName); if(deviceIsOpening(selecteditem->text())==true) { ui.actionConnect->setDisabled(true); ui.actionDisconnect->setDisabled(false); if(currentCamera->stopOrStartSate==STOP) { ui.actionStart->setEnabled(true); ui.actionStop->setEnabled(false); ui.commandLinkButtonCatch->setEnabled(false); } else { ui.actionStart->setEnabled(false); ui.actionStop->setEnabled(true); ui.commandLinkButtonCatch->setEnabled(true); } } else { ui.actionConnect->setDisabled(false); ui.actionDisconnect->setDisabled(true); ui.actionStart->setEnabled(false); ui.actionStop->setEnabled(false); ui.commandLinkButtonCatch->setEnabled(false); } //set item to selected or unselected state reFreshItemStateInUi(); ui.groupBoxCamera->setEnabled(true); } //slot void dhx64::refreshDeviceInfoSlot() { uint32_t nDeviceNum = 0; status = GX_STATUS_SUCCESS; status = GXUpdateDeviceList(&nDeviceNum, 1000); if (status == GX_STATUS_SUCCESS && nDeviceNum > 0) { GX_DEVICE_BASE_INFO *baseinfo = new GX_DEVICE_BASE_INFO[nDeviceNum]; uint64_t nSize = nDeviceNum * sizeof(GX_DEVICE_BASE_INFO); status = GXGetAllDeviceBaseInfo(baseinfo, &nSize); //add device name to list widget ui.listWidget->clear(); QList<QString>DevicesNameTemp; QList<QListWidgetItem *>itemListTemp; for(int i=0;i<nDeviceNum;i++) { QString name(baseinfo[i].szDisplayName); DevicesNameTemp.push_back(name); QListWidgetItem*it=new QListWidgetItem; it->setText(name); //set item in opening state if(deviceIsOpening(name)) { QFont f; f.setBold(true); it->font().setBold(true); it->setFont(f); } //record selected item if(name==selectedDeviceName) { selecteditem=it; setItemSelectedState(it); } ui.listWidget->addItem(it); itemListTemp.push_back(it); } DevicesName=DevicesNameTemp; itemList=itemListTemp; addCameraToList(); delete []baseinfo; } else { QString message("No device!"); QMessageBox::information(this, tr("Info"), message); ui.groupBoxCamera->setEnabled(false); } } //slot void dhx64::saveImageSlot() { QString path = QFileDialog::getSaveFileName(0, tr("save data"), QString::fromStdString(savepath), tr("bmp files(*.bmp)")); if(path.isEmpty())return; savepath=path.toStdString(); writePath(); camera*currentCamera=getACameraInList(selectedDeviceName); imwrite(savepath,*currentCamera->imageInfo.grayImg); } //slot void dhx64::onConnectActionSlot() { //get selected device name QString devicename=selecteditem->text(); //open device OpenDivice(devicename); //set item in Opening state setItemInOpeningState(true); ui.actionStart->setEnabled(true); } //slot void dhx64::onDisconnectActionSlot() { //get selected device name QString devicename=selecteditem->text(); //close device CloseDevice(devicename); //set item in closed state setItemInOpeningState(false); ui.actionStart->setEnabled(false); ui.actionStop->setEnabled(false); } //slot void dhx64::onStartActionSlot() { startCamera(selectedDeviceName); ui.actionStart->setEnabled(false); ui.actionStop->setEnabled(true); } //slot void dhx64::onStopActionSlot() { stopCamera(selectedDeviceName); ui.actionStart->setEnabled(true); ui.actionStop->setEnabled(false); } void dhx64::setItemSelectedState(QListWidgetItem * item) { QColor backcolor(85,170,255,255); item->setBackgroundColor(backcolor); QColor textcolor(255,255,255,255); item->setTextColor(textcolor); } void dhx64::setItemNormalState(QListWidgetItem * item) { QColor backcolor(255,255,255,255); item->setBackgroundColor(backcolor); QColor textcolor(0,0,0,255); item->setTextColor(textcolor); } void dhx64::setItemInOpeningState(bool state) { //change item text font QFont f; f.setBold(state); selecteditem->setFont(f); ui.actionConnect->setDisabled(state); ui.actionDisconnect->setEnabled(state); } void dhx64::reFreshItemStateInUi() { for(int i=0;i<itemList.size();i++) { if(selectedDeviceName==itemList[i]->text()) { setItemSelectedState(itemList[i]); } else setItemNormalState(itemList[i]); } } void dhx64::addCameraToList() { if(cameraList.size()==0) { for(int i=0;i<DevicesName.size();i++) { camera* newcamera=new camera(DevicesName[i]); cameraList.push_back(newcamera); } return; } QList<camera*>cameraListTemp; for(int i=0;i<DevicesName.size();i++) { int j=0; while(j<cameraList.size()) { if(DevicesName[i]==cameraList[j]->getDeviceName()) { cameraListTemp.push_back(cameraList[j]); break; } j++; } if(j==cameraList.size()) { camera* newcamera=new camera(DevicesName[i]); cameraListTemp.push_back(newcamera); } } cameraList=cameraListTemp; } int dhx64::getCameraIndex(QString devicename) { for(int i=0;i<DevicesName.size();i++) { if(devicename==DevicesName[i]) return i+1; } return 0; } camera* dhx64::getACameraInList(QString devicename) { for(int i=0;i<cameraList.size();i++) { if(cameraList[i]->getDeviceName()==devicename) return cameraList[i]; } return NULL; } void dhx64::resizeEvent(QResizeEvent*event) { diaplayImage(); } void dhx64::displayLeftImage(Mat *img) { imgL=QImage(img->data,img->cols,img->rows,QImage::Format::Format_RGB888); int h=ui.labelLeft->height(); int w=ui.labelLeft->width(); QImage scaledImage=imgL.scaled(w,h,Qt::KeepAspectRatio); ui.labelLeft->setPixmap(QPixmap::fromImage(scaledImage)); ui.labelLeft->show(); } void dhx64::displayRightImage(Mat *img) { imgR=QImage(img->data,img->cols,img->rows,QImage::Format::Format_RGB888); int h=ui.labelRight->height(); int w=ui.labelRight->width(); QImage scaledImage=imgR.scaled(w,h,Qt::KeepAspectRatio); ui.labelRight->setPixmap(QPixmap::fromImage(scaledImage)); ui.labelRight->show(); //ui.labelLeft->setPixmap(QPixmap::fromImage(scaledImage)); //ui.labelRight->show(); } void dhx64::diaplayImage() { displayBusy=true; if(imL->empty()==false) { displayLeftImage(imL); if(cameraList.isEmpty()==false) cameraList[0]->needDisplay=false; } if(imR->empty()==false) { displayRightImage(imR); if(cameraList.size()>1) cameraList[1]->needDisplay=false; } displayBusy=false; } void __stdcall dhx64::OnFrameCallbackFun_Left(GX_FRAME_CALLBACK_PARAM* pFrame) { if(pFrame->status!=0) { return; } dhx64 *pf = (dhx64*)(pFrame->pUserParam); if(pf->displayBusy==true)return; camera* currentCamera=pf->getACameraInList(pf->DevicesName[0]); BYTE* m_pImgRGBBuffer=currentCamera->imageInfo.ImgRGBBuffer; BYTE* pImgRaw8Buffer=currentCamera->imageInfo.ImgRaw8Buffer; int64_t m_nImageWidth=currentCamera->imageInfo.ImageWidth; int64_t m_nImageHeight=currentCamera->imageInfo.ImageHeight; int64_t m_nPixelFormat=currentCamera->imageInfo.PixelFormat; int64_t nPixelColorFilter=currentCamera->imageInfo.PixelColorFilter; //对图像进行某些操作 //首先将回调中输出的图像数据，处理成RGB数据，以备后面的显示和存储 ProcessData((BYTE*)pFrame->pImgBuf, m_pImgRGBBuffer,pImgRaw8Buffer, m_nImageWidth, m_nImageHeight,m_nPixelFormat,nPixelColorFilter); pf->imL->create(m_nImageHeight,m_nImageWidth,CV_8UC3); //pf->imL->data=m_pImgRGBBuffer; currentCamera->imageInfo.Image->data=m_pImgRGBBuffer; pf->imL->data=currentCamera->imageInfo.Image->data; flip(*currentCamera->imageInfo.Image,*currentCamera->imageInfo.Image,0); cvtColor(*currentCamera->imageInfo.Image,*currentCamera->imageInfo.grayImg,CV_BGR2GRAY); currentCamera->needDisplay=true; for(int i=0;i<pf->cameraList.size();i++) { if(pf->cameraList[i]->needDisplay==false) { return; } } pf->diaplayImage(); //pf->displayLeftImage(currentCamera); return; } void __stdcall dhx64::OnFrameCallbackFun_Right(GX_FRAME_CALLBACK_PARAM* pFrame) { if(pFrame->status!=0) { return; } dhx64 *pf = (dhx64*)(pFrame->pUserParam); if(pf->displayBusy==true)return; camera* currentCamera=pf->getACameraInList(pf->DevicesName[1]); BYTE* m_pImgRGBBuffer=currentCamera->imageInfo.ImgRGBBuffer; BYTE* pImgRaw8Buffer=currentCamera->imageInfo.ImgRaw8Buffer; int64_t m_nImageWidth=currentCamera->imageInfo.ImageWidth; int64_t m_nImageHeight=currentCamera->imageInfo.ImageHeight; int64_t m_nPixelFormat=currentCamera->imageInfo.PixelFormat; int64_t nPixelColorFilter=currentCamera->imageInfo.PixelColorFilter; //对图像进行某些操作 //首先将回调中输出的图像数据，处理成RGB数据，以备后面的显示和存储 ProcessData((BYTE*)pFrame->pImgBuf, m_pImgRGBBuffer,pImgRaw8Buffer, m_nImageWidth, m_nImageHeight,m_nPixelFormat,nPixelColorFilter); pf->imR->create(m_nImageHeight,m_nImageWidth,CV_8UC3); currentCamera->imageInfo.Image->data=m_pImgRGBBuffer; pf->imR->data=currentCamera->imageInfo.Image->data; flip(*currentCamera->imageInfo.Image,*currentCamera->imageInfo.Image,0); cvtColor(*currentCamera->imageInfo.Image,*currentCamera->imageInfo.grayImg,CV_BGR2GRAY); //imshow("imgR",*currentCamera->imageInfo.Image); //cvWaitKey(100); currentCamera->needDisplay=true; for(int i=0;i<pf->cameraList.size();i++) { if(pf->cameraList[i]->needDisplay==false) { return; } } pf->diaplayImage(); //pf->displayRightImage(currentCamera); return; } static void ProcessData(BYTE *pImageBuf, BYTE *pImageRGBBuf,BYTE* m_pImgRaw8Buffer, int64_t nImageWidth, int64_t nImageHeight,int64_t m_nPixelFormat,int64_t m_nPixelColorFilter) { switch(m_nPixelFormat) { //当数据格式为12位时，位数转换为4-11 case GX_PIXEL_FORMAT_BAYER_GR12: case GX_PIXEL_FORMAT_BAYER_RG12: case GX_PIXEL_FORMAT_BAYER_GB12: case GX_PIXEL_FORMAT_BAYER_BG12: //将12位格式的图像转换为8位格式 DxRaw16toRaw8(pImageBuf, m_pImgRaw8Buffer, (VxUint32)nImageWidth, (VxUint32)nImageHeight, DX_BIT_4_11); //将Raw8图像转换为RGB图像以供显示 DxRaw8toRGB24(m_pImgRaw8Buffer,pImageRGBBuf, (VxUint32)nImageWidth, (VxUint32)nImageHeight, RAW2RGB_NEIGHBOUR, DX_PIXEL_COLOR_FILTER(m_nPixelColorFilter), TRUE); break; //当数据格式为12位时，位数转换为2-9 case GX_PIXEL_FORMAT_BAYER_GR10: case GX_PIXEL_FORMAT_BAYER_RG10: case GX_PIXEL_FORMAT_BAYER_GB10: case GX_PIXEL_FORMAT_BAYER_BG10: ////将12位格式的图像转换为8位格式,有效位数2-9 DxRaw16toRaw8(pImageBuf, m_pImgRaw8Buffer, (VxUint32)nImageWidth, (VxUint32)nImageHeight, DX_BIT_2_9); //将Raw8图像转换为RGB图像以供显示 DxRaw8toRGB24(m_pImgRaw8Buffer, pImageRGBBuf, (VxUint32)nImageWidth, (VxUint32)nImageHeight, RAW2RGB_NEIGHBOUR, DX_PIXEL_COLOR_FILTER(m_nPixelColorFilter), TRUE); break; case GX_PIXEL_FORMAT_BAYER_GR8: case GX_PIXEL_FORMAT_BAYER_RG8: case GX_PIXEL_FORMAT_BAYER_GB8: case GX_PIXEL_FORMAT_BAYER_BG8: //将Raw8图像转换为RGB图像以供显示 DxRaw8toRGB24(pImageBuf, pImageRGBBuf, (VxUint32)nImageWidth, (VxUint32)nImageHeight, RAW2RGB_NEIGHBOUR, DX_PIXEL_COLOR_FILTER(m_nPixelColorFilter), TRUE); break; case GX_PIXEL_FORMAT_MONO12: //将12位格式的图像转换为8位格式 DxRaw16toRaw8(pImageBuf, m_pImgRaw8Buffer, (VxUint32)nImageWidth, (VxUint32)nImageHeight, DX_BIT_4_11); //将Raw8图像转换为RGB图像以供显示 DxRaw8toRGB24(m_pImgRaw8Buffer, pImageRGBBuf, (VxUint32)nImageWidth, (VxUint32)nImageHeight, RAW2RGB_NEIGHBOUR, DX_PIXEL_COLOR_FILTER(NONE), TRUE); break; case GX_PIXEL_FORMAT_MONO10: //将10位格式的图像转换为8位格式 DxRaw16toRaw8(pImageBuf, m_pImgRaw8Buffer, (VxUint32)nImageWidth, (VxUint32)nImageHeight, DX_BIT_4_11); //将Raw8图像转换为RGB图像以供显示 DxRaw8toRGB24(m_pImgRaw8Buffer, pImageRGBBuf, (VxUint32)nImageWidth, (VxUint32)nImageHeight, RAW2RGB_NEIGHBOUR, DX_PIXEL_COLOR_FILTER(NONE), TRUE); break; case GX_PIXEL_FORMAT_MONO8: //将Raw8图像转换为RGB图像以供显示 DxRaw8toRGB24(pImageBuf, pImageRGBBuf, (VxUint32)nImageWidth, (VxUint32)nImageHeight, RAW2RGB_NEIGHBOUR, DX_PIXEL_COLOR_FILTER(NONE), TRUE); break; default: break; } }

[ "sunxiaofei4200426@163.com" ]

sunxiaofei4200426@163.com

eb154c255cdcfe37aa9246779f388d799cce7bc2

fec81bfe0453c5646e00c5d69874a71c579a103d

/blazetest/src/mathtest/operations/smatsmatadd/MZaUCa.cpp

6b9749a436be8d266051e79ec7cc199f08805164

[ "BSD-3-Clause" ]

permissive

parsa/blaze

801b0f619a53f8c07454b80d0a665ac0a3cf561d

6ce2d5d8951e9b367aad87cc55ac835b054b5964

refs/heads/master

2022-09-19T15:46:44.108364

2022-07-30T04:47:03

105,918,096

52

7

null

UTF-8

C++

false

4,165

cpp

//================================================================================================= /*! // \file src/mathtest/operations/smatsmatadd/MZaUCa.cpp // \brief Source file for the MZaUCa sparse matrix/sparse matrix addition math test // // Copyright (C) 2012-2020 Klaus Iglberger - All Rights Reserved // // This file is part of the Blaze library. You can redistribute it and/or modify it under // the terms of the New (Revised) BSD License. Redistribution and use in source and binary // forms, with or without modification, are permitted provided that the following conditions // are met: // // 1. Redistributions of source code must retain the above copyright notice, this list of // conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright notice, this list // of conditions and the following disclaimer in the documentation and/or other materials // provided with the distribution. // 3. Neither the names of the Blaze development group nor the names of its contributors // may be used to endorse or promote products derived from this software without specific // prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES // OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT // SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, // INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED // TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR // BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN // ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH // DAMAGE. */ //================================================================================================= //************************************************************************************************* // Includes //************************************************************************************************* #include <cstdlib> #include <iostream> #include <blaze/math/CompressedMatrix.h> #include <blaze/math/UpperMatrix.h> #include <blaze/math/ZeroMatrix.h> #include <blazetest/mathtest/Creator.h> #include <blazetest/mathtest/operations/smatsmatadd/OperationTest.h> #include <blazetest/system/MathTest.h> #ifdef BLAZE_USE_HPX_THREADS # include <hpx/hpx_main.hpp> #endif //================================================================================================= // // MAIN FUNCTION // //================================================================================================= //************************************************************************************************* int main() { std::cout << " Running 'MZaUCa'..." << std::endl; using blazetest::mathtest::TypeA; try { // Matrix type definitions using MZa = blaze::ZeroMatrix<TypeA>; using UCa = blaze::UpperMatrix< blaze::CompressedMatrix<TypeA> >; // Creator type definitions using CMZa = blazetest::Creator<MZa>; using CUCa = blazetest::Creator<UCa>; // Running tests with small matrices for( size_t i=0UL; i<=6UL; ++i ) { for( size_t j=0UL; j<=UCa::maxNonZeros( i ); ++j ) { RUN_SMATSMATADD_OPERATION_TEST( CMZa( i, i ), CUCa( i, j ) ); } } // Running tests with large matrices RUN_SMATSMATADD_OPERATION_TEST( CMZa( 67UL, 67UL ), CUCa( 67UL, 13UL ) ); RUN_SMATSMATADD_OPERATION_TEST( CMZa( 128UL, 128UL ), CUCa( 128UL, 8UL ) ); } catch( std::exception& ex ) { std::cerr << "\n\n ERROR DETECTED during sparse matrix/sparse matrix addition:\n" << ex.what() << "\n"; return EXIT_FAILURE; } return EXIT_SUCCESS; } //*************************************************************************************************

[ "klaus.iglberger@gmail.com" ]

klaus.iglberger@gmail.com

1989e0d90b0dde13be4053ddbb749adedb77afaa

664197987357e2bb32ac16527c4db2ef80801994

/Project_Warm_Steel.Altis/tf47CoreScripts/tf47CfgFunctions.hpp

6820dc3f8c57e2b466dea862f0ff419724de8d21

[]

no_license

TaskForce47/Project-Warm-Steel

447e9cbe2dd64ae9d1f889640170355f70436092

e98f48e9dfa5f1ef4f19443378ce9737c147392e

refs/heads/master

2021-01-11T21:27:32.748700

2016-04-19T10:37:43

78,788,543

0

null

UTF-8

C++

false

570

hpp

/* * include in existing CfgFunctions class */ //class cfgFunctions{ class tf47 { tag = "tf47"; //class CoreScripts { // file = "tf47CoreScripts"; //}; class Whitelist { file = "tf47CoreScripts"; //class vehicleOnEnter; class addGetInEvent; class addGetOutEvent; }; class Helpers { file = "tf47CoreScripts\helper"; class allowDamage; class setDamage; class setFuel; class lock; class setVehicleVarName; class callVehicleRespawn; class changePlayerSide; class isStable; class markerInitWaiter; }; }; //};

[ "4lucke@gmail.com" ]

4lucke@gmail.com

9611156ff9f6e72d26799b80c76b679bfd8b69d0

3ce6064281cfcbf3b40c5b2a907847e32ba6add8

/src/Game/CResult.cpp

1b652592ef4a0945f2574ebccdf94d2452084456

[]

no_license

xvatic/CounterStrike-DuelMode

9986b633b27a98885f782315f3b0dd4bb12fe58d

cdd748ebc63450d2441433760ac388c840c2c0c2

refs/heads/main

2023-06-05T01:06:33.106560

2021-07-01T16:12:15

382,090,140

0

null

UTF-8

C++

false

3,233

cpp

#include "CResult.h" void CResult::cleanFile (const std::string & path) { std::ofstream ofs; ofs.open(path, std::ofstream::out | std::ofstream::trunc); ofs.close(); } bool is_digits(const std::string & str) { return str.find_first_not_of("0123456789") == std::string::npos; } void CResult::fetchResultsFromFile() { std::multimap<int, std::pair<std::string, std::pair <int,int>>> rawData; std::ifstream is; std::string path = "examples/Records.txt"; is.open(path); if (!is.is_open()) { return; } std::string bufferString; while (getline(is, bufferString)) { std::stringstream ss(bufferString); std::string bufferNickname, bufferPlayerScore, bufferEnemyScore; getline(ss, bufferNickname, ':'); getline(ss, bufferPlayerScore, ':'); getline(ss, bufferEnemyScore, ':'); if (is.bad()) { is.close(); return; } if (!is_digits(bufferPlayerScore) || !is_digits(bufferEnemyScore) || bufferNickname.size() > 10 || bufferNickname.empty() || bufferPlayerScore.size() > 3 || bufferEnemyScore.size() > 3 || bufferEnemyScore.empty() || bufferPlayerScore.empty()) { is.close(); cleanFile(path); return; } if (std::stoi(bufferPlayerScore) > 3 || std::stoi(bufferPlayerScore) < 0 || std::stoi(bufferEnemyScore) > 3 || std::stoi(bufferEnemyScore) < 0) { is.close(); cleanFile(path); return; } rawData.insert(std::make_pair(std::stoi(bufferPlayerScore)- std::stoi(bufferEnemyScore), std::make_pair(bufferNickname, std::make_pair(std::stoi(bufferPlayerScore), std::stoi(bufferEnemyScore))))); } is.close(); scoreboard = rawData; successfullyFetched = true; } void CResult::updateFile() { std::string path = "examples/Records.txt"; cleanFile(path); std::ofstream os; os.open(path); if (!os.is_open()) { return; } std::multimap<int, std::pair<std::string, std::pair <int,int>>>::iterator iterator; iterator = scoreboard.begin(); while (true){ os << iterator->second.first << ":" << iterator->second.second.first << ":" << iterator->second.second.second; iterator++; if (os.bad()) { os.close(); return; } if (iterator == scoreboard.end()) { break; } else { os << std::endl; } } successfullyFetched = true; os.close(); } int CResult::getPlayerScore() const { return playerScore; } void CResult::setPlayerScore(int score) { playerScore = score; } int CResult::getEnemyScore() const { return enemyScore; } void CResult::setEnemyScore(int score) { enemyScore = score; } bool CResult::isSuccessfullyFetched() const { return successfullyFetched; } void CResult::resetFetchFlag() { successfullyFetched = false; } void CResult::appendScoreboard(std::pair<int, std::pair<std::string, std::pair<int,int>>> result) { scoreboard.insert(result); } std::multimap<int, std::pair<std::string, std::pair<int,int>>> CResult::getScoreboard() const { return scoreboard; } CResult::CResult() = default;

[ "glazkovE@gmail.com" ]

glazkovE@gmail.com

c2ff21992f2ffff1fc6986f0ba11b8f8b4135b6b

163bad17c2ba0aeeb05e29d1a7f870e675ee28eb

/hikyuu_cpp/hikyuu/indicator/imp/IDiff.cpp

739e3575a902e608d6e0ac0f447ed55949fee0ff

[ "MIT", "LicenseRef-scancode-unknown-license-reference" ]

permissive

fasiondog/hikyuu

8b7bc4fd99ff915c621586a480c3663ef3fae464

86b0fa5b0e847d9a04905bca93660a7a33fc9fc2

refs/heads/master

2023-09-03T15:04:33.983389

2023-09-03T11:17:46

5,103,141

1,884

547

MIT

2023-09-06T16:53:51

2012-07-18T23:21:42

C++

UTF-8

C++

false

756

cpp

/* * IDiff.cpp * * Created on: 2013-4-18 * Author: fasiondog */ #include "IDiff.h" #if HKU_SUPPORT_SERIALIZATION BOOST_CLASS_EXPORT(hku::IDiff) #endif namespace hku { IDiff::IDiff() : IndicatorImp("DIFF", 1) {} IDiff::~IDiff() {} bool IDiff::check() { return true; } void IDiff::_calculate(const Indicator& data) { size_t total = data.size(); m_discard = data.discard() + 1; if (total <= m_discard) { m_discard = total; return; } for (size_t i = discard(); i < total; ++i) { _set(data[i] - data[i - 1], i); } } Indicator HKU_API DIFF() { return Indicator(make_shared<IDiff>()); } Indicator HKU_API DIFF(const Indicator& data) { return DIFF()(data); } } /* namespace hku */

[ "fasiondog@163.com" ]

fasiondog@163.com

a4c5ca1f0fa1a0419202f026052dcdd06ccbae40

01cbbfd33025d90c47d44bee5c9293abef008218

/Online Judges/atCoder/atcoder beginner contests/171/a.cpp

f03e27c8a73a561b02e71524b0a07e4549e84cbb

[]

no_license

trifiasco/CPPS

a07c8ec5e897f0f35b139d824b2e9dab776ee99e

9ba955989768cc327c8b1ef0afd1be7730f65685

refs/heads/master

2021-09-24T02:23:52.571710

2021-09-21T17:27:15

124,777,024

1

0

null

UTF-8

C++

false

3,555

cpp

#pragma comment(linker, "/stack:640000000") #include <algorithm> #include <bitset> #include <cassert> #include <cctype> #include <climits> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <fstream> #include <iostream> #include <iomanip> #include <iterator> #include <list> #include <map> #include <numeric> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <utility> #include <vector> using namespace std; const double EPS = 1e-9; const int INF = 0x7f7f7f7f; const double PI=acos(-1.0); #define READ(f) freopen(f, "r", stdin) #define WRITE(f) freopen(f, "w", stdout) #define MP(x, y) make_pair(x, y) #define PB(x) push_back(x) #define rep(i,n) for(int i = 1 ; i<=(n) ; i++) #define repI(i,n) for(int i = 0 ; i<(n) ; i++) #define FOR(i,L,R) for (int i = L; i <= R; i++) #define ROF(i,L,R) for (int i = L; i >= R; i--) #define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++) #define ALL(p) p.begin(),p.end() #define ALLR(p) p.rbegin(),p.rend() #define SET(p) memset(p, -1, sizeof(p)) #define CLR(p) memset(p, 0, sizeof(p)) #define MEM(p, v) memset(p, v, sizeof(p)) #define getI(a) scanf("%d", &a) #define getII(a,b) scanf("%d%d", &a, &b) #define getIII(a,b,c) scanf("%d%d%d", &a, &b, &c) #define getL(a) scanf("%lld",&a) #define getLL(a,b) scanf("%lld%lld",&a,&b) #define getLLL(a,b,c) scanf("%lld%lld%lld",&a,&b,&c) #define getC(n) scanf("%c",&n) #define getF(n) scanf("%lf",&n) #define getS(n) scanf("%s",n) #define bitCheck(N,in) ((bool)(N&(1<<(in)))) #define bitOff(N,in) (N&(~(1<<(in)))) #define bitOn(N,in) (N|(1<<(in))) #define iseq(a,b) (fabs(a-b)<EPS) #define ff first #define ss second #define ll long long #define ull unsigned long long typedef pair<int,int>pii; typedef vector<pii>vpii; typedef vector<int>vi; typedef vector<vi>vii; template< class T > inline T _abs(T n) { return ((n) < 0 ? -(n) : (n)); } template< class T > inline T _max(T a, T b) { return (!((a)<(b))?(a):(b)); } template< class T > inline T _min(T a, T b) { return (((a)<(b))?(a):(b)); } template< class T > inline T _swap(T &a, T &b) { a=a^b;b=a^b;a=a^b;} template< class T > inline T gcd(T a, T b) { return (b) == 0 ? (a) : gcd((b), ((a) % (b))); } template< class T > inline T lcm(T a, T b) { return ((a) / gcd((a), (b)) * (b)); } template <typename T> string NumberToString ( T Number ) { ostringstream ss; ss << Number; return ss.str(); } #ifdef howcum #define debug(args...) {cerr<<"Debug: "; dbg,args; cerr<<endl;} #else #define debug(args...) // Just strip off all debug tokens #endif struct debugger{ template<typename T> debugger& operator , (const T& v){ cerr<<v<<" "; return *this; } }dbg; //// 4 direction //int dx[]={-1,1,0,0}; //int dy[]={0,0,-1,1}; // //// 8 direction //int dx[]={-1,1,0,0,-1,-1,1,1}; //int dy[]={0,0,-1,1,-1,1,1,-1}; // //// horse //int dx[] = {-2,-2,2,2,-1,-1,1,1}; //int dy[] = {1,-1,-1,1,2,-2,-2,2}; int main() { #ifndef howcum READ("in"); WRITE("out"); #endif // howcum // ios_base::sync_with_stdio(0); cin.tie(0); char c; while(cin>>c) { if(c >= 65 && c <= 90) { cout << 'A' << endl; } else cout << 'a' << endl; } return 0; }

[ "trifiasco@gmail.com" ]

trifiasco@gmail.com

8fc2b3b9b7757bf1b2043bc99c6cb1b40a0c4b06

34aa58efb0bd2908b6a89b97e02947f6ab5523f2

/server/系统模块/客户端组件/图形类库/Control/UIWkeBrowser.h

ab8face56e205721e80dc76b660123c960566616

[]

no_license

aywlcn/whdlm

8e6c9901aed369658f0a7bb657f04fd13df5802e

86d0d2edb98ce8a8a09378cabfda4fc357c7cdd2

refs/heads/main

2023-05-28T14:12:50.150854

2021-06-11T10:50:58

380,582,203

1

0

null

2021-06-26T19:31:50

2021-06-26T19:31:49

null

GB18030

C++

false

2,367

h

#ifndef __WKE_BROWSER_H__ #define __WKE_BROWSER_H__ #pragma once /////////////////////////////////////////// //网页加载状态改变的回调 class CWkeWebkitLoadCallback { public: virtual void OnLoadFailed()=0; virtual void OnLoadComplete()=0; virtual void OnDocumentReady()=0; }; /////////////////////////////////////////// //网页标题、地址改变的回调 class CWkeWebkitClientCallback { public: virtual void OnTitleChange(const CStdString& strTitle)=0; virtual void OnUrlChange(const CStdString& strUrl)=0; }; //////////////////////////////////////// class FGUI_LIB_CLASS CWkeBrowserUI : public CControlUI/*,public wkeBufHandler */ { public: CWkeBrowserUI(void); ~CWkeBrowserUI(void); virtual LPCTSTR GetClass()const; virtual LPVOID GetInterface(LPCTSTR pstrName); virtual void DoEvent(TEventUI& event); virtual void DoPaint(HDC hDC, const RECT& rcPaint); virtual void SetPos(RECT rc); virtual void DoInit(); virtual void SetAttribute(LPCTSTR pstrName, LPCTSTR pstrValue); ////////////////////////////////////// const wstring& GetUrl()const ; bool CanGoBack() const; bool GoBack(); bool CanGoForward() const; bool GoForward(); void StopLoad(); void Refresh(); wkeWebView GetWebView(); void SetLoadCallback(CWkeWebkitLoadCallback* pCallback); CWkeWebkitLoadCallback* GetLoadCallback(); void Navigate(LPCTSTR lpUrl); void LoadFile(LPCTSTR lpFile); void LoadHtml(LPCTSTR lpHtml); wstring RunJS(wstring strValue); static void JSBindFunction(const char* name, jsNativeFunction fn, unsigned int argCount); static LPCTSTR JSBindGetArg( jsExecState es,int index); protected: void StartCheckThread(); void StopCheckThread(); static void OnPaintUpdated(wkeWebView webView, void* param, const void* hdc, int x, int y, int cx, int cy); static void OnTitleChange(const struct _wkeClientHandler* clientHandler, const wkeString title); static void OnUrlChange(const struct _wkeClientHandler* clientHandler, const wkeString url); private: static int m_bWebkitCount; HANDLE m_hCheckThread; wstring m_strUrl; wkeWebView m_pWebView; CWkeWebkitLoadCallback* m_pLoadCallback; CWkeWebkitClientCallback* m_pClientCallback; }; #endif

[ "494294315@qq.com" ]

494294315@qq.com

94ef3a0d8aa9dd29f1dc62e9b37c2685a0ddc208

e5f74db2b079783fbf923826e3ee0d061849a889

/Code/GeometryWidgets/dialogCreateCone.cpp

01309a920680383e066abf73f92cd723d986d9b9

[ "BSD-3-Clause" ]

permissive

sunhan01/FastCAE

57b6ba145864978ffcc57dd4721a17d4b6c350f8

4e9e9aa1cc076bc3ba5d7823fb61e5b0a9dc2e72

refs/heads/master

2023-02-12T14:56:52.414267

2021-01-11T05:43:42

null

0

null

UTF-8

C++

false

5,312

cpp

#include "dialogCreateCone.h" #include "ui_dialogCreateCone.h" #include "geometry/geometrySet.h" #include "geoPointWidget.h" #include "GeometryCommand/GeoCommandList.h" #include "GeometryCommand/GeoCommandCreateCone.h" #include "geometry/geometryParaCone.h" #include <QMessageBox> #include "python/PyAgent.h" #include <math.h> namespace GeometryWidget { CreateConeDialog::CreateConeDialog(GUI::MainWindow* m, MainWidget::PreWindow* p) : GeoDialogBase(m, p) { _ui = new Ui::CreateCone; _ui->setupUi(this); init(); connect(_ui->radioButtonUser, SIGNAL(toggled(bool)), this, SLOT(on_radioButtonUser())); } CreateConeDialog::CreateConeDialog(GUI::MainWindow*m, MainWidget::PreWindow*p, Geometry::GeometrySet*set) : GeoDialogBase(m, p) { _ui = new Ui::CreateCone; _ui->setupUi(this); _isEdit = true; _editSet = set; this->setWindowTitle("Edit Cone"); init(); connect(_ui->radioButtonUser, SIGNAL(toggled(bool)), this, SLOT(on_radioButtonUser())); } CreateConeDialog::~CreateConeDialog() { if (_ui != nullptr) delete _ui; } // void CreateConeDialog::closeEvent(QCloseEvent *e) // { // QDialog::closeEvent(e); // delete this; // } void CreateConeDialog::init() { _pw = new GeoPointWidget(_mainWindow, _preWindow); _ui->verticalLayout->addWidget(_pw); on_radioButtonUser(); this->translateButtonBox(_ui->buttonBox); if (!_isEdit) { int id = Geometry::GeometrySet::getMaxID() + 1; _ui->namelineEdit->setPlaceholderText(QString("Cone_%1").arg(id)); } else { if (_editSet == nullptr) return; _ui->namelineEdit->setText(_editSet->getName()); _ui->namelineEdit->setEnabled(false); Geometry::GeometryModelParaBase* pb = _editSet->getParameter(); Geometry::GeometryParaCone* p = dynamic_cast<Geometry::GeometryParaCone*>(pb); if (p == nullptr) return; double loc[3] = { 0.0 }, radius1 = { 0.0 }, radius2 = {0.0},length = { 0.0 }, dir[3] = { 0.0 }; p->getLocation(loc); p->getRadius1(&radius1); p->getRadius2(&radius2); p->getLength(&length); p->getDirection(dir); _pw->setCoordinate(loc); _ui->doubleSpinBoxR->setValue(radius1); _ui->doubleSpinBoxR2->setValue(radius2); _ui->doubleSpinBoxL->setValue(length); if (dir[0] != 0 && dir[1] == 0 && dir[2] == 0) { _ui->radioButtonX->setChecked(true); } else if (dir[0] == 0 && dir[1] != 0 && dir[2] == 0) { _ui->radioButtonY->setChecked(true); } else if (dir[0] == 0 && dir[1] == 0 && dir[2] != 0) { _ui->radioButtonZ->setChecked(true); } else { _ui->radioButtonUser->setChecked(true); _ui->doubleSpinBoxX->setVisible(true); _ui->doubleSpinBoxY->setVisible(true); _ui->doubleSpinBoxZ->setVisible(true); _ui->doubleSpinBoxX->setValue(dir[0]); _ui->doubleSpinBoxY->setValue(dir[1]); _ui->doubleSpinBoxZ->setValue(dir[2]); } } } void CreateConeDialog::reject() { QDialog::reject(); this->close(); } void CreateConeDialog::accept() { double corner[3] = { 0.0 }; bool ok = _pw->getCoordinate(corner); QString name = _ui->namelineEdit->text(); if (name.isEmpty()) name = _ui->namelineEdit->placeholderText(); if (ok) ok = !name.isEmpty(); double r = _ui->doubleSpinBoxR->value(); double r2 = _ui->doubleSpinBoxR2->value(); if (fabs(r - r2) < 1e-6) { QMessageBox::warning(this, tr("Warning"), tr("The two radii are equal!")); return; } double l = _ui->doubleSpinBoxL->value(); if (ok && l < 1e-6) ok = false; if (!ok) { QMessageBox::warning(this, tr("Warning"), tr("Input Wrong !")); return; } double dir[3] = { 0.0 }; if (_ui->radioButtonX->isChecked()) dir[0] = 1.0; else if (_ui->radioButtonY->isChecked()) dir[1] = 1.0; else if (_ui->radioButtonZ->isChecked()) dir[2] = 1.0; else { dir[0] = _ui->doubleSpinBoxX->value(); dir[1] = _ui->doubleSpinBoxY->value(); dir[2] = _ui->doubleSpinBoxZ->value(); } /*Command::GeoCommandCreateCone* command = new Command::GeoCommandCreateCone(_mainWindow, _preWindow); command->setLocation(corner); command->setAxis(dir); command->setRadius(r, r2); command->setLength(l); command->setName(name); if (_isEdit) command->setEditData(_editSet); bool success = Command::GeoComandList::getInstance()->executeCommand(command); if (!success) { QMessageBox::warning(this, tr("Warning"), tr("Create failed ! ")); return; }*/ QStringList codes{}; codes += QString("cone = CAD.Cone()"); if (_isEdit) codes += QString("cone.setEditID(%1)").arg(_editSet->getID()); else codes += QString("cone.setName('%1')").arg(name); codes += QString("cone.setLocation(%1,%2,%3)").arg(corner[0]).arg(corner[1]).arg(corner[2]); codes += QString("cone.setRadius(%1,%2)").arg(r).arg(r2); codes += QString("cone.setLength(%1)").arg(l); codes += QString("cone.setAxis(%1,%2,%3)").arg(dir[0]).arg(dir[1]).arg(dir[2]); if (_isEdit) codes += QString("cone.edit()"); else codes += QString("cone.create()"); _pyAgent->submit(codes); QDialog::accept(); this->close(); } void CreateConeDialog::on_radioButtonUser() { bool checked = _ui->radioButtonUser->isChecked(); _ui->doubleSpinBoxX->setVisible(checked); _ui->doubleSpinBoxY->setVisible(checked); _ui->doubleSpinBoxZ->setVisible(checked); } }

[ "libaojunqd@foxmail.com" ]

libaojunqd@foxmail.com

f8bca23226fb87dcffd6589058d7481b4f1191c0

188fb8ded33ad7a2f52f69975006bb38917437ef

/Fluid/processor5/0.07/polyMesh/points

82d9ba553cb8e62f48994cc5a6df16e3dafe642b

[]

no_license

abarcaortega/Tuto_2

34a4721f14725c20471ff2dc8d22b52638b8a2b3

4a84c22efbb9cd2eaeda92883343b6910e0941e2

refs/heads/master

2020-08-05T16:11:57.674940

2019-10-04T09:56:09

212,573,883

0

null

UTF-8

C++

false

22,460

/*--------------------------------*- C++ -*----------------------------------*\ | ========= | | | \\ / F ield | OpenFOAM: The Open Source CFD Toolbox | | \\ / O peration | Version: dev | | \\ / A nd | Web: www.OpenFOAM.org | | \\/ M anipulation | | \*---------------------------------------------------------------------------*/ FoamFile { version 2.0; format ascii; class vectorField; location "0.07/polyMesh"; object points; } // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * // 1034 ( (0.812534 0.3 0) (0.899047 0.3 0) (0.987634 0.3 0) (1.07834 0.3 0) (1.17122 0.3 0) (1.26633 0.3 0) (1.36372 0.3 0) (1.46345 0.3 0) (1.56557 0.3 0) (1.67015 0.3 0) (1.77723 0.3 0) (1.88689 0.3 0) (1.99917 0.3 0) (2.11416 0.3 0) (2.2319 0.3 0) (2.35246 0.3 0) (2.47591 0.3 0) (2.60232 0.3 0) (2.73176 0.3 0) (2.86429 0.3 0) (3 0.3 0) (0.812545 0.3 0.0667401) (0.899057 0.3 0.0667506) (0.987641 0.3 0.0667595) (1.07835 0.3 0.0667666) (1.17123 0.3 0.0667719) (1.26634 0.3 0.0667752) (1.36373 0.3 0.0667768) (1.46346 0.3 0.0667767) (1.56558 0.3 0.0667751) (1.67015 0.3 0.066772) (1.77723 0.3 0.0667678) (1.88689 0.3 0.0667624) (1.99918 0.3 0.0667559) (2.11416 0.3 0.0667485) (2.2319 0.3 0.0667401) (2.35246 0.3 0.0667307) (2.47591 0.3 0.0667203) (2.60232 0.3 0.0667089) (2.73176 0.3 0.0666961) (2.86429 0.3 0.066682) (3 0.3 0.0666667) (0.812579 0.3 0.133483) (0.899086 0.3 0.133503) (0.987665 0.3 0.133521) (1.07837 0.3 0.133535) (1.17124 0.3 0.133545) (1.26635 0.3 0.133552) (1.36374 0.3 0.133554) (1.46346 0.3 0.133554) (1.56558 0.3 0.133551) (1.67015 0.3 0.133544) (1.77724 0.3 0.133536) (1.88689 0.3 0.133525) (1.99918 0.3 0.133512) (2.11416 0.3 0.133497) (2.2319 0.3 0.13348) (2.35246 0.3 0.133461) (2.47591 0.3 0.133441) (2.60232 0.3 0.133418) (2.73176 0.3 0.133392) (2.86429 0.3 0.133364) (3 0.3 0.133333) (0.812635 0.3 0.20023) (0.899132 0.3 0.20026) (0.987703 0.3 0.200286) (1.0784 0.3 0.200306) (1.17127 0.3 0.200321) (1.26637 0.3 0.20033) (1.36375 0.3 0.200334) (1.46347 0.3 0.200332) (1.56559 0.3 0.200327) (1.67016 0.3 0.200317) (1.77724 0.3 0.200304) (1.88689 0.3 0.200287) (1.99918 0.3 0.200268) (2.11416 0.3 0.200245) (2.2319 0.3 0.20022) (2.35246 0.3 0.200192) (2.47591 0.3 0.200161) (2.60232 0.3 0.200126) (2.73176 0.3 0.200088) (2.86429 0.3 0.200046) (3 0.3 0.2) (0.812711 0.3 0.266984) (0.899195 0.3 0.267024) (0.987754 0.3 0.267057) (1.07844 0.3 0.267083) (1.1713 0.3 0.267101) (1.26639 0.3 0.267112) (1.36377 0.3 0.267115) (1.46349 0.3 0.267113) (1.5656 0.3 0.267104) (1.67017 0.3 0.267091) (1.77725 0.3 0.267072) (1.8869 0.3 0.26705) (1.99918 0.3 0.267023) (2.11416 0.3 0.266993) (2.2319 0.3 0.266959) (2.35246 0.3 0.266922) (2.47591 0.3 0.26688) (2.60232 0.3 0.266835) (2.73176 0.3 0.266784) (2.86429 0.3 0.266728) (3 0.3 0.266667) (0.812804 0.3 0.333749) (0.899272 0.3 0.333797) (0.987816 0.3 0.333836) (1.07849 0.3 0.333866) (1.17134 0.3 0.333886) (1.26642 0.3 0.333897) (1.36379 0.3 0.3339) (1.46351 0.3 0.333895) (1.56561 0.3 0.333883) (1.67018 0.3 0.333865) (1.77725 0.3 0.333841) (1.8869 0.3 0.333813) (1.99918 0.3 0.333779) (2.11416 0.3 0.333741) (2.2319 0.3 0.333699) (2.35246 0.3 0.333652) (2.47591 0.3 0.3336) (2.60232 0.3 0.333543) (2.73176 0.3 0.33348) (2.86429 0.3 0.333409) (3 0.3 0.333333) (0.81291 0.3 0.400526) (0.899359 0.3 0.400581) (0.987887 0.3 0.400624) (1.07854 0.3 0.400656) (1.17138 0.3 0.400677) (1.26646 0.3 0.400687) (1.36382 0.3 0.400688) (1.46352 0.3 0.40068) (1.56563 0.3 0.400664) (1.67019 0.3 0.400641) (1.77726 0.3 0.400611) (1.88691 0.3 0.400576) (1.99919 0.3 0.400535) (2.11416 0.3 0.400489) (2.2319 0.3 0.400438) (2.35246 0.3 0.400381) (2.47591 0.3 0.400319) (2.60232 0.3 0.400251) (2.73176 0.3 0.400175) (2.86429 0.3 0.400091) (3 0.3 0.4) (0.813026 0.3 0.467319) (0.899453 0.3 0.467378) (0.987962 0.3 0.467423) (1.0786 0.3 0.467456) (1.17143 0.3 0.467475) (1.26649 0.3 0.467483) (1.36385 0.3 0.46748) (1.46355 0.3 0.467467) (1.56564 0.3 0.467446) (1.6702 0.3 0.467417) (1.77727 0.3 0.467381) (1.88691 0.3 0.467339) (1.99919 0.3 0.46729) (2.11416 0.3 0.467236) (2.2319 0.3 0.467176) (2.35246 0.3 0.46711) (2.47591 0.3 0.467038) (2.60232 0.3 0.466958) (2.73176 0.3 0.46687) (2.86429 0.3 0.466772) (3 0.3 0.466667) (0.813145 0.3 0.534129) (0.899548 0.3 0.53419) (0.988038 0.3 0.534235) (1.07866 0.3 0.534264) (1.17148 0.3 0.53428) (1.26653 0.3 0.534284) (1.36388 0.3 0.534275) (1.46357 0.3 0.534257) (1.56566 0.3 0.53423) (1.67021 0.3 0.534194) (1.77727 0.3 0.534151) (1.88691 0.3 0.534101) (1.99919 0.3 0.534045) (2.11416 0.3 0.533982) (2.2319 0.3 0.533914) (2.35246 0.3 0.533838) (2.47591 0.3 0.533755) (2.60232 0.3 0.533665) (2.73176 0.3 0.533564) (2.86429 0.3 0.533454) (3 0.3 0.533333) (0.813261 0.3 0.60096) (0.899641 0.3 0.601018) (0.988111 0.3 0.601059) (1.07872 0.3 0.601083) (1.17152 0.3 0.601093) (1.26657 0.3 0.60109) (1.3639 0.3 0.601075) (1.46359 0.3 0.601049) (1.56567 0.3 0.601015) (1.67022 0.3 0.600972) (1.77728 0.3 0.600921) (1.88692 0.3 0.600863) (1.99919 0.3 0.600799) (2.11416 0.3 0.600728) (2.2319 0.3 0.60065) (2.35246 0.3 0.600565) (2.47591 0.3 0.600472) (2.60232 0.3 0.600371) (2.73175 0.3 0.600259) (2.86429 0.3 0.600134) (3 0.3 0.6) (0.813367 0.3 0.667813) (0.899725 0.3 0.667864) (0.988178 0.3 0.667896) (1.07877 0.3 0.667912) (1.17156 0.3 0.667913) (1.2666 0.3 0.667901) (1.36392 0.3 0.667877) (1.4636 0.3 0.667843) (1.56568 0.3 0.667801) (1.67023 0.3 0.667749) (1.77728 0.3 0.667691) (1.88692 0.3 0.667625) (1.99919 0.3 0.667552) (2.11416 0.3 0.667473) (2.2319 0.3 0.667386) (2.35246 0.3 0.667291) (2.47591 0.3 0.667188) (2.60232 0.3 0.667076) (2.73175 0.3 0.666952) (2.86429 0.3 0.666815) (3 0.3 0.666667) (0.813455 0.3 0.734687) (0.899794 0.3 0.734725) (0.988233 0.3 0.734745) (1.07882 0.3 0.734749) (1.1716 0.3 0.734738) (1.26662 0.3 0.734715) (1.36394 0.3 0.734682) (1.46362 0.3 0.734639) (1.56569 0.3 0.734587) (1.67023 0.3 0.734527) (1.77729 0.3 0.73446) (1.88692 0.3 0.734385) (1.99919 0.3 0.734304) (2.11416 0.3 0.734216) (2.23189 0.3 0.73412) (2.35245 0.3 0.734016) (2.4759 0.3 0.733903) (2.60231 0.3 0.73378) (2.73175 0.3 0.733645) (2.86429 0.3 0.733495) (3 0.3 0.733333) (0.813519 0.3 0.801582) (0.899846 0.3 0.801602) (0.988274 0.3 0.801604) (1.07885 0.3 0.801592) (1.17162 0.3 0.801568) (1.26664 0.3 0.801533) (1.36396 0.3 0.801488) (1.46363 0.3 0.801434) (1.5657 0.3 0.801372) (1.67023 0.3 0.801303) (1.77729 0.3 0.801227) (1.88692 0.3 0.801144) (1.99919 0.3 0.801054) (2.11416 0.3 0.800957) (2.23189 0.3 0.800852) (2.35245 0.3 0.800739) (2.4759 0.3 0.800617) (2.60231 0.3 0.800483) (2.73175 0.3 0.800337) (2.86428 0.3 0.800175) (3 0.3 0.8) (0.813555 0.3 0.868494) (0.899876 0.3 0.868489) (0.988299 0.3 0.868471) (1.07887 0.3 0.868441) (1.17164 0.3 0.8684) (1.26665 0.3 0.868351) (1.36397 0.3 0.868294) (1.46363 0.3 0.868229) (1.5657 0.3 0.868157) (1.67023 0.3 0.868078) (1.77729 0.3 0.867992) (1.88692 0.3 0.867901) (1.99919 0.3 0.867802) (2.11415 0.3 0.867696) (2.23189 0.3 0.867583) (2.35245 0.3 0.867461) (2.4759 0.3 0.867329) (2.60231 0.3 0.867185) (2.73175 0.3 0.867028) (2.86428 0.3 0.866855) (3 0.3 0.866667) (0.813561 0.3 0.935415) (0.899884 0.3 0.935382) (0.988307 0.3 0.93534) (1.07888 0.3 0.93529) (1.17164 0.3 0.935233) (1.26666 0.3 0.935169) (1.36397 0.3 0.935098) (1.46363 0.3 0.935021) (1.5657 0.3 0.934938) (1.67023 0.3 0.93485) (1.77728 0.3 0.934755) (1.88691 0.3 0.934655) (1.99918 0.3 0.934548) (2.11415 0.3 0.934433) (2.23188 0.3 0.934311) (2.35244 0.3 0.934181) (2.47589 0.3 0.934039) (2.6023 0.3 0.933886) (2.73174 0.3 0.933718) (2.86428 0.3 0.933533) (3 0.3 0.933333) (0.729258 0.3 1.0024) (0.81354 0.3 1.00234) (0.899871 0.3 1.00228) (0.988299 0.3 1.00221) (1.07887 0.3 1.00214) (1.17164 0.3 1.00206) (1.26665 0.3 1.00198) (1.36396 0.3 1.0019) (1.46363 0.3 1.00181) (1.56569 0.3 1.00172) (1.67023 0.3 1.00162) (1.77728 0.3 1.00152) (1.88691 0.3 1.00141) (1.99917 0.3 1.00129) (2.11414 0.3 1.00117) (2.23187 0.3 1.00104) (2.35243 0.3 1.0009) (2.47589 0.3 1.00075) (2.6023 0.3 1.00059) (2.73174 0.3 1.00041) (2.86428 0.3 1.00021) (3 0.3 1) (0.812534 0 0) (0.899047 0 0) (0.987634 0 0) (1.07834 0 0) (1.17122 0 0) (1.26633 0 0) (1.36372 0 0) (1.46345 0 0) (1.56557 0 0) (1.67015 0 0) (1.77723 0 0) (1.88689 0 0) (1.99917 0 0) (2.11416 0 0) (2.2319 0 0) (2.35246 0 0) (2.47591 0 0) (2.60232 0 0) (2.73176 0 0) (2.86429 0 0) (3 0 0) (0.812545 0 0.0667401) (0.899057 0 0.0667506) (0.987641 0 0.0667595) (1.07835 0 0.0667666) (1.17123 0 0.0667719) (1.26634 0 0.0667752) (1.36373 0 0.0667768) (1.46346 0 0.0667767) (1.56558 0 0.0667751) (1.67015 0 0.066772) (1.77723 0 0.0667678) (1.88689 0 0.0667624) (1.99918 0 0.0667559) (2.11416 0 0.0667485) (2.2319 0 0.0667401) (2.35246 0 0.0667307) (2.47591 0 0.0667203) (2.60232 0 0.0667089) (2.73176 0 0.0666961) (2.86429 0 0.066682) (3 0 0.0666667) (0.812579 0 0.133483) (0.899086 0 0.133503) (0.987665 0 0.133521) (1.07837 0 0.133535) (1.17124 0 0.133545) (1.26635 0 0.133552) (1.36374 0 0.133554) (1.46346 0 0.133554) (1.56558 0 0.133551) (1.67015 0 0.133544) (1.77724 0 0.133536) (1.88689 0 0.133525) (1.99918 0 0.133512) (2.11416 0 0.133497) (2.2319 0 0.13348) (2.35246 0 0.133461) (2.47591 0 0.133441) (2.60232 0 0.133418) (2.73176 0 0.133392) (2.86429 0 0.133364) (3 0 0.133333) (0.812635 0 0.20023) (0.899132 0 0.20026) (0.987703 0 0.200286) (1.0784 0 0.200306) (1.17127 0 0.200321) (1.26637 0 0.20033) (1.36375 0 0.200334) (1.46347 0 0.200332) (1.56559 0 0.200327) (1.67016 0 0.200317) (1.77724 0 0.200304) (1.88689 0 0.200287) (1.99918 0 0.200268) (2.11416 0 0.200245) (2.2319 0 0.20022) (2.35246 0 0.200192) (2.47591 0 0.200161) (2.60232 0 0.200126) (2.73176 0 0.200088) (2.86429 0 0.200046) (3 0 0.2) (0.812711 0 0.266984) (0.899195 0 0.267024) (0.987754 0 0.267057) (1.07844 0 0.267083) (1.1713 0 0.267101) (1.26639 0 0.267112) (1.36377 0 0.267115) (1.46349 0 0.267113) (1.5656 0 0.267104) (1.67017 0 0.267091) (1.77725 0 0.267072) (1.8869 0 0.26705) (1.99918 0 0.267023) (2.11416 0 0.266993) (2.2319 0 0.266959) (2.35246 0 0.266922) (2.47591 0 0.26688) (2.60232 0 0.266835) (2.73176 0 0.266784) (2.86429 0 0.266728) (3 0 0.266667) (0.812804 0 0.333749) (0.899272 0 0.333797) (0.987816 0 0.333836) (1.07849 0 0.333866) (1.17134 0 0.333886) (1.26642 0 0.333897) (1.36379 0 0.3339) (1.46351 0 0.333895) (1.56561 0 0.333883) (1.67018 0 0.333865) (1.77725 0 0.333841) (1.8869 0 0.333813) (1.99918 0 0.333779) (2.11416 0 0.333741) (2.2319 0 0.333699) (2.35246 0 0.333652) (2.47591 0 0.3336) (2.60232 0 0.333543) (2.73176 0 0.33348) (2.86429 0 0.333409) (3 0 0.333333) (0.81291 0 0.400526) (0.899359 0 0.400581) (0.987887 0 0.400624) (1.07854 0 0.400656) (1.17138 0 0.400677) (1.26646 0 0.400687) (1.36382 0 0.400688) (1.46352 0 0.40068) (1.56563 0 0.400664) (1.67019 0 0.400641) (1.77726 0 0.400611) (1.88691 0 0.400576) (1.99919 0 0.400535) (2.11416 0 0.400489) (2.2319 0 0.400438) (2.35246 0 0.400381) (2.47591 0 0.400319) (2.60232 0 0.400251) (2.73176 0 0.400175) (2.86429 0 0.400091) (3 0 0.4) (0.813026 0 0.467319) (0.899453 0 0.467378) (0.987962 0 0.467423) (1.0786 0 0.467456) (1.17143 0 0.467475) (1.26649 0 0.467483) (1.36385 0 0.46748) (1.46355 0 0.467467) (1.56564 0 0.467446) (1.6702 0 0.467417) (1.77727 0 0.467381) (1.88691 0 0.467339) (1.99919 0 0.46729) (2.11416 0 0.467236) (2.2319 0 0.467176) (2.35246 0 0.46711) (2.47591 0 0.467038) (2.60232 0 0.466958) (2.73176 0 0.46687) (2.86429 0 0.466772) (3 0 0.466667) (0.813145 0 0.534129) (0.899548 0 0.53419) (0.988038 0 0.534235) (1.07866 0 0.534264) (1.17148 0 0.53428) (1.26653 0 0.534284) (1.36388 0 0.534275) (1.46357 0 0.534257) (1.56566 0 0.53423) (1.67021 0 0.534194) (1.77727 0 0.534151) (1.88691 0 0.534101) (1.99919 0 0.534045) (2.11416 0 0.533982) (2.2319 0 0.533914) (2.35246 0 0.533838) (2.47591 0 0.533755) (2.60232 0 0.533665) (2.73176 0 0.533564) (2.86429 0 0.533454) (3 0 0.533333) (0.813261 0 0.60096) (0.899641 0 0.601018) (0.988111 0 0.601059) (1.07872 0 0.601083) (1.17152 0 0.601093) (1.26657 0 0.60109) (1.3639 0 0.601075) (1.46359 0 0.601049) (1.56567 0 0.601015) (1.67022 0 0.600972) (1.77728 0 0.600921) (1.88692 0 0.600863) (1.99919 0 0.600799) (2.11416 0 0.600728) (2.2319 0 0.60065) (2.35246 0 0.600565) (2.47591 0 0.600472) (2.60232 0 0.600371) (2.73175 0 0.600259) (2.86429 0 0.600134) (3 0 0.6) (0.813367 0 0.667813) (0.899725 0 0.667864) (0.988178 0 0.667896) (1.07877 0 0.667912) (1.17156 0 0.667913) (1.2666 0 0.667901) (1.36392 0 0.667877) (1.4636 0 0.667843) (1.56568 0 0.667801) (1.67023 0 0.667749) (1.77728 0 0.667691) (1.88692 0 0.667625) (1.99919 0 0.667552) (2.11416 0 0.667473) (2.2319 0 0.667386) (2.35246 0 0.667291) (2.47591 0 0.667188) (2.60232 0 0.667076) (2.73175 0 0.666952) (2.86429 0 0.666815) (3 0 0.666667) (0.813455 0 0.734687) (0.899794 0 0.734725) (0.988233 0 0.734745) (1.07882 0 0.734749) (1.1716 0 0.734738) (1.26662 0 0.734715) (1.36394 0 0.734682) (1.46362 0 0.734639) (1.56569 0 0.734587) (1.67023 0 0.734527) (1.77729 0 0.73446) (1.88692 0 0.734385) (1.99919 0 0.734304) (2.11416 0 0.734216) (2.23189 0 0.73412) (2.35245 0 0.734016) (2.4759 0 0.733903) (2.60231 0 0.73378) (2.73175 0 0.733645) (2.86429 0 0.733495) (3 0 0.733333) (0.813519 0 0.801582) (0.899846 0 0.801602) (0.988274 0 0.801604) (1.07885 0 0.801592) (1.17162 0 0.801568) (1.26664 0 0.801533) (1.36396 0 0.801488) (1.46363 0 0.801434) (1.5657 0 0.801372) (1.67023 0 0.801303) (1.77729 0 0.801227) (1.88692 0 0.801144) (1.99919 0 0.801054) (2.11416 0 0.800957) (2.23189 0 0.800852) (2.35245 0 0.800739) (2.4759 0 0.800617) (2.60231 0 0.800483) (2.73175 0 0.800337) (2.86428 0 0.800175) (3 0 0.8) (0.813555 0 0.868494) (0.899876 0 0.868489) (0.988299 0 0.868471) (1.07887 0 0.868441) (1.17164 0 0.8684) (1.26665 0 0.868351) (1.36397 0 0.868294) (1.46363 0 0.868229) (1.5657 0 0.868157) (1.67023 0 0.868078) (1.77729 0 0.867992) (1.88692 0 0.867901) (1.99919 0 0.867802) (2.11415 0 0.867696) (2.23189 0 0.867583) (2.35245 0 0.867461) (2.4759 0 0.867329) (2.60231 0 0.867185) (2.73175 0 0.867028) (2.86428 0 0.866855) (3 0 0.866667) (0.813561 0 0.935415) (0.899884 0 0.935382) (0.988307 0 0.93534) (1.07888 0 0.93529) (1.17164 0 0.935233) (1.26666 0 0.935169) (1.36397 0 0.935098) (1.46363 0 0.935021) (1.5657 0 0.934938) (1.67023 0 0.93485) (1.77728 0 0.934755) (1.88691 0 0.934655) (1.99918 0 0.934548) (2.11415 0 0.934433) (2.23188 0 0.934311) (2.35244 0 0.934181) (2.47589 0 0.934039) (2.6023 0 0.933886) (2.73174 0 0.933718) (2.86428 0 0.933533) (3 0 0.933333) (0.729258 0 1.0024) (0.81354 0 1.00234) (0.899871 0 1.00228) (0.988299 0 1.00221) (1.07887 0 1.00214) (1.17164 0 1.00206) (1.26665 0 1.00198) (1.36396 0 1.0019) (1.46363 0 1.00181) (1.56569 0 1.00172) (1.67023 0 1.00162) (1.77728 0 1.00152) (1.88691 0 1.00141) (1.99917 0 1.00129) (2.11414 0 1.00117) (2.23187 0 1.00104) (2.35243 0 1.0009) (2.47589 0 1.00075) (2.6023 0 1.00059) (2.73174 0 1.00041) (2.86428 0 1.00021) (3 0 1) (0.729192 0.3 1.07193) (0.813493 0.3 1.07183) (0.899837 0.3 1.07173) (0.988274 0.3 1.07164) (1.07885 0.3 1.07154) (1.17162 0.3 1.07145) (1.26664 0.3 1.07135) (1.36395 0.3 1.07126) (1.46362 0.3 1.07115) (1.56568 0.3 1.07105) (1.67022 0.3 1.07094) (1.77727 0.3 1.07083) (1.88689 0.3 1.07071) (1.99916 0.3 1.07059) (2.11413 0.3 1.07046) (2.23186 0.3 1.07032) (2.35242 0.3 1.07017) (2.47588 0.3 1.07001) (2.60229 0.3 1.06984) (2.73174 0.3 1.06965) (2.86428 0.3 1.06944) (3 0.3 1.06922) (0.729101 0.3 1.14311) (0.813425 0.3 1.14298) (0.899786 0.3 1.14285) (0.988235 0.3 1.14273) (1.07882 0.3 1.14262) (1.1716 0.3 1.14251) (1.26662 0.3 1.14239) (1.36393 0.3 1.14228) (1.4636 0.3 1.14217) (1.56567 0.3 1.14205) (1.6702 0.3 1.14194) (1.77725 0.3 1.14181) (1.88688 0.3 1.14169) (1.99915 0.3 1.14155) (2.11412 0.3 1.14141) (2.23185 0.3 1.14127) (2.35241 0.3 1.14111) (2.47587 0.3 1.14094) (2.60229 0.3 1.14076) (2.73173 0.3 1.14057) (2.86427 0.3 1.14035) (3 0.3 1.14011) (0.899721 0.3 1.21568) (0.988183 0.3 1.21553) (1.07878 0.3 1.2154) (1.17156 0.3 1.21527) (1.26659 0.3 1.21515) (1.36391 0.3 1.21502) (1.46358 0.3 1.2149) (1.56565 0.3 1.21477) (1.67018 0.3 1.21464) (1.77723 0.3 1.21451) (1.88687 0.3 1.21437) (1.99913 0.3 1.21423) (2.11411 0.3 1.21409) (2.23184 0.3 1.21393) (2.3524 0.3 1.21377) (2.47586 0.3 1.21359) (2.60228 0.3 1.2134) (2.73172 0.3 1.2132) (2.86427 0.3 1.21297) (3 0.3 1.21272) (1.07873 0.3 1.28993) (1.17152 0.3 1.28978) (1.26655 0.3 1.28964) (1.36388 0.3 1.28951) (1.46355 0.3 1.28937) (1.56562 0.3 1.28924) (1.67016 0.3 1.2891) (1.77721 0.3 1.28896) (1.88685 0.3 1.28882) (1.99912 0.3 1.28867) (2.11409 0.3 1.28851) (2.23182 0.3 1.28835) (2.35239 0.3 1.28818) (2.47585 0.3 1.28799) (2.60227 0.3 1.2878) (2.73172 0.3 1.28758) (2.86427 0.3 1.28734) (3 0.3 1.28709) (1.17147 0.3 1.36609) (1.26651 0.3 1.36593) (1.36384 0.3 1.36579) (1.46351 0.3 1.36564) (1.56559 0.3 1.3655) (1.67013 0.3 1.36535) (1.77719 0.3 1.3652) (1.88682 0.3 1.36505) (1.9991 0.3 1.36489) (2.11407 0.3 1.36473) (2.23181 0.3 1.36456) (2.35237 0.3 1.36438) (2.47583 0.3 1.36419) (2.60226 0.3 1.36399) (2.73171 0.3 1.36376) (2.86426 0.3 1.36352) (3 0.3 1.36325) (1.3638 0.3 1.4439) (1.46348 0.3 1.44374) (1.56556 0.3 1.44359) (1.6701 0.3 1.44344) (1.77716 0.3 1.44328) (1.8868 0.3 1.44312) (1.99907 0.3 1.44296) (2.11405 0.3 1.44279) (2.23179 0.3 1.44261) (2.35236 0.3 1.44243) (2.47582 0.3 1.44223) (2.60224 0.3 1.44202) (2.7317 0.3 1.44179) (2.86426 0.3 1.44153) (3 0.3 1.44126) (1.56552 0.3 1.52356) (1.67006 0.3 1.5234) (1.77713 0.3 1.52324) (1.88677 0.3 1.52308) (1.99904 0.3 1.52291) (2.11402 0.3 1.52273) (2.23176 0.3 1.52255) (2.35234 0.3 1.52236) (2.4758 0.3 1.52215) (2.60223 0.3 1.52193) (2.73169 0.3 1.5217) (2.86425 0.3 1.52143) (3 0.3 1.52115) (1.67002 0.3 1.60529) (1.77709 0.3 1.60513) (1.88673 0.3 1.60496) (1.99901 0.3 1.60478) (2.11399 0.3 1.6046) (2.23174 0.3 1.60441) (2.35231 0.3 1.60421) (2.47578 0.3 1.604) (2.60222 0.3 1.60378) (2.73168 0.3 1.60354) (2.86425 0.3 1.60327) (3 0.3 1.60298) (1.8867 0.3 1.68881) (1.99898 0.3 1.68863) (2.11396 0.3 1.68844) (2.23171 0.3 1.68825) (2.35229 0.3 1.68805) (2.47576 0.3 1.68783) (2.6022 0.3 1.6876) (2.73167 0.3 1.68735) (2.86424 0.3 1.68708) (3 0.3 1.68679) (1.99894 0.3 1.77449) (2.11393 0.3 1.7743) (2.23168 0.3 1.77411) (2.35226 0.3 1.7739) (2.47574 0.3 1.77368) (2.60218 0.3 1.77345) (2.73166 0.3 1.77319) (2.86424 0.3 1.77292) (3 0.3 1.77262) (2.23165 0.3 1.86203) (2.35224 0.3 1.86182) (2.47572 0.3 1.8616) (2.60216 0.3 1.86137) (2.73164 0.3 1.86111) (2.86423 0.3 1.86083) (3 0.3 1.86053) (2.35221 0.3 1.95187) (2.47569 0.3 1.95165) (2.60214 0.3 1.95141) (2.73163 0.3 1.95115) (2.86422 0.3 1.95087) (3 0.3 1.95056) (2.60212 0.3 2.04362) (2.73162 0.3 2.04336) (2.86421 0.3 2.04308) (3 0.3 2.04278) (2.7316 0.3 2.1378) (2.86421 0.3 2.13752) (3 0.3 2.13722) (2.8642 0.3 2.23425) (3 0.3 2.23395) (0.729192 0 1.07193) (0.813493 0 1.07183) (0.899837 0 1.07173) (0.988274 0 1.07164) (1.07885 0 1.07154) (1.17162 0 1.07145) (1.26664 0 1.07135) (1.36395 0 1.07126) (1.46362 0 1.07115) (1.56568 0 1.07105) (1.67022 0 1.07094) (1.77727 0 1.07083) (1.88689 0 1.07071) (1.99916 0 1.07059) (2.11413 0 1.07046) (2.23186 0 1.07032) (2.35242 0 1.07017) (2.47588 0 1.07001) (2.60229 0 1.06984) (2.73174 0 1.06965) (2.86428 0 1.06944) (3 0 1.06922) (0.729101 0 1.14311) (0.813425 0 1.14298) (0.899786 0 1.14285) (0.988235 0 1.14273) (1.07882 0 1.14262) (1.1716 0 1.14251) (1.26662 0 1.14239) (1.36393 0 1.14228) (1.4636 0 1.14217) (1.56567 0 1.14205) (1.6702 0 1.14194) (1.77725 0 1.14181) (1.88688 0 1.14169) (1.99915 0 1.14155) (2.11412 0 1.14141) (2.23185 0 1.14127) (2.35241 0 1.14111) (2.47587 0 1.14094) (2.60229 0 1.14076) (2.73173 0 1.14057) (2.86427 0 1.14035) (3 0 1.14011) (0.899721 0 1.21568) (0.988183 0 1.21553) (1.07878 0 1.2154) (1.17156 0 1.21527) (1.26659 0 1.21515) (1.36391 0 1.21502) (1.46358 0 1.2149) (1.56565 0 1.21477) (1.67018 0 1.21464) (1.77723 0 1.21451) (1.88687 0 1.21437) (1.99913 0 1.21423) (2.11411 0 1.21409) (2.23184 0 1.21393) (2.3524 0 1.21377) (2.47586 0 1.21359) (2.60228 0 1.2134) (2.73172 0 1.2132) (2.86427 0 1.21297) (3 0 1.21272) (1.07873 0 1.28993) (1.17152 0 1.28978) (1.26655 0 1.28964) (1.36388 0 1.28951) (1.46355 0 1.28937) (1.56562 0 1.28924) (1.67016 0 1.2891) (1.77721 0 1.28896) (1.88685 0 1.28882) (1.99912 0 1.28867) (2.11409 0 1.28851) (2.23182 0 1.28835) (2.35239 0 1.28818) (2.47585 0 1.28799) (2.60227 0 1.2878) (2.73172 0 1.28758) (2.86427 0 1.28734) (3 0 1.28709) (1.17147 0 1.36609) (1.26651 0 1.36593) (1.36384 0 1.36579) (1.46351 0 1.36564) (1.56559 0 1.3655) (1.67013 0 1.36535) (1.77719 0 1.3652) (1.88682 0 1.36505) (1.9991 0 1.36489) (2.11407 0 1.36473) (2.23181 0 1.36456) (2.35237 0 1.36438) (2.47583 0 1.36419) (2.60226 0 1.36399) (2.73171 0 1.36376) (2.86426 0 1.36352) (3 0 1.36325) (1.3638 0 1.4439) (1.46348 0 1.44374) (1.56556 0 1.44359) (1.6701 0 1.44344) (1.77716 0 1.44328) (1.8868 0 1.44312) (1.99907 0 1.44296) (2.11405 0 1.44279) (2.23179 0 1.44261) (2.35236 0 1.44243) (2.47582 0 1.44223) (2.60224 0 1.44202) (2.7317 0 1.44179) (2.86426 0 1.44153) (3 0 1.44126) (1.56552 0 1.52356) (1.67006 0 1.5234) (1.77713 0 1.52324) (1.88677 0 1.52308) (1.99904 0 1.52291) (2.11402 0 1.52273) (2.23176 0 1.52255) (2.35234 0 1.52236) (2.4758 0 1.52215) (2.60223 0 1.52193) (2.73169 0 1.5217) (2.86425 0 1.52143) (3 0 1.52115) (1.67002 0 1.60529) (1.77709 0 1.60513) (1.88673 0 1.60496) (1.99901 0 1.60478) (2.11399 0 1.6046) (2.23174 0 1.60441) (2.35231 0 1.60421) (2.47578 0 1.604) (2.60222 0 1.60378) (2.73168 0 1.60354) (2.86425 0 1.60327) (3 0 1.60298) (1.8867 0 1.68881) (1.99898 0 1.68863) (2.11396 0 1.68844) (2.23171 0 1.68825) (2.35229 0 1.68805) (2.47576 0 1.68783) (2.6022 0 1.6876) (2.73167 0 1.68735) (2.86424 0 1.68708) (3 0 1.68679) (1.99894 0 1.77449) (2.11393 0 1.7743) (2.23168 0 1.77411) (2.35226 0 1.7739) (2.47574 0 1.77368) (2.60218 0 1.77345) (2.73166 0 1.77319) (2.86424 0 1.77292) (3 0 1.77262) (2.23165 0 1.86203) (2.35224 0 1.86182) (2.47572 0 1.8616) (2.60216 0 1.86137) (2.73164 0 1.86111) (2.86423 0 1.86083) (3 0 1.86053) (2.35221 0 1.95187) (2.47569 0 1.95165) (2.60214 0 1.95141) (2.73163 0 1.95115) (2.86422 0 1.95087) (3 0 1.95056) (2.60212 0 2.04362) (2.73162 0 2.04336) (2.86421 0 2.04308) (3 0 2.04278) (2.7316 0 2.1378) (2.86421 0 2.13752) (3 0 2.13722) (2.8642 0 2.23425) (3 0 2.23395) ) // ************************************************************************* //

[ "aldo.abarca.ortega@gmail.com" ]

aldo.abarca.ortega@gmail.com