# are all letters of X in Y?
sub inclusive {
  my ($src, $dst) = @_;
  my %p;
  # I don't know which of these is optimal...
  # so I leave it up to you
  # for my $c (split //, $src) {
  while (defined(my $c = chop $src)) {
    return if !($p{$c} = 1 + index($dst, $c, $p{$c} || 0))
  }
  return 1;
}
[download]

_____________________________________________________
Jeff[japhy]Pinyan: Perl, regex, and perl hacker.
s++=END;++y(;-P)}y js++=;shajsj<++y(p-q)}?print:??;

sub weirdmatch {
    my ($foo, $bar) = @_;
    $bar =~ s/\Q$1// or return 0   while $foo =~ s/(.)//;
    return 1;
}

print weirdmatch('the' => 'there');  # 1
print weirdmatch('foo' => 'raboof'); # 1
print weirdmatch('moo' => 'monkey'); # 0
[download]

2;0 juerd@ouranos:~$ perl -e'undef christmas'
Segmentation fault
2;139 juerd@ouranos:~$
[download]

sub match_all_letters {
  my( $match, $in ) = @_;
  my @letters = split( //, $match );

  return @letters == grep { index( $in, $_ ) != -1 } @letters;
}

__END__
  DB<2> x match_all_letters( "the" => "there" )
0  1
  DB<3> x match_all_letters( "zxd" => "there" )
0  ''
  DB<4> x match_all_letters( "theq" => "there" )
0  ''
  DB<5> x match_all_letters( "abcde" => "gcdabef" )
0  1
[download]

sub inclusive {
  my ($big, $little) = @_;
  $big =~ join(
    '',
    map { "(?=.*" . join('.*', @$_) . ")" }
    map { ++$i & 1 ? [ map quotemeta, split // ] : () }
    join('', sort split //, $little) =~ /((.)\2*)/gs;
  );
}
[download]

Update: and here's another hack:

sub inclusive {
  ($chunk, $word) = @_;  # sorry, no 'my' here
  my $r;
  $r = qr{
    (??{ "[^\Q$word\E]*" })
    ((??{ "[\Q$word\E]" }))
    (?{ substr($word, index($word,$1), 1) = "" })
    (?(?{ length $word })(??{ $r }))
    |
    (?!)
  }x;
  scalar $chunk =~ $r;
}
[download]

_____________________________________________________
Jeff[japhy]Pinyan: Perl, regex, and perl hacker.
s++=END;++y(;-P)}y js++=;shajsj<++y(p-q)}?print:??;

sub includes {
    $_=$_[1]; 
    foreach my $ltr (split //,$_[0]) {s/$ltr//i};
    if (length) {print "no match"} else {print "match"}
} 

includes("elephant", "ant");
[download]

andy.

sub includes {
  my($in, $test) = @_;
  my $ins = join '', sort split//, $in;
  my $ts = join '.*', sort split//, $test;
  return $ins =~ /$ts/ || 0
}
[download]

sub includes {
  my($in, $test) = @_;
  return (length $test == grep $test=~s/$_//, $in=~/./g) ||0;
}
[download]

#!/usr/bin/perl -wl
use strict;

for my $f( ['the','there'],
           ['abcde','gcdabef'],
           ['abe','lbbe'],
           ['forky','fork'] )
{
    print "@$f =>", fooey($f);


}

sub fooey {
my ($this,$that) = @{$_[0]};

  my $yes;
  for my $char(split'',$this)
  {
    ++$yes if $that =~ /\Q$char\E/;
  }

  return $yes == length $this? 1: 0;
}


__END__
the there =>1
abcde gcdabef =>1
abe lbbe =>0
forky fork =>0
[download]

#!/usr/bin/perl -wl
use strict;

for my $f( ['the','there'],
           ['abcde','gcdabef'],
           ['abe','lbbe'],
           ['forky','fork'] )
{
    print "@$f =>", fooey($f);


}

sub fooey {
  my ($this,$that) = @{$_[0]};

  my %yes;
  my $char = quotemeta $this;
  {
    $that =~ s/([$char])/$yes{$1}++/ge;
  }

  return ((scalar(keys %yes) == length $this? 1: 0);
}


__END__
the there =>1
abcde gcdabef =>1
abe lbbe =>0
forky fork =>0
[download]

 

______crazyinsomniac_____________________________ Of all the things I've lost, I miss my mind the most. perl -e "$q=$_;map({chr unpack qq;H*;,$_}split(q;;,q*H*));print;$q/$q;"

/\b.*$s.*\b/ equals /$s/ in boolean sense.

2;0 juerd@ouranos:~$ perl -e'undef christmas'
Segmentation fault
2;139 juerd@ouranos:~$
[download]

true enough... I made the problem something entirely different in my mind than what it actually was... mea culpa.

Allright there boo - the letters don't have to be in the same order, or next to each other - unless I've misunderstood the question, which is always a possibility. ;) andy.