/*
 *                 Sun Public License Notice
 * 
 * The contents of this file are subject to the Sun Public License
 * Version 1.0 (the "License"). You may not use this file except in
 * compliance with the License. A copy of the License is available at
 * http://www.sun.com/
 * 
 * The Original Code is NetBeans. The Initial Developer of the Original
 * Code is Sun Microsystems, Inc. Portions Copyright 1997-2002 Sun
 * Microsystems, Inc. All Rights Reserved.
 */

package org.netbeans.api.nodes2looks;

import java.util.Collections;
import java.util.List;

import org.openide.nodes.Children;
import org.openide.nodes.Node;

import org.netbeans.api.nodes2looks.LookNode;
import org.netbeans.spi.looks.LookSelector;
import org.netbeans.spi.looks.Look;


/** WARNING - This API is not finished and is subject to change
 
 * Please don't use this API for other purposes than testing.
 * 

 * Temporary implementation of Children of a LookNode. The class contains
 * only code wich is necessary for testing looks and may be extended later.
 *
 * @author Petr Hrebejk
 */
final class LookChildren extends Children.Keys {

    /** @param brutal needs clean
     */
    void refreshChildren( boolean brutal ) {
        if (brutal) {
            setKeys (Collections.EMPTY_LIST);
        }
        
        MUTEX.postWriteRequest(new Runnable() {
            public void run() {
                setKeys( getKeys() );
            }
        });
    }
    
    protected void addNotify() {
        setKeys( getKeys () );
    }
    
    protected void removeNotify() {
        setKeys( Collections.EMPTY_LIST );
    }
    
    protected Node[] createNodes( Object key ) {
        if (key == null) return new Node[0];
        
        Node n = getNode ();
        if (! (n instanceof LookNode)) {
            throw new InternalError();
        }

        LookNode ln = (LookNode)n;
                
        
        LookSelector s = ln.getLookSelectorForChildren();
                
        // Find look for the represented object
        Look l = ln.getCache().find ( ln, key );
        
        try {
            LookNode node = new LookNode( key, l, s, ln.getCache() );
            return new Node[] { node };
        }
        catch ( Throwable t ) {
            t.printStackTrace();
            return new Node[] {};
        }
                
    }
    
    
    // Private methods ---------------------------------------------------------
    
    
    private List getKeys() {
        List keys = ((LookNode)getNode ()).getChildObjects ();
        return keys == null ? Collections.EMPTY_LIST : keys;
    }
    
        
}