tasks a-s

Task/Pangram-checker/0DESCRIPTION

@@ -0,0 +1,3 @@
+Write a function or method to check a sentence to see if it is a [[wp:Pangram|pangram]] or not and show its use.
+
+A pangram is a sentence that contains all the letters of the English alphabet at least once, for example: ''The quick brown fox jumps over the lazy dog''.

Task/Pangram-checker/ACL2/pangram-checker.acl2

@@ -0,0 +1,9 @@
+(defun contains-each (needles haystack)
+   (if (endp needles)
+       t
+       (and (member (first needles) haystack)
+            (contains-each (rest needles) haystack))))
+
+(defun pangramp (str)
+   (contains-each (coerce "abcdefghijklmnopqrstuvwxyz" 'list)
+                  (coerce (string-downcase str) 'list)))

Task/Pangram-checker/ALGOL-68/pangram-checker.alg

@@ -0,0 +1,36 @@
+# init pangram: #
+INT la = ABS "a", lz = ABS "z";
+INT ua = ABS "A", uz = ABS "Z";
+IF lz-la+1 > bits width THEN
+  put(stand error, "Exception: insufficient bits in word for task");
+  stop
+FI;
+
+PROC is a pangram = (STRING test)BOOL: (
+  BITS a2z := BIN(ABS(2r1 SHL (lz-la))-1); # assume: ASCII & Binary #
+  FOR i TO UPB test WHILE
+    INT c = ABS test[i];
+    IF la <= c AND c <= lz THEN
+      a2z := a2z AND NOT(2r1 SHL (c-la))
+    ELIF ua <= c AND c <= uz THEN
+      a2z := a2z AND NOT(2r1 SHL (c-ua))
+    FI;
+# WHILE # a2z /= 2r0 DO
+    SKIP
+  OD;
+  a2z = 2r0
+);
+
+main:(
+  []STRING test list = (
+    "Big fjiords vex quick waltz nymph",
+    "The quick brown fox jumps over a lazy dog",
+    "A quick brown fox jumps over a lazy dog"
+  );
+  FOR key TO UPB test list DO
+    STRING test = test list[key];
+    IF is a pangram(test) THEN
+      print(("""",test,""" is a pangram!", new line))
+    FI
+  OD
+)

Task/Pangram-checker/APL/pangram-checker.apl

@@ -0,0 +1,8 @@
+    a←'abcdefghijklmnopqrstuvwxyz'
+    A←'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+
+    Panagram←{∧/ ∨⌿ 2 26⍴(a,A) ∊ ⍵}
+    Panagram 'This should fail'
+0
+    Panagram 'The quick brown fox jumps over the lazy dog'
+1

Task/Pangram-checker/AWK/pangram-checker.awk

@@ -0,0 +1,17 @@
+#!/usr/bin/awk -f
+BEGIN {
+   convert="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
+   print isPangram("The quick brown fox jumps over the lazy dog.");
+   print isPangram("The quick brown fo.");
+}
+
+function isPangram(string) {
+    delete X;
+    for (k=1; k<length(string); k++) {
+        X[toupper(substr(string,k,1))]++;  # histogram
+    }
+    for (k=1; k<=length(convert); k++) {
+        if (!X[substr(convert,k,1)]) return 0;
+    }	
+    return 1;
+}

Task/Pangram-checker/ActionScript/pangram-checker.as

@@ -0,0 +1,16 @@
+function pangram(k:string):Boolean {
+  var lowerK:String = k.toLowerCase();
+  var has:Object = {}
+
+  for (var i:Number=0; i<=k.length-1; i++) {
+    has[lowerK.charAt(i)] = true;
+  }
+
+  var result:Boolean = true;
+
+  for (var ch:String='a'; ch <= 'z'; ch=String.fromCharCode(ch.charCodeAt(0)+1)) {
+      result = result && has[ch]
+  }
+
+  return result || false;
+}

Task/Pangram-checker/Ada/pangram-checker.ada

@@ -0,0 +1,20 @@
+with Ada.Text_IO; use Ada.Text_IO;
+with Ada.Strings.Maps; use Ada.Strings.Maps;
+with Ada.Characters.Handling; use Ada.Characters.Handling;
+procedure pangram is
+
+	function ispangram(txt: String) return Boolean is
+		lowtxt : String := To_Lower(txt);
+		letset,txtset : Character_Set;
+		begin
+		letset := To_Set("abcdefghijklmnopqrstuvwxyz");
+		txtset := To_Set(lowtxt);
+		return (letset-txtset)=Null_Set;
+	end ispangram;
+
+begin
+put_line(Boolean'Image(ispangram("This is a test")));
+put_line(Boolean'Image(ispangram("The quick brown fox jumps over the lazy dog")));
+put_line(Boolean'Image(ispangram("NOPQRSTUVWXYZ  abcdefghijklm")));
+put_line(Boolean'Image(ispangram("abcdefghijklopqrstuvwxyz"))); --Missing m, n
+end pangram;

Task/Pangram-checker/AutoHotkey/pangram-checker.ahk

@@ -0,0 +1,19 @@
+Gui, -MinimizeBox
+Gui, Add, Edit, w300 r5 vText
+Gui, Add, Button, x105 w100 Default, Check Pangram
+Gui, Show,, Pangram Checker
+Return
+
+GuiClose:
+    ExitApp
+Return
+
+ButtonCheckPangram:
+    Gui, Submit, NoHide
+    Loop, 26
+        If Not InStr(Text, Char := Chr(64 + A_Index)) {
+            MsgBox,, Pangram, Character %Char% is missing!
+            Return
+        }
+    MsgBox,, Pangram, OK`, this is a Pangram!
+Return

Task/Pangram-checker/AutoIt/pangram-checker.autoit

@@ -0,0 +1,9 @@
+Pangram("The quick brown fox jumps over the lazy dog")
+Func Pangram($s_String)
+For $i = 1 To 26
+	IF Not StringInStr($s_String, Chr(64 + $i)) Then
+		Return MsgBox(0,"No Pangram", "Character " & Chr(64 + $i) &" is missing")
+	EndIf
+Next
+Return MsgBox(0,"Pangram", "Sentence is a Pangram")
+EndFunc

Task/Pangram-checker/BASIC/pangram-checker.basic

@@ -0,0 +1,42 @@
+DECLARE FUNCTION IsPangram! (sentence AS STRING)
+
+DIM x AS STRING
+
+x = "My dog has fleas."
+GOSUB doIt
+x = "The lazy dog jumps over the quick brown fox."
+GOSUB doIt
+x = "Jackdaws love my big sphinx of quartz."
+GOSUB doIt
+x = "What's a jackdaw?"
+GOSUB doIt
+
+END
+
+doIt:
+    PRINT IsPangram!(x), x
+    RETURN
+
+FUNCTION IsPangram! (sentence AS STRING)
+    'returns -1 (true) if sentence is a pangram, 0 (false) otherwise
+    DIM l AS INTEGER, s AS STRING, t AS INTEGER
+    DIM letters(25) AS INTEGER
+
+    FOR l = 1 TO LEN(sentence)
+        s = UCASE$(MID$(sentence, l, 1))
+        SELECT CASE s
+            CASE "A" TO "Z"
+                t = ASC(s) - 65
+                letters(t) = 1
+        END SELECT
+    NEXT
+
+    FOR l = 0 TO 25
+        IF letters(l) < 1 THEN
+            IsPangram! = 0
+            EXIT FUNCTION
+        END IF
+    NEXT
+
+    IsPangram! = -1
+END FUNCTION

Task/Pangram-checker/BBC-BASIC/pangram-checker.bbc

@@ -0,0 +1,29 @@
+      FOR test% = 1 TO 2
+        READ test$
+        PRINT """" test$ """ " ;
+        IF FNpangram(test$) THEN
+          PRINT "is a pangram"
+        ELSE
+          PRINT "is not a pangram"
+        ENDIF
+      NEXT test%
+      END
+
+      DATA "The quick brown fox jumped over the lazy dog"
+      DATA "The five boxing wizards jump quickly"
+
+      DEF FNpangram(A$)
+      LOCAL C%
+      A$ = FNlower(A$)
+      FOR C% = ASC("a") TO ASC("z")
+        IF INSTR(A$, CHR$(C%)) = 0 THEN = FALSE
+      NEXT
+      = TRUE
+
+      DEF FNlower(A$)
+      LOCAL A%, C%
+      FOR A% = 1 TO LEN(A$)
+        C% = ASCMID$(A$,A%)
+        IF C% >= 65 IF C% <= 90 MID$(A$,A%,1) = CHR$(C%+32)
+      NEXT
+      = A$

Task/Pangram-checker/Bracmat/pangram-checker.bracmat

@@ -0,0 +1,11 @@
+(isPangram=
+  k
+.   low$!arg:?arg
+  & a:?k
+  &   whl
+    ' ( @(!arg:? !k ?)
+      & chr$(1+asc$!k):?k:~>z
+      )
+  & !k:>z
+  &
+);

Task/Pangram-checker/Brat/pangram-checker-1.brat

@@ -0,0 +1,15 @@
+pangram? = { sentence |
+  letters = [:a :b :c :d :e :f :g :h :i :j :k :l :m
+    :n :o :p :q :r :s :t :u :v :w :x :y :z]
+
+    sentence.downcase!
+
+    letters.reject! { l |
+      sentence.include? l
+    }
+
+  letters.empty?
+}
+
+p pangram? 'The quick brown fox jumps over the lazy dog.' #Prints true
+p pangram? 'Probably not a pangram.'  #Prints false

Task/Pangram-checker/Brat/pangram-checker-2.brat

@@ -0,0 +1,3 @@
+pangram? = { sentence |
+  sentence.downcase.dice.unique.select(:alpha?).length == 26
+}

Task/Pangram-checker/C++/pangram-checker.cpp

@@ -0,0 +1,16 @@
+#include <algorithm>
+#include <cctype>
+#include <string>
+using namespace std;
+
+const string alphabet("abcdefghijklmnopqrstuvwxyz"); // sorted, no duplicates
+
+bool is_pangram(string s) {
+  // Convert to lower case.
+  transform(s.begin(), s.end(), s.begin(), ::tolower);
+  // Convert to a sorted sequence of (not necessarily unique) characters.
+  sort(s.begin(), s.end());
+  // Is the second sequence a subset of the first sequence?
+  // Repeated letters in "s" are okay, since it still "includes" the single letter
+  return includes(s.begin(), s.end(), alphabet.begin(), alphabet.end());
+}

Task/Pangram-checker/C/pangram-checker-1.c

@@ -0,0 +1,36 @@
+#include <stdio.h>
+
+int isPangram(const char *string)
+{
+	char ch, wasused[26] = {0};
+	int total = 0;
+
+	while ((ch = *string++)) {
+		int index;
+
+		if('A'<=ch&&ch<='Z')
+			index = ch-'A';
+		else if('a'<=ch&&ch<='z')
+			index = ch-'a';
+		else
+			continue;
+
+		total += !wasused[index];
+		wasused[index] = 1;
+	}
+	return (total==26);
+}
+
+int main()
+{
+	int i;
+	const char *tests[] = {
+		"The quick brown fox jumps over the lazy dog.",
+		"The qu1ck brown fox jumps over the lazy d0g."
+	};
+
+	for (i = 0; i < 2; i++)
+		printf("\"%s\" is %sa pangram\n",
+			tests[i], isPangram(tests[i])?"":"not ");
+	return 0;
+}

Task/Pangram-checker/C/pangram-checker-2.c

@@ -0,0 +1,23 @@
+#include <stdio.h>
+
+int pangram(const char *s)
+{
+	int c, mask = (1 << 26) - 1;
+	while ((c = (*s++)) != '\0') /* 0x20 converts lowercase to upper */
+		if ((c &= ~0x20) <= 'Z' && c >= 'A')
+			mask &= ~(1 << (c - 'A'));
+
+	return !mask;
+}
+
+int main()
+{
+	int i;
+	const char *s[] = {	"The quick brown fox jumps over lazy dogs.",
+				"The five boxing wizards dump quickly.",  };
+
+	for (i = 0; i < 2; i++)
+		printf("%s: %s\n", pangram(s[i]) ? "yes" : "no ", s[i]);
+
+	return 0;
+}

Task/Pangram-checker/Clojure/pangram-checker.clj

@@ -0,0 +1,3 @@
+(defn pangram? [s]
+  (let [letters (into #{} "abcdefghijklmnopqrstuvwxyz")]
+    (= (->> s .toLowerCase (filter letters) (into #{})) letters)))

Task/Pangram-checker/CoffeeScript/pangram-checker.coffeescript

@@ -0,0 +1,34 @@
+is_pangram = (s) ->
+  # This is optimized for longish strings--as soon as all 26 letters
+  # are encountered, we will be done.  Our worst case scenario is a really
+  # long non-pangram, or a really long pangram with at least one letter
+  # only appearing toward the end of the string.
+  a_code = 'a'.charCodeAt(0)
+  required_letters = {}
+  for i in [a_code...a_code+26]
+    required_letters[String.fromCharCode(i)] = true
+
+  cnt = 0
+  for c in s
+    c = c.toLowerCase()
+    if required_letters[c]
+      cnt += 1
+      return true if cnt == 26
+      delete required_letters[c]
+  false
+
+do ->
+  tests = [
+    ["is this a pangram", false]
+    ["The quick brown fox jumps over the lazy dog", true]
+  ]
+
+  for test in tests
+    [s, exp_value] = test
+    throw Error("fail") if is_pangram(s) != exp_value
+    # try long strings
+    long_str = ''
+    for i in [1..500000]
+      long_str += s
+    throw Error("fail") if is_pangram(long_str) != exp_value
+    console.log "Passed tests: #{s}"

Task/Pangram-checker/Common-Lisp/pangram-checker.lisp

@@ -0,0 +1,4 @@
+(defun pangramp (s)
+  (null (set-difference
+          (loop for c from (char-code #\A) upto (char-code #\Z) collect (code-char c))
+          (coerce (string-upcase s) 'list))))

Task/Pangram-checker/D/pangram-checker-1.d

@@ -0,0 +1,19 @@
+bool isPangram(in string text) pure nothrow {
+    uint bitset;
+
+    foreach (c; text) {
+        if (c >= 'a' && c <= 'z')
+            bitset |= (1u << (c - 'a'));
+        else if (c >= 'A' && c <= 'Z')
+            bitset |= (1u << (c - 'A'));
+    }
+
+    return bitset == 0b11_11111111_11111111_11111111;
+}
+
+void main() {
+    assert(isPangram("the quick brown fox jumps over the lazy dog"));
+    assert(!isPangram("ABCDEFGHIJKLMNOPQSTUVWXYZ"));
+    assert(!isPangram("ABCDEFGHIJKL.NOPQRSTUVWXYZ"));
+    assert(isPangram("ABC.D.E.FGHI*J/KL-M+NO*PQ R\nSTUVWXYZ"));
+}

Task/Pangram-checker/D/pangram-checker-2.d

@@ -0,0 +1,22 @@
+import std.string, std.traits, std.uni;
+
+// Do not compile with -g (debug info).
+enum Alphabet : dstring {
+    DE = "abcdefghijklmnopqrstuvwxyzßäöü",
+    EN = "abcdefghijklmnopqrstuvwxyz",
+    SV = "abcdefghijklmnopqrstuvwxyzåäö"
+}
+
+bool isPangram(S)(in S s, dstring alpha = Alphabet.EN)
+pure /*nothrow*/ if (isSomeString!S) {
+    foreach (dchar c; alpha)
+       if (indexOf(s, c) == -1 && indexOf(s, std.uni.toUpper(c)) == -1)
+            return false;
+    return true;
+}
+
+void main() {
+    assert(isPangram("the quick brown fox jumps over the lazy dog".dup, Alphabet.EN));
+    assert(isPangram("Falsches Üben von Xylophonmusik quält jeden größeren Zwerg"d, Alphabet.DE));
+    assert(isPangram("Yxskaftbud, ge vår wczonmö iqhjälp"w, Alphabet.SV));
+}

Task/Pangram-checker/Delphi/pangram-checker.delphi

@@ -0,0 +1,21 @@
+program PangramChecker;
+
+{$APPTYPE CONSOLE}
+
+uses StrUtils;
+
+function IsPangram(const aString: string): Boolean;
+var
+  c: char;
+begin
+  for c := 'a' to 'z' do
+    if not ContainsText(aString, c) then
+      Exit(False);
+
+  Result := True;
+end;
+
+begin
+  Writeln(IsPangram('The quick brown fox jumps over the lazy dog')); // true
+  Writeln(IsPangram('Not a panagram')); // false
+end.

Task/Pangram-checker/E/pangram-checker.e

@@ -0,0 +1,3 @@
+def isPangram(sentence :String) {
+    return ("abcdefghijklmnopqrstuvwxyz".asSet() &! sentence.toLowerCase().asSet()).size() == 0
+}

Task/Pangram-checker/Erlang/pangram-checker.erl

@@ -0,0 +1,5 @@
+-module(pangram).
+-export([is_pangram/1]).
+
+is_pangram(String) ->
+  ordsets:is_subset(lists:seq($a, $z), ordsets:from_list(string:to_lower(String))).

Task/Pangram-checker/Factor/pangram-checker.factor

@@ -0,0 +1,4 @@
+: pangram? ( str -- ? )
+    [ "abcdefghijklmnopqrstuvwxyz" ] dip >lower diff length 0 = ;
+
+"How razorback-jumping frogs can level six piqued gymnasts!" pangram? .

Task/Pangram-checker/Forth/pangram-checker.fth

@@ -0,0 +1,10 @@
+: pangram? ( addr len -- ? )
+  0 -rot bounds do
+    i c@ 32 or [char] a -
+    dup 0 26 within if
+      1 swap lshift or
+    else drop then
+  loop
+  1 26 lshift 1- = ;
+
+s" The five boxing wizards jump quickly." pangram? .   \ -1

Task/Pangram-checker/Fortran/pangram-checker-1.f

@@ -0,0 +1,48 @@
+module pangram
+
+  implicit none
+  private
+  public :: is_pangram
+  character (*), parameter :: lower_case = 'abcdefghijklmnopqrstuvwxyz'
+  character (*), parameter :: upper_case = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+
+contains
+
+  function to_lower_case (input) result (output)
+
+    implicit none
+    character (*), intent (in) :: input
+    character (len (input)) :: output
+    integer :: i
+    integer :: j
+
+    output = input
+    do i = 1, len (output)
+      j = index (upper_case, output (i : i))
+      if (j /= 0) then
+        output (i : i) = lower_case (j : j)
+      end if
+    end do
+
+  end function to_lower_case
+
+  function is_pangram (input) result (output)
+
+    implicit none
+    character (*), intent (in) :: input
+    character (len (input)) :: lower_case_input
+    logical :: output
+    integer :: i
+
+    lower_case_input = to_lower_case (input)
+    output = .true.
+    do i = 1, len (lower_case)
+      if (index (lower_case_input, lower_case (i : i)) == 0) then
+        output = .false.
+        exit
+      end if
+    end do
+
+  end function is_pangram
+
+end module pangram

Task/Pangram-checker/Fortran/pangram-checker-2.f

@@ -0,0 +1,15 @@
+program test
+
+  use pangram, only: is_pangram
+
+  implicit none
+  character (256) :: string
+
+  string = 'This is a sentence.'
+  write (*, '(a)') trim (string)
+  write (*, '(l1)') is_pangram (string)
+  string = 'The five boxing wizards jumped quickly.'
+  write (*, '(a)') trim (string)
+  write (*, '(l1)') is_pangram (string)
+
+end program test

Task/Pangram-checker/Go/pangram-checker.go

@@ -0,0 +1,43 @@
+package main
+
+import "fmt"
+
+func main() {
+    for _, s := range []string{
+        "The quick brown fox jumps over the lazy dog.",
+        `Watch "Jeopardy!", Alex Trebek's fun TV quiz game.`,
+        "Not a pangram.",
+    } {
+        if pangram(s) {
+            fmt.Println("Yes:", s)
+        } else {
+            fmt.Println("No: ", s)
+        }
+    }
+}
+
+func pangram(s string) bool {
+    var rep [26]bool
+    var count int
+    for _, c := range s {
+        if c >= 'a' {
+            if c > 'z' {
+                continue
+            }
+            c -= 'a'
+        } else {
+            if c < 'A' || c > 'Z' {
+                continue
+            }
+            c -= 'A'
+        }
+        if !rep[c] {
+            if count == 25 {
+                return true
+            }
+            rep[c] = true
+            count++
+        }
+    }
+    return false
+}

Task/Pangram-checker/Haskell/pangram-checker.hs

@@ -0,0 +1,7 @@
+import Data.Char (toLower)
+import Data.List ((\\))
+
+pangram :: String -> Bool
+pangram = null . (['a' .. 'z'] \\) . map toLower
+
+main = print $ pangram "How razorback-jumping frogs can level six piqued gymnasts!"

Task/Pangram-checker/HicEst/pangram-checker.hicest

@@ -0,0 +1,8 @@
+PangramBrokenAt("This is a Pangram.") ! => 2 (b is missing)
+PangramBrokenAt("The quick Brown Fox jumps over the Lazy Dog") ! => 0 (OK)
+
+FUNCTION PangramBrokenAt(string)
+   CHARACTER string, Alfabet="abcdefghijklmnopqrstuvwxyz"
+   PangramBrokenAt = INDEX(Alfabet, string, 64)
+   ! option 64: verify = 1st letter of string not in Alfabet
+END

Task/Pangram-checker/Icon/pangram-checker-1.icon

@@ -0,0 +1,3 @@
+procedure panagram(s)     #: return s if s is a panagram and fail otherwise
+if (map(s) ** &lcase) === &lcase then return s
+end

Task/Pangram-checker/Icon/pangram-checker-2.icon

@@ -0,0 +1,11 @@
+procedure main(arglist)
+
+if *arglist > 0 then
+   every ( s := "" ) ||:= !arglist || " "
+else
+   s := "The quick brown fox jumps over the lazy dog."
+
+writes(image(s), " -- is")
+writes(if not panagram(s) then "n't")
+write(" a panagram.")
+end

Task/Pangram-checker/Ioke/pangram-checker-1.ioke

@@ -0,0 +1,5 @@
+Text isPangram? = method(
+  letters = "abcdefghijklmnopqrstuvwxyz" chars
+  text = self lower chars
+  letters map(x, text include?(x)) reduce(&&)
+)

Task/Pangram-checker/Ioke/pangram-checker-2.ioke

@@ -0,0 +1,7 @@
+iik> "The quick brown fox jumps over the lazy dog" isPangram?
+"The quick brown fox jumps over the lazy dog" isPangram?
++> true
+
+iik> "The quick brown fox jumps over the" isPangram?
+"The quick brown fox jumps over the" isPangram?
++> false

Task/Pangram-checker/J/pangram-checker-1.j

@@ -0,0 +1,2 @@
+require 'strings'
+isPangram=: (a. {~ 97+i.26) */@e. tolower

Task/Pangram-checker/J/pangram-checker-2.j

@@ -0,0 +1,4 @@
+   isPangram 'The quick brown fox jumps over the lazy dog.'
+1
+   isPangram 'The quick brown fox falls over the lazy dog.'
+0

Task/Pangram-checker/Java/pangram-checker.java

@@ -0,0 +1,18 @@
+public class Pangram {
+    public static boolean isPangram(String test){
+        for (char a = 'A'; a <= 'Z'; a++)
+            if ((test.indexOf(a) < 0) && (test.indexOf((char)(a + 32)) < 0))
+                return false;
+        return true;
+    }
+
+    public static void main(String[] args){
+        System.out.println(isPangram("the quick brown fox jumps over the lazy dog"));//true
+        System.out.println(isPangram("the quick brown fox jumped over the lazy dog"));//false, no s
+        System.out.println(isPangram("ABCDEFGHIJKLMNOPQRSTUVWXYZ"));//true
+        System.out.println(isPangram("ABCDEFGHIJKLMNOPQSTUVWXYZ"));//false, no r
+        System.out.println(isPangram("ABCDEFGHIJKL.NOPQRSTUVWXYZ"));//false, no m
+        System.out.println(isPangram("ABC.D.E.FGHI*J/KL-M+NO*PQ R\nSTUVWXYZ"));//true
+        System.out.println(isPangram(""));//false
+    }
+}

Task/Pangram-checker/JavaScript/pangram-checker.js

@@ -0,0 +1,12 @@
+function is_pangram(str) {
+    var s = str.toLowerCase();
+    // sorted by frequency ascending (http://en.wikipedia.org/wiki/Letter_frequency)
+    var letters = "zqxjkvbpygfwmucldrhsnioate";
+    for (var i = 0; i < 26; i++)
+        if (s.indexOf(letters.charAt(i)) == -1)
+            return false;
+    return true;
+}
+
+print(is_pangram("is this a pangram"));  // false
+print(is_pangram("The quick brown fox jumps over the lazy dog"));  // true

Task/Pangram-checker/K/pangram-checker-1.k

@@ -0,0 +1,4 @@
+lcase   : _ci 97+!26
+ucase   : _ci 65+!26
+tolower : {@[x;p;:;lcase@n@p:&26>n:ucase?/:x]}
+panagram: {&/lcase _lin tolower x}

Task/Pangram-checker/K/pangram-checker-2.k

@@ -0,0 +1,4 @@
+  panagram "The quick brown fox jumps over the lazy dog"
+1
+  panagram "Panagram test"
+0

Task/Pangram-checker/Liberty-BASIC/pangram-checker.liberty

@@ -0,0 +1,12 @@
+'Returns 0 if the string is NOT a pangram or >0 if it IS a pangram
+string$ = "The quick brown fox jumps over the lazy dog."
+
+Print isPangram(string$)
+
+Function isPangram(string$)
+    string$ = Lower$(string$)
+    For i = Asc("a") To Asc("z")
+        isPangram = Instr(string$, chr$(i))
+        If isPangram = 0 Then Exit Function
+    Next i
+End Function

Task/Pangram-checker/Logo/pangram-checker.logo

@@ -0,0 +1,10 @@
+to remove.all :s :set
+  if empty? :s [output :set]
+  if word? :s [output remove.all butfirst :s remove first :s :set]
+  output remove.all butfirst :s remove.all first :s :set
+end
+to pangram? :s
+  output empty? remove.all :s "abcdefghijklmnopqrstuvwxyz
+end
+
+show pangram? [The five boxing wizards jump quickly.]   ; true

Task/Pangram-checker/Lua/pangram-checker.lua

@@ -0,0 +1,9 @@
+require"lpeg"
+S, C = lpeg.S, lpeg.C
+function ispangram(s)
+  return #(C(S(s)^0):match"abcdefghijklmnopqrstuvwxyz") == 26
+end
+
+print(ispangram"waltz, bad nymph, for quick jigs vex")
+print(ispangram"bobby")
+print(ispangram"long sentence")

Task/Pangram-checker/MATLAB/pangram-checker-1.m

@@ -0,0 +1,12 @@
+function trueFalse = isPangram(string)
+
+    %This works by histogramming the ascii character codes for lower case
+    %letters contained in the string (which is first converted to all
+    %lower case letters). Then it finds the index of the first letter that
+    %is not contained in the string (this is faster than using the find
+    %without the second parameter). If the find returns an empty array then
+    %the original string is a pangram, if not then it isn't.
+
+    trueFalse = isempty(find( histc(lower(string),(97:122))==0,1 ));
+
+end

Task/Pangram-checker/MATLAB/pangram-checker-2.m

@@ -0,0 +1,5 @@
+isPangram('The quick brown fox jumps over the lazy dog.')
+
+ans =
+
+     1

Task/Pangram-checker/MATLAB/pangram-checker.m

@@ -0,0 +1,5 @@
+function trueFalse = isPangram(string)
+    % X is a histogram of letters
+    X = sparse(abs(lower(string)),1,1,128,1);
+    trueFalse = full(all(X('a':'z') > 0));
+end

Task/Pangram-checker/Mathematica/pangram-checker.math

@@ -0,0 +1 @@
+pangramQ[msg_]:=Complement[CharacterRange["a", "z"], Characters[ToLowerCase[msg]]]=== {}

Task/Pangram-checker/NetRexx/pangram-checker.netrexx

@@ -0,0 +1,29 @@
+/* NetRexx */
+options replace format comments java crossref savelog symbols nobinary
+
+A2Z = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+
+pangrams = create_samples
+
+loop p_ = 1 to pangrams[0]
+  pangram = pangrams[p_]
+  q_ = A2Z.verify(pangram.upper) -- <= it basically all happens in this function call!
+  say pangram.left(64)'\-'
+  if q_ == 0 then -
+    say ' [OK, a pangram]'
+  else -
+    say ' [Not a pangram.  Missing:' A2Z.substr(q_, 1)']'
+  end p_
+
+method create_samples public static returns Rexx
+
+  pangrams = ''
+
+  x_ = 0
+  x_ = x_ + 1; pangrams[0] = x_; pangrams[x_] = 'The quick brown fox jumps over a lazy dog.'    -- best/shortest pangram
+  x_ = x_ + 1; pangrams[0] = x_; pangrams[x_] = 'The quick brown fox jumps over the lazy dog.'  -- not as short but at least it's still a pangram
+  x_ = x_ + 1; pangrams[0] = x_; pangrams[x_] = 'The quick brown fox jumped over the lazy dog.' -- common misquote; not a pangram
+  x_ = x_ + 1; pangrams[0] = x_; pangrams[x_] = 'The quick onyx goblin jumps over the lazy dwarf.'
+  x_ = x_ + 1; pangrams[0] = x_; pangrams[x_] = 'Bored? Craving a pub quiz fix? Why, just come to the Royal Oak!' -- (Used to advertise a pub quiz in Bowness-on-Windermere)
+
+  return pangrams

Task/Pangram-checker/OCaml/pangram-checker-1.ocaml

@@ -0,0 +1,7 @@
+let pangram str =
+  let ar = Array.make 26 false in
+  String.iter (function
+  | 'a'..'z' as c -> ar.(Char.code c - Char.code 'a') <- true
+  | _ -> ()
+  ) (String.lowercase str);
+  Array.fold_left ( && ) true ar

Task/Pangram-checker/OCaml/pangram-checker-2.ocaml

@@ -0,0 +1,7 @@
+let check str =
+  Printf.printf " %b -- %s\n" (pangram str) str
+
+let () =
+  check "this is a sentence";
+  check "The quick brown fox jumps over the lazy dog.";
+;;

Task/Pangram-checker/Objeck/pangram-checker.objeck

@@ -0,0 +1,23 @@
+bundle Default {
+  class Pangram {
+    function : native : IsPangram(test : String) ~ Bool {
+      for(a := 'A'; a <= 'Z'; a += 1;) {
+        if(test->Find(a) < 0 & test->Find(a->ToLower()) < 0) {
+          return false;
+        };
+      };
+
+      return true;
+    }
+
+    function : Main(args : String[]) ~ Nil {
+      IsPangram("the quick brown fox jumps over the lazy dog")->PrintLine(); # true
+      IsPangram("the quick brown fox jumped over the lazy dog")->PrintLine(); # false, no s
+      IsPangram("ABCDEFGHIJKLMNOPQRSTUVWXYZ")->PrintLine(); # true
+      IsPangram("ABCDEFGHIJKLMNOPQSTUVWXYZ")->PrintLine(); # false, no r
+      IsPangram("ABCDEFGHIJKL.NOPQRSTUVWXYZ")->PrintLine(); # false, no m
+      IsPangram("ABC.D.E.FGHI*J/KL-M+NO*PQ R\nSTUVWXYZ")->PrintLine(); # true
+      IsPangram("")->PrintLine(); # false
+    }
+  }
+}

Task/Pangram-checker/Oz/pangram-checker.oz

@@ -0,0 +1,8 @@
+declare
+  fun {IsPangram Xs}
+     {List.sub
+      {List.number &a &z 1}
+      {Sort {Map Xs Char.toLower} Value.'<'}}
+  end
+in
+  {Show {IsPangram "The quick brown fox jumps over the lazy dog."}}

Task/Pangram-checker/PARI-GP/pangram-checker.pari

@@ -0,0 +1,12 @@
+pangram(s)={
+  s=vecsort(Vec(s),,8);
+  for(i=97,122,
+    if(!setsearch(s,Strchr(i)) && !setsearch(s,Strchr(i-32)),
+      return(0)
+    )
+  );
+  1
+};
+
+pangram("The quick brown fox jumps over the lazy dog.")
+pangram("The quick brown fox jumps over the lazy doe.")

Task/Pangram-checker/PHP/pangram-checker.php

@@ -0,0 +1,20 @@
+function isPangram($text) {
+    foreach (str_split($text) as $c) {
+        if ($c >= 'a' && $c <= 'z')
+            $bitset |= (1 << (ord($c) - ord('a')));
+        else if ($c >= 'A' && $c <= 'Z')
+            $bitset |= (1 << (ord($c) - ord('A')));
+    }
+    return $bitset == 0x3ffffff;
+}
+
+$test = array(
+    "the quick brown fox jumps over the lazy dog",
+    "the quick brown fox jumped over the lazy dog",
+    "ABCDEFGHIJKLMNOPQSTUVWXYZ",
+    "ABCDEFGHIJKL.NOPQRSTUVWXYZ",
+    "ABC.D.E.FGHI*J/KL-M+NO*PQ R\nSTUVWXYZ"
+);
+
+foreach ($test as $str)
+    echo "$str : ", isPangram($str) ? 'T' : 'F', '</br>';

Task/Pangram-checker/PL-I/pangram-checker.pli

@@ -0,0 +1,28 @@
+test_pangram: procedure options (main);
+
+is_pangram: procedure() returns (bit(1) aligned);
+
+   declare text character (200) varying;
+   declare c character (1);
+
+   get edit (text) (L);
+   put skip list (text);
+
+   text = lowercase(text);
+
+   do c = 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k',
+          'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u',
+          'v', 'w', 'x', 'y', 'z';
+      if index(text, c) = 0 then return ('0'b);
+   end;
+   return ('1'b);
+end is_pangram;
+
+   put skip list ('Please type a sentence');
+
+   if is_pangram() then
+      put skip list ('The sentence is a pangram.');
+   else
+      put skip list ('The sentence is not a pangram.');
+
+end test_pangram;

Task/Pangram-checker/Perl-6/pangram-checker.pl6

@@ -0,0 +1,13 @@
+constant Eng = set 'a' .. 'z';
+constant Cyr = set <а б в г д е ж з и й к л м н о п р с т у ф х ц ч ш щ ъ ы ь э ю я ё>;
+constant Hex = set 'a' .. 'f';
+
+sub pangram($str, Set $alpha = Eng) {
+  $alpha ⊆ $str.lc.comb;
+}
+
+say pangram("The quick brown fox jumps over the lazy dog.");
+say pangram("My dog has fleas.");
+say pangram("My dog has fleas.", Hex);
+say pangram("My dog backs fleas.", Hex);
+say pangram "Съешь же ещё этих мягких французских булок, да выпей чаю", Cyr;

Task/Pangram-checker/Perl/pangram-checker.pl

@@ -0,0 +1,5 @@
+use List::MoreUtils 'all';
+
+sub pangram {all {$_[0] =~ /$_/i} 'a' .. 'z';}
+
+print "Yes.\n" if pangram 'Cozy lummox gives smart squid who asks for job pen.';

Task/Pangram-checker/PicoLisp/pangram-checker.l

@@ -0,0 +1,5 @@
+(de isPangram (Str)
+   (not
+      (diff
+         '`(chop "abcdefghijklmnopqrstuvwxyz")
+         (chop (lowc Str)) ) ) )

Task/Pangram-checker/Prolog/pangram-checker.pro

@@ -0,0 +1,12 @@
+pangram(L) :-
+	numlist(0'a, 0'z, Alphabet),
+	forall(member(C, Alphabet), member(C, L)).
+
+pangram_example :-
+	L1 = "the quick brown fox jumps over the lazy dog",
+	(   pangram(L1) -> R1= ok; R1 = ko),
+	format('~s --> ~w ~n', [L1,R1]),
+
+	L2 = "the quick brown fox jumped over the lazy dog",
+	(   pangram(L2) -> R2 = ok; R2 = ko),
+	format('~s --> ~w ~n', [L2, R2]).

Task/Pangram-checker/PureBasic/pangram-checker.purebasic

@@ -0,0 +1,31 @@
+Procedure IsPangram_fast(String$)
+  String$ = LCase(string$)
+  char_a=Asc("a")
+  ; sets bits in a variable if a letter is found, reads string only once
+  For a = 1 To Len(string$)
+    char$ = Mid(String$, a, 1)
+    pos   = Asc(char$) - char_a
+    check.l |  1 << pos
+  Next
+  If check & $3FFFFFF = $3FFFFFF
+    ProcedureReturn 1
+  EndIf
+  ProcedureReturn 0
+EndProcedure
+
+Procedure IsPangram_simple(String$)
+  String$ = LCase(string$)
+  found   = 1
+  For a = Asc("a") To Asc("z")
+  ; searches for every letter in whole string
+    If FindString(String$, Chr(a), 0) = 0
+      found = 0
+    EndIf
+  Next
+  ProcedureReturn found
+EndProcedure
+
+Debug IsPangram_fast("The quick brown fox jumps over lazy dogs.")
+Debug IsPangram_simple("The quick brown fox jumps over lazy dogs.")
+Debug IsPangram_fast("No pangram")
+Debug IsPangram_simple("No pangram")

Task/Pangram-checker/Python/pangram-checker.py

@@ -0,0 +1,9 @@
+import string, sys
+if sys.version_info[0] < 3:
+    input = raw_input
+
+def ispangram(sentence, alphabet=string.ascii_lowercase):
+    alphaset = set(alphabet)
+    return alphaset <= set(sentence.lower())
+
+print ( ispangram(input('Sentence: ')) )

Task/Pangram-checker/R/pangram-checker.r

@@ -0,0 +1,10 @@
+checkPangram <- function(sentence){
+  my.letters <- tolower(unlist(strsplit(sentence, "")))
+  is.pangram <- all(letters %in% my.letters)
+
+  if (is.pangram){
+    cat("\"", sentence, "\" is a pangram! \n", sep="")
+  } else {
+    cat("\"", sentence, "\" is not a pangram! \n", sep="")
+  }
+}

Task/Pangram-checker/REXX/pangram-checker.rexx

@@ -0,0 +1,16 @@
+/*REXX program to check if an entered string (sentence) is a pangram.   */
+abc='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+
+  do forever                 /*keep prompting until a null or blank(s). */
+  say;     say '───── Please enter a pangramic sentence:';     say
+  pull y                     /*this also uppercases the  Y  variable.   */
+  if y='' then leave         /*if nothing entered, then we're done.     */
+  ?=verify(abc,y)            /*see if all (Latin) letters are present.  */
+
+  if ?==0 then say 'Sentence is a pangram.'
+          else say "Sentence isn't a pangram, missing:" substr(abc,?,1)
+  say
+  end   /*forever*/
+
+say '───── PANGRAM program ended. ─────'
+                                       /*stick a fork in it, we're done.*/

Task/Pangram-checker/Retro/pangram-checker.retro

@@ -0,0 +1,5 @@
+: isPangram? ( $-f )
+  ^strings'toLower
+  heap [ 27 allot ] preserve
+  [ @ 'a - dup 0 25 within [ [ 'a + ] [ here + ] bi ! ] &drop if ]
+  ^types'STRING each@ here "abcdefghijklmnopqrstuvwxyz" compare ;

Task/Pangram-checker/Ruby/pangram-checker.rb

@@ -0,0 +1,7 @@
+def pangram?(sentence)
+  unused_letters = ('a'..'z').to_a - sentence.downcase.chars.to_a
+  unused_letters.empty?
+end
+
+p pangram?('this is a sentence')  # ==> false
+p pangram?('The quick brown fox jumps over the lazy dog.')  # ==> true

Task/Pangram-checker/Run-BASIC/pangram-checker.run

@@ -0,0 +1,13 @@
+s$ = "The quick brown fox jumps over the lazy dog."
+Print pangram(s$);" ";s$
+
+s$ = "My dog has fleas."
+Print pangram(s$);" ";s$
+
+function pangram(str$)
+  str$  = lower$(str$)
+  for i = asc("a") to asc("z")
+      pangram = pangram + (instr(str$, chr$(i)) <> 0)
+  next i
+pangram = (pangram = 26)
+end function

Task/Pangram-checker/SNOBOL4/pangram-checker.sno

@@ -0,0 +1,18 @@
+        define('pangram(str)alfa,c') :(pangram_end)
+pangram str = replace(str,&ucase,&lcase)
+        alfa = &lcase
+pgr_1   alfa len(1) . c = :f(return)
+        str c :s(pgr_1)f(freturn)
+pangram_end
+
+        define('panchk(str)tf') :(panchk_end)
+panchk  output = str
+        tf = 'False'; tf = pangram(str) 'True'
+        output = 'Pangram: ' tf :(return)
+panchk_end
+
+*       # Test and display
+        panchk("The quick brown fox jumped over the lazy dogs.")
+        panchk("My girl wove six dozen plaid jackets before she quit.")
+        panchk("This 41-character string: it's a pangram!")
+end

Task/Pangram-checker/Scala/pangram-checker-1.scala

@@ -0,0 +1 @@
+def is_pangram(sentence: String) = sentence.toLowerCase.filter(c => c >= 'a' && c <= 'z').toSet.size == 26

Task/Pangram-checker/Scala/pangram-checker-2.scala

@@ -0,0 +1,5 @@
+scala> is_pangram("This is a sentence")
+res0: Boolean = false
+
+scala> is_pangram("The quick brown fox jumps over the lazy dog")
+res1: Boolean = true

Task/Pangram-checker/Seed7/pangram-checker.seed7

@@ -0,0 +1,24 @@
+$ include "seed7_05.s7i";
+
+const func boolean: isPangram (in string: stri) is func
+  result
+    var boolean: isPangram is FALSE;
+  local
+    var char: ch is ' ';
+    var set of char: usedChars is (set of char).value;
+  begin
+    for ch range lower(stri) do
+      if ch in {'a' .. 'z'} then
+        incl(usedChars, ch);
+      end if;
+    end for;
+    isPangram := usedChars = {'a' .. 'z'};
+  end func;
+
+const proc: main is func
+  begin
+    writeln(isPangram("This is a test"));
+    writeln(isPangram("The quick brown fox jumps over the lazy dog"));
+    writeln(isPangram("NOPQRSTUVWXYZ  abcdefghijklm"));
+    writeln(isPangram("abcdefghijklopqrstuvwxyz"));  # Missing m, n
+  end func;

Task/Pangram-checker/Smalltalk/pangram-checker-1.st

@@ -0,0 +1,3 @@
+!String methodsFor: 'testing'!
+isPangram
+	^((self collect: [:c | c asUppercase]) select: [:c | c >= $A and: [c <= $Z]]) asSet size = 26

Task/Pangram-checker/Smalltalk/pangram-checker-2.st

@@ -0,0 +1 @@
+'The quick brown fox jumps over the lazy dog.' isPangram

Task/Pangram-checker/TUSCRIPT/pangram-checker.tuscript

@@ -0,0 +1,13 @@
+$$ MODE TUSCRIPT,{}
+alfabet="abcdefghijklmnopqrstuvwxyz"
+sentences = *
+DATA The quick brown fox jumps over the lazy dog
+DATA the quick brown fox falls over the lazy dog
+LOOP s=sentences
+ getchars      =STRINGS    (s," {&a} ")
+ sortchars     =ALPHA_SORT (getchars)
+ reducechars   =REDUCE     (sortchars)
+ chars_in_s    =EXCHANGE   (reducechars," '  ")
+ IF (chars_in_s==alfabet) PRINT "   pangram: ",s
+ IF (chars_in_s!=alfabet) PRINT "no pangram: ",s
+ENDLOOP

Task/Pangram-checker/TXR/pangram-checker.txr

@@ -0,0 +1,7 @@
+@/.*[Aa].*&.*[Bb].*&.*[Cc].*&.*[Dd].*& \
+  .*[Ee].*&.*[Ff].*&.*[Gg].*&.*[Hh].*& \
+  .*[Ii].*&.*[Jj].*&.*[Kk].*&.*[Ll].*& \
+  .*[Mm].*&.*[Nn].*&.*[Oo].*&.*[Pp].*& \
+  .*[Qq].*&.*[Rr].*&.*[Ss].*&.*[Tt].*& \
+  .*[Uu].*&.*[Vv].*&.*[Ww].*&.*[Xx].*& \
+  .*[Yy].*&.*[Zz].*/

Task/Pangram-checker/Tcl/pangram-checker.tcl

@@ -0,0 +1,9 @@
+proc pangram? {sentence} {
+    set letters [regexp -all -inline {[a-z]} [string tolower $sentence]]
+    expr {
+        [llength [lsort -unique $letters]] == 26
+    }
+}
+
+puts [pangram? "This is a sentence"];  # ==> false
+puts [pangram? "The quick brown fox jumps over the lazy dog."]; # ==> true

Task/Pangram-checker/UNIX-Shell/pangram-checker.sh

@@ -0,0 +1,11 @@
+function pangram? {
+  local alphabet=abcdefghijklmnopqrstuvwxyz
+  local string="$*"
+  string="${string,,}"
+  while [[ -n "$string" && -n "$alphabet" ]]; do
+    local ch="${string%%${string#?}}"
+    string="${string#?}"
+    alphabet="${alphabet/$ch}"
+  done
+  [[ -z "$alphabet" ]]
+}

Task/Pangram-checker/Ursala/pangram-checker-1.ursala

@@ -0,0 +1,3 @@
+#import std
+
+is_pangram = ^jZ^(!@l,*+ @rlp -:~&) ~=`A-~ letters

Task/Pangram-checker/Ursala/pangram-checker-2.ursala

@@ -0,0 +1,7 @@
+#cast %bL
+
+test =
+
+is_pangram* <
+   'The quick brown fox jumps over the lazy dog',
+   'this is not a pangram'>

Task/Pangram-checker/VBA/pangram-checker.vba

@@ -0,0 +1,14 @@
+Function pangram2(s As String) As Boolean
+    Const sKey As String = "abcdefghijklmnopqrstuvwxyz"
+    Dim sLow As String
+    Dim i As Integer
+
+    sLow = LCase(s)
+    For i = 1 To 26
+      If InStr(sLow, Mid(sKey, i, 1)) = 0 Then
+        pangram2 = False
+        Exit Function
+      End If
+    Next
+    pangram2 = True
+End Function

Task/Pangram-checker/VBScript/pangram-checker-1.vbscript

@@ -0,0 +1,29 @@
+function pangram( s )
+	dim i
+	dim sKey
+	dim sChar
+	dim nOffset
+	sKey = "abcdefghijklmnopqrstuvwxyz"
+	for i = 1 to len( s )
+		sChar = lcase(mid(s,i,1))
+		if sChar <> " "  then
+			if instr(sKey, sChar) then
+				nOffset = asc( sChar ) - asc("a")  + 1
+				if nOffset > 1 then
+					sKey = left(sKey, nOffset - 1) & " " & mid( sKey, nOffset + 1)
+				else
+					sKey = " " & mid( sKey, nOffset + 1)
+				end if
+			end if
+		end if
+	next
+	pangram = ( ltrim(sKey) = vbnullstring )
+end function
+		
+function eef( bCond, exp1, exp2 )
+	if bCond then
+		eef = exp1
+	else
+		eef = exp2
+	end if
+end function

Task/Pangram-checker/VBScript/pangram-checker-2.vbscript

@@ -0,0 +1,2 @@
+wscript.echo eef(pangram("a quick brown fox jumps over the lazy dog"), "is a pangram", "is not a pangram")
+wscript.echo eef(pangram(""), "is a pangram", "is not a pangram")"

Task/Pangram-checker/XPL0/pangram-checker.xpl0

@@ -0,0 +1,31 @@
+include c:\cxpl\codes;          \intrinsic 'code' declarations
+string 0;                       \use zero-terminated strings
+
+func StrLen(Str);               \Return number of characters in an ASCIIZ string
+char Str;
+int  I;
+for I:= 0 to -1>>1-1 do
+        if Str(I) = 0 then return I;
+
+func Pangram(S);
+char S;
+int  A, I, C;
+[A:= 0;
+for I:= 0 to StrLen(S)-1 do
+        [C:= S(I);
+        if C>=^A & C<=^Z then C:= C or $20;
+        if C>=^a & C<=^z then [C:= C - ^a;  A:= A or 1<<C];
+        ];
+return A = $3FFFFFF;
+]; \Pangram
+
+int Sentence, I;
+[Sentence:=
+    ["The quick brown fox jumps over the lazy dog.",
+     "Pack my box with five dozen liquor jugs.",
+     "Now is the time for all good men to come to the aid of their country."];
+for I:= 0 to 3-1 do
+    [Text(0, if Pangram(Sentence(I)) then "yes" else "no");
+    CrLf(0);
+    ];
+]