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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
|
# Copyright 2001-10 by Roger Bivand
#
is.symmetric.nb <- function(nb, verbose=NULL, force=FALSE)
{
if(!inherits(nb, "nb")) stop("Not neighbours list")
if (is.null(verbose)) verbose <- get("verbose", envir = .spdepOptions)
stopifnot(is.logical(verbose))
nbsym <- attr(nb, "sym")
if(!is.null(nbsym)) res <- nbsym
if(force || is.null(nbsym)) {
res <- .Call("symtest", nb=nb, card=as.integer(card(nb)),
verbose=as.logical(verbose), PACKAGE="spdep")
}
if(!res && verbose) cat("Non-symmetric neighbours list\n")
res
}
is.symmetric.glist <- function(nb, glist)
{
if(!inherits(nb, "nb")) stop("Not neighbours list")
nbsym <- attr(nb, "sym")
if(is.null(nbsym)) nbsym <- is.symmetric.nb(nb)
if (!nbsym) {
res0 <- vector(mode="list", length=2)
res0[[1]] <- FALSE
res0[[2]] <- Inf
} else {
if (length(nb) != length(glist)) stop("list lengths differ")
cnb <- as.integer(card(nb))
gnb <- as.integer(sapply(glist, length))
if (!(identical(cnb, gnb)))
stop("different vector lengths in lists")
res0 <- .Call("gsymtest", nb=nb, glist=glist, card=cnb,
PACKAGE="spdep")
}
res <- res0[[1]]
attr(res, "d") <- res0[[2]]
res
}
sym.attr.nb <- function(nb) {
if(!inherits(nb, "nb")) stop("Not neighbours list")
nbsym <- attr(nb, "sym")
if(is.null(nbsym))
attr(nb, "sym") <- is.symmetric.nb(nb, verbose=FALSE,
force=TRUE)
nb
}
include.self <- function(nb) {
if (!is.null(attributes(nb)$self.included) &&
(as.logical(attributes(nb)$self.included)))
stop("Self already included")
n <- length(nb)
nc <- card(nb)
for (i in 1:n) {
if (nc[i] > 0) {
nb[[i]] <- sort(c(i, nb[[i]]))
} else {
nb[[i]] <- i
}
}
attr(nb, "self.included") <- TRUE
nb
}
is.selfneighbour <- function(nb) {
res <- sapply(seq(along=nb), function(i) i %in% nb[[i]])
}
# Copyright 2001-7 by Nicholas Lewin-Koh and Roger Bivand
old.make.sym.nb <- function(nb){
if(!inherits(nb, "nb")) stop("Not neighbours list")
if (is.symmetric.nb(nb, FALSE, TRUE)) {
res <- nb
} else {
# k <- unlist(lapply(nb,length))
# problems handling no-neighbour entities
k <- card(nb)
to <- unlist(nb)
to <- to[to > 0]
from <- NULL
res <- vector(mode="list", length=length(nb))
for(i in 1:length(nb)){
from <- c(from,rep(i,k[i]))
}
for(i in 1:length(nb)){
res[[i]] <- sort(unique(c(to[from==i],from[to==i])))
if(length(res[[i]]) == 0L) res[[i]] <- 0L
}
attr(res, "region.id") <- attr(nb,"region.id")
attr(res, "call") <- attr(nb, "call")
attr(res, "type") <- attr(nb, "type")
attr(res, "sym") <- TRUE
class(res) <- "nb"
}
res
}
# Copyright 2009 by Bjarke Christensen and Roger Bivand
make.sym.nb <- function (nb)
{
if (!inherits(nb, "nb"))
stop("Not neighbours list")
if (any(card(nb) == 0)) return(old.make.sym.nb(nb))
res <- nb
if (!is.symmetric.nb(nb, FALSE, TRUE)) {
for (i in 1:length(res)) {
#Which of observation i's neighbors have i amongst _its_ neighbors?
refersback <- sapply(res[res[[i]]], function(x) i %in% x)
#Add i to the neighborhood of those of i's neighbors who don't refer back
res[ res[[i]][!refersback] ] <- lapply(res[ res[[i]][!refersback]],
function(x) sort(c(i, x)))
}
attributes(res) <- attributes(res)[!(names(attributes(res))=='knn-k')]
attr(res, "sym") <- TRUE
}
res
}
# Idea due to Roberto Patuelli
aggregate.nb <- function(x, IDs, remove.self=TRUE, ...) {
stopifnot(length(x) == length(IDs))
in_reg.ids <- attr(x, "region.id")
mtch <- tapply(in_reg.ids, IDs, function(i) c(i))
out_reg.ids <- names(mtch)
nb_short <- vector(mode="list", length=length(mtch))
for (i in seq(along=mtch)) {
nb_short[[i]] <- 0L
imtch <- match(mtch[[i]], in_reg.ids)
res <- unlist(x[imtch])
nb_short[[i]] <- as.integer(sort(unique(match(IDs[res], out_reg.ids))))
if (remove.self && i %in% nb_short[[i]]) {
nb_short[[i]] <- nb_short[[i]][-(match(i, nb_short[[i]]))]
if (length(nb_short[[i]]) < 1L) nb_short[[i]] <- 0L
}
}
# RSB fix 180620
nb_short[sapply(nb_short, length) == 0L] <- 0L
attr(nb_short, "region.id") <- out_reg.ids
class(nb_short) <- "nb"
if (any(card(nb_short) == 0L)) nb_short <- subset(nb_short, card(nb_short) > 0L)
nb_short <- sym.attr.nb(nb_short)
nb_short
}
|
