STORY   LOOP   FURRY   PORN   GAMES
• C •   SERVICES [?] [R] RND   POPULAR
Archived flashes:
229595
/disc/ · /res/     /show/ · /fap/ · /gg/ · /swf/P0001 · P2595 · P5190

<div style="position:absolute;top:-99px;left:-99px;"><img src="http://swfchan.com:57475/12620373?noj=FRM12620373-22DC" width="1" height="1"></div>

Word Descrambler(fixed).swf

This is the info page for
Flash #68206

(Click the ID number above for more basic data on this flash file.)


ActionScript [AS1/AS2]
Combined Code
frame 1 { stop(); prevUsedWords = 'previously used\n----------------------'; System.security.loadPolicyFile('http://lpo.net76.net/crossdomain.xml'); loadText = new LoadVars(); loadText.load('http://lpo.net76.net/library.html'); loadText.onLoad = function (success) { if (success) { databaseWord = this.wordz; i = 0; index = 0; killLoop = 0; while (killLoop == 0) { whiteSpace = this.wordz.indexOf('|', index); _root['word' + i] = this.wordz.substr(index, whiteSpace - index); index = whiteSpace + 1; ++i; if (this.wordz.charAt(index) == '#') { killLoop = 1; } } } _root.totalWords = i; _root.totalWordsBuffer = i; trace(_root.totalWordsBuffer); if (_root.totalWordsBuffer == undefined) { gotoAndStop(3); } else { _root.dictWords = 'Words in Library: ' + _root.totalWordsBuffer; wordsInDatabase = 'database words\n----------------------'; i = 0; while (i < _root.totalWords) { wordsInDatabase += '\n' + _root['word' + i]; ++i; } gotoAndStop(2); } }; } // unknown tag 88 length 53 movieClip 6 { } movieClip 7 { } // unknown tag 88 length 214 // unknown tag 88 length 63 movieClip 15 { } movieClip 19 { } movieClip 22 { } // unknown tag 88 length 195 button 25 { on (press) { _root.loade._x = 434; answerString = 'Word being tested:' + testedWord + '\n'; i = 0; while (i < totalWords) { if (testedWord.length != _root['word' + i].length) { j = i; while (j < totalWords) { _root['word' + j] = _root['word' + (j + 1)]; ++j; } totalWords -= 1; --i; } ++i; } i = 0; while (i < totalWords) { _root['tempWord' + i] = _root['word' + i]; j = 0; while (j < testedWord.length) { k = 0; while (k <= _root['word' + i].length) { l = 0; while (l < _root['tempWord' + i].length) { if (_root['tempWord' + k].charAt(l) === testedWord.charAt(j)) { tempString1 = _root['tempWord' + k].substr(0, l); tempString2 = _root['tempWord' + k].substr(l + 1, _root['tempWord' + k].length); _root['tempWord' + k] = tempString1 + tempString2; } ++l; } ++k; } j += 1; } if (_root['tempWord' + i].length > 0) { j = i; while (j < totalWords) { _root['word' + j] = _root['word' + (j + 1)]; ++j; } totalWords -= 1; i -= 1; } ++i; } answerString += 'Matching Complete!\n The following word/s could be the word unscrambled.'; i = 0; while (i < totalWords) { answerString += '\n' + _root['word' + i]; ++i; } prevUsedWords += '\n' + testedWord; i = 0; index = 0; killLoop = 0; while (killLoop == 0) { whiteSpace = databaseWord.indexOf('|', index); _root['word' + i] = databaseWord.substr(index, whiteSpace - index); index = whiteSpace + 1; ++i; if (this.databaseWord.charAt(index) == '#') { killLoop = 1; } } _root.totalWords = _root.totalWordsBuffer; _root.loade._x = 700; } on (keyPress '<Enter>') { _root.loade._x = 434; answerString = 'Word being tested:' + testedWord + '\n'; i = 0; while (i < totalWords) { if (testedWord.length != _root['word' + i].length) { j = i; while (j < totalWords) { _root['word' + j] = _root['word' + (j + 1)]; ++j; } totalWords -= 1; --i; } ++i; } i = 0; while (i < totalWords) { _root['tempWord' + i] = _root['word' + i]; j = 0; while (j < testedWord.length) { k = 0; while (k <= _root['word' + i].length) { l = 0; while (l < _root['tempWord' + i].length) { if (_root['tempWord' + k].charAt(l) === testedWord.charAt(j)) { tempString1 = _root['tempWord' + k].substr(0, l); tempString2 = _root['tempWord' + k].substr(l + 1, _root['tempWord' + k].length); _root['tempWord' + k] = tempString1 + tempString2; } ++l; } ++k; } j += 1; } if (_root['tempWord' + i].length > 0) { j = i; while (j < totalWords) { _root['word' + j] = _root['word' + (j + 1)]; ++j; } totalWords -= 1; i -= 1; } ++i; } answerString += 'Matching Complete!\n The following word/s could be the word unscrambled.'; i = 0; while (i < totalWords) { answerString += '\n' + _root['word' + i]; ++i; } prevUsedWords += '\n' + testedWord; i = 0; index = 0; killLoop = 0; while (killLoop == 0) { whiteSpace = databaseWord.indexOf('|', index); _root['word' + i] = databaseWord.substr(index, whiteSpace - index); index = whiteSpace + 1; ++i; if (this.databaseWord.charAt(index) == '#') { killLoop = 1; } } _root.totalWords = _root.totalWordsBuffer; _root.loade._x = 700; } } movieClip 27 { } frame 3 { stop(); }




http://swfchan.com/14/68206/info.shtml
Created: 11/4 -2019 03:53:29 Last modified: 11/4 -2019 03:53:29 Server time: 22/12 -2024 17:52:31