String.addCharAt()





ranking Sort Sort   |   date Sort Sort   |   member Sort Sort
Syndication

« Previous 1 2  ...  8 9 10 11 12 13 14 15 16 Next »
2
Date Submitted Mon. Aug. 11th, 2008 11:43 PM
Revision 1
Scripter Fordiman
Tags JavaScript | sqlite | xul
Comments 0 comments
Dead simple interface for structured SQLite access within XUL, using Mozilla's SQLite Storage API.
2
Date Submitted Mon. Aug. 11th, 2008 11:50 PM
Revision 1
Scripter Fordiman
Tags analytics | drop | google | in | JavaScript
Comments 1 comments
Forgive the formality here; this is one of my professional scripts.

Analyte 1.0 (c) 2008 Bryan Elliott
Purpose:
Simplify inclusion of Google Analytics into any site, add GA tracking to non-HTML links, and reduce 'blocking' action of Google Analytics scripts.

Use:


License:
Unlimited license granted to Abacus Studios, Inc. and I-Site, Inc.
All other parties licensed under CC-BY-SA-3.0:

Creative Commons Attribution / Share Alike 3.0 US
Fulltext and synopsis at
http://creativecommons.org/licenses/by-sa/3.0/us/

This license need not appear in minified or otherwise compressed forms
of this script, so long as the script is in active use by a web site or
application, and no other credit is claimed.
9
Date Submitted Wed. Oct. 25th, 2006 9:57 AM
Revision 1
Helper fastmike
Tags C | File | Java | String
Comments 12 comments
What is Dijkstra Algorithm? click on the link above and first understand what the algorithm is all about. in short it calculates the shortest path from A to F or vise versa. This code i can guarantee is the simplest and easiest code to understand. just search on google and try to compare this code and other dijkstra code and you will see what i am talking about. i spent alot of time myself and my instructor to guide me on the rite path.
http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm(Description)
to see how the algorithm really works go on this website it tells you step by step how to update the cost and which path to choose.
http://renaud.waldura.com/doc/java/dijkstra/
Please give some time to understand the algorithm first and then you can see my code. if you done understand the algorithm it is very useless. i know alot of people need Dijkstra algorithm in java for their HW assignment or Test. i am giving you the solution step by step. anyone who wants to understand please go to the url i have posted above and once you have understand then run the code and for those people who just want to copy so that they can get 90% in their test No Problem Here it is .
First open a notepad and name that file anything like data.txt or datas.txt and make sure the file looks something like this and in this format.
0 3 100 5 100 100 (100 represents infinity)
3 0 6 7 7 100
100 6 0 5 5 3
5 7 5 0 1 100
100 7 5 1 0 2
100 100 3 100 2 0
i name this file as a data.txt file. i have 6 nodes. and A is always the starting node which has the cost of 0 so by looking at the first line i
know that A to A have distance 0, A to B is 3, A to c is Infinity, A to D is 5, A to E is Infinity(means no edge connected with A), A to F is Infinity.
for second line(B to A is 3, and then vise versa) and for the 3rd line it starts for C and etc..
save the txt file by any name and then copy the code which i have posted and then to run type this:
javac routing.java
java routing data.txt
you will get the output. i will say this one more time understand how the algorithm works or ......................
4
Date Submitted Tue. Nov. 7th, 2006 10:28 AM
Revision 1
Helper fastmike
Tags Java | String | System.IO
Comments 0 comments
To create a chatprogram in java we need 2 classes one for Client and one for Server from which the client will be able to connect and exchange text messages. to compile the code simply type these commands in command prompt window:-
1)ipconfig(memorize the Ip address)
2)javac client.java
3)javac server.java
4)java server 10.69.23.203 (You need to type your own ip address)
5) After this you need to open another command prompt window(Make sure the server command prompt window is also open). now type:
java client 10.69.23.203
Thats it.
if anyone have any problems please post a comment and i will answer all of your questions or if you are having trouble in compiling.
12
Date Submitted Mon. Oct. 2nd, 2006 11:59 AM
Revision 1
Beginner drench
Tags escape | HTML | JavaScript | String
Comments 0 comments
Similar to Perl's CGI::escapeHTML(), though (because we can!) this adds it as a method to all String objects.
13
Date Submitted Mon. Oct. 2nd, 2006 1:05 PM
Revision 1
Beginner drench
Tags Array | JavaScript | List | Random | shuffle
Comments 3 comments
It works with Array types. The example is a simple list of numbers, but the array could contain anything; lists of strings, functions, DOM nodes, whatever. Unfortunately, a lot of things that seem like arrays in the DOM aren't really, so you can't shuffle the images on a page with just document.images.shuffle() all by itself.
9
Date Submitted Thu. Feb. 8th, 2007 10:05 AM
Revision 1
Helper dohpaz
Tags "web safe colors" | JavaScript
Comments 0 comments
I had searched high and low for a way to generate a palette of web-safe colors. Despite Google's best efforts, what I had found was lacking for my needs. So, I decided to write a library that would generate all 216 web safe colors, and then allow me to manipulate those colors in any way that I chose.

If anybody is curious as to why I would want to do something so... simple, it is because I needed a very light-weight color picker, and didn't want to mess with any fancy options.
2
Date Submitted Tue. Sep. 12th, 2006 8:00 AM
Revision 1
Beginner dogo
Tags File | String
Comments 0 comments
This function loads an File into an String.
14
Date Submitted Fri. Jul. 28th, 2006 1:10 AM
Revision 1
Beginner delook
Tags Form | HTML | JavaScript
Comments 2 comments
Set a word or phrase in an input field, clear it onfocus
12
Date Submitted Fri. Jul. 28th, 2006 5:48 AM
Revision 1
Beginner delook
Tags google | JavaScript | map
Comments 0 comments
A simple demo of the google maps API
« Previous 1 2  ...  8 9 10 11 12 13 14 15 16 Next »