public void remove() { if (parent != null) { parent.remove( this ); } } }
public void remove() { if (parent != null) { parent.remove( this ); } } }
public void remove() { if (parent != null) { parent.remove( this ); } } }
public synchronized Gizmo add( Gizmo g ) { if (g.parent == this) { return g; } if (g.parent != null) { g.parent.remove( g ); } // Trying to find an empty space for a new member for (int i=0; i < length; i++) { if (members.get( i ) == null) { members.set( i, g ); g.parent = this; return g; } } members.add( g ); g.parent = this; length++; return g; }
public Gizmo add( Gizmo g ) { if (g.parent == this) { return g; } if (g.parent != null) { g.parent.remove( g ); } // Trying to find an empty space for a new member for (int i=0; i < length; i++) { if (members.get( i ) == null) { members.set( i, g ); g.parent = this; return g; } } members.add( g ); g.parent = this; length++; return g; }
public synchronized Gizmo add( Gizmo g ) { if (g.parent == this) { return g; } if (g.parent != null) { g.parent.remove( g ); } // Trying to find an empty space for a new member for (int i=0; i < length; i++) { if (members.get( i ) == null) { members.set( i, g ); g.parent = this; return g; } } members.add( g ); g.parent = this; length++; return g; }
public synchronized Gizmo addToFront( Gizmo g){ if (g.parent == this) { return g; } if (g.parent != null) { g.parent.remove( g ); } // Trying to find an empty space for a new member // starts from the front and never goes over a none-null element for (int i=length-1; i >= 0; i--) { if (members.get( i ) == null) { if (i == 0 || members.get(i - 1) != null) { members.set(i, g); g.parent = this; return g; } } else { break; } } members.add( g ); g.parent = this; length++; return g; }
public synchronized Gizmo addToFront( Gizmo g){ if (g.parent == this) { return g; } if (g.parent != null) { g.parent.remove( g ); } // Trying to find an empty space for a new member // starts from the front and never goes over a none-null element for (int i=length-1; i >= 0; i--) { if (members.get( i ) == null) { if (i == 0 || members.get(i - 1) != null) { members.set(i, g); g.parent = this; return g; } } else { break; } } members.add( g ); g.parent = this; length++; return g; }
public synchronized Gizmo addToBack( Gizmo g ) { if (g.parent == this) { sendToBack( g ); return g; } if (g.parent != null) { g.parent.remove( g ); } if (members.get( 0 ) == null) { members.set( 0, g ); g.parent = this; return g; } members.add( 0, g ); g.parent = this; length++; return g; }
public synchronized Gizmo addToBack( Gizmo g ) { if (g.parent == this) { sendToBack( g ); return g; } if (g.parent != null) { g.parent.remove( g ); } if (members.get( 0 ) == null) { members.set( 0, g ); g.parent = this; return g; } members.add( 0, g ); g.parent = this; length++; return g; }
public Gizmo addToBack( Gizmo g ) { if (g.parent == this) { sendToBack( g ); return g; } if (g.parent != null) { g.parent.remove( g ); } if (members.get( 0 ) == null) { members.set( 0, g ); g.parent = this; return g; } members.add( 0, g ); g.parent = this; length++; return g; }
@Override public void update() { super.update(); //connection failed if (latestVersion == -1) { alpha -= Game.elapsed/4f; //up to date } else if (!updateAvailable && latestVersion > 0){ alpha -= Game.elapsed/2f; //update available } else if (updateAvailable){ alpha = (float) (0.7f + Math.sin(Game.timeTotal*3)*0.3f); } layout(); if (alpha <= 0f) parent.remove( this ); }
@Override public void update() { super.update(); if ((time -= Game.elapsed) <= 0) { alpha( 0f ); parent.remove( this ); } else { alpha( time / FADE_TIME ); } }
@Override public void update() { super.update(); if ((time -= Game.elapsed) <= 0) { alpha( 0f ); parent.remove( this ); } else { alpha( time / FADE_TIME ); } }
@Override public void update() { super.update(); if ((time -= Game.elapsed) <= 0) { alpha( 0f ); parent.remove( this ); } else { alpha( time / FADE_TIME ); } }