Logo

Programming-Idioms

Given a one-dimensional array a, check if any value is larger than x, and execute the procedure f if that is the case
Implementation
Pascal

Implementation edit is for fixing errors and enhancing with metadata. Please do not replace the code below with a different implementation.

Instead of changing the code of the snippet, consider creating another Pascal implementation.

Be concise.

Be useful.

All contributions dictatorially edited by webmasters to match personal tastes.

Please do not paste any copyright violating material.

Please try to avoid dependencies to third-party libraries and frameworks.

Other implementations
if (any(a > x)) call f
using System.Linq;
if (a.Any(e => e > x))
    f();
if(a.some(item => item > x)){
	f()
}
use List::Util qw(any);
f if any { $_ > $x } @a;
if any(v > x for v in a):
    f()
f if a.any?{|v| v > x }
for _, v := range a {
	if v > x {
		f()
		break
	}
}
if (count(array_filter($a, function($v) { return $v > $x; })))
  f();

// or with intermediate steps
$tmp = array_filter(
  $a,
  function ($v) { return $v > $x; }
)
if (count($tmp))
  f();

// or with array reduce instead
if (
  array_reduce($a, 
    function($old, $item) { return $old or ($item > $x); }
  )
)
  f();

// Array reduce takes the old result $old, and 
// applies $item (from $a) to the old result 
// iteratively. We use the 'or' boolean operator
// to implement an 'any' operation.
if a.iter().any(|&elem| elem > x) {
    f()
}
(let iter ((l a))
  (cond ((null? l) '())
        ((> (car l) x) (f))
        (else (iter (cdr l)))))
unsigned i;
for (i = 0; i < sizeof(a) / sizeof(a[0]); ++i) {
	if (a[i] > x) {
		f();
		break;
	}
}
if (a.any { it > x })
    f()
#include <algorithm>
if (std::any_of(a.begin(), a.end(), [x](auto y) { return y > x; }))
    f();
for(int i = 0; i<a.length;i++) {
	if(a[i]>x) {
		f();
		break;
	}
}
when (foldl1 (||) $ map (a > x)) f
if (a.any((value) => value > x)) f();
for(int value : a) {
	if(value > x) {
		f();
		break;
	}
}
(when (seq (filter #(> % x) a)) (f))