text
stringlengths 2
100k
| meta
dict |
|---|---|
// 20.2.2.5 Math.asinh(x)
var $export = require('./_export')
, $asinh = Math.asinh;
function asinh(x){
return !isFinite(x = +x) || x == 0 ? x : x < 0 ? -asinh(-x) : Math.log(x + Math.sqrt(x * x + 1));
}
// Tor Browser bug: Math.asinh(0) -> -0
$export($export.S + $export.F * !($asinh && 1 / $asinh(0) > 0), 'Math', {asinh: asinh}); | {
"pile_set_name": "Github"
} |
/*
* Copyright Andrey Semashev 2007 - 2015.
* Distributed under the Boost Software License, Version 1.0.
* (See accompanying file LICENSE_1_0.txt or copy at
* http://www.boost.org/LICENSE_1_0.txt)
*/
/*!
* \file has_attr.hpp
* \author Andrey Semashev
* \date 23.07.2012
*
* The header contains implementation of a generic attribute presence checker in template expressions.
*/
#ifndef BOOST_LOG_EXPRESSIONS_PREDICATES_HAS_ATTR_HPP_INCLUDED_
#define BOOST_LOG_EXPRESSIONS_PREDICATES_HAS_ATTR_HPP_INCLUDED_
#include <boost/phoenix/core/actor.hpp>
#include <boost/log/detail/config.hpp>
#include <boost/log/core/record_view.hpp>
#include <boost/log/attributes/attribute_name.hpp>
#include <boost/log/attributes/attribute_value_set.hpp>
#include <boost/log/attributes/value_visitation.hpp>
#include <boost/log/expressions/keyword_fwd.hpp>
#include <boost/log/detail/unary_function_terminal.hpp>
#include <boost/log/utility/functional/nop.hpp>
#include <boost/log/detail/header.hpp>
#ifdef BOOST_HAS_PRAGMA_ONCE
#pragma once
#endif
namespace boost {
BOOST_LOG_OPEN_NAMESPACE
namespace expressions {
/*!
* An attribute value presence checker.
*/
template< typename T >
class has_attribute
{
public:
//! Function result_type
typedef bool result_type;
//! Expected attribute value type
typedef T value_type;
private:
//! Attribute value name
const attribute_name m_name;
//! Visitor invoker
value_visitor_invoker< value_type > m_visitor_invoker;
public:
/*!
* Initializing constructor
*
* \param name Attribute name
*/
explicit has_attribute(attribute_name const& name) : m_name(name)
{
}
/*!
* Checking operator
*
* \param arg A set of attribute values or a log record
* \return \c true if the log record contains the sought attribute value, \c false otherwise
*/
template< typename ArgT >
result_type operator() (ArgT const& arg) const
{
return m_visitor_invoker(m_name, arg, nop()).code() == visitation_result::ok;
}
};
/*!
* An attribute value presence checker. This specialization does not check the type of the attribute value.
*/
template< >
class has_attribute< void >
{
public:
//! Function result_type
typedef bool result_type;
//! Expected attribute value type
typedef void value_type;
private:
//! Attribute name
const attribute_name m_name;
public:
/*!
* Initializing constructor
*
* \param name Attribute name
*/
explicit has_attribute(attribute_name const& name) : m_name(name)
{
}
/*!
* Checking operator
*
* \param attrs A set of attribute values
* \return \c true if the log record contains the sought attribute value, \c false otherwise
*/
result_type operator() (attribute_value_set const& attrs) const
{
return attrs.find(m_name) != attrs.end();
}
/*!
* Checking operator
*
* \param rec A log record
* \return \c true if the log record contains the sought attribute value, \c false otherwise
*/
result_type operator() (boost::log::record_view const& rec) const
{
return operator()(rec.attribute_values());
}
};
/*!
* The function generates a terminal node in a template expression. The node will check for the attribute value
* presence in a log record. The node will also check that the attribute value has the specified type, if present.
*/
template< typename AttributeValueT >
BOOST_FORCEINLINE phoenix::actor< aux::unary_function_terminal< has_attribute< AttributeValueT > > > has_attr(attribute_name const& name)
{
typedef aux::unary_function_terminal< has_attribute< AttributeValueT > > terminal_type;
phoenix::actor< terminal_type > act = {{ terminal_type(name) }};
return act;
}
/*!
* The function generates a terminal node in a template expression. The node will check for the attribute value
* presence in a log record.
*/
BOOST_FORCEINLINE phoenix::actor< aux::unary_function_terminal< has_attribute< void > > > has_attr(attribute_name const& name)
{
typedef aux::unary_function_terminal< has_attribute< void > > terminal_type;
phoenix::actor< terminal_type > act = {{ terminal_type(name) }};
return act;
}
/*!
* The function generates a terminal node in a template expression. The node will check for the attribute value
* presence in a log record. The node will also check that the attribute value has the specified type, if present.
*/
template< typename DescriptorT, template< typename > class ActorT >
BOOST_FORCEINLINE ActorT< aux::unary_function_terminal< has_attribute< typename DescriptorT::value_type > > > has_attr(attribute_keyword< DescriptorT, ActorT > const&)
{
typedef aux::unary_function_terminal< has_attribute< typename DescriptorT::value_type > > terminal_type;
ActorT< terminal_type > act = {{ terminal_type(DescriptorT::get_name()) }};
return act;
}
} // namespace expressions
BOOST_LOG_CLOSE_NAMESPACE // namespace log
} // namespace boost
#include <boost/log/detail/footer.hpp>
#endif // BOOST_LOG_EXPRESSIONS_PREDICATES_HAS_ATTR_HPP_INCLUDED_
| {
"pile_set_name": "Github"
} |
print "sample\\path\\foo.cpp"
| {
"pile_set_name": "Github"
} |
# Licensed to the Apache Software Foundation (ASF) under one
# or more contributor license agreements. See the NOTICE file
# distributed with this work for additional information
# regarding copyright ownership. The ASF licenses this file
# to you under the Apache License, Version 2.0 (the
# "License"); you may not use this file except in compliance
# with the License. You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
#
#
# Unless required by applicable law or agreed to in writing,
# software distributed under the License is distributed on an
# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
# KIND, either express or implied. See the License for the
# specific language governing permissions and limitations
# under the License.
from aliyunsdkcore.request import RpcRequest
class TransferInCheckMailTokenRequest(RpcRequest):
def __init__(self):
RpcRequest.__init__(self, 'Domain-intl', '2017-12-18', 'TransferInCheckMailToken','domain')
def get_UserClientIp(self):
return self.get_query_params().get('UserClientIp')
def set_UserClientIp(self,UserClientIp):
self.add_query_param('UserClientIp',UserClientIp)
def get_Lang(self):
return self.get_query_params().get('Lang')
def set_Lang(self,Lang):
self.add_query_param('Lang',Lang)
def get_Token(self):
return self.get_query_params().get('Token')
def set_Token(self,Token):
self.add_query_param('Token',Token) | {
"pile_set_name": "Github"
} |
import * as React from 'react';
import { observer } from 'mobx-react';
import Item from './Item';
import ShowMore from './ShowMore';
interface OverviewProps {
gitStatus: VpApi.GetGitStatusResponse;
}
interface OverviewState {
isExpanded: boolean;
}
@observer
export default class Overview extends React.Component<OverviewProps, OverviewState> {
private static displayedListLength: number = 5;
state = {
isExpanded: false,
};
onShowMoreClick = () => {
this.setState({
isExpanded: true,
});
}
render() {
const { gitStatus } = this.props;
const { isExpanded } = this.state;
const displayedListLength = Overview.displayedListLength;
const lines = isExpanded
? gitStatus
: gitStatus.slice(0, displayedListLength);
return (
<div className='CommitPanel-overview'>
<ul>
{lines.map((line, i) => (
<Item
actionShortcut={line[0]}
info={line[1]}
key={i}
/>
))}
{(gitStatus.length > displayedListLength && !isExpanded) &&
<ShowMore
displayNumber={gitStatus.length - displayedListLength}
onClick={this.onShowMoreClick}
/>
}
</ul>
</div>
);
}
}
| {
"pile_set_name": "Github"
} |
// -*- C++ -*-
//===--------------------------- cwctype ----------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
#ifndef _LIBCPP_CWCTYPE
#define _LIBCPP_CWCTYPE
/*
cwctype synopsis
Macros:
WEOF
namespace std
{
Types:
wint_t
wctrans_t
wctype_t
int iswalnum(wint_t wc);
int iswalpha(wint_t wc);
int iswblank(wint_t wc); // C99
int iswcntrl(wint_t wc);
int iswdigit(wint_t wc);
int iswgraph(wint_t wc);
int iswlower(wint_t wc);
int iswprint(wint_t wc);
int iswpunct(wint_t wc);
int iswspace(wint_t wc);
int iswupper(wint_t wc);
int iswxdigit(wint_t wc);
int iswctype(wint_t wc, wctype_t desc);
wctype_t wctype(const char* property);
wint_t towlower(wint_t wc);
wint_t towupper(wint_t wc);
wint_t towctrans(wint_t wc, wctrans_t desc);
wctrans_t wctrans(const char* property);
} // std
*/
#include <__config>
#include <cctype>
#include <wctype.h>
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
#pragma GCC system_header
#endif
_LIBCPP_BEGIN_NAMESPACE_STD
using ::wint_t;
using ::wctrans_t;
using ::wctype_t;
using ::iswalnum;
using ::iswalpha;
using ::iswblank;
using ::iswcntrl;
using ::iswdigit;
using ::iswgraph;
using ::iswlower;
using ::iswprint;
using ::iswpunct;
using ::iswspace;
using ::iswupper;
using ::iswxdigit;
using ::iswctype;
using ::wctype;
using ::towlower;
using ::towupper;
using ::towctrans;
using ::wctrans;
_LIBCPP_END_NAMESPACE_STD
#endif // _LIBCPP_CWCTYPE
| {
"pile_set_name": "Github"
} |
#!/usr/bin/env bash
# Copyright 2016 The Kubernetes 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.
# This volume is assumed to exist and is shared with the peer-finder
# init container. It contains on-start/change configuration scripts.
WORKDIR_VOLUME="/work-dir"
for i in "$@"; do
case "$i" in
-w=*|--work-dir=*)
WORKDIR_VOLUME="${i#*=}"
shift
;;
*)
# unknown option
;;
esac
done
echo Installing config scripts into "${WORKDIR_VOLUME}"
mkdir -p "${WORKDIR_VOLUME}"
cp /peer-finder "${WORKDIR_VOLUME}"/
| {
"pile_set_name": "Github"
} |
{
"expr": "$round(4.515, 2)",
"dataset": null,
"bindings": {},
"result": 4.52
} | {
"pile_set_name": "Github"
} |
/**
@page WWDG_Example Window Watchdog example
@verbatim
******************** (C) COPYRIGHT 2017 STMicroelectronics *******************
* @file WWDG/WWDG_Example/readme.txt
* @author MCD Application Team
* @brief Description of the Window Watchdog example.
******************************************************************************
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* 3. Neither the name of STMicroelectronics nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
******************************************************************************
@endverbatim
@par Example Description
This example guides you through the different configuration steps by means of the
HAL API to perform periodic WWDG counter update and simulate a software fault that
generates an MCU WWDG reset when a predefined time period has elapsed.
At the beginning of the main program the HAL_Init() function is called to reset
all the peripherals, initialize the Flash interface and the systick.
Then the SystemClock_Config() function is used to configure the system
clock (SYSCLK) to run at 180 MHz.
The WWDG peripheral configuration is ensured by the HAL_WWDG_Init() function.
This later is calling the HAL_WWDG_MspInit()function which core is implementing
the configuration of the needed WWDG resources according to the used hardware (CLOCK,
GPIO, DMA and NVIC). You may update this function to change WWDG configuration.
The WWDG timeout is set, through counter value, to 47 ms.
The refresh window is set in order to make user wait 33 ms after a wadchdog refresh,
before writing again counter. Hence the WWDG counter is refreshed each (33 + 1) ms in the
main program infinite loop to prevent a WWDG reset.
LED3 is also toggled each 37ms indicating that the program is running.
An EXTI Line is connected to a GPIO pin, and configured to generate an interrupt
on the rising edge of the signal.
The EXTI Line is used to simulate a software failure: once the EXTI Line event
occurs by pressing the User push-button (PC.13), the corresponding interrupt is served.
In the ISR, a write to invalid address generates a Hardfault exception containing
an infinite loop and preventing to return to main program (the WWDG counter is
not refreshed).
As a result, when the WWDG counter falls to 63, the WWDG reset occurs.
If the WWDG reset is generated, after the system resumes from reset, LED1 is turned ON.
If the EXTI Line event does not occur, the WWDG counter is indefinitely refreshed
in the main program infinite loop, and there is no WWDG reset.
LED3 is turned ON and remains ON if any error occurs.
@note This example must be tested in standalone mode (not in debug).
@note Care must be taken when using HAL_Delay(), this function provides accurate
delay (in milliseconds) based on variable incremented in SysTick ISR. This
implies that if HAL_Delay() is called from a peripheral ISR process, then
the SysTick interrupt must have higher priority (numerically lower)
than the peripheral interrupt. Otherwise the caller ISR process will be blocked.
To change the SysTick interrupt priority you have to use HAL_NVIC_SetPriority() function.
@note The application needs to ensure that the SysTick time base is always set to 1 millisecond
to have correct HAL operation.
@par Keywords
System, WWDG, Downcounter, MCU Reset, Timeout, Software fault
@par Directory contents
- WWDG/WWDG_Example/Inc/stm32f4xx_hal_conf.h HAL configuration file
- WWDG/WWDG_Example/Inc/stm32f4xx_it.h Interrupt handlers header file
- WWDG/WWDG_Example/Inc/main.h Header for main.c module
- WWDG/WWDG_Example/Src/stm32f4xx_it.c Interrupt handlers
- WWDG/WWDG_Example/Src/main.c Main program
- WWDG/WWDG_Example/Src/stm32f4xx_hal_msp.c HAL MSP file
- WWDG/WWDG_Example/Src/system_stm32f4xx.c STM32F4xx system source file
@par Hardware and Software environment
- This example runs on STM32F446xx devices.
- This example has been tested with STM32446E-EVAL board and can be
easily tailored to any other supported device and development board.
@par How to use it ?
In order to make the program work, you must do the following :
- Open your preferred toolchain
- Rebuild all files and load your image into target memory
- Run the example
* <h3><center>© COPYRIGHT STMicroelectronics</center></h3>
*/
| {
"pile_set_name": "Github"
} |
<?php
/**
* JBZoo Application
*
* This file is part of the JBZoo CCK package.
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*
* @package Application
* @license GPL-2.0
* @copyright Copyright (C) JBZoo.com, All rights reserved.
* @link https://github.com/JBZoo/JBZoo
* @author Denis Smetannikov <[email protected]>
*/
// no direct access
defined('_JEXEC') or die('Restricted access');
?>
<div class="uk-grid">
<div id="sidebar" class="uk-width-1-6">
<?php echo $this->partial('navigation'); ?>
</div>
<div class="uk-width-4-6">
<h2><?php echo JText::_('JBZOO_ADMIN_TITLE_CART_' . $this->task); ?></h2>
<?php echo $this->partial('cartdesc'); ?>
<?php echo $this->partial('editpositions', array(
'positions' => $this->positions,
'groupList' => $this->groupList,
));?>
<?php echo $this->partial('footer'); ?>
</div>
<div id="right-sidebar" class="uk-width-1-6">
<?php echo $this->partial('right'); ?>
</div>
</div>
| {
"pile_set_name": "Github"
} |
package droidefense.sdk;
import droidefense.sdk.manifest.UsesPermission;
import java.io.Serializable;
import java.util.*;
public class OutPutResult extends HashMap<String, String> implements Serializable {
private static final HashSet<String> globalPermissionList = load();
private static final String[] harmlessPermission = {
"android.permission.ACCESS_SURFACE_FLINGER",
"android.permission.ACCOUNT_MANAGER",
"android.permission.ADD_VOICEMAIL",
"android.permission.CONTROL_LOCATION_UPDATES",
"android.permission.DEVICE_POWER",
"android.permission.EXPAND_STATUS_BAR",
"android.permission.FLASHLIGHT",
"android.permission.FORCE_BACK",
"android.permission.GET_PACKAGE_SIZE",
"android.permission.GET_TOP_ACTIVITY_INFO",
"android.permission.GLOBAL_SEARCH",
"android.permission.INSTALL_SHORTCUT",
"android.permission.MANAGE_DOCUMENTS",
"android.permission.MEDIA_CONTENT_CONTROL",
"android.permission.MODIFY_AUDIO_SETTINGS",
"android.permission.READ_USER_DICTIONARY",
"android.permission.REORDER_TASKS",
"android.permission.SEND_RESPOND_VIA_MESSAGE",
"android.permission.SET_ALARM",
"android.permission.SET_ANIMATION_SCALE",
"android.permission.SET_ORIENTATION",
"android.permission.SET_POINTER_SPEED",
"android.permission.SET_TIME",
"android.permission.SET_TIME_ZONE",
"android.permission.SET_WALLPAPER",
"android.permission.UNINSTALL_SHORTCUT",
"android.permission.VIBRATE",
"android.permission.WAKE_LOCK",
"android.permission.WRITE_CALENDAR",
"android.permission.WRITE_CALL_LOG",
"android.permission.WRITE_CONTACTS",
"android.permission.WRITE_USER_DICTIONARY"
};
private static final String[] canStealDataPermissions = {
"android.permission.ACCESS_FINE_LOCATION",
"android.permission.ACCESS_COARSE_LOCATION",
"android.permission.ACCESS_LOCATION_EXTRA_COMMANDS",
"android.permission.ACCESS_MOCK_LOCATION",
"android.permission.ACCESS_WIFI_STATE",
"android.permission.CAMERA",
"android.permission.CAPTURE_AUDIO_OUTPUT",
"android.permission.CAPTURE_SECURE_VIDEO_OUTPUT",
"android.permission.CAPTURE_VIDEO_OUTPUT",
"android.permission.DIAGNOSTIC",
"android.permission.DUMP",
"android.permission.GET_ACCOUNTS",
"android.permission.GET_TASKS",
"android.permission.LOCATION_HARDWARE",
"android.permission.READ_CALENDAR",
"android.permission.READ_CALL_LOG",
"android.permission.READ_CONTACTS",
"android.permission.READ_EXTERNAL_STORAGE",
"android.permission.READ_HISTORY_BOOKMARKS",
"android.permission.READ_PHONE_STATE",
"android.permission.READ_PROFILE",
"android.permission.READ_SMS",
"android.permission.READ_SOCIAL_STREAM",
"android.permission.READ_SYNC_SETTINGS",
"android.permission.RECEIVE_MMS",
"android.permission.RECEIVE_SMS",
"android.permission.RECORD_AUDIO"
};
private static final String[] communication = {
"android.permission.INTERNET",
"android.permission.ACCESS_NETWORK_STATE",
"android.permission.CHANGE_NETWORK_STATE",
"android.permission.BLUETOOTH_ADMIN",
"android.permission.BLUETOOTH",
"android.permission.WRITE_APN_SETTINGS",
"android.permission.NETWORK",
"android.permission.SUBSCRIBED_FEEDS_WRITE",
"android.permission.NFC",
"android.permission.NETWORK_PROVIDER",
"android.permission.WRITE_SOCIAL_STREAM",
"android.permission.SEND_SMS",
"android.permission.USE_SIP"
};
private static final String[] dangerours = {
"android.permission.ACCESS_SUPERUSER",
"android.permission.BLUETOOTH_PRIVILEGED",
"android.permission.BRICK",
"android.permission.CHANGE_COMPONENT_ENABLED_STATE",
"android.permission.CLEAR_APP_USER_DATA",
"android.permission.DELETE_CACHE_FILES",
"android.permission.DELETE_PACKAGES",
"android.permission.DISABLE_KEYGUARD",
"android.permission.FACTORY_TEST",
"android.permission.INSTALL_PACKAGES",
"android.permission.INJECT_EVENTS",
"android.permission.INTERNAL_SYSTEM_WINDOW",
"android.permission.KILL_BACKGROUND_PROCESSES",
"android.permission.MASTER_CLEAR",
"android.permission.MODIFY_PHONE_STATE",
"android.permission.MOUNT_FORMAT_FILESYSTEM",
"android.permission.MOUNT_UNMOUNT_FILESYSTEM",
"android.permission.PROCESS_OUTGOING_CALLS",
"android.permission.READ_LOGS",
"android.permission.REBOOT",
"android.permission.RECEIVE_BOOT_COMPLETED",
"android.permission.STATUS_BAR",
"android.permission.WRITE_EXTERNAL_STORAGE",
"android.permission.WRITE_HISTORY_BOOKMARKS",
"android.permission.WRITE_PROFILE",
"android.permission.WRITE_SECURE_SETTINGS"
};
private static final String[] dangerousSpecial = {
"android.permission.SYSTEM_ALERT_WINDOW",
"android.permission.WRITE_SETTINGS"
};
private ArrayList<UsesPermission> permList;
public OutPutResult(ArrayList<UsesPermission> permList) {
this.permList = permList;
if (permList == null)
throw new IllegalArgumentException("Permission list can not be NULL!");
//populate hash
for (String s : getGlobalPermissionList()) {
this.put(s, "0");
}
parse();
}
private static HashSet<String> load() {
HashSet<String> names = new HashSet<>();
names.add("ACCESS_ALL_DOWNLOADS");
names.add("ACCESS_COARSE_LOCATION");
names.add("ACCESS_DOWNLOAD_MANAGER_ADVANCED");
names.add("ACCESS_DRM");
names.add("ACCESS_FINE_LOCATION");
names.add("ACCESS_KEYGUARD_SECURE_STORAGE");
names.add("ACCESS_LOCATION_EXTRA_COMMANDS");
names.add("ACCESS_MOCK_LOCATION");
names.add("ACCESS_NETWORK_STATE");
names.add("ACCESS_NOTIFICATIONS");
names.add("ACCESS_WIFI_STATE");
names.add("AUTHENTICATE_ACCOUNTS");
names.add("BACKUP");
names.add("BATTERY_STATS");
names.add("BIND_DEVICE_ADMIN");
names.add("BLUETOOTH");
names.add("BLUETOOTH_ADMIN");
names.add("BROADCAST_NETWORK_PRIVILEGED");
names.add("BROADCAST_SCORE_NETWORKS");
names.add("CALL_PRIVILEGED");
names.add("CAPTURE_AUDIO_OUTPUT");
names.add("CAPTURE_SECURE_VIDEO_OUTPUT");
names.add("CAPTURE_VIDEO_OUTPUT");
names.add("CHANGE_COMPONENT_ENABLED_STATE");
names.add("CHANGE_NETWORK_STATE");
names.add("CHANGE_WIFI_MULTICAST_STATE");
names.add("CHANGE_WIFI_STATE");
names.add("CLEAR_APP_CACHE");
names.add("CLEAR_APP_USER_DATA");
names.add("CONFIGURE_WIFI_DISPLAY");
names.add("CONNECTIVITY_INTERNAL");
names.add("CONTROL_VPN");
names.add("DELETE_CACHE_FILES");
names.add("DELETE_PACKAGES");
names.add("DEVICE_POWER");
names.add("DISABLE_KEYGUARD");
names.add("DOWNLOAD_CACHE_NON_PURGEABLE");
names.add("DUMP");
names.add("EXPAND_STATUS_BAR");
names.add("FILTER_EVENTS");
names.add("FRAME_STATS");
names.add("FREEZE_SCREEN");
names.add("GET_ACCOUNTS");
names.add("GET_APP_OPS_STATS");
names.add("GET_PACKAGE_SIZE");
names.add("GLOBAL_SEARCH");
names.add("GRANT_REVOKE_PERMISSIONS");
names.add("INSTALL_DRM");
names.add("INSTALL_LOCATION_PROVIDER");
names.add("INSTALL_PACKAGES");
names.add("INTERACT_ACROSS_USERS");
names.add("INTERACT_ACROSS_USERS_FULL");
names.add("INTERNAL_SYSTEM_WINDOW");
names.add("INTERNET");
names.add("LOCATION_HARDWARE");
names.add("MAGNIFY_DISPLAY");
names.add("MANAGE_ACCOUNTS");
names.add("MANAGE_APP_TOKENS");
names.add("MANAGE_CA_CERTIFICATES");
names.add("MANAGE_DEVICE_ADMINS");
names.add("MANAGE_DOCUMENTS");
names.add("MANAGE_NETWORK_POLICY");
names.add("MANAGE_USB");
names.add("MANAGE_USERS");
names.add("MARK_NETWORK_SOCKET");
names.add("MEDIA_CONTENT_CONTROL");
names.add("MODIFY_AUDIO_ROUTING");
names.add("MODIFY_AUDIO_SETTINGS");
names.add("MODIFY_NETWORK_ACCOUNTING");
names.add("MODIFY_PHONE_STATE");
names.add("MOVE_PACKAGE");
names.add("NFC");
names.add("PACKAGE_USAGE_STATS");
names.add("PACKAGE_VERIFICATION_AGENT");
names.add("READ_CONTACTS");
names.add("READ_DREAM_STATE");
names.add("READ_FRAME_BUFFER");
names.add("READ_LOGS");
names.add("READ_NETWORK_USAGE_HISTORY");
names.add("READ_PHONE_STATE");
names.add("READ_PRIVILEGED_PHONE_STATE");
names.add("READ_PROFILE");
names.add("READ_SOCIAL_STREAM");
names.add("READ_SYNC_SETTINGS");
names.add("READ_SYNC_STATS");
names.add("REBOOT");
names.add("RECEIVE_SMS");
names.add("REMOTE_AUDIO_PLAYBACK");
names.add("RETRIEVE_WINDOW_INFO");
names.add("SCORE_NETWORKS");
names.add("SEND_SMS");
names.add("SERIAL_PORT");
names.add("SET_ANIMATION_SCALE");
names.add("SET_INPUT_CALIBRATION");
names.add("SET_KEYBOARD_LAYOUT");
names.add("SET_ORIENTATION");
names.add("SET_POINTER_SPEED");
names.add("SET_PREFERRED_APPLICATIONS");
names.add("SET_WALLPAPER");
names.add("SET_WALLPAPER_COMPONENT");
names.add("SET_WALLPAPER_HINTS");
names.add("SHUTDOWN");
names.add("STATUS_BAR");
names.add("STATUS_BAR_SERVICE");
names.add("TRANSMIT_IR");
names.add("UPDATE_APP_OPS_STATS");
names.add("UPDATE_DEVICE_STATS");
names.add("UPDATE_LOCK");
names.add("USE_CREDENTIALS");
names.add("USE_SIP");
names.add("VIBRATE");
names.add("WAKE_LOCK");
names.add("WRITE_APN_SETTINGS");
names.add("WRITE_CONTACTS");
names.add("WRITE_DREAM_STATE");
names.add("WRITE_PROFILE");
names.add("WRITE_SECURE_SETTINGS");
names.add("WRITE_SETTINGS");
names.add("WRITE_SMS");
names.add("WRITE_SOCIAL_STREAM");
names.add("WRITE_SYNC_SETTINGS");
names.add("com.android.email.permission.ACCESS_PROVIDER");
names.add("com.android.printspooler.permission.ACCESS_ALL_PRINT_JOBS");
names.add("com.android.voicemail.permission.ADD_VOICEMAIL");
names.add("com.android.voicemail.permission.READ_WRITE_ALL_VOICEMAIL");
names.add("ACCESS_CHECKIN_PROPERTIES");
names.add("ACCESS_NOTIFICATION_POLICY");
names.add("ACCOUNT_MANAGER");
names.add("ADD_VOICEMAIL");
names.add("BIND_ACCESSIBILITY_SERVICE");
names.add("BIND_APPWIDGET");
names.add("BIND_CARRIER_MESSAGING_SERVICE");
names.add("BIND_CARRIER_SERVICES");
names.add("BIND_CHOOSER_TARGET_SERVICE");
names.add("BIND_DREAM_SERVICE");
names.add("BIND_INCALL_SERVICE");
names.add("BIND_INPUT_METHOD");
names.add("BIND_MIDI_DEVICE_SERVICE");
names.add("BIND_NFC_SERVICE");
names.add("BIND_NOTIFICATION_LISTENER_SERVICE");
names.add("BIND_PRINT_SERVICE");
names.add("BIND_REMOTEVIEWS");
names.add("BIND_TELECOM_CONNECTION_SERVICE");
names.add("BIND_TEXT_SERVICE");
names.add("BIND_TV_INPUT");
names.add("BIND_VOICE_INTERACTION");
names.add("BIND_VPN_SERVICE");
names.add("BIND_WALLPAPER");
names.add("BLUETOOTH_PRIVILEGED");
names.add("BODY_SENSORS");
names.add("BROADCAST_PACKAGE_REMOVED");
names.add("BROADCAST_SMS");
names.add("BROADCAST_STICKY");
names.add("BROADCAST_WAP_PUSH");
names.add("CALL_PHONE");
names.add("CAMERA");
names.add("CHANGE_CONFIGURATION");
names.add("CONTROL_LOCATION_UPDATES");
names.add("DIAGNOSTIC");
names.add("FACTORY_TEST");
names.add("FLASHLIGHT");
names.add("GET_ACCOUNTS_PRIVILEGED");
names.add("GET_TASKS");
names.add("INSTALL_SHORTCUT");
names.add("KILL_BACKGROUND_PROCESSES");
names.add("MASTER_CLEAR");
names.add("MOUNT_FORMAT_FILESYSTEMS");
names.add("MOUNT_UNMOUNT_FILESYSTEMS");
names.add("PERSISTENT_ACTIVITY");
names.add("PROCESS_OUTGOING_CALLS");
names.add("READ_CALENDAR");
names.add("READ_CALL_LOG");
names.add("READ_EXTERNAL_STORAGE");
names.add("READ_INPUT_STATE");
names.add("READ_SMS");
names.add("READ_VOICEMAIL");
names.add("RECEIVE_BOOT_COMPLETED");
names.add("RECEIVE_MMS");
names.add("RECEIVE_WAP_PUSH");
names.add("RECORD_AUDIO");
names.add("REORDER_TASKS");
names.add("REQUEST_IGNORE_BATTERY_OPTIMIZATIONS");
names.add("REQUEST_INSTALL_PACKAGES");
names.add("RESTART_PACKAGES");
names.add("SEND_RESPOND_VIA_MESSAGE");
names.add("SET_ALARM");
names.add("SET_ALWAYS_FINISH");
names.add("SET_DEBUG_APP");
names.add("SET_PROCESS_LIMIT");
names.add("SET_TIME");
names.add("SET_TIME_ZONE");
names.add("SIGNAL_PERSISTENT_PROCESSES");
names.add("SYSTEM_ALERT_WINDOW");
names.add("UNINSTALL_SHORTCUT");
names.add("USE_FINGERPRINT");
names.add("WRITE_CALENDAR");
names.add("WRITE_CALL_LOG");
names.add("WRITE_EXTERNAL_STORAGE");
names.add("WRITE_GSERVICES");
names.add("WRITE_VOICEMAIL");
names.add("READ_WRITE_ALL_VOICEMAIL");
//add my extra permissions
names.add("harmlessPermission");
names.add("canStealDataPermissions");
names.add("communication");
names.add("dangerours");
names.add("dangerousSpecial");
return names;
}
public static String[] getGlobalPermissionList() {
return globalPermissionList.toArray(new String[globalPermissionList.size()]);
}
private void parse() {
for (UsesPermission p : permList) {
String key = p.getName().replace("android.permission.", "");
if (globalPermissionList.contains(key))
this.put(key, "1");
}
//calculate next values
//harmlessPermission, canStealDataPermissions, communication, dangerours, dangerousSpecial
String[] keys = {"harmlessPermission", "canStealDataPermissions", "communication", "dangerours", "dangerousSpecial"};
for (String key : keys) {
if (checkPermissionsWithKey(key, permList)) {
continue;
}
}
}
private boolean checkPermissionsWithKey(String key, ArrayList<UsesPermission> permList) {
switch (key) {
case "harmlessPermission":
return checkPermissionsWithKeyArray("harmlessPermission", harmlessPermission, permList);
case "canStealDataPermissions":
return checkPermissionsWithKeyArray("canStealDataPermissions", canStealDataPermissions, permList);
case "communication":
return checkPermissionsWithKeyArray("communication", communication, permList);
case "dangerours":
return checkPermissionsWithKeyArray("dangerours", dangerours, permList);
case "dangerousSpecial":
return checkPermissionsWithKeyArray("dangerousSpecial", dangerousSpecial, permList);
}
return false;
}
private boolean checkPermissionsWithKeyArray(String key, String[] dataArray, ArrayList<UsesPermission> permList) {
List<String> asList = Arrays.asList(dataArray);
for (UsesPermission p : permList) {
//get current permission name
String currentPermName = p.getName();
//check if is on dataArray
boolean contains = asList.contains(currentPermName);
if (contains) {
//savae result and return true
this.put(key, "1");
return true;
}
}
//if does not match with no elements, set as false
this.put(key, "0");
return false;
}
public String[] getValues(String[] names) {
String[] output = new String[names.length];
for (int i = 0; i < names.length; i++) {
output[i] = this.get(names[i]).equals("1") ? "1" : "0";
}
return output;
}
public String toWekaData() {
StringBuilder data = new StringBuilder();
String names[] = getGlobalPermissionList();
data.append(this.get(names[0]).equals("1") ? "true" : "false");
for (int i = 1; i < names.length; i++) {
data.append(",").append(this.get(names[i]).equals("1") ? "true" : "false");
}
return data.toString();
}
}
| {
"pile_set_name": "Github"
} |
/* ============================================================
*
* This file is a part of digiKam project
* https://www.digikam.org
*
* Date : 2011-03-14
* Description : a dialog to edit EXIF,IPTC and XMP metadata
*
* Copyright (C) 2011 by Victor Dodon <dodon dot victor at gmail dot com>
* Copyright (C) 2006-2019 by Gilles Caulier <caulier dot gilles at gmail dot com>
*
* 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, 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. See the
* GNU General Public License for more details.
*
* ============================================================ */
#ifndef DIGIKAM_META_DATA_EDIT_H
#define DIGIKAM_META_DATA_EDIT_H
// Qt includes
#include <QCloseEvent>
#include <QUrl>
// Local includes
#include "digikam_export.h"
#include "dplugindialog.h"
#include "dinfointerface.h"
using namespace Digikam;
namespace DigikamGenericMetadataEditPlugin
{
class DIGIKAM_EXPORT MetadataEditDialog : public DPluginDialog
{
Q_OBJECT
public:
explicit MetadataEditDialog(QWidget* const parent, DInfoInterface* const iface);
~MetadataEditDialog();
QList<QUrl>::iterator currentItem() const;
QString currentItemTitleHeader(const QString& title) const;
Q_SIGNALS:
void signalMetadataChangedForUrl(const QUrl&);
public Q_SLOTS:
void slotModified();
private Q_SLOTS:
void slotOk();
void slotClose();
void slotItemChanged();
void slotApply();
void slotNext();
void slotPrevious();
void slotSetReadOnly(bool);
protected:
void closeEvent(QCloseEvent*) override;
bool eventFilter(QObject*, QEvent*) override;
private:
void saveSettings();
void readSettings();
void updatePreview();
private:
class Private;
Private* const d;
};
} // namespace DigikamGenericMetadataEditPlugin
#endif // DIGIKAM_META_DATA_EDIT_H
| {
"pile_set_name": "Github"
} |
/**
* Sky theme for reveal.js.
*
* Copyright (C) 2011-2012 Hakim El Hattab, http://hakim.se
*/
@import url(https://fonts.googleapis.com/css?family=Quicksand:400,700,400italic,700italic);
@import url(https://fonts.googleapis.com/css?family=Open+Sans:400italic,700italic,400,700);
.reveal a {
line-height: 1.3em; }
/*********************************************
* GLOBAL STYLES
*********************************************/
body {
background: #add9e4;
background: -moz-radial-gradient(center, circle cover, #f7fbfc 0%, #add9e4 100%);
background: -webkit-gradient(radial, center center, 0px, center center, 100%, color-stop(0%, #f7fbfc), color-stop(100%, #add9e4));
background: -webkit-radial-gradient(center, circle cover, #f7fbfc 0%, #add9e4 100%);
background: -o-radial-gradient(center, circle cover, #f7fbfc 0%, #add9e4 100%);
background: -ms-radial-gradient(center, circle cover, #f7fbfc 0%, #add9e4 100%);
background: radial-gradient(center, circle cover, #f7fbfc 0%, #add9e4 100%);
background-color: #f7fbfc; }
.reveal {
font-family: "Open Sans", sans-serif;
font-size: 40px;
font-weight: normal;
color: #333; }
::selection {
color: #fff;
background: #134674;
text-shadow: none; }
::-moz-selection {
color: #fff;
background: #134674;
text-shadow: none; }
.reveal .slides section,
.reveal .slides section > section {
line-height: 1.3;
font-weight: inherit; }
/*********************************************
* HEADERS
*********************************************/
.reveal h1,
.reveal h2,
.reveal h3,
.reveal h4,
.reveal h5,
.reveal h6 {
margin: 0 0 20px 0;
color: #333;
font-family: "Quicksand", sans-serif;
font-weight: normal;
line-height: 1.2;
letter-spacing: -0.08em;
text-transform: uppercase;
text-shadow: none;
word-wrap: break-word; }
.reveal h1 {
font-size: 3.77em; }
.reveal h2 {
font-size: 2.11em; }
.reveal h3 {
font-size: 1.55em; }
.reveal h4 {
font-size: 1em; }
.reveal h1 {
text-shadow: none; }
/*********************************************
* OTHER
*********************************************/
.reveal p {
margin: 20px 0;
line-height: 1.3; }
/* Ensure certain elements are never larger than the slide itself */
.reveal img,
.reveal video,
.reveal iframe {
max-width: 95%;
max-height: 95%; }
.reveal strong,
.reveal b {
font-weight: bold; }
.reveal em {
font-style: italic; }
.reveal ol,
.reveal dl,
.reveal ul {
display: inline-block;
text-align: left;
margin: 0 0 0 1em; }
.reveal ol {
list-style-type: decimal; }
.reveal ul {
list-style-type: disc; }
.reveal ul ul {
list-style-type: square; }
.reveal ul ul ul {
list-style-type: circle; }
.reveal ul ul,
.reveal ul ol,
.reveal ol ol,
.reveal ol ul {
display: block;
margin-left: 40px; }
.reveal dt {
font-weight: bold; }
.reveal dd {
margin-left: 40px; }
.reveal blockquote {
display: block;
position: relative;
width: 70%;
margin: 20px auto;
padding: 5px;
font-style: italic;
background: rgba(255, 255, 255, 0.05);
box-shadow: 0px 0px 2px rgba(0, 0, 0, 0.2); }
.reveal blockquote p:first-child,
.reveal blockquote p:last-child {
display: inline-block; }
.reveal q {
font-style: italic; }
.reveal pre {
display: block;
position: relative;
width: 90%;
margin: 20px auto;
text-align: left;
font-size: 0.55em;
font-family: monospace;
line-height: 1.2em;
word-wrap: break-word;
box-shadow: 0px 0px 6px rgba(0, 0, 0, 0.3); }
.reveal code {
font-family: monospace;
text-transform: none; }
.reveal pre code {
display: block;
padding: 5px;
overflow: auto;
max-height: 400px;
word-wrap: normal; }
.reveal table {
margin: auto;
border-collapse: collapse;
border-spacing: 0; }
.reveal table th {
font-weight: bold; }
.reveal table th,
.reveal table td {
text-align: left;
padding: 0.2em 0.5em 0.2em 0.5em;
border-bottom: 1px solid; }
.reveal table th[align="center"],
.reveal table td[align="center"] {
text-align: center; }
.reveal table th[align="right"],
.reveal table td[align="right"] {
text-align: right; }
.reveal table tbody tr:last-child th,
.reveal table tbody tr:last-child td {
border-bottom: none; }
.reveal sup {
vertical-align: super;
font-size: smaller; }
.reveal sub {
vertical-align: sub;
font-size: smaller; }
.reveal small {
display: inline-block;
font-size: 0.6em;
line-height: 1.2em;
vertical-align: top; }
.reveal small * {
vertical-align: top; }
/*********************************************
* LINKS
*********************************************/
.reveal a {
color: #3b759e;
text-decoration: none;
-webkit-transition: color .15s ease;
-moz-transition: color .15s ease;
transition: color .15s ease; }
.reveal a:hover {
color: #74a7cb;
text-shadow: none;
border: none; }
.reveal .roll span:after {
color: #fff;
background: #264c66; }
/*********************************************
* IMAGES
*********************************************/
.reveal section img {
margin: 15px 0px;
background: rgba(255, 255, 255, 0.12);
border: 4px solid #333;
box-shadow: 0 0 10px rgba(0, 0, 0, 0.15); }
.reveal section img.plain {
border: 0;
box-shadow: none; }
.reveal a img {
-webkit-transition: all .15s linear;
-moz-transition: all .15s linear;
transition: all .15s linear; }
.reveal a:hover img {
background: rgba(255, 255, 255, 0.2);
border-color: #3b759e;
box-shadow: 0 0 20px rgba(0, 0, 0, 0.55); }
/*********************************************
* NAVIGATION CONTROLS
*********************************************/
.reveal .controls {
color: #3b759e; }
/*********************************************
* PROGRESS BAR
*********************************************/
.reveal .progress {
background: rgba(0, 0, 0, 0.2);
color: #3b759e; }
.reveal .progress span {
-webkit-transition: width 800ms cubic-bezier(0.26, 0.86, 0.44, 0.985);
-moz-transition: width 800ms cubic-bezier(0.26, 0.86, 0.44, 0.985);
transition: width 800ms cubic-bezier(0.26, 0.86, 0.44, 0.985); }
/*********************************************
* PRINT BACKGROUND
*********************************************/
@media print {
.backgrounds {
background-color: #f7fbfc; } }
| {
"pile_set_name": "Github"
} |
/*
* Copyright (c) 2004, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code 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
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/*
* @test
* @bug 4980352
* @summary Verify compiler doesn't throw a NullPointerException when compiling.
* @author tball
*
* @compile/fail BoundClassError.java
*/
public class BoundClassError <T extends String&Comparable<BoundClassError>> {}
| {
"pile_set_name": "Github"
} |
import { IStatRender } from "./IStatRender";
import { Browser } from "./Browser";
//import { Laya } from "./../../Laya";
import { Sprite } from "../display/Sprite"
import { Text } from "../display/Text"
import { Render } from "../renders/Render"
import { Context } from "../resource/Context"
import { HTMLCanvas } from "../resource/HTMLCanvas"
import { Resource } from "../resource/Resource"
import { Stat } from "./Stat";
import { ILaya } from "../../ILaya";
/**
* 显示Stat的结果。由于stat会引入很多的循环引用，所以把显示部分拆开
* @author laya
*/
export class StatUI extends IStatRender {
private static _fontSize: number = 12;
private _txt: Text;
private _leftText: Text;
/**@internal */
_sp: Sprite;
/**@internal */
_titleSp: Sprite;
/**@internal */
_bgSp: Sprite;
/**@internal */
_show: boolean = false;
/**@internal */
_useCanvas: boolean = false;
private _canvas: HTMLCanvas;
private _ctx: Context;
private _first: boolean;
private _vx: number;
private _width: number;
private _height: number = 100;
private _view: any[] = [];
/**
* @override
* 显示性能统计信息。
* @param x X轴显示位置。
* @param y Y轴显示位置。
*/
show(x: number = 0, y: number = 0): void {
var dt: any = Stat;
if (!Browser.onMiniGame && !ILaya.Render.isConchApp && !Browser.onBDMiniGame && !Browser.onKGMiniGame && !Browser.onQGMiniGame && !Browser.onQQMiniGame && !Browser.onAlipayMiniGame && !Browser.onBLMiniGame && !Browser.onTTMiniGame && !Browser.onHWMiniGame && !Browser.onTBMiniGame) this._useCanvas = true;
this._show = true;
Stat._fpsData.length = 60;
this._view[0] = { title: "FPS(WebGL)", value: "_fpsStr", color: "yellow", units: "int" };
this._view[1] = { title: "Sprite", value: "_spriteStr", color: "white", units: "int" };
this._view[2] = { title: "RenderBatches", value: "renderBatches", color: "white", units: "int" };
this._view[3] = { title: "SavedRenderBatches", value: "savedRenderBatches", color: "white", units: "int" };
this._view[4] = { title: "CPUMemory", value: "cpuMemory", color: "yellow", units: "M" };
this._view[5] = { title: "GPUMemory", value: "gpuMemory", color: "yellow", units: "M" };
this._view[6] = { title: "Shader", value: "shaderCall", color: "white", units: "int" };
this._view[7] = { title: "Canvas", value: "_canvasStr", color: "white", units: "int" };
if (Render.is3DMode) {
this._view[0].title = "FPS(3D)";
this._view[8] = { title: "TriFaces", value: "trianglesFaces", color: "white", units: "int" };
this._view[9] = { title: "FrustumCulling", value: "frustumCulling", color: "white", units: "int" };
this._view[10] = { title: "OctreeNodeCulling", value: "octreeNodeCulling", color: "white", units: "int" };
}
if (this._useCanvas) {
this.createUIPre(x, y);
} else
this.createUI(x, y);
this.enable();
}
private createUIPre(x: number, y: number): void {
var pixel: number = Browser.pixelRatio;
this._width = pixel * 180;
this._vx = pixel * 120;
this._height = pixel * (this._view.length * 12 + 3 * pixel) + 4;
StatUI._fontSize = 12 * pixel;
for (var i: number = 0; i < this._view.length; i++) {
this._view[i].x = 4;
this._view[i].y = i * StatUI._fontSize + 2 * pixel;
}
if (!this._canvas) {
this._canvas = new HTMLCanvas(true);
this._canvas.size(this._width, this._height);
this._ctx = this._canvas.getContext('2d') as Context;
this._ctx.textBaseline = "top";
this._ctx.font = StatUI._fontSize + "px Arial";
this._canvas.source.style.cssText = "pointer-events:none;background:rgba(150,150,150,0.8);z-index:100000;position: absolute;direction:ltr;left:" + x + "px;top:" + y + "px;width:" + (this._width / pixel) + "px;height:" + (this._height / pixel) + "px;";
}
if (!Browser.onKGMiniGame) {
Browser.container.appendChild(this._canvas.source);
}
this._first = true;
this.loop();
this._first = false;
}
private createUI(x: number, y: number): void {
var stat: Sprite = this._sp;
var pixel: number = Browser.pixelRatio;
if (!stat) {
stat = new Sprite();
this._leftText = new Text();
this._leftText.pos(5, 5);
this._leftText.color = "#ffffff";
stat.addChild(this._leftText);
this._txt = new Text();
this._txt.pos(130 * pixel, 5);
this._txt.color = "#ffffff";
stat.addChild(this._txt);
this._sp = stat;
}
stat.pos(x, y);
var text: string = "";
for (var i: number = 0; i < this._view.length; i++) {
var one: any = this._view[i];
text += one.title + "\n";
}
this._leftText.text = text;
//调整为合适大小和字体
var width: number = pixel * 138;
var height: number = pixel * (this._view.length * 12 + 3 * pixel) + 4;
this._txt.fontSize = StatUI._fontSize * pixel;
this._leftText.fontSize = StatUI._fontSize * pixel;
stat.size(width, height);
stat.graphics.clear();
stat.graphics.alpha(0.5);
stat.graphics.drawRect(0, 0, width + 110, height + 30, "#999999");
stat.graphics.alpha(2);
this.loop();
}
/**
* @override
* 激活性能统计
* */
enable(): void {
ILaya.systemTimer.frameLoop(1, this, this.loop);
}
/**
* @override
* 隐藏性能统计信息。
*/
hide(): void {
this._show = false;
ILaya.systemTimer.clear(this, this.loop);
if (this._canvas) {
Browser.removeElement(this._canvas.source);
}
}
/**
* @override
* 点击性能统计显示区域的处理函数。
*/
set_onclick(fn: (this: GlobalEventHandlers, ev: MouseEvent) => any): void {
if (this._sp) {
this._sp.on("click", this._sp, fn);
}
if (this._canvas) {
this._canvas.source.onclick = fn;
this._canvas.source.style.pointerEvents = '';
}
}
/**
* @private
* 性能统计参数计算循环处理函数。
*/
loop(): void {
Stat._count++;
var timer: number = Browser.now();
if (timer - Stat._timer < 1000) return;
var count: number = Stat._count;
//计算更精确的FPS值
Stat.FPS = Math.round((count * 1000) / (timer - Stat._timer));
if (this._show) {
//计算平均值
Stat.trianglesFaces = Math.round(Stat.trianglesFaces / count);
if (!this._useCanvas) {
Stat.renderBatches = Math.round(Stat.renderBatches / count) - 1;
} else {
Stat.renderBatches = Math.round(Stat.renderBatches / count);
}
Stat.savedRenderBatches = Math.round(Stat.savedRenderBatches / count);
Stat.shaderCall = Math.round(Stat.shaderCall / count);
Stat.spriteRenderUseCacheCount = Math.round(Stat.spriteRenderUseCacheCount / count);
Stat.canvasNormal = Math.round(Stat.canvasNormal / count);
Stat.canvasBitmap = Math.round(Stat.canvasBitmap / count);
Stat.canvasReCache = Math.ceil(Stat.canvasReCache / count);
Stat.frustumCulling = Math.round(Stat.frustumCulling / count);
Stat.octreeNodeCulling = Math.round(Stat.octreeNodeCulling / count);
var delay: string = Stat.FPS > 0 ? Math.floor(1000 / Stat.FPS).toString() : " ";
Stat._fpsStr = Stat.FPS + (Stat.renderSlow ? " slow" : "") + " " + delay;
// if (this._useCanvas)
// Stat._spriteStr = (Stat.spriteCount - 1) + (Stat.spriteRenderUseCacheCount ? ("/" + Stat.spriteRenderUseCacheCount) : '');
// else
Stat._spriteStr = Stat.spriteCount + (Stat.spriteRenderUseCacheCount ? ("/" + Stat.spriteRenderUseCacheCount) : '');
Stat._canvasStr = Stat.canvasReCache + "/" + Stat.canvasNormal + "/" + Stat.canvasBitmap;
Stat.cpuMemory = Resource.cpuMemory;
Stat.gpuMemory = Resource.gpuMemory;
if (this._useCanvas) {
this.renderInfoPre();
} else
this.renderInfo();
Stat.clear();
}
Stat._count = 0;
Stat._timer = timer;
}
private renderInfoPre(): void {
var i: number = 0;
var one: any;
var value: any;
if (this._canvas) {
var ctx: any = this._ctx;
ctx.clearRect(this._first ? 0 : this._vx, 0, this._width, this._height);
for (i = 0; i < this._view.length; i++) {
one = this._view[i];
//只有第一次才渲染标题文字，减少文字渲染次数
if (this._first) {
ctx.fillStyle = "white";
ctx.fillText(one.title, one.x, one.y);
}
ctx.fillStyle = one.color;
value = Stat[one.value];
(one.units == "M") && (value = Math.floor(value / (1024 * 1024) * 100) / 100 + " M");
ctx.fillText(value + "", one.x + this._vx, one.y);
}
}
}
private renderInfo(): void {
var text: string = "";
for (var i: number = 0; i < this._view.length; i++) {
var one: any = this._view[i];
var value: any = Stat[one.value];
(one.units == "M") && (value = Math.floor(value / (1024 * 1024) * 100) / 100 + " M");
(one.units == "K") && (value = Math.floor(value / (1024) * 100) / 100 + " K");
text += value + "\n";
}
this._txt.text = text;
}
/**
* @override
*/
isCanvasRender(): boolean {
return this._useCanvas;
}
/**
* @override
* 非canvas模式的渲染
* */
renderNotCanvas(ctx: any, x: number, y: number) {
this._show && this._sp && this._sp.render(ctx, 0, 0);
}
}
| {
"pile_set_name": "Github"
} |
z qODVLmFGDitfqing
| {
"pile_set_name": "Github"
} |
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<title>AdminLTE 2 | Morris.js Charts</title>
<!-- Tell the browser to be responsive to screen width -->
<meta content="width=device-width, initial-scale=1, maximum-scale=1, user-scalable=no" name="viewport">
<!-- Bootstrap 3.3.6 -->
<link rel="stylesheet" href="../../bootstrap/css/bootstrap.min.css">
<!-- Font Awesome -->
<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/4.5.0/css/font-awesome.min.css">
<!-- Ionicons -->
<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/ionicons/2.0.1/css/ionicons.min.css">
<!-- Morris charts -->
<link rel="stylesheet" href="../../plugins/morris/morris.css">
<!-- Theme style -->
<link rel="stylesheet" href="../../dist/css/AdminLTE.min.css">
<!-- AdminLTE Skins. Choose a skin from the css/skins
folder instead of downloading all of them to reduce the load. -->
<link rel="stylesheet" href="../../dist/css/skins/_all-skins.min.css">
<!-- HTML5 Shim and Respond.js IE8 support of HTML5 elements and media queries -->
<!-- WARNING: Respond.js doesn't work if you view the page via file:// -->
<!--[if lt IE 9]>
<script src="https://oss.maxcdn.com/html5shiv/3.7.3/html5shiv.min.js"></script>
<script src="https://oss.maxcdn.com/respond/1.4.2/respond.min.js"></script>
<![endif]-->
</head>
<body class="hold-transition skin-blue sidebar-mini">
<div class="wrapper">
<header class="main-header">
<!-- Logo -->
<a href="../../index2.html" class="logo">
<!-- mini logo for sidebar mini 50x50 pixels -->
<span class="logo-mini"><b>A</b>LT</span>
<!-- logo for regular state and mobile devices -->
<span class="logo-lg"><b>Admin</b>LTE</span>
</a>
<!-- Header Navbar: style can be found in header.less -->
<nav class="navbar navbar-static-top">
<!-- Sidebar toggle button-->
<a href="#" class="sidebar-toggle" data-toggle="offcanvas" role="button">
<span class="sr-only">Toggle navigation</span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
</a>
<div class="navbar-custom-menu">
<ul class="nav navbar-nav">
<!-- Messages: style can be found in dropdown.less-->
<li class="dropdown messages-menu">
<a href="#" class="dropdown-toggle" data-toggle="dropdown">
<i class="fa fa-envelope-o"></i>
<span class="label label-success">4</span>
</a>
<ul class="dropdown-menu">
<li class="header">You have 4 messages</li>
<li>
<!-- inner menu: contains the actual data -->
<ul class="menu">
<li><!-- start message -->
<a href="#">
<div class="pull-left">
<img src="../../dist/img/user2-160x160.jpg" class="img-circle" alt="User Image">
</div>
<h4>
Support Team
<small><i class="fa fa-clock-o"></i> 5 mins</small>
</h4>
<p>Why not buy a new awesome theme?</p>
</a>
</li>
<!-- end message -->
<li>
<a href="#">
<div class="pull-left">
<img src="../../dist/img/user3-128x128.jpg" class="img-circle" alt="User Image">
</div>
<h4>
AdminLTE Design Team
<small><i class="fa fa-clock-o"></i> 2 hours</small>
</h4>
<p>Why not buy a new awesome theme?</p>
</a>
</li>
<li>
<a href="#">
<div class="pull-left">
<img src="../../dist/img/user4-128x128.jpg" class="img-circle" alt="User Image">
</div>
<h4>
Developers
<small><i class="fa fa-clock-o"></i> Today</small>
</h4>
<p>Why not buy a new awesome theme?</p>
</a>
</li>
<li>
<a href="#">
<div class="pull-left">
<img src="../../dist/img/user3-128x128.jpg" class="img-circle" alt="User Image">
</div>
<h4>
Sales Department
<small><i class="fa fa-clock-o"></i> Yesterday</small>
</h4>
<p>Why not buy a new awesome theme?</p>
</a>
</li>
<li>
<a href="#">
<div class="pull-left">
<img src="../../dist/img/user4-128x128.jpg" class="img-circle" alt="User Image">
</div>
<h4>
Reviewers
<small><i class="fa fa-clock-o"></i> 2 days</small>
</h4>
<p>Why not buy a new awesome theme?</p>
</a>
</li>
</ul>
</li>
<li class="footer"><a href="#">See All Messages</a></li>
</ul>
</li>
<!-- Notifications: style can be found in dropdown.less -->
<li class="dropdown notifications-menu">
<a href="#" class="dropdown-toggle" data-toggle="dropdown">
<i class="fa fa-bell-o"></i>
<span class="label label-warning">10</span>
</a>
<ul class="dropdown-menu">
<li class="header">You have 10 notifications</li>
<li>
<!-- inner menu: contains the actual data -->
<ul class="menu">
<li>
<a href="#">
<i class="fa fa-users text-aqua"></i> 5 new members joined today
</a>
</li>
<li>
<a href="#">
<i class="fa fa-warning text-yellow"></i> Very long description here that may not fit into the
page and may cause design problems
</a>
</li>
<li>
<a href="#">
<i class="fa fa-users text-red"></i> 5 new members joined
</a>
</li>
<li>
<a href="#">
<i class="fa fa-shopping-cart text-green"></i> 25 sales made
</a>
</li>
<li>
<a href="#">
<i class="fa fa-user text-red"></i> You changed your username
</a>
</li>
</ul>
</li>
<li class="footer"><a href="#">View all</a></li>
</ul>
</li>
<!-- Tasks: style can be found in dropdown.less -->
<li class="dropdown tasks-menu">
<a href="#" class="dropdown-toggle" data-toggle="dropdown">
<i class="fa fa-flag-o"></i>
<span class="label label-danger">9</span>
</a>
<ul class="dropdown-menu">
<li class="header">You have 9 tasks</li>
<li>
<!-- inner menu: contains the actual data -->
<ul class="menu">
<li><!-- Task item -->
<a href="#">
<h3>
Design some buttons
<small class="pull-right">20%</small>
</h3>
<div class="progress xs">
<div class="progress-bar progress-bar-aqua" style="width: 20%" role="progressbar" aria-valuenow="20" aria-valuemin="0" aria-valuemax="100">
<span class="sr-only">20% Complete</span>
</div>
</div>
</a>
</li>
<!-- end task item -->
<li><!-- Task item -->
<a href="#">
<h3>
Create a nice theme
<small class="pull-right">40%</small>
</h3>
<div class="progress xs">
<div class="progress-bar progress-bar-green" style="width: 40%" role="progressbar" aria-valuenow="20" aria-valuemin="0" aria-valuemax="100">
<span class="sr-only">40% Complete</span>
</div>
</div>
</a>
</li>
<!-- end task item -->
<li><!-- Task item -->
<a href="#">
<h3>
Some task I need to do
<small class="pull-right">60%</small>
</h3>
<div class="progress xs">
<div class="progress-bar progress-bar-red" style="width: 60%" role="progressbar" aria-valuenow="20" aria-valuemin="0" aria-valuemax="100">
<span class="sr-only">60% Complete</span>
</div>
</div>
</a>
</li>
<!-- end task item -->
<li><!-- Task item -->
<a href="#">
<h3>
Make beautiful transitions
<small class="pull-right">80%</small>
</h3>
<div class="progress xs">
<div class="progress-bar progress-bar-yellow" style="width: 80%" role="progressbar" aria-valuenow="20" aria-valuemin="0" aria-valuemax="100">
<span class="sr-only">80% Complete</span>
</div>
</div>
</a>
</li>
<!-- end task item -->
</ul>
</li>
<li class="footer">
<a href="#">View all tasks</a>
</li>
</ul>
</li>
<!-- User Account: style can be found in dropdown.less -->
<li class="dropdown user user-menu">
<a href="#" class="dropdown-toggle" data-toggle="dropdown">
<img src="../../dist/img/user2-160x160.jpg" class="user-image" alt="User Image">
<span class="hidden-xs">Alexander Pierce</span>
</a>
<ul class="dropdown-menu">
<!-- User image -->
<li class="user-header">
<img src="../../dist/img/user2-160x160.jpg" class="img-circle" alt="User Image">
<p>
Alexander Pierce - Web Developer
<small>Member since Nov. 2012</small>
</p>
</li>
<!-- Menu Body -->
<li class="user-body">
<div class="row">
<div class="col-xs-4 text-center">
<a href="#">Followers</a>
</div>
<div class="col-xs-4 text-center">
<a href="#">Sales</a>
</div>
<div class="col-xs-4 text-center">
<a href="#">Friends</a>
</div>
</div>
<!-- /.row -->
</li>
<!-- Menu Footer-->
<li class="user-footer">
<div class="pull-left">
<a href="#" class="btn btn-default btn-flat">Profile</a>
</div>
<div class="pull-right">
<a href="#" class="btn btn-default btn-flat">Sign out</a>
</div>
</li>
</ul>
</li>
<!-- Control Sidebar Toggle Button -->
<li>
<a href="#" data-toggle="control-sidebar"><i class="fa fa-gears"></i></a>
</li>
</ul>
</div>
</nav>
</header>
<!-- Left side column. contains the logo and sidebar -->
<aside class="main-sidebar">
<!-- sidebar: style can be found in sidebar.less -->
<section class="sidebar">
<!-- Sidebar user panel -->
<div class="user-panel">
<div class="pull-left image">
<img src="../../dist/img/user2-160x160.jpg" class="img-circle" alt="User Image">
</div>
<div class="pull-left info">
<p>Alexander Pierce</p>
<a href="#"><i class="fa fa-circle text-success"></i> Online</a>
</div>
</div>
<!-- search form -->
<form action="#" method="get" class="sidebar-form">
<div class="input-group">
<input type="text" name="q" class="form-control" placeholder="Search...">
<span class="input-group-btn">
<button type="submit" name="search" id="search-btn" class="btn btn-flat"><i class="fa fa-search"></i>
</button>
</span>
</div>
</form>
<!-- /.search form -->
<!-- sidebar menu: : style can be found in sidebar.less -->
<ul class="sidebar-menu">
<li class="header">MAIN NAVIGATION</li>
<li class="treeview">
<a href="#">
<i class="fa fa-dashboard"></i> <span>Dashboard</span>
<span class="pull-right-container">
<i class="fa fa-angle-left pull-right"></i>
</span>
</a>
<ul class="treeview-menu">
<li><a href="../../index.html"><i class="fa fa-circle-o"></i> Dashboard v1</a></li>
<li><a href="../../index2.html"><i class="fa fa-circle-o"></i> Dashboard v2</a></li>
</ul>
</li>
<li class="treeview">
<a href="#">
<i class="fa fa-files-o"></i>
<span>Layout Options</span>
<span class="pull-right-container">
<span class="label label-primary pull-right">4</span>
</span>
</a>
<ul class="treeview-menu">
<li><a href="../layout/top-nav.html"><i class="fa fa-circle-o"></i> Top Navigation</a></li>
<li><a href="../layout/boxed.html"><i class="fa fa-circle-o"></i> Boxed</a></li>
<li><a href="../layout/fixed.html"><i class="fa fa-circle-o"></i> Fixed</a></li>
<li><a href="../layout/collapsed-sidebar.html"><i class="fa fa-circle-o"></i> Collapsed Sidebar</a></li>
</ul>
</li>
<li>
<a href="../widgets.html">
<i class="fa fa-th"></i> <span>Widgets</span>
<span class="pull-right-container">
<small class="label pull-right bg-green">new</small>
</span>
</a>
</li>
<li class="treeview active">
<a href="#">
<i class="fa fa-pie-chart"></i>
<span>Charts</span>
<span class="pull-right-container">
<i class="fa fa-angle-left pull-right"></i>
</span>
</a>
<ul class="treeview-menu">
<li><a href="chartjs.html"><i class="fa fa-circle-o"></i> ChartJS</a></li>
<li class="active"><a href="morris.html"><i class="fa fa-circle-o"></i> Morris</a></li>
<li><a href="flot.html"><i class="fa fa-circle-o"></i> Flot</a></li>
<li><a href="inline.html"><i class="fa fa-circle-o"></i> Inline charts</a></li>
</ul>
</li>
<li class="treeview">
<a href="#">
<i class="fa fa-laptop"></i>
<span>UI Elements</span>
<span class="pull-right-container">
<i class="fa fa-angle-left pull-right"></i>
</span>
</a>
<ul class="treeview-menu">
<li><a href="../UI/general.html"><i class="fa fa-circle-o"></i> General</a></li>
<li><a href="../UI/icons.html"><i class="fa fa-circle-o"></i> Icons</a></li>
<li><a href="../UI/buttons.html"><i class="fa fa-circle-o"></i> Buttons</a></li>
<li><a href="../UI/sliders.html"><i class="fa fa-circle-o"></i> Sliders</a></li>
<li><a href="../UI/timeline.html"><i class="fa fa-circle-o"></i> Timeline</a></li>
<li><a href="../UI/modals.html"><i class="fa fa-circle-o"></i> Modals</a></li>
</ul>
</li>
<li class="treeview">
<a href="#">
<i class="fa fa-edit"></i> <span>Forms</span>
<span class="pull-right-container">
<i class="fa fa-angle-left pull-right"></i>
</span>
</a>
<ul class="treeview-menu">
<li><a href="../forms/general.html"><i class="fa fa-circle-o"></i> General Elements</a></li>
<li><a href="../forms/advanced.html"><i class="fa fa-circle-o"></i> Advanced Elements</a></li>
<li><a href="../forms/editors.html"><i class="fa fa-circle-o"></i> Editors</a></li>
</ul>
</li>
<li class="treeview">
<a href="#">
<i class="fa fa-table"></i> <span>Tables</span>
<span class="pull-right-container">
<i class="fa fa-angle-left pull-right"></i>
</span>
</a>
<ul class="treeview-menu">
<li><a href="../tables/simple.html"><i class="fa fa-circle-o"></i> Simple tables</a></li>
<li><a href="../tables/data.html"><i class="fa fa-circle-o"></i> Data tables</a></li>
</ul>
</li>
<li>
<a href="../calendar.html">
<i class="fa fa-calendar"></i> <span>Calendar</span>
<span class="pull-right-container">
<small class="label pull-right bg-red">3</small>
<small class="label pull-right bg-blue">17</small>
</span>
</a>
</li>
<li>
<a href="../mailbox/mailbox.html">
<i class="fa fa-envelope"></i> <span>Mailbox</span>
<span class="pull-right-container">
<small class="label pull-right bg-yellow">12</small>
<small class="label pull-right bg-green">16</small>
<small class="label pull-right bg-red">5</small>
</span>
</a>
</li>
<li class="treeview">
<a href="#">
<i class="fa fa-folder"></i> <span>Examples</span>
<span class="pull-right-container">
<i class="fa fa-angle-left pull-right"></i>
</span>
</a>
<ul class="treeview-menu">
<li><a href="../examples/invoice.html"><i class="fa fa-circle-o"></i> Invoice</a></li>
<li><a href="../examples/profile.html"><i class="fa fa-circle-o"></i> Profile</a></li>
<li><a href="../examples/login.html"><i class="fa fa-circle-o"></i> Login</a></li>
<li><a href="../examples/register.html"><i class="fa fa-circle-o"></i> Register</a></li>
<li><a href="../examples/lockscreen.html"><i class="fa fa-circle-o"></i> Lockscreen</a></li>
<li><a href="../examples/404.html"><i class="fa fa-circle-o"></i> 404 Error</a></li>
<li><a href="../examples/500.html"><i class="fa fa-circle-o"></i> 500 Error</a></li>
<li><a href="../examples/blank.html"><i class="fa fa-circle-o"></i> Blank Page</a></li>
<li><a href="../examples/pace.html"><i class="fa fa-circle-o"></i> Pace Page</a></li>
</ul>
</li>
<li class="treeview">
<a href="#">
<i class="fa fa-share"></i> <span>Multilevel</span>
<span class="pull-right-container">
<i class="fa fa-angle-left pull-right"></i>
</span>
</a>
<ul class="treeview-menu">
<li><a href="#"><i class="fa fa-circle-o"></i> Level One</a></li>
<li>
<a href="#"><i class="fa fa-circle-o"></i> Level One
<span class="pull-right-container">
<i class="fa fa-angle-left pull-right"></i>
</span>
</a>
<ul class="treeview-menu">
<li><a href="#"><i class="fa fa-circle-o"></i> Level Two</a></li>
<li>
<a href="#"><i class="fa fa-circle-o"></i> Level Two
<span class="pull-right-container">
<i class="fa fa-angle-left pull-right"></i>
</span>
</a>
<ul class="treeview-menu">
<li><a href="#"><i class="fa fa-circle-o"></i> Level Three</a></li>
<li><a href="#"><i class="fa fa-circle-o"></i> Level Three</a></li>
</ul>
</li>
</ul>
</li>
<li><a href="#"><i class="fa fa-circle-o"></i> Level One</a></li>
</ul>
</li>
<li><a href="../../documentation/index.html"><i class="fa fa-book"></i> <span>Documentation</span></a></li>
<li class="header">LABELS</li>
<li><a href="#"><i class="fa fa-circle-o text-red"></i> <span>Important</span></a></li>
<li><a href="#"><i class="fa fa-circle-o text-yellow"></i> <span>Warning</span></a></li>
<li><a href="#"><i class="fa fa-circle-o text-aqua"></i> <span>Information</span></a></li>
</ul>
</section>
<!-- /.sidebar -->
</aside>
<!-- Content Wrapper. Contains page content -->
<div class="content-wrapper">
<!-- Content Header (Page header) -->
<section class="content-header">
<h1>
Morris Charts
<small>Preview sample</small>
</h1>
<ol class="breadcrumb">
<li><a href="#"><i class="fa fa-dashboard"></i> Home</a></li>
<li><a href="#">Charts</a></li>
<li class="active">Morris</li>
</ol>
</section>
<!-- Main content -->
<section class="content">
<div class="callout callout-warning">
<h4>Warning!</h4>
<p><b>Morris.js</b> charts are no longer maintained by its author. We would recommend using any of the other
charts that come with the template.</p>
</div>
<div class="row">
<div class="col-md-6">
<!-- AREA CHART -->
<div class="box box-primary">
<div class="box-header with-border">
<h3 class="box-title">Area Chart</h3>
<div class="box-tools pull-right">
<button type="button" class="btn btn-box-tool" data-widget="collapse"><i class="fa fa-minus"></i>
</button>
<button type="button" class="btn btn-box-tool" data-widget="remove"><i class="fa fa-times"></i></button>
</div>
</div>
<div class="box-body chart-responsive">
<div class="chart" id="revenue-chart" style="height: 300px;"></div>
</div>
<!-- /.box-body -->
</div>
<!-- /.box -->
<!-- DONUT CHART -->
<div class="box box-danger">
<div class="box-header with-border">
<h3 class="box-title">Donut Chart</h3>
<div class="box-tools pull-right">
<button type="button" class="btn btn-box-tool" data-widget="collapse"><i class="fa fa-minus"></i>
</button>
<button type="button" class="btn btn-box-tool" data-widget="remove"><i class="fa fa-times"></i></button>
</div>
</div>
<div class="box-body chart-responsive">
<div class="chart" id="sales-chart" style="height: 300px; position: relative;"></div>
</div>
<!-- /.box-body -->
</div>
<!-- /.box -->
</div>
<!-- /.col (LEFT) -->
<div class="col-md-6">
<!-- LINE CHART -->
<div class="box box-info">
<div class="box-header with-border">
<h3 class="box-title">Line Chart</h3>
<div class="box-tools pull-right">
<button type="button" class="btn btn-box-tool" data-widget="collapse"><i class="fa fa-minus"></i>
</button>
<button type="button" class="btn btn-box-tool" data-widget="remove"><i class="fa fa-times"></i></button>
</div>
</div>
<div class="box-body chart-responsive">
<div class="chart" id="line-chart" style="height: 300px;"></div>
</div>
<!-- /.box-body -->
</div>
<!-- /.box -->
<!-- BAR CHART -->
<div class="box box-success">
<div class="box-header with-border">
<h3 class="box-title">Bar Chart</h3>
<div class="box-tools pull-right">
<button type="button" class="btn btn-box-tool" data-widget="collapse"><i class="fa fa-minus"></i>
</button>
<button type="button" class="btn btn-box-tool" data-widget="remove"><i class="fa fa-times"></i></button>
</div>
</div>
<div class="box-body chart-responsive">
<div class="chart" id="bar-chart" style="height: 300px;"></div>
</div>
<!-- /.box-body -->
</div>
<!-- /.box -->
</div>
<!-- /.col (RIGHT) -->
</div>
<!-- /.row -->
</section>
<!-- /.content -->
</div>
<!-- /.content-wrapper -->
<footer class="main-footer">
<div class="pull-right hidden-xs">
<b>Version</b> 2.3.6
</div>
<strong>Copyright © 2014-2016 <a href="http://almsaeedstudio.com">Almsaeed Studio</a>.</strong> All rights
reserved.
</footer>
<!-- Control Sidebar -->
<aside class="control-sidebar control-sidebar-dark">
<!-- Create the tabs -->
<ul class="nav nav-tabs nav-justified control-sidebar-tabs">
<li><a href="#control-sidebar-home-tab" data-toggle="tab"><i class="fa fa-home"></i></a></li>
<li><a href="#control-sidebar-settings-tab" data-toggle="tab"><i class="fa fa-gears"></i></a></li>
</ul>
<!-- Tab panes -->
<div class="tab-content">
<!-- Home tab content -->
<div class="tab-pane" id="control-sidebar-home-tab">
<h3 class="control-sidebar-heading">Recent Activity</h3>
<ul class="control-sidebar-menu">
<li>
<a href="javascript:void(0)">
<i class="menu-icon fa fa-birthday-cake bg-red"></i>
<div class="menu-info">
<h4 class="control-sidebar-subheading">Langdon's Birthday</h4>
<p>Will be 23 on April 24th</p>
</div>
</a>
</li>
<li>
<a href="javascript:void(0)">
<i class="menu-icon fa fa-user bg-yellow"></i>
<div class="menu-info">
<h4 class="control-sidebar-subheading">Frodo Updated His Profile</h4>
<p>New phone +1(800)555-1234</p>
</div>
</a>
</li>
<li>
<a href="javascript:void(0)">
<i class="menu-icon fa fa-envelope-o bg-light-blue"></i>
<div class="menu-info">
<h4 class="control-sidebar-subheading">Nora Joined Mailing List</h4>
<p>[email protected]</p>
</div>
</a>
</li>
<li>
<a href="javascript:void(0)">
<i class="menu-icon fa fa-file-code-o bg-green"></i>
<div class="menu-info">
<h4 class="control-sidebar-subheading">Cron Job 254 Executed</h4>
<p>Execution time 5 seconds</p>
</div>
</a>
</li>
</ul>
<!-- /.control-sidebar-menu -->
<h3 class="control-sidebar-heading">Tasks Progress</h3>
<ul class="control-sidebar-menu">
<li>
<a href="javascript:void(0)">
<h4 class="control-sidebar-subheading">
Custom Template Design
<span class="label label-danger pull-right">70%</span>
</h4>
<div class="progress progress-xxs">
<div class="progress-bar progress-bar-danger" style="width: 70%"></div>
</div>
</a>
</li>
<li>
<a href="javascript:void(0)">
<h4 class="control-sidebar-subheading">
Update Resume
<span class="label label-success pull-right">95%</span>
</h4>
<div class="progress progress-xxs">
<div class="progress-bar progress-bar-success" style="width: 95%"></div>
</div>
</a>
</li>
<li>
<a href="javascript:void(0)">
<h4 class="control-sidebar-subheading">
Laravel Integration
<span class="label label-warning pull-right">50%</span>
</h4>
<div class="progress progress-xxs">
<div class="progress-bar progress-bar-warning" style="width: 50%"></div>
</div>
</a>
</li>
<li>
<a href="javascript:void(0)">
<h4 class="control-sidebar-subheading">
Back End Framework
<span class="label label-primary pull-right">68%</span>
</h4>
<div class="progress progress-xxs">
<div class="progress-bar progress-bar-primary" style="width: 68%"></div>
</div>
</a>
</li>
</ul>
<!-- /.control-sidebar-menu -->
</div>
<!-- /.tab-pane -->
<!-- Stats tab content -->
<div class="tab-pane" id="control-sidebar-stats-tab">Stats Tab Content</div>
<!-- /.tab-pane -->
<!-- Settings tab content -->
<div class="tab-pane" id="control-sidebar-settings-tab">
<form method="post">
<h3 class="control-sidebar-heading">General Settings</h3>
<div class="form-group">
<label class="control-sidebar-subheading">
Report panel usage
<input type="checkbox" class="pull-right" checked>
</label>
<p>
Some information about this general settings option
</p>
</div>
<!-- /.form-group -->
<div class="form-group">
<label class="control-sidebar-subheading">
Allow mail redirect
<input type="checkbox" class="pull-right" checked>
</label>
<p>
Other sets of options are available
</p>
</div>
<!-- /.form-group -->
<div class="form-group">
<label class="control-sidebar-subheading">
Expose author name in posts
<input type="checkbox" class="pull-right" checked>
</label>
<p>
Allow the user to show his name in blog posts
</p>
</div>
<!-- /.form-group -->
<h3 class="control-sidebar-heading">Chat Settings</h3>
<div class="form-group">
<label class="control-sidebar-subheading">
Show me as online
<input type="checkbox" class="pull-right" checked>
</label>
</div>
<!-- /.form-group -->
<div class="form-group">
<label class="control-sidebar-subheading">
Turn off notifications
<input type="checkbox" class="pull-right">
</label>
</div>
<!-- /.form-group -->
<div class="form-group">
<label class="control-sidebar-subheading">
Delete chat history
<a href="javascript:void(0)" class="text-red pull-right"><i class="fa fa-trash-o"></i></a>
</label>
</div>
<!-- /.form-group -->
</form>
</div>
<!-- /.tab-pane -->
</div>
</aside>
<!-- /.control-sidebar -->
<!-- Add the sidebar's background. This div must be placed
immediately after the control sidebar -->
<div class="control-sidebar-bg"></div>
</div>
<!-- ./wrapper -->
<!-- jQuery 2.2.3 -->
<script src="../../plugins/jQuery/jquery-2.2.3.min.js"></script>
<!-- Bootstrap 3.3.6 -->
<script src="../../bootstrap/js/bootstrap.min.js"></script>
<!-- Morris.js charts -->
<script src="https://cdnjs.cloudflare.com/ajax/libs/raphael/2.1.0/raphael-min.js"></script>
<script src="../../plugins/morris/morris.min.js"></script>
<!-- FastClick -->
<script src="../../plugins/fastclick/fastclick.js"></script>
<!-- AdminLTE App -->
<script src="../../dist/js/app.min.js"></script>
<!-- AdminLTE for demo purposes -->
<script src="../../dist/js/demo.js"></script>
<!-- page script -->
<script>
$(function () {
"use strict";
// AREA CHART
var area = new Morris.Area({
element: 'revenue-chart',
resize: true,
data: [
{y: '2011 Q1', item1: 2666, item2: 2666},
{y: '2011 Q2', item1: 2778, item2: 2294},
{y: '2011 Q3', item1: 4912, item2: 1969},
{y: '2011 Q4', item1: 3767, item2: 3597},
{y: '2012 Q1', item1: 6810, item2: 1914},
{y: '2012 Q2', item1: 5670, item2: 4293},
{y: '2012 Q3', item1: 4820, item2: 3795},
{y: '2012 Q4', item1: 15073, item2: 5967},
{y: '2013 Q1', item1: 10687, item2: 4460},
{y: '2013 Q2', item1: 8432, item2: 5713}
],
xkey: 'y',
ykeys: ['item1', 'item2'],
labels: ['Item 1', 'Item 2'],
lineColors: ['#a0d0e0', '#3c8dbc'],
hideHover: 'auto'
});
// LINE CHART
var line = new Morris.Line({
element: 'line-chart',
resize: true,
data: [
{y: '2011 Q1', item1: 2666},
{y: '2011 Q2', item1: 2778},
{y: '2011 Q3', item1: 4912},
{y: '2011 Q4', item1: 3767},
{y: '2012 Q1', item1: 6810},
{y: '2012 Q2', item1: 5670},
{y: '2012 Q3', item1: 4820},
{y: '2012 Q4', item1: 15073},
{y: '2013 Q1', item1: 10687},
{y: '2013 Q2', item1: 8432}
],
xkey: 'y',
ykeys: ['item1'],
labels: ['Item 1'],
lineColors: ['#3c8dbc'],
hideHover: 'auto'
});
//DONUT CHART
var donut = new Morris.Donut({
element: 'sales-chart',
resize: true,
colors: ["#3c8dbc", "#f56954", "#00a65a"],
data: [
{label: "Download Sales", value: 12},
{label: "In-Store Sales", value: 30},
{label: "Mail-Order Sales", value: 20}
],
hideHover: 'auto'
});
//BAR CHART
var bar = new Morris.Bar({
element: 'bar-chart',
resize: true,
data: [
{y: '2006', a: 100, b: 90},
{y: '2007', a: 75, b: 65},
{y: '2008', a: 50, b: 40},
{y: '2009', a: 75, b: 65},
{y: '2010', a: 50, b: 40},
{y: '2011', a: 75, b: 65},
{y: '2012', a: 100, b: 90}
],
barColors: ['#00a65a', '#f56954'],
xkey: 'y',
ykeys: ['a', 'b'],
labels: ['CPU', 'DISK'],
hideHover: 'auto'
});
});
</script>
</body>
</html>
| {
"pile_set_name": "Github"
} |
module Effect.Memory
import Effects
import Control.IOExcept
import Data.Vect
import public Data.So
%access public export
export
data MemoryChunk : Nat -> Nat -> Type where
CH : Ptr -> MemoryChunk size initialized
export
data RawMemory : Effect where
Allocate : (n : Nat) ->
RawMemory () () (\v => MemoryChunk n 0)
Free : RawMemory () (MemoryChunk n i) (\v => ())
Initialize : Bits8 ->
(size : Nat) ->
So (i + size <= n) ->
RawMemory () (MemoryChunk n i) (\v => MemoryChunk n (i + size))
Peek : (offset : Nat) ->
(size : Nat) ->
So (offset + size <= i) ->
RawMemory (Vect size Bits8)
(MemoryChunk n i) (\v => MemoryChunk n i)
Poke : (offset : Nat) ->
(Vect size Bits8) ->
So (offset <= i && offset + size <= n) ->
RawMemory () (MemoryChunk n i) (\v => MemoryChunk n (max i (offset + size)))
Move : (src : MemoryChunk src_size src_init) ->
(dst_offset : Nat) ->
(src_offset : Nat) ->
(size : Nat) ->
So (dst_offset <= dst_init && dst_offset + size <= dst_size) ->
So (src_offset + size <= src_init) ->
RawMemory () (MemoryChunk dst_size dst_init)
(\v => MemoryChunk dst_size (max dst_init (dst_offset + size)))
GetRawPtr : RawMemory (MemoryChunk n i) (MemoryChunk n i) (\v => MemoryChunk n i)
private
do_malloc : Nat -> IOExcept String Ptr
do_malloc size with (fromInteger (cast size) == size)
| True = do ptr <- ioe_lift $ foreign FFI_C "malloc" (Int -> IO Ptr) (fromInteger $ cast size)
fail <- ioe_lift $ nullPtr ptr
if fail then ioe_fail "Cannot allocate memory"
else pure ptr
| False = ioe_fail "The target architecture does not support adressing enough memory"
private
do_memset : Ptr -> Nat -> Bits8 -> Nat -> IO ()
do_memset ptr offset c size
= foreign FFI_C "idris_memset" (Ptr -> Int -> Bits8 -> Int -> IO ())
ptr (fromInteger $ cast offset) c (fromInteger $ cast size)
private
do_free : Ptr -> IO ()
do_free ptr = foreign FFI_C "free" (Ptr -> IO ()) ptr
private
do_memmove : Ptr -> Ptr -> Nat -> Nat -> Nat -> IO ()
do_memmove dest src dest_offset src_offset size
= foreign FFI_C "idris_memmove" (Ptr -> Ptr -> Int -> Int -> Int -> IO ())
dest src (fromInteger $ cast dest_offset) (fromInteger $ cast src_offset) (fromInteger $ cast size)
private
do_peek : Ptr -> Nat -> (size : Nat) -> IO (Vect size Bits8)
do_peek _ _ Z = pure (Vect.Nil)
do_peek ptr offset (S n)
= do b <- foreign FFI_C "idris_peek" (Ptr -> Int -> IO Bits8) ptr (fromInteger $ cast offset)
bs <- do_peek ptr (S offset) n
Applicative.pure (Vect.(::) b bs)
private
do_poke : Ptr -> Nat -> Vect size Bits8 -> IO ()
do_poke _ _ [] = pure ()
do_poke ptr offset (b::bs)
= do foreign FFI_C "idris_poke" (Ptr -> Int -> Bits8 -> IO ()) ptr (fromInteger $ cast offset) b
do_poke ptr (S offset) bs
implementation Handler RawMemory (IOExcept String) where
handle () (Allocate n) k
= do ptr <- do_malloc n
k () (CH ptr)
handle {-{res = MemoryChunk _ offset}-} (CH ptr) (Initialize {i} c size _) k
= ioe_lift (do_memset ptr i c size) *> k () (CH ptr)
handle (CH ptr) (Free) k
= ioe_lift (do_free ptr) *> k () ()
handle (CH ptr) (Peek offset size _) k
= do res <- ioe_lift (do_peek ptr offset size)
k res (CH ptr)
handle (CH ptr) (Poke offset content _) k
= do ioe_lift (do_poke ptr offset content)
k () (CH ptr)
handle (CH dest_ptr) (Move (CH src_ptr) dest_offset src_offset size _ _) k
= do ioe_lift (do_memmove dest_ptr src_ptr dest_offset src_offset size)
k () (CH dest_ptr)
handle chunk (GetRawPtr) k
= k chunk chunk
RAW_MEMORY : Type -> EFFECT
RAW_MEMORY t = MkEff t RawMemory
export
allocate : (n : Nat) ->
Eff () [RAW_MEMORY ()] (\v => [RAW_MEMORY (MemoryChunk n 0)])
allocate size = call $ Allocate size
export
initialize : {i : Nat} ->
{n : Nat} ->
Bits8 ->
(size : Nat) ->
So (i + size <= n) ->
Eff () [RAW_MEMORY (MemoryChunk n i)]
(\v => [RAW_MEMORY (MemoryChunk n (i + size))])
initialize c size prf = call $ Initialize c size prf
export
free : Eff () [RAW_MEMORY (MemoryChunk n i)] (\v => [RAW_MEMORY ()])
free = call Free
export
peek : {i : Nat} ->
(offset : Nat) ->
(size : Nat) ->
So (offset + size <= i) ->
{ [RAW_MEMORY (MemoryChunk n i)] } Eff (Vect size Bits8)
peek offset size prf = call $ Peek offset size prf
export
poke : {n : Nat} ->
{i : Nat} ->
(offset : Nat) ->
Vect size Bits8 ->
So (offset <= i && offset + size <= n) ->
Eff () [RAW_MEMORY (MemoryChunk n i)]
(\v => [RAW_MEMORY (MemoryChunk n (max i (offset + size)))])
poke offset content prf = call $ Poke offset content prf
private
getRawPtr : { [RAW_MEMORY (MemoryChunk n i)] } Eff (MemoryChunk n i)
getRawPtr = call $ GetRawPtr
private
move' : {dst_size : Nat} ->
{dst_init : Nat} ->
{src_init : Nat} ->
(src_ptr : MemoryChunk src_size src_init) ->
(dst_offset : Nat) ->
(src_offset : Nat) ->
(size : Nat) ->
So (dst_offset <= dst_init && dst_offset + size <= dst_size) ->
So (src_offset + size <= src_init) ->
Eff () [RAW_MEMORY (MemoryChunk dst_size dst_init)]
(\v => [RAW_MEMORY (MemoryChunk dst_size (max dst_init (dst_offset + size)))])
move' src_ptr dst_offset src_offset size dst_bounds src_bounds
= call $ Move src_ptr dst_offset src_offset size dst_bounds src_bounds
data MoveDescriptor = Dst | Src
export
move : {dst_size : Nat} ->
{dst_init : Nat} ->
{src_size : Nat} ->
{src_init : Nat} ->
(dst_offset : Nat) ->
(src_offset : Nat) ->
(size : Nat) ->
So (dst_offset <= dst_init && dst_offset + size <= dst_size) ->
So (src_offset + size <= src_init) ->
Eff ()
[ Dst ::: RAW_MEMORY (MemoryChunk dst_size dst_init)
, Src ::: RAW_MEMORY (MemoryChunk src_size src_init)]
(\v =>
[ Dst ::: RAW_MEMORY (MemoryChunk dst_size (max dst_init (dst_offset + size)))
, Src ::: RAW_MEMORY (MemoryChunk src_size src_init)])
move dst_offset src_offset size dst_bounds src_bounds
= do src_ptr <- Src :- getRawPtr
Dst :- move' src_ptr dst_offset src_offset size dst_bounds src_bounds
pure ()
| {
"pile_set_name": "Github"
} |
// Copyright 2007, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// Author: [email protected] (Zhanyong Wan)
// Google Mock - a framework for writing C++ mock classes.
//
// This file tests the built-in actions.
#include "gmock/gmock-actions.h"
#include <algorithm>
#include <iterator>
#include <string>
#include "gmock/gmock.h"
#include "gmock/internal/gmock-port.h"
#include "gtest/gtest.h"
#include "gtest/gtest-spi.h"
namespace {
using ::std::tr1::get;
using ::std::tr1::make_tuple;
using ::std::tr1::tuple;
using ::std::tr1::tuple_element;
using testing::internal::BuiltInDefaultValue;
using testing::internal::Int64;
using testing::internal::UInt64;
// This list should be kept sorted.
using testing::_;
using testing::Action;
using testing::ActionInterface;
using testing::Assign;
using testing::ByRef;
using testing::DefaultValue;
using testing::DoDefault;
using testing::IgnoreResult;
using testing::Invoke;
using testing::InvokeWithoutArgs;
using testing::MakePolymorphicAction;
using testing::Ne;
using testing::PolymorphicAction;
using testing::Return;
using testing::ReturnNull;
using testing::ReturnRef;
using testing::ReturnRefOfCopy;
using testing::SetArgPointee;
using testing::SetArgumentPointee;
#if !GTEST_OS_WINDOWS_MOBILE
using testing::SetErrnoAndReturn;
#endif
#if GTEST_HAS_PROTOBUF_
using testing::internal::TestMessage;
#endif // GTEST_HAS_PROTOBUF_
// Tests that BuiltInDefaultValue<T*>::Get() returns NULL.
TEST(BuiltInDefaultValueTest, IsNullForPointerTypes) {
EXPECT_TRUE(BuiltInDefaultValue<int*>::Get() == NULL);
EXPECT_TRUE(BuiltInDefaultValue<const char*>::Get() == NULL);
EXPECT_TRUE(BuiltInDefaultValue<void*>::Get() == NULL);
}
// Tests that BuiltInDefaultValue<T*>::Exists() return true.
TEST(BuiltInDefaultValueTest, ExistsForPointerTypes) {
EXPECT_TRUE(BuiltInDefaultValue<int*>::Exists());
EXPECT_TRUE(BuiltInDefaultValue<const char*>::Exists());
EXPECT_TRUE(BuiltInDefaultValue<void*>::Exists());
}
// Tests that BuiltInDefaultValue<T>::Get() returns 0 when T is a
// built-in numeric type.
TEST(BuiltInDefaultValueTest, IsZeroForNumericTypes) {
EXPECT_EQ(0U, BuiltInDefaultValue<unsigned char>::Get());
EXPECT_EQ(0, BuiltInDefaultValue<signed char>::Get());
EXPECT_EQ(0, BuiltInDefaultValue<char>::Get());
#if GMOCK_HAS_SIGNED_WCHAR_T_
EXPECT_EQ(0U, BuiltInDefaultValue<unsigned wchar_t>::Get());
EXPECT_EQ(0, BuiltInDefaultValue<signed wchar_t>::Get());
#endif
#if GMOCK_WCHAR_T_IS_NATIVE_
EXPECT_EQ(0, BuiltInDefaultValue<wchar_t>::Get());
#endif
EXPECT_EQ(0U, BuiltInDefaultValue<unsigned short>::Get()); // NOLINT
EXPECT_EQ(0, BuiltInDefaultValue<signed short>::Get()); // NOLINT
EXPECT_EQ(0, BuiltInDefaultValue<short>::Get()); // NOLINT
EXPECT_EQ(0U, BuiltInDefaultValue<unsigned int>::Get());
EXPECT_EQ(0, BuiltInDefaultValue<signed int>::Get());
EXPECT_EQ(0, BuiltInDefaultValue<int>::Get());
EXPECT_EQ(0U, BuiltInDefaultValue<unsigned long>::Get()); // NOLINT
EXPECT_EQ(0, BuiltInDefaultValue<signed long>::Get()); // NOLINT
EXPECT_EQ(0, BuiltInDefaultValue<long>::Get()); // NOLINT
EXPECT_EQ(0U, BuiltInDefaultValue<UInt64>::Get());
EXPECT_EQ(0, BuiltInDefaultValue<Int64>::Get());
EXPECT_EQ(0, BuiltInDefaultValue<float>::Get());
EXPECT_EQ(0, BuiltInDefaultValue<double>::Get());
}
// Tests that BuiltInDefaultValue<T>::Exists() returns true when T is a
// built-in numeric type.
TEST(BuiltInDefaultValueTest, ExistsForNumericTypes) {
EXPECT_TRUE(BuiltInDefaultValue<unsigned char>::Exists());
EXPECT_TRUE(BuiltInDefaultValue<signed char>::Exists());
EXPECT_TRUE(BuiltInDefaultValue<char>::Exists());
#if GMOCK_HAS_SIGNED_WCHAR_T_
EXPECT_TRUE(BuiltInDefaultValue<unsigned wchar_t>::Exists());
EXPECT_TRUE(BuiltInDefaultValue<signed wchar_t>::Exists());
#endif
#if GMOCK_WCHAR_T_IS_NATIVE_
EXPECT_TRUE(BuiltInDefaultValue<wchar_t>::Exists());
#endif
EXPECT_TRUE(BuiltInDefaultValue<unsigned short>::Exists()); // NOLINT
EXPECT_TRUE(BuiltInDefaultValue<signed short>::Exists()); // NOLINT
EXPECT_TRUE(BuiltInDefaultValue<short>::Exists()); // NOLINT
EXPECT_TRUE(BuiltInDefaultValue<unsigned int>::Exists());
EXPECT_TRUE(BuiltInDefaultValue<signed int>::Exists());
EXPECT_TRUE(BuiltInDefaultValue<int>::Exists());
EXPECT_TRUE(BuiltInDefaultValue<unsigned long>::Exists()); // NOLINT
EXPECT_TRUE(BuiltInDefaultValue<signed long>::Exists()); // NOLINT
EXPECT_TRUE(BuiltInDefaultValue<long>::Exists()); // NOLINT
EXPECT_TRUE(BuiltInDefaultValue<UInt64>::Exists());
EXPECT_TRUE(BuiltInDefaultValue<Int64>::Exists());
EXPECT_TRUE(BuiltInDefaultValue<float>::Exists());
EXPECT_TRUE(BuiltInDefaultValue<double>::Exists());
}
// Tests that BuiltInDefaultValue<bool>::Get() returns false.
TEST(BuiltInDefaultValueTest, IsFalseForBool) {
EXPECT_FALSE(BuiltInDefaultValue<bool>::Get());
}
// Tests that BuiltInDefaultValue<bool>::Exists() returns true.
TEST(BuiltInDefaultValueTest, BoolExists) {
EXPECT_TRUE(BuiltInDefaultValue<bool>::Exists());
}
// Tests that BuiltInDefaultValue<T>::Get() returns "" when T is a
// string type.
TEST(BuiltInDefaultValueTest, IsEmptyStringForString) {
#if GTEST_HAS_GLOBAL_STRING
EXPECT_EQ("", BuiltInDefaultValue< ::string>::Get());
#endif // GTEST_HAS_GLOBAL_STRING
EXPECT_EQ("", BuiltInDefaultValue< ::std::string>::Get());
}
// Tests that BuiltInDefaultValue<T>::Exists() returns true when T is a
// string type.
TEST(BuiltInDefaultValueTest, ExistsForString) {
#if GTEST_HAS_GLOBAL_STRING
EXPECT_TRUE(BuiltInDefaultValue< ::string>::Exists());
#endif // GTEST_HAS_GLOBAL_STRING
EXPECT_TRUE(BuiltInDefaultValue< ::std::string>::Exists());
}
// Tests that BuiltInDefaultValue<const T>::Get() returns the same
// value as BuiltInDefaultValue<T>::Get() does.
TEST(BuiltInDefaultValueTest, WorksForConstTypes) {
EXPECT_EQ("", BuiltInDefaultValue<const std::string>::Get());
EXPECT_EQ(0, BuiltInDefaultValue<const int>::Get());
EXPECT_TRUE(BuiltInDefaultValue<char* const>::Get() == NULL);
EXPECT_FALSE(BuiltInDefaultValue<const bool>::Get());
}
// Tests that BuiltInDefaultValue<T>::Get() aborts the program with
// the correct error message when T is a user-defined type.
struct UserType {
UserType() : value(0) {}
int value;
};
TEST(BuiltInDefaultValueTest, UserTypeHasNoDefault) {
EXPECT_FALSE(BuiltInDefaultValue<UserType>::Exists());
}
// Tests that BuiltInDefaultValue<T&>::Get() aborts the program.
TEST(BuiltInDefaultValueDeathTest, IsUndefinedForReferences) {
EXPECT_DEATH_IF_SUPPORTED({
BuiltInDefaultValue<int&>::Get();
}, "");
EXPECT_DEATH_IF_SUPPORTED({
BuiltInDefaultValue<const char&>::Get();
}, "");
}
TEST(BuiltInDefaultValueDeathTest, IsUndefinedForUserTypes) {
EXPECT_DEATH_IF_SUPPORTED({
BuiltInDefaultValue<UserType>::Get();
}, "");
}
// Tests that DefaultValue<T>::IsSet() is false initially.
TEST(DefaultValueTest, IsInitiallyUnset) {
EXPECT_FALSE(DefaultValue<int>::IsSet());
EXPECT_FALSE(DefaultValue<const UserType>::IsSet());
}
// Tests that DefaultValue<T> can be set and then unset.
TEST(DefaultValueTest, CanBeSetAndUnset) {
EXPECT_TRUE(DefaultValue<int>::Exists());
EXPECT_FALSE(DefaultValue<const UserType>::Exists());
DefaultValue<int>::Set(1);
DefaultValue<const UserType>::Set(UserType());
EXPECT_EQ(1, DefaultValue<int>::Get());
EXPECT_EQ(0, DefaultValue<const UserType>::Get().value);
EXPECT_TRUE(DefaultValue<int>::Exists());
EXPECT_TRUE(DefaultValue<const UserType>::Exists());
DefaultValue<int>::Clear();
DefaultValue<const UserType>::Clear();
EXPECT_FALSE(DefaultValue<int>::IsSet());
EXPECT_FALSE(DefaultValue<const UserType>::IsSet());
EXPECT_TRUE(DefaultValue<int>::Exists());
EXPECT_FALSE(DefaultValue<const UserType>::Exists());
}
// Tests that DefaultValue<T>::Get() returns the
// BuiltInDefaultValue<T>::Get() when DefaultValue<T>::IsSet() is
// false.
TEST(DefaultValueDeathTest, GetReturnsBuiltInDefaultValueWhenUnset) {
EXPECT_FALSE(DefaultValue<int>::IsSet());
EXPECT_TRUE(DefaultValue<int>::Exists());
EXPECT_FALSE(DefaultValue<UserType>::IsSet());
EXPECT_FALSE(DefaultValue<UserType>::Exists());
EXPECT_EQ(0, DefaultValue<int>::Get());
EXPECT_DEATH_IF_SUPPORTED({
DefaultValue<UserType>::Get();
}, "");
}
// Tests that DefaultValue<void>::Get() returns void.
TEST(DefaultValueTest, GetWorksForVoid) {
return DefaultValue<void>::Get();
}
// Tests using DefaultValue with a reference type.
// Tests that DefaultValue<T&>::IsSet() is false initially.
TEST(DefaultValueOfReferenceTest, IsInitiallyUnset) {
EXPECT_FALSE(DefaultValue<int&>::IsSet());
EXPECT_FALSE(DefaultValue<UserType&>::IsSet());
}
// Tests that DefaultValue<T&>::Exists is false initiallly.
TEST(DefaultValueOfReferenceTest, IsInitiallyNotExisting) {
EXPECT_FALSE(DefaultValue<int&>::Exists());
EXPECT_FALSE(DefaultValue<UserType&>::Exists());
}
// Tests that DefaultValue<T&> can be set and then unset.
TEST(DefaultValueOfReferenceTest, CanBeSetAndUnset) {
int n = 1;
DefaultValue<const int&>::Set(n);
UserType u;
DefaultValue<UserType&>::Set(u);
EXPECT_TRUE(DefaultValue<const int&>::Exists());
EXPECT_TRUE(DefaultValue<UserType&>::Exists());
EXPECT_EQ(&n, &(DefaultValue<const int&>::Get()));
EXPECT_EQ(&u, &(DefaultValue<UserType&>::Get()));
DefaultValue<const int&>::Clear();
DefaultValue<UserType&>::Clear();
EXPECT_FALSE(DefaultValue<const int&>::Exists());
EXPECT_FALSE(DefaultValue<UserType&>::Exists());
EXPECT_FALSE(DefaultValue<const int&>::IsSet());
EXPECT_FALSE(DefaultValue<UserType&>::IsSet());
}
// Tests that DefaultValue<T&>::Get() returns the
// BuiltInDefaultValue<T&>::Get() when DefaultValue<T&>::IsSet() is
// false.
TEST(DefaultValueOfReferenceDeathTest, GetReturnsBuiltInDefaultValueWhenUnset) {
EXPECT_FALSE(DefaultValue<int&>::IsSet());
EXPECT_FALSE(DefaultValue<UserType&>::IsSet());
EXPECT_DEATH_IF_SUPPORTED({
DefaultValue<int&>::Get();
}, "");
EXPECT_DEATH_IF_SUPPORTED({
DefaultValue<UserType>::Get();
}, "");
}
// Tests that ActionInterface can be implemented by defining the
// Perform method.
typedef int MyGlobalFunction(bool, int);
class MyActionImpl : public ActionInterface<MyGlobalFunction> {
public:
virtual int Perform(const tuple<bool, int>& args) {
return get<0>(args) ? get<1>(args) : 0;
}
};
TEST(ActionInterfaceTest, CanBeImplementedByDefiningPerform) {
MyActionImpl my_action_impl;
(void)my_action_impl;
}
TEST(ActionInterfaceTest, MakeAction) {
Action<MyGlobalFunction> action = MakeAction(new MyActionImpl);
// When exercising the Perform() method of Action<F>, we must pass
// it a tuple whose size and type are compatible with F's argument
// types. For example, if F is int(), then Perform() takes a
// 0-tuple; if F is void(bool, int), then Perform() takes a
// tuple<bool, int>, and so on.
EXPECT_EQ(5, action.Perform(make_tuple(true, 5)));
}
// Tests that Action<F> can be contructed from a pointer to
// ActionInterface<F>.
TEST(ActionTest, CanBeConstructedFromActionInterface) {
Action<MyGlobalFunction> action(new MyActionImpl);
}
// Tests that Action<F> delegates actual work to ActionInterface<F>.
TEST(ActionTest, DelegatesWorkToActionInterface) {
const Action<MyGlobalFunction> action(new MyActionImpl);
EXPECT_EQ(5, action.Perform(make_tuple(true, 5)));
EXPECT_EQ(0, action.Perform(make_tuple(false, 1)));
}
// Tests that Action<F> can be copied.
TEST(ActionTest, IsCopyable) {
Action<MyGlobalFunction> a1(new MyActionImpl);
Action<MyGlobalFunction> a2(a1); // Tests the copy constructor.
// a1 should continue to work after being copied from.
EXPECT_EQ(5, a1.Perform(make_tuple(true, 5)));
EXPECT_EQ(0, a1.Perform(make_tuple(false, 1)));
// a2 should work like the action it was copied from.
EXPECT_EQ(5, a2.Perform(make_tuple(true, 5)));
EXPECT_EQ(0, a2.Perform(make_tuple(false, 1)));
a2 = a1; // Tests the assignment operator.
// a1 should continue to work after being copied from.
EXPECT_EQ(5, a1.Perform(make_tuple(true, 5)));
EXPECT_EQ(0, a1.Perform(make_tuple(false, 1)));
// a2 should work like the action it was copied from.
EXPECT_EQ(5, a2.Perform(make_tuple(true, 5)));
EXPECT_EQ(0, a2.Perform(make_tuple(false, 1)));
}
// Tests that an Action<From> object can be converted to a
// compatible Action<To> object.
class IsNotZero : public ActionInterface<bool(int)> { // NOLINT
public:
virtual bool Perform(const tuple<int>& arg) {
return get<0>(arg) != 0;
}
};
#if !GTEST_OS_SYMBIAN
// Compiling this test on Nokia's Symbian compiler fails with:
// 'Result' is not a member of class 'testing::internal::Function<int>'
// (point of instantiation: '@unnamed@gmock_actions_test_cc@::
// ActionTest_CanBeConvertedToOtherActionType_Test::TestBody()')
// with no obvious fix.
TEST(ActionTest, CanBeConvertedToOtherActionType) {
const Action<bool(int)> a1(new IsNotZero); // NOLINT
const Action<int(char)> a2 = Action<int(char)>(a1); // NOLINT
EXPECT_EQ(1, a2.Perform(make_tuple('a')));
EXPECT_EQ(0, a2.Perform(make_tuple('\0')));
}
#endif // !GTEST_OS_SYMBIAN
// The following two classes are for testing MakePolymorphicAction().
// Implements a polymorphic action that returns the second of the
// arguments it receives.
class ReturnSecondArgumentAction {
public:
// We want to verify that MakePolymorphicAction() can work with a
// polymorphic action whose Perform() method template is either
// const or not. This lets us verify the non-const case.
template <typename Result, typename ArgumentTuple>
Result Perform(const ArgumentTuple& args) { return get<1>(args); }
};
// Implements a polymorphic action that can be used in a nullary
// function to return 0.
class ReturnZeroFromNullaryFunctionAction {
public:
// For testing that MakePolymorphicAction() works when the
// implementation class' Perform() method template takes only one
// template parameter.
//
// We want to verify that MakePolymorphicAction() can work with a
// polymorphic action whose Perform() method template is either
// const or not. This lets us verify the const case.
template <typename Result>
Result Perform(const tuple<>&) const { return 0; }
};
// These functions verify that MakePolymorphicAction() returns a
// PolymorphicAction<T> where T is the argument's type.
PolymorphicAction<ReturnSecondArgumentAction> ReturnSecondArgument() {
return MakePolymorphicAction(ReturnSecondArgumentAction());
}
PolymorphicAction<ReturnZeroFromNullaryFunctionAction>
ReturnZeroFromNullaryFunction() {
return MakePolymorphicAction(ReturnZeroFromNullaryFunctionAction());
}
// Tests that MakePolymorphicAction() turns a polymorphic action
// implementation class into a polymorphic action.
TEST(MakePolymorphicActionTest, ConstructsActionFromImpl) {
Action<int(bool, int, double)> a1 = ReturnSecondArgument(); // NOLINT
EXPECT_EQ(5, a1.Perform(make_tuple(false, 5, 2.0)));
}
// Tests that MakePolymorphicAction() works when the implementation
// class' Perform() method template has only one template parameter.
TEST(MakePolymorphicActionTest, WorksWhenPerformHasOneTemplateParameter) {
Action<int()> a1 = ReturnZeroFromNullaryFunction();
EXPECT_EQ(0, a1.Perform(make_tuple()));
Action<void*()> a2 = ReturnZeroFromNullaryFunction();
EXPECT_TRUE(a2.Perform(make_tuple()) == NULL);
}
// Tests that Return() works as an action for void-returning
// functions.
TEST(ReturnTest, WorksForVoid) {
const Action<void(int)> ret = Return(); // NOLINT
return ret.Perform(make_tuple(1));
}
// Tests that Return(v) returns v.
TEST(ReturnTest, ReturnsGivenValue) {
Action<int()> ret = Return(1); // NOLINT
EXPECT_EQ(1, ret.Perform(make_tuple()));
ret = Return(-5);
EXPECT_EQ(-5, ret.Perform(make_tuple()));
}
// Tests that Return("string literal") works.
TEST(ReturnTest, AcceptsStringLiteral) {
Action<const char*()> a1 = Return("Hello");
EXPECT_STREQ("Hello", a1.Perform(make_tuple()));
Action<std::string()> a2 = Return("world");
EXPECT_EQ("world", a2.Perform(make_tuple()));
}
// Tests that Return(v) is covaraint.
struct Base {
bool operator==(const Base&) { return true; }
};
struct Derived : public Base {
bool operator==(const Derived&) { return true; }
};
TEST(ReturnTest, IsCovariant) {
Base base;
Derived derived;
Action<Base*()> ret = Return(&base);
EXPECT_EQ(&base, ret.Perform(make_tuple()));
ret = Return(&derived);
EXPECT_EQ(&derived, ret.Perform(make_tuple()));
}
// Tests that the type of the value passed into Return is converted into T
// when the action is cast to Action<T(...)> rather than when the action is
// performed. See comments on testing::internal::ReturnAction in
// gmock-actions.h for more information.
class FromType {
public:
explicit FromType(bool* is_converted) : converted_(is_converted) {}
bool* converted() const { return converted_; }
private:
bool* const converted_;
GTEST_DISALLOW_ASSIGN_(FromType);
};
class ToType {
public:
// Must allow implicit conversion due to use in ImplicitCast_<T>.
ToType(const FromType& x) { *x.converted() = true; } // NOLINT
};
TEST(ReturnTest, ConvertsArgumentWhenConverted) {
bool converted = false;
FromType x(&converted);
Action<ToType()> action(Return(x));
EXPECT_TRUE(converted) << "Return must convert its argument in its own "
<< "conversion operator.";
converted = false;
action.Perform(tuple<>());
EXPECT_FALSE(converted) << "Action must NOT convert its argument "
<< "when performed.";
}
class DestinationType {};
class SourceType {
public:
// Note: a non-const typecast operator.
operator DestinationType() { return DestinationType(); }
};
TEST(ReturnTest, CanConvertArgumentUsingNonConstTypeCastOperator) {
SourceType s;
Action<DestinationType()> action(Return(s));
}
// Tests that ReturnNull() returns NULL in a pointer-returning function.
TEST(ReturnNullTest, WorksInPointerReturningFunction) {
const Action<int*()> a1 = ReturnNull();
EXPECT_TRUE(a1.Perform(make_tuple()) == NULL);
const Action<const char*(bool)> a2 = ReturnNull(); // NOLINT
EXPECT_TRUE(a2.Perform(make_tuple(true)) == NULL);
}
// Tests that ReturnRef(v) works for reference types.
TEST(ReturnRefTest, WorksForReference) {
const int n = 0;
const Action<const int&(bool)> ret = ReturnRef(n); // NOLINT
EXPECT_EQ(&n, &ret.Perform(make_tuple(true)));
}
// Tests that ReturnRef(v) is covariant.
TEST(ReturnRefTest, IsCovariant) {
Base base;
Derived derived;
Action<Base&()> a = ReturnRef(base);
EXPECT_EQ(&base, &a.Perform(make_tuple()));
a = ReturnRef(derived);
EXPECT_EQ(&derived, &a.Perform(make_tuple()));
}
// Tests that ReturnRefOfCopy(v) works for reference types.
TEST(ReturnRefOfCopyTest, WorksForReference) {
int n = 42;
const Action<const int&()> ret = ReturnRefOfCopy(n);
EXPECT_NE(&n, &ret.Perform(make_tuple()));
EXPECT_EQ(42, ret.Perform(make_tuple()));
n = 43;
EXPECT_NE(&n, &ret.Perform(make_tuple()));
EXPECT_EQ(42, ret.Perform(make_tuple()));
}
// Tests that ReturnRefOfCopy(v) is covariant.
TEST(ReturnRefOfCopyTest, IsCovariant) {
Base base;
Derived derived;
Action<Base&()> a = ReturnRefOfCopy(base);
EXPECT_NE(&base, &a.Perform(make_tuple()));
a = ReturnRefOfCopy(derived);
EXPECT_NE(&derived, &a.Perform(make_tuple()));
}
// Tests that DoDefault() does the default action for the mock method.
class MyClass {};
class MockClass {
public:
MockClass() {}
MOCK_METHOD1(IntFunc, int(bool flag)); // NOLINT
MOCK_METHOD0(Foo, MyClass());
private:
GTEST_DISALLOW_COPY_AND_ASSIGN_(MockClass);
};
// Tests that DoDefault() returns the built-in default value for the
// return type by default.
TEST(DoDefaultTest, ReturnsBuiltInDefaultValueByDefault) {
MockClass mock;
EXPECT_CALL(mock, IntFunc(_))
.WillOnce(DoDefault());
EXPECT_EQ(0, mock.IntFunc(true));
}
// Tests that DoDefault() throws (when exceptions are enabled) or aborts
// the process when there is no built-in default value for the return type.
TEST(DoDefaultDeathTest, DiesForUnknowType) {
MockClass mock;
EXPECT_CALL(mock, Foo())
.WillRepeatedly(DoDefault());
#if GTEST_HAS_EXCEPTIONS
EXPECT_ANY_THROW(mock.Foo());
#else
EXPECT_DEATH_IF_SUPPORTED({
mock.Foo();
}, "");
#endif
}
// Tests that using DoDefault() inside a composite action leads to a
// run-time error.
void VoidFunc(bool /* flag */) {}
TEST(DoDefaultDeathTest, DiesIfUsedInCompositeAction) {
MockClass mock;
EXPECT_CALL(mock, IntFunc(_))
.WillRepeatedly(DoAll(Invoke(VoidFunc),
DoDefault()));
// Ideally we should verify the error message as well. Sadly,
// EXPECT_DEATH() can only capture stderr, while Google Mock's
// errors are printed on stdout. Therefore we have to settle for
// not verifying the message.
EXPECT_DEATH_IF_SUPPORTED({
mock.IntFunc(true);
}, "");
}
// Tests that DoDefault() returns the default value set by
// DefaultValue<T>::Set() when it's not overriden by an ON_CALL().
TEST(DoDefaultTest, ReturnsUserSpecifiedPerTypeDefaultValueWhenThereIsOne) {
DefaultValue<int>::Set(1);
MockClass mock;
EXPECT_CALL(mock, IntFunc(_))
.WillOnce(DoDefault());
EXPECT_EQ(1, mock.IntFunc(false));
DefaultValue<int>::Clear();
}
// Tests that DoDefault() does the action specified by ON_CALL().
TEST(DoDefaultTest, DoesWhatOnCallSpecifies) {
MockClass mock;
ON_CALL(mock, IntFunc(_))
.WillByDefault(Return(2));
EXPECT_CALL(mock, IntFunc(_))
.WillOnce(DoDefault());
EXPECT_EQ(2, mock.IntFunc(false));
}
// Tests that using DoDefault() in ON_CALL() leads to a run-time failure.
TEST(DoDefaultTest, CannotBeUsedInOnCall) {
MockClass mock;
EXPECT_NONFATAL_FAILURE({ // NOLINT
ON_CALL(mock, IntFunc(_))
.WillByDefault(DoDefault());
}, "DoDefault() cannot be used in ON_CALL()");
}
// Tests that SetArgPointee<N>(v) sets the variable pointed to by
// the N-th (0-based) argument to v.
TEST(SetArgPointeeTest, SetsTheNthPointee) {
typedef void MyFunction(bool, int*, char*);
Action<MyFunction> a = SetArgPointee<1>(2);
int n = 0;
char ch = '\0';
a.Perform(make_tuple(true, &n, &ch));
EXPECT_EQ(2, n);
EXPECT_EQ('\0', ch);
a = SetArgPointee<2>('a');
n = 0;
ch = '\0';
a.Perform(make_tuple(true, &n, &ch));
EXPECT_EQ(0, n);
EXPECT_EQ('a', ch);
}
#if !((GTEST_GCC_VER_ && GTEST_GCC_VER_ < 40000) || GTEST_OS_SYMBIAN)
// Tests that SetArgPointee<N>() accepts a string literal.
// GCC prior to v4.0 and the Symbian compiler do not support this.
TEST(SetArgPointeeTest, AcceptsStringLiteral) {
typedef void MyFunction(std::string*, const char**);
Action<MyFunction> a = SetArgPointee<0>("hi");
std::string str;
const char* ptr = NULL;
a.Perform(make_tuple(&str, &ptr));
EXPECT_EQ("hi", str);
EXPECT_TRUE(ptr == NULL);
a = SetArgPointee<1>("world");
str = "";
a.Perform(make_tuple(&str, &ptr));
EXPECT_EQ("", str);
EXPECT_STREQ("world", ptr);
}
TEST(SetArgPointeeTest, AcceptsWideStringLiteral) {
typedef void MyFunction(const wchar_t**);
Action<MyFunction> a = SetArgPointee<0>(L"world");
const wchar_t* ptr = NULL;
a.Perform(make_tuple(&ptr));
EXPECT_STREQ(L"world", ptr);
# if GTEST_HAS_STD_WSTRING
typedef void MyStringFunction(std::wstring*);
Action<MyStringFunction> a2 = SetArgPointee<0>(L"world");
std::wstring str = L"";
a2.Perform(make_tuple(&str));
EXPECT_EQ(L"world", str);
# endif
}
#endif
// Tests that SetArgPointee<N>() accepts a char pointer.
TEST(SetArgPointeeTest, AcceptsCharPointer) {
typedef void MyFunction(bool, std::string*, const char**);
const char* const hi = "hi";
Action<MyFunction> a = SetArgPointee<1>(hi);
std::string str;
const char* ptr = NULL;
a.Perform(make_tuple(true, &str, &ptr));
EXPECT_EQ("hi", str);
EXPECT_TRUE(ptr == NULL);
char world_array[] = "world";
char* const world = world_array;
a = SetArgPointee<2>(world);
str = "";
a.Perform(make_tuple(true, &str, &ptr));
EXPECT_EQ("", str);
EXPECT_EQ(world, ptr);
}
TEST(SetArgPointeeTest, AcceptsWideCharPointer) {
typedef void MyFunction(bool, const wchar_t**);
const wchar_t* const hi = L"hi";
Action<MyFunction> a = SetArgPointee<1>(hi);
const wchar_t* ptr = NULL;
a.Perform(make_tuple(true, &ptr));
EXPECT_EQ(hi, ptr);
# if GTEST_HAS_STD_WSTRING
typedef void MyStringFunction(bool, std::wstring*);
wchar_t world_array[] = L"world";
wchar_t* const world = world_array;
Action<MyStringFunction> a2 = SetArgPointee<1>(world);
std::wstring str;
a2.Perform(make_tuple(true, &str));
EXPECT_EQ(world_array, str);
# endif
}
#if GTEST_HAS_PROTOBUF_
// Tests that SetArgPointee<N>(proto_buffer) sets the v1 protobuf
// variable pointed to by the N-th (0-based) argument to proto_buffer.
TEST(SetArgPointeeTest, SetsTheNthPointeeOfProtoBufferType) {
TestMessage* const msg = new TestMessage;
msg->set_member("yes");
TestMessage orig_msg;
orig_msg.CopyFrom(*msg);
Action<void(bool, TestMessage*)> a = SetArgPointee<1>(*msg);
// SetArgPointee<N>(proto_buffer) makes a copy of proto_buffer
// s.t. the action works even when the original proto_buffer has
// died. We ensure this behavior by deleting msg before using the
// action.
delete msg;
TestMessage dest;
EXPECT_FALSE(orig_msg.Equals(dest));
a.Perform(make_tuple(true, &dest));
EXPECT_TRUE(orig_msg.Equals(dest));
}
// Tests that SetArgPointee<N>(proto_buffer) sets the
// ::ProtocolMessage variable pointed to by the N-th (0-based)
// argument to proto_buffer.
TEST(SetArgPointeeTest, SetsTheNthPointeeOfProtoBufferBaseType) {
TestMessage* const msg = new TestMessage;
msg->set_member("yes");
TestMessage orig_msg;
orig_msg.CopyFrom(*msg);
Action<void(bool, ::ProtocolMessage*)> a = SetArgPointee<1>(*msg);
// SetArgPointee<N>(proto_buffer) makes a copy of proto_buffer
// s.t. the action works even when the original proto_buffer has
// died. We ensure this behavior by deleting msg before using the
// action.
delete msg;
TestMessage dest;
::ProtocolMessage* const dest_base = &dest;
EXPECT_FALSE(orig_msg.Equals(dest));
a.Perform(make_tuple(true, dest_base));
EXPECT_TRUE(orig_msg.Equals(dest));
}
// Tests that SetArgPointee<N>(proto2_buffer) sets the v2
// protobuf variable pointed to by the N-th (0-based) argument to
// proto2_buffer.
TEST(SetArgPointeeTest, SetsTheNthPointeeOfProto2BufferType) {
using testing::internal::FooMessage;
FooMessage* const msg = new FooMessage;
msg->set_int_field(2);
msg->set_string_field("hi");
FooMessage orig_msg;
orig_msg.CopyFrom(*msg);
Action<void(bool, FooMessage*)> a = SetArgPointee<1>(*msg);
// SetArgPointee<N>(proto2_buffer) makes a copy of
// proto2_buffer s.t. the action works even when the original
// proto2_buffer has died. We ensure this behavior by deleting msg
// before using the action.
delete msg;
FooMessage dest;
dest.set_int_field(0);
a.Perform(make_tuple(true, &dest));
EXPECT_EQ(2, dest.int_field());
EXPECT_EQ("hi", dest.string_field());
}
// Tests that SetArgPointee<N>(proto2_buffer) sets the
// proto2::Message variable pointed to by the N-th (0-based) argument
// to proto2_buffer.
TEST(SetArgPointeeTest, SetsTheNthPointeeOfProto2BufferBaseType) {
using testing::internal::FooMessage;
FooMessage* const msg = new FooMessage;
msg->set_int_field(2);
msg->set_string_field("hi");
FooMessage orig_msg;
orig_msg.CopyFrom(*msg);
Action<void(bool, ::proto2::Message*)> a = SetArgPointee<1>(*msg);
// SetArgPointee<N>(proto2_buffer) makes a copy of
// proto2_buffer s.t. the action works even when the original
// proto2_buffer has died. We ensure this behavior by deleting msg
// before using the action.
delete msg;
FooMessage dest;
dest.set_int_field(0);
::proto2::Message* const dest_base = &dest;
a.Perform(make_tuple(true, dest_base));
EXPECT_EQ(2, dest.int_field());
EXPECT_EQ("hi", dest.string_field());
}
#endif // GTEST_HAS_PROTOBUF_
// Tests that SetArgumentPointee<N>(v) sets the variable pointed to by
// the N-th (0-based) argument to v.
TEST(SetArgumentPointeeTest, SetsTheNthPointee) {
typedef void MyFunction(bool, int*, char*);
Action<MyFunction> a = SetArgumentPointee<1>(2);
int n = 0;
char ch = '\0';
a.Perform(make_tuple(true, &n, &ch));
EXPECT_EQ(2, n);
EXPECT_EQ('\0', ch);
a = SetArgumentPointee<2>('a');
n = 0;
ch = '\0';
a.Perform(make_tuple(true, &n, &ch));
EXPECT_EQ(0, n);
EXPECT_EQ('a', ch);
}
#if GTEST_HAS_PROTOBUF_
// Tests that SetArgumentPointee<N>(proto_buffer) sets the v1 protobuf
// variable pointed to by the N-th (0-based) argument to proto_buffer.
TEST(SetArgumentPointeeTest, SetsTheNthPointeeOfProtoBufferType) {
TestMessage* const msg = new TestMessage;
msg->set_member("yes");
TestMessage orig_msg;
orig_msg.CopyFrom(*msg);
Action<void(bool, TestMessage*)> a = SetArgumentPointee<1>(*msg);
// SetArgumentPointee<N>(proto_buffer) makes a copy of proto_buffer
// s.t. the action works even when the original proto_buffer has
// died. We ensure this behavior by deleting msg before using the
// action.
delete msg;
TestMessage dest;
EXPECT_FALSE(orig_msg.Equals(dest));
a.Perform(make_tuple(true, &dest));
EXPECT_TRUE(orig_msg.Equals(dest));
}
// Tests that SetArgumentPointee<N>(proto_buffer) sets the
// ::ProtocolMessage variable pointed to by the N-th (0-based)
// argument to proto_buffer.
TEST(SetArgumentPointeeTest, SetsTheNthPointeeOfProtoBufferBaseType) {
TestMessage* const msg = new TestMessage;
msg->set_member("yes");
TestMessage orig_msg;
orig_msg.CopyFrom(*msg);
Action<void(bool, ::ProtocolMessage*)> a = SetArgumentPointee<1>(*msg);
// SetArgumentPointee<N>(proto_buffer) makes a copy of proto_buffer
// s.t. the action works even when the original proto_buffer has
// died. We ensure this behavior by deleting msg before using the
// action.
delete msg;
TestMessage dest;
::ProtocolMessage* const dest_base = &dest;
EXPECT_FALSE(orig_msg.Equals(dest));
a.Perform(make_tuple(true, dest_base));
EXPECT_TRUE(orig_msg.Equals(dest));
}
// Tests that SetArgumentPointee<N>(proto2_buffer) sets the v2
// protobuf variable pointed to by the N-th (0-based) argument to
// proto2_buffer.
TEST(SetArgumentPointeeTest, SetsTheNthPointeeOfProto2BufferType) {
using testing::internal::FooMessage;
FooMessage* const msg = new FooMessage;
msg->set_int_field(2);
msg->set_string_field("hi");
FooMessage orig_msg;
orig_msg.CopyFrom(*msg);
Action<void(bool, FooMessage*)> a = SetArgumentPointee<1>(*msg);
// SetArgumentPointee<N>(proto2_buffer) makes a copy of
// proto2_buffer s.t. the action works even when the original
// proto2_buffer has died. We ensure this behavior by deleting msg
// before using the action.
delete msg;
FooMessage dest;
dest.set_int_field(0);
a.Perform(make_tuple(true, &dest));
EXPECT_EQ(2, dest.int_field());
EXPECT_EQ("hi", dest.string_field());
}
// Tests that SetArgumentPointee<N>(proto2_buffer) sets the
// proto2::Message variable pointed to by the N-th (0-based) argument
// to proto2_buffer.
TEST(SetArgumentPointeeTest, SetsTheNthPointeeOfProto2BufferBaseType) {
using testing::internal::FooMessage;
FooMessage* const msg = new FooMessage;
msg->set_int_field(2);
msg->set_string_field("hi");
FooMessage orig_msg;
orig_msg.CopyFrom(*msg);
Action<void(bool, ::proto2::Message*)> a = SetArgumentPointee<1>(*msg);
// SetArgumentPointee<N>(proto2_buffer) makes a copy of
// proto2_buffer s.t. the action works even when the original
// proto2_buffer has died. We ensure this behavior by deleting msg
// before using the action.
delete msg;
FooMessage dest;
dest.set_int_field(0);
::proto2::Message* const dest_base = &dest;
a.Perform(make_tuple(true, dest_base));
EXPECT_EQ(2, dest.int_field());
EXPECT_EQ("hi", dest.string_field());
}
#endif // GTEST_HAS_PROTOBUF_
// Sample functions and functors for testing Invoke() and etc.
int Nullary() { return 1; }
class NullaryFunctor {
public:
int operator()() { return 2; }
};
bool g_done = false;
void VoidNullary() { g_done = true; }
class VoidNullaryFunctor {
public:
void operator()() { g_done = true; }
};
class Foo {
public:
Foo() : value_(123) {}
int Nullary() const { return value_; }
private:
int value_;
};
// Tests InvokeWithoutArgs(function).
TEST(InvokeWithoutArgsTest, Function) {
// As an action that takes one argument.
Action<int(int)> a = InvokeWithoutArgs(Nullary); // NOLINT
EXPECT_EQ(1, a.Perform(make_tuple(2)));
// As an action that takes two arguments.
Action<int(int, double)> a2 = InvokeWithoutArgs(Nullary); // NOLINT
EXPECT_EQ(1, a2.Perform(make_tuple(2, 3.5)));
// As an action that returns void.
Action<void(int)> a3 = InvokeWithoutArgs(VoidNullary); // NOLINT
g_done = false;
a3.Perform(make_tuple(1));
EXPECT_TRUE(g_done);
}
// Tests InvokeWithoutArgs(functor).
TEST(InvokeWithoutArgsTest, Functor) {
// As an action that takes no argument.
Action<int()> a = InvokeWithoutArgs(NullaryFunctor()); // NOLINT
EXPECT_EQ(2, a.Perform(make_tuple()));
// As an action that takes three arguments.
Action<int(int, double, char)> a2 = // NOLINT
InvokeWithoutArgs(NullaryFunctor());
EXPECT_EQ(2, a2.Perform(make_tuple(3, 3.5, 'a')));
// As an action that returns void.
Action<void()> a3 = InvokeWithoutArgs(VoidNullaryFunctor());
g_done = false;
a3.Perform(make_tuple());
EXPECT_TRUE(g_done);
}
// Tests InvokeWithoutArgs(obj_ptr, method).
TEST(InvokeWithoutArgsTest, Method) {
Foo foo;
Action<int(bool, char)> a = // NOLINT
InvokeWithoutArgs(&foo, &Foo::Nullary);
EXPECT_EQ(123, a.Perform(make_tuple(true, 'a')));
}
// Tests using IgnoreResult() on a polymorphic action.
TEST(IgnoreResultTest, PolymorphicAction) {
Action<void(int)> a = IgnoreResult(Return(5)); // NOLINT
a.Perform(make_tuple(1));
}
// Tests using IgnoreResult() on a monomorphic action.
int ReturnOne() {
g_done = true;
return 1;
}
TEST(IgnoreResultTest, MonomorphicAction) {
g_done = false;
Action<void()> a = IgnoreResult(Invoke(ReturnOne));
a.Perform(make_tuple());
EXPECT_TRUE(g_done);
}
// Tests using IgnoreResult() on an action that returns a class type.
MyClass ReturnMyClass(double /* x */) {
g_done = true;
return MyClass();
}
TEST(IgnoreResultTest, ActionReturningClass) {
g_done = false;
Action<void(int)> a = IgnoreResult(Invoke(ReturnMyClass)); // NOLINT
a.Perform(make_tuple(2));
EXPECT_TRUE(g_done);
}
TEST(AssignTest, Int) {
int x = 0;
Action<void(int)> a = Assign(&x, 5);
a.Perform(make_tuple(0));
EXPECT_EQ(5, x);
}
TEST(AssignTest, String) {
::std::string x;
Action<void(void)> a = Assign(&x, "Hello, world");
a.Perform(make_tuple());
EXPECT_EQ("Hello, world", x);
}
TEST(AssignTest, CompatibleTypes) {
double x = 0;
Action<void(int)> a = Assign(&x, 5);
a.Perform(make_tuple(0));
EXPECT_DOUBLE_EQ(5, x);
}
#if !GTEST_OS_WINDOWS_MOBILE
class SetErrnoAndReturnTest : public testing::Test {
protected:
virtual void SetUp() { errno = 0; }
virtual void TearDown() { errno = 0; }
};
TEST_F(SetErrnoAndReturnTest, Int) {
Action<int(void)> a = SetErrnoAndReturn(ENOTTY, -5);
EXPECT_EQ(-5, a.Perform(make_tuple()));
EXPECT_EQ(ENOTTY, errno);
}
TEST_F(SetErrnoAndReturnTest, Ptr) {
int x;
Action<int*(void)> a = SetErrnoAndReturn(ENOTTY, &x);
EXPECT_EQ(&x, a.Perform(make_tuple()));
EXPECT_EQ(ENOTTY, errno);
}
TEST_F(SetErrnoAndReturnTest, CompatibleTypes) {
Action<double()> a = SetErrnoAndReturn(EINVAL, 5);
EXPECT_DOUBLE_EQ(5.0, a.Perform(make_tuple()));
EXPECT_EQ(EINVAL, errno);
}
#endif // !GTEST_OS_WINDOWS_MOBILE
// Tests ByRef().
// Tests that ReferenceWrapper<T> is copyable.
TEST(ByRefTest, IsCopyable) {
const std::string s1 = "Hi";
const std::string s2 = "Hello";
::testing::internal::ReferenceWrapper<const std::string> ref_wrapper =
ByRef(s1);
const std::string& r1 = ref_wrapper;
EXPECT_EQ(&s1, &r1);
// Assigns a new value to ref_wrapper.
ref_wrapper = ByRef(s2);
const std::string& r2 = ref_wrapper;
EXPECT_EQ(&s2, &r2);
::testing::internal::ReferenceWrapper<const std::string> ref_wrapper1 =
ByRef(s1);
// Copies ref_wrapper1 to ref_wrapper.
ref_wrapper = ref_wrapper1;
const std::string& r3 = ref_wrapper;
EXPECT_EQ(&s1, &r3);
}
// Tests using ByRef() on a const value.
TEST(ByRefTest, ConstValue) {
const int n = 0;
// int& ref = ByRef(n); // This shouldn't compile - we have a
// negative compilation test to catch it.
const int& const_ref = ByRef(n);
EXPECT_EQ(&n, &const_ref);
}
// Tests using ByRef() on a non-const value.
TEST(ByRefTest, NonConstValue) {
int n = 0;
// ByRef(n) can be used as either an int&,
int& ref = ByRef(n);
EXPECT_EQ(&n, &ref);
// or a const int&.
const int& const_ref = ByRef(n);
EXPECT_EQ(&n, &const_ref);
}
// Tests explicitly specifying the type when using ByRef().
TEST(ByRefTest, ExplicitType) {
int n = 0;
const int& r1 = ByRef<const int>(n);
EXPECT_EQ(&n, &r1);
// ByRef<char>(n); // This shouldn't compile - we have a negative
// compilation test to catch it.
Derived d;
Derived& r2 = ByRef<Derived>(d);
EXPECT_EQ(&d, &r2);
const Derived& r3 = ByRef<const Derived>(d);
EXPECT_EQ(&d, &r3);
Base& r4 = ByRef<Base>(d);
EXPECT_EQ(&d, &r4);
const Base& r5 = ByRef<const Base>(d);
EXPECT_EQ(&d, &r5);
// The following shouldn't compile - we have a negative compilation
// test for it.
//
// Base b;
// ByRef<Derived>(b);
}
// Tests that Google Mock prints expression ByRef(x) as a reference to x.
TEST(ByRefTest, PrintsCorrectly) {
int n = 42;
::std::stringstream expected, actual;
testing::internal::UniversalPrinter<const int&>::Print(n, &expected);
testing::internal::UniversalPrint(ByRef(n), &actual);
EXPECT_EQ(expected.str(), actual.str());
}
} // Unnamed namespace
| {
"pile_set_name": "Github"
} |
//
// Generated by class-dump 3.5 (64 bit) (Debug version compiled Oct 15 2018 10:31:50).
//
// class-dump is Copyright (C) 1997-1998, 2000-2001, 2004-2015 by Steve Nygard.
//
#import <ContactsUI/NSObject-Protocol.h>
@class ABCollectionViewItem, NSArray, NSString;
@protocol ABCardCollectionViewDataSource <NSObject>
- (void)buildActionGlyphsForItem:(ABCollectionViewItem *)arg1;
- (void)buildVisibleViewForItem:(ABCollectionViewItem *)arg1;
- (NSArray *)collectionItems;
@optional
- (ABCollectionViewItem *)emptyCollectionItemForKey:(NSString *)arg1;
- (BOOL)isMe;
@end
| {
"pile_set_name": "Github"
} |
# test constant optimisation, with consts that are bignums
from micropython import const
# check we can make consts from bignums
Z1 = const(0xffffffff)
Z2 = const(0xffffffffffffffff)
print(hex(Z1), hex(Z2))
# check arithmetic with bignum
Z3 = const(Z1 + Z2)
Z4 = const((1 << 100) + Z1)
print(hex(Z3), hex(Z4))
| {
"pile_set_name": "Github"
} |
modelInfo <- list(label = "Fuzzy Inference Rules by Descent Method",
library = "frbs",
type = "Regression",
parameters = data.frame(parameter = c('num.labels', 'max.iter'),
class = c("numeric", "numeric"),
label = c('#Fuzzy Terms', 'Max. Iterations')),
grid = function(x, y, len = NULL, search = "grid") {
if(search == "grid") {
out <- expand.grid(num.labels = 1+(1:len)*2,
max.iter = 100)
} else {
out <- data.frame(max.iter = sample(1:20, replace = TRUE, size = len),
num.labels = sample(2:20, size = len, replace = TRUE))
}
out
},
loop = NULL,
fit = function(x, y, wts, param, lev, last, classProbs, ...) {
args <- list(data.train = as.matrix(cbind(x, y)),
method.type = "FIR.DM")
theDots <- list(...)
if(any(names(theDots) == "control")) {
theDots$control$num.labels <- param$num.labels
theDots$control$max.iter <- param$max.iter
} else theDots$control <- list(num.labels = param$num.labels,
max.iter = param$max.iter,
step.size = 0.01,
type.tnorm = "MIN",
type.snorm = "MAX",
type.implication.func = "ZADEH",
name="sim-0")
if(!(any(names(theDots) == "range.data"))) {
args$range.data <- apply(args$data.train, 2, extendrange)
}
do.call(frbs::frbs.learn, c(args, theDots))
},
predict = function(modelFit, newdata, submodels = NULL) {
predict(modelFit, newdata)[, 1]
},
prob = NULL,
predictors = function(x, ...){
x$colnames.var[x$colnames.var %in% as.vector(x$rule)]
},
tags = c("Rule-Based Model"),
levels = NULL,
sort = function(x) x[order(x$num.labels),])
| {
"pile_set_name": "Github"
} |
#include "src/ir/regexp/encoding/utf16/utf16_range.h"
#include "src/ir/regexp/encoding/range_suffix.h"
namespace re2c {
/*
* Add word range [w1-w2].
*/
void UTF16addContinuous1(RangeSuffix * & root, uint32_t l, uint32_t h)
{
RangeSuffix ** p = &root;
for (;;)
{
if (*p == NULL)
{
*p = new RangeSuffix(l, h);
break;
}
else if ((*p)->l == l && (*p)->h == h)
{
break;
}
else
p = &(*p)->next;
}
}
/*
* Now that we have catenation of word ranges [l1-h1],[l2-h2],
* we want to add it to existing range, merging suffixes on the fly.
*/
void UTF16addContinuous2(RangeSuffix * & root, uint32_t l_ld, uint32_t h_ld, uint32_t l_tr, uint32_t h_tr)
{
RangeSuffix ** p = &root;
for (;;)
{
if (*p == NULL)
{
*p = new RangeSuffix(l_tr, h_tr);
p = &(*p)->child;
break;
}
else if ((*p)->l == l_tr && (*p)->h == h_tr)
{
p = &(*p)->child;
break;
}
else
p = &(*p)->next;
}
for (;;)
{
if (*p == NULL)
{
*p = new RangeSuffix(l_ld, h_ld);
break;
}
else if ((*p)->l == l_ld && (*p)->h == h_ld)
{
break;
}
else
p = &(*p)->next;
}
}
/*
* Split range into sub-ranges that agree on leading surrogates.
*
* We have two Unicode runes, L and H, both map to UTF-16
* surrogate pairs 'L1 L2' and 'H1 H2'.
* We want to represent Unicode range [L - H] as a catenation
* of word ranges [L1 - H1],[L2 - H2].
*
* This is only possible if the following condition holds:
* if L1 /= H1, then L2 == 0xdc00 and H2 == 0xdfff.
* This condition ensures that:
* 1) all possible UTF-16 sequences between L and H are allowed
* 2) no word ranges [w1 - w2] appear, such that w1 > w2
*
* E.g.:
* [\U00010001-\U00010400] => [d800-d801],[dc01-dc00].
* The last word range, [dc01-dc00], is incorrect: its lower bound
* is greater than its upper bound. To fix this, we must split
* the original range into two sub-ranges:
* [\U00010001-\U000103ff] => [d800-d800],[dc01-dfff]
* [\U00010400-\U00010400] => [d801-d801],[dc00-dc00]
*
* This function finds all such 'points of discontinuity'
* and represents original range as alternation of continuous
* sub-ranges.
*/
void UTF16splitByContinuity(RangeSuffix * & root, uint32_t l_ld, uint32_t h_ld, uint32_t l_tr, uint32_t h_tr)
{
if (l_ld != h_ld)
{
if (l_tr > utf16::MIN_TRAIL_SURR)
{
UTF16splitByContinuity(root, l_ld, l_ld, l_tr, utf16::MAX_TRAIL_SURR);
UTF16splitByContinuity(root, l_ld + 1, h_ld, utf16::MIN_TRAIL_SURR, h_tr);
return;
}
if (h_tr < utf16::MAX_TRAIL_SURR)
{
UTF16splitByContinuity(root, l_ld, h_ld - 1, l_tr, utf16::MAX_TRAIL_SURR);
UTF16splitByContinuity(root, h_ld, h_ld, utf16::MIN_TRAIL_SURR, h_tr);
return;
}
}
UTF16addContinuous2(root, l_ld, h_ld, l_tr, h_tr);
}
/*
* Split range into sub-ranges, so that all runes in the same
* sub-range have equal length of UTF-16 sequence. E.g., full
* Unicode range [0-0x10FFFF] gets split into sub-ranges:
* [0 - 0xFFFF] (2-byte UTF-16 sequences)
* [0x10000 - 0x10FFFF] (4-byte UTF-16 sequences)
*/
void UTF16splitByRuneLength(RangeSuffix * & root, utf16::rune l, utf16::rune h)
{
if (l <= utf16::MAX_1WORD_RUNE)
{
if (h <= utf16::MAX_1WORD_RUNE)
{
UTF16addContinuous1(root, l, h);
}
else
{
UTF16addContinuous1(root, l, utf16::MAX_1WORD_RUNE);
const uint32_t h_ld = utf16::lead_surr(h);
const uint32_t h_tr = utf16::trail_surr(h);
UTF16splitByContinuity(root, utf16::MIN_LEAD_SURR, h_ld, utf16::MIN_TRAIL_SURR, h_tr);
}
}
else
{
const uint32_t l_ld = utf16::lead_surr(l);
const uint32_t l_tr = utf16::trail_surr(l);
const uint32_t h_ld = utf16::lead_surr(h);
const uint32_t h_tr = utf16::trail_surr(h);
UTF16splitByContinuity(root, l_ld, h_ld, l_tr, h_tr);
}
}
} // namespace re2c
| {
"pile_set_name": "Github"
} |
(defproject inlein/daemon "0.3.0-SNAPSHOT"
:description "The Inlein daemon"
:url "https://github.com/hyPiRion/inlein"
:license {:name "Eclipse Public License"
:url "http://www.eclipse.org/legal/epl-v10.html"}
:dependencies [[org.clojure/clojure "1.8.0"]
[org.flatland/ordered "1.5.4"]
[com.stuartsierra/component "0.3.0"]
[com.cemerick/pomegranate "0.3.0"]
[com.hypirion/bencode "0.1.1"]]
:main inlein.daemon.system
:target-path "target/%s"
:uberjar-name "inlein-daemon-%s-standalone.jar"
:scm {:dir ".."}
:profiles {:uberjar {:aot :all}
:dev {:dependencies [[org.clojure/tools.namespace "0.2.11"]]
:source-paths ["dev"]
:repl-options {:init-ns user}}})
| {
"pile_set_name": "Github"
} |
/* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "testutil.h"
#include "apr.h"
#include "apr_portable.h"
#include "apr_strings.h"
static void ssize_t_fmt(abts_case *tc, void *data)
{
char buf[100];
apr_ssize_t var = 0;
sprintf(buf, "%" APR_SSIZE_T_FMT, var);
ABTS_STR_EQUAL(tc, "0", buf);
apr_snprintf(buf, sizeof(buf), "%" APR_SSIZE_T_FMT, var);
ABTS_STR_EQUAL(tc, "0", buf);
}
static void size_t_fmt(abts_case *tc, void *data)
{
char buf[100];
apr_size_t var = 0;
sprintf(buf, "%" APR_SIZE_T_FMT, var);
ABTS_STR_EQUAL(tc, "0", buf);
apr_snprintf(buf, sizeof(buf), "%" APR_SIZE_T_FMT, var);
ABTS_STR_EQUAL(tc, "0", buf);
}
static void off_t_fmt(abts_case *tc, void *data)
{
char buf[100];
apr_off_t var = 0;
sprintf(buf, "%" APR_OFF_T_FMT, var);
ABTS_STR_EQUAL(tc, "0", buf);
apr_snprintf(buf, sizeof(buf), "%" APR_OFF_T_FMT, var);
ABTS_STR_EQUAL(tc, "0", buf);
}
static void pid_t_fmt(abts_case *tc, void *data)
{
char buf[100];
pid_t var = 0;
sprintf(buf, "%" APR_PID_T_FMT, var);
ABTS_STR_EQUAL(tc, "0", buf);
apr_snprintf(buf, sizeof(buf), "%" APR_PID_T_FMT, var);
ABTS_STR_EQUAL(tc, "0", buf);
}
static void int64_t_fmt(abts_case *tc, void *data)
{
char buf[100];
apr_int64_t var = 0;
sprintf(buf, "%" APR_INT64_T_FMT, var);
ABTS_STR_EQUAL(tc, "0", buf);
apr_snprintf(buf, sizeof(buf), "%" APR_INT64_T_FMT, var);
ABTS_STR_EQUAL(tc, "0", buf);
}
static void uint64_t_fmt(abts_case *tc, void *data)
{
char buf[100];
apr_uint64_t var = APR_UINT64_C(14000000);
sprintf(buf, "%" APR_UINT64_T_FMT, var);
ABTS_STR_EQUAL(tc, "14000000", buf);
apr_snprintf(buf, sizeof(buf), "%" APR_UINT64_T_FMT, var);
ABTS_STR_EQUAL(tc, "14000000", buf);
}
static void uint64_t_hex_fmt(abts_case *tc, void *data)
{
char buf[100];
apr_uint64_t var = APR_UINT64_C(14000000);
sprintf(buf, "%" APR_UINT64_T_HEX_FMT, var);
ABTS_STR_EQUAL(tc, "d59f80", buf);
apr_snprintf(buf, sizeof(buf), "%" APR_UINT64_T_HEX_FMT, var);
ABTS_STR_EQUAL(tc, "d59f80", buf);
}
static void more_int64_fmts(abts_case *tc, void *data)
{
char buf[100];
apr_int64_t i = APR_INT64_C(-42);
apr_int64_t ibig = APR_INT64_C(-314159265358979323);
apr_uint64_t ui = APR_UINT64_C(42);
apr_uint64_t big = APR_UINT64_C(10267677267010969076);
apr_snprintf(buf, sizeof buf, "%" APR_INT64_T_FMT, i);
ABTS_STR_EQUAL(tc, "-42", buf);
apr_snprintf(buf, sizeof buf, "%" APR_UINT64_T_FMT, ui);
ABTS_STR_EQUAL(tc, "42", buf);
apr_snprintf(buf, sizeof buf, "%" APR_UINT64_T_FMT, big);
ABTS_STR_EQUAL(tc, "10267677267010969076", buf);
apr_snprintf(buf, sizeof buf, "%" APR_INT64_T_FMT, ibig);
ABTS_STR_EQUAL(tc, "-314159265358979323", buf);
}
static void error_fmt(abts_case *tc, void *data)
{
char ebuf[150], sbuf[150], *s;
apr_status_t rv;
rv = APR_SUCCESS;
apr_strerror(rv, ebuf, sizeof ebuf);
apr_snprintf(sbuf, sizeof sbuf, "%pm", &rv);
ABTS_STR_EQUAL(tc, sbuf, ebuf);
rv = APR_ENOTIMPL;
s = apr_pstrcat(p, "foo-",
apr_strerror(rv, ebuf, sizeof ebuf),
"-bar", NULL);
apr_snprintf(sbuf, sizeof sbuf, "foo-%pm-bar", &rv);
ABTS_STR_EQUAL(tc, sbuf, s);
}
abts_suite *testfmt(abts_suite *suite)
{
suite = ADD_SUITE(suite)
abts_run_test(suite, ssize_t_fmt, NULL);
abts_run_test(suite, size_t_fmt, NULL);
abts_run_test(suite, off_t_fmt, NULL);
abts_run_test(suite, pid_t_fmt, NULL);
abts_run_test(suite, int64_t_fmt, NULL);
abts_run_test(suite, uint64_t_fmt, NULL);
abts_run_test(suite, uint64_t_hex_fmt, NULL);
abts_run_test(suite, more_int64_fmts, NULL);
abts_run_test(suite, error_fmt, NULL);
return suite;
}
| {
"pile_set_name": "Github"
} |
/*
* JQuery zTree exHideNodes v3.5.18
* http://zTree.me/
*
* Copyright (c) 2010 Hunter.z
*
* Licensed same as jquery - MIT License
* http://www.opensource.org/licenses/mit-license.php
*
* email: [email protected]
* Date: 2015-05-25
*/
(function($){
//default init node of exLib
var _initNode = function(setting, level, n, parentNode, isFirstNode, isLastNode, openFlag) {
if (typeof n.isHidden == "string") n.isHidden = tools.eqs(n.isHidden, "true");
n.isHidden = !!n.isHidden;
data.initHideForExCheck(setting, n);
},
//add dom for check
_beforeA = function(setting, node, html) {},
//update zTreeObj, add method of exLib
_zTreeTools = function(setting, zTreeTools) {
zTreeTools.showNodes = function(nodes, options) {
view.showNodes(setting, nodes, options);
}
zTreeTools.showNode = function(node, options) {
if (!node) {
return;
}
view.showNodes(setting, [node], options);
}
zTreeTools.hideNodes = function(nodes, options) {
view.hideNodes(setting, nodes, options);
}
zTreeTools.hideNode = function(node, options) {
if (!node) {
return;
}
view.hideNodes(setting, [node], options);
}
var _checkNode = zTreeTools.checkNode;
if (_checkNode) {
zTreeTools.checkNode = function(node, checked, checkTypeFlag, callbackFlag) {
if (!!node && !!node.isHidden) {
return;
}
_checkNode.apply(zTreeTools, arguments);
}
}
},
//method of operate data
_data = {
initHideForExCheck: function(setting, n) {
if (n.isHidden && setting.check && setting.check.enable) {
if(typeof n._nocheck == "undefined") {
n._nocheck = !!n.nocheck
n.nocheck = true;
}
n.check_Child_State = -1;
if (view.repairParentChkClassWithSelf) {
view.repairParentChkClassWithSelf(setting, n);
}
}
},
initShowForExCheck: function(setting, n) {
if (!n.isHidden && setting.check && setting.check.enable) {
if(typeof n._nocheck != "undefined") {
n.nocheck = n._nocheck;
delete n._nocheck;
}
if (view.setChkClass) {
var checkObj = $$(n, consts.id.CHECK, setting);
view.setChkClass(setting, checkObj, n);
}
if (view.repairParentChkClassWithSelf) {
view.repairParentChkClassWithSelf(setting, n);
}
}
}
},
//method of operate ztree dom
_view = {
clearOldFirstNode: function(setting, node) {
var n = node.getNextNode();
while(!!n){
if (n.isFirstNode) {
n.isFirstNode = false;
view.setNodeLineIcos(setting, n);
break;
}
if (n.isLastNode) {
break;
}
n = n.getNextNode();
}
},
clearOldLastNode: function(setting, node, openFlag) {
var n = node.getPreNode();
while(!!n){
if (n.isLastNode) {
n.isLastNode = false;
if (openFlag) {
view.setNodeLineIcos(setting, n);
}
break;
}
if (n.isFirstNode) {
break;
}
n = n.getPreNode();
}
},
makeDOMNodeMainBefore: function(html, setting, node) {
html.push("<li ", (node.isHidden ? "style='display:none;' " : ""), "id='", node.tId, "' class='", consts.className.LEVEL, node.level,"' tabindex='0' hidefocus='true' treenode>");
},
showNode: function(setting, node, options) {
node.isHidden = false;
data.initShowForExCheck(setting, node);
$$(node, setting).show();
},
showNodes: function(setting, nodes, options) {
if (!nodes || nodes.length == 0) {
return;
}
var pList = {}, i, j;
for (i=0, j=nodes.length; i<j; i++) {
var n = nodes[i];
if (!pList[n.parentTId]) {
var pn = n.getParentNode();
pList[n.parentTId] = (pn === null) ? data.getRoot(setting) : n.getParentNode();
}
view.showNode(setting, n, options);
}
for (var tId in pList) {
var children = pList[tId][setting.data.key.children];
view.setFirstNodeForShow(setting, children);
view.setLastNodeForShow(setting, children);
}
},
hideNode: function(setting, node, options) {
node.isHidden = true;
node.isFirstNode = false;
node.isLastNode = false;
data.initHideForExCheck(setting, node);
view.cancelPreSelectedNode(setting, node);
$$(node, setting).hide();
},
hideNodes: function(setting, nodes, options) {
if (!nodes || nodes.length == 0) {
return;
}
var pList = {}, i, j;
for (i=0, j=nodes.length; i<j; i++) {
var n = nodes[i];
if ((n.isFirstNode || n.isLastNode) && !pList[n.parentTId]) {
var pn = n.getParentNode();
pList[n.parentTId] = (pn === null) ? data.getRoot(setting) : n.getParentNode();
}
view.hideNode(setting, n, options);
}
for (var tId in pList) {
var children = pList[tId][setting.data.key.children];
view.setFirstNodeForHide(setting, children);
view.setLastNodeForHide(setting, children);
}
},
setFirstNode: function(setting, parentNode) {
var childKey = setting.data.key.children, childLength = parentNode[childKey].length;
if (childLength > 0 && !parentNode[childKey][0].isHidden) {
parentNode[childKey][0].isFirstNode = true;
} else if (childLength > 0) {
view.setFirstNodeForHide(setting, parentNode[childKey]);
}
},
setLastNode: function(setting, parentNode) {
var childKey = setting.data.key.children, childLength = parentNode[childKey].length;
if (childLength > 0 && !parentNode[childKey][0].isHidden) {
parentNode[childKey][childLength - 1].isLastNode = true;
} else if (childLength > 0) {
view.setLastNodeForHide(setting, parentNode[childKey]);
}
},
setFirstNodeForHide: function(setting, nodes) {
var n,i,j;
for (i=0, j=nodes.length; i<j; i++) {
n = nodes[i];
if (n.isFirstNode) {
break;
}
if (!n.isHidden && !n.isFirstNode) {
n.isFirstNode = true;
view.setNodeLineIcos(setting, n);
break;
} else {
n = null;
}
}
return n;
},
setFirstNodeForShow: function(setting, nodes) {
var n,i,j, first, old;
for(i=0, j=nodes.length; i<j; i++) {
n = nodes[i];
if (!first && !n.isHidden && n.isFirstNode) {
first = n;
break;
} else if (!first && !n.isHidden && !n.isFirstNode) {
n.isFirstNode = true;
first = n;
view.setNodeLineIcos(setting, n);
} else if (first && n.isFirstNode) {
n.isFirstNode = false;
old = n;
view.setNodeLineIcos(setting, n);
break;
} else {
n = null;
}
}
return {"new":first, "old":old};
},
setLastNodeForHide: function(setting, nodes) {
var n,i;
for (i=nodes.length-1; i>=0; i--) {
n = nodes[i];
if (n.isLastNode) {
break;
}
if (!n.isHidden && !n.isLastNode) {
n.isLastNode = true;
view.setNodeLineIcos(setting, n);
break;
} else {
n = null;
}
}
return n;
},
setLastNodeForShow: function(setting, nodes) {
var n,i,j, last, old;
for (i=nodes.length-1; i>=0; i--) {
n = nodes[i];
if (!last && !n.isHidden && n.isLastNode) {
last = n;
break;
} else if (!last && !n.isHidden && !n.isLastNode) {
n.isLastNode = true;
last = n;
view.setNodeLineIcos(setting, n);
} else if (last && n.isLastNode) {
n.isLastNode = false;
old = n;
view.setNodeLineIcos(setting, n);
break;
} else {
n = null;
}
}
return {"new":last, "old":old};
}
},
_z = {
view: _view,
data: _data
};
$.extend(true, $.fn.zTree._z, _z);
var zt = $.fn.zTree,
tools = zt._z.tools,
consts = zt.consts,
view = zt._z.view,
data = zt._z.data,
event = zt._z.event,
$$ = tools.$;
data.addInitNode(_initNode);
data.addBeforeA(_beforeA);
data.addZTreeTools(_zTreeTools);
// Override method in core
var _dInitNode = data.initNode;
data.initNode = function(setting, level, node, parentNode, isFirstNode, isLastNode, openFlag) {
var tmpPNode = (parentNode) ? parentNode: data.getRoot(setting),
children = tmpPNode[setting.data.key.children];
data.tmpHideFirstNode = view.setFirstNodeForHide(setting, children);
data.tmpHideLastNode = view.setLastNodeForHide(setting, children);
if (openFlag) {
view.setNodeLineIcos(setting, data.tmpHideFirstNode);
view.setNodeLineIcos(setting, data.tmpHideLastNode);
}
isFirstNode = (data.tmpHideFirstNode === node);
isLastNode = (data.tmpHideLastNode === node);
if (_dInitNode) _dInitNode.apply(data, arguments);
if (openFlag && isLastNode) {
view.clearOldLastNode(setting, node, openFlag);
}
};
var _makeChkFlag = data.makeChkFlag;
if (!!_makeChkFlag) {
data.makeChkFlag = function(setting, node) {
if (!!node && !!node.isHidden) {
return;
}
_makeChkFlag.apply(data, arguments);
}
}
var _getTreeCheckedNodes = data.getTreeCheckedNodes;
if (!!_getTreeCheckedNodes) {
data.getTreeCheckedNodes = function(setting, nodes, checked, results) {
if (!!nodes && nodes.length > 0) {
var p = nodes[0].getParentNode();
if (!!p && !!p.isHidden) {
return [];
}
}
return _getTreeCheckedNodes.apply(data, arguments);
}
}
var _getTreeChangeCheckedNodes = data.getTreeChangeCheckedNodes;
if (!!_getTreeChangeCheckedNodes) {
data.getTreeChangeCheckedNodes = function(setting, nodes, results) {
if (!!nodes && nodes.length > 0) {
var p = nodes[0].getParentNode();
if (!!p && !!p.isHidden) {
return [];
}
}
return _getTreeChangeCheckedNodes.apply(data, arguments);
}
}
var _expandCollapseSonNode = view.expandCollapseSonNode;
if (!!_expandCollapseSonNode) {
view.expandCollapseSonNode = function(setting, node, expandFlag, animateFlag, callback) {
if (!!node && !!node.isHidden) {
return;
}
_expandCollapseSonNode.apply(view, arguments);
}
}
var _setSonNodeCheckBox = view.setSonNodeCheckBox;
if (!!_setSonNodeCheckBox) {
view.setSonNodeCheckBox = function(setting, node, value, srcNode) {
if (!!node && !!node.isHidden) {
return;
}
_setSonNodeCheckBox.apply(view, arguments);
}
}
var _repairParentChkClassWithSelf = view.repairParentChkClassWithSelf;
if (!!_repairParentChkClassWithSelf) {
view.repairParentChkClassWithSelf = function(setting, node) {
if (!!node && !!node.isHidden) {
return;
}
_repairParentChkClassWithSelf.apply(view, arguments);
}
}
})(jQuery); | {
"pile_set_name": "Github"
} |
EventScript_UseSurf:: @ 8271EA0
checkpartymove MOVE_SURF
compare VAR_RESULT, PARTY_SIZE
goto_if_eq EventScript_EndUseSurf
bufferpartymonnick 0, VAR_RESULT
setfieldeffectargument 0, VAR_RESULT
lockall
msgbox gText_WantToUseSurf, MSGBOX_YESNO
compare VAR_RESULT, NO
goto_if_eq EventScript_ReleaseUseSurf
msgbox gText_PlayerUsedSurf, MSGBOX_DEFAULT
dofieldeffect FLDEFF_USE_SURF
EventScript_ReleaseUseSurf:: @ 8271ED5
releaseall
EventScript_EndUseSurf:: @ 8271ED6
end
| {
"pile_set_name": "Github"
} |
//
// BundleIdsResponse.swift
// AppStoreConnect-Swift-SDK
//
// Created by Patrick Balestra on 12/22/19.
//
import Foundation
/// A response containing a list of resources.
public struct BundleIdsResponse: Codable {
/// The resource data.
public let data: [BundleId]
/// The requested relationship data.
public let included: [BundleIdRelationship]?
/// Navigational links that include the self-link.
public let links: PagedDocumentLinks
/// Paging information.
public let meta: PagingInformation?
}
| {
"pile_set_name": "Github"
} |
<?php
/**
* System messages translation for CodeIgniter(tm)
*
* @author CodeIgniter community
* @copyright Copyright (c) 2014 - 2015, British Columbia Institute of Technology (http://bcit.ca/)
* @license http://opensource.org/licenses/MIT MIT License
* @link http://codeigniter.com
*/
defined('BASEPATH') OR exit('No direct script access allowed');
$lang['cal_su'] = 'أح';
$lang['cal_mo'] = 'إث';
$lang['cal_tu'] = 'ثل';
$lang['cal_we'] = 'أر';
$lang['cal_th'] = 'خم';
$lang['cal_fr'] = 'جم';
$lang['cal_sa'] = 'سب';
$lang['cal_sun'] = 'أح';
$lang['cal_mon'] = 'إث';
$lang['cal_tue'] = 'ثل';
$lang['cal_wed'] = 'أر';
$lang['cal_thu'] = 'خم';
$lang['cal_fri'] = 'جم';
$lang['cal_sat'] = 'سب';
$lang['cal_sunday'] = 'الأحد';
$lang['cal_monday'] = 'الإثنين';
$lang['cal_tuesday'] = 'الثلاثاء';
$lang['cal_wednesday'] = 'الأربعاء';
$lang['cal_thursday'] = 'الخميس';
$lang['cal_friday'] = 'الجمعة';
$lang['cal_saturday'] = 'السبت';
$lang['cal_jan'] = 'ينا';
$lang['cal_feb'] = 'فبر';
$lang['cal_mar'] = 'مار';
$lang['cal_apr'] = 'أبر';
$lang['cal_may'] = 'ماي';
$lang['cal_jun'] = 'يون';
$lang['cal_jul'] = 'يول';
$lang['cal_aug'] = 'أغس';
$lang['cal_sep'] = 'سبت';
$lang['cal_oct'] = 'أوك';
$lang['cal_nov'] = 'نوف';
$lang['cal_dec'] = 'ديس';
$lang['cal_january'] = 'يناير';
$lang['cal_february'] = 'فبراير';
$lang['cal_march'] = 'مارس';
$lang['cal_april'] = 'إبريل';
$lang['cal_mayl'] = 'مايو';
$lang['cal_june'] = 'يونيو';
$lang['cal_july'] = 'يوليو';
$lang['cal_august'] = 'أغسطس';
$lang['cal_september'] = 'سبتمبر';
$lang['cal_october'] = 'أكتوبر';
$lang['cal_november'] = 'نوفمبر';
$lang['cal_december'] = 'ديسمبر';
| {
"pile_set_name": "Github"
} |
/**********
This library is free software; you can redistribute it and/or modify it under
the terms of the GNU Lesser General Public License as published by the
Free Software Foundation; either version 3 of the License, or (at your
option) any later version. (See <http://www.gnu.org/copyleft/lesser.html>.)
This library is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for
more details.
You should have received a copy of the GNU Lesser General Public License
along with this library; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
**********/
// "liveMedia"
// Copyright (c) 1996-2019 Live Networks, Inc. All rights reserved.
// RTP sink for VP8 video
// C++ header
#ifndef _VP8_VIDEO_RTP_SINK_HH
#define _VP8_VIDEO_RTP_SINK_HH
#ifndef _VIDEO_RTP_SINK_HH
#include "VideoRTPSink.hh"
#endif
class VP8VideoRTPSink: public VideoRTPSink {
public:
static VP8VideoRTPSink* createNew(UsageEnvironment& env, Groupsock* RTPgs, unsigned char rtpPayloadFormat);
protected:
VP8VideoRTPSink(UsageEnvironment& env, Groupsock* RTPgs, unsigned char rtpPayloadFormat);
// called only by createNew()
virtual ~VP8VideoRTPSink();
private: // redefined virtual functions:
virtual void doSpecialFrameHandling(unsigned fragmentationOffset,
unsigned char* frameStart,
unsigned numBytesInFrame,
struct timeval framePresentationTime,
unsigned numRemainingBytes);
virtual
Boolean frameCanAppearAfterPacketStart(unsigned char const* frameStart,
unsigned numBytesInFrame) const;
virtual unsigned specialHeaderSize() const;
};
#endif
| {
"pile_set_name": "Github"
} |
// Copyright (c) 2014 Marshall A. Greenblatt. Portions copyright (c) 2011
// Google Inc. All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the name Chromium Embedded
// Framework nor the names of its contributors may be used to endorse
// or promote products derived from this software without specific prior
// written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// This defines a set of argument wrappers and related factory methods that
// can be used specify the refcounting and reference semantics of arguments
// that are bound by the Bind() function in base/bind.h.
//
// It also defines a set of simple functions and utilities that people want
// when using Callback<> and Bind().
//
//
// ARGUMENT BINDING WRAPPERS
//
// The wrapper functions are base::Unretained(), base::Owned(), base::Passed(),
// base::ConstRef(), and base::IgnoreResult().
//
// Unretained() allows Bind() to bind a non-refcounted class, and to disable
// refcounting on arguments that are refcounted objects.
//
// Owned() transfers ownership of an object to the Callback resulting from
// bind; the object will be deleted when the Callback is deleted.
//
// Passed() is for transferring movable-but-not-copyable types (eg. scoped_ptr)
// through a Callback. Logically, this signifies a destructive transfer of
// the state of the argument into the target function. Invoking
// Callback::Run() twice on a Callback that was created with a Passed()
// argument will CHECK() because the first invocation would have already
// transferred ownership to the target function.
//
// ConstRef() allows binding a constant reference to an argument rather
// than a copy.
//
// IgnoreResult() is used to adapt a function or Callback with a return type to
// one with a void return. This is most useful if you have a function with,
// say, a pesky ignorable bool return that you want to use with PostTask or
// something else that expect a Callback with a void return.
//
// EXAMPLE OF Unretained():
//
// class Foo {
// public:
// void func() { cout << "Foo:f" << endl; }
// };
//
// // In some function somewhere.
// Foo foo;
// Closure foo_callback =
// Bind(&Foo::func, Unretained(&foo));
// foo_callback.Run(); // Prints "Foo:f".
//
// Without the Unretained() wrapper on |&foo|, the above call would fail
// to compile because Foo does not support the AddRef() and Release() methods.
//
//
// EXAMPLE OF Owned():
//
// void foo(int* arg) { cout << *arg << endl }
//
// int* pn = new int(1);
// Closure foo_callback = Bind(&foo, Owned(pn));
//
// foo_callback.Run(); // Prints "1"
// foo_callback.Run(); // Prints "1"
// *n = 2;
// foo_callback.Run(); // Prints "2"
//
// foo_callback.Reset(); // |pn| is deleted. Also will happen when
// // |foo_callback| goes out of scope.
//
// Without Owned(), someone would have to know to delete |pn| when the last
// reference to the Callback is deleted.
//
//
// EXAMPLE OF ConstRef():
//
// void foo(int arg) { cout << arg << endl }
//
// int n = 1;
// Closure no_ref = Bind(&foo, n);
// Closure has_ref = Bind(&foo, ConstRef(n));
//
// no_ref.Run(); // Prints "1"
// has_ref.Run(); // Prints "1"
//
// n = 2;
// no_ref.Run(); // Prints "1"
// has_ref.Run(); // Prints "2"
//
// Note that because ConstRef() takes a reference on |n|, |n| must outlive all
// its bound callbacks.
//
//
// EXAMPLE OF IgnoreResult():
//
// int DoSomething(int arg) { cout << arg << endl; }
//
// // Assign to a Callback with a void return type.
// Callback<void(int)> cb = Bind(IgnoreResult(&DoSomething));
// cb->Run(1); // Prints "1".
//
// // Prints "1" on |ml|.
// ml->PostTask(FROM_HERE, Bind(IgnoreResult(&DoSomething), 1);
//
//
// EXAMPLE OF Passed():
//
// void TakesOwnership(scoped_ptr<Foo> arg) { }
// scoped_ptr<Foo> CreateFoo() { return scoped_ptr<Foo>(new Foo()); }
//
// scoped_ptr<Foo> f(new Foo());
//
// // |cb| is given ownership of Foo(). |f| is now NULL.
// // You can use f.Pass() in place of &f, but it's more verbose.
// Closure cb = Bind(&TakesOwnership, Passed(&f));
//
// // Run was never called so |cb| still owns Foo() and deletes
// // it on Reset().
// cb.Reset();
//
// // |cb| is given a new Foo created by CreateFoo().
// cb = Bind(&TakesOwnership, Passed(CreateFoo()));
//
// // |arg| in TakesOwnership() is given ownership of Foo(). |cb|
// // no longer owns Foo() and, if reset, would not delete Foo().
// cb.Run(); // Foo() is now transferred to |arg| and deleted.
// cb.Run(); // This CHECK()s since Foo() already been used once.
//
// Passed() is particularly useful with PostTask() when you are transferring
// ownership of an argument into a task, but don't necessarily know if the
// task will always be executed. This can happen if the task is cancellable
// or if it is posted to a MessageLoopProxy.
//
//
// SIMPLE FUNCTIONS AND UTILITIES.
//
// DoNothing() - Useful for creating a Closure that does nothing when called.
// DeletePointer<T>() - Useful for creating a Closure that will delete a
// pointer when invoked. Only use this when necessary.
// In most cases MessageLoop::DeleteSoon() is a better
// fit.
#ifndef CEF_INCLUDE_BASE_CEF_BIND_HELPERS_H_
#define CEF_INCLUDE_BASE_CEF_BIND_HELPERS_H_
#pragma once
#if defined(BASE_BIND_HELPERS_H_)
// Do nothing if the Chromium header has already been included.
// This can happen in cases where Chromium code is used directly by the
// client application. When using Chromium code directly always include
// the Chromium header first to avoid type conflicts.
#elif defined(USING_CHROMIUM_INCLUDES)
// When building CEF include the Chromium header directly.
#include "base/bind_helpers.h"
#else // !USING_CHROMIUM_INCLUDES
// The following is substantially similar to the Chromium implementation.
// If the Chromium implementation diverges the below implementation should be
// updated to match.
#include "include/base/cef_basictypes.h"
#include "include/base/cef_callback.h"
#include "include/base/cef_template_util.h"
#include "include/base/cef_weak_ptr.h"
namespace base {
namespace cef_internal {
// Use the Substitution Failure Is Not An Error (SFINAE) trick to inspect T
// for the existence of AddRef() and Release() functions of the correct
// signature.
//
// http://en.wikipedia.org/wiki/Substitution_failure_is_not_an_error
// http://stackoverflow.com/questions/257288/is-it-possible-to-write-a-c-template-to-check-for-a-functions-existence
// http://stackoverflow.com/questions/4358584/sfinae-approach-comparison
// http://stackoverflow.com/questions/1966362/sfinae-to-check-for-inherited-member-functions
//
// The last link in particular show the method used below.
//
// For SFINAE to work with inherited methods, we need to pull some extra tricks
// with multiple inheritance. In the more standard formulation, the overloads
// of Check would be:
//
// template <typename C>
// Yes NotTheCheckWeWant(Helper<&C::TargetFunc>*);
//
// template <typename C>
// No NotTheCheckWeWant(...);
//
// static const bool value = sizeof(NotTheCheckWeWant<T>(0)) == sizeof(Yes);
//
// The problem here is that template resolution will not match
// C::TargetFunc if TargetFunc does not exist directly in C. That is, if
// TargetFunc in inherited from an ancestor, &C::TargetFunc will not match,
// |value| will be false. This formulation only checks for whether or
// not TargetFunc exist directly in the class being introspected.
//
// To get around this, we play a dirty trick with multiple inheritance.
// First, We create a class BaseMixin that declares each function that we
// want to probe for. Then we create a class Base that inherits from both T
// (the class we wish to probe) and BaseMixin. Note that the function
// signature in BaseMixin does not need to match the signature of the function
// we are probing for; thus it's easiest to just use void(void).
//
// Now, if TargetFunc exists somewhere in T, then &Base::TargetFunc has an
// ambiguous resolution between BaseMixin and T. This lets us write the
// following:
//
// template <typename C>
// No GoodCheck(Helper<&C::TargetFunc>*);
//
// template <typename C>
// Yes GoodCheck(...);
//
// static const bool value = sizeof(GoodCheck<Base>(0)) == sizeof(Yes);
//
// Notice here that the variadic version of GoodCheck() returns Yes here
// instead of No like the previous one. Also notice that we calculate |value|
// by specializing GoodCheck() on Base instead of T.
//
// We've reversed the roles of the variadic, and Helper overloads.
// GoodCheck(Helper<&C::TargetFunc>*), when C = Base, fails to be a valid
// substitution if T::TargetFunc exists. Thus GoodCheck<Base>(0) will resolve
// to the variadic version if T has TargetFunc. If T::TargetFunc does not
// exist, then &C::TargetFunc is not ambiguous, and the overload resolution
// will prefer GoodCheck(Helper<&C::TargetFunc>*).
//
// This method of SFINAE will correctly probe for inherited names, but it cannot
// typecheck those names. It's still a good enough sanity check though.
//
// Works on gcc-4.2, gcc-4.4, and Visual Studio 2008.
//
// TODO(ajwong): Move to ref_counted.h or template_util.h when we've vetted
// this works well.
//
// TODO(ajwong): Make this check for Release() as well.
// See http://crbug.com/82038.
template <typename T>
class SupportsAddRefAndRelease {
typedef char Yes[1];
typedef char No[2];
struct BaseMixin {
void AddRef();
};
// MSVC warns when you try to use Base if T has a private destructor, the
// common pattern for refcounted types. It does this even though no attempt to
// instantiate Base is made. We disable the warning for this definition.
#if defined(OS_WIN)
#pragma warning(push)
#pragma warning(disable:4624)
#endif
struct Base : public T, public BaseMixin {
};
#if defined(OS_WIN)
#pragma warning(pop)
#endif
template <void(BaseMixin::*)(void)> struct Helper {};
template <typename C>
static No& Check(Helper<&C::AddRef>*);
template <typename >
static Yes& Check(...);
public:
static const bool value = sizeof(Check<Base>(0)) == sizeof(Yes);
};
// Helpers to assert that arguments of a recounted type are bound with a
// scoped_refptr.
template <bool IsClasstype, typename T>
struct UnsafeBindtoRefCountedArgHelper : false_type {
};
template <typename T>
struct UnsafeBindtoRefCountedArgHelper<true, T>
: integral_constant<bool, SupportsAddRefAndRelease<T>::value> {
};
template <typename T>
struct UnsafeBindtoRefCountedArg : false_type {
};
template <typename T>
struct UnsafeBindtoRefCountedArg<T*>
: UnsafeBindtoRefCountedArgHelper<is_class<T>::value, T> {
};
template <typename T>
class HasIsMethodTag {
typedef char Yes[1];
typedef char No[2];
template <typename U>
static Yes& Check(typename U::IsMethod*);
template <typename U>
static No& Check(...);
public:
static const bool value = sizeof(Check<T>(0)) == sizeof(Yes);
};
template <typename T>
class UnretainedWrapper {
public:
explicit UnretainedWrapper(T* o) : ptr_(o) {}
T* get() const { return ptr_; }
private:
T* ptr_;
};
template <typename T>
class ConstRefWrapper {
public:
explicit ConstRefWrapper(const T& o) : ptr_(&o) {}
const T& get() const { return *ptr_; }
private:
const T* ptr_;
};
template <typename T>
struct IgnoreResultHelper {
explicit IgnoreResultHelper(T functor) : functor_(functor) {}
T functor_;
};
template <typename T>
struct IgnoreResultHelper<Callback<T> > {
explicit IgnoreResultHelper(const Callback<T>& functor) : functor_(functor) {}
const Callback<T>& functor_;
};
// An alternate implementation is to avoid the destructive copy, and instead
// specialize ParamTraits<> for OwnedWrapper<> to change the StorageType to
// a class that is essentially a scoped_ptr<>.
//
// The current implementation has the benefit though of leaving ParamTraits<>
// fully in callback_internal.h as well as avoiding type conversions during
// storage.
template <typename T>
class OwnedWrapper {
public:
explicit OwnedWrapper(T* o) : ptr_(o) {}
~OwnedWrapper() { delete ptr_; }
T* get() const { return ptr_; }
OwnedWrapper(const OwnedWrapper& other) {
ptr_ = other.ptr_;
other.ptr_ = NULL;
}
private:
mutable T* ptr_;
};
// PassedWrapper is a copyable adapter for a scoper that ignores const.
//
// It is needed to get around the fact that Bind() takes a const reference to
// all its arguments. Because Bind() takes a const reference to avoid
// unnecessary copies, it is incompatible with movable-but-not-copyable
// types; doing a destructive "move" of the type into Bind() would violate
// the const correctness.
//
// This conundrum cannot be solved without either C++11 rvalue references or
// a O(2^n) blowup of Bind() templates to handle each combination of regular
// types and movable-but-not-copyable types. Thus we introduce a wrapper type
// that is copyable to transmit the correct type information down into
// BindState<>. Ignoring const in this type makes sense because it is only
// created when we are explicitly trying to do a destructive move.
//
// Two notes:
// 1) PassedWrapper supports any type that has a "Pass()" function.
// This is intentional. The whitelisting of which specific types we
// support is maintained by CallbackParamTraits<>.
// 2) is_valid_ is distinct from NULL because it is valid to bind a "NULL"
// scoper to a Callback and allow the Callback to execute once.
template <typename T>
class PassedWrapper {
public:
explicit PassedWrapper(T scoper) : is_valid_(true), scoper_(scoper.Pass()) {}
PassedWrapper(const PassedWrapper& other)
: is_valid_(other.is_valid_), scoper_(other.scoper_.Pass()) {
}
T Pass() const {
CHECK(is_valid_);
is_valid_ = false;
return scoper_.Pass();
}
private:
mutable bool is_valid_;
mutable T scoper_;
};
// Unwrap the stored parameters for the wrappers above.
template <typename T>
struct UnwrapTraits {
typedef const T& ForwardType;
static ForwardType Unwrap(const T& o) { return o; }
};
template <typename T>
struct UnwrapTraits<UnretainedWrapper<T> > {
typedef T* ForwardType;
static ForwardType Unwrap(UnretainedWrapper<T> unretained) {
return unretained.get();
}
};
template <typename T>
struct UnwrapTraits<ConstRefWrapper<T> > {
typedef const T& ForwardType;
static ForwardType Unwrap(ConstRefWrapper<T> const_ref) {
return const_ref.get();
}
};
template <typename T>
struct UnwrapTraits<scoped_refptr<T> > {
typedef T* ForwardType;
static ForwardType Unwrap(const scoped_refptr<T>& o) { return o.get(); }
};
template <typename T>
struct UnwrapTraits<WeakPtr<T> > {
typedef const WeakPtr<T>& ForwardType;
static ForwardType Unwrap(const WeakPtr<T>& o) { return o; }
};
template <typename T>
struct UnwrapTraits<OwnedWrapper<T> > {
typedef T* ForwardType;
static ForwardType Unwrap(const OwnedWrapper<T>& o) {
return o.get();
}
};
template <typename T>
struct UnwrapTraits<PassedWrapper<T> > {
typedef T ForwardType;
static T Unwrap(PassedWrapper<T>& o) {
return o.Pass();
}
};
// Utility for handling different refcounting semantics in the Bind()
// function.
template <bool is_method, typename T>
struct MaybeRefcount;
template <typename T>
struct MaybeRefcount<false, T> {
static void AddRef(const T&) {}
static void Release(const T&) {}
};
template <typename T, size_t n>
struct MaybeRefcount<false, T[n]> {
static void AddRef(const T*) {}
static void Release(const T*) {}
};
template <typename T>
struct MaybeRefcount<true, T> {
static void AddRef(const T&) {}
static void Release(const T&) {}
};
template <typename T>
struct MaybeRefcount<true, T*> {
static void AddRef(T* o) { o->AddRef(); }
static void Release(T* o) { o->Release(); }
};
// No need to additionally AddRef() and Release() since we are storing a
// scoped_refptr<> inside the storage object already.
template <typename T>
struct MaybeRefcount<true, scoped_refptr<T> > {
static void AddRef(const scoped_refptr<T>& o) {}
static void Release(const scoped_refptr<T>& o) {}
};
template <typename T>
struct MaybeRefcount<true, const T*> {
static void AddRef(const T* o) { o->AddRef(); }
static void Release(const T* o) { o->Release(); }
};
// IsWeakMethod is a helper that determine if we are binding a WeakPtr<> to a
// method. It is used internally by Bind() to select the correct
// InvokeHelper that will no-op itself in the event the WeakPtr<> for
// the target object is invalidated.
//
// P1 should be the type of the object that will be received of the method.
template <bool IsMethod, typename P1>
struct IsWeakMethod : public false_type {};
template <typename T>
struct IsWeakMethod<true, WeakPtr<T> > : public true_type {};
template <typename T>
struct IsWeakMethod<true, ConstRefWrapper<WeakPtr<T> > > : public true_type {};
} // namespace cef_internal
template <typename T>
static inline cef_internal::UnretainedWrapper<T> Unretained(T* o) {
return cef_internal::UnretainedWrapper<T>(o);
}
template <typename T>
static inline cef_internal::ConstRefWrapper<T> ConstRef(const T& o) {
return cef_internal::ConstRefWrapper<T>(o);
}
template <typename T>
static inline cef_internal::OwnedWrapper<T> Owned(T* o) {
return cef_internal::OwnedWrapper<T>(o);
}
// We offer 2 syntaxes for calling Passed(). The first takes a temporary and
// is best suited for use with the return value of a function. The second
// takes a pointer to the scoper and is just syntactic sugar to avoid having
// to write Passed(scoper.Pass()).
template <typename T>
static inline cef_internal::PassedWrapper<T> Passed(T scoper) {
return cef_internal::PassedWrapper<T>(scoper.Pass());
}
template <typename T>
static inline cef_internal::PassedWrapper<T> Passed(T* scoper) {
return cef_internal::PassedWrapper<T>(scoper->Pass());
}
template <typename T>
static inline cef_internal::IgnoreResultHelper<T> IgnoreResult(T data) {
return cef_internal::IgnoreResultHelper<T>(data);
}
template <typename T>
static inline cef_internal::IgnoreResultHelper<Callback<T> >
IgnoreResult(const Callback<T>& data) {
return cef_internal::IgnoreResultHelper<Callback<T> >(data);
}
void DoNothing();
template<typename T>
void DeletePointer(T* obj) {
delete obj;
}
} // namespace base
#endif // !USING_CHROMIUM_INCLUDES
#endif // CEF_INCLUDE_BASE_CEF_BIND_HELPERS_H_
| {
"pile_set_name": "Github"
} |
"""Helium package for Sublime Text 3.
The package provides code execution and completion in interaction with Jupyter.
Copyright (c) 2016-2018, NEGORO Tetsuya (https://github.com/ngr-t)
"""
import bisect
import json
import os
from os.path import expanduser
import re
from uuid import uuid4, UUID
from functools import partial
from logging import INFO, StreamHandler, getLogger
from enum import Enum, unique
from typing import Dict, Tuple, List, Generator
import sublime
import sublime_lib
from sublime_plugin import EventListener, TextCommand, ViewEventListener
from .lib.kernel import KernelConnection, ExecState
from .lib.utils import add_path, chain_callbacks
with add_path(os.path.join(os.path.dirname(__file__), "lib/client")):
# Import jupyter_client related functions and classes.
# Temporarily insert `lib` into sys.path not to affect other packages.
from jupyter_client.connect import tunnel_to_kernel
from jupyter_client.kernelspec import find_kernel_specs
from jupyter_client.manager import KernelManager
# Logger setting
HELIUM_LOGGER = getLogger(__name__)
HANDLER = StreamHandler()
HANDLER.setLevel(INFO)
if len(HELIUM_LOGGER.handlers) == 0:
HELIUM_LOGGER.setLevel(INFO)
HELIUM_LOGGER.addHandler(HANDLER)
HELIUM_STATUS_KEY = "helium_connected_kernel"
# Regex patterns to extract code lines.
INDENT_PATTERN = re.compile(r"^([ \t]*)")
# TODO: move CSS into separate file
RUN_CELL_PHANTOM = """<body id="helium-runCell">
<style>
.runCell {
text-decoration: none;
color: color(var(--bluish) alpha(0.33));
font-style: italic;
}
</style>
<a class='runCell' href='runCell'>Run cell</a>
</body>
"""
RUN_CELL_PHANTOM_ID = "HeliumRunCell"
ORG_JUPYTER_PATH = os.environ.get("JUPYTER_PATH")
def _refresh_jupyter_path():
additional_jupyter_path = sublime.load_settings("Helium.sublime-settings").get(
"jupyter_path"
)
os.environ["JUPYTER_PATH"] = ":".join(
[
path
for path in [ORG_JUPYTER_PATH, additional_jupyter_path]
if path is not None
]
)
class ViewManager(object):
"""Manage the relation of views and kernels."""
kernel_by_buffer_id = {} # type: Dict[int, KernelConnection]
def __new__(cls, *args, **kwargs):
if not hasattr(cls, "__instance__"):
cls.__instance__ = super(ViewManager, object).__new__(cls, *args, **kwargs)
return cls.__instance__
def __init__(self, *args, **kwargs):
pass
@classmethod
def connect_kernel(
cls, buffer_id: int, lang, kernel_id: UUID
): # type: (...) -> None
"""Connect view to kernel."""
kernel = HeliumKernelManager.get_kernel(kernel_id)
cls.kernel_by_buffer_id[buffer_id] = kernel
inline_output = sublime.load_settings("Helium.sublime-settings").get(
"inline_output"
)
if not inline_output:
kernel.activate_view()
@classmethod
def remove_view(cls, buffer_id: int): # type: (...) -> None
"""Remove view from manager."""
if buffer_id in cls.kernel_by_buffer_id:
del cls.kernel_by_buffer_id[buffer_id]
@classmethod
def get_kernel_for_view(cls, buffer_id: int): # type: (...) -> KernelConnection
"""Get Kernel instance corresponding to the buffer_id."""
return cls.kernel_by_buffer_id[buffer_id]
class HeliumKernelManager(object): # TODO: Rename to just KernelManager
"""Manage Jupyter kernels."""
# The key is a tuple consisted of the name of kernelspec and kernel ID,
# the value is a KernelConnection instance correspond to it.
kernels = {} # type: Dict[Tuple[str, UUID], KernelConnection]
logger = HELIUM_LOGGER
def __new__(cls, *args, **kwargs):
"""Make this class a singleton."""
if not hasattr(cls, "__instance__"):
cls.__instance__ = super(HeliumKernelManager, object).__new__(
cls, *args, **kwargs
)
return cls.__instance__
@classmethod
def list_kernelspecs(cls):
"""Get the kernelspecs."""
_refresh_jupyter_path()
return find_kernel_specs()
@classmethod
def list_kernels(cls):
"""Get the list of kernels."""
return [
{"name": cls.get_kernel(kernel_id).lang, "id": kernel_id}
for kernel_id in cls.kernels.keys()
if cls.get_kernel(kernel_id).is_alive()
]
@classmethod
def list_kernel_reprs(cls): # type: (...) -> List[str]
"""Get the list of representations of kernels."""
def get_repr(kernel): # type: (...) -> str
key = (kernel["name"], kernel["id"])
try:
return cls.kernels[key].repr
except KeyError:
return "[{lang}] {kernel_id}".format(
lang=kernel["name"], kernel_id=kernel["id"]
)
return list(map(get_repr, cls.list_kernels()))
@classmethod
def get_kernel(
cls, kernel_id: UUID, connection_name: str = None
): # type: (...) -> KernelConnection
"""Get KernelConnection object."""
return cls.kernels[kernel_id] # type: ignore
@classmethod
def start_kernel(
cls,
kernelspec_name=None,
connection_info=None,
connection_name: str = None,
cwd=None,
):
# type: (...) -> KernelConnection
"""Start kernel and return a `Kernel` instance.
:cwd: Current work directory, which will be the root for the new kernel. If this
is None, the users home directory will be set instead.
"""
kernel_id = uuid4()
if not cwd:
cwd = expanduser("~")
if kernelspec_name:
kernel_manager = KernelManager(kernel_name=kernelspec_name)
kernel_manager.start_kernel(cwd=cwd)
elif connection_info:
kernel_manager = KernelManager()
kernel_manager.load_connection_info(connection_info)
# `KernelManager.kernel_name` is not automatically set from connection info.
kernel_manager.kernel_name = connection_info.get("kernel_name", "")
else:
raise Exception(
"You must specify any of {`kernelspec_name`, `connection_info`}."
)
kernel = KernelConnection(
kernel_id,
kernel_manager,
cls,
connection_name=connection_name,
logger=cls.logger,
)
# TODO: Correct inconsistent use of variable name `kernel_id`
# is either UUID or Tuple[str, UUID]; maybe rename one variable
# to conn_id?
cls.kernels[kernel_id] = kernel # type: ignore
return kernel
@classmethod
def shutdown_kernel(cls, kernel_id: UUID): # type: (...) -> None
"""Shutdown kernel."""
cls.get_kernel(kernel_id).shutdown_kernel()
@classmethod
def restart_kernel(cls, kernel_id: UUID): # type: (...) -> None
"""Restart kernel."""
cls.get_kernel(kernel_id).restart_kernel()
@classmethod
def interrupt_kernel(cls, kernel_id: UUID): # type: (...) -> None
"""Interrupt kernel."""
cls.get_kernel(kernel_id).interrupt_kernel()
@chain_callbacks
def _enter_connection_info(
window: sublime.Window, continue_cb
): # type: (...) -> Generator
connection_info_str = yield partial(
window.show_input_panel,
"Enter connection info or the path to connection file.",
"",
on_change=None,
on_cancel=None,
)
try:
continue_cb(json.loads(connection_info_str))
except ValueError:
try:
with open(connection_info_str) as infs:
continue_cb(json.loads(infs.read()))
except FileNotFoundError:
sublime.message_dialog(
"The input string was neither a valid JSON string nor a file path."
)
raise
@chain_callbacks
def _start_kernel(
window: sublime.Window,
view: sublime.View,
continue_cb=lambda: None,
*,
logger=HELIUM_LOGGER
): # type: (...) -> Generator
kernelspecs = HeliumKernelManager.list_kernelspecs()
menu_items = list(kernelspecs.keys()) + [
"(Enter connection info)",
"(Connect remote kernel via SSH)",
]
index = yield partial(window.show_quick_panel, menu_items)
cwd = expanduser('~')
if view and view.file_name():
cwd = os.path.dirname(view.file_name())
if index == -1:
return
elif index == len(kernelspecs):
# Create a kernel from connection info.
connection_info = yield partial(_enter_connection_info, window)
connection_name = yield partial(
window.show_input_panel,
"connection name",
"",
on_change=None,
on_cancel=None,
)
if connection_name == "":
connection_name = None
kernel = HeliumKernelManager.start_kernel(
connection_info=connection_info, connection_name=connection_name, cwd=cwd
)
elif index == len(kernelspecs) + 1:
# Create a kernel with SSH tunneling.
servers = sublime.load_settings("Helium.sublime-settings").get("ssh_servers")
if not servers:
sublime.message_dialog(
"Please set `ssh_servers` item of the config file via `Helium: ` "
"to connect SSH servers."
)
return
menu_items = list(servers.keys())
server_index = yield partial(window.show_quick_panel, menu_items)
server = servers[menu_items[server_index]]
connection_info = yield partial(_enter_connection_info, window)
shell_port, iopub_port, stdin_port, hb_port = tunnel_to_kernel(
connection_info, server["server"], server.get("key", None)
)
new_ports = {
"shell_port": shell_port,
"iopub_port": iopub_port,
"stdin_port": stdin_port,
"hb_port": hb_port,
}
connection_info.update(new_ports)
connection_name = yield partial(
window.show_input_panel,
"connection name",
"",
on_change=None,
on_cancel=None,
)
kernel = HeliumKernelManager.start_kernel(
connection_info=connection_info, connection_name=connection_name
)
else:
# Create a kernel from the kernelspec name.
selected_kernelspec = menu_items[index]
connection_name = yield partial(
window.show_input_panel,
"connection name",
"",
on_change=None,
on_cancel=None,
)
if connection_name == "":
connection_name = None
kernel = HeliumKernelManager.start_kernel(
kernelspec_name=selected_kernelspec,
connection_name=connection_name,
cwd=cwd,
)
ViewManager.connect_kernel(view.buffer_id(), kernel.lang, kernel.kernel_id)
if view.file_name():
view_name = view.file_name()
else:
view_name = view.name()
log_info_msg = (
"Connected view '{view_name}(id: {buffer_id})'" "to kernel {kernel_id}."
).format(
view_name=view_name, buffer_id=view.buffer_id(), kernel_id=kernel.kernel_id
)
logger.info(log_info_msg)
continue_cb()
class HeliumStartKernel(TextCommand):
"""Start a kernel and connect view to it."""
def run(self, edit, *, logger=HELIUM_LOGGER): # type: (...) -> None
"""Command definition."""
_start_kernel(sublime.active_window(), self.view)
@unique
class KernelPaletteCommand(Enum):
CONNECT = "Connect"
RENAME = "Rename"
INTERRUPT = "Interrupt"
RESTART = "Restart"
SHUTDOWN = "Shutdown"
BACK = "Back to the kernel list"
@chain_callbacks
def _list_kernels(window: sublime.Window, view: sublime.View, *, logger=HELIUM_LOGGER):
selected_kernel = yield partial(
_show_kernel_selection_menu, window, view, add_new=True
)
commands = list(KernelPaletteCommand)
try:
ViewManager.get_kernel_for_view(view.buffer_id())
except KeyError:
pass
else:
# if view has connected kernel, do not show connect kernel command
commands = [sc for sc in commands if sc is not KernelPaletteCommand.CONNECT]
index = yield partial(window.show_quick_panel, commands)
if index == -1:
return
choice = list(commands)[index]
if choice is KernelPaletteCommand.CONNECT:
# Connect
ViewManager.connect_kernel(
view.buffer_id(), selected_kernel["name"], selected_kernel["id"]
)
if view.file_name():
view_name = view.file_name()
else:
view_name = view.name()
log_info_msg = (
"Connected view '{view_name}(id: {buffer_id})'" "to kernel {kernel_id}."
).format(
view_name=view_name,
buffer_id=view.buffer_id(),
kernel_id=selected_kernel["id"],
)
logger.info(log_info_msg)
elif choice is KernelPaletteCommand.RENAME:
# Rename
conn = HeliumKernelManager.get_kernel(selected_kernel["id"])
curr_name = conn.connection_name if conn.connection_name is not None else ""
new_name = yield partial(
window.show_input_panel,
"New name",
curr_name,
on_change=None,
on_cancel=None,
)
conn.connection_name = new_name
elif choice is KernelPaletteCommand.INTERRUPT:
# Interrupt
HeliumKernelManager.interrupt_kernel(selected_kernel["id"])
log_info_msg = ("Interrupted kernel {kernel_id}.").format(
kernel_id=selected_kernel["id"]
)
logger.info(log_info_msg)
elif choice is KernelPaletteCommand.RESTART:
# Restart
HeliumKernelManager.restart_kernel(selected_kernel["id"])
log_info_msg = ("Restarted kernel {kernel_id}.").format(
kernel_id=selected_kernel["id"]
)
logger.info(log_info_msg)
elif choice is KernelPaletteCommand.SHUTDOWN:
# Shutdown
HeliumKernelManager.shutdown_kernel(selected_kernel["id"])
log_info_msg = ("Shutdown kernel {kernel_id}.").format(
kernel_id=selected_kernel["id"]
)
logger.info(log_info_msg)
elif choice is KernelPaletteCommand.BACK:
# Back to the kernel list
yield _list_kernels(window, view)
sublime.set_timeout_async(lambda: StatusBar(view), 0)
class HeliumListKernels(TextCommand):
"""Command that shows the list of kernels and do some action for chosen kernels."""
def run(self, edit, *, logger=HELIUM_LOGGER): # type: (...) -> None
_list_kernels(sublime.active_window(), self.view)
@chain_callbacks
def _connect_kernel(
window: sublime.Window,
view: sublime.View,
*,
continue_cb=lambda: None,
logger=HELIUM_LOGGER
): # type: (...) -> Generator
kernel_list = HeliumKernelManager.list_kernels()
menu_items = [
"[{lang}] {kernel_id}".format(lang=kernel["name"], kernel_id=kernel["id"])
for kernel in kernel_list
]
menu_items += ["New kernel"]
index = yield partial(window.show_quick_panel, menu_items)
if index == -1:
return
elif index == len(kernel_list):
yield partial(_start_kernel, window, view)
else:
selected_kernel = kernel_list[index]
ViewManager.connect_kernel(
view.buffer_id(), selected_kernel["name"], selected_kernel["id"]
)
if view.file_name():
view_name = view.file_name()
else:
view_name = view.name()
update_run_cell_phantoms(view)
log_info_msg = (
"Connected view '{view_name}(id: {buffer_id})' to kernel {kernel_id}."
).format(
view_name=view_name,
buffer_id=view.buffer_id(),
kernel_id=selected_kernel["id"],
)
logger.info(log_info_msg)
sublime.set_timeout_async(lambda: StatusBar(view), 0)
continue_cb()
class HeliumConnectKernel(TextCommand):
"""Connect to Jupyter kernel."""
def run(self, edit, *, logger=HELIUM_LOGGER): # type: (...) -> None
"""Command definition."""
_connect_kernel(sublime.active_window(), self.view, logger=logger)
@chain_callbacks
def _show_kernel_selection_menu(
window: sublime.Window, view: sublime.View, cb, *, add_new: bool = False
): # type: (...) -> Generator
# Get the kernel ID related to `view` if exists.
try:
current_kernel_id = ViewManager.get_kernel_for_view(view.buffer_id()).kernel_id
except KeyError:
# TODO fix to use property of views.
result = re.match(r"\*Helium Output\* .*?\(\[.*?\] ([\w-]*)\)", view.name())
if result:
current_kernel_id = result.group(1)
else:
current_kernel_id = ""
# It's better to pass the list of (connection_name, kernel_id) tuples
# to improve the appearane of the menu.
kernel_list = HeliumKernelManager.list_kernels()
menu_items = [
"* " + repr if kernel["id"] == current_kernel_id else repr
for repr, kernel in zip(HeliumKernelManager.list_kernel_reprs(), kernel_list)
]
if add_new:
menu_items += ["New kernel"]
index = yield partial(window.show_quick_panel, menu_items)
if index == -1:
selected_kernel = None
elif index == len(kernel_list):
yield partial(_start_kernel, window, view)
else:
selected_kernel = kernel_list[index]
cb(selected_kernel)
@chain_callbacks
def _interrupt_kernel(
window: sublime.Window,
view: sublime.View,
*,
continue_cb=lambda: None,
logger=HELIUM_LOGGER
):
# type: (...) -> Generator
selected_kernel = yield partial(_show_kernel_selection_menu, window, view)
if selected_kernel is not None:
HeliumKernelManager.interrupt_kernel(selected_kernel["id"])
log_info_msg = ("Interrupted kernel {kernel_id}.").format(
kernel_id=selected_kernel["id"]
)
logger.info(log_info_msg)
continue_cb()
class HeliumInterruptKernel(TextCommand):
"""Interrupt Jupyter kernel."""
def is_enabled(self, *, logger=HELIUM_LOGGER): # type: (...) -> bool
try:
kernel = ViewManager.get_kernel_for_view(self.view.buffer_id())
except KeyError:
return False
return HeliumKernelManager.get_kernel(kernel.kernel_id).is_alive()
def is_visible(self, *, logger=HELIUM_LOGGER): # type: (...) -> bool
return self.is_enabled()
def run(self, edit, *, logger=HELIUM_LOGGER): # type: (...) -> None
"""Command definition."""
_interrupt_kernel(sublime.active_window(), self.view, logger=logger)
@chain_callbacks
def _restart_kernel(
window: sublime.Window,
view: sublime.View,
*,
continue_cb=lambda: None,
logger=HELIUM_LOGGER
): # type: (...) -> Generator
selected_kernel = yield partial(_show_kernel_selection_menu, window, view)
if selected_kernel is not None:
HeliumKernelManager.restart_kernel(selected_kernel["id"])
log_info_msg = ("Restarted kernel {kernel_id}.").format(
kernel_id=selected_kernel["id"]
)
logger.info(log_info_msg)
continue_cb()
class HeliumRestartKernel(TextCommand):
"""Restart Jupyter kernel."""
def is_enabled(self, *, logger=HELIUM_LOGGER): # type: (...) -> bool
try:
kernel = ViewManager.get_kernel_for_view(self.view.buffer_id())
except KeyError:
return False
return HeliumKernelManager.get_kernel(kernel.kernel_id).is_alive()
def is_visible(self, *, logger=HELIUM_LOGGER): # type: (...) -> bool
return self.is_enabled()
def run(self, edit, *, logger=HELIUM_LOGGER): # type: (...) -> None
"""Command definition."""
_restart_kernel(sublime.active_window(), self.view, logger=logger)
@chain_callbacks
def _shutdown_kernel(
window: sublime.Window,
view: sublime.View,
*,
continue_cb=lambda: None,
logger=HELIUM_LOGGER
): # type: (...) -> Generator
selected_kernel = yield partial(_show_kernel_selection_menu, window, view)
if selected_kernel is not None:
HeliumKernelManager.shutdown_kernel(selected_kernel["id"])
log_info_msg = ("Shutdown kernel {kernel_id}.").format(
kernel_id=selected_kernel["id"]
)
logger.info(log_info_msg)
ViewManager.remove_view(view.buffer_id())
view.set_status(HELIUM_STATUS_KEY, "")
continue_cb()
class HeliumShutdownKernel(TextCommand):
"""Shutdown Jupyter kernel."""
def is_enabled(self, *, logger=HELIUM_LOGGER): # type: (...) -> bool
try:
kernel = ViewManager.get_kernel_for_view(self.view.buffer_id())
except KeyError:
return False
return HeliumKernelManager.get_kernel(kernel.kernel_id).is_alive()
def is_visible(self, *, logger=HELIUM_LOGGER): # type: (...) -> bool
return self.is_enabled()
def run(self, edit, *, logger=HELIUM_LOGGER): # type: (...) -> None
"""Command definition."""
_shutdown_kernel(sublime.active_window(), self.view, logger=logger)
class HeliumRunCellManager(ViewEventListener):
"""Manage 'Run cell' phantoms."""
def __init__(self, view: sublime.View): # type: (...) -> None
self.view = view
self.timeout_scheduled = False
self.needs_update = False
def on_modified(self, *, logger=HELIUM_LOGGER): # type: (...) -> None
try:
kernel = ViewManager.get_kernel_for_view(self.view.buffer_id())
if not kernel.is_alive():
return
except KeyError:
return
# Call update_run_cell_phantoms(), but not any more than 10 times a second
if self.timeout_scheduled:
self.needs_update = True
else:
sublime.set_timeout(lambda: self.handle_timeout(), 100)
self.timeout_scheduled = True
update_run_cell_phantoms(self.view, logger=logger)
def handle_timeout(self): # type: (...) -> None
self.timeout_scheduled = False
if self.needs_update:
self.needs_update = False
update_run_cell_phantoms(self.view)
def update_run_cell_phantoms(view: sublime.View, *, logger=HELIUM_LOGGER):
"""Add "Run Cell" links to each code cell."""
# find all cell delimiters:
cell_delimiter_pattern = sublime.load_settings("Helium.sublime-settings").get(
"cell_delimiter_pattern"
)
limits = view.find_all(cell_delimiter_pattern)
# append a virtual delimiter at EOF
limits.append(sublime.Region(view.size(), view.size()))
# remove existing Run cell phantoms, we'll recreate all of them
view.erase_phantoms(RUN_CELL_PHANTOM_ID)
for i in range(len(limits) - 1):
code_region = sublime.Region(limits[i].end() + 1, limits[i + 1].begin() + 0)
phantom_region = sublime.Region(limits[i].end(), limits[i].end())
view.add_phantom(
RUN_CELL_PHANTOM_ID,
phantom_region,
RUN_CELL_PHANTOM,
sublime.LAYOUT_INLINE,
on_navigate=lambda href, view=view, region=code_region: _execute_cell(
view, region
),
)
def get_line(view: sublime.View, row: int): # type: (...) -> str
"""Get the code line under the cursor."""
point = view.text_point(row, 0)
line_region = view.line(point)
return view.substr(line_region)
def get_indent(view: sublime.View, row: int): # type: (...) -> str
line = get_line(view, row)
# TODO: Fix this, it will raise if not matching
return INDENT_PATTERN.match(line).group() # type: ignore
def get_block(
view: sublime.View, s: sublime.Region
): # type: (...) -> Tuple[str, sublime.Region]
"""Get the code block under the cursor.
The code block is the lines satisfying the following conditions:
- Includes the line under the cursor.
- Includes no blank line.
- More indented than that of the line under the cursor.
If `s` is a selected region, the code block is it.
"""
if not s.empty():
return (view.substr(s), s)
view_end_row = view.rowcol(view.size())[0]
current_row = view.rowcol(s.begin())[0]
current_indent = get_indent(view, current_row)
start_point = 0
for first_row in range(current_row, -1, -1):
indent = get_indent(view, first_row)
if (
not indent.startswith(current_indent)
or get_line(view, first_row).strip() == ""
):
start_point = view.text_point(first_row + 1, 0)
break
end_point = view.size()
for last_row in range(current_row, view_end_row + 1):
indent = get_indent(view, last_row)
if (
not indent.startswith(current_indent)
or get_line(view, last_row).strip() == ""
):
end_point = view.text_point(last_row, 0) - 1
break
block_region = sublime.Region(start_point, end_point)
return (view.substr(block_region), block_region)
def get_cell(
view: sublime.View, region: sublime.Region, *, logger=HELIUM_LOGGER
): # type: (...) -> Tuple[str, sublime.Region]
"""Get the code cell under the cursor.
Cells are separated by markers.
Those are defined in `cell_delimiter_pattern` in the config file.
If `s` is a selected region, the code cell is it.
"""
if not region.empty():
return (view.substr(region), region)
cell_delimiter_pattern = sublime.load_settings("Helium.sublime-settings").get(
"cell_delimiter_pattern"
)
separators = view.find_all(cell_delimiter_pattern)
separators.append(sublime.Region(view.size() + 1, view.size() + 1))
r = sublime.Region(region.begin(), region.begin())
start_point = separators[bisect.bisect(separators, r) - 1].end() + 1
end_point = separators[bisect.bisect(separators, r)].begin() - 1
cell_region = sublime.Region(start_point, end_point)
return (view.substr(cell_region), cell_region)
@chain_callbacks
def _execute_block(
view: sublime.View, *, logger=HELIUM_LOGGER
): # type: (...) -> Generator
try:
kernel = ViewManager.get_kernel_for_view(view.buffer_id())
except KeyError:
sublime.message_dialog("No kernel is connected to this view.")
yield lambda cb: _connect_kernel(sublime.active_window(), view, continue_cb=cb)
kernel = ViewManager.get_kernel_for_view(view.buffer_id())
pre_code = ""
for s in view.sel():
code, region = get_block(view, s)
if code == pre_code:
continue
kernel.execute_code(code, region, view)
log_info_msg = "Executed code {code} with kernel {kernel_id}".format(
code=code, kernel_id=kernel.kernel_id
)
logger.info(log_info_msg)
pre_code = code
@chain_callbacks
def _execute_cell(
view: sublime.View, region: sublime.Region, *, logger=HELIUM_LOGGER
): # type: (...) -> Generator
try:
kernel = ViewManager.get_kernel_for_view(view.buffer_id())
except KeyError:
sublime.message_dialog("No kernel is connected to this view.")
yield lambda cb: _connect_kernel(sublime.active_window(), view, continue_cb=cb)
kernel = ViewManager.get_kernel_for_view(view.buffer_id())
code, cell = get_cell(view, region, logger=logger)
kernel.execute_code(code, cell, view)
log_info_msg = "Executed code {code} with kernel {kernel_id}".format(
code=code, kernel_id=kernel.kernel_id
)
logger.info(log_info_msg)
class HeliumExecuteBlock(TextCommand):
"""Execute code."""
def is_enabled(self, *, logger=HELIUM_LOGGER): # type: (...) -> bool
try:
kernel = ViewManager.get_kernel_for_view(self.view.buffer_id())
except KeyError:
return False
return HeliumKernelManager.get_kernel(kernel.kernel_id).is_alive()
def is_visible(self, *, logger=HELIUM_LOGGER): # type: (...) -> bool
return self.is_enabled()
def run(self, edit, *, logger=HELIUM_LOGGER): # type: (...) -> None
"""Command definition."""
_execute_block(self.view, logger=logger)
class HeliumExecuteCell(TextCommand):
"""Execute code cell."""
def is_enabled(self, *, logger=HELIUM_LOGGER): # type: (...) -> bool
try:
kernel = ViewManager.get_kernel_for_view(self.view.buffer_id())
except KeyError:
return False
return kernel.is_alive()
def is_visible(self, *, logger=HELIUM_LOGGER): # type: (...) -> bool
return self.is_enabled()
def run(
self, edit, move_cursor: bool = False, *, logger=HELIUM_LOGGER
): # type: (...) -> None
"""If move_cursor is true, move the cursor to the next cell after execution."""
for s in self.view.sel():
_execute_cell(self.view, s, logger=logger)
if move_cursor:
_, cell = get_cell(self.view, self.view.sel()[-1], logger=logger)
pt = sublime.Region(cell.end() + 1, cell.end() + 1)
self.view.sel().clear()
self.view.sel().add(pt)
# TODO: scroll to cursor after phantoms after Jupyter callback
# rather than fixed time
sublime.set_timeout(lambda: self.view.show(pt), 500)
class StatusBar(object):
"""Status Bar with animation.
This class is based on the one by @randy3k.
"""
def __init__(
self, view: sublime.View, width: int = 10, interval: int = 500
): # type: (...) -> None
self.view = view
self.buffer_id = view.buffer_id()
self.indicator = sublime_lib.ActivityIndicator(self.view)
self.interval = interval
try:
self.kernel = ViewManager.get_kernel_for_view(self.buffer_id)
self.start()
except KeyError:
# When view is not connected.
self.stop()
def start(self): # type: (...) -> None
self.update()
def stop(self): # type: (...) -> None
self.view.set_status(HELIUM_STATUS_KEY, "")
def update(self, ticks: int = 0): # type: (...) -> None
# `ticks` can't be a property of `StatusBar` because it's not updated
# when `update()` is called by `sublime.set_timeout[_async]()`.
if self.buffer_id != sublime.active_window().active_view().buffer_id():
# Stop when view is unfocused.
self.stop()
elif self.kernel.execution_state is ExecState.BUSY:
# Tick indicator if still busy
self.indicator.label = "{}: Busy".format(self.kernel.repr)
status = self.indicator.render(ticks)
self.view.set_status(HELIUM_STATUS_KEY, status)
sublime.set_timeout_async(lambda: self.update(ticks + 1), self.interval)
else:
# Stop when kernel is not busy anymore.
self.stop()
class HeliumStatusUpdater(ViewEventListener):
"""Listen to the heartbeat of kernel and update status of view."""
def on_activated_async(self): # type: (...) -> None
sublime.set_timeout_async(lambda: StatusBar(self.view), 0)
class HeliumGetObjectInspection(TextCommand):
"""Get object inspection."""
def is_enabled(self, *, logger=HELIUM_LOGGER): # type: (...) -> bool
try:
kernel = ViewManager.get_kernel_for_view(self.view.buffer_id())
except KeyError:
return False
return HeliumKernelManager.get_kernel(kernel.kernel_id).is_alive()
def is_visible(self, *, logger=HELIUM_LOGGER): # type: (...) -> bool
return self.is_enabled()
@chain_callbacks
def run(self, edit, *, logger=HELIUM_LOGGER):
view = self.view
try:
kernel = ViewManager.get_kernel_for_view(view.buffer_id())
except KeyError:
sublime.message_dialog("No kernel is connected to this view.")
yield lambda cb: _connect_kernel(
sublime.active_window(), view, continue_cb=cb
)
kernel = ViewManager.get_kernel_for_view(view.buffer_id())
pre_code = []
for s in view.sel():
code, region = get_block(view, s)
cursor_pos = s.end() - region.begin()
if code == pre_code:
continue
kernel.get_inspection(code, cursor_pos)
log_info_msg = (
"Requested object inspection for code {code} with kernel {kernel_id}"
).format(code=code, kernel_id=kernel.kernel_id)
logger.info(log_info_msg)
pre_code = code
class HeliumCompleter(EventListener):
"""Completer."""
def on_query_completions(
self,
view: sublime.View,
prefix: str,
locations: List[int],
*,
logger=HELIUM_LOGGER
):
"""Get completions from the Jupyter kernel."""
use_complete = sublime.load_settings("Helium.sublime-settings").get("complete")
if not use_complete:
return None
timeout = sublime.load_settings("Helium.sublime-settings").get(
"complete_timeout"
)
try:
kernel = ViewManager.get_kernel_for_view(view.buffer_id())
location = locations[0]
code = view.substr(view.line(location))
log_info_msg = (
"Requested completion for code {code} with kernel {kernel_id}"
).format(code=code, kernel_id=kernel.kernel_id)
logger.info(log_info_msg)
_, col = view.rowcol(location)
return kernel.get_complete(code, col, timeout)
except Exception: # TODO: Use specific exception
return None
| {
"pile_set_name": "Github"
} |
FROM balenalib/armv7hf-alpine:3.10-run
LABEL io.balena.device-type="odroid-ux3"
RUN apk add --update \
less \
nano \
net-tools \
ifupdown \
usbutils \
gnupg \
&& rm -rf /var/cache/apk/*
RUN [ ! -d /.balena/messages ] && mkdir -p /.balena/messages; echo $'Here are a few details about this Docker image (For more information please visit https://www.balena.io/docs/reference/base-images/base-images/): \nArchitecture: ARM v7 \nOS: Alpine Linux 3.10 \nVariant: run variant \nDefault variable(s): UDEV=off \nExtra features: \n- Easy way to install packages with `install_packages <package-name>` command \n- Run anywhere with cross-build feature (for ARM only) \n- Keep the container idling with `balena-idle` command \n- Show base image details with `balena-info` command' > /.balena/messages/image-info
RUN echo $'#!/bin/bash\nbalena-info\nbusybox ln -sf /bin/busybox /bin/sh\n/bin/sh "$@"' > /bin/sh-shim \
&& chmod +x /bin/sh-shim \
&& ln -f /bin/sh /bin/sh.real \
&& ln -f /bin/sh-shim /bin/sh | {
"pile_set_name": "Github"
} |
# Owner
weicheng
# Author
weicheng
# Reviewer
| {
"pile_set_name": "Github"
} |
/**
* $Id$
* Copyright (C) 2008 - 2014 Nils Asmussen
*
* 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. 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include <esc/proto/nic.h>
#include <esc/proto/socket.h>
#include <esc/stream/std.h>
using namespace esc;
struct EthernetHeader {
NIC::MAC dst;
NIC::MAC src;
uint16_t type;
};
int main() {
ulong buffer[1024];
Socket sock(Socket::SOCK_RAW_ETHER,Socket::PROTO_ANY);
while(1) {
esc::Socket::Addr addr;
size_t res = sock.recvfrom(addr,buffer,sizeof(buffer));
EthernetHeader *ether = reinterpret_cast<EthernetHeader*>(buffer);
esc::sout << "Got packet:\n";
esc::sout << " src = " << ether->src << "\n";
esc::sout << " dst = " << ether->dst << "\n";
esc::sout << " type = " << ether->type << "\n";
esc::sout << " len = " << res << "\n\n";
esc::sout.flush();
}
return 0;
}
| {
"pile_set_name": "Github"
} |
// Jest Snapshot v1, https://goo.gl/fbAQLP
exports[`create goes through all steps 1`] = `
Object {
"name": "random-name",
"path": "/path/to/project",
"theme": "@frontity/mars-theme",
}
`;
exports[`create goes through all steps 2`] = `
Array [
Array [
"/path/to/project",
],
]
`;
exports[`create goes through all steps 3`] = `
Array [
Array [
"random-name",
"@frontity/mars-theme",
"/path/to/project",
],
]
`;
exports[`create goes through all steps 4`] = `
Array [
Array [
"js",
"random-name",
"/path/to/project",
"@frontity/mars-theme",
],
]
`;
exports[`create goes through all steps 5`] = `
Array [
Array [
"@frontity/mars-theme",
"/path/to/project",
],
]
`;
exports[`create goes through all steps 6`] = `
Array [
Array [
"/path/to/project",
],
]
`;
exports[`create uses the emitter passed to log messages 1`] = `Array []`;
| {
"pile_set_name": "Github"
} |
<!DOCTYPE html>
<html>
<input type=range orient=vertical max=100 value=70 dir=rtl>
| {
"pile_set_name": "Github"
} |
package aws
import "time"
// String returns a pointer to the string value passed in.
func String(v string) *string {
return &v
}
// StringValue returns the value of the string pointer passed in or
// "" if the pointer is nil.
func StringValue(v *string) string {
if v != nil {
return *v
}
return ""
}
// StringSlice converts a slice of string values into a slice of
// string pointers
func StringSlice(src []string) []*string {
dst := make([]*string, len(src))
for i := 0; i < len(src); i++ {
dst[i] = &(src[i])
}
return dst
}
// StringValueSlice converts a slice of string pointers into a slice of
// string values
func StringValueSlice(src []*string) []string {
dst := make([]string, len(src))
for i := 0; i < len(src); i++ {
if src[i] != nil {
dst[i] = *(src[i])
}
}
return dst
}
// StringMap converts a string map of string values into a string
// map of string pointers
func StringMap(src map[string]string) map[string]*string {
dst := make(map[string]*string)
for k, val := range src {
v := val
dst[k] = &v
}
return dst
}
// StringValueMap converts a string map of string pointers into a string
// map of string values
func StringValueMap(src map[string]*string) map[string]string {
dst := make(map[string]string)
for k, val := range src {
if val != nil {
dst[k] = *val
}
}
return dst
}
// Bool returns a pointer to the bool value passed in.
func Bool(v bool) *bool {
return &v
}
// BoolValue returns the value of the bool pointer passed in or
// false if the pointer is nil.
func BoolValue(v *bool) bool {
if v != nil {
return *v
}
return false
}
// BoolSlice converts a slice of bool values into a slice of
// bool pointers
func BoolSlice(src []bool) []*bool {
dst := make([]*bool, len(src))
for i := 0; i < len(src); i++ {
dst[i] = &(src[i])
}
return dst
}
// BoolValueSlice converts a slice of bool pointers into a slice of
// bool values
func BoolValueSlice(src []*bool) []bool {
dst := make([]bool, len(src))
for i := 0; i < len(src); i++ {
if src[i] != nil {
dst[i] = *(src[i])
}
}
return dst
}
// BoolMap converts a string map of bool values into a string
// map of bool pointers
func BoolMap(src map[string]bool) map[string]*bool {
dst := make(map[string]*bool)
for k, val := range src {
v := val
dst[k] = &v
}
return dst
}
// BoolValueMap converts a string map of bool pointers into a string
// map of bool values
func BoolValueMap(src map[string]*bool) map[string]bool {
dst := make(map[string]bool)
for k, val := range src {
if val != nil {
dst[k] = *val
}
}
return dst
}
// Int returns a pointer to the int value passed in.
func Int(v int) *int {
return &v
}
// IntValue returns the value of the int pointer passed in or
// 0 if the pointer is nil.
func IntValue(v *int) int {
if v != nil {
return *v
}
return 0
}
// IntSlice converts a slice of int values into a slice of
// int pointers
func IntSlice(src []int) []*int {
dst := make([]*int, len(src))
for i := 0; i < len(src); i++ {
dst[i] = &(src[i])
}
return dst
}
// IntValueSlice converts a slice of int pointers into a slice of
// int values
func IntValueSlice(src []*int) []int {
dst := make([]int, len(src))
for i := 0; i < len(src); i++ {
if src[i] != nil {
dst[i] = *(src[i])
}
}
return dst
}
// IntMap converts a string map of int values into a string
// map of int pointers
func IntMap(src map[string]int) map[string]*int {
dst := make(map[string]*int)
for k, val := range src {
v := val
dst[k] = &v
}
return dst
}
// IntValueMap converts a string map of int pointers into a string
// map of int values
func IntValueMap(src map[string]*int) map[string]int {
dst := make(map[string]int)
for k, val := range src {
if val != nil {
dst[k] = *val
}
}
return dst
}
// Int64 returns a pointer to the int64 value passed in.
func Int64(v int64) *int64 {
return &v
}
// Int64Value returns the value of the int64 pointer passed in or
// 0 if the pointer is nil.
func Int64Value(v *int64) int64 {
if v != nil {
return *v
}
return 0
}
// Int64Slice converts a slice of int64 values into a slice of
// int64 pointers
func Int64Slice(src []int64) []*int64 {
dst := make([]*int64, len(src))
for i := 0; i < len(src); i++ {
dst[i] = &(src[i])
}
return dst
}
// Int64ValueSlice converts a slice of int64 pointers into a slice of
// int64 values
func Int64ValueSlice(src []*int64) []int64 {
dst := make([]int64, len(src))
for i := 0; i < len(src); i++ {
if src[i] != nil {
dst[i] = *(src[i])
}
}
return dst
}
// Int64Map converts a string map of int64 values into a string
// map of int64 pointers
func Int64Map(src map[string]int64) map[string]*int64 {
dst := make(map[string]*int64)
for k, val := range src {
v := val
dst[k] = &v
}
return dst
}
// Int64ValueMap converts a string map of int64 pointers into a string
// map of int64 values
func Int64ValueMap(src map[string]*int64) map[string]int64 {
dst := make(map[string]int64)
for k, val := range src {
if val != nil {
dst[k] = *val
}
}
return dst
}
// Float64 returns a pointer to the float64 value passed in.
func Float64(v float64) *float64 {
return &v
}
// Float64Value returns the value of the float64 pointer passed in or
// 0 if the pointer is nil.
func Float64Value(v *float64) float64 {
if v != nil {
return *v
}
return 0
}
// Float64Slice converts a slice of float64 values into a slice of
// float64 pointers
func Float64Slice(src []float64) []*float64 {
dst := make([]*float64, len(src))
for i := 0; i < len(src); i++ {
dst[i] = &(src[i])
}
return dst
}
// Float64ValueSlice converts a slice of float64 pointers into a slice of
// float64 values
func Float64ValueSlice(src []*float64) []float64 {
dst := make([]float64, len(src))
for i := 0; i < len(src); i++ {
if src[i] != nil {
dst[i] = *(src[i])
}
}
return dst
}
// Float64Map converts a string map of float64 values into a string
// map of float64 pointers
func Float64Map(src map[string]float64) map[string]*float64 {
dst := make(map[string]*float64)
for k, val := range src {
v := val
dst[k] = &v
}
return dst
}
// Float64ValueMap converts a string map of float64 pointers into a string
// map of float64 values
func Float64ValueMap(src map[string]*float64) map[string]float64 {
dst := make(map[string]float64)
for k, val := range src {
if val != nil {
dst[k] = *val
}
}
return dst
}
// Time returns a pointer to the time.Time value passed in.
func Time(v time.Time) *time.Time {
return &v
}
// TimeValue returns the value of the time.Time pointer passed in or
// time.Time{} if the pointer is nil.
func TimeValue(v *time.Time) time.Time {
if v != nil {
return *v
}
return time.Time{}
}
// TimeUnixMilli returns a Unix timestamp in milliseconds from "January 1, 1970 UTC".
// The result is undefined if the Unix time cannot be represented by an int64.
// Which includes calling TimeUnixMilli on a zero Time is undefined.
//
// This utility is useful for service API's such as CloudWatch Logs which require
// their unix time values to be in milliseconds.
//
// See Go stdlib https://golang.org/pkg/time/#Time.UnixNano for more information.
func TimeUnixMilli(t time.Time) int64 {
return t.UnixNano() / int64(time.Millisecond/time.Nanosecond)
}
// TimeSlice converts a slice of time.Time values into a slice of
// time.Time pointers
func TimeSlice(src []time.Time) []*time.Time {
dst := make([]*time.Time, len(src))
for i := 0; i < len(src); i++ {
dst[i] = &(src[i])
}
return dst
}
// TimeValueSlice converts a slice of time.Time pointers into a slice of
// time.Time values
func TimeValueSlice(src []*time.Time) []time.Time {
dst := make([]time.Time, len(src))
for i := 0; i < len(src); i++ {
if src[i] != nil {
dst[i] = *(src[i])
}
}
return dst
}
// TimeMap converts a string map of time.Time values into a string
// map of time.Time pointers
func TimeMap(src map[string]time.Time) map[string]*time.Time {
dst := make(map[string]*time.Time)
for k, val := range src {
v := val
dst[k] = &v
}
return dst
}
// TimeValueMap converts a string map of time.Time pointers into a string
// map of time.Time values
func TimeValueMap(src map[string]*time.Time) map[string]time.Time {
dst := make(map[string]time.Time)
for k, val := range src {
if val != nil {
dst[k] = *val
}
}
return dst
}
| {
"pile_set_name": "Github"
} |
<?php
/*
* This file is part of the Symfony package.
*
* (c) Fabien Potencier <[email protected]>
*
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*/
namespace Symfony\Component\HttpKernel\Controller\ArgumentResolver;
use Symfony\Component\HttpFoundation\Request;
use Symfony\Component\HttpKernel\Controller\ArgumentValueResolverInterface;
use Symfony\Component\HttpKernel\ControllerMetadata\ArgumentMetadata;
use Symfony\Component\Stopwatch\Stopwatch;
/**
* Provides timing information via the stopwatch.
*
* @author Iltar van der Berg <[email protected]>
*/
final class TraceableValueResolver implements ArgumentValueResolverInterface
{
private $inner;
private $stopwatch;
public function __construct(ArgumentValueResolverInterface $inner, Stopwatch $stopwatch)
{
$this->inner = $inner;
$this->stopwatch = $stopwatch;
}
/**
* {@inheritdoc}
*/
public function supports(Request $request, ArgumentMetadata $argument): bool
{
$method = \get_class($this->inner).'::'.__FUNCTION__;
$this->stopwatch->start($method, 'controller.argument_value_resolver');
$return = $this->inner->supports($request, $argument);
$this->stopwatch->stop($method);
return $return;
}
/**
* {@inheritdoc}
*/
public function resolve(Request $request, ArgumentMetadata $argument): iterable
{
$method = \get_class($this->inner).'::'.__FUNCTION__;
$this->stopwatch->start($method, 'controller.argument_value_resolver');
yield from $this->inner->resolve($request, $argument);
$this->stopwatch->stop($method);
}
}
| {
"pile_set_name": "Github"
} |
<html>
<body>
<div class="default" id="success">
static page
</div>
</body>
</html>
| {
"pile_set_name": "Github"
} |
/*******************************************************************************
* Copyright (c) 2012, 2016 Red Hat Inc. and others.
*
* This program and the accompanying materials
* are made available under the terms of the Eclipse Public License 2.0
* which accompanies this distribution, and is available at
* https://www.eclipse.org/legal/epl-2.0/
*
* SPDX-License-Identifier: EPL-2.0
*******************************************************************************/
package org.eclipse.cdt.autotools.core;
/**
* @since 1.2
*/
public class AutotoolsOptionConstants {
// IAutotoolOption Names
public static final String TOOL_CONFIGURE = "configure"; //$NON-NLS-1$
public static final String CATEGORY_GENERAL = "general"; //$NON-NLS-1$
public static final String OPT_CONFIGDIR = "configdir"; //$NON-NLS-1$
public static final String OPT_CACHE_FILE = "cache-file"; //$NON-NLS-1$
public static final String OPT_HELP = "help"; //$NON-NLS-1$
public static final String OPT_NO_CREATE = "no-create"; //$NON-NLS-1$
public static final String OPT_QUIET = "quiet"; //$NON-NLS-1$
public static final String OPT_VERSION = "version"; //$NON-NLS-1$
public static final String CATEGORY_PLATFORM = "platform"; //$NON-NLS-1$
public static final String OPT_HOST = "host"; //$NON-NLS-1$
public static final String OPT_BUILD = "build"; //$NON-NLS-1$
public static final String OPT_TARGET = "target"; //$NON-NLS-1$
public static final String CATEGORY_DIRECTORIES = "directories"; //$NON-NLS-1$
public static final String OPT_PREFIX = "prefix"; //$NON-NLS-1$
public static final String OPT_EXEC_PREFIX = "exec-prefix"; //$NON-NLS-1$
public static final String OPT_LIBDIR = "libdir"; //$NON-NLS-1$
public static final String OPT_BINDIR = "bindir"; //$NON-NLS-1$
public static final String OPT_SBINDIR = "sbindir"; //$NON-NLS-1$
public static final String OPT_INCLUDEDIR = "includedir"; //$NON-NLS-1$
public static final String OPT_DATADIR = "datadir"; //$NON-NLS-1$
public static final String OPT_SYSCONFDIR = "sysconfdir"; //$NON-NLS-1$
public static final String OPT_INFODIR = "infodir"; //$NON-NLS-1$
public static final String OPT_MANDIR = "mandir"; //$NON-NLS-1$
public static final String OPT_SRCDIR = "srcdir"; //$NON-NLS-1$
public static final String OPT_LOCALSTATEDIR = "localstatedir"; //$NON-NLS-1$
public static final String OPT_SHAREDSTATEDIR = "sharedstatedir"; //$NON-NLS-1$
public static final String OPT_LIBEXECDIR = "libexecdir"; //$NON-NLS-1$
public static final String OPT_OLDINCLUDEDIR = "oldincludedir"; //$NON-NLS-1$
public static final String CATEGORY_FILENAMES = "filenames"; //$NON-NLS-1$
public static final String OPT_PROGRAM_PREFIX = "program-prefix"; //$NON-NLS-1$
public static final String OPT_PROGRAM_SUFFIX = "program-suffix"; //$NON-NLS-1$
public static final String OPT_PROGRAM_TRANSFORM_NAME = "program-transform-name"; //$NON-NLS-1$
public static final String CATEGORY_FEATURES = "features"; //$NON-NLS-1$
public static final String OPT_ENABLE_MAINTAINER_MODE = "enable-maintainer-mode"; //$NON-NLS-1$
public static final String FLAG_CFLAGS = "CFLAGS"; //$NON-NLS-1$
/**
* @since 1.4
*/
public static final String FLAG_CFLAGS_FLAGS = "CFLAGS|CXXFLAGS"; //$NON-NLS-1$
public static final String OPT_CFLAGS_DEBUG = "cflags-debug"; //$NON-NLS-1$
public static final String OPT_CFLAGS_GPROF = "cflags-gprof"; //$NON-NLS-1$
public static final String OPT_CFLAGS_GCOV = "cflags-gcov"; //$NON-NLS-1$
public static final String OPT_USER = "user"; //$NON-NLS-1$
public static final String TOOL_AUTOGEN = "autogen"; //$NON-NLS-1$
public static final String CATEGORY_OPTIONS = "options"; //$NON-NLS-1$
public static final String OPT_AUTOGENOPTS = "autogenOpts"; //$NON-NLS-1$
/**
* @since 2.0
*/
public static final String CATEGORY_ENVVAR = "cat_envvar"; //$NON-NLS-1$
/**
* @since 2.0
*/
public final static String OPT_ENVVAR = "env_vars"; //$NON-NLS-1$
}
| {
"pile_set_name": "Github"
} |
// Boost.Geometry (aka GGL, Generic Geometry Library)
// Copyright (c) 2014, Oracle and/or its affiliates.
// Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
// Licensed under the Boost Software License version 1.0.
// http://www.boost.org/users/license.html
#ifndef BOOST_GEOMETRY_ITERATORS_SEGMENT_ITERATOR_HPP
#define BOOST_GEOMETRY_ITERATORS_SEGMENT_ITERATOR_HPP
#include <boost/mpl/assert.hpp>
#include <boost/type_traits/is_convertible.hpp>
#include <boost/range.hpp>
#include <boost/geometry/core/exterior_ring.hpp>
#include <boost/geometry/core/interior_rings.hpp>
#include <boost/geometry/core/tags.hpp>
#include <boost/geometry/iterators/detail/point_iterator/inner_range_type.hpp>
#include <boost/geometry/iterators/detail/segment_iterator/iterator_type.hpp>
#include <boost/geometry/iterators/dispatch/segment_iterator.hpp>
namespace boost { namespace geometry
{
#ifndef DOXYGEN_NO_DISPATCH
namespace dispatch
{
// specializations for segments_begin
template <typename Linestring>
struct segments_begin<Linestring, linestring_tag>
{
typedef typename detail::segment_iterator::iterator_type
<
Linestring
>::type return_type;
static inline return_type apply(Linestring& linestring)
{
return return_type(linestring);
}
};
template <typename Ring>
struct segments_begin<Ring, ring_tag>
{
typedef typename detail::segment_iterator::iterator_type
<
Ring
>::type return_type;
static inline return_type apply(Ring& ring)
{
return return_type(ring);
}
};
template <typename Polygon>
struct segments_begin<Polygon, polygon_tag>
{
typedef typename detail::point_iterator::inner_range_type
<
Polygon
>::type inner_range;
typedef typename detail::segment_iterator::iterator_type
<
Polygon
>::type return_type;
static inline return_type apply(Polygon& polygon)
{
typedef typename return_type::second_iterator_type flatten_iterator;
return return_type
(segments_begin
<
inner_range
>::apply(geometry::exterior_ring(polygon)),
segments_end
<
inner_range
>::apply(geometry::exterior_ring(polygon)),
flatten_iterator(boost::begin(geometry::interior_rings(polygon)),
boost::end(geometry::interior_rings(polygon))
),
flatten_iterator(boost::begin(geometry::interior_rings(polygon)),
boost::end(geometry::interior_rings(polygon))
)
);
}
};
template <typename MultiLinestring>
struct segments_begin<MultiLinestring, multi_linestring_tag>
{
typedef typename detail::segment_iterator::iterator_type
<
MultiLinestring
>::type return_type;
static inline return_type apply(MultiLinestring& multilinestring)
{
return return_type(boost::begin(multilinestring),
boost::end(multilinestring));
}
};
template <typename MultiPolygon>
struct segments_begin<MultiPolygon, multi_polygon_tag>
{
typedef typename detail::segment_iterator::iterator_type
<
MultiPolygon
>::type return_type;
static inline return_type apply(MultiPolygon& multipolygon)
{
return return_type(boost::begin(multipolygon),
boost::end(multipolygon));
}
};
} // namespace dispatch
#endif // DOXYGEN_NO_DISPATCH
#ifndef DOXYGEN_NO_DISPATCH
namespace dispatch
{
// specializations for segments_end
template <typename Linestring>
struct segments_end<Linestring, linestring_tag>
{
typedef typename detail::segment_iterator::iterator_type
<
Linestring
>::type return_type;
static inline return_type apply(Linestring& linestring)
{
return return_type(linestring, true);
}
};
template <typename Ring>
struct segments_end<Ring, ring_tag>
{
typedef typename detail::segment_iterator::iterator_type
<
Ring
>::type return_type;
static inline return_type apply(Ring& ring)
{
return return_type(ring, true);
}
};
template <typename Polygon>
struct segments_end<Polygon, polygon_tag>
{
typedef typename detail::point_iterator::inner_range_type
<
Polygon
>::type inner_range;
typedef typename detail::segment_iterator::iterator_type
<
Polygon
>::type return_type;
static inline return_type apply(Polygon& polygon)
{
typedef typename return_type::second_iterator_type flatten_iterator;
return return_type
(segments_end
<
inner_range
>::apply(geometry::exterior_ring(polygon)),
flatten_iterator(boost::begin(geometry::interior_rings(polygon)),
boost::end(geometry::interior_rings(polygon))
),
flatten_iterator( boost::end(geometry::interior_rings(polygon)) )
);
}
};
template <typename MultiLinestring>
struct segments_end<MultiLinestring, multi_linestring_tag>
{
typedef typename detail::segment_iterator::iterator_type
<
MultiLinestring
>::type return_type;
static inline return_type apply(MultiLinestring& multilinestring)
{
return return_type(boost::end(multilinestring));
}
};
template <typename MultiPolygon>
struct segments_end<MultiPolygon, multi_polygon_tag>
{
typedef typename detail::segment_iterator::iterator_type
<
MultiPolygon
>::type return_type;
static inline return_type apply(MultiPolygon& multipolygon)
{
return return_type(boost::end(multipolygon));
}
};
} // namespace dispatch
#endif // DOXYGEN_NO_DISPATCH
// MK:: need to add doc here
template <typename Geometry>
class segment_iterator
: public detail::segment_iterator::iterator_type<Geometry>::type
{
private:
typedef typename detail::segment_iterator::iterator_type
<
Geometry
>::type base;
inline base const* base_ptr() const
{
return this;
}
template <typename OtherGeometry> friend class segment_iterator;
template <typename G>
friend inline segment_iterator<G const> segments_begin(G const&);
template <typename G>
friend inline segment_iterator<G const> segments_end(G const&);
inline segment_iterator(base const& base_it) : base(base_it) {}
public:
// The following typedef is needed for this iterator to be
// bidirectional.
// Normally we would not have to define this. However, due to the
// fact that the value type of the iterator is not a reference,
// the iterator_facade framework (used to define the base class of
// this iterator) degrades automatically the iterator's category
// to input iterator. With the following typedef we recover the
// correct iterator category.
typedef std::bidirectional_iterator_tag iterator_category;
inline segment_iterator() {}
template <typename OtherGeometry>
inline segment_iterator(segment_iterator<OtherGeometry> const& other)
: base(*other.base_ptr())
{
static const bool is_conv
= boost::is_convertible<
typename detail::segment_iterator::iterator_type
<
OtherGeometry
>::type,
typename detail::segment_iterator::iterator_type<Geometry>::type
>::value;
BOOST_MPL_ASSERT_MSG((is_conv),
NOT_CONVERTIBLE,
(segment_iterator<OtherGeometry>));
}
inline segment_iterator& operator++() // prefix
{
base::operator++();
return *this;
}
inline segment_iterator& operator--() // prefix
{
base::operator--();
return *this;
}
inline segment_iterator operator++(int) // postfix
{
segment_iterator copy(*this);
base::operator++();
return copy;
}
inline segment_iterator operator--(int) // postfix
{
segment_iterator copy(*this);
base::operator--();
return copy;
}
};
// MK:: need to add doc here
template <typename Geometry>
inline segment_iterator<Geometry const>
segments_begin(Geometry const& geometry)
{
return dispatch::segments_begin<Geometry const>::apply(geometry);
}
// MK:: need to add doc here
template <typename Geometry>
inline segment_iterator<Geometry const>
segments_end(Geometry const& geometry)
{
return dispatch::segments_end<Geometry const>::apply(geometry);
}
}} // namespace boost::geometry
#endif // BOOST_GEOMETRY_ITERATORS_SEGMENT_ITERATOR_HPP
| {
"pile_set_name": "Github"
} |
/*
Description: Foundation 4 docs style for highlight.js
Author: Dan Allen <[email protected]>
Website: http://foundation.zurb.com/docs/
Version: 1.0
Date: 2013-04-02
*/
.hljs {
display: block; padding: 0.5em;
background: #eee;
}
.hljs-header,
.hljs-decorator,
.hljs-annotation {
color: #000077;
}
.hljs-horizontal_rule,
.hljs-link_url,
.hljs-emphasis,
.hljs-attribute {
color: #070;
}
.hljs-emphasis {
font-style: italic;
}
.hljs-link_label,
.hljs-strong,
.hljs-value,
.hljs-string,
.scss .hljs-value .hljs-string {
color: #d14;
}
.hljs-strong {
font-weight: bold;
}
.hljs-blockquote,
.hljs-comment {
color: #998;
font-style: italic;
}
.asciidoc .hljs-title,
.hljs-function .hljs-title {
color: #900;
}
.hljs-class {
color: #458;
}
.hljs-id,
.hljs-pseudo,
.hljs-constant,
.hljs-hexcolor {
color: teal;
}
.hljs-variable {
color: #336699;
}
.hljs-bullet,
.hljs-javadoc {
color: #997700;
}
.hljs-pi,
.hljs-doctype {
color: #3344bb;
}
.hljs-code,
.hljs-number {
color: #099;
}
.hljs-important {
color: #f00;
}
.smartquote,
.hljs-label {
color: #970;
}
.hljs-preprocessor,
.hljs-pragma {
color: #579;
}
.hljs-reserved,
.hljs-keyword,
.scss .hljs-value {
color: #000;
}
.hljs-regexp {
background-color: #fff0ff;
color: #880088;
}
.hljs-symbol {
color: #990073;
}
.hljs-symbol .hljs-string {
color: #a60;
}
.hljs-tag {
color: #007700;
}
.hljs-at_rule,
.hljs-at_rule .hljs-keyword {
color: #088;
}
.hljs-at_rule .hljs-preprocessor {
color: #808;
}
.scss .hljs-tag,
.scss .hljs-attribute {
color: #339;
}
| {
"pile_set_name": "Github"
} |
# How to build and run Cloud-hypervisor on AArch64
Cloud-hypervisor is partially enabled on AArch64 architecture.
Although all features are not ready yet, you can begin to test Cloud-hypervisor on a AArch64 host by following this guide.
## Prerequisites
On AArch64 machines, Cloud-hypervisor depends on an external library `libfdt-dev` for generating Flattened Device Tree (FDT).
The long-term plan is to replace `libfdt-dev` with some pure-Rust component to get rid of such dependency.
```bash
sudo apt-get update
sudo apt-get install libfdt-dev
```
## Build
For Virtio devices, you can choose MMIO or PCI as transport option.
### MMIO
```bash
cargo build --no-default-features --features mmio,kvm
```
### PCI
Using PCI devices requires GICv3-ITS for MSI messaging. GICv3-ITS is very common in modern servers, but your machine happen to be old ones with GICv2(M) (like Raspberry Pi 4) or GICv3 without ITS, MMIO can still work.
```bash
cargo build --no-default-features --features pci,kvm
```
## Image
Download kernel binary and rootfs image from AWS.
```bash
wget https://s3.amazonaws.com/spec.ccfc.min/img/aarch64/ubuntu_with_ssh/fsfiles/xenial.rootfs.ext4 -O rootfs.ext4
wget https://s3.amazonaws.com/spec.ccfc.min/img/aarch64/ubuntu_with_ssh/kernel/vmlinux.bin -O kernel.bin
```
## Containerized build
If you want to build and test Cloud Hypervisor without having to install all the required dependencies, you can also turn to the development script: dev_cli.sh.
To build the development container:
```bash
./scripts/dev_cli.sh build-container
```
To build Cloud-hypervisor in the container: (The default option for Virtio transport is MMIO.)
```bash
./scripts/dev_cli.sh build
```
## Run
Assuming you have built Cloud-hypervisor with the development container, a VM can be started with command:
```bash
sudo build/cargo_target/aarch64-unknown-linux-gnu/debug/cloud-hypervisor --kernel kernel.bin --disk path=rootfs.ext4 --cmdline "keep_bootcon console=hvc0 reboot=k panic=1 pci=off root=/dev/vda rw" --cpus boot=4 --memory size=512M --serial file=serial.log --log-file log.log -vvv
```
If the build was done out of the container, replace the binary path with `target/debug/cloud-hypervisor`.
| {
"pile_set_name": "Github"
} |
//
// NSString+CoreHttp.h
// CoreHttp
//
// Created by muxi on 15/3/2.
// Copyright (c) 2015年 muxi. All rights reserved.
//
#import <Foundation/Foundation.h>
@interface NSString (CoreHttp)
/**
* 处理json格式的字符串中的换行符、回车符
*/
-(NSString *)deleteSpecialCode;
@end
| {
"pile_set_name": "Github"
} |
Feature: Article
I need to be able list and get articles
Scenario: Get articles from gimme
When I send a GET request to "/articles"
Then the response code should be 200
And response should have "items" with elements
Scenario: Get single article from gimme
When I send a GET request to "/articles/65"
Then the response code should be 200
And response should have keys "number, title, updated, published, language, comments, webcode, type"
And response should have "fields" with elements
And response should have "authors" with elements | {
"pile_set_name": "Github"
} |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# Copyright 2008-2009 Zuza Software Foundation
# Copyright 2013 F Wolff
#
# This file is part of Virtaal.
#
# 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. 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/>.
from gtk import Builder
from virtaal.common import pan_app
#cache builders so that we don't parse files repeatedly
_builders = {}
class BaseView(object):
"""Interface for views."""
def __init__(self):
raise NotImplementedError('This interface cannot be instantiated.')
@classmethod
def load_builder_file(cls, path_parts, root=None, domain=''):
_id = "/".join(path_parts)
if _id in _builders:
return _builders[_id]
buildername = pan_app.get_abs_data_filename(path_parts)
builder = Builder()
builder.add_from_file(buildername)
builder.set_translation_domain(domain)
_builders[_id] = builder
return builder
def show(self):
raise NotImplementedError('This method needs to be implemented by all sub-classes.')
| {
"pile_set_name": "Github"
} |
#include "global.h"
#if defined(_WINDOWS)
# define _WIN32_WINDOWS 0x0410 // include Win98 stuff
# include "windows.h"
# include "archutils/Win32/Crash.h"
#elif defined(_XBOX)
#else
# include <unistd.h>
#endif
#if defined(CRASH_HANDLER) && (defined(LINUX) || defined(DARWIN))
#include "archutils/Unix/CrashHandler.h"
#endif
void NORETURN sm_crash( const char *reason )
{
#if defined(_WINDOWS)
/* If we're being debugged, throw a debug break so it'll suspend the process. */
if( IsDebuggerPresent() )
{
DebugBreak();
while(1); /* don't return */
}
#endif
#if defined(CRASH_HANDLER)
ForceCrashHandler( reason );
#else
*(char*)0=0;
/* This isn't actually reached. We just do this to convince the compiler that the
* function really doesn't return. */
while(1);
#endif
#if defined(_WINDOWS)
/* Do something after the above, so the call/return isn't optimized to a jmp; that
* way, this function will appear in backtrace stack traces. */
_asm nop;
#else
_exit( 1 );
#endif
}
/*
* (c) 2004 Glenn Maynard
* All rights reserved.
*
* 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, and/or sell copies of the Software, and to permit persons to
* whom the Software is furnished to do so, provided that the above
* copyright notice(s) and this permission notice appear in all copies of
* the Software and that both the above copyright notice(s) and this
* permission notice appear in supporting documentation.
*
* 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 OF
* THIRD PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS
* INCLUDED IN THIS NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL 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.
*/
| {
"pile_set_name": "Github"
} |
/*
* jQuery UI Autocomplete @VERSION
*
* Copyright (c) 2007, 2008 Dylan Verheul, Dan G. Switzer, Anjesh Tuladhar, Jörn Zaefferer
* Dual licensed under the MIT (MIT-LICENSE.txt)
* and GPL (GPL-LICENSE.txt) licenses.
*
* http://docs.jquery.com/UI/Autocomplete
*
* Depends:
* ui.core.js
*/
(function($) {
$.widget("ui.rbautocomplete", {
options: {
inputClass: "ui-autocomplete-input",
resultsClass: "ui-autocomplete-results",
loadingClass: "ui-autocomplete-loading",
resultsParentEl: document.body,
minChars: 1,
ajaxDelay: 400,
localDelay: 10,
matchCase: false,
matchSubset: true,
matchContains: false,
cacheLength: 10,
scrollMax: 150,
noScrollMax: 10,
mustMatch: false,
extraParams: {},
selectFirst: true,
formatItem: function(row) { return row[0]; },
formatMatch: null,
autoFill: false,
width: 0,
multiple: false,
multipleSeparator: ", ",
highlight: function(value, term) {
return value.replace(new RegExp("(?![^&;]+;)(?!<[^<>]*)(" + term.replace(/([\^\$\(\)\[\]\{\}\*\.\+\?\|\\])/gi, "\\$1") + ")(?![^<>]*>)(?![^&;]+;)", "gi"), "<strong>$1</strong>");
},
scroll: true,
clickToURL: false,
enterToURL: false,
scrollHeight: 180
},
_init: function() {
$.extend(this.options, {
delay: this.options.delay != undefined ? this.options.delay : (this.options.url? this.options.ajaxDelay : this.options.localDelay),
max: this.options.max != undefined ? this.options.max : (this.options.scroll? this.options.scrollMax : this.options.noScrollMax),
highlight: this.options.highlight || function(value) { return value; }, // if highlight is set to false, replace it with a do-nothing function
formatMatch: this.options.formatMatch || this.options.formatItem // if the formatMatch option is not specified, then use formatItem for backwards compatibility
});
var input = this.element[0],
options = this.options,
// Create $ object for input element
$input = $(input).attr("autocomplete", "off").addClass(options.inputClass),
KEY = $.ui.keyCode,
previousValue = "",
cache = $.ui.rbautocomplete.cache(options),
hasFocus = 0,
config = {
mouseDownOnSelect: false
},
timeout,
blockSubmit,
lastKeyPressCode,
select = $.ui.rbautocomplete.select(options, input, selectCurrent, config);
if(options.result) {
$input.bind('result.rbautocomplete', options.result);
}
$input.bind('keydown.rbautocomplete', function(event) {
// track last key pressed
lastKeyPressCode = event.keyCode;
switch(event.keyCode) {
case KEY.UP:
event.preventDefault();
if ( select.visible() ) {
select.prev();
} else {
onChange(0, true);
}
break;
case KEY.DOWN:
event.preventDefault();
if ( select.visible() ) {
select.next();
} else {
onChange(0, true);
}
break;
case KEY.PAGE_UP:
event.preventDefault();
if ( select.visible() ) {
select.pageUp();
} else {
onChange(0, true);
}
break;
case KEY.PAGE_DOWN:
event.preventDefault();
if ( select.visible() ) {
select.pageDown();
} else {
onChange(0, true);
}
break;
// matches also semicolon
case options.multiple && $.trim(options.multipleSeparator) == "," && KEY.COMMA:
case KEY.TAB:
case KEY.ENTER:
if (options.enterToURL && select.current()){
select.current().click();
}
if( selectCurrent() ) {
// stop default to prevent a form submit, Opera needs special handling
event.preventDefault();
blockSubmit = true;
return false;
}
break;
case KEY.ESCAPE:
select.hide();
break;
default:
clearTimeout(timeout);
timeout = setTimeout(onChange, options.delay);
break;
}
}).focus(function(){
// track whether the field has focus, we shouldn't process any
// results if the field no longer has focus
hasFocus++;
}).blur(function() {
hasFocus = 0;
if (!config.mouseDownOnSelect) {
hideResults();
}
}).click(function() {
// show select when clicking in a focused field
if ( hasFocus++ > 1 && !select.visible() ) {
onChange(0, true);
}
}).bind("search", function() {
// TODO why not just specifying both arguments?
var fn = (arguments.length > 1) ? arguments[1] : null;
function findValueCallback(q, data) {
var result;
if( data && data.length ) {
for (var i=0; i < data.length; i++) {
if( data[i].result.toLowerCase() == q.toLowerCase() ) {
result = data[i];
break;
}
}
}
if( typeof fn == "function" ) fn(result);
else $input.trigger("result", result && [result.data, result.value]);
}
$.each(trimWords($input.val()), function(i, value) {
request(value, findValueCallback, findValueCallback);
});
}).bind("flushCache", function() {
cache.flush();
}).bind("setOptions", function() {
$.extend(options, arguments[1]);
// if we've updated the data, repopulate
if ( "data" in arguments[1] )
cache.populate();
}).bind("unautocomplete", function() {
select.unbind();
$input.unbind();
$(input.form).unbind(".rbautocomplete");
});
// Private methods
function selectCurrent() {
var selected = select.selected();
if ( !selected || !matchCurrent(selected) )
return false;
var v = selected.result;
previousValue = v;
if ( options.multiple ) {
var words = trimWords($input.val());
if ( words.length > 1 ) {
v = words.slice(0, words.length - 1).join( options.multipleSeparator ) + options.multipleSeparator + v;
}
v += options.multipleSeparator;
}
$input.val(v);
hideResultsNow();
$input.trigger("result", [selected.data, selected.value]);
return true;
};
// Check if the current user input matches the currently selected item.
function matchCurrent(selected) {
var toMatch = [selected.result];
if (selected.data.display_name)
toMatch.push(selected.data.display_name);
else if (selected.data.fullname)
toMatch = toMatch.concat([selected.data.first_name, selected.data.last_name]);
var currentValue = lastWord($input.val());
var matched = false;
for (i = 0; i < toMatch.length && !matched; i++) {
var match = toMatch[i];
if (!options.matchCase) {
match = match.toLowerCase();
currentValue = currentValue.toLowerCase();
}
if (options.matchContains)
matched = match.indexOf(currentValue) >= 0
else // check if prefix
matched = match.indexOf(currentValue) === 0
}
return matched;
};
function onChange(crap, skipPrevCheck) {
var currentValue = $input.val();
if ( !skipPrevCheck && currentValue == previousValue )
return;
previousValue = currentValue;
currentValue = lastWord(currentValue);
if ( currentValue.length >= options.minChars) {
$input.addClass(options.loadingClass);
if (!options.matchCase)
currentValue = currentValue.toLowerCase();
request(currentValue, receiveData, hideResultsNow);
} else {
stopLoading();
select.hide();
}
};
function trimWords(value) {
if ( !value ) {
return [""];
}
if ( !options.multiple ) {
return [value];
}
var words = value.split( options.multipleSeparator );
var result = [];
$.each(words, function(i, value) {
result[i] = $.trim(value);
});
return result;
};
function lastWord(value) {
var words = trimWords(value);
return words[words.length - 1];
};
// fills in the input box w/the first match (assumed to be the best match)
// q: the term entered
// sValue: the first matching result
function autoFill(q, sValue){
// autofill in the complete box w/the first match as long as the user hasn't entered in more data
// if the last user key pressed was backspace, don't autofill
if( options.autoFill && (lastWord($input.val()).toLowerCase() == q.toLowerCase()) && lastKeyPressCode != $.ui.keyCode.BACKSPACE ) {
// fill in the value (keep the case the user has typed)
$input.val($input.val() + sValue.substring(lastWord(previousValue).length));
// select the portion of the value not typed by the user (so the next character will erase)
$.ui.rbautocomplete.selection(input, previousValue.length, previousValue.length + sValue.length);
}
};
function hideResults() {
clearTimeout(timeout);
timeout = setTimeout(hideResultsNow, 200);
};
function hideResultsNow() {
var wasVisible = select.visible();
select.hide();
clearTimeout(timeout);
stopLoading();
if (options.mustMatch) {
// call search and run callback
$input.rbautocomplete("search", function (result){
// if no value found, clear the input box
if( !result ) {
if (options.multiple) {
var words = trimWords($input.val()).slice(0, -1);
$input.val( words.join(options.multipleSeparator) + (words.length ? options.multipleSeparator : "") );
}
else
$input.val( "" );
}
}
);
}
if (wasVisible)
// position cursor at end of input field
$.ui.rbautocomplete.selection(input, input.value.length, input.value.length);
};
function receiveData(q, data) {
if ( data && data.length && hasFocus ) {
stopLoading();
select.display(data, q);
autoFill(q, data[0].value);
select.show();
} else {
hideResultsNow();
}
};
function request(term, success, failure) {
if (!options.matchCase)
term = term.toLowerCase();
var data = cache.load(term);
// recieve the cached data
if (data && data.length) {
success(term, data);
// if an AJAX url has been supplied, try loading the data now
} else if( (typeof options.url == "string") && (options.url.length > 0) ){
var extraParams = {
timestamp: +new Date()
};
$.each(options.extraParams, function(key, param) {
extraParams[key] = typeof param == "function" ? param(term) : param;
});
$.ajax({
// try to leverage ajaxQueue plugin to abort previous requests
mode: "abort",
// limit abortion to this input
port: "autocomplete" + input.name,
dataType: options.dataType,
url: options.url,
data: $.extend({
q: lastWord(term),
limit: options.max
}, extraParams),
success: function(data) {
var parsed = options.parse && options.parse(data) || parse(data);
cache.add(term, parsed);
success(term, parsed);
},
error: function(xhr, textStatus, errorThrown) {
if (options.error) {
options.error(xhr, textStatus, errorThrown);
}
}
});
}
else if (options.source && typeof options.source == 'function') {
var resultData = options.source(term);
var parsed = (options.parse) ? options.parse(resultData) : resultData;
cache.add(term, parsed);
success(term, parsed);
} else {
// if we have a failure, we need to empty the list -- this prevents the the [TAB] key from selecting the last successful match
select.emptyList();
failure(term);
}
};
function parse(data) {
var parsed = [];
var rows = data.split("\n");
for (var i=0; i < rows.length; i++) {
var row = $.trim(rows[i]);
if (row) {
row = row.split("|");
parsed[parsed.length] = {
data: row,
value: row[0],
result: options.formatResult && options.formatResult(row, row[0]) || row[0]
};
}
}
return parsed;
};
function stopLoading() {
$input.removeClass(options.loadingClass);
};
},
_propagate: function(n, event) {
$.ui.plugin.call(this, n, [event, this.ui()]);
return this.element.triggerHandler(n == 'autocomplete' ? n : 'autocomplete'+n, [event, this.ui()], this.options[n]);
},
// Public methods
ui: function(event) {
return {
options: this.options,
element: this.element
};
},
result: function(handler) {
return this.element.bind("result", handler);
},
search: function(handler) {
return this.element.trigger("search", [handler]);
},
flushCache: function() {
return this.element.trigger("flushCache");
},
setData: function(key, value){
return this.element.trigger("setOptions", [{ key: value }]);
},
destroy: function() {
this.element
.removeAttr('disabled')
.removeClass('ui-autocomplete-input');
return this.element.trigger("unautocomplete");
},
enable: function() {
this.element
.removeAttr('disabled')
.removeClass('ui-autocomplete-disabled');
this.disabled = false;
},
disable: function() {
this.element
.attr('disabled', true)
.addClass('ui-autocomplete-disabled');
this.disabled = true;
}
});
$.ui.rbautocomplete.cache = function(options) {
var data = {};
var length = 0;
function matchSubset(s, sub) {
if (!options.matchCase)
s = s.toLowerCase();
var i = s.indexOf(sub);
if (i == -1) return false;
return i == 0 || options.matchContains;
};
function add(q, value) {
if (length > options.cacheLength){
flush();
}
if (!data[q]){
length++;
}
data[q] = value;
}
function populate(){
if( !options.data ) return false;
// track the matches
var stMatchSets = {},
nullData = 0;
// no url was specified, we need to adjust the cache length to make sure it fits the local data store
if( !options.url ) options.cacheLength = 1;
// track all options for minChars = 0
stMatchSets[""] = [];
// loop through the array and create a lookup structure
for ( var i = 0, ol = options.data.length; i < ol; i++ ) {
var rawValue = options.data[i];
// if rawValue is a string, make an array otherwise just reference the array
rawValue = (typeof rawValue == "string") ? [rawValue] : rawValue;
var value = options.formatMatch(rawValue, i+1, options.data.length);
if ( value === false )
continue;
var firstChar = value.charAt(0).toLowerCase();
// if no lookup array for this character exists, look it up now
if( !stMatchSets[firstChar] )
stMatchSets[firstChar] = [];
// if the match is a string
var row = {
value: value,
data: rawValue,
result: options.formatResult && options.formatResult(rawValue) || value
};
// push the current match into the set list
stMatchSets[firstChar].push(row);
// keep track of minChars zero items
if ( nullData++ < options.max ) {
stMatchSets[""].push(row);
}
};
// add the data items to the cache
$.each(stMatchSets, function(i, value) {
// increase the cache size
options.cacheLength++;
// add to the cache
add(i, value);
});
}
// populate any existing data
setTimeout(populate, 25);
function flush(){
data = {};
length = 0;
}
return {
flush: flush,
add: add,
populate: populate,
load: function(q) {
if (!options.cacheLength || !length)
return null;
/*
* if dealing w/local data and matchContains than we must make sure
* to loop through all the data collections looking for matches
*/
if( !options.url && options.matchContains ){
// track all matches
var csub = [];
// loop through all the data grids for matches
for( var k in data ){
// don't search through the stMatchSets[""] (minChars: 0) cache
// this prevents duplicates
if( k.length > 0 ){
var c = data[k];
$.each(c, function(i, x) {
// if we've got a match, add it to the array
if (matchSubset(x.value, q)) {
csub.push(x);
}
});
}
}
return csub;
} else
// if the exact item exists, use it
if (data[q]){
return data[q];
} else
if (options.matchSubset) {
for (var i = q.length - 1; i >= options.minChars; i--) {
var c = data[q.substr(0, i)];
if (c) {
var csub = [];
$.each(c, function(i, x) {
if (matchSubset(x.value, q)) {
csub[csub.length] = x;
}
});
return csub;
}
}
}
return null;
}
};
};
$.ui.rbautocomplete.select = function (options, input, select, config) {
var CLASSES = {
ACTIVE: "ui-autocomplete-over"
};
var listItems,
active = -1,
data,
term = "",
needsInit = true,
element,
list;
// Create results
function init() {
if (!needsInit)
return;
element = $("<div/>")
.hide()
.addClass(options.resultsClass)
.css("position", "absolute")
.appendTo(options.resultsParentEl);
list = $("<ul/>").appendTo(element).mouseover( function(event) {
if(target(event).nodeName && target(event).nodeName.toUpperCase() == 'LI') {
active = $("li", list).removeClass(CLASSES.ACTIVE).index(target(event));
$(target(event)).addClass(CLASSES.ACTIVE);
}
}).click(function(event) {
$(target(event)).addClass(CLASSES.ACTIVE);
select();
// TODO provide option to avoid setting focus again after selection? useful for cleanup-on-focus
input.focus();
return false;
}).mousedown(function() {
config.mouseDownOnSelect = true;
}).mouseup(function() {
config.mouseDownOnSelect = false;
});
if( options.width > 0 )
element.css("width", options.width);
needsInit = false;
}
function target(event) {
var element = event.target;
while(element && element.tagName != "LI")
element = element.parentNode;
// more fun with IE, sometimes event.target is empty, just ignore it then
if(!element)
return [];
return element;
}
function moveSelect(step) {
listItems.slice(active, active + 1).removeClass(CLASSES.ACTIVE);
movePosition(step);
var activeItem = listItems.slice(active, active + 1).addClass(CLASSES.ACTIVE);
if(options.scroll) {
var offset = 0;
listItems.slice(0, active).each(function() {
offset += this.offsetHeight;
});
if((offset + activeItem[0].offsetHeight - list.scrollTop()) > list[0].clientHeight) {
list.scrollTop(offset + activeItem[0].offsetHeight - list.innerHeight());
} else if(offset < list.scrollTop()) {
list.scrollTop(offset);
}
}
};
function movePosition(step) {
active += step;
if (active < 0) {
active = listItems.size() - 1;
} else if (active >= listItems.size()) {
active = 0;
}
}
function limitNumberOfItems(available) {
return options.max && options.max < available
? options.max
: available;
}
function makeItem(data) {
if (options.clickToURL === false) {
return $("<li/>");
} else {
// For Quick Search
return $("<li/>").click(function() {
window.open(data["url"]);
});
}
}
function fillList() {
if (options.cmp !== undefined) {
data.sort(function(a, b) {
return options.cmp(term, a, b);
});
}
list.empty();
var max = limitNumberOfItems(data.length);
for (var i=0; i < max; i++) {
if (!data[i])
continue;
var formatted = options.formatItem(data[i].data, i+1, max, data[i].value, term);
if ( formatted === false )
continue;
var li = makeItem(data[i].data)
.html(options.highlight(formatted, term))
.addClass(i%2 == 0 ? "ui-autocomplete-even" : "ui-autocomplete-odd")
.appendTo(list)[0];
$.data(li, "ui-autocomplete-data", data[i]);
}
listItems = list.find("li");
if ( options.selectFirst ) {
listItems.slice(0, 1).addClass(CLASSES.ACTIVE);
active = 0;
}
// apply bgiframe if available
if ( $.fn.bgiframe )
list.bgiframe();
}
return {
display: function(d, q) {
init();
data = d;
term = q;
fillList();
},
next: function() {
moveSelect(1);
},
prev: function() {
moveSelect(-1);
},
pageUp: function() {
if (active != 0 && active - 8 < 0) {
moveSelect( -active );
} else {
moveSelect(-8);
}
},
pageDown: function() {
if (active != listItems.size() - 1 && active + 8 > listItems.size()) {
moveSelect( listItems.size() - 1 - active );
} else {
moveSelect(8);
}
},
hide: function() {
element && element.hide();
listItems && listItems.removeClass(CLASSES.ACTIVE)
active = -1;
$(input).triggerHandler("autocompletehide", [{}, { options: options }], options["hide"]);
},
visible : function() {
return element && element.is(":visible");
},
current: function() {
return this.visible() && (listItems.filter("." + CLASSES.ACTIVE)[0] || options.selectFirst && listItems[0]);
},
show: function() {
var $input = $(input),
$window = $(window),
$document = $(document),
offset = $input.offset(),
inputWidth = input.offsetWidth,
inputHeight = input.offsetHeight,
windowRight,
windowBottom,
width,
height;
if(options.scroll) {
list.scrollTop(0);
list.css({
maxHeight: options.scrollHeight,
overflow: 'auto'
});
}
$(input).triggerHandler("autocompleteshow", [{}, { options: options }], options["show"]);
width = (typeof options.width === "string" || options.width > 0
? options.width
: inputWidth);
height = element.outerHeight(true);
windowBottom = $window.height() + $document.scrollTop();
windowRight = $window.width() + $document.scrollLeft();
element
.css({
width: width,
top: (offset.top + inputHeight + height > windowBottom
? offset.top - height
: offset.top + inputHeight),
left: (offset.left + width > windowRight
? offset.left + inputWidth - width
: offset.left)
})
.show();
},
selected: function() {
var selected = listItems && listItems.filter("." + CLASSES.ACTIVE).removeClass(CLASSES.ACTIVE);
return selected && selected.length && $.data(selected[0], "ui-autocomplete-data");
},
emptyList: function (){
list && list.empty();
},
unbind: function() {
element && element.remove();
}
};
};
$.ui.rbautocomplete.selection = function(field, start, end) {
if( field.createTextRange ){
var selRange = field.createTextRange();
selRange.collapse(true);
selRange.moveStart("character", start);
selRange.moveEnd("character", end);
selRange.select();
} else if( field.setSelectionRange ){
field.setSelectionRange(start, end);
} else {
if( field.selectionStart ){
field.selectionStart = start;
field.selectionEnd = end;
}
}
field.focus();
};
})(jQuery);
| {
"pile_set_name": "Github"
} |
// dll.cpp - written and placed in the public domain by Wei Dai
#define CRYPTOPP_MANUALLY_INSTANTIATE_TEMPLATES
#define CRYPTOPP_DEFAULT_NO_DLL
#include "dll.h"
#pragma warning(default: 4660)
#if defined(CRYPTOPP_EXPORTS) && defined(CRYPTOPP_WIN32_AVAILABLE)
#include <windows.h>
#endif
#ifndef CRYPTOPP_IMPORTS
NAMESPACE_BEGIN(CryptoPP)
template<> const byte PKCS_DigestDecoration<SHA1>::decoration[] = {0x30,0x21,0x30,0x09,0x06,0x05,0x2B,0x0E,0x03,0x02,0x1A,0x05,0x00,0x04,0x14};
template<> const unsigned int PKCS_DigestDecoration<SHA1>::length = sizeof(PKCS_DigestDecoration<SHA1>::decoration);
template<> const byte PKCS_DigestDecoration<SHA224>::decoration[] = {0x30,0x2d,0x30,0x0d,0x06,0x09,0x60,0x86,0x48,0x01,0x65,0x03,0x04,0x02,0x04,0x05,0x00,0x04,0x1c};
template<> const unsigned int PKCS_DigestDecoration<SHA224>::length = sizeof(PKCS_DigestDecoration<SHA224>::decoration);
template<> const byte PKCS_DigestDecoration<SHA256>::decoration[] = {0x30,0x31,0x30,0x0d,0x06,0x09,0x60,0x86,0x48,0x01,0x65,0x03,0x04,0x02,0x01,0x05,0x00,0x04,0x20};
template<> const unsigned int PKCS_DigestDecoration<SHA256>::length = sizeof(PKCS_DigestDecoration<SHA256>::decoration);
template<> const byte PKCS_DigestDecoration<SHA384>::decoration[] = {0x30,0x41,0x30,0x0d,0x06,0x09,0x60,0x86,0x48,0x01,0x65,0x03,0x04,0x02,0x02,0x05,0x00,0x04,0x30};
template<> const unsigned int PKCS_DigestDecoration<SHA384>::length = sizeof(PKCS_DigestDecoration<SHA384>::decoration);
template<> const byte PKCS_DigestDecoration<SHA512>::decoration[] = {0x30,0x51,0x30,0x0d,0x06,0x09,0x60,0x86,0x48,0x01,0x65,0x03,0x04,0x02,0x03,0x05,0x00,0x04,0x40};
template<> const unsigned int PKCS_DigestDecoration<SHA512>::length = sizeof(PKCS_DigestDecoration<SHA512>::decoration);
template<> const byte EMSA2HashId<SHA>::id = 0x33;
template<> const byte EMSA2HashId<SHA224>::id = 0x38;
template<> const byte EMSA2HashId<SHA256>::id = 0x34;
template<> const byte EMSA2HashId<SHA384>::id = 0x36;
template<> const byte EMSA2HashId<SHA512>::id = 0x35;
NAMESPACE_END
#endif
#ifdef CRYPTOPP_EXPORTS
USING_NAMESPACE(CryptoPP)
#if !(defined(_MSC_VER) && (_MSC_VER < 1300))
using std::set_new_handler;
#endif
static PNew s_pNew = NULL;
static PDelete s_pDelete = NULL;
static void * New (size_t size)
{
void *p;
while (!(p = malloc(size)))
CallNewHandler();
return p;
}
static void SetNewAndDeleteFunctionPointers()
{
void *p = NULL;
HMODULE hModule = NULL;
MEMORY_BASIC_INFORMATION mbi;
while (true)
{
VirtualQuery(p, &mbi, sizeof(mbi));
if (p >= (char *)mbi.BaseAddress + mbi.RegionSize)
break;
p = (char *)mbi.BaseAddress + mbi.RegionSize;
if (!mbi.AllocationBase || mbi.AllocationBase == hModule)
continue;
hModule = HMODULE(mbi.AllocationBase);
PGetNewAndDelete pGetNewAndDelete = (PGetNewAndDelete)GetProcAddress(hModule, "GetNewAndDeleteForCryptoPP");
if (pGetNewAndDelete)
{
pGetNewAndDelete(s_pNew, s_pDelete);
return;
}
PSetNewAndDelete pSetNewAndDelete = (PSetNewAndDelete)GetProcAddress(hModule, "SetNewAndDeleteFromCryptoPP");
if (pSetNewAndDelete)
{
s_pNew = &New;
s_pDelete = &free;
pSetNewAndDelete(s_pNew, s_pDelete, &set_new_handler);
return;
}
}
// try getting these directly using mangled names of new and delete operators
hModule = GetModuleHandle("msvcrtd");
if (!hModule)
hModule = GetModuleHandle("msvcrt");
if (hModule)
{
// 32-bit versions
s_pNew = (PNew)GetProcAddress(hModule, "??2@YAPAXI@Z");
s_pDelete = (PDelete)GetProcAddress(hModule, "??3@YAXPAX@Z");
if (s_pNew && s_pDelete)
return;
// 64-bit versions
s_pNew = (PNew)GetProcAddress(hModule, "??2@YAPEAX_K@Z");
s_pDelete = (PDelete)GetProcAddress(hModule, "??3@YAXPEAX@Z");
if (s_pNew && s_pDelete)
return;
}
OutputDebugString("Crypto++ was not able to obtain new and delete function pointers.\n");
throw 0;
}
void * operator new (size_t size)
{
if (!s_pNew)
SetNewAndDeleteFunctionPointers();
return s_pNew(size);
}
void operator delete (void * p)
{
s_pDelete(p);
}
void * operator new [] (size_t size)
{
return operator new (size);
}
void operator delete [] (void * p)
{
operator delete (p);
}
#endif // #ifdef CRYPTOPP_EXPORTS
| {
"pile_set_name": "Github"
} |
package org.dynmap.forge_1_12_2.permissions;
import java.util.Set;
import net.minecraft.command.ICommandSender;
public interface PermissionProvider {
boolean has(ICommandSender sender, String permission);
boolean hasPermissionNode(ICommandSender sender, String permission);
Set<String> hasOfflinePermissions(String player, Set<String> perms);
boolean hasOfflinePermission(String player, String perm);
}
| {
"pile_set_name": "Github"
} |
#ifndef BOOST_METAPARSE_V1_FWD_SOURCE_POSITION_HPP
#define BOOST_METAPARSE_V1_FWD_SOURCE_POSITION_HPP
// Copyright Abel Sinkovics ([email protected]) 2013.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
namespace boost
{
namespace metaparse
{
namespace v1
{
template <class Line, class Col, class PrevChar>
struct source_position;
}
}
}
#endif
| {
"pile_set_name": "Github"
} |
module NewRelic::Agent
class StatsEngine
POLL_PERIOD = 10
attr_accessor :log
ScopeStackElement = Struct.new(:name, :children_time, :deduct_call_time_from_parent)
class SampledItem
def initialize(stats, &callback)
@stats = stats
@callback = callback
end
def poll
@callback.call @stats
end
end
def initialize(log = Logger.new(STDERR))
@stats_hash = {}
@sampled_items = []
@scope_stack_listener = nil
@log = log
# Makes the unit tests happy
Thread::current[:newrelic_scope_stack] = nil
spawn_sampler_thread
end
def spawn_sampler_thread
return if !@sampler_process.nil? && @sampler_process == $$
# start up a thread that will periodically poll for metric samples
@sampler_thread = Thread.new do
while true do
begin
sleep POLL_PERIOD
@sampled_items.each do |sampled_item|
begin
sampled_item.poll
rescue => e
log.error e
@sampled_items.delete sampled_item
log.error "Removing #{sampled_item} from list"
log.debug e.backtrace.to_s
end
end
end
end
end
@sampler_process = $$
end
def add_scope_stack_listener(l)
fail "Can't add a scope listener midflight in a transaction" if scope_stack.any?
@scope_stack_listener = l
end
def remove_scope_stack_listener(l)
@scope_stack_listener = nil
end
def push_scope(metric, time = Time.now.to_f, deduct_call_time_from_parent = true)
stack = (Thread::current[:newrelic_scope_stack] ||= [])
if @scope_stack_listener
@scope_stack_listener.notice_first_scope_push(time) if stack.empty?
@scope_stack_listener.notice_push_scope metric, time
end
scope = ScopeStackElement.new(metric, 0, deduct_call_time_from_parent)
stack.push scope
scope
end
def pop_scope(expected_scope, duration, time=Time.now.to_f)
stack = Thread::current[:newrelic_scope_stack]
scope = stack.pop
fail "unbalanced pop from blame stack: #{scope.name} != #{expected_scope.name}" if scope != expected_scope
stack.last.children_time += duration unless (stack.empty? || !scope.deduct_call_time_from_parent)
if !scope.deduct_call_time_from_parent && !stack.empty?
stack.last.children_time += scope.children_time
end
if @scope_stack_listener
@scope_stack_listener.notice_pop_scope(scope.name, time)
@scope_stack_listener.notice_scope_empty(time) if stack.empty?
end
scope
end
def peek_scope
scope_stack.last
end
def add_sampled_metric(metric_name, &sampler_callback)
stats = get_stats(metric_name, false)
@sampled_items << SampledItem.new(stats, &sampler_callback)
end
# set the name of the transaction for the current thread, which will be used
# to define the scope of all traced methods called on this thread until the
# scope stack is empty.
#
# currently the transaction name is the name of the controller action that
# is invoked via the dispatcher, but conceivably we could use other transaction
# names in the future if the traced application does more than service http request
# via controller actions
def transaction_name=(transaction)
Thread::current[:newrelic_transaction_name] = transaction
end
def transaction_name
Thread::current[:newrelic_transaction_name]
end
def lookup_stat(metric_name)
return @stats_hash[metric_name]
end
def metrics
return @stats_hash.keys
end
def get_stats_no_scope(metric_name)
stats = @stats_hash[metric_name]
if stats.nil?
stats = NewRelic::MethodTraceStats.new
@stats_hash[metric_name] = stats
end
stats
end
def get_stats(metric_name, use_scope = true)
stats = @stats_hash[metric_name]
if stats.nil?
stats = NewRelic::MethodTraceStats.new
@stats_hash[metric_name] = stats
end
if use_scope && transaction_name
spec = NewRelic::MetricSpec.new metric_name, transaction_name
scoped_stats = @stats_hash[spec]
if scoped_stats.nil?
scoped_stats = NewRelic::ScopedMethodTraceStats.new stats
@stats_hash[spec] = scoped_stats
end
stats = scoped_stats
end
return stats
end
# Note: this is not synchronized. There is still some risk in this and
# we will revisit later to see if we can make this more robust without
# sacrificing efficiency.
def harvest_timeslice_data(previous_timeslice_data, metric_ids)
timeslice_data = {}
@stats_hash.keys.each do |metric_spec|
# get a copy of the stats collected since the last harvest, and clear
# the stats inside our hash table for the next time slice.
stats = @stats_hash[metric_spec]
# we have an optimization for unscoped metrics
if !(metric_spec.is_a? NewRelic::MetricSpec)
metric_spec = NewRelic::MetricSpec.new metric_spec
end
if stats.nil?
raise "Nil stats for #{metric_spec.name} (#{metric_spec.scope})"
end
stats_copy = stats.clone
stats.reset
# if the previous timeslice data has not been reported (due to an error of some sort)
# then we need to merge this timeslice with the previously accumulated - but not sent
# data
previous_metric_data = previous_timeslice_data[metric_spec]
stats_copy.merge! previous_metric_data.stats unless previous_metric_data.nil?
stats_copy.round!
# don't bother collecting and reporting stats that have zero-values for this timeslice.
# significant performance boost and storage savings.
unless stats_copy.call_count == 0 && stats_copy.total_call_time == 0.0 && stats_copy.total_exclusive_time == 0.0
metric_spec_for_transport = (metric_ids[metric_spec].nil?) ? metric_spec : nil
metric_data = NewRelic::MetricData.new(metric_spec_for_transport, stats_copy, metric_ids[metric_spec])
timeslice_data[metric_spec] = metric_data
end
end
timeslice_data
end
def start_transaction
Thread::current[:newrelic_scope_stack] = []
end
# Try to clean up gracefully, otherwise we leave things hanging around on thread locals
#
def end_transaction
stack = Thread::current[:newrelic_scope_stack]
if stack
@scope_stack_listener.notice_scope_empty(Time.now) if @scope_stack_listener && !stack.empty?
Thread::current[:newrelic_scope_stack] = nil
end
Thread::current[:newrelic_transaction_name] = nil
end
private
def scope_stack
Thread::current[:newrelic_scope_stack] ||= []
end
end
end
| {
"pile_set_name": "Github"
} |
package main
import "github.com/kataras/iris/v12"
func main() {
e := iris.Handlebars(nil, ".html") // You can still use a file system though.
e.ParseTemplate("program.html", `<h1>{{greet Name}}</h1>`, iris.Map{
"greet": func(name string) string {
return "Hello, " + name + "!"
},
})
e.Reload(true)
app := iris.New()
app.RegisterView(e)
app.Get("/", index)
app.Listen(":8080")
}
func index(ctx iris.Context) {
ctx.View("program.html", iris.Map{
"Name": "Gerasimos",
})
}
| {
"pile_set_name": "Github"
} |
// Copyright 2014 Michael Yang. All rights reserved.
// Use of this source code is governed by a MIT-style
// license that can be found in the LICENSE file.
//! Bindings for matrix functions.
pub mod cblas_s {
use crate::attribute::{Diagonal, Order, Side, Symmetry, Transpose};
use libc::c_float;
pub use self::cblas_sgemm as gemm;
pub use self::cblas_ssymm as symm;
pub use self::cblas_ssyr2k as syr2k;
pub use self::cblas_ssyrk as syrk;
pub use self::cblas_strmm as trmm;
pub use self::cblas_strsm as strsm;
extern "C" {
pub fn cblas_sgemm(
order: Order,
trans_a: Transpose,
trans_b: Transpose,
m: u32,
n: u32,
k: u32,
alpha: c_float,
a: *const c_float,
lda: u32,
b: *const c_float,
ldb: u32,
beta: c_float,
c: *mut c_float,
ldc: u32,
);
pub fn cblas_ssymm(
order: Order,
side: Side,
sym: Symmetry,
m: u32,
n: u32,
alpha: c_float,
a: *const c_float,
lda: u32,
b: *const c_float,
ldb: u32,
beta: c_float,
c: *mut c_float,
ldc: u32,
);
pub fn cblas_strmm(
order: Order,
side: Side,
sym: Symmetry,
trans: Transpose,
diag: Diagonal,
m: u32,
n: u32,
alpha: c_float,
a: *const c_float,
lda: u32,
b: *mut c_float,
ldb: u32,
);
pub fn cblas_strsm(
order: Order,
side: Side,
sym: Symmetry,
trans: Transpose,
diag: Diagonal,
m: u32,
n: u32,
alpha: c_float,
a: *const c_float,
lda: u32,
b: *mut c_float,
ldb: u32,
);
pub fn cblas_ssyrk(
order: Order,
sym: Symmetry,
Trans: Transpose,
n: u32,
k: u32,
alpha: c_float,
a: *const c_float,
lda: u32,
beta: c_float,
c: *mut c_float,
ldc: u32,
);
pub fn cblas_ssyr2k(
order: Order,
sym: Symmetry,
Trans: Transpose,
n: u32,
k: u32,
alpha: c_float,
a: *const c_float,
lda: u32,
b: *const c_float,
ldb: u32,
beta: c_float,
c: *mut c_float,
ldc: u32,
);
}
}
pub mod cblas_d {
use crate::attribute::{Diagonal, Order, Side, Symmetry, Transpose};
use libc::c_double;
pub use self::cblas_dgemm as gemm;
pub use self::cblas_dsymm as symm;
pub use self::cblas_dsyr2k as syr2k;
pub use self::cblas_dsyrk as syrk;
pub use self::cblas_dtrmm as trmm;
pub use self::cblas_dtrsm as strsm;
extern "C" {
pub fn cblas_dgemm(
order: Order,
trans_a: Transpose,
trans_b: Transpose,
m: u32,
n: u32,
k: u32,
alpha: c_double,
a: *const c_double,
lda: u32,
b: *const c_double,
ldb: u32,
beta: c_double,
c: *mut c_double,
ldc: u32,
);
pub fn cblas_dsymm(
order: Order,
side: Side,
sym: Symmetry,
m: u32,
n: u32,
alpha: c_double,
a: *const c_double,
lda: u32,
b: *const c_double,
ldb: u32,
beta: c_double,
c: *mut c_double,
ldc: u32,
);
pub fn cblas_dtrmm(
order: Order,
side: Side,
sym: Symmetry,
trans: Transpose,
diag: Diagonal,
m: u32,
n: u32,
alpha: c_double,
a: *const c_double,
lda: u32,
b: *mut c_double,
ldb: u32,
);
pub fn cblas_dtrsm(
order: Order,
side: Side,
sym: Symmetry,
trans: Transpose,
diag: Diagonal,
m: u32,
n: u32,
alpha: c_double,
a: *const c_double,
lda: u32,
b: *mut c_double,
ldb: u32,
);
pub fn cblas_dsyrk(
order: Order,
sym: Symmetry,
Trans: Transpose,
n: u32,
k: u32,
alpha: c_double,
a: *const c_double,
lda: u32,
beta: c_double,
c: *mut c_double,
ldc: u32,
);
pub fn cblas_dsyr2k(
order: Order,
sym: Symmetry,
Trans: Transpose,
n: u32,
k: u32,
alpha: c_double,
a: *const c_double,
lda: u32,
b: *const c_double,
ldb: u32,
beta: c_double,
c: *mut c_double,
ldc: u32,
);
}
}
pub mod cblas_c {
use crate::attribute::{Diagonal, Order, Side, Symmetry, Transpose};
use libc::{c_float, c_void};
pub use self::cblas_cgemm as gemm;
pub use self::cblas_chemm as hemm;
pub use self::cblas_cher2k as her2k;
pub use self::cblas_cherk as herk;
pub use self::cblas_csymm as symm;
pub use self::cblas_csyr2k as syr2k;
pub use self::cblas_csyrk as syrk;
pub use self::cblas_ctrmm as trmm;
pub use self::cblas_ctrsm as trsm;
extern "C" {
pub fn cblas_cgemm(
order: Order,
trans_a: Transpose,
trans_b: Transpose,
m: u32,
n: u32,
k: u32,
alpha: *const c_void,
a: *const c_void,
lda: u32,
b: *const c_void,
ldb: u32,
beta: *const c_void,
c: *mut c_void,
ldc: u32,
);
pub fn cblas_csymm(
order: Order,
side: Side,
sym: Symmetry,
m: u32,
n: u32,
alpha: *const c_void,
a: *const c_void,
lda: u32,
b: *const c_void,
ldb: u32,
beta: *const c_void,
c: *mut c_void,
ldc: u32,
);
pub fn cblas_chemm(
order: Order,
side: Side,
sym: Symmetry,
m: u32,
n: u32,
alpha: *const c_void,
a: *const c_void,
lda: u32,
b: *const c_void,
ldb: u32,
beta: *const c_void,
c: *mut c_void,
ldc: u32,
);
pub fn cblas_ctrmm(
order: Order,
side: Side,
sym: Symmetry,
trans: Transpose,
diag: Diagonal,
m: u32,
n: u32,
alpha: *const c_void,
a: *const c_void,
lda: u32,
b: *mut c_void,
ldb: u32,
);
pub fn cblas_ctrsm(
order: Order,
side: Side,
sym: Symmetry,
trans: Transpose,
diag: Diagonal,
m: u32,
n: u32,
alpha: *const c_void,
a: *const c_void,
lda: u32,
b: *mut c_void,
ldb: u32,
);
pub fn cblas_cherk(
order: Order,
sym: Symmetry,
Trans: Transpose,
n: u32,
k: u32,
alpha: c_float,
a: *const c_void,
lda: u32,
beta: c_float,
c: *mut c_void,
ldc: u32,
);
pub fn cblas_cher2k(
order: Order,
sym: Symmetry,
Trans: Transpose,
n: u32,
k: u32,
alpha: *const c_void,
a: *const c_void,
lda: u32,
b: *const c_void,
ldb: u32,
beta: c_float,
c: *mut c_void,
ldc: u32,
);
pub fn cblas_csyrk(
order: Order,
sym: Symmetry,
Trans: Transpose,
n: u32,
k: u32,
alpha: *const c_void,
a: *const c_void,
lda: u32,
beta: *const c_void,
c: *mut c_void,
ldc: u32,
);
pub fn cblas_csyr2k(
order: Order,
sym: Symmetry,
Trans: Transpose,
n: u32,
k: u32,
alpha: *const c_void,
a: *const c_void,
lda: u32,
b: *const c_void,
ldb: u32,
beta: *const c_void,
c: *mut c_void,
ldc: u32,
);
}
}
pub mod cblas_z {
use crate::attribute::{Diagonal, Order, Side, Symmetry, Transpose};
use libc::{c_double, c_void};
pub use self::cblas_zgemm as gemm;
pub use self::cblas_zhemm as hemm;
pub use self::cblas_zher2k as her2k;
pub use self::cblas_zherk as herk;
pub use self::cblas_zsymm as symm;
pub use self::cblas_zsyr2k as syr2k;
pub use self::cblas_zsyrk as syrk;
pub use self::cblas_ztrmm as trmm;
pub use self::cblas_ztrsm as trsm;
extern "C" {
pub fn cblas_zgemm(
order: Order,
trans_a: Transpose,
trans_b: Transpose,
m: u32,
n: u32,
k: u32,
alpha: *const c_void,
a: *const c_void,
lda: u32,
b: *const c_void,
ldb: u32,
beta: *const c_void,
c: *mut c_void,
ldc: u32,
);
pub fn cblas_zsymm(
order: Order,
side: Side,
sym: Symmetry,
m: u32,
n: u32,
alpha: *const c_void,
a: *const c_void,
lda: u32,
b: *const c_void,
ldb: u32,
beta: *const c_void,
c: *mut c_void,
ldc: u32,
);
pub fn cblas_zhemm(
order: Order,
side: Side,
sym: Symmetry,
m: u32,
n: u32,
alpha: *const c_void,
a: *const c_void,
lda: u32,
b: *const c_void,
ldb: u32,
beta: *const c_void,
c: *mut c_void,
ldc: u32,
);
pub fn cblas_ztrmm(
order: Order,
side: Side,
sym: Symmetry,
trans: Transpose,
diag: Diagonal,
m: u32,
n: u32,
alpha: *const c_void,
a: *const c_void,
lda: u32,
b: *mut c_void,
ldb: u32,
);
pub fn cblas_ztrsm(
order: Order,
side: Side,
sym: Symmetry,
trans: Transpose,
diag: Diagonal,
m: u32,
n: u32,
alpha: *const c_void,
a: *const c_void,
lda: u32,
b: *mut c_void,
ldb: u32,
);
pub fn cblas_zherk(
order: Order,
sym: Symmetry,
Trans: Transpose,
n: u32,
k: u32,
alpha: c_double,
a: *const c_void,
lda: u32,
beta: c_double,
c: *mut c_void,
ldc: u32,
);
pub fn cblas_zher2k(
order: Order,
sym: Symmetry,
Trans: Transpose,
n: u32,
k: u32,
alpha: *const c_void,
a: *const c_void,
lda: u32,
b: *const c_void,
ldb: u32,
beta: c_double,
c: *mut c_void,
ldc: u32,
);
pub fn cblas_zsyrk(
order: Order,
sym: Symmetry,
Trans: Transpose,
n: u32,
k: u32,
alpha: *const c_void,
a: *const c_void,
lda: u32,
beta: *const c_void,
c: *mut c_void,
ldc: u32,
);
pub fn cblas_zsyr2k(
order: Order,
sym: Symmetry,
Trans: Transpose,
n: u32,
k: u32,
alpha: *const c_void,
a: *const c_void,
lda: u32,
b: *const c_void,
ldb: u32,
beta: *const c_void,
c: *mut c_void,
ldc: u32,
);
}
}
| {
"pile_set_name": "Github"
} |
/*
* FFI C library loader.
* Copyright (C) 2015-2019 IPONWEB Ltd. See Copyright Notice in COPYRIGHT
*
* Portions taken verbatim or adapted from LuaJIT.
* Copyright (C) 2005-2017 Mike Pall. See Copyright Notice in luajit.h
*/
#ifndef _LJ_CLIB_H
#define _LJ_CLIB_H
#include "lj_obj.h"
#if LJ_HASFFI
/* Namespace for C library indexing. */
#define CLNS_INDEX ((1u<<CT_FUNC)|(1u<<CT_EXTERN)|(1u<<CT_CONSTVAL))
/* C library namespace. */
typedef struct CLibrary {
void *handle; /* Opaque handle for dynamic library loader. */
GCtab *cache; /* Cache for resolved symbols. Anchored in ud->env. */
} CLibrary;
TValue *lj_clib_index(lua_State *L, CLibrary *cl, GCstr *name);
void lj_clib_load(lua_State *L, GCtab *mt, GCstr *name, int global);
void lj_clib_unload(CLibrary *cl);
void lj_clib_default(lua_State *L, GCtab *mt);
#endif
#endif
| {
"pile_set_name": "Github"
} |
import React from 'react';
export default function CustomReviewYesNo({ children, uiSchema }) {
return (
<div className="review-row">
<dt>{uiSchema['ui:title'].props.children.props.children}</dt>
<dd>{children.props.formData ? 'Yes' : 'No'}</dd>
</div>
);
}
| {
"pile_set_name": "Github"
} |
import commands from '../../commands';
import flowCommands from '../../../flow/commands';
import Command, { CommandOption, CommandValidate, CommandError } from '../../../../Command';
import * as sinon from 'sinon';
import appInsights from '../../../../appInsights';
import auth from '../../../../Auth';
const command: Command = require('./connector-list');
import * as assert from 'assert';
import request from '../../../../request';
import Utils from '../../../../Utils';
describe(commands.CONNECTOR_LIST, () => {
let vorpal: Vorpal;
let log: string[];
let cmdInstance: any;
let cmdInstanceLogSpy: sinon.SinonSpy;
before(() => {
sinon.stub(auth, 'restoreAuth').callsFake(() => Promise.resolve());
sinon.stub(appInsights, 'trackEvent').callsFake(() => { });
auth.service.connected = true;
});
beforeEach(() => {
vorpal = require('../../../../vorpal-init');
log = [];
cmdInstance = {
commandWrapper: {
command: command.name
},
action: command.action(),
log: (msg: string) => {
log.push(msg);
}
};
cmdInstanceLogSpy = sinon.spy(cmdInstance, 'log');
});
afterEach(() => {
Utils.restore([
vorpal.find,
request.get
]);
});
after(() => {
Utils.restore([
auth.restoreAuth,
appInsights.trackEvent
]);
auth.service.connected = false;
});
it('has correct name', () => {
assert.equal(command.name.startsWith(commands.CONNECTOR_LIST), true);
});
it('has a description', () => {
assert.notEqual(command.description, null);
});
it('defines alias', () => {
const alias = command.alias();
assert.notEqual(typeof alias, 'undefined');
});
it('defines correct alias', () => {
const alias = command.alias();
assert.equal((alias && alias.indexOf(flowCommands.CONNECTOR_LIST) > -1), true);
});
it('retrieves custom connectors (debug)', (done) => {
sinon.stub(request, 'get').callsFake((opts) => {
if ((opts.url as string).indexOf(`providers/Microsoft.PowerApps/apis?api-version=2016-11-01&$filter=environment%20eq%20%27Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6%27%20and%20IsCustomApi%20eq%20%27True%27`) > -1) {
if (opts.headers &&
opts.headers.accept &&
opts.headers.accept.indexOf('application/json') === 0) {
return Promise.resolve({ "value": [{ "name": "shared_my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012", "id": "/providers/Microsoft.PowerApps/apis/shared_my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012", "type": "Microsoft.PowerApps/apis", "properties": { "displayName": "My connector 2", "iconUri": "https://az787822.vo.msecnd.net/defaulticons/api-dedicated.png", "iconBrandColor": "#007ee5", "contact": {}, "license": {}, "apiEnvironment": "Shared", "isCustomApi": true, "connectionParameters": {}, "runtimeUrls": ["https://europe-002.azure-apim.net/apim/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012"], "primaryRuntimeUrl": "https://europe-002.azure-apim.net/apim/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012", "metadata": { "source": "powerapps-user-defined", "brandColor": "#007ee5", "contact": {}, "license": {}, "publisherUrl": null, "serviceUrl": null, "documentationUrl": null, "environmentName": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "xrmConnectorId": null, "almMode": "Environment", "createdBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "modifiedBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "allowSharing": false }, "capabilities": [], "description": "", "apiDefinitions": { "originalSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012.json_original?sv=2018-03-28&sr=b&sig=rwJTmpMb4jb88Fzd9hoz8UbX0ZNbNiz5Cy5yfqTxcjU%3D&se=2019-12-05T19%3A53%3A49Z&sp=r", "modifiedSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012.json?sv=2018-03-28&sr=b&sig=eCW8GUjWHkcB8CFFQ%2FSZAGNBCZeAqj4H9ngRbA%2Fa4CI%3D&se=2019-12-05T19%3A53%3A49Z&sp=r" }, "createdBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "modifiedBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "createdTime": "2019-12-05T18:51:54.3261899Z", "changedTime": "2019-12-05T18:51:54.3261899Z", "environment": { "id": "/providers/Microsoft.PowerApps/environments/Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "name": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6" }, "tier": "Standard", "publisher": "MOD Administrator", "almMode": "Environment" } }, { "name": "shared_my-20connector-5f0027f520b23e81c1-5f9888a90360086012", "id": "/providers/Microsoft.PowerApps/apis/shared_my-20connector-5f0027f520b23e81c1-5f9888a90360086012", "type": "Microsoft.PowerApps/apis", "properties": { "displayName": "My connector", "iconUri": "https://az787822.vo.msecnd.net/defaulticons/api-dedicated.png", "iconBrandColor": "#007ee5", "contact": {}, "license": {}, "apiEnvironment": "Shared", "isCustomApi": true, "connectionParameters": {}, "runtimeUrls": ["https://europe-002.azure-apim.net/apim/my-20connector-5f0027f520b23e81c1-5f9888a90360086012"], "primaryRuntimeUrl": "https://europe-002.azure-apim.net/apim/my-20connector-5f0027f520b23e81c1-5f9888a90360086012", "metadata": { "source": "powerapps-user-defined", "brandColor": "#007ee5", "contact": {}, "license": {}, "publisherUrl": null, "serviceUrl": null, "documentationUrl": null, "environmentName": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "xrmConnectorId": null, "almMode": "Environment", "createdBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "modifiedBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "allowSharing": false }, "capabilities": [], "description": "", "apiDefinitions": { "originalSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-5f0027f520b23e81c1-5f9888a90360086012.json_original?sv=2018-03-28&sr=b&sig=cOkjAecgpr6sSznMpDqiZitUOpVvVDJRCOZfe3VmReU%3D&se=2019-12-05T19%3A53%3A49Z&sp=r", "modifiedSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-5f0027f520b23e81c1-5f9888a90360086012.json?sv=2018-03-28&sr=b&sig=rkpKHP8K%2F2yNBIUQcVN%2B0ZPjnP9sECrM%2FfoZMG%2BJZX0%3D&se=2019-12-05T19%3A53%3A49Z&sp=r" }, "createdBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "modifiedBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "createdTime": "2019-12-05T18:45:03.4615313Z", "changedTime": "2019-12-05T18:45:03.4615313Z", "environment": { "id": "/providers/Microsoft.PowerApps/environments/Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "name": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6" }, "tier": "Standard", "publisher": "MOD Administrator", "almMode": "Environment" } }] });
}
}
return Promise.reject('Invalid request');
});
cmdInstance.action({ options: { debug: true, environment: 'Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6' } }, () => {
try {
assert(cmdInstanceLogSpy.calledWith([
{
name: 'shared_my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012',
displayName: 'My connector 2'
},
{
name: 'shared_my-20connector-5f0027f520b23e81c1-5f9888a90360086012',
displayName: 'My connector'
}
]));
done();
}
catch (e) {
done(e);
}
});
});
it('retrieves custom connectors', (done) => {
sinon.stub(request, 'get').callsFake((opts) => {
if ((opts.url as string).indexOf(`providers/Microsoft.PowerApps/apis?api-version=2016-11-01&$filter=environment%20eq%20%27Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6%27%20and%20IsCustomApi%20eq%20%27True%27`) > -1) {
if (opts.headers &&
opts.headers.accept &&
opts.headers.accept.indexOf('application/json') === 0) {
return Promise.resolve({ "value": [{ "name": "shared_my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012", "id": "/providers/Microsoft.PowerApps/apis/shared_my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012", "type": "Microsoft.PowerApps/apis", "properties": { "displayName": "My connector 2", "iconUri": "https://az787822.vo.msecnd.net/defaulticons/api-dedicated.png", "iconBrandColor": "#007ee5", "contact": {}, "license": {}, "apiEnvironment": "Shared", "isCustomApi": true, "connectionParameters": {}, "runtimeUrls": ["https://europe-002.azure-apim.net/apim/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012"], "primaryRuntimeUrl": "https://europe-002.azure-apim.net/apim/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012", "metadata": { "source": "powerapps-user-defined", "brandColor": "#007ee5", "contact": {}, "license": {}, "publisherUrl": null, "serviceUrl": null, "documentationUrl": null, "environmentName": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "xrmConnectorId": null, "almMode": "Environment", "createdBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "modifiedBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "allowSharing": false }, "capabilities": [], "description": "", "apiDefinitions": { "originalSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012.json_original?sv=2018-03-28&sr=b&sig=rwJTmpMb4jb88Fzd9hoz8UbX0ZNbNiz5Cy5yfqTxcjU%3D&se=2019-12-05T19%3A53%3A49Z&sp=r", "modifiedSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012.json?sv=2018-03-28&sr=b&sig=eCW8GUjWHkcB8CFFQ%2FSZAGNBCZeAqj4H9ngRbA%2Fa4CI%3D&se=2019-12-05T19%3A53%3A49Z&sp=r" }, "createdBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "modifiedBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "createdTime": "2019-12-05T18:51:54.3261899Z", "changedTime": "2019-12-05T18:51:54.3261899Z", "environment": { "id": "/providers/Microsoft.PowerApps/environments/Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "name": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6" }, "tier": "Standard", "publisher": "MOD Administrator", "almMode": "Environment" } }, { "name": "shared_my-20connector-5f0027f520b23e81c1-5f9888a90360086012", "id": "/providers/Microsoft.PowerApps/apis/shared_my-20connector-5f0027f520b23e81c1-5f9888a90360086012", "type": "Microsoft.PowerApps/apis", "properties": { "displayName": "My connector", "iconUri": "https://az787822.vo.msecnd.net/defaulticons/api-dedicated.png", "iconBrandColor": "#007ee5", "contact": {}, "license": {}, "apiEnvironment": "Shared", "isCustomApi": true, "connectionParameters": {}, "runtimeUrls": ["https://europe-002.azure-apim.net/apim/my-20connector-5f0027f520b23e81c1-5f9888a90360086012"], "primaryRuntimeUrl": "https://europe-002.azure-apim.net/apim/my-20connector-5f0027f520b23e81c1-5f9888a90360086012", "metadata": { "source": "powerapps-user-defined", "brandColor": "#007ee5", "contact": {}, "license": {}, "publisherUrl": null, "serviceUrl": null, "documentationUrl": null, "environmentName": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "xrmConnectorId": null, "almMode": "Environment", "createdBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "modifiedBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "allowSharing": false }, "capabilities": [], "description": "", "apiDefinitions": { "originalSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-5f0027f520b23e81c1-5f9888a90360086012.json_original?sv=2018-03-28&sr=b&sig=cOkjAecgpr6sSznMpDqiZitUOpVvVDJRCOZfe3VmReU%3D&se=2019-12-05T19%3A53%3A49Z&sp=r", "modifiedSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-5f0027f520b23e81c1-5f9888a90360086012.json?sv=2018-03-28&sr=b&sig=rkpKHP8K%2F2yNBIUQcVN%2B0ZPjnP9sECrM%2FfoZMG%2BJZX0%3D&se=2019-12-05T19%3A53%3A49Z&sp=r" }, "createdBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "modifiedBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "createdTime": "2019-12-05T18:45:03.4615313Z", "changedTime": "2019-12-05T18:45:03.4615313Z", "environment": { "id": "/providers/Microsoft.PowerApps/environments/Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "name": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6" }, "tier": "Standard", "publisher": "MOD Administrator", "almMode": "Environment" } }] });
}
}
return Promise.reject('Invalid request');
});
cmdInstance.action({ options: { debug: false, environment: 'Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6' } }, () => {
try {
assert(cmdInstanceLogSpy.calledWith([
{
name: 'shared_my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012',
displayName: 'My connector 2'
},
{
name: 'shared_my-20connector-5f0027f520b23e81c1-5f9888a90360086012',
displayName: 'My connector'
}
]));
done();
}
catch (e) {
done(e);
}
});
});
it('retrieves custom connectors in pages', (done) => {
sinon.stub(request, 'get').callsFake((opts) => {
if ((opts.url as string).indexOf('skiptoken') === -1) {
if (opts.headers &&
opts.headers.accept &&
opts.headers.accept.indexOf('application/json') === 0) {
return Promise.resolve({
"nextLink": "https://management.azure.com/providers/Microsoft.PowerApps/apis?api-version=2016-11-01&$filter=environment%20eq%20%27Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6%27%20and%20IsCustomApi%20eq%20%27True%27&%24skiptoken=eyJuZXh0TWFya2VyIjoiMjAxOTAyMDRUMTg1NDU2Wi02YTA5NGQwMi02NDFhLTQ4OTEtYjRkZi00NDA1OTRmMjZjODUifQ%3d%3d",
"value": [
{ "name": "shared_my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012", "id": "/providers/Microsoft.PowerApps/apis/shared_my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012", "type": "Microsoft.PowerApps/apis", "properties": { "displayName": "My connector 2", "iconUri": "https://az787822.vo.msecnd.net/defaulticons/api-dedicated.png", "iconBrandColor": "#007ee5", "contact": {}, "license": {}, "apiEnvironment": "Shared", "isCustomApi": true, "connectionParameters": {}, "runtimeUrls": ["https://europe-002.azure-apim.net/apim/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012"], "primaryRuntimeUrl": "https://europe-002.azure-apim.net/apim/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012", "metadata": { "source": "powerapps-user-defined", "brandColor": "#007ee5", "contact": {}, "license": {}, "publisherUrl": null, "serviceUrl": null, "documentationUrl": null, "environmentName": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "xrmConnectorId": null, "almMode": "Environment", "createdBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "modifiedBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "allowSharing": false }, "capabilities": [], "description": "", "apiDefinitions": { "originalSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012.json_original?sv=2018-03-28&sr=b&sig=rwJTmpMb4jb88Fzd9hoz8UbX0ZNbNiz5Cy5yfqTxcjU%3D&se=2019-12-05T19%3A53%3A49Z&sp=r", "modifiedSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012.json?sv=2018-03-28&sr=b&sig=eCW8GUjWHkcB8CFFQ%2FSZAGNBCZeAqj4H9ngRbA%2Fa4CI%3D&se=2019-12-05T19%3A53%3A49Z&sp=r" }, "createdBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "modifiedBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "createdTime": "2019-12-05T18:51:54.3261899Z", "changedTime": "2019-12-05T18:51:54.3261899Z", "environment": { "id": "/providers/Microsoft.PowerApps/environments/Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "name": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6" }, "tier": "Standard", "publisher": "MOD Administrator", "almMode": "Environment" } }
]
});
}
}
else {
return Promise.resolve({
"value": [
{ "name": "shared_my-20connector-5f0027f520b23e81c1-5f9888a90360086012", "id": "/providers/Microsoft.PowerApps/apis/shared_my-20connector-5f0027f520b23e81c1-5f9888a90360086012", "type": "Microsoft.PowerApps/apis", "properties": { "displayName": "My connector", "iconUri": "https://az787822.vo.msecnd.net/defaulticons/api-dedicated.png", "iconBrandColor": "#007ee5", "contact": {}, "license": {}, "apiEnvironment": "Shared", "isCustomApi": true, "connectionParameters": {}, "runtimeUrls": ["https://europe-002.azure-apim.net/apim/my-20connector-5f0027f520b23e81c1-5f9888a90360086012"], "primaryRuntimeUrl": "https://europe-002.azure-apim.net/apim/my-20connector-5f0027f520b23e81c1-5f9888a90360086012", "metadata": { "source": "powerapps-user-defined", "brandColor": "#007ee5", "contact": {}, "license": {}, "publisherUrl": null, "serviceUrl": null, "documentationUrl": null, "environmentName": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "xrmConnectorId": null, "almMode": "Environment", "createdBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "modifiedBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "allowSharing": false }, "capabilities": [], "description": "", "apiDefinitions": { "originalSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-5f0027f520b23e81c1-5f9888a90360086012.json_original?sv=2018-03-28&sr=b&sig=cOkjAecgpr6sSznMpDqiZitUOpVvVDJRCOZfe3VmReU%3D&se=2019-12-05T19%3A53%3A49Z&sp=r", "modifiedSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-5f0027f520b23e81c1-5f9888a90360086012.json?sv=2018-03-28&sr=b&sig=rkpKHP8K%2F2yNBIUQcVN%2B0ZPjnP9sECrM%2FfoZMG%2BJZX0%3D&se=2019-12-05T19%3A53%3A49Z&sp=r" }, "createdBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "modifiedBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "createdTime": "2019-12-05T18:45:03.4615313Z", "changedTime": "2019-12-05T18:45:03.4615313Z", "environment": { "id": "/providers/Microsoft.PowerApps/environments/Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "name": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6" }, "tier": "Standard", "publisher": "MOD Administrator", "almMode": "Environment" } }
]
});
}
return Promise.reject('Invalid request');
});
cmdInstance.action({ options: { debug: false, environment: 'Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6' } }, () => {
try {
assert(cmdInstanceLogSpy.calledWith([
{
name: 'shared_my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012',
displayName: 'My connector 2'
},
{
name: 'shared_my-20connector-5f0027f520b23e81c1-5f9888a90360086012',
displayName: 'My connector'
}
]));
done();
}
catch (e) {
done(e);
}
});
});
it('outputs all properties when output is JSON', (done) => {
sinon.stub(request, 'get').callsFake((opts) => {
if ((opts.url as string).indexOf(`providers/Microsoft.PowerApps/apis?api-version=2016-11-01&$filter=environment%20eq%20%27Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6%27%20and%20IsCustomApi%20eq%20%27True%27`) > -1) {
if (opts.headers &&
opts.headers.accept &&
opts.headers.accept.indexOf('application/json') === 0) {
return Promise.resolve({ "value": [{ "name": "shared_my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012", "id": "/providers/Microsoft.PowerApps/apis/shared_my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012", "type": "Microsoft.PowerApps/apis", "properties": { "displayName": "My connector 2", "iconUri": "https://az787822.vo.msecnd.net/defaulticons/api-dedicated.png", "iconBrandColor": "#007ee5", "contact": {}, "license": {}, "apiEnvironment": "Shared", "isCustomApi": true, "connectionParameters": {}, "runtimeUrls": ["https://europe-002.azure-apim.net/apim/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012"], "primaryRuntimeUrl": "https://europe-002.azure-apim.net/apim/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012", "metadata": { "source": "powerapps-user-defined", "brandColor": "#007ee5", "contact": {}, "license": {}, "publisherUrl": null, "serviceUrl": null, "documentationUrl": null, "environmentName": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "xrmConnectorId": null, "almMode": "Environment", "createdBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "modifiedBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "allowSharing": false }, "capabilities": [], "description": "", "apiDefinitions": { "originalSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012.json_original?sv=2018-03-28&sr=b&sig=rwJTmpMb4jb88Fzd9hoz8UbX0ZNbNiz5Cy5yfqTxcjU%3D&se=2019-12-05T19%3A53%3A49Z&sp=r", "modifiedSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012.json?sv=2018-03-28&sr=b&sig=eCW8GUjWHkcB8CFFQ%2FSZAGNBCZeAqj4H9ngRbA%2Fa4CI%3D&se=2019-12-05T19%3A53%3A49Z&sp=r" }, "createdBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "modifiedBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "createdTime": "2019-12-05T18:51:54.3261899Z", "changedTime": "2019-12-05T18:51:54.3261899Z", "environment": { "id": "/providers/Microsoft.PowerApps/environments/Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "name": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6" }, "tier": "Standard", "publisher": "MOD Administrator", "almMode": "Environment" } }, { "name": "shared_my-20connector-5f0027f520b23e81c1-5f9888a90360086012", "id": "/providers/Microsoft.PowerApps/apis/shared_my-20connector-5f0027f520b23e81c1-5f9888a90360086012", "type": "Microsoft.PowerApps/apis", "properties": { "displayName": "My connector", "iconUri": "https://az787822.vo.msecnd.net/defaulticons/api-dedicated.png", "iconBrandColor": "#007ee5", "contact": {}, "license": {}, "apiEnvironment": "Shared", "isCustomApi": true, "connectionParameters": {}, "runtimeUrls": ["https://europe-002.azure-apim.net/apim/my-20connector-5f0027f520b23e81c1-5f9888a90360086012"], "primaryRuntimeUrl": "https://europe-002.azure-apim.net/apim/my-20connector-5f0027f520b23e81c1-5f9888a90360086012", "metadata": { "source": "powerapps-user-defined", "brandColor": "#007ee5", "contact": {}, "license": {}, "publisherUrl": null, "serviceUrl": null, "documentationUrl": null, "environmentName": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "xrmConnectorId": null, "almMode": "Environment", "createdBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "modifiedBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "allowSharing": false }, "capabilities": [], "description": "", "apiDefinitions": { "originalSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-5f0027f520b23e81c1-5f9888a90360086012.json_original?sv=2018-03-28&sr=b&sig=cOkjAecgpr6sSznMpDqiZitUOpVvVDJRCOZfe3VmReU%3D&se=2019-12-05T19%3A53%3A49Z&sp=r", "modifiedSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-5f0027f520b23e81c1-5f9888a90360086012.json?sv=2018-03-28&sr=b&sig=rkpKHP8K%2F2yNBIUQcVN%2B0ZPjnP9sECrM%2FfoZMG%2BJZX0%3D&se=2019-12-05T19%3A53%3A49Z&sp=r" }, "createdBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "modifiedBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "createdTime": "2019-12-05T18:45:03.4615313Z", "changedTime": "2019-12-05T18:45:03.4615313Z", "environment": { "id": "/providers/Microsoft.PowerApps/environments/Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "name": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6" }, "tier": "Standard", "publisher": "MOD Administrator", "almMode": "Environment" } }] });
}
}
return Promise.reject('Invalid request');
});
cmdInstance.action({ options: { debug: false, environment: 'Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6', output: 'json' } }, () => {
try {
assert(cmdInstanceLogSpy.calledWith([{ "name": "shared_my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012", "id": "/providers/Microsoft.PowerApps/apis/shared_my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012", "type": "Microsoft.PowerApps/apis", "properties": { "displayName": "My connector 2", "iconUri": "https://az787822.vo.msecnd.net/defaulticons/api-dedicated.png", "iconBrandColor": "#007ee5", "contact": {}, "license": {}, "apiEnvironment": "Shared", "isCustomApi": true, "connectionParameters": {}, "runtimeUrls": ["https://europe-002.azure-apim.net/apim/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012"], "primaryRuntimeUrl": "https://europe-002.azure-apim.net/apim/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012", "metadata": { "source": "powerapps-user-defined", "brandColor": "#007ee5", "contact": {}, "license": {}, "publisherUrl": null, "serviceUrl": null, "documentationUrl": null, "environmentName": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "xrmConnectorId": null, "almMode": "Environment", "createdBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "modifiedBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "allowSharing": false }, "capabilities": [], "description": "", "apiDefinitions": { "originalSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012.json_original?sv=2018-03-28&sr=b&sig=rwJTmpMb4jb88Fzd9hoz8UbX0ZNbNiz5Cy5yfqTxcjU%3D&se=2019-12-05T19%3A53%3A49Z&sp=r", "modifiedSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012.json?sv=2018-03-28&sr=b&sig=eCW8GUjWHkcB8CFFQ%2FSZAGNBCZeAqj4H9ngRbA%2Fa4CI%3D&se=2019-12-05T19%3A53%3A49Z&sp=r" }, "createdBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "modifiedBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "createdTime": "2019-12-05T18:51:54.3261899Z", "changedTime": "2019-12-05T18:51:54.3261899Z", "environment": { "id": "/providers/Microsoft.PowerApps/environments/Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "name": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6" }, "tier": "Standard", "publisher": "MOD Administrator", "almMode": "Environment" } }, { "name": "shared_my-20connector-5f0027f520b23e81c1-5f9888a90360086012", "id": "/providers/Microsoft.PowerApps/apis/shared_my-20connector-5f0027f520b23e81c1-5f9888a90360086012", "type": "Microsoft.PowerApps/apis", "properties": { "displayName": "My connector", "iconUri": "https://az787822.vo.msecnd.net/defaulticons/api-dedicated.png", "iconBrandColor": "#007ee5", "contact": {}, "license": {}, "apiEnvironment": "Shared", "isCustomApi": true, "connectionParameters": {}, "runtimeUrls": ["https://europe-002.azure-apim.net/apim/my-20connector-5f0027f520b23e81c1-5f9888a90360086012"], "primaryRuntimeUrl": "https://europe-002.azure-apim.net/apim/my-20connector-5f0027f520b23e81c1-5f9888a90360086012", "metadata": { "source": "powerapps-user-defined", "brandColor": "#007ee5", "contact": {}, "license": {}, "publisherUrl": null, "serviceUrl": null, "documentationUrl": null, "environmentName": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "xrmConnectorId": null, "almMode": "Environment", "createdBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "modifiedBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "allowSharing": false }, "capabilities": [], "description": "", "apiDefinitions": { "originalSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-5f0027f520b23e81c1-5f9888a90360086012.json_original?sv=2018-03-28&sr=b&sig=cOkjAecgpr6sSznMpDqiZitUOpVvVDJRCOZfe3VmReU%3D&se=2019-12-05T19%3A53%3A49Z&sp=r", "modifiedSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-5f0027f520b23e81c1-5f9888a90360086012.json?sv=2018-03-28&sr=b&sig=rkpKHP8K%2F2yNBIUQcVN%2B0ZPjnP9sECrM%2FfoZMG%2BJZX0%3D&se=2019-12-05T19%3A53%3A49Z&sp=r" }, "createdBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "modifiedBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "createdTime": "2019-12-05T18:45:03.4615313Z", "changedTime": "2019-12-05T18:45:03.4615313Z", "environment": { "id": "/providers/Microsoft.PowerApps/environments/Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "name": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6" }, "tier": "Standard", "publisher": "MOD Administrator", "almMode": "Environment" } }]));
done();
}
catch (e) {
done(e);
}
});
});
it('correctly handles no environment found', (done) => {
sinon.stub(request, 'get').callsFake((opts) => {
return Promise.reject({
"error": {
"code": "EnvironmentAccessDenied",
"message": "The environment 'Default-d87a7535-dd31-4437-bfe1-95340acd55c6' could not be found in the tenant '0d645e38-ec52-4a4f-ac58-65f2ac4015f6'."
}
});
});
cmdInstance.action({ options: { debug: false, environment: 'Default-d87a7535-dd31-4437-bfe1-95340acd55c6' } }, (err?: any) => {
try {
assert.equal(JSON.stringify(err), JSON.stringify(new CommandError(`The environment 'Default-d87a7535-dd31-4437-bfe1-95340acd55c6' could not be found in the tenant '0d645e38-ec52-4a4f-ac58-65f2ac4015f6'.`)));
done();
}
catch (e) {
done(e);
}
});
});
it('correctly handles no custom connectors found', (done) => {
sinon.stub(request, 'get').callsFake((opts) => {
return Promise.resolve({ value: [] });
});
cmdInstance.action({ options: { debug: false, environment: 'Default-d87a7535-dd31-4437-bfe1-95340acd55c6' } }, () => {
try {
assert(cmdInstanceLogSpy.notCalled);
done();
}
catch (e) {
done(e);
}
});
});
it('correctly handles no custom connectors found (debug)', (done) => {
sinon.stub(request, 'get').callsFake((opts) => {
return Promise.resolve({ value: [] });
});
cmdInstance.action({ options: { debug: true, environment: 'Default-d87a7535-dd31-4437-bfe1-95340acd55c6' } }, () => {
try {
assert(cmdInstanceLogSpy.calledWith('No custom connectors found'));
done();
}
catch (e) {
done(e);
}
});
});
it('correctly handles API OData error', (done) => {
sinon.stub(request, 'get').callsFake((opts) => {
return Promise.reject({
error: {
'odata.error': {
code: '-1, InvalidOperationException',
message: {
value: 'An error has occurred'
}
}
}
});
});
cmdInstance.action({ options: { debug: false, environment: 'Default-d87a7535-dd31-4437-bfe1-95340acd55c5' } }, (err?: any) => {
try {
assert.equal(JSON.stringify(err), JSON.stringify(new CommandError('An error has occurred')));
done();
}
catch (e) {
done(e);
}
});
});
it('correctly handles error when retrieving the second page of data', (done) => {
sinon.stub(request, 'get').callsFake((opts) => {
if ((opts.url as string).indexOf('skiptoken') === -1) {
if (opts.headers &&
opts.headers.accept &&
opts.headers.accept.indexOf('application/json') === 0) {
return Promise.resolve({
"nextLink": "https://management.azure.com/providers/Microsoft.PowerApps/apis?api-version=2016-11-01&$filter=environment%20eq%20%27Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6%27%20and%20IsCustomApi%20eq%20%27True%27&%24skiptoken=eyJuZXh0TWFya2VyIjoiMjAxOTAyMDRUMTg1NDU2Wi02YTA5NGQwMi02NDFhLTQ4OTEtYjRkZi00NDA1OTRmMjZjODUifQ%3d%3d",
"value": [
{ "name": "shared_my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012", "id": "/providers/Microsoft.PowerApps/apis/shared_my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012", "type": "Microsoft.PowerApps/apis", "properties": { "displayName": "My connector 2", "iconUri": "https://az787822.vo.msecnd.net/defaulticons/api-dedicated.png", "iconBrandColor": "#007ee5", "contact": {}, "license": {}, "apiEnvironment": "Shared", "isCustomApi": true, "connectionParameters": {}, "runtimeUrls": ["https://europe-002.azure-apim.net/apim/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012"], "primaryRuntimeUrl": "https://europe-002.azure-apim.net/apim/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012", "metadata": { "source": "powerapps-user-defined", "brandColor": "#007ee5", "contact": {}, "license": {}, "publisherUrl": null, "serviceUrl": null, "documentationUrl": null, "environmentName": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "xrmConnectorId": null, "almMode": "Environment", "createdBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "modifiedBy": "{\"id\":\"03043611-d01e-4e58-9fbe-1a18ecb861d8\",\"displayName\":\"MOD Administrator\",\"email\":\"[email protected]\",\"type\":\"User\",\"tenantId\":\"0d645e38-ec52-4a4f-ac58-65f2ac4015f6\",\"userPrincipalName\":\"[email protected]\"}", "allowSharing": false }, "capabilities": [], "description": "", "apiDefinitions": { "originalSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012.json_original?sv=2018-03-28&sr=b&sig=rwJTmpMb4jb88Fzd9hoz8UbX0ZNbNiz5Cy5yfqTxcjU%3D&se=2019-12-05T19%3A53%3A49Z&sp=r", "modifiedSwaggerUrl": "https://paeu2weu8.blob.core.windows.net/api-swagger-files/my-20connector-202-5f0027f520b23e81c1-5f9888a90360086012.json?sv=2018-03-28&sr=b&sig=eCW8GUjWHkcB8CFFQ%2FSZAGNBCZeAqj4H9ngRbA%2Fa4CI%3D&se=2019-12-05T19%3A53%3A49Z&sp=r" }, "createdBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "modifiedBy": { "id": "03043611-d01e-4e58-9fbe-1a18ecb861d8", "displayName": "MOD Administrator", "email": "[email protected]", "type": "User", "tenantId": "0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "userPrincipalName": "[email protected]" }, "createdTime": "2019-12-05T18:51:54.3261899Z", "changedTime": "2019-12-05T18:51:54.3261899Z", "environment": { "id": "/providers/Microsoft.PowerApps/environments/Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6", "name": "Default-0d645e38-ec52-4a4f-ac58-65f2ac4015f6" }, "tier": "Standard", "publisher": "MOD Administrator", "almMode": "Environment" } }
]
});
}
}
else {
return Promise.reject({
error: {
'odata.error': {
code: '-1, InvalidOperationException',
message: {
value: 'An error has occurred'
}
}
}
});
}
return Promise.reject('Invalid request');
});
cmdInstance.action({ options: { debug: false, environment: 'Default-d87a7535-dd31-4437-bfe1-95340acd55c5' } }, (err?: any) => {
try {
assert.equal(JSON.stringify(err), JSON.stringify(new CommandError('An error has occurred')));
done();
}
catch (e) {
done(e);
}
});
});
it('fails validation if the environment name is not specified', () => {
const actual = (command.validate() as CommandValidate)({ options: {} });
assert.notEqual(actual, true);
});
it('passes validation when the environment name option specified', () => {
const actual = (command.validate() as CommandValidate)({ options: { environment: 'Default-d87a7535-dd31-4437-bfe1-95340acd55c5' } });
assert.equal(actual, true);
});
it('supports debug mode', () => {
const options = (command.options() as CommandOption[]);
let containsOption = false;
options.forEach(o => {
if (o.option === '--debug') {
containsOption = true;
}
});
assert(containsOption);
});
it('supports specifying environment name', () => {
const options = (command.options() as CommandOption[]);
let containsOption = false;
options.forEach(o => {
if (o.option.indexOf('--environment') > -1) {
containsOption = true;
}
});
assert(containsOption);
});
it('has help referring to the right command', () => {
const cmd: any = {
log: (msg: string) => { },
prompt: () => { },
helpInformation: () => { }
};
const find = sinon.stub(vorpal, 'find').callsFake(() => cmd);
cmd.help = command.help();
cmd.help({}, () => { });
assert(find.calledWith(commands.CONNECTOR_LIST));
});
it('has help with examples', () => {
const _log: string[] = [];
const cmd: any = {
log: (msg: string) => {
_log.push(msg);
},
prompt: () => { },
helpInformation: () => { }
};
sinon.stub(vorpal, 'find').callsFake(() => cmd);
cmd.help = command.help();
cmd.help({}, () => { });
let containsExamples: boolean = false;
_log.forEach(l => {
if (l && l.indexOf('Examples:') > -1) {
containsExamples = true;
}
});
Utils.restore(vorpal.find);
assert(containsExamples);
});
}); | {
"pile_set_name": "Github"
} |
#if defined(Hiro_ComboButton)
namespace hiro {
struct pComboButtonItem : pObject {
Declare(ComboButtonItem, Object)
auto setIcon(const image& icon) -> void;
auto setSelected() -> void;
auto setText(const string& text) -> void;
auto _parent() -> maybe<pComboButton&>;
};
}
#endif
| {
"pile_set_name": "Github"
} |
<?php
declare(strict_types=1);
/**
* @copyright 2017 Christoph Wurst <[email protected]>
*
* @author 2017 Christoph Wurst <[email protected]>
*
* @license GNU AGPL version 3 or any later version
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as
* published by the Free Software Foundation, either version 3 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. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
namespace OCA\Mail\Service\Avatar;
interface IAvatarSource {
/**
* Does this source query external services?
*
* @return bool
*/
public function isExternal():bool ;
/**
* @param string $email sender email address
* @param AvatarFactory $factory
* @return Avatar|null avatar URL if one can be found
*/
public function fetch(string $email, AvatarFactory $factory);
}
| {
"pile_set_name": "Github"
} |
# This file was created by Jacques Savoy and is distributed under the BSD license.
# See http://members.unine.ch/jacques.savoy/clef/index.html.
# Also see http://www.opensource.org/licenses/bsd-license.html
# Cleaned on October 11, 2009 (not normalized, so use before normalization)
# This means that when modifying this list, you might need to add some
# redundant entries, for example containing forms with both أ and ا
من
ومن
منها
منه
في
وفي
فيها
فيه
و
ف
ثم
او
أو
ب
بها
به
ا
أ
اى
اي
أي
أى
لا
ولا
الا
ألا
إلا
لكن
ما
وما
كما
فما
عن
مع
اذا
إذا
ان
أن
إن
انها
أنها
إنها
انه
أنه
إنه
بان
بأن
فان
فأن
وان
وأن
وإن
التى
التي
الذى
الذي
الذين
الى
الي
إلى
إلي
على
عليها
عليه
اما
أما
إما
ايضا
أيضا
كل
وكل
لم
ولم
لن
ولن
هى
هي
هو
وهى
وهي
وهو
فهى
فهي
فهو
انت
أنت
لك
لها
له
هذه
هذا
تلك
ذلك
هناك
كانت
كان
يكون
تكون
وكانت
وكان
غير
بعض
قد
نحو
بين
بينما
منذ
ضمن
حيث
الان
الآن
خلال
بعد
قبل
حتى
عند
عندما
لدى
جميع
| {
"pile_set_name": "Github"
} |
// install : cordova plugin add https://github.com/floatinghotpot/cordova-plugin-facebookads.git
// link : https://github.com/floatinghotpot/cordova-plugin-facebookads
angular.module('ngCordova.plugins.facebookAds', [])
.factory('$cordovaFacebookAds', ['$q', '$window', function ($q, $window) {
return {
setOptions: function (options) {
var d = $q.defer();
$window.FacebookAds.setOptions(options, function () {
d.resolve();
}, function () {
d.reject();
});
return d.promise;
},
createBanner: function (options) {
var d = $q.defer();
$window.FacebookAds.createBanner(options, function () {
d.resolve();
}, function () {
d.reject();
});
return d.promise;
},
removeBanner: function () {
var d = $q.defer();
$window.FacebookAds.removeBanner(function () {
d.resolve();
}, function () {
d.reject();
});
return d.promise;
},
showBanner: function (position) {
var d = $q.defer();
$window.FacebookAds.showBanner(position, function () {
d.resolve();
}, function () {
d.reject();
});
return d.promise;
},
showBannerAtXY: function (x, y) {
var d = $q.defer();
$window.FacebookAds.showBannerAtXY(x, y, function () {
d.resolve();
}, function () {
d.reject();
});
return d.promise;
},
hideBanner: function () {
var d = $q.defer();
$window.FacebookAds.hideBanner(function () {
d.resolve();
}, function () {
d.reject();
});
return d.promise;
},
prepareInterstitial: function (options) {
var d = $q.defer();
$window.FacebookAds.prepareInterstitial(options, function () {
d.resolve();
}, function () {
d.reject();
});
return d.promise;
},
showInterstitial: function () {
var d = $q.defer();
$window.FacebookAds.showInterstitial(function () {
d.resolve();
}, function () {
d.reject();
});
return d.promise;
}
};
}]);
| {
"pile_set_name": "Github"
} |
# CentOS daemon scripts for gitlab service
## Related (kudos @4sak3n0ne):
* https://github.com/gitlabhq/gitlabhq/issues/1049#issuecomment-8386882
* https://gist.github.com/3062860
## Notes
Add the service to chkconfig with:
chkconfig --add gitlab
Related services (redis, mysql, nginx) should also be added to chkconfig.
Check chkconfig state with
chkconfig -l
And if any of the services are not set properly, run:
chkconfig --levels 2345 [name] on
| {
"pile_set_name": "Github"
} |
web: bundle exec unicorn -c ./config/unicorn.rb
worker: bundle exec sidekiq -c 5 -r ./app.rb
redis: redis-server ./config/redis.conf
| {
"pile_set_name": "Github"
} |
package com.artemis.prefab;
import com.artemis.io.SerializationException;
public class MissingPrefabDataException extends SerializationException {
public MissingPrefabDataException() {
}
public MissingPrefabDataException(String message) {
super(message);
}
public MissingPrefabDataException(String message, Throwable cause) {
super(message, cause);
}
public MissingPrefabDataException(Throwable cause) {
super(cause);
}
}
| {
"pile_set_name": "Github"
} |
created: 20150719182943383
modified: 20150719182947178
tags:
title: Edit Existing Items
\define thisMakeTabs()
<<tabs '[prefix[$:/settings/$(ThisResume)$/]show[true]get[template]get[input_tiddler]]' default:[[Contact Information]]>>
\end
Each tab lets you edit the contents of that section. Click on the `Preview and Set Options` button to see a preview of the finished resume and for layout options.
<$vars ThisResume={{$:/settings/Global!!selected_resume}}>
<<thisMakeTabs>>
</$vars>
<!--<$button to="Preview and Set Options">Open Preview and Options</$button>--> | {
"pile_set_name": "Github"
} |
require 'rack/file'
module Rack
# = Sendfile
#
# The Sendfile middleware intercepts responses whose body is being
# served from a file and replaces it with a server specific X-Sendfile
# header. The web server is then responsible for writing the file contents
# to the client. This can dramatically reduce the amount of work required
# by the Ruby backend and takes advantage of the web server's optimized file
# delivery code.
#
# In order to take advantage of this middleware, the response body must
# respond to +to_path+ and the request must include an X-Sendfile-Type
# header. Rack::File and other components implement +to_path+ so there's
# rarely anything you need to do in your application. The X-Sendfile-Type
# header is typically set in your web servers configuration. The following
# sections attempt to document
#
# === Nginx
#
# Nginx supports the X-Accel-Redirect header. This is similar to X-Sendfile
# but requires parts of the filesystem to be mapped into a private URL
# hierarachy.
#
# The following example shows the Nginx configuration required to create
# a private "/files/" area, enable X-Accel-Redirect, and pass the special
# X-Sendfile-Type and X-Accel-Mapping headers to the backend:
#
# location ~ /files/(.*) {
# internal;
# alias /var/www/$1;
# }
#
# location / {
# proxy_redirect off;
#
# proxy_set_header Host $host;
# proxy_set_header X-Real-IP $remote_addr;
# proxy_set_header X-Forwarded-For $proxy_add_x_forwarded_for;
#
# proxy_set_header X-Sendfile-Type X-Accel-Redirect;
# proxy_set_header X-Accel-Mapping /var/www/=/files/;
#
# proxy_pass http://127.0.0.1:8080/;
# }
#
# Note that the X-Sendfile-Type header must be set exactly as shown above.
# The X-Accel-Mapping header should specify the location on the file system,
# followed by an equals sign (=), followed name of the private URL pattern
# that it maps to. The middleware performs a simple substitution on the
# resulting path.
#
# See Also: http://wiki.codemongers.com/NginxXSendfile
#
# === lighttpd
#
# Lighttpd has supported some variation of the X-Sendfile header for some
# time, although only recent version support X-Sendfile in a reverse proxy
# configuration.
#
# $HTTP["host"] == "example.com" {
# proxy-core.protocol = "http"
# proxy-core.balancer = "round-robin"
# proxy-core.backends = (
# "127.0.0.1:8000",
# "127.0.0.1:8001",
# ...
# )
#
# proxy-core.allow-x-sendfile = "enable"
# proxy-core.rewrite-request = (
# "X-Sendfile-Type" => (".*" => "X-Sendfile")
# )
# }
#
# See Also: http://redmine.lighttpd.net/wiki/lighttpd/Docs:ModProxyCore
#
# === Apache
#
# X-Sendfile is supported under Apache 2.x using a separate module:
#
# https://tn123.org/mod_xsendfile/
#
# Once the module is compiled and installed, you can enable it using
# XSendFile config directive:
#
# RequestHeader Set X-Sendfile-Type X-Sendfile
# ProxyPassReverse / http://localhost:8001/
# XSendFile on
class Sendfile
F = ::File
def initialize(app, variation=nil)
@app = app
@variation = variation
end
def call(env)
status, headers, body = @app.call(env)
if body.respond_to?(:to_path)
case type = variation(env)
when 'X-Accel-Redirect'
path = F.expand_path(body.to_path)
if url = map_accel_path(env, path)
headers['Content-Length'] = '0'
headers[type] = url
body = []
else
env['rack.errors'].puts "X-Accel-Mapping header missing"
end
when 'X-Sendfile', 'X-Lighttpd-Send-File'
path = F.expand_path(body.to_path)
headers['Content-Length'] = '0'
headers[type] = path
body = []
when '', nil
else
env['rack.errors'].puts "Unknown x-sendfile variation: '#{variation}'.\n"
end
end
[status, headers, body]
end
private
def variation(env)
@variation ||
env['sendfile.type'] ||
env['HTTP_X_SENDFILE_TYPE']
end
def map_accel_path(env, file)
if mapping = env['HTTP_X_ACCEL_MAPPING']
internal, external = mapping.split('=', 2).map{ |p| p.strip }
file.sub(/^#{internal}/i, external)
end
end
end
end
| {
"pile_set_name": "Github"
} |
using System.Runtime.InteropServices;
namespace SharpLearning.Containers.Views
{
/// <summary>
/// F64Matrix column view using pointers
/// </summary>
[StructLayout(LayoutKind.Sequential)]
public unsafe struct F64MatrixColumnView
{
const int SizeOfType = sizeof(double);
readonly double* m_dataPtr;
readonly int m_strideInBytes;
/// <summary>
/// Creates a column view from the provided data ptr, number of rows and stride
/// </summary>
/// <param name="dataPtr"></param>
/// <param name="rows"></param>
/// <param name="strideInBytes"></param>
public F64MatrixColumnView(double* dataPtr, int rows, int strideInBytes)
{
m_dataPtr = dataPtr;
Rows = rows;
m_strideInBytes = strideInBytes;
}
/// <summary>
/// Gets the row item from the specified position
/// </summary>
/// <param name="row"></param>
/// <returns></returns>
public double this[int row]
{
get { return *RowPtr(row); }
set { *RowPtr(row) = value; }
}
/// <summary>
/// Gets the number of rows
/// </summary>
public int Rows { get; private set; }
/// <summary>
/// Gets the interval of the column view
/// </summary>
public Interval1D Interval { get { return new Interval1D(0, Rows); } }
double* RowPtr(int row)
{
return (double*)((byte*)m_dataPtr + (long)row * m_strideInBytes);
}
}
}
| {
"pile_set_name": "Github"
} |
View_0=This is a hardcoded text
| {
"pile_set_name": "Github"
} |
<?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>IDEWorkspaceUserSettings_HasAskedToTakeAutomaticSnapshotBeforeSignificantChanges</key>
<true/>
<key>IDEWorkspaceUserSettings_SnapshotAutomaticallyBeforeSignificantChanges</key>
<true/>
</dict>
</plist>
| {
"pile_set_name": "Github"
} |
/* *******************************************************************
* Copyright (c) 1999-2001 Xerox Corporation,
* 2002 Palo Alto Research Center, Incorporated (PARC).
* All rights reserved.
* This program and the accompanying materials are made available
* under the terms of the Eclipse Public License v1.0
* which accompanies this distribution and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* Xerox/PARC initial implementation
* ******************************************************************/
package org.aspectj.ajde;
import java.io.IOException;
import java.util.List;
import org.aspectj.bridge.ISourceLocation;
/**
* @author Mik Kersten
*/
public interface EditorAdapter {
/**
* Seek the editor to a source line in the file specified.
*/
void showSourceLine(String filePath, int lineNumber, boolean highlight);
/**
* Seek the editor to a SourceLocation and highlight if specified.
*/
void showSourceLine(ISourceLocation sourceLocation, boolean highlight);
/**
* Seek the editor to a source line in the current file.
*/
void showSourceLine(int lineNumber, boolean highlight);
/**
* @return full path to the file currently being edited.
*/
String getCurrFile();
/**
* Save the contents of the current file being edited.
*/
void saveContents() throws IOException;
/**
* Paste text into the current caret position of the editor.
*/
void pasteToCaretPos(String text);
/**
* Implement if inline annotations are supported by the editor. Make null
* implementation if inline annotations are not supported.
*
* @param filePath path to the file that should get the annotation
* @param lineNumber line number for the annotation
* @param items list of relations to be rendered as the annotation
*/
void showSourcelineAnnotation(String filePath, int lineNumber, List items);
/**
* Implement if multipe editor views are supported by the editor. Make null
* implementation if multiple editor views are not supported.
*
* @param filePath path to the source file
* @param lineNumber line number of the sourceline
*/
//public void addEditorViewForSourceLine(String filePath, int lineNumber);
}
| {
"pile_set_name": "Github"
} |
<?php
declare(strict_types=1);
namespace Tests\Commands\Upgrade\Databases\V10_0_0\Seeds;
use Illuminate\Database\Seeder;
use Illuminate\Support\Facades\DB;
class ConsolesTableSeeder extends Seeder
{
/**
* Run the database seeds.
*
* @return void
*/
public function run()
{
DB::table('consoles')->truncate();
DB::table('consoles')->insert([
[
'id' => 1,
'name' => 'App\Console\Commands\Upgrade\V5_5_5_0',
'created_at' => '2018-09-27 22:26:00',
'updated_at' => '2018-09-27 22:26:00',
'deleted_at' => null,
],
[
'id' => 3,
'name' => 'App\Console\Commands\Upgrade\V5_5_6_0',
'created_at' => '2018-09-28 10:26:00',
'updated_at' => '2018-09-28 10:26:00',
'deleted_at' => null,
],
[
'id' => 4,
'name' => 'App\Console\Commands\Upgrade\V5_5_7_0',
'created_at' => '2018-11-06 22:26:00',
'updated_at' => '2018-11-06 22:26:00',
'deleted_at' => null,
],
[
'id' => 5,
'name' => 'App\Console\Commands\Upgrade\V5_5_8_0',
'created_at' => '2018-12-31 21:03:00',
'updated_at' => '2018-12-31 21:03:00',
'deleted_at' => null,
],
[
'id' => 6,
'name' => 'App\Console\Commands\Upgrade\V5_5_9_0',
'created_at' => '2018-12-31 21:03:00',
'updated_at' => '2018-12-31 21:03:00',
'deleted_at' => null,
],
[
'id' => 7,
'name' => 'App\Console\Commands\Upgrade\V5_5_10_0',
'created_at' => '2018-12-31 21:03:00',
'updated_at' => '2018-12-31 21:03:00',
'deleted_at' => null,
],
[
'id' => 8,
'name' => 'App\Console\Commands\Upgrade\V5_5_11_0',
'created_at' => '2019-02-26 21:10:00',
'updated_at' => '2019-02-26 21:10:00',
'deleted_at' => null,
],
[
'id' => 9,
'name' => 'App\Console\Commands\Upgrade\V5_8_1_0',
'created_at' => '2019-02-26 21:10:00',
'updated_at' => '2019-02-26 21:10:00',
'deleted_at' => null,
],
[
'id' => 10,
'name' => 'App\Console\Commands\Upgrade\V5_8_2_0',
'created_at' => '2019-02-26 21:10:00',
'updated_at' => '2019-02-26 21:10:00',
'deleted_at' => null,
],
[
'id' => 11,
'name' => 'App\Console\Commands\Upgrade\V5_8_3_0',
'created_at' => '2019-05-17 21:10:00',
'updated_at' => '2019-05-17 21:10:00',
'deleted_at' => null,
],
[
'id' => 12,
'name' => 'App\Console\Commands\Upgrade\V5_8_4_0',
'created_at' => '2019-05-19 18:28:00',
'updated_at' => '2019-05-19 18:28:00',
'deleted_at' => null,
],
[
'id' => 13,
'name' => 'App\Console\Commands\Upgrade\V5_8_5_0',
'created_at' => '2019-06-01 18:28:00',
'updated_at' => '2019-06-01 18:28:00',
'deleted_at' => null,
],
[
'id' => 14,
'name' => 'App\Console\Commands\Upgrade\V5_8_6_0',
'created_at' => '2019-06-22 18:28:00',
'updated_at' => '2019-06-22 18:28:00',
'deleted_at' => null,
],
[
'id' => 15,
'name' => 'App\Console\Commands\Upgrade\V5_8_7_0',
'created_at' => '2019-06-28 18:28:00',
'updated_at' => '2019-06-28 18:28:00',
'deleted_at' => null,
],
[
'id' => 16,
'name' => 'App\Console\Commands\Upgrade\V5_8_8_0',
'created_at' => '2019-07-01 22:28:00',
'updated_at' => '2019-07-01 22:28:00',
'deleted_at' => null,
],
[
'id' => 18,
'name' => 'App\Console\Commands\Upgrade\V5_8_9_0',
'created_at' => '2019-07-27 14:28:00',
'updated_at' => '2019-07-27 14:28:00',
'deleted_at' => null,
],
[
'id' => 19,
'name' => 'App\Console\Commands\Upgrade\V5_8_10_0',
'created_at' => '2019-08-02 22:01:00',
'updated_at' => '2019-08-02 22:01:00',
'deleted_at' => null,
],
[
'id' => 20,
'name' => 'App\Console\Commands\Upgrade\V5_8_11_0',
'created_at' => '2019-08-05 22:11:00',
'updated_at' => '2019-08-05 22:11:00',
'deleted_at' => null,
],
[
'id' => 21,
'name' => 'App\Console\Commands\Upgrade\V6_0_0',
'created_at' => '2019-09-18 22:30:00',
'updated_at' => '2019-09-18 22:30:00',
'deleted_at' => null,
],
[
'id' => 22,
'name' => 'App\Console\Commands\Upgrade\V6_1_0',
'created_at' => '2019-09-28 22:30:00',
'updated_at' => '2019-09-28 22:30:00',
'deleted_at' => null,
],
[
'id' => 23,
'name' => 'App\Console\Commands\Upgrade\V6_2_0',
'created_at' => '2019-10-20 10:30:00',
'updated_at' => '2019-10-20 10:30:00',
'deleted_at' => null,
],
[
'id' => 24,
'name' => 'App\Console\Commands\Upgrade\V6_3_0',
'created_at' => '2019-10-26 13:35:00',
'updated_at' => '2019-10-26 13:35:00',
'deleted_at' => null,
],
[
'id' => 25,
'name' => 'App\Console\Commands\Upgrade\V6_4_0',
'created_at' => '2019-11-09 10:35:00',
'updated_at' => '2019-11-09 10:35:00',
'deleted_at' => null,
],
[
'id' => 26,
'name' => 'App\Console\Commands\Upgrade\V6_5_0',
'created_at' => '2019-11-09 10:35:00',
'updated_at' => '2019-11-09 10:35:00',
'deleted_at' => null,
],
[
'id' => 27,
'name' => 'App\Console\Commands\Upgrade\V6_6_0',
'created_at' => '2019-12-14 13:03:00',
'updated_at' => '2019-12-14 13:03:00',
'deleted_at' => null,
],
[
'id' => 28,
'name' => 'App\Console\Commands\Upgrade\V6_7_0',
'created_at' => '2019-12-21 11:03:00',
'updated_at' => '2019-12-21 11:03:00',
'deleted_at' => null,
],
[
'id' => 29,
'name' => 'App\Console\Commands\Upgrade\V6_8_0',
'created_at' => '2019-12-27 22:13:00',
'updated_at' => '2019-12-27 22:13:00',
'deleted_at' => null,
],
[
'id' => 30,
'name' => 'App\Console\Commands\Upgrade\V6_9_0',
'created_at' => '2020-01-03 22:13:00',
'updated_at' => '2020-01-03 22:13:00',
'deleted_at' => null,
],
[
'id' => 31,
'name' => 'App\Console\Commands\Upgrade\V6_10_0',
'created_at' => '2020-01-17 22:13:00',
'updated_at' => '2020-01-17 22:13:00',
'deleted_at' => null,
],
[
'id' => 32,
'name' => 'App\Console\Commands\Upgrade\V6_11_0',
'created_at' => '2020-01-20 22:13:00',
'updated_at' => '2020-01-20 22:13:00',
'deleted_at' => null,
],
[
'id' => 33,
'name' => 'App\Console\Commands\Upgrade\V6_12_0',
'created_at' => '2020-01-27 22:13:00',
'updated_at' => '2020-01-27 22:13:00',
'deleted_at' => null,
],
[
'id' => 34,
'name' => 'App\Console\Commands\Upgrade\V6_13_0',
'created_at' => '2020-01-28 15:13:00',
'updated_at' => '2020-01-28 15:13:00',
'deleted_at' => null,
],
[
'id' => 35,
'name' => 'App\Console\Commands\Upgrade\V6_14_0',
'created_at' => '2020-02-10 21:13:00',
'updated_at' => '2020-02-10 21:13:00',
'deleted_at' => null,
],
[
'id' => 36,
'name' => 'App\Console\Commands\Upgrade\V7_0_0',
'created_at' => '2020-03-13 20:13:00',
'updated_at' => '2020-03-13 20:13:00',
'deleted_at' => null,
],
[
'id' => 37,
'name' => 'App\Console\Commands\Upgrade\V8_0_0',
'created_at' => '2020-03-31 23:35:00',
'updated_at' => '2020-03-31 23:35:00',
'deleted_at' => null,
],
[
'id' => 38,
'name' => 'App\Console\Commands\Upgrade\V9_0_0',
'created_at' => '2020-04-20 23:35:00',
'updated_at' => '2020-04-20 23:35:00',
'deleted_at' => null,
],
]);
}
}
| {
"pile_set_name": "Github"
} |
module FSharpTest15
let x = 1 | {
"pile_set_name": "Github"
} |
import itertools
import numpy as np
import cudarray as ca
import deeppy as dp
from feedforward.test_layers import approx_fprime, gradclose
batch_sizes = [1, 5, 10]
n_ins = [1, 2, 8, 7]
def check_grad(loss, x0, y0, seed=1, eps=None, rtol=None, atol=None):
'''
Numerical gradient checking of loss functions.
'''
def fun(x):
ca.random.seed(seed)
y = np.array(loss.loss(ca.array(x), ca.array(y0))).astype(np.float_)
return np.sum(y)
def fun_grad(x):
x_grad = np.array(loss.grad(ca.array(x), ca.array(y0)))
return x_grad
g_approx = approx_fprime(x0, fun, eps)
g_true = fun_grad(x0)
assert gradclose(g_true, g_approx, rtol, atol)
def test_softmaxcrossentropy():
confs = itertools.product(batch_sizes, n_ins)
for batch_size, n_in in confs:
print('SoftmaxCrossEntropy: batch_size=%i, n_in=%i'
% (batch_size, n_in))
x_shape = (batch_size, n_in)
x = np.random.normal(size=x_shape)
y = np.random.randint(low=0, high=n_in, size=batch_size)
loss = dp.SoftmaxCrossEntropy()
loss.setup(x_shape)
assert loss.loss(ca.array(x), ca.array(y)).shape == x_shape[:1]
check_grad(loss, x, y)
def test_binarycrossentropy():
confs = itertools.product(batch_sizes, n_ins)
for batch_size, n_in in confs:
print('BinaryCrossEntropy: batch_size=%i, n_in=%i'
% (batch_size, n_in))
x_shape = (batch_size, n_in)
x = np.random.uniform(size=x_shape)
y = np.random.uniform(size=x_shape)
loss = dp.BinaryCrossEntropy()
loss.setup(x_shape)
assert loss.loss(ca.array(x), ca.array(y)).shape == x_shape[:1]
check_grad(loss, x, y)
def test_meansquarederror():
confs = itertools.product(batch_sizes, n_ins)
for batch_size, n_in in confs:
print('MeanSquaredError: batch_size=%i, n_in=%i' % (batch_size, n_in))
x_shape = (batch_size, n_in)
x = np.random.normal(size=x_shape)
y = np.random.normal(size=x_shape)
loss = dp.MeanSquaredError()
loss.setup(x_shape)
assert loss.loss(ca.array(x), ca.array(y)).shape == x_shape[:1]
check_grad(loss, x, y)
| {
"pile_set_name": "Github"
} |
/*
Copyright 1999-2020 ImageMagick Studio LLC, a non-profit organization
dedicated to making software imaging solutions freely available.
You may not use this file except in compliance with the License. You may
obtain a copy of the License at
https://imagemagick.org/script/license.php
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.
MagickCore image effects methods.
*/
#ifndef MAGICKCORE_EFFECT_H
#define MAGICKCORE_EFFECT_H
#include "MagickCore/morphology.h"
#if defined(__cplusplus) || defined(c_plusplus)
extern "C" {
#endif
typedef enum
{
UndefinedPreview,
RotatePreview,
ShearPreview,
RollPreview,
HuePreview,
SaturationPreview,
BrightnessPreview,
GammaPreview,
SpiffPreview,
DullPreview,
GrayscalePreview,
QuantizePreview,
DespecklePreview,
ReduceNoisePreview,
AddNoisePreview,
SharpenPreview,
BlurPreview,
ThresholdPreview,
EdgeDetectPreview,
SpreadPreview,
SolarizePreview,
ShadePreview,
RaisePreview,
SegmentPreview,
SwirlPreview,
ImplodePreview,
WavePreview,
OilPaintPreview,
CharcoalDrawingPreview,
JPEGPreview
} PreviewType;
extern MagickExport Image
*AdaptiveBlurImage(const Image *,const double,const double,ExceptionInfo *),
*AdaptiveSharpenImage(const Image *,const double,const double,
ExceptionInfo *),
*BlurImage(const Image *,const double,const double,ExceptionInfo *),
*ConvolveImage(const Image *,const KernelInfo *,ExceptionInfo *),
*DespeckleImage(const Image *,ExceptionInfo *),
*EdgeImage(const Image *,const double,ExceptionInfo *),
*EmbossImage(const Image *,const double,const double,ExceptionInfo *),
*GaussianBlurImage(const Image *,const double,const double,ExceptionInfo *),
*KuwaharaImage(const Image *,const double,const double,ExceptionInfo *),
*LocalContrastImage(const Image *,const double,const double,ExceptionInfo *),
*MotionBlurImage(const Image *,const double,const double,const double,
ExceptionInfo *),
*PreviewImage(const Image *,const PreviewType,ExceptionInfo *),
*RotationalBlurImage(const Image *,const double,ExceptionInfo *),
*SelectiveBlurImage(const Image *,const double,const double,const double,
ExceptionInfo *),
*ShadeImage(const Image *,const MagickBooleanType,const double,const double,
ExceptionInfo *),
*SharpenImage(const Image *,const double,const double,ExceptionInfo *),
*SpreadImage(const Image *,const PixelInterpolateMethod,const double,
ExceptionInfo *),
*UnsharpMaskImage(const Image *,const double,const double,const double,
const double,ExceptionInfo *);
#if defined(__cplusplus) || defined(c_plusplus)
}
#endif
#endif
| {
"pile_set_name": "Github"
} |
<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML+RDFa 1.0//EN" "http://www.w3.org/MarkUp/DTD/xhtml-rdfa-1.dtd">
<html xmlns="http://www.w3.org/1999/xhtml"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:owl="http://www.w3.org/2002/07/owl#"
xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
xmlns:dc="http://purl.org/dc/terms/"
xmlns:xsd="http://www.w3.org/2001/XMLSchema"
xmlns:spdx="http://spdx.org/rdf/terms#">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<link rel="shortcut icon" href="sites/all/themes/cpstandard/favicon.ico" type="image/vnd.microsoft.icon" />
<title>CeCILL Free Software License Agreement v2.1 | Software Package Data Exchange (SPDX)</title>
<link rel="shortcut icon" href="sites/all/themes/cpstandard/favicon.ico" type="image/vnd.microsoft.icon" />
<link type="text/css" rel="stylesheet" media="all" href="sites/all/themes/cpstandard/css/style.css" />
<link type="text/css" rel="stylesheet" media="all" href="sites/all/themes/cpstandard/css/colors.css" />
<link href="//netdna.bootstrapcdn.com/font-awesome/4.0.3/css/font-awesome.css" rel="stylesheet" />
<!-- GOOGLE FONTS -->
<link href='//fonts.googleapis.com/css?family=Roboto:400,400italic,300,300italic,100italic,100,500,500italic,700,700italic,900,900italic' rel='stylesheet' type='text/css' />
<style type="text/css">
.page {
color: #58595b;
}
#header {
border-bottom: 3px solid #4597cb;
padding-bottom: 50px;
}
.breadcrumb {
margin-top: 25px;
}
#content-header h1 {
color: #58595b;
}
.page h2, h3, h4, h5 {
color: #4597cb;
}
.page h1 {
font-size: 2em;
}
.page h2 {
font-size: 1.5em;
}
a, a:visited, a:hover {
color: #4597cb;
}
#footer-copyright {
margin-top: 25px;
}
.replacable-license-text {
color: #CC0000;
}
.replacable-license-text p var {
color: #CC0000;
}
.optional-license-text {
color: #0000cc;
}
.optional-license-text p var {
color: #0000cc;
}
ul, ol, li {
margin: 10px 0 10px 0;
}
</style>
<script type="text/javascript">
var _gaq = _gaq || [];
_gaq.push(['_setAccount', 'UA-3676394-2']);
_gaq.push(['_trackPageview']);
(function() {
var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true;
ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js';
var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s);
})();
</script>
</head>
<body typeof="spdx:License">
<div id="lf-header" class="collaborative-projects">
<div class="gray-diagonal">
<div class="container">
<a id="collaborative-projects-logo" href="http://collabprojects.linuxfoundation.org">Linux Foundation Collaborative Projects</a>
</div>
</div>
</div>
<div id="header">
<div id="header-inner">
<a href="/" title="Home" rel="home" id="logo">
<img src="https://spdx.org/sites/cpstandard/files/logo_spdx_250.png" alt="Home" />
</a>
<div id="name-and-slogan">
<div id="site-name">
<h1><a href="/" title="Home" rel="home">Software Package Data Exchange (SPDX)</a></h1>
</div>
</div>
</div>
</div> <!-- /header -->
<div id="highlighted">
<div class="region region-highlighted">
</div>
</div>
<div id="page" class="page">
<div class="breadcrumb"><a href="/">Home</a> » <a href="/licenses">Licenses</a></div>
<h1 property="dc:title">CeCILL Free Software License Agreement v2.1</h1>
<div style="display:none;"><code property="spdx:deprecated">false</code></div>
<h2>Full name</h2>
<p style="margin-left: 20px;"><code property="spdx:name">CeCILL Free Software License Agreement v2.1</code></p>
<h2>Short identifier</h2>
<p style="margin-left: 20px;"><code property="spdx:licenseId">CECILL-2.1</code></p>
<h2>Other web pages for this license</h2>
<div style="margin-left: 20px;">
<ul>
<li><a href="http://www.cecill.info/licences/Licence_CeCILL_V2.1-en.html" rel="rdfs:seeAlso">http://www.cecill.info/licences/Licence_CeCILL_V2.1-en.html</a></li>
</ul>
</div>
<div property="spdx:isOsiApproved" style="display: none;">true</div>
<h2 id="notes">Notes</h2>
<p style="margin-left: 20px;">French version can be found here: http://www.cecill.info/licences/Licence_CeCILL_V2.1-fr.html</p>
<h2 id="licenseText">Text</h2>
<div property="spdx:licenseText" class="license-text">
<div class="optional-license-text">
<p>
CeCILL FREE SOFTWARE LICENSE AGREEMENT
</p>
</div>
<p>
Version 2.1 dated 2013-06-21
</p>
<div class="optional-license-text">
<p>
Notice
</p>
<p>
This Agreement is a Free Software license agreement that is the result of discussions between its authors in order to ensure compliance with the two main principles guiding its drafting:
</p>
<ul style="list-style:none">
<li>
<var class="replacable-license-text">*</var>
firstly, compliance with the principles governing the distribution of Free Software: access to source code, broad rights granted to users,
</li>
<li>
<var class="replacable-license-text">*</var>
secondly, the election of a governing law, French law, with which it is conformant, both as regards the law of torts and intellectual property law, and the protection that it offers to both authors and holders of the economic rights over software.
</li>
</ul>
<p>
The authors of the
<var class="replacable-license-text">CeCILL¹</var> license are:
</p>
<ul style="list-style:none">
<li>
<p>
Commissariat à l'énergie atomique et aux énergies alternatives - CEA, a public scientific, technical and industrial research establishment, having its principal place of business at 25 rue Leblanc, immeuble Le Ponant D, 75015 Paris, France.
</p>
</li>
<li>
<p>
Centre National de la Recherche Scientifique - CNRS, a public scientific and technological establishment, having its principal place of business at 3 rue Michel-Ange, 75794 Paris cedex 16, France.
</p>
</li>
<li>
<p>
Institut National de Recherche en Informatique et en Automatique - Inria, a public scientific and technological establishment, having its principal place of business at Domaine de Voluceau, Rocquencourt, BP 105, 78153 Le Chesnay cedex, France.
</p>
</li>
</ul>
</div>
<ul style="list-style:none">
<li>
<var class="replacable-license-text">Preamble</var>
The purpose of this Free Software license agreement is to grant users the right to modify and redistribute the software governed by this license within the framework of an open source distribution model.
<p>
The exercising of this right is conditional upon certain obligations for users so as to preserve this status for all subsequent redistributions.
</p>
<p>
In consideration of access to the source code and the rights to copy, modify and redistribute granted by the license, users are provided only with a limited warranty and the software's author, the holder of the economic rights, and the successive licensors only have limited liability.
</p>
<p>
In this respect, the risks associated with loading, using, modifying and/or developing or reproducing the software by the user are brought to the user's attention, given its Free Software status, which may make it complicated to use, with the result that its use is reserved for developers and experienced professionals having in-depth computer knowledge. Users are therefore encouraged to load and test the suitability of the software as regards their requirements in conditions enabling the security of their systems and/or data to be ensured and, more generally, to use and operate it in the same conditions of security. This Agreement may be freely reproduced and published, provided it is not altered, and that no provisions are either added or removed herefrom.
</p>
<p>
This Agreement may apply to any or all software for which the holder of the economic rights decides to submit the use thereof to its provisions.
</p>
<p>
Frequently asked questions can be found on the official website of the CeCILL licenses family (http://www.cecill.info/index.en.html) for any necessary clarification.
</p>
</li>
<li>
<var class="replacable-license-text">Article 1 -</var>
DEFINITIONS
<p>
For the purpose of this Agreement, when the following expressions commence with a capital letter, they shall have the following meaning:
</p>
<ul style="list-style:none">
<li>
<p>
Agreement: means this license agreement, and its possible subsequent versions and annexes.
</p>
</li>
<li>
<p>
Software: means the software in its Object Code and/or Source Code form and, where applicable, its documentation, "as is" when the Licensee accepts the Agreement.
</p>
</li>
<li>
<p>
Initial Software: means the Software in its Source Code and possibly its Object Code form and, where applicable, its documentation, "as is" when it is first distributed under the terms and conditions of the Agreement.
</p>
</li>
<li>
<p>
Modified Software: means the Software modified by at least one Contribution.
</p>
</li>
<li>
<p>
Source Code: means all the Software's instructions and program lines to which access is required so as to modify the Software.
</p>
</li>
<li>
<p>
Object Code: means the binary files originating from the compilation of the Source Code.
</p>
</li>
<li>
<p>
Holder: means the holder(s) of the economic rights over the Initial Software.
</p>
</li>
<li>
<p>
Licensee: means the Software user(s) having accepted the Agreement.
</p>
</li>
<li>
<p>
Contributor: means a Licensee having made at least one Contribution.
</p>
</li>
<li>
<p>
Licensor: means the Holder, or any other individual or legal entity, who distributes the Software under the Agreement.
</p>
</li>
<li>
<p>
Contribution: means any or all modifications, corrections, translations, adaptations and/or new functions integrated into the Software by any or all Contributors, as well as any or all Internal Modules.
</p>
</li>
<li>
<p>
Module: means a set of sources files including their documentation that enables supplementary functions or services in addition to those offered by the Software.
</p>
</li>
<li>
<p>
External Module: means any or all Modules, not derived from the Software, so that this Module and the Software run in separate address spaces, with one calling the other when they are run.
</p>
</li>
<li>
<p>
Internal Module: means any or all Module, connected to the Software so that they both execute in the same address space.
</p>
</li>
<li>
<p>
GNU GPL: means the GNU General Public License version 2 or any subsequent version, as published by the Free Software Foundation Inc.
</p>
</li>
<li>
<p>
GNU Affero GPL: means the GNU Affero General Public License version 3 or any subsequent version, as published by the Free Software Foundation Inc.
</p>
</li>
<li>
<p>
EUPL: means the European Union Public License version 1.1 or any subsequent version, as published by the European Commission.
</p>
</li>
<li>
<p>
Parties: mean both the Licensee and the Licensor.
</p>
</li>
</ul>
<p>
These expressions may be used both in singular and plural form.
</p>
</li>
<li>
<var class="replacable-license-text">Article 2 -</var>
PURPOSE
<p>
The purpose of the Agreement is the grant by the Licensor to the Licensee of a non-exclusive, transferable and worldwide license for the Software as set forth in Article 5 <var class="optional-license-text"><#scope></var> hereinafter for the whole term of the protection granted by the rights over said Software.
</p>
</li>
<li>
<var class="replacable-license-text">Article 3 -</var>
ACCEPTANCE
<ul style="list-style:none">
<li>
<var class="replacable-license-text">3.1</var>
The Licensee shall be deemed as having accepted the terms and conditions of this Agreement upon the occurrence of the first of the following events:
<ul style="list-style:none">
<li>
<var class="replacable-license-text">(i)</var>
loading the Software by any or all means, notably, by downloading from a remote server, or by loading from a physical medium;
</li>
<li>
<var class="replacable-license-text">(ii)</var>
the first time the Licensee exercises any of the rights granted hereunder.
</li>
</ul>
</li>
<li>
<var class="replacable-license-text">3.2</var>
One copy of the Agreement, containing a notice relating to the characteristics of the Software, to the limited warranty, and to the fact that its use is restricted to experienced users has been provided to the Licensee prior to its acceptance as set forth in Article 3.1 <var class="optional-license-text"><#accepting></var> hereinabove, and the Licensee hereby acknowledges that it has read and understood it.
</li>
</ul>
</li>
<li>
<var class="replacable-license-text">Article 4 -</var>
EFFECTIVE DATE AND TERM
<ul style="list-style:none">
<li>
<var class="replacable-license-text">4.1</var>
EFFECTIVE DATE
<p>
The Agreement shall become effective on the date when it is accepted by the Licensee as set forth in Article 3.1 <var class="optional-license-text"><#accepting></var>.
</p>
</li>
<li>
<var class="replacable-license-text">4.2</var>
TERM
<p>
The Agreement shall remain in force for the entire legal term of protection of the economic rights over the Software.
</p>
</li>
</ul>
</li>
<li>
<var class="replacable-license-text">Article 5 -</var>
SCOPE OF RIGHTS GRANTED
<p>
The Licensor hereby grants to the Licensee, who accepts, the following rights over the Software for any or all use, and for the term of the Agreement, on the basis of the terms and conditions set forth hereinafter.
</p>
<p>
Besides, if the Licensor owns or comes to own one or more patents protecting all or part of the functions of the Software or of its components, the Licensor undertakes not to enforce the rights granted by these patents against successive Licensees using, exploiting or modifying the Software. If these patents are transferred, the Licensor undertakes to have the transferees subscribe to the obligations set forth in this paragraph.
</p>
<ul style="list-style:none">
<li>
<var class="replacable-license-text">5.1</var>
RIGHT OF USE
<p>
The Licensee is authorized to use the Software, without any limitation as to its fields of application, with it being hereinafter specified that this comprises:
</p>
<ul style="list-style:none">
<li>
<var class="replacable-license-text">1.</var>
permanent or temporary reproduction of all or part of the Software by any or all means and in any or all form.
</li>
<li>
<var class="replacable-license-text">2.</var>
loading, displaying, running, or storing the Software on any or all medium.
</li>
<li>
<var class="replacable-license-text">3.</var>
entitlement to observe, study or test its operation so as to determine the ideas and principles behind any or all constituent elements of said Software. This shall apply when the Licensee carries out any or all loading, displaying, running, transmission or storage operation as regards the Software, that it is entitled to carry out hereunder.
</li>
</ul>
</li>
<li>
<var class="replacable-license-text">5.2</var>
ENTITLEMENT TO MAKE CONTRIBUTIONS
<p>
The right to make Contributions includes the right to translate, adapt, arrange, or make any or all modifications to the Software, and the right to reproduce the resulting software.
</p>
<p>
The Licensee is authorized to make any or all Contributions to the Software provided that it includes an explicit notice that it is the author of said Contribution and indicates the date of the creation thereof.
</p>
</li>
<li>
<var class="replacable-license-text">5.3</var>
RIGHT OF DISTRIBUTION
<p>
In particular, the right of distribution includes the right to publish, transmit and communicate the Software to the general public on any or all medium, and by any or all means, and the right to market, either in consideration of a fee, or free of charge, one or more copies of the Software by any means.
</p>
<p>
The Licensee is further authorized to distribute copies of the modified or unmodified Software to third parties according to the terms and conditions set forth hereinafter.
</p>
<ul style="list-style:none">
<li>
<var class="replacable-license-text">5.3.1.</var>
DISTRIBUTION OF SOFTWARE WITHOUT MODIFICATION
<p>
The Licensee is authorized to distribute true copies of the Software in Source Code or Object Code form, provided that said distribution complies with all the provisions of the Agreement and is accompanied by:
</p>
<ul style="list-style:none">
<li>
<var class="replacable-license-text">1.</var>
a copy of the Agreement,
</li>
<li>
<var class="replacable-license-text">2.</var>
a notice relating to the limitation of both the Licensor's warranty and liability as set forth in Articles 8 and 9,
</li>
</ul>
<p>
and that, in the event that only the Object Code of the Software is redistributed, the Licensee allows effective access to the full Source Code of the Software for a period of at least three years from the distribution of the Software, it being understood that the additional acquisition cost of the Source Code shall not exceed the cost of the data transfer.
</p>
</li>
<li>
<var class="replacable-license-text">5.3.2.</var>
DISTRIBUTION OF MODIFIED SOFTWARE
<p>
When the Licensee makes a Contribution to the Software, the terms and conditions for the distribution of the resulting Modified Software become subject to all the provisions of this Agreement.
</p>
<p>
The Licensee is authorized to distribute the Modified Software, in source code or object code form, provided that said distribution complies with all the provisions of the Agreement and is accompanied by:
</p>
<ul style="list-style:none">
<li>
<var class="replacable-license-text">1.</var>
a copy of the Agreement,
</li>
<li>
<var class="replacable-license-text">2.</var>
a notice relating to the limitation of both the Licensor's warranty and liability as set forth in Articles 8 and 9,
</li>
</ul>
<p>
and, in the event that only the object code of the Modified Software is redistributed,
</p>
<ul style="list-style:none">
<li>
<var class="replacable-license-text">3.</var>
a note stating the conditions of effective access to the full source code of the Modified Software for a period of at least three years from the distribution of the Modified Software, it being understood that the additional acquisition cost of the source code shall not exceed the cost of the data transfer.
</li>
</ul>
</li>
<li>
<var class="replacable-license-text">5.3.3.</var>
DISTRIBUTION OF EXTERNAL MODULES
<p>
When the Licensee has developed an External Module, the terms and conditions of this Agreement do not apply to said External Module, that may be distributed under a separate license agreement.
</p>
</li>
<li>
<var class="replacable-license-text">5.3.4.</var>
COMPATIBILITY WITH OTHER LICENSES
<p>
The Licensee can include a code that is subject to the provisions of one of the versions of the GNU GPL, GNU Affero GPL and/or EUPL in the Modified or unmodified Software, and distribute that entire code under the terms of the same version of the GNU GPL, GNU Affero GPL and/or EUPL.
</p>
<p>
The Licensee can include the Modified or unmodified Software in a code that is subject to the provisions of one of the versions of the GNU GPL, GNU Affero GPL and/or EUPL and distribute that entire code under the terms of the same version of the GNU GPL, GNU Affero GPL and/or EUPL.
</p>
</li>
</ul>
</li>
</ul>
</li>
<li>
<var class="replacable-license-text">Article 6 -</var>
INTELLECTUAL PROPERTY
<ul style="list-style:none">
<li>
<var class="replacable-license-text">6.1</var>
OVER THE INITIAL SOFTWARE
<p>
The Holder owns the economic rights over the Initial Software. Any or all use of the Initial Software is subject to compliance with the terms and conditions under which the Holder has elected to distribute its work and no one shall be entitled to modify the terms and conditions for the distribution of said Initial Software.
</p>
<p>
The Holder undertakes that the Initial Software will remain ruled at least by this Agreement, for the duration set forth in Article 4.2<var class="optional-license-text"><#term></var>.
</p>
</li>
<li>
<var class="replacable-license-text">6.2</var>
OVER THE CONTRIBUTIONS
<p>
The Licensee who develops a Contribution is the owner of the intellectual property rights over this Contribution as defined by applicable law.
</p>
</li>
<li>
<var class="replacable-license-text">6.3</var>
OVER THE EXTERNAL MODULES
<p>
The Licensee who develops an External Module is the owner of the intellectual property rights over this External Module as defined by applicable law and is free to choose the type of agreement that shall govern its distribution.
</p>
</li>
<li>
<var class="replacable-license-text">6.4</var>
JOINT PROVISIONS
<p>
The Licensee expressly undertakes:
</p>
<ul style="list-style:none">
<li>
<var class="replacable-license-text">1.</var>
not to remove, or modify, in any manner, the intellectual property notices attached to the Software;
</li>
<li>
<var class="replacable-license-text">2.</var>
to reproduce said notices, in an identical manner, in the copies of the Software modified or not.
</li>
</ul>
<p>
The Licensee undertakes not to directly or indirectly infringe the intellectual property rights on the Software of the Holder and/or Contributors, and to take, where applicable, vis-à-vis its staff, any and all measures required to ensure respect of said intellectual property rights of the Holder and/or Contributors.
</p>
</li>
</ul>
</li>
<li>
<var class="replacable-license-text">Article 7 -</var>
RELATED SERVICES
<ul style="list-style:none">
<li>
<var class="replacable-license-text">7.1</var>
Under no circumstances shall the Agreement oblige the Licensor to provide technical assistance or maintenance services for the Software.
<p>
However, the Licensor is entitled to offer this type of services. The terms and conditions of such technical assistance, and/or such maintenance, shall be set forth in a separate instrument. Only the Licensor offering said maintenance and/or technical assistance services shall incur liability therefor.
</p>
</li>
<li>
<var class="replacable-license-text">7.2</var>
Similarly, any Licensor is entitled to offer to its licensees, under its sole responsibility, a warranty, that shall only be binding upon itself, for the redistribution of the Software and/or the Modified Software, under terms and conditions that it is free to decide. Said warranty, and the financial terms and conditions of its application, shall be subject of a separate instrument executed between the Licensor and the Licensee.
</li>
</ul>
</li>
<li>
<var class="replacable-license-text">Article 8 -</var>
LIABILITY
<ul style="list-style:none">
<li>
<var class="replacable-license-text">8.1</var>
Subject to the provisions of Article 8.2, the Licensee shall be entitled to claim compensation for any direct loss it may have suffered from the Software as a result of a fault on the part of the relevant Licensor, subject to providing evidence thereof.
</li>
<li>
<var class="replacable-license-text">8.2</var>
The Licensor's liability is limited to the commitments made under this Agreement and shall not be incurred as a result of in particular: (i) loss due the Licensee's total or partial failure to fulfill its obligations, (ii) direct or consequential loss that is suffered by the Licensee due to the use or performance of the Software, and (iii) more generally, any consequential loss. In particular the Parties expressly agree that any or all pecuniary or business loss (i.e. loss of data, loss of profits, operating loss, loss of customers or orders, opportunity cost, any disturbance to business activities) or any or all legal proceedings instituted against the Licensee by a third party, shall constitute consequential loss and shall not provide entitlement to any or all compensation from the Licensor.
</li>
</ul>
</li>
<li>
<var class="replacable-license-text">Article 9 -</var>
WARRANTY
<ul style="list-style:none">
<li>
<var class="replacable-license-text">9.1</var>
The Licensee acknowledges that the scientific and technical state-of-the-art when the Software was distributed did not enable all possible uses to be tested and verified, nor for the presence of possible defects to be detected. In this respect, the Licensee's attention has been drawn to the risks associated with loading, using, modifying and/or developing and reproducing the Software which are reserved for experienced users.
<p>
The Licensee shall be responsible for verifying, by any or all means, the suitability of the product for its requirements, its good working order, and for ensuring that it shall not cause damage to either persons or properties.
</p>
</li>
<li>
<var class="replacable-license-text">9.2</var>
The Licensor hereby represents, in good faith, that it is entitled to grant all the rights over the Software (including in particular the rights set forth in Article 5<var class="optional-license-text"><#scope></var>).
</li>
<li>
<var class="replacable-license-text">9.3</var>
The Licensee acknowledges that the Software is supplied "as is" by the Licensor without any other express or tacit warranty, other than that provided for in Article 9.2 <var class="optional-license-text"><#good-faith></var> and, in particular, without any warranty as to its commercial value, its secured, safe, innovative or relevant nature.
<p>
Specifically, the Licensor does not warrant that the Software is free from any error, that it will operate without interruption, that it will be compatible with the Licensee's own equipment and software configuration, nor that it will meet the Licensee's requirements.
</p>
</li>
<li>
<var class="replacable-license-text">9.4</var>
The Licensor does not either expressly or tacitly warrant that the Software does not infringe any third party intellectual property right relating to a patent, software or any other property right. Therefore, the Licensor disclaims any and all liability towards the Licensee arising out of any or all proceedings for infringement that may be instituted in respect of the use, modification and redistribution of the Software. Nevertheless, should such proceedings be instituted against the Licensee, the Licensor shall provide it with technical and legal expertise for its defense. Such technical and legal expertise shall be decided on a case-by-case basis between the relevant Licensor and the Licensee pursuant to a memorandum of understanding. The Licensor disclaims any and all liability as regards the Licensee's use of the name of the Software. No warranty is given as regards the existence of prior rights over the name of the Software or as regards the existence of a trademark.
</li>
</ul>
</li>
<li>
<var class="replacable-license-text">Article 10 -</var>
TERMINATION
<ul style="list-style:none">
<li>
<var class="replacable-license-text">10.1</var>
In the event of a breach by the Licensee of its obligations hereunder, the Licensor may automatically terminate this Agreement thirty (30) days after notice has been sent to the Licensee and has remained ineffective.
</li>
<li>
<var class="replacable-license-text">10.2</var>
A Licensee whose Agreement is terminated shall no longer be authorized to use, modify or distribute the Software. However, any licenses that it may have granted prior to termination of the Agreement shall remain valid subject to their having been granted in compliance with the terms and conditions hereof.
</li>
</ul>
</li>
<li>
<var class="replacable-license-text">Article 11 -</var>
MISCELLANEOUS
<ul style="list-style:none">
<li>
<var class="replacable-license-text">11.1</var>
EXCUSABLE EVENTS
<p>
Neither Party shall be liable for any or all delay, or failure to perform the Agreement, that may be attributable to an event of force majeure, an act of God or an outside cause, such as defective functioning or interruptions of the electricity or telecommunications networks, network paralysis following a virus attack, intervention by government authorities, natural disasters, water damage, earthquakes, fire, explosions, strikes and labor unrest, war, etc.
</p>
</li>
<li>
<var class="replacable-license-text">11.2</var>
Any failure by either Party, on one or more occasions, to invoke one or more of the provisions hereof, shall under no circumstances be interpreted as being a waiver by the interested Party of its right to invoke said provision(s) subsequently.
</li>
<li>
<var class="replacable-license-text">11.3</var>
The Agreement cancels and replaces any or all previous agreements, whether written or oral, between the Parties and having the same purpose, and constitutes the entirety of the agreement between said Parties concerning said purpose. No supplement or modification to the terms and conditions hereof shall be effective as between the Parties unless it is made in writing and signed by their duly authorized representatives.
</li>
<li>
<var class="replacable-license-text">11.4</var>
In the event that one or more of the provisions hereof were to conflict with a current or future applicable act or legislative text, said act or legislative text shall prevail, and the Parties shall make the necessary amendments so as to comply with said act or legislative text. All other provisions shall remain effective. Similarly, invalidity of a provision of the Agreement, for any reason whatsoever, shall not cause the Agreement as a whole to be invalid.
</li>
<li>
<var class="replacable-license-text">11.5</var>
LANGUAGE
<p>
The Agreement is drafted in both French and English and both versions are deemed authentic.
</p>
</li>
</ul>
</li>
<li>
<var class="replacable-license-text">Article 12 -</var>
NEW VERSIONS OF THE AGREEMENT
<ul style="list-style:none">
<li>
<var class="replacable-license-text">12.1</var>
Any person is authorized to duplicate and distribute copies of this Agreement.
</li>
<li>
<var class="replacable-license-text">12.2</var>
So as to ensure coherence, the wording of this Agreement is protected and may only be modified by the authors of the License, who reserve the right to periodically publish updates or new versions of the Agreement, each with a separate number. These subsequent versions may address new issues encountered by Free Software.
</li>
<li>
<var class="replacable-license-text">12.3</var>
Any Software distributed under a given version of the Agreement may only be subsequently distributed under the same version of the Agreement or a subsequent version, subject to the provisions of Article 5.3.4<var class="optional-license-text"><#compatibility></var>.
</li>
</ul>
</li>
<li>
<var class="replacable-license-text">Article 13 -</var>
GOVERNING LAW AND JURISDICTION
<ul style="list-style:none">
<li>
<var class="replacable-license-text">13.1</var>
The Agreement is governed by French law. The Parties agree to endeavor to seek an amicable solution to any disagreements or disputes that may arise during the performance of the Agreement.
</li>
<li>
<var class="replacable-license-text">13.2</var>
Failing an amicable solution within two (2) months as from their occurrence, and unless emergency proceedings are necessary, the disagreements or disputes shall be referred to the Paris Courts having jurisdiction, by the more diligent Party.
</li>
</ul>
</li>
</ul>
<var class="optional-license-text">1 CeCILL stands for Ce(a) C(nrs) I(nria) L(ogiciel) L(ibre)</var>
</div>
<h2 id="licenseHeader">Standard License Header</h2>
<div property="spdx:standardLicenseHeader" class="license-text">
<p style="font-style: italic">There is no standard license header for the license</p>
</div>
<div property="spdx:standardLicenseTemplate" style="display: none;">
<<beginOptional>> CeCILL FREE SOFTWARE LICENSE AGREEMENT<<endOptional>> Version 2.1 dated 2013-06-21<<beginOptional>> Notice This Agreement is a Free Software license agreement that is the result of discussions between its authors in order to ensure compliance with the two main principles guiding its drafting: <<var;name="bullet";original="*";match=".{0,20}">> firstly, compliance with the principles governing the distribution of Free Software: access to source code, broad rights granted to users, <<var;name="bullet";original="*";match=".{0,20}">> secondly, the election of a governing law, French law, with which it is conformant, both as regards the law of torts and intellectual property law, and the protection that it offers to both authors and holders of the economic rights over software. The authors of the <<var;name="licenseNameFootnote";original="CeCILL¹";match="CeCILL[¹1]?( \\(?for Ce[\\[\\(]a[\\]\\)] C[\\[\\(]nrs[\\]\\)] I[\\[\\(]nria[\\]\\)] L[\\[\\(]ogiciel[\\]\\)] L[\\[\\(]ibre[\\]\\)]\\)?)?">> license are: Commissariat à l'énergie atomique et aux énergies alternatives - CEA, a public scientific, technical and industrial research establishment, having its principal place of business at 25 rue Leblanc, immeuble Le Ponant D, 75015 Paris, France. Centre National de la Recherche Scientifique - CNRS, a public scientific and technological establishment, having its principal place of business at 3 rue Michel-Ange, 75794 Paris cedex 16, France. Institut National de Recherche en Informatique et en Automatique - Inria, a public scientific and technological establishment, having its principal place of business at Domaine de Voluceau, Rocquencourt, BP 105, 78153 Le Chesnay cedex, France.<<endOptional>> <<var;name="bullet";original="Preamble";match=".{0,20}">> The purpose of this Free Software license agreement is to grant users the right to modify and redistribute the software governed by this license within the framework of an open source distribution model. The exercising of this right is conditional upon certain obligations for users so as to preserve this status for all subsequent redistributions. In consideration of access to the source code and the rights to copy, modify and redistribute granted by the license, users are provided only with a limited warranty and the software's author, the holder of the economic rights, and the successive licensors only have limited liability. In this respect, the risks associated with loading, using, modifying and/or developing or reproducing the software by the user are brought to the user's attention, given its Free Software status, which may make it complicated to use, with the result that its use is reserved for developers and experienced professionals having in-depth computer knowledge. Users are therefore encouraged to load and test the suitability of the software as regards their requirements in conditions enabling the security of their systems and/or data to be ensured and, more generally, to use and operate it in the same conditions of security. This Agreement may be freely reproduced and published, provided it is not altered, and that no provisions are either added or removed herefrom. This Agreement may apply to any or all software for which the holder of the economic rights decides to submit the use thereof to its provisions. Frequently asked questions can be found on the official website of the CeCILL licenses family (http://www.cecill.info/index.en.html) for any necessary clarification. <<var;name="bullet";original="Article 1 -";match=".{0,20}">> DEFINITIONS For the purpose of this Agreement, when the following expressions commence with a capital letter, they shall have the following meaning: Agreement: means this license agreement, and its possible subsequent versions and annexes. Software: means the software in its Object Code and/or Source Code form and, where applicable, its documentation, "as is" when the Licensee accepts the Agreement. Initial Software: means the Software in its Source Code and possibly its Object Code form and, where applicable, its documentation, "as is" when it is first distributed under the terms and conditions of the Agreement. Modified Software: means the Software modified by at least one Contribution. Source Code: means all the Software's instructions and program lines to which access is required so as to modify the Software. Object Code: means the binary files originating from the compilation of the Source Code. Holder: means the holder(s) of the economic rights over the Initial Software. Licensee: means the Software user(s) having accepted the Agreement. Contributor: means a Licensee having made at least one Contribution. Licensor: means the Holder, or any other individual or legal entity, who distributes the Software under the Agreement. Contribution: means any or all modifications, corrections, translations, adaptations and/or new functions integrated into the Software by any or all Contributors, as well as any or all Internal Modules. Module: means a set of sources files including their documentation that enables supplementary functions or services in addition to those offered by the Software. External Module: means any or all Modules, not derived from the Software, so that this Module and the Software run in separate address spaces, with one calling the other when they are run. Internal Module: means any or all Module, connected to the Software so that they both execute in the same address space. GNU GPL: means the GNU General Public License version 2 or any subsequent version, as published by the Free Software Foundation Inc. GNU Affero GPL: means the GNU Affero General Public License version 3 or any subsequent version, as published by the Free Software Foundation Inc. EUPL: means the European Union Public License version 1.1 or any subsequent version, as published by the European Commission. Parties: mean both the Licensee and the Licensor. These expressions may be used both in singular and plural form. <<var;name="bullet";original="Article 2 -";match=".{0,20}">> PURPOSE The purpose of the Agreement is the grant by the Licensor to the Licensee of a non-exclusive, transferable and worldwide license for the Software as set forth in Article 5<<beginOptional>> <#scope><<endOptional>> hereinafter for the whole term of the protection granted by the rights over said Software. <<var;name="bullet";original="Article 3 -";match=".{0,20}">> ACCEPTANCE <<var;name="bullet";original="3.1";match=".{0,20}">> The Licensee shall be deemed as having accepted the terms and conditions of this Agreement upon the occurrence of the first of the following events: <<var;name="bullet";original="(i)";match=".{0,20}">> loading the Software by any or all means, notably, by downloading from a remote server, or by loading from a physical medium; <<var;name="bullet";original="(ii)";match=".{0,20}">> the first time the Licensee exercises any of the rights granted hereunder. <<var;name="bullet";original="3.2";match=".{0,20}">> One copy of the Agreement, containing a notice relating to the characteristics of the Software, to the limited warranty, and to the fact that its use is restricted to experienced users has been provided to the Licensee prior to its acceptance as set forth in Article 3.1<<beginOptional>> <#accepting><<endOptional>> hereinabove, and the Licensee hereby acknowledges that it has read and understood it. <<var;name="bullet";original="Article 4 -";match=".{0,20}">> EFFECTIVE DATE AND TERM <<var;name="bullet";original="4.1";match=".{0,20}">> EFFECTIVE DATE The Agreement shall become effective on the date when it is accepted by the Licensee as set forth in Article 3.1<<beginOptional>> <#accepting><<endOptional>> . <<var;name="bullet";original="4.2";match=".{0,20}">> TERM The Agreement shall remain in force for the entire legal term of protection of the economic rights over the Software. <<var;name="bullet";original="Article 5 -";match=".{0,20}">> SCOPE OF RIGHTS GRANTED The Licensor hereby grants to the Licensee, who accepts, the following rights over the Software for any or all use, and for the term of the Agreement, on the basis of the terms and conditions set forth hereinafter. Besides, if the Licensor owns or comes to own one or more patents protecting all or part of the functions of the Software or of its components, the Licensor undertakes not to enforce the rights granted by these patents against successive Licensees using, exploiting or modifying the Software. If these patents are transferred, the Licensor undertakes to have the transferees subscribe to the obligations set forth in this paragraph. <<var;name="bullet";original="5.1";match=".{0,20}">> RIGHT OF USE The Licensee is authorized to use the Software, without any limitation as to its fields of application, with it being hereinafter specified that this comprises: <<var;name="bullet";original="1.";match=".{0,20}">> permanent or temporary reproduction of all or part of the Software by any or all means and in any or all form. <<var;name="bullet";original="2.";match=".{0,20}">> loading, displaying, running, or storing the Software on any or all medium. <<var;name="bullet";original="3.";match=".{0,20}">> entitlement to observe, study or test its operation so as to determine the ideas and principles behind any or all constituent elements of said Software. This shall apply when the Licensee carries out any or all loading, displaying, running, transmission or storage operation as regards the Software, that it is entitled to carry out hereunder. <<var;name="bullet";original="5.2";match=".{0,20}">> ENTITLEMENT TO MAKE CONTRIBUTIONS The right to make Contributions includes the right to translate, adapt, arrange, or make any or all modifications to the Software, and the right to reproduce the resulting software. The Licensee is authorized to make any or all Contributions to the Software provided that it includes an explicit notice that it is the author of said Contribution and indicates the date of the creation thereof. <<var;name="bullet";original="5.3";match=".{0,20}">> RIGHT OF DISTRIBUTION In particular, the right of distribution includes the right to publish, transmit and communicate the Software to the general public on any or all medium, and by any or all means, and the right to market, either in consideration of a fee, or free of charge, one or more copies of the Software by any means. The Licensee is further authorized to distribute copies of the modified or unmodified Software to third parties according to the terms and conditions set forth hereinafter. <<var;name="bullet";original="5.3.1.";match=".{0,20}">> DISTRIBUTION OF SOFTWARE WITHOUT MODIFICATION The Licensee is authorized to distribute true copies of the Software in Source Code or Object Code form, provided that said distribution complies with all the provisions of the Agreement and is accompanied by: <<var;name="bullet";original="1.";match=".{0,20}">> a copy of the Agreement, <<var;name="bullet";original="2.";match=".{0,20}">> a notice relating to the limitation of both the Licensor's warranty and liability as set forth in Articles 8 and 9, and that, in the event that only the Object Code of the Software is redistributed, the Licensee allows effective access to the full Source Code of the Software for a period of at least three years from the distribution of the Software, it being understood that the additional acquisition cost of the Source Code shall not exceed the cost of the data transfer. <<var;name="bullet";original="5.3.2.";match=".{0,20}">> DISTRIBUTION OF MODIFIED SOFTWARE When the Licensee makes a Contribution to the Software, the terms and conditions for the distribution of the resulting Modified Software become subject to all the provisions of this Agreement. The Licensee is authorized to distribute the Modified Software, in source code or object code form, provided that said distribution complies with all the provisions of the Agreement and is accompanied by: <<var;name="bullet";original="1.";match=".{0,20}">> a copy of the Agreement, <<var;name="bullet";original="2.";match=".{0,20}">> a notice relating to the limitation of both the Licensor's warranty and liability as set forth in Articles 8 and 9, and, in the event that only the object code of the Modified Software is redistributed, <<var;name="bullet";original="3.";match=".{0,20}">> a note stating the conditions of effective access to the full source code of the Modified Software for a period of at least three years from the distribution of the Modified Software, it being understood that the additional acquisition cost of the source code shall not exceed the cost of the data transfer. <<var;name="bullet";original="5.3.3.";match=".{0,20}">> DISTRIBUTION OF EXTERNAL MODULES When the Licensee has developed an External Module, the terms and conditions of this Agreement do not apply to said External Module, that may be distributed under a separate license agreement. <<var;name="bullet";original="5.3.4.";match=".{0,20}">> COMPATIBILITY WITH OTHER LICENSES The Licensee can include a code that is subject to the provisions of one of the versions of the GNU GPL, GNU Affero GPL and/or EUPL in the Modified or unmodified Software, and distribute that entire code under the terms of the same version of the GNU GPL, GNU Affero GPL and/or EUPL. The Licensee can include the Modified or unmodified Software in a code that is subject to the provisions of one of the versions of the GNU GPL, GNU Affero GPL and/or EUPL and distribute that entire code under the terms of the same version of the GNU GPL, GNU Affero GPL and/or EUPL. <<var;name="bullet";original="Article 6 -";match=".{0,20}">> INTELLECTUAL PROPERTY <<var;name="bullet";original="6.1";match=".{0,20}">> OVER THE INITIAL SOFTWARE The Holder owns the economic rights over the Initial Software. Any or all use of the Initial Software is subject to compliance with the terms and conditions under which the Holder has elected to distribute its work and no one shall be entitled to modify the terms and conditions for the distribution of said Initial Software. The Holder undertakes that the Initial Software will remain ruled at least by this Agreement, for the duration set forth in Article 4.2<<beginOptional>> <#term><<endOptional>> . <<var;name="bullet";original="6.2";match=".{0,20}">> OVER THE CONTRIBUTIONS The Licensee who develops a Contribution is the owner of the intellectual property rights over this Contribution as defined by applicable law. <<var;name="bullet";original="6.3";match=".{0,20}">> OVER THE EXTERNAL MODULES The Licensee who develops an External Module is the owner of the intellectual property rights over this External Module as defined by applicable law and is free to choose the type of agreement that shall govern its distribution. <<var;name="bullet";original="6.4";match=".{0,20}">> JOINT PROVISIONS The Licensee expressly undertakes: <<var;name="bullet";original="1.";match=".{0,20}">> not to remove, or modify, in any manner, the intellectual property notices attached to the Software; <<var;name="bullet";original="2.";match=".{0,20}">> to reproduce said notices, in an identical manner, in the copies of the Software modified or not. The Licensee undertakes not to directly or indirectly infringe the intellectual property rights on the Software of the Holder and/or Contributors, and to take, where applicable, vis-à-vis its staff, any and all measures required to ensure respect of said intellectual property rights of the Holder and/or Contributors. <<var;name="bullet";original="Article 7 -";match=".{0,20}">> RELATED SERVICES <<var;name="bullet";original="7.1";match=".{0,20}">> Under no circumstances shall the Agreement oblige the Licensor to provide technical assistance or maintenance services for the Software. However, the Licensor is entitled to offer this type of services. The terms and conditions of such technical assistance, and/or such maintenance, shall be set forth in a separate instrument. Only the Licensor offering said maintenance and/or technical assistance services shall incur liability therefor. <<var;name="bullet";original="7.2";match=".{0,20}">> Similarly, any Licensor is entitled to offer to its licensees, under its sole responsibility, a warranty, that shall only be binding upon itself, for the redistribution of the Software and/or the Modified Software, under terms and conditions that it is free to decide. Said warranty, and the financial terms and conditions of its application, shall be subject of a separate instrument executed between the Licensor and the Licensee. <<var;name="bullet";original="Article 8 -";match=".{0,20}">> LIABILITY <<var;name="bullet";original="8.1";match=".{0,20}">> Subject to the provisions of Article 8.2, the Licensee shall be entitled to claim compensation for any direct loss it may have suffered from the Software as a result of a fault on the part of the relevant Licensor, subject to providing evidence thereof. <<var;name="bullet";original="8.2";match=".{0,20}">> The Licensor's liability is limited to the commitments made under this Agreement and shall not be incurred as a result of in particular: (i) loss due the Licensee's total or partial failure to fulfill its obligations, (ii) direct or consequential loss that is suffered by the Licensee due to the use or performance of the Software, and (iii) more generally, any consequential loss. In particular the Parties expressly agree that any or all pecuniary or business loss (i.e. loss of data, loss of profits, operating loss, loss of customers or orders, opportunity cost, any disturbance to business activities) or any or all legal proceedings instituted against the Licensee by a third party, shall constitute consequential loss and shall not provide entitlement to any or all compensation from the Licensor. <<var;name="bullet";original="Article 9 -";match=".{0,20}">> WARRANTY <<var;name="bullet";original="9.1";match=".{0,20}">> The Licensee acknowledges that the scientific and technical state-of-the-art when the Software was distributed did not enable all possible uses to be tested and verified, nor for the presence of possible defects to be detected. In this respect, the Licensee's attention has been drawn to the risks associated with loading, using, modifying and/or developing and reproducing the Software which are reserved for experienced users. The Licensee shall be responsible for verifying, by any or all means, the suitability of the product for its requirements, its good working order, and for ensuring that it shall not cause damage to either persons or properties. <<var;name="bullet";original="9.2";match=".{0,20}">> The Licensor hereby represents, in good faith, that it is entitled to grant all the rights over the Software (including in particular the rights set forth in Article 5<<beginOptional>> <#scope><<endOptional>> ). <<var;name="bullet";original="9.3";match=".{0,20}">> The Licensee acknowledges that the Software is supplied "as is" by the Licensor without any other express or tacit warranty, other than that provided for in Article 9.2<<beginOptional>> <#good-faith><<endOptional>> and, in particular, without any warranty as to its commercial value, its secured, safe, innovative or relevant nature. Specifically, the Licensor does not warrant that the Software is free from any error, that it will operate without interruption, that it will be compatible with the Licensee's own equipment and software configuration, nor that it will meet the Licensee's requirements. <<var;name="bullet";original="9.4";match=".{0,20}">> The Licensor does not either expressly or tacitly warrant that the Software does not infringe any third party intellectual property right relating to a patent, software or any other property right. Therefore, the Licensor disclaims any and all liability towards the Licensee arising out of any or all proceedings for infringement that may be instituted in respect of the use, modification and redistribution of the Software. Nevertheless, should such proceedings be instituted against the Licensee, the Licensor shall provide it with technical and legal expertise for its defense. Such technical and legal expertise shall be decided on a case-by-case basis between the relevant Licensor and the Licensee pursuant to a memorandum of understanding. The Licensor disclaims any and all liability as regards the Licensee's use of the name of the Software. No warranty is given as regards the existence of prior rights over the name of the Software or as regards the existence of a trademark. <<var;name="bullet";original="Article 10 -";match=".{0,20}">> TERMINATION <<var;name="bullet";original="10.1";match=".{0,20}">> In the event of a breach by the Licensee of its obligations hereunder, the Licensor may automatically terminate this Agreement thirty (30) days after notice has been sent to the Licensee and has remained ineffective. <<var;name="bullet";original="10.2";match=".{0,20}">> A Licensee whose Agreement is terminated shall no longer be authorized to use, modify or distribute the Software. However, any licenses that it may have granted prior to termination of the Agreement shall remain valid subject to their having been granted in compliance with the terms and conditions hereof. <<var;name="bullet";original="Article 11 -";match=".{0,20}">> MISCELLANEOUS <<var;name="bullet";original="11.1";match=".{0,20}">> EXCUSABLE EVENTS Neither Party shall be liable for any or all delay, or failure to perform the Agreement, that may be attributable to an event of force majeure, an act of God or an outside cause, such as defective functioning or interruptions of the electricity or telecommunications networks, network paralysis following a virus attack, intervention by government authorities, natural disasters, water damage, earthquakes, fire, explosions, strikes and labor unrest, war, etc. <<var;name="bullet";original="11.2";match=".{0,20}">> Any failure by either Party, on one or more occasions, to invoke one or more of the provisions hereof, shall under no circumstances be interpreted as being a waiver by the interested Party of its right to invoke said provision(s) subsequently. <<var;name="bullet";original="11.3";match=".{0,20}">> The Agreement cancels and replaces any or all previous agreements, whether written or oral, between the Parties and having the same purpose, and constitutes the entirety of the agreement between said Parties concerning said purpose. No supplement or modification to the terms and conditions hereof shall be effective as between the Parties unless it is made in writing and signed by their duly authorized representatives. <<var;name="bullet";original="11.4";match=".{0,20}">> In the event that one or more of the provisions hereof were to conflict with a current or future applicable act or legislative text, said act or legislative text shall prevail, and the Parties shall make the necessary amendments so as to comply with said act or legislative text. All other provisions shall remain effective. Similarly, invalidity of a provision of the Agreement, for any reason whatsoever, shall not cause the Agreement as a whole to be invalid. <<var;name="bullet";original="11.5";match=".{0,20}">> LANGUAGE The Agreement is drafted in both French and English and both versions are deemed authentic. <<var;name="bullet";original="Article 12 -";match=".{0,20}">> NEW VERSIONS OF THE AGREEMENT <<var;name="bullet";original="12.1";match=".{0,20}">> Any person is authorized to duplicate and distribute copies of this Agreement. <<var;name="bullet";original="12.2";match=".{0,20}">> So as to ensure coherence, the wording of this Agreement is protected and may only be modified by the authors of the License, who reserve the right to periodically publish updates or new versions of the Agreement, each with a separate number. These subsequent versions may address new issues encountered by Free Software. <<var;name="bullet";original="12.3";match=".{0,20}">> Any Software distributed under a given version of the Agreement may only be subsequently distributed under the same version of the Agreement or a subsequent version, subject to the provisions of Article 5.3.4<<beginOptional>> <#compatibility><<endOptional>> . <<var;name="bullet";original="Article 13 -";match=".{0,20}">> GOVERNING LAW AND JURISDICTION <<var;name="bullet";original="13.1";match=".{0,20}">> The Agreement is governed by French law. The Parties agree to endeavor to seek an amicable solution to any disagreements or disputes that may arise during the performance of the Agreement. <<var;name="bullet";original="13.2";match=".{0,20}">> Failing an amicable solution within two (2) months as from their occurrence, and unless emergency proceedings are necessary, the disagreements or disputes shall be referred to the Paris Courts having jurisdiction, by the more diligent Party.<<beginOptional>> 1 CeCILL stands for Ce(a) C(nrs) I(nria) L(ogiciel) L(ibre)<<endOptional>>
</div>
</div> <!-- /page -->
<div class="collaborative-projects">
<div class="gray-diagonal">
<div class="container">
<div id="footer-copyright">
<p>© 2018 SPDX Workgroup a Linux Foundation Project. All Rights Reserved. </p>
<p>Linux Foundation is a registered trademark of The Linux Foundation. Linux is a registered <a href="http://www.linuxfoundation.org/programs/legal/trademark" title="Linux Mark Institute">trademark</a> of Linus Torvalds.</p>
<p>Please see our <a href="http://www.linuxfoundation.org/privacy">privacy policy</a> and <a href="http://www.linuxfoundation.org/terms">terms of use</a>.</p>
</div>
</div>
</div>
</div>
<div id="top-page-link">
<a href="#"><i class="fa fa-arrow-circle-up"></i><span>top of page</span></a>
</div>
</body>
</html>
| {
"pile_set_name": "Github"
} |
/*
* 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.
*/
/*
* This code was generated by https://github.com/googleapis/google-api-java-client-services/
* Modify at your own risk.
*/
package com.google.api.services.vision.v1p1beta1.model;
/**
* Color information consists of RGB channels, score, and the fraction of the image that the color
* occupies in the image.
*
* <p> This is the Java data model class that specifies how to parse/serialize into the JSON that is
* transmitted over HTTP when working with the Cloud Vision API. For a detailed explanation see:
* <a href="https://developers.google.com/api-client-library/java/google-http-java-client/json">https://developers.google.com/api-client-library/java/google-http-java-client/json</a>
* </p>
*
* @author Google, Inc.
*/
@SuppressWarnings("javadoc")
public final class GoogleCloudVisionV1p2beta1ColorInfo extends com.google.api.client.json.GenericJson {
/**
* RGB components of the color.
* The value may be {@code null}.
*/
@com.google.api.client.util.Key
private Color color;
/**
* The fraction of pixels the color occupies in the image. Value in range [0, 1].
* The value may be {@code null}.
*/
@com.google.api.client.util.Key
private java.lang.Float pixelFraction;
/**
* Image-specific score for this color. Value in range [0, 1].
* The value may be {@code null}.
*/
@com.google.api.client.util.Key
private java.lang.Float score;
/**
* RGB components of the color.
* @return value or {@code null} for none
*/
public Color getColor() {
return color;
}
/**
* RGB components of the color.
* @param color color or {@code null} for none
*/
public GoogleCloudVisionV1p2beta1ColorInfo setColor(Color color) {
this.color = color;
return this;
}
/**
* The fraction of pixels the color occupies in the image. Value in range [0, 1].
* @return value or {@code null} for none
*/
public java.lang.Float getPixelFraction() {
return pixelFraction;
}
/**
* The fraction of pixels the color occupies in the image. Value in range [0, 1].
* @param pixelFraction pixelFraction or {@code null} for none
*/
public GoogleCloudVisionV1p2beta1ColorInfo setPixelFraction(java.lang.Float pixelFraction) {
this.pixelFraction = pixelFraction;
return this;
}
/**
* Image-specific score for this color. Value in range [0, 1].
* @return value or {@code null} for none
*/
public java.lang.Float getScore() {
return score;
}
/**
* Image-specific score for this color. Value in range [0, 1].
* @param score score or {@code null} for none
*/
public GoogleCloudVisionV1p2beta1ColorInfo setScore(java.lang.Float score) {
this.score = score;
return this;
}
@Override
public GoogleCloudVisionV1p2beta1ColorInfo set(String fieldName, Object value) {
return (GoogleCloudVisionV1p2beta1ColorInfo) super.set(fieldName, value);
}
@Override
public GoogleCloudVisionV1p2beta1ColorInfo clone() {
return (GoogleCloudVisionV1p2beta1ColorInfo) super.clone();
}
}
| {
"pile_set_name": "Github"
} |
GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
Everyone is permitted to copy and distribute verbatim copies of this license
document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your freedom to share
and change it. By contrast, the GNU General Public License is intended to
guarantee your freedom to share and change free software--to make sure the
software is free for all its users. This General Public License applies to
most of the Free Software Foundation's software and to any other program whose
authors commit to using it. (Some other Free Software Foundation software
is covered by the GNU Lesser General Public License instead.) You can apply
it to your programs, too.
When we speak of free software, we are referring to freedom, not price. Our
General Public Licenses are designed to make sure that you have the freedom
to distribute copies of free software (and charge for this service if you
wish), that you receive source code or can get it if you want it, that you
can change the software or use pieces of it in new free programs; and that
you know you can do these things.
To protect your rights, we need to make restrictions that forbid anyone to
deny you these rights or to ask you to surrender the rights. These restrictions
translate to certain responsibilities for you if you distribute copies of
the software, or if you modify it.
For example, if you distribute copies of such a program, whether gratis or
for a fee, you must give the recipients all the rights that you have. You
must make sure that they, too, receive or can get the source code. And you
must show them these terms so they know their rights.
We protect your rights with two steps: (1) copyright the software, and (2)
offer you this license which gives you legal permission to copy, distribute
and/or modify the software.
Also, for each author's protection and ours, we want to make certain that
everyone understands that there is no warranty for this free software. If
the software is modified by someone else and passed on, we want its recipients
to know that what they have is not the original, so that any problems introduced
by others will not reflect on the original authors' reputations.
Finally, any free program is threatened constantly by software patents. We
wish to avoid the danger that redistributors of a free program will individually
obtain patent licenses, in effect making the program proprietary. To prevent
this, we have made it clear that any patent must be licensed for everyone's
free use or not licensed at all.
The precise terms and conditions for copying, distribution and modification
follow.
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains a notice
placed by the copyright holder saying it may be distributed under the terms
of this General Public License. The "Program", below, refers to any such program
or work, and a "work based on the Program" means either the Program or any
derivative work under copyright law: that is to say, a work containing the
Program or a portion of it, either verbatim or with modifications and/or translated
into another language. (Hereinafter, translation is included without limitation
in the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not covered
by this License; they are outside its scope. The act of running the Program
is not restricted, and the output from the Program is covered only if its
contents constitute a work based on the Program (independent of having been
made by running the Program). Whether that is true depends on what the Program
does.
1. You may copy and distribute verbatim copies of the Program's source code
as you receive it, in any medium, provided that you conspicuously and appropriately
publish on each copy an appropriate copyright notice and disclaimer of warranty;
keep intact all the notices that refer to this License and to the absence
of any warranty; and give any other recipients of the Program a copy of this
License along with the Program.
You may charge a fee for the physical act of transferring a copy, and you
may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion of it,
thus forming a work based on the Program, and copy and distribute such modifications
or work under the terms of Section 1 above, provided that you also meet all
of these conditions:
a) You must cause the modified files to carry prominent notices stating that
you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in whole or
in part contains or is derived from the Program or any part thereof, to be
licensed as a whole at no charge to all third parties under the terms of this
License.
c) If the modified program normally reads commands interactively when run,
you must cause it, when started running for such interactive use in the most
ordinary way, to print or display an announcement including an appropriate
copyright notice and a notice that there is no warranty (or else, saying that
you provide a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this License.
(Exception: if the Program itself is interactive but does not normally print
such an announcement, your work based on the Program is not required to print
an announcement.)
These requirements apply to the modified work as a whole. If identifiable
sections of that work are not derived from the Program, and can be reasonably
considered independent and separate works in themselves, then this License,
and its terms, do not apply to those sections when you distribute them as
separate works. But when you distribute the same sections as part of a whole
which is a work based on the Program, the distribution of the whole must be
on the terms of this License, whose permissions for other licensees extend
to the entire whole, and thus to each and every part regardless of who wrote
it.
Thus, it is not the intent of this section to claim rights or contest your
rights to work written entirely by you; rather, the intent is to exercise
the right to control the distribution of derivative or collective works based
on the Program.
In addition, mere aggregation of another work not based on the Program with
the Program (or with a work based on the Program) on a volume of a storage
or distribution medium does not bring the other work under the scope of this
License.
3. You may copy and distribute the Program (or a work based on it, under Section
2) in object code or executable form under the terms of Sections 1 and 2 above
provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable source code,
which must be distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three years, to give
any third party, for a charge no more than your cost of physically performing
source distribution, a complete machine-readable copy of the corresponding
source code, to be distributed under the terms of Sections 1 and 2 above on
a medium customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer to distribute
corresponding source code. (This alternative is allowed only for noncommercial
distribution and only if you received the program in object code or executable
form with such an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for making
modifications to it. For an executable work, complete source code means all
the source code for all modules it contains, plus any associated interface
definition files, plus the scripts used to control compilation and installation
of the executable. However, as a special exception, the source code distributed
need not include anything that is normally distributed (in either source or
binary form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component itself
accompanies the executable.
If distribution of executable or object code is made by offering access to
copy from a designated place, then offering equivalent access to copy the
source code from the same place counts as distribution of the source code,
even though third parties are not compelled to copy the source along with
the object code.
4. You may not copy, modify, sublicense, or distribute the Program except
as expressly provided under this License. Any attempt otherwise to copy, modify,
sublicense or distribute the Program is void, and will automatically terminate
your rights under this License. However, parties who have received copies,
or rights, from you under this License will not have their licenses terminated
so long as such parties remain in full compliance.
5. You are not required to accept this License, since you have not signed
it. However, nothing else grants you permission to modify or distribute the
Program or its derivative works. These actions are prohibited by law if you
do not accept this License. Therefore, by modifying or distributing the Program
(or any work based on the Program), you indicate your acceptance of this License
to do so, and all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the Program),
the recipient automatically receives a license from the original licensor
to copy, distribute or modify the Program subject to these terms and conditions.
You may not impose any further restrictions on the recipients' exercise of
the rights granted herein. You are not responsible for enforcing compliance
by third parties to this License.
7. If, as a consequence of a court judgment or allegation of patent infringement
or for any other reason (not limited to patent issues), conditions are imposed
on you (whether by court order, agreement or otherwise) that contradict the
conditions of this License, they do not excuse you from the conditions of
this License. If you cannot distribute so as to satisfy simultaneously your
obligations under this License and any other pertinent obligations, then as
a consequence you may not distribute the Program at all. For example, if a
patent license would not permit royalty-free redistribution of the Program
by all those who receive copies directly or indirectly through you, then the
only way you could satisfy both it and this License would be to refrain entirely
from distribution of the Program.
If any portion of this section is held invalid or unenforceable under any
particular circumstance, the balance of the section is intended to apply and
the section as a whole is intended to apply in other circumstances.
It is not the purpose of this section to induce you to infringe any patents
or other property right claims or to contest validity of any such claims;
this section has the sole purpose of protecting the integrity of the free
software distribution system, which is implemented by public license practices.
Many people have made generous contributions to the wide range of software
distributed through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing to
distribute software through any other system and a licensee cannot impose
that choice.
This section is intended to make thoroughly clear what is believed to be a
consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in certain
countries either by patents or by copyrighted interfaces, the original copyright
holder who places the Program under this License may add an explicit geographical
distribution limitation excluding those countries, so that distribution is
permitted only in or among countries not thus excluded. In such case, this
License incorporates the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions of
the General Public License from time to time. Such new versions will be similar
in spirit to the present version, but may differ in detail to address new
problems or concerns.
Each version is given a distinguishing version number. If the Program specifies
a version number of this License which applies to it and "any later version",
you have the option of following the terms and conditions either of that version
or of any later version published by the Free Software Foundation. If the
Program does not specify a version number of this License, you may choose
any version ever published by the Free Software Foundation.
10. If you wish to incorporate parts of the Program into other free programs
whose distribution conditions are different, write to the author to ask for
permission. For software which is copyrighted by the Free Software Foundation,
write to the Free Software Foundation; we sometimes make exceptions for this.
Our decision will be guided by the two goals of preserving the free status
of all derivatives of our free software and of promoting the sharing and reuse
of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR
THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE
STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM
"AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE
OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME
THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE
OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA
OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES
OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH
HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest possible
use to the public, the best way to achieve this is to make it free software
which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest to attach
them to the start of each source file to most effectively convey the exclusion
of warranty; and each file should have at least the "copyright" line and a
pointer to where the full notice is found.
<one line to give the program's name and an idea of what it does.>
Copyright (C)< yyyy> <name of author>
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. 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., 51 Franklin
Street, Fifth Floor, Boston, MA 02110-1301, USA.
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this when
it starts in an interactive mode:
Gnomovision version 69, Copyright (C) year name of author Gnomovision comes
with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software,
and you are welcome to redistribute it under certain conditions; type `show
c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, the commands you use may be
called something other than `show w' and `show c'; they could even be mouse-clicks
or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your school,
if any, to sign a "copyright disclaimer" for the program, if necessary. Here
is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision'
(which makes passes at compilers) written by James Hacker.
<signature of Ty Coon >, 1 April 1989 Ty Coon, President of Vice This General
Public License does not permit incorporating your program into proprietary
programs. If your program is a subroutine library, you may consider it more
useful to permit linking proprietary applications with the library. If this
is what you want to do, use the GNU Lesser General Public License instead
of this License.
| {
"pile_set_name": "Github"
} |
class Foo
interface bar
extends Foo
implements bar
trait Foo
instanceof \bar
new \Foo
catch (bar)
----------------------------------------------------
[
"class ",
["class-name", [
"Foo"
]],
"\r\ninterface ",
["class-name", [
"bar"
]],
"\r\nextends ",
["class-name", [
"Foo"
]],
"\r\nimplements ",
["class-name", [
"bar"
]],
"\r\ntrait ",
["class-name", [
"Foo"
]],
["keyword", "instanceof"],
["class-name", [
["punctuation", "\\"],
"bar"
]],
["keyword", "new"],
["class-name", [
["punctuation", "\\"],
"Foo"
]],
["keyword", "catch"],
["punctuation", "("],
["class-name", [
"bar"
]],
["punctuation", ")"]
]
----------------------------------------------------
Checks for class names. | {
"pile_set_name": "Github"
} |
/*
* Copyright 2000-2009 JetBrains s.r.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 com.intellij.codeInspection.reference;
import com.intellij.psi.PsiElement;
import com.intellij.psi.SmartPsiElementPointer;
import org.jetbrains.annotations.NotNull;
import org.jetbrains.annotations.Nullable;
import java.util.Collection;
/**
* A node in the reference graph corresponding to a PSI element.
*
* @author anna
*/
public interface RefElement extends RefEntity {
/**
* Returns the reference graph node for the module to which the element belongs.
*
* @return the node for the module, or null if the element is not valid or the module
* was not found.
*/
@Nullable RefModule getModule();
/**
* Returns the PSI element corresponding to the node.
*
* @return the PSI element.
*/
default PsiElement getPsiElement() {
throw new UnsupportedOperationException();
}
/**
* @deprecated use {@link #getPsiElement()}
*/
@Deprecated
default PsiElement getElement() {
return getPsiElement();
}
SmartPsiElementPointer getPointer();
/**
* Checks if a chain of references exists from one of the entry points to this element.
*
* @return true if the element is reachable from one of the entry points, false otherwise.
*/
boolean isReachable();
/**
* Checks if this element is referenced by any other elements.
*
* @return true if the element is referenced, false otherwise.
*/
boolean isReferenced();
/**
* Returns the collection of references from this element to other elements.
*
* @return the collection of outgoing references.
*/
@NotNull Collection<RefElement> getOutReferences();
/**
* Returns the collection of references from other elements to this element.
*
* @return the collection of incoming references.
*/
@NotNull Collection<RefElement> getInReferences();
/**
* Checks if the element is an entry point for reachability analysis.
*
* @return true if the element is an entry point, false otherwise.
*/
boolean isEntry();
/**
* Checks if the element has been specifically marked by the user as an entry point
* for reachability analysis.
*
* @return true if the element has been marked as an entry point, false otherwise.
*/
boolean isPermanentEntry();
@NotNull
RefElement getContainingEntry();
}
| {
"pile_set_name": "Github"
} |
/*
* arch/arm/include/asm/arch-txl/watchdog.h
*
* Copyright (C) 2015 Amlogic, Inc. All rights reserved.
*
* 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. 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.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#ifndef _BOOT_ROM_WATCHDOG_H
#define _BOOT_ROM_WATCHDOG_H
#include <asm/arch/secure_apb.h>
//#include "common.h"
void watchdog_init(uint32_t msec);
void watchdog_reset(void);
void reset_system(void);
void watchdog_disable(void);
/* uboot reset interface */
void reset_cpu(unsigned long flag);
#endif /* _BOOT_ROM_WATCHDOG_H */
| {
"pile_set_name": "Github"
} |
interactions:
- request:
body: !!python/unicode '{"apikey": "4D297D8CFDE0E105"}'
headers:
Accept: ['*/*']
Accept-Encoding: ['gzip, deflate']
Connection: [keep-alive]
Content-Length: ['30']
Content-Type: [application/json]
User-Agent: [!!python/unicode FlexGet/2.3.33.dev (www.flexget.com)]
method: POST
uri: https://api.thetvdb.com/login
response:
body:
string: !!binary |
H4sIAAAAAAAAAwTByZKiMAAA0Ht/heWdLoiIMLcWIiRgcMFmuVAYgoRFUBaBqfn3ee/v12q17puS
Pdd/Vms24/xuUu5yfL0tSCIcdeh52VIdKahsg18da99sxhWzfrhbQJEst4l4D5EUtEN1VaKi4Zd6
qhhMq1RHHaq1OfHTLPEPIiqaiRhUOhp0PhrhJjt/b9BN8kih5/o93tWJkqo9LSWkiiFHMqb7qhFO
Rmy3aFTd/FpaSq0IdnLmzDn7mPgvcjlaO1SxR9PcAuGlNkkSfjiMigAXhY5kWOXekZXbFIN0KVTa
5u4wFX5rJkB6x/V53oRGmdmKrPnYjuGWOKI5B7ujfgEIZm3Qd5P6dupQJVPj5cND+ZVfUbl02INV
brZOHTuqqPpPV4nBFH8u4SwN2KysW0AC2wPhhmk/J9wH/fUTgcTdcrgzRG6PFO73B4tpkN3lh0eB
1OiCp1P0Gj7g7WYna79EGRliOZ8OGw1SwRljBcyiMEqHRWjvme/HkdzzKC/3KW5o/h7Z28gMszr0
4LP++vcfAAD//wMAC2gLg9cBAAA=
headers:
cf-ray: [2e97cd4578a70f81-FRA]
connection: [keep-alive]
content-encoding: [gzip]
content-type: [application/json; charset=utf-8]
date: ['Wed, 28 Sep 2016 14:14:28 GMT']
server: [cloudflare-nginx]
set-cookie: ['__cfduid=d1ecf42a869fda7d71b17dca8d4395f711475072067; expires=Thu,
28-Sep-17 14:14:27 GMT; path=/; domain=.thetvdb.com; HttpOnly']
vary: [Accept-Language]
x-powered-by: [Thundar!]
x-thetvdb-api-version: [2.1.1]
status: {code: 200, message: OK}
- request:
body: null
headers:
Accept: ['*/*']
Accept-Encoding: ['gzip, deflate']
Authorization: [!!python/unicode Bearer eyJhbGciOiJSUzI1NiIsInR5cCI6IkpXVCJ9.eyJleHAiOjE0NzUxNTg0NjcsImlkIjoiRmxleEdldCIsIm9yaWdfaWF0IjoxNDc1MDcyMDY3fQ.3IU1TNjChCb_7ma6d8tck1I80YiI4JcBlo-PD_KpIv8OhSkH6m6-KaQieLQWJNWqNRMH7IlegooUX-q8oaaYwiEZjXJjjCI4ElhTMek5dJ2dzj8cphOuxjWpGa21r_mQy3YDkfK649WJK_E5NL0GyX7MCR2IEfpXtsx8rLmY8NxoThug6V4qZkzsJTElhGpLm_L808WnO6_2x_wRYy1uJGlHUXNXKT2Y3e9APJtXtSwZ2aO5iE7D0iKvcEBBFHe9Eeb4gTc21oC-TCcIquw2rOfPHBzZfNu_4hxF39Ec-Lv_62y0-v1Fz-pbfWW_Z4tiZhkBdJochrverDfDGlFt2w]
Connection: [keep-alive]
User-Agent: [!!python/unicode FlexGet/2.3.33.dev (www.flexget.com)]
method: GET
uri: https://api.thetvdb.com/search/series?name=sdfgsdfgsdfgsdfg
response:
body: {string: !!python/unicode "{\n \"Error\": \"Resource not found\"\n}"}
headers:
cache-control: ['private, max-age=600']
cf-ray: [2e97cd4c2daf15bf-FRA]
connection: [keep-alive]
content-length: ['35']
content-type: [application/json; charset=utf-8]
date: ['Wed, 28 Sep 2016 14:14:28 GMT']
server: [cloudflare-nginx]
set-cookie: ['__cfduid=df24a96f11b2fc6ad0ca599841ca8d2c81475072068; expires=Thu,
28-Sep-17 14:14:28 GMT; path=/; domain=.thetvdb.com; HttpOnly']
vary: [Accept-Language]
x-powered-by: [Thundar!]
x-thetvdb-api-version: [2.1.1]
status: {code: 404, message: Not Found}
version: 1
| {
"pile_set_name": "Github"
} |
//
// DiskManagerExceptionTests.cs
//
// Authors:
// Alan McGovern [email protected]
//
// Copyright (C) 2009 Alan McGovern
//
// Permission is hereby granted, free of charge, to any person obtaining
// a copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to
// permit persons to whom the Software is furnished to do so, subject to
// the following conditions:
//
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//
using System;
using System.Collections.Generic;
using System.Linq;
using MonoTorrent.Client.PieceWriters;
using NUnit.Framework;
using ReusableTasks;
namespace MonoTorrent.Client
{
[TestFixture]
public class DiskManagerExceptionTests
{
public class ExceptionWriter : IPieceWriter
{
public bool exist, close, flush, move, read, write;
public List<ITorrentFileInfo> FlushedFiles = new List<ITorrentFileInfo> ();
public ReusableTask CloseAsync (ITorrentFileInfo file)
{
if (close)
throw new Exception ("close");
return ReusableTask.CompletedTask;
}
public ReusableTask<bool> ExistsAsync (ITorrentFileInfo file)
{
if (exist)
throw new Exception ("exists");
return ReusableTask.FromResult (true);
}
public void Dispose ()
{
}
public ReusableTask FlushAsync (ITorrentFileInfo file)
{
if (flush)
throw new Exception ("flush");
FlushedFiles.Add (file);
return ReusableTask.CompletedTask;
}
public ReusableTask MoveAsync (ITorrentFileInfo file, string newPath, bool overwrite)
{
if (move)
throw new Exception ("move");
return ReusableTask.CompletedTask;
}
public ReusableTask<int> ReadAsync (ITorrentFileInfo file, long offset, byte[] buffer, int bufferOffset, int count)
{
if (read)
throw new Exception ("read");
return ReusableTask.FromResult (count);
}
public ReusableTask WriteAsync (ITorrentFileInfo file, long offset, byte[] buffer, int bufferOffset, int count)
{
if (write)
throw new Exception ("write");
return ReusableTask.CompletedTask;
}
}
class TestTorrentData : ITorrentData
{
public IList<ITorrentFileInfo> Files { get; set; }
public int PieceLength { get; set; }
public long Size { get; set; }
}
byte[] buffer;
TestTorrentData data;
DiskManager diskManager;
ExceptionWriter writer;
[SetUp]
public void Setup ()
{
var files = new [] {
new TorrentFileInfo (new TorrentFile ("First", Piece.BlockSize / 2)),
new TorrentFileInfo (new TorrentFile ("Second", Piece.BlockSize)),
new TorrentFileInfo (new TorrentFile ("Third", Piece.BlockSize + Piece.BlockSize / 2)),
new TorrentFileInfo (new TorrentFile ("Fourth", Piece.BlockSize * 2 + Piece.BlockSize / 2)),
};
buffer = new byte[Piece.BlockSize];
data = new TestTorrentData {
Files = files,
Size = files.Sum (f => f.Length),
PieceLength = Piece.BlockSize * 2
};
writer = new ExceptionWriter ();
diskManager = new DiskManager (new EngineSettings (), writer);
}
[Test]
public void CheckAnyFilesExistsFail ()
{
writer.exist = true;
Assert.ThrowsAsync<Exception> (() => diskManager.CheckAnyFilesExistAsync (data));
}
[Test]
public void CheckFileExistsFail ()
{
writer.exist = true;
Assert.ThrowsAsync<Exception> (() => diskManager.CheckFileExistsAsync (data.Files[0]));
}
[Test]
public void CloseFail ()
{
writer.close = true;
Assert.ThrowsAsync<Exception> (() => diskManager.CloseFilesAsync (data));
}
[Test]
public void MoveFileFail ()
{
writer.move = true;
Assert.ThrowsAsync<Exception> (() => diskManager.MoveFileAsync ((TorrentFileInfo)data.Files[0], "root"));
}
[Test]
public void MoveFilesFail ()
{
writer.move = true;
Assert.ThrowsAsync<Exception> (() => diskManager.MoveFilesAsync (data, "root", true));
}
[Test]
public void ReadFail ()
{
writer.read = true;
Assert.ThrowsAsync<Exception> (() => diskManager.ReadAsync (data, 0, buffer, buffer.Length).AsTask ());
}
[Test]
public void WriteFail ()
{
writer.write = true;
Assert.ThrowsAsync<Exception> (() => diskManager.WriteAsync (data, 0, buffer, buffer.Length).AsTask ());
}
}
}
| {
"pile_set_name": "Github"
} |
var logger = require("../logger");
var environment = function(externalEnvironment, fileManagers) {
this.fileManagers = fileManagers || [];
externalEnvironment = externalEnvironment || {};
var optionalFunctions = ["encodeBase64", "mimeLookup", "charsetLookup", "getSourceMapGenerator"],
requiredFunctions = [],
functions = requiredFunctions.concat(optionalFunctions);
for (var i = 0; i < functions.length; i++) {
var propName = functions[i],
environmentFunc = externalEnvironment[propName];
if (environmentFunc) {
this[propName] = environmentFunc.bind(externalEnvironment);
} else if (i < requiredFunctions.length) {
this.warn("missing required function in environment - " + propName);
}
}
};
environment.prototype.getFileManager = function (filename, currentDirectory, options, environment, isSync) {
if (!filename) {
logger.warn("getFileManager called with no filename.. Please report this issue. continuing.");
}
if (currentDirectory == null) {
logger.warn("getFileManager called with null directory.. Please report this issue. continuing.");
}
var fileManagers = this.fileManagers;
if (options.pluginManager) {
fileManagers = [].concat(fileManagers).concat(options.pluginManager.getFileManagers());
}
for (var i = fileManagers.length - 1; i >= 0 ; i--) {
var fileManager = fileManagers[i];
if (fileManager[isSync ? "supportsSync" : "supports"](filename, currentDirectory, options, environment)) {
return fileManager;
}
}
return null;
};
environment.prototype.addFileManager = function (fileManager) {
this.fileManagers.push(fileManager);
};
environment.prototype.clearFileManagers = function () {
this.fileManagers = [];
};
module.exports = environment;
| {
"pile_set_name": "Github"
} |
// SPDX-License-Identifier: GPL-2.0
/*
* linux/fs/hfsplus/btree.c
*
* Copyright (C) 2001
* Brad Boyer ([email protected])
* (C) 2003 Ardis Technologies <[email protected]>
*
* Handle opening/closing btree
*/
#include <linux/slab.h>
#include <linux/pagemap.h>
#include <linux/log2.h>
#include "hfsplus_fs.h"
#include "hfsplus_raw.h"
/*
* Initial source code of clump size calculation is gotten
* from http://opensource.apple.com/tarballs/diskdev_cmds/
*/
#define CLUMP_ENTRIES 15
static short clumptbl[CLUMP_ENTRIES * 3] = {
/*
* Volume Attributes Catalog Extents
* Size Clump (MB) Clump (MB) Clump (MB)
*/
/* 1GB */ 4, 4, 4,
/* 2GB */ 6, 6, 4,
/* 4GB */ 8, 8, 4,
/* 8GB */ 11, 11, 5,
/*
* For volumes 16GB and larger, we want to make sure that a full OS
* install won't require fragmentation of the Catalog or Attributes
* B-trees. We do this by making the clump sizes sufficiently large,
* and by leaving a gap after the B-trees for them to grow into.
*
* For SnowLeopard 10A298, a FullNetInstall with all packages selected
* results in:
* Catalog B-tree Header
* nodeSize: 8192
* totalNodes: 31616
* freeNodes: 1978
* (used = 231.55 MB)
* Attributes B-tree Header
* nodeSize: 8192
* totalNodes: 63232
* freeNodes: 958
* (used = 486.52 MB)
*
* We also want Time Machine backup volumes to have a sufficiently
* large clump size to reduce fragmentation.
*
* The series of numbers for Catalog and Attribute form a geometric
* series. For Catalog (16GB to 512GB), each term is 8**(1/5) times
* the previous term. For Attributes (16GB to 512GB), each term is
* 4**(1/5) times the previous term. For 1TB to 16TB, each term is
* 2**(1/5) times the previous term.
*/
/* 16GB */ 64, 32, 5,
/* 32GB */ 84, 49, 6,
/* 64GB */ 111, 74, 7,
/* 128GB */ 147, 111, 8,
/* 256GB */ 194, 169, 9,
/* 512GB */ 256, 256, 11,
/* 1TB */ 294, 294, 14,
/* 2TB */ 338, 338, 16,
/* 4TB */ 388, 388, 20,
/* 8TB */ 446, 446, 25,
/* 16TB */ 512, 512, 32
};
u32 hfsplus_calc_btree_clump_size(u32 block_size, u32 node_size,
u64 sectors, int file_id)
{
u32 mod = max(node_size, block_size);
u32 clump_size;
int column;
int i;
/* Figure out which column of the above table to use for this file. */
switch (file_id) {
case HFSPLUS_ATTR_CNID:
column = 0;
break;
case HFSPLUS_CAT_CNID:
column = 1;
break;
default:
column = 2;
break;
}
/*
* The default clump size is 0.8% of the volume size. And
* it must also be a multiple of the node and block size.
*/
if (sectors < 0x200000) {
clump_size = sectors << 2; /* 0.8 % */
if (clump_size < (8 * node_size))
clump_size = 8 * node_size;
} else {
/* turn exponent into table index... */
for (i = 0, sectors = sectors >> 22;
sectors && (i < CLUMP_ENTRIES - 1);
++i, sectors = sectors >> 1) {
/* empty body */
}
clump_size = clumptbl[column + (i) * 3] * 1024 * 1024;
}
/*
* Round the clump size to a multiple of node and block size.
* NOTE: This rounds down.
*/
clump_size /= mod;
clump_size *= mod;
/*
* Rounding down could have rounded down to 0 if the block size was
* greater than the clump size. If so, just use one block or node.
*/
if (clump_size == 0)
clump_size = mod;
return clump_size;
}
/* Get a reference to a B*Tree and do some initial checks */
struct hfs_btree *hfs_btree_open(struct super_block *sb, u32 id)
{
struct hfs_btree *tree;
struct hfs_btree_header_rec *head;
struct address_space *mapping;
struct inode *inode;
struct page *page;
unsigned int size;
tree = kzalloc(sizeof(*tree), GFP_KERNEL);
if (!tree)
return NULL;
mutex_init(&tree->tree_lock);
spin_lock_init(&tree->hash_lock);
tree->sb = sb;
tree->cnid = id;
inode = hfsplus_iget(sb, id);
if (IS_ERR(inode))
goto free_tree;
tree->inode = inode;
if (!HFSPLUS_I(tree->inode)->first_blocks) {
pr_err("invalid btree extent records (0 size)\n");
goto free_inode;
}
mapping = tree->inode->i_mapping;
page = read_mapping_page(mapping, 0, NULL);
if (IS_ERR(page))
goto free_inode;
/* Load the header */
head = (struct hfs_btree_header_rec *)(kmap(page) +
sizeof(struct hfs_bnode_desc));
tree->root = be32_to_cpu(head->root);
tree->leaf_count = be32_to_cpu(head->leaf_count);
tree->leaf_head = be32_to_cpu(head->leaf_head);
tree->leaf_tail = be32_to_cpu(head->leaf_tail);
tree->node_count = be32_to_cpu(head->node_count);
tree->free_nodes = be32_to_cpu(head->free_nodes);
tree->attributes = be32_to_cpu(head->attributes);
tree->node_size = be16_to_cpu(head->node_size);
tree->max_key_len = be16_to_cpu(head->max_key_len);
tree->depth = be16_to_cpu(head->depth);
/* Verify the tree and set the correct compare function */
switch (id) {
case HFSPLUS_EXT_CNID:
if (tree->max_key_len != HFSPLUS_EXT_KEYLEN - sizeof(u16)) {
pr_err("invalid extent max_key_len %d\n",
tree->max_key_len);
goto fail_page;
}
if (tree->attributes & HFS_TREE_VARIDXKEYS) {
pr_err("invalid extent btree flag\n");
goto fail_page;
}
tree->keycmp = hfsplus_ext_cmp_key;
break;
case HFSPLUS_CAT_CNID:
if (tree->max_key_len != HFSPLUS_CAT_KEYLEN - sizeof(u16)) {
pr_err("invalid catalog max_key_len %d\n",
tree->max_key_len);
goto fail_page;
}
if (!(tree->attributes & HFS_TREE_VARIDXKEYS)) {
pr_err("invalid catalog btree flag\n");
goto fail_page;
}
if (test_bit(HFSPLUS_SB_HFSX, &HFSPLUS_SB(sb)->flags) &&
(head->key_type == HFSPLUS_KEY_BINARY))
tree->keycmp = hfsplus_cat_bin_cmp_key;
else {
tree->keycmp = hfsplus_cat_case_cmp_key;
set_bit(HFSPLUS_SB_CASEFOLD, &HFSPLUS_SB(sb)->flags);
}
break;
case HFSPLUS_ATTR_CNID:
if (tree->max_key_len != HFSPLUS_ATTR_KEYLEN - sizeof(u16)) {
pr_err("invalid attributes max_key_len %d\n",
tree->max_key_len);
goto fail_page;
}
tree->keycmp = hfsplus_attr_bin_cmp_key;
break;
default:
pr_err("unknown B*Tree requested\n");
goto fail_page;
}
if (!(tree->attributes & HFS_TREE_BIGKEYS)) {
pr_err("invalid btree flag\n");
goto fail_page;
}
size = tree->node_size;
if (!is_power_of_2(size))
goto fail_page;
if (!tree->node_count)
goto fail_page;
tree->node_size_shift = ffs(size) - 1;
tree->pages_per_bnode =
(tree->node_size + PAGE_SIZE - 1) >>
PAGE_SHIFT;
kunmap(page);
put_page(page);
return tree;
fail_page:
put_page(page);
free_inode:
tree->inode->i_mapping->a_ops = &hfsplus_aops;
iput(tree->inode);
free_tree:
kfree(tree);
return NULL;
}
/* Release resources used by a btree */
void hfs_btree_close(struct hfs_btree *tree)
{
struct hfs_bnode *node;
int i;
if (!tree)
return;
for (i = 0; i < NODE_HASH_SIZE; i++) {
while ((node = tree->node_hash[i])) {
tree->node_hash[i] = node->next_hash;
if (atomic_read(&node->refcnt))
pr_crit("node %d:%d "
"still has %d user(s)!\n",
node->tree->cnid, node->this,
atomic_read(&node->refcnt));
hfs_bnode_free(node);
tree->node_hash_cnt--;
}
}
iput(tree->inode);
kfree(tree);
}
int hfs_btree_write(struct hfs_btree *tree)
{
struct hfs_btree_header_rec *head;
struct hfs_bnode *node;
struct page *page;
node = hfs_bnode_find(tree, 0);
if (IS_ERR(node))
/* panic? */
return -EIO;
/* Load the header */
page = node->page[0];
head = (struct hfs_btree_header_rec *)(kmap(page) +
sizeof(struct hfs_bnode_desc));
head->root = cpu_to_be32(tree->root);
head->leaf_count = cpu_to_be32(tree->leaf_count);
head->leaf_head = cpu_to_be32(tree->leaf_head);
head->leaf_tail = cpu_to_be32(tree->leaf_tail);
head->node_count = cpu_to_be32(tree->node_count);
head->free_nodes = cpu_to_be32(tree->free_nodes);
head->attributes = cpu_to_be32(tree->attributes);
head->depth = cpu_to_be16(tree->depth);
kunmap(page);
set_page_dirty(page);
hfs_bnode_put(node);
return 0;
}
static struct hfs_bnode *hfs_bmap_new_bmap(struct hfs_bnode *prev, u32 idx)
{
struct hfs_btree *tree = prev->tree;
struct hfs_bnode *node;
struct hfs_bnode_desc desc;
__be32 cnid;
node = hfs_bnode_create(tree, idx);
if (IS_ERR(node))
return node;
tree->free_nodes--;
prev->next = idx;
cnid = cpu_to_be32(idx);
hfs_bnode_write(prev, &cnid, offsetof(struct hfs_bnode_desc, next), 4);
node->type = HFS_NODE_MAP;
node->num_recs = 1;
hfs_bnode_clear(node, 0, tree->node_size);
desc.next = 0;
desc.prev = 0;
desc.type = HFS_NODE_MAP;
desc.height = 0;
desc.num_recs = cpu_to_be16(1);
desc.reserved = 0;
hfs_bnode_write(node, &desc, 0, sizeof(desc));
hfs_bnode_write_u16(node, 14, 0x8000);
hfs_bnode_write_u16(node, tree->node_size - 2, 14);
hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6);
return node;
}
/* Make sure @tree has enough space for the @rsvd_nodes */
int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes)
{
struct inode *inode = tree->inode;
struct hfsplus_inode_info *hip = HFSPLUS_I(inode);
u32 count;
int res;
if (rsvd_nodes <= 0)
return 0;
while (tree->free_nodes < rsvd_nodes) {
res = hfsplus_file_extend(inode, hfs_bnode_need_zeroout(tree));
if (res)
return res;
hip->phys_size = inode->i_size =
(loff_t)hip->alloc_blocks <<
HFSPLUS_SB(tree->sb)->alloc_blksz_shift;
hip->fs_blocks =
hip->alloc_blocks << HFSPLUS_SB(tree->sb)->fs_shift;
inode_set_bytes(inode, inode->i_size);
count = inode->i_size >> tree->node_size_shift;
tree->free_nodes += count - tree->node_count;
tree->node_count = count;
}
return 0;
}
struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree)
{
struct hfs_bnode *node, *next_node;
struct page **pagep;
u32 nidx, idx;
unsigned off;
u16 off16;
u16 len;
u8 *data, byte, m;
int i, res;
res = hfs_bmap_reserve(tree, 1);
if (res)
return ERR_PTR(res);
nidx = 0;
node = hfs_bnode_find(tree, nidx);
if (IS_ERR(node))
return node;
len = hfs_brec_lenoff(node, 2, &off16);
off = off16;
off += node->page_offset;
pagep = node->page + (off >> PAGE_SHIFT);
data = kmap(*pagep);
off &= ~PAGE_MASK;
idx = 0;
for (;;) {
while (len) {
byte = data[off];
if (byte != 0xff) {
for (m = 0x80, i = 0; i < 8; m >>= 1, i++) {
if (!(byte & m)) {
idx += i;
data[off] |= m;
set_page_dirty(*pagep);
kunmap(*pagep);
tree->free_nodes--;
mark_inode_dirty(tree->inode);
hfs_bnode_put(node);
return hfs_bnode_create(tree,
idx);
}
}
}
if (++off >= PAGE_SIZE) {
kunmap(*pagep);
data = kmap(*++pagep);
off = 0;
}
idx += 8;
len--;
}
kunmap(*pagep);
nidx = node->next;
if (!nidx) {
hfs_dbg(BNODE_MOD, "create new bmap node\n");
next_node = hfs_bmap_new_bmap(node, idx);
} else
next_node = hfs_bnode_find(tree, nidx);
hfs_bnode_put(node);
if (IS_ERR(next_node))
return next_node;
node = next_node;
len = hfs_brec_lenoff(node, 0, &off16);
off = off16;
off += node->page_offset;
pagep = node->page + (off >> PAGE_SHIFT);
data = kmap(*pagep);
off &= ~PAGE_MASK;
}
}
void hfs_bmap_free(struct hfs_bnode *node)
{
struct hfs_btree *tree;
struct page *page;
u16 off, len;
u32 nidx;
u8 *data, byte, m;
hfs_dbg(BNODE_MOD, "btree_free_node: %u\n", node->this);
BUG_ON(!node->this);
tree = node->tree;
nidx = node->this;
node = hfs_bnode_find(tree, 0);
if (IS_ERR(node))
return;
len = hfs_brec_lenoff(node, 2, &off);
while (nidx >= len * 8) {
u32 i;
nidx -= len * 8;
i = node->next;
if (!i) {
/* panic */;
pr_crit("unable to free bnode %u. "
"bmap not found!\n",
node->this);
hfs_bnode_put(node);
return;
}
hfs_bnode_put(node);
node = hfs_bnode_find(tree, i);
if (IS_ERR(node))
return;
if (node->type != HFS_NODE_MAP) {
/* panic */;
pr_crit("invalid bmap found! "
"(%u,%d)\n",
node->this, node->type);
hfs_bnode_put(node);
return;
}
len = hfs_brec_lenoff(node, 0, &off);
}
off += node->page_offset + nidx / 8;
page = node->page[off >> PAGE_SHIFT];
data = kmap(page);
off &= ~PAGE_MASK;
m = 1 << (~nidx & 7);
byte = data[off];
if (!(byte & m)) {
pr_crit("trying to free free bnode "
"%u(%d)\n",
node->this, node->type);
kunmap(page);
hfs_bnode_put(node);
return;
}
data[off] = byte & ~m;
set_page_dirty(page);
kunmap(page);
hfs_bnode_put(node);
tree->free_nodes++;
mark_inode_dirty(tree->inode);
}
| {
"pile_set_name": "Github"
} |
<vector xmlns:android="http://schemas.android.com/apk/res/android"
android:width="24dp"
android:height="24dp"
android:viewportWidth="24"
android:viewportHeight="24"
android:tint="?attr/colorControlNormal">
<path
android:fillColor="@android:color/white"
android:pathData="M18,24h-6.55c-1.08,0 -2.14,-0.45 -2.89,-1.23l-7.3,-7.61 2.07,-1.83c0.62,-0.55 1.53,-0.66 2.26,-0.27L8,14.34V4.79c0,-1.38 1.12,-2.5 2.5,-2.5 0.17,0 0.34,0.02 0.51,0.05 0.09,-1.3 1.17,-2.33 2.49,-2.33 0.86,0 1.61,0.43 2.06,1.09 0.29,-0.12 0.61,-0.18 0.94,-0.18 1.38,0 2.5,1.12 2.5,2.5v0.28c0.16,-0.03 0.33,-0.05 0.5,-0.05 1.38,0 2.5,1.12 2.5,2.5V20c0,2.21 -1.79,4 -4,4zM4.14,15.28l5.86,6.1c0.38,0.39 0.9,0.62 1.44,0.62H18c1.1,0 2,-0.9 2,-2V6.15c0,-0.28 -0.22,-0.5 -0.5,-0.5s-0.5,0.22 -0.5,0.5V12h-2V3.42c0,-0.28 -0.22,-0.5 -0.5,-0.5s-0.5,0.22 -0.5,0.5V12h-2V2.51c0,-0.28 -0.22,-0.5 -0.5,-0.5s-0.5,0.22 -0.5,0.5V12h-2V4.79c0,-0.28 -0.22,-0.5 -0.5,-0.5s-0.5,0.23 -0.5,0.5v12.87l-5.35,-2.83 -0.51,0.45z"/>
</vector>
| {
"pile_set_name": "Github"
} |
107.21.100.218,443,80
167.89.121.150,80,443
192.237.142.203,80
192.28.144.27,443,80
217.12.15.37,443,80
217.146.190.251,443,80
63.250.200.62,80,443
68.142.242.184,80,443
68.180.240.56,80,443
68.180.240.57,443,80
74.6.105.10,443,80
74.6.105.9,80,443
74.6.34.34,443,80
74.6.34.50,443
74.6.50.26,443,80
76.13.28.196,443,80
87.248.114.11,443,80
87.248.114.12,80,443
87.248.116.12,80,443 | {
"pile_set_name": "Github"
} |
CFLAGS = -Wall
TEST_GEN_PROGS = sas
include ../lib.mk
| {
"pile_set_name": "Github"
} |
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
func main(args: [String:Any]) -> [String:Any] {
if let text = args["text"] as? String {
print("Hello " + text + "!")
return [ "payload" : "Hello " + text + "!" ]
} else {
print("Hello stranger!")
return [ "payload" : "Hello stranger!" ]
}
}
| {
"pile_set_name": "Github"
} |
package jetbrains.mps.lang.dataFlow.editor;
/*Generated by MPS */
import jetbrains.mps.editor.runtime.descriptor.AbstractEditorBuilder;
import org.jetbrains.annotations.NotNull;
import org.jetbrains.mps.openapi.model.SNode;
import jetbrains.mps.openapi.editor.EditorContext;
import jetbrains.mps.openapi.editor.cells.EditorCell;
import jetbrains.mps.nodeEditor.cells.EditorCell_Collection;
import jetbrains.mps.nodeEditor.cellLayout.CellLayout_Indent;
import jetbrains.mps.nodeEditor.cells.EditorCell_Constant;
import jetbrains.mps.openapi.editor.style.Style;
import jetbrains.mps.editor.runtime.style.StyleImpl;
import jetbrains.mps.lang.dataFlow.editor.DataFlow_StyleSheet.InstructionStyleClass;
import jetbrains.mps.editor.runtime.style.StyleAttributes;
import jetbrains.mps.lang.editor.cellProviders.SingleRoleCellProvider;
import org.jetbrains.mps.openapi.language.SContainmentLink;
import jetbrains.mps.openapi.editor.cells.CellActionType;
import jetbrains.mps.editor.runtime.impl.cellActions.CellAction_DeleteSmart;
import jetbrains.mps.openapi.editor.cells.DefaultSubstituteInfo;
import jetbrains.mps.nodeEditor.cellMenu.SEmptyContainmentSubstituteInfo;
import jetbrains.mps.nodeEditor.cellMenu.SChildSubstituteInfo;
import jetbrains.mps.openapi.editor.menus.transformation.SNodeLocation;
import jetbrains.mps.smodel.adapter.structure.MetaAdapterFactory;
/*package*/ class EmitTryFinallyStatement_EditorBuilder_a extends AbstractEditorBuilder {
@NotNull
private SNode myNode;
public EmitTryFinallyStatement_EditorBuilder_a(@NotNull EditorContext context, @NotNull SNode node) {
super(context);
myNode = node;
}
@NotNull
@Override
public SNode getNode() {
return myNode;
}
/*package*/ EditorCell createCell() {
return createCollection_0();
}
private EditorCell createCollection_0() {
EditorCell_Collection editorCell = new EditorCell_Collection(getEditorContext(), myNode, new CellLayout_Indent());
editorCell.setCellId("Collection_rf0pho_a");
editorCell.setBig(true);
setCellContext(editorCell);
editorCell.addEditorCell(createConstant_0());
editorCell.addEditorCell(createRefNode_0());
editorCell.addEditorCell(createConstant_1());
editorCell.addEditorCell(createRefNode_1());
editorCell.addEditorCell(createConstant_2());
return editorCell;
}
private EditorCell createConstant_0() {
EditorCell_Constant editorCell = new EditorCell_Constant(getEditorContext(), myNode, "try");
editorCell.setCellId("Constant_rf0pho_a0");
Style style = new StyleImpl();
new InstructionStyleClass(getEditorContext(), getNode()).apply(style, editorCell);
style.set(StyleAttributes.INDENT_LAYOUT_NEW_LINE, true);
editorCell.getStyle().putAll(style);
editorCell.setDefaultText("");
return editorCell;
}
private EditorCell createRefNode_0() {
SingleRoleCellProvider provider = new tryPartSingleRoleHandler_rf0pho_b0(myNode, LINKS.tryPart$oGv6, getEditorContext());
return provider.createCell();
}
private static class tryPartSingleRoleHandler_rf0pho_b0 extends SingleRoleCellProvider {
@NotNull
private SNode myNode;
public tryPartSingleRoleHandler_rf0pho_b0(SNode ownerNode, SContainmentLink containmentLink, EditorContext context) {
super(containmentLink, context);
myNode = ownerNode;
}
@Override
@NotNull
public SNode getNode() {
return myNode;
}
protected EditorCell createChildCell(SNode child) {
EditorCell editorCell = getUpdateSession().updateChildNodeCell(child);
editorCell.setAction(CellActionType.DELETE, new CellAction_DeleteSmart(getNode(), LINKS.tryPart$oGv6, child));
editorCell.setAction(CellActionType.BACKSPACE, new CellAction_DeleteSmart(getNode(), LINKS.tryPart$oGv6, child));
installCellInfo(child, editorCell, false);
return editorCell;
}
private void installCellInfo(SNode child, EditorCell editorCell, boolean isEmpty) {
if (editorCell.getSubstituteInfo() == null || editorCell.getSubstituteInfo() instanceof DefaultSubstituteInfo) {
editorCell.setSubstituteInfo((isEmpty ? new SEmptyContainmentSubstituteInfo(editorCell) : new SChildSubstituteInfo(editorCell)));
}
if (editorCell.getSRole() == null) {
editorCell.setSRole(LINKS.tryPart$oGv6);
}
Style style = new StyleImpl();
style.set(StyleAttributes.INDENT_LAYOUT_INDENT, true);
style.set(StyleAttributes.INDENT_LAYOUT_NEW_LINE, true);
editorCell.getStyle().putAll(style);
}
@Override
protected EditorCell createEmptyCell() {
getCellFactory().pushCellContext();
getCellFactory().setNodeLocation(new SNodeLocation.FromParentAndLink(getNode(), LINKS.tryPart$oGv6));
try {
EditorCell editorCell = super.createEmptyCell();
editorCell.setCellId("empty_tryPart");
installCellInfo(null, editorCell, true);
setCellContext(editorCell);
return editorCell;
} finally {
getCellFactory().popCellContext();
}
}
protected String getNoTargetText() {
return "<no tryPart>";
}
}
private EditorCell createConstant_1() {
EditorCell_Constant editorCell = new EditorCell_Constant(getEditorContext(), myNode, "finally");
editorCell.setCellId("Constant_rf0pho_c0");
Style style = new StyleImpl();
new InstructionStyleClass(getEditorContext(), getNode()).apply(style, editorCell);
style.set(StyleAttributes.INDENT_LAYOUT_NEW_LINE, true);
editorCell.getStyle().putAll(style);
editorCell.setDefaultText("");
return editorCell;
}
private EditorCell createRefNode_1() {
SingleRoleCellProvider provider = new finallyPartSingleRoleHandler_rf0pho_d0(myNode, LINKS.finallyPart$vhCv, getEditorContext());
return provider.createCell();
}
private static class finallyPartSingleRoleHandler_rf0pho_d0 extends SingleRoleCellProvider {
@NotNull
private SNode myNode;
public finallyPartSingleRoleHandler_rf0pho_d0(SNode ownerNode, SContainmentLink containmentLink, EditorContext context) {
super(containmentLink, context);
myNode = ownerNode;
}
@Override
@NotNull
public SNode getNode() {
return myNode;
}
protected EditorCell createChildCell(SNode child) {
EditorCell editorCell = getUpdateSession().updateChildNodeCell(child);
editorCell.setAction(CellActionType.DELETE, new CellAction_DeleteSmart(getNode(), LINKS.finallyPart$vhCv, child));
editorCell.setAction(CellActionType.BACKSPACE, new CellAction_DeleteSmart(getNode(), LINKS.finallyPart$vhCv, child));
installCellInfo(child, editorCell, false);
return editorCell;
}
private void installCellInfo(SNode child, EditorCell editorCell, boolean isEmpty) {
if (editorCell.getSubstituteInfo() == null || editorCell.getSubstituteInfo() instanceof DefaultSubstituteInfo) {
editorCell.setSubstituteInfo((isEmpty ? new SEmptyContainmentSubstituteInfo(editorCell) : new SChildSubstituteInfo(editorCell)));
}
if (editorCell.getSRole() == null) {
editorCell.setSRole(LINKS.finallyPart$vhCv);
}
Style style = new StyleImpl();
style.set(StyleAttributes.INDENT_LAYOUT_INDENT, true);
style.set(StyleAttributes.INDENT_LAYOUT_NEW_LINE, true);
editorCell.getStyle().putAll(style);
}
@Override
protected EditorCell createEmptyCell() {
getCellFactory().pushCellContext();
getCellFactory().setNodeLocation(new SNodeLocation.FromParentAndLink(getNode(), LINKS.finallyPart$vhCv));
try {
EditorCell editorCell = super.createEmptyCell();
editorCell.setCellId("empty_finallyPart");
installCellInfo(null, editorCell, true);
setCellContext(editorCell);
return editorCell;
} finally {
getCellFactory().popCellContext();
}
}
protected String getNoTargetText() {
return "<no finallyPart>";
}
}
private EditorCell createConstant_2() {
EditorCell_Constant editorCell = new EditorCell_Constant(getEditorContext(), myNode, "end");
editorCell.setCellId("Constant_rf0pho_e0");
Style style = new StyleImpl();
new InstructionStyleClass(getEditorContext(), getNode()).apply(style, editorCell);
style.set(StyleAttributes.INDENT_LAYOUT_NEW_LINE, true);
editorCell.getStyle().putAll(style);
editorCell.setDefaultText("");
return editorCell;
}
private static final class LINKS {
/*package*/ static final SContainmentLink tryPart$oGv6 = MetaAdapterFactory.getContainmentLink(0x7fa12e9cb9494976L, 0xb4fa19accbc320b4L, 0x119043714f5L, 0x11904378e28L, "tryPart");
/*package*/ static final SContainmentLink finallyPart$vhCv = MetaAdapterFactory.getContainmentLink(0x7fa12e9cb9494976L, 0xb4fa19accbc320b4L, 0x119043714f5L, 0x1190437aab4L, "finallyPart");
}
}
| {
"pile_set_name": "Github"
} |
// ---------------------------------------------------------------------------------------
// ILGPU
// Copyright (c) 2016-2020 Marcel Koester
// www.ilgpu.net
//
// File: ArgumentMapper.cs
//
// This file is part of ILGPU and is distributed under the University of Illinois Open
// Source License. See LICENSE.txt for details
// ---------------------------------------------------------------------------------------
using ILGPU.Backends.IL;
using ILGPU.IR.Types;
using ILGPU.IR.Values;
using ILGPU.Resources;
using ILGPU.Runtime;
using ILGPU.Util;
using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Diagnostics.CodeAnalysis;
using System.Reflection;
using System.Reflection.Emit;
using System.Runtime.CompilerServices;
namespace ILGPU.Backends.EntryPoints
{
/// <summary>
/// Maps kernel arguments to a compatible representation that
/// can be accessed by the native kernel.
/// </summary>
/// <remarks>Members of this class are not thread safe.</remarks>
public abstract class ArgumentMapper : ICache
{
#region Nested Types
/// <summary>
/// An emission source.
/// </summary>
protected interface ISource
{
/// <summary>
/// Returns the source type.
/// </summary>
Type SourceType { get; }
/// <summary>
/// Emits a load command.
/// </summary>
/// <typeparam name="TILEmitter">The emitter type.</typeparam>
/// <param name="emitter">The current emitter.</param>
void EmitLoadSource<TILEmitter>(in TILEmitter emitter)
where TILEmitter : IILEmitter;
}
/// <summary>
/// An emission target.
/// </summary>
protected interface ITarget
{
/// <summary>
/// Returns the target type.
/// </summary>
Type TargetType { get; }
/// <summary>
/// Emits a target command.
/// </summary>
/// <typeparam name="TILEmitter">The emitter type.</typeparam>
/// <param name="emitter">The current emitter.</param>
void EmitLoadTarget<TILEmitter>(in TILEmitter emitter)
where TILEmitter : IILEmitter;
}
/// <summary>
/// A structure source.
/// </summary>
/// <typeparam name="TParentTarget">The parent source type.</typeparam>
protected readonly struct StructureTarget<TParentTarget> : ITarget
where TParentTarget : ITarget
{
/// <summary>
/// Constructs a new structure target.
/// </summary>
/// <param name="parentTarget">The parent target.</param>
/// <param name="targetField">The target field.</param>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public StructureTarget(in TParentTarget parentTarget, FieldInfo targetField)
{
ParentTarget = parentTarget;
TargetField = targetField;
}
/// <summary cref="ITarget.TargetType"/>
public Type TargetType => TargetField.FieldType;
/// <summary>
/// Returns the parent target.
/// </summary>
public TParentTarget ParentTarget { get; }
/// <summary>
/// Returns the target field.
/// </summary>
public FieldInfo TargetField { get; }
/// <summary cref="ITarget.EmitLoadTarget{TILEmitter}(in TILEmitter)"/>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public void EmitLoadTarget<TILEmitter>(in TILEmitter emitter)
where TILEmitter : IILEmitter
{
ParentTarget.EmitLoadTarget(emitter);
emitter.Emit(OpCodes.Ldflda, TargetField);
}
}
/// <summary>
/// A <see cref="ILLocal"/> target.
/// </summary>
protected readonly struct LocalTarget : ITarget
{
/// <summary>
/// Constructs a new local target.
/// </summary>
/// <param name="local">The current local.</param>
public LocalTarget(ILLocal local)
{
Local = local;
}
/// <summary cref="ITarget.TargetType"/>
public Type TargetType => Local.VariableType;
/// <summary>
/// Returns the associated local variable.
/// </summary>
public ILLocal Local { get; }
/// <summary cref="ITarget.EmitLoadTarget{TILEmitter}(in TILEmitter)"/>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public void EmitLoadTarget<TILEmitter>(in TILEmitter emitter)
where TILEmitter : IILEmitter =>
emitter.Emit(LocalOperation.LoadAddress, Local);
}
/// <summary>
/// An argument source.
/// </summary>
protected readonly struct ArgumentSource : ISource
{
/// <summary>
/// Constructs a new argument source.
/// </summary>
/// <param name="type">The argument type.</param>
/// <param name="argumentIndex">The argument index.</param>
public ArgumentSource(Type type, int argumentIndex)
{
SourceType = type;
ArgumentIndex = argumentIndex;
}
/// <summary cref="ISource.SourceType"/>
public Type SourceType { get; }
/// <summary>
/// Returns the argument index.
/// </summary>
public int ArgumentIndex { get; }
/// <summary>
/// Emits the address of an argument.
/// </summary>
public void EmitLoadSource<TILEmitter>(in TILEmitter emitter)
where TILEmitter : IILEmitter =>
emitter.Emit(ArgumentOperation.LoadAddress, ArgumentIndex);
}
/// <summary>
/// A <see cref="ILLocal"/> source.
/// </summary>
protected readonly struct LocalSource : ISource
{
/// <summary>
/// Constructs a new local source.
/// </summary>
/// <param name="local">The current local.</param>
public LocalSource(ILLocal local)
{
Local = local;
}
/// <summary cref="ISource.SourceType"/>
public Type SourceType => Local.VariableType;
/// <summary>
/// Returns the associated local variable.
/// </summary>
public ILLocal Local { get; }
/// <summary>
/// Emits the address of a local variable.
/// </summary>
public void EmitLoadSource<TILEmitter>(in TILEmitter emitter)
where TILEmitter : IILEmitter =>
emitter.Emit(LocalOperation.LoadAddress, Local);
}
/// <summary>
/// A structure source.
/// </summary>
/// <typeparam name="TParentSource">The parent source type.</typeparam>
protected readonly struct StructureSource<TParentSource> : ISource
where TParentSource : ISource
{
/// <summary>
/// Construct a new structure source.
/// </summary>
/// <param name="parentSource">The parent source.</param>
/// <param name="sourceField">The source field.</param>
public StructureSource(in TParentSource parentSource, FieldInfo sourceField)
{
ParentSource = parentSource;
SourceField = sourceField;
}
/// <summary cref="ISource.SourceType"/>
public Type SourceType => SourceField.FieldType;
/// <summary>
/// Returns the parent source.
/// </summary>
public TParentSource ParentSource { get; }
/// <summary>
/// Returns the source field.
/// </summary>
public FieldInfo SourceField { get; }
/// <summary>
/// Emits the address of a structure field.
/// </summary>
public void EmitLoadSource<TILEmitter>(in TILEmitter emitter)
where TILEmitter : IILEmitter
{
ParentSource.EmitLoadSource(emitter);
emitter.Emit(OpCodes.Ldflda, SourceField);
}
}
/// <summary>
/// A view-parameter source.
/// </summary>
protected readonly struct ViewSource<TSource> : ISource
where TSource : ISource
{
/// <summary>
/// Constructs a new view source.
/// </summary>
/// <param name="source">The underlying source.</param>
/// <param name="viewParameter">The view parameter to map.</param>
public ViewSource(
in TSource source,
in SeparateViewEntryPoint.ViewParameter viewParameter)
{
Source = source;
SourceType = viewParameter.ViewType;
ParameterType = viewParameter.ParameterType;
AccessChain = viewParameter.SourceChain;
}
/// <summary>
/// Returns the underlying source.
/// </summary>
public TSource Source { get; }
/// <summary cref="ISource.SourceType"/>
public Type SourceType { get; }
/// <summary>
/// Returns the parameter type.
/// </summary>
public TypeInformationManager.TypeInformation ParameterType { get; }
/// <summary>
/// Returns the access chain to resolve the actual view instance.
/// </summary>
public FieldAccessChain AccessChain { get; }
/// <summary cref="ISource.EmitLoadSource{TILEmitter}(in TILEmitter)"/>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public void EmitLoadSource<TILEmitter>(in TILEmitter emitter)
where TILEmitter : IILEmitter
{
Source.EmitLoadSource(emitter);
var type = ParameterType;
foreach (var fieldIndex in AccessChain)
{
emitter.Emit(OpCodes.Ldflda, type.Fields[(int)fieldIndex]);
type = type.GetFieldTypeInfo((int)fieldIndex);
}
}
}
/// <summary>
/// An abstract argument mapping handler.
/// </summary>
protected interface IMappingHandler
{
/// <summary>
/// Emits a mapping command that maps a kernel argument.
/// </summary>
/// <typeparam name="TILEmitter">The emitter type.</typeparam>
/// <typeparam name="TSource">The value source type.</typeparam>
/// <param name="emitter">The target emitter.</param>
/// <param name="source">The value source.</param>
/// <param name="argumentIndex">The index of the kernel argument.</param>
void MapArgument<TILEmitter, TSource>(
in TILEmitter emitter,
TSource source,
int argumentIndex)
where TILEmitter : IILEmitter
where TSource : ISource;
}
/// <summary>
/// An abstract argument mapping handler.
/// </summary>
protected interface ISeparateViewMappingHandler
{
/// <summary>
/// Emits a set of commands that map an implementation view instance
/// and stores the converted instance into the given target.
/// </summary>
/// <typeparam name="TILEmitter">The emitter type.</typeparam>
/// <typeparam name="TSource">The value source type.</typeparam>
/// <param name="emitter">The current emitter.</param>
/// <param name="source">The value source.</param>
/// <param name="viewParameter">The source view parameter.</param>
/// <param name="viewArgumentIndex">The argument index.</param>
void MapViewArgument<TILEmitter, TSource>(
in TILEmitter emitter,
in TSource source,
in SeparateViewEntryPoint.ViewParameter viewParameter,
int viewArgumentIndex)
where TILEmitter : IILEmitter
where TSource : ISource;
}
#endregion
#region Instance
/// <summary>
/// The internal type mapping (from old to new types).
/// </summary>
private readonly Dictionary<Type, Type> typeMapping =
new Dictionary<Type, Type>();
/// <summary>
/// Constructs a new argument mapper.
/// </summary>
/// <param name="context">The current context.</param>
protected ArgumentMapper(Context context)
{
Context = context ??
throw new ArgumentNullException(nameof(context));
TypeInformationManager = context.TypeContext;
}
#endregion
#region Properties
/// <summary>
/// Returns the associated context.
/// </summary>
public Context Context { get; }
/// <summary>
/// Returns the associated type-information manager.
/// </summary>
public TypeInformationManager TypeInformationManager { get; }
#endregion
#region Methods
/// <summary>
/// Maps a view type to its implementation specific type.
/// </summary>
/// <param name="viewType">The view type.</param>
/// <param name="elementType">The element type.</param>
/// <returns>The resulting implementation type.</returns>
protected abstract Type MapViewType(Type viewType, Type elementType);
/// <summary>
/// Maps the given structure type to a compatible structure type.
/// </summary>
/// <param name="structType">The structure type to map.</param>
/// <returns>The mapped structure type.</returns>
protected Type MapStructType(Type structType)
{
// Check all element types
var typeInfo = TypeInformationManager.GetTypeInfo(structType);
var sourceFields = typeInfo.Fields;
if (sourceFields.Length < 1)
return structType;
var nestedTypes = new List<Type>(sourceFields.Length);
bool requireCustomType = false;
for (int i = 0, e = sourceFields.Length; i < e; ++i)
{
var sourceFieldType = sourceFields[i].FieldType;
var fieldType = MapType(sourceFieldType);
requireCustomType |= fieldType != sourceFieldType;
nestedTypes.Add(fieldType);
}
if (!requireCustomType)
return structType;
// We need a custom structure type and map all fields
var typeBuilder = RuntimeSystem.Instance.DefineRuntimeStruct();
for (int i = 0, e = sourceFields.Length; i < e; ++i)
{
typeBuilder.DefineField(
"Field" + i,
nestedTypes[i],
FieldAttributes.Public);
}
// Build wrapper type and return it
return typeBuilder.CreateType();
}
/// <summary>
/// Registers a type mapping entry and returns the mapped type.
/// </summary>
/// <param name="type">The source type.</param>
/// <param name="mappedType">The target type.</param>
/// <returns>The mapped type.</returns>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected Type RegisterTypeMapping(Type type, Type mappedType)
{
typeMapping.Add(type, mappedType);
return mappedType;
}
/// <summary>
/// Maps the given source type to a compatible target type.
/// </summary>
/// <param name="type">The source type.</param>
/// <returns>The compatible target type.</returns>
[SuppressMessage(
"Style",
"IDE0046:Convert to conditional expression",
Justification = "Difficult to understand in this case")]
protected Type MapType(Type type)
{
Debug.Assert(type != null, "Invalid source type");
if (typeMapping.TryGetValue(type, out Type mappedType))
return mappedType;
if (type.IsVoidPtr() || type == typeof(void) || type.IsByRef ||
type.IsPointer || type.IsDelegate() || type.IsArray || type.IsClass)
{
throw new ArgumentOutOfRangeException(nameof(type));
}
if (type.IsILGPUPrimitiveType())
return RegisterTypeMapping(type, type);
else if (type.IsPointer)
return RegisterTypeMapping(type, typeof(void*));
else if (type.IsEnum)
return RegisterTypeMapping(type, type.GetEnumUnderlyingType());
else if (type.IsArrayViewType(out Type elementType))
return RegisterTypeMapping(type, MapViewType(type, elementType));
else
return RegisterTypeMapping(type, MapStructType(type));
}
/// <summary>
/// Emits a set of commands that map an implementation view instance
/// and stores the converted instance into the given target.
/// </summary>
/// <typeparam name="TILEmitter">The emitter type.</typeparam>
/// <typeparam name="TSource">The value source type.</typeparam>
/// <typeparam name="TTarget">The value target type.</typeparam>
/// <param name="emitter">The current emitter.</param>
/// <param name="elementType">The element type.</param>
/// <param name="source">The value source.</param>
/// <param name="target">The value target.</param>
protected abstract void MapViewInstance<TILEmitter, TSource, TTarget>(
in TILEmitter emitter,
Type elementType,
TSource source,
TTarget target)
where TILEmitter : IILEmitter
where TSource : ISource
where TTarget : ITarget;
/// <summary>
/// Maps a specific structure instance.
/// </summary>
/// <typeparam name="TILEmitter">The emitter type.</typeparam>
/// <typeparam name="TSource">The value source type.</typeparam>
/// <typeparam name="TTarget">The value target type.</typeparam>
/// <param name="emitter">The current emitter.</param>
/// <param name="source">The value source.</param>
/// <param name="target">The value target.</param>
protected void MapStructInstance<TILEmitter, TSource, TTarget>(
in TILEmitter emitter,
TSource source,
TTarget target)
where TILEmitter : IILEmitter
where TSource : ISource
where TTarget : ITarget
{
// Resolve type info of source and target types
var sourceInfo = TypeInformationManager.GetTypeInfo(source.SourceType);
var targetInfo = TypeInformationManager.GetTypeInfo(target.TargetType);
Debug.Assert(
sourceInfo.NumFields == targetInfo.NumFields,
"Incompatible types");
// Map all field entries
for (int i = 0, e = sourceInfo.NumFields; i < e; ++i)
{
var fieldSource = new StructureSource<TSource>(
source,
sourceInfo.Fields[i]);
var fieldTarget = new StructureTarget<TTarget>(
target,
targetInfo.Fields[i]);
MapInstance(emitter, fieldSource, fieldTarget);
}
}
/// <summary>
/// Maps a value instance.
/// </summary>
/// <typeparam name="TILEmitter">The emitter type.</typeparam>
/// <typeparam name="TSource">The value source type.</typeparam>
/// <typeparam name="TTarget">The value target type.</typeparam>
/// <param name="emitter">The current emitter.</param>
/// <param name="source">The value source.</param>
/// <param name="target">The value target.</param>
protected void MapInstance<TILEmitter, TSource, TTarget>(
in TILEmitter emitter,
TSource source,
TTarget target)
where TILEmitter : IILEmitter
where TSource : ISource
where TTarget : ITarget
{
var sourceType = source.SourceType;
if (sourceType == target.TargetType ||
sourceType.IsEnum)
{
// Copy object from source to target
target.EmitLoadTarget(emitter);
source.EmitLoadSource(emitter);
emitter.Emit(OpCodes.Cpobj, target.TargetType);
}
else if (sourceType.IsArrayViewType(out Type elementType))
{
MapViewInstance(emitter, elementType, source, target);
}
else
{
MapStructInstance(emitter, source, target);
}
}
/// <summary>
/// Creates code that maps the given parameter specification to
/// a compatible representation.
/// </summary>
/// <typeparam name="TILEmitter">The emitter type.</typeparam>
/// <typeparam name="TMappingHandler">The handler type.</typeparam>
/// <param name="emitter">The target emitter to write to.</param>
/// <param name="mappingHandler">The target mapping handler to use.</param>
/// <param name="parameters">The parameter collection to map.</param>
protected void Map<TILEmitter, TMappingHandler>(
in TILEmitter emitter,
in TMappingHandler mappingHandler,
in ParameterCollection parameters)
where TILEmitter : IILEmitter
where TMappingHandler : IMappingHandler
{
// Map all parameters
for (int i = 0, e = parameters.Count; i < e; ++i)
{
if (parameters.IsByRef(i))
{
throw new NotSupportedException(
ErrorMessages.InvalidEntryPointParameter);
}
// Load parameter argument and map instance
var parameterType = parameters.ParameterTypes[i];
var parameterIndex = i + Kernel.KernelParameterOffset;
var argumentSource = new ArgumentSource(parameterType, parameterIndex);
// Map type and check result
var mappedType = MapType(parameterType);
if (mappedType != parameterType)
{
// Perform actual instance mapping on local
var mappingLocal = emitter.DeclareLocal(mappedType);
var localTarget = new LocalTarget(mappingLocal);
MapInstance(emitter, argumentSource, localTarget);
// Map an indirect argument
var localSource = new LocalSource(mappingLocal);
mappingHandler.MapArgument(emitter, localSource, i);
}
else
{
// Map argument directly
mappingHandler.MapArgument(emitter, argumentSource, i);
}
}
}
/// <summary>
/// Creates code that maps (potentially nested) views of kernel arguments
/// separately.
/// </summary>
/// <typeparam name="TILEmitter">The emitter type.</typeparam>
/// <typeparam name="TMappingHandler">The handler type.</typeparam>
/// <param name="emitter">The target emitter to write to.</param>
/// <param name="mappingHandler">The target mapping handler to use.</param>
/// <param name="entryPoint">The entry point to use.</param>
protected static void MapViews<TILEmitter, TMappingHandler>(
in TILEmitter emitter,
in TMappingHandler mappingHandler,
SeparateViewEntryPoint entryPoint)
where TILEmitter : IILEmitter
where TMappingHandler : ISeparateViewMappingHandler
{
Debug.Assert(entryPoint != null, "Invalid entry point");
// Resolve all information from all kernel arguments
int viewArgumentIndex = 0;
var specification = entryPoint.Parameters;
for (int i = 0, e = specification.Count; i < e; ++i)
{
if (specification.IsByRef(i))
{
throw new NotSupportedException(
ErrorMessages.InvalidEntryPointParameter);
}
// Check for matching view specifications
if (!entryPoint.TryGetViewParameters(i, out var views))
continue;
// Load parameter argument source and resolve the access chain
var parameterType = specification.ParameterTypes[i];
var parameterIndex = i + Kernel.KernelParameterOffset;
var argumentSource = new ArgumentSource(parameterType, parameterIndex);
// Map all view parameters
foreach (var view in views)
{
var viewSource = new ViewSource<ArgumentSource>(argumentSource, view);
mappingHandler.MapViewArgument(
emitter,
viewSource,
view,
viewArgumentIndex++);
}
}
}
/// <summary>
/// Clears internal caches.
/// </summary>
/// <param name="mode">The clear mode.</param>
public void ClearCache(ClearCacheMode mode) =>
typeMapping.Clear();
#endregion
}
}
| {
"pile_set_name": "Github"
} |
31--Waiter_Waitress/31_Waiter_Waitress_Waiter_Waitress_31_742.jpg
1
490.082 220.486 45.1271 55.7158 0.994287
| {
"pile_set_name": "Github"
} |
// 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.
// Runtime type representation.
package runtime
import (
"runtime/internal/atomic"
"runtime/internal/sys"
"unsafe"
)
// tflag is documented in reflect/type.go.
//
// tflag values must be kept in sync with copies in:
// go/types.cc
// reflect/type.go
// internal/reflectlite/type.go
type tflag uint8
const (
tflagRegularMemory tflag = 1 << 3 // equal and hash can treat values of this type as a single region of t.size bytes
)
type _type struct {
size uintptr
ptrdata uintptr
hash uint32
tflag tflag
align uint8
fieldAlign uint8
kind uint8
// function for comparing objects of this type
// (ptr to object A, ptr to object B) -> ==?
equal func(unsafe.Pointer, unsafe.Pointer) bool
// gcdata stores the GC type data for the garbage collector.
// If the KindGCProg bit is set in kind, gcdata is a GC program.
// Otherwise it is a ptrmask bitmap. See mbitmap.go for details.
gcdata *byte
_string *string
*uncommontype
ptrToThis *_type
}
func (t *_type) string() string {
// For gccgo, try to strip out quoted strings.
s := *t._string
q := false
started := false
var start int
var end int
for i := 0; i < len(s); i++ {
if s[i] == '\t' {
q = !q
} else if !q {
if !started {
start = i
started = true
}
end = i
}
}
return s[start : end+1]
}
// pkgpath returns the path of the package where t was defined, if
// available. This is not the same as the reflect package's PkgPath
// method, in that it returns the package path for struct and interface
// types, not just named types.
func (t *_type) pkgpath() string {
if u := t.uncommontype; u != nil {
if u.pkgPath == nil {
return ""
}
return *u.pkgPath
}
return ""
}
type method struct {
name *string
pkgPath *string
mtyp *_type
typ *_type
tfn unsafe.Pointer
}
type uncommontype struct {
name *string
pkgPath *string
methods []method
}
type imethod struct {
name *string
pkgPath *string
typ *_type
}
type interfacetype struct {
typ _type
methods []imethod
}
type maptype struct {
typ _type
key *_type
elem *_type
bucket *_type // internal type representing a hash bucket
// function for hashing keys (ptr to key, seed) -> hash
hasher func(unsafe.Pointer, uintptr) uintptr
keysize uint8 // size of key slot
elemsize uint8 // size of elem slot
bucketsize uint16 // size of bucket
flags uint32
}
// Note: flag values must match those used in the TMAP case
// in ../cmd/compile/internal/gc/reflect.go:dtypesym.
func (mt *maptype) indirectkey() bool { // store ptr to key instead of key itself
return mt.flags&1 != 0
}
func (mt *maptype) indirectelem() bool { // store ptr to elem instead of elem itself
return mt.flags&2 != 0
}
func (mt *maptype) reflexivekey() bool { // true if k==k for all keys
return mt.flags&4 != 0
}
func (mt *maptype) needkeyupdate() bool { // true if we need to update key on an overwrite
return mt.flags&8 != 0
}
func (mt *maptype) hashMightPanic() bool { // true if hash function might panic
return mt.flags&16 != 0
}
type arraytype struct {
typ _type
elem *_type
slice *_type
len uintptr
}
type chantype struct {
typ _type
elem *_type
dir uintptr
}
type slicetype struct {
typ _type
elem *_type
}
type functype struct {
typ _type
dotdotdot bool
in []*_type
out []*_type
}
type ptrtype struct {
typ _type
elem *_type
}
type structfield struct {
name *string // nil for embedded fields
pkgPath *string // nil for exported Names; otherwise import path
typ *_type // type of field
tag *string // nil if no tag
offsetAnon uintptr // byte offset of field<<1 | isAnonymous
}
func (f *structfield) offset() uintptr {
return f.offsetAnon >> 1
}
func (f *structfield) anon() bool {
return f.offsetAnon&1 != 0
}
type structtype struct {
typ _type
fields []structfield
}
// typeDescriptorList holds a list of type descriptors generated
// by the compiler. This is used for the compiler to register
// type descriptors to the runtime.
// The layout is known to the compiler.
//go:notinheap
type typeDescriptorList struct {
count int
types [1]uintptr // variable length
}
// typelist holds all type descriptors generated by the comiler.
// This is for the reflect package to deduplicate type descriptors
// when it creates a type that is also a compiler-generated type.
var typelist struct {
initialized uint32
lists []*typeDescriptorList // one element per package
types map[string]uintptr // map from a type's string to *_type, lazily populated
// TODO: use a sorted array instead?
}
var typelistLock mutex
// The compiler generates a call of this function in the main
// package's init function, to register compiler-generated
// type descriptors.
// p points to a list of *typeDescriptorList, n is the length
// of the list.
//go:linkname registerTypeDescriptors
func registerTypeDescriptors(n int, p unsafe.Pointer) {
*(*slice)(unsafe.Pointer(&typelist.lists)) = slice{p, n, n}
}
// The reflect package uses this function to look up a compiler-
// generated type descriptor.
//go:linkname reflect_lookupType reflect.lookupType
func reflect_lookupType(s string) *_type {
// Lazy initialization. We don't need to do this if we never create
// types through reflection.
if atomic.Load(&typelist.initialized) == 0 {
lock(&typelistLock)
if atomic.Load(&typelist.initialized) == 0 {
n := 0
for _, list := range typelist.lists {
n += list.count
}
typelist.types = make(map[string]uintptr, n)
for _, list := range typelist.lists {
for i := 0; i < list.count; i++ {
typ := *(**_type)(add(unsafe.Pointer(&list.types), uintptr(i)*sys.PtrSize))
typelist.types[typ.string()] = uintptr(unsafe.Pointer(typ))
}
}
atomic.Store(&typelist.initialized, 1)
}
unlock(&typelistLock)
}
return (*_type)(unsafe.Pointer(typelist.types[s]))
}
| {
"pile_set_name": "Github"
} |
<?php
/**
* @author Juan Pablo Villafáñez <[email protected]>
*
* @copyright Copyright (c) 2018, ownCloud GmbH
* @license AGPL-3.0
*
* This code is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License, version 3,
* 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 Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License, version 3,
* along with this program. If not, see <http://www.gnu.org/licenses/>
*
*/
namespace OC\Notification\Events;
use Symfony\Component\EventDispatcher\Event;
use OCP\Notification\Events\RegisterNotifierEvent;
use OCP\Notification\INotifier;
use OC\Notification\Manager;
/**
* Abstract class representing a "register notifier" event. The event should be thrown when the
* notification manager needs to retrieve the apps that will send notifications.
* Use the "registerNotifier" function in the event to register the notifier.
* Note that each notification manager is expected to thrown custom implementations of this event
* while hiding the implementation details.
*
* IMPORTANT NOTE: this event might be triggered several times, so plan accordingly. Either
* register always the same instance (per request) or make sure the behaviour won't change if
* several instances are used.
*/
class RegisterNotifierEventImpl extends RegisterNotifierEvent {
/** @var Manager */
private $manager;
public function __construct(Manager $manager) {
$this->manager = $manager;
}
/**
* Register the notifier in the notification manager
* @param INotifier $notifier the notifier to be registered
* @param string $id the id of the app that register the notifier. This must be unique and can't
* be duplicated
* @param string $name the app name
* @throws \OCP\Notification\Exceptions\NotifierIdInUseException if the id is already in use by
* other apps. Note that although this RegisterNotifierEvent might be thrown several times,
* the app has to use the same id, and this exception won't be thrown in this particular scenario.
*/
public function registerNotifier(INotifier $notifier, $id, $name) {
$this->manager->registerBuiltNotifier($notifier, $id, $name);
}
}
| {
"pile_set_name": "Github"
} |
using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace com.spacepuppy.Collections
{
/// <summary>
/// Represents a triggerable state that can be active/inactive.
/// If the state can be activated by multiple sources that overlap, this allows tracking how many
/// sources have activated the state.
///
/// For example if a player can be stunned, it might get stunned by multiple mobs at once. If performed as a boolean
/// an overlap may occur where it gets stuck in a 'stunned' state due to ordering.
///
/// This instead allows each mob to register that it is stunning, and the state turns inactive once all mobs have popped themselves from the stack.
/// </summary>
public class StateFlagStack : IEnumerable<object>
{
public event System.EventHandler ActiveChanged;
#region Fields
private HashSet<object> _stack;
#endregion
#region CONSTRUCTOR
public StateFlagStack()
{
_stack = new HashSet<object>();
}
public StateFlagStack(IEqualityComparer<object> tokenComparer)
{
_stack = new HashSet<object>(tokenComparer);
}
#endregion
#region Properties
public bool Active
{
get { return _stack.Count > 0; }
}
public int ActiveCount
{
get { return _stack.Count; }
}
#endregion
#region Methods
public void Begin(object token)
{
if (token == null) throw new System.ArgumentNullException("token");
if (_stack.Count == 0)
{
_stack.Add(token);
if (_stack.Count > 0 && this.ActiveChanged != null)
{
var d = this.ActiveChanged;
d(this, EventArgs.Empty);
}
}
else
{
_stack.Add(token);
}
}
public void End(object token)
{
if (token == null) throw new System.ArgumentNullException("token");
if (_stack.Count == 0) return;
_stack.Remove(token);
if (_stack.Count == 0 && this.ActiveChanged != null)
{
var d = this.ActiveChanged;
d(this, EventArgs.Empty);
}
}
public void Clear()
{
if (_stack.Count == 0) return;
_stack.Clear();
if (this.ActiveChanged != null)
{
var d = this.ActiveChanged;
d(this, EventArgs.Empty);
}
}
#endregion
#region IEnumerable Interface
public IEnumerator<object> GetEnumerator()
{
return ((IEnumerable<object>)_stack).GetEnumerator();
}
IEnumerator IEnumerable.GetEnumerator()
{
return ((IEnumerable<object>)_stack).GetEnumerator();
}
#endregion
}
}
| {
"pile_set_name": "Github"
} |
#include "io.h"
int main(void)
{
long long rd, rt;
long long res;
rt = 0x8512345654323454;
res = 0xf851034505430345;
__asm
("shra.qh %0, %1, 0x4\n\t"
: "=r"(rd)
: "r"(rt)
);
if (rd != res) {
printf("shra.qh error\n");
return -1;
}
rt = 0x8512345654323454;
res = 0x8512345654323454;
__asm
("shra.qh %0, %1, 0x0\n\t"
: "=r"(rd)
: "r"(rt)
);
if (rd != res) {
printf("shra.qh error1\n");
return -1;
}
return 0;
}
| {
"pile_set_name": "Github"
} |
from voicecmd import VoiceCommand
from inputs.microphone import Microphone
from ex.exception import NotUnderstoodException
from ex.exception import ConnectionLostException
import tts
import stt
import sys
import subprocess
import os
# natural voice command parsing keywords
T_KEYS = ['google', 'youtube', 'search', 'open', 'computer', 'radio', 'video']
I_KEYS = ['news','screenshot']
ACTION_VERBS = ['search', 'look', 'pull', 'get', 'give']
PREPOSITIONS = ['for', 'on', 'of']
class Job:
"""
Store text converted from recorded voice input,
and a boolean describing the job's state of whether
or not it has been processed. Job instances are
processed through the VoiceCommand class.
"""
def __init__(self, recorded_text):
self.recorded_text = recorded_text
self.query = ""
self.is_processed = False
def get_is_processed(self):
"""
Return whether the job has been processed
through the VoiceCommand process or not.
"""
return self.is_processed
def recorded(self):
"""
Return the text version of audio input
interpreted by the Google text to speech engine.
"""
return self.recorded_text
def set_query(self, query):
"""
Set the query of the job, extracted from recorded text
by Brain.classify_job().
"""
self.query = query
def query(self):
"""Return the query associated with the job."""
return self.query
class Brain:
"""
Initialize everything EVE needs to function,
listen for activation input from pocketsphinx,
and execute commands based on voice input.
The Brain class coordinates all other components
of EVE.
"""
def __init__(self):
self.speaker = tts.Google()
self.voice_cmd = VoiceCommand(self.speaker)
self.print_welcome()
print "Saying: Hello there!"
self.speaker.play_wav("./wav/hello.wav")
def print_welcome(self):
"""
Print welcome message in terminal when E.V.E. first starts up
and initializes the Brain class.
"""
welcome_message = """
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+++++++++++++++++++++ Welcome to E.V.E. ++++++++++++++++++++++
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+ +
+ Say 'okay computer' to start! +
+ +
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
"""
print welcome_message
################################################################################
def process_input(self, line, proc):
"""
Take input text and extract activation commands
from it if they exist.
"""
startstring = 'sentence1: <s> '
endstring = ' </s>'
line = line.lower()
if not line:
return False
if 'missing phones' in line:
sys.exit('Error: Missing phonemes for the used grammar file.')
if line.startswith(startstring) and line.strip().endswith(endstring):
phrase = line.strip('\n')[len(startstring):-len(endstring)]
return self.parse(phrase, proc)
def parse(self, phrase, proc):
"""
Identify activation commands from input
extracted by the 'process_input' function and
call the appropriate function for a given command.
"""
params = phrase.split()
if params == ['okay', 'computer']:
if proc is not None:
proc.kill()
self.okaycomputer()
elif params == ['computer', 'lets', 'talk']:
if proc is not None:
proc.kill()
self.conversation()
elif params == ['computer', 'shut', 'down']:
if proc is not None:
proc.kill()
self.shutdown()
elif params == ['computer', 'go', 'sleep']:
if proc is not None:
proc.kill()
self.sleep()
else:
return False
return True
def okaycomputer(self):
"""
Start recording and listening for a voice command
if internet connection is available.
"""
print "Activating..."
# ensure that internet connection is available
if not self.speaker.say("Yes?"):
return
self.listen(False) # False for not conversation mode
def conversation(self):
"""Start a conversation with E.V.E."""
print "Activating..."
# ensure that internet connection is available
if not self.speaker.say("Okay, what do you want to talk about?"):
return
while 1:
self.listen(True) # True for conversation mode
def shutdown(self):
"""Close the E.V.E. program."""
# TODO turn into local wav file
self.speaker.say("E.V.E. will shut down now. Goodbye!")
sys.exit('+++++++++++++++++++++ E.V.E. HAS SHUTDOWN ++++++++++++++++++++')
def sleep(self):
"""Puts E.V.E. to sleep."""
self.speaker.say("E.V.E. will go to sleep now. Wake me when you need me!")
print('+++++++++++++++ E.V.E. IS IN SLEEP MODE ++++++++++++++')
os.system("python idle.py")
sys.exit(1) # does this script terminate before idle.py terminates?
################################################################################
def listen(self, conversation):
"""Initiate listening for voice commands."""
self.audioInput = Microphone()
self.audioInput.listen()
job = self.set_job()
if job is None:
return
if conversation is False:
self.classify_job(job)
else:
if job.recorded().find("no stop") != -1:
self.speaker.say("Ending conversation. It was nice talking to you!")
sys.exit(1)
self.execute_voice_cmd(job, "computer", job.query)
def set_job(self):
"""
Send audio input to Google's Speech to text
engine to be interpreted, and then init a Job class
with the returned text if successful.
"""
speech_to_text = stt.Google(self.audioInput)
try:
recorded_text = speech_to_text.get_text().lower()
return Job(recorded_text)
except NotUnderstoodException:
print "Sorry, I didn't get that."
self.speaker.play_wav("./wav/didntget.wav")
return None
except ConnectionLostException:
print "No connection."
self.speaker.play_wav("./wav/internet_err.wav")
return None
def classify_job(self, job):
"""
Match keywords and keyword order with
words in the job to classify which voice command
the job requires.
"""
action_verb = ""
command_type = ""
t_key = ""
i_key = ""
preposition = ""
query = ""
words = job.recorded().split()
for word in words:
# set action verb if it comes before any other goalpost
if word in ACTION_VERBS and action_verb == "" and t_key == "":
action_verb = word
# set t_key if it comes before any other t_key
elif word in T_KEYS and t_key == "":
t_key = word
command_type = word
# set i_key if it comes before any other key
elif word in I_KEYS and t_key == "" and i_key == "":
i_key = word
command_type = word
# find prepositions in cases such as "youtube video of" or "google for"
elif word in PREPOSITIONS and t_key != "":
preposition = word
# catch the stop recording case
elif word == "no" and words[words.index(word) + 1] == "stop":
print "Accidental recording"
command_type = "no stop"
break
# get query if it exists
if command_type not in I_KEYS and \
command_type != "" and command_type != "no stop":
if preposition == "":
query_list = words[words.index(command_type) + 1:]
else:
query_list = words[words.index(preposition) + 1:]
query = ' '.join(query_list)
job.set_query(query)
self.execute_voice_cmd(job, command_type, query)
def execute_voice_cmd(self, job, command_type, query):
"""
Execute the method in the VoiceCommand class
that is associated with the classified command type.
"""
if command_type == "no stop":
self.voice_cmd.accidental_recording()
elif command_type == "open":
if query != "":
self.voice_cmd.open_webpage(job)
else:
self.speaker.say("no webpage specified.")
elif command_type == "google" or command_type == "search":
if query != "":
self.voice_cmd.search(job)
else:
self.speaker.say("no query provided.")
elif command_type == "youtube" or command_type == "video":
if query != "":
# TODO there are flaws with this method of differentiating
# between search and play for youtube. Improve method.
if job.recorded().find('search') != -1:
self.voice_cmd.search_youtube(job)
else:
self.voice_cmd.play_youtube(job)
else:
self.speaker.say("no query provided.")
elif command_type == "screenshot":
self.voice_cmd.take_screenshot()
elif command_type == "computer":
self.voice_cmd.chatbot_respond(job)
elif command_type == "news":
self.voice_cmd.get_news(job)
elif command_type == "radio":
self.voice_cmd.play_music(job)
else:
self.voice_cmd.ask_wolfram(job)
if not job.get_is_processed:
self.speaker.say("Sorry, I didn't find any results.")
| {
"pile_set_name": "Github"
} |
// @(#)root/mathcore:$Id$
// Authors: W. Brown, M. Fischler, L. Moneta 2005
#ifndef ROOT_Math_GenVector_BoostXfwd
#define ROOT_Math_GenVector_BoostXfwd 1
namespace ROOT {
namespace Math {
/**
Class describing a pure Lorentz Boost along the X axis
*/
class BoostX;
} // namespace Math
} // namespace ROOT
#endif // ROOT_Math_GenVector_BoostXfwd
| {
"pile_set_name": "Github"
} |
#ifndef _RESOLV_STATIC_H
#define _RESOLV_STATIC_H
#include <netdb.h>
/* this structure contains all the variables that were declared
* 'static' in the original NetBSD resolver code.
*
* this caused vast amounts of crashes and memory corruptions
* when the resolver was being used by multiple threads.
*
* (note: the OpenBSD/FreeBSD resolver has similar 'issues')
*/
#define MAXALIASES 35
#define MAXADDRS 35
typedef struct res_static {
char* h_addr_ptrs[MAXADDRS + 1];
char* host_aliases[MAXALIASES];
char hostbuf[8*1024];
u_int32_t host_addr[16 / sizeof(u_int32_t)]; /* IPv4 or IPv6 */
FILE* hostf;
int stayopen;
const char* servent_ptr;
struct servent servent;
struct hostent host;
} *res_static;
extern res_static __res_get_static(void);
#endif /* _RESOLV_STATIC_H */
| {
"pile_set_name": "Github"
} |
package manifest
import (
"testing"
. "github.com/onsi/gomega"
)
const renderOutput = `
---
# Source: big-chart/templates/poke-deployment.yaml
---
apiVersion: apps/v1
kind: Deployment
metadata:
name: big-chart-buzz
spec:
replicas: 1
selector:
matchLabels:
app: big-chart
component: buzz
template:
metadata:
labels:
app: big-chart
component: buzz
spec:
containers:
- name: big-chart-buzz
image: alpine:3.9
command: ['/bin/ash', '-c', 'trap "echo Catch SIGINT, quit now" TERM INT; sleep 100000 & wait']
#command: ["/bin/ash"]
#args:
#- "-c"
#- "while true; do echo 007 Buzzzzzzzz.; sleep 4; done"
---
# Source: big-chart/templates/sleep-deploy-back.yaml
apiVersion: apps/v1
kind: Deployment
metadata:
name: big-chart-back
spec:
selector:
matchLabels:
app: big-chart
component: back
replicas: 3
template:
metadata:
name: big-chart-back
labels:
app: big-chart
component: back
spec:
containers:
- name: big-chart-back
image: alpine:3.9
imagePullPolicy: Always
command: ['/bin/ash', '-c', 'trap "echo Catch SIGINT, quit now" TERM INT; sleep 100000 & wait']
---
# Source: big-chart/templates/sleep-deploy-front.yaml
apiVersion: apps/v1
kind: Deployment
metadata:
name: big-chart-front
spec:
selector:
matchLabels:
app: big-chart
component: front
replicas: 5
template:
metadata:
name: big-chart-front
labels:
app: big-chart
component: front
spec:
containers:
- name: big-chart-front
image: alpine:3.9
imagePullPolicy: Always
command: ['/bin/ash', '-c', 'trap "echo Catch SIGINT, quit now" TERM INT; sleep 100000 & wait']
---
# Source: no-source
apiVersion: apps/v1
metadata:
name: big-chart-front
spec:
selector:
matchLabels:
app: big-chart
component: front
`
func Test_RenderedChart_To_ManifestList(t *testing.T) {
g := NewWithT(t)
manifests, err := GetManifestListFromYamlDocuments(renderOutput)
g.Expect(err).ShouldNot(HaveOccurred())
g.Expect(manifests).To(HaveLen(3), "GetManifestListFromYamlDocuments should return only templates with all basic fields: kind, apiVersion and metadata.name")
}
| {
"pile_set_name": "Github"
} |
Subsets and Splits