(self, text)
return matches
Compute matches when text is a simple name.

        Return a list of all keywords, built-in functions and names currently
        defined in self.namespace that match.
Compute matches when text is a simple name.
Compute matches when text is a simple name .
def global_matches(self, text):
        """Compute matches when text is a simple name.

        Return a list of all keywords, built-in functions and names currently
        defined in self.namespace that match.

        """
        import keyword
        matches = []
        seen = {"__builtins__"}
        n = len(text)
        for word in keyword.kwlist:
            if word[:n] == text:
                seen.add(word)
                if word in {'finally', 'try'}:
                    word = word + ':'
                elif word not in {'False', 'None', 'True',
                                  'break', 'continue', 'pass',
                                  'else'}:
                    word = word + ' '
                matches.append(word)
        for nspace in [self.namespace, builtins.__dict__]:
            for word, val in nspace.items():
                if word[:n] == text and word not in seen:
                    seen.add(word)
                    matches.append(self._callable_postfix(val, word))
        return matches
def global_matches ( self , text ) : import keyword matches = [ ] seen = { "__builtins__" } n = len ( text ) for word in keyword . kwlist : if word [ : n ] == text : seen . add ( word ) if word in { 'finally' , 'try' } : word = word + ':' elif word not in { 'False' , 'None' , 'True' , 'break' , 'continue' , 'pass' , 'else' } : word = word + ' ' matches . append ( word ) for nspace in [ self . namespace , builtins . __dict__ ] : for word , val in nspace . items ( ) : if word [ : n ] == text and word not in seen : seen . add ( word ) matches . append ( self . _callable_postfix ( val , word ) ) return matches