diff options
| -rw-r--r-- | challenge-029/kivanc-yazan/perl5/.gitignore | 2 | ||||
| -rw-r--r-- | challenge-029/kivanc-yazan/perl5/ch-1.pl | 93 | ||||
| -rw-r--r-- | challenge-029/kivanc-yazan/perl5/ch-2.pl | 18 |
3 files changed, 113 insertions, 0 deletions
diff --git a/challenge-029/kivanc-yazan/perl5/.gitignore b/challenge-029/kivanc-yazan/perl5/.gitignore new file mode 100644 index 0000000000..5657e34d94 --- /dev/null +++ b/challenge-029/kivanc-yazan/perl5/.gitignore @@ -0,0 +1,2 @@ +_Inline/ +*.swp diff --git a/challenge-029/kivanc-yazan/perl5/ch-1.pl b/challenge-029/kivanc-yazan/perl5/ch-1.pl new file mode 100644 index 0000000000..7c7df40d8e --- /dev/null +++ b/challenge-029/kivanc-yazan/perl5/ch-1.pl @@ -0,0 +1,93 @@ +#!/usr/bin/env perl +use warnings; +use strict; +use List::Util qw/any none/; + +# Problem: +# Write a script to demonstrate brace expansion. For example, script +# would take command line argument Perl {Daily,Weekly,Monthly,Yearly} +# Challenge and should expand it and print like below: +# Perl Daily Challenge +# Perl Weekly Challenge +# Perl Monthly Challenge +# Perl Yearly Challenge + +# Assumptions: +# - Argument is passed in quotes (so the whole thing is in $ARGV[0]) +# - Input is valid. No leaving { without a } +# - Any spaces between { , } will be considered part of input. +# - There can be blank input. That is, {x,y,} has "x", "y", and "" +# - There can be nested braces such as {X{X,Y},A{A,B}}. + +# Fun Tests: +# perl ch-1.pl "Perl {Daily,Weekly,Monthly,Yearly} Challenge" # 4 +# perl ch-1.pl "{The,A} Perl {Daily,Weekly,Monthly,Yearly} Challenge" # 8 +# perl ch-1.pl "{The ,A ,}Perl {Daily,Weekly,Monthly,Yearly} Challenge" # 12 +# perl ch-1.pl "{The ,A ,}Perl {,Daily ,Weekly ,Monthly ,Yearly }Challenge" # 15 +# perl ch-1.pl "{The ,A ,}Perl {,Daily ,Weekly ,Monthly ,Yearly }Challenge {1,2,3}" # 45 +# perl ch-1.pl "Your blood type is: {A{A,B,0},B{A,B,0},0{A,B,0}} \o/" +# perl ch-1.pl "P{erl {5,6},ython} Challenge" +# perl ch-1.pl "{0{,0{,0{,0{,0,1}}}}}" + +die "No input was passed" unless $ARGV[0]; +my @input = ($ARGV[0]); +my $i = 0; +my $input_last_index = 0; +my @output = (); + +# Handle one {,} at a time +while ($i <= $input_last_index){ + my $in = $input[$i]; + + # First, find leftmost }. Then find closest { on its left. + # eg. abc{xyz{123}...}... + # ^ ^ + my $right_paran = index($in, '}'); + my $left_paran = index($in, '{'); + my $test_left_paran = index($in, '{', $left_paran + 1); + while ($test_left_paran > -1 && $test_left_paran < $right_paran){ + $left_paran = $test_left_paran; + $test_left_paran = index($in, '{', $left_paran + 1); + } + # Keep substrings up to { and after } + my $up_to_left_paran = substr($in, 0, $left_paran); + my $after_right_paran = substr($in, $right_paran + 1); + + # Start an array to keep boundaries of words to be expanded + # This will have indices of { } and all ,s in between + my @limits = ($left_paran); + # Find all ,s in between { and } + my $comma = index($in,',',$left_paran); + while ($comma > $left_paran && $comma < $right_paran){ + push @limits, $comma; + $comma = index($in,',',$comma+1); + } + push @limits, $right_paran; + + # Process words now that we know where they are + for my $j (0..((scalar @limits) - 2)){ + # Find this one word to be expanded .. + my $offset = $limits[$j] + 1; # start from left boundary + 1 + my $length = $limits[$j+1] - $limits[$j] - 1; # and take up to right boundary + my $word = substr($in, $offset, $length); + + # Now join everything up to { + this word + everything after } + my $join = $up_to_left_paran . $word . $after_right_paran; + + # If there's still a { push the whole thing to the end of @input. + # Otherwise, push it to the @output (no duplicates) + if (index($join,'{') > -1){ + push @input, $join; + } elsif (none {$_ eq $join} @output){ + push @output, $join; + } + } + + # Update loop values + $input_last_index = scalar @input - 1; + $i++; +} + +# Sort and print! +@output = sort @output; +print join("\n",@output)."\n"; diff --git a/challenge-029/kivanc-yazan/perl5/ch-2.pl b/challenge-029/kivanc-yazan/perl5/ch-2.pl new file mode 100644 index 0000000000..ae30f5ca07 --- /dev/null +++ b/challenge-029/kivanc-yazan/perl5/ch-2.pl @@ -0,0 +1,18 @@ +#!/usr/bin/env perl +use warnings; +use strict; +use Inline C => 'DATA'; + +# Problem: +# Write a script to demonstrate calling a C function. +# It could be any user defined or standard C function. + +print "2 ** 2 = " . power(2,2) . "\n"; +print "2 ** 4 = " . power(2,4) . "\n"; +print "4 ** 4 = " . power(4,4) . "\n"; + +__DATA__ +__C__ +int power(int a, int b){ + return pow(a,b); +} |