text
stringlengths 2
9.79k
| meta
dict | sentences_perturbed
int64 0
2
⌀ | doc_stats
dict |
|---|---|---|---|
# coding: utf-8
describe PDF::Reader::Filter do
describe "#with" do
context "when passed :ASCII85Decode" do
it "returns the appropriate class" do
expect(PDF::Reader::Filter.with(:ASCII85Decode)).to be_a(PDF::Reader::Filter::Ascii85)
end
end
context "when passed :ASCIIHexDecode" do
it "returns the appropriate class" do
expect(PDF::Reader::Filter.with(:ASCIIHexDecode)).to be_a(PDF::Reader::Filter::AsciiHex)
end
end
context "when passed :CCITTFaxDecode" do
it "returns the appropriate class" do
expect(PDF::Reader::Filter.with(:CCITTFaxDecode)).to be_a(PDF::Reader::Filter::Null)
end
end
context "when passed :DCTDecode" do
it "returns the appropriate class" do
expect(PDF::Reader::Filter.with(:DCTDecode)).to be_a(PDF::Reader::Filter::Null)
end
end
context "when passed :ASCII85Decode" do
it "returns the appropriate class" do
expect(PDF::Reader::Filter.with(:ASCII85Decode)).to be_a(PDF::Reader::Filter::Ascii85)
end
end
context "when passed :FlateDecode" do
it "returns the appropriate class" do
expect(PDF::Reader::Filter.with(:FlateDecode)).to be_a(PDF::Reader::Filter::Flate)
end
end
context "when passed :JBIG2ecode" do
it "returns the appropriate class" do
expect(PDF::Reader::Filter.with(:JBIG2Decode)).to be_a(PDF::Reader::Filter::Null)
end
end
context "when passed :JPXDecode" do
it "returns the appropriate class" do
expect(PDF::Reader::Filter.with(:JPXDecode)).to be_a(PDF::Reader::Filter::Null)
end
end
context "when passed :LZWDecode" do
it "returns the appropriate class" do
expect(PDF::Reader::Filter.with(:LZWDecode)).to be_a(PDF::Reader::Filter::Lzw)
end
end
context "when passed :RunLengthDecode" do
it "returns the appropriate class" do
expect(PDF::Reader::Filter.with(:RunLengthDecode)).to be_a(PDF::Reader::Filter::RunLength)
end
end
context "when passed an unrecognised filter" do
it "raises an exception" do
expect {
PDF::Reader::Filter.with(:FooDecode)
}.to raise_error(PDF::Reader::UnsupportedFeatureError)
end
end
end
end
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
cheats = 14
cheat0_desc = "Misc Codes"
cheat1_desc = "Disable AI"
cheat1_code = "02036440+E3A01000"
cheat1_enable = false
cheat2_desc = "AI Doesn't Attack"
cheat2_code = "02037328+E3A00000+02037338+E3A00000"
cheat2_enable = false
cheat3_desc = "Human Torch / Silver Surfer Codes"
cheat4_desc = "Infinite Health"
cheat4_code = "620D5010+00000000+B20D5010+00000000+20000150+00000096+D2000000+00000000"
cheat4_enable = false
cheat5_desc = "Invincible"
cheat5_code = "620D5010+00000000+B20D5010+00000000+00000158+0000FFFF+D2000000+00000000"
cheat5_enable = false
cheat6_desc = "Spaceship Codes"
cheat7_desc = "Infinite Health"
cheat7_code = "623AFDE8+00000000+B23AFDE8+00000000+B0000074+00000000+20000018+000000FF+D2000000+00000000"
cheat7_enable = false
cheat8_desc = "Invincible"
cheat8_code = "623AFDE8+00000000+B23AFDE8+00000000+B0000074+00000000+00000020+0000FFFF+D2000000+00000000"
cheat8_enable = false
cheat9_desc = "Boss Battle Codes"
cheat10_desc = "HP Never Decrease"
cheat10_code = "DA000000+020D9DE8+D7000000+020D9DE4+D2000000+00000000"
cheat10_enable = false
cheat11_desc = "1 hit KO boss battle"
cheat11_code = "94000130+FEFF0000+120D9DE0+00000001+D2000000+00000000"
cheat11_enable = false
cheat12_desc = "Backlight Codes"
cheat13_desc = "DS Lite Backlight Control"
cheat13_code = "94000130+FCFB0000+023FE074+012FFF11+E0000000+000000A8+E28F0001+E12FFF10+A21AB5F0+88234C24+80138811+D02A428B+25803490+F0002000+1C06F82A+F0002004+2703F826+21404007+D003420B+420B2180+E018D00C+4231210C+2F03D006+1C79D013+F0002004+E00EF816+E0094331+438E210C+2F001C31+1E79D004+F0002004+E002F80A+F0002000+BCF0F806+4718BC08+30800000+88222100+D1FC422A+80224A08+88208060+D1FC4228+80220C12+88228061+D1FC422A+21FF8860+47704008+04000130+80028802+023FE074+E3520003+D2000000+00000000"
cheat13_enable = false
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
Pod::Spec.new do |s|
s.name = "KRLCollectionViewGridLayout"
s.version = "1.0.0"
s.summary = "A UICollectionViewLayout that specifies item size and location by number of columns."
s.description = <<-DESC
This layout is an alternative to UICollectionViewFlowLayout that positions and sizes items using a defined number of columns and an aspect ratio property which force the size of cells, rather than the cells' size telling the layout how to lay them out. By default, this will always show the same number of items in a row no matter how large or small the collection view is.
DESC
s.homepage = "http://github.com/klundberg/KRLCollectionViewGridLayout"
s.license = 'MIT'
s.author = { "Kevin Lundberg" => "kevin@klundberg.com" }
s.source = { :git => "https://github.com/klundberg/KRLCollectionViewGridLayout.git", :tag => "v#{s.version}" }
s.source_files = 'Classes/*.{h,m}'
s.ios.deployment_target = '6.0'
s.tvos.deployment_target = '9.0'
end
| null | 0
|
{
"advantage_score_max": 0,
"advantage_score_mean": 0,
"advantage_score_min": 0,
"advantage_score_std": 0,
"advantage_scores": [],
"baseline_doc_loss": 1.0881943702697754,
"baseline_truncated": false,
"doc_advantage_score": 1.0762152671813965,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 0,
"replacement_paraphrases_length_chars": 0,
"sentences_perturbed": 0,
"target_doc_loss": 1.0111308097839355,
"target_truncated": false,
"threshold_passing_sentences": 0,
"total_doc_length_chars": 1086,
"total_sentences": 5,
"truncated": false
}
|
[[_events_eventpublisher_transformation]]
= The @EventPublisher AST Transformation
Any component may gain the ability to publish events through an `{link_event_router}`
instance. You only need annotate the class with `{link_event_publisher_ast}`
and it will automatically gain all methods exposed by `{link_event_publisher}`.
The following example shows a trivial usage of this feature:
[source,groovy,linenums,options="nowrap"]
----
@griffon.transform.core.EventPublisher
class Publisher {
void doit(String name) {
publishEvent('arg', [name])
}
void doit() {
publishEvent('empty')
}
}
----
The application's event router will be used by default. If you'd like your custom
event publisher to use a private `{link_event_router}`, then you must define a binding
for it using a specific name, like this:
[source,groovy,linenums,options="nowrap"]
----
import griffon.core.injection.Module
import griffon.core.event.EventRouter
import org.kordamp.jipsy.ServiceProviderFor
import org.codehaus.griffon.runtime.core.injection.AbstractModule
import org.codehaus.griffon.runtime.core.event.DefaultEventRouter
import javax.inject.Named
import static griffon.util.AnnotationUtils.named
@ServiceProviderFor(Module)
@Named
class ApplicationModule extends AbstractModule {
@Override
protected void doConfigure() {
bind(EventRouter)
.withClassifier(named('my-private-event-router'))
.to(DefaultEventRouter)
.asSingleton()
}
}
----
Next, specify the named `{link_event_router}` as a parameter on the `{link_event_publisher_ast}`
transformation:
[source,groovy,linenums,options="nowrap"]
----
@griffon.transform.core.EventPublisher('my-private-event-router')
class Publisher {
void doit(String name) {
publishEvent('arg', [name])
}
void doit() {
publishEvent('empty')
}
}
----
| null | 0
|
{
"advantage_score_max": 0,
"advantage_score_mean": 0,
"advantage_score_min": 0,
"advantage_score_std": 0,
"advantage_scores": [],
"baseline_doc_loss": 1.4376230239868164,
"baseline_truncated": false,
"doc_advantage_score": 1.1313068866729736,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 0,
"replacement_paraphrases_length_chars": 0,
"sentences_perturbed": 0,
"target_doc_loss": 1.2707630395889282,
"target_truncated": false,
"threshold_passing_sentences": 0,
"total_doc_length_chars": 1876,
"total_sentences": 4,
"truncated": false
}
|
package com.gentics.mesh.core.data.service.transformation;
import java.util.Comparator;
import com.gentics.mesh.core.rest.common.AbstractResponse;
/**
* Comparator for rest model objects.
*
* @param <T>
*/
public class UuidRestModelComparator<T extends AbstractResponse> implements Comparator<T> {
@Override
public int compare(T o1, T o2) {
// TODO use order and sorting here?
String uuid1 = o1.getUuid();
String uuid2 = o2.getUuid();
if (uuid1 == null) {
uuid1 = "";
}
if (uuid2 == null) {
uuid2 = "";
}
return uuid1.compareTo(uuid2);
}
}
| null | 0
|
{
"advantage_score_max": 0,
"advantage_score_mean": 0,
"advantage_score_min": 0,
"advantage_score_std": 0,
"advantage_scores": [],
"baseline_doc_loss": 0.9023732542991638,
"baseline_truncated": false,
"doc_advantage_score": 1.2080222368240356,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 0,
"replacement_paraphrases_length_chars": 0,
"sentences_perturbed": 0,
"target_doc_loss": 0.7469839453697205,
"target_truncated": false,
"threshold_passing_sentences": 0,
"total_doc_length_chars": 575,
"total_sentences": 3,
"truncated": false
}
|
// hex.h - originally written and placed in the public domain by Wei Dai
/// \file hex.h
/// \brief Classes for HexEncoder and HexDecoder
#ifndef CRYPTOPP_HEX_H
#define CRYPTOPP_HEX_H
#include "cryptlib.h"
#include "basecode.h"
NAMESPACE_BEGIN(CryptoPP)
/// \brief Converts given data to base 16
class CRYPTOPP_DLL HexEncoder : public SimpleProxyFilter
{
public:
/// \brief Construct a HexEncoder
/// \param attachment a BufferedTrasformation to attach to this object
/// \param uppercase a flag indicating uppercase output
/// \param groupSize the size of the output grouping
/// \param separator the separator to use between groups
/// \param terminator the terminator append after processing
HexEncoder(BufferedTransformation *attachment = NULLPTR, bool uppercase = true, int groupSize = 0, const std::string &separator = ":", const std::string &terminator = "")
: SimpleProxyFilter(new BaseN_Encoder(new Grouper), attachment)
{
IsolatedInitialize(MakeParameters(Name::Uppercase(), uppercase)(Name::GroupSize(), groupSize)(Name::Separator(), ConstByteArrayParameter(separator))(Name::Terminator(), ConstByteArrayParameter(terminator)));
}
void IsolatedInitialize(const NameValuePairs ¶meters);
};
/// \brief Decode base 16 data back to bytes
class CRYPTOPP_DLL HexDecoder : public BaseN_Decoder
{
public:
/// \brief Construct a HexDecoder
/// \param attachment a BufferedTrasformation to attach to this object
HexDecoder(BufferedTransformation *attachment = NULLPTR)
: BaseN_Decoder(GetDefaultDecodingLookupArray(), 4, attachment) {}
void IsolatedInitialize(const NameValuePairs ¶meters);
private:
static const int * CRYPTOPP_API GetDefaultDecodingLookupArray();
};
NAMESPACE_END
#endif
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
/*
* Copyright (c) 2020, WSO2 Inc. (http://www.wso2.org) All Rights Reserved.
WSO2 Inc. provides this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
package org.ballerinalang.net.http.websocket.client;
import java.util.List;
/**
* Represents a failover client connector config.
*
* @since 1.2.0
*/
public class FailoverContext {
private int currentIndex = 0;
private int failoverInterval = 0;
private boolean firstConnectionEstablished = false;
private List<String> targetUrls = null;
private int initialIndex = 0;
/**
* Gets the index.
*
* @return currentIndex
*/
public int getCurrentIndex() {
return currentIndex;
}
/**
* Assigns the index of the `FailoverContext` to the variable index.
*
* @param currentIndex - a current index
*/
public void setCurrentIndex(int currentIndex) {
this.currentIndex = currentIndex;
}
/**
* Gets the target URLs.
*
* @return targetUrls
*/
public List<String> getTargetUrls() {
return targetUrls;
}
/**
* Assigns the target URLs of the `FailoverContext` to the `targetUrls` variable.
*
* @param targetUrls - target URLs
*/
void setTargetUrls(List<String> targetUrls) {
this.targetUrls = targetUrls;
}
/**
* Assigns the failover interval of the `FailoverContext` to the `failoverInterval` variable.
*
* @param failoverInterval - a failover interval
*/
void setFailoverInterval(int failoverInterval) {
this.failoverInterval = failoverInterval;
}
/**
* Assigns the failover interval of the `FailoverContext` to the `failoverInterval` variable.
* @return failoverInterval
*/
public int getFailoverInterval() {
return failoverInterval;
}
/**
* Gets the `firstConnectionEstablished`.
*
* @return firstConnectionEstablished
*/
public boolean isFirstConnectionEstablished() {
return firstConnectionEstablished;
}
/**
* Assigns the connection state of the `FailoverContext` to the `firstConnectionEstablished` variable.
*/
public void setFirstConnectionEstablished() {
this.firstConnectionEstablished = true;
}
/**
* Gets the initial index.
*
* @return initialIndex
*/
public int getInitialIndex() {
return initialIndex;
}
/**
* Assigns the `initialIndex` of the FailoverContext to the `initialIndex` variable.
*
* @param initialIndex - the initial index
*/
public void setInitialIndex(int initialIndex) {
this.initialIndex = initialIndex;
}
}
| null | 1
|
{
"advantage_score_max": 5.113622665405273,
"advantage_score_mean": 3.047611951828003,
"advantage_score_min": 1.365671157836914,
"advantage_score_std": 1.5540093183517456,
"advantage_scores": [
5.113622665405273,
2.6635422706604004,
1.365671157836914
],
"baseline_doc_loss": 0.4348471462726593,
"baseline_truncated": false,
"doc_advantage_score": 1.1913648843765259,
"length_change_ratio": 0.9337349397590361,
"net_length_change_chars": -11,
"original_sentences_length_chars": 166,
"replacement_paraphrases_length_chars": 155,
"sentences_perturbed": 1,
"target_doc_loss": 0.36499911546707153,
"target_truncated": false,
"threshold_passing_sentences": 3,
"total_doc_length_chars": 3213,
"total_sentences": 16,
"truncated": false
}
|
/**
* Copyright 2008 - 2019 The Loon Game Engine Authors
*
* Licensed under the Apache License, Version 2.0 (the "License"); you may not
* use this file except in compliance with the License. You may obtain a copy of
* the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* 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.
*
* @project loon
* @author cping
* @email：javachenpeng@yahoo.com
* @version 0.5
*/
package loon.utils.timer;
import loon.LRelease;
import loon.LSystem;
import loon.utils.MathUtils;
import loon.utils.TArray;
import loon.utils.processes.GameProcessType;
import loon.utils.processes.RealtimeProcess;
import loon.utils.processes.RealtimeProcessManager;
/**
* 一个简单的Interval游戏事务延迟管理器,可以在其中存储多个Interval并统一提交到游戏循环中,进行统一管理.
*
* 例如:
*
* <pre>
*
* // 构建一个延迟事务管理器(默认循环执行其中事务)
* final Scheduler s = new Scheduler();
* // 若removeTask项为true,则会删除已经执行过的事务,则只所有调度仅进行一次,不会循环执行
* // final Scheduler s = new Scheduler(true);
* // 添加事务1
* s.add(new Interval() {
*
* @Override
* public void loop() {
* System.out.println("a");
* // 跳到索引2(即第三个添加的事务)
* s.setIndex(2);
* }
* });
* // 添加事务2
* s.add(new Interval() {
*
* @Override
* public void loop() {
* System.out.println("b");
* }
* });
* // 添加事务3
* s.add(new Interval() {
*
* @Override
* public void loop() {
* System.out.println("c");
* }
* });
* // 延迟1秒
* s.setDelay(LSystem.SECOND);
* s.start();
* </pre>
*
*
*/
public class Scheduler implements LRelease {
private static class SchedulerProcess extends RealtimeProcess {
private Scheduler sched = null;
public SchedulerProcess(Scheduler s) {
this.sched = s;
this.setProcessType(GameProcessType.Time);
}
@Override
public void run(LTimerContext time) {
if (sched != null) {
sched.update(time);
if (sched.completed()) {
kill();
}
}
}
}
private final LTimer _loop_timer;
private SchedulerProcess _processScheduler;
private TArray<Interval> _scheduled = new TArray<Interval>(32);
private int _childIndex = 0;
private boolean _removeSequenceTask = false;
private boolean _forceWaitSequence = false;
private boolean _closed = false;
public Scheduler() {
this(0L);
}
public Scheduler(long delay) {
this(LSystem.UNKNOWN, delay);
}
public Scheduler(boolean removeTask) {
this(LSystem.UNKNOWN, removeTask);
}
public Scheduler(String name, boolean removeTask) {
this(name, 0, removeTask, true);
}
public Scheduler(String name, long delay) {
this(name, delay, false);
}
public Scheduler(boolean removeTask, boolean sequence) {
this(LSystem.UNKNOWN, 0L, removeTask, sequence);
}
public Scheduler(String name, boolean removeTask, boolean sequence) {
this(name, 0L, removeTask, sequence);
}
public Scheduler(String name, long delay, boolean removeTask) {
this(name, delay, removeTask, true);
}
/**
* Scheduler事务管理器
*
* @param name
* 事务调度管理器名称
* @param delay
* 延迟时间(默认0)
* @param removeTask
* 是否删除已运行的任务
* @param sequence
* 是否循环播放管理器中事务(此项为true,当前事务不完成不会进行下一个,若想同步进行可改为false)
*/
public Scheduler(String name, long delay, boolean removeTask, boolean sequence) {
this._loop_timer = new LTimer(name, delay);
this._removeSequenceTask = removeTask;
this._forceWaitSequence = sequence;
this._closed = false;
_forceWaitSequence = sequence;
}
public boolean isActive() {
return this._loop_timer.isActive();
}
public Scheduler start() {
this.unpause();
synchronized (RealtimeProcessManager.class) {
if (_processScheduler != null) {
RealtimeProcessManager.get().delete(_processScheduler);
}
if (_processScheduler == null || _processScheduler.isDead()) {
_processScheduler = new SchedulerProcess(this);
}
_processScheduler.setDelay(0);
RealtimeProcessManager.get().addProcess(_processScheduler);
}
return this;
}
public Scheduler kill() {
if (_processScheduler != null) {
_processScheduler.kill();
}
return this;
}
public Scheduler stop() {
this.pause();
this.kill();
return this;
}
public Scheduler pause() {
this._loop_timer.pause();
return this;
}
public Scheduler unpause() {
this._loop_timer.unpause();
return this;
}
public boolean paused() {
return !isActive();
}
public boolean add(Interval sched) {
return _scheduled.add(sched);
}
public boolean remove(Interval sched) {
return _scheduled.remove(sched);
}
public Interval removeIndex(int idx) {
return _scheduled.removeIndex(idx);
}
public Interval getIndex(int idx) {
return _scheduled.get(idx);
}
public TArray<Interval> findName(String name) {
TArray<Interval> result = new TArray<Interval>();
for (int i = _scheduled.size - 1; i > -1; i--) {
Interval u = _scheduled.get(i);
if (u != null && name.equals(u.getName())) {
result.add(u);
}
}
return result.reverse();
}
public Scheduler removeName(String name) {
for (int i = _scheduled.size - 1; i > -1; i--) {
Interval u = _scheduled.get(i);
if (u != null && name.equals(u.getName())) {
_scheduled.removeIndex(i);
}
}
return this;
}
public Scheduler clear() {
_scheduled.clear();
return this;
}
public boolean completed() {
boolean c = _scheduled.isEmpty();
if (c) {
return true;
} else {
final int size = _scheduled.size;
int count = 0;
for (int i = _sched
| null | 0
|
{
"advantage_score_max": 1.5733251571655273,
"advantage_score_mean": 1.5733251571655273,
"advantage_score_min": 1.5733251571655273,
"advantage_score_std": 0,
"advantage_scores": [
1.5733251571655273
],
"baseline_doc_loss": 0.9220898747444153,
"baseline_truncated": false,
"doc_advantage_score": 1.2962418794631958,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 0,
"replacement_paraphrases_length_chars": 0,
"sentences_perturbed": 0,
"target_doc_loss": 0.7113563418388367,
"target_truncated": false,
"threshold_passing_sentences": 1,
"total_doc_length_chars": 5683,
"total_sentences": 5,
"truncated": false
}
|
Sequel.migration do
change do
create_table :geocodings do
primary_key :id
Integer :user_id
Text :table_name
Integer :total_rows
Integer :processed_rows
DateTime :created_at, default: Sequel::CURRENT_TIMESTAMP
DateTime :updated_at, default: Sequel::CURRENT_TIMESTAMP
end
end
end
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
`timescale 1ns / 1ps
module rp_dma_s2mm_upsize
#(parameter AXI_DATA_BITS = 64,
parameter AXIS_DATA_BITS = 16,
parameter AXI_BURST_LEN = 16)(
input wire clk,
input wire rst,
output reg [7:0] req_data,
output reg req_we,
input wire [AXIS_DATA_BITS-1:0] s_axis_tdata,
input wire s_axis_tvalid,
output wire s_axis_tready,
input wire s_axis_tlast,
output reg [AXI_DATA_BITS-1:0] m_axis_tdata,
output reg m_axis_tvalid,
input wire m_axis_tready
);
localparam MUX_MAX = AXI_DATA_BITS/AXIS_DATA_BITS;
reg [1:0] mux_sel;
reg [6:0] xfer_cnt;
wire [6:0] req_len;
reg tlast;
genvar i;
assign s_axis_tready = 1'b1;
assign req_len = xfer_cnt+1;
////////////////////////////////////////////////////////////
// Name :
//
////////////////////////////////////////////////////////////
always @(posedge clk)
begin
if (rst == 1) begin
xfer_cnt <= 0;
end else begin
if ((m_axis_tvalid == 1) && (m_axis_tready == 1)) begin
if (xfer_cnt == AXI_BURST_LEN-1) begin
xfer_cnt <= 0;
end else begin
xfer_cnt <= xfer_cnt + 1;
end
end
end
end
////////////////////////////////////////////////////////////
// Name : Request Data
// Sends the transfer count and indicates if this is the
// last transfer.
////////////////////////////////////////////////////////////
always @(posedge clk)
begin
req_data <= {tlast, req_len};
end
////////////////////////////////////////////////////////////
// Name :
//
////////////////////////////////////////////////////////////
always @(posedge clk)
begin
if (rst == 1) begin
req_we <= 0;
end else begin
if (((m_axis_tvalid == 1) && (m_axis_tready == 1) && ((tlast == 1) || (xfer_cnt == AXI_BURST_LEN-1)))) begin
req_we <= 1;
end else begin
req_we <= 0;
end
end
end
////////////////////////////////////////////////////////////
// Name : Mux Select
// Selects which part of the output data should have the
// input sample assigned.
////////////////////////////////////////////////////////////
always @(posedge clk)
begin
if (rst == 1) begin
mux_sel <= 0;
end else begin
if ((s_axis_tvalid == 1) && (s_axis_tready == 1)) begin
if (mux_sel == MUX_MAX-1) begin
mux_sel <= 0;
end else begin
mux_sel <= mux_sel + 1;
end
end
end
end
////////////////////////////////////////////////////////////
// Name : TDATA
//
////////////////////////////////////////////////////////////
generate
for (i=0; i<MUX_MAX; i=i+1) begin : gen_data
always @(posedge clk)
begin
if (mux_sel == i) begin
m_axis_tdata[i*AXIS_DATA_BITS +: AXIS_DATA_BITS] <= s_axis_tdata;
end
end
end
endgenerate
////////////////////////////////////////////////////////////
// Name : TVALID
// Set the valid signal if all samples are assigned to the
// ouput data or the last sample has arrived.
////////////////////////////////////////////////////////////
always @(posedge clk)
begin
if (rst == 1) begin
m_axis_tvalid <= 0;
end else begin
if (((mux_sel == MUX_MAX-1) || (s_axis_tlast == 1)) && (s_axis_tvalid == 1) && (s_axis_tready == 1)) begin
m_axis_tvalid <= 1;
end else begin
m_axis_tvalid <= 0;
end
end
end
////////////////////////////////////////////////////////////
// Name : TLAST
// Indicates that the last sample has been sent.
////////////////////////////////////////////////////////////
always @(posedge clk)
begin
if (rst == 1) begin
tlast <= 0;
end else begin
if ((s_axis_tlast == 1) && (s_axis_tvalid == 1) && (s_axis_tready == 1)) begin
tlast <= 1;
end
end
end
endmodule
| null | 0
|
{
"advantage_score_max": 0,
"advantage_score_mean": 0,
"advantage_score_min": 0,
"advantage_score_std": 0,
"advantage_scores": [],
"baseline_doc_loss": 0.7119802832603455,
"baseline_truncated": false,
"doc_advantage_score": 1.004848837852478,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 0,
"replacement_paraphrases_length_chars": 0,
"sentences_perturbed": 0,
"target_doc_loss": 0.7085446715354919,
"target_truncated": false,
"threshold_passing_sentences": 0,
"total_doc_length_chars": 3918,
"total_sentences": 5,
"truncated": false
}
|
import {
composeButton,
composeModalPostPrivacyButton,
getNthPostPrivacyOptionInDialog,
postPrivacyButton, postPrivacyDialogButtonUnlisted,
scrollToStatus,
sleep
} from '../utils'
import { loginAsFoobar } from '../roles'
fixture`014-compose-post-privacy.js`
.page`http://localhost:4002`
test('Changes post privacy', async t => {
await loginAsFoobar(t)
await sleep(2000)
await t
.expect(postPrivacyButton.getAttribute('aria-label')).eql('Adjust privacy (currently Public)')
.click(postPrivacyButton)
.expect(getNthPostPrivacyOptionInDialog(2).exists).ok({ timeout: 30000 })
.click(getNthPostPrivacyOptionInDialog(2))
.expect(postPrivacyButton.getAttribute('aria-label')).eql('Adjust privacy (currently Unlisted)')
.click(postPrivacyButton)
.expect(getNthPostPrivacyOptionInDialog(1).exists).ok({ timeout: 30000 })
.click(getNthPostPrivacyOptionInDialog(1))
.expect(postPrivacyButton.getAttribute('aria-label')).eql('Adjust privacy (currently Public)')
})
test('can use privacy dialog within compose dialog', async t => {
await loginAsFoobar(t)
await scrollToStatus(t, 16)
await t.expect(composeButton.getAttribute('aria-label')).eql('Compose')
await sleep(2000)
await t.click(composeButton)
.click(composeModalPostPrivacyButton)
.click(postPrivacyDialogButtonUnlisted)
.expect(composeModalPostPrivacyButton.getAttribute('aria-label')).eql('Adjust privacy (currently Unlisted)')
})
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
// This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2014 Benoit Steiner <benoit.steiner.goog@gmail.com>
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
#ifndef EIGEN_CXX11_TENSOR_TENSOR_BASE_H
#define EIGEN_CXX11_TENSOR_TENSOR_BASE_H
// clang-format off
namespace Eigen {
/** \class TensorBase
* \ingroup CXX11_Tensor_Module
*
* \brief The tensor base class.
This class serves as the shared base for both Tensor and TensorMap, allowing seamless use of either type within expressions wherever needed.
*/
template<typename Derived>
class TensorBase<Derived, ReadOnlyAccessors>
{
public:
typedef internal::traits<Derived> DerivedTraits;
typedef typename DerivedTraits::Scalar Scalar;
typedef typename DerivedTraits::Index Index;
typedef typename internal::remove_const<Scalar>::type CoeffReturnType;
static const int NumDimensions = DerivedTraits::NumDimensions;
// Generic nullary operation support.
template <typename CustomNullaryOp> EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorCwiseNullaryOp<CustomNullaryOp, const Derived>
nullaryExpr(const CustomNullaryOp& func) const {
return TensorCwiseNullaryOp<CustomNullaryOp, const Derived>(derived(), func);
}
// Coefficient-wise nullary operators
EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorCwiseNullaryOp<internal::scalar_constant_op<Scalar>, const Derived>
constant(const Scalar& value) const {
return nullaryExpr(internal::scalar_constant_op<Scalar>(value));
}
EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorCwiseNullaryOp<internal::UniformRandomGenerator<Scalar>, const Derived>
random() const {
return nullaryExpr(internal::UniformRandomGenerator<Scalar>());
}
template <typename RandomGenerator> EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorCwiseNullaryOp<RandomGenerator, const Derived>
random(const RandomGenerator& gen = RandomGenerator()) const {
return nullaryExpr(gen);
}
// Tensor generation
template <typename Generator> EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorGeneratorOp<Generator, const Derived>
generate(const Generator& generator) const {
return TensorGeneratorOp<Generator, const Derived>(derived(), generator);
}
// Generic unary operation support.
template <typename CustomUnaryOp> EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorCwiseUnaryOp<CustomUnaryOp, const Derived>
unaryExpr(const CustomUnaryOp& func) const {
return TensorCwiseUnaryOp<CustomUnaryOp, const Derived>(derived(), func);
}
// Coefficient-wise unary operators
EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorCwiseUnaryOp<internal::scalar_opposite_op<Scalar>, const Derived>
operator-() const {
return unaryExpr(internal::scalar_opposite_op<Scalar>());
}
EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorCwiseUnaryOp<internal::scalar_sqrt_op<Scalar>, const Derived>
sqrt() const {
return unaryExpr(internal::scalar_sqrt_op<Scalar>());
}
EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorCwiseUnaryOp<internal::scalar_sign_op<Scalar>, const Derived>
sign() const {
return unaryExpr(internal::scalar_sign_op<Scalar>());
}
EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorCwiseUnaryOp<internal::scalar_rsqrt_op<Scalar>, const Derived>
rsqrt() const {
return unaryExpr(internal::scalar_rsqrt_op<Scalar>());
}
EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorCwiseUnaryOp<internal::scalar_square_op<Scalar>, const Derived>
square() const {
return unaryExpr(internal::scalar_square_op<Scalar>());
}
EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorCwiseUnaryOp<internal::scalar_cube_op<Scalar>, const Derived>
cube() const {
return unaryExpr(internal::scalar_cube_op<Scalar>());
}
EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorCwiseUnaryOp<internal::scalar_inverse_op<Scalar>, const Derived>
inverse() const {
return unaryExpr(internal::scalar_inverse_op<Scalar>());
}
EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorCwiseUnaryOp<internal::scalar_tanh_op<Scalar>, const Derived>
tanh() const {
return unaryExpr(internal::scalar_tanh_op<Scalar>());
}
EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorCwiseUnaryOp<internal::scalar_lgamma_op<Scalar>, const Derived>
lgamma() const {
return unaryExpr(internal::scalar_lgamma_op<Scalar>());
}
EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorCwiseUnaryOp<internal::scalar_digamma_op<Scalar>, const Derived>
digamma() const {
return unaryExpr(internal::scalar_digamma_op<Scalar>());
}
// igamma(a = this, x = other)
template<typename OtherDerived> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE
const TensorCwiseBinaryOp<internal::scalar_igamma_op<Scalar>, const Derived, const OtherDerived>
igamma(const OtherDerived& other) const {
return binaryExpr(other.derived(), internal::scalar_igamma_op<Scalar>());
}
// igammac(a = this, x = other)
template<typename OtherDerived> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE
const TensorCwiseBinaryOp<internal::scalar_igammac_op<Scalar>, const Derived, const OtherDerived>
igammac(const OtherDerived& other) const {
return binaryExpr(other.derived(), internal::scalar_igammac_op<Scalar>());
}
// zeta(x = this, q = other)
template<typename OtherDerived> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE
const TensorCwiseBinaryOp<internal::scalar_zeta_op<Scalar>, const Derived, const OtherDerived>
zeta(const OtherDerived& other) const {
return binaryExpr(other.derived(), internal::scalar_zeta_op<Scalar>());
}
// polygamma(n = this, x = other)
template<typename OtherDerived> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE
const TensorCwiseBinaryOp<internal::scalar_polygamma_op<Scalar>, const Derived, const OtherDerived>
polygamma(const OtherDerived& other) const {
return binaryExpr(other.derived(), internal::scalar_polygamma_op<Scalar>());
}
EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorCwiseUnaryOp<internal::scalar_erf_op<Scalar>, const Derived>
erf() const {
return unaryExpr(internal::scalar_erf_op<Scalar>());
}
EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorCwiseUnaryOp<internal::scalar_erfc_op<Scalar>, const Derived>
erfc() const {
return unaryExpr(internal::scalar_erfc_op<Scalar>());
}
EIGEN_DEVICE_FUNC
EIGEN_STRONG_INLINE const TensorCwiseUnaryOp<internal::scalar_s
| null | 1
|
{
"advantage_score_max": 1.5093873739242554,
"advantage_score_mean": 1.363268256187439,
"advantage_score_min": 1.173828363418579,
"advantage_score_std": 0.14037440717220306,
"advantage_scores": [
1.5093873739242554,
1.4065885543823242,
1.173828363418579
],
"baseline_doc_loss": 0.3727756440639496,
"baseline_truncated": false,
"doc_advantage_score": 6.914331912994385,
"length_change_ratio": 0.9271523178807947,
"net_length_change_chars": -11,
"original_sentences_length_chars": 151,
"replacement_paraphrases_length_chars": 140,
"sentences_perturbed": 1,
"target_doc_loss": 0.05391347408294678,
"target_truncated": false,
"threshold_passing_sentences": 3,
"total_doc_length_chars": 6832,
"total_sentences": 8,
"truncated": false
}
|
#
# Copyright (C) 2007-2016 OpenWrt.org
#
# This is free software, licensed under the GNU General Public License v2.
# See /LICENSE for more information.
#
include $(TOPDIR)/rules.mk
PKG_NAME:=curl
PKG_VERSION:=7.60.0
PKG_RELEASE:=3
PKG_SOURCE:=$(PKG_NAME)-$(PKG_VERSION).tar.xz
PKG_SOURCE_URL:=https://dl.uxnr.de/mirror/curl/ \
http://curl.mirror.anstey.ca/ \
http://curl.askapache.com/download/ \
https://curl.haxx.se/download/
PKG_HASH:=8736ff8ded89ddf7e926eec7b16f82597d029fc1469f3a551f1fafaac164e6a0
PKG_LICENSE:=MIT
PKG_LICENSE_FILES:=COPYING
PKG_CPE_ID:=cpe:/a:haxx:libcurl
PKG_FIXUP:=autoreconf
PKG_BUILD_PARALLEL:=1
PKG_CONFIG_DEPENDS:= \
CONFIG_IPV6 \
\
CONFIG_LIBCURL_WOLFSSL \
CONFIG_LIBCURL_GNUTLS \
CONFIG_LIBCURL_OPENSSL \
CONFIG_LIBCURL_MBEDTLS \
CONFIG_LIBCURL_NOSSL \
\
CONFIG_LIBCURL_LIBIDN2 \
CONFIG_LIBCURL_SSH2 \
CONFIG_LIBCURL_ZLIB \
\
CONFIG_LIBCURL_DICT \
CONFIG_LIBCURL_FILE \
CONFIG_LIBCURL_FTP \
CONFIG_LIBCURL_GOPHER \
CONFIG_LIBCURL_HTTP \
CONFIG_LIBCURL_IMAP \
CONFIG_LIBCURL_LDAP \
CONFIG_LIBCURL_LDAPS \
CONFIG_LIBCURL_POP3 \
CONFIG_LIBCURL_RTSP \
CONFIG_LIBCURL_NO_RTSP \
CONFIG_LIBCURL_SMB \
CONFIG_LIBCURL_NO_SMB \
CONFIG_LIBCURL_SMTP \
CONFIG_LIBCURL_TELNET \
CONFIG_LIBCURL_TFTP \
CONFIG_LIBCURL_NGHTTP2 \
\
CONFIG_LIBCURL_COOKIES \
CONFIG_LIBCURL_CRYPTO_AUTH \
CONFIG_LIBCURL_LIBCURL_OPTION \
CONFIG_LIBCURL_PROXY \
CONFIG_LIBCURL_THREADED_RESOLVER \
CONFIG_LIBCURL_TLS_SRP \
CONFIG_LIBCURL_UNIX_SOCKETS \
CONFIG_LIBCURL_VERBOSE \
CONFIG_LIBCURL_NTLM
include $(INCLUDE_DIR)/package.mk
define Package/curl/Default
SECTION:=net
CATEGORY:=Network
URL:=http://curl.haxx.se/
MAINTAINER:=Imre Kaloz <kaloz@openwrt.org>
endef
define Package/curl
$(call Package/curl/Default)
SUBMENU:=File Transfer
DEPENDS:=+libcurl
TITLE:=A client-side URL transfer utility
endef
define Package/libcurl
$(call Package/curl/Default)
SECTION:=libs
CATEGORY:=Libraries
DEPENDS:= +LIBCURL_WOLFSSL:libwolfssl +LIBCURL_OPENSSL:libopenssl +LIBCURL_GNUTLS:libgnutls +LIBCURL_MBEDTLS:libmbedtls
DEPENDS += +LIBCURL_ZLIB:zlib +LIBCURL_THREADED_RESOLVER:libpthread +LIBCURL_LDAP:libopenldap +LIBCURL_LIBIDN2:libidn2
DEPENDS += +LIBCURL_SSH2:libssh2 +LIBCURL_NGHTTP2:libnghttp2 +ca-bundle
TITLE:=A client-side URL transfer library
MENU:=1
endef
define Package/libcurl/config
source "$(SOURCE)/Config.in"
endef
TARGET_CFLAGS += $(FPIC) -ffunction-sections -fdata-sections
TARGET_CPPFLAGS += $(if $(CONFIG_LIBCURL_NTLM),,-DCURL_DISABLE_NTLM)
TARGET_LDFLAGS += -Wl,--gc-sections
CONFIGURE_ARGS += \
--disable-debug \
--disable-ares \
--enable-shared \
--enable-static \
--disable-manual \
--without-nss \
--without-libmetalink \
--without-librtmp \
--without-libidn \
--without-ca-path \
--with-ca-bundle=/etc/ssl/certs/ca-certificates.crt \
\
$(call autoconf_bool,CONFIG_IPV6,ipv6) \
\
$(if $(CONFIG_LIBCURL_WOLFSSL),--with-cyassl="$(STAGING_DIR)/usr",--without-cyassl) \
$(if $(CONFIG_LIBCURL_GNUTLS),--with-gnutls="$(STAGING_DIR)/usr",--without-gnutls) \
$(if $(CONFIG_LIBCURL_OPENSSL),--with-ssl="$(STAGING_DIR)/usr",--without-ssl) \
$(if $(CONFIG_LIBCURL_MBEDTLS),--with-mbedtls="$(STAGING_DIR)/usr",--without-mbedtls) \
\
$(if $(CONFIG_LIBCURL_LIBIDN2),--with-libidn2="$(STAGING_DIR)/usr",--without-libidn2) \
$(if $(CONFIG_LIBCURL_SSH2),--with-libssh2="$(STAGING_DIR)/usr",--without-libssh2) \
$(if $(CONFIG_LIBCURL_ZLIB),--with-zlib="$(STAGING_DIR)/usr",--without-zlib) \
$(if $(CONFIG_LIBCURL_NGHTTP2),--with-nghttp2="$(STAGING_DIR)/usr",--without-nghttp2) \
\
$(call autoconf_bool,CONFIG_LIBCURL_DICT,dict) \
$(call autoconf_bool,CONFIG_LIBCURL_FILE,file) \
$(call autoconf_bool,CONFIG_LIBCURL_FTP,ftp) \
$(call autoconf_bool,CONFIG_LIBCURL_GOPHER,gopher) \
$(call autoconf_bool,CONFIG_LIBCURL_HTTP,http) \
$(call autoconf_bool,CONFIG_LIBCURL_IMAP,imap) \
$(call autoconf_bool,CONFIG_LIBCURL_LDAP,ldap) \
$(call autoconf_bool,CONFIG_LIBCURL_LDAPS,ldaps) \
$(call autoconf_bool,CONFIG_LIBCURL_POP3,pop3) \
$(call autoconf_bool,CONFIG_LIBCURL_RTSP,rtsp) \
$(call autoconf_bool,CONFIG_LIBCURL_SMB,smb) \
$(call autoconf_bool,CONFIG_LIBCURL_SMTP,smtp) \
$(call autoconf_bool,CONFIG_LIBCURL_TELNET,telnet) \
$(call autoconf_bool,CONFIG_LIBCURL_TFTP,tftp) \
\
$(call autoconf_bool,CONFIG_LIBCURL_COOKIES,cookies) \
$(call autoconf_bool,CONFIG_LIBCURL_CRYPTO_AUTH,crypto-auth) \
$(call autoconf_bool,CONFIG_LIBCURL_LIBCURL_OPTION,libcurl-option) \
$(call autoconf_bool,CONFIG_LIBCURL_PROXY,proxy) \
$(call autoconf_bool,CONFIG_LIBCURL_THREADED_RESOLVER,threaded-resolver) \
$(call autoconf_bool,CONFIG_LIBCURL_TLS_SRP,tls-srp) \
$(call
| null | 0
|
{
"advantage_score_max": 0,
"advantage_score_mean": 0,
"advantage_score_min": 0,
"advantage_score_std": 0,
"advantage_scores": [],
"baseline_doc_loss": 0.5747622847557068,
"baseline_truncated": false,
"doc_advantage_score": 1.2901300191879272,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 0,
"replacement_paraphrases_length_chars": 0,
"sentences_perturbed": 0,
"target_doc_loss": 0.4455072581768036,
"target_truncated": false,
"threshold_passing_sentences": 0,
"total_doc_length_chars": 4714,
"total_sentences": 3,
"truncated": false
}
|
#!/usr/bin/env bash
# Copyright 2009 The Go Authors. All rights reserved.
# Use of this source code is governed by a BSD-style
# license that can be found in the LICENSE file.
# Generate Go code listing errors and other #defined constant
# values (ENAMETOOLONG etc.), by asking the preprocessor
# about the definitions.
unset LANG
export LC_ALL=C
export LC_CTYPE=C
if test -z "$GOARCH" -o -z "$GOOS"; then
echo 1>&2 "GOARCH or GOOS not defined in environment"
exit 1
fi
# Check that we are using the new build system if we should
if [[ "$GOOS" = "linux" ]] && [[ "$GOARCH" != "sparc64" ]]; then
if [[ "$GOLANG_SYS_BUILD" != "docker" ]]; then
echo 1>&2 "In the new build system, mkerrors should not be called directly."
echo 1>&2 "See README.md"
exit 1
fi
fi
if [[ "$GOOS" = "aix" ]]; then
CC=${CC:-gcc}
else
CC=${CC:-cc}
fi
if [[ "$GOOS" = "solaris" ]]; then
# Assumes GNU versions of utilities in PATH.
export PATH=/usr/gnu/bin:$PATH
fi
uname=$(uname)
includes_AIX='
#include <net/if.h>
#include <net/netopt.h>
#include <netinet/ip_mroute.h>
#include <sys/protosw.h>
#include <sys/stropts.h>
#include <sys/mman.h>
#include <sys/poll.h>
#include <sys/termio.h>
#include <termios.h>
#include <fcntl.h>
#define AF_LOCAL AF_UNIX
'
includes_Darwin='
#define _DARWIN_C_SOURCE
#define KERNEL
#define _DARWIN_USE_64_BIT_INODE
#include <stdint.h>
#include <sys/attr.h>
#include <sys/types.h>
#include <sys/event.h>
#include <sys/ptrace.h>
#include <sys/socket.h>
#include <sys/sockio.h>
#include <sys/sysctl.h>
#include <sys/mman.h>
#include <sys/mount.h>
#include <sys/utsname.h>
#include <sys/wait.h>
#include <sys/xattr.h>
#include <net/bpf.h>
#include <net/if.h>
#include <net/if_types.h>
#include <net/route.h>
#include <netinet/in.h>
#include <netinet/ip.h>
#include <termios.h>
'
includes_DragonFly='
#include <sys/types.h>
#include <sys/event.h>
#include <sys/socket.h>
#include <sys/sockio.h>
#include <sys/stat.h>
#include <sys/sysctl.h>
#include <sys/mman.h>
#include <sys/mount.h>
#include <sys/wait.h>
#include <sys/ioctl.h>
#include <net/bpf.h>
#include <net/if.h>
#include <net/if_types.h>
#include <net/route.h>
#include <netinet/in.h>
#include <termios.h>
#include <netinet/ip.h>
#include <net/ip_mroute/ip_mroute.h>
'
includes_FreeBSD='
#include <sys/capability.h>
#include <sys/param.h>
#include <sys/types.h>
#include <sys/event.h>
#include <sys/socket.h>
#include <sys/sockio.h>
#include <sys/stat.h>
#include <sys/sysctl.h>
#include <sys/mman.h>
#include <sys/mount.h>
#include <sys/wait.h>
#include <sys/ioctl.h>
#include <net/bpf.h>
#include <net/if.h>
#include <net/if_types.h>
#include <net/route.h>
#include <netinet/in.h>
#include <termios.h>
#include <netinet/ip.h>
#include <netinet/ip_mroute.h>
#include <sys/extattr.h>
#if __FreeBSD__ >= 10
#define IFT_CARP 0xf8 // IFT_CARP is deprecated in FreeBSD 10
#undef SIOCAIFADDR
#define SIOCAIFADDR _IOW(105, 26, struct oifaliasreq) // ifaliasreq contains if_data
#undef SIOCSIFPHYADDR
#define SIOCSIFPHYADDR _IOW(105, 70, struct oifaliasreq) // ifaliasreq contains if_data
#endif
'
includes_Linux='
#define _LARGEFILE_SOURCE
#define _LARGEFILE64_SOURCE
#ifndef __LP64__
#define _FILE_OFFSET_BITS 64
#endif
#define _GNU_SOURCE
// <sys/ioctl.h> is broken on powerpc64, as it fails to include definitions of
// these structures. We just include them copied from <bits/termios.h>.
#if defined(__powerpc__)
struct sgttyb {
char sg_ispeed;
char sg_ospeed;
char sg_erase;
char sg_kill;
short sg_flags;
};
struct tchars {
char t_intrc;
char t_quitc;
char t_startc;
char t_stopc;
char t_eofc;
char t_brkc;
};
struct ltchars {
char t_suspc;
char t_dsuspc;
char t_rprntc;
char t_flushc;
char t_werasc;
char t_lnextc;
};
#endif
#include <bits/sockaddr.h>
#include <sys/epoll.h>
#include <sys/eventfd.h>
#include <sys/inotify.h>
#include <sys/ioctl.h>
#include <sys/mman.h>
#include <sys/mount.h>
#include <sys/prctl.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <sys/xattr.h>
#include <linux/if.h>
#include <linux/if_alg.h>
#include <linux/if_arp.h>
#include <linux/if_ether.h>
#include <linux/if_tun.h>
#include <linux/if_packet.h>
#include <linux/if_addr.h>
#include <linux/falloc.h>
#include <linux/filter.h>
#include <linux/fs.h>
#include <linux/kexec.h>
#include <linux/keyctl.h>
#include <linux/magic.h>
#include <linux/memfd.h>
#include <linux/module.h>
#include <linux/netfilter/nfnetlink.h>
#include <linux/netlink.h>
#include <linux/net_namespace.h>
#include <linux/perf_event.h>
#include <linux/random.h>
#include <linux/reboot.h>
#include <linux/rtnetlink.h>
#include <linux/ptrace.h>
#include <linux/sched.h>
#include <linux/seccomp.h>
#include <linux/sockios.h>
#include <linux/wait.h>
#include <linux/icmpv6.h>
#include <linux/serial.h>
#include <linux/can.h>
#include
| null | 1
|
{
"advantage_score_max": 9.992094039916992,
"advantage_score_mean": 4.2483344078063965,
"advantage_score_min": 1.2052592039108276,
"advantage_score_std": 3.365774631500244,
"advantage_scores": [
9.992094039916992,
7.735381603240967,
2.604841947555542,
2.492899179458618,
1.4595301151275635,
1.2052592039108276
],
"baseline_doc_loss": 0.8944142460823059,
"baseline_truncated": false,
"doc_advantage_score": 50.270748138427734,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 20,
"replacement_paraphrases_length_chars": 20,
"sentences_perturbed": 1,
"target_doc_loss": 0.01779194176197052,
"target_truncated": false,
"threshold_passing_sentences": 6,
"total_doc_length_chars": 5014,
"total_sentences": 10,
"truncated": false
}
|
/**
* Licensed to Apereo under one or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information regarding copyright ownership. Apereo
* 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 the
* following location:
*
* <p>http://www.apache.org/licenses/LICENSE-2.0
*
* <p>Unless required by applicable law or agreed to in writing, software distributed under the
* License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either
* express or implied. See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apereo.portal.groups.smartldap;
import java.util.Collections;
import java.util.List;
import org.apereo.portal.groups.IEntityGroup;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
public final class LdapRecord {
private static final Logger logger = LoggerFactory.getLogger(LdapRecord.class);
// Instance Members.
private final IEntityGroup group;
private final List<String> keysOfChildren;
/*
* Public API.
*/
public LdapRecord(IEntityGroup group, List<String> keysOfChildren) {
// Assertions.
if (group == null) {
String msg = "Argument 'group' cannot be null.";
throw new IllegalArgumentException(msg);
}
if (keysOfChildren == null) {
String msg = "Argument 'keysOfChildren' cannot be null.";
throw new IllegalArgumentException(msg);
}
if (logger.isDebugEnabled()) {
String keys = String.join(",", keysOfChildren);
logger.debug(
"Instantiating LdapRecord for group: {}/{} with children: {}",
group.getLocalKey(),
group.getName(),
keys);
}
// Instance Members.
this.group = group;
this.keysOfChildren = Collections.unmodifiableList(keysOfChildren);
}
/**
* <strong>NOTE</strong> two instances of {@link LdapRecord} are equal if the groups they
* contain share the same key.
two {@link LdapRecord} objects are considered equal if their contained groups have identical keys!(o instanceof LdapRecord)) {
return false;
}
LdapRecord lr = (LdapRecord) o;
// NB: There is code that relies on this definition of equals()
return lr.getGroup().getKey().equals(getGroup().getKey());
}
public IEntityGroup getGroup() {
return group;
}
public List<String> getKeysOfChildren() {
return keysOfChildren;
}
@Override
public int hashCode() {
return getGroup().getKey().hashCode();
}
}
| null | 1
|
{
"advantage_score_max": 1.2109403610229492,
"advantage_score_mean": 1.2109403610229492,
"advantage_score_min": 1.2109403610229492,
"advantage_score_std": 0,
"advantage_scores": [
1.2109403610229492
],
"baseline_doc_loss": 0.6881648898124695,
"baseline_truncated": false,
"doc_advantage_score": 1.2032581567764282,
"length_change_ratio": 1.2098765432098766,
"net_length_change_chars": 17,
"original_sentences_length_chars": 81,
"replacement_paraphrases_length_chars": 98,
"sentences_perturbed": 1,
"target_doc_loss": 0.5719178915023804,
"target_truncated": false,
"threshold_passing_sentences": 1,
"total_doc_length_chars": 2862,
"total_sentences": 14,
"truncated": false
}
|
# created by tools/tclZIC.tcl - do not edit
set TZData(:Asia/Ust-Nera) {
{-9223372036854775808 34374 0 LMT}
{-1579426374 28800 0 YAKT}
{354898800 43200 0 MAGST}
{370699200 39600 0 MAGT}
{386427600 43200 1 MAGST}
{402235200 39600 0 MAGT}
{417963600 43200 1 MAGST}
{433771200 39600 0 MAGT}
{449586000 43200 1 MAGST}
{465318000 39600 0 MAGT}
{481042800 43200 1 MAGST}
{496767600 39600 0 MAGT}
{512492400 43200 1 MAGST}
{528217200 39600 0 MAGT}
{543942000 43200 1 MAGST}
{559666800 39600 0 MAGT}
{575391600 43200 1 MAGST}
{591116400 39600 0 MAGT}
{606841200 43200 1 MAGST}
{622566000 39600 0 MAGT}
{638290800 43200 1 MAGST}
{654620400 39600 0 MAGT}
{670345200 36000 0 MAGMMTT}
{670348800 39600 1 MAGST}
{686073600 36000 0 MAGT}
{695750400 39600 0 MAGMMTT}
{701794800 43200 1 MAGST}
{717519600 39600 0 MAGT}
{733244400 43200 1 MAGST}
{748969200 39600 0 MAGT}
{764694000 43200 1 MAGST}
{780418800 39600 0 MAGT}
{796143600 43200 1 MAGST}
{811868400 39600 0 MAGT}
{828198000 43200 1 MAGST}
{846342000 39600 0 MAGT}
{859647600 43200 1 MAGST}
{877791600 39600 0 MAGT}
{891097200 43200 1 MAGST}
{909241200 39600 0 MAGT}
{922546800 43200 1 MAGST}
{941295600 39600 0 MAGT}
{953996400 43200 1 MAGST}
{972745200 39600 0 MAGT}
{985446000 43200 1 MAGST}
{1004194800 39600 0 MAGT}
{1017500400 43200 1 MAGST}
{1035644400 39600 0 MAGT}
{1048950000 43200 1 MAGST}
{1067094000 39600 0 MAGT}
{1080399600 43200 1 MAGST}
{1099148400 39600 0 MAGT}
{1111849200 43200 1 MAGST}
{1130598000 39600 0 MAGT}
{1143298800 43200 1 MAGST}
{1162047600 39600 0 MAGT}
{1174748400 43200 1 MAGST}
{1193497200 39600 0 MAGT}
{1206802800 43200 1 MAGST}
{1224946800 39600 0 MAGT}
{1238252400 43200 1 MAGST}
{1256396400 39600 0 MAGT}
{1269702000 43200 1 MAGST}
{1288450800 39600 0 MAGT}
{1301151600 43200 0 MAGT}
{1315828800 39600 0 VLAT}
{1414249200 36000 0 VLAT}
}
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
activeProfiles=
eclipse.preferences.version=1
resolveWorkspaceProjects=true
version=1
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
/**
* Copyright 2015 CANAL+ Group
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You can 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.
*/
import AssertionError from "../assertion_error";
import EncryptedMediaError from "../encrypted_media_error";
import isKnownError from "../is_known_error";
import MediaError from "../media_error";
import NetworkError from "../network_error";
import OtherError from "../other_error";
import RequestError from "../request_error";
describe("Errors - isKnownError", () => {
it("should return false for a regular error", () => {
expect(isKnownError(new Error("nope")))
.toBe(false);
});
it("should return false for a RequestError", () => {
const xhr = new XMLHttpRequest();
xhr.open("GET", "http://www.example.com");
const requestError = new RequestError("foo", 23, "TIMEOUT", xhr);
expect(isKnownError(requestError)).toBe(false);
});
it("should return false for an AssertionError", () => {
const assertionError = new AssertionError("foo");
expect(isKnownError(assertionError)).toBe(false);
});
it("should return true for an OtherError", () => {
const otherError = new OtherError("NONE", "tata");
expect(isKnownError(otherError)).toBe(true);
});
it("should return true for a NetworkError", () => {
const xhr = new XMLHttpRequest();
xhr.open("GET", "http://www.example.com");
const requestError = new RequestError("foo", 44, "ERROR_HTTP_CODE", xhr);
const networkError = new NetworkError("PIPELINE_LOAD_ERROR", requestError);
expect(isKnownError(networkError)).toBe(true);
});
it("should return true for a MediaError", () => {
const mediaError = new MediaError("MEDIA_ERR_DECODE", "toto");
expect(isKnownError(mediaError)).toBe(true);
});
it("should return true for an EncryptedMediaError", () => {
const encryptedMediaError = new EncryptedMediaError("KEY_UPDATE_ERROR", "toto");
expect(isKnownError(encryptedMediaError)).toBe(true);
});
});
| null | 1
|
{
"advantage_score_max": 1.7049951553344727,
"advantage_score_mean": 1.7049951553344727,
"advantage_score_min": 1.7049951553344727,
"advantage_score_std": 0,
"advantage_scores": [
1.7049951553344727
],
"baseline_doc_loss": 0.624161958694458,
"baseline_truncated": false,
"doc_advantage_score": 1.1374645233154297,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 313,
"replacement_paraphrases_length_chars": 313,
"sentences_perturbed": 1,
"target_doc_loss": 0.5487309098243713,
"target_truncated": false,
"threshold_passing_sentences": 1,
"total_doc_length_chars": 2446,
"total_sentences": 4,
"truncated": false
}
|
## Domain resolution
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
//
// StrassenMatmulComputor.cpp
// MNN
//
// Created by MNN on 2019/02/11.
// Copyright © 2018, Alibaba Group Holding Limited
//
#include "StrassenMatmulComputor.hpp"
#include "backend/cpu/CPUBackend.hpp"
#include <string.h>
#include "ConvOpt.h"
#include <limits.h>
#include "CommonOptFunction.h"
#include "core/Macro.h"
#include "core/Concurrency.h"
//#define MNN_OPEN_TIME_TRACE
#include <MNN/AutoTime.hpp>
#include "math/Vec4.hpp"
#include "math/Matrix.hpp"
using namespace MNN::Math;
extern "C" {
void MNNStrassenMergeCFunction(float* c11, float* c12, float* c21, float* c22, float* xAddr, size_t cStride,
size_t eSub, size_t hSub);
}
#ifndef MNN_USE_NEON
void MNNStrassenMergeCFunction(float* c11, float* c12, float* c21, float* c22, float* xAddr, size_t cStride,
size_t eSub, size_t hSub) {
for (int y=0; y<hSub; ++y) {
auto c11Y = c11 + y * cStride;
auto c12Y = c12 + y * cStride;
auto c22Y = c22 + y * cStride;
auto c21Y = c21 + y * cStride;
auto xY = xAddr + y * eSub * 4;
for (int x=0; x<eSub; ++x) {
auto xv = Vec4::load(xY + 4*x);
auto c21v = Vec4::load(c21Y + 4*x);
auto c11v = Vec4::load(c11Y + 4*x);
auto c22v = Vec4::load(c22Y + 4*x);
auto c12v = Vec4::load(c12Y + 4*x);
c12v = c12v + xv;
c21v = c12v + c21v;
c12v = c22v + c12v;
c22v = c22v + c21v;
c12v = c11v + c12v;
Vec4::save(c12Y + 4*x, c12v);
Vec4::save(c22Y + 4*x, c22v);
Vec4::save(c21Y + 4*x, c21v);
}
}
}
#endif
namespace MNN {
typedef std::shared_ptr<Tensor> PTensor;
class StrassenMatrixComputor::AddTensor {
public:
AddTensor(Tensor* t, Backend* bn, Backend::StorageType storageType = Backend::DYNAMIC) {
mTensor.reset(t);
mValid = bn->onAcquireBuffer(t, storageType);
mBackend = bn;
mStorageType = storageType;
}
inline bool valid() const {
return mValid;
}
~AddTensor() {
mBackend->onReleaseBuffer(mTensor.get(), mStorageType);
}
const Tensor* operator->() const {
return mTensor.get();
}
const Tensor* get() const {
return mTensor.get();
}
private:
std::shared_ptr<Tensor> mTensor;
Backend* mBackend;
bool mValid = false;
Backend::StorageType mStorageType;
};
StrassenMatrixComputor::StrassenMatrixComputor(Backend* bn, bool multithread, int maxDepth) : mBackend(bn) {
mMaxDepth = maxDepth;
mSupportMultiThread = multithread;
};
StrassenMatrixComputor::~StrassenMatrixComputor() {
// Do nothing
}
ErrorCode StrassenMatrixComputor::_generateTrivalMatMul(const Tensor* AT, const Tensor* BT, const Tensor* CT, const Tensor* COT, const std::vector<float>& active) {
// Generate Trival Matrix Multiply
auto e = AT->length(1);
MNN_ASSERT(e > 0);
auto aHost = AT->host<float>();
auto bHost = BT->host<float>();
auto cHost = CT->host<float>();
auto aStride = AT->stride(0);
auto bStride = BT->stride(0);
auto cStride = CT->stride(0);
int eP, lP, hP;
MNNGetMatMulPackMode(&eP, &lP, &hP);
auto numberThread = mSupportMultiThread ? ((CPUBackend*)backend())->threadNumber() : 1;
auto CONVOLUTION_TILED_NUMBER = eP;
auto bExtraStride = bStride - BT->length(1) * BT->length(2);
AddTensor tileBuffer(Tensor::createDevice<float>(std::vector<int>{numberThread, BT->length(1), CONVOLUTION_TILED_NUMBER}), backend());
std::vector<float*> cachePtr(numberThread, nullptr);
if (hP % 4 != 0) {
auto hDiv = MNNGetC4DivNumber(hP);
AddTensor matmulTempBuffer(Tensor::createDevice<float>(std::vector<int>{numberThread, eP * hDiv * 4 + CT->length(0) * eP * 4}), backend());
for (int i=0; i<numberThread; ++i) {
cachePtr[i] = matmulTempBuffer->host<float>() + i * matmulTempBuffer->stride(0);
}
}
auto tileHostOrigin = tileBuffer->host<float>();
int unitNumber = e / CONVOLUTION_TILED_NUMBER;
int xCount = e - unitNumber * CONVOLUTION_TILED_NUMBER;
std::vector<size_t> parameters(6);
auto hMin = std::min(CT->length(0) * 4, BT->length(0) * hP);
parameters[0] = xCount * sizeof(float);
parameters[1] = BT->length(1);
parameters[2] = hMin;
parameters[3] = cStride * sizeof(float);
parameters[4] = 0;
parameters[5] = bExtraStride * sizeof(float);
auto eReal = aStride / AT->length(2);
const float* biasPtr = nullptr;
if (nullptr != COT) {
if (COT != CT) {
biasPtr = COT->host<float>();
}
}
mFunctions.emplace_back(
std::make_pair([xCount, aHost, bHost, cHost, tileHostOrigin, unitNumber, bExtraStride, numberThread, parameters, eReal, CONVOLUTION_TILED_NUMBER, cachePtr, biasPtr, active](int tId) {
auto tileHost = tileHostOrigin + CONVOLUTION_TILED_NUMBER * parameters[1] * tId;
const float* postParametersPtr = nullptr;
if (!active.empty()) {
postParametersPtr = active.data();
}
auto cache = cachePtr[tId];
for (int i = tId; i < unitNumber; i+=numberThread) {
int xStart = i * CONVOLUTION_TILED_NUMBER;
auto aStart = aHost + xStart * 4;
MNNPackC4ForMatMul_A(tileHost, aStart, CONVOLUTION_TILED_NUMBER, parameters[1], eReal);
MNNPackedMatMul(cHost + 4 * xStart, tileHost, bHost, parameters.data(), cache, postParametersPtr, biasPtr);
}
if (tId != numberThread -1) {
return;
}
if (xCount > 0) {
int xStart = unitNumber * CONVOLUTION_TILED_NUMBER;
auto aStart = aHost + xStart * 4;
// Copy
MNNPackC4ForMatMul_A(tileHost, aStart,
| null | 0
|
{
"advantage_score_max": 1.1645303964614868,
"advantage_score_mean": 1.1645303964614868,
"advantage_score_min": 1.1645303964614868,
"advantage_score_std": 0,
"advantage_scores": [
1.1645303964614868
],
"baseline_doc_loss": 1.0523048639297485,
"baseline_truncated": false,
"doc_advantage_score": 1.0541585683822632,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 0,
"replacement_paraphrases_length_chars": 0,
"sentences_perturbed": 0,
"target_doc_loss": 0.9982415437698364,
"target_truncated": false,
"threshold_passing_sentences": 1,
"total_doc_length_chars": 5932,
"total_sentences": 3,
"truncated": false
}
|
StartChar: uni0477
Encoding: 1143 1143 2227
Width: 1000
VWidth: 0
Flags: M
LayerCount: 2
Fore
Refer: 2018 783 N 1 0 0 1 145 0 2
Refer: 2121 1141 N 1 0 0 1 0 0 3
EndChar
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
package ch.cyberduck.core.dav;
/*
* Copyright (c) 2002-2016 iterate GmbH. All rights reserved.
* https://cyberduck.io/
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*/
import ch.cyberduck.core.DefaultIOExceptionMappingService;
import ch.cyberduck.core.Path;
import ch.cyberduck.core.exception.BackgroundException;
import ch.cyberduck.core.features.Quota;
import ch.cyberduck.core.shared.DefaultHomeFinderService;
import ch.cyberduck.core.worker.DefaultExceptionMappingService;
import java.io.IOException;
import com.github.sardine.DavQuota;
import com.github.sardine.impl.SardineException;
public class DAVQuotaFeature implements Quota {
private final DAVSession session;
public DAVQuotaFeature(final DAVSession session) {
this.session = session;
}
@Override
public Space get() throws BackgroundException {
final Path home = new DefaultHomeFinderService(session).find();
try {
final DavQuota quota = session.getClient().getQuota(new DAVPathEncoder().encode(home));
return new Space(
quota.getQuotaUsedBytes() > 0 ? quota.getQuotaUsedBytes() : 0,
quota.getQuotaAvailableBytes() >= 0 ? quota.getQuotaAvailableBytes() : Long.MAX_VALUE
);
}
catch(SardineException e) {
throw new DAVExceptionMappingService().map("Failure to read attributes of {0}", e, home);
}
catch(IOException e) {
throw new DefaultIOExceptionMappingService().map(e, home);
}
catch(NumberFormatException e) {
throw new DefaultExceptionMappingService().map(e);
}
}
}
| null | 1
|
{
"advantage_score_max": 3.9640345573425293,
"advantage_score_mean": 3.9640345573425293,
"advantage_score_min": 3.9640345573425293,
"advantage_score_std": 0,
"advantage_scores": [
3.9640345573425293
],
"baseline_doc_loss": 0.9409236311912537,
"baseline_truncated": false,
"doc_advantage_score": 1.666074275970459,
"length_change_ratio": 1.1157894736842104,
"net_length_change_chars": 22,
"original_sentences_length_chars": 190,
"replacement_paraphrases_length_chars": 212,
"sentences_perturbed": 1,
"target_doc_loss": 0.5647549033164978,
"target_truncated": false,
"threshold_passing_sentences": 1,
"total_doc_length_chars": 2108,
"total_sentences": 8,
"truncated": false
}
|
#!/usr/bin/env escript
%%! -pz ./deps/amqp_client/ebin ./deps/rabbit_common/ebin ./deps/recon/ebin ./deps/lager/ebin ./deps/goldrush/ebin ./deps/jsx/ebin ./deps/ranch/ebin.
main(Argv) ->
{ok, Connection} =
amqp_connection:start(#amqp_params_network{host = "localhost"}),
{ok, Channel} = amqp_connection:open_channel(Connection),
amqp_channel:call(Channel, #'exchange.declare'{exchange = <<"direct_logs">>,
type = <<"direct">>}),
#'queue.declare_ok'{queue = Queue} =
amqp_channel:call(Channel, #'queue.declare'{exclusive = true}),
[amqp_channel:call(Channel, #'queue.bind'{exchange = <<"direct_logs">>,
routing_key = list_to_binary(Severity),
queue = Queue})
|| Severity <- Argv],
io:format(" [*] Waiting for logs. To exit press CTRL+C~n"),
amqp_channel:subscribe(Channel, #'basic.consume'{queue = Queue,
no_ack = true}, self()),
receive
#'basic.consume_ok'{} -> ok
end,
loop(Channel).
loop(Channel) ->
receive
{#'basic.deliver'{routing_key = RoutingKey}, #amqp_msg{payload = Body}} ->
io:format(" [x] ~p:~p~n", [RoutingKey, Body]),
loop(Channel)
end.
| null | 1
|
{
"advantage_score_max": 1.143439769744873,
"advantage_score_mean": 1.143439769744873,
"advantage_score_min": 1.143439769744873,
"advantage_score_std": 0,
"advantage_scores": [
1.143439769744873
],
"baseline_doc_loss": 0.6485503315925598,
"baseline_truncated": false,
"doc_advantage_score": 0.6183421015739441,
"length_change_ratio": 0.5846774193548387,
"net_length_change_chars": -103,
"original_sentences_length_chars": 248,
"replacement_paraphrases_length_chars": 145,
"sentences_perturbed": 1,
"target_doc_loss": 1.0488536357879639,
"target_truncated": false,
"threshold_passing_sentences": 1,
"total_doc_length_chars": 1466,
"total_sentences": 5,
"truncated": false
}
|
#ifndef STD_TCG_H
#define STD_TCG_H
#include "types.h"
#define SHA1_BUFSIZE 20
#define SHA256_BUFSIZE 32
#define SHA384_BUFSIZE 48
#define SHA512_BUFSIZE 64
#define SM3_256_BUFSIZE 32
/****************************************************************
* 16bit BIOS interface
****************************************************************/
/* Define for section 12.3 */
#define TCG_PC_OK 0x0
#define TCG_PC_TPMERROR 0x1
#define TCG_PC_LOGOVERFLOW 0x2
#define TCG_PC_UNSUPPORTED 0x3
#define TPM_ALG_SHA 0x4
#define TCG_MAGIC 0x41504354L
#define TCG_VERSION_MAJOR 1
#define TCG_VERSION_MINOR 2
#define TPM_OK 0x0
#define TPM_RET_BASE 0x1
#define TCG_GENERAL_ERROR (TPM_RET_BASE + 0x0)
#define TCG_TPM_IS_LOCKED (TPM_RET_BASE + 0x1)
#define TCG_NO_RESPONSE (TPM_RET_BASE + 0x2)
#define TCG_INVALID_RESPONSE (TPM_RET_BASE + 0x3)
#define TCG_INVALID_ACCESS_REQUEST (TPM_RET_BASE + 0x4)
#define TCG_FIRMWARE_ERROR (TPM_RET_BASE + 0x5)
#define TCG_INTEGRITY_CHECK_FAILED (TPM_RET_BASE + 0x6)
#define TCG_INVALID_DEVICE_ID (TPM_RET_BASE + 0x7)
#define TCG_INVALID_VENDOR_ID (TPM_RET_BASE + 0x8)
#define TCG_UNABLE_TO_OPEN (TPM_RET_BASE + 0x9)
#define TCG_UNABLE_TO_CLOSE (TPM_RET_BASE + 0xa)
#define TCG_RESPONSE_TIMEOUT (TPM_RET_BASE + 0xb)
#define TCG_INVALID_COM_REQUEST (TPM_RET_BASE + 0xc)
#define TCG_INVALID_ADR_REQUEST (TPM_RET_BASE + 0xd)
#define TCG_WRITE_BYTE_ERROR (TPM_RET_BASE + 0xe)
#define TCG_READ_BYTE_ERROR (TPM_RET_BASE + 0xf)
#define TCG_BLOCK_WRITE_TIMEOUT (TPM_RET_BASE + 0x10)
#define TCG_CHAR_WRITE_TIMEOUT (TPM_RET_BASE + 0x11)
#define TCG_CHAR_READ_TIMEOUT (TPM_RET_BASE + 0x12)
#define TCG_BLOCK_READ_TIMEOUT (TPM_RET_BASE + 0x13)
#define TCG_TRANSFER_ABORT (TPM_RET_BASE + 0x14)
#define TCG_INVALID_DRV_FUNCTION (TPM_RET_BASE + 0x15)
#define TCG_OUTPUT_BUFFER_TOO_SHORT (TPM_RET_BASE + 0x16)
#define TCG_FATAL_COM_ERROR (TPM_RET_BASE + 0x17)
#define TCG_INVALID_INPUT_PARA (TPM_RET_BASE + 0x18)
#define TCG_TCG_COMMAND_ERROR (TPM_RET_BASE + 0x19)
#define TCG_INTERFACE_SHUTDOWN (TPM_RET_BASE + 0x20)
//define TCG_PC_UNSUPPORTED (TPM_RET_BASE + 0x21)
#define TCG_PC_TPM_NOT_PRESENT (TPM_RET_BASE + 0x22)
#define TCG_PC_TPM_DEACTIVATED (TPM_RET_BASE + 0x23)
/* interrupt identifiers (al register) */
enum irq_ids {
TCG_StatusCheck = 0,
TCG_HashLogExtendEvent = 1,
TCG_PassThroughToTPM = 2,
TCG_ShutdownPreBootInterface = 3,
TCG_HashLogEvent = 4,
TCG_HashAll = 5,
TCG_TSS = 6,
TCG_CompactHashLogExtendEvent = 7,
};
/* Input and Output blocks for the TCG BIOS commands */
struct hleei_short
{
u16 ipblength;
u16 reserved;
const void *hashdataptr;
u32 hashdatalen;
u32 pcrindex;
const void *logdataptr;
u32 logdatalen;
} PACKED;
struct hleei_long
{
u16 ipblength;
u16 reserved;
void *hashdataptr;
u32 hashdatalen;
u32 pcrindex;
u32 reserved2;
void *logdataptr;
u32 logdatalen;
} PACKED;
struct hleeo
{
u16 opblength;
u16 reserved;
u32 eventnumber;
u8 digest[SHA1_BUFSIZE];
} PACKED;
struct pttti
{
u16 ipblength;
u16 reserved;
u16 opblength;
u16 reserved2;
u8 tpmopin[0];
} PACKED;
struct pttto
{
u16 opblength;
u16 reserved;
u8 tpmopout[0];
};
struct hlei
{
u16 ipblength;
u16 reserved;
const void *hashdataptr;
u32 hashdatalen;
u32 pcrindex;
u32 logeventtype;
const void *logdataptr;
u32 logdatalen;
} PACKED;
struct hleo
{
u16 opblength;
u16 reserved;
u32 eventnumber;
} PACKED;
struct hai
{
u16 ipblength;
u16 reserved;
const void *hashdataptr;
u32 hashdatalen;
u32 algorithmid;
} PACKED;
struct ti
{
u16 ipblength;
u16 reserved;
u16 opblength;
u16 reserved2;
u8 tssoperandin[0];
} PACKED;
struct to
{
u16 opblength;
u16 reserved;
u8 tssoperandout[0];
} PACKED;
struct pcpes
{
u32 pcrindex;
u32 eventtype;
u8 digest[SHA1_BUFSIZE];
u32 eventdatasize;
u8 event[0];
} PACKED;
/****************************************************************
* TPM v1.2 hardware commands
****************************************************************/
#define TPM_ORD_SelfTestFull 0x00000050
#define TPM_ORD_ForceClear 0x0000005d
#define TPM_ORD_GetCapability 0x00000065
#define TPM_ORD_PhysicalEnable 0x0000006f
#define TPM_ORD_PhysicalDisable 0x00000070
#define TPM_ORD_SetOwnerInstall 0x00000071
#define TPM_ORD_PhysicalSetDeactivated 0x00000072
#define TPM_ORD_SetTempDeactivated 0x00000073
#define TPM_ORD_Startup 0x00000099
#define TPM_ORD_PhysicalPresence 0x4000000a
#define TPM_ORD_Extend 0x00000014
#define TSC_ORD_ResetEstablishmentBit 0x4000000b
#define TPM_ST_CLEAR 0x0001
#define TPM_ST_STATE 0x0002
#define TPM_ST_DEACTIVATED 0x0003
#define TPM
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
#pragma once
#include <Common/HashTable/HashTable.h>
namespace DB
{
namespace ErrorCodes
{
extern const int NO_AVAILABLE_DATA;
}
}
template <typename Key, typename TState = HashTableNoState>
struct FixedHashTableCell
{
using State = TState;
using value_type = Key;
using mapped_type = VoidMapped;
bool full;
FixedHashTableCell() {}
FixedHashTableCell(const Key &, const State &) : full(true) {}
const VoidKey getKey() const { return {}; }
VoidMapped getMapped() const { return {}; }
bool isZero(const State &) const { return !full; }
void setZero() { full = false; }
static constexpr bool need_zero_value_storage = false;
/// This Cell is only stored inside an iterator. It's used to accommodate the fact
/// that the iterator based API always provide a reference to a continuous memory
/// containing the Key. As a result, we have to instantiate a real Key field.
/// All methods that return a mutable reference to the Key field are named with
/// -Mutable suffix, indicating this is uncommon usage. As this is only for lookup
/// tables, it's totally fine to discard the Key mutations.
struct CellExt
{
Key key;
const VoidKey getKey() const { return {}; }
VoidMapped getMapped() const { return {}; }
const value_type & getValue() const { return key; }
void update(Key && key_, FixedHashTableCell *) { key = key_; }
};
};
/// How to obtain the size of the table.
template <typename Cell>
struct FixedHashTableSize
{
size_t m_size = 0;
size_t getSize(const Cell *, const typename Cell::State &, size_t) const { return m_size; }
bool isEmpty(const Cell *, const typename Cell::State &, size_t) const { return m_size == 0; }
void increaseSize() { ++m_size; }
void clearSize() { m_size = 0; }
void setSize(size_t to) { m_size = to; }
};
template <typename Cell>
struct FixedHashTableDynamicSize
{
size_t getSize(const Cell * buf, const typename Cell::State & state, size_t num_cells) const
{
size_t res = 0;
for (const Cell * end = buf + num_cells; buf != end; ++buf)
if (!buf->isZero(state))
++res;
return res;
}
bool isEmpty(const Cell * buf, const typename Cell::State & state, size_t num_cells) const
{
for (const Cell * end = buf + num_cells; buf != end; ++buf)
if (!buf->isZero(state))
return false;
return true;
}
void increaseSize() {}
void clearSize() {}
void setSize(size_t) {}
};. It's different
* than a HashTable in that keys are not stored in the Cell buf, but inferred
* inside each iterator. There are a bunch of to make it faster than using
* HashTable: a) It doesn't have a conflict chain; b) There is no key
* comparison; c) The number of cycles for checking cell empty is halved; d)
* Memory layout is tighter, especially the Clearable variants.
*
* NOTE: For Set variants this should always be better. For Map variants
* however, as we need to assemble the real cell inside each iterator, there
* might be some cases we fall short.
*
* TODO: Deprecate the cell API so that end users don't rely on the structure
* of cell. Instead iterator should be used for operations such as cell
* transfer, key updates (f.g. StringRef) and serde. This will allow
* TwoLevelHashSet(Map) to contain different type of sets(maps).
*/
template <typename Key, typename Cell, typename Size, typename Allocator>
class FixedHashTable : private boost::noncopyable, protected Allocator, protected Cell::State, protected Size
{
static constexpr size_t NUM_CELLS = 1ULL << (sizeof(Key) * 8);
protected:
friend class const_iterator;
friend class iterator;
friend class Reader;
using Self = FixedHashTable;
Cell * buf; /// A piece of memory for all elements.
void alloc() { buf = reinterpret_cast<Cell *>(Allocator::alloc(NUM_CELLS * sizeof(Cell))); }
void free()
{
if (buf)
{
Allocator::free(buf, getBufferSizeInBytes());
buf = nullptr;
}
}
void destroyElements()
{
if (!std::is_trivially_destructible_v<Cell>)
for (iterator it = begin(), it_end = end(); it != it_end; ++it)
it.ptr->~Cell();
}
template <typename Derived, bool is_const>
class iterator_base
{
using Container = std::conditional_t<is_const, const Self, Self>;
using cell_type = std::conditional_t<is_const, const Cell, Cell>;
Container * container;
cell_type * ptr;
friend class FixedHashTable;
public:
iterator_base() {}
iterator_base(Container * container_, cell_type * ptr_) : container(container_), ptr(ptr_)
{
cell.update(ptr - container->buf, ptr);
}
bool operator==(const iterator_base & rhs) const { return ptr == rhs.ptr; }
bool operator!=(const iterator_base & rhs) const { return ptr != rhs.ptr; }
Derived & operator++()
{
++ptr;
/// Skip empty cells in the main buffer.
auto buf_end = container->buf + container->NUM_CELLS;
while (ptr < buf_end && ptr->isZero(*container))
++ptr;
return static_cast<Derived &>(*this);
}
auto & operator*()
{
if (cell.key != ptr - container->buf)
cell.update(ptr - container->buf, ptr);
return cell;
}
auto * operator-> ()
{
if (cell.key != ptr - container->buf)
cell.update(ptr - container->buf, ptr);
return &cell;
}
auto getPtr() const { return ptr; }
size_t getHash() const { return ptr - container->buf; }
size_t getCollisionChainLength() const { return 0; }
typename cell_type::CellExt cell;
};
public:
using key_type = Key;
using mapped_type = typename Cell::mapped_type;
using value_type = typename Cell::value_type;
using cell_type = Cell;
using LookupResult = Cell *;
using ConstLookupResult = const Cell *;
size_t hash(const Key & x) const { return x; }
FixedHashTable() { alloc(); }
FixedHashTable(FixedHashTable && rhs) : buf(nullptr) { *this = std::move(rhs); }
~FixedHashTable()
{
destroyElements();
free();
}
FixedHashTable & operator=(FixedHashTable && rhs)
{
destroyElements();
free();
std::swap(buf, rhs.buf);
this->setSize(rhs.size());
Allocator::operator=(std::move(rhs));
Cell::State::operator=(std::move(rhs));
return *this;
}
class Reader final : private Cell::State
{
public:
Reader(DB::ReadBuffer & in_) : in(in_) {}
Reader(const Reader &) = delete;
Reader & operator=(const Reader &) = delete;
bool next()
{
if (!is_initialized)
{
Cell::State::read(in);
DB::readVarUInt(size, in);
is_initialized
| null | 1
|
{
"advantage_score_max": 1.8790332078933716,
"advantage_score_mean": 1.8790332078933716,
"advantage_score_min": 1.8790332078933716,
"advantage_score_std": 0,
"advantage_scores": [
1.8790332078933716
],
"baseline_doc_loss": 1.3311095237731934,
"baseline_truncated": false,
"doc_advantage_score": 1.059922695159912,
"length_change_ratio": 0.9353448275862069,
"net_length_change_chars": -75,
"original_sentences_length_chars": 1160,
"replacement_paraphrases_length_chars": 1085,
"sentences_perturbed": 1,
"target_doc_loss": 1.2558553218841553,
"target_truncated": false,
"threshold_passing_sentences": 1,
"total_doc_length_chars": 7258,
"total_sentences": 17,
"truncated": false
}
|
<?xml version="1.0" encoding="utf-8"?>
<androidx.cardview.widget.CardView xmlns:android="http://schemas.android.com/apk/res/android"
xmlns:app="http://schemas.android.com/apk/res-auto"
xmlns:tools="http://schemas.android.com/tools"
android:layout_width="match_parent"
android:layout_height="wrap_content"
app:cardBackgroundColor="@color/color_white"
app:cardCornerRadius="@dimen/space_18"
app:cardPreventCornerOverlap="true"
app:cardUseCompatPadding="true">
<RelativeLayout xmlns:android="http://schemas.android.com/apk/res/android"
xmlns:tools="http://schemas.android.com/tools"
android:layout_width="match_parent"
android:layout_height="@dimen/space_40"
android:padding="@dimen/space_10">
<TextView
android:id="@+id/header_title"
style="@style/text_14_333333"
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:layout_centerVertical="true"
android:layout_marginStart="@dimen/space_10"
tools:text="标题" />
<TextView
android:id="@+id/header_options"
style="@style/text_14_333333"
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:layout_alignParentEnd="true"
android:layout_centerVertical="true"
android:layout_marginEnd="@dimen/space_10"
tools:text="操作" />
</RelativeLayout>
</androidx.cardview.widget.CardView>
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
<plist version="1.0">
<dict>
<key>CFBundleDevelopmentRegion</key>
<string>en</string>
<key>CFBundleDisplayName</key>
<string>${PRODUCT_NAME}</string>
<key>CFBundleExecutable</key>
<string>${EXECUTABLE_NAME}</string>
<key>CFBundleIconFile</key>
<string></string>
<key>CFBundleIdentifier</key>
<string>com.sadun.${EXECUTABLE_NAME}</string>
<key>CFBundleInfoDictionaryVersion</key>
<string>6.0</string>
<key>CFBundleName</key>
<string>${PRODUCT_NAME}</string>
<key>CFBundlePackageType</key>
<string>APPL</string>
<key>CFBundleSignature</key>
<string>????</string>
<key>CFBundleVersion</key>
<string>1.0</string>
</dict>
</plist>
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
#include "farversion.hpp"
#define PLUGIN_BUILD 110
#define PLUGIN_DESC L"Temporary Panel for Far Manager"
#define PLUGIN_NAME L"TmpPanel"
#define PLUGIN_FILENAME L"TmpPanel.dll"
#define PLUGIN_AUTHOR FARCOMPANYNAME
#define PLUGIN_VERSION MAKEFARVERSION(FARMANAGERVERSION_MAJOR,FARMANAGERVERSION_MINOR,FARMANAGERVERSION_REVISION,PLUGIN_BUILD,VS_RELEASE)
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
//===-- sanitizer_posix.cpp -----------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
// For license details, see https://llvm.org/LICENSE.txt. This file is part of the LLVM Project and may be used under the Apache License v2.0 with LLVM Exceptions.
//===----------------------------------------------------------------------===//
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
// For details about the license, refer to https://llvm.org/LICENSE.txt. This file is a component of the LLVM Project and is distributed under the Apache License v2.0 with LLVM Exceptions.
//===----------------------------------------------------------------------===//.
namespace __sanitizer {
// ------------- sanitizer_common.h
uptr GetMmapGranularity() {
return GetPageSize();
}
void *MmapOrDie(uptr size, const char *mem_type, bool raw_report) {
size = RoundUpTo(size, GetPageSizeCached());
uptr res = MmapNamed(nullptr, size, PROT_READ | PROT_WRITE,
MAP_PRIVATE | MAP_ANON, mem_type);
int reserrno;
if (UNLIKELY(internal_iserror(res, &reserrno)))
ReportMmapFailureAndDie(size, mem_type, "allocate", reserrno, raw_report);
IncreaseTotalMmap(size);
return (void *)res;
}
void UnmapOrDie(void *addr, uptr size) {
if (!addr || !size) return;
uptr res = internal_munmap(addr, size);
if (UNLIKELY(internal_iserror(res))) {
Report("ERROR: %s failed to deallocate 0x%zx (%zd) bytes at address %p\n",
SanitizerToolName, size, size, addr);
CHECK("unable to unmap" && 0);
}
DecreaseTotalMmap(size);
}
void *MmapOrDieOnFatalError(uptr size, const char *mem_type) {
size = RoundUpTo(size, GetPageSizeCached());
uptr res = MmapNamed(nullptr, size, PROT_READ | PROT_WRITE,
MAP_PRIVATE | MAP_ANON, mem_type);
int reserrno;
if (UNLIKELY(internal_iserror(res, &reserrno))) {
if (reserrno == ENOMEM)
return nullptr;
ReportMmapFailureAndDie(size, mem_type, "allocate", reserrno);
}
IncreaseTotalMmap(size);
return (void *)res;
}
// We want to map a chunk of address space aligned to 'alignment'.
// We do it by mapping a bit more and then unmapping redundant pieces.
// We probably can do it with fewer syscalls in some OS-dependent way.
void *MmapAlignedOrDieOnFatalError(uptr size, uptr alignment,
const char *mem_type) {
CHECK(IsPowerOfTwo(size));
CHECK(IsPowerOfTwo(alignment));
uptr map_size = size + alignment;
uptr map_res = (uptr)MmapOrDieOnFatalError(map_size, mem_type);
if (UNLIKELY(!map_res))
return nullptr;
uptr map_end = map_res + map_size;
uptr res = map_res;
if (!IsAligned(res, alignment)) {
res = (map_res + alignment - 1) & ~(alignment - 1);
UnmapOrDie((void*)map_res, res - map_res);
}
uptr end = res + size;
if (end != map_end)
UnmapOrDie((void*)end, map_end - end);
return (void*)res;
}
void *MmapNoReserveOrDie(uptr size, const char *mem_type) {
size = RoundUpTo(size, GetPageSizeCached());
uptr p = MmapNamed(nullptr, size, PROT_READ | PROT_WRITE,
MAP_PRIVATE | MAP_ANON | MAP_NORESERVE, mem_type);
int reserrno;
if (UNLIKELY(internal_iserror(p, &reserrno)))
ReportMmapFailureAndDie(size, mem_type, "allocate noreserve", reserrno);
IncreaseTotalMmap(size);
return (void *)p;
}
static void *MmapFixedImpl(uptr fixed_addr, uptr size, bool tolerate_enomem,
const char *name) {
size = RoundUpTo(size, GetPageSizeCached());
fixed_addr = RoundDownTo(fixed_addr, GetPageSizeCached());
uptr p = MmapNamed((void *)fixed_addr, size, PROT_READ | PROT_WRITE,
MAP_PRIVATE | MAP_ANON | MAP_FIXED, name);
int reserrno;
if (UNLIKELY(internal_iserror(p, &reserrno))) {
if (tolerate_enomem && reserrno == ENOMEM)
return nullptr;
char mem_type[40];
internal_snprintf(mem_type, sizeof(mem_type), "memory at address 0x%zx",
fixed_addr);
ReportMmapFailureAndDie(size, mem_type, "allocate", reserrno);
}
IncreaseTotalMmap(size);
return (void *)p;
}
void *MmapFixedOrDie(uptr fixed_addr, uptr size, const char *name) {
return MmapFixedImpl(fixed_addr, size, false /*tolerate_enomem*/, name);
}
void *MmapFixedOrDieOnFatalError(uptr fixed_addr, uptr size, const char *name) {
return MmapFixedImpl(fixed_addr, size, true /*tolerate_enomem*/, name);
}
bool MprotectNoAccess(uptr addr, uptr size) {
return 0 == internal_mprotect((void*)addr, size, PROT_NONE);
}
bool MprotectReadOnly(uptr addr, uptr size) {
return 0 == internal_mprotect((void *)addr, size, PROT_READ);
}
#if !SANITIZER_MAC
void MprotectMallocZones(void *addr, int prot) {}
#endif
fd_t OpenFile(const char *filename, FileAccessMode mode, error_t *errno_p) {
if (ShouldMockFailureToOpen(filename))
return kInvalidFd;
int flags;
switch (mode) {
case RdOnly: flags = O_RDONLY; break;
case WrOnly: flags = O_WRONLY | O_CREAT | O_TRUNC; break;
case RdWr: flags = O_RDWR | O_CREAT; break;
}
fd_t res = internal_open(filename, flags, 0660);
if (internal_iserror(res, errno_p))
return kInvalidFd;
return ReserveStandardFds(res);
}
void CloseFile(fd_t fd) {
internal_close(fd);
}
bool ReadFromFile(fd_t fd, void *buff, uptr buff_size, uptr *bytes_read,
error_t *error_p) {
uptr res = internal_read(fd, buff, buff_size);
if (internal_iserror(res, error_p))
return false;
if (bytes_read)
*
| null | 2
|
{
"advantage_score_max": 1.9081767797470093,
"advantage_score_mean": 1.9039711952209473,
"advantage_score_min": 1.8997654914855957,
"advantage_score_std": 0.004205644130706787,
"advantage_scores": [
1.9081767797470093,
1.8997654914855957
],
"baseline_doc_loss": 0.8215301036834717,
"baseline_truncated": false,
"doc_advantage_score": 1.1610926389694214,
"length_change_ratio": 0.9373493975903614,
"net_length_change_chars": -52,
"original_sentences_length_chars": 830,
"replacement_paraphrases_length_chars": 778,
"sentences_perturbed": 2,
"target_doc_loss": 0.7075491547584534,
"target_truncated": false,
"threshold_passing_sentences": 2,
"total_doc_length_chars": 5929,
"total_sentences": 9,
"truncated": false
}
|
<transition_graph cluster-delay="60s" stonith-timeout="60s" failed-stop-offset="INFINITY" failed-start-offset="INFINITY" transition_id="0">
<synapse id="0">
<action_set>
<rsc_op id="7" operation="start" operation_key="rsc1_start_0" on_node="host2" on_node_uuid="host2">
<primitive id="rsc1" class="ocf" provider="pacemaker" type="Dummy"/>
<attributes CRM_meta_on_node="host2" CRM_meta_on_node_uuid="host2" CRM_meta_timeout="20000" />
</rsc_op>
</action_set>
<inputs>
<trigger>
<pseudo_event id="2" operation="load_stopped_host2" operation_key="load_stopped_host2"/>
</trigger>
<trigger>
<rsc_op id="3" operation="monitor" operation_key="rsc1_monitor_0" on_node="host1" on_node_uuid="host1"/>
</trigger>
<trigger>
<rsc_op id="5" operation="monitor" operation_key="rsc1_monitor_0" on_node="host2" on_node_uuid="host2"/>
</trigger>
</inputs>
</synapse>
<synapse id="1">
<action_set>
<rsc_op id="5" operation="monitor" operation_key="rsc1_monitor_0" on_node="host2" on_node_uuid="host2">
<primitive id="rsc1" class="ocf" provider="pacemaker" type="Dummy"/>
<attributes CRM_meta_on_node="host2" CRM_meta_on_node_uuid="host2" CRM_meta_op_target_rc="7" CRM_meta_timeout="20000" />
</rsc_op>
</action_set>
<inputs/>
</synapse>
<synapse id="2">
<action_set>
<rsc_op id="3" operation="monitor" operation_key="rsc1_monitor_0" on_node="host1" on_node_uuid="host1">
<primitive id="rsc1" class="ocf" provider="pacemaker" type="Dummy"/>
<attributes CRM_meta_on_node="host1" CRM_meta_on_node_uuid="host1" CRM_meta_op_target_rc="7" CRM_meta_timeout="20000" />
</rsc_op>
</action_set>
<inputs/>
</synapse>
<synapse id="3">
<action_set>
<rsc_op id="8" operation="start" operation_key="rsc2_start_0" on_node="host1" on_node_uuid="host1">
<primitive id="rsc2" class="ocf" provider="pacemaker" type="Dummy"/>
<attributes CRM_meta_on_node="host1" CRM_meta_on_node_uuid="host1" CRM_meta_timeout="20000" />
</rsc_op>
</action_set>
<inputs>
<trigger>
<pseudo_event id="1" operation="load_stopped_host1" operation_key="load_stopped_host1"/>
</trigger>
<trigger>
<rsc_op id="4" operation="monitor" operation_key="rsc2_monitor_0" on_node="host1" on_node_uuid="host1"/>
</trigger>
<trigger>
<rsc_op id="6" operation="monitor" operation_key="rsc2_monitor_0" on_node="host2" on_node_uuid="host2"/>
</trigger>
</inputs>
</synapse>
<synapse id="4">
<action_set>
<rsc_op id="6" operation="monitor" operation_key="rsc2_monitor_0" on_node="host2" on_node_uuid="host2">
<primitive id="rsc2" class="ocf" provider="pacemaker" type="Dummy"/>
<attributes CRM_meta_on_node="host2" CRM_meta_on_node_uuid="host2" CRM_meta_op_target_rc="7" CRM_meta_timeout="20000" />
</rsc_op>
</action_set>
<inputs/>
</synapse>
<synapse id="5">
<action_set>
<rsc_op id="4" operation="monitor" operation_key="rsc2_monitor_0" on_node="host1" on_node_uuid="host1">
<primitive id="rsc2" class="ocf" provider="pacemaker" type="Dummy"/>
<attributes CRM_meta_on_node="host1" CRM_meta_on_node_uuid="host1" CRM_meta_op_target_rc="7" CRM_meta_timeout="20000" />
</rsc_op>
</action_set>
<inputs/>
</synapse>
<synapse id="6">
<action_set>
<pseudo_event id="2" operation="load_stopped_host2" operation_key="load_stopped_host2">
<attributes />
</pseudo_event>
</action_set>
<inputs/>
</synapse>
<synapse id="7">
<action_set>
<pseudo_event id="1" operation="load_stopped_host1" operation_key="load_stopped_host1">
<attributes />
</pseudo_event>
</action_set>
<inputs/>
</synapse>
</transition_graph>
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
# coding=utf-8
# --------------------------------------------------------------------------
# Copyright (c) Microsoft Corporation. All rights reserved.
# Licensed under the Apache License, Version 2.0. See License.txt in the project root for
# license information.
#
# Code generated by Microsoft (R) AutoRest Code Generator.
# Changes may cause incorrect behavior and will be lost if the code is
# regenerated.
# --------------------------------------------------------------------------
import uuid
from msrest.pipeline import ClientRawResponse
from msrestazure.azure_exceptions import CloudError
from .. import models
class UsagesOperations(object):
"""UsagesOperations operations.
You should not instantiate directly this class, but create a Client instance that will create it for you and attach it as attribute.
:param client: Client for service requests.
:param config: Configuration of service client.
:param serializer: An object model serializer.
:param deserializer: An object model deserializer.
:ivar api_version: The API version to use for this operation. Constant value: "2019-06-01".
"""
models = models
def __init__(self, client, config, serializer, deserializer):
self._client = client
self._serialize = serializer
self._deserialize = deserializer
self.api_version = "2019-06-01"
self.config = config
def list_by_location(
self, location, custom_headers=None, raw=False, **operation_config):
"""Gets the current usage count and the limit for the resources of the
location under the subscription.
:param location: The location of the Azure Storage resource.
:type location: str
:param dict custom_headers: headers that will be added to the request
:param bool raw: returns the direct response alongside the
deserialized response
:param operation_config: :ref:`Operation configuration
overrides<msrest:optionsforoperations>`.
:return: An iterator like instance of Usage
:rtype:
~azure.mgmt.storage.v2019_06_01.models.UsagePaged[~azure.mgmt.storage.v2019_06_01.models.Usage]
:raises: :class:`CloudError<msrestazure.azure_exceptions.CloudError>`
"""
def prepare_request(next_link=None):
if not next_link:
# Construct URL
url = self.list_by_location.metadata['url']
path_format_arguments = {
'subscriptionId': self._serialize.url("self.config.subscription_id", self.config.subscription_id, 'str', min_length=1),
'location': self._serialize.url("location", location, 'str')
}
url = self._client.format_url(url, **path_format_arguments)
# Construct parameters
query_parameters = {}
query_parameters['api-version'] = self._serialize.query("self.api_version", self.api_version, 'str', min_length=1)
else:
url = next_link
query_parameters = {}
# Construct headers
header_parameters = {}
header_parameters['Accept'] = 'application/json'
if self.config.generate_client_request_id:
header_parameters['x-ms-client-request-id'] = str(uuid.uuid1())
if custom_headers:
header_parameters.update(custom_headers)
if self.config.accept_language is not None:
header_parameters['accept-language'] = self._serialize.header("self.config.accept_language", self.config.accept_language, 'str')
# Construct and send request
request = self._client.get(url, query_parameters, header_parameters)
return request
def internal_paging(next_link=None):
request = prepare_request(next_link)
response = self._client.send(request, stream=False, **operation_config)
if response.status_code not in [200]:
exp = CloudError(response)
exp.request_id = response.headers.get('x-ms-request-id')
raise exp
return response
# Deserialize response
header_dict = None
if raw:
header_dict = {}
deserialized = models.UsagePaged(internal_paging, self._deserialize.dependencies, header_dict)
return deserialized
list_by_location.metadata = {'url': '/subscriptions/{subscriptionId}/providers/Microsoft.Storage/locations/{location}/usages'}
| null | 1
|
{
"advantage_score_max": 5.676385879516602,
"advantage_score_mean": 5.368000507354736,
"advantage_score_min": 5.059615135192871,
"advantage_score_std": 0.30838537216186523,
"advantage_scores": [
5.676385879516602,
5.059615135192871
],
"baseline_doc_loss": 0.9666827321052551,
"baseline_truncated": false,
"doc_advantage_score": 10.302495002746582,
"length_change_ratio": 1.4848484848484849,
"net_length_change_chars": 16,
"original_sentences_length_chars": 33,
"replacement_paraphrases_length_chars": 49,
"sentences_perturbed": 1,
"target_doc_loss": 0.09382996708154678,
"target_truncated": false,
"threshold_passing_sentences": 2,
"total_doc_length_chars": 4565,
"total_sentences": 18,
"truncated": false
}
|
/*
* Really Slick XScreenSavers
* Copyright (C) 2002-2006 Michael Chapman
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*****************************************************************************
*
* This is a Linux port of the Really Slick Screensavers,
* Copyright (C) 2002 Terence M. Welsh, available from www.reallyslick.com
*/
#include <common.hh>
#include <color.hh>
#include <oggsound.hh>
#include <pngimage.hh>
#include <resources.hh>
#include <skyrocket.hh>
#include <vector.hh>
#define STARTEXSIZE 512
#define MOONGLOWTEXSIZE 128
#define FLARESIZE 128
#define STARMESH 12
namespace Resources {
namespace Sounds {
Sound* boom1;
Sound* boom2;
Sound* boom3;
Sound* boom4;
Sound* launch1;
Sound* launch2;
Sound* nuke;
Sound* popper;
Sound* suck;
Sound* whistle;
void _init();
};
namespace Textures {
GLuint cloud;
GLuint stars;
GLuint moon;
GLuint moonGlow;
GLuint sunset;
GLuint earthNear;
GLuint earthFar;
GLuint earthLight;
GLuint smoke[5];
GLuint flare[4];
void makeHeights(unsigned int, unsigned int, unsigned int*);
void _init();
};
namespace DisplayLists {
GLuint flares;
GLuint rocket;
GLuint smokes;
GLuint stars;
GLuint moon;
GLuint moonGlow;
GLuint sunset;
GLuint earthNear;
GLuint earthFar;
GLuint earthLight;
void _init();
};
void init(float, const Vector&, const Vector&, const UnitQuat&);
};
void Resources::Sounds::_init() {
boom1 = new OGG("boom1.ogg", 1000.0f); Common::resources->manage(boom1);
boom2 = new OGG("boom2.ogg", 1000.0f); Common::resources->manage(boom2);
boom3 = new OGG("boom3.ogg", 1000.0f); Common::resources->manage(boom3);
boom4 = new OGG("boom4.ogg", 1200.0f); Common::resources->manage(boom4);
launch1 = new OGG("launch1.ogg", 10.0f); Common::resources->manage(launch1);
launch2 = new OGG("launch2.ogg", 10.0f); Common::resources->manage(launch2);
nuke = new OGG("nuke.ogg", 2000.0f); Common::resources->manage(nuke);
popper = new OGG("popper.ogg", 700.0f, 2.5f); Common::resources->manage(popper);
suck = new OGG("suck.ogg", 1500.0f); Common::resources->manage(suck);
whistle = new OGG("whistle.ogg", 700.0f); Common::resources->manage(whistle);
}
void Resources::Textures::makeHeights(unsigned int first, unsigned int last,
unsigned int* h) {
unsigned int diff = last - first;
if (diff <= 1) return;
unsigned int middle = first + (last - first) / 2;
int newHeight = (int(h[first]) + int(h[last])) / 2 +
Common::randomInt(diff / 2) - (diff / 4);
h[middle] = (newHeight < 1) ? 1 : newHeight;
makeHeights(first, middle, h);
makeHeights(middle, last, h);
}
void Resources::Textures::_init() {
// Initialize cloud texture object even if clouds are not turned on.
// Sunsets and shockwaves can also use cloud texture.
PNG cloudPNG("cloud.png");
cloud = Common::resources->genTexture(
GL_LINEAR_MIPMAP_LINEAR, GL_LINEAR, GL_REPEAT, GL_REPEAT,
cloudPNG
);
if (Hack::starDensity > 0) {
stdx::dim3<float, 3, STARTEXSIZE> starMap(STARTEXSIZE);
for (unsigned int i = 0; i < (Hack::starDensity * 20); ++i) {
unsigned int u = Common::randomInt(STARTEXSIZE - 4) + 2;
unsigned int v = Common::randomInt(STARTEXSIZE - 4) + 2;
RGBColor RGB(
0.8627f + Common::randomFloat(0.1373f),
0.8627f + Common::randomFloat(0.1373f),
0.8627f + Common::randomFloat(0.1373f)
);
switch (Common::randomInt(3)) {
case 0: RGB.r() = 1.0f; break;
case 1: RGB.g() = 1.0f; break;
case 2: RGB.b() = 1.0f; break;
}
switch (Common::randomInt(6)) { // different stars
case 0: case 1: case 2: // small
starMap(u, v, 0) = RGB.r() / 2.0f;
starMap(u, v, 1) = RGB.g() / 2.0f;
starMap(u, v, 2) = RGB.b() / 2.0f;
RGB /= 3 + Common::randomInt(6);
starMap(u + 1, v, 0) = starMap(u - 1, v, 0) =
starMap(u, v + 1, 0) = starMap(u, v - 1, 0) = RGB.r();
starMap(u + 1, v, 1) = starMap(u - 1, v, 1) =
starMap(u, v + 1, 1) = starMap(u, v - 1, 1) = RGB.g();
starMap(u + 1, v, 2) = starMap(u - 1, v, 2) =
starMap(u, v + 1, 2) = starMap(u, v - 1, 2) = RGB.b();
break;
case 3: case 4: // medium
starMap(u, v, 0) = RGB.r();
starMap(u, v, 1) = RGB.g();
starMap(u, v, 2) = RGB.b();
RGB /= 2;
starMap(u + 1, v, 0) = starMap(u - 1, v, 0) =
starMap(u, v + 1, 0) = starMap(u, v - 1, 0) = RGB.r();
starMap(u + 1, v, 1) = starMap(u - 1, v, 1) =
starMap(u, v + 1, 1) = starMap(u, v - 1, 1) = RGB.g();
starMap(u + 1, v, 2) = starMap(u - 1, v, 2) =
starMap(u, v + 1, 2) = starMap(u, v - 1, 2) = RGB.b();
break;
case 5: // large
starMap(u, v, 0) = RGB.r();
starMap(u, v, 1) = RGB.g();
starMap(u, v, 2) = RGB.b();
starMap(u + 1, v + 1, 0) = starMap(u - 1, v + 1, 0) =
starMap(u + 1, v - 1, 0) = starMap(u - 1, v - 1, 0) =
RGB.r() / 4.0f
| null | 1
|
{
"advantage_score_max": 6.211544990539551,
"advantage_score_mean": 3.725314140319824,
"advantage_score_min": 1.2390835285186768,
"advantage_score_std": 2.4862306118011475,
"advantage_scores": [
6.211544990539551,
1.2390835285186768
],
"baseline_doc_loss": 0.6813102960586548,
"baseline_truncated": false,
"doc_advantage_score": 0.9643401503562927,
"length_change_ratio": 0.9421052631578948,
"net_length_change_chars": -11,
"original_sentences_length_chars": 190,
"replacement_paraphrases_length_chars": 179,
"sentences_perturbed": 1,
"target_doc_loss": 0.7065041065216064,
"target_truncated": false,
"threshold_passing_sentences": 2,
"total_doc_length_chars": 5418,
"total_sentences": 7,
"truncated": false
}
|
/**
* \file
*
* \brief Linker script for running in internal FLASH on the SAMD21G18A
*
* Copyright (c) 2017 Microchip Technology Inc.
*
* \asf_license_start
*
* \page License
*
* SPDX-License-Identifier: Apache-2.0
*
* 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 Licence 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.
*
* \asf_license_stop
*
*/
OUTPUT_FORMAT("elf32-littlearm", "elf32-littlearm", "elf32-littlearm")
OUTPUT_ARCH(arm)
SEARCH_DIR(.)
/* Memory Spaces Definitions */
MEMORY
{
rom (rx) : ORIGIN = 0x00000000 + 8K, LENGTH = 0x00040000 - 8K /* 8K offset to preserve bootloader */
ram (rwx) : ORIGIN = 0x20000000, LENGTH = 0x00008000
}
/* The stack size used by the application. you must set this value based on your application's needs. */
STACK_SIZE = DEFINED(STACK_SIZE)STACK_SIZE : DEFINED(STACK_SIZE) ? STACK_SIZE?) ? __stack_size__ : 0x2000;
ENTRY(Reset_Handler)
/* Section Definitions */
SECTIONS
{
.text :
{
. = ALIGN(4);
_sfixed = .;
KEEP(*(.vectors .vectors.*))
*(.text .text.* .gnu.linkonce.t.*)
*(.glue_7t) *(.glue_7)
*(.rodata .rodata* .gnu.linkonce.r.*)
*(.ARM.extab* .gnu.linkonce.armextab.*)
/* Support C constructors, and C destructors in both user code
and the C library. This also provides support for C++ code. */
. = ALIGN(4);
KEEP(*(.init))
. = ALIGN(4);
__preinit_array_start = .;
KEEP (*(.preinit_array))
__preinit_array_end = .;
. = ALIGN(4);
__init_array_start = .;
KEEP (*(SORT(.init_array.*)))
KEEP (*(.init_array))
__init_array_end = .;
. = ALIGN(4);
KEEP (*crtbegin.o(.ctors))
KEEP (*(EXCLUDE_FILE (*crtend.o) .ctors))
KEEP (*(SORT(.ctors.*)))
KEEP (*crtend.o(.ctors))
. = ALIGN(4);
KEEP(*(.fini))
. = ALIGN(4);
__fini_array_start = .;
KEEP (*(.fini_array))
KEEP (*(SORT(.fini_array.*)))
__fini_array_end = .;
KEEP (*crtbegin.o(.dtors))
KEEP (*(EXCLUDE_FILE (*crtend.o) .dtors))
KEEP (*(SORT(.dtors.*)))
KEEP (*crtend.o(.dtors))
. = ALIGN(4);
_efixed = .; /* End of text section */
} > rom
/* .ARM.exidx is sorted, so has to go in its own output section. */
PROVIDE_HIDDEN (__exidx_start = .);
.ARM.exidx :
{
*(.ARM.exidx* .gnu.linkonce.armexidx.*)
} > rom
PROVIDE_HIDDEN (__exidx_end = .);
. = ALIGN(4);
_etext = .;
.relocate : AT (_etext)
{
. = ALIGN(4);
_srelocate = .;
*(.ramfunc .ramfunc.*);
*(.data .data.*);
. = ALIGN(4);
_erelocate = .;
} > ram
/* .bss section which is used for uninitialized data */
.bss (NOLOAD) :
{
. = ALIGN(4);
_sbss = . ;
_szero = .;
*(.bss .bss.*)
*(COMMON)
. = ALIGN(4);
_ebss = . ;
_ezero = .;
end = .;
} > ram
/* stack section */
.stack (NOLOAD):
{
. = ALIGN(8);
_sstack = .;
. = . + STACK_SIZE;
. = ALIGN(8);
_estack = .;
} > ram
. = ALIGN(4);
_end = . ;
}
| null | 2
|
{
"advantage_score_max": 5.7177629470825195,
"advantage_score_mean": 3.4707460403442383,
"advantage_score_min": 1.4178907871246338,
"advantage_score_std": 1.5338280200958252,
"advantage_scores": [
5.7177629470825195,
5.502110481262207,
5.24374532699585,
5.025511264801025,
3.25551438331604,
2.842651844024658,
2.7687432765960693,
2.6845991611480713,
2.1653213500976562,
1.5543546676635742,
1.4178907871246338
],
"baseline_doc_loss": 0.6104903817176819,
"baseline_truncated": false,
"doc_advantage_score": 4.549302577972412,
"length_change_ratio": 1.118279569892473,
"net_length_change_chars": 11,
"original_sentences_length_chars": 93,
"replacement_paraphrases_length_chars": 104,
"sentences_perturbed": 2,
"target_doc_loss": 0.1341942846775055,
"target_truncated": false,
"threshold_passing_sentences": 11,
"total_doc_length_chars": 3700,
"total_sentences": 64,
"truncated": false
}
|
/****************************************************************************
**
** Copyright (C) 2014-2019 Dinu SV.
** (contact: mail@dinusv.com)
** This file is part of Livekeys Application.
**
** GNU Lesser General Public License Usage
** This file may be used under the terms of the GNU Lesser
** General Public License version 3 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPLv3 included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 3 requirements
** will be met: https://www.gnu.org/licenses/lgpl.html.
**
****************************************************************************/
#include "live/libraryloadpath.h"
#include "live/visuallog.h"
#include <QDir>
#include <QDirIterator>
#include <QFile>
#include <QDebug>
namespace lv{
namespace{
bool assertLinkPathExists(const QString& linkPath){
if ( !QDir(linkPath).exists() )
return QDir().mkdir(linkPath);
return true;
}
}// namespace
void LibraryLoadPath::addImpl(const QString& path, const QString& linkPath, bool recursive){
if ( !assertLinkPathExists(linkPath) ){
qCritical("Failed to create link directory. Some library dependencies might not load correctly.");
return;
}
QDirIterator dit(path);
while ( dit.hasNext() ){
dit.next();
QFileInfo info = dit.fileInfo();
if ( info.fileName() == "." || info.fileName() == ".." )
continue;
if ( (info.isFile() || info.isSymLink()) &&
info.fileName().startsWith("lib") &&
( info.fileName().contains(".so") || info.fileName().contains(".dylib") )
)
{
QFile f(dit.filePath());
f.link(linkPath + "/" + info.fileName());
vlog_debug("libraryloadpath", "Added \'" + linkPath + "/" + info.fileName() + "\' -> \'" + f.fileName() + "\'");
} else if ( info.isDir() && recursive ){
addImpl(info.filePath(), linkPath, recursive);
}
}
}
}// namespace
| null | 1
|
{
"advantage_score_max": 1.2038241624832153,
"advantage_score_mean": 1.1982247829437256,
"advantage_score_min": 1.1926252841949463,
"advantage_score_std": 0.0055994391441345215,
"advantage_scores": [
1.2038241624832153,
1.1926252841949463
],
"baseline_doc_loss": 0.8217305541038513,
"baseline_truncated": false,
"doc_advantage_score": 1.0297964811325073,
"length_change_ratio": 1.186046511627907,
"net_length_change_chars": 8,
"original_sentences_length_chars": 43,
"replacement_paraphrases_length_chars": 51,
"sentences_perturbed": 1,
"target_doc_loss": 0.7979543209075928,
"target_truncated": false,
"threshold_passing_sentences": 2,
"total_doc_length_chars": 2091,
"total_sentences": 8,
"truncated": false
}
|
/*
* picodlp panel driver
* picodlp_i2c_driver: i2c_client driver
*
* Copyright (C) 2009-2011 Texas Instruments
* Author: Mythri P K <mythripk@ti.com>
* Mayuresh Janorkar <mayur@ti.com>
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 as published by
* the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
* more details.
*
* You should have received a copy of the GNU General Public License along with
* this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <linux/module.h>
#include <linux/input.h>
#include <linux/platform_device.h>
#include <linux/interrupt.h>
#include <linux/firmware.h>
#include <linux/slab.h>
#include <linux/mutex.h>
#include <linux/i2c.h>
#include <linux/delay.h>
#include <linux/gpio.h>
#include <video/omapdss.h>
#include <video/omap-panel-picodlp.h>
#include "panel-picodlp.h"
struct picodlp_data {
struct mutex lock;
struct i2c_client *picodlp_i2c_client;
};
static struct i2c_board_info picodlp_i2c_board_info = {
I2C_BOARD_INFO("picodlp_i2c_driver", 0x1b),
};
struct picodlp_i2c_data {
struct mutex xfer_lock;
};
static struct i2c_device_id picodlp_i2c_id[] = {
{ "picodlp_i2c_driver", 0 },
};
struct picodlp_i2c_command {
u8 reg;
u32 value;
};
static struct omap_video_timings pico_ls_timings = {
.x_res = 864,
.y_res = 480,
.hsw = 7,
.hfp = 11,
.hbp = 7,
.pixel_clock = 19200,
.vsw = 2,
.vfp = 3,
.vbp = 14,
};
static inline struct picodlp_panel_data
*get_panel_data(const struct omap_dss_device *dssdev)
{
return (struct picodlp_panel_data *) dssdev->data;
}
static u32 picodlp_i2c_read(struct i2c_client *client, u8 reg)
{
u8 read_cmd[] = {READ_REG_SELECT, reg}, data[4];
struct picodlp_i2c_data *picodlp_i2c_data = i2c_get_clientdata(client);
struct i2c_msg msg[2];
mutex_lock(&picodlp_i2c_data->xfer_lock);
msg[0].addr = client->addr;
msg[0].flags = 0;
msg[0].len = 2;
msg[0].buf = read_cmd;
msg[1].addr = client->addr;
msg[1].flags = I2C_M_RD;
msg[1].len = 4;
msg[1].buf = data;
i2c_transfer(client->adapter, msg, 2);
mutex_unlock(&picodlp_i2c_data->xfer_lock);
return (data[3] | (data[2] << 8) | (data[1] << 16) | (data[0] << 24));
}
static int picodlp_i2c_write_block(struct i2c_client *client,
u8 *data, int len)
{
struct i2c_msg msg;
int i, r, msg_count = 1;
struct picodlp_i2c_data *picodlp_i2c_data = i2c_get_clientdata(client);
if (len < 1 || len > 32) {
dev_err(&client->dev,
"too long syn_write_block len %d\n", len);
return -EIO;
}
mutex_lock(&picodlp_i2c_data->xfer_lock);
msg.addr = client->addr;
msg.flags = 0;
msg.len = len;
msg.buf = data;
r = i2c_transfer(client->adapter, &msg, msg_count);
mutex_unlock(&picodlp_i2c_data->xfer_lock);
/*
* i2c_transfer returns:
* number of messages sent in case of success
* a negative error number in case of failure
*/
if (r != msg_count)
goto err;
/* In case of success */
for (i = 0; i < len; i++)
dev_dbg(&client->dev,
"addr %x bw 0x%02x[%d]: 0x%02x\n",
client->addr, data[0] + i, i, data[i]);
return 0;
err:
dev_err(&client->dev, "picodlp_i2c_write error\n");
return r;
}
static int picodlp_i2c_write(struct i2c_client *client, u8 reg, u32 value)
{
u8 data[5];
int i;
data[0] = reg;
for (i = 1; i < 5; i++)
data[i] = (value >> (32 - (i) * 8)) & 0xFF;
return picodlp_i2c_write_block(client, data, 5);
}
static int picodlp_i2c_write_array(struct i2c_client *client,
const struct picodlp_i2c_command commands[],
int count)
{
int i, r = 0;
for (i = 0; i < count; i++) {
r = picodlp_i2c_write(client, commands[i].reg,
commands[i].value);
if (r)
return r;
}
return r;
}
static int picodlp_wait_for_dma_done(struct i2c_client *client)
{
u8 trial = 100;
do {
msleep(1);
if (!trial--)
return -ETIMEDOUT;
} while (picodlp_i2c_read(client, MAIN_STATUS) & DMA_STATUS);
return 0;
}
/**
* picodlp_i2c_init: i2c_initialization routine
* client: i2c_client for communication
*
* return
* 0 : Success, no error
* error code : Failure
*/
static int picodlp_i2c_init(struct i2c_client *client)
{
int r;
static const struct picodlp_i2c_command init_cmd_set1[] = {
{SOFT_RESET, 1},
{DMD_PARK_TRIGGER, 1},
{MISC_REG, 5},
{SEQ_CONTROL, 0},
{SEQ_VECTOR, 0x100},
{DMD_BLOCK_COUNT, 7},
{DMD_VCC_CONTROL, 0x109},
{DMD_PARK_PULSE_COUNT, 0xA},
{DMD_PARK_PULSE_WIDTH, 0xB},
{DMD_PARK_DELAY, 0x2ED},
{DMD_SHADOW_ENABLE, 0},
{FLASH_OPCODE, 0xB},
{FLASH_DUMMY_BYTES, 1},
{FLASH_ADDR_BYTES, 3},
{
| null | 0
|
{
"advantage_score_max": 0,
"advantage_score_mean": 0,
"advantage_score_min": 0,
"advantage_score_std": 0,
"advantage_scores": [],
"baseline_doc_loss": 0.8330018520355225,
"baseline_truncated": false,
"doc_advantage_score": 1.1883536577224731,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 0,
"replacement_paraphrases_length_chars": 0,
"sentences_perturbed": 0,
"target_doc_loss": 0.7009713053703308,
"target_truncated": false,
"threshold_passing_sentences": 0,
"total_doc_length_chars": 4791,
"total_sentences": 6,
"truncated": false
}
|
import fs from 'graceful-fs';
import { promisify } from 'util';
export const copyFile = promisify(fs.copyFile);
export const mkdir = promisify(fs.mkdir);
export const readdir = promisify(fs.readdir);
export const readFile = promisify(fs.readFile);
export const stat = promisify(fs.stat);
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
/* -*- mode: C++ ; c-file-style: "stroustrup" -*- *****************************
* Qwt Widget Library
* Copyright (C) 1997 Josef Wilgen
* Copyright (C) 2002 Uwe Rathmann
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the Qwt License, Version 1.0
*****************************************************************************/
#include "qwt_plot_spectrogram.h"
#include "qwt_painter.h"
#include "qwt_interval.h"
#include "qwt_scale_map.h"
#include "qwt_color_map.h"
#include <qimage.h>
#include <qpen.h>
#include <qpainter.h>
#include <qmath.h>
#include <qalgorithms.h>
#if QT_VERSION >= 0x040400
#include <qthread.h>
#include <qfuture.h>
#include <qtconcurrentrun.h>
#endif
#define DEBUG_RENDER 0
#if DEBUG_RENDER
#include <QElapsedTimer>
#endif
class QwtPlotSpectrogram::PrivateData
{
public:
PrivateData():
data( NULL )
{
colorMap = new QwtLinearColorMap();
displayMode = ImageMode;
conrecFlags = QwtRasterData::IgnoreAllVerticesOnLevel;
#if 0
conrecFlags |= QwtRasterData::IgnoreOutOfRange;
#endif
}
~PrivateData()
{
delete data;
delete colorMap;
}
QwtRasterData *data;
QwtColorMap *colorMap;
DisplayModes displayMode;
QList<double> contourLevels;
QPen defaultContourPen;
QwtRasterData::ConrecFlags conrecFlags;
};
/*!
Sets the following item attributes:
- QwtPlotItem::AutoScale: true
- QwtPlotItem::Legend: false
The z value is initialized by 8.0.
\param title Title
\sa QwtPlotItem::setItemAttribute(), QwtPlotItem::setZ()
*/
QwtPlotSpectrogram::QwtPlotSpectrogram( const QString &title ):
QwtPlotRasterItem( title )
{
d_data = new PrivateData();
setItemAttribute( QwtPlotItem::AutoScale, true );
setItemAttribute( QwtPlotItem::Legend, false );
setZ( 8.0 );
}
//! Destructor for QwtPlotSpectrogram class implementation! \return QwtPlotItem::Rtti_PlotSpectrogram
int QwtPlotSpectrogram::rtti() const
{
return QwtPlotItem::Rtti_PlotSpectrogram;
}
/*!
The display mode controls how the raster data will be represented.
\param mode Display mode
\param on On/Off
The default setting enables ImageMode.
\sa DisplayMode, displayMode()
*/
void QwtPlotSpectrogram::setDisplayMode( DisplayMode mode, bool on )
{
if ( on != bool( mode & d_data->displayMode ) )
{
if ( on )
d_data->displayMode |= mode;
else
d_data->displayMode &= ~mode;
}
legendChanged();
itemChanged();
}
/*!
The display mode controls how the raster data will be represented.
\param mode Display mode
\return true if mode is enabled
*/
bool QwtPlotSpectrogram::testDisplayMode( DisplayMode mode ) const
{
return ( d_data->displayMode & mode );
}
/*!
Change the color map
Often it is useful to display the mapping between intensities and
colors as an additional plot axis, showing a color bar.
\param colorMap Color Map
\sa colorMap(), QwtScaleWidget::setColorBarEnabled(),
QwtScaleWidget::setColorMap()
*/
void QwtPlotSpectrogram::setColorMap( QwtColorMap *colorMap )
{
if ( d_data->colorMap != colorMap )
{
delete d_data->colorMap;
d_data->colorMap = colorMap;
}
invalidateCache();
legendChanged();
itemChanged();
}
/*!
\return Color Map used for mapping the intensity values to colors
\sa setColorMap()
*/
const QwtColorMap *QwtPlotSpectrogram::colorMap() const
{
return d_data->colorMap;
}
/*!
Build and assign the default pen for the contour lines
In Qt5 the default pen width is 1.0 ( 0.0 in Qt4 ) what makes it
non cosmetic ( see QPen::isCosmetic() ). This method has been introduced
to hide this incompatibility.
\param color Pen color
\param width Pen width
\param style Pen style
\sa pen(), brush()
*/
void QwtPlotSpectrogram::setDefaultContourPen(
const QColor &color, qreal width, Qt::PenStyle style )
{
setDefaultContourPen( QPen( color, width, style ) );
}
/*!
\brief Set the default pen for the contour lines
If the spectrogram has a valid default contour pen
a contour line is painted using the default contour pen.
Otherwise (pen.style() == Qt::NoPen) the pen is calculated
for each contour level using contourPen().
\sa defaultContourPen(), contourPen()
*/
void QwtPlotSpectrogram::setDefaultContourPen( const QPen &pen )
{
if ( pen != d_data->defaultContourPen )
{
d_data->defaultContourPen = pen;
legendChanged();
itemChanged();
}
}
/*!
\return Default contour pen
\sa setDefaultContourPen()
*/
QPen QwtPlotSpectrogram::defaultContourPen() const
{
return d_data->defaultContourPen;
}
/*!
\brief Calculate the pen for a contour line
The color of the pen is the color for level calculated by the color map
\param level Contour level
\return Pen for the contour line
\note contourPen is only used if defaultContourPen().style() == Qt::NoPen
\sa setDefaultContourPen(), setColorMap(), setContourLevels()
*/
QPen QwtPlotSpectrogram::contourPen( double level ) const
{
if ( d_data->data == NULL || d_data->colorMap == NULL )
return QPen();
const QwtInterval intensityRange = d_data->data->interval(Qt::ZAxis);
const QColor c( d_data->colorMap->rgb( intensityRange, level ) );
return QPen( c );
}
/*!
Modify an attribute of the CONREC algorithm, used to calculate
the contour lines.
\param flag CONREC flag
\param on On/Off
\sa testConrecFlag(), renderContourLines(),
QwtRasterData::contourLines()
*/
void QwtPlotSpectrogram::setConrecFlag(
QwtRasterData::ConrecFlag flag, bool on )
{
if ( bool( d_data->conrecFlags & flag ) == on )
return;
if ( on )
d_data->conrecFlags |= flag;
else
d_data->conrecFlags &= ~flag;
itemChanged();
}
/*!
Test an attribute of the CONREC algorithm, used to calculate
the contour lines.
\param flag CONREC flag
\return true, is enabled
The default setting enables QwtRasterData::IgnoreAllVerticesOnLevel
\sa setConrecClag(), renderContourLines(),
QwtRasterData::contourLines()
*/
bool QwtPlotSpectrogram::testConrecFlag(
QwtRasterData::ConrecFlag flag ) const
{
return d_data->conrecFlags & flag;
}
/*!
Set the levels of the contour lines
\param levels Values of the contour levels
\sa contourLevels(), renderContourLines(),
QwtRasterData::contourLines()
\note
| null | 1
|
{
"advantage_score_max": 4.916356086730957,
"advantage_score_mean": 2.753973960876465,
"advantage_score_min": 1.2631816864013672,
"advantage_score_std": 1.2781168222427368,
"advantage_scores": [
4.916356086730957,
4.21306848526001,
4.208592891693115,
2.6751646995544434,
2.3994903564453125,
1.9178825616836548,
1.7482444047927856,
1.4437822103500366,
1.2631816864013672
],
"baseline_doc_loss": 0.8827033638954163,
"baseline_truncated": false,
"doc_advantage_score": 1.1260744333267212,
"length_change_ratio": 0.6875,
"net_length_change_chars": -25,
"original_sentences_length_chars": 80,
"replacement_paraphrases_length_chars": 55,
"sentences_perturbed": 1,
"target_doc_loss": 0.7838765382766724,
"target_truncated": false,
"threshold_passing_sentences": 9,
"total_doc_length_chars": 6573,
"total_sentences": 26,
"truncated": false
}
|
/* -*- Mode: C++; c-basic-offset: 4; indent-tabs-mode: nil; tab-width: 4 -*- */
/* vi: set ts=4 sw=4 expandtab: (add to ~/.vimrc: set modeline modelines=5) */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
var DESC = "Vector initialization from constructor call, compare vector-init-1 and array-init-4.";
include "driver.as"
class C {
public var c:C = null;
}
function vector_init_C(): *
{
var t: Vector.<C>;
var c: C = new C;
for ( var i:int=0 ; i < 10000 ; i++ )
t = Vector.<C>([c, c, c]);
return t;
}
TEST(function () { vector_init_C(); }, "vector-init-4");
| null | 0
|
{
"advantage_score_max": 0,
"advantage_score_mean": 0,
"advantage_score_min": 0,
"advantage_score_std": 0,
"advantage_scores": [],
"baseline_doc_loss": 1.4100106954574585,
"baseline_truncated": false,
"doc_advantage_score": 1.7358611822128296,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 0,
"replacement_paraphrases_length_chars": 0,
"sentences_perturbed": 0,
"target_doc_loss": 0.8122830986976624,
"target_truncated": false,
"threshold_passing_sentences": 0,
"total_doc_length_chars": 751,
"total_sentences": 4,
"truncated": false
}
|
import sys
from typing import Any, IO, Optional, Tuple, Callable, Dict, List, Union
from .decoder import JSONDecoder as JSONDecoder
from .encoder import JSONEncoder as JSONEncoder
if sys.version_info >= (3, 5):
from .decoder import JSONDecodeError as JSONDecodeError
def dumps(obj: Any,
skipkeys: bool = ...,
ensure_ascii: bool = ...,
check_circular: bool = ...,
allow_nan: bool = ...,
cls: Any = ...,
indent: Union[None, int, str] = ...,
separators: Optional[Tuple[str, str]] = ...,
default: Optional[Callable[[Any], Any]] = ...,
sort_keys: bool = ...,
**kwds: Any) -> str: ...
def dump(obj: Any,
fp: IO[str],
skipkeys: bool = ...,
ensure_ascii: bool = ...,
check_circular: bool = ...,
allow_nan: bool = ...,
cls: Any = ...,
indent: Union[None, int, str] = ...,
separators: Optional[Tuple[str, str]] = ...,
default: Optional[Callable[[Any], Any]] = ...,
sort_keys: bool = ...,
**kwds: Any) -> None: ...
def loads(s: Union[str, bytes, bytearray],
encoding: Any = ..., # ignored and deprecated
cls: Any = ...,
object_hook: Optional[Callable[[Dict], Any]] = ...,
parse_float: Optional[Callable[[str], Any]] = ...,
parse_int: Optional[Callable[[str], Any]] = ...,
parse_constant: Optional[Callable[[str], Any]] = ...,
object_pairs_hook: Optional[Callable[[List[Tuple[Any, Any]]], Any]] = ...,
**kwds: Any) -> Any: ...
if sys.version_info >= (3, 6):
_LoadIO = IO[Any]
else:
_LoadIO = IO[str]
def load(fp: _LoadIO,
cls: Any = ...,
object_hook: Optional[Callable[[Dict], Any]] = ...,
parse_float: Optional[Callable[[str], Any]] = ...,
parse_int: Optional[Callable[[str], Any]] = ...,
parse_constant: Optional[Callable[[str], Any]] = ...,
object_pairs_hook: Optional[Callable[[List[Tuple[Any, Any]]], Any]] = ...,
**kwds: Any) -> Any: ...
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
// Copyright 2011 Baptiste Lepilleur
// Distributed under MIT license, or public domain if desired and
// recognized in your jurisdiction.
// See file LICENSE for detail or copy at http://jsoncpp.sourceforge.net/LICENSE
#if !defined(JSON_IS_AMALGAMATION)
#include <json/writer.h>
#include "json_tool.h"
#endif // if !defined(JSON_IS_AMALGAMATION)
#include <iomanip>
#include <memory>
#include <sstream>
#include <utility>
#include <set>
#include <cassert>
#include <cstring>
#include <cstdio>
#if defined(_MSC_VER) && _MSC_VER >= 1200 && _MSC_VER < 1800 // Between VC++ 6.0 and VC++ 11.0
#include <float.h>
#define isfinite _finite
#elif defined(__sun) && defined(__SVR4) //Solaris
#include <ieeefp.h>
#define isfinite finite
#else
#include <cmath>
#define isfinite std::isfinite
#endif
#if defined(_MSC_VER) && _MSC_VER < 1500 // VC++ 8.0 and below
#define snprintf _snprintf
#elif defined(__ANDROID__)
#define snprintf snprintf
#elif __cplusplus >= 201103L
#define snprintf std::snprintf
#endif
#if defined(__BORLANDC__)
#include <float.h>
#define isfinite _finite
#define snprintf _snprintf
#endif
#if defined(_MSC_VER) && _MSC_VER >= 1400 // VC++ 8.0
// Disable warning about strdup being deprecated.
#pragma warning(disable : 4996)
#endif
namespace Json {
#if __cplusplus >= 201103L
typedef std::unique_ptr<StreamWriter> StreamWriterPtr;
#else
typedef std::auto_ptr<StreamWriter> StreamWriterPtr;
#endif
static bool containsControlCharacter(const char* str) {
while (*str) {
if (isControlCharacter(*(str++)))
return true;
}
return false;
}
static bool containsControlCharacter0(const char* str, unsigned len) {
char const* end = str + len;
while (end != str) {
if (isControlCharacter(*str) || 0 == *str)
return true;
++str;
}
return false;
}
std::string valueToString(LargestInt value) {
UIntToStringBuffer buffer;
char* current = buffer + sizeof(buffer);
if (value == Value::minLargestInt) {
uintToString(LargestUInt(Value::maxLargestInt) + 1, current);
*--current = '-';
}
else if (value < 0) {
uintToString(LargestUInt(-value), current);
*--current = '-';
}
else {
uintToString(LargestUInt(value), current);
}
assert(current >= buffer);
return current;
}
std::string valueToString(LargestUInt value) {
UIntToStringBuffer buffer;
char* current = buffer + sizeof(buffer);
uintToString(value, current);
assert(current >= buffer);
return current;
}
#if defined(JSON_HAS_INT64)
std::string valueToString(Int value) {
return valueToString(LargestInt(value));
}
std::string valueToString(UInt value) {
return valueToString(LargestUInt(value));
}
#endif // # if defined(JSON_HAS_INT64)
std::string valueToString(double value) {
// Allocate a buffer that is more than large enough to store the 16 digits of
// precision requested below.
char buffer[32];
int len = -1;
// Print into the buffer. We need not request the alternative representation
// that always has a decimal point because JSON doesn't distingish the
// concepts of reals and integers.
#if defined(_MSC_VER) && defined(__STDC_SECURE_LIB__) // Use secure version with
// visual studio 2005 to
// avoid warning.
#if defined(WINCE)
len = _snprintf(buffer, sizeof(buffer), "%.17g", value);
#else
len = sprintf_s(buffer, sizeof(buffer), "%.17g", value);
#endif
#else
if (isfinite(value)) {
len = snprintf(buffer, sizeof(buffer), "%.17g", value);
}
else {
// IEEE standard states that NaN values will not compare to themselves
if (value != value) {
len = snprintf(buffer, sizeof(buffer), "null");
}
else if (value < 0) {
len = snprintf(buffer, sizeof(buffer), "-1e+9999");
}
else {
len = snprintf(buffer, sizeof(buffer), "1e+9999");
}
// For those, we do not need to call fixNumLoc, but it is fast.
}
#endif
assert(len >= 0);
fixNumericLocale(buffer, buffer + len);
return buffer;
}
std::string valueToString(bool value) { return value ? "true" : "false"; }
std::string valueToQuotedString(const char* value) {
if (value == NULL)
return "";
// Not sure how to handle unicode...
if (strpbrk(value, "\"\\\b\f\n\r\t") == NULL &&
!containsControlCharacter(value))
return std::string("\"") + value + "\"";
// We have to walk value and escape any special characters.
// Adding characters to std::string is slow, but this case should not occur often.
// (Note: forward slashes are *not* rare, but I am not escaping them.)
std::string::size_type maxsize =
strlen(value) * 2 + 3; // allescaped+quotes+NULL
std::string result;
result.reserve(maxsize); // to avoid lots of mallocs
result += "\"";
for (const char* c = value; *c != 0; ++c) {
switch (*c) {
case '\"':
result += "\\\"";
break;
case '\\':
result += "\\\\";
break;
case '\b':
result += "\\b";
break;
case '\f':
result += "\\f";
break;
case '\n':
result += "\\n";
break;
case '\r':
result += "\\r";
break;
case '\t':
result += "\\t";
break;
// case '/':
// Even though \/ is considered a legal escape in JSON, a bare
// slash is also legal, so I see no reason to escape it.
// (I hope I am not misunderstanding something.
// blep notes: actually escaping \/ may be useful in javascript to avoid </
// sequence.
// Should add a flag to allow this compatibility mode and prevent this
// sequence from occurring.
default:
if (isControlCharacter(*c)) {
std::ostringstream oss;
oss << "\\u" << std::hex << std::uppercase << std::setfill('0')
<< std::setw(4) << static_cast<int>(*c);
result += oss.str();
}
else {
result += *c;
}
break;
}
}
result += "\"";
return result;
}
// https://github.com/upcaste/upcaste/blob/master/src/upcore/src/cstring/strnpbrk.cpp
static char const* strnpbrk(char const* s, char const* accept, size_t n) {
assert((s || !n) && accept);
char const* const end = s + n;
for (char const* cur = s; cur < end; ++cur) {
int const c = *cur;
for (char const* a = accept; *a; ++a) {
if (*a == c) {
return cur;
}
}
}
return NULL
| null | 1
|
{
"advantage_score_max": 2.864621639251709,
"advantage_score_mean": 1.8719631433486938,
"advantage_score_min": 1.3782134056091309,
"advantage_score_std": 0.5852518081665039,
"advantage_scores": [
2.864621639251709,
1.7132396697998047,
1.5317778587341309,
1.3782134056091309
],
"baseline_doc_loss": 1.1215524673461914,
"baseline_truncated": false,
"doc_advantage_score": 1.4690046310424805,
"length_change_ratio": 1.1714285714285715,
"net_length_change_chars": 12,
"original_sentences_length_chars": 70,
"replacement_paraphrases_length_chars": 82,
"sentences_perturbed": 1,
"target_doc_loss": 0.7634778022766113,
"target_truncated": false,
"threshold_passing_sentences": 4,
"total_doc_length_chars": 6198,
"total_sentences": 16,
"truncated": false
}
|
/*
* Copyright (c) 2004-2011 Atheros Communications Inc.
* Copyright (c) 2011-2012 Qualcomm Atheros, Inc.
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include "core.h"
#include <linux/module.h>
#include <linux/moduleparam.h>
#include <linux/export.h>
#include <linux/vmalloc.h>
#include "debug.h"
#include "hif-ops.h"
#include "htc-ops.h"
#include "cfg80211.h"
unsigned int debug_mask;
static unsigned int suspend_mode;
static unsigned int wow_mode;
static unsigned int uart_debug;
static unsigned int uart_rate = 115200;
static unsigned int ath6kl_p2p;
static unsigned int testmode;
static unsigned int recovery_enable;
static unsigned int heart_beat_poll;
module_param(debug_mask, uint, 0644);
module_param(suspend_mode, uint, 0644);
module_param(wow_mode, uint, 0644);
module_param(uart_debug, uint, 0644);
module_param(uart_rate, uint, 0644);
module_param(ath6kl_p2p, uint, 0644);
module_param(testmode, uint, 0644);
module_param(recovery_enable, uint, 0644);
module_param(heart_beat_poll, uint, 0644);
MODULE_PARM_DESC(recovery_enable, "Enable recovery from firmware error");
MODULE_PARM_DESC(heart_beat_poll,
"Enable fw error detection periodic polling in msecs - Also set recovery_enable for this to be effective");
void ath6kl_core_tx_complete(struct ath6kl *ar, struct sk_buff *skb)
{
ath6kl_htc_tx_complete(ar, skb);
}
EXPORT_SYMBOL(ath6kl_core_tx_complete);
void ath6kl_core_rx_complete(struct ath6kl *ar, struct sk_buff *skb, u8 pipe)
{
ath6kl_htc_rx_complete(ar, skb, pipe);
}
EXPORT_SYMBOL(ath6kl_core_rx_complete);
int ath6kl_core_init(struct ath6kl *ar, enum ath6kl_htc_type htc_type)
{
struct ath6kl_bmi_target_info targ_info;
struct wireless_dev *wdev;
int ret = 0, i;
switch (htc_type) {
case ATH6KL_HTC_TYPE_MBOX:
ath6kl_htc_mbox_attach(ar);
break;
case ATH6KL_HTC_TYPE_PIPE:
ath6kl_htc_pipe_attach(ar);
break;
default:
WARN_ON(1);
return -ENOMEM;
}
ar->ath6kl_wq = create_singlethread_workqueue("ath6kl");
if (!ar->ath6kl_wq)
return -ENOMEM;
ret = ath6kl_bmi_init(ar);
if (ret)
goto err_wq;
/*
* Turn on power to get hardware (target) version and leave power
* on delibrately as we will boot the hardware anyway within few
* seconds.
*/
ret = ath6kl_hif_power_on(ar);
if (ret)
goto err_bmi_cleanup;
ret = ath6kl_bmi_get_target_info(ar, &targ_info);
if (ret)
goto err_power_off;
ar->version.target_ver = le32_to_cpu(targ_info.version);
ar->target_type = le32_to_cpu(targ_info.type);
ar->wiphy->hw_version = le32_to_cpu(targ_info.version);
ret = ath6kl_init_hw_params(ar);
if (ret)
goto err_power_off;
ar->htc_target = ath6kl_htc_create(ar);
if (!ar->htc_target) {
ret = -ENOMEM;
goto err_power_off;
}
ar->testmode = testmode;
ret = ath6kl_init_fetch_firmwares(ar);
if (ret)
goto err_htc_cleanup;
/* FIXME: we should free all firmwares in the error cases below */
/*
* Backwards compatibility support for older ar6004 firmware images
* which do not set these feature flags.
*/
if (ar->target_type == TARGET_TYPE_AR6004 &&
ar->fw_api <= 4) {
__set_bit(ATH6KL_FW_CAPABILITY_64BIT_RATES,
ar->fw_capabilities);
__set_bit(ATH6KL_FW_CAPABILITY_AP_INACTIVITY_MINS,
ar->fw_capabilities);
if (ar->hw.id == AR6004_HW_1_3_VERSION)
__set_bit(ATH6KL_FW_CAPABILITY_MAP_LP_ENDPOINT,
ar->fw_capabilities);
}
/* Indicate that WMI is enabled (although not ready yet) */
set_bit(WMI_ENABLED, &ar->flag);
ar->wmi = ath6kl_wmi_init(ar);
if (!ar->wmi) {
ath6kl_err("failed to initialize wmi\n");
ret = -EIO;
goto err_htc_cleanup;
}
ath6kl_dbg(ATH6KL_DBG_TRC, "%s: got wmi @ 0x%p.\n", __func__, ar->wmi);
/* setup access class priority mappings */
ar->ac_stream_pri_map[WMM_AC_BK] = 0; /* lowest */
ar->ac_stream_pri_map[WMM_AC_BE] = 1;
ar->ac_stream_pri_map[WMM_AC_VI] = 2;
ar->ac_stream_pri_map[WMM_AC_VO] = 3; /* highest */
/* allocate some buffers that handle larger AMSDU frames */
ath6kl_refill_amsdu_rxbufs(ar, ATH6KL_MAX_AMSDU_RX_BUFFERS);
ath6kl_cookie_init(ar);
ar->conf_flags = ATH6KL_CONF_IGNORE_ERP_BARKER |
ATH6KL_CONF_ENABLE_11N | ATH6KL_CONF_ENABLE_TX_BURST;
if (suspend_mode &&
suspend_mode >= WLAN_POWER_STATE_CUT_PWR &&
suspend_mode <= WLAN_POWER_STATE_WOW)
ar->suspend_mode = suspend_mode;
else
ar->suspend_mode = 0;
if (suspend_mode == WLAN_POWER_STATE_WOW &&
(wow_mode == WLAN_POWER_STATE_CUT_PWR ||
wow_mode == WLAN_POWER_STATE_DEEP_SLEEP))
ar->wow_suspend_mode = wow_mode;
else
ar->wow_suspend_mode = 0;
if (uart_debug)
ar->conf_flags |= ATH6KL_CONF_UART_DEBUG;
ar->hw.uarttx_rate = uart_rate;
set_bit(FIRST_BOOT, &ar->flag);
ath6kl
| null | 1
|
{
"advantage_score_max": 3.3387231826782227,
"advantage_score_mean": 2.2466540336608887,
"advantage_score_min": 1.1545850038528442,
"advantage_score_std": 1.092069149017334,
"advantage_scores": [
3.3387231826782227,
1.1545850038528442
],
"baseline_doc_loss": 1.0387145280838013,
"baseline_truncated": false,
"doc_advantage_score": 1.636993169784546,
"length_change_ratio": 1.1355932203389831,
"net_length_change_chars": 24,
"original_sentences_length_chars": 177,
"replacement_paraphrases_length_chars": 201,
"sentences_perturbed": 1,
"target_doc_loss": 0.6345258951187134,
"target_truncated": false,
"threshold_passing_sentences": 2,
"total_doc_length_chars": 5354,
"total_sentences": 6,
"truncated": false
}
|
<!--++ description-logic/Manifest642.rdf ** generated by SKB ++-->
<!--++ Created Tue Feb 25 15:57:05 2003 ++-->
<!--
Copyright World Wide Web Consortium, (Massachusetts Institute of
Technology, European Research Consortium for Informatics and
Mathematics, Keio University).
All rights reserved.
Please see the full Copyright clause at
<http://www.w3.org/Consortium/Legal/copyright-software.html>
$Id: Manifest642.rdf,v 1.5 2003/07/23 11:51:21 jcarroll Exp $
-->
<rdf:RDF xmlns:rdf='http://www.w3.org/1999/02/22-rdf-syntax-ns#'
xmlns:rdfs='http://www.w3.org/2000/01/rdf-schema#'
xmlns:rtest='http://www.w3.org/2000/10/rdf-tests/rdfcore/testSchema#'
xmlns:otest='http://www.w3.org/2002/03owlt/testOntology#'
xmlns:dc='http://purl.org/dc/elements/1.0/'
xmlns='http://www.w3.org/1999/xhtml'
xmlns:owl='http://www.w3.org/2002/07/owl#'
xml:base='http://www.w3.org/2002/03owlt/description-logic/Manifest642'
>
<otest:InconsistencyTest rdf:ID='test'>
<otest:level rdf:resource='http://www.w3.org/2002/03owlt/testOntology#Full' />
<rtest:status>APPROVED</rtest:status> <rtest:approval rdf:resource="http://lists.w3.org/Archives/Public/www-webont-wg/2003May/0271"/> <otest:size rdf:resource='http://www.w3.org/2002/03owlt/testOntology#Large'/>
<dc:creator>Sean Bechhofer</dc:creator>
<otest:issuette rdf:resource='http://www.w3.org/TR/owl-test/#dl-600-harderlite' />
<otest:level rdf:resource='http://www.w3.org/2002/03owlt/testOntology#Lite' />
<rtest:description rdf:parseType='Literal'>
DL Test: heinsohn1.2
Tbox tests from <a href="#ref-Heinsohn_et_al.">[Heinsohn et al.]</a>
Tests incoherency caused by disjoint concept
</rtest:description>
<rtest:inputDocument>
<rtest:RDF-XML-Document rdf:about='inconsistent642' >
<otest:level rdf:resource='http://www.w3.org/2002/03owlt/testOntology#Lite' />
</rtest:RDF-XML-Document>
</rtest:inputDocument>
</otest:InconsistencyTest>
</rdf:RDF>
| null | 1
|
{
"advantage_score_max": 2.9879748821258545,
"advantage_score_mean": 2.208374500274658,
"advantage_score_min": 1.428774356842041,
"advantage_score_std": 0.7796002626419067,
"advantage_scores": [
2.9879748821258545,
1.428774356842041
],
"baseline_doc_loss": 1.380787968635559,
"baseline_truncated": false,
"doc_advantage_score": 5.054042816162109,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 20,
"replacement_paraphrases_length_chars": 20,
"sentences_perturbed": 1,
"target_doc_loss": 0.27320465445518494,
"target_truncated": false,
"threshold_passing_sentences": 2,
"total_doc_length_chars": 2000,
"total_sentences": 5,
"truncated": false
}
|
//
// TRStatusBarStyle.swift
// TransitionTreasury
//
// Created by DianQK on 1/11/16.
// Copyright © 2016 TransitionTreasury. All rights reserved.
//
import UIKit
/**
TransitionTreasury Status Bar Style.
*/
public enum TRStatusBarStyle {
case `default`
@available(iOS 7.0, *)
case lightContent
case hide
func updateStatusBarStyle(_ animated: Bool = true) {
switch self {
case .default :
UIApplication.shared.setStatusBarHidden(false, with: .fade)
UIApplication.shared.setStatusBarStyle(.default, animated: animated)
case .lightContent :
UIApplication.shared.setStatusBarHidden(false, with: .fade)
UIApplication.shared.setStatusBarStyle(.lightContent, animated: animated)
case .hide :
UIApplication.shared.setStatusBarHidden(true, with: .fade)
}
}
static func convertTo(statusBarStyle: UIStatusBarStyle, statusBarHidden: Bool = UIApplication.shared.isStatusBarHidden) -> TRStatusBarStyle {
guard statusBarHidden == false else {
return .hide
}
switch statusBarStyle {
case .lightContent :
return .lightContent
case .default :
return .default
default :
fatalError("No support this status bar style")
}
}
static func currentlyTRStatusBarStyle() -> TRStatusBarStyle {
return convertTo(statusBarStyle: UIApplication.shared.statusBarStyle)
}
}
| null | 0
|
{
"advantage_score_max": 0,
"advantage_score_mean": 0,
"advantage_score_min": 0,
"advantage_score_std": 0,
"advantage_scores": [],
"baseline_doc_loss": 0.8923588991165161,
"baseline_truncated": false,
"doc_advantage_score": 1.0961178541183472,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 0,
"replacement_paraphrases_length_chars": 0,
"sentences_perturbed": 0,
"target_doc_loss": 0.8141085505485535,
"target_truncated": false,
"threshold_passing_sentences": 0,
"total_doc_length_chars": 1512,
"total_sentences": 5,
"truncated": false
}
|
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
<plist version="1.0">
<dict>
<key>IDEDidComputeMac32BitWarning</key>
<true/>
</dict>
</plist>
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
<plist version="1.0">
<array/>
</plist>
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
namespace ClassLib079
{
public class Class083
{
public static string Property => "ClassLib079";
}
}
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
<zoom>
<min>0.000000000</min>
<max>1.000000000</max>
</zoom>
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
＄01-00-01-08-4-1
[soundStopAll]
[bgm BGM_EVENT_2 0.1]
[scene 20300 0]
[charaSet A 8001000 1 マシュ]
[charaSet B 4017001 1 マリー・アントワネット]
[charaSet C 98014000 1 指揮官]
[charaSet D 9001001 1 ジャンヌ]
[charaSet E 98014000 1 兵士]
[charaSet F 1022001 1 ジル]
[charaSet G 7002001 1 ランスロット]
[charaSet H 6012001 1 サンソン]
[charaFace G 4]
[charaFadein G 0 1]
[fadein black 1]
[wait fade]
＠ランスロット
……Ａ……アー……サー……。
[k]
[charaFadeout G 0]
[charaTalk D]
[charaFadein G 0.1 0]
[charaFace D 4]
[charaFadein D 0.1 2]
＠ジャンヌ
アーサー？[r]……それは、貴方の王アーサーのことですか？
[k]
＠ジャンヌ
[line 2]残念ですが、私はジャンヌ・ダルク。[r]貴方が求めた王、アーサーではありません。
[k]
[charaFadeout G 0.1]
[charaFadeout D 0.1]
[charaFace A 12]
[charaFadein A 0.1 1]
＠マシュ
……。[r]ああ、そうか。
[k]
？1：何？
？2：どうしたの？
？！
＠マシュ
ランスロットがジャンヌさんに[#拘:こだわ]った理由が分かりました。[r]ジャンヌさんは、アーサー王に似ているんですね。
[k]
[charaFace A 13]
＠マシュ
顔形ではなく、魂が[line 2]。
[k]
[charaFadeout A 0.1]
[charaFace G 4]
[charaFadein G 0.1 1]
＠ランスロット
王……よ……私は……どうか……。
[k]
[messageOff]
[charaSpecialEffect G flashErasure 1 3]
[wt 1]
[se ba5]
[wait charaSpecialEffect G]
[charaFace D 4]
[charaFadein D 0.1 1]
＠ジャンヌ
……。
[k]
[charaFadeout D 0.1]
[charaTalk A]
[charaFadein D 0.1 0]
[charaFace A 0]
[charaFadein A 0.1 2]
＠マシュ
ジャンヌさん、行きましょう。
[k]
[charaFace D 0]
＠ジャンヌ
はい！
[k]
[charaFadeout A 0.1]
[charaFadeout D 0.1]
[charaFace F 2]
[charaFadein F 0.1 1]
＠ジル
ジャンヌ！[r]お待ちを！ 貴女は確かにジャンヌ・ダルク！
[k]
[charaFace F 1]
＠ジル
“竜の魔女”ではない、[r]正真正銘の聖女……！
[k]
[charaFadeout F 0.1]
[charaFace B 4]
[charaFadein B 0.1 2]
[charaFace D 4]
[charaFadein D 0.1 0]
＠ジャンヌ
……。
[k]
＠マリー・アントワネット
……返答しなくていいのですか？
[k]
＠ジャンヌ
私が返答すれば、ジルの立場が危うくなります。[r]現状、彼らに頼ることもないでしょう。
[k]
＠ジャンヌ
何より、かつて共に戦った人々に憎まれるのは[r]さすがに堪えますから。
[k]
＠マリー・アントワネット
でも……本当に彼らは、憎んでいるのでしょうか。
[k]
[charaFace D 0]
＠ジャンヌ
[line 2]行きましょう。
[k]
[charaFadeout D 0.4]
[charaFadeout B 0.4]
[wt 0.3]
[charaFace F 0]
[charaFadein F 0.1 2]
[charaFace C 0]
[charaFadein C 0.1 0]
＠指揮官
元帥。[r]今のは一体……。
[k]
[charaFace F 4]
＠ジル
わからん。[r]わからんが……もう一度“竜の魔女”について調べ直せ。
[k]
＠ジル
シャルル七世を討ったのが、本当にジャンヌ・ダルク[r]だったのか。悪質な偽物なのか。
[k]
[charaFace F 0]
＠ジル
あるいは……ジャンヌ・ダルクはこの世界に[r]二人存在するのか。
[k]
[messageOff]
[fadeout black 0.5]
[bgmStop BGM_EVENT_2 0.4]
[wait fade]
[soundStopAll]
[end]
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
<!doctype html>
<html lang="en">
<head>
<meta charset="UTF-8">
<title>Example - example-example40-jquery</title>
<script src="../../components/jquery-2.1.1/jquery.js"></script>
<script src="../../../angular.js"></script>
<script src="script.js"></script>
</head>
<body >
<div ng-app="myApp">
<div>
{{ 'World' | greet }}
</div>
</div>
</body>
</html>
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
#!/usr/bin/python
# -*- coding: utf-8 -*-
fakeIpList = [
# https://zh.wikipedia.org/wiki/%E5%9F%9F%E5%90%8D%E6%9C%8D%E5%8A%A1%E5%99%A8%E7%BC%93%E5%AD%98%E6%B1%A1%E6%9F%93
'4.36.66.178',
'8.7.198.45',
'23.89.5.60',
'37.61.54.158',
'46.82.174.68',
'49.2.123.56',
'54.76.135.1',
'59.24.3.173',
'64.33.88.161',
'64.33.99.47',
'64.66.163.251',
'65.104.202.252',
'65.160.219.113',
'66.45.252.237',
'72.14.205.99',
'72.14.205.104',
'77.4.7.92',
'78.16.49.15',
'93.46.8.89',
'118.5.49.6',
'128.121.126.139',
'159.106.121.75',
'169.132.13.103',
'188.5.4.96',
'189.163.17.5',
'192.67.198.6',
'197.4.4.12',
'202.106.1.2',
'202.181.7.85',
'203.98.7.65',
'203.161.230.171',
'207.12.88.98',
'208.56.31.43',
'209.36.73.33',
'209.145.54.50',
'209.220.30.174',
'211.94.66.147',
'213.169.251.35',
'216.221.188.182',
'216.234.179.13',
'243.185.187.39',
'249.129.46.48',
'253.157.14.165',
'74.125.31.113',
'74.125.39.102',
'74.125.39.113',
'74.125.127.102',
'74.125.130.47',
'74.125.155.102',
'209.85.229.138',
'210.242.125.20',
'0.0.0.0',
'2.1.1.2',
'4.193.80.0',
'8.105.84.0',
'12.87.133.0',
'16.63.155.0',
'20.139.56.0',
'24.51.184.0',
'28.121.126.139',
'28.13.216.0',
'46.20.126.252',
'46.38.24.209',
'61.54.28.6',
'66.206.11.194',
'74.117.57.138',
'89.31.55.106',
'113.11.194.190',
'122.218.101.190',
'123.50.49.171',
'123.126.249.238',
'125.230.148.48',
'127.0.0.2',
'173.201.216.6',
'203.199.57.81',
'208.109.138.55',
'211.5.133.18',
'211.8.69.27',
'213.186.33.5',
'216.139.213.144',
'221.8.69.27',
'243.185.187.3',
'243.185.187.30'
]
def ip2int(ipstr):
intlist = ipstr.split('.')
ret = 0
for i in range(4):
ret = ret * 256 + int(intlist[i])
return ret
def final_list():
fileobj = open("data/cn_ip_range.txt", "r")
content = ''
if fileobj:
list_result = []
lines_list = [line.rstrip('\n').split(' ') for line in fileobj]
#list_result = [ "0x%x:%s," % (int(line[0]),int(line[1])) for line in lines_list ]
#'''
list_result.append('{')
start_num = 0
comma = ''
for line in lines_list:
while (int(line[0]) >> 24) > start_num:
start_num += 1
list_result.append('},{')
comma = ''
list_result.append("%s0x%x:%s" % ( comma, int(line[0])/256, int(line[1])/256 ))
comma = ','
list_result.append('}')
#'''
content = ''.join(list_result)
content = '[\n' + content + "\n]"
return content
def center_list():
fileobj = open("data/cn_ip_range.txt", "r")
master_net = set()
content = ''
if fileobj:
list_result = []
lines_list = [line.rstrip('\n').split(' ') for line in fileobj]
for line in lines_list:
if int(line[1]) < (1 << 14):
master_net.add( int(int(line[0]) >> 14) )
master_net = list(master_net)
master_net.sort()
list_result = ['0x%x:1,' % s for s in master_net]
content = ''.join(list_result)
content = '{\n' + content[:-1] + "\n}"
return content
def fake_list():
content = ''
list_result = [ "0x%x," % int(ip2int(ip)) for ip in fakeIpList ]
content = ''.join(list_result)
content = '[\n' + content[:-1] + "\n]"
return content
def main():
print center_list()
if __name__ == '__main__':
main()
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
/*
* Copyright 2019 Qameta Software OÜ
*
* 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 io.qameta.allure.test;
import io.qameta.allure.Feature;
import java.lang.annotation.Documented;
import java.lang.annotation.ElementType;
import java.lang.annotation.Inherited;
import java.lang.annotation.Retention;
import java.lang.annotation.RetentionPolicy;
import java.lang.annotation.Target;
/**
* @author charlie (Dmitry Baev).
*/
@SuppressWarnings({"JavadocType", "PMD.MissingStaticMethodInNonInstantiatableClass"})
@Target({})
public @interface AllureFeatures {
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Basic framework support")
@interface Base {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Parallel test execution support")
@interface Parallel {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Full name")
@interface FullName {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Display name")
@interface DisplayName {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Descriptions")
@interface Descriptions {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Timings")
@interface Timings {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Steps")
@interface Steps {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Attachments")
@interface Attachments {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Parameters")
@interface Parameters {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Fixtures")
@interface Fixtures {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Links")
@interface Links {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Marker annotations")
@interface MarkerAnnotations {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Failed tests")
@interface FailedTests {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Broken tests")
@interface BrokenTests {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Passed tests")
@interface PassedTests {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Skipped tests")
@interface SkippedTests {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Ignored tests")
@interface IgnoredTests {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Not implemented tests")
@interface NotImplementedTests {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("History")
@interface History {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Retries")
@interface Retries {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Stages")
@interface Stages {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Trees")
@interface Trees {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Timeline")
@interface Timeline {
}
@Documented
@Inherited
@Retention(RetentionPolicy.RUNTIME)
@Target({ElementType.METHOD, ElementType.TYPE})
@Feature("Timeline")
@interface Severity {
}
}
| null | 1
|
{
"advantage_score_max": 2.8057873249053955,
"advantage_score_mean": 2.763118267059326,
"advantage_score_min": 2.720449209213257,
"advantage_score_std": 0.042669057846069336,
"advantage_scores": [
2.8057873249053955,
2.720449209213257
],
"baseline_doc_loss": 0.26336511969566345,
"baseline_truncated": false,
"doc_advantage_score": 1.2422055006027222,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 318,
"replacement_paraphrases_length_chars": 318,
"sentences_perturbed": 1,
"target_doc_loss": 0.21201413869857788,
"target_truncated": false,
"threshold_passing_sentences": 2,
"total_doc_length_chars": 5554,
"total_sentences": 5,
"truncated": false
}
|
import React from "react";
import { mount } from "enzyme";
import { TileWait } from "../tile_wait";
import { fakeSequence } from "../../../__test_support__/fake_state/resources";
import { emptyState } from "../../../resources/reducer";
import { StepParams } from "../../interfaces";
describe("<TileWait/>", () => {
const fakeProps = (): StepParams => ({
currentSequence: fakeSequence(),
currentStep: {
kind: "wait",
args: {
milliseconds: 100
}
},
dispatch: jest.fn(),
index: 0,
resources: emptyState().index,
});
it("renders inputs", () => {
const block = mount(<TileWait {...fakeProps()} />);
const inputs = block.find("input");
const labels = block.find("label");
expect(inputs.length).toEqual(2);
expect(labels.length).toEqual(1);
expect(inputs.first().props().placeholder).toEqual("Wait");
expect(labels.at(0).text()).toEqual("Time in milliseconds");
expect(inputs.at(1).props().value).toEqual(100);
});
});
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
# -*- Mode: Python -*-
from scan_utxo import gen_utxo
from caesure.script import parse_script, pprint_script, ScriptError
from caesure._script import ScriptError
from caesure.bitcoin import bcrepr
def frob (name):
return name[::-1].encode ('hex')
n = 0
for txname, outputs in gen_utxo():
for (index, amt, script) in outputs:
try:
script = parse_script (script)
except ScriptError:
print frob(txname), index, bcrepr (amt), script.encode ('hex'), repr(script)
n += 1
print 'scanned %d scripts' % (n,)
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
<?php
namespace Illuminate\Database;
use Illuminate\Support\Arr;
use InvalidArgumentException;
use Illuminate\Console\Command;
use Illuminate\Container\Container;
abstract class Seeder
{
/**
* The container instance.
The application container instance. This is used to resolve dependencies for seeders.
*
* @var \Illuminate\Console\Command
*/
protected $command;
/**
* Seed the given connection from the given path.
*
* @param array|string $class
* @param bool $silent
* @return $this
*/
public function call($class, $silent = false)
{
$classes = Arr::wrap($class);
foreach ($classes as $class) {
$seeder = $this->resolve($class);
if ($silent === false && isset($this->command)) {
$this->command->getOutput()->writeln('<info>Seeding:</info> '.get_class($seeder));
}
$seeder->__invoke();
}
return $this;
}
/**
* Silently seed the given connection from the given path.
*
* @param array|string $class
* @return void
*/
public function callSilent($class)
{
$this->call($class, true);
}
/**
* Resolve an instance of the given seeder class.
*
* @param string $class
* @return \Illuminate\Database\Seeder
*/
protected function resolve($class)
{
if (isset($this->container)) {
$instance = $this->container->make($class);
$instance->setContainer($this->container);
} else {
$instance = new $class;
}
if (isset($this->command)) {
$instance->setCommand($this->command);
}
return $instance;
}
/**
* Set the IoC container instance.
*
* @param \Illuminate\Container\Container $container
* @return $this
*/
public function setContainer(Container $container)
{
$this->container = $container;
return $this;
}
/**
* Set the console command instance.
*
* @param \Illuminate\Console\Command $command
* @return $this
*/
public function setCommand(Command $command)
{
$this->command = $command;
return $this;
}
/**
* Run the database seeds.
*
* @return mixed
*
* @throws \InvalidArgumentException
*/
public function __invoke()
{
if (! method_exists($this, 'run')) {
throw new InvalidArgumentException('Method [run] missing from '.get_class($this));
}
return isset($this->container)
? $this->container->call([$this, 'run'])
: $this->run();
}
}
| null | 1
|
{
"advantage_score_max": 9.782247543334961,
"advantage_score_mean": 6.688356876373291,
"advantage_score_min": 3.594466209411621,
"advantage_score_std": 3.09389066696167,
"advantage_scores": [
9.782247543334961,
3.594466209411621
],
"baseline_doc_loss": 0.4239032566547394,
"baseline_truncated": false,
"doc_advantage_score": 1.045652151107788,
"length_change_ratio": 0.68,
"net_length_change_chars": -40,
"original_sentences_length_chars": 125,
"replacement_paraphrases_length_chars": 85,
"sentences_perturbed": 1,
"target_doc_loss": 0.405396044254303,
"target_truncated": false,
"threshold_passing_sentences": 2,
"total_doc_length_chars": 2789,
"total_sentences": 11,
"truncated": false
}
|
---
layout: api
title: "v3.3.0 JavaScript Library: L.Browser"
categories: api
version: v3.3.0
permalink: /api/v3.3.0/l-browser/
---
<h2 id="browser">Browser</h2>
<p>A namespace with properties for browser/feature detection used by Leaflet internally.</p>
<pre><code>if (L.Browser.ie6) {
alert('Upgrade your browser, dude!');
}</code></pre>
<table data-id='browser'>
<tr>
<th class="width100">property</th>
<th class="width100">type</th>
<th>description</th>
</tr>
<tr>
<td><code><b>ie</b></code></td>
<td><code>Boolean</code></td>
<td><code><span class="literal">true</span></code> for all Internet Explorer versions.</td>
</tr>
<tr>
<td><code><b>ie6</b></code></td>
<td><code>Boolean</code></td>
<td><code><span class="literal">true</span></code> for Internet Explorer 6.</td>
</tr>
<tr>
<td><code><b>ie7</b></code></td>
<td><code>Boolean</code></td>
<td><code><span class="literal">true</span></code> for Internet Explorer 7.</td>
</tr>
<tr>
<td><code><b>webkit</b></code></td>
<td><code>Boolean</code></td>
<td><code><span class="literal">true</span></code> for webkit-based browsers like Chrome and Safari (including mobile versions).</td>
</tr>
<tr>
<td><code><b>webkit3d</b></code></td>
<td><code>Boolean</code></td>
<td><code><span class="literal">true</span></code> for webkit-based browsers that support CSS 3D transformations.</td>
</tr>
<!--<tr>
<td><code><b>gecko</b></code></td>
<td><code>Boolean</code></td>
<td><code><span class="literal">true</span></code> for Gecko-based browsers like Firefox and Mozilla.</td>
</tr>
<tr>
<td><code><b>opera</b></code></td>
<td><code>Boolean</code></td>
<td><code><span class="literal">true</span></code> for Opera.</td>
</tr>-->
<tr>
<td><code><b>android</b></code></td>
<td><code>Boolean</code></td>
<td><code><span class="literal">true</span></code> for Android mobile browser.</td>
</tr>
<tr>
<td><code><b>android23</b></code></td>
<td><code>Boolean</code></td>
<td><code><span class="literal">true</span></code> for old Android stock browsers (2 and 3).</td>
</tr>
<tr>
<td><code><b>mobile</b></code></td>
<td><code>Boolean</code></td>
<td><code><span class="literal">true</span></code> for modern mobile browsers (including iOS Safari and different Android browsers).</td>
</tr>
<tr>
<td><code><b>mobileWebkit</b></code></td>
<td><code>Boolean</code></td>
<td><code><span class="literal">true</span></code> for mobile webkit-based browsers.</td>
</tr>
<tr>
<td><code><b>mobileOpera</b></code></td>
<td><code>Boolean</code></td>
<td><code><span class="literal">true</span></code> for mobile Opera.</td>
</tr>
<tr>
<td><code><b>touch</b></code></td>
<td><code>Boolean</code></td>
<td><code><span class="literal">true</span></code> for all browsers on touch devices.</td>
</tr>
<tr>
<td><code><b>msTouch</b></code></td>
<td><code>Boolean</code></td>
<td><code><span class="literal">true</span></code> for browsers with Microsoft touch model (e.g. IE10).</td>
</tr>
<tr>
<td><code><b>retina</b></code></td>
<td><code>Boolean</code></td>
<td><code><span class="literal">true</span></code> for devices with Retina screens.</td>
</tr>
</table>
| null | 0
|
{
"advantage_score_max": 0,
"advantage_score_mean": 0,
"advantage_score_min": 0,
"advantage_score_std": 0,
"advantage_scores": [],
"baseline_doc_loss": 0.5354939699172974,
"baseline_truncated": false,
"doc_advantage_score": 1.8643252849578857,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 0,
"replacement_paraphrases_length_chars": 0,
"sentences_perturbed": 0,
"target_doc_loss": 0.28723204135894775,
"target_truncated": false,
"threshold_passing_sentences": 0,
"total_doc_length_chars": 3223,
"total_sentences": 3,
"truncated": false
}
|
媈
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
---
layout: default
title: Level 18
cat: level
lang: en
number: 18
---
<p id="goal"><b>Goal:</b> Given a point A, a line, and a point B. Construct a circle that passes through A and is tangent to the line at B.
</p>
<p id="winningimg">
<img src="/img/Level{{page.number}}.png"/ >
</p>
<div id="hidden" style="display: none">
<p id="level">
Go to <a href="/Level19/">Level 19</a>.
</p>
</div>
<script type="text/javascript">
{% include parameters480p.js %}
parameters.customToolBar = "501 | 5 | 15 | 18 | 10 | 100001 | 100002 | 9 | 4 | 3 | 100003 | 53";
parameters.ggbBase64 = "{% base64 ggb/Level18.ggb %}" ;
</script>
<div id="applet_container">
</div>
<script type="text/javascript">
{% include testobjects.js %}
checkobject("target1");
LevelCompleted(drawn("target1"),4);
}
</script>
| null | 0
|
{
"advantage_score_max": 0,
"advantage_score_mean": 0,
"advantage_score_min": 0,
"advantage_score_std": 0,
"advantage_scores": [],
"baseline_doc_loss": 2.3801333904266357,
"baseline_truncated": false,
"doc_advantage_score": 1.0271586179733276,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 0,
"replacement_paraphrases_length_chars": 0,
"sentences_perturbed": 0,
"target_doc_loss": 2.3172013759613037,
"target_truncated": false,
"threshold_passing_sentences": 0,
"total_doc_length_chars": 802,
"total_sentences": 3,
"truncated": false
}
|
export const meta = {
title: 'Prisma Admin',
position: 161
}
## Overview
Prisma Admin is currently in [Preview](oje2#preview-vs-final). You can find its announcement blog post [here](https://www.prisma.io/blog/prisma-admin-beta-pai5lah43soe/). We're looking for feedback, please share your ideas how to improve Prisma Admin [here](https://github.com/prisma/prisma-admin-feedback).
| null | 0
|
{
"advantage_score_max": 0,
"advantage_score_mean": 0,
"advantage_score_min": 0,
"advantage_score_std": 0,
"advantage_scores": [],
"baseline_doc_loss": 2.5986177921295166,
"baseline_truncated": false,
"doc_advantage_score": 1.298941969871521,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 0,
"replacement_paraphrases_length_chars": 0,
"sentences_perturbed": 0,
"target_doc_loss": 2.0005650520324707,
"target_truncated": false,
"threshold_passing_sentences": 0,
"total_doc_length_chars": 386,
"total_sentences": 3,
"truncated": false
}
|
<?php //[STAMP] a1362517a50ae530a4dd5bd96b2b52cf
namespace _generated;
// This class was automatically generated by build task
// You should not change it manually as it will be overwritten on next build
// @codingStandardsIgnoreFile
trait FunctionalTesterActions
{
/**
* @return \Codeception\Scenario
*/
abstract protected function getScenario();
}
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
package varargs;
public class Parent {
public String concatenate(String... strings) {
StringBuilder builder = new StringBuilder();
for (String s : strings) {
builder.append(s);
}
return builder.toString();
}
}
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
/*
* TI OMAP L4 interconnect emulation.
This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the impimplied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Pub.lic License along
* with this program; if not, see <http://www.gnu.org/licenses/>.
*/
#include "hw.h"
#include "omap.h"
#ifdef L4_MUX_HACK
static int omap_l4_io_entries;
static int omap_cpu_io_entry;
static struct omap_l4_entry {
CPUReadMemoryFunc * const *mem_read;
CPUWriteMemoryFunc * const *mem_write;
void *opaque;
} *omap_l4_io_entry;
static CPUReadMemoryFunc * const *omap_l4_io_readb_fn;
static CPUReadMemoryFunc * const *omap_l4_io_readh_fn;
static CPUReadMemoryFunc * const *omap_l4_io_readw_fn;
static CPUWriteMemoryFunc * const *omap_l4_io_writeb_fn;
static CPUWriteMemoryFunc * const *omap_l4_io_writeh_fn;
static CPUWriteMemoryFunc * const *omap_l4_io_writew_fn;
static void **omap_l4_io_opaque;
int l4_register_io_memory(CPUReadMemoryFunc * const *mem_read,
CPUWriteMemoryFunc * const *mem_write, void *opaque)
{
omap_l4_io_entry[omap_l4_io_entries].mem_read = mem_read;
omap_l4_io_entry[omap_l4_io_entries].mem_write = mem_write;
omap_l4_io_entry[omap_l4_io_entries].opaque = opaque;
return omap_l4_io_entries ++;
}
static uint32_t omap_l4_io_readb(void *opaque, target_phys_addr_t addr)
{
unsigned int i = (addr - OMAP2_L4_BASE) >> TARGET_PAGE_BITS;
return omap_l4_io_readb_fn[i](omap_l4_io_opaque[i], addr);
}
static uint32_t omap_l4_io_readh(void *opaque, target_phys_addr_t addr)
{
unsigned int i = (addr - OMAP2_L4_BASE) >> TARGET_PAGE_BITS;
return omap_l4_io_readh_fn[i](omap_l4_io_opaque[i], addr);
}
static uint32_t omap_l4_io_readw(void *opaque, target_phys_addr_t addr)
{
unsigned int i = (addr - OMAP2_L4_BASE) >> TARGET_PAGE_BITS;
return omap_l4_io_readw_fn[i](omap_l4_io_opaque[i], addr);
}
static void omap_l4_io_writeb(void *opaque, target_phys_addr_t addr,
uint32_t value)
{
unsigned int i = (addr - OMAP2_L4_BASE) >> TARGET_PAGE_BITS;
return omap_l4_io_writeb_fn[i](omap_l4_io_opaque[i], addr, value);
}
static void omap_l4_io_writeh(void *opaque, target_phys_addr_t addr,
uint32_t value)
{
unsigned int i = (addr - OMAP2_L4_BASE) >> TARGET_PAGE_BITS;
return omap_l4_io_writeh_fn[i](omap_l4_io_opaque[i], addr, value);
}
static void omap_l4_io_writew(void *opaque, target_phys_addr_t addr,
uint32_t value)
{
unsigned int i = (addr - OMAP2_L4_BASE) >> TARGET_PAGE_BITS;
return omap_l4_io_writew_fn[i](omap_l4_io_opaque[i], addr, value);
}
static CPUReadMemoryFunc * const omap_l4_io_readfn[] = {
omap_l4_io_readb,
omap_l4_io_readh,
omap_l4_io_readw,
};
static CPUWriteMemoryFunc * const omap_l4_io_writefn[] = {
omap_l4_io_writeb,
omap_l4_io_writeh,
omap_l4_io_writew,
};
#else
int l4_register_io_memory(CPUReadMemoryFunc * const *mem_read,
CPUWriteMemoryFunc * const *mem_write,
void *opaque)
{
return cpu_register_io_memory(mem_read, mem_write, opaque,
DEVICE_NATIVE_ENDIAN);
}
#endif
struct omap_l4_s {
target_phys_addr_t base;
int ta_num;
struct omap_target_agent_s ta[0];
};
struct omap_l4_s *omap_l4_init(target_phys_addr_t base, int ta_num)
{
struct omap_l4_s *bus = g_malloc0(
sizeof(*bus) + ta_num * sizeof(*bus->ta));
bus->ta_num = ta_num;
bus->base = base;
#ifdef L4_MUX_HACK
omap_l4_io_entries = 1;
omap_l4_io_entry = g_malloc0(125 * sizeof(*omap_l4_io_entry));
omap_cpu_io_entry =
cpu_register_io_memory(omap_l4_io_readfn,
omap_l4_io_writefn, bus, DEVICE_NATIVE_ENDIAN);
# define L4_PAGES (0xb4000 / TARGET_PAGE_SIZE)
omap_l4_io_readb_fn = g_malloc0(sizeof(void *) * L4_PAGES);
omap_l4_io_readh_fn = g_malloc0(sizeof(void *) * L4_PAGES);
omap_l4_io_readw_fn = g_malloc0(sizeof(void *) * L4_PAGES);
omap_l4_io_writeb_fn = g_malloc0(sizeof(void *) * L4_PAGES);
omap_l4_io_writeh_fn = g_malloc0(sizeof(void *) * L4_PAGES);
omap_l4_io_writew_fn = g_malloc0(sizeof(void *) * L4_PAGES);
omap_l4_io_opaque = g_malloc0(sizeof(void *) * L4_PAGES);
#endif
return bus;
}
target_phys_addr_t omap_l4_region_base(struct omap_target_agent_s *ta,
int region)
{
return ta->bus->base + ta->start[region].offset;
}
static uint32_t omap_l4ta_read(void *opaque, target_phys_addr_t addr)
{
struct omap_target_agent_s *s = (struct omap_target_agent_s *) opaque;
switch (addr) {
case 0x00: /* COMPONENT */
return s->
| null | 2
|
{
"advantage_score_max": 5.622899055480957,
"advantage_score_mean": 5.454079627990723,
"advantage_score_min": 5.2852606773376465,
"advantage_score_std": 0.16881918907165527,
"advantage_scores": [
5.622899055480957,
5.2852606773376465
],
"baseline_doc_loss": 0.5468319058418274,
"baseline_truncated": false,
"doc_advantage_score": 1.5993770360946655,
"length_change_ratio": 0.7678244972577697,
"net_length_change_chars": -127,
"original_sentences_length_chars": 547,
"replacement_paraphrases_length_chars": 420,
"sentences_perturbed": 2,
"target_doc_loss": 0.34190306067466736,
"target_truncated": false,
"threshold_passing_sentences": 2,
"total_doc_length_chars": 5231,
"total_sentences": 6,
"truncated": false
}
|
% Copyright (C) 1996 Aladdin Enterprises. All rights reserved.
%
% This file is part of Aladdin Ghostscript.
%
% Aladdin Ghostscript is distributed with NO WARRANTY OF ANY KIND. No author
% or distributor accepts any responsibility for the consequences of using it,
% or for whether it serves any particular purpose or works at all, unless he
% or she says so in writing. Refer to the Aladdin Ghostscript Free Public
% License (the "License") for full details.
%
% Every copy of Aladdin Ghostscript must include a copy of the License,
% normally in a plain ASCII text file named PUBLIC. The License grants you
% the right to copy, modify and redistribute Aladdin Ghostscript, but only
% under certain conditions described in the License. Among other things, the
% License requires that the copyright notice and this notice be preserved on
% all copies.
% Fontmap - standard font catalog for Ghostscript.
% ----------------------------------------------------------------
% This file is a catalog of fonts known to Ghostscript. Any font
% that is to be loaded automatically when named must be in this catalog,
% except for fonts that Ghostscript finds automatically in directories
% named in the GS_FONTPATH environment variable.
% Each font has an entry consisting of three items:
%
% - The name by which the font is known inside Ghostscript
% (a Ghostscript name preceded by a `/', or a string enclosed
% in parentheses). This is used to find the file from which
% a font of a given name should be loaded.
%
% - Information depending on whether this is a real font or a
% font alias:
%
% - For real fonts, the name of the Ghostscript font
% file (a Ghostscript string, enclosed in parentheses).
% The filename should include the extension, which (by
% convention) is `.gsf'. `.pfa' and `.pfb' files are
% also usable as fonts for Ghostscript.
%
% - For font aliases, the name of the font which should
% be used when this one is requested, preceded by a
% `/'. See the entry for Charter below for an example.
% Note that an alias name cannot be enclosed in parentheses.
%
% - At least one space or tab, and a terminating semicolon.
% Because of limitations in the MS-DOS environment, Ghostscript font
% file names must be no more than 8 characters long, must consist only
% of LOWER CASE letters, digits, and underscores, and must start with a
% letter. Font names, on the other hand, need only obey the syntax of
% names in the Ghostscript language, which is much more liberal.
% The following table is actually a Ghostscript data structure.
% If you add new entries, be sure to copy the punctuation accurately;
% in particular, you must leave at least one space or tab between each
% field in the entry. Also, please read fonts.doc for important information
% about font names.
% Note that .pfa and .pfb fonts are compatible with Adobe Type Manager
% and other programs that don't include full PostScript interpreters,
% as well as with PostScript interpreters; .gsf fonts are compatible with
% PostScript interpreters, but not with ATM or similar programs.
%
%
% Fonts contributed by:
% URW++ Design and Development Incorporated
% Poppenbuetteler Bogen 29A
% D-22399 Hamburg
% Germany
% tel. +49 (40) 60 60 50
% fax +49 (40) 60 60 51 11
% http://www.urwpp.de
% for distribution under the GNU License and Aladdin Free Public License.
% See the notice at the head of this Fontmap file for licensing terms.
% Each of these fonts is individually covered by the license:
% for licensing purposes, they are not "part of" any larger entity.
% The following notice applies to these fonts:
%
% Copyright URW Software, Copyright 1994 by URW.
%
% Actual fonts
/URWBookmanL-DemiBold (b018015l.pfb) ;
/URWBookmanL-DemiBoldItal (b018035l.pfb) ;
/URWBookmanL-Ligh (b018012l.pfb) ;
/URWBookmanL-LighItal (b018032l.pfb) ;
/NimbusMonL-Regu (n022003l.pfb) ;
/NimbusMonL-ReguObli (n022023l.pfb) ;
/NimbusMonL-Bold (n022004l.pfb) ;
/NimbusMonL-BoldObli (n022024l.pfb) ;
/URWGothicL-Book (a010013l.pfb) ;
/URWGothicL-BookObli (a010033l.pfb) ;
/URWGothicL-Demi (a010015l.pfb) ;
/URWGothicL-DemiObli (a010035l.pfb) ;
/NimbusSanL-Regu (n019003l.pfb) ;
/NimbusSanL-ReguItal (n019023l.pfb) ;
/NimbusSanL-Bold (n019004l.pfb) ;
/NimbusSanL-BoldItal (n019024l.pfb) ;
/NimbusSanL-ReguCond (n019043l.pfb) ;
/NimbusSanL-ReguCondItal (n019063l.pfb) ;
/NimbusSanL-BoldCond (n019044l.pfb) ;
/NimbusSanL-BoldCondItal (n019064l.pfb) ;
/URWPalladioL-Roma (p052003l.pfb) ;
/URWPalladioL-Ital (p052023l.pfb) ;
/URWPalladioL-Bold (p052004l.pfb) ;
/URWPalladioL-BoldItal (p052024l.pfb) ;
/CenturySchL-Roma (c059013l.pfb) ;
/CenturySchL-Ital (c059033l.pfb) ;
/CenturySchL-Bold (c059016l.pfb) ;
/CenturySchL-BoldItal (c059036l.pfb) ;
/NimbusRomNo9L-Regu (n021003l.pfb) ;
/NimbusRomNo9L-ReguItal (n021023l.pfb) ;
/NimbusRomNo9L-Medi (n021004l.pfb) ;
/NimbusRomNo9L-MediItal (n021024l.pfb) ;
/StandardSymL (s050000l.pfb) ;
/URWChanceryL-MediItal (z003034l.pfb) ;
/Dingbats (d050000l.pfb) ;
% Aliases
/Bookman-Demi /URWBookmanL-DemiBold ;
/Bookman-DemiItalic /URWBookmanL-DemiBoldItal ;
/Bookman-Light /URWBookmanL-Ligh ;
/Bookman-LightItalic /URWBookmanL-LighItal ;
/Courier /NimbusMonL-Regu ;
/Courier-Oblique /NimbusMonL-ReguObli ;
/Courier-Bold /NimbusMonL-Bold ;
/Courier-BoldOblique /NimbusMonL-BoldObli ;
/AvantGarde-Book /URWGothicL-Book ;
/AvantGarde-BookOblique /URWGothicL-BookObli ;
/AvantGarde-Demi /URWGothicL-
| null | 1
|
{
"advantage_score_max": 6.4064788818359375,
"advantage_score_mean": 2.5483438968658447,
"advantage_score_min": 1.1706300973892212,
"advantage_score_std": 1.760131597518921,
"advantage_scores": [
6.4064788818359375,
3.607285261154175,
2.2994565963745117,
1.6974759101867676,
1.428605556488037,
1.2284761667251587,
1.1706300973892212
],
"baseline_doc_loss": 1.0091972351074219,
"baseline_truncated": false,
"doc_advantage_score": 1.0952686071395874,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 20,
"replacement_paraphrases_length_chars": 20,
"sentences_perturbed": 1,
"target_doc_loss": 0.9214152693748474,
"target_truncated": false,
"threshold_passing_sentences": 7,
"total_doc_length_chars": 5443,
"total_sentences": 33,
"truncated": false
}
|
config TI_SOC_THERMAL
tristate "Texas Instruments SoCs temperature sensor driver"
help
If you say yes here you get support for the Texas Instruments
OMAP4460+ on die bandgap temperature sensor support. The register
set is part of system control module.
This includes alert interrupts generation and also the TSHUT
support.
config TI_THERMAL
bool "Texas Instruments SoCs thermal framework support"
depends on TI_SOC_THERMAL
help
If you say yes here you want to get support for generic thermal
framework for the Texas Instruments on die bandgap temperature sensor.
This includes trip points definitions, extrapolation rules and
CPU cooling device bindings.
config OMAP3_THERMAL
bool "Texas Instruments OMAP3 thermal support"
depends on TI_SOC_THERMAL
depends on ARCH_OMAP3 || COMPILE_TEST
help
If you say yes here you get thermal support for the Texas Instruments
OMAP3 SoC family. The current chips supported are:
- OMAP3430
OMAP3 chips normally don't need thermal management, and sensors in
this generation are not accurate, nor they are very close to
the important hotspots.
Say 'N' here.
If you say yes here you get thermal support for the Texas Instruments OMAP4 SoC family. The currently supported chips are:
- OMAP4430
- OMAP4460
- OMAP4470
This includes alert interrupt generation and TSHUT support. The current chip supported are:
- OMAP4430
- OMAP4460
- OMAP4470
This includes alert interrupts generation and also the TSHUT
support.
config OMAP5_THERMAL
bool "Texas Instruments OMAP5 thermal support"
depends on TI_SOC_THERMAL
depends on SOC_OMAP5 || COMPILE_TEST
help
If you say yes here you get thermal support for the Texas Instruments
OMAP5 SoC family. The current chip supported are:
- OMAP5430
This includes alert interrupts generation and also the TSHUT
support.
config DRA752_THERMAL
bool "Texas Instruments DRA752 thermal support"
depends on TI_SOC_THERMAL
depends on SOC_DRA7XX || COMPILE_TEST
help
If you say yes here you get thermal support for the Texas Instruments
DRA752 SoC family. The current chip supported are:
- DRA752
This includes alert interrupts generation and also the TSHUT
support.
| null | 1
|
{
"advantage_score_max": 4.817577838897705,
"advantage_score_mean": 2.6449782848358154,
"advantage_score_min": 1.4457051753997803,
"advantage_score_std": 1.3680733442306519,
"advantage_scores": [
4.817577838897705,
2.8119091987609863,
1.5047203302383423,
1.4457051753997803
],
"baseline_doc_loss": 1.0175747871398926,
"baseline_truncated": false,
"doc_advantage_score": 1.1914455890655518,
"length_change_ratio": 0.9358974358974359,
"net_length_change_chars": -15,
"original_sentences_length_chars": 234,
"replacement_paraphrases_length_chars": 219,
"sentences_perturbed": 1,
"target_doc_loss": 0.854067325592041,
"target_truncated": false,
"threshold_passing_sentences": 4,
"total_doc_length_chars": 2264,
"total_sentences": 14,
"truncated": false
}
|
set error non-classified off
set error unknown_code off
set error memory off
set error stack off
set hw simif nas 0xffff
run
state
quit
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
/*
* Copyright (C) 2013 The Android Open Source Project
*
* 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.example.android.common.logger;
/**
* Helper class for a list (or tree) of LoggerNodes.
*
* <p>When this is set as the head of the list,
* an instance of it can function as a drop-in replacement for {@link android.util.Log}.
* Most of the methods in this class server only to map a method call in Log to its equivalent
* in LogNode.</p>
*/
public class Log {
// Grabbing the native values from Android's native logging facilities,
// to make for easy migration and interop.
public static final int NONE = -1;
public static final int VERBOSE = android.util.Log.VERBOSE;
public static final int DEBUG = android.util.Log.DEBUG;
public static final int INFO = android.util.Log.INFO;
public static final int WARN = android.util.Log.WARN;
public static final int ERROR = android.util.Log.ERROR;
public static final int ASSERT = android.util.Log.ASSERT;
// Stores the beginning of the LogNode topology.
private static LogNode mLogNode;
/**
* Returns the next LogNode in the linked list.
*/
public static LogNode getLogNode() {
return mLogNode;
}
/**
* Sets the LogNode data will be sent to.
*/
public static void setLogNode(LogNode node) {
mLogNode = node;
}
/**
* Instructs the LogNode to print the log data provided. Other LogNodes can
* be chained to the end of the LogNode as desired.
*
* @param priority Log level of the data being logged. Verbose, Error, etc.
* @param tag Tag for for the log data. Can be used to organize log statements.
* @param msg The actual message to be logged.
* @param tr If an exception was thrown, this can be sent along for the logging facilities
* to extract and print useful information.
*/
public static void println(int priority, String tag, String msg, Throwable tr) {
if (mLogNode != null) {
mLogNode.println(priority, tag, msg, tr);
}
}
/**
* Instructs the LogNode to print the log data provided. Other LogNodes can
* be chained to the end of the LogNode as desired.
*
* @param priority Log level of the data being logged. Verbose, Error, etc.
* @param tag Tag for for the log data. Can be used to organize log statements.
* @param msg The actual message to be logged. The actual message to be logged.
*/
public static void println(int priority, String tag, String msg) {
println(priority, tag, msg, null);
}
/**
* Prints a message at VERBOSE priority.
*
* @param tag Tag for for the log data. Can be used to organize log statements.
* @param msg The actual message to be logged.
@param tr If an exception occurs, this parameter can be used to pass the Throwable for logging and extracting useful information.
*/
public static void v(String tag, String msg, Throwable tr) {
println(VERBOSE, tag, msg, tr);
}
/**
* Prints a message at VERBOSE priority.
*
* @param tag Tag for for the log data. Can be used to organize log statements.
* @param msg The actual message to be logged.
*/
public static void v(String tag, String msg) {
v(tag, msg, null);
}
/**
* Prints a message at DEBUG priority.
*
* @param tag Tag for for the log data. Can be used to organize log statements.
* @param msg The actual message to be logged.
* @param tr If an exception was thrown, this can be sent along for the logging facilities
* to extract and print useful information.
*/
public static void d(String tag, String msg, Throwable tr) {
println(DEBUG, tag, msg, tr);
}
/**
* Prints a message at DEBUG priority.
*
* @param tag Tag for for the log data. Can be used to organize log statements.
* @param msg The actual message to be logged.
*/
public static void d(String tag, String msg) {
d(tag, msg, null);
}
/**
* Prints a message at INFO priority.
*
* @param tag Tag for for the log data. Can be used to organize log statements.
* @param msg The actual message to be logged.
* @param tr If an exception was thrown, this can be sent along for the logging facilities
* to extract and print useful information.
*/
public static void i(String tag, String msg, Throwable tr) {
println(INFO, tag, msg, tr);
}
/**
* Prints a message at INFO priority.
*
* @param tag Tag for for the log data. Can be used to organize log statements.
* @param msg The actual message to be logged.
*/
public static void i(String tag, String msg) {
i(tag, msg, null);
}
/**
* Prints a message at WARN priority.
*
* @param tag Tag for for the log data. Can be used to organize log statements.
* @param msg The actual message to be logged.
* @param tr If an exception was thrown, this can be sent along for the logging facilities
* to extract and print useful information.
*/
public static void w(String tag, String msg, Throwable tr) {
println(WARN, tag, msg, tr);
}
/**
* Prints a message at WARN priority.
*
* @param tag Tag for for the log data. Can be used to organize log statements.
* @param msg The actual message to be logged.
*/
public static void w(String tag, String msg) {
w(tag, msg, null);
}
/**
* Prints a message at WARN priority.
*
* @param tag Tag for for the log data. Can be used to organize log statements.
* @param tr If an exception was thrown, this can be sent along for the logging facilities
* to extract and print useful information.
*/
public static void w(String tag, Throwable tr) {
w(tag, null, tr);
}
/**
* Prints a message at ERROR priority.
*
* @param tag Tag for for the log data. Can be used to organize log statements.
* @param msg The actual message to be logged.
* @param tr If an exception was thrown, this can be sent along for the logging facilities
* to extract and print useful information.
*/
public static void e(String tag, String msg, Throwable tr) {
println(ERROR, tag, msg, tr);
}
/**
* Prints a message at ERROR priority.
*
* @param tag Tag for for the log data. Can be used to organize log statements.
* @param msg The actual message to be logged.
*/
public static void e(String tag, String msg) {
e(tag, msg, null);
}
/**
* Prints a message at ASSERT priority.
*
* @param tag Tag for for the log data. Can be used to organize log statements.
* @param msg The actual message to be logged.
* @param tr If an exception was thrown, this can be sent along for the logging facilities
* to extract and print useful information.
*/
public static void wtf(String tag, String msg, Throwable tr) {
println(ASSERT, tag,
| null | 1
|
{
"advantage_score_max": 9.045853614807129,
"advantage_score_mean": 2.6019084453582764,
"advantage_score_min": 1.1073530912399292,
"advantage_score_std": 2.230417251586914,
"advantage_scores": [
9.045853614807129,
7.1224141120910645,
2.8290693759918213,
2.438000202178955,
2.238584280014038,
2.150247573852539,
1.9718389511108398,
1.7767102718353271,
1.641417145729065,
1.5140823125839233,
1.4072977304458618,
1.3580023050308228,
1.2481344938278198,
1.1796200275421143,
1.1073530912399292
],
"baseline_doc_loss": 0.3816864788532257,
"baseline_truncated": false,
"doc_advantage_score": 7.528578281402588,
"length_change_ratio": 0.8775510204081632,
"net_length_change_chars": -18,
"original_sentences_length_chars": 147,
"replacement_paraphrases_length_chars": 129,
"sentences_perturbed": 1,
"target_doc_loss": 0.05069834738969803,
"target_truncated": false,
"threshold_passing_sentences": 15,
"total_doc_length_chars": 7730,
"total_sentences": 80,
"truncated": false
}
|
package meghanada.analyze;
import com.google.common.base.MoreObjects;
import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import java.util.Set;
import javax.annotation.Nullable;
import meghanada.reflect.CandidateUnit;
import meghanada.reflect.MemberDescriptor;
import meghanada.reflect.MethodDescriptor;
import meghanada.reflect.MethodParameter;
import org.apache.logging.log4j.LogManager;
import org.apache.logging.log4j.Logger;
import org.apache.logging.log4j.message.EntryMessage;
public class MethodScope extends BlockScope {
private static final Logger log = LogManager.getLogger(MethodScope.class);
private static final long serialVersionUID = -5255555840551352713L;
public static final String[] STRINGS = new String[0];
public final String declaringClass;
public final List<String> parameters = new ArrayList<>(3);
public boolean vararg;
public String modifier;
public final String name;
public String returnType;
public final Range nameRange;
private final boolean isConstructor;
private final List<String> exceptions = new ArrayList<>(1);
public MethodScope(
final String declaringClass,
final String name,
@Nullable final Range nameRange,
final int pos,
final Range range,
final boolean isConstructor) {
super(pos, range);
this.declaringClass = declaringClass;
this.name = name;
this.nameRange = nameRange;
this.isConstructor = isConstructor;
}
void addMethodParameter(final String fqcn) {
this.parameters.add(fqcn);
}
void addException(final String fqcn) {
this.exceptions.add(fqcn);
}
@Override
public void dumpVariable() {
final EntryMessage entryMessage =
log.traceEntry("**** {} {} return {}", this.getScopeType(), this.name, this.returnType);
super.dumpVariable(log);
for (final ExpressionScope expressionScope : this.expressions) {
expressionScope.dumpVariable();
}
for (final BlockScope blockScope : this.scopes) {
blockScope.dumpVariable();
}
log.traceExit(entryMessage);
}
@Override
public void dumpFieldAccess() {
final EntryMessage entryMessage =
log.traceEntry("**** {} {} return {}", this.getScopeType(), this.name, this.returnType);
super.dumpFieldAccess(log);
for (final ExpressionScope expressionScope : this.expressions) {
expressionScope.dumpFieldAccess();
}
for (final BlockScope blockScope : this.scopes) {
blockScope.dumpFieldAccess();
}
log.traceExit(entryMessage);
}
@Override
public void dump() {
final EntryMessage entryMessage =
log.traceEntry(
"**** {} {} return {} isParameter {}",
this.getScopeType(),
this.name,
this.returnType,
this.parameters);
super.dumpVariable(log);
for (final ExpressionScope expressionScope : this.expressions) {
expressionScope.dumpVariable();
}
for (final BlockScope blockScope : this.scopes) {
blockScope.dumpVariable();
}
super.dumpFieldAccess(log);
for (final ExpressionScope expressionScope : this.expressions) {
expressionScope.dumpFieldAccess();
}
for (final BlockScope blockScope : this.scopes) {
blockScope.dumpFieldAccess();
}
log.traceExit(entryMessage);
}
@Override
public String getName() {
return this.name;
}
public Range getNameRange() {
return nameRange;
}
public long getBeginLine() {
return range.begin.line;
}
@Override
public Map<String, Variable> getDeclaratorMap() {
final Map<String, Variable> declaratorMap = super.getDeclaratorMap();
for (final ExpressionScope es : this.expressions) {
declaratorMap.putAll(es.getDeclaratorMap());
}
return declaratorMap;
}
@Override
public Map<String, Variable> getVariableMap() {
final Map<String, Variable> variableMap = super.getVariableMap();
for (final ExpressionScope es : this.expressions) {
es.getVariableMap()
.forEach(
(k, v) -> {
if (v.isDecl()) {
variableMap.put(k, v);
} else {
variableMap.putIfAbsent(k, v);
}
});
}
return variableMap;
}
@Override
public Set<Variable> getVariables() {
final Set<Variable> variables = super.getVariables();
for (final ExpressionScope es : this.expressions) {
variables.addAll(es.getVariables());
}
return variables;
}
@Override
public String toString() {
return MoreObjects.toStringHelper(this)
.add("name", name)
.add("nameRange", nameRange)
.add("isConstructor", isConstructor)
.add("returnType", returnType)
.add("parameters", parameters)
.toString();
}
public List<String> getParameters() {
return parameters;
}
public boolean isConstructor() {
return isConstructor;
}
public MemberDescriptor toMemberDescriptor() {
int size = this.parameters.size();
List<MethodParameter> mps = new ArrayList<>(size);
int i = 0;
for (String type : parameters) {
i++;
boolean v = this.vararg && i == size;
MethodParameter mp = new MethodParameter(type, "arg" + i, v);
mps.add(mp);
}
String[] exceptions = getExceptions();
return new MethodDescriptor(
this.declaringClass,
this.name,
this.modifier,
mps,
exceptions,
this.returnType,
false,
CandidateUnit.MemberType.METHOD);
}
private String[] getExceptions() {
return this.exceptions.toArray(STRINGS);
}
}
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
//
// Generated by class-dump 3.5 (64 bit).
class-dump is licensed under the GNU General Public License, Copyright (C) Steve Nygard.
//
#import <CloudKit/CKObject.h>
@class NSNumber, NSString;
__attribute__((visibility("hidden")))
@interface CKAssetHandle : CKObject
{
NSNumber *_itemID;
NSString *_UUID;
NSString *_path;
NSNumber *_deviceID;
NSNumber *_fileID;
NSNumber *_generationID;
NSNumber *_lastUsedTime;
}
@property(retain, nonatomic) NSNumber *lastUsedTime; // @synthesize lastUsedTime=_lastUsedTime;
@property(retain, nonatomic) NSNumber *generationID; // @synthesize generationID=_generationID;
@property(retain, nonatomic) NSNumber *fileID; // @synthesize fileID=_fileID;
@property(retain, nonatomic) NSNumber *deviceID; // @synthesize deviceID=_deviceID;
@property(retain, nonatomic) NSString *path; // @synthesize path=_path;
@property(retain, nonatomic) NSString *UUID; // @synthesize UUID=_UUID;
@property(retain, nonatomic) NSNumber *itemID; // @synthesize itemID=_itemID;
- (void).cxx_destruct;
- (id)initWithItemID:(id)arg1 UUID:(id)arg2 path:(id)arg3;
- (id)description;
- (id)CKPropertiesDescription;
@end
| null | 1
|
{
"advantage_score_max": 2.3861920833587646,
"advantage_score_mean": 2.3861920833587646,
"advantage_score_min": 2.3861920833587646,
"advantage_score_std": 0,
"advantage_scores": [
2.3861920833587646
],
"baseline_doc_loss": 0.563828706741333,
"baseline_truncated": false,
"doc_advantage_score": 1.7850661277770996,
"length_change_ratio": 1.0232558139534884,
"net_length_change_chars": 2,
"original_sentences_length_chars": 86,
"replacement_paraphrases_length_chars": 88,
"sentences_perturbed": 1,
"target_doc_loss": 0.31585872173309326,
"target_truncated": false,
"threshold_passing_sentences": 1,
"total_doc_length_chars": 1163,
"total_sentences": 3,
"truncated": false
}
|
Microsoft Visual Studio Solution File, Format Version 12.00
# Visual Studio 15
VisualStudioVersion = 15.0.27213.1
MinimumVisualStudioVersion = 10.0.40219.1
Project("{9A19103F-16F7-4668-BE54-9A1E7A4F7556}") = "System.Diagnostics.StackTrace.Tests", "tests\System.Diagnostics.StackTrace.Tests.csproj", "{297A9116-1005-499D-A895-2063D03E4C94}"
ProjectSection(ProjectDependencies) = postProject
{02304469-722E-4723-92A1-820B9A37D275} = {02304469-722E-4723-92A1-820B9A37D275}
EndProjectSection
EndProject
Project("{9A19103F-16F7-4668-BE54-9A1E7A4F7556}") = "System.Diagnostics.StackTrace", "src\System.Diagnostics.StackTrace.csproj", "{02304469-722E-4723-92A1-820B9A37D275}"
ProjectSection(ProjectDependencies) = postProject
{C38217EF-88F4-4D56-9F58-780BE1DDAFF6} = {C38217EF-88F4-4D56-9F58-780BE1DDAFF6}
EndProjectSection
EndProject
Project("{9A19103F-16F7-4668-BE54-9A1E7A4F7556}") = "System.Diagnostics.StackTrace", "ref\System.Diagnostics.StackTrace.csproj", "{C38217EF-88F4-4D56-9F58-780BE1DDAFF6}"
EndProject
Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "tests", "tests", "{1A2F9F4A-A032-433E-B914-ADD5992BB178}"
EndProject
Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "src", "src", "{E107E9C1-E893-4E87-987E-04EF0DCEAEFD}"
EndProject
Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "ref", "ref", "{2E666815-2EDB-464B-9DF6-380BF4789AD4}"
EndProject
Project("{9A19103F-16F7-4668-BE54-9A1E7A4F7556}") = "TestUtilities", "..\Common\tests\TestUtilities\TestUtilities.csproj", "{854C7BBD-8B87-44AE-B109-421647CD5959}"
EndProject
Project("{9A19103F-16F7-4668-BE54-9A1E7A4F7556}") = "System.Collections.Concurrent", "..\System.Collections.Concurrent\src\System.Collections.Concurrent.csproj", "{ADDF4CDC-9F80-492C-85B5-908E34B64D74}"
EndProject
Project("{9A19103F-16F7-4668-BE54-9A1E7A4F7556}") = "System.IO.FileSystem", "..\System.IO.FileSystem\src\System.IO.FileSystem.csproj", "{6E4DEE24-716D-4E97-877B-83B138020091}"
EndProject
Project("{9A19103F-16F7-4668-BE54-9A1E7A4F7556}") = "System.Runtime", "..\System.Runtime\src\System.Runtime.csproj", "{20636DC7-EB9C-4E40-B10C-BC023B4AEEDF}"
EndProject
Project("{9A19103F-16F7-4668-BE54-9A1E7A4F7556}") = "System.Runtime.Extensions", "..\System.Runtime.Extensions\src\System.Runtime.Extensions.csproj", "{5D5B7D66-AEB4-41A1-AB8A-1AB884A65064}"
EndProject
Project("{9A19103F-16F7-4668-BE54-9A1E7A4F7556}") = "System.Reflection.Metadata", "..\System.Reflection.Metadata\src\System.Reflection.Metadata.csproj", "{456DBDB3-EF0D-4517-8893-8D5087CA3254}"
EndProject
Project("{9A19103F-16F7-4668-BE54-9A1E7A4F7556}") = "System.Collections.Immutable", "..\System.Collections.Immutable\src\System.Collections.Immutable.csproj", "{085360DE-8FF9-4725-8014-3C660BB36A25}"
EndProject
Global
GlobalSection(SolutionConfigurationPlatforms) = preSolution
Debug|Any CPU = Debug|Any CPU
Release|Any CPU = Release|Any CPU
EndGlobalSection
GlobalSection(ProjectConfigurationPlatforms) = postSolution
{297A9116-1005-499D-A895-2063D03E4C94}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
{297A9116-1005-499D-A895-2063D03E4C94}.Debug|Any CPU.Build.0 = Debug|Any CPU
{297A9116-1005-499D-A895-2063D03E4C94}.Release|Any CPU.ActiveCfg = Release|Any CPU
{297A9116-1005-499D-A895-2063D03E4C94}.Release|Any CPU.Build.0 = Release|Any CPU
{02304469-722E-4723-92A1-820B9A37D275}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
{02304469-722E-4723-92A1-820B9A37D275}.Debug|Any CPU.Build.0 = Debug|Any CPU
{02304469-722E-4723-92A1-820B9A37D275}.Release|Any CPU.ActiveCfg = Release|Any CPU
{02304469-722E-4723-92A1-820B9A37D275}.Release|Any CPU.Build.0 = Release|Any CPU
{C38217EF-88F4-4D56-9F58-780BE1DDAFF6}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
{C38217EF-88F4-4D56-9F58-780BE1DDAFF6}.Debug|Any CPU.Build.0 = Debug|Any CPU
{C38217EF-88F4-4D56-9F58-780BE1DDAFF6}.Release|Any CPU.ActiveCfg = Release|Any CPU
{C38217EF-88F4-4D56-9F58-780BE1DDAFF6}.Release|Any CPU.Build.0 = Release|Any CPU
{854C7BBD-8B87-44AE-B109-421647CD5959}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
{854C7BBD-8B87-44AE-B109-421647CD5959}.Debug|Any CPU.Build.0 = Debug|Any CPU
{854C7BBD-8B87-44AE-B109-421647CD5959}.Release|Any CPU.ActiveCfg = Release|Any CPU
{854C7BBD-8B87-44AE-B109-421647CD5959}.Release|Any CPU.Build.0 = Release|Any CPU
{ADDF4CDC-9F80-492C-85B5-908E34B64D74}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
{ADDF4CDC-9F80-492C-85B5-908E34B64D74}.Debug|Any CPU.Build.0 = Debug|Any CPU
{ADDF4CDC-9F80-492C-85B5-908E34B
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
package fa_IR
import (
"math"
"strconv"
"time"
"github.com/go-playground/locales"
"github.com/go-playground/locales/currency"
)
type fa_IR struct {
locale string
pluralsCardinal []locales.PluralRule
pluralsOrdinal []locales.PluralRule
pluralsRange []locales.PluralRule
decimal string
group string
minus string
percent string
perMille string
timeSeparator string
inifinity string
currencies []string // idx = enum of currency code
currencyPositivePrefix string
currencyNegativePrefix string
monthsAbbreviated []string
monthsNarrow []string
monthsWide []string
daysAbbreviated []string
daysNarrow []string
daysShort []string
daysWide []string
periodsAbbreviated []string
periodsNarrow []string
periodsShort []string
periodsWide []string
erasAbbreviated []string
erasNarrow []string
erasWide []string
timezones map[string]string
}
// New returns a new instance of translator for the 'fa_IR' locale
func New() locales.Translator {
return &fa_IR{
locale: "fa_IR",
pluralsCardinal: []locales.PluralRule{2, 6},
pluralsOrdinal: []locales.PluralRule{6},
pluralsRange: []locales.PluralRule{6},
decimal: "٫",
group: "٬",
minus: "−",
percent: "٪",
perMille: "؉",
timeSeparator: ":",
inifinity: "∞",
currencies: []string{"ADP", "AED", "AFA", "AFN", "ALK", "ALL", "AMD", "ANG", "AOA", "AOK", "AON", "AOR", "ARA", "ARL", "ARM", "ARP", "ARS", "ATS", "AUD", "AWG", "AZM", "AZN", "BAD", "BAM", "BAN", "BBD", "BDT", "BEC", "BEF", "BEL", "BGL", "BGM", "BGN", "BGO", "BHD", "BIF", "BMD", "BND", "BOB", "BOL", "BOP", "BOV", "BRB", "BRC", "BRE", "BRL", "BRN", "BRR", "BRZ", "BSD", "BTN", "BUK", "BWP", "BYB", "BYN", "BYR", "BZD", "CAD", "CDF", "CHE", "CHF", "CHW", "CLE", "CLF", "CLP", "CNH", "CNX", "CNY", "COP", "COU", "CRC", "CSD", "CSK", "CUC", "CUP", "CVE", "CYP", "CZK", "DDM", "DEM", "DJF", "DKK", "DOP", "DZD", "ECS", "ECV", "EEK", "EGP", "ERN", "ESA", "ESB", "ESP", "ETB", "EUR", "FIM", "FJD", "FKP", "FRF", "GBP", "GEK", "GEL", "GHC", "GHS", "GIP", "GMD", "GNF", "GNS", "GQE", "GRD", "GTQ", "GWE", "GWP", "GYD", "HKD", "HNL", "HRD", "HRK", "HTG", "HUF", "IDR", "IEP", "ILP", "ILR", "ILS", "INR", "IQD", "IRR", "ISJ", "ISK", "ITL", "JMD", "JOD", "JPY", "KES", "KGS", "KHR", "KMF", "KPW", "KRH", "KRO", "KRW", "KWD", "KYD", "KZT", "LAK", "LBP", "LKR", "LRD", "LSL", "LTL", "LTT", "LUC", "LUF", "LUL", "LVL", "LVR", "LYD", "MAD", "MAF", "MCF", "MDC", "MDL", "MGA", "MGF", "MKD", "MKN", "MLF", "MMK", "MNT", "MOP", "MRO", "MTL", "MTP", "MUR", "MVP", "MVR", "MWK", "MXN", "MXP", "MXV", "MYR", "MZE", "MZM", "MZN", "NAD", "NGN", "NIC", "NIO", "NLG", "NOK", "NPR", "NZD", "OMR", "PAB", "PEI", "PEN", "PES", "PGK", "PHP", "PKR", "PLN", "PLZ", "PTE", "PYG", "QAR", "RHD", "ROL", "RON", "RSD", "RUB", "RUR", "RWF", "SAR", "SBD", "SCR", "SDD", "SDG", "SDP", "SEK", "SGD", "SHP", "SIT", "SKK", "SLL", "SOS", "SRD", "SRG", "SSP", "STD", "STN", "SUR", "SVC", "SYP", "SZL", "THB", "TJR", "TJS", "TMM", "TMT", "TND", "TOP", "TPE", "TRL", "TRY", "TTD", "TWD", "TZS", "UAH", "UAK", "UGS", "UGX", "USD", "USN", "USS", "UYI", "UYP", "UYU", "UZS", "VEB", "VEF", "VND", "VNN", "VUV", "WST", "XAF", "XAG", "XAU", "XBA", "XBB", "XBC", "XBD", "XCD", "XDR", "XEU", "XFO", "XFU", "XOF", "XPD", "XPF", "XPT", "XRE", "XSU", "XTS", "XUA", "XXX", "YDD", "YER", "YUD", "YUM", "YUN", "YUR", "ZAL", "ZAR", "ZMK", "ZMW", "ZRN", "ZRZ", "ZWD", "ZWL", "ZWR"},
currencyPositivePrefix: "",
currencyNegativePrefix: "",
monthsAbbreviated: []string{"", "ژانویهٔ", "فوریهٔ", "مارس", "آوریل", "مهٔ", "ژوئن", "ژوئیهٔ", "اوت", "سپتامبر", "اکتبر", "نوامبر", "دسامبر"},
monthsNarrow: []string{"", "ژ", "ف", "م", "آ", "م", "ژ", "ژ", "ا", "س", "ا", "ن", "د"},
monthsWide: []string{"", "ژانویهٔ", "فوریهٔ", "مارس", "آوریل", "مهٔ", "ژوئن", "ژوئیهٔ", "اوت", "سپتامبر", "اکتبر", "نوامبر", "دسامبر"},
daysAbbreviated: []string{"یکشنبه", "دوشنبه", "سه\u200cشنبه", "چهارشنبه", "پنجشنبه", "جمعه", "شنبه"},
daysNarrow: []string{"ی", "د", "س", "چ", "پ", "ج", "ش"},
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
import os
head = open('urdf-template/atlas_head.txt', 'r').read()
body = open('urdf-template/atlas_body.txt', 'r').read()
tail = open('urdf-template/atlas_tail.txt', 'r').read()
max_num_row = 5 # ADJUST
out_dir = 'output/atlas' # ADJUST
if not os.path.exists(out_dir):
os.makedirs(out_dir)
for numrow in range(1, max_num_row+1):
text = head + '\n'
print('generate URDF for numrow={}...'.format(numrow))
# body
i = 0
for row in range(0, numrow):
for col in range(0, numrow):
base_pos = (row * 2.0, col * 2.0, 1.0)
text += body.format(
base_pos_0 = base_pos[0],
base_pos_1 = base_pos[1],
base_pos_2 = base_pos[2],
id = i
)
i+=1
# tail
text += '\n'
text += tail
# save
print('save URDF for numrow={}...'.format(numrow))
with open(os.path.join(out_dir,
"robot{}.urdf".format(numrow)), "w") as text_file:
text_file.write(text)
print('Atlas URDF generate finished.')
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
TARGET = rltotiff
OBJS = rltotiff.o tiff_rgba_io.o
include ../../splash_support/Makefile.config
LDFLAGS := $(LDFLAGS) -ltiff
clean:
rm -rf $(OBJS) $(TARGET)
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
{-# LANGUAGE MultiParamTypeClasses, FlexibleInstances #-}
module Opaleye.Internal.TableMaker where
import qualified Opaleye.Column as C
import qualified Opaleye.Internal.Column as IC
import qualified Opaleye.Internal.PackMap as PM
import qualified Opaleye.Internal.Unpackspec as U
import Data.Profunctor (Profunctor, dimap)
import Data.Profunctor.Product (ProductProfunctor)
import qualified Data.Profunctor.Product as PP
import Data.Profunctor.Product.Default (Default, def)
import Control.Applicative (Applicative, pure, (<*>))
import qualified Opaleye.Internal.HaskellDB.PrimQuery as HPQ
-- If we switch to a more lens-like approach to PackMap this should be
-- the equivalent of a Setter
newtype ViewColumnMaker strings columns =
ViewColumnMaker (PM.PackMap () () strings columns)
runViewColumnMaker :: ViewColumnMaker strings tablecolumns ->
strings -> tablecolumns
runViewColumnMaker (ViewColumnMaker f) = PM.overPM f id
{-# DEPRECATED ColumnMaker "Use Unpackspec instead" #-}
type ColumnMaker = U.Unpackspec
{-# DEPRECATED runColumnMaker "Use runUnpackspec instead" #-}
runColumnMaker :: Applicative f
=> ColumnMaker tablecolumns columns
-> (HPQ.PrimExpr -> f HPQ.PrimExpr)
-> tablecolumns -> f columns
runColumnMaker = U.runUnpackspec
-- There's surely a way of simplifying this implementation
tableColumn :: ViewColumnMaker String (C.Column a)
tableColumn = ViewColumnMaker
(PM.PackMap (\f s -> fmap (const (mkColumn s)) (f ())))
where mkColumn = IC.Column . HPQ.BaseTableAttrExpr
instance Default ViewColumnMaker String (C.Column a) where
def = tableColumn
{-# DEPRECATED column "Use unpackspecColumn instead" #-}
column :: ColumnMaker (C.Column a) (C.Column a)
column = U.unpackspecField
-- {
-- Boilerplate instance definitions. Theoretically, these are derivable.
instance Functor (ViewColumnMaker a) where
fmap f (ViewColumnMaker g) = ViewColumnMaker (fmap f g)
instance Applicative (ViewColumnMaker a) where
pure = ViewColumnMaker . pure
ViewColumnMaker f <*> ViewColumnMaker x = ViewColumnMaker (f <*> x)
instance Profunctor ViewColumnMaker where
dimap f g (ViewColumnMaker q) = ViewColumnMaker (dimap f g q)
instance ProductProfunctor ViewColumnMaker where
purePP = pure
(****) = (<*>)
--}
| null | 0
|
{
"advantage_score_max": 0,
"advantage_score_mean": 0,
"advantage_score_min": 0,
"advantage_score_std": 0,
"advantage_scores": [],
"baseline_doc_loss": 1.2693842649459839,
"baseline_truncated": false,
"doc_advantage_score": 0.9197031855583191,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 0,
"replacement_paraphrases_length_chars": 0,
"sentences_perturbed": 0,
"target_doc_loss": 1.3802107572555542,
"target_truncated": false,
"threshold_passing_sentences": 0,
"total_doc_length_chars": 2377,
"total_sentences": 5,
"truncated": false
}
|
#!/usr/bin/env sh
TOOLS=./build/tools
$TOOLS/caffe train \
--solver=examples/cifar10/cifar10_full_sigmoid_solver.prototxt
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
// --------------------------------------------------------------------------------------------------------------------
// <copyright file="LineLegendPosition.cs" company="OxyPlot">
// The MIT License (MIT)
//
// Copyright (c) 2012 Oystein Bjorke
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to
// permit persons to whom the Software is furnished to do so, subject to
// the following conditions:
//
// The above copyright notice and this permission notice shall be included
// in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED WARRANTY, INCLUDING BUT NOT LIMITED TO THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
// IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
// CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
// TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
// SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
// </copyright>
// <summary>
// Specifies the position of legends rendered on a line series.
// </summary>
// --------------------------------------------------------------------------------------------------------------------
namespace OxyPlot.Series
{
/// <summary>
/// Specifies the position of legends rendered on a <see cref="LineSeries"/>.
/// </summary>
public enum LineLegendPosition
{
/// <summary>
/// Do not render legend on the line.
/// </summary>
None,
/// <summary>
/// Render legend at the start of the line.
/// </summary>
Start,
/// <summary>
/// Render legend at the end of the line.
/// </summary>
End
}
}
| null | 1
|
{
"advantage_score_max": 5.283173084259033,
"advantage_score_mean": 5.283173084259033,
"advantage_score_min": 5.283173084259033,
"advantage_score_std": 0,
"advantage_scores": [
5.283173084259033
],
"baseline_doc_loss": 0.45489490032196045,
"baseline_truncated": false,
"doc_advantage_score": 2.2564995288848877,
"length_change_ratio": 0.8243243243243243,
"net_length_change_chars": -39,
"original_sentences_length_chars": 222,
"replacement_paraphrases_length_chars": 183,
"sentences_perturbed": 1,
"target_doc_loss": 0.20159317553043365,
"target_truncated": false,
"threshold_passing_sentences": 1,
"total_doc_length_chars": 2162,
"total_sentences": 9,
"truncated": false
}
|
// jscs:disable requireArrowFunctions,disallowVar,requireEnhancedObjectLiterals
/* globals QUnit,Hammer,utils,Simulator */
var el;
var hammer;
var pressPeriod = 200;
var pressThreshold = 20;
var pressCount = 0;
var panStartCount = 0;
var swipeCount = 0;
QUnit.module('Require Failure ( Swipe & Press )', {
beforeEach: function() {
el = utils.createHitArea();
hammer = new Hammer(el, { recognizers: [] });
var swipe = new Hammer.Swipe({ threshold: 1 });
var press = new Hammer.Press({ time: pressPeriod, threshold: pressThreshold });
hammer.add(swipe);
hammer.add(press);
swipe.recognizeWith(press);
press.requireFailure(swipe);
pressCount = 0;
swipeCount = 0;
hammer.on('press', function() {
pressCount++;
});
hammer.on('swipe', function() {
swipeCount++;
});
},
afterEach: function() {
hammer.destroy();
}
});
QUnit.test('When swipe does not recognize the gesture, a press gesture can be fired', function(assert) {
var done = assert.async();
assert.expect(1);
utils.dispatchTouchEvent(el, 'start', 50, 50);
setTimeout(function() {
assert.equal(pressCount, 1, '1 press recognized');
done();
}, pressPeriod + 100);
});
QUnit.test('When swipe does recognize the gesture, a press gesture cannot be fired', function(assert) {
var done = assert.async();
assert.expect(2);
Simulator.gestures.swipe(el, null, function() {
assert.ok(swipeCount > 0, 'swipe gesture should be recognizing');
assert.equal(pressCount, 0, 'press gesture should not be recognized because swipe gesture is recognizing');
done();
});
});
QUnit.module('Require Failure ( Pan & Press )', {
beforeEach: function() {
el = document.createElement('div');
document.body.appendChild(el);
hammer = new Hammer(el, { recognizers: [] });
var pan = new Hammer.Pan({ threshold: 1 });
var press = new Hammer.Press({ time: pressPeriod, threshold: pressThreshold });
hammer.add([ pan, press ]);
pan.recognizeWith(press);
press.requireFailure(pan);
pressCount = 0;
panStartCount = 0;
hammer.on('press', function() {
pressCount++;
});
hammer.on('panstart', function() {
panStartCount++;
});
},
afterEach: function() {
document.body.removeChild(el);
hammer.destroy();
}
});
QUnit.test('When pan does not recognize the gesture, a press gesture can be fired', function(assert) {
var done = assert.async();
assert.expect(1);
utils.dispatchTouchEvent(el, 'start', 50, 50);
setTimeout(function() {
assert.equal(pressCount, 1, '1 press recognized');
done();
}, pressPeriod + 100);
});
QUnit.test('When pan recognizes the gesture, a press gesture cannot be fired', function(assert) {
var done = assert.async();
assert.expect(2);
utils.dispatchTouchEvent(el, 'start', 50, 50);
utils.dispatchTouchEvent(el, 'move', 50 + pressThreshold / 4, 50);
setTimeout(function() {
assert.ok(panStartCount > 0, 'pan gesture should be recognizing');
assert.equal(pressCount, 0, 'press gesture should not be recognized because pan gesture is recognizing');
done();
}, pressPeriod + 100);
});
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
<info xmlns="http://docbook.org/ns/docbook" version="5.0">
<copyright>
<year>1999-2007</year>
<holder>Norman Walsh</holder>
</copyright>
<copyright>
<year>2003</year>
<holder>Jiří Kosek</holder>
</copyright>
<copyright>
<year>2004-2007</year>
<holder>Steve Ball</holder>
</copyright>
<copyright>
<year>2001-2007</year>
<holder>The DocBook Project</holder>
</copyright>
</info>
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
# -*- coding: utf-8 -*-
"""
pygments.lexers.templates
~~~~~~~~~~~~~~~~~~~~~~~~~
Lexers for various template engines' markup.
:copyright: Copyright 2006-2015 by the Pygments team, see AUTHORS.
:license: BSD, see LICENSE for details.
"""
import re
from pygments.lexers.web import HtmlLexer, XmlLexer
from pygments.lexers.javascript import JavascriptLexer, LassoLexer
from pygments.lexers.css import CssLexer
from pygments.lexers.php import PhpLexer
from pygments.lexers.python import PythonLexer
from pygments.lexers.perl import PerlLexer
from pygments.lexers.jvm import JavaLexer, TeaLangLexer
from pygments.lexers.data import YamlLexer
from pygments.lexer import Lexer, DelegatingLexer, RegexLexer, bygroups, \
include, using, this, default, combined
from pygments.token import Error, Punctuation, Whitespace, \
Text, Comment, Operator, Keyword, Name, String, Number, Other, Token
from pygments.util import html_doctype_matches, looks_like_xml
__all__ = ['HtmlPhpLexer', 'XmlPhpLexer', 'CssPhpLexer',
'JavascriptPhpLexer', 'ErbLexer', 'RhtmlLexer',
'XmlErbLexer', 'CssErbLexer', 'JavascriptErbLexer',
'SmartyLexer', 'HtmlSmartyLexer', 'XmlSmartyLexer',
'CssSmartyLexer', 'JavascriptSmartyLexer', 'DjangoLexer',
'HtmlDjangoLexer', 'CssDjangoLexer', 'XmlDjangoLexer',
'JavascriptDjangoLexer', 'GenshiLexer', 'HtmlGenshiLexer',
'GenshiTextLexer', 'CssGenshiLexer', 'JavascriptGenshiLexer',
'MyghtyLexer', 'MyghtyHtmlLexer', 'MyghtyXmlLexer',
'MyghtyCssLexer', 'MyghtyJavascriptLexer', 'MasonLexer', 'MakoLexer',
'MakoHtmlLexer', 'MakoXmlLexer', 'MakoJavascriptLexer',
'MakoCssLexer', 'JspLexer', 'CheetahLexer', 'CheetahHtmlLexer',
'CheetahXmlLexer', 'CheetahJavascriptLexer', 'EvoqueLexer',
'EvoqueHtmlLexer', 'EvoqueXmlLexer', 'ColdfusionLexer',
'ColdfusionHtmlLexer', 'ColdfusionCFCLexer', 'VelocityLexer',
'VelocityHtmlLexer', 'VelocityXmlLexer', 'SspLexer',
'TeaTemplateLexer', 'LassoHtmlLexer', 'LassoXml Lexer',
'LassoCss Lexer','LassoJavascript Lexer','Handlebars Lexer',
"Handlebars Html Lexer", "Yaml Jinja Lexer", "Liquid Lexer",
"Twig Lexer", "Twig Html Lexer"].
Just highlights ruby code between the preprocessor directives, other data
is left untouched by the lexer.
All options are also forwarded to the `RubyLexer`.
"""
name = 'ERB'
aliases = ['erb']
mimetypes = ['application/x-ruby-templating']
_block_re = re.compile(r'(<%%|%%>|<%=|<%#|<%-|<%|-%>|%>|^%[^%].*?$)', re.M)
def __init__(self, **options):
from pygments.lexers.ruby import RubyLexer
self.ruby_lexer = RubyLexer(**options)
Lexer.__init__(self, **options)
def get_tokens_unprocessed(self, text):
"""
Since ERB doesn't allow "<%" and other tags inside of ruby
blocks we have to use a split approach here that fails for
that too.
"""
tokens = self._block_re.split(text)
tokens.reverse()
state = idx = 0
try:
while True:
# text
if state == 0:
val = tokens.pop()
yield idx, Other, val
idx += len(val)
state = 1
# block starts
elif state == 1:
tag = tokens.pop()
# literals
if tag in ('<%%', '%%>'):
yield idx, Other, tag
idx += 3
state = 0
# comment
elif tag == '<%#':
yield idx, Comment.Preproc, tag
val = tokens.pop()
yield idx + 3, Comment, val
idx += 3 + len(val)
state = 2
# blocks or output
elif tag in ('<%', '<%=', '<%-'):
yield idx, Comment.Preproc, tag
idx += len(tag)
data = tokens.pop()
r_idx = 0
for r_idx, r_token, r_value in \
self.ruby_lexer.get_tokens_unprocessed(data):
yield r_idx + idx, r_token, r_value
idx += len(data)
state = 2
elif tag in ('%>', '-%>'):
yield idx, Error, tag
idx += len(tag)
state = 0
# % raw ruby statements
else:
yield idx, Comment.Preproc, tag[0]
r_idx = 0
for r_idx, r_token, r_value in \
self.ruby_lexer.get_tokens_unprocessed(tag[1:]):
yield idx + 1 + r_idx, r_token, r_value
idx += len(tag)
state = 0
# block ends
elif state == 2:
tag = tokens.pop()
if tag not in ('%>', '-%>'):
yield idx, Other, tag
else:
yield idx, Comment.Preproc, tag
idx += len(tag)
state = 0
except IndexError:
return
def analyse_text(text):
if '<%' in text and '%>' in text:
return 0.4
class SmartyLexer(RegexLexer):
"""
Generic `Smarty <http://smarty.php.net/>`_ template lexer.
Just highlights smarty code between the preprocessor directives, other
data is left untouched by the lexer.
"""
name = 'Smarty'
aliases = ['smarty']
filenames = ['*.tpl']
mimetypes = ['application/x-smarty']
flags = re.MULTILINE | re.DOTALL
tokens = {
'root': [
(r'[^{]+', Other),
(r'(\{)(\*.*?\*)(\})',
bygroups(Comment.Preproc, Comment, Comment.Preproc)),
(r'(\{php\})(.*?)(\{/php\})',
bygroups(Comment.Preproc, using(PhpLexer, startinline=True),
Comment.Preproc)),
(r'(\{)(/?[a-zA-Z_]\w*)(\s*)',
bygroups(Comment.Preproc, Name.Function, Text), 'smarty'),
(r'\{', Comment.Preproc, 'smarty')
],
'smarty': [
(r'\s+', Text),
(r'\{', Comment.Preproc, '#push'),
(r'\}', Comment.Preproc, '#pop'),
(r'#[a-zA-Z_]\w*#', Name.Variable),
(r'\$[a-zA-Z_]\w*(\.\w+)*', Name.Variable),
(r'[~!%^&*()+=|\[\]:;,.<>/?@-]', Operator),
(r'(true|false|null)\b', Keyword.Constant),
(r"[0
| null | 1
|
{
"advantage_score_max": 1.2716054916381836,
"advantage_score_mean": 1.2653133869171143,
"advantage_score_min": 1.2590211629867554,
"advantage_score_std": 0.006292164325714111,
"advantage_scores": [
1.2716054916381836,
1.2590211629867554
],
"baseline_doc_loss": 0.8476066589355469,
"baseline_truncated": false,
"doc_advantage_score": 1.329538345336914,
"length_change_ratio": 0.9474412171507607,
"net_length_change_chars": -114,
"original_sentences_length_chars": 2169,
"replacement_paraphrases_length_chars": 2055,
"sentences_perturbed": 1,
"target_doc_loss": 0.6375195384025574,
"target_truncated": false,
"threshold_passing_sentences": 2,
"total_doc_length_chars": 6982,
"total_sentences": 15,
"truncated": false
}
|
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<Policy xmlns="urn:oasis:names:tc:xacml:3.0:core:schema:wd-17" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" PolicyId="urn:oasis:names:tc:xacml:2.0:conformance-test:IIC156:policy" RuleCombiningAlgId="urn:oasis:names:tc:xacml:3.0:rule-combining-algorithm:deny-overrides" Version="1.0" xsi:schemaLocation="urn:oasis:names:tc:xacml:3.0:policy:schema:os access_control-xacml-2.0-policy-schema-os.xsd">
<Description>
Policy for Conformance Test IIC156.
</Description>
<Target/>
<Rule Effect="Permit" RuleId="urn:oasis:names:tc:xacml:2.0:conformance-test:IIC156:rule">
<Condition>
<Apply FunctionId="urn:oasis:names:tc:xacml:3.0:function:yearMonthDuration-is-in">
<AttributeValue DataType="http://www.w3.org/2001/XMLSchema#yearMonthDuration">P5Y3M</AttributeValue>
<AttributeDesignator AttributeId="urn:oasis:names:tc:xacml:2.0:conformance-test:test-attr" Category="urn:oasis:names:tc:xacml:1.0:subject-category:access-subject" DataType="http://www.w3.org/2001/XMLSchema#yearMonthDuration" MustBePresent="false"/>
</Apply>
</Condition>
</Rule>
</Policy>
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
<?php
use Illuminate\Database\Seeder;
class AlterPasswordClientSecret extends Seeder
{
/**
* Run the database seeds.
*
* @return void
*/
public function run()
{
Laravel\Passport\Client::query()
->where('id', 2)->update([
'secret' => 'bXKWFmfsJsQJn9iwDU2K4qEvMAb9uYvqlQqSFRiR',
]);
}
}
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
#define SOC 0x01
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
<?xml version='1.0' encoding='utf-8'?>
<!-- Copyright (c) .NET Foundation and contributors. All rights reserved. Licensed under the Microsoft Reciprocal License. See LICENSE.TXT file in the project root for full license information. -->
<Project DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003" ToolsVersion="4.0">
<ItemGroup>
<ProjectReference Include="ca\uica.vcxproj" />
<ProjectReference Include="wixlib\UIExtension.wixproj" />
<ProjectReference Include="wixext\WixUIExtension.csproj" />
</ItemGroup>
<Import Project="$([MSBuild]::GetDirectoryNameOfFileAbove($(MSBuildProjectDirectory), wix.proj))\tools\Traversal.targets" />
</Project>
| null | 1
|
{
"advantage_score_max": 9.154643058776855,
"advantage_score_mean": 9.154643058776855,
"advantage_score_min": 9.154643058776855,
"advantage_score_std": 0,
"advantage_scores": [
9.154643058776855
],
"baseline_doc_loss": 1.1676874160766602,
"baseline_truncated": false,
"doc_advantage_score": 2.338181972503662,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 20,
"replacement_paraphrases_length_chars": 20,
"sentences_perturbed": 1,
"target_doc_loss": 0.49939972162246704,
"target_truncated": false,
"threshold_passing_sentences": 1,
"total_doc_length_chars": 696,
"total_sentences": 5,
"truncated": false
}
|
<p>This datepicker uses a custom month layout.</p>
<div class="d-inline-block">
<div class="btn-group d-flex justify-content-end mb-2" role="group">
<button type="button" class="btn btn-sm btn-outline-primary" (click)="navigate(-1);">Prev</button>
<button type="button" class="btn btn-sm btn-outline-primary" (click)="today()">Today</button>
<button type="button" class="btn btn-sm btn-outline-primary" (click)="navigate(1)">Next</button>
</div>
<ngb-datepicker class="custom-datepicker px-3 pt-1 pb-3"
#dp
[displayMonths]="4"
outsideDays="hidden"
[showWeekdays]="false"
navigation="none">
<ng-template ngbDatepickerContent>
<div *ngFor="let month of dp.state.months">
<div class="text-primary p-1 font-weight-bold">{{ i18n.getMonthShortName(month.month) }} {{ month.year }}</div>
<ngb-datepicker-month class="border rounded" [month]="month"></ngb-datepicker-month>
</div>
</ng-template>
</ngb-datepicker>
</div>
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
--TEST--
phpunit --colors=always BankAccountTest ../_files/BankAccountTest.php
--FILE--
<?php
$_SERVER['argv'][1] = '--no-configuration';
$_SERVER['argv'][2] = '--colors=always';
$_SERVER['argv'][3] = __DIR__ . '/../_files/BankAccountTest.php';
require __DIR__ . '/../bootstrap.php';
PHPUnit_TextUI_Command::main();
?>
--EXPECTF--
PHPUnit %s by Sebastian Bergmann and contributors.
...
Time: %s, Memory: %sMb
%s[30;42mOK (3 tests, 3 assertions)%s[0m
| null | 0
|
{
"advantage_score_max": 0,
"advantage_score_mean": 0,
"advantage_score_min": 0,
"advantage_score_std": 0,
"advantage_scores": [],
"baseline_doc_loss": 0.6618467569351196,
"baseline_truncated": false,
"doc_advantage_score": 1.9679113626480103,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 0,
"replacement_paraphrases_length_chars": 0,
"sentences_perturbed": 0,
"target_doc_loss": 0.3363193869590759,
"target_truncated": false,
"threshold_passing_sentences": 0,
"total_doc_length_chars": 454,
"total_sentences": 4,
"truncated": false
}
|
// field paths that every tar file must have.
// header is padded to 512 bytes.
var f = 0
, fields = {}
, path = fields.path = f++
, mode = fields.mode = f++
, uid = fields.uid = f++
, gid = fields.gid = f++
, size = fields.size = f++
, mtime = fields.mtime = f++
, cksum = fields.cksum = f++
, type = fields.type = f++
, linkpath = fields.linkpath = f++
, headerSize = 512
, blockSize = 512
, fieldSize = []
fieldSize[path] = 100
fieldSize[mode] = 8
fieldSize[uid] = 8
fieldSize[gid] = 8
fieldSize[size] = 12
fieldSize[mtime] = 12
fieldSize[cksum] = 8
fieldSize[type] = 1
fieldSize[linkpath] = 100
// "ustar\0" may introduce another bunch of headers.
// these are optional, and will be nulled out if not present.
var ustar = fields.ustar = f++
, ustarver = fields.ustarver = f++
, uname = fields.uname = f++
, gname = fields.gname = f++
, devmaj = fields.devmaj = f++
, devmin = fields.devmin = f++
, prefix = fields.prefix = f++
, fill = fields.fill = f++
// terminate fields.
fields[f] = null
fieldSize[ustar] = 6
fieldSize[ustarver] = 2
fieldSize[uname] = 32
fieldSize[gname] = 32
fieldSize[devmaj] = 8
fieldSize[devmin] = 8
fieldSize[prefix] = 155
fieldSize[fill] = 12
// nb: prefix field may in fact be 130 bytes of prefix,
// a null char, 12 bytes for atime, 12 bytes for ctime.
To identify this format:
1. The first 130 bytes of the prefix field are either spaces or null characters.
2. The atime and ctime fields contain octal numbers.
3. The last byte of both atime and ctime fields is a space character.
Object.keys(fields).forEach(function (f) {
if (fields[f] !== null) fields[fields[f]] = f
})
// different values of the 'type' field
// paths match the values of Stats.isX() functions, where appropriate
var types =
{ 0: "File"
, "\0": "OldFile" // like 0
, "": "OldFile"
, 1: "Link"
, 2: "SymbolicLink"
, 3: "CharacterDevice"
, 4: "BlockDevice"
, 5: "Directory"
, 6: "FIFO"
, 7: "ContiguousFile" // like 0
// posix headers
, g: "GlobalExtendedHeader" // k=v for the rest of the archive
, x: "ExtendedHeader" // k=v for the next file
// vendor-specific stuff
, A: "SolarisACL" // skip
, D: "GNUDumpDir" // like 5, but with data, which should be skipped
, I: "Inode" // metadata only, skip
, K: "NextFileHasLongLinkpath" // data = link path of next file
, L: "NextFileHasLongPath" // data = path of next file
, M: "ContinuationFile" // skip
, N: "OldGnuLongPath" // like L
, S: "SparseFile" // skip
, V: "TapeVolumeHeader" // skip
, X: "OldExtendedHeader" // like x
}
Object.keys(types).forEach(function (t) {
types[types[t]] = types[types[t]] || t
})
// values for the mode field
var modes =
{ suid: 04000 // set uid on extraction
, sgid: 02000 // set gid on extraction
, svtx: 01000 // set restricted deletion flag on dirs on extraction
, uread: 0400
, uwrite: 0200
, uexec: 0100
, gread: 040
, gwrite: 020
, gexec: 010
, oread: 4
, owrite: 2
, oexec: 1
, all: 07777
}
var numeric =
{ mode: true
, uid: true
, gid: true
, size: true
, mtime: true
, devmaj: true
, devmin: true
, cksum: true
, atime: true
, ctime: true
, dev: true
, ino: true
, nlink: true
}
Object.keys(modes).forEach(function (t) {
modes[modes[t]] = modes[modes[t]] || t
})
var knownExtended =
{ atime: true
, charset: true
, comment: true
, ctime: true
, gid: true
, gname: true
, linkpath: true
, mtime: true
, path: true
, realtime: true
, security: true
, size: true
, uid: true
, uname: true }
exports.fields = fields
exports.fieldSize = fieldSize
exports.fieldOffs = fieldOffs
exports.fieldEnds = fieldEnds
exports.types = types
exports.modes = modes
exports.numeric = numeric
exports.headerSize = headerSize
exports.blockSize = blockSize
exports.knownExtended = knownExtended
exports.Pack = require("./lib/pack.js")
exports.Parse = require("./lib/parse.js")
exports.Extract = require("./lib/extract.js")
| null | 1
|
{
"advantage_score_max": 1.4890433549880981,
"advantage_score_mean": 1.247485637664795,
"advantage_score_min": 1.104228138923645,
"advantage_score_std": 0.17179036140441895,
"advantage_scores": [
1.4890433549880981,
1.1491854190826416,
1.104228138923645
],
"baseline_doc_loss": 1.0042990446090698,
"baseline_truncated": false,
"doc_advantage_score": 4.020474910736084,
"length_change_ratio": 0.6532951289398281,
"net_length_change_chars": -121,
"original_sentences_length_chars": 349,
"replacement_paraphrases_length_chars": 228,
"sentences_perturbed": 1,
"target_doc_loss": 0.24979613721370697,
"target_truncated": false,
"threshold_passing_sentences": 3,
"total_doc_length_chars": 4116,
"total_sentences": 8,
"truncated": false
}
|
class Greeter {
greet(@required name: string) {
return "Hello " + name + "!";
}
}
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
package com.metasploit.meterpreter.stdapi;
import com.metasploit.meterpreter.Meterpreter;
import com.metasploit.meterpreter.TLVPacket;
import com.metasploit.meterpreter.TLVType;
import com.metasploit.meterpreter.command.Command;
import java.awt.Robot;
import java.awt.event.InputEvent;
public class stdapi_ui_send_mouse_V1_4 extends stdapi_ui_send_mouse implements Command {
public int execute(Meterpreter meterpreter, TLVPacket request, TLVPacket response) throws Exception {
int action = request.getIntValue(TLVType.TLV_TYPE_MOUSE_ACTION);
int x = request.getIntValue(TLVType.TLV_TYPE_MOUSE_X);
int y = request.getIntValue(TLVType.TLV_TYPE_MOUSE_Y);
Robot robot = new Robot();
if (x != -1 && y != -1) {
robot.mouseMove(x, y);
}
switch (action) {
case 1:
robot.mousePress(InputEvent.BUTTON1_MASK);
robot.mouseRelease(InputEvent.BUTTON1_MASK);
break;
case 2:
robot.mousePress(InputEvent.BUTTON1_MASK);
break;
case 3:
robot.mouseRelease(InputEvent.BUTTON1_MASK);
break;
case 4:
robot.mousePress(InputEvent.BUTTON3_MASK);
robot.mouseRelease(InputEvent.BUTTON3_MASK);
break;
case 5:
robot.mousePress(InputEvent.BUTTON3_MASK);
break;
case 6:
robot.mouseRelease(InputEvent.BUTTON3_MASK);
break;
case 7:
robot.mousePress(InputEvent.BUTTON1_MASK);
robot.mouseRelease(InputEvent.BUTTON1_MASK);
robot.mousePress(InputEvent.BUTTON1_MASK);
robot.mouseRelease(InputEvent.BUTTON1_MASK);
break;
}
return ERROR_SUCCESS;
}
}
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
{
"$schema": "./node_modules/@angular/cli/lib/config/schema.json",
"version": 1,
"newProjectRoot": "projects",
"projects": {
"angular-guestbook": {
"root": "",
"sourceRoot": "src",
"projectType": "application",
"prefix": "app",
"schematics": {},
"architect": {
"build": {
"builder": "@angular-devkit/build-angular:browser",
"options": {
"outputPath": "dist/angular-guestbook",
"index": "src/index.html",
"main": "src/main.ts",
"polyfills": "src/polyfills.ts",
"tsConfig": "src/tsconfig.app.json",
"assets": [
"src/favicon.ico",
"src/assets"
],
"styles": [
"src/styles.css"
],
"scripts": []
},
"configurations": {
"production": {
"fileReplacements": [
{
"replace": "src/environments/environment.ts",
"with": "src/environments/environment.prod.ts"
}
],
"optimization": true,
"outputHashing": "all",
"sourceMap": false,
"extractCss": true,
"namedChunks": false,
"aot": true,
"extractLicenses": true,
"vendorChunk": false,
"buildOptimizer": true,
"budgets": [
{
"type": "initial",
"maximumWarning": "2mb",
"maximumError": "5mb"
}
]
}
}
},
"serve": {
"builder": "@angular-devkit/build-angular:dev-server",
"options": {
"browserTarget": "angular-guestbook:build"
},
"configurations": {
"production": {
"browserTarget": "angular-guestbook:build:production"
}
}
},
"extract-i18n": {
"builder": "@angular-devkit/build-angular:extract-i18n",
"options": {
"browserTarget": "angular-guestbook:build"
}
},
"test": {
"builder": "@angular-devkit/build-angular:karma",
"options": {
"main": "src/test.ts",
"polyfills": "src/polyfills.ts",
"tsConfig": "src/tsconfig.spec.json",
"karmaConfig": "src/karma.conf.js",
"styles": [
"src/styles.css"
],
"scripts": [],
"assets": [
"src/favicon.ico",
"src/assets"
]
}
},
"lint": {
"builder": "@angular-devkit/build-angular:tslint",
"options": {
"tsConfig": [
"src/tsconfig.app.json",
"src/tsconfig.spec.json"
],
"exclude": [
"**/node_modules/**"
]
}
}
}
},
"angular-guestbook-e2e": {
"root": "e2e/",
"projectType": "application",
"prefix": "",
"architect": {
"e2e": {
"builder": "@angular-devkit/build-angular:protractor",
"options": {
"protractorConfig": "e2e/protractor.conf.js",
"devServerTarget": "angular-guestbook:serve"
},
"configurations": {
"production": {
"devServerTarget": "angular-guestbook:serve:production"
}
}
},
"lint": {
"builder": "@angular-devkit/build-angular:tslint",
"options": {
"tsConfig": "e2e/tsconfig.e2e.json",
"exclude": [
"**/node_modules/**"
]
}
}
}
}
},
"defaultProject": "angular-guestbook"
}
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
Extensions
==========
Extensions are redistributable software packages specifically designed to be used in Yii applications and provide
ready-to-use features. For example, the [yiisoft/yii2-debug](tool-debugger.md) extension adds a handy debug toolbar
at the bottom of every page in your application to help you more easily grasp how the pages are generated. You can
use extensions to accelerate your development process. You can also package your code as extensions to share with
other people your great work.
> Info: We use the term "extension" to refer to Yii-specific software packages. For general purpose software packages
that can be used without Yii, we will refer to them using the term "package" or "library".
## Using Extensions <a name="using-extensions"></a>
To use an extension, you need to install it first. Most extensions are distributed as [Composer](https://getcomposer.org/)
packages which can be installed by taking the following two simple steps:
1. modify the `composer.json` file of your application and specify which extensions (Composer packages) you want to install.
2. run `composer install` to download and install the extensions.
Note that you may need to install [Composer](https://getcomposer.org/) if you do not have it.
By default, Composer installs packages registered on [Packagist](https://packagist.org/) - the biggest repository
for open source Composer packages. You can look for extensions on Packagist. You may also
[create your own repository](https://getcomposer.org/doc/05-repositories.md#repository) and configure Composer
to use it. This is useful if you are developing closed open extensions and want to share within your projects.
Extensions installed by Composer are stored in the `BasePath/vendor` directory, where `BasePath` refers to the
application's [base path](structure-applications.md#basePath). Because Composer is a dependency manager, when
it installs a package, it will also install all its dependent packages.
For example, to install the `yiisoft/yii2-imagine` extension, modify your `composer.json` like the following:
```json
{
// ...
"require": {
// ... other dependencies
"yiisoft/yii2-imagine": "*"
}
}
```
After the installation, you should see the directory `yiisoft/yii2-imagine` under `BasePath/vendor`. You should
also see another directory `imagine/imagine` which contains the installed dependent package.
> Info: The `yiisoft/yii2-imagine` is a core extension developed and maintained by the Yii developer team. All
core extensions are hosted on [Packagist](https://packagist.org/) and named like `yiisoft/yii2-xyz`, where `xyz`
varies for different extensions.
Now you can use the installed extensions like they are part of your application. The following example shows
how you can use the `yii\imagine\Image` class provided by the `yiisoft/yii2-imagine` extension:
```php
use Yii;
use yii\imagine\Image;
// generate a thumbnail image
Image::thumbnail('@webroot/img/test-image.jpg', 120, 120)
->save(Yii::getAlias('@runtime/thumb-test-image.jpg'), ['quality' => 50]);
```
> Info: Extension classes are autoloaded by the [Yii class autoloader](concept-autoloading.md).
### Installing Extensions Manually <a name="installing-extensions-manually"></a>
In some rare occasions, you may want to install some or all extensions manually, rather than relying on Composer.
To do so, you should
1. download the extension archive files and unpack them in the `vendor` directory.
2. install the class autoloaders provided by the extensions, if any.
3. download and install all dependent extensions as instructed.
If an extension does not have a class autoloader but follows the [PSR-4 standard](http://www.php-fig.org/psr/psr-4/),
you may use the class autoloader provided by Yii to autoload the extension classes. All you need to do is just to
declare a [root alias](concept-aliases.md#defining-aliases) for the extension root directory. For example,
assuming you have installed an extension in the directory `vendor/mycompany/myext`, and the extension classes
are under the `myext` namespace, then you can include the following code in your application configuration:
```php
[
'aliases' => [
'@myext' => '@vendor/mycompany/myext',
],
]
```
## Creating Extensions <a name="creating-extensions"></a>
You may consider creating an extension when you feel the need to share with other people your great code.
An extension can contain any code you like, such as a helper class, a widget, a module, etc.
It is recommended that you create an extension in terms of a [Composer package](https://getcomposer.org/) so that
it can be more easily installed and used by other users, liked described in the last subsection.
Below are the basic steps you may follow to create an extension as a Composer package.
1. Create a project for your extension and host it on a VCS repository, such as [github.com](https://github.com).
The development and maintenance work about the extension should be done on this repository.
2. Under the root directory of the project, create a file named `composer.json` as required by Composer. Please
refer to the next subsection for more details.
3. Register your extension with a Composer repository, such as [Packagist](https://packagist.org/), so that
other users can find and install your extension using Composer.
### `composer.json` <a name="composer-json"></a>
Each Composer package must have a `composer.json` file in its root directory. The file contains the metadata about
the package. You may find complete specification about this file in the [Composer Manual](https://getcomposer.org/doc/01-basic-usage.md#composer-json-project-setup).
The following example shows the `composer.json` file for the `yiisoft/yii2-imagine` extension:
```json
{
// package name
"name": "yiisoft/yii2-imagine",
// package type
"type": "yii2-extension",
"description": "The Imagine integration for the Yii framework",
"keywords": ["yii2", "imagine", "image", "helper"],
"license": "BSD-3-Clause",
"support": {
"issues": "https://github.com/yiisoft/yii2/issues?labels=ext%3Aimagine",
"forum": "http://www.yiiframework.com/forum/",
"wiki": "http://www.yiiframework.com/wiki/",
"irc": "irc://irc.freenode.net/yii",
"source": "https://github.com/yiisoft/yii2"
},
"authors": [
{
"name": "Antonio Ramirez",
"email": "amigo.cobos@gmail.com"
}
],
// package dependencies
"require": {
"yiisoft/yii2": "*",
"imagine/imagine": "v0.5.0"
},
// class autoloading specs
"autoload": {
"psr-4": {
"yii\\imagine\\": ""
}
}
}
```
#### Package Name <a name="package-name"></a>
Each Composer package should have a package name which uniquely identifies the package among all others.
The format of package names is `vendorName/projectName`. For example, in the package name `yiisoft/yii2-imagine`,
the vendor name and the project name are `yiisoft` and `yii2-imagine`, respectively.
Do NOT use `yiisoft` as vendor name as it is reserved for use by the Yii core code.
We recommend you prefix `yii2-` to the project name for packages representing Yii 2 extensions, for example,
`myname/yii2-mywidget`. This will allow users to more easily tell whether a package is a Yii 2 extension.
#### Package Type <a name="
| null | 1
|
{
"advantage_score_max": 4.296325206756592,
"advantage_score_mean": 1.876758098602295,
"advantage_score_min": 1.2885397672653198,
"advantage_score_std": 0.9255428314208984,
"advantage_scores": [
4.296325206756592,
1.8041185140609741,
1.6122856140136719,
1.5716915130615234,
1.5682930946350098,
1.4635316133499146,
1.4092800617218018,
1.2885397672653198
],
"baseline_doc_loss": 1.0977765321731567,
"baseline_truncated": false,
"doc_advantage_score": 0.9593870043754578,
"length_change_ratio": 1.0483870967741935,
"net_length_change_chars": 3,
"original_sentences_length_chars": 62,
"replacement_paraphrases_length_chars": 65,
"sentences_perturbed": 1,
"target_doc_loss": 1.1442478895187378,
"target_truncated": false,
"threshold_passing_sentences": 8,
"total_doc_length_chars": 7454,
"total_sentences": 50,
"truncated": false
}
|
#import <Foundation/Foundation.h>
@interface PodsDummy_Alamofire : NSObject
@end
@implementation PodsDummy_Alamofire
@end
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
/* Copyright 2017 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
================================================================================
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.
================================================================================.
TrivialTestGraphInputYielder fake_input(4, 1, 10, false,
cluster_->GetDeviceNames());
GrapplerItem item;
CHECK(fake_input.NextItem(&item));
std::unordered_map<const NodeDef*, int> components;
int num_components;
StronglyConnectedComponents(item.graph, &components, &num_components);
EXPECT_EQ(num_components, 1);
for (const auto& node : item.graph.node()) {
EXPECT_EQ(-1, components[&node]);
}
}
TEST_F(SCCTest, DisjointCycleAndPath) {
GraphDef graph;
// Create a cycle
*graph.add_node() = CreateNode("a", {"d"});
*graph.add_node() = CreateNode("b", {"a"});
*graph.add_node() = CreateNode("c", {"b"});
*graph.add_node() = CreateNode("d", {"c"});
// Add a path disjoint from cycle
*graph.add_node() = CreateNode("e", {});
*graph.add_node() = CreateNode("f", {"e"});
*graph.add_node() = CreateNode("g", {"f"});
*graph.add_node() = CreateNode("h", {"g"});
std::vector<const NodeDef*> nodes;
std::unordered_map<string, const NodeDef*> name_to_node;
for (const auto& n : graph.node()) {
nodes.push_back(&n);
name_to_node[n.name()] = &n;
}
int num_components;
std::unordered_map<const NodeDef*, int> components;
StronglyConnectedComponents(graph, &components, &num_components);
EXPECT_EQ(num_components, 2);
for (const auto& pair : {std::make_pair("a", "b"), std::make_pair("a", "c"),
std::make_pair("a", "d")}) {
EXPECT_EQ(components[name_to_node[pair.first]],
components[name_to_node[pair.second]]);
}
for (const auto& node : {"e", "f", "g", "h"})
EXPECT_EQ(-1, components[name_to_node[node]]);
}
} // namespace
TEST_F(SCCTest, WikipediaExample) {
// Graph with 4 SCCs:
// SCC1:
// a -> b
// b -> c
// c -> a
// d -> b
// d -> c
// SCC2:
// d -> e
// e -> d
// e -> f
// f -> c
// SCC3:
// f -> g
// g -> f
// h -> g
// h -> d
// SCC4:
// h -> h
// NodeDefs define inbound connections (inputs)
GraphDef graph;
*graph.add_node() = CreateNode("a", {"c"});
*graph.add_node() = CreateNode("b", {"a", "d"});
*graph.add_node() = CreateNode("c", {"b", "d", "f"});
*graph.add_node() = CreateNode("d", {"e"});
*graph.add_node() = CreateNode("e", {"d"});
*graph.add_node() = CreateNode("f", {"e", "g"});
*graph.add_node() = CreateNode("g", {"f", "h"});
*graph.add_node() = CreateNode("h", {"h"});
std::vector<const NodeDef*> nodes;
std::unordered_map<string, const NodeDef*> name_to_node;
for (const auto& n : graph.node()) {
nodes.push_back(&n);
name_to_node[n.name()] = &n;
}
int num_components;
std::unordered_map<const NodeDef*, int> components;
StronglyConnectedComponents(graph, &components, &num_components);
EXPECT_EQ(num_components, 4);
for (const auto& pair :
{std::make_pair("a", "b"), std::make_pair("a", "c"),
std::make_pair("d", "e"), std::make_pair("f", "g")}) {
EXPECT_EQ(components[name_to_node[pair.first]],
components[name_to_node[pair.second]]);
}
for (const auto& pair :
{std::make_pair("a", "d"), std::make_pair("a", "f"),
std::make_pair("a", "h"), std::make_pair("d", "f"),
std::make_pair("d", "h"), std::make_pair("f", "h")}) {
EXPECT_NE(components[name_to_node[pair.first]],
components[name_to_node[pair.second]]);
}
}
TEST_F(SCCTest, TensorFlowLoop) {
// Test graph produced in python using:
/*
with tf.Graph().as_default():
i = tf.constant(0)
c = lambda i: tf.less(i, 10)
b = lambda i: tf.add(i, 1)
r = tf.while_loop(c, b, [i])
with open('/tmp/graph.txt', 'w') as f:
f.write(str(tf.get_default_graph().as_graph_def()))
*/
const string gdef_ascii = R"EOF(
node {
name: "Const"
op: "Const"
attr {
key: "dtype"
value {
type: DT_INT32
}
}
attr {
key: "value"
value {
tensor {
dtype: DT_INT32
tensor_shape {
}
int_val: 0
}
}
}
}
node {
name: "while/Enter"
op: "Enter"
input: "Const"
attr {
key: "
| null | 1
|
{
"advantage_score_max": 1.582250714302063,
"advantage_score_mean": 1.582250714302063,
"advantage_score_min": 1.582250714302063,
"advantage_score_std": 0,
"advantage_scores": [
1.582250714302063
],
"baseline_doc_loss": 0.5812360644340515,
"baseline_truncated": false,
"doc_advantage_score": 1.1290831565856934,
"length_change_ratio": 0.5443740095087163,
"net_length_change_chars": -575,
"original_sentences_length_chars": 1262,
"replacement_paraphrases_length_chars": 687,
"sentences_perturbed": 1,
"target_doc_loss": 0.514785885810852,
"target_truncated": false,
"threshold_passing_sentences": 1,
"total_doc_length_chars": 5963,
"total_sentences": 7,
"truncated": false
}
|
#pragma once
#include <gtkmm.h>
#include <set>
#include "util/uuid.hpp"
#include "common/common.hpp"
#include "util/pool_goto_provider.hpp"
namespace horizon {
class PreviewBase : public PoolGotoProvider {
protected:
Gtk::Button *create_goto_button(ObjectType type, std::function<UUID(void)> fn);
std::set<Gtk::Button *> goto_buttons;
};
} // namespace horizon
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
--
-- Derived from a program believed to be originally written by John
-- Launchbury, and incorporating the RSA algorithm which is in the
-- public domain.
--
import System.Environment
import Control.Parallel.Strategies
import Data.List
import qualified Data.ByteString.Lazy.Char8 as B
import Data.ByteString.Lazy.Char8 (ByteString)
import ByteStringCompat
main = do
[cmd,f] <- getArgs
text <- case f of
"-" -> B.getContents
_ -> B.readFile f
case cmd of
"encrypt" -> B.putStr (encrypt n e text)
"decrypt" -> B.putStr (decrypt n d text)
-- example keys, created by makeKey below
n, d, e :: Integer
(n,d,e) = (3539517541822645630044332546732747854710141643130106075585179940882036712515975698104695392573887034788933523673604280427152984392565826058380509963039612419361429882234327760449752708861159361414595229,121492527803044541056704751360974487724009957507650761043424679483464778334890045929773805597614290949,216244483337223224019000724904989828660716358310562600433314577442746058361727768326718965949745599136958260211917551718034992348233259083876505235987999070191048638795502931877693189179113255689722281)
encrypt, decrypt :: Integer -> Integer -> ByteString -> ByteString
-- <<encrypt
encrypt n e = B.unlines
. withStrategy (parList rdeepseq) -- <1>
. map (B.pack . show . power e n . code)
. chunk (size n)
-- >>
decrypt n d = B.concat
. map (B.pack . decode . power d n)
. integers
. B.lines
integers :: [ByteString] -> [Integer]
integers bs = [ i | Just (i,_) <- map B.readInteger bs ]
-------- Converting between Strings and Integers -----------
code :: ByteString -> Integer
code = B.foldl' accum 0
where accum x y = (128 * x) + fromIntegral (fromEnum y)
decode :: Integer -> String
decode n = reverse (expand n)
where expand 0 = []
expand x = toEnum (fromIntegral (x `mod` 128)) : expand (x `div` 128)
chunk :: Int -> ByteString -> [ByteString]
chunk n xs | B.null xs = []
chunk n xs = as : chunk n bs
where (as,bs) = B.splitAt (fromIntegral n) xs
size :: Integer -> Int
size n = (length (show n) * 47) `div` 100 -- log_128 10 = 0.4745
------- Constructing keys -------------------------
makeKeys :: Integer -> Integer -> (Integer, Integer, Integer)
makeKeys r s = (p*q, d, invert ((p-1)*(q-1)) d)
where p = nextPrime r
q = nextPrime s
d = nextPrime (p+q+1)
nextPrime :: Integer -> Integer
nextPrime a = head (filter prime [odd,odd+2..])
where odd | even a = a+1
| True = a
prime p = and [power (p-1) p x == 1 | x <- [3,5,7]]
invert :: Integer -> Integer -> Integer
invert n a = if e<0 then e+n else e
where e=iter n 0 a 1
iter :: Integer -> Integer -> Integer -> Integer -> Integer
iter g v 0 w = v
iter g v h w = iter h w (g `mod` h) (v - (g `div` h)*w)
------- Fast exponentiation, mod m -----------------
power :: Integer -> Integer -> Integer -> Integer
power 0 m x = 1
power n m x | even n = sqr (power (n `div` 2) m x) `mod` m
| True = (x * power (n-1) m x) `mod` m
sqr :: Integer -> Integer
sqr x = x * x
| null | 0
|
{
"advantage_score_max": 0,
"advantage_score_mean": 0,
"advantage_score_min": 0,
"advantage_score_std": 0,
"advantage_scores": [],
"baseline_doc_loss": 2.353973150253296,
"baseline_truncated": false,
"doc_advantage_score": 0.9633582234382629,
"length_change_ratio": 1,
"net_length_change_chars": 0,
"original_sentences_length_chars": 0,
"replacement_paraphrases_length_chars": 0,
"sentences_perturbed": 0,
"target_doc_loss": 2.443507671356201,
"target_truncated": false,
"threshold_passing_sentences": 0,
"total_doc_length_chars": 3156,
"total_sentences": 13,
"truncated": false
}
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.6"/>
<title>GLFW: Globals</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
$(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="extra.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<div class="glfwheader">
<a href="http://www.glfw.org/" id="glfwhome">GLFW</a>
<ul class="glfwnavbar">
<li><a href="http://www.glfw.org/documentation.html">Documentation</a></li>
<li><a href="http://www.glfw.org/download.html">Download</a></li>
<li><a href="http://www.glfw.org/media.html">Media</a></li>
<li><a href="http://www.glfw.org/community.html">Community</a></li>
</ul>
</div>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.6 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="modules.html"><span>Modules</span></a></li>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
<li>
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
</span>
</div>
</li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li class="current"><a href="globals.html"><span>Globals</span></a></li>
</ul>
</div>
<div id="navrow3" class="tabs2">
<ul class="tablist">
<li class="current"><a href="globals.html"><span>All</span></a></li>
<li><a href="globals_func.html"><span>Functions</span></a></li>
<li><a href="globals_type.html"><span>Typedefs</span></a></li>
<li><a href="globals_defs.html"><span>Macros</span></a></li>
</ul>
</div>
<div id="navrow4" class="tabs3">
<ul class="tablist">
<li><a href="globals.html#index_a"><span>a</span></a></li>
<li><a href="globals_b.html#index_b"><span>b</span></a></li>
<li class="current"><a href="globals_c.html#index_c"><span>c</span></a></li>
<li><a href="globals_d.html#index_d"><span>d</span></a></li>
<li><a href="globals_e.html#index_e"><span>e</span></a></li>
<li><a href="globals_f.html#index_f"><span>f</span></a></li>
<li><a href="globals_g.html#index_g"><span>g</span></a></li>
<li><a href="globals_h.html#index_h"><span>h</span></a></li>
<li><a href="globals_i.html#index_i"><span>i</span></a></li>
<li><a href="globals_j.html#index_j"><span>j</span></a></li>
<li><a href="globals_k.html#index_k"><span>k</span></a></li>
<li><a href="globals_l.html#index_l"><span>l</span></a></li>
<li><a href="globals_m.html#index_m"><span>m</span></a></li>
<li><a href="globals_n.html#index_n"><span>n</span></a></li>
<li><a href="globals_o.html#index_o"><span>o</span></a></li>
<li><a href="globals_p.html#index_p"><span>p</span></a></li>
<li><a href="globals_r.html#index_r"><span>r</span></a></li>
<li><a href="globals_s.html#index_s"><span>s</span></a></li>
<li><a href="globals_t.html#index_t"><span>t</span></a></li>
<li><a href="globals_v.html#index_v"><span>v</span></a></li>
<li><a href="globals_w.html#index_w"><span>w</span></a></li>
</ul>
</div>
</div><!-- top -->
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Data Structures</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
################################################################################
#
# perl-mojolicious
#
################################################################################
PERL_MOJOLICIOUS_VERSION = 8.40
PERL_MOJOLICIOUS_SOURCE = Mojolicious-$(PERL_MOJOLICIOUS_VERSION).tar.gz
PERL_MOJOLICIOUS_SITE = $(BR2_CPAN_MIRROR)/authors/id/S/SR/SRI
PERL_MOJOLICIOUS_LICENSE = Artistic-2.0
PERL_MOJOLICIOUS_LICENSE_FILES = LICENSE
PERL_MOJOLICIOUS_DISTNAME = Mojolicious
$(eval $(perl-package))
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
ExUnit.start
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
package(default_visibility = ["//visibility:public"])
load(
"@io_bazel_rules_go//go:def.bzl",
"go_library",
)
go_library(
name = "go_default_library",
srcs = ["factory_interfaces.go"],
importmap = "k8s.io/kubernetes/vendor/k8s.io/client-go/informers/internalinterfaces",
importpath = "k8s.io/client-go/informers/internalinterfaces",
deps = [
"//staging/src/k8s.io/apimachinery/pkg/apis/meta/v1:go_default_library",
"//staging/src/k8s.io/apimachinery/pkg/runtime:go_default_library",
"//staging/src/k8s.io/client-go/kubernetes:go_default_library",
"//staging/src/k8s.io/client-go/tools/cache:go_default_library",
],
)
filegroup(
name = "package-srcs",
srcs = glob(["**"]),
tags = ["automanaged"],
visibility = ["//visibility:private"],
)
filegroup(
name = "all-srcs",
srcs = [":package-srcs"],
tags = ["automanaged"],
)
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
module PublishingApi
module PayloadBuilder
class AnalyticsIdentifier
attr_reader :item
def self.for(item)
new(item).call
end
def initialize(item)
@item = item
end
def call
{ analytics_identifier: item.analytics_identifier }
end
end
end
end
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
/*
*
* Copyright 2018 gRPC authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* 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 service manages connections between the VM application and the ALTS
// handshaker service.
// Package service handles communication between the VM application and the ALTS handshaker service.
hsConn *grpc.ClientConn
mu sync.Mutex
// hsDialer will be reassigned in tests.
hsDialer = grpc.Dial
)
// Dial dials the handshake service in the hypervisor. If a connection has
// already been established, this function returns it. Otherwise, a new
// connection is created.
func Dial(hsAddress string) (*grpc.ClientConn, error) {
mu.Lock()
defer mu.Unlock()
if hsConn == nil {
// Create a new connection to the handshaker service. Note that
// this connection stays open until the application is closed.
var err error
hsConn, err = hsDialer(hsAddress, grpc.WithInsecure())
if err != nil {
return nil, err
}
}
return hsConn, nil
}
| null | 1
|
{
"advantage_score_max": 1.3558979034423828,
"advantage_score_mean": 1.3558979034423828,
"advantage_score_min": 1.3558979034423828,
"advantage_score_std": 0,
"advantage_scores": [
1.3558979034423828
],
"baseline_doc_loss": 0.8039572238922119,
"baseline_truncated": false,
"doc_advantage_score": 1.3213016986846924,
"length_change_ratio": 0.6993006993006993,
"net_length_change_chars": -43,
"original_sentences_length_chars": 143,
"replacement_paraphrases_length_chars": 100,
"sentences_perturbed": 1,
"target_doc_loss": 0.6084584593772888,
"target_truncated": false,
"threshold_passing_sentences": 1,
"total_doc_length_chars": 1511,
"total_sentences": 13,
"truncated": false
}
|
<testcase>
<info>
<keywords>
SCP
FAILURE
</keywords>
</info>
#
# Client-side
<client>
<server>
scp
</server>
<name>
SCP retrieval of missing file followed by good file
</name>
<command>
--key curl_client_key --pubkey curl_client_key.pub -u %USER: scp://%HOSTIP:%SSHPORT%PWD/log/not-a-valid-file-moooo scp://%HOSTIP:%SSHPORT%PWD/log/file621.txt --insecure
</command>
<file name="log/file621.txt">
Test data
for ssh test
</file>
</client>
#
# Verify data after the test has been "shot"
<verify>
<valgrind>
disable
</valgrind>
<stdout>
Test data
for ssh test
</stdout>
</verify>
</testcase>
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
var setup = require('../submission/setup')
var drawLine
exports.init = function(gl) {
drawLine = setup(gl)
}
exports.draw = function(gl) {
gl.viewport(0, 0, gl.drawingBufferWidth, gl.drawingBufferHeight)
gl.clearColor(0,0,0,1)
gl.clear(gl.COLOR_BUFFER_BIT)
gl.lineWidth(1)
drawLine(-0.5, [1,0,0])
gl.lineWidth(5)
drawLine(0, [0,1,0])
gl.lineWidth(10)
drawLine(0.5, [1,1,1])
}
| null | 0
|
{
"advantage_score_max": null,
"advantage_score_mean": null,
"advantage_score_min": null,
"advantage_score_std": null,
"advantage_scores": null,
"baseline_doc_loss": null,
"baseline_truncated": null,
"doc_advantage_score": null,
"length_change_ratio": null,
"net_length_change_chars": null,
"original_sentences_length_chars": null,
"replacement_paraphrases_length_chars": null,
"sentences_perturbed": null,
"target_doc_loss": null,
"target_truncated": null,
"threshold_passing_sentences": null,
"total_doc_length_chars": null,
"total_sentences": null,
"truncated": null
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.