# Path: py3kwarn2to3/pytree.py
# HUGE = 0x7FFFFFFF  # maximum repeat count, default max
# def type_repr(type_num):
#     def __new__(cls, *args, **kwds):
#     def __eq__(self, other):
#     def __ne__(self, other):
#     def _eq(self, other):
#     def clone(self):
#     def post_order(self):
#     def pre_order(self):
#     def set_prefix(self, prefix):
#     def get_prefix(self):
#     def replace(self, new):
#     def get_lineno(self):
#     def changed(self):
#     def remove(self):
#     def next_sibling(self):
#     def prev_sibling(self):
#     def leaves(self):
#     def depth(self):
#     def get_suffix(self):
#         def __str__(self):
#     def __init__(self,type, children,
#                  context=None,
#                  prefix=None,
#                  fixers_applied=None):
#     def __repr__(self):
#     def __unicode__(self):
#     def _eq(self, other):
#     def clone(self):
#     def post_order(self):
#     def pre_order(self):
#     def _prefix_getter(self):
#     def _prefix_setter(self, prefix):
#     def set_child(self, i, child):
#     def insert_child(self, i, child):
#     def append_child(self, child):
#     def __init__(self, type, value,
#                  context=None,
#                  prefix=None,
#                  fixers_applied=[]):
#     def __repr__(self):
#     def __unicode__(self):
#     def _eq(self, other):
#     def clone(self):
#     def leaves(self):
#     def post_order(self):
#     def pre_order(self):
#     def _prefix_getter(self):
#     def _prefix_setter(self, prefix):
# def convert(gr, raw_node):
#     def __new__(cls, *args, **kwds):
#     def __repr__(self):
#     def optimize(self):
#     def match(self, node, results=None):
#     def match_seq(self, nodes, results=None):
#     def generate_matches(self, nodes):
#     def __init__(self, type=None, content=None, name=None):
#     def match(self, node, results=None):
#     def _submatch(self, node, results=None):
#     def __init__(self, type=None, content=None, name=None):
#     def _submatch(self, node, results=None):
#     def __init__(self, content=None, min=0, max=HUGE, name=None):
#     def optimize(self):
#     def match(self, node, results=None):
#     def match_seq(self, nodes, results=None):
#     def generate_matches(self, nodes):
#     def _iterative_matches(self, nodes):
#     def _bare_name_matches(self, nodes):
#     def _recursive_matches(self, nodes, count):
#     def __init__(self, content=None):
#     def match(self, node):
#     def match_seq(self, nodes):
#     def generate_matches(self, nodes):
# def generate_matches(patterns, nodes):
# class Base(object):
# class Node(Base):
# class Leaf(Base):
# class BasePattern(object):
# class LeafPattern(BasePattern):
# class NodePattern(BasePattern):
# class WildcardPattern(BasePattern):
# class NegatedPattern(BasePattern):


import sys
import warnings
from . import support
from py3kwarn2to3 import pytree

"""Unit tests for pytree.py.

NOTE: Please *don't* add doc strings to individual test methods!
In verbose mode, printing of the module, class and method name is much
more helpful than printing of (the first line of) the docstring,
especially when debugging a test.
"""

from __future__ import with_statement


# Testing imports


try:
    sorted
except NameError:
    def sorted(lst):
        l = list(lst)
        l.sort()
        return l

class TestNodes(support.TestCase):

    """Unit tests for nodes (Base, Leaf, Node)."""

    if sys.version_info >= (2,6):
        # warnings.catch_warnings is new in 2.6.
        def test_deprecated_prefix_methods(self):

# Path: py3kwarn2to3/pytree.py
# HUGE = 0x7FFFFFFF  # maximum repeat count, default max
# def type_repr(type_num):
#     def __new__(cls, *args, **kwds):
#     def __eq__(self, other):
#     def __ne__(self, other):
#     def _eq(self, other):
#     def clone(self):
#     def post_order(self):
#     def pre_order(self):
#     def set_prefix(self, prefix):
#     def get_prefix(self):
#     def replace(self, new):
#     def get_lineno(self):
#     def changed(self):
#     def remove(self):
#     def next_sibling(self):
#     def prev_sibling(self):
#     def leaves(self):
#     def depth(self):
#     def get_suffix(self):
#         def __str__(self):
#     def __init__(self,type, children,
#                  context=None,
#                  prefix=None,
#                  fixers_applied=None):
#     def __repr__(self):
#     def __unicode__(self):
#     def _eq(self, other):
#     def clone(self):
#     def post_order(self):
#     def pre_order(self):
#     def _prefix_getter(self):
#     def _prefix_setter(self, prefix):
#     def set_child(self, i, child):
#     def insert_child(self, i, child):
#     def append_child(self, child):
#     def __init__(self, type, value,
#                  context=None,
#                  prefix=None,
#                  fixers_applied=[]):
#     def __repr__(self):
#     def __unicode__(self):
#     def _eq(self, other):
#     def clone(self):
#     def leaves(self):
#     def post_order(self):
#     def pre_order(self):
#     def _prefix_getter(self):
#     def _prefix_setter(self, prefix):
# def convert(gr, raw_node):
#     def __new__(cls, *args, **kwds):
#     def __repr__(self):
#     def optimize(self):
#     def match(self, node, results=None):
#     def match_seq(self, nodes, results=None):
#     def generate_matches(self, nodes):
#     def __init__(self, type=None, content=None, name=None):
#     def match(self, node, results=None):
#     def _submatch(self, node, results=None):
#     def __init__(self, type=None, content=None, name=None):
#     def _submatch(self, node, results=None):
#     def __init__(self, content=None, min=0, max=HUGE, name=None):
#     def optimize(self):
#     def match(self, node, results=None):
#     def match_seq(self, nodes, results=None):
#     def generate_matches(self, nodes):
#     def _iterative_matches(self, nodes):
#     def _bare_name_matches(self, nodes):
#     def _recursive_matches(self, nodes, count):
#     def __init__(self, content=None):
#     def match(self, node):
#     def match_seq(self, nodes):
#     def generate_matches(self, nodes):
# def generate_matches(patterns, nodes):
# class Base(object):
# class Node(Base):
# class Leaf(Base):
# class BasePattern(object):
# class LeafPattern(BasePattern):
# class NodePattern(BasePattern):
# class WildcardPattern(BasePattern):
# class NegatedPattern(BasePattern):


# Path: py3kwarn2to3/tests/test_pytree.py
import sys
import warnings
from . import support
from py3kwarn2to3 import pytree


"""Unit tests for pytree.py.

NOTE: Please *don't* add doc strings to individual test methods!
In verbose mode, printing of the module, class and method name is much
more helpful than printing of (the first line of) the docstring,
especially when debugging a test.
"""

from __future__ import with_statement


# Testing imports


try:
    sorted
except NameError:
    def sorted(lst):
        l = list(lst)
        l.sort()
        return l

class TestNodes(support.TestCase):

    """Unit tests for nodes (Base, Leaf, Node)."""

    if sys.version_info >= (2,6):
        # warnings.catch_warnings is new in 2.6.
        def test_deprecated_prefix_methods(self):

            l = pytree.Leaf(100, "foo")