1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
|
/* ========================================================================== */
/* === UMF_is_permutation =================================================== */
/* ========================================================================== */
/* -------------------------------------------------------------------------- */
/* UMFPACK Version 4.1 (Apr. 30, 2003), Copyright (c) 2003 by Timothy A. */
/* Davis. All Rights Reserved. See ../README for License. */
/* email: davis@cise.ufl.edu CISE Department, Univ. of Florida. */
/* web: http://www.cise.ufl.edu/research/sparse/umfpack */
/* -------------------------------------------------------------------------- */
/* Return TRUE if P is a r-permutation vector, FALSE otherwise */
/* P [0..r-1] must be an r-permutation of 0..n-1 */
#include "umf_internal.h"
GLOBAL Int UMF_is_permutation
(
const Int P [ ], /* permutation of size r */
Int W [ ], /* workspace of size n */
Int n,
Int r
)
{
Int i, k ;
if (!P)
{
/* if P is (Int *) NULL, this is the identity permutation */
return (TRUE) ;
}
ASSERT (W != (Int *) NULL) ;
for (i = 0 ; i < n ; i++)
{
W [i] = FALSE ;
}
for (k = 0 ; k < r ; k++)
{
i = P [k] ;
DEBUG5 (("k "ID" i "ID"\n", k, i)) ;
if (i < 0 || i >= n)
{
DEBUG0 (("i out of range "ID" "ID"\n", i, n)) ;
return (FALSE) ;
}
if (W [i])
{
DEBUG0 (("i duplicate "ID"\n", i)) ;
return (FALSE) ;
}
W [i] = TRUE ;
}
return (TRUE) ;
}
|
