RootItem.java

Go to the documentation of this file.

/*
 * Autopsy Forensic Browser
 *
 * Copyright 2014 Basis Technology Corp.
 * Contact: carrier <at> sleuthkit <dot> org
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package org.sleuthkit.autopsy.timeline.ui.detailview.tree;

import java.util.ArrayDeque;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.Map;
import java.util.Optional;
import javafx.scene.control.TreeItem;
import org.sleuthkit.autopsy.coreutils.ThreadConfined;
import org.sleuthkit.autopsy.timeline.datamodel.EventBundle;
import org.sleuthkit.autopsy.timeline.datamodel.eventtype.EventType;

class RootItem extends NavTreeItem {

    private final Map<EventType, EventTypeTreeItem> childMap = new HashMap<>();

    private Comparator<TreeItem<EventBundle<?>>> comparator = TreeComparator.Type.reversed();

    RootItem(Comparator<TreeItem<EventBundle<?>>> comp) {
        comp = comp;
    }

    @Override
    public long getCount() {
        return getValue().getCount();
    }

    @ThreadConfined(type = ThreadConfined.ThreadType.JFX)
    public void insert(EventBundle<?> bundle) {

        EventTypeTreeItem treeItem = childMap.computeIfAbsent(bundle.getEventType().getBaseType(),
                baseType -> {
                    EventTypeTreeItem newTreeItem = new EventTypeTreeItem(bundle, comparator);
                    newTreeItem.setExpanded(true);
                    getChildren().add(newTreeItem);
                    return newTreeItem;
                });
        treeItem.insert(getTreePath(bundle));

    }

    void remove(EventBundle<?> bundle) {
        EventTypeTreeItem typeTreeItem = childMap.get(bundle.getEventType().getBaseType());
        if (typeTreeItem != null) {
            typeTreeItem.remove(getTreePath(bundle));

            if (typeTreeItem.getChildren().isEmpty()) {
                childMap.remove(bundle.getEventType().getBaseType());
                getChildren().remove(typeTreeItem);
            }
        }
    }

    static Deque< EventBundle<?>> getTreePath(EventBundle<?> g) {
        Deque<EventBundle<?>> path = new ArrayDeque<>();
        Optional<? extends EventBundle<?>> p = Optional.of(g);

        while (p.isPresent()) {
            EventBundle<?> parent = p.get();
            path.addFirst(parent);
            p = parent.getParentBundle();
        }

        return path;
    }

    @Override
    void resort(Comparator<TreeItem<EventBundle<?>>> comp, Boolean recursive) {
        comparator = comp;
        childMap.values().forEach(ti -> ti.resort(comp, true));
    }

    @Override
    public NavTreeItem findTreeItemForEvent(EventBundle<?> t) {
        for (EventTypeTreeItem child : childMap.values()) {
            final NavTreeItem findTreeItemForEvent = child.findTreeItemForEvent(t);
            if (findTreeItemForEvent != null) {
                return findTreeItemForEvent;
            }
        }
        return null;
    }
}