[word=is] | [lemma=member]? □ □
[word=is] | [lemma=member]? [□] □
[word=is] | [lemma=member]? (□ | □) □
And I went , Ooh ! I always wanted a snappy little roadster like the one that Nancy Drew had , but we were stuck with that old Buick . For instance , you should plot search / insertion / deletion times per operation rather than cumulatively ( many of you even thought that the cumulative values should be logarithmic and made comments about being surprised at observing an apparently linear behavior , when in fact you should have expected n log n behavior in the cumulative values ) and you should use a log scale on the data size , so that the theoretically predicted curve would be a straight line - - it 's easy to detect a deviation from a straight line , but hard to look at a curve and say " this is logarithmic " Evaluating data : timing alone may simply reflect errors in the code or errors in data generation or unusual data patterns generated by your test driver ( many of you inserted , then deleted in the same order in search trees , thereby making delete look much too good ) . And then when the pain would subside , she would be up on her feet , and the people around her would not have the slightest idea about what happened , because she never sought sympathy , she never complained , she kept smiling and she gave us everything that we wanted . Most writers , myself included , tend to shower AFTER interviews ( to wash away that lingering suspicion that some sort of transaction with the devil has taken place ) .