fuadsaud

#!/usr/bin/env ruby
# encoding: utf-8
#
# Usage: gemspec [-s] GEMNAME
#
# Prints a basic gemspec for GEMNAME based on your git-config info.
# If -s is passed, saves it as a GEMNAME.gemspec in the current
# directory. Otherwise prints to standard output.
#
# Once you check this gemspec into your project, releasing a new gem

fuadsaud

<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
<plist version="1.0">
<dict>
  <key>ANSIBlueColor</key>
	<data>
	YnBsaXN0MDDUAQIDBAUGFRZYJHZlcnNpb25YJG9iamVjdHNZJGFyY2hpdmVyVCR0b3AS
	AAGGoKMHCA9VJG51bGzTCQoLDA0OVU5TUkdCXE5TQ29sb3JTcGFjZVYkY2xhc3NPEBAw
	Ljk2ODYyNzQ1MSAxIDAAEAGAAtIQERITWiRjbGFzc25hbWVYJGNsYXNzZXNXTlNDb2xv
	cqISFFhOU09iamVjdF8QD05TS2V5ZWRBcmNoaXZlctEXGFRyb290gAEIERojLTI3O0FI

fuadsaud

void Mesh::delete_selected_vertex()
{
	if (!verts[vertex_selected].is_deletable())
		return;
	
	vector<int> new_face_vertex;
	vector<Face*> deleted_faces;
 
	for (int i = 0; i < groups.size(); i++)
	{

fuadsaud

try:
    import bob
except ImportError:
    raise SystemExit('Could not find bob.py. Does it exist?')

import unittest

class BobTests(unittest.TestCase):
    def setUp(self):
        self.bob = bob.Bob()

fuadsaud

class TeamsController
  class Index
    include RoomReservation::Action

    def initialize(repository: TeamRepository)
      @repository = repository
    end

    def call(params)
    end

fuadsaud

(define funcaozao (s l)
  (cond
    (empty? l) 0
    (list? (car l)) (+ (count s (car l)) (funcaozao s (cdr l)))
    else (+ 1 (funcaozao s (cdr l)))))

(define count (s l)
  (cond
    (empty? l) 0
    (= (car l) s) (+ 1 (count (cdr l)))

fuadsaud

Inteligencia Artificial

Sistemas Especialistas

1. O que sao sistemas especialistas?

Um sistema especialista e um sistema computacional que simula a habilidade de tomada de decisoes de um humano especialista em um determinado dominio. Sao projetados com intuito de resolver problemas complexos atraves de raciocionio realizado sobre uma base de conhecimento.

fuadsaud

PLAINTEXT = ARGV[0].gsub(/[^A-Za-z]/, '')
KEY       = ARGV[1]

p KEY
  .chars
  .cycle
  .take(PLAINTEXT.size)
  .zip(PLAINTEXT.chars)
  .reduce(Hash.new { [] }) { |acc, (key, char)| acc.merge(key => acc[key] + [char]) }
  .to_a

fuadsaud

(defn make-composed-comparison [& comparisons]
  (fn [p1 p2]
    (let [results (for [comparison comparisons] (comparison p1 p2))
          first-non-zero-result
          (some (fn [result] (if (not (= 0 result)) result nil)) results)]
      (if (nil? first-non-zero-result)
        0
        first-non-zero-result))))

fuadsaud

module Dijkstra where

import Data.Char (isDigit)
import Data.Map (Map)
import qualified Data.Map as M

type Q = String

data Dijkstra = Dijkstra Int [Q] deriving Show