Sandbox

Página para jugar un poco con la Wiki o probar como quedaria el codigo en un articulo de verdad. Cada uno puede hacer lo que quiera.

Syntax Highlighting

<source lang="php"> <?php

   $v = "string";    // sample initialization

?> html text <?

   echo $v;         // end of php code

?> </source>

<source lang="java" line="1"> /* This is a regular multi-

* line comment. */

import java.io.*;

/**

* This is a javadoc comment
* @see java.lang.String
*/

public class Main extends Foo {

   @Test
   public static void main(final String[] args)
   {
       // This is a one-line comment
       System.out.println("Hello, World!");
       int n = 1 + 2;
       System.out.println("One plus two is: " + n);

       Foo foo = new Foo("foo");
       List<Foo> list = new ArrayList<Foo>();
       list.add(foo);
   }

} </source>

<source lang="python"> import time import threading import Network from CliqueIPC.RunnerThread import RunnerThread

1. Dispatcher

class Dispatcher(RunnerThread):

   """
   """
   def __init__(self):
       RunnerThread.__init__(self, "Dispatcher")
       self.__connection = None
       self.__connection_lock = threading.Lock()

   def Iteration(self):
       if self.__connection_lock.acquire() and self.__connection:
           Network.Protocol.RequestCommandHeader(self.__connection)
           cl = self.__connection.GetEscaped().split()
           
           print "Dispatching:", cl
           mod = __import__(cl[0])

           # server-side process file
           mod.ss_process_file(self.__connection, cl[1], cl[2], cl[3])
           
           # release module
           del mod
           
           self.__connection.Close()
           self.__connection = None
           self.__connection_lock.release()
       else:
           # wait
           self.__connection_lock.release()
           time.sleep(0.01)

   def IsConnected(self):
       self.__connection_lock.acquire()
       localst = (self.__connection != None)
       self.__connection_lock.release()
       return localst

   def ConnectTo(self, con):
       self.__connection_lock.acquire()
       self.__connection = con
       self.__connection_lock.release()
   

1. DispatcherTasksMgr

class DispatcherTasksMgr:

   """
   """
   def __init__(self, max_dispatchers):
       self.__thread_pool = []
       for i in range(max_dispatchers):
           self.__thread_pool.append(Dispatcher())

   def Start(self):
       for t in self.__thread_pool:
           t.start()

   def Stop(self):
       for t in self.__thread_pool:
           t.Stop()

   def FreeSlots(self):
       freeslots = 0

       for t in self.__thread_pool:
           if not t.IsConnected():
               freeslots += 1

       return freeslots

   # AddJob
   # precondition: FreeSlots() > 0
   def AddJob(self, con):
       for t in self.__thread_pool:
           if not t.IsConnected():
               t.ConnectTo(con)
               return

</source>

Uml plugin

<uml> Begin.b;

 State.reading("Reading commands")();
 State.processing("Processing commands")();

End.e;

State.composite("Working")(b, reading, processing, e); composite.info.left := composite.info.right := 10; composite.info.drawNameLine := 1;

topToBottom(20)(b, reading, processing, e); drawObject(composite);

clink(transition)(b, reading); clink(transition)(reading, processing); clink(transition)(processing, e);

ExitPoint.exit; exit.c=(composite.right, reading.midy); drawObject(exit); item(iAssoc)("error")(obj.nw = exit.s);

clink(transition)(reading, exit);

State.error("Preparing error report")(); State.result("Writing result")(); End.theEnd;

topToBottom(20)(error, result, theEnd); leftToRight(30)(exit, error);

drawObjects(error, result, theEnd);

clink(transition)(exit, error); clink(transition)(error, result); clink(transition)(result, theEnd);

link(transition)(rpathHorizontal(result.w, composite.right)); </uml>

Graphviz plugin

<graphviz> digraph G {Hello->World} </graphviz>

<graphviz> digraph G {

               node [shape=plaintext];
               Mollusca [URL="Mollusca"];
               Neomeniomorpha [URL="Neomeniomorpha"];
               X1 [shape=point,label=""];
               Caudofoveata [URL="Caudofoveata"];
               Testaria [URL="Testaria"];
               Polyplacophora [URL="Polyplacophora"];
               Conchifera [URL="Conchifera"];
               Tryblidiida [URL="Tryblidiida"];
               Ganglioneura [URL="Ganglioneura"];
               Bivalvia [URL="Bivalvia"];
               X2 [shape=point,label=""];
               X3 [shape=point,label=""];
               Scaphopoda [URL="Scaphopoda"];
               Cephalopoda [URL="Cephalopoda"];
               Gastropoda [URL="Gastropoda"];
               Mollusca->X1->Testaria->Conchifera->Ganglioneura->X2->Gastropoda
               Mollusca->Neomeniomorpha
               X1->Caudofoveata
               Testaria->Polyplacophora
               Conchifera->Tryblidiida
               Ganglioneura ->Bivalvia
               X2->X3->Cephalopoda
               X3->Scaphopoda

} </graphviz>

Latexin?

Sea $f:\mathbb {N} \rightarrow \mathbb {N}$ definida por

$f(n)=\left\{{\begin{array}{ll}2n&{\mbox{si }}n{\mbox{ es par}}\\{\frac {n+1}{2}}&{\mbox{si }}n{\mbox{ es impar}}\end{array}}\right.$

a) Determinar si $f$ es inyectiva, sobreyectiva o biyectiva.

b) ¿Es posible definir una función $g:\mathbb {N} \rightarrow \mathbb {N}$ tal que $f\circ g$ sea biyectiva?

c) ¿Es posible definir una función $g:\mathbb {N} \rightarrow \mathbb {N}$ tal que $g\circ f$ sea biyectiva?

Sensible and humble engineering soul

$1+1=2\equiv$

$ln\left(\lim _{x\rightarrow \infty }\left(\left(\left(\left({\bar {X}}^{T}\right)^{-1}-\left({\bar {X}}^{-1}\right)^{T}\right)!+{\frac {1}{z}}\right)^{2}\right)\right)+\sin ^{2}(p)+\cos ^{2}(p)=\sum _{n=0}^{\infty }{\frac {\cosh(q){\sqrt {1-\tanh ^{2}(q)}}}{2^{n}}}$

Símbolos matemáticos sin usar latex =

Opérateurs binaires

HTML	Unicode	Rendu	TeX	Rendu
×	×	×	\times	$\times$
÷	÷	÷	\div	$\div$
−	−	−	-	$-$
∗	∗	∗	\star	$\star$
∙	∙	∙	\bullet	$\bullet$
∧	∧	∧	\land	$\land$
∨	∨	∨	\lor	$\lor$
∩	∩	∩	\cup	$\cup$
∪	∪	∪	\cup	$\cup$
⊕	⊕	⊕	\oplus	$\oplus$
⊗	⊗	⊗	\otimes	$\otimes$
⋅	⋅	⋅	\cdot	$\cdot$

Relations binaires

HTML	Unicode	Rendu	TeX	Rendu
≡	≡	≡	\equiv	$\equiv$
≤	≤	≤	\leq	$\leq$
	⩽	⩽	\leqslant	$\leqslant$
≥	≥	≥	\geq	$\geq$
	⩾	⩾	\geqslant	$\geqslant$
∈	&#x2208	∈	\in	$\in$
∋	∋	∋	\ni	$\ni$
∝	∝	∝	\propto	$\propto$
∴	∴	∴		${\displaystyle }$
∼	∼	∼	\sim	$\sim$
≅	≅	≅	\cong	$\cong$
≈	≈	≈	\approx	$\approx$
⊂	⊂	⊂	\subset	$\subset$
⊃	⊃	⊃	\supset	$\supset$
⊆	⊆	⊆	\subseteq	$\subseteq$
⊇	⊇	⊇	\supseteq	$\supseteq$

Négations de relations binaires

HTML	Unicode	Rendu	TeX	Rendu
&ne	≠	≠	\neq	$\neq$
	≢	≢	\not\equiv	$\not \equiv$
∉	∉	∉	\not\in	$\not \in$
⊄	⊄	⊄	\not\subset	$\not \subset$
	⊅	⊅	\not\supset	$\not \supset$

Flèches

Liste complète

HTML	Unicode	Rendu	TeX	Rendu
←	←	←	\leftarrow	$\leftarrow$
			\gets	$\gets$
↑	↑	↑	\uparrow	$\uparrow$
→	→	→	\rightarrow	$\rightarrow$
			\to	$\to$
↓	↓	↓	\downarrow	$\downarrow$
↔	↔	↔	\leftrightarrow	$\leftrightarrow$
↕	↕	↕	\updownarrow	$\updownarrow$
↖	↖	↖	\nwarrow	$\nwarrow$
↗	↗	↗	\nearrow	$\nearrow$
etc.	jusqu'à	⇿
	╭	╭		${\displaystyle }$
	╮	╮		${\displaystyle }$
	╯	╯		${\displaystyle }$
	╰	╰		${\displaystyle }$
	➔	➔		${\displaystyle }$
	➘	➘		${\displaystyle }$
	➙	➙		${\displaystyle }$
	➚	➚		${\displaystyle }$
	➛	➛		${\displaystyle }$
	➜	➜		${\displaystyle }$
	➝	➝		${\displaystyle }$
	➞	➞		${\displaystyle }$
etc.	jusqu'à	➾
	⤀	⤀		${\displaystyle }$
	⤁	⤁		${\displaystyle }$
	⤂	⤂		${\displaystyle }$
	⤃	⤃		${\displaystyle }$
	⤄	⤄		${\displaystyle }$
	⤅	⤅		${\displaystyle }$
	⤆	⤆		${\displaystyle }$
	⤇	⤇		${\displaystyle }$
	⤈	⤈		${\displaystyle }$
etc.	jusqu'à	⥿

Caractères grecs

Liste complète

HTML	Unicode	Rendu	TeX	Rendu
α	α	α	\alpha	$\alpha$
Α	Α	Α	\Alpha	$\mathrm {A}$
β	β	β	\beta	$\beta$
Β	Β	Β	\Beta	$\mathrm {B}$
γ	γ	γ	\gamma	$\gamma$
Γ	Γ	Γ	\Gamma	$\Gamma$
ε	ε	ε	\epsilon	$\epsilon$
	ϵ	ϵ	\varepsilon	$\varepsilon$
&tetha;	θ	θ	\theta	$\theta$
ϑ	ϑ	ϑ	\vartheta	$\vartheta$
κ	κ	κ	\kappa	$\kappa$
	ϰ	ϰ	\varkappa	$\varkappa$
π	π	π	\pi	$\pi$
ϖ	ϖ	ϖ	\varpi	$\varpi$
ρ	ρ	ρ	\rho	$\rho$
			\varrho	$\varrho$
σ	σ	σ	\sigma	$\sigma$
ς	ς	ς	\varsigma	$\varsigma$
φ	φ	φ	\phi	$\phi$
	ϕ	ϕ	\varphi	$\varphi$
	ϝ	Ϟ
	Ϝ	Ϝ	\digamma	$\digamma$
			\mho	$\mho$
etc.	jusqu'à	϶

Quiero ver si logueado me pide captcha o no.