text stringlengths 1 1.04M | language stringclasses 25 values |
|---|---|
{
"productionMode": false,
"useDeprecatedV14Bootstrapping": false,
"eagerServerLoad": false,
"npmFolder": "C:\\Users\\matuz\\Desktop\\my-webshop",
"generatedFolder": "C:\\Users\\matuz\\Desktop\\my-webshop\\target\\frontend",
"frontendFolder": "C:\\Users\\matuz\\Desktop\\my-webshop\\frontend",
"connect.javaSourceFolder": "C:\\Users\\matuz\\Desktop\\my-webshop\\src\\main\\java",
"javaResourceFolder": "C:\\Users\\matuz\\Desktop\\my-webshop\\src\\main\\resources",
"connect.applicationProperties": "C:\\Users\\matuz\\Desktop\\my-webshop\\src\\main\\resources\\application.properties",
"connect.openApiFile": "C:\\Users\\matuz\\Desktop\\my-webshop\\target\\generated-resources\\openapi.json",
"project.frontend.generated": "C:\\Users\\matuz\\Desktop\\my-webshop\\frontend\\generated",
"pnpm.enable": true,
"require.home.node": false,
"build.folder": "target"
}
| json |
{
"id": "fango",
"symbol": "xfg",
"name": "Fango",
"platforms": {},
"hashing_algorithm": "Cryptonight",
"categories": [
"Media",
"Privacy Coins"
],
"description": {
"en": "Fango (XFG) is an open-source decentralized privacy cryptocurrency which utilizes CryptoNote ring-signatures along with it\u2019s peer-to-peer network and blockchain ledger to securely transfer & store value, anonymously. Presenting an alternative monetary system, in which we - as a community of fandom enthusiasts & sound money advocates- benefit from our own decentralized money supply, specifically designed to always be increasing in long term purchasing power. Fango consensus is achieved thru proof of work, and is limited to desktop-only (CPU/GPU) mining.\r\n\r\nNetwork integration layer(s) of DIGM Audio Album Marketplace + ParaDio: a streaming rewards radio- with the Fango network (by using XFG Elder Nodes as exclusive payment infrastructure) is currently in development; as well as COLD : Fango\u2019s DeFi Banking Suite for off-chain interest yield on term-locked XFG ledger deposits, by 2022."
},
"country_origin": "US",
"genesis_date": "2018-01-08",
"url": "https://fango.money",
"explorers": [
"http://explorer.fango.money"
],
"twitter": "fandomgold",
"reddit": "Fango/",
"github_org": "FandomGold"
} | json |
Four candidates of the ruling YSR Congress were on Friday declared elected uncontested to the Rajya Sabha in the biennial election from Andhra Pradesh.
State Chief Electoral Officer Mukesh Kumar Meena made this announcement.
The deadline for withdrawal of nominations ended this afternoon.
Accordingly, Returning Officer P V Subba Reddy handed over the election declaration forms to the candidates.
The elected four are: V Vijayasai Reddy, Beeda Masthan Rao, R Krishnaiah and S Niranjan Reddy.
The strength of the party has now increased to nine in Rajya Sabha, out of 11 from the State, with the TDP and the BJP having one member each.
The four sitting members V Vijayasai Reddy (YSRC) and Y S Chowdary, T G Venkatesh and Suresh Prabhu (all BJP) would retire at the end of their six-year tenure on June 21 this year. Vijayasai has been re-elected for the second consecutive term.
(Only the headline and picture of this report may have been reworked by the Business Standard staff; the rest of the content is auto-generated from a syndicated feed. ) | english |
<reponame>hillarykoch/pGMCM
// -*- mode: C++; c-indent-level: 4; c-basic-offset: 4; indent-tabs-mode: nil; -*-
#include <RcppArmadillo.h>
#include <algorithm>
using namespace Rcpp;
using namespace RcppArmadillo;
// [[Rcpp::depends(RcppArmadillo)]]
// [[Rcpp::plugins(cpp11)]]
//
// Stuff for general penalized Gaussian mixture model
//
// Made this so that absolute value of double returns double, not integer
// [[Rcpp::export]]
double abs3(double val){
return std::abs(val);
}
// First derivative of SCAD penalty
// NOTE THAT THIS PENALTY LOOKS A LIL DIFFERENT THAN SCAD, BECAUSE HUANG PUTS LAMBDA OUTSIDE THE PENALIZATION TERM
// [[Rcpp::export]]
arma::rowvec SCAD_1d(arma::rowvec prop, double lambda, int k, double a = 3.7) {
arma::colvec term2(k, arma::fill::zeros);
arma::rowvec out(k, arma::fill::none);
for(int i = 0; i < k; ++i) {
if(a*lambda - prop(i) > 0) {
term2(i) = (a*lambda - prop(i))/(a*lambda-lambda);
}
out(i) = ((prop(i) <= lambda) + term2(i)*(prop(i) > lambda));
}
return out;
}
// First derivative of SCAD penalty, when only passing an integer and not a vector
// NOTE THAT THIS PENALTY LOOKS A LIL DIFFERENT THAN SCAD, BECAUSE HUANG PUTS LAMBDA OUTSIDE THE PENALIZATION TERM
// [[Rcpp::export]]
double double_SCAD_1d(double prop, double lambda, double a = 3.7) {
double term2 = 0.0;
double out;
if(a*lambda - prop > 0) {
term2 = (a*lambda - prop)/(a*lambda-lambda);
}
out = ((prop <= lambda) + term2*(prop > lambda));
return out;
}
// SCAD penalty
// NOTE THAT THIS PENALTY LOOKS A LIL DIFFERENT THAN SCAD, BECAUSE HUANG PUTS LAMBDA OUTSIDE THE PENALIZATION TERM
// [[Rcpp::export]]
arma::rowvec SCAD(arma::rowvec prop, double lambda, int k, double a = 3.7) {
arma::rowvec out(k, arma::fill::none);
double val;
for(int i = 0; i < k; ++i) {
val = abs3(prop(i));
if(val <= lambda) {
out(i) = lambda;
} else if(lambda < val & val <= a * lambda) {
out(i) = -((pow(val,2)-2*a*lambda*val+pow(lambda,2)) / (2 * (a-1) * lambda));
} else {
out(i) = ((a+1) * lambda) / 2;
}
}
return out;
}
// SCAD penalty, when only passing an integer and not a vector
// NOTE THAT THIS PENALTY LOOKS A LIL DIFFERENT THAN SCAD, BECAUSE HUANG PUTS LAMBDA OUTSIDE THE PENALIZATION TERM
// [[Rcpp::export]]
double double_SCAD(double prop, double lambda, double a = 3.7) {
double out;
double val;
val = abs3(prop);
if(val <= lambda) {
out = lambda;
} else if(lambda < val & val <= a * lambda) {
out = -((pow(val,2)-2*a*lambda*val+pow(lambda,2)) / (2 * (a-1) * lambda));
} else {
out = ((a+1) * lambda) / 2;
}
return out;
}
// choose slices from a cube given index
// [[Rcpp::export]]
arma::cube choose_slice(arma::cube& Q, arma::uvec idx, int d, int k) {
arma::cube y(d, d, k, arma::fill::none);
for(int i = 0; i < k; ++i) {
y.slice(i) = Q.slice(idx(i));
}
return y;
}
// compute Mahalanobis distance for multivariate normal
// [[Rcpp::export]]
arma::vec Mahalanobis(arma::mat x, arma::rowvec mu, arma::mat sigma){
const int n = x.n_rows;
arma::mat x_cen;
x_cen.copy_size(x);
for (int i=0; i < n; i++) {
x_cen.row(i) = x.row(i) - mu;
}
return sum((x_cen * sigma.i()) % x_cen, 1); // can probably change sigma.i() to inversion for positive semi-definite matrices (for speed!)
}
// Compute density of multivariate normal
// [[Rcpp::export]]
arma::vec cdmvnorm(arma::mat x, arma::rowvec mu, arma::mat sigma){
arma::vec mdist = Mahalanobis(x, mu, sigma);
double logdet = log(arma::det(sigma));
const double log2pi = std::log(2.0 * M_PI);
arma::vec logretval = -(x.n_cols * log2pi + logdet + mdist)/2;
return exp(logretval);
}
// estimation and model selection of penalized GMM
// [[Rcpp::export]]
Rcpp::List cfpGMM(arma::mat& x,
arma::rowvec prop,
arma::mat& mu,
arma::cube& sigma,
int k,
double df,
double lambda,
int citermax,
double tol
) {
const int n = x.n_rows;
const int d = x.n_cols;
double delta = 1;
arma::rowvec prop_old = prop;
arma::mat mu_old = mu;
arma::cube sigma_old = sigma;
arma::uvec tag(n, arma::fill::none);
arma::mat pdf_est(n, k, arma::fill::none);
arma::mat prob0(n, k, arma::fill::none);
arma::mat h_est(n, k, arma::fill::none);
//double thresh = 1/(log(n) * sqrt(n));
double thresh = 1E-03;
for(int step = 0; step < citermax; ++step) {
// E step
for(int i = 0; i < k; ++i) {
arma::rowvec tmp_mu = mu_old.row(i);
arma::mat tmp_sigma = sigma_old.slice(i);
pdf_est.col(i) = cdmvnorm(x, tmp_mu, tmp_sigma);
prob0.col(i) = pdf_est.col(i) * prop_old(i);
}
h_est.set_size(n, k);
for(int i = 0; i < n; ++i) {
h_est.row(i) = prob0.row(i)/(sum(prob0.row(i)) * 1.0L);
}
// M step
// update mean
arma::mat mu_new(k, d, arma::fill::none);
for(int i = 0; i < k; ++i) {
mu_new.row(i) = trans(h_est.col(i))*x/(sum(h_est.col(i)) * 1.0L);
}
// update sigma
arma::cube dist(n, d, k, arma::fill::none);
arma::cube sigma_new = sigma_old;
arma::mat ones(n, 1, arma::fill::ones);
for(int i = 0; i < k; ++i) {
dist.slice(i) = x - ones * mu_new.row(i);
sigma_new.slice(i) = trans(dist.slice(i)) * diagmat(h_est.col(i)) * dist.slice(i) / (sum(h_est.col(i)) * 1.0L);
}
// update proportion
arma::rowvec prop_new(k, arma::fill::none);
for(int i = 0; i < k; ++i){
prop_new(i) = (sum(h_est.col(i)) - lambda * df) / (n-k*lambda*df) * 1.0L;
if(prop_new(i) < thresh) // tolerance greater than 0 for numerical stability (Huang2013)
prop_new(i) = 0;
}
prop_new = prop_new/(sum(prop_new) * 1.0L);
// calculate difference between two iterations
delta = sum(abs(prop_new - prop_old));
// eliminate small clusters
if(sum(prop_new == 0) > 0) {
arma::uvec idx = find(prop_new > 0);
k = idx.size();
prop_old.set_size(k);
prop_old = trans(prop_new.elem(idx));
mu_old.set_size(k,d);
mu_old = mu_new.rows(idx);
sigma_old.set_size(d,d,k);
sigma_old = choose_slice(sigma_new, idx, d, k);
pdf_est = pdf_est.cols(idx);
prob0 = prob0.cols(idx);
h_est = h_est.cols(idx);
delta = 1;
}
else{
prop_old = prop_new;
mu_old = mu_new;
sigma_old = sigma_new;
}
//calculate cluster with maximum posterior probability
tag = index_max(h_est, 1);
if(delta < tol)
break;
if(k <= 1)
break;
}
// update likelihood for output
for(int i = 0; i < k; ++i) {
arma::rowvec tmp_mu = mu_old.row(i);
arma::mat tmp_sigma = sigma_old.slice(i);
pdf_est.col(i) = cdmvnorm(x, tmp_mu, tmp_sigma);
prob0.col(i) = pdf_est.col(i) * prop_old(i);
}
return Rcpp::List::create(Rcpp::Named("k") = k,
Rcpp::Named("prop") = prop_old,
Rcpp::Named("mu") = mu_old,
Rcpp::Named("sigma") = sigma_old,
Rcpp::Named("pdf_est") = pdf_est,
Rcpp::Named("ll") = sum(log(sum(prob0,1))),
Rcpp::Named("cluster") = tag+1,
Rcpp::Named("post_prob") = h_est);
}
//
// Stuff for constrained penalized Gaussian mixture model
//
// Calculate variance covariance matrix for constrained pGMM
// [[Rcpp::export]]
arma::mat cget_constr_sigma(arma::rowvec sigma, double rho, arma::rowvec combos, int d){
arma::mat Sigma = diagmat(sigma);
for(int i = 0; i < d-1; ++i){
for(int j = i+1; j < d; ++j){
if(combos(i) == combos(j) & combos(i) != 0){
Sigma(i,j) = rho;
Sigma(j,i) = rho;
} else if(combos(i) == -combos(j) & combos(i) != 0){
Sigma(i,j) = -rho;
Sigma(j,i) = -rho;
}
}
}
return Sigma;
}
// objective function to be optimized
// [[Rcpp::export]]
double func_to_optim(const arma::colvec& init_val,
arma::mat& x,
arma::mat& h_est,
arma::mat& combos) {
double mu = init_val(0);
double sigma = exp(init_val(1));
double rho = init_val(2);
int n = x.n_rows;
int d = x.n_cols;
int k = h_est.n_cols;
double nll;
arma::mat tmp_sigma(d, d, arma::fill::none);
arma::rowvec tmp_mu(d, arma::fill::none);
arma::mat pdf_est(n, k, arma::fill::none);
if( (abs3(rho) >= sigma)) {// || (abs3(rho) >= 1) ) {
return std::numeric_limits<double>::infinity();
}
for(int i = 0; i < k; ++i) {
// get sigma_in to pass to cget_constr_sigma
// This amount to finding the diagonal of Sigma
arma::rowvec sigma_in(abs(sigma*combos.row(i)));
arma::uvec zeroidx = find(combos.row(i) == 0);
sigma_in.elem(zeroidx).ones();
// This min part accounts for the possibility that sigma is actually bigger than 1
// Need to enforce strict inequality between rho and sigma
tmp_sigma = cget_constr_sigma(sigma_in, rho, combos.row(i), d); // rho * sigma should constrain rho to be less than sigma in the optimization
tmp_mu = mu*combos.row(i);
pdf_est.col(i) = cdmvnorm(x, tmp_mu, tmp_sigma);
}
// Adjust for numerically zero values
arma::uvec zeroidx = find(pdf_est == 0);
if(zeroidx.size() > 0) {
arma::uvec posidx = find(pdf_est != 0);
double clamper = pdf_est.elem(posidx).min();
arma::colvec populate_vec = arma::ones(zeroidx.size());
populate_vec = populate_vec * clamper;
pdf_est.elem(zeroidx) = populate_vec;
}
nll = -accu(h_est % log(pdf_est));
return nll;
}
// optimize objective function using 'optim' is R-package 'stats'
// [[Rcpp::export]]
arma::vec optim_rcpp(const arma::vec& init_val,
arma::mat& x,
arma::mat& h_est,
arma::mat& combos){
Rcpp::Environment stats("package:stats");
Rcpp::Function optim = stats["optim"];
try{
Rcpp::List opt = optim(Rcpp::_["par"] = init_val,
Rcpp::_["fn"] = Rcpp::InternalFunction(&func_to_optim),
Rcpp::_["method"] = "Nelder-Mead",
Rcpp::_["x"] = x,
Rcpp::_["h_est"] = h_est,
Rcpp::_["combos"] = combos);
arma::vec mles = Rcpp::as<arma::vec>(opt["par"]);
return mles;
}
catch(...){
arma::colvec err = { NA_REAL, NA_REAL, NA_REAL };
return err;
}
}
// // estimation and model selection of constrained penalized GMM
// // [[Rcpp::export]]
// Rcpp::List cfconstr_pGMM(arma::mat& x,
// arma::rowvec prop,
// arma::mat mu,
// arma::mat sigma,
// double rho,
// arma::mat combos,
// int k,
// arma::rowvec df,
// int lambda,
// int citermax,
// double tol,
// unsigned int LASSO) {
//
// const int n = x.n_rows;
// const int d = x.n_cols;
// double delta = 1;
// arma::rowvec prop_old = prop;
// arma::rowvec prop_new;
// arma::mat mu_old = mu;
// arma::mat sigma_old = sigma;
// double rho_old = rho;
// arma::uvec tag(n, arma::fill::none);
// arma::mat pdf_est(n, k, arma::fill::none);
// arma::mat prob0(n, k, arma::fill::none);
// arma::mat tmp_sigma(d,d,arma::fill::none);
// arma::mat h_est(n, k, arma::fill::none);
// double term; // for SCAD
// arma::colvec err_test = { NA_REAL };
//
// double thresh = 1E-03;
//
// for(int step = 0; step < citermax; ++step) {
// // E step
// for(int i = 0; i < k; ++i) {
// arma::rowvec tmp_mu = mu_old.row(i);
// tmp_sigma = cget_constr_sigma(sigma_old.row(i), rho_old, combos.row(i), d);
//
// try {
// pdf_est.col(i) = cdmvnorm(x, tmp_mu, tmp_sigma);
// prob0.col(i) = pdf_est.col(i) * prop_old(i);
// }
// catch(...){
// arma::colvec err = { NA_REAL, NA_REAL, NA_REAL };
// return Rcpp::List::create(Rcpp::Named("optim_err") = NA_REAL);
// }
// }
//
// h_est.set_size(n, k);
// for(int i = 0; i < n; ++i) {
// h_est.row(i) = prob0.row(i)/(sum(prob0.row(i)) * 1.0L);
// }
//
// // M step
// // update mean and variance covariance with numerical optimization
//
// // Select the mean and variance associated with reproducibility
// arma::uvec repidx = find(combos, 0);
// int idx = repidx(0);
// double mu_in = abs3(mu_old(idx));
// double sigma_in = sigma_old(idx);
// arma::colvec init_val = arma::colvec( { mu_in, log(sigma_in), rho_old } );
//
// // Optimize using optim (for now)
// arma::colvec param_new(3, arma::fill::none);
// param_new = optim_rcpp(init_val, x, h_est, combos);
//
// if(param_new(0) == err_test(0)) {
// return Rcpp::List::create(Rcpp::Named("optim_err") = NA_REAL);
// }
//
// // transform sigma back
// param_new(1) = exp(param_new(1));
//
// prop_new.set_size(k);
// if(LASSO == 1) {
// // update proportion via LASSO penalty
// for(int i = 0; i < k; ++i){
// prop_new(i) = (sum(h_est.col(i)) - lambda * df(i)) / (n-lambda*sum(df)) * 1.0L;
// if(prop_new(i) < thresh) // tolerance greater than 0 for numerical stability (Huang2013)
// prop_new(i) = 0;
// }
// } else {
// // proportion update via SCAD penalty
// term = accu((SCAD_1d(prop, lambda, k) % prop_old) % (1 / (1E-06 + SCAD(prop, lambda, k))));
// for(int i = 0; i < k; ++i) {
// prop_new(i) = sum(h_est.col(i)) /
// (n - (double_SCAD_1d(prop_old(i), lambda) / (1E-06 + double_SCAD(prop_old(i), lambda)) +
// term) * lambda * df(i)) * 1.0L;
// if(prop_new(i) < thresh) // tolerance greater than 0 for numerical stability (Huang2013)
// prop_new(i) = 0;
// }
// }
// prop_new = prop_new/(sum(prop_new) * 1.0L); // renormalize weights
//
// // calculate difference between two iterations
// delta = sum(abs(prop_new - prop_old));
//
// // eliminate small clusters
// if(sum(prop_new == 0) > 0) {
// arma::uvec idx = find(prop_new > 0);
// k = idx.size();
// prop_old = trans(prop_new.elem(idx));
// combos = combos.rows(idx);
// df = trans(df.elem(idx));
//
// mu_old.set_size(k,d);
// mu_old = combos*param_new(0);
//
// sigma_old.set_size(k,d);
// sigma_old = abs(combos*param_new(1));
// arma::uvec zeroidx2 = find(sigma_old == 0);
// sigma_old.elem(zeroidx2).ones();
//
// rho_old = param_new(2);
//
// pdf_est = pdf_est.cols(idx);
// prob0 = prob0.cols(idx);
// h_est = h_est.cols(idx);
// delta = 1;
// }
// else{
// prop_old = prop_new;
// mu_old = combos*param_new(0);
//
// sigma_old = abs(combos*param_new(1));
// arma::uvec zeroidx2 = find(sigma_old == 0);
// sigma_old.elem(zeroidx2).ones();
//
// rho_old = param_new(2);
// }
//
// //calculate cluster with maximum posterior probability
// tag = index_max(h_est, 1);
//
// if(delta < tol)
// break;
//
// if(k <= 1)
// break;
//
// }
//
// // update the likelihood for output
// for(int i = 0; i < k; ++i) {
// arma::rowvec tmp_mu = mu_old.row(i);
// tmp_sigma = cget_constr_sigma(sigma_old.row(i), rho_old, combos.row(i), d);
// pdf_est.col(i) = cdmvnorm(x, tmp_mu, tmp_sigma);
// prob0.col(i) = pdf_est.col(i) * prop_old(i);
// }
//
// return Rcpp::List::create(Rcpp::Named("k") = k,
// Rcpp::Named("prop") = prop_old,
// Rcpp::Named("mu") = mu_old,
// Rcpp::Named("sigma") = sigma_old,
// Rcpp::Named("rho") = rho_old,
// Rcpp::Named("df") = df,
// Rcpp::Named("pdf_est") = pdf_est,
// Rcpp::Named("ll") = sum(log(sum(prob0,1))),
// Rcpp::Named("cluster") = tag+1,
// Rcpp::Named("post_prob") = h_est,
// Rcpp::Named("combos") = combos);
// }
// objective function to be optimized
// [[Rcpp::export]]
double func_to_optim_bound(const arma::colvec& init_val,
arma::mat& x,
arma::mat& h_est,
arma::mat& combos,
double& bound) {
double mu = init_val(0);
double sigma = exp(init_val(1));
double rho = init_val(2);
int n = x.n_rows;
int d = x.n_cols;
int k = h_est.n_cols;
double nll;
if( (abs3(rho) >= sigma)) {
return std::numeric_limits<double>::infinity();
}
if( (abs3(mu) < bound)) {
return std::numeric_limits<double>::infinity();
}
arma::mat tmp_sigma(d, d, arma::fill::none);
arma::rowvec tmp_mu(d, arma::fill::none);
arma::mat pdf_est(n, k, arma::fill::none);
for(int i = 0; i < k; ++i) {
// get sigma_in to pass to cget_constr_sigma
// This amount to finding the diagonal of Sigma
arma::rowvec sigma_in(abs(sigma*combos.row(i)));
arma::uvec zeroidx = find(combos.row(i) == 0);
sigma_in.elem(zeroidx).ones();
// This min part accounts for the possibility that sigma is actually bigger than 1
// Need to enforce strict inequality between rho and sigma
tmp_sigma = cget_constr_sigma(sigma_in, rho, combos.row(i), d); // rho * sigma should constrain rho to be less than sigma in the optimization
tmp_mu = mu*combos.row(i);
pdf_est.col(i) = cdmvnorm(x, tmp_mu, tmp_sigma);
}
// Adjust for numerically zero values
arma::uvec zeroidx = find(pdf_est == 0);
if(zeroidx.size() > 0) {
arma::uvec posidx = find(pdf_est != 0);
double clamper = pdf_est.elem(posidx).min();
arma::colvec populate_vec = arma::ones(zeroidx.size());
populate_vec = populate_vec * clamper;
pdf_est.elem(zeroidx) = populate_vec;
}
nll = -accu(h_est % log(pdf_est));
return nll;
}
// optimize objective function using 'optim' is R-package 'stats'
// [[Rcpp::export]]
arma::vec optim_rcpp_bound(const arma::vec& init_val,
arma::mat& x,
arma::mat& h_est,
arma::mat& combos,
double& bound){
Rcpp::Environment stats("package:stats");
Rcpp::Function optim = stats["optim"];
try{
Rcpp::List opt = optim(Rcpp::_["par"] = init_val,
Rcpp::_["fn"] = Rcpp::InternalFunction(&func_to_optim_bound),
Rcpp::_["method"] = "Nelder-Mead",
Rcpp::_["x"] = x,
Rcpp::_["h_est"] = h_est,
Rcpp::_["combos"] = combos,
Rcpp::_["bound"] = bound);
arma::vec mles = Rcpp::as<arma::vec>(opt["par"]);
return mles;
}
catch(...){
arma::colvec err = { NA_REAL, NA_REAL, NA_REAL };
return err;
}
}
// estimation and model selection of constrained penalized GMM
// [[Rcpp::export]]
Rcpp::List cfconstr_pgmm(arma::mat& x,
arma::rowvec prop,
arma::mat mu,
arma::mat sigma,
double rho,
arma::mat combos,
int k,
arma::rowvec df,
int lambda,
int citermax,
double tol,
unsigned int LASSO,
double bound = 0.0) {
const int n = x.n_rows;
const int d = x.n_cols;
double delta = 1;
arma::rowvec prop_old = prop;
arma::rowvec prop_new;
arma::mat mu_old = mu;
arma::mat sigma_old = sigma;
double rho_old = rho;
arma::uvec tag(n, arma::fill::none);
arma::mat pdf_est(n, k, arma::fill::none);
arma::mat prob0(n, k, arma::fill::none);
arma::mat tmp_sigma(d,d,arma::fill::none);
arma::mat h_est(n, k, arma::fill::none);
double term; // for SCAD
arma::colvec err_test = { NA_REAL };
double thresh = 1E-03;
for(int step = 0; step < citermax; ++step) {
// E step
for(int i = 0; i < k; ++i) {
arma::rowvec tmp_mu = mu_old.row(i);
tmp_sigma = cget_constr_sigma(sigma_old.row(i), rho_old, combos.row(i), d);
try {
pdf_est.col(i) = cdmvnorm(x, tmp_mu, tmp_sigma);
prob0.col(i) = pdf_est.col(i) * prop_old(i);
}
catch(...){
arma::colvec err = { NA_REAL, NA_REAL, NA_REAL };
return Rcpp::List::create(Rcpp::Named("optim_err") = NA_REAL);
}
}
h_est.set_size(n, k);
for(int i = 0; i < n; ++i) {
h_est.row(i) = prob0.row(i)/(sum(prob0.row(i)) * 1.0L);
}
// M step
// update mean and variance covariance with numerical optimization
// Select the mean and variance associated with reproducibility
arma::uvec repidx = find(combos, 0);
int idx = repidx(0);
double mu_in = std::max(abs3(mu_old(idx)), bound);
double sigma_in = sigma_old(idx);
arma::colvec init_val = arma::colvec( { mu_in, log(sigma_in), rho_old } );
// Optimize using optim (for now)
arma::colvec param_new(3, arma::fill::none);
if(bound == 0.0) {
param_new = optim_rcpp(init_val, x, h_est, combos);
} else {
param_new = optim_rcpp_bound(init_val, x, h_est, combos, bound);
}
if(param_new(0) == err_test(0)) {
return Rcpp::List::create(Rcpp::Named("optim_err") = NA_REAL);
}
// transform sigma back
param_new(1) = exp(param_new(1));
prop_new.set_size(k);
if(LASSO == 1) {
// update proportion via LASSO penalty
for(int i = 0; i < k; ++i){
prop_new(i) = (sum(h_est.col(i)) - lambda * df(i)) / (n-lambda*sum(df)) * 1.0L;
if(prop_new(i) < thresh) // tolerance greater than 0 for numerical stability (Huang2013)
prop_new(i) = 0;
}
} else {
// proportion update via SCAD penalty
term = accu((SCAD_1d(prop, lambda, k) % prop_old) % (1 / (1E-06 + SCAD(prop, lambda, k))));
for(int i = 0; i < k; ++i) {
prop_new(i) = sum(h_est.col(i)) /
(n - (double_SCAD_1d(prop_old(i), lambda) / (1E-06 + double_SCAD(prop_old(i), lambda)) +
term) * lambda * df(i)) * 1.0L;
if(prop_new(i) < thresh) // tolerance greater than 0 for numerical stability (Huang2013)
prop_new(i) = 0;
}
}
prop_new = prop_new/(sum(prop_new) * 1.0L); // renormalize weights
// calculate difference between two iterations
delta = sum(abs(prop_new - prop_old));
// eliminate small clusters
if(sum(prop_new == 0) > 0) {
arma::uvec idx = find(prop_new > 0);
k = idx.size();
prop_old = trans(prop_new.elem(idx));
combos = combos.rows(idx);
df = trans(df.elem(idx));
mu_old.set_size(k,d);
mu_old = combos*param_new(0);
sigma_old.set_size(k,d);
sigma_old = abs(combos*param_new(1));
arma::uvec zeroidx2 = find(sigma_old == 0);
sigma_old.elem(zeroidx2).ones();
rho_old = param_new(2);
pdf_est = pdf_est.cols(idx);
prob0 = prob0.cols(idx);
h_est = h_est.cols(idx);
delta = 1;
}
else{
prop_old = prop_new;
mu_old = combos*param_new(0);
sigma_old = abs(combos*param_new(1));
arma::uvec zeroidx2 = find(sigma_old == 0);
sigma_old.elem(zeroidx2).ones();
rho_old = param_new(2);
}
//calculate cluster with maximum posterior probability
tag = index_max(h_est, 1);
if(delta < tol)
break;
if(k <= 1)
break;
}
// update the likelihood for output
for(int i = 0; i < k; ++i) {
arma::rowvec tmp_mu = mu_old.row(i);
tmp_sigma = cget_constr_sigma(sigma_old.row(i), rho_old, combos.row(i), d);
pdf_est.col(i) = cdmvnorm(x, tmp_mu, tmp_sigma);
prob0.col(i) = pdf_est.col(i) * prop_old(i);
}
return Rcpp::List::create(Rcpp::Named("k") = k,
Rcpp::Named("prop") = prop_old,
Rcpp::Named("mu") = mu_old,
Rcpp::Named("sigma") = sigma_old,
Rcpp::Named("rho") = rho_old,
Rcpp::Named("df") = df,
Rcpp::Named("pdf_est") = pdf_est,
Rcpp::Named("ll") = sum(log(sum(prob0,1))),
Rcpp::Named("cluster") = tag+1,
Rcpp::Named("post_prob") = h_est,
Rcpp::Named("combos") = combos);
}
// //
// // Stuff for the less constrained (constr0) penalized Gaussian mixture model
// //
//
// // Bind diagonals from covariances into one matrix (for use by optim)
// // [[Rcpp::export]]
// arma::mat bind_diags(arma::cube Sigma_in) {
// int n = Sigma_in.n_slices;
// arma::mat diagbind(n, 2, arma::fill::none);
// for(int i = 0; i < n; ++i) {
// diagbind.row(i) = Sigma_in.slice(i).diag().t();
// }
// return diagbind;
// }
//
// // Bind off-diagonals from covariances into one matrix (for use by optim)
// // [[Rcpp::export]]
// arma::colvec bind_offdiags(arma::cube Sigma_in) {
// arma::colvec rhobind = Sigma_in.tube(1,0);
// return rhobind;
// }
//
// // get vector of association-related variances for optim input
// // [[Rcpp::export]]
// arma::colvec get_sigma_optim(arma::mat diagbind, arma::mat combos) {
// arma::uvec neg = find(combos == -1);
// arma::uvec pos = find(combos == 1);
// arma::colvec sig_out;
//
// if(neg.n_rows > 0 & pos.n_rows > 0){
// sig_out = { diagbind(neg(0)), diagbind(pos(0)) };
// } else if(neg.n_rows > 0 & pos.n_rows == 0){
// sig_out = { diagbind(neg(0)) };
// } else if(neg.n_rows == 0 & pos.n_rows > 0){
// sig_out = { diagbind(pos(0)) };
// }
// return sig_out;
// }
//
// // get vector of association-related means for optim input
// // [[Rcpp::export]]
// arma::colvec get_mu_optim(arma::mat mu_in, arma::mat combos) {
// arma::uvec neg = find(combos == -1);
// arma::uvec pos = find(combos == 1);
// arma::colvec mu_out;
//
// if(neg.n_rows > 0 & pos.n_rows > 0){
// mu_out = { mu_in(neg(0)), mu_in(pos(0)) };
// } else if(neg.n_rows > 0 & pos.n_rows == 0){
// mu_out = { mu_in(neg(0)) };
// } else if(neg.n_rows == 0 & pos.n_rows > 0){
// mu_out = { mu_in(pos(0)) };
// }
// return mu_out;
// }
//
// // get rho for optim
// // [[Rcpp::export]]
// arma::colvec get_rho_optim(arma::colvec rhobind, arma::mat combos) {
// int n = combos.n_rows;
// int len = 0;
// arma::colvec rho_out(3);
//
// arma::colvec twoneg = { -1, -1 };
// arma::colvec twopos = { 1, 1 };
// arma::colvec cross1 = { -1, 1 };
// arma::colvec cross2 = { 1, -1 };
//
// for(int i = 0; i < n; ++i){
// if(combos(i,0) == twoneg(0) & combos(i,1) == twoneg(1)) {
// rho_out(len) = rhobind(i);
// ++len;
// break;
// }
// }
//
// for(int i = 0; i < n; ++i){
// if((combos(i,0) == cross1(0) & combos(i,1) == cross1(1)) ||
// (combos(i,0) == cross2(0) & combos(i,1) == cross2(1))){
// rho_out(len) = rhobind(i);
// ++len;
// break;
// }
// }
//
// for(int i = 0; i < n; ++i){
// if(combos(i,0) == twopos(0) & combos(i,1) == twopos(1)){
// rho_out(len) = rhobind(i);
// ++len;
// break;
// }
// }
// return rho_out.head(len);
// }
//
// // objective function to be optimized
// // [[Rcpp::export]]
// double func_to_optim0(const arma::colvec& init_val,
// const arma::mat& x,
// const arma::mat& h_est,
// const arma::mat& combos,
// const int& a, const int& b, const int& c,
// const arma::uvec& negidx) {
// arma::colvec mu(a);
// arma::colvec sigma(b);
// arma::colvec rho(c);
//
// mu.insert_rows(0, exp(init_val.subvec(0,a-1)));
// mu.elem(negidx) = -mu.elem(negidx);
// sigma.insert_rows(0, exp(init_val.subvec(a,a+b-1)));
// rho.insert_rows(0, init_val.subvec(a+b, a+b+c-1));
// for(int i = 0; i < c; ++i){
// rho(i) = trans_rho_inv(rho(i));
// }
//
// int n = x.n_rows;
// int d = x.n_cols;
// int k = h_est.n_cols;
// double nll;
//
// // get appropriate mean vector and covariance matrix to pass to cdmvnorm
// arma::mat tmp_sigma(d, d, arma::fill::zeros);
// arma::rowvec tmp_mu(d, arma::fill::zeros);
// arma::mat pdf_est(n, k, arma::fill::none);
//
// for(int i = 0; i < k; ++i) {
// for(int j = 0; j < d; ++j){
// if(combos(i,j) == -1){
// tmp_mu(j) = mu(0);
// tmp_sigma(j,j) = sigma(0);
// } else if(combos(i,j) == 0){
// tmp_sigma(j,j) = 1;
// } else{
// tmp_mu(j) = mu(a-1);
// tmp_sigma(j,j) = sigma(b-1);
// }
// }
//
// if(combos(i,0) == -1 & combos(i,1) == -1) {
// tmp_sigma(0,1) = rho(0);
// tmp_sigma(1,0) = rho(0);
// } else if(combos(i,0) == 1 & combos(i,1) == 1){
// tmp_sigma(0,1) = rho(c-1);
// tmp_sigma(1,0) = rho(c-1);
// } else if((combos(i,0) == -1 & combos(i,1) == 1) ||
// (combos(i,0) == 1 & combos(i,1) == -1)){
// if(rho(0) < 0){
// tmp_sigma(0,1) = rho(0);
// tmp_sigma(1,0) = rho(0);
// } else if(rho(1) < 0){
// tmp_sigma(0,1) = rho(1);
// tmp_sigma(1,0) = rho(1);
// } else{
// tmp_sigma(0,1) = rho(2);
// tmp_sigma(1,0) = rho(2);
// }
// }
// pdf_est.col(i) = cdmvnorm(x, tmp_mu, tmp_sigma);
// }
// nll = -accu(h_est % log(pdf_est));
// return nll;
// }
//
// // optimize objective function using 'optim' is R-package 'stats'
// // [[Rcpp::export]]
// arma::vec optim0_rcpp(const arma::vec& init_val,
// arma::mat& x,
// arma::mat& h_est,
// arma::mat& combos,
// int& a, int& b, int& c,
// arma::uvec& negidx){
//
// Rcpp::Environment stats("package:stats");
// Rcpp::Function optim = stats["optim"];
//
// Rcpp::List opt = optim(Rcpp::_["par"] = init_val,
// Rcpp::_["fn"] = Rcpp::InternalFunction(&func_to_optim0),
// Rcpp::_["method"] = "Nelder-Mead",
// Rcpp::_["x"] = x,
// Rcpp::_["h_est"] = h_est,
// Rcpp::_["combos"] = combos,
// Rcpp::_["a"] = a,
// Rcpp::_["b"] = b,
// Rcpp::_["c"] = c,
// Rcpp::_["negidx"] = negidx);
// arma::vec mles = Rcpp::as<arma::vec>(opt["par"]);
//
// return mles;
// }
//
// // estimation and model selection of constrained penalized GMM
// // [[Rcpp::export]]
// Rcpp::List cfconstr0_pGMM(arma::mat& x,
// arma::rowvec prop,
// arma::mat mu,
// arma::cube Sigma,
// arma::mat combos,
// int k,
// arma::rowvec df,
// int lambda,
// int citermax,
// double tol) {
//
// const int n = x.n_rows;
// const int d = x.n_cols;
// double delta = 1;
// arma::rowvec prop_old = prop;
// arma::mat mu_old = mu;
// arma::cube Sigma_old = Sigma;
// arma::uvec tag(n, arma::fill::none);
// arma::mat pdf_est(n, k, arma::fill::none);
// arma::mat prob0(n, k, arma::fill::none);
// arma::mat tmp_Sigma(d,d,arma::fill::none);
// arma::mat h_est(n, k, arma::fill::none);
// arma::colvec init_val;
// arma::colvec param_new;
// arma::rowvec tmp_mu(d, arma::fill::none);
// arma::rowvec prop_new;
// double thresh = 1E-03;
//
// for(int step = 0; step < citermax; ++step) {
// // E step
// for(int i = 0; i < k; ++i) {
// tmp_mu = mu_old.row(i);
// tmp_Sigma = Sigma_old.slice(i);
//
// pdf_est.col(i) = cdmvnorm(x, tmp_mu, tmp_Sigma);
// prob0.col(i) = pdf_est.col(i) * prop_old(i);
// }
//
// h_est.set_size(n, k);
// for(int i = 0; i < n; ++i) {
// h_est.row(i) = prob0.row(i)/(sum(prob0.row(i)) * 1.0L);
// }
//
// // M step
// // update mean and variance covariance with numerical optimization
// arma::colvec sgn_mu_in = get_mu_optim(mu_old, combos);
// arma::uvec negidx = find(sgn_mu_in < 0);
// arma::colvec sigma_in = get_sigma_optim(bind_diags(Sigma_old), combos);
// arma::colvec rho_in = get_rho_optim(bind_offdiags(Sigma_old), combos);
// int a = sgn_mu_in.n_rows;
// int b = sigma_in.n_rows;
// int c = rho_in.n_rows;
//
// for(int i = 0; i < c; ++i){
// rho_in(i) = trans_rho(rho_in(i));
// }
//
// init_val.set_size(a+b+c);
// init_val.subvec(0,a-1) = log(abs(sgn_mu_in));
// init_val.subvec(a,a+b-1) = log(sigma_in);
// init_val.subvec(a+b, a+b+c-1) = rho_in;
//
// // Optimize using optim
// param_new.copy_size(init_val);
// param_new = optim0_rcpp(init_val, x, h_est, combos, a, b, c, negidx);
//
// // Transform parameters back
// param_new.subvec(0,a-1) = exp(param_new.subvec(0,a-1));
// param_new.elem(negidx) = -param_new.elem(negidx);
// param_new.subvec(a,a+b-1) = exp(param_new.subvec(a,a+b-1));
// for(int i = 0; i < c; ++i){
// param_new(a+b+i) = trans_rho_inv(param_new(a+b+i));
// }
//
// // Make Sigma cube, mu matrix again
// for(int i = 0; i < k; ++i) {
// for(int j = 0; j < d; ++j){
// if(combos(i,j) == -1){
// mu_old(i,j) = param_new(0);
// Sigma_old(j,j,i) = param_new(a);
// } else if(combos(i,j) == 0){
// mu_old(i,j) = 0;
// Sigma_old(j,j,i) = 1;
// } else{
// mu_old(i,j) = param_new(a-1);
// Sigma_old(j,j,i) = param_new(a+b-1);
// }
// }
// if(combos(i,0) == -1 & combos(i,1) == -1) {
// Sigma_old(0,1,i) = param_new(a+b);
// Sigma_old(1,0,i) = param_new(a+b);
// } else if(combos(i,0) == 1 & combos(i,1) == 1){
// Sigma_old(0,1,i) = param_new(a+b+c-1);
// Sigma_old(1,0,i) = param_new(a+b+c-1);
// } else if((combos(i,0) == -1 & combos(i,1) == 1) ||
// (combos(i,0) == 1 & combos(i,1) == -1)){
// if(param_new(a+b) < 0){
// Sigma_old(0,1,i) = param_new(a+b);
// Sigma_old(1,0,i) = param_new(a+b);
// } else if(param_new(a+b+1) < 0){
// Sigma_old(0,1,i) = param_new(a+b+1);
// Sigma_old(1,0,i) = param_new(a+b+1);
// } else{
// Sigma_old(0,1,i) = param_new(a+b+c-1);
// Sigma_old(1,0,i) = param_new(a+b+c-1);
// }
// }
// }
//
// // update proportion
// prop_new.set_size(k);
// for(int i = 0; i < k; ++i){
// prop_new(i) = (sum(h_est.col(i)) - lambda * df(i)) / (n-lambda*sum(df)) * 1.0L;
// if(prop_new(i) < thresh) // tolerance greater than 0 for numerical stability (Huang2013)
// prop_new(i) = 0;
// }
// prop_new = prop_new/(sum(prop_new) * 1.0L);
//
// // calculate difference between two iterations
// delta = sum(abs(prop_new - prop_old));
//
// // eliminate small clusters
// if(sum(prop_new == 0) > 0) {
// arma::uvec idx = find(prop_new > 0);
// k = idx.size();
// prop_old = trans(prop_new.elem(idx));
// combos = combos.rows(idx);
// df = trans(df.elem(idx));
//
// mu_old = mu_old.rows(idx);
// Sigma_old = choose_slice(Sigma_old, idx, d, k);
//
// pdf_est = pdf_est.cols(idx);
// prob0 = prob0.cols(idx);
// h_est = h_est.cols(idx);
// delta = 1;
// }
// else{
// prop_old = prop_new;
// }
//
// //calculate cluster with maximum posterior probability
// tag = index_max(h_est, 1);
//
// if(delta < tol)
// break;
// if(k <= 1)
// break;
// }
//
// // update the likelihood for output
// for(int i = 0; i < k; ++i) {
// arma::rowvec tmp_mu = mu_old.row(i);
// tmp_Sigma = Sigma_old.slice(i);
// pdf_est.col(i) = cdmvnorm(x, tmp_mu, tmp_Sigma);
// prob0.col(i) = pdf_est.col(i) * prop_old(i);
// }
//
// return Rcpp::List::create(Rcpp::Named("k") = k,
// Rcpp::Named("prop") = prop_old,
// Rcpp::Named("mu") = mu_old,
// Rcpp::Named("Sigma") = Sigma_old,
// Rcpp::Named("df") = df,
// Rcpp::Named("pdf_est") = pdf_est,
// Rcpp::Named("ll") = sum(log(sum(prob0,1))),
// Rcpp::Named("cluster") = tag+1,
// Rcpp::Named("post_prob") = h_est);
// }
// Compute density of univariate normal
// [[Rcpp::export]]
arma::colvec cduvnorm(arma::colvec x, double mu, double sigma){
arma::colvec mdist = ((x-mu) % (x-mu))/(sigma);
const double log2pi = std::log(2.0 * M_PI);
double logcoef = -(log2pi + log(sigma));
arma::colvec logretval = (logcoef - mdist)/2;
return exp(logretval);
}
// computing marginal likelihood of constrained gmm (for copula likelihood)
// [[Rcpp::export]]
double cmarg_ll_gmm(arma::mat& z,
arma::mat mu,
arma::mat sigma,
arma::rowvec prop,
arma::mat combos,
int k) {
const int n = z.n_rows;
const int d = z.n_cols;
arma::mat mll(n,d,arma::fill::none);
arma::mat pdf_est(n,k,arma::fill::none);
double tmp_sigma;
double tmp_mu;
for(int i = 0; i < d; ++i){
for(int j = 0; j < k; ++j) {
tmp_mu = mu(j,i);
tmp_sigma = sigma(j,i);
pdf_est.col(j) = prop(j) * cduvnorm(z.col(i), tmp_mu, tmp_sigma);
}
mll.col(i) = log(sum(pdf_est,1));
}
return accu(mll);
}
// computing joint likelihood of constrained gmm (for copula likelihood)
// [[Rcpp::export]]
double cll_gmm(arma::mat& z,
arma::mat mu,
arma::mat sigma,
double rho,
arma::rowvec prop,
arma::mat combos,
int k) {
const int n = z.n_rows;
const int d = z.n_cols;
arma::rowvec tmp_mu(d, arma::fill::none);
arma::mat tmp_sigma(d, d, arma::fill::none);
arma::mat pdf_est(n,k,arma::fill::none);
for(int i = 0; i < k; ++i) {
tmp_mu = mu.row(i);
tmp_sigma = cget_constr_sigma(sigma.row(i), rho, combos.row(i), d);
pdf_est.col(i) = prop(i) * cdmvnorm(z, tmp_mu, tmp_sigma);
}
return accu(log(sum(pdf_est,1)));
}
// // computing marginal likelihood of LESS constrained (0) gmm (for copula likelihood)
// // [[Rcpp::export]]
// double cmarg0_ll_gmm(arma::mat& z,
// arma::mat mu,
// arma::cube Sigma,
// arma::rowvec prop,
// int k) {
// const int n = z.n_rows;
// const int d = z.n_cols;
// arma::mat mll(n,d,arma::fill::none);
// arma::mat pdf_est(n,k,arma::fill::none);
// double tmp_sigma;
// double tmp_mu;
// arma::mat tmp_Sigma(d,d,arma::fill::none);
//
// for(int i = 0; i < d; ++i){
// for(int j = 0; j < k; ++j) {
// tmp_mu = mu(j,i);
// tmp_Sigma = Sigma.slice(j);
// tmp_sigma = tmp_Sigma(i,i);
// pdf_est.col(j) = prop(j) * cduvnorm(z.col(i), tmp_mu, tmp_sigma);
// }
// mll.col(i) = log(sum(pdf_est,1));
// }
// return accu(mll);
// }
//
// // computing joint likelihood of LESS xconstrained (0) gmm (for copula likelihood)
// // [[Rcpp::export]]
// double cll0_gmm(arma::mat& z,
// arma::mat mu,
// arma::cube Sigma,
// arma::rowvec prop,
// int k) {
// const int n = z.n_rows;
// const int d = z.n_cols;
// arma::rowvec tmp_mu(d, arma::fill::none);
// arma::mat tmp_sigma(d, d, arma::fill::none);
// arma::mat pdf_est(n,k,arma::fill::none);
//
// for(int i = 0; i < k; ++i) {
// tmp_mu = mu.row(i);
// tmp_sigma = Sigma.slice(i);
// pdf_est.col(i) = prop(i) * cdmvnorm(z, tmp_mu, tmp_sigma);
// }
// return accu(log(sum(pdf_est,1)));
// }
//
//
| cpp |
<gh_stars>1-10
package amery.rxJava;
import junit.framework.Assert;
import org.junit.Test;
import rx.Observable;
import rx.Subscriber;
/**
* Created by ahan on 14/02/2017.
*/
public class Simlify {
@Test
public void main() {
Subscriber<String> mySubscriber = new Subscriber<String>() {
@Override
public void onNext(String s) {
System.out.println(s);
}
@Override
public void onCompleted() {
}
@Override
public void onError(Throwable e) {
}
};
Observable<String> myObservable1 = Observable.just("Hello, world!");
myObservable1.subscribe(mySubscriber);
Assert.assertTrue(1 == 1);
}
}
| java |
<filename>sparkJobDefinition/job definition sample.json
{
"name": "job definition sample",
"properties": {
"targetBigDataPool": {
"referenceName": "ws1sparkpool1",
"type": "BigDataPoolReference"
},
"requiredSparkVersion": "2.4",
"language": "python",
"jobProperties": {
"name": "job definition sample",
"file": "abfss://<EMAIL>@<EMAIL>.net/spark_job/wordcount.py",
"conf": {
"spark.dynamicAllocation.enabled": "true",
"spark.dynamicAllocation.minExecutors": "1",
"spark.dynamicAllocation.maxExecutors": "2",
"spark.autotune.trackingId": "cbcbf702-c030-47af-943e-a83a56edd56d"
},
"args": [
"abfss://sandbox@ads3tf6pxfizs3rgpoc.dfs.core.windows.net/spark_job/shakespeare.txt",
"abfss://sandbox@ads<EMAIL>.windows.net/spark_job/result"
],
"jars": [],
"files": [],
"driverMemory": "56g",
"driverCores": 8,
"executorMemory": "56g",
"executorCores": 8,
"numExecutors": 1
}
}
} | json |
The Statue of Zeus. BY:ALIA A.T.R. Fast Facts. LOCATION. Olympia,Greece. Date Built. 440 B.C - 450 B.C. Description. 30ft. high wooden statue of Greek god, Zeus covered with gold and ivory. Did You Know?.
The Statue of Zeus BY:ALIA A.T.R.
Fast Facts LOCATION Olympia,Greece Date Built 440 B.C - 450 B.C Description 30ft. high wooden statue of Greek god, Zeus covered with gold and ivory.
Did You Know? The statue of Zeuswas considered to be the grandest piece by Phidias and might have been the most magnificent of the seven wonders. Due to to incorrect proportions dealing with Zeus’s seating, it looked as though if he were able to stand up, he would unroof the entire temple. That idea inspired many poets and historians. Also, by filling up much of the temple, it made the statue look even larger, making Zeus seem much more powerful. Because Olympian weather was so damp, the statue had to be treated with oil to prevent the ivory from cracking. This oil was kept in a small pool in the floor of the temple.
HISTORY This statue, the statue of Zeus, has quite an amazing history behind it. Beginning with who built it and when it was unfortunately destroyed.
HISTORY 2 It was designed by an architect that goes by the name of Libon,. It was built to to show honor and appreciation to Zeus for the Olympics. But as time passed, under the growing city of Greece, the statue became rather dull, and modifications were desperately needed. The solution was the Athenian sculptor, Pheidias. He was chosen for this so-called sacred task, and with his modifications, the statue was dazzling. In fact it was so dazzling, that the Roman emperor Caligula attempted to steal it by transporting it to Rome. However, his attempt failed when the poorly made scaffolding collapsed, leaving the statue where it was destined to be.
HISTORY 3 Furthermore, the statue of Zeus survived earthquakes, floods, and landslides. Then the statue was transported by very wealthy Greeks to a palace in Constantinople. There, it remained until a terrible fire in 462 A.D. melted this Greek beauty. Today the only remains are the rocks, debris, fallen columns, and the foundation. Even though the temple is gone, the people that saw it never forgot its grand design or the elegance in every drop of gold and ivory.
| english |
<gh_stars>100-1000
// include/srp-phat.cc
// wujian@18.5.29
// Copyright 2018 <NAME>
// See ../../COPYING for clarification regarding multiple authors
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// THIS CODE IS PROVIDED *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
// WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,
// MERCHANTABLITY OR NON-INFRINGEMENT.
// See the Apache 2 License for the specific language governing permissions and
// limitations under the License.
#include "include/srp-phat.h"
namespace kaldi {
// GCC(x, y) = conj(GCC(y, x))
void SrpPhatComputor::ComputeGccPhat(const CMatrixBase<BaseFloat> &L,
const CMatrixBase<BaseFloat> &R,
BaseFloat dist,
CMatrixBase<BaseFloat> *gcc_phat) {
KALDI_ASSERT(dist > 0);
BaseFloat max_tdoa = dist / opts_.sound_speed;
BaseFloat inc_tdoa = max_tdoa * 2 / (opts_.samp_rate - 1);
for (int32 i = 0; i < opts_.samp_rate; i++)
if (opts_.samp_tdoa)
delay_axis_(i) = (max_tdoa - inc_tdoa * i) * 2 * M_PI;
else
delay_axis_(i) =
std::cos(i * M_PI / opts_.samp_rate) * max_tdoa * 2 * M_PI;
idtft_coef_.SetZero();
idtft_coef_.AddVecVec(1, frequency_axis_, delay_axis_);
exp_idtft_coef_j_.Exp(idtft_coef_);
CMatrix<BaseFloat> cor(L);
cor.MulElements(R, kConj);
cor.DivElements(L, kNoConj, true);
cor.DivElements(R, kNoConj, true);
// gcc_phat = gcc_phat + cor * coef
gcc_phat->AddMatMat(1, 0, cor, kNoTrans, exp_idtft_coef_j_, kNoTrans, 1, 0);
}
void SrpPhatComputor::Compute(const CMatrixBase<BaseFloat> &stft,
Matrix<BaseFloat> *spectra) {
std::vector<BaseFloat> &topo = opts_.array_topo;
int32 num_chs = topo.size();
KALDI_ASSERT(num_chs >= 2);
MatrixIndexT num_frames = stft.NumRows() / num_chs, num_bins = stft.NumCols();
CMatrix<BaseFloat> coef(num_bins, delay_axis_.Dim());
CMatrix<BaseFloat> srp_phat(num_frames, delay_axis_.Dim());
spectra->Resize(num_frames, delay_axis_.Dim());
// GCC(x, y) = conj(GCC(y, x))
// GCC_PHAT(x, x) = I
for (int32 i = 0; i < num_chs; i++) {
for (int32 j = i + 1; j < num_chs; j++) {
ComputeGccPhat(stft.RowRange(i * num_frames, num_frames),
stft.RowRange(j * num_frames, num_frames),
std::abs(topo[j] - topo[i]), &srp_phat);
}
}
if (opts_.smooth_context) Smooth(&srp_phat);
srp_phat.Part(spectra, kReal);
spectra->ApplyFloor(0);
}
void SrpPhatComputor::Smooth(CMatrix<BaseFloat> *spectra) {
int32 context = opts_.smooth_context;
CMatrix<BaseFloat> smooth_spectra(spectra->NumRows(), spectra->NumCols());
for (int32 t = 0; t < spectra->NumRows(); t++) {
for (int32 c = -context; c <= context; c++) {
int32 index = std::min(std::max(t + c, 0), spectra->NumRows() - 1);
SubCVector<BaseFloat> ctx(*spectra, index);
smooth_spectra.Row(t).AddVec(1, 0, ctx);
}
}
smooth_spectra.Scale(1.0 / (2 * context + 1), 0);
spectra->CopyFromMat(smooth_spectra);
}
} // kaldi
| cpp |
Do you like tribal tattoos and want to add fire to it? Then there are amazing tribal fire tattoo ideas that you would love to have.
Fire tattoos have been around for centuries.
Fire tattoo ideas are quite versatile and as a result, tattoo artists use a ton of different styles to create flame tattoos. One such popular style is a tribal fire tattoo, which incorporates tribal elements and designs.
Compared to regular flame tattoos, tribal flames have a much bolder appearance and are usually all black. However, contemporary tattoo artists are experimenting with tribal fire tattoo designs and creating brightly colored designs. There are also tribal fire tattoos that incorporate other meaningful symbols and elements. For example, a tribal fire phoenix tattoo or a tribal fire dragon tattoo are both wonderful options if you want to display strong meanings on your skin. Also, when it comes to tribal flame tattoos, small to large, all shapes and sizes are equally attractive.
Keep reading to find more tribal fire tattoo designs and ideas that will surely make you fall in love with the fire sign!
People don’t usually get inked on their elbow let alone a tribal fire sign. Therefore, with a tattoo like this you will definitely stand out in the crowd. As you can see, here the tribal flames sign has been inked quite boldly and fully colored. This is a fairly traditional tribal fire tattoo. Tribal flames are a symbol of a fiery personality, so this artwork definitely justifies it.
If you love colors and want a bit of vibrancy on your skin, then this tribal fire tattoo is definitely the best option for you. Here, tribal flames are inked with shades of red and dark purple. The gradient coloring makes the pattern all the more appealing. Such a tribal flame tattoo can be inked anywhere on your body. You can also ask your tattoo artist to use two or three different shades to create this piece.
Compared to the previous design, this tribal flame tattoo has a much bigger gradient effect. Here, as you can see, three shades have been used which blend perfectly with each other. Creating such a tattoo requires significant expertise, so be sure to visit an experienced tattoo artist. If you want to flaunt this art anytime, the side of your neck is a wonderful place to get inked with this design.
Horses are said to symbolize freedom and strength. Combining this with tribal flames only results in a strong and meaningful tattoo that will make you the center of attention. Here, the tribal fire patterns seem to come out of the horse’s body in a flawless way. The horse appears to have its forelimbs raised which further denotes the power of the tattoo. In addition, the gradient coloring is quite spectacular.
A small flame tattoo can be just as good as a big one if done right. Here, a traditional tribal fire has been inked on the wrist. The shape and size of this tattoo makes it perfect for the wrist area, as it seems to fit there. You can also choose to get this design in a horizontal direction so that it looks like a bracelet, making it a permanent fixture on your skin.
Red and yellow are the colors most often used to represent the fire sign. So, this tribal tattoo becomes quite traditional due to its coloring. However, the way the flames have been inked here gives it a modern twist. The black shading and bold outline around the fire sign further enhances the visual appeal of this tribal tattoo. The fire tattoo can be made unique, and this tribal fire is the perfect example.
It’s no secret that tigers are one of the most powerful creatures in existence. Thus, the tribal flames surrounding the head of a traditionally inked tiger can be used by you to bring out the ferocity and power within you. Here, the tiger has quite an aggressive expression on its face, and so, the fire signs match that perfectly. You can get such an elaborate piece inked on your chest or back as a sign of your own hidden power.
Chest tattoos will never go out of style and hence tribal fire tattoo designs for chest will remain a favorite. Here, the monochromatic tribal fire tattoo has the perfect combination of black and gray shades. The tattoo covers the shoulder and extends into the chest, making it quite elaborate and almost accessory-like. The best part of such a tattoo is that it can be easily hidden.
Dotwork tattoos are a sign of the artist’s artistic abilities, as these tattoos require a lot of experience, patience, and most importantly, an artistic vision. In this tribal fire tattoo, the flames have been created using tiny little dots. Interestingly, some of the dots are dark, while others are light. This creates the perfect balance and interplay of dark and light shades, which further enhances the beauty of this sign. Such a tattoo would look great on the arm or leg.
The skull sign is quite common. So if you want to stand out with your skull sign, the best idea would be to add some tribal fire to it. Here, the skull has been designed in a traditional style, and the flames surround the skull. Coloring the tattoo makes it look pretty cool, which is the exact opposite of what a skull sign and a fire sign mean. As pictured above, such a tattoo is ideal for the upper arm, as it requires a large canvas to get inked properly.
Disclaimer: Curated and re-published here. We do not claim anything as we translated and re-published using google translator. All images and Tattoo Design ideas shared only for information purpose.
| english |
London: In Wimbledon Tennis, top seed Ashleigh Barty will face eighth seed Karolina Pliskova in the women's singles final in London tomorrow.
yesterday. The 25-year-old will now aim to emulate Evonne Goolagong who won the second of her two Wimbledon crowns in 1980.
Czech Republic's Karolina Pliskova defeated Belarus' Aryna Sabalenka 5-7, 6-4, 6-4 in the second semifinal. | english |
use crate::card;
use crate::card::Card;
// The largest column would be one that happens to start with a king
// and then has all the other ranks laid on top of it down to a deuce.
// It's impossible to add an ace, because exposed aces are auto-moved
// to the foundation. So we subtract two from N_RANKS because the
// king has to already be in the starting column and we can't put an
// ace on it.
const STARTING_DEPTH: usize = 6;
pub const MAX_COLUMN_SIZE: usize = STARTING_DEPTH + card::N_RANKS - 2;
#[derive(Eq, PartialEq, Debug, Clone, Copy)]
pub struct Column {
pub cards: [Option<Card>; MAX_COLUMN_SIZE],
}
impl Column {
pub fn new() -> Self {
Self {
cards: [None; MAX_COLUMN_SIZE],
}
}
pub fn top_card_and_index(&self) -> (Option<Card>, usize) {
let mut index = 0;
while index < MAX_COLUMN_SIZE - 1 && self.cards[index + 1].is_some() {
index += 1
}
(self.cards[index], index)
}
}
use std::cmp::Ordering;
impl Ord for Column {
fn cmp(&self, other: &Self) -> Ordering {
if self.cards < other.cards {
Ordering::Less
} else if self.cards > other.cards {
Ordering::Greater
} else {
Ordering::Equal
}
}
}
impl PartialOrd for Column {
fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
self.cards.partial_cmp(&other.cards)
}
}
| rust |
{
"source": "./src",
"destination": "./docs",
"includes": ["\\.(js|es6|jsx)$"],
"excludes": ["\\.config\\.(js|es6)$", "classes/"],
"access": ["public", "protected"],
"autoPrivate": true,
"unexportIdentifier": false,
"undocumentIdentifier": false,
"builtinExternal": true,
"index": "./README.md",
"package": "./package.json",
"coverage": true,
"includeSource": true,
"title": "AVG.js",
"styles": null,
"scripts": null,
"plugins": [],
"lint": true,
"experimentalProposal": {
"classProperties": true,
"objectRestSpread": true,
"decorators": true,
"doExpressions": true,
"functionBind": true,
"asyncGenerators": true,
"exportExtensions": true,
"dynamicImport": true
}
} | json |
<reponame>TakayukiHoshi1984/DeviceConnect-Old
/*
NoteNameTableTest.java
Copyright (c) 2020 NTT DOCOMO,INC.
Released under the MIT license
http://opensource.org/licenses/mit-license.php
*/
package org.deviceconnect.android.deviceplugin.midi;
import org.junit.Assert;
import org.junit.Test;
/**
* {@link NoteNameTable} の単体テスト.
*/
public class NoteNameTableTest {
@Test
public void testNumberToNameSuccess() {
for (int i = 0; i < 128; i++) {
String name = NoteNameTable.numberToName(i);
Assert.assertNotNull(name);
System.out.println(i + " -> " + name);
}
}
@Test
public void testNumberToNameErrorTooSmallNumber() {
String name = NoteNameTable.numberToName(-1);
Assert.assertNull(name);
}
@Test
public void testNumberToNameErrorTooBigNumber() {
String name = NoteNameTable.numberToName(129);
Assert.assertNull(name);
}
@Test
public void testNameToNumberSuccess() {
for (int i = 0; i < 128; i++) {
String name = NoteNameTable.numberToName(i);
Integer number = NoteNameTable.nameToNumber(name);
Assert.assertNotNull(number);
Assert.assertEquals(i, number.intValue());
System.out.println(name + " -> " + number);
}
}
@Test
public void testNumberToNameErrorUnknownName() {
Integer number = NoteNameTable.nameToNumber("");
Assert.assertNull(number);
}
}
| java |
<filename>src/main/java/com/sageone/sample/auth/NonceFactory.java
package com.sageone.sample.auth;
import java.math.BigInteger;
import java.security.SecureRandom;
public class NonceFactory {
final private SecureRandom random;
public NonceFactory() {
this.random = new SecureRandom();
}
public String getNonce() {
return new BigInteger(160, random).toString(32);
}
}
| java |
<filename>concurrent-series/src/com/luren/day09/DaemonDemo03.java
package com.luren.day09;
import java.util.concurrent.TimeUnit;
/**
* 线程 daemon 的默认值 为父线程的 daemon
*/
public class DaemonDemo03 {
public static void main(String[] args) throws InterruptedException {
System.out.println(Thread.currentThread().getName() + ".daemon：" + Thread.currentThread().isDaemon());
Trd t1 = new Trd();
t1.setName("thread-1");
t1.start();
Thread t2 = new Thread(){
@Override
public void run() {
System.out.println(this.getName() + ".daemon：" + this.isDaemon());
Trd t3 = new Trd();
t3.setName("thread-3");
t3.start();
}
};
t2.setName("thread-2");
t2.setDaemon(true);
t2.start();
TimeUnit.SECONDS.sleep(2);
}
private static class Trd extends Thread {
@Override
public void run() {
System.out.println(this.getName() + ".daemon：" + this.isDaemon());
}
}
}
| java |
<filename>source_code_app/screens/LicenseInfo.js
import React, {useState, Icon} from 'react';
import { ExpoConfigView } from '@expo/samples';
import { Switch, Platform, StatusBar, StyleSheet, View, ScrollView, Text, Button } from 'react-native';
import { HeaderBackButton } from "react-navigation-stack";
import { Appearance, AppearanceProvider, useColorScheme } from 'react-native-appearance';
const styles = StyleSheet.create(require('../stylesheet'));
export default class LicenseScreen extends React.Component {
constructor(props) {
super(props);
}
render() {
return (
<ScrollView style={styles.container,{textAlign: 'left'}}>
<Text style={styles.licenseText}>
<Text style={{textAlign: 'center'}}>
MIT License{"\n"}
Copyright © 2019 <NAME>, <NAME>
</Text>
{"\n\n"}
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
{"\n\n"}
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
{"\n\n"}
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
</Text>
</ScrollView>
);
}
}
LicenseScreen.navigationOptions = ({ navigation }) => {
return {
title: 'License',
//https://www.reddit.com/r/furry_irl
header: null,
};
}
/*headerLeft: (
<HeaderBackButton
onPress={() => navigation.navigate('More')}
title="Back"
/>
),
*/ | javascript |
<gh_stars>0
---
# Documentation: https://wowchemy.com/docs/managing-content/
title: Maternal Cannibalism in Two Populations of Wild Chimpanzees
subtitle: ''
summary: ''
authors:
- <NAME>
- <NAME>
- <NAME>
- <NAME>
- <NAME>
- <NAME>
- <NAME>
- <NAME>
- <NAME>
- <NAME>
tags:
- '"Animals"'
- '"Animals; Newborn"'
- '"Behavior; Animal"'
- '"Cannibalism"'
- '"Chimpanzee"'
- "\"Cote d'Ivoire\""
- '"Female"'
- '"Male"'
- '"Maternal Behavior"'
- '"Maternal cannibalism"'
- '"Pan troglodytes"'
- '"Parental investment"'
- '"Uganda"'
categories: []
date: '2020-03-01'
lastmod: 2021-04-20T10:49:05+02:00
featured: false
draft: false
# Featured image
# To use, add an image named `featured.jpg/png` to your page's folder.
# Focal points: Smart, Center, TopLeft, Top, TopRight, Left, Right, BottomLeft, Bottom, BottomRight.
image:
caption: ''
focal_point: ''
preview_only: false
# Projects (optional).
# Associate this post with one or more of your projects.
# Simply enter your project's folder or file name without extension.
# E.g. `projects = ["internal-project"]` references `content/project/deep-learning/index.md`.
# Otherwise, set `projects = []`.
projects: []
publishDate: '2021-04-20T08:49:04.908193Z'
publication_types:
- '2'
abstract: Maternal cannibalism has been reported in several animal taxa, prompting
speculations that the behavior may be part of an evolved strategy. In chimpanzees,
however, maternal cannibalism has been conspicuously absent, despite high levels
of infant mortality and reports of non-maternal cannibalism. The typical response
of chimpanzee mothers is to abandon their deceased infant, sometimes after prolonged
periods of carrying and grooming the corpse. Here, we report two anomalous observations
of maternal cannibalism in communities of wild chimpanzees in Uganda and Ivory Coast
and discuss the evolutionary implications. Both infants likely died under different
circumstances; one apparently as a result of premature birth, the other possibly
as a result of infanticide. In both cases, the mothers consumed parts of the corpse
and participated in meat sharing with other group members. Neither female presented
any apparent signs of ill health before or after the events. We concluded that,
in both cases, cannibalizing the infant was unlikely due to health-related issues
by the mothers. We discuss these observations against a background of chimpanzee
mothers consistently refraining from maternal cannibalism, despite ample opportunities
and nutritional advantages. We conclude that maternal cannibalism is extremely rare
in this primate, likely due to early and strong mother-offspring bond formation,
which may have been profoundly disrupted in the current cases.
publication: ''
doi: 10.1007/s10329-019-00765-6
---
| markdown |
The Democratic Party has substantially widened its margin in party identification over the Republican Party since the last presidential election and has made notable gains in many of this year’s political battleground states.
Nearly four-in-ten voters (38%) identified themselves as Democrats in 2008 surveys by the Pew Research Center; 34% self-identified as independents; and 28% identified themselves as Republicans. These data are based on more than 28,000 interviews conducted this year by the Pew Research Center.
In 2004, the balance of party affiliation was far more closely divided: 35% of voters called themselves Democrats, 33% Republicans, and 32% independents.
The Democratic Party now holds an advantage in party affiliation in several swing states where Barack Obama and John McCain are engaged in intensive last-minute campaigning. In Virginia, the Democratic Party holds a five-point advantage over the GOP (34% to 29%); in 2004, Virginia voters were evenly divided (33% Republican, 32% Democratic). In Ohio, where the Republican Party held a two-point edge in 2004, the Democrats now have a nine-point lead (37% to 28%).
The charts below show that the Democratic Party also has increased its advantage in several “blue” states and cut into the GOP’s lead in some “red” states since the last presidential campaign.
Previous elections have seen substantial shifts in the balance of partisan affiliation over the course of the election cycle, and 2008 is no exception. With the electorate focusing intently on politics, and new leaders reshaping the images of the parties, fluctuations in party identification are not surprising. In the first half of the 2004 election cycle, Democrats held a substantial advantage in party identification, with 48% of voters either identifying as Democrats or leaning toward the party compared with 43% for the Republicans. But following the conventions, Republican identification ticked upward, and remained at parity with the Democrats through election weekend, contributing to George W. Bush’s successful reelection.
While the Democratic Party entered the 2008 election cycle with an overwhelming advantage in party identification, as in 2004 this lead narrowed substantially following the political conventions. The Democrats’ 51%-to-37% advantage in the primary season narrowed to a slimmer 49%-to-43% advantage in September. But unlike 2004’s post-convention GOP boost which lasted through Election Day, the 2008 boost was short-lived. Interviews with more than five thousand registered voters in October so far have shown the resurgence of the substantial Democratic advantage in party identification seen earlier in the year.
| english |
{"categories":["Manual","Operating Systems","Programming"],"desc":"\n","details":{"authors":"<NAME>, <NAME>, <NAME>, <NAME>, <NAME>","format":"pdf","isbn-10":"1430223618","isbn-13":"978-1430223610","pages":"1104 pages","publication date":"May 5, 2010","publisher":"Apress","size":"10.00Mb"},"img":"http://2172.16.58.3/covers/23/237a307e0c6600b7ca5d8d7a4bc6943e.jpg","link":"https://rapidhosting.info/files/9zd","title":"Learn AppleScript: The Comprehensive Guide to Scripting and Automation on Mac OS X (Learn (Apress))"} | json |
<reponame>CSBP-CPSE/rural-viewer
CSDUID,RuralUrbanFlag,CSDpop2016,Period1,Period2,Period3,Period4,Period5,Period6,Period7,Period8
2426040,Rural,1271.0,37.8,68.5,77.9,66.1,44.1,48,25.2,7.9
| json |
<gh_stars>10-100
package com.indeed.operators.rabbitmq.model.crd.rabbitmq;
import com.fasterxml.jackson.annotation.JsonCreator;
import com.fasterxml.jackson.annotation.JsonProperty;
import com.fasterxml.jackson.annotation.JsonPropertyOrder;
import com.fasterxml.jackson.databind.JsonDeserializer;
import com.fasterxml.jackson.databind.annotation.JsonDeserialize;
import io.sundr.builder.annotations.Buildable;
/**
* See https://github.com/fabric8io/kubernetes-client/tree/master/kubernetes-examples/src/main/java/io/fabric8/kubernetes/examples/crds
*/
@Buildable(
builderPackage = "io.fabric8.kubernetes.api.builder",
editableEnabled = false
)
@JsonPropertyOrder({"rabbitMQImage", "initContainerImage", "createLoadBalancer", "createNodePort", "replicas", "compute", "storage", "highWatermarkFraction"})
@JsonDeserialize(using = JsonDeserializer.None.class)
public class RabbitMQCustomResourceSpec {
private final String rabbitMQImage;
private final String initContainerImage;
private final boolean createLoadBalancer;
private final boolean createNodePort;
private final int replicas;
private final RabbitMQComputeResources computeResources;
private final RabbitMQStorageResources storageResources;
private final ClusterSpec clusterSpec;
private final boolean preserveOrphanPVCs;
@JsonCreator
public RabbitMQCustomResourceSpec(
@JsonProperty("rabbitMQImage") final String rabbitMQImage,
@JsonProperty("initContainerImage") final String initContainerImage,
@JsonProperty("createLoadBalancer") final boolean createLoadBalancer,
@JsonProperty("createNodePort") final boolean createNodePort,
@JsonProperty("replicas") final int replicas,
@JsonProperty("compute") final RabbitMQComputeResources computeResources,
@JsonProperty("storage") final RabbitMQStorageResources storageResources,
@JsonProperty("clusterSpec") final ClusterSpec clusterSpec,
@JsonProperty(value = "preserveOrphanPVCs", defaultValue = "false") final boolean preserveOrphanPVCs
) {
this.rabbitMQImage = rabbitMQImage;
this.initContainerImage = initContainerImage;
this.createLoadBalancer = createLoadBalancer;
this.createNodePort = createNodePort;
this.replicas = replicas;
this.computeResources = computeResources;
this.clusterSpec = clusterSpec;
this.storageResources = storageResources;
this.preserveOrphanPVCs = preserveOrphanPVCs;
}
public String getRabbitMQImage() {
return rabbitMQImage;
}
public String getInitContainerImage() {
return initContainerImage;
}
public boolean isCreateLoadBalancer() {
return createLoadBalancer;
}
public boolean isCreateNodePort() {
return createNodePort;
}
public int getReplicas() {
return replicas;
}
public RabbitMQComputeResources getComputeResources() {
return computeResources;
}
public RabbitMQStorageResources getStorageResources() {
return storageResources;
}
public ClusterSpec getClusterSpec() {
return clusterSpec;
}
public boolean isPreserveOrphanPVCs() {
return preserveOrphanPVCs;
}
}
| java |
ఫోరం అనేది ఒక ఆన్లైన్ చర్చా ఫోరమ్, దీనిలో యువత లేదా అనుభవజ్ఞులైన నిపుణులు కూడా తమ ప్రశ్నలను గురించి చర్చించుకుంటారు మరియు ఇతర ప్రతిభావంతులైన వ్యక్తుల నుండి వారి ప్రశ్నలకు సమాధానాలను పొందండి. ప్రశ్నలను అడగడం ద్వారా, ఇతరులకు సమాధానాలు అందించడం ద్వారా ఆన్లైన్ చర్చను ప్రారంభించవచ్చు. ఉత్తమ భాగం ఇది చాలా సులభం మరియు ఖర్చు ఉచితం.
Please answer in respect to 2 phase flow of fluid inside the heat pipe.
How to solve problem for Vibrational analysis for suspensions in Ansys workbench 16 (Answer in respect to CFD- computational fluid Analysis) ?
Please provide me contact of CFD multi-fluid analysis engineer having more than 3 years experience.
Please provide web link for downloading ANSYS 16 student version software.
In Ansys transient structural, giving displacement or velocity equivalent to adding force?
How to use .dcm file from CBCT for structural analysis in Ansys workbench?
CBCT file in .dcm format has to be used in ANSYS for analysis.
when ever we create a mesh in ansys workbench,does it create a 2d mesh or a 3d mesh? If it creates a 2d element mesh what thickness does it assume?
Hello everyone, how can I transform .cdb or .db format to .stl format in 19R1 version? Thank you for your help.
I drawn a open spline passing through three prescribed points. how to find the equation of the spline? is there any common equation?
| english |
Vir Das on Monday shared a video of himself talking about how comedians in Indian do not get slapped by people but with things ‘sedition, defamation and hurting sentiments’.
In the new video Vir says, "You come to an Indian comic and you tell us a comedian got slapped, we don't ask ‘by who? ’ we ask 'with what? '" He then adds, "Sedition, defamation, hurting sentiments. What did they get slapped with? "
Earlier this year in April, actor Priyanka Chopra attended Vir's show in Los Angeles and penned a post calling him ‘brave and inspiring’. Sharing pictures, she wrote “What a day! With Awesome friends watching an awesome friend do what he does best! @virdas you are so brave and so inspiring to me! Not to mention had me in tears laughing! ! Thx for having us! Also love having u in La @pearlthusi come back soon! @cavanaughjames are u finally moving too? Love you too @divya_jyoti. "
In 2021, Vir was in news for his monologue 'I Come From Two Indias', performed at the John F Kennedy Center in Washington. He received backlash from a section of the public for allegedly showcasing a bad image of Indians abroad. His show Vir Da was nominated in the Best Comedy category at the International Emmy Awards in 2021. | english |
A free press, at its best, is the conscience of a nation, an indispensable arbiter of truth and righteousness. When it is doing its job well, a free press unearths unpleasant truths, holds people in power accountable and champions marginalized communities.
At this remarkable juncture in Cuban history, the island would benefit enormously from a freer press.
Yet Cuban journalists remain shackled. The state press is subservient to the ruling Communist Party, which has sought for years to tightly control how Cubans get their news. Independent journalists who do critical reporting have limited reach because only the state is legally entitled to run news organizations and few people have regular, affordable access to the internet.
Nevertheless, as I contemplate the future of journalism in Cuba, I am heartened by the building blocks of a freer press that are already in place. First and foremost is the rich reservoir of talent. The Cuban journalists I have met are passionate, smart, inquisitive, and have a strong grasp of history. Their primary audience—the island’s 11 million citizens—is among the most literate and well educated in the world.
Even in the absence of a legal framework that establishes the right to gather and report news independently several are doing high-caliber and pioneering journalism. I’ve watched with particular admiration the work of the narrative journalism website El Estornudo and the immersive reporting about local issues in Periodismo de Barrio. The independent journalist Yoani Sánchez deserves recognition for the consistently high quality reporting on her website, 14ymedio, which provides readers with stories and perspectives they can’t find anywhere else.
The official press, meanwhile, too often appears stubbornly burrowed into Cold War trenches. It obfuscates far more than it clarifies. It justifies its self-censorship and a belligerent tone by pointing to its anachronistic foils, the largely irrelevant Washington-funded Radio and TV Martí. American taxpayers spend millions each year on subsidizing the Miami-based newsroom, which has had little success in building a sizeable audience on the island. The official Cuban press and Radio and TV Marti have become echo chambers that cater to ideologues on opposite ends of the political spectrum. As currently structured, neither is capable of delivering the type of transformational journalism that could help bring about the changes yearned for by most Cubans.
Achieving that kind of transformation will require clearer rules of the game. Some Cuban officials have encouraged the press to be more probing and to highlight aspects of the system that aren’t working. Those calls ring hollow without strong legal protections that establish freedom of the press as a fundamental right. They amount to little as long as there continue to be red lines about the questions the press is entitled to ask and the answers government officials are willing to provide.
The Cuban people deserve answers to numerous pressing questions. Among them: why has the government failed to implement a majority of the economic reforms Cuban leaders identified as indispensable years ago? Why does the Cuban military control large segments of the economy and how does it justify the opacity of its finances? Why, exactly, do Cubans continue to live in the digital Dark Ages at a time when the state has the technical capacity to bring millions online in a matter of months? Why don’t ordinary Cubans have more visibility on, and a say in, who will succeed President Raúl Castro when he is slated to step down in 2018? What is prompting tens of thousands of Cubans to emigrate every year?
It would be foolish to expect that substantive answers to these questions will be forthcoming anytime soon. But they would become significantly harder to ignore if more Cuban journalists were asking them. They should. If journalists employed by the state press began seeing themselves as representatives of the people, rather than the Communist Party, these vital questions would become unavoidable. I suggest this while recognizing the substantial risks that come with challenging authority in a police state. Yet, transformational journalism always requires taking risks. For the sake of their country’s future, I hope that more Cuban journalists decide to join those who have already crossed red lines.
| english |
<reponame>UNSHIB/crypto-metadata<filename>coins/c/cafeswap-token.json
{
"id": "cafeswap-token",
"symbol": "brew",
"name": "CafeSwap Token",
"platforms": {
"binance-smart-chain": "0x790be81c3ca0e53974be2688cdb954732c9862e1"
},
"hashing_algorithm": null,
"categories": [],
"description": {
"en": "BREW is native token on cafeswap.finance platform"
},
"country_origin": "",
"genesis_date": null,
"contract_address": "0x790be81c3ca0e53974be2688cdb954732c9862e1",
"url": "https://cafeswap.finance/",
"explorers": [
"https://bscscan.com/token/0x790be81c3ca0e53974be2688cdb954732c9862e1"
],
"twitter": "CafeSwapFinance",
"telegram": "CafeSwap",
"github_org": "CafeSwap"
} | json |
# -*- coding: utf-8 -*-
# Licensed under a 3-clause BSD style license - see LICENSE.rst
from __future__ import (absolute_import, division, print_function,
unicode_literals)
import base64
import os
import zlib
from .environment import get_environment
from . import util
def iter_results_paths(results):
"""
Iterate over all of the result file paths.
"""
skip_files = set([
'machine.json', 'benchmarks.json'
])
for root, dirs, files in os.walk(results):
for filename in files:
if filename not in skip_files and filename.endswith('.json'):
yield (root, filename)
def iter_results(results):
"""
Iterate over all of the result files.
"""
for (root, filename) in iter_results_paths(results):
yield Results.load(os.path.join(root, filename))
def iter_results_for_machine(results, machine_name):
"""
Iterate over all of the result files for a particular machine.
"""
return iter_results(os.path.join(results, machine_name))
def iter_results_for_machine_and_hash(results, machine_name, commit):
"""
Iterate over all of the result files with a given hash for a
particular machine.
"""
for (root, filename) in iter_results_paths(
os.path.join(results, machine_name)):
results_commit = filename.split('-')[0]
max_len = max(len(commit), len(results_commit))
if results_commit[:max_len] == commit[:max_len]:
yield Results.load(os.path.join(root, filename))
def iter_existing_hashes(results):
"""
Iterate over all of the result commit hashes and dates. Each
element yielded is the pair (hash, date).
May return duplicates. Use `get_existing_hashes` if that matters.
"""
for result in iter_results(results):
yield result.commit_hash, result.date
def get_existing_hashes(results):
"""
Get all of the commit hashes that have already been tested.
Each element yielded is the pair (hash, date).
"""
hashes = list(set(iter_existing_hashes(results)))
return hashes
def find_latest_result_hash(machine, root):
"""
Find the latest result for the given machine.
"""
root = os.path.join(root, machine)
latest_date = 0
latest_hash = ''
for commit_hash, date in iter_existing_hashes(root):
if date > latest_date:
latest_date = date
latest_hash = commit_hash
return latest_hash
def get_filename(machine, commit_hash, env):
"""
Get the result filename for a given machine, commit_hash and
environment.
"""
return os.path.join(
machine,
"{0}-{1}.json".format(
commit_hash[:8],
env.name))
class Results(object):
"""
Manage a set of benchmark results for a single machine and commit
hash.
"""
api_version = 1
def __init__(self, params, env, commit_hash, date):
"""
Parameters
----------
params : dict
Parameters describing the environment in which the
benchmarks were run.
env : Environment object
Environment in which the benchmarks were run.
commit_hash : str
The commit hash for the benchmark run.
date : int
Javascript timestamp for when the commit was merged into
the repository.
"""
self._params = params
self._env = env
self._commit_hash = commit_hash
self._date = date
self._results = {}
self._profiles = {}
self._python = env.python
self._filename = get_filename(
params['machine'], self._commit_hash, env)
@property
def commit_hash(self):
return self._commit_hash
@property
def date(self):
return self._date
@property
def params(self):
return self._params
@property
def results(self):
return self._results
@property
def env(self):
return self._env
def add_time(self, benchmark_name, time):
"""
Add benchmark times.
Parameters
----------
benchmark_name : str
Name of benchmark
time : number
Numeric result
"""
self._results[benchmark_name] = time
def add_profile(self, benchmark_name, profile):
"""
Add benchmark profile data.
Parameters
----------
benchmark_name : str
Name of benchmark
profile : bytes
`cProfile` data
"""
self._profiles[benchmark_name] = base64.b64encode(
zlib.compress(profile))
def get_profile(self, benchmark_name):
"""
Get the profile data for the given benchmark name.
"""
return zlib.decompress(
base64.b64decode(self._profiles[benchmark_name]))
def has_profile(self, benchmark_name):
"""
Does the given benchmark data have profiling information?
"""
return benchmark_name in self._profiles
def save(self, result_dir):
"""
Save the results to disk.
Parameters
----------
result_dir : str
Path to root of results tree.
"""
path = os.path.join(result_dir, self._filename)
util.write_json(path, {
'results': self._results,
'params': self._params,
'requirements': self._env.requirements,
'commit_hash': self._commit_hash,
'date': self._date,
'python': self._python,
'profiles': self._profiles
}, self.api_version)
@classmethod
def load(cls, path):
"""
Load results from disk.
Parameters
----------
path : str
Path to results file.
"""
d = util.load_json(path, cls.api_version)
obj = cls(
d['params'],
get_environment('', d['python'], d['requirements']),
d['commit_hash'],
d['date'])
obj._results = d['results']
if 'profiles' in d:
obj._profiles = d['profiles']
obj._filename = os.path.join(*path.split(os.path.sep)[-2:])
return obj
def rm(self, result_dir):
path = os.path.join(result_dir, self._filename)
os.remove(path)
@classmethod
def update(cls, path):
util.update_json(cls, path, cls.api_version)
| python |
IIT Hyderabad is conducting awareness programmes on social distancing & conducting relief programs in 5 villages it has adopted under ‘Unnat Bharat Abhiyan’.
By India Today Web Desk: Indian Institute of Technology Hyderabad is supporting villages adopted under Unnat Bharat Abhiyan programme with Covid-19-related activities and preparedness to prevent the spread of Covid-19 pandemic. The institute is also sharing awareness material in the Telugu language to the community stakeholders.
The Institute has undertaken relief programmes in the five villages it had adopted under ‘Unnat Bharat Abhiyan,’ namely Bujarampet, Mohammed Nagar, Knnavaram, Anthram and Salabatpur in Medak District.
The faculty is constantly interacting with local stakeholders to ascertain their needs. During these interactions, the villagers informed that they have commenced work under Mahatma Gandhi National Rural Employment Guarantee Scheme (MGNREGS).
Speaking about the Institute initiatives in the local community, Prof BS Murty, Director, IIT Hyderabad, said, “Since the outbreak of Covid-19, IIT Hyderabad has kept a strong focus on how best we can use our technical expertise to serve the nation, especially in the surrounding regions to IITH. In this direction, the Institute has worked with the villages adopted by it under the UBA program.
The Mission of Unnat Bharat Abhiyan is to enable higher educational institutions to work with the people of rural India in identifying development challenges and evolving appropriate solutions for accelerating sustainable growth. It also aims to create a virtuous cycle between society and an inclusive academic system by providing knowledge and practices for emerging professions.
Dr Prasad Onkar, UBA Coordinator and Assistant Professor, Department of Design, IIT Hyderabad, is coordinating the activities in the five villages. The faculty are also urging the village community to download ‘Arogya Setu’ App and ‘KisanRath’ App, which connects farmers and traders with transporters, as requested by the Government of India, and Regional Coordinating Institute National Institute of Rural Development and Panchayati Raj (NIRDPR), Hyderabad.
A team from IIT Hyderabad coordinated relief programs in Anthram village on May 05, 2020. Dr Neelakantan and Dr. Shiva Ji, Faculty, Design Department, IIT Hyderabad, spoke with the villagers about the precautions to protect themselves from Covid-19.
They also distributed supplies of masks, gloves and food kits. The faculty also distributed hand sanitizers made in IIT Hyderabad under the guidance of Dr. JyotsnenduGiri, Associate Professor, Department of Biomedical Engineering, IIT Hyderabad. | english |
<reponame>smallcase/cdk8s-botkube
import { Chart, Testing } from 'cdk8s';
import { BotKube } from '../src/index';
test('botkube-default', () => {
const app = Testing.app();
const chart = new Chart(app, 'test');
new BotKube(chart, 'botkube-default');
expect(Testing.synth(chart)).toMatchSnapshot();
});
test('botkube-configmap', () => {
const app = Testing.app();
const chart = new Chart(app, 'test');
new BotKube(chart, 'botkube-default', {
configMapData: 'testConfigMap',
});
expect(Testing.synth(chart)).toMatchSnapshot();
});
test('botkube-secrets', () => {
const app = Testing.app();
const chart = new Chart(app, 'test');
new BotKube(chart, 'botkube-default', {
secretName: 'testSecretName',
});
expect(Testing.synth(chart)).toMatchSnapshot();
});
test('botkube-nodeselector', () => {
const app = Testing.app();
const chart = new Chart(app, 'test');
new BotKube(chart, 'botkube-default', {
nodeSelector: { testing: 'test-key' },
});
expect(Testing.synth(chart)).toMatchSnapshot();
});
test('botkube-tolerations', () => {
const app = Testing.app();
const chart = new Chart(app, 'test');
new BotKube(chart, 'botkube-default', {
tolerations: [{
effect: 'NoExecute',
key: 'node.kubernetes.io/not-ready',
operator: 'Exists',
tolerationSeconds: 300,
}],
});
expect(Testing.synth(chart)).toMatchSnapshot();
});
| typescript |
Mumbai: Citing governance concerns, the Reserve Bank of India on Wednesday superseded the Board of Directors of Dewan Housing Finance Corporation Limited (DHFL) and said it intends to shortly initiate the process of resolution of the company.
The RBI also appointed the R. Subramaniakumar, ex-MD and CEO of Indian Overseas Bank, as the “Administrator under Section 45-IE (2) of the Reserve Bank of India Act, 1934”.
“In exercise of the powers conferred under Section 45-IE (I) of the Reserve Bank of India Act, 1934, the Reserve Bank has today superseded the Board of Directors of DHFL owing to governance concerns and defaults by DHFL in meeting various payment obligations,” RBI said in a statement.
The Reserve Bank also intends to shortly initiate the process of resolution of the company under the Insolvency and Bankruptcy (Insolvency and Liquidation Proceedings of Financial Service Providers and Application to Adjudicating Authority) Rules, 2019 and would also apply to the NCLT for appointing the Administrator as the Insolvency Resolution Professional, the central bank said.
| english |
<gh_stars>0
/*
* Copyright(c) 2012-2018 Intel Corporation
* SPDX-License-Identifier: BSD-3-Clause-Clear
*/
#include <octf/cli/Executor.h>
#include <google/protobuf/dynamic_message.h>
#include <octf/cli/internal/CLIList.h>
#include <octf/cli/internal/CLIUtils.h>
#include <octf/cli/internal/CommandSet.h>
#include <octf/cli/internal/GenericPluginShadow.h>
#include <octf/cli/internal/Module.h>
#include <octf/cli/internal/OptionsValidation.h>
#include <octf/cli/internal/cmd/CmdHelp.h>
#include <octf/cli/internal/cmd/CmdVersion.h>
#include <octf/cli/internal/cmd/CommandProtobuf.h>
#include <octf/cli/internal/cmd/CommandProtobufLocal.h>
#include <octf/utils/Exception.h>
#include <octf/utils/Log.h>
#include <octf/utils/ModulesDiscover.h>
using std::endl;
using std::make_shared;
using std::shared_ptr;
using std::string;
using std::stringstream;
using std::vector;
namespace octf {
namespace cli {
Executor::Executor()
: m_cliProperties()
, m_localCmdSet(new CommandSet())
, m_moduleCmdSet(new CommandSet())
, m_modules()
, m_module(new Module())
, m_progress(0.0)
, m_nodePlugin() {
addLocalCommand(make_shared<CmdVersion>(m_cliProperties));
}
Executor::~Executor() {}
CLIProperties &Executor::getCliProperties() {
return m_cliProperties;
}
void Executor::addLocalCommand(shared_ptr<ICommand> cmd) {
m_localCmdSet->addCmd(cmd);
}
void Executor::loadModuleCommandSet() {
if (m_module->isLocal()) {
// Module is local, set the appropriate command set
*m_moduleCmdSet = m_localModules[m_module->getLongKey()];
} else {
// Get description of this module's command set
Call<proto::Void, proto::CliCommandSetDesc> call(m_nodePlugin.get());
m_nodePlugin->getCliInterface()->getCliCommandSetDescription(
&call, call.getInput().get(), call.getOutput().get(), &call);
call.wait();
if (call.Failed()) {
throw InvalidParameterException("Cannot get command list, error: " +
call.ErrorText());
}
auto cmdSetDesc = call.getOutput();
if (utils::isCommandSetValid(*cmdSetDesc)) {
int commandCount = cmdSetDesc->command_size();
for (int i = 0; i < commandCount; i++) {
const proto::CliCommandDesc &cmdDesc = cmdSetDesc->command(i);
auto cmd = make_shared<CommandProtobuf>(cmdDesc);
m_moduleCmdSet->addCmd(cmd);
}
}
}
}
void Executor::printMainHelp(std::stringstream &ss) {
utils::printUsage(ss, nullptr, m_cliProperties, false, m_modules.size());
if (m_modules.size()) {
ss << endl << "Available modules: " << endl;
for (auto module : m_modules) {
utils::printModuleHelp(ss, &module.second, true);
}
}
utils::printCmdSetHelp(ss, *m_localCmdSet);
return;
}
void Executor::getModules() {
ModulesDiscover discover;
NodesIdList nodes;
// Get a list of modules which sockets were detected
discover.getModulesList(nodes);
// Add modules
for (auto node : nodes) {
Module newModule;
newModule.setLongKey(node.getId());
m_modules[node.getId()] = newModule;
}
}
shared_ptr<ICommand> Executor::validateCommand(CLIList &cliList) {
CLIElement element = cliList.nextElement();
string key = element.getValidKeyName();
if (key.empty()) {
throw InvalidParameterException("Invalid command format.");
}
string cmd;
bool localCommand;
if (isModuleExistent(key)) {
// Dealing with module
setModule(key);
localCommand = false;
if (cliList.hasNext()) {
element = cliList.nextElement();
cmd = element.getValidKeyName();
if (cmd.empty()) {
return nullptr;
}
} else {
// No command specified
return nullptr;
}
} else {
// Dealing with local command
cmd = key;
localCommand = true;
}
// Look for command in local or module command set
shared_ptr<ICommand> commandToExecute;
if (localCommand) {
// Local command
commandToExecute = m_localCmdSet->getCmd(cmd);
} else {
// Module command
if (m_moduleCmdSet->hasCmd(cmd)) {
// Module command set already loaded
commandToExecute = m_moduleCmdSet->getCmd(cmd);
} else {
// Module command set not loaded or command not existent
commandToExecute = getCommandFromModule(cmd);
}
}
return commandToExecute;
}
shared_ptr<ICommand> Executor::getCommandFromModule(string cmdName) {
if (!m_nodePlugin.get()) {
return nullptr;
}
Call<proto::CliCommandId, proto::CliCommandDesc> call(m_nodePlugin.get());
call.getInput()->set_commandkey(cmdName);
m_nodePlugin->getCliInterface()->getCliCommandDescription(
&call, call.getInput().get(), call.getOutput().get(), &call);
call.wait();
if (call.Failed()) {
throw InvalidParameterException(
"Cannot get command description, error: " + call.ErrorText());
}
const proto::CliCommandDesc &cliCmd = *call.getOutput();
if (utils::isCommandValid(cliCmd)) {
return make_shared<CommandProtobuf>(cliCmd);
} else {
return nullptr;
}
}
int Executor::execute(CLIList &cliList) {
shared_ptr<ICommand> command = validateCommand(cliList);
if (command == nullptr || command == m_moduleCmdSet->getHelpCmd()) {
// No command for module specified or specified command is help
// download module's command set and show help
loadModuleCommandSet();
stringstream ss;
utils::printUsage(ss, m_module.get(), m_cliProperties, false);
utils::printCmdSetHelp(ss, *m_moduleCmdSet);
log::cout << ss.str();
return command == nullptr;
}
if (command == m_localCmdSet->getHelpCmd()) {
// "First level" help (general for application)
stringstream ss;
printMainHelp(ss);
log::cout << ss.str();
return 0;
}
try {
if (cliList.hasHelp()) {
// Help reqested, print it and return
stringstream ss;
utils::printCmdHelp(ss, command, m_cliProperties);
log::cout << ss.str();
return 0;
}
// Fill command's parameters
command->parseParamValues(cliList);
} catch (Exception &e) {
// An error during parsing command, print it and then print help,
// and return
if ("" != e.getMessage()) {
log::cerr << e.getMessage() << endl;
}
stringstream ss;
utils::printCmdHelp(ss, command, m_cliProperties);
log::cout << ss.str();
return 1;
}
setupOutputsForCommandsLogs();
if (command->isLocal()) {
// Execute command locally
command->execute();
} else {
// Execute remotely
shared_ptr<CommandProtobuf> protoCmd =
std::dynamic_pointer_cast<CommandProtobuf>(command);
if (protoCmd) {
executeRemote(protoCmd);
} else {
// Dynamic cast failed
throw InvalidParameterException("Unknown command type.");
}
}
return 0;
}
int Executor::execute(int argc, char *argv[]) {
int result = 1;
if (argc > 1) {
// Parse application input
vector<string> arguments(argv, argv + argc);
CLIList cliList;
cliList.create(arguments);
// Execute command
result = execute(cliList);
} else {
throw InvalidParameterException(
"Specify module or command first. Use '" +
m_cliProperties.getName() + " -H' for help.");
}
return result;
}
bool Executor::isModuleExistent(std::string moduleName) const {
for (const auto module : m_modules) {
if (module.second.getLongKey() == moduleName ||
module.second.getShortKey() == moduleName) {
return true;
}
}
return false;
}
void Executor::setModule(std::string moduleName) {
for (const auto &module : m_modules) {
if (module.second.getLongKey() == moduleName ||
module.second.getShortKey() == moduleName) {
// Remember which module was set
*m_module = module.second;
if (m_module->isLocal()) {
// Set appropriate command set for local module
*m_moduleCmdSet = m_localModules[moduleName];
} else {
// Initialize node plugin if module is remote
m_nodePlugin.reset(
new GenericPluginShadow(m_module->getLongKey()));
if (!m_nodePlugin->init()) {
throw Exception("Plugin unavailable.");
}
return;
}
}
}
}
void Executor::addInterface(InterfaceShRef interface, CommandSet &commandSet) {
// Add every method of interface as command to given command set
int methodCount = interface->GetDescriptor()->method_count();
for (int i = 0; i < methodCount; i++) {
addMethod(interface->GetDescriptor()->method(i), interface, commandSet);
}
}
void Executor::addMethod(const ::google::protobuf::MethodDescriptor *method,
InterfaceShRef interface,
CommandSet &commandSet) {
// TODO(trybicki): Don't create commands upfront for every interface method
// Create local command and add it to command set
std::shared_ptr<CommandProtobufLocal> cmd =
make_shared<CommandProtobufLocal>(method, interface);
commandSet.addCmd(cmd);
}
void Executor::addLocalModule(InterfaceShRef interface,
const std::string &longKey,
const std::string &desc,
const std::string &shortKey) {
if (m_modules.end() != m_modules.find(longKey)) {
// Specified module already exist
throw Exception("Trying to add already existing module: " + longKey);
}
Module module;
module.setDesc(desc);
module.setLongKey(longKey);
module.setShortKey(shortKey);
module.setLocal(true);
// Register module
m_modules[longKey] = module;
// Create command set for interface
addInterface(interface, m_localModules[longKey]);
}
void Executor::addLocalModule(InterfaceShRef interface) {
addInterface(interface, *m_localCmdSet);
}
void Executor::executeRemote(std::shared_ptr<CommandProtobuf> cmd) {
if (!m_nodePlugin) {
throw Exception("Wrong initialization of plugin.");
}
// Factory to create protobuf messages in runtime
google::protobuf::DynamicMessageFactory factory;
// Create prototype of input message based on command input descriptor
// Factory keeps ownership of memory
const google::protobuf::Message *prototype_msg =
factory.GetPrototype(cmd->getInputDesc());
// Create mutable input message from prototype
// Ownership passed to the caller, thus use smart pointer to handle it
MessageShRef in_msg = MessageShRef(prototype_msg->New());
// Parse parameters - set values stored in command to the protobuf message
cmd->parseToProtobuf(in_msg.get(), cmd->getInputDesc());
// Create prototype of output message based on command output descriptor
// Factory keeps ownership of memory
const google::protobuf::Message *prototype_out =
factory.GetPrototype(cmd->getOutputDesc());
// Create mutable output message from prototype
// Ownership passed to the caller, thus use smart pointer to handle it
MessageShRef out_msg = MessageShRef(prototype_out->New());
CallGeneric call(in_msg, out_msg, m_nodePlugin.get());
// Remote method call
m_nodePlugin->getRpcChannel()->genericCallMethod(cmd->getInterfaceId(),
cmd->getMethodId(), call);
// Wait for result and print output
cmd->handleCall(call, out_msg);
}
void Executor::setProgress(double progress, std::ostream &out) {
uint64_t next = progress * 100;
uint64_t prev = m_progress * 100;
if (next != prev) {
m_progress = progress;
utils::printProgressBar(m_progress, out);
}
}
void Executor::setupOutputsForCommandsLogs() const {
auto const &prefix = m_cliProperties.getName();
if (nullptr != getenv("VERBOSE")) {
log::verbose << log::enable << log::json << log::prefix << prefix;
log::debug << log::enable << log::json << log::prefix << prefix;
} else {
log::verbose << log::disable;
log::debug << log::disable;
}
log::cerr << log::enable << log::json << log::prefix << prefix;
log::critical << log::enable << log::json << log::prefix << prefix;
log::cout << log::enable << log::json << log::prefix << prefix;
}
} // namespace cli
} // namespace octf
| cpp |
{
"name": "demo-project",
"version": "1.0.0",
"description": "This repository is automatically synced with the main [Semantic UI](https://github.com/Semantic-Org/Semantic-UI) repository to provide lightweight CSS only version of Semantic UI.",
"main": "index.js",
"scripts": {
"test": "echo \"Error: no test specified\" && exit 1"
},
"author": "",
"license": "ISC",
"dependencies": {
"body-parser": "^1.18.3",
"elasticsearch": "^15.1.1",
"express": "^4.16.4",
"get-json": "^1.0.1",
"nodemon": "^1.18.4"
}
}
| json |
{
"Vk_API": {
"bad_connection": "У вас отсутствует интернет подключение! Невозможно выполнить подключение! "
},
"Preparation_of_data": {
"invalid_age_value": "Вы ввели некорректное значение возраста\n\nВозраст не может быть строкой\n\nВозраст не может быть больше 90 и меньше 18.",
"invalid_friends_value": "Вы ввели некорректное значение в поле 'Количество друзей'\n\nПоле может содержать только положительное число от 0 до {}, а также поле 'От' не может быть больше 'До'",
"invalid_followers_value": "Вы ввели некорректное значение в поле 'Количество подписчиков'\n\nПоле может содержать только положительное число от 0 до {}, а также поле 'От' не может быть больше 'До'",
"invalid_group_id_value": "Мне не удалось найти грппу с таким id\n\nid: {}",
"invalid_value_friends_or_followers": "Значения полей 'Друзья' и 'Подписчики' могут содержать только числа"
},
"Update_app": {
"Bad_connect": "Ваша версия: {VERSION}\n\nПлохое подключение к интернету. Мы не смогли выполнить обновление.\n\nВы можете скачать новую версию самостоятельно, либо рассказать об ошибке в боте ВК"
},
"Parsing": {
"Bad_connection": "У вас нет подключения к интернету, парсинг невозможен\n\n{error}",
"Bad_token": "Ваш токен неверен.\n\nАвторизуйтесь на главной странице программы",
"Dont_choose_pk": "Для парсинга надо выбрать запись по которой будет он произведён\n\nЗапись можно выбрать, нажав на кнопку \"Выбрать\"\n\nЕсли там нет записей, то выполните париснг по группам в первой подвкалдке вкладки \"Парсинг\", не ставя галочку у поля с отменой сбора дополнительных параметров.",
"Validate_follower": {
"Not_int": "Значения полей \"Подписчиков\" могут содержать только числа",
"From_more_to": "Значение поля \"Подписчиков\" \"От\" не может быть больше \"До\"",
"Max_value": "Значения полей \"Подписчиков\" не может быть больше {FOLLOWERS_MAX}"
},
"Validate_old": {
"From_more_to": "Значение поля \"Возраст\" \"От\" не может быть больше \"До\""
},
"Validate_last_seen": {
"Not_int": "Значения полей \"Последний раз в сети\" могут содержать только числа",
"From_more_to": "Значение поля \"Последний раз в сети\" \"От\" не может быть больше \"До\"",
"Max_value": "Значения полей \"Друзей\" не может быть больше {LAST_SEEN_MAX}"
},
"Validate_status": {
"Empty": "Вы выбрали возможность парсинга по ключевому значению статуса, но оставили это поле пустым!"
},
"Validate_about": {
"Empty": "Вы выбрали возможность парсинга по ключевому значению Обо мне, но оставили это поле пустым!"
}
},
"Unforeseen_error": "Мы не предвидели эту ошибку, обратитесь с ней к автору программы\n\nОшибка: {}"
} | json |
<gh_stars>1-10
import React, { useState } from "react";
import Image from "react-bootstrap/Image";
import { Redirect } from "react-router-dom";
import { svgPath } from "../../../../utils/helpers";
import ROUTES from "../../../../utils/routes";
export default function ListingRow(props) {
const {
whichView,
property,
deleteProperty,
filters,
fetchlistProperties,
markAsSold,
deletedPropertySucces,
} = props;
const [isRowClicked, setIsRowClicked] = useState(false);
function handleClick(e) {
e.preventDefault();
whichView !== "deatils" && setIsRowClicked(true);
}
function handleDelete(e) {
deleteProperty(property._id);
fetchlistProperties(filters);
}
function HandleSoldClick(e) {
e.preventDefault();
markAsSold(property._id);
}
if (
deletedPropertySucces !== null &&
deletedPropertySucces._id === property._id
) {
return <Redirect to={ROUTES.LISTING} />;
}
if (isRowClicked) {
return <Redirect to={ROUTES.LISTING + "/" + property._id} />;
}
return (
<tr key={property._id} onClick={handleClick}>
{whichView === "listing" && (
<td>
<Image
className="firstCellMargin"
src={property.images[0]}
width="125px"
id="btn-img"
rounded
/>
</td>
)}
<td className={whichView === "listing" ? "" : "firstCellMargin"}>
<p className="boldSpan">{property.address.street}</p>
<span className="notBoldSpan">{property.address.city}</span>
</td>
<td>
<p>{property.price}</p>
</td>
<td className="characteristics">
<span>
<Image className="listing-icons" src={svgPath("bed")} />
<span>{property.bedRooms}</span>
</span>
<span>
<Image className="listing-icons" src={svgPath("bath")} />
<span>{property.bathRooms}</span>
</span>
<span className="iconSurface">
<Image className="listing-icons" src={svgPath("m2")} />
<span>
{property.surface}m<sup>2</sup>
</span>
</span>
</td>
<td>
<button className="btn list">
<Image
className="listing-icons sold"
onClick={HandleSoldClick}
src={svgPath(property.sold ? "sold-active" : "sold")}
rounded
/>
</button>
</td>
<td>
<button className="btn list" onClick={handleDelete}>
<Image className="listing-icons" src={svgPath("delete")} rounded />
</button>
</td>
</tr>
);
}
| javascript |
<filename>doc/devTest/SHACL-SENDRule102Details.md
<link href="styles.css?v=1" rel="stylesheet"/>
<a name='top'></a>
Rule SD1002 : Reference Interval
==================================
The SEND-IG 3.0 rule **SD1002** is defined in the file [FDA-Validator-Rules.xlsx](https://github.com/phuse-org/SENDConform/tree/master/doc/FDA/FDA-Validator-Rules.xlsx) as:
FDA Validator Rule ID | FDA Validator Message | Publisher| Publisher ID | Business or Conformance Rule Validated | FDA Validator Rule
------|-------------------|-----|-------|--------------------------|-----------------------------
**SD1002** |RFSTDTC is after RFENDTC | FDA| FDAB034 |Study Start and End Dates must be submitted and complete. | **Subject Reference Start Date/Time (RFSTDTC) must be less than or equal to Subject Reference End Date/Time (RFENDTC)**
The following Rule Components are defined based on the data, RDF data model, and SD1002 rule:
**1. [Reference Start Date and End Date in xsd:date format](#rc1)**
**2. [A Subject has one Reference Interval](#rc2)**
**3. [A Reference Interval has one Start Date and one End Date](#rc3)**
**4. [The SD1002 Rule itself: Start Date on or before End Date](#rc4)**
Translation of each Rule Component into SHACL and evaluation of test data is described below. Test cases and data for evaluation purposes are recorded in the file [TestCases.xlsx](https://github.com/phuse-org/SENDConform/blob/master/SHACL/CJ16050Constraints/TestCases.xlsx)
# Data Structure
Familiarity with the data structure is necessary to explain the constraints and test cases. **Figure 1** illustrates a partial set of data for test subject 99T1 where the Reference Interval end date *precedes* the start date, thus violating rule SD1002.
<a name='figure1'/>
<img src="images/RefIntervalStructureDateFail.PNG"/>
***Figure 1: Reference Interval for Animal 99T1 (incomplete data)***
# Translation into SHACL
<!--- RULE COMPONENT 1 ------------------------------------------------------->
<a name='rc1'></a>
## 1. Reference Start Date and End Date in xsd:date format
<div class='ruleState'>
<div class='ruleState-header'>Rule Statement</div>
<code>rfstdtc</code> and <code>rfendtc</code> in <code>xsd:date</code> format.
</div>
<div class='def'>
<div class='def-header'>Description</div>
Reference Start Date (RFSTDTC) and End Date (RFENDTC) must be in
<font class='emph'>date format</font>. The study in this example requires
`xsd:date`. Other studies may use `xsd:dateTime` or a combination of `xsd:date`
and `xsd:dateTime`.
</div>
Refer back to [*Figure 1*](#figure1) to compare the data to the SHACL, below. The shape `:DateFmtShape` uses `sh:targetObjectsOf` to begin evaluation at the <font class='object'>object</font> of the <font class='predicate'>predicates</font> `time:hasBeginning` and `time:hasEnd`. These <font class='object'>objects</font> must be of type `study:ReferenceBegin` or `study:ReferenceEnd` and have the <font class='predicate'>predicate</font> `time:inXSDDate` that leads to the date value that must be in `xsd:date` format.
<pre>
<font class='nodeBold'>Interval IRI</font> - - - <font class='predicate'>time:hasBeginning</font> - - > <font class='nodeBold'>Date IRI</font> - - > <font class='predicate'>time:inXSDDate</font> - - > <font class='literal'>Date value</font>
<font class='nodeBold'>Interval IRI</font> - - - <font class='predicate'>time:hasEnd</font> - - > <font class='nodeBold'>Date IRI</font> - - > <font class='predicate'>time:inXSDDate</font> - - > <font class='literal'>Date value</font>
</pre>
Test data for Animal Subject 99T4 contains a string value for `rfendtc`. Not shown: Subject 9T10 with string value for `rfstdtc`.
<pre class='data'>
cj16050:Animal_68bab561
a study:AnimalSubject ;
skos:prefLabel "Animal 99T4"^^xsd:string ;
study:hasReferenceInterval cj16050:<font class='nodeBold'>Interval_68bab561</font> ;
<font class='infoOmitted'>...</font>
cj16050:<font class='nodeBold'>Interval_68bab561</font>
a study:ReferenceInterval ;
time:hasBeginning cj16050:Date_2016-12-08 ;
time:hasEnd cj16050:<font class='nodeBold'>Date_7-DEC-16 </font> .
cj16050:<font class='nodeBold'>Date_7-DEC-16</font>
a study:ReferenceEnd ;
time:inXSDDate <font class='error'>"7-DEC-16"^^xsd:string</font> .
</pre>
<br/>
The shape tests the following conditions:
* A Reference Start Date must be in `xsd:date` format.
* A Reference End Date must be in `xsd:date` format.
<pre class='shacl'>
:DateFmtShape a sh:NodeShape ;
sh:targetObjectsOf time:hasBeginning ;
sh:targetObjectsOf time:hasEnd ;
sh:or (
[ sh:class study:ReferenceBegin ]
[ sh:class study:ReferenceEnd ]
) ;
] ;
sh:property [
sh:path time:inXSDDate ;
sh:datatype xsd:date ;
sh:name "xsd:date format";
sh:description "Date format as xsd:date.";
sh:message "Date not in xsd:date format."
] .
</pre>
<br/>
The report correctly identifies the value '7-DEC-16' as a string, violating the xsd:date requirement.
<pre class='report'>
a sh:ValidationReport ;
sh:conforms false ;
sh:result [
a sh:ValidationResult ;
sh:resultPath time:inXSDDate ;
sh:resultSeverity sh:Violation ;
sh:resultMessage "<font class='msg'>Date not in xsd:date format.</font>" ;
sh:value "<font class='error'>7-DEC-16</font>" ;
sh:sourceShape _:bnode_3c9cf811_13d4_43cb_b212_b7097d00b1ed_221 ;
sh:sourceConstraintComponent sh:DatatypeConstraintComponent ;
sh:focusNode <font class='nodeBold'>cj16050:Date_7-DEC-16 </font>;
]
</pre>
<br/><br/>
<!--- RULE COMPONENT 2 ------------------------------------------------------->
<a name='rc2'></a>
## 2. Subject has one Reference Interval
<div class='ruleState'>
<div class='ruleState-header'>Rule Statement</div>
<code>:AnimalSubject</code> <code>:hasReferenceInterval</code> with <code>sh:minCount</code> and <code>sh:maxCount</code> of 1
</div>
<div class='def'>
<div class='def-header'>Description</div>
Animal Subjects should have one and only one Reference Interval IRI.
</div>
This check determines if the Animal Subject has one and only one Reference Interval IRI. While it is possible to have an Interval IRI with no start date and no end date (see [Data Conversion](DataConversion.md)), this rule component only evaluates the case of missing Reference Interval IRIs. Multiple start/end dates for a single subject are evaluated in [Rule Component 3](#rc3).
Test data for Animal Subject 99T11 has no `study:hasReferenceInterval` .
<pre class='data'>
cj16050:<font class='nodeBold'>Animal_6204e90c</font>
a study:AnimalSubject ;
skos:prefLabel "<font class='nodeBold'>Animal 99T11</font>"^^xsd:string ;
study:hasSubjectID cj16050:SubjectIdentifier_6204e90c ;
study:hasUniqueSubjectID cj16050:UniqueSubjectIdentifier_6204e90c ;
study:memberOf cjprot:Set_00, code:Species_Rat ;
study:participatesIn cj16050:AgeDataCollection_6204e90c, cj16050:SexDataCollection_6204e90c .
</pre>
<br/>
The shape tests the following conditions:
* An Animal Subject must have one and only one Reference Interval.
<pre class='shacl'>
:SubjectOneRefIntervalShape a sh:NodeShape ;
sh:targetClass study:AnimalSubject ;
sh:path study:hasReferenceInterval ;
sh:name "reference interval present";
sh:description "Animal Subject must have one and only one reference interval IRI.";
sh:message "Animal Subject does not have one Reference Interval IRI." ;
sh:minCount 1 ;
sh:maxCount 1 .
</pre>
<br/>
The report identifies the IRI `cj16050:Animal_6204e90c` , corresponding to Animal Subject 99T11.
<pre class='report'>
a sh:ValidationReport ;
sh:conforms false ;
sh:result [
a sh:ValidationResult ;
sh:sourceShape :SubjectOneRefIntervalShape ;
sh:resultPath study:hasReferenceInterval ;
sh:resultSeverity sh:Violation ;
sh:focusNode cj16050:<font class='error'>Animal_6204e90c</font> ;
sh:resultMessage "<font class='msg'>Animal Subject does not have one Reference Interval IRI.</font>" ;
sh:sourceConstraintComponent sh:MinCountConstraintComponent
]
</pre>
<br/><br/>
<!--- RULE COMPONENT 3 ------------------------------------------------------->
<a name='rc3'></a>
## 3. Reference Interval has one Start Date and one End Date
<div class='ruleState'>
<div class='ruleState-header'>Rule Statement</div>
<code>study:ReferenceInterval</code> <code>time:hasBeginning</code> with <code>sh:minCount</code> and <code>sh:maxCount</code> of 1, <code>sh:and</code> <code>time:hasEnd</code> with <code>sh:minCount</code> and <code>sh:maxCount</code> of 1
</div>
<div class='def'>
<div class='def-header'>Description</div>
Each Reference interval should have one and only one start date and end date.
</div>
Reference interval IRIs are connected to their date values through the paths `time:hasBeginning` and `time:hasEnd`. A correctly formed interval has both start and end dates.
Test data provides the following violations:
* 99T5 missing rfendtc
* 99T9 missing rfstdtc
* 99T8 missing both rfendtc, rfstdtc
* 99T2 >1 rfstdtc, >1 rfendtc
Only the data and report for 99T5 is shown here, where start date is present and end date is missing for the Reference Interval.
<pre class='data'>
cj16050:Animal_db3c6403
a study:AnimalSubject ;
skos:prefLabel "Animal 99T5"^^xsd:string ;
study:hasReferenceInterval cj16050:<font class='nodeBold'>Interval_db3c6403 </font> ;
study:hasSubjectID cj16050:SubjectIdentifier_db3c6403 ;
study:hasUniqueSubjectID cj16050:UniqueSubjectIdentifier_db3c6403 ;
study:memberOf cjprot:Set_00, code:Species_Rat ;
study:participatesIn cj16050:AgeDataCollection_db3c6403, cj16050:SexDataCollection_db3c6403 .
cj16050:<font class='nodeBold'>Interval_db3c6403</font>
a study:ReferenceInterval ;
skos:prefLabel "Interval 2016-12-07 NA"^^xsd:string ;
<font class='nodeBold'>time:hasBeginning cj16050:Date_2016-12-07 </font>.
</pre>
<br/>
The shape tests the following conditions:
* Reference Interval Start date for an Animal Subject has one and only one value.
* Reference Interval End date for an Animal Subject has one and only one value.
<pre class='shacl'>
:RefIntervalDateShape a sh:NodeShape ;
sh:targetClass study:ReferenceInterval ;
sh:name "reference interval date count" ;
sh:description "Interval has one and only one start and end date." ;
sh:message "Problem with Reference Interval date." ;
sh:and (
[ sh:path time:hasBeginning ;
sh:minCount 1;
sh:maxCount 1
]
[
sh:path time:hasEnd ;
sh:minCount 1;
sh:maxCount 1
]
)
.
</pre>
<br>
The report identifies the interval for Animal Subject 99T5 (`cj16050:Interval_db3c6403`) as violating the constraint.
<pre class='report'>
a sh:ValidationResult ;
sh:sourceConstraintComponent sh:AndConstraintComponent ;
sh:focusNode cj16050:Interval_db3c6403 ;
sh:resultMessage "<font class='msg'>Problem with Reference Interval date.</font>" ;
sh:value cj16050:<font class='error'>Interval_db3c6403 </font> ;
sh:sourceShape :RefIntervalDateShape ;
sh:resultSeverity sh:Violation ;
</pre>
<br/>
<!--- RULE COMPONENT 4 ------------------------------------------------------->
<a name='rc4'></a>
## 4. SD1002: Start Date on or before End Date
<div class='ruleState'>
<div class='ruleState-header'>Rule Statement</div>
For interval, <code>! (?endDate >= ?beginDate )</code>
</div>
<div class='def'>
<div class='def-header'>Description</div>
Interval start date must be on or before end date. When the constraint is violated the report must display the <b>FDA Validator Message</b> "RFSTDTC is after RFENDTC"
</div>
Referring back to [**Figure 1**](#figure1), the reference start and end dates are not directly attached to either an Animal Subject or that Subject's Reference Interval IRI. This indirect connection makes the comparison of the two date values more complex, so SHACL-SPARQL is used in place of SHACL-Core. The SPARQL query is written to find cases where the end date is NOT greater than or equal to the start date.
Test data provides the following violations:
* 99T1 start date is after end date
* 99T2 multiple start/end date values, one start date is before one end date value
* 99T10 String value for rfstdtc results in a violation when comparing to rfendtc
Only the data and report for 99T1 is shown below.
<pre class='data'>
cj16050:Animal_184f16eb
a study:AnimalSubject ;
skos:prefLabel "Animal 99T1"^^xsd:string ;
study:hasReferenceInterval cj16050:<font class='nodeBold'>Interval_184f16eb</font> ;
study:hasSubjectID cj16050:SubjectIdentifier_184f16eb ;
study:hasUniqueSubjectID cj16050:UniqueSubjectIdentifier_184f16eb ;
study:memberOf cjprot:Set_00, code:Species_Rat ;
study:participatesIn cj16050:AgeDataCollection_184f16eb, cj16050:SexDataCollection_184f16eb .
cj16050:<font class='nodeBold'>Interval_184f16eb</font>
a study:ReferenceInterval ;
skos:prefLabel "Interval 2016-12-07 2016-12-06"^^xsd:string ;
time:hasBeginning cj16050:<font class='nodeBold'>Date_2016-12-07</font> ;
time:hasEnd cj16050:<font class='nodeBold'>Date_2016-12-06</font> .
<font class='nodeBold'>cj16050:Date_2016-12-07</font>
a study:ReferenceBegin ;
skos:prefLabel "Date 2016-12-07"^^xsd:string ;
time:inXSDDate "2016-12-07"^^xsd:date ;
study:dateTimeInXSDString "<font class='error'>2016-12-07</font>"^^xsd:string .
<font class='nodeBold'>cj16050:Date_2016-12-06</font>
a study:ReferenceEnd ;
skos:prefLabel "Date 2016-12-06"^^xsd:string ;
time:inXSDDate "2016-12-06"^^xsd:date ;
study:dateTimeInXSDString "<font class='error'>2016-12-06</font>"^^xsd:string .
</pre>
<br/>
The shape tests the following condition:
* Reference Interval Start Date must be on or before End Date
* The shape will also pick up cases where a date is in `xsd:string` format.
<pre class='shacl'>
:SD1002RuleShape a sh:NodeShape ;
sh:targetClass study:ReferenceInterval ;
sh:sparql [
a sh:SPARQLConstraint ;
sh:name "sd1002" ;
sh:description "SEND-IG 3.0 Rule SD1002. Reference Interval start date on or before end date." ;
sh:message "RFSTDTC is after RFENDTC";
sh:prefixes [
sh:declare [ sh:prefix "time" ;
sh:namespace "http://www.w3.org/2006/time#"^^xsd:anyURI ;
],
[ sh:prefix "study" ;
sh:namespace "https://w3id.org/phuse/study#"^^xsd:anyURI ;
]
] ;
sh:select
"""SELECT $this (?beginDate AS ?intervalStart) (?endDate AS ?intervalEnd)
WHERE {
$this time:hasBeginning ?beginIRI ;
time:hasEnd ?endIRI .
?beginIRI time:inXSDDate ?beginDate .
?endIRI time:inXSDDate ?endDate .
FILTER (! (?endDate >= ?beginDate ))
}""" ;
] .
</pre>
<br/>
The report identifies the interval for Animal Subject 99T1 where End Date precedes Start Date.
<pre class='report'>
a sh:ValidationResult ;
sh:sourceConstraint _:bnode_cacffc33_62e3_4c8b_bdba_e71e398a23dc_29 ;
sh:sourceShape :SD1002RuleShape ;
sh:resultMessage "<font class='msg'>RFSTDTC is after RFENDTC</font>" ;
sh:value <font class='error'>cj16050:Interval_184f16eb</font> ]
sh:sourceConstraintComponent sh:SPARQLConstraintComponent ;
sh:resultSeverity sh:Violation ;
sh:focusNode cj16050:Interval_184f16eb
</pre>
[Back to top of page](#top)
<br/>
[Back to TOC](TableOfContents.md)
| markdown |
The Janata Dal (Secular) on Friday released its second list of 49 candidates for the May 10 Karnataka assembly elections, and fielded H P Swaroop, instead of party patriarch H D Deve Gowda’s daughter-in-law Bhavani Revanna, from Hassan seat.
Bhavani, wife of JD(S) leader H D Kumaraswamy’s elder brother and former minister H D Revanna, had publicly declared that she would be the candidate from Hassan, leading to conflict within the party.
Addressing a press briefing, Kumaraswamy said the decision to field Swaroop was a joint decision of the family and that even Bhavani had agreed with it. He had backed Swaroop’s candidature from the seat.
“There is no possibility of dissension within the family. This decision has been taken with Bhavani and Revanna’s blessing,” he said.
Revanna, who also addressed the media, said he is not upset with the decision. “I’m not upset with the Hassan ticket announcement. We will follow the orders of HD Deve Gowda. His health is important to us. If Deve Gowda asks us to campaign in Hassan, I will do it,” he said.
Party state president CM Ibrahim was present at the press conference held at the JD(S) office in Bengaluru.
Swaroop’s father HS Prakash, a three-term MLA, had lost to Preetham in 2018. Prakash passed away later in the year.
Among others who featured on the second list was former minister A Manju, who switched from the BJP last month, from Arkalgud and farm leader Kadabur Manjunath from Gundlupet.
In Bengaluru, M Munegowda will contest from Yelahanka, Mohammad Mustaf from Sarvagnanagar and Javare Gowda from Yeshwantpur.
The list also named YSV Datta who had joined the Congress in January this year but later returned to JD(S) after the Congress named Anand KS from Kaddur seat. JD(S) has fielded Datta from Kaddur, where he was the MLA from 2013 to 2018. Datta had announced that he would run as an independent candidate but ended up returning to the JD(S) fold, with HD Revanna and Prajwal Revanna announcing their support for him at a public event on April 13.
Meanwhile, MP Kumaraswamy, the MLA from Mudigere constituency who quit BJP, joined the JD(S).
. | english |
There’s been lots of focus on the discriminatory nature of the New York restrictions, and their thuggishness.
But not enough was said about the manipulation of the statistics/numbers, so let’s do that:
But not enough was said about the manipulation of the statistics/numbers, so let’s do that:
Then Andrew Cuomo decided to make the lines based on what he said were the “cluster-zones” https://nypost.com/2020/10/06/cuomo-orders-shutdowns-in-covid-19-hit-areas-of-nyc/amp/. These red-zones mostly followed the zip-codes, with minor adjustments to include specific Jewish neighborhoods, while excluding non-Jewish sections. (((Yes, !!!)))
At the time, the targeting of the Jewish neighborhoods by itself seemed to be the only evil motivation here. But with time, it became clear that it wasn’t all.
Cuomo wanted to make sure this lockdown would be prolonged; so he departed from the zip-code metric.
Cuomo wanted to make sure this lockdown would be prolonged; so he departed from the zip-code metric.
In other words: While it was the higher positivity rate for these specific zip-codes that was used as the basis for the second lockdown, reopening would only be able to occur once the entire “cluster-zone” was below whatever ever-changing threshold.
| english |
India will begin its United Kingdom tour with a T20I match against Ireland on Wednesday.
Virat Kohli-led team will like to hit the ground running before their pivotal tour of England.
On the other hand, Ireland will like to provide good competition to the tourists. The Irish team has won a solitary match in the last four games.
Meanwhile, both the teams have some skillful players on their team who can change the complexion of the match. In fact, the team will rely on these players to provide them with solidarity.
| english |
"It is not as though God’s word had failed…" Romans 9:6 (NIV)
Let’s review Paul’s explanation of the gospel in Romans 1-8:
At this point in the letter, the question on many readers' minds must be, “If this is the gospel, then what about the promises God made to the nation of Israel, recorded in the Old Testament? Have they failed? Did God lie to them?” It is to this question that Paul turns in Romans 9-11.
The key to understanding his emphatic belief that God HAS NOT been unfaithful to Israel will be in noticing and interpreting his extensive citation of the Hebrew Scriptures. And especially, that foremost in Paul’s mind is God’s revelation of mercy as essential to his character (after the Israelites sinned by worshipping the golden calf in Exodus 32).
Paul begins this section with an emotional outburst, affirming his desire that his people—the Jews—be joined with him in Christ (9:1-5).
He then goes on to quote the Old Testament extensively to prove his statement: “It is not as though God’s word had failed. For not all who are descended from Israel are Israel” (Romans 9:6). He explains:
1. God’s people (called Israel) have never been a people based on biological descent or human works.
2. God has always been a God of mercy.
3. As the Creator of all things, God has the freedom to do what He wants with His creation.
4. The prophets predicted that God would graft Gentiles into Israel as part of the remnant of his people.
Until this point in the letter, Paul has deliberately depicted the similarity of the situation in which both Jews and Gentiles find themselves. After reading Romans 1-8, why might some readers start questioning God’s faithfulness to the Jewish people and His promises to them in the Old Testament?
To respond to this concern, Paul quotes passage after passage. He does so with one main intention: to demonstrate God’s faithful character and his consistency in Old and New Covenants. God’s revelation of Himself to Moses as a God of mercy, grace, compassion, and faithfulness (from Exodus 33:12-34:9) is the key to understanding Paul’s argument. In response to humanity’s rejection of Him, God has consistently been faithful to preserve a remnant chosen because He loves to extend mercy.
As you read through the Old Testament examples in Romans 9:1-29, consider how each demonstrates the consistency of God’s character over the ages. Additionally, how does each one evidence His mercy?
According to Paul, who is the “remnant of Israel” to whom God shows mercy? How do the predictions of Hosea and Isaiah inform this conclusion?
What do you identify as the primary attribute of God? How does viewing God through that lens affect your relationship with Him?
God’s view of Himself (and Paul’s too) is that He is a God of mercy, first and foremost. Earlier, in Romans 2:4 Paul wrote of “the riches of his kindness,” which is “intended to lead you to repentance.” Take some time to identify instances of God’s kindness and mercy towards you. Is there anything His kindness is leading you to repent of today?
| english |
The first day of the much-anticipated pink-ball Test ended with Team India firmly in the ascendancy.
Despite losing the toss, Team India were fabulous with the ball, bowling England out for a paltry 112. In response, the hosts negotiated a tricky final session to reach stumps at 99/3, with opener Rohit Sharma on an unbeaten 57.
Axar Patel was the star of the show in the England first innings. The left-arm spinner enthralled his home crowd, producing fabulous figures of 6/38. He was admirably supported by Ravichandran Ashwin, who for once played the secondary spinner’s role. The off-spinner, who took 3/26, is now just three wickets shy of 400 Test wickets.
In India's first innings, Rohit Sharma starred with a sublime half-century and looks good for more. While Virat Kohli looked in good touch, he succumbed to Jack Leach in what turned out to be the last over of the day's place.
Nevertheless, Team India will fancy their chances of eking out a significant first-innings advantage and possibly bat the visitors out of the game. On that note, let's have a look at three talking points from an exciting first day of the Ahmedabad day-night Test.
India and England went in with different strategies for the Ahmedabad Test. While the hosts went in with three spinners, England opted for three seamers, as the pink ball tends to favour the quicker bowlers.
By the end of the first day, one team got their strategy spot on. India read the conditions perfectly and now have a huge advantage on a dry pitch that is offering turn and bounce. Axar Patel got a wicket off his first delivery of the day, while Ravichandran Ashwin got the ball to drift beautifully.
With puffs of dust visible on Day 1, the pitch is likely to deteriorate further as the game progresses. Instead, England frittered away their advantage of batting first, as both Indian spinners got ample purchase of the track to bamboozle the visiting batsmen.
Eventually, India did not require their third spinner, Washington Sundar, to join the party, as Patel and Ashwin ran riot.
Sundar, who came into the playing XI in place of Kuldeep Yadav, could generate extra bounce owing to his height if he gets an opportunity to do so in the English second innings.
Meanwhile, England’s pacers toiled hard, albeit without success. Stuart Broad and James Anderson shared the new ball for England but couldn't use the hard pink cherry to engineer an early breakthrough.
Instead, it was Jofra Archer’s express pace that provided a wicket to the beleaguered visitors. England may probably have been better off playing someone like Olly Stone in place of Broad or Anderson.
With Jack Leach the only bowler who looked like taking a wicket for England, the visitors will be rueing their decision not picking an extra spinner in their side too.
Since 2019, Rohit Sharma has converted his half-centuries into tons on four occasions. The last time he did so was in the second Test in Chennai, where his imperious 161 on a raging turner helped set up a thumping win for Team India.
Rohit Sharma looks set for more of the same in Ahmedabad. On a pitch where only one England batsmen went past 20, the Team India opener provided a masterclass on batting against the pink ball under lights.
Ben Stokes had claimed that the pace trio of Broad, Anderson and Archer could wreak havoc with the pink ball under lights. If Team India were wary of that threat, Sharma certainly didn’t let that show, as the opener looked in great touch.
He started his innings slowly, giving himself time to adjust to the conditions. However, from 11 runs off 30 balls, Hitman raced to his 50, scoring his next 39 runs off just 33 balls, bringing up his 12th Test century in the process.
The Team India opener's pulls against Jofra Archer were a treat to watch, while the restraint he showed against Anderson and Broad paid him dividends. Rohit Sharma also nullified the threat of Jack Leach, paying the left-arm spinner due respect by negotiating him with a straight bat.
With a set Rohit Sharma at the crease, another big ton from the mercurial opener could be in the offing. He looks to have picked up from where he left off in Chennai. A Rohit Sharma show on Day 2 could see Team India firmly in the driver's seat if they are not there already.
Sunil Gavaskar was one of the first ones to observe how England were shooting themselves in the foot with their mindset. Despite winning the toss and batting first, the visitors failed to make the most of the conditions on offer.
Except Zak Crawley, every other England batsman struggled to impose themselves on the game. They looked bereft of self-belief when they walked out, with the turning and gripping track once again catching them off guard.
Senior campaigners like Ben Stokes and Jonny Bairstow had no answer to the web spun by Ashwin and Axar Patel, as they failed to match Zak Crawley’s patience.
Even when they came out to the field, the visitors looked dejected from ball one. England were visibly annoyed after a couple of decisions went against them, with the big screen capturing their frustrations whenever 'Umpire’s Call' saved India’s batsmen.
Broad and Anderson’s dissatisfaction with the landing area didn’t help their cause either, with the regular stoppages in play preventing England from building any momentum or pressure.
If England are to have any chance of a comeback in this Test, they'll need to start Day 2 with a positive mindset. Their fielders will need to grab all the half-chances, and the bowlers shouldn't get bogged down by the conditions or the match situation.
Joe Root looked like a man with the world’s burden on his shoulders when his team walked off on Day 1. He'll need to rally his troops and snap them out of their siege mentality if England do not want to go down 2-1 down in the series. | english |
# tier4_datetime_rviz_plugin
## Purpose
This plugin displays the ROS Time and Wall Time in rviz.
## Assumptions / Known limits
TBD.
## Usage
1. Start rviz and select panels/Add new panel.
2. Select tier4_datetime_rviz_plugin/AutowareDateTimePanel and press OK.
| markdown |
Drink an Adequate amount of water Water is always a beneficial source to take off your body. Living with two you should always have extra of everything you had earlier. Try drinking more water than you were drinking usually to make your baby stay hydrated and less on diseases.
Massage/Nourish your body During pregnancy, your body gets sick and tired easily. You need to pamper and care for yourself extra during these days. You may also feel swelling or pain in your body when you get tired. Try massaging your body with warm oil to get rid of pain and get excessive comfort.
Stay Active Your body gets easily tired and exhausted during the last months of pregnancy when you are carrying a heavy bump with you. Staying active is very important as it will make you lazy and unwell sitting in one place. Do Exercise a little with no exertion, take frequent breaks in between your exercise but stay moving.
Make out time for yourself During pregnancy, it is very important to make yourself your only priority. Give extra care to your physical and mental health. The most important thing during this precious time is to stay happy mentally which will keep you and your baby both well. There is a lot to manage during but always have a strict 'You' time.
Do not exhaust yourself When you are pregnant, you are carrying extra weight/bump to your body which will obviously make you feel more exhausted during work or heavy workouts than usual. Avoid exhausting your body, stay calm even during exercise, do not try high energy demanding exercises which may easily fall out on your energy.
Meditation is very important during the time of pregnancy. With all chaos, curiosity and discomfort around your mental health will decrease making you feel unhappy at times. Meditation is the easy key to relaxing your brain and boosting your mental well-being.
Travelling during pregnancy Traveling during pregnancy needs more attention and care. You should always carry your own food, drinks, and other necessary items you know will be required during your journey.
Sleep well and on time Pregnancy leads to excessive tiredness as you are carrying one more soul, your body needs rest both mentally and physically. You will face difficulties in sleeping during pregnancy due to discomfort, belly, pain, and other changes which have been undergone within your body during these 9 months but proper rest is important for your body.
Have small breaks for meals At the time of pregnancy, your body needs extra attention and it gets tired easily. Have a small break in between your daily routine to have healthy meals. Always keep easy munching snacks with you so you can take them easily without putting extra effort for which you may feel lazy. | english |
carry on to boost, to guarantee products excellent in line with market and consumer standard specifications. Our enterprise has a quality assurance system are actually established for men summer two pieces set, Puffer Jacket , Criss Cross Sports Bra , Quick Dry Beach Shorts ,Latex Bikini Swimwear . We believe we will become a leader in developing and producing high quality products in both Chinese and international markets. We hope to cooperate with more friends for mutual benefits. The product will supply to all over the world, such as Europe, America, Australia,Canberra , Lithuania ,Ecuador , Canberra .With strong technical strength and advanced production equipment, and SMS people purposefully , professional, dedicated spirit of enterprise. Enterprises took the lead through the ISO 9001:2008 international quality management system certification, CE certification EU ; CCC.SGS.CQC other related product certification. We look forward to reactivating our company connection.
| english |
Photography requires a combination of skill, technique, and proper gear to capture fast-paced action with detail. When it comes to gear, picking the right Lens for your camera is crucial for achieving high-quality pictures. For this, Canon M50 lenses are undoubtedly great choices for photographers.
Well! For Canon M50 camera users, there are several lenses available in the market. Each has its own features and capabilities. In this article, we will explore some best Canon M50 lenses, taking into consideration factors such as aperture, focal length, autofocus, etc.
Whether you’re shooting indoor or outdoor sports or action-packed events, this guide will help you choose the right lens for Canon M50 and also the M50 Mark II camera. In our earlier post, we also reviewed the best lens for sports photography from different brands and models. You may check and get details about the items.
In this section, you’ll find a shortlist of the best lens for Canon M50, taking into consideration crucial factors. From telephoto zooms to wide-angle primes, we’ve got you covered. So, let’s dive in and find the best lens in this genre.
The Canon EF-M 55-200mm is an excellent choice for sports and action photoshoots for its compact, lightweight, and versatile telephoto zoom lens. It offers a focal length of 55–200mm and a maximum aperture of f/4.5–6.3, making it suitable for capturing action shots from a distance.
This is among the Canon M50 and M50 Mark II compatible lenses that are equipped with image stabilization technology. It helps to minimize camera shake and produce sharp, clear images even when shooting handheld. Besides sports, it’s also perfect for portraits and architecture photography.
- A compact zoom lens that brings distant subjects closer.
- Includes optical image stabilizer to protect against the blur.
- Offers Stepping Motor (STM) technology that removes unwanted focusing noise and distraction.
- Quickly adjustable with a manual focus ring.
- Easy to carry and also performs well in low-light conditions.
Introducing a premium mirrorless camera lens to shoot fantastic portraits, candids, and sports. The lens features a large f/1.4 maximum aperture with a smooth and precise focus ring. Its design is made up of 14 elements in 8 groups for superb detail and edge. That’s why it’s also a good choice for macro photographers.
One of the crucial features of Canon EF-M 32mm f/1.4 STM is it’s being built with Super Spectra Coatings that help preserve the color accuracy of pictures. In a word, it’s a solid and highly compatible lens with great low-light capability, brilliant bokeh, and excellent Canon colors.
- Large f/1.4 maximum aperture for beautiful bokeh and low-light performance.
- 32mm focal length, ideal for portraits and sports photography.
- STM (Stepping Motor) technology for quiet and smooth focus transitions during video recording.
- Compatible with Canon EOS M mirrorless cameras.
- High-quality build and picture quality for outstanding shots.
So, are you ready to experience your action photography with this versatile 18-150mm, 8.3x optical zoom lens? Well! This time, we come with EF-M 18-150mm f/3.5-6.3 IS STM Lens from Canon.
This Canon M50 lens includes its 4-stop image stabilization technology to reduce camera shake. Thus it helps to produce sharp, clear images even in low-light environments.
- Offers a stunning zoom range with a ratio of up to 8.3x.
- Includes 7-bladed circular aperture to shoot with smooth background blur.
- STM (Stepping Motor) technology for smooth and quiet autofocus.
- Offers 55mm filters that allow you to experiment with color and light.
- Provides a compact and lightweight design (300g weighs and 86.5mm in length) for easy portability.
Being compatible with Canon M50, Sigma 56mm f/1.4 DC DN Contemporary can be a good choice to shoot with incredible sharpness. It offers an ultra-fast F1.4 maximum aperture, which suits working in low light and difficult lighting conditions.
This Canon M50 and M50 Mark II lens is perfectly suitable for independent filmmakers, photographers, YouTubers, streamers, vloggers, and more. With all the advanced features, you can pick this great lens for street, sports, and everyday photoshoots.
- Offers high-precision along with dust and splash resistant mount.
- Multi-layer coating helps to minimize flare and ghosting.
- Provides improved control over depth of field to isolate subjects and work with particular focus techniques.
- Highly compatible with different brands, including Fujifilm X, Canon EF-M, and Micro Four Thirds.
The Canon EF 70-200mm f/4L IS II USM is another top telephoto zoom lens intended to provide excellent optical performance for professional photographers. The lens is built with a high-quality construction that features a sustainable and weather-resistant design.
Having a focal length range of 70-200mm, it’s ideal for capturing distant subjects and zooming in for close-up shots. It also has image stabilization technology that makes the pictures sharp and clear, even when shooting at slower shutter speeds.
- Focal length range of 70-200mm with Maximum aperture of f/4.
- 5-stop Image Stabilizer for reduced camera shake.
- Ultrasonic Motor (USM) for fast and accurate autofocus.
- Durable, weather-resistant design.
- Compatible with most Canon EOS cameras.
The Sigma 150-600mm f/5-6.3 DG OS HSM is a versatile telephoto zoom lens that is well-suited for nature, wildlife, and event photography. It offers a focal length range of 150-600mm making it perfect for capturing distant subjects with incredible detail.
Besides, the f/5-6.3 maximum aperture allows for excellent light-gathering capabilities, even in low-light conditions. Furthermore, the lens also has a Hyper Sonic Motor (HSM) that delivers fast and accurate autofocus performance.
- A versatile lens with high usability and outstanding optical performance.
- Optical Stabilizer (OS) for reduced camera shake.
- Customizable zoom lock switch.
- Minimum focusing distance of 2.8m.
- Compatible with full-frame and APS-C DSLRs.
Once again. introducing high-quality and one of the best lenses for canon m50- Canon EF 300mm f/4L IS USM. This telephoto lens is specially designed for professional photographers who require a fast and reliable lens for wildlife and sports photography. Being the autofocus quiet, it doesn’t disturb the subject or the event shooting the objects.
One of the key features of this lens is its construction. It’s made of high-quality materials that are durable as well as weather-resistant. This makes it ideal for outdoor photography, as it can withstand harsh weather conditions and accidental drops.
- Focal length of 300mm with Maximum aperture of f/4.
- Image Stabilizer (IS) for reduced camera shake.
- Ultra Sonic Motor (USM) for fast and accurate autofocus.
- Provides customizable focus preset.
- Compatible with most Canon EOS cameras.
When choosing a lens for action, outdoor, or sports photography, there are several key factors to consider. These factors will determine the lens’s suitability for capturing fast-moving action and producing sharp, detailed images.
Aperture: A wider aperture (lower f-number) allows more light to enter the lens, which is important for capturing fast-moving action in low-light conditions. It also creates a shallower depth of field. This can help isolate the subject from the background and create a more dramatic effect.
Focal length: A longer focal length is generally better for action or sports photoshoots as it allows you to get closer to the action without physically moving closer. A lens with a zoom range of 70-200mm or longer is ideal for sports photography.
Image stabilization: This factor helps reduce camera shake and blur, which can be a common problem when shooting outdoors. A lens with image stabilization (IS) or vibration reduction (VR) can help ensure sharp, clear images even when shooting handheld.
Autofocus: Fast and accurate autofocus is crucial for action photography as it enables you to capture fast-moving subjects with precision. Look for lenses with fast and responsive autofocus systems that can track subjects and maintain focus even when they move across the frame.
Build quality: Shooting outdoors can be tough on equipment. So it’s crucial to select a lens that is built to shoot in challenging conditions. Look for lenses that are weather-sealed, dust-resistant, and made of high-quality materials.
No doubt, Canon M50 is a powerful and versatile mirrorless camera that suits any type of photography and can deliver stunning photographs. When it comes to lens selection, there are plenty of options available, but choosing the right one can be a daunting task.
However, with the right lens, you can take your photography to the next level and capture the perfect shot every time. So, we have highlighted a list of the best lens for Canon M50 that is ideal for sports, portraits, events, and everyday photography.
Whether you are a professional photographer or a hobbyist, these lenses will surely assist you to achieve fantastic results and take your photography to new heights.
So, go ahead and pick your favorite Canon M50 lens and get ready to capture some amazing shots!
The post Canon M50 Lenses: Top Picks for Sports and Everyday Photography appeared first on Color Experts International.
| english |
New American Bible (Revised Edition)
15 (A)Then the Pharisees[a] went off and plotted how they might entrap him in speech. 16 They sent their disciples to him, with the Herodians,[b] saying, “Teacher, we know that you are a truthful man and that you teach the way of God in accordance with the truth. And you are not concerned with anyone’s opinion, for you do not regard a person’s status. 17 [c]Tell us, then, what is your opinion: Is it lawful to pay the census tax to Caesar or not?” 18 Knowing their malice, Jesus said, “Why are you testing me, you hypocrites? 19 [d]Show me the coin that pays the census tax.” Then they handed him the Roman coin. 20 He said to them, “Whose image is this and whose inscription?” 21 (B)They replied, “Caesar’s.”[e] At that he said to them, “Then repay to Caesar what belongs to Caesar and to God what belongs to God.” 22 When they heard this they were amazed, and leaving him they went away.
The Question About the Resurrection.[f] 23 (C)On that day Sadducees approached him, saying that there is no resurrection.[g] They put this question to him, 24 (D)saying, “Teacher, Moses said, ‘If a man dies[h] without children, his brother shall marry his wife and raise up descendants for his brother.’ 25 Now there were seven brothers among us. The first married and died and, having no descendants, left his wife to his brother. 26 The same happened with the second and the third, through all seven. 27 Finally the woman died. 28 Now at the resurrection, of the seven, whose wife will she be? For they all had been married to her.” 29 [i]Jesus said to them in reply, “You are misled because you do not know the scriptures or the power of God. 30 At the resurrection they neither marry nor are given in marriage but are like the angels in heaven. 31 And concerning the resurrection of the dead, have you not read what was said to you[j] by God, 32 (E)‘I am the God of Abraham, the God of Isaac, and the God of Jacob’? He is not the God of the dead but of the living.” 33 When the crowds heard this, they were astonished at his teaching.
- 22:15 The Pharisees: while Matthew retains the Marcan union of Pharisees and Herodians in this account, he clearly emphasizes the Pharisees’ part. They alone are mentioned here, and the Herodians are joined with them only in a prepositional phrase of Mt 22:16. Entrap him in speech: the question that they will pose is intended to force Jesus to take either a position contrary to that held by the majority of the people or one that will bring him into conflict with the Roman authorities.
- 22:16 Herodians: see note on Mk 3:6. They would favor payment of the tax; the Pharisees did not.
- 22:17 Is it lawful: the law to which they refer is the law of God.
- 22:19 They handed him the Roman coin: their readiness in producing the money implies their use of it and their acceptance of the financial advantages of the Roman administration in Palestine.
- 22:21 Caesar’s: the emperor Tiberius (A.D. 14–37). Repay to Caesar what belongs to Caesar: those who willingly use the coin that is Caesar’s should repay him in kind. The answer avoids taking sides in the question of the lawfulness of the tax. To God what belongs to God: Jesus raises the debate to a new level. Those who have hypocritically asked about tax in respect to its relation to the law of God should be concerned rather with repaying God with the good deeds that are his due; cf. Mt 21:41, 43.
- 22:23–33 Here Jesus’ opponents are the Sadducees, members of the powerful priestly party of his time; see note on Mt 3:7. Denying the resurrection of the dead, a teaching of relatively late origin in Judaism (cf. Dn 12:2), they appeal to a law of the Pentateuch (Dt 25:5–10) and present a case based on it that would make resurrection from the dead ridiculous (Mt 22:24–28). Jesus chides them for knowing neither the scriptures nor the power of God (Mt 22:29). His argument in respect to God’s power contradicts the notion, held even by many proponents as well as by opponents of the teaching, that the life of those raised from the dead would be essentially a continuation of the type of life they had had before death (Mt 22:30). His argument based on the scriptures (Mt 22:31–32) is of a sort that was accepted as valid among Jews of the time.
- 22:23 Saying that there is no resurrection: in the Marcan parallel (Mk 22:12, 18) the Sadducees are correctly defined as those “who say there is no resurrection”; see also Lk 20:27. Matthew’s rewording of Mark can mean that these particular Sadducees deny the resurrection, which would imply that he was not aware that the denial was characteristic of the party. For some scholars this is an indication of his being a Gentile Christian; see note on Mt 21:4–5.
- 22:24 ‘If a man dies…his brother’: this is known as the “law of the levirate,” from the Latin levir, “brother-in-law.” Its purpose was to continue the family line of the deceased brother (Dt 25:6).
- 22:29 The sexual relationships of this world will be transcended; the risen body will be the work of the creative power of God.
- 22:31–32 Cf. Ex 3:6. In the Pentateuch, which the Sadducees accepted as normative for Jewish belief and practice, God speaks even now (to you) of himself as the God of the patriarchs who died centuries ago. He identifies himself in relation to them, and because of their relation to him, the living God, they too are alive. This might appear no argument for the resurrection, but simply for life after death as conceived in Wis 3:1–3. But the general thought of early first-century Judaism was not influenced by that conception; for it human immortality was connected with the existence of the body.
- 22:34–40 The Marcan parallel (Mk 12:28–34) is an exchange between Jesus and a scribe who is impressed by the way in which Jesus has conducted himself in the previous controversy (Mk 12:28), who compliments him for the answer he gives him (Mk 12:32), and who is said by Jesus to be “not far from the kingdom of God” (Mk 12:34). Matthew has sharpened that scene. The questioner, as the representative of other Pharisees, tests Jesus by his question (Mt 22:34–35), and both his reaction to Jesus’ reply and Jesus’ commendation of him are lacking.
New American Bible (Revised Edition)
20 [a]They watched him closely and sent agents pretending to be righteous who were to trap him in speech,(A) in order to hand him over to the authority and power of the governor. 21 They posed this question to him, “Teacher, we know that what you say and teach is correct, and you show no partiality, but teach the way of God in accordance with the truth.(B) 22 Is it lawful for us to pay tribute to Caesar or not?”[b] 23 Recognizing their craftiness he said to them, 24 “Show me a denarius;[c] whose image and name does it bear?” They replied, “Caesar’s.” 25 So he said to them, “Then repay to Caesar what belongs to Caesar and to God what belongs to God.”(C) 26 They were unable to trap him by something he might say before the people, and so amazed were they at his reply that they fell silent.
- 20:20 The governor: i.e., Pontius Pilate, the Roman administrator responsible for the collection of taxes and maintenance of order in Palestine.
- 20:22 Through their question the agents of the Jerusalem religious leadership hope to force Jesus to take sides on one of the sensitive political issues of first-century Palestine. The issue of nonpayment of taxes to Rome becomes one of the focal points of the First Jewish Revolt (A.D. 66–70) that resulted in the Roman destruction of Jerusalem and the temple. See also note on Mt 22:15–22.
- 20:24 Denarius: a Roman silver coin (see note on Lk 7:41).
- 20:27 Sadducees: see note on Mt 3:7.
- 20:28–33 The Sadducees’ question, based on the law of levirate marriage recorded in Dt 25:5–10, ridicules the idea of the resurrection. Jesus rejects their naive understanding of the resurrection (Lk 20:35–36) and then argues on behalf of the resurrection of the dead on the basis of the written law (Lk 20:37–38) that the Sadducees accept. See also notes on Mt 22:23–33.
Scripture texts, prefaces, introductions, footnotes and cross references used in this work are taken from the New American Bible, revised edition © 2010, 1991, 1986, 1970 Confraternity of Christian Doctrine, Inc., Washington, DC All Rights Reserved. No part of this work may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying, recording, or by any information storage and retrieval system, without permission in writing from the copyright owner.
| english |
<gh_stars>0
function p2kwiet2060628854583_button1927508755138051_onClick_seq0(eventobject) {
frmCameraBasic.show();
frmCameraBasic.lblCamBasic.text = ""
} | javascript |
Following the deadly clashes between the Indian and Chinese soldiers at the Galwan Valley, there is a growing perception that behind China’s assertiveness, lies an increasing power differential between Beijing and New Delhi. While this line of reasoning is correct, it masks the means through which China has managed to amass such hard military power.
It is the difference between the comprehensive military reforms carried out in China under President Xi Jinping and the rather shallow ones under Prime Minister Narendra Modi that explains why China today feels confident to deploy forces across multiple fronts at the LAC, and demonstrate the kind of aggression not seen since the 1960s.
Since coming to power in 2012, Xi Jinping has managed to usher in large-scale military modernisation and fundamentally transform the organisational structure and governance of the People’s Liberation Army (PLA). In comparison, the military reforms carried out under PM Modi have not only been meagre, but Indian military has also seen the gulf between its intent and capabilities widen like never before. Under Xi, the Chinese military has grown substantially more powerful than its Indian counterpart.
The perception that China’s authoritarian character makes reforms easier, doesn’t really apply to matters of the military. If in India, Modi has struggled to trim down the size of the Army, because increasingly, more soldiers hail from electorally vital states such as Uttar Pradesh (Army and Nation by Steven I. Wilkinson), in authoritarian China, the very regime depends on the military for its survival.
Yet, unlike Modi, Xi decided to bite the bullet and purge all the vested interest groups in the military establishment that had been restricting reforms. While Xi matched his words with actions, Modi decided to settle for electoral success backing on ‘muscular’ rhetoric. Genuine hard power and a sustainable military strategy requires spending money, and today, India’s somewhat territorial capitulation to China stems from Modi not acknowledging that basic fact.
Authoritarian governments rely on their armies to stay in power. And in China, if the Communist Party general secretary and the President – the de facto head of the country – fails to reign in the military, then he will be held hostage to those who exercise control over it. This was evident during the tenure of previous Chinese President Hu Jintao’s term (2002-12), where it is said that his predecessor Jiang Zemin (1992-2002) essentially managed the military – making Hu a mere figurehead.
“Having observed Hu’s fate, Xi moved to purge the military of Jiang’s remaining influence using the anti-corruption campaign, and bring the PLA more fully under his control,” writes Don Tse, chief executive officer and co-founder of SinoInsider Consulting LLC.
Xi is unique because he is the first leader after Deng Xiaoping to actually head the Central Military Commission (CMC) – the country’s top-defence decision-making body – giving him complete control over military affairs, making him a “paramount leader”.
What followed were a series of comprehensive military reforms. “Xi has focused on making big, structural changes. Among his most significant reforms are new joint theater commands, deep personnel cuts, and improvements to military-civilian collaboration. He is pushing to transform the PLA from a largely territorial force into a major maritime power,” notes a report by Council on Foreign Relations.
Some of Xi’s reforms are worth recounting.
First, the very structure of CMC was dismantled. Its four general departments were replaced by 15 smaller ones, thus ending the control of existing interest groups in the military complex. Until then, these four departments clumsily ran China’s military, but they were now going to come under the direct command of CMC chairman – Xi.
Second, separate operational and administrative commands were established. Five new joint Theatre Commands replaced the seven existing Military Regions (MRs). Here, unlike the Military Regions – which had jurisdiction over mostly the army – the Theatre Commands enjoyed operational autonomy over all the three services. A Joint Logistics Support Force was also created to aid the Theatre Commands. Now, the sole responsibility of these Theatre Commands was to command joint operations during combat, leaving training and administrative work to the respective service headquarters.
In terms of specific services, the PLA has undergone major transformation. Xi’s goal to turn China’s military, from a quantity-based force to a quality-based one, has meant that the size of the army has shrunk by nearly 1 million troops, according to International Institute for Strategic Studies (IISS). Moreover, not only has the army been given more modern equipment, but there is also focus on creating smaller units – away from the “top-heavy command structure”.
The Chinese navy under Xi has expanded at an unprecedented rate, making it the largest naval force in the world. In 2016, Chinese navy commissioned 18 ships as compared to five by the US. According to Rand Corporation, about 70 per cent of Chinese fleet could be considered “modern” in 2017, compared to less than 50 per cent in 2010.
More reforms involved the upgrading of Rocket Force – which manages the country’s conventional and nuclear missiles – to an independent service, and creating a Strategic Support Force that now manages China’s electronic, cyber, and psychological operations.
When it comes to military policy, Modi’s leadership over the past six years has had three significant features.
First, India’s defence spending as a share of the GDP has fallen over the past 20 years, a trend that has continued during Modi’s tenure, regardless of his pro-national security image.
Second has been the execution of politically rewarding, but fiscally disastrous, One Rank One Pension policy. As security researcher Abhijnan Rej notes, this has led to a “preponderance of unproductive military allocations on salaries and such over productive ones as new weapons and platforms. ” Thus, as salaries and pensions continue to rise, the defence budget increasingly has lesser space to spend on modernisation. Contrast this with China trimming down its military by nearly a million.
Third has been the creation of Chief of Defence staff, which though a landmark reform by itself, pales in comparison to the kind of fundamental shifts that have been taken in China.
The main problem with India’s military has been the inability of the political leadership to cut the size of the Army and use those resources for modernisation. Often, a shift from status quo is politically tedious—but so is the situation up in the Himalayas. And if Modi genuinely wants a long-term solution to the China problem, he might actually benefit by looking at the Xi playbook.
Views are personal. | english |
// eslint-disable-next-line import/no-extraneous-dependencies
import { DEBUG } from '@glimmer/env';
import { LOCAL_DEBUG } from '@glimmer/local-debug-flags';
import { assertNever } from '@glimmer/util';
import {
BROKEN_LOCATION,
NON_EXISTENT_LOCATION,
SourceLocation,
SourcePosition,
} from '../location';
import { SourceSlice } from '../slice';
import { Source } from '../source';
import { IsInvisible, match, MatchAny, MatchFn } from './match';
import {
AnyPosition,
BROKEN,
CharPosition,
HbsPosition,
InvisiblePosition,
OffsetKind,
SourceOffset,
} from './offset';
/**
* All spans have these details in common.
*/
interface SpanData {
readonly kind: OffsetKind;
/**
* Convert this span into a string. If the span is broken, return `''`.
*/
asString(): string;
/**
* Gets the module the span was located in.
*/
getModule(): string;
/**
* Get the starting position for this span. Try to avoid creating new position objects, as they
* cache computations.
*/
getStart(): AnyPosition;
/**
* Get the ending position for this span. Try to avoid creating new position objects, as they
* cache computations.
*/
getEnd(): AnyPosition;
/**
* Compute the `SourceLocation` for this span, returned as an instance of `HbsSpan`.
*/
toHbsSpan(): HbsSpan | null;
/**
* For compatibility, whenever the `start` or `end` of a {@see SourceOffset} changes, spans are
* notified of the change so they can update themselves. This shouldn't happen outside of AST
* plugins.
*/
locDidUpdate(changes: { start?: SourcePosition; end?: SourcePosition }): void;
/**
* Serialize into a {@see SerializedSourceSpan}, which is compact and designed for readability in
* context like AST Explorer. If you need a {@see SourceLocation}, use {@see toJSON}.
*/
serialize(): SerializedSourceSpan;
}
/**
* A `SourceSpan` object represents a span of characters inside of a template source.
*
* There are three kinds of `SourceSpan` objects:
*
* - `ConcreteSourceSpan`, which contains byte offsets
* - `LazySourceSpan`, which contains `SourceLocation`s from the Handlebars AST, which can be
* converted to byte offsets on demand.
* - `InvisibleSourceSpan`, which represent source strings that aren't present in the source,
* because:
* - they were created synthetically
* - their location is nonsensical (the span is broken)
* - they represent nothing in the source (this currently happens only when a bug in the
* upstream Handlebars parser fails to assign a location to empty blocks)
*
* At a high level, all `SourceSpan` objects provide:
*
* - byte offsets
* - source in column and line format
*
* And you can do these operations on `SourceSpan`s:
*
* - collapse it to a `SourceSpan` representing its starting or ending position
* - slice out some characters, optionally skipping some characters at the beginning or end
* - create a new `SourceSpan` with a different starting or ending offset
*
* All SourceSpan objects implement `SourceLocation`, for compatibility. All SourceSpan
* objects have a `toJSON` that emits `SourceLocation`, also for compatibility.
*
* For compatibility, subclasses of `AbstractSourceSpan` must implement `locDidUpdate`, which
* happens when an AST plugin attempts to modify the `start` or `end` of a span directly.
*
* The goal is to avoid creating any problems for use-cases like AST Explorer.
*/
export class SourceSpan implements SourceLocation {
static get NON_EXISTENT(): SourceSpan {
return new InvisibleSpan(OffsetKind.NonExistent, NON_EXISTENT_LOCATION).wrap();
}
static load(source: Source, serialized: SerializedSourceSpan): SourceSpan {
if (typeof serialized === 'number') {
return SourceSpan.forCharPositions(source, serialized, serialized);
} else if (typeof serialized === 'string') {
return SourceSpan.synthetic(serialized);
} else if (Array.isArray(serialized)) {
return SourceSpan.forCharPositions(source, serialized[0], serialized[1]);
} else if (serialized === OffsetKind.NonExistent) {
return SourceSpan.NON_EXISTENT;
} else if (serialized === OffsetKind.Broken) {
return SourceSpan.broken(BROKEN_LOCATION);
}
assertNever(serialized);
}
static forHbsLoc(source: Source, loc: SourceLocation): SourceSpan {
let start = new HbsPosition(source, loc.start);
let end = new HbsPosition(source, loc.end);
return new HbsSpan(source, { start, end }, loc).wrap();
}
static forCharPositions(source: Source, startPos: number, endPos: number): SourceSpan {
let start = new CharPosition(source, startPos);
let end = new CharPosition(source, endPos);
return new CharPositionSpan(source, { start, end }).wrap();
}
static synthetic(chars: string): SourceSpan {
return new InvisibleSpan(OffsetKind.InternalsSynthetic, NON_EXISTENT_LOCATION, chars).wrap();
}
static broken(pos: SourceLocation = BROKEN_LOCATION): SourceSpan {
return new InvisibleSpan(OffsetKind.Broken, pos).wrap();
}
readonly isInvisible: boolean;
constructor(private data: SpanData & AnySpan) {
this.isInvisible =
data.kind !== OffsetKind.CharPosition && data.kind !== OffsetKind.HbsPosition;
}
getStart(): SourceOffset {
return this.data.getStart().wrap();
}
getEnd(): SourceOffset {
return this.data.getEnd().wrap();
}
get loc(): SourceLocation {
let span = this.data.toHbsSpan();
return span === null ? BROKEN_LOCATION : span.toHbsLoc();
}
get module(): string {
return this.data.getModule();
}
/**
* Get the starting `SourcePosition` for this `SourceSpan`, lazily computing it if needed.
*/
get startPosition(): SourcePosition {
return this.loc.start;
}
/**
* Get the ending `SourcePosition` for this `SourceSpan`, lazily computing it if needed.
*/
get endPosition(): SourcePosition {
return this.loc.end;
}
/**
* Support converting ASTv1 nodes into a serialized format using JSON.stringify.
*/
toJSON(): SourceLocation {
return this.loc;
}
/**
* Create a new span with the current span's end and a new beginning.
*/
withStart(other: SourceOffset): SourceSpan {
return span(other.data, this.data.getEnd());
}
/**
* Create a new span with the current span's beginning and a new ending.
*/
withEnd(this: SourceSpan, other: SourceOffset): SourceSpan {
return span(this.data.getStart(), other.data);
}
asString(): string {
return this.data.asString();
}
/**
* Convert this `SourceSpan` into a `SourceSlice`. In debug mode, this method optionally checks
* that the byte offsets represented by this `SourceSpan` actually correspond to the expected
* string.
*/
toSlice(expected?: string): SourceSlice {
let chars = this.data.asString();
if (DEBUG) {
if (expected !== undefined && chars !== expected) {
// eslint-disable-next-line no-console
console.warn(
`unexpectedly found ${JSON.stringify(
chars
)} when slicing source, but expected ${JSON.stringify(expected)}`
);
}
}
return new SourceSlice({
loc: this,
chars: expected || chars,
});
}
/**
* For compatibility with SourceLocation in AST plugins
*
* @deprecated use startPosition instead
*/
get start(): SourcePosition {
return this.loc.start;
}
/**
* For compatibility with SourceLocation in AST plugins
*
* @deprecated use withStart instead
*/
set start(position: SourcePosition) {
this.data.locDidUpdate({ start: position });
}
/**
* For compatibility with SourceLocation in AST plugins
*
* @deprecated use endPosition instead
*/
get end(): SourcePosition {
return this.loc.end;
}
/**
* For compatibility with SourceLocation in AST plugins
*
* @deprecated use withEnd instead
*/
set end(position: SourcePosition) {
this.data.locDidUpdate({ end: position });
}
/**
* For compatibility with SourceLocation in AST plugins
*
* @deprecated use module instead
*/
get source(): string {
return this.module;
}
collapse(where: 'start' | 'end'): SourceSpan {
switch (where) {
case 'start':
return this.getStart().collapsed();
case 'end':
return this.getEnd().collapsed();
}
}
extend(other: SourceSpan): SourceSpan {
return span(this.data.getStart(), other.data.getEnd());
}
serialize(): SerializedSourceSpan {
return this.data.serialize();
}
slice({ skipStart = 0, skipEnd = 0 }: { skipStart?: number; skipEnd?: number }): SourceSpan {
return span(this.getStart().move(skipStart).data, this.getEnd().move(-skipEnd).data);
}
sliceStartChars({ skipStart = 0, chars }: { skipStart?: number; chars: number }): SourceSpan {
return span(this.getStart().move(skipStart).data, this.getStart().move(skipStart + chars).data);
}
sliceEndChars({ skipEnd = 0, chars }: { skipEnd?: number; chars: number }): SourceSpan {
return span(this.getEnd().move(skipEnd - chars).data, this.getStart().move(-skipEnd).data);
}
}
type AnySpan = HbsSpan | CharPositionSpan | InvisibleSpan;
class CharPositionSpan implements SpanData {
readonly kind = OffsetKind.CharPosition;
#locPosSpan: HbsSpan | BROKEN | null = null;
constructor(
readonly source: Source,
readonly charPositions: { start: CharPosition; end: CharPosition }
) {}
wrap(): SourceSpan {
return new SourceSpan(this);
}
asString(): string {
return this.source.slice(this.charPositions.start.charPos, this.charPositions.end.charPos);
}
getModule(): string {
return this.source.module;
}
getStart(): AnyPosition {
return this.charPositions.start;
}
getEnd(): AnyPosition {
return this.charPositions.end;
}
locDidUpdate() {
if (LOCAL_DEBUG) {
// eslint-disable-next-line no-console
console.warn(
`updating a location that came from a CharPosition span doesn't work reliably. Don't try to update locations after the plugin phase`
);
}
}
toHbsSpan(): HbsSpan | null {
let locPosSpan = this.#locPosSpan;
if (locPosSpan === null) {
let start = this.charPositions.start.toHbsPos();
let end = this.charPositions.end.toHbsPos();
if (start === null || end === null) {
locPosSpan = this.#locPosSpan = BROKEN;
} else {
locPosSpan = this.#locPosSpan = new HbsSpan(this.source, {
start,
end,
});
}
}
return locPosSpan === BROKEN ? null : locPosSpan;
}
serialize(): SerializedSourceSpan {
let {
start: { charPos: start },
end: { charPos: end },
} = this.charPositions;
if (start === end) {
return start;
} else {
return [start, end];
}
}
toCharPosSpan(): CharPositionSpan {
return this;
}
}
export class HbsSpan implements SpanData {
readonly kind = OffsetKind.HbsPosition;
#charPosSpan: CharPositionSpan | BROKEN | null = null;
// the source location from Handlebars + AST Plugins -- could be wrong
#providedHbsLoc: SourceLocation | null;
constructor(
readonly source: Source,
readonly hbsPositions: { start: HbsPosition; end: HbsPosition },
providedHbsLoc: SourceLocation | null = null
) {
this.#providedHbsLoc = providedHbsLoc;
}
serialize(): SerializedConcreteSourceSpan {
let charPos = this.toCharPosSpan();
return charPos === null ? OffsetKind.Broken : charPos.wrap().serialize();
}
wrap(): SourceSpan {
return new SourceSpan(this);
}
private updateProvided(pos: SourcePosition, edge: 'start' | 'end') {
if (this.#providedHbsLoc) {
this.#providedHbsLoc[edge] = pos;
}
// invalidate computed character offsets
this.#charPosSpan = null;
this.#providedHbsLoc = {
start: pos,
end: pos,
};
}
locDidUpdate({ start, end }: { start?: SourcePosition; end?: SourcePosition }): void {
if (start !== undefined) {
this.updateProvided(start, 'start');
this.hbsPositions.start = new HbsPosition(this.source, start, null);
}
if (end !== undefined) {
this.updateProvided(end, 'end');
this.hbsPositions.end = new HbsPosition(this.source, end, null);
}
}
asString(): string {
let span = this.toCharPosSpan();
return span === null ? '' : span.asString();
}
getModule(): string {
return this.source.module;
}
getStart(): AnyPosition {
return this.hbsPositions.start;
}
getEnd(): AnyPosition {
return this.hbsPositions.end;
}
toHbsLoc(): SourceLocation {
return {
start: this.hbsPositions.start.hbsPos,
end: this.hbsPositions.end.hbsPos,
};
}
toHbsSpan(): HbsSpan {
return this;
}
toCharPosSpan(): CharPositionSpan | null {
let charPosSpan = this.#charPosSpan;
if (charPosSpan === null) {
let start = this.hbsPositions.start.toCharPos();
let end = this.hbsPositions.end.toCharPos();
if (start && end) {
charPosSpan = this.#charPosSpan = new CharPositionSpan(this.source, {
start,
end,
});
} else {
charPosSpan = this.#charPosSpan = BROKEN;
return null;
}
}
return charPosSpan === BROKEN ? null : charPosSpan;
}
}
class InvisibleSpan implements SpanData {
constructor(
readonly kind: OffsetKind.Broken | OffsetKind.InternalsSynthetic | OffsetKind.NonExistent,
// whatever was provided, possibly broken
readonly loc: SourceLocation,
// if the span represents a synthetic string
readonly string: string | null = null
) {}
serialize(): SerializedConcreteSourceSpan {
switch (this.kind) {
case OffsetKind.Broken:
case OffsetKind.NonExistent:
return this.kind;
case OffsetKind.InternalsSynthetic:
return this.string || '';
}
}
wrap(): SourceSpan {
return new SourceSpan(this);
}
asString(): string {
return this.string || '';
}
locDidUpdate({ start, end }: { start?: SourcePosition; end?: SourcePosition }) {
if (start !== undefined) {
this.loc.start = start;
}
if (end !== undefined) {
this.loc.end = end;
}
}
getModule(): string {
// TODO: Make this reflect the actual module this span originated from
return 'an unknown module';
}
getStart(): AnyPosition {
return new InvisiblePosition(this.kind, this.loc.start);
}
getEnd(): AnyPosition {
return new InvisiblePosition(this.kind, this.loc.end);
}
toCharPosSpan(): InvisibleSpan {
return this;
}
toHbsSpan(): null {
return null;
}
toHbsLoc(): SourceLocation {
return BROKEN_LOCATION;
}
}
export const span: MatchFn<SourceSpan> = match((m) =>
m
.when(OffsetKind.HbsPosition, OffsetKind.HbsPosition, (left, right) =>
new HbsSpan(left.source, {
start: left,
end: right,
}).wrap()
)
.when(OffsetKind.CharPosition, OffsetKind.CharPosition, (left, right) =>
new CharPositionSpan(left.source, {
start: left,
end: right,
}).wrap()
)
.when(OffsetKind.CharPosition, OffsetKind.HbsPosition, (left, right) => {
let rightCharPos = right.toCharPos();
if (rightCharPos === null) {
return new InvisibleSpan(OffsetKind.Broken, BROKEN_LOCATION).wrap();
} else {
return span(left, rightCharPos);
}
})
.when(OffsetKind.HbsPosition, OffsetKind.CharPosition, (left, right) => {
let leftCharPos = left.toCharPos();
if (leftCharPos === null) {
return new InvisibleSpan(OffsetKind.Broken, BROKEN_LOCATION).wrap();
} else {
return span(leftCharPos, right);
}
})
.when(IsInvisible, MatchAny, (left) => new InvisibleSpan(left.kind, BROKEN_LOCATION).wrap())
.when(MatchAny, IsInvisible, (_, right) =>
new InvisibleSpan(right.kind, BROKEN_LOCATION).wrap()
)
);
export type SerializedConcreteSourceSpan =
| /** collapsed */ number
| /** normal */ [start: number, size: number]
| /** synthetic */ string;
export type SerializedSourceSpan =
| SerializedConcreteSourceSpan
| OffsetKind.NonExistent
| OffsetKind.Broken;
| typescript |
package com.ctrip.xpipe.redis.console.controller.consoleportal;
import com.ctrip.xpipe.redis.checker.controller.result.RetMessage;
import com.ctrip.xpipe.redis.console.controller.AbstractConsoleController;
import com.ctrip.xpipe.redis.console.service.RouteService;
import com.ctrip.xpipe.utils.StringUtil;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.web.bind.annotation.PathVariable;
import org.springframework.web.bind.annotation.RequestMapping;
import org.springframework.web.bind.annotation.RequestMethod;
import org.springframework.web.bind.annotation.RestController;
@RestController
@RequestMapping(AbstractConsoleController.CONSOLE_PREFIX)
public class RouteController extends AbstractConsoleController {
@Autowired
private RouteService routeService;
@RequestMapping(value = "/exist/route/active/{activeDc}/backup/{backupDc}", method = RequestMethod.GET)
public RetMessage existRoutes(@PathVariable String activeDc, @PathVariable String backupDc) {
logger.info("[existRoutes] {}, {}", activeDc, backupDc);
if(StringUtil.trimEquals(activeDc, backupDc, true)) {
return RetMessage.createFailMessage("false");
}
if(routeService.existsRouteBetweenDc(activeDc, backupDc)) {
return RetMessage.createSuccessMessage();
}
return RetMessage.createFailMessage("false");
}
@RequestMapping(value = "/exist/route/dc/{currentDc}/cluster/{clusterId}", method = RequestMethod.GET)
public RetMessage existPeerRoutes(@PathVariable String currentDc, @PathVariable String clusterId) {
logger.info("[existRoutes] {}, {}", currentDc, clusterId);
if(routeService.existPeerRoutes(currentDc, clusterId)) {
return RetMessage.createSuccessMessage();
}
return RetMessage.createFailMessage("false");
}
}
| java |
<gh_stars>0
import Vue from 'vue'
import Vuex from 'vuex'
import api from '../api'
Vue.use(Vuex);
const store = new Vuex.Store({
state: {
app:{
name:'Yet Another Laravel-SPA-Admin',
title:'Yet Another Laravel-SPA-Admin - Setting up'
},
user : {
username: '',
},
session: {
visited_tabs: []
},
system : {
roles: [],
menus: [],
apis : [],
}
},
mutations: {
save_user_info(state,payload){
state.user = payload;
},
flush_local_user_info(state){
state.user = {
username : undefined,
}
},
save_system_info(state,payload){
state.system = payload
},
},
actions: {
async login(context,form){
try {
await api.user.loginByUserNameAndPassword(form)
await this.dispatch('sync')
return Promise.resolve(true)
} catch(error){
return Promise.reject('user login failed')
}
},
async sync(context){
try {
let latest_info = await api.session.sync();
context.commit('save_user_info', latest_info.user);
context.commit('save_system_info' , latest_info.system);
return Promise.resolve(true)
} catch(error){
return Promise.reject('store: failed syncing user into store')
}
},
async logout(context){
try{
await api.user.logout();
context.commit('flush_local_user_info');
return Promise.resolve(true)
}catch(error){
return Promise.reject('store: failed logging out')
}
},
async flush_local_user_info(context){ // when user session expired, we need to flush user info in front end
try{
context.commit('flush_local_user_info');
return Promise.resolve(true)
}catch(error){
return Promise.reject('store: failed logging out locally')
}
},
},
getters: {
userHasLoggedIn(state){
return (state.user && state.user.username);
},
},
modules: {
}
});
export default store
| javascript |
2 He that teacheth his son, shall be praised in (or for) him; and shall have glory in him in the midst of (his) menials.
7 For defending the souls (or the lives) of his sons, he shall bind together his wounds; and his entrails [or the bowels of him] shall be disturbed (or troubled) on each voice.
8 An horse untamed, either unchastised, shall escape hard, and a son unchastised shall escape heady (or become headstrong).
10 Laugh thou not with him of (or about) his follies, lest thou have sorrow together, and at the last thy teeth shall be astonied (or astonished) [or and in the last thy teeth shall wax astonied].
11 Give thou not power to him in youth, and despise thou not his thoughts.
13 Teach thy son, and work in him; lest thou offend into the filth of him (or lest his filthy behaviour offend thee).
14 Better is a poor man whole, and strong in mights [or in strengths], than a rich man feeble, and beaten [or scourged] with malice.
19 What shall sacrifice profit to an idol? [or What shall profit sacrifice to the maumet?] for why it shall not eat, neither shall smell. So he that is driven away from the Lord,
20 and beareth the meeds (or the rewards) of wickedness, [or of shrewdness, (or of depravity)], seeing with eyes, and wailing inwardly, as a gelding embracing a virgin [or a maiden], and sighing.
22 Mirth of heart, this is the life of man, and is (a) treasure of holiness without failing; and full out joying of a man is long life [or long living].
23 Have thou mercy on thy soul, and please thou God; and hold together and gather together thine heart in the holiness of him, and put far away sorrow from thee. For why sorrow hath slain many men; and none health is therein [or and there is not profit in it].
| english |
{
"token": "<KEY>",
"initcmd": "r",
"id": "351366504068939777"
}
| json |
the only player one of two players in WiFi enabled smart phones offering expanded reach when cell coverage is, well, not so good. This week, NEC was issued a related patent on wirelessly downloading files by selecting between cellular or WiFi networks reminding us that the iPhone is going to launch with so many cool features, and will most happily step on some toes in doing so.
Using a cell phone to reduce download costs, NEC’s technology determines availability of networks and, in knowing charing formats (e.g. flat rate for WiFi + broadband v. variable rate for most cell plans), can automatically determine the cheaper path for a file download.
For a bit of details:
1. A method for downloading a data file to a portable communications terminal comprising:
said portable communication terminal automatically selecting from a first wireless path having flat rate billing and a second wireless path having measured rate billing, said automatic selecting including:
detecting whether said first wireless path is available to said portable communications terminal for downloading said file at the current location and in response to detecting that said first wireless path is available at said current location, said portable communication terminal downloading said file using said first wireless path, and in response to detecting that said first wireless path is not available at said current location, detecting whether said second wireless path is available and, in response to detecting that said second path is available, said portable communication terminal downloading said file from said second wireless path.
With [still pretty darn expensive] all-you-can-get data plans in cellular, download speed may be more important than cost, but not everyone will be up for full access data plans at ~$40/month making this concept worth being expanded upon.
| english |
from lml.registry import PluginInfoChain
__test_plugins__ = PluginInfoChain(__name__).add_a_plugin("test_io2", "reader")
| python |
<filename>src/interfaces/web/page-type-data.interface.ts
import { PartialsPageData } from './partials-page-data.interface';
import { Article } from '../../entities/Article';
import { ContactPageData } from './contact-page-data.interface';
import { DepartmentData } from './data-view-pack.interface';
export interface PageTypeData {
articles?: PartialsPageData<Article>;
article?: Article;
pageContact?: ContactPageData;
deparments?: any;
department?: DepartmentData;
variants?: any;
notices?: any;
}
| typescript |
package components
import (
"go2async/pkg/variable"
"strconv"
"strings"
)
const scopePrefix = "SC_"
type Scope struct {
Nr int
archName string
Block *Block
Params map[string]*variable.VariableInfo
Variables map[string]*variable.VariableInfo
ReturnVars []*variable.VariableInfo
OutReg *Reg
In *HandshakeChannel
Out *HandshakeChannel
}
var scopeNr = 0
func NewScope(name string, block *Block, params, vars map[string]*variable.VariableInfo, returnVars []*variable.VariableInfo) *Scope {
nr := scopeNr
if name == "" {
scopeNr++
name = strings.ToLower(scopePrefix + strconv.Itoa(nr))
}
s := &Scope{
Nr: nr,
archName: name,
Block: block,
In: &HandshakeChannel{
Out: false,
},
Params: params,
Variables: vars,
ReturnVars: returnVars,
}
entryIn := &HandshakeChannel{
Req: "in_req",
Ack: "in_ack",
Data: "std_logic_vector(resize(unsigned(in_data), DATA_WIDTH))", // "in_data",
Out: true,
}
s.Block.In = entryIn
rs := 0
for _, s := range s.ReturnVars {
rs += s.Size
}
s.OutReg = NewReg("DATA_WIDTH", false, "0")
s.Block.Out.Connect(s.OutReg.In)
s.Out = s.OutReg.Out
return s
}
func (s *Scope) InChannel() *HandshakeChannel {
return s.In
}
func (s *Scope) OutChannel() *HandshakeChannel {
return s.Out
}
func (s *Scope) Component() string {
name := scopePrefix + strconv.Itoa(s.Nr)
return name + `: entity work.Scope(` + s.archName + `)
generic map(
DATA_WIDTH => ` + s.archName + `_DATA_WIDTH,
OUT_DATA_WIDTH => ` + s.archName + `_OUT_DATA_WIDTH,
IN_DATA_WIDTH => ` + s.archName + `_IN_DATA_WIDTH
)
port map (
rst => rst,
in_ack => ` + s.In.Ack + `,
in_req => ` + s.In.Req + `,
in_data => ` + s.In.Data + `,
-- Output channel
out_req => ` + s.Out.Req + `,
out_data => ` + s.Out.Data + `,
out_ack => ` + s.Out.Ack + `
);
`
}
func (s *Scope) signalDefs() string {
ret := SignalsString(s.Block.Out)
ret += SignalsString(s.OutReg.Out)
return ret
}
func (s *Scope) Architecture() string {
// TODO: add inner components
ret := `architecture ` + s.archName + ` of Scope is
`
ret += s.signalDefs()
ret += "\n"
ret += "begin"
ret += "\n"
ret += "out_req <= " + s.OutChannel().Req + "; \n"
ret += s.OutChannel().Ack + " <= out_ack; \n"
ret += "out_data <= "
for _, v := range s.ReturnVars {
if v.Len == 1 {
idx := getIndex(v.Index)
ret += s.OutReg.OutChannel().Data + "(" + strconv.Itoa(v.Position+v.Size*(idx+1)) + " -1 downto " + strconv.Itoa(v.Position+v.Size*idx) + ") & "
} else {
for idx := v.Len - 1; idx >= 0; idx-- {
ret += s.OutReg.OutChannel().Data + "(" + strconv.Itoa(v.Position+v.Size*(idx+1)) + " -1 downto " + strconv.Itoa(v.Position+v.Size*idx) + ") & "
}
}
}
ret = strings.TrimSuffix(ret, " & ")
ret += ";\n"
ret += "\n"
ret += s.Block.Component()
ret += "\n"
ret += s.OutReg.Component()
ret += "\n"
ret += `end ` + s.archName + `;
`
return ret
}
func (s *Scope) ArchName() string {
return s.archName
}
| go |
A great cricketing career has come to an end. Allan Donald, the White Lightning, has bid adieu to the game.
Ironically, the man with some great conquests in the cricketing arena, went out in a sad manner, not finding a place in the South African XI in that tragic Group `B' game against the Sri Lankans.
It was clear during the World Cup that Donald was past his best, and in the end it was a tired body snuffing out the spirit. However, the fiery pace ace will be remembered as a South African legend.
I still remember the first occasion that I faced him. It was on a flat Gwalior pitch in 1991, yet he worked up extraordinary speed. The South Africans had just returned to the international stage after years in banishment and here was a man hungry for success.
He was the one who dismissed me in my final innings for India — during the '92 World Cup down under — and that is one more reason that he'll forever stay in my memory!
At his peak Donald was quick, but unlike so many from his tribe, he was seldom wayward. In fact, he had exceptional control over his bowling, and had the ability to work on a batsman.
A long stint in the English county circuit matured him greatly as a bowler and it was there that he learnt the virtues of conserving his energy, something vitally important for a fast bowler.
Over the years, I have greatly admired his ability to deliver on the big occasion. If the challenge were to be great, the greater would be his effort. He loved bowling to accomplished batsmen and his duels with the likes of Sachin Tendulkar and Steve Waugh were stirring.
A lethal strike bowler, he was always on the look-out for wickets and the manner in which he went after scalps match after match was quite amazing. Even in the ODIs, Donald understood well that if he could fire out batsmen quickly, the match would be won.
He had a lot going for him as a paceman extraordinaire. He had a smooth rhythmic run-up, a wonderfully fluent action and a lovely outswinger. In fact, the South African picked up so many wickets with the away going delivery.
Donald also had a mean short ball, which meant most batsmen could not confidently get on to their front foot against him. And he possessed a scorching yorker with which he nailed a number of batsmen in the limited overs contests.
Fast bowlers hunt in pairs they say and Donald's partnership with Shaun Pollock was among the more productive ones in Test history. Donald rattled them with his pace and fire and Pollock got them with his movement. This was a combination that worked magic for South Africa.
Donald was much senior to Pollock. However, that did not prevent him from passing the tricks of the trade to his much younger partner. I have heard, not without reason, that Donald was extremely helpful to the up and coming paceman and this only reveals another glowing quality in the man.
The late South African captain Hansie Cronje had a major influence on his career, and so did his former coach Bob Woolmer. They had backed the right man as Donald took South Africa from strength to strength.
In fact, if South Africa could make such a huge impact so soon after returning from banishment then Donald's role in that has been significant. He was the man who could strike early blows and return to haunt the batsmen in the later stages of the innings.
With South Africa short of batting role models, Allan Donald soon became an icon in a land that needed one. He was the figure who would inspire the nation.
At a personal level, I have always found him to be easily approachable and level-headed. He has no airs about him despite his stature and is someone I have greatly respected.
There may have been times when he has spoken words of anger on the cricket field, but this is only understandable in a fast bowler. I have also seen him sport a genial smile in the cricketing arena. Deep down, he did appear a friendly man.
Such a likable cricketer deserved a better send-off than having to cool his heels in the dressing room in what was his last match with the South African squad. In the end, he succumbed to the temptation of carrying on a touch longer than his body would allow him to.
Winning the World Cup had been Donald's big dream, but it was his mix-up with Lance Klusener in that dramatic semifinal in '99 that cost the Proteas a place in the final of the premier one-day competition as the Australians went through. That was a mishap that must have haunted Donald.
Donald retired from Test cricket in early 2002 but stayed on for the ODIs, only because the World Cup was being played on South African soil. He wanted to have one last fling at a title that had eluded both him and his side.
It was clear that he had lost much of his pace by now, which meant the batsmen could strike him off the front foot; only the very best could accomplish this in his heyday. He appeared jaded and it was evident that the passing years had taken their toll.
I can remember another great cricketer, Pakistan's Javed Miandad, cutting a sorry figure in his last World Cup. The Pakistani came out of retirement for the '96 edition and found life in the competition hard, struggling as he was with his fitness.
Donald may have made the same mistake, but let's remember him for the good times. In his prime he was an outstanding, match-winning fast bowler. He could put fear in the batsmen and then dismiss them. Fast bowlers such as him are rare. He was a giant in every sense of the term.
| english |
Rakhi Sawant sat down for an exclusive conversation with Pinkvilla. She reacted to the allegations made by her estranged husband Adil Khan Durrani.
Rakhi Sawant is all over the news owing to her spat with her estranged husband, Adil Khan Durrani. Upon returning to Mumbai after serving 5 months in Mysuru jail, Adil Khan Durrani held a press conference and made serious allegations against the dancer-turned-actress. He went on to accuse her of fraud, cheating, and physical assault. Following this, Rakhi Sawant held a press conference to react to the allegations. Now, in an exclusive conversation with Pinkvilla, Rakhi Sawant took us through her side of the story.
On being asked about Adil Khan Durrani's allegation about her not being able to conceive, the former Bigg Boss contestant broke down. She said, "Very sad (cries). Kaunsa husband aake media mein kehte hain ki wo maa nahi ban sakti? Kaunsa husband kehta hai is duniya mein, samaj mein maa, behen, beti...(Which husband tells the media that his wife won't be able to become a mother? Who does this in society?)" For the unversed, Adil Khan Durrani said during the press conference that Rakhi wouldn't be able to conceive because she had a uterus surgery.
Watcht the full interview with Rakhi Sawant here:
The actress further added, "Mujhe maa banna tha, meine apne eggs pehle se freeze karwayi thi. Mein boli thi mujhe maa banna tha, toh I was trying. Doctor ne kaha, ‘you have a fibroid in the uterus and it’s not a 1,2,3, it’s a 10. (I wanted to become a mother, so I froze my eggs beforehand. I was trying, and then the doctors told me I had a fibroid in uterus) It’s very big, you have to remove it and then after you can conceive.’ I went to 3-4 doctors and Shinde, she is a specialist Gynaec, and I said I trust you. Toh she did my surgery. She warned him, don’t do 6 months relation, he didn’t listen to the doctor. Within a month, he did it, and within one and a half months, I think I conceived. Doctor ne bola tha it’s very dangerous. Nahi suna, wo blackmail karta tha, (Doctors warned that it's very dangerous, but he didn't listen, used to blackmail me) if you can’t do, I will go out, anyways, he was going."
NET Worth: ~ 41.7 MN USD (RS 345 cr)
| english |
Shelmet has gained some new attention with the release of Pokemon GO's Jungle Little Cup. For players in need of a Bug-type to fill a slot on their Battle Team, Shelmet may be what they need to succeed in the Battle League.
For players looking to invest in Shelmet, knowing its stats and moves can help to maximize their effectiveness.
Shelmet is a pure Bug-type Pokemon. This means that Shelmet's Bug-type attacks receive a boost in power as well as resistances to Grass, Ground, and Fighting-type attacks. However, Shelmet is weak to Fire, Flying, and Rock-type attacks.
Shelmet has some impressive defensive stats in Pokemon GO for a Pokemon that has yet to evolve. Though Shelmet only has a pitiful attack stat of 70, it brings a decent defense stat of 140 and a stamina stat of 137 to battle. Shelmet also has a maximum combat power of 834, so Little Cup will be the only option for Shelmet to be viable.
Shelmet has a couple of options for fast attacks. Acid is a Poison-type fast attack that deals a total of 11. 3 damage every second. Shelmet also has access to Infestation, a Bug-type fast attack. This attack deals 10. 9 damage every second. However, Infestation generates more energy with every use making it the better option for Shelmet's moveset.
Shelmet also has access to a couple of different charged attacks in Pokemon GO. Most of these attacks are Bug-type, so the difference between the two comes down to preference. Bug Buzz and Signal Beam are both great options for charged attacks. There is a small difference in damage between the two attacks, but Bug Buzz is ultimately the better option due to requiring less energy and dealing slightly more damage.
Body Slam is the last option for Shelmet to run in Pokemon GO. This attack is rather unremarkable as it deals the least amount of damage and requires the most energy.
Shelmet has potential in Pokemon GO's Jungle Little Cup. However, there are better options for players to run if they choose to use a Bug-type Pokemon. Shelmet's best moveset in Pokemon GO is Infestation and Bug Buzz. However, there is room for experimentation as Acid provides nice coverage and can quickly deal with Grass and Fairy-type Pokemon. | english |
Posted On:
Union Minister for Agriculture and Farmers Welfare Shri Narendra Singh Tomar chaired a meeting with Agriculture Ministers of all States/UTs via Video Conference today and discussed the implementation of three key schemes of Government of India namely Pradhan Mantri Kisan Samman Nidhi Yojna (PM-Kisan), Pension Scheme for Small and Marginal Farmers and Kisan Credit Card Campaign.
Union Agriculture Minister urged all States/UTs to expedite the process of enrolment of all eligible farmer families/ beneficiaries in a time bound manner so that the benefit under PM-KISAN for the period from April to July, 2019 can be transferred directly to their bank accounts.
The Minister also informed all States/UTs regarding rolling out of Pension Scheme for Farmers belonging to the age group of 18-40 years. He also requested all States/ UTs to create awareness about the Pension Scheme.
Shri Tomar also requested all States to organise village –wise campaign to cover one crore farmers under Kisan Credit Card Scheme within next hundred days.
The PM-Kisan Yojna is an income support scheme for farmers. It is a 100% central sector scheme which will give farmers Rs. 6000/- per year in 3 equal instalments. From 01.04.2019, the scheme has been extended to cover all farmers, the total beneficiaries will be 14.5 crores. During the video conference it was stressed that there should be 100% enlistment of eligible beneficiaries by States/UT’s, timely uploading of corrected data on PM-Kisan portal and establishment of proper redressal Mechanism.
The pension scheme for small and marginal farmers will provide a social security net for all such farmers. Under this scheme a minimum fixed pension of Rs 3000 per month will be provided to the eligible small and marginal farmers subject to certain exclusion causes on attaining the age of 60 years. The scheme aims to cover around 5 crore beneficiaries in the first three years. It will be a voluntary and contributory pension scheme with entry age of 18 to 40 years. The beneficiary can opt to become member of the scheme by subscribing to a pension fund. The beneficiary would be required to contribute Rs. 100 per month at median entry age of 29 years. The Central government shall also contribute to the Pension Fund in equal amount. Contribution shall be made to a Pension Fund managed by the LIC which will be responsible for the pension pay out. Under the scheme farmers can also opt to allow contribution to be made directly from the benefits drawn from the PM-KISAN scheme. There will be an online grievance redressal system for complete transparency.
The Kisan Credit Card was introduced in 1998, presently there are 6.92 crore live KCCs against 14.5 crore operational landholdings. The recent initiatives for KCC saturation include adding farmers engaged in Animal Husbandry & Fisheries; removal of inspection ledger folio charges and processing fee of loan under KCC; raising limit of collateral fee on existing agriculture loan from l lakh to 1.6 lakhs. DAC & FW on 04.02.2019 advised all Chief Secretaries/Principal Secretaries of State/UT Administration to launch KCC saturation drive. During the proposed saturation drive, bank wise or village wise campaigns will be organised to collect KCC application forms. States like Gujrat, Maharashtra, UP, Chhattisgarh, WB, Bihar, Jharkhand, HP, J&K and NER states have already been identified where KCC penetration was found lagging. A target of 1 crore is to be achieved in the next 100 days.
| english |
{
"id": "d1043-144",
"text": "October 9, 1952\nMr. <NAME>\nExecutive Secretary\nHe: DUNN BALLOT of 10/6/52\nDear Jim:\nI vote *ye®w on all except President^ Hooa,\nAlliance College, and the Shod© Island Committee on\nEducational TV. I vote •no* only because of lack of\ninformation. With additional information, I feel sure\nI would vote *yes* on at least one, and perhaps both.\nI believe the Directors should be given additional\ninformation on both.\nCordially,\n<NAME>\nTreasurer\nFESifmh\ncc: <NAME>"
} | json |
{".class": "MypyFile", "_fullname": "torch.optim._multi_tensor", "is_partial_stub_package": false, "is_stub": false, "names": {".class": "SymbolTable", "ASGD": {".class": "SymbolTableNode", "cross_ref": "torch.optim._multi_tensor.asgd.ASGD", "kind": "Gdef"}, "Adadelta": {".class": "SymbolTableNode", "cross_ref": "torch.optim._multi_tensor.adadelta.Adadelta", "kind": "Gdef"}, "Adagrad": {".class": "SymbolTableNode", "cross_ref": "torch.optim._multi_tensor.adagrad.Adagrad", "kind": "Gdef"}, "Adam": {".class": "SymbolTableNode", "cross_ref": "torch.optim._multi_tensor.adam.Adam", "kind": "Gdef"}, "AdamW": {".class": "SymbolTableNode", "cross_ref": "torch.optim._multi_tensor.adamw.AdamW", "kind": "Gdef"}, "Adamax": {".class": "SymbolTableNode", "cross_ref": "torch.optim._multi_tensor.adamax.Adamax", "kind": "Gdef"}, "NAdam": {".class": "SymbolTableNode", "cross_ref": "torch.optim._multi_tensor.nadam.NAdam", "kind": "Gdef"}, "RAdam": {".class": "SymbolTableNode", "cross_ref": "torch.optim._multi_tensor.radam.RAdam", "kind": "Gdef"}, "RMSprop": {".class": "SymbolTableNode", "cross_ref": "torch.optim._multi_tensor.rmsprop.RMSprop", "kind": "Gdef"}, "Rprop": {".class": "SymbolTableNode", "cross_ref": "torch.optim._multi_tensor.rprop.Rprop", "kind": "Gdef"}, "SGD": {".class": "SymbolTableNode", "cross_ref": "torch.optim._multi_tensor.sgd.SGD", "kind": "Gdef"}, "__doc__": {".class": "SymbolTableNode", "kind": "Gdef", "node": {".class": "Var", "flags": ["is_ready"], "fullname": "torch.optim._multi_tensor.__doc__", "name": "__doc__", "type": "builtins.str"}}, "__file__": {".class": "SymbolTableNode", "kind": "Gdef", "node": {".class": "Var", "flags": ["is_ready"], "fullname": "torch.optim._multi_tensor.__file__", "name": "__file__", "type": "builtins.str"}}, "__name__": {".class": "SymbolTableNode", "kind": "Gdef", "node": {".class": "Var", "flags": ["is_ready"], "fullname": "torch.optim._multi_tensor.__name__", "name": "__name__", "type": "builtins.str"}}, "__package__": {".class": "SymbolTableNode", "kind": "Gdef", "node": {".class": "Var", "flags": ["is_ready"], "fullname": "torch.optim._multi_tensor.__package__", "name": "__package__", "type": "builtins.str"}}}, "path": "/Users/chunyanwang/miniconda3/lib/python3.9/site-packages/torch/optim/_multi_tensor/__init__.py"} | json |
from .models.type_validator import TypeValidator
from .models.typed_list import TypedList
from utils.star_class_map import spectral_class_map, oddity_map
from config import NMSConfig
class StarClass(object):
config = TypeValidator(dict)
spectral_class_str = TypeValidator(str)
spectral_class = TypeValidator(str)
brightness = TypeValidator(int)
oddities = TypedList(str)
def __init__(self, spectral_class):
self.config = NMSConfig()
self.spectral_class_str = spectral_class.upper()
self.spectral_class = self.spectral_class_str[0]
self.oddities = []
if 2 > len(self.spectral_class_str) > 4:
raise ValueError('Spectral class input must be between 2 and 4 characters')
elif self.spectral_class not in spectral_class_map:
raise ValueError(f'Spectral class {self.spectral_class_str[0].upper()} does not exist')
self.brightness_index = int(self.spectral_class_str[1]) // 2
self.deity = spectral_class_map[self.spectral_class][self.brightness_index]
if len(self.spectral_class_str) > 2:
for char in self.spectral_class_str[2:]:
if char.upper() not in oddity_map:
print(f'"{char.upper()}" not a recognized oddity code; ignoring...')
elif char.upper() not in self.oddities:
self.oddities.append(char.upper())
def generate_names(self, region, number=10, min_len=4):
prefix = f'{oddity_map[self.oddities[0]]}-' if len(self.oddities) == 2 else ''
suffix = f'-{oddity_map[self.oddities[-1]]}' if len(self.oddities) >= 1 else ''
return {
f'{prefix}{name}{suffix}'
for name in self.config.generator.get_prospects(
input_words=[self.deity, region],
number=number,
min_len=min_len
)
}
| python |
<gh_stars>0
package main
import (
"log"
)
func detectDeadBrunches(cfg config) {
undead := detectDead(cfg)
for rcpt, v := range undead.Authors {
if rcpt == "<EMAIL>" {
continue
}
v.Projects = undead.Projects
msg, err := deadAuthorTemplate(v)
if err != nil {
log.Printf("Templating error: %v", err)
return
}
subj := "Dead branch notification"
if err := mailSend(cfg, []string{rcpt}, subj, msg); err != nil {
log.Printf("Failed to send mail: %v", err)
}
}
}
func detectMR(cfg config) []mrAction {
mrsOpened, err := checkPrjRequests(cfg, cfg.Projects, "opened")
if err != nil {
log.Println(err)
}
actionsOpened := evalOpenedRequests(mrsOpened)
mrsMerged, err := checkPrjRequests(cfg, cfg.Projects, "merged")
if err != nil {
log.Println(err)
}
actionsMerged := evalMergedRequests(mrsMerged)
actions := append(actionsOpened, actionsMerged...)
processMR(cfg, actions)
return actions
}
| go |
Maharashtra on Friday reported 58,993 coronavirus cases and 301 deaths in 24 hours amid a second wave of infections. Pune, with 10,084 Covid cases, was the worst-affected district today, followed by Mumbai with 9,200 single-day infections.
After the new additions, the total of active cases has reached 5,34,603. The recovery rate in Maharashtra is 81. 96 percent. The fatality rate is 1. 74%.
45,391 patients were discharged today, taking the total of recoveries to 26,95,148.
Currently, 26,95,065 people are in home quarantine and 24,157 people are in institutional quarantine, the state government said in a statement.
The state had reported 56,286 cases and 376 deaths yesterday.
Meanwhile, Mumbai's coronavirus tally crossed the five lakh-mark on Friday. The death count reached 11,909 as 35 people died in the last 24 hours.
The city has added nearly one lakh new cases in the last 12 days only. The number of active COVID-19 cases in Mumbai increased to 90,333.
The Maharashtra government has imposed a night curfew and weekend lockdowns to control the surge.
The state's hospitals are flooded with coronavirus patients.
Maharashtra Health Minister Rajesh Tope today said that the state was heading towards a lockdown.
"We are heading towards a lockdown but I hope that we don't have to go for one. Before that if we contain the virus, we will be happy, satisfied and content. We are hoping for the best," Mr Tope told NDTV in an interview.
He said at present he was not in favour of a lockdown. "But when hospitals are overwhelmed, we have a dearth of doctors, there is a shortage of medicines and we are not able to cope with daily numbers, at that time, the thumb rule is that we should impose a lockdown immediately so we can ramp up our capacities and can prepare for the situation. "
The Maharashtra government claims a severe vaccine shortage. It says several of its vaccination sites have closed down because of the shortage. The Centre has denied the state's claims. | english |
/*
* The JTS Topology Suite is a collection of Java classes that
* implement the fundamental operations required to validate a given
* geo-spatial data set to a known topological specification.
*
* Copyright (C) 2001 <NAME>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* For more information, contact:
*
* Vivid Solutions
* Suite #1A
* 2328 Government Street
* Victoria BC V8T 5G5
* Canada
*
* (250)385-6040
* www.vividsolutions.com
*/
package com.vividsolutions.jts.algorithm;
import com.vividsolutions.jts.geom.*;
/**
* Computes a point in the interior of an areal geometry.
*
* <h2>Algorithm</h2>
* <ul>
* <li>Find a Y value which is close to the centre of
* the geometry's vertical extent but is different
* to any of it's Y ordinates.
* <li>Create a horizontal bisector line using the Y value
* and the geometry's horizontal extent
* <li>Find the intersection between the geometry
* and the horizontal bisector line.
* The intersection is a collection of lines and points.
* <li>Pick the midpoint of the largest intersection geometry
* </ul>
*
* <h3>KNOWN BUGS</h3>
* <ul>
* <li>If a fixed precision model is used,
* in some cases this method may return a point
* which does not lie in the interior.
* </ul>
*
* @version 1.7
*/
public class InteriorPointArea {
private static double avg(double a, double b)
{
return (a + b) / 2.0;
}
private GeometryFactory factory;
private Coordinate interiorPoint = null;
private double maxWidth = 0.0;
/**
* Creates a new interior point finder
* for an areal geometry.
*
* @param g an areal geometry
*/
public InteriorPointArea(Geometry g)
{
factory = g.getFactory();
add(g);
}
/**
* Gets the computed interior point.
*
* @return the coordinate of an interior point
*/
public Coordinate getInteriorPoint()
{
return interiorPoint;
}
/**
* Tests the interior vertices (if any)
* defined by an areal Geometry for the best inside point.
* If a component Geometry is not of dimension 2 it is not tested.
*
* @param geom the geometry to add
*/
private void add(Geometry geom)
{
if (geom instanceof Polygon) {
addPolygon(geom);
}
else if (geom instanceof GeometryCollection) {
GeometryCollection gc = (GeometryCollection) geom;
for (int i = 0; i < gc.getNumGeometries(); i++) {
add(gc.getGeometryN(i));
}
}
}
/**
* Finds an interior point of a Polygon.
* @param geometry the geometry to analyze
*/
private void addPolygon(Geometry geometry) {
if (geometry.isEmpty())
return;
Coordinate intPt;
double width = 0;
LineString bisector = horizontalBisector(geometry);
if (bisector.getLength() == 0.0) {
width = 0;
intPt = bisector.getCoordinate();
}
else {
Geometry intersections = bisector.intersection(geometry);
Geometry widestIntersection = widestGeometry(intersections);
width = widestIntersection.getEnvelopeInternal().getWidth();
intPt = centre(widestIntersection.getEnvelopeInternal());
}
if (interiorPoint == null || width > maxWidth) {
interiorPoint = intPt;
maxWidth = width;
}
}
//@return if geometry is a collection, the widest sub-geometry; otherwise,
//the geometry itself
private Geometry widestGeometry(Geometry geometry) {
if (!(geometry instanceof GeometryCollection)) {
return geometry;
}
return widestGeometry((GeometryCollection) geometry);
}
private Geometry widestGeometry(GeometryCollection gc) {
if (gc.isEmpty()) {
return gc;
}
Geometry widestGeometry = gc.getGeometryN(0);
// scan remaining geom components to see if any are wider
for (int i = 1; i < gc.getNumGeometries(); i++) {
if (gc.getGeometryN(i).getEnvelopeInternal().getWidth() >
widestGeometry.getEnvelopeInternal().getWidth()) {
widestGeometry = gc.getGeometryN(i);
}
}
return widestGeometry;
}
protected LineString horizontalBisector(Geometry geometry) {
Envelope envelope = geometry.getEnvelopeInternal();
/**
* Original algorithm. Fails when geometry contains a horizontal
* segment at the Y midpoint.
*/
// Assert: for areas, minx <> maxx
//double avgY = avg(envelope.getMinY(), envelope.getMaxY());
double bisectY = SafeBisectorFinder.getBisectorY((Polygon) geometry);
return factory.createLineString(new Coordinate[] {
new Coordinate(envelope.getMinX(), bisectY),
new Coordinate(envelope.getMaxX(), bisectY)
});
}
/**
* Returns the centre point of the envelope.
* @param envelope the envelope to analyze
* @return the centre of the envelope
*/
public static Coordinate centre(Envelope envelope) {
return new Coordinate(avg(envelope.getMinX(),
envelope.getMaxX()),
avg(envelope.getMinY(), envelope.getMaxY()));
}
/**
* Finds a safe bisector Y ordinate
* by projecting to the Y axis
* and finding the Y-ordinate interval
* which contains the centre of the Y extent.
* The centre of this interval is returned as the bisector Y-ordinate.
*
* @author mdavis
*
*/
private static class SafeBisectorFinder
{
public static double getBisectorY(Polygon poly)
{
SafeBisectorFinder finder = new SafeBisectorFinder(poly);
return finder.getBisectorY();
}
private Polygon poly;
private double centreY;
private double hiY = Double.MAX_VALUE;
private double loY = -Double.MAX_VALUE;
public SafeBisectorFinder(Polygon poly) {
this.poly = poly;
// initialize using extremal values
hiY = poly.getEnvelopeInternal().getMaxY();
loY = poly.getEnvelopeInternal().getMinY();
centreY = avg(loY, hiY);
}
public double getBisectorY()
{
process(poly.getExteriorRing());
for (int i = 0; i < poly.getNumInteriorRing(); i++) {
process(poly.getInteriorRingN(i));
}
double bisectY = avg(hiY, loY);
return bisectY;
}
private void process(LineString line) {
CoordinateSequence seq = line.getCoordinateSequence();
for (int i = 0; i < seq.size(); i++) {
double y = seq.getY(i);
updateInterval(y);
}
}
private void updateInterval(double y) {
if (y <= centreY) {
if (y > loY)
loY = y;
}
else if (y > centreY) {
if (y < hiY) {
hiY = y;
}
}
}
}
}
| java |
<gh_stars>0
import { combineReducers } from 'redux';
import dialogs from '../modules/dialogs';
import players from '../modules/players';
export default combineReducers({
[dialogs.constants.NAME]: dialogs.reducer,
[players.constants.NAME]: players.reducer
}); | javascript |
Barcelona welcome Celta Vigo to the Camp Nou on Sunday on the back of a disappointing 3-3 draw away to Levante that all but ended their La Liga title challenge. The Catalans are currently third in the table, four points behind Atletico Madrid with two games left to play in the league.
As such, Ronald Koeman is well aware that even winning their next two games might not be enough to help them win the league, unless Los Indios and Real Madrid both falter along the way. However, the Dutchman will be hoping to solidify his team’s position in third place with a win on Sunday, as Barcelona prepare for a busy summer ahead.
On that note, let’s take a look at the top Barcelona news on 16 May 2021.
Lionel Messi’s future continues to hang in the balance, with the Barcelona skipper set to become a free agent this summer unless the Catalans convince him to sign a contract extension soon. Manchester City and Paris Saint-Germain are the two contenders for the Argentinean’s signature if he decides to leave the Camp Nou. According to Talk Sport via The Sun, the player is willing to consider a move to any club ready to offer him a one-year contract with a salary of £25m-a-year and the option of an additional year.
That effectively means Manchester City can sign Lionel Messi if they offer him £500,000 per week after tax. The report also claims that Manchester United and Chelsea have been informed, but they have not shown any interest.
Barcelona are planning a mass exodus this summer, according to Football Espana via Mundo Deportivo. The Catalans could sell as many as seven players before the start of next season. Koeman is scheduled for talks with club president Joan Laporta soon and the Dutchman will suggest a reduction in wage bill over the summer.
Reserve goalkeeper Neto and defenders Samuel Umtiti and Junior Firpo are all expected to leave the Camp Nou. The La Liga giants are also willing to accept a loss on the amount they paid for Philippe Coutinho and end his association with the club. Matheus Fernandes, Martin Braithwaite and Miralem Pjanic could also depart if Koeman is sacked.
Barcelona are willing to let Emerson go this summer. The Brazilian right-back is currently on loan with Real Betis and is expected to return to Camp Nou in the summer. Emerson has made 33 appearances in La Liga this season, scoring two goals, but it looks like he does not have a future with the Catalans.
According to reports, Barcelona have already contacted Villarreal to discuss the possibility of a move for the 22-year-old. It appears that the Brazilian’s career at the Camp Nou will end without a single appearance for the Catalans.
| english |
<reponame>Bernardo-MG/darksouls-explorer
package com.bernardomg.darksouls.explorer.problem.service;
import org.springframework.data.domain.Page;
import org.springframework.data.domain.Pageable;
import com.bernardomg.darksouls.explorer.problem.model.DataProblem;
public interface ProblemService {
public Page<? extends DataProblem> getAll(final Pageable page);
public void recollectAndRegister();
}
| java |
<reponame>llitfkitfk/bk-job
/*
* Tencent is pleased to support the open source community by making BK-JOB蓝鲸智云作业平台 available.
*
* Copyright (C) 2021 THL A29 Limited, a Tencent company. All rights reserved.
*
* BK-JOB蓝鲸智云作业平台 is licensed under the MIT License.
*
* License for BK-JOB蓝鲸智云作业平台:
* --------------------------------------------------------------------
* Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated
* documentation files (the "Software"), to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and
* to permit persons to whom the Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all copies or substantial portions of
* the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO
* THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
* CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE.
*/
package com.tencent.bk.job.execute.model.web.vo;
import com.fasterxml.jackson.annotation.JsonInclude;
import io.swagger.annotations.ApiModel;
import io.swagger.annotations.ApiModelProperty;
import lombok.Data;
@ApiModel("文件分发执行详情")
@Data
@JsonInclude(JsonInclude.Include.NON_NULL)
public class FileDistributionDetailVO implements Comparable {
@ApiModelProperty(name = "taskId", value = "文件任务ID,用于检索单个文件分发的结果")
private String taskId;
@ApiModelProperty(name = "destIp", value = "下载目标IP")
private String destIp;
@ApiModelProperty(name = "srcIp", value = "上传源IP")
private String srcIp;
@ApiModelProperty("文件名称")
private String fileName;
@ApiModelProperty("文件大小")
private String fileSize;
@ApiModelProperty("状态,0-Pulling,1-Waiting,2-Uploading,3-Downloading,4-Finished,5-Failed")
private Integer status;
@ApiModelProperty("状态描述")
private String statusDesc;
@ApiModelProperty("速率")
private String speed;
@ApiModelProperty("进度")
private String progress;
@ApiModelProperty("文件任务上传下载标识,0-上传,1-下载")
private Integer mode;
@ApiModelProperty("日志内容")
private String logContent;
@Override
public int compareTo(Object o) {
if (o == null) {
return 1;
}
FileDistributionDetailVO other = (FileDistributionDetailVO) o;
// 从文件源拉取文件的详情日志放在最前面
if (this.status == 0 && other.status > 0) {
return -1;
}
int compareFileNameResult = compareString(this.fileName, other.getFileName());
if (compareFileNameResult != 0) {
return compareFileNameResult;
}
return compareString(this.srcIp, other.getSrcIp());
}
private int compareString(String a, String b) {
if (a == null && b == null) {
return 0;
} else if (a != null && b == null) {
return 1;
} else if (a == null) {
return -1;
} else {
return a.compareTo(b);
}
}
}
| java |
<filename>data/raw/semeval2017-task8-dataset/rumoureval-data/prince-toronto/529660296080916480/replies/529666750330449920.json
{"contributors": null, "truncated": false, "text": "@NobleRobel Girl, don't be mean. Age ain't nothing but a number.", "in_reply_to_status_id": 529661317087768576, "id": 529666750330449920, "favorite_count": 1, "source": "<a href=\"http://twitter.com\" rel=\"nofollow\">Twitter Web Client</a>", "retweeted": false, "coordinates": null, "entities": {"symbols": [], "user_mentions": [{"id": 27617550, "indices": [0, 11], "id_str": "27617550", "screen_name": "NobleRobel", "name": "<NAME>"}], "hashtags": [], "urls": []}, "in_reply_to_screen_name": "NobleRobel", "id_str": "529666750330449920", "retweet_count": 0, "in_reply_to_user_id": 27617550, "favorited": false, "user": {"follow_request_sent": false, "profile_use_background_image": true, "profile_text_color": "333333", "default_profile_image": false, "id": 119841769, "profile_background_image_url_https": "https://pbs.twimg.com/profile_background_images/378800000014825733/9dfd06266f9c70f55bc1853bdd8c0e7d.png", "verified": false, "profile_location": null, "profile_image_url_https": "https://pbs.twimg.com/profile_images/3656617096/0681fe4b90dcf70c50d33cc7260ad558_normal.jpeg", "profile_sidebar_fill_color": "DDEEF6", "entities": {"description": {"urls": []}}, "followers_count": 31358, "profile_sidebar_border_color": "FFFFFF", "id_str": "119841769", "profile_background_color": "C0DEED", "listed_count": 245, "is_translation_enabled": false, "utc_offset": -18000, "statuses_count": 14378, "description": "Bearded Canadian working in TV. Love of figure skating, Meryl Streep, beer, Oscars, & antiques. @1girl5gays cast member & proud member of the LGBTQ community.", "friends_count": 2134, "location": "Toronto", "profile_link_color": "0084B4", "profile_image_url": "http://pbs.twimg.com/profile_images/3656617096/0681fe4b90dcf70c50d33cc7260ad558_normal.jpeg", "following": false, "geo_enabled": false, "profile_banner_url": "https://pbs.twimg.com/profile_banners/119841769/1354303992", "profile_background_image_url": "http://pbs.twimg.com/profile_background_images/378800000014825733/9dfd06266f9c70f55bc1853bdd8c0e7d.png", "name": "<NAME>", "lang": "en", "profile_background_tile": true, "favourites_count": 7639, "screen_name": "mikeyerxa", "notifications": false, "url": null, "created_at": "Thu Mar 04 20:15:26 +0000 2010", "contributors_enabled": false, "time_zone": "Quito", "protected": false, "default_profile": false, "is_translator": false}, "geo": null, "in_reply_to_user_id_str": "27617550", "lang": "en", "created_at": "Tue Nov 04 16:09:28 +0000 2014", "in_reply_to_status_id_str": "529661317087768576", "place": null}
| json |
Begin typing your search above and press return to search.
GUWAHATI: Navajyoti Club defeated Gauhati Town club (GTC) by 2-0 in their last match in the GSA RG Baruah Super Division Football League at the Nehru Stadium here today. Jhantu Prasad and Monush Lapang scored one goal each in the game. It was the 10th defeat for Gauhati Town Club who already relegated from the Super Division League.
The side managed to collect only 6 points from their 14 matches. Navajyoti bagged 19 points from their 14 outings. The last match of the league will be held tomorrow where ASEBSC will face Sunrise AC.
Also Read: French football referee Stephanie Frappart is first woman to officiate at World Cup (WC)
Also Watch: | english |
<reponame>diko316/commando<gh_stars>1-10
'use strict';
var PATH = require('path');
var DIRECTORY = require('./directory');
var FILE = require('../file');
var CONFIG_FILE = 'config.yml';
function configFile(root) {
return PATH.join(DIRECTORY.directory(root), CONFIG_FILE);
}
function hasFile(root) {
return FILE.isFile(configFile(root), 'rw');
}
function resolve(root) {
var directory = DIRECTORY.resolve(root);
var current;
if (directory) {
current = PATH.join(directory, CONFIG_FILE);
if (FILE.isFile(current, 'rw')) {
return current;
}
}
return null;
}
function resolveRootDirectory(root) {
var resolved = DIRECTORY.directory(root);
if (resolved) {
root = PATH.dirname(resolved);
if (FILE.isDirectory(root)) {
return root;
}
}
return null;
}
function ensureConfigFile(root) {
var CDIR = DIRECTORY;
var FS = FILE;
var configDirectory, fsConfigFile;
root = resolveRootDirectory(root);
// can ensure config file if root directory exists
if (!root) {
return false;
}
// create config directory if do not exist
configDirectory = CDIR.directory(root);
if (!CDIR.hasDirectory(root)) {
configDirectory = FS.mkdirp(configDirectory);
// must not proceed if unable to create directory
if (!configDirectory) {
return false;
}
}
// create config file if do not exist
fsConfigFile = configFile(root);
if (!hasFile(root)) {
// must not proceed if unable to create config file
if (!FS.writeFile(fsConfigFile, 'service:') || !hasFile(root)) {
return false;
}
}
return {
root: root,
directory: configDirectory,
file: fsConfigFile
};
}
module.exports = {
CONFIG_FILE: CONFIG_FILE,
hasFile: hasFile,
location: configFile,
resolve: resolve,
ensureConfigFile: ensureConfigFile
};
| javascript |
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<title>Top Scores Not Aligned - Better Battlelog Forums #109951</title>
<link rel="stylesheet" href="../stylesheets/page.css" type="text/css">
<script src="../scripts/p.js"></script>
</head>
<body class="forums-post left-side"><h2>Top Scores Not Aligned - Better Battlelog Forums #109951</h2><a href="sitemap.html">Sitemap</a> <div class="forums-post-single topic-starter">
<div class="post-head">
<time datetime="2013-10-25T05:35:17+02:00">25. October 2013 05:35</time> <div class="post-edited">Post edited 1 x times, last by <div class="user-info"><div class="user-name admin">BrainFooLong</div><div class="user-role">Administrator</div></div> <time datetime="2013-10-25T08:08:36+02:00">25. October 2013 08:08</time></div>
<div class="starter">Topicstarter</div> <div class="user-info"><div class="user-name ">GameFreakBoy</div></div> </div>
<div class="post-main">
The Gravatars and names aren't aligned right in battle reports. </div>
</div>
<div class="forums-post-single ">
<div class="post-head">
<time datetime="2013-10-25T08:08:15+02:00">25. October 2013 08:08</time> <div class="user-info"><div class="user-name admin">BrainFooLong</div><div class="user-role">Administrator</div></div> </div>
<div class="post-main">
That isn't a bblog problem. </div>
</div>
<script src="../scripts/t.js"></script></body></html> | html |
{
"directions": [
"Bring a large pot of lightly salted water to a boil. Add pasta and cook for 8 to 10 minutes or until al dente; drain.",
"Heat oil in a large pot over medium heat. Saute bacon, onion and garlic until lightly browned. Stir in tomato sauce. Season with parsley, basil, garlic powder and pepper. Bring to a boil, reduce heat, and simmer 20 to 30 minutes, stirring occasionally. Stir in peas. Toss with pasta until evenly coated. Sprinkle top with Romano."
],
"ingredients": [
"1 (16 ounce) package spaghetti",
"1 tablespoon olive oil",
"1/4 pound turkey bacon, cut into small pieces",
"1/2 large onion, chopped",
"1 clove garlic, minced",
"2 (15 ounce) cans tomato sauce",
"1 1/2 teaspoons chopped fresh parsley",
"1/4 teaspoon dried basil",
"1 teaspoon garlic powder",
"1/2 teaspoon pepper",
"1 (15 ounce) can peas, drained",
"1/4 cup grated Romano cheese"
],
"language": "en-US",
"source": "allrecipes.com",
"tags": [],
"title": "Pasta with Bacon and Peas",
"url": "http://allrecipes.com/recipe/45419/pasta-with-bacon-and-peas/"
}
| json |
Reacting to the news, share price of the global auto giant fell by over 2 per cent in intraday trade, but the long-term picture is still intact, experts say.
Investors can look at buying the stock on dips for a possible target above Rs 650 which translates into an upside of more than 46 per cent from Rs 443 recorded on 27 July 2022.
The global automaker posted a widening of consolidated loss at Rs 5,006 crore for the June quarter compared with Rs 1,032 crore recorded in March 2022.
Consolidated revenue for the quarter rose 8.68 per cent year-on-year (YoY) to Rs 71,227.76 crore from Rs 65,535.38 crore in the year-ago quarter.
We have collated a list of recommendations from various brokerage post Q1 results:
JLR performance was weak in Q1, but there are better times ahead. Q1 EBITDA fell by 40 per cent on a YoY basis.
JLR'S EBITDA margin fell a sharp 620 bps QoQ on lower volumes, but India business performed well. We slash FY23 EPS by 24 per cent but retain buy rating on Tata Motors.
Tata Motors’ Q1 consolidated EBITDA dipped by 54 per cent on a YoY basis and 71 per cent on a QoQ basis to Rs 24.1bn. Q1 standalone CV EBITDA margin dipped to 4.1 per cent versus 6.2 per cent in Q4FY22.
Despite muted Q1 we expect JLR’s FY22-25E volume CAGR at 20 per cent. FY23E/24E EBIT margin may be 5/7.1 per cent (on cost-cut/gradual volume rise).
We are impressed by cost-cutting measures/margin resilience in India business and expect FY22-25E India PV/CV volume CAGRs of 23/20 per cent, on CV cycle recovery.
Reiterate buy with a target price of Rs 535 on June 2024E.
JLR's order book is strong at ~200,000 units. Models such as Defender and new-generation RR/RR Sport form ~65 per cent of order bookings, which should lead to product-mix improvement going ahead.
Chip supplies are expected to improve in a staggered manner going ahead. Emkay Global expects a 15 per cent volume CAGR over FY22-24E.
The brokerage firm estimates FY22-24E India CV/PV volume CAGRs of 16/28 per cent, driven by continued upcycle in industry sales and better chip supplies.
The focus remains on E-PVs, with medium-term investments of US$2bn toward new products, capacity expansion, localisation, and charging infrastructure.
(Disclaimer: Recommendations, suggestions, views and opinions given by the experts are their own. These do not represent the views of Economic Times)
Download The Economic Times News App to get Daily Market Updates & Live Business News.
Subscribe to The Economic Times Prime and read the Economic Times ePaper Online.and Sensex Today.
| english |
<filename>PostgreSQL/manifest.json
{
"name": "PostgreSQL",
"description": "Save and read data from a postgres database using an html form including clean up example stopping db during app shutdown",
"version": "1.0.0",
"uuid": "60f9f209-f6aa-4d87-b869-c102dcf3752c",
"image": "qradar-app-base:2.0.0",
"environment_variables": [
{
"name": "LANG",
"value": "en_US.UTF-8"
}
],
"areas": [
{
"id": "PostgresStorageTab",
"text": "PostgresStorage",
"description": "Tab with html form to save data to database",
"url": "index",
"required_capabilities": []
}
]
}
| json |
Streaming giants are always here to deliver the best of cinema, be it spy thrillers or horror. Like a spy agent slipping from behind, the content gets better and better every year.
Here's a look at the top 10 spy films, ranked on the basis of 'tomatometer' on Rotten Tomatoes.
Snowden revolves around Edward Snowden, a contractor who joins the NSA. He is nicknamed 'Snow White' as he believes that the NSA doesn't only track enemies of the state, but rather is eavesdropping on every mobile phone in the US, eventually becoming a whistleblower. The film is along the lines of a spy drama and is available to stream on Amazon Prime.
The film holds a score of 61% on Rotten Tomatoes and an IMDb rating of 7. 3. According to the Observer UK:
"Snowden's intellect is most effectively conveyed in Gordon-Levitt's eyes - watchful, sober and clouded by doubt, they are a window into his impossible ethical quandary. "
Christopher Nolan’s mind-boggling film, TENET, begins with an undercover operation, an 'inverted' bullet, and a secret agent on a dangerous mission involving an algorithm with a plot to start World War III. The spy thriller is available to watch on Amazon Prime and has received much praise for its casting.
TENET holds a rating of 69% on Rotten Tomatoes with an IMDb rating of 7. 4. According to The Daily Beast:
"Something like the epitome of [Nolan's] temporally twisty canon, distilling his many cinematic signatures and preoccupations down to their entrancing abstract essence. "
A Call to Spy revolves around British PM Winston Churchill, who ordered his spy agency to hire women for sabotage and resistance-building during the WWII. However, these recruits are part of an unlikely group determined to undermine the Nazis. The film is available to stream on Amazon Prime.
The film holds a rating of 72% on Rotten Tomatoes with an IMDb rating of 6. 6. According to BBC. com:
"Telling her story on screen, along with those of other undersung heroines, is a more dynamic living tribute than any building could be. "
The Cohen Brothers’ Burn After Reading is a satirical approach to the incompetence of spy agencies. The film revolves around a disk containing memoirs of a former CIA analyst that falls into the hands of Linda Litzke and Chad Feldheimer. The two then used the same to make money to have a life-changing cosmetic surgery, whirling the events out of their control.
The film holds a rating of 78% on Rotten Tomatoes with an IMDb rating of 7. 0. It is available to stream on Amazon Prime. According to The Indian Express:
"Burn After Reading is a comedy that makes fun of almost everything, reminding you that almost none of it is laughing matter. "
Charlize Theron is a MI6 agent who gets caught up in the office explaining her recent work in the city, on the eve of the fall of the Berlin Wall in 1989. But a microfilm containing the names of every agent at work in Berlin has been stolen, and it's her mission to bring it back. The spy film is available to watch on Apple TV+.
Atomic Blonde holds a score of 79% with an IMDb rating of 6. 7. According to Glamour UK:
"Who do we thank for this refreshing take on the smash-'em-up genre and this thoroughly modern woman in a Bechdel-beating blockbuster? . . . Thank Charlize Theron. "
Bridge of Spies is yet another spy film, only this time it revolves around the Soviets who shot down a CIA U-2 plane during the Cold War and arrested the pilot. Stephen Spielberg's historical thriller has Tom Hanks leading the film as the Brooklyn attorney who helped negotiate the exchange. The film is available to stream on Netflix and Amazon Prime.
The film holds a score of 90% on Rotten Tomatoes with a rating of 7. 6 on IMDb. According to Collider:
"Bridge of Spies is a quality film featuring loads of commendable work, but Spielberg's glossy and exceedingly upbeat take on the material might make it more of a crowd-pleaser than an Oscar contender. "
The Oscar-winning film, Zero Dark Thirty, is an exploration of the CIA's obsessive hunt for Osama Bin Laden. It brought the reality of torture, military base bombings and al Qaeda to an audience who had only read about them. The spy thriller praised Jessica Chastain's performance while also showing that spy work is dirty work. The film is available to stream on Prime Video.
Zero Dark Thirty holds a score of 91% on Rotten Tomatoes with a rating of 7. 4 on IMDb. According to the Irish Times:
"So overwhelming is the momentum that it proves possible to live with the intelligence that the protagonist is complicit in ground-level fascism. "
The biographical spy drama revolves around Ron, who is assigned to the intelligence division of the Colorado Springs Police Department. He then infiltrates a Ku Klux Klan group by pretending to be interested in joining and teams up with a co-worker to keep up the pretense to take them down. Ron Stallworth was the first African-American detective to serve in that department.
BlacKkKlansman has a score of 96% on Rotten Tomatoes with an IMDb rating of 7. 5. The film has a stunning cast including John David Washington, Adam Driver, Laura Harrier, Topher Grace and many more. It is available to stream on Netflix and Amazon Prime.
According to the Observer:
"A kitchen sink and kaleidoscopic study of cultural and institutional racism in America. "
The spy thriller Argo is based on true events when a film crew had to help bust American hostages out of Tehran. The lead, Tony Mendez, poses as a Hollywood producer, scouting locations in Iran and training the refugees to act as his "film" crew. The film has a brilliant cast including Ben Affleck, John Goodman, Bryan Cranston and Alan Arkin.
Argo holds a score of 96% on Rotten Tomatoes with an IMDb rating of 7. 7. The film is available to stream on Prime Video, according to Times UK:
"Ben Affleck has delivered a knuckle-muncher of a thriller and a satire on Hollywood, both in one unlikely package. "
The Mission Impossible franchise has always been a fan favorite when it comes to spy films, but in recent times, it is most known for the 2018 film Mission: Impossible - Fallout. The plot revolves around Ethan Hunt and his team who are assigned to buy three stolen plutonium cores from eastern European gangsters while also helping the CIA. The film is available to stream on Amazon Prime and Hulu.
The film has a brilliant cast including Vanessa Kirby, Angela Bassett, Henry Cavill and many more. Mission: Impossible - Fallout grossed $790m, making itself the top earner of the franchise. It holds a score of 97% on Rotten Tomatoes and an IMDb rating of 7. 7. According to the Chicago Reader:
"Ironically, the most entertaining element of all may be the star's advancing age; Cruise, well into his 50s, scores numerous laughs as the increasingly confused CIA agent, leaping into one spectacular stunt after another and then wishing he hadn't. "
Honorary mentions of Spy films that are worth everyone's time include Cloak and Dagger, A Most Wanted Man, The Conversation, The Bourne Identity, North by Northwest and The Lives of Others.
Watch the best of Spy films on streaming giants and enjoy the holiday season. | english |
The main parameters of efficiency management of working capital of the enterprise assumes the size of financial investments (the size of the deposit) and the settlement period with suppliers.
The input of the controlled micrologistic subsystem from the consumers of finished goods receives money in a certain amount and after a certain period of time (the settlement period with customers). In addition, short-term bank loans and funds for the return of deposit deposits are received at the entrance.
On the output of a controlled micrologistic subsystem for the payment of supplies of material resources, cash is received after the shipment of material resources. The output also receives cash to pay taxes and deductions, cash for the return of short-term bank loans, cash for the formation of deposit deposits, i. e. The entire financial component of the company's capital.
Working capital management of the enterprise in the sphere of regulation of the level of funds on settlement and deposit accounts is carried out as follows. First of all, at the beginning of the planning period, a deposit account is opened for the amount of money that exceeds the deposit amount. In case this amount is less than the deposit, the deposit account does not open. Thus, opening of a deposit account is postponed until the time when the excess condition is met. In addition, if the current cash reserve is less than zero on the current account, it is necessary to take a short-term loan in the bank. If the current cash reserve exceeds the amount of the loan in the settlement account, which is the first in the repayment queue, then it is necessary to repay this loan.
In the event that the time from the receipt of the loan reaches the end of the settlement period for which a short-term loan is issued, then the working capital management of the enterprise should be directed to repay the loan. At the same time, part of the loan is repaid at the expense of the deposit, for which the required amount is transferred from the deposit account. At the first opportunity, the value of the deposit account is again restored to its previous level.
Regulation of settlements with suppliers and management of working capital of the enterprise in this area of activity is carried out as follows. The supplier of material resources receives a proposal from the subject of management on the value of an acceptable calculation period. In turn, the supplier to the management entity also receives information on the acceptable value of the settlement period.
In the event that the payment of material resources occurs after a specified period of time after the shipment of material resources. When an enterprise is not threatened with bankruptcy, the payment of material resources occurs through an additional set period of time, and by the amount of settlements with suppliers, which understatement will not lead to loss of the company's solvency. In addition, there is a payment after the previous moment of payment calculations. Also there is a payment of taxes and deductions after the previous moment of calculations under taxes and deductions.
As practice shows, the management of the fixed capital of the enterprise as external influences (disturbances) presupposes the prices of material and energy resources and the periods of payments for payments. With such management, the methods of managing own capital (Money Management, MM) are the same, but it is preferable to consider those that are most effective in resisting risks. So MM should be made tougher, so that the safety of the deposit was higher in importance than profitability.
Solve such a problem can the control subsystem, which works as follows.
The control subsystem receives information about external influences on the control object and information about the internal state of the system. In addition, the control subsystem receives information on the results of the management of the object: the size of the criterion of optimality, the actual value of the indicators that were imposed restrictions (in the form of normative indicators). First of all, on the basis of the value of current assets and short-term liabilities , the objectives of the management of the object and the imposed restrictions are determined, which is realized with the help of a set of objective functions.
If the object management goals do not change, then the value of the optimality criterion and the main indicators are calculated. | english |
<filename>data/raw/semeval2017-task8-dataset/rumoureval-data/ottawashooting/524983581983375360/replies/524984000134520834.json
{"contributors":null,"truncated":false,"text":"@cnnbrk let's wish the best for #Canada and this time of tragedy","in_reply_to_status_id":524983581983375360,"id":524984000134520834,"favorite_count":1,"source":"<a href=\"http:\/\/twitter.com\/download\/iphone\" rel=\"nofollow\">Twitter for iPhone<\/a>","retweeted":false,"coordinates":null,"entities":{"symbols":[],"user_mentions":[{"id":428333,"indices":[0,7],"id_str":"428333","screen_name":"cnnbrk","name":"CNN Breaking News"}],"hashtags":[{"indices":[32,39],"text":"Canada"}],"urls":[]},"in_reply_to_screen_name":"cnnbrk","id_str":"524984000134520834","retweet_count":0,"in_reply_to_user_id":428333,"favorited":false,"user":{"follow_request_sent":false,"profile_use_background_image":true,"default_profile_image":false,"id":20349790,"profile_background_image_url_https":"https:\/\/pbs.twimg.com\/profile_background_images\/110582230\/Alex_copy.jpg","verified":false,"profile_text_color":"666666","profile_image_url_https":"https:\/\/pbs.twimg.com\/profile_images\/555142853995687936\/Nty6SUKA_normal.jpeg","profile_sidebar_fill_color":"252429","entities":{"url":{"urls":[{"url":"http:\/\/t.co\/EwSrUGj1aU","indices":[0,22],"expanded_url":"http:\/\/www.facebook.com\/lexxbrown","display_url":"facebook.com\/lexxbrown"}]},"description":{"urls":[]}},"followers_count":1413,"profile_sidebar_border_color":"181A1E","id_str":"20349790","profile_background_color":"1A1B1F","listed_count":7,"is_translation_enabled":false,"utc_offset":-18000,"statuses_count":7187,"description":"I love art, music, nature and life. I am a talented barber in The Bahamas. Contact 242-424-5399 or email <EMAIL>","friends_count":1630,"location":"Bahamas","profile_link_color":"2FC2EF","profile_image_url":"http:\/\/pbs.twimg.com\/profile_images\/555142853995687936\/Nty6SUKA_normal.jpeg","following":false,"geo_enabled":true,"profile_banner_url":"https:\/\/pbs.twimg.com\/profile_banners\/20349790\/1359335757","profile_background_image_url":"http:\/\/pbs.twimg.com\/profile_background_images\/110582230\/Alex_copy.jpg","screen_name":"LexxBrown","lang":"en","profile_background_tile":false,"favourites_count":686,"name":"<NAME>","notifications":false,"url":"http:\/\/t.co\/EwSrUGj1aU","created_at":"Sun Feb 08 03:53:15 +0000 2009","contributors_enabled":false,"time_zone":"Quito","protected":false,"default_profile":false,"is_translator":false},"geo":null,"in_reply_to_user_id_str":"428333","lang":"en","created_at":"Wed Oct 22 18:01:54 +0000 2014","in_reply_to_status_id_str":"524983581983375360","place":null} | json |
//package com.wildbeeslabs.sensiblemetrics.diffy.converter.service;
//
//import java.util.Date;
//import java.util.UUID;
//import java.util.function.Function;
//
//import com.noorq.casser.support.Timeuuid;
//
///**
// * Simple Date to TimeUUID Converter
// *
// */
//
//public enum DateToTimeuuidConverter implements Function<Date, UUID> {
//
// INSTANCE;
//
// @Override
// public UUID apply(Date source) {
// long milliseconds = source.getTime();
// return Timeuuid.of(milliseconds);
// }
//
//}
| java |
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.giraph.worker;
import org.apache.giraph.comm.WorkerClient;
import org.apache.giraph.comm.requests.AskForInputSplitRequest;
import org.apache.giraph.io.InputType;
import java.util.EnumMap;
import java.util.Map;
import java.util.concurrent.BlockingQueue;
import java.util.concurrent.LinkedBlockingQueue;
/**
* Requests splits from master and keeps track of them
*/
public class WorkerInputSplitsHandler {
/** Worker info of this worker */
private final WorkerInfo workerInfo;
/** Task id of master */
private final int masterTaskId;
/** Worker client, used for communication */
private final WorkerClient workerClient;
/** Map with currently available splits received from master */
private final Map<InputType, BlockingQueue<byte[]>> availableInputSplits;
/**
* Constructor
*
* @param workerInfo Worker info of this worker
* @param masterTaskId Task id of master
* @param workerClient Worker client, used for communication
*/
public WorkerInputSplitsHandler(WorkerInfo workerInfo, int masterTaskId,
WorkerClient workerClient) {
this.workerInfo = workerInfo;
this.masterTaskId = masterTaskId;
this.workerClient = workerClient;
availableInputSplits = new EnumMap<>(InputType.class);
for (InputType inputType : InputType.values()) {
availableInputSplits.put(
inputType, new LinkedBlockingQueue<byte[]>());
}
}
/**
* Called when an input split has been received from master, adding it to
* the map
*
* @param splitType Type of split
* @param serializedInputSplit Split
*/
public void receivedInputSplit(InputType splitType,
byte[] serializedInputSplit) {
try {
availableInputSplits.get(splitType).put(serializedInputSplit);
} catch (InterruptedException e) {
throw new IllegalStateException("Interrupted", e);
}
}
/**
* Try to reserve an InputSplit for loading. While InputSplits exists that
* are not finished, wait until they are.
*
* NOTE: iterations on the InputSplit list only halt for each worker when it
* has scanned the entire list once and found every split marked RESERVED.
* When a worker fails, its Ephemeral RESERVED znodes will disappear,
* allowing other iterating workers to claim it's previously read splits.
* Only when the last worker left iterating on the list fails can a danger
* of data loss occur. Since worker failure in INPUT_SUPERSTEP currently
* causes job failure, this is OK. As the failure model evolves, this
* behavior might need to change. We could add watches on
* inputSplitFinishedNodes and stop iterating only when all these nodes
* have been created.
*
* @param splitType Type of split
* @param isFirstSplit Whether this is the first split input thread reads
* @return reserved InputSplit or null if no unfinished InputSplits exist
*/
public byte[] reserveInputSplit(InputType splitType, boolean isFirstSplit) {
// Send request
/**
* 将会调用 {@link org.apache.giraph.master.input.MasterInputSplitsHandler#sendSplitTo}
* master 将会回调{@link org.apache.giraph.comm.requests.ReplyWithInputSplitRequest#doRequest}
*/
workerClient.sendWritableRequest(masterTaskId,
new AskForInputSplitRequest(
splitType, workerInfo.getTaskId(), isFirstSplit));
try {
// Wait for some split to become available
byte[] serializedInputSplit = availableInputSplits.get(splitType).take();
return serializedInputSplit.length == 0 ? null : serializedInputSplit;
} catch (InterruptedException e) {
throw new IllegalStateException("Interrupted", e);
}
}
}
| java |
<filename>tailwind-preset/package.json
{
"name": "@sdlk/tailwind-preset",
"version": "0.0.27",
"description": "Tailwind preset",
"scripts": {
"build": "tsc -p .",
"dev": "tsc -b . --watch",
"prebuild": "rimraf lib; mkdir -p lib; cp package.json lib/package.json;",
"lint": "eslint src --ext js,ts,tsx",
"typecheck": "tsc --emitDeclarationOnly"
},
"main": "lib/index.js",
"license": "MIT",
"private": false,
"devDependencies": {
"@babel/preset-env": "^7.14.7",
"@babel/preset-typescript": "^7.14.5",
"tailwindcss": "^2.2.4",
"typescript": "^4.3.4"
},
"publishConfig": {
"access": "public"
},
"gitHead": "7efaae827fe61ba1088ce383c0a9e2572ea9c098",
"peerDependencies": {
"tailwindcss": "^2.2.4"
}
}
| json |
<reponame>mamssoGassama/IntroSyntheseImage
#include "cubecorner.h"
CubeCorner::CubeCorner() : TriMesh() {
_name = "CubeCorner";
static const GLfloat v[10][3] = {
{-1,1,-1},{-1,1,1},{1,1,1},{1,1,-1},{-1,-1,-1},{-1,-1,1},{0,-1,1},{1,0,1},{1,-1,0},{1,-1,-1}
};
// triangles vertex indices
static const GLint t[18][3] = {
{1,2,0},{3,0,2},{0,5,1},{4,5,0},{4,0,9},{3,9,0},{1,5,2},{4,9,5},{3,2,9},{4,9,0},{3,0,9},{6,8,7}, // normal side
{5,6,2},{7,2,6},{5,9,6},{8,6,9},{9,2,8},{7,8,2}};
// Fill vertices vector
for (int i=0; i<10 ; ++i)
this->addVertex(v[i][0], v[i][1], v[i][2]);
// Fill triangles vector
for (int i=0; i<18; ++i)
this->addTriangle(t[i][0], t[i][1] ,t[i][2]);
computeNormalsT();
computeNormalsV();
}
| cpp |
After the foreign minister’s comments, Beijing said it hoped New Delhi would work with it in ‘the same direction’ to bring ties back on track at an early date.
The relationship between India and China is going through an “extremely difficult phase” after Beijing’s unilateral attempts to alter the status quo at the Line of Actual Control in Ladakh, said External Affairs Minister S Jaishankar on Thursday, reported PTI.
Jaishankar was referring to the border standoff between India and China since their troops clashed in Galwan Valley in eastern Ladakh in June 2020. The two sides have held 16 rounds of commander-level talks to resolve the dispute.
Jaishankar made the remarks in response to questions posed at the “India’s Vision of the Indo-Pacific” lecture at the Chulalongkorn University in Bangkok, Thailand.
At the event, Jaishankar also said that the world will witness the Asian Century only when China and India come together. Asian Century refers to the dominant role that Asia is expected to play in the 21st century.
“I think if India and China have to come together, there are many reasons to do so, not necessarily only Sri Lanka,” he said.
Both India and China have provided financial assistance to Sri Lanka, which is facing its worst economic crisis in its post-independence history.
Jaishankar said that India has done the best of its abilities to help the island country. “Any help we can give to Sri Lanka at the IMF [International Monetary Fund] that we will naturally do,” he added.
The minister also dismissed criticism about India’s purchase of oil from Russia, reported the Hindustan Times. “We are not the only oil importer and... there are no sanctions on oil,” he said.
European countries and the United States have imposed heavy sanctions on Russia after it invaded Ukraine on February 24. However, India has maintained a neutral approach towards Moscow.
On March 16, India said it was exploring options to buy Russian crude oil, as its prices had tumbled to their lowest amid the Ukraine conflict and the sanctions imposed on Moscow by western countries.
On Thursday, Jaishankar pointed out that there were other countries and regions that made a “very articulate” approach to the Russian invasion but have taken care of their own interests.
The statement came after Ukraine on Wednesday criticised India for buying crude oil from Russia and said that it expected “more practical support” from New Delhi.
On Tuesday, Jaishankar justified India’s decision to buy oil from Russia, saying that every country tries to ensure the best deal possible to cushion high energy prices.
Chinese Foreign Ministry spokesperson Wang Wenbin on Friday backed Jaishankar’s remarks on Asian Century, PTI reported.
A leader in Beijing said once that if China and India cannot achieve sound development, then an Asian Century cannot be achieved, Wang told reporters at a briefing. “China and India are two ancient civilisations, two emerging economies and two big neighbours,” he added.
Wang also reiterated that India and China have far more common interests than differences, and that the two neighbouring countries should not post a threat to each other.
“It is hoped that Indian side can work with China in the same direction to follow through on the common understanding between our two leaders on being each other’s cooperative partners, not causing threats to each other and presenting each other with development opportunities, so that China-India relations can come back to the right track of sound and steady development at an early date and uphold common interest of China, India and the developing world,” Wang said.
On being asked if China will hold talks with India to resolve the border tensions in Eastern Ladakh, Wang said that the “dialogue is effective”.
“I would like to stress that China and India maintain smooth communication over the border issues,” he added, PTI reported.
Wang also addressed China’s stance on the Quad grouping, which includes India, US, Japan and Australia. The bloc intends to offer partner countries an opportunity to counter China’s rising commercial presence in the Asia-Pacific region.
In May, China had criticised the grouping by calling it an attempt to “create a closed club”.
| english |
# Copyright 2015 The Chromium Authors. All rights reserved.
# Use of this source code is governed by a BSD-style license that can be
# found in the LICENSE file.
"""Top-level presubmit script for catapult.
See https://www.chromium.org/developers/how-tos/depottools/presubmit-scripts
for more details about the presubmit API built into depot_tools.
"""
import re
import sys
_EXCLUDED_PATHS = (
r'(.*[\\/])?\.git[\\/].*',
r'.+\.png$',
r'.+\.svg$',
r'.+\.skp$',
r'.+\.gypi$',
r'.+\.gyp$',
r'.+\.gn$',
r'.*\.gitignore$',
r'.*codereview.settings$',
r'.*AUTHOR$',
r'^CONTRIBUTORS\.md$',
r'.*LICENSE$',
r'.*OWNERS$',
r'.*README\.md$',
r'^dashboard[\\/]dashboard[\\/]api[\\/]examples[\\/].*.js',
r'^dashboard[\\/]dashboard[\\/]templates[\\/].*',
r'^experimental[\\/]heatmap[\\/].*',
r'^experimental[\\/]trace_on_tap[\\/]third_party[\\/].*',
r'^perf_insights[\\/]test_data[\\/].*',
r'^perf_insights[\\/]third_party[\\/].*',
r'^telemetry[\\/]third_party[\\/].*',
r'^third_party[\\/].*',
r'^tracing[\\/]\.allow-devtools-save$',
r'^tracing[\\/]bower\.json$',
r'^tracing[\\/]\.bowerrc$',
r'^tracing[\\/]tracing_examples[\\/]string_convert\.js$',
r'^tracing[\\/]test_data[\\/].*',
r'^tracing[\\/]third_party[\\/].*',
r'^py_vulcanize[\\/]third_party[\\/].*',
r'^common/py_vulcanize[\\/].*', # TODO(hjd): Remove after fixing long lines.
)
_GITHUB_BUG_ID_RE = re.compile(r'#[1-9]\d*')
_MONORAIL_BUG_ID_RE = re.compile(r'[1-9]\d*')
_MONORAIL_PROJECT_NAMES = frozenset({'chromium', 'v8', 'angleproject'})
def CheckChangeLogBug(input_api, output_api):
if not input_api.change.issue:
# If there is no change issue, there won't be a bug yet. Skip the check.
return []
# Show a presubmit message if there is no Bug line or an empty Bug line.
if not input_api.change.BugsFromDescription():
return [output_api.PresubmitNotifyResult(
'If this change has associated bugs on GitHub or Monorail, add a '
'"Bug: <bug>(, <bug>)*" line to the patch description where <bug> can '
'be one of the following: catapult:#NNNN, ' +
', '.join('%s:NNNNNN' % n for n in _MONORAIL_PROJECT_NAMES) + '.')]
# Check that each bug in the BUG= line has the correct format.
error_messages = []
catapult_bug_provided = False
for index, bug in enumerate(input_api.change.BugsFromDescription()):
# Check if the bug can be split into a repository name and a bug ID (e.g.
# 'catapult:#1234' -> 'catapult' and '#1234').
bug_parts = bug.split(':')
if len(bug_parts) != 2:
error_messages.append('Invalid bug "%s". Bugs should be provided in the '
'"<project-name>:<bug-id>" format.' % bug)
continue
project_name, bug_id = bug_parts
if project_name == 'catapult':
if not _GITHUB_BUG_ID_RE.match(bug_id):
error_messages.append('Invalid bug "%s". Bugs in the Catapult '
'repository should be provided in the '
'"catapult:#NNNN" format.' % bug)
catapult_bug_provided = True
elif project_name in _MONORAIL_PROJECT_NAMES:
if not _MONORAIL_BUG_ID_RE.match(bug_id):
error_messages.append('Invalid bug "%s". Bugs in the Monorail %s '
'project should be provided in the '
'"%s:NNNNNN" format.' % (bug, project_name,
project_name))
else:
error_messages.append('Invalid bug "%s". Unknown repository "%s".' % (
bug, project_name))
return map(output_api.PresubmitError, error_messages)
def CheckChange(input_api, output_api):
results = []
try:
sys.path += [input_api.PresubmitLocalPath()]
from catapult_build import bin_checks
from catapult_build import html_checks
from catapult_build import js_checks
from catapult_build import repo_checks
results += input_api.canned_checks.PanProjectChecks(
input_api, output_api, excluded_paths=_EXCLUDED_PATHS)
results += input_api.RunTests(
input_api.canned_checks.CheckVPythonSpec(input_api, output_api))
results += CheckChangeLogBug(input_api, output_api)
results += js_checks.RunChecks(
input_api, output_api, excluded_paths=_EXCLUDED_PATHS)
results += html_checks.RunChecks(
input_api, output_api, excluded_paths=_EXCLUDED_PATHS)
results += repo_checks.RunChecks(input_api, output_api)
results += bin_checks.RunChecks(
input_api, output_api, excluded_paths=_EXCLUDED_PATHS)
finally:
sys.path.remove(input_api.PresubmitLocalPath())
return results
def CheckChangeOnUpload(input_api, output_api):
return CheckChange(input_api, output_api)
def CheckChangeOnCommit(input_api, output_api):
return CheckChange(input_api, output_api)
| python |
<reponame>jsoniq/jsoniq
/*
* Copyright 2006-2008 The FLWOR Foundation.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "stdafx.h"
#include "common/shared_types.h"
#include "system/globalenv.h"
#include "context/static_context.h"
#include "runtime/fnput/fnput.h"
#include "store/api/pul.h"
#include "store/api/item_factory.h"
#include "store/api/copymode.h"
#include "zorbatypes/URI.h"
#include <zorba/internal/unique_ptr.h>
namespace zorba
{
/*******************************************************************************
fn:put
********************************************************************************/
bool FnPutIterator::nextImpl(store::Item_t& result, PlanState& planState) const
{
store::Item_t node;
store::Item_t uriItem;
zstring uriString;
zstring resolvedUriString;
URI lTargetUri;
store::Item_t resolvedUriItem;
std::unique_ptr<store::PUL> pul;
PlanIteratorState* state;
DEFAULT_STACK_INIT(PlanIteratorState, state, planState);
consumeNext(node, theChildren[0].getp(), planState);
if (node->getNodeKind()==store::StoreConsts::attributeNode)
{
throw XQUERY_EXCEPTION(
err::FOUP0001,
ERROR_LOC( loc )
);
}
consumeNext(uriItem, theChildren[1].getp(), planState);
uriString = uriItem->getStringValue();
#if 1
resolvedUriString = theSctx->resolve_relative_uri(uriString, false);
GENV_ITEMFACTORY->createAnyURI(resolvedUriItem, resolvedUriString);
#else
GENV_ITEMFACTORY->createAnyURI(resolvedUriItem, uriString);
#endif
try
{
lTargetUri = URI(uriString);
}
catch (XQueryException& e)
{
set_source(e, loc);
e.set_diagnostic(err::FOUP0002);
throw;
}
pul.reset(GENV_ITEMFACTORY->createPendingUpdateList());
pul->addPut(&loc, node, resolvedUriItem);
result = pul.release();
STACK_PUSH(true, state);
STACK_END(state);
}
}
/* vim:set et sw=2 ts=2: */
| cpp |
Big E is one of the most entertaining WWE Superstars today. He has had a fun eleven years in the business and has dawned many roles. Big E along with Kofi Kingston and Xavier Woods formed The New Day back in 2014 and have shared the WWE Tag Team Championship amongst themselves on eight occasions.
Big E was scheduled to appear on WWE's The Bump on Wednesday. It has been revealed that the New Day member will not be making it for the show. The news was reported on WWE's The Bump's official Twitter handle.
While there is no reason reported for Big E pulling out of the appearance, WWE's The Bump has promised to update its fans with a new lineup.
Big E was last seen at WWE Extreme Rules when he teamed up with Kofi Kingston. The two New Day members failed to retain their WWE SmackDown Tag Team Titles against Cesaro and Shinsuke Nakamura. The New Day lost their Titles when Cesaro drove Kingston through two tables.
The New Day has become a mainstay on WWE's shows and one of the top Tag Teams in the company now. The New Day has faced off against the top three-man teams in the WWE. They have battled teams such as The Wyatt Family and The Shield.
Big E has always been a force to reckon with. Ever since his main roster debut in 2012, he has dominated every opponent. Before forming The New Day, Big E won the Intercontinental Championship when he defeated Curtis Axel for the Title. He held on to the Intercontinental Championship for 167 days before losing it to Bad News Barrett.
In a recent interview, Daniel Bryan said that Big E is one of the most underutilized talents in WWE. The Leader Of The Yes Movement would love to fight Big E if given a chance. In the many years that Big E has been around, rumors have done the rounds indicating that he would break out of The New Day and have a Singles run. But that hasn't happened yet and the WWE Universe has been looking forward to it.
| english |
{
"_args": [
[
"objection-guid@3.0.2",
"/Users/okra/Desktop/projects/EtoProject"
]
],
"_from": "objection-guid@3.0.2",
"_id": "objection-guid@3.0.2",
"_inBundle": false,
"_integrity": "sha512-od83U6yvPkJ8KHkTIzzElQXIEFktG3bIvW9EchPX7CXx6OVDMcn9ayamh2N5K67qs9njPUO92zLKNtFgkLXngg==",
"_location": "/objection-guid",
"_phantomChildren": {},
"_requested": {
"type": "version",
"registry": true,
"raw": "objection-guid@3.0.2",
"name": "objection-guid",
"escapedName": "objection-guid",
"rawSpec": "3.0.2",
"saveSpec": null,
"fetchSpec": "3.0.2"
},
"_requiredBy": [
"/"
],
"_resolved": "https://registry.npmjs.org/objection-guid/-/objection-guid-3.0.2.tgz",
"_spec": "3.0.2",
"_where": "/Users/okra/Desktop/projects/EtoProject",
"author": {
"name": "Seegno",
"email": "<EMAIL>",
"url": "https://seegno.com"
},
"bugs": {
"url": "https://github.com/seegno/objection-guid/issues"
},
"dependencies": {
"uuid": "^3.1.0"
},
"description": "objection-guid",
"devDependencies": {
"coveralls": "^2.13.1",
"eslint": "^3.19.0",
"eslint-config-seegno": "^9.0.0",
"eslint-plugin-jest": "^20.0.3",
"jest": "^20.0.3",
"knex": "^0.13.0",
"lint-staged": "^4.0.2",
"objection": "^0.8.5",
"pre-commit": "^1.2.2",
"prettier": "^1.12.1"
},
"engines": {
"node": ">=6"
},
"homepage": "https://github.com/seegno/objection-guid#readme",
"jest": {
"coverageDirectory": "coverage",
"coverageReporters": [
"html",
"lcov",
"text"
],
"coveragePathIgnorePatterns": [
"./test/fixtures"
],
"testEnvironment": "node",
"testRegex": "(test/.*\\.test.js)$"
},
"keywords": [
"guid",
"id",
"objection",
"objectionjs",
"plugin",
"plugins"
],
"license": "MIT",
"lint-staged": {
"index.js": [
"prettier --single-quote --write",
"eslint",
"git add",
"jest --findRelatedTests --forceExit"
],
"test/**/*.js": [
"eslint",
"git add",
"jest --findRelatedTests --forceExit"
]
},
"name": "objection-guid",
"pre-commit": [
"lint-staged"
],
"repository": {
"type": "git",
"url": "git+https://github.com/seegno/objection-guid.git"
},
"scripts": {
"changelog": "github_changelog_generator --no-issues --header-label='# Changelog' --future-release=v$npm_config_future_release && sed -i '' -e :a -e '$d;N;2,4ba' -e 'P;D' CHANGELOG.md",
"cover": "jest --coverage --forceExit",
"coveralls": "npm run cover && cat ./coverage/lcov.info | coveralls",
"lint": "eslint index.js test",
"lint-staged": "lint-staged",
"test": "jest --forceExit",
"test-watch": "jest --watch --onlyChanged",
"version": "npm run changelog --future-release=$npm_package_version && git add -A CHANGELOG.md"
},
"version": "3.0.2"
}
| json |
<filename>inputfile/json/2016-00615.json
{
"id": "2016-00615",
"title": "Wedding sari and blouse belonging to Mrs Marimuthu Ammal, purchased at the P Govindasamy Pillai store",
"source": "Bumblebee",
"path": "inputfile/json/",
"content": "\n accession_no_csv: 2016-00615\n\n Image: \n\n object_work_type: saris (garments)\n\n title_text: Wedding sari and blouse belonging to Mrs Marimuthu Ammal\n purchased at the P Govindasamy Pillai store\n\n preference: main\n\n title_language: \n\n creation_date: Aug-51\n\n creation_place_original_location: Singapore\n\n inscriptions: \n\n inscription_language: \n\n shape: irregular\n\n materials_name: silk (textile)\n\n techniques_name: sewing (needleworking technique)\n\n object_colour: multicoloured\n\n physical_appearance: The image shows a set consisting of a blouse and a sari. The blouse is white in colour and it has patterns all over its surface. It is also short sleeved. The sari is maroon in colour\n with gold bands at its top and bottom. There are lines of floral patterns running vertically down the sari\n as well as horizontally on the gold bands. There is a tear at the bottom right of the sari\n on the gold band.\n\n subject_terms_1: womenswear floral patterns blouses (main garments) wedding dresses folk costume allover patterns\n\n subject_terms_2: Blouses Motifs Women\\u0027s clothing Saris Ethnic costume Wedding costume\n\n subject_terms_3: Indian costumes\n\n sgcool_label_text: Mr. <NAME> (b. in 1920 in Tanjavur) was a prominent violinist\n and Carnatic singer. He arrived in Singapore in 1939 and actively participated in the Indian classical music scene here. <NAME> performed alongside veterans of classical performers such as <NAME> and <NAME> at temple and other music festivals. He also taught violin lessons at the Singapore Malayalee Association from the 1970s to 2000s. He was a member of the Tamils Reform Association and performed his wedding according to the principles of the Self-Respect Movement. He was also employed as a compositor at the Far East Air Force from 1954 to 1970.\n",
"createdDate": "20201127205928",
"version": 0,
"latest": false,
"roles": [],
"metadata": {
"accession_no_csv": "2016-00615",
"Image": "",
"object_work_type": "saris (garments)",
"title_text": "Wedding sari and blouse belonging to <NAME>, purchased at the P Govindasamy Pillai store",
"preference": "main",
"title_language": "",
"creation_date": "Aug-51",
"creation_place_original_location": "Singapore",
"inscriptions": "",
"inscription_language": "",
"shape": "irregular",
"materials_name": "silk (textile)",
"techniques_name": "sewing (needleworking technique)",
"object_colour": "multicoloured",
"physical_appearance": "The image shows a set consisting of a blouse and a sari. The blouse is white in colour and it has patterns all over its surface. It is also short sleeved. The sari is maroon in colour, with gold bands at its top and bottom. There are lines of floral patterns running vertically down the sari, as well as horizontally on the gold bands. There is a tear at the bottom right of the sari, on the gold band.",
"subject_terms_1": "womenswear floral patterns blouses (main garments) wedding dresses folk costume allover patterns",
"subject_terms_2": "Blouses Motifs Women\u0027s clothing Saris Ethnic costume Wedding costume",
"subject_terms_3": "Indian costumes",
"sgcool_label_text": "Mr. <NAME> (b. in 1920 in Tanjavur) was a prominent violinist, and Carnatic singer. He arrived in Singapore in 1939 and actively participated in the Indian classical music scene here. <NAME> performed alongside veterans of classical performers such as <NAME> and <NAME> at temple and other music festivals. He also taught violin lessons at the Singapore Malayalee Association from the 1970s to 2000s. He was a member of the Tamils Reform Association and performed his wedding according to the principles of the Self-Respect Movement. He was also employed as a compositor at the Far East Air Force from 1954 to 1970."
},
"nlpDate": "20201127205928",
"connectorId": 0,
"tags": {}
} | json |
import React, { useContext, useEffect, useState, useCallback } from 'react';
// Styling
import {
Box,
Button,
Divider,
FormControlLabel,
FormHelperText,
Grid,
Radio,
RadioGroup,
Slider,
TextField,
Typography,
useMediaQuery,
} from '@material-ui/core';
import theme from 'config/theme';
import styled, { css, keyframes } from 'styled-components';
import { darken, getLuminance, lighten, mix, opacify, rgba } from 'polished';
import { motion } from 'framer-motion';
import 'styled-components/macro';
// Forms
import { useForm, Controller } from 'react-hook-form';
import { yupResolver } from '@hookform/resolvers/yup';
import * as yup from 'yup';
// Helpers
import { docReady, checkVisible } from 'utils/helpers';
// Helpers
import {
ClearBlock,
GridContainer,
GridItem,
Link,
PageContainer,
SpacedGridContainer,
} from 'components/styles/global';
// Scripts
// import script from 'python/script.py';
import useDidMountEffect from 'components/useDidMountEffect';
import { AppContext } from 'contexts/AppContext';
import useDidMount from 'components/useDidMount';
import { registerUser } from 'actions/authActions';
import { useNotificationQueue } from 'contexts/NotificationsContext';
import { UserContext } from 'contexts/UserContext';
import { useHistory } from 'react-router-dom';
// #region LEFT COLUMN
const SUP__LeftColumn = styled(Grid)`
${(props) => props.theme.breakpoints.down('sm')} {
position: absolute;
z-index: -1;
}
`;
const SUP__LandingImageContainer = styled(GridContainer)`
position: relative;
${(props) => props.theme.breakpoints.up('md')} {
&:before {
z-index: -1;
background: ${(props) => props.theme._colors.blue};
position: absolute;
top: 0;
left: calc(50% - clamp(25vw, 480px) / 2);
transform: translate3d(0, -10%, 0);
content: '';
width: 25vw;
height: 25vw;
max-width: 480px;
max-height: 480px;
border-radius: 50%;
}
}
`;
const LandingImage = styled(motion.img)`
width: 100%;
height: 100%;
`;
const SUP__Heading = styled((props) => <Typography {...props} />)`
color: ${(props) => props.theme._colors.brown};
font-weight: 800;
`;
const SUP__Description = styled((props) => <Typography {...props} />)`
color: ${(props) => props.theme._colors.brown};
`;
// #endregion
// #region RIGHT COLUMN
const SUP__RightColumn = styled(Grid)``;
const Logo = styled((props) => <Typography {...props}>neural.ly</Typography>)`
font-family: Fredericka the Great;
font-style: normal;
font-weight: normal;
/* font-size: 64px; */
line-height: 78px;
letter-spacing: 0.1em;
color: #5551ff;
`;
const SUP__SignUpCard = styled(SpacedGridContainer)`
${(props) =>
props.theme._funcs.card({
variant: 'paper-1',
bg: opacify(-0.04, props.theme._colors.white),
})}
`;
// Form Inputs
const FormLabel = styled(Typography)`
color: ${(props) => props.theme._colors.text};
font-weight: 500;
`;
const CTAButton = styled(Button)`
.MuiButton-label {
letter-spacing: 0.25rem;
}
/* padding: 18px 77px; */
padding-top: ${(props) => props.theme.spacing(2)}px;
padding-bottom: ${(props) => props.theme.spacing(2)}px;
background: ${(props) => props.theme._colors.blue};
background: linear-gradient(
0deg,
rgba(84, 82, 255, 1) 0%,
rgba(97, 94, 255, 1) 100%
);
border-radius: 5px;
font-weight: bold;
color: #fff;
&:hover {
}
`;
const SUP__TextInput = styled(
({
// RHF
reset,
getValues,
setValue,
register,
control,
errors,
formSchema,
setFormSchema,
updateFormSchema,
// ENDRHF
name,
label,
required,
helperText,
defaultValue,
validationSchema,
...props
}) => {
useDidMount(() => {
let schema = {};
if (typeof validationSchema === 'object') {
schema = validationSchema;
} else {
schema = {
[name]: yup.string().required(),
};
}
updateFormSchema(schema);
});
return (
<Controller
name={name}
control={control}
defaultValue={defaultValue || ''}
render={({ field, fieldState }) => (
<TextField
{...field}
name={name}
variant={'outlined'}
error={errors?.[name] ? true : false}
required={required}
label={label}
helperText={helperText || errors?.[name]?.message}
type="string"
{...props}
/>
)}
/>
);
}
)`
.MuiOutlinedInput-root:hover .MuiOutlinedInput-notchedOutline,
.MuiOutlinedInput-notchedOutline {
/* border-color: rgba(0, 0, 0, 0.23); */
border-color: ${(props) => props.theme._colors.blue};
}
.MuiOutlinedInput-root.Mui-focused:not(.Mui-error)
> .MuiOutlinedInput-notchedOutline {
border-color: ${(props) => props.theme._colors.blue};
color: ${(props) => props.theme._colors.blue};
transition: border-color 200ms, color 200ms;
}
.MuiOutlinedInput-root.Mui-error > .MuiOutlinedInput-notchedOutline {
border-color: ${(props) => props.theme._colors.red};
color: ${(props) => props.theme._colors.red};
transition: border-color 200ms, color 200ms;
}
`;
const SUP__RadioInput = styled(
({
// RHF
reset,
getValues,
setValue,
register,
control,
errors,
formSchema,
setFormSchema,
updateFormSchema,
// ENDRHF
name,
items,
label,
required,
helperText,
defaultValue,
validationSchema,
...props
}) => {
useDidMount(() => {
let schema = {};
if (typeof validationSchema === 'object') {
schema = validationSchema;
} else {
schema = {
[name]: yup
.string()
.transform((value) => (value == 'false' ? '' : value))
.typeError(`Please select an option.`)
.required(),
};
}
updateFormSchema(schema);
});
return (
<Controller
name={name}
control={control}
defaultValue={false}
render={({ field }) => (
<GridContainer direction="column">
<Grid item>
<RadioGroup
row
{...field}
onChange={(e) => {
field.onChange(String(e.target.value));
}}
{...props}
>
{items.map((optionText, jdx) => {
return (
<FormControlLabel
value={optionText}
key={jdx}
control={<Radio />}
label={
<Typography
variant="body2"
align="center"
// noWrap
css={`
display: flex;
align-items: center;
`}
>
{optionText}
</Typography>
}
labelPlacement="top"
/>
);
})}
</RadioGroup>
</Grid>
<Grid item>
<FormHelperText error={!!errors?.[name]}>
{helperText || errors?.[name]?.message}
</FormHelperText>
</Grid>
</GridContainer>
)}
/>
);
}
)`
.MuiIconButton-root {
}
.MuiIconButton-root:hover {
background-color: ${(props) => rgba(props.theme._colors.blue, 0.05)};
}
.Mui-checked {
color: ${(props) => props.theme._colors.blue};
svg {
color: ${(props) => props.theme._colors.blue};
}
}
`;
// #endregion
const SignUpPage = styled(({ ...props }) => {
const history = useHistory();
const [formSchema, setFormSchema] = useState({});
const updateFormSchema = (newItem) => {
setFormSchema((prevFormSchema) => ({ ...prevFormSchema, ...newItem }));
};
const {
handleSubmit,
reset,
setValue,
getValues,
control,
register,
formState: { errors },
} = useForm({
defaultValues: {},
// mode: 'onBlur',
resolver: yupResolver(yup.object().shape(formSchema)),
});
const formElementProps = {
reset,
getValues,
setValue,
register,
control,
errors,
formSchema,
setFormSchema,
updateFormSchema,
};
const notification = useNotificationQueue();
const appCtx = useContext(AppContext);
const [userCtx, dispatch] = useContext(UserContext);
// Set layout options (e.g. page title, dispaly header, etc.)
useEffect(() => {
appCtx.setMainLayoutOptions({
pageTitle: 'Sign Up | neural.ly',
hideHeader: true,
});
}, [appCtx.setMainLayoutOptions]);
// Screen size
const isXSmall = useMediaQuery(theme.breakpoints.down('xs'));
const isSmall = useMediaQuery(theme.breakpoints.down('sm'));
// User state change listeners
useDidMountEffect(() => {
if (userCtx.auth.isAuthenticated) {
history.push('/user/dashboard');
}
}, [userCtx.auth?.isAuthenticated]);
// Form submission handling
const onSubmit = (data) => {
const userData = {
...data,
};
registerUser(userData, dispatch, notification); // since we handle the redirect within our component, we don't need to pass in this.props.history as a parameter
};
// #region SIGN UP CARD
const SignUpCard = (
<>
{/* Sign Up Card */}
<SUP__SignUpCard spacing={2}>
{/* Logo */}
<Grid item xs={12} zeroMinWidth>
<Logo
align="center"
variant={isXSmall ? 'h2' : isSmall ? 'h2' : 'h3'}
noWrap
/>
</Grid>
<Grid item xs={12}>
<Typography align="center" variant="h5">
Create your account
</Typography>
</Grid>
{/* Form */}
<Grid item xs={10}>
<form onSubmit={handleSubmit(onSubmit)}>
<SpacedGridContainer justifyContent="flex-start" spacing={2}>
{/* Name */}
<Grid item xs={12}>
<SpacedGridContainer>
<Grid item xs={12}>
<FormLabel variant="h6">Name</FormLabel>
</Grid>
<Grid item xs={12}>
<SUP__TextInput
fullWidth
name="name"
required
validationSchema={{
email: yup.string().required(),
}}
{...formElementProps}
/>
</Grid>
</SpacedGridContainer>
</Grid>
{/* Email */}
<Grid item xs={12}>
<SpacedGridContainer>
<Grid item xs={12}>
<FormLabel variant="h6">Email address</FormLabel>
</Grid>
<Grid item xs={12}>
<SUP__TextInput
fullWidth
name="email"
required
validationSchema={{
email: yup.string().email().required(),
}}
{...formElementProps}
/>
</Grid>
</SpacedGridContainer>
</Grid>
{/* Password */}
<Grid item xs={12}>
<SpacedGridContainer>
<Grid item xs={12}>
<FormLabel variant="h6">Password</FormLabel>
</Grid>
<Grid item xs={12}>
<SUP__TextInput
fullWidth
name="password"
type="password"
required
validationSchema={{
password: <PASSWORD>(),
}}
{...formElementProps}
/>
</Grid>
</SpacedGridContainer>
</Grid>
{/* Password */}
<Grid item xs={12}>
<SpacedGridContainer>
<Grid item xs={12}>
<FormLabel variant="h6">I am a ...</FormLabel>
</Grid>
<Grid item xs={12}>
<Grid container justifyContent="space-evenly">
<SUP__RadioInput
name="userType"
required
items={['Patient', 'Clinician']}
validationSchema={{
userType: yup
.string()
.transform((value) =>
value == 'false' ? '' : value
)
.transform((value) => value.toLowerCase())
.typeError(`Please select an option.`)
.required(),
}}
{...formElementProps}
/>
</Grid>
</Grid>
</SpacedGridContainer>
</Grid>
{/* Login Button*/}
<Grid item xs={12}>
<Box py={2}>
<CTAButton
fullWidth
size="large"
type="submit"
// onClick={}
>
Sign Up
</CTAButton>
</Box>
</Grid>
</SpacedGridContainer>
</form>
</Grid>
{/* Divider */}
<Grid item xs={12}>
<SpacedGridContainer>
<Grid item xs={10} md={9}>
<Divider />
</Grid>
</SpacedGridContainer>
</Grid>
{/* Already have an account? Sign in */}
<Grid item xs={12}>
<Box py={2}>
<Typography variant="h6" align="center" gutterBottom>
Already have an account? <Link to="/">Sign in</Link>
</Typography>
</Box>
</Grid>
</SUP__SignUpCard>
</>
);
//#endregion
return (
<PageContainer alignContent="center" {...props}>
{/* <ClearBlock xs={12} pb={{ xs: 20, sm: 20, md: 30, lg: 30, xl: 30 }} /> */}
<Grid item xs={11}>
<SpacedGridContainer
spacing={isSmall ? 4 : 0}
direction={isSmall ? 'column' : 'row'}
>
{/* Left */}
<SUP__LeftColumn item xs={12} md={6}>
<SpacedGridContainer
alignItems="center"
justifyContent="center"
alignContent="center"
spacing={4}
>
<Grid item>
<SUP__LandingImageContainer>
<LandingImage src={'img/signup.svg'} />
</SUP__LandingImageContainer>
</Grid>
<Grid item>
<SUP__Heading align="left" variant="h2"></SUP__Heading>
</Grid>
</SpacedGridContainer>
</SUP__LeftColumn>
{/* Right */}
<SUP__RightColumn item xs={12} md={6}>
<Grid container justifyContent="center">
<Grid item xs={12} sm={8} md={10} lg={8} xl={6}>
{SignUpCard}
</Grid>
</Grid>
</SUP__RightColumn>
</SpacedGridContainer>
</Grid>
{/* <ClearBlock xs={12} pb={{ xs: 20, sm: 20, md: 30, lg: 30, xl: 30 }} /> */}
</PageContainer>
);
})`
position: relative;
`;
export default SignUpPage;
| javascript |
<filename>package.json
{
"name": "react-native-android-contactpicker",
"version": "0.4.0",
"description": "A react-native wrapper for android-contactpicker to facilitate multi-select in one intent",
"main": "index.js",
"scripts": {
"test": "echo \"Error: no test specified\" && exit 1"
},
"keywords": [
"react-component",
"android-contactpicker",
"react-native",
"android",
"contact",
"addressbook",
"email",
"multi-select",
"picker"
],
"repository": {
"type": "git",
"url": "https://github.com/lwhiteley/react-native-android-contactpicker"
},
"author": "lwhiteley (http://github.com/lwhiteley)",
"license": "MIT",
"bugs": {
"url": "https://github.com/lwhiteley/react-native-android-contactpicker/issues"
},
"homepage": "https://github.com/lwhiteley/react-native-android-contactpicker",
"peerDependencies": {
"react-native": ">=0.29.0"
},
"devDependencies": {}
}
| json |
<reponame>FSource/FEngine<filename>lib/libfaeris/src/math/easing/FsQuadEase.cc<gh_stars>0
#include "FsQuadEase.h"
#include "FsEasingUtil.h"
NS_FS_BEGIN
const char* QuadEase::className()
{
return FS_QUAD_EASE_CLASS_NAME;
}
QuadEase* QuadEase::create()
{
QuadEase* ret=new QuadEase;
return ret;
}
float QuadEase::getEaseIn(float t)
{
return EasingUtil::easeInQuad(t);
}
float QuadEase::getEaseOut(float t)
{
return EasingUtil::easeOutQuad(t);
}
float QuadEase::getEaseInOut(float t)
{
return EasingUtil::easeInOutQuad(t);
}
float QuadEase::getEaseOutIn(float t)
{
return EasingUtil::easeOutInQuad(t);
}
NS_FS_END
| cpp |
"""This test's if user successfully registered """
def test_successful_register(successful_registration):
assert successful_registration.email == '<EMAIL>'
assert successful_registration.password == 'Password'
assert successful_registration.confirm == 'Password'
response = successful_registration.get("/dashboard")
assert response.status_code == 302
assert b'Congrats, registration success' in response.data | python |
/*
* Copyright (c) 2018-2019, <NAME>
* All rights reserved.
* Licensed under BSD-2-Clause license.
*/
#include "sled/statistics.h"
namespace sled {
void StatisticsReport::add(const std::string &name, StatisticImpl stat) {
// XXX: Handle overwrites
m_statistics[name] = stat;
}
StatisticImpl StatisticsReport::get(const std::string &name) {
auto it = m_statistics.find(name);
if (it == m_statistics.end()) {
return StatisticImpl{};
}
return it->second;
}
} // namespace sled
| cpp |
<filename>com/aptitute_tests/RSL.py
a = [2, 4, 5, 7, 8, 9]
sum = 0
for i in range(len(a) - 1):
if a[i] % 2 == 0:
sum = sum + a[i]
print(sum)
| python |
<reponame>jwzimmer/tv-tropes
{
"PoliceAreUseless": [
"RussianHumour",
"BystanderSyndrome",
"DaChief",
"AgentMulder",
"TeensAreMonsters",
"AdultsAreUseless",
"CassandraTruth",
"AmateurSleuth",
"InspectorLestrade",
"ObstructiveBureaucrat",
"AvertedTrope",
"CopShow",
"PoliceProcedural",
"ScrewTheRulesImDoingWhatsRight",
"RealityIsUnrealistic",
"AwfulTruth",
"TheEveryman",
"TheScapegoat",
"DirtyCop",
"DonutMessWithACop",
"DonutMessWithACop",
"FastFoodNation",
"TheDragon",
"TheBadGuysAreCops",
"ThereAreNoPolice",
"GenreSavvy",
"HandWave",
"TheOnlyOne",
"BadCopIncompetentCop",
"YouHaveToBelieveMe",
"LawfulPushover",
"LemmingCops",
"IFoughtTheLawAndTheLawWon",
"TheMenInBlack",
"MilitariesAreUseless",
"TheLopsidedArmOfTheLaw",
"HandWave",
"PoliceBrutality",
"BadCopIncompetentCop",
"HollywoodPoliceDrivingAcademy",
"FanWorks",
"FilmNoir",
"BlatantLies",
"CluelessDetective",
"PsychoSerum",
"HardboiledDetective",
"RainOfSomethingUnusual",
"ScrewTheRulesIMakeThem",
"MissingWhiteWomanSyndrome",
"PaterFamilicide",
"WretchedHive",
"ZombieApocalypse",
"DependingOnTheWriter",
"JustifiedTrope",
"SilverBullet",
"SilverBullet",
"ShoutOut",
"LawfulGood",
"PlayedForLaughs",
"BeneathSuspicion",
"SerialKiller",
"PlayedForLaughs",
"AccidentalMurder",
"DiggingYourselfDeeper",
"WellIntentionedExtremist",
"TheFool",
"BigDamnHeroes",
"AWizardDidIt",
"StalkerWithACrush",
"Yakuza",
"FriendOnTheForce",
"RedShirt",
"BigBad",
"CardboardPrison",
"HairTriggerTemper",
"TheHero",
"ObviouslyEvil",
"CapeBusters",
"TheDreaded",
"DirtyCop",
"LampshadeHanging",
"RuleOfFunny",
"DirtyCop",
"AdultFear"
]
} | json |
<gh_stars>0
---
layout: null
---
{% assign episodes = site.episodes | reverse %}
{% for episode in episodes %}
{% assign episode_id = episode.episode | append: '' %}
{% assign padded_id = episode_id | prepend: '000' | slice: -3, 3 %}
{% assign bio = '<p>🎙️ 來賓簡介：<br>' %}
{% for guest_name in episode.guests %}
{% assign guest = site.guests | where_exp: "item", "item.id contains guest_name" | first %}
{% assign bio = bio | append: guest.content %}
{% if guest.website %}
{% assign bio = bio | append: '<br>網站 <a href="' | append: guest.website | append: '">' | append: guest.website | append: '</a>' %}
{% endif %}
{% if guest.facebook %}
{% assign bio = bio | append: '<br>Facebook <a href="' | append: guest.facebook | append: '">' | append: guest.facebook | append: '</a>' %}
{% endif %}
{% if guest.instagram %}
{% assign bio = bio | append: '<br>Instagram <a href="' | append: guest.instagram | append: '">' | append: guest.instagram | append: '</a>' %}
{% endif %}
{% if guest.youtube %}
{% assign bio = bio | append: '<br>Youtube <a href="' | append: guest.youtube | append: '">' | append: guest.youtube | append: '</a>' %}
{% endif %}
{% endfor %}
{% assign bio = bio | append: '</p>' %}
{% unless episode.guests %}
{% assign bio = '' %}
{% endunless %}
{% assign timeline = '<p>✅ 本集重點：<ul>' %}
{% for point in site.data.podcast_data[episode_id].timeline %}
{% assign timeline = timeline | append: '<li>(' | append: point.time | append: ') ' | append: point.text | append: '</li>' %}
{% endfor %}
{% assign timeline = timeline | append: '</ul></p>' %}
{% assign url = 'https://ltsoj.com/podcast-ep' | append: padded_id %}
{% assign footer = '<p>Show note <a href="' | append: url | append: '">' | append: url | append: '</a>' %}
{% assign footer = footer | append: '<br>官網 <a href="https://ltsoj.com">https://ltsoj.com</a><br>Facebook: <a href="https://facebook.com/lifetimesojourner">https://facebook.com/lifetimesojourner</a><br>Instagram: <a href="https://instagram.com/travel.wok">https://instagram.com/travel.wok</a><br>節目回饋 <a href="https://forms.gle/4v9Xc5PJz4geQp7K7">https://forms.gle/4v9Xc5PJz4geQp7K7</a></p>' %}
{% assign description = site.data.podcast_data[episode_id].description | strip_html | markdownify | append: bio | append: timeline | append: footer %}
<h2>{{episode.title}}</h2>
{{description}}
<hr>
{% endfor %} | html |
{"topic_31": {"num_tags": 8, "name": "topic_31", "full_name": "topic_31", "num_included_tokens": 8}, "topic_33": {"num_tags": 14, "name": "topic_33", "full_name": "topic_33", "num_included_tokens": 14}, "topic_32": {"num_tags": 14, "name": "topic_32", "full_name": "topic_32", "num_included_tokens": 14}, "topic_28": {"num_tags": 6, "name": "topic_28", "full_name": "topic_28", "num_included_tokens": 6}, "topic_42": {"num_tags": 19, "name": "topic_42", "full_name": "topic_42", "num_included_tokens": 19}, "topic_29": {"num_tags": 1, "name": "topic_29", "full_name": "topic_29", "num_included_tokens": 1}, "topic_13": {"num_tags": 15, "name": "topic_13", "full_name": "topic_13", "num_included_tokens": 15}, "topic_48": {"num_tags": 9, "name": "topic_48", "full_name": "topic_48", "num_included_tokens": 9}, "topic_22": {"num_tags": 49, "name": "topic_22", "full_name": "topic_22", "num_included_tokens": 49}, "topic_49": {"num_tags": 4, "name": "topic_49", "full_name": "topic_49", "num_included_tokens": 4}, "topic_20": {"num_tags": 13, "name": "topic_20", "full_name": "topic_20", "num_included_tokens": 13}, "topic_23": {"num_tags": 3, "name": "topic_23", "full_name": "topic_23", "num_included_tokens": 3}, "topic_7": {"num_tags": 3, "name": "topic_7", "full_name": "topic_7", "num_included_tokens": 3}, "topic_6": {"num_tags": 1, "name": "topic_6", "full_name": "topic_6", "num_included_tokens": 1}, "topic_5": {"num_tags": 6, "name": "topic_5", "full_name": "topic_5", "num_included_tokens": 6}, "topic_3": {"num_tags": 10, "name": "topic_3", "full_name": "topic_3", "num_included_tokens": 10}, "topic_1": {"num_tags": 2, "name": "topic_1", "full_name": "topic_1", "num_included_tokens": 2}, "topic_38": {"num_tags": 4, "name": "topic_38", "full_name": "topic_38", "num_included_tokens": 4}, "topic_12": {"num_tags": 1, "name": "topic_12", "full_name": "topic_12", "num_included_tokens": 1}, "topic_16": {"num_tags": 1, "name": "topic_16", "full_name": "topic_16", "num_included_tokens": 1}} | json |
<gh_stars>100-1000
export * from './assignSupremeCourtEmail'
export * from './applicationApproved'
export * from './applicationRejected'
| typescript |
After a shock defeat at Carrow Road against Norwich City, Manchester City came back in some style. While most would’ve expected Manchester City to win against Watford at home, not many would’ve expected them to win 8-0 and it could’ve been even more brutal as they missed some easy chances.
Manchester City are currently five points behind leaders Liverpool and they will know that they cannot afford to drop points anytime soon. Liverpool are having all the momentum with them and City are under pressure to ensure that the five-point difference does not get any bigger. City will be heading into this weekend’s game with confidence and will be hoping to build on their mammoth victory. Kevin De Bruyne, Bernardo Silva and Raheem Sterling are in top form and Sergio Aguero is leading the race for the golden boot.
They will be taking on a struggling Everton side that has lost their last two league games and Marco Silva is under pressure to turn around fortunes at Merseyside. Everton have spent a lot of money under Farhad Moshiri since he became the majority stakeholder a few years back but they have not shown any dramatic improvements.
One could argue even the likes of Leicester and West Ham have overtaken them despite not spending as much money as Everton. Everton are under pressure to turn this bad run of form around and City is not ideally a side you would want to face when you are low on confidence. But Everton have a good record at Goodison Park and will be hoping to put up a strong performance in front of their fans.
Manchester City are one of the highest-scoring teams the league has ever seen. They are so dominant and goal scoring has never been a big issue for them. However, their defence has looked iffy at times this season and Everton could score as well. At odds of 1.76, it seems like a good punt to take.
While one expects City to definitely score, Everton have got some exciting talents like Kean, Richarlison, and Iwobi amongst others and they too could muster a goal. With odds at 1.86, it will not be a surprise to see both of them score at all.
Both these players are in brilliant form and have started off the season in the same way they ended the last one. Both will be keen to make sure they do their best to catch up to Liverpool, so it will be a safe bet at odds of 1.93 and 2.18, respectively.
Checkout the odds at BigPesa.
| english |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.