This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
module HeuristicBacktrac (backtracking) where | |
import List | |
hbacktracking:: | |
(partialSolution -> partialSolution -> Ordering) -- heuristic, A* like | |
-> (partialSolution -> Bool) -- isFinalSolution? | |
-> (partialSolution -> solution) -- convert | |
-> (partialSolution -> [partialSolution]) -- next | |
-> (partialSolution -> Bool) -- isValid? | |
-> [partialSolution] -- Estado inicial |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env python | |
#disclaimer: this code as a SAT solver is pure crap. Don't waste your time. | |
#prettify http://stackoverflow.com/questions/1151658/python-hashable-dicts | |
class hashdict(dict): | |
def __hash__(self): | |
return hash(tuple(sorted(self.items()))) | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
const IDENTICA_STATUS_MAXLEN = 140; | |
var noun_type_identica_user = { | |
label: "user", | |
rankLast: true, | |
noExternalCalls: true, | |
suggest: function nt_idcauser_suggest(text, html, cb, selected) { | |
// reject text from selection. | |
if (!text || selected) | |
return []; |
NewerOlder