[□=□] □ □
[word=□] □ □
[lemma=□] □ □
Sometimes this behavior is unwanted , for example if the function was called by a module and the win - dow that was selected at first does not exist anymore . When inside a user-defined function this expression stack is never cleared because its contents may be needed within a complex expression in the context from which the user-defined function was called . Note however , that if a function is called many times , then the statistical averaging across all calls should result in increased resolution . If the find-file argument to normal-mode is non-nil , normal-mode assumes that the find-file function is calling it . NOTE : when this function is called , it will seek to the first row right away , then it will call dbnextrow ( ) until there are no more rows and increment a internal counter to calculate the number of rows in the result buffer . ) If the containing function was called by Lisp evaluation ( or with apply or funcall ) , then it was not called interactively . When the bundle is the first of a function , you can check how many times the function was called . When this function is called , it signals an error indicating that a required keyword argument was not supplied . I repeated the ‘ one today from now ’ phrase 3 times , with the same result ( the warnError function being called , and the user notified of the error ) . Only a few changes were needed to match the expected UNIX semantics - one of the most troublesome differences was that Winsock must be initialized before the first socket function is called . The completer function is called as function ( text , state ) , for state in 0 , 1 , 2 , ..., until it returns a non-string value . The flat profile shows how much time your program spent in each function , and how many times that function was called .