text
stringlengths 1
1.04M
| language
stringclasses 25
values |
|---|---|
Rajiv Talreja, a business coach and serial entrepreneur, at present, runs three successful businesses. His earlier two businesses failed and shut down.
Learning from his failures, Rajiv today is on a mission to enable business owners in building their business, so it can grow without them on self-sustainable processes and teams.
His unique leadership style has impacted over 500,000 people through his business coaching and engagement programmes across 150 corporate organisations, and to over 5,000 business owners across five countries.
He is also supporting a project that funds the education of over 600 children from the slums of Bengaluru.
|
english
|
Summary:
Soundbars area good audio accessory to have. It is a rectangular device that is connected to your home theatre systems wirelessly to enhance the audio output and content viewing experience. Since it is wireless, it does not create any hassle or tangles. It is also improves the audio quality of your TV sets. A good sound bar is needed to utilise the full potential of your TV viewing experience.
If you were planning on investing in a sound bar, now is the right time. We have curated a list of best sound bars under ₹20,000. These sound bars have multiple important features and designs. You can pick one based on the size of your family or gatherings. The pros and the cons will help you understand the products better and make a wiser choice.
The Blaupunkt SBW600 is a 5,1 Dolby audio home theatre surround sound bar. It comes with a 20. 32 cm sub-woofer and remote control. It can connect wirelessly to devices but also has the option of connecting with AUX and HDMI. The bass performance is good and it is ideal for home theatre systems.
Specifications:
The Sony HT-S20R is a good looking speaker system with a 5. 1 channel Dolby digital sound bar. It is a 400W speaker system with USB connectivity. It is ideal for parties and bug gatherings due to its crisp and loud audio output. There are multiple modes for you to choose from to match the genre of music you are playing.
Specifications:
Infinity INFCBARW200 Soundbar not only has a distinctive look but also has the best performance features. The product's primary function is to deliver extraordinary sound quality that mesmerises everyone. Furthermore, it has a contemporary style with a modern outer look, and the product is easier to install within a couple of minutes. In addition, one can do live streaming by connecting one device to another with Bluetooth. Moreover, the product has deep bass that enables extraordinary sound for movies, music, and virtual games. The soundbar has a multi-connectivity feature that allows you to connect different devices.
Specifications:
The Philips TAB7305 2. 1 Soundbar is the replacement for one of their earlier best-selling models, which was first introduced in 2018. This variant has a wireless subwoofer in addition to the most recent soundbar capabilities. This sound bar is a visual treat for spectators because of its straightforward angled shape and low profile.
The Philips Audio TAB5305 is a powerful 2. 1 channel soundbar that delivers a total output of 140W. It comes with a wireless subwoofer that produces deep and impactful bass. The soundbar supports multiple connectivity options, including Bluetooth, USB, AUX, and FM. It also comes with a remote control for easy operation. With its sleek black design, the TAB5305 is a stylish addition to any home entertainment setup.
Specifications:
The JBL Bar 2. 1 Deep Bass Soundbar is a powerful audio device designed to enhance your home entertainment experience. It features a wireless subwoofer that delivers deep, rich bass, and a compact soundbar that provides crystal-clear audio. The soundbar also comes equipped with JBL Surround Sound technology, which creates a 3D audio experience. The soundbar is Bluetooth-enabled, allowing you to stream your favourite music wirelessly from your smartphone or tablet. With a sleek and modern design, this soundbar is an excellent addition to any home theatre setup.
The boAt Aavante Bar Orion soundbar is a sleek and powerful home audio device with 160W RMS Signature Sound and a 2. 1 channel configuration that delivers immersive sound for movies, music, and games. It has a wired subwoofer for deep bass and equalizer controls for customizing sound output. With Bluetooth v5. 3, multiple connectivity options, and a master remote control, it is compatible with a wide range of devices. Its dynamic LED lights add a touch of style to your entertainment setup, making it perfect for enhancing the audio experience of your home entertainment.
Specifications:
A very ancient Indian audio firm, Zebronics, was founded in 1997. The brand is recognised for its top-quality items, elegant style, and exceptional performance. One potent subwoofer with quad 5. 71 cm and dual 5. 08 cm drivers, which create balanced sound and give you the greatest cinematic experience, makes up the composition of the audio components.
This is a soundbar with a wireless subwoofer that delivers powerful and clear sound. With a total output power of 300W, it features Bluetooth connectivity and supports multiple sound modes. The soundbar is compatible with Samsung TVs and can be controlled with a single remote. Its slim and sleek design makes it easy to fit in any space. The wireless subwoofer can be placed anywhere in the room, providing flexibility and convenience. It also comes with a wall-mount kit for easy installation.
There is a wired connection between the soundbar and subwoofer. The soundbar now supports Bluetooth connectivity in addition to optical and HDMI. A basic, straightforward remote control is also included with the soundbar. On the soundbar, there are extra physical controls.
Philips is known for manufacturing the best electronics throughout the world. When it comes to soundbars, Philips has the best range of products that comes at an affordable price. With the best sound quality and easy to install, Philips is a brand that offers the best value for money. From the above list, Philips is one brand that has affordable soundbars.
You just reviewed the top soundbars under 20,000 rupees. This list was created based on design, quality, dependability, and performance, which is the most significant factor. And you must have learned that all these soundbars are not only fashionable but also excellent at creating high-quality audio and are furnished with various incredible functions. Only after thoroughly researching each product have we compiled this list. Our top picks from the soundbars is the Philips TAB7305 Soundbar. Characteristics like good build quality, excellent audio output, and connectivity choices set this product apart from similar ones.
How to find the perfect soundbar?
Because they are portable, simple to set up, and sound far better than most built-in TV speakers, soundbars are an excellent entry point into home theatre audio. The type of TV you own, the number of drivers it has, its size, as well as other aspects should all be taken into consideration when choosing a soundbar. The size of your TV is the first factor you should take into account before purchasing a soundbar for it. Whether or if you require a wireless connection is something else you should think about. Through a variety of speakers, the greatest soundbars deliver a surround sound experience. A specialised woofer and subwoofer are included with expensive versions.
From our end, that is all. We hope our post helped you choose the top soundbar in India for under INR 20,000 in price. We have included some of the top audio accessories you can choose from without going over price. Before purchasing a soundbar, you should always make a list of your demands and expectations.
Which soundbar brand is the best?
The top and most reputable soundbar brands in the world are Sony, Samsung, and JBL. Costly-quality soundbars are also produced by Philips, however, their costs are a bit high. However, many pick soundbars according to their personal preferences.
Are TV soundbars worth the price?
Unquestionably, TV soundbars are worth the cost. As televisions get smaller and smaller, lengthier speaker units cannot be fitted within. Therefore, compared to what a typical TV can give, soundbars deliver rich and lively audio.
What is an excellent soundbar's power?
Your soundbar's battery life determines how excellent it is. Your soundbar would inevitably use energy, given the variety of options it has. A decent soundbar should have a power level between 85 and 88 dB.
Can a soundbar accommodate more speakers?
The soundbar can accommodate additional speakers, YES. However, you must first ensure that the model, external speakers, output device connection, and other important criteria are in order.
Is 5. 1 surround sound superior to 2. 1?
As it has more speakers than 2. 1 systems, a 5. 1 system delivers a superior surround sound experience. A front centre speaker, front left and right speakers, and a 5. 1 soundbar with 5 speakers total are included. The only components of a 2. 1 system are the front-facing Left and Right channels and a subwoofer.
At Hindustan Times, we help you stay up-to-date with the latest trends and products. Hindustan Times has affiliate partnership, so we may get a part of the revenue when you make a purchase.
|
english
|
{
"<page title>": "800tvl 27x Zoom Auto Tracking 150m Ir Ptz Cctv Surveillance Camera With Ip66 Waterproof - Buy Surveillance Camera,Cctv Surveillance Camera,Ptz Cctv Surveillance Camera Product on Alibaba.com",
"day and night": "IR cut filter",
"gross weight": "10KG",
"horizontal resolution": "800 TVL",
"image sensor": "1/4'' SONY CMOS",
"ir control": "Auto",
"lens": "f=3.2 -86.4mm",
"manual control speed": "0.01\u00b0 - 180\u00b0/second",
"material": "Aluminum shell",
"minimum illumination": "OLux (IR on)",
"model": "CSJ-DH6RX-Y",
"operating temperature": "-35 - 65\u00b0C",
"optical zoom": "27x/30x/36x",
"osd language": "English, Chinese menu",
"package dimension": "320*320*440mm",
"pan": "360\u00b0 continous",
"presets": "256",
"protocal": "PELCO-D, PELCO-P,RS485",
"shutter time": "PLA:1/50-1/10000S; NTSC:1/60-1/12000S",
"signal model": "PAL/NTSC",
"sn ratio": ">50dB(AGC OFF)",
"special features": "Auto tracking for the movable object on the scene and auto zoom",
"supply voltage": "DC12V (4A)",
"tilt": "-10\u00b0 - 90\u00b0",
"waterproof criterion": "IP66"
}
|
json
|
<reponame>Timendainum/wintermute-web
module.exports = (app) => {
"use strict";
app.get("/status", (req, res) => {
res.send({
message: "hello"
})
});
app.post("/register", (req, res) => {
res.send({
message: `Hello ${req.body.email}, your user was registered!`,
email: `${req.body.email}`
});
});
};
|
javascript
|
<filename>plugin/core/src/com/perl5/lang/pod/parser/psi/impl/PodFileImpl.java
/*
* Copyright 2015-2020 <NAME>
*
* 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.
*/
package com.perl5.lang.pod.parser.psi.impl;
import com.intellij.extapi.psi.PsiFileBase;
import com.intellij.navigation.ItemPresentation;
import com.intellij.openapi.fileTypes.FileType;
import com.intellij.openapi.util.text.StringUtil;
import com.intellij.openapi.vfs.VirtualFile;
import com.intellij.psi.FileViewProvider;
import com.intellij.psi.PsiDirectory;
import com.intellij.psi.PsiElement;
import com.intellij.psi.PsiFile;
import com.intellij.util.ObjectUtils;
import com.perl5.lang.pod.PodLanguage;
import com.perl5.lang.pod.filetypes.PodFileType;
import com.perl5.lang.pod.parser.psi.PodFile;
import com.perl5.lang.pod.parser.psi.PodRenderingContext;
import com.perl5.lang.pod.parser.psi.PodTitledSection;
import com.perl5.lang.pod.parser.psi.util.PodFileUtil;
import com.perl5.lang.pod.parser.psi.util.PodRenderUtil;
import org.jetbrains.annotations.NotNull;
import org.jetbrains.annotations.Nullable;
import javax.swing.*;
public class PodFileImpl extends PsiFileBase implements PodFile {
public PodFileImpl(@NotNull FileViewProvider viewProvider) {
super(viewProvider, PodLanguage.INSTANCE);
}
@Override
public @NotNull FileType getFileType() {
return PodFileType.INSTANCE;
}
@Override
public String toString() {
return "POD file";
}
@Override
public Icon getIcon(int flags) {
PsiFile baseFile = getViewProvider().getStubBindingRoot();
return baseFile == this ? super.getIcon(flags) : baseFile.getIcon(flags);
}
@Override
public void renderElementAsHTML(StringBuilder builder, PodRenderingContext context) {
PodRenderUtil.renderPsiRangeAsHTML(getFirstNamedBlock(), null, builder, context);
}
public @Nullable PsiElement getFirstNamedBlock() {
return findChildByClass(PodTitledSection.class);
}
@Override
public void renderElementAsText(StringBuilder builder, PodRenderingContext context) {
PodRenderUtil.renderPsiRangeAsText(getFirstNamedBlock(), null, builder, context);
}
@Override
public boolean isIndexed() {
return false;
}
@Override
public int getListLevel() {
return 0;
}
@Override
public boolean isHeading() {
return false;
}
@Override
public ItemPresentation getPresentation() {
return this;
}
@Override
public @Nullable String getPresentableText() {
String packageName = getNormalizedPackageName();
return packageName == null ? getName() : packageName;
}
/**
* Returns POD file normalized package name (with optionally trimmed {@code pod::})
*
* @return POD package name or null if this is a script file file or smth
*/
private @Nullable String getNormalizedPackageName() {
String packageName = PodFileUtil.getPackageName(this);
if (StringUtil.isEmpty(packageName)) {
return null;
}
return StringUtil.trimStart(packageName, "pod::");
}
@Override
public @Nullable String getLocationString() {
final PsiDirectory psiDirectory = getParent();
if (psiDirectory != null) {
return psiDirectory.getVirtualFile().getPresentableUrl();
}
return null;
}
@Override
public @Nullable Icon getIcon(boolean unused) {
return getFileType().getIcon();
}
@Override
public @Nullable String getPodLink() {
String normalizedPackageName = getNormalizedPackageName();
if (StringUtil.isNotEmpty(normalizedPackageName)) {
return normalizedPackageName;
}
return null;
}
@Override
public @Nullable String getPodLinkText() {
String normalizedPackageName = getNormalizedPackageName();
if (StringUtil.isNotEmpty(normalizedPackageName)) {
return normalizedPackageName;
}
return ObjectUtils.doIfNotNull(getVirtualFile(), VirtualFile::getName);
}
@Override
public int getHeadingLevel() {
return 0;
}
}
|
java
|
Farmer unions protesting against the 3 farm laws on Saturday said they will decide their next course of action in the next two-three days after the Supreme Court earlier this week pointed out it was thinking of setting up an "impartial and independent" panel of agriculture experts and peasants' unions to resolve the deadlock.
Farmer leader Shiv Kumar Kakka said discussions among unions are currently underway to decide their strategy, adding that they are also seeking legal opinion on the matter.
"Our meetings are being held for the next course of action. We are hopeful that in the next two-three days, we will have clarity on whether we should be part of a committee as suggested by the court," Kakka told PTI. Another leader Balbir Singh said farmers will not call off their protests until their demands are met.
"We are ready for a long haul. We are here for our rights. We are in the process to decide our stand following the court's order," he also said. Thousands of farmers have been staying put at several Delhi border points for the last 23 days, demanding a repeal of the new agri laws.
conditions.
According to AIKS, 'Homage Day' will be observed in different parts of the country on Sunday to pay tributes to those farmers who lost their lives.
Earlier this week, the Supreme Court had acknowledged the right of farmers to non-violent protests and mooted the idea of putting on hold the contentious farm laws to enable negotiations with the agitating farmers, which was opposed by the Centre, which said the agriculturists would not come forward for the talks then.
The apex court, which made it clear that the issue of farmers' protest and the right of others to move freely would be dealt on priority at the moment and not the validity of the laws, also said it was thinking of setting up an "impartial and independent" panel of agriculture experts and farmer unions to resolve the impasse.
The top court said it was of the view that the farmers' right to protest should not infringe the fundamental right of others to move freely and in getting essential food and other supplies as right to protest cannot mean blocking the entire city.
The apex court, which said it was worried with the way things are going on, was told by both the Centre and one of the farmers' unions that the negotiations are not happening at the moment. It also said the farmers cannot keep on protesting without talking to the government.
Can Opposition political parties unitedly will fight against BJP in the General Elections to be held next year in 2024?
|
english
|
<filename>css/cart.css
body {
background: #eee;
margin-top: 80px;
padding: 0;
overflow-x: hidden;
}
main{
min-height: 800px;
}
.clearfix {
content: "";
display: table;
clear: both;
}
.container {
font-family: 'Open Sans', sans-serif;
margin: 0 auto;
width: 980px;
}
#container{
min-height: 450px;
}
.product {
border: 1px solid #eee;
margin: 20px 0;
width: 100%;
height: 195px;
position: relative;
-webkit-transition: margin .2s linear, opacity .2s linear;
-moz-transition: margin .2s linear, opacity .2s linear;
-ms-transition: margin .2s linear, opacity .2s linear;
-o-transition: margin .2s linear, opacity .2s linear;
transition: margin .2s linear, opacity .2s linear;
}
.product img {
height: 100%;
border-top-right-radius: 20px;
border-bottom-left-radius: 20px;
border-bottom-right-radius: 20px;
}
.product header, .product .content {
border-style: none none solid none;
float: left;
}
.product .content {
background-color: #fff;
border: 1px solid #ccc;
}
.product header {
margin: 0 1% 20px 0;
overflow: hidden;
padding: 0;
position: relative;
width: 24%;
height: 195px;
}
.product header:hover img {
opacity: .7;
}
.product header:hover h3 {
bottom: 73px;
}
.product header h3 {
background: black;
color: #fff;
font-size: 22px;
font-weight: 300;
line-height: 49px;
margin: 0;
padding: 0 30px;
position: absolute;
bottom: -50px;
right: 0;
left: 0;
-webkit-transition: bottom .2s linear;
-moz-transition: bottom .2s linear;
-ms-transition: bottom .2s linear;
-o-transition: bottom .2s linear;
transition: bottom .2s linear;
}
.remove {
cursor: pointer;
}
.product .content {
box-sizing: border-box;
-moz-box-sizing: border-box;
height: 140px;
padding: 0 20px;
width: 75%;
}
.product h1 {
color: black;
font-size: 30px;
font-weight: 300;
margin: 50px auto auto auto;
}
.product footer.content {
height: 50px;
margin: 6px 0 0 0;
padding: 0;
}
.product footer .price {
background: #fcfcfc;
color: #000;
float: right;
font-size: 15px;
font-weight: 300;
line-height: 49px;
margin: 0;
padding: 0 30px;
}
.product footer .full-price {
background: black;
color: #fff;
float: right;
font-size: 22px;
font-weight: 300;
line-height: 49px;
margin: 0;
padding: 0 30px;
}
.qt, .qt-plus, .qt-minus {
display: block;
float: left;
}
.qt {
font-size: 19px;
line-height: 50px;
width: 70px;
text-align: center;
}
.qt-plus, .qt-minus {
background: #fcfcfc;
border: none;
font-size: 30px;
font-weight: 300;
height: 100%;
padding: 0 20px;
}
.qt-plus:hover, .qt-minus:hover {
background: black;
color: #fff;
cursor: pointer;
}
.qt-plus {
line-height: 50px;
}
.qt-minus {
line-height: 47px;
}
#site-footer {
margin: 30px 0 0 0;
padding: 40px;
background: #fff;
height: 90px;
}
#site-footer h1 {
background: #fcfcfc;
border: 1px solid #ccc;
border-style: none none solid none;
font-size: 24px;
font-weight: 300;
margin: 0 0 7px 0;
padding: 14px 40px;
text-align: center;
}
#site-footer h2 {
font-size: 24px;
font-weight: 300;
margin: 10px 0 0 0;
}
#site-footer h3 {
font-size: 19px;
font-weight: 300;
margin: 15px 0;
}
.left {
float: left;
}
.right {
float: right;
}
.btn {
background: black;
border: 1px solid #999;
border-style: none none solid none;
cursor: pointer;
display: block;
color: #fff;
font-size: 20px;
font-weight: 300;
padding: 16px 0;
width: 290px;
text-align: center;
-webkit-transition: all .2s linear;
-moz-transition: all .2s linear;
-ms-transition: all .2s linear;
-o-transition: all .2s linear;
transition: all .2s linear;
}
/* ---------Form----------- */
body {font-family: Arial, Helvetica, sans-serif;}
/* The popup form - hidden by default */
.form-popup {
display: none;
position: fixed;
bottom: 0;
right: 15px;
border: 3px solid #f1f1f1;
z-index: 9;
}
/* Add styles to the form container */
.form-container {
max-width: 300px;
padding: 10px;
background-color: white;
position: relative;
}
/* Full-width input fields */
.form-container input[type=text], .form-container input[type=number] {
width: 88%;
padding: 15px;
margin: 5px 2px 5px 2px;
border: none;
background: #f1f1f1;
}
/* When the inputs get focus, do something */
.form-container input[type=text]:focus, .form-container input[type=number]:focus {
background-color: rgb(199, 199, 199);
outline: none;
}
/* Set a style for the submit/login button */
.form-container .btn {
cursor: pointer;
width: 100%;
margin-bottom:10px;
}
/* Add a red background color to the cancel button */
.form-container .cancel {
background-color: red;
}
/* Add some hover effects to buttons */
.btn:hover{
opacity: .8;
}
.form-container h1{
font-size: 30px;
padding-bottom: 10;
}
input[type=number]::-webkit-inner-spin-button{
appearance: none;
margin: 0;
}
/* ----------------------------------------------------------- */
/* -------------------- */
.topnav {
position: fixed;
align-items: flex-end;
justify-content: flex-end;
top: 0;
left: 0;
z-index: 9999;
width: 100%;
height: 70px;
background-color:black;
box-shadow: 0px 0px 10px gray;
display: flex;
line-height: 50px;
}
.topnav> .brand {
position: absolute;
left: 5%;
top: 12%;
}
.topnav .link {
flex: left;
margin: 7% 10px 11px;
padding: 10px 0 0 12px;
text-decoration: none;
color: #fff;
font-size: 25px;
font-family:open-sans-serif;
/* font-weight: bolder; */
}
.topnav >a>i{
display: inline;
float: left;
margin-top: 12px;
margin-right:12px;
margin-bottom:17px;
}
.topnav>a :hover{
-ms-transform: scale(1.5); /* IE 9 */
-webkit-transform: scale(1.5); /* Safari 3-8 */
transform: scale(1.5);
}
.topnav >.link:hover {
border-bottom: 2px solid white;
}
.footer-sticky {
position: absolute;
width:100%;
background: black;
color:white;
margin-top: 0px;
font-family:open-sans-serif;
padding-bottom: 20px;
}
.icons{
padding-top: 1rem;
text-align: center;
}
.icons a{
text-align: center;
text-decoration: none;
font-size: 2rem;
margin: 0.5rem;
color: #f4f4f4;
}
.company-name{
font-size: 1.6rem;
margin-top: 0.5rem;
}
@media (max-width: 500px){
html{
font-size: 50%;
}
}
@media(min-width: 501px) and (max-width: 768px){
html{
font-size: 50%;
}
}
/* --------------------------------------- */
#box{
margin-top:60px;
display:flex;
justify-content:space-around;
flex-wrap:wrap;
position: fixed;
top: 50%;
left: 50%;
transform: translate(-50%, -50%);
width: 50%;
}
.alert{
margin-top:25px;
/* background-color:#fff; */
font-size:25px;
font-family:sans-serif;
text-align:center;
width:300px;
height:100px;
padding-top: 150px;
position:relative;
/* border: 1px solid #efefda;
border-radius: 2%;
box-shadow:0px 0px 3px 1px #ccc; */
}
.alert::before{
width:100px;
height:100px;
position:absolute;
border-radius: 100%;
inset: 20px 0px 0px 100px;
font-size: 60px;
line-height: 100px;
border : 5px solid gray;
animation: reveal 1.5s 2;
animation-timing-function: ease-in-out;
animation-direction: alternate;
}
.alert>.alert-body{
opacity:0;
animation-timing-function: ease-out;
animation-delay:1.5s;
animation-fill-mode:forwards;
animation: reveal-message 1s 2;
animation-direction: alternate;
}
@keyframes reveal-message{
from{
opacity:0;
}
to{
opacity:1;
}
}
.success{
color:green;
}
.empty{
color: red;
}
.empty::before{
content: 'X';
background-color: #eff;
box-shadow: 0px 0px 12px 7px rgba(200,255,150,0.8) inset;
border : 5px solid red;
}
.success::before{
content: '✓';
background-color: #eff;
box-shadow: 0px 0px 12px 7px rgba(200,255,150,0.8) inset;
border : 5px solid green;
}
@keyframes reveal {
0%{
border: 5px solid transparent;
color: transparent;
box-shadow: 0px 0px 12px 7px rgba(255,250,250,0.8) inset;
transform: rotate(1000deg);
}
25% {
border-top:5px solid gray;
color: transparent;
box-shadow: 0px 0px 17px 10px rgba(255,250,250,0.8) inset;
}
50%{
border-right: 5px solid gray;
border-left : 5px solid gray;
color:transparent;
box-shadow: 0px 0px 17px 10px rgba(200,200,200,0.8) inset;
}
75% {
border-bottom: 5px solid gray;
color:gray;
box-shadow: 0px 0px 12px 7px rgba(200,200,200,0.8) inset;
}
100%{
border: 5px solid gray;
box-shadow: 0px 0px 12px 7px rgba(200,200,200,0.8) inset;
}
}
|
css
|
Just like the last two years, this year too the Assembly witnessed a paperless budget. At 10 am, the state finance minister began reading his budget speech in the Tamil Nadu Assembly.
Tamil Nadu Finance Minister Palanivel Thiaga Rajan on Monday (March 20) presented the Budget for the financial year 2023-24 in the State Legislative Assembly in Chennai. This is the first day of the second Assembly session for the year.
Addressing the Parliament, FM Palanivel Thiaga Rajan announced that Chola Museum will be established at Thanjavur to highlight the achievements of Chola Kings.
In 2021, the DMK won the last assembly elections and came back to power in the state. Subsequently, the DMK government presented the interim budget in August 2021.
Just like the last two years, this year too the Assembly witnessed a paperless budget. At 10 am, the state finance minister began reading his budget speech in the Tamil Nadu Assembly.
The finance minister also announced a sum of Rs 500 crore has been allocated to expand the Chief Minister's Breakfast Scheme for students, as a result of which 18 lakh students are to be benefitted.
"New classrooms and laboratories in 55 government colleges will be completed this year," FM Palanivel Thiaga Rajan said.
A sum of Rs 3,513 crore has been allocated for Adi Dravidar and Tribal Welfare. Modernised hostels for Adi Dravidar students are to be established at Madurai, Coimbatore, Tiruchi and the Nilgiris districts at a budget outlay of Rs 100 crore.
|
english
|
8 Then the men of Ephraim said to him, “What have you done to us by not calling us to go and wage war against Midian?” They argued heatedly with him.
2 He said to them, “What have I done now compared to you? Are not the gleanings of the grapes of Ephraim better than the harvest of Abiezer? 3 It was into your hands that God gave the Midianite commanders, Oreb and Zeeb. What was I able to do compared to you?” When Gideon said this, their anger against him cooled down.
10 Now Zebah and Zalmunna were in Karkor with their armies, about fifteen thousand survivors; they were all who were left of all the army of the Kedemites, for one hundred twenty thousand arms-bearing men had fallen. 11 Gideon went up on the route of the tent dwellers east of Nobah and Jogbehah and attacked the camp while the army was off guard. 12 Zebah and Zalmunna fled, and Gideon chased after them. He captured Zebah and Zalmunna, the two kings of Midian, and the entire army was terrified.
13 Gideon son of Joash returned from battle by the Pass of Heres. 14 He captured a young man from among the men of Sukkoth and asked him to write the names of the leaders and elders of Sukkoth, seventy-seven men. 15 Then he came to the men of Sukkoth and said, “Here are Zebah and Zalmunna, about whom you taunted me. You said, ‘Have you subjugated Zebah and Zalmunna that we should give bread to your weary army?’ ” 16 He took the city elders and disciplined the men of Sukkoth with thorns and briers of the wilderness. 17 He tore down the tower of Peniel and killed the men of the city.
19 He said, “They were my brothers, the sons of my mother. As the Lord lives, if you had allowed them to live, I would not kill you.” 20 Gideon said to his firstborn Jether, “Rise and kill them!” Yet the young man did not draw his sword because he was afraid, for he was still a young man.
21 Then Zebah and Zalmunna said, “You get up and attack us, for a man is judged by his strength.” So Gideon got up and killed Zebah and Zalmunna and took the crescent-shaped ornaments that were on the necks of their camels.
23 Gideon said to them, “I will not rule over you, and my son will not rule over you. The Lord will rule over you.” 24 Gideon continued, “I have a request to make of you, that each man would give me an earring from his spoils.” (Their enemy had golden earrings because they were Ishmaelites.)
25 They said, “We will certainly give them.” So they spread out a cloak, and each man threw a ring of his spoils there. 26 The weight of the golden earrings that he requested was seventeen hundred gold shekels.[a] This was in addition to the crescent-shaped ornaments, jewelry, and purple clothing worn by the kings of Midian, as well as the chains hanging on the necks of their camels. 27 Gideon used these things to make an ephod. He put it in his city, in Ophrah, and all Israel prostituted themselves to it there. It became a snare to Gideon and his family.
28 The Midianites were humbled before the children of Israel and did not lift their heads high again. The land had peace for forty years in the days of Gideon.
29 Jerub-Baal son of Joash went to his house and lived there. 30 Gideon had seventy sons, for he had many wives. 31 His concubine who lived in Shechem also bore him a son, and he named him Abimelek. 32 Gideon son of Joash died at a good old age, and he was buried in the tomb of his father Joash in Ophrah of the Abiezrites.
33 After Gideon died, the children of Israel turned again to prostitute themselves with the Baals. They made Baal-Berith their god. 34 The children of Israel did not remember the Lord their God, who had delivered them from the hands of their enemies around them, 35 and they did not keep faith with the family of Jerub-Baal (that is, Gideon), for all the good he had done for Israel.
- Judges 8:26 About 43 pounds, or 20 kilograms.
The Holy Bible, Modern English Version. Copyright © 2014 by Military Bible Association. Published and distributed by Charisma House.
|
english
|
//
// Copyright (c) 2019 <NAME> (<EMAIL>)
// Copyright (c) 2020 <NAME> (<EMAIL>)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
// Official repository: https://github.com/vinniefalco/json
//
#ifndef BOOST_JSON_VALUE_TO_HPP
#define BOOST_JSON_VALUE_TO_HPP
#include <boost/json/detail/config.hpp>
#include <boost/json/value.hpp>
#include <boost/json/detail/value_to.hpp>
namespace boost {
namespace json {
/** Customization point tag.
The tag-type used to identify `tag_invoke` overloads
called by @ref value_to.
@note This type is empty; it has no members.
*/
template<class T>
struct value_to_tag;
/** Convert a @ref value to an object of type `T`.
This function attempts to convert a @ref value
to `T` using
@li one of `T`'s constructors,
@li a library-provided generic conversion, or
@li a user-provided overload of `tag_invoke`.
In all cases, the conversion is done by calling
an overload of `tag_invoke`.
The function used to convert an expression `e`
of type @ref value is determined as follows.
Let _S_ be the set of all declarations found
by argument-dependent lookup for the function call
@code
tag_invoke( value_to_tag<T>(), jv )
@endcode
Then, an attempt to find an applicable library-provided
conversion (if any) is made. Add to _S_
@li an additional function designated the
_built-in candidate_ if `T` is @ref value, @ref object,
@ref array, @ref string or `bool`, or if
`std::is_arithmetic<T>::value` is `true`, otherwise,
@li an additional function designated the
_constructor candidate_ if
`std::is_constructible<T, const value&>::value`, otherwise,
@li an additional function designated the
_string conversion candidate_ if `T`
satisfies _StringLike_, otherwise,
@li an additional function designated the
_map conversion candidate_ if `T`
satisfies _ToMapLike_, otherwise,
@li an additional function designated the
_container conversion candidate_ if `T`
satisfies _ToContainerLike_, otherwise,
If a library-provided conversion is added to
_S_, it has the form
@code
template<typename U>
U tag_invoke( value_to_tag<T>, const value& );
@endcode
Using _S_, overload resolution is performed to
find the single best candidate to convert `jv`
to `T`. If more than one function is found
or if no viable function is found, the conversion
fails. Otherwise, the selected function `F` is called
with `F( value_to_tag<T>(), jv )` and its result is
returned as the result of the conversion.
@par Constraints
@code
! std::is_reference< T >::value
@endcode
@par Exception Safety
Strong guarantee.
@tparam T The type to convert to.
@returns `jv` converted to `T`.
@param jv The @ref value to convert.
@see @ref value_from, http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2019/p1895r0.pdf
*/
template<class T
#ifndef BOOST_JSON_DOCS
, typename std::enable_if<
!std::is_reference<T>::value>::type*
#endif
>
T
value_to(value const& jv)
{
return detail::value_to_impl(
value_to_tag<detail::remove_cv<T>>(), jv);
}
/** Determine if `T` can be converted to a JSON value.
Given an expression `jv` of type @ref value,
if overload resolution for the set of `tag_invoke`
overloads performed by the function call
@code
value_to< T >( jv )
@endcode
would find a single best `tag_invoke` function to call,
then this class template inherits from `std::true_type`;
otherwise, it inherits from `std::false_type`.
*/
#ifdef BOOST_JSON_DOCS
template<class T>
using has_value_to = __see_below__;
#else
template<class T, class>
struct has_value_to
: std::false_type { };
template<class T>
struct has_value_to<T, detail::void_t<decltype(detail::value_to_impl(
value_to_tag<detail::remove_cv<T>>(), std::declval<const value&>())),
typename std::enable_if<!std::is_reference<T>::value>::type>>
: std::true_type { };
#endif
} // json
} // boost
#endif
|
cpp
|
Jurgen Klopp said he got the reaction he wanted after Harvey Elliott’s sublime strike put troubled Liverpool back on track with a 1-0 win at Wolves in Tuesday’s FA Cup third-round replay.
Klopp’s side came in for scathing criticism after losing their last two Premier League games in desultory fashion at Brighton and Brentford.
But Elliott’s brilliant long-range effort in the first half at Molineux secured a much-needed first victory in four games in all competitions.
Ironically, Liverpool’s reward for seeing off Wolves is a return trip to Brighton in the fourth round.
The Reds’ dismal 3-0 defeat at Brighton on Saturday left them languishing in ninth place in the Premier League, 10 points adrift of the top four.
“It feels like ages ago that we had that feeling that we win and play well," Klopp said.
“We played a really good first half and in the end it was just passion to block the shots. It’s the reaction we wanted to see from ourselves and the boys delivered.
“The goal was exceptional. I don’t want to make Harvey’s performance smaller, but I had a few men of the match today, just the others didn’t score. "
In the bout of soul-searching that followed that embarrassment, Klopp said his struggling team needed to go “back to basics".
Amid mounting questions about Klopp’s own future at Anfield, the German claimed this week that he will not leave the club unless he is forced to and hinted at changes in his squad during the summer.
Hamstrung by injuries to a host of key players including Virgil van Dijk and Luis Diaz, Klopp made eight changes after the Brighton debacle, with only Cody Gakpo, Thiago Alcantara and Ibrahima Konate retaining their places.
Mohamed Salah and Alisson Becker were among those left out, but Liverpool’s understudies rose to the challenge.
Wolves had forced the replay with a 2-2 draw at Anfield, but Julen Lopetegui’s side were angered when they had a potential winning goal from Toti controversially ruled out for offside in the final seconds.
They were unable to take their chance to avenge that injustice despite a lively start that saw Adama Traore’s cross headed just wide by Raul Jimenez.
It was Eliott who produced the opener in breathtaking fashion in the 13th minute.
Klopp’s midfield has been written off as ageing and past their best this season.
But the 19-year-old Elliott offers hope for the future, a point he underlined by running unchecked from the halfway line before blasting a superb strike over Jose Sa from 25 yards.
Sa was caught too far off his line but that should not detract from the quality of Elliott’s first goal since October.
Snapping into tackles and winning second balls, Liverpool were showing more hunger and tenacity than in recent weeks.
Gakpo was still searching for his first Liverpool goal in his third appearance since signing from PSV Eindhoven.
The Netherlands forward nearly broke his duck with a dipping volley that flashed just over.
Gakpo was replaced by Salah for the last 25 minutes, but it was Wolves who finished strongly with Ruben Neves’ free-kick narrowly clearing the crossbar.
Wolves’ best chance to draw level came when Jimenez couldn’t head home on the goalline from Traore’s cross as Joe Gomez got the crucial block.
Elsewhere, Championship side Birmingham survived a scare in their 2-1 win at third-tier Forest Green.
In a delayed third-round clash after the original tie was postponed due to a waterlogged pitch, Ben Stevenson’s brilliant long-range strike put Forest Green ahead after eight minutes.
But Lukas Jutkiewicz grabbed Birmingham’s equaliser in the 50th minute and Kevin Long killed off League One’s bottom club 15 minutes later.
Bristol City won 2-1 at Swansea, while Luton beat Wigan 2-1 and West Brom thrashed Chesterfield 4-0.
Read all the Latest Sports News here(This story has not been edited by News18 staff and is published from a syndicated news agency feed - AFP)
|
english
|
<gh_stars>0
/**
* Copyright 2011-2019 Asakusa Framework Team.
*
* 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.
*/
package com.asakusafw.lang.compiler.tester.executor;
import java.io.IOException;
import java.util.Collections;
import java.util.LinkedHashMap;
import java.util.Map;
import com.asakusafw.lang.compiler.api.reference.TaskReference;
import com.asakusafw.lang.compiler.model.info.BatchInfo;
import com.asakusafw.lang.compiler.model.info.JobflowInfo;
import com.asakusafw.lang.compiler.tester.TesterContext;
/**
* Executes a {@link TaskReference}.
* @see TaskExecutors
*/
public interface TaskExecutor {
/**
* Returns whether this executor supports executing the target task.
* @param context the current context
* @param task the target task
* @return {@code true} if this supports the target task, otherwise {@code false}
*/
boolean isSupported(Context context, TaskReference task);
/**
* Executes a task.
* @param context the current context
* @param task the target task
* @throws InterruptedException if interrupted while executing the task
* @throws IOException if task execution was failed
*/
void execute(Context context, TaskReference task) throws InterruptedException, IOException;
/**
* Represents a context of {@link TaskExecutor}.
*/
final class Context {
private final TesterContext testerContext;
private final BatchInfo batch;
private final JobflowInfo jobflow;
private final String executionId;
private final Map<String, String> batchArguments;
/**
* Creates a new instance.
* @param testerContext the parent tester context
* @param batch the container batch information
* @param jobflow the container jobflow information
* @param executionId the current execution ID
* @param batchArguments the batch arguments
*/
public Context(
TesterContext testerContext,
BatchInfo batch, JobflowInfo jobflow,
String executionId,
Map<String, String> batchArguments) {
this.testerContext = testerContext;
this.batch = batch;
this.jobflow = jobflow;
this.executionId = executionId;
this.batchArguments = Collections.unmodifiableMap(new LinkedHashMap<>(batchArguments));
}
/**
* Returns the current tester context.
* @return the current tester context
*/
public TesterContext getTesterContext() {
return testerContext;
}
/**
* Returns the container batch information.
* @return the container batch information
*/
public BatchInfo getBatch() {
return batch;
}
/**
* Returns the container jobflow information.
* @return the container jobflow information
*/
public JobflowInfo getJobflow() {
return jobflow;
}
/**
* Returns the current execution ID.
* @return the current execution ID
*/
public String getExecutionId() {
return executionId;
}
/**
* Returns the batch arguments.
* @return the batch arguments
*/
public Map<String, String> getBatchArguments() {
return batchArguments;
}
}
}
|
java
|
NASA’s Hubble telescope has given in an insight into the aftermath of NASA’s DART mission in which a spacecraft impacted Dimorphos asteroid on September 26, 2022. The mission changed the trajectory of the asteroid’s orbit around the largest asteroid Didymos.
What have astronomers spotted?
Astronomers have seen a swarm of boulders, 37 in number, which were ejected from Dimorphos after NASA slammed its spacecraft into it at a speed of nearly 14,000 miles per hour. The 37 boulders’ sizes range from three feet to 22 feet across, as shown by Hubble photometry. They are moving away from the asteroid at over half-mile per hour. This roughly compares to the walking speed of a giant tortoise, NASA said. The total mass of the boulders is about 0.1% of the mass of Dimorphos. “This is a spectacular observation- much better than I expected. We see a cloud of boulders carrying mass and energy away from the impact target. The numbers, sizes, and shapes of the boulders are consistent with them having been knocked off the surface of Dimorphos by the impact,” University of California at Los Angeles’ David Jewitt said.
NASA says the boulders were most likely already scattered on the surface of the asteroid and are not shattered pieces of it. Jewitt estimates that the impact shook off 2% of the boulders from the asteroid’s surface. He adds that the observations of the boulders give an idea of the size of the crater formed due to DART’s impact. “The boulders could have been excavated from a circle of about 160 feet across (the width of a football field) on the surface of Dimorphos,” he said.
The space agency says it is unclear how the boulders got lifted off the asteroid’s surface. It says they could have been a part of an ejecta plume which was photographed by Hubble and other observatories or a seismic wave caused by the impact may have coursed through the asteroid, shaking lose the surface rubble.
“If we follow the boulders in future Hubble observations, then we may have enough data to pin down the boulders’ precise trajectories. And then we’ll see in which directions they were launched from the surface,” Jewitt said.
|
english
|
{"replay":{"game":{"category":"Ladder","map":"Delta Quadrant","speed":"Faster","time":"2011-07-05 18:01:08 -0400","type":"1v1","winner":{"actual_race":"Zerg","chosen_race":"Zerg","handicap":100,"id":2569192,"name":"redgar","won":true,"color":{"alpha":255,"red":0,"green":66,"blue":255}}},"players":[{"player":{"actual_race":"Terran","chosen_race":"Terran","handicap":100,"id":1918894,"name":"guitsaru","won":false,"color":{"alpha":255,"red":180,"green":20,"blue":30}}},{"player":{"actual_race":"Zerg","chosen_race":"Zerg","handicap":100,"id":2569192,"name":"redgar","won":true,"color":{"alpha":255,"red":0,"green":66,"blue":255}}}]}}
|
json
|
<gh_stars>1-10
use serde::{Serialize, Deserialize};
use std::collections::HashMap;
#[derive(Serialize, Deserialize, Debug, Clone)]
pub struct NacosHost {
#[serde(rename = "instanceId")]
pub instance_id: String,
pub ip: String,
pub port: i32,
pub weight: f64,
pub healthy: bool,
pub enabled: Option<bool>,
pub ephemeral: Option<bool>,
#[serde(rename = "clusterName")]
pub cluster_name: String,
pub service: String,
pub metadata: HashMap<String, String>,
#[serde(rename = "instanceHeartBeatInterval")]
pub instance_heart_beat_interval: Option<i32>,
#[serde(rename = "instanceHeartBeatTimeOut")]
pub instance_heart_beat_time_out: Option<i32>,
pub ip_delete_timeout: Option<i32>,
#[serde(rename = "instanceIdGenerator")]
pub instance_id_generator: Option<String>,
}
#[derive(Serialize, Deserialize, Debug)]
pub struct NacosServerView {
pub name: Option<String>,
#[serde(rename = "groupName")]
pub group_name: Option<String>,
pub clusters: Option<String>,
#[serde(rename = "cacheMillis")]
pub cache_millis: Option<i32>,
pub hosts: Option<Vec<NacosHost>>,
#[serde(rename = "lastRefTime")]
pub last_ref_time: Option<i64>,
pub checksum: Option<String>,
#[serde(rename = "allIps")]
pub all_ips: Option<bool>,
#[serde(rename = "reachProtectionThreshold")]
pub reach_protection_threshold: Option<bool>,
pub valid: Option<bool>,
}
#[derive(Serialize, Deserialize, Debug)]
pub struct NacosBeat {
#[serde(rename = "clientBeatInterval")]
pub client_beat_interval: u64,
pub code: i32,
#[serde(rename = "lightBeatEnabled")]
pub light_beat_enabled: bool,
}
#[derive(Serialize, Deserialize, Debug)]
pub struct NacosServiceInfo {
#[serde(rename = "namespaceId")]
pub namespace_id: String,
#[serde(rename = "groupName")]
pub group_name: String,
pub name: String,
#[serde(rename = "protectThreshold")]
pub protect_threshold: f64,
pub metadata: HashMap<String, String>,
pub selector: HashMap<String, String>,
pub clusters: Vec<NacosClusterInfo>,
}
#[derive(Serialize, Deserialize, Debug)]
pub struct NacosClusterInfo {
#[serde(rename = "healthChecker")]
pub health_checker: HashMap<String, String>,
pub metadata: HashMap<String, String>,
pub name: String,
}
#[derive(Serialize, Deserialize, Debug)]
pub struct NacosServiceList {
pub doms: Vec<String>,
pub count: isize,
}
#[derive(Serialize, Deserialize, Debug)]
pub struct NacosMetrics {
#[serde(rename = "serviceCount")]
pub service_count: Option<isize>,
pub load: Option<f64>,
pub mem: Option<f64>,
#[serde(rename = "responsibleServiceCount")]
pub responsible_service_count: Option<isize>,
#[serde(rename = "instanceCount")]
pub instance_count: Option<isize>,
pub cpu: Option<f64>,
pub status: Option<String>,
#[serde(rename = "responsibleInstanceCount")]
pub responsible_instance_count: Option<isize>,
}
#[derive(Serialize, Deserialize, Debug)]
pub struct NacosServerSimpleView {
pub servers: Vec<NacosServerSimple>,
}
#[derive(Serialize, Deserialize, Debug)]
pub struct NacosServerSimple {
pub ip: String,
pub port: isize,
pub state: String,
#[serde(rename = "extendInfo")]
pub extend_info: NacosExtendInfo,
pub address: String,
#[serde(rename = "failAccessCnt")]
pub fail_access_cnt: isize,
pub abilities: HashMap<String, HashMap<String, bool>>,
}
#[derive(Serialize, Deserialize, Debug)]
pub struct NacosExtendInfo {
#[serde(rename = "lastRefreshTime")]
pub last_refresh_time: isize,
#[serde(rename = "raftMetaData")]
pub raft_meta_data: HashMap<String, HashMap<String, NacosMetaData>>,
#[serde(rename = "raftPort")]
pub raft_port: String,
pub version: String,
}
#[derive(Serialize, Deserialize, Debug)]
pub struct NacosMetaData {
pub leader: String,
#[serde(rename = "raftGroupMember")]
pub raft_group_member: Vec<String>,
pub term: isize,
}
|
rust
|
<reponame>5SMNOONMS5/EgretProjects
// TypeScript file
namespace core.view {
/**
* 讀取中的畫面
*/
export class ProgressUI extends eui.Component {
// Wether the skin is complete load.
private _isCompleteLoadSkin: boolean = false;
public constructor() {
super();
this.addEventListener(eui.UIEvent.COMPLETE, this.omComplete, this);
this.skinName = "skins.ProgressUISkin";
}
private omComplete(): void {
this._isCompleteLoadSkin = true;
this.removeEventListener(eui.UIEvent.COMPLETE, this.omComplete, this);
}
}
}
|
typescript
|
577 Papers Laid
PHALGUNA 23, 1911 (SAKA)
delay in laying the papers mentioned at (3) above. [Placed in Library. See No. LT- 287/90]
(5) (i) A copy of the Annual Report (Hindi and English versions) of the Apparel Export Promotion Council, New Delhi, for the year 1988-89 along with Audited Accounts.
(ii) A copy of the Review (Hindi and English versions) by the Government on the working of the Apparel Export Promotion Council, New Delhi, for the year 1988-89.
(6) A statement (Hindi and English versions) showing reasons for delay in laying the papers mentioned at (5) above [Placed in Library. See No. LT-288/90]
(7) (i) A copy of the Annual Report (Hindi and English versions) of the Wool Research Association, Thane, for the year 1988-89 along with Audited Accounts.
(ii) A copy of the Review (Hindi and English versions) by the Government on the Working of the Wool Research Association, Thane, for the year 1988-89. [Placed in Library. See No. LT-289/90]
Inter-State Migrant Workmen (Regulation of Employment and Conditions of Service) Central (Amendment Rules, 1989; Review of the working of and Annual Report and Audited Accounts of Artificial Limbs Manufacturing Corporation of India, Kanpur; Annual Accounts and Annual Report of Employees Provident Fund Organisation, New Delhi for 198889 etc., etc.
THE MINISTER OF LABOUR AND WELFARE (SHRI RAM VILAS PASWAN): { beg to lay on the Table:(1)
Papers Laid 578
A copy of the Inter-State Migrant Workmen (Regulation of Employees and Conditions of Service) Central (Amendment) Rules, 1989 (Hindi and English versions) published in Notification No. G.S.R. 514 in Gazette of India dated the 22nd July, 1989 under sub-section (3) of section 35 of the Inter-State Migrant Workmen (Regulation of Employment and Conditions of Service) Act, 1979; [Placed in Library. See No. LT- 290/90].
(2) A copy each of the following papers (Hindi and English versions) under sub-section (1) of section 619 A of the Companies Act, 1956:(i) Review by the Government on the working of the Artificial Limbs Manufacturing Corporation of India, Kanpur, for the year 1988-89.
(ii) Annual Report of the Artificial Limbs Manufacturing Corporation of India, Kanpur, for the year 1988-89 along with Audited Accounts and comments of the Controller and Auditor General thereon. [Placed in Library. See No. LT- 291/90]
(3) A copy of the Annual Accounts (Hindi and English versions) of the Employees' Provident Fund Organisation, New Delhi, for the year 1988-89 together with Audit Report thereon.
(4) A copy of the Annual Report (Hindi and English versions) of the Employees' Provident Fund Organisation for the year 198889. [Placed in Library. See No. LT-292/90]
(5) (i) A copy of the Annual Report (Hindi and English versions)
of the Rehabilitation Council, New Delhi, for the year
579 Papers Laid
[Sh. Ram Vilas Paswan]
1988-89 along with Audited Accounts.
(ii) A copy of the Review (Hindi and English versions) by the Government on the working of the Rehabilitation Council, New Delhi for the year 1988-89.
(6) A statement (Hindi and English versions) showing reasons for delay in laying the papers mentioned at (5) above. [Placed in Library. See No. LT- 293/90]
Annual Report and Review on the working of New Delhi Tuberculosis Centre, New Delhi for the year, 1988
THE MINISTER OF HEALTH AND FAMILY WELFARE (SHRI NILAMANI ROUTRAY): I beg to lay on the Table:(i) A copy of the Annual Report (Hindi and English versions) of the New Delhi Tuberculosis Centre, New Delhi, for the year 1988 along with Audited Accounts.
(ii) A copy of the Review (Hindi and English versions) by the Government on the working of the New Delhi Tuberculosis Centre, New Delhi for the year 1988. [Placed in Library. See No. LT-294/90]
Sugar (price Determination for 1989-90 Production) Amendment Order 1990; Notifications under Essential Communalities Act, 1955 and Bureau of Indian Standards Act, 1986 etc.
THE MINISTER OF FOOD AND CIVIL SUPPLIES (SHRI NATHU RAM MIRDHA): I beg to lay on the Table:(1) Acopy of the Sugar (Price Determination for 1989-90 Production)
Papers Laid 580
Amendment Order, 1990 (Hindi and English versions) Published in Notification No. G.S.R. 36 (E) in Gazette of India dated the 27th January, 1990 under subsection (6) of section 3 of the Essential Commodities Act, 1955 [Placed in Library. See No. LT- 295/90]
(2) A copy each of the following Notifications (Hindi and English versions) under section 39 of the Bureau of Indian Standards Act, 1986:(i) The Bureau of Indian Standards (Amendment) Rules, 1990 published in Notification No.G.S.R. 48 (E) in Gazette of India dated the 2nd February, 1990.
(ii) The Bureau of Indian Standards (Powers and Duties of Director-General) Amendment Regulations 1990 published in Notification No. G.S.R. 69 (E) in Gazette of India dated the 9th February, 1990.
(3) A copy of Notification No. S.O. 107 (E) (Hindi and English versions) published in Gazette of India dated the 29th January, 1990 making certain amendments in Notification No. S.O. 376 (E) dated the 26th May, 1989 issued under sub-section (1) of section 4 of the Bureau of Indian Standards Act, 1986. [Placed in Library. See No. LT-296/90]
(4) (i) A copy of the Annual Report
(Hindi and English versions) of the National Cooperative Consumers' Federation of India Limited, New Delhi, for the year 1988-89 along with Audited Accounts.
(ii) A copy of the Review (Hindi and English versions) by the Government on the working of
581 Papers Laid
PHALGUNA 23, 1911 (SAKA) Stat. re. Accident to Airbus A-320 of Indian
Airlines at Bangalore
the National Cooperative Consumers' Federation of India Limited, for the year 198889.
(5) A statement (Hindi and English versions) showing reasons for delay in laying the papers mentioned at (4) above. [Placed in Library. See No. LT- 297/90]
(6) (i) A copy of the Annual Report (Hindi and English versions) of the Central warehousing Corporation, for the year 198889 along with Audited Accounts under sub-section (11) of section 31 of the Warehousing Corporation Act, 1962.
(ii) A copy of the Review (Hindi and English versions) by the Government on the working of the Central Warehousing Corporation for the year 1988-89.
(7) A statement (Hindi and English versions) showing reasons for delay in laying the papers mentioned at (6) above. [Placed in Library. See No. LT-298/90]
Delhi Urban Art Commission (Terms and Conditions of Service) Amendment Rules 1989; Annual Report Annual Accounts of Delhi Urban Art Commission, New Delhi for 1988-89 etc.
THE MINISTER OF URBAN DEVELOPMENT (SHRI MURASOLI MARAN): I beg to lay on the Table:(1) A copy of the Delhi Urban Art Commission (Terms and Conditions of Service) Amendment Rules, 1989 (Hindi and English versions) published in Notification No. G.S.R. 265 in Gazette of India dated the 8th April, 1989 under sub-section (3) of section 26 of the Delhi Urban Art Commission Act, 1973. [Placed in Library. See No. LT- 299/90]
(2) (i) A copy of the Annual Report (Hindi and English versions) of the Delhi Urban Art Commission, New Delhifor the year 1988-89 under section 19 of the Delhi Urban Art Commission, Act, 1973.
(ii) A copy of the Annual Accounts (Hindi and English versions) of the Delhi Urban Art commission, New Delhi for the year, 1988-89 together with Audit Report thereon under subsection (4) of section 20 of the Delhi Urban Art Commission Act, 1973. [Placed in Library. See No. LT-300/90]
(3) A statement (Hindi and English
versions) (i) correcting the reply given on 3rd May, 1989 to Unstarred Question No. 7832 by Shri C. Janga Reddy, M.P., regarding losses in I.S.B.T and (ii) giving reasons for delay in correcting the reply. [Placed in Library. See No. LT- 301/90].
STATEMENT RE: ACCIDENT TO THE AIRBUS A-320 AIRCRAFT OF INDIAN AIRLINES AT BANGALORE ON 14TH
FEBRUARY, 1990
THE MINISTER OF ENERGY AND MINISTER OF CIVIL AVIATION (SHRI ARIF MOHAMMAD KHAN): Sir, it is with deep anguish that I recall the accident t the Airbus A-320 aircraft VT-EPN of the Indian Airlines on the 14th February, 1990. The aircraft was on a flight from Bombay to Bangalore and was carrying 135 passengers, 4 infants and 7 crew members. The aircraft crashed outside the Bangalore airport about 800 metres short of the runway while on its final ap583 Stat. re. Accident to Airbus A-320 of
[Sh. Arif Mohammad Khan]
proach to land. During the crash, the aircraft caught fire and we burnt except for the tail portion and the wings. The weather at the time of the accident was fair with a visibility of 10 kms.
2. Unfortunately, 92 persons have lost their lives in this accident including the commander and the co-pilot, two cabin attendants, four infants, and the two passengers who succumbed to their injuries later. Fifty four persons have survived in the accident, including three cabin attendants.
3. The survivors of the accident were admitted to the Air Force Command hospital and the Hindustan Aeronautics Limited hospital at Bangalore and were given prompt and efficient medical service. Indian Airlines also made necessary arrangements for the transportation of the relatives of the victims to Bangalore and subsequently for the transportation of the bodies to various places at the request of the next of kin. Of the 90 persons who died on the day of the accident, the relatives could identify 66 bodies and the remaining 24 bodies were mass cremated on the 17th February observing the last rites of various religions.
4. Immediately, on receipt of information about the crash, I rushed to Bangalore along with senior officials the Ministry of Civil Aviation, DGCA and Indian Airlines and visited the accident site and the hospitals where the injured were undergoing treatment. I also visited the mortuary and shared my grief with the relatives of the victims. I had also directed the hospital authorities and the Indian Airlines to provide every possible assistance to the injured and the relatives of the victims. Later, I also attended the mass cremation of the unidentified victims at Bangalore on the 17th February.
5. I should like to take this opportunity to place on record my deep appreciation of the cooperation and assistance extended by the Government of Karnataka as well as the Air Force Command Hospital and the HindusIndian Airlines 584 at Bangalore
tan Aeronautics Ltd., Hospital at Bangalore. I would also like to pay my tribute to the alertness, presence of mind and selfless action of the three surviving airhostesses viz Ms. Sujaya, Ms. Neela and Ms. Sadhana.
6. The ill-fated aircraft had arrived in India on 24th December, 89. It held a current certificate of airworthiness valid upto 21st December, 1990. The aircraft had done a total flying of 366 hours and 300 landings till the date of the accident. On the accident flight, the aircraft was under the command of Capt. S.S. Gopujkar who had a total flying experience of 10340 hours including 60 hours on the A-320 aircraft. Capt. Gopujkar was a Check Pilot on A-320 aircraft approved by the DGCA. The Co-pilot of the aircraft was Capt. C.A. Fernandez who had a total flying experience of 9307 hurs including 68 hours as Co-pilot on the A-320 aircraft. Both Capt. Gopujkhar and Capt. Fernandez had undergone the prescribed training with Aeroformation, Toulsouse, France and had received their completion certificaties.
7. Immediately after the accident, Shri Satendra Singh, Director of Air Safety,, DGCA was appointed on the 14th February, as inspector of Accidents under Rule 71 of the Aircraft Rules for commencement of investigation of the accident. Both the Digital Flight Data Recorder (DFDR) and the Cockpit Voice Recorder (CVR) of the accident aircraft were retrieved on the same day. Considering the seriousness of the accident. I announced on the same day the appointment of a Court of Inquiry by a sitting Judge of High Court to investigate the cause of the accident. The formal notification under Rule 75 of the Aircraft Rules was issued on 17th February, 1990 and Justice K. Shivshankar Bhatt, a sitting Judge of the Karnataka High Court was appointed to head the Court of Inquiry. Capt B.S. Gopal Director Flight Safety, Air India, Capt. C.S.R.Rao, Director Training, Air India (Retd). and Shri S.G. Goswami, Director, Airworthiness DGCA (Retd) were appointed as Assessors to the Court of Inquiry. The Court of Inquiry has been requested to submit its report by 31st May, 1990. The Court has already held its first
585 Stat. re. Accident to Airbus A-320 of Indian Airlines at Bangalore
PHALGUNA 23, 1911 (SAKA) Stat. re. Tele. Tariffs 586
sitting on 27th February, 1990 and has called for affidavits from the public and interested parties by 31st March, 1990.
8. The CVR of the ill-fated air craft was decoded by the officers of the DGCA in Delhi. As the facility for decoding the DFDR is not yet available in India, it was take to the Canadian Aviation Safety Board, Ottawa, by a team consisting of Shri H.S. Khola Deputy Director General of Civil Aviation, Capt. Irigaonkar, Indian Airlines and Sqn. Ldr. Yagnaswami of the Indian Air Force. Under their supervision, the DFDR was decoded at Ottawa in the week of 19th February, 1990 and brought back to Delhi. The CVR and the DFDR data have been provided to the Court of Inquiry.
9. Ishould like to say here that the decoding of the CVR and the DFDR as well as the appointment of a court of Inquiry were done with the utmost speed after the accident.
10. Considering the deep apprehension in the mind of the travelling public, Government has appointed a high powered Technical Committee under the Chairmanship of Air Marshal S.S.Ramdas to evaluate the state of preparedness of the Indian Airlines for safe operation of the A-320 aircraft. Pending the submission of an interim report by the Committee, the operatins of the A-320 aircraft were temporatily suspended with effect from 19th February, 1990.
11. The Ramdas Committee has submitted its interim report on 6th March, 1990. The report is under the consideration of the Government.
12. I would like to apprise the House about the acquisition of A-320 aircraft by Indian Airlines. The airlines had signed an agreeemnt with Airbus Industries on 15th March, 1986 for the purchase of nineteen A320 aircraft with option to buy twelve more aircraft. According to the agreeement, the supply of the ninteen aircraft was to start in April, 1989 and end in March, 1990. Between June, 1989 and till date, Indian Airlines has received fifteen A-320 aircraft,
including the one which met with the accident at Bangalore.
13. The agreement for the purchase of the additional twelve aircraft under the option was signed by the Indian Arilines on 5th June, 1989 According to this agreeemt, six of these aircraft are to be delivered during the period December, 1990 to March, 1991 and the remaining six are to be delivered during the period December, 1991-January, 1992. The original project cost of acquisition of neneteen Airbus A-320 aircraft was Rs. 1238 crores involving a foreign exchange component of US $952 million. The project cost of the additional twelve A-320 aircraft was Rs. 959 crores involving a foreign exchange component of US $ 633 million.
14. I would like to frankly say that the Indian Airlines is passing through a very difficult period at the moment. The need of the hour is to provide the airlines with sound and efficient management and the restore its morale and confidence. I seek the cooperation and understanding of the House in this task. Let me canclude my statement by assuring the House that there will be no compromise whatesoever on the safe operation of our airlines and Government would spare no efforts in this direction.
STATEMENT RE: TELECOMMUNICATION TARIFFS
THE MINISTER OF STEELAND MINES AND MINISTER OF LAW AND JUSTICE (SHRI DINESH GOSWAMI): (a) On behalf of my colleague Shri K.P. Unnikrishnan, Minister for Surface Transport and Communications, I rise to make the following statement:2. The Honourable Members are aware that Telecom serivces form a basic infrastructure and the Government is committed
|
english
|
<gh_stars>1-10
package org.dnwiebe.orienteer.converters;
import org.junit.Before;
import org.junit.Test;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.fail;
/**
* Created by dnwiebe on 2/17/17.
*/
public class BooleanConverterTest {
private Converter<Boolean> subject;
@Before
public void setup () {
subject = new BooleanConverter ();
}
@Test
public void convertsNullValue () throws Exception {
Boolean result = subject.convert (null);
assertEquals (null, result);
}
@Test
public void convertsStringBeginningWithT () throws Exception {
Boolean result = subject.convert ("T string");
assertEquals (Boolean.TRUE, result);
}
@Test
public void convertsStringBeginningWithY () throws Exception {
Boolean result = subject.convert ("Y string");
assertEquals (Boolean.TRUE, result);
}
@Test
public void convertsStringBeginningWithNonZeroDigit () throws Exception {
String[] inputs = {"12", "22", "32", "42", "52", "62", "72", "82", "92"};
for (String input : inputs) {
Boolean result = subject.convert (input);
assertEquals (input, Boolean.TRUE, result);
}
}
@Test
public void convertsStringBeginningWithF () throws Exception {
Boolean result = subject.convert ("F string");
assertEquals (Boolean.FALSE, result);
}
@Test
public void convertsStringBeginningWithN () throws Exception {
Boolean result = subject.convert ("N string");
assertEquals (Boolean.FALSE, result);
}
@Test
public void convertsStringBeginningWithZeroDigit () throws Exception {
Boolean result = subject.convert ("0 string");
assertEquals (Boolean.FALSE, result);
}
@Test
public void complainsAsExpectedForBadlyFormattedValue () throws Exception {
try {
subject.convert ("Booga");
fail ();
}
catch (IllegalArgumentException e) {
assertEquals ("Can't convert 'Booga' to Boolean value", e.getMessage ());
}
}
@Test
public void complainsAsExpectedForEmptyValue () throws Exception {
try {
subject.convert ("");
fail ();
}
catch (IllegalArgumentException e) {
assertEquals ("Can't convert '' to Boolean value", e.getMessage ());
}
}
}
|
java
|
THE Caribbeans are humming again. After a hard-earned Test series win over Zimbabwe, Brian Lara's men put in that extra effort when the side needed it the most to clinch the ODI series 3-2.
THE Caribbeans are humming again. After a hard-earned Test series win over Zimbabwe, Brian Lara's men put in that extra effort when the side needed it the most to clinch the ODI series 3-2.
Zimbabwe might not be the strongest of outfits, more so in recent times without the Flower brothers. However, the West Indian wins came away from home, which must have been heartening to the side.
The islanders have been poor tourists over the past few years, displaying neither the application nor the attitude to succeed away from home. The series in Zimbabwe could mark a new beginning for the West Indians.
They did have their moments of uncertainty in the ODI series, and Zimbabwe did take a threatening 2-1 lead, with two matches remaining. However, the Caribbeans managed to swing things around, thanks to influential performances from Chris Gayle and Fidel Edwards.
As skipper Lara, who laid much stress on the famous Caribbean passion and pride, wrote in his column published in the Trinidad Guardian newspaper, "I had indeed said after the end of the Australian home series that we would not be losing another series in 2003. I meant it.
"In the end, I'm proud of the character and the fight that the team showed. And if we think about it, character and fighting spirit are indeed excellent qualities for any team, even more so for a young team to possess."
Gayle, donning the hat of a match-winner, swept the Zimbabweans away in the decider at Harare. With the series balanced at 2-2, the Caribbeans did need someone to pull out something special.
First, the tall, lithe Jamaican dented the Zimbabwe innings with his off-spin, claiming four for 24 off 10 overs; key batsmen Mark Vermeulen and Craig Wishart were among his victims.
Then, with Zimbabwe managing just 196, Gayle destroyed the home attack with a blistering 112 not out reaching the three-figure mark in just 69 deliveries; his first fifty consumed only 39 balls.
The Windies romped home by eight wickets, 24.2 overs still remaining in the contest, and a series was won. While Lara marshalled his men well at crunch times, Gayle stood tall with 325 runs at a stunning 128.33 and seven wickets (eco. 2.75), in the series.
Not surprisingly, Gayle was adjudged the Man of the Series. While his talent has never been in question, this West Indian has, on occasions, left his admirers disappointed, perishing to some ordinary strokes.
However, when in mood, he hits through the line with effortless ease, against both the pacemen and the spinners. The southpaw has the habit of clearing the fence with regularity and is easily one of the most powerful strikers of the ball in contemporary cricket.
Gayle had been in his element in the first match at Bulawayo too, striking 19 fours and a six in his 160-ball unbeaten 153. There appears to be a lot more consistency in Gayle's performances, a good sign for the West Indies.
His off-spin has been more than useful, and Gayle has often been called upon to operate in the end overs. He does possess a handy yorker, not quite the delivery you would expect from an off-spinner, and can surprise the batsman with those quicker deliveries.
Not a big spinner of the ball, he brings about changes in the pace and trajectory of his deliveries to keep the batsmen in check. Gayle certainly had the Zimbabweans in more than a spot of bother in the final game.
If Gayle made the difference in the decisive clash, then young paceman Fidel Edwards landed a huge blow to Zimbabwe's series winning aspirations in the fourth match with a sensational display of bowling in his first ODI.
Edwards had made a distinct impression in the Test series against the Sri Lankans at home last season with his pace and fire, but this promising bowler was considered more suitable to Tests than the ODIs.
However, when the Caribbeans found themselves in a tight corner, the West Indian think-tank brought in Edwards as the fling of the dice, and this exciting paceman with a sling action, struck with his first delivery in the ODIs, uprooting Barney Rosers' middle stump.
In his second over, he sent back Vusi Sibanda and Craig Wishart off successive deliveries and Edwards cut through the Zimbabwe line-up to finish with six for 22 and the host, chasing 223 in 32 overs (a revised target), managed just 150 for seven.
This was a critical point of the series as a Zimbabwean victory would have given them the trophy.
Earlier, put in, the West Indians rattled up 256 for three in 45 overs, before the innings was cut short by rain. The highlight of the West Indian effort was a strokeful 127 by Gayle's opening partner Wavell Hinds, who struck ten fours and four sixes in 141 balls.
Hinds, whose ways at the crease have that distinct Caribbean dash and flavour, has managed to resurrect his career, after a rather uncertain phase where runs proved elusive, and there appeared to be a crisis of form and confidence.
The West Indian batting was certainly seen in all its glory in the first match at Bulawayo, where the side ran up a massive 347 for six in 50 overs, with Gayle making 153 and Lara, a breathtaking 113, the gifted southpaw facing only 82 balls, before going past the hundred mark. It was an inspirational effort from the captain.
However, the inconsistency in the West Indian batting came to the fore in the next ODI at the same venue, with the side being shot out for 125, Marlon Samuels' unbeaten 36 being the highest individual score in a sorry scorecard. With No. 3 Mark Vermeulen remaining unbeaten on 66, the Zimbabweans did not encounter too many problems in surpassing this meagre total.
The West Indian batting let the side down again in the third ODI in Harare, with the visiting side, in pursuit of 230, bowled out for 208, Gayle's 61 saving the side from deep embarrassment. This was a game where the pace combination of skipper Heath Streak and Andy Blignaut caused most of the damage, with the latter's four for 43 ending up as the most productive display by a Zimbabwean in the series.
It was a rather spineless West Indian batting performance and Lara did not have much to say after the game — "I think our approach needs to be looked at. I just thought, our attitude going out today may have been a little too relaxed."
The Zimbabweans, going through a transition phase caused due to a variety of reasons, deserve credit for winning the two games. The side still has plenty of batting worries and the fact that Streak, a bowling all-rounder, topped the Zimbabwean aggregate for the series with 142 runs in five games tells its own story.
Vermeulen notched up two half centuries, Taibu produced a spirited 66 in the fourth ODI, and opener Vusi Sibanda and Craig Wishart in the middle-order made 50s in the first match. However, Zimbabwe's batting worked only in fits and starts.
In the Zimbabwe bowling, Streak and Blignaut, the quickest of the pack, impressed in parts, while Sean Ervine struck some useful blows with his well directed medium-pacers. But the best bowler in the home team's ranks was left-arm spinner Ray Price, whose figures of 10-2-16-2 in the second ODI were outstanding indeed.
Zimbabwe did have its moments, but in the end, it was the West Indians who were celebrating. Said Lara, "we were determined that the number eighth ranked team in the world would not beat us at either at the Test or the one-day levels...I hope that is more an indication to our fans that we feel the passion just like you do."
He pointed out that Zimbabwe, that had returned from a demanding campaign in Australia, did not prove an easy team to overcome. "The wake up call came early for us with the first Test ending in a nail-biting finish with us barely holding on to the West Indies emblem on our gear."
The Windies captain spoke about the need to protect his young fast bowlers such as Edwards. "The youthfulness of our bowling attack was an issue in both series and the task of protecting whilst developing our very young bowlers remains a serious challenge."
The Caribbeans, after a testing but eventually satisfying campaign in Zimbabwe, will take on the powerful Proteas in South Africa, with the first Test beginning on December 13. Lara is well aware of the streak of inconsistency in the side. "The major challenge is the tendency to play good one day and fall back in the next. As we move into the critical series against the number two ranked team in the world, understanding and correcting this is our biggest task."
For the moment though, the West Indian emblem remains intact.
|
english
|
Malvinder Singh Mali quit as Punjab Congress chief Navjot Singh Sidhu's adviser today, day after the party threatened to dismiss him over his controversial remarks if Mr Sidhu failed to remove him.
In Facebook posts last week, Mr Mali suggested that both India and Pakistan were illegal occupants in Kashmir. In another post, he wrote on the Taliban: "Now it is their responsibility to protect Sikhs and Hindus. They will rule to improve the condition of the country, not like before. "
Mr Mali blamed anti-Sikh forces for targeting him and derailing the Punjab model, citing them as reasons for his quitting as adviser to Mr Sidhu.
"Punjab, Punjabi Community cooperation, and anti-Sikh forces, that do not tolerate the emerging Punjab model. . . have a nefarious design to derail the dialogue that has started taking shape and to push me to jump into the struggle with tied hands, which is not acceptable to me and rejecting the same I humbly submit that I withdraw my consent given for tendering suggestions to Navjot Singh Sidhu," Mr Mali said in a statement on Facebook.
Putting a lid on the controversy, Congress Punjab in-charge Harish Rawat said the remarks have been disowned by the adviser and the matter ends there.
"I will meet Rahul ji tomorrow. . . He (Navjot Singh Sidhu's adviser) has disowned his remark on Pakistan and Kashmir, so the matter ends there," said Harish Rawat.
Calling the established politics of Punjab "by and large devoid of intellect", Mr Mali said he will continue his relentless struggle against the politics "laden with narrow personal interests".
The former adviser said Chief Minister Amarinder Singh, party MP Manish Tiwari, SAD's Sukhbir Badal, AAP's Raghav Chadha were to be blamed if he faces any physical harm.
"The hateful campaign launched against my ideas by political leaders, and the same if results in physical harm to me, for the same Captain Amarinder Singh, Vijay Inder Singla, Manish Tewari, Sukhbir Badal, Bikram Majithia, BJP secretary Subhash Sharma, AAP leaders from Delhi Raghav Chadha and Jarnail Singh, shall be responsible," he continued.
On Sunday, Amarinder Singh mounted a strong public attack at Mr Sidhu's advisers over comments that he said were "potentially dangerous" to the peace and stability of Punjab and the country and "totally misplaced and antagonistic" to the stated position of India and the Congress on Pakistan and Kashmir. Expressing shock, he urged Mr Sidhu to rein in his advisers before they ended up doing more damage to India's interests.
Pyare Lal Garg, another adviser, had questioned Amarinder Singh's criticism of Pakistan.
The remarks threatened to derail the fragile peace brokered between the Chief Minister and Navjot Sidhu ahead of the state elections early next year.
Navjot Sidhu on August 11 had appointed Malvinder Singh Mali, a former government teacher and political analyst, and Pyare Lal Garg, a former registrar of Baba Farid University of Health and Sciences, as his advisers to seek their "wise counsel".
|
english
|
/*
* Copyright 2021 Actyx AG
*
* 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.
*/
use crate::loom::*;
use parking_lot::lock_api::RawMutex;
use std::{
cell::UnsafeCell,
fmt::{Formatter, Pointer, Result},
ops::Deref,
ptr::NonNull,
sync::{Arc, Weak},
};
/// sealed trait pattern for trait Interner
mod private {
pub trait Sealed {}
impl Sealed for () {}
impl<T: ?Sized + Eq + std::hash::Hash> Sealed for crate::hash::Hash<T> {}
impl<T: ?Sized + Ord> Sealed for crate::tree::Ord<T> {}
}
/// This is an internal trait that is not meant to be implemented outside this crate.
pub trait Interner: private::Sealed + Sized {
type T: ?Sized;
fn remove(&self, value: &Interned<Self>) -> (bool, Option<Interned<Self>>);
}
/// This is a bogus shim impl used only for being able to compute the size of a RefCounted structure.
impl Interner for () {
type T = ();
fn remove(&self, _value: &Interned<Self>) -> (bool, Option<Interned<Self>>) {
(false, None)
}
}
struct State<I> {
// inlining the raw mutex manually here to bring overhead down from 24 to 16 bytes
// on 64bit platforms (which unfortunately implies writing our own `struct Guard`)
mutex: parking_lot::RawMutex,
/// 4 billion refs ought to be enough for anybody, plus this allows the RawMutex
/// to live inside the same word on 64bit architectures.
refs: UnsafeCell<u32>,
cleanup: UnsafeCell<Option<Weak<I>>>,
}
impl<I: Interner> State<I> {
pub fn new() -> Self {
Self {
mutex: parking_lot::RawMutex::INIT,
refs: UnsafeCell::new(1),
cleanup: UnsafeCell::new(None),
}
}
pub fn lock(&self) -> Guard<I> {
self.mutex.lock();
Guard(self)
}
}
/// Safety: having the Guard is equivalent to owning the mutex lock, which holds a
/// reference to the wrapped data, so dereferencing those pointers is safe.
struct Guard<'a, I>(&'a State<I>);
impl<'a, I> Guard<'a, I> {
pub fn refs(&self) -> u32 {
unsafe { *self.0.refs.get() }
}
pub fn refs_mut(&mut self) -> &mut u32 {
unsafe { &mut *self.0.refs.get() }
}
pub fn cleanup(&mut self) -> &mut Option<Weak<I>> {
unsafe { &mut *self.0.cleanup.get() }
}
}
impl<'a, I> Drop for Guard<'a, I> {
fn drop(&mut self) {
unsafe { self.0.mutex.unlock() };
}
}
// repr(C) is needed so that we can determine the correct allocation layout without
// knowning the layout of `value`; this is needed to compute the combined layout from
// these two pieces
#[repr(C)]
struct RefCounted<I: Interner> {
state: State<I>,
value: I::T,
}
impl<I: Interner> RefCounted<I> {
fn from_box(value: Box<I::T>) -> NonNull<Self> {
// figure out the needed allocation size — this requires #[repr(C)]
let layout = Layout::new::<RefCounted<()>>()
.extend(Layout::for_value(value.as_ref()))
.unwrap() // fails only on address range overflow
.0
.pad_to_align();
unsafe {
// allocate using global allocator
let ptr = alloc(layout);
// get value pointer with the right metadata (e.g. string length)
// while making sure to NOT DROP THE BOX
let b = Box::leak(value) as *mut I::T;
// construct correct (fat) pointer from allocation result:
// - make a copy of the passed-in Box pointer
// - overwrite the first sizeof::<usize>() bytes with the new address
// this keeps the metadata (second machine word) intact
let ptr = {
let mut temp = b as *mut Self;
// unfortunately <*mut>::set_ptr_value is still experimental, but this is what it does:
std::ptr::write(&mut temp as *mut _ as *mut *mut u8, ptr);
temp
};
// write the fields
std::ptr::write(&mut (*ptr).state, State::new());
let num_bytes = std::mem::size_of_val(&*b);
if num_bytes > 0 {
std::ptr::copy_nonoverlapping(
// copy payload value byte-wise, because what else can we do?
b as *const u8,
&mut (*ptr).value as *mut _ as *mut u8,
num_bytes,
);
// free the memory of the ex-Box; global allocator does not allow zero-sized allocations
// so this must be guarded by num_bytes > 0
#[cfg(not(loom))]
dealloc(b as *mut u8, Layout::for_value(&*b));
#[cfg(loom)]
std::alloc::dealloc(b as *mut u8, Layout::for_value(&*b));
}
NonNull::new_unchecked(ptr)
}
}
fn from_sized(value: I::T) -> NonNull<Self>
where
I::T: Sized,
{
let b = Box::new(Self {
state: State::new(),
value,
});
NonNull::from(Box::leak(b))
}
}
pub struct Interned<I: Interner> {
inner: NonNull<RefCounted<I>>,
}
unsafe impl<I: Interner> Send for Interned<I> where I::T: Send + Sync + 'static {}
unsafe impl<I: Interner> Sync for Interned<I> where I::T: Send + Sync + 'static {}
impl<I: Interner> Interned<I> {
pub(crate) fn ref_count(&self) -> u32 {
self.lock().refs()
}
fn lock(&self) -> Guard<I> {
// this is safe since the existence of &self proves that the pointer is still valid
unsafe { self.inner.as_ref().state.lock() }
}
pub(crate) fn from_box(value: Box<I::T>) -> Self {
Self {
inner: RefCounted::from_box(value),
}
}
pub(crate) fn from_sized(value: I::T) -> Self
where
I::T: Sized,
{
Self {
inner: RefCounted::from_sized(value),
}
}
pub(crate) fn make_hot(&mut self, set: &Arc<I>) {
let mut state = self.lock();
*state.cleanup() = Some(Arc::downgrade(set));
}
}
// use the two upper bits as spin-wait conditions
const MAX_REFCOUNT: u32 = u32::MAX - 2;
impl<I: Interner> Clone for Interned<I> {
fn clone(&self) -> Self {
let refs = {
let mut state = self.lock();
*state.refs_mut() += 1;
state.refs()
};
if refs > MAX_REFCOUNT {
// the below misspelling is deliberate
panic!("either you are running on an 8086 or you are leaking Interned values at a phantastic rate");
}
let ret = Self { inner: self.inner };
#[cfg(feature = "println")]
println!("{:?} clone {:p}", current().id(), *self);
ret
}
}
impl<I: Interner> Drop for Interned<I> {
fn drop(&mut self) {
// printing `self` to mark this particular execution (points to the stack)
// printing `*self` to mark the interned value (as printed by `clone`)
#[cfg(feature = "println")]
println!("{:?} dropping {:p} {:p}", current().id(), self, *self);
// preconditions:
// - this Interned may or may not be referenced by an interner (since the interner can be dropped)
// - the `self` reference guarantees that the reference count is at least one
// - whatever happens, we must decrement the reference count by one
// - if the only remaining reference is the interner map, we need to try to remove it
// (this races against an `intern` call for the same value and against dropping the interner)
//
// IMPORTANT NOTE: each Interned starts out with two references! (by virtue of creation and first clone)
//
// Also, THE REMOVAL POINTER NEEDS TO BE USED EXACTLY ONCE!
// take the lock — we MUST NOT hold this lock while calling the cleanup function!
// (A-B vs B-A deadlock would occur otherwise, since interning first takes the interner lock, then this one)
let mut state = self.lock();
#[cfg(feature = "println")]
println!(
"{:?} read {} {:p} {:p}",
current().id(),
state.refs(),
self,
*self
);
// decrement the count
*state.refs_mut() -= 1;
// two cases require action:
// - count was two: perform the removal (unless already done)
// - count was one: deallocate
if state.refs() > 1 {
return;
}
if state.refs() == 1 {
// the other reference could be the map or external (if the map was dropped and we didn’t get here yet)
// so this races against:
// 1. map being dropped
// 2. same value being interned again
// 3. other external reference being dropped
// In the dropping cases, the other thread saw read == 1.
if let Some(cleanup) = state.cleanup().take() {
#[cfg(feature = "println")]
println!("{:?} removing {:p} {:p}", current().id(), self, *self);
// At this point, the other remaining reference can either be the interner or an
// external one (if the interner was already dropped).
if let Some(strong) = cleanup.upgrade() {
// Interner is still there, so the other reference is in there; we may race
// against interning of the same value, which may already have taken the interner
// lock, so we cannot just call the cleanup function.
drop(state);
loop {
// in here another thread may have found the interned reference and started cloning it,
// it might even have dropped it already (but without running cleanup, since we have that.
// see the other `else` further down)
let (removed, _value) = strong.remove(self);
if removed {
// nobody interfered and the value is now removed from the interner, we can safely drop it
// which will re-enter this drop() function and decrement refs to zero
break;
} else {
// someone interfered, so we need to take the lock again to put things in order
let mut state = self.lock();
// precondition: we hold the `cleanup` so there is still at least one reference in the
// interner — remember that we hold a strong reference to that one!
if state.refs() > 1 {
// someone else will drop the refs back down to 1 again later, so hand the cleanup
// function to them (this may happen far in the future!)
*state.cleanup() = Some(cleanup);
break;
} else {
// whoever interfered already dropped their reference again, so we need to retry;
// it is important that we drop the lock before retrying, which would happen
// automatically, but let’s write it down to make it dead obvious:
drop(state);
}
}
}
} else {
// Interner is gone or on its way out, which means that no concurrent interning
// is possible anymore; it also means that the other reference may well be from
// the interner, still (it may be dropping right now). Our job here is done.
}
#[cfg(feature = "println")]
println!("{:?} removed {:p}", current().id(), self);
} else {
// someone else is currently taking care of correctly dropping this value from the interner, see above
#[cfg(feature = "println")]
println!("{:?} cleanup gone {:p}", current().id(), self);
}
} else if state.refs() == 0 {
#[cfg(feature = "println")]
println!("{:?} drop {:p} {:p}", current().id(), self, *self);
// drop the lock before freeing the memory, otherwise it would use-after-free
drop(state);
// since we created the pointer with Box::leak(), we can recreate the box to drop it
unsafe { Box::from_raw(self.inner.as_ptr()) };
}
#[cfg(feature = "println")]
println!("{:?} dropend {:p}", current().id(), self);
}
}
impl<I: Interner> PartialEq for Interned<I> {
fn eq(&self, other: &Self) -> bool {
std::ptr::eq(self.inner.as_ptr(), other.inner.as_ptr())
}
}
impl<I: Interner> Deref for Interned<I> {
type Target = I::T;
fn deref(&self) -> &Self::Target {
// safety: the presence of &self guarantees that the value has not yet been dropped
&unsafe { self.inner.as_ref() }.value
}
}
impl<I: Interner> Pointer for Interned<I> {
fn fmt(&self, f: &mut Formatter<'_>) -> Result {
Pointer::fmt(&(&**self as *const I::T), f)
}
}
#[cfg(all(test, not(loom)))]
mod tests {
use super::*;
use crate::OrdInterner;
#[test]
fn pointer() {
let interner = OrdInterner::new();
let i = interner.intern_sized(42);
let i2 = i.clone();
assert_eq!(format!("{:p}", i), format!("{:p}", i2));
}
#[test]
fn size() {
use std::mem::size_of;
const SIZE: usize = if size_of::<usize>() == 4 { 12 } else { 16 };
assert_eq!(size_of::<RefCounted<()>>(), SIZE);
let fake = RefCounted::<crate::hash::Hash<i32>> {
state: State::new(),
value: 42,
};
println!("base: {:p}", &fake);
let base = &fake as *const _ as *const u8;
println!("state: {:p} (base + {})", &fake.state, unsafe {
(&fake.state as *const _ as *const u8).offset_from(base)
});
println!("mutex: {:p} (base + {})", &fake.state.mutex, unsafe {
(&fake.state.mutex as *const _ as *const u8).offset_from(base)
});
println!("refs: {:p} (base + {})", &fake.state.refs, unsafe {
(&fake.state.refs as *const _ as *const u8).offset_from(base)
});
println!("clean: {:p} (base + {})", &fake.state.cleanup, unsafe {
(&fake.state.cleanup as *const _ as *const u8).offset_from(base)
});
println!("value: {:p} (base + {})", &fake.value, unsafe {
(&fake.value as *const _ as *const u8).offset_from(base)
});
}
}
|
rust
|
[
{"serviceTitle":"Google","enabled":"Yes","image":"../img/google.gif","type":" Standard","link":"Yes","checkurl":"https://google.com:443","linkurl":"https://google.com"},
{"serviceTitle":"Tautulli","enabled":"Yes","image":"../img/tautulli.png","type":" Standard","link":"Yes","checkurl":"https://tautulli.rzn.se","linkurl":"https://tautulli.rzn.se"},
{"serviceTitle":"traefik","enabled":"Yes","image":"../data/usrimg/traefik.logo.png","type":" Standard","link":"Yes","checkurl":"http://rzn.se;8080","linkurl":"https://rzn.se;8080"},
{"serviceTitle":"SABnzbd","enabled":"Yes","image":"../img/sabnzbd.png","type":" Standard","link":"Yes","checkurl":"https://nzb.rzn.se","linkurl":"https://nzb.rzn.se"},
{"serviceTitle":"Radarr","enabled":"Yes","image":"../img/radarr.png","type":" Standard","link":"Yes","checkurl":"https://radarr.rzn.se","linkurl":"https://radarr.rzn.se"},
{"serviceTitle":"Sonarr","enabled":"Yes","image":"../img/sonarr.png","type":" Standard","link":"Yes","checkurl":"https://sonarr.rzn.se","linkurl":"https://sonarr.rzn.se"},
{"serviceTitle":"nzbHydra2","enabled":"Yes","image":"../img/hydra2.png","type":" Standard","link":"Yes","checkurl":"https://nzbhydra.rzn.se","linkurl":"https://nzbhydra.rzn.se"},
{"serviceTitle":"Jacket","enabled":"Yes","image":"../img/jacket.png","type":" Standard","link":"Yes","checkurl":"https://jackett.rzn.se","linkurl":"https://jackett.rzn.se"},
{"serviceTitle":"influxdb","enabled":"Yes","image":"../img/infuxd.png","type":" Standard","link":"Yes","checkurl":"https://influxdb.rzn.se","linkurl":"https://influxdb.rzn.se"},
{"serviceTitle":"Portainer","enabled":"Yes","image":"../img/portainer.png","type":" Standard","link":"Yes","checkurl":"https://portainer.rzn.se","linkurl":"https://portainer.rzn.se"},
{"serviceTitle":"Lidarr","enabled":"Yes","image":"../img/lidarr.png","type":" Standard","link":"Yes","checkurl":"https://lidarr.rzn.se","linkurl":"https://lidarr.rzn.se"},
{"serviceTitle":"Koel","enabled":"Yes","image":"../data/usrimg/koel.png","type":" Standard","link":"Yes","checkurl":"https://koel.rzn.se","linkurl":"https://koel.rzn.se"},
{"serviceTitle":"AirSonic","enabled":"Yes","image":"../img/airsonic.png","type":" Standard","link":"Yes","checkurl":"https://air.rzn.se","linkurl":"https://air.rzn.se"},
{"serviceTitle":"Beets","enabled":"Yes","image":"../data/usrimg/beets.png","type":" Standard","link":"Yes","checkurl":"https://beets.rzn.se","linkurl":"https://beets.rzn.se"},
{"serviceTitle":"transmission","enabled":"Yes","image":"../img/transmission.png","type":" Standard","link":"Yes","checkurl":"https://tt.rzn.se","linkurl":"https://tt.rzn.se"},
{"serviceTitle":"Plex","enabled":"Yes","image":"../img/plex.png","type":" Standard","link":"Yes","checkurl":"https://plex.rzn.se:32400","linkurl":"https://plex.rzn.se:32400"},
{"serviceTitle":"Ampache","enabled":"Yes","image":"../data/usrimg/ampache.png","type":" Standard","link":"Yes","checkurl":"https://ampache.rzn.se/ampache","linkurl":"https://ampache.rzn.se/ampache"},
{"serviceTitle":"Mariadb","enabled":"Yes","image":"../data/usrimg/mariadb.jpg","type":" Standard","link":"Yes","checkurl":"https://db.rzn.se","linkurl":"https://db.rzn.se"},
{"serviceTitle":"SpotWeb","enabled":"Yes","image":"../data/usrimg/spotweb.png","type":" Standard","link":"Yes","checkurl":"https://spot.rzn.se","linkurl":"https://spot.rzn.se"},
{"serviceTitle":"PHPmyAdmin","enabled":"Yes","image":"../data/usrimg/phpmyadmin_logo_by_yuang.png","type":" Standard","link":"Yes","checkurl":"https://myadmin.rzn.se","linkurl":"https://myadmin.rzn.se"},
{"serviceTitle":"goances","enabled":"Yes","image":"../data/usrimg/glances.png","type":" Standard","link":"Yes","checkurl":"https://gl.rzn.se","linkurl":"https://gl.rzn.se"},
{"serviceTitle":"Logarr","enabled":"Yes","image":"../img/logarr.png","type":" Standard","link":"Yes","checkurl":"https://logarr.rzn.se","linkurl":"https://logarr.rzn.se"},
{"serviceTitle":"Logarr Alpha","enabled":"Yes","image":"../img/logarr.png","type":" Standard","link":"Yes","checkurl":"https://logarra.rzn.se","linkurl":"https://logarra.rzn.se"},
{"serviceTitle":"Organizr","enabled":"Yes","image":"../img/organizr.png","type":" Standard","link":"Yes","checkurl":"https://orgv2.rzn.se","linkurl":"https://orgv2.rzn.se"},
{"serviceTitle":"netdata","enabled":"Yes","image":"../img/netdata.png","type":" Standard","link":"Yes","checkurl":"https://netdata.rzn.se","linkurl":"https://netdata.rzn.se"},
{"serviceTitle":"duplicati","enabled":"Yes","image":"../data/usrimg/duplicati.png","type":" Standard","link":"Yes","checkurl":"https://bakis.rzn.se","linkurl":"https://bakis.rzn.se"},
{"serviceTitle":"Monitorr","enabled":"Yes","image":"../img/monitorr.png","type":" Ping Only","link":"Yes","checkurl":"http://localhost:80","linkurl":"http://localhost:80"}]
|
json
|
Veteran Liverpool midfielder James Milner rejected offers from three separate clubs to sign a 12-month contract extension at Anfield, according to reports.
The former England international has spent the past seven seasons at the Merseyside club and has proved to be an incredibly useful and versatile option for Jurgen Klopp.
Milner made 39 appearances for the Reds last term, including 24 matches in the Premier League. The 36-year-old, who is predominantly a central-midfielder but can be deployed at full-back, impressed the Liverpool hierarchy and was given a new contract at the end of the previous campaign.
According to GOAL, as per Sport Bible, Milner was offered the chance to play for Premier League sides Aston Villa and Newcastle United. He spent multiple seasons at the two clubs during the early part of his illustrious career.
The report also claims that the seasoned utility man turned down an offer from an unnamed MLS club before deciding to stay at Anfield for another year.
Milner made his Premier League debut as a 16-year-old in 2002 for his boyhood club Leeds United, before switching to Newcastle two years later upon the Yorkshire club's relegation.
Following a successful loan spell at Aston Villa, he joined them permanently in 2008 and won the PFA 'Young Player of the Year' award. Milner went on to win three Premier League titles with Manchester City and Liverpool, also listing the 2019 Champions League with the latter.
The former England man has won every domestic honor available to him numerous times and currently sits fourth in the list of all-time Premier League appearances with 588.
Upon agreeing to his latest contract extension, Milner told Liverpool's official website:
“I’m very pleased to be staying for another season. I have never taken playing for this club for granted and I never will. An overriding feeling for me – and a vitally important one in the process – was the belief I can still contribute to the team. The gaffer was clear what he thought and that was a big factor in me extending my contract.
Milner further added:
“Last season was extraordinary, even though it didn’t have the ending we hoped it would. But I think that will only make us all even hungrier for more success, to be honest. I felt that after the parade and that played a part in my decision-making also. It’s a unique club.
|
english
|
<filename>geoportal/src/main/webapp/app/search/AppliedFilters.js
/* See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* Esri Inc. 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.
*/
define(["dojo/_base/declare",
"dojo/_base/lang",
"dojo/_base/array",
"dojo/dom-construct",
"dojo/text!./templates/AppliedFilters.html",
"dojo/i18n!app/nls/resources",
"app/search/SearchComponent",
"app/search/DropPane",
"app/search/AppliedFilter"],
function(declare, lang, array, domConstruct, template, i18n, SearchComponent, DropPane, AppliedFilter) {
var oThisClass = declare([SearchComponent], {
i18n: i18n,
templateString: template,
allowMyContent: true,
autoExpand: true,
label: i18n.search.appliedFilters.label,
open: false,
clearAllNode: null,
myContentNode: null,
myContentCheckbox: null,
postCreate: function() {
this.inherited(arguments);
this.dropPane.setDisplayTools(false);
if (this.allowMyContent) this.addMyContent();
this.addClearAll();
},
addClearAll: function() {
var link = this.clearAllNode = domConstruct.create("a",{
href: "#",
onclick: lang.hitch(this,function(e) {
//e.stopPropagation();
//e.preventDefault();
this.clearAll();
})
},this.dropPane.toolsNode);
link.innerHTML = "<span class=\"glyphicon glyphicon-remove\"></span>";
link.title = i18n.search.appliedFilters.clearAll;
},
addMyContent: function() {
var self = this;
var span = this.myContentNode = domConstruct.create("span",{
"class": "my-content-option",
},this.dropPane.toolsNode);
var id = this.id+"_cbx_";
var checkbox = this.myContentCheckbox = domConstruct.create("input",{
id: id,
type: "checkbox",
onclick: function(e) {
e.stopPropagation();
self.search();
}
},span);
var label = domConstruct.create("label",{
"for": id,
innerHTML: i18n.search.appliedFilters.myContent,
onclick: function(e) {
e.stopPropagation();
}
},span);
this.myContentNode.style.display = "none";
},
clearAll: function() {
var components = this.searchPane.getSearchComponents();
array.forEach(components,function(component){
var aClauses = [];
array.forEach(component.activeQClauses,function(qClause){
if (qClause.removable) {
component.whenQClauseRemoved(qClause);
} else {
aClauses.push(qClause);
}
});
component.activeQClauses = aClauses;
});
this.destroyEntries();
if (this.autoExpand) {
this.dropPane.set("open",false);
}
this.search();
},
count: function() {
var n = 0;
array.forEach(this.dropPane.getChildren(),function(child){
if (child.isAppliedFilter) n++;
});
return n;
},
destroyEntries: function() {
var rm = [];
array.forEach(this.dropPane.getChildren(),function(child){
if (child.isAppliedFilter) rm.push(child);
});
array.forEach(rm,function(child){
this.dropPane.removeChild(child);
},this);
//this.dropPane.setDisplayTools(false);
},
/* SearchComponent API ============================================= */
appendQueryParams: function(params) {
if (this.myContentNode && AppContext.appUser.isPublisher() && this.myContentCheckbox.checked) {
var query = {"term": {sys_owner_s: AppContext.appUser.getUsername()}};
if (!params.queries) params.queries = [];
params.queries.push(query);
params.wasMyContent = true
}
},
processResults: function(searchResponse) {
var prevCount = this.count();
this.destroyEntries();
if (!this.searchPane) return;
var hasRemovable = false, hasViewable = false;
var entriesNode = this.entriesNode;
var components = this.searchPane.getSearchComponents();
array.forEach(components,function(component){
array.forEach(component.activeQClauses,function(qClause){
if (qClause.viewable) {
hasViewable = true;
if (qClause.removable) hasRemovable = true;
var af = new AppliedFilter({qClause: qClause});
af.placeAt(entriesNode);
}
});
});
var showMyContent = this.myContentNode && AppContext.appUser.isPublisher();
//if (hasRemovable) this.dropPane.setDisplayTools(true);
if (showMyContent || hasViewable) this.dropPane.setDisplayTools(true);
else this.dropPane.setDisplayTools(false);
if (showMyContent) this.myContentNode.style.display = "";
else this.myContentNode.style.display = "none";
if (hasViewable) this.clearAllNode.style.visibility = "visible";
else this.clearAllNode.style.visibility = "hidden";
if (this.autoExpand) {
var count = this.count();
if (prevCount === 0 && count > 0) {
this.dropPane.set("open",true);
} else if (prevCount > 0 && count === 0) {
this.dropPane.set("open",false);
}
}
}
});
return oThisClass;
});
|
javascript
|
export { default } from 'ember-datadog-rum/services/datadog';
|
javascript
|
{
"name": "matter-js",
"version": "0.18.0",
"license": "MIT",
"homepage": "http://brm.io/matter-js/",
"author": "<NAME> <<EMAIL>> (http://brm.io/)",
"description": "a 2D rigid body physics engine for the web",
"main": "build/matter.js",
"repository": {
"type": "git",
"url": "https://github.com/liabru/matter-js.git"
},
"keywords": [
"javascript",
"canvas",
"html5",
"physics",
"physics engine",
"game engine",
"rigid body physics"
],
"devDependencies": {
"conventional-changelog-cli": "^2.1.1",
"eslint": "^6.8.0",
"html-webpack-plugin": "^4.5.1",
"jest": "^25.1.0",
"jest-worker": "^24.9.0",
"json-stringify-pretty-compact": "^2.0.0",
"matter-tools": "^0.14.0",
"matter-wrap": "^0.2.0",
"mock-require": "^3.0.3",
"pathseg": "^1.2.0",
"poly-decomp": "^0.3.0",
"puppeteer-core": "^5.5.0",
"terser-webpack-plugin": "^4.2.3",
"webpack": "^4.46.0",
"webpack-bundle-analyzer": "^4.4.0",
"webpack-cli": "^3.3.11",
"webpack-dev-server": "^3.11.1"
},
"scripts": {
"start": "npm run dev",
"dev": "npm run serve -- --open",
"serve": "webpack-dev-server --no-cache --mode development --config webpack.demo.config.js",
"watch": "nodemon --watch webpack.demo.config.js --exec \"npm run serve\"",
"build": "webpack --mode=production --no-hot --no-watch & webpack --mode=production --no-hot --no-watch --env.MINIMIZE",
"build-alpha": "webpack --mode=production --no-hot --no-watch --env.KIND=alpha & webpack --mode=production --no-hot --no-watch --env.MINIMIZE --env.KIND=alpha",
"build-dev": "webpack --mode=production --no-hot --no-watch --env.KIND=dev & webpack --mode=production --no-hot --no-watch --env.MINIMIZE --env.KIND=dev",
"build-demo": "rm -rf ./demo/js && webpack --no-hot --no-watch --config webpack.demo.config.js --mode=production && webpack --no-hot --no-watch --config webpack.demo.config.js --mode=production --env.MINIMIZE",
"lint": "eslint 'src/**/*.js' 'demo/src/**/*.js' 'examples/*.js' 'webpack.*.js'",
"doc": "yuidoc --config yuidoc.json --project-version $npm_package_version",
"doc-watch": "nodemon --delay 3 --watch 'matter-doc-theme' --watch src -e 'js,html,css,handlebars' --exec 'npm run doc'",
"benchmark": "EXAMPLES=stress3 npm run test-node",
"test": "npm run test-node",
"test-node": "npm run build-dev && node --expose-gc node_modules/.bin/jest --force-exit --no-cache --runInBand ./test/Examples.spec.js",
"test-browser": "node --expose-gc node_modules/.bin/jest --force-exit --no-cache --runInBand ./test/Browser.spec.js",
"test-all": "npm run test-node && npm run test-browser",
"test-save": "SAVE=true npm run test-node",
"test-watch": "npm run test-node -- --watch",
"changelog": "conventional-changelog -i CHANGELOG.md -s -r",
"release": "npm version --no-git-tag-version",
"preversion": "git checkout master && npm run lint && SAVE=true npm run test-all",
"version": "git checkout -b release/$npm_package_version && npm run build"
},
"files": [
"src",
"build",
"CHANGELOG.md"
]
}
|
json
|
<filename>src/c++/lib/xml/XmlReader.cpp
/**
** Isaac Genome Alignment Software
** Copyright (c) 2010-2017 Illumina, Inc.
** All rights reserved.
**
** This software is provided under the terms and conditions of the
** GNU GENERAL PUBLIC LICENSE Version 3
**
** You should have received a copy of the GNU GENERAL PUBLIC LICENSE Version 3
** along with this program. If not, see
** <https://github.com/illumina/licenses/>.
**
** \file XmlReader.cpp
**
** Helper class for working with xml
**
** \author <NAME>
**/
#include "xml/XmlReader.hh"
namespace isaac
{
namespace xml
{
XmlReader::XmlReader(std::istream &is) :
is_(is),
xmlReader_(xmlReaderForIO(xmlInputReadCallback, xmlInputCloseCallback, &is_,
"", 0, XML_PARSE_DTDATTR|XML_PARSE_NOENT)),
good_(true)
{
if (!xmlReader_)
{
BOOST_THROW_EXCEPTION(XmlReaderException("xmlReaderForIO failed"));
}
}
XmlReader::~XmlReader()
{
xmlFreeTextReader(xmlReader_);
}
int XmlReader::xmlInputReadCallback(void *context, char *buffer, int len)
{
std::istream* pStream = reinterpret_cast<std::istream*>(context);
if (!*pStream && !pStream->eof())
{
// ISAAC_THREAD_CERR << "stream is not open" << std::endl;
return -1;
}
if (!pStream->read(buffer, len) && !pStream->eof())
{
// ISAAC_THREAD_CERR << "stream read failed" << std::endl;
return -1;
}
// ISAAC_THREAD_CERR << "stream read " << pStream->gcount() << std::endl;
return pStream->gcount();
}
int XmlReader::xmlInputCloseCallback(void * context)
{
return 0;
}
XmlReader::ElementText XmlReader::readElementText()
{
if (!good())
{
// don't do anything unless we're good. This forces user to analyse and clear error states
BOOST_THROW_EXCEPTION(xml::XmlReaderException("readElementText requested on bad reader"));
}
int isEmpty = xmlTextReaderIsEmptyElement(xmlReader_);
if (-1 == isEmpty)
{
BOOST_THROW_EXCEPTION(XmlReaderException("xmlTextReaderIsEmptyElement returned -1"));
}
if (isEmpty)
{
// return empty text for element that is empty lie this <blah/>
return ElementText("");
}
else
{
if (!read())
{
good_ = false;
BOOST_THROW_EXCEPTION(XmlReaderException("Unexpected end of the stream while looking for element text. " + getCurrentDebugContext()));
}
xmlReaderTypes nodeType = getNodeType();
if (XML_READER_TYPE_END_ELEMENT == nodeType)
{
// return empty text for element that ends here
return ElementText("");
}
else if (XML_READER_TYPE_TEXT != nodeType)
{
good_ = false;
BOOST_THROW_EXCEPTION(XmlReaderException("Text requested for element which does not have text. " + getCurrentDebugContext()));
}
return getValue();
}
}
XmlReader::Attribute XmlReader::getAttribute(const char *name) const
{
xmlChar *attributeValue = getAttributePointer(name);
if (!attributeValue)
{
BOOST_THROW_EXCEPTION(XmlReaderException(std::string("Attribute ") + name + " not found" + getCurrentDebugContext()));
}
// ISAAC_THREAD_CERR << "attribute:" << name << " value:" << attributeValue << std::endl;
Attribute ret(attributeValue);
return ret;
}
xmlChar *XmlReader::getAttributePointer(const char *name) const
{
xmlReaderTypes nodeType = getNodeType();
if (XML_READER_TYPE_ELEMENT != nodeType)
{
BOOST_THROW_EXCEPTION(XmlReaderException(std::string("Request for attribute ") + name +
" while current node type is not an element: " +
boost::lexical_cast<std::string>(nodeType) +
getCurrentDebugContext()));
}
return xmlTextReaderGetAttribute(xmlReader_, BAD_CAST name);
}
XmlReader &XmlReader::nextElementBelowLevel(const int minDepth)
{
if (!good())
{
// don't do anything unless we're good. This forces user to analyse and clear error states
BOOST_THROW_EXCEPTION(xml::XmlReaderException("nextElementBelowLevel requested on bad reader for minDepth:" +
boost::lexical_cast<std::string>(minDepth)));
}
while (read())
{
xmlReaderTypes nodeType = getNodeType();
if (XML_READER_TYPE_ELEMENT == nodeType)
{
return *this;
}
else if (XML_READER_TYPE_END_ELEMENT == nodeType)
{
// ISAAC_THREAD_CERR << "current depth:" << getCurrentDepth() << " min depth:" << minDepth << std::endl;
if (minDepth >= getCurrentDepth())
{
good_ = false;
return *this;
}
}
}
good_ = false;
return *this;
}
XmlReader &XmlReader::nextElement(const bool noThrow/* = false*/)
{
return nextElement(0, noThrow);
}
/**
* \brief advances to the next element, optionaly validates the name of the found element
*
* \param name if not 0, name of the next found element is asserted
*/
XmlReader &XmlReader::nextElement(const char *name, const bool noThrow/* = false*/)
{
if (!good())
{
// don't do anything unless we're good. This forces user to analyse and clear error states
BOOST_THROW_EXCEPTION(xml::XmlReaderException("nextElement requested on bad reader"));
}
const std::string debugContext = getCurrentDebugContext();
while (read())
{
xmlReaderTypes nodeType = getNodeType();
if (XML_READER_TYPE_ELEMENT == nodeType)
{
if (name)
{
good_ = assertName(name, noThrow);
}
return *this;
}
}
good_ = false;
if (!noThrow)
{
BOOST_THROW_EXCEPTION(xml::XmlReaderException(
std::string("Unexpected end of xml stream while looking for next element ") + (name ? name : "") + " at " +
debugContext));
}
return *this;
}
XmlReader &XmlReader::nextChildElement(const char *name, const bool noThrow/* = false*/)
{
const int parentDepth = getCurrentDepth();
nextElement(name, noThrow);
if (getCurrentDepth() != parentDepth + 1)
{
good_ = false;
if (!noThrow)
{
BOOST_THROW_EXCEPTION(xml::XmlReaderException(std::string("Child element ") + name +
" not found for parentDepth " + boost::lexical_cast<std::string>(parentDepth) + getCurrentDebugContext()));
}
}
return *this;
}
XmlReader::ElementText XmlReader::getValue() const
{
const xmlChar *ret = xmlTextReaderConstValue(xmlReader_);
if (!ret)
{
BOOST_THROW_EXCEPTION(XmlReaderException("xmlTextReaderConstValue returned 0" + getCurrentDebugContext()));
}
return ElementText(ret);
}
int XmlReader::getCurrentDepth() const
{
const int ret = xmlTextReaderDepth(xmlReader_);
if (-1 == ret)
{
BOOST_THROW_EXCEPTION(XmlReaderException("xmlTextReaderDepth returned -1"));
}
return ret;
}
std::string XmlReader::getXmlNodePath(xmlNodePtr currentNode) const
{
std::string ret;
do
{
if (!ret.empty())
{
ret.insert(0, "/");
}
ret.insert(0, currentNode->name ? reinterpret_cast<const char*>(currentNode->name) : "#nullname");
currentNode = currentNode->parent;
}
while(currentNode);
return ret;
}
std::string XmlReader::getCurrentDebugContext() const
{
xmlNodePtr currentNode = xmlTextReaderCurrentNode(xmlReader_);
if (!currentNode)
{
return " no context";
}
const std::string ret = std::string(" line: ") + boost::lexical_cast<std::string>(currentNode->line) + " path:" + getXmlNodePath(currentNode);
return ret;
}
const char *XmlReader::getName() const
{
const char *ret = reinterpret_cast<const char*>(xmlTextReaderConstName(xmlReader_));
if (!ret)
{
BOOST_THROW_EXCEPTION(XmlReaderException("xmlTextReaderConstName returned 0"));
}
// ISAAC_THREAD_CERR << "Name: " << ret << std::endl;
return ret;
}
bool XmlReader::assertName(const char *name, const bool noThrow/* = false*/) const
{
const char *currentName = getName();
if (strcmp(name, currentName))
{
if (noThrow)
{
return false;
}
BOOST_THROW_EXCEPTION(xml::XmlReaderException(std::string("Unexpected element ") + currentName +
" while looking for element " + name + getCurrentDebugContext()));
}
return true;
}
bool XmlReader::checkName(const char *name) const
{
const char *currentName = getName();
if (strcmp(name, currentName))
{
return false;
}
return true;
}
xmlReaderTypes XmlReader::getNodeType() const
{
int nodeType = xmlTextReaderNodeType(xmlReader_);
if (-1 == nodeType)
{
BOOST_THROW_EXCEPTION(XmlReaderException("xmlTextReaderNodeType failed"));
}
return static_cast<xmlReaderTypes>(nodeType);
}
bool XmlReader::read()
{
int res = xmlTextReaderRead(xmlReader_);
if (-1 == res)
{
good_ = false;
BOOST_THROW_EXCEPTION(XmlReaderException("xmlTextReaderRead failed"));
}
ISAAC_ASSERT_MSG(0 == res || 1 == res, "Invalid result from xmlTextReaderRead : " << res);
return 1 == res;
}
} // namespace xml
} // namespace isaac
|
cpp
|
<gh_stars>0
.main-content{
height:100%;
position: relative;
}
.chatbar{
position: fixed;
background-color: lightgray;
left:0;
top:0;
height: 100%;
width: 15%;
min-width: 10rem;
}
.hero-title{
font-size: 30px;
}
.room{
font-size : 19px;
cursor: pointer;
}
.chat-display{
position: fixed;
left: 16%;
width: 74%;
background-color: lavender;
}
.message{
}
.content{
font-size: 1rem;
}
.user{
color:red;
}
.timestamp{
position: relative;
left: 80%;
}
.message-input{
position: fixed;
left: 16%;
top: 95%;
width: 74%;
}
.message-submit{
position: fixed;
left: 92%;
top: 95%;
}
|
css
|
<gh_stars>10-100
export const starCircle16: string;
|
typescript
|
/*******************************************************************************
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
******************************************************************************/
package com.pogeyan.cmis.api.uri.expression;
/**
* The interface {@link Visitable} is part of the visitor pattern used to traverse
* the expression tree build from a $filter expression string or $orderby expression string.
* It is implemented by each class used as node in an expression tree.
*
* @see ExpressionVisitor
*
*/
public interface Visitable {
/**
* Method {@link #accept(ExpressionVisitor)} is called when traversing the expression tree. This method is invoked on
* each
* expression used as node in an expression tree. The implementations should
* behave as follows:
* <li>Call accept on all sub nodes and store the returned Objects
* <li>Call the appropriate method on the {@link ExpressionVisitor} instance and provide the stored objects to that
* instance
* <li>Return the object which should be passed to the processing algorithm of the parent expression node
* <br>
* <br>
* @param visitor
* Object ( implementing {@link ExpressionVisitor}) whose methods are called during traversing a expression node of
* the expression tree.
* @return
* Object which should be passed to the processing algorithm of the parent expression node
* @throws ExceptionVisitExpression
* Exception occurred the OData library while traversing the tree
* @throws ODataApplicationException
* Exception thrown by the application who implemented the visitor
*/
Object accept(ExpressionVisitor visitor) throws ExceptionVisitExpression;
}
|
java
|
import { Redirect, Route, Switch } from "@prodo/route";
import * as React from "react";
import { state, watch } from "../model";
import "./App.scss";
import BoardContainer from "./Board/BoardContainer";
import Home from "./Home/Home";
import LandingPage from "./LandingPage/LandingPage";
const AppInner = ({}) => {
const user = watch(state.user);
const isGuest = watch(state.isGuest);
// Serve different pages depending on if user is logged in or not
if (user || isGuest) {
return (
<Switch>
<Route exact path="/" component={Home} />
<Route path="/b/:boardId" component={BoardContainer} />
<Redirect to="/" />
</Switch>
);
}
// If not logged in, always redirect to landing page
return (
<Switch>
<Route exact path="/" component={LandingPage} />
<Redirect to="/" />
</Switch>
);
};
// Use withRouter to prevent strange glitch where other components
// lower down in the component tree wouldn't update from URL changes
export default () => (
<>
<AppInner />
<div id="modal" />
</>
);
|
typescript
|
Posted On:
Facial recognition System is part of the Digi Yatra initiative of the government for providing passengers seamless and hassle-free experience at airports. It is to be implemented in a phased manner. The first phase is planned at Kolkata, Varanasi, Pune, Vijayawada, Bangalore, Delhi and Hyderabad Airports by March 2023. Preliminary testing of the Digi Yatra Biometric boarding system with registration for the 'Day of Travel' at these airports has been completed.
The requirement of security is dynamic in nature. The Bureau of Civil Aviation Security (BCAS), the regulatory authority for civil aviation security in the country, in consultation with other concerned agencies and stakeholders, reviews the security arrangements at airports from time to time and upgrade the same as per requirement.
This information was given by the Minister of State in the Ministry of Civil Aviation Gen. (Dr) V. K. Singh (Retd) in a written reply to a question in Rajya Sabha today.
|
english
|
On Monday, Discovery Channel released a promotional video of an upcoming episode of the popular show Man Vs Wild that will feature Prime Minister Narendra Modi. The video was posted on Twitter by the channel as well as the host of the show Bear Grylls.
In the series, Grylls “tackles extreme challenges and navigates through remote locations around the world, sharing invaluable survival strategies along the way”.
The 45-second sneak peek describes the episode as an “epic adventure of a lifetime”. Hyperactive Indians on the internet were thrilled at the prospect of this newfound source memes.
The release of the promo gave new energy to the Congress party’s allegation that Modi had failed to stop shooting the episode after the Pulwama attack occurred on February 14. The suicide bombing left 40 Central Reserve Police Force men dead in Jammu & Kashmir.
The episode will be telecast on the Discovery Channel on August 12 at 9 pm.
|
english
|
<reponame>edoardo993/laravel-boolean<gh_stars>0
* {
margin: 0;
padding: 0;
box-sizing: border-box;
background: lightblue;
}
.title {
margin: 25px 0;
text-align: center;
color: darkblue;
font-size: 40px;
text-transform: uppercase;
}
.car-cards {
display: flex;
justify-content: space-around;
flex-wrap: wrap;
}
.car-card {
line-height: 1.5em;
}
#id {
color: darkblue;
}
.bold {
font-weight: bold;
}
.car-details {
color: blue;
}
|
css
|
package main
import (
"fmt"
"github.com/whaly/rpigpio"
"os"
"os/signal"
"time"
)
func main() {
// set GPIO25 to output mode
pin, err := gpio.OpenPin(gpio.GPIO22, gpio.ModeInput)
if err != nil {
fmt.Printf("Error opening pin! %s\n", err)
return
}
power, err := gpio.OpenPin(gpio.GPIO17, gpio.ModeOutput)
if err != nil {
fmt.Printf("Error opening pin! %s\n", err)
return
}
// clean up on exit
c := make(chan os.Signal, 1)
signal.Notify(c, os.Interrupt)
go func() {
for _ = range c {
fmt.Println("Closing pin and terminating program.")
power.Clear()
pin.Close()
power.Close()
os.Exit(0)
}
}()
err = pin.BeginWatch(gpio.EdgeFalling, func() {
fmt.Printf("Callback for %d triggered!\n\n", gpio.GPIO22)
})
if err != nil {
fmt.Printf("Unable to watch pin: %s\n", err.Error())
os.Exit(1)
}
fmt.Println("Now watching pin 22 on a falling edge.")
for {
fmt.Println("Setting power high")
power.Set()
time.Sleep(2000 * time.Millisecond)
fmt.Println("Setting power low")
power.Clear()
time.Sleep(2000 * time.Millisecond)
}
}
|
go
|
<reponame>139199228/webpack4App<gh_stars>0
{
"name": "webpack4app",
"version": "1.0.0",
"description": "",
"scripts": {
"build:web": "webpack --mode development --config build/webpack.config.js",
"build:server": "webpack --mode development --config build/webpack.config.server.js",
"clear": "rimraf dist",
"build": "npm run clear && npm run build:web && npm run build:server"
},
"repository": {
"type": "git",
"url": "git+https://github.com/139199228/webpack4App.git"
},
"author": "",
"license": "ISC",
"bugs": {
"url": "https://github.com/139199228/webpack4App/issues"
},
"homepage": "https://github.com/139199228/webpack4App#readme",
"devDependencies": {
"babel-loader": "^7.1.4",
"express": "^4.16.3",
"html-webpack-plugin": "^3.1.0",
"react": "^16.2.0",
"react-dom": "^16.2.0",
"rimraf": "^2.6.2",
"webpack": "^4.2.0",
"webpack-cli": "^2.0.13"
}
}
|
json
|
<filename>website/package.json
{
"name": "vue-seamless-scroll-website",
"version": "1.0.0",
"description": "vue-seamless-scroll website",
"author": "chenxuan",
"license": "MIT",
"private": false,
"scripts": {
"docs:dev": "sudo vuepress dev docs",
"docs:build": "sudo vuepress build docs",
"docs:deploy": "sudo ./deploy.sh"
},
"dependencies": {
"echarts": "^4.0.0",
"vue-seamless-scroll": "^1.1.21"
},
"devDependencies": {
"@vuepress/plugin-back-to-top": "^1.6.0",
"@vuepress/plugin-google-analytics": "^1.6.0",
"vuepress-plugin-seo": "^0.1.4",
"vuepress-plugin-sitemap": "^2.3.1",
"vuepress": "^1.7.1",
"vuepress-plugin-serve": "^2.0.4"
},
"resolutions": {
"watchpack": "1.6.1"
}
}
|
json
|
FELICITATION BY THE SPEAKER
Successful launch of PSLV-C29 from Sriharikota, Andhra Pradesh on 16 December, 2015
HON. SPEAKER: Hon. Members, as you are aware, our country has successfully launched six Singapore satellites and put them into orbit through Polar Satellite Launch Vehicles (PSLV-C29) from Sriharikota, Andhra Pradesh on the 16th December, 2015. This is the first time that our country tested a multiple burn fuel rocket engine.
We are extremely proud of this accomplishment by our space scientists.
The House conveys its congratulations to the Scientists and Technologists of the Indian Space Research Organisation and wishes them success in all their future endeavours. … (Interruptions)
|
english
|
<reponame>yu-iskw/elementary
from collections import defaultdict
from lineage.query_context import QueryContext
class QueryHistoryStats(object):
def __init__(self):
self._query_type_stats = defaultdict(lambda: 0)
self._roles = set()
self._users = set()
def update_stats(self, query_context: QueryContext):
if query_context.query_type is not None:
self._query_type_stats[query_context.query_type] += 1
if query_context.user_name is not None:
self._users.add(query_context.user_name)
if query_context.role_name is not None:
self._roles.add(query_context.role_name)
def to_dict(self):
query_history_stats_dict = self._query_type_stats.copy()
query_history_stats_dict['user_count'] = len(self._users)
query_history_stats_dict['role_count'] = len(self._roles)
return query_history_stats_dict
|
python
|
{"title":"【Azur Lane MMD】Colorado - リバーシブル・キャンペーン (Reversible Campaign)","author":"LTC_Raven","description":"IundefinedfeelundefinedlikeundefinedI'mundefinedmakingundefinedsomethingundefinedwrong.","thumb":"//i.iwara.tv/sites/default/files/styles/thumbnail/public/video_embed_field_thumbnails/youtube/cxULZMjYvYY.jpg?itok=d7Gtw0jZ","download":"https://www.iwara.tv/api/video/b0rz9fo0mc3j0ndy","origin":"https://www.iwara.tv/videos/b0rz9fo0mc3j0ndy"}
|
json
|
{"text":"All laws and ordinances of the City of Washington, and of the levy court of the District of Columbia, except as modified or repealed by Congress or the Legislative Assembly of the District since June 1, 1871, or until so modified or repealed, remain in full force.","historical":"Prior Codifications\n\n1981 Ed., § 49-302.\n\n1973 Ed., § 49-302.\n\nDC CODE § 45-402\n\nCurrent through December 11, 2012","credits":"(R.S., D.C., § 91; Comp. Stat. D.C., § 4; Feb. 11, 1895, 28 Stat. 650, ch. 79.)","sections":[],"division":{"identifier":"VIII","text":"General Laws."},"title":{"identifier":"45","text":"Compilation and Construction of Code. (Refs & Annos)"},"chapter":{"identifier":"4","text":"Laws Remaining in Force."},"heading":{"title":"45","chaptersection":"402","identifier":"45-402","catch_text":"Ordinances of Washington and of levy court."}}
|
json
|
Will luck smile on young and enterprising politico Chalamalasetti Sunil? He has been in politics for over 15 years and has till now been unsuccessful in winning the elections. If all goes well, he could be lucky soon.
Sunil, an influential NRI from the powerful Kapu community, contested on TDP ticket for Kakinada MP seat in 2009, as Praja Rajyam Party candidate in 2014 and as TDP candidate in 2019. Each time, he lost by a whisker. Though hugely popular, he has always missed the political bus. This time around, if all goes well, he might join the YSRCP. The YSRCP too needs him as the BJP is now trying to get closer to the Kapu community with an eye on 2024 elections. Sources say that he could be made Rajya Sabha MP in the 2022 when there would be biennial elections. This would help in bringing the Kapu community further closer to the YSRCP.
Will Chalamalasetti be lucky this time? Will he be able to break the barrier and become the MP? Let's wait and see what future has in store for this young and enterprising politician.
|
english
|
<filename>archunit/src/main/java/com/tngtech/archunit/core/domain/properties/HasType.java<gh_stars>1-10
/*
* Copyright 2014-2020 TNG Technology Consulting GmbH
*
* 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.
*/
package com.tngtech.archunit.core.domain.properties;
import com.tngtech.archunit.PublicAPI;
import com.tngtech.archunit.base.ChainableFunction;
import com.tngtech.archunit.base.DescribedPredicate;
import com.tngtech.archunit.core.domain.JavaClass;
import static com.tngtech.archunit.PublicAPI.Usage.ACCESS;
import static com.tngtech.archunit.base.DescribedPredicate.equalTo;
import static com.tngtech.archunit.core.domain.properties.HasName.Functions.GET_NAME;
import static com.tngtech.archunit.core.domain.properties.HasType.Functions.GET_RAW_TYPE;
public interface HasType {
/**
* @deprecated Use {@link #getRawType()} instead
*/
@Deprecated
@PublicAPI(usage = ACCESS)
JavaClass getType();
@PublicAPI(usage = ACCESS)
JavaClass getRawType();
final class Predicates {
private Predicates() {
}
/**
* @deprecated Use {@link #rawType(Class)} instead
*/
@Deprecated
@PublicAPI(usage = ACCESS)
public static DescribedPredicate<HasType> type(Class<?> type) {
return adjustDeprecatedDescription(rawType(type));
}
@PublicAPI(usage = ACCESS)
public static DescribedPredicate<HasType> rawType(Class<?> type) {
return rawType(type.getName());
}
/**
* @deprecated Use {@link #rawType(String)} instead
*/
@Deprecated
@PublicAPI(usage = ACCESS)
public static DescribedPredicate<HasType> type(String typeName) {
return adjustDeprecatedDescription(rawType(typeName));
}
@PublicAPI(usage = ACCESS)
public static DescribedPredicate<HasType> rawType(String typeName) {
return rawType(GET_NAME.is(equalTo(typeName))).as("raw type " + typeName);
}
/**
* @deprecated Use {@link #rawType(DescribedPredicate)} instead
*/
@Deprecated
@PublicAPI(usage = ACCESS)
public static DescribedPredicate<HasType> type(DescribedPredicate<? super JavaClass> predicate) {
return adjustDeprecatedDescription(rawType(predicate));
}
@PublicAPI(usage = ACCESS)
public static DescribedPredicate<HasType> rawType(DescribedPredicate<? super JavaClass> predicate) {
return GET_RAW_TYPE.is(predicate).as("raw type " + predicate.getDescription());
}
private static DescribedPredicate<HasType> adjustDeprecatedDescription(DescribedPredicate<HasType> predicate) {
return predicate.as(predicate.getDescription().replace("raw type", "type"));
}
}
final class Functions {
private Functions() {
}
@PublicAPI(usage = ACCESS)
public static final ChainableFunction<HasType, JavaClass> GET_RAW_TYPE = new ChainableFunction<HasType, JavaClass>() {
@Override
public JavaClass apply(HasType input) {
return input.getRawType();
}
};
/**
* @deprecated Use {@link HasType.Functions#GET_RAW_TYPE} instead
*/
@Deprecated
@PublicAPI(usage = ACCESS)
public static final ChainableFunction<HasType, JavaClass> GET_TYPE = GET_RAW_TYPE;
}
}
|
java
|
<gh_stars>0
{
"profiles": {
"LargePayload": {
"commandName": "Project",
"environmentVariables": {
//"OTEL_TRACE_TRANSPORT": "DEFAULT",
"OTEL_TRACE_TRANSPORT": "DATADOG-NAMED-PIPES",
// These variables are to override environmental settings to be sure that the payload is always approximately the same size
"OTEL_ENV": "payload-test",
"OTEL_SERVICE": "LargePayload",
"OTEL_TAGS": "",
"OTEL_HOST": "PayloadHost"
},
"nativeDebugging": false
}
}
}
|
json
|
[{"postal_code":"66295","place_name":"Lomas de San Angel","place_type":"Colonia","county":"San Pedro Garza García","state":"Nuevo León","city":"San Pedro Garza García"},{"postal_code":"66295","place_name":"Zona Alpino","place_type":"Colonia","county":"San Pedro Garza García","state":"Nuevo León","city":"San Pedro Garza García"},{"postal_code":"66295","place_name":"Joya del Venado","place_type":"Colonia","county":"San Pedro Garza García","state":"Nuevo León","city":"San Pedro Garza García"},{"postal_code":"66295","place_name":"Hacienda de Carrizalejo","place_type":"Colonia","county":"San Pedro Garza García","state":"Nuevo León","city":"San Pedro Garza García"},{"postal_code":"66295","place_name":"Comercial Alpino Chipinque","place_type":"Colonia","county":"San Pedro Garza García","state":"Nuevo León","city":"San Pedro Garza García"}]
|
json
|
<filename>packages/protocol/index.js
// This file is auto generated by the protocol-buffers cli tool
/* eslint-disable quotes */
/* eslint-disable indent */
/* eslint-disable no-redeclare */
/* eslint-disable camelcase */
// Remember to `npm install --save protocol-buffers-encodings`
var encodings = require('protocol-buffers-encodings')
var varint = encodings.varint
var skip = encodings.skip
exports.Subject = {
"LIST": 0,
"ITEM": 1
}
var Dat = exports.Dat = {
buffer: true,
encodingLength: null,
encode: null,
decode: null
}
var List = exports.List = {
buffer: true,
encodingLength: null,
encode: null,
decode: null
}
var Instruction = exports.Instruction = {
buffer: true,
encodingLength: null,
encode: null,
decode: null
}
var Statistics = exports.Statistics = {
buffer: true,
encodingLength: null,
encode: null,
decode: null
}
var Stat = exports.Stat = {
buffer: true,
encodingLength: null,
encode: null,
decode: null
}
var Answer = exports.Answer = {
buffer: true,
encodingLength: null,
encode: null,
decode: null
}
defineDat()
defineList()
defineInstruction()
defineStatistics()
defineStat()
defineAnswer()
function defineDat () {
var enc = [
encodings.string
]
Dat.encodingLength = encodingLength
Dat.encode = encode
Dat.decode = decode
function encodingLength (obj) {
var length = 0
if (!defined(obj.key)) throw new Error("key is required")
var len = enc[0].encodingLength(obj.key)
length += 1 + len
if (!defined(obj.path)) throw new Error("path is required")
var len = enc[0].encodingLength(obj.path)
length += 1 + len
return length
}
function encode (obj, buf, offset) {
if (!offset) offset = 0
if (!buf) buf = Buffer.allocUnsafe(encodingLength(obj))
var oldOffset = offset
if (!defined(obj.key)) throw new Error("key is required")
buf[offset++] = 10
enc[0].encode(obj.key, buf, offset)
offset += enc[0].encode.bytes
if (!defined(obj.path)) throw new Error("path is required")
buf[offset++] = 18
enc[0].encode(obj.path, buf, offset)
offset += enc[0].encode.bytes
encode.bytes = offset - oldOffset
return buf
}
function decode (buf, offset, end) {
if (!offset) offset = 0
if (!end) end = buf.length
if (!(end <= buf.length && offset <= buf.length)) throw new Error("Decoded message is not valid")
var oldOffset = offset
var obj = {
key: "",
path: ""
}
var found0 = false
var found1 = false
while (true) {
if (end <= offset) {
if (!found0 || !found1) throw new Error("Decoded message is not valid")
decode.bytes = offset - oldOffset
return obj
}
var prefix = varint.decode(buf, offset)
offset += varint.decode.bytes
var tag = prefix >> 3
switch (tag) {
case 1:
obj.key = enc[0].decode(buf, offset)
offset += enc[0].decode.bytes
found0 = true
break
case 2:
obj.path = enc[0].decode(buf, offset)
offset += enc[0].decode.bytes
found1 = true
break
default:
offset = skip(prefix & 7, buf, offset)
}
}
}
}
function defineList () {
var enc = [
Dat
]
List.encodingLength = encodingLength
List.encode = encode
List.decode = decode
function encodingLength (obj) {
var length = 0
if (defined(obj.list)) {
for (var i = 0; i < obj.list.length; i++) {
if (!defined(obj.list[i])) continue
var len = enc[0].encodingLength(obj.list[i])
length += varint.encodingLength(len)
length += 1 + len
}
}
return length
}
function encode (obj, buf, offset) {
if (!offset) offset = 0
if (!buf) buf = Buffer.allocUnsafe(encodingLength(obj))
var oldOffset = offset
if (defined(obj.list)) {
for (var i = 0; i < obj.list.length; i++) {
if (!defined(obj.list[i])) continue
buf[offset++] = 10
varint.encode(enc[0].encodingLength(obj.list[i]), buf, offset)
offset += varint.encode.bytes
enc[0].encode(obj.list[i], buf, offset)
offset += enc[0].encode.bytes
}
}
encode.bytes = offset - oldOffset
return buf
}
function decode (buf, offset, end) {
if (!offset) offset = 0
if (!end) end = buf.length
if (!(end <= buf.length && offset <= buf.length)) throw new Error("Decoded message is not valid")
var oldOffset = offset
var obj = {
list: []
}
while (true) {
if (end <= offset) {
decode.bytes = offset - oldOffset
return obj
}
var prefix = varint.decode(buf, offset)
offset += varint.decode.bytes
var tag = prefix >> 3
switch (tag) {
case 1:
var len = varint.decode(buf, offset)
offset += varint.decode.bytes
obj.list.push(enc[0].decode(buf, offset, offset + len))
offset += enc[0].decode.bytes
break
default:
offset = skip(prefix & 7, buf, offset)
}
}
}
}
function defineInstruction () {
Instruction.Action = {
"ADD": 0,
"REMOVE": 1,
"GET": 2,
"START": 3,
"PAUSE": 4,
"LOAD": 5,
"WATCH": 6,
"MKDIR": 7,
"READDIR": 8,
"UNLINK": 9,
"RMDIR": 10,
"INFO": 11,
"STAT": 12
}
var enc = [
encodings.int32,
encodings.enum,
encodings.enum,
encodings.string
]
Instruction.encodingLength = encodingLength
Instruction.encode = encode
Instruction.decode = decode
function encodingLength (obj) {
var length = 0
if (!defined(obj.id)) throw new Error("id is required")
var len = enc[0].encodingLength(obj.id)
length += 1 + len
if (!defined(obj.action)) throw new Error("action is required")
var len = enc[1].encodingLength(obj.action)
length += 1 + len
if (!defined(obj.subject)) throw new Error("subject is required")
var len = enc[2].encodingLength(obj.subject)
length += 1 + len
if (defined(obj.key)) {
var len = enc[3].encodingLength(obj.key)
length += 1 + len
}
if (defined(obj.path)) {
var len = enc[3].encodingLength(obj.path)
length += 1 + len
}
return length
}
function encode (obj, buf, offset) {
if (!offset) offset = 0
if (!buf) buf = Buffer.allocUnsafe(encodingLength(obj))
var oldOffset = offset
if (!defined(obj.id)) throw new Error("id is required")
buf[offset++] = 8
enc[0].encode(obj.id, buf, offset)
offset += enc[0].encode.bytes
if (!defined(obj.action)) throw new Error("action is required")
buf[offset++] = 16
enc[1].encode(obj.action, buf, offset)
offset += enc[1].encode.bytes
if (!defined(obj.subject)) throw new Error("subject is required")
buf[offset++] = 24
enc[2].encode(obj.subject, buf, offset)
offset += enc[2].encode.bytes
if (defined(obj.key)) {
buf[offset++] = 34
enc[3].encode(obj.key, buf, offset)
offset += enc[3].encode.bytes
}
if (defined(obj.path)) {
buf[offset++] = 42
enc[3].encode(obj.path, buf, offset)
offset += enc[3].encode.bytes
}
encode.bytes = offset - oldOffset
return buf
}
function decode (buf, offset, end) {
if (!offset) offset = 0
if (!end) end = buf.length
if (!(end <= buf.length && offset <= buf.length)) throw new Error("Decoded message is not valid")
var oldOffset = offset
var obj = {
id: 0,
action: 0,
subject: 0,
key: "",
path: ""
}
var found0 = false
var found1 = false
var found2 = false
while (true) {
if (end <= offset) {
if (!found0 || !found1 || !found2) throw new Error("Decoded message is not valid")
decode.bytes = offset - oldOffset
return obj
}
var prefix = varint.decode(buf, offset)
offset += varint.decode.bytes
var tag = prefix >> 3
switch (tag) {
case 1:
obj.id = enc[0].decode(buf, offset)
offset += enc[0].decode.bytes
found0 = true
break
case 2:
obj.action = enc[1].decode(buf, offset)
offset += enc[1].decode.bytes
found1 = true
break
case 3:
obj.subject = enc[2].decode(buf, offset)
offset += enc[2].decode.bytes
found2 = true
break
case 4:
obj.key = enc[3].decode(buf, offset)
offset += enc[3].decode.bytes
break
case 5:
obj.path = enc[3].decode(buf, offset)
offset += enc[3].decode.bytes
break
default:
offset = skip(prefix & 7, buf, offset)
}
}
}
}
function defineStatistics () {
var enc = [
encodings.int64,
encodings.float
]
Statistics.encodingLength = encodingLength
Statistics.encode = encode
Statistics.decode = decode
function encodingLength (obj) {
var length = 0
if (!defined(obj.files)) throw new Error("files is required")
var len = enc[0].encodingLength(obj.files)
length += 1 + len
if (!defined(obj.connected)) throw new Error("connected is required")
var len = enc[0].encodingLength(obj.connected)
length += 1 + len
if (!defined(obj.byteLength)) throw new Error("byteLength is required")
var len = enc[0].encodingLength(obj.byteLength)
length += 1 + len
if (!defined(obj.version)) throw new Error("version is required")
var len = enc[0].encodingLength(obj.version)
length += 1 + len
if (!defined(obj.downloadSpeed)) throw new Error("downloadSpeed is required")
var len = enc[1].encodingLength(obj.downloadSpeed)
length += 1 + len
if (!defined(obj.uploadSpeed)) throw new Error("uploadSpeed is required")
var len = enc[1].encodingLength(obj.uploadSpeed)
length += 1 + len
if (!defined(obj.totalPeers)) throw new Error("totalPeers is required")
var len = enc[1].encodingLength(obj.totalPeers)
length += 1 + len
if (!defined(obj.completePeers)) throw new Error("completePeers is required")
var len = enc[1].encodingLength(obj.completePeers)
length += 1 + len
if (!defined(obj.downloadTotal)) throw new Error("downloadTotal is required")
var len = enc[1].encodingLength(obj.downloadTotal)
length += 1 + len
if (!defined(obj.uploadTotal)) throw new Error("uploadTotal is required")
var len = enc[1].encodingLength(obj.uploadTotal)
length += 1 + len
return length
}
function encode (obj, buf, offset) {
if (!offset) offset = 0
if (!buf) buf = Buffer.allocUnsafe(encodingLength(obj))
var oldOffset = offset
if (!defined(obj.files)) throw new Error("files is required")
buf[offset++] = 8
enc[0].encode(obj.files, buf, offset)
offset += enc[0].encode.bytes
if (!defined(obj.connected)) throw new Error("connected is required")
buf[offset++] = 16
enc[0].encode(obj.connected, buf, offset)
offset += enc[0].encode.bytes
if (!defined(obj.byteLength)) throw new Error("byteLength is required")
buf[offset++] = 24
enc[0].encode(obj.byteLength, buf, offset)
offset += enc[0].encode.bytes
if (!defined(obj.version)) throw new Error("version is required")
buf[offset++] = 32
enc[0].encode(obj.version, buf, offset)
offset += enc[0].encode.bytes
if (!defined(obj.downloadSpeed)) throw new Error("downloadSpeed is required")
buf[offset++] = 45
enc[1].encode(obj.downloadSpeed, buf, offset)
offset += enc[1].encode.bytes
if (!defined(obj.uploadSpeed)) throw new Error("uploadSpeed is required")
buf[offset++] = 53
enc[1].encode(obj.uploadSpeed, buf, offset)
offset += enc[1].encode.bytes
if (!defined(obj.totalPeers)) throw new Error("totalPeers is required")
buf[offset++] = 61
enc[1].encode(obj.totalPeers, buf, offset)
offset += enc[1].encode.bytes
if (!defined(obj.completePeers)) throw new Error("completePeers is required")
buf[offset++] = 69
enc[1].encode(obj.completePeers, buf, offset)
offset += enc[1].encode.bytes
if (!defined(obj.downloadTotal)) throw new Error("downloadTotal is required")
buf[offset++] = 77
enc[1].encode(obj.downloadTotal, buf, offset)
offset += enc[1].encode.bytes
if (!defined(obj.uploadTotal)) throw new Error("uploadTotal is required")
buf[offset++] = 85
enc[1].encode(obj.uploadTotal, buf, offset)
offset += enc[1].encode.bytes
encode.bytes = offset - oldOffset
return buf
}
function decode (buf, offset, end) {
if (!offset) offset = 0
if (!end) end = buf.length
if (!(end <= buf.length && offset <= buf.length)) throw new Error("Decoded message is not valid")
var oldOffset = offset
var obj = {
files: 0,
connected: 0,
byteLength: 0,
version: 0,
downloadSpeed: 0,
uploadSpeed: 0,
totalPeers: 0,
completePeers: 0,
downloadTotal: 0,
uploadTotal: 0
}
var found0 = false
var found1 = false
var found2 = false
var found3 = false
var found4 = false
var found5 = false
var found6 = false
var found7 = false
var found8 = false
var found9 = false
while (true) {
if (end <= offset) {
if (!found0 || !found1 || !found2 || !found3 || !found4 || !found5 || !found6 || !found7 || !found8 || !found9) throw new Error("Decoded message is not valid")
decode.bytes = offset - oldOffset
return obj
}
var prefix = varint.decode(buf, offset)
offset += varint.decode.bytes
var tag = prefix >> 3
switch (tag) {
case 1:
obj.files = enc[0].decode(buf, offset)
offset += enc[0].decode.bytes
found0 = true
break
case 2:
obj.connected = enc[0].decode(buf, offset)
offset += enc[0].decode.bytes
found1 = true
break
case 3:
obj.byteLength = enc[0].decode(buf, offset)
offset += enc[0].decode.bytes
found2 = true
break
case 4:
obj.version = enc[0].decode(buf, offset)
offset += enc[0].decode.bytes
found3 = true
break
case 5:
obj.downloadSpeed = enc[1].decode(buf, offset)
offset += enc[1].decode.bytes
found4 = true
break
case 6:
obj.uploadSpeed = enc[1].decode(buf, offset)
offset += enc[1].decode.bytes
found5 = true
break
case 7:
obj.totalPeers = enc[1].decode(buf, offset)
offset += enc[1].decode.bytes
found6 = true
break
case 8:
obj.completePeers = enc[1].decode(buf, offset)
offset += enc[1].decode.bytes
found7 = true
break
case 9:
obj.downloadTotal = enc[1].decode(buf, offset)
offset += enc[1].decode.bytes
found8 = true
break
case 10:
obj.uploadTotal = enc[1].decode(buf, offset)
offset += enc[1].decode.bytes
found9 = true
break
default:
offset = skip(prefix & 7, buf, offset)
}
}
}
}
function defineStat () {
var enc = [
encodings.varint
]
Stat.encodingLength = encodingLength
Stat.encode = encode
Stat.decode = decode
function encodingLength (obj) {
var length = 0
if (!defined(obj.mode)) throw new Error("mode is required")
var len = enc[0].encodingLength(obj.mode)
length += 1 + len
if (defined(obj.uid)) {
var len = enc[0].encodingLength(obj.uid)
length += 1 + len
}
if (defined(obj.gid)) {
var len = enc[0].encodingLength(obj.gid)
length += 1 + len
}
if (defined(obj.size)) {
var len = enc[0].encodingLength(obj.size)
length += 1 + len
}
if (defined(obj.blocks)) {
var len = enc[0].encodingLength(obj.blocks)
length += 1 + len
}
if (defined(obj.offset)) {
var len = enc[0].encodingLength(obj.offset)
length += 1 + len
}
if (defined(obj.byteOffset)) {
var len = enc[0].encodingLength(obj.byteOffset)
length += 1 + len
}
if (defined(obj.mtime)) {
var len = enc[0].encodingLength(obj.mtime)
length += 1 + len
}
if (defined(obj.ctime)) {
var len = enc[0].encodingLength(obj.ctime)
length += 1 + len
}
return length
}
function encode (obj, buf, offset) {
if (!offset) offset = 0
if (!buf) buf = Buffer.allocUnsafe(encodingLength(obj))
var oldOffset = offset
if (!defined(obj.mode)) throw new Error("mode is required")
buf[offset++] = 8
enc[0].encode(obj.mode, buf, offset)
offset += enc[0].encode.bytes
if (defined(obj.uid)) {
buf[offset++] = 16
enc[0].encode(obj.uid, buf, offset)
offset += enc[0].encode.bytes
}
if (defined(obj.gid)) {
buf[offset++] = 24
enc[0].encode(obj.gid, buf, offset)
offset += enc[0].encode.bytes
}
if (defined(obj.size)) {
buf[offset++] = 32
enc[0].encode(obj.size, buf, offset)
offset += enc[0].encode.bytes
}
if (defined(obj.blocks)) {
buf[offset++] = 40
enc[0].encode(obj.blocks, buf, offset)
offset += enc[0].encode.bytes
}
if (defined(obj.offset)) {
buf[offset++] = 48
enc[0].encode(obj.offset, buf, offset)
offset += enc[0].encode.bytes
}
if (defined(obj.byteOffset)) {
buf[offset++] = 56
enc[0].encode(obj.byteOffset, buf, offset)
offset += enc[0].encode.bytes
}
if (defined(obj.mtime)) {
buf[offset++] = 64
enc[0].encode(obj.mtime, buf, offset)
offset += enc[0].encode.bytes
}
if (defined(obj.ctime)) {
buf[offset++] = 72
enc[0].encode(obj.ctime, buf, offset)
offset += enc[0].encode.bytes
}
encode.bytes = offset - oldOffset
return buf
}
function decode (buf, offset, end) {
if (!offset) offset = 0
if (!end) end = buf.length
if (!(end <= buf.length && offset <= buf.length)) throw new Error("Decoded message is not valid")
var oldOffset = offset
var obj = {
mode: 0,
uid: 0,
gid: 0,
size: 0,
blocks: 0,
offset: 0,
byteOffset: 0,
mtime: 0,
ctime: 0
}
var found0 = false
while (true) {
if (end <= offset) {
if (!found0) throw new Error("Decoded message is not valid")
decode.bytes = offset - oldOffset
return obj
}
var prefix = varint.decode(buf, offset)
offset += varint.decode.bytes
var tag = prefix >> 3
switch (tag) {
case 1:
obj.mode = enc[0].decode(buf, offset)
offset += enc[0].decode.bytes
found0 = true
break
case 2:
obj.uid = enc[0].decode(buf, offset)
offset += enc[0].decode.bytes
break
case 3:
obj.gid = enc[0].decode(buf, offset)
offset += enc[0].decode.bytes
break
case 4:
obj.size = enc[0].decode(buf, offset)
offset += enc[0].decode.bytes
break
case 5:
obj.blocks = enc[0].decode(buf, offset)
offset += enc[0].decode.bytes
break
case 6:
obj.offset = enc[0].decode(buf, offset)
offset += enc[0].decode.bytes
break
case 7:
obj.byteOffset = enc[0].decode(buf, offset)
offset += enc[0].decode.bytes
break
case 8:
obj.mtime = enc[0].decode(buf, offset)
offset += enc[0].decode.bytes
break
case 9:
obj.ctime = enc[0].decode(buf, offset)
offset += enc[0].decode.bytes
break
default:
offset = skip(prefix & 7, buf, offset)
}
}
}
}
function defineAnswer () {
var enc = [
encodings.int32,
encodings.string,
Statistics,
Dat,
Stat
]
Answer.encodingLength = encodingLength
Answer.encode = encode
Answer.decode = decode
function encodingLength (obj) {
var length = 0
if (!defined(obj.id)) throw new Error("id is required")
var len = enc[0].encodingLength(obj.id)
length += 1 + len
if (defined(obj.failure)) {
var len = enc[0].encodingLength(obj.failure)
length += 1 + len
}
if (defined(obj.message)) {
var len = enc[1].encodingLength(obj.message)
length += 1 + len
}
if (defined(obj.statistics)) {
var len = enc[2].encodingLength(obj.statistics)
length += varint.encodingLength(len)
length += 1 + len
}
if (defined(obj.list)) {
for (var i = 0; i < obj.list.length; i++) {
if (!defined(obj.list[i])) continue
var len = enc[3].encodingLength(obj.list[i])
length += varint.encodingLength(len)
length += 1 + len
}
}
if (defined(obj.files)) {
for (var i = 0; i < obj.files.length; i++) {
if (!defined(obj.files[i])) continue
var len = enc[1].encodingLength(obj.files[i])
length += 1 + len
}
}
if (defined(obj.key)) {
var len = enc[1].encodingLength(obj.key)
length += 1 + len
}
if (defined(obj.stat)) {
var len = enc[4].encodingLength(obj.stat)
length += varint.encodingLength(len)
length += 1 + len
}
return length
}
function encode (obj, buf, offset) {
if (!offset) offset = 0
if (!buf) buf = Buffer.allocUnsafe(encodingLength(obj))
var oldOffset = offset
if (!defined(obj.id)) throw new Error("id is required")
buf[offset++] = 8
enc[0].encode(obj.id, buf, offset)
offset += enc[0].encode.bytes
if (defined(obj.failure)) {
buf[offset++] = 16
enc[0].encode(obj.failure, buf, offset)
offset += enc[0].encode.bytes
}
if (defined(obj.message)) {
buf[offset++] = 26
enc[1].encode(obj.message, buf, offset)
offset += enc[1].encode.bytes
}
if (defined(obj.statistics)) {
buf[offset++] = 34
varint.encode(enc[2].encodingLength(obj.statistics), buf, offset)
offset += varint.encode.bytes
enc[2].encode(obj.statistics, buf, offset)
offset += enc[2].encode.bytes
}
if (defined(obj.list)) {
for (var i = 0; i < obj.list.length; i++) {
if (!defined(obj.list[i])) continue
buf[offset++] = 42
varint.encode(enc[3].encodingLength(obj.list[i]), buf, offset)
offset += varint.encode.bytes
enc[3].encode(obj.list[i], buf, offset)
offset += enc[3].encode.bytes
}
}
if (defined(obj.files)) {
for (var i = 0; i < obj.files.length; i++) {
if (!defined(obj.files[i])) continue
buf[offset++] = 50
enc[1].encode(obj.files[i], buf, offset)
offset += enc[1].encode.bytes
}
}
if (defined(obj.key)) {
buf[offset++] = 58
enc[1].encode(obj.key, buf, offset)
offset += enc[1].encode.bytes
}
if (defined(obj.stat)) {
buf[offset++] = 66
varint.encode(enc[4].encodingLength(obj.stat), buf, offset)
offset += varint.encode.bytes
enc[4].encode(obj.stat, buf, offset)
offset += enc[4].encode.bytes
}
encode.bytes = offset - oldOffset
return buf
}
function decode (buf, offset, end) {
if (!offset) offset = 0
if (!end) end = buf.length
if (!(end <= buf.length && offset <= buf.length)) throw new Error("Decoded message is not valid")
var oldOffset = offset
var obj = {
id: 0,
failure: 0,
message: "",
statistics: null,
list: [],
files: [],
key: "",
stat: null
}
var found0 = false
while (true) {
if (end <= offset) {
if (!found0) throw new Error("Decoded message is not valid")
decode.bytes = offset - oldOffset
return obj
}
var prefix = varint.decode(buf, offset)
offset += varint.decode.bytes
var tag = prefix >> 3
switch (tag) {
case 1:
obj.id = enc[0].decode(buf, offset)
offset += enc[0].decode.bytes
found0 = true
break
case 2:
obj.failure = enc[0].decode(buf, offset)
offset += enc[0].decode.bytes
break
case 3:
obj.message = enc[1].decode(buf, offset)
offset += enc[1].decode.bytes
break
case 4:
var len = varint.decode(buf, offset)
offset += varint.decode.bytes
obj.statistics = enc[2].decode(buf, offset, offset + len)
offset += enc[2].decode.bytes
break
case 5:
var len = varint.decode(buf, offset)
offset += varint.decode.bytes
obj.list.push(enc[3].decode(buf, offset, offset + len))
offset += enc[3].decode.bytes
break
case 6:
obj.files.push(enc[1].decode(buf, offset))
offset += enc[1].decode.bytes
break
case 7:
obj.key = enc[1].decode(buf, offset)
offset += enc[1].decode.bytes
break
case 8:
var len = varint.decode(buf, offset)
offset += varint.decode.bytes
obj.stat = enc[4].decode(buf, offset, offset + len)
offset += enc[4].decode.bytes
break
default:
offset = skip(prefix & 7, buf, offset)
}
}
}
}
function defined (val) {
return val !== null && val !== undefined && (typeof val !== 'number' || !isNaN(val))
}
|
javascript
|
*{
padding: 0;
margin: 0;
box-sizing: border-box;
}
html,body{
height: 100%;
}
body {
background: #000;
color: #fff;
text-align: center;
font: 14px "Lucida Grande", Helvetica, Arial, sans-serif;
}
header,
.left,
.right{
position: absolute;
}
header{
left: 10px;
top: 10px;
right: 10px;
height: 150px;
border:1px solid #fff;
}
header h1{
font-size: 40px;
height: 60px;
line-height: 60px;
}
header #cst{
margin-top: 0 auto;
border:1px solid #fff;
border-radius: 5px;
line-height: 25px;
display: inline-block;
}
header #cst button{
float: left;
height: 30px;
line-height: 30px;
width: 60px;
cursor: pointer;
background: #555;
color: #fff;
}
header #cst button:disabled{
background: #fff;
color: #000;
font-weight: bold;
}
header .type{
display: inline-block;
margin: 0 auto;
border: 1px solid #fff;
list-style: none;
border-radius: 5px;
}
header .type li{
float: left;
height: 30px;
line-height: 30px;
width: 80px;
cursor: pointer;
}
header .type li.dided{
background: #fff;
color: #000;
}
li{
display: list-item;
text-align: -webkit-match-parent;
}
.left{
left:10px;
top: 170px;
bottom: 10px;
width: 15%;
border: 1px solid #fff;
overflow: auto;
}
.left .music-add{
border:1px solid #fff;
font-size: 20px;
font-family: Arial;
font-weight: bold;
background: #fff;
color: #000;
width: 100%;
}
.left .upload{
display: none;
}
.left ul{
overflow: hidden;
}
.left .music-add,ul li{
height: 30px;
line-height: 30px;
cursor: pointer;
overflow: hidden;
white-space: nowrap;
text-overflow: ellipsis;
}
.selected{
color: green;
}
.right{
top: 170px;
right: 10px;
bottom: 10px;
left: calc(15% + 20px);
left: -webkit-calc(15% + 20px);
}
input[type="range"]{
-webkit-appearance:none;
height: 8px;
background: #999;
border-radius: 10px;
outline: none;
}
input[type="range"]::-webkit-slider-thumb{
-webkit-appearance:none;
height: 12px;
width: 12px;
background: #fff;
border-radius: 100%;
}
input[type="range"]::-moz-range-track{
height: 8px;
background: #999;
border-radius: 10px;
border: none;
}
input[type="range"]::-moz-range-thumb{
height: 12px;
width: 12px;
background: #fff;
border: none;
border-radius: 100%;
}
@media screen and (max-width: 800px), screen and (max-height:500px ){
body{
font-size: 12px;
}
header{
height: 100px;
}
header h1{
font-size: 24px;
height: 34px;
line-height: 34px;
}
header .type li{
height: 16px;
line-height: 16px;
width: 50px;
}
header #cst button{
height: 18px;
line-height: 18px;
width: 50px;
}
.left,.right{
top: 120px;
}
}
|
css
|
Will new tattooed, drug addicted TV version of Sherlock Holmes turn off die-hard fans?
In the new CBS show “Elementary” debuting 10 p. m. Sept. 27, Sherlock Holmes has at least four tattoos, including a half-sleeve on his left arm. He wears a t-shirt that states “I am not lucky, I am good,” needs a shave and has sex with a prostitute that probably (gasp! ) included handcuffs.
But regardless of looks and a move to New York City, in the pilot he appears to be essentially the same often annoying consulting detective Arthur Conan Doyle introduced to the world in 1887.
This contemporary Holmes, like the buff version Robert Downey Jr. played in the WB action movies, and the tech savvy version Benedict Cumberbatch essays for BBC’s “Sherlock,” is another creation for a public that can’t get enough of this eccentric Englishman.
But will it turn off die-hard fans, some of whom thought Downey Jr. ’s version was nothing more than an action-packed thriller having nothing to do with Doyle's creation?
One who definitely takes exception is Susan Diamond, a Baker Street Irregular and Holmes traditionalist who lives in Chicago.
She concedes Jude Law is a credible Watson, but she finds the films offensive. And she doesn’t buy the idea they will encourage moviegoers to read the books. She does believe BBC's “Sherlock” might send people to the bookstore, but that’s more because the BBC respects literary properties and its show is a clever riff on the canon, but it’s not really about Holmes.
A character that obviously has staying power.
With “Elementary” and “Sherlock” we don’t have to go back in time. We haven’t in a while. Gregory House from Fox’s “House” and Adrian Monk from USA Network’s “Monk” featured brilliant, socially challenged men each of whom has one real friend and solved impossible medical and criminal problems, respectively.
In the “Elementary” pilot, Holmes (Johnny Lee Miller) has just been released from a New York City drug rehab center. His father hires Dr. Joan Watson (Lucy Liu) as his sober companion.
That Watson is an Asian-American woman is thrilling to the Baker Street Babes, a year-old group devoted to all things Sherlockian.
“There are a ton of us all around the world,” says Lyndsay Faye who at 32 is one of its oldest members. The New York City-based writer’s books include the 2009 pastiche “Dust and Shadow,” a story about Holmes and Jack the Ripper. “We have more than 11,000 followers on Tumblr and 7,500 Twitter followers. More than 100,000 people have listened to our podcasts. We love to share Sherlock Holmes in all his various incarnations.
Male or female, old or young, she says if the writing in “Elementary” is snappy and the stories interesting, fans will watch like they did when they bought tickets to see William Gillette on stage as Holmes in the late 19th century, and Basil Rathbone on film in World War II-era English propaganda movies.
She said what keeps everyone coming back is the friendship between Holmes and Watson.
|
english
|
module.exports = {
exec({ $mongo: { $dbPub } }, { redirect }) {
return $dbPub
.collection('redirects')
.findOne({ to: redirect.to, from: redirect.from, domainId: redirect.domainId })
.then(result => {
return !!result;
})
.catch(err => {
throw err;
});
},
};
|
javascript
|
Low eyesight is becoming a common issue among young children these days. Typically, this problem is thought to occur as a result of a poor lifestyle, improper reading, excessive watching of television, or being glued to mobile phones. However, some children are born with eyesight issues. Children with poor vision in their eyes have certain symptoms, according to the American Association for Pediatric Ophthalmology and Strabismus.
The symptoms include difficulty in recognising familiar faces, reading problems, blurred visibility, inability to distinguish between colour and contrast, headache, or redness in the eyes. If not addressed promptly, this can result in blindness. Let’s know the reasons behind low vision among children.
Neurological issues may cause weak eyesight among youngsters. Nerve injury to the areas of the brain that govern vision, for example. In youngsters, damage to the nerves that control their vision can result in weak eyesight and blindness.
If a family member has albinism or retinitis pigmentosa, these hereditary disorders might cause children to have weak eyes and blindness.
Glaucoma, cataracts, retinoblastoma, and retinal illnesses can all affect children, and if not treated early enough, can result in limited vision and irreversible damage to the eyes.
Between the 20th and 40th week of pregnancy, the retina in the baby’s eyes begins to mature. During this time, the child may experience major visual abnormalities as a result of any form of disturbance or premature birth.
Children’s eyes can develop a variety of major disorders as a result of their poor lifestyle, which can eventually lead to reduced vision. For example, poor dietary habits, hours spent watching television, using a cellphone, reading while seated incorrectly, and so on.
Myopia and hypermetropia can develop as a result of these factors, posing a long-term difficulty for the youngster.
If you notice the aforementioned symptoms in children, take them to the doctor for an eye examination.
- Make some modifications to your child’s food and lifestyle to keep their eyes healthy.
- Consume vitamin A-rich foods. Green leafy vegetables, eggs, milk, carrots, yellow or orange vegetables, spinach, sweet potatoes, papayas, curd, and soybeans are examples of foods that are high in antioxidants.
- Consume pulses, dry fruits, and seeds.
- Consume omega-3-rich meals.
- Correct reading and writing habits, such as not reading when sleeping.
- Make sure the room is well-lit while you’re reading. Children should not be allowed to use their phones or watch TV from a close distance.
|
english
|
<reponame>pirsquared314/SpareDuck<gh_stars>1-10
import { Chessground } from 'chessground';
import { toColor, toDests, aiPlay, playOtherSide } from './util';
require('./chessground.styles.css');
import * as Comlink from 'comlink';
const data = require('./db/db');
/*
Chess board interface. Build using Chessground.
https://github.com/ornicar/chessground
*/
const init = async (init_config = {}) => {
// combine fixed params
const { fen, side, playAi } = {
fen: false,
side: 'white',
playAi: true,
//
...init_config,
};
// Add loading spinner
let spinner = document.createElement('div');
spinner.classList.add('spinner');
document.body.appendChild(spinner);
// initialize web worker
const worker = new Worker('./worker.js', { type: 'module' });
const EngineWorker = Comlink.wrap(worker);
const engine_worker = await new EngineWorker(fen);
await engine_worker.init();
const config = {
turnColor: await toColor(engine_worker),
movable: {
color: side, // sets starting color
free: false,
dests: await toDests(engine_worker),
},
orientation: side,
draggable: {
showGhost: true,
},
};
if (fen) {
config.fen = fen;
//await engine_worker.start_from_position(fen);
config.movable.color = fen.includes('w') ? 'white' : 'black';
config.turnColor = config.movable.color;
}
const ground = Chessground(
document.getElementById('chessground-board'),
config,
);
let after = playAi ? aiPlay : playOtherSide;
ground.set({
movable: {
events: {
after: after(ground, engine_worker),
},
},
});
if (side === 'black') {
const open_book = [
['e2', 'e4'],
['d2', 'd4'],
['c2', 'c4'],
['g1', 'f3'],
['a2', 'a4'],
];
const open_move = open_book[Math.floor(Math.random() * open_book.length)];
await engine_worker.make_move(open_move[0], open_move[1], false, 1);
ground.move(open_move[0], open_move[1]);
ground.set({
turnColor: await toColor(engine_worker),
movable: {
color: await toColor(engine_worker),
dests: await toDests(engine_worker),
},
});
}
// initialize buttons
init_buttons(engine_worker, worker);
// remove loading spinner
document.body.removeChild(spinner);
// ui update loop
setInterval(async () => {
// evaluation
const evaluation = await engine_worker.get_engine_evaluation();
let eval_bar = document.getElementById('eval-bar');
const eval_percent = Math.floor(evaluation / 50 + 50);
eval_bar.innerHTML = `<div style='margin-left:2px;'>${evaluation}</div>`;
eval_bar.setAttribute(
'style',
`height: 18px;width: 476px;margin: 12px 0;background:linear-gradient(to right, white ${eval_percent}%, black ${eval_percent}%, black 100%);border: 2px solid black;`,
);
// Principal Variation
let pv_elem = document.getElementById('p-var');
let pv = await engine_worker.get_principal_variation();
pv_elem.innerHTML = 'Principal Variation: ' + pv.join(', ');
return;
}, 500);
};
// initialize button bar
const init_buttons = (engine_worker, worker) => {
// start a new game as white
let handle_white = () => {
worker.terminate();
destroy_buttons();
init();
};
document.getElementById('wht-button').addEventListener('click', handle_white);
// start a new game as black
let handle_black = () => {
worker.terminate();
destroy_buttons();
init({ side: 'black' });
};
document.getElementById('blk-button').addEventListener('click', handle_black);
//start a new game playing against self
let handle_self = () => {
worker.terminate();
destroy_buttons({ playAi: false });
init();
};
document.getElementById('self-button').addEventListener('click', handle_self);
// start from fen position
let handle_fen = () => {
worker.terminate();
const default_fen =
'rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0';
destroy_buttons();
init({ fen: prompt('Input FEN', default_fen) });
};
document.getElementById('fen-button').addEventListener('click', handle_fen);
// run tests from js file
let handle_test = () => {
destroy_buttons();
run_tests(engine_worker);
};
document.getElementById('test-button').addEventListener('click', handle_test);
// remove button listeners
const destroy_buttons = () => {
document
.getElementById('wht-button')
.removeEventListener('click', handle_white);
document
.getElementById('blk-button')
.removeEventListener('click', handle_black);
document
.getElementById('self-button')
.removeEventListener('click', handle_self);
document
.getElementById('fen-button')
.removeEventListener('click', handle_fen);
document
.getElementById('test-button')
.removeEventListener('click', handle_test);
};
};
// Run tests from puzzle DB and show failed FENS
const run_tests = (engine_worker) => {
let fails = [];
data.records.forEach(async (record, hang_is_a_troll) => {
console.log(hang_is_a_troll, record.moves[0]);
let moves = await engine_worker.test_position(
record.fen,
record.moves.shift(),
);
let i = Math.min(moves.length, record.moves.length);
while (i--) {
console.log(moves[i], record.moves[i]);
if (moves[i] !== record.moves[i]) {
fails.push(record.fen);
break;
}
}
});
console.log(fails.length / 100);
let extra_data = document.getElementById('extra-data');
let fail_positions = '<div>Failed positions:</div>';
fails.forEach(
(fail, ind) =>
(fail_positions += `<div style="display:flex;flex-direction:row;text-align: center;">
<p>${fail}</p>
<button id="position-${ind}">Start from FEN</button>
</div>`),
);
extra_data.innerHTML = fail_positions;
fails.forEach((fen, ind) =>
document
.getElementById(`position-${ind}`)
.addEventListener('click', async () => {
await init(fen);
}),
);
return;
};
// Start the program
console.log('hello');
init();
|
javascript
|
WHAT?! Spotify REMOVES Bollywood Songs After Zee Music Fails To Renew Licensing Agreement; Bollywood Fans Express Their Displeasure On Twitter!
In a rather shocking turn of events, music app Spotify was forced to remove their entire catalogue of Bollywood songs from the Zee Music Company after negotiations for a renewal of their licensing agreement failed to go through last week. Bollywood fans and users of Bollywood music took to their social media to voice their displeasure over the move. Many have even threatened to cancel their subscription to the app.
The music company did not renew the licensing agreement with the music app Gaana and cut ties with them in 2022. A few months later, Gaana became a subscription-only service.
The music app has even added a disclaimer on its website that doesn’t provide access to all the music and podcasts in the world. Like the streaming platform Netflix, it negotiates to license deals with publishers and rights owners so their music tracks can be played online, reported Hindustan Times.
Fans stormed Twitter and complained about the move. One user wrote, "is spotify beefing with bollywood why are they taking off almost all the songs what do they have against daaru desi and kala chashma." Another user vented, "Nagada Sang Dhol and a whole litany of Bollywood songs were removed from Spotify and my week is ruined."
While another user told other music listeners, "Another reminder that while streaming can be great and has an important role, it should NEVER be regarded as a replacement for a physical collection #Spotify #Bollywood." "spotify removing all my bollywood bangers is a crime," added yet another Twitter user.
Several iconic songs like Maiyya Mainu from Jersey (2022), Makhna from Drive (2019) and Zaalima from Raees (2017) have all been removed. Soundtracks of the rom-com Veere Di Wedding (2018), the award-winning Gully Boy (2019) and the period drama Kalank (2019) have also been taken down.
|
english
|
{
"name": "simplegui",
"url": "https://github.com/jasonsturges/simplegui-openfl",
"license": "MIT",
"tags": ["openfl", "minimalcomps", "ui-components"],
"description": "OpenFL port of SimpleGUI by <NAME>",
"version": "0.9.0",
"releasenote": "Alpha release",
"contributors": ["jasonsturges"],
"dependencies": {
"openfl": "",
"minimalcomps": ""
}
}
|
json
|
NAIROBI, Kenya Feb 15 – Premier higher education provider United States International University-Africa has introduced new undergraduate, graduate and postgraduate courses to meet evolving market needs, interim Vice-Chancellor Prof. Freida Brown has confirmed.
The courses spread across business management, science and technology, leadership and governance fields will be delivered using contemporary academic models, including online options.
Last year, USIU-Africa secured the Commission for University Education of Kenya (CUE) approval to roll out the new contemporary technology and management sciences degree programs. The approval followed a series of intensive evaluation checks by the CUE and now propels USIU-Africa to the pinnacle of local private higher education institutions providing world-class market-driven degree programs.
Some of the new courses introduced include a Doctor of Philosophy (PhD. ) in Information Science and Technology, an Online Master of Business Administration, Master of Science in Information Science, Bachelor of Global Leadership and Governance, Bachelor of Technology in Analytical Chemistry. Other new courses include Bachelor of Science in Data Science and Analytics, Bachelor of Science in Software Engineering and Bachelor of Science in Applied Biochemistry.
Speaking when she confirmed the launch of the new courses, Prof Freida Brown said the University had invested heavily in the course development and the programs have already kicked-off successfully.
She disclosed that the investments and introduction of the new courses are geared at supplying the international job market with a pool of well-trained candidates proficient in research and information technology applications.
“The world is now a global village, and USIU-Africa is actively revising and improving its academic delivery mission to guarantee our graduates a place in the global job market table,” she assured.
USIU-Africa, she added, had invested in best of class e-learning and global teaching resources to deliver world-class courses locally.
The new courses, she said, have been developed to shape a solid human resource base in Africa with a capacity to contribute to the global science and technology space. “We are training locally for a global market, and we have no doubt that we shall deliver well-equipped graduates ready for the competitive workforce of the future,” she said.
In recent moves, USIU-Africa has heavily invested in the necessary Information Technology (IT) infrastructure to roll-out online learning modules. Through the USIU-Africa Online Directorate, the University is now a member of Quality Matters (QM), a globally recognised organisation that focuses on continuous improvement in online education. USIU-Africa’s accreditation ensures that its online courses and learning process will result in better course design, easier navigation for students, reduced barriers to student achievement that result in better outcomes.
|
english
|
West Indies off-spinner Sunil Narine says he is prepared to make adjustments if the pitches in the upcoming two-Test series against Bangladesh do not offer any assistance.
West Indies off-spinner Sunil Narine says he is prepared to make adjustments if the pitches in the upcoming two-Test series against Bangladesh do not offer any assistance.
Conditions here are typically friendly to slower bowlers but reports indicate the Sher-e-Bangla Stadium pitch at Mirpur has been favourable to fast bowling during two recent domestic, first-class matches, CMC reports.
“There’s no type of pitch I prefer. I just have to concentrate on the areas in which I am bowling, continue working hard on my game, and focus on what my job is to do,” the wily 24-year-old said here Thursday.
The West Indies face Bangladesh in the opening Test in Mirpur starting next Tuesday, before moving to Khulna for the second and final affair.
However, they will enter the series without match practice after the scheduled three-day tour match was reduced to two days before being cancelled because of wet conditions at the BKSP Ground in Savar.
Narine has played only three Tests but is expected to be a key member of the Windies attack. Coming off a solid series against New Zealand in the Caribbean back in July/August, he said he now possessed a clear understanding of what Test cricket required.
“I think it is just the mindset that you adopt and the way you go about what you are doing – just concentrate on the areas where you bowl,” the Trinidadian explained.
|
english
|
Khawaja brought up his fifth half-century in 91-balls, that included seven boundaries past the fence. This is also the first Australian half-centurion of the match. Skipper Smith who missed out on a half-century in the first innings weathered out any thunderbolts Kagiso Radaba and Kyle Abbott were dishing out. Smith used the depth and reach of the crease really well to counter the seam conditions.
The pair added just 42 runs playing 13 overs, which to their credit was one of most fiercest spell of bowling under gloomy conditions. Smith and Khawaja survived almost 8 overs of exceptional seam bowling by Rabada and Abbott before chancing their bat against the spin of Keshav Maharaj, who was an welcome change for them.
Abbott continued to make his outing count as he was drafted in the side for the injured Dale Steyn. Abbott was too good for Khawaja to even have him nick the ball. Abbott even caused trouble for skipper Steven Smih whose shuffling on the crease made him an easy case for leg-before if the ball ever wrapped his pads.
Abbott would have been laughing over how he got the wicket of Warner. Trying to keep the ball down, Warner managed to ricochet the ball off his thigh guard, which lobbed on to his elbow and found his stumps to fall on. Warner played a much more determined and gritty innings than anything in the series so far, finally went for 45 missing his half-century by 5 runs. Rain has played a frustrating part so far in this session with as many as two intervals being taken post-tea.
Warner and Khawaja after the wicket of Joe Burns has weathered the South African storm much to the delight of their team. Warner in particular has looked in command against Philander and Rabada, with both of them getting the better of the batsmen quite a few times; only to miss out on getting the edges. Warner looked to play with a straight bat to anything that was not in the hitting zone. Khawala on the other hand, looked a bit shaky against Philander and Radada getting the away from him. Khawaja battled it hard and could very well be his decisive innings, thus far.
Day Three started with South Africa in a commanding position with a lead of 86 runs over the host’s. Overnight batsmen from Day One, as Temba Bavuma and Quinton de Kock made merry against an unchallenging bowling attack. de Kock after a slow start to his day, went on a rampage en-route his second Test ton. Bavuma, continued to be the calming effect in the 144-run stand, as de Kock went all guns blazing against Australian bowling. de Kock fell 104 runs to Hazlewood.
Post this, there was no stopping Hazlewood, who kept on picking wickets after wickets to grab a 6-for. Hazlewood’s scalps included that of Kyle Abbott and Philander, to add to the tally of de Kock, Hashim Amla and Faf du Plessis. Hazlewood’s figures read 6 for 89, while Mitchell Starc ended with just 3-wickets in his 24 overs. The other wicket to fall was taken by Joe Mennie, his debut wicket, which was of Bavuma for 74.
Brief scores:
Australia 85 all-out (Steven Smith 48*, Joe Mennie 10; Vernon Philander 5 for 21 ) & 121 for 2 (David Warner 45, Usman Khawaja 56* ; Kyle Abbott 2 for 55 ) trail South Africa 326 (Hashim Amla 47, Temba Bavuma 78, Quinton de Kock 104 ; Josh Hazlewood 6 for 89 ) by 120 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
|
What’s the story?
According to The Observer, Ember Moon’s shoulder injury may not be legitimate, but instead is merely a part of a WWE storyline.
The aforementioned kayfabe injury may be a cover for another legitimate injury that will apparently keep her out of action for at least another month.
Ember Moon (Adrienne Reese) is a 10-year veteran of the sport and a former 3-time ACW American Joshi champion.
The 28-year old NXT Superstar was initially scheduled to compete in a Fatal 4-Way match against Ruby Riot, Nikki Cross and Asuka for the latter’s NXT Women’s championship. However, on May 8th, WWE announced via its official website that Moon had suffered a shoulder injury, after being thrown out of the ring by Asuka, thereby removing her from the scheduled championship matchup.
The Observer has noted that WWE’s announcement of Ember Moon’s shoulder injury may be a part of the promotion’s storyline.
Rumours are rife that Moon may have sustained another injury that is likely to take a few weeks to heal, and that the aforementioned announcement by WWE may be a cover-up for this minor injury.
What’s next?
Asuka will defend her NXT Women’s championship against Ruby Riot and Nikki Cross at NXT Takeover: Chicago at the Allstate Arena in Rosemont, Illinois this May 20th.
Ember Moon is likely to be out for at least another month, and fans can expect the Wrestling Goddess to be back in the NXT Women’s title picture on her return.
As a longtime fan of Ember Moon, I’m proud to say that she has been competing as a professional wrestler for a decade now, and in my opinion, the WWE ought to fast-track her to the main roster.
The SmackDown Live Women’s division is in desperate need of a boost, now that Alexa Bliss has been drafted to RAW, and inserting Ember Moon into the WWE’s Tuesday night TV slot, may help provide that much-needed impetus to the blue brand’s female roster. Perhaps, she can be the foil to the Welcoming Committee instead of Charlotte Flair.
|
english
|
Rajasthan Royals will start their campaign against Chennai Super Kings at Sheikh Zayed Stadium Abu Dhabi. Chennai has started with a victory and have a clear idea on what to expect from the pitch so they will be better prepared. Rajasthan Royals would have practised a lot but the actual game time is different from a practice game. They have a good squad and have bought experience and youth in the auction with old horses like Robin Uthappa, Miller and joining them and U19 sensation Yashashvi Jaiswal also being drafted in.
Royals would like to see their foreigners getting their act quickly to lay the foundation for a good total. There is a question mark over Stokes availability and if he doesn’t come then Miller will be required to step up which meant they have to play a bowler short. Buttler would be someone who would be trusted with the responsibility of laying a strong foundation so that likes of Smith, Samson, Parag, Miller will then take the game forward and post a formidable score.
Their fast bowling will be lead by Archer with Unadkat, Varun, Ankit, Thomas and in the spinning department have 3-4 leg spinners and one left-arm finger spinner in Lomror. They have decent bench strength also. All in all, have players to make a challenging first X1. How their management will bring out best in them needs to be seen. They have always been a team to surprise every time and expect the same way this year also.
Chennai on other hand will look to minimise the mistakes of the first game and try to continue winning to give themselves a chance of playoffs. Toss plays a factor so the team that has to defend will have their task cut out. The team that plays well throughout 40 overs will win and as CSK have played at the venue and will be better equipped on assessing the conditions so they start as favourites. But Royals have played as underdogs and can beat anyone on their day.
|
english
|
module.exports = [
{
"name": "<NAME>",
"type": "xa",
"slug": "don-xuan",
"name_with_type": "<NAME>",
"path": "Đôn Xuân, Duyên Hải, Trà Vinh",
"path_with_type": "Xã Đôn Xuân, Huyện Duyên Hải, Tỉnh Trà Vinh",
"code": "29497",
"parent_code": "850"
},
{
"name": "<NAME>",
"type": "xa",
"slug": "don-chau",
"name_with_type": "<NAME>",
"path": "Đôn Châu, Duyên Hải, Trà Vinh",
"path_with_type": "Xã Đôn Châu, Huyện Duyên Hải, Tỉnh Trà Vinh",
"code": "29500",
"parent_code": "850"
},
{
"name": "<NAME>",
"type": "thi-tran",
"slug": "long-thanh",
"name_with_type": "<NAME>",
"path": "Long Thành, Duyên Hải, Trà Vinh",
"path_with_type": "Thị trấn Long Thành, Huyện Duyên Hải, Tỉnh Trà Vinh",
"code": "29513",
"parent_code": "850"
},
{
"name": "<NAME>",
"type": "xa",
"slug": "long-khanh",
"name_with_type": "<NAME>",
"path": "Long Khánh, Duyên Hải, Trà Vinh",
"path_with_type": "Xã Long Khánh, Huyện Duyên Hải, Tỉnh Trà Vinh",
"code": "29521",
"parent_code": "850"
},
{
"name": "<NAME>",
"type": "xa",
"slug": "ngu-lac",
"name_with_type": "<NAME>",
"path": "Ngũ Lạc, Duyên Hải, Trà Vinh",
"path_with_type": "Xã Ngũ Lạc, Huyện Duyên Hải, Tỉnh Trà Vinh",
"code": "29530",
"parent_code": "850"
},
{
"name": "<NAME>",
"type": "xa",
"slug": "long-vinh",
"name_with_type": "<NAME>",
"path": "Long Vĩnh, Duyên Hải, Trà Vinh",
"path_with_type": "Xã Long Vĩnh, Huyện Duyên Hải, Tỉnh Trà Vinh",
"code": "29533",
"parent_code": "850"
},
{
"name": "<NAME>",
"type": "xa",
"slug": "dong-hai",
"name_with_type": "<NAME>",
"path": "Đông Hải, Duyên Hải, Trà Vinh",
"path_with_type": "Xã Đông Hải, Huyện Duyên Hải, Tỉnh Trà Vinh",
"code": "29536",
"parent_code": "850"
}
]
|
javascript
|
Mumbai City FC are delighted to confirm that the club has agreed a deal with Kerala Blasters FC for the transfer of defender Sanjeev Stalin for an undisclosed transfer fee. The 21-year-old joins the Islanders on a four-year contract until May 2026.
A product of Chandigarh Football Academy, Stalin rose through the ranks of the AIFF Elite Academy and went on to represent India at the 2017 FIFA U-17 World Cup. He also represented India at the U-20 level.
Thereafter, he featured for I-league side Indian Arrows, making 28 appearances in two seasons. He then moved to Portugal in 2019, where he played for Deportivo Aves U-23 side and had a loan stint with the third division club Sertanense.
The Bengaluru-born player joined Kerala Blasters in March 2021 and made his debut for the club at the 2021 Durand Cup. He made eight appearances in his debut ISL campaign in the 2021-22 season.
It’s a big step for me to join Mumbai City at this stage of my career but it’s one that I am confident about. When the opportunity to join one of the biggest clubs in India came knocking, I knew I had to grab it with both hands. I am looking forward to learning from my peers, seniors and coach Des Buckingham. I also would like to thank the Mumbai City management for showing faith in me and providing me with this wonderful opportunity and I cannot wait to get started and repay the trust put in me by the club and the fans.
Sanjeev is certainly one of the most exciting talents in the country. He possesses excellent qualities and can add a lot to our squad. At just 21, he’s not only played at the highest level in India but has the invaluable experience of playing in Europe as well. We think Sanjeev can go on to become an important player, not just for Mumbai City but for the national set up as well and I wish him the very best.
For more football updates, follow Khel Now on Twitter, and Instagram and join our community on Telegram.
|
english
|
India has an ancient heritage of education. The ancestry of Vedic teaching and learning is a superb example of this. The type and extent of education that had taken place in India is astounding. Variety and vastness are both wedded to Indian education. This is easily experienced by glancing through the Vedic literature. Above this, its greatest uniqueness is that it is not lopsided or partial but it is all-round and complete. It is not fruitless or only fruitful to some extent, but it bears eternal fruits. This is because it is alive, alive with adhyãtmavidyã, alive with brahmavidyã.
Let us take a glimpse at this interesting Vedic education by pondering over the Taittireeya Upanishad.
The Taittireeya Upanishad:
This Upanishad is encompassed in the Krishna Yajur Veda. This Upanishad is recited as part of the Taittireeya Aranyaka in the Taittireeya shãkhã (branch). Hence this Upanishad is also called the Taittireeya Upanishad. The Taittireeya Upanishad is split into three sections, each called a ‘valli’. The first of these is the Shikshãvalli, the second the Ãnandvalli, and the third the Bhruguvalli. Let us see the precepts and essence of all of these three vallis.
The Shikshavalli:
The Taittireeya Upanishad commences trumpeting the words of the Shikshãvalli – ‘शन्नो मित्रः शं वरुणः। शन्नो भवत्वर्यमा। शन्न इन्द्रो बृहस्पतिः। शन्नो विष्णुरुरुक्रमः।’ – ‘Shanno mitraha sham Varunaha, shanno bhavatvaryamã, shanna Indro Brushaspitihi, shanno Vishnururukramaha’ (Taittireeya Upanishad: 1/1). These are the words of the preceptors praying for peace before giving their precepts. It is a request for bliss and peace everywhere. Let the devas, like Mitra, Varuna, Aryamã, Bruhaspati and others, who have been appointed by Paramãtmã to manage creation, be a source of happiness for us and shower peace everywhere. This prayer to Paramãtmã at the onset of this Upanishad asks for the good of the whole of creation. This is the great and unique quality of Indian spiritual thought. The elimination of everyone’s every misery, the experience of utmost bliss, the attainment of utmost peace – this has been the direction of Hindu Sanatan thinking.
Now let us see another message of this mantra.
‘नमो ब्रह्मणे’ – ‘Namo Brahmane’ – ‘I bow to Brahman’ (Taittireeya Upanishad: 1/1). Using just the one word, ‘Brahmane’, the preceptor rishi bows to the two divine entities Aksharbrahman and Parabrahman. The reason for this is that later in this Upanishad statements like ‘Brahmavidãpnoti Param’ (Taittireeya Upanishad: 2/1) and ‘Satyam jnãnam anantam Brahma’ (Taittireeya Upanishad: 2/1) refer to Aksharbrahman using the word ‘Brahman’, whereas statements like ‘Ãnando Brahmeti vyajãnãt’ (Taittireeya Upanishad: 3/6) refer to Parabrahman using the word ‘Brahman’. Thus using the common word ‘Brahman’ for both Aksharbrahman and Parabrahman, the rishi bows with both these divine entities in mind using the words ‘Namo Brahmane’ – ‘I bow to Akshar-Purushottam’.
The reason for this bow is understandable. Upanishads are the shastras for brahmavidyã. The Upanishads themselves define brahmavidyã – ‘येनाऽक्षरं पुरुषं वेद सत्यं प्रोवाच तां तत्त्वतो ब्रह्मविद्याम्।’ – ‘Yenã’ksharam purusham veda satyam provãcha tãm tattvato brahmavidyãm’ – ‘That by which Akshar, i.e., Aksharbrahman, and Purush, i.e., Parabrahman, are known in their essence is called brahmavidyã’ (Mundaka Upanishad: 1/2/13). For this reason, in the Taittireeya Upanishad, both these divine entities of brahmavidyã have been remembered and offered obeisance before precepts on brahmavidyã commence.
After bowing, homage is now paid. ‘त्वमेव प्रत्यक्षं ब्रह्मासि’ – ‘Tvameva pratyaksham Brahmãsi’ (Taittireeya Upanishad: 1/1). The manifestation of both Aksharbrahman and Parabrahman is indicated here. This feeling of manifestation should be developed towards the Gunãtit guru, and be repeatedly strengthened. The guru himself is Aksharbrahman, and Parabrahman continuously resides within him. Thus, this sentence implies that we should serve the manifest guru with supreme divinity, for he is the manifest form of Aksharbrahman and Parabrahman.
In this prayer for peace, we also experience the noble conduct of the teaching rishi.
To speak the truth is the first necessity of a preceptor, tutor or teacher. ‘ऋतं वदिष्यामि। सत्यं वदिष्यामि।’ – ‘Rutam vadishyãmi; Satyam vadishyãmi’ – ‘I will only speak eternal principles. I will speak the truth (i.e., I will not teach false principles)’ (Taittireeya Upanishad: 1/1). With these words the rishi has vowed to speak the truth. Here, the rishi is a preceptor, a tutor, a teacher and it is his duty to teach. To lie is a sin, but to teach a lie would be a grave sin. This is a special feature of Vedic guru-shishya dialogues. The teacher understands his responsibility to the disciple and to society. He understands his duty. He is fully aware of how much a defiled education can ravage a disciple’s life, and affect the whole of society.
Moreover, an honest person must be tolerant. He knows that he must bear the occasional hostile reactions of speaking the truth. For this very reason, knowing the continual necessity of such honest and tolerant preceptors in society, the tutoring rishi prays, ‘तन्मामवतु। तद्वक्तारमवतु। अवतु माम्। अवतु वक्तारम्।’ ‘Tanmãmavatu; tadvaktãramavatu; avatu mãm; avatu vaktãram;’ – ‘O Lord! Save me. Save the orator, the teacher’ (Taittireeya Upanishad: 1/1). Thus, the reason for praying for one’s safety is ultimately just to keep society well educated.
Thus, this mantra shows the ideal approach a teacher should have before commencing his lesson.
A Special Meaning of the word 'Shiksha'
Here, ‘shikshã’ doesn’t mean punishment, but education, and even in that, a special type of education – education that is useful in the study of the Vedas. Our Vedas are an ocean of special knowledge. To be a true scientist, one must study them in detail. To study them, they must first be looked after.
As per our ancient traditions, a special method for preserving the Vedas as they are has been practiced. This method is one of systematic pronunciation and repetition. Thousands of years ago, when writing was not well established, our Vedas were preserved by this pronounce and repeat method of recitation. The fruits of this ancient tradition are the immense collection of authentic mantras we find in the Vedas today. The science that thoroughly explains this method of pronunciation and repetition is ‘shikshã’. This is explained in this Upanishad. ‘शीक्षां व्याख्यास्यामः’ – ‘Sheekshãm vyãkhyãsyãmaha’ – ‘Now we will explain shikshã’ (Taittireeya Upanishad: 1/2). With this proposition, the rishi lists the main topics of shikshã: ‘वर्णः स्वरः। मात्रा बलम्। साम सन्तानः। इत्युक्तः शीक्षाध्यायः।’ ‘Varnaha svaraha; matrã balam; sãma santãnaha; ityuktaha sheekshãdhyãyaha’ (Taittireeya Upanishad: 1/2). Varnaha means letters. This includes vowels such as ‘अ - a’, ‘इ - i’, ‘उ - u’, ‘ऋ - ru’, etc. and consonants such as ‘क - ka’, ‘ख - kha’, ‘ग - ga’, ‘घ - gha’, etc. So that the mantras of the Vedas can be pronounced properly, the shikshã texts first explain which part of the mouth or throat the vowels and consonants originate, as well as how they originate, and what their true pronunciation really is.
Svaraha means tone. Along with the pronunciation of the mantras, there is an amazing system of tones to enable the singing of the mantras.
Mãtrã means duration. Here, the duration for which the vowels in the Vedic mantras should be sounded is explained. Durations such as hrasva (short) and deergha (long) indicate the length of pronunciation.
Balam means the force with which the letters in the mantra should be said.
Sãma means the similarity of the pronunciation of the letters.
Santãnaha means the system for pronouncing the words according to their order. This is also known as sanhitã.
In this way, the Vedic shikshã texts give a detailed explanation of the aspects of pronunciation of the Vedic mantras that should be taken into consideration.
Naturally, one may question the necessity of this entire system for just the pronunciation of the Vedas. The answer is simple. Our Vedas are not ordinary books, they are divine shastras. We will find the answer to our question if we think back to thousands of years ago when there was no method of preserving or protecting knowledge by writing it down. The Vedas are an ocean of eternal principles. Each sentence is an eternal principle. In order to preserve these principles, our ancestors felt it necessary to first pronounce them properly, since the Vedas are recited as mantras. Vedic mantras are composed from words. And words are composed from letters. If the pronunciation or order of the words of the mantras is changed, then principles may be changed or lost. For this reason, the Vedic schools first taught their students about shikshã.
Thus, in the Taittireeya Upanishad, a proper explanation of shikshã, which is useful for studying the Vedas, has been given. That is why this part of the Upanishad is called the Shikshãvalli.
Sadhu Bhadreshdas, Ph. D., D.Litt.
|
english
|
This abuse of power has gone on for far too long. As a law abiding citizen who happens to also be a black man. I personally shouldn’t have to fear that if I accidentally run a red light that I could end up dead and not make it home to my family. We cannot and will not continue to endure such trauma at the very hands of those who swore to protect and serve. It has happened so many times that it’s becoming the norm to see an unarmed black man killed by police and no justice being served. The punishment of losing your job or going on administrative leave for brutally killing someone does not fit the crime.
|
english
|
<gh_stars>0
export declare class PostUpdateInput {
content?: string | undefined;
published?: boolean | undefined;
title?: string | undefined;
image?: string | undefined;
}
|
typescript
|
<filename>Old_Exams/Books.py
class BookStore:
def __init__(self, book):
self.booklst = book
class Book:
def __init__(self, title, author, chapter, price):
self.title = title
self.author = author
self.chapter = list(chapter)
self.price = int(price)
book1 = Book("<NAME>", "Tangra", ['1', '3', '4', '2'], 1)
book2 = Book("<NAME>", "Vitosha", ['12', '123', '55', '22'], 2)
book3 = Book("<NAME>", "StaraPlanina", ['155', '33', '41', '245'], 3)
lst_book = [book1, book2, book3]
bookstor = BookStore(lst_book)
|
python
|
<gh_stars>100-1000
package mock
import (
"container/heap"
"encoding/json"
"fmt"
"math"
"sync"
"time"
"euphoria.io/heim/proto/jobs"
"euphoria.io/heim/proto/snowflake"
"euphoria.io/scope"
)
type JobService struct {
m sync.Mutex
qs map[string]*JobQueue
}
func (js *JobService) GetQueue(ctx scope.Context, name string) (jobs.JobQueue, error) {
js.m.Lock()
defer js.m.Unlock()
if jq, ok := js.qs[name]; ok {
return jq, nil
}
if js.qs == nil {
js.qs = map[string]*JobQueue{}
}
jq := &JobQueue{name: name}
jq.c = sync.NewCond(&jq.m)
js.qs[name] = jq
return jq, nil
}
type entry struct {
jobs.Job
claimed time.Time
}
type jobHeap []entry
func (es jobHeap) Len() int { return len(es) }
func (es jobHeap) Less(i, j int) bool { return es[i].Due.Before(es[j].Due) }
func (es jobHeap) Swap(i, j int) { es[j], es[i] = es[i], es[j] }
func (es *jobHeap) Push(x interface{}) { *es = append(*es, x.(entry)) }
func (es *jobHeap) Pop() interface{} {
final := (*es)[len(*es)-1]
*es = (*es)[:len(*es)-1]
return final
}
type JobQueue struct {
m sync.Mutex
c *sync.Cond
name string
available jobHeap
working jobHeap
logs map[snowflake.Snowflake]map[int32]*jobs.JobLog
}
func (jq *JobQueue) Name() string { return jq.name }
func (jq *JobQueue) newJob(jobType jobs.JobType, payload interface{}, options ...jobs.JobOption) (*jobs.Job, error) {
jobID, err := snowflake.New()
if err != nil {
return nil, err
}
now := time.Now()
job := &jobs.Job{
ID: jobID,
Type: jobType,
Created: now,
Due: now,
AttemptsRemaining: math.MaxInt32,
MaxWorkDuration: jobs.DefaultMaxWorkDuration,
}
data, err := json.Marshal(payload)
if err != nil {
return nil, err
}
if err := job.Data.UnmarshalJSON(data); err != nil {
return nil, err
}
for _, option := range options {
if err := option.Apply(job); err != nil {
return nil, err
}
}
return job, nil
}
func (jq *JobQueue) Add(
ctx scope.Context, jobType jobs.JobType, payload interface{}, options ...jobs.JobOption) (
snowflake.Snowflake, error) {
job, err := jq.newJob(jobType, payload, options...)
if err != nil {
return 0, err
}
jq.m.Lock()
heap.Push(&jq.available, entry{Job: *job})
if jq.c != nil {
jq.c.Signal()
}
jq.m.Unlock()
return job.ID, nil
}
func (jq *JobQueue) AddAndClaim(
ctx scope.Context, jobType jobs.JobType, payload interface{}, handlerID string, options ...jobs.JobOption) (
*jobs.Job, error) {
job, err := jq.newJob(jobType, payload, options...)
if err != nil {
return nil, err
}
job.AttemptsMade = 1
job.AttemptsRemaining -= 1
job.JobClaim = &jobs.JobClaim{
JobID: job.ID,
HandlerID: handlerID,
AttemptNumber: 0,
Queue: jq,
}
e := entry{
Job: *job,
claimed: job.Created,
}
jq.m.Lock()
heap.Push(&jq.working, e)
jq.m.Unlock()
return job, nil
}
func (jq *JobQueue) Complete(ctx scope.Context, jobID snowflake.Snowflake, handlerID string, attempt int32, log []byte) error {
jq.m.Lock()
defer jq.m.Unlock()
if jq.logs == nil {
jq.logs = map[snowflake.Snowflake]map[int32]*jobs.JobLog{}
}
if jq.logs[jobID] == nil {
jq.logs[jobID] = map[int32]*jobs.JobLog{}
}
jq.logs[jobID][attempt] = &jobs.JobLog{
AttemptNumber: attempt,
HandlerID: handlerID,
Success: true,
Log: log,
}
return jq.remove(jobID, nil)
}
func (jq *JobQueue) Fail(ctx scope.Context, jobID snowflake.Snowflake, handlerID string, attempt int32, reason string, log []byte) error {
jq.m.Lock()
defer jq.m.Unlock()
if jq.logs == nil {
jq.logs = map[snowflake.Snowflake]map[int32]*jobs.JobLog{}
}
if jq.logs[jobID] == nil {
jq.logs[jobID] = map[int32]*jobs.JobLog{}
}
jq.logs[jobID][attempt] = &jobs.JobLog{
AttemptNumber: attempt,
HandlerID: handlerID,
FailureReason: reason,
Log: log,
}
jq.release(jobID, 0)
jq.c.Signal()
return nil
}
func (jq *JobQueue) Cancel(ctx scope.Context, jobID snowflake.Snowflake) error {
jq.m.Lock()
defer jq.m.Unlock()
return jq.remove(jobID, jobs.ErrJobCancelled)
}
func (jq *JobQueue) release(jobID snowflake.Snowflake, penalty int32) {
for i, entry := range jq.working {
if entry.ID == jobID {
heap.Remove(&jq.working, i)
entry.AttemptsRemaining += penalty
entry.AttemptsMade = entry.JobClaim.AttemptNumber
entry.JobClaim = nil
heap.Push(&jq.available, entry)
return
}
}
}
func (jq *JobQueue) remove(jobID snowflake.Snowflake, err error) error {
for i, entry := range jq.working {
if entry.ID == jobID {
heap.Remove(&jq.working, i)
return nil
}
}
for i, entry := range jq.available {
if entry.ID == jobID {
heap.Remove(&jq.available, i)
return nil
}
}
return jobs.ErrJobNotFound
}
func (jq *JobQueue) Stats(ctx scope.Context) (jobs.JobQueueStats, error) {
jq.m.Lock()
defer jq.m.Unlock()
now := time.Now()
stats := jobs.JobQueueStats{}
for _, entry := range jq.available {
stats.Waiting++
if !now.Before(entry.Due) {
stats.Due++
}
}
for _, entry := range jq.working {
if now.Before(entry.claimed.Add(entry.MaxWorkDuration)) {
stats.Claimed++
} else {
stats.Waiting++
}
if !now.Before(entry.Due) {
stats.Due++
}
}
return stats, nil
}
func (jq *JobQueue) WaitForJob(ctx scope.Context) error {
ch := make(chan error)
go func() {
jq.m.Lock()
jq.c.Wait()
jq.m.Unlock()
ch <- nil
}()
select {
case <-ctx.Done():
jq.m.Lock()
jq.c.Broadcast()
jq.m.Unlock()
<-ch
return ctx.Err()
case err := <-ch:
return err
}
}
func (jq *JobQueue) TryClaim(ctx scope.Context, handlerID string) (*jobs.Job, error) {
jq.m.Lock()
defer jq.m.Unlock()
if len(jq.available) == 0 {
return nil, jobs.ErrJobNotFound
}
e := heap.Pop(&jq.available).(entry)
e.AttemptsRemaining -= 1
e.JobClaim = &jobs.JobClaim{
JobID: e.ID,
HandlerID: handlerID,
AttemptNumber: e.AttemptsMade + 1,
Queue: jq,
}
ret := &jobs.Job{}
*ret = e.Job
e.claimed = time.Now()
e.AttemptsMade += 1
heap.Push(&jq.working, e)
return &e.Job, nil
}
func (jq *JobQueue) TrySteal(ctx scope.Context, handlerID string) (*jobs.Job, error) {
jq.m.Lock()
defer jq.m.Unlock()
var maxOverrun time.Duration
idx := -1
now := time.Now()
for i, entry := range jq.working {
if entry.JobClaim.HandlerID == handlerID {
continue
}
overrun := now.Sub(entry.claimed) - entry.MaxWorkDuration
if overrun < 0 {
continue
}
if idx < 0 || overrun > maxOverrun {
idx = i
maxOverrun = overrun
}
}
if idx < 0 {
return nil, jobs.ErrJobNotFound
}
jobID := jq.working[idx].ID
jq.release(jobID, 0)
for i, entry := range jq.available {
if entry.ID == jobID {
heap.Remove(&jq.available, i)
entry.claimed = now
entry.AttemptsMade += 1
entry.AttemptsRemaining -= 1
entry.JobClaim = &jobs.JobClaim{
JobID: entry.ID,
HandlerID: handlerID,
AttemptNumber: entry.AttemptsMade + 1,
Queue: jq,
}
heap.Push(&jq.working, entry)
return &entry.Job, nil
}
}
return nil, fmt.Errorf("job disappeared")
}
func (jq *JobQueue) Log(ctx scope.Context, jobID snowflake.Snowflake, attempt int32) (*jobs.JobLog, error) {
logs, ok := jq.logs[jobID]
if !ok {
return nil, jobs.ErrJobNotFound
}
jl, ok := logs[attempt]
if !ok {
return nil, jobs.ErrJobNotFound
}
return jl, nil
}
|
go
|
Kevin Pietersen slams Donald Trump: The former English cricketer took a dig at the US President for mispronouncing names.
US President Donald Trump’s attempt of giving references of legendary Indian cricketers such as Sachin Tendulkar and Virat Kohli in his speech at the Motera Stadium in Ahmedabad has put him in hot water across social media platforms.
Trump, who ended up mispronouncing the names of both the cricketers, received severe criticism regarding lack of research on his part before his speech. Even International Cricket Council took to their Twitter account to take a dig at Trump regarding the same matter.
Apart from ICC, Trump also faced criticism from former England cricketer Kevin Pietersen who also retweeted a video where Trump takes the names of Tendulkar and Kohli and expressed his views.
How Twitterati reacted on Trump mispronouncing names:
It is worth mentioning that Trump landed in India yesterday afternoon in Ahmedabad. Trump and India Prime Minister Narendra Modi have held talks regarding bilateral ties, including the key areas of defence, security and trade and investment.
|
english
|
Valerie Bertinelli, the beloved television personality and chef, has been delighting audiences with her mouthwatering recipes on Valerie’s Home Cooking. Her comforting flavors and down-to-earth approach make her a favorite among home cooks and food enthusiasts. With Valerie’s delicious recipes, you can create comforting and satisfying meals, while also reaping some incredible health benefits. Let’s dive into the world of Valerie’s Home Cooking and discover how her recipes can enhance your culinary experience.
Health Benefits:
1. Fresh and Wholesome Ingredients: Valerie emphasizes the importance of using fresh, high-quality ingredients. Her recipes often feature an abundance of fruits, vegetables, lean proteins, and whole grains. By incorporating these natural and unprocessed foods into your diet, you not only enhance the flavor but also receive essential vitamins, minerals, and antioxidants.
2. Portion Control: Valerie’s Home Cooking recipes are designed to help you maintain a healthy lifestyle while enjoying delicious meals. Many recipes offer portion-controlled servings, ensuring you can indulge without going overboard. This thoughtful approach helps to prevent overeating and maintain a balanced diet.
3. Reduced Sodium and Sugar: Valerie understands the impact of excessive sodium and sugar on our health. Her recipes often provide alternatives and tips to reduce the amount of these ingredients without compromising taste. By making small changes, you can lower your intake of these harmful substances and improve your overall well-being.
4. Promotes Cooking at Home: With Valerie’s recipes, cooking at home becomes an enjoyable experience. By preparing meals in your own kitchen, you have full control over ingredients and cooking methods. This not only avoids unnecessary additives and preservatives found in packaged meals but also allows you to tailor the recipes to suit your dietary needs and preferences.
5. Encourages Family and Social Connections: Valerie’s Home Cooking places a strong emphasis on the joy of cooking and eating together with loved ones. Sharing meals with family and friends has been shown to strengthen bonds and promote healthier eating habits. By using Valerie’s recipes, you can create memorable moments around the dining table that nourish both your body and soul.
1. Are Valerie’s Home Cooking recipes suitable for vegetarians or those with dietary restrictions?
Yes, Valerie’s Home Cooking offers a wide range of recipes suitable for vegetarians and those with various dietary restrictions. Valerie understands the importance of catering to different dietary needs and often provides alternative ingredient options or tips to make the recipes more inclusive.
2. Can I find Valerie’s Home Cooking recipes online?
Yes, Valerie’s Home Cooking recipes are available on her official website, various online platforms, and in her cookbooks. You can find a vast collection of recipes featuring different cuisines and flavors to suit your preferences.
3. Are Valerie’s recipes easy to follow for beginners?
Absolutely! Valerie’s Home Cooking recipes are known for their simplicity and ease of preparation. She strives to make cooking accessible to everyone, from seasoned chefs to novices in the kitchen. Each recipe is carefully explained, with step-by-step instructions, making them perfect for beginners.
4. Can I make Valerie’s Home Cooking recipes in advance?
Yes, many of Valerie’s recipes can be prepared in advance. She often provides tips for meal preparation, including make-ahead instructions or suggestions for storing leftovers. This makes it easier to plan your meals ahead of time and ensures you can enjoy her comforting flavors even on busy days.
5. Can I modify Valerie’s Home Cooking recipes to accommodate allergies?
Absolutely! Valerie encourages her followers to adapt the recipes according to their dietary needs and allergies. She often provides substitutes or alternatives for ingredients that commonly cause allergies or sensitivities. Feel free to experiment and make the necessary changes to suit your specific requirements.
In conclusion, Valerie’s Home Cooking recipes offer a delightful culinary experience while also promoting health and well-being. With a focus on fresh ingredients, portion control, and reducing the usage of sodium and sugar, her recipes are not only comforting but also beneficial for your overall health. By following her easy-to-understand instructions, even beginners can create delicious meals that cater to various dietary restrictions. So, why not embark on a journey to experience the comforting flavors of Valerie’s Home Cooking and elevate your cooking skills in the process?
|
english
|
4) When Rahul ‘THE WALL’ Dravid reminded Nasser Hussain of a “rule” that England cricket would want to break.
Nasser Hussain: Have your boys peaked too early, Rahul?
Rahul Dravid: Better to peak early than not peak at all. You have to peak early to make the quarters actually. That’s sort of the rule of the tournament.
Shane Warne, who was also in the commentary box, joined them.
Warne: You expected that answer, didn’t you Nasser ?
Nasser: From you maybe, not from the nicest man in world cricket.
Rahul: I was sledged all along in the last commentary stint in about 2007, just itching to give it back. Sorry Nasser.
Dada smiled and said: “The Entire Ground Belongs to me Ravi”.
|
english
|
{"ajv.bundle.js":"sha256-wtq7gh9DsMlF1LEjSH8JQHEg5tK5urnpXTCb/gO9YqI=","ajv.min.js":"sha256-Mm8s22UDdG1Unu4EmSdDHAdEx0UnrmpvkcVkHJbR7eM=","nodent.min.js":"sha256-B2Xnh3eR1WpldJfQCVawgSOXUdn+BrN0FEEid6jlLPs=","regenerator.min.js":"sha256-9XVrVQby37fJZplIS1iN7TXU9hTDMkQCQQnnMZ9YRXY="}
|
json
|
Are you a goal setter?
Do you like setting intentions or goals for your day, week or year?
If you're a frequent listener of the Love Your Life Show, I'll bet you do.
Which is why I'm super excited to bring this concept that I first heard of from business coach Dan Sullivan and author, Ben Hardy.
Don't run away though - this concept is one I use in my everyday life, as a mom, a wife, a high achieving woman, to feel more life satisfaction. Listen in because it works!!!
The post Gap Versus Gain Thinking appeared first on Susie Pettit.
|
english
|
The thrashing by English batsmen in a T20 International and two ODIs has alarmed the selectors, who were initially not keen on picking Aamir for the showpiece owing to a lack of form.
Though Aamir is suspected to be suffering from chicken pox and is to have a medical examination done in London, it is believed that the team management, including captain Sarfaraz Ahmed and head coach Mickey Arthur, expressed confidence in the bowler and allowed him time to recover.
“The chief selector Inzamam-ul-Haq is also in agreement with the team management but he wants to first be sure Aamir can be fit by the time the World Cup starts from May 30,” the source said.
He said the team management and chief selector are now awaiting the medical report of Aamir who was sent to London to stay with his in-laws after it first emerged he might have contracted chicken pox.
“If the cricket board confirms that Aamir can make a recovery in two weeks time, the management and chief selector will want him in the World Cup squad,” the source said.
“They are also keeping a close look at Asif Ali who has scored two successive half-centuries in the ODIs and if he continues his form he might well be included in the World Cup squad but at whose cost this has to be decided,” he added.
|
english
|
.form-email {
width: 100%;
max-width: 330px;
padding: 15px;
margin: 0 auto;
}
.qr-div{
display: flex;
flex-wrap: nowrap;
justify-content: center;
align-items: center;
margin-top: 20%;
}
p{
text-align: center;
}
|
css
|
{
"pages": [
"page/API/index",
"page/API/pages/my/my",
"page/API/pages/home/home",
"page/API/pages/relogin/relogin",
"page/API/pages/quick-lend/quick-lend",
"page/API/pages/qr-code/qr-code",
"page/API/pages/all-trade-list/all-trade-list",
"page/API/pages/all-trade-list-detail/all-trade-list-detail",
"page/API/pages/all-trade-list-borrow/all-trade-list-borrow",
"page/API/pages/all-trade-list-detail-borrow/all-trade-list-detail-borrow",
"page/API/pages/upload-cert/upload-cert",
"page/API/pages/view-cert/view-cert",
"page/API/pages/my-info-person/my-info-person",
"page/API/pages/my-son-person/my-son-person",
"page/API/pages/message/message",
"page/API/pages/change-phone/change-phone",
"page/API/pages/long-time/long-time",
"page/API/pages/payment-log/payment-log"
],
"window": {
"navigationBarTextStyle": "black",
"navigationBarTitleText": "演示",
"navigationBarBackgroundColor": "#ffffff",
"backgroundColor": "#F2F5F6"
},
"tabBar": {
"color": "#7A7E83",
"selectedColor": "#cdb68a",
"borderStyle": "black",
"backgroundColor": "#ffffff",
"list": [
{
"pagePath": "page/API/pages/home/home",
"iconPath": "image/person/home7.png",
"selectedIconPath": "image/person/home9sel.png",
"text": "首页"
},
{
"pagePath": "page/API/pages/my/my",
"iconPath": "image/person/person9.png",
"selectedIconPath": "image/person/person7sel.png",
"text": "我的"
}
]
},
"networkTimeout": {
"request": 5000000,
"connectSocket": 10000,
"uploadFile": 10000,
"downloadFile": 10000
},
"debug": false,
"sitemapLocation": "sitemap.json"
}
|
json
|
<filename>examples/interaction/data.json
{
"username": "obi wan",
"password": {
"mode": "aes",
"data": "<KEY>"
}
}
|
json
|
<filename>test/test.js
'use strict';
var path = require('path');
var generate = require('markdown-it-testgen');
describe('markdown-it-flowdock', function () {
var md;
beforeEach(function () {
md = require('markdown-it')({
html: false,
langPrefix: '',
typographer: false,
linkify: true
});
});
it('applies markup to hashtags', function () {
md.use(require('../src'));
generate(path.join(__dirname, 'fixtures/hashtag/default.txt'), md);
});
it('applies markup to mentions', function () {
md.use(require('../src'));
generate(path.join(__dirname, 'fixtures/mention/default.txt'), md);
});
it('applies markup to urls', function () {
md.use(require('../src'));
generate(path.join(__dirname, 'fixtures/url/default.txt'), md);
});
});
|
javascript
|
<reponame>xanoni/wallet
import { EthereumLedgerProvider } from '@liquality/ethereum-ledger-provider'
export class EthereumLedgerBridgeProvider extends EthereumLedgerProvider {
_ledgerApp
constructor ({ network, derivationPath, Transport }, ledgerApp) {
super({ network, derivationPath, Transport })
this._ledgerApp = new Proxy(ledgerApp, { get: this.errorProxy.bind(this) })
}
async getApp () {
return Promise.resolve(this._ledgerApp)
}
}
|
javascript
|
Match 83 of the ICC Men's Cricket World Cup League 2 will see Scotland (SCO) taking on the United Arab Emirates (UAE) at Moosa Cricket Stadium in Pearland, Texas on Friday, June 3. The match will start at 9:00 PM IST.
Apart from the fact that Scotland have dominated UAE in the past (six wins in nine ODIs), what gives them the edge in Friday’s match is their recent run of form. The Kyle Coetzer-led side has won an impressive four of their last five games which includes a four-wicket win over UAE itself.
As for the UAE, they are coming on the back of consecutive defeats and have, in fact, won just two of their last five matches.
Scotland captain Kyle Coetzer loves playing against UAE, having scored 531 runs in eight matches, averaging 75.85 against them. This includes as many as two centuries. Given his record against the Middle-East side, it comes as no surprise that a whopping 91.54 per cent of fantasy users have decided to add him to their team.
UAE skipper Ahmed Raza has been phenomenal in ICC Men's Cricket World Cup League 2, having picked 28 wickets in 19 matches, resulting in a tally of 1,132 fantasy points. Interestingly enough, the 33-year-old has made it to the Dream Team in each of his last three outings, which is enough to warrant him a place in your team.
Having scored 450 runs with the bat followed by 24 wickets with the ball, UAE’s Basil Hameed remains an outright pick for an all-rounder. The 30-year-old has already accrued 1,403 fantasy points in the competition and an impressive 406 have come from his last five outings alone.
Finally, for a keeper, there is no one better than UAE’s Vritiya Aravind. The 19-year-old has scored 541 runs in the competition at 30.05 which is significantly more than his competitor, Matthew Cross.
SportsAdda will bring you UAE vs Scotland live scores.
Play fantasy cricket with SportsAdda. Create your team, track your progress and win prizes. Start here.
Follow us on Telegram for the latest updates from the world of sports!
Interested in cricket betting? Click here to check out the list of top sites.
|
english
|
<filename>source/plugin/squarexorx4/squarexor.cpp
#include"ac.h"
#include<cstdlib>
#include<ctime>
extern "C" void filter(cv::Mat &frame) {
static double alpha = 1.0;
for(int z = 0; z < frame.rows-4; z += 3) {
for(int i = 0; i < frame.cols-4; i += 3) {
if(i+1 < frame.cols && z+1 < frame.rows) {
cv::Vec3b source = frame.at<cv::Vec3b>(z, i);
cv::Vec3b *colors[] = {
&frame.at<cv::Vec3b>(z, i),
&frame.at<cv::Vec3b>(z, i+1),
&frame.at<cv::Vec3b>(z+1, i),
&frame.at<cv::Vec3b>(z+1, i+1)
};
cv::Vec3b total;
for(int q = 0; q < 4; ++q) {
for(int j = 0; j < 3; ++j)
total[j] += (*colors[q])[j];
}
for(int q = 0; q < 4; ++q) {
for(int j = 0; j < 3; ++j) {
(*colors[q])[j] ^= static_cast<unsigned char>(alpha*total[j]);
// (*colors[q])[j] = static_cast<unsigned char>((0.5 * source[j]) + (0.5 * (*colors[q])[j]));
}
}
}
static int dir = 1;
if(dir == 1) {
alpha += 0.05;
if(alpha > 25)
dir = 0;
} else {
alpha -= 0.05;
if(alpha <= 1.0)
dir = 1;
}
}
}
}
|
cpp
|
<reponame>ServerAnt/Billing-Frontend
import { useCallback, FunctionComponent } from 'react';
import { FormControl, FormGroup } from 'react-bootstrap';
import { Field } from 'redux-form';
export const InputGroup: FunctionComponent<{
fieldName;
placeholder;
type;
}> = ({ fieldName, placeholder, type }) => {
const renderComponent = useCallback(
({ input }) => (
<FormControl type={type} placeholder={placeholder} {...input} />
),
[placeholder, type],
);
return (
<FormGroup>
<Field name={fieldName} component={renderComponent} />
</FormGroup>
);
};
|
typescript
|
# Dark-Side.fitbit
|
markdown
|
package main
// github.com/EndlessCheng/codeforces-go
func tree4(N int64) int64 {
const mod = 998244353
n := int(N)
ans, i := 0, 0
for ; n >= 1<<i; i++ {
st := 1 << i
end := st<<1 - 1
s := (st + end) * st / 2 % mod
ans += s * (i + 1) % mod
n -= 1 << i
}
if n > 0 {
st := 1 << i
end := st + n - 1
s := (st + end) * n / 2 % mod
ans += s * (i + 1) % mod
}
return int64(ans % mod)
}
|
go
|
{
"id": 13311,
"cites": 15,
"cited_by": 5,
"reference": [
"Alesina, Alberto, <NAME>, and <NAME>. \u00c3\u00a2\u00e2\u0082\u00ac\u00c5\u0093Public Goods and Ethnic Divisions.\u00c3\u00a2\u00e2\u0082\u00ac\u00c2\u009d Quarterly Journal of Economics, 114(4), 1999, p. 1243-1284.",
"<NAME> and <NAME>. \u00c3\u00a2\u00e2\u0082\u00ac\u00c5\u0093Using Market Valuation to Assess Public School Spending.\u00c3\u00a2\u00e2\u0082\u00ac\u00c2\u009d Journal of Public Economics, 88, 2004, p. 1747-1769.",
"<NAME>. \u00c3\u00a2\u00e2\u0082\u00ac\u00c5\u0093Did Highways Cause Suburbanization?\u00c3\u00a2\u00e2\u0082\u00ac\u00c2\u009d Quarterly Journal of Economics, 2007, p. 775-805.",
"<NAME>. \u00c3\u00a2\u00e2\u0082\u00ac\u00c5\u0093The Macroeconomics of Unbalanced Growth: The Anatomy of Urban Crisis.\u00c3\u00a2\u00e2\u0082\u00ac\u00c2\u009d American Economic Review, 57(3), June 1967, p. 415-426.",
"<NAME>, <NAME>, and <NAME>. \u00c3\u00a2\u00e2\u0082\u00ac\u00c5\u0093A Unified Framework for Measuring Preferences for Schools and Neighborhoods.\u00c3\u00a2\u00e2\u0082\u00ac\u00c2\u009d Journal of Political Economy, 2007, p. 588-638.",
"<NAME>. \u00c3\u00a2\u00e2\u0082\u00ac\u00c5\u0093Do Better Schools Matter? Parental Valuation of Elementary Education.\u00c3\u00a2\u00e2\u0082\u00ac\u00c2\u009d Quarterly Journal of Economics, 114(2), 1999, p. 577-599.",
"<NAME>. \u00c3\u00a2\u00e2\u0082\u00ac\u00c5\u0093Was Postwar Suburbanization \u00c3\u00a2\u00e2\u0082\u00ac\u00cb\u009cWhite Flight\u00c3\u00a2\u00e2\u0082\u00ac\u00c2\u009d? Evidence from the Black Migration.\u00c3\u00a2\u00e2\u0082\u00ac\u00c2\u009d Quarterly Journal of Economics, 2010, p. 417-443.",
"Boustan, <NAME>. \u00c3\u00a2\u00e2\u0082\u00ac\u00c5\u0093School Desegregation and Urban Change: Evidence from City Boundaries.\u00c3\u00a2\u00e2\u0082\u00ac\u00c2\u009d American Economic Journal: Applied Economics, 4(1), 2012, p. 85-108.",
"<NAME> and <NAME>. \u00c3\u00a2\u00e2\u0082\u00ac\u00c5\u0093Efficiency Limits of Fiscal Mobility: An Assessment of the Tiebout Model.\u00c3\u00a2\u00e2\u0082\u00ac\u00c2\u009d Journal of Public Economics, 1972, p. 25-44.",
"<NAME>, <NAME>, <NAME> and <NAME>. \u00c3\u00a2\u00e2\u0082\u00ac\u00c5\u0093Local Public Good Provision: Voting, Peer Effects, and Mobility.\u00c3\u00a2\u00e2\u0082\u00ac\u00c2\u009d Journal of Public Economics, 2006, p. 959-81.",
"<NAME> and <NAME>. \u00c3\u00a2\u00e2\u0082\u00ac\u00c5\u0093Does Air Quality Matter? Evidence from the Housing Market.\u00c3\u00a2\u00e2\u0082\u00ac\u00c2\u009d Journal of Political Economy. 113(2), 2005, p.",
"<NAME>. \u00c3\u00a2\u00e2\u0082\u00ac\u00c5\u0093Jurisdictional Fragmentation and Residential Choice.\u00c3\u00a2\u00e2\u0082\u00ac\u00c2\u009d American Economic Review, Papers and Proceedings, 61, 1971, p. 334-339.",
"<NAME> and <NAME>. \u00c3\u00a2\u00e2\u0082\u00ac\u00c5\u0093Equilibrium and Local Redistribution in an Urban Economy When Households Differ in Both Preferences and Incomes.\u00c3\u00a2\u00e2\u0082\u00ac\u00c2\u009d Journal of Urban Economics, 1998.",
"<NAME> and <NAME>. \u00c3\u00a2\u00e2\u0082\u00ac\u00c5\u0093Mobility and Redistribution.\u00c3\u00a2\u00e2\u0082\u00ac\u00c2\u009d Journal of Political Economy, 99(4), 1991, p. 828-858.",
"<NAME> and <NAME>. \u00c3\u00a2\u00e2\u0082\u00ac\u00c5\u0093Estimating Equilibrium Models of Local Jurisdictions.\u00c3\u00a2\u00e2\u0082\u00ac\u00c2\u009d Journal of Political Economy, 107(4), 1999, p. 645-681."
]
}
|
json
|
A day after Congress president Rahul Gandhi’s public nudge to them to step aside, veterans have started leaving their positions on their own.
A day after Shantaram Naik quit as Goa Congress chief, saying that he had followed Rahul’s advice, UP Congress chief Raj Babbar announced his resignation late on Tuesday. With speculation swirling that Gujarat PCC chief Bharatsinh Solanki might also follow suit, the party appeared to be looking at a potential spate of resignations. Rahul in his speech had made clear that the time had come for veterans to leave the centre stage.
|
english
|
10 Jesus ga helekai, “Digau ala gu gaugau, la gu madammaa, hagalee humalia di gaugau labelaa, e tono hua nadau babaawae. Malaa, goodou huogodoo la gu madammaa, tangada hua e dahi digi madammaa.” 11 Jesus gu iloo ma koai dela ga hagi anga Ia, deelaa di mee a Mee ne helekai ai bolo digau huogodoo gu madammaa, tangada hua e dahi digi madammaa.
12 I muli hua Jesus ne tono nia babaawae digaula, gei Mee ga ulu gi lodo dono gahu laa daha, gaa hana gi dono lohongo dela i teebele, ga heeu, “Goodou gu modongoohia dagu mee nogo hai adu gi goodou?* Luke 22.27 13 Goodou e haga ingoo Au bolo Au Tangada Agoago, mo Tagi. E donu go di godou haga ingoo Au beelaa, idimaa, ma ko Au. 14 Au go di godou Dagi mo di godou Dangada Agoago dela guu tono godou babaawae, malaa, goodou e hai gi hagadau tono labelaa godou babaawae. 15 Au ne hai dagu haga modongoohia adu gi goodou, bolo goodou gi heia be dagu hai dela ne hai adu gi goodou. 16 Au e hagi adu gi goodou di tonu: Ma di hege e mada aamua i dono dagi ai. Deai tangada kae hegau e mada aamua i dono dangada ne hagau ia ai.* Matthew 10.24; Luke 6.40; John 15.20 17 Idimaa goodou gu iloo di tonu deenei, goodou e tenetene huoloo behee maa goodou ga haga hai hegau di maa!
18 “Au hagalee helekai i goodou huogodoo. Au e iloo agu gau ala gu hilihili. Malaa, nia helekai di Beebaa Dabu, le e hai gii kila boloo,
‘Tangada dela e miami madalia Au,
22 Nia dama agoago a Maa guu boo huoloo nadau lodo, gu madamada i nadau mehanga be di maa koai dela e helekai iei Mee. 23 Tangada agoago e dahi i lodo nia dama agoago aanei dela e baa iei a Jesus, e noho i baahi o Jesus. 24 Simon Peter ga menege adu gi mee, ga helekai be ma koai dela e helekai iei Mee.
26 Jesus ga helekai gi mee, “Au ga haga tiu dagu palaawaa gi lodo di ibu deenei, gaa wanga gi mee, deelaa go taane.” Gei Mee ga dahi aga dana palaawaa, ga haga tiu, gaa wanga gi Judas, go tama daane a Simon Iscariot. 27 Di madagoaa Judas ne kumi di palaawaa, Setan gu ulu gi lodo o mee. Gei Jesus ga helekai gi mee, “Hagalimalima, heia dau mee dela belee hai gii hai!” 28 Deai tangada i teebele e modongoohia be Jesus la ne aha ga helekai beelaa gi Judas. 29 Idimaa, Judas dela e madamada humalia i di budehede bahihadu digaula, gei hunu dama agoago e hagamaanadu, bolo holongo Jesus ne helekai gi mee bolo gii hana gi huia mai ana mee ala e hai tagamiami, be e wanga ana mee gi digau hagaloale.
30 Judas ne kumi di palaawaa deelaa, ga hagalimalima, ga ulu gi malaelae, gei di maa guu boo.
|
english
|
/* .carousel-item > img{
height: 432px !important;
object-fit: contain !important;
} */
.d-block{
object-fit: contain !important;
}
|
css
|
The Congress’ ‘Bharat Jodo’ campaign has given the BJP yet another reason to take on Rahul Gandhi. The BJP slammed the Congress leader over a video that is now viral on social media that captures a conversation between George Ponniah - a pastor in Tamil Nadu’s Kanyakumari and Rahul Gandhi. In the video the pastor is seen terming Jesus the ‘only real god’.
Several BJP leaders including the spokesperson of the Party, Shehzad Poonawalla shared the clip where is the pastor is seen answering Rahul Gandhi’s questions about who Jesus was. The Pastor says, “Jesus is the real god who revels himself in the human form unlike other Shakti or powers. "
The comments come after Rahul Gandhi questions the pastor whether Jesus Christ is a form of god or is he a god by himself. There are multiple people seen giving answers to Rahul Gandhi’s question with one person on his right claiming that Jesus is both the son of god and god himself.
Congress spokesperson Jairam Ramesh responded to the allegations made by BJP and said, “Its a completely bogus video. This is all just BJP Propaganda. We are doing Bharat Jodo Yatra. BJP is busy dividing while Congress Unites. BJP Rejects India’s diversity while congress unites India. "
Pastor George Ponniah is a member of the Jananayaga Christhava Peravai, which is a Tamil Nadu-based NGO located in Kanyakumari and is often known for his controversial rhetoric. He is no stranger to controversy and came into the limelight after a controversial speech by him against Prime Minister Narendra Modi following which over 30 complaints were filed against him in parts of Tamil Nadu. The pastor was forced to issue a public apology for using provocative language.
Congress leader Rahul Gandhi launched ‘Bharat Jodo Yatra’ - a country-wide padayatra that will cover nearly 3,570 kilometres over 150 days spanning 12 states. The yatra began on Wednesday in Kanyakumari.
|
english
|
/*
During specifying children nearest parents, looping is done reversely
to let children attached to nearest parents based on coordinates and also based on document structure
For example having a Text within Rectangle withing a Group
while Group and Rectangle having the same coordinates
Text's parent should be Rectangle and Rectangle's parent should be Group
*/
let childrenNearestParents = [];
function setChildNearestParent(child, parent) {
childrenNearestParents.push({ child, parent });
}
function getParentChildren(parent) {
return childrenNearestParents
.filter(item => item.parent && item.parent.guid === parent.guid)
.map(item => item.child);
}
function getChildParent(child) {
const targetItem = childrenNearestParents.find(
item => item.child.guid === child.guid
);
return targetItem && targetItem.parent;
}
function filterChildrenWithNoParents(children) {
return children.filter(child => !getChildParent(child));
}
function clearChildNearestParent() {
childrenNearestParents = [];
}
function flattenNodeChildren(node, children) {
node.children.forEach(nodeChild => {
children.push(nodeChild);
if (nodeChild.children.length) {
flattenNodeChildren(nodeChild, children);
}
});
}
function specifyChildrenNearestParents(children) {
// loop over children in a reverse order
for (let i = children.length - 1; i >= 0; i--) {
const cChild = children[i];
const nearestParent = specifyChildNearestParent(cChild, children);
setChildNearestParent(cChild, nearestParent);
}
}
function specifyChildNearestParent(child, nodes) {
let nearestParent;
// loop over nodes in a reverse order
for (let i = nodes.length - 1; i >= 0; i--) {
const node = nodes[i];
if (canBeParentForChild(child, node)) {
if (nearestParent) {
nearestParent = whichIsNearestParent(nearestParent, node);
} else {
nearestParent = node;
}
}
}
return nearestParent;
}
function canBeParentForChild(child, node) {
if (
// they are not the same node
child.guid !== node.guid &&
// if @param node is a child of @param child then @param node cannot be a parent for @param child
!childrenNearestParents.find(
item =>
item.child.guid === node.guid &&
item.parent &&
item.parent.guid === child.guid
) &&
// the child exists within the bounds of the node
node.globalBounds.x <= child.globalBounds.x &&
node.globalBounds.y <= child.globalBounds.y &&
node.globalBounds.x + node.globalBounds.width >=
child.globalBounds.x + child.globalBounds.width &&
node.globalBounds.y + node.globalBounds.height >=
child.globalBounds.y + child.globalBounds.height
) {
return true;
}
return false;
}
function whichIsNearestParent(parent1, parent2) {
// updating this order of comparison may break reverse looping
if (parent1.globalBounds.y < parent2.globalBounds.y) {
return parent2;
} else if (parent1.globalBounds.y === parent2.globalBounds.y) {
if (parent1.globalBounds.x < parent2.globalBounds.x) {
return parent2;
} else {
return parent1;
}
} else {
return parent1;
}
}
/**
* gets the artboard that contains the given node
* @param {*} node an instance of SceneNode
* @returns an instance of Artboard or null
*/
function getNodeArtboard(node) {
if (node.constructor.name === "Artboard") {
return node;
}
let parent = node.parent;
while (parent && parent.constructor.name !== "Artboard") {
parent = parent.parent;
}
return parent;
}
module.exports = {
getParentChildren,
filterChildrenWithNoParents,
clearChildNearestParent,
flattenNodeChildren,
specifyChildrenNearestParents,
getNodeArtboard
};
|
javascript
|
<reponame>HAO98/chinese-independent-blogs<filename>cache/https%3A%2F%2Fwww.wikimoe.com%2Frss.php.json
{"status":200,"data":{"totalSubs":87,"subsInEachSource":{"feedly":42,"inoreader":43,"feedsPub":2},"failedSources":{}},"lastModified":1618186733387}
|
json
|
{% block content %}
<section id="sidebar">
<h4 class="text-secondary">Check Latest Posts</h4>
<div class="list-group">
{% for post in posts %}
<a href="{% url 'blog_post_detail' post.pk %}" class="list-group-item list-group-item-action list-group-item-info text-dark">
{{post}}
</a>
{% endfor %}
</div>
</section>
{% endblock %}
|
html
|
"I am so thankful to Fawad for being here and dearest Deepika I know her since she was a model and her first film. . . its a very special moment" the designer added.
|
english
|
<gh_stars>0
/*
//@HEADER
// ************************************************************************
//
// Kokkos v. 2.0
// Copyright (2014) Sandia Corporation
//
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
// the U.S. Government retains certain rights in this software.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// Questions? Contact <NAME> (<EMAIL>)
//
// ************************************************************************
//@HEADER
*/
#include <stdexcept>
#include <sstream>
#include <iostream>
#include <limits>
#include <Kokkos_Core.hpp>
namespace Test {
template< typename ScalarType, class DeviceType >
class ReduceFunctor
{
public:
typedef DeviceType execution_space;
typedef typename execution_space::size_type size_type;
struct value_type {
ScalarType value[3];
};
const size_type nwork;
ReduceFunctor( const size_type & arg_nwork )
: nwork( arg_nwork ) {}
ReduceFunctor( const ReduceFunctor & rhs )
: nwork( rhs.nwork ) {}
/*
KOKKOS_INLINE_FUNCTION
void init( value_type & dst ) const
{
dst.value[0] = 0;
dst.value[1] = 0;
dst.value[2] = 0;
}
*/
KOKKOS_INLINE_FUNCTION
void join( volatile value_type & dst,
const volatile value_type & src ) const
{
dst.value[0] += src.value[0];
dst.value[1] += src.value[1];
dst.value[2] += src.value[2];
}
KOKKOS_INLINE_FUNCTION
void operator()( size_type iwork, value_type & dst ) const
{
dst.value[0] += 1;
dst.value[1] += iwork + 1;
dst.value[2] += nwork - iwork;
}
};
template< class DeviceType >
class ReduceFunctorFinal : public ReduceFunctor< long, DeviceType > {
public:
typedef typename ReduceFunctor< long, DeviceType >::value_type value_type;
ReduceFunctorFinal( const size_t n )
: ReduceFunctor< long, DeviceType >( n ) {}
KOKKOS_INLINE_FUNCTION
void final( value_type & dst ) const
{
dst.value[0] = -dst.value[0];
dst.value[1] = -dst.value[1];
dst.value[2] = -dst.value[2];
}
};
template< typename ScalarType, class DeviceType >
class RuntimeReduceFunctor
{
public:
// Required for functor:
typedef DeviceType execution_space;
typedef ScalarType value_type[];
const unsigned value_count;
// Unit test details:
typedef typename execution_space::size_type size_type;
const size_type nwork;
RuntimeReduceFunctor( const size_type arg_nwork,
const size_type arg_count )
: value_count( arg_count )
, nwork( arg_nwork ) {}
KOKKOS_INLINE_FUNCTION
void init( ScalarType dst[] ) const
{
for ( unsigned i = 0; i < value_count; ++i ) dst[i] = 0;
}
KOKKOS_INLINE_FUNCTION
void join( volatile ScalarType dst[],
const volatile ScalarType src[] ) const
{
for ( unsigned i = 0; i < value_count; ++i ) dst[i] += src[i];
}
KOKKOS_INLINE_FUNCTION
void operator()( size_type iwork, ScalarType dst[] ) const
{
const size_type tmp[3] = { 1, iwork + 1, nwork - iwork };
for ( size_type i = 0; i < value_count; ++i ) {
dst[i] += tmp[ i % 3 ];
}
}
};
template< typename ScalarType, class DeviceType >
class RuntimeReduceMinMax
{
public:
// Required for functor:
typedef DeviceType execution_space;
typedef ScalarType value_type[];
const unsigned value_count;
// Unit test details:
typedef typename execution_space::size_type size_type;
const size_type nwork;
const ScalarType amin;
const ScalarType amax;
RuntimeReduceMinMax( const size_type arg_nwork,
const size_type arg_count )
: value_count( arg_count )
, nwork( arg_nwork )
, amin( std::numeric_limits< ScalarType >::min() )
, amax( std::numeric_limits< ScalarType >::max() )
{}
KOKKOS_INLINE_FUNCTION
void init( ScalarType dst[] ) const
{
for ( unsigned i = 0; i < value_count; ++i ) {
dst[i] = i % 2 ? amax : amin;
}
}
KOKKOS_INLINE_FUNCTION
void join( volatile ScalarType dst[],
const volatile ScalarType src[] ) const
{
for ( unsigned i = 0; i < value_count; ++i ) {
dst[i] = i % 2 ? ( dst[i] < src[i] ? dst[i] : src[i] ) // min
: ( dst[i] > src[i] ? dst[i] : src[i] ); // max
}
}
KOKKOS_INLINE_FUNCTION
void operator()( size_type iwork, ScalarType dst[] ) const
{
const ScalarType tmp[2] = { ScalarType( iwork + 1 )
, ScalarType( nwork - iwork ) };
for ( size_type i = 0; i < value_count; ++i ) {
dst[i] = i % 2 ? ( dst[i] < tmp[i % 2] ? dst[i] : tmp[i % 2] )
: ( dst[i] > tmp[i % 2] ? dst[i] : tmp[i % 2] );
}
}
};
template< class DeviceType >
class RuntimeReduceFunctorFinal : public RuntimeReduceFunctor< long, DeviceType > {
public:
typedef RuntimeReduceFunctor< long, DeviceType > base_type;
typedef typename base_type::value_type value_type;
typedef long scalar_type;
RuntimeReduceFunctorFinal( const size_t theNwork, const size_t count )
: base_type( theNwork, count ) {}
KOKKOS_INLINE_FUNCTION
void final( value_type dst ) const
{
for ( unsigned i = 0; i < base_type::value_count; ++i ) {
dst[i] = -dst[i];
}
}
};
} // namespace Test
namespace {
template< typename ScalarType, class DeviceType >
class TestReduce
{
public:
typedef DeviceType execution_space;
typedef typename execution_space::size_type size_type;
TestReduce( const size_type & nwork )
{
run_test( nwork );
run_test_final( nwork );
}
void run_test( const size_type & nwork )
{
typedef Test::ReduceFunctor< ScalarType, execution_space > functor_type;
typedef typename functor_type::value_type value_type;
enum { Count = 3 };
enum { Repeat = 100 };
value_type result[ Repeat ];
const unsigned long nw = nwork;
const unsigned long nsum = nw % 2 ? nw * ( ( nw + 1 ) / 2 )
: ( nw / 2 ) * ( nw + 1 );
for ( unsigned i = 0; i < Repeat; ++i ) {
Kokkos::parallel_reduce( nwork, functor_type( nwork ), result[i] );
}
for ( unsigned i = 0; i < Repeat; ++i ) {
for ( unsigned j = 0; j < Count; ++j ) {
const unsigned long correct = 0 == j % 3 ? nw : nsum;
ASSERT_EQ( (ScalarType) correct, result[i].value[j] );
}
}
}
void run_test_final( const size_type & nwork )
{
typedef Test::ReduceFunctorFinal< execution_space > functor_type;
typedef typename functor_type::value_type value_type;
enum { Count = 3 };
enum { Repeat = 100 };
value_type result[ Repeat ];
const unsigned long nw = nwork;
const unsigned long nsum = nw % 2 ? nw * ( ( nw + 1 ) / 2 )
: ( nw / 2 ) * ( nw + 1 );
for ( unsigned i = 0; i < Repeat; ++i ) {
if ( i % 2 == 0 ) {
Kokkos::parallel_reduce( nwork, functor_type( nwork ), result[i] );
}
else {
Kokkos::parallel_reduce( "Reduce", nwork, functor_type( nwork ), result[i] );
}
}
for ( unsigned i = 0; i < Repeat; ++i ) {
for ( unsigned j = 0; j < Count; ++j ) {
const unsigned long correct = 0 == j % 3 ? nw : nsum;
ASSERT_EQ( (ScalarType) correct, -result[i].value[j] );
}
}
}
};
template< typename ScalarType, class DeviceType >
class TestReduceDynamic
{
public:
typedef DeviceType execution_space;
typedef typename execution_space::size_type size_type;
TestReduceDynamic( const size_type nwork )
{
run_test_dynamic( nwork );
run_test_dynamic_minmax( nwork );
run_test_dynamic_final( nwork );
}
void run_test_dynamic( const size_type nwork )
{
typedef Test::RuntimeReduceFunctor< ScalarType, execution_space > functor_type;
enum { Count = 3 };
enum { Repeat = 100 };
ScalarType result[ Repeat ][ Count ];
const unsigned long nw = nwork;
const unsigned long nsum = nw % 2 ? nw * ( ( nw + 1 ) / 2 )
: ( nw / 2 ) * ( nw + 1 );
for ( unsigned i = 0; i < Repeat; ++i ) {
if ( i % 2 == 0 ) {
Kokkos::parallel_reduce( nwork, functor_type( nwork, Count ), result[i] );
}
else {
Kokkos::parallel_reduce( "Reduce", nwork, functor_type( nwork, Count ), result[i] );
}
}
for ( unsigned i = 0; i < Repeat; ++i ) {
for ( unsigned j = 0; j < Count; ++j ) {
const unsigned long correct = 0 == j % 3 ? nw : nsum;
ASSERT_EQ( (ScalarType) correct, result[i][j] );
}
}
}
void run_test_dynamic_minmax( const size_type nwork )
{
typedef Test::RuntimeReduceMinMax< ScalarType, execution_space > functor_type;
enum { Count = 2 };
enum { Repeat = 100 };
ScalarType result[ Repeat ][ Count ];
for ( unsigned i = 0; i < Repeat; ++i ) {
if ( i % 2 == 0 ) {
Kokkos::parallel_reduce( nwork, functor_type( nwork, Count ), result[i] );
}
else {
Kokkos::parallel_reduce( "Reduce", nwork, functor_type( nwork, Count ), result[i] );
}
}
for ( unsigned i = 0; i < Repeat; ++i ) {
for ( unsigned j = 0; j < Count; ++j ) {
if ( nwork == 0 )
{
ScalarType amin( std::numeric_limits< ScalarType >::min() );
ScalarType amax( std::numeric_limits< ScalarType >::max() );
const ScalarType correct = ( j % 2 ) ? amax : amin;
ASSERT_EQ( (ScalarType) correct, result[i][j] );
}
else {
const unsigned long correct = j % 2 ? 1 : nwork;
ASSERT_EQ( (ScalarType) correct, result[i][j] );
}
}
}
}
void run_test_dynamic_final( const size_type nwork )
{
typedef Test::RuntimeReduceFunctorFinal< execution_space > functor_type;
enum { Count = 3 };
enum { Repeat = 100 };
typename functor_type::scalar_type result[ Repeat ][ Count ];
const unsigned long nw = nwork;
const unsigned long nsum = nw % 2 ? nw * ( ( nw + 1 ) / 2 )
: ( nw / 2 ) * ( nw + 1 );
for ( unsigned i = 0; i < Repeat; ++i ) {
if ( i % 2 == 0 ) {
Kokkos::parallel_reduce( nwork, functor_type( nwork, Count ), result[i] );
}
else {
Kokkos::parallel_reduce( "TestKernelReduce", nwork, functor_type( nwork, Count ), result[i] );
}
}
for ( unsigned i = 0; i < Repeat; ++i ) {
for ( unsigned j = 0; j < Count; ++j ) {
const unsigned long correct = 0 == j % 3 ? nw : nsum;
ASSERT_EQ( (ScalarType) correct, -result[i][j] );
}
}
}
};
template< typename ScalarType, class DeviceType >
class TestReduceDynamicView
{
public:
typedef DeviceType execution_space;
typedef typename execution_space::size_type size_type;
TestReduceDynamicView( const size_type nwork )
{
run_test_dynamic_view( nwork );
}
void run_test_dynamic_view( const size_type nwork )
{
typedef Test::RuntimeReduceFunctor< ScalarType, execution_space > functor_type;
typedef Kokkos::View< ScalarType*, DeviceType > result_type;
typedef typename result_type::HostMirror result_host_type;
const unsigned CountLimit = 23;
const unsigned long nw = nwork;
const unsigned long nsum = nw % 2 ? nw * ( ( nw + 1 ) / 2 )
: ( nw / 2 ) * ( nw + 1 );
for ( unsigned count = 0; count < CountLimit; ++count ) {
result_type result( "result", count );
result_host_type host_result = Kokkos::create_mirror( result );
// Test result to host pointer:
std::string str( "TestKernelReduce" );
if ( count % 2 == 0 ) {
Kokkos::parallel_reduce( nw, functor_type( nw, count ), host_result.ptr_on_device() );
}
else {
Kokkos::parallel_reduce( str, nw, functor_type( nw, count ), host_result.ptr_on_device() );
}
for ( unsigned j = 0; j < count; ++j ) {
const unsigned long correct = 0 == j % 3 ? nw : nsum;
ASSERT_EQ( host_result( j ), (ScalarType) correct );
host_result( j ) = 0;
}
}
}
};
} // namespace
// Computes y^T*A*x
// ( modified from kokkos-tutorials/GTC2016/Exercises/ThreeLevelPar )
#if ( ! defined( KOKKOS_ENABLE_CUDA ) ) || defined( KOKKOS_ENABLE_CUDA_LAMBDA )
template< typename ScalarType, class DeviceType >
class TestTripleNestedReduce
{
public:
typedef DeviceType execution_space;
typedef typename execution_space::size_type size_type;
TestTripleNestedReduce( const size_type & nrows, const size_type & ncols
, const size_type & team_size, const size_type & vector_length )
{
run_test( nrows, ncols, team_size, vector_length );
}
void run_test( const size_type & nrows, const size_type & ncols
, const size_type & team_size, const size_type & vector_length )
{
//typedef Kokkos::LayoutLeft Layout;
typedef Kokkos::LayoutRight Layout;
typedef Kokkos::View< ScalarType*, DeviceType > ViewVector;
typedef Kokkos::View< ScalarType**, Layout, DeviceType > ViewMatrix;
ViewVector y( "y", nrows );
ViewVector x( "x", ncols );
ViewMatrix A( "A", nrows, ncols );
typedef Kokkos::RangePolicy<DeviceType> range_policy;
// Initialize y vector.
Kokkos::parallel_for( range_policy( 0, nrows ), KOKKOS_LAMBDA ( const int i ) { y( i ) = 1; } );
// Initialize x vector.
Kokkos::parallel_for( range_policy( 0, ncols ), KOKKOS_LAMBDA ( const int i ) { x( i ) = 1; } );
typedef Kokkos::TeamPolicy< DeviceType > team_policy;
typedef typename Kokkos::TeamPolicy< DeviceType >::member_type member_type;
// Initialize A matrix, note 2D indexing computation.
Kokkos::parallel_for( team_policy( nrows, Kokkos::AUTO ), KOKKOS_LAMBDA ( const member_type & teamMember ) {
const int j = teamMember.league_rank();
Kokkos::parallel_for( Kokkos::TeamThreadRange( teamMember, ncols ), [&] ( const int i ) {
A( j, i ) = 1;
} );
} );
// Three level parallelism kernel to force caching of vector x.
ScalarType result = 0.0;
int chunk_size = 128;
Kokkos::parallel_reduce( team_policy( nrows / chunk_size, team_size, vector_length ),
KOKKOS_LAMBDA ( const member_type & teamMember, double & update ) {
const int row_start = teamMember.league_rank() * chunk_size;
const int row_end = row_start + chunk_size;
Kokkos::parallel_for( Kokkos::TeamThreadRange( teamMember, row_start, row_end ), [&] ( const int i ) {
ScalarType sum_i = 0.0;
Kokkos::parallel_reduce( Kokkos::ThreadVectorRange( teamMember, ncols ), [&] ( const int j, ScalarType &innerUpdate ) {
innerUpdate += A( i, j ) * x( j );
}, sum_i );
Kokkos::single( Kokkos::PerThread( teamMember ), [&] () {
update += y( i ) * sum_i;
} );
} );
}, result );
const ScalarType solution = (ScalarType) nrows * (ScalarType) ncols;
ASSERT_EQ( solution, result );
}
};
#else // #if ( ! defined( KOKKOS_ENABLE_CUDA ) ) || defined( KOKKOS_ENABLE_CUDA_LAMBDA )
template< typename ScalarType, class DeviceType >
class TestTripleNestedReduce
{
public:
typedef DeviceType execution_space;
typedef typename execution_space::size_type size_type;
TestTripleNestedReduce( const size_type &, const size_type
, const size_type &, const size_type )
{}
};
#endif
//--------------------------------------------------------------------------
namespace Test {
namespace ReduceCombinatorical {
template< class Scalar, class Space = Kokkos::HostSpace >
struct AddPlus {
public:
// Required.
typedef AddPlus reducer_type;
typedef Scalar value_type;
typedef Kokkos::View< value_type, Space, Kokkos::MemoryTraits<Kokkos::Unmanaged> > result_view_type;
private:
result_view_type result;
public:
AddPlus( value_type & result_ ) : result( &result_ ) {}
// Required.
KOKKOS_INLINE_FUNCTION
void join( value_type & dest, const value_type & src ) const {
dest += src + 1;
}
KOKKOS_INLINE_FUNCTION
void join( volatile value_type & dest, const volatile value_type & src ) const {
dest += src + 1;
}
// Optional.
KOKKOS_INLINE_FUNCTION
void init( value_type & val ) const {
val = value_type();
}
result_view_type result_view() const {
return result;
}
};
template< int ISTEAM >
struct FunctorScalar;
template<>
struct FunctorScalar< 0 > {
Kokkos::View< double > result;
FunctorScalar( Kokkos::View< double > r ) : result( r ) {}
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, double & update ) const {
update += i;
}
};
template<>
struct FunctorScalar< 1 > {
typedef Kokkos::TeamPolicy<>::member_type team_type;
Kokkos::View< double > result;
FunctorScalar( Kokkos::View< double > r ) : result( r ) {}
KOKKOS_INLINE_FUNCTION
void operator()( const team_type & team, double & update ) const {
update += 1.0 / team.team_size() * team.league_rank();
}
};
template< int ISTEAM >
struct FunctorScalarInit;
template<>
struct FunctorScalarInit< 0 > {
Kokkos::View< double > result;
FunctorScalarInit( Kokkos::View< double > r ) : result( r ) {}
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, double & update ) const {
update += i;
}
KOKKOS_INLINE_FUNCTION
void init( double & update ) const {
update = 0.0;
}
};
template<>
struct FunctorScalarInit< 1 > {
typedef Kokkos::TeamPolicy<>::member_type team_type;
Kokkos::View< double > result;
FunctorScalarInit( Kokkos::View< double > r ) : result( r ) {}
KOKKOS_INLINE_FUNCTION
void operator()( const team_type & team, double & update ) const {
update += 1.0 / team.team_size() * team.league_rank();
}
KOKKOS_INLINE_FUNCTION
void init( double & update ) const {
update = 0.0;
}
};
template< int ISTEAM >
struct FunctorScalarFinal;
template<>
struct FunctorScalarFinal< 0 > {
Kokkos::View<double> result;
FunctorScalarFinal( Kokkos::View< double > r ) : result( r ) {}
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, double & update ) const {
update += i;
}
KOKKOS_INLINE_FUNCTION
void final( double & update ) const {
result() = update;
}
};
template<>
struct FunctorScalarFinal< 1 > {
typedef Kokkos::TeamPolicy<>::member_type team_type;
Kokkos::View< double > result;
FunctorScalarFinal( Kokkos::View< double > r ) : result( r ) {}
KOKKOS_INLINE_FUNCTION
void operator()( const team_type & team, double & update ) const {
update += 1.0 / team.team_size() * team.league_rank();
}
KOKKOS_INLINE_FUNCTION
void final( double & update ) const {
result() = update;
}
};
template< int ISTEAM >
struct FunctorScalarJoin;
template<>
struct FunctorScalarJoin< 0 > {
Kokkos::View<double> result;
FunctorScalarJoin( Kokkos::View< double > r ) : result( r ) {}
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, double & update ) const {
update += i;
}
KOKKOS_INLINE_FUNCTION
void join( volatile double & dst, const volatile double & update ) const {
dst += update;
}
};
template<>
struct FunctorScalarJoin< 1 > {
typedef Kokkos::TeamPolicy<>::member_type team_type;
Kokkos::View< double > result;
FunctorScalarJoin( Kokkos::View< double > r ) : result( r ) {}
KOKKOS_INLINE_FUNCTION
void operator()( const team_type & team, double & update ) const {
update += 1.0 / team.team_size() * team.league_rank();
}
KOKKOS_INLINE_FUNCTION
void join( volatile double & dst, const volatile double & update ) const {
dst += update;
}
};
template< int ISTEAM >
struct FunctorScalarJoinFinal;
template<>
struct FunctorScalarJoinFinal< 0 > {
Kokkos::View< double > result;
FunctorScalarJoinFinal( Kokkos::View< double > r ) : result( r ) {}
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, double & update ) const {
update += i;
}
KOKKOS_INLINE_FUNCTION
void join( volatile double & dst, const volatile double & update ) const {
dst += update;
}
KOKKOS_INLINE_FUNCTION
void final( double & update ) const {
result() = update;
}
};
template<>
struct FunctorScalarJoinFinal< 1 > {
typedef Kokkos::TeamPolicy<>::member_type team_type;
Kokkos::View< double > result;
FunctorScalarJoinFinal( Kokkos::View< double > r ) : result( r ) {}
KOKKOS_INLINE_FUNCTION
void operator()( const team_type & team, double & update ) const {
update += 1.0 / team.team_size() * team.league_rank();
}
KOKKOS_INLINE_FUNCTION
void join( volatile double & dst, const volatile double & update ) const {
dst += update;
}
KOKKOS_INLINE_FUNCTION
void final( double & update ) const {
result() = update;
}
};
template< int ISTEAM >
struct FunctorScalarJoinInit;
template<>
struct FunctorScalarJoinInit< 0 > {
Kokkos::View< double > result;
FunctorScalarJoinInit( Kokkos::View< double > r ) : result( r ) {}
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, double & update ) const {
update += i;
}
KOKKOS_INLINE_FUNCTION
void join( volatile double & dst, const volatile double & update ) const {
dst += update;
}
KOKKOS_INLINE_FUNCTION
void init( double & update ) const {
update = 0.0;
}
};
template<>
struct FunctorScalarJoinInit< 1 > {
typedef Kokkos::TeamPolicy<>::member_type team_type;
Kokkos::View< double > result;
FunctorScalarJoinInit( Kokkos::View< double > r ) : result( r ) {}
KOKKOS_INLINE_FUNCTION
void operator()( const team_type & team, double & update ) const {
update += 1.0 / team.team_size() * team.league_rank();
}
KOKKOS_INLINE_FUNCTION
void join( volatile double & dst, const volatile double & update ) const {
dst += update;
}
KOKKOS_INLINE_FUNCTION
void init( double & update ) const {
update = 0.0;
}
};
template< int ISTEAM >
struct FunctorScalarJoinFinalInit;
template<>
struct FunctorScalarJoinFinalInit< 0 > {
Kokkos::View<double> result;
FunctorScalarJoinFinalInit( Kokkos::View< double > r ) : result( r ) {}
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, double & update ) const {
update += i;
}
KOKKOS_INLINE_FUNCTION
void join( volatile double & dst, const volatile double & update ) const {
dst += update;
}
KOKKOS_INLINE_FUNCTION
void final( double & update ) const {
result() = update;
}
KOKKOS_INLINE_FUNCTION
void init( double & update ) const {
update = 0.0;
}
};
template<>
struct FunctorScalarJoinFinalInit< 1 > {
typedef Kokkos::TeamPolicy<>::member_type team_type;
Kokkos::View< double > result;
FunctorScalarJoinFinalInit( Kokkos::View< double > r ) : result( r ) {}
KOKKOS_INLINE_FUNCTION
void operator()( const team_type & team, double & update ) const {
update += 1.0 / team.team_size() * team.league_rank();
}
KOKKOS_INLINE_FUNCTION
void join( volatile double & dst, const volatile double & update ) const {
dst += update;
}
KOKKOS_INLINE_FUNCTION
void final( double & update ) const {
result() = update;
}
KOKKOS_INLINE_FUNCTION
void init( double & update ) const {
update = 0.0;
}
};
struct Functor1 {
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, double & update ) const {
update += i;
}
};
struct Functor2 {
typedef double value_type[];
const unsigned value_count;
Functor2( unsigned n ) : value_count( n ) {}
KOKKOS_INLINE_FUNCTION
void operator()( const unsigned & i, double update[] ) const {
for ( unsigned j = 0; j < value_count; j++ ) {
update[j] += i;
}
}
KOKKOS_INLINE_FUNCTION
void init( double dst[] ) const
{
for ( unsigned i = 0; i < value_count; ++i ) dst[i] = 0;
}
KOKKOS_INLINE_FUNCTION
void join( volatile double dst[],
const volatile double src[] ) const
{
for ( unsigned i = 0; i < value_count; ++i ) dst[i] += src[i];
}
};
} // namespace ReduceCombinatorical
} // namespace Test
namespace Test {
template< class ExecSpace = Kokkos::DefaultExecutionSpace >
struct TestReduceCombinatoricalInstantiation {
template< class ... Args >
static void CallParallelReduce( Args... args ) {
Kokkos::parallel_reduce( args... );
}
template< class ... Args >
static void AddReturnArgument( Args... args ) {
Kokkos::View< double, Kokkos::HostSpace > result_view( "ResultView" );
double expected_result = 1000.0 * 999.0 / 2.0;
double value = 0;
Kokkos::parallel_reduce( args..., value );
ASSERT_EQ( expected_result, value );
result_view() = 0;
CallParallelReduce( args..., result_view );
ASSERT_EQ( expected_result, result_view() );
value = 0;
CallParallelReduce( args..., Kokkos::View< double, Kokkos::HostSpace, Kokkos::MemoryTraits<Kokkos::Unmanaged> >( &value ) );
ASSERT_EQ( expected_result, value );
result_view() = 0;
const Kokkos::View< double, Kokkos::HostSpace, Kokkos::MemoryTraits<Kokkos::Unmanaged> > result_view_const_um = result_view;
CallParallelReduce( args..., result_view_const_um );
ASSERT_EQ( expected_result, result_view_const_um() );
value = 0;
CallParallelReduce( args..., Test::ReduceCombinatorical::AddPlus< double >( value ) );
if ( ( Kokkos::DefaultExecutionSpace::concurrency() > 1 ) && ( ExecSpace::concurrency() > 1 ) ) {
ASSERT_TRUE( expected_result < value );
}
else if ( ( Kokkos::DefaultExecutionSpace::concurrency() > 1 ) || ( ExecSpace::concurrency() > 1 ) ) {
ASSERT_TRUE( expected_result <= value );
}
else {
ASSERT_EQ( expected_result, value );
}
value = 0;
Test::ReduceCombinatorical::AddPlus< double > add( value );
CallParallelReduce( args..., add );
if ( ( Kokkos::DefaultExecutionSpace::concurrency() > 1 ) && ( ExecSpace::concurrency() > 1 ) ) {
ASSERT_TRUE( expected_result < value );
}
else if ( ( Kokkos::DefaultExecutionSpace::concurrency() > 1 ) || ( ExecSpace::concurrency() > 1 ) ) {
ASSERT_TRUE( expected_result <= value );
}
else {
ASSERT_EQ( expected_result, value );
}
}
template< class ... Args >
static void AddLambdaRange( void*, Args... args ) {
AddReturnArgument( args..., KOKKOS_LAMBDA ( const int & i, double & lsum ) {
lsum += i;
});
}
template< class ... Args >
static void AddLambdaTeam( void*, Args... args ) {
AddReturnArgument( args..., KOKKOS_LAMBDA ( const Kokkos::TeamPolicy<>::member_type & team, double & update ) {
update += 1.0 / team.team_size() * team.league_rank();
});
}
template< class ... Args >
static void AddLambdaRange( Kokkos::InvalidType, Args... args ) {}
template< class ... Args >
static void AddLambdaTeam( Kokkos::InvalidType, Args... args ) {}
template< int ISTEAM, class ... Args >
static void AddFunctor( Args... args ) {
Kokkos::View< double > result_view( "FunctorView" );
auto h_r = Kokkos::create_mirror_view( result_view );
Test::ReduceCombinatorical::FunctorScalar< ISTEAM > functor( result_view );
double expected_result = 1000.0 * 999.0 / 2.0;
AddReturnArgument( args..., functor );
AddReturnArgument( args..., Test::ReduceCombinatorical::FunctorScalar< ISTEAM >( result_view ) );
AddReturnArgument( args..., Test::ReduceCombinatorical::FunctorScalarInit< ISTEAM >( result_view ) );
AddReturnArgument( args..., Test::ReduceCombinatorical::FunctorScalarJoin< ISTEAM >( result_view ) );
AddReturnArgument( args..., Test::ReduceCombinatorical::FunctorScalarJoinInit< ISTEAM >( result_view ) );
h_r() = 0;
Kokkos::deep_copy( result_view, h_r );
CallParallelReduce( args..., Test::ReduceCombinatorical::FunctorScalarFinal< ISTEAM >( result_view ) );
Kokkos::deep_copy( h_r, result_view );
ASSERT_EQ( expected_result, h_r() );
h_r() = 0;
Kokkos::deep_copy( result_view, h_r );
CallParallelReduce( args..., Test::ReduceCombinatorical::FunctorScalarJoinFinal< ISTEAM >( result_view ) );
Kokkos::deep_copy( h_r, result_view );
ASSERT_EQ( expected_result, h_r() );
h_r() = 0;
Kokkos::deep_copy( result_view, h_r );
CallParallelReduce( args..., Test::ReduceCombinatorical::FunctorScalarJoinFinalInit< ISTEAM >( result_view ) );
Kokkos::deep_copy( h_r, result_view );
ASSERT_EQ( expected_result, h_r() );
}
template< class ... Args >
static void AddFunctorLambdaRange( Args... args ) {
AddFunctor< 0, Args... >( args... );
#ifdef KOKKOS_ENABLE_CXX11_DISPATCH_LAMBDA
AddLambdaRange( typename std::conditional< std::is_same<ExecSpace, Kokkos::DefaultExecutionSpace>::value, void*, Kokkos::InvalidType >::type(), args... );
#endif
}
template< class ... Args >
static void AddFunctorLambdaTeam( Args... args ) {
AddFunctor< 1, Args... >( args... );
#ifdef KOKKOS_ENABLE_CXX11_DISPATCH_LAMBDA
AddLambdaTeam( typename std::conditional< std::is_same<ExecSpace, Kokkos::DefaultExecutionSpace>::value, void*, Kokkos::InvalidType >::type(), args... );
#endif
}
template< class ... Args >
static void AddPolicy( Args... args ) {
int N = 1000;
Kokkos::RangePolicy< ExecSpace > policy( 0, N );
AddFunctorLambdaRange( args..., 1000 );
AddFunctorLambdaRange( args..., N );
AddFunctorLambdaRange( args..., policy );
AddFunctorLambdaRange( args..., Kokkos::RangePolicy< ExecSpace >( 0, N ) );
AddFunctorLambdaRange( args..., Kokkos::RangePolicy< ExecSpace, Kokkos::Schedule<Kokkos::Dynamic> >( 0, N ) );
AddFunctorLambdaRange( args..., Kokkos::RangePolicy< ExecSpace, Kokkos::Schedule<Kokkos::Static> >( 0, N ).set_chunk_size( 10 ) );
AddFunctorLambdaRange( args..., Kokkos::RangePolicy< ExecSpace, Kokkos::Schedule<Kokkos::Dynamic> >( 0, N ).set_chunk_size( 10 ) );
AddFunctorLambdaTeam( args..., Kokkos::TeamPolicy< ExecSpace >( N, Kokkos::AUTO ) );
AddFunctorLambdaTeam( args..., Kokkos::TeamPolicy< ExecSpace, Kokkos::Schedule<Kokkos::Dynamic> >( N, Kokkos::AUTO ) );
AddFunctorLambdaTeam( args..., Kokkos::TeamPolicy< ExecSpace, Kokkos::Schedule<Kokkos::Static> >( N, Kokkos::AUTO ).set_chunk_size( 10 ) );
AddFunctorLambdaTeam( args..., Kokkos::TeamPolicy< ExecSpace, Kokkos::Schedule<Kokkos::Dynamic> >( N, Kokkos::AUTO ).set_chunk_size( 10 ) );
}
static void execute_a() {
AddPolicy();
}
static void execute_b() {
std::string s( "Std::String" );
AddPolicy( s.c_str() );
AddPolicy( "Char Constant" );
}
static void execute_c() {
std::string s( "Std::String" );
AddPolicy( s );
}
};
template< class Scalar, class ExecSpace = Kokkos::DefaultExecutionSpace >
struct TestReducers {
struct SumFunctor {
Kokkos::View< const Scalar*, ExecSpace > values;
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, Scalar & value ) const {
value += values( i );
}
};
struct ProdFunctor {
Kokkos::View< const Scalar*, ExecSpace > values;
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, Scalar & value ) const {
value *= values( i );
}
};
struct MinFunctor {
Kokkos::View< const Scalar*, ExecSpace > values;
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, Scalar & value ) const {
if ( values( i ) < value ) value = values( i );
}
};
struct MaxFunctor {
Kokkos::View< const Scalar*, ExecSpace > values;
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, Scalar & value ) const {
if ( values( i ) > value ) value = values( i );
}
};
struct MinLocFunctor {
Kokkos::View< const Scalar*, ExecSpace > values;
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, typename Kokkos::Experimental::MinLoc< Scalar, int >::value_type & value ) const {
if ( values( i ) < value.val ) {
value.val = values( i );
value.loc = i;
}
}
};
struct MaxLocFunctor {
Kokkos::View< const Scalar*, ExecSpace > values;
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, typename Kokkos::Experimental::MaxLoc< Scalar, int >::value_type & value ) const {
if ( values( i ) > value.val ) {
value.val = values( i );
value.loc = i;
}
}
};
struct MinMaxLocFunctor {
Kokkos::View< const Scalar*, ExecSpace > values;
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, typename Kokkos::Experimental::MinMaxLoc< Scalar, int >::value_type & value ) const {
if ( values( i ) > value.max_val ) {
value.max_val = values( i );
value.max_loc = i;
}
if ( values( i ) < value.min_val ) {
value.min_val = values( i );
value.min_loc = i;
}
}
};
struct BAndFunctor {
Kokkos::View< const Scalar*, ExecSpace > values;
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, Scalar & value ) const {
value = value & values( i );
}
};
struct BOrFunctor {
Kokkos::View< const Scalar*, ExecSpace > values;
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, Scalar & value ) const {
value = value | values( i );
}
};
struct BXorFunctor {
Kokkos::View< const Scalar*, ExecSpace > values;
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, Scalar & value ) const {
value = value ^ values( i );
}
};
struct LAndFunctor {
Kokkos::View< const Scalar*, ExecSpace > values;
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, Scalar & value ) const {
value = value && values( i );
}
};
struct LOrFunctor {
Kokkos::View< const Scalar*, ExecSpace > values;
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, Scalar & value ) const {
value = value || values( i );
}
};
struct LXorFunctor {
Kokkos::View< const Scalar*, ExecSpace > values;
KOKKOS_INLINE_FUNCTION
void operator()( const int & i, Scalar & value ) const {
value = value ? ( !values( i ) ) : values( i );
}
};
static void test_sum( int N ) {
Kokkos::View< Scalar*, ExecSpace > values( "Values", N );
auto h_values = Kokkos::create_mirror_view( values );
Scalar reference_sum = 0;
for ( int i = 0; i < N; i++ ) {
h_values( i ) = (Scalar) ( rand() % 100 );
reference_sum += h_values( i );
}
Kokkos::deep_copy( values, h_values );
SumFunctor f;
f.values = values;
Scalar init = 0;
{
Scalar sum_scalar = init;
Kokkos::Experimental::Sum< Scalar > reducer_scalar( sum_scalar );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar );
ASSERT_EQ( sum_scalar, reference_sum );
Scalar sum_scalar_view = reducer_scalar.result_view()();
ASSERT_EQ( sum_scalar_view, reference_sum );
}
{
Scalar sum_scalar_init = init;
Kokkos::Experimental::Sum< Scalar > reducer_scalar_init( sum_scalar_init, init );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar_init );
ASSERT_EQ( sum_scalar_init, reference_sum );
Scalar sum_scalar_init_view = reducer_scalar_init.result_view()();
ASSERT_EQ( sum_scalar_init_view, reference_sum );
}
{
Kokkos::View< Scalar, Kokkos::HostSpace> sum_view( "View" );
sum_view() = init;
Kokkos::Experimental::Sum< Scalar > reducer_view( sum_view );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view );
Scalar sum_view_scalar = sum_view();
ASSERT_EQ( sum_view_scalar, reference_sum );
Scalar sum_view_view = reducer_view.result_view()();
ASSERT_EQ( sum_view_view, reference_sum );
}
{
Kokkos::View< Scalar, Kokkos::HostSpace > sum_view_init( "View" );
sum_view_init() = init;
Kokkos::Experimental::Sum< Scalar > reducer_view_init( sum_view_init, init );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view_init );
Scalar sum_view_init_scalar = sum_view_init();
ASSERT_EQ( sum_view_init_scalar, reference_sum );
Scalar sum_view_init_view = reducer_view_init.result_view()();
ASSERT_EQ( sum_view_init_view, reference_sum );
}
}
static void test_prod( int N ) {
Kokkos::View< Scalar*, ExecSpace > values( "Values", N );
auto h_values = Kokkos::create_mirror_view( values );
Scalar reference_prod = 1;
for ( int i = 0; i < N; i++ ) {
h_values( i ) = (Scalar) ( rand() % 4 + 1 );
reference_prod *= h_values( i );
}
Kokkos::deep_copy( values, h_values );
ProdFunctor f;
f.values = values;
Scalar init = 1;
if ( std::is_arithmetic< Scalar >::value )
{
Scalar prod_scalar = init;
Kokkos::Experimental::Prod< Scalar > reducer_scalar( prod_scalar );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar );
ASSERT_EQ( prod_scalar, reference_prod );
Scalar prod_scalar_view = reducer_scalar.result_view()();
ASSERT_EQ( prod_scalar_view, reference_prod );
}
{
Scalar prod_scalar_init = init;
Kokkos::Experimental::Prod< Scalar > reducer_scalar_init( prod_scalar_init, init );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar_init );
ASSERT_EQ( prod_scalar_init, reference_prod );
Scalar prod_scalar_init_view = reducer_scalar_init.result_view()();
ASSERT_EQ( prod_scalar_init_view, reference_prod );
}
if ( std::is_arithmetic< Scalar >::value )
{
Kokkos::View< Scalar, Kokkos::HostSpace > prod_view( "View" );
prod_view() = init;
Kokkos::Experimental::Prod< Scalar > reducer_view( prod_view );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view );
Scalar prod_view_scalar = prod_view();
ASSERT_EQ( prod_view_scalar, reference_prod );
Scalar prod_view_view = reducer_view.result_view()();
ASSERT_EQ( prod_view_view, reference_prod );
}
{
Kokkos::View< Scalar, Kokkos::HostSpace > prod_view_init( "View" );
prod_view_init() = init;
Kokkos::Experimental::Prod< Scalar > reducer_view_init( prod_view_init, init );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view_init );
Scalar prod_view_init_scalar = prod_view_init();
ASSERT_EQ( prod_view_init_scalar, reference_prod );
Scalar prod_view_init_view = reducer_view_init.result_view()();
ASSERT_EQ( prod_view_init_view, reference_prod );
}
}
static void test_min( int N ) {
Kokkos::View< Scalar*, ExecSpace > values( "Values", N );
auto h_values = Kokkos::create_mirror_view( values );
Scalar reference_min = std::numeric_limits< Scalar >::max();
for ( int i = 0; i < N; i++ ) {
h_values( i ) = (Scalar) ( rand() % 100000 );
if ( h_values( i ) < reference_min ) reference_min = h_values( i );
}
Kokkos::deep_copy( values, h_values );
MinFunctor f;
f.values = values;
Scalar init = std::numeric_limits< Scalar >::max();
{
Scalar min_scalar = init;
Kokkos::Experimental::Min< Scalar > reducer_scalar( min_scalar );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar );
ASSERT_EQ( min_scalar, reference_min );
Scalar min_scalar_view = reducer_scalar.result_view()();
ASSERT_EQ( min_scalar_view, reference_min );
}
{
Scalar min_scalar_init = init;
Kokkos::Experimental::Min< Scalar > reducer_scalar_init( min_scalar_init, init );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar_init );
ASSERT_EQ( min_scalar_init, reference_min );
Scalar min_scalar_init_view = reducer_scalar_init.result_view()();
ASSERT_EQ( min_scalar_init_view, reference_min );
}
{
Kokkos::View< Scalar, Kokkos::HostSpace > min_view( "View" );
min_view() = init;
Kokkos::Experimental::Min< Scalar > reducer_view( min_view );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view );
Scalar min_view_scalar = min_view();
ASSERT_EQ( min_view_scalar, reference_min );
Scalar min_view_view = reducer_view.result_view()();
ASSERT_EQ( min_view_view, reference_min );
}
{
Kokkos::View< Scalar, Kokkos::HostSpace > min_view_init( "View" );
min_view_init() = init;
Kokkos::Experimental::Min< Scalar > reducer_view_init( min_view_init, init );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view_init );
Scalar min_view_init_scalar = min_view_init();
ASSERT_EQ( min_view_init_scalar, reference_min );
Scalar min_view_init_view = reducer_view_init.result_view()();
ASSERT_EQ( min_view_init_view, reference_min );
}
}
static void test_max( int N ) {
Kokkos::View< Scalar*, ExecSpace > values( "Values", N );
auto h_values = Kokkos::create_mirror_view( values );
Scalar reference_max = std::numeric_limits< Scalar >::min();
for ( int i = 0; i < N; i++ ) {
h_values( i ) = (Scalar) ( rand() % 100000 + 1 );
if ( h_values( i ) > reference_max ) reference_max = h_values( i );
}
Kokkos::deep_copy( values, h_values );
MaxFunctor f;
f.values = values;
Scalar init = std::numeric_limits< Scalar >::min();
{
Scalar max_scalar = init;
Kokkos::Experimental::Max< Scalar > reducer_scalar( max_scalar );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar );
ASSERT_EQ( max_scalar, reference_max );
Scalar max_scalar_view = reducer_scalar.result_view()();
ASSERT_EQ( max_scalar_view, reference_max );
}
{
Scalar max_scalar_init = init;
Kokkos::Experimental::Max< Scalar > reducer_scalar_init( max_scalar_init, init );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar_init );
ASSERT_EQ( max_scalar_init, reference_max );
Scalar max_scalar_init_view = reducer_scalar_init.result_view()();
ASSERT_EQ( max_scalar_init_view, reference_max );
}
{
Kokkos::View< Scalar, Kokkos::HostSpace > max_view( "View" );
max_view() = init;
Kokkos::Experimental::Max< Scalar > reducer_view( max_view );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view );
Scalar max_view_scalar = max_view();
ASSERT_EQ( max_view_scalar, reference_max );
Scalar max_view_view = reducer_view.result_view()();
ASSERT_EQ( max_view_view, reference_max );
}
{
Kokkos::View< Scalar, Kokkos::HostSpace > max_view_init( "View" );
max_view_init() = init;
Kokkos::Experimental::Max< Scalar > reducer_view_init( max_view_init, init );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view_init );
Scalar max_view_init_scalar = max_view_init();
ASSERT_EQ( max_view_init_scalar, reference_max );
Scalar max_view_init_view = reducer_view_init.result_view()();
ASSERT_EQ( max_view_init_view, reference_max );
}
}
static void test_minloc( int N ) {
typedef typename Kokkos::Experimental::MinLoc< Scalar, int >::value_type value_type;
Kokkos::View< Scalar*, ExecSpace > values( "Values", N );
auto h_values = Kokkos::create_mirror_view( values );
Scalar reference_min = std::numeric_limits< Scalar >::max();
int reference_loc = -1;
for ( int i = 0; i < N; i++ ) {
h_values( i ) = (Scalar) ( rand() % 100000 );
if ( h_values( i ) < reference_min ) {
reference_min = h_values( i );
reference_loc = i;
}
else if ( h_values( i ) == reference_min ) {
// Make min unique.
h_values( i ) += std::numeric_limits< Scalar >::epsilon();
}
}
Kokkos::deep_copy( values, h_values );
MinLocFunctor f;
f.values = values;
Scalar init = std::numeric_limits< Scalar >::max();
{
value_type min_scalar;
Kokkos::Experimental::MinLoc< Scalar, int > reducer_scalar( min_scalar );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar );
ASSERT_EQ( min_scalar.val, reference_min );
ASSERT_EQ( min_scalar.loc, reference_loc );
value_type min_scalar_view = reducer_scalar.result_view()();
ASSERT_EQ( min_scalar_view.val, reference_min );
ASSERT_EQ( min_scalar_view.loc, reference_loc );
}
{
value_type min_scalar_init;
Kokkos::Experimental::MinLoc< Scalar, int > reducer_scalar_init( min_scalar_init, init );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar_init );
ASSERT_EQ( min_scalar_init.val, reference_min );
ASSERT_EQ( min_scalar_init.loc, reference_loc );
value_type min_scalar_init_view = reducer_scalar_init.result_view()();
ASSERT_EQ( min_scalar_init_view.val, reference_min );
ASSERT_EQ( min_scalar_init_view.loc, reference_loc );
}
{
Kokkos::View< value_type, Kokkos::HostSpace > min_view( "View" );
Kokkos::Experimental::MinLoc< Scalar, int > reducer_view( min_view );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view );
value_type min_view_scalar = min_view();
ASSERT_EQ( min_view_scalar.val, reference_min );
ASSERT_EQ( min_view_scalar.loc, reference_loc );
value_type min_view_view = reducer_view.result_view()();
ASSERT_EQ( min_view_view.val, reference_min );
ASSERT_EQ( min_view_view.loc, reference_loc );
}
{
Kokkos::View< value_type, Kokkos::HostSpace > min_view_init( "View" );
Kokkos::Experimental::MinLoc< Scalar, int > reducer_view_init( min_view_init, init );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view_init );
value_type min_view_init_scalar = min_view_init();
ASSERT_EQ( min_view_init_scalar.val, reference_min );
ASSERT_EQ( min_view_init_scalar.loc, reference_loc );
value_type min_view_init_view = reducer_view_init.result_view()();
ASSERT_EQ( min_view_init_view.val, reference_min );
ASSERT_EQ( min_view_init_view.loc, reference_loc );
}
}
static void test_maxloc( int N ) {
typedef typename Kokkos::Experimental::MaxLoc< Scalar, int >::value_type value_type;
Kokkos::View< Scalar*, ExecSpace > values( "Values", N );
auto h_values = Kokkos::create_mirror_view( values );
Scalar reference_max = std::numeric_limits< Scalar >::min();
int reference_loc = -1;
for ( int i = 0; i < N; i++ ) {
h_values( i ) = (Scalar) ( rand() % 100000 );
if ( h_values( i ) > reference_max ) {
reference_max = h_values( i );
reference_loc = i;
}
else if ( h_values( i ) == reference_max ) {
// Make max unique.
h_values( i ) -= std::numeric_limits< Scalar >::epsilon();
}
}
Kokkos::deep_copy( values, h_values );
MaxLocFunctor f;
f.values = values;
Scalar init = std::numeric_limits< Scalar >::min();
{
value_type max_scalar;
Kokkos::Experimental::MaxLoc< Scalar, int > reducer_scalar( max_scalar );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar );
ASSERT_EQ( max_scalar.val, reference_max );
ASSERT_EQ( max_scalar.loc, reference_loc );
value_type max_scalar_view = reducer_scalar.result_view()();
ASSERT_EQ( max_scalar_view.val, reference_max );
ASSERT_EQ( max_scalar_view.loc, reference_loc );
}
{
value_type max_scalar_init;
Kokkos::Experimental::MaxLoc< Scalar, int > reducer_scalar_init( max_scalar_init, init );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar_init );
ASSERT_EQ( max_scalar_init.val, reference_max );
ASSERT_EQ( max_scalar_init.loc, reference_loc );
value_type max_scalar_init_view = reducer_scalar_init.result_view()();
ASSERT_EQ( max_scalar_init_view.val, reference_max );
ASSERT_EQ( max_scalar_init_view.loc, reference_loc );
}
{
Kokkos::View< value_type, Kokkos::HostSpace > max_view( "View" );
Kokkos::Experimental::MaxLoc< Scalar, int > reducer_view( max_view );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view );
value_type max_view_scalar = max_view();
ASSERT_EQ( max_view_scalar.val, reference_max );
ASSERT_EQ( max_view_scalar.loc, reference_loc );
value_type max_view_view = reducer_view.result_view()();
ASSERT_EQ( max_view_view.val, reference_max );
ASSERT_EQ( max_view_view.loc, reference_loc );
}
{
Kokkos::View< value_type, Kokkos::HostSpace > max_view_init( "View" );
Kokkos::Experimental::MaxLoc< Scalar, int > reducer_view_init( max_view_init, init );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view_init );
value_type max_view_init_scalar = max_view_init();
ASSERT_EQ( max_view_init_scalar.val, reference_max );
ASSERT_EQ( max_view_init_scalar.loc, reference_loc );
value_type max_view_init_view = reducer_view_init.result_view()();
ASSERT_EQ( max_view_init_view.val, reference_max );
ASSERT_EQ( max_view_init_view.loc, reference_loc );
}
}
static void test_minmaxloc( int N ) {
typedef typename Kokkos::Experimental::MinMaxLoc< Scalar, int >::value_type value_type;
Kokkos::View< Scalar*, ExecSpace > values( "Values", N );
auto h_values = Kokkos::create_mirror_view( values );
Scalar reference_max = std::numeric_limits< Scalar >::min();
Scalar reference_min = std::numeric_limits< Scalar >::max();
int reference_minloc = -1;
int reference_maxloc = -1;
for ( int i = 0; i < N; i++ ) {
h_values( i ) = (Scalar) ( rand() % 100000 );
}
for ( int i = 0; i < N; i++ ) {
if ( h_values( i ) > reference_max ) {
reference_max = h_values( i );
reference_maxloc = i;
}
else if ( h_values( i ) == reference_max ) {
// Make max unique.
h_values( i ) -= std::numeric_limits< Scalar >::epsilon();
}
}
for ( int i = 0; i < N; i++ ) {
if ( h_values( i ) < reference_min ) {
reference_min = h_values( i );
reference_minloc = i;
}
else if ( h_values( i ) == reference_min ) {
// Make min unique.
h_values( i ) += std::numeric_limits< Scalar >::epsilon();
}
}
Kokkos::deep_copy( values, h_values );
MinMaxLocFunctor f;
f.values = values;
Scalar init_min = std::numeric_limits< Scalar >::max();
Scalar init_max = std::numeric_limits< Scalar >::min();
{
value_type minmax_scalar;
Kokkos::Experimental::MinMaxLoc< Scalar, int > reducer_scalar( minmax_scalar );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar );
ASSERT_EQ( minmax_scalar.min_val, reference_min );
for ( int i = 0; i < N; i++ ) {
if ( ( i == minmax_scalar.min_loc ) && ( h_values( i ) == reference_min ) ) {
reference_minloc = i;
}
}
ASSERT_EQ( minmax_scalar.min_loc, reference_minloc );
ASSERT_EQ( minmax_scalar.max_val, reference_max );
for ( int i = 0; i < N; i++ ) {
if ( ( i == minmax_scalar.max_loc ) && ( h_values( i ) == reference_max ) ) {
reference_maxloc = i;
}
}
ASSERT_EQ( minmax_scalar.max_loc, reference_maxloc );
value_type minmax_scalar_view = reducer_scalar.result_view()();
ASSERT_EQ( minmax_scalar_view.min_val, reference_min );
ASSERT_EQ( minmax_scalar_view.min_loc, reference_minloc );
ASSERT_EQ( minmax_scalar_view.max_val, reference_max );
ASSERT_EQ( minmax_scalar_view.max_loc, reference_maxloc );
}
{
value_type minmax_scalar_init;
Kokkos::Experimental::MinMaxLoc< Scalar, int > reducer_scalar_init( minmax_scalar_init, init_min, init_max );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar_init );
ASSERT_EQ( minmax_scalar_init.min_val, reference_min );
ASSERT_EQ( minmax_scalar_init.min_loc, reference_minloc );
ASSERT_EQ( minmax_scalar_init.max_val, reference_max );
ASSERT_EQ( minmax_scalar_init.max_loc, reference_maxloc );
value_type minmax_scalar_init_view = reducer_scalar_init.result_view()();
ASSERT_EQ( minmax_scalar_init_view.min_val, reference_min );
ASSERT_EQ( minmax_scalar_init_view.min_loc, reference_minloc );
ASSERT_EQ( minmax_scalar_init_view.max_val, reference_max );
ASSERT_EQ( minmax_scalar_init_view.max_loc, reference_maxloc );
}
{
Kokkos::View< value_type, Kokkos::HostSpace > minmax_view( "View" );
Kokkos::Experimental::MinMaxLoc< Scalar, int > reducer_view( minmax_view );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view );
value_type minmax_view_scalar = minmax_view();
ASSERT_EQ( minmax_view_scalar.min_val, reference_min );
ASSERT_EQ( minmax_view_scalar.min_loc, reference_minloc );
ASSERT_EQ( minmax_view_scalar.max_val, reference_max );
ASSERT_EQ( minmax_view_scalar.max_loc, reference_maxloc );
value_type minmax_view_view = reducer_view.result_view()();
ASSERT_EQ( minmax_view_view.min_val, reference_min );
ASSERT_EQ( minmax_view_view.min_loc, reference_minloc );
ASSERT_EQ( minmax_view_view.max_val, reference_max );
ASSERT_EQ( minmax_view_view.max_loc, reference_maxloc );
}
{
Kokkos::View< value_type, Kokkos::HostSpace > minmax_view_init( "View" );
Kokkos::Experimental::MinMaxLoc< Scalar, int > reducer_view_init( minmax_view_init, init_min, init_max );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view_init );
value_type minmax_view_init_scalar = minmax_view_init();
ASSERT_EQ( minmax_view_init_scalar.min_val, reference_min );
ASSERT_EQ( minmax_view_init_scalar.min_loc, reference_minloc );
ASSERT_EQ( minmax_view_init_scalar.max_val, reference_max );
ASSERT_EQ( minmax_view_init_scalar.max_loc, reference_maxloc );
value_type minmax_view_init_view = reducer_view_init.result_view()();
ASSERT_EQ( minmax_view_init_view.min_val, reference_min );
ASSERT_EQ( minmax_view_init_view.min_loc, reference_minloc );
ASSERT_EQ( minmax_view_init_view.max_val, reference_max );
ASSERT_EQ( minmax_view_init_view.max_loc, reference_maxloc );
}
}
static void test_BAnd( int N ) {
Kokkos::View< Scalar*, ExecSpace > values( "Values", N );
auto h_values = Kokkos::create_mirror_view( values );
Scalar reference_band = Scalar() | ( ~Scalar() );
for ( int i = 0; i < N; i++ ) {
h_values( i ) = (Scalar) ( rand() % 100000 + 1 );
reference_band = reference_band & h_values( i );
}
Kokkos::deep_copy( values, h_values );
BAndFunctor f;
f.values = values;
Scalar init = Scalar() | ( ~Scalar() );
{
Scalar band_scalar = init;
Kokkos::Experimental::BAnd< Scalar > reducer_scalar( band_scalar );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar );
ASSERT_EQ( band_scalar, reference_band );
Scalar band_scalar_view = reducer_scalar.result_view()();
ASSERT_EQ( band_scalar_view, reference_band );
}
{
Kokkos::View< Scalar, Kokkos::HostSpace > band_view( "View" );
band_view() = init;
Kokkos::Experimental::BAnd< Scalar > reducer_view( band_view );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view );
Scalar band_view_scalar = band_view();
ASSERT_EQ( band_view_scalar, reference_band );
Scalar band_view_view = reducer_view.result_view()();
ASSERT_EQ( band_view_view, reference_band );
}
}
static void test_BOr( int N ) {
Kokkos::View< Scalar*, ExecSpace > values( "Values", N );
auto h_values = Kokkos::create_mirror_view( values );
Scalar reference_bor = Scalar() & ( ~Scalar() );
for ( int i = 0; i < N; i++ ) {
h_values( i ) = (Scalar) ( ( rand() % 100000 + 1 ) * 2 );
reference_bor = reference_bor | h_values( i );
}
Kokkos::deep_copy( values, h_values );
BOrFunctor f;
f.values = values;
Scalar init = Scalar() & ( ~Scalar() );
{
Scalar bor_scalar = init;
Kokkos::Experimental::BOr< Scalar > reducer_scalar( bor_scalar );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar );
ASSERT_EQ( bor_scalar, reference_bor );
Scalar bor_scalar_view = reducer_scalar.result_view()();
ASSERT_EQ( bor_scalar_view, reference_bor );
}
{
Kokkos::View< Scalar, Kokkos::HostSpace > bor_view( "View" );
bor_view() = init;
Kokkos::Experimental::BOr< Scalar > reducer_view( bor_view );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view );
Scalar bor_view_scalar = bor_view();
ASSERT_EQ( bor_view_scalar, reference_bor );
Scalar bor_view_view = reducer_view.result_view()();
ASSERT_EQ( bor_view_view, reference_bor );
}
}
static void test_BXor( int N ) {
Kokkos::View< Scalar*, ExecSpace > values( "Values", N );
auto h_values = Kokkos::create_mirror_view( values );
Scalar reference_bxor = Scalar() & ( ~Scalar() );
for ( int i = 0; i < N; i++ ) {
h_values( i ) = (Scalar) ( ( rand() % 100000 + 1 ) * 2 );
reference_bxor = reference_bxor ^ h_values( i );
}
Kokkos::deep_copy( values, h_values );
BXorFunctor f;
f.values = values;
Scalar init = Scalar() & ( ~Scalar() );
{
Scalar bxor_scalar = init;
Kokkos::Experimental::BXor< Scalar > reducer_scalar( bxor_scalar );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar );
ASSERT_EQ( bxor_scalar, reference_bxor );
Scalar bxor_scalar_view = reducer_scalar.result_view()();
ASSERT_EQ( bxor_scalar_view, reference_bxor );
}
{
Kokkos::View< Scalar, Kokkos::HostSpace > bxor_view( "View" );
bxor_view() = init;
Kokkos::Experimental::BXor< Scalar > reducer_view( bxor_view );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view );
Scalar bxor_view_scalar = bxor_view();
ASSERT_EQ( bxor_view_scalar, reference_bxor );
Scalar bxor_view_view = reducer_view.result_view()();
ASSERT_EQ( bxor_view_view, reference_bxor );
}
}
static void test_LAnd( int N ) {
Kokkos::View< Scalar*, ExecSpace > values( "Values", N );
auto h_values = Kokkos::create_mirror_view( values );
Scalar reference_land = 1;
for ( int i = 0; i < N; i++ ) {
h_values( i ) = (Scalar) ( rand() % 2 );
reference_land = reference_land && h_values( i );
}
Kokkos::deep_copy( values, h_values );
LAndFunctor f;
f.values = values;
Scalar init = 1;
{
Scalar land_scalar = init;
Kokkos::Experimental::LAnd< Scalar > reducer_scalar( land_scalar );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar );
ASSERT_EQ( land_scalar, reference_land );
Scalar land_scalar_view = reducer_scalar.result_view()();
ASSERT_EQ( land_scalar_view, reference_land );
}
{
Kokkos::View< Scalar, Kokkos::HostSpace > land_view( "View" );
land_view() = init;
Kokkos::Experimental::LAnd< Scalar > reducer_view( land_view );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view );
Scalar land_view_scalar = land_view();
ASSERT_EQ( land_view_scalar, reference_land );
Scalar land_view_view = reducer_view.result_view()();
ASSERT_EQ( land_view_view, reference_land );
}
}
static void test_LOr( int N ) {
Kokkos::View< Scalar*, ExecSpace > values( "Values", N );
auto h_values = Kokkos::create_mirror_view( values );
Scalar reference_lor = 0;
for ( int i = 0; i < N; i++ ) {
h_values( i ) = (Scalar) ( rand() % 2 );
reference_lor = reference_lor || h_values( i );
}
Kokkos::deep_copy( values, h_values );
LOrFunctor f;
f.values = values;
Scalar init = 0;
{
Scalar lor_scalar = init;
Kokkos::Experimental::LOr< Scalar > reducer_scalar( lor_scalar );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar );
ASSERT_EQ( lor_scalar, reference_lor );
Scalar lor_scalar_view = reducer_scalar.result_view()();
ASSERT_EQ( lor_scalar_view, reference_lor );
}
{
Kokkos::View< Scalar, Kokkos::HostSpace > lor_view( "View" );
lor_view() = init;
Kokkos::Experimental::LOr< Scalar > reducer_view( lor_view );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view );
Scalar lor_view_scalar = lor_view();
ASSERT_EQ( lor_view_scalar, reference_lor );
Scalar lor_view_view = reducer_view.result_view()();
ASSERT_EQ( lor_view_view, reference_lor );
}
}
static void test_LXor( int N ) {
Kokkos::View< Scalar*, ExecSpace > values( "Values", N );
auto h_values = Kokkos::create_mirror_view( values );
Scalar reference_lxor = 0;
for ( int i = 0; i < N; i++ ) {
h_values( i ) = (Scalar) ( rand() % 2 );
reference_lxor = reference_lxor ? ( !h_values( i ) ) : h_values( i );
}
Kokkos::deep_copy( values, h_values );
LXorFunctor f;
f.values = values;
Scalar init = 0;
{
Scalar lxor_scalar = init;
Kokkos::Experimental::LXor< Scalar > reducer_scalar( lxor_scalar );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_scalar );
ASSERT_EQ( lxor_scalar, reference_lxor );
Scalar lxor_scalar_view = reducer_scalar.result_view()();
ASSERT_EQ( lxor_scalar_view, reference_lxor );
}
{
Kokkos::View< Scalar, Kokkos::HostSpace > lxor_view( "View" );
lxor_view() = init;
Kokkos::Experimental::LXor< Scalar > reducer_view( lxor_view );
Kokkos::parallel_reduce( Kokkos::RangePolicy< ExecSpace >( 0, N ), f, reducer_view );
Scalar lxor_view_scalar = lxor_view();
ASSERT_EQ( lxor_view_scalar, reference_lxor );
Scalar lxor_view_view = reducer_view.result_view()();
ASSERT_EQ( lxor_view_view, reference_lxor );
}
}
static void execute_float() {
test_sum( 10001 );
test_prod( 35 );
test_min( 10003 );
test_minloc( 10003 );
test_max( 10007 );
test_maxloc( 10007 );
test_minmaxloc( 10007 );
}
static void execute_integer() {
test_sum( 10001 );
test_prod( 35 );
test_min( 10003 );
test_minloc( 10003 );
test_max( 10007 );
test_maxloc( 10007 );
test_minmaxloc( 10007 );
test_BAnd( 35 );
test_BOr( 35 );
test_BXor( 35 );
test_LAnd( 35 );
test_LOr( 35 );
test_LXor( 35 );
}
static void execute_basic() {
test_sum( 10001 );
test_prod( 35 );
}
};
} // namespace Test
|
cpp
|
Hollywood star Ryan Gosling is in negotiations to reteam with Barbie co-star Margot Robbie for the new Ocean's Eleven film set at Warner Bros.
According to Deadline, Bombshell helmer Jay Roach is attached to direct the movie. Penned by Carrie Solomon, the film will be set in Europe in the 1960s. Other details about the plot are under wraps.
The project is under "active development" but hasn't been greenlighted officially by the studio.
Robbie will also produce the film along with Tom Ackerly for LuckyChap. Roach and Michelle Graham will produce via their banner Everyman Pictures.
The Ocean's heist franchise, based on the 1960 Rat Pack film, was launched by filmmaker Steven Soderbergh back in 2001 with Ocean's Eleven.
The film starring George Clooney, Brad Pitt, Matt Damon and Julia Roberts minted over 450M worldwide, and was followed by Ocean's Twelve (2004), Ocean's Thirteen (2007) and 2018's female-centric Ocean's 8.
|
english
|
<gh_stars>0
[{"atomIDs":["14"],"diaIDs":["foQPB@BFALiLjjvmFRUYt@@@@@@@RB@QJh"],"nbAtoms":1,"delta":7.592,"atomLabel":"H","j":[{"assignment":["15"],"diaID":"foQPB@NFALyEEDhcLdsdeV]@@@@@@@Ot``DRj@","coupling":7.799,"multiplicity":"d","distance":3},{"assignment":["16"],"diaID":"foQPB@NJALiLrrk{ARuYt@@@@@@@RB@QJh","coupling":0.472,"multiplicity":"d","distance":5},{"assignment":["18"],"diaID":"foQPB@DZALiLk\\l}NJMYt@@@@@@@RB@QJh","coupling":4.765,"multiplicity":"d","distance":3}]},{"atomIDs":["15"],"diaIDs":["foQPB@NFALyEEDhcLdsdeV]@@@@@@@Ot``DRj@"],"nbAtoms":1,"delta":8.266,"atomLabel":"H","j":[{"assignment":["14"],"diaID":"foQPB@BFALiLjjvmFRUYt@@@@@@@RB@QJh","coupling":7.799,"multiplicity":"d","distance":3},{"assignment":["16"],"diaID":"foQPB@NJALiLrrk{ARuYt@@@@@@@RB@QJh","coupling":1.571,"multiplicity":"d","distance":4},{"assignment":["17"],"diaID":"foQPB@BFALiLrlk{ARuYt@@@@@@@RB@QJh","coupling":0.462,"multiplicity":"d","distance":5},{"assignment":["18"],"diaID":"foQPB@DZALiLk\\l}NJMYt@@@@@@@RB@QJh","coupling":1.639,"multiplicity":"d","distance":4}]},{"atomIDs":["16"],"diaIDs":["foQPB@NJALiLrrk{ARuYt@@@@@@@RB@QJh"],"nbAtoms":1,"delta":8.617,"atomLabel":"H","j":[{"assignment":["14"],"diaID":"foQPB@BFALiLjjvmFRUYt@@@@@@@RB@QJh","coupling":0.472,"multiplicity":"d","distance":5},{"assignment":["15"],"diaID":"foQPB@NFALyEEDhcLdsdeV]@@@@@@@Ot``DRj@","coupling":1.571,"multiplicity":"d","distance":4},{"assignment":["17"],"diaID":"foQPB@BFALiLrlk{ARuYt@@@@@@@RB@QJh","coupling":8.44,"multiplicity":"d","distance":3}]},{"atomIDs":["17"],"diaIDs":["foQPB@BFALiLrlk{ARuYt@@@@@@@RB@QJh"],"nbAtoms":1,"delta":8.233,"atomLabel":"H","j":[{"assignment":["15"],"diaID":"foQPB@NFALyEEDhcLdsdeV]@@@@@@@Ot``DRj@","coupling":0.462,"multiplicity":"d","distance":5},{"assignment":["16"],"diaID":"foQPB@NJALiLrrk{ARuYt@@@@@@@RB@QJh","coupling":8.44,"multiplicity":"d","distance":3},{"assignment":["19"],"diaID":"foQPB@NRALyEEDhieBrRcV]@@@@@@@Ot``DRj@","coupling":0.463,"multiplicity":"d","distance":5},{"assignment":["21"],"diaID":"foQPB@DJALiLkZvmFRuYt@@@@@@@RB@QJh","coupling":0.495,"multiplicity":"d","distance":5}]},{"atomIDs":["18"],"diaIDs":["foQPB@DZALiLk\\l}NJMYt@@@@@@@RB@QJh"],"nbAtoms":1,"delta":9.027,"atomLabel":"H","j":[{"assignment":["14"],"diaID":"foQPB@BFALiLjjvmFRUYt@@@@@@@RB@QJh","coupling":4.765,"multiplicity":"d","distance":3},{"assignment":["15"],"diaID":"foQPB@NFALyEEDhcLdsdeV]@@@@@@@Ot``DRj@","coupling":1.639,"multiplicity":"d","distance":4}]},{"atomIDs":["19"],"diaIDs":["foQPB@NRALyEEDhieBrRcV]@@@@@@@Ot``DRj@"],"nbAtoms":1,"delta":8.664,"atomLabel":"H","j":[{"assignment":["17"],"diaID":"foQPB@BFALiLrlk{ARuYt@@@@@@@RB@QJh","coupling":0.463,"multiplicity":"d","distance":5},{"assignment":["20"],"diaID":"foQPB@BRALiLjkJ}FJuYt@@@@@@@RB@QJh","coupling":7.717,"multiplicity":"d","distance":3},{"assignment":["21"],"diaID":"foQPB@DJALiLkZvmFRuYt@@@@@@@RB@QJh","coupling":1.848,"multiplicity":"d","distance":4}]},{"atomIDs":["20"],"diaIDs":["foQPB@BRALiLjkJ}FJuYt@@@@@@@RB@QJh"],"nbAtoms":1,"delta":7.534,"atomLabel":"H","j":[{"assignment":["19"],"diaID":"foQPB@NRALyEEDhieBrRcV]@@@@@@@Ot``DRj@","coupling":7.717,"multiplicity":"d","distance":3},{"assignment":["21"],"diaID":"foQPB@DJALiLkZvmFRuYt@@@@@@@RB@QJh","coupling":4.754,"multiplicity":"d","distance":3}]},{"atomIDs":["21"],"diaIDs":["foQPB@DJALiLkZvmFRuYt@@@@@@@RB@QJh"],"nbAtoms":1,"delta":9.032,"atomLabel":"H","j":[{"assignment":["17"],"diaID":"foQPB@BFALiLrlk{ARuYt@@@@@@@RB@QJh","coupling":0.495,"multiplicity":"d","distance":5},{"assignment":["19"],"diaID":"foQPB@NRALyEEDhieBrRcV]@@@@@@@Ot``DRj@","coupling":1.848,"multiplicity":"d","distance":4},{"assignment":["20"],"diaID":"foQPB@BRALiLjkJ}FJuYt@@@@@@@RB@QJh","coupling":4.754,"multiplicity":"d","distance":3}]}]
|
json
|
A massive result for Senegal. One that will bolster its confidence heading into the Africa Cup of Nations. The side is now unbeaten in eight games, with its latest victim being the mighty Brazil.
The night started on a perfect not for Menezes when Paqueta scored the opener. Senega not only pulled level but hit two more in the early minutes of the second half.
Marquinhos’ goal from a set piece sparked some hope for Brazil but it fell short. Mane’s penalty was the final nail in the coffin.
That is it from our side. Thanks for tuning in!
|
english
|
A subscription to JoVE is required to view this content.
You will only be able to see the first 2 minutes.
The JoVE video player is compatible with HTML5 and Adobe Flash. Older browsers that do not support HTML5 and the H.264 video codec will still use a Flash-based video player. We recommend downloading the newest version of Flash here, but we support all versions 10 and above.
If that doesn't help, please let us know.
Please note that all translations are automatically generated.
Sebrafisken er en viktig modell for å forstå nyreutvikling. Her er en in situ hybridiseringsprotokoll optimalisert for å oppdage genuttrykk i sebrafisk larver og ungdommer under mesonephros utvikling.
Denne protokollen er betydelig fordi den tillater bestemmelse av genuttrykk hos eldre sebrafisk larver og ungdommer under metamorfose. Fordelen med denne teknikken er at flere trinn er optimalisert for sondeinntrengning og visualisering av nyrene. Til å begynne med, sett opp voksen sebrafisk for å mate ved å legge til en mannlig og en kvinnelig fisk i en parringstank sent på ettermiddagen etter deres siste måltid.
Neste dag samler du embryoene i Petri-plater som inneholder E3-medium. Fem dager etter befruktning, plasser en 400-mikrometer skjerm i en 2,8-liters tank og fyll den med 2 centimeter systemvann. Tilsett deretter larven fra en Petri-tallerken.
For å fikse larven, fjern en larvetank på ønsket tidspunkt, bruk deretter et nett og overfør pipette med spissen avskåret, overfør larven til Petri-platen. Deretter legger du til to milliliter 2% trikain for å immobilisere larven. Etter immobilisering, erstatt trikainen med 20 milliliter festeløsning.
Etter 30 minutter, overfør larven til et 50 milliliter rør som inneholder 25 milliliter fersk festeløsning. Deretter må du sørge for at hetten er stram, sakte rocke røret ved fire grader Celsius i to dager. På dag tre erstatter du festeløsningen med 20 milliliter PBST og overfører deretter larven til en Petri-plate.
For å måle larven, plasser Petri-platen på toppen av en flat linjal under et dissekerende mikroskop, og bruk deretter en øyenvippemanipulator, flytt hver larve på linjalen for å måle den totale lengden. Etter å ha målt alle larver, kombiner flere larver av lignende lengder på ett 5,5 milliliter hetteglass med PBST. For dehydrering, erstatt PBST i hetteglasset med fire milliliter 100% metanol, og lagre deretter hetteglasset på minus 20 grader Celsius i to dager.
For rehydrering, erstatt 100% metanol med fire milliliter av en 75% metanol og 25% PBST-løsning og rock hetteglasset i fem minutter. Bytt deretter ut metanol- og PBST-oppløsningen med fire milliliter fersk PBST og rock hetteglasset igjen i 10 minutter. For Proteinase K-fordøyelsen, erstatt PBST med to milliliter proteinase K-løsning og gyng hetteglasset ved romtemperatur i 30 minutter.
Deretter, for bleking, overfør larven til en seksbrønnsplate og erstatt PBST med tre milliliter fersk blekingsløsning. Etter fullstendig forsvinning av pigmentering langs mesonephros, overfør larven tilbake til et hetteglass med glass, erstatt blekingsløsningen med fire milliliter PBST, og rock hetteglasset i 10 minutter. For pre-hybridisering, erstatt festeløsningen med fire milliliter PBST og rock hetteglasset i 10 minutter, og erstatt deretter PBST med fire milliliter Hyb-løsning og stein i 10 minutter.
Etter to ekstra inkubasjoner i Hyb-løsningen, erstatt løsningen med fire milliliter hyb +løsning. Fortynn samtidig EGFP fluorescein-sonden en til 100 i 500 mikroliter hybridisering pluss løsning, og inkuber hetteglasset og sonden ved 70 grader Celsius over natten. Neste dag, for å hybridisere sonden, erstatt Hyb + -løsningen i hetteglasset med den forvarmede sonden og inkuber ved 70 grader Celsius over natten.
Neste dag legger du til 50 milliliter forvarmet 0,2 ganger SSCT i et 50 milliliterrør. Sett deretter en 100-mikrometer cellesil inn i toppen av røret, overfør larven fra hetteglasset i cellesilen, og sørg for at larven er nedsenket i bufferen, inkuber hetteglasset ved 70 grader Celsius i to timer. Etter inkubasjonen, overfør cellesilen til et nytt rør som inneholder forvarmet 0,2 ganger SSCT, og inkuber igjen ved 70 grader Celsius i to timer.
Deretter, for blokkering, overfør larven til et nytt hetteglass og la det avkjøles til romtemperatur. Bytt deretter ut 0,2 ganger SSCT-løsningen med fire milliliter av en 67%0,2 ganger SSCT og 33% MABT-løsning og rock hetteglasset ved romtemperatur i 10 minutter. Deretter erstatter du SSCTT MABT-oppløsningen med fire milliliter fersk MABT, og inkuberer hetteglasset på en rocker i 10 minutter.
Bytt deretter MABT med fire milliliter blokkeringsløsning og inkuber fire grader Celsius over natten. Neste dag erstatter du blokkeringsløsningen med en antistoffløsning og inkuberer ved fire grader Celsius i to dager. For antistoffvask, overfør larven til et 50 milliliter rør, legg deretter til 40 milliliter PBST2, og legg røret som ligger på siden for overnatting inkubasjon ved fire grader Celsius.
På dag 12, etter å ha overført lavaen til en seksbrønnsplate, erstatt PBST2 med tre milliliter fargebuffer. Etter en fem minutters inkubasjon på en rocker, erstatt fargingsbufferen med tre milliliter av fargeløsningen. Når ønsket fargingsintensitet er nådd, erstatt fargingsløsningen med tre milliliter stoppløsning og stein i 30 minutter.
Overfør deretter larven til et nytt hetteglass av glass, erstatt stoppløsningen med fire milliliter fersk festeløsning, og inkuber i en time ved romtemperatur. For avbildning, erstatt festeløsningen med fire milliliter fersk PBST. Etter en 10 minutters inkubasjon på en rocker, overfør larven til en seksbrønnsplate, erstatt deretter PBST med fire milliliter fersk PBST og rock platen igjen i 10 minutter.
Deretter legger du til tre milliliter 50% glyserol i PBST og rocker i 10 minutter, deretter, ved hjelp av et dissekerende mikroskop, bilde larven direkte i seksbrønnplaten. Denne in situ hybridiseringsprotokollen merker effektivt nyreforfederceller og ulike nephronstrukturer ved hjelp av mesonephros utvikling. Den første mesonephric nephron dannes på ca 5,2 millimeter dorsal til pronephros.
Klynger av stamceller er til stede under mesonephros utvikling i tillegg til enkelt forfedre celler. I større ungdommer kan bakgrunnsfarging forekomme i somittene. Totalt sett kan denne metoden brukes til å studere andre vev som dannes under metamorfose, i tillegg til dissekerte voksne organer.
|
english
|
15 1-5 In the twenty-seventh year of Jeroboam king of Israel, Azariah son of Amaziah became king in Judah. He was sixteen years old when he began his rule and he was king for fifty-two years in Jerusalem. His mother’s name was Jecoliah. She was from Jerusalem. He did well in the eyes of God, following in the footsteps of his father Amaziah. But he also failed to get rid of the local sex-and-religion shrines; they continued to be popular with the people. God afflicted the king with a bad skin disease until the day of his death. He lived in the palace but no longer acted as king; his son Jotham ran the government and ruled the country.
6-7 The rest of the life and times of Azariah, everything he accomplished, is written in The Chronicles of the Kings of Judah. Azariah died and was buried with his ancestors in the City of David. Jotham his son was king after him.
8-9 In the thirty-eighth year of Azariah king of Judah, Zechariah son of Jeroboam became king over Israel in Samaria. He lasted only six months. He lived a bad life before God, no different from his ancestors. He continued in the line of Jeroboam son of Nebat who led Israel into a life of sin.
10 Shallum son of Jabesh conspired against him, assassinated him in public view, and took over as king.
11-12 The rest of the life and times of Zechariah is written plainly in The Chronicles of the Kings of Israel. That completed the word of God that was given to Jehu, namely, “For four generations your sons will sit on the throne of Israel.” Zechariah was the fourth.
13 Shallum son of Jabesh became king in the thirty-ninth year of Azariah king of Judah. He was king in Samaria for only a month.
14 Menahem son of Gadi came up from Tirzah to Samaria. He attacked Shallum son of Jabesh and killed him. He then became king.
15 The rest of the life and times of Shallum and the account of the conspiracy are written in The Chronicles of the Kings of Israel.
16 Using Tirzah as his base, Menahem opened his reign by smashing Tiphsah, devastating both the town and its suburbs because they didn’t welcome him with open arms. He savagely ripped open all the pregnant women.
17-18 In the thirty-ninth year of Azariah king of Judah, Menahem son of Gadi became king over Israel. He ruled from Samaria for ten years. As far as God was concerned he lived an evil life. Sin for sin, he repeated the sins of Jeroboam son of Nebat, who led Israel into a life of sin.
19-20 Then Tiglath-Pileser III king of Assyria showed up and attacked the country. But Menahem made a deal with him: He bought his support by handing over about thirty-seven tons of silver. He raised the money by making every landowner in Israel pay fifty shekels to the king of Assyria. That satisfied the king of Assyria, and he left the country.
21-22 The rest of the life and times of Menahem, everything he did, is written in The Chronicles of the Kings of Israel. Menahem died and joined his ancestors. His son Pekahiah became the next king.
23-24 In the fiftieth year of Azariah king of Judah, Pekahiah son of Menahem became king of Israel. He ruled in Samaria for two years. In God’s eyes he lived an evil life. He stuck to the old sin tracks of Jeroboam son of Nebat, who led Israel into a life of sin.
25 And then his military aide Pekah son of Remaliah conspired against him—killed him in cold blood while he was in his private quarters in the royal palace in Samaria. He also killed Argob and Arieh. Fifty Gadites were in on the conspiracy with him. After the murder he became the next king.
26 The rest of the life and times of Pekahiah, everything he did, is written in The Chronicles of the Kings of Israel.
27-28 In the fifty-second year of Azariah king of Judah, Pekah son of Remaliah became king of Israel in Samaria. He ruled for twenty years. In God’s view he lived an evil life; he didn’t deviate so much as a hair’s breadth from the path laid down by Jeroboam son of Nebat, who led Israel into a life of sin.
29 During the reign of Pekah king of Israel, Tiglath-Pileser III king of Assyria invaded the country. He captured Ijon, Abel Beth Maacah, Janoah, Kedesh, Hazor, Gilead, Galilee—the whole country of Naphtali—and took everyone captive to Assyria.
30 But then Hoshea son of Elah mounted a conspiracy against Pekah son of Remaliah. He assassinated him and took over as king. This was in the twentieth year of Jotham son of Uzziah.
31 The rest of the life and times of Pekah, everything he did, is written in The Chronicles of the Kings of Israel.
32-35 In the second year of Pekah son of Remaliah king of Israel, Jotham son of Uzziah became king in Judah. He was twenty-five years old when he became king and reigned sixteen years in Jerusalem. His mother’s name was Jerusha daughter of Zadok. He acted well in God’s eyes, following in the steps of his father Uzziah. But he didn’t interfere with the traffic to the neighborhood sex-and-religion shrines; they continued, as popular as ever. The construction of the High Gate to The Temple of God was his work.
36-38 The rest of the life and times of Jotham, the record of his work, is written in The Chronicles of the Kings of Judah. It was during these years that God began sending Rezin king of Aram and Pekah son of Remaliah to attack Judah. Jotham died and joined his ancestors. They buried him in the family cemetery in the City of David. His son Ahaz was the next king.
|
english
|
<gh_stars>1-10
{"_id": "5436e3c9bae478396759f269", "meta": {"clinical": {"benign_malignant": "benign", "age_approx": 45, "sex": "male", "diagnosis": "nevus", "diagnosis_confirm_type": null, "melanocytic": true}, "acquisition": {"image_type": "dermoscopic", "pixelsX": 1456, "pixelsY": 1018}}, "name": "ISIC_0000204"}
|
json
|
Last week, while we received more bad news on the Satyam Computer Services fraud saga and the global recession, one piece of information that stood out was microchip maker Intel's funding of three Indian companies amounting to $23 million, writes N Madhavan.
News that bucks a trend always makes eyebrows move up. Last week, while we received more bad news on the Satyam Computer Services fraud saga and the global recession, one piece of information that stood out was microchip maker Intel's funding of three Indian companies amounting to $23 million.
The break-up is not available, but the substantial chunk of this seems to have gone for One97 Communications, a Noida-based company which is quietly marching ahead in the word of mobile commerce and content. A startup company getting something in the range of Rs. 50 crore in the current market conditions is not a joke.
Increasingly, mobile phones offer everything from jokes and ringtones to other content and commercial deals. "Social software" firms like One97 enable this by creating business models and technology platforms that help telephone service operators and partners reach across to end-users, share content, price them and get paid for them.
The rise of 3G telephony and smartphones will drive value added service (VAS) revenues, aiding social software companies like One97. This company is aiming for revenues of $100 million (that's nearly Rs 500 crore) in 2010.
Another company to watch out for will be Hungama. com – thus for known as Virtual Marketing India Pvt Ltd. Headed by Neeraj Roy, who has tenaciously hung on the "DotCom" dream, Hungama has a Bollywood portal (www. bollywoodhungama. com, earlier known as Indiafm. com), a gaming site and plenty of technological applications lurking beneath them.
Roy recently dropped in to my office to explain his vision. I could catch on to just bits of what he said, given the back-end complexity of partnerships and technologies. But it was simple enough for me to understand that companies that hide the back-end complexity while making things easier for content-wallahs and customers at the front-end will have a roaring time in the coming days.
|
english
|
<gh_stars>1-10
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: itkDenseFrequencyContainer.cxx
Language: C++
Date: $Date$
Version: $Revision$
Copyright (c) Insight Software Consortium. All rights reserved.
See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notices for more information.
=========================================================================*/
#include "itkDenseFrequencyContainer.h"
namespace itk{
namespace Statistics{
DenseFrequencyContainer
::DenseFrequencyContainer()
{
m_FrequencyContainer = FrequencyContainerType::New();
m_TotalFrequency = NumericTraits< TotalFrequencyType >::Zero;
}
void
DenseFrequencyContainer
::Initialize(unsigned long length)
{
m_FrequencyContainer->Reserve(length);
this->SetToZero();
}
void
DenseFrequencyContainer
::SetToZero()
{
m_FrequencyContainer->Fill( NumericTraits< FrequencyType >::Zero );
m_TotalFrequency = NumericTraits< TotalFrequencyType >::Zero;
}
bool
DenseFrequencyContainer
::SetFrequency(const InstanceIdentifier id, const FrequencyType value)
{
if( id >= m_FrequencyContainer->Size() )
{
return false;
}
FrequencyType frequency = this->GetFrequency(id);
(*m_FrequencyContainer)[id] = value;
m_TotalFrequency += (value - frequency);
return true;
}
DenseFrequencyContainer::FrequencyType
DenseFrequencyContainer
::GetFrequency(const InstanceIdentifier id) const
{
if( id >= m_FrequencyContainer->Size() )
{
return NumericTraits< FrequencyType >::Zero;
}
return (*m_FrequencyContainer)[id];
}
bool
DenseFrequencyContainer
::IncreaseFrequency(const InstanceIdentifier id, const FrequencyType value)
{
if( id >= m_FrequencyContainer->Size() )
{
return false;
}
FrequencyType frequency = this->GetFrequency(id);
const FrequencyType largestIntegerThatFitsInFloat = 16777216;
if( largestIntegerThatFitsInFloat - frequency < value )
{
itkExceptionMacro("Frequency container saturated for Instance ");
}
else
{
(*m_FrequencyContainer)[id] = frequency + value;
}
m_TotalFrequency += value;
return true;
}
void
DenseFrequencyContainer
::PrintSelf(std::ostream& os, Indent indent) const
{
Superclass::PrintSelf(os,indent);
}
} // end of namespace Statistics
} // end of namespace itk
|
cpp
|
<reponame>BrandonDyer64/wcpp<filename>index.js
const { getCallerDir } = require('./util/caller')
const path = require('path')
const fs = require('fs')
const util = require('util')
const ENVIRONMENT_IS_WEB = typeof window === 'object'
function toArrayBuffer(buf) {
var ab = new ArrayBuffer(buf.length)
var view = new Uint8Array(ab)
for (var i = 0; i < buf.length; ++i) {
view[i] = buf[i]
}
return ab
}
const cppExportCache = {}
// Override require to accept C++ files
const Module = require('module')
const originalRequire = Module.prototype.require
Module.prototype.require = function() {
const file = arguments[0]
if (file.endsWith('.cpp')) {
return module.exports(file, 4)
} else {
return originalRequire.apply(this, arguments)
}
}
// Load as js
module.exports = (file, shift = 2) => {
if (!file) {
return
}
const callerDir = getCallerDir(shift)
file = (file + '%').replace('.cpp%', '').replace('%', '')
const module = require(`${callerDir}/wasm/${file}.js`)
let exports = {}
for (let i in module) {
if (i.toString() == '_module') {
exports = module[i]
}
}
for (let i in module) {
if (i.toString().startsWith('_')) {
exports[i.substr(1)] = module[i]
}
}
return new Promise((resolve, reject) => {
module['onRuntimeInitialized'] = function() {
resolve(exports)
}
})
}
module.exports.sync = () => {
if (ENVIRONMENT_IS_WEB) {
console.error(
'It is not reccomended to use wcpp.sync() in a web environment.',
'Large files will not be imported.'
)
}
const Module = require('module')
Module.prototype.require = function() {
const file = arguments[0]
if (file.endsWith('.cpp')) {
return requireSync(file, 4)
} else {
return originalRequire.apply(this, arguments)
}
}
}
// Load file synchronously
const requireSync = (file, shift = 2) => {
file = (file + '%').replace('.cpp%', '').replace('%', '')
const env = {
memoryBase: 0,
tableBase: 0,
memory: new WebAssembly.Memory({
initial: 256
}),
table: new WebAssembly.Table({
initial: 0,
element: 'anyfunc'
})
}
const callerDir = getCallerDir(shift)
const source = fs.readFileSync(`${callerDir}/wasm/${file}.wasm`)
if (source in cppExportCache) {
return cppExportCache[source]
}
const module = new WebAssembly.Module(new Uint8Array(source), {
env: env
})
const instance = new WebAssembly.Instance(module)
let exports = {}
for (let i in instance.exports) {
if (i.toString() == '_module') {
exports = instance.exports[i]
}
}
cppExportCache[source] = exports
for (let i in instance.exports) {
if (i.toString().startsWith('_')) {
exports[i.substr(1)] = instance.exports[i]
}
}
return exports
}
// Load file asynchronously
module.exports.as = file => {
return new Promise((resolve, reject) => {
const env = {
memoryBase: 0,
tableBase: 0,
memory: new WebAssembly.Memory({
initial: 256
}),
table: new WebAssembly.Table({
initial: 0,
element: 'anyfunc'
})
}
const callerDir = getCallerDir()
const source = fs.readFileSync(`${callerDir}/wasm/${file}.wasm`)
const instance = WebAssembly.instantiate(new Uint8Array(source), {
env: env
})
.then(result => {
resolve(result.instance.exports)
})
.catch(e => {
// error caught
reject(e)
})
})
}
|
javascript
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.