parameters: (self)
docstring: Show possible autocompletion Words from already typed words.
docstring_summary: Show possible autocompletion Words from already typed words.
docstring_tokens: Show possible autocompletion Words from already typed words .
function: def OnShowCompHistory(self):
          """Show possible autocompletion Words from already typed words."""
          
          #copy from history
          his = self.history[:]
          
          #put together in one string
          joined = " ".join (his)
          import re
  
          #sort out only "good" words
          newlist = re.split("[ \.\[\]=}(\)\,0-9\"]", joined)
          
          #length > 1 (mix out "trash")
          thlist = []
          for i in newlist:
              if len (i) > 1:
                  thlist.append (i)
          
          #unique (no duplicate words
          #oneliner from german python forum => unique list
          unlist = [thlist[i] for i in xrange(len(thlist)) if thlist[i] not in thlist[:i]]
              
          #sort lowercase
          unlist.sort(lambda a, b: cmp(a.lower(), b.lower()))
          
          #this is more convenient, isn't it?
          self.AutoCompSetIgnoreCase(True)
          
          #join again together in a string
          stringlist = " ".join(unlist)
  
          #pos von 0 noch ausrechnen
  
          #how big is the offset?
          cpos = self.GetCurrentPos() - 1
          while chr (self.GetCharAt (cpos)).isalnum():
              cpos -= 1
              
          #the most important part
          self.AutoCompShow(self.GetCurrentPos() - cpos -1, stringlist)
function_tokens: def OnShowCompHistory ( self ) : #copy from history his = self . history [ : ] #put together in one string joined = " " . join ( his ) import re #sort out only "good" words newlist = re . split ( "[ \.\[\]=}(\)\,0-9\"]" , joined ) #length > 1 (mix out "trash") thlist = [ ] for i in newlist : if len ( i ) > 1 : thlist . append ( i ) #unique (no duplicate words #oneliner from german python forum => unique list unlist = [ thlist [ i ] for i in xrange ( len ( thlist ) ) if thlist [ i ] not in thlist [ : i ] ] #sort lowercase unlist . sort ( lambda a , b : cmp ( a . lower ( ) , b . lower ( ) ) ) #this is more convenient, isn't it? self . AutoCompSetIgnoreCase ( True ) #join again together in a string stringlist = " " . join ( unlist ) #pos von 0 noch ausrechnen #how big is the offset? cpos = self . GetCurrentPos ( ) - 1 while chr ( self . GetCharAt ( cpos ) ) . isalnum ( ) : cpos -= 1 #the most important part self . AutoCompShow ( self . GetCurrentPos ( ) - cpos - 1 , stringlist )