Help creating this please!

I have attached two images I have seen on another site. Nothing mind blowing however I really like the glassy look of these.
I always struggle making layers and gradients look convincing and was wondering if anyone has any words of wisdom in recreating this look.
I love the way each background is rich in colour as well as depth and it is that I am having problems with.
Many thanks.
ps, pic are screen captured hence the text looking odd.

Looks like a rectangle with a radial gradient as the first object, then a white oval at about 2% opacity over that. Fireworks .png:
I made a graphic showing how to edit gradient colors some time ago (at least, in CS3). Click on the drop down arrow and select Fill Options.... Then click the Edit button. You use the color chips to set the color of each node and you can also set the opacity of each node. You can add nodes and slide them to narrow portions of the color band.

Similar Messages

Hi I got an email from itunes saying that my pre order was ready and when I click on the link from my ipad it takes me to the itunes store app and then it doesn't do anything help with this please.

Hi I got an email from itunes saying that my pre order was ready and when I click on the link from my ipad it takes me to the itunes store app and then it doesn't do anything help with this please .
<Link Edited By Host>

Thanks for your advice, I went to the apple shop today for a face to face meeting with a tech and he checked everything and could not figure out why I was having this problem so we decided to give up on that account and create a whole new one for me using a different email address.
Now I can download apps on both my iPhone and ipad2.
If anyone is reading this in Brisbane Australia go to the Chermside apple shop and ask for Wade. He was fantastic!
Jan

Itunes istallation freezes at 'Publishing Product Information'. Can anyone help with this please?

Itunes istallation freezes at 'Publishing Product Information'. Can anyone help with this please?

You need more memory. 4 GB is not enough:
1.12 GB Page-outs
[killed] com.apple.CallHistoryPluginHelper.plist
[killed] com.apple.CallHistorySyncHelper.plist
[killed] com.apple.cmfsyncagent.plist
[killed] com.apple.coreservices.appleid.authentication.plist
[killed] com.apple.sbd.plist
[killed] com.apple.security.cloudkeychainproxy.plist
[killed] com.apple.telephonyutilities.callservicesd.plist
7 processes killed due to memory pressure
Problem System Launch Daemons: ℹ️
[killed] com.apple.ctkd.plist
[killed] com.apple.icloud.findmydeviced.plist
[killed] com.apple.softwareupdate_download_service.plist
[killed] com.apple.wdhelper.plist
4 processes killed due to memory pressure

My iPhone 4 is going auto off and auto on. Could you please help on this please

my iPhone 4 is going auto off and auto on. Could you please help on this please

iOS 8.1.3 is the latest version. There's nothing to download.

HT4208 When I tap the Apple store, youtube and the itunes apps on my iPad they do not open. Any help with this please?

When I tap the Apple store, YouTube and the iTunes apps, they don' launch. Any help with this?

1. Double-click the Home button to close all Inactive Apps in Task Bar
2. Hold the Apps in Task Bar down for a second or two until you see the minus sign
3. Tap the minus sign to close App
4. Tap center of screen to return to Home Screen
5. Reset iPad. Hold the Sleep and Home button down for about 10 second until you see the Apple logo. Ignore the red slider

How do I create this please?

I'm relatively new to CS4 and was hoping someone could suggest the best way to create this flowing shoal effect - made out of colored fish outlines?
Many thanks in advance.

Draw one black fish, make it a Scatter brush, play with the options. With the pen tool draw as many paths as you like. Set Colorization method to Tints, and you can make each path a different color.

Please help create this matrix report

Hi,
I'm using Reports6i.
I want to create a matrix report like below.
Country            JUN2008       JUL2008
                  Teu    Feu     Teu   Feu
INDIA             13        9       1     10 .....
.With the query i've written, i get the data like
Country      Dt       Cnt       Typ
IN     JUN2008           9             Feu
IN     JUN2008           13     Teu
IN     JUN2008           10             Feu
IN     JUN2008           1     TeuPlease Help
Edited by: Divya on Jun 21, 2011 5:55 AM

Which tool are you using to create the report Divya?
You may use PIVOT to create the matrix like report.
For Ex;
SELECT *
FROM (SELECT product_code, quantity
FROM pivot_test)
PIVOT (SUM(quantity) AS sum_quantity FOR (product_code) IN ('A' AS a, 'B' AS b, 'C' AS c));
A_SUM_QUANTITY B_SUM_QUANTITY C_SUM_QUANTITY
210 90 160

ACL to secure SNMP - I need help on this please

Hi,
I have addedd the following standard ACL to my router to limit SNMP access only to my Ciscoworks LMS server or SNMP Server but I don't know if I need to enforce it with an access group or not? i beleive that i need but I am not sure how?
access-list 90 permit host 10.1.1.139
access-list 90 deny any log
snmp-server community XXXXXXX ro 90
please help me understand the need for the access-group and if I need it, would it be sonething like this:
access-grup 90 in
applied to ether Interface?
this is my Internal gateway router. all of the users have the ether0 address of this router as their default gateway.
Thx,
Masood

I believe that Masood starts from a valid understanding of an important principle of access lists: after you create an access list you must assign it (creating an access list without assigning it does not affect any traffic). If you want the access list to filter packets on an interface you use the access-group command to assign the access list to the interface.
And Tim is correct that to use an access list to control SNMP access to the router all you need to do is to add the access list number on the command that defines the community string. This is the assignment of the access list. So Masood does not need to take any additional action.
HTH
Rick

Error in tablibs ..Any help on this please

hi,
I am getting the following error when i try to run the below code ..
I put all the files in corresponding folders and i am getting the following error when i run Test.jsp
Error: 500
Location: /Test.jsp
Internal Servlet Error:
org.apache.jasper.compiler.CompileException: /usr/tomcat/webapps/test/Test.jsp(6,0) Unable to load class null
     at org.apache.jasper.compiler.TagBeginGenerator.init(TagBeginGenerator.java:129)
     at org.apache.jasper.compiler.JspParseEventListener$GeneratorWrapper.init(JspParseEventListener.java:761)
     at org.apache.jasper.compiler.JspParseEventListener.addGenerator(JspParseEventListener.java:138)
     at org.apache.jasper.compiler.JspParseEventListener.handleTagBegin(JspParseEventListener.java:911)
     at org.apache.jasper.compiler.DelegatingListener.handleTagBegin(DelegatingListener.java:194)
package examples;
import java.io.*;
import javax.servlet.jsp.*;
import javax.servlet.jsp.tagext.*;
* Given a URI, uses the servlet context to find out how large the
* "real" file is in bytes.
* @author Simon Brown
public class SizeTag extends javax.servlet.jsp.tagext.TagSupport {
/** the URI of the file */
private String uri;
* Performs the processing of this tag.
public int doStartTag() throws JspException {
StringBuffer html = new StringBuffer();
// ask the container (via the servlet context) for the
// real path of a file pointed to by a URI
String realPath = pageContext.getServletContext().getRealPath(uri);
// we can now find out how large the file is
File f = new File(realPath);
long fileLength = f.length();
// build up the HTML piece by piece ...
html.append(fileLength);
html.append(" bytes");
// ... and write it
try {
pageContext.getOut().write(html.toString());
} catch (IOException ioe) {
throw new JspException(ioe.getMessage());
return EVAL_BODY_INCLUDE;
* Standard JavaBeans style property setter for the URI.
* @param s a String representing the URI
public void setUri(String s) {
this.uri = s;
taglib.tld file:-
<?xml version="1.0" encoding="ISO-8859-1" ?>
<!DOCTYPE taglib PUBLIC "-//Sun Microsystems, Inc.//DTD JSP Tag Library 1.1//EN"
"http://java.sun.com/j2ee/dtds/web-jsptaglibrary_1_1.dtd">
<taglib>
<tlibversion>1.0</tlibversion>
<jspversion>1.1</jspversion>
<shortname>examples</shortname>
<uri>http://123.123.142.156/test/taglib</uri>
<info>An example tag library</info>
<tag>
<name>size</name>
<tag-class>examples.SizeTag</tag-class>
<info>Works out how large a file, pointed to by a URI, is in bytes</info>
<attribute>
<name>uri</name>
<required>true</required>
<rtexprvalue>false</rtexprvalue>
</attribute>
</tag>
</taglib>
web.xml file:
<taglib>
<taglib-uri>
http://123.123.142.156/test/taglib
<taglib-uri>
<taglib-location>
/WEB-INF/taglib.tld
<taglib-location>
</taglib>
Test.jsp File:
<html>
<head>
<%@ taglib uri="http://123.123.142.156/test/taglib" prefix="examples" %>
</head>
<body>
The file is <examples:size uri="index.html"/>.
</body>
</html>
Any help please ...
thanks.

Hi Yark,
Please help me .. Still i am getting first error only ...
Error: 500
Location: /development/Test.jsp
Internal Servlet Error:
org.apache.jasper.compiler.CompileException: /usr/tomcat/webapps/development/Test.jsp(5,12) Unable to load class null
     at org.apache.jasper.compiler.TagBeginGenerator.init(TagBeginGenerator.java:129)
     at org.apache.jasper.compiler.JspParseEventListener$GeneratorWrapper.init(JspParseEventListener.java:761)
Here is my code:
taglib.tld file:-
<?xml version="1.0" encoding="UTF-8" ?>
<!DOCTYPE taglib
PUBLIC "-//Sun Microsystems, Inc.//DTD JSP Tag Library 1.2//EN"
"http://java.sun.com/dtd/web-jsptaglibrary_1_2.dtd">
<taglib>
<tlib-version>1.0</tlib-version>
<jsp-version>1.2</jsp-version>
<short-name>examples</short-name>
<uri>http://123.123.142.156/test/taglib</uri>
<display-name>taglib</display-name>
<description>An example tag library</description>
<tag>
<name>size</name>
<tag-class>examples.SizeTag</tag-class>
<body-content>JSP</body-content>
<description>Works out how large a file, pointed to by a URI, is in bytes</description>

<attribute>
<name>uri</name>
<required>true</required>
<rtexprvalue>false</rtexprvalue>
<type>String</type>

</attribute>
</tag>
</taglib>
web.xml:
<taglib>
<taglib-uri>"/WEB-INF/taglib.tld"</taglib-uri>
<taglib-location>/WEB-INF/taglib.tld</taglib-location>
</taglib>
Test.jsp:
<html>
<head>
<%@ taglib uri="/WEB-INF/taglib.tld" prefix="examples" %>
</head>
<body>
The file is <examples:size uri="/jsp/index.html"/>.
</body>
</html>
thanks.

Need help on this Please

1.I have a time sheet entry thing and the status will be pending when i enter the time sheet .It was auto populated by me using a hidden and protected item and after filling it , i will submit it.It will go directly to manager .
2.If manager approves its fine but if he rejects it will come back to me with status rejected .In the tabular form definition i have queried for rejected status in user bin .so tht i can see rejected time sheets .
3.When i want to update the rejected once again, idont know how to change the status of it when submitting again .
Please help me on this asap.Thanks in advance .

Trt this:
import java.awt.*;
import java.awt.event.*;
public class Quan extends Frame implements ActionListener
     int quan     = 0;
     TextField tx = new TextField(""+quan);
     Button solve = new Button("Solve");
public Quan()
     super();
     setBounds(6,6,540,440);
     addWindowListener(new WindowAdapter()
    {     public void windowClosing(WindowEvent ev)
               dispose();
               System.exit(0);
     setLayout(new BorderLayout());
     add(tx,BorderLayout.CENTER);
     add(solve,BorderLayout.SOUTH);
     solve.addActionListener(this);
     setVisible(true);
public void actionPerformed(ActionEvent ae)
     ae.getSource();
     if (ae.getSource() == solve)
          quan = quan + 1;
          tx.setText(""+quan);
public static void main (String[] args)
     new Quan();
}       Noah

TS1646 Just moved and updated my billing info, my iTunes is telling me to contact support to complete my transaction. Can I get help with this please?

Just moved to a new city and updated my banking information. Everytime I try to make a purchase it is telling me that I have contact itunes store support to make my purchase. Can someone please help me with this.

Huh?
There is NO telephone support for itunes at all. You cannot call them
You contact them as everyone esle does:
http://www.apple.com/support/contact/

I need help with this please

javax.servlet.ServletException
at com.evermind.server.http.EvermindPageContext.handlePageThrowable(EvermindPageContext.java:595)
at com.evermind.server.http.EvermindPageContext.handlePageException(EvermindPageContext.java:537)
at jsp.addservice._jspService(addservice.jsp:515)
at com.orionserver.http.OrionHttpJspPage.service(OrionHttpJspPage.java:56)
at oracle.jsp.runtimev2.JspPageTable.service(JspPageTable.java:356)
at oracle.jsp.runtimev2.JspServlet.internalService(JspServlet.java:498)
at oracle.jsp.runtimev2.JspServlet.service(JspServlet.java:402)
at javax.servlet.http.HttpServlet.service(HttpServlet.java:853)
at com.evermind.server.http.ServletRequestDispatcher.invoke(ServletRequestDispatcher.java:847)
at com.evermind.server.http.ServletRequestDispatcher.forwardInternal(ServletRequestDispatcher.java:340)
at com.evermind.server.http.ServletRequestDispatcher.forward(ServletRequestDispatcher.java:229)
at mil.usmc.m4l.servlets.M4LServlet.forward(M4LServlet.java:34)
at mil.usmc.m4l.servlets.EditService.doGet(EditService.java:120)
at javax.servlet.http.HttpServlet.service(HttpServlet.java:740)
at javax.servlet.http.HttpServlet.service(HttpServlet.java:853)
at com.evermind.server.http.ResourceFilterChain.doFilter(ResourceFilterChain.java:65)
at mil.usmc.m4l.filters.M4LCMSFilter.doFilter(M4LCMSFilter.java:150)
at com.evermind.server.http.ServletRequestDispatcher.invoke(ServletRequestDispatcher.java:673)
at com.evermind.server.http.ServletRequestDispatcher.forwardInternal(ServletRequestDispatcher.java:340)
at com.evermind.server.http.HttpRequestHandler.processRequest(HttpRequestHandler.java:830)
at com.evermind.server.http.HttpRequestHandler.run(HttpRequestHandler.java:285)
at com.evermind.server.http.HttpRequestHandler.run(HttpRequestHandler.java:126)
at com.evermind.util.ReleasableResourcePooledExecutor$MyWorker.run(ReleasableResourcePooledExecutor.java:192)
at java.lang.Thread.run(Thread.java:534)
Edited by: user11237193 on Apr 27, 2010 10:58 AM
I am getting error and I ned help with it Thank you for your help.

I'd enter the dell service tags in here to find out what OS the pc was designed for.
http://www.dell.com/support/contents/us/en/19/Category/Product-Support/Self-support-Knowledgebase/locate-service-tag?~ck=mn
For windows I'd ask over here.
http://answers.microsoft.com/en-us/windows
Regards, Dave Patrick ....
Microsoft Certified Professional
Microsoft MVP [Windows]
Disclaimer: This posting is provided "AS IS" with no warranties or guarantees , and confers no rights.

Can I get some help with this please

I got the following error messages from java after running my code.
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 66
     at Graph.ChainingHashTable.get(ChainingHashTable.java:76)
     at Graph.Vertex.isNeighbor(Vertex.java:123)
     at Graph.LinkedGraph.addEdge(LinkedGraph.java:42)
     at Graph.Traversals.main(Traversals.java:311)
The following is my code
Traversal.java
package Graph;
public class Traversals implements Callback<Vertex>
    public void visit( Vertex data )
        System.out.println( data.getName() );
     * Perform a breadth first traversal of the vertices in the given graph
     * starting at the specified node. The call back object is used to process
     * each node as it appears in the traversal.
     * @param g the graph to traverse
     * @param start the vertex where the traversal will start
     * @param cb the object that processes vertices.
    public void BFSTraverse( Graph g, Vertex start, Callback<Vertex> cb )
        Queue<Vertex> waiting = new LinkedQueue<Vertex>(); // Queue of waiting
                                                            // vertices
        // Ensure the graph has no marked vertices
        List<Vertex> vertices = g.getVertices();
        for( vertices.first(); vertices.isOnList(); vertices.next() )
            vertices.get().setTag( false );
        // Put the start vertex in the work queue
        waiting.enqueue( start );
        // While there are waiting vertices
        while( !waiting.empty() )
            // Get the next Vertex
            Vertex curVertex = waiting.front();
            waiting.dequeue();
            // If this Vertex hasn't been processed yet
            if( !curVertex.getTag() )
                cb.visit( curVertex ); // Process the vertex
                curVertex.setTag( true ); // Mark it as visited
                // Put its unmarked neighbors into the work queue
                List<Vertex> neighbors = curVertex.getNeighbors();
                for( neighbors.first(); neighbors.isOnList(); neighbors.next() )
                    Vertex cur = neighbors.get();
                    if( !cur.getTag() )
                        waiting.enqueue( cur );
     * Use Kruskal's algorithm to create a minimum spanning tree for the given
     * graph. The MST is returned in the form of a graph.
     * @param g the graph from which to generate the MST
     * @return a graph containing the the vertices of g and the the edges
     *         nesseary to form a minimum spanning tree.
    public Graph kruskalMST( Graph g )
        // Where the MST will be stored
        Graph mst = new LinkedGraph();
        // All the vertices in the graph
        List<Vertex> vertices = g.getVertices();
        // List of Vertex Sets
        List<Set<String>> vertexSets = new LinkedList();
        // Add the vertices in the original graph to mst
        // and create the vertex sets at the same time
        for( vertices.first(); vertices.isOnList(); vertices.next() )
            String curName = vertices.get().getName();
            Set<String> curSet = null; // new ArrayBasedSet<Vertex>();
            // Add the name of the current vertex to its set and then
            // add the set to the list that contains the vertex sets
            curSet.add( curName );
            vertexSets.add( curSet );
            // Add the current vertex to the MST graph
            mst.addVertex( curName );
        // Put the edges into a heap which effectively sorts them
        Heap<Edge> edges = new ArrayBasedHeap<Edge>();
        List<Edge> allEdges = g.getEdges();
        for( allEdges.first(); allEdges.isOnList(); allEdges.next() )
            edges.insertHeapNode( allEdges.get() );
        // Setup is complete - run the algorithm
        // There is more than one set left in the list vertex sets
        while( vertexSets.size() > 1 )
            // Get the smallest edge
            Edge cur = edges.getSmallest();
            // Find the sets where these vertices are located
            int sourcePos = findSet( vertexSets, cur.getSource().getName() );
            int destPos = findSet( vertexSets, cur.getDest().getName() );
            // If the vertices are in different sets - add the edge to
            // the MST
            if( sourcePos != destPos )
                Set<String> sourceSet = vertexSets.get( sourcePos );
                Set<String> destSet = vertexSets.get( destPos );
                // Add the edge to the MST
                mst.addEdge( cur.getSource().getName(),
                        cur.getDest().getName(), cur.getCost() );
                // Merge the sets
                sourceSet.union( destSet );
                vertexSets.remove( destPos );
        // The MST can be read from this graph
        return mst;
     * Return the position of the first set in the list that contains the
     * specified name.
     * @param vertexSets a list of sets to search.
     * @param name the name being searched for.
     * @return the position of the first set in the list that contains the name
     *         or -1 if the name cannot be found.
    private int findSet( List<Set<String>> vertexSets, String name )
        int retVal = -1;
        // Step through the list and examine each set. Stop when you
        // find a set with the name or we fall off the list
        for( int i = 0; retVal == -1 && i < vertexSets.size(); i = i + 1 )
            Set curSet = vertexSets.get( i );
            // Does the current set contain the name we are looking for?
            if( curSet.contains( name ) )
                retVal = i;
        // Return the position of the set
        return retVal;
     * Perform Dijkstra's Shortest Path algorithm on the given graph, starting
     * at the given vertex.
     * @param g the Graph to traverse.
     * @param name the name of the vertex where the traversal starts.
     * @return an array containing vertex path costs.
    public int[] dijkstraSP( Graph g, String name )
        // The names of the vertices for which the shortest
        // path is not known
        Set<String> u = new ArrayBasedSet<String>();
        // The names of the vertices for which the shortest
        // path is known
        Set<String> s = new ArrayBasedSet<String>();
        // Put the vertices in an array to make things easier
        List<Vertex> vertices = g.getVertices();
        Vertex v[] = new Vertex[ vertices.size() ];
        for( int i = 0; i < vertices.size(); i++ )
            v[ i ] = vertices.get( i );
        // The starting vertex
        Vertex start = g.getVertex( name );
        // The lowest costs seen so far
        int c[] = new int[ v.length ];
        // Temporary edge used by the program
        Edge curEdge = null;
        // Sort the vertices by name so that the costs will
        // appear in order by name
        Heap<String> names = new ArrayBasedHeap<String>();
        // Build the heap
        for( int i = 0; i < v.length; i = i + 1 )
            names.insertHeapNode( v[ i ].getName() );
        // Read out the values
        for( int i = 0; !names.empty(); i = i + 1 )
            v[ i ] = g.getVertex( names.getSmallest() );
        // We "know" the shortest path to the source
        s.add( name );
        // For each vertex, compute the starting cost
        for( int i = 0; i < v.length; i = i + 1 )
            // If this isn't the start node
            if( !v[ i ].getName().equals( name ) )
                // Put it in the unknown set
                u.add( v[ i ].getName() );
                // Compute the initial cost to reach this Vertex
                curEdge = start.getEdge( v[ i ].getName() );
                if( curEdge != null )
                    c[ i ] = curEdge.getCost();
                else
                    // This Vertex is currently unreachable
                    c[ i ] = Integer.MAX_VALUE;
            else
                // It costs 0 to get to the start vertex
                c[ i ] = 0;
        // Set is complete - run the algorithm until all of
        // the paths are known
        while( !u.isEmpty() )
            // Find the position of the lowest-cost unknown node
            int min = Integer.MAX_VALUE;
            int minPos = -1;
            for( int i = 0; minPos == -1 && i < c.length; i = i + 1 )
                if( c[ i ] < min && u.contains( v[ i ].getName() ) )
                    min = c[ i ];
                    minPos = i;
            // We know the shortest path to the vertex
            s.add( v[ minPos ].getName() );
            u.remove( v[ minPos ].getName() );
            // Update the costs based
            for( int i = 0; i < c.length; i = i + 1 )
                // Get the edge between the new shortest and the
                // current node in the array
                curEdge = v[ minPos ].getEdge( v[ i ].getName() );
                // If there is an edge
                if( curEdge != null )
                    // If going through the new node is better than
                    // what has been seen update the cost
                    if( c[ i ] > c[ minPos ] + curEdge.getCost() )
                        c[ i ] = c[ minPos ] + curEdge.getCost();
        return c;
    public static void main( String args[] )
        Traversals t = new Traversals();
        Graph g = new LinkedGraph();
        g.addVertex( "A" );
        g.addVertex( "B" );
        g.addVertex( "C" );
        g.addVertex( "D" );
        g.addVertex( "E" );
        g.addVertex( "F" );
        g.addEdge( "A", "B", 5 );             <--------------------------------------------------------------------------------------------Line 311
        g.addEdge( "A", "D", 9 );
        g.addEdge( "A", "C", 10 );
        g.addEdge( "B", "A", 5 );
        g.addEdge( "B", "D", 4 );
        g.addEdge( "C", "A", 10 );
        g.addEdge( "C", "D", 13 );
        g.addEdge( "C", "E", 14 );
        g.addEdge( "D", "B", 4 );
        g.addEdge( "D", "A", 9 );
        g.addEdge( "D", "C", 13 );
        g.addEdge( "D", "E", 7 );
        g.addEdge( "D", "F", 8 );
        g.addEdge( "E", "C", 14 );
        g.addEdge( "E", "D", 7 );
        g.addEdge( "E", "F", 2 );
        g.addEdge( "F", "D", 8 );
        g.addEdge( "F", "E", 2 );
        int costs[] = t.dijkstraSP( g, "A" );
        for( int i = 0; i < costs.length; i = i + 1 )
            System.out.println( costs[ i ] );
}

ChainingHashTable.java
package Graph;
* An implementation of a HashTable using chaining for collision resolution.
* Javadoc comments for methods specified in the Table interface have been
* omitted.
* This code assumes that the preconditions stated in the comments are true when
* a method is invoked and therefore does not check the preconditions.
public class ChainingHashTable<K, V> implements Table<K, V>
    private List<Tuple<K, V>> hashTable[]; // The hashtable
    int size; // The size of the hash table
     * Create a new hash table.
     * @param cardinality the number of elements in the domain.
    public ChainingHashTable( int cardinality )
        // Note that the cast is necessary because you cannot
        // create generic arrays in Java. This statement will
        // generate a compiler warning.
        hashTable = (LinkedList<Tuple<K, V>>[]) new LinkedList[ cardinality ];
        size = 0;
    public void put( K key, V value )
        int bucket = key.hashCode();
        // Do we need to create a new list for this bucket?
        if( hashTable[ bucket ] == null )
            hashTable[ bucket ] = new LinkedList<Tuple<K, V>>();
        hashTable[ bucket ].add( new Tuple<K, V>( key, value ) );
        size = size + 1;
    public void remove( K key )
        int bucket = key.hashCode();
        List<Tuple<K, V>> chain = hashTable[ bucket ];
        boolean found = false;
        // Is there a chain to search?
        if( chain != null )
            // Step through the chain until we fall off the end or
            // find the tuple to delete
            chain.first();
            while( !found && chain.isOnList() )
                // If this tuple has the key we are looking for
                // delete it and stop the loop
                if( chain.get().getKey().equals( key ) )
                    chain.remove();
                    found = true;
                else
                    chain.next();
    public V get( K key )
        int bucket = key.hashCode();
        List<Tuple<K, V>> chain = hashTable[ bucket ];     <----------------------------------------------------------------Line 76
        V retVal = null;
        // Is there a chain to search?
        if( chain != null )
            // Step through the chain until we find the element or
            // run out of list.
            for( chain.first(); retVal == null && chain.isOnList(); chain
                    .next() )
                // If this tuple has the key we are looking for,
                // extract the value
                if( chain.get().getKey().equals( key ) )
                    retVal = chain.get().getValue();
        return retVal;
    public boolean isEmpty()
        return size == 0;
    public int size()
        return size;
    public int cardinality()
        return hashTable.length;
    public List<K> getKeys()
        List<Tuple<K, V>> chain;
        List<K> keys = new LinkedList<K>();
        // Go through each chain and create a list that contains all
        // of the keys in the table
        for( int i = 0; i < hashTable.length; i++ )
            if( hashTable[ i ] != null )
                chain = hashTable[ i ];
                for( chain.first(); chain.isOnList(); chain.next() )
                    keys.add( chain.get().getKey() );
        return keys;
    public List<V> getValues()
        List<Tuple<K, V>> chain;
        List<V> values = new LinkedList<V>();
        // Go through each chain and create a list that contains all
        // of the keys in the table
        for( int i = 0; i < hashTable.length; i++ )
            if( hashTable[ i ] != null )
                chain = hashTable[ i ];
                for( chain.first(); chain.isOnList(); chain.next() )
                    values.add( chain.get().getValue() );
        return values;
     * Return a string representation of this hash table.
     * @return a string representation of this hash table.
    public String toString()
        StringBuffer hashAsString = new StringBuffer( "" );
        List chain = null;
        for( int i = 0; i < hashTable.length; i = i + 1 )
            hashAsString.append( "h[" + i + "]==" );
            if( hashTable[ i ] != null )
                chain = hashTable[ i ];
                for( chain.first(); chain.isOnList(); chain.next() )
                    hashAsString.append( " " + chain.get() );
            hashAsString.append( "\n" );
        return hashAsString.toString();
} // ChainingHashTable

Capacity pleae help with this please please please !!!!!!!!!!!!!!!!!

when i restored me ipod it gives all the information for example colour, serial number
the problem is my it says.....
capacity 892.0Mb
my ipod isnt 892mb ipod nano!!!!!!!!!!!
that solves why i cant get all my music onto it and i am very confused help me with this someone
need advice!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

The apple knowledge base document shows why you lose around 100mb to 200mb on every ipod
http://docs.info.apple.com/article.html?artnum=60955
In iPod's About menu, the hard disk size is reported as slightly less than the technical specifications for the iPod. The same is true if you connect iPod to your computer in disk mode look at the info or properties window for the disk.
Why the difference? Most hard disk manufacturers measure disk size this way: 1 MB = 1 million bytes (1000 * 1000). A 4 GB disk, therefore, is one that holds 4 billion bytes. Computers, including Windows computers, Macintosh computers and iPod, measure disk size this way: 1 MB = 1 048 576 bytes (1024 * 1024). The difference in these two calculations is what causes the drive to appear as 3.7 GB on a computer, but actually be a 4 billion byte disk.
This difference wont change how many songs you can get onto your ipod. Bear in mind, the song average advertised on the ipod is based on 4 mins per song, encoded at 128kbps in AAC format.
Hope this helps

Help creating this gradient pattern

I'm kinda stumped. Basically I need to create a gradient pattern going from inside (green) to outside (brown) with a small white and yellow step in between. The problem I am having is that I need to follow the pattern of the logo in the middle, but end up with a rectangle on the outside and it needs to be a fluid transition between the colors, kinda like this:
Any advice on how I can get what I am trying to achieve?
Using C3.

Userbak,
Blends like matching Anchor Points.
Presuming the logo pattern has 10 Anchor Points, namely 4 corner ones, 2 top/bottom ones, and 4 at the transition between circular and rectangular parts, you may add 3 matching Anchor Points to each of the horizontal sides of the rectangle, a) one in the middle and b) one on either side; you may move the b) Anchor Points to different (symmetrical) positions, maybe even to coincide with the corner Anchor Points. That may remove the choppiness as much as is possible.
To have one or more colours in between, you may create a stepwise blend with stroke/no fill paths, expand, and create the final blend from that.

Help creating this please!

Similar Messages

Maybe you are looking for