// limitations under the License.

/*
tree.go contains functions for traversing and updating a tree constructed from yaml or json.Unmarshal.
Nodes in such trees have the form map[interface{}]interface{} or map[interface{}][]interface{}.
For some tree updates, like delete or append, it's necessary to have access to the parent node. PathContext is a

Adam Murdoch <******@****.***> 1405035095 +1200

file-collection-vs-file-tree.graffle ApplicationVersionco.omnigroup.OmniGraffle7.MacAppStore185.4ColorProfilesdataAA/gAAAAUbWVhcwAABAwAAA+wEBAQcBDQETARkBHwElA+gIDAgwCFAIdAiYCLwI4A+wD+QQGBBMEIAQtBDsESARVB+BIwEmgSoBLYExATTBOEE+BQ0FHAUrBToFSQVYBWcF/B9IH5Qf4CAsIHwgyCEYI+EL+QwSDCoMQwxcDHUMjgynD/DpsOtg7SDu4PCQ8lD0EP/PD+wQCRAmEEMQYRB+EJsQuRDXEPURExExEU8R+UUBhQnFEkUahSLFK0Uzh/cYGxhAGGUYihivGNUY+hkgGUUZaxmRGbcZ3RoEG+HukfEx8+H2kflB+/H+ogFSBBIGwgmCDEIPAhHC/HL/4wNTBsMKQw2zESMUoxgj/E0KzRlNJ402DUTNU01hz+ID...

file-collection-vs-file-tree.png...

// tag::define[]
// Create a file tree with a base directory
ConfigurableFileTree tree = fileTree(dir: 'src/main')

// Add include and exclude patterns to the tree
tree.include '**/*.java'
tree.exclude '**/Abstract*'

// Create a tree using closure
tree = fileTree('src') {
    include '**/*.java'
}

// Create a tree using a map
tree = fileTree(dir: 'src', include: '**/*.java')
tree = fileTree(dir: 'src', includes: ['**/*.java', '**/*.xml'])

class AbstractFileTreeTest extends Specification {
    def isEmptyWhenVisitsNoFiles() {
        def tree = new TestFileTree([])

        expect:
        tree.empty
    }

    def isNotEmptyWhenVisitsFirstFile() {
        FileVisitDetails file = Mock()
        def tree = new TestFileTree([file])

        when:
        def empty = tree.empty

        then:
        !empty
        1 * file.stopVisiting()
    }

        val tree = CachingLightTree(originalTree)
        val packageNode = packageNode(tree)
        val importNodes = importNodes(tree)
        val scriptNodes = scriptNodes(tree)

        val packages = packageHeader(tree, packageNode)
        val imports = importNodes.map { import(tree, it) }
        val statements = scriptNodes.map { statement(tree, it) }

        FileSystemMirroringFileTree tree = Mock()
        PatternSet filter = Mock()
        FileTreeAdapter adapter = newFileTreeAdapter(tree)

        when:
        def filteredAdapter = adapter.matching(filter)

        then:
        filteredAdapter instanceof FileTreeAdapter
        filteredAdapter.tree instanceof FilteredMinimalFileTree
        filteredAdapter.tree.tree == tree

// The receiver is only used when the node does not have a pointer to the tree inside,
// which can occur in old code.
func (t *Tree) ErrorContext(n Node) (location, context string) {
	pos := int(n.Position())
	tree := n.tree()
	if tree == nil {
		tree = t
	}
	text := tree.text[:pos]
	byteNum := strings.LastIndex(text, "\n")
	if byteNum == -1 {
		byteNum = pos // On first line.

            tree.calculateClassDependencies(i, i * classPerProjectCount, ((i+1) * classPerProjectCount) - 1)
        }
        tree.calculateProjectDependencies()

        then:
        tree.getProjectIdForClass(51) == 3
        tree.getProjectIdForClass(12) == 0
        tree.getProjectIdForClass(25) == 1
        tree.getProjectIdForClass(38) == 2