/* $DOC$ $AUTHOR$ 2016 Pete D. $TEMPLATE$ Function $NAME$ hb_LeftEq() $CATEGORY$ API $SUBCATEGORY$ Strings $ONELINER$ Checks if a sub-string matches to leftmost part of a string. $SYNTAX$ hb_LeftEq( , ) --> lMatch $ARGUMENTS$ Main string of comparison. Sub-string compared to leftmost part of $RETURNS$ Boolean flag indicating if the matching was successful $DESCRIPTION$ This function checks if all characters (one by one and with the given order) of match to leftmost (same length) part of or in other words, checks if starts with , in which case returns .T., otherwise .F. Basically it's equivalent to the expression: `Left( , Len( ) ) == ` but faster and shorter. NOTE: Case sensitive! $EXAMPLES$ ? hb_LeftEq( "Harbour", "Ha" ) // --> .T. ? hb_LeftEq( "Harbour", "ha" ) // --> .F. $STATUS$ R $COMPLIANCE$ H $PLATFORMS$ All $FILES$ Library is core $SEEALSO$ hb_LeftEqI(), Left(), At() $END$ */ /* $DOC$ $AUTHOR$ 2016 Pete D. $TEMPLATE$ Function $NAME$ hb_LeftEqI() $CATEGORY$ API $SUBCATEGORY$ Strings $ONELINER$ Checks if a sub-string matches to leftmost part of a string. $SYNTAX$ hb_LeftEqI( , ) --> lMatch $ARGUMENTS$ Main string of comparison. Sub-string compared to leftmost part of . $RETURNS$ Boolean flag indicating if the matching was successful. $DESCRIPTION$ This function is identical to hb_LeftEq() (see above for details) but it is case *insensitive*! $EXAMPLES$ ? hb_LeftEqI( "Harbour", "HA" ) // --> .T. ? hb_LeftEqI( "Harbour", "ha" ) // --> .T. ? hb_LeftEq( "Harbour", "HA" ) // --> .F. $STATUS$ R $COMPLIANCE$ H $PLATFORMS$ All $FILES$ Library is core $SEEALSO$ hb_LeftEqI(), Left(), At() $END$ */