text stringlengths 1 1.04M | language stringclasses 25 values |
|---|---|
<gh_stars>100-1000
const { registerSuite } = intern.getPlugin('jsdom');
const { assert } = intern.getPlugin('chai');
import { stub, spy, SinonSpy } from 'sinon';
import { NodeHandler } from './../../../../src/core/NodeHandler';
import global from '../../../../src/shim/global';
import WidgetBase from '../../../../src/core/WidgetBase';
import Intersection from '../../../../src/core/meta/Intersection';
let intersectionObserver: any;
let bindInstance: WidgetBase;
const observers: ([object, Function])[] = [];
let normal = true;
let observeStub: any;
let globalIntersectionObserver: any;
registerSuite('meta - Intersection', {
async before() {
globalIntersectionObserver = global.IntersectionObserver;
bindInstance = new WidgetBase();
observeStub = stub();
intersectionObserver = stub().callsFake(function(callback: any) {
if (normal) {
const observer = {
observe: stub(),
takeRecords: stub().returns([]),
disconnect: spy()
};
observers.push([observer, callback]);
return observer;
} else {
const observer = {
observe: observeStub,
takeRecords: stub().returns([])
};
observers.push([observer, callback]);
return observer;
}
});
global.IntersectionObserver = intersectionObserver;
},
afterEach() {
normal = true;
observeStub.resetHistory();
intersectionObserver.resetHistory();
observers.length = 0;
},
after() {
global.IntersectionObserver = globalIntersectionObserver;
},
tests: {
has: {
'no intersection'() {
const nodeHandler = new NodeHandler();
const intersection = new Intersection({
invalidate: () => {},
nodeHandler,
bind: bindInstance
});
const hasIntersectionInfo = intersection.has('root');
assert.isFalse(hasIntersectionInfo);
},
'no intersection with options'() {
const nodeHandler = new NodeHandler();
const intersection = new Intersection({
invalidate: () => {},
nodeHandler,
bind: bindInstance
});
const hasIntersectionInfo = intersection.has('root', { root: 'root' });
assert.isFalse(hasIntersectionInfo);
},
'with intersection'() {
const nodeHandler = new NodeHandler();
const intersection = new Intersection({
invalidate: () => {},
nodeHandler,
bind: bindInstance
});
const element = document.createElement('div');
nodeHandler.add(element, 'root');
intersection.get('root');
const [observer, callback] = observers[0];
callback(
[
{
target: element,
intersectionRatio: 0.1,
isIntersecting: true
}
],
observer
);
const hasIntersectionInfo = intersection.has('root');
assert.isTrue(hasIntersectionInfo);
}
},
get: {
intersections() {
const nodeHandler = new NodeHandler();
const onSpy = spy(nodeHandler, 'on');
const intersection = new Intersection({
invalidate: () => {},
nodeHandler,
bind: bindInstance
});
intersection.get('root');
assert.isTrue(onSpy.calledOnce);
assert.isTrue(onSpy.firstCall.calledWith('root'));
},
'intersections with number key'() {
const nodeHandler = new NodeHandler();
const onSpy = spy(nodeHandler, 'on');
const intersection = new Intersection({
invalidate: () => {},
nodeHandler,
bind: bindInstance
});
intersection.get(1234);
assert.isTrue(onSpy.calledOnce);
assert.isTrue(onSpy.firstCall.calledWith('1234'));
},
'intersection calls invalidate when node available'() {
const nodeHandler = new NodeHandler();
const onSpy = spy(nodeHandler, 'on');
const invalidateStub = stub();
const intersection = new Intersection({
invalidate: invalidateStub,
nodeHandler,
bind: bindInstance
});
intersection.get('root');
assert.isTrue(onSpy.calledOnce);
assert.isTrue(onSpy.firstCall.calledWith('root'));
const element = document.createElement('div');
nodeHandler.add(element, 'root');
assert.isTrue(invalidateStub.calledOnce);
onSpy.resetHistory();
intersection.get('root');
assert.isFalse(onSpy.called);
},
'intersections calls invalidate when node observer fires'() {
const nodeHandler = new NodeHandler();
const onSpy = spy(nodeHandler, 'on');
const invalidateStub = stub();
const intersection = new Intersection({
invalidate: invalidateStub,
nodeHandler,
bind: bindInstance
});
intersection.get('root');
assert.isTrue(onSpy.calledOnce);
assert.isTrue(onSpy.firstCall.calledWith('root'));
const element = document.createElement('div');
nodeHandler.add(element, 'root');
assert.isTrue(invalidateStub.calledOnce);
onSpy.resetHistory();
intersection.get('root');
assert.isFalse(onSpy.called);
const [observer, callback] = observers[0];
callback(
[
{
target: element,
intersectionRatio: 0.1,
isIntersecting: true
}
],
observer
);
assert.isTrue(invalidateStub.calledTwice);
const result = intersection.get('root');
assert.deepEqual(result, { intersectionRatio: 0.1, isIntersecting: true });
callback(
[
{
target: element,
intersectionRatio: 0.1,
isIntersecting: false
}
],
observer
);
assert.isTrue(invalidateStub.calledThrice);
const resultTwo = intersection.get('root');
assert.deepEqual(resultTwo, { intersectionRatio: 0.1, isIntersecting: false });
},
'intersections calls waits for root node before invalidating'() {
const nodeHandler = new NodeHandler();
const onSpy = spy(nodeHandler, 'on');
const invalidateStub = stub();
const intersection = new Intersection({
invalidate: invalidateStub,
nodeHandler,
bind: bindInstance
});
intersection.get('foo', { root: 'root' });
assert.isTrue(onSpy.calledOnce);
assert.isTrue(onSpy.firstCall.calledWith('root'));
const element = document.createElement('div');
nodeHandler.add(element, 'foo');
assert.isTrue(invalidateStub.notCalled);
const root = document.createElement('div');
nodeHandler.add(root, 'root');
assert.isTrue(invalidateStub.calledOnce);
intersection.get('foo', { root: 'root' });
assert.isTrue(intersectionObserver.calledOnce);
assert.strictEqual(intersectionObserver.firstCall.args[1].root, root);
assert.lengthOf(observers, 1);
const [observer, callback] = observers[0];
callback(
[
{
target: element,
intersectionRatio: 0.1,
isIntersecting: true
}
],
observer
);
assert.isTrue(invalidateStub.calledTwice);
const result = intersection.get('foo', { root: 'root' });
assert.deepEqual(result, { intersectionRatio: 0.1, isIntersecting: true });
},
'observers are cached for details'() {
const nodeHandler = new NodeHandler();
const intersection = new Intersection({
invalidate: () => {},
nodeHandler,
bind: bindInstance
});
const root = document.createElement('div');
nodeHandler.add(root, 'foo');
nodeHandler.add(root, 'root');
intersection.get('foo');
assert.lengthOf(observers, 1);
intersection.get('foo', { root: 'root' });
assert.lengthOf(observers, 2);
intersection.get('foo');
assert.lengthOf(observers, 2);
intersection.get('foo', { root: 'root' });
assert.lengthOf(observers, 2);
},
'observing multiple elements with the same root'() {
const nodeHandler = new NodeHandler();
normal = false;
const intersection = new Intersection({
invalidate: () => {},
nodeHandler,
bind: bindInstance
});
const root = document.createElement('div');
const bar = document.createElement('div');
nodeHandler.add(root, 'foo');
nodeHandler.add(bar, 'bar');
nodeHandler.add(root, 'baz');
nodeHandler.add(root, 'root');
intersection.get('foo');
assert.lengthOf(observers, 1);
assert.equal(observeStub.callCount, 1, 'Should have observed node');
intersection.get('foo', { root: 'root' });
assert.equal(observeStub.callCount, 2, 'Should have observed node with different options');
assert.lengthOf(observers, 2);
intersection.get('bar');
assert.equal(observeStub.callCount, 3, 'Should have observed new node');
assert.lengthOf(observers, 2);
intersection.get('bar', { root: 'root' });
assert.lengthOf(observers, 2);
assert.equal(observeStub.callCount, 4, 'Should have observed new node with different options');
intersection.get('bar', { root: 'root' });
intersection.get('bar');
intersection.get('foo');
intersection.get('foo', { root: 'root' });
assert.lengthOf(observers, 2);
assert.equal(observeStub.callCount, 4, 'Should not have observed the same nodes again');
},
'observation should be based on node, not key'() {
const nodeHandler = new NodeHandler();
normal = false;
const intersection = new Intersection({
invalidate: () => {},
nodeHandler,
bind: bindInstance
});
const root = document.createElement('div');
nodeHandler.add(root, 'foo');
nodeHandler.add(root, 'baz');
nodeHandler.add(root, 'root');
intersection.get('foo');
assert.lengthOf(observers, 1);
assert.equal(observeStub.callCount, 1, 'Should have observed node');
intersection.get('foo', { root: 'root' });
assert.equal(observeStub.callCount, 2, 'Should have observed node with different options');
assert.lengthOf(observers, 2);
intersection.get('baz');
assert.equal(observeStub.callCount, 2, 'Should not have observed with the same node and options');
assert.lengthOf(observers, 2);
intersection.get('baz', { root: 'root' });
assert.equal(observeStub.callCount, 2, 'Should not have observed with the same node and options');
assert.lengthOf(observers, 2);
},
destroy() {
const nodeHandler = new NodeHandler();
const intersection = new Intersection({
invalidate: () => {},
nodeHandler,
bind: bindInstance
});
const root = document.createElement('div');
nodeHandler.add(root, 'root');
intersection.get('root');
intersection.destroy();
const [observer]: [{ disconnect: SinonSpy }] = observers[0] as any;
assert.isTrue(observer.disconnect.calledOnce);
assert.isTrue(observer.disconnect.calledOn(observer));
}
}
}
});
| typescript |
use libcoinche::{pos, bid, cards};
use {EventType, ContractBody, CardBody};
pub mod http;
mod client;
pub use self::client::Client;
pub enum AuctionAction {
Leave,
Pass,
Coinche,
Bid((cards::Suit, bid::Target)),
}
pub enum GameAction {
Leave,
PlayCard(cards::Card),
}
/// Any frontend mush have these global callbacks
pub trait Frontend<B: Backend> {
fn show_error(&mut self, error: B::Error);
fn unexpected_event(&mut self, event: EventType);
fn party_cancelled(&mut self, msg: &str);
fn show_card_played(&mut self, pos: pos::PlayerPos, card: cards::Card);
fn show_trick_over(&mut self, winner: pos::PlayerPos);
fn ask_card(&mut self) -> GameAction;
fn ask_bid(&mut self) -> AuctionAction;
fn game_over(&mut self, points: [i32; 2], winner: pos::Team, scores: [i32; 2]);
fn show_pass(&mut self, pos: pos::PlayerPos);
fn show_coinche(&mut self, pos: pos::PlayerPos);
fn show_bid(&mut self, pos: pos::PlayerPos, suit: cards::Suit, target: bid::Target);
/// Auction cancelled, back to the start.
fn auction_cancelled(&mut self);
/// Auction is complete, we can play now!
fn auction_over(&mut self, contract: &bid::Contract);
fn start_game(&mut self, first: pos::PlayerPos, hand: cards::Hand);
}
pub trait Backend {
type Error;
/// Wait for the next event and return it.
fn wait(&mut self) -> Result<EventType, Self::Error>;
/// Make a bid offer.
///
/// Return the event caused by the action.
fn bid(&mut self, contract: ContractBody) -> Result<EventType, Self::Error>;
/// Pass during auction.
///
/// Return the event caused by the action.
fn pass(&mut self) -> Result<EventType, Self::Error>;
fn coinche(&mut self) -> Result<EventType, Self::Error>;
fn play_card(&mut self, card: CardBody) -> Result<EventType, Self::Error>;
}
| rust |
<filename>validator/src/test/java/io/adminshell/aas/v3/model/validator/TestAASd_65a.java
package io.adminshell.aas.v3.model.validator;
import io.adminshell.aas.v3.model.*;
import io.adminshell.aas.v3.model.impl.*;
import org.junit.Ignore;
import org.junit.Test;
import java.util.ArrayList;
import java.util.Arrays;
/**
* Tests the following constraint:
* <p>
* <i> If the semanticId of a Property references a ConceptDescription with the category VALUE
* then the value of the property is identical to DataSpecificationIEC61360/value and the valueId of
* the property is identical to DataSpecificationIEC61360/valueId. </i>
* </p>
*
* @author bader, chang
*
*/
public class TestAASd_65a {
@Ignore
@Test
public void missmatchingValueAndValueId() throws ValidationException {
Property pr = new DefaultProperty.Builder()
.idShort("idShort")
.value("the value of property")
.valueId(new DefaultReference.Builder()
.key(new DefaultKey.Builder()
.value("DataSpecificationIEC61360")
.idType(KeyType.CUSTOM)
.type(KeyElements.GLOBAL_REFERENCE)
.build())
.build())
.valueType("the type of value")
.semanticId(new DefaultReference.Builder()
.key(new DefaultKey.Builder()
.idType(KeyType.IRI)
.value("https://admin-shell.io/DataSpecificationTemplates/DataSpecificationIEC61360/3/0/RC01/DataTypeIEC61360")
.type(KeyElements.CONCEPT_DESCRIPTION)
.build())
.build())
.build();
DataSpecificationIEC61360 ds = new DefaultDataSpecificationIEC61360.Builder()
.dataType(DataTypeIEC61360.STRING_TRANSLATABLE) // This should be DataTypeIEC61360.STRING_TRANSLATABLE
.preferredName(new LangString("Data Specification", "en"))
.definition(new LangString("A definition of a STRING_TRANSLATABLE in English.", "en"))
.value("the value")
.valueId(new DefaultReference.Builder().
key(new DefaultKey.Builder()
.value("DataSpecificationIEC61360")
.idType(KeyType.CUSTOM)
.type(KeyElements.GLOBAL_REFERENCE)
.build())
.build())
.build();
EmbeddedDataSpecification embeddedDataSpecification = new DefaultEmbeddedDataSpecification.Builder()
.dataSpecificationContent(ds)
.dataSpecification( ConstraintTestHelper.createDummyReference() )
.build();
ConceptDescription cd = ConstraintTestHelper.createConceptDescription("Concept-Description", "http://example.org/MultilanguageCD", "constant");
cd.setCategory("VALUE");
cd.setEmbeddedDataSpecifications(new ArrayList<>(){{ add(embeddedDataSpecification) ; }} );
Submodel submodel = new DefaultSubmodel.Builder()
.idShort("submodel_idShort")
.identification(new DefaultIdentifier.Builder().identifier("http://example.org/TestSubmodel").idType(IdentifierType.IRI).build())
.submodelElements(new ArrayList<>() {{add(pr);}})
.build();
AssetAdministrationShellEnvironment assetAdministrationShellEnvironment = ConstraintTestHelper
.createEnvironment(
submodel,
new ArrayList<>() {{add(cd);}}
);
ShaclValidator.getInstance().validate(assetAdministrationShellEnvironment);
}
@Ignore
@Test
public void matchingValueAndValueId() throws ValidationException {
Property pr = new DefaultProperty.Builder()
.idShort("idShort")
.value("the value of Property value")
.valueId(new DefaultReference.Builder()
.key(new DefaultKey.Builder()
.value("DataSpecificationIEC61360")
.idType(KeyType.CUSTOM)
.type(KeyElements.GLOBAL_REFERENCE)
.build())
.build())
.valueType("the value type")
.semanticId(new DefaultReference.Builder()
.key(new DefaultKey.Builder()
.idType(KeyType.IRI)
.value("https://admin-shell.io/DataSpecificationTemplates/DataSpecificationIEC61360/3/0/RC01/DataTypeIEC61360")
.type(KeyElements.CONCEPT_DESCRIPTION)
.build())
.build())
.build();
DataSpecificationIEC61360 ds = new DefaultDataSpecificationIEC61360.Builder()
.dataType(DataTypeIEC61360.STRING_TRANSLATABLE) // This should be DataTypeIEC61360.STRING_TRANSLATABLE
.preferredName(new LangString("Data Specification", "en"))
.definition(new LangString("A definition of a STRING_TRANSLATABLE in English.", "en"))
.value("the value of Property value")
.valueId(new DefaultReference.Builder().
key(new DefaultKey.Builder()
.value("DataSpecificationIEC61360")
.idType(KeyType.CUSTOM)
.type(KeyElements.GLOBAL_REFERENCE)
.build())
.build())
.build();
EmbeddedDataSpecification embeddedDataSpecification = new DefaultEmbeddedDataSpecification.Builder()
.dataSpecificationContent(ds)
.dataSpecification( ConstraintTestHelper.createDummyReference() )
.build();
ConceptDescription cd = ConstraintTestHelper.createConceptDescription("Concept-Description", "http://example.org/MultilanguageCD", "constant");
cd.setCategory("VALUE");
cd.setEmbeddedDataSpecifications(new ArrayList<>(){{ add(embeddedDataSpecification) ; }} );
Submodel submodel = new DefaultSubmodel.Builder()
.idShort("submodel_idShort")
.identification(new DefaultIdentifier.Builder().identifier("http://example.org/TestSubmodel").idType(IdentifierType.IRI).build())
.submodelElements(new ArrayList<>() {{add(pr);}})
.build();
AssetAdministrationShellEnvironment assetAdministrationShellEnvironment = ConstraintTestHelper
.createEnvironment(
submodel,
new ArrayList<>() {{add(cd);}}
);
ShaclValidator.getInstance().validate(assetAdministrationShellEnvironment);
}
} | java |
1 Póól pini dê Sailas Ndêêpi taa knopwo, u kuwó dini ghi ngê Lisitîda lee knopwo. Yesu u yoo vy꞉o pini ngmê, y꞉i doo ya, u pi Timoti, u pye Nju pyââ, Yesu u yoo vy꞉o mye ghê wo. U mî daa Nju pi, ngmênê Kîdiki pi. * 2 Tim 1:5 2 Yesu u yoo yélini doo kwo Lisitîda p꞉aani dê Yikóniyêm, apê, Timoti k꞉uuchêm u pi. * Pilipay 2:19-22 3 Póól ngê u yi doo kwo, Timoti nî ńuw꞉o, wod꞉oo Chóó Lémi u l꞉ii p꞉uu t꞉ângo, Nju pi ngê u ngwo pyódu ngê, mu kópu u dîy꞉o p꞉aani p꞉aani Nju tpémi yi lama doo ya, Timoti u mî Kîdiki pi, tp꞉oo p꞉uu Chóó Lémi u l꞉ii daa t꞉ângo. * Nkal 2:3-5 4 P꞉aani p꞉aani lee dniye, kópuni Yesu u dyépi knî y꞉oo Njedusalem a d꞉êê ngópu, yi kópu Yesu u yoo ye dnyimon꞉aa tpapê, yepê, Ala kópu dyuu dmyinê chââchââ dé. * Dpodo 15:23-29 5 Wod꞉oo p꞉aani p꞉aani Yesu u yoo wêdêwêdê ngê pyaa dniye, yilî ngê yinté doo pyodopyodo.
6 Póól u pyipe dê yi k꞉ii Pîdichiya Wee Nkalásiya Wee yi kêlî ghê lee dniye. Ésiya Wee u kwo daa nî dniye, mu kópu u dîy꞉o Chóó Lémi u Ghê Dmi ngê u yi dêpwo kwo, Esiya Wee u kwo Yesu u kópu p꞉uu dny꞉oon꞉aa danê. 7 Dini ghi n꞉ii ngê Misiya Wee u nkîgh꞉ê taa dniye, u yi y꞉e doo kwo, Mbitiniya Wee u kwo nmî lee dmi, ngmênê Yesu u Ghê Dmi ngê yi kópu ye kwódu ngê. 8 Wod꞉oo Misiya Wee mwada pee lee dniye, Tîdówas mî taa dniye, ntii chedê kwéli noo ya. 9 Mgîdî ngmê ngê Póól até doo wóó, u wóó k꞉oo Másîdóniya pi ngmê módu, apê, Mu kwo. Yi pini Póól ka ngêpê mbê wo, kwo, Másîdóniya dpo pwiyé, dp꞉uu ngee nmédi. 10 Dini ghi n꞉ii ngê Póól a pii wo, wóó nmo yedê nté ngê, wod꞉oo ala kópu noko nmî vyu, Másîdóniya lee kmêle, mu kópu u dîy꞉o Chóó Lémi ngê u yi a kwo, A kópu mb꞉aa yi yéli ye ngmênyi vyi y꞉e.
16 Wo ngmê ngê ngêpê têdê até nmî lee dniye, maa p꞉uu dpodo módó ngmênmî módu. Yi pyópu ngê u kmêna ngmêdoo kwo. Yi kmêna ngê yi dmââdî pi knî yi kpeede ngê pyódu ngê, u kwo dpîmo tpapê, kópu, Mu dini ghi ngê wu kópu wa pyódu. Pini n꞉ii knî yi p꞉uu yi dmââdî wâpu dpîmo dpodo, yi yéli y꞉oo ndapî ndîî dnyimo kmênêkmênê, dini ghi n꞉ii ngê yi dmââdî ngê pi knî ye dpîmo tpapê, yipu, Mu dini ghi ngê wu kópu wa pyódu. 17 Póól u k꞉ii nmîmo paa, yi dmââdî ngê myedpîmo yâmuyâmu nmo, pi knî ye dpîmo kââ, yipu, Kî tpóknî u dîghê yâpwo p꞉uu a dpodo té. Yipu, Nmyi Mbwámê ngê pini n꞉ii pyodo, u kópu vyîlo nmye ka tpapê ngmê. * Mak 1:24 18 Wo yilî yi k꞉oo yi dmââdî nmî kuwó dpîmo a kââ, u kuwó dini ghi ngê Póól mbodo l꞉âmo a ngêpa wo, yi dmââdî ka diyé wo, yi kmêna ka kwo, Yesu Kédisu u pi ngê ṉga d꞉a mbwólu, Ye dmââdî a kuwo ngi, wod꞉oo kmêna ngê yi dmââdî a kuwo ngê. * Mak 16:17 19 Dini ghi n꞉ii ngê yi dmââdî u kada pini knî y꞉oo a w꞉ee ngópu, apê, Wod꞉oo ndapî daamunmî kmênê, wod꞉oo Póól pini dê Sailas mgîmî dumo, kóté têdê ńuw꞉o dumo. 20 Yi p꞉aani u kada pini dê ye yepê, Kî tpódu Nju pi dê, nmî némi dmi dê dyênê ngmê. 21 Yepê, Kî tpódu y꞉oo l꞉êê ghi kamî p꞉uu ka ndiye kîgha nmo, lémi ghi n꞉ii nmî kn꞉ââ knî y꞉oo nmo kwódu tumo. Yepê, Nmo Lóma tpémi, doo u ntââ yi lémi ghi p꞉uu daanmî ndiye. 22 Pi yilî yintómu y꞉e a kââdî wo, Póól pini dê Sailas yi p꞉uu dnye d꞉uu. Yi p꞉aani u kada pini dê y꞉oo lede knî ye yepê, Mgîmî dóó, yi kpîdî dê yi mbwo dpo chaa dóó, kpêê ghi ngê dpî kpaka dóó. * 2 Kódin 11:25; Pilipay 1:30; 1 Tes 2:2 23 Wod꞉oo lede knî y꞉oo dpodombiy꞉e kpaka dumo, mbwa k꞉oo km꞉êê dumo, mbwa y꞉enê pyu ka kwo, Mb꞉aamb꞉aa ngê chi y꞉enê dê. Kwo, Kîngê pwii knî. 24 Yi kópu u l꞉êê dîy꞉o mbwa y꞉enê pyu ngê d꞉omo yu kn꞉ââ u mênê mênê kuwo doo, yi kpâlî páádi knî yi pââ ghi dê yi kêlî yé tumo.
25 K꞉omo tpile Póól pini dê Sailas dpîmo mgînî vyîmî, ngmênê mgîdî ńuknîńuknî p꞉uu Chóó Lémi ka dpîmo ngêpê, myedpîmo wéti. Yélini mbwa k꞉oo doo kwo, yi yéli y꞉oo myednye ng꞉aang꞉aa dê. 26 Wod꞉oo têpê doo ghêdê, mbwa dpodombiy꞉e myedoo ghêdê, keńe yintómu kpêmî too, puwóma té mînê ghay dniye, yélini mbwa k꞉oo dnye kwo u ntââ pî pwii dniye, ngmênê daa pwii dniye. 27 Mbwa y꞉enê pyu yi nyaa wo, apê, Keńe dmi lukwe ngê mêdê kpêmî? Apê ngmênê, Pi yintómu dê mbêpê. Wod꞉oo u taa u paa a mbywongo, u yi u ngwo doo kwo, A chóóchóó nî vy꞉a. 28 Póól u kwo adî mbwólu, kwo, Apuu! Kwo, Ṉ́yóóchóó kidingê vy꞉a. Kwo, Nmo yintómu anmî pyede té. 29 Mbwa y꞉enê pyu ngê pi ngmê ka kwo, Lam ngma a ńuw꞉e, wod꞉oo mbwa k꞉oo kee wo, Póól pini dê Sailas yi kêmatâmo dyimê wo, doo nkîngê. 30 Wod꞉oo pw꞉ii doo, yepê, A lémi dê, ló kópu ngmanî d꞉uu, dpî yâpwo ngê u nkwo wa ngee nê? 31 Yi tpódu y꞉oo kwo, Nmî Lémi Yesu ka chi kêlîmî, u l꞉êê dîy꞉o wa ngee ngi, yélini m̱꞉uu a t꞉a, wamye ngee té. 32 Wod꞉oo nmî Lémi u kópu p꞉uu u kwo dpîmo danêmbum, u kpâm ghee knî mye yi k꞉ii. 33 Yi mgîdî ngê yi pini ngê Póól pini dê Sailas yi kpadama mbwómtyé adî ghêê té, wod꞉oo Póól ngê Yesu u pi ngê yi pini mupwoknî yi mbêmê mbwaa adî yé. * Dpodo 16:15 34 Wod꞉oo yi pini ngê yi tpódu u ngomo k꞉oo adî ńuw꞉o dê, ad꞉uu mbono dê. Yi pini mupwoknî y꞉oo w꞉aa a pyw꞉ee ngópu, mu kópu u dîy꞉o yi ngwo Chóó Lémi ka kêlîmî mbê dniye.
35 Womumo mw꞉aandiye yi p꞉aani u kada pini dê y꞉oo lede knî ye yepê, Nju pi dê nye pw꞉ii dóó. 36 Lede knî y꞉oo mbwa y꞉enê pyu ka yi kópu mî vyi ngópu, wod꞉oo yi pini ngê Póól ka kwo, Kada pini dê y꞉oo ala kópu da vyi ngmê, Nju pi dê nye pw꞉ii dóó. Póól ka kwo, Pwii choo, kwo, mb꞉aamb꞉aa ngê mîchoo lêpî. 37 Ngmênê Póól ngê lede knî ye yepê, Lóma u pi nyi p꞉uu a t꞉a, lukwe dîy꞉o nmyi kpaka nyo. Yepê, K꞉omo tpile pi knî y꞉oo yipe nyo, kada pini dê y꞉oo dnyinté mye kóté kalê nyo, ngmênê pi yintómu yi ngîma nmyi kpaka nyo, mbwa k꞉oo módu my꞉ee km꞉êê nyo. Yepê, Kada pini dê y꞉oo yi chóó paa pw꞉ii nyo. * Dpodo 22:25 38 Lede knî y꞉oo yi kópu kada pini dê ye dini ghi n꞉ii ngê vyi ngópu, wod꞉oo nkîngê mbê knopwo, apê, Nyi lama daa ya, Yi tpódu nyo ntee pini dê, Lóma u pi yi p꞉uu mye t꞉a. Apê, Yinté pini módu pi d꞉uudpî kpaka. 39 Yi kópu u l꞉êê dîy꞉o kada pini dê mbwa chedê yi chóó lee knopwo, Póól pini dê Sailas ye mb꞉aamb꞉aa mîmê y꞉ee ngópu, mbwa k꞉oo yi chóó mê pw꞉ii dumo, yepê, Nyi lémi dê, U ntââ ala p꞉aani mb꞉aamb꞉aa ngê wadpo kuwo ngmê. 40 Póól pini dê Sailas y꞉oo mbwa a kuwo ngópu, Lidiya u p꞉aa pee lee knopwo, u ngomo k꞉oo mî kee knopwo, Yesu u yoo y꞉i mî m꞉uu tumo, y꞉imê mê wêdêwêdê kalê tumo, yed꞉oo lee knopwo.
| english |
{
"name": "LOAD",
"symbol": "LOAD",
"id": "0xa883E72c12473DeD50A5FbfFA60E4000fa5FE3C8",
"decimals": 8,
"coingecko_url": "https://www.coingecko.com/en/coins/load-network",
"market_cap_usd": 0.0,
"market_cap_rank": null,
"24_hr_volume_usd": 0.0,
"logoURI": "https://raw.githubusercontent.com/poolsharks-protocol/token-metadata/master/blockchains/ethereum/assets/0xa883E72c12473DeD50A5FbfFA60E4000fa5FE3C8/logo.png"
} | json |
<gh_stars>0
<p>You are given an <code>m x n</code> matrix of characters <code>box</code> representing a side-view of a box. Each cell of the box is one of the following:</p>
<ul>
<li>A stone <code>'#'</code></li>
<li>A stationary obstacle <code>'*'</code></li>
<li>Empty <code>'.'</code></li>
</ul>
<p>The box is rotated <strong>90 degrees clockwise</strong>, causing some of the stones to fall due to gravity. Each stone falls down until it lands on an obstacle, another stone, or the bottom of the box. Gravity <strong>does not</strong> affect the obstacles' positions, and the inertia from the box's rotation <strong>does not </strong>affect the stones' horizontal positions.</p>
<p>It is <strong>guaranteed</strong> that each stone in <code>box</code> rests on an obstacle, another stone, or the bottom of the box.</p>
<p>Return <em>an </em><code>n x m</code><em> matrix representing the box after the rotation described above</em>.</p>
<p> </p>
<p><strong>Example 1:</strong></p>
<p><img alt="" src="https://assets.leetcode.com/uploads/2021/04/08/rotatingtheboxleetcodewithstones.png" style="width: 300px; height: 150px;" /></p>
<pre>
<strong>Input:</strong> box = [["#",".","#"]]
<strong>Output:</strong> [["."],
["#"],
["#"]]
</pre>
<p><strong>Example 2:</strong></p>
<p><img alt="" src="https://assets.leetcode.com/uploads/2021/04/08/rotatingtheboxleetcode2withstones.png" style="width: 375px; height: 195px;" /></p>
<pre>
<strong>Input:</strong> box = [["#",".","*","."],
["#","#","*","."]]
<strong>Output:</strong> [["#","."],
["#","#"],
["*","*"],
[".","."]]
</pre>
<p><strong>Example 3:</strong></p>
<p><img alt="" src="https://assets.leetcode.com/uploads/2021/04/08/rotatingtheboxleetcode3withstone.png" style="width: 400px; height: 218px;" /></p>
<pre>
<strong>Input:</strong> box = [["#","#","*",".","*","."],
["#","#","#","*",".","."],
["#","#","#",".","#","."]]
<strong>Output:</strong> [[".","#","#"],
[".","#","#"],
["#","#","*"],
["#","*","."],
["#",".","*"],
["#",".","."]]
</pre>
<p> </p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>m == box.length</code></li>
<li><code>n == box[i].length</code></li>
<li><code>1 <= m, n <= 500</code></li>
<li><code>box[i][j]</code> is either <code>'#'</code>, <code>'*'</code>, or <code>'.'</code>.</li>
</ul> | html |
{
"name": "jquery-noty",
"filename": "jquery.noty.min.js",
"description": "noty is a jQuery plugin that makes it easy to create alert - success - error - warning - information - confirmation messages as an alternative the standard alert dialog. Each notification is added to a queue. (Optional)",
"homepage": "http://needim.github.com/noty/",
"keywords": [
"notifications",
"alert",
"dialog",
"noty"
],
"repository": {
"type": "git",
"url": "https://github.com/needim/noty"
},
"license": "MIT",
"autoupdate": {
"source": "npm",
"target": "noty",
"fileMap": [
{
"basePath": "js/noty",
"files": [
"**/*"
]
}
]
},
"authors": [
{
"name": "<NAME>",
"url": "https://github.com/needim/"
}
]
}
| json |
[{"id":7,"time":1606360987,"name":"Sud52","content":"NOW I CANT FUCKING CHAT!","img":"uploads\/avatars\/thisisaavatarshutup.jpg"},{"id":8,"time":1606361009,"name":"Sud52","content":"omg","img":"uploads\/avatars\/thisisaavatarshutup.jpg"},{"id":9,"time":1606361012,"name":"Sud52","content":"hi","img":"uploads\/avatars\/thisisaavatarshutup.jpg"},{"id":10,"time":1606361122,"name":"Sud52","content":"furiouschat is dead lmoa","img":"uploads\/avatars\/thisisaavatarshutup.jpg"},{"id":11,"time":1606361123,"name":"Sud52","content":"lmao","img":"uploads\/avatars\/thisisaavatarshutup.jpg"},{"id":12,"time":1606361515,"name":"Sud52","content":"punjabi","img":"uploads\/avatars\/thisisaavatarshutup.jpg"},{"id":13,"time":1606446596,"name":"HxOr1337","content":"LOGIN WAS COCKSEXFUL","img":"https:\/\/sudao.site\/noxy.png"},{"id":14,"time":1606446740,"name":"Sud52","content":"hi ","img":"uploads\/avatars\/thisisaavatarshutup.jpg"},{"id":15,"time":1606447022,"name":"HxOr1337","content":"free punjabi cocksex","img":"https:\/\/sudao.site\/noxy.png"},{"id":16,"time":1606778762,"name":"Sud52","content":"lol","img":"uploads\/avatars\/thisisaavatarshutup.jpg"}] | json |
<reponame>JiangWeixian/JS-Tips
function sleep(time) {
let startTime = new Date();
while (new Date() - startTime < time) {}
console.log('<--Next Loop-->');
}
setTimeout(() => { //S1
console.log('timeout1');
setTimeout(() => { // S11
console.log('timeout3');
sleep(1000);
});
process.nextTick(function () { // S1.PN
console.log('nexttick1')
})
new Promise((resolve) => { // S1.P1
console.log('timeout1_promise1');
resolve()
}).then(() => {
console.log('timeout1_then1');
});
new Promise((resolve) => { // S1.P2
console.log('timeout1_promise2');
resolve()
}).then(() => {
setTimeout(function () { // S12
console.log('timeout1_then2');
}, 500)
});
sleep(1000);
});
setTimeout(() => { //S2
console.log('timeout2');
setTimeout(() => { // S21
console.log('timeout4');
sleep(1000);
});
new Promise((resolve) => {
console.log('timeout2_promise');
resolve();
}).then(() => { // S21.P.then
console.log('timeout2_then');
});
sleep(1000);
}, 500); | javascript |
<reponame>Isgi/todo-with-microgen<gh_stars>0
{"flowName":"goToMain","model":{"key":"node1","type":"flowComponentInstance","props":{"componentName":"usr.atom.IconButton","componentInstance":"iconButtonBackNotification","title":"iconButtonBackNotification","searchName":"iconButtonBackNotification","subtitle":"","inputs":[{"name":"props"}],"outputs":[{"name":"onClick"}]},"index":0,"children":[{"key":"node4","type":"flowUserFunction","props":{"functionName":"usr.atom.PageRouteAnchor.goBack","title":"goBack","subtitle":"","searchName":"goBack","inputs":[{"name":"callFunction","connectedTo":"onClick"}],"outputs":[{"name":"pageRouteAnchorProps","isSelected":true}]},"index":0,"children":[{"key":"node5","type":"flowComponentInstance","props":{"componentName":"usr.atom.PageRouteAnchor","componentInstance":"pageRouteAnchorNotification","title":"pageRouteAnchorNotification","searchName":"pageRouteAnchorNotification","subtitle":"","inputs":[{"name":"props","connectedTo":"pageRouteAnchorProps","isSelected":true}],"outputs":[],"isSelected":true},"index":1}]}]}} | json |
<gh_stars>0
package com.hui.HashMap;
import java.util.HashSet;
/**
* @author: shenhaizhilong
* @date: 2018/8/15 11:37
*/
public class HappyNumbers {
/**
*
* Happy Number
*https://leetcode.com/problems/happy-number/description/
*
* Write an algorithm to determine if a number is "happy".
*
* A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy numbers.
*
* Example:
*
* Input: 19
* Output: true
* Explanation:
* 1^2 + 9^2 = 82
* 8^2 + 2^2 = 68
* 6^2 + 8^2 = 100
* 1^2 + 0^2 + 0^2 = 1
*
* https://en.wikipedia.org/wiki/Happy_number
* Numbers that are happy follow a sequence that ends in 1. All non-happy numbers follow sequences that reach the cycle:
*
* 4, 16, 37, 58, 89, 145, 42, 20, 4......
* To see this fact, first note that if n has m digits, then the sum of the squares of its digits is at most 9^{2}m, or 81m.
*
* For m=4 and above,
*
* n > 10^{m-1}> 81m
*/
private static final int[] cycleNumbers = {4, 16, 37, 58, 89, 145, 42, 20};
private static HashSet<Integer> cycle;
static {
if(cycle == null)
{
cycle = new HashSet<>(cycleNumbers.length);
for (int i :
cycleNumbers) {
cycle.add(i);
}
}
}
public boolean isHappy(int n) {
if(n <1)return false;
if(n == 1)return true;
int rem = 0;
int sum = 0;
while (true)
{
while (n>0)
{
rem = n %10;
sum += rem*rem;
n = n/10;
}
if(cycle.contains(sum)) return false;
if(sum == 1) break;
n = sum;
sum = 0;
}
return true;
}
public static void main(String[] args) {
HappyNumbers happyNumbers = new HappyNumbers();
for (int i = 0; i < 1001; i++) {
if(happyNumbers.isHappy(i))
System.out.println(i);
}
}
}
| java |
On 15 August 1947, this company distributed nearly 1 lakh tubes of Boroline for free. And in the last 90 years, it's never been indebted to the Indian govt for a single rupee!
‘The miracle cure for any ailment’- has been the undisputed tagline for Boroline.
From cuts, cracks, burns, swellings, to winter-induced dry skin–the answer to all skin problems has been Boroline, for almost a century!
Doubt it? Ask any Bengali.
What intertwines a quintessential Bengali and Boroline, a skincare product, goes beyond profit margins or sales graphs to the crinkled pages of our tumultuous past.
Although this is not meant to be yet another history lesson, it is indeed, a nostalgic saga of the simpler times, with, of course, sprinkles of legends from the yesteryears.
Started 90 years ago, by Gour Mohon Dutta, in a Bengal divided and ravaged by the British rule, Boroline emerged not just as a dependable commodity, but as an icon of national self-sufficiency.
Till date, it is one of the very few Swadeshi products that continue to be relevant and used across the country.
In 1929, Dutta’s G D Pharmaceuticals Pvt Ltd began to manufacture the humble perfumed cream and packaged it in a green tube. It was seen not only as a skincare and medical product for daily use but also as a blatant protest against foreign-made goods that were being sold by the Britishers to Indians at exorbitant rates as another tool of economic exploitation.
What’s remarkable is how this humble commodity swam past the waves of time and continues to be a household product, even in modern, Independent India, despite the deluge of ‘advanced’ skincare products.
From youngsters who used the fragrant cream on their dry or pimpled skin, to mothers and grandmothers who generously applied it on the wounds of their young ones, generations of Bengali families have used Boroline as a medicinal as well as a beauty product.
Over the years, it has grown to become one of the many cultural archetypes.
Here’s a video which wittingly captures its essence:
The idea behind the Boroline-obsession has always been associated with its dependability. Being a homegrown product with multifaceted benefits, sold at a cheap rate, it represented not only nationalistic Indians but also the fast-growing Bengali middle class, which eventually marked the beginning of the new era.
Well, since then, from the peak of Himalayas to the Niagara Falls, world-trotting Bengalis have taken the fabled cream all across the globe!
What makes it so special?
This is a well-guarded secret about a rather transparent company.
Born in West Bengal, the ‘antiseptic ayurvedic cream’, is essentially made of boric acid (tankan amla), zinc oxide (jasad bhasma), perfume, paraffin and oleum, which is Latin for essential oils.
Despite its simple and not-so-secret chemical formula, neither the British companies of yore, nor today’s multinational companies have been able to defeat its popularity, infused with fragrant memories.
What’s even more surprising is that GD Pharmaceuticals, a company set up on an Indian model, has not been indebted to the government for a single rupee in the past 90 years!
The focus on efficiency and product quality, with a steady pace, is what has kept them happily afloat, Debashis Dutta, grandson of founder Gour Mohan Dutta, told Live Mint. He is the present managing director of the company.
And then, part of its popularity also comes from its legendary past. It is said that when India got its independence on 15 August 1947, the company distributed almost 1,00,000 tubes of Boroline for free.
Although, with time, like many, the product is embracing and evolving to modern sensibilities of fancy packaging and promotion,one hopes that unlike most, it will sustain its sweet and fragrant old-world charms for many more years to come!
(Edited by Shruti Singhal)
Like this story? Or have something to share?
Connect with us on Facebook and Twitter.
We bring stories straight from the heart of India, to inspire millions and create a wave of impact. Our positive movement is growing bigger everyday, and we would love for you to join it.
Please contribute whatever you can, every little penny helps our team in bringing you more stories that support dreams and spread hope.
| english |
<gh_stars>10-100
{
"name": "twilio-org-toolkit",
"version": "1.0.0",
"description": "Twilio.org Toolkit for Nonprofits",
"main": "index.js",
"scripts": {
"start": "nodemon --ignore assets,docs,node_modules,template_config index.js",
"test": "standard"
},
"repository": {
"type": "git",
"url": "git+https://github.com/Twilio-org/toolkit.git"
},
"keywords": [
"twilio",
"socialenterprise",
"serverless",
"nonprofits"
],
"author": "Twilio and Community Contributors",
"license": "MIT",
"bugs": {
"url": "https://github.com/Twilio-org/toolkit/issues"
},
"homepage": "https://github.com/Twilio-org/toolkit#readme",
"dependencies": {
"request": "^2.87.0",
"twilio": "^3.18.0"
},
"devDependencies": {
"airtable": "^0.5.6",
"body-parser": "^1.18.2",
"dotenv": "^4.0.0",
"express": "^4.15.5",
"nodemon": "^1.18.3",
"standard": "^10.0.3"
}
}
| json |
The Bengaluru based B2B mobility startup Noticeboard has raked up undisclosed amount of funding from former Myntra CTO Shamik Sharma and TaxiForSure co-founder Aprameya Radhakrishna. Following the funding, both Sharma and Radhakrishna will come on company’s board as advisors or mentors.
This is the second round of funding for the Bengaluru based startup since July this year. In July, Noticeboard had raised Rs 8 crore or 1.2 million from Stellaris Venture Partners and other two private investors.
Noticeboard’s co-founder Vishal Gahlaut said that both new investors will help the company in strengthening its technological products, and hiring promising senior employees for pursuing global expansion. Speaking specifically on Radhakrishna’s role, Gahlaut said that his rich experience in TaxiForSure will certainly help in better dealing with drivers and other ground staff members, which are the primary customer targets of this startup.
Noticeboard, which was founded in 2016, claims to have created an efficient application that would enable companies to better communicate with all the frontline staff members. This primarily includes employees like delivery boys, drivers, sales employees, warehouse staff etc.
The startup claims that these low educated & low salaried employees often don’t have access to e-mails & laptops, resulting in slower communication & subsequently impacting their productivity. Noticeboard hopes to address this pain point with its app, which can be downloaded from Google play store.
The Bengaluru based startup counts several companies among its many customers, including Myntra, Grofers and Pepperfry. Noticeboard also claims that companies hailing from hotel aggregation and car rental space are also availing its services.
| english |
Censor Details:
- Not Available.
- Not Available.
- Not Available.
- Not Available.
Shooting Location(City & Country)
Q: What is the release date of Daku Ramkali?
A: The release date of Daku Ramkali is 18 February 2000.
Q: Who are the actors in Daku Ramkali?
A: The starcast of the Daku Ramkali includes Shakti Kapoor, Kiran Kumar.
Q: Who is the director of Daku Ramkali?
A: Daku Ramkali has been directed by Kanti Shah.
Q: Who is the producer of Daku Ramkali?
A: Daku Ramkali has been produced by Gulab.
Q: What is Genre of Daku Ramkali?
A: Daku Ramkali belongs to the genre Action, Drama.
Q: Who is the music director of Daku Ramkali?
A: No Data Found..
| english |
With the WWE Draft 2023 just a few weeks away, the eligibility of Randy Orton for the event is in question. The former World Heavyweight Champion has been out of action for almost a year, with his wrestling return up in the air, but some positives can be taken out of the upcoming draft.
Panic overcame the WWE Universe when The Viper got shelved due to a serious back injury. He was last seen on the May 20 edition of SmackDown, being led by medical officials out of the arena. In late-2022, it was reported that the multi-time World Champion underwent fusion surgery in Birmingham. He is now getting home rest and looks in great condition.
Will Randy Orton's injury cause him to miss out on the WWE Draft 2023? That is not the case. Triple H mentioned in his SmackDown speech that each superstar will be eligible for the draft. Even those who are injured/absent will be part of it unless stated otherwise in the upcoming flagship shows.
Superstars, who the company believes will be sidelined for an extended period of time, could initially go undrafted in the WWE Draft 2023 until they are capable of a long-term wrestling run.
This has happened in the past. This will also provide insight into the future of wrestlers like Randy Orton, Big E, and AJ Styles.
Randy Orton's injury came at an unfortunate time. He was on the verge of a high-profile rivalry with The Bloodline and supposedly passed up the opportunity to co-headline SummerSlam 2022 with Undisputed WWE Universal Champion Roman Reigns.
When will The Viper target his 15th World Championship? Only time will tell.
How could Randy Orton's return be booked after WWE Draft 2023?
Triple H hasn't mentioned the exact timeline for Draft 2023 as of yet. However, WRKD Wrestling stated that it is being planned to be on the May 8 edition of RAW following the Backlash Premium Live Event.
On that basis, Randy Orton could return at Backlash and immediately involve himself in a feud with either a RAW or SmackDown Superstar. His best bet is to stay in the red brand alongside Matt Riddle, who hinted at a feud with The Miz.
Riddle's program with The A-Lister may lead up to Backlash, giving Orton the perfect opportunity for a grand comeback that tilts the scale in the babyface's favor.
The reunited duo could then get into a rivalry with the Street Profits, who are coming off a huge victory after winning the WrestleMania Showcase Match.
What's next for The Bloodline? | english |
{"tohoku university": {"Citation Count": 30.0, "Publication Count": 1.0}, "university of california berkeley": {"Citation Count": 440.0, "Publication Count": 3.0}, "australian national university": {"Citation Count": 46.5, "Publication Count": 0.5}, "university of texas at austin": {"Citation Count": 46.5, "Publication Count": 0.5}, "purdue university": {"Citation Count": 80.93333333333334, "Publication Count": 2.1333333333333333}, "microsoft": {"Citation Count": 442.54761904761904, "Publication Count": 4.738095238095237}, "tsinghua university": {"Citation Count": 19.5, "Publication Count": 0.75}, "indiana university bloomington": {"Citation Count": 1.4000000000000001, "Publication Count": 0.2}, "university of illinois at urbana champaign": {"Citation Count": 157.5, "Publication Count": 0.5}, "<NAME>": {"Citation Count": 157.5, "Publication Count": 0.5}, "university of oregon": {"Citation Count": 12.5, "Publication Count": 0.5}, "georgia institute of technology": {"Citation Count": 12.5, "Publication Count": 0.5}, "french institute for research in computer science and automation": {"Citation Count": 67.5, "Publication Count": 0.75}, "university of delaware": {"Citation Count": 22.5, "Publication Count": 0.25}, "louisiana state university": {"Citation Count": 112.75, "Publication Count": 0.25}, "ohio state university": {"Citation Count": 338.25, "Publication Count": 0.75}, "university of michigan": {"Citation Count": 183.0, "Publication Count": 1.0}, "ibm": {"Citation Count": 72.0, "Publication Count": 1.0}, "university of california san diego": {"Citation Count": 236.0, "Publication Count": 2.0}, "yale university": {"Citation Count": 18.0, "Publication Count": 0.25}, "toyota technological institute at chicago": {"Citation Count": 18.0, "Publication Count": 0.25}, "university of science and technology of china": {"Citation Count": 18.0, "Publication Count": 0.25}, "princeton university": {"Citation Count": 52.42857142857143, "Publication Count": 1.1428571428571428}, "university of maryland college park": {"Citation Count": 51.76190476190476, "Publication Count": 0.47619047619047616}, "university of california los angeles": {"Citation Count": 59.42857142857143, "Publication Count": 1.1428571428571428}, "massachusetts institute of technology": {"Citation Count": 329.0, "Publication Count": 2.0}, "karlsruhe institute of technology": {"Citation Count": 12.5, "Publication Count": 0.5}, "saarland university": {"Citation Count": 12.5, "Publication Count": 0.5}, "university of colorado boulder": {"Citation Count": 8.0, "Publication Count": 1.0}, "stanford university": {"Citation Count": 80.0, "Publication Count": 1.0}, "university of california santa cruz": {"Citation Count": 109.33333333333333, "Publication Count": 0.6666666666666666}, "williams college": {"Citation Count": 54.666666666666664, "Publication Count": 0.3333333333333333}, "cornell university": {"Citation Count": 32.33333333333333, "Publication Count": 0.3333333333333333}, "university of california santa barbara": {"Citation Count": 9.0, "Publication Count": 1.0}, "centre national de la recherche scientifique": {"Citation Count": 109.0, "Publication Count": 1.0}, "ecole polytechnique federale de lausanne": {"Citation Count": 88.66666666666666, "Publication Count": 1.3333333333333333}} | json |
<reponame>guilhermejccavalcanti/japicmp<gh_stars>0
package japicmp.cmp;
import japicmp.filter.Filter;
import japicmp.config.Options;
import japicmp.filter.Filters;
import japicmp.model.AccessModifier;
import java.util.LinkedList;
import java.util.List;
public class JarArchiveComparatorOptions {
private List<String> classPathEntries = new LinkedList<>();
private AccessModifier accessModifier = AccessModifier.PROTECTED;
private Filters filters = new Filters();
private boolean includeSynthetic = false;
private boolean ignoreMissingClasses = false;
public static JarArchiveComparatorOptions of(Options options) {
JarArchiveComparatorOptions comparatorOptions = new JarArchiveComparatorOptions();
comparatorOptions.getFilters().getExcludes().addAll(options.getExcludes());
comparatorOptions.getFilters().getIncludes().addAll(options.getIncludes());
comparatorOptions.setAccessModifier(options.getAccessModifier());
comparatorOptions.setIncludeSynthetic(options.isIncludeSynthetic());
comparatorOptions.setIgnoreMissingClasses(options.isIgnoreMissingClasses());
return comparatorOptions;
}
public Filters getFilters() {
return filters;
}
public void setFilters(Filters filters) {
this.filters = filters;
}
public List<String> getClassPathEntries() {
return classPathEntries;
}
public void setAccessModifier(AccessModifier accessModifier) {
this.accessModifier = accessModifier;
}
public AccessModifier getAccessModifier() {
return accessModifier;
}
public void setIncludeSynthetic(boolean includeSynthetic) {
this.includeSynthetic = includeSynthetic;
}
public boolean isIncludeSynthetic() {
return includeSynthetic;
}
public void setIgnoreMissingClasses(boolean ignoreMissingClasses) {
this.ignoreMissingClasses = ignoreMissingClasses;
}
public boolean isIgnoreMissingClasses() {
return ignoreMissingClasses;
}
}
| java |
<filename>mango/__init__.py
# In --strict mode, mypy complains about imports unless they're done this way.
#
# It complains 'Module has no attribute ABC' or 'Module "mango" does not explicitly export
# attribute "XYZ"; implicit reexport disabled'. We could dial that back by using the
# --implicit-reexport parameter, but let's keep things strict.
#
# Each import then *must* be of the form `from .file import X as X`. (Until/unless there's
# a better way.)
#
from .account import Account as Account
from .account import AccountSlot as AccountSlot
from .accountflags import AccountFlags as AccountFlags
from .accountinfo import AccountInfo as AccountInfo
from .accountinfoconverter import build_account_info_converter as build_account_info_converter
from .accountinstrumentvalues import AccountInstrumentValues as AccountInstrumentValues
from .accountinstrumentvalues import PricedAccountInstrumentValues as PricedAccountInstrumentValues
from .accountliquidator import AccountLiquidator as AccountLiquidator
from .accountliquidator import NullAccountLiquidator as NullAccountLiquidator
from .accountscout import AccountScout as AccountScout
from .accountscout import ScoutReport as ScoutReport
from .addressableaccount import AddressableAccount as AddressableAccount
from .arguments import parse_args as parse_args
from .arguments import output as output
from .balancesheet import BalanceSheet as BalanceSheet
from .cache import Cache as Cache
from .cache import MarketCache as MarketCache
from .cache import PerpMarketCache as PerpMarketCache
from .cache import PriceCache as PriceCache
from .cache import RootBankCache as RootBankCache
from .client import BetterClient as BetterClient
from .client import BlockhashNotFoundException as BlockhashNotFoundException
from .client import ClientException as ClientException
from .client import CompoundException as CompoundException
from .client import CompoundRPCCaller as CompoundRPCCaller
from .client import FailedToFetchBlockhashException as FailedToFetchBlockhashException
from .client import NodeIsBehindException as NodeIsBehindException
from .client import RateLimitException as RateLimitException
from .client import RPCCaller as RPCCaller
from .client import SlotHolder as SlotHolder
from .client import TooManyRequestsRateLimitException as TooManyRequestsRateLimitException
from .client import TooMuchBandwidthRateLimitException as TooMuchBandwidthRateLimitException
from .client import TransactionException as TransactionException
from .combinableinstructions import CombinableInstructions as CombinableInstructions
from .constants import MangoConstants as MangoConstants
from .constants import DATA_PATH as DATA_PATH
from .constants import SOL_DECIMAL_DIVISOR as SOL_DECIMAL_DIVISOR
from .constants import SOL_DECIMALS as SOL_DECIMALS
from .constants import SOL_MINT_ADDRESS as SOL_MINT_ADDRESS
from .constants import SYSTEM_PROGRAM_ADDRESS as SYSTEM_PROGRAM_ADDRESS
from .constants import WARNING_DISCLAIMER_TEXT as WARNING_DISCLAIMER_TEXT
from .constants import version as version
from .context import Context as Context
from .contextbuilder import ContextBuilder as ContextBuilder
from .createmarketoperations import create_market_instruction_builder as create_market_instruction_builder
from .createmarketoperations import create_market_operations as create_market_operations
from .encoding import decode_binary as decode_binary
from .encoding import encode_binary as encode_binary
from .encoding import encode_key as encode_key
from .encoding import encode_int as encode_int
from .ensuremarketloaded import ensure_market_loaded as ensure_market_loaded
from .ensuremarketloaded import load_market_by_symbol as load_market_by_symbol
from .group import Group as Group
from .group import GroupSlot as GroupSlot
from .group import GroupSlotPerpMarket as GroupSlotPerpMarket
from .group import GroupSlotSpotMarket as GroupSlotSpotMarket
from .healthcheck import HealthCheck as HealthCheck
from .idl import IdlParser as IdlParser
from .idl import lazy_load_cached_idl_parser as lazy_load_cached_idl_parser
from .idsjsonmarketlookup import IdsJsonMarketLookup as IdsJsonMarketLookup
from .inventory import Inventory as Inventory
from .inventory import PerpInventoryAccountWatcher as PerpInventoryAccountWatcher
from .inventory import SpotInventoryAccountWatcher as SpotInventoryAccountWatcher
from .instructions import build_cancel_perp_order_instructions as build_cancel_perp_order_instructions
from .instructions import build_cancel_spot_order_instructions as build_cancel_spot_order_instructions
from .instructions import build_close_spl_account_instructions as build_close_spl_account_instructions
from .instructions import build_create_account_instructions as build_create_account_instructions
from .instructions import build_create_associated_spl_account_instructions as build_create_associated_spl_account_instructions
from .instructions import build_create_solana_account_instructions as build_create_solana_account_instructions
from .instructions import build_create_spl_account_instructions as build_create_spl_account_instructions
from .instructions import build_create_serum_open_orders_instructions as build_create_serum_open_orders_instructions
from .instructions import build_deposit_instructions as build_deposit_instructions
from .instructions import build_faucet_airdrop_instructions as build_faucet_airdrop_instructions
from .instructions import build_mango_consume_events_instructions as build_mango_consume_events_instructions
from .instructions import build_place_perp_order_instructions as build_place_perp_order_instructions
from .instructions import build_redeem_accrued_mango_instructions as build_redeem_accrued_mango_instructions
from .instructions import build_serum_consume_events_instructions as build_serum_consume_events_instructions
from .instructions import build_serum_place_order_instructions as build_serum_place_order_instructions
from .instructions import build_serum_settle_instructions as build_serum_settle_instructions
from .instructions import build_spot_place_order_instructions as build_spot_place_order_instructions
from .instructions import build_transfer_spl_tokens_instructions as build_transfer_spl_tokens_instructions
from .instructions import build_withdraw_instructions as build_withdraw_instructions
from .instructionreporter import InstructionReporter as InstructionReporter
from .instructionreporter import SerumInstructionReporter as SerumInstructionReporter
from .instructionreporter import MangoInstructionReporter as MangoInstructionReporter
from .instructionreporter import CompoundInstructionReporter as CompoundInstructionReporter
from .instructiontype import InstructionType as InstructionType
from .instrumentlookup import InstrumentLookup as InstrumentLookup
from .instrumentlookup import NullInstrumentLookup as NullInstrumentLookup
from .instrumentlookup import CompoundInstrumentLookup as CompoundInstrumentLookup
from .instrumentlookup import IdsJsonTokenLookup as IdsJsonTokenLookup
from .instrumentlookup import NonSPLInstrumentLookup as NonSPLInstrumentLookup
from .instrumentlookup import SPLTokenLookup as SPLTokenLookup
from .instrumentvalue import InstrumentValue as InstrumentValue
from .liquidatablereport import LiquidatableState as LiquidatableState
from .liquidatablereport import LiquidatableReport as LiquidatableReport
from .liquidationevent import LiquidationEvent as LiquidationEvent
from .liquidationprocessor import LiquidationProcessor as LiquidationProcessor
from .liquidationprocessor import LiquidationProcessorState as LiquidationProcessorState
from .loadedmarket import LoadedMarket as LoadedMarket
from .logmessages import expand_log_messages as expand_log_messages
from .lotsizeconverter import LotSizeConverter as LotSizeConverter
from .mangoinstruction import MangoInstruction as MangoInstruction
from .lotsizeconverter import NullLotSizeConverter as NullLotSizeConverter
from .market import DryRunMarket as DryRunMarket
from .market import InventorySource as InventorySource
from .market import Market as Market
from .marketlookup import CompoundMarketLookup as CompoundMarketLookup
from .marketlookup import MarketLookup as MarketLookup
from .marketlookup import NullMarketLookup as NullMarketLookup
from .marketoperations import MarketInstructionBuilder as MarketInstructionBuilder
from .marketoperations import MarketOperations as MarketOperations
from .marketoperations import NullMarketInstructionBuilder as NullMarketInstructionBuilder
from .marketoperations import NullMarketOperations as NullMarketOperations
from .metadata import Metadata as Metadata
from .modelstate import ModelState as ModelState
from .notification import CompoundNotificationTarget as CompoundNotificationTarget
from .notification import ConsoleNotificationTarget as ConsoleNotificationTarget
from .notification import CsvFileNotificationTarget as CsvFileNotificationTarget
from .notification import DiscordNotificationTarget as DiscordNotificationTarget
from .notification import FilteringNotificationTarget as FilteringNotificationTarget
from .notification import MailjetNotificationTarget as MailjetNotificationTarget
from .notification import NotificationHandler as NotificationHandler
from .notification import NotificationTarget as NotificationTarget
from .notification import TelegramNotificationTarget as TelegramNotificationTarget
from .notification import parse_notification_target as parse_notification_target
from .observables import CaptureFirstItem as CaptureFirstItem
from .observables import CollectingObserverSubscriber as CollectingObserverSubscriber
from .observables import DisposePropagator as DisposePropagator
from .observables import DisposeWrapper as DisposeWrapper
from .observables import EventSource as EventSource
from .observables import FunctionObserver as FunctionObserver
from .observables import LatestItemObserverSubscriber as LatestItemObserverSubscriber
from .observables import NullObserverSubscriber as NullObserverSubscriber
from .observables import PrintingObserverSubscriber as PrintingObserverSubscriber
from .observables import TimestampedPrintingObserverSubscriber as TimestampedPrintingObserverSubscriber
from .observables import create_backpressure_skipping_observer as create_backpressure_skipping_observer
from .observables import debug_print_item as debug_print_item
from .observables import log_subscription_error as log_subscription_error
from .observables import observable_pipeline_error_reporter as observable_pipeline_error_reporter
from .openorders import OpenOrders as OpenOrders
from .oracle import Oracle as Oracle
from .oracle import OracleProvider as OracleProvider
from .oracle import OracleSource as OracleSource
from .oracle import Price as Price
from .oracle import SupportedOracleFeature as SupportedOracleFeature
from .orderbookside import OrderBookSideType as OrderBookSideType
from .orderbookside import PerpOrderBookSide as PerpOrderBookSide
from .orders import Order as Order
from .orders import OrderType as OrderType
from .orders import OrderBook as OrderBook
from .orders import Side as Side
from .ownedinstrumentvalue import OwnedInstrumentValue as OwnedInstrumentValue
from .oraclefactory import create_oracle_provider as create_oracle_provider
from .parse_account_info_to_orders import parse_account_info_to_orders as parse_account_info_to_orders
from .perpaccount import PerpAccount as PerpAccount
from .perpeventqueue import PerpEvent as PerpEvent
from .perpeventqueue import PerpEventQueue as PerpEventQueue
from .perpeventqueue import PerpFillEvent as PerpFillEvent
from .perpeventqueue import PerpOutEvent as PerpOutEvent
from .perpeventqueue import PerpUnknownEvent as PerpUnknownEvent
from .perpeventqueue import UnseenPerpEventChangesTracker as UnseenPerpEventChangesTracker
from .perpmarket import PerpMarket as PerpMarket
from .perpmarket import PerpMarketStub as PerpMarketStub
from .perpmarketdetails import PerpMarketDetails as PerpMarketDetails
from .perpmarketoperations import PerpMarketInstructionBuilder as PerpMarketInstructionBuilder
from .perpmarketoperations import PerpMarketOperations as PerpMarketOperations
from .perpopenorders import PerpOpenOrders as PerpOpenOrders
from .placedorder import PlacedOrder as PlacedOrder
from .placedorder import PlacedOrdersContainer as PlacedOrdersContainer
from .publickey import encode_public_key_for_sorting as encode_public_key_for_sorting
from .reconnectingwebsocket import ReconnectingWebsocket as ReconnectingWebsocket
from .retrier import RetryWithPauses as RetryWithPauses
from .retrier import retry_context as retry_context
from .serumeventqueue import SerumEventQueue as SerumEventQueue
from .serumeventqueue import UnseenSerumEventChangesTracker as UnseenSerumEventChangesTracker
from .serummarket import SerumMarket as SerumMarket
from .serummarket import SerumMarketStub as SerumMarketStub
from .serummarketlookup import SerumMarketLookup as SerumMarketLookup
from .serummarketoperations import SerumMarketInstructionBuilder as SerumMarketInstructionBuilder
from .serummarketoperations import SerumMarketOperations as SerumMarketOperations
from .spotmarket import SpotMarket as SpotMarket
from .spotmarket import SpotMarketStub as SpotMarketStub
from .spotmarketoperations import SpotMarketInstructionBuilder as SpotMarketInstructionBuilder
from .spotmarketoperations import SpotMarketOperations as SpotMarketOperations
from .text import indent_collection_as_str as indent_collection_as_str
from .text import indent_item_by as indent_item_by
from .token import Instrument as Instrument
from .token import SolToken as SolToken
from .token import Token as Token
from .tokenaccount import TokenAccount as TokenAccount
from .tokenbank import BankBalances as BankBalances
from .tokenbank import InterestRates as InterestRates
from .tokenbank import NodeBank as NodeBank
from .tokenbank import RootBank as RootBank
from .tokenbank import TokenBank as TokenBank
from .tradeexecutor import ImmediateTradeExecutor as ImmediateTradeExecutor
from .tradeexecutor import NullTradeExecutor as NullTradeExecutor
from .tradeexecutor import TradeExecutor as TradeExecutor
from .tradehistory import TradeHistory as TradeHistory
from .transactionscout import TransactionScout as TransactionScout
from .transactionscout import fetch_all_recent_transaction_signatures as fetch_all_recent_transaction_signatures
from .transactionscout import mango_instruction_from_response as mango_instruction_from_response
from .valuation import AccountValuation as AccountValuation
from .valuation import TokenValuation as TokenValuation
from .valuation import Valuation as Valuation
from .version import Version as Version
from .wallet import Wallet as Wallet
from .walletbalancer import FilterSmallChanges as FilterSmallChanges
from .walletbalancer import FixedTargetBalance as FixedTargetBalance
from .walletbalancer import LiveAccountBalancer as LiveAccountBalancer
from .walletbalancer import LiveWalletBalancer as LiveWalletBalancer
from .walletbalancer import NullWalletBalancer as NullWalletBalancer
from .walletbalancer import PercentageTargetBalance as PercentageTargetBalance
from .walletbalancer import TargetBalance as TargetBalance
from .walletbalancer import WalletBalancer as WalletBalancer
from .walletbalancer import calculate_required_balance_changes as calculate_required_balance_changes
from .walletbalancer import parse_fixed_target_balance as parse_fixed_target_balance
from .walletbalancer import parse_target_balance as parse_target_balance
from .walletbalancer import sort_changes_for_trades as sort_changes_for_trades
from .watcher import LamdaUpdateWatcher as LamdaUpdateWatcher
from .watcher import ManualUpdateWatcher as ManualUpdateWatcher
from .watcher import Watcher as Watcher
from .watchers import build_group_watcher as build_group_watcher
from .watchers import build_account_watcher as build_account_watcher
from .watchers import build_cache_watcher as build_cache_watcher
from .watchers import build_spot_open_orders_watcher as build_spot_open_orders_watcher
from .watchers import build_serum_open_orders_watcher as build_serum_open_orders_watcher
from .watchers import build_perp_open_orders_watcher as build_perp_open_orders_watcher
from .watchers import build_price_watcher as build_price_watcher
from .watchers import build_serum_inventory_watcher as build_serum_inventory_watcher
from .watchers import build_orderbook_watcher as build_orderbook_watcher
from .websocketsubscription import IndividualWebSocketSubscriptionManager as IndividualWebSocketSubscriptionManager
from .websocketsubscription import SharedWebSocketSubscriptionManager as SharedWebSocketSubscriptionManager
from .websocketsubscription import WebSocketAccountSubscription as WebSocketAccountSubscription
from .websocketsubscription import WebSocketLogSubscription as WebSocketLogSubscription
from .websocketsubscription import WebSocketProgramSubscription as WebSocketProgramSubscription
from .websocketsubscription import WebSocketSubscription as WebSocketSubscription
from .websocketsubscription import WebSocketSubscriptionManager as WebSocketSubscriptionManager
from .layouts import layouts
import decimal
# Increased precision from 18 to 36 because for a decimal like:
# val = Decimal("17436036573.2030800")
#
# The following rounding operations would both throw decimal.InvalidOperation:
# val.quantize(Decimal('.000000001'))
# round(val, 9)
decimal.getcontext().prec = 36
| python |
---
layout: knowledge-sharing-landing
title: ALUMNI SPOTLIGHT: <NAME>
subtitle: Alumni Spotlight: <NAME>
filler: <NAME> is a member of the 2016-2017 CXO Fellows cohort.
permalink: /knowledge-sharing/alumni-spotlight-angela-mcpherson/
type: CXO Fellows
date: June 20, 2018
has_date: 'yes'
author: <NAME>
filters: cxo-fellows
---
<div style="line-height: 1.8em;margin-bottom: 80px; display: block;">
<p><b>CXO Fellows Cohort <abbr title="Fiscal year">FY</abbr> 16-17<img alt="<NAME> portrait" src="{{ site.baseurl }}/wp-content/uploads/2018/06/Angela-300x300.png" width="300" height="300" sizes="(max-width: 300px) 100vw, 300px" style="float: left;margin-right: 30px;margin-bottom: 10px;max-width: 100%; height: auto;"></b></p>
<p><b>Functional Group: </b><i><span style="font-weight: 400;">Information Technology</span></i></p>
<p><b>Current Position: </b><i><span style="font-weight: 400;">Program Liaison Specialist, MY <abbr title="Office of Shared Solutions Performance Improvement">OSSPI</abbr></span></i></p>
<p><b>Agency: </b><i><span style="font-weight: 400;">GSA </span></i></p>
<p><span style="font-weight: 400;"><NAME> is a member of the 2016-2017 CXO Fellows cohort. During her participation in the CXO Fellowship, Angela was a Program Specialist working as a financial management systems trainer at the General Services Administration (GSA). In February 2018, Angela transitioned to GSA’s Office of Shared Solutions & Performance Improvement (OSSPI) as a Program Liaison Specialist supporting the Chief Acquisition Officers Council (CAOC), Performance Improvement Council (PIC), and President Management Council (PMC).</span> <span style="font-weight: 400;">We sat down with Angela to discuss her experience as a recent CXO Fellow. </span></p>
<p><b>How did the program advance your career as a public servant?</b></p>
<p><span style="font-weight: 400;">Meeting with CXOs provided candid career development insight. CXOs who shared their leadership stories with our cohort had a diverse set of backgrounds and professional experiences that oftentimes were not directly related to their current functional area as a CXO. In varying ways, their stories demonstrated how every job opportunity, no matter how unrelated, can catapult you to a higher position. Candid insight into CXOs’ career paths provided specific and qualitative information to help me structure my own career path to pursue leadership opportunities in which I am interested. </span></p>
<p><b>What did you gain from the program?</b></p>
<p><span style="font-weight: 400;">As a CXO Fellow, I was able to develop a stronger voice in the conversation, not only around areas in which I had developed an expertise, but also regarding broader, cross-functional and cross-agency issues. I learned that no matter what position I am in, I have the ability to make suggestions, develop better processes, and seek opportunities to talk to people who can help implement these ideas.</span></p>
<p><b>How did the program enable you to better contribute to your agency?</b></p>
<p><span style="font-weight: 400;">The opportunity to contribute to cross-council initiatives, work with the PMA CAP Goals, and operate in a cross-agency, cross-functional, and collaborative role provided a government-wide perspective. This enabled me to better see how the role I currently play fits into the broader equation of government-wide, back office functions. </span></p>
<p><b>What would you tell someone who is interested in the program?</b></p>
<p><span style="font-weight: 400;">The CXO Fellows Program is Leadership 101 for the Executive Government. The program provides an experience and education that most federal employees in mission support functions do not receive. The exposure to chief executive officers, government-wide issues and initiatives, and cross-functional collaboration is invaluable to advancing both the contribution you make to your agency and your own career trajectory.</span></p>
</div> | markdown |
The UIDAI has, till date, issued over 70.8 crore Aadhaar numbers. Nine States/UTs including Andhra Pradesh, Telangana, Kerala, Delhi and Himachal Pradesh have crossed 90 percent Aadhaar coverage, while a further seven States/UTs have Aadhaar coverage of between 75 and 90 percent.
Over 2 crore Aadhaar number holders of Bihar can now avail many services with their Aadhaars such as opening a Bank account, obtaining a SIM card, a PAN card, an LPG connection etc. For the benefit of residents and institutions/agencies alike, more services are likely to be available using the Aadhaar platform in the coming days.
Aadhaar is a “Digital ID” which facilitates “anytime, anywhere” online authentication of a resident through universal verification of one’s identity based on the demographic and biometric information of an individual, thereby eliminating any chance of duplication or fraud.
For any further information, please contact:
| english |
<filename>src/test/ui/parser/pat-ranges-4.rs
// Parsing of range patterns
fn main() {
let 10 - 3 ..= 10 = 8;
//~^ error: expected one of `...`, `..=`, `..`, `:`, `;`, or `=`, found `-`
}
| rust |
Stylish Star Allu Arjun's Pushpa makers are quite choosy in selecting the star cast of the film so as to make sure that it'd be a perfect pan Indian film.
According to a juicy update, Bollywood actress Urvashi Rautela will do a special song in the film.
Another Bollywood actress Evelyn Sharma will do a significant role in the movie. On the other hand, Sanjay Dutt or Sunil Shetty will be confirmed to play an antagonist. Kollywood's talented actor Vijay Sethupathy is already doing a crucial role in the movie.
Meanwhile, Rashmika Mandanna will share screen space with Stylish Star in the movie. Rockstar Devi Sri Prasad is scoring music. The movie is being directed by Sukumar under Mythri Movie Makers. | english |
<gh_stars>0
// RobotBuilder Version: 2.0
//
// This file was generated by RobotBuilder. It contains sections of
// code that are automatically generated and assigned by robotbuilder.
// These sections will be updated in the future when you export to
// Java from RobotBuilder. Do not put any code or make any change in
// the blocks indicating autogenerated code or it will be lost on an
// update. Deleting the comments indicating the section will prevent
// it from being updated in the future.
package org.usfirst.frc2619.SirLancebot2016;
// BEGIN AUTOGENERATED CODE, SOURCE=ROBOTBUILDER ID=IMPORTS
import edu.wpi.first.wpilibj.CANTalon;
import edu.wpi.first.wpilibj.DoubleSolenoid;
// END AUTOGENERATED CODE, SOURCE=ROBOTBUILDER ID=IMPORTS
import edu.wpi.first.wpilibj.livewindow.LiveWindow;
/**
* The RobotMap is a mapping from the ports sensors and actuators are wired into
* to a variable name. This provides flexibility changing wiring, makes checking
* the wiring easier and significantly reduces the number of magic numbers
* floating around.
*/
public class RobotMap {
// BEGIN AUTOGENERATED CODE, SOURCE=ROBOTBUILDER ID=DECLARATIONS
public static CANTalon driveTrainLeftFrontMotor;
public static CANTalon driveTrainLeftRearMotor;
public static CANTalon driveTrainRightFrontMotor;
public static CANTalon driveTrainRightRearMotor;
public static DoubleSolenoid gearShiftshifter;
public static DoubleSolenoid plungerbopper;
public static CANTalon shooterleftShooterMotor;
public static CANTalon shooterrightShooterMotor;
public static DoubleSolenoid shootershooterLift;
public static DoubleSolenoid collectorarmLift;
public static CANTalon collectorfeedRoller;
public static CANTalon collectorcenterRoller;
// END AUTOGENERATED CODE, SOURCE=ROBOTBUILDER ID=DECLARATIONS
public static void init() {
// BEGIN AUTOGENERATED CODE, SOURCE=ROBOTBUILDER ID=CONSTRUCTORS
driveTrainLeftFrontMotor = new CANTalon(19);
LiveWindow.addActuator("DriveTrain", "leftFrontMotor", driveTrainLeftFrontMotor);
driveTrainLeftRearMotor = new CANTalon(14);
LiveWindow.addActuator("DriveTrain", "leftRearMotor", driveTrainLeftRearMotor);
driveTrainRightFrontMotor = new CANTalon(13);
LiveWindow.addActuator("DriveTrain", "rightFrontMotor", driveTrainRightFrontMotor);
driveTrainRightRearMotor = new CANTalon(12);
LiveWindow.addActuator("DriveTrain", "rightRearMotor", driveTrainRightRearMotor);
gearShiftshifter = new DoubleSolenoid(0, 0, 1);
LiveWindow.addActuator("GearShift", "shifter", gearShiftshifter);
plungerbopper = new DoubleSolenoid(0, 2, 3);
LiveWindow.addActuator("Plunger", "bopper", plungerbopper);
shooterleftShooterMotor = new CANTalon(2);
LiveWindow.addActuator("Shooter", "leftShooterMotor", shooterleftShooterMotor);
shooterrightShooterMotor = new CANTalon(1);
LiveWindow.addActuator("Shooter", "rightShooterMotor", shooterrightShooterMotor);
shootershooterLift = new DoubleSolenoid(0, 4, 5);
LiveWindow.addActuator("Shooter", "shooterLift", shootershooterLift);
collectorarmLift = new DoubleSolenoid(0, 6, 7);
LiveWindow.addActuator("Collector", "armLift", collectorarmLift);
collectorfeedRoller = new CANTalon(3);
LiveWindow.addActuator("Collector", "feedRoller", collectorfeedRoller);
collectorcenterRoller = new CANTalon(4);
LiveWindow.addActuator("Collector", "centerRoller", collectorcenterRoller);
// END AUTOGENERATED CODE, SOURCE=ROBOTBUILDER ID=CONSTRUCTORS
driveTrainLeftFrontMotor.set(0);
driveTrainLeftRearMotor.set(0);
driveTrainRightFrontMotor.set(0);
driveTrainRightRearMotor.set(0);
// setting all the other motors to follower mode to follow the front two motors
// Right
driveTrainRightRearMotor.changeControlMode(CANTalon.TalonControlMode.Follower);
driveTrainRightRearMotor.set(driveTrainRightFrontMotor.getDeviceID());
// Left
driveTrainLeftRearMotor.changeControlMode(CANTalon.TalonControlMode.Follower);
driveTrainLeftRearMotor.set(driveTrainLeftFrontMotor.getDeviceID());
//Invert motors
//THESE ARE FOR PLYBOT
driveTrainRightFrontMotor.setInverted(true);
driveTrainRightRearMotor.setInverted(true);
}
}
| java |
Bengaluru: The coronavirus vaccination drive for people above 60 years and those aged 45 and above with comorbidities began on Monday at government and private health facilities in Karnataka.
The vaccines are being administered free of cost at government hospitals and health centres, while Rs 250 will be charged at private health facilities, according to the Central government. The people of the state can register and book an appointment for vaccination, anytime and anywhere, using the Co-WIN 2. 0 portal or through other IT applications such as Aarogya Setu.
On Sunday, the state health department had said that Karnataka has recorded 523 new cases of coronavirus and six deaths in the last 24 hours, taking the caseload and toll to 9,50,730 and 12,326 respectively. According to the department bulletin, so far 9,32,747 people were discharged cumulatively including 380. There were 5,638 active cases in the state which included 121 in the ICU. | english |
In my experience, women are far ahead of men in the area of prayers for help. We men are stubborn creatures. We go as long as we can stand it trying to do everything on our own. Somehow we get it into our heads that if we ask for help, we are weak. We lose the game. We might forfeit our “man card.” There is a long-running story about men preferring to drive in circles for half an hour when they could have gotten help in three minutes. It’s true.
There is no point in suffering any longer than you have to. God not only accepts our calls for help; he encourages them. The Bible’s book of Psalms gives many examples of believers, males included, who had exhausted their own resources and needed divine help. “The cords of death entangled me, the anguish of the grave came over me; I was overcome by distress and sorrow. Then I called on the name of the Lord: ‘Lord, save me!’” (Psalm 116:3,4).
What burdens are you carrying right now that you need help with? (Psst—guys, there is no shame in asking for God’s help.) He who did not hesitate to send his own Son to the cross has demonstrated beyond all doubt that he loves you. If he did the Big Thing, he will surely do the littler things to help his children.
He has resources to send into your life, but he’s waiting to be asked.
God tells us to bring our prayers and requests to him. This reading plan addresses some of the common issues that we can take to him.
What Does God Expect Of Me?
Hi God (It's Me Again)
Choosing Each Day: God or Self?
| english |
/**
* Enum for tri-state values.
* @enum {number}
*/
var TriState = {
/** true */
TRUE: 1,
FALSE: -1,
/** @type {boolean} */
MAYBE: true
};
/**
* Numeric enum for true/false values.
* @enum {boolean}
*/
var TrueFalseNumeric = {
/** false */
0: false,
1: true
};
| javascript |
Sleeping beauty? Not without the right pillow!
Why do most of us love the mattresses, comforters, and pillows in hotels.
NEW DELHI: Why do most of us love the mattresses, comforters, and pillows in hotels. Because they are often fresh and combined with cotton-linen covers or silk covers, offering a cozy and comfortable night's sleep.
However, we hardly give second thoughts to our home pillows, which often show years of stains brown-yellow, or lumps making them harder than rocks.
While the lack of hygiene should be motivation enough for users to change their pillows immediately, most people still procrastinate. Why? Because pillows don't rank high on their priority list. Well, guess what, it should. Fresh pillows are not only crucial for comfortable and adequate sleep, but they also allows you to have hygienic beauty sleep. Punit Jindal, MD at Sleepsia, a Pioneer of Memory Foam Pillow technology shares a list of 5 essential factors you should know about pillows:
. . . and that's why your neck and back hurt: Like most things, pillows also have a durability period. Considering how often it is used and kept, pillows start flattening. Instead of the soft yet firm loft that supports your spine alignment, these become harder and uncomfortable. Using a pillow without appropriate firmness can do more harm than good. In fact, it can cause issues like cervical pain and disc herniation.
How firm is enough: While the firmness of a pillow depends on the user's preference, the criteria for proper firmness should apply to all. An ideal pillow should be firm but not hard, soft but not squishy. The loft should be secure enough to prevent the user's head from sinking in but soft enough to make them feel warm and at ease.
Designs as per requirements: Instead of buying pillows from anywhere, users should be mindful of their designs. For instance, Ergonomic pillows or cervical pillows are specifically designed for offering relief with cervical pain. Similarly, people using Continuous Positive Airway Pressure (CPAP) machines and suffering from obstructive sleep apnea can opt for carefully designed CPAP pillows and get a better sleeping experience than standard pillows.
Get rid of allergens: Using rundown pillows can cause allergic reactions such as stuffy nose, sneezing spells, and sometimes even fever. The reason behind, old pillows soak up moisture content, making them vulnerable to dust mites and mold. However, the advent of hypoallergenic pillows can offer modern-day users tremendous relief. These pillows can easily resist recurrent household allergens like pollens and dust and enable users to lead a restful life.
Enhanced breathability element: It is widely believed that using fresh pillowcases can reduce the frequency of acne and hair breakage issues. Pillows with appropriate breathability attributes allow them to retain moisture and heat to pass. As a result, they stay dry and unpolluted for users to complete their much-needed beauty sleep.
As per industry experts, consumers should replace old pillows with fresh ones within a span of two years. On the other hand, worn-out pillows can lead to unnecessary neck and back pain, stress, and challenges for people trying to have a relaxed good night's sleep. To keep up with this volatile and highly hectic lifestyle, you need a good night's rest. So, opt for a pillow that fits perfectly with the aforementioned factors and unwind your stressful thoughts to dive into the tranquillising state of peaceful night sleep. (IANS)
Also watch: | english |
<reponame>sekikn/incubator-gobblin
{
"name" : "policies",
"namespace" : "org.apache.gobblin.restli.throttling",
"path" : "/policies",
"schema" : "org.apache.gobblin.restli.throttling.Policy",
"doc" : "A Rest.li endpoint for getting the {@link ThrottlingPolicy} associated with a resource id.\n\ngenerated from: org.apache.gobblin.restli.throttling.PoliciesResource",
"collection" : {
"identifier" : {
"name" : "policiesId",
"type" : "string"
},
"supports" : [ "get" ],
"methods" : [ {
"method" : "get"
} ],
"entity" : {
"path" : "/policies/{policiesId}"
}
}
} | json |
When planning to relax at the fabulous resorts of Barbados , it is necessary to study the requirements allowing entry to the state, first of all, to answer the question: is a visa for Barbados necessary?
Tourists planning to relax on the island for less than 28 days do not need to make out documents in advance. The visa for Russians in Barbados , as well as for residents of Ukraine, Belarus and Kazakhstan, is stamped by the border service in a foreign passport. For this, during the passport control, the tourist must submit the following documents:
- a foreign passport (the period of validity must end no less than 6 months);
- air tickets to and from the country;
- An invitation to visit the island (it can be private, tourist or official);
- Confirmation of solvency (this can be cash, bank cards, checks, account statements, sponsorship letter or certificate from the place of work).
If there is no written invitation to enter, you must confirm that you have booked a hotel or hotel room using the printouts from the reservation system sites.
If the airport Grantley Adams you use as a transfer point, then you must submit only air tickets and a foreign passport. A visa will not be required if the transit time does not exceed 48 hours. If you need a longer stay, you will need to obtain permission at the border. The order of registration of documents looks the same as for tourists who are vacationing on the beaches of Barbados .
If you plan to stay in Barbados for more than 28 days, you need to issue a visa. There is no Barbados embassy in the CIS countries. All the functions of the consulates are assigned to the British Embassy. Visa to Barbados can be obtained for a year or six months, providing a passport and air tickets to the country. It takes about 1-2 weeks to complete.
When traveling abroad with a child, take care of the presence of a birth certificate and the passport of a minor. In the absence of a child's foreign passport, information about the child should be spelled out in the parent document.
If the child leaves the country with one of the parents or accompanied by third parties, then it is necessary to formalize an official power of attorney from the parent or parents, indicating the country of destination. The validity of such permission to export the child should not exceed 3 months. It is also necessary to provide a photocopy of all pages of the principal passport of the principal.
- For travel to Barbados, medical insurance is not needed. But still it is desirable to buy it to avoid unnecessary problems, as medical services in Barbados are paid and very expensive.
- Departing from the island, tourists need to pay 25 local dollars ($ 1 US). This is a mandatory collection of the airport. | english |
<filename>h2o-bindings/bin/custom/R/gen_generic.py
extensions = dict(
required_params=[], # empty to override defaults in gen_defaults
validate_required_params="""
# Required args: either model_key or path
if (is.null(model_key) && is.null(path)) stop("argument 'model_key' or 'path' must be provided")
""",
set_required_params="",
)
doc = dict(
preamble="""
Imports a generic model into H2O. Such model can be used then used for scoring and obtaining
additional information about the model. The imported model has to be supported by H2O.
""",
examples="""
# library(h2o)
# h2o.init()
# generic_model <- h2o.genericModel(path="/path/to/model.zip", model_id="my_model")
# predictions <- h2o.predict(generic_model, dataset)
"""
)
| python |
package com.haulmont.sample.petclinic.entity.visit;
import com.haulmont.chile.core.annotations.NamePattern;
import com.haulmont.cuba.core.entity.StandardEntity;
import com.haulmont.cuba.core.entity.annotation.Lookup;
import com.haulmont.cuba.core.entity.annotation.LookupType;
import com.haulmont.cuba.core.global.AppBeans;
import com.haulmont.cuba.core.global.TimeSource;
import com.haulmont.sample.petclinic.entity.pet.Pet;
import javax.annotation.PostConstruct;
import javax.persistence.*;
import javax.validation.constraints.NotNull;
import java.util.Date;
@NamePattern("%s (%s)|pet,visitDate")
@Table(name = "PETCLINIC_VISIT")
@Entity(name = "petclinic_Visit")
public class Visit extends StandardEntity {
private static final long serialVersionUID = 6351202390461847589L;
@Column(name = "VISIT_NUMBER")
protected String visitNumber;
@Column(name = "TYPE_")
protected String type;
@Temporal(TemporalType.DATE)
@NotNull
@Column(name = "VISIT_DATE", nullable = false)
protected Date visitDate;
@Column(name = "DESCRIPTION", length = 4000)
protected String description;
@Lookup(type = LookupType.SCREEN, actions = {"lookup", "open", "clear"})
@NotNull
@ManyToOne(fetch = FetchType.LAZY, optional = false)
@JoinColumn(name = "PET_ID")
protected Pet pet;
@Column(name = "PAID")
protected Boolean paid = false;
public VisitType getType() {
return type == null ? null : VisitType.fromId(type);
}
public void setType(VisitType type) {
this.type = type == null ? null : type.getId();
}
public String getVisitNumber() {
return visitNumber;
}
public void setVisitNumber(String visitNumber) {
this.visitNumber = visitNumber;
}
public Boolean getPaid() {
return paid;
}
public void setPaid(Boolean paid) {
this.paid = paid;
}
public void setVisitDate(Date visitDate) {
this.visitDate = visitDate;
}
public Date getVisitDate() {
return visitDate;
}
public void setDescription(String description) {
this.description = description;
}
public String getDescription() {
return description;
}
public void setPet(Pet pet) {
this.pet = pet;
}
public Pet getPet() {
return pet;
}
@PostConstruct
private void initVisitDate() {
if (visitDate == null) {
setVisitDate(today());
}
}
private Date today() {
TimeSource timeSource = AppBeans.get(TimeSource.class);
return timeSource.currentTimestamp();
}
} | java |
To Start receiving timely alerts please follow the below steps:
Click on the Menu icon of the browser, it opens up a list of options.
Click on the “Options ”, it opens up the settings page,
Here click on the “Privacy & Security” options listed on the left hand side of the page.
Scroll down the page to the “Permission” section .
Here click on the “Settings” tab of the Notification option.
A pop up will open with all listed sites, select the option “ALLOW“, for the respective site under the status head to allow the notification.
Once the changes is done, click on the “Save Changes” option to save the changes.
પહેલી વખત રેમ્પ પર ઉતરી નેશનલ ક્રશ રશ્મિકા મંદાના, રેડ લહેંગામાં મહેફિલ લૂટી!
મલાઈકા અરોરા ચડાવ્યો ઇન્ટરનેટનો પારો, ડીપનેક ટ્રાન્સપરન્ટ ગાઉન પહેરી ફેન્સને કર્યા મદહોશ!
હર ઘર તિરંગા કાર્યક્રમની ઉજવણી માટે પાલનપુર નગરપાલિકામાં બેઠક યોજાઈ!
બનાસકાંઠાની 148 સરકારી અને 57 ખાનગી હોસ્પિટલોમાં PMJAY યોજના હેઠળ સારવાર ઉપલબ્ધ!
કોણ છે સાઈન્ટિસ્ટ મંજુ બંગલોર? જેના બિકીની ફોટો સોશિયલ મીડિયા પર વાયરલ થઈ રહ્યાં છે!
Do you want to clear all the notifications from your inbox?
) for our message and click on the activation link.
| english |
The gaming laptop category has a wide variety of choices. While most of them are advertised to be desktop replacements, there’s still a handful of them that can be used as portable machines. The MSI Stealth 14 Studio has a very aesthetically pleasing design in the latter category. The laptop is powered by an Intel i7-13700H paired with the RTX 4060 GPU. It is targeted towards not only gamers but also content creators. So, at an asking price of Rs 1,94,990, can the MSI Stealth 14 Studio be a good choice? Let’s find out.
What Is Good?
What Is Bad?
- The laptop sports a 14-inch display with a 16:10 aspect ratio.
- The Stealth Studio 14 has a decent set of ports but misses out on a few important ones.
The first look at the Stealth 14 evokes a feeling of ‘Oh, I have seen that somewhere’! Sure enough, it has a similar look and feels to the Zephryus G14 (Review), but it lacks the AnimeMatrix lid. That’s not to say that the Stealth 14 completely apes it, but it will appeal to a similar audience.
The Stealth 14 Studio’s outer shell is available in two colourways: Star Blue and Pure White. The latter is not subtle by any means but is aesthetically pleasing and quite a looker. The lid only has the MSI logo on the top. While it does not collect fingerprint smudges, the white exterior is surely a home for dirt. With an appropriate balance between magnesium alloy and good-quality plastic, the Stealth Studio 14 tips the scales at 1.7kg — which is lighter than the HP Omen Transcend 16 (Review).
The laptop is relatively easier to pick up and carry around when compared to other gaming-oriented devices in the market. The hinge is quite sturdy and can be easily opened with a single hand. It can go all the way down to 180 degrees, providing you with multiple viewing angles. The underside of the laptop also has vents for optimal airflow with three rubber stands to keep the thing stable on a table.
The Stealth 14 Studio believes in subtlety when it comes to the RGB bling, and we love that. A portion below the lid extends a bit. This is home to the exhausts. It is very playfully designed for the RGB lights as well. You’ll find ‘Stealth’ written on the rear vents with more subtle RGB arrays on either side.
The Stealth Studio 14 compromises on port connectivity because of its smaller form factor. Regardless, you’ll find most of the essential ones here. The left side features a power connector, an HDMI 2.1 port, and a USB Type-C port with Thunderbolt 4 support. On the right side, you’ll find a USB Type-C Gen2 port, a USB Type-A port, and an audio jack.
Now, the single USB Type-A port can be a letdown — furthermore, its placement on the right side of the laptop makes using an external mouse a bit tougher, primarily when gaming. An ethernet jack and a microSD card reader slot are both missing. These would have been valuable additions.
The matte black painted keyboard deck tends to collect dust. MSI has focussed more on the trackpad, as the keyboard seems to be crammed on the upper side. Nevertheless, the keys are adequately spaced, avoiding any textual mishaps. The chiclet-style keyboard is responsive and has decent travel. While it is good for typing, we did not quite enjoy its company while gaming.
The arrow keys have been crammed between the Page Up and Page Down buttons. We’ve raged over this on multiple occasions. For RGB duties, MSI has partnered with SteelSeries with per-key lighting. You can tweak the colours on the MSI Center.
The trackpad is pretty large and gives you a lot of room to perform thumb acrobatics. The clicks are decent, too. On either side of the trackpad, you’ll find a speaker grille. The audio output is crisp and clear and has a decent amount of bass. It’s great for listening to music and even while watching movies. One downside, though — if you crank the volume to full, the chassis vibrates.
The 14-inch display runs at 240Hz for all your gaming needs. It has a resolution of 2560×1600 pixels and an aspect ratio of 16:10. The IPS panel covers 100 per cent of the DCI-P3 colour gamut. This is good for most games and can be used for photo or video editing.
With the MSI True Colour feature, you get granular control over the colour spaces, which is nice. The display is bright enough to operate outdoors, and the viewing angles are good. HDR video streaming is also supported on this panel.
Watching movies and TV shows on the display was a good experience, and the colours were close to natural. Games such as Death Stranding and Dying Light 2 also look quite immersive. At the top, you’ll find a webcam that can record at 720p. The webcam quality is average and tends to switch between colour temperatures when on a call. You also get a physical shutter button and LED light for privacy.
- An Intel i7-13700H powers the MSI Stealth Studio 14.
- The laptop has 16GB of LPDDR5 RAM running at 5200MHz.
Inside, the Stealth 14 Studio is powered by Intel’s i7-13700H. The processor has 14 cores (6P + 8E) and 20 threads. It can go up to a boost clock speed of 5.0GHz while drawing a base power of 45W. Comparing it to last year’s i7-12700H, we can see a bunch of improvements, especially in the power efficiency department. Seeing these components fit into a smaller footprint that barely weighs much is pretty impressive. As for connectivity, you get Wi-Fi 6E and Bluetooth 5.3.
The laptop is capable of breezing through intensive tasks and games without much of an issue. We did not experience a single hint of struggle, and the benchmark numbers concur.
While it falls behind in Cinebench R23 tests, the Stealth 14 Studio beats the Asus TUF Gaming A15 (Review) and Gigabyte Aorus 15 BSF (Review) in multi-core tests. However, the price difference should also be considered. In 3DMark’s CPU profile tests, it scored a maximum thread of 8,080, which easily beats the Omen Transcend 16. In gaming-centric benchmarks such as Port Royal, it returned a score of 4648.
As for CrystalDiskMark, the SSD speeds were rather impressive. We managed to clock a sequential read and write speed of 6550 MB/s and 4721 MB/s, respectively.
Since the Stealth Studio 14 is also capable of video editing, we ran a render test using a 10-minute 1080p video spiced up with a few graphical templates. It took the laptop exactly five minutes to export the entire sequence.
Like most companion apps in gaming laptops, the Stealth Studio 14 also gets one. The MSI Center is a handy tool that is easy for laymen to use. Inside, you get to monitor hardware usage, run diagnosis, tweak around with RGB presets, and more. You can also switch to the discrete GPU here for better game performance.
The laptop can run most AAA titles without much fuss. If you plan on playing at native resolution, we recommend choosing the medium graphic preset for optimal performance. Playing at higher settings is best reserved for the full HD resolution option. The benchmark numbers below should help you give an idea. All the games mentioned have been played at ‘High’ preset settings and native resolution.
|Average Frame Rates (FPS)
|Shadow of the Tomb Raider (Benchmark)
|Dying Light 2 (Benchmark)
Speaking of the thermal situation, while delivering infinite parcels around Death Stranding, we noticed the keyboard warming to 42.6 degrees — primarily around the WASD keys.
There weren’t many apparent stutters, with the Stealth Studio 14 throwing out air at audible levels. However, the underside of the laptop is also prone to heat, so it’s best kept on a table.
The Stealth 14 Studio carries a 72 WHr battery inside. Gaming laptops are notoriously known for their short battery life, and this one also falls under the same category but with a slightly more appropriate run time.
The laptop lasted us roughly three hours with medium usage. It lasts more than the Zephyrus M16 (2023), which has a larger battery capacity — but also more power-hungry components. It’s best if used with integrated graphics for a slightly longer battery life.
The 240W charger inside the box fills up the battery in about two hours and fifteen minutes.
MSI’s attempt at fitting these components in a smaller form factor is commendable. And it does so whilst looking good. The 14-inch display is sufficient for gaming movie watching, and filling up infinite numbers on Excel — in short, it’s a versatile panel. The keyboard and trackpad experience was pretty good, paired with per-key RGB goodness.
The Stealth Studio 14 deals with daily tasks and office work with ease. It also handles demanding games and video editing software well. While the battery life is still somewhat palatable for a gaming laptop, the heating situation could have been controlled better.
The Stealth 14 Studio is a good choice for gaming and balanced usage, but if battery and heating woes worry you — the Asus TUF A15 (Review) could be a good alternative. As for other options, the Gigabyte AORUS 15 BSF (Review) is also available at a lower price. However, the Zephyrus G14 (Review) is a way more cost-effective solution than these, except it’s a year old.
If you want more CPU power (which comes at a cost), the Omen Transcend 16 (Review) with Intel i7-13700HX could serve you well.
| english |
Hyderabad FC kicked off their title defence on a brilliant note and won five of their first six games in the ninth season of the Indian Super League. The table-toppers will now aim to carry forward their six-match unbeaten as they are set to face Kerala Blasters on Saturday. The two teams will be in action at the G. M. C. Balayogi Athletic Stadium in Hyderabad.
The defending champions will come into the fixture after getting the better of Jamshedpur FC, in their last match. Hyderabad FC midfielder Mohammad Yasir scored the solitary goal of the game to defeat last season’s shield winners.
Meanwhile, Kerala Blasters won two matches back-to-back to regain much-needed momentum ahead of the crucial Saturday fixture. After securing three wins from six matches, Ivan Vukomanovic’s men are currently placed in the fifth position on the Indian Super League points table.
Ahead of the ISL match between Hyderabad FC and Kerala Blasters FC, here is all you need to know:
On what date will the ISL 2022-23 match between Hyderabad FC and Kerala Blasters FC be played?
The ISL 2022-23 match between Hyderabad FC and Kerala Blasters FC will take place on November 19, Saturday.
Where will the ISL 2022-23 match Hyderabad FC vs Kerala Blasters FC be played?
The ISL match between Hyderabad FC and Kerala Blasters FC will be played at the G. M. C. Balayogi Athletic Stadium, in Hyderabad.
What time will the ISL 2022-23 match Hyderabad FC vs Kerala Blasters FC begin?
The ISL match between Hyderabad FC and Kerala Blasters FC will begin at 7:30 pm IST.
Which TV channels will broadcast Hyderabad FC vs Kerala Blasters FC ISL match?
Hyderabad FC vs Kerala Blasters FC ISL match will be televised on Star Sports Network in India.
How do I watch the live streaming of the Hyderabad FC vs Kerala Blasters FC ISL match?
Hyderabad FC vs Kerala Blasters FC ISL match will be streamed live on Disney+Hotstar.
Hyderabad FC vs Kerala Blasters FC Possible Starting XI:
Hyderabad FC Predicted Starting Line-up: Laxmikant Kattimani, Nikhil Poojary, Odei Onaindia, Chinglensana Singh, Akash Mishra, Joao Victor, Hitesh Sharma, Mohammad Yasir, Halicharan Narzary, Javier Siverio, Bartholomew Ogbeche, | english |
/*
* Copyright (c) 2019. Partners HealthCare and other members of
* Forome Association
*
* Developed by <NAME> based on contributions by <NAME>,
* <NAME>, <NAME> and other members of Division of
* Genetics, Brigham and Women's Hospital
*
* 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.
*
*/
#all {
width: 100%;
height: 100%;
align-items: stretch;
margin: 0px;
padding: 0px;
white-space: nowrap;
display: flex;
flex-direction: row;
}
#left {
background-color:#333455;
overflow-y: auto;
overflow-x: hidden;
white-space: nowrap;
height: 100%;
max-height: 100%;
width: 250px;
min-width: 250px;
margin-right: 3px;
color: white;
white-space: normal;
}
#right {
margin-top: 2px;
overflow-y: hidden;
overflow-x: hidden;
white-space: nowrap;
height: 100%;
max-height: 100%;
width: 100%;
display: flex;
flex-direction: column;
}
#title {
background-color:#333455;
color: white;
width: 100%;
max-width: 100%;
height: 40px;
min-height: 40px;
padding: 5px;
margin-bottom: 2px;
}
#doc-content {
width: 100%;
max-width: 100%;
height: 100%;
border: 0px;
}
#doc-list {
margin-top: 30px;
}
div.doc-ref {
cursor: pointer;
padding: 5px;
}
div.grp-ref {
padding-top: 10px;
padding-left: 10px;
cursor: default;
}
div.grp-ref span {
font-size: 80%;
}
div.doc-ref.cur {
color: yellow;
cursor: default;
}
span#ds-name {
font-weight: bold;
cursor: pointer;
}
span#ds-name:hover {
color: yellow;
}
| css |
A Research team from NYU Abu Dhabi’s Magzoub lab has made considerable advances in the fight against cancer using biocompatible nanospheres that have the potential to replace traditional forms of treatment.
The experiments trialed photodynamic therapy (PDT) and photothermal therapy (PTT), which use non-invasive light waves to destroy cancers, avoiding the well-known side effects of chemo and radiotherapy.
Photodynamic therapy works by releasing a torrent of reactive oxygen species (ROS) onto cancer cells, whereas photothermal therapy converts light into searing heat, destroying tumor tissues through hyperthermia.
The research team has detailed their findings in a paper entitled “pH-Responsive Upconversion Mesoporous Silica Nanospheres for Combined Multimodal Diagnostic Imaging and Targeted Photodynamic and Photothermal Cancer Therapy”. The literature goes on to explain how the nanospheres are able to protect encapsulated photosensitizers and photothermal agents from degrading, enabling them to be delivered directly to cancer cells.
Alongside thermal and fluorescent imaging, traditional magnetic resonance imaging (MRI) is also used for tumor detection and monitoring. Once cancer is detected, the PDT and PTT can kill tumors without leaving toxic traces in the body.
Loganathan Palanikumar, a senior researcher in the NYUAD Magzoub lab, explained the process, “To make PDT effective, we need enough photosensitizer in the tumor tissue, while PTT requires a substantial accumulation of photothermal agents within tumors”.
Mazin Magzoub, NYUAD associate professor of biology and Magzoub lab leader, added, “New therapeutic approaches are desperately needed to enhance the existing arsenal of cancer-fighting treatments”.
Magzoub lab’s new treatments offer real hope that cancers could soon be treated with minimal stress and danger to patients, leading to a brighter future free from one of the world’s most feared and destructive diseases.
The post NYU Abu Dhabi Develops Cancer-Fighting Nanospheres appeared first on Tech Magazine.
| english |
Chelsea outcast Tiemoue Bakayoko is reportedly keen to join Italian giants AC Milan this summer. Tiemoue Bakayoko spent the 2018-19 season on loan with AC Milan, during which he became a key player for the club.
According to Pianeta Milan, AC Milan could be interested in signing the Chelsea star on loan with an option to buy at the end of the season. This would mean that Chelsea would need to extend his current contract by a year.
Reports have suggested that the club has extended Bakayoko's deal by 'taking advantage of the unilateral clause for renewal'.
Tiemoue Bakayoko joined Chelsea from AS Monaco in a deal worth £40 million. Prior to his move to Stamford Bridge, Bakayoko was one of the brightest prospects in French football.
He played a pivotal role in Monaco's Ligue 1 triumph in the 2016-17 season and the club's run to the Champions League final that year.
Bakayoko was expected to develop into a star at Chelsea due to his work rate, tackling and physical attributes. Chelsea fans expected the 26-year-old to be the perfect partner for N'Golo Kante in the centre of midfield.
He, however, struggled to cope with the speed and physicality of the Premier League. Bakayoko made 29 Premier League appearances in his debut season with the club, during which he struggled to maintain consistency.
The former AS Monaco star has spent the last three seasons on loan at AC Milan, AS Monaco and Napoli. Bakayoko played some of his best football whilst on loan at AC Milan and is reportedly keen to rejoin the club this summer.
AC Milan has already completed the signing of 23-year-old defender Fikayo Tomori from Chelsea this summer.
The Chelsea youth product spent the second half of the 2020-21 season on loan with the Italian club and put in a number of impressive performances.
AC Milan is also reportedly in talks with Chelsea over a move for French striker Olivier Giroud.
Tiemoue Bakayoko will therefore fancy his chances of sealing a move to AC Milan from Chelsea due to the two clubs' close relationship. | english |
After 3 consecutive years of top line de-growth, Prithvi manages to post a double digit positive growth during FY13. Last two years can be termed as a period of regrouping for the company which did face a range of business challenges. As part of its rebound strategy, the company exited from low margin businesses and concentrated on high growth verticals. While telecom and BFSI are the two major verticals, it also upped its ante in other verticals like healthcare and retail.
| english |
A look back at the Patriot League men's basketball champions.
The Patriot League holds an annual men’s basketball tournament with the winner getting an automatic bid to the NCAA Men’s Basketball Tournament.
The conference features 10 teams, including American, Army, Boston University, Bucknell, Colgate, Holy Cross, Lafayette, Lehigh, Loyola-Maryland and Navy.
The Patriot League tournament begins March 3 and runs through March 14.
The Patriot League began its conference tournament in 1991.
Here are the past winners of the Patriot League championship.
Boston won its first Patriot League championship in 2020. The Terriers upset Colgate, 64-61. Max Mahoney was named tournament MVP.
Colgate won its first tournament since 1996. The Raiders defeated Bucknell, 94-80 in 2019. Jordan Burns was named MVP.
Bucknell finished off their repeat title against Colgate, 83-54. Stephen Brown led the Bison to the victory and was named MVP.
Zach Thomas and the Bison defeated Lehigh, 81-65, to advance to the NCAA tournament. Thomas was named MVP.
Holy Cross picked up its first Patriot League championship victory since 2007. The Crusaders defeated Lehigh, 59-56. Malachi Alexander was named MVP of the tournament.
Lafayette won its first Patriot League title since 2000. They defeated American, 65-35. Nick Linder was named MVP of the tournament.
American finally got back to the NCAA Tournament with a Patriot League win over Boston University. The Eagles won, 55-36. Darius Gardner was named MVP.
Mike Muscala led Bucknell to a 64-56 victory over Lafayette in 2013. Muscala was named MVP for the second time.
C. J. McCollum, future NBA star, was among the top players to come through Lehigh. He helped Leigh to an 82-77 victory over Bucknell. McCollum came away with the MVP.
Bucknell had another successful year in 2011. The Bison defeated Lafayette, 72-57. Mike Muscala won the MVP of the tournament.
Lehigh won its first Patriot League title since 2004. The Mountain Hawks defeated Lafayette, 74-59. Zahir Carrington was named the MVP of the tournament.
American went back-to-back in 2009. The Eagles defeated Holy Cross, 73-57. Garrison Carr won the MVP award. It was the second of his career.
American won its first Patriot League title in 2008. The Eagles defeated Colgate, 52-46. Garrison Carr was named MVP of the tournament.
Holy Cross won its fifth Patriot League title in 2007. The Crusaders defeated Bucknell, 74-66. Keith Simmons was named MVP of the tournament.
Bucknell and Charles Lee would secure a second straight title in 2006. Lee was named MVP and became the first two-time Patriot League tournament MVP. The Bison defeated Holy Cross, 74-59.
Bucknell would finally come away a winner of the Patriot League in 2005. The Bison defeated Holy Cross. 61-57. Charles Lee won the MVP award.
Lehigh came away with its first Patriot League title in 2004. They edged out American, 59-57. Austen Rowland was named MVP of the tournament.
A third straight title for Holy Cross came against American in 2003. The Crusaders defeated the Eagles, 72-64. Patrick Whearty was named MVP of that tournament.
The Crusaders came back the next year and won again. Holy Cross defeated American, 58-54. Tim Szatko was named MVP of the tournament.
Holy Cross kicked off its own three-peat with an overtime victory against Navy, 68-64. John Sankes was named MVP of the tournament.
Lafayette went back-to-back in 2000. They defeated Navy, 87-61. Stefan Ciosici was named the MVP of the tournament that year.
Lafayette won its first Patriot League championship in 1999. They defeated Bucknell, 67-3. Brian Ehlers was named MVP of the tournament.
Navy picked up No. 3 the following year with a win over Lafayette. The Midshipmen won, 93-85. Skip Victor was named the MVP.
Navy picked up its second Patriot League championship in 1997. Navy defeated Bucknell, 76-75. Hassan Booker was named the MVP.
Colgate repeated as Patriot League champs in 1996. The Raiders defeated Holy Cross, 74-65. Future NBA center Adonal Foyle was named the MVP of the tournament.
Colgate finally got through and won the Patriot League title in 1995, getting their revenge on Navy. Colgate won, 68-63. Tucker Neale was named MVP.
Navy got a two-point victory over Colgate in 1994. The Midshipmen won 78-76. T. J. Hall was named the MVP of the tournament.
Holy Cross picked up its first Patriot League title in 1993. The Crusaders defeated Bucknell, 98-73. Rob Feaster won the MVP.
Fordham would take home the title again in 1992. They defeated Bucknell, 70-56. Fred Herzog was named the MVP of the tournament.
Fordham won the first Patriot League championship in 1991. The Rams defeated Holy Cross, 84-81, in overtime. Damon Lopez was named the MVP of the tournament. | english |
<reponame>Diksha-agg/Firmware_val
version https://git-lfs.github.com/spec/v1
oid sha256:8b3f8015d6166788ea5c3ad03dfb8f09b860a264c927e806ea111d551fe3ed21
size 2121
| cpp |
FIA has launched an investigation with its Compliance Department looking into 'media speculation' surrounding a conflict of interest allegation involving Mercedes boss Toto Wolff and his wife Susie Wolff.
In a development that has seemingly caught the F1 world by storm, a media statement was released by the governing body addressing a report by the Business F1 magazine.
The report stated that, at a recent meeting, rival team principals felt the Mercedes boss was privy to information that could only have come from Formula One Management (FOM). It also claimed that rival bosses felt conversations at their private meetings were passed on to FOM via the couple (h/t ESPN).
There have been no public statements issued in this regard by any of the team principals or the respective teams. The report initially did not catch much attention from other media outlets, but it did cause a storm on social media.
The FIA has released a statement seemingly addressing the aforementioned report. The statement did not mention either Mercedes boss Toto Wolff or his wife and head of F1 Academy Susie Wolff. Nevertheless, it was quite clear who it was alluding to. The FIA stated:
"The FIA is aware of media speculation centered on the allegation of information of a confidential nature being passed to an F1 team principal from a member of FOM personnel. The FIA Compliance Department is looking into the matter."
There have never been any substantiated claims around Mercedes boss Toto Wolff with regard to a conflict of interest. But there were questions raised last season when, out of nowhere, the German team was the first to have information about the specific structural changes already in place at the F1 Canadian GP.
There were questions raised by the then Ferrari team principal Mattia Binotto over how something like this was possible. Red Bull's chief advisor Helmut Marko also voiced his concerns about the same, which brought a spotlight on Shaila-Ann Rao's presence in the FIA, since she was associated with Toto Wolff's team in the past.
There have also been question marks around how the cost cap details were first leaked last season in Singapore just before Max Verstappen was about to win the title. These allegations are, however, seemingly uncharted territory for Susie Wolff, who is the head of the F1 Academy.
Such speculations could make things worse for FIA, especially since Mohammed Ben Sulayem has been at loggerheads with F1 in the past as well. Both the FIA and the F1 are at odds over the prospect of fielding an 11th team on the grid, and if this recent controversy is thrown into the mix, then it could stoke the fire even further.
| english |
Hindi Dictionary. Devnagari to roman Dictionary. हिन्दी भाषा का सबसे बड़ा शब्दकोष। देवनागरी और रोमन लिपि में। एक लाख शब्दों का संकलन। स्थानीय और सरल भाषा में व्याख्या।
Aanwla के पर्यायवाची:
Aanwla, Aanwla meaning in English. Aanwla in english. Aanwla in english language. What is meaning of Aanwla in English dictionary? Aanwla ka matalab english me kya hai (Aanwla का अंग्रेजी में मतलब ). Aanwla अंग्रेजी मे मीनिंग. English definition of Aanwla. English meaning of Aanwla. Aanwla का मतलब (मीनिंग) अंग्रेजी में जाने। Aanwla kaun hai? Aanwla kahan hai? Aanwla kya hai? Aanwla kaa arth.
Hindi to english dictionary(शब्दकोश).आंवळा को अंग्रेजी में क्या कहते हैं.
इस श्रेणी से मिलते जुलते शब्द:
ये शब्द भी देखें:
synonyms of Aanwla in Hindi Aanwla ka Samanarthak kya hai? Aanwla Samanarthak, Aanwla synonyms in Hindi, Paryay of Aanwla, Aanwla ka Paryay, In “gkexams” you will find the word synonym of the Aanwla And along with the derivation of the word Aanwla is also given here for your enlightenment. Paryay and Samanarthak both reveal the same expressions. What is the synonym of Aanwla in Hindi?
| english |
<reponame>Jerold25/DarkWeb-Crawling-Indexing<gh_stars>0
<!DOCTYPE html>
<html lang="de">
<head>
<meta charset="utf-8">
<base href="http://www.brisker.at/de/" />
<meta name="revisit-after" content="7 days" />
<meta name="language" content="de" />
<link type="text/css" media="all" rel="stylesheet" href="lib41/styles/styles.min.css" />
<!--[if IE 8]><link type="text/css" rel="stylesheet" href="lib41/styles/ie8.min.css" /><![endif]-->
<link type="text/css" rel="stylesheet" media="print" href="lib41/styles/print.min.css" />
<title>Dreherei-Maschinenbau-CNC in Wien - Brisker GesmbH</title>
<meta name="description" content="Brisker GesmbH - Dreherei-Maschinenbau-CNC in Wien. Seit 1950 produzieren wir Präzisionsdreh- und Frästeile für Gewerbe und Industrie." />
<meta name="google-site-verification" content="RWwWAwtGs8bP9As6QvHHnnkusBh56dQFtMqYKlKRYqI" />
<meta name="robots" content="index,follow" />
<meta name="signature" content="page150507" />
<link rel="canonical" href="http://www.brisker.at" />
<link rel="alternate" media="only screen and (max-width: 640px)" href="http://m.brisker.at" />
</head>
<body class="singlecol home">
<script type="text/javascript">
var dataLayer=dataLayer||[],dataLayerEvent={"envelopeID":"20289","SID":"335423"};
dataLayer.push({'envelopeID': '20289'});
dataLayer.push({'outputtype': 'desktop'});
dataLayer.push({'server': '7'});
dataLayer.push({'SID': '335423'});
dataLayer.push({'envelopeHostname': 'www.brisker.at'});
</script>
<!-- Google Tag Manager -->
<script type="text/javascript">(function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='//www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-TVLVC2');</script>
<!-- End Google Tag Manager -->
<div id="cta-button">
<a href="anfrage/" rel="noopener">Ihre Anfrage</a><div id="cta-button-form" class="invisible">
<form class="jsform" id="jsform_cta-button-form" action="/" method="post">
<fieldset>
<input type="hidden" name="$FormName$" value="jsform_cta-button-form" />
<input type="hidden" name="$FormAction$" value="/" />
<input type="hidden" name="$Origin$" value="http://www.brisker.at/" />
</fieldset>
<fieldset class="form-wrapper left-col">
<ul>
<li><label for="jsform_cta-button-form_firstname">Vorname</label>
<input id="jsform_cta-button-form_firstname" type="text" maxlength="50" size="14" name="FirstName" value="" />
</li>
<li><label for="jsform_cta-button-form_lastname">Nachname</label>
<input id="jsform_cta-button-form_lastname" type="text" maxlength="50" size="28" name="LastName" value="" />
</li>
<li><label for="jsform_cta-button-form_phone">Telefon</label>
<input id="jsform_cta-button-form_phone" type="text" maxlength="50" size="25" name="Phone" value="" />
</li>
<li><label for="jsform_cta-button-form_email">E-Mail <span>*</span>
</label>
<input id="jsform_cta-button-form_email" type="text" maxlength="200" size="53" name="Email" value="" />
</li>
</ul>
</fieldset>
<fieldset class="form-wrapper"><label for="jsform_cta-button-form_yourmessage">Ihre Nachricht</label>
<textarea name="YourMessage" id="jsform_cta-button-form_yourmessage" cols="52" rows="10"></textarea>
</fieldset>
<fieldset><input type="hidden" name="formstyle" value="49190109bec8fa887b3e31b36afc444b531ea03ad4ac5eb6a931bf6bb32cda28" />
<p>Bitte geben Sie den 5-stelligen Sicherheitscode in unten stehendes Textfeld ein: <span class="btw_codedstring" style="display:none;">%46%38%34%33%46</span></p>
<label for="jsform_cta-button-form_code">Sicherheitscode <span>*</span></label>
<input id="jsform_cta-button-form_code" type="text" maxlength="5" size="5" name="seccode" value="" />
</fieldset>
<fieldset><p>Es werden personenbezogene Daten ermittelt und für die in der <a href="datenschutzerklärung/" class="privacy_policy" rel="nofollow">Datenschutzerklärung</a> beschriebenen Zwecke verwendet.</p></fieldset><fieldset>
<ul class="mdb_form_submit">
<li>
<input type="submit" class="btn_absenden" title="Absenden" name="Absenden" value="Absenden" />
</li>
</ul>
</fieldset>
</form>
</div>
</div>
<div id="wrapper-header">
<div id="header">
<div><a id="pagetop"></a></div>
<p class="structurelabel"><a href="http://www.brisker.at/#inhalt" class="hash_link">Zum Inhalt</a></p>
<p class="structurelabel"><a href="http://www.brisker.at/#mainmenue" class="hash_link">Zur Navigation</a></p>
<a id="logo" href="http://www.brisker.at"><span></span></a>
<p id="hotline">01259 50 17</p></div>
</div>
<div id="wrapper-main">
<div id="wrapper-treemenu">
<div id="mainmenue">
<ul>
<li class="sel"><a href="/">Home</a></li>
<li><a href="produkte/">Produkte</a></li>
<li><a href="maschinenpark/">Maschinenpark</a></li>
<li><a href="unternehmen/">Unternehmen</a></li>
<li><a href="anfrage/">Anfrage</a></li>
<li><a href="kontakt/">Kontakt</a></li>
</ul>
</div>
</div>
<div id="wrapper-slideshow">
<div id="slideshow" class="slider">
<div class="slides">
<ul>
<li>
<div class="show-text">
<p class="body">Unsere Produkte zeichnen sich durch absolute Präzision und höchste Qualität aus.</p><a href="produkte/" class="btn-cta">mehr dazu</a></div>
</li>
<li class="invisible">
<div class="show-text">
<p class="body">Unsere modernen Maschinen arbeiten in bis zu 3 Schichten.</p><a href="maschinenpark/" class="btn-cta">mehr dazu</a></div>
</li>
<li class="invisible">
<div class="show-text">
<p class="body">Unsere Erfolgsgeschichte startete im Jahr 1950 in einem Hinterhof.</p><a href="unternehmen/" class="btn-cta">mehr dazu</a></div>
</li>
</ul>
<div class="ctrls">
<a href="#" class="btn-prev"><</a>
<a href="#" class="btn-next">></a>
<a href="#" class="btn-stop">Stop</a>
<a href="#" class="btn-start">Start</a>
</div>
</div>
</div>
</div>
<div id="wrapper-content">
<div id="content">
<div id="primarycontent">
<a id="inhalt"></a>
<h1>Br<NAME> - Dreherei-Maschinenbau-CNC in Wien</h1>
<p>Herzlich willkommen!</p>
<p>Wir produzieren Präzisionsdreh- und Frästeile für Gewerbe und Industrie. Unseren Kunden bieten wir über Jahrzehnte gewachsene Fachkompetenz und Hilfestellung bei der Umsetzung sämtlicher Anforderungen.</p>
<p>Die Brisker GesmbH versteht sich als Zulieferer und Entwicklungspartner, der sich in der Branche einen guten Namen gemacht hat. Unsere Präzisionsdreh- und Frästeile stellen wir vorwiegend für folgende Branchen bzw. Produkte her:</p>
<ul>
<li>Automobilindustrie</li>
<li>Maschinenbau</li>
<li>Medizinische Geräte</li>
<li>Optik</li>
<li>Schienenfahrzeuge</li>
<li>Bühnenbau</li>
<li>Heiztechnik</li>
<li>Sport- und Fitnessartikel</li>
</ul>
<p>Â </p>
<p>Wir beschäftigen um die 30 Mitarbeiter. Unsere Unternehmenskultur erlaubt es unseren Mitarbeitern sich mit ihrer Arbeit voll und ganz zu identifizieren, wodurch die groÃe Präzision, mit der unsere Teile hergestellt werden müssen, garantiert wird.</p>
<p>Â </p>
<p><b>Höchste Präzision und Qualität sind bei uns das Maà aller Dinge! </b></p>
<p>Das Brisker-Team erledigt Aufträge prompt und trotzdem mit Genauigkeit und in höchster Qualität. Wir erfüllen unsere Aufgaben kompetent, rasch und effizient, von der richtigen Materialauswahl über das Produktdesign bis hin zur Fertigung und Montage. Aufgrund jahrzehntelanger Erfahrung und Fachkompetenz können wir für Spezialaufträge jederzeit eigene Produktionsprozesse und Werkzeuge entwickeln.</p>
<p>Ein reibungsloser und prozesssicherer Produktionsablauf wird durch unsere automatisierte Fertigung mit modernsten Maschinen garantiert. Die Ãberprüfung und Kontrolle der erforderlichen Qualität wird von unseren geschulten Mitarbeitern übernommen â vom Erstmusterprüfbericht bis hin zur protokollierten Ausgangsmessung. Seit 1999 hat Brisker GmbH das Qualitätssystem, das vom TÃV Austria gemäà EN ISO 9001 in der jeweiligen gültigen Fassung zertifiziert ist.</p>
<br class="clearer" />
<p><a href="/upload/2222392_Zertifikat%202018.pdf" data-download="1" class="dl-default download-pdf" title="TÃV Zertifikat">TÃV Zertifikat (pdf)</a></p>
<br class="clearer" />
<h2>Brisker Gesellschaft m.b.H. -Â Dreherei-Maschinenbau-CNC Produkte</h2>
<p>Rautenweg 39<br />1220 Wien<br />Tel: 01/259 50 17<br />Fax: 01/259 50 42<br />Email: <a href="mailto:<EMAIL>"><EMAIL></a></p>
<p>Â </p>
<h3>Absolute Präzision von der Brisker GesmbH in Wien - Drehteile und Frästeile für Gewerbe und Industrie!</h3>
</div>
<br class="clearer" />
</div>
</div>
<div id="wrapper-footer">
<div id="footer">
<div id="contact">
<div class="footer-outer">
<div class="footer-left">
<p class="vcard"><span class="fn org">Brisker GesmbH</span><span class="adr"> | <span class="street-address">Rautenweg 39</span> | <span class="postal-code">1220</span> <span class="locality">Wien</span></span></p>
<ul class="footer-linklist"><li><a href="impressum/" class="imprint" rel="nofollow">Impressum</a></li><li> | <a href="datenschutzerklärung/" class="privacy_policy" rel="nofollow">Datenschutzerklärung</a></li><li> | <a href="sitemap/" class="sitemap" rel="nofollow">Sitemap</a></li><li> | <a href="kontakt/" class="contact" rel="nofollow">Kontakt</a></li><li> | <a href="http://m.brisker.at" class="switch_to_mobile">zur mobilen Ausgabe</a></li><li> | <a class="mod_mail contact_email">%6F%66%66%69%63%65%40%62%72%69%73%6B%65%72%2E%61%74%%%3C%73%70%61%6E%3E%6F%66%66%69%63%65%40%62%72%69%73%6B%65%72%2E%61%74%3C%2F%73%70%61%6E%3E</a></li></ul>
<p class="structurelabel"><a href="http://www.brisker.at/#pagetop" class="hash_link to_top">top</a></p></div>
<br class="clearer" />
<div id="system-provider-wrapper">
<span id="edit-dark">
<a href="http://website.herold.at" target="_blank" rel="noopener nofollow" id="btn_toggleeditcontrols" class="env-edit-toggle" title="ClearSense AT Version: 3.22"></a>
</span>
<p class="link-system-provider-dark"><a href="http://website.herold.at" target="_blank" rel="noopener nofollow">powered by HEROLD</a></p>
</div>
</div>
<div class="socialmedia">
</div>
</div>
</div>
</div>
</div>
<div id="cookie_note" data-cookie-id="10020289">Diese Website verwendet Cookies. Es kommt daher zu einer Ermittlung und Speicherung von Daten. Informationen zur Datenverarbeitung sowie zur Möglichkeit, dies abzulehnen, erhalten Sie in der Datenschutzerklärung. <a href="datenschutzerklärung/" rel="nofollow">Datenschutzerklärung anzeigen</a>
<form method="post" action="/">
<button name="%FormName%" value="DataProtection.CookiesNotificationDisable">Diese Information nicht mehr anzeigen</button>
</form>
</div><script type="text/javascript" src="lib41/scripts/lib.min.js"></script>
<script type="text/javascript" src="https://herold.adplorer.com/herold.aspx" async></script>
</body>
</html>
#####EOF#####
| html |
"""Tests the `session` module in stand-alone mode."""
########################################
# Dependencies #
########################################
import parent # noqa F401
import mph
from fixtures import logging_disabled
from pytest import raises
from platform import system
from sys import argv
import logging
########################################
# Tests #
########################################
def test_start():
if system() != 'Windows':
return
client = mph.start(cores=1)
assert client.java
assert client.cores == 1
assert repr(client) == 'Client(stand-alone)'
model = client.create('empty')
assert 'empty' in client.names()
assert model in client.models()
(model/'components').create(True)
client.remove(model)
assert 'empty' not in client.names()
assert model not in client.models()
with logging_disabled():
with raises(Exception, match='Model node X is removed'):
model.java.component()
with raises(ValueError):
client.remove(model)
with raises(RuntimeError):
client.connect(2036)
with raises(RuntimeError):
client.disconnect()
########################################
# Main #
########################################
if __name__ == '__main__':
arguments = argv[1:]
if 'log' in arguments:
logging.basicConfig(
level = logging.DEBUG if 'debug' in arguments else logging.INFO,
format = '[%(asctime)s.%(msecs)03d] %(message)s',
datefmt = '%H:%M:%S')
test_start()
| python |
Every year, thousands of Bangladeshis embark on foreign trips for various purposes. From education and health to recreational needs, the number of Bangladeshis opting for foreign travel is increasing exponentially. With a limited validity on a passport, it becomes necessary to get the passport renewed at some point. Considering the bureaucratic hassle involved, here’s a comprehensive guide on how to renew a Bangladeshi MRP passport.
There are mainly three types of passports in Bangladesh: handwritten, machine-readable, and e-passport. The last handwritten passport was issued in 2010 and considering each passport has a maximum validity of 10 years, all handwritten passports are obsolete at this point.
Currently, passports are available either as MRP or e-passports. E-passports have been made available on a rollout basis starting in 2020. As of 2022, all the regional passport offices of Bangladesh are now offering the e-passport service. As a result, anyone holding an MRP passport can easily apply for reissuing their passport as an e-passport in the following way.
The process of applying for e-passports is a hybrid one. You need to apply for the passport online and visit the regional passport office (in accordance with your present address) for biometric verification. Follow the steps below.
The first step is to open an account on the official e-passport website. Here you will have to select whether you are currently in Bangladesh or not.
| english |
package testutil
import (
"fmt"
"io"
"os"
"path"
"github.com/influxdata/telegraf/plugins/common/tls"
)
type pki struct {
path string
}
func NewPKI(path string) *pki {
return &pki{path: path}
}
func (p *pki) TLSClientConfig() *tls.ClientConfig {
return &tls.ClientConfig{
TLSCA: p.CACertPath(),
TLSCert: p.ClientCertPath(),
TLSKey: p.ClientKeyPath(),
}
}
func (p *pki) TLSServerConfig() *tls.ServerConfig {
return &tls.ServerConfig{
TLSAllowedCACerts: []string{p.CACertPath()},
TLSCert: p.ServerCertPath(),
TLSKey: p.ServerKeyPath(),
TLSCipherSuites: []string{p.CipherSuite()},
TLSMinVersion: p.TLSMinVersion(),
TLSMaxVersion: p.TLSMaxVersion(),
}
}
func (p *pki) ReadCACert() string {
return readCertificate(p.CACertPath())
}
func (p *pki) CACertPath() string {
return path.Join(p.path, "cacert.pem")
}
func (p *pki) CipherSuite() string {
return "TLS_RSA_WITH_3DES_EDE_CBC_SHA"
}
func (p *pki) TLSMinVersion() string {
return "TLS11"
}
func (p *pki) TLSMaxVersion() string {
return "TLS12"
}
func (p *pki) ReadClientCert() string {
return readCertificate(p.ClientCertPath())
}
func (p *pki) ClientCertPath() string {
return path.Join(p.path, "clientcert.pem")
}
func (p *pki) ReadClientKey() string {
return readCertificate(p.ClientKeyPath())
}
func (p *pki) ClientKeyPath() string {
return path.Join(p.path, "clientkey.pem")
}
func (p *pki) ReadServerCert() string {
return readCertificate(p.ServerCertPath())
}
func (p *pki) ServerCertPath() string {
return path.Join(p.path, "servercert.pem")
}
func (p *pki) ReadServerKey() string {
return readCertificate(p.ServerKeyPath())
}
func (p *pki) ServerKeyPath() string {
return path.Join(p.path, "serverkey.pem")
}
func readCertificate(filename string) string {
file, err := os.Open(filename)
if err != nil {
panic(fmt.Sprintf("opening %q: %v", filename, err))
}
octets, err := io.ReadAll(file)
if err != nil {
panic(fmt.Sprintf("reading %q: %v", filename, err))
}
return string(octets)
}
| go |
Hi. frnds. I have installed Fedora 7 on my pc. But I don't know how to connect to internet. I have BSNL Broadband which requires username and password (PPPoE in windows)
| english |
Maanga(Manga)
is a tamil comedy movie directon by debut director R S Raja. The Movie Starring with Premji, Power Star, Harsha, Mano Bala and other most artists are participating lead roles.
The Director Says this movie is about Siva's ambition is to become a scientist. He Did lot of things like research and new things But every thing fails. That time met one more premji like 1950 type Bagavadhar. Both Premji takes challenge and wins this game. | english |
<reponame>OmarAshour207/aqar_portfolio<filename>storage/settings.json
{"home":"Home","about_us":"AboutUs","our_services":"OurServices","our_projects":"OurProjects","blogs":"Blogs","contact_us":"ContactUs","login":"Login","profile":"Profile","email":"<EMAIL>","phone":"+1 (269) 974-6396","ar_address":"Facere voluptatem T","en_address":"Non assumenda esse","facebook":"https:\/\/www.xuremu.me","instagram":"https:\/\/www.vuz.co.uk","twitter":"https:\/\/www.buvanilet.tv","linkedin":"https:\/\/www.buvanilet.tv","youtube":"https:\/\/www.buvanilet.tv"} | json |
[{"postal_code":"44266","place_name":"Observatorio","place_type":"Colonia","county":"Guadalajara","state":"Jalisco","city":"Guadalajara"}] | json |
import path from 'path';
import React from 'react';
import { render } from '../../src/index';
jest.setTimeout(30000);
const component = (
<div>
<h1>Component Image</h1>
<h2>Hello world</h2>
</div>
);
describe('render', () => {
it('generates an image', async () => {
const image = await render(component, {
stylesheet: path.resolve(__dirname, '../data/sample.css')
});
expect(image).toBeTruthy();
});
});
| typescript |
pub fn another_mod() {
println!("This is from another submod");
}
| rust |
pub mod suffixes {
pub const INTERACTION: &str = "INTERACTION";
pub const CHECK: &str = "CHECK";
}
pub use self::suffixes::*;
| rust |
package com.springboot.springrestdatajpa.repository;
import org.springframework.data.jpa.repository.JpaRepository;
import org.springframework.stereotype.Repository;
import com.springboot.springrestdatajpa.entity.Employee;
@Repository
public interface EmployeeRepository extends JpaRepository<Employee,Long>{
}
| java |
<gh_stars>1-10
import numpy as np
from garage.replay_buffer import SimpleReplayBuffer
from tests.fixtures.envs.dummy import DummyDiscreteEnv
class TestReplayBuffer:
def test_add_transition_dtype(self):
env = DummyDiscreteEnv()
obs = env.reset()
replay_buffer = SimpleReplayBuffer(
env_spec=env, size_in_transitions=3, time_horizon=1)
replay_buffer.add_transition(
observation=obs, action=env.action_space.sample())
sample = replay_buffer.sample(1)
sample_obs = sample['observation']
sample_action = sample['action']
assert sample_obs.dtype == env.observation_space.dtype
assert sample_action.dtype == env.action_space.dtype
def test_add_transitions_dtype(self):
env = DummyDiscreteEnv()
obs = env.reset()
replay_buffer = SimpleReplayBuffer(
env_spec=env, size_in_transitions=3, time_horizon=1)
replay_buffer.add_transitions(
observation=[obs], action=[env.action_space.sample()])
sample = replay_buffer.sample(1)
sample_obs = sample['observation']
sample_action = sample['action']
assert sample_obs.dtype == env.observation_space.dtype
assert sample_action.dtype == env.action_space.dtype
def test_eviction_policy(self):
env = DummyDiscreteEnv()
obs = env.reset()
replay_buffer = SimpleReplayBuffer(
env_spec=env, size_in_transitions=3, time_horizon=1)
replay_buffer.add_transitions(observation=[obs, obs], action=[1, 2])
assert not replay_buffer.full
replay_buffer.add_transitions(observation=[obs, obs], action=[3, 4])
assert replay_buffer.full
replay_buffer.add_transitions(observation=[obs, obs], action=[5, 6])
replay_buffer.add_transitions(observation=[obs, obs], action=[7, 8])
assert np.array_equal(replay_buffer._buffer['action'], [[7], [8], [6]])
assert replay_buffer.n_transitions_stored == 3
| python |
Play a Mind Game with Will You Press the Button?
Multiplayer shooter on Facebook!
Genial.ly is a web tool that lets you create amazing interactive content.
| english |
<filename>projects/core-app/src/pages/Login/index.tsx
import React from "react";
import Button from "@kit/core/src/Button";
import { useHistory } from "react-router-dom";
export default () => {
const { push } = useHistory();
return (
<div>
Login Page
<Button onClick={() => push("/dashboard")}>Signin</Button>
</div>
);
};
| typescript |
(Reuters) - Statistics for Sunday's Brazilian Grand Prix in Sao Paulo (round 19 of 20 races):
Lap distance: 4. 309km. Total distance: 305. 909km (71 laps)
Race lap record: Juan Pablo Montoya (Colombia) Williams 1:11. 473 (2004)
Mercedes have clinched their fourth constructors' championship in a row and Lewis Hamilton his fourth drivers' crown.
Hamilton, who took the title in Mexico last month, is the same age (32) as Michael Schumacher was when he took his fourth crown.
The Briton was the first driver to be lapped in his title-winning race since compatriot James Hunt in 1976.
British drivers have won 17 championships, more than any other nation. Germany is next on 12.
Hamilton has 62 victories from 206 races and is second in the all-time list behind Schumacher (91). Sebastian Vettel has 46.
Mercedes have won 11 of 18 races this season.
Ferrari have won 228 races since 1950, McLaren 182, Williams 114, Mercedes 75 and Red Bull 55. Former champions McLaren and Williams have not won since 2012.
Hamilton has won nine times this season, Vettel four. Valtteri Bottas and Max Verstappen two each and Daniel Ricciardo once.
Verstappen's three career wins have all come after Russian Daniil Kvyat was dropped or demoted by Red Bull.
Hamilton has an all-time record 72 career poles.
Mercedes have been on pole 13 times in 18 races: Hamilton 11 times and Bottas twice.
Vettel has had four poles this season and his Ferrari team mate Kimi Raikkonen one.
Vettel took the 50th pole of his career in Mexico.
Hamilton has 116 podiums and is second on the all-time list behind Schumacher (155). Vettel has 97, Raikkonen 90.
Hamilton has 12 podiums this season, Vettel and Bottas 11 each. Ricciardo has had nine, the most he has ever scored in a single campaign, and Raikkonen six.
Hamilton is an unassailable 56 points clear of Vettel with two races left.
Sauber's Marcus Ericsson is the only driver yet to score this season of those who have started every race.
Hamilton has 23 scoring finishes in a row, the longest such run of his career. Raikkonen holds the record of 27. Hamilton and Force India's Esteban Ocon are the only drivers to have finished every race so far.
Verstappen has take more points in the last four races than any other driver.
Bottas is only 15 points behind Vettel.
Felipe Massa is the last Brazilian to have won his home grand prix. He has not won since his 2008 success and is now the only Brazilian on the grid.
Four of the current drivers have won in Brazil: Massa (2008, 2006), Vettel (2010, 2013), Raikkonen (2007), Hamilton (2016).
Brazil has been on the calendar since 1973, starting at Interlagos before moving to Rio de Janeiro and then returning to Sao Paulo. The circuit is named after the late Jose Carlos Pace.
Hamilton clinched his first title in Brazil in 2008.
Pole position has translated into victory 13 times in 34 races in Brazil, although the last four have gone with pole.
Massa will be competing in his last home grand prix before retiring at the end of the season.
It has now been five years since McLaren last won a race, at Interlagos with now-retired Jenson Button in 2012.
(Reporting by Alan Baldwin, editing by Amlan Chakraborty) | english |
A 27-year-old man was arrested for stealing and trying to flee with a ring from a jewellery store in Delhi's Connaught Place area, the police said.
The incident happened today when a man entered a Tanishq store and started inquiring about different jewellery items from an employee, Delhi deputy commissioner of police Deepak Yadav said.
The staff at the store got suspicious of his behaviour and informed the police, following which a constable reached the spot.
The man then tried to flee from the store with a ring but was chased down by the constable and caught, the police said.
The accused has been identified as Praveen and is a civil services aspirant. He is a resident of Rohtak in Haryana, the police added.
The whole incident was captured on CCTV cameras inside the showroom.
A video from the CCTV footage showed the accused wearing a mask and sitting across the counter looking at jewellery and talking to a salesperson. He is then seen picking up a ring when the salesperson leaves the counter for some time and keeping it inside his jacket pocket.
The footage also showed a cop later chasing and catching the man outside the showroom as soon as he tries to run away. | english |
{
"body": "AND WHAT DOUBT CAN THERE BE MADE OF IT?",
"next": "https://raw.githubusercontent.com/CAPSELOCKE/CAPSELOCKE/master/tweets/5576.json"
} | json |
An Indian Air Force official said the 15-member team will resume the search for survivors on Thursday.
A 15-member team of rescuers airlifted close to the site of the crash of an AN-32 transport aircraft failed to reach the area due to difficult terrain and inclement weather, PTI reported late on Wednesday. Earlier in the day, reports had said that some rescuers had managed to reach the site.
Nine of the 15 climbers in the team are from the Air Force mountaineering team, four are from the Army and two are civilians.
On Tuesday, an IAF team had found wreckage of the missing aircraft 16 kilometres north of Lipo area, northeast of Tato in Arunachal Pradesh at an approximate elevation of 12,000 feet. On June 3, the transporter aircraft, with 13 people on board, went missing 33 minutes after taking off from Jorhat. It was heading to Menchuka in Arunachal Pradesh, near the China border.
Shi-Yomi District Deputy Commissioner Mito Dirchi told PTI that there are reports of rain and haze all over the mountainous zones of Siang district, making the rescue operation a “herculean task”.
Air officer-commanding-in-chief Eastern Air Command RD Mathur praised the rescue team for its effort, as well as the people of Arunachal Pradesh. “The proud and highly patriotic people of the state have worked tirelessly to help the IAF for a national cause,” he said. Mathur also thanked Arunachal Pradesh Chief Minister Pema Khandu and Chief Secretary Satya Gopa for extending full support to the IAF.
| english |
Just four days after Adelaide United suffered a 2-1 win at home to Western Sydney Wanderers, the two sides will meet again at CommBank Stadium on Sunday.
The visiting side are third in the league standings with 27 points, six points behind league leaders Melbourne City FC. The hosts, on the other hand, are third from bottom in the league standings with 18 points.
The home team have secured a win in their last two home games and will be looking to overcome their western rivals in this A-League fixture.
The two rivals have squared off 29 times across all competitions so far. Western Sydney Wanderers pulled themselves level with the visiting side in the head-to-head record in the league with a win on Wednesday. Adelaide enjoy a 10-9 lead in all competitions while 10 games have ended in draws.
The visiting side are without a win in the last three games in this fixture, with their last win coming at Sunday's venue in 2021.
Vedran Janjetovic and club captain Rhys Williams are the two absentees for the home side. Janjetovic has been ruled out with a long-term injury and Williams has been out with a hamstring issue since January.
Nick Ansell is out for the remainder of the season with an Achilles tendon injury while Kusini Yengi is out with a quadriceps issue. James Delianov is also expected to sit this one out with injury.
Michael Jakobsen became the latest casualty for the visitors with a groin injury in midweek. Jacob Tratt remains out with a hamstring issue but a piece of good news is that Juande returns from a one-game suspension.
The visiting side gave up a one-goal lead on Wednesday to suffer a narrow loss and will be fired up to avenge their defeat here. The hosts are unbeaten in their last two home games but lost out to Western United and Melbourne City FC before those games.
The visiting side have a lengthy list of injuries and might struggle here. It is unlikely that either side will be able to keep a clean sheet and a low-scoring draw seems to be the likely outcome here. | english |
import sys
sys.path.insert(0, '../../../src_python')
import nmpccodegen as nmpc
import nmpccodegen.tools as tools
import nmpccodegen.models as models
import nmpccodegen.controller as controller
import nmpccodegen.controller.obstacles as obstacles
import nmpccodegen.Cfunctions as cfunctions
import nmpccodegen.example_models as example_models
import math
import numpy as np
import matplotlib.pyplot as plt
import math
import sys
import time
def init_controller_files(controller_name):
## -- GENERATE STATIC FILES --
# start by generating the static files and folder of the controller
trailer_controller_location = "../../../test_controller_builds/" + controller_name
tools.Bootstrapper.bootstrap(trailer_controller_location, simulation_tools=True)
return trailer_controller_location
## -----------------------------------------------------------------
def generate_controller_with_obs(trailer_controller_location,reference_state,Q,R,rectangular_obstacle_1,obstacle_weight,horizon,display_figure=True,index_figure=0):
# get the continious system equations
(system_equations,number_of_states,number_of_inputs,coordinates_indices) = example_models.get_trailer_model(L=0.5)
step_size = 0.05
# simulation_time = 10
# number_of_steps = math.ceil(simulation_time / step_size)
integrator = "RK44"
constraint_input = cfunctions.IndicatorBoxFunction([-1,-1],[1,1]) # input needs stay within these borders
model = models.Model_continious(system_equations, constraint_input, step_size, number_of_states,\
number_of_inputs,coordinates_indices, integrator)
# reference_state=np.array([2,2,0])
stage_cost = controller.Stage_cost_QR(model, Q, R)
# define the controller
trailer_controller = controller.Nmpc_panoc(trailer_controller_location,model,stage_cost)
trailer_controller.horizon = horizon
trailer_controller.step_size = step_size
trailer_controller.integrator_casadi = True
trailer_controller.panoc_max_steps= 1000
trailer_controller._lbgfs_buffer_size = 20
trailer_controller.min_residual = -5
# add an obstacle
trailer_controller.add_obstacle(rectangular_obstacle_1)
# generate the code
trailer_controller.generate_code()
# -- simulate controller --
# setup a simulator to test
sim = tools.Simulator(trailer_controller.location)
initial_state=np.array([0.01,0.,0.])
state=initial_state
state_history = np.zeros((number_of_states,horizon))
sim.set_weight_obstacle(0,obstacle_weight)
reference_input = np.array([0, 0])
(sim_data, full_solution) = sim.simulate_nmpc_multistep_solution(initial_state, reference_state, reference_input,
number_of_inputs * horizon)
inputs = np.reshape(full_solution, (horizon, number_of_inputs))
print("solved NMPC problem time="+ sim_data.time_string + " number of panoc iterations=" + str(
sim_data.panoc_interations))
for i in range(0,horizon):
state = model.get_next_state_numpy(state,inputs[i,:])
state_history[:,i] = np.reshape(state[:],number_of_states)
print("Reference state:")
print(reference_state)
print("Final state:")
print(state)
if(display_figure==True):
plt.figure(index_figure)
example_models.trailer_print(state_history)
rectangular_obstacle_1.plot()
plt.xlim([-2.2, 2.2])
plt.ylim([-0.1, 2.2])
# plt.clf()
return state
def main():
# create static files
trailer_move_diag_obs_location_ = init_controller_files("trailer_move_diag_obs")
trailer_move_right_obs_location_ = init_controller_files("trailer_move_right_obs")
trailer_move_move_up_obs_location_ = init_controller_files("trailer_move_up_obs")
# Start simulating:
# TEST 1
rectangular_center_coordinates = np.array([0.75, 0.45])
rectangular_width = 0.5
rectangular_height = 0.3
rectangular_obstacle_1 = obstacles.Obstacle_rectangular(rectangular_center_coordinates, \
rectangular_width, rectangular_height)
Q = np.diag([10., 10., 1.])
R = np.diag([1., 1.]) * 0.01
obstacle_weight = 10000.
horizon = 50
reference_state = np.array([2, 0.5, 0])
current_state = generate_controller_with_obs(trailer_move_diag_obs_location_, reference_state, Q,R, \
rectangular_obstacle_1 , obstacle_weight,\
horizon,display_figure=True,index_figure=0)
# TEST 2
rectangular_center_coordinates_2 = np.array([1, 0.])
rectangular_width_2 = 0.5
rectangular_height_2 = 0.2
rectangular_obstacle_2 = obstacles.Obstacle_rectangular(rectangular_center_coordinates_2, \
rectangular_width_2, rectangular_height_2)
Q = np.diag([10., 10., 1.])*1.
R = np.diag([1., 1.]) * 0.01
obstacle_weight = 1000.
horizon = 50
reference_state = np.array([2, 0, 0])
current_state = generate_controller_with_obs(trailer_move_right_obs_location_, reference_state, Q, R,\
rectangular_obstacle_2,obstacle_weight,horizon,\
display_figure=True,index_figure=1)
# TEST 3
rectangular_center_coordinates = np.array([0.6, 0.5])
rectangular_width = 1.2
rectangular_height = 0.2
rectangular_obstacle_3 = obstacles.Obstacle_rectangular(rectangular_center_coordinates, \
rectangular_width, rectangular_height)
Q = np.diag([10., 10., 0.1])
R = np.diag([1., 1.]) * 0.01
obstacle_weight = 10000.
horizon = 50
reference_state = np.array([0, 2, 0])
current_state = generate_controller_with_obs(trailer_move_move_up_obs_location_, reference_state, Q, R,\
rectangular_obstacle_3,obstacle_weight,horizon,\
display_figure=True,index_figure=2)
plt.show()
if __name__ == '__main__':
main()
| python |
import functools
from datetime import datetime
try:
from datetime import timezone
utc = timezone.utc
except ImportError:
from datetime import timedelta, tzinfo
class UTC(tzinfo):
def utcoffset(self, dt):
return timedelta(0)
def tzname(self, dt):
return "UTC"
def dst(self, dst):
return timedelta(0)
utc = UTC()
try:
from werkzeug.utils import invalidate_cached_property
except ImportError:
from werkzeug._internal import _missing
def invalidate_cached_property(obj, name):
obj.__dict__[name] = _missing
class FakeCache:
"""
An object that mimics just enough of Flask-Caching's API to be compatible
with our needs, but does nothing.
"""
def get(self, key):
return None
def set(self, key, value):
return None
def delete(self, key):
return None
def first(iterable, default=None, key=None):
"""
Return the first truthy value of an iterable.
Shamelessly stolen from https://github.com/hynek/first
"""
if key is None:
for el in iterable:
if el:
return el
else:
for el in iterable:
if key(el):
return el
return default
sentinel = object()
def getattrd(obj, name, default=sentinel):
"""
Same as getattr(), but allows dot notation lookup
Source: http://stackoverflow.com/a/14324459
"""
try:
return functools.reduce(getattr, name.split("."), obj)
except AttributeError as e:
if default is not sentinel:
return default
raise
def timestamp_from_datetime(dt):
"""
Given a datetime, in UTC, return a float that represents the timestamp for
that datetime.
http://stackoverflow.com/questions/8777753/converting-datetime-date-to-utc-timestamp-in-python#8778548
"""
dt = dt.replace(tzinfo=utc)
if hasattr(dt, "timestamp") and callable(dt.timestamp):
return dt.replace(tzinfo=utc).timestamp()
return (dt - datetime(1970, 1, 1, tzinfo=utc)).total_seconds()
| python |
IPL 2022, LSG vs RCB: KL Rahul, the Lucknow Super Giants skipper, said his bowlers should not have allowed Royal Challengers Bangalore to run away to a good start in the powerplay after taking early wickets. RCB won by 18 runs on Tuesday to move to No. 2 in the points table.
By Rajarshi Gupta: Lucknow Super Giants skipper KL Rahul said his bowlers should have done better after an 18-run defeat to Royal Challengers Bangalore in Navi Mumbai on Tuesday.
Dushmantha Chameera had rocked RCB with the wickets of Anuj Rawat and Virat Kohli off successive deliveries in the first over of the innings but Faf du Plessis hit 96 and led a sensational counterattack to take his team to a winning position.
RCB had also lost Glenn Maxwell who smashed 23 off 11 but still managed to reach 47 for 3 at the end of the powerplay.
"I think we started really well after getting two wickets in the first over, to give away 50 in the Powerplay, we should have done better," KL Rahul told STAR Sports after the match.
"180 on that pitch was 15 or 20 runs extra that we gave away. The pitch was sticky. We got the early breakthroughs we were looking for but we couldn't squeeze in the middle. We needed one big partnership. . . we saw what Faf did for RCB.
KL Rahul was not overtly worried. LSG are still No. 4 in the points table and have a realistic chance of making it to the playoffs in their debut season.
"I think we needed one batter in the top three or four to play a long innings and for other batters to play around with him but we couldn't get that. We didn't get partnerships and we couldn't get a squeeze on with the ball. We have a really good team," he said.
KL Rahul scored 30 off 24 and Krunal Pandya hit a quick 42 but there was precious little from the rest of the LSG batters in a chase of 182. They lost Quinton de Kock and Manish Pandey early and could never get back from the early jolts despite a promising partnership between KL Rahul and Krunal Pandya.
Deepak Hooda did not get going in a sluggish innings and the asking rate was too much for Ayush Badoni who is only in his first season in the IPL. Marcus Stoinis and Jason Holder tried to get LSG home but they were left with way too much to do.
Marcus Stoinis came in to bat at No. 7 while Jason Holder batted at No. 8. The two are among the seasoned and experienced T20 cricketers in the world and perhaps LSG would want to use them earlier in tricky chases. | english |
/*
* Collection utility of MultipleLifeCycle Struct
*
* Generated by: Go Streamer
*/
package cios
import (
"fmt"
"math"
"reflect"
"sort"
)
type MultipleLifeCycleStream []MultipleLifeCycle
func MultipleLifeCycleStreamOf(arg ...MultipleLifeCycle) MultipleLifeCycleStream {
return arg
}
func MultipleLifeCycleStreamFrom(arg []MultipleLifeCycle) MultipleLifeCycleStream {
return arg
}
func CreateMultipleLifeCycleStream(arg ...MultipleLifeCycle) *MultipleLifeCycleStream {
tmp := MultipleLifeCycleStreamOf(arg...)
return &tmp
}
func GenerateMultipleLifeCycleStream(arg []MultipleLifeCycle) *MultipleLifeCycleStream {
tmp := MultipleLifeCycleStreamFrom(arg)
return &tmp
}
func (self *MultipleLifeCycleStream) Add(arg MultipleLifeCycle) *MultipleLifeCycleStream {
return self.AddAll(arg)
}
func (self *MultipleLifeCycleStream) AddAll(arg ...MultipleLifeCycle) *MultipleLifeCycleStream {
*self = append(*self, arg...)
return self
}
func (self *MultipleLifeCycleStream) AddSafe(arg *MultipleLifeCycle) *MultipleLifeCycleStream {
if arg != nil {
self.Add(*arg)
}
return self
}
func (self *MultipleLifeCycleStream) Aggregate(fn func(MultipleLifeCycle, MultipleLifeCycle) MultipleLifeCycle) *MultipleLifeCycleStream {
result := MultipleLifeCycleStreamOf()
self.ForEach(func(v MultipleLifeCycle, i int) {
if i == 0 {
result.Add(fn(MultipleLifeCycle{}, v))
} else {
result.Add(fn(result[i-1], v))
}
})
*self = result
return self
}
func (self *MultipleLifeCycleStream) AllMatch(fn func(MultipleLifeCycle, int) bool) bool {
for i, v := range *self {
if !fn(v, i) {
return false
}
}
return true
}
func (self *MultipleLifeCycleStream) AnyMatch(fn func(MultipleLifeCycle, int) bool) bool {
for i, v := range *self {
if fn(v, i) {
return true
}
}
return false
}
func (self *MultipleLifeCycleStream) Clone() *MultipleLifeCycleStream {
temp := make([]MultipleLifeCycle, self.Len())
copy(temp, *self)
return (*MultipleLifeCycleStream)(&temp)
}
func (self *MultipleLifeCycleStream) Copy() *MultipleLifeCycleStream {
return self.Clone()
}
func (self *MultipleLifeCycleStream) Concat(arg []MultipleLifeCycle) *MultipleLifeCycleStream {
return self.AddAll(arg...)
}
func (self *MultipleLifeCycleStream) Contains(arg MultipleLifeCycle) bool {
return self.FindIndex(func(_arg MultipleLifeCycle, index int) bool { return reflect.DeepEqual(_arg, arg) }) != -1
}
func (self *MultipleLifeCycleStream) Clean() *MultipleLifeCycleStream {
*self = MultipleLifeCycleStreamOf()
return self
}
func (self *MultipleLifeCycleStream) Delete(index int) *MultipleLifeCycleStream {
return self.DeleteRange(index, index)
}
func (self *MultipleLifeCycleStream) DeleteRange(startIndex, endIndex int) *MultipleLifeCycleStream {
*self = append((*self)[:startIndex], (*self)[endIndex+1:]...)
return self
}
func (self *MultipleLifeCycleStream) Distinct() *MultipleLifeCycleStream {
caches := map[string]bool{}
result := MultipleLifeCycleStreamOf()
for _, v := range *self {
key := fmt.Sprintf("%+v", v)
if f, ok := caches[key]; ok {
if !f {
result = append(result, v)
}
} else if caches[key] = true; !f {
result = append(result, v)
}
}
*self = result
return self
}
func (self *MultipleLifeCycleStream) Each(fn func(MultipleLifeCycle)) *MultipleLifeCycleStream {
for _, v := range *self {
fn(v)
}
return self
}
func (self *MultipleLifeCycleStream) EachRight(fn func(MultipleLifeCycle)) *MultipleLifeCycleStream {
for i := self.Len() - 1; i >= 0; i-- {
fn(*self.Get(i))
}
return self
}
func (self *MultipleLifeCycleStream) Equals(arr []MultipleLifeCycle) bool {
if (*self == nil) != (arr == nil) || len(*self) != len(arr) {
return false
}
for i := range *self {
if !reflect.DeepEqual((*self)[i], arr[i]) {
return false
}
}
return true
}
func (self *MultipleLifeCycleStream) Filter(fn func(MultipleLifeCycle, int) bool) *MultipleLifeCycleStream {
result := MultipleLifeCycleStreamOf()
for i, v := range *self {
if fn(v, i) {
result.Add(v)
}
}
*self = result
return self
}
func (self *MultipleLifeCycleStream) FilterSlim(fn func(MultipleLifeCycle, int) bool) *MultipleLifeCycleStream {
result := MultipleLifeCycleStreamOf()
caches := map[string]bool{}
for i, v := range *self {
key := fmt.Sprintf("%+v", v)
if f, ok := caches[key]; ok {
if f {
result.Add(v)
}
} else if caches[key] = fn(v, i); caches[key] {
result.Add(v)
}
}
*self = result
return self
}
func (self *MultipleLifeCycleStream) Find(fn func(MultipleLifeCycle, int) bool) *MultipleLifeCycle {
if i := self.FindIndex(fn); -1 != i {
tmp := (*self)[i]
return &tmp
}
return nil
}
func (self *MultipleLifeCycleStream) FindOr(fn func(MultipleLifeCycle, int) bool, or MultipleLifeCycle) MultipleLifeCycle {
if v := self.Find(fn); v != nil {
return *v
}
return or
}
func (self *MultipleLifeCycleStream) FindIndex(fn func(MultipleLifeCycle, int) bool) int {
if self == nil {
return -1
}
for i, v := range *self {
if fn(v, i) {
return i
}
}
return -1
}
func (self *MultipleLifeCycleStream) First() *MultipleLifeCycle {
return self.Get(0)
}
func (self *MultipleLifeCycleStream) FirstOr(arg MultipleLifeCycle) MultipleLifeCycle {
if v := self.Get(0); v != nil {
return *v
}
return arg
}
func (self *MultipleLifeCycleStream) ForEach(fn func(MultipleLifeCycle, int)) *MultipleLifeCycleStream {
for i, v := range *self {
fn(v, i)
}
return self
}
func (self *MultipleLifeCycleStream) ForEachRight(fn func(MultipleLifeCycle, int)) *MultipleLifeCycleStream {
for i := self.Len() - 1; i >= 0; i-- {
fn(*self.Get(i), i)
}
return self
}
func (self *MultipleLifeCycleStream) GroupBy(fn func(MultipleLifeCycle, int) string) map[string][]MultipleLifeCycle {
m := map[string][]MultipleLifeCycle{}
for i, v := range self.Val() {
key := fn(v, i)
m[key] = append(m[key], v)
}
return m
}
func (self *MultipleLifeCycleStream) GroupByValues(fn func(MultipleLifeCycle, int) string) [][]MultipleLifeCycle {
var tmp [][]MultipleLifeCycle
for _, v := range self.GroupBy(fn) {
tmp = append(tmp, v)
}
return tmp
}
func (self *MultipleLifeCycleStream) IndexOf(arg MultipleLifeCycle) int {
for index, _arg := range *self {
if reflect.DeepEqual(_arg, arg) {
return index
}
}
return -1
}
func (self *MultipleLifeCycleStream) IsEmpty() bool {
return self.Len() == 0
}
func (self *MultipleLifeCycleStream) IsPreset() bool {
return !self.IsEmpty()
}
func (self *MultipleLifeCycleStream) Last() *MultipleLifeCycle {
return self.Get(self.Len() - 1)
}
func (self *MultipleLifeCycleStream) LastOr(arg MultipleLifeCycle) MultipleLifeCycle {
if v := self.Last(); v != nil {
return *v
}
return arg
}
func (self *MultipleLifeCycleStream) Len() int {
if self == nil {
return 0
}
return len(*self)
}
func (self *MultipleLifeCycleStream) Limit(limit int) *MultipleLifeCycleStream {
self.Slice(0, limit)
return self
}
func (self *MultipleLifeCycleStream) Map(fn func(MultipleLifeCycle, int) interface{}) interface{} {
_array := make([]interface{}, 0, len(*self))
for i, v := range *self {
_array = append(_array, fn(v, i))
}
return _array
}
func (self *MultipleLifeCycleStream) Map2Int(fn func(MultipleLifeCycle, int) int) []int {
_array := make([]int, 0, len(*self))
for i, v := range *self {
_array = append(_array, fn(v, i))
}
return _array
}
func (self *MultipleLifeCycleStream) Map2Int32(fn func(MultipleLifeCycle, int) int32) []int32 {
_array := make([]int32, 0, len(*self))
for i, v := range *self {
_array = append(_array, fn(v, i))
}
return _array
}
func (self *MultipleLifeCycleStream) Map2Int64(fn func(MultipleLifeCycle, int) int64) []int64 {
_array := make([]int64, 0, len(*self))
for i, v := range *self {
_array = append(_array, fn(v, i))
}
return _array
}
func (self *MultipleLifeCycleStream) Map2Float32(fn func(MultipleLifeCycle, int) float32) []float32 {
_array := make([]float32, 0, len(*self))
for i, v := range *self {
_array = append(_array, fn(v, i))
}
return _array
}
func (self *MultipleLifeCycleStream) Map2Float64(fn func(MultipleLifeCycle, int) float64) []float64 {
_array := make([]float64, 0, len(*self))
for i, v := range *self {
_array = append(_array, fn(v, i))
}
return _array
}
func (self *MultipleLifeCycleStream) Map2Bool(fn func(MultipleLifeCycle, int) bool) []bool {
_array := make([]bool, 0, len(*self))
for i, v := range *self {
_array = append(_array, fn(v, i))
}
return _array
}
func (self *MultipleLifeCycleStream) Map2Bytes(fn func(MultipleLifeCycle, int) []byte) [][]byte {
_array := make([][]byte, 0, len(*self))
for i, v := range *self {
_array = append(_array, fn(v, i))
}
return _array
}
func (self *MultipleLifeCycleStream) Map2String(fn func(MultipleLifeCycle, int) string) []string {
_array := make([]string, 0, len(*self))
for i, v := range *self {
_array = append(_array, fn(v, i))
}
return _array
}
func (self *MultipleLifeCycleStream) Max(fn func(MultipleLifeCycle, int) float64) *MultipleLifeCycle {
f := self.Get(0)
if f == nil {
return nil
}
m := fn(*f, 0)
index := 0
for i := 1; i < self.Len(); i++ {
v := fn(*self.Get(i), i)
m = math.Max(m, v)
if m == v {
index = i
}
}
return self.Get(index)
}
func (self *MultipleLifeCycleStream) Min(fn func(MultipleLifeCycle, int) float64) *MultipleLifeCycle {
f := self.Get(0)
if f == nil {
return nil
}
m := fn(*f, 0)
index := 0
for i := 1; i < self.Len(); i++ {
v := fn(*self.Get(i), i)
m = math.Min(m, v)
if m == v {
index = i
}
}
return self.Get(index)
}
func (self *MultipleLifeCycleStream) NoneMatch(fn func(MultipleLifeCycle, int) bool) bool {
return !self.AnyMatch(fn)
}
func (self *MultipleLifeCycleStream) Get(index int) *MultipleLifeCycle {
if self.Len() > index && index >= 0 {
tmp := (*self)[index]
return &tmp
}
return nil
}
func (self *MultipleLifeCycleStream) GetOr(index int, arg MultipleLifeCycle) MultipleLifeCycle {
if v := self.Get(index); v != nil {
return *v
}
return arg
}
func (self *MultipleLifeCycleStream) Peek(fn func(*MultipleLifeCycle, int)) *MultipleLifeCycleStream {
for i, v := range *self {
fn(&v, i)
self.Set(i, v)
}
return self
}
func (self *MultipleLifeCycleStream) Reduce(fn func(MultipleLifeCycle, MultipleLifeCycle, int) MultipleLifeCycle) *MultipleLifeCycleStream {
return self.ReduceInit(fn, MultipleLifeCycle{})
}
func (self *MultipleLifeCycleStream) ReduceInit(fn func(MultipleLifeCycle, MultipleLifeCycle, int) MultipleLifeCycle, initialValue MultipleLifeCycle) *MultipleLifeCycleStream {
result := MultipleLifeCycleStreamOf()
self.ForEach(func(v MultipleLifeCycle, i int) {
if i == 0 {
result.Add(fn(initialValue, v, i))
} else {
result.Add(fn(result[i-1], v, i))
}
})
*self = result
return self
}
func (self *MultipleLifeCycleStream) ReduceInterface(fn func(interface{}, MultipleLifeCycle, int) interface{}) []interface{} {
result := []interface{}{}
for i, v := range *self {
if i == 0 {
result = append(result, fn(MultipleLifeCycle{}, v, i))
} else {
result = append(result, fn(result[i-1], v, i))
}
}
return result
}
func (self *MultipleLifeCycleStream) ReduceString(fn func(string, MultipleLifeCycle, int) string) []string {
result := []string{}
for i, v := range *self {
if i == 0 {
result = append(result, fn("", v, i))
} else {
result = append(result, fn(result[i-1], v, i))
}
}
return result
}
func (self *MultipleLifeCycleStream) ReduceInt(fn func(int, MultipleLifeCycle, int) int) []int {
result := []int{}
for i, v := range *self {
if i == 0 {
result = append(result, fn(0, v, i))
} else {
result = append(result, fn(result[i-1], v, i))
}
}
return result
}
func (self *MultipleLifeCycleStream) ReduceInt32(fn func(int32, MultipleLifeCycle, int) int32) []int32 {
result := []int32{}
for i, v := range *self {
if i == 0 {
result = append(result, fn(0, v, i))
} else {
result = append(result, fn(result[i-1], v, i))
}
}
return result
}
func (self *MultipleLifeCycleStream) ReduceInt64(fn func(int64, MultipleLifeCycle, int) int64) []int64 {
result := []int64{}
for i, v := range *self {
if i == 0 {
result = append(result, fn(0, v, i))
} else {
result = append(result, fn(result[i-1], v, i))
}
}
return result
}
func (self *MultipleLifeCycleStream) ReduceFloat32(fn func(float32, MultipleLifeCycle, int) float32) []float32 {
result := []float32{}
for i, v := range *self {
if i == 0 {
result = append(result, fn(0.0, v, i))
} else {
result = append(result, fn(result[i-1], v, i))
}
}
return result
}
func (self *MultipleLifeCycleStream) ReduceFloat64(fn func(float64, MultipleLifeCycle, int) float64) []float64 {
result := []float64{}
for i, v := range *self {
if i == 0 {
result = append(result, fn(0.0, v, i))
} else {
result = append(result, fn(result[i-1], v, i))
}
}
return result
}
func (self *MultipleLifeCycleStream) ReduceBool(fn func(bool, MultipleLifeCycle, int) bool) []bool {
result := []bool{}
for i, v := range *self {
if i == 0 {
result = append(result, fn(false, v, i))
} else {
result = append(result, fn(result[i-1], v, i))
}
}
return result
}
func (self *MultipleLifeCycleStream) Reverse() *MultipleLifeCycleStream {
for i, j := 0, self.Len()-1; i < j; i, j = i+1, j-1 {
(*self)[i], (*self)[j] = (*self)[j], (*self)[i]
}
return self
}
func (self *MultipleLifeCycleStream) Replace(fn func(MultipleLifeCycle, int) MultipleLifeCycle) *MultipleLifeCycleStream {
return self.ForEach(func(v MultipleLifeCycle, i int) { self.Set(i, fn(v, i)) })
}
func (self *MultipleLifeCycleStream) Select(fn func(MultipleLifeCycle) interface{}) interface{} {
_array := make([]interface{}, 0, len(*self))
for _, v := range *self {
_array = append(_array, fn(v))
}
return _array
}
func (self *MultipleLifeCycleStream) Set(index int, val MultipleLifeCycle) *MultipleLifeCycleStream {
if len(*self) > index && index >= 0 {
(*self)[index] = val
}
return self
}
func (self *MultipleLifeCycleStream) Skip(skip int) *MultipleLifeCycleStream {
return self.Slice(skip, self.Len()-skip)
}
func (self *MultipleLifeCycleStream) SkippingEach(fn func(MultipleLifeCycle, int) int) *MultipleLifeCycleStream {
for i := 0; i < self.Len(); i++ {
skip := fn(*self.Get(i), i)
i += skip
}
return self
}
func (self *MultipleLifeCycleStream) Slice(startIndex, n int) *MultipleLifeCycleStream {
if last := startIndex + n; len(*self)-1 < startIndex || last < 0 || startIndex < 0 {
*self = []MultipleLifeCycle{}
} else if len(*self) < last {
*self = (*self)[startIndex:len(*self)]
} else {
*self = (*self)[startIndex:last]
}
return self
}
func (self *MultipleLifeCycleStream) Sort(fn func(i, j int) bool) *MultipleLifeCycleStream {
sort.SliceStable(*self, fn)
return self
}
func (self *MultipleLifeCycleStream) Tail() *MultipleLifeCycle {
return self.Last()
}
func (self *MultipleLifeCycleStream) TailOr(arg MultipleLifeCycle) MultipleLifeCycle {
return self.LastOr(arg)
}
func (self *MultipleLifeCycleStream) ToList() []MultipleLifeCycle {
return self.Val()
}
func (self *MultipleLifeCycleStream) Unique() *MultipleLifeCycleStream {
return self.Distinct()
}
func (self *MultipleLifeCycleStream) Val() []MultipleLifeCycle {
if self == nil {
return []MultipleLifeCycle{}
}
return *self.Copy()
}
func (self *MultipleLifeCycleStream) While(fn func(MultipleLifeCycle, int) bool) *MultipleLifeCycleStream {
for i, v := range self.Val() {
if !fn(v, i) {
break
}
}
return self
}
func (self *MultipleLifeCycleStream) Where(fn func(MultipleLifeCycle) bool) *MultipleLifeCycleStream {
result := MultipleLifeCycleStreamOf()
for _, v := range *self {
if fn(v) {
result.Add(v)
}
}
*self = result
return self
}
func (self *MultipleLifeCycleStream) WhereSlim(fn func(MultipleLifeCycle) bool) *MultipleLifeCycleStream {
result := MultipleLifeCycleStreamOf()
caches := map[string]bool{}
for _, v := range *self {
key := fmt.Sprintf("%+v", v)
if f, ok := caches[key]; ok {
if f {
result.Add(v)
}
} else if caches[key] = fn(v); caches[key] {
result.Add(v)
}
}
*self = result
return self
}
| go |
<reponame>iamdb/musicbrainz_rs<gh_stars>10-100
use super::{Include, Relationship, Subquery};
use crate::entity::alias::Alias;
use crate::entity::area::Area;
use crate::entity::genre::Genre;
use crate::entity::lifespan::LifeSpan;
use crate::entity::relations::Relation;
use crate::entity::tag::Tag;
use crate::entity::BrowseBy;
#[derive(Debug, Serialize, Deserialize, PartialEq, Clone)]
#[serde(rename_all(deserialize = "kebab-case"))]
pub struct Place {
/// See [MusicBrainz Identifier](https://musicbrainz.org/doc/MusicBrainz_Identifier).
pub id: String,
/// The place name is the official name of a place.
pub name: String,
/// The type categorises the place based on its primary function. The possible values are:
/// Studio, Venue, Stadium, Indoor arena, Religious building, Educational institution,
/// Pressing plant, Other.
#[serde(rename = "type")]
pub place_type: Option<PlaceType>,
pub type_id: Option<String>,
pub life_span: Option<LifeSpan>,
/// The latitude and longitude describe the location of the place using geographic coordinates.
pub coordinates: Option<Coordinates>,
pub relations: Option<Vec<Relation>>,
/// The area links to the area, such as the city, in which the place is located.
pub area: Option<Area>,
/// The address describes the location of the place using the standard addressing format for
/// the country it is located in.
pub address: Option<String>,
/// The disambiguation comments are fields in the database used to help distinguish identically
/// named artists, labels and other entities.
pub disambiguation: Option<String>,
/// Aliases are alternate names for a place, which currently have two main functions:
/// localised names and search hints.
pub aliases: Option<Vec<Alias>>,
pub tags: Option<Vec<Tag>>,
pub genres: Option<Vec<Genre>>,
/// Annotations are text fields, functioning like a miniature wiki, that can be added to any
/// existing artists, labels, recordings, releases, release groups and works.
pub annotation: Option<String>,
}
#[derive(Debug, Serialize, Deserialize, PartialEq, Clone)]
pub struct Coordinates {
pub latitude: f64,
pub longitude: f64,
}
/// The type of a MusicBrainz place entity.
/// Note that this enum is `non_exhaustive`; The list of place types is subject to change and these
/// changes are only reflected in the DB, not in actual MB code.
/// Variants are derived from the `place_type` table in the MusicBrainz database.
#[non_exhaustive]
#[derive(Debug, Serialize, Deserialize, PartialEq, Eq, Clone)]
pub enum PlaceType {
/// A place designed for non-live production of music, typically a recording studio.
Studio,
/// A place that has live artistic performances as one of its primary functions, such as a
/// concert hall.
Venue,
/// A place whose main purpose is to host outdoor sport events, typically consisting of a pitch
/// surrounded by a structure for spectators with no roof, or a roof which can be retracted.
Stadium,
/// A place consisting of a large enclosed area with a central event space surrounded by tiered
/// seating for spectators, which can be used for indoor sports, concerts and other
/// entertainment events.
#[serde(rename = "Indoor arena")]
IndoorArena,
/// A school, university or other similar educational institution (especially, but not only, one
/// where music is taught)
#[serde(rename = "Educational institution")]
EducationalInstitution,
/// A place that has worship or religious studies as its main function. Religious buildings
/// often host concerts and serve as recording locations, especially for classical music.
#[serde(rename = "Religious building")]
ReligiousBuilding,
/// A place (generally a factory) at which physical media are manufactured.
#[serde(rename = "Pressing plant")]
PressingPlant,
/// Anything which does not fit into the above categories.
Other,
/// Any place_type that does not yet have a corresponding variant in this enum.
/// If you ever see a `PlaceType::UnrecognizedPlaceType` in the wild, let us know and file an issue/pull request!
#[serde(other)]
UnrecognizedPlaceType,
}
impl_browse! {
Place,
(by_area, BrowseBy::Area),
(by_collection, BrowseBy::Collection)
}
impl_includes!(
Place,
(
with_event_relations,
Include::Relationship(Relationship::Event)
),
(
with_recording_relations,
Include::Relationship(Relationship::Recording)
),
(
with_release_relations,
Include::Relationship(Relationship::Release)
),
(with_tags, Include::Subquery(Subquery::Tags)),
(with_aliases, Include::Subquery(Subquery::Aliases)),
(with_genres, Include::Subquery(Subquery::Genres)),
(with_annotations, Include::Subquery(Subquery::Annotations))
);
| rust |
The interim Budget was the Narendra Modi sarkar’s last chance to show that it could actually do the right thing by India. Instead, it gave us another bravado display of jumlas, its unique intellectual property.
The interim Budget announced Rs 60,000 crore for MGNREGA. However, over the last few years, it has never released the money to states on time, thus driving away the poorest who desperately needed this lifeline.
Where farmers face loan burdens averaging Rs 45,000, the PM Kisan Samman Nidhi Yojana provides a paltry Rs 6,000 per year. Landless labour and tenant farmers experiencing acute rural distress are ignored once again.
TO READ THE FULL STORY, SUBSCRIBE NOW NOW AT JUST RS 249 A MONTH.
What you get on Business Standard Premium?
- Unlock 30+ premium stories daily hand-picked by our editors, across devices on browser and app.
- Pick your 5 favourite companies, get a daily email with all news updates on them.
- Full access to our intuitive epaper - clip, save, share articles from any device; newspaper archives from 2006.
- Preferential invites to Business Standard events.
- Curated newsletters on markets, personal finance, policy & politics, start-ups, technology, and more. | english |
Is Europe about to ban E2E Encryption?
A report in the Austrian press yesterday appeared to suggest a ban incoming on end-to-end encryption which the headline linked to a recent terror attack in the country. In fact there have been discussions ongoing between Member States on the topic of encryption — and whether/how to regulate it — for several years now.
The report is based on a draft resolution of the Council of the European Union (CoEU), dated November 6. Per the draft document a final text, which could incorporate further amendments, is due to be presented to the Council on November 19 for adoption.
The CoEU decision-making body is comprised of representatives of Member States’ governments. It’s responsible for setting the political direction for the bloc however it’s the European Commission which is responsible for drafting legislation. So this is not in any way ‘draft EU legislation’.
One Commission insider we spoke to who’s involved in cyber security strategy couched the resolution as a “political gesture” — and most likely an empty one.
What does the CoEU draft resolution actually say?
It starts by asserting the EU’s full support for “the development, implementation and use of strong encryption” — which would be a very odd position to hold if you also intended to ban E2EE.
Then it discusses “challenges” to public security that flow from criminals having easy access to the same technologies that are used to protect vital civic infrastructure — suggesting criminals can use E2EE to make “lawful” access to their communications “extremely challenging” or “practically impossible”.
This is of course a very familiar discussion in security circles — regularly fuelled by the ‘Five Eyes’ nations’ push for greater surveillance powers — and one which recurs repeatedly in relation to the technology industry owing to developments in communications tech. But note the CoEU does not say access to encrypted data is actually impossible.
Instead the resolution moves on to call for discussion of how to ensure the powers of competent security and criminal justice authorities can be preserved — while ensuring full respect for due legal process and EU rights and freedoms such as (notably the right to respect for private life and communications; and the right to the protection of personal data).
The document suggests a “better” balance should be created between these competing interests. “The principle of security through encryption and security despite encryption must be upheld in its entirety,” is how it’s phrased.
The specific call is for “governments, industry, research and academia... to work together to strategically create this balance”.
Does the draft resolution call for encryption to be backdoored?
So the push here — beyond the overarching political push to be seen to be doing something ‘pro-security’ — is for ways to improve targeted access to data but also that such targeting respect key EU principles that link to fundamental rights (like privacy of communications).
That doesn’t sum to an E2EE ban or backdoor.
But what does the resolution say about the legal framework?
The Council of Ministers want the Commission to carry out a review of relevant existing regulations with relevance to ensure it’s all pulling in the same direction and therefore contributing to law enforcement being able to operate as efficiently as possible.
There is a mention of “potential technical solutions” at this point — but again the emphasis is on any such law enforcement aids supporting the use of their investigatory powers within domestic frameworks that comply with EU law — and a further emphasis on “upholding fundamental rights and preserving the advantages of encryption”. Security of information is a vital advantage of encryption previously discussed in the document so it’s essentially calling for preserving security without literally spelling that out.
This portion of the draft document has several strike-throughs so looks most likely to be subject to wording changes. But for a signal of the direction of travel one bit of rewording emphasises the need for transparency should there be joint working with comms services providers on developing any “solutions”. (And a backdoor that everyone is told about obviously wouldn’t be a backdoor.)
Another suggestion in the draft calls for upskilling relevant authorities to boost their technical and operational expertise — aka more cyber training for police.
In a final section, joint working to improve relevant co-ordination and expertise across the EU is again highlighted by the CoEU as key to bolstering authorities’ investigative capabilities.
There is also talk of developing “innovative approaches in view of new technologies” — but the conclusion makes a point of stating clearly: “there should be no single prescribed technical solution to provide access to encrypted data”. Aka no golden key/universal backdoor.
So there’s nothing to be worried about then?
Well, the Commission may feel some pressure over the issue as it works on its new cyber strategy so it could get some political push on specific policy ideas — although we’re unlikely to see anything much on this front before next year. The CoEU isn’t setting out any policy ideas yet. At most it’s asking for help formulating some.
TechCrunch spoke to Dr Lukasz Olejnik, an independent cybersecurity researcher and consultant based in Europe, to get his thoughts on the draft resolution. He agreed there’s no broadside against E2EE in the draft, nor any near-term prospect of legislation flowing from it. Indeed, he suggested the CoEU appears not to know what to do — hence looking to outside experts in academic and industry for help.
“First, there is no talk of backdoors. The message sets things clearly with respect to encryption being important for cybersecurity and privacy,” he told us. “As for the topic of this document, it is a long-term process in the exploratory phase now. Problems and ideas are identified. Nothing will happen immediately.
“It’s not getting even near to banning E2EE. It appears they do not know what to do exactly. So among the ideas is to perhaps set up a ‘high level expert group’ — the document speaks about engaging ‘academia’. This process is sometimes initiated by the Commission to identify ‘recommendations’ which may or may not be used in the policy process. It would then revolve around who would get to be admitted to such a group, and this varies a lot.
But he did highlight the CoEU’s coining of the phrase ‘security despite encryption’ as a noteworthy development — suggesting it’s unclear where this novel framing might lead in policy terms. So, as ever, the security debate around encryption demands a close eye.
But couldn’t there be a push to introduce some kind of ‘lawful intercept mechanism’ across the EU?
There would be huge challenges to such a step given all the EU legal principles and rights that any mechanism would need to respect.
The CoEU’s draft resolution reiterates this multiple times — highlighting the need for security activity to respect fundamental rights like privacy of communications and principles of legality, transparency, necessity and proportionality, for example.
Domestic surveillance laws in several EU Member States have also recently been found falling short in this regard by Europe’s highest court — so there would be a clear path to challenging any security overreach in the courts.
That means that even if some kind of intercept mechanism could be pushed through an EU legislative process, via enough political will to drive it, there’s no doubt it would face fierce legal challenge and the prospect of being unpicked by the courts.
What does the Commission say?
The Commission declined to comment on the CoEU draft resolution — but a spokesperson sent us some general comments on encryption, describing the technology as “an important tool to enhance cyber security and for the protection of fundamental rights, such as privacy, including the confidentiality of communications, and personal data”.
“Member States have on a number of occasions, in different forums in the Council, discussed the challenges linked to the use of encryption for criminal purposes. They have called for solutions that allow law enforcement and other competent authorities to gain lawful access to digital evidence, without prohibiting or weakening encryption directly or indirectly, and in full respect of privacy and fair trial guarantees consistent with applicable law,” it also said.
The executive body added that following its Security Union Strategy, presented in July — which talks about working to “further strengthen cooperation and information exchange, with all the necessary safeguards” as a strategy for fighting crime in the digital age — it will “explore and support balanced technical, operational and legal solutions, and promote an approach which both maintains the effectiveness of encryption in protecting privacy and security of communications, while providing an effective response to serious crime and terrorism”.
| english |
import { TCanIUseAgentName } from '../data-types';
import { TBrowser } from '../../google-analytics/data-types';
export type TBrowserMapping = {
[gaBrowser in TBrowser]: TCanIUseAgentName;
}
export {
TFeatureFirstSupportedIn,
TFeatureSupportedInLatestBrowserVersion,
TSupportStatus,
IFeatures
} from '../../../common/types/feature-types';
| typescript |
{
"name": "angular-hint",
"version": "0.3.0",
"homepage": "https://github.com/welbornio/angular-hint-bower",
"authors": [
"https://github.com/angular/angular-hint/graphs/contributors"
],
"description": "WIP: run-time hinting for AngularJS applications",
"main": "./dist/hint.js",
"keywords": [
"angular",
"hint",
"lint",
"tool",
"quality"
],
"license": "Apache 2.0",
"ignore": [
"**/.*",
"node_modules",
"bower_components",
"test",
"tests"
]
}
| json |
<gh_stars>10-100
import * as nextRoutes from 'next-routes';
const routes = module.exports = nextRoutes();
routes.add('hero', '/marvel/:id', 'marvel');
| typescript |
AN Indian national working in Liberia has been the only victim to have died of Ebola so far, Ministry of External Affairs told Lok Sabha Wednesday. Mohammed Amir, who was employed in a pharmacy in Liberia, died in that country of Ebola virus infection on September 7, Minister of State for External Affairs Gen (retd) V K Singh said in reply to a question from MP Maheish Giri.
Earlier this month, a 26-year-old Indian national travelling from Liberia was quarantined at Delhi airport after traces of the dreaded virus were found in his semen. He carried a certificate that said he had been treated and cured. However, the Indian authorities have chosen to keep him at the airport health facility till all traces of the virus go away.
Meanwhile, Indian missions in Ebola-affected countries have been directed to remain in regular contact with the Indian community as well as with concerned government and UN agencies to ensure the safety of Indian nationals. | english |
<reponame>pavelkang/asst4
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <sstream>
#include <glog/logging.h>
#include "server/messages.h"
#include "server/worker.h"
#include "tools/cycle_timer.h"
#include "tools/work_queue.h"
#define MAX_NUM_THREADS 24
WorkQueue<Request_msg> work_queue;
WorkQueue<Request_msg> tellme_queue;
using namespace std;
static void *routine(void *arg) {
while (1) {
Request_msg req = work_queue.get_work(); // will block if not available
Response_msg res(req.get_tag());
execute_work(req, res);
worker_send_response(res);
}
// compiler don't yell
arg = arg;
}
static void* tellme_routine(void *arg) {
while (1) {
Request_msg req = tellme_queue.get_work();
Response_msg res(req.get_tag());
execute_work(req, res);
worker_send_response(res);
}
arg = arg;
}
void worker_node_init(const Request_msg& params) {
// This is your chance to initialize your worker. For example, you
// might initialize a few data structures, or maybe even spawn a few
// pthreads here. Remember, when running on Amazon servers, worker
// processes will run on an instance with a dual-core CPU.
DLOG(INFO) << "**** Initializing worker: " << params.get_arg("name") << " ****\n";
for (int i = 0; i < MAX_NUM_THREADS-1; i++) {
pthread_t thread;
pthread_create(&thread, NULL, &routine, NULL);
}
pthread_t thr;
pthread_create(&thr, NULL, &tellme_routine, NULL);
}
void worker_handle_request(const Request_msg& req) {
// Make the tag of the reponse match the tag of the request. This
// is a way for your master to match worker responses to requests.
Response_msg resp(req.get_tag());
// Output debugging help to the logs (in a single worker node
// configuration, this would be in the log logs/worker.INFO)
DLOG(INFO) << "Worker got request: [" << req.get_tag() << ":" << req.get_request_string() << "]\n";
if (req.get_arg("cmd") == "tellmenow") {
tellme_queue.put_work(req);
return;
}
work_queue.put_work(req);
}
| cpp |
One of the key findings of Kaspersky Lab’s “Spam and phishing in Q2 2017” report states that in Q2 2017, spammers tried to capitalize on public fears when the WannaCry ransomware epidemic struck. Spammers took advantage of the fact that many people were infected with the ransomware and were trying to retrieve their encrypted data back. The spammers sent scam and phishing emails, offering users different services to fight against the ransomware. Instead, the scammer would steal their personal data.
The researchers traced a lot of spam messages, which offered services such as protection from WannaCry attacks, data recovery, along with educational workshops and courses for users. In addition, spammers were successful in installing fraudulent software on affected computers in the name of WannaCry patch. However, the software redirected users to phishing pages, where the personal data of victims would be stolen.
An emerging trend of spammers phishing corporate networks has also come to light. The report notes that in the past three months, there was a rise in the number of mass mailings targeted at corporate networks. As per Kaspersky Lab research, phishing is employed by disguising malicious spams as corporates dialogues. The spam emails are highly detailed and include exact replica of original signatures, logos and even banking info. Attached in the mail archives, an exploit package is hidden and is meant to target and steal FTP, email and other passwords.
Some notable trends and statistics in Q2, highlighted by Kaspersky Lab researchers, include that the average amount of spam has increased up to 56.97%. Also, Vietnam became the most popular source of spam, overtaking the U.S. and China.
Other important trends and statistics in Q2, highlighted by Kaspersky Lab researchers, include the following: The average amount of spam has increased up to 56,97%. Vietnam became the most popular source of spam, overtaking the U.S and China. The top 10 countries include Russia, Brazil, France, Iran and the Netherlands.
| english |
India Today Editor-in-Chief Aroon Purie here talks about the tsunami of the second Covid-19 wave having crashed India.
Our nation is at war,” General V. P. Malik tweeted on April 18. As the last Indian army chief to have led troops in war, he should know. Each day, over 2,000 Indians are succumbing to Covid-19, nearly four times the number of soldiers killed in the 11-week Kargil War in 1999. But there’s an important difference, this pandemic is not a distant border conflict fought by generals and professional soldiers. The tsunami of the second wave has crashed into our towns and cities, affecting our friends, neighbours and relatives, overwhelming our health infrastructure, leaving people scrambling around for hospital beds, oxygen cylinders and even slots in crematoriums to dispose of the dead. Over 200,000 persons have been infected every single day since April 15, the world’s largest number of new cases since the start of the pandemic last year. Ten states, Delhi, Maharashtra, Karnataka, Kerala, Tamil Nadu, Andhra Pradesh, Uttar Pradesh, Chhattisgarh, West Bengal and Rajasthan, account for 80 per cent of India’s 15 million cases. The second wave may have the same death rate of 1 per cent as the first one, but it is far more infectious, barrelling through the country at an astonishing rate.
Active cases are doubling every 10 days. The national test positivity rate has been an average 13. 5 per cent this week and shooting up to 20 per cent on April 19 (the WHO recommends it be kept below 5 per cent to avoid drastic surges like the present one). The positivity rate in some states is 30 per cent, which means one out of three persons tested is positive. India is now the world’s second most affected country after the US, which could worsen. The government has woken up to this fact, which is why it has opened up vaccination to those over 18.
Prime Minister Narendra Modi, who addressed the nation on April 20, ruled out the possibility of a nationwide lockdown. The 68-day lockdown India imposed last March when experts were still grappling with the virus and building capacities did the economy serious harm. This time around, asserting that the economy’s health was as important as the nation’s, the prime minister made a case for micro-containment zones and self-discipline to break the chain of Covid transmission. After blundering around for weeks, hurling accusations and counteraccusations, dragging its feet on foreign vaccine approvals and rolling out a stratified vaccine programme, the government denied any shortage of medicines or vaccines. It has relaxed the over-regulation and brought in the private sector. This was a welcome change, no doubt, but new cases on that day had already climbed to 290,000 and the test positivity rate to 17 per cent.
States are already following their own strategies. Delhi, the second most affected state, has imposed a week-long lockdown. Maharashtra and UP are contemplating similar measures. There is still no clarity on how long the second wave will last. But one thing is certain. We are up against an unseen, fast-mutating adversary, which, if left unchecked, could cause a nationwide breakdown. In short, we are facing a total war of the kind witnessed during the Spanish Flu of 1918. Just as wars are not fought by armies alone but by nations that bring to bear all the state resources, this battle too cannot be fought by individuals or states in isolation. It needs a centrally coordinated approach and a pooling of all national resources.
There are steps governments and states need to take on a war footing. First, we need to fortify our testing facilities. In most cities, test results are taking four days from the earlier six hours. If we don’t test enough people swiftly, we won’t know the extent of the spread and contain it through timely isolation of the infected. Next, we need to ramp up facilities in cities that are currently being overwhelmed by massively expanding hospital infrastructure and bringing in beds with ICU equipment and trained staff.
In the first wave, 80 per cent of the cases were asymptomatic, 20 per cent required hospitalisation, of which 5 per cent needed ICU and 1 per cent ventilator care. This holds true even in the second wave, except that the absolute numbers are much more. We need to pay serious heed to genome tracking of this invisible, fast-moving foe. Genome sequencing, the study of the genetic structure of pathogens, is an early warning system. It enables us to study where and how the virus travels. It can help us avoid a repeat of the deathly calm between the two waves when the government turned a deaf ear to warnings from health experts that the virus was mutating. As one health expert told us, it was because we failed to keep track of the clinical symptoms new mutations were exhibiting that we could not prepare for challenges like the increased demand for oxygen. We also urgently need to ramp up vaccine production and administer doses to all citizens at the earliest to prevent rolling waves of infection. This isn’t rocket science, the cost of a sick country is far greater than the cost of a few billion vaccine doses.
The pandemic has spread panic. It is evident in frightened people hoarding life-saving medicines, injections and oxygen cylinders and in the flood of migrants heading back to their homes like they did last year. The government needs to amplify its communication strategy, set up 24x7 emergency control rooms and restore the people’s faith in its ability to deliver. If it can be done to manage election war rooms and run nationwide political campaigns, it can surely be done to fight the panic. It would truly be a shame if Digital India, a country with the world’s second-largest number of smartphone users, and Aadhaar, touted as the world’s most sophisticated ID programme, cannot bring succour to people in their hour of need.
Our cover story, ‘New Threats, Grim Battles’, put together by Associate Editor Sonali Acharjee with reports from bureaus across the country, documents the magnitude of Covid’s second wave and the strategies for combat. This clearly is a battle to be fought and won, and its lessons cast in stone and forcefully implemented. Like in a battle, it needs a flexible strategy that can adapt itself to changing facts. As former US defense secretary Donald Rumsfeld, who was part of America’s war on terror, said, “There are known knowns. . . known unknowns. . . and unknown unknowns, the ones we don’t know we don’t know. . . . ” With the pandemic continuing to rage despite research on the new mutants, effective medicines or vaccine efficacy, we are sadly swimming in an ocean of Unknown Unknowns. The solutions are constant vigilance, staying abreast of Covid discoveries, evolving strategies, being united and delegating to community levels. We are a country that has seen enough calamities. We will get past this one too. | english |
<reponame>algermissen/tokio-bits
//! Operator traits and implementations supporting some other
//! modules in this crate.
pub mod inc;
| rust |
The Pakistan Cricket Board (PCB) has announced Mohammad Hasnain as Shaheen Shah Afridi's replacement for 2022 Asia Cup. The right-arm paceman has taken 17 wickets in 18 T20Is.
Afridi, Pakistan's leading pacer across formats, will miss the upcoming edition of the Asia Cup due to a right ligament injury. The left-arm seamer will also not be part of the subsequent seven-game T20 series against England.
PCB Chief Medical Officer, Dr. Najeebullah Seemro issued a statement regarding Afridi:
"I have spoken with Shaheen and he is understandably upset with the news, but he is brave young man who has vowed to come back strongly to serve his country and team. Although he has made progress during his rehabilitation in Rotterdam, it is now clear he will require more time and is likely to return to competitive cricket in October."
Hasnain, the 22-year old pacer, will join the squad from the United Kingdom where he is representing the Oval Invincibles in the Hundred competition. The youngster has taken five scalps in four games at 21, but has conceded runs at 11.45 per over.
It's worth noting that the youngster's actions came under the spotlight during the Big Bash League (BBL) in January 2022 while representing the Sydney Thunder. Hence, he faced suspension from bowling in international cricket the following month.
His tests took place at the Lahore University of Management Sciences, an ICC-accredited testing laboratory, on January 21st 2022 when his bowling action was found illegal. Eventually, in June this year, he was cleared to bowl again.
It remains to be seen if the speedster finds a place in Pakistan's XI in the tournament. Babar Azam & co. will open their Asia Cup campaign against India on August 28 in Dubai. They recently whitewashed the Netherlands in a three-match ODI series, which concluded on Sunday.
| english |
<reponame>jfallows/zilla
/*
* Copyright 2021-2022 Aklivity Inc.
*
* Aklivity 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 io.aklivity.zilla.runtime.engine.internal.load;
import org.agrona.collections.Long2ObjectHashMap;
import org.agrona.concurrent.AtomicBuffer;
public final class LoadManager
{
private final AtomicBuffer buffer;
private final Long2ObjectHashMap<LoadEntry> entries;
private int nextOffset;
public LoadManager(
AtomicBuffer buffer)
{
this.buffer = buffer;
int sizeofEntry = LoadEntry.sizeofAligned();
Long2ObjectHashMap<LoadEntry> entries = new Long2ObjectHashMap<>();
while (nextOffset < buffer.capacity() - sizeofEntry)
{
LoadEntry entry = new LoadEntry(buffer, nextOffset);
if (entry.namespacedId() == 0L)
{
break;
}
entries.put(entry.namespacedId(), entry);
nextOffset += sizeofEntry;
}
this.entries = entries;
}
public LoadEntry entry(
long namespacedId)
{
LoadEntry entry = entries.get(namespacedId);
if (entry == null)
{
int sizeofEntry = LoadEntry.sizeofAligned();
entry = new LoadEntry(buffer, nextOffset);
entry.init(namespacedId);
entries.put(namespacedId, entry);
nextOffset += sizeofEntry;
assert nextOffset < buffer.capacity();
}
return entry;
}
}
| java |
{
"mcfile" : "root://fndca1.fnal.gov:1094/pnfs/fnal.gov/usr/dune/archive/sam_managed_users/tjyang/data/e/1/4/6/f52abbdc-f3f1-4b1e-9b05-0e25fd4bd232-whole_mc.root",
"mcoutfile" : "effval.root",
"nevents" : -1
// "nevents" : 10000
}
| json |
<reponame>adamkittelson/cactbot
.resizeHandle {
background-image: url(data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABAAAAAQCAYAAAAf8/9hAAAABGdBTUEAALGPC/xhBQAAAAlwSFlzAAAOwgAADsIBFShKgAAAABh0RVh0U29mdHdhcmUAcGFpbnQubmV0IDQuMC4zjOaXUAAAAGZJREFUOE+ljEEOACEIA92f+f9XaQ822EUgajJJC4xtvu+BPnEXFSBff7Bk5N8yw8pgW2aojLwdRHhy+YOTjMzhiUgGDB6ZjMyiVGTAgeV0rB1wqMusL7iIjrVb0mPtypMMGC7k1geoEhcn0OEM6wAAAABJRU5ErkJggg==);
background-position: bottom right;
background-repeat: no-repeat;
box-sizing: border-box;
/* not fully transparent to make it easier to move */
background-color: rgba(0, 0, 150, 0.2);
}
| css |
Viswaroopam 2, much hyped sequel to Viswaroopam the blockbuster of 2013 was touted to be a Diwali release. Later the fans were disappointed to note that this Kamalhassan starrer will not make it to the Diwali race for various reasons. The film is expected to release at the fag end of this year. However the fans will be pleased watch the Ulaganayagan at least in small screen since Viswaroopam's is going to be premiered in Star Vijay Channel on Diwali day.
Now there is more good news for Kamal fans. The trailer of Viswaroopam 2 is ready and the final cut was reportedly shown to some of the big names in the Tamil film fraternity and those who watched the film are all praises for Kamal's performance and also for the making of the flick written and directed by the star himself. Reliable sources say that Viswaroopam 2 will have a racier script and it will be more entertaining than its prequel. The technical aspects is said to be on par with Hollywood flicks.
Follow us on Google News and stay updated with the latest! | english |
While challenges build character, discomfort leads to evolution and this is exactly what a RANDONNEUR experiences in one way or the other during a BRM.
Welcome to this world of RANDONNEURING, a long-distance, non-competitive & self-sufficient, endurance cycling with rides of 200km, 300km, 400km, 600km and 1000 km called Brevets de Randonneurs Mondiaux (BRMs) or popularly known as BREVETS. Participation in randonneuring events is part of a long tradition that goes back to the beginning of the sport of cycling in the early 19th century in France and Italy. Friendly camaraderie and perseverance are the hallmarks of RANDONNEURING.
While Audax Club Parisien (ACP) is the international governing body for randonneuring that administers and oversees the conduct of BRMs worldwide, in India it is done under the banner of AUDAX India Randonneur (AIR).
Team WE R Cycling in association with both ACP & AIR is bringing the world’s oldest cycling event into this coastal city, through BRMs, each month. Team, WE R Cycling president Sarvesha Samaga, speaking to our correspondents said “until the beginning of this season, Mangalore has seen 16 riders fighting through all the odds to earn the coveted title, the SUPER RANDONNEUR!! Well, the season 2020-21 is seeing a major shift to endurance riding with more and more riders taking a shot at the titles of RANDONNEUR & SUPER RANDONNEUR”.
Team mangalorean.com caught up with all the 5 riders who accomplished SUPER RANDONNEUR title in the season 2020-21. We bring down a short memoir of each riders cycling adventure, as part of our online web series, dedicated to these superhumans.
‘SR’ – when I told my son that I would be riding for this title this weekend, he told me, “It is super rider..right?” Well, he may have said it in his naivety, but he said it right because riding distances of 200, 300, 400 and 600 in a single season self-supported is not an easy task. One needs to have the heart of a ‘Super Rider’ to be a ‘Super Randonneaur’. Even if one is fit as a fiddle and has muscles that can move boulders, this feat is possible only when mind, body and soul work in tandem. As our WERC President Sarvesh sir always says, “End of the day, you ride with your mind and soul, as for any distance beyond 100 km, your body would cry to give up and abandon the ride”. He has shown the way and walked the talk several times by doing these rides effortlessly, with a smile on his face, with not even a day of riding practice before the ride.
Time on the saddle is very important for all riders before such events, but more importantly, I think it is the mind and soul that we should train. And this is exactly what WERC is trying to achieve under the able guidance of Sarvesh sir and other senior riders in the organisation.
For me, I always had the heart of a fighter, well, quite literally, as I have lived, practised, and coached martial arts and played the game at a national level in the 90s. But fast forward 15 to 20 years, focussing on career, corporate life had taken a toll on my fitness. A bulging waistline, weight-bearing the 100 kg mark, and a super sedentary lifestyle was all that was left. My body and spirit were calling ‘SOS’. I then started looking for some method of getting back to shape, and that is when Shyam sir introduced me to the world of cycling. It wasn’t easy to pick up the new sport with an ageing body. But again, my soul has helped me achieve that. From the time I started riding in 2017 until last year, I slowly reduced my weight and regained my stamina. I felt like I was back in my 20s.
My favourite event was the race and not long-distance cycling. I started participating in races locally in Mangalore, many a time finishing on the podium. I also partnered with Harivijay and Dheeraj and participated in the Deccan Cliffhanger endurance race, covering a distance of 600+ km in the relay format in 2018. We won the race with a record timing which stands to date. But with no races happening in Mangalore, I decided to try my luck with SR. I had done a few BRMs 200 and 300, so I had some idea of what I was getting into.
Randonneauring needs a completely different approach, and accordingly, I altered my training plan. Actual events started with BRM 300, then 400, 600 and the last 200. We had all challenges that we encounter in our coastal conditions like high humidity, headwinds, heat etc.. but the company of all my co-riders, Dr Gururaj Krishnamurthy, Dr Ramaraj, Sarvesh sir, Joseph sir, Gautham Baliga, Rajesh Nayak, Sreekanth, Dr Shemshaz and many more, their motivation, encouragement and most importantly their smiles in spite of their battered bodies kept us going. I thank each and everyone from the bottom of my heart that they were part of my incredible journey.
Also, it is not just these riders but the wider cycling community and their enthusiasm that keeps pulling us back to riding these insane distances. Mangalore/Udupi, even though they are small cities, have a very vibrant community of cyclists, and it is evident from the fact that it has generated so many champions who have earned fame nationally like Dhanraj Karkera, Shashank Pal, Harivijay Kudwa, Joseph Pereira, Srinidhi Urala, Dheeraj Cosmos, Vinay Raikar, Shyamprasad Nayak, Sarvesh Samaga, Brijesh, Ashok Lobo, Krishna Kumar, Nithin (Taj cycles), Dr Tilak, Dr Bhakta, Rajesh Nayak, Sivanand Rao and many more, I sure missing many names here inadvertently, as we now have as many as 20+ SRs in Mangalore/Udupi. And not just that, but we also have an India renowned coach, Gratian sir, who recognises the potential that riders in this region have and have supported us by providing valuable guidance and coaching.
Last but definitely not least, I would like to thank my wife, Dr Harshitha, my son’s Prannav and Dhruv, my mother-in-law, Jyothi Suvarna and my brother-in-law Dr Dheeraj Kumar, who have wholeheartedly supported me in my endeavour, without which riding an inch, leave alone km, wouldn’t have been possible.
So I wish more and more people should avail this opportunity to get into this world of cycling and grow our cycling family in Udupi and Mangalore. We, the members of WERC, are always there to help all budding cyclists to make Mangalore & Udupi famous in the cycling arena.
| english |
package com.quorum.tessera.encryption;
/**
* An exception to be thrown when the underlying implementation library returns an error (either it
* throws an exception or returns an error code)
*/
public class EncryptorException extends RuntimeException {
public EncryptorException(final String message) {
super(message);
}
}
| java |
On this date 25 years ago, the disaster film “Twister” starring Helen Hunt, Bill Paxton, Jami Gertz and Cary Elwes opened in theaters.
An eccentric storm chaser and her former storm chaser husband — who’s seeking a divorce from her — team up for the dangerous task of placing scientific equipment smack in the face of a tornado.
Michael Crichton and his wife, Anne-Marie Martin, were paid $2.5 million to write the screenplay for “Twister.” Joss Whedon was brought in later to rewrite dialogue.
The entire shoot was “plagued” with sunny skies. In order to make the skies seem darker, the crew flooded the truck cab sequences with high-intensity lights. This caused both Helen Hunt and Bill Paxton to burn their retinas.
For much of the film, though, the clear skies had to be replaced with CGI storm clouds. This added 150 more special effects shots than originally planned, pushing the film way over budget.
The sound of tornadoes in this film was created by slowing down a recording of a camel moaning. Seriously.
The sound in this film was so heavy with bass that it destroyed surround speakers in theaters around the U.S.
The farmhouse scenes were filmed near Fairfax, Okla. Fifteen years later, a real tornado would come along and destroy that very farmhouse.
Originally, producers had planned to use “It sucks” as a clever advertising tag line for the film. Wiser colleagues talked them out of it.
The movie was originally to open on May 17 — as you may have noticed on the poster at the top of this thread. Warner Bros. moved that up to May 10 to reduce conflict with Tom Cruise’s first “Mission: Impossible” movie, scheduled to open two weeks alter.
| english |
<reponame>dmilcevski/ambiverse-nlu
package de.mpg.mpi_inf.ambiversenlu.nlu.entitylinking.access;
import gnu.trove.impl.Constants;
import gnu.trove.iterator.TIntDoubleIterator;
import gnu.trove.map.hash.TIntDoubleHashMap;
import org.junit.Test;
import java.io.IOException;
import static org.junit.Assert.assertEquals;
/**
* This tests all the demo examples for correct outcome.
* Useful as a safety net :)
*
*/
public class EncoderDecoderKryoTest {
@Test public void test() throws IOException {
EncoderDecoderKryo<Integer> encoderInteger = new EncoderDecoderKryo(Integer.class);
int a = 845739038;
byte[] bytes = encoderInteger.encode(a);
int resultInt = encoderInteger.decode(bytes);
assertEquals(a, resultInt);
EncoderDecoderKryo<Double> encoderDouble = new EncoderDecoderKryo(Double.class);
double b = 845739038;
bytes = encoderDouble.encode(b);
double resultDouble = encoderDouble.decode(bytes);
assertEquals(b, resultDouble, 0.00001);
EncoderDecoderKryo<String> encoderString = new EncoderDecoderKryo(String.class);
String str = "hola";
bytes = encoderString.encode(str);
String resultString = encoderString.decode(bytes);
assertEquals(str, resultString);
EncoderDecoderKryo<String[]> encoderStringArray = new EncoderDecoderKryo(String[].class);
String[] strArray = new String[] { "hola", "y", "chau" };
bytes = encoderStringArray.encode(strArray);
String[] resultStringArray = encoderStringArray.decode(bytes);
for (int i = 0; i < strArray.length; i++) {
assertEquals(strArray[i], resultStringArray[i]);
}
EncoderDecoderKryo<KeyValueStoreRow[]> keyvalueStoreRowArray = new EncoderDecoderKryo(KeyValueStoreRow[].class);
Object[] elements = new Object[] { a, b, str };
KeyValueStoreRow kvs1 = new KeyValueStoreRow(elements);
Object[] elements2 = new Object[] { str, b, a };
KeyValueStoreRow kvs2 = new KeyValueStoreRow(elements2);
KeyValueStoreRow[] kvsr = new KeyValueStoreRow[] { kvs1, kvs2 };
bytes = keyvalueStoreRowArray.encode(kvsr);
KeyValueStoreRow[] kvsrResultl = keyvalueStoreRowArray.decode(bytes);
assertEquals(kvsr[0].getInt(0), kvsrResultl[0].getInt(0));
assertEquals(kvsr[0].getDouble(1), kvsrResultl[0].getDouble(1), 0.00001);
assertEquals(kvsr[0].getString(2), kvsr[0].getString(2));
assertEquals(kvsr[1].getInt(2), kvsrResultl[1].getInt(2));
assertEquals(kvsr[1].getDouble(1), kvsrResultl[1].getDouble(1), 0.00001);
assertEquals(kvsr[1].getString(0), kvsr[1].getString(0));
EncoderDecoderKryo<TIntDoubleHashMap> tintDoubleHashMap = new EncoderDecoderKryo(TIntDoubleHashMap.class);
TIntDoubleHashMap object = new TIntDoubleHashMap(2, Constants.DEFAULT_LOAD_FACTOR);
object.put(7, 8.19);
object.put(15, 7.9);
bytes = tintDoubleHashMap.encode(object);
TIntDoubleHashMap result = tintDoubleHashMap.decode(bytes);
TIntDoubleIterator it = result.iterator();
int index = 0;
while (it.hasNext()) {
it.advance();
if (index == 0) {
assertEquals(7, it.key());
assertEquals(it.value(), 8.19, 0.00001);
} else {
assertEquals(15, it.key());
assertEquals(it.value(), 7.9, 0.00001);
}
index++;
}
}
} | java |
#if !defined(_BTK_LOCALS_HPP_)
#define _BTK_LOCALS_HPP_
#include <SDL2/SDL_keycode.h>
#include <SDL2/SDL_scancode.h>
#include <SDL2/SDL_mouse.h>
#include <iosfwd>
#include "defs.hpp"
//A headers to simply use SDL enums
namespace Btk{
/**
* @brief SDL_Keycode
*
*/
enum class Keycode:SDL_Keycode{
Unknown = SDLK_UNKNOWN,
Return = SDLK_RETURN,
Escape = SDLK_ESCAPE,
Backspace = SDLK_BACKSPACE,
Tab = SDLK_TAB,
Space = SDLK_SPACE,
Exclaim = SDLK_EXCLAIM,
Quotedbl = SDLK_QUOTEDBL,
Hash = SDLK_HASH,
Percent = SDLK_PERCENT,
Dollar = SDLK_DOLLAR,
Ampersand = SDLK_AMPERSAND,
Quote = SDLK_QUOTE,
Leftparen = SDLK_LEFTPAREN,
Rightparen = SDLK_RIGHTPAREN,
Asterisk = SDLK_ASTERISK,
Plus = SDLK_PLUS,
Comma = SDLK_COMMA,
Minus = SDLK_MINUS,
Period = SDLK_PERIOD,
Slash = SDLK_SLASH,
_0 = SDLK_0,
_1 = SDLK_1,
_2 = SDLK_2,
_3 = SDLK_3,
_4 = SDLK_4,
_5 = SDLK_5,
_6 = SDLK_6,
_7 = SDLK_7,
_8 = SDLK_8,
_9 = SDLK_9,
Colon = SDLK_COLON,
Semicolon = SDLK_SEMICOLON,
Less = SDLK_LESS,
Equals = SDLK_EQUALS,
Greater = SDLK_GREATER,
Question = SDLK_QUESTION,
At = SDLK_AT,
Leftbracket = SDLK_LEFTBRACKET,
Backslash = SDLK_BACKSLASH,
Rightbracket = SDLK_RIGHTBRACKET,
Caret = SDLK_CARET,
Underscore = SDLK_UNDERSCORE,
Backquote = SDLK_BACKQUOTE,
A = SDLK_a,
B = SDLK_b,
C = SDLK_c,
D = SDLK_d,
E = SDLK_e,
F = SDLK_f,
G = SDLK_g,
H = SDLK_h,
I = SDLK_i,
J = SDLK_j,
K = SDLK_k,
L = SDLK_l,
M = SDLK_m,
N = SDLK_n,
O = SDLK_o,
P = SDLK_p,
Q = SDLK_q,
R = SDLK_r,
S = SDLK_s,
T = SDLK_t,
U = SDLK_u,
V = SDLK_v,
W = SDLK_w,
X = SDLK_x,
Y = SDLK_y,
Z = SDLK_z,
//Alias
a = SDLK_a,
b = SDLK_b,
c = SDLK_c,
d = SDLK_d,
e = SDLK_e,
f = SDLK_f,
g = SDLK_g,
h = SDLK_h,
i = SDLK_i,
j = SDLK_j,
k = SDLK_k,
l = SDLK_l,
m = SDLK_m,
n = SDLK_n,
o = SDLK_o,
p = SDLK_p,
q = SDLK_q,
r = SDLK_r,
s = SDLK_s,
t = SDLK_t,
u = SDLK_u,
v = SDLK_v,
w = SDLK_w,
x = SDLK_x,
y = SDLK_y,
z = SDLK_z,
Capslock = SDLK_CAPSLOCK,
F1 = SDLK_F1,
F2 = SDLK_F2,
F3 = SDLK_F3,
F4 = SDLK_F4,
F5 = SDLK_F5,
F6 = SDLK_F6,
F7 = SDLK_F7,
F8 = SDLK_F8,
F9 = SDLK_F9,
F10 = SDLK_F10,
F11 = SDLK_F11,
F12 = SDLK_F12,
Printscreen = SDLK_PRINTSCREEN,
Scrolllock = SDLK_SCROLLLOCK,
Pause = SDLK_PAUSE,
Insert = SDLK_INSERT,
Home = SDLK_HOME,
Pageup = SDLK_PAGEUP,
Delete = SDLK_DELETE,
End = SDLK_END,
Pagedown = SDLK_PAGEDOWN,
Right = SDLK_RIGHT,
Left = SDLK_LEFT,
Down = SDLK_DOWN,
Up = SDLK_UP,
Numlockclear = SDLK_NUMLOCKCLEAR,
Kp_Divide = SDLK_KP_DIVIDE,
Kp_Multiply = SDLK_KP_MULTIPLY,
Kp_Minus = SDLK_KP_MINUS,
Kp_Plus = SDLK_KP_PLUS,
Kp_Enter = SDLK_KP_ENTER,
Kp_1 = SDLK_KP_1,
Kp_2 = SDLK_KP_2,
Kp_3 = SDLK_KP_3,
Kp_4 = SDLK_KP_4,
Kp_5 = SDLK_KP_5,
Kp_6 = SDLK_KP_6,
Kp_7 = SDLK_KP_7,
Kp_8 = SDLK_KP_8,
Kp_9 = SDLK_KP_9,
Kp_0 = SDLK_KP_0,
Kp_Period = SDLK_KP_PERIOD,
Application = SDLK_APPLICATION,
Power = SDLK_POWER,
Kp_Equals = SDLK_KP_EQUALS,
F13 = SDLK_F13,
F14 = SDLK_F14,
F15 = SDLK_F15,
F16 = SDLK_F16,
F17 = SDLK_F17,
F18 = SDLK_F18,
F19 = SDLK_F19,
F20 = SDLK_F20,
F21 = SDLK_F21,
F22 = SDLK_F22,
F23 = SDLK_F23,
F24 = SDLK_F24,
Execute = SDLK_EXECUTE,
Help = SDLK_HELP,
Menu = SDLK_MENU,
Select = SDLK_SELECT,
Stop = SDLK_STOP,
Again = SDLK_AGAIN,
Undo = SDLK_UNDO,
Cut = SDLK_CUT,
Copy = SDLK_COPY,
Paste = SDLK_PASTE,
Find = SDLK_FIND,
Mute = SDLK_MUTE,
Volumeup = SDLK_VOLUMEUP,
Volumedown = SDLK_VOLUMEDOWN,
Kp_Comma = SDLK_KP_COMMA,
Kp_Equalsas400 = SDLK_KP_EQUALSAS400,
Alterase = SDLK_ALTERASE,
Sysreq = SDLK_SYSREQ,
Cancel = SDLK_CANCEL,
Clear = SDLK_CLEAR,
Prior = SDLK_PRIOR,
Return2 = SDLK_RETURN2,
Separator = SDLK_SEPARATOR,
Out = SDLK_OUT,
Oper = SDLK_OPER,
Clearagain = SDLK_CLEARAGAIN,
Crsel = SDLK_CRSEL,
Exsel = SDLK_EXSEL,
Kp_00 = SDLK_KP_00,
Kp_000 = SDLK_KP_000,
Thousandsseparator = SDLK_THOUSANDSSEPARATOR,
Decimalseparator = SDLK_DECIMALSEPARATOR,
Currencyunit = SDLK_CURRENCYUNIT,
Currencysubunit = SDLK_CURRENCYSUBUNIT,
Kp_Leftparen = SDLK_KP_LEFTPAREN,
Kp_Rightparen = SDLK_KP_RIGHTPAREN,
Kp_Leftbrace = SDLK_KP_LEFTBRACE,
Kp_Rightbrace = SDLK_KP_RIGHTBRACE,
Kp_Tab = SDLK_KP_TAB,
Kp_Backspace = SDLK_KP_BACKSPACE,
Kp_A = SDLK_KP_A,
Kp_B = SDLK_KP_B,
Kp_C = SDLK_KP_C,
Kp_D = SDLK_KP_D,
Kp_E = SDLK_KP_E,
Kp_F = SDLK_KP_F,
Kp_Xor = SDLK_KP_XOR,
Kp_Power = SDLK_KP_POWER,
Kp_Percent = SDLK_KP_PERCENT,
Kp_Less = SDLK_KP_LESS,
Kp_Greater = SDLK_KP_GREATER,
Kp_Ampersand = SDLK_KP_AMPERSAND,
Kp_Dblampersand = SDLK_KP_DBLAMPERSAND,
Kp_Verticalbar = SDLK_KP_VERTICALBAR,
Kp_Dblverticalbar = SDLK_KP_DBLVERTICALBAR,
Kp_Colon = SDLK_KP_COLON,
Kp_Hash = SDLK_KP_HASH,
Kp_Space = SDLK_KP_SPACE,
Kp_At = SDLK_KP_AT,
Kp_Exclam = SDLK_KP_EXCLAM,
Kp_Memstore = SDLK_KP_MEMSTORE,
Kp_Memrecall = SDLK_KP_MEMRECALL,
Kp_Memclear = SDLK_KP_MEMCLEAR,
Kp_Memadd = SDLK_KP_MEMADD,
Kp_Memsubtract = SDLK_KP_MEMSUBTRACT,
Kp_Memmultiply = SDLK_KP_MEMMULTIPLY,
Kp_Memdivide = SDLK_KP_MEMDIVIDE,
Kp_Plusminus = SDLK_KP_PLUSMINUS,
Kp_Clear = SDLK_KP_CLEAR,
Kp_Clearentry = SDLK_KP_CLEARENTRY,
Kp_Binary = SDLK_KP_BINARY,
Kp_Octal = SDLK_KP_OCTAL,
Kp_Decimal = SDLK_KP_DECIMAL,
Kp_Hexadecimal = SDLK_KP_HEXADECIMAL,
Lctrl = SDLK_LCTRL,
Lshift = SDLK_LSHIFT,
Lalt = SDLK_LALT,
Lgui = SDLK_LGUI,
Rctrl = SDLK_RCTRL,
Rshift = SDLK_RSHIFT,
Ralt = SDLK_RALT,
Rgui = SDLK_RGUI,
Mode = SDLK_MODE,
Audionext = SDLK_AUDIONEXT,
Audioprev = SDLK_AUDIOPREV,
Audiostop = SDLK_AUDIOSTOP,
Audioplay = SDLK_AUDIOPLAY,
Audiomute = SDLK_AUDIOMUTE,
Mediaselect = SDLK_MEDIASELECT,
Www = SDLK_WWW,
Mail = SDLK_MAIL,
Calculator = SDLK_CALCULATOR,
Computer = SDLK_COMPUTER,
Ac_Search = SDLK_AC_SEARCH,
Ac_Home = SDLK_AC_HOME,
Ac_Back = SDLK_AC_BACK,
Ac_Forward = SDLK_AC_FORWARD,
Ac_Stop = SDLK_AC_STOP,
Ac_Refresh = SDLK_AC_REFRESH,
Ac_Bookmarks = SDLK_AC_BOOKMARKS,
Brightnessdown = SDLK_BRIGHTNESSDOWN,
Brightnessup = SDLK_BRIGHTNESSUP,
Displayswitch = SDLK_DISPLAYSWITCH,
Kbdillumtoggle = SDLK_KBDILLUMTOGGLE,
Kbdillumdown = SDLK_KBDILLUMDOWN,
Kbdillumup = SDLK_KBDILLUMUP,
Eject = SDLK_EJECT,
Sleep = SDLK_SLEEP,
App1 = SDLK_APP1,
App2 = SDLK_APP2,
Audiorewind = SDLK_AUDIOREWIND,
Audiofastforward = SDLK_AUDIOFASTFORWARD
};
/**
* @brief SDL_Scancode
*
*/
enum class Scancode{
Unknown = SDL_SCANCODE_UNKNOWN,
A = SDL_SCANCODE_A,
B = SDL_SCANCODE_B,
C = SDL_SCANCODE_C,
D = SDL_SCANCODE_D,
E = SDL_SCANCODE_E,
F = SDL_SCANCODE_F,
G = SDL_SCANCODE_G,
H = SDL_SCANCODE_H,
I = SDL_SCANCODE_I,
J = SDL_SCANCODE_J,
K = SDL_SCANCODE_K,
L = SDL_SCANCODE_L,
M = SDL_SCANCODE_M,
N = SDL_SCANCODE_N,
O = SDL_SCANCODE_O,
P = SDL_SCANCODE_P,
Q = SDL_SCANCODE_Q,
R = SDL_SCANCODE_R,
S = SDL_SCANCODE_S,
T = SDL_SCANCODE_T,
U = SDL_SCANCODE_U,
V = SDL_SCANCODE_V,
W = SDL_SCANCODE_W,
X = SDL_SCANCODE_X,
Y = SDL_SCANCODE_Y,
Z = SDL_SCANCODE_Z,
_1 = SDL_SCANCODE_1,
_2 = SDL_SCANCODE_2,
_3 = SDL_SCANCODE_3,
_4 = SDL_SCANCODE_4,
_5 = SDL_SCANCODE_5,
_6 = SDL_SCANCODE_6,
_7 = SDL_SCANCODE_7,
_8 = SDL_SCANCODE_8,
_9 = SDL_SCANCODE_9,
_0 = SDL_SCANCODE_0,
Return = SDL_SCANCODE_RETURN,
Escape = SDL_SCANCODE_ESCAPE,
Backspace = SDL_SCANCODE_BACKSPACE,
Tab = SDL_SCANCODE_TAB,
Space = SDL_SCANCODE_SPACE,
Minus = SDL_SCANCODE_MINUS,
Equals = SDL_SCANCODE_EQUALS,
Leftbracket = SDL_SCANCODE_LEFTBRACKET,
Rightbracket = SDL_SCANCODE_RIGHTBRACKET,
Backslash = SDL_SCANCODE_BACKSLASH,
Nonushash = SDL_SCANCODE_NONUSHASH,
Semicolon = SDL_SCANCODE_SEMICOLON,
Apostrophe = SDL_SCANCODE_APOSTROPHE,
Grave = SDL_SCANCODE_GRAVE,
Comma = SDL_SCANCODE_COMMA,
Period = SDL_SCANCODE_PERIOD,
Slash = SDL_SCANCODE_SLASH,
Capslock = SDL_SCANCODE_CAPSLOCK,
F1 = SDL_SCANCODE_F1,
F2 = SDL_SCANCODE_F2,
F3 = SDL_SCANCODE_F3,
F4 = SDL_SCANCODE_F4,
F5 = SDL_SCANCODE_F5,
F6 = SDL_SCANCODE_F6,
F7 = SDL_SCANCODE_F7,
F8 = SDL_SCANCODE_F8,
F9 = SDL_SCANCODE_F9,
F10 = SDL_SCANCODE_F10,
F11 = SDL_SCANCODE_F11,
F12 = SDL_SCANCODE_F12,
Printscreen = SDL_SCANCODE_PRINTSCREEN,
Scrolllock = SDL_SCANCODE_SCROLLLOCK,
Pause = SDL_SCANCODE_PAUSE,
Insert = SDL_SCANCODE_INSERT,
Home = SDL_SCANCODE_HOME,
Pageup = SDL_SCANCODE_PAGEUP,
Delete = SDL_SCANCODE_DELETE,
End = SDL_SCANCODE_END,
Pagedown = SDL_SCANCODE_PAGEDOWN,
Right = SDL_SCANCODE_RIGHT,
Left = SDL_SCANCODE_LEFT,
Down = SDL_SCANCODE_DOWN,
Up = SDL_SCANCODE_UP,
Numlockclear = SDL_SCANCODE_NUMLOCKCLEAR,
Kp_Divide = SDL_SCANCODE_KP_DIVIDE,
Kp_Multiply = SDL_SCANCODE_KP_MULTIPLY,
Kp_Minus = SDL_SCANCODE_KP_MINUS,
Kp_Plus = SDL_SCANCODE_KP_PLUS,
Kp_Enter = SDL_SCANCODE_KP_ENTER,
Kp_1 = SDL_SCANCODE_KP_1,
Kp_2 = SDL_SCANCODE_KP_2,
Kp_3 = SDL_SCANCODE_KP_3,
Kp_4 = SDL_SCANCODE_KP_4,
Kp_5 = SDL_SCANCODE_KP_5,
Kp_6 = SDL_SCANCODE_KP_6,
Kp_7 = SDL_SCANCODE_KP_7,
Kp_8 = SDL_SCANCODE_KP_8,
Kp_9 = SDL_SCANCODE_KP_9,
Kp_0 = SDL_SCANCODE_KP_0,
Kp_Period = SDL_SCANCODE_KP_PERIOD,
Nonusbackslash = SDL_SCANCODE_NONUSBACKSLASH,
Application = SDL_SCANCODE_APPLICATION,
Power = SDL_SCANCODE_POWER,
Kp_Equals = SDL_SCANCODE_KP_EQUALS,
F13 = SDL_SCANCODE_F13,
F14 = SDL_SCANCODE_F14,
F15 = SDL_SCANCODE_F15,
F16 = SDL_SCANCODE_F16,
F17 = SDL_SCANCODE_F17,
F18 = SDL_SCANCODE_F18,
F19 = SDL_SCANCODE_F19,
F20 = SDL_SCANCODE_F20,
F21 = SDL_SCANCODE_F21,
F22 = SDL_SCANCODE_F22,
F23 = SDL_SCANCODE_F23,
F24 = SDL_SCANCODE_F24,
Execute = SDL_SCANCODE_EXECUTE,
Help = SDL_SCANCODE_HELP,
Menu = SDL_SCANCODE_MENU,
Select = SDL_SCANCODE_SELECT,
Stop = SDL_SCANCODE_STOP,
Again = SDL_SCANCODE_AGAIN,
Undo = SDL_SCANCODE_UNDO,
Cut = SDL_SCANCODE_CUT,
Copy = SDL_SCANCODE_COPY,
Paste = SDL_SCANCODE_PASTE,
Find = SDL_SCANCODE_FIND,
Mute = SDL_SCANCODE_MUTE,
Volumeup = SDL_SCANCODE_VOLUMEUP,
Volumedown = SDL_SCANCODE_VOLUMEDOWN,
Kp_Comma = SDL_SCANCODE_KP_COMMA,
Kp_Equalsas400 = SDL_SCANCODE_KP_EQUALSAS400,
International1 = SDL_SCANCODE_INTERNATIONAL1,
International2 = SDL_SCANCODE_INTERNATIONAL2,
International3 = SDL_SCANCODE_INTERNATIONAL3,
International4 = SDL_SCANCODE_INTERNATIONAL4,
International5 = SDL_SCANCODE_INTERNATIONAL5,
International6 = SDL_SCANCODE_INTERNATIONAL6,
International7 = SDL_SCANCODE_INTERNATIONAL7,
International8 = SDL_SCANCODE_INTERNATIONAL8,
International9 = SDL_SCANCODE_INTERNATIONAL9,
Lang1 = SDL_SCANCODE_LANG1,
Lang2 = SDL_SCANCODE_LANG2,
Lang3 = SDL_SCANCODE_LANG3,
Lang4 = SDL_SCANCODE_LANG4,
Lang5 = SDL_SCANCODE_LANG5,
Lang6 = SDL_SCANCODE_LANG6,
Lang7 = SDL_SCANCODE_LANG7,
Lang8 = SDL_SCANCODE_LANG8,
Lang9 = SDL_SCANCODE_LANG9,
Alterase = SDL_SCANCODE_ALTERASE,
Sysreq = SDL_SCANCODE_SYSREQ,
Cancel = SDL_SCANCODE_CANCEL,
Clear = SDL_SCANCODE_CLEAR,
Prior = SDL_SCANCODE_PRIOR,
Return2 = SDL_SCANCODE_RETURN2,
Separator = SDL_SCANCODE_SEPARATOR,
Out = SDL_SCANCODE_OUT,
Oper = SDL_SCANCODE_OPER,
Clearagain = SDL_SCANCODE_CLEARAGAIN,
Crsel = SDL_SCANCODE_CRSEL,
Exsel = SDL_SCANCODE_EXSEL,
Kp_00 = SDL_SCANCODE_KP_00,
Kp_000 = SDL_SCANCODE_KP_000,
Thousandsseparator = SDL_SCANCODE_THOUSANDSSEPARATOR,
Decimalseparator = SDL_SCANCODE_DECIMALSEPARATOR,
Currencyunit = SDL_SCANCODE_CURRENCYUNIT,
Currencysubunit = SDL_SCANCODE_CURRENCYSUBUNIT,
Kp_Leftparen = SDL_SCANCODE_KP_LEFTPAREN,
Kp_Rightparen = SDL_SCANCODE_KP_RIGHTPAREN,
Kp_Leftbrace = SDL_SCANCODE_KP_LEFTBRACE,
Kp_Rightbrace = SDL_SCANCODE_KP_RIGHTBRACE,
Kp_Tab = SDL_SCANCODE_KP_TAB,
Kp_Backspace = SDL_SCANCODE_KP_BACKSPACE,
Kp_A = SDL_SCANCODE_KP_A,
Kp_B = SDL_SCANCODE_KP_B,
Kp_C = SDL_SCANCODE_KP_C,
Kp_D = SDL_SCANCODE_KP_D,
Kp_E = SDL_SCANCODE_KP_E,
Kp_F = SDL_SCANCODE_KP_F,
Kp_Xor = SDL_SCANCODE_KP_XOR,
Kp_Power = SDL_SCANCODE_KP_POWER,
Kp_Percent = SDL_SCANCODE_KP_PERCENT,
Kp_Less = SDL_SCANCODE_KP_LESS,
Kp_Greater = SDL_SCANCODE_KP_GREATER,
Kp_Ampersand = SDL_SCANCODE_KP_AMPERSAND,
Kp_Dblampersand = SDL_SCANCODE_KP_DBLAMPERSAND,
Kp_Verticalbar = SDL_SCANCODE_KP_VERTICALBAR,
Kp_Dblverticalbar = SDL_SCANCODE_KP_DBLVERTICALBAR,
Kp_Colon = SDL_SCANCODE_KP_COLON,
Kp_Hash = SDL_SCANCODE_KP_HASH,
Kp_Space = SDL_SCANCODE_KP_SPACE,
Kp_At = SDL_SCANCODE_KP_AT,
Kp_Exclam = SDL_SCANCODE_KP_EXCLAM,
Kp_Memstore = SDL_SCANCODE_KP_MEMSTORE,
Kp_Memrecall = SDL_SCANCODE_KP_MEMRECALL,
Kp_Memclear = SDL_SCANCODE_KP_MEMCLEAR,
Kp_Memadd = SDL_SCANCODE_KP_MEMADD,
Kp_Memsubtract = SDL_SCANCODE_KP_MEMSUBTRACT,
Kp_Memmultiply = SDL_SCANCODE_KP_MEMMULTIPLY,
Kp_Memdivide = SDL_SCANCODE_KP_MEMDIVIDE,
Kp_Plusminus = SDL_SCANCODE_KP_PLUSMINUS,
Kp_Clear = SDL_SCANCODE_KP_CLEAR,
Kp_Clearentry = SDL_SCANCODE_KP_CLEARENTRY,
Kp_Binary = SDL_SCANCODE_KP_BINARY,
Kp_Octal = SDL_SCANCODE_KP_OCTAL,
Kp_Decimal = SDL_SCANCODE_KP_DECIMAL,
Kp_Hexadecimal = SDL_SCANCODE_KP_HEXADECIMAL,
Lctrl = SDL_SCANCODE_LCTRL,
Lshift = SDL_SCANCODE_LSHIFT,
Lalt = SDL_SCANCODE_LALT,
Lgui = SDL_SCANCODE_LGUI,
Rctrl = SDL_SCANCODE_RCTRL,
Rshift = SDL_SCANCODE_RSHIFT,
Ralt = SDL_SCANCODE_RALT,
Rgui = SDL_SCANCODE_RGUI,
Mode = SDL_SCANCODE_MODE,
Audionext = SDL_SCANCODE_AUDIONEXT,
Audioprev = SDL_SCANCODE_AUDIOPREV,
Audiostop = SDL_SCANCODE_AUDIOSTOP,
Audioplay = SDL_SCANCODE_AUDIOPLAY,
Audiomute = SDL_SCANCODE_AUDIOMUTE,
Mediaselect = SDL_SCANCODE_MEDIASELECT,
Www = SDL_SCANCODE_WWW,
Mail = SDL_SCANCODE_MAIL,
Calculator = SDL_SCANCODE_CALCULATOR,
Computer = SDL_SCANCODE_COMPUTER,
Ac_Search = SDL_SCANCODE_AC_SEARCH,
Ac_Home = SDL_SCANCODE_AC_HOME,
Ac_Back = SDL_SCANCODE_AC_BACK,
Ac_Forward = SDL_SCANCODE_AC_FORWARD,
Ac_Stop = SDL_SCANCODE_AC_STOP,
Ac_Refresh = SDL_SCANCODE_AC_REFRESH,
Ac_Bookmarks = SDL_SCANCODE_AC_BOOKMARKS,
Brightnessdown = SDL_SCANCODE_BRIGHTNESSDOWN,
Brightnessup = SDL_SCANCODE_BRIGHTNESSUP,
Displayswitch = SDL_SCANCODE_DISPLAYSWITCH,
Kbdillumtoggle = SDL_SCANCODE_KBDILLUMTOGGLE,
Kbdillumdown = SDL_SCANCODE_KBDILLUMDOWN,
Kbdillumup = SDL_SCANCODE_KBDILLUMUP,
Eject = SDL_SCANCODE_EJECT,
Sleep = SDL_SCANCODE_SLEEP,
App1 = SDL_SCANCODE_APP1,
App2 = SDL_SCANCODE_APP2,
Audiorewind = SDL_SCANCODE_AUDIOREWIND,
Audiofastforward = SDL_SCANCODE_AUDIOFASTFORWARD
};
//Keymode enum
enum class Keymode:Uint16{
None = KMOD_NONE,
Lshift = KMOD_LSHIFT,
Rshift = KMOD_RSHIFT,
Lctrl = KMOD_LCTRL,
Rctrl = KMOD_RCTRL,
Lalt = KMOD_LALT,
Ralt = KMOD_RALT,
Lgui = KMOD_LGUI,
Rgui = KMOD_RGUI,
Num = KMOD_NUM,
Caps = KMOD_CAPS,
Mode = KMOD_MODE,
Reserved = KMOD_RESERVED,
Ctrl = KMOD_CTRL,
Shift = KMOD_SHIFT,
Alt = KMOD_ALT,
Gui = KMOD_GUI,
};
inline Keymode operator |(Keymode a,Keymode b){
return static_cast<Keymode>
(static_cast<Uint16>(a) | static_cast<Uint16>(b)
);
};
inline Keymode operator &(Keymode a,Keymode b){
return static_cast<Keymode>
(static_cast<Uint16>(a) & static_cast<Uint16>(b)
);
};
inline bool operator ==(Keymode a,Uint16 b){
return Uint16(a) == b;
}
inline bool operator !=(Keymode a,Uint16 b){
return Uint16(a) != b;
}
inline bool operator ==(Keycode a,SDL_Keycode b){
return SDL_Keycode(a) == b;
}
inline bool operator !=(Keycode a,SDL_Keycode b){
return SDL_Keycode(a) != b;
}
inline bool operator ==(Scancode a,SDL_Scancode b){
return SDL_Scancode(a) == b;
}
inline bool operator!=(Scancode a,SDL_Scancode b){
return SDL_Scancode(a) != b;
}
BTKAPI std::ostream &operator <<(std::ostream &o,Scancode c);
BTKAPI std::ostream &operator <<(std::ostream &o,Keycode c);
//Key
class BTKAPI KeySequence{
};
}
#endif // _BTK_LOCALS_HPP_
| cpp |
<filename>var/spack/repos/builtin/packages/netdata/package.py
# Copyright 2013-2020 Lawrence Livermore National Security, LLC and other
# Spack Project Developers. See the top-level COPYRIGHT file for details.
#
# SPDX-License-Identifier: (Apache-2.0 OR MIT)
from spack import *
class Netdata(AutotoolsPackage):
"""Real-time performance monitoring, done right!"""
homepage = "https://www.netdata.cloud/"
url = "https://github.com/netdata/netdata/archive/v1.22.1.tar.gz"
version('1.22.1', sha256='6efd785eab82f98892b4b4017cadfa4ce1688985915499bc75f2f888765a3446')
depends_on('m4', type='build')
depends_on('autoconf', type='build')
depends_on('automake', type='build')
depends_on('libtool', type='build')
depends_on('libuv')
depends_on('uuid')
| python |
Bengal managed 142 and 135 in their two innings with eight of their batsmen failing to score a single run across both innings. It was one of the lowest scores in the history of Ranji Trophy and easily the worst of the season so far in the country’s premier domestic tournament. So livid were the Odisha team after the game that their skipper Natraj Behera and OCA secretary Asirbad Behera confirmed that they were lodging an official complaint about the nature of the strip.
A fuming Odisha Cricket Association secretary told PTI, “Is this the kind of wicket you prepare for first-class matches? What is the point of having a four-day match if you want to make an under-prepared wicket and get it over in one and half days.
Singh, who was also the match referee during another two-day finish this season, confirmed receiving a complaint from the Odisha team. “Yes, Odisha have filed a complaint and I will forward it to the BCCI. I will also give my report. It is upto BCCI to decide,” Singh said.
Bengal coach Sairaj Bahutule said that the pitch was same for both teams. “This was a pitch where application was the key. We applied better than them. There has been far worse pitches that I can recall from my playing days. There is no point complaining about the strip,” said the Bengal coach and former Mumbai stalwart.
Bengal’s prospects of making it to the semi-final brightened with second straight six points, but the 22-yard strip left a lot to be desired.
The pitch was left dry by curator Sujan Mukherjee, a small-time First-Class cricketer of yesteryears.
The idea was to get a result-oriented pitch but it turned out to be surface where the top layer eroded as the match progressed. Mukherjee’s role in the preparation of the pitch will come under the scanner.
The only saving grace for Cricket Association of Bengal could be the fact that this was the fourth match of the season that ended inside two days. There were two matches involving Saurashtra and the other was played between Jammu & Kashmir and Services. All the matches, however, were Plate Group (Group C) encounters.
Such was the pitch that match referee Singh, from Himachal Pradesh, needed to enter the ground during breaks to check the condition of the track.
Brief scores:
Bengal 142 & 135 (Abhimanyu Easwaran 39, Sudeep Chatterjee 37, Manoj Tiwary 35; Basant Mohanty 5 for 16) beat Odisha 107 & (target 170) 37 in 19.2 overs (Ashok Dinda 7 for 19, Pragyan Ojha 3 for 14) by 133 runs.
This website uses cookies so that we can provide you with the best user experience possible. Cookie information is stored in your browser and performs functions such as recognising you when you return to our website and helping our team to understand which sections of the website you find most interesting and useful.
Strictly Necessary Cookie should be enabled at all times so that we can save your preferences for cookie settings.
If you disable this cookie, we will not be able to save your preferences. This means that every time you visit this website you will need to enable or disable cookies again.
| english |
AIFF Indigo partnership: The All India Football Federation announced IndiGo as its global partner and the official airline for the Indian Football Team, on Friday, September 15, 2023. Football is among the most popular sports in India, and IndiGo is the airline with the highest market share in the country, making this partnership even more significant, with a collective endeavour to unite fans and nurture the sport’s growth.
AIFF President Mr Kalyan Chaubey said, “It is indeed a pleasure for the All India Football Federation to partner with IndiGo. During my travels with IndiGo, I was impressed with the service and professionalism of the airline. Being the country’s largest airline, we consider this as IndiGo’s first sports partnership. We are really honoured and happy.
“With a population of 1.4 billion, is the fifth largest economy in the world. People say it’s a cricket nation, but I often say it’s a cricket-watching and a football-playing nation. It’s a mass sport, as every kid, you will find, is playing football. With this young population and this growing economy, we have partnered with IndiGo who can show leadership in the Indian airline market as well as in sports, where leaders from both organisations have also come up with a similar vision. I would request IndiGo to support us in every possible way and take this partnership and football forward together,” Mr Chaubey added.
Also Read:
As the official airline for the Indian Football Team, IndiGo’s network is meticulously designed to cater to the diverse travel requirements of players, officials, and support staff. From domestic tournaments to international matches, IndiGo’s comprehensive route map will ensure seamless and efficient journeys, allowing the team to focus solely on their game, unburdened by travel concerns.
In IndiGo, the AIFF finds a reliable and supportive travel partner who shares their passion for the sport. IndiGo is equally excited to support the Indian women’s football team as well, contributing to the empowerment of women in sports. This partnership empowers the Indian national teams to represent the nation with pride and excellence on the global stage, reinforcing the common bond they share with millions of fans. IndiGo, with its primary colour being blue, will be the carrier of the Blue Tigers and Blue Tigresses, flying them to new heights and across new frontiers.
AIFF Secretary General Dr Shaji Prabhakaran said, “It’s a historic day for Indian football. The airline IndiGo is flying high, and I’m sure with this partnership, we will only fly high. We wish you will always be the market leader. We believe it’s a great occasion that has never been seen in Indian football history. We never had a collaboration with any airline before; that is truly historic.
“I’m sure that this partnership will take Indian football to greater heights and we will work together to take football to a level whereby the world will look at us as we are flying very high with our collaboration. We will be there – be blue, and the Blue Tigers will take us to the skies and paint blue across and we will make India proud with this partnership. The vision is very clear: we want to be in the incredible state of sport in India, get the attention of the world, and be the biggest talent hub in the world. Maybe one day, we will be exporting in big numbers, and we will use your airline to export those talents as we fly high,” Dr Prabhakaran added.
The partnership between the AIFF and IndiGo is set to span one year, commencing from September 1, 2023, to August 31, 2024.
| english |
Names matter, as do the implicit assumptions made about diseases. Names can worsen discrimination against often already vulnerable groups. They can contribute to racist and neo-colonial ideas about other places and people. And they make it harder to respond to health crises.
Monkeypox, a virus transmitted to humans mostly through small rodents (and less commonly monkeys) was first identified in 1970, and infections have typically been confined to the parts of western and central Africa where it is endemic. The disease is usually mild, with symptoms including fever and rashes clearing within a few weeks.
This makes the latest outbreak, four-fifths of which is occurring in Europe, surprising and unusual. Since May, cases have climbed significantly, tripling in the last two weeks of June to more than 9,000 globally. The virus is currently spreading through person-to-person contact, and most cases in Europe appear to have originated in gay and bisexual male communities.
With monkeypox making headlines in the West, attention has turned to the virus’ name. In mid-June, the World Health Organization, which is under pressure to declare the outbreak a global public health emergency, called for the “monkeypox” moniker to be replaced with the more neutral sounding MPXV, in line with a WHO policy adopted in 2015 to avoid giving diseases names that discriminate or stigmatize.
It's reasonable to ask why, in the face of the rapid spread of a virus, we should be concerned with what it is called – especially when the virus in question is named after an animal. But there is a long history in global health of discrimination and the consequences that follow from the way diseases are named and seen in terms of who they affect. This can make responding to health crises more difficult.
This was particularly clear during the HIV and AIDS epidemics in the 1980s and 1990s. The links made between AIDS and particular groups (especially gay men) or moralizing over behaviors (the idea that infection was a consequence of promiscuity) explained why funding for the emerging crisis remained so low for so long, and why donors and national governments were often reluctant to provide public health messaging that might have helped protect more people from infection.
One of the first names given to what would become known as HIV and AIDS in the United States was “Gay-related immunodeficiency,” or GRID, which created a dangerous assumption that those at risk were gay men, and linking it to a deeply discriminatory set of public debates around homosexuality. The recognition that those injecting heroin were also at high risk in North America contributed to the sense of HIV as a disease of sin in the popular imagination.
When central and eastern Africa was eventually recognized as an epicenter of the HIV and AIDS epidemic, new, highly racist discussions around the virus and African culture and society began to emerge. Journalists asked deeply offensive racist questions about the origins of the virus. Little surprise that, in the face of such damaging and discriminatory ways of talking about the virus, many in Africa saw the disease as a way of perpetuating colonial criticisms of African life and African governments refused to act decisively to curb its spread.
In the United States and Europe, Syrian refugees were incorrectly blamed for an outbreak of “flesh-eating” leishmaniasis in the mid 2010s. In Britain, a rise in tuberculosis in the late 1990s was blamed on migrants from South Asia rather than on the poor living conditions and poverty they endured after arriving in the United Kingdom – the result of failed government immigration and welfare policies.
And across the world, people have been attacked and even murdered for living with HIV, reflecting the deep intertwining of a narrative of morality in public understanding of the disease.
All of this makes the identification of MPXV with gay and bisexual men problematic (and why “monkeypox” is offensive). Health officials are worried that its identification as a “gay disease” will increase stigma and make the task of responding to the outbreak harder. Public health officials note that MPXV is spread through close physical contact, not necessarily only through sex. But the association with sexual identity is already having a stigmatizing effect.
As a result, people may be less likely to come forward for testing, especially if they think their sexuality will be questioned (or assumed) as a result. It also means that those who are not in the assumed community of risk will be complacent. Health officials face a delicate balance in ensuring that those most at risk receive the vital information they need to protect themselves and to identify symptoms, without reinforcing damaging ideas about the virus.
Names matter, as do the implicit assumptions made about diseases. Names can worsen discrimination against often already vulnerable groups. They can contribute to racist and neo-colonial ideas about other places and people. And they make it harder to respond to health crises.
As Keiji Fukuda, the WHO assistant director who introduced the agency’s naming policy in 2015, noted, naming conventions “may seem like a trivial issue to some, but disease names really do matter to the people who are directly affected". What we call new viruses is a critical part of ensuring that diseases don’t become more damaging than they already are.
Michael Jennings is a guest contributor. Views expressed are personal. | english |
<gh_stars>0
{
"name": "msal-node-silent-flow",
"version": "1.0.0",
"description": "sample app for msal-node",
"main": "index.js",
"private": true,
"scripts": {
"start": "node index.js"
},
"author": "Microsoft",
"license": "MIT",
"dependencies": {
"@azure/msal-node": "^1.0.0",
"axios": "^0.21.1",
"dotenv": "8.2.0",
"ews-javascript-api": "^0.10.3",
"express": "^4.17.1",
"express-handlebars": "^5.2.1"
},
"repository": "https://github.com/ewsjs/oauth-demo/tree/master/examples/msal-node-samples/silent-flow"
}
| json |
<reponame>alarm-redist/redistmetrics<filename>src/varinfo.cpp
// [[Rcpp::interfaces(r, cpp)]]
#include <RcppArmadillo.h>
#include <RcppThread.h>
using namespace Rcpp;
using namespace arma;
double var_info(const uvec m1, const uvec m2, const vec pop, int k) {
int V = m1.n_elem;
mat joint(k, k);
vec p1(k);
vec p2(k);
double total_pop = 0;
for (int i = 0; i < V; i++) {
joint(m1[i]-1, m2[i]-1) += pop[i];
p1[m1[i]-1] += pop[i];
p2[m2[i]-1] += pop[i];
total_pop += pop[i];
}
double varinf = 0;
for (int i = 0; i < k; i++) {
for (int j = 0; j < k; j++) {
double jo = joint(i, j);
if (jo < 1) continue;
varinf -= (jo / total_pop) * (2.0*std::log(jo) - std::log(p1[i]) - std::log(p2[j]));
}
}
if (std::fabs(varinf) <= 1e-9)
varinf = 0;
return varinf;
}
/*
* `m` has rows = precincts, cols = plans
* `i` is the index of the plan we want to compute distances to
* `pop` is population of precincts
*
* Only computes pairs (i, j) with j < i
*/
// [[Rcpp::export(rng = false)]]
arma::mat var_info_mat(const arma::umat m, const arma::vec pop, int ndists, int ncores) {
int N = m.n_cols;
mat out(N, N);
RcppThread::parallelFor(1, N, [&] (int i) {
auto plan_i = m.col(i);
for (int j = 0; j < i; j++) {
double vi = var_info(plan_i, m.col(j), pop, ndists);
out(i, j) = vi;
out(j, i) = vi;
}
}, ncores);
return out;
}
| cpp |
Indraprastha Institute of Information Technology (IIIT), Delhi, invites applications for admission to Master of Technology (M. Tech) programme, commencing in 2014.
The M. Tech specialisations are offered in:
Eligibility:
Candidates must have a B. Tech / B. E degree in CS/IT/ECE/EE discipline with 70% of marks from any of the recognised universities.
How to apply:
- The application forms are available in the official website of Indraprastha Institute of Information Technology.
- The filled application form along with demand draft of Rs. 350/- in favor of 'IIIT Delhi', payable ay Delhi should reach the below address.
Admission Process:
Based on the facts furnished in the application, candidates have to appear for a competitive entrance process that includes written test. Written test will contain objective and/or short subjective questions. The questions will cover a typical B. Tech. CSE / ECE curriculum. The list of selected candidates and wait listed candidates will be prepared based on the written test performance.
Important dates:
- Last date for the submission of online application form is 05th May 2014.
- Last date for the submission of application form with DD is 09th May 2014.
Contact Details:
Assistant Manager (Academics),
A-107, Academics Building,
IIIT-Delhi, Okhla Industrial Area,
Phase-3, New Delhi - 110020. | english |
# T615-J Hazmat Drone
#### Personal website | markdown |
import { SmartMap } from "./SmartMap";
export { SmartMap } | typescript |
{
"stfFile":"spacequest/rescue/stn_endor_irs_imp_tier3_1a",
"entries": {
"title_d":"An Imperial Transport bearing weapons for the Imperial Research Station on Endor has been badly damaged in an escape from rebel pilots. Track down the freighter with the provided homing waypoint and get them back underway to the station.", "title":"Naboo System: Deliverance", "thanks_5":"", "thanks_4":"", "thanks_3":"Just a bit longer then we will make the jump.", "thanks_2":"Not so viscious now that there is a ship with guns firing back.", "thanks_1":"Excellent.", "taunt_5":"", "taunt_4":"", "taunt_3":"Your friend there will be no help to you.", "taunt_2":"I knew we would find you nearby.", "taunt_1":"This time there will be no escape.", "split_quest_alert_fail":"", "split_quest_alert":"\#pcontrast3 Endor Station: < \#pcontrast1 The transport is away. Hyperspace to the Endor System, navpoint Area D-435 to make the rendezvous here and complete the mission. \#pcontrast3 >", "rescue_phase_2":"Emergency startup is complete, lets get out of here Captain.", "rescue_phase_1":"Interlocks engaged, begining engine jumpstart sequence now.", "rescue_abandoned":"This is why the empire is a worse place for working with mercenaries.", "recovery_success":"\#pcontrast3 Endor Station: < \#pcontrast1 The transport has informed us they made the jump from the Naboo System. Their destination point is near the Area D-435 hyperspace point in the Endor System. Meet them there and finish bringing them into the station. \#pcontrast3 >", "quest_update":"%TO", "quest_location_t":"Naboo System", "quest_location_d":"The transport dropped out of Hyperspace early after an emergency jump to escape from the Rebel attack craft. Location will be updated when you are in range of their distress signal.", "quest_escort_t":"Escort", "quest_escort_d":"Escort the Transport safely to their jump point in the Naboo system and Rendezvous with them in Endor to complete the mission.", "quest_dock_t":"Dock", "quest_dock_d":"Target the transport and use the /dock command to initiate the repair procedure.", "panic_5":"", "panic_4":"", "panic_3":"I have seen this before.", "panic_2":"More Rebels coming.", "panic_1":"Here they come again.", "failed_destroy":"\#pcontrast3 Endor Staion: < \#pcontrast1 Oh, this is most terrible. \#pcontrast3 >", "docking_started":"Docking process has begun.", "docking_complete":"Docking process is complete.", "complete":"The transport is away.", "autorewardsubject":"Deliverance", "autorewardfrom":"Endor Station", "autorewardbody":"Completion Bonus: Deliverance (5000)", "attack_stopped":"\#pcontrast3 Tactical Computer: < \#pcontrast1 Hostile actions have ceased. \#pcontrast3 >", "attack_notify":"\#pcontrast3 Tactical Computer: < \#pcontrast1 Hostile craft detected on attack vector. \#pcontrast3 >", "assigned_delayed":"", "arrival_phase_2":"\#pcontrast3 Nav Computer: < \#pcontrast1 Distress signal located. Target location locked in. \#pcontrast3 >", "arrival_phase_1":"\#pcontrast3 Tactical Computer: < \#pcontrast1 Searching for the transports distress beacon... stand by.", "abort":"I am not hanging around here with no escort."
}}
| json |
import os
import select
import re
import logging
import Pyro4.core
import Pyro4.naming
from Pyro4.errors import NamingError
from Pyro4 import socketutil
## ServiceDaemon
#
# The service daemon that provide service interface
class ServiceDaemon(object):
## max name server retry
__retry = 10
## constructor
# @param pidfile The PID filename
def __init__(self, pidfile):
# init service parameter
self.stdin_path = self.stdout_path = self.stderr_path = "/dev/null"
self.pidfile_timeout = 10
pidfile = os.path.expanduser(pidfile)
directory = os.path.dirname(pidfile)
if not os.path.isdir(directory):
os.mkdir(directory)
self.pidfile_path = pidfile
self.files_preserve = []
# expose service name
self.__service_name = str(self.__class__.__name__)
# prepare exception logger
self.__exception = logging.getLogger(__name__)
handler = logging.FileHandler(os.path.join(directory, "exception.log"))
formatter = logging.Formatter("%(asctime)s; %(name)s; %(message)s")
handler.setFormatter(formatter)
self.__exception.addHandler(handler)
self.files_preserve.append(handler.stream)
## the virtual method of application specific initialization before service loop
# @param self The object pointer
def _initApp(self):
pass
## the virtual method of application specific destruction before service stop
# @param self The object pointer
def _delApp(self):
pass
## the implementation of running application
# @param self The object pointer
def run(self):
try:
# application specific initialization
self._initApp()
# prepare service connection
uri, name_server, broadcast_server = Pyro4.naming.startNS(host=socketutil.getIpAddress(None, workaround127=True))
daemon = Pyro4.core.Daemon()
service_uri = daemon.register(self)
name_server.nameserver.register(self.__service_name, service_uri)
# service connection waiting loop
while True:
try:
# create waiting sockets
name_server_sockets = set(name_server.sockets)
daemon_sockets = set(daemon.sockets)
rs = [broadcast_server]
rs.extend(name_server_sockets)
rs.extend(daemon_sockets)
rs, _, _ = select.select(rs, [], [], 3)
# socket processes
name_server_events = []
daemon_events = []
for s in rs:
if s is broadcast_server:
broadcast_server.processRequest()
elif s in name_server_sockets:
name_server_events.append(s)
elif s in daemon_sockets:
daemon_events.append(s)
if name_server_events:
name_server.events(name_server_events)
if daemon_events:
daemon.events(daemon_events)
# unregister myself when service daemon exit
except SystemExit:
# application specific destruction
self._delApp()
# unregister myself
daemon.unregister(self)
raise
except Exception, e:
self.__exception.exception(e)
## check if myself is running
# @param self The object pointer
def ping(self):
pass
## get myself
# @param self The object pointer
# @return my object pointer
def _getInstance(self):
instance = Pyro4.core.Proxy("PYRONAME:" + self.__service_name)
# check if myself is running
for i in range(self.__retry):
try:
instance.ping()
return instance
except NamingError as e:
continue
raise e
| python |
<filename>tests/TestSuite/Documentation/__snapshots__/Components/Card/Card_styles/Background_and_color__1.html
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN" "http://www.w3.org/TR/REC-html40/loose.dtd">
<?xml encoding="utf-8" ?><html><body>
<div class="bg-primary card mb-3 text-white">
<div class="card-header">
Header
</div>
<div class="card-body">
<h5 class="card-title">Primary card title</h5>
<p class="card-text">Some quick example text to build on the card title and make up the bulk of the card's content.</p>
</div>
</div>
<div class="bg-secondary card mb-3 text-white">
<div class="card-header">
Header
</div>
<div class="card-body">
<h5 class="card-title">Primary card title</h5>
<p class="card-text">Some quick example text to build on the card title and make up the bulk of the card's content.</p>
</div>
</div>
<div class="bg-success card mb-3 text-white">
<div class="card-header">
Header
</div>
<div class="card-body">
<h5 class="card-title">Primary card title</h5>
<p class="card-text">Some quick example text to build on the card title and make up the bulk of the card's content.</p>
</div>
</div>
<div class="bg-danger card mb-3 text-white">
<div class="card-header">
Header
</div>
<div class="card-body">
<h5 class="card-title">Primary card title</h5>
<p class="card-text">Some quick example text to build on the card title and make up the bulk of the card's content.</p>
</div>
</div>
<div class="bg-warning card mb-3 text-white">
<div class="card-header">
Header
</div>
<div class="card-body">
<h5 class="card-title">Primary card title</h5>
<p class="card-text">Some quick example text to build on the card title and make up the bulk of the card's content.</p>
</div>
</div>
<div class="bg-info card mb-3 text-white">
<div class="card-header">
Header
</div>
<div class="card-body">
<h5 class="card-title">Primary card title</h5>
<p class="card-text">Some quick example text to build on the card title and make up the bulk of the card's content.</p>
</div>
</div>
<div class="bg-light card mb-3">
<div class="card-header">
Header
</div>
<div class="card-body">
<h5 class="card-title">Primary card title</h5>
<p class="card-text">Some quick example text to build on the card title and make up the bulk of the card's content.</p>
</div>
</div>
<div class="bg-dark card mb-3 text-white">
<div class="card-header">
Header
</div>
<div class="card-body">
<h5 class="card-title">Primary card title</h5>
<p class="card-text">Some quick example text to build on the card title and make up the bulk of the card's content.</p>
</div>
</div>
</body></html>
| html |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.