DZone Snippets: data code

Basic Trie data structure in Ruby

ntk () — Sat, 07 Jun 2008 20:54:39 GMT



# Inspired by http://www.rubyquiz.com/quiz103.html

# cf. also http://en.wikipedia.org/wiki/Trie



#!/usr/local/bin/ruby -w



require 'pp'



class Hash



   def deep_merge!(second)

      # cf. http://snippets.dzone.com/posts/show/4146

      merger = proc { |key,v1,v2| Hash === v1 && Hash === v2 ? v1.merge(v2, &merger) : v2 }

      self.merge!(second, &merger)

   end



   def nested_hash(array)

      node = self

      array.each do |i|

         node[i]=Hash.new if node[i].nil?

         node = node[i]

      end 

      self

   end



   def merge_nested_hash!(nested_hash)

      deep_merge!(nested_hash)

   end



   # code basis taken from: "Find every path and it's value in a Hash" by Florian Aßmann,

   # http://snippets.dzone.com/posts/show/3565



   def each_trie_path

      raise ArgumentError unless block_given?

      self.class.each_trie_path(self) { |path, object| yield(path, object) }

   end



   protected

   def self.each_trie_path(object, path = [], &block)  



      if object.is_a?(Hash)

         object.each do |key, value|



            if key == true && value == {}

               if path == [:root]  # special case for empty string: [[:root], {true=>{}}]

                  yield(path, {true=>{}})

                  next

               end

               yield(path, object)

            end



            self.each_trie_path(value, [path , key].flatten, &block)

         end

      else 

         yield(path, object)

      end

   end 



end





class Trie



   @hash = Hash.new.merge_nested_hash!(Hash.new)

   #@hash = Hash.new.merge_nested_hash!({:root=>{}})

   #@hash = Hash.new.merge_nested_hash!(Hash.new.nested_hash([:root]))

   class << self; attr_accessor :hash; end    # Trie.hash



   def initialize

      Trie.hash.merge_nested_hash!({:root=>{}})

   end





   def add_int(int)   # for int >= 0

      ia = int.to_s.scan(/[[:digit:]]/).map { |i| i.to_i }  # integer array; ex: [4,6,2]

      ia.unshift(:root).push(true)

      Trie.hash.merge_nested_hash!(Hash.new.nested_hash(ia))

   end



   def matchi(int)  # match integer

      ia = int.to_s.scan(/[[:digit:]]/).map { |i| i.to_i }  

      node = Trie.hash.fetch(:root,nil)

      ia.each do |digit|

         node = node[digit]

         #node = node.fetch(digit,nil)

         return false unless node

      end

      node.fetch(true,nil) ? true : false

   end



   def mfpi(int)   # match first part of integer

      ia = int.to_s.scan(/[[:digit:]]/).map { |i| i.to_i }

      node = Trie.hash.fetch(:root,nil)

      ia.each do |digit|

         node = node[digit]

         return false unless node

      end

      return true

   end





   def add_word(word)

      ca = word.split(//u)    # UTF-8 aware character array

      ca.unshift(:root).push(true)

      Trie.hash.merge_nested_hash!(Hash.new.nested_hash(ca))

   end



   def match(word)   # match entire word

      ca = word.split(//u)    

      node = Trie.hash.fetch(:root,nil)

      ca.each do |char|

         node = node[char]

         #node = node.fetch(char,nil)

         return false unless node

      end

      node.fetch(true,nil) ? true : false

   end



   def mfpw(word)   # match first part of word

      ca = word.split(//u)    

      node = Trie.hash.fetch(:root,nil)

      ca.each do |char|

         node = node[char]

         return false unless node

      end

      return true

   end



end





trie = Trie.new

p Trie.hash



trie.add_word("word")

pp Trie.hash            

p trie.match("word")      

p trie.match("word2")   

trie.add_word("word2")

p trie.match("word2")   

pp Trie.hash            # {:root=>{"w"=>{"o"=>{"r"=>{"d"=>{true=>{}, "2"=>{true=>{}}}}}}}}



trie.add_word("")

p trie.match("")

pp Trie.hash



puts



p trie.match("word")      

p trie.mfpw("wor")     # match first part of word



puts



trie.add_int(12345)

p Trie.hash



trie.add_int(12980345)

pp Trie.hash



trie.add_int(8512)

pp Trie.hash

p trie.matchi(8512)

p trie.matchi(85)

p trie.mfpi(85)     # match first part of integer

p trie.matchi(51)



puts



puts

pp Trie.hash

paths = []

Trie.hash.each_trie_path { |path, value| paths.push([ path ]) }

#Trie.hash.each_trie_path { |path, value| paths.push([ path, value ]) }

#pp paths

puts

paths.each { |x| p x }

puts





#------------------------------------------------------





require 'pp'



class Hash

   def Hash.new_nested_hash

     Hash.new{|h,k| h[k]=Hash.new(&h.default_proc) }

   end

end





class Trie



   @hash = Hash.new_nested_hash

   #@hash = Hash.new_nested_hash.update(true=>{})  # add empty string by default

   class << self; attr_accessor :hash; end    # Trie.hash



   def <<(word)

      ca = word.split(//u)    # UTF-8 aware character array

      wl = ca.size            # word length

      str = ""

      wl.times { |x| str << "[ca.at(#{x})]" }

      str = "Trie.hash" << str << "[true]"

      #p str     # example: "Trie.hash[ca.at(0)][ca.at(1)][ca.at(2)][ca.at(3)][true]"

      eval(str)

   end





   def match(word)

      ca = word.split(//u)    # UTF-8 aware character array

      wl = ca.size            # word length

      str = ""



      wl.times { |x| str << ".fetch(ca.at(#{x}),nil)" }

      str = "Trie.hash" << str << ".fetch(true,nil)"

      #p str   # example: "Trie.hash.fetch(ca.at(0),nil).fetch(ca.at(1),nil).fetch(ca.at(2),nil).fetch(true,nil)"

      ret = eval(str) rescue nil



=begin

      # alternative

      wl.times { |x| str << ".fetch(ca.at(#{x}),{})" }

      str = "Trie.hash" << str << ".fetch(true,nil)"

      #p str   # example: "Trie.hash.fetch(ca.at(0),{}).fetch(ca.at(1),{}).fetch(ca.at(2),{}).fetch(true,nil)"

      ret = eval(str)

=end



      ret == {} ? true : false   # {} is the default value created by Trie.hash or Hash.new_nested_hash respectively

   end



end





trie = Trie.new

trie << "word"

pp Trie.hash            

p trie.match("word")      

p trie.match("word2")   

trie << "word2"

p trie.match("word2")   

pp Trie.hash            # {"w"=>{"o"=>{"r"=>{"d"=>{true=>{}, "2"=>{true=>{}}}}}}}



trie << ""

p trie.match("")

pp Trie.hash





#------------------------------------------





# alternative with default :root element



require 'pp'



class Hash

   def Hash.new_nested_hash

     Hash.new{|h,k| h[k]=Hash.new(&h.default_proc) }

   end

end





class Hash



   # code basis taken from: "Find every path and it's value in a Hash" by Florian Aßmann,

   # http://snippets.dzone.com/posts/show/3565



   def each_trie_path

      raise ArgumentError unless block_given?

      self.class.each_trie_path(self) { |path, object| yield(path, object) }

   end



   protected

   def self.each_trie_path(object, path = [], &block)  



      if object.is_a?(Hash)

         object.each do |key, value|



            if key == true && value == {}

               if path == [:root]  # special case for empty string: [[:root], {true=>{}}]

                  yield(path, {true=>{}})

                  next

               end

               yield(path, object)

            end



            self.each_trie_path(value, [path , key].flatten, &block)

         end

      else 

         yield(path, object)

      end

   end 



end





class Trie



   @hash = Hash.new_nested_hash

   class << self; attr_accessor :hash; end    # Trie.hash



   def initialize

      Trie.hash[:root]

   end





   def add_int(int)   # for int >= 0

      ia = int.to_s.scan(/[[:digit:]]/).map { |i| i.to_i }  # integer array; ex: [4,6,2]

      ia.unshift(:root)

      str = ""

      ia.size.times { |x| str << "[ia.at(#{x})]" }

      str = "Trie.hash" << str << "[true]"

      eval(str)

   end



   def matchi(int)  # match integer

      ia = int.to_s.scan(/[[:digit:]]/).map { |i| i.to_i }  

      node = Trie.hash.fetch(:root,nil)

      ia.each do |digit|

         node = node.fetch(digit,nil)

         return false unless node

      end

      node.fetch(true,nil) ? true : false

   end



   def mfpi(int)   # match first part of integer

      ia = int.to_s.scan(/[[:digit:]]/).map { |i| i.to_i }

      node = Trie.hash.fetch(:root,nil)

      ia.each do |digit|

         node = node.fetch(digit,nil)

         return false unless node

      end

      return true

   end





   def <<(word)

      ca = word.split(//u)    # UTF-8 aware character array

      ca.unshift(:root)

      #ca = [:root, *word.split(//u)]

      #ca = [:root].concat(word.split(//u))

      str = ""

      ca.size.times { |x| str << "[ca.at(#{x})]" }

      str = "Trie.hash" << str << "[true]"

      #p str     # example: "Trie.hash[ca.at(0)][ca.at(1)][ca.at(2)][ca.at(3)][true]"

      eval(str)

   end



   def match(word)

      ca = word.split(//u)    

      ca.unshift(:root)

      #ca = [:root, *word.split(//u)]

      #ca = [:root].concat(word.split(//u))

      str = ""

      ca.size.times { |x| str << ".fetch(ca.at(#{x}),nil)" }

      str = "Trie.hash" << str << ".fetch(true,nil)"

      #p str   # example: "Trie.hash.fetch(ca.at(0),nil).fetch(ca.at(1),nil).fetch(ca.at(2),nil).fetch(true,nil)"

      ret = eval(str) rescue nil



=begin

      # alternative

      ca.size.times { |x| str << ".fetch(ca.at(#{x}),{})" }

      str = "Trie.hash" << str << ".fetch(true,nil)"

      #p str   # example: "Trie.hash.fetch(ca.at(0),{}).fetch(ca.at(1),{}).fetch(ca.at(2),{}).fetch(true,nil)"

      ret = eval(str)

=end



      ret == {} ? true : false   # {} is the default value created by Trie.hash or Hash.new_nested_hash respectively

   end



   def match2(word)   # match entire word

      ca = word.split(//u)    

      node = Trie.hash.fetch(:root,nil)

      ca.each do |char|

         node = node.fetch(char,nil)

         return false unless node

      end

      node.fetch(true,nil) ? true : false

   end



   def mfpw(word)   # match first part of word

      ca = word.split(//u)    

      node = Trie.hash.fetch(:root,nil)

      ca.each do |char|

         node = node.fetch(char,nil)

         return false unless node

      end

      return true

   end



end





trie = Trie.new

trie << "word"

pp Trie.hash            

p trie.match("word")      

p trie.match("word2")   

trie << "word2"

p trie.match("word2")   

pp Trie.hash            # {:root=>{"w"=>{"o"=>{"r"=>{"d"=>{true=>{}, "2"=>{true=>{}}}}}}}}



trie << ""

p trie.match("")

pp Trie.hash



puts



p trie.match2("word")      

p trie.mfpw("wor")     # match first part of word



puts



trie.add_int(8512)

pp Trie.hash

p trie.matchi(8512)

p trie.matchi(85)

p trie.mfpi(85)     # match first part of integer

p trie.matchi(51)



puts



puts

pp Trie.hash

paths = []

Trie.hash.each_trie_path { |path, value| paths.push([ path ]) }

#Trie.hash.each_trie_path { |path, value| paths.push([ path, value ]) }

#pp paths

puts

paths.each { |x| p x }

puts

Pull Date-Effective Records that Overlap Each Other

jokeyxero (xero) — Wed, 04 Jun 2008 19:54:15 GMT

Basic framework and examples of how to pull records that overlap each other from a temporal (aka date-effective) database.



-- PK is a placeholder for the Primary Key column(s)

-- SoftPK is a placeholder for columns that need to match for overlap, but are not the PK

-- Sometimes SoftPK is the PK, in which case you remove the <> PK line and match the SoftPK.

-- The idea is to check for overlap on all rows except for yourself, since that always overlaps.

--   This snippet assumes the EndDate column has a NULL to represent infinity.

--   There are alternate syntaxes for this (compare or EndDate is null) but I've found

--   the Coalesce to provide the best query plan usually. The constant itself is debatable and

--   implementation dependent.

select outer.*

from DateEffectiveTable as outer

where exists (

  select 1

  from DateEffectiveTable as inner

  where inner.PK <> outer.PK

    -- and inner.SoftPK = outer.SoftPK

    and inner.StartDate <= coalesce(outer.EndDate, '9999-12-31')

    and coalesce(inner.EndDate, '9999-12-31') > outer.StartDate

)





-- Example Usage

-- Assume we have a table containing the address history for a person

-- A person may have multiple addresses at once (own multiple houses).

-- A person may move away then back (same address, different time ranges).

-- ie, multiple simultaneous unique records are possible, but not

-- multiple simultaneous non-unique records (no self-overlap).

-- Yes, it is usually an odd design to have an AddressID, but go with it.

select outer.*

from AddressHistory as outer

where exists (

  select 1

  from AddressHistory as inner

  where outer.AddressID <> inner.AddressID

    and outer.PersonID = inner.PersonID

    and outer.Street = inner.Street

    and outer.Zip = inner.Zip

    and inner.StartDate <= coalesce(outer.EndDate, '9999-12-31')

    and coalesce(inner.EndDate, '9999-12-31') > outer.StartDate





-- Same example, but assume PK is a more "appropriate" one of

-- { PersonID, Street, Zip, StartDate }

select outer.*

from AddressHistory as outer

where exists (

  select 1

  from AddressHistory as inner

  where 

    not (

     outer.PersonID = inner.PersonID

     and outer.Street = inner.Street

     and outer.Zip = inner.Zip

     and outer.StartDate = inner.StartDate

    )

    and outer.PersonID = inner.PersonID

    and outer.Street = inner.Street

    and outer.Zip = inner.Zip

    and inner.StartDate <= coalesce(outer.EndDate, '9999-12-31')

    and coalesce(inner.EndDate, '9999-12-31') > outer.StartDate

Pull Date-Effective Records that Intersect A Given Range

jokeyxero (xero) — Fri, 16 May 2008 14:50:51 GMT

Basics of how to pull records that intersect a date range from a temporal (aka date-effective) database.



-- @rangeStart is the start of the date range of interest

-- @rangeEnd is the end of the date range of interest

-- If you use null to signify infinity, then use the commented line instead of the one above it.

select *

from DateEffectiveTable

where StartDate < @rangeEnd

  and EndDate >= @rangeStart

  -- and coalesce(endDate, '9999-12-31') >= @rangeStart

A simple test case using Ruby and XML - Part II

jrobertson (James Robertson) — Tue, 09 Oct 2007 09:55:48 GMT

This code tests for the success of a single Class. It reads in the test variables from an xml file and then performs a simple test. Refer to Part I (http://urltea.com/1p7h [dzone.com]) of the ruby code (testdata.rb), and Part III (http://urltea.com/1p7p [dzone.com])



#file: test_feed.rb



require 'testdata.rb'

require 'feed.rb'



include REXML



class Test_feed < Testdata



  def initialize()



    url = 'http://jamesrobertson.eu/test/feed/'

    testfile = "testfile.xml"

    load(url + testfile)



    @in_filepath = get_input('filepath')

    @in_project = get_input('project')

    @in_date = get_input('date')

    @out_filepath = get_output('filepath')

    @out_file = get_output('file')

  end



  def tested

    feed = Feed.new

    feed.create_file(@in_filepath, @in_project)

    File.exist?(@out_filepath + @out_file)

  end



end



#test 

#test_feed = Test_feed.new()

#puts test_feed.tested

A simple test case using Ruby and XML - Part I

jrobertson (James Robertson) — Tue, 09 Oct 2007 09:43:03 GMT

Inspired by Gregg Pollack's, Ruby on Rails testing video http://tinyurl.com/ystb4o, this code reads an XML file containing test related variables, to use in an actual test case. Refer to parts II (http://urltea.com/1p7m [dzone.com]), and III (http://urltea.com/1p7p [dzone.com])



#file: testdata.rb



require 'net/http'

require 'rexml/document'



include REXML



class Testdata



  def initialize

  end



  def load(url)

    xml_data = Net::HTTP.get_response(URI.parse(url)).body

    @doc = Document.new(xml_data)

    true

  end



  def get_input(name)

    @doc.root.elements['test/inputs/input/' + name].text

  end



  def get_output(name)

    @doc.root.elements['test/outputs/output/' + name].text

  end



  def tested?()



  end



  def print(method, result)

    puts "#{result}"

  end



  def plan

    @doc

  end



end



#test 

#url = 'http://m.jamesrobertson.eu/test/testdata/'

#testfile = "testfile.xml"



#td = Testdata.new

#td.load(url + testfile)

#print('get_input', #td.get_input('input1').scan('instring').length > 0)

#print('get_output', td.get_output('output1').scan('outstring').length > 0)



#puts test_feed.tested?

Populate PostgreSQL tables

ribafs (Ribamar FS) — Fri, 30 Mar 2007 15:06:16 GMT

This script in PHP populate with demo data tables Postgresql.
It insert serious registers automatically in a table.
Remove the primary key before run.



/** Rotina para popular tabela do PostgreSQL com massa de testes

  * Colaboração de Ribamar FS - http://ribafs.net - 14/03/2007

  * Requer remoção da chave primáia antes da execução.

  */ 

?>



Inserir Registros de Teste



Cadastrar Tabela do PostgreSQL com Massa de Testes

Remova chave primáia da tabela, antes de executar

Observe que nem todos os tipos de dados foram contemplados, alguns ficarão como string

















Host 
Banco 
Usuário 
Senha 
Tabela 
Registros 










if(isset($_POST['popular'])){

	$host=$_POST['host'];

	$banco=$_POST['banco'];

	$usuario=$_POST['usuario'];

	$senha=$_POST['senha'];

	$tabela=$_POST['tabela'];

	$registros=$_POST['registros'];



	$conexao=pg_connect("host=$host user=$usuario password=$senha dbname=$banco port=5432");

	if (!$conexao){

		die('Erro ao conectar ao banco
'.pg_last_error($conexao));

	}

	$str="SELECT * FROM $tabela";

	$consulta= pg_query($conexao,$str);

	$nc=pg_num_fields($consulta);

	$nr=pg_num_rows($consulta);



   $n='';//numericos (int, tinyint, smallint, bigint, etc)

   $r=''; //reais (float e double)

   $s="'";//strings

   $d=date('Y-m-d'); //datas

   $dt=date('Y-m-d H:i:s');//datatimes

   $o=''; //outros



   	$inscod .="INSERT INTO $tabela (";

   	for ($j = 0; $j < $nc; $j++) {

      $campo = pg_field_name($consulta, $j);

		if ($j < $nc-1)	$inscod .= "$campo,";

     	else $inscod .= "$campo";

	}

	$inscod .= ")";	 

    $inscod .= " VALUES (";



   for ($j = 0; $j < $nc; $j++) {   

   $tam   = pg_field_size($consulta, $j);

   if($tam == -1) $tam=20; //Caso queira limitar os campos ao máximo de 20 posiçes

		if ($j < $nc-1){ 

			switch (pg_field_type($consulta, $j)){

				case 'int4':

					$n=str_pad($n,$tam,'12345679890');

					$inscod .= "$n,";

					break;

     			case 'float4':

					$r=str_pad($r,$tam,'1234567890');

					$inscod .= "$r,";

					break;

				case 'bpchar':

				case 'varchar':

					$s=str_pad($s,$tam,"abcdefghijklmnopqrstuvxyz");

					$inscod .= "$s',";

					break;

				case 'date':

		 		    $inscod .= "'$d',";

					break;

				case 'timestamp':

					$inscod .= "'$dt',";

					break;

				case 'text':

					$inscod .= "'$t'";

					break;

				default:

					$o=str_pad($o,$tam,"abcdefghijklmnopqrstuvxyz");

					$inscod .= "'$o',";

					break;

			}

     	}else{

     		switch (pg_field_type($consulta, $j)){

				case 'int4':

					$n=str_pad($n,$tam,'1234567890');

					$inscod .= "$n";

					break;

     			case 'float4':

					$r=str_pad($r,$tam,'1234567890');

					$inscod .= "$r";

					break;

				case 'bpchar':

				case 'varchar':

					$s=str_pad($s,$tam,"abcdefghijklmnopqrstuvxyz");

					$inscod .= "$s'";

					break;

				case 'date':

					$inscod .= "'$d'";

					break;

				case 'timestamp':

					$inscod .= "'$dt'";

					break;

				case 'text':

					$inscod .= "'$t'";

					break;

				default:

					$o=str_pad($o,$tam,"abcdefghijklmnopqrstuvxyz");

					$inscod .= "'$o'";

					break;

     		}

     	}

     	

	}

    $inscod .=");";	

	

    for($r=1;$r<=$registros;$r++){	   

		//echo  $inscod;

	   	if(!pg_query($conexao,$inscod)) die ("Erro na inclusã
".pg_last_error($conexao));

    }	   

}

?>

Populate MySQL tables

ribafs (Ribamar FS) — Fri, 30 Mar 2007 15:01:41 GMT

This script in PHP to populate with demo data tables MySQL.
Remove the primary key before run.



/** Rotina para popular tabela do MySQL com massa de testes

  * Colaboração de Ribamar FS - http://ribafs.net - 14/03/2007

  * Requer remoção da chave primária antes da execução.

  */ 

?>



Inserir Registros de Teste



Cadastrar Tabela do MySQL com Massa de Testes

Remova chave primáia da tabela, antes de executar

Observe que nem todos os tipos de dados foram contemplados, alguns ficarão como string

















Host 
Banco 
Usuáio 
Senha 
Tabela 
Registros 










if(isset($_POST['popular'])){

	$host=$_POST['host'];

	$banco=$_POST['banco'];

	$usuario=$_POST['usuario'];

	$senha=$_POST['senha'];

	$tabela=$_POST['tabela'];

	$registros=$_POST['registros'];

	$numericos=$_POST['numericos'];



	$conexao=mysql_connect($host,$usuario,$senha);

	if ($conexao){

		$sel=mysql_select_db($banco,$conexao);

		if(!$sel) die('Erro ao selecionar o banco'.mysql_error());

	}else{

		die ('Erro ao conectar ao banco '.mysql_error());

	}

	$str="SELECT * FROM $tabela";

	$consulta= mysql_query($str,$conexao);

	$nc=mysql_num_fields($consulta);

	$nr=mysql_num_rows($consulta);



   $n='';//numericos (int, tinyint, smallint, bigint, etc)

   $r=''; //reais (float e double)

   $s="'";//strings

   $d=date('Y-m-d'); //datas

   $dt=date('Y-m-d H:i:s');//datatimes

   $o=''; //outros



   	$inscod .="INSERT INTO $tabela (";

   	for ($j = 0; $j < $nc; $j++) {

      $campo = mysql_field_name($consulta, $j);

		if ($j < $nc-1)	$inscod .= "$campo,";

     	else $inscod .= "$campo";

	}

	$inscod .= ")";	 

    $inscod .= " VALUES (";



   for ($j = 0; $j < $nc; $j++) {   

   $tam   = mysql_field_len($consulta, $j);

   //if(($tam)>20) $tam=20; //Caso queira limitar os campos ao máximo de 20 posições

		if ($j < $nc-1){ 

			switch (mysql_field_type($consulta, $j)){

				case 'int':

					$n=str_pad($n,$tam,'12345679890');

					$inscod .= "$n,";

					break;

     			case 'real':

					$r=str_pad($r,$tam,'1234567890');

					$inscod .= "$r,";

					break;

				case 'string':

					$s=str_pad($s,$tam,"abcdefghijklmnopqrstuvxyz");

					$inscod .= "$s',";

					break;

				case 'date':

		 		    $inscod .= "'$d',";

					break;

     			case 'datetime':

				case 'timestamp':

					$inscod .= "'$dt',";

					break;

				case 'blog':

					$inscod .= "'$t'";

					break;

				default:

					$o=str_pad($o,$tam,"abcdefghijklmnopqrstuvxyz");

					$inscod .= "'$o',";

					break;

			}

     	}else{

     		switch (mysql_field_type($consulta, $j)){

				case 'int':

					$n=str_pad($n,$tam,'1234567890');

					$inscod .= "$n";

					break;

     			case 'real':

					$r=str_pad($r,$tam,'1234567890');

					$inscod .= "$r";

					break;

     			case 'string':

					$s=str_pad($s,$tam,"abcdefghijklmnopqrstuvxyz");

					$inscod .= "$s'";

					break;

				case 'date':

					$inscod .= "'$d'";

					break;

	     		case 'datetime':

				case 'timestamp':

					$inscod .= "'$dt'";

					break;

				case 'blog':

					$inscod .= "'$t'";

					break;

				default:

					$o=str_pad($o,$tam,"abcdefghijklmnopqrstuvxyz");

					$inscod .= "'$o'";

					break;

     		}

     	}

     	

	}

    $inscod .=");";	

	

    for($r=1;$r<=$registros;$r++){	   

		//echo  $inscod;

	   	if(!mysql_query($inscod,$conexao)) die ("Erro na inclusão".mysql_error());

    }	   

}

?>

Persisting Application data using Hashtable and IsolatedStorage

sdorzak (Slawek) — Tue, 03 Oct 2006 15:49:23 GMT

// nice way to store application data and settings
// copied from: http://www.dotnetspider.com/kb/Article344.aspx



using System;

using System.Collections;

using System.IO;

using System.IO.IsolatedStorage;

using System.Runtime.Serialization;

using System.Runtime.Serialization.Formatters.Binary;



namespace CustomStorage

{

    [Serializable]

    public class ApplicationStorage : Hashtable

    {

        // File name. Let us use the entry assembly name with .dat as the extension.

        private string settingsFileName = 

                        System.Reflection.Assembly.GetEntryAssembly().GetName().Name + ".dat";

    

        // The default constructor.

        public ApplicationStorage()

        {

            LoadData();

        }

        

        // This constructor is required for deserializing our class from persistent storage.

        protected ApplicationStorage (SerializationInfo info, StreamingContext context)

            : base(info, context)

        {

        }

        

        private void LoadData()

        {

            IsolatedStorageFile isoStore = IsolatedStorageFile.GetStore( IsolatedStorageScope.User 

                        | IsolatedStorageScope.Assembly, null, null );

            if ( isoStore.GetFileNames( settingsFileName ).Length == 0 )

            {

                // File not exists. Let us NOT try to DeSerialize it.

                return;

            }

            

            // Read the stream from Isolated Storage.

            Stream stream = new IsolatedStorageFileStream( settingsFileName, 

                        FileMode.OpenOrCreate, isoStore );

            if ( stream != null )

            {

                try

                {

                    // DeSerialize the Hashtable from stream.

                    IFormatter formatter = new BinaryFormatter();

                    Hashtable appData = ( Hashtable ) formatter.Deserialize(stream);

                    

                    // Enumerate through the collection and load our base Hashtable.

                    IDictionaryEnumerator enumerator = appData.GetEnumerator();

                    while ( enumerator.MoveNext() )

                    {

                        this[enumerator.Key] = enumerator.Value;

                    }

                }

                finally

                {

                    // We are done with it.

                    stream.Close();

                }

            }

        }

        

        public void ReLoad()

        {

            LoadData();

        }

        

        // Saves the configuration data to the persistent storage.

        public void Save()

        {

            // Open the stream from the IsolatedStorage.

            IsolatedStorageFile isoStore = IsolatedStorageFile.GetStore( IsolatedStorageScope.User 

                        | IsolatedStorageScope.Assembly, null, null );

            Stream stream = new IsolatedStorageFileStream( settingsFileName, 

                        FileMode.Create, isoStore );

        

            if ( stream != null )

            {

                try

                {

                    // Serialize the Hashtable into the IsolatedStorage.

                    IFormatter formatter = new BinaryFormatter();

                    formatter.Serialize( stream, (Hashtable)this );

                }

                finally

                {

                    stream.Close();

                }

            }

        }

    }

}

//sample usage





CustomStorage.ApplicationStorage storage = new CustomStorage.ApplicationStorage();



storage["name"] = "john";

storage["age"] = 23;

storage["address"] = "#10, Vasant Nagar";



storage.Save();



string name = storage["name"].ToString();

int age = int.parse(storage["age"].ToString());

makeSafe

Shpigford (Josh) — Sat, 30 Sep 2006 07:02:31 GMT

Make data safe...among other things



function makeSafe($variable) {

	$variable = htmlentities($variable, ENT_QUOTES);

  	

	if (get_magic_quotes_gpc()) { 

		$variable = stripslashes($variable); 

	}

  	

	$variable = mysql_real_escape_string(trim($variable));

 	$variable = strip_tags($variable);

	$variable = str_replace("\r\n", "", $variable);

 	

	return $variable;

}

reverse linked list

nevadalife (nevada) — Sat, 23 Sep 2006 17:46:59 GMT

Reverse Linked list by reversing links for each node or swapping the nodes at each end.