mirror of
https://github.com/freebsd/freebsd-src
synced 2024-07-22 10:48:02 +00:00
2935fe8237
Relevant changes see ChangeLog for details:
Add support for ${.SUFFIXES} as read-only variable.
Fix memory leak in cond.c
Punt on write errors - ENOSPC etc.
Lots of code refactoring, rework to reduce memory allocations.
More unit-tests.
43 lines
1.3 KiB
Makefile
43 lines
1.3 KiB
Makefile
# $NetBSD: varmod-order-shuffle.mk,v 1.7 2021/08/03 04:46:49 rillig Exp $
|
|
#
|
|
# Tests for the :Ox variable modifier, which returns the words of the
|
|
# variable, shuffled.
|
|
#
|
|
# The variable modifier :Ox is available since 2005-06-01.
|
|
#
|
|
# As of 2020-08-16, make uses random(3) seeded by the current time in seconds.
|
|
# This makes the random numbers completely predictable since there is no other
|
|
# part of make that uses random numbers.
|
|
#
|
|
# Tags: probabilistic
|
|
|
|
WORDS= one two three four five six seven eight nine ten
|
|
|
|
# Note that 1 in every 10! trials two independently generated
|
|
# randomized orderings will be the same. The test framework doesn't
|
|
# support checking probabilistic output, so we accept that each of the
|
|
# 3 :Ox tests will incorrectly fail with probability 2.756E-7, which
|
|
# lets the whole test fail once in 1.209.600 runs, on average.
|
|
|
|
# Create two shuffles using the := assignment operator.
|
|
shuffled1:= ${WORDS:Ox}
|
|
shuffled2:= ${WORDS:Ox}
|
|
.if ${shuffled1} == ${shuffled2}
|
|
. error ${shuffled1} == ${shuffled2}
|
|
.endif
|
|
|
|
# Sorting the list before shuffling it has no effect.
|
|
shuffled1:= ${WORDS:O:Ox}
|
|
shuffled2:= ${WORDS:O:Ox}
|
|
.if ${shuffled1} == ${shuffled2}
|
|
. error ${shuffled1} == ${shuffled2}
|
|
.endif
|
|
|
|
# Sorting after shuffling must produce the original numbers.
|
|
sorted:= ${WORDS:Ox:O}
|
|
.if ${sorted} != ${WORDS:O}
|
|
. error ${sorted} != ${WORDS:O}
|
|
.endif
|
|
|
|
all:
|