* Defining this implies, that a data value contains
* more than just the key.</li>
* <li><b>GetKey(value)</b> Extracts the key from a data value</li>
- * <li><b>KeysEqual(hashset,key1,key2)</b> Tests wether 2 keys are equal</li>
+ * <li><b>KeysEqual(hashset,key1,key2)</b> Tests whether 2 keys are equal</li>
* <li><b>DO_REHASH</b> Instead of storing the hash-values, recalculate
* them on demand from the datavalues. (useful if
* calculating the hash-values takes less time than
return create_initializer_const(value);
}
-/** test wether type can be initialized by a string constant */
+/** Tests whether type can be initialized by a string constant */
static bool is_string_type(type_t *type)
{
if (!is_type_array(type))
}
/**
- * Return the top type path entry, ie. in a path
+ * Return the top type path entry, i.e. in a path
* (type).a.b returns the b.
*/
static type_path_entry_t *get_type_path_top(const type_path_t *path)
}
/**
- * Pop an entry from the given type path, ie. returning from
+ * Pop an entry from the given type path, i.e. returning from
* (type).a.b to (type).a
*/
static void ascend_from_subtype(type_path_t *path)
}
/**
- * test wether new_list contains any attributes not included in old_list
+ * Tests whether new_list contains any attributes not included in old_list
*/
static bool has_new_attributes(const attribute_t *old_list,
const attribute_t *new_list)
}
/**
- * Parse a call expression, ie. expression '( ... )'.
+ * Parse a call expression, i.e. expression '( ... )'.
*
* @param expression the function address
*/
}
/**
- * Parse a conditional expression, ie. 'expression ? ... : ...'.
+ * Parse a conditional expression, i.e. 'expression ? ... : ...'.
*
* @param expression the conditional expression
*/
}
/**
- * Parse an expression statement, ie. expr ';'.
+ * Parse an expression statement, i.e. expr ';'.
*/
static statement_t *parse_expression_statement(void)
{
return NULL;
}
- /* check wether we have a "... or <... headername */
+ /* check whether we have a "... or <... headername */
position_t pos = input.pos;
switch (input.c) {
{
/* just take the true case in the hope to avoid further errors */
condition = true;
} else {
- /* evaluate wether we are in true or false case */
+ /* evaluate whether we are in true or false case */
condition = (bool)pp_token.base.symbol->pp_definition == is_ifdef;
eat_token(T_IDENTIFIER);
* Check if a given type is incomplete.
*
* @param type The type to check.
- * @return True if the given type is incomplete (ie. just forward).
+ * @return True if the given type is incomplete (i.e. just forward).
*/
bool is_type_incomplete(const type_t *type);