Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

Re: chop from front and back

by space_monk (Chaplain)
on Jun 21, 2013 at 08:21 UTC ( #1040109=note: print w/ replies, xml ) Need Help??


in reply to chop from front and back

#!/usr/bin/perl # this is long just to be readable # some clever Monks will no doubt show shorter methods... # Monks get stroppy if you don't use these... :-) use strict; use warnings; # Perl developers best friend.... use Data:Dumper; # array we want to process... my @array = qw( "abc def" ); # print array to show it contains the two elements... print "Array:".Dumper( \@array)."\n"; # join your array together... my $str = join( '', @array); # remove anything you don't want in the string... # this removes all quotes, but you can change it # to just start and end $str =~ s/['"]//g; # ...or $str =~ tr/'"//; # output result.... print $str;
If you spot any bugs in my solutions, it's because I've deliberately left them in as an exercise for the reader! :-)


Comment on Re: chop from front and back
Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1040109]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (14)
As of 2014-07-28 14:28 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (200 votes), past polls