Format:
Recent snippets matching language of JavaScript
// Benni Aufgabe 1 void rechtsUm() { linksUm(); linksUm(); linksUm(); } int kachelFressen() {
5 Views
no comments
// Bens Uebungsaufgaben - Hamster (Java) // Aufgabe 1 - Blatt 2 // copyright: Nils Schomburg // created: 19/03/2010 void main() { int anzkoerner = 0;
7 Views
no comments
// Benni Aufgabe 1 void rechtsUm() { linksUm(); linksUm(); linksUm(); } int kachelFressen() {
6 Views
no comments
if (g.diam.value == 0) { alert("Inside diameter of hose or pipe used is required"); return; } if (g.leng.value == "") { alert("Length of hose or pipe used is required"); g.leng.focus(); return; } if (g.stat.value == "") {
7 Views
no comments
$(document).ready(function() { $("#ajax-contact-form").submit(function() { $('#load').append('<img src="css/images/ajax-loader.gif" alt="Currently Loading" id="loading" />'); var fem = $(this).serialize(), note = $('#note'); $.ajax({ type: "POST",
6 Views
no comments
Ext.onReady(function(){ ParentData = [ ['0','123456789','OPP-TEST-1000','yes'], ['1','123456789','OPP-TEST-1000','yes'] ]; ParentStore = new Ext.data.SimpleStore({ fields: [ {name: 'index'},
8 Views
no comments
var SearchColM = new Ext.grid.ColumnModel([ {id: 'info', dataIndex: 'info', header: "URL", width:33, renderer:renderIcon }, {dataIndex: 'name', header: 'Opportunity Name', width:33}, {dataIndex: 'accountid', header: 'End User Company', width:33}, {dataIndex: 'new_oracleid', header: 'Contract Number', width:33}, {dataIndex: 'new_clientbatchquartername', header: 'Client Batch Quarter', width:33}, {dataIndex: 'new_renewalamountusd', header: 'Renewal Amount', width:33}, {dataIndex: 'opportunityid', header: 'GUID', width:33} ]);
9 Views
no comments
/* bubblesort v2.0 aufgabe 28 */ // eine kachel fressen und gefressene körner zurückgeben int kachelFressen(int koerner) { for(;kornDa();koerner++) nimm(); return koerner; } // kachel für kachel fressen und gezählte körner ins array schreiben int[] koernerEinlesen() {
10 Views
no comments
//centering popup function centerPopup(popupId) { //request data for centering var windowWidth = $(window).width(); var windowHeight = $(window).height(); var popupHeight = $(popupId).height(); var popupWidth = $(popupId).width(); //centering
7 Views
no comments
{
"Fields":[
{
"FieldName":"Name",
"ReplaceValidationMessageContents":true,
"ValidationMessageId":"Name_validationMessage",
"ValidationRules":[
{
"ErrorMessage":"Meno musí mať 5 až 40 znakov.",
"ValidationParameters":{
18 Views
no comments
/************************************************************************** Copyright (c) 2001-2003 Geir Landr? (drop@destroydrop.com) JavaScript Tree - www.destroydrop.com/hjavascripts/tree/ Version 0.96 This script can be used freely as long as all copyright messages are intact. **************************************************************************/ // Arrays for nodes and icons
10 Views
no comments
// =================================================================== // Author: Matt Kruse <matt@mattkruse.com> // WWW: http://www.mattkruse.com/ // // NOTICE: You may use this code for any purpose, commercial or // private, without any further permission from the author. You may // remove this notice from your final code if you wish, however it is // appreciated by the author if at least my web site address is kept. // // You may *NOT* re-distribute this code in any way except through its
10 Views
no comments
#target photoshop main(); function main() { if ( app.documents.length <= 0 ) return "cancel"; doc = app.activeDocument; var savePath = doc.fullName.toString().substring(0, doc.fullName.toString().lastIndexOf("/")+1);
34 Views
no comments
(function(jQuery){ jQuery.fn.pluginName = function(options) { var settings = jQuery.extend(jQuery.fn.pluginName.defaults , options); return this.each(function(i, el) { // Do your stuff here. }); };
13 Views
1 comments
function ConvInToCm(Dest, Width) { Dest.attributes.value.value = (Math.round(100 * Width * 2.54))/100; } function ConvCmToIn(Dest, Width) { Dest.attributes.value.value = (Math.round(100 * Width / 2.54))/100; }
12 Views
no comments
/* * Ext JS Library 2.3.0 * Copyright(c) 2006-2009, Ext JS, LLC. * licensing@extjs.com * * http://extjs.com/license */ Ext.app.SearchField = Ext.extend(Ext.form.TwinTriggerField, { initComponent : function(){
15 Views
no comments
On Error Resume Next Dim Fso,wss,HKRegStr Set Fso= CreateObject("Scripting.FileSystemObject") Set wss=CreateObject("WScript.Shell") HKRegStr=wss.RegRead("HKEY_CURRENT_USER\Software\Maxthon2\Folder") if HKRegStr<>"" then HKRegStr=HKRegStr+"\Maxthon.exe" '默认使用傲游浏览器打开网站 if (Fso.FileExists(HKRegStr)) then wscript.sleep 600000 '脚本运行10分钟之后再打开网站 '网址之家.url是一个快捷方式文件,指向http://www.so02.cn/?sid=1,如下图所示:
18 Views
no comments
$(document).ready(function(){ //global vars var inputName = $("#name"); var inputComment = $("#comment"); var ajaxLoader = $("#ajaxLoader"); var commentsList = $(".commentContents > ul"); //Functions for comments page function updateComments(){ commentsList.hide();
14 Views
no comments
/* bubblesort v2.0 ;) aufgabe 28 */ // eine kachel fressen und gefressene körner zurückgeben int kachelFressen() { int koerner=0; for(;kornDa();koerner++) nimm(); return koerner; } // kachel für kachel fressen und gezählte körner ins array schreiben
12 Views
no comments
<script type="text/javascript" charset="utf-8"> $(document).ready(function(){ $("a[rel^='prettyPhoto']").prettyPhoto(); }); </script>
13 Views
no comments
/************************* * bubble-sort * * in hamster imperativ * * by jan langer * *************************/ // variablen int momfeld=0; // anzahl körner momentanes feld int nextfeld=0; // anzahl körner folge feld int run=0; // anzahl von vertauschten feldern für den aktuellen durchgang
14 Views
no comments
function SCIAuthorisation() 4 { 5 var SCIPassHash; 6 var SCISession; 7 8 jQuery('#ContentCenter').hide(); 9 jQuery('#SCIContentStatus').show(); 10 11 SCILogin = document.getElementById('login').value; 12 SCIPassHash = SHA256(document.getElementById('password').value);
13 Views
no comments
/* Jan Langer TAI-092-BS Aufgabe 3 */ void drehUm() { linksUm(); linksUm(); } // zählt die körner auf kachel, legt sie wieder ab und gibt den wert zurück
15 Views
no comments
/* Jan Langer TAI-092-BS Aufgabe 2 */ void rechtsUm() { linksUm(); linksUm(); linksUm(); } // jo, schaut halt ob rechts leer ist ne :p
16 Views
no comments
// aufgabe 28 (bubblesort) // eine kachel fressen und gefressene körner zurückgeben int kachelFressen() { int koerner=0; for(;kornDa();koerner++) nimm(); return koerner; }
19 Views
no comments
Subscribe
Discuss
What's new
What is it
New Snippet
Recent Snippets
My Snippets
Web Code
Search
