Skip to content

Commit

Permalink
Merge pull request #14 from andrjohns/array-syntax
Browse files Browse the repository at this point in the history
 Update deprecated syntax for future rstan compatibility
  • Loading branch information
AngusMcLure authored Nov 16, 2023
2 parents 85828d9 + 1a83427 commit d39a365
Show file tree
Hide file tree
Showing 5 changed files with 15 additions and 18 deletions.
6 changes: 3 additions & 3 deletions DESCRIPTION
Original file line number Diff line number Diff line change
Expand Up @@ -36,7 +36,7 @@ Imports:
progress,
Rcpp (>= 0.12.0),
RcppParallel (>= 5.0.1),
rstan (>= 2.18.1),
rstan (>= 2.26.0),
rstantools (>= 2.3.1.1),
stats,
stringr
Expand All @@ -45,8 +45,8 @@ LinkingTo:
Rcpp (>= 0.12.0),
RcppEigen (>= 0.3.3.3.0),
RcppParallel (>= 5.0.1),
rstan (>= 2.18.1),
StanHeaders (>= 2.18.0)
rstan (>= 2.26.0),
StanHeaders (>= 2.26.0)
SystemRequirements: GNU make
RoxygenNote: 7.2.3
Language: en-AU
Expand Down
3 changes: 0 additions & 3 deletions configure
Original file line number Diff line number Diff line change
Expand Up @@ -3,6 +3,3 @@
# Generated by rstantools. Do not edit by hand.

"${R_HOME}/bin/Rscript" -e "rstantools::rstan_config()"

# Add configuration needed for big object files
echo "PKG_CXXFLAGS += -Wa,-mbig-obj" >> ./src/Makevars
10 changes: 5 additions & 5 deletions inst/stan/HierPoolPrevIndividualSD.stan
Original file line number Diff line number Diff line change
@@ -1,9 +1,9 @@
data {
int<lower=1> N; //Number of data points
int<lower=1> L; // Number of levels or grouping variables
int<lower=1> NumGroups[L]; //Number of groups for each level of grouping variable
array[L] int<lower=1> NumGroups; //Number of groups for each level of grouping variable
int<lower=L> TotalGroups; //Total number of groups across all levels
int<lower=0, upper=1> Result[N];
array[N] int<lower=0, upper=1> Result;
vector<lower=0>[N] PoolSize;
matrix<lower = 0, upper = 1>[N,TotalGroups] Z; //Model matrix for group effects
// Parameters for t-distributed priors for:
Expand All @@ -17,11 +17,11 @@ data {
real<lower=0> GroupSDSigma;
}
transformed data{
int<lower=0, upper=1> FlippedResult[N];
array[N] int<lower=0, upper=1> FlippedResult;
//Get a sparse version of the model matrix for group effects (Z)
vector[L*N] Zw;
int Zv[L*N];
int Zu[N+1];
array[L*N] int Zv;
array[N+1] int Zu;
Zw = csr_extract_w(Z);
Zv = csr_extract_v(Z);
Zu = csr_extract_u(Z);
Expand Down
10 changes: 5 additions & 5 deletions inst/stan/HierPoolPrevTotalSD.stan
Original file line number Diff line number Diff line change
@@ -1,9 +1,9 @@
data {
int<lower=1> N; //Number of data points
int<lower=1> L; // Number of levels or grouping variables
int<lower=1> NumGroups[L]; //Number of groups for each level of grouping variable
array[L] int<lower=1> NumGroups; //Number of groups for each level of grouping variable
int<lower=L> TotalGroups; //Total number of groups across all levels
int<lower=0, upper=1> Result[N];
array[N] int<lower=0, upper=1> Result;
vector<lower=0>[N] PoolSize;
matrix<lower = 0, upper = 1>[N,TotalGroups] Z; //Model matrix for group effects
// Parameters for t-distributed priors for:
Expand All @@ -17,11 +17,11 @@ data {
real<lower=0> GroupSDSigma;
}
transformed data{
int<lower=0, upper=1> FlippedResult[N];
array[N] int<lower=0, upper=1> FlippedResult;
//Get a sparse version of the model matrix for group effects (Z)
vector[L*N] Zw;
int Zv[L*N];
int Zu[N+1];
array[L*N] int Zv;
array[N+1] int Zu;
Zw = csr_extract_w(Z);
Zv = csr_extract_v(Z);
Zu = csr_extract_u(Z);
Expand Down
4 changes: 2 additions & 2 deletions inst/stan/PoolPrev.stan
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
data {
int<lower=1> N;
int<lower=0, upper=1> Result[N];
array[N] int<lower=0, upper=1> Result;
vector<lower=0>[N] PoolSize;
real<lower=0> PriorAlpha;
real<lower=0> PriorBeta;
Expand All @@ -10,7 +10,7 @@ parameters {
real<lower=0, upper=1> p;
}
transformed parameters{
real<lower=0, upper=1> ps[N];
array[N] real<lower=0, upper=1> ps;
real q;
q = 1-p;
for(n in 1:N){
Expand Down

0 comments on commit d39a365

Please sign in to comment.