text stringlengths 1 1.04M | language stringclasses 25 values |
|---|---|
{"sir-trevor.css":"sha256-cO8SOTL9mYJUVwxfPBBhu8+IxDXGG9joHoS5b1a9iio=","sir-trevor.js":"sha256-kuSCUBpK7xWzd5JI8WdxQIG6VWRX74EsXBv/5CkvpUY=","sir-trevor.min.css":"sha256-chcA5CKt6qEWc1iwIagsHu3hcMRqkNILtRHO74j42hs=","sir-trevor.min.js":"sha256-zcxQTZOfafNWb5naFC1CvfSZJO2g4oJ/qSRyFZgelwE="} | json |
I purchased a usb card reader to read mini sd card from ebay. Today i tried reading it in all the usb ports of my laptop but it was not showing me the contents of the card instead a cd drive icon comes, when clicked on it , shows please insert a disk. I have attached the pic along with this post. In the pic, the left one is my laptops original dvd drive whereas the right is the created by the usb card reader which does not opens. How to make the usb card reader work?
| english |
'use strict';
var rscheme = /^(?:[a-z\u00a1-\uffff0-9-+]+)(?::(?:\/\/)?)/i;
var UrlHelper = {
// Placeholder anchor tag to format URLs.
a: null,
getUrlFromInput: function urlHelper_getUrlFromInput(input) {
this.a = this.a || document.createElement('a');
this.a.href = input;
return this.a.href;
},
_getScheme: function(input) {
// This function returns one of followings
// - scheme + ':' (ex. http:)
// - scheme + '://' (ex. http://)
// - null
return (rscheme.exec(input) || [])[0];
},
hasScheme: function(input) {
return !!this._getScheme(input);
},
isURL: function urlHelper_isURL(input) {
return !UrlHelper.isNotURL(input);
},
isNotURL: function urlHelper_isNotURL(input) {
// in bug 904731, we use <input type='url' value=''> to
// validate url. However, there're still some cases
// need extra validation. We'll remove it til bug fixed
// for native form validation.
//
// for cases, ?abc and "a? b" which should searching query
var case1Reg = /^(\?)|(\?.+\s)/;
// for cases, pure string
var case2Reg = /[\?\.\s\:]/;
// for cases, data:uri and view-source:uri
var case3Reg = /^(data|view-source)\:/;
var str = input.trim();
if (case1Reg.test(str) || !case2Reg.test(str) ||
this._getScheme(str) === str) {
return true;
}
if (case3Reg.test(str)) {
return false;
}
// require basic scheme before form validation
if (!this.hasScheme(str)) {
str = 'http://' + str;
}
if (!this.urlValidate) {
this.urlValidate = document.createElement('input');
this.urlValidate.setAttribute('type', 'url');
}
this.urlValidate.setAttribute('value', str);
return !this.urlValidate.validity.valid;
},
/**
* Resolve a URL against a base URL.
*
* @param url String URL to resolve.
* @param baseURL String Base URL to resolve against.
* @returns String resolved URL or null.
*/
resolveUrl: function urlHelper_resolveURL(url, baseUrl) {
if (!url) {
return null;
}
try {
return new URL(url, baseUrl).href;
} catch(e) {
return null;
}
},
/**
* Get the hostname from a URL.
*
* @param String URL to process.
* @returns String hostname of URL.
*/
getHostname: function urlHelper_getHostname(url) {
try {
return new URL(url).hostname;
} catch(e) {
return null;
}
}
};
| javascript |
# -*- mode:python; coding:utf-8 -*-
# Copyright (c) 2020 IBM Corp. All rights reserved.
#
# 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.
"""Tests for trestle update action class."""
from datetime import datetime
from typing import List
from trestle.core.models.actions import UpdateAction
from trestle.core.models.elements import Element, ElementPath
from trestle.oscal import target
def test_update_action(sample_target_def):
"""Test update action."""
element = Element(sample_target_def)
metadata = target.Metadata(
**{
'title': 'My simple catalog',
'last-modified': datetime.now().astimezone(),
'version': '0.0.0',
'oscal-version': '1.0.0-Milestone3'
}
)
sub_element_path = ElementPath('target-definition.metadata')
prev_metadata = element.get_at(sub_element_path)
uac = UpdateAction(metadata, element, sub_element_path)
uac.execute()
assert element.get_at(sub_element_path) is not prev_metadata
assert element.get_at(sub_element_path) == metadata
uac.rollback()
assert element.get_at(sub_element_path) == prev_metadata
assert element.get_at(sub_element_path) is not metadata
def test_update_list_sub_element_action(sample_target_def):
"""Test setting a list."""
element = Element(sample_target_def)
parties: List[target.Party] = []
parties.append(
target.Party(**{
'uuid': 'ff47836c-877c-4007-bbf3-c9d9bd805000', 'party-name': 'TEST1', 'type': 'organization'
})
)
parties.append(
target.Party(**{
'uuid': 'ee88836c-877c-4007-bbf3-c9d9bd805000', 'party-name': 'TEST2', 'type': 'organization'
})
)
sub_element_path = ElementPath('target-definition.metadata.parties.*')
uac = UpdateAction(parties, element, sub_element_path)
uac.execute()
assert element.get_at(sub_element_path) == parties
| python |
import {ComponentFixture, TestBed, waitForAsync} from '@angular/core/testing';
import {IonicModule} from '@ionic/angular';
import {TeamsPage} from './teams-page.component';
describe('HomePage', () => {
let component: TeamsPage;
let fixture: ComponentFixture<TeamsPage>;
beforeEach(waitForAsync(() => {
TestBed.configureTestingModule({
declarations: [TeamsPage],
imports: [IonicModule.forRoot()]
}).compileComponents();
fixture = TestBed.createComponent(TeamsPage);
component = fixture.componentInstance;
fixture.detectChanges();
}));
it('should create', () => {
expect(component).toBeTruthy();
});
});
| typescript |
{
"status": "OK",
"files": [
{% for file in files %}
{
"filename": "{{file.name}}",
"type": "{{file.type}}",
"id": {{file.id}}
}{% if not loop.last %},{% endif %}
{% endfor %}
],
"doc_errors": [
{% for error in doc_form.uploaded_file.errors %}
"{{error}}"{% if not loop.last %},{% endif %}
{% endfor %}
],
"struc_errors": [
{% for error in struc_form.uploaded_file.errors %}
"{{error}}"{% if not loop.last %},{% endif %}
{% endfor %}
]
}
| json |
<gh_stars>1-10
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<functional>
#include<stack>
#include<queue>
#include<cstdlib>
#include<deque>
using namespace std;
class Solution {
public:
int coinChange(vector<int>& coins, int amount) {
vector<int> dp (amount + 1,-1);
for (int c : coins)if(amount >= c) dp[c] = 1;
dp[0] = 0;
for (int i = 1; i <= amount; i++) {
int tempmin = INT_MAX/2;
for (int c : coins) {
if (i - c < 0|| dp[i - c] < 0) continue;
if (dp[i - c] < tempmin) tempmin = dp[i - c];
}
if (tempmin != INT_MAX / 2) dp[i] = tempmin + 1;
}
return dp[amount];
}
}; | cpp |
{
"id": 22004,
"citation_title": "What Drives Racial and Ethnic Differences in High Cost Mortgages? The Role of High Risk Lenders",
"citation_author": [
"<NAME>",
"<NAME>",
"<NAME>"
],
"citation_publication_date": "2016-02-22",
"issue_date": "2016-02-19",
"revision_date": "2020-08-21",
"topics": [
"Financial Economics",
"Financial Institutions",
"Health, Education, and Welfare",
"Education",
"Labor Economics",
"Demography and Aging",
"Labor Discrimination",
"Regional and Urban Economics"
],
"program": [
"Law and Economics",
"Public Economics"
],
"projects": null,
"working_groups": [
"Household Finance",
"Urban Economics"
],
"abstract": "\n\nThis paper examines racial and ethnic differences in high cost mortgage lending in seven diverse metropolitan areas from 2004-2007. Even after controlling for credit score and other key risk factors, African-American and Hispanic home buyers are 105 and 78 percent more likely to have high cost mortgages for home purchases. The increased incidence of high cost mortgages is attributable to both sorting across lenders (60-65 percent) and differential treatment of equally qualified borrowers by lenders (35-40 percent). The vast majority of the racial and ethnic differences across lender can be explained by a single measure of the lender\u2019s foreclosure risk and most of the within-lender differences are concentrated at high-risk lenders. Thus, differential exposure to high-risk lenders combined with the differential treatment by these lenders explains almost all of the racial and ethnic differences in high cost mortgage borrowing.\n\n",
"acknowledgement": "\nThe analysis presented in this NBER Working Paper substantially extends that reported in our earlier NBER WP #20762, \u201cRace, Ethnicity and High-Cost Mortgage Lending,\u201d which should be considered superseded by this paper. <NAME>, <NAME>, <NAME> and <NAME> provided outstanding research assistance. The analyses presented in this paper uses information provided by a major credit repository. However, the substantive content of the paper is the responsibility of the authors and does not reflects the specific views of any credit reporting agencies. This work was supported by Ford Foundation, Research Sponsors Program of the Zell/Lurie Real Estate Center at Wharton, and the Center for Real Estate and Urban Economic Studies at the University of Connecticut for financial support. The views expressed herein are those of the authors and do not necessarily reflect the views of the National Bureau of Economic Research.\n\n\n\n<NAME>\n\nRoss gratefully acknowledges funding from the National Institute for Child Health and Development, the MacArthur Foundation, the Ford Foundation. Ross has also worked recently as a consultant for the Urban Institute and for K&L Gates LLP.\n\n\n"
} | json |
<reponame>abarrak/APIcast
{
"$schema": "http://apicast.io/policy-v1.1/schema#manifest#",
"name": "Upstream Connection",
"summary": "Allows to configure several options for the connections to the upstream",
"description": "Allows to configure several options for the connections to the upstream",
"version": "builtin",
"configuration": {
"type": "object",
"properties": {
"connect_timeout": {
"description": "Timeout for establishing a connection (in seconds).",
"type": "integer"
},
"send_timeout": {
"description": "Timeout between two successive write operations (in seconds).",
"type": "number",
"exclusiveMinimum": 0
},
"read_timeout": {
"description": "Timeout between two successive read operations (in seconds).",
"type": "number",
"exclusiveMinimum": 0
}
}
}
}
| json |
use colored::*;
use best_route_finder::{RoutingTableTree};
fn main() {
let mut table = RoutingTableTree::new();
println!("{}", "Errors when inserting by string".green().underline());
match table.insert_by_string("0.0.0.1", "eth0") {
Ok(_) => {},
Err(error) => println!("{}", error),
};
match table.insert_by_string("0.0.0.1/a", "eth0") {
Ok(_) => {},
Err(error) => println!("{}", error),
};
match table.insert_by_string("0.0.0.0.1/16", "eth0") {
Ok(_) => {},
Err(error) => println!("{}", error)
};
match table.insert_by_string("0.0.0.1/35", "eth0") {
Ok(_) => {},
Err(error) => println!("{}", error)
};
println!("\n{}", "Errors when searching by string".green().underline());
match table.search_by_string("0.0.0.0.1") {
Ok(_) => {},
Err(error) => println!("{}", error)
};
}
| rust |
Surreal in Odia: What's Odia for surreal? If you want to know how to say surreal in Odia, you will find the translation here. We hope this will help you to understand Odia better.
"Surreal in Odia." In Different Languages, https://www.indifferentlanguages.com/words/surreal/odia. Accessed 07 Oct 2023.
Check out other translations to the Odia language:
| english |
<reponame>dankohn/riaps-core
#include <CompThree.h>
namespace leaderwithtree {
namespace components {
CompThree::CompThree(_component_conf &config, riaps::Actor &actor) :
CompThreeBase(config, actor), m_joinedToA(false) {
_logger->set_pattern("[%n] %v");
}
void CompThree::OnClock(riaps::ports::PortBase *port) {
if (!m_joinedToA){
_logger->info("Component joins to {}:{}", groupIdA.groupTypeId, groupIdA.groupName);
auto joined = JoinGroup(groupIdA);
if (joined){
m_joinedToA = true;
}
_logger->error_if(!joined, "Couldn't join to group {}:{}", groupIdA.groupTypeId, groupIdA.groupName);
}
_logger->info("The leader is: {}", GetLeaderId(groupIdA));
}
void CompThree::OnGroupMessage(const riaps::groups::GroupId& groupId,
capnp::FlatArrayMessageReader& capnpreader, riaps::ports::PortBase* port){
}
CompThree::~CompThree() {
}
}
}
riaps::ComponentBase *create_component(_component_conf &config, riaps::Actor &actor) {
auto result = new leaderwithtree::components::CompThree(config, actor);
return result;
}
void destroy_component(riaps::ComponentBase *comp) {
delete comp;
}
| cpp |
// Copyright 2016 The Fuchsia Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <minfs/format.h>
#include <minfs/fsck.h>
#include "minfs-private.h"
#include <utility>
namespace minfs {
class MinfsChecker {
public:
MinfsChecker();
zx_status_t Init(fbl::unique_ptr<Bcache> bc, const Superblock* info);
void CheckReserved();
zx_status_t CheckInode(ino_t ino, ino_t parent, bool dot_or_dotdot);
zx_status_t CheckUnlinkedInodes();
zx_status_t CheckForUnusedBlocks() const;
zx_status_t CheckForUnusedInodes() const;
zx_status_t CheckLinkCounts() const;
zx_status_t CheckAllocatedCounts() const;
zx_status_t CheckJournal() const;
// "Set once"-style flag to identify if anything nonconforming
// was found in the underlying filesystem -- even if it was fixed.
bool conforming_;
private:
DISALLOW_COPY_ASSIGN_AND_MOVE(MinfsChecker);
zx_status_t GetInode(Inode* inode, ino_t ino);
// Returns the nth block within an inode, relative to the start of the
// file. Returns the "next_n" which might contain a bno. This "next_n"
// is for performance reasons -- it allows fsck to avoid repeatedly checking
// the same indirect / doubly indirect blocks with all internal
// bno unallocated.
zx_status_t GetInodeNthBno(Inode* inode, blk_t n, blk_t* next_n,
blk_t* bno_out);
zx_status_t CheckDirectory(Inode* inode, ino_t ino,
ino_t parent, uint32_t flags);
const char* CheckDataBlock(blk_t bno);
zx_status_t CheckFile(Inode* inode, ino_t ino);
fbl::unique_ptr<Minfs> fs_;
RawBitmap checked_inodes_;
RawBitmap checked_blocks_;
uint32_t alloc_inodes_;
uint32_t alloc_blocks_;
fbl::Array<int32_t> links_;
blk_t cached_doubly_indirect_;
blk_t cached_indirect_;
uint8_t doubly_indirect_cache_[kMinfsBlockSize];
uint8_t indirect_cache_[kMinfsBlockSize];
};
zx_status_t MinfsChecker::GetInode(Inode* inode, ino_t ino) {
if (ino >= fs_->Info().inode_count) {
FS_TRACE_ERROR("check: ino %u out of range (>=%u)\n",
ino, fs_->Info().inode_count);
return ZX_ERR_OUT_OF_RANGE;
}
fs_->GetInodeManager()->Load(ino, inode);
if ((inode->magic != kMinfsMagicFile) && (inode->magic != kMinfsMagicDir)) {
FS_TRACE_ERROR("check: ino %u has bad magic %#x\n", ino, inode->magic);
return ZX_ERR_IO_DATA_INTEGRITY;
}
return ZX_OK;
}
#define CD_DUMP 1
#define CD_RECURSE 2
zx_status_t MinfsChecker::GetInodeNthBno(Inode* inode, blk_t n,
blk_t* next_n, blk_t* bno_out) {
// The default value for the "next n". It's easier to set it here anyway,
// since we proceed to modify n in the code below.
*next_n = n + 1;
if (n < kMinfsDirect) {
*bno_out = inode->dnum[n];
return ZX_OK;
}
n -= kMinfsDirect;
uint32_t i = n / kMinfsDirectPerIndirect; // indirect index
uint32_t j = n % kMinfsDirectPerIndirect; // direct index
if (i < kMinfsIndirect) {
blk_t ibno;
if ((ibno = inode->inum[i]) == 0) {
*bno_out = 0;
*next_n = kMinfsDirect + (i + 1) * kMinfsDirectPerIndirect;
return ZX_OK;
}
if (cached_indirect_ != ibno) {
zx_status_t status;
if ((status = fs_->ReadDat(ibno, indirect_cache_)) != ZX_OK) {
return status;
}
cached_indirect_ = ibno;
}
uint32_t* ientry = reinterpret_cast<uint32_t*>(indirect_cache_);
*bno_out = ientry[j];
return ZX_OK;
}
n -= kMinfsIndirect * kMinfsDirectPerIndirect;
i = n / (kMinfsDirectPerDindirect); // doubly indirect index
n -= (i * kMinfsDirectPerDindirect);
j = n / kMinfsDirectPerIndirect; // indirect index
uint32_t k = n % kMinfsDirectPerIndirect; // direct index
if (i < kMinfsDoublyIndirect) {
blk_t dibno;
if ((dibno = inode->dinum[i]) == 0) {
*bno_out = 0;
*next_n = kMinfsDirect + kMinfsIndirect * kMinfsDirectPerIndirect +
(i + 1) * kMinfsDirectPerDindirect;
return ZX_OK;
}
if (cached_doubly_indirect_ != dibno) {
zx_status_t status;
if ((status = fs_->ReadDat(dibno, doubly_indirect_cache_)) != ZX_OK) {
return status;
}
cached_doubly_indirect_ = dibno;
}
uint32_t* dientry = reinterpret_cast<uint32_t*>(doubly_indirect_cache_);
blk_t ibno;
if ((ibno = dientry[j]) == 0) {
*bno_out = 0;
*next_n = kMinfsDirect + kMinfsIndirect * kMinfsDirectPerIndirect +
(i * kMinfsDirectPerDindirect) + (j + 1) * kMinfsDirectPerIndirect;
return ZX_OK;
}
if (cached_indirect_ != ibno) {
zx_status_t status;
if ((status = fs_->ReadDat(ibno, indirect_cache_)) != ZX_OK) {
return status;
}
cached_indirect_ = ibno;
}
uint32_t* ientry = reinterpret_cast<uint32_t*>(indirect_cache_);
*bno_out = ientry[k];
return ZX_OK;
}
return ZX_ERR_OUT_OF_RANGE;
}
zx_status_t MinfsChecker::CheckDirectory(Inode* inode, ino_t ino,
ino_t parent, uint32_t flags) {
unsigned eno = 0;
bool dot = false;
bool dotdot = false;
uint32_t dirent_count = 0;
zx_status_t status;
fbl::RefPtr<VnodeMinfs> vn;
if ((status = VnodeMinfs::Recreate(fs_.get(), ino, &vn)) != ZX_OK) {
return status;
}
size_t off = 0;
while (true) {
uint32_t data[MINFS_DIRENT_SIZE];
size_t actual;
status = vn->ReadInternal(nullptr, data, MINFS_DIRENT_SIZE, off, &actual);
if (status != ZX_OK || actual != MINFS_DIRENT_SIZE) {
FS_TRACE_ERROR("check: ino#%u: Could not read de[%u] at %zd\n", eno, ino, off);
if (inode->dirent_count >= 2 && inode->dirent_count == eno - 1) {
// So we couldn't read the last direntry, for whatever reason, but our
// inode says that we shouldn't have been able to read it anyway.
FS_TRACE_ERROR("check: de count (%u) > inode_dirent_count (%u)\n", eno,
inode->dirent_count);
}
return status != ZX_OK ? status : ZX_ERR_IO;
}
Dirent* de = reinterpret_cast<Dirent*>(data);
uint32_t rlen = static_cast<uint32_t>(MinfsReclen(de, off));
uint32_t dlen = DirentSize(de->namelen);
bool is_last = de->reclen & kMinfsReclenLast;
if (!is_last && ((rlen < MINFS_DIRENT_SIZE) || (dlen > rlen) ||
(dlen > kMinfsMaxDirentSize) || (rlen & 3))) {
FS_TRACE_ERROR("check: ino#%u: de[%u]: bad dirent reclen (%u)\n", ino, eno, rlen);
return ZX_ERR_IO_DATA_INTEGRITY;
}
if (de->ino == 0) {
if (flags & CD_DUMP) {
FS_TRACE_DEBUG("ino#%u: de[%u]: <empty> reclen=%u\n", ino, eno, rlen);
}
} else {
// Re-read the dirent to acquire the full name
uint32_t record_full[DirentSize(NAME_MAX)];
status = vn->ReadInternal(nullptr, record_full, DirentSize(de->namelen), off, &actual);
if (status != ZX_OK || actual != DirentSize(de->namelen)) {
FS_TRACE_ERROR("check: Error reading dirent of size: %u\n", DirentSize(de->namelen));
return ZX_ERR_IO;
}
de = reinterpret_cast<Dirent*>(record_full);
bool dot_or_dotdot = false;
if ((de->namelen == 0) || (de->namelen > (rlen - MINFS_DIRENT_SIZE))) {
FS_TRACE_ERROR("check: ino#%u: de[%u]: invalid namelen %u\n", ino, eno,
de->namelen);
return ZX_ERR_IO_DATA_INTEGRITY;
}
if ((de->namelen == 1) && (de->name[0] == '.')) {
if (dot) {
FS_TRACE_ERROR("check: ino#%u: multiple '.' entries\n", ino);
}
dot_or_dotdot = true;
dot = true;
if (de->ino != ino) {
FS_TRACE_ERROR("check: ino#%u: de[%u]: '.' ino=%u (not self!)\n", ino, eno,
de->ino);
}
}
if ((de->namelen == 2) && (de->name[0] == '.') && (de->name[1] == '.')) {
if (dotdot) {
FS_TRACE_ERROR("check: ino#%u: multiple '..' entries\n", ino);
}
dot_or_dotdot = true;
dotdot = true;
if (de->ino != parent) {
FS_TRACE_ERROR("check: ino#%u: de[%u]: '..' ino=%u (not parent!)\n", ino, eno,
de->ino);
}
}
//TODO: check for cycles (non-dot/dotdot dir ref already in checked bitmap)
if (flags & CD_DUMP) {
FS_TRACE_DEBUG("ino#%u: de[%u]: ino=%u type=%u '%.*s' %s\n", ino, eno, de->ino,
de->type, de->namelen, de->name, is_last ? "[last]" : "");
}
if (flags & CD_RECURSE) {
if ((status = CheckInode(de->ino, ino, dot_or_dotdot)) < 0) {
return status;
}
}
dirent_count++;
}
if (is_last) {
break;
} else {
off += rlen;
}
eno++;
}
if (dirent_count != inode->dirent_count) {
FS_TRACE_ERROR("check: ino#%u: dirent_count of %u != %u (actual)\n",
ino, inode->dirent_count, dirent_count);
}
if (dot == false) {
FS_TRACE_ERROR("check: ino#%u: directory missing '.'\n", ino);
}
if (dotdot == false) {
FS_TRACE_ERROR("check: ino#%u: directory missing '..'\n", ino);
}
return ZX_OK;
}
const char* MinfsChecker::CheckDataBlock(blk_t bno) {
if (bno == 0) {
return "reserved bno";
}
if (bno >= fs_->Info().block_count) {
return "out of range";
}
if (!fs_->GetBlockAllocator()->CheckAllocated(bno)) {
return "not allocated";
}
if (checked_blocks_.Get(bno, bno + 1)) {
return "double-allocated";
}
checked_blocks_.Set(bno, bno + 1);
alloc_blocks_++;
return nullptr;
}
zx_status_t MinfsChecker::CheckFile(Inode* inode, ino_t ino) {
FS_TRACE_DEBUG("Direct blocks: \n");
for (unsigned n = 0; n < kMinfsDirect; n++) {
FS_TRACE_DEBUG(" %d,", inode->dnum[n]);
}
FS_TRACE_DEBUG(" ...\n");
uint32_t block_count = 0;
// count and sanity-check indirect blocks
for (unsigned n = 0; n < kMinfsIndirect; n++) {
if (inode->inum[n]) {
const char* msg;
if ((msg = CheckDataBlock(inode->inum[n])) != nullptr) {
FS_TRACE_WARN("check: ino#%u: indirect block %u(@%u): %s\n",
ino, n, inode->inum[n], msg);
conforming_ = false;
}
block_count++;
}
}
// count and sanity-check doubly indirect blocks
for (unsigned n = 0; n < kMinfsDoublyIndirect; n++) {
if (inode->dinum[n]) {
const char* msg;
if ((msg = CheckDataBlock(inode->dinum[n])) != nullptr) {
FS_TRACE_WARN("check: ino#%u: doubly indirect block %u(@%u): %s\n",
ino, n, inode->dinum[n], msg);
conforming_ = false;
}
block_count++;
char data[kMinfsBlockSize];
zx_status_t status;
if ((status = fs_->ReadDat(inode->dinum[n], data)) != ZX_OK) {
return status;
}
uint32_t* entry = reinterpret_cast<uint32_t*>(data);
for (unsigned m = 0; m < kMinfsDirectPerIndirect; m++) {
if (entry[m]) {
if ((msg = CheckDataBlock(entry[m])) != nullptr) {
FS_TRACE_WARN("check: ino#%u: indirect block (in dind) %u(@%u): %s\n",
ino, m, entry[m], msg);
conforming_ = false;
}
block_count++;
}
}
}
}
// count and sanity-check data blocks
// The next block which would be allocated if we expand the file size
// by a single block.
unsigned next_blk = 0;
cached_doubly_indirect_ = 0;
cached_indirect_ = 0;
blk_t n = 0;
while (true) {
zx_status_t status;
blk_t bno;
blk_t next_n;
if ((status = GetInodeNthBno(inode, n, &next_n, &bno)) < 0) {
if (status == ZX_ERR_OUT_OF_RANGE) {
break;
} else {
return status;
}
}
assert(next_n > n);
if (bno) {
next_blk = n + 1;
block_count++;
const char* msg;
if ((msg = CheckDataBlock(bno)) != nullptr) {
FS_TRACE_WARN("check: ino#%u: block %u(@%u): %s\n", ino, n, bno, msg);
conforming_ = false;
}
}
n = next_n;
}
if (next_blk) {
unsigned max_blocks = fbl::round_up(inode->size, kMinfsBlockSize) / kMinfsBlockSize;
if (next_blk > max_blocks) {
FS_TRACE_WARN("check: ino#%u: filesize too small\n", ino);
conforming_ = false;
}
}
if (block_count != inode->block_count) {
FS_TRACE_WARN("check: ino#%u: block count %u, actual blocks %u\n",
ino, inode->block_count, block_count);
conforming_ = false;
}
return ZX_OK;
}
void MinfsChecker::CheckReserved() {
// Check reserved inode '0'.
if (fs_->GetInodeManager()->GetInodeAllocator()->CheckAllocated(0)) {
checked_inodes_.Set(0, 1);
alloc_inodes_++;
} else {
FS_TRACE_WARN("check: reserved inode#0: not marked in-use\n");
conforming_ = false;
}
// Check reserved data block '0'.
if (fs_->GetBlockAllocator()->CheckAllocated(0)) {
checked_blocks_.Set(0, 1);
alloc_blocks_++;
} else {
FS_TRACE_WARN("check: reserved block#0: not marked in-use\n");
conforming_ = false;
}
}
zx_status_t MinfsChecker::CheckInode(ino_t ino, ino_t parent, bool dot_or_dotdot) {
Inode inode;
zx_status_t status;
if ((status = GetInode(&inode, ino)) < 0) {
FS_TRACE_ERROR("check: ino#%u: not readable\n", ino);
return status;
}
bool prev_checked = checked_inodes_.Get(ino, ino + 1);
if (inode.magic == kMinfsMagicDir && prev_checked && !dot_or_dotdot) {
FS_TRACE_ERROR("check: ino#%u: Multiple hard links to directory (excluding '.' and '..') found\n", ino);
return ZX_ERR_BAD_STATE;
}
links_[ino - 1] += 1;
if (prev_checked) {
// we've been here before
return ZX_OK;
}
links_[ino - 1] -= inode.link_count;
checked_inodes_.Set(ino, ino + 1);
alloc_inodes_++;
if (!fs_->GetInodeManager()->GetInodeAllocator()->CheckAllocated(ino)) {
FS_TRACE_WARN("check: ino#%u: not marked in-use\n", ino);
conforming_ = false;
}
if (inode.magic == kMinfsMagicDir) {
FS_TRACE_DEBUG("ino#%u: DIR blks=%u links=%u\n", ino, inode.block_count, inode.link_count);
if ((status = CheckFile(&inode, ino)) < 0) {
return status;
}
if ((status = CheckDirectory(&inode, ino, parent, CD_DUMP)) < 0) {
return status;
}
if ((status = CheckDirectory(&inode, ino, parent, CD_RECURSE)) < 0) {
return status;
}
} else {
FS_TRACE_DEBUG("ino#%u: FILE blks=%u links=%u size=%u\n", ino, inode.block_count,
inode.link_count, inode.size);
if ((status = CheckFile(&inode, ino)) < 0) {
return status;
}
}
return ZX_OK;
}
zx_status_t MinfsChecker::CheckUnlinkedInodes() {
ino_t last_ino = 0;
ino_t next_ino = fs_->Info().unlinked_head;
ino_t unlinked_count = 0;
while (next_ino != 0) {
unlinked_count++;
Inode inode;
zx_status_t status = GetInode(&inode, next_ino);
if (status != ZX_OK) {
FS_TRACE_ERROR("check: ino#%u: not readable\n", next_ino);
return status;
}
if (inode.link_count > 0) {
FS_TRACE_ERROR("check: ino#%u: should have 0 links\n", next_ino);
return ZX_ERR_BAD_STATE;
}
if (inode.last_inode != last_ino) {
FS_TRACE_ERROR("check: ino#%u: incorrect last unlinked inode\n", next_ino);
return ZX_ERR_BAD_STATE;
}
links_[next_ino - 1] = -1;
if ((status = CheckInode(next_ino, 0, 0)) != ZX_OK) {
FS_TRACE_ERROR("minfs_check: CheckInode failure: %d\n", status);
return status;
}
last_ino = next_ino;
next_ino = inode.next_inode;
}
if (fs_->Info().unlinked_tail != last_ino) {
FS_TRACE_ERROR("minfs_check: Incorrect unlinked tail\n");
return ZX_ERR_BAD_STATE;
}
if (unlinked_count > 0) {
FS_TRACE_WARN("minfs_check: Warning: %u unlinked inodes found\n", unlinked_count);
}
return ZX_OK;
}
zx_status_t MinfsChecker::CheckForUnusedBlocks() const {
unsigned missing = 0;
for (unsigned n = 0; n < fs_->Info().block_count; n++) {
if (fs_->GetBlockAllocator()->CheckAllocated(n)) {
if (!checked_blocks_.Get(n, n + 1)) {
missing++;
}
}
}
if (missing) {
FS_TRACE_ERROR("check: %u allocated block%s not in use\n",
missing, missing > 1 ? "s" : "");
return ZX_ERR_BAD_STATE;
}
return ZX_OK;
}
zx_status_t MinfsChecker::CheckForUnusedInodes() const {
unsigned missing = 0;
for (unsigned n = 0; n < fs_->Info().inode_count; n++) {
if (fs_->GetInodeManager()->GetInodeAllocator()->CheckAllocated(n)) {
if (!checked_inodes_.Get(n, n + 1)) {
missing++;
}
}
}
if (missing) {
FS_TRACE_ERROR("check: %u allocated inode%s not in use\n",
missing, missing > 1 ? "s" : "");
return ZX_ERR_BAD_STATE;
}
return ZX_OK;
}
zx_status_t MinfsChecker::CheckLinkCounts() const {
unsigned error = 0;
for (uint32_t n = 0; n < fs_->Info().inode_count; n++) {
if (links_[n] != 0) {
error += 1;
FS_TRACE_ERROR("check: inode#%u has incorrect link count %u\n", n + 1, links_[n]);
return ZX_ERR_BAD_STATE;
}
}
if (error) {
FS_TRACE_ERROR("check: %u inode%s with incorrect link count\n",
error, error > 1 ? "s" : "");
return ZX_ERR_BAD_STATE;
}
return ZX_OK;
}
zx_status_t MinfsChecker::CheckAllocatedCounts() const {
zx_status_t status = ZX_OK;
if (alloc_blocks_ != fs_->Info().alloc_block_count) {
FS_TRACE_ERROR("check: incorrect allocated block count %u (should be %u)\n",
fs_->Info().alloc_block_count, alloc_blocks_);
status = ZX_ERR_BAD_STATE;
}
if (alloc_inodes_ != fs_->Info().alloc_inode_count) {
FS_TRACE_ERROR("check: incorrect allocated inode count %u (should be %u)\n",
fs_->Info().alloc_inode_count, alloc_inodes_);
status = ZX_ERR_BAD_STATE;
}
return status;
}
zx_status_t MinfsChecker::CheckJournal() const {
char data[kMinfsBlockSize];
blk_t journal_block;
#ifdef __Fuchsia__
journal_block = fs_->Info().journal_start_block;
#else
journal_block = fs_->GetBlockOffsets().JournalStartBlock();
#endif
if (fs_->bc_->Readblk(journal_block, data) < 0) {
FS_TRACE_ERROR("minfs: could not read journal block\n");
return ZX_ERR_IO;
}
const JournalInfo* journal_info = reinterpret_cast<const JournalInfo*>(data);
if (journal_info->magic != kJournalMagic) {
FS_TRACE_ERROR("minfs: invalid journal magic\n");
return ZX_ERR_BAD_STATE;
}
return ZX_OK;
}
MinfsChecker::MinfsChecker()
: conforming_(true), fs_(nullptr), alloc_inodes_(0), alloc_blocks_(0), links_() {}
zx_status_t MinfsChecker::Init(fbl::unique_ptr<Bcache> bc, const Superblock* info) {
links_.reset(new int32_t[info->inode_count]{0}, info->inode_count);
links_[0] = -1;
cached_doubly_indirect_ = 0;
cached_indirect_ = 0;
zx_status_t status;
if ((status = checked_inodes_.Reset(info->inode_count)) != ZX_OK) {
FS_TRACE_ERROR("MinfsChecker::Init Failed to reset checked inodes: %d\n", status);
return status;
}
if ((status = checked_blocks_.Reset(info->block_count)) != ZX_OK) {
FS_TRACE_ERROR("MinfsChecker::Init Failed to reset checked blocks: %d\n", status);
return status;
}
fbl::unique_ptr<Minfs> fs;
if ((status = Minfs::Create(std::move(bc), info, &fs, IntegrityCheck::kAll)) != ZX_OK) {
FS_TRACE_ERROR("MinfsChecker::Create Failed to Create Minfs: %d\n", status);
return status;
}
fs_ = std::move(fs);
return ZX_OK;
}
zx_status_t LoadSuperblock(fbl::unique_ptr<Bcache>& bc, Superblock* out) {
zx_status_t status;
char data[kMinfsBlockSize];
if (bc->Readblk(0, data) < 0) {
FS_TRACE_ERROR("minfs: could not read info block\n");
return ZX_ERR_IO;
}
const Superblock* info = reinterpret_cast<const Superblock*>(data);
DumpInfo(info);
if ((status = CheckSuperblock(info, bc.get())) != ZX_OK) {
FS_TRACE_ERROR("Fsck: check_info failure: %d\n", status);
return status;
}
memcpy(out, info, sizeof(*out));
return ZX_OK;
}
zx_status_t UsedDataSize(fbl::unique_ptr<Bcache>& bc, uint64_t* out_size) {
zx_status_t status;
Superblock info = {};
if ((status = LoadSuperblock(bc, &info)) != ZX_OK) {
return status;
}
*out_size = (info.alloc_block_count * info.block_size);
return ZX_OK;
}
zx_status_t UsedInodes(fbl::unique_ptr<Bcache>& bc, uint64_t* out_inodes) {
zx_status_t status;
Superblock info = {};
if ((status = LoadSuperblock(bc, &info)) != ZX_OK) {
return status;
}
*out_inodes = info.alloc_inode_count;
return ZX_OK;
}
zx_status_t UsedSize(fbl::unique_ptr<Bcache>& bc, uint64_t* out_size) {
zx_status_t status;
Superblock info = {};
if ((status = LoadSuperblock(bc, &info)) != ZX_OK) {
return status;
}
*out_size = (NonDataBlocks(info) + info.alloc_block_count) * info.block_size;
return ZX_OK;
}
zx_status_t Fsck(fbl::unique_ptr<Bcache> bc) {
zx_status_t status;
Superblock info = {};
if ((status = LoadSuperblock(bc, &info)) != ZX_OK) {
return status;
}
MinfsChecker chk;
if ((status = chk.Init(std::move(bc), &info)) != ZX_OK) {
FS_TRACE_ERROR("Fsck: Init failure: %d\n", status);
return status;
}
chk.CheckReserved();
//TODO: check root not a directory
if ((status = chk.CheckInode(1, 1, 0)) != ZX_OK) {
FS_TRACE_ERROR("Fsck: CheckInode failure: %d\n", status);
return status;
}
zx_status_t r;
// Save an error if it occurs, but check for subsequent errors anyway.
r = chk.CheckUnlinkedInodes();
status |= (status != ZX_OK) ? 0 : r;
r = chk.CheckForUnusedBlocks();
status |= (status != ZX_OK) ? 0 : r;
r = chk.CheckForUnusedInodes();
status |= (status != ZX_OK) ? 0 : r;
r = chk.CheckLinkCounts();
status |= (status != ZX_OK) ? 0 : r;
r = chk.CheckAllocatedCounts();
status |= (status != ZX_OK) ? 0 : r;
r = chk.CheckJournal();
status |= (status != ZX_OK) ? 0 : r;
//TODO: check allocated inodes that were abandoned
//TODO: check allocated blocks that were not accounted for
//TODO: check unallocated inodes where magic != 0
status |= (status != ZX_OK) ? 0 : (chk.conforming_ ? ZX_OK : ZX_ERR_BAD_STATE);
return status;
}
} // namespace minfs
| cpp |
{
"gameReadSuccess": "game read success",
"gameReadFailed": "game read failed",
"gameCreateSuccess": "game create success",
"gameCreateFailed": "game create failed",
"gameUpdateSuccess": "game update success",
"gameUpdateFailed": "game update failed",
"gameEndSuccess": "game end success",
"gameEndFailed": "game end failed",
"gameStartSuccess": "game start success",
"gameStartFailed": "game start failed",
"lobbyReadSuccess": "lobby read success",
"lobbyReadFailed": "lobby read failed",
"lobbyCreateSuccess": "lobby add success",
"lobbyCreateFailed": "lobby add failed",
"lobbyRemoveFailed": "lobby remove failed",
"lobbyRemoveSuccess": "lobby remove success",
"osuApiFailed": "osu! API failed",
"osuApiSuccess": "osu! API success",
"userReadSuccess": "user read success",
"userReadFailed": "user read failed",
"userCreateSuccess": "user create success",
"userCreateFailed": "user create failed",
"userUpdateSuccess": "user update success",
"userUpdateFailed": "user update failed",
"discordChannelCreateSuccess": "discord channel create success",
"discordChannelCreateFailed": "discord channel create failed",
"teamCreateSuccess": "team added successfully",
"teamCreateFailed": "team add failed",
"teamRemoveSuccess": "team removed successfully",
"teamRemoveFailed": "team remove failed"
}
| json |
const config = {
'extends': [
'./rules/strict',
'./rules/variables',
'./rules/promise',
'./rules/import',
'./rules/errors',
'./rules/ecma',
'./rules/style',
'./rules/index',
]
.map(require.resolve),
}
module.exports = config
| javascript |
#!/usr/bin/env python
"""
Usage:
process scripts/process.py
Assumptions
1) Always run from poetics directory
2) virtual env for frozen-pie in in the same folder as frozen pie
3) paths are hardcoded
"""
poetics_path = "/Users/harsha/yuti/poetics"
frozen_pie_path = "/Users/harsha/yuti/frozen-pie-latest"
poems_path = "/Users/harsha/yuti/poems"
errors_path = poems_path + "/errors"
github_url = "<EMAIL>:Facjure/poetics.git"
# get latest poems if any
import os
cmd = "cd " + poems_path + "; git pull origin master"
os.system(cmd)
os.system("rm except.log.md")
log = open("except.log.md", "a")
import sys
import re
import yaml
import StringIO
from glob import glob
from pipes import quote
from codecs import open
from datetime import datetime
from dateutil import tz
import cleaners
def split_file(poem_text):
match = re.split(u"\n---[ ]*\n", poem_text, flags=re.U | re.S)
yaml_text = match[0]
poem = match[1]
return yaml_text, poem
print """Processing poems"""
for txtfile in glob(poems_path + os.sep + "*.txt"):
try:
txtfile_name = os.path.basename(txtfile)
if not cleaners.is_clean_name(txtfile_name):
raise Exception("Filenames should have hyphens only. \"<authorLastName>-<first-five-words-of-title>.txt\". Use - for all special characters.")
text = open(txtfile, "r", "utf-8").read()
yaml_text, poem = split_file(text)
if len(poem) < 10:
raise Exception("Fault in process.py or Poem is too small")
yaml.load(StringIO.StringIO(yaml_text))
except Exception, error:
log.write("#### Error in \"" + txtfile + "\"\n" + str(error) + "\n\n")
cmd = "mv " + quote(txtfile) + " " + quote(errors_path)
print " " + cmd
os.system(cmd)
continue
print "Done"
log.close()
log = open("except.log.md", "r")
if len(log.readlines()) > 2:
log.close()
utc = datetime.utcnow()
from_zone = tz.gettz('UTC')
to_zone = tz.gettz('America/New_York')
utc = utc.replace(tzinfo=from_zone)
boston_time = utc.astimezone(to_zone)
print str(boston_time)
cmd = "mv except.log.md " + quote(errors_path + os.sep + "except.log.BostonTime." + str(boston_time) + ".md")
print " " + cmd
os.system(cmd)
os.chdir(poems_path)
os.system("git add -A; git commit -m 'BuildBot " + str(boston_time) + "'")
os.system("git push origin master")
os.chdir(frozen_pie_path)
os.system("./env/bin/python bake.py --config " + poetics_path + os.sep + "config.yml")
os.chdir(poetics_path)
os.system("mkdir deploy")
os.system("mv .build/index.html deploy/")
os.system("rm -rf .build")
os.system("git clone -b gh-pages " + github_url + " .build")
os.system("cp deploy/index.html .build/")
os.system("cd .build; git add index.html; git commit -m 'new deploy " + str(boston_time) + "'; git push --force origin gh-pages")
| python |
/*
* File: ReceiverOperatingCharacteristic.java
* Authors: <NAME>
* Company: Sandia National Laboratories
* Project: Cognitive Foundry
*
* Copyright August 24, 2007, Sandia Corporation. Under the terms of Contract
* DE-AC04-94AL85000, there is a non-exclusive license for use of this work by
* or on behalf of the U.S. Government. Export of this program may require a
* license from the United States Government. See CopyrightHistory.txt for
* complete details.
*
*/
package gov.sandia.cognition.statistics.method;
import gov.sandia.cognition.learning.performance.categorization.DefaultBinaryConfusionMatrix;
import gov.sandia.cognition.annotation.PublicationReference;
import gov.sandia.cognition.annotation.PublicationType;
import gov.sandia.cognition.collection.CollectionUtil;
import gov.sandia.cognition.learning.data.InputOutputPair;
import gov.sandia.cognition.learning.function.categorization.ScalarThresholdBinaryCategorizer;
import gov.sandia.cognition.statistics.distribution.UnivariateGaussian;
import gov.sandia.cognition.evaluator.Evaluator;
import gov.sandia.cognition.learning.data.DefaultInputOutputPair;
import gov.sandia.cognition.util.AbstractCloneableSerializable;
import gov.sandia.cognition.util.ObjectUtil;
import gov.sandia.cognition.util.Pair;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.LinkedList;
/**
* Class that describes a Receiver Operating Characteristic (usually called an
* "ROC Curve"). This is a function that describes the performance of a
* classification system where the x-axis is the FalsePositiveRate and the
* y-axis is the TruePositiveRate. Both axes are on the interval [0,1]. A
* typical ROC curve has a logarithm-shaped plot, ideally it looks like a
* capital Gamma letter. An ROC curve also has an associated group of
* statistics with it from a Mann-Whitney U-test, which gives the probability
* that the classifier is essentially randomly "guessing." We create ROC curves
* by calling the method: ReceiverOperatingCharacteristic.create(data)
*
* @author <NAME>
* @since 2.0
*
*/
@PublicationReference(
author="Wikipedia",
title="Receiver operating characteristic",
type=PublicationType.WebPage,
year=2009,
url="http://en.wikipedia.org/wiki/Receiver_operating_characteristic"
)
public class ReceiverOperatingCharacteristic
extends AbstractCloneableSerializable
implements Evaluator<Double,Double>
{
/**
* Sorted data containing a ConfusionMatrix at each point, sorted in an
* ascending order along the abscissa (x-axis), which is FalsePositiveRate
*/
private ArrayList<ReceiverOperatingCharacteristic.DataPoint> sortedROCData;
/**
* Results from conducting a U-test on the underlying classification data,
* the null hypothesis determines if the classifier can reliably separate
* the classes, not just chance
*/
private MannWhitneyUConfidence.Statistic Utest;
/**
* Creates a new instance of ReceiverOperatingCharacteristic
* @param rocData
* Sorted data containing a ConfusionMatrix at each point
* @param Utest
* Results from conducting a U-test on the underlying classification data,
* the null hypothesis determines if the classifier can reliably separate
* the classes, not just chance
*/
private ReceiverOperatingCharacteristic(
Collection<ReceiverOperatingCharacteristic.DataPoint> rocData,
MannWhitneyUConfidence.Statistic Utest )
{
ArrayList<ReceiverOperatingCharacteristic.DataPoint> sortedData =
CollectionUtil.asArrayList(rocData);
Collections.sort( sortedData, new DataPoint.Sorter() );
this.setSortedROCData( sortedData );
this.setUtest( Utest );
}
@Override
public ReceiverOperatingCharacteristic clone()
{
ReceiverOperatingCharacteristic clone =
(ReceiverOperatingCharacteristic) super.clone();
clone.setSortedROCData( ObjectUtil.cloneSmartElementsAsArrayList(
this.getSortedROCData() ) );
clone.setUtest( ObjectUtil.cloneSmart( this.getUtest() ) );
return clone;
}
/**
* Evaluates the "pessimistic" value of the truePositiveRate for a given
* falsePositiveRate. This evaluation is pessimistic in that it holds
* the truePositiveRate (y-value) until we receive a corresponding
* falsePositiveRate (x-value) that is greater than the given value
* @param input
* falsePositiveRate from which to estimate the truePositiveRate
* @return
* Pessimistic TruePositiveRate for the given FalsePositiveRate
*/
@Override
public Double evaluate(
Double input )
{
double falsePositiveRate = input;
double truePositiveRate = 0.0;
for( DataPoint rocData : this.getSortedROCData() )
{
if( rocData.getFalsePositiveRate() <= falsePositiveRate )
{
truePositiveRate = rocData.getTruePositiveRate();
}
else
{
break;
}
}
return truePositiveRate;
}
/**
* Getter for sortedROCData
* @return
* Sorted data containing a ConfusionMatrix at each point, sorted in an
* ascending order along the abscissa (x-axis), which is FalsePositiveRate
*/
public ArrayList<ReceiverOperatingCharacteristic.DataPoint> getSortedROCData()
{
return this.sortedROCData;
}
/**
* Setter for srtedROCData
* @param sortedROCData
* Sorted data containing a ConfusionMatrix at each point, sorted in an
* ascending order along the abscissa (x-axis), which is FalsePositiveRate
*/
protected void setSortedROCData(
ArrayList<ReceiverOperatingCharacteristic.DataPoint> sortedROCData)
{
this.sortedROCData = sortedROCData;
}
/**
* Creates an ROC curve based on the scored data with target information.
*
* @param data
* Collection of target/estimate-score pairs. The second element in
* the pair is an estimated score, the first is a flag to determine
* which group the score belongs to. For example:
* {(true, 1.0), (false, 0.9)}
* means that data1=1.0 and data2=0.9 and so forth. This is useful
* for computing that classified data partitions data better than
* chance.
* @return
* ROC Curve describing the scoring system versus the targets.
*/
public static ReceiverOperatingCharacteristic createFromTargetEstimatePairs(
final Collection<? extends Pair<Boolean, ? extends Number>> data)
{
// Transform the data to input-output pairs.
final ArrayList<InputOutputPair<Double, Boolean>> transformed =
new ArrayList<InputOutputPair<Double, Boolean>>(data.size());
for (Pair<Boolean, ? extends Number> entry : data)
{
transformed.add(DefaultInputOutputPair.create(
entry.getSecond().doubleValue(), entry.getFirst()));
}
return create(transformed);
}
/**
* Creates an ROC curve based on the scored data with target information
* @param data
* Collection of estimate-score/target pairs. The second element in the
* Pair is an estimated score, the first is a flag to determine which
* group the score belongs to. For example {<1.0,true>, <0.9,false> means
* that data1=1.0 and data2=0.9 and so forth. This is useful for computing
* that classified data partitions data better than chance.
* @return
* ROC Curve describing the scoring system versus the targets
*/
public static ReceiverOperatingCharacteristic create(
Collection<? extends InputOutputPair<Double,Boolean>> data)
{
// First we need to sort the data in increasing order by value.
ArrayList<InputOutputPair<Double,Boolean>> sortedData =
new ArrayList<InputOutputPair<Double,Boolean>>(data);
Collections.sort(sortedData, new ROCScoreSorter());
// Next we need to count the total number of positive examples.
int totalPositives = 0;
for ( InputOutputPair<Double,Boolean> pair : sortedData )
{
if ( pair.getOutput() == true )
{
totalPositives++;
}
}
// Now we compute the total and the number of negatives.
int total = sortedData.size();
int totalNegatives = total - totalPositives;
// We will be computing the confusion matrix iteratively, which means
// keeping track of how many examples we have counted so far and the
// number of positive examples counted so far.
int countSoFar = 0;
int positivesSoFar = 0;
LinkedList<DataPoint> rocData =
new LinkedList<DataPoint>();
double lastThreshold = Double.NEGATIVE_INFINITY;
for ( InputOutputPair<Double,Boolean> pair : sortedData )
{
// Compute the confusion matrix based on the current counters.
final double trueNegatives = countSoFar - positivesSoFar;
final double falseNegatives = positivesSoFar;
final double truePositives = totalPositives - falseNegatives;
final double falsePositives = totalNegatives - trueNegatives;
final double threshold = pair.getInput();
if ( threshold > lastThreshold )
{
// Only add a data point if we have evaluated a new
// threshold.
final DefaultBinaryConfusionMatrix confusion =
new DefaultBinaryConfusionMatrix();
confusion.setFalsePositivesCount(falsePositives);
confusion.setFalseNegativesCount(falseNegatives);
confusion.setTruePositivesCount(truePositives);
confusion.setTrueNegativesCount(trueNegatives);
rocData.add(new DataPoint(
new ScalarThresholdBinaryCategorizer(threshold), confusion));
lastThreshold = threshold;
}
// Update the count so far and the positives so far. This is done
// after the computations of the counts because the threshold is
// x >= threshold, so the threshold puts the current point on the
// positive side.
countSoFar++;
final boolean target = pair.getOutput();
if ( target == true )
{
positivesSoFar++;
}
}
Collections.sort(rocData, new ReceiverOperatingCharacteristic.DataPoint.Sorter());
// Compute a statistical test on the data.
MannWhitneyUConfidence.Statistic uTest =
new MannWhitneyUConfidence().evaluateNullHypothesis(data);
// Return the ROC.
return new ReceiverOperatingCharacteristic(rocData, uTest);
}
/**
* Computes useful statistical information associated with the ROC curve
* @return ROC Statistics describing the ROC curve
*/
public ReceiverOperatingCharacteristic.Statistic computeStatistics()
{
return new ReceiverOperatingCharacteristic.Statistic( this );
}
/**
* Getter for Utest
* @return
* Results from conducting a U-test on the underlying classification data,
* the null hypothesis determines if the classifier can reliably separate
* the classes, not just chance
*/
public MannWhitneyUConfidence.Statistic getUtest()
{
return this.Utest;
}
/**
* Setter for Utest
* @param Utest
* Results from conducting a U-test on the underlying classification data,
* the null hypothesis determines if the classifier can reliably separate
* the classes, not just chance
*/
public void setUtest(
MannWhitneyUConfidence.Statistic Utest)
{
this.Utest = Utest;
}
/**
* Contains useful statistics derived from a ROC curve
*/
public static class Statistic
extends MannWhitneyUConfidence.Statistic
{
/**
* Estimated distance between the two classes to be split. Larger
* values of d' indicate that the classes are easier to split,
* d'=0 means that the classes overlap, and negative values mean
* that your classifier is doing worse than chance, chump. This
* appears to only be used by psychologists.
*/
private double dPrime;
/**
* Area underneath the ROC curve, on the interval [0,1]. A value of
* 0.5 means that the classifier is doing no better than chance and
* bigger is better
*/
private double areaUnderCurve;
/**
* DataPoint, with corresponding threshold, that maximizes the value
* of Area=TruePositiveRate*(1-FalsePositiveRate), usually the
* upper-left "knee" on the ROC curve
*/
private DataPoint optimalThreshold;
/**
* Creates a new instance of Statistic
* @param roc
* ROC Curve from which to pull statistics
*/
protected Statistic(
ReceiverOperatingCharacteristic roc )
{
super( roc.getUtest() );
this.setAreaUnderCurve( computeAreaUnderCurve( roc ) );
this.setOptimalThreshold( computeOptimalThreshold( roc ) );
this.setDPrime( computeDPrime( this.getOptimalThreshold() ) );
}
/**
* Computes the "pessimistic" area under the ROC curve using the
* top-left rectangle method for numerical integration.
* @param roc
* ROC Curve to compute the area under
* @return
* Area underneath the ROC curve, on the interval [0,1]. A value of
* 0.5 means that the classifier is doing no better than chance and
* bigger is better
*/
public static double computeAreaUnderCurve(
ReceiverOperatingCharacteristic roc )
{
return computeAreaUnderCurveTopLeft( roc.getSortedROCData() );
}
/**
* Computes the Area Under Curve for an x-axis sorted Collection
* of ROC points using the top-left rectangle method for numerical
* integration.
* @param points
* x-axis sorted collection of x-axis points
* @return
* Area underneath the ROC curve, on the interval [0,1]. A value of
* 0.5 means that the classifier is doing no better than chance and
* bigger is better
*/
@PublicationReference(
author="Wikipedia",
title="Rectangle method",
type=PublicationType.WebPage,
year=2011,
url="http://en.wikipedia.org/wiki/Rectangle_method"
)
public static double computeAreaUnderCurveTopLeft(
Collection<ReceiverOperatingCharacteristic.DataPoint> points )
{
ReceiverOperatingCharacteristic.DataPoint current =
CollectionUtil.getFirst(points);
double auc = 0.0;
double xnm1 = 0.0;
double ynm1 = 0.0;
double xn = 0.0;
for( ReceiverOperatingCharacteristic.DataPoint point : points )
{
// Technically, this wastes the computation of the first point,
// but since the delta is 0.0, it doesn't effect the AUC.
ReceiverOperatingCharacteristic.DataPoint previous = current;
previous = current;
current = point;
xnm1 = previous.getFalsePositiveRate();
ynm1 = previous.getTruePositiveRate();
xn = current.getFalsePositiveRate();
final double area = ynm1*(xn-xnm1);
auc += area;
}
// Assume that the final point is at xn=1.0
xnm1 = xn;
xn = 1.0;
final double area = ynm1*(xn-xnm1);
auc += area;
return auc;
}
/**
* Computes the Area Under Curve for an x-axis sorted Collection
* of ROC points using the top-left rectangle method for numerical
* integration.
* @param points
* x-axis sorted collection of x-axis points
* @return
* Area underneath the ROC curve, on the interval [0,1]. A value of
* 0.5 means that the classifier is doing no better than chance and
* bigger is better
*/
@PublicationReference(
author="Wikipedia",
title="Trapezoidal rule",
type=PublicationType.WebPage,
year=2011,
url="http://en.wikipedia.org/wiki/Trapezoidal_rule"
)
public static double computeAreaUnderCurveTrapezoid(
Collection<ReceiverOperatingCharacteristic.DataPoint> points )
{
ReceiverOperatingCharacteristic.DataPoint current =
CollectionUtil.getFirst(points);
double auc = 0.0;
double xnm1 = 0.0;
double ynm1 = 0.0;
double yn = 0.0;
double xn = 0.0;
for( ReceiverOperatingCharacteristic.DataPoint point : points )
{
// Technically, this wastes the computation of the first point,
// but since the delta is 0.0, it doesn't effect the AUC.
ReceiverOperatingCharacteristic.DataPoint previous = current;
previous = current;
current = point;
xnm1 = previous.getFalsePositiveRate();
ynm1 = previous.getTruePositiveRate();
xn = current.getFalsePositiveRate();
yn = current.getTruePositiveRate();
final double area = (xn-xnm1) * (yn+ynm1) / 2.0;
auc += area;
}
// Assume that the final point is at xn=1.0
xnm1 = xn;
xn = 1.0;
yn = 1.0;
final double area = (xn-xnm1) * (yn+ynm1) / 2.0;
auc += area;
return auc;
}
/**
* Determines the DataPoint, and associated threshold, that
* simultaneously maximizes the value of
* Area=TruePositiveRate+TrueNegativeRate, usually the
* upper-left "knee" on the ROC curve.
*
* @param roc
* ROC Curve to consider
* @return DataPoint, with corresponding threshold, that maximizes the value
* of Area=TruePositiveRate*(1-FalsePositiveRate), usually the
* upper-left "knee" on the ROC curve.
*/
public static DataPoint computeOptimalThreshold(
ReceiverOperatingCharacteristic roc )
{
return computeOptimalThreshold( roc, 1.0, 1.0 );
}
/**
* Determines the DataPoint, and associated threshold, that
* simultaneously maximizes the value of
* Area=TruePositiveRate+TrueNegativeRate, usually the
* upper-left "knee" on the ROC curve.
*
*
* @return DataPoint, with corresponding threshold, that maximizes the value
* of Area=TruePositiveRate*(1-FalsePositiveRate), usually the
* upper-left "knee" on the ROC curve.
* @param truePositiveWeight
* Amount to weight the TruePositiveRate
* @param trueNegativeWeight
* Amount to weight the TrueNegativeRate
* @param roc ROC Curve to consider
*/
public static DataPoint computeOptimalThreshold(
ReceiverOperatingCharacteristic roc,
double truePositiveWeight,
double trueNegativeWeight )
{
DataPoint bestData = null;
double bestValue = Double.NEGATIVE_INFINITY;
for( ReceiverOperatingCharacteristic.DataPoint data : roc.getSortedROCData() )
{
// Find the point that maximizes the perimeter "below and to the
// right" of the point
DefaultBinaryConfusionMatrix cm = data.getConfusionMatrix();
double y = truePositiveWeight * cm.getTruePositivesRate();
double x = trueNegativeWeight * cm.getTrueNegativesRate();
double value = x + y;
if( bestValue < value )
{
bestValue = value;
bestData = data;
}
}
return bestData;
}
/**
* Computes the value of d-prime given a datapoint
* @param data
* Datapoint from which to estimate d'
* @return
* Estimated distance between the two classes to be split. Larger
* values of d' indicate that the classes are easier to split,
* d'=0 means that the classes overlap, and negative values mean
* that your classifier is doing worse than chance, chump. This
* appears to only be used by psychologists.
*/
public static double computeDPrime(
DataPoint data )
{
double hitRate = data.getConfusionMatrix().getTruePositivesRate();
double faRate = data.getFalsePositiveRate();
double zhr = UnivariateGaussian.CDF.Inverse.evaluate( hitRate, 0.0, 1.0 );
double zfa = UnivariateGaussian.CDF.Inverse.evaluate( faRate, 0.0, 1.0 );
return zhr - zfa;
}
/**
* Getter for dPrime
* @return
* Estimated distance between the two classes to be split. Larger
* values of d' indicate that the classes are easier to split,
* d'=0 means that the classes overlap, and negative values mean
* that your classifier is doing worse than chance, chump. This
* appears to only be used by psychologists.
*/
public double getDPrime()
{
return this.dPrime;
}
/**
* Setter for dPrime
* @param dPrime
* Estimated distance between the two classes to be split. Larger
* values of d' indicate that the classes are easier to split,
* d'=0 means that the classes overlap, and negative values mean
* that your classifier is doing worse than chance, chump. This
* appears to only be used by psychologists.
*/
protected void setDPrime(
double dPrime)
{
this.dPrime = dPrime;
}
/**
* Getter for areaUnderCurve
* @return
* Area underneath the ROC curve, on the interval [0,1]. A value of
* 0.5 means that the classifier is doing no better than chance and
* bigger is better
*/
public double getAreaUnderCurve()
{
return this.areaUnderCurve;
}
/**
* Setter for areaUnderCurve
* @param areaUnderCurve
* Area underneath the ROC curve, on the interval [0,1]. A value of
* 0.5 means that the classifier is doing no better than chance and
* bigger is better
*/
protected void setAreaUnderCurve(
double areaUnderCurve)
{
this.areaUnderCurve = areaUnderCurve;
}
/**
* Getter for optimalThreshold
*
* @return DataPoint, with corresponding threshold, that maximizes the value
* of Area=TruePositiveRate*(1-FalsePositiveRate), usually the
* upper-left "knee" on the ROC curve.
*/
public DataPoint getOptimalThreshold()
{
return this.optimalThreshold;
}
/**
* Setter for optimalThreshold
*
* @param optimalThreshold
* DataPoint, with corresponding threshold, that maximizes the value
* of Area=TruePositiveRate*(1-FalsePositiveRate), usually the
* upper-left "knee" on the ROC curve.
*/
protected void setOptimalThreshold(
DataPoint optimalThreshold)
{
this.optimalThreshold = optimalThreshold;
}
}
/**
* Contains information about a datapoint on an ROC curve
*/
public static class DataPoint
extends AbstractCloneableSerializable
{
/**
* Binary classifier used to create the corresponding ConfusionMatrix,
* which is really a wrapper for the threshold
*/
private ScalarThresholdBinaryCategorizer classifier;
/**
* Corresponding ConfusionMatrix with this datapoint
*/
private DefaultBinaryConfusionMatrix confusionMatrix;
/**
* Creates a new instance of DataPoint
*
* @param classifier
* Binary classifier used to create the corresponding ConfusionMatrix,
* which is really a wrapper for the threshold
* @param confusionMatrix
* Corresponding ConfusionMatrix with this datapoint
*/
public DataPoint(
ScalarThresholdBinaryCategorizer classifier,
DefaultBinaryConfusionMatrix confusionMatrix )
{
this.setClassifier( classifier );
this.setConfusionMatrix( confusionMatrix );
}
/**
* Getter for classifier
* @return
* Binary classifier used to create the corresponding ConfusionMatrix,
* which is really a wrapper for the threshold
*/
public ScalarThresholdBinaryCategorizer getClassifier()
{
return this.classifier;
}
/**
* Setter for classifier
* @param classifier
* Binary classifier used to create the corresponding ConfusionMatrix,
* which is really a wrapper for the threshold
*/
public void setClassifier(
ScalarThresholdBinaryCategorizer classifier)
{
this.classifier = classifier;
}
/**
* Getter for confusionMatrix
* @return
* Corresponding ConfusionMatrix with this datapoint
*/
public DefaultBinaryConfusionMatrix getConfusionMatrix()
{
return this.confusionMatrix;
}
/**
* Setter for confusionMatrix
* @param confusionMatrix
* Corresponding ConfusionMatrix with this datapoint
*/
protected void setConfusionMatrix(
DefaultBinaryConfusionMatrix confusionMatrix)
{
this.confusionMatrix = confusionMatrix;
}
/**
* Gets the falsePositiveRate associated with this datapoint
* @return
* falsePositiveRate associated with this datapoint
*/
public double getFalsePositiveRate()
{
return this.getConfusionMatrix().getFalsePositivesRate();
}
/**
* Gets the truePositiveRate associated with this datapoint
* @return
* truePositiveRate associated with this datapoint
*/
public double getTruePositiveRate()
{
return this.getConfusionMatrix().getTruePositivesRate();
}
/**
* Sorts DataPoints in ascending order according to their
* falsePositiveRate (x-axis)
*/
public static class Sorter
extends AbstractCloneableSerializable
implements Comparator<DataPoint>
{
/**
* Sorts ROCDataPoints in ascending order according to their
* falsePositiveRate (x-axis), used in Arrays.sort() method
*
* @param o1 First datapoint
* @param o2 Second datapoint
* @return
* -1 if o1<o2, +1 if o1>o2, 0 if o1=o2
*/
@Override
public int compare(
ReceiverOperatingCharacteristic.DataPoint o1,
ReceiverOperatingCharacteristic.DataPoint o2)
{
double x1 = o1.getFalsePositiveRate();
double x2 = o2.getFalsePositiveRate();
if( x1 < x2 )
{
return -1;
}
else if( x1 > x2 )
{
return +1;
}
else
{
double y1 = o1.getTruePositiveRate();
double y2 = o2.getTruePositiveRate();
if( y1 < y2 )
{
return -1;
}
else if( y1 > y2 )
{
return +1;
}
else
{
return 0;
}
}
}
}
}
/**
* Sorts score estimates for the ROC create() method
*/
private static class ROCScoreSorter
extends AbstractCloneableSerializable
implements Comparator<InputOutputPair<Double,? extends Object>>
{
/**
* Sorts score estimates for the ROC create() method
*
* @param o1 First score
* @param o2 Second score
* @return -1 if o1<o2, +1 if o1>o2, 0 if o1=02
*/
@Override
public int compare(
InputOutputPair<Double,? extends Object> o1,
InputOutputPair<Double,? extends Object> o2)
{
if( o1.getInput() < o2.getInput() )
{
return -1;
}
else if( o1.getInput() > o2.getInput() )
{
return +1;
}
else
{
return 0;
}
}
}
}
| java |
116/7 (17. 0 ov)
119/4 (16. 1 ov)
172/7 (20. 0 ov)
157 (20. 0 ov)
Afghanistan face off against Zimbabwe in the second of the five-match ODI series at Sharjah.
Welcome to CricketCountry’s live coverage of the second of the five-match ODI) series between Afghanistan and Zimbabwe at Sharjah.
Afghanistan take on Zimbabwe in the second of the five-match ODI series at Sharjah.
Afghanistan started off 2015 with the Dubai Triangular Series in United Arab Emirates (UAE).
Afghanistan defended the fifth-lowest ODI score in history, playing against Zimbabwe at Sharjah in the first of the five-match series, 2015-16.
Amir Hazma's four-wicket hail and Mohammad Nabi's three-wicket spell was enough to destry Zimbabwe's shaky batting line-up.
Graeme Cremer claimed five for 20, that just rattled the Afghanistan batting line-up and they were bowled out for a loe total of 131. | english |
Preview: After a disappointing loss against USA, a spirited India gave the fans plenty to cheer about in the second game against Colombia, including the first ever FIFA World Cup goal.
Now, the Blue Colts will look to end the tournament in style as they take on Ghana in the final group fixture at the Jawaharlal Nehru Stadium on Thursday.
Mathematically, India can still qualify for the round of 16. They need to beat Ghana by a big margin, and hope that US does the same against Colombia. US are the only team which has sealed their spot in the round of 16 and currently top the group with 6 points.
Coach Luis Norton de Matos termed Ghana as a physical and mental challenge but at the same time said his boys will go out to win.
“Ghana will be a physical as well as a mental challenge for us. They (Ghana) are a strong physical team who are quick on the ball. We would have to be on our toes for the entirety of the match, if we are to secure a win," de Matos said.
“However, the boys are ready for the challenge that will be thrown in front of them. We will give it our all and aim to create history once again," he added.
The likes of Aminu Mohammed and Sadiq Ibrahim in the flanks, and captain Eric Ayiah up front are likely to provide the stiffest challenge to the Indian backline. Ghana looked like the better team than even US in phases when the two teams clashed. However, the lack of finishing is something that will worry their head coach Samuel Fabin.
“We need to work on our finishing, we have a couple of days before we face India and we will use that time to work on it,” Fabin had said after the game against US.
He also warned his boys not to take the Indian side lightly. Boris ended the previous game with a bandage on his forehead, meanwhile Anwar Ali was seen limping out with the squad. India will need both these players to be on their A game against Ghana.
India’s star player Komal Thatal started on the bench in the last game, and it will be interesting to see if de Matos goes in with the same tactics yet again.
With the Ghanian defence expected to be physical, Rahim Ali might well retain his place in the squad. Goalkeeper Dheeraj is expected to have yet another busy night in goal, and he called on the fans to cheer for the team in even bigger numbers for the final group game.
“Against Ghana we will need a lot of support. We will give it our very best on the pitch. I expect all to be cheering for us like they have done for us. We won’t disappoint them. Come and back the blue," he said.
Squads:
Ghana: Ibrahim Danlad, Michael Acquaye, Kwame Aziz, Najeeb Yakubu, Gideon Mensah, Bismark Terry Owusu, Edmund Arko-Mensah, Abdul Razak Yusif, Gideon Acquah, Rashid Alhassan, John Out, Isaac Gyamfi, Gabriel Leveh, Ibrahim Sulley, Mohammed Kudus, Emmanuel Toku, Mohammed Iddriss, Eric Ayiah, Richard Danso, Mohammed Aminu, Ibrahim Sadiq. | english |
KATHMANDU, July 21: One of the chaimen of the Jantata Samajbadi Party (JSP) has held a meeting with Prime Minister Sher Bahadur Deuba.
Thakur reached the official residence of the prime minister in Baluwatar at 9 on Wednesday morning.
Satendra Mishra, an aide to Thakur, told Ratopati that he [Thakur] visited Deuba to congratulate the latter on winning parliament’s confidence and also to draw the attention of the government over their demands.
On the occasion, Thakur asked PM Deuba to address their demands as per the commitment made by him [PM] prior to the voting held on his confidence motion on Sunday, earlier this week.
The faction of the JSP, led by Thakur, has been demanding the amendment of the constitution,withdrawing cases against and realising its cadres and leaders including Resham Chaudhary, addressing the issues of citizenship among others.
The faction reportedly voted in favor of Deuba’s trust motion after the latter committed to addressing their demands. | english |
<filename>json/cplus/reference.json<gh_stars>1-10
{"file_io.cpp":"html/file_io.cpp.txt","json_manipulate.cpp":"html/json_manipulate.cpp.txt","text_manipulate.cpp":"html/text_manipulate.cpp.txt"} | json |
Free Video Downloader HD is a free app for Android, that belongs to the category 'Music & Radio'.
HD Video Downloader App is a free program for Android, belonging to the category 'Lifestyle'.
VidX: HD Video Downloader is a free app for Android, belonging to the category 'Utilities & Tools'.
Video Downloader Download Video Social HD 2019 is a free program for Android, that belongs to the category 'Multimedia '.
| english |
<gh_stars>0
[{"team_id": 663, "team": "Southern Methodist", "id": "750", "name": "<NAME>", "year": "JR", "hometown": "Duncanville, Texas", "high_school": null, "previous_school": null, "height": "5'9\"", "position": "Guard", "jersey": "2", "url": "/sports/womens-basketball/roster/kristin-hernandez/750", "season": "2009-10"}, {"team_id": 663, "team": "Southern Methodist", "id": "751", "name": "<NAME>", "year": "FR", "hometown": "Duncanville, Texas", "high_school": "Duncanville", "previous_school": null, "height": "5'8\"", "position": "Guard", "jersey": "3", "url": "/sports/womens-basketball/roster/jasmine-davis/751", "season": "2009-10"}, {"team_id": 663, "team": "Southern Methodist", "id": "752", "name": "<NAME>", "year": "SO", "hometown": "Little Rock, Ark.", "high_school": null, "previous_school": null, "height": "5'10\"", "position": "Guard", "jersey": "4", "url": "/sports/womens-basketball/roster/kelsey-hatcher/752", "season": "2009-10"}, {"team_id": 663, "team": "Southern Methodist", "id": "753", "name": "<NAME>", "year": "SR", "hometown": "Mesquite, Texas", "high_school": "Mesquite", "previous_school": null, "height": "5'10\"", "position": "Forward", "jersey": "5", "url": "/sports/womens-basketball/roster/delisha-wills/753", "season": "2009-10"}, {"team_id": 663, "team": "Southern Methodist", "id": "754", "name": "<NAME>", "year": "SR", "hometown": "Tyler, Texas", "high_school": "Tyler", "previous_school": null, "height": "5'11\"", "position": "Guard", "jersey": "10", "url": "/sports/womens-basketball/roster/brittany-gilliam/754", "season": "2009-10"}, {"team_id": 663, "team": "Southern Methodist", "id": "755", "name": "<NAME>", "year": "RS SO", "hometown": "Garland, Texas", "high_school": "Missouri", "previous_school": null, "height": "6'3\"", "position": "Post / Forward", "jersey": "20", "url": "/sports/womens-basketball/roster/heidi-brandenburg/755", "season": "2009-10"}, {"team_id": 663, "team": "Southern Methodist", "id": "756", "name": "<NAME>", "year": "SO", "hometown": "Wichita, Kan.", "high_school": "South", "previous_school": null, "height": "6'2\"", "position": "Post", "jersey": "21", "url": "/sports/womens-basketball/roster/christine-elliott/756", "season": "2009-10"}, {"team_id": 663, "team": "Southern Methodist", "id": "757", "name": "<NAME>", "year": "FR", "hometown": "Mansfield, Texas", "high_school": "Summit", "previous_school": null, "height": "5'7\"", "position": "Guard", "jersey": "22", "url": "/sports/womens-basketball/roster/alisha-filmore/757", "season": "2009-10"}, {"team_id": 663, "team": "Southern Methodist", "id": "758", "name": "<NAME>", "year": "JR", "hometown": "Rockwall, Texas", "high_school": "Rockwall", "previous_school": null, "height": "5'10\"", "position": "Guard/Forward", "jersey": "24", "url": "/sports/womens-basketball/roster/haley-day/758", "season": "2009-10"}, {"team_id": 663, "team": "Southern Methodist", "id": "759", "name": "<NAME>", "year": "SO", "hometown": "Kennedale, Texas", "high_school": "Kennedale High School", "previous_school": null, "height": "5'8\"", "position": "Guard", "jersey": "33", "url": "/sports/womens-basketball/roster/samantha-mahnesmith/759", "season": "2009-10"}, {"team_id": 663, "team": "Southern Methodist", "id": "760", "name": "<NAME>", "year": "RS JR", "hometown": "Midland, Texas", "high_school": "Texas Tech", "previous_school": null, "height": "5'6\"", "position": "Guard", "jersey": "35", "url": "/sports/womens-basketball/roster/raquel-christian/760", "season": "2009-10"}, {"team_id": 663, "team": "Southern Methodist", "id": "761", "name": "<NAME>", "year": "SR", "hometown": "Allen, Texas", "high_school": "Allen", "previous_school": null, "height": "6'2\"", "position": "Post", "jersey": "40", "url": "/sports/womens-basketball/roster/alice-severin/761", "season": "2009-10"}, {"team_id": 663, "team": "Southern Methodist", "id": "762", "name": "<NAME>", "year": "SR", "hometown": "Mesquite, Texas", "high_school": "Horn", "previous_school": null, "height": "5'4\"", "position": "Guard", "jersey": "41", "url": "/sports/womens-basketball/roster/jillian-samuels/762", "season": "2009-10"}, {"team_id": 663, "team": "Southern Methodist", "id": "763", "name": "<NAME>", "year": "FR", "hometown": "Fort Worth, Texas", "high_school": "Nolan Catholic", "previous_school": null, "height": "6'3\"", "position": "Post", "jersey": "42", "url": "/sports/womens-basketball/roster/sarah-shelton/763", "season": "2009-10"}] | json |
Prior to submitting her nomination papers for the upcoming election, Droupadi Murmu, the presidential candidate for the National Democratic Alliance, met with Prime Minister Narendra Modi on Thursday. Soon after arriving in the nation's capital, she met PM Modi. Earlier, Prime Minister Modi stated on Twitter that all facets of Indian society support her bid for the presidency.
Modi is predicted to be the first proposer when she submits her nomination papers on Friday.
On Tuesday evening, the BJP-led NDA named Droupadi Murmu as its presidential candidate, while the opposition parties named Yashwant Sinha, a former finance minister, as their nominee for the office. | english |
The Attention of the District Educational Officers & Ex-officio Project Coordinators, Additional project Coordinators of Samagra Shiksha and Principals of DIET in the state are invited to the ref cited and informed that e-Content was embedded in QR Codes for semester -1 textbooks of classes I to VI was completed in the month of September-2020 and the content is reflecting in the textbook QR codes .
In this context, DIKSHA of SIEMAT is proposing a 7 day workshop for pooling and creation e-Content for untagged QR Codes of the textbooks from classes I to VI from 23-12-2020 to 31-12-2020 i.e ( except on 25th and 27th). The services of 85 teachers (creators, curators and reviewers) who are earlier involved in ETB workshop will be utilized.
The identified teachers (in annexure-3) has to work from their place during the above 7-day workshop in the application provided by state DIKSHA team.
The workshop schedule (Annexure-1), guidelines for content creators (Annexure-2) and list of teachers for workshop (Annexure-3) are attached herewith. This has got approval of State Project Director Samagra Shiksha Andhra Pradesh.
| english |
package dev.maow.owo.util;
import java.util.*;
/**
* An immutable class that stores instances of different options present in {@link dev.maow.owo.api.OwO}.
* <p>
* This class is immutable in the way that when an option is changed, a new instance of {@code Options} is created.
* <p>
* This class also has a default set of options accessible by {@link Options#defaults()}.
*
* @author Maow
* @version %I%
* @since 2.0.0
*/
public class Options {
private static Options defaultOptions;
private final int maxLength;
private final Map<String, String> substitutions;
private final List<String> prefixes;
private final List<String> suffixes;
public Options(int maxLength,
Map<String, String> substitutions,
List<String> prefixes,
List<String> suffixes) {
this.maxLength = maxLength;
this.substitutions = substitutions;
this.prefixes = prefixes;
this.suffixes = suffixes;
}
public int getMaxLength() {
return maxLength;
}
public Options setMaxLength(int maxLength) {
return new Options(
maxLength,
new HashMap<>(substitutions),
new ArrayList<>(suffixes),
new ArrayList<>(prefixes)
);
}
public Map<String, String> getSubstitutions() {
return substitutions;
}
public Options addSubstitution(String original, String substitution) {
final Map<String, String> newSubstitutions
= new HashMap<>(substitutions);
newSubstitutions.put(original, substitution);
return new Options(
maxLength, newSubstitutions,
new ArrayList<>(prefixes),
new ArrayList<>(suffixes)
);
}
public List<String> getPrefixes() {
return prefixes;
}
public Options addPrefix(String prefix) {
final List<String> newPrefixes = new ArrayList<>();
newPrefixes.add(prefix);
return new Options(
maxLength,
new HashMap<>(substitutions),
newPrefixes,
new ArrayList<>(suffixes)
);
}
public List<String> getSuffixes() {
return suffixes;
}
public Options addSuffix(String suffix) {
final List<String> newSuffixes = new ArrayList<>();
newSuffixes.add(suffix);
return new Options(
maxLength,
new HashMap<>(substitutions),
new ArrayList<>(prefixes),
newSuffixes
);
}
public static Options defaults() {
return (defaultOptions == null)
? defaultOptions = OptionsUtil.getDefaultOptions()
: defaultOptions;
}
} | java |
Mohammed Salim was an Indian professional footballer who is known for being the first Indian player to play for a European club, Celtic FC. He was born in 1904 in Calcutta, in the Bengal Presidency of British India. He died on 5th November 1980 in his hometown. He played as winger on the right side of the field.
In reference to Salim’s ability, the Scottish Daily Express said “Ten twinkling toes of Salim, Celtic FC’s player from India hypnotised the crowd at Parkhead last night in an Alliance game with Galston. He balances the ball on his big toe, lets it run down the scale to his little toe, twirls it, hops on foot around the defender, then flicks the ball to the center who has only to send it into goal. Three of Celtic’s seven goals last night came from his moves”.
Probably one of the greatest players in the history of Indian football, he remains an inconspicuous figure because of a discriminatory attitude towards traditional Muslims in Indian football at that time.
He was awarded the Dr. Bidhan Chandra Roy State Award in 1976, which remains the only recognition that he was honoured upon.
He never received formal academic training in football, he was succeeded with the help of his immense talent. A chemist and pharmacist by trade, he was drawn to football by Mohun Bagan’s success in IFA Shield in 1911. He started out with the Chittaranjan Club of Calcutta in 1926.
Since India was under the rule of the British, there was no formal Indian team as the AIFF was not formed until 1937.
Instead there was an All India XI team, that was under the jurisdiction of IFA. He made his debut for the All India XI team in 1936 against the Chinese Olympic side in a exhibition match, which was the first international game to be played in India.
The Indian team lost the match but Salim and the other forwards were praised by the Chinese officials.
He first tasted success with Mohammedan Sporting Club as he guided them to five league titles in succession from 1934-38.
However, he gained international reputation when his cousin, Hasheem who lived in England took him to Glasgow. Hasheem spoke to the Celtic manager Willie Maley.
The Celtic manager was amused at the thought of a bare-footed amateur from India competing against Scottish professional players, however he agreed to take him on trial.
Salim managed to astonish them with his impressive skill, and the Celtic officials decided to play him in the two upcoming friendly matches.
He made his debut against Hamilton Accies and helped Celtic win 5-1. He then played against Galston, guiding Celtic to a 7-1 win.
The next day, Salim was all over Scottish newspapers with positive appraisals. However, the fairy tale remained to be as Salim fell homesick and returned to India, despite the pleas of Celtic who were willing to play a charity match on his behalf.
Salim played for Chittaranjan Football Club, Sporting Union, East Bengal, Aryans Club alongside Celtic and Mohammedan.
Salim retired in 1938 after guiding Mohammedan Sporting to their fifth successive league title win. | english |
{
"author" : "<NAME>",
"name" : "Analytics",
"id" : "h5bp-analytics",
"inserts" :
[
{
"what" : "analytics.html",
"where" : "index.html/body/end"
}
]
}
| json |
Japan said on Thursday it was not currently looking to prioritise COVID-19 vaccines for Olympic athletes, dismissing a media report that sparked a social media outcry since the country's inoculations are trailing other major economies.
Only a million people have received the first dose of the Pfizer vaccine since February, out of Japan's population of 126 million, and the more vulnerable elderly do not even start getting their shots until next week.
New infections have spiked ahead of the Olympics, which are set to start in July. Tokyo saw 545 new cases on Thursday and its governor said she would ask the central government to impose emergency measures in the capital region.
A Kyodo news agency report, citing government officials, said Japan has begun looking into the possibility of ensuring its Olympic and Paralympic athletes are all vaccinated by the end of June.
'Give it to my mother first,' one Twitter user wrote, adding: 'Athletes are all young and healthy.'
While the government has said it will push ahead with the Olympics as planned from July 23, a vast majority of Japanese want the Games to be cancelled or postponed again.
The outrage on social media continued despite Chief Cabinet Secretary Katsunobu Kato denying the report and saying that the government was not looking to give priority to athletes.
"This is really weird. Given that we have no idea if even all the elderly will have received their vaccines by mid-June, you're going to have all the athletes have theirs?" a user with the handle "Aoiumi2" posted on Twitter.
Others noted that Japan's original plan gives priority to medical workers, the elderly and those with chronic conditions, with ordinary citizens unlikely to get theirs before the summer.
A number of test events for some sports have recently been cancelled or postponed due to concerns about the pandemic, and on Tuesday leading business executive Hiroshi Mikitani wrote on Twitter that holding the Games was 'risky'.
"Honestly, I feel that the Olympics this summer are just far too risky. I am against them," wrote Mikitani, the CEO of Japanese e-commerce group Rakuten Inc.
Even so, much of corporate Japan is still mobilized behind the Olympics. Atsushi Katsuki, the CEO of Asahi Group, said he stood by holding the Games and that the leading beer maker had benefited from being a sponsor.
"I want the Olympics and Paralympic Games to be held," Katsuki said in an interview with Reuters.
"It's unfortunate that the Olympics have been scaled down, but we're not too concerned about that," he added.
A health adviser to Japan's Olympic committee said on Tuesday athletes should have the option of getting COVID-19 vaccines, days after public outcry led the government to deny it was making them a priority.
Japan on Thursday had dismissed a media report that it was considering vaccinating all its Olympians by the end of June after the idea sparked a social media uproar amid a slow vaccine rollout for the rest of the population.
But on Tuesday, the adviser, Nobuhiko Okabe, told Reuters that although vaccines should not be an obligation, they should be available to the athletes who want them. Okabe is an infectious disease expert who helped guide Japan's response to the H1N1 outbreak in 2009 and advises on its COVID-19 response.
"I think the recommendation should be to be immunized, particularly for the athletes," said Okabe, who has held leadership roles in the World Health Organisation.
He said choices by individual athletes to refuse the vaccine for health or religious reasons "should be respected."
About 1.1 million health care workers in Japan have received at least their first dose of Pfizer Inc-BioNTech's vaccine.
Inoculations of the country's sizable elderly population began on Monday, but some experts caution that shots for the general populace may not be available until late summer or even winter because of constrained supplies.
Okabe, who heads the Kawasaki City Institute for Public Health, also said Japan's commercialisation and licensing hurdles involving drugs and medical products remain a "big problem," as they could slow its response to health crisis such as pandemics.
Japan has approved only one COVID-19 vaccine so far and about 0.9% of its population of 126 million has gotten at least one dose of COVID-19 vaccine, compared with 2.2% in South Korea or 36% in the United States, according to a Reuters tracker.
| english |
<reponame>cardsofkeyforge/json
{"id":"fc45d50a-846c-4ce4-ba5a-f6beb6dc8000","card_title":"Plano Magistral","house":"Shadows","card_type":"Artifact","front_image":"https://cdn.keyforgegame.com/media/card_front/pt/496_201_8FJVHVWFWC4P_pt.png","card_text":"Play: Put a card from your hand facedown under Masterplan.\r\nOmni: Play the card under Masterplan. Destroy Masterplan.","traits":"Item","amber":1,"power":null,"armor":null,"rarity":"Rare","flavor_text":null,"card_number":"201","expansion":496,"is_maverick":false,"is_anomaly":false,"is_enhanced":false,"is_non_deck":false} | json |
Although various people have been trying to make some form of live-action entertainment out of the hit Fallout video game series for years, none of these projects have even gotten far enough along to ever hire someone to star in the dang thing. Well, until today, when it was announced that Walton Goggins will be playing a leading role in Jonathan Nolan and Lisa Joy’s attempt to bring Fallout’s quirky post-apocalypse to life.
Fallout games have traditionally—OK, exclusively—chosen non-radiated faux-zombies as their protagonists, specifically people who have grown up in Vaults, the various fallout shelters survivors entered to avoid a nuclear war that turned America into a wasteland. Making a Ghoul the lead of the Fallout TV show would be a very wild decision for Nolan and Joy to make, given the immense popularity of the games, so I’m assuming Goggins will play one of the Vault-dweller’s companions or perhaps their antagonist.
But there’s honestly no telling, at least for now. Literally all we know about the series is that Nolan and Joy are going to produce it, Captain Marvel writer Geneva Robertson-Dworet and Silicon Valley co-producer Graham Wagner will be the showrunners, and presumably it will keep the weird 1950s-sci-fi-gone-horribly-wrong vibe of the video games. Still, hiring an actor as talented as Goggins is a very good start.
Wondering where our RSS feed went? You can pick the new up one here.
| english |
<filename>Python/illiteracy.py
# https://open.kattis.com/problems/illiteracy
from collections import deque
NUM_ICONS = 8
NUM_UNIQUE_ICONS = 6
ROTATIONS = list('ABCDEF')
ROTATIONS_INV = {ROTATIONS[i]: i for i in range(NUM_UNIQUE_ICONS)}
def rotate(c):
return ROTATIONS[(ROTATIONS_INV[c] + 1) % NUM_UNIQUE_ICONS]
def click(s, i):
t = s[i]
if t == 'A':
if i == 0: return s[0] + rotate(s[1]) + s[2:]
if i == 7: return s[:6] + rotate(s[6]) + s[7]
return s[:i - 1] + rotate(s[i - 1]) + s[i] + rotate(s[i + 1]) + s[i + 2:]
if t == 'B':
if i in (0, 7): return s
return s[:i + 1] + s[i - 1] + s[i + 2:]
if t == 'C':
p = 7 - i
return s[:p] + rotate(s[p]) + s[p + 1:]
if t == 'D':
if i in (0, 7): return s
if i < 4: return ''.join(rotate(s[x]) for x in range(i)) + s[i:]
return s[:i + 1] + ''.join(rotate(s[x]) for x in range(i + 1, 8))
if t == 'E':
if i in (0, 7): return s
if i < 4: y = i
else: y = 7 - i
p1, p2 = i - y, i + y
return s[:p1] + rotate(s[p1]) + s[p1 + 1:p2] + rotate(s[p2]) + s[p2 + 1:]
if t == 'F':
i += 1
p = (i + 9) // 2 if i & 1 else i // 2
p -= 1
return s[:p] + rotate(s[p]) + s[p + 1:]
def bfs(initial, target):
visited = {initial}
queue = deque([(0, initial)])
while queue:
level, s = queue.popleft()
if s == target: return level
for i in range(NUM_ICONS):
ns = click(s, i)
if ns in visited: continue
if ns == target: return level + 1
visited.add(ns)
queue.append((level + 1, ns))
return -1
print(bfs(raw_input(), raw_input()))
| python |
/*
* School: Diablo Valley College
* Term: 2017 Fall
* Course: ComSc-110-3120,
* Introduction to Programming with C++
*
* Chapter: 06
* Program: Pr06a-Tax-Agopian-Armand.cpp
* Author: <NAME>
* Date: September 14, 2017
*
* Purpose: Learn about branching statements
* that evaluate either simple or
* compound conditions.
*
* Review calculations, and the neat
* formatting of console output.
*
* Initial
* Problem: Based on an annual income amount that
* a user enters, calculate and output a
* tax amount that the user may owe the
* Internal Revenue Service (IRS).
*
* See the course website and/or the internet
* for documents that show sample console
* interaction, year 2017 federal tax
* brackets, and coding conventions.
*
* For other details, watch the classroom
* screen, and listen to instructions.
*
* Next
* Problem: Validate the income that a user enters.
* If it is too low or too high, output an
* error message, and end the program.
*/
//Preprocessor directives
#include <iomanip>
#include <iostream>
using namespace std;
//Main Routine
int main()
{
//Declare variables
int year; //Tax year
float inc; //User's annual income (dollars)
float high1; //High end income for bracket 1
float high2; //... bracket 2
float high3; //... bracket 3
float btax1; //Base tax amount for bracket 1
float btax2; //... bracket 2
float btax3; //... bracket 3
float rate1; //Tax rate for bracket 1 (percent)
float rate2; //... bracket 2
float rate3; //... bracket 3
float low; //Low end income for user's bracket
float high; //High...
float exc; //Excess income (above low end
//of user's bracket)
float rate; //Tax rate (percent) for user's
//excess income
float btax; //User's base tax amount
float etax; //User's excess...
float ttax; //User's total...
//Assign values
year = 2017;
high1 = 9325.00;
high2 = 37950.00;
high3 = 91900.00;
btax1 = 0.00;
btax2 = 932.50;
btax3 = 5226.25;
rate1 = 10.0;
rate2 = 15.0;
rate3 = 25.0;
//Output title, description, and instructions
cout << endl;
cout << " Tax Program " << endl;
cout << "-----------------------------------" << endl;
cout << endl;
cout << "This program calculates a US \n"
<< "federal income tax amount for \n"
<< "a single person of modest means." << endl;
cout << endl
<< "For year "
<< year
<< ", enter an annual \n"
<< "income as a positive dollar amount \n"
<< "less than or equal to "
<< high3
<< "." << endl;
//Prompt the user for annual income, and inpput it
cout << endl;
cout << "Income? ";
cin >> inc;
//Validat the user's income
if(inc <= 0 || inc > high3)
{
cout << "Invalid: Out of Range";
return 69;
}
//Identify the user's tax bracket
if(inc > 0 && inc <= high1)
{
low = 0;
high = high1;
rate = rate1;
btax = btax1;
} else if(inc > high1 && inc <= high2)
{
low = high1;
high = high2;
rate = rate2;
btax = btax2;
} else if(inc > high2 && inc <= high3)
{
low = high2;
high = high3;
rate = rate3;
btax = btax3;
}
//Calculate the user's tax amounts
exc = inc - low;
etax = rate / 100.0 * exc;
ttax = btax + etax;
//Set console formatting, then output results
cout << fixed << showpoint << setprecision(2);
cout << endl;
cout << "Bracket" << endl;
cout << " Low : " << "$ " << setw(8) << low
<< endl;
cout << " High : " << "$ " << setw(8) << high
<< endl;
cout << "Base Tax : " << "$ " << setw(18) << btax
<< endl;
cout << "Exc. Inc.: " << "$ " << setw(8) << exc
<< endl;
cout << "Tax Rate : " << setw(10) << rate << "%"
<< endl;
cout << "Exc. Tax : " << "$ " << setw(18) << etax
<< endl;
cout << setw(31) << "---------" << endl;
cout << "Tot. Tax : " << "$ " << setw(18) << ttax
<< endl;
}
| cpp |
if ((typeof routerLoaded === "undefined") ||
((typeof routerLoaded === "boolean") && !routerLoaded)) {
require('./router')();
}
//node modules import
const fs = require('fs');
const mime = require('mime');
let routesData = {
routes: {},
routesLoaded: false
};
//default 404 result page route
routes = registerRoute(routes, '404', (req, res) => {
res.statusCode = 404;
res.statusMessage = 'Route is not set.';
res.end();
});
//public file route
routes = registerRoute(routes, 'public', (req, res) => {
res.setHeader('Content-Type', mime.getType(req.url));
if (fs.existsSync(__dirname + '/public' + req.url)) {
res.write(fs.readFileSync(__dirname + '/public' + req.url));
res.statusCode = 200;
} else {
res.statusCode = 404;
}
res.end();
});
//homepage route
routes = registerRoute(routes, '/', (req, res) => {
try {
res.setHeader('Content-Type', 'text/html');
res.write(fs.readFileSync(__dirname + '/index.html'));
res.statusCode = 200;
res.end();
} catch(e) {
res.statusCode = 500;
res.statusMessage = "server error";
res.end();
}
});
module.exports = function() {
console.log(routes);
routesData.routes = routes
routesData.routesLoaded = true;
return routesData;
} | javascript |
{"categories":["Engineering","Programming","Web Development"],"desc":" ","details":{"authors":"<NAME>","format":"pdf","isbn-10":"1118442547","isbn-13":"978-1118442548","pages":"528 pages","publication date":"March 18, 2013","publisher":"Wrox","size":"28.02Mb"},"img":"http://2192.168.127.128/covers/74/74e7cc3dce82c880876b049158180b66.jpg","link":"https://rapidhosting.info/files/dxy","title":"Beginning ArcGIS for Desktop Development using .NET"} | json |
Mumbai, May 3 (IANS): Defending champions Mumbai Indians’ five-match losing streak in the Indian Premier League (IPL) finally ended on Saturday with a five-wicket win over Kings XI Punjab at the Wankhede Stadium here.
Mumbai’s win also snapped Kings XI Punjab’s five-match winning run and dislodged them from the top position that has now been taken by Chennai Super Kings.
Mumbai Indians overcame a dodgy start, and fine batting performances by Chidhambaram Gautam (33), skipper Rohit Sharma (39) and Corey Anderson (35) helped them get to 170 for five with five balls to spare in reply to Kings XI Punjab’s 168/5.
Kings XI pacer Sandeep Sharma struck twice in consecutive overs to get rid of opening batsman Ben Dunk (5) and Ambati Rayudu (8) that left Mumbai Indians at a precarious 23/2.
But it was the 47-run stand between Gautam and Rohit that brought the chase back on track. Neither Gautam not Rohit looked in a hurry, and they took their time to build the innings and also made sure that the boundaries kept flowing.
After Gautam’s dismissal in the 10th over, Corey Anderson struck a quick-fire 35 off 25 balls, hitting three sixes and two fours, to take Mumbai Indians to sniffing distance of a win.
Kieron Pollard (28 not out from 12 balls) and Aditya Tare (16 not out from six balls) then took the Mumbai Indians home safely with some powerful hitting.
Earlier in the day, crucial knocks from Wriddhiman Saha (59 not out) and Glenn Maxwell (45) helped Kings XI reach a competitive score of 168/9. Saha struck four fours and three sixes in his 47-ball knock while Maxwell again struck a whirlwind knock that was studded with five fours and two sixes.
Mumbai Indians pacer Lasith Malinga was superb in the death overs giving away 25 runs for one wicket from his four overs, while offie Harbhajan Singh got two for 34 from his four overs.
| english |
<gh_stars>0
package aliyuncms
import (
"errors"
"testing"
"time"
"github.com/aliyun/alibaba-cloud-sdk-go/services/cms"
"github.com/influxdata/telegraf"
"github.com/influxdata/telegraf/internal"
"github.com/influxdata/telegraf/plugins/inputs"
"github.com/influxdata/telegraf/testutil"
"github.com/stretchr/testify/require"
)
type mockGatherAliyunCMSClient struct{}
func (m *mockGatherAliyunCMSClient) QueryMetricList(request *cms.QueryMetricListRequest) (*cms.QueryMetricListResponse, error) {
resp := new(cms.QueryMetricListResponse)
switch request.Metric {
case "InstanceActiveConnection":
resp.Code = "200"
resp.Period = "60"
resp.Datapoints = `
[{
"timestamp": 1490152860000,
"Maximum": 200,
"userId": "1234567898765432",
"Minimum": 100,
"instanceId": "i-abcdefgh123456",
"Average": 150,
"Value": 300
}]`
case "ErrorCode":
resp.Code = "404"
resp.Message = "ErrorCode"
case "ErrorDatapoint":
resp.Code = "200"
resp.Period = "60"
resp.Datapoints = `
[{
"timestamp": 1490152860000,
"Maximum": 200,
"userId": "1234567898765432",
"Minimum": 100,
"instanceId": "i-abcdefgh123456",
"Average": 150,
}]`
case "EmptyDatapoint":
resp.Code = "200"
resp.Period = "60"
case "ErrorResp":
return nil, errors.New("error response")
}
return resp, nil
}
func TestInit(t *testing.T) {
require.Equal(t, &AliyunCMS{RateLimit: 200}, inputs.Inputs["aliyuncms"]())
}
func TestGatherMetric(t *testing.T) {
duration, _ := time.ParseDuration("1m")
internalDuration := internal.Duration{
Duration: duration,
}
var acc telegraf.Accumulator
s := &AliyunCMS{
Period: internalDuration,
Delay: internalDuration,
Project: "acs_slb_dashboard",
client: new(mockGatherAliyunCMSClient),
}
dimension := &Dimension{
Value: `"instanceId": "p-example"`,
}
require.EqualError(t, s.gatherMetric(acc, "DecodeError", dimension), `failed to decode "instanceId": "p-example": invalid character ':' after top-level value`)
dimension = &Dimension{
Value: `{"instanceId": "p-example"}`,
}
require.EqualError(t, s.gatherMetric(acc, "ErrorCode", dimension), "failed to query metric list: ErrorCode")
require.EqualError(t, s.gatherMetric(acc, "ErrorDatapoint", dimension),
`failed to decode response datapoints: invalid character '}' looking for beginning of object key string`)
require.EqualError(t, s.gatherMetric(acc, "ErrorResp", dimension), "failed to query metric list: error response")
}
func TestGather(t *testing.T) {
metric := &Metric{
MetricNames: []string{},
Dimensions: []*Dimension{
{
Value: `{"instanceId": "p-example"}`,
},
},
}
s := &AliyunCMS{
AccessKeyID: "my_access_key_id",
AccessKeySecret: "my_access_key_secret",
Project: "acs_slb_dashboard",
Metrics: []*Metric{metric},
RateLimit: 200,
}
// initialize error
var acc testutil.Accumulator
require.EqualError(t, acc.GatherError(s.Gather), "region id is not set")
s.RegionID = "cn-shanghai"
s.client = new(mockGatherAliyunCMSClient)
// empty datapoint test
s.Metrics[0].MetricNames = []string{"EmptyDatapoint"}
require.Empty(t, acc.GatherError(s.Gather))
require.False(t, acc.HasMeasurement("aliyuncms_acs_slb_dashboard"))
// correct data test
fields := map[string]interface{}{
"instance_active_connection_minimum": float64(100),
"instance_active_connection_maximum": float64(200),
"instance_active_connection_average": float64(150),
"instance_active_connection_value": float64(300),
}
tags := map[string]string{
"regionId": "cn-shanghai",
"instanceId": "p-example",
"userId": "1234567898765432",
}
s.Metrics[0].MetricNames = []string{"InstanceActiveConnection"}
require.Empty(t, acc.GatherError(s.Gather))
require.True(t, acc.HasMeasurement("aliyuncms_acs_slb_dashboard"))
acc.AssertContainsTaggedFields(t, "aliyuncms_acs_slb_dashboard", fields, tags)
}
func TestUpdateWindow(t *testing.T) {
duration, _ := time.ParseDuration("1m")
internalDuration := internal.Duration{
Duration: duration,
}
s := &AliyunCMS{
Project: "acs_slb_dashboard",
Period: internalDuration,
Delay: internalDuration,
}
now := time.Now()
require.True(t, s.windowEnd.IsZero())
require.True(t, s.windowStart.IsZero())
s.updateWindow(now)
newStartTime := s.windowEnd
// initial window just has a single period
require.EqualValues(t, s.windowEnd, now.Add(-s.Delay.Duration))
require.EqualValues(t, s.windowStart, now.Add(-s.Delay.Duration).Add(-s.Period.Duration))
now = time.Now()
s.updateWindow(now)
// subsequent window uses previous end time as start time
require.EqualValues(t, s.windowEnd, now.Add(-s.Delay.Duration))
require.EqualValues(t, s.windowStart, newStartTime)
}
func TestInitializeAliyunCMS(t *testing.T) {
s := new(AliyunCMS)
require.EqualError(t, s.initializeAliyunCMS(), "region id is not set")
s.RegionID = "cn-shanghai"
require.EqualError(t, s.initializeAliyunCMS(), "project is not set")
s.Project = "acs_slb_dashboard"
require.EqualError(t, s.initializeAliyunCMS(), "failed to retrieve credential")
s.AccessKeyID = "my_access_key_id"
s.AccessKeySecret = "my_access_key_secret"
require.Equal(t, nil, s.initializeAliyunCMS())
}
func TestSampleConfig(t *testing.T) {
s := new(AliyunCMS)
require.Equal(t, sampleConfig, s.SampleConfig())
}
func TestDescription(t *testing.T) {
s := new(AliyunCMS)
require.Equal(t, description, s.Description())
}
| go |
<filename>pyprogress/writer.py
from typing import TextIO
def overwrite(stdout: TextIO, text: str) -> None:
"""Overwrite the current line by moving the cursor to the front.
"""
stdout.write('\r')
stdout.write(text)
stdout.flush()
| python |
According to recent reports, Warner Bros. merging with Discovery may spell disaster for AEW down the line.
The Discovery network finished merging with Warner Media earlier this year in April, creating a streaming media giant led by CEO David Zaslav. This is expected to result in major changes in how Discovery TV streams its shows and movies.
In a recent report by Wrestling Observer Newsletter, Dave Meltzer noted that new CEO David Zaslav is apparently going to be strict with budget cuts in the coming months. Although initially the budget cuts were expected to be around $3 million, it is now rumored to be around $4 million.
Despite AEW's mostly impressive ratings, the massive budget cuts may prove bad news for Tony Khan's brand. While Meltzer noted that the Jacksonville-based promotion is well within the budget, such an uncertain time may also put All Elite Wrestling in the streaming company's crosshairs.
As of now, fans will have to stay tuned to see how the situation unfolds in the coming weeks.
When Warner Media started merging with Discovery TV in April, veteran journalist Bill Apter shared an interesting opinion about the future of All Elite Wrestling.
In an appearance on Sportskeeda Wrestling's Top Story, Apter stated that everything depended on how much revenue the promotion could generate:
"Somewhat [getting affected by the merger]. If like what happened with WCW, is if the executives say that, 'this doesn't really fit our profile.' So, yeah, I mean something like that could happen. Although it's a ratings winner. They are making a lot of money on advertising so as long as AEW keeps making revenue for them, then the guys sitting in the office at Discovery who said 'we don't need wrestling on here,' somebody else is gonna show them the sheet with the money they're bringing in and that's where it's gonna go as far as I am concerned." (From 28:15 to 28:52)
With recent worrying reports of potential budget cuts, it remains to be seen whether Bill Apter's prediction will be proven true in the near future.
What are your thoughts on the Discovery and Warner Bros. merger? Sound off in the comments below.
| english |
१. विश्वास करनेवाला ।
२. विश्वासपात्र । जैसे—ईमानदार नौकर ।
३. सच्चा ।
४. दियानतदार । जो लेनदेन या व्यवहार में सच्चा हो ।
६. सत्य का पक्षपाती ।
Hindi Dictionary. Devnagari to roman Dictionary. हिन्दी भाषा का सबसे बड़ा शब्दकोष। देवनागरी और रोमन लिपि में। एक लाख शब्दों का संकलन। स्थानीय और सरल भाषा में व्याख्या।
Eemandar के पर्यायवाची:
Eemandar, Eemandar meaning in English. Eemandar in english. Eemandar in english language. What is meaning of Eemandar in English dictionary? Eemandar ka matalab english me kya hai (Eemandar का अंग्रेजी में मतलब ). Eemandar अंग्रेजी मे मीनिंग. English definition of Eemandar. English meaning of Eemandar. Eemandar का मतलब (मीनिंग) अंग्रेजी में जाने। Eemandar kaun hai? Eemandar kahan hai? Eemandar kya hai? Eemandar kaa arth.
Hindi to english dictionary(शब्दकोश).ईमानदार को अंग्रेजी में क्या कहते हैं.
इस श्रेणी से मिलते जुलते शब्द:
ये शब्द भी देखें:
synonyms of Eemandar in Hindi Eemandar ka Samanarthak kya hai? Eemandar Samanarthak, Eemandar synonyms in Hindi, Paryay of Eemandar, Eemandar ka Paryay, In “gkexams” you will find the word synonym of the Eemandar And along with the derivation of the word Eemandar is also given here for your enlightenment. Paryay and Samanarthak both reveal the same expressions. What is the synonym of Eemandar in Hindi?
| english |
What are the highest-scoring MLB games in history? Team Canada and Team Korea put on offensive explosions that could rival some of MLB's best ever. The Canadian team dominated Great Britain to the tune of a 18-8 run rule win while Korea scored an absurd 22 runs to China's two.
These were among the most impressive offensive explosions in recent memory. It's not often that a team wins by mercy rule when giving up eight runs, but that's what Canada did.
With two impressive offensive outpourings, where do they rank among the highest-scoring MLB games in history?
What are the highest-scoring MLB games in history?
Though Canada and Korea put on stunning WBC onslaughts that will surely give their opponents nightmares, it's not among baseball's highest-scoring games.
Long before hitters were this good and long before pitchers were as dominant, the year was 1922 and it holds the highest scoring MLB game in history.
The Philadelphia Phillies and Chicago Cubs made history that day that has not been repeated. The Cubs won 26-23 for one of the most unbelievable wins in MLB history.
The Cubs had a 25-6 lead and then led 26-9. However, the Phillies made a stunning comeback in the latter innings. They scored 14 runs in the eighth and ninth to nearly pull off an improbable comeback. They would have to settle to set records instead of a win.
In 1979, the two teams met again. They decided to try and outdo themselves for old times' sake. The Phillies won this time around, though. The final score was 23-22, so they didn't quite break the record.
Only once has a team ever broken 30 runs themselves and that was the Texas Rangers in 2007.
Top 5 players BANNED from the NBA for drug use! Shocking names ahead! | english |
'use strict';
var express = require('express');
var form = require('express-form');
var field = form.field;
var ubeacon = require('../ubeacon');
var validator = require('../lib/validators');
var router = new express.Router();
/* Set the correct header section */
router.use(function(req, res, next) {
console.log(req.body);
res.locals.headerSection = 'gateway_beacon';
next();
});
/* eslint-disable */
var validateForm = form(
field('advertisingState').trim().required().toBooleanStrict(),
field('advertisingInterval').trim().required().toInt().custom(function(val) { return validator.isInRange(val, 60, 10000); }),
field('uuid').trim().required().custom(function(val) { return validator.isValidUUID.call(validator, val); }),
field('major').trim().required().toInt().custom(function(val) { return validator.isUint16.call(validator, val); }),
field('minor').trim().required().toInt().custom(function(val) { return validator.isUint16.call(validator, val); }),
field('measuredStrength').trim().required().toInt().custom(function(val) { return validator.isInRange(val, -255, 0); }),
field('meshSettings.enabled').trim().required().toBooleanStrict(),
field('meshSettings.allow_non_auth_connections').trim().required().toBooleanStrict(),
field('meshSettings.always_connectable').trim().required().toBooleanStrict(),
field('meshSettings.enable_mesh_window').trim().required().toBooleanStrict(),
field('meshSettings.mesh_window_on_hour').trim().required().toInt().custom(function(val) { return validator.isInRange.call(validator, val, 0, 23); }),
field('meshSettings.mesh_window_duration').trim().required().toInt().custom(function(val) { return validator.isValidMutipleOfTen.call(validator, val, 0, 60); }),
field('meshNetworkUUID').trim().required().custom(validator.isValidUUID),
field('meshDeviceId').trim().required().toInt().custom(function(val) { return validator.isInRange.call(validator, val, 0x0001, 0x8000); })
);
/* eslint-enable */
// Check that the beacon is connected
router.use(function(req, res, next) {
if (ubeacon.serialPort.isOpen()) {
return next();
} else {
process.exit();
//return next(new Error('Beacon not connected'));
}
});
/* GET /configure-my-beacon page */
router.get('/', function(req, res, next) {
ubeacon.getData(function(err, beaconData) {
beaconData.serialPort = process.env.UART_SERIAL_PORT;
if (err != null) {
return next(err);
}
return res.render('beacon/index', { beaconData: beaconData });
});
});
/* POST /configure-my-beacon */
router.post('/', validateForm, function(req, res) {
if (!req.form.isValid) {
ubeacon.getData(function(err, beaconData) {
if (err != null) {
return next(err);
}
return res.render('beacon/index', {
beaconData: beaconData,
formErrors: req.form.getErrors()
});
});
} else {
ubeacon.updateData(req.form, function(err, newBeaconData) {
if (err != null) {
return next(err);
}
return res.render('beacon/index', { beaconData: newBeaconData });
});
}
});
module.exports = { path: '/gateway-beacon', router: router };
| javascript |
Adobe Lightroom is getting a few new editing features including its first new slider in years, Texture, which tweaks mid-sized objects while leaving fine-detailed ones alone. But the software is also getting in-app tutorials, a promising first foray in reeling in the greater user community.
The tutorials will appear in a new Home view, which also contains tutorial-lite “inspirational photos” and a user’s own recent photos. The UI reorganization combined with professional help seems like the first step toward creating a more social and communal space in Lightroom.
The above features aren’t coming to all platforms at once – they’re arriving on iOS and Android today and come to desktop at a later date. Mac and Windows users get their own UI tweak with a new help menu icon (a circled ‘?’) to search for tips along with six built-in tutorials for essentials to tide users over until the others are added.
But before we get into that, here are the new editing tools.
The big addition to editing is the new Texture slider, which is designed to help “accentuate or smooth” medium-sized details like skin or hair without tweaking very small ones, like pores or follicles. This lets users affect broad patches of area without affecting noise or warping any bokeh effect.
Best of all, it’s designed to work in coordination with other sliders like Clarity and Dehaze, allowing users to tweak one while leaving the others alone. Texture is coming to all Lightroom platforms.
Lightroom on desktop gets a new tool, Defringe, which helps eliminate purple or green fringes captured by lens chromatic aberrations, while the Android version finally gets batch editing and Lightroom Classic gets Flat-Field Correction as a native tool.
Lastly, desktop, mobile and ChromeOS users can now invite others to contribute photos to their albums. Best of all, they won’t need Lightroom subscriptions to add their images.
The Tutorials are a great addition to Lightroom users who want tips from skilled photographers in a step-by-step walkthrough. They won’t be uploaded to YouTube, sadly, but Adobe claims there are advantages to integrating them directly into the software (aka, only making them available to Lightroom subscribers).
Unlike videos illustrating only a single version of Lightroom, locked in time, adding tutorials in “programmatically” aka directly to the software code means they’re timeless: the instructions will always point to the right feature no matter where they’ve been rearranged or appear in different places between mobile, tablet and desktop versions. Plus, the text-based and code-level tutorials are far easier to translate into different languages.
Adobe is starting with a curated list of 60 videos done by professional photographers like Matt Kloskowski, Katrin Eismann, and Kristina Sherk, with more added “regularly.” All tutorials will be made available to Lightroom users at no extra charge.
"For the current criteria of selecting tutorial partners, we are prioritizing individuals that are both photographers AND educators. Folks that already have a strong track record of making high quality educational content, while covering a wide range of photographic subjects and editing styles," Adobe told TechRadar over email.
But in the future, Adobe plans to allow any user to upload their tutorials for other Lightroom users to see and enjoy. The company didn’t offer how it might change the UI to encourage watching and sharing tutorials, but it opens the door for some sort of auto-curation system (upvoting, etc) to surface more popular walkthroughs.
Nor did the company suggest how it might lure professionals, who are able to monetize their tutorials on other content-hosting platforms, over to this nascent and subscription-gated software. That could mean Adobe has plans to help creators monetize their tutorials (you’ll be able to share external links to click into them), but if they’ve got any ideas, the company isn’t sharing them.
Get the hottest deals available in your inbox plus news, reviews, opinion, analysis, deals and more from the TechRadar team.
David is now a mobile reporter at Cnet. Formerly Mobile Editor, US for TechRadar, he covered phones, tablets, and wearables. He still thinks the iPhone 4 is the best-looking smartphone ever made. He's most interested in technology, gaming and culture – and where they overlap and change our lives. His current beat explores how our on-the-go existence is affected by new gadgets, carrier coverage expansions, and corporate strategy shifts.
| english |
<reponame>rodrigowe1988/Ciandt
"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
exports.QueryFailedError = void 0;
const ObjectUtils_1 = require("../util/ObjectUtils");
const TypeORMError_1 = require("./TypeORMError");
/**
* Thrown when query execution has failed.
*/
class QueryFailedError extends TypeORMError_1.TypeORMError {
constructor(query, parameters, driverError) {
super(driverError
.toString()
.replace(/^error: /, "")
.replace(/^Error: /, "")
.replace(/^Request/, ""));
this.query = query;
this.parameters = parameters;
this.driverError = driverError;
if (driverError) {
const { name: _, // eslint-disable-line
...otherProperties } = driverError;
ObjectUtils_1.ObjectUtils.assign(this, {
...otherProperties,
});
}
}
}
exports.QueryFailedError = QueryFailedError;
//# sourceMappingURL=QueryFailedError.js.map
| javascript |
<filename>cache/src/main/java/org/tweetwallfx/cache/URLContent.java<gh_stars>1-10
/*
* The MIT License (MIT)
*
* Copyright (c) 2018-2022 TweetWallFX
*
* 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 org.tweetwallfx.cache;
import java.io.ByteArrayInputStream;
import java.io.ByteArrayOutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.Serializable;
import java.net.URL;
import java.security.DigestInputStream;
import java.security.MessageDigest;
import java.security.NoSuchAlgorithmException;
import org.apache.logging.log4j.LogManager;
import org.apache.logging.log4j.Logger;
import jakarta.xml.bind.DatatypeConverter;
import java.util.Arrays;
public record URLContent(
byte[] data,
String digest) implements Serializable {
private static final Logger LOG = LogManager.getLogger();
public URLContent(
final byte[] data,
final String digest) {
this.data = Arrays.copyOf(data, data.length);
this.digest = digest;
}
public static URLContent of(final InputStream in) throws IOException {
LOG.debug("Loading content from: {}", in);
InputStream in2 = in;
try {
in2 = new DigestInputStream(in, MessageDigest.getInstance("md5"));
} catch (NoSuchAlgorithmException ex) {
LOG.warn("Failed to create digest for {}", in, ex);
}
final byte[] d = readFully(in2);
final String digest = in2 instanceof DigestInputStream dis
? DatatypeConverter.printHexBinary(dis.getMessageDigest().digest())
: null;
LOG.info("MD5: {}", digest);
return new URLContent(d, digest);
}
public static URLContent of(final String urlString) throws IOException {
return of(new URL(urlString).openStream());
}
private static byte[] readFully(final InputStream in) throws IOException {
final ByteArrayOutputStream bout = new ByteArrayOutputStream();
final byte[] buffer = new byte[4096];
int read;
while ((read = in.read(buffer)) > -1) {
bout.write(buffer, 0, read);
}
return bout.toByteArray();
}
@Override
public byte[] data() {
return Arrays.copyOf(data, data.length);
}
public InputStream getInputStream() {
return new ByteArrayInputStream(data);
}
}
| java |
Using a complete scientific top quality management program, great high-quality and fantastic religion, we win great track record and occupied this area for Motion Sensor LED Batten Light Tube Replace for The Traditional Fluorescent Light, Using the everlasting aim of “continuous quality improvement, customer satisfaction”, we are sure that our item excellent is secure and responsible and our products and solutions are best-selling at your home and overseas.
Using a complete scientific top quality management program, great high-quality and fantastic religion, we win great track record and occupied this area for Led Batten, led batten light with motion sensor, Providing Quality Products, Excellent Service, Competitive Prices and Prompt Delivery. Our products are selling well both in domestic and foreign markets. Our company is trying to be one important suppliers in China.
Model No.
Model No.
- Supermark, shopping mall, retail;
- Factory, warehouse, parking lot;
- School, corridor, public building;
| english |
The video is a presentation on the Zoroastrian faith and the celebration of the Navroz festival all over India. The spring equinox marks the first day of the Zoroastrian calendar for the Parsi community. During Navroz the Parsi families clean and decorate their houses with rangolis (floor decorations) made of purifying lime and cleanse the house with loban (gum resin). They wear the traditional dress and visit the Parsi fire temple for prayers. People visit homes of their friends and neighbours on Navroz. The Haft-Seen table is laid out traditionally with seven kinds of food and families gather around the table to await the arrival of the New Year. The seven items on the Haft-Seen table include somaq (berries), sharab (wine), sheer (milk), seer (garlic), sirceh (vinegar), seb (apple) and shirini (sugar candy).
| english |
<filename>src/App/Config/actions.test.js<gh_stars>0
import { describe, it } from 'mocha';
import chai from 'chai';
import sinonChai from 'sinon-chai';
import {
CONFIG_LOAD,
loadConfig
} from './actions';
const { expect } = chai;
chai.use(sinonChai);
describe('Config actions', () => {
describe('loadConfig', () => {
it('returns a load config action', () => {
expect(loadConfig('foo'))
.to.eql({
type: CONFIG_LOAD,
config: 'foo'
});
});
});
});
| javascript |
---
layout: post
title: 锦集03-状态栏设置总结
category: iOS小知识
tags: iOS小知识
description: iOS小知识
---
## 说明：
1. 全局设置与局部设置的优先级问题；
1. `View controller-based status bar appearance `带表局部优先级
2. 当为YES 时， 局部优先级>全局优先级（系统默认）
3. 当为NO时，局部优先级无效，全局优先级大
2. 即要想全局设置状态栏，不管任何设置： `View controller-based status bar appearance` 必须为NO
3. 反之，要想局部设置状态栏，`View controller-based status bar appearance` 必须为YES
### Status Bar 状态栏的隐藏
1. 全局隐藏
1. 通过info.plist
1. 在 `Info.plist` 文件中添加 `Status bar is initially hidden` 设置为 `YES` ，这个是隐藏 App 在 LunchScreen（欢迎界面）时的状态栏。
2. 在 `Info.plist` 文件中添加 `View controller-based status bar appearance` 设置为 `NO`，这个是隐藏 App 在所有 `UIViewController` 时的状态栏。
2. 特别注意：
1. 当 `Status bar is initially hidden` 设置为 `NO` 的时候，不管 `View controller-based status bar appearance` 设置为 `NO` 还是 `YES` ，都是无效的，只有 `Status bar is initially hidden` 设置为 `YES` 的时候， `View controller-based status bar appearance` 才生效，这个要注意一下。
2. 通过代码实现状态栏的全局隐藏
1. 在 `Info.plist` 文件中添加 `View controller-based status bar appearance` 设置为 `NO` 。
2. 在 AppDelegate 文件中，实现下面方法（在其他 UIViewController 中也有效）：
```
/* OC */
[UIApplication sharedApplication].statusBarHidden = YES;
```
3. 特别注意：
1. 该方法只能隐藏 App 在所有 UIViewController 时的状态栏，不能隐藏在 LunchScreen（欢迎界面）时的状态栏。
2. 局部隐藏
1. 上面的方法是全局隐藏，是隐藏 App 在所有 UIViewController 时的状态栏，下面的方法是局部隐藏，是单个 UIViewController 内的隐藏。
2. 在 `Info.plist` 文件中添加 `View controller-based status bar appearance` 设置为 `YES` 。
3. 在需要隐藏状态栏的 UIViewController 文件中，加入下面方法：
```
/* OC */
- (BOOL)prefersStatusBarHidden {
return YES;
}
```
### 状态栏的样式
1. 状态栏分前后两部分，要分清这两个概念，后面会用到：
1. 文字部分：就是指的显示电池、时间等部分。
2. 背景部分：就是显示黑色或者图片的背景部分。
#### 设置 Status Bar 的【文字部分】
1. 简单来说，就是设置显示电池电量、时间、网络部分标示的颜色， 这里只能设置两种颜色：
```
/* 默认的黑色 */
UIStatusBarStyleDefault
/* 白色 */
UIStatusBarStyleLightContent
```
2. 全局设置（不管是否带导航栏）
1. 通过设置 Info.plist 文件全局设置状态栏的文字颜色
1. 在 `Info.plist` 文件中添加 `View controller-based status bar appearance` 设置为 NO 。
2. 在 Info.plist 里增加一行 `UIStatusBarStyle`（ `Status bar style` 也可以），这里可以设置两个值，就是上面提到那两个 `UIStatusBarStyleDefault` 和 `UIStatusBarStyleLightContent` 。
3. 在AppDelete中设置一句代码
```
application.statusBarHidden = NO;
```
2. 通过代码全局设置状态栏的文字颜色
1. 在 `Info.plist` 文件中添加 `View controller-based status bar appearance` 设置为 NO。
2. 在 AppDelegate 文件中，实现下面方法（在其他 UIViewController 中也有效）：
```
[UIApplication sharedApplication].statusBarHidden = NO;
[UIApplication sharedApplication].statusBarStyle = UIStatusBarStyleLightContent;
```
3. 局部设置（跟导航栏有关）
1. 控制器不带导航栏
1. 在 `Info.plist` 文件中添加 `View controller-based status bar appearance `设置为 YES。
2. 在需要设置状态栏颜色的 UIViewController 文件中，加入下面方法：
```
/* OC */
- (UIStatusBarStyle)preferredStatusBarStyle {
return UIStatusBarStyleLightContent;
}
```
2. 控制器带导航栏
1. UIViewController 在 UINavigationController 导航栏中时，上面方法没用， preferredStatusBarStyle 方法根本不会被调用，因为 UINavigationController 中也有 preferredStatusBarStyle 这个方法。
2. 解决办法有两个：（在满足第一步的条件下）
1. 方法一: 在需要设置的控制器的内部加一句代码，设置导航栏的 barStyle 属性会影响 status bar 的字体和背景色。如下。
```
/* 状态栏字体为白色，状态栏和导航栏背景为黑色 */
self.navigationController.navigationBar.barStyle = UIBarStyleBlack;
/* 状态栏字体为黑色，状态栏和导航栏背景为白色 */
self.navigationController.navigationBar.barStyle = UIBarStyleDefault;
```
2. 方法二: 自定义一个 UINavigationController 的子类，在这个子类中重写 preferredStatusBarStyle 这个方法，这样在 UIViewController 中就有效了，如下：
```
@implementation MyNavigationController
- (UIStatusBarStyle)preferredStatusBarStyle {
UIViewController *topVC = self.topViewController;
return [topVC preferredStatusBarStyle];
}
@end
```
3. 统一设置：把所有带导航栏的状态栏都设置为白色
```
UINavigationBar *bar = [UINavigationBar appearance];
bar.barStyle = UIBarStyleBlack;
```
#### 设置 Status Bar 的【背景部分】
1. 背景部分，简单来说，就是状态栏的背景颜色，其实系统状态栏的背景颜色一直是透明的状态，当有导航栏时，导航栏背景是什么颜色，状态栏就是什么颜色，没有导航栏时，状态栏背后的视图时什么颜色，它就是什么颜色。
```
/* 这个方法是设置导航栏背景颜色，状态栏也会随之变色 */
[self.navigationController.navigationBar setBarTintColor:[UIColor redColor]];
```
2. 如果想要单独设置状态栏颜色，可以添加以下方法来设置：
```
/**
设置状态栏背景颜色
@param color 设置颜色
*/
- (void)setStatusBarBackgroundColor:(UIColor *)color {
UIView *statusBar = [[[UIApplication sharedApplication] valueForKey:@"statusBarWindow"] valueForKey:@"statusBar"];
if ([statusBar respondsToSelector:@selector(setBackgroundColor:)]) {
statusBar.backgroundColor = color;
}
}
```
| markdown |
import axios from './axios.js'
let api = {
App_Version : '6.8',
// 拜访
YJ_GETVISITPRO: (data) => axios.postApiData(data , `${axios.kiyDomain}/webapi/Himall.Visit.GetItemList`),
YJ_GETVISITRES: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.Visit.UserInfo`),
YJ_GETVISITSUB: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.Visit.VisitAdd`),
YJ_GETVISITLIST: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.Visit.GetVisitList`),
// 会员审核
YJ_MemberAuditList: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.YJApp.GetReviewedUserList`),
YJ_GetFPAdminUserList: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.YJApp.GetFPAdminUserList`),
YJ_SaveAssignUsers: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.YJApp.SaveAssignUsers`),
YJ_SaveAuditMember: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.YJApp.SaveAuditMember`),
YJ_GetUserAddressInfo: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.YJApp.GetUserAddressInfo`),
YJ_GetWebMemberInfo: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.YJApp.GetWebMemberInfo`),
// 收货订单
YJ_GetVisitOrderList: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.VisitOrder.GetVisitOrderList`),
YJ_UpdOrderStatusByVisit: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.VisitOrder.UpdOrderStatusByVisit`),
YJ_ChangeOrderPrice: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.NewShop.ChangeOrderPrice`),
// 代客下单
YJ_GetProductByDetail: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.VisitOrder.GetProductByDetail`),
YJ_GetUserAddressByUserId: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.VisitOrder.GetUserAddressByUserId`),
YJ_JYAppSaveOrderInfo: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.VisitOrder.JYAppSaveOrderInfo`),
// 区域统计
YJ_GetQItemList: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.YJApp.GetQItemList`),
YJ_RegionSummaryList: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.YJApp.RegionSummaryList`),
// 自动报价
YJ_GetCaiLiaoList: (data) => axios.postApiData(data, `${axios.kiyDomain}/m-mobile/autobaojia/GetCaiLiaoList`),
YJ_OpenQuote: (data) => axios.postApiData(data, `${axios.kiyDomain}/m-mobile/autobaojia/OpenQuote`),
YJ_GETORDER : (data) => axios.getAjaxData(data , 'search' , 'YJApp_OrderInfo'),
YJ_ENTER : (data) => axios.getAjaxData(data , 'enterIn'),
YJ_SEARCH : (data) => axios.getAjaxData(data , 'search'),
YJ_SCAN : (data) => axios.getAjaxData(data , 'scanIn'),
YJ_LOGIN : (data) => axios.getAjaxData(data , 'login'),
YJ_errOrder: (data) => axios.getAjaxData(data, 'errOrder'),
YJ_WARHOURSCODE : (data) => axios.getAjaxData(data , 'search' , 'YJApp_GetWarhours'),
YJ_PAY : (data) => axios.getAjaxData(data, 'payMent'),
// 查看彩印通订单有没有物流单
YJ_GetOrder : (data) => axios.getAjaxData(data , 'search' , 'YJApp_GetOrder'),
YJ_PAYCHECK : (data) => axios.getAjaxData(data ,'search' , 'YJApp_IsPay'),
// 修i该用户资料
YJ_USERMANAGE : (data) => axios.getAjaxData(data, 'userManage' ),
// 财务记录
YJ_PAYMENTLIST: (data) => axios.getAjaxData(data, 'search', 'YJAPP_PaymentList'),
// 签到记录
YJ_GETDRIVINGRECORD: (data) => axios.getAjaxData(data, 'search', 'GetDriving_record'),
// 获取子单列表
YJ_ORDERLIST: (data) => axios.getAjaxData(data, 'search', 'YJApp_OrderList'),
// 收款汇总
Get_AdminStatistics: (data) => axios.getAjaxData(data, 'search', 'Get_AdminStatistics'),
// 获取子单物流状态
YJ_ORDERLISTSTATUS: (data) => axios.getAjaxData(data , undefined , 'QueryOrderRecordsList' , '217141a5-01d0-4696-9500-ae2d82a8cb4c'),
// 查彩印通订单
KIY_SEARCHORDER: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.NewShop.GetOrderInfo`),
//权限
get_access: (data) => axios.getAjaxData(data , 'search' , 'AppMenuAuthor' ),
get_accessBtn: (data) => axios.getAjaxData(data , 'search' , 'AppButtonBizAuthor' ),
// 获取发货单列表
get_fahuoList: (data) => axios.getAjaxData(data , 'search' , 'getFahuoList' ),
// 获取发货信息
get_fahuoInfo : (data) => axios.getAjaxData(data , 'search' , 'getFahuoInfo'),
// 发货单确认到货
YJ_enterFahuo: (data) => axios.getAjaxData(data , 'orderGroup' , '2'),
// 读取业务员
get_adminList: (data) => axios.getAjaxData(data, 'search', 'GetDeliveryList', '217141a5-01d0-4696-9500-ae2d82a8cb4c'),
// 读取城市经理
get_MemberManager: (data) => axios.getAjaxData(data, 'cSearch', 'YSH_MemberManagerInfo'),
// 产品列表
get_productsList: (data) => axios.getAjaxData(data, 'cSearch', 'QItems_YSH', '217141a5-01d0-4696-9500-ae2d82a8cb4c'),
// 区域统计
get_areaList: (data) => axios.getAjaxData(data , 'cSearch', 'OrderManager_YSH' ),
// 管理员或城市经理业绩统计
get_OrderSumManager_YSH: (data) => axios.getAjaxData(data,'cSearch' , 'OrderSumManager_YSH'),
// 业务员业绩统计
get_OrderSumManagerDeliver_YSH: (data) => axios.getAjaxData(data ,'cSearch' , 'OrderSumManagerDeliver_YSH'),
//业务员业绩统计查询
get_OrderManagerDetail_YSH: (data) => axios.getAjaxData(data ,'cSearch' , 'OrderManagerDetail_YSH'),
// 业绩排行
get_DayRise_YSH: (data) => axios.getAjaxData(data ,'DayRise'),
// 获取APP操作记录
Get_AppRecord: (data) => axios.getAjaxData(data , 'search' , 'Get_AppRecord'),
// getUncollectedOrder , getPaycollectOrder , getAllOrder 根据业务员Id获取已收款， 未收款 ， 所有订单
get_CollectedOrder: (data, methodName) => axios.getAjaxData(data, 'search', methodName),
// 物流后台业务员配送率
get_QueryDistributionRateList: (data) => axios.getAjaxData(data, 'search', 'QueryDistributionRateList', '217141a5-01d0-4696-9500-ae2d82a8cb4c'),
// 全部
get_QueryBusinessDistributionSummaryDetails: (data) => axios.getAjaxData(data, 'search', 'QueryBusinessDistributionSummaryDetailsListNew', '217141a5-01d0-4696-9500-ae2d82a8cb4c'),
// 物流后台业务员配送率详情（未收款）
get_QueryDistributionRateDetail: (data) => axios.getAjaxData(data, 'search', 'QueryBusinessDistributionSummaryDetailsList', '217141a5-01d0-4696-9500-ae2d82a8cb4c'),
// 首页数据统计
get_GetHomeData: (data) => axios.getAjaxData(data, 'search', 'GetHomeData'),
// 检查订单是否可以售后接口
get_IsOrderRefunds: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.OrderRefund.IsOrderRefunds`),
// 申请售后接口
get_OrderRefundRefundApply: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.OrderRefund.OrderRefundRefundApply`),
// 上传图片接口
get_kiyImageUrl: (data) => {return `${axios.kiyDomain}/common/PublicOperation/UploadPic`},
// 以下是缓存到store的参数
get_warhoursCode : (vm) => {return vm.$storage.getSync('warhoursCode')},
get_userInfo : (vm) => {return vm.$storage.getSync('userInfo')},
check_version: (data) => axios.postApiData(data, `${axios.YJdomain}/Global/HotUpdate/CheckUpdate?isDiff=1&appName=${data.appName}&${data.os}=${data.version}`),
// 上传头像
post_uploadHead: (data) => axios.postApiData(data, `${axios.YJdomain}/Global/HotUpdate/UpLoadHeadIcon?realName=${data.realName}`),
// 获取联络单列表
KIY_SEARCHCONTACT: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.Liaison.LiasionList`),
// 增加联络单
KIY_ADDCONTACT: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.Liaison.Add`),
// 处理联络单
KIY_HandleContact: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.Liaison.Confirm`),
// 获取部门
KIY_DEPARTMENTLIST: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.Liaison.DepartmentPartList`),
//转发部门
KIY_DepartmentTransmit: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.Liaison.Transmit`),
// 获取指派人员
KIY_GetAppointUser: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.Liaison.GetAppointUser`),
//指派人员
KIY_AppointUser: (data) => axios.postApiData(data, `${axios.kiyDomain}/webapi/Himall.Liaison.Appoint`),
// 请求其他
post: (options) => axios.postApiData(options.data, options.url , options.type ),
// 检测是不是数字
checkNumber : (theObj) => {
var reg = /^[0-9]+.?[0-9]*$/;
if (reg.test(theObj)) {
return true;
}
return false;
},
// 获取日期
get_date : (type , isOrder) => {
var startTime = ' 00:00:00'
var endTime = ' 23:59:59'
var nowdate = new Date();
var y = nowdate.getFullYear();
var m = padLeft(nowdate.getMonth() + 1);
var d = padLeft(nowdate.getDate());
var fornow = y + '-' + m + '-' + d;
var oneweekdate = new Date(nowdate - 7 * 24 * 3600 * 1000);
var y = oneweekdate.getFullYear();
var m = padLeft(oneweekdate.getMonth() + 1);
var d = padLeft(oneweekdate.getDate());
var forweek = y + '-' + m + '-' + d;
nowdate.setMonth(nowdate.getMonth() - 1);
var y = nowdate.getFullYear();
var m = padLeft(nowdate.getMonth() + 1);
var d = padLeft(nowdate.getDate());
var formonth = y + '-' + m + '-' + d;
var h = nowdate.getHours();
var m = nowdate.getMinutes();
var s = nowdate.getSeconds();
var forTime = h + ':' + m + ':' + s;
switch (type) {
case '今天':
var today = undefined;
if(!isOrder) {
today = {'@beginDate' : fornow + startTime , '@endDate' : fornow + endTime}
} else {
today = {'startTime' : fornow + startTime , 'endTime' : fornow + endTime}
}
return today
break;
case '一周内' :
var week = undefined
if(!isOrder) {
week = {'@beginDate' : forweek + startTime , '@endDate' : fornow + endTime}
} else {
week = {'startTime' : forweek + startTime , 'endTime' : fornow + endTime}
}
return week
break;
case '一月内' :
var month = undefined
if(!isOrder) {
month = {'@beginDate' : formonth + startTime , '@endDate' : fornow + endTime}
} else {
month = {'startTime' : formonth + startTime , 'startTime' : fornow + endTime}
}
return month
break;
case 'today' :
return fornow
break;
case 'week' :
return forweek
break;
case 'month' :
var nowdate = new Date();
var month=nowdate.getMonth()+1;
month =(month<10 ? "0"+month:month);
return month
break;
case 'year' :
return nowdate.getFullYear()
break;
case 'beginMonth':
const monthOne = fornow.split('-')
return monthOne[0] + '-' + monthOne[1] + '-' + '01'
default:
return {'@beginDate' : fornow , '@endDate' : fornow}
}
},
formatTime (date) {
const data = date.split('T')
return `${data[0]} ${data[1]}`
},
trim (str) {
return str.replace(/^\s+|\s+$/g, "")
}
}
function formatNumber(n) {
const str = n.toString()
return str[1] ? str : `0${str}`
}
function padLeft (str) {
var len = 2;
var char = '0';
if(typeof str != 'string'){
str = str.toString()
}
return str.length < len ? char + str : str
}
export default api
| javascript |
h1{
color: green;
font-size:30px;
text-align: center;
background-color: black
}
h2{
color: green;
font-size:20px;
text-align: left;
}
h3{
color: green;
}
h4{
color: green;
}
body{
background-color: red;
}
.intro{
font-style: italic;
color: purple;
}
#line1{
color: purple;
}
.important{
color: green;
font-style: italic;
}
img{
float: right;
width: 20%
}
.sidebar{
width: 100%;
float: left;
}
.text-box{
border: 2px solid maroon;
background-color: orange
}
| css |
<filename>README.md
# `bsoyka/.github`
This repository contains **community health files** for <NAME>'s GitHub
projects.
[][license]
## Files
| File | Description |
| :-----------------------------------------: | :--------------------------------------------- |
| **[`.github/CODEOWNERS`][codeowners]** | Settings for who owns code |
| **[`CODE_OF_CONDUCT.md`][code of conduct]** | Our community Code of Conduct |
| **[`FUNDING.yml`][funding]** | Settings for sponsoring our projects on GitHub |
| **[`SECURITY.md`][security]** | Our security policy |
[code of conduct]: https://github.com/bsoyka/.github/blob/main/CODE_OF_CONDUCT.md
[codeowners]: https://github.com/bsoyka/.github/blob/main/.github/CODEOWNERS
[funding]: https://github.com/bsoyka/.github/blob/main/FUNDING.yml
[license]: https://github.com/bsoyka/.github/blob/main/LICENSE
[security]: https://github.com/bsoyka/.github/blob/main/SECURITY.md
| markdown |
uucore_procs::main!(uu_yes);
| rust |
version https://git-lfs.github.com/spec/v1
oid sha256:c935523d834061476cfcba3c2b6fd1d69bb0965fb61c122a49df91a92271ff0d
size 958645
| json |
Girls’ Frontline is an online RPG gacha title developed by MICA team, featuring a turn-based strategy combat system. It features over 100 characters called Tactical Dolls (T-Dolls). T-Dolls are female androids who use weapons inspired by real-world firearms in battles. This gacha title features over 100 T-Dolls to choose from. You create an echelon comprising five units and deploy them to fight enemies.
T-Dolls come in varying rarities from two stars to five. You can upgrade each doll’s rarity with Neural Upgrade and ascend it to six stars. Additionally, they also possess upgradable abilities enabled by using experience points. That being said, this article ranks each Girls’ Frontline T-Dolls according to their battle prowess for August 2023.
All Girls’ Frontline T-Dolls ranked (August 2023)
Girls’ Frontline T-Dolls use one of these weapon types: Handgun, Assault rifle, Rifle, Machine gun, Submachine gun, and shotgun. You can obtain new characters from the in-game gacha mechanics that need materials such as Parts, Manpower, Ammo, and Rations. The summoning process in this mobile gacha title also requires a T-Doll contract for the character you want.
This article ranks every playable Girls’ Frontline T-Dolls and their weapon types under S, A, B, C, D, and F tiers according to their battle prowess. Like other gachas' tier lists, S-tier dolls dominate the current meta, whereas F-tier ones are the weakest.
They are the most potent Girls’ Frontline fighters that guarantee a winning result. With the following S-tier dolls in one’s roster, you need not worry about any enemy you face. You can comfortably beat them, so focus on upgrading these characters to achieve godly power in battles. Here is the tier list of S-tier T-Dolls in this strategy game:
Here, you will find Girls’ Frontline T-Dolls that develop winning results in most stages. Although less robust than S-tier ones, you can depend on them in clearing most stages. Pair them with S-tier characters and see the magic of your echelon. Here is the tier list of A-tier T-Dolls in this RPG title:
The ones included in this tier are average shooters. Upgrading them at every opportunity is the best strategy to get the best out of these T-Dolls in Girls’ Frontline. However, if you enter the mid-game stages, ensure you max out their level and perform Neural upgrades to make them more potent. Here is the tier list of B-tier T-Dolls in this turn-based strategy title:
These Girls’ Frontline characters are below-average fighters. They have more drawbacks than the few utilities they offer in battles. C-tier T-Dolls are helpful only in certain situations, and you must spend considerable resources to make them potent fighters. Here is the list of C-tier T-Dolls:
Use these T-Dolls in Girls’ Frontline only if you lack the ones that rank higher in this tier list. They are best suited for beginners to understand the gameplay and mechanics of this mobile action title. Here is the tier list of D-tier units in this free-to-play title:
The Girls’ Frontline dolls in this tier are the weakest in the current meta. They do not provide any utility in battles. Once you clear the early stages, obtain the dolls that rank higher and form your echelon with them. Below is the tier list of C-tier T-Dolls in this free-to-play-friendly gacha:
This Girls’ Frontline tier list provides a general overview of how T-Dolls rank according to their battle prowess in the current meta. It’s advisable to use the units you are comfortable with and suit your playstyle. Additionally, the tier list changes with every update the game receives. It might range from buffs and nerfs or the introduction of new ones in every update.
| english |
<gh_stars>0
html, body{
font-family: 'Open Sans', sans-serif;
font-size: 100%;
background-color: #FFF;
}
body a{
transition:0.5s all;
-webkit-transition:0.5s all;
-moz-transition:0.5s all;
-o-transition:0.5s all;
-ms-transition:0.5s all;
}
/*-----start-header----*/
.header{
background:#36B367;
}
.logo{
float: left;
margin-top: 0.25em;
}
.logo a{
color: #FFF;
font-weight: 700;
}
.logo a:hover{
text-decoration:none;
}
.logo320{
display:none;
}
/*----navbar-nav----*/
.top-header{
background: #36B367;
padding: 0.7em 1.5em;
margin: 3.5em 0 0 0;
/*box-shadow: 0px 0px 4px #C9C9C9;
-webkit-box-shadow: 0px 0px 4px #C9C9C9;
-moz-box-shadow: 0px 0px 4px #C9C9C9;
-o-box-shadow: 0px 0px 4px #C9C9C9;
-ms-box-shadow: 0px 0px 4px #C9C9C9;*/
}
.top-nav ul li a{
color: white;
padding: 0.2em 1.5em;
font-size: 0.9em;
font-weight: 400;
text-align: center;
text-transform: uppercase;
position: relative;
font-weight: 700;
}
.top-nav ul li.active a,
.top-nav ul li a:hover{
color:#282528;
}
.logo a{
display:block;
}
/* top-nav */
.top-nav:before,
.top-nav:after {
content: " ";
display: table;
}
.top-nav:after {
clear: both;
}
nav {
position: relative;
float: right;
}
nav ul {
padding: 0;
float: right;
margin: 0.75em 0;
}
nav li {
display: inline;
float: left;
position:relative;
}
nav a {
color: #fff;
display: inline-block;
text-align: center;
text-decoration: none;
line-height: 40px;
}
nav a:hover{
text-decoration:none;
color:#00A2C1;
}
nav a#pull {
display: none;
}
/*Styles for screen 600px and lower*/
@media screen and (max-width: 768px) {
nav {
height: auto;
float:none;
}
nav ul {
width: 100%;
display: block;
height: auto;
}
nav li {
width: 100%;
position: relative;
}
nav li a {
border-bottom: 1px solid #eee;
}
nav a {
text-align: left;
width: 100%;
}
}
/*Styles for screen 515px and lower*/
@media only screen and (max-width : 768px) {
nav {
border-bottom: 0;
float:none;
}
nav ul {
display: none;
height: auto;
margin:0;
background: #fff;
}
nav a#pull {
display: block;
position: relative;
color: #F26D7D;
text-align: right;
position: absolute;
top:12px;
}
nav a#pull:after {
content:"";
background: url('nav-icon.png') no-repeat;
width: 30px;
height: 30px;
display: inline-block;
position: absolute;
right: 15px;
top: 10px;
}
nav a#pull img{
margin-right:2%;
}
.top-nav ul li a {
color: #2C3E50;
padding: 0em 0;
}
}
/*Smartphone*/
@media only screen and (max-width : 320px) {
nav {
float:none;
}
nav li {
display: block;
float: none;
width: 100%;
}
nav li a {
border-bottom: 1px solid #EEE;
}
}
/*----slider----*/
#slider2,
#slider3 {
box-shadow: none;
-moz-box-shadow: none;
-webkit-box-shadow: none;
margin: 0 auto;
}
.rslides_tabs {
list-style: none;
padding: 0;
background: rgba(0,0,0,.25);
box-shadow: 0 0 1px rgba(255,255,255,.3), inset 0 0 5px rgba(0,0,0,1.0);
-moz-box-shadow: 0 0 1px rgba(255,255,255,.3), inset 0 0 5px rgba(0,0,0,1.0);
-webkit-box-shadow: 0 0 1px rgba(255,255,255,.3), inset 0 0 5px rgba(0,0,0,1.0);
font-size: 18px;
list-style: none;
margin: 0 auto 50px;
max-width: 540px;
padding: 10px 0;
text-align: center;
width: 100%;
}
.rslides_tabs li {
display: inline;
float: none;
margin-right: 1px;
}
.rslides_tabs a {
width: auto;
line-height: 20px;
padding: 9px 20px;
height: auto;
background: transparent;
display: inline;
}
.rslides_tabs li:first-child {
margin-left: 0;
}
.rslides_tabs .rslides_here a {
background: rgba(255,255,255,.1);
color: #fff;
font-weight: bold;
}
.events {
list-style: none;
}
.callbacks_container {
position: relative;
float: left;
width: 100%;
}
.callbacks {
position: relative;
list-style: none;
overflow: hidden;
width: 100%;
padding: 0;
margin: 0;
}
.callbacks li {
position: absolute;
width: 100%;
left: 0;
top: 0;
}
.callbacks img {
position: relative;
z-index: 1;
height: auto;
border: 0;
}
.callbacks .caption {
display: block;
position: absolute;
z-index: 2;
font-size: 20px;
text-shadow: none;
color: #fff;
left: 0;
right: 0;
padding: 10px 20px;
margin: 0;
max-width: none;
top: 10%;
text-align: center;
}
.callbacks_nav {
position: absolute;
-webkit-tap-highlight-color: rgba(0,0,0,0);
top: 52%;
left: 0;
opacity: 0.7;
z-index: 3;
text-indent: -9999px;
overflow: hidden;
text-decoration: none;
height: 61px;
width: 55px;
background: transparent url("../images/themes.png") no-repeat left top;
margin-top: -65px;
}
.callbacks_nav:active {
opacity: 1.0;
}
.callbacks_nav.next {
left: auto;
background-position: right top;
right: 0;
}
#slider3-pager a {
display: inline-block;
}
#slider3-pager span{
float: left;
}
#slider3-pager span{
width:100px;
height:15px;
background:#fff;
display:inline-block;
border-radius:30em;
opacity:0.6;
}
#slider3-pager .rslides_here a {
background: #FFF;
border-radius:30em;
opacity:1;
}
#slider3-pager a {
padding: 0;
}
#slider3-pager li{
display:inline-block;
}
.rslides {
position: relative;
list-style: none;
overflow: hidden;
width: 100%;
padding: 0;
margin: 0;
}
.rslides li {
-webkit-backface-visibility: hidden;
position: absolute;
display: none;
width: 100%;
left: 0;
top: 0;
}
.rslides li{
position: relative;
display: block;
float: left;
}
.rslides img {
height: auto;
border: 0;
width:100%;
}
.callbacks_tabs{
list-style: none;
position: absolute;
top: 88%;
z-index: 999;
left: 47%;
padding: 0;
margin: 0;
}
.callbacks_tabs li{
display:inline-block;
}
@media screen and (max-width: 600px) {
h1 {
font: 24px/50px "Helvetica Neue", Helvetica, Arial, sans-serif;
}
.callbacks_nav {
top: 47%;
}
}
/*----*/
.callbacks_tabs a{
visibility: hidden;
}
.callbacks_tabs a:after {
content: "\f111";
font-size:0;
font-family: FontAwesome;
visibility: visible;
display: block;
height:18px;
width:18px;
display:inline-block;
border:2px solid #FFF;
border-radius: 30px;
-webkit-border-radius: 30px;
-moz-border-radius: 30px;
-o-border-radius: 30px;
-ms-border-radius: 30px;
}
.callbacks_here a:after{
border:2px solid #282528;
}
.slide-text-info h1{
font-size: 2.3em;
font-family: 'Open Sans', sans-serif;
font-weight: 100;
color:#282528;
}
.slide-text-info h1 span{
font-weight:800;
}
.slide-text-info h2{
color:#282528;
padding:0;
margin:0.3em 0;
font-size:1.3em;
}
.slide-text-info{
margin: 2.5% 0;
text-align: left;
position: absolute;
left: 16%;
}
.slide-text p{
font-size: 0.872em;
width: 50%;
margin: 0 auto;
font-weight: 200;
line-height: 1.6em;
margin-bottom: 1em;
}
/*----*/
.btn1{
color:#FFF;
text-transform:uppercase;
}
/*----*/
.slide-text ul li span{
width:7px;
height:12px;
background:url(../images/arrow1.png) no-repeat 0px 0px;
display:inline-block;
margin-right:0.5em;
}
.slide-text ul li{
color: #282528;
font-size: 0.875em;
font-weight: 500;
margin: 0 0 0.3em;
}
/*----*/
.big-btns{
margin: 1.5em 2em;
display: block;
}
.big-btns a{
display: inline-block;
border: 3px solid #282528;
padding: 0.5em 1.2em 0.5em 0.8em;
font-size: 1em;
font-weight: 600;
color: #282528;
margin-right: 0.6em;
}
.big-btns a:hover{
text-decoration:none;
color:#282528;
opacity:0.9;
border-color:#FFF;
}
.big-btns a label{
width: 40px;
height: 34px;
background: url(../images/btn-icons.png) no-repeat 0px 0px;
display: inline-block;
vertical-align: middle;
margin-right:0.5em;
}
.big-btns a.download label{
background-position:0px 0px;
}
.big-btns a.view label{
background-position:-41px 0px;
}
.slide-text {
margin: 1.2em;
}
.divice-demo{
position: absolute;
bottom: 0px;
z-index: 999;
right: 0%;
}
.header-section{
position:relative;
}
/*----//slider----*/
/*-----features----*/
.section-head{
text-align:center;
padding:2em 0;
}
.section-head h3{
color:#282528;
font-weight:800;
font-size:1.6em;
}
.section-head h3 span{
width:10%;
background:#8A888A;
height:1px;
display:inline-block;
vertical-align:middle;
}
span.frist{
margin-right:1em;
}
span.second{
margin-left:1em;
}
.section-head p{
width: 95%;
margin: 3em auto 1.2em auto;
color: #282528;
line-height: 1.8em;
font-size: 1.1em;
}
/*----features-grids----*/
.features-grid-info{
margin:4em 0;
}
.features-icon span{
width:40px;
height:40px;
display:inline-block;
background:url(../images/feature-icons-l.png) no-repeat 0px 0px;
margin-top:1em;
}
.features-icon span.f-icon1{
background-position: 0px -200px;
}
.features-icon span.f-icon2{
background-position: 0px -405px;
}
.features-info h4{
font-weight:700;
color:#282528;
}
.features-info p{
color:#282528;
font-size:0.875em;
line-height:1.8em;
}
.features-icon1{
background-position:0px 0px;
}
/*----*/
.features-icon1 span{
width:40px;
height:40px;
display:inline-block;
background:url(../images/feature-icons-r.png) no-repeat -13px 0px;
margin-top:1em;
}
.features-icon1 span.f-icon4{
background-position: -13px -200px;
}
.features-icon1 span.f-icon5{
background-position: -13px -405px;
}
/*----screen-shot-gallery----*/
.screen-shot-gallery{
background:#FAFAFA;
padding:3em 0;
}
/*-----*/
.show-reel{
background:#36B367;
margin:2em 0 0;
}
.show-reel h5 span{
width:37px;
height:43px;
display:inline-block;
background:url(../images/play-btn.png) no-repeat 0px 0px;
vertical-align:middle;
}
.show-reel h5 span:hover{
opacity:0.8;
}
.show-reel h5{
font-size: 2em;
font-weight: 100;
letter-spacing: 0.5em;
padding: 6em 0;
}
/*--- team ---*/
.team{
background: #F5F5F5;
padding: 2em 0 5em;
}
.team-member-info{
position:relative;
}
.team-member-info label{
display: none;
position: absolute;
top: 0px;
width: 100%;
min-height: 255px;
background: #36B367;
padding: 2em 1em;
}
.team-member-info:hover label.team-member-caption{
display:block;
}
.team-member-info img.member-pic{
width:100%;
}
.team-member-info h5{
margin:0.8em 0 0;
padding:0;
}
.team-member-info span{
color: #A2A4A7;
font-size: 0.875em;
}
.team-member-info h5 a{
color:#282528;
font-size:1.4em;
font-weight:600;
}
.team-member-caption p{
font-size:0.875em;
text-align:center;
color:#444144;
}
/*----team-member-caption----*/
.team-member-caption ul li{
display:inline-block;
}
.team-member-caption ul li a span{
width:40px;
height:40px;
display:inline-block;
background:url(../images/team-social.png) no-repeat 0px 0px;
}
.team-member-caption ul{
margin:2em 0 0 0;
padding:0;
}
.team-member-caption ul li a.t-twitter span{
background-position:0px 0px;
}
.team-member-caption ul li a.t-facebook span{
background-position: -48px 0px;
}
.team-member-caption ul li a.t-googleplus span{
background-position: -91px 0px;
}
/*----*/
.item p{
font-size:1.1em;
line-height:1.6em;
margin:2em 0;
color:#282528;
}
.test-monials{
padding:5em 0;
}
.quit-people img{
border-radius:30em;
-webkit-border-radius:30em;
-moz-border-radius:30em;
-o-border-radius:30em;
-ms-border-radius:30em;
border:3px solid #36B367;
}
.quit-people{
margin-bottom:1em;
}
.quit-people h4{
margin:0.5em 0 0.3em 0;
padding:0;
}
.quit-people h4 a{
color:#282528;
font-weight:600;
}
.quit-people span{
color:#282528;
font-size:0.875em;
}
/*--- //team ---*/
/*---- featured -----*/
.featured{
background:#36B367;
padding:2em 0 10em;
}
.featured h3{
margin-bottom:3em;
}
/*---- //featured -----*/
/*--- getintouch -----*/
.contact-form h3{
color:#282528;
font-size:1.2em;
font-weight:600;
margin:1em 0;
}
.contact-form input[type="text"],.contact-form textarea{
width: 100%;
border-right: none;
border-left: none;
border-top: none;
border-bottom: 2px ridge #DBDBDB;
outline: none;
padding: 2em 0 2em 0;
font-size: 0.9em;
}
.contact-form textarea{
height:130px;
outline:none;
border-bottom: 1px ridge #DBDBDB;
resize:none;
}
.contact-form input[type="submit"]{
background: url(../images/msg-icon.png) no-repeat 0px 0px;
height: 23px;
width: 167px;
display: block;
outline: none;
text-indent: 30px;
border: none;
margin: 1em 0;
transition:0.5s all;
-webkit-transition:0.5s all;
-moz-transition:0.5s all;
-o-transition:0.5s all;
-ms-transition:0.5s all;
}
.contact-form input[type="submit"]:hover{
opacity:0.9;
color:#999;
}
/*----*/
.footer-social-icons{
margin:0;padding:0;
}
.footer-social-icons{
margin-top:1.5em;
}
.footer-social-icons li{
list-style: none;
padding: 1em 0;
}
.footer-social-icons li a span{
width:27px;
height:27px;
display:inline-block;
background:url(../images/social-icons.png) no-repeat 0px 0px;
}
.footer-social-icons li a:hover{
opacity:0.8;
}
.footer-social-icons li a.f-tw span{
background-position:0px -40px;
}
.footer-social-icons li a.f-db span{
background-position: 0px -83px;
}
.footer-social-icons li a.f-ti span{
background-position: 0px -128px;
}
.footer-social-icons li a.f-go span{
background-position: 0px -171px;
}
.getintouch {
border-bottom: 10px solid #36B367;
padding: 2em 0 0 0;
}
/*--- //getintouch -----*/
/*-----footer----*/
.footer-grid p{
font-size:0.875em;
line-height:1.8em;
}
.footer-grid h3{
font-size:1.2em;
font-weight:600;
color:#282528;
}
.subscribe input[type="text"]{
border: none;
outline: none;
position: relative;
padding: 0.6em 0.6em;
}
.subscribe input[type="submit"]{
width: 18px;
height: 13px;
display: inline-block;
background: url(../images/arrow-2.png) no-repeat 0px 0px;
border: none;
outline: none;
position: absolute;
right: 10px;
top: 38%;
}
.subscribe form{
border: 1px solid #CCCCCC;
height: 43px;
position: relative;
margin: 1.3em 0;
}
.explore ul{
margin:0;
padding:0;
}
.explore li{
list-style:none;
}
.explore li a{
font-size:0.875em;
line-height:1.8em;
}
.explore li a:hover{
text-decoration:none;
color:#999;
}
.copy-right{
margin-top:3em;
}
p.copy{
font-weight:600;
}
p.copy a:hover{
color:#999;
text-decoration:none;
}
.footer-grids{
padding:2em 0;
}
#toTop {
display: none;
text-decoration: none;
position: fixed;
bottom: 26px;
right: 3%;
overflow: hidden;
width: 40px;
height: 40px;
border: none;
text-indent: 100%;
background: url("../images/to-top1.png") no-repeat 0px 0px;
border-radius: 30em;
}
#toTopHover {
width: 40px;
height: 40px;
display: block;
overflow: hidden;
float: right;
opacity: 0;
-moz-opacity: 0;
filter: alpha(opacity=0);
}
/*--responsive design--*/
@media (max-width:1280px){
.divice-demo img{
width:80%;
}
.slide-text-info {
margin: 0% 0;
left: 8%;
}
.divice-demo{
right:0;
}
.big-divice img{
width:100%;
}
.team-member-info label {
min-height: 125px;
padding: 0.9em 1em;
}
.footer-divice img{
width:100%;
}
.footer-divice{
margin-top:15em;
}
.slide-text-info h1 {
font-size:1.8em;
}
.slide-text-info h2 {
font-size: 1em;
}
.slide-text ul li {
font-size: 0.8125em;
}
.big-btns a {
border: 2px solid #282528;
padding: 0.2em 1.2em 0.2em 0.5em;
font-size: 0.85em;
}
.top-header {
margin: 2.5em 0 0 0;
}
.show-reel h5 {
padding: 4em 0;
}
}
@media (max-width:920px){
.top-nav ul li a {
padding: 0.2em 1em;
}
.divice-demo img {
width: 60%;
}
.slide-text-info h1 {
font-size: 1.5em;
}
.slide-text-info h2 {
font-size: 0.95em;
}
.slide-text ul li {
font-size: 14px;
}
.big-divice{
text-align:center;
}
.big-divice img {
width: 30%;
display:inline-block;
}
.features-grid-info {
margin: 0em 0;
}
.show-reel h5 {
padding: 2em 0;
font-size:1.5em;
}
.col-md-3.team-member {
width:50%;
float: left;
}
.team-member-info label {
height:86%;
}
.callbacks_tabs {
left: 44%;
}
}
/*-----768px-mediaquries----*/
@media (max-width:768px){
.divice-demo img{
width: 40%;
}
.slide-text-info {
margin: -2% 0 0;
left: 10%;
}
.divice-demo{
right: 5%;
text-align: right;
}
.team-member-info label {
min-height: 125px;
padding:2em;
top:0;
}
.footer-divice img{
width: initial;
}
.footer-divice{
margin-top:1em;
text-align: center;
}
.slide-text-info h1 {
font-size: 1.5em;
}
.slide-text-info h2 {
font-size: 0.9em;
}
.slide-text {
margin: 0.5em 0;
}
.slide-text ul li{
font-size:0.8em;
}
.slide-text ul li:nth-child(2){
display:none;
}
.big-btns a {
border: 2px solid #282528;
padding: 0.3em 0.8em 0.1em 0.8em;
font-size: 13px;
}
.callbacks_tabs a:after {
height: 10px;
width: 10px;
}
.top-header {
margin: 2.5em 0 0 0;
}
.section-head h3 {
font-size: 1.4em;
margin: 0;
}
.section-head p {
width: 80%;
margin: 1em auto 0.8em auto;
font-size: 0.875em;
}
.features-grid-info {
margin: 0em 0;
}
.team-member{
margin-bottom:1em;
}
.footer-social-icons li {
list-style: none;
padding: 1em;
display: inline-block;
}
.top-header {
background: #36B367;
padding: 0.3em 1.5em;
}
.footer-divice img {
width: 25%;
}
}
/*-----640px-mediaquries----*/
@media (max-width:640px){
.divice-demo img{
width: 47%;
}
.slide-text-info {
margin: -4% 0 0;
left: 10%;
}
.divice-demo{
right: 5%;
text-align: right;
}
.team-member-info label {
min-height: 125px;
padding:2em;
top:0;
}
.footer-divice{
margin-top:1em;
text-align: center;
}
.slide-text-info h1 {
font-size: 1.5em;
margin: 0.5em 0;
}
.slide-text-info h2 {
font-size: 0.9em;
}
.slide-text {
margin: 0.5em 0;
}
.slide-text ul li{
font-size:0.5em;
}
.slide-text ul li:nth-child(2){
display:none;
}
.big-btns a {
border: 1px solid #282528;
padding: 0.3em 0.8em;
font-size: 0.8em;
}
.callbacks_tabs a:after {
height: 10px;
width: 10px;
}
.top-header {
margin: 2em 0 0 0;
padding: 0em 1em;
}
.section-head h3 {
font-size: 1.4em;
margin: 0;
}
.section-head p {
width: 80%;
margin: 1em auto 0.8em auto;
font-size: 0.875em;
}
.features-grid-info {
margin: 0em 0;
}
.team-member{
margin-bottom:1em;
}
.footer-social-icons li {
list-style: none;
padding: 1em;
display: inline-block;
}
.big-btns {
margin: 0.8em 0em;
display: block;
}
.show-reel h5 {
padding: 3em 0;
font-size:1.8em;
}
}
/*-----480px-mediaquries----*/
@media (max-width:480px){
.divice-demo img{
width: 35%;
}
.slide-text-info {
margin: -6% 0 0;
left: 6%;
}
.divice-demo{
right: 4%;
text-align:right;
}
.big-divice img{
width:initial;
}
.team-member-info label {
min-height: 125px;
padding:2em;
top:0;
}
.footer-divice img{
width: initial;
}
.footer-divice{
margin-top:1em;
text-align: center;
}
.slide-text-info h1 {
font-size: 1.2em;
margin: 0.0em 0;
}
.slide-text-info h2 {
font-size: 0.8em;
margin:0;
}
.slide-text {
margin: 0.5em 0;
}
.slide-text ul li{
font-size: 0.5em;
}
.slide-text ul li:nth-child(2){
display:none;
}
.big-btns a {
border: 1px solid #282528;
padding: 0.5em 0.8em;
font-size: 0.7em;
}
.callbacks_tabs a:after {
height: 10px;
width: 10px;
}
.top-header {
margin: 1.4em 0 0 0;
padding: 0em 1em;
}
.section-head h3 {
font-size: 1.2em;
margin: 0;
}
.section-head p {
width: 90%;
margin: 0.8em auto 0em auto;
font-size: 0.875em;
}
.features-grid-info {
margin: 0em 0;
}
.team-member{
margin-bottom:1em;
}
.footer-social-icons li {
list-style: none;
padding: 1em;
display: inline-block;
}
.big-btns {
margin: 0.5em 0em;
display: block;
}
.show-reel h5 {
padding: 3em 0;
font-size:1.8em;
}
.subscribe input[type="text"] {
width: 100%;
}
.item p {
font-size: 0.875em;
}
.big-btns a label {
display: none;
}
.callbacks_tabs {
top: 83%;
left: 51%;
}
}
/*-----320px-mediaquries----*/
@media (max-width:320px){
.divice-demo img{
width: 30%;
}
.slide-text-info {
margin: -6% 0 0;
left: 6%;
}
.divice-demo{
right: 4%;
text-align:right;
}
.big-divice img{
width:35%;
}
.team-member-info label {
min-height: 125px;
padding:2.2em;
top:0;
}
.footer-divice img {
width: 45%;
}
.footer-divice{
margin-top:1em;
text-align: center;
}
.slide-text-info h1 {
font-size: 1em;
margin: 0.0em 0;
line-height:1.8em;
}
.slide-text-info h2 {
font-size: 0.7em;
margin: 0;
width: 55%;
line-height: 1.5em;
}
.slide-text {
margin: 0.5em 0;
}
.slide-text ul li{
font-size: 0.7em;
}
.slide-text ul li:nth-child(2){
display:none;
}
.big-btns a {
border: 1px solid #282528;
padding: 0.4em 0.5em;
font-size: 0.6em;
}
.callbacks_tabs a:after {
height: 10px;
width: 10px;
}
.top-header {
margin: 1.4em 0 0 0;
padding: 0em 1em;
}
.section-head h3 {
font-size: 1em;
margin: 0;
}
.section-head p {
width: 90%;
margin: 0.8em auto 0em auto;
font-size: 0.875em;
}
.features-grid-info {
margin: 0em 0;
}
.team-member{
margin-bottom:1em;
}
.footer-social-icons li {
list-style: none;
padding: 1em;
display: inline-block;
}
.big-btns {
margin: 0em 0em;
display: block;
}
.show-reel h5 {
padding: 2em 0;
font-size: 1.2em;
}
.subscribe input[type="text"] {
width: 100%;
}
.item p {
font-size: 0.875em;
}
.big-btns a label {
display: none;
}
.callbacks_tabs {
top: 95%;
left: 4%;
}
.header-section {
padding: 0 0 2em 0;
background:#36B367;
}
.slide-text ul{
display:none;
}
.screen-shot-gallery {
padding: 0em 0;
}
.featured {
padding: 0em 0 2em;
}
.team {
padding: 0em 0 2em;
}
.test-monials {
padding: 2em 0;
}
.getintouch {
padding: 0em 0 0 0;
}
.logo img{
width:80%;
}
nav a#pull {
top: 5px;
}
.container{
padding:0px 10px;
}
.col-md-4, .col-md-3{
padding:0;
}
.show-reel h5 {
padding: 1em 0;
font-size: 1em;
}
.col-md-3.team-member {
width: 100%;
float: none;
}
.team-member-info label {
height: 84%;
}
} | css |
The vast majority of Free Fire players are well aware of the importance of diamonds in the game. Several elements, including altering the in-game name, purchasing the Elite Pass, and unlocking new characters, are only available with premium currency.
As a result, diamonds hold great value, and most players desire to acquire them. However, because they require the expenditure of actual money, acquiring the currency is out of the reach of a segment of the playerbase.
Consequently, these players explore other methods of obtaining Free Fire diamonds for free.
3 ways players can obtain free diamonds in Free Fire (November 2021)
Many YouTubers host custom rooms, and players can go ahead and participate in them. This is one of the easier methods through which individuals can get their hands on Free Fire diamonds or other incentives.
It is essential for players to keep in mind that rewards are not guaranteed. Nonetheless, taking part is still a viable option.
The BOOYAH app offers a plethora of unique events that award items such as gift cards, emotes, and other incentives to participants. Some of them even incorporate diamonds, making this app a fantastic choice for gamers.
Players should keep in mind that they must link their Free Fire account to this application to get the rewards.
The Google Opinion Rewards app is the best option for players looking to earn free diamonds,. Users essentially get rewarded with Google Play Credits in exchange for participating in surveys.
Individuals can proceed with purchasing diamonds in Free Fire after they have collected a certain quantity of credits. Gamers may also save them and purchase super airdrops which offer a higher value.
Apart from these, users are recommended to avoid using illicit tools like unlimited diamond generators. These are mostly fake and using them will likely result in a ban.
Check out the latest Free Fire MAX redeem codes here. | english |
Second seed International Master P Magesh Chandran rode on luck to end the dream run of Iranian Akbarnia Ahmed Saeed and emerge joint leader on 4.5 points after the sixth round in the 26th Asian Junior chess championship in Negombo, Sri Lanka, on Wednesday.
An Indian sweep appears very much in the offing after other overnight leaders decided against taking any big risks and settled for draws among themselves.
The lead is now shared by defending champion Deepan Chakravarthy, Abhijit Gupta, Deep Sengupta, Akshayraj Kore and Magesh Chandran.
As many as six players, including India's Prathamesh Mokal, G Rohit and S Poobesh Anand, are just half a point adrift of the leaders and very much in contention with five more rounds remaining in this 11-round competition.
In the girls' section, Kolkata's Saheli Nath joined Y Pratibha in the lead with a clinical victory over compatriot Mahima Rajmohan. Both Saheli and Pratibha have five points from six games and are followed by Luong Phong Hanh of Vietnam and defending champion Tania Sachdev on 4.5 points each.
In the sixth round, Pratibha played it safe against Hanh while Tania too was involved in a deadlock against Kruttika Nadig.
A great escape by Magesh enabled him to join the leaders. Playing against the darkhorse of the event, Akbarania Syed, Magesh left his king exposed and was saddled with a defensive position for a long time.
The Iranian struck with a piece sacrifice to quickly end the game but Magesh was quite up to the task in defending. He hung on to the position and snatched the crucial full point.
The Kruttika-Tania match turned out to be a violent affair with the Pune girl throwing everything at the defending champion in a Sicilan game. But, defense being her forte, Tania hung on grimly, snatching a difficult draw in 63 moves.
The game stretched to the full distance and had spectators on their toes for a large part of the game.
The talk of the tournament was the shocking slide of WIM Dronvalli Harika as she lost her third game in six rounds today. Harika went down to the Philipino girl Kathryn Ann Cruz in 62 moves despite holding advantage in the middle game.
Results Round 6 (Indians unless specified):
Boys: Abhijit Gupta (4.5) drew Deepan Chakkravarthy ( 4.5); Deep Sengupta (4.5) drew Akshayraj Kore (4.5); Akbarnia Seyed Arash (4, Iri) lost to P Magesh Chandran (4.5); Nguyen Ngoc Truong Son (4, Vie) drew S Poobesh Anand (4); G Rohit (4) drew Khamzim Olzhas (4, Kaz); Chan Tze Wei (3, Vie) lost to Prathmesh Mokal (4); D D Wijesinghe (3.5) drew D R N K B Dehigama (3.5, SL); S Arun Prasad (3.5) beat Chandrasiri Thilina (3, SL); M K Russell (2.5, SL) lost to Hoang Canh Huan (3.5, Vie); I T Palawatta (3.5, SL) beat Sunther Kumar (2.5, SL).
Girls: Y Prathiba (5.0) drew Luong Phong Hanh (4.5, Vie); Kruttika Nadig (4.0) drew Tania Sachdev (4.5); Saheli Nath (5) beat Rajmohan Mahima (3.5); Donavalli Harika (3) lost to Kathryn Ann Cruz (4, Phi); Yasoda U G Methmali (3, SL) lost to Mary Ann Gomes (4); H Nilavoli (4) beat D M P Maheshika (3, SL); J Rajasurya (4) beat L Ayodya (2.5, SL); J E Kavitha (3.5) beat Konara Harshani (2.5, SL); Dissanayaka Rushani (2, SL) lost to N Vinuthna (3); B D Umesha (2, SL) lost to Wettasighe Samanthi (3, SL).
| english |
When a big news event is unfolding quickly, it can difficult to keep track of the latest news updates. Here we take a look at ways to keep on top of breaking news, and to cover it yourself.
Well, it has to be in here, doesn’t it? Many people look to Twitter for breaking news now, and there’s lots of it to be found. People often follow hashtags associated with news they’re interested in, but the search results for these tags can sometimes be far too busy to keep up with. Then there’s the problem we noted recently of how difficult it is to tell exactly what is true and what isn’t.
The best ways to circumvent these problems are, firstly, to make a List of the people you trust most in that given situation – are there any journalists on the ground, covering it in real-time? How about individuals who clearly are on the scene or can speak with authority. Paying particular attention to that list during the nven twill help filter out the noise and increase the likelihood that you’re receiving accurate information.
Additionally, avoiding retweeting juicy rumours without verifying them is a must. Just because it sounds plausible doesn’t make it true. Check a trusted source before you pass it on, helping to spread misinformation. The only problem here is that trusted sources can make mistakes too.
Breaking news websites are becoming a genre to themselves online, specialising in getting reports out with speed and accuracy. Breaking News monitors events around the world, publishing new events on its homepage as they occur and giving major developing stories their own pages, curated by editors where credible reports are pulled in from around the Web. Sources include published news reports and tweets.
The MSNBC-owned site employs full-time editors but also takes tips from the public via the Spot It feature. In addition to its website, it offers apps for iPhone, Android and Windows Phone 7, plus the popular Breaking News Twitter account.
Storyful takes a similar approach to Breaking News, but its service offers pictures and video directly in the stream. It employs a full-time team of curators, tracking breaking news events and sourcing accurate reports. However, it also offers a tool that allows you to create your own curated news stories, pulling in tweets, links, images and videos to tell the story as it happens.
Storyful partners with global news organisations, allowing them to publish these curated stories on their own sites. (UPDATE: Storyful has clarified its relationship with third-party news organisations, stating that rather than publish the Storyful stories as-is on their sites, “Our news clients/partners use breaking news content that we verify + get access information for. All happens on private @StoryfulPro channel”.)
Some sites exist as tools for others to use to pull together news stories, without actually generating any content in-house. Storify is a good example of this. Used by journalists and non-journalists alike, it’s almost approaching a blogging platform focuses on curation, with the ability to add text, tweets, images, videos, links and more, creating a multimedia story to share with others via a link, or embed on your own website.
A partnership with Breaking News was announced this week, adding that site as an additional source for users to pull from. A button under every link on the Breaking News site now allows you to send it straight to a new or existing Storify story.
UK-based site Blottr is making a growing name for itself by being fast to cover breaking news stories in Britain. As we’ve previously reported, it allows anyone to cover a story as it breaks via the Web or via its Paparappzi iPhone app.. It’s also offering up its platform to third-party organisations, and in some cases will pay contributors.
Blottr takes a wiki-style approach to news coverage, allowing anyone to not only create a new story, but to edit an exiting one too, adding more information, images or videos.
If you want to do the news breaking yourself, another option is Meporter. This mobile app for iPhone (Android and BlackBerry coming soon) allows you to post a story from wherever you are, including a photo or video. This can then be shared online via Twitter and Facebook, and via the app itself. A Newswise tab, allows you to explore recent stories via pins on a map.
The quality and quantity of the news you find will depend on what usage is like in your area, but it’s worth a look to see what others are sharing nearby. (Thanks to Louise Bolotin).
Are there any we’ve missed? Leave a comment and let us know.
Get the most important tech news in your inbox each week.
| english |
<reponame>n-romanova/archiving
<!DOCTYPE html>
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<title>East London Theatre Archive</title>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0, maximum-scale=1.0, user-scalable=no" />
<link rel="stylesheet" type="text/css" href="https://kdl.kcl.ac.uk/sla-archiving/css/decommission.css">
</head>
<body>
<div class="note-wrapper">
<input type="checkbox" class="readmore-state" id="readmore" />
<p>This site has been archived as part of <a href="https://www.kdl.kcl.ac.uk">King's Digital Lab</a> (KDL) archiving and sustainability process, following background analysis and consultation with research leads wherever possible. </p>
<p>Project content and data has been stored as a fully backed-up Virtual Machine and can be made available on request (depending on access controls agreed with the Principal Investigator) for a period of at least 2 years from the decommissioning date indicated below.
</p>
<p>If you have an interest in this project and would like to support a future phase please contact us by filling in this <a href="https://www.kdl.kcl.ac.uk/report-issue/">form</a>.</p>
<div class="note">
<p class="readmore-target">At its inception, KDL inherited just under 100 digital research projects and websites. Aware of the intellectual and cultural value of many of these projects, with the support of the Faculty of Arts and Humanities at King’s College London, KDL took on its responsibility to the community to steward them in a responsible manner. When the options of setting up a <a href="https://www.kdl.kcl.ac.uk/how-we-work/why-work-us/">Service Level Agreement </a> for further hosting and maintenance with KDL and/or undertaking migration to IT Services at King’s or other institutions were deemed infeasible or inappropriate, the archiving process was initiated.</p>
<p class="readmore-target">We would like to thank research leads, the Faculty of Arts and Humanities at King’s College London, and partner institutions, for their support in this process.
</p>
<p class="readmore-target">For further information on KDL archiving and sustainability process see:</p>
<ul class="readmore-target">
<li><NAME>., <NAME>., & <NAME>. (2017). <a href="http://jamessmithies.org/blog/2017/06/23/preserving-30-years-digital-humanities-work-experience-kings-digital-lab/">Preserving 30 years of Digital Humanities Work: The Experience of King’s College London Digital Lab.</a> Presented at the DPASSH: Digital Preservation for Social Sciences and Humanities, University of Sussex.
</li>
<li><NAME>., <NAME>, <NAME>, <NAME>, <NAME>, <NAME>, <NAME>, <NAME>, <NAME>, <NAME>, <NAME>. (2017). <a href="http://jamessmithies.org/blog/2017/08/17/mechanizing-humanities-kings-digital-lab-critical-experiment/">Mechanizing the Humanities? King’s Digital Lab as Critical Experiment.</a> Presented at the DH2017, McGill University, Montreal.
</li>
</ul>
</div>
<label for="readmore" class="readmore-trigger"></label>
</div>
<br>
<p><strong>The ELTA website and its digitised theatre collections are currently not available. The University of East London is actively pursuing options for making these available again in the near future. In the meantime, if you have any questions please email <a href="mailto:<EMAIL>"><EMAIL></a>. We apologise for any inconvenience this may cause.</strong></p>
<h5>Project name</h5>
<h1>East London Theatre Archive</h1>
<h5>Date of project activity</h5>
<p>2007 - 2009</p>
<h5>Project principal investigator(s)</h5>
<p><NAME>; <NAME></p>
<h5>Decommission Date</h5>
<p>July 2018</p>
<h5>Archive URL(s)</h5>
<p><a href="http://www.elta-project.org/">http://www.elta-project.org/</a></p>
<h5>Additional links</h5>
<p><a href="https://web.archive.org/web/20170614233948/http://www.elta-project.org:80/home.html">Internet Archive</a></p>
<h5>Overview</h5>
<p>
The East London Theatre Archive (ELTA), is a database of East London theatre ephemera provided by the V & A Theatre Collections, East London theatres and UEL archives.
</p>
<p>
ELTA's collection ranges from 1827 to the present day, including playbills and programmes to press cuttings and photographs. It also has themed essays to contextualise the material and maps showing theatre locations.
</p>
<p>
Between 2009 and 2011 ELTA is also took part in the JISC funded CEDAR Project, an attempt to Cluster and Enhance Digital Archives for Research, so you may notice some changes or additional material.
</p>
<h5>Screenshot image (if available)</h5>
<img src="https://kdl.kcl.ac.uk/sla-archiving/images/elta.png" />
<footer>
<p>Maintained by <a href="https://www.kdl.kcl.ac.uk">King's Digital Lab</a></p>
<img src="https://www.kdl.kcl.ac.uk/static/images/kings-logo-red.svg" alt="King's College London logo" />
</footer>
</body>
</html>
| html |
simplicity.factory('AddressCache', ['$http', '$q', '$stateParams', 'simplicityBackend',
function($http, $q, $stateParams, simplicityBackend){
//factory object (this is what gets produced in the factory)
var AddressCache = {};
//container for address cache properties
var addressCache = {};
var pinnum2civicaddressid = {};
var civicaddressIdArray = [];
//Creates an array from a null value or a string
//converts null to empty array and splits string on delimiter
var createArrayFromNullorString = function(value, delimiter){
if(value === null){
return [];
}else{
return value.split(delimiter);
}
};
//On the addressCache object, this function either creates a parent property
//if none exist and then assign a property with a value to the parent property
//Or just assigns a property with a value to the parent property on the addressCache object
var assignValueToDataCacheProperties = function(parentPropertyName, thisPropertyName, value){
//check if parent property already exist
if(addressCache[parentPropertyName]){
//assign property with value to parent property
addressCache[parentPropertyName][thisPropertyName] = value;
//parent property doesn't exist, so create it
}else{
addressCache[parentPropertyName] = {};
//assign property with value to parent property
addressCache[parentPropertyName][thisPropertyName] = value;
}
};
var addGeoJsonForSearchToDataCache = function(idArray){
//use $q promises to handle the http request asynchronously
var q = $q.defer();
var o = {
'address' : {
'table' : 'addresses',
'queryValues' : {'civicaddressIds' : idArray.join()}
},
'street_name' : {
'table' : 'streets',
'queryValues' : {'centerlineIds' : idArray.join()}
},
'neighborhood' : {
'table' : 'neighborhoods',
'queryValues' : {'neighborhoodNames' : idArray.join()}
},
'owner_name' : {
'table' : 'addresses',
'queryValues' : {'civicaddressIds' : idArray.join()}
}
};
if(o[$stateParams.searchby]){
simplicityBackend.simplicityQuery(o[$stateParams.searchby].table, o[$stateParams.searchby].queryValues)
.then(function(results){
addressCache.searchGeojson = results;
q.resolve();
});
}else{
q.resolve();
}
return q.promise;
};
//Queries backend data cache for a single civicaddress id, updates the addressCache variable, and return updated addressCache variable
var queryDataCacheWithASingleId = function(id){
//use $q promises to handle the http request asynchronously
var q = $q.defer();
//make request
simplicityBackend.simplicityQuery('addressCaches', {'civicaddressId' : id})
//callback when request is complete
.then(function(dataCacheResults){
for (var i = 0; i < dataCacheResults.features.length; i++) {
//assign iterator to properties to make it easier to read
var properties = dataCacheResults.features[i].properties;
//assign values
if(properties.type === 'ADDRESS IN CITY'){
addressCache.inTheCity = (properties.data === 'YES')? true : false;
}else if(properties.type === 'CRIME'){
assignValueToDataCacheProperties('crime', properties.distance, createArrayFromNullorString(properties.data, ','));
}else if(properties.type === 'ZONING'){
addressCache.zoning = createArrayFromNullorString(properties.data, ',');
}else if(properties.type === 'PERMITS'){
assignValueToDataCacheProperties('development', properties.distance, createArrayFromNullorString(properties.data, ','));
}else if(properties.type === 'TRASH DAY'){
addressCache.trash = properties.data;
}else if(properties.type === 'RECYCLE DAY'){
addressCache.recycling = properties.data;
}else if(properties.type === 'ZONING OVERLAYS'){
addressCache.zoningOverlays = properties.data;
}else{
//Do nothing
}
}
q.resolve(addressCache);
});
return q.promise;
};//END queryDataCacheWithASingleId function
//Queries backend data cache with an array of civicaddress ids, updates the addressCache variable, and return updated addressCache variable
var queryDataCacheWithAnArrayOfIds = function(ids){
//use $q promises to handle the http request asynchronously
var q = $q.defer();
simplicityBackend.simplicityQuery('addressCaches', {'civicaddressIds' : ids.join()})
//HttpRequest.get(addressCachesTableConfig.tableQueryUrl, queryParams)
.then(function(dataCacheResults){
var crime = {};
var development = {};
for (var i = 0; i < dataCacheResults.features.length; i++) {
var properties = dataCacheResults.features[i].properties;
if(properties.type === 'ZONING'){
if(addressCache.zoning !== undefined){
addressCache.zoning[properties.civicaddress_id] = createArrayFromNullorString(properties.data, ',');
}else{
addressCache.zoning = {};
addressCache.zoning[properties.civicaddress_id] = createArrayFromNullorString(properties.data, ',');
}
//addressCache.zoning = createArrayFromNullorString(properties.data, ',');
}else if(properties.type === 'CRIME'){
if(crime[properties.distance] === undefined){
crime[properties.distance] = {};
}
var crimeArray = createArrayFromNullorString(properties.data, ',');
for (var x = 0; x < crimeArray.length; x++) {
if(!crime[properties.distance][crimeArray[x]]){
crime[properties.distance][crimeArray[x]] = 'crime';
}
}
}else if(properties.type === 'PERMITS'){
if(development[properties.distance] === undefined){
development[properties.distance] = {};
}
var developmentArray = createArrayFromNullorString(properties.data, ',');
for (var y = 0;y < developmentArray.length; y++) {
if(!development[properties.distance][developmentArray[y]]){
development[properties.distance][developmentArray[y]] = 'development';
}
}
}else if(properties.type === 'ADDRESS IN CITY'){
if(addressCache.inTheCity){
addressCache.inTheCity[properties.civicaddress_id] = (properties.data === 'YES')? true : false;
}else{
addressCache.inTheCity = {};
addressCache.inTheCity[properties.civicaddress_id] = (properties.data === 'YES')? true : false;
}
}
}
//put unique values in an array for crime and development
for(var crimeKey in crime){
var crimeTempArray = [];
for(var crimeSubkey in crime[crimeKey]){
crimeTempArray.push([crimeSubkey]);
}
assignValueToDataCacheProperties('crime', crimeKey, crimeTempArray);
}
for(var devKey in development){
var devTempArray = [];
for(var devSubkey in development[devKey]){
devTempArray.push([devSubkey]);
}
assignValueToDataCacheProperties('development', devKey, devTempArray);
}
q.resolve(addressCache);
});
return q.promise;
};//END queryDataCacheWithAnArrayOfIds function
AddressCache.query = function(){
var q = $q.defer();
addressCache = {};
if($stateParams.searchby === 'address'){
addGeoJsonForSearchToDataCache([$stateParams.id])
.then(function(){
q.resolve(queryDataCacheWithASingleId($stateParams.id));
});
}else if($stateParams.searchby === 'street_name'){
var idArray = $stateParams.id.split(',');
for (var i = 0; i < idArray.length; i++) {
idArray[i] = Number(idArray[i]);
}
simplicityBackend.simplicityQuery('xrefs', {'centerlineIds' : idArray.join()})
.then(function(xrefResults){
civicaddressIdArray = [];
for (var i = 0; i < xrefResults.features.length; i++) {
civicaddressIdArray.push(xrefResults.features[i].properties.civicaddress_id);
pinnum2civicaddressid[xrefResults.features[i].properties.pinnum] = xrefResults.features[i].properties.civicaddress_id;
}
addGeoJsonForSearchToDataCache(idArray)
.then(function(){
q.resolve(queryDataCacheWithAnArrayOfIds(civicaddressIdArray));
});
});
}else if($stateParams.searchby === 'owner_name' || $stateParams.searchby === 'pinnum'){
var pinArray = $stateParams.id.split(',');
var pinString = '';
for (var p = 0; p < pinArray.length; p++) {
if(p === 0){
pinString = pinString + "'" + pinArray[p] + "'";
}else{
pinString = pinString + ",'" + pinArray[p] + "'";
}
}
simplicityBackend.simplicityQuery('xrefs', {'pinnums' : pinString})
.then(function(pinXrefResults){
civicaddressIdArray = [];
pinnum2civicaddressid = {};
for (var i = 0; i < pinXrefResults.features.length; i++) {
civicaddressIdArray.push(pinXrefResults.features[i].properties.civicaddress_id);
pinnum2civicaddressid[pinXrefResults.features[i].properties.pinnum] = pinXrefResults.features[i].properties.civicaddress_id;
}
addGeoJsonForSearchToDataCache(civicaddressIdArray)
.then(function(){
q.resolve(queryDataCacheWithAnArrayOfIds(civicaddressIdArray));
});
});
}else if($stateParams.searchby === 'neighborhood'){
q.resolve(addGeoJsonForSearchToDataCache([$stateParams.id]));
}
return q.promise;
};
AddressCache.get = function(){
return addressCache;
};
AddressCache.pinnum2civicaddressid = function(){
return pinnum2civicaddressid;
};
AddressCache.civicaddressIdArray = function(){
return civicaddressIdArray;
};
//****Return the factory object****//
return AddressCache;
}]); //END HttpRequest factory function
| javascript |
AEW has just re-signed The Boys, Brandon and Brent Tate. The twins were recently seen in ROH, appearing alongside Dalton Castle, providing ringside assistance or as tag team partners.
The Boys have been aligned with Castle since 2015, and even won the ROH Six-man Tag Team Championship during their first stint as a unit. They went their separate ways in 2019 but reunited at last year's edition of Death Before Dishonor, to become two-time Six-man Tag Team Champions.
They've made sporadic appearances on Dynamite and Rampage in tag team action. They appeared more frequently on Dark when it was still being taped, competing either in tag team action or alongside Dalton Castle.
According to a report by Fightful, negotiations between AEW and the Tate Twins went back and forth for a few weeks. They then took to social media to make the announcement themselves that they had re-signed with All Elite Wrestling.
Last week on Collision, Dalton Castle of ROH faced Bullet Club Gold's Jay White in singles action. Castle was accompanied by Brandon and Brent Tate, otherwise known as "The Boys" while Jay White had The Gunns and Juice Robinson by his side.
The match was chock-full of interferences from either side, as The Boys and The Gunns went at each other. But in the end, the Switchblade simply hit his signature Blade Runner to get the victory over the former ROH World Champion.
Fans can expect more appearances from Dalton Castle and The Boys from now on, either on Ring of Honor, where they are more frequent, or AEW, following the twins' re-signing with the promotion.
Who would you want to see this trio challenge next? Let us know in the comments section below.
| english |
I’m having kind of a weird low energy day, maybe you all are too, so let’s start off Madhuri week with a bang and put up some nice songs.
Madhuri! As everyone likes saying, she is a trained Kathak dancer. It’s true, she is, but just because I am obsessed with precision, I want to clarify that she isn’t as trained as she could be. While still being far more trained than other actresses.
There’s two kinds of dance training in India. One of them starts as soon as you can walk and takes as much time as your school work. Picture like training for the Olympics. You go through a formal completion ceremony around age 12 and then you are considered as qualified as any other dancer on earth.
The other kind is “dance classes” like we would know them in the West. You go two or three afternoons after school, you start at age 8 or so, you progress at your own rate, and then you stop taking classes when you run out of interest or time or whatever.
Madhuri is the second, not the first, but a really good hardworking version of the second. She kept up her dance classes straight through high school, she worked hard, she was good, and she came out of it with a better dance grounding than most other actresses. Not as good as the true dancer-actors like Vijayantimala or Prabhudeva who were from the first category, but far better than the majority of actors who are more along the lines of “I took dance classes for 3 years and then stopped”. In athlete terms, you could think of her as a semi-pro.
When Madhuri does a song, she can do the things you can really only do if you had training. Like, isolate her face muscles. Or have the endurance and skill for a non-stop long take. Beyond that, even the simple things any actress can do like a body roll, just look better when she does it. She is always on beat, she always moves her body in the most harmonious way, she always integrates each movement into one graceful whole. And on top of that, she smiles! The Madhuri dancing smile is just irresistible, and I am going to make a wild leap of judgement and say maybe that is because she is a “semi-pro”. Dance wasn’t her whole world, ever, it was just something she did because she loved doing it.
Okay, let’s look at some of her dances!
“Chocolate Lime Juice” which you don’t think of as a “dance” because it isn’t formal or anything, but it is Madhuri dancing around and being happy all by herself and it is delightful.
Okay, that’s all I’ve got! Put your “Madhuri songs that make me smile” in the comments.
| english |
<filename>resources/cn/xingyi-normal-university-for-nationalities.json
{"name":"Xingyi Normal University for Nationalities","alt_name":"(XYNUN)","country":"China","state":null,"address":{"street":"32 Hunan Road","city":"Xingyi","province":"Guizhou Province","postal_code":"562400"},"contact":{"telephone":"+ 86(859) 3236966","website":"http:\/\/xynun.edu.cn\/","email":null,"fax":"+ 86(859) 3236966"},"funding":"Public","languages":null,"academic_year":null,"accrediting_agency":null}
| json |
"""
@file
@brief `c3 <http://c3js.org/gettingstarted.html>`_
"""
def version():
"version"
return "0.4.2"
| python |
// Copyright © 2006-2022 <NAME> <<EMAIL>>
package goryachev.common.util;
import java.io.Externalizable;
import java.io.IOException;
import java.io.ObjectInput;
import java.io.ObjectOutput;
public class BooleanArray
implements Externalizable
{
private int size;
private boolean[] array;
private static final long serialVersionUID = 1L;
public BooleanArray()
{
this(32);
}
public BooleanArray(int capacity)
{
size = 0;
array = new boolean[capacity];
}
public int size()
{
return size;
}
public boolean get(int n)
{
try
{
return array[n];
}
catch(ArrayIndexOutOfBoundsException e)
{
return false;
}
}
public void add(boolean d)
{
prepareFor(size);
array[size++] = d;
}
public void set(int n, boolean d)
{
prepareFor(n);
array[n] = d;
if(n >= size)
{
size = n + 1;
}
}
public void set(boolean[] d)
{
array = d;
size = d.length;
}
public void clear()
{
size = 0;
}
public void removeAll()
{
size = 0;
}
protected void prepareFor(int n)
{
if(n >= size)
{
if(n >= array.length)
{
boolean[] a = new boolean[n + Math.max(16,n/2)];
System.arraycopy(array,0,a,0,size);
array = a;
}
else
{
// array unchanged, clear possible garbage [size...n-1]
for(int i=size; i<n; i++)
{
array[i] = false;
}
}
}
}
public void readExternal(ObjectInput in) throws ClassNotFoundException, IOException
{
size = in.readInt();
array = (boolean[])in.readObject();
}
public void writeExternal(ObjectOutput out) throws IOException
{
out.writeInt(size);
out.writeObject(array);
}
public void trim(int sz)
{
if(sz < size)
{
size = sz;
}
}
public void insert(int n, boolean d)
{
prepareFor(size);
if(size > n)
{
System.arraycopy(array,n,array,n+1,size-n);
}
else
{
size = n + 1;
}
array[n] = d;
}
public void remove(int n)
{
int tomove = size - n - 1;
if(tomove > 0)
{
System.arraycopy(array,n+1,array,n,tomove);
}
array[--size] = false;
}
public boolean[] toArray()
{
boolean[] rv = new boolean[size];
System.arraycopy(array,0,rv,0,size);
return rv;
}
// delete range (start...end-1) inclusive
public void removeRange(int start, int end)
{
if(start < end)
{
System.arraycopy(array,end,array,start,size-end);
size -= (end-start);
}
}
}
| java |
package com.gamecodeschool.notetoselfc7;
import android.content.Context;
import android.content.Intent;
import android.content.SharedPreferences;
import android.os.Bundle;
import android.support.v7.app.AppCompatActivity;
import android.util.Log;
import android.view.LayoutInflater;
import android.view.Menu;
import android.view.MenuItem;
import android.view.View;
import android.view.ViewGroup;
import android.widget.AdapterView;
import android.widget.BaseAdapter;
import android.widget.ImageView;
import android.widget.ListView;
import android.widget.TextView;
import java.util.ArrayList;
import java.util.List;
public class MainActivity extends AppCompatActivity {
private NoteAdapter mNoteAdapter;
private boolean mSound;
private int mAnimOption;
private SharedPreferences mPrefs;
@Override
protected void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.activity_main);
mNoteAdapter = new NoteAdapter();
ListView listNote = (ListView) findViewById(R.id.listView);
listNote.setAdapter(mNoteAdapter);
listNote.setOnItemClickListener(new AdapterView.OnItemClickListener() {
@Override
public void onItemClick(AdapterView<?> adapter, View view, int whichItem, long id) {
Note tempNote = mNoteAdapter.getItem(whichItem);
DialogShowNote dialog = new DialogShowNote();
dialog.sendNoteSelected(tempNote);
dialog.show(getFragmentManager(), "");
}
});
}
@Override
protected void onResume(){
super.onResume();
mPrefs = getSharedPreferences("Note to self", MODE_PRIVATE);
mSound = mPrefs.getBoolean("sound", true);
mAnimOption = mPrefs.getInt("sort option", SettingsActivity.FAST);
}
public void createNewNote(Note n){
mNoteAdapter.addNote(n);
}
@Override
public boolean onCreateOptionsMenu(Menu menu) {
// Inflate the menu; this adds items to the action bar if it is present.
getMenuInflater().inflate(R.menu.menu_main, menu);
return true;
}
@Override
public boolean onOptionsItemSelected(MenuItem item) {
// Handle action bar item clicks here. The action bar will
// automatically handle clicks on the Home/Up button, so long
// as you specify a parent activity in AndroidManifest.xml.
int id = item.getItemId();
//noinspection SimplifiableIfStatement
if (id == R.id.action_settings) {
Intent intent = new Intent(this, SettingsActivity.class);
startActivity(intent);
return true;
}
if (id == R.id.action_add) {
DialogNewNote dialog = new DialogNewNote();
dialog.show(getFragmentManager(), "");
return true;
}
return super.onOptionsItemSelected(item);
}
public class NoteAdapter extends BaseAdapter {
private JSONSerializer mSerializer;
List<Note> noteList = new ArrayList<Note>();
public NoteAdapter(){
mSerializer = new JSONSerializer("NoteToSelf.json", MainActivity.this.getApplicationContext());
try {
noteList = mSerializer.load();
} catch (Exception e) {
noteList = new ArrayList<Note>();
Log.e("Error loading notes: ", "", e);
}
}
public void saveNotes(){
try{
mSerializer.save(noteList);
}catch(Exception e){
Log.e("Error Saving Notes","", e);
}
}
@Override
public int getCount() {
return noteList.size();
}
@Override
public Note getItem(int whichItem) {
return noteList.get(whichItem);
}
@Override
public long getItemId(int whichItem) {
return whichItem;
}
@Override
public View getView(
int whichItem, View view, ViewGroup viewGroup) {
if(view == null){
LayoutInflater inflater = (LayoutInflater) getSystemService(Context.LAYOUT_INFLATER_SERVICE);
view = inflater.inflate(R.layout.listitem, viewGroup,false);
}// End if
TextView txtTitle = (TextView) view.findViewById(R.id.txtTitle);
TextView txtDescription = (TextView) view.findViewById(R.id.txtDescription);
ImageView ivImportant = (ImageView) view.findViewById(R.id.imageViewImportant);
ImageView ivTodo = (ImageView) view.findViewById(R.id.imageViewTodo);
ImageView ivIdea = (ImageView) view.findViewById(R.id.imageViewIdea);
Note tempNote = noteList.get(whichItem);
if (!tempNote.isImportant()){
ivImportant.setVisibility(View.GONE);
}
if (!tempNote.isTodo()){
ivTodo.setVisibility(View.GONE);
}
if (!tempNote.isIdea()){
ivIdea.setVisibility(View.GONE);
}
txtTitle.setText(tempNote.getTitle());
txtDescription.setText(tempNote.getDescription());
return view;
}
public void addNote(Note n){
noteList.add(n);
notifyDataSetChanged();
}
}
@Override
protected void onPause(){
super.onPause();
mNoteAdapter.saveNotes();
}
}
| java |
Tamil film Seema Raja, featuring Sivakarthikeyan and Samantha Ruth Prabhu in the lead, has been leaked online by Tamil Rockers. The reports in the media suggest that the film, which received mixed reviews from the audience, is the latest target of the piracy websites. The mass entertainer just started doing some good business at the Box Office. However, seems like the leak will now affect its business at the ticket window.
Directed by Ponram, Seema Raja has Sivakarthikeyan playing the role of a prince who is super rich but hides his identity from the girl he loves, Selvi, played by Samantha. He realises that the villagers are facing atrocities at the hands of a few builders who want to take away their land and start a windmill project there. He, then, decides to help the villagers and there begins his fight.
The film successfully earned Rs 13. 5 crore on its Day 1 at Box Office. However, the makers are yet to take an action against the film’s leak. Not just Kollywood or Bollywood, but the film industries across the world are trying to fight piracy. In fact, Kollywood has taken several necessary measures to curb piracy under the leadership of the President of Tamil Film Producer’s Council and Secretary of Nadigar Sangam, Vishal. Many domains under the name of Tamil Rockers have been removed from the internet but no major improvement has been seen so far. Piracy continues to be a big problem in the film industry. | english |
What does CMMI mean? The above is one of CMMI meanings. You can download the image below to print or share it with your friends through Twitter, Facebook, Google or Pinterest. If you are a webmaster or blogger, feel free to post the image on your website. The CMMI may have other definitions. Please scroll down to see its definitions in English, and other five meanings in your language.
Meaning of CMMIThe following image presents one of the definitions of CMMI in English language. You can download the image file in PNG format for offline use or send image of CMMI definition to your friends by email.
| english |
<!DOCTYPE html>
<html><head><title>PSVariableAttributeCollection</title><link rel="stylesheet" href="../../styles.css"/><script src="../../scripts.js"></script></head><body onload="ro();">
<div class="rH">2 references to PSVariableAttributeCollection</div><div class="rA">System.Management.Automation (2)</div><div class="rG" id="System.Management.Automation"><div class="rF"><div class="rN">engine\ShellVariable.cs (2)</div>
<a href="../engine/ShellVariable.cs.html#167"><b>167</b>_attributes = new <i>PSVariableAttributeCollection</i>(this);</a>
<a href="../engine/ShellVariable.cs.html#390"><b>390</b>get { return _attributes ??= new <i>PSVariableAttributeCollection</i>(this); }</a>
</div>
</div>
</body></html> | html |
package http
import (
"github.com/aws/aws-sdk-go/aws/credentials"
"github.com/r3kzi/elasticsearch-provisioner/pkg/cfg"
"github.com/r3kzi/elasticsearch-provisioner/pkg/util/globals"
"github.com/stretchr/testify/assert"
"io/ioutil"
"net/http"
"net/http/httptest"
"regexp"
"strings"
"testing"
)
const (
url = "https://elasticsearch"
body = "body"
service = "es"
)
var configuration = &cfg.Config{
Elasticsearch: cfg.Elasticsearch{},
AWS: cfg.AWS{Region: "eu-west-1"},
Users: []map[string]cfg.User{},
}
func init() {
globals.SetConfig(configuration)
globals.SetCredentials(credentials.NewCredentials(&CredentialsTestProvider{}))
}
type CredentialsTestProvider struct{}
func (c *CredentialsTestProvider) Retrieve() (credentials.Value, error) {
return credentials.Value{}, nil
}
func (c *CredentialsTestProvider) IsExpired() bool {
return false
}
func TestNewRequest(t *testing.T) {
request, err := NewRequest(url, body)
assert.Nil(t, err)
assert.Equal(t, request.URL.Host, "elasticsearch")
assert.Equal(t, request.URL.Scheme, "https")
bytes, err := ioutil.ReadAll(request.Body)
assert.Nil(t, err)
assert.Equal(t, string(bytes), "body")
}
func TestSignRequest(t *testing.T) {
request, err := NewRequest(url, body)
assert.Nil(t, err)
signRequest, err := SignRequest(request, service)
assert.Nil(t, err)
assert.NotNil(t, signRequest)
assert.NotEmpty(t, signRequest.Header.Get("Authorization"))
assert.Regexp(t, regexp.MustCompile("^AWS4-HMAC-SHA256"), signRequest.Header.Get("Authorization"))
}
func TestDoRequest(t *testing.T) {
server := httptest.NewServer(http.HandlerFunc(func(w http.ResponseWriter, r *http.Request) {
w.WriteHeader(http.StatusOK)
}))
req, _ := http.NewRequest(http.MethodPut, server.URL, strings.NewReader(""))
err := DoRequest(req)
assert.Nil(t, err)
}
func TestFulfillRequest(t *testing.T) {
// TODO: not really required while FulfillRequest method is just a composition of the methods above
/*
server := httptest.NewServer(http.HandlerFunc(func(w http.ResponseWriter, r *http.Request) {
w.WriteHeader(http.StatusOK)
}))
err := FulfillRequest(server.URL, "", service)
assert.Nil(t, err)
*/
}
| go |
6th Edition of Mysuru Literature Festival, Pramoda Devi Wadiyar inaugurates the Festival, International Booker Prize Recipient (2022) Geetanjali Shree and two-time Grammy Award Winner (2015 and 2022) Ricky Kej guests of honour, author Aroon Raman releases the newsletter ‘The Book Leaf’ which will be received by Sudhanva Dhananjaya, MD & CEO of Excelsoft Technologies Pvt. Ltd. , 1 pm; Panel Discussion, Geetanjali Shree, Tomb of Sands – International Booker Prize 2022 Winner, Moderated by Sita Bhaskar, 2 pm; ‘Cricket as Democracy in Action’ by Rajdeep Sardesai and Charu Sharma, 3 pm; ‘Writing about history – Perspective in Fiction, Non-fiction and Architecture’ by Nidhin Olikara, Dr. N. S. Vishwanath, Anirudh Kanisetty and Dr. H. S. Champa, Jyothi Hall, 4 pm; ‘Harinabhisarana’ Yakshagana by Abhijna Hegde, Prasanna Bhat Hegaar, Anantha Padmanabha Phatak, Sadashiva Bhat, Anantha Hegde Dantalige, Sanjaya Kumar Beleyur, Deepak Bhat Kunki and Vigneswara Havagodi, Gardenia – By the Pool, 3. 30 pm to 5 pm; Live Concert by Ricky Kej, Hotel Southern Star, Vinoba Road, 7 pm. | english |
import json
import logging
import arcade
from typing import List
logger = logging.getLogger(__name__)
class LevelDataHandler:
DEFAULT_LEVEL_SPEED = -1
def __init__(self):
with open("level_settings.json") as f:
self.level_settings = json.load(f)
def get_level_speed(self, level_number: str) -> int:
speed = self.level_settings[level_number]["level_speed"]
if not isinstance(speed, int):
logger.warning("Invalid data for level speed, using default speed.")
return self.DEFAULT_LEVEL_SPEED
elif speed > 0:
logger.info("Obstacles need to move right to left! Inverting level speed to negative.")
return -speed
elif speed == 0:
logger.info(f"Speed can't be 0, using default speed.")
return self.DEFAULT_LEVEL_SPEED
else:
return speed
def get_background_parallax_list(self, level_number: int) -> List[dict]:
return self.level_settings[str(level_number)]["background_parallax_list"]
| python |
package com.google.android.gms.internal.ads;
import org.json.JSONException;
import org.json.JSONObject;
/* compiled from: com.google.android.gms:play-services-ads@@19.4.0 */
public final class zzbnf {
public static JSONObject zzb(zzdnv zzdnv) {
try {
return new JSONObject(zzdnv.zzdsv);
} catch (JSONException unused) {
return null;
}
}
}
| java |
<gh_stars>0
{"pages":[{"title":"","text":"Welcome to GitHub PagesYou can use the editor on GitHub to maintain and preview the content for your website in Markdown files. Whenever you commit to this repository, GitHub Pages will run Jekyll to rebuild the pages in your site, from the content in your Markdown files. MarkdownMarkdown is a lightweight and easy-to-use syntax for styling your writing. It includes conventions for 123456789101112131415Syntax highlighted code block# Header 1## Header 2### Header 3- Bulleted- List1. Numbered2. List**Bold** and _Italic_ and `Code` text[Link](url) and  For more details see GitHub Flavored Markdown. Jekyll ThemesYour Pages site will use the layout and styles from the Jekyll theme you have selected in your repository settings. The name of this theme is saved in the Jekyll _config.yml configuration file. Support or ContactHaving trouble with Pages? Check out our documentation or contact support and we’ll help you sort it out.","link":"/README.html"},{"title":"关于","text":"![plant.jpg] (../imangs/plant.jpg)","link":"/about/index.html"},{"title":"标签","text":"","link":"/tags/index.html"},{"title":"分类","text":"","link":"/categories/index.html"}],"posts":[{"title":"过了很久才发出的心情","text":"每一个增加的数字 每一个渐凉体温每一个天使背后 承载多少人本应阖家团圆 却道旅途凶险我们家中盼望 待你逆流而上只为一个信念 早日赶走新冠 加油武汉 不管多少困难加油武汉 始终相信明天 昔日繁华街头 突然变得温柔 独自站在窗前 待了很久 很久 虽然足不出户 你我却手拉着手 一起抗击病魔 他日终成明就 加油明天 期盼星明月圆 加油明天 期盼山花烂漫 你我都想做点什么 帮助每一个我们 看看家人 心怀感恩 说好的不怕 却偷着流泪看着身边的新闻 隔离不哭 力量积蓄需要孤独 熬过一段不为人知的艰难岁月 世界就会更加和颜悦色 病毒早日过去 一切回归秩序 我们心怀感恩 带着使命前行","link":"/2020/03/13/hello-world/"}],"tags":[{"name":"新冠病毒","slug":"新冠病毒","link":"/tags/%E6%96%B0%E5%86%A0%E7%97%85%E6%AF%92/"}],"categories":[{"name":"生活","slug":"生活","link":"/categories/%E7%94%9F%E6%B4%BB/"}]} | json |
Tirumala, 17 Nov. 19: The Honourable Chief Justice of India, Justice Ranjan Gogoi accompanied by his wife Smt Rupanjali Gogoi on Sunday offered prayers in the Hill Shrine of Lord Venkateswara.
Chief Justice of India along with his family, he was accorded welcome on his arrival at the main entrance of the temple amidst chanting of Vedic hymns by veda pundits and melam band.
In the sanctum sanctorum he was explained about the importance of presiding deity and the jewels adorned to Lord Venkateswara. Later the Vedic scholars offered vedasirvachanam in Ranganayakula mandapam.
TTD EO Sri Anil Kumar Singhal, Addl EO Sri AV Dharma Reddy, offered theertha prasadams of lord venkateswara to the top brass dignitary.
Temple DyEO Sri Haridranath, Reception Officials Sri Balaji and others were present.
తిరుమల, 2019 నవంబరు 17: సుప్రీం కోర్టు ప్రధాన న్యాయమూర్తి జస్టిస్ రంజన్ గొగోయ్ దంపతులు ఆదివారం ఉదయం తిరుమల శ్రీవారిని దర్శించుకున్నారు.
ముందుగా ఆలయం వద్దకు చేరుకున్న జస్టిస్ రంజన్ గొగోయ్కు టిటిడి కార్యనిర్వహణాధికారి శ్రీ అనిల్కుమార్ సింఘాల్, అదనపు ఈవో శ్రీ ఏ.వి.ధర్మారెడ్డి స్వాగతం పలికి శ్రీవారి దర్శన ఏర్పాట్లు చేశారు. దర్శనానంతరం రంగనాయకుల మండపంలో గౌ|| ప్రధాన న్యాయమూర్తికి వేద పండితులు వేదాశీర్వచనం చేశారు. టిటిడి ఈవో, అదనపు ఈవో శ్రీవారి చిత్రపటం, తీర్థప్రసాదాలను అందజేశారు.
ఈ కార్యక్రమంలో ఆలయ డెప్యూటీ ఈవో శ్రీ హరీంద్రనాధ్, విజివో శ్రీ మనోహర్, పేష్కార్ శ్రీ లోకనాధం, ఇతర అధికారులు పాల్గొన్నారు.
టిటిడి ప్రజాసంబంధాల అధికారిచే జారీ చేయబడినది.
| english |
const express = require('express');
const router = express.Router();
const mongoose = require('mongoose');
var User = mongoose.model('users');
var Sub = require('../db/models/subscriptions')
var Quote = require('../db/models/quote');
const nodeJobs = require('../lib/NodeCron');
const PromoCode = require('../db/models/promocodes');
const middleware = require('../lib/middleware');
const verifyAdmin = async (req, res, next) => {
try {
const account = await User.findById(req.body.id);
if(account.email == '<EMAIL>')
next();
else
res.status(403);
} catch(err) {
res.status(500);
}
}
var now = new Date();
const fakeService = {
name: 'Starter',
price: 4,
dueDate: new Date(now.getFullYear(), now.getMonth(), now.getDate())
}
router.post('/promocode/create', middleware.verify, verifyAdmin, async (req, res) => {
const newPromo = await PromoCode.create({code: req.body.code, description: req.body.description, rate: req.body.rate, reccuring: Boolean(req.body.reccuring) })
res.status(200).json({data: newPromo});
});
router.post('/subscription/create', middleware.verify, verifyAdmin, (req, res) => {
let newSub = new Sub({
type: req.body.type,
name: req.body.name,
monthly: Number(req.body.monthly),
quarterly: Number(req.body.quarterly),
anually: Number(req.body.anually)
});
newSub.save().then(subscription => {
res.json(subscription)
}).catch(err => {
console.log(err)
})
});
router.post('/genfakeinvoice', middleware.verify, verifyAdmin, async (req, res) => {
var currentDate = new Date(now.getFullYear(), now.getMonth(), now.getDate())
const newInvoice = {
invoiceNumber: 12331256131,
name: '<EMAIL>',
services: [fakeService],
total: 50,
paid: false,
dueDate: currentDate
}
const me = await User.findOne({email: '<EMAIL>'});
me.invoices.push(newInvoice);
const savedMe = await me.save();
res.json(savedMe);
});
router.post('/genfakeservices', middleware.verify, verifyAdmin, async (req, res) => {
const me = await User.findOne({email: '<EMAIL>'});
const subscription = await Sub.findOne({type: 'hosting'});
var now = new Date();
const fakeService = {
renewDate: new Date(now.getFullYear(), now.getMonth(), now.getDate()+7),
subscription: subscription
}
me.subscriptions.push(fakeService);
const savedMe = await me.save();
res.json(savedMe);
});
router.post('/scheduleJob', (req, res) => {
nodeJobs.scheduleInvoiceGeneration();
console.log('Job was scheduled');
res.sendStatus(200);
})
// START FULLY IMPLEMENTED ROUTES --------------------------
router.post('/authenticate', middleware.verify, verifyAdmin, async (req, res) => {
return res.status(200).json({data: true});
})
router.post('/get-users', middleware.verify, verifyAdmin, async (req, res) => {
try {
const users = await User.find({});
return res.status(200).json(users);
} catch (error) {
console.log(error);
res.status(500);
}
})
router.post('/update-customer/quote', middleware.verify, verifyAdmin, async (req, res) => {
console.log(req.body)
var customer = await User.findById(req.body.customerID);
var newQuotesList = await customer.findQuoteByIdAndUpdate(req.body.quoteID, req.body.updated);
console.log(newQuotesList)
customer.quotes = newQuotesList;
customer.markModified('quotes')
await customer.save();
res.sendStatus(200);
})
module.exports = router; | javascript |
<filename>config/asset-settings.ts<gh_stars>10-100
import { AssetSettings } from '../types/custom/config-types'
import { AssetType } from '../utils/consts'
export const assetSettings: Record<string, AssetSettings> = {
kovan: {
DAI: [
{ key: 'cToken', value: 'CDAI', type: AssetType.Token },
{ key: 'MaxLoanAmount', value: 25000, type: AssetType.Amount },
{ key: 'MaxTVL', value: 100000, type: AssetType.Amount },
{ key: 'MaxDebtRatio', value: 5000, type: AssetType.Uint },
],
USDC: [{ key: 'cToken', value: 'CUSDC', type: AssetType.Token }],
WETH: [{ key: 'cToken', value: 'CETH', type: AssetType.Token }],
},
rinkeby: {
DAI: [
{ key: 'cToken', value: 'CDAI', type: AssetType.Token },
{
key: 'pPool',
value: '0x4706856FA8Bb747D50b4EF8547FE51Ab5Edc4Ac2',
type: AssetType.Address,
},
{ key: 'MaxLoanAmount', value: 25000, type: AssetType.Amount },
{ key: 'MaxTVL', value: 100000, type: AssetType.Amount },
{ key: 'MaxDebtRatio', value: 5000, type: AssetType.Uint },
],
USDC: [
{ key: 'cToken', value: 'CUSDC', type: AssetType.Token },
{
key: 'pPool',
value: '0xde5275536231eCa2Dd506B9ccD73C028e16a9a32',
type: AssetType.Address,
},
],
WETH: [{ key: 'cToken', value: 'CETH', type: AssetType.Token }],
},
ropsten: {
DAI: [
{ key: 'cToken', value: 'CDAI', type: AssetType.Token },
{ key: 'MaxLoanAmount', value: 25000, type: AssetType.Amount },
{ key: 'MaxTVL', value: 100000, type: AssetType.Amount },
{ key: 'MaxDebtRatio', value: 5000, type: AssetType.Uint },
],
USDC: [{ key: 'cToken', value: 'CUSDC', type: AssetType.Token }],
WETH: [{ key: 'cToken', value: 'CETH', type: AssetType.Token }],
},
mainnet: {
DAI: [
{ key: 'cToken', value: 'CDAI', type: AssetType.Token },
{ key: 'aToken', value: 'ADAI', type: AssetType.Token },
{ key: 'yVault', value: 'YDAI', type: AssetType.Token },
{
key: 'pPool',
value: '0xEBfb47A7ad0FD6e57323C8A42B2E5A6a4F68fc1a',
type: AssetType.Address,
},
{ key: 'MaxLoanAmount', value: 100000, type: AssetType.Amount },
{ key: 'MaxTVL', value: 10000000, type: AssetType.Amount },
{ key: 'MaxDebtRatio', value: 5000, type: AssetType.Uint },
],
USDT: [
{ key: 'cToken', value: 'CUSDT', type: AssetType.Token },
{ key: 'aToken', value: 'AUSDT', type: AssetType.Token },
{ key: 'yVault', value: 'YUSDT', type: AssetType.Token },
{
key: 'pPool',
value: '<KEY>',
type: AssetType.Address,
},
{ key: 'MaxLoanAmount', value: 100000, type: AssetType.Amount },
{ key: 'MaxTVL', value: 10000000, type: AssetType.Amount },
{ key: 'MaxDebtRatio', value: 5000, type: AssetType.Uint },
],
USDC: [
{ key: 'cToken', value: 'C<PASSWORD>', type: AssetType.Token },
{
key: 'pPool',
value: '0xde9ec95d7708b8319ccca4b8bc92c0a3b70bf416',
type: AssetType.Address,
},
],
WETH: [{ key: 'cToken', value: 'CETH', type: AssetType.Token }],
},
polygon: {
DAI: [
{ key: 'aToken', value: 'ADAI', type: AssetType.Token },
{
key: 'pPool',
value: '0xFECFa775643eb8C0F755491Ba4569e501764DA51',
type: AssetType.Address,
},
{ key: 'MaxLoanAmount', value: 25000, type: AssetType.Amount },
{ key: 'MaxTVL', value: 10000000, type: AssetType.Amount },
{ key: 'MaxDebtRatio', value: 5000, type: AssetType.Uint },
],
USDT: [
{ key: 'aToken', value: 'AUSDT', type: AssetType.Token },
{
key: 'pPool',
value: '0x887E17D791Dcb44BfdDa3023D26F7a04Ca9C7EF4',
type: AssetType.Address,
},
{ key: 'MaxLoanAmount', value: 25000, type: AssetType.Amount },
{ key: 'MaxTVL', value: 10000000, type: AssetType.Amount },
{ key: 'MaxDebtRatio', value: 5000, type: AssetType.Uint },
],
USDC: [{ key: 'aToken', value: 'AUSDC', type: AssetType.Token }],
WETH: [{ key: 'aToken', value: 'AETH', type: AssetType.Token }],
},
polygon_mumbai: {
DAI: [
{ key: 'aToken', value: 'ADAI', type: AssetType.Token },
{ key: 'MaxLoanAmount', value: 25000, type: AssetType.Amount },
{ key: 'MaxTVL', value: 10000000, type: AssetType.Amount },
{ key: 'MaxDebtRatio', value: 5000, type: AssetType.Uint },
],
USDC: [{ key: 'aToken', value: 'AUSDC', type: AssetType.Token }],
WETH: [{ key: 'aToken', value: 'A<PASSWORD>', type: AssetType.Token }],
},
}
| typescript |
Role of ACV in Curing and Preventing Kidney Stones and Diseases: Thesis Statement: We all know that Apple cider vinegar has numerous health benefits. It has proved to be quite effective in treating diabetes, high cholesterol, skin ailments, and even aids in weight loss. But is it as effective as people claim it to be for treating kidney stones? Let’s find out.
In addition to its many beneficial properties, people also use ACV to treat many diseases. Diseases such as skin conditions, liver diseases, gastrointestinal problems, and many other inflammatory conditions. However, in addition to treating all these ailments, you can also use ACV for treating kidney problems, such as kidney stones, gallstones, and urinary tract infections.
As you are already aware that kidney stones are a quite common ailment that 8.8% of U.S population has have them. This means that one out of every eleven people in the United States has a kidney stone. You can usually find these stones in the kidneys or ureters. Regardless of their location, kidney stones are really painful and can cause a lot of discomfort and pain during urination. However, if you leave them untreated over time, they cause kidney infections, inflammation, and even cause blood during urination.
Doctors say that most kidney stones are small enough to pass out of your kidney on your own if you intake plenty of fluids. However, in the case of larger stones, the patients require surgery to remove the stones.
What are Kidney Stones & How They are formed?
Kidney stones are very small stones that form in the kidney when there are excess mineral salts in your blood. These tiny particles once formed cause inflammation in the kidney as well as makes its working quite painful. These undecomposed particles get bigger and bigger and form kidney stones, which might pass to the bladder as well and cause inflammation in the urinary tract.
The kidney stone symptoms include severe pain in the lower abdomen, frequent urination, foul smell of urine, blood in urine, etc.
Doctors can remove these stones through surgery and lithotripsy (laser treatment). However, it can be a painful procedure. Therefore, to avoid these painful procedures, you must try natural treatments like drinking plenty of water can help in passing out of kidney stones through urination and helps in painless urination. Another effective home remedy for treating kidney stones is using Apple Cider Vinegar (ACV). In fact, it is one of the many health benefits of apple cider vinegar that helps in removing kidney stones.
Even though, ACV is a remedy for many diseases. This article solely discusses ways to treat and prevent kidney ailments like kidney stones, inflammation, and urinary infections by using ACV.
Being a vinegar ACV has acidic nature as it has acetic acid in it. This acidic nature helps in the decomposition of stones present in the kidneys, ureter, and other urinary tracts. After disintegration, the size of the stone is reduced enough to easily passed through urine.
The acid present in ACV helps break down food in the stomach as well, which might reduce the chances of kidney stones through proper digestion.
ACV also helps maintain the pH level of blood and kills the toxic substances found in the urinary tract. Therefore, it also acts as a natural cleanser for your body.
- Studies show that urologists believe that the major cause of kidney stones is excess calcium oxalate salt. To minimize the effect of calcium oxalate salt, you should use lemon juice, citric acid, orange juice, and apple cider vinegar. These remedies help in maintaining an alkaline environment, which results in the breaking down of calcium oxalate particles. These small-sized particles can easily pass through the urinary tract and pass out from the body through urine. That is why doctors suggest the use of ACV to cure kidney stones.
- Another study has shown that the major causes of kidney stones are high cholesterol and sugar levels in the blood and overweight. We know that ACV alsohelps reduce blood glucose levels and cholesterol levels and lose weight, which might reduce the incidences of kidney stones.
- ACV has potassium in a very small amount. Research has shown that the intake of potassium in a large amount in the diet helps prevent the formation of kidney stones. ACV may also reduce the likelihood of kidney stones.
- ACV also cures renal cyst formation. Renal cysts are small-sized sacs filled with water that cause difficulty in passing urine through the kidneys when they increase in number. ACV has acidic nature and cleans up these sacs, which results in the prevention of blockage and kidney failure.
- You can use ACV in a variety of ways to prevent kidney problems. You can use ACV in a salad dressing with a little sprinkle of olive oil.
- It can also be used in the form of a mixture. This mixture comprises lemon juice, olive oil, and apple cider vinegar. This mixture helps in proper digestion by performing its enzymatic action in the stomach. This in turn prevents the formation of kidney stones.
- Another mixture can be made by adding ACV to water and drinking it. However, please do not use it frequently without the consultation of a doctor. Usingapple cider vinegar for kidney stones has proved to be quite effective therefore we recommend that you should give it a try.
We can conclude this article as we are now aware of the natural remedy for kidney ailments. Using ACV in the diet helps in curing skin, inflammatory and gastrointestinal diseases. But it also helps prevent kidney stones and other kidney malfunctioning problems.
| english |
Shri K.C. Venugopal, Member of Parliament,
Shri Shashi Tharoor, Member of Parliament,
I feel immensely happy and blessed to have the opportunity to address you as Chief Guest at the closing ceremony of the 34th Srimad Bhagavatha Maha Sathram held at Sreekrishna Swamy Temple, Ambalappuzha.
Though I have attended some programmes in Alapuzha district earlier and have passed by Ambalapuzha many times, this is my first visit to this sacred abode of Lord Krishna.
This temple's association with Guruvayur , the famous legend behind its unique prasadam called Ambalapuzha Paal Paayasam and the temple's tradition of having nurtured literary talents like the legendary poet Kunchan Nambiar are too well known to be recounted in detail.
As a sacred institution that has cast a sublime influence on the spiritual well being of the people, this temple has always remained a marvel in Kerala's spiritual history. Today, as we conclude the 34th Srimad Bhagavatha Sathram, held for the first time in this temple, we feel the ennobling effect of its spiritual influence.
The aim of all religions is the welfare of the world. Religions must seek to unite people, not to divide them. But, in today's world, the practice of religion by some sections seems to be guided more by ignorance than knowledge. Sadly, such ignorance has been causing extremism and intolerance in many societies. In this context, we need to concentrate on actions that will spread the light of spiritual knowledge. I feel that the Bhaagavata Sathram , which is held in different temples every year, is one such noble endeavour.
Devotion has been a central theme in Indian philosophy, and Man's life is seen as a journey in search of knowledge, better known as Jnaana. It is though this knowledge that Man seeks perfection, which we call Moksha or the h in our actions and it is not surprising that many of our scriptures giving paramount importance to action. One example is the Bhagavat Gita. According to Swamy Vivekananda, the doctrine which stood out luminously in every page of the Gita was intense activity. But in the midst of it, one could also experience eternal calmness.
The Sreemad Bhagavatham goes beyond The Gita and the Mahabharata which dwell on the concepts of Kama, Artha and Dharma. In fact, Bhagavatham explains how one can attain Moksha or the ultimate Bliss by submitting oneself to the doctrines of Lord Krishna.
Bhagavatham sees Krishna's incarnation as a complete Avatar and each stage of the Avatar presents lofty models for human existence. Innocence of childhood and the beauty of maternal love come alive in the description of his early years ; the stories of his youth instilled dreams of in the minds of damsels. The portrait of Krishna as a soldier and a war strategist, the magic of his Diplomacy and his philosophy of life carve lofty models that no myth could ever surpass. Every moment of his life, as recounted in Bhagavatham reveals eternal truths on human life, insight and imagination.
There is a general tendency to sideline spiritual texts as mere outdated stories. But, texts like Bhagavatham reveal their increased relevance through each reading. Take for instance, Krishna's life as the protector of cattle. It points to the eco-concepts that we as humans hold dear to our minds even now. In his Kaaliya Mardanam, we see a protector's warning against the forces of pollution of water, an issue we are still not free from . When he lifted the Mount Govardhanam to protect his people from the torrential rains unleashed by an angry Indra, it was his faith in Nature's role in ensuring safety and agricultural prosperity, that we saw.
I understand that the Bhagavtha Sathram held now is the 34th one organized by the Akhila Bharatha Bhagavatha Sathram Samithy. It is heartening to know that throughout the history of this spiritual event, there has been a wide participation from other temples and from devotees living in different places. We have had instances when the Sree Krishna Idol for the Sathram was brought from Guruvayur, or from Ahobilam in Andhra Pradesh. When the Sathram was held at Guruvayur, the idol procession came from Mathura, the birthplace of Lord Krishna. Thus, this event has always had a wider acceptance and today's large audience is an evidence of its social relevance.
I am informed that the ten day Sathram has been enriched by the presence of over a hundred Acharyas who explained through informative lectures, the suggestive meaning of each line of Bhaagavatham. It is widely believed that regular reading and recital of spiritual texts refines our minds. No wonder, all over Kerala, we have many groups, especially groups of women regularly reciting texts like Sreemad Narayaneeyam. Such initiatives, with a clear understanding of the philosophy that lies beneath every line, would help people to understand our spiritual and cultural heritage in a better way.
I heartily compliment the organizers for their tireless efforts in conducting this Sathram in a befitting and spiritually rewarding manner.
I sincerely hope that all devotees who attended this Bhagavatha Sathram would feel the light of spiritual refinement guiding them in their life ahead.
| english |
Kochi: Years after getting linked to the spot-fixing saga, former India pacer Sreesanth has finally split the beans on what exactly transpired. In 2013, Sreesanth along with two other Rajasthan Royals cricketers was booked in a spot-fixing scandal that made headlines. The two-time World Cup-winner said why would he do such a thing that too for merely Rs 10 lakhs.
“I had played the Irani Trophy and was looking to play the South African series, so that we can win in September 2013. We were going early, and it moves better in September. My goal was to play that series. A person like that, why would I do it, that too for 10 lakhs?, I am not talking big but I used to have bills of around 2 lakh when I partied around,” he told Sportskeeda.
Adding further, he said that it was his fans and well-wishers who helped him out of that situation.
“In my life, I have only helped and given belief. I have helped a lot of people, and those prayers helped me get out of this,” he added.
Claiming that he was bowling 130-plus after 12 injuries to his toe, Sreesanth also revealed that it was supposed to be a 14-plus over and he had conceded five of four balls.
“It was supposed to be one over and 14-plus runs. I bowled four balls for five runs. No no-ball, no wide and not a single slower ball in an IPL game. I was bowling at 130-plus after 12 surgeries on my toe,” Sreesanth added.
After his ban was lifted, the veteran pacer returned to competitive cricket earlier this year in the Syed Mushtaq Ali Trophy.
| english |
{"url":"git://github.com/puppetlabs/puppet-resource_api.git","ref":"775cd7a078e12a8a85af52eef3895d441f016b49"}
| json |
def Linear_Search(Test_arr, val):
index = 0
for i in range(len(Test_arr)):
if val > Test_arr[i]:
index = i+1
return index
def Insertion_Sort(Test_arr):
for i in range(1, len(Test_arr)):
val = Test_arr[i]
j = Linear_Search(Test_arr[:i], val)
Test_arr.pop(i)
Test_arr.insert(j, val)
return Test_arr
if __name__ == "__main__":
Test_list = input("Enter the list of Numbers: ").split()
Test_list = [int(i) for i in Test_list]
print(f"Binary Insertion Sort: {Insertion_Sort(Test_list)}") | python |
{
"kind": "Property",
"name": "TextTrackList.length",
"href": "https://developer.mozilla.org/en-US/docs/Web/API/TextTrackList/length",
"description": "The read-only TextTrackList property length returns the number of entries in the TextTrackList, each of which is a TextTrack representing one track in the media element.",
"refs": [
{
"name": "HTML Living Standard",
"href": "https://html.spec.whatwg.org/multipage/#dom-texttracklist-length",
"description": "TextTrackList: length - HTML Living Standard"
}
]
}
| json |
Bihar Chief Minister Nitish Kumar on Wednesday claimed that the Nehru-Gandhi legacy in the country was over. Rubbing ally the Congress on the wrong side, Nitish said if the Nehru-Gandhi family continued to try and build the statues of the family leaders, people would start spitting on them. He felt the era was over. The Chief Minister, with aspirations for Prime Ministership, said the BJP-led NDA's rule was lacklustre in the past 2 years, and it was not expected to do much in the next 3 years also. Having to deal with jungle raj in Bihar, he said there was no such a thing in his State. In fact, the crime rate and highway accidents had come down. Giving the latest crime statistics upto May 23, Nitish claimed there was no threat to law and order in his State. As the common refrain, he said nobody would be spared however high and mighty he might be. He overlooked the fact that the whole country had to demand action against a political scion who shot down a youth simply on the ground of overtaking his SUV. He said in connection with hundred years of Champaran satyagraha by Gandhiji that his government had implemented Prohibition in the State, which was being picked up by other States as well. | english |
<gh_stars>0
import React from 'react'
import ChimeraNavTabs from "./ChimeraNavTabs"
import WeaponTypeNavTabs from "../WeaponTypeNavTabs"
export default function FireChimeraWeapons() {
return (
<div>
<ChimeraNavTabs />
<h1>Fire Chimera Weapons</h1>
<WeaponTypeNavTabs />
</div>
)
} | javascript |
<gh_stars>0
{
"name": "firebase-childrenkeys",
"version": "2.3.4",
"description": "Fetch children keys of Firebase Admin Database References via the REST API",
"main": "index.js",
"engines": {
"node": ">=8.0"
},
"scripts": {
"test": "node tests/runner.js"
},
"repository": {
"type": "git",
"url": "git://github.com/pkaminski/firebase-childrenkeys.git"
},
"keywords": [
"Firebase",
"shallow",
"REST",
"keys"
],
"author": "<NAME> <<EMAIL>>",
"license": "MIT",
"bugs": {
"url": "https://github.com/pkaminski/firebase-childrenkeys/issues"
},
"homepage": "https://github.com/pkaminski/firebase-childrenkeys",
"dependencies": {
"axios": "^0.24.0",
"sleep-promise": "^9.1.0"
},
"peerDependencies": {
"firebase-admin": "5.x || 6.x || 7.x || 8.x || 9.x"
},
"devDependencies": {
"eslint": "^7.12.1",
"firebase-admin": "^9.3.0"
}
}
| json |
package com.jzd.jzshop.entity;
import java.util.List;
/**
* @author LWH
* @description:
* @date :2019/12/10 14:28
*/
public class SecondAddressEntity {
private List<ProvincesBean> provinces;
public List<ProvincesBean> getProvinces() {
return provinces;
}
public void setProvinces(List<ProvincesBean> provinces) {
this.provinces = provinces;
}
public static class ProvincesBean {
/**
* name : 北京市
* level : 1
* code : 1100
* cities : [{"name":"北京市","level":"1","code":"1100"}]
*/
private String name;
private String level;
private String code;
private List<CitiesBean> cities;
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getLevel() {
return level;
}
public void setLevel(String level) {
this.level = level;
}
public String getCode() {
return code;
}
public void setCode(String code) {
this.code = code;
}
public List<CitiesBean> getCities() {
return cities;
}
public void setCities(List<CitiesBean> cities) {
this.cities = cities;
}
public static class CitiesBean {
/**
* name : 北京市
* level : 1
* code : 1100
*/
private String name;
private String level;
private String code;
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getLevel() {
return level;
}
public void setLevel(String level) {
this.level = level;
}
public String getCode() {
return code;
}
public void setCode(String code) {
this.code = code;
}
}
}
}
| java |
This is a public group. Anyone can join and invite others to join.
[close] 1) Don't say anything inappropriate.
2) Nothing farther than kissing in the roleplay.
3) No advertising.
2) Nothing farther than kissing in the roleplay.
3) No advertising.
What should Divergent fans be called?
DIVERGENT #3 TITLE RELEASED!
Showing 6 of 6 topics — 552 comments totalWelcome!
* Introduce Yourself!
What's your fear landscape?
Factions Quiz!
Showing 10 of 10 topics — 143 comments totalThe Movie!
First picture of Four from the movie!
MORE UPDATES! VERONICA ROTH'S THOUGHTS ABOUT THE MOVIE AND WHAT SHE SAW ON SET!!!!
What are you looking forward to in the movie?
New Update!
Open Cast Call...anyone else?
OFFICIAL CASTING FOR CHRISTINA, TORI, AND CALEB IN DIVERGENT MOVIE!
Alexander Ludwig will NOT play Four.
* Allegiant (#3)
* Insurgent (#2)
* Divergent (#1)
Tobias Novellas!!
Divergent #3 title?
Beatrice (Tris)
Amity (The Peaceful)
Dauntless (The Brave)
Abnegation (The Selfless)
Candor (The Honest)
Erudite (The Intelligent)
This or That?
The world of Divergence - A social experiment?
Bookshelf (showing 1-2 of 2)
So far, do you think the right actors have been cast in the movie?
Some of them.
No, they're all wrong.
Yes, all of them are correct.
Watch the Movie!
This moderator is inactive. If you'd like to help out in this group, send them a message asking to be made a moderator. If they are unresponsive, please contact Goodreads and state your request.
Watch the Movie!
| english |
<gh_stars>0
/**
* @file random_selection.hpp
* @author <NAME>
*
* Randomly select dataset points for use in the Evaluation step.
*
* ensmallen is free software; you may redistribute it and/or modify it under
* the terms of the 3-clause BSD license. You should have received a copy of
* the 3-clause BSD license along with ensmallen. If not, see
* http://www.opensource.org/licenses/BSD-3-Clause for more information.
*/
#ifndef ENSMALLEN_CMAES_RANDOM_SELECTION_HPP
#define ENSMALLEN_CMAES_RANDOM_SELECTION_HPP
namespace ens {
/*
* Randomly select dataset points for use in the Evaluation step.
*/
class RandomSelection
{
public:
/**
* Constructor for the random selection strategy.
*
* @param fraction The dataset fraction used for the selection (Default 0.3).
*/
RandomSelection(const double fraction = 0.3) : fraction(fraction)
{
// Nothing to do here.
}
//! Get the dataset fraction.
double Fraction() const { return fraction; }
//! Modify the dataset fraction.
double& Fraction() { return fraction; }
/**
* Randomly select dataset points to calculate the objective function.
*
* @tparam DecomposableFunctionType Type of the function to be evaluated.
* @param function Function to optimize.
* @param batchSize Batch size to use for each step.
* @param iterate starting point.
*/
template<typename DecomposableFunctionType,
typename MatType,
typename... CallbackTypes>
double Select(DecomposableFunctionType& function,
const size_t batchSize,
const MatType& iterate,
CallbackTypes&... callbacks)
{
// Find the number of functions to use.
const size_t numFunctions = function.NumFunctions();
typename MatType::elem_type objective = 0;
for (size_t f = 0; f < std::floor(numFunctions * fraction); f += batchSize)
{
const size_t selection = arma::as_scalar(arma::randi<arma::uvec>(
1, arma::distr_param(0, numFunctions - 1)));
const size_t effectiveBatchSize = std::min(batchSize,
numFunctions - selection);
objective += function.Evaluate(iterate, selection, effectiveBatchSize);
Callback::Evaluate(*this, f, iterate, objective, callbacks...);
}
return objective;
}
private:
//! Dataset fraction parameter.
double fraction;
};
} // namespace ens
#endif
| cpp |
Anger doesn’t solve anything, it builds nothing, but it can destroy everything. Things said in anger can have significant repercussions on your relationships. You should know how to apologize for hurting someone you love. To do so, a heartfelt apology really helps. There is nothing better than simply saying “I am sorry”. The key is to mean it while saying it.
How To Apologise For Hurting Someone You Love?
1. Avoid using the word ‘but’.
2. Don’t take forgiveness for granted.
3. Take responsibility for the hurtful things you said.
4. Be thankful for the person’s patience.
5. Choose your words carefully. They should be gentle and sincere. And most importantly don’t be fake.
6. In case you can’t talk to the person you hurt, a call or a handwritten letter may work.
7. Don’t compare how many times you have hurt or been hurt. It really doesn’t matter. If you have hurt them, just say sorry.
8. Show the person you love that you are sincere in your apology. You are ready to do anything in your power to make things right.
There was once a little boy who had a bad temper. To do away with this behaviour, his father gave him a bag of nails. He asked him to hammer a nail into the fence, every time he lost his temper. The first day, he drove 37 nails into the fence. Over the next few weeks, this number kept on decreasing.
The boy had learned to control his temper. He realized it was easier to control his temper than to drive those nails into the fence. Finally, the day came when he didn’t lose his temper at all.
It was then, that his father suggested that he remove the nails from the fence. The boy did as he was told. The fence stood there but the nails had left holes in it. Anger is just like those nails.
Even if the anger and harsh words are gone, the scars they leave remain. And the only thing that can heal these scars is a sincere apology. Everything might not go back to being how it was immediately, but things will get there, eventually.
So control your temper. In case you do end up hurting the people you love, sincerely apologise!
Read more: Questions That Will Change Your Life Forever!
Like & Follow ThinkRight.me on Facebook and Instagram to stay connected.
| english |
Your guide to all the new movies and shows streaming on Hulu in the US this month.
Inspired by a true story, a comedy centered on a 27-year-old guy who learns of his cancer diagnosis and his subsequent struggle to beat the disease.
2. A Most Wanted Man (2014)
A Chechen Muslim illegally immigrates to Hamburg, where he gets caught in the international war on terror.
3. A Perfect Day (2006 TV Movie)
A family man and suddenly-successful author encounters a mystic stranger who warns him he has only forty more days to live. Based on a novel by Richard Paul Evans.
4. A Prayer for the Dying (1987)
Martin, an I.R.A. hitman, is seen by a Catholic priest while carrying out a hit. He grows a bond with the priest and his niece. But his past and his former employers put all their lives in danger.
5. Across the Universe (2007)
The music of The Beatles and the Vietnam War form the backdrop for the romance between an upper-class American girl and a poor Liverpudlian artist.
After crash-landing in the snowswept Andes, a Uruguayan rugby team has no choice but to turn to desperate measures in order to survive.
7. American Ninja Warrior (2009– )
Contestants run, jump, crawl, climb, hang, and swing through crazy obstacles as they compete to become the next American Ninja champion.
8. Anaconda 3: Offspring (2008 TV Movie)
A mercenary-for-hire accepts a mission from a billionaire to capture a dangerous snake that could possibly help cure a terminal illness.
9. Anacondas: The Hunt for the Blood Orchid (2004)
A scientific expedition sets out for Borneo to seek a flower called the Blood Orchid, which could grant longer life. Meanwhile, they run afoul of snakes and each other.
10. Anacondas: Trail of Blood (2009 TV Movie)
A genetically created Anaconda, cut in half, regenerates itself into two aggressive giant snakes, due to the Blood Orchid.
Director: Don E. FauntLeRoy | Stars: Crystal Allen, Linden Ashby, Danny Midwinter, Calin Stanciu Jr.
11. Arachnophobia (1990)
A new species of South American killer spider hitches a lift to a small California town in a coffin and starts to breed, leaving a trail of deaths that puzzle and terrify the young doctor newly arrived in town with his family.
12. Batman Begins (2005)
After witnessing his parents' death, Bruce learns the art of fighting to confront injustice. When he returns to Gotham as Batman, he must stop a secret society that intends to destroy the city.
13. Black and White (2002)
Recreation of the landmark 1958 South Australian Court trial of young aboriginal Max Stuart.
14. Bloody Sunday (2002)
A dramatization of the Irish civil rights protest march and subsequent massacre by British troops on January 30, 1972.
A former convict poses as a cop to retrieve a diamond he stole years ago.
16. Bucky Larson: Born to Be a Star (2011)
A kid from the Midwest moves out to Hollywood in order to follow in his parents footsteps, and become a porn star.
17. Charlotte's Web (1973)
Wilbur is a farm pig who's terrified that he'll end up on the dinner table. His friend Charlotte, a charming spider, comes to his rescue. She weaves words into her web, convincing the farmer that Wilbur is too special a pig to kill.
A working mother puts herself through law school in an effort to represent her brother, who has been wrongfully convicted of murder and has exhausted his chances to appeal his conviction through public defenders.
Horton Foote's story of a teen-aged boy in the Depression who finds work on an eccentric's sugar plantation and learns life's surprising lessons from the team of convicts who also work there.
Truckers form a mile-long "convoy" in support of a trucker's vendetta with an abusive sheriff - Based on the country song of the same title by C.W. McCall.
21. Desperate Measures (1998)
Frank Conner is an honest police officer who desperately needs to save his son's life. However, after losing all hope, he finds out that a criminal Peter McCabe in jail is his only savior.
22. Deuce Bigalow: European Gigolo (2005)
Deuce is tricked again into man-whoring by T.J., only in Amsterdam while other man-whores are being murdered in his midst.
A grieving doctor is being contacted by his deceased wife through his patients' near death experiences.
A young hot shot driver is in the middle of a championship season and is coming apart at the seams. A former CART champion is called in to give him guidance.
Cole Thornton, a gunfighter for hire, joins forces with old friend, Sheriff J.P. Hara. Together with an old Indian fighter and a gambler, they help a rancher and his family fight a rival rancher who's trying to steal their water.
To foil a terrorist plot, FBI agent Sean Archer assumes the identity of the criminal Castor Troy who murdered his son through facial transplant surgery, but the crook wakes up prematurely and vows revenge.
27. Fun in Acapulco (1963)
A yacht owner's spoiled daughter gets Mike fired, but a boy helps him get a job as singer at Acapulco Hilton etc. He upsets the lifeguard by taking his girl and 3 daily work hours. Mike's also seeing a woman bullfighter.
In a future mind-controlling game, death row convicts are forced to battle in a 'Doom'-type environment. Convict Kable, controlled by Simon, a skilled teenage gamer, must survive thirty sessions in order to be set free.
Maxwell Smart, a highly intellectual but bumbling spy working for the CONTROL agency, is tasked with preventing a terrorist attack from rival spy agency KAOS.
A trio of sisters bond over their ambivalence toward the approaching death of their curmudgeonly father, to whom none of them was particularly close.
A dog named Honey who runs group therapy sessions to help neighborhood animals manage the neuroses brought on by their owners and each other.
Honest and hard-working Texas rancher Homer Bannon has a conflict with his unscrupulous, selfish, arrogant and egotistical son Hud, who sank into alcoholism after accidentally killing his brother in a car crash.
John Berlin, a former Los Angeles homicide detective, investigates a multiple murder case in San Diego. The only witness is a blind girl to whom he is immediately attracted.
34. Jennifer's Body (2009)
A newly-possessed high-school cheerleader turns into a succubus who specializes in killing her male classmates. Can her best friend put an end to the horror?
A physical therapist falls for the basketball player she is helping recover from a career-threatening injury.
Director: Sanaa Hamri | Stars: Queen Latifah, Common, Paula Patton, James Pickens Jr.
Dave Lizewski is an unnoticed high school student and comic book fan who one day decides to become a superhero, even though he has no powers, training or meaningful reason to do so.
37. Kung Pow: Enter the Fist (2002)
A rough-around-the-edges martial arts master seeks revenge for his parents' death.
38. Last Chance Harvey (2008)
In London for his daughter's wedding, a rumpled man finds his romantic spirits lifted by a new woman in his life.
39. Little Women (1994)
The March sisters live and grow in post-Civil War America.
40. Once Upon a Crime... (1992)
Phoebe and a fellow American in Rome find a dog with a $5000 reward. They take a train to the owner in Monte Carlo. She turns up murdered. They run and become suspects just as 3 other Americans on the train.
41. Ordinary People (1980)
The accidental death of the older son of an affluent family deeply strains the relationships among the bitter mother, the good-natured father and the guilt-ridden younger son.
42. Places in the Heart (1984)
In central Texas in the 1930s, a widow with two small children tries to save her small 40-acre farm with the help of a blind boarder and an itinerant black handyman.
43. Primary Colors (1998)
A man joins the political campaign of a smooth-operator candidate for President of the United States of America.
44. Revolutionary Road (2008)
A young couple living in a Connecticut suburb during the mid-1950s struggle to come to terms with their personal problems while trying to raise their two children.
A rich young boy finds his family the target of an inside job, and must use his cunning to save them.
46. Rules of Engagement (2000)
An attorney defends an officer on trial for ordering his troops to fire on civilians after they stormed a U.S. embassy in a Middle Eastern country.
An ugly duckling having undergone a remarkable change, still harbors feelings for her crush: a carefree playboy, but not before his business-focused brother has something to say about it.
48. Savage State (2019)
When the American Civil War breaks out, a family of french settlers must abandon their Missouri home to flee and go back to Paris. They're escorted by a former mercenary whose troubled past soon catches up with him.
49. Saving Silverman (2001)
A pair of buddies conspire to save their best friend from marrying the wrong woman.
During the Cold War, the CIA orders free-lance operative Scorpio to assassinate his former CIA mentor Cross and a deadly cat-and-mouse game ensues.
In the 17th century, two Portuguese Jesuit priests travel to Japan in an attempt to locate their mentor, who is rumored to have committed apostasy, and to propagate Catholicism.
52. Slumdog Millionaire (2008)
A Mumbai teenager reflects on his life after being accused of cheating on the Indian version of "Who Wants to be a Millionaire?"
53. Small Fortune (2019)
Dermot O'Leary presents the world's smallest physical challenge show, as teams of three attempt to perform a series of seemingly simple challenges for cash prizes - but within a miniature prop of a famous place.
Michael flies up to French Canada to visit his girlfriend and her wacky family. She doesn't love him anymore, the grandma mistakes him for her late husband, the sister appears naked and makes advances, the dad likes to be naked as well.
55. Something's Gotta Give (2003)
A swinger on the cusp of being a senior citizen with a taste for young women falls in love with an accomplished woman closer to his age.
56. Soul Survivors (2001)
A college student is caught between the world of the living and the dead.
57. Still Waiting... (2009 Video)
Dennis is still waiting to progress to district manager from the restaurant where he works.
58. Sweeney Todd: The Demon Barber of Fleet Street (2007)
The legendary tale of a barber who returns from wrongful imprisonment to 1840s London, bent on revenge for the rape and death of his wife, and resumes his trade while forming a sinister partnership with his fellow tenant, Mrs. Lovett.
An FBI agent tries to catch a serial killer who kidnapped his son.
60. The Adventures of Tintin (2011)
Intrepid reporter Tintin and Captain Haddock set off on a treasure hunt for a sunken ship commanded by Haddock's ancestor.
61. The Big Chill (1983)
A group of seven former college friends gather for a weekend reunion at a South Carolina vacation home after the funeral of another of their college friends.
62. The Birdcage (1996)
A gay cabaret owner and his drag queen companion agree to put up a false straight front so that their son can introduce them to his fiancée's right-wing moralistic parents.
63. The Blair Witch Project (1999)
Three film students vanish after traveling into a Maryland forest to film a documentary on the local Blair Witch legend, leaving only their footage behind.
64. Book of Shadows: Blair Witch 2 (2000)
A group of tourists arrives in Burkittsville, Maryland after seeing The Blair Witch Project (1999) to explore the mythology and phenomenon, only to come face to face with their own neuroses and possibly the witch herself.
65. The Boondock Saints II: All Saints Day (2009)
The MacManus brothers are living a quiet life in Ireland with their father, but when they learn that their beloved priest has been killed by mob forces, they go back to Boston to bring justice to those responsible and avenge the priest.
Director: Troy Duffy | Stars: Sean Patrick Flanery, Norman Reedus, Billy Connolly, Clifton Collins Jr.
66. The Company You Keep (2012)
After a journalist discovers his identity, a former Weather Underground activist goes on the run.
Todd Anderson's life changes overnight when he signs a $30 million contract with the NBA. Determined not to forget who he is and where he's from, he throws a cookout for his family and friends from the hood, in his new neighborhood.
68. The Dark Knight (2008)
When the menace known as the Joker wreaks havoc and chaos on the people of Gotham, Batman must accept one of the greatest psychological and physical tests of his ability to fight injustice.
69. The Forbidden Kingdom (2008)
A discovery made by a kung fu obsessed American teen sends him on an adventure to ancient China, where he joins up with a band of martial arts warriors in order to free the imprisoned Monkey King.
70. The Full Monty (1997)
Six unemployed steel workers form a male striptease act. The women cheer them on to go for "the full monty" - total nudity.
An up-and-coming pool player plays a long-time champion in a single high-stakes match.
72. The Last House on the Left (2009)
After kidnapping and brutally assaulting two young women, a gang unknowingly finds refuge at a vacation home belonging to the parents of one of the victims: a mother and father who devise an increasingly gruesome series of revenge tactics.
73. The Long Goodbye (1973)
Private investigator Philip Marlowe helps a friend out of a jam, but in doing so gets implicated in his wife's murder.
74. The Love Letter (1999)
The life of a provincial town becomes stormy after the appearance of an anonymous love letter.
75. The Man Who Shot Liberty Valance (1962)
A senator returns to a Western town for the funeral of an old friend and tells the story of his origins.
A newspaper journalist discovers a homeless musical genius and tries to improve his situation.
77. The Time Machine (2002)
Hoping to alter the events of the past, a 19th century inventor instead travels 800,000 years into the future, where he finds humankind divided into two warring races.
A comedic look at the relationship between a wealthy man with quadriplegia and an unemployed man with a criminal record who's hired to help him.
A beautiful but naïve aspiring television personality films a documentary on teenagers with a darker ulterior motive.
Growing up poor in London, Becky Sharp defies her poverty-stricken background and ascends the social ladder alongside her best friend, Amelia Sedley.
Young employees at ShenaniganZ restaurant collectively stave off boredom and adulthood with their antics.
82. Walking Tall (1973)
Based on the life of Tennessee sheriff Buford Pusser, who almost single-handily cleaned up his small town of crime and corruption, but at a personal cost of his family life and nearly his own life.
The inseparable duo try to organize a rock concert while Wayne must fend off a record producer who has an eye for his girlfriend.
84. Weekend at Bernie's (1989)
Two idiots try to pretend that their murdered employer is really alive, leading the hitman to attempt to track him down to finish him off.
The turmoil in poet/playwright Oscar Wilde's life after he discovers his homosexuality.
86. Wings of Courage (1995)
While flying mail across the Andean mountains, Henri Guillaumet's plane has to crash-land, he must trek back to civilizatin on foot.
87. Witless Protection (2008)
When a small-town sheriff witnesses what he believes to be an attempted kidnapping, his effort to save the beautiful damsel in distress sets him down a wild path of comic mishap.
Soon after her divorce, a fiction writer returns to her home in small-town Minnesota, looking to rekindle a romance with her ex-boyfriend who is now happily married and has a newborn daughter.
89. America's Got Talent (2006– )
A weekly talent competition where an array of performers -- from singers and dancers, to comedians and novelty acts -- vie for a $1 million cash prize.
90. A Glitch in the Matrix (2021)
Documentary filmmaker Rodney Ascher tackles the question "are we living in a simulation?" with testimony, philosophical evidence and scientific explanation in his quest for the answer.
92. Night of the Kings (2020)
A young man is sent to "La Maca", a prison of Ivory Coast in the middle of the forest ruled by its prisoners. With the red moon rising, he is designated by the Boss to be the new "Roman" and must tell a story to the other prisoners.
Teams of two race to identify songs by sound in hopes of winning up to $1 million. Whoever wins the most $ gets to play the final round against Shazam - the show's computer. Actor Jamie Foxx and his daughter Corinne as DJ host the show.
94. The New York Times Presents (2020– )
A series of documentaries representing the unparalleled journalism and insight of The New York Times.
Follows the dramatic, suspenseful and sometimes humorous stories that flood 911 call centers.
A decades-long feud between two sheep farming brothers comes to a head when disaster strikes their flocks.
Contestants competing against a professional quizzer, known as the Chaser, whose aim is to prevent the contestants from winning a cash prize.
Three contestants claim to be a person with an unusual distinction or occupation. One is telling the truth, and the other two are impostors. Four celebrity panelists ask them questions to figure out who is telling the truth.
99. Legion of Brothers (2017)
100. The Bachelorette (2003– )
A single bachelorette dates multiple men over several weeks, narrowing them down to hopefully find her true love.
| english |
<reponame>chyzman/ctft
{
"criteria": {
"has_item": {
"trigger": "minecraft:inventory_changed",
"conditions": {
"items": [
{
"items": [
"minecraft:clock"
]
}
]
}
}
},
"requirements": [
[
"has_item"
]
],
"rewards": {
"recipes": [
"ctft:clock_sword_from_crafting",
"ctft:clock_pickaxe_from_crafting",
"ctft:clock_axe_from_crafting",
"ctft:clock_shovel_from_crafting",
"ctft:clock_hoe_from_crafting",
"ctft:clock_shield_from_crafting",
"ctft:clock_fishing_rod_from_crafting",
"ctft:clock_compass_from_crafting",
"ctft:clock_clock_from_crafting",
"ctft:clock_helmet_from_crafting",
"ctft:clock_chestplate_from_crafting",
"ctft:clock_leggings_from_crafting",
"ctft:clock_boots_from_crafting",
"ctft:clock_shears_from_crafting",
"ctft:clock_horse_armor_from_crafting",
"ctft:clock_bow_from_crafting",
"ctft:clock_crossbow_from_crafting",
"ctft:clock_block_from_material",
"ctft:clock_material_from_block",
"ctft:clock_stairs_from_crafting",
"ctft:clock_slab_from_crafting",
"ctft:clock_glass_pane_from_crafting",
"ctft:clock_pane_from_crafting",
"ctft:clock_glass_from_smelting",
"ctft:clock_stairs_from_stonecutter",
"ctft:clock_slab_from_stonecutter",
"ctft:clock_wall_from_stonecutter",
"ctft:clock_lever_from_crafting",
"ctft:clock_button_from_crafting",
"ctft:clock_pressure_plate_from_crafting",
"ctft:clock_fence_gate_from_crafting",
"ctft:clock_chain_from_stonecutter",
"ctft:clock_compressed1_from_block",
"ctft:clock_block_from_compressed1",
"ctft:clock_compressed1_from_block",
"ctft:clock_compressed2_from_compressed1",
"ctft:clock_compressed3_from_compressed2",
"ctft:clock_compressed4_from_compressed3",
"ctft:clock_compressed5_from_compressed4",
"ctft:clock_compressed6_from_compressed5",
"ctft:clock_compressed7_from_compressed6",
"ctft:clock_compressed8_from_compressed7",
"ctft:clock_compressed9_from_compressed8",
"ctft:clock_compressed10_from_compressed9",
"ctft:clock_compressed11_from_compressed10",
"ctft:clock_compressed12_from_compressed11",
"ctft:clock_compressed13_from_compressed12",
"ctft:clock_compressed14_from_compressed13",
"ctft:clock_compressed15_from_compressed14",
"ctft:clock_block_from_compressed1",
"ctft:clock_compressed1_from_compressed2",
"ctft:clock_compressed2_from_compressed3",
"ctft:clock_compressed3_from_compressed4",
"ctft:clock_compressed4_from_compressed5",
"ctft:clock_compressed5_from_compressed6",
"ctft:clock_compressed6_from_compressed7",
"ctft:clock_compressed7_from_compressed8",
"ctft:clock_compressed8_from_compressed9",
"ctft:clock_compressed9_from_compressed10",
"ctft:clock_compressed10_from_compressed11",
"ctft:clock_compressed11_from_compressed12",
"ctft:clock_compressed12_from_compressed13",
"ctft:clock_compressed13_from_compressed14",
"ctft:clock_compressed14_from_compressed15",
"ctft:clock_kcolb_from_stonecutter",
"ctft:clock_block_from_kcolb"
]
}
} | json |
<filename>package.json
{
"dependencies": {
"blessed": "^0.1.81",
"chalk": "^2.4.2",
"euphoria-color": "^1.0.2",
"euphoria.js": "^1.1.1"
},
"name": "eidola",
"description": "a TUI for euphoria and instant",
"version": "0.4.0",
"main": "index.js",
"directories": {
"lib": "lib",
"test": "test"
},
"scripts": {},
"repository": {
"type": "git",
"url": "git+https://github.com/kaliumxyz/eidola.git"
},
"author": "",
"license": "MIT",
"bugs": {
"url": "https://github.com/kaliumxyz/eidola/issues"
},
"homepage": "https://github.com/kaliumxyz/eidola#readme"
}
| json |
Hindi Dictionary. Devnagari to roman Dictionary. हिन्दी भाषा का सबसे बड़ा शब्दकोष। देवनागरी और रोमन लिपि में। एक लाख शब्दों का संकलन। स्थानीय और सरल भाषा में व्याख्या।
Mudki के पर्यायवाची:
Mudki, Mudki meaning in English. Mudki in english. Mudki in english language. What is meaning of Mudki in English dictionary? Mudki ka matalab english me kya hai (Mudki का अंग्रेजी में मतलब ). Mudki अंग्रेजी मे मीनिंग. English definition of Mudki. English meaning of Mudki. Mudki का मतलब (मीनिंग) अंग्रेजी में जाने। Mudki kaun hai? Mudki kahan hai? Mudki kya hai? Mudki kaa arth.
Hindi to english dictionary(शब्दकोश).मुदकी को अंग्रेजी में क्या कहते हैं.
इस श्रेणी से मिलते जुलते शब्द:
ये शब्द भी देखें:
synonyms of Mudki in Hindi Mudki ka Samanarthak kya hai? Mudki Samanarthak, Mudki synonyms in Hindi, Paryay of Mudki, Mudki ka Paryay, In “gkexams” you will find the word synonym of the Mudki And along with the derivation of the word Mudki is also given here for your enlightenment. Paryay and Samanarthak both reveal the same expressions. What is the synonym of Mudki in Hindi?
| english |
With an aim to make its public welfare schemes accessible to the tribals and forest dwellers, the Chhattisgarh government has conducted various programmes under the scheme 'Suposhan Abhiyan' in local languages in Bastar with the help of local artists here.
With an aim to make its public welfare schemes accessible to the tribals and forest dwellers, the Chhattisgarh government has conducted various programmes under the scheme 'Suposhan Abhiyan' in local languages in Bastar with the help of local artists here.
Various government schemes like Suchitan Abhiyan, Mukhyamantri Haat-Bazar Clinic Scheme, Narva, Garuva, Ghuruva Bari Yojana, etc are given importance during the programme where the artists will be disseminating information in local dialects.
Two months ago, as an experiment by the Public Relations Department of the state government, public welfare schemes of the Chhattisgarh government were publicized in about 90 villages of Bastar and Dantewada districts through local art groups.
After receiving positive results from the initiative, the schemes of the state government are now being disseminated in all the seven districts of Bastar division, through local Kalajathas in the local dialects of Halbi, Gondi, and Bhatri.
Programs have been designed in such a way so as to make the local people understand government schemes with the help of theatre and skit, local artists showcase local culture, tradition, dance.
The important information about public welfare schemes is being imparted to people in an interesting manner.
Under this, schemes are being disseminated in six districts of Bastar division in art markets at Basti, Dantewada, Bijapur, Sukma, Kondagaon and Narayanpur districts by art groups in Halbi and Gondi and in Chhattisgarhi in Kanker district. | english |
On April 27, 2019, violent, radical hate group “ANTIFA” disrupted a peaceful rally being held in my hometown of Huntington Beach. The rally was held to express support for legal immigration and stronger border control. Former Huntington Beach City Council Candidate Shayna Lathus stood alongside the masked domestic terrorists as they made threats, for more than an hour.
Eventually, numerous members of ANTIFA were arrested for violently attacking an innocent citizen, among other things. Throughout the entire event, as I witnessed, Lathus appeared not once to separate herself from the ANTIFA mob. When a local police officer was thrown from his horse, an ANTIFA member could be heard chanting, “Feed the horse, kill the pig!” (captured on video, along with much of Lathus’ behavior). Based on social media posts, she appeared to arrive and leave with ANTIFA organizer/sympathizer Victor Valladares, pictured above holding the bullhorn. She clearly seemed to be part of the operation which disrupted the city with unnecessary hate and violence. Today, Lathus’ close supporters in the private online group “Indivisible OC” were actually raising bail money for the ANTIFA arrestees. We call on City Councilwoman Kim Carr, who appointed Lathus to the post, to please remove her at once.
Lathus is heavily endorsed and financially supported by Congressman Harley Rouda and Ocean View School District Trustee Gina Clayton Tarvin, among many other local Democrats. What do they think of this behavior I wonder? Her associations with radical violent groups, while constitutionally protected, has no place in our local city government in my opinion.
I have spent my entire life in Huntington Beach. While we are an open, accepting community, we have standards we need to uphold. The Participation Advisory Board position is an important one, and deserves a more responsible, less extreme person than Shayna Lathus, whose radical associations have been well documented. Removing her will make a positive statement to the community that our local government has no place for this kind of radical behavior. Thank you for signing my petition.
| english |
{
"baseFontSize": 12,
"enabledCssSnippets": [
"clean-embeds"
],
"translucency": false,
"cssTheme": "Dark Moss"
} | json |
<filename>datasource-service/src/main/java/com/datasphere/datasource/connections/query/expression/NativeLikeExp.java<gh_stars>0
/*
* Apache License
*
* Copyright (c) 2020 HuahuiData
*
* 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 com.datasphere.datasource.connections.query.expression;
public class NativeLikeExp implements NativeExp{
private String columnName;
private String value;
private boolean caseInsensitive = false;
public NativeLikeExp(String columnName, String value){
this.columnName = columnName;
this.value = value;
}
public NativeLikeExp(String columnName, String value, boolean caseInsensitive){
this.columnName = columnName;
this.value = value;
this.caseInsensitive = caseInsensitive;
}
@Override
public String toSQL(String implementor) {
if(caseInsensitive){
return "LOWER(" + NativeProjection.getQuotedColumnName(implementor, columnName) + ") LIKE '%" + value.toLowerCase() + "%'";
} else {
return NativeProjection.getQuotedColumnName(implementor, columnName) + " LIKE '%" + value + "%'";
}
}
}
| java |
package org.voovan.test.http.router;
import java.lang.annotation.ElementType;
import java.lang.annotation.Retention;
import java.lang.annotation.RetentionPolicy;
import java.lang.annotation.Target;
/**
* 类文字命名
*
* @author: helyho
* Voovan Framework.
* WebSite: https://github.com/helyho/Voovan
* Licence: Apache v2 License
*/
@Target(ElementType.TYPE)
@Retention(RetentionPolicy.RUNTIME)
public @interface TestAnnotation {
}
| java |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.