code stringlengths 1 46.1k ⌀ | label class label 1.18k
classes | domain_label class label 21
classes | index stringlengths 4 5 |
|---|---|---|---|
use XML::XPath qw();
my $x = XML::XPath->new('<inventory ... </inventory>');
[$x->findnodes('//item[1]')->get_nodelist]->[0];
print $x->findnodes_as_string('//price');
$x->findnodes('//name')->get_nodelist; | 23XML/XPath | 2perl | vb20 |
def zNum( n:BigInt ) : String = {
if( n == 0 ) return "0" | 16Zeckendorf number representation | 16scala | w9es |
<?php
$doc = DOMDocument::loadXML('<inventory title=>...</inventory>');
$xpath = new DOMXPath($doc);
$nodelist = $xpath->query('
$result = $nodelist->item(0);
$nodelist = $xpath->query('
for($i = 0; $i < $nodelist->length; $i++)
{
print $doc->saveXML($nodelist->item($i)).;
}
$nodelist = $xpath->query('
$resu... | 23XML/XPath | 12php | 06sp |
y = ( 5**4**3**2 ).to_s
puts | 18Arbitrary-precision integers (included) | 14ruby | yk6n |
int[] array = new int[10]; | 13Arrays | 9java | 8g06 |
package main
import (
"fmt"
"strconv"
)
func zz(n int) []int {
r := make([]int, n*n)
i := 0
n2 := n * 2
for d := 1; d <= n2; d++ {
x := d - n
if x < 0 {
x = 0
}
y := d - 1
if y > n-1 {
y = n - 1
}
j := n2 - d
... | 27Zig-zag matrix | 0go | 2rl7 |
extern crate num;
use num::bigint::BigUint;
use num::FromPrimitive;
use num::pow::pow;
fn main() {
let big = BigUint::from_u8(5).unwrap();
let answer_as_string = format!("{}", pow(big,pow(4,pow(3,2)))); | 18Arbitrary-precision integers (included) | 15rust | mbya |
null | 13Arrays | 10javascript | fkdg |
from xml.dom import minidom
xmlfile = file()
xmldoc = minidom.parse(xmlfile).documentElement
xmldoc = minidom.parseString(OmniCorp Store
i = xmldoc.getElementsByTagName()
firstItemElement = i[0]
for j in xmldoc.getElementsByTagName():
print j.childNodes[0].data
namesArray = xmldoc.getElementsByTagName() | 23XML/XPath | 3python | upvd |
library("XML")
doc <- xmlInternalTreeParse("test3.xml")
getNodeSet(doc, "//item")[[1]]
sapply(getNodeSet(doc, "//price"), xmlValue)
sapply(getNodeSet(doc, "//name"), xmlValue) | 23XML/XPath | 13r | cj95 |
def zz = { n ->
grid = new int[n][n]
i = 0
for (d in 1..n*2) {
(x, y) = [Math.max(0, d - n), Math.min(n - 1, d - 1)]
Math.min(d, n*2 - d).times {
grid[d%2?y-it:x+it][d%2?x+it:y-it] = i++;
}
}
grid
} | 27Zig-zag matrix | 7groovy | yv6o |
scala> BigInt(5) modPow (BigInt(4) pow (BigInt(3) pow 2).toInt, BigInt(10) pow 20)
res21: scala.math.BigInt = 92256259918212890625
scala> (BigInt(5) pow (BigInt(4) pow (BigInt(3) pow 2).toInt).toInt).toString
res22: String = 6206069878660874470748320557284679309194219265199117173177383244
78446890420544620839553285931... | 18Arbitrary-precision integers (included) | 16scala | lacq |
import Data.Array (Array, array, bounds, range, (!))
import Text.Printf (printf)
import Data.List (sortBy)
compZig :: (Int, Int) -> (Int, Int) -> Ordering
compZig (x, y) (x_, y_) = compare (x + y) (x_ + y_) <> go x y
where
go x y
| even (x + y) = compare x x_
| otherwise = compare y y_
zigZag :: (In... | 27Zig-zag matrix | 8haskell | a01g |
require
include REXML
doc = Document.new(
%q@<inventory title=>
...
</inventory>
@
)
invisibility = XPath.first( doc, )
XPath.each( doc, ) { |element| puts element.text }
names = XPath.match( doc, ) | 23XML/XPath | 14ruby | 4a5p |
scala> val xml: scala.xml.Elem =
| <inventory title="OmniCorp Store #45x10^3">
| <section name="health">
| <item upc="123456789" stock="12">
| <name>Invisibility Cream</name>
| <price>14.50</price>
| <description>Makes you invisible</description>
| </item>
... | 23XML/XPath | 16scala | jq7i |
sub circle {
my ($radius, $cx, $cy, $fill, $stroke) = @_;
print "<circle cx='$cx' cy='$cy' r='$radius' ",
"fill='$fill' stroke='$stroke' stroke-width='1'/>\n";
}
sub yin_yang {
my ($rad, $cx, $cy, %opt) = @_;
my ($c, $w) = (1, 0);
$opt{fill} //= 'white';
... | 26Yin and yang | 2perl | 7arh |
fun main(x: Array<String>) {
var a = arrayOf(1, 2, 3, 4)
println(a.asList())
a += 5
println(a.asList())
println(a.reversedArray().asList())
} | 13Arrays | 11kotlin | w2ek |
use utf8;
use strict;
binmode STDOUT, ":utf8";
my (@tgt, %names);
sub setprops {
my %h = @_;
my @p = keys %h;
for my $p (@p) {
my @v = @{ $h{$p} };
@tgt = map(+{idx=>$_-1, map{ ($_, undef) } @p}, 1 .. @v)
unless @tgt;
$names{$_} = $p for @v;
}
}
my $solve = sub {
for my $i (@tgt) {
printf("%12s", ucfi... | 24Zebra puzzle | 2perl | 2hlf |
package main
import "fmt"
type Func func(int) int
type FuncFunc func(Func) Func
type RecursiveFunc func (RecursiveFunc) Func
func main() {
fac := Y(almost_fac)
fib := Y(almost_fib)
fmt.Println("fac(10) = ", fac(10))
fmt.Println("fib(10) = ", fib(10))
}
func Y(f FuncFunc) Func {
g := func(r RecursiveFunc) Func ... | 25Y combinator | 0go | o68q |
public static int[][] Zig_Zag(final int size)
{
int[][] data = new int[size][size];
int i = 1;
int j = 1;
for (int element = 0; element < size * size; element++)
{
data[i - 1][j - 1] = element;
if ((i + j) % 2 == 0)
{ | 27Zig-zag matrix | 9java | ja7c |
def Y = { le -> ({ f -> f(f) })({ f -> le { x -> f(f)(x) } }) }
def factorial = Y { fac ->
{ n -> n <= 2 ? n: n * fac(n - 1) }
}
assert 2432902008176640000 == factorial(20G)
def fib = Y { fibStar ->
{ n -> n <= 1 ? n: fibStar(n - 1) + fibStar(n - 2) }
}
assert fib(10) == 55 | 25Y combinator | 7groovy | xdwl |
function ZigZagMatrix(n) {
this.height = n;
this.width = n;
this.mtx = [];
for (var i = 0; i < n; i++)
this.mtx[i] = [];
var i=1, j=1;
for (var e = 0; e < n*n; e++) {
this.mtx[i-1][j-1] = e;
if ((i + j) % 2 == 0) { | 27Zig-zag matrix | 10javascript | 1sp7 |
newtype Mu a = Roll
{ unroll :: Mu a -> a }
fix :: (a -> a) -> a
fix = g <*> (Roll . g)
where
g = (. (>>= id) unroll)
- this version is not in tail call position...
fac :: Integer -> Integer
fac =
(fix $ \f n i -> if i <= 0 then n else f (i * n) (i - 1)) 1
fibs :: () -> [Integer]
fibs() = 0: 1:... | 25Y combinator | 8haskell | 2jll |
import math
def yinyang(n=3):
radii = [i * n for i in (1, 3, 6)]
ranges = [list(range(-r, r+1)) for r in radii]
squares = [[ (x,y) for x in rnge for y in rnge]
for rnge in ranges]
circles = [[ (x,y) for x,y in sqrpoints
if math.hypot(x,y) <= radius ]
for sqrpoints, radius in zip(squares, radii)]... | 26Yin and yang | 3python | je7p |
import java.util.function.Function;
public interface YCombinator {
interface RecursiveFunction<F> extends Function<RecursiveFunction<F>, F> { }
public static <A,B> Function<A,B> Y(Function<Function<A,B>, Function<A,B>> f) {
RecursiveFunction<Function<A,B>> r = w -> f.apply(x -> w.apply(w).apply(x));
return... | 25Y combinator | 9java | 6u3z |
from logpy import *
from logpy.core import lall
import time
def lefto(q, p, list):
return membero((q,p), zip(list, list[1:]))
def nexto(q, p, list):
return conde([lefto(q, p, list)], [lefto(p, q, list)])
houses = var()
zebraRules = lall(
(eq, (var(), var(), var(), var(), var()), houses),
(memb... | 24Zebra puzzle | 3python | vk29 |
plot.yin.yang <- function(x=5, y=5, r=3, s=10, add=F){
suppressMessages(require("plotrix"))
if(!add) plot(1:10, type="n", xlim=c(0,s), ylim=c(0,s), xlab="", ylab="", xaxt="n", yaxt="n", bty="n", asp=1)
draw.circle(x, y, r, border="white", col= "black")
draw.ellipse(x, y, r, r, col="white", angle=0, segment=c(90,270... | 26Yin and yang | 13r | 4b5y |
function Y(f) {
var g = f((function(h) {
return function() {
var g = f(h(h));
return g.apply(this, arguments);
}
})(function(h) {
return function() {
var g = f(h(h));
return g.apply(this, arguments);
}
}));
return g;
}
var ... | 25Y combinator | 10javascript | l7cf |
library(combinat)
col <- factor(c("Red","Green","White","Yellow","Blue"))
own <- factor(c("English","Swedish","Danish","German","Norwegian"))
pet <- factor(c("Dog","Birds","Cats","Horse","Zebra"))
drink <- factor(c("Coffee","Tea","Milk","Beer","Water"))
smoke <- factor(c("PallMall", "Blend", "Dunhill", "BlueMaster", "... | 24Zebra puzzle | 13r | 9rmg |
null | 27Zig-zag matrix | 11kotlin | 5hua |
local zigzag = {}
function zigzag.new(n)
local a = {}
local i | 27Zig-zag matrix | 1lua | 4k5c |
Shoes.app(:width => 470, :height => 380) do
PI = Shoes::TWO_PI/2
strokewidth 1
def yin_yang(x, y, radius)
fill black; stroke black
arc x, y, radius, radius, -PI/2, PI/2
fill white; stroke white
arc x, y, radius, radius, PI/2, -PI/2
oval x-radius/4, y-radius/2, radius/2-1
fill black; st... | 26Yin and yang | 14ruby | kxhg |
CONTENT = { House: '',
Nationality: %i[English Swedish Danish Norwegian German],
Colour: %i[Red Green White Blue Yellow],
Pet: %i[Dog Birds Cats Horse Zebra],
Drink: %i[Tea Coffee Milk Beer Water],
Smoke: %i[PallMall Dunhill Blue... | 24Zebra puzzle | 14ruby | 5puj |
use svg::node::element::Path;
fn main() {
let doc = svg::Document::new()
.add(yin_yang(15.0, 1.0).set("transform", "translate(20,20)"))
.add(yin_yang(6.0, 1.0).set("transform", "translate(50,11)"));
svg::save("yin_yang.svg", &doc).unwrap();
} | 26Yin and yang | 15rust | bqkx |
null | 25Y combinator | 11kotlin | d9nz |
object Einstein extends App {
val possibleMembers = for { | 24Zebra puzzle | 16scala | 7wr9 |
import scala.swing.Swing.pair2Dimension
import scala.swing.{ MainFrame, Panel }
import java.awt.{ Color, Graphics2D }
object YinYang extends scala.swing.SimpleSwingApplication {
var preferedSize = 500
def drawTaijitu(g: Graphics2D, size: Int) {
val sizeMinsOne = size - 1 | 26Yin and yang | 16scala | a81n |
Y = function (f)
return function(...)
return (function(x) return x(x) end)(function(x) return f(function(y) return x(x)(y) end) end)(...)
end
end | 25Y combinator | 1lua | fcdp |
l = {}
l[1] = 1 | 13Arrays | 1lua | xvwz |
sub Y { my $f = shift;
sub { my $x = shift; $x->($x) }->(
sub {my $y = shift; $f->(sub {$y->($y)(@_)})}
)
}
my $fac = sub {my $f = shift;
sub {my $n = shift; $n < 2 ? 1 : $n * $f->($n-1)}
};
my $fib = sub {my $f = shift;
sub {my $n = shift; $n == 0 ? 0 :... | 25Y combinator | 2perl | jw7f |
<?php
function Y($f) {
$g = function($w) use($f) {
return $f(function() use($w) {
return call_user_func_array($w($w), func_get_args());
});
};
return $g($g);
}
$fibonacci = Y(function($f) {
return function($i) use($f) { return ($i <= 1)? $i : ($f($i-1) + $f($i-2)); };
});
echo $fibonacci(10), ;
... | 25Y combinator | 12php | tlf1 |
use 5.010;
sub zig_zag {
my $n = shift;
my $max_number = $n**2;
my @matrix;
my $number = 0;
for my $j ( 0 .. --$n ) {
for my $i (
$j % 2
? 0 .. $j
: reverse 0 .. $j
)
{
$matrix[$i][ $j - $i ] = $number++;
... | 27Zig-zag matrix | 2perl | oz8x |
function ZigZagMatrix($num) {
$matrix = array();
for ($i = 0; $i < $num; $i++){
$matrix[$i] = array();
}
$i=1;
$j=1;
for ($e = 0; $e < $num*$num; $e++) {
$matrix[$i-1][$j-1] = $e;
if (($i + $j) % 2 == 0) {
if ($j < $num){
$j++;
}else{
$i += 2;
}
... | 27Zig-zag matrix | 12php | gb42 |
>>> Y = lambda f: (lambda x: x(x))(lambda y: f(lambda *args: y(y)(*args)))
>>> fac = lambda f: lambda n: (1 if n<2 else n*f(n-1))
>>> [ Y(fac)(i) for i in range(10) ]
[1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880]
>>> fib = lambda f: lambda n: 0 if n == 0 else (1 if n == 1 else f(n-1) + f(n-2))
>>> [ Y(fib)(i) for i i... | 25Y combinator | 3python | hxjw |
Y <- function(f) {
(function(x) { (x)(x) })( function(y) { f( (function(a) {y(y)})(a) ) } )
} | 25Y combinator | 13r | g147 |
def zigzag(n):
'''zigzag rows'''
def compare(xy):
x, y = xy
return (x + y, -y if (x + y)% 2 else y)
xs = range(n)
return {index: n for n, index in enumerate(sorted(
((x, y) for x in xs for y in xs),
key=compare
))}
def printzz(myarray):
'''show zigzag rows as li... | 27Zig-zag matrix | 3python | i3of |
y = lambda do |f|
lambda {|g| g[g]}[lambda do |g|
f[lambda {|*args| g[g][*args]}]
end]
end
fac = lambda{|f| lambda{|n| n < 2? 1: n * f[n-1]}}
p Array.new(10) {|i| y[fac][i]}
fib = lambda{|f| lambda{|n| n < 2? n: f[n-1] + f[n-2]}}
p Array.new(10) {|i| y[fib][i]} | 25Y combinator | 14ruby | bskq |
zigzag1 <- function(n) {
j <- seq(n)
u <- rep(c(-1, 1), n)
v <- j * (2 * j - 1) - 1
v <- as.vector(rbind(v, v + 1))
a <- matrix(0, n, n)
for (i in seq(n)) {
a[i, ] <- v[j + i - 1]
v <- v + u
}
a
}
zigzag1(5) | 27Zig-zag matrix | 13r | sdqy |
null | 25Y combinator | 15rust | p0bu |
def Y[A, B](f: (A => B) => (A => B)): A => B = {
case class W(wf: W => (A => B)) {
def apply(w: W): A => B = wf(w)
}
val g: W => (A => B) = w => f(w(w))(_)
g(W(g))
} | 25Y combinator | 16scala | eiab |
def zigzag(n)
(seq=*0...n).product(seq)
.sort_by {|x,y| [x+y, (x+y).even?? y: -y]}
.each_with_index.sort.map(&:last).each_slice(n).to_a
end
def print_matrix(m)
format = * m[0].size
puts m.map {|row| format % row}
end
print_matrix zigzag(5) | 27Zig-zag matrix | 14ruby | dyns |
package main
import "fmt"
func main() {
doors := [100]bool{} | 21100 doors | 0go | gx4n |
use std::cmp::Ordering;
use std::cmp::Ordering::{Equal, Greater, Less};
use std::iter::repeat;
#[derive(Debug, PartialEq, Eq)]
struct SortIndex {
x: usize,
y: usize,
}
impl SortIndex {
fn new(x: usize, y: usize) -> SortIndex {
SortIndex { x, y }
}
}
impl PartialOrd for SortIndex {
fn part... | 27Zig-zag matrix | 15rust | fmd6 |
def zigzag(n: Int): Array[Array[Int]] = {
val l = for (i <- 0 until n*n) yield (i%n, i/n)
val lSorted = l.sortWith {
case ((x,y), (u,v)) =>
if (x+y == u+v)
if ((x+y) % 2 == 0) x<u else y<v
else x+y < u+v
}
val res = Array.ofDim[Int](n, n)
lSorted.zipWithIndex fore... | 27Zig-zag matrix | 16scala | 3lzy |
doors = [false] * 100
(0..99).each {
it.step(100, it + 1) {
doors[it] ^= true
}
}
(0..99).each {
println("Door #${it + 1} is ${doors[it]? 'open': 'closed'}.")
} | 21100 doors | 7groovy | 2plv |
struct RecursiveFunc<F> {
let o: RecursiveFunc<F> -> F
}
func Y<A, B>(f: (A -> B) -> A -> B) -> A -> B {
let r = RecursiveFunc<A -> B> { w in f { w.o(w)($0) } }
return r.o(r)
}
let fac = Y { (f: Int -> Int) in
{ $0 <= 1? 1: $0 * f($0-1) }
}
let fib = Y { (f: Int -> Int) in
{ $0 <= 2? 1: f($0-1)+f($0-2) }
}
... | 25Y combinator | 17swift | kqhx |
data Door
= Open
| Closed
deriving (Eq, Show)
toggle :: Door -> Door
toggle Open = Closed
toggle Closed = Open
toggleEvery :: Int -> [Door] -> [Door]
toggleEvery k = zipWith toggleK [1 ..]
where
toggleK n door
| n `mod` k == 0 = toggle door
| otherwise = door
run :: Int -> [Door]
run n = fold... | 21100 doors | 8haskell | syqk |
my @empty;
my @empty_too = ();
my @populated = ('This', 'That', 'And', 'The', 'Other');
print $populated[2];
my $aref = ['This', 'That', 'And', 'The', 'Other'];
print $aref->[2]; | 13Arrays | 2perl | lsc5 |
$NumberArray = array(0, 1, 2, 3, 4, 5, 6);
$LetterArray = array(, , , , , );
$simpleForm = ['apple', 'orange']; | 13Arrays | 12php | qux3 |
int main(int argC,char* argV[])
{
char str[1000];
if(argC!=5)
printf(,argV[0]);
else{
sprintf(str,%s\,argV[1],argV[2],argV[3],argV[4]);
system(str);
}
return 0;
} | 28Write to Windows event log | 5c | 3cza |
(use 'clojure.java.shell)
(sh "eventcreate" "/T" "INFORMATION" "/ID" "123" "/D" "Rosetta Code example") | 28Write to Windows event log | 6clojure | c59b |
package main
import (
"fmt"
"os/exec"
)
func main() {
command := "EventCreate"
args := []string{"/T", "INFORMATION", "/ID", "123", "/L", "APPLICATION",
"/SO", "Go", "/D", "\"Rosetta Code Example\""}
cmd := exec.Command(command, args...)
err := cmd.Run()
if err != nil {
fmt.... | 28Write to Windows event log | 0go | bwkh |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Locale;
import java.util.concurrent.TimeUnit;
import java.util.stream.Collectors;
public class WriteToWindowsEventLog {
public static void main(String[] args) throws IOException... | 28Write to Windows event log | 9java | snq0 |
array = []
array.append(1)
array.append(3)
array[0] = 2
print array[0] | 13Arrays | 3python | 20lz |
null | 28Write to Windows event log | 11kotlin | as13 |
class HundredDoors {
public static void main(String[] args) {
boolean[] doors = new boolean[101];
for (int i = 1; i < doors.length; i++) {
for (int j = i; j < doors.length; j += i) {
doors[j] = !doors[j];
}
}
for (int i = 1; i < doors.length;... | 21100 doors | 9java | 1dp2 |
use strict;
use warnings;
use Win32::EventLog;
my $handle = Win32::EventLog->new("Application");
my $event = {
Computer => $ENV{COMPUTERNAME},
Source => 'Rosettacode',
EventType => EVENTLOG_INFORMATION_TYPE,
Category => 'test',
EventID => 0,
Data => 'a test for rosettacode',
Strings => 'a string... | 28Write to Windows event log | 2perl | 9umn |
var doors=[];
for (var i=0;i<100;i++)
doors[i]=false;
for (var i=1;i<=100;i++)
for (var i2=i-1,g;i2<100;i2+=i)
doors[i2]=!doors[i2];
for (var i=1;i<=100;i++)
console.log("Door%d is%s",i,doors[i-1]?"open":"closed") | 21100 doors | 10javascript | q6x8 |
arr <- array(1)
arr <- append(arr,3)
arr[1] <- 2
print(arr[1]) | 13Arrays | 13r | mwy4 |
import win32api
import win32con
import win32evtlog
import win32security
import win32evtlogutil
ph = win32api.GetCurrentProcess()
th = win32security.OpenProcessToken(ph, win32con.TOKEN_READ)
my_sid = win32security.GetTokenInformation(th, win32security.TokenUser)[0]
applicationName =
eventID = 1
category = 5
myType =... | 28Write to Windows event log | 3python | c59q |
require 'win32/eventlog'
logger = Win32::EventLog.new
logger.report_event(:event_type => Win32::EventLog::INFO, :data => ) | 28Write to Windows event log | 14ruby | 2glw |
#[cfg(windows)]
mod bindings {
::windows::include_bindings!();
}
#[cfg(windows)]
use bindings::{
Windows::Win32::Security::{
GetTokenInformation, OpenProcessToken, PSID, TOKEN_ACCESS_MASK, TOKEN_INFORMATION_CLASS,
TOKEN_USER,
},
Windows::Win32::SystemServices::{
GetCurrentProcess... | 28Write to Windows event log | 15rust | vr2t |
object RegisterWinLogEvent extends App {
import sys.process._
def eventCreate= Seq("EVENTCREATE", "/T", "SUCCESS", "/id", "123", "/l", "APPLICATION", "/so", "Scala RegisterWinLogEvent", "/d", "Rosetta Code Example" ).!!
println(eventCreate)
println(s"\nSuccessfully completed without errors. [total ${scala.... | 28Write to Windows event log | 16scala | 4h50 |
fun oneHundredDoors(): List<Int> {
val doors = BooleanArray(100, { false })
for (i in 0..99) {
for (j in i..99 step (i + 1)) {
doors[j] = !doors[j]
}
}
return doors
.mapIndexed { i, b -> i to b }
.filter { it.second }
.map { it.first + 1 }
} | 21100 doors | 11kotlin | j07r |
int main(void)
{
return 0 >= fputs(,
freopen(,,stdout));
} | 29Write entire file | 5c | rkg7 |
(spit "file.txt" "this is a string") | 29Write entire file | 6clojure | bekz |
int main(int argc, char **argv) {
float x[4] = {1,2,3,1e11}, y[4];
int i = 0;
FILE *filePtr;
filePtr = fopen(,);
for (i = 0; i < 4; i++) {
y[i] = sqrt(x[i]);
fprintf(filePtr, , x[i], y[i]);
}
return 0;
} | 30Write float arrays to a text file | 5c | 8n04 |
int main()
{
xmlDoc *doc = xmlNewDoc();
xmlNode *root = xmlNewNode(NULL, BAD_CAST );
xmlDocSetRootElement(doc, root);
xmlNode *node = xmlNewNode(NULL, BAD_CAST );
xmlAddChild(node, xmlNewText(BAD_CAST ));
xmlAddChild(root, node);
xmlSaveFile(, doc);
xmlFreeDoc(doc);
xmlCleanupParser();
} | 31XML/DOM serialization | 5c | s8q5 |
(require '[clojure.data.xml:as xml])
(def xml-example (xml/element:root {} (xml/element:element {} "Some text here")))
(with-open [out-file (java.io.OutputStreamWriter.
(java.io.FileOutputStream. "/tmp/output.xml") "UTF-8")]
(xml/emit xml-example out-file)) | 31XML/DOM serialization | 6clojure | nfik |
import "io/ioutil"
func main() {
ioutil.WriteFile("path/to/your.file", []byte("data"), 0644)
} | 29Write entire file | 0go | nzi1 |
a = ['foo']
a << 1
a.push(3,4,5)
a[0] = 2
a[0,3] = 'bar'
a[1..-1] = 'baz'
a[0] = nil
a[0,1] = nil
puts a[0] | 13Arrays | 14ruby | uovz |
new File("myFile.txt").text = """a big string
that can be
splitted over lines
""" | 29Write entire file | 7groovy | siq1 |
main :: IO ( )
main = do
putStrLn "Enter a string!"
str <- getLine
putStrLn "Where do you want to store this string?"
myFile <- getLine
appendFile myFile str | 29Write entire file | 8haskell | urv2 |
import java.io.*;
public class Test {
public static void main(String[] args) throws IOException {
try (BufferedWriter bw = new BufferedWriter(new FileWriter("test.txt"))) {
bw.write("abc");
}
}
} | 29Write entire file | 9java | m2ym |
let a = [1, 2, 3]; | 13Arrays | 15rust | 5iuq |
null | 29Write entire file | 11kotlin | tyf0 |
int compare(const void *a, const void *b) {
int int_a = *((int *)a);
int int_b = *((int *)b);
return (int_a > int_b) - (int_a < int_b);
}
char results[7];
bool next_result() {
char *ptr = results + 5;
int num = 0;
size_t i;
if (strcmp(results, ) == 0) {
return false;
}
... | 32World Cup group stage | 5c | oi80 |
package main
import (
"fmt"
dom "gitlab.com/stone.code/xmldom-go.git"
)
func main() {
d, err := dom.ParseStringXml(`
<?xml version="1.0"?>
<root>
<element>
Some text here
</element>
</root>`)
if err != nil {
fmt.Println(err)
return
}
fmt.Println(string(d.ToXml()... | 31XML/DOM serialization | 0go | v52m |
function writeFile (filename, data)
local f = io.open(filename, 'w')
f:write(data)
f:close()
end
writeFile("stringFile.txt", "Mmm... stringy.") | 29Write entire file | 1lua | zmty |
null | 13Arrays | 16scala | rfgn |
import groovy.xml.MarkupBuilder
def writer = new StringWriter() << '<?xml version="1.0"?>\n'
def xml = new MarkupBuilder(writer)
xml.root() {
element('Some text here' )
}
println writer | 31XML/DOM serialization | 7groovy | mcy5 |
import Data.List
import Text.XML.Light
xmlDOM :: String -> String
xmlDOM txt = showTopElement $ Element
(unqual "root")
[]
[ Elem $ Element
(unqual "element")
[]
[Text $ CData CDataText txt Nothing]
Nothing
]
Nothing | 31XML/DOM serialization | 8haskell | exai |
import java.io.StringWriter;
import javax.xml.parsers.DocumentBuilder;
import javax.xml.parsers.DocumentBuilderFactory;
import javax.xml.parsers.ParserConfigurationException;
import javax.xml.transform.OutputKeys;
import javax.xml.transform.Transformer;
import javax.xml.transform.TransformerConfigurationException;
imp... | 31XML/DOM serialization | 9java | hbjm |
use File::Slurper 'write_text';
write_text($filename, $data); | 29Write entire file | 2perl | kahc |
local is_open = {}
for pass = 1,100 do
for door = pass,100,pass do
is_open[door] = not is_open[door]
end
end
for i,v in next,is_open do
print ('Door '..i..':',v and 'open' or 'close')
end | 21100 doors | 1lua | h8j8 |
var doc = document.implementation.createDocument( null, 'root', null );
var root = doc.documentElement;
var element = doc.createElement( 'element' );
root.appendChild( element );
element.appendChild( document.createTextNode('Some text here') );
var xmlString = new XMLSerializer().serializeToString( doc ); | 31XML/DOM serialization | 10javascript | aw10 |
file_put_contents($filename, $data) | 29Write entire file | 12php | 39zq |
null | 31XML/DOM serialization | 11kotlin | 4r57 |
package main
import (
"fmt"
"os"
)
var (
x = []float64{1, 2, 3, 1e11}
y = []float64{1, 1.4142135623730951, 1.7320508075688772, 316227.76601683791}
xprecision = 3
yprecision = 5
)
func main() {
if len(x) != len(y) {
fmt.Println("x, y different length")
return
}
f, ... | 30Write float arrays to a text file | 0go | 5rul |
with open(filename, 'w') as f:
f.write(data) | 29Write entire file | 3python | bekr |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.