Search results

let happy = Responder("good","awesome","great","wonderful","sweet","happy") let curious = Responder("why","where","when","how","who","which","whose") let angry = Responder("hiyas","fudge","angry","waste","stupid","retard")

use a temp neuron to clear the outAlg :s44:

// (*)Algorithm Dispensers class AlgDispenser { // super class to output an algorithm out of a selection of algorithms var algs:Array<Algorithm> = [Algorithm]() var activeAlg:Int = 0 init(_algorithms:Algorithm...){ for alg in _algorithms { algs.append(alg)...

and add rnd simple functions

translate this: class DrawRnd { private var numbers:Array<Int> = [Int]() init(size:Int){ for index in 1...size{ numbers.append(index) } } init(_ markers:Int...) { for num in markers { numbers.append(num) } } func...

too many stinkin folder

I've been playing VNs most of the day trying to crack the loebner puzzle. it would appear combining the spider sense with loads and loads of responders(crafters in this case) could be the key. DJoker skill could also be a heavy upgrade. at any rate, do the cycler AX next

catche k,v limit:int contains overwrite insert has_room()? *** k,v: #,key insertRND(k,V) insertAt(pos,k,v)

we are going to forgea new data structure beast! a cache ! a dictionary with a limited size :s59:

package AXJava; import LivinGrimoire.*; public class LGTypeConverter { private RegexUtil r1 = new RegexUtil(); public int convertToInt(String v1){ String temp = r1.extractRegex(enumRegexGrimoire.integer, v1); if (temp.isEmpty()) {return 0;} return...

OoooWeee! :s40:

done

timestamp! lets see how fast I can do 1 :s69:

time to emp up the beef ! :s40:

6 deployed

1 meeseeks down! kirkland DEPLOYED!!! :s69:

4 deployed meeseeks!

3 deployed

a little under 30