text
stringlengths 2
99.9k
| meta
dict |
|---|---|
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <signal.h>
#include <unistd.h>
#include <cstdlib>
#include <cstring>
#include <iostream>
typedef int (main_func_t)(int argc, char *argv[]);
main_func_t one_main;
main_func_t sizes_main;
main_func_t head_main;
main_func_t tail_main;
main_func_t rc_main;
main_func_t n50_main;
main_func_t extract_main;
main_func_t format_main;
main_func_t sort_main;
main_func_t dsort_main;
main_func_t split_main;
#ifdef HAVE_BOOST_REGEX
main_func_t hgrep_main;
main_func_t dgrep_main;
#endif
main_func_t sos;
main_func_t version;
struct cmd_func {
const char *cmd;
main_func_t *func;
};
cmd_func cmd_list[] = {
{"one", &one_main},
{"sizes", &sizes_main},
{"head", &head_main},
{"tail", &tail_main},
{"rc", &rc_main},
{"n50", &n50_main},
{"stats", &n50_main},
{"extract", &extract_main},
{"format", &format_main},
{"hsort", &sort_main},
{"sort", &sort_main},
{"dsort", &dsort_main},
#ifdef HAVE_BOOST_REGEX
{"hgrep", &hgrep_main},
{"dgrep", &dgrep_main},
#endif
{"split", &split_main},
/* help in all its form. Must be first non-command */
{"help", &sos},
{"-h", &sos},
{"-help", &sos},
{"--help", &sos},
{"-?", &sos},
{"--version", &version},
{"-V", &version},
{"", 0}
};
void __sos(std::ostream *os)
{
*os << "Usage: ufasta <cmd> [options] arg..." << std::endl <<
"Where <cmd> is one of: ";
bool comma = false;
for(cmd_func *ccmd = cmd_list; ccmd->func != sos; ccmd++) {
*os << (comma ? ", " : "") << ccmd->cmd;
comma = true;
}
*os << "." << std::endl;
*os << "Options:" << std::endl <<
" --version Display version" << std::endl <<
" --help Display this message" << std::endl;
}
int sos(int argc, char *argv[])
{
__sos(&std::cout);
return 0;
}
int version(int argc, char *argv[])
{
#ifdef PACKAGE_STRING
std::cout << PACKAGE_STRING << std::endl;
#else
std::cout << "0.0.0" << std::endl;
#endif
return 0;
}
void sigpipe_handler(int sig) {
_exit(EXIT_SUCCESS);
}
int main(int argc, char *argv[])
{
std::string error;
// Ignore SIGPIPE. It causes ufasta to fail if output is sent to a
// pipe, which is not very useful for us. Simply exit successfully.
{
struct sigaction sig;
memset(&sig, '\0', sizeof(sig));
sig.sa_handler = sigpipe_handler;
if(sigaction(SIGPIPE, &sig, nullptr) == -1)
perror("sigaction");
}
if(argc < 2) {
error = "Too few arguments";
} else {
for(cmd_func *ccmd = cmd_list; ccmd->func != 0; ccmd++) {
if(!strcmp(ccmd->cmd, argv[1]))
return ccmd->func(argc - 1, argv + 1);
}
error = "Unknown command '";
error += argv[1];
error += "'\n";
}
std::cerr << error << std::endl;
__sos(&std::cerr);
return EXIT_FAILURE;
}
| {
"pile_set_name": "Github"
} |
import IIdentifiable from './Identifiable.interface'
abstract class Storable implements IIdentifiable {
constructor(data: any) {
$.extend(this, data);
}
public abstract getId(): string;
public abstract save();
public abstract remove();
}
export default Storable;
| {
"pile_set_name": "Github"
} |
# Copyright (C) 2001-2006 Python Software Foundation
# Author: Barry Warsaw
# Contact: [email protected]
"""Class representing text/* type MIME documents."""
__all__ = ['MIMEText']
from email.encoders import encode_7or8bit
from email.mime.nonmultipart import MIMENonMultipart
class MIMEText(MIMENonMultipart):
"""Class for generating text/* type MIME documents."""
def __init__(self, _text, _subtype='plain', _charset=None):
"""Create a text/* type MIME document.
_text is the string for this message object.
_subtype is the MIME sub content type, defaulting to "plain".
_charset is the character set parameter added to the Content-Type
header. This defaults to "us-ascii". Note that as a side-effect, the
Content-Transfer-Encoding header will also be set.
"""
# If no _charset was specified, check to see if there are non-ascii
# characters present. If not, use 'us-ascii', otherwise use utf-8.
# XXX: This can be removed once #7304 is fixed.
if _charset is None:
try:
_text.encode('us-ascii')
_charset = 'us-ascii'
except UnicodeEncodeError:
_charset = 'utf-8'
MIMENonMultipart.__init__(self, 'text', _subtype,
**{'charset': _charset})
self.set_payload(_text, _charset)
| {
"pile_set_name": "Github"
} |
if (CMAKE_VERSION VERSION_LESS 2.8.3)
message(FATAL_ERROR "Qt 5 requires at least CMake version 2.8.3")
endif()
get_filename_component(_qt5Gui_install_prefix "${FAST_EXTERNAL_INSTALL_DIR}" ABSOLUTE)
# For backwards compatibility only. Use Qt5Gui_VERSION instead.
set(Qt5Gui_VERSION_STRING 5.8.0)
set(Qt5Gui_LIBRARIES Qt5::Gui)
macro(_qt5_Gui_check_file_exists file)
#if(NOT EXISTS "${file}" )
# message(FATAL_ERROR "The imported target \"Qt5::Gui\" references the file
#\"${file}\"
#but this file does not exist. Possible reasons include:
#* The file was deleted, renamed, or moved to another location.
#* An install or uninstall procedure did not complete successfully.
#* The installation package was faulty and contained
# \"${CMAKE_CURRENT_LIST_FILE}\"
#but not all the files it references.
#")
# endif()
endmacro()
macro(_populate_Gui_target_properties Configuration LIB_LOCATION IMPLIB_LOCATION)
set_property(TARGET Qt5::Gui APPEND PROPERTY IMPORTED_CONFIGURATIONS ${Configuration})
set(imported_location "${_qt5Gui_install_prefix}/lib/${LIB_LOCATION}")
_qt5_Gui_check_file_exists(${imported_location})
set_target_properties(Qt5::Gui PROPERTIES
"INTERFACE_LINK_LIBRARIES" "${_Qt5Gui_LIB_DEPENDENCIES}"
"IMPORTED_LOCATION_${Configuration}" ${imported_location}
"IMPORTED_SONAME_${Configuration}" "libQt5Gui.so.5"
# For backward compatibility with CMake < 2.8.12
"IMPORTED_LINK_INTERFACE_LIBRARIES_${Configuration}" "${_Qt5Gui_LIB_DEPENDENCIES}"
)
endmacro()
if (NOT TARGET Qt5::Gui)
set(_Qt5Gui_OWN_INCLUDE_DIRS "${_qt5Gui_install_prefix}/include/" "${_qt5Gui_install_prefix}/include/QtGui")
set(Qt5Gui_PRIVATE_INCLUDE_DIRS "")
include("${CMAKE_CURRENT_LIST_DIR}/ExtraSourceIncludes.cmake" OPTIONAL)
#foreach(_dir ${_Qt5Gui_OWN_INCLUDE_DIRS})
# _qt5_Gui_check_file_exists(${_dir})
#endforeach()
# Only check existence of private includes if the Private component is
# specified.
list(FIND Qt5Gui_FIND_COMPONENTS Private _check_private)
if (NOT _check_private STREQUAL -1)
foreach(_dir ${Qt5Gui_PRIVATE_INCLUDE_DIRS})
_qt5_Gui_check_file_exists(${_dir})
endforeach()
endif()
set(Qt5Gui_INCLUDE_DIRS ${_Qt5Gui_OWN_INCLUDE_DIRS})
set(Qt5Gui_DEFINITIONS -DQT_GUI_LIB)
set(Qt5Gui_COMPILE_DEFINITIONS QT_GUI_LIB)
set(_Qt5Gui_MODULE_DEPENDENCIES "Core")
set(_Qt5Gui_FIND_DEPENDENCIES_REQUIRED)
if (Qt5Gui_FIND_REQUIRED)
set(_Qt5Gui_FIND_DEPENDENCIES_REQUIRED REQUIRED)
endif()
set(_Qt5Gui_FIND_DEPENDENCIES_QUIET)
if (Qt5Gui_FIND_QUIETLY)
set(_Qt5Gui_DEPENDENCIES_FIND_QUIET QUIET)
endif()
set(_Qt5Gui_FIND_VERSION_EXACT)
if (Qt5Gui_FIND_VERSION_EXACT)
set(_Qt5Gui_FIND_VERSION_EXACT EXACT)
endif()
set(Qt5Gui_EXECUTABLE_COMPILE_FLAGS "")
foreach(_module_dep ${_Qt5Gui_MODULE_DEPENDENCIES})
if (NOT Qt5${_module_dep}_FOUND)
find_package(Qt5${_module_dep}
5.8.0 ${_Qt5Gui_FIND_VERSION_EXACT}
${_Qt5Gui_DEPENDENCIES_FIND_QUIET}
${_Qt5Gui_FIND_DEPENDENCIES_REQUIRED}
PATHS "${CMAKE_CURRENT_LIST_DIR}/.." NO_DEFAULT_PATH
)
endif()
if (NOT Qt5${_module_dep}_FOUND)
set(Qt5Gui_FOUND False)
return()
endif()
list(APPEND Qt5Gui_INCLUDE_DIRS "${Qt5${_module_dep}_INCLUDE_DIRS}")
list(APPEND Qt5Gui_PRIVATE_INCLUDE_DIRS "${Qt5${_module_dep}_PRIVATE_INCLUDE_DIRS}")
list(APPEND Qt5Gui_DEFINITIONS ${Qt5${_module_dep}_DEFINITIONS})
list(APPEND Qt5Gui_COMPILE_DEFINITIONS ${Qt5${_module_dep}_COMPILE_DEFINITIONS})
list(APPEND Qt5Gui_EXECUTABLE_COMPILE_FLAGS ${Qt5${_module_dep}_EXECUTABLE_COMPILE_FLAGS})
endforeach()
list(REMOVE_DUPLICATES Qt5Gui_INCLUDE_DIRS)
list(REMOVE_DUPLICATES Qt5Gui_PRIVATE_INCLUDE_DIRS)
list(REMOVE_DUPLICATES Qt5Gui_DEFINITIONS)
list(REMOVE_DUPLICATES Qt5Gui_COMPILE_DEFINITIONS)
list(REMOVE_DUPLICATES Qt5Gui_EXECUTABLE_COMPILE_FLAGS)
set(_Qt5Gui_LIB_DEPENDENCIES "Qt5::Core")
add_library(Qt5::Gui SHARED IMPORTED)
#set_property(TARGET Qt5::Gui PROPERTY
# INTERFACE_INCLUDE_DIRECTORIES ${_Qt5Gui_OWN_INCLUDE_DIRS})
set_property(TARGET Qt5::Gui PROPERTY
INTERFACE_COMPILE_DEFINITIONS QT_GUI_LIB)
_populate_Gui_target_properties(RELEASE "libQt5Gui.so.5.8.0" "" )
file(GLOB pluginTargets "${CMAKE_CURRENT_LIST_DIR}/Qt5Gui_*Plugin.cmake")
macro(_populate_Gui_plugin_properties Plugin Configuration PLUGIN_LOCATION)
set_property(TARGET Qt5::${Plugin} APPEND PROPERTY IMPORTED_CONFIGURATIONS ${Configuration})
set(imported_location "${_qt5Gui_install_prefix}/plugins/${PLUGIN_LOCATION}")
_qt5_Gui_check_file_exists(${imported_location})
set_target_properties(Qt5::${Plugin} PROPERTIES
"IMPORTED_LOCATION_${Configuration}" ${imported_location}
)
endmacro()
if (pluginTargets)
foreach(pluginTarget ${pluginTargets})
include(${pluginTarget})
endforeach()
endif()
include("${CMAKE_CURRENT_LIST_DIR}/Qt5GuiConfigExtras.cmake")
_qt5_Gui_check_file_exists("${CMAKE_CURRENT_LIST_DIR}/Qt5GuiConfigVersion.cmake")
endif()
| {
"pile_set_name": "Github"
} |
doc: [
DocGroup({"tag": "h1"}, [
DocChars("Hello world!")
]),
DocGroup({"tag": "p"}, [
DocChars("What\'s up with you?")
])
]
a_del: [
DelGroup([
DelChars(3), DelSkip(4), DelChars(5)
]),
DelGroup([
DelChars(1), DelSkip(18)
])
]
a_add: [
AddGroup({"tag": "bullet"}, [
AddGroup({"tag": "h1"}, [
AddChars("7"), AddGroup({"client": "b", "tag": "caret"}, []),
AddChars("66"), AddGroup({"tag": "caret", "client": "e"}, [])
]),
AddGroup({"tag": "h1"}, [
AddGroup({"tag": "caret", "client": "a"}, []),
AddChars("Aku"), AddSkip(4), AddGroup({"client": "c", "tag": "caret"}, []),
AddChars("Ly 31h6"), AddGroup({"tag": "caret", "client": "d"}, [])
])
]),
AddGroup({"tag": "bullet"}, [
AddGroup({"tag": "h1"}, [
AddSkip(18)
])
])
]
b_del: [
DelGroup([
DelChars(1), DelSkip(11)
]),
DelGroup([
DelSkip(19)
])
]
b_add: [
AddGroup({"tag": "bullet"}, [
AddGroup({"tag": "h1"}, [
AddChars(" "), AddSkip(11), AddGroup({"client": "f", "tag": "caret"}, []),
AddSkip(19)
])
])
]
| {
"pile_set_name": "Github"
} |
<?xml version="1.0" encoding="UTF-8"?>
<Bucket
type = "1"
version = "1.0">
<ExceptionBreakpoints>
<ExceptionBreakpoint
shouldBeEnabled = "Yes"
ignoreCount = "0"
continueAfterRunningActions = "No"
scope = "1"
stopOnStyle = "0">
</ExceptionBreakpoint>
</ExceptionBreakpoints>
</Bucket>
| {
"pile_set_name": "Github"
} |
using System;
using NTumbleBit.BouncyCastle.Crypto.Parameters;
using NTumbleBit.BouncyCastle.Utilities;
namespace NTumbleBit.BouncyCastle.Crypto.Macs
{
/**
* HMAC implementation based on RFC2104
*
* H(K XOR opad, H(K XOR ipad, text))
*/
internal class HMac
: IMac
{
private const byte IPAD = (byte)0x36;
private const byte OPAD = (byte)0x5C;
private readonly IDigest digest;
private readonly int digestSize;
private readonly int blockLength;
private IMemoable ipadState;
private IMemoable opadState;
private readonly byte[] inputPad;
private readonly byte[] outputBuf;
public HMac(IDigest digest)
{
this.digest = digest;
digestSize = digest.GetDigestSize();
blockLength = digest.GetByteLength();
inputPad = new byte[blockLength];
outputBuf = new byte[blockLength + digestSize];
}
public virtual string AlgorithmName
{
get
{
return digest.AlgorithmName + "/HMAC";
}
}
public virtual IDigest GetUnderlyingDigest()
{
return digest;
}
public virtual void Init(ICipherParameters parameters)
{
digest.Reset();
byte[] key = ((KeyParameter)parameters).GetKey();
int keyLength = key.Length;
if(keyLength > blockLength)
{
digest.BlockUpdate(key, 0, keyLength);
digest.DoFinal(inputPad, 0);
keyLength = digestSize;
}
else
{
Array.Copy(key, 0, inputPad, 0, keyLength);
}
Array.Clear(inputPad, keyLength, blockLength - keyLength);
Array.Copy(inputPad, 0, outputBuf, 0, blockLength);
XorPad(inputPad, blockLength, IPAD);
XorPad(outputBuf, blockLength, OPAD);
if(digest is IMemoable)
{
opadState = ((IMemoable)digest).Copy();
((IDigest)opadState).BlockUpdate(outputBuf, 0, blockLength);
}
digest.BlockUpdate(inputPad, 0, inputPad.Length);
if(digest is IMemoable)
{
ipadState = ((IMemoable)digest).Copy();
}
}
public virtual int GetMacSize()
{
return digestSize;
}
public virtual void Update(byte input)
{
digest.Update(input);
}
public virtual void BlockUpdate(byte[] input, int inOff, int len)
{
digest.BlockUpdate(input, inOff, len);
}
public virtual int DoFinal(byte[] output, int outOff)
{
digest.DoFinal(outputBuf, blockLength);
if(opadState != null)
{
((IMemoable)digest).Reset(opadState);
digest.BlockUpdate(outputBuf, blockLength, digest.GetDigestSize());
}
else
{
digest.BlockUpdate(outputBuf, 0, outputBuf.Length);
}
int len = digest.DoFinal(output, outOff);
Array.Clear(outputBuf, blockLength, digestSize);
if(ipadState != null)
{
((IMemoable)digest).Reset(ipadState);
}
else
{
digest.BlockUpdate(inputPad, 0, inputPad.Length);
}
return len;
}
/**
* Reset the mac generator.
*/
public virtual void Reset()
{
// Reset underlying digest
digest.Reset();
// Initialise the digest
digest.BlockUpdate(inputPad, 0, inputPad.Length);
}
private static void XorPad(byte[] pad, int len, byte n)
{
for(int i = 0; i < len; ++i)
{
pad[i] ^= n;
}
}
}
}
| {
"pile_set_name": "Github"
} |
/**
* Copyright 2005-2020 Talend
*
* The contents of this file are subject to the terms of one of the following
* open source licenses: Apache 2.0 or or EPL 1.0 (the "Licenses"). You can
* select the license that you prefer but you may not use this file except in
* compliance with one of these Licenses.
*
* You can obtain a copy of the Apache 2.0 license at
* http://www.opensource.org/licenses/apache-2.0
*
* You can obtain a copy of the EPL 1.0 license at
* http://www.opensource.org/licenses/eclipse-1.0
*
* See the Licenses for the specific language governing permissions and
* limitations under the Licenses.
*
* Alternatively, you can obtain a royalty free commercial license with less
* limitations, transferable or non-transferable, directly at
* https://restlet.talend.com/
*
* Restlet is a registered trademark of Talend S.A.
*/
package com.google.gwt.user.rebind.rpc;
import com.google.gwt.core.ext.PropertyOracle;
import com.google.gwt.core.ext.TreeLogger;
import com.google.gwt.core.ext.UnableToCompleteException;
/**
* Inherits from the RPC black list filter.
*
* @author Thierry Boileau
*/
public class RestletBlackListTypeFilter extends BlacklistTypeFilter {
public RestletBlackListTypeFilter(TreeLogger logger,
PropertyOracle propertyOracle) throws UnableToCompleteException {
super(logger, propertyOracle);
}
}
| {
"pile_set_name": "Github"
} |
/*
* Copyright (C) 2017 优客服-多渠道客服系统
* Modifications copyright (C) 2018-2019 Chatopera Inc, <https://www.chatopera.com>
*
* 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.chatopera.cc.persistence.repository;
import com.chatopera.cc.model.User;
import org.springframework.data.domain.Page;
import org.springframework.data.domain.Pageable;
import org.springframework.data.jpa.domain.Specification;
import org.springframework.data.jpa.repository.JpaRepository;
import org.springframework.data.jpa.repository.Query;
import org.springframework.data.repository.query.Param;
import java.util.List;
import java.util.Optional;
public interface UserRepository extends JpaRepository<User, String> {
User findByIdAndOrgi(String paramString, String orgi);
User findById(String id);
User findByEmailAndDatastatus(String email, boolean datastatus);
User findByMobileAndDatastatus(String mobile, boolean datastatus);
@Query(value = "SELECT * FROM cs_user WHERE sipaccount = ?1 AND DATASTATUS = ?2 LIMIT 1", nativeQuery = true)
Optional<User> findOneBySipaccountAndDatastatus(String sipaccount, boolean datastatus);
@Query(value = "SELECT u FROM User u WHERE sipaccount <> '' AND datastatus = 0")
List<User> findBySipaccountIsNotNullAndDatastatusIsFalse();
@Query(value = "SELECT u FROM User u WHERE u.callcenter = 1 " +
"AND u.datastatus = 0 " +
"AND (:users is null OR u.id IN :users)")
List<User> findAllByCallcenterIsTrueAndDatastatusIsFalseAndIdIn(@Param("users") List<String> users);
User findByUsernameAndDatastatus(String username, boolean datastatus);
User findByUsernameAndPasswordAndDatastatus(String username, String password, boolean datastatus);
User findByMobileAndPasswordAndDatastatus(String mobile, String password, boolean datastatus);
User findByUsernameAndOrgi(String paramString, String orgi);
User findByUsernameAndPassword(String username, String password);
Page<User> findByOrgi(String orgi, Pageable paramPageable);
// // 查询系统管理员
// List<User> findBySuperadminAndOrgi(boolean isSuperadmin, final String orgi);
// 查询所有管理员
List<User> findByAdminAndOrgi(boolean admin, final String orgi);
List<User> findByOrgi(String orgi);
Page<User> findByDatastatusAndOrgi(boolean datastatus, String orgi, Pageable paramPageable);
Page<User> findByDatastatusAndOrgiAndUsernameLike(boolean datastatus, String orgi, String username, Pageable paramPageable);
Page<User> findByIdAndOrgi(String id, String orgi, Pageable paramPageable);
List<User> findByOrgiAndDatastatusAndIdIn(
String orgi,
boolean datastatus,
List<String> users);
@Query(value = "SELECT s.sipaccount from User s " +
"WHERE " +
"s.sipaccount is not null AND " +
"s.datastatus = :datastatus AND " +
"s.id IN :users AND " +
"s.orgi = :orgi")
List<String> findSipsByDatastatusAndOrgiAndIdIn(
@Param("datastatus") boolean datastatus,
@Param("orgi") String orgi,
@Param("users") List<String> users);
List<User> findByOrgiAndDatastatus(final String orgi, final boolean datastatus);
Page<User> findByOrgiAndAgentAndDatastatus(final String orgi, final boolean agent, boolean status, Pageable paramPageable);
List<User> findByOrgiAndAgentAndDatastatus(final String orgi, final boolean agent, final boolean status);
long countByAgentAndDatastatusAndIdIn(
final boolean agent,
final boolean datastatus,
final List<String> users);
List<User> findAll(Specification<User> spec);
Page<User> findByDatastatusAndOrgiAndOrgid(
boolean b, String orgi, String orgid,
Pageable pageRequest);
Page<User> findByDatastatusAndOrgiAndOrgidAndSuperadminNot(
boolean datastatus, String orgi, String orgid, boolean superadmin,
Pageable pageRequest);
List<User> findByOrgiAndDatastatusAndOrgid(String orgi, boolean b, String orgid);
Page<User> findByDatastatusAndOrgiAndOrgidAndUsernameLike(
boolean Datastatus,
final String orgi,
final String orgid,
final String username,
Pageable pageRequest);
Page<User> findByAgentAndDatastatusAndIdIn(
boolean agent,
boolean datastatus,
final List<String> users,
Pageable pageRequest);
List<User> findByAgentAndDatastatusAndIdIn(boolean agent, boolean datastatus, final List<String> users);
List<User> findByDatastatusAndIdIn(boolean datastatus, List<String> users);
Page<User> findByDatastatusAndUsernameLikeAndIdIn(
boolean datastatus,
final String username,
final List<String> users, Pageable pageRequest);
List<User> findByOrgidAndAgentAndDatastatus(String orgid, boolean agent, boolean datastatus);
List<User> findByOrgiAndAgentAndDatastatusAndIdIsNot(final String orgi, boolean agent, boolean datastatus, final String id);
}
| {
"pile_set_name": "Github"
} |
/*
Slatwall - An Open Source eCommerce Platform
Copyright (C) ten24, LLC
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 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 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/>.
Linking this program statically or dynamically with other modules is
making a combined work based on this program. Thus, the terms and
conditions of the GNU General Public License cover the whole
combination.
As a special exception, the copyright holders of this program give you
permission to combine this program with independent modules and your
custom code, regardless of the license terms of these independent
modules, and to copy and distribute the resulting program under terms
of your choice, provided that you follow these specific guidelines:
- You also meet the terms and conditions of the license of each
independent module
- You must not alter the default display of the Slatwall name or logo from
any part of the application
- Your custom code must not alter or create any files inside Slatwall,
except in the following directories:
/integrationServices/
You may copy and distribute the modified version of this program that meets
the above guidelines as a combined work under the terms of GPL for this program,
provided that you include the source code of that other code when and as the
GNU GPL requires distribution of source code.
If you modify this program, you may extend this exception to your version
of the program, but you are not obligated to do so.
Notes:
*/
component output="false" accessors="true" extends="Slatwall.org.Hibachi.HibachiJWTService"
{
} | {
"pile_set_name": "Github"
} |
var B = {
name: 'B',
dependencies: ['A'],
typeInfos: [
{
localName: 'ExtendedType',
baseTypeInfo: 'A.BaseType'
}
]
};
module.exports.B = B; | {
"pile_set_name": "Github"
} |
# SPDX-License-Identifier: GPL-2.0-only
config INTEL_POWERCLAMP
tristate "Intel PowerClamp idle injection driver"
depends on X86
depends on CPU_SUP_INTEL
help
Enable this to enable Intel PowerClamp idle injection driver. This
enforce idle time which results in more package C-state residency. The
user interface is exposed via generic thermal framework.
config X86_PKG_TEMP_THERMAL
tristate "X86 package temperature thermal driver"
depends on X86_THERMAL_VECTOR
select THERMAL_GOV_USER_SPACE
select THERMAL_WRITABLE_TRIPS
default m
help
Enable this to register CPU digital sensor for package temperature as
thermal zone. Each package will have its own thermal zone. There are
two trip points which can be set by user to get notifications via thermal
notification methods.
config INTEL_SOC_DTS_IOSF_CORE
tristate
depends on X86 && PCI
select IOSF_MBI
help
This is becoming a common feature for Intel SoCs to expose the additional
digital temperature sensors (DTSs) using side band interface (IOSF). This
implements the common set of helper functions to register, get temperature
and get/set thresholds on DTSs.
config INTEL_SOC_DTS_THERMAL
tristate "Intel SoCs DTS thermal driver"
depends on X86 && PCI && ACPI
select INTEL_SOC_DTS_IOSF_CORE
select THERMAL_WRITABLE_TRIPS
help
Enable this to register Intel SoCs (e.g. Bay Trail) platform digital
temperature sensor (DTS). These SoCs have two additional DTSs in
addition to DTSs on CPU cores. Each DTS will be registered as a
thermal zone. There are two trip points. One of the trip point can
be set by user mode programs to get notifications via Linux thermal
notification methods.The other trip is a critical trip point, which
was set by the driver based on the TJ MAX temperature.
config INTEL_QUARK_DTS_THERMAL
tristate "Intel Quark DTS thermal driver"
depends on X86_INTEL_QUARK
help
Enable this to register Intel Quark SoC (e.g. X1000) platform digital
temperature sensor (DTS). For X1000 SoC, it has one on-die DTS.
The DTS will be registered as a thermal zone. There are two trip points:
hot & critical. The critical trip point default value is set by
underlying BIOS/Firmware.
menu "ACPI INT340X thermal drivers"
source "drivers/thermal/intel/int340x_thermal/Kconfig"
endmenu
config INTEL_BXT_PMIC_THERMAL
tristate "Intel Broxton PMIC thermal driver"
depends on X86 && INTEL_SOC_PMIC_BXTWC && REGMAP
help
Select this driver for Intel Broxton PMIC with ADC channels monitoring
system temperature measurements and alerts.
This driver is used for monitoring the ADC channels of PMIC and handles
the alert trip point interrupts and notifies the thermal framework with
the trip point and temperature details of the zone.
config INTEL_PCH_THERMAL
tristate "Intel PCH Thermal Reporting Driver"
depends on X86 && PCI
help
Enable this to support thermal reporting on certain intel PCHs.
Thermal reporting device will provide temperature reading,
programmable trip points and other information.
| {
"pile_set_name": "Github"
} |
<?php declare(strict_types=1);
namespace Shopware\Storefront\Framework\Routing;
use Shopware\Core\Framework\Routing\AbstractRouteScope;
use Shopware\Core\Framework\Routing\SalesChannelContextRouteScopeDependant;
use Shopware\Core\SalesChannelRequest;
use Symfony\Component\HttpFoundation\Request;
class StorefrontRouteScope extends AbstractRouteScope implements SalesChannelContextRouteScopeDependant
{
public const ID = 'storefront';
/**
* @var string[]
*/
protected $allowedPaths = [];
public function isAllowed(Request $request): bool
{
return $request->attributes->has(SalesChannelRequest::ATTRIBUTE_IS_SALES_CHANNEL_REQUEST)
&& $request->attributes->get(SalesChannelRequest::ATTRIBUTE_IS_SALES_CHANNEL_REQUEST) === true
;
}
public function getId(): string
{
return self::ID;
}
}
| {
"pile_set_name": "Github"
} |
#[doc = "Reader of register SWTRIG"]
pub type R = crate::R<u8, super::SWTRIG>;
#[doc = "Writer for register SWTRIG"]
pub type W = crate::W<u8, super::SWTRIG>;
#[doc = "Register SWTRIG `reset()`'s with value 0"]
impl crate::ResetValue for super::SWTRIG {
type Type = u8;
#[inline(always)]
fn reset_value() -> Self::Type {
0
}
}
#[doc = "Reader of field `FLUSH`"]
pub type FLUSH_R = crate::R<bool, bool>;
#[doc = "Write proxy for field `FLUSH`"]
pub struct FLUSH_W<'a> {
w: &'a mut W,
}
impl<'a> FLUSH_W<'a> {
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
#[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !0x01) | ((value as u8) & 0x01);
self.w
}
}
#[doc = "Reader of field `START`"]
pub type START_R = crate::R<bool, bool>;
#[doc = "Write proxy for field `START`"]
pub struct START_W<'a> {
w: &'a mut W,
}
impl<'a> START_W<'a> {
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
#[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x01 << 1)) | (((value as u8) & 0x01) << 1);
self.w
}
}
impl R {
#[doc = "Bit 0 - ADC Conversion Flush"]
#[inline(always)]
pub fn flush(&self) -> FLUSH_R {
FLUSH_R::new((self.bits & 0x01) != 0)
}
#[doc = "Bit 1 - Start ADC Conversion"]
#[inline(always)]
pub fn start(&self) -> START_R {
START_R::new(((self.bits >> 1) & 0x01) != 0)
}
}
impl W {
#[doc = "Bit 0 - ADC Conversion Flush"]
#[inline(always)]
pub fn flush(&mut self) -> FLUSH_W {
FLUSH_W { w: self }
}
#[doc = "Bit 1 - Start ADC Conversion"]
#[inline(always)]
pub fn start(&mut self) -> START_W {
START_W { w: self }
}
}
| {
"pile_set_name": "Github"
} |
:107E000001C0B7C0112484B790E89093610010922C
:107E10006100882361F0982F9A70923041F081FFC1
:107E200002C097EF94BF282E80E0C6D0E9C085E05D
:107E30008093810082E08093C00088E18093C1003C
:107E40008CE08093C40086E08093C2008EE0B4D0C2
:107E5000279A84E026E83FEF91E030938500209355
:107E6000840096BBB09BFECF1F9AA8954091C0009E
:107E700047FD02C0815089F793D0813479F490D0C6
:107E8000182FA0D0123811F480E004C088E0113817
:107E900009F083E07ED080E17CD0EECF823419F40B
:107EA00084E198D0F8CF853411F485E0FACF853598
:107EB00041F476D0C82F74D0D82FCC0FDD1F82D0DC
:107EC000EACF863519F484E085D0DECF843691F58B
:107ED00067D066D0F82E64D0D82E00E011E05801AB
:107EE0008FEFA81AB80A5CD0F80180838501FA10D8
:107EF000F6CF68D0F5E4DF1201C0FFCF50E040E0DC
:107F000063E0CE0136D08E01E0E0F1E06F0182E067
:107F1000C80ED11C4081518161E0C8012AD00E5F9A
:107F20001F4FF601FC10F2CF50E040E065E0CE01BB
:107F300020D0B1CF843771F433D032D0F82E30D086
:107F400041D08E01F80185918F0123D0FA94F11070
:107F5000F9CFA1CF853739F435D08EE11AD085E934
:107F600018D085E197CF813509F0A9CF88E024D0DA
:107F7000A6CFFC010A0167BFE895112407B600FCF3
:107F8000FDCF667029F0452B19F481E187BFE89594
:107F900008959091C00095FFFCCF8093C60008958E
:107FA0008091C00087FFFCCF8091C00084FD01C09C
:107FB000A8958091C6000895E0E6F0E098E19083EE
:107FC00080830895EDDF803219F088E0F5DFFFCF80
:107FD00084E1DFCFCF93C82FE3DFC150E9F7CF9122
:027FE000F1CFDF
:027FFE00000879
:0400000300007E007B
:00000001FF
| {
"pile_set_name": "Github"
} |
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>arm_fir_decimate_init_f32.c File Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="cmsis.css" rel="stylesheet" type="text/css" />
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
$(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
</head>
<body>
<div id="top"><!-- do not remove this div! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 46px;">
<td id="proglogo"><img alt="CMSIS Logo" src="CMSIS_Logo_Final.png"></td>
<td style="padding-left: 0.5em;">
<div id="projectname">CMSIS-DSP
 <span id="projectnumber">Verison 1.1.0</span>
</div>
<div id="projectbrief">CMSIS DSP Software Library</div>
</td>
</tr>
</tbody>
</table>
</div>
<div id="CMSISnav" class="tabs1">
<ul class="tablist">
<li><a href="../../General/html/index.html"><span>CMSIS</span></a></li>
<li><a href="../../Core/html/index.html"><span>CORE</span></a></li>
<li class="current"><a href="../../DSP/html/index.html"><span>DSP</span></a></li>
<li><a href="../../RTOS/html/index.html"><span>RTOS API</span></a></li>
<li><a href="../../SVD/html/index.html"><span>SVD</span></a></li>
</ul>
</div>
<!-- Generated by Doxygen 1.7.5.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="modules.html"><span>Reference</span></a></li>
<li>
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
</span>
</div>
</li>
</ul>
</div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
initNavTree('arm__fir__decimate__init__f32_8c.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="summary">
<a href="#func-members">Functions</a> </div>
<div class="headertitle">
<div class="title">arm_fir_decimate_init_f32.c File Reference</div> </div>
</div>
<div class="contents">
<table class="memberdecls">
<tr><td colspan="2"><h2><a name="func-members"></a>
Functions</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="arm__math_8h.html#a5e459c6409dfcd2927bb8a57491d7cf6">arm_status</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group___f_i_r__decimate.html#gaaa2524b08220fd6c3f753e692ffc7d3b">arm_fir_decimate_init_f32</a> (<a class="el" href="structarm__fir__decimate__instance__f32.html">arm_fir_decimate_instance_f32</a> *S, uint16_t numTaps, uint8_t M, <a class="el" href="arm__math_8h.html#a4611b605e45ab401f02cab15c5e38715">float32_t</a> *pCoeffs, <a class="el" href="arm__math_8h.html#a4611b605e45ab401f02cab15c5e38715">float32_t</a> *pState, uint32_t <a class="el" href="arm__variance__example__f32_8c.html#ab6558f40a619c2502fbc24c880fd4fb0">blockSize</a>)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Initialization function for the floating-point FIR decimator. <a href="group___f_i_r__decimate.html#gaaa2524b08220fd6c3f753e692ffc7d3b"></a><br/></td></tr>
</table>
</div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="arm__fir__decimate__init__f32_8c.html">arm_fir_decimate_init_f32.c</a> </li>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Data Structures</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark"> </span>Defines</a></div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<li class="footer">Generated on Wed Mar 28 2012 15:38:07 for CMSIS-DSP by ARM Ltd. All rights reserved.
<!--
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.5.1 </li>
-->
</li>
</ul>
</div>
</body>
</html>
| {
"pile_set_name": "Github"
} |
var convert = require('./convert'),
func = convert('isArrayLikeObject', require('../isArrayLikeObject'), require('./_falseOptions'));
func.placeholder = require('./placeholder');
module.exports = func;
| {
"pile_set_name": "Github"
} |
// Copyright (c) 2015-2020 Vladimir Schneider <[email protected]> Use of this source code is governed by the Apache 2.0 license that can be found in the LICENSE file.
package com.vladsch.md.nav.psi.element;
public interface MdReferenceStub extends MdLinkElementStub<MdReference> {
}
| {
"pile_set_name": "Github"
} |
import * as React from 'react';
declare class JqxPanel extends React.PureComponent<IPanelProps, IState> {
protected static getDerivedStateFromProps(props: IPanelProps, state: IState): null | IState;
private _jqx;
private _id;
private _componentSelector;
constructor(props: IPanelProps);
componentDidMount(): void;
componentDidUpdate(): void;
render(): React.ReactNode;
setOptions(options: IPanelProps): void;
getOptions(option: string): any;
append(HTMLElement: any): void;
clearcontent(): void;
destroy(): void;
focus(): void;
getScrollHeight(): number;
getVScrollPosition(): number;
getScrollWidth(): number;
getHScrollPosition(): number;
prepend(HTMLElement: any): void;
remove(HTMLElement: any): void;
scrollTo(left: number | string, top: number | string): void;
private _manageProps;
private _wireEvents;
}
export default JqxPanel;
export declare const jqx: any;
export declare const JQXLite: any;
interface IState {
lastProps: object;
}
interface IPanelOptions {
autoUpdate?: boolean;
disabled?: boolean;
height?: string | number;
rtl?: boolean;
sizeMode?: 'fixed' | 'wrap';
scrollBarSize?: number | string;
theme?: string;
width?: string | number;
}
export interface IPanelProps extends IPanelOptions {
className?: string;
style?: React.CSSProperties;
}
| {
"pile_set_name": "Github"
} |
// (C) Copyright 2007-2009 Andrew Sutton
//
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0 (See accompanying file
// LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
#ifndef BOOST_GRAPH_EXTERIOR_PROPERTY_HPP
#define BOOST_GRAPH_EXTERIOR_PROPERTY_HPP
#include <vector>
#include <boost/graph/property_maps/container_property_map.hpp>
#include <boost/graph/property_maps/matrix_property_map.hpp>
namespace boost {
namespace detail {
// The vector matrix provides a little abstraction over vector
// types that makes matrices easier to work with. Note that it's
// non-copyable, meaning you should be passing it by value.
template <typename Value>
struct vector_matrix
{
typedef std::vector<Value> container_type;
typedef std::vector<container_type> matrix_type;
typedef container_type value_type;
typedef container_type& reference;
typedef const container_type const_reference;
typedef container_type* pointer;
typedef typename matrix_type::size_type size_type;
// Instantiate the matrix over n elements (creates an nxn matrix).
// The graph has to be passed in order to ensure the index maps
// are constructed correctly when returning indexible elements.
inline vector_matrix(size_type n)
: m_matrix(n, container_type(n))
{ }
inline reference operator [](size_type n)
{ return m_matrix[n]; }
inline const_reference operator [](size_type n) const
{ return m_matrix[n]; }
matrix_type m_matrix;
};
} /* namespace detail */
/**
* The exterior_property metafunction defines an appropriate set of types for
* creating an exterior property. An exterior property is comprised of a both
* a container and a property map that acts as its abstraction. An extension
* of this metafunction will select an appropriate "matrix" property that
* records values for pairs of vertices.
*
* @todo This does not currently support the ability to define exterior
* properties for graph types that do not model the IndexGraph concepts. A
* solution should not be especially difficult, but will require an extension
* of type traits to affect the type selection.
*/
template <typename Graph, typename Key, typename Value>
struct exterior_property
{
typedef Key key_type;
typedef Value value_type;
typedef std::vector<Value> container_type;
typedef container_property_map<Graph, Key, container_type> map_type;
typedef detail::vector_matrix<Value> matrix_type;
typedef matrix_property_map<Graph, Key, matrix_type> matrix_map_type;
private:
exterior_property() { }
exterior_property(const exterior_property&) { }
};
/**
* Define a the container and property map types requried to create an exterior
* vertex property for the given value type. The Graph parameter is required to
* model the VertexIndexGraph concept.
*/
template <typename Graph, typename Value>
struct exterior_vertex_property
{
typedef exterior_property<
Graph, typename graph_traits<Graph>::vertex_descriptor, Value
> property_type;
typedef typename property_type::key_type key_type;
typedef typename property_type::value_type value_type;
typedef typename property_type::container_type container_type;
typedef typename property_type::map_type map_type;
typedef typename property_type::matrix_type matrix_type;
typedef typename property_type::matrix_map_type matrix_map_type;
};
/**
* Define a the container and property map types requried to create an exterior
* edge property for the given value type. The Graph parameter is required to
* model the EdgeIndexGraph concept.
*/
template <typename Graph, typename Value>
struct exterior_edge_property
{
typedef exterior_property<
Graph, typename graph_traits<Graph>::edge_descriptor, Value
> property_type;
typedef typename property_type::key_type key_type;
typedef typename property_type::value_type value_type;
typedef typename property_type::container_type container_type;
typedef typename property_type::map_type map_type;
typedef typename property_type::matrix_type matrix_type;
typedef typename property_type::matrix_map_type matrix_map_type;
};
} /* namespace boost */
#endif
| {
"pile_set_name": "Github"
} |
/* crypto/err/err.h */
/* Copyright (C) 1995-1998 Eric Young ([email protected])
* All rights reserved.
*
* This package is an SSL implementation written
* by Eric Young ([email protected]).
* The implementation was written so as to conform with Netscapes SSL.
*
* This library is free for commercial and non-commercial use as long as
* the following conditions are aheared to. The following conditions
* apply to all code found in this distribution, be it the RC4, RSA,
* lhash, DES, etc., code; not just the SSL code. The SSL documentation
* included with this distribution is covered by the same copyright terms
* except that the holder is Tim Hudson ([email protected]).
*
* Copyright remains Eric Young's, and as such any Copyright notices in
* the code are not to be removed.
* If this package is used in a product, Eric Young should be given attribution
* as the author of the parts of the library used.
* This can be in the form of a textual message at program startup or
* in documentation (online or textual) provided with the package.
*
* 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 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. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* "This product includes cryptographic software written by
* Eric Young ([email protected])"
* The word 'cryptographic' can be left out if the rouines from the library
* being used are not cryptographic related :-).
* 4. If you include any Windows specific code (or a derivative thereof) from
* the apps directory (application code) you must include an acknowledgement:
* "This product includes software written by Tim Hudson ([email protected])"
*
* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``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 AUTHOR 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.
*
* The licence and distribution terms for any publically available version or
* derivative of this code cannot be changed. i.e. this code cannot simply be
* copied and put under another distribution licence
* [including the GNU Public Licence.]
*/
/* ====================================================================
* Copyright (c) 1998-2006 The OpenSSL Project. All rights reserved.
*
* 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. All advertising materials mentioning features or use of this
* software must display the following acknowledgment:
* "This product includes software developed by the OpenSSL Project
* for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
*
* 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
* endorse or promote products derived from this software without
* prior written permission. For written permission, please contact
* [email protected].
*
* 5. Products derived from this software may not be called "OpenSSL"
* nor may "OpenSSL" appear in their names without prior written
* permission of the OpenSSL Project.
*
* 6. Redistributions of any form whatsoever must retain the following
* acknowledgment:
* "This product includes software developed by the OpenSSL Project
* for use in the OpenSSL Toolkit (http://www.openssl.org/)"
*
* THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
* EXPRESSED 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 OpenSSL PROJECT OR
* ITS 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 product includes cryptographic software written by Eric Young
* ([email protected]). This product includes software written by Tim
* Hudson ([email protected]).
*
*/
#ifndef HEADER_ERR_H
#define HEADER_ERR_H
#include <openssl/e_os2.h>
#ifndef OPENSSL_NO_FP_API
#include <stdio.h>
#include <stdlib.h>
#endif
#include <openssl/ossl_typ.h>
#ifndef OPENSSL_NO_BIO
#include <openssl/bio.h>
#endif
#ifndef OPENSSL_NO_LHASH
#include <openssl/lhash.h>
#endif
#ifdef __cplusplus
extern "C" {
#endif
#ifndef OPENSSL_NO_ERR
#define ERR_PUT_error(a,b,c,d,e) ERR_put_error(a,b,c,d,e)
#else
#define ERR_PUT_error(a,b,c,d,e) ERR_put_error(a,b,c,NULL,0)
#endif
#include <errno.h>
#define ERR_TXT_MALLOCED 0x01
#define ERR_TXT_STRING 0x02
#define ERR_FLAG_MARK 0x01
#define ERR_NUM_ERRORS 16
typedef struct err_state_st
{
CRYPTO_THREADID tid;
int err_flags[ERR_NUM_ERRORS];
unsigned long err_buffer[ERR_NUM_ERRORS];
char *err_data[ERR_NUM_ERRORS];
int err_data_flags[ERR_NUM_ERRORS];
const char *err_file[ERR_NUM_ERRORS];
int err_line[ERR_NUM_ERRORS];
int top,bottom;
} ERR_STATE;
/* library */
#define ERR_LIB_NONE 1
#define ERR_LIB_SYS 2
#define ERR_LIB_BN 3
#define ERR_LIB_RSA 4
#define ERR_LIB_DH 5
#define ERR_LIB_EVP 6
#define ERR_LIB_BUF 7
#define ERR_LIB_OBJ 8
#define ERR_LIB_PEM 9
#define ERR_LIB_DSA 10
#define ERR_LIB_X509 11
/* #define ERR_LIB_METH 12 */
#define ERR_LIB_ASN1 13
#define ERR_LIB_CONF 14
#define ERR_LIB_CRYPTO 15
#define ERR_LIB_EC 16
#define ERR_LIB_SSL 20
/* #define ERR_LIB_SSL23 21 */
/* #define ERR_LIB_SSL2 22 */
/* #define ERR_LIB_SSL3 23 */
/* #define ERR_LIB_RSAREF 30 */
/* #define ERR_LIB_PROXY 31 */
#define ERR_LIB_BIO 32
#define ERR_LIB_PKCS7 33
#define ERR_LIB_X509V3 34
#define ERR_LIB_PKCS12 35
#define ERR_LIB_RAND 36
#define ERR_LIB_DSO 37
#define ERR_LIB_ENGINE 38
#define ERR_LIB_OCSP 39
#define ERR_LIB_UI 40
#define ERR_LIB_COMP 41
#define ERR_LIB_ECDSA 42
#define ERR_LIB_ECDH 43
#define ERR_LIB_STORE 44
#define ERR_LIB_FIPS 45
#define ERR_LIB_CMS 46
#define ERR_LIB_TS 47
#define ERR_LIB_HMAC 48
#define ERR_LIB_JPAKE 49
#define ERR_LIB_USER 128
#define SYSerr(f,r) ERR_PUT_error(ERR_LIB_SYS,(f),(r),__FILE__,__LINE__)
#define BNerr(f,r) ERR_PUT_error(ERR_LIB_BN,(f),(r),__FILE__,__LINE__)
#define RSAerr(f,r) ERR_PUT_error(ERR_LIB_RSA,(f),(r),__FILE__,__LINE__)
#define DHerr(f,r) ERR_PUT_error(ERR_LIB_DH,(f),(r),__FILE__,__LINE__)
#define EVPerr(f,r) ERR_PUT_error(ERR_LIB_EVP,(f),(r),__FILE__,__LINE__)
#define BUFerr(f,r) ERR_PUT_error(ERR_LIB_BUF,(f),(r),__FILE__,__LINE__)
#define OBJerr(f,r) ERR_PUT_error(ERR_LIB_OBJ,(f),(r),__FILE__,__LINE__)
#define PEMerr(f,r) ERR_PUT_error(ERR_LIB_PEM,(f),(r),__FILE__,__LINE__)
#define DSAerr(f,r) ERR_PUT_error(ERR_LIB_DSA,(f),(r),__FILE__,__LINE__)
#define X509err(f,r) ERR_PUT_error(ERR_LIB_X509,(f),(r),__FILE__,__LINE__)
#define ASN1err(f,r) ERR_PUT_error(ERR_LIB_ASN1,(f),(r),__FILE__,__LINE__)
#define CONFerr(f,r) ERR_PUT_error(ERR_LIB_CONF,(f),(r),__FILE__,__LINE__)
#define CRYPTOerr(f,r) ERR_PUT_error(ERR_LIB_CRYPTO,(f),(r),__FILE__,__LINE__)
#define ECerr(f,r) ERR_PUT_error(ERR_LIB_EC,(f),(r),__FILE__,__LINE__)
#define SSLerr(f,r) ERR_PUT_error(ERR_LIB_SSL,(f),(r),__FILE__,__LINE__)
#define BIOerr(f,r) ERR_PUT_error(ERR_LIB_BIO,(f),(r),__FILE__,__LINE__)
#define PKCS7err(f,r) ERR_PUT_error(ERR_LIB_PKCS7,(f),(r),__FILE__,__LINE__)
#define X509V3err(f,r) ERR_PUT_error(ERR_LIB_X509V3,(f),(r),__FILE__,__LINE__)
#define PKCS12err(f,r) ERR_PUT_error(ERR_LIB_PKCS12,(f),(r),__FILE__,__LINE__)
#define RANDerr(f,r) ERR_PUT_error(ERR_LIB_RAND,(f),(r),__FILE__,__LINE__)
#define DSOerr(f,r) ERR_PUT_error(ERR_LIB_DSO,(f),(r),__FILE__,__LINE__)
#define ENGINEerr(f,r) ERR_PUT_error(ERR_LIB_ENGINE,(f),(r),__FILE__,__LINE__)
#define OCSPerr(f,r) ERR_PUT_error(ERR_LIB_OCSP,(f),(r),__FILE__,__LINE__)
#define UIerr(f,r) ERR_PUT_error(ERR_LIB_UI,(f),(r),__FILE__,__LINE__)
#define COMPerr(f,r) ERR_PUT_error(ERR_LIB_COMP,(f),(r),__FILE__,__LINE__)
#define ECDSAerr(f,r) ERR_PUT_error(ERR_LIB_ECDSA,(f),(r),__FILE__,__LINE__)
#define ECDHerr(f,r) ERR_PUT_error(ERR_LIB_ECDH,(f),(r),__FILE__,__LINE__)
#define STOREerr(f,r) ERR_PUT_error(ERR_LIB_STORE,(f),(r),__FILE__,__LINE__)
#define FIPSerr(f,r) ERR_PUT_error(ERR_LIB_FIPS,(f),(r),__FILE__,__LINE__)
#define CMSerr(f,r) ERR_PUT_error(ERR_LIB_CMS,(f),(r),__FILE__,__LINE__)
#define TSerr(f,r) ERR_PUT_error(ERR_LIB_TS,(f),(r),__FILE__,__LINE__)
#define HMACerr(f,r) ERR_PUT_error(ERR_LIB_HMAC,(f),(r),__FILE__,__LINE__)
#define JPAKEerr(f,r) ERR_PUT_error(ERR_LIB_JPAKE,(f),(r),__FILE__,__LINE__)
/* Borland C seems too stupid to be able to shift and do longs in
* the pre-processor :-( */
#define ERR_PACK(l,f,r) (((((unsigned long)l)&0xffL)*0x1000000)| \
((((unsigned long)f)&0xfffL)*0x1000)| \
((((unsigned long)r)&0xfffL)))
#define ERR_GET_LIB(l) (int)((((unsigned long)l)>>24L)&0xffL)
#define ERR_GET_FUNC(l) (int)((((unsigned long)l)>>12L)&0xfffL)
#define ERR_GET_REASON(l) (int)((l)&0xfffL)
#define ERR_FATAL_ERROR(l) (int)((l)&ERR_R_FATAL)
/* OS functions */
#define SYS_F_FOPEN 1
#define SYS_F_CONNECT 2
#define SYS_F_GETSERVBYNAME 3
#define SYS_F_SOCKET 4
#define SYS_F_IOCTLSOCKET 5
#define SYS_F_BIND 6
#define SYS_F_LISTEN 7
#define SYS_F_ACCEPT 8
#define SYS_F_WSASTARTUP 9 /* Winsock stuff */
#define SYS_F_OPENDIR 10
#define SYS_F_FREAD 11
/* reasons */
#define ERR_R_SYS_LIB ERR_LIB_SYS /* 2 */
#define ERR_R_BN_LIB ERR_LIB_BN /* 3 */
#define ERR_R_RSA_LIB ERR_LIB_RSA /* 4 */
#define ERR_R_DH_LIB ERR_LIB_DH /* 5 */
#define ERR_R_EVP_LIB ERR_LIB_EVP /* 6 */
#define ERR_R_BUF_LIB ERR_LIB_BUF /* 7 */
#define ERR_R_OBJ_LIB ERR_LIB_OBJ /* 8 */
#define ERR_R_PEM_LIB ERR_LIB_PEM /* 9 */
#define ERR_R_DSA_LIB ERR_LIB_DSA /* 10 */
#define ERR_R_X509_LIB ERR_LIB_X509 /* 11 */
#define ERR_R_ASN1_LIB ERR_LIB_ASN1 /* 13 */
#define ERR_R_CONF_LIB ERR_LIB_CONF /* 14 */
#define ERR_R_CRYPTO_LIB ERR_LIB_CRYPTO /* 15 */
#define ERR_R_EC_LIB ERR_LIB_EC /* 16 */
#define ERR_R_SSL_LIB ERR_LIB_SSL /* 20 */
#define ERR_R_BIO_LIB ERR_LIB_BIO /* 32 */
#define ERR_R_PKCS7_LIB ERR_LIB_PKCS7 /* 33 */
#define ERR_R_X509V3_LIB ERR_LIB_X509V3 /* 34 */
#define ERR_R_PKCS12_LIB ERR_LIB_PKCS12 /* 35 */
#define ERR_R_RAND_LIB ERR_LIB_RAND /* 36 */
#define ERR_R_DSO_LIB ERR_LIB_DSO /* 37 */
#define ERR_R_ENGINE_LIB ERR_LIB_ENGINE /* 38 */
#define ERR_R_OCSP_LIB ERR_LIB_OCSP /* 39 */
#define ERR_R_UI_LIB ERR_LIB_UI /* 40 */
#define ERR_R_COMP_LIB ERR_LIB_COMP /* 41 */
#define ERR_R_ECDSA_LIB ERR_LIB_ECDSA /* 42 */
#define ERR_R_ECDH_LIB ERR_LIB_ECDH /* 43 */
#define ERR_R_STORE_LIB ERR_LIB_STORE /* 44 */
#define ERR_R_TS_LIB ERR_LIB_TS /* 45 */
#define ERR_R_NESTED_ASN1_ERROR 58
#define ERR_R_BAD_ASN1_OBJECT_HEADER 59
#define ERR_R_BAD_GET_ASN1_OBJECT_CALL 60
#define ERR_R_EXPECTING_AN_ASN1_SEQUENCE 61
#define ERR_R_ASN1_LENGTH_MISMATCH 62
#define ERR_R_MISSING_ASN1_EOS 63
/* fatal error */
#define ERR_R_FATAL 64
#define ERR_R_MALLOC_FAILURE (1|ERR_R_FATAL)
#define ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED (2|ERR_R_FATAL)
#define ERR_R_PASSED_NULL_PARAMETER (3|ERR_R_FATAL)
#define ERR_R_INTERNAL_ERROR (4|ERR_R_FATAL)
#define ERR_R_DISABLED (5|ERR_R_FATAL)
/* 99 is the maximum possible ERR_R_... code, higher values
* are reserved for the individual libraries */
typedef struct ERR_string_data_st
{
unsigned long error;
const char *string;
} ERR_STRING_DATA;
void ERR_put_error(int lib, int func,int reason,const char *file,int line);
void ERR_set_error_data(char *data,int flags);
unsigned long ERR_get_error(void);
unsigned long ERR_get_error_line(const char **file,int *line);
unsigned long ERR_get_error_line_data(const char **file,int *line,
const char **data, int *flags);
unsigned long ERR_peek_error(void);
unsigned long ERR_peek_error_line(const char **file,int *line);
unsigned long ERR_peek_error_line_data(const char **file,int *line,
const char **data,int *flags);
unsigned long ERR_peek_last_error(void);
unsigned long ERR_peek_last_error_line(const char **file,int *line);
unsigned long ERR_peek_last_error_line_data(const char **file,int *line,
const char **data,int *flags);
void ERR_clear_error(void );
char *ERR_error_string(unsigned long e,char *buf);
void ERR_error_string_n(unsigned long e, char *buf, size_t len);
const char *ERR_lib_error_string(unsigned long e);
const char *ERR_func_error_string(unsigned long e);
const char *ERR_reason_error_string(unsigned long e);
void ERR_print_errors_cb(int (*cb)(const char *str, size_t len, void *u),
void *u);
#ifndef OPENSSL_NO_FP_API
void ERR_print_errors_fp(FILE *fp);
#endif
#ifndef OPENSSL_NO_BIO
void ERR_print_errors(BIO *bp);
void ERR_add_error_data(int num, ...);
#endif
void ERR_load_strings(int lib,ERR_STRING_DATA str[]);
void ERR_unload_strings(int lib,ERR_STRING_DATA str[]);
void ERR_load_ERR_strings(void);
void ERR_load_crypto_strings(void);
void ERR_free_strings(void);
void ERR_remove_thread_state(const CRYPTO_THREADID *tid);
#ifndef OPENSSL_NO_DEPRECATED
void ERR_remove_state(unsigned long pid); /* if zero we look it up */
#endif
ERR_STATE *ERR_get_state(void);
#ifndef OPENSSL_NO_LHASH
LHASH_OF(ERR_STRING_DATA) *ERR_get_string_table(void);
LHASH_OF(ERR_STATE) *ERR_get_err_state_table(void);
void ERR_release_err_state_table(LHASH_OF(ERR_STATE) **hash);
#endif
int ERR_get_next_error_library(void);
int ERR_set_mark(void);
int ERR_pop_to_mark(void);
/* Already defined in ossl_typ.h */
/* typedef struct st_ERR_FNS ERR_FNS; */
/* An application can use this function and provide the return value to loaded
* modules that should use the application's ERR state/functionality */
const ERR_FNS *ERR_get_implementation(void);
/* A loaded module should call this function prior to any ERR operations using
* the application's "ERR_FNS". */
int ERR_set_implementation(const ERR_FNS *fns);
#ifdef __cplusplus
}
#endif
#endif
| {
"pile_set_name": "Github"
} |
<?xml version="1.0" encoding="utf-8"?>
<!-- Copyright (C) 2007 The Android Open Source Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-->
<LinearLayout xmlns:android="http://schemas.android.com/apk/res/android"
android:layout_width="match_parent"
android:layout_height="match_parent"
android:orientation="vertical">
<Button android:id="@+id/next"
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:text="@string/text_switcher_1_next_text" />
<TextSwitcher android:id="@+id/switcher"
android:layout_width="match_parent"
android:layout_height="wrap_content" />
</LinearLayout>
| {
"pile_set_name": "Github"
} |
SolidWorks IGES file using analytic representation for surfaces S 1
1H,,1H;,9HROB-12313,62H\\kentro\work\MEng\Drawings\SDW\SFE Products\ROB\G 1
ROB-12313.IGS,15HSolidWorks 2014,15HSolidWorks 2014,32,308,15,308,15,9HRG 2
OB-12313,1.,1,2HIN,50,0.125,13H141206.122127,1E-008,19684.6456692913, G 3
12HEvan.Spitler,,11,0,13H141206.122127; G 4
314 1 0 0 0 00000200D 1
314 0 8 1 0 0D 2
110 2 0 0 0 01010000D 3
110 0 0 1 0 0D 4
110 3 0 0 0 01010000D 5
110 0 0 1 0 0D 6
120 4 0 0 0 01010000D 7
120 0 0 1 0 0D 8
126 5 0 0 0 01010500D 9
126 0 0 2 0 0D 10
124 7 0 0 0 00000000D 11
124 0 0 3 0 0D 12
100 10 0 0 0 11 01010000D 13
100 0 0 1 0 0D 14
126 11 0 0 0 01010500D 15
126 0 0 2 0 0D 16
110 13 0 0 0 01010000D 17
110 0 0 1 0 0D 18
126 14 0 0 0 01010500D 19
126 0 0 2 0 0D 20
124 16 0 0 0 00000000D 21
124 0 0 3 0 0D 22
100 19 0 0 0 21 01010000D 23
100 0 0 1 0 0D 24
126 20 0 0 0 01010500D 25
126 0 0 2 0 0D 26
110 22 0 0 0 01010000D 27
110 0 0 1 0 0D 28
102 23 0 0 0 01010500D 29
102 0 0 1 0 0D 30
102 24 0 0 0 01010000D 31
102 0 0 1 0 0D 32
142 25 0 0 0 00010500D 33
142 0 0 1 0 0D 34
144 26 0 0 0 00000000D 35
144 0 -1 1 0 0D 36
110 27 0 0 0 01010000D 37
110 0 0 1 0 0D 38
110 28 0 0 0 01010000D 39
110 0 0 1 0 0D 40
120 29 0 0 0 01010000D 41
120 0 0 1 0 0D 42
126 30 0 0 0 01010500D 43
126 0 0 2 0 0D 44
124 32 0 0 0 00000000D 45
124 0 0 3 0 0D 46
100 35 0 0 0 45 01010000D 47
100 0 0 1 0 0D 48
126 36 0 0 0 01010500D 49
126 0 0 2 0 0D 50
110 38 0 0 0 01010000D 51
110 0 0 1 0 0D 52
126 39 0 0 0 01010500D 53
126 0 0 2 0 0D 54
124 41 0 0 0 00000000D 55
124 0 0 3 0 0D 56
100 44 0 0 0 55 01010000D 57
100 0 0 1 0 0D 58
126 45 0 0 0 01010500D 59
126 0 0 2 0 0D 60
110 47 0 0 0 01010000D 61
110 0 0 1 0 0D 62
102 48 0 0 0 01010500D 63
102 0 0 1 0 0D 64
102 49 0 0 0 01010000D 65
102 0 0 1 0 0D 66
142 50 0 0 0 00010500D 67
142 0 0 1 0 0D 68
144 51 0 0 0 00000000D 69
144 0 -1 1 0 0D 70
128 52 0 0 0 01010000D 71
128 0 0 3 0 0D 72
126 55 0 0 0 01010500D 73
126 0 0 22 0 0D 74
124 77 0 0 0 00000000D 75
124 0 0 3 0 0D 76
100 80 0 0 0 75 01010000D 77
100 0 0 1 0 0D 78
126 81 0 0 0 01010500D 79
126 0 0 22 0 0D 80
124 103 0 0 0 00000000D 81
124 0 0 3 0 0D 82
100 106 0 0 0 81 01010000D 83
100 0 0 1 0 0D 84
102 107 0 0 0 01010500D 85
102 0 0 1 0 0D 86
102 108 0 0 0 01010000D 87
102 0 0 1 0 0D 88
142 109 0 0 0 00010500D 89
142 0 0 1 0 0D 90
126 110 0 0 0 01010500D 91
126 0 0 22 0 0D 92
124 132 0 0 0 00000000D 93
124 0 0 3 0 0D 94
100 135 0 0 0 93 01010000D 95
100 0 0 1 0 0D 96
126 136 0 0 0 01010500D 97
126 0 0 22 0 0D 98
124 158 0 0 0 00000000D 99
124 0 0 3 0 0D 100
100 161 0 0 0 99 01010000D 101
100 0 0 1 0 0D 102
102 162 0 0 0 01010500D 103
102 0 0 1 0 0D 104
102 163 0 0 0 01010000D 105
102 0 0 1 0 0D 106
142 164 0 0 0 00010500D 107
142 0 0 1 0 0D 108
144 165 0 0 0 00000000D 109
144 0 -1 1 0 0D 110
110 166 0 0 0 01010000D 111
110 0 0 1 0 0D 112
110 167 0 0 0 01010000D 113
110 0 0 1 0 0D 114
120 168 0 0 0 01010000D 115
120 0 0 1 0 0D 116
126 169 0 0 0 01010500D 117
126 0 0 2 0 0D 118
110 171 0 0 0 01010000D 119
110 0 0 1 0 0D 120
126 172 0 0 0 01010500D 121
126 0 0 2 0 0D 122
124 174 0 0 0 00000000D 123
124 0 0 3 0 0D 124
100 177 0 0 0 123 01010000D 125
100 0 0 1 0 0D 126
126 178 0 0 0 01010500D 127
126 0 0 2 0 0D 128
110 180 0 0 0 01010000D 129
110 0 0 1 0 0D 130
126 181 0 0 0 01010500D 131
126 0 0 2 0 0D 132
124 183 0 0 0 00000000D 133
124 0 0 3 0 0D 134
100 186 0 0 0 133 01010000D 135
100 0 0 1 0 0D 136
102 187 0 0 0 01010500D 137
102 0 0 1 0 0D 138
102 188 0 0 0 01010000D 139
102 0 0 1 0 0D 140
142 189 0 0 0 00010500D 141
142 0 0 1 0 0D 142
144 190 0 0 0 00000000D 143
144 0 -1 1 0 0D 144
128 191 0 0 0 01010000D 145
128 0 0 3 0 0D 146
126 194 0 0 0 01010500D 147
126 0 0 22 0 0D 148
124 216 0 0 0 00000000D 149
124 0 0 3 0 0D 150
100 219 0 0 0 149 01010000D 151
100 0 0 1 0 0D 152
126 220 0 0 0 01010500D 153
126 0 0 22 0 0D 154
124 242 0 0 0 00000000D 155
124 0 0 3 0 0D 156
100 245 0 0 0 155 01010000D 157
100 0 0 1 0 0D 158
102 246 0 0 0 01010500D 159
102 0 0 1 0 0D 160
102 247 0 0 0 01010000D 161
102 0 0 1 0 0D 162
142 248 0 0 0 00010500D 163
142 0 0 1 0 0D 164
126 249 0 0 0 01010500D 165
126 0 0 2 0 0D 166
110 251 0 0 0 01010000D 167
110 0 0 1 0 0D 168
126 252 0 0 0 01010500D 169
126 0 0 2 0 0D 170
110 254 0 0 0 01010000D 171
110 0 0 1 0 0D 172
126 255 0 0 0 01010500D 173
126 0 0 2 0 0D 174
110 257 0 0 0 01010000D 175
110 0 0 1 0 0D 176
126 258 0 0 0 01010500D 177
126 0 0 2 0 0D 178
110 260 0 0 0 01010000D 179
110 0 0 1 0 0D 180
126 261 0 0 0 01010500D 181
126 0 0 2 0 0D 182
110 263 0 0 0 01010000D 183
110 0 0 1 0 0D 184
126 264 0 0 0 01010500D 185
126 0 0 2 0 0D 186
110 266 0 0 0 01010000D 187
110 0 0 1 0 0D 188
102 267 0 0 0 01010500D 189
102 0 0 1 0 0D 190
102 268 0 0 0 01010000D 191
102 0 0 1 0 0D 192
142 269 0 0 0 00010500D 193
142 0 0 1 0 0D 194
144 270 0 0 0 00000000D 195
144 0 -1 1 0 0D 196
128 271 0 0 0 01010000D 197
128 0 0 3 0 0D 198
126 274 0 0 0 01010500D 199
126 0 0 2 0 0D 200
110 276 0 0 0 01010000D 201
110 0 0 1 0 0D 202
126 277 0 0 0 01010500D 203
126 0 0 2 0 0D 204
110 279 0 0 0 01010000D 205
110 0 0 1 0 0D 206
126 280 0 0 0 01010500D 207
126 0 0 2 0 0D 208
110 282 0 0 0 01010000D 209
110 0 0 1 0 0D 210
126 283 0 0 0 01010500D 211
126 0 0 2 0 0D 212
110 285 0 0 0 01010000D 213
110 0 0 1 0 0D 214
102 286 0 0 0 01010500D 215
102 0 0 1 0 0D 216
102 287 0 0 0 01010000D 217
102 0 0 1 0 0D 218
142 288 0 0 0 00010500D 219
142 0 0 1 0 0D 220
144 289 0 0 0 00000000D 221
144 0 -1 1 0 0D 222
128 290 0 0 0 01010000D 223
128 0 0 4 0 0D 224
126 294 0 0 0 01010500D 225
126 0 0 2 0 0D 226
110 296 0 0 0 01010000D 227
110 0 0 1 0 0D 228
126 297 0 0 0 01010500D 229
126 0 0 2 0 0D 230
110 299 0 0 0 01010000D 231
110 0 0 1 0 0D 232
126 300 0 0 0 01010500D 233
126 0 0 2 0 0D 234
110 302 0 0 0 01010000D 235
110 0 0 1 0 0D 236
126 303 0 0 0 01010500D 237
126 0 0 2 0 0D 238
110 305 0 0 0 01010000D 239
110 0 0 1 0 0D 240
102 306 0 0 0 01010500D 241
102 0 0 1 0 0D 242
102 307 0 0 0 01010000D 243
102 0 0 1 0 0D 244
142 308 0 0 0 00010500D 245
142 0 0 1 0 0D 246
144 309 0 0 0 00000000D 247
144 0 -1 1 0 0D 248
128 310 0 0 0 01010000D 249
128 0 0 3 0 0D 250
126 313 0 0 0 01010500D 251
126 0 0 2 0 0D 252
110 315 0 0 0 01010000D 253
110 0 0 1 0 0D 254
126 316 0 0 0 01010500D 255
126 0 0 2 0 0D 256
110 318 0 0 0 01010000D 257
110 0 0 1 0 0D 258
126 319 0 0 0 01010500D 259
126 0 0 2 0 0D 260
110 321 0 0 0 01010000D 261
110 0 0 1 0 0D 262
126 322 0 0 0 01010500D 263
126 0 0 2 0 0D 264
110 324 0 0 0 01010000D 265
110 0 0 1 0 0D 266
102 325 0 0 0 01010500D 267
102 0 0 1 0 0D 268
102 326 0 0 0 01010000D 269
102 0 0 1 0 0D 270
142 327 0 0 0 00010500D 271
142 0 0 1 0 0D 272
144 328 0 0 0 00000000D 273
144 0 -1 1 0 0D 274
128 329 0 0 0 01010000D 275
128 0 0 3 0 0D 276
126 332 0 0 0 01010500D 277
126 0 0 2 0 0D 278
110 334 0 0 0 01010000D 279
110 0 0 1 0 0D 280
126 335 0 0 0 01010500D 281
126 0 0 2 0 0D 282
110 337 0 0 0 01010000D 283
110 0 0 1 0 0D 284
126 338 0 0 0 01010500D 285
126 0 0 2 0 0D 286
110 340 0 0 0 01010000D 287
110 0 0 1 0 0D 288
126 341 0 0 0 01010500D 289
126 0 0 2 0 0D 290
110 343 0 0 0 01010000D 291
110 0 0 1 0 0D 292
102 344 0 0 0 01010500D 293
102 0 0 1 0 0D 294
102 345 0 0 0 01010000D 295
102 0 0 1 0 0D 296
142 346 0 0 0 00010500D 297
142 0 0 1 0 0D 298
144 347 0 0 0 00000000D 299
144 0 -1 1 0 0D 300
128 348 0 0 0 01010000D 301
128 0 0 4 0 0D 302
126 352 0 0 0 01010500D 303
126 0 0 2 0 0D 304
110 354 0 0 0 01010000D 305
110 0 0 1 0 0D 306
126 355 0 0 0 01010500D 307
126 0 0 2 0 0D 308
110 357 0 0 0 01010000D 309
110 0 0 1 0 0D 310
126 358 0 0 0 01010500D 311
126 0 0 2 0 0D 312
110 360 0 0 0 01010000D 313
110 0 0 1 0 0D 314
126 361 0 0 0 01010500D 315
126 0 0 2 0 0D 316
110 363 0 0 0 01010000D 317
110 0 0 1 0 0D 318
102 364 0 0 0 01010500D 319
102 0 0 1 0 0D 320
102 365 0 0 0 01010000D 321
102 0 0 1 0 0D 322
142 366 0 0 0 00010500D 323
142 0 0 1 0 0D 324
144 367 0 0 0 00000000D 325
144 0 -1 1 0 0D 326
128 368 0 0 0 01010000D 327
128 0 0 3 0 0D 328
126 371 0 0 0 01010500D 329
126 0 0 2 0 0D 330
110 373 0 0 0 01010000D 331
110 0 0 1 0 0D 332
126 374 0 0 0 01010500D 333
126 0 0 2 0 0D 334
110 376 0 0 0 01010000D 335
110 0 0 1 0 0D 336
126 377 0 0 0 01010500D 337
126 0 0 2 0 0D 338
110 379 0 0 0 01010000D 339
110 0 0 1 0 0D 340
126 380 0 0 0 01010500D 341
126 0 0 2 0 0D 342
110 382 0 0 0 01010000D 343
110 0 0 1 0 0D 344
102 383 0 0 0 01010500D 345
102 0 0 1 0 0D 346
102 384 0 0 0 01010000D 347
102 0 0 1 0 0D 348
142 385 0 0 0 00010500D 349
142 0 0 1 0 0D 350
144 386 0 0 0 00000000D 351
144 0 -1 1 0 0D 352
128 387 0 0 0 01010000D 353
128 0 0 4 0 0D 354
126 391 0 0 0 01010500D 355
126 0 0 2 0 0D 356
110 393 0 0 0 01010000D 357
110 0 0 1 0 0D 358
126 394 0 0 0 01010500D 359
126 0 0 2 0 0D 360
110 396 0 0 0 01010000D 361
110 0 0 1 0 0D 362
126 397 0 0 0 01010500D 363
126 0 0 2 0 0D 364
110 399 0 0 0 01010000D 365
110 0 0 1 0 0D 366
126 400 0 0 0 01010500D 367
126 0 0 2 0 0D 368
110 402 0 0 0 01010000D 369
110 0 0 1 0 0D 370
126 403 0 0 0 01010500D 371
126 0 0 2 0 0D 372
110 405 0 0 0 01010000D 373
110 0 0 1 0 0D 374
126 406 0 0 0 01010500D 375
126 0 0 2 0 0D 376
110 408 0 0 0 01010000D 377
110 0 0 1 0 0D 378
102 409 0 0 0 01010500D 379
102 0 0 1 0 0D 380
102 410 0 0 0 01010000D 381
102 0 0 1 0 0D 382
142 411 0 0 0 00010500D 383
142 0 0 1 0 0D 384
144 412 0 0 0 00000000D 385
144 0 -1 1 0 0D 386
110 413 0 0 0 01010000D 387
110 0 0 1 0 0D 388
110 414 0 0 0 01010000D 389
110 0 0 1 0 0D 390
120 415 0 0 0 01010000D 391
120 0 0 1 0 0D 392
126 416 0 0 0 01010500D 393
126 0 0 2 0 0D 394
110 418 0 0 0 01010000D 395
110 0 0 1 0 0D 396
126 419 0 0 0 01010500D 397
126 0 0 2 0 0D 398
124 421 0 0 0 00000000D 399
124 0 0 3 0 0D 400
100 424 0 0 0 399 01010000D 401
100 0 0 1 0 0D 402
126 425 0 0 0 01010500D 403
126 0 0 2 0 0D 404
110 427 0 0 0 01010000D 405
110 0 0 1 0 0D 406
126 428 0 0 0 01010500D 407
126 0 0 2 0 0D 408
124 430 0 0 0 00000000D 409
124 0 0 3 0 0D 410
100 433 0 0 0 409 01010000D 411
100 0 0 1 0 0D 412
102 434 0 0 0 01010500D 413
102 0 0 1 0 0D 414
102 435 0 0 0 01010000D 415
102 0 0 1 0 0D 416
142 436 0 0 0 00010500D 417
142 0 0 1 0 0D 418
144 437 0 0 0 00000000D 419
144 0 -1 1 0 0D 420
128 438 0 0 0 01010000D 421
128 0 0 3 0 0D 422
126 441 0 0 0 01010500D 423
126 0 0 22 0 0D 424
124 463 0 0 0 00000000D 425
124 0 0 3 0 0D 426
100 466 0 0 0 425 01010000D 427
100 0 0 1 0 0D 428
126 467 0 0 0 01010500D 429
126 0 0 22 0 0D 430
124 489 0 0 0 00000000D 431
124 0 0 3 0 0D 432
100 492 0 0 0 431 01010000D 433
100 0 0 1 0 0D 434
102 493 0 0 0 01010500D 435
102 0 0 1 0 0D 436
102 494 0 0 0 01010000D 437
102 0 0 1 0 0D 438
142 495 0 0 0 00010500D 439
142 0 0 1 0 0D 440
144 496 0 0 0 00000000D 441
144 0 -1 1 0 0D 442
314,79.2156862745098,81.9607843137255,93.3333333333333,; 1P 1
110,0.,1.263,0.,0.,-38.10707874,0.; 3P 2
110,0.,1.263,-0.0675,0.,0.138,-0.0675; 5P 3
120,3,5,0.,6.28318530717959; 7P 4
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,0.,0.,0.,3.141592654,0., 9P 5
0.,1.,0.,0.,1.; 9P 6
124,1.40271576953299E-014,1.,0.,-1.263,-6.12323399573677E-017, 11P 7
8.58915688636046E-031,-1.,1.263,-1.,1.40271576953299E-014, 11P 8
6.12323399573677E-017,-1.77163001692017E-014; 11P 9
100,0.,0.,1.263,0.0675,1.263,-0.0675,1.263; 13P 10
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,3.141592654,0.,1., 15P 11
3.141592654,0.,0.,1.,0.,0.,1.; 15P 12
110,0.,1.263,0.0675,0.,0.138,0.0675; 17P 13
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,3.141592654,0.,1.,0.,0., 19P 14
0.,1.,0.,0.,1.; 19P 15
124,1.40271576953299E-014,1.,0.,-0.138,-6.12323399573677E-017, 21P 16
8.58915688636046E-031,1.,0.138,1.,-1.40271576953299E-014, 21P 17
6.12323399573677E-017,1.93574776195553E-015; 21P 18
100,0.,0.,0.138,0.0675,0.138,-0.0675,0.138; 23P 19
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,0.,0.,0.,0.,0.,0.,1.,0., 25P 20
0.,1.; 25P 21
110,0.,0.138,-0.0675,0.,1.263,-0.0675; 27P 22
102,4,9,15,19,25; 29P 23
102,4,13,17,23,27; 31P 24
142,1,7,29,31,1; 33P 25
144,7,1,0,33; 35P 26
110,0.,0.138,0.,0.,-39.23207874,0.; 37P 27
110,0.,0.138,-0.1125,0.,0.,-0.1125; 39P 28
120,37,39,0.,6.28318530717959; 41P 29
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,0.,0.,0.,3.141592654,0., 43P 30
0.,1.,0.,0.,1.; 43P 31
124,1.40271576953299E-014,1.,0.,-0.138,-6.12323399573677E-017, 45P 32
8.58915688636046E-031,-1.,0.138,-1.,1.40271576953299E-014, 45P 33
6.12323399573677E-017,-1.93574776195553E-015; 45P 34
100,0.,0.,0.138,0.1125,0.138,-0.1125,0.138; 47P 35
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,3.141592654,0.,1., 49P 36
3.141592654,0.,0.,1.,0.,0.,1.; 49P 37
110,0.,0.138,0.1125,0.,0.,0.1125; 51P 38
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,3.141592654,0.,1.,0.,0., 53P 39
0.,1.,0.,0.,1.; 53P 40
124,1.40271576953299E-014,1.,0.,0.,-6.12323399573677E-017, 55P 41
8.58915688636046E-031,1.,0.,1.,-1.40271576953299E-014, 55P 42
6.12323399573677E-017,0.; 55P 43
100,0.,0.,0.,0.1125,0.,-0.1125,0.; 57P 44
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,0.,0.,0.,0.,0.,0.,1.,0., 59P 45
0.,1.; 59P 46
110,0.,0.,-0.1125,0.,0.138,-0.1125; 61P 47
102,4,43,49,53,59; 63P 48
102,4,47,51,57,61; 65P 49
142,1,41,63,65,1; 67P 50
144,41,1,0,67; 69P 51
128,1,1,1,1,0,0,1,0,0,0.,0.,1.,1.,0.,0.,1.,1.,1.,1.,1.,1., 71P 52
-0.11385,0.138,-0.11385,-0.11385,0.138,0.11385,0.11385,0.138, 71P 53
-0.11385,0.11385,0.138,0.11385,0.,1.,0.,1.; 71P 54
126,32,2,1,0,1,0,0.,0.,0.,0.0625,0.0625,0.125,0.125,0.1875, 73P 55
0.1875,0.25,0.25,0.3125,0.3125,0.375,0.375,0.4375,0.4375,0.5, 73P 56
0.5,0.5625,0.5625,0.625,0.625,0.6875,0.6875,0.75,0.75,0.8125, 73P 57
0.8125,0.875,0.875,0.9375,0.9375,1.,1.,1.,1.,1.,1.,1.,1.,1.,1., 73P 58
1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1., 73P 59
1.,1.,1.,1.,1.,0.005928854,0.5,0.,0.005928854,0.451338239,0., 73P 60
0.015422292,0.403611501,0.,0.024915731,0.355884763,0., 73P 61
0.04353778,0.310927158,0.,0.06215983,0.265969553,0., 73P 62
0.089194856,0.225508778,0.,0.116229881,0.185048003,0., 73P 63
0.150638942,0.150638942,0.,0.185048003,0.116229881,0., 73P 64
0.225508778,0.089194856,0.,0.265969553,0.06215983,0., 73P 65
0.310927158,0.04353778,0.,0.355884763,0.024915731,0., 73P 66
0.403611501,0.015422292,0.,0.451338239,0.005928854,0.,0.5, 73P 67
0.005928854,0.,0.548661761,0.005928854,0.,0.596388499, 73P 68
0.015422292,0.,0.644115237,0.024915731,0.,0.689072842, 73P 69
0.04353778,0.,0.734030447,0.06215983,0.,0.774491222, 73P 70
0.089194856,0.,0.814951997,0.116229881,0.,0.849361058, 73P 71
0.150638942,0.,0.883770119,0.185048003,0.,0.910805144, 73P 72
0.225508778,0.,0.93784017,0.265969553,0.,0.95646222, 73P 73
0.310927158,0.,0.975084269,0.355884763,0.,0.984577708, 73P 74
0.403611501,0.,0.994071146,0.451338239,0.,0.994071146,0.5,0., 73P 75
0.,1.,0.,0.,-1.; 73P 76
124,6.12323399573677E-017,-1.,0.,0.138,6.12323399573677E-017, 75P 77
3.74939945665464E-033,1.,0.138,-1.,-6.12323399573677E-017, 75P 78
6.12323399573677E-017,8.45006291411674E-018; 75P 79
100,0.,0.,0.138,0.1125,0.138,-0.1125,0.138; 77P 80
126,32,2,1,0,1,0,0.,0.,0.,0.0625,0.0625,0.125,0.125,0.1875, 79P 81
0.1875,0.25,0.25,0.3125,0.3125,0.375,0.375,0.4375,0.4375,0.5, 79P 82
0.5,0.5625,0.5625,0.625,0.625,0.6875,0.6875,0.75,0.75,0.8125, 79P 83
0.8125,0.875,0.875,0.9375,0.9375,1.,1.,1.,1.,1.,1.,1.,1.,1.,1., 79P 84
1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1., 79P 85
1.,1.,1.,1.,1.,0.994071146,0.5,0.,0.994071146,0.548661761,0., 79P 86
0.984577708,0.596388499,0.,0.975084269,0.644115237,0., 79P 87
0.95646222,0.689072842,0.,0.93784017,0.734030447,0., 79P 88
0.910805144,0.774491222,0.,0.883770119,0.814951997,0., 79P 89
0.849361058,0.849361058,0.,0.814951997,0.883770119,0., 79P 90
0.774491222,0.910805144,0.,0.734030447,0.93784017,0., 79P 91
0.689072842,0.95646222,0.,0.644115237,0.975084269,0., 79P 92
0.596388499,0.984577708,0.,0.548661761,0.994071146,0.,0.5, 79P 93
0.994071146,0.,0.451338239,0.994071146,0.,0.403611501, 79P 94
0.984577708,0.,0.355884763,0.975084269,0.,0.310927158, 79P 95
0.95646222,0.,0.265969553,0.93784017,0.,0.225508778, 79P 96
0.910805144,0.,0.185048003,0.883770119,0.,0.150638942, 79P 97
0.849361058,0.,0.116229881,0.814951997,0.,0.089194856, 79P 98
0.774491222,0.,0.06215983,0.734030447,0.,0.04353778, 79P 99
0.689072842,0.,0.024915731,0.644115237,0.,0.015422292, 79P 100
0.596388499,0.,0.005928854,0.548661761,0.,0.005928854,0.5,0., 79P 101
0.,1.,0.,0.,-1.; 79P 102
124,1.40271576953299E-014,1.,0.,-0.138,-6.12323399573677E-017, 81P 103
8.58915688636046E-031,1.,0.138,1.,-1.40271576953299E-014, 81P 104
6.12323399573677E-017,1.93574776195553E-015; 81P 105
100,0.,0.,0.138,0.1125,0.138,-0.1125,0.138; 83P 106
102,2,73,79; 85P 107
102,2,77,83; 87P 108
142,1,71,85,87,1; 89P 109
126,32,2,1,0,1,0,0.,0.,0.,0.0625,0.0625,0.125,0.125,0.1875, 91P 110
0.1875,0.25,0.25,0.3125,0.3125,0.375,0.375,0.4375,0.4375,0.5, 91P 111
0.5,0.5625,0.5625,0.625,0.625,0.6875,0.6875,0.75,0.75,0.8125, 91P 112
0.8125,0.875,0.875,0.9375,0.9375,1.,1.,1.,1.,1.,1.,1.,1.,1.,1., 91P 113
1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1., 91P 114
1.,1.,1.,1.,1.,0.796442688,0.5,0.,0.796442688,0.470802944,0., 91P 115
0.790746625,0.442166901,0.,0.785050562,0.413530858,0., 91P 116
0.773877332,0.386556295,0.,0.762704102,0.359581732,0., 91P 117
0.746483087,0.335305267,0.,0.730262071,0.311028802,0., 91P 118
0.709616635,0.290383365,0.,0.688971198,0.269737929,0., 91P 119
0.664694733,0.253516913,0.,0.640418268,0.237295898,0., 91P 120
0.613443705,0.226122668,0.,0.586469142,0.214949438,0., 91P 121
0.557833099,0.209253375,0.,0.529197056,0.203557312,0.,0.5, 91P 122
0.203557312,0.,0.470802944,0.203557312,0.,0.442166901, 91P 123
0.209253375,0.,0.413530858,0.214949438,0.,0.386556295, 91P 124
0.226122668,0.,0.359581732,0.237295898,0.,0.335305267, 91P 125
0.253516913,0.,0.311028802,0.269737929,0.,0.290383365, 91P 126
0.290383365,0.,0.269737929,0.311028802,0.,0.253516913, 91P 127
0.335305267,0.,0.237295898,0.359581732,0.,0.226122668, 91P 128
0.386556295,0.,0.214949438,0.413530858,0.,0.209253375, 91P 129
0.442166901,0.,0.203557312,0.470802944,0.,0.203557312,0.5,0., 91P 130
0.,1.,0.,0.,1.; 91P 131
124,6.12323399573677E-017,-1.,0.,0.138,6.12323399573677E-017, 93P 132
3.74939945665464E-033,-1.,0.138,1.,6.12323399573677E-017, 93P 133
6.12323399573677E-017,-8.45006291411674E-018; 93P 134
100,0.,0.,0.138,0.0675,0.138,-0.0675,0.138; 95P 135
126,32,2,1,0,1,0,0.,0.,0.,0.0625,0.0625,0.125,0.125,0.1875, 97P 136
0.1875,0.25,0.25,0.3125,0.3125,0.375,0.375,0.4375,0.4375,0.5, 97P 137
0.5,0.5625,0.5625,0.625,0.625,0.6875,0.6875,0.75,0.75,0.8125, 97P 138
0.8125,0.875,0.875,0.9375,0.9375,1.,1.,1.,1.,1.,1.,1.,1.,1.,1., 97P 139
1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1., 97P 140
1.,1.,1.,1.,1.,0.203557312,0.5,0.,0.203557312,0.529197056,0., 97P 141
0.209253375,0.557833099,0.,0.214949438,0.586469142,0., 97P 142
0.226122668,0.613443705,0.,0.237295898,0.640418268,0., 97P 143
0.253516913,0.664694733,0.,0.269737929,0.688971198,0., 97P 144
0.290383365,0.709616635,0.,0.311028802,0.730262071,0., 97P 145
0.335305267,0.746483087,0.,0.359581732,0.762704102,0., 97P 146
0.386556295,0.773877332,0.,0.413530858,0.785050562,0., 97P 147
0.442166901,0.790746625,0.,0.470802944,0.796442688,0.,0.5, 97P 148
0.796442688,0.,0.529197056,0.796442688,0.,0.557833099, 97P 149
0.790746625,0.,0.586469142,0.785050562,0.,0.613443705, 97P 150
0.773877332,0.,0.640418268,0.762704102,0.,0.664694733, 97P 151
0.746483087,0.,0.688971198,0.730262071,0.,0.709616635, 97P 152
0.709616635,0.,0.730262071,0.688971198,0.,0.746483087, 97P 153
0.664694733,0.,0.762704102,0.640418268,0.,0.773877332, 97P 154
0.613443705,0.,0.785050562,0.586469142,0.,0.790746625, 97P 155
0.557833099,0.,0.796442688,0.529197056,0.,0.796442688,0.5,0., 97P 156
0.,1.,0.,0.,1.; 97P 157
124,1.40271576953299E-014,1.,0.,-0.138,-6.12323399573677E-017, 99P 158
8.58915688636046E-031,-1.,0.138,-1.,1.40271576953299E-014, 99P 159
6.12323399573677E-017,-1.93574776195553E-015; 99P 160
100,0.,0.,0.138,0.0675,0.138,-0.0675,0.138; 101P 161
102,2,91,97; 103P 162
102,2,95,101; 105P 163
142,1,71,103,105,1; 107P 164
144,71,1,1,89,107; 109P 165
110,0.,0.138,0.,0.,-39.23207874,0.; 111P 166
110,0.,0.138,-0.1125,0.,0.,-0.1125; 113P 167
120,111,113,0.,6.28318530717959; 115P 168
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,3.141592654,0.,0., 117P 169
3.141592654,0.,0.,1.,0.,0.,1.; 117P 170
110,0.,0.,0.1125,0.,0.138,0.1125; 119P 171
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,3.141592654,0.,0., 121P 172
6.283185307,0.,0.,1.,0.,0.,1.; 121P 173
124,6.12323399573677E-017,-1.,0.,0.138,6.12323399573677E-017, 123P 174
3.74939945665464E-033,-1.,0.138,1.,6.12323399573677E-017, 123P 175
6.12323399573677E-017,-8.45006291411674E-018; 123P 176
100,0.,0.,0.138,0.1125,0.138,-0.1125,0.138; 125P 177
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,6.283185307,0.,1., 127P 178
6.283185307,0.,0.,1.,0.,0.,1.; 127P 179
110,0.,0.138,-0.1125,0.,0.,-0.1125; 129P 180
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,6.283185307,0.,1., 131P 181
3.141592654,0.,0.,1.,0.,0.,1.; 131P 182
124,6.12323399573677E-017,-1.,0.,0.,6.12323399573677E-017, 133P 183
3.74939945665464E-033,1.,0.,-1.,-6.12323399573677E-017, 133P 184
6.12323399573677E-017,0.; 133P 185
100,0.,0.,0.,0.1125,0.,-0.1125,0.; 135P 186
102,4,117,121,127,131; 137P 187
102,4,119,125,129,135; 139P 188
142,1,115,137,139,1; 141P 189
144,115,1,0,141; 143P 190
128,1,1,1,1,0,0,1,0,0,0.,0.,1.,1.,0.,0.,1.,1.,1.,1.,1.,1., 145P 191
-0.11385,0.,-0.11385,-0.11385,0.,0.11385,0.11385,0.,-0.11385, 145P 192
0.11385,0.,0.11385,0.,1.,0.,1.; 145P 193
126,32,2,1,0,1,0,0.,0.,0.,0.0625,0.0625,0.125,0.125,0.1875, 147P 194
0.1875,0.25,0.25,0.3125,0.3125,0.375,0.375,0.4375,0.4375,0.5, 147P 195
0.5,0.5625,0.5625,0.625,0.625,0.6875,0.6875,0.75,0.75,0.8125, 147P 196
0.8125,0.875,0.875,0.9375,0.9375,1.,1.,1.,1.,1.,1.,1.,1.,1.,1., 147P 197
1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1., 147P 198
1.,1.,1.,1.,1.,0.994071146,0.5,0.,0.994071146,0.548661761,0., 147P 199
0.984577708,0.596388499,0.,0.975084269,0.644115237,0., 147P 200
0.95646222,0.689072842,0.,0.93784017,0.734030447,0., 147P 201
0.910805144,0.774491222,0.,0.883770119,0.814951997,0., 147P 202
0.849361058,0.849361058,0.,0.814951997,0.883770119,0., 147P 203
0.774491222,0.910805144,0.,0.734030447,0.93784017,0., 147P 204
0.689072842,0.95646222,0.,0.644115237,0.975084269,0., 147P 205
0.596388499,0.984577708,0.,0.548661761,0.994071146,0.,0.5, 147P 206
0.994071146,0.,0.451338239,0.994071146,0.,0.403611501, 147P 207
0.984577708,0.,0.355884763,0.975084269,0.,0.310927158, 147P 208
0.95646222,0.,0.265969553,0.93784017,0.,0.225508778, 147P 209
0.910805144,0.,0.185048003,0.883770119,0.,0.150638942, 147P 210
0.849361058,0.,0.116229881,0.814951997,0.,0.089194856, 147P 211
0.774491222,0.,0.06215983,0.734030447,0.,0.04353778, 147P 212
0.689072842,0.,0.024915731,0.644115237,0.,0.015422292, 147P 213
0.596388499,0.,0.005928854,0.548661761,0.,0.005928854,0.5,0., 147P 214
0.,1.,0.,0.,-1.; 147P 215
124,1.40271576953299E-014,1.,0.,0.,-6.12323399573677E-017, 149P 216
8.58915688636046E-031,1.,0.,1.,-1.40271576953299E-014, 149P 217
6.12323399573677E-017,0.; 149P 218
100,0.,0.,0.,0.1125,0.,-0.1125,0.; 151P 219
126,32,2,1,0,1,0,0.,0.,0.,0.0625,0.0625,0.125,0.125,0.1875, 153P 220
0.1875,0.25,0.25,0.3125,0.3125,0.375,0.375,0.4375,0.4375,0.5, 153P 221
0.5,0.5625,0.5625,0.625,0.625,0.6875,0.6875,0.75,0.75,0.8125, 153P 222
0.8125,0.875,0.875,0.9375,0.9375,1.,1.,1.,1.,1.,1.,1.,1.,1.,1., 153P 223
1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1., 153P 224
1.,1.,1.,1.,1.,0.005928854,0.5,0.,0.005928854,0.451338239,0., 153P 225
0.015422292,0.403611501,0.,0.024915731,0.355884763,0., 153P 226
0.04353778,0.310927158,0.,0.06215983,0.265969553,0., 153P 227
0.089194856,0.225508778,0.,0.116229881,0.185048003,0., 153P 228
0.150638942,0.150638942,0.,0.185048003,0.116229881,0., 153P 229
0.225508778,0.089194856,0.,0.265969553,0.06215983,0., 153P 230
0.310927158,0.04353778,0.,0.355884763,0.024915731,0., 153P 231
0.403611501,0.015422292,0.,0.451338239,0.005928854,0.,0.5, 153P 232
0.005928854,0.,0.548661761,0.005928854,0.,0.596388499, 153P 233
0.015422292,0.,0.644115237,0.024915731,0.,0.689072842, 153P 234
0.04353778,0.,0.734030447,0.06215983,0.,0.774491222, 153P 235
0.089194856,0.,0.814951997,0.116229881,0.,0.849361058, 153P 236
0.150638942,0.,0.883770119,0.185048003,0.,0.910805144, 153P 237
0.225508778,0.,0.93784017,0.265969553,0.,0.95646222, 153P 238
0.310927158,0.,0.975084269,0.355884763,0.,0.984577708, 153P 239
0.403611501,0.,0.994071146,0.451338239,0.,0.994071146,0.5,0., 153P 240
0.,1.,0.,0.,-1.; 153P 241
124,6.12323399573677E-017,-1.,0.,0.,6.12323399573677E-017, 155P 242
3.74939945665464E-033,1.,0.,-1.,-6.12323399573677E-017, 155P 243
6.12323399573677E-017,0.; 155P 244
100,0.,0.,0.,0.1125,0.,-0.1125,0.; 157P 245
102,2,147,153; 159P 246
102,2,151,157; 161P 247
142,1,145,159,161,1; 163P 248
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.740173474,0.63866422,0., 165P 249
0.740173474,0.36133578,0.,0.,1.,0.,0.,1.; 165P 250
110,0.031573843,0.,0.0546875,-0.031573843,0.,0.0546875; 167P 251
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.740173474,0.36133578,0., 169P 252
0.5,0.22267156,0.,0.,1.,0.,0.,1.; 169P 253
110,-0.031573843,0.,0.0546875,-0.063147686,0.,0.; 171P 254
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.5,0.22267156,0., 173P 255
0.259826526,0.36133578,0.,0.,1.,0.,0.,1.; 173P 256
110,-0.063147686,0.,0.,-0.031573843,0.,-0.0546875; 175P 257
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.259826526,0.36133578,0., 177P 258
0.259826526,0.63866422,0.,0.,1.,0.,0.,1.; 177P 259
110,-0.031573843,0.,-0.0546875,0.031573843,0.,-0.0546875; 179P 260
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.259826526,0.63866422,0., 181P 261
0.5,0.77732844,0.,0.,1.,0.,0.,1.; 181P 262
110,0.031573843,0.,-0.0546875,0.063147686,0.,0.; 183P 263
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.5,0.77732844,0., 185P 264
0.740173474,0.63866422,0.,0.,1.,0.,0.,1.; 185P 265
110,0.063147686,0.,0.,0.031573843,0.,0.0546875; 187P 266
102,6,165,169,173,177,181,185; 189P 267
102,6,167,171,175,179,183,187; 191P 268
142,1,145,189,191,1; 193P 269
144,145,1,1,163,193; 195P 270
128,1,1,1,1,0,0,1,0,0,0.,0.,1.,1.,0.,0.,1.,1.,1.,1.,1.,1., 197P 271
0.063147686,0.,0.,0.031573843,0.,-0.0546875,0.063147686,0.077, 197P 272
0.,0.031573843,0.077,-0.0546875,0.,1.,0.,1.; 197P 273
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,0.,0.,1.,1.,0.,0.,1.,0., 199P 274
0.,1.; 199P 275
110,0.031573843,0.,-0.0546875,0.031573843,0.077,-0.0546875; 201P 276
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,1.,0.,0.,1.,0.,0.,1.,0., 203P 277
0.,1.; 203P 278
110,0.031573843,0.077,-0.0546875,0.063147686,0.077,0.; 205P 279
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,1.,0.,0.,0.,0.,0.,1.,0., 207P 280
0.,1.; 207P 281
110,0.063147686,0.077,0.,0.063147686,0.,0.; 209P 282
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,0.,0.,1.,0.,0.,0.,1.,0., 211P 283
0.,1.; 211P 284
110,0.063147686,0.,0.,0.031573843,0.,-0.0546875; 213P 285
102,4,199,203,207,211; 215P 286
102,4,201,205,209,213; 217P 287
142,1,197,215,217,1; 219P 288
144,197,1,0,219; 221P 289
128,1,1,1,1,0,0,1,0,0,0.,0.,1.,1.,0.,0.,1.,1.,1.,1.,1.,1., 223P 290
0.031573843,0.,-0.0546875,-0.031573843,0.,-0.0546875, 223P 291
0.031573843,0.077,-0.0546875,-0.031573843,0.077,-0.0546875,0., 223P 292
1.,0.,1.; 223P 293
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,0.,0.,1.,1.,0.,0.,1.,0., 225P 294
0.,1.; 225P 295
110,-0.031573843,0.,-0.0546875,-0.031573843,0.077,-0.0546875; 227P 296
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,1.,0.,0.,1.,0.,0.,1.,0., 229P 297
0.,1.; 229P 298
110,-0.031573843,0.077,-0.0546875,0.031573843,0.077,-0.0546875; 231P 299
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,1.,0.,0.,0.,0.,0.,1.,0., 233P 300
0.,1.; 233P 301
110,0.031573843,0.077,-0.0546875,0.031573843,0.,-0.0546875; 235P 302
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,0.,0.,1.,0.,0.,0.,1.,0., 237P 303
0.,1.; 237P 304
110,0.031573843,0.,-0.0546875,-0.031573843,0.,-0.0546875; 239P 305
102,4,225,229,233,237; 241P 306
102,4,227,231,235,239; 243P 307
142,1,223,241,243,1; 245P 308
144,223,1,0,245; 247P 309
128,1,1,1,1,0,0,1,0,0,0.,0.,1.,1.,0.,0.,1.,1.,1.,1.,1.,1., 249P 310
-0.031573843,0.,-0.0546875,-0.063147686,0.,0.,-0.031573843, 249P 311
0.077,-0.0546875,-0.063147686,0.077,0.,0.,1.,0.,1.; 249P 312
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,0.,0.,1.,1.,0.,0.,1.,0., 251P 313
0.,1.; 251P 314
110,-0.063147686,0.,0.,-0.063147686,0.077,0.; 253P 315
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,1.,0.,0.,1.,0.,0.,1.,0., 255P 316
0.,1.; 255P 317
110,-0.063147686,0.077,0.,-0.031573843,0.077,-0.0546875; 257P 318
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,1.,0.,0.,0.,0.,0.,1.,0., 259P 319
0.,1.; 259P 320
110,-0.031573843,0.077,-0.0546875,-0.031573843,0.,-0.0546875; 261P 321
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,0.,0.,1.,0.,0.,0.,1.,0., 263P 322
0.,1.; 263P 323
110,-0.031573843,0.,-0.0546875,-0.063147686,0.,0.; 265P 324
102,4,251,255,259,263; 267P 325
102,4,253,257,261,265; 269P 326
142,1,249,267,269,1; 271P 327
144,249,1,0,271; 273P 328
128,1,1,1,1,0,0,1,0,0,0.,0.,1.,1.,0.,0.,1.,1.,1.,1.,1.,1., 275P 329
-0.063147686,0.,0.,-0.031573843,0.,0.0546875,-0.063147686, 275P 330
0.077,0.,-0.031573843,0.077,0.0546875,0.,1.,0.,1.; 275P 331
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,0.,0.,1.,1.,0.,0.,1.,0., 277P 332
0.,1.; 277P 333
110,-0.031573843,0.,0.0546875,-0.031573843,0.077,0.0546875; 279P 334
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,1.,0.,0.,1.,0.,0.,1.,0., 281P 335
0.,1.; 281P 336
110,-0.031573843,0.077,0.0546875,-0.063147686,0.077,0.; 283P 337
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,1.,0.,0.,0.,0.,0.,1.,0., 285P 338
0.,1.; 285P 339
110,-0.063147686,0.077,0.,-0.063147686,0.,0.; 287P 340
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,0.,0.,1.,0.,0.,0.,1.,0., 289P 341
0.,1.; 289P 342
110,-0.063147686,0.,0.,-0.031573843,0.,0.0546875; 291P 343
102,4,277,281,285,289; 293P 344
102,4,279,283,287,291; 295P 345
142,1,275,293,295,1; 297P 346
144,275,1,0,297; 299P 347
128,1,1,1,1,0,0,1,0,0,0.,0.,1.,1.,0.,0.,1.,1.,1.,1.,1.,1., 301P 348
-0.031573843,0.,0.0546875,0.031573843,0.,0.0546875, 301P 349
-0.031573843,0.077,0.0546875,0.031573843,0.077,0.0546875,0.,1., 301P 350
0.,1.; 301P 351
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,0.,0.,1.,1.,0.,0.,1.,0., 303P 352
0.,1.; 303P 353
110,0.031573843,0.,0.0546875,0.031573843,0.077,0.0546875; 305P 354
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,1.,0.,0.,1.,0.,0.,1.,0., 307P 355
0.,1.; 307P 356
110,0.031573843,0.077,0.0546875,-0.031573843,0.077,0.0546875; 309P 357
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,1.,0.,0.,0.,0.,0.,1.,0., 311P 358
0.,1.; 311P 359
110,-0.031573843,0.077,0.0546875,-0.031573843,0.,0.0546875; 313P 360
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,0.,0.,1.,0.,0.,0.,1.,0., 315P 361
0.,1.; 315P 362
110,-0.031573843,0.,0.0546875,0.031573843,0.,0.0546875; 317P 363
102,4,303,307,311,315; 319P 364
102,4,305,309,313,317; 321P 365
142,1,301,319,321,1; 323P 366
144,301,1,0,323; 325P 367
128,1,1,1,1,0,0,1,0,0,0.,0.,1.,1.,0.,0.,1.,1.,1.,1.,1.,1., 327P 368
0.031573843,0.,0.0546875,0.063147686,0.,0.,0.031573843,0.077, 327P 369
0.0546875,0.063147686,0.077,0.,0.,1.,0.,1.; 327P 370
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,0.,0.,1.,1.,0.,0.,1.,0., 329P 371
0.,1.; 329P 372
110,0.063147686,0.,0.,0.063147686,0.077,0.; 331P 373
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,1.,0.,0.,1.,0.,0.,1.,0., 333P 374
0.,1.; 333P 375
110,0.063147686,0.077,0.,0.031573843,0.077,0.0546875; 335P 376
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,1.,0.,0.,0.,0.,0.,1.,0., 337P 377
0.,1.; 337P 378
110,0.031573843,0.077,0.0546875,0.031573843,0.,0.0546875; 339P 379
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,0.,0.,1.,0.,0.,0.,1.,0., 341P 380
0.,1.; 341P 381
110,0.031573843,0.,0.0546875,0.063147686,0.,0.; 343P 382
102,4,329,333,337,341; 345P 383
102,4,331,335,339,343; 347P 384
142,1,327,345,347,1; 349P 385
144,327,1,0,349; 351P 386
128,1,1,1,1,0,0,1,0,0,0.,0.,1.,1.,0.,0.,1.,1.,1.,1.,1.,1., 353P 387
-0.063147686,0.077,0.0546875,-0.063147686,0.077,-0.0546875, 353P 388
0.063147686,0.077,0.0546875,0.063147686,0.077,-0.0546875,0.,1., 353P 389
0.,1.; 353P 390
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,0.75,0.,0.5,1.,0.,0.,1., 355P 391
0.,0.,1.; 355P 392
110,0.031573843,0.077,-0.0546875,0.063147686,0.077,0.; 357P 393
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.5,1.,0.,0.,0.75,0.,0.,1., 359P 394
0.,0.,1.; 359P 395
110,0.063147686,0.077,0.,0.031573843,0.077,0.0546875; 361P 396
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,0.75,0.,0.,0.25,0.,0.,1., 363P 397
0.,0.,1.; 363P 398
110,0.031573843,0.077,0.0546875,-0.031573843,0.077,0.0546875; 365P 399
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,0.25,0.,0.5,0.,0.,0.,1., 367P 400
0.,0.,1.; 367P 401
110,-0.031573843,0.077,0.0546875,-0.063147686,0.077,0.; 369P 402
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.5,0.,0.,1.,0.25,0.,0.,1., 371P 403
0.,0.,1.; 371P 404
110,-0.063147686,0.077,0.,-0.031573843,0.077,-0.0546875; 373P 405
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,0.25,0.,1.,0.75,0.,0.,1., 375P 406
0.,0.,1.; 375P 407
110,-0.031573843,0.077,-0.0546875,0.031573843,0.077,-0.0546875; 377P 408
102,6,355,359,363,367,371,375; 379P 409
102,6,357,361,365,369,373,377; 381P 410
142,1,353,379,381,1; 383P 411
144,353,1,0,383; 385P 412
110,0.,1.263,0.,0.,-38.10707874,0.; 387P 413
110,0.,1.263,-0.0675,0.,0.138,-0.0675; 389P 414
120,387,389,0.,6.28318530717959; 391P 415
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,3.141592654,0.,0., 393P 416
3.141592654,0.,0.,1.,0.,0.,1.; 393P 417
110,0.,0.138,0.0675,0.,1.263,0.0675; 395P 418
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,3.141592654,0.,0., 397P 419
6.283185307,0.,0.,1.,0.,0.,1.; 397P 420
124,6.12323399573677E-017,-1.,0.,1.263,6.12323399573677E-017, 399P 421
3.74939945665464E-033,-1.,1.263,1.,6.12323399573677E-017, 399P 422
6.12323399573677E-017,-7.73364453661554E-017; 399P 423
100,0.,0.,1.263,0.0675,1.263,-0.0675,1.263; 401P 424
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,0.,6.283185307,0.,1., 403P 425
6.283185307,0.,0.,1.,0.,0.,1.; 403P 426
110,0.,1.263,-0.0675,0.,0.138,-0.0675; 405P 427
126,1,1,1,0,1,0,0.,0.,1.,1.,1.,1.,1.,6.283185307,0.,1., 407P 428
3.141592654,0.,0.,1.,0.,0.,1.; 407P 429
124,6.12323399573677E-017,-1.,0.,0.138,6.12323399573677E-017, 409P 430
3.74939945665464E-033,1.,0.138,-1.,-6.12323399573677E-017, 409P 431
6.12323399573677E-017,8.45006291411674E-018; 409P 432
100,0.,0.,0.138,0.0675,0.138,-0.0675,0.138; 411P 433
102,4,393,397,403,407; 413P 434
102,4,395,401,405,411; 415P 435
142,1,391,413,415,1; 417P 436
144,391,1,0,417; 419P 437
128,1,1,1,1,0,0,1,0,0,0.,0.,1.,1.,0.,0.,1.,1.,1.,1.,1.,1., 421P 438
-0.06831,1.263,-0.06831,-0.06831,1.263,0.06831,0.06831,1.263, 421P 439
-0.06831,0.06831,1.263,0.06831,0.,1.,0.,1.; 421P 440
126,32,2,1,0,1,0,0.,0.,0.,0.0625,0.0625,0.125,0.125,0.1875, 423P 441
0.1875,0.25,0.25,0.3125,0.3125,0.375,0.375,0.4375,0.4375,0.5, 423P 442
0.5,0.5625,0.5625,0.625,0.625,0.6875,0.6875,0.75,0.75,0.8125, 423P 443
0.8125,0.875,0.875,0.9375,0.9375,1.,1.,1.,1.,1.,1.,1.,1.,1.,1., 423P 444
1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1., 423P 445
1.,1.,1.,1.,1.,0.005928854,0.5,0.,0.005928854,0.451338239,0., 423P 446
0.015422292,0.403611501,0.,0.024915731,0.355884763,0., 423P 447
0.04353778,0.310927158,0.,0.06215983,0.265969553,0., 423P 448
0.089194856,0.225508778,0.,0.116229881,0.185048003,0., 423P 449
0.150638942,0.150638942,0.,0.185048003,0.116229881,0., 423P 450
0.225508778,0.089194856,0.,0.265969553,0.06215983,0., 423P 451
0.310927158,0.04353778,0.,0.355884763,0.024915731,0., 423P 452
0.403611501,0.015422292,0.,0.451338239,0.005928854,0.,0.5, 423P 453
0.005928854,0.,0.548661761,0.005928854,0.,0.596388499, 423P 454
0.015422292,0.,0.644115237,0.024915731,0.,0.689072842, 423P 455
0.04353778,0.,0.734030447,0.06215983,0.,0.774491222, 423P 456
0.089194856,0.,0.814951997,0.116229881,0.,0.849361058, 423P 457
0.150638942,0.,0.883770119,0.185048003,0.,0.910805144, 423P 458
0.225508778,0.,0.93784017,0.265969553,0.,0.95646222, 423P 459
0.310927158,0.,0.975084269,0.355884763,0.,0.984577708, 423P 460
0.403611501,0.,0.994071146,0.451338239,0.,0.994071146,0.5,0., 423P 461
0.,1.,0.,0.,-1.; 423P 462
124,6.12323399573677E-017,-1.,0.,1.263,6.12323399573677E-017, 425P 463
3.74939945665464E-033,1.,1.263,-1.,-6.12323399573677E-017, 425P 464
6.12323399573677E-017,7.73364453661554E-017; 425P 465
100,0.,0.,1.263,0.0675,1.263,-0.0675,1.263; 427P 466
126,32,2,1,0,1,0,0.,0.,0.,0.0625,0.0625,0.125,0.125,0.1875, 429P 467
0.1875,0.25,0.25,0.3125,0.3125,0.375,0.375,0.4375,0.4375,0.5, 429P 468
0.5,0.5625,0.5625,0.625,0.625,0.6875,0.6875,0.75,0.75,0.8125, 429P 469
0.8125,0.875,0.875,0.9375,0.9375,1.,1.,1.,1.,1.,1.,1.,1.,1.,1., 429P 470
1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1.,1., 429P 471
1.,1.,1.,1.,1.,0.994071146,0.5,0.,0.994071146,0.548661761,0., 429P 472
0.984577708,0.596388499,0.,0.975084269,0.644115237,0., 429P 473
0.95646222,0.689072842,0.,0.93784017,0.734030447,0., 429P 474
0.910805144,0.774491222,0.,0.883770119,0.814951997,0., 429P 475
0.849361058,0.849361058,0.,0.814951997,0.883770119,0., 429P 476
0.774491222,0.910805144,0.,0.734030447,0.93784017,0., 429P 477
0.689072842,0.95646222,0.,0.644115237,0.975084269,0., 429P 478
0.596388499,0.984577708,0.,0.548661761,0.994071146,0.,0.5, 429P 479
0.994071146,0.,0.451338239,0.994071146,0.,0.403611501, 429P 480
0.984577708,0.,0.355884763,0.975084269,0.,0.310927158, 429P 481
0.95646222,0.,0.265969553,0.93784017,0.,0.225508778, 429P 482
0.910805144,0.,0.185048003,0.883770119,0.,0.150638942, 429P 483
0.849361058,0.,0.116229881,0.814951997,0.,0.089194856, 429P 484
0.774491222,0.,0.06215983,0.734030447,0.,0.04353778, 429P 485
0.689072842,0.,0.024915731,0.644115237,0.,0.015422292, 429P 486
0.596388499,0.,0.005928854,0.548661761,0.,0.005928854,0.5,0., 429P 487
0.,1.,0.,0.,-1.; 429P 488
124,1.40271576953299E-014,1.,0.,-1.263,-6.12323399573677E-017, 431P 489
8.58915688636046E-031,1.,1.263,1.,-1.40271576953299E-014, 431P 490
6.12323399573677E-017,1.77163001692017E-014; 431P 491
100,0.,0.,1.263,0.0675,1.263,-0.0675,1.263; 433P 492
102,2,423,429; 435P 493
102,2,427,433; 437P 494
142,1,421,435,437,1; 439P 495
144,421,1,0,439; 441P 496
S 1G 4D 442P 496 T 1
| {
"pile_set_name": "Github"
} |
<!DOCTYPE html>
<!--
| Generated by Apache Maven Doxia Site Renderer 1.8 from src/site/markdown/metron-platform/metron-enrichment/metron-enrichment-storm/Performance.md at 2019-05-14
| Rendered using Apache Maven Fluido Skin 1.7
-->
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
<head>
<meta charset="UTF-8" />
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
<meta name="Date-Revision-yyyymmdd" content="20190514" />
<meta http-equiv="Content-Language" content="en" />
<title>Metron – Enrichment Performance</title>
<link rel="stylesheet" href="../../../css/apache-maven-fluido-1.7.min.css" />
<link rel="stylesheet" href="../../../css/site.css" />
<link rel="stylesheet" href="../../../css/print.css" media="print" />
<script type="text/javascript" src="../../../js/apache-maven-fluido-1.7.min.js"></script>
<script type="text/javascript">
$( document ).ready( function() { $( '.carousel' ).carousel( { interval: 3500 } ) } );
</script>
</head>
<body class="topBarDisabled">
<div class="container-fluid">
<div id="banner">
<div class="pull-left"><a href="http://metron.apache.org/" id="bannerLeft"><img src="../../../images/metron-logo.png" alt="Apache Metron" width="148px" height="48px"/></a></div>
<div class="pull-right"></div>
<div class="clear"><hr/></div>
</div>
<div id="breadcrumbs">
<ul class="breadcrumb">
<li class=""><a href="http://www.apache.org" class="externalLink" title="Apache">Apache</a><span class="divider">/</span></li>
<li class=""><a href="http://metron.apache.org/" class="externalLink" title="Metron">Metron</a><span class="divider">/</span></li>
<li class=""><a href="../../../index.html" title="Documentation">Documentation</a><span class="divider">/</span></li>
<li class="active ">Enrichment Performance</li>
<li id="publishDate" class="pull-right"><span class="divider">|</span> Last Published: 2019-05-14</li>
<li id="projectVersion" class="pull-right">Version: 0.7.1</li>
</ul>
</div>
<div class="row-fluid">
<div id="leftColumn" class="span2">
<div class="well sidebar-nav">
<ul class="nav nav-list">
<li class="nav-header">User Documentation</li>
<li><a href="../../../index.html" title="Metron"><span class="icon-chevron-down"></span>Metron</a>
<ul class="nav nav-list">
<li><a href="../../../CONTRIBUTING.html" title="CONTRIBUTING"><span class="none"></span>CONTRIBUTING</a></li>
<li><a href="../../../Upgrading.html" title="Upgrading"><span class="none"></span>Upgrading</a></li>
<li><a href="../../../metron-analytics/index.html" title="Analytics"><span class="icon-chevron-right"></span>Analytics</a></li>
<li><a href="../../../metron-contrib/metron-docker/index.html" title="Docker"><span class="none"></span>Docker</a></li>
<li><a href="../../../metron-contrib/metron-performance/index.html" title="Performance"><span class="none"></span>Performance</a></li>
<li><a href="../../../metron-deployment/index.html" title="Deployment"><span class="icon-chevron-right"></span>Deployment</a></li>
<li><a href="../../../metron-interface/index.html" title="Interface"><span class="icon-chevron-right"></span>Interface</a></li>
<li><a href="../../../metron-platform/index.html" title="Platform"><span class="icon-chevron-down"></span>Platform</a>
<ul class="nav nav-list">
<li><a href="../../../metron-platform/Performance-tuning-guide.html" title="Performance-tuning-guide"><span class="none"></span>Performance-tuning-guide</a></li>
<li><a href="../../../metron-platform/metron-common/index.html" title="Common"><span class="none"></span>Common</a></li>
<li><a href="../../../metron-platform/metron-data-management/index.html" title="Data-management"><span class="none"></span>Data-management</a></li>
<li><a href="../../../metron-platform/metron-elasticsearch/index.html" title="Elasticsearch"><span class="none"></span>Elasticsearch</a></li>
<li><a href="../../../metron-platform/metron-enrichment/index.html" title="Enrichment"><span class="icon-chevron-down"></span>Enrichment</a>
<ul class="nav nav-list">
<li><a href="../../../metron-platform/metron-enrichment/metron-enrichment-common/index.html" title="Enrichment-common"><span class="none"></span>Enrichment-common</a></li>
<li><a href="../../../metron-platform/metron-enrichment/metron-enrichment-storm/index.html" title="Enrichment-storm"><span class="icon-chevron-down"></span>Enrichment-storm</a>
<ul class="nav nav-list">
<li class="active"><a href="#"><span class="none"></span>Performance</a></li>
</ul>
</li>
</ul>
</li>
<li><a href="../../../metron-platform/metron-hbase-server/index.html" title="Hbase-server"><span class="none"></span>Hbase-server</a></li>
<li><a href="../../../metron-platform/metron-indexing/index.html" title="Indexing"><span class="none"></span>Indexing</a></li>
<li><a href="../../../metron-platform/metron-job/index.html" title="Job"><span class="none"></span>Job</a></li>
<li><a href="../../../metron-platform/metron-management/index.html" title="Management"><span class="none"></span>Management</a></li>
<li><a href="../../../metron-platform/metron-parsing/index.html" title="Parsing"><span class="icon-chevron-right"></span>Parsing</a></li>
<li><a href="../../../metron-platform/metron-pcap-backend/index.html" title="Pcap-backend"><span class="none"></span>Pcap-backend</a></li>
<li><a href="../../../metron-platform/metron-solr/index.html" title="Solr"><span class="none"></span>Solr</a></li>
<li><a href="../../../metron-platform/metron-writer/index.html" title="Writer"><span class="none"></span>Writer</a></li>
</ul>
</li>
<li><a href="../../../metron-sensors/index.html" title="Sensors"><span class="icon-chevron-right"></span>Sensors</a></li>
<li><a href="../../../metron-stellar/stellar-3rd-party-example/index.html" title="Stellar-3rd-party-example"><span class="none"></span>Stellar-3rd-party-example</a></li>
<li><a href="../../../metron-stellar/stellar-common/index.html" title="Stellar-common"><span class="icon-chevron-right"></span>Stellar-common</a></li>
<li><a href="../../../metron-stellar/stellar-zeppelin/index.html" title="Stellar-zeppelin"><span class="none"></span>Stellar-zeppelin</a></li>
<li><a href="../../../use-cases/index.html" title="Use-cases"><span class="icon-chevron-right"></span>Use-cases</a></li>
</ul>
</li>
</ul>
<hr />
<div id="poweredBy">
<div class="clear"></div>
<div class="clear"></div>
<div class="clear"></div>
<div class="clear"></div>
<a href="http://maven.apache.org/" title="Built by Maven" class="poweredBy"><img class="builtBy" alt="Built by Maven" src="../../../images/logos/maven-feather.png" /></a>
</div>
</div>
</div>
<div id="bodyColumn" class="span10" >
<!--
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.
-->
<h1>Enrichment Performance</h1>
<p><a name="Enrichment_Performance"></a></p>
<p>This guide defines a set of benchmarks used to measure the performance of the Enrichment topology. The guide also provides detailed steps on how to execute those benchmarks along with advice for tuning the Unified Enrichment topology.</p>
<ul>
<li><a href="#Benchmarks">Benchmarks</a></li>
<li><a href="#Benchmark_Execution">Benchmark Execution</a></li>
<li><a href="#Performance_Tuning">Performance Tuning</a></li>
<li><a href="#Benchmark_Results">Benchmark Results</a></li>
</ul>
<div class="section">
<h2><a name="Benchmarks"></a>Benchmarks</h2>
<p>The following section describes a set of enrichments that will be used to benchmark the performance of the Enrichment topology.</p>
<ul>
<li><a href="#Geo_IP_Enrichment">Geo IP Enrichment</a></li>
<li><a href="#HBase_Enrichment">HBase Enrichment</a></li>
<li><a href="#Stellar_Enrichment">Stellar Enrichment</a></li>
</ul>
<div class="section">
<h3><a name="Geo_IP_Enrichment"></a>Geo IP Enrichment</h3>
<p>This benchmark measures the performance of executing a Geo IP enrichment. Given a valid IP address the enrichment will append detailed location information for that IP. The location information is sourced from an external Geo IP data source like <a class="externalLink" href="https://github.com/maxmind/GeoIP2-java">Maxmind</a>.</p>
<div class="section">
<h4><a name="Configuration"></a>Configuration</h4>
<p>Adding the following Stellar expression to the Enrichment topology configuration will define a Geo IP enrichment.</p>
<div>
<div>
<pre class="source">geo := GEO_GET(ip_dst_addr)
</pre></div></div>
<p>After the enrichment process completes, the telemetry message will contain a set of fields with location information for the given IP address.</p>
<div>
<div>
<pre class="source">{
"ip_dst_addr":"151.101.129.140",
...
"geo.city":"San Francisco",
"geo.country":"US",
"geo.dmaCode":"807",
"geo.latitude":"37.7697",
"geo.location_point":"37.7697,-122.3933",
"geo.locID":"5391959",
"geo.longitude":"-122.3933",
"geo.postalCode":"94107",
}
</pre></div></div>
</div></div>
<div class="section">
<h3><a name="HBase_Enrichment"></a>HBase Enrichment</h3>
<p>This benchmark measures the performance of executing an enrichment that retrieves data from an external HBase table. This type of enrichment is useful for enriching telemetry from an Asset Database or other source of relatively static data.</p>
<div class="section">
<h4><a name="Configuration"></a>Configuration</h4>
<p>Adding the following Stellar expression to the Enrichment topology configuration will define an Hbase enrichment. This looks up the ‘ip_dst_addr’ within an HBase table ‘top-1m’ and returns a hostname.</p>
<div>
<div>
<pre class="source">top1m := ENRICHMENT_GET('top-1m', ip_dst_addr, 'top-1m', 't')
</pre></div></div>
<p>After the telemetry has been enriched, it will contain the host and IP elements that were retrieved from the HBase table.</p>
<div>
<div>
<pre class="source">{
"ip_dst_addr":"151.101.2.166",
...
"top1m.host":"earther.com",
"top1m.ip":"151.101.2.166"
}
</pre></div></div>
</div></div>
<div class="section">
<h3><a name="Stellar_Enrichment"></a>Stellar Enrichment</h3>
<p>This benchmark measures the performance of executing a basic Stellar expression. In this benchmark, the enrichment is purely a computational task that has no dependence on an external system like a database.</p>
<div class="section">
<h4><a name="Configuration"></a>Configuration</h4>
<p>Adding the following Stellar expression to the Enrichment topology configuration will define a basic Stellar enrichment. The following returns true if the IP is in the given subnet and false otherwise.</p>
<div>
<div>
<pre class="source">local := IN_SUBNET(ip_dst_addr, '192.168.0.0/24')
</pre></div></div>
<p>After the telemetry has been enriched, it will contain a field with a boolean value indicating whether the IP was within the given subnet.</p>
<div>
<div>
<pre class="source">{
"ip_dst_addr":"151.101.2.166",
...
"local":false
}
</pre></div></div>
</div></div></div>
<div class="section">
<h2><a name="Benchmark_Execution"></a>Benchmark Execution</h2>
<p>This section describes the steps necessary to execute the performance benchmarks for the Enrichment topology.</p>
<ul>
<li><a href="#Prepare_Enrichment_Data">Prepare Enrichment Data</a></li>
<li><a href="#Load_HBase_with_Enrichment_Data">Load HBase with Enrichment Data</a></li>
<li><a href="#Configure_the_Enrichments">Configure the Enrichments</a></li>
<li><a href="#Create_Input_Telemetry">Create Input Telemetry</a></li>
<li><a href="#Cluster_Setup">Cluster Setup</a></li>
<li><a href="#Monitoring">Monitoring</a></li>
</ul>
<div class="section">
<h3><a name="Prepare_Enrichment_Data"></a>Prepare Enrichment Data</h3>
<p>The Alexa Top 1 Million was used as a data source for these benchmarks.</p>
<ol style="list-style-type: decimal">
<li>
<p>Download the <a class="externalLink" href="http://s3.amazonaws.com/alexa-static/top-1m.csv.zip">Alexa Top 1 Million</a> or another similar data set with a variety of valid hostnames.</p>
</li>
<li>
<p>For each hostname, query DNS to retrieve an associated IP address.</p>
<p>A script like the following can be used for this. There is no need to do this for all 1 million entries in the data set. Doing this for around 10,000 records is sufficient.</p>
<div>
<div>
<pre class="source">import dns.resolver
import csv
#
resolver = dns.resolver.Resolver()
resolver.nameservers = ['8.8.8.8', '8.8.4.4']
#
with open('top-1m.csv', 'r') as infile:
with open('top-1m-with-ip.csv', 'w') as outfile:
#
reader = csv.reader(infile, delimiter=',')
writer = csv.writer(outfile, delimiter=',')
for row in reader:
#
host = row[1]
try:
response = resolver.query(host, "A")
for record in response:
ip = record
writer.writerow([host, ip])
print "host={}, ip={}".format(host, ip)
#
except:
pass
</pre></div></div>
</li>
<li>
<p>The resulting data set contains an IP to hostname mapping.</p>
<div>
<div>
<pre class="source">$ head top-1m-with-ip.csv
google.com,172.217.9.46
youtube.com,172.217.4.78
facebook.com,157.240.18.35
baidu.com,220.181.57.216
baidu.com,111.13.101.208
baidu.com,123.125.114.144
wikipedia.org,208.80.154.224
yahoo.com,98.139.180.180
yahoo.com,206.190.39.42
reddit.com,151.101.1.140
</pre></div></div>
</li>
</ol></div>
<div class="section">
<h3><a name="Load_HBase_with_Enrichment_Data"></a>Load HBase with Enrichment Data</h3>
<ol style="list-style-type: decimal">
<li>
<p>Create an HBase table for this data.</p>
<p>Ensure that the table is evenly distributed across the HBase nodes. This can be done by pre-splitting the table or splitting the data after loading it.</p>
<div>
<div>
<pre class="source">create 'top-1m', 't', {SPLITS => ['2','4','6','8','a','c','e']}
</pre></div></div>
</li>
<li>
<p>Create a configuration file called <tt>extractor.json</tt>. This defines how the data will be loaded into the HBase table.</p>
<div>
<div>
<pre class="source">> cat extractor.json
{
"config": {
"columns": {
"host" : 0,
"ip": 1
},
"indicator_column": "ip",
"type": "top-1m",
"separator": ","
},
"extractor": "CSV"
}
</pre></div></div>
</li>
<li>
<p>Use the <tt>flatfile_loader.sh</tt> to load the data into the HBase table.</p>
<div>
<div>
<pre class="source">$METRON_HOME/bin/flatfile_loader.sh \
-e extractor.json \
-t top-1m \
-c t \
-i top-1m-with-ip.csv
</pre></div></div>
</li>
</ol></div>
<div class="section">
<h3><a name="Configure_the_Enrichments"></a>Configure the Enrichments</h3>
<ol style="list-style-type: decimal">
<li>Define the Enrichments using the REPL.
<div>
<div>
<pre class="source">> $METRON_HOME/bin/stellar -z $ZOOKEEPER
Stellar, Go!
[Stellar]>>> conf
{
"enrichment": {
"fieldMap": {
"stellar" : {
"config" : {
"geo" : "GEO_GET(ip_dst_addr)",
"top1m" : "ENRICHMENT_GET('top-1m', ip_dst_addr, 'top-1m', 't')",
"local" : "IN_SUBNET(ip_dst_addr, '192.168.0.0/24')"
}
}
},
"fieldToTypeMap": {
}
},
"threatIntel": {
}
}
[Stellar]>>> CONFIG_PUT("ENRICHMENT", conf, "asa")
</pre></div></div>
</li>
</ol></div>
<div class="section">
<h3><a name="Create_Input_Telemetry"></a>Create Input Telemetry</h3>
<ol style="list-style-type: decimal">
<li>
<p>Create a template file that defines what your input telemetry will look-like.</p>
<div>
<div>
<pre class="source">> cat asa.template
{"ciscotag": "ASA-1-123123", "source.type": "asa", "ip_dst_addr": "$DST_ADDR", "original_string": "<134>Feb 22 17:04:43 AHOSTNAME %ASA-1-123123: Built inbound ICMP connection for faddr 192.168.11.8/50244 gaddr 192.168.1.236/0 laddr 192.168.1.1/161", "ip_src_addr": "192.168.1.35", "syslog_facility": "local1", "action": "built", "syslog_host": "AHOSTNAME", "timestamp": "$METRON_TS", "protocol": "icmp", "guid": "$METRON_GUID", "syslog_severity": "info"}
</pre></div></div>
</li>
<li>
<p>Use the template file along with the enrichment data to create input telemetry with varying IP addresses.</p>
<div>
<div>
<pre class="source">for i in $(head top-1m-with-ip.csv | awk -F, '{print $2}');do
cat asa.template | sed "s/\$DST_ADDR/$i/";
done > asa.input.template
</pre></div></div>
</li>
<li>
<p>Use the <tt>load_tool.sh</tt> script to push messages onto the input topic <tt>enrichments</tt> and monitor the output topic <tt>indexing</tt>. See more information in the Performance <a href="metron-contrib/metron-performance/index.html">README.md</a>.</p>
<p>If the topology is keeping up, obviously the events per second produced on the input topic should roughly match the output topic.</p>
</li>
</ol></div>
<div class="section">
<h3><a name="Cluster_Setup"></a>Cluster Setup</h3>
<div class="section">
<h4><a name="Isolation"></a>Isolation</h4>
<p>The Enrichment topology depends on an environment with at least two and often three components that work together; Storm, Kafka, and HBase. When any of two of these are run on the same node, it can be difficult to identify which of them is becoming a bottleneck. This can cause poor and highly volatile performance as each steals resources from the other.</p>
<p>It is highly recommended that each of these systems be fully isolated from the others. Storm should be run on nodes that are completely isolated from Kafka and HBase.</p></div></div>
<div class="section">
<h3><a name="Monitoring"></a>Monitoring</h3>
<ol style="list-style-type: decimal">
<li>
<p>The <tt>load_test.sh</tt> script will report the throughput for the input and output topics.</p>
<ul>
<li>
<p>The input throughput should roughly match the output throughput if the topology is able to handle a given load.</p>
</li>
<li>
<p>Not only are the raw throughput numbers important, but also the consistency of what is reported over time. If the reported throughput is sporadic, then further tuning may be required.</p>
</li>
</ul>
</li>
<li>
<p>The Storm UI is obviously an important source of information. The bolt capacity, complete latency, and any reported errors are all important to monitor</p>
</li>
<li>
<p>The load reported by the OS is also an important metric to monitor.</p>
<ul>
<li>
<p>The load metric should be monitored to ensure that each node is being pushed sufficiently, but not too much.</p>
</li>
<li>
<p>The load should be evenly distributed across each node. If the load is uneven, this may indicate a problem.</p>
</li>
</ul>
<p>A simple script like the following is sufficient for the task.</p>
<div>
<div>
<pre class="source">for host in $(cat cluster.txt); do
echo $host;
ssh root@$host 'uptime';
done
</pre></div></div>
</li>
<li>
<p>Monitoring the Kafka offset lags indicates how far behind a consumer may be. This can be very useful to determine if the topology is keeping up.</p>
<div>
<div>
<pre class="source">${KAFKA_HOME}/bin/kafka-consumer-groups.sh \
--command-config=/tmp/consumergroup.config \
--describe \
--group enrichments \
--bootstrap-server $BROKERLIST \
--new-consumer
</pre></div></div>
</li>
<li>
<p>A tool like <a class="externalLink" href="https://github.com/yahoo/kafka-manager">Kafka Manager</a> is also very useful for monitoring the input and output topics during test execution.</p>
</li>
</ol></div></div>
<div class="section">
<h2><a name="Performance_Tuning"></a>Performance Tuning</h2>
<p>The approach to tuning the topology will look something like the following. More detailed tuning information is available next to each named parameter</p>
<ul>
<li>
<p>Start the tuning process with a single worker. After tuning the bolts within a single worker, scale out with additional worker processes.</p>
</li>
<li>
<p>Initially set the thread pool size to 1. Increase this value slowly only after tuning the other parameters first. Consider that each worker has its own thread pool and the total size of this thread pool should be far less than the total number of cores available in the cluster.</p>
</li>
<li>
<p>Initially set each bolt parallelism hint to the number of partitions on the input Kafka topic. Monitor bolt capacity and increase the parallelism hint for any bolt whose capacity is close to or exceeds 1.</p>
</li>
<li>
<p>If the topology is not able to keep-up with a given input, then increasing the parallelism is the primary means to scale up.</p>
</li>
<li>
<p>Parallelism units can be used for determining how to distribute processing tasks across the topology. The sum of parallelism can be close to, but should not far exceed this value.</p>
<p>(number of worker nodes in cluster * number cores per worker node) - (number of acker tasks)</p>
</li>
<li>
<p>The throughput that the topology is able to sustain should be relatively consistent. If the throughput fluctuates greatly, increase back pressure using <a href="#topology.max.spout.pending"><tt>topology.max.spout.pending</tt></a>.</p>
</li>
</ul>
<div class="section">
<h3><a name="Parameters"></a>Parameters</h3>
<p>The following parameters are useful for tuning the “Unified” Enrichment topology.</p>
<p>WARNING: Some of the parameter names have been reused from the “Split/Join” topology so the name may not be appropriate. This will be corrected in the future.</p>
<ul>
<li><a href="#enrichment.workers"><tt>enrichment.workers</tt></a></li>
<li><a href="#enrichment.acker.executors"><tt>enrichment.acker.executors</tt></a></li>
<li><a href="#topology.worker.childopts"><tt>topology.worker.childopts</tt></a></li>
<li><a href="#topology.max.spout.pending"><tt>topology.max.spout.pending</tt></a></li>
<li><a href="#kafka.spout.parallelism"><tt>kafka.spout.parallelism</tt></a></li>
<li><a href="#enrichment.join.parallelism"><tt>enrichment.join.parallelism</tt></a></li>
<li><a href="#threat.intel.join.parallelism"><tt>threat.intel.join.parallelism</tt></a></li>
<li><a href="#kafka.writer.parallelism"><tt>kafka.writer.parallelism</tt></a></li>
<li><a href="#enrichment.join.cache.size"><tt>enrichment.join.cache.size</tt></a></li>
<li><a href="#threat.intel.join.cache.size"><tt>threat.intel.join.cache.size</tt></a></li>
<li><a href="#metron.threadpool.size"><tt>metron.threadpool.size</tt></a></li>
<li><a href="#metron.threadpool.type"><tt>metron.threadpool.type</tt></a></li>
</ul>
<div class="section">
<h4><a name="enrichment.workers"></a><tt>enrichment.workers</tt></h4>
<p>The number of worker processes for the enrichment topology.</p>
<ul>
<li>
<p>Start by tuning only a single worker. Maximize throughput for that worker, then increase the number of workers.</p>
</li>
<li>
<p>The throughput should scale relatively linearly as workers are added. This reaches a limit as the number of workers running on a single node saturate the resources available. When this happens, adding workers, but on additional nodes should allow further scaling.</p>
</li>
<li>
<p>Increase parallelism before attempting to increase the number of workers.</p>
</li>
</ul></div>
<div class="section">
<h4><a name="enrichment.acker.executors"></a><tt>enrichment.acker.executors</tt></h4>
<p>The number of ackers within the topology.</p>
<ul>
<li>
<p>This should most often be equal to the number of workers defined in <tt>enrichment.workers</tt>.</p>
</li>
<li>
<p>Within the Storm UI, click the “Show System Stats” button. This will display a bolt named <tt>__acker</tt>. If the capacity of this bolt is too high, then increase the number of ackers.</p>
</li>
</ul></div>
<div class="section">
<h4><a name="topology.worker.childopts"></a><tt>topology.worker.childopts</tt></h4>
<p>This parameter accepts arguments that will be passed to the JVM created for each Storm worker. This allows for control over the heap size, garbage collection, and any other JVM-specific parameter.</p>
<ul>
<li>
<p>Start with a 2G heap and increase as needed. Running with 8G was found to be beneficial, but will vary depending on caching needs.</p>
<p><tt>-Xms8g -Xmx8g</tt></p>
</li>
<li>
<p>The Garbage First Garbage Collector (G1GC) is recommended along with a cap on the amount of time spent in garbage collection. This is intended to help address small object allocation issues due to our extensive use of caches.</p>
<p><tt>-XX:+UseG1GC -XX:MaxGCPauseMillis=100</tt></p>
</li>
<li>
<p>If the caches in use are very large (as defined by either <a href="#enrichment.join.cache.size"><tt>enrichment.join.cache.size</tt></a> or <a href="#threat.intel.join.cache.size"><tt>threat.intel.join.cache.size</tt></a>) and performance is poor, turning on garbage collection logging might be helpful.</p>
</li>
</ul></div>
<div class="section">
<h4><a name="topology.max.spout.pending"></a><tt>topology.max.spout.pending</tt></h4>
<p>This limits the number of unacked tuples that the spout can introduce into the topology.</p>
<ul>
<li>
<p>Decreasing this value will increase back pressure and allow the topology to consume messages at a pace that is maintainable.</p>
</li>
<li>
<p>If the spout throws ‘Commit Failed Exceptions’ then the topology is not keeping up. Decreasing this value is one way to ensure that messages can be processed before they time out.</p>
</li>
<li>
<p>If the topology’s throughput is unsteady and inconsistent, decrease this value. This should help the topology consume messages at a maintainable pace.</p>
</li>
<li>
<p>If the bolt capacity is low, the topology can handle additional load. Increase this value so that more tuples are introduced into the topology which should increase the bolt capacity.</p>
</li>
</ul></div>
<div class="section">
<h4><a name="kafka.spout.parallelism"></a><tt>kafka.spout.parallelism</tt></h4>
<p>The parallelism of the Kafka spout within the topology. Defines the maximum number of executors for each worker dedicated to running the spout.</p>
<ul>
<li>
<p>The spout parallelism should most often be set to the number of partitions of the input Kafka topic.</p>
</li>
<li>
<p>If the enrichment bolt capacity is low, increasing the parallelism of the spout can introduce additional load on the topology.</p>
</li>
</ul></div>
<div class="section">
<h4><a name="enrichment.join.parallelism"></a><tt>enrichment.join.parallelism</tt></h4>
<p>The parallelism hint for the enrichment bolt. Defines the maximum number of executors within each worker dedicated to running the enrichment bolt.</p>
<p>WARNING: The property name does not match its current usage in the Unified topology. This property name may change in the near future as it has been reused from the Split-Join topology.</p>
<ul>
<li>
<p>If the capacity of the enrichment bolt is high, increasing the parallelism will introduce additional executors to bring the bolt capacity down.</p>
</li>
<li>
<p>If the throughput of the topology is too low, increase this value. This allows additional tuples to be enriched in parallel.</p>
</li>
<li>
<p>Increasing parallelism on the enrichment bolt will at some point put pressure on the downstream threat intel and output bolts. As this value is increased, monitor the capacity of the downstream bolts to ensure that they do not become a bottleneck.</p>
</li>
</ul></div>
<div class="section">
<h4><a name="threat.intel.join.parallelism"></a><tt>threat.intel.join.parallelism</tt></h4>
<p>The parallelism hint for the threat intel bolt. Defines the maximum number of executors within each worker dedicated to running the threat intel bolt.</p>
<p>WARNING: The property name does not match its current usage in the Unified topology. This property name may change in the near future as it has been reused from the Split-Join topology.</p>
<ul>
<li>
<p>If the capacity of the threat intel bolt is high, increasing the parallelism will introduce additional executors to bring the bolt capacity down.</p>
</li>
<li>
<p>If the throughput of the topology is too low, increase this value. This allows additional tuples to be enriched in parallel.</p>
</li>
<li>
<p>Increasing parallelism on this bolt will at some point put pressure on the downstream output bolt. As this value is increased, monitor the capacity of the output bolt to ensure that it does not become a bottleneck.</p>
</li>
</ul></div>
<div class="section">
<h4><a name="kafka.writer.parallelism"></a><tt>kafka.writer.parallelism</tt></h4>
<p>The parallelism hint for the output bolt which writes to the output Kafka topic. Defines the maximum number of executors within each worker dedicated to running the output bolt.</p>
<ul>
<li>If the capacity of the output bolt is high, increasing the parallelism will introduce additional executors to bring the bolt capacity down.</li>
</ul></div>
<div class="section">
<h4><a name="enrichment.join.cache.size"></a><tt>enrichment.join.cache.size</tt></h4>
<p>The Enrichment bolt maintains a cache so that if the same enrichment occurs repetitively, the value can be retrieved from the cache instead of it being recomputed.</p>
<p>There is a great deal of repetition in network telemetry, which leads to a great deal of repetition for the enrichments that operate on that telemetry. Having a highly performant cache is one of the most critical factors driving performance.</p>
<p>WARNING: The property name does not match its current usage in the Unified topology. This property name may change in the near future as it has been reused from the Split-Join topology.</p>
<ul>
<li>
<p>Increase the size of the cache to improve the rate of cache hits.</p>
</li>
<li>
<p>Increasing the size of the cache may require that you increase the worker heap size using `topology.worker.childopts’.</p>
</li>
</ul></div>
<div class="section">
<h4><a name="threat.intel.join.cache.size"></a><tt>threat.intel.join.cache.size</tt></h4>
<p>The Threat Intel bolt maintains a cache so that if the same enrichment occurs repetitively, the value can be retrieved from the cache instead of it being recomputed.</p>
<p>There is a great deal of repetition in network telemetry, which leads to a great deal of repetition for the enrichments that operate on that telemetry. Having a highly performant cache is one of the most critical factors driving performance.</p>
<p>WARNING: The property name does not match its current usage in the Unified topology. This property name may change in the near future as it has been reused from the Split-Join topology.</p>
<ul>
<li>
<p>Increase the size of the cache to improve the rate of cache hits.</p>
</li>
<li>
<p>Increasing the size of the cache may require that you increase the worker heap size using `topology.worker.childopts’.</p>
</li>
</ul></div>
<div class="section">
<h4><a name="metron.threadpool.size"></a><tt>metron.threadpool.size</tt></h4>
<p>This value defines the number of threads maintained within a pool to execute each enrichment. This value can either be a fixed number or it can be a multiple of the number of cores (5C = 5 times the number of cores).</p>
<p>The enrichment bolt maintains a static thread pool that is used to execute each enrichment. This thread pool is shared by all of the executors running within the same worker.</p>
<p>WARNING: This value must be manually defined within the flux file at <tt>$METRON_HOME/flux/enrichment/remote-unified.yaml</tt>. This value cannot be altered within Ambari at this time.</p>
<ul>
<li>
<p>Start with a thread pool size of 1. Adjust this value after tuning all other parameters first. Only increase this value if testing shows performance improvements in your environment given your workload.</p>
</li>
<li>
<p>If the thread pool size is too large this will cause the work to be shuffled amongst multiple CPU cores, which significantly decreases performance. Using a smaller thread pool helps pin work to a single core.</p>
</li>
<li>
<p>If the thread pool size is too small this can negatively impact IO-intensive workloads. Increasing the thread pool size, helps when using IO-intensive workloads with a significant cache miss rate. A thread pool size of 3-5 can help in these cases.</p>
</li>
<li>
<p>Most workloads will make significant use of the cache and so 1-2 threads will most likely be optimal.</p>
</li>
<li>
<p>The bolt uses a static thread pool. To scale out, but keep the work mostly pinned to a CPU core, add more Storm workers while keeping the thread pool size low.</p>
</li>
<li>
<p>If a larger thread pool increases load on the system, but decreases the throughput, then it is likely that the system is thrashing. In this case the thread pool size should be decreased.</p>
</li>
</ul></div>
<div class="section">
<h4><a name="metron.threadpool.type"></a><tt>metron.threadpool.type</tt></h4>
<p>The enrichment bolt maintains a static thread pool that is used to execute each enrichment. This thread pool is shared by all of the executors running within the same worker.</p>
<p>Defines the type of thread pool used. This value can be either “FIXED” or “WORK_STEALING”.</p>
<p>Currently, this value must be manually defined within the flux file at <tt>$METRON_HOME/flux/enrichment/remote-unified.yaml</tt>. This value cannot be altered within Ambari.</p></div></div>
<div class="section">
<h3><a name="Benchmark_Results"></a>Benchmark Results</h3>
<p>This section describes one execution of these benchmarks to help provide an understanding of what reasonably tuned parameters might look-like.</p>
<p>These parameters and the throughput reported are highly dependent on the workload and resources available. The throughput is what was achievable given a reasonable amount of tuning on a small, dedicated cluster. The throughput is largely dependent on the enrichments performed and the distribution of data within the incoming telemetry.</p>
<p>The Enrichment topology has been show to scale relatively linearly. Adding more resources allows for more complex enrichments, across more diverse data sets, at higher volumes. The throughput that one might see in production largely depends on how much hardware can be committed to the task.</p>
<div class="section">
<h4><a name="Environment"></a>Environment</h4>
<ul>
<li>
<p>Apache Metron 0.5.0 (pre-release) March, 2018</p>
<ul>
<li>This included <a class="externalLink" href="https://github.com/apache/metron/pull/947">a patch to the underlying caching mechanism</a> that greatly improves performance.</li>
</ul>
</li>
<li>
<p>Cisco UCS nodes</p>
<ul>
<li>32 core, 64-bit CPU (Intel(R) Xeon(R) CPU E5-2630 v3 @ 2.40GHz)</li>
<li>256 GB RAM</li>
<li>x2 10G NIC bonded</li>
<li>x4 6TB 7200 RPM disks</li>
</ul>
</li>
<li>
<p>Storm Supervisors are isolated and running on a dedicated set of 3 nodes.</p>
</li>
<li>
<p>Kafka Brokers are isolated and running on a separate, dedicated set of 3 nodes.</p>
</li>
</ul></div>
<div class="section">
<h4><a name="Results"></a>Results</h4>
<ul>
<li>
<p>These benchmarks executed all 3 enrichments simultaneously; the <a href="#Geo_IP_Enrichment">Geo IP Enrichment</a>, <a href="#Stellar_Enrichment">Stellar Enrichment</a> and the <a href="#HBase_Enrichment">HBase Enrichment</a>.</p>
</li>
<li>
<p>The data used to drive the benchmark includes 10,000 unique IP addresses. The telemetry was populated with IP addresses such that 10% of these IPs were chosen 80% of the time. This bias was designed to mimic the typical distribution seen in real-world telemetry.</p>
</li>
<li>
<p>The Unified Enrichment topology was able to sustain 308,000 events per second on a small, dedicated 3 node cluster.</p>
</li>
<li>
<p>The values used to achieve these results with the Unified Enrichment topology follows. You should not attempt to use these parameters in your topology directly. These are specific to the environment and workload and should only be used as a guideline.</p>
<div>
<div>
<pre class="source">enrichment.workers=9
enrichment.acker.executors=9
enrichment.join.cache.size=100000
threat.intel.join.cache.size=100000
kafka.spout.parallelism=27
enrichment.join.parallelism=54
threat.intel.join.parallelism=9
kafka.writer.parallelism=27
topology.worker.childopts=-XX:+UseG1GC -Xms8g -Xmx8g -XX:MaxGCPauseMillis=100
topology.max.spout.pending=3000
metron.threadpool.size=1
metron.threadpool.type=FIXED
</pre></div></div>
</li>
</ul></div></div></div>
</div>
</div>
</div>
<hr/>
<footer>
<div class="container-fluid">
<div class="row-fluid">
© 2015-2016 The Apache Software Foundation. Apache Metron, Metron, Apache, the Apache feather logo,
and the Apache Metron project logo are trademarks of The Apache Software Foundation.
</div>
</div>
</footer>
</body>
</html>
| {
"pile_set_name": "Github"
} |
# Pay-As-You-Go {#Pay-As-You-Go .concept}
With the Pay-As-You-Go billing method, you are charged based on the amount of resources you actually use. Pay-As-You-Go allows you to activate and release resources at any time to meet your requirements. You can purchase resources on demand, and scale up as your business grows. Costs can be reduced by 30% to 80% compared to a traditional host investment, with which many resources may be wasted at times.
**Note:** All the charging rules described in this article is for reference purpose only. For more information, please contact your service provider.
## Applicable resources {#section_xmc_xbg_c2b .section}
Currently, the Pay-As-You-Go billing method is applicable to the following ECS resources:
- ECS instances, including CPU configuration and memory capacity
- Images
- System disks and/or data disks
If you create an ECS instance that uses the Pay-As-You-Go billing method, the **Instance Cost** displayed in the bottom of the instance creation page is the total fee for the preceding three types of resources.
You can make following changes after activating Pay-As-You-Go resources:
- Resource configuration change:
You can change the instance types, including CPU configuration and memory capacity, after you create an instance. For more information, see [Change configurations of Pay-As-You-Go instances](../../../../../reseller.en-US/Instance/Change configurations/Change configurations of Pay-As-You-Go instances/Change configurations of Pay-As-You-Go instances.md#).
- Billing method change:
Instances, system disks, and data disks support switching from Pay-As-You-Go billing to Subscription billing. For more information, see [Switch from Pay-As-You-Go to Subscription billing](reseller.en-US/Pricing/Switch from Pay-As-You-Go to Subscription billing.md#).
## Payment methods {#section_kgq_1gm_42b .section}
Credits are used to pay for the resources of the Pay-As-You-Go billing method.
## Billing period {#section_rbk_ldg_c2b .section}
A Pay-As-You-Go resource is billed by the second after is it created, and billing stops after it is released.
For a VPC instance, you can enable the [no fees for stopped instances feature](reseller.en-US/Pricing/No fees for stopped VPC instances.md#). When the feature is enabled, a VPC instance is not billed when it is in a **Stopped** status. This feature is only available for instances, and not for other ECS resources.
The billing cycle varies depending on the resource types. The minimum charge for the lifecycle of an ECS instance \(from creation to release\) is USD 0.01.
|Item|Instances + Images|System disks|Data disks|
|:---|:-----------------|:-----------|:---------|
|Billing cycle|One second|One second|One second|
|Price unit|USD/hour|USD/\(GiB \* hours\)|USD/\(GiB \* hours\)|
## Settlement cycle {#section_ipb_4x2_zdb .section}
Pay-As-You-Go resources are billed by the second, but settled by the hour. Note the following:
- Payments for Pay-As-You-Go resources are settled together with other products under your account that are billed after you use them.
- Generally, if the cumulative monthly consumption amount of your account is less than 1,000 USD, fees are deducted on the first day of the following month.
- If you have a quota agreement with Alibaba Cloud, fees are deducted when the cumulative consumption amount of your account exceeds the quota.
## Instructions for settlement {#section_mwz_qx2_zdb .section}
- **Settlement period**
- For ECS instances: The active duration is the time during which the ECS instance runs properly, starting from when the ECS instance is activated to when it is released or expires. If the instance is out of service during the active duration due to an overdue payment, billing stops until the payment is cleared.
- For system disks and/or data disks: The active duration is the time during which the disks run properly, starting from when the disks are activated to when they are released.
- **Release rules**
- If payment for an ECS instance is overdue, usage of Pay-As-You-Go cloud disks is restricted, and the cloud disks cannot process I/O read and write requests properly, affecting the normal running of the ECS instance. The impact includes but is not limited to the reduced performance of application read/write, serious time-out of some operations, and power-off or restart failure for some operating system versions.
- ECS instances configured with the automatic release time are automatically released at a specified time.
- Notification of release: In the event of service expiration or overdue payment, the system notifies you by email.
## Resource status when an instance is out of service {#section_rpb_4x2_zdb .section}
If you fail to pay for the Pay-As-You-Go resources fees three times in one settlement period, the instance is out of service on the day T+15. When your instance is out of service, you cannot use the resources normally until you clear the overdue payment. Once the payment is cleared, you must [reactivate the instance](../../../../../reseller.en-US/Instance/ECS instance life cycle/Restart an instance.md#) within the specified period. The following table lists the status of the related resources once the instance is out of service.
|Period|ECS instance and image|System disk + data disks|Internet IP address|Snapshots|
|:-----|:---------------------|:-----------------------|:------------------|:--------|
|Within 15 days of the instance going out of service \(T+15 to T+30\)|Both stop working.|When the instance is out of service\*, the capability of the cloud disks and the local disks is limited. But the data on them is retained.| - For instances of the Classic network type: The assigned Internet IP address is retained.
- For VPC instances: If an Internet IP address is assigned, it is retained. If an elastic IP \(EIP\) address is bound to the instance, it is retained.
|Retained.|
|15 days after the instance goes out of service \(T+30\)|Released automatically. You are notified in advance by emails when the resources will be released.| All cloud disks, including system disks and data disks that are created separately or together with the instance, or that are attached to the instance or not, are released automatically. The data cannot be recovered.
The local disks are released automatically, and the data on them cannot be recovered.
If shared block storage is attached to the instance, it is detached automatically, and the data on it is retained.
| For instances of the Classic network type: The assigned Internet IP address is released.
For VPC instances: If an Internet IP address is assigned, it is released. If an EIP address is bound to the instance, it is unbound automatically.
|The automatic snapshots are deleted automatically. The snapshots that are manually created are retained.|
\* When a Pay-As-You-Go instance is **out of service**, the instance is in an **Expired**status. During the period it is out of service, no fees are incurred.
## FAQs {#section_utf_tx2_zdb .section}
**If a Pay-As-You-Go ECS instance is out of service or has stopped running, are fees still incurred?**
An instance stops working and is rendered out-of-service when a payment is overdue. When a Pay-As-You-Go instance is out of service, it is in an **Expired** status, and no fees are incurred.
A stopped instance is in a Stopped status and has been stopped [in the ECS console](../../../../../reseller.en-US/Instance/ECS instance life cycle/Start or stop an instance.md#) or by using the [StopInstance](../../../../../reseller.en-US/API Reference/Instances/StopInstance.md#) interface. Billing of a stopped instance varies according to the network type of the instance:
- VPC: You can enable the [No fees for stopped instances \(VPC-Connected\)](reseller.en-US/Pricing/No fees for stopped VPC instances.md#) feature. When this feature is enabled, an instance is not billed when it is in a **Stopped** status. This feature is only available for instances, and not for other resources.
- Classic: An instance continues to be billed even after it is in a **Stopped** status.
| {
"pile_set_name": "Github"
} |
<!doctype html>
<!-- This Source Code Form is subject to the terms of the Mozilla Public
- License, v. 2.0. If a copy of the MPL was not distributed with this file,
- You can obtain one at http://mozilla.org/MPL/2.0/. -->
<head>
<meta name="viewport" content="width=device-width, initial-scale=1">
<link rel="stylesheet" type="text/css" href="style.css">
</head>
<html>
<body>
<p>Ihre Rechte</p>
<p>Firefox Klar ist freie und quelloffene Software von Mozilla und anderen Unterstützern.</p>
<p>Firefox Klar wird Ihnen unter den Bedingungen der <a href="https://www.mozilla.org/en-US/MPL/">Mozilla Public License</a> und anderer Lizenzen quelloffener Projekte zur Verfügung gestellt.</p>
<p>Mozilla gibt Ihnen keine Markenrechte oder Lizenzen an den Handelsmarken der Mozilla Foundation oder irgendeiner Partei, einschließlich der Namen und Logos von Mozilla, Firefox und Firefox Klar. Weitere Informationen finden Sie <a href="https://www.mozilla.org/foundation/trademarks/policy/">hier</a>.</p>
<p>Zusätzlicher Quellcode für Firefox Klar steht unter verschiedenen anderen Lizenzen kostenloser oder quelloffener <a href="licenses.html">Projekte zur Verfügung</a>.</p>
<p>Firefox Klar verwendet von Disconnect, Inc. bereitgestellte Sperrlisten als selbständige und unabhängige Werke unter der <a href="gpl.html">GNU General Public License v3</a>. Diese sind <a href="https://wiki.mozilla.org/Security/Tracking_protection#Lists">hier</a> verfügbar.</p>
</body>
</html>
| {
"pile_set_name": "Github"
} |
#ifndef WM8785_H_INCLUDED
#define WM8785_H_INCLUDED
#define WM8785_R0 0
#define WM8785_R1 1
#define WM8785_R2 2
#define WM8785_R7 7
/* R0 */
#define WM8785_MCR_MASK 0x007
#define WM8785_MCR_SLAVE 0x000
#define WM8785_MCR_MASTER_128 0x001
#define WM8785_MCR_MASTER_192 0x002
#define WM8785_MCR_MASTER_256 0x003
#define WM8785_MCR_MASTER_384 0x004
#define WM8785_MCR_MASTER_512 0x005
#define WM8785_MCR_MASTER_768 0x006
#define WM8785_OSR_MASK 0x018
#define WM8785_OSR_SINGLE 0x000
#define WM8785_OSR_DOUBLE 0x008
#define WM8785_OSR_QUAD 0x010
#define WM8785_FORMAT_MASK 0x060
#define WM8785_FORMAT_RJUST 0x000
#define WM8785_FORMAT_LJUST 0x020
#define WM8785_FORMAT_I2S 0x040
#define WM8785_FORMAT_DSP 0x060
/* R1 */
#define WM8785_WL_MASK 0x003
#define WM8785_WL_16 0x000
#define WM8785_WL_20 0x001
#define WM8785_WL_24 0x002
#define WM8785_WL_32 0x003
#define WM8785_LRP 0x004
#define WM8785_BCLKINV 0x008
#define WM8785_LRSWAP 0x010
#define WM8785_DEVNO_MASK 0x0e0
/* R2 */
#define WM8785_HPFR 0x001
#define WM8785_HPFL 0x002
#define WM8785_SDODIS 0x004
#define WM8785_PWRDNR 0x008
#define WM8785_PWRDNL 0x010
#define WM8785_TDM_MASK 0x1c0
#endif
| {
"pile_set_name": "Github"
} |
/* Copyright 2015-2017 Philippe Tillet
*
* 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.
*/
#include <cassert>
#include <array>
#include "triton/driver/backend.h"
#include "triton/driver/stream.h"
#include "triton/driver/context.h"
#include "triton/driver/device.h"
#include "triton/driver/event.h"
#include "triton/driver/kernel.h"
#include "triton/driver/buffer.h"
#include "llvm/ExecutionEngine/ExecutionEngine.h"
#include "llvm/ExecutionEngine/GenericValue.h"
namespace triton
{
namespace driver
{
/* ------------------------ */
// Base //
/* ------------------------ */
stream::stream(driver::context *ctx, CUstream cu, bool has_ownership)
: polymorphic_resource(cu, has_ownership), ctx_(ctx) {
}
stream::stream(driver::context *ctx, cl_command_queue cl, bool has_ownership)
: polymorphic_resource(cl, has_ownership), ctx_(ctx) {
}
stream::stream(driver::context *ctx, host_stream_t cl, bool has_ownership)
: polymorphic_resource(cl, has_ownership), ctx_(ctx) {
}
driver::stream* stream::create(driver::context* ctx) {
switch(ctx->backend()){
case CUDA: return new cu_stream(ctx);
case OpenCL: return new cl_stream(ctx);
case Host: return new host_stream(ctx);
default: throw std::runtime_error("unknown backend");
}
}
driver::context* stream::context() const {
return ctx_;
}
/* ------------------------ */
// Host //
/* ------------------------ */
host_stream::host_stream(driver::context *ctx): stream(ctx, host_stream_t(), true) {
hst_->pool.reset(new ThreadPool(8));
}
void host_stream::synchronize() {
hst_->pool.reset(new ThreadPool(8));
}
void host_stream::enqueue(driver::kernel* kernel, std::array<size_t, 3> grid, std::array<size_t, 3> block, std::vector<event> const *, event* event, void **args, size_t args_size) {
ThreadPool pool(4);
auto hst = kernel->module()->hst();
for(size_t i = 0; i < grid[0]; i++)
for(size_t j = 0; j < grid[1]; j++)
for(size_t k = 0; k < grid[2]; k++)
hst_->pool->enqueue(hst->fn, (char**)args, int32_t(i), int32_t(j), int32_t(k));
}
void host_stream::write(driver::buffer* buffer, bool blocking, std::size_t offset, std::size_t size, void const* ptr) {
std::memcpy((void*)buffer->hst()->data, ptr, size);
}
void host_stream::read(driver::buffer* buffer, bool blocking, std::size_t offset, std::size_t size, void* ptr) {
std::memcpy(ptr, (const void*)buffer->hst()->data, size);
}
/* ------------------------ */
// OpenCL //
/* ------------------------ */
cl_stream::cl_stream(driver::context *ctx): stream(ctx, cl_command_queue(), true) {
cl_int err;
*cl_ = dispatch::clCreateCommandQueue(*ctx->cl(), *ctx->device()->cl(), 0, &err);
check(err);
}
void cl_stream::synchronize() {
check(dispatch::clFinish(*cl_));
}
void cl_stream::enqueue(driver::kernel* kernel, std::array<size_t, 3> grid, std::array<size_t, 3> block, std::vector<event> const *, event* event, void **args, size_t args_size) {
std::array<size_t, 3> global = {grid[0]*block[0], grid[1]*block[1], grid[2]*block[2]};
check(dispatch::clEnqueueNDRangeKernel(*cl_, *kernel->cl(), grid.size(), NULL, (const size_t*)global.data(), (const size_t*)block.data(), 0, NULL, NULL));
}
void cl_stream::write(driver::buffer* buffer, bool blocking, std::size_t offset, std::size_t size, void const* ptr) {
check(dispatch::clEnqueueWriteBuffer(*cl_, *buffer->cl(), blocking?CL_TRUE:CL_FALSE, offset, size, ptr, 0, NULL, NULL));
}
void cl_stream::read(driver::buffer* buffer, bool blocking, std::size_t offset, std::size_t size, void* ptr) {
check(dispatch::clEnqueueReadBuffer(*cl_, *buffer->cl(), blocking?CL_TRUE:CL_FALSE, offset, size, ptr, 0, NULL, NULL));
}
/* ------------------------ */
// CUDA //
/* ------------------------ */
inline CUcontext get_context() {
CUcontext result;
dispatch::cuCtxGetCurrent(&result);
return result;
}
cu_stream::cu_stream(CUstream str, bool take_ownership):
stream(backend::contexts::import(get_context()), str, take_ownership) {
}
cu_stream::cu_stream(driver::context *context): stream((driver::cu_context*)context, CUstream(), true) {
cu_context::context_switcher ctx_switch(*ctx_);
dispatch::cuStreamCreate(&*cu_, 0);
}
void cu_stream::synchronize() {
cu_context::context_switcher ctx_switch(*ctx_);
dispatch::cuStreamSynchronize(*cu_);
}
void cu_stream::enqueue(driver::kernel* kernel, std::array<size_t, 3> grid, std::array<size_t, 3> block, std::vector<event> const *, event* event, void** args, size_t args_size) {
cu_context::context_switcher ctx_switch(*ctx_);
void *config[] = {
CU_LAUNCH_PARAM_BUFFER_POINTER, args,
CU_LAUNCH_PARAM_BUFFER_SIZE, &args_size,
CU_LAUNCH_PARAM_END
};
if(event)
dispatch::cuEventRecord(event->cu()->first, *cu_);
dispatch::cuLaunchKernel(*kernel->cu(), grid[0], grid[1], grid[2], block[0], block[1], block[2], 0, *cu_, nullptr, config);
if(event)
dispatch::cuEventRecord(event->cu()->second, *cu_);
}
void cu_stream::write(driver::buffer* buffer, bool blocking, std::size_t offset, std::size_t size, void const* ptr) {
cu_context::context_switcher ctx_switch(*ctx_);
if(blocking)
dispatch::cuMemcpyHtoD(*buffer->cu() + offset, ptr, size);
else
dispatch::cuMemcpyHtoDAsync(*buffer->cu() + offset, ptr, size, *cu_);
}
void cu_stream::read(driver::buffer* buffer, bool blocking, std::size_t offset, std::size_t size, void* ptr) {
cu_context::context_switcher ctx_switch(*ctx_);
if(blocking)
dispatch::cuMemcpyDtoH(ptr, *buffer->cu() + offset, size);
else
dispatch::cuMemcpyDtoHAsync(ptr, *buffer->cu() + offset, size, *cu_);
}
}
}
| {
"pile_set_name": "Github"
} |
use crate::ScriptError;
use byteorder::{ByteOrder, LittleEndian};
use ckb_types::core::TransactionView;
use ckb_vm::{
instructions::{extract_opcode, i, m, rvc, Instruction, Itype, Stype},
registers::{RA, ZERO},
};
use ckb_vm_definitions::instructions as insts;
use goblin::elf::{section_header::SHF_EXECINSTR, Elf};
const CKB_VM_ISSUE_92: &str = "https://github.com/nervosnetwork/ckb-vm/issues/92";
pub struct IllTransactionChecker<'a> {
tx: &'a TransactionView,
}
impl<'a> IllTransactionChecker<'a> {
pub fn new(tx: &'a TransactionView) -> Self {
IllTransactionChecker { tx }
}
pub fn check(&self) -> Result<(), ScriptError> {
for (i, data) in self.tx.outputs_data().into_iter().enumerate() {
IllScriptChecker::new(&data.raw_data(), i).check()?;
}
Ok(())
}
}
struct IllScriptChecker<'a> {
data: &'a [u8],
index: usize,
}
impl<'a> IllScriptChecker<'a> {
pub fn new(data: &'a [u8], index: usize) -> Self {
IllScriptChecker { data, index }
}
pub fn check(&self) -> Result<(), ScriptError> {
if self.data.is_empty() {
return Ok(());
}
let elf = match Elf::parse(self.data) {
Ok(elf) => elf,
// If the data cannot be parsed as ELF format, we will treat
// it as a non-script binary data. The checking will be skipped
// here.
Err(_) => return Ok(()),
};
for section_header in elf.section_headers {
if section_header.sh_flags & u64::from(SHF_EXECINSTR) != 0 {
let mut pc = section_header.sh_offset;
let end = section_header.sh_offset + section_header.sh_size;
while pc < end {
match self.decode_instruction(pc) {
(Some(i), len) => {
match extract_opcode(i) {
insts::OP_JALR => {
let i = Itype(i);
if i.rs1() == i.rd() && i.rd() != ZERO {
return Err(ScriptError::EncounteredKnownBugs(
CKB_VM_ISSUE_92.to_string(),
self.index,
));
}
}
insts::OP_RVC_JALR => {
let i = Stype(i);
if i.rs1() == RA {
return Err(ScriptError::EncounteredKnownBugs(
CKB_VM_ISSUE_92.to_string(),
self.index,
));
}
}
_ => (),
};
pc += len;
}
(None, len) => {
pc += len;
}
}
}
}
}
Ok(())
}
fn decode_instruction(&self, pc: u64) -> (Option<Instruction>, u64) {
if pc + 2 > self.data.len() as u64 {
return (None, 2);
}
let mut i = u32::from(LittleEndian::read_u16(&self.data[pc as usize..]));
let len = if i & 0x3 == 0x3 { 4 } else { 2 };
if len == 4 {
if pc + 4 > self.data.len() as u64 {
return (None, 4);
}
i = LittleEndian::read_u32(&self.data[pc as usize..]);
}
let factories = [rvc::factory::<u64>, i::factory::<u64>, m::factory::<u64>];
for factory in &factories {
if let Some(instruction) = factory(i) {
return (Some(instruction), len);
}
}
(None, len)
}
}
#[cfg(test)]
mod tests {
use super::*;
use std::fs::read;
use std::path::Path;
#[test]
fn check_good_binary() {
let data =
read(Path::new(env!("CARGO_MANIFEST_DIR")).join("../script/testdata/verify")).unwrap();
assert!(IllScriptChecker::new(&data, 13).check().is_ok());
}
#[test]
fn check_defected_binary() {
let data =
read(Path::new(env!("CARGO_MANIFEST_DIR")).join("../script/testdata/defected_binary"))
.unwrap();
assert_eq!(
IllScriptChecker::new(&data, 13).check().unwrap_err(),
ScriptError::EncounteredKnownBugs(CKB_VM_ISSUE_92.to_string(), 13),
);
}
#[test]
fn check_jalr_zero_binary() {
let data = read(Path::new(env!("CARGO_MANIFEST_DIR")).join("../script/testdata/jalr_zero"))
.unwrap();
assert!(IllScriptChecker::new(&data, 13).check().is_ok());
}
}
| {
"pile_set_name": "Github"
} |
# See LICENSE for license details.
ifndef FIRESIM_ENV_SOURCED
$(error You must source sourceme-f1-manager.sh or env.sh to use this Makefile)
endif
firesim_base_dir := $(abspath .)
default: compile
##################
# Parameters #
##################
# Multiple target-projects, each with it's own chisel generator, co-exist in firesim.
# Their sources exist in:
# src/main/{cc, scala, makefrag}/<target-project-name>
#
# Currently these projects are:
# firesim: the default, rocket-chip-based target-designs
# midasexamples: simple chisel designs demonstrating how to build midas-style simulators
TARGET_PROJECT ?= firesim
# Users can override this to point at a makefrag defined in a parent project
# that submodules firesim or source sim/Makefrag directly
TARGET_PROJECT_MAKEFRAG ?= $(firesim_base_dir)/src/main/makefrag/$(TARGET_PROJECT)/Makefrag
# The host-platform type (currently only f1 supported)
PLATFORM ?= f1
ifdef FIRESIM_STANDALONE
base_dir := $(firesim_base_dir)
chipyard_dir := $(abspath ..)/target-design/chipyard
rocketchip_dir := $(chipyard_dir)/generators/rocket-chip
JVM_MEMORY ?= 16G
SCALA_VERSION ?= 2.12.10
JAVA_ARGS ?= -Xmx$(JVM_MEMORY)
SBT ?= java $(JAVA_ARGS) -jar $(rocketchip_dir)/sbt-launch.jar
# Manage the FIRRTL dependency manually
FIRRTL_SUBMODULE_DIR ?= $(chipyard_dir)/tools/firrtl
FIRRTL_JAR ?= $(chipyard_dir)/lib/firrtl.jar
FIRRTL_TEST_JAR ?= $(chipyard_dir)/test_lib/firrtl.jar
firrtl_srcs := $(shell find $(FIRRTL_SUBMODULE_DIR) -iname "[!.]*.scala")
$(FIRRTL_JAR): $(firrtl_srcs)
$(MAKE) -C $(FIRRTL_SUBMODULE_DIR) SBT="$(SBT)" root_dir=$(FIRRTL_SUBMODULE_DIR) build-scala
mkdir -p $(@D)
touch $(FIRRTL_SUBMODULE_DIR)/utils/bin/firrtl.jar
cp -p $(FIRRTL_SUBMODULE_DIR)/utils/bin/firrtl.jar $@
$(FIRRTL_TEST_JAR): $(firrtl_srcs)
cd $(FIRRTL_SUBMODULE_DIR) && $(SBT) "test:assembly"
mkdir -p $(@D)
touch $(FIRRTL_SUBMODULE_DIR)/utils/bin/firrtl-test.jar
cp -p $(FIRRTL_SUBMODULE_DIR)/utils/bin/firrtl-test.jar $@
firrtl: $(FIRRTL_JAR)
.PHONY: firrtl
else
# Chipyard make variables
base_dir := $(abspath ../../..)
sim_dir := $(firesim_base_dir)
chipyard_dir := $(base_dir)
include $(base_dir)/variables.mk
include $(base_dir)/common.mk
endif
# Include target-specific sources and input generation recipes
include $(TARGET_PROJECT_MAKEFRAG)
verilog: $(VERILOG)
compile: $(VERILOG)
# Phony targets for launching the sbt shell and running scalatests
SBT_COMMAND ?= shell
.PHONY: sbt
sbt: $(FIRRTL_JAR) $(FIRRTL_TEST_JAR)
cd $(base_dir) && $(SBT) "project $(firesim_sbt_project)" "$(SBT_COMMAND)"
.PHONY: test
test: $(FIRRTL_JAR) $(FIRRTL_TEST_JAR)
cd $(base_dir) && $(SBT) "project $(firesim_sbt_project)" "test"
.PHONY: testOnly
testOnly: $(FIRRTL_JAR) $(FIRRTL_TEST_JAR)
cd $(base_dir) && $(SBT) "project $(firesim_sbt_project)" "testOnly $(SCALA_TEST)"
# All target-agnostic firesim recipes are defined here
include target-agnostic.mk
| {
"pile_set_name": "Github"
} |
// Copyright 2016 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ui/views/animation/flood_fill_ink_drop_ripple.h"
#include <algorithm>
#include <utility>
#include "base/logging.h"
#include "third_party/skia/include/core/SkColor.h"
#include "ui/compositor/layer.h"
#include "ui/compositor/layer_animation_sequence.h"
#include "ui/compositor/scoped_layer_animation_settings.h"
#include "ui/gfx/animation/animation.h"
#include "ui/gfx/geometry/point_conversions.h"
#include "ui/gfx/geometry/vector2d_f.h"
#include "ui/views/animation/ink_drop_util.h"
#include "ui/views/style/platform_style.h"
namespace {
// The minimum radius to use when scaling the painted layers. Smaller values
// were causing visual anomalies.
constexpr float kMinRadius = 1.f;
// All the sub animations that are used to animate each of the InkDropStates.
// These are used to get time durations with
// GetAnimationDuration(InkDropSubAnimations). Note that in general a sub
// animation defines the duration for either a transformation animation or an
// opacity animation but there are some exceptions where an entire InkDropState
// animation consists of only 1 sub animation and it defines the duration for
// both the transformation and opacity animations.
enum InkDropSubAnimations {
// HIDDEN sub animations.
// The HIDDEN sub animation that is fading out to a hidden opacity.
HIDDEN_FADE_OUT,
// The HIDDEN sub animation that transform the circle to a small one.
HIDDEN_TRANSFORM,
// ACTION_PENDING sub animations.
// The ACTION_PENDING sub animation that fades in to the visible opacity.
ACTION_PENDING_FADE_IN,
// The ACTION_PENDING sub animation that transforms the circle to fill the
// bounds.
ACTION_PENDING_TRANSFORM,
// ACTION_TRIGGERED sub animations.
// The ACTION_TRIGGERED sub animation that is fading out to a hidden opacity.
ACTION_TRIGGERED_FADE_OUT,
// ALTERNATE_ACTION_PENDING sub animations.
// The ALTERNATE_ACTION_PENDING animation has only one sub animation which
// animates
// the circleto fill the bounds at visible opacity.
ALTERNATE_ACTION_PENDING,
// ALTERNATE_ACTION_TRIGGERED sub animations.
// The ALTERNATE_ACTION_TRIGGERED sub animation that is fading out to a hidden
// opacity.
ALTERNATE_ACTION_TRIGGERED_FADE_OUT,
// ACTIVATED sub animations.
// The ACTIVATED sub animation that is fading in to the visible opacity.
ACTIVATED_FADE_IN,
// The ACTIVATED sub animation that transforms the circle to fill the entire
// bounds.
ACTIVATED_TRANSFORM,
// DEACTIVATED sub animations.
// The DEACTIVATED sub animation that is fading out to a hidden opacity.
DEACTIVATED_FADE_OUT,
};
// Duration constants for InkDropStateSubAnimations. See the
// InkDropStateSubAnimations enum documentation for more info.
int kAnimationDurationInMs[] = {
200, // HIDDEN_FADE_OUT
300, // HIDDEN_TRANSFORM
0, // ACTION_PENDING_FADE_IN
240, // ACTION_PENDING_TRANSFORM
300, // ACTION_TRIGGERED_FADE_OUT
200, // ALTERNATE_ACTION_PENDING
300, // ALTERNATE_ACTION_TRIGGERED_FADE_OUT
150, // ACTIVATED_FADE_IN
200, // ACTIVATED_TRANSFORM
300, // DEACTIVATED_FADE_OUT
};
gfx::Rect CalculateClipBounds(const gfx::Size& host_size,
const gfx::Insets& clip_insets) {
gfx::Rect clip_bounds(host_size);
clip_bounds.Inset(clip_insets);
return clip_bounds;
}
float CalculateCircleLayerRadius(const gfx::Rect& clip_bounds) {
return std::max(clip_bounds.width(), clip_bounds.height()) / 2.f;
}
} // namespace
namespace views {
FloodFillInkDropRipple::FloodFillInkDropRipple(const gfx::Size& host_size,
const gfx::Insets& clip_insets,
const gfx::Point& center_point,
SkColor color,
float visible_opacity)
: clip_insets_(clip_insets),
center_point_(center_point),
visible_opacity_(visible_opacity),
use_hide_transform_duration_for_hide_fade_out_(false),
duration_factor_(1.f),
root_layer_(ui::LAYER_NOT_DRAWN),
circle_layer_delegate_(color,
CalculateCircleLayerRadius(
CalculateClipBounds(host_size, clip_insets))),
ink_drop_state_(InkDropState::HIDDEN) {
gfx::Rect clip_bounds = CalculateClipBounds(host_size, clip_insets);
root_layer_.SetName("FloodFillInkDropRipple:ROOT_LAYER");
root_layer_.SetMasksToBounds(true);
root_layer_.SetBounds(clip_bounds);
const int painted_size_length =
std::max(clip_bounds.width(), clip_bounds.height());
painted_layer_.SetBounds(gfx::Rect(painted_size_length, painted_size_length));
painted_layer_.SetFillsBoundsOpaquely(false);
painted_layer_.set_delegate(&circle_layer_delegate_);
painted_layer_.SetVisible(true);
painted_layer_.SetOpacity(1.0);
painted_layer_.SetMasksToBounds(false);
painted_layer_.SetName("FloodFillInkDropRipple:PAINTED_LAYER");
root_layer_.Add(&painted_layer_);
SetStateToHidden();
}
FloodFillInkDropRipple::FloodFillInkDropRipple(const gfx::Size& host_size,
const gfx::Point& center_point,
SkColor color,
float visible_opacity)
: FloodFillInkDropRipple(host_size,
gfx::Insets(),
center_point,
color,
visible_opacity) {}
FloodFillInkDropRipple::~FloodFillInkDropRipple() {
// Explicitly aborting all the animations ensures all callbacks are invoked
// while this instance still exists.
AbortAllAnimations();
}
void FloodFillInkDropRipple::SnapToActivated() {
InkDropRipple::SnapToActivated();
SetOpacity(visible_opacity_);
painted_layer_.SetTransform(GetMaxSizeTargetTransform());
}
ui::Layer* FloodFillInkDropRipple::GetRootLayer() {
return &root_layer_;
}
void FloodFillInkDropRipple::AnimateStateChange(
InkDropState old_ink_drop_state,
InkDropState new_ink_drop_state,
ui::LayerAnimationObserver* animation_observer) {
switch (new_ink_drop_state) {
case InkDropState::HIDDEN:
if (!IsVisible()) {
SetStateToHidden();
} else {
AnimateToOpacity(kHiddenOpacity, GetAnimationDuration(HIDDEN_FADE_OUT),
ui::LayerAnimator::IMMEDIATELY_ANIMATE_TO_NEW_TARGET,
gfx::Tween::EASE_IN_OUT, animation_observer);
const gfx::Transform transform = CalculateTransform(kMinRadius);
AnimateToTransform(transform, GetAnimationDuration(HIDDEN_TRANSFORM),
ui::LayerAnimator::IMMEDIATELY_ANIMATE_TO_NEW_TARGET,
gfx::Tween::EASE_IN_OUT, animation_observer);
}
break;
case InkDropState::ACTION_PENDING: {
DLOG_IF(WARNING, InkDropState::HIDDEN != old_ink_drop_state)
<< "Invalid InkDropState transition. old_ink_drop_state="
<< ToString(old_ink_drop_state)
<< " new_ink_drop_state=" << ToString(new_ink_drop_state);
AnimateToOpacity(visible_opacity_,
GetAnimationDuration(ACTION_PENDING_FADE_IN),
ui::LayerAnimator::IMMEDIATELY_ANIMATE_TO_NEW_TARGET,
gfx::Tween::EASE_IN, animation_observer);
PauseOpacityAnimation(GetAnimationDuration(ACTION_PENDING_TRANSFORM) -
GetAnimationDuration(ACTION_PENDING_FADE_IN),
ui::LayerAnimator::ENQUEUE_NEW_ANIMATION,
animation_observer);
AnimateToTransform(GetMaxSizeTargetTransform(),
GetAnimationDuration(ACTION_PENDING_TRANSFORM),
ui::LayerAnimator::IMMEDIATELY_ANIMATE_TO_NEW_TARGET,
gfx::Tween::FAST_OUT_SLOW_IN, animation_observer);
break;
}
case InkDropState::ACTION_TRIGGERED: {
DLOG_IF(WARNING, old_ink_drop_state != InkDropState::HIDDEN &&
old_ink_drop_state != InkDropState::ACTION_PENDING)
<< "Invalid InkDropState transition. old_ink_drop_state="
<< ToString(old_ink_drop_state)
<< " new_ink_drop_state=" << ToString(new_ink_drop_state);
if (old_ink_drop_state == InkDropState::HIDDEN) {
AnimateStateChange(old_ink_drop_state, InkDropState::ACTION_PENDING,
animation_observer);
}
AnimateToOpacity(kHiddenOpacity,
GetAnimationDuration(ACTION_TRIGGERED_FADE_OUT),
ui::LayerAnimator::ENQUEUE_NEW_ANIMATION,
gfx::Tween::EASE_IN_OUT, animation_observer);
break;
}
case InkDropState::ALTERNATE_ACTION_PENDING: {
DLOG_IF(WARNING, InkDropState::ACTION_PENDING != old_ink_drop_state)
<< "Invalid InkDropState transition. old_ink_drop_state="
<< ToString(old_ink_drop_state)
<< " new_ink_drop_state=" << ToString(new_ink_drop_state);
AnimateToOpacity(visible_opacity_,
GetAnimationDuration(ALTERNATE_ACTION_PENDING),
ui::LayerAnimator::IMMEDIATELY_ANIMATE_TO_NEW_TARGET,
gfx::Tween::EASE_IN, animation_observer);
AnimateToTransform(GetMaxSizeTargetTransform(),
GetAnimationDuration(ALTERNATE_ACTION_PENDING),
ui::LayerAnimator::IMMEDIATELY_ANIMATE_TO_NEW_TARGET,
gfx::Tween::EASE_IN_OUT, animation_observer);
break;
}
case InkDropState::ALTERNATE_ACTION_TRIGGERED:
DLOG_IF(WARNING,
InkDropState::ALTERNATE_ACTION_PENDING != old_ink_drop_state)
<< "Invalid InkDropState transition. old_ink_drop_state="
<< ToString(old_ink_drop_state)
<< " new_ink_drop_state=" << ToString(new_ink_drop_state);
AnimateToOpacity(
kHiddenOpacity,
GetAnimationDuration(ALTERNATE_ACTION_TRIGGERED_FADE_OUT),
ui::LayerAnimator::ENQUEUE_NEW_ANIMATION, gfx::Tween::EASE_IN_OUT,
animation_observer);
break;
case InkDropState::ACTIVATED: {
if (old_ink_drop_state == InkDropState::ACTION_PENDING) {
// The final state of pending animation is the same as the final state
// of activated animation. We only need to enqueue a zero-length pause
// so that animation observers are notified in order.
PauseOpacityAnimation(
base::TimeDelta(),
ui::LayerAnimator::PreemptionStrategy::ENQUEUE_NEW_ANIMATION,
animation_observer);
PauseTransformAnimation(
base::TimeDelta(),
ui::LayerAnimator::PreemptionStrategy::ENQUEUE_NEW_ANIMATION,
animation_observer);
} else {
AnimateToOpacity(visible_opacity_,
GetAnimationDuration(ACTIVATED_FADE_IN),
ui::LayerAnimator::IMMEDIATELY_ANIMATE_TO_NEW_TARGET,
gfx::Tween::EASE_IN, animation_observer);
AnimateToTransform(GetMaxSizeTargetTransform(),
GetAnimationDuration(ACTIVATED_TRANSFORM),
ui::LayerAnimator::IMMEDIATELY_ANIMATE_TO_NEW_TARGET,
gfx::Tween::EASE_IN_OUT, animation_observer);
}
break;
}
case InkDropState::DEACTIVATED:
AnimateToOpacity(kHiddenOpacity,
GetAnimationDuration(DEACTIVATED_FADE_OUT),
ui::LayerAnimator::ENQUEUE_NEW_ANIMATION,
gfx::Tween::EASE_IN_OUT, animation_observer);
break;
}
}
void FloodFillInkDropRipple::SetStateToHidden() {
painted_layer_.SetTransform(CalculateTransform(kMinRadius));
root_layer_.SetOpacity(kHiddenOpacity);
root_layer_.SetVisible(false);
}
void FloodFillInkDropRipple::AbortAllAnimations() {
root_layer_.GetAnimator()->AbortAllAnimations();
painted_layer_.GetAnimator()->AbortAllAnimations();
}
void FloodFillInkDropRipple::AnimateToTransform(
const gfx::Transform& transform,
base::TimeDelta duration,
ui::LayerAnimator::PreemptionStrategy preemption_strategy,
gfx::Tween::Type tween,
ui::LayerAnimationObserver* animation_observer) {
ui::LayerAnimator* animator = painted_layer_.GetAnimator();
ui::ScopedLayerAnimationSettings animation(animator);
animation.SetPreemptionStrategy(preemption_strategy);
animation.SetTweenType(tween);
std::unique_ptr<ui::LayerAnimationElement> element =
ui::LayerAnimationElement::CreateTransformElement(transform, duration);
ui::LayerAnimationSequence* sequence =
new ui::LayerAnimationSequence(std::move(element));
if (animation_observer)
sequence->AddObserver(animation_observer);
animator->StartAnimation(sequence);
}
void FloodFillInkDropRipple::PauseTransformAnimation(
base::TimeDelta duration,
ui::LayerAnimator::PreemptionStrategy preemption_strategy,
ui::LayerAnimationObserver* observer) {
ui::LayerAnimator* animator = painted_layer_.GetAnimator();
ui::ScopedLayerAnimationSettings animation(animator);
animation.SetPreemptionStrategy(preemption_strategy);
std::unique_ptr<ui::LayerAnimationElement> element =
ui::LayerAnimationElement::CreatePauseElement(
ui::LayerAnimationElement::TRANSFORM, duration);
ui::LayerAnimationSequence* sequence =
new ui::LayerAnimationSequence(std::move(element));
if (observer)
sequence->AddObserver(observer);
animator->StartAnimation(sequence);
}
void FloodFillInkDropRipple::SetOpacity(float opacity) {
root_layer_.SetOpacity(opacity);
}
void FloodFillInkDropRipple::AnimateToOpacity(
float opacity,
base::TimeDelta duration,
ui::LayerAnimator::PreemptionStrategy preemption_strategy,
gfx::Tween::Type tween,
ui::LayerAnimationObserver* animation_observer) {
ui::LayerAnimator* animator = root_layer_.GetAnimator();
ui::ScopedLayerAnimationSettings animation_settings(animator);
animation_settings.SetPreemptionStrategy(preemption_strategy);
animation_settings.SetTweenType(tween);
std::unique_ptr<ui::LayerAnimationElement> animation_element =
ui::LayerAnimationElement::CreateOpacityElement(opacity, duration);
ui::LayerAnimationSequence* animation_sequence =
new ui::LayerAnimationSequence(std::move(animation_element));
if (animation_observer)
animation_sequence->AddObserver(animation_observer);
animator->StartAnimation(animation_sequence);
}
void FloodFillInkDropRipple::PauseOpacityAnimation(
base::TimeDelta duration,
ui::LayerAnimator::PreemptionStrategy preemption_strategy,
ui::LayerAnimationObserver* observer) {
ui::LayerAnimator* animator = root_layer_.GetAnimator();
ui::ScopedLayerAnimationSettings animation(animator);
animation.SetPreemptionStrategy(preemption_strategy);
std::unique_ptr<ui::LayerAnimationElement> element =
ui::LayerAnimationElement::CreatePauseElement(
ui::LayerAnimationElement::OPACITY, duration);
ui::LayerAnimationSequence* sequence =
new ui::LayerAnimationSequence(std::move(element));
if (observer)
sequence->AddObserver(observer);
animator->StartAnimation(sequence);
}
gfx::Transform FloodFillInkDropRipple::CalculateTransform(
float target_radius) const {
const float target_scale = target_radius / circle_layer_delegate_.radius();
gfx::Transform transform = gfx::Transform();
transform.Translate(center_point_.x() - root_layer_.bounds().x(),
center_point_.y() - root_layer_.bounds().y());
transform.Scale(target_scale, target_scale);
const gfx::Vector2dF drawn_center_offset =
circle_layer_delegate_.GetCenteringOffset();
transform.Translate(-drawn_center_offset.x(), -drawn_center_offset.y());
// Add subpixel correction to the transform.
transform.ConcatTransform(GetTransformSubpixelCorrection(
transform, painted_layer_.device_scale_factor()));
return transform;
}
gfx::Transform FloodFillInkDropRipple::GetMaxSizeTargetTransform() const {
return CalculateTransform(MaxDistanceToCorners(center_point_));
}
float FloodFillInkDropRipple::MaxDistanceToCorners(
const gfx::Point& point) const {
const gfx::Rect bounds = root_layer_.bounds();
const float distance_to_top_left = (bounds.origin() - point).Length();
const float distance_to_top_right = (bounds.top_right() - point).Length();
const float distance_to_bottom_left = (bounds.bottom_left() - point).Length();
const float distance_to_bottom_right =
(bounds.bottom_right() - point).Length();
float largest_distance =
std::max(distance_to_top_left, distance_to_top_right);
largest_distance = std::max(largest_distance, distance_to_bottom_left);
largest_distance = std::max(largest_distance, distance_to_bottom_right);
return largest_distance;
}
// Returns the InkDropState sub animation duration for the given |state|.
base::TimeDelta FloodFillInkDropRipple::GetAnimationDuration(int state) {
if (!PlatformStyle::kUseRipples ||
!gfx::Animation::ShouldRenderRichAnimation()) {
return base::TimeDelta();
}
int state_override = state;
// Override the requested state if needed.
if (use_hide_transform_duration_for_hide_fade_out_ &&
state == HIDDEN_FADE_OUT) {
state_override = HIDDEN_TRANSFORM;
}
return base::TimeDelta::FromMilliseconds(
kAnimationDurationInMs[state_override] * duration_factor_);
}
} // namespace views
| {
"pile_set_name": "Github"
} |
In Layout
<%= yield %>
| {
"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.
*/
package org.apache.batik.swing.svg;
import java.awt.Component;
import javax.swing.JDialog;
import javax.swing.JOptionPane;
import org.apache.batik.util.gui.JErrorPane;
/**
* One line Class Desc
*
* Methods users may want to implement:
* displayMessage
*
* @author <a href="mailto:[email protected]">deweese</a>
* @version $Id$
*/
public class SVGUserAgentGUIAdapter extends SVGUserAgentAdapter{
public Component parentComponent;
public SVGUserAgentGUIAdapter(Component parentComponent) {
this.parentComponent = parentComponent;
}
/**
* Displays an error message.
*/
public void displayError(String message) {
JOptionPane pane = new JOptionPane(message, JOptionPane.ERROR_MESSAGE);
JDialog dialog = pane.createDialog(parentComponent, "ERROR");
dialog.setModal(false);
dialog.setVisible(true);
}
/**
* Displays an error resulting from the specified Exception.
*/
public void displayError(Exception ex) {
JErrorPane pane = new JErrorPane(ex, JOptionPane.ERROR_MESSAGE);
JDialog dialog = pane.createDialog(parentComponent, "ERROR");
dialog.setModal(false);
dialog.setVisible(true);
}
/**
* Displays a message in the User Agent interface.
* The given message is typically displayed in a status bar.
*/
public void displayMessage(String message) {
// Can't do anything don't have a status bar...
}
/**
* Shows an alert dialog box.
*/
public void showAlert(String message) {
String str = "Script alert:\n" + message;
JOptionPane.showMessageDialog(parentComponent, str);
}
/**
* Shows a prompt dialog box.
*/
public String showPrompt(String message) {
String str = "Script prompt:\n" + message;
return JOptionPane.showInputDialog(parentComponent, str);
}
/**
* Shows a prompt dialog box.
*/
public String showPrompt(String message, String defaultValue) {
String str = "Script prompt:\n" + message;
return (String)JOptionPane.showInputDialog
(parentComponent, str, null,
JOptionPane.PLAIN_MESSAGE,
null, null, defaultValue);
}
/**
* Shows a confirm dialog box.
*/
public boolean showConfirm(String message) {
String str = "Script confirm:\n" + message;
return JOptionPane.showConfirmDialog
(parentComponent, str,
"Confirm", JOptionPane.YES_NO_OPTION) == JOptionPane.YES_OPTION;
}
}
| {
"pile_set_name": "Github"
} |
/**
* This program 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.
*
* 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/>.
*
**/
/**
* @file 2DSliceImageFromVol.cpp
* @ingroup tutorial-examples
* @author Bertrand Kerautret (\c [email protected] )
* LORIA (CNRS, UMR 7503), University of Lorraine, France
*
*
* @date 2016/05/09
*
* @brief Example associated to the tutorial 5 on Image adapter
*
* This file is part of the DGtal library.
*/
#include <iostream>
#include <DGtal/base/Common.h>
#include "DGtal/io/readers/GenericReader.h"
#include "DGtal/io/writers/GenericWriter.h"
#include <DGtal/helpers/StdDefs.h>
#include <DGtal/images/ImageContainerBySTLVector.h>
#include <DGtal/images/ConstImageAdapter.h>
#include "DGtal/kernel/BasicPointFunctors.h"
using namespace std;
using namespace DGtal;
using namespace Z2i;
int main(int argc, char ** argv)
{
typedef ImageContainerBySTLVector<Z2i::Domain, unsigned char> Image2D;
typedef ImageContainerBySTLVector<Z3i::Domain, unsigned char> Image3D;
if(argc < 3)
{
trace.error() << "You need to indicate the volumetric image name and slice number as parameters." << std::endl;
trace.error() << std::endl;
return 1;
}
std::string filename(argv[1]);
std::string outputFileName = "sliceImage.pgm";
unsigned int numSlice = atoi(argv[2]);
trace.beginBlock("Loading file");
Image3D image3d = GenericReader< Image3D >::import ( filename );
functors::Identity id;
typedef ConstImageAdapter<Image3D, Image2D::Domain, functors::Projector<Z3i::Space>,
Image3D::Value, functors::Identity > SliceImageAdapter;
functors::Projector<Z2i::Space > proj(2);
Z2i::Domain domain2D(proj(image3d.domain().lowerBound()),
proj(image3d.domain().upperBound()));
DGtal::functors::Projector<Z3i::Space> aSliceFunctor(numSlice);
aSliceFunctor.initAddOneDim(2);
SliceImageAdapter sliceImageZ(image3d, domain2D, aSliceFunctor, id);
trace.endBlock();
trace.beginBlock("Exporting...");
sliceImageZ >> outputFileName;
trace.endBlock();
return 0;
}
| {
"pile_set_name": "Github"
} |
package zqd
import (
"context"
"net/http"
"strconv"
"sync/atomic"
"time"
"github.com/brimsec/zq/zqe"
"github.com/gorilla/mux"
"go.uber.org/zap"
)
const requestIDKey = "X-Request-ID"
func getRequestID(ctx context.Context) string {
if v := ctx.Value(requestIDKey); v != nil {
return v.(string)
}
return ""
}
// requestIDMiddleware adds the unique identifier of the request to the request
// context. If the header "X-Request-ID" exists this will be used, otherwise
// one will be generated.
func requestIDMiddleware() mux.MiddlewareFunc {
var count int64
return func(next http.Handler) http.Handler {
return http.HandlerFunc(func(w http.ResponseWriter, r *http.Request) {
reqID := r.Header.Get(requestIDKey)
if reqID == "" {
reqID = strconv.FormatInt(atomic.AddInt64(&count, 1), 10)
}
w.Header().Add(requestIDKey, reqID)
ctx := context.WithValue(r.Context(), requestIDKey, reqID)
next.ServeHTTP(w, r.WithContext(ctx))
})
}
}
func accessLogMiddleware(logger *zap.Logger) mux.MiddlewareFunc {
logger = logger.Named("http.access")
return func(next http.Handler) http.Handler {
return http.HandlerFunc(func(w http.ResponseWriter, r *http.Request) {
logger := logger.With(zap.String("request_id", getRequestID(r.Context())))
detailedLogger := logger.With(
zap.String("host", r.Host),
zap.String("method", r.Method),
zap.String("proto", r.Proto),
zap.String("remote_addr", r.RemoteAddr),
zap.Int64("request_content_length", r.ContentLength),
zap.Stringer("url", r.URL),
)
recorder := newRecordingResponseWriter(w)
w = recorder
detailedLogger.Debug("Request started")
defer func(start time.Time) {
detailedLogger.Info("Request completed",
zap.Duration("elapsed", time.Since(start)),
zap.Int("response_content_length", recorder.contentLength),
zap.Int("status_code", recorder.statusCode),
)
}(time.Now())
next.ServeHTTP(w, r)
})
}
}
func panicCatchMiddleware(logger *zap.Logger) mux.MiddlewareFunc {
return func(next http.Handler) http.Handler {
return http.HandlerFunc(func(w http.ResponseWriter, r *http.Request) {
defer func() {
rec := recover()
if rec == nil {
return
}
logger.DPanic("Panic",
zap.Error(zqe.RecoverError(rec)),
zap.String("request_id", getRequestID(r.Context())),
zap.Stack("stack"),
)
}()
next.ServeHTTP(w, r)
})
}
}
// recordingResponseWriter wraps an http.ResponseWriter to record the content
// length and status code of the response.
type recordingResponseWriter struct {
http.ResponseWriter
contentLength int
statusCode int
}
func newRecordingResponseWriter(w http.ResponseWriter) *recordingResponseWriter {
return &recordingResponseWriter{
ResponseWriter: w,
statusCode: 200, // Default status code is 200.
}
}
func (r *recordingResponseWriter) Flush() {
if flusher, ok := r.ResponseWriter.(http.Flusher); ok {
flusher.Flush()
}
}
func (r *recordingResponseWriter) Write(data []byte) (int, error) {
r.contentLength += len(data)
return r.ResponseWriter.Write(data)
}
func (r *recordingResponseWriter) WriteHeader(statusCode int) {
r.statusCode = statusCode
r.ResponseWriter.WriteHeader(statusCode)
}
| {
"pile_set_name": "Github"
} |
package com.example.ggxiaozhi.store.the_basket.adapter.section;
import android.content.Context;
import android.view.View;
import android.widget.RatingBar;
import com.example.ggxiaozhi.store.the_basket.R;
import com.example.ggxiaozhi.store.the_basket.bean.AppCommentBean;
import com.zhxu.recyclerview.base.ViewHolder;
import com.zhxu.recyclerview.section.StatelessSection;
import java.util.List;
/**
* 工程名 ： BaiLan
* 包名 ： com.example.ggxiaozhi.store.the_basket.adapter.section
* 作者名 ： 志先生_
* 日期 ： 2017/9/28
* 功能 ：
*/
public class AppCommentSectionAdapter extends StatelessSection {
private List<AppCommentBean.CommentsBean> commentsBeanList;
private String title;
private Context mContext;
public AppCommentSectionAdapter(Context context, String title, List<AppCommentBean.CommentsBean> commentsBeanList) {
super(R.layout.appdetail_comment_list_title, R.layout.appdetail_comment_list_item);
this.commentsBeanList = commentsBeanList;
this.mContext = context;
this.title = title;
}
@Override
public int getContentItemsTotal() {
return commentsBeanList.size();
}
@Override
public ViewHolder getItemViewHolder(View view, int viewType) {
return new ItemViewHolder(view);
}
@Override
public void onBindItemViewHolder(ViewHolder holder, int position) {
AppCommentBean.CommentsBean commentsBean = commentsBeanList.get(position);
holder.setText(R.id.detail_comment_user_textview, commentsBean.getAccountName());
holder.setText(R.id.detail_comment_time_textview, commentsBean.getOperTime());
holder.setText(R.id.detail_comment_user_client_textview, commentsBean.getPhone());
holder.setText(R.id.detail_comment_content_textview, commentsBean.getCommentInfo());
((ItemViewHolder) holder).detail_comment_stars_ratingbar.setRating(Float.parseFloat(commentsBean.getStars()));
holder.setText(R.id.detail_comment_version_textview, commentsBean.getVersionName());
holder.setImageUrl(R.id.detail_comment_user_icon_imageview, commentsBean.getPhotoUrl());
holder.setText(R.id.detail_comment_approve_counts_textview, commentsBean.getApproveCounts());
holder.setText(R.id.detail_comment_reply_button_textview, commentsBean.getReplyCounts());
}
@Override
public ViewHolder getHeaderViewHolder(Context context, View view) {
return new ViewHolder(context, view);
}
@Override
public void onBindHeaderViewHolder(ViewHolder holder) {
super.onBindHeaderViewHolder(holder);
holder.setText(R.id.titleText, title);
}
class ItemViewHolder extends ViewHolder {
RatingBar detail_comment_stars_ratingbar;
public ItemViewHolder(View view) {
super(mContext, view);
detail_comment_stars_ratingbar = (RatingBar) view.findViewById(R.id.detail_comment_stars_ratingbar);
}
}
}
| {
"pile_set_name": "Github"
} |
/*
* Copyright (c) 2016 Thomas Pornin <[email protected]>
*
* 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.
*/
#include "inner.h"
/* see inner.h */
void
br_range_dec64le(uint64_t *v, size_t num, const void *src)
{
const unsigned char *buf;
buf = src;
while (num -- > 0) {
*v ++ = br_dec64le(buf);
buf += 8;
}
}
| {
"pile_set_name": "Github"
} |
//=- WebAssemblyMCCodeEmitter.cpp - Convert WebAssembly code to machine code -//
//
// 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
//
//===----------------------------------------------------------------------===//
///
/// \file
/// This file implements the WebAssemblyMCCodeEmitter class.
///
//===----------------------------------------------------------------------===//
#include "MCTargetDesc/WebAssemblyFixupKinds.h"
#include "MCTargetDesc/WebAssemblyMCTargetDesc.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/ADT/Statistic.h"
#include "llvm/MC/MCCodeEmitter.h"
#include "llvm/MC/MCFixup.h"
#include "llvm/MC/MCInst.h"
#include "llvm/MC/MCInstrInfo.h"
#include "llvm/MC/MCRegisterInfo.h"
#include "llvm/MC/MCSubtargetInfo.h"
#include "llvm/MC/MCSymbol.h"
#include "llvm/Support/Debug.h"
#include "llvm/Support/EndianStream.h"
#include "llvm/Support/LEB128.h"
#include "llvm/Support/raw_ostream.h"
using namespace llvm;
#define DEBUG_TYPE "mccodeemitter"
STATISTIC(MCNumEmitted, "Number of MC instructions emitted.");
STATISTIC(MCNumFixups, "Number of MC fixups created.");
namespace {
class WebAssemblyMCCodeEmitter final : public MCCodeEmitter {
const MCInstrInfo &MCII;
// Implementation generated by tablegen.
uint64_t getBinaryCodeForInstr(const MCInst &MI,
SmallVectorImpl<MCFixup> &Fixups,
const MCSubtargetInfo &STI) const;
void encodeInstruction(const MCInst &MI, raw_ostream &OS,
SmallVectorImpl<MCFixup> &Fixups,
const MCSubtargetInfo &STI) const override;
public:
WebAssemblyMCCodeEmitter(const MCInstrInfo &MCII) : MCII(MCII) {}
};
} // end anonymous namespace
MCCodeEmitter *llvm::createWebAssemblyMCCodeEmitter(const MCInstrInfo &MCII) {
return new WebAssemblyMCCodeEmitter(MCII);
}
void WebAssemblyMCCodeEmitter::encodeInstruction(
const MCInst &MI, raw_ostream &OS, SmallVectorImpl<MCFixup> &Fixups,
const MCSubtargetInfo &STI) const {
uint64_t Start = OS.tell();
uint64_t Binary = getBinaryCodeForInstr(MI, Fixups, STI);
if (Binary <= UINT8_MAX) {
OS << uint8_t(Binary);
} else {
assert(Binary <= UINT16_MAX && "Several-byte opcodes not supported yet");
OS << uint8_t(Binary >> 8);
encodeULEB128(uint8_t(Binary), OS);
}
// For br_table instructions, encode the size of the table. In the MCInst,
// there's an index operand (if not a stack instruction), one operand for
// each table entry, and the default operand.
if (MI.getOpcode() == WebAssembly::BR_TABLE_I32_S ||
MI.getOpcode() == WebAssembly::BR_TABLE_I64_S)
encodeULEB128(MI.getNumOperands() - 1, OS);
if (MI.getOpcode() == WebAssembly::BR_TABLE_I32 ||
MI.getOpcode() == WebAssembly::BR_TABLE_I64)
encodeULEB128(MI.getNumOperands() - 2, OS);
const MCInstrDesc &Desc = MCII.get(MI.getOpcode());
for (unsigned I = 0, E = MI.getNumOperands(); I < E; ++I) {
const MCOperand &MO = MI.getOperand(I);
if (MO.isReg()) {
/* nothing to encode */
} else if (MO.isImm()) {
if (I < Desc.getNumOperands()) {
const MCOperandInfo &Info = Desc.OpInfo[I];
LLVM_DEBUG(dbgs() << "Encoding immediate: type="
<< int(Info.OperandType) << "\n");
switch (Info.OperandType) {
case WebAssembly::OPERAND_I32IMM:
encodeSLEB128(int32_t(MO.getImm()), OS);
break;
case WebAssembly::OPERAND_OFFSET32:
encodeULEB128(uint32_t(MO.getImm()), OS);
break;
case WebAssembly::OPERAND_I64IMM:
encodeSLEB128(int64_t(MO.getImm()), OS);
break;
case WebAssembly::OPERAND_SIGNATURE:
OS << uint8_t(MO.getImm());
break;
case WebAssembly::OPERAND_VEC_I8IMM:
support::endian::write<uint8_t>(OS, MO.getImm(), support::little);
break;
case WebAssembly::OPERAND_VEC_I16IMM:
support::endian::write<uint16_t>(OS, MO.getImm(), support::little);
break;
case WebAssembly::OPERAND_VEC_I32IMM:
support::endian::write<uint32_t>(OS, MO.getImm(), support::little);
break;
case WebAssembly::OPERAND_VEC_I64IMM:
support::endian::write<uint64_t>(OS, MO.getImm(), support::little);
break;
case WebAssembly::OPERAND_GLOBAL:
llvm_unreachable("wasm globals should only be accessed symbolicly");
default:
encodeULEB128(uint64_t(MO.getImm()), OS);
}
} else {
encodeULEB128(uint64_t(MO.getImm()), OS);
}
} else if (MO.isFPImm()) {
const MCOperandInfo &Info = Desc.OpInfo[I];
if (Info.OperandType == WebAssembly::OPERAND_F32IMM) {
// TODO: MC converts all floating point immediate operands to double.
// This is fine for numeric values, but may cause NaNs to change bits.
auto F = float(MO.getFPImm());
support::endian::write<float>(OS, F, support::little);
} else {
assert(Info.OperandType == WebAssembly::OPERAND_F64IMM);
double D = MO.getFPImm();
support::endian::write<double>(OS, D, support::little);
}
} else if (MO.isExpr()) {
const MCOperandInfo &Info = Desc.OpInfo[I];
llvm::MCFixupKind FixupKind;
size_t PaddedSize = 5;
switch (Info.OperandType) {
case WebAssembly::OPERAND_I32IMM:
FixupKind = MCFixupKind(WebAssembly::fixup_sleb128_i32);
break;
case WebAssembly::OPERAND_I64IMM:
FixupKind = MCFixupKind(WebAssembly::fixup_sleb128_i64);
PaddedSize = 10;
break;
case WebAssembly::OPERAND_FUNCTION32:
case WebAssembly::OPERAND_OFFSET32:
case WebAssembly::OPERAND_SIGNATURE:
case WebAssembly::OPERAND_TYPEINDEX:
case WebAssembly::OPERAND_GLOBAL:
case WebAssembly::OPERAND_EVENT:
FixupKind = MCFixupKind(WebAssembly::fixup_uleb128_i32);
break;
default:
llvm_unreachable("unexpected symbolic operand kind");
}
Fixups.push_back(MCFixup::create(OS.tell() - Start, MO.getExpr(),
FixupKind, MI.getLoc()));
++MCNumFixups;
encodeULEB128(0, OS, PaddedSize);
} else {
llvm_unreachable("unexpected operand kind");
}
}
++MCNumEmitted; // Keep track of the # of mi's emitted.
}
#include "WebAssemblyGenMCCodeEmitter.inc"
| {
"pile_set_name": "Github"
} |
<div class="content" fxLayout="row" fxLayoutAlign="center">
<mat-card elevation="5" fxFlex>
<mat-card-subtitle>Change Your Password</mat-card-subtitle>
<p *ngIf="notification" [class]="notification.msgType">{{notification.msgBody}}</p>
<mat-card-content>
<form #changePasswordForm="ngForm" (ngSubmit)="onSubmit()" *ngIf="!submitted" [formGroup]="form">
<mat-form-field>
<input formControlName="oldPassword" matInput placeholder="old password" required type="password">
</mat-form-field>
<mat-form-field>
<input formControlName="newPassword" matInput placeholder="new password" required type="password">
</mat-form-field>
<button [disabled]="!changePasswordForm.form.valid" color="primary" mat-raised-button type="submit">Change
Password
</button>
</form>
<mat-spinner *ngIf="submitted" mode="indeterminate"></mat-spinner>
</mat-card-content>
</mat-card>
</div>
| {
"pile_set_name": "Github"
} |
/* Parametric GoodFET Case
by Travis Goodspeed
for the GoodFET41 and related models.
This is an OpenSCAD model intended for generating 3D cases for the
GoodFET family of boards. Specific revisions have been tested on
the Makerbot Replicator 2 in PLA, but any neighbor who is involved
in 3D printing knows that you'll have to experiment a little or a
lot to get anything of use.
I expect a half dozen forks of this to come about, but I ask that
you post them either on Github or in the /contrib/ region of the
GoodFET repository. Other neighbors will find your examples handy,
however ugly the code might be.
Edit this file to experiment, but the bulk of the code is in
goodfetlib.scad. Release models are defined in config.mk.
*/
//Are we rendering the top or the bottom?
//Change these to render the individual pieces.
rendertop=0;
renderbot=1;
//Uncomment these for the GoodFET41.
//l=20;
//w=49;
//h=6;
//cutribbonslit=1;
//Uncomment these for the Facedancer10
l=23.5;
w=71;
h=6;
cutsecondusb=1;
cutthirdusb=1;
//Include the library, but don't run its code.
include<goodfetlib.scad>
| {
"pile_set_name": "Github"
} |
package cache
import (
"crypto/x509"
"fmt"
"runtime"
"testing"
"time"
"github.com/sirupsen/logrus/hooks/test"
"github.com/spiffe/spire/pkg/common/bundleutil"
"github.com/spiffe/spire/pkg/common/telemetry"
"github.com/spiffe/spire/proto/spire/common"
"github.com/stretchr/testify/assert"
)
var (
bundleV1 = bundleutil.BundleFromRootCA("spiffe://domain.test", &x509.Certificate{Raw: []byte{1}})
bundleV2 = bundleutil.BundleFromRootCA("spiffe://domain.test", &x509.Certificate{Raw: []byte{2}})
bundleV3 = bundleutil.BundleFromRootCA("spiffe://domain.test", &x509.Certificate{Raw: []byte{3}})
otherBundleV1 = bundleutil.BundleFromRootCA("spiffe://otherdomain.test", &x509.Certificate{Raw: []byte{4}})
otherBundleV2 = bundleutil.BundleFromRootCA("spiffe://otherdomain.test", &x509.Certificate{Raw: []byte{5}})
defaultTTL = int32(600)
)
func TestFetchWorkloadUpdate(t *testing.T) {
cache := newTestCache()
// populate the cache with FOO and BAR without SVIDS
foo := makeRegistrationEntry("FOO", "A")
bar := makeRegistrationEntry("BAR", "B")
bar.FederatesWith = makeFederatesWith(otherBundleV1)
updateEntries := &UpdateEntries{
Bundles: makeBundles(bundleV1, otherBundleV1),
RegistrationEntries: makeRegistrationEntries(foo, bar),
}
cache.UpdateEntries(updateEntries, nil)
workloadUpdate := cache.FetchWorkloadUpdate(makeSelectors("A", "B"))
assert.Len(t, workloadUpdate.Identities, 0, "identities should not be returned that don't have SVIDs")
updateSVIDs := &UpdateSVIDs{
X509SVIDs: makeX509SVIDs(foo, bar),
}
cache.UpdateSVIDs(updateSVIDs)
workloadUpdate = cache.FetchWorkloadUpdate(makeSelectors("A", "B"))
assert.Equal(t, &WorkloadUpdate{
Bundle: bundleV1,
FederatedBundles: makeBundles(otherBundleV1),
Identities: []Identity{
{Entry: bar},
{Entry: foo},
},
}, workloadUpdate)
}
func TestMatchingIdentities(t *testing.T) {
cache := newTestCache()
// populate the cache with FOO and BAR without SVIDS
foo := makeRegistrationEntry("FOO", "A")
bar := makeRegistrationEntry("BAR", "B")
updateEntries := &UpdateEntries{
Bundles: makeBundles(bundleV1),
RegistrationEntries: makeRegistrationEntries(foo, bar),
}
cache.UpdateEntries(updateEntries, nil)
identities := cache.MatchingIdentities(makeSelectors("A", "B"))
assert.Len(t, identities, 0, "identities should not be returned that don't have SVIDs")
updateSVIDs := &UpdateSVIDs{
X509SVIDs: makeX509SVIDs(foo, bar),
}
cache.UpdateSVIDs(updateSVIDs)
identities = cache.MatchingIdentities(makeSelectors("A", "B"))
assert.Equal(t, []Identity{
{Entry: bar},
{Entry: foo},
}, identities)
}
func TestBundleChanges(t *testing.T) {
cache := newTestCache()
bundleStream := cache.SubscribeToBundleChanges()
assert.Equal(t, makeBundles(bundleV1), bundleStream.Value())
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV1, otherBundleV1),
}, nil)
if assert.True(t, bundleStream.HasNext(), "has new bundle value after adding bundle") {
bundleStream.Next()
assert.Equal(t, makeBundles(bundleV1, otherBundleV1), bundleStream.Value())
}
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV1),
}, nil)
if assert.True(t, bundleStream.HasNext(), "has new bundle value after removing bundle") {
bundleStream.Next()
assert.Equal(t, makeBundles(bundleV1), bundleStream.Value())
}
}
func TestAllSubscribersNotifiedOnBundleChange(t *testing.T) {
cache := newTestCache()
// create some subscribers and assert they get the initial bundle
subA := cache.SubscribeToWorkloadUpdates(makeSelectors("A"))
defer subA.Finish()
assertWorkloadUpdateEqual(t, subA, &WorkloadUpdate{Bundle: bundleV1})
subB := cache.SubscribeToWorkloadUpdates(makeSelectors("B"))
defer subB.Finish()
assertWorkloadUpdateEqual(t, subB, &WorkloadUpdate{Bundle: bundleV1})
// update the bundle and assert all subscribers gets the updated bundle
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV2),
}, nil)
assertWorkloadUpdateEqual(t, subA, &WorkloadUpdate{Bundle: bundleV2})
assertWorkloadUpdateEqual(t, subB, &WorkloadUpdate{Bundle: bundleV2})
}
func TestSomeSubscribersNotifiedOnFederatedBundleChange(t *testing.T) {
cache := newTestCache()
// initialize the cache with an entry FOO that has a valid SVID and
// selector "A"
foo := makeRegistrationEntry("FOO", "A")
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV1),
RegistrationEntries: makeRegistrationEntries(foo),
}, nil)
cache.UpdateSVIDs(&UpdateSVIDs{
X509SVIDs: makeX509SVIDs(foo),
})
// subscribe to A and B and assert initial updates are received.
subA := cache.SubscribeToWorkloadUpdates(makeSelectors("A"))
defer subA.Finish()
assertAnyWorkloadUpdate(t, subA)
subB := cache.SubscribeToWorkloadUpdates(makeSelectors("B"))
defer subB.Finish()
assertAnyWorkloadUpdate(t, subB)
// add the federated bundle with no registration entries federating with
// it and make sure nobody is notified.
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV1, otherBundleV1),
RegistrationEntries: makeRegistrationEntries(foo),
}, nil)
assertNoWorkloadUpdate(t, subA)
assertNoWorkloadUpdate(t, subB)
// update FOO to federate with otherdomain.test and make sure subA is
// notified but not subB.
foo = makeRegistrationEntry("FOO", "A")
foo.FederatesWith = makeFederatesWith(otherBundleV1)
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV1, otherBundleV1),
RegistrationEntries: makeRegistrationEntries(foo),
}, nil)
assertWorkloadUpdateEqual(t, subA, &WorkloadUpdate{
Bundle: bundleV1,
FederatedBundles: makeBundles(otherBundleV1),
Identities: []Identity{{Entry: foo}},
})
assertNoWorkloadUpdate(t, subB)
// now change the federated bundle and make sure subA gets notified, but
// again, not subB.
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV1, otherBundleV2),
RegistrationEntries: makeRegistrationEntries(foo),
}, nil)
assertWorkloadUpdateEqual(t, subA, &WorkloadUpdate{
Bundle: bundleV1,
FederatedBundles: makeBundles(otherBundleV2),
Identities: []Identity{{Entry: foo}},
})
assertNoWorkloadUpdate(t, subB)
// now drop the federation and make sure subA is again notified and no
// longer has the federated bundle.
foo = makeRegistrationEntry("FOO", "A")
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV1, otherBundleV2),
RegistrationEntries: makeRegistrationEntries(foo),
}, nil)
assertWorkloadUpdateEqual(t, subA, &WorkloadUpdate{
Bundle: bundleV1,
Identities: []Identity{{Entry: foo}},
})
assertNoWorkloadUpdate(t, subB)
}
func TestSubscribersGetEntriesWithSelectorSubsets(t *testing.T) {
cache := newTestCache()
// create subscribers for each combination of selectors
subA := cache.SubscribeToWorkloadUpdates(makeSelectors("A"))
defer subA.Finish()
subB := cache.SubscribeToWorkloadUpdates(makeSelectors("B"))
defer subB.Finish()
subAB := cache.SubscribeToWorkloadUpdates(makeSelectors("A", "B"))
defer subAB.Finish()
// assert all subscribers get the initial update
initialUpdate := &WorkloadUpdate{Bundle: bundleV1}
assertWorkloadUpdateEqual(t, subA, initialUpdate)
assertWorkloadUpdateEqual(t, subB, initialUpdate)
assertWorkloadUpdateEqual(t, subAB, initialUpdate)
// create entry FOO that will target any subscriber with containing (A)
foo := makeRegistrationEntry("FOO", "A")
// create entry BAR that will target any subscriber with containing (A,C)
bar := makeRegistrationEntry("BAR", "A", "C")
// update the cache with foo and bar
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV1),
RegistrationEntries: makeRegistrationEntries(foo, bar),
}, nil)
cache.UpdateSVIDs(&UpdateSVIDs{
X509SVIDs: makeX509SVIDs(foo, bar),
})
// subA selector set contains (A), but not (A, C), so it should only get FOO
assertWorkloadUpdateEqual(t, subA, &WorkloadUpdate{
Bundle: bundleV1,
Identities: []Identity{{Entry: foo}},
})
// subB selector set does not contain either (A) or (A,C) so it isn't even
// notified.
assertNoWorkloadUpdate(t, subB)
// subAB selector set contains (A) but not (A, C), so it should get FOO
assertWorkloadUpdateEqual(t, subAB, &WorkloadUpdate{
Bundle: bundleV1,
Identities: []Identity{{Entry: foo}},
})
}
func TestSubscriberIsNotNotifiedIfNothingChanges(t *testing.T) {
cache := newTestCache()
foo := makeRegistrationEntry("FOO", "A")
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV1),
RegistrationEntries: makeRegistrationEntries(foo),
}, nil)
cache.UpdateSVIDs(&UpdateSVIDs{
X509SVIDs: makeX509SVIDs(foo),
})
sub := cache.SubscribeToWorkloadUpdates(makeSelectors("A"))
defer sub.Finish()
assertAnyWorkloadUpdate(t, sub)
// Second update is the same (other than X509SVIDs, which, when set,
// always constitute a "change" for the impacted registration entries.
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV1),
RegistrationEntries: makeRegistrationEntries(foo),
}, nil)
assertNoWorkloadUpdate(t, sub)
}
func TestSubscriberNotifiedOnSVIDChanges(t *testing.T) {
cache := newTestCache()
foo := makeRegistrationEntry("FOO", "A")
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV1),
RegistrationEntries: makeRegistrationEntries(foo),
}, nil)
cache.UpdateSVIDs(&UpdateSVIDs{
X509SVIDs: makeX509SVIDs(foo),
})
sub := cache.SubscribeToWorkloadUpdates(makeSelectors("A"))
defer sub.Finish()
assertAnyWorkloadUpdate(t, sub)
// Update SVID
cache.UpdateSVIDs(&UpdateSVIDs{
X509SVIDs: makeX509SVIDs(foo),
})
assertWorkloadUpdateEqual(t, sub, &WorkloadUpdate{
Bundle: bundleV1,
Identities: []Identity{{Entry: foo}},
})
}
func TestSubcriberNotificationsOnSelectorChanges(t *testing.T) {
cache := newTestCache()
// initialize the cache with a FOO entry with selector A and an SVID
foo := makeRegistrationEntry("FOO", "A")
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV1),
RegistrationEntries: makeRegistrationEntries(foo),
}, nil)
cache.UpdateSVIDs(&UpdateSVIDs{
X509SVIDs: makeX509SVIDs(foo),
})
// create subscribers for A and make sure the initial update has FOO
sub := cache.SubscribeToWorkloadUpdates(makeSelectors("A"))
defer sub.Finish()
assertWorkloadUpdateEqual(t, sub, &WorkloadUpdate{
Bundle: bundleV1,
Identities: []Identity{{Entry: foo}},
})
// update FOO to have selectors (A,B) and make sure the subscriber loses
// FOO, since (A,B) is not a subset of the subscriber set (A).
foo = makeRegistrationEntry("FOO", "A", "B")
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV1),
RegistrationEntries: makeRegistrationEntries(foo),
}, nil)
cache.UpdateSVIDs(&UpdateSVIDs{
X509SVIDs: makeX509SVIDs(foo),
})
assertWorkloadUpdateEqual(t, sub, &WorkloadUpdate{
Bundle: bundleV1,
})
// update FOO to drop B and make sure the subscriber regains FOO
foo = makeRegistrationEntry("FOO", "A")
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV1),
RegistrationEntries: makeRegistrationEntries(foo),
}, nil)
cache.UpdateSVIDs(&UpdateSVIDs{
X509SVIDs: makeX509SVIDs(foo),
})
assertWorkloadUpdateEqual(t, sub, &WorkloadUpdate{
Bundle: bundleV1,
Identities: []Identity{{Entry: foo}},
})
}
func newTestCache() *Cache {
log, _ := test.NewNullLogger()
return New(log, "spiffe://domain.test", bundleV1, telemetry.Blackhole{})
}
func TestSubcriberNotifiedWhenEntryDropped(t *testing.T) {
cache := newTestCache()
subA := cache.SubscribeToWorkloadUpdates(makeSelectors("A"))
defer subA.Finish()
assertAnyWorkloadUpdate(t, subA)
// subB's job here is to just make sure we don't notify unrelated
// subscribers when dropping registration entries
subB := cache.SubscribeToWorkloadUpdates(makeSelectors("B"))
defer subB.Finish()
assertAnyWorkloadUpdate(t, subB)
foo := makeRegistrationEntry("FOO", "A")
updateEntries := &UpdateEntries{
Bundles: makeBundles(bundleV1),
RegistrationEntries: makeRegistrationEntries(foo),
}
cache.UpdateEntries(updateEntries, nil)
cache.UpdateSVIDs(&UpdateSVIDs{
X509SVIDs: makeX509SVIDs(foo),
})
// make sure subA gets notified with FOO but not subB
assertWorkloadUpdateEqual(t, subA, &WorkloadUpdate{
Bundle: bundleV1,
Identities: []Identity{{Entry: foo}},
})
assertNoWorkloadUpdate(t, subB)
updateEntries.RegistrationEntries = nil
cache.UpdateEntries(updateEntries, nil)
assertWorkloadUpdateEqual(t, subA, &WorkloadUpdate{
Bundle: bundleV1,
})
assertNoWorkloadUpdate(t, subB)
// Make sure trying to update SVIDs of removed entry does not notify
cache.UpdateSVIDs(&UpdateSVIDs{
X509SVIDs: makeX509SVIDs(foo),
})
assertNoWorkloadUpdate(t, subB)
}
func TestSubcriberOnlyGetsEntriesWithSVID(t *testing.T) {
cache := newTestCache()
foo := makeRegistrationEntry("FOO", "A")
updateEntries := &UpdateEntries{
Bundles: makeBundles(bundleV1),
RegistrationEntries: makeRegistrationEntries(foo),
}
cache.UpdateEntries(updateEntries, nil)
sub := cache.SubscribeToWorkloadUpdates(makeSelectors("A"))
defer sub.Finish()
// workload update does not include the identity because it has no SVID.
assertWorkloadUpdateEqual(t, sub, &WorkloadUpdate{
Bundle: bundleV1,
})
// update to include the SVID and now we should get the update
cache.UpdateSVIDs(&UpdateSVIDs{
X509SVIDs: makeX509SVIDs(foo),
})
assertWorkloadUpdateEqual(t, sub, &WorkloadUpdate{
Bundle: bundleV1,
Identities: []Identity{{Entry: foo}},
})
}
func TestSubscribersDoNotBlockNotifications(t *testing.T) {
cache := newTestCache()
sub := cache.SubscribeToWorkloadUpdates(makeSelectors("A"))
defer sub.Finish()
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV2),
}, nil)
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV3),
}, nil)
assertWorkloadUpdateEqual(t, sub, &WorkloadUpdate{
Bundle: bundleV3,
})
}
func TestCheckSVIDCallback(t *testing.T) {
cache := newTestCache()
// no calls because there are no registration entries
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV2),
}, func(existingEntry, newEntry *common.RegistrationEntry, svid *X509SVID) bool {
assert.Fail(t, "should not be called if there are no registration entries")
return false
})
foo := makeRegistrationEntryWithTTL("FOO", 60)
// called once for FOO with no SVID
callCount := 0
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV2),
RegistrationEntries: makeRegistrationEntries(foo),
}, func(existingEntry, newEntry *common.RegistrationEntry, svid *X509SVID) bool {
callCount++
assert.Equal(t, "FOO", newEntry.EntryId)
// there is no already existing entry, only the new entry
assert.Nil(t, existingEntry)
assert.Equal(t, foo, newEntry)
assert.Nil(t, svid)
return false
})
assert.Equal(t, 1, callCount)
assert.Empty(t, cache.staleEntries)
// called once for FOO with new SVID
callCount = 0
svids := makeX509SVIDs(foo)
cache.UpdateSVIDs(&UpdateSVIDs{
X509SVIDs: svids,
})
// called once for FOO with existing SVID
callCount = 0
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV2),
RegistrationEntries: makeRegistrationEntries(foo),
}, func(existingEntry, newEntry *common.RegistrationEntry, svid *X509SVID) bool {
callCount++
assert.Equal(t, "FOO", newEntry.EntryId)
if assert.NotNil(t, svid) {
assert.Exactly(t, svids["FOO"], svid)
}
return true
})
assert.Equal(t, 1, callCount)
assert.Equal(t, map[string]bool{foo.EntryId: true}, cache.staleEntries)
}
func TestGetStaleEntries(t *testing.T) {
cache := newTestCache()
foo := makeRegistrationEntryWithTTL("FOO", 60)
// Create entry but don't mark it stale
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV2),
RegistrationEntries: makeRegistrationEntries(foo),
}, func(existingEntry, newEntry *common.RegistrationEntry, svid *X509SVID) bool {
return false
})
assert.Empty(t, cache.GetStaleEntries())
// Update entry and mark it as stale
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV2),
RegistrationEntries: makeRegistrationEntries(foo),
}, func(existingEntry, newEntry *common.RegistrationEntry, svid *X509SVID) bool {
return true
})
// Assert that the entry is returned as stale. The `ExpiresAt` field should be unset since there is no SVID.
expectedEntries := []*StaleEntry{{Entry: cache.records[foo.EntryId].entry}}
assert.Equal(t, expectedEntries, cache.GetStaleEntries())
// Update the SVID for the stale entry
svids := make(map[string]*X509SVID)
expiredAt := time.Now()
svids[foo.EntryId] = &X509SVID{
Chain: []*x509.Certificate{{NotAfter: expiredAt}},
}
cache.UpdateSVIDs(&UpdateSVIDs{
X509SVIDs: svids,
})
// Assert that updating the SVID removes stale marker from entry
assert.Empty(t, cache.GetStaleEntries())
// Update entry again and mark it as stale
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV2),
RegistrationEntries: makeRegistrationEntries(foo),
}, func(existingEntry, newEntry *common.RegistrationEntry, svid *X509SVID) bool {
return true
})
// Assert that the entry again returns as stale. This time the `ExpiresAt` field should be populated with the expiration of the SVID.
expectedEntries = []*StaleEntry{{
Entry: cache.records[foo.EntryId].entry,
ExpiresAt: expiredAt,
}}
assert.Equal(t, expectedEntries, cache.GetStaleEntries())
// Remove registration entry and assert that it is no longer returned as stale
cache.UpdateEntries(&UpdateEntries{
Bundles: makeBundles(bundleV2),
}, func(existingEntry, newEntry *common.RegistrationEntry, svid *X509SVID) bool {
return true
})
assert.Empty(t, cache.GetStaleEntries())
}
func BenchmarkCacheGlobalNotification(b *testing.B) {
cache := newTestCache()
const numEntries = 1000
const numWorkloads = 1000
const selectorsPerEntry = 3
const selectorsPerWorkload = 10
// build a set of 1000 registration entries with distinct selectors
bundlesV1 := makeBundles(bundleV1)
bundlesV2 := makeBundles(bundleV2)
updateEntries := &UpdateEntries{
Bundles: bundlesV1,
RegistrationEntries: make(map[string]*common.RegistrationEntry, numEntries),
}
for i := 0; i < numEntries; i++ {
entryID := fmt.Sprintf("00000000-0000-0000-0000-%012d", i)
updateEntries.RegistrationEntries[entryID] = &common.RegistrationEntry{
EntryId: entryID,
ParentId: "spiffe://domain.test/node",
SpiffeId: fmt.Sprintf("spiffe://domain.test/workload-%d", i),
Selectors: distinctSelectors(i, selectorsPerEntry),
}
}
cache.UpdateEntries(updateEntries, nil)
for i := 0; i < numWorkloads; i++ {
selectors := distinctSelectors(i, selectorsPerWorkload)
cache.SubscribeToWorkloadUpdates(selectors)
}
runtime.GC()
b.ResetTimer()
b.ReportAllocs()
for i := 0; i < b.N; i++ {
if i%2 == 0 {
updateEntries.Bundles = bundlesV2
} else {
updateEntries.Bundles = bundlesV1
}
cache.UpdateEntries(updateEntries, nil)
}
}
func distinctSelectors(id, n int) []*common.Selector {
out := make([]*common.Selector, 0, n)
for i := 0; i < n; i++ {
out = append(out, &common.Selector{
Type: "test",
Value: fmt.Sprintf("id:%d:n:%d", id, i),
})
}
return out
}
func assertNoWorkloadUpdate(t *testing.T, sub Subscriber) {
select {
case update := <-sub.Updates():
assert.FailNow(t, "unexpected workload update", update)
default:
}
}
func assertAnyWorkloadUpdate(t *testing.T, sub Subscriber) {
select {
case <-sub.Updates():
case <-time.After(time.Minute):
assert.FailNow(t, "timed out waiting for any workload update")
}
}
func assertWorkloadUpdateEqual(t *testing.T, sub Subscriber, expected *WorkloadUpdate) {
select {
case actual := <-sub.Updates():
assert.NotNil(t, actual.Bundle, "bundle is not set")
assert.True(t, actual.Bundle.EqualTo(expected.Bundle), "bundles don't match")
assert.Equal(t, expected.Identities, actual.Identities, "identities don't match")
case <-time.After(time.Minute):
assert.FailNow(t, "timed out waiting for workload update")
}
}
func makeBundles(bundles ...*Bundle) map[string]*Bundle {
out := make(map[string]*Bundle)
for _, bundle := range bundles {
out[bundle.TrustDomainID()] = bundle
}
return out
}
func makeX509SVIDs(entries ...*common.RegistrationEntry) map[string]*X509SVID {
out := make(map[string]*X509SVID)
for _, entry := range entries {
out[entry.EntryId] = &X509SVID{}
}
return out
}
func makeRegistrationEntry(id string, selectors ...string) *common.RegistrationEntry {
return &common.RegistrationEntry{
EntryId: id,
SpiffeId: "spiffe://domain.test/" + id,
Selectors: makeSelectors(selectors...),
DnsNames: []string{fmt.Sprintf("name-%s", id)},
Ttl: defaultTTL,
}
}
func makeRegistrationEntryWithTTL(id string, ttl int32, selectors ...string) *common.RegistrationEntry {
return &common.RegistrationEntry{
EntryId: id,
SpiffeId: "spiffe://domain.test/" + id,
Selectors: makeSelectors(selectors...),
DnsNames: []string{fmt.Sprintf("name-%s", id)},
Ttl: ttl,
}
}
func makeRegistrationEntries(entries ...*common.RegistrationEntry) map[string]*common.RegistrationEntry {
out := make(map[string]*common.RegistrationEntry)
for _, entry := range entries {
out[entry.EntryId] = entry
}
return out
}
func makeSelectors(values ...string) []*common.Selector {
var out []*common.Selector
for _, value := range values {
out = append(out, &common.Selector{Type: "test", Value: value})
}
return out
}
func makeFederatesWith(bundles ...*Bundle) []string {
var out []string
for _, bundle := range bundles {
out = append(out, bundle.TrustDomainID())
}
return out
}
| {
"pile_set_name": "Github"
} |
@component('mail::message')
# Account Email Changed
@component('mail::panel')
<p>The email associated to your account has been changed.</p>
@endcomponent
<small>If you did not make this change and believe your Pixelfed account has been compromised, please contact the instance admin.</small>
<br>
Thanks,<br>
{{ config('pixelfed.domain.app') }}
@endcomponent
| {
"pile_set_name": "Github"
} |
'VirtualBox_title' = '@VBOX_PRODUCT@';
'choiceVBoxKEXTs_title' = '@VBOX_PRODUCT@ Kernel Extensions';
'choiceVBoxKEXTs_msg' = 'Installs the @VBOX_PRODUCT@ Kernel Extensions into /Library/Extensions.';
'choiceVBoxStartup_title' = '@VBOX_PRODUCT@ Startup Items';
'choiceVBoxStartup_msg' = 'Installs the @VBOX_PRODUCT@ Startup Items to /Library/StartupItems/VirtualBox.';
'choiceVBox_title' = '@VBOX_PRODUCT@';
'choiceVBox_msg' = 'Installs the @VBOX_PRODUCT@ application into /Applications.';
'choiceVBoxCLI_title' = '@VBOX_PRODUCT@ Command Line Utilities';
'choiceVBoxCLI_msg' = 'Installs the @VBOX_PRODUCT@ command line utilities into /usr/bin.';
'RUNNING_VMS_TLE' = "Running VirtualBox VM's detected!";
'RUNNING_VMS_MSG' = "The installer has detected running Virtual Machines. Please shutdown all running VirtualBox machines and then restart the installation.";
'UNSUPPORTED_HW_MACHINE_TLE' = "Unsupported hardware architecture detected!";
'UNSUPPORTED_HW_MACHINE_MSG' = "The installer has detected an unsupported architecture. VirtualBox only runs on the x86 and amd64 architectures.";
'UNSUPPORTED_OS_TLE' = "Unsupported OS version detected!";
'UNSUPPORTED_OS_MSG' = "The installer has detected an unsupported operation system. VirtualBox requires Mac OS X 10.6 or later.";
| {
"pile_set_name": "Github"
} |
// $Id: Atm128I2C.h,v 1.5 2010-06-29 22:07:43 scipio Exp $
/*
* Copyright (c) 2004-2005 Crossbow Technology, 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 Crossbow Technology 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.
*/
// @author Martin Turon <[email protected]>
#ifndef _H_Atm128I2C_h
#define _H_Atm128I2C_h
//====================== I2C Bus ==================================
/* SCL freq = CPU freq / (16 + 2(TWBR) * pow(4, TWPR)) */
enum {
ATM128_I2C_RATE_DIVIDE_16 = 0,
ATM128_I2C_RATE_DIVIDE_24 = 1,
ATM128_I2C_RATE_DIVIDE_80 = 2,
}
typedef uint8_t Atm128_TWBR_t; //!< Two Wire Bit Rate Register
/* I2C Control Register */
typedef struct
{
uint8_t twie : 1; //!< Two Wire Interrupt Enable
uint8_t rsvd : 1; //!< Reserved
uint8_t twen : 1; //!< Two Wire Enable Bit
uint8_t twwc : 1; //!< Two Wire Write Collision Flag
uint8_t twsto : 1; //!< Two Wire Stop Condition Bit
uint8_t twsta : 1; //!< Two Wire Start Condition Bit
uint8_t twea : 1; //!< Two Wire Enable Acknowledge Bit
uint8_t twint : 1; //!< Two Wire Interrupt Flag
} Atm128I2CControl_t;
typedef Atm128I2CControl_t Atm128_TWCR_t; //!< Two Wire Control Register
/* SCL freq = CPU freq / (16 + 2(TWBR) * pow(4, TWPR)) */
enum {
ATM128_I2C_PRESCALE_1 = 0,
ATM128_I2C_PRESCALE_4 = 1,
ATM128_I2C_PRESCALE_16 = 2,
ATM128_I2C_PRESCALE_64 = 3,
};
enum {
ATM128_I2C_STATUS_START = 1,
};
/* I2C Status Register */
typedef struct
{
uint8_t twps : 2; //!< Two Wire Prescaler Bits
uint8_t rsvd : 1; //!< Reserved
uint8_t tws : 5; //!< Two Wire Status
} Atm128I2CStatus_t;
typedef Atm128I2CStatus_t Atm128_TWCR_t; //!< Two Wire Status Register
typedef uint8_t Atm128_TWDR_t; //!< Two Wire Data Register
typedef uint8_t Atm128_TWAR_t; //!< Two Wire Slave Address Register
#endif //_H_Atm128I2C_h
| {
"pile_set_name": "Github"
} |
// Copyright 2015, 2020 Peter Dimov
// Copyright 2020 Hans Dembinski
//
// Distributed under the Boost Software License, Version 1.0.
// https://www.boost.org/LICENSE_1_0.txt
#include <boost/mp11/tuple.hpp>
#include <boost/mp11/detail/config.hpp>
// Technically std::tuple isn't constexpr enabled in C++11, but it works with libstdc++
#if defined( BOOST_MP11_NO_CONSTEXPR ) || ( !defined(_MSC_VER) && !defined( __GLIBCXX__ ) && __cplusplus < 201400L ) || BOOST_MP11_WORKAROUND( BOOST_MP11_GCC, < 40800 )
int main() {}
#else
#include <tuple>
#include <utility>
constexpr int f( int x )
{
return x + 1;
}
constexpr int g( int x, int y )
{
return x + y + 1;
}
#define STATIC_ASSERT(...) static_assert(__VA_ARGS__, #__VA_ARGS__)
int main()
{
{
constexpr std::tuple<int, int, int> tp( 1, 2, 3 );
constexpr auto r = boost::mp11::tuple_transform( f, tp );
STATIC_ASSERT( r == std::make_tuple( 2, 3, 4 ) );
}
{
constexpr std::tuple<int, int> tp1( 1, 2 );
constexpr std::pair<int, int> tp2( 3, 4 );
constexpr auto r = boost::mp11::tuple_transform( g, tp1, tp2 );
STATIC_ASSERT( r == std::make_tuple( 5, 7 ) );
}
#if defined( __clang_major__ ) && __clang_major__ == 3 && __clang_minor__ < 9
// "error: default initialization of an object of const type 'const std::tuple<>' without a user-provided default constructor"
#else
{
constexpr std::tuple<> tp;
constexpr std::tuple<> r = boost::mp11::tuple_transform( f, tp );
(void)r;
}
#endif
}
#endif
| {
"pile_set_name": "Github"
} |
#import <MetalKit/MetalKit.h>
@interface Renderer : NSObject <MTKViewDelegate>
-(nonnull instancetype)initWithView:(nonnull MTKView *)view;
@end
| {
"pile_set_name": "Github"
} |
fileFormatVersion: 2
guid: cdb13d8a1ce808e4787f1af6f2e7fa1b
timeCreated: 1493233442
licenseType: Free
MonoImporter:
serializedVersion: 2
defaultReferences:
- renderer: {instanceID: 0}
- group: {instanceID: 0}
- _font: {fileID: 10102, guid: 0000000000000000e000000000000000, type: 0}
- _shader: {fileID: 4800000, guid: 109077dfbfcd5f3469886d8b9ae4b056, type: 3}
- _meshData: {instanceID: 0}
executionOrder: 0
icon: {instanceID: 0}
userData:
assetBundleName:
assetBundleVariant:
| {
"pile_set_name": "Github"
} |
/*******************************************************************************
* Copyright (c) 2004 Actuate Corporation.
* 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:
* Actuate Corporation - initial API and implementation
*******************************************************************************/
package org.eclipse.birt.report.model.elements.interfaces;
/**
* The interface for constants of abstract design elements.
*/
public interface IDesignElementModel
{
/**
* Property name sufficed for any string property that can be localized. If
* the property name is "mumble", then the message ID for that property is
* "mumbleID".
*/
public static final String ID_SUFFIX = "ID"; //$NON-NLS-1$
/**
* Name of the property that holds custom XML for an element.
*/
public static final String CUSTOM_XML_PROP = "customXml"; //$NON-NLS-1$
/**
* Name of the property that holds comments about the element. Comments
* cannot be localized: they are for the use of the report developer.
*/
public static final String COMMENTS_PROP = "comments"; //$NON-NLS-1$
/**
* Display name of the element. Can be localized.
*/
public static final String DISPLAY_NAME_PROP = "displayName"; //$NON-NLS-1$
/**
* Message ID property for the display name.
*/
public static final String DISPLAY_NAME_ID_PROP = "displayNameID"; //$NON-NLS-1$
/**
* Element name property. The element name is <em>intrinsic</em>: it is
* available as a property, but is stored as a field.
*/
public static final String NAME_PROP = "name"; //$NON-NLS-1$
/**
* Name or reference to the element that this element extends. The extends
* property is <em>intrinsic</em>: it is available as a property, but is
* stored as a field.
*/
public static final String EXTENDS_PROP = "extends"; //$NON-NLS-1$
/**
* Name of the property that holds masks of BIRT/user defined properties for
* the element.
*/
public static final String PROPERTY_MASKS_PROP = "propertyMasks"; //$NON-NLS-1$
/**
* Name of the user property definition.
*/
public static final String USER_PROPERTIES_PROP = "userProperties"; //$NON-NLS-1$
/**
* Name of the event handler class.
*/
public static final String EVENT_HANDLER_CLASS_PROP = "eventHandlerClass"; //$NON-NLS-1$
/**
* Name of the new handler on each event. This property controls if the
* event handler should be created.
*/
public static final String NEW_HANDLER_ON_EACH_EVENT_PROP = "newHandlerOnEachEvent"; //$NON-NLS-1$
/**
* Name of the property that defines the referred template parameter
* definition. Its value is instance of ElementRefValue.
*
* @see org.eclipse.birt.report.model.metadata.ElementRefValue
*/
public static final String REF_TEMPLATE_PARAMETER_PROP = "refTemplateParameter"; //$NON-NLS-1$
/**
* Name of the property that defines the view action in this element.
*/
public static final String VIEW_ACTION_PROP = "viewAction"; //$NON-NLS-1$
/**
* Marker to indicate that the element is not in a slot.
*/
public static final int NO_SLOT = -1;
/**
* Marker to indicate that at which level the user want to get the display
* label of this element. The display name or name of element.
*/
public static final int USER_LABEL = 0;
/**
* The display name, name or metadata name of element.
*/
public static final int SHORT_LABEL = 1;
/**
* The short label pluses additional information.
*/
public static final int FULL_LABEL = 2;
}
| {
"pile_set_name": "Github"
} |
package solr
const mBeansSolr3MainResponse = `{
"solr-mbeans": [
"CORE",
{
"searcher": {
"class": "org.apache.solr.search.SolrIndexSearcher",
"version": "1.0",
"description": "index searcher",
"srcId": "$Id: SolrIndexSearcher.java 1201291 2011-11-12 18:02:03Z simonw $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/search/SolrIndexSearcher.java $",
"docs": null,
"stats": {
"searcherName": "Searcher@4eea69e8 main",
"caching": true,
"numDocs": 117166,
"maxDoc": 117305,
"reader": "SolrIndexReader{this=2ee29b0,r=ReadOnlyDirectoryReader@2ee29b0,refCnt=1,segments=5}",
"readerDir": "org.apache.lucene.store.MMapDirectory:org.apache.lucene.store.MMapDirectory@/usr/solrData/search/index lockFactory=org.apache.lucene.store.NativeFSLockFactory@178671d8",
"indexVersion": 1491861981523,
"openedAt": "2018-01-17T20:14:54.677Z",
"registeredAt": "2018-01-17T20:14:54.679Z",
"warmupTime": 1
}
},
"core": {
"class": "search",
"version": "1.0",
"description": "SolrCore",
"srcId": "$Id: SolrCore.java 1190108 2011-10-28 01:13:25Z yonik $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/core/SolrCore.java $",
"docs": null,
"stats": {
"coreName": "search",
"startTime": "2018-01-16T06:15:53.152Z",
"refCount": 2,
"aliases": [
"search"
]
}
},
"Searcher@4eea69e8 main": {
"class": "org.apache.solr.search.SolrIndexSearcher",
"version": "1.0",
"description": "index searcher",
"srcId": "$Id: SolrIndexSearcher.java 1201291 2011-11-12 18:02:03Z simonw $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/search/SolrIndexSearcher.java $",
"docs": null,
"stats": {
"searcherName": "Searcher@4eea69e8 main",
"caching": true,
"numDocs": 117166,
"maxDoc": 117305,
"reader": "SolrIndexReader{this=2ee29b0,r=ReadOnlyDirectoryReader@2ee29b0,refCnt=1,segments=5}",
"readerDir": "org.apache.lucene.store.MMapDirectory:org.apache.lucene.store.MMapDirectory@/usr/solrData/search/index lockFactory=org.apache.lucene.store.NativeFSLockFactory@178671d8",
"indexVersion": 1491861981523,
"openedAt": "2018-01-17T20:14:54.677Z",
"registeredAt": "2018-01-17T20:14:54.679Z",
"warmupTime": 1
}
}
},
"QUERYHANDLER",
{
"/admin/system": {
"class": "org.apache.solr.handler.admin.SystemInfoHandler",
"version": "$Revision: 1067172 $",
"description": "Get System Info",
"srcId": "$Id: SystemInfoHandler.java 1067172 2011-02-04 12:50:14Z uschindler $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/admin/SystemInfoHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516083353227,
"requests": 0,
"errors": 0,
"timeouts": 0,
"totalTime": 0,
"avgTimePerRequest": "NaN",
"avgRequestsPerSecond": 0
}
},
"/admin/plugins": {
"class": "org.apache.solr.handler.admin.PluginInfoHandler",
"version": "$Revision: 1052938 $",
"description": "Registry",
"srcId": "$Id: PluginInfoHandler.java 1052938 2010-12-26 20:21:48Z rmuir $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/admin/PluginInfoHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516083353227,
"requests": 0,
"errors": 0,
"timeouts": 0,
"totalTime": 0,
"avgTimePerRequest": "NaN",
"avgRequestsPerSecond": 0
}
},
"/admin/file": {
"class": "org.apache.solr.handler.admin.ShowFileRequestHandler",
"version": "$Revision: 1146806 $",
"description": "Admin Get File -- view config files directly",
"srcId": "$Id: ShowFileRequestHandler.java 1146806 2011-07-14 17:01:37Z erick $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/admin/ShowFileRequestHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516083353227,
"requests": 0,
"errors": 0,
"timeouts": 0,
"totalTime": 0,
"avgTimePerRequest": "NaN",
"avgRequestsPerSecond": 0
}
},
"/update/javabin": {
"class": "org.apache.solr.handler.BinaryUpdateRequestHandler",
"version": "$Revision: 1165749 $",
"description": "Add/Update multiple documents with javabin format",
"srcId": "$Id: BinaryUpdateRequestHandler.java 1165749 2011-09-06 16:20:07Z janhoy $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/BinaryUpdateRequestHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516083353158,
"requests": 0,
"errors": 0,
"timeouts": 0,
"totalTime": 0,
"avgTimePerRequest": "NaN",
"avgRequestsPerSecond": 0
}
},
"/admin/luke": {
"class": "org.apache.solr.handler.admin.LukeRequestHandler",
"version": "$Revision: 1201265 $",
"description": "Lucene Index Browser. Inspired and modeled after Luke: http://www.getopt.org/luke/",
"srcId": "$Id: LukeRequestHandler.java 1201265 2011-11-12 14:09:28Z mikemccand $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/admin/LukeRequestHandler.java $",
"docs": [
"java.net.URL:http://wiki.apache.org/solr/LukeRequestHandler"
],
"stats": {
"handlerStart": 1516083353227,
"requests": 0,
"errors": 0,
"timeouts": 0,
"totalTime": 0,
"avgTimePerRequest": "NaN",
"avgRequestsPerSecond": 0
}
},
"/dataimport": {
"class": "org.apache.solr.handler.dataimport.DataImportHandler",
"version": "1.0",
"description": "Manage data import from databases to Solr",
"srcId": "$Id: DataImportHandler.java 1171306 2011-09-15 22:43:33Z janhoy $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/contrib/dataimporthandler/src/java/org/apache/solr/handler/dataimport/DataImportHandler.java $",
"docs": null,
"stats": [
"Status",
"IDLE",
"Documents Processed",
"java.util.concurrent.atomic.AtomicLong:1",
"Requests made to DataSource",
"java.util.concurrent.atomic.AtomicLong:2",
"Rows Fetched",
"java.util.concurrent.atomic.AtomicLong:2",
"Documents Deleted",
"java.util.concurrent.atomic.AtomicLong:0",
"Documents Skipped",
"java.util.concurrent.atomic.AtomicLong:0",
"Total Documents Processed",
"java.util.concurrent.atomic.AtomicLong:351705",
"Total Requests made to DataSource",
"java.util.concurrent.atomic.AtomicLong:1438",
"Total Rows Fetched",
"java.util.concurrent.atomic.AtomicLong:876393",
"Total Documents Deleted",
"java.util.concurrent.atomic.AtomicLong:0",
"Total Documents Skipped",
"java.util.concurrent.atomic.AtomicLong:0",
"handlerStart",
1516083353155,
"requests",
2442,
"errors",
0,
"timeouts",
0,
"totalTime",
1748,
"avgTimePerRequest",
0.7158067,
"avgRequestsPerSecond",
0.017792022
]
},
"/update": {
"class": "org.apache.solr.handler.XmlUpdateRequestHandler",
"version": "$Revision: 1165749 $",
"description": "Add documents with XML",
"srcId": "$Id: XmlUpdateRequestHandler.java 1165749 2011-09-06 16:20:07Z janhoy $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/XmlUpdateRequestHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516083353157,
"requests": 0,
"errors": 0,
"timeouts": 0,
"totalTime": 0,
"avgTimePerRequest": "NaN",
"avgRequestsPerSecond": 0
}
},
"/terms": {
"class": "Lazy[solr.SearchHandler]",
"version": "$Revision: 1086822 $",
"description": "Lazy[solr.SearchHandler]",
"srcId": "$Id: RequestHandlers.java 1086822 2011-03-30 02:23:07Z koji $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/core/RequestHandlers.java $",
"docs": null,
"stats": {
"note": "not initialized yet"
}
},
"org.apache.solr.handler.XmlUpdateRequestHandler": {
"class": "org.apache.solr.handler.XmlUpdateRequestHandler",
"version": "$Revision: 1165749 $",
"description": "Add documents with XML",
"srcId": "$Id: XmlUpdateRequestHandler.java 1165749 2011-09-06 16:20:07Z janhoy $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/XmlUpdateRequestHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516083353157,
"requests": 0,
"errors": 0,
"timeouts": 0,
"totalTime": 0,
"avgTimePerRequest": "NaN",
"avgRequestsPerSecond": 0
}
},
"org.apache.solr.handler.PingRequestHandler": {
"class": "org.apache.solr.handler.PingRequestHandler",
"version": "$Revision: 1142180 $",
"description": "Reports application health to a load-balancer",
"srcId": "$Id: PingRequestHandler.java 1142180 2011-07-02 09:04:29Z uschindler $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/PingRequestHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516083353163,
"requests": 0,
"errors": 0,
"timeouts": 0,
"totalTime": 0,
"avgTimePerRequest": "NaN",
"avgRequestsPerSecond": 0
}
},
"/admin/threads": {
"class": "org.apache.solr.handler.admin.ThreadDumpHandler",
"version": "$Revision: 1052938 $",
"description": "Thread Dump",
"srcId": "$Id: ThreadDumpHandler.java 1052938 2010-12-26 20:21:48Z rmuir $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/admin/ThreadDumpHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516083353227,
"requests": 0,
"errors": 0,
"timeouts": 0,
"totalTime": 0,
"avgTimePerRequest": "NaN",
"avgRequestsPerSecond": 0
}
},
"org.apache.solr.handler.BinaryUpdateRequestHandler": {
"class": "org.apache.solr.handler.BinaryUpdateRequestHandler",
"version": "$Revision: 1165749 $",
"description": "Add/Update multiple documents with javabin format",
"srcId": "$Id: BinaryUpdateRequestHandler.java 1165749 2011-09-06 16:20:07Z janhoy $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/BinaryUpdateRequestHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516083353158,
"requests": 0,
"errors": 0,
"timeouts": 0,
"totalTime": 0,
"avgTimePerRequest": "NaN",
"avgRequestsPerSecond": 0
}
},
"org.apache.solr.handler.dataimport.DataImportHandler": {
"class": "org.apache.solr.handler.dataimport.DataImportHandler",
"version": "1.0",
"description": "Manage data import from databases to Solr",
"srcId": "$Id: DataImportHandler.java 1171306 2011-09-15 22:43:33Z janhoy $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/contrib/dataimporthandler/src/java/org/apache/solr/handler/dataimport/DataImportHandler.java $",
"docs": null,
"stats": [
"Status",
"IDLE",
"Documents Processed",
"java.util.concurrent.atomic.AtomicLong:1",
"Requests made to DataSource",
"java.util.concurrent.atomic.AtomicLong:2",
"Rows Fetched",
"java.util.concurrent.atomic.AtomicLong:2",
"Documents Deleted",
"java.util.concurrent.atomic.AtomicLong:0",
"Documents Skipped",
"java.util.concurrent.atomic.AtomicLong:0",
"Total Documents Processed",
"java.util.concurrent.atomic.AtomicLong:351705",
"Total Requests made to DataSource",
"java.util.concurrent.atomic.AtomicLong:1438",
"Total Rows Fetched",
"java.util.concurrent.atomic.AtomicLong:876393",
"Total Documents Deleted",
"java.util.concurrent.atomic.AtomicLong:0",
"Total Documents Skipped",
"java.util.concurrent.atomic.AtomicLong:0",
"handlerStart",
1516083353155,
"requests",
2442,
"errors",
0,
"timeouts",
0,
"totalTime",
1748,
"avgTimePerRequest",
0.7158067,
"avgRequestsPerSecond",
0.017792022
]
},
"/analysis/field": {
"class": "Lazy[solr.FieldAnalysisRequestHandler]",
"version": "$Revision: 1086822 $",
"description": "Lazy[solr.FieldAnalysisRequestHandler]",
"srcId": "$Id: RequestHandlers.java 1086822 2011-03-30 02:23:07Z koji $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/core/RequestHandlers.java $",
"docs": null,
"stats": {
"note": "not initialized yet"
}
},
"/browse": {
"class": "org.apache.solr.handler.component.SearchHandler",
"version": "$Revision: 1052938 $",
"description": "Search using components: org.apache.solr.handler.component.QueryComponent,org.apache.solr.handler.component.FacetComponent,org.apache.solr.handler.component.MoreLikeThisComponent,org.apache.solr.handler.component.HighlightComponent,org.apache.solr.handler.component.StatsComponent,org.apache.solr.handler.component.SpellCheckComponent,org.apache.solr.handler.component.DebugComponent,",
"srcId": "$Id: SearchHandler.java 1052938 2010-12-26 20:21:48Z rmuir $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/component/SearchHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516083353156,
"requests": 0,
"errors": 0,
"timeouts": 0,
"totalTime": 0,
"avgTimePerRequest": "NaN",
"avgRequestsPerSecond": 0
}
},
"/admin/ping": {
"class": "org.apache.solr.handler.PingRequestHandler",
"version": "$Revision: 1142180 $",
"description": "Reports application health to a load-balancer",
"srcId": "$Id: PingRequestHandler.java 1142180 2011-07-02 09:04:29Z uschindler $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/PingRequestHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516083353163,
"requests": 0,
"errors": 0,
"timeouts": 0,
"totalTime": 0,
"avgTimePerRequest": "NaN",
"avgRequestsPerSecond": 0
}
},
"/admin/mbeans": {
"class": "org.apache.solr.handler.admin.SolrInfoMBeanHandler",
"version": "$Revision: 1065312 $",
"description": "Get Info (and statistics) about all registered SolrInfoMBeans",
"srcId": "$Id: SolrInfoMBeanHandler.java 1065312 2011-01-30 16:08:25Z rmuir $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/admin/SolrInfoMBeanHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516083353227,
"requests": 1078,
"errors": 0,
"timeouts": 0,
"totalTime": 547,
"avgTimePerRequest": 0.50742114,
"avgRequestsPerSecond": 0.00785414
}
},
"/analysis/document": {
"class": "Lazy[solr.DocumentAnalysisRequestHandler]",
"version": "$Revision: 1086822 $",
"description": "Lazy[solr.DocumentAnalysisRequestHandler]",
"srcId": "$Id: RequestHandlers.java 1086822 2011-03-30 02:23:07Z koji $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/core/RequestHandlers.java $",
"docs": null,
"stats": {
"note": "not initialized yet"
}
},
"search": {
"class": "org.apache.solr.handler.component.SearchHandler",
"version": "$Revision: 1052938 $",
"description": "Search using components: org.apache.solr.handler.component.QueryComponent,org.apache.solr.handler.component.FacetComponent,org.apache.solr.handler.component.MoreLikeThisComponent,org.apache.solr.handler.component.HighlightComponent,org.apache.solr.handler.component.StatsComponent,org.apache.solr.handler.component.DebugComponent,",
"srcId": "$Id: SearchHandler.java 1052938 2010-12-26 20:21:48Z rmuir $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/component/SearchHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516083353156,
"requests": 0,
"errors": 0,
"timeouts": 0,
"totalTime": 0,
"avgTimePerRequest": "NaN",
"avgRequestsPerSecond": 0
}
},
"/update/csv": {
"class": "Lazy[solr.CSVRequestHandler]",
"version": "$Revision: 1086822 $",
"description": "Lazy[solr.CSVRequestHandler]",
"srcId": "$Id: RequestHandlers.java 1086822 2011-03-30 02:23:07Z koji $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/core/RequestHandlers.java $",
"docs": null,
"stats": {
"note": "not initialized yet"
}
},
"/update/json": {
"class": "Lazy[solr.JsonUpdateRequestHandler]",
"version": "$Revision: 1086822 $ :: $Revision: 1102081 $",
"description": "Add documents with JSON",
"srcId": "$Id: RequestHandlers.java 1086822 2011-03-30 02:23:07Z koji $ :: $Id: JsonUpdateRequestHandler.java 1102081 2011-05-11 20:37:04Z yonik $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/core/RequestHandlers.java $\n$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/JsonUpdateRequestHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516103486630,
"requests": 2530,
"errors": 26,
"timeouts": 0,
"totalTime": 132438,
"avgTimePerRequest": 52.347034,
"avgRequestsPerSecond": 0.02160195
}
},
"/admin/": {
"class": "org.apache.solr.handler.admin.AdminHandlers",
"version": "$Revision: 953887 $",
"description": "Register Standard Admin Handlers",
"srcId": "$Id: AdminHandlers.java 953887 2010-06-11 21:53:43Z hossman $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/admin/AdminHandlers.java $",
"docs": null,
"stats": null
},
"standard": {
"class": "org.apache.solr.handler.component.SearchHandler",
"version": "$Revision: 1052938 $",
"description": "Search using components: org.apache.solr.handler.component.QueryComponent,org.apache.solr.handler.component.FacetComponent,org.apache.solr.handler.component.MoreLikeThisComponent,org.apache.solr.handler.component.HighlightComponent,org.apache.solr.handler.component.StatsComponent,org.apache.solr.handler.component.DebugComponent,",
"srcId": "$Id: SearchHandler.java 1052938 2010-12-26 20:21:48Z rmuir $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/component/SearchHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516083353155,
"requests": 11480,
"errors": 0,
"timeouts": 0,
"totalTime": 318753,
"avgTimePerRequest": 27.765942,
"avgRequestsPerSecond": 0.08364145
}
},
"org.apache.solr.handler.admin.AdminHandlers": {
"class": "org.apache.solr.handler.admin.AdminHandlers",
"version": "$Revision: 953887 $",
"description": "Register Standard Admin Handlers",
"srcId": "$Id: AdminHandlers.java 953887 2010-06-11 21:53:43Z hossman $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/admin/AdminHandlers.java $",
"docs": null,
"stats": null
},
"tvrh": {
"class": "Lazy[solr.SearchHandler]",
"version": "$Revision: 1086822 $",
"description": "Lazy[solr.SearchHandler]",
"srcId": "$Id: RequestHandlers.java 1086822 2011-03-30 02:23:07Z koji $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/core/RequestHandlers.java $",
"docs": null,
"stats": {
"note": "not initialized yet"
}
},
"org.apache.solr.handler.DumpRequestHandler": {
"class": "org.apache.solr.handler.DumpRequestHandler",
"version": "$Revision: 1067172 $",
"description": "Dump handler (debug)",
"srcId": "$Id: DumpRequestHandler.java 1067172 2011-02-04 12:50:14Z uschindler $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/DumpRequestHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516083353163,
"requests": 0,
"errors": 0,
"timeouts": 0,
"totalTime": 0,
"avgTimePerRequest": "NaN",
"avgRequestsPerSecond": 0
}
},
"/update/extract": {
"class": "Lazy[solr.extraction.ExtractingRequestHandler]",
"version": "$Revision: 1086822 $",
"description": "Lazy[solr.extraction.ExtractingRequestHandler]",
"srcId": "$Id: RequestHandlers.java 1086822 2011-03-30 02:23:07Z koji $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/core/RequestHandlers.java $",
"docs": null,
"stats": {
"note": "not initialized yet"
}
},
"/admin/properties": {
"class": "org.apache.solr.handler.admin.PropertiesRequestHandler",
"version": "$Revision: 898152 $",
"description": "Get System Properties",
"srcId": "$Id: PropertiesRequestHandler.java 898152 2010-01-12 02:19:56Z ryan $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/admin/PropertiesRequestHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516083353227,
"requests": 0,
"errors": 0,
"timeouts": 0,
"totalTime": 0,
"avgTimePerRequest": "NaN",
"avgRequestsPerSecond": 0
}
},
"org.apache.solr.handler.component.SearchHandler": {
"class": "org.apache.solr.handler.component.SearchHandler",
"version": "$Revision: 1052938 $",
"description": "Search using components: org.apache.solr.handler.component.QueryComponent,org.apache.solr.handler.component.FacetComponent,org.apache.solr.handler.component.MoreLikeThisComponent,org.apache.solr.handler.component.HighlightComponent,org.apache.solr.handler.component.StatsComponent,org.apache.solr.handler.component.SpellCheckComponent,org.apache.solr.handler.component.DebugComponent,",
"srcId": "$Id: SearchHandler.java 1052938 2010-12-26 20:21:48Z rmuir $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/component/SearchHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516083353156,
"requests": 0,
"errors": 0,
"timeouts": 0,
"totalTime": 0,
"avgTimePerRequest": "NaN",
"avgRequestsPerSecond": 0
}
},
"/spell": {
"class": "Lazy[solr.SearchHandler]",
"version": "$Revision: 1086822 $",
"description": "Lazy[solr.SearchHandler]",
"srcId": "$Id: RequestHandlers.java 1086822 2011-03-30 02:23:07Z koji $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/core/RequestHandlers.java $",
"docs": null,
"stats": {
"note": "not initialized yet"
}
},
"/debug/dump": {
"class": "org.apache.solr.handler.DumpRequestHandler",
"version": "$Revision: 1067172 $",
"description": "Dump handler (debug)",
"srcId": "$Id: DumpRequestHandler.java 1067172 2011-02-04 12:50:14Z uschindler $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/handler/DumpRequestHandler.java $",
"docs": null,
"stats": {
"handlerStart": 1516083353163,
"requests": 0,
"errors": 0,
"timeouts": 0,
"totalTime": 0,
"avgTimePerRequest": "NaN",
"avgRequestsPerSecond": 0
}
}
},
"UPDATEHANDLER",
{
"updateHandler": {
"class": "org.apache.solr.update.DirectUpdateHandler2",
"version": "1.0",
"description": "Update handler that efficiently directly updates the on-disk main lucene index",
"srcId": "$Id: DirectUpdateHandler2.java 1203770 2011-11-18 17:55:52Z mikemccand $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/update/DirectUpdateHandler2.java $",
"docs": null,
"stats": {
"commits": 3220,
"autocommits": 0,
"optimizes": 3,
"rollbacks": 0,
"expungeDeletes": 0,
"docsPending": 0,
"adds": 0,
"deletesById": 0,
"deletesByQuery": 0,
"errors": 0,
"cumulative_adds": 354209,
"cumulative_deletesById": 0,
"cumulative_deletesByQuery": 3,
"cumulative_errors": 0
}
}
},
"CACHE",
{
"queryResultCache": {
"class": "org.apache.solr.search.LRUCache",
"version": "1.0",
"description": "LRU Cache(maxSize=512, initialSize=512)",
"srcId": "$Id: LRUCache.java 1065312 2011-01-30 16:08:25Z rmuir $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/search/LRUCache.java $",
"docs": null,
"stats": {
"lookups": 4,
"hits": 2,
"hitratio": "0.50",
"inserts": 2,
"evictions": 0,
"size": 2,
"warmupTime": 0,
"cumulative_lookups": 10630,
"cumulative_hits": 5509,
"cumulative_hitratio": "0.51",
"cumulative_inserts": 5626,
"cumulative_evictions": 0
}
},
"fieldCache": {
"class": "org.apache.solr.search.SolrFieldCacheMBean",
"version": "1.0",
"description": "Provides introspection of the Lucene FieldCache, this is **NOT** a cache that is managed by Solr.",
"srcId": "$Id: SolrFieldCacheMBean.java 984594 2010-08-11 21:42:04Z yonik $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/search/SolrFieldCacheMBean.java $",
"docs": null,
"stats": {
"entries_count": 174,
"entry#0": "'MMapIndexInput(path=\"/usr/solrData/search/index/_9eir.frq\")'=>'latlng_0_coordinate',double,org.apache.lucene.search.FieldCache.NUMERIC_UTILS_DOUBLE_PARSER=>[D#661647869",
"insanity_count": 1,
"insanity#0": "SUBREADER: Found caches for descendants of ReadOnlyDirectoryReader(segments_1wo _3kl(3.5):C133115/12 _3kw(3.5):C17/2 _3kx(3.5):C6 _3ky(3.5):C1 _3kz(3.5):C2 _3l0(3.5):C2 _3l1(3.5):C1 _3l2(3.5):C1 _3l3(3.5):C1 _3l4(3.5):C1)+owner\n\t'ReadOnlyDirectoryReader(segments_1wo _3kl(3.5):C133115/12 _3kw(3.5):C17/2 _3kx(3.5):C6 _3ky(3.5):C1 _3kz(3.5):C2 _3l0(3.5):C2 _3l1(3.5):C1 _3l2(3.5):C1 _3l3(3.5):C1 _3l4(3.5):C1)'=>'owner',class org.apache.lucene.search.FieldCache$StringIndex,null=>org.apache.lucene.search.FieldCache$StringIndex#927712538\n\t'MMapIndexInput(path=\"/usr/solrData/search/index/_3kx.frq\")'=>'owner',class org.apache.lucene.search.FieldCache$StringIndex,null=>org.apache.lucene.search.FieldCache$StringIndex#969886745\n\t'MMapIndexInput(path=\"/usr/solrData/search/index/_3kz.frq\")'=>'owner',class org.apache.lucene.search.FieldCache$StringIndex,null=>org.apache.lucene.search.FieldCache$StringIndex#495952608\n\t'MMapIndexInput(path=\"/usr/solrData/search/index/_3ky.frq\")'=>'owner',class org.apache.lucene.search.FieldCache$StringIndex,null=>org.apache.lucene.search.FieldCache$StringIndex#1581258843\n\t'MMapIndexInput(path=\"/usr/solrData/search/index/_3l1.frq\")'=>'owner',class org.apache.lucene.search.FieldCache$StringIndex,null=>org.apache.lucene.search.FieldCache$StringIndex#359550090\n\t'MMapIndexInput(path=\"/usr/solrData/search/index/_3kl.frq\")'=>'owner',class org.apache.lucene.search.FieldCache$StringIndex,null=>org.apache.lucene.search.FieldCache$StringIndex#1748227582\n\t'MMapIndexInput(path=\"/usr/solrData/search/index/_3l4.frq\")'=>'owner',class org.apache.lucene.search.FieldCache$StringIndex,null=>org.apache.lucene.search.FieldCache$StringIndex#1084424163\n\t'MMapIndexInput(path=\"/usr/solrData/search/index/_3l3.frq\")'=>'owner',class org.apache.lucene.search.FieldCache$StringIndex,null=>org.apache.lucene.search.FieldCache$StringIndex#1116912780\n\t'MMapIndexInput(path=\"/usr/solrData/search/index/_3l0.frq\")'=>'owner',class org.apache.lucene.search.FieldCache$StringIndex,null=>org.apache.lucene.search.FieldCache$StringIndex#1187916045\n\t'MMapIndexInput(path=\"/usr/solrData/search/index/_3l2.frq\")'=>'owner',class org.apache.lucene.search.FieldCache$StringIndex,null=>org.apache.lucene.search.FieldCache$StringIndex#62119827\n\t'MMapIndexInput(path=\"/usr/solrData/search/index/_3kw.frq\")'=>'owner',class org.apache.lucene.search.FieldCache$StringIndex,null=>org.apache.lucene.search.FieldCache$StringIndex#1756606907\n"
}
},
"documentCache": {
"class": "org.apache.solr.search.LRUCache",
"version": "1.0",
"description": "LRU Cache(maxSize=512, initialSize=512)",
"srcId": "$Id: LRUCache.java 1065312 2011-01-30 16:08:25Z rmuir $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/search/LRUCache.java $",
"docs": null,
"stats": {
"lookups": 0,
"hits": 0,
"hitratio": "0.00",
"inserts": 0,
"evictions": 0,
"size": 0,
"warmupTime": 0,
"cumulative_lookups": 180435,
"cumulative_hits": 22584,
"cumulative_hitratio": "0.12",
"cumulative_inserts": 157851,
"cumulative_evictions": 40344
}
},
"fieldValueCache": {
"class": "org.apache.solr.search.FastLRUCache",
"version": "1.0",
"description": "Concurrent LRU Cache(maxSize=10000, initialSize=10, minSize=9000, acceptableSize=9500, cleanupThread=false)",
"srcId": "$Id: FastLRUCache.java 1170772 2011-09-14 19:09:56Z sarowe $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/search/FastLRUCache.java $",
"docs": null,
"stats": {
"lookups": 5,
"hits": 3,
"hitratio": "0.60",
"inserts": 1,
"evictions": 0,
"size": 1,
"warmupTime": 0,
"cumulative_lookups": 8529,
"cumulative_hits": 5432,
"cumulative_hitratio": "0.63",
"cumulative_inserts": 1437,
"cumulative_evictions": 0,
"item_parentCompanyId": "{field=parentCompanyId,memSize=785156,tindexSize=13056,time=136,phase1=135,nTerms=75696,bigTerms=0,termInstances=117166,uses=4}"
}
},
"filterCache": {
"class": "org.apache.solr.search.FastLRUCache",
"version": "1.0",
"description": "Concurrent LRU Cache(maxSize=512, initialSize=512, minSize=460, acceptableSize=486, cleanupThread=false)",
"srcId": "$Id: FastLRUCache.java 1170772 2011-09-14 19:09:56Z sarowe $",
"src": "$URL: https://svn.apache.org/repos/asf/lucene/dev/branches/lucene_solr_3_5/solr/core/src/java/org/apache/solr/search/FastLRUCache.java $",
"docs": null,
"stats": {
"lookups": 2,
"hits": 2,
"hitratio": "1.00",
"inserts": 2,
"evictions": 0,
"size": 2,
"warmupTime": 0,
"cumulative_lookups": 4041,
"cumulative_hits": 4041,
"cumulative_hitratio": "1.00",
"cumulative_inserts": 2828,
"cumulative_evictions": 0
}
}
}
]
}
`
var solr3CoreExpected = map[string]interface{}{
"num_docs": int64(117166),
"max_docs": int64(117305),
"deleted_docs": int64(0),
}
var solr3QueryHandlerExpected = map[string]interface{}{
"15min_rate_reqs_per_second": float64(0),
"5min_rate_reqs_per_second": float64(0),
"75th_pc_request_time": float64(0),
"95th_pc_request_time": float64(0),
"999th_pc_request_time": float64(0),
"99th_pc_request_time": float64(0),
"avg_requests_per_second": float64(0),
"avg_time_per_request": float64(0),
"errors": int64(0),
"handler_start": int64(1516083353156),
"median_request_time": float64(0),
"requests": int64(0),
"timeouts": int64(0),
"total_time": float64(0),
}
var solr3UpdateHandlerExpected = map[string]interface{}{
"adds": int64(0),
"autocommit_max_docs": int64(0),
"autocommit_max_time": int64(0),
"autocommits": int64(0),
"commits": int64(3220),
"cumulative_adds": int64(354209),
"cumulative_deletes_by_id": int64(0),
"cumulative_deletes_by_query": int64(3),
"cumulative_errors": int64(0),
"deletes_by_id": int64(0),
"deletes_by_query": int64(0),
"docs_pending": int64(0),
"errors": int64(0),
"expunge_deletes": int64(0),
"optimizes": int64(3),
"rollbacks": int64(0),
"soft_autocommits": int64(0),
}
var solr3CacheExpected = map[string]interface{}{
"cumulative_evictions": int64(0),
"cumulative_hitratio": float64(1.00),
"cumulative_hits": int64(4041),
"cumulative_inserts": int64(2828),
"cumulative_lookups": int64(4041),
"evictions": int64(0),
"hitratio": float64(1.00),
"hits": int64(2),
"inserts": int64(2),
"lookups": int64(2),
"size": int64(2),
"warmup_time": int64(0),
}
| {
"pile_set_name": "Github"
} |
package com.thefinestartist.finestwebview;
import android.app.Activity;
import android.content.Context;
import android.content.Intent;
import android.support.annotation.AnimRes;
import android.support.annotation.ArrayRes;
import android.support.annotation.ColorInt;
import android.support.annotation.ColorRes;
import android.support.annotation.DimenRes;
import android.support.annotation.DrawableRes;
import android.support.annotation.NonNull;
import android.support.annotation.StringRes;
import android.support.annotation.StyleRes;
import android.support.design.widget.AppBarLayout.LayoutParams.ScrollFlags;
import android.webkit.WebSettings;
import com.thefinestartist.Base;
import com.thefinestartist.finestwebview.enums.Position;
import com.thefinestartist.finestwebview.listeners.BroadCastManager;
import com.thefinestartist.finestwebview.listeners.WebViewListener;
import com.thefinestartist.utils.content.Ctx;
import com.thefinestartist.utils.content.Res;
import java.io.Serializable;
import java.util.ArrayList;
import java.util.List;
/**
* Created by Leonardo on 11/21/15.
*/
public class FinestWebView {
public static class Builder implements Serializable {
protected final transient Context context;
protected transient List<WebViewListener> listeners = new ArrayList<>();
protected Integer key;
protected Boolean rtl;
protected Integer theme;
protected Integer statusBarColor;
protected Integer toolbarColor;
protected Integer toolbarScrollFlags;
protected Integer iconDefaultColor;
protected Integer iconDisabledColor;
protected Integer iconPressedColor;
protected Integer iconSelector;
protected Boolean showIconClose;
protected Boolean disableIconClose;
protected Boolean showIconBack;
protected Boolean disableIconBack;
protected Boolean showIconForward;
protected Boolean disableIconForward;
protected Boolean showIconMenu;
protected Boolean disableIconMenu;
protected Boolean showSwipeRefreshLayout;
protected Integer swipeRefreshColor;
protected Integer[] swipeRefreshColors;
protected Boolean showDivider;
protected Boolean gradientDivider;
protected Integer dividerColor;
protected Float dividerHeight;
protected Boolean showProgressBar;
protected Integer progressBarColor;
protected Float progressBarHeight;
protected Position progressBarPosition;
protected String titleDefault;
protected Boolean updateTitleFromHtml;
protected Float titleSize;
protected String titleFont;
protected Integer titleColor;
protected Boolean showUrl;
protected Float urlSize;
protected String urlFont;
protected Integer urlColor;
protected Integer menuColor;
protected Integer menuDropShadowColor;
protected Float menuDropShadowSize;
protected Integer menuSelector;
protected Float menuTextSize;
protected String menuTextFont;
protected Integer menuTextColor;
protected Integer menuTextGravity;
protected Float menuTextPaddingLeft;
protected Float menuTextPaddingRight;
protected Boolean showMenuRefresh;
protected Integer stringResRefresh;
protected Boolean showMenuFind;
protected Integer stringResFind;
protected Boolean showMenuShareVia;
protected Integer stringResShareVia;
protected Boolean showMenuCopyLink;
protected Integer stringResCopyLink;
protected Boolean showMenuOpenWith;
protected Integer stringResOpenWith;
protected Integer animationOpenEnter = R.anim.modal_activity_open_enter;
protected Integer animationOpenExit = R.anim.modal_activity_open_exit;
protected Integer animationCloseEnter;
protected Integer animationCloseExit;
protected Boolean backPressToClose;
protected Integer stringResCopiedToClipboard;
protected Boolean webViewSupportZoom;
protected Boolean webViewMediaPlaybackRequiresUserGesture;
protected Boolean webViewBuiltInZoomControls;
protected Boolean webViewDisplayZoomControls;
protected Boolean webViewAllowFileAccess;
protected Boolean webViewAllowContentAccess;
protected Boolean webViewLoadWithOverviewMode;
protected Boolean webViewSaveFormData;
protected Integer webViewTextZoom;
protected Boolean webViewUseWideViewPort;
protected Boolean webViewSupportMultipleWindows;
protected WebSettings.LayoutAlgorithm webViewLayoutAlgorithm;
protected String webViewStandardFontFamily;
protected String webViewFixedFontFamily;
protected String webViewSansSerifFontFamily;
protected String webViewSerifFontFamily;
protected String webViewCursiveFontFamily;
protected String webViewFantasyFontFamily;
protected Integer webViewMinimumFontSize;
protected Integer webViewMinimumLogicalFontSize;
protected Integer webViewDefaultFontSize;
protected Integer webViewDefaultFixedFontSize;
protected Boolean webViewLoadsImagesAutomatically;
protected Boolean webViewBlockNetworkImage;
protected Boolean webViewBlockNetworkLoads;
protected Boolean webViewJavaScriptEnabled;
protected Boolean webViewAllowUniversalAccessFromFileURLs;
protected Boolean webViewAllowFileAccessFromFileURLs;
protected String webViewGeolocationDatabasePath;
protected Boolean webViewAppCacheEnabled;
protected String webViewAppCachePath;
protected Boolean webViewDatabaseEnabled;
protected Boolean webViewDomStorageEnabled;
protected Boolean webViewGeolocationEnabled;
protected Boolean webViewJavaScriptCanOpenWindowsAutomatically;
protected String webViewDefaultTextEncodingName;
protected String webViewUserAgentString;
protected Boolean webViewNeedInitialFocus;
protected Integer webViewCacheMode;
protected Integer webViewMixedContentMode;
protected Boolean webViewOffscreenPreRaster;
protected String injectJavaScript;
protected String mimeType;
protected String encoding;
protected String data;
protected String url;
public Builder(@NonNull Activity activity) {
this.context = activity;
Base.initialize(activity);
}
/**
* If you use context instead of activity, FinestWebView won't be able to override activity
* animation.
* Try to create builder with Activity if it's possible.
*/
public Builder(@NonNull Context context) {
this.context = context;
Base.initialize(context);
}
public Builder setWebViewListener(WebViewListener listener) {
listeners.clear();
listeners.add(listener);
return this;
}
public Builder addWebViewListener(WebViewListener listener) {
listeners.add(listener);
return this;
}
public Builder removeWebViewListener(WebViewListener listener) {
listeners.remove(listener);
return this;
}
public Builder rtl(boolean rtl) {
this.rtl = rtl;
return this;
}
public Builder theme(@StyleRes int theme) {
this.theme = theme;
return this;
}
public Builder statusBarColor(@ColorInt int color) {
this.statusBarColor = color;
return this;
}
public Builder statusBarColorRes(@ColorRes int colorRes) {
this.statusBarColor = Res.getColor(colorRes);
return this;
}
public Builder toolbarColor(@ColorInt int color) {
this.toolbarColor = color;
return this;
}
public Builder toolbarColorRes(@ColorRes int colorRes) {
this.toolbarColor = Res.getColor(colorRes);
return this;
}
public Builder toolbarScrollFlags(@ScrollFlags int flags) {
this.toolbarScrollFlags = flags;
return this;
}
public Builder iconDefaultColor(@ColorInt int color) {
this.iconDefaultColor = color;
return this;
}
public Builder iconDefaultColorRes(@ColorRes int color) {
this.iconDefaultColor = Res.getColor(color);
return this;
}
public Builder iconDisabledColor(@ColorInt int color) {
this.iconDisabledColor = color;
return this;
}
public Builder iconDisabledColorRes(@ColorRes int colorRes) {
this.iconDisabledColor = Res.getColor(colorRes);
return this;
}
public Builder iconPressedColor(@ColorInt int color) {
this.iconPressedColor = color;
return this;
}
public Builder iconPressedColorRes(@ColorRes int colorRes) {
this.iconPressedColor = Res.getColor(colorRes);
return this;
}
public Builder iconSelector(@DrawableRes int selectorRes) {
this.iconSelector = selectorRes;
return this;
}
public Builder showIconClose(boolean showIconClose) {
this.showIconClose = showIconClose;
return this;
}
public Builder disableIconClose(boolean disableIconClose) {
this.disableIconClose = disableIconClose;
return this;
}
public Builder showIconBack(boolean showIconBack) {
this.showIconBack = showIconBack;
return this;
}
public Builder disableIconBack(boolean disableIconBack) {
this.disableIconBack = disableIconBack;
return this;
}
public Builder showIconForward(boolean showIconForward) {
this.showIconForward = showIconForward;
return this;
}
public Builder disableIconForward(boolean disableIconForward) {
this.disableIconForward = disableIconForward;
return this;
}
public Builder showIconMenu(boolean showIconMenu) {
this.showIconMenu = showIconMenu;
return this;
}
public Builder disableIconMenu(boolean disableIconMenu) {
this.disableIconMenu = disableIconMenu;
return this;
}
public Builder showSwipeRefreshLayout(boolean showSwipeRefreshLayout) {
this.showSwipeRefreshLayout = showSwipeRefreshLayout;
return this;
}
public Builder swipeRefreshColor(@ColorInt int color) {
this.swipeRefreshColor = color;
return this;
}
public Builder swipeRefreshColorRes(@ColorRes int colorRes) {
this.swipeRefreshColor = Res.getColor(colorRes);
return this;
}
public Builder swipeRefreshColors(int[] colors) {
Integer[] swipeRefreshColors = new Integer[colors.length];
for (int i = 0; i < colors.length; i++) {
swipeRefreshColors[i] = colors[i];
}
this.swipeRefreshColors = swipeRefreshColors;
return this;
}
public Builder swipeRefreshColorsRes(@ArrayRes int colorsRes) {
int[] colors = Res.getIntArray(colorsRes);
return swipeRefreshColors(colors);
}
public Builder showDivider(boolean showDivider) {
this.showDivider = showDivider;
return this;
}
public Builder gradientDivider(boolean gradientDivider) {
this.gradientDivider = gradientDivider;
return this;
}
public Builder dividerColor(@ColorInt int color) {
this.dividerColor = color;
return this;
}
public Builder dividerColorRes(@ColorRes int colorRes) {
this.dividerColor = Res.getColor(colorRes);
return this;
}
public Builder dividerHeight(float height) {
this.dividerHeight = height;
return this;
}
public Builder dividerHeight(int height) {
this.dividerHeight = (float) height;
return this;
}
public Builder dividerHeightRes(@DimenRes int height) {
this.dividerHeight = Res.getDimension(height);
return this;
}
public Builder showProgressBar(boolean showProgressBar) {
this.showProgressBar = showProgressBar;
return this;
}
public Builder progressBarColor(@ColorInt int color) {
this.progressBarColor = color;
return this;
}
public Builder progressBarColorRes(@ColorRes int colorRes) {
this.progressBarColor = Res.getColor(colorRes);
return this;
}
public Builder progressBarHeight(float height) {
this.progressBarHeight = height;
return this;
}
public Builder progressBarHeight(int height) {
this.progressBarHeight = (float) height;
return this;
}
public Builder progressBarHeightRes(@DimenRes int height) {
this.progressBarHeight = Res.getDimension(height);
return this;
}
public Builder progressBarPosition(@NonNull Position position) {
this.progressBarPosition = position;
return this;
}
public Builder titleDefault(@NonNull String title) {
this.titleDefault = title;
return this;
}
public Builder titleDefaultRes(@StringRes int stringRes) {
this.titleDefault = Res.getString(stringRes);
return this;
}
public Builder updateTitleFromHtml(boolean updateTitleFromHtml) {
this.updateTitleFromHtml = updateTitleFromHtml;
return this;
}
public Builder titleSize(float titleSize) {
this.titleSize = titleSize;
return this;
}
public Builder titleSize(int titleSize) {
this.titleSize = (float) titleSize;
return this;
}
public Builder titleSizeRes(@DimenRes int titleSize) {
this.titleSize = Res.getDimension(titleSize);
return this;
}
public Builder titleFont(String titleFont) {
this.titleFont = titleFont;
return this;
}
public Builder titleColor(@ColorInt int color) {
this.titleColor = color;
return this;
}
public Builder titleColorRes(@ColorRes int colorRes) {
this.titleColor = Res.getColor(colorRes);
return this;
}
public Builder showUrl(boolean showUrl) {
this.showUrl = showUrl;
return this;
}
public Builder urlSize(float urlSize) {
this.urlSize = urlSize;
return this;
}
public Builder urlSize(int urlSize) {
this.urlSize = (float) urlSize;
return this;
}
public Builder urlSizeRes(@DimenRes int urlSize) {
this.urlSize = Res.getDimension(urlSize);
return this;
}
public Builder urlFont(String urlFont) {
this.urlFont = urlFont;
return this;
}
public Builder urlColor(@ColorInt int color) {
this.urlColor = color;
return this;
}
public Builder urlColorRes(@ColorRes int colorRes) {
this.urlColor = Res.getColor(colorRes);
return this;
}
public Builder menuColor(@ColorInt int color) {
this.menuColor = color;
return this;
}
public Builder menuColorRes(@ColorRes int colorRes) {
this.menuColor = Res.getColor(colorRes);
return this;
}
public Builder menuTextGravity(int gravity) {
this.menuTextGravity = gravity;
return this;
}
public Builder menuTextPaddingLeft(float menuTextPaddingLeft) {
this.menuTextPaddingLeft = menuTextPaddingLeft;
return this;
}
public Builder menuTextPaddingLeft(int menuTextPaddingLeft) {
this.menuTextPaddingLeft = (float) menuTextPaddingLeft;
return this;
}
public Builder menuTextPaddingLeftRes(@DimenRes int menuTextPaddingLeft) {
this.menuTextPaddingLeft = Res.getDimension(menuTextPaddingLeft);
return this;
}
public Builder menuTextPaddingRight(float menuTextPaddingRight) {
this.menuTextPaddingRight = menuTextPaddingRight;
return this;
}
public Builder menuTextPaddingRight(int menuTextPaddingRight) {
this.menuTextPaddingRight = (float) menuTextPaddingRight;
return this;
}
public Builder menuTextPaddingRightRes(@DimenRes int menuTextPaddingRight) {
this.menuTextPaddingRight = Res.getDimension(menuTextPaddingRight);
return this;
}
public Builder menuDropShadowColor(@ColorInt int color) {
this.menuDropShadowColor = color;
return this;
}
public Builder menuDropShadowColorRes(@ColorRes int colorRes) {
this.menuDropShadowColor = Res.getColor(colorRes);
return this;
}
public Builder menuDropShadowSize(float menuDropShadowSize) {
this.menuDropShadowSize = menuDropShadowSize;
return this;
}
public Builder menuDropShadowSize(int menuDropShadowSize) {
this.menuDropShadowSize = (float) menuDropShadowSize;
return this;
}
public Builder menuDropShadowSizeRes(@DimenRes int menuDropShadowSize) {
this.menuDropShadowSize = Res.getDimension(menuDropShadowSize);
return this;
}
public Builder menuSelector(@DrawableRes int selectorRes) {
this.menuSelector = selectorRes;
return this;
}
public Builder menuTextSize(float menuTextSize) {
this.menuTextSize = menuTextSize;
return this;
}
public Builder menuTextSize(int menuTextSize) {
this.menuTextSize = (float) menuTextSize;
return this;
}
public Builder menuTextSizeRes(@DimenRes int menuTextSize) {
this.menuTextSize = Res.getDimension(menuTextSize);
return this;
}
public Builder menuTextFont(String menuTextFont) {
this.menuTextFont = menuTextFont;
return this;
}
public Builder menuTextColor(@ColorInt int color) {
this.menuTextColor = color;
return this;
}
public Builder menuTextColorRes(@ColorRes int colorRes) {
this.menuTextColor = Res.getColor(colorRes);
return this;
}
public Builder showMenuRefresh(boolean showMenuRefresh) {
this.showMenuRefresh = showMenuRefresh;
return this;
}
public Builder stringResRefresh(@StringRes int stringResRefresh) {
this.stringResRefresh = stringResRefresh;
return this;
}
public Builder showMenuFind(boolean showMenuFind) {
this.showMenuFind = showMenuFind;
return this;
}
public Builder stringResFind(@StringRes int stringResFind) {
this.stringResFind = stringResFind;
return this;
}
public Builder showMenuShareVia(boolean showMenuShareVia) {
this.showMenuShareVia = showMenuShareVia;
return this;
}
public Builder stringResShareVia(@StringRes int stringResShareVia) {
this.stringResShareVia = stringResShareVia;
return this;
}
public Builder showMenuCopyLink(boolean showMenuCopyLink) {
this.showMenuCopyLink = showMenuCopyLink;
return this;
}
public Builder stringResCopyLink(@StringRes int stringResCopyLink) {
this.stringResCopyLink = stringResCopyLink;
return this;
}
public Builder showMenuOpenWith(boolean showMenuOpenWith) {
this.showMenuOpenWith = showMenuOpenWith;
return this;
}
public Builder stringResOpenWith(@StringRes int stringResOpenWith) {
this.stringResOpenWith = stringResOpenWith;
return this;
}
public Builder setCustomAnimations(@AnimRes int animationOpenEnter,
@AnimRes int animationOpenExit, @AnimRes int animationCloseEnter,
@AnimRes int animationCloseExit) {
this.animationOpenEnter = animationOpenEnter;
this.animationOpenExit = animationOpenExit;
this.animationCloseEnter = animationCloseEnter;
this.animationCloseExit = animationCloseExit;
return this;
}
/**
* @deprecated As of release 1.0.1, replaced by {@link #setCustomAnimations(int, int, int, int)}
*/
public Builder setCloseAnimations(@AnimRes int animationCloseEnter,
@AnimRes int animationCloseExit) {
this.animationCloseEnter = animationCloseEnter;
this.animationCloseExit = animationCloseExit;
return this;
}
public Builder backPressToClose(boolean backPressToClose) {
this.backPressToClose = backPressToClose;
return this;
}
public Builder stringResCopiedToClipboard(@StringRes int stringResCopiedToClipboard) {
this.stringResCopiedToClipboard = stringResCopiedToClipboard;
return this;
}
public Builder webViewSupportZoom(boolean webViewSupportZoom) {
this.webViewSupportZoom = webViewSupportZoom;
return this;
}
public Builder webViewMediaPlaybackRequiresUserGesture(
boolean webViewMediaPlaybackRequiresUserGesture) {
this.webViewMediaPlaybackRequiresUserGesture = webViewMediaPlaybackRequiresUserGesture;
return this;
}
public Builder webViewBuiltInZoomControls(boolean webViewBuiltInZoomControls) {
this.webViewBuiltInZoomControls = webViewBuiltInZoomControls;
return this;
}
public Builder webViewDisplayZoomControls(boolean webViewDisplayZoomControls) {
this.webViewDisplayZoomControls = webViewDisplayZoomControls;
return this;
}
public Builder webViewAllowFileAccess(boolean webViewAllowFileAccess) {
this.webViewAllowFileAccess = webViewAllowFileAccess;
return this;
}
public Builder webViewAllowContentAccess(boolean webViewAllowContentAccess) {
this.webViewAllowContentAccess = webViewAllowContentAccess;
return this;
}
public Builder webViewLoadWithOverviewMode(boolean webViewLoadWithOverviewMode) {
this.webViewLoadWithOverviewMode = webViewLoadWithOverviewMode;
return this;
}
public Builder webViewSaveFormData(boolean webViewSaveFormData) {
this.webViewSaveFormData = webViewSaveFormData;
return this;
}
public Builder webViewTextZoom(int webViewTextZoom) {
this.webViewTextZoom = webViewTextZoom;
return this;
}
public Builder webViewUseWideViewPort(boolean webViewUseWideViewPort) {
this.webViewUseWideViewPort = webViewUseWideViewPort;
return this;
}
public Builder webViewSupportMultipleWindows(boolean webViewSupportMultipleWindows) {
this.webViewSupportMultipleWindows = webViewSupportMultipleWindows;
return this;
}
public Builder webViewLayoutAlgorithm(WebSettings.LayoutAlgorithm webViewLayoutAlgorithm) {
this.webViewLayoutAlgorithm = webViewLayoutAlgorithm;
return this;
}
public Builder webViewStandardFontFamily(String webViewStandardFontFamily) {
this.webViewStandardFontFamily = webViewStandardFontFamily;
return this;
}
public Builder webViewFixedFontFamily(String webViewFixedFontFamily) {
this.webViewFixedFontFamily = webViewFixedFontFamily;
return this;
}
public Builder webViewSansSerifFontFamily(String webViewSansSerifFontFamily) {
this.webViewSansSerifFontFamily = webViewSansSerifFontFamily;
return this;
}
public Builder webViewSerifFontFamily(String webViewSerifFontFamily) {
this.webViewSerifFontFamily = webViewSerifFontFamily;
return this;
}
public Builder webViewCursiveFontFamily(String webViewCursiveFontFamily) {
this.webViewCursiveFontFamily = webViewCursiveFontFamily;
return this;
}
public Builder webViewFantasyFontFamily(String webViewFantasyFontFamily) {
this.webViewFantasyFontFamily = webViewFantasyFontFamily;
return this;
}
public Builder webViewMinimumFontSize(int webViewMinimumFontSize) {
this.webViewMinimumFontSize = webViewMinimumFontSize;
return this;
}
public Builder webViewMinimumLogicalFontSize(int webViewMinimumLogicalFontSize) {
this.webViewMinimumLogicalFontSize = webViewMinimumLogicalFontSize;
return this;
}
public Builder webViewDefaultFontSize(int webViewDefaultFontSize) {
this.webViewDefaultFontSize = webViewDefaultFontSize;
return this;
}
public Builder webViewDefaultFixedFontSize(int webViewDefaultFixedFontSize) {
this.webViewDefaultFixedFontSize = webViewDefaultFixedFontSize;
return this;
}
public Builder webViewLoadsImagesAutomatically(boolean webViewLoadsImagesAutomatically) {
this.webViewLoadsImagesAutomatically = webViewLoadsImagesAutomatically;
return this;
}
public Builder webViewBlockNetworkImage(boolean webViewBlockNetworkImage) {
this.webViewBlockNetworkImage = webViewBlockNetworkImage;
return this;
}
public Builder webViewBlockNetworkLoads(boolean webViewBlockNetworkLoads) {
this.webViewBlockNetworkLoads = webViewBlockNetworkLoads;
return this;
}
public Builder webViewJavaScriptEnabled(boolean webViewJavaScriptEnabled) {
this.webViewJavaScriptEnabled = webViewJavaScriptEnabled;
return this;
}
public Builder webViewAllowUniversalAccessFromFileURLs(
boolean webViewAllowUniversalAccessFromFileURLs) {
this.webViewAllowUniversalAccessFromFileURLs = webViewAllowUniversalAccessFromFileURLs;
return this;
}
public Builder webViewAllowFileAccessFromFileURLs(boolean webViewAllowFileAccessFromFileURLs) {
this.webViewAllowFileAccessFromFileURLs = webViewAllowFileAccessFromFileURLs;
return this;
}
public Builder webViewGeolocationDatabasePath(String webViewGeolocationDatabasePath) {
this.webViewGeolocationDatabasePath = webViewGeolocationDatabasePath;
return this;
}
public Builder webViewAppCacheEnabled(boolean webViewAppCacheEnabled) {
this.webViewAppCacheEnabled = webViewAppCacheEnabled;
return this;
}
public Builder webViewAppCachePath(String webViewAppCachePath) {
this.webViewAppCachePath = webViewAppCachePath;
return this;
}
public Builder webViewDatabaseEnabled(boolean webViewDatabaseEnabled) {
this.webViewDatabaseEnabled = webViewDatabaseEnabled;
return this;
}
public Builder webViewDomStorageEnabled(boolean webViewDomStorageEnabled) {
this.webViewDomStorageEnabled = webViewDomStorageEnabled;
return this;
}
public Builder webViewGeolocationEnabled(boolean webViewGeolocationEnabled) {
this.webViewGeolocationEnabled = webViewGeolocationEnabled;
return this;
}
public Builder webViewJavaScriptCanOpenWindowsAutomatically(
boolean webViewJavaScriptCanOpenWindowsAutomatically) {
this.webViewJavaScriptCanOpenWindowsAutomatically =
webViewJavaScriptCanOpenWindowsAutomatically;
return this;
}
public Builder webViewDefaultTextEncodingName(String webViewDefaultTextEncodingName) {
this.webViewDefaultTextEncodingName = webViewDefaultTextEncodingName;
return this;
}
public Builder webViewUserAgentString(String webViewUserAgentString) {
this.webViewUserAgentString = webViewUserAgentString;
return this;
}
public Builder webViewNeedInitialFocus(boolean webViewNeedInitialFocus) {
this.webViewNeedInitialFocus = webViewNeedInitialFocus;
return this;
}
public Builder webViewCacheMode(int webViewCacheMode) {
this.webViewCacheMode = webViewCacheMode;
return this;
}
public Builder webViewMixedContentMode(int webViewMixedContentMode) {
this.webViewMixedContentMode = webViewMixedContentMode;
return this;
}
public Builder webViewOffscreenPreRaster(boolean webViewOffscreenPreRaster) {
this.webViewOffscreenPreRaster = webViewOffscreenPreRaster;
return this;
}
/**
* @deprecated As of release 1.1.1, replaced by {@link #webViewUserAgentString(String)} Use
* setUserAgentString("Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.9.0.4) Gecko/20100101
* Firefox/4.0") instead
*/
public Builder webViewDesktopMode(boolean webViewDesktopMode) {
return webViewUserAgentString(
"Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.9.0.4) Gecko/20100101 Firefox/4.0");
}
public Builder injectJavaScript(String injectJavaScript) {
this.injectJavaScript = injectJavaScript;
return this;
}
public void load(@StringRes int dataRes) {
load(Res.getString(dataRes));
}
public void load(String data) {
load(data, "text/html", "UTF-8");
}
public void load(String data, String mimeType, String encoding) {
this.mimeType = mimeType;
this.encoding = encoding;
show(null, data);
}
public void show(@StringRes int urlRes) {
show(Res.getString(urlRes));
}
public void show(@NonNull String url) {
show(url, null);
}
protected void show(String url, String data) {
this.url = url;
this.data = data;
this.key = System.identityHashCode(this);
if (!listeners.isEmpty()) {
new BroadCastManager(context, key, listeners);
}
Intent intent = new Intent(context, FinestWebViewActivity.class);
intent.putExtra("builder", this);
Ctx.startActivity(intent);
if (context instanceof Activity) {
((Activity) context).overridePendingTransition(animationOpenEnter, animationOpenExit);
}
}
}
}
| {
"pile_set_name": "Github"
} |
<?php
/**
* CodeIgniter
*
* An open source application development framework for PHP
*
* This content is released under the MIT License (MIT)
*
* Copyright (c) 2014 - 2015, British Columbia Institute of Technology
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*
* @package CodeIgniter
* @author EllisLab Dev Team
* @copyright Copyright (c) 2008 - 2014, EllisLab, Inc. (http://ellislab.com/)
* @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
* @since Version 1.0.0
* @filesource
*/
defined('BASEPATH') OR exit('No direct script access allowed');
/**
* Trackback Class
*
* Trackback Sending/Receiving Class
*
* @package CodeIgniter
* @subpackage Libraries
* @category Trackbacks
* @author EllisLab Dev Team
* @link http://codeigniter.com/user_guide/libraries/trackback.html
*/
class CI_Trackback {
/**
* Character set
*
* @var string
*/
public $charset = 'UTF-8';
/**
* Trackback data
*
* @var array
*/
public $data = array(
'url' => '',
'title' => '',
'excerpt' => '',
'blog_name' => '',
'charset' => ''
);
/**
* Convert ASCII flag
*
* Whether to convert high-ASCII and MS Word
* characters to HTML entities.
*
* @var bool
*/
public $convert_ascii = TRUE;
/**
* Response
*
* @var string
*/
public $response = '';
/**
* Error messages list
*
* @var string[]
*/
public $error_msg = array();
// --------------------------------------------------------------------
/**
* Constructor
*
* @return void
*/
public function __construct()
{
log_message('info', 'Trackback Class Initialized');
}
// --------------------------------------------------------------------
/**
* Send Trackback
*
* @param array
* @return bool
*/
public function send($tb_data)
{
if ( ! is_array($tb_data))
{
$this->set_error('The send() method must be passed an array');
return FALSE;
}
// Pre-process the Trackback Data
foreach (array('url', 'title', 'excerpt', 'blog_name', 'ping_url') as $item)
{
if ( ! isset($tb_data[$item]))
{
$this->set_error('Required item missing: '.$item);
return FALSE;
}
switch ($item)
{
case 'ping_url':
$$item = $this->extract_urls($tb_data[$item]);
break;
case 'excerpt':
$$item = $this->limit_characters($this->convert_xml(strip_tags(stripslashes($tb_data[$item]))));
break;
case 'url':
$$item = str_replace('-', '-', $this->convert_xml(strip_tags(stripslashes($tb_data[$item]))));
break;
default:
$$item = $this->convert_xml(strip_tags(stripslashes($tb_data[$item])));
break;
}
// Convert High ASCII Characters
if ($this->convert_ascii === TRUE && in_array($item, array('excerpt', 'title', 'blog_name'), TRUE))
{
$$item = $this->convert_ascii($$item);
}
}
// Build the Trackback data string
$charset = isset($tb_data['charset']) ? $tb_data['charset'] : $this->charset;
$data = 'url='.rawurlencode($url).'&title='.rawurlencode($title).'&blog_name='.rawurlencode($blog_name)
.'&excerpt='.rawurlencode($excerpt).'&charset='.rawurlencode($charset);
// Send Trackback(s)
$return = TRUE;
if (count($ping_url) > 0)
{
foreach ($ping_url as $url)
{
if ($this->process($url, $data) === FALSE)
{
$return = FALSE;
}
}
}
return $return;
}
// --------------------------------------------------------------------
/**
* Receive Trackback Data
*
* This function simply validates the incoming TB data.
* It returns FALSE on failure and TRUE on success.
* If the data is valid it is set to the $this->data array
* so that it can be inserted into a database.
*
* @return bool
*/
public function receive()
{
foreach (array('url', 'title', 'blog_name', 'excerpt') as $val)
{
if (empty($_POST[$val]))
{
$this->set_error('The following required POST variable is missing: '.$val);
return FALSE;
}
$this->data['charset'] = isset($_POST['charset']) ? strtoupper(trim($_POST['charset'])) : 'auto';
if ($val !== 'url' && MB_ENABLED === TRUE)
{
if (MB_ENABLED === TRUE)
{
$_POST[$val] = mb_convert_encoding($_POST[$val], $this->charset, $this->data['charset']);
}
elseif (ICONV_ENABLED === TRUE)
{
$_POST[$val] = @iconv($this->data['charset'], $this->charset.'//IGNORE', $_POST[$val]);
}
}
$_POST[$val] = ($val !== 'url') ? $this->convert_xml(strip_tags($_POST[$val])) : strip_tags($_POST[$val]);
if ($val === 'excerpt')
{
$_POST['excerpt'] = $this->limit_characters($_POST['excerpt']);
}
$this->data[$val] = $_POST[$val];
}
return TRUE;
}
// --------------------------------------------------------------------
/**
* Send Trackback Error Message
*
* Allows custom errors to be set. By default it
* sends the "incomplete information" error, as that's
* the most common one.
*
* @param string
* @return void
*/
public function send_error($message = 'Incomplete Information')
{
exit('<?xml version="1.0" encoding="utf-8"?'.">\n<response>\n<error>1</error>\n<message>".$message."</message>\n</response>");
}
// --------------------------------------------------------------------
/**
* Send Trackback Success Message
*
* This should be called when a trackback has been
* successfully received and inserted.
*
* @return void
*/
public function send_success()
{
exit('<?xml version="1.0" encoding="utf-8"?'.">\n<response>\n<error>0</error>\n</response>");
}
// --------------------------------------------------------------------
/**
* Fetch a particular item
*
* @param string
* @return string
*/
public function data($item)
{
return isset($this->data[$item]) ? $this->data[$item] : '';
}
// --------------------------------------------------------------------
/**
* Process Trackback
*
* Opens a socket connection and passes the data to
* the server. Returns TRUE on success, FALSE on failure
*
* @param string
* @param string
* @return bool
*/
public function process($url, $data)
{
$target = parse_url($url);
// Open the socket
if ( ! $fp = @fsockopen($target['host'], 80))
{
$this->set_error('Invalid Connection: '.$url);
return FALSE;
}
// Build the path
$path = isset($target['path']) ? $target['path'] : $url;
empty($target['query']) OR $path .= '?'.$target['query'];
// Add the Trackback ID to the data string
if ($id = $this->get_id($url))
{
$data = 'tb_id='.$id.'&'.$data;
}
// Transfer the data
fputs($fp, 'POST '.$path." HTTP/1.0\r\n");
fputs($fp, 'Host: '.$target['host']."\r\n");
fputs($fp, "Content-type: application/x-www-form-urlencoded\r\n");
fputs($fp, 'Content-length: '.strlen($data)."\r\n");
fputs($fp, "Connection: close\r\n\r\n");
fputs($fp, $data);
// Was it successful?
$this->response = '';
while ( ! feof($fp))
{
$this->response .= fgets($fp, 128);
}
@fclose($fp);
if (stripos($this->response, '<error>0</error>') === FALSE)
{
$message = preg_match('/<message>(.*?)<\/message>/is', $this->response, $match)
? trim($match[1])
: 'An unknown error was encountered';
$this->set_error($message);
return FALSE;
}
return TRUE;
}
// --------------------------------------------------------------------
/**
* Extract Trackback URLs
*
* This function lets multiple trackbacks be sent.
* It takes a string of URLs (separated by comma or
* space) and puts each URL into an array
*
* @param string
* @return string
*/
public function extract_urls($urls)
{
// Remove the pesky white space and replace with a comma, then replace doubles.
$urls = str_replace(',,', ',', preg_replace('/\s*(\S+)\s*/', '\\1,', $urls));
// Break into an array via commas and remove duplicates
$urls = array_unique(preg_split('/[,]/', rtrim($urls, ',')));
array_walk($urls, array($this, 'validate_url'));
return $urls;
}
// --------------------------------------------------------------------
/**
* Validate URL
*
* Simply adds "http://" if missing
*
* @param string
* @return void
*/
public function validate_url(&$url)
{
$url = trim($url);
if (strpos($url, 'http') !== 0)
{
$url = 'http://'.$url;
}
}
// --------------------------------------------------------------------
/**
* Find the Trackback URL's ID
*
* @param string
* @return string
*/
public function get_id($url)
{
$tb_id = '';
if (strpos($url, '?') !== FALSE)
{
$tb_array = explode('/', $url);
$tb_end = $tb_array[count($tb_array)-1];
if ( ! is_numeric($tb_end))
{
$tb_end = $tb_array[count($tb_array)-2];
}
$tb_array = explode('=', $tb_end);
$tb_id = $tb_array[count($tb_array)-1];
}
else
{
$url = rtrim($url, '/');
$tb_array = explode('/', $url);
$tb_id = $tb_array[count($tb_array)-1];
if ( ! is_numeric($tb_id))
{
$tb_id = $tb_array[count($tb_array)-2];
}
}
return ctype_digit((string) $tb_id) ? $tb_id : FALSE;
}
// --------------------------------------------------------------------
/**
* Convert Reserved XML characters to Entities
*
* @param string
* @return string
*/
public function convert_xml($str)
{
$temp = '__TEMP_AMPERSANDS__';
$str = preg_replace(array('/&#(\d+);/', '/&(\w+);/'), $temp.'\\1;', $str);
$str = str_replace(array('&', '<', '>', '"', "'", '-'),
array('&', '<', '>', '"', ''', '-'),
$str);
return preg_replace(array('/'.$temp.'(\d+);/', '/'.$temp.'(\w+);/'), array('&#\\1;', '&\\1;'), $str);
}
// --------------------------------------------------------------------
/**
* Character limiter
*
* Limits the string based on the character count. Will preserve complete words.
*
* @param string
* @param int
* @param string
* @return string
*/
public function limit_characters($str, $n = 500, $end_char = '…')
{
if (strlen($str) < $n)
{
return $str;
}
$str = preg_replace('/\s+/', ' ', str_replace(array("\r\n", "\r", "\n"), ' ', $str));
if (strlen($str) <= $n)
{
return $str;
}
$out = '';
foreach (explode(' ', trim($str)) as $val)
{
$out .= $val.' ';
if (strlen($out) >= $n)
{
return rtrim($out).$end_char;
}
}
}
// --------------------------------------------------------------------
/**
* High ASCII to Entities
*
* Converts Hight ascii text and MS Word special chars
* to character entities
*
* @param string
* @return string
*/
public function convert_ascii($str)
{
$count = 1;
$out = '';
$temp = array();
for ($i = 0, $s = strlen($str); $i < $s; $i++)
{
$ordinal = ord($str[$i]);
if ($ordinal < 128)
{
$out .= $str[$i];
}
else
{
if (count($temp) === 0)
{
$count = ($ordinal < 224) ? 2 : 3;
}
$temp[] = $ordinal;
if (count($temp) === $count)
{
$number = ($count === 3)
? (($temp[0] % 16) * 4096) + (($temp[1] % 64) * 64) + ($temp[2] % 64)
: (($temp[0] % 32) * 64) + ($temp[1] % 64);
$out .= '&#'.$number.';';
$count = 1;
$temp = array();
}
}
}
return $out;
}
// --------------------------------------------------------------------
/**
* Set error message
*
* @param string
* @return void
*/
public function set_error($msg)
{
log_message('error', $msg);
$this->error_msg[] = $msg;
}
// --------------------------------------------------------------------
/**
* Show error messages
*
* @param string
* @param string
* @return string
*/
public function display_errors($open = '<p>', $close = '</p>')
{
return (count($this->error_msg) > 0) ? $open.implode($close.$open, $this->error_msg).$close : '';
}
}
| {
"pile_set_name": "Github"
} |
// SPDX-License-Identifier: GPL-2.0
#include <errno.h>
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/ioctl.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <linux/fs.h>
static int set_immutable(const char *path, int immutable)
{
unsigned int flags;
int fd;
int rc;
int error;
fd = open(path, O_RDONLY);
if (fd < 0)
return fd;
rc = ioctl(fd, FS_IOC_GETFLAGS, &flags);
if (rc < 0) {
error = errno;
close(fd);
errno = error;
return rc;
}
if (immutable)
flags |= FS_IMMUTABLE_FL;
else
flags &= ~FS_IMMUTABLE_FL;
rc = ioctl(fd, FS_IOC_SETFLAGS, &flags);
error = errno;
close(fd);
errno = error;
return rc;
}
static int get_immutable(const char *path)
{
unsigned int flags;
int fd;
int rc;
int error;
fd = open(path, O_RDONLY);
if (fd < 0)
return fd;
rc = ioctl(fd, FS_IOC_GETFLAGS, &flags);
if (rc < 0) {
error = errno;
close(fd);
errno = error;
return rc;
}
close(fd);
if (flags & FS_IMMUTABLE_FL)
return 1;
return 0;
}
int main(int argc, char **argv)
{
const char *path;
char buf[5];
int fd, rc;
if (argc < 2) {
fprintf(stderr, "usage: %s <path>\n", argv[0]);
return EXIT_FAILURE;
}
path = argv[1];
/* attributes: EFI_VARIABLE_NON_VOLATILE |
* EFI_VARIABLE_BOOTSERVICE_ACCESS |
* EFI_VARIABLE_RUNTIME_ACCESS
*/
*(uint32_t *)buf = 0x7;
buf[4] = 0;
/* create a test variable */
fd = open(path, O_WRONLY | O_CREAT, 0600);
if (fd < 0) {
perror("open(O_WRONLY)");
return EXIT_FAILURE;
}
rc = write(fd, buf, sizeof(buf));
if (rc != sizeof(buf)) {
perror("write");
return EXIT_FAILURE;
}
close(fd);
rc = get_immutable(path);
if (rc < 0) {
perror("ioctl(FS_IOC_GETFLAGS)");
return EXIT_FAILURE;
} else if (rc) {
rc = set_immutable(path, 0);
if (rc < 0) {
perror("ioctl(FS_IOC_SETFLAGS)");
return EXIT_FAILURE;
}
}
fd = open(path, O_RDONLY);
if (fd < 0) {
perror("open");
return EXIT_FAILURE;
}
if (unlink(path) < 0) {
perror("unlink");
return EXIT_FAILURE;
}
rc = read(fd, buf, sizeof(buf));
if (rc > 0) {
fprintf(stderr, "reading from an unlinked variable "
"shouldn't be possible\n");
return EXIT_FAILURE;
}
return EXIT_SUCCESS;
}
| {
"pile_set_name": "Github"
} |
<?xml version="1.0" encoding="UTF-8"?>
<Scheme
LastUpgradeVersion = "1100"
version = "1.3">
<BuildAction
parallelizeBuildables = "YES"
buildImplicitDependencies = "YES">
<BuildActionEntries>
<BuildActionEntry
buildForAnalyzing = "YES"
buildForTesting = "YES"
buildForRunning = "YES"
buildForProfiling = "YES"
buildForArchiving = "YES">
<BuildableReference
BuildableIdentifier = "primary"
BlueprintIdentifier = "8217FBB9D1218C346C0781D0B8F2BBE8"
BuildableName = "common"
BlueprintName = "common"
ReferencedContainer = "container:Pods.xcodeproj">
</BuildableReference>
</BuildActionEntry>
</BuildActionEntries>
</BuildAction>
<TestAction
selectedDebuggerIdentifier = "Xcode.DebuggerFoundation.Debugger.LLDB"
selectedLauncherIdentifier = "Xcode.DebuggerFoundation.Launcher.LLDB"
shouldUseLaunchSchemeArgsEnv = "YES"
buildConfiguration = "Debug">
<AdditionalOptions>
</AdditionalOptions>
</TestAction>
<LaunchAction
selectedDebuggerIdentifier = "Xcode.DebuggerFoundation.Debugger.LLDB"
selectedLauncherIdentifier = "Xcode.DebuggerFoundation.Launcher.LLDB"
launchStyle = "0"
useCustomWorkingDirectory = "NO"
ignoresPersistentStateOnLaunch = "NO"
debugDocumentVersioning = "YES"
debugServiceExtension = "internal"
buildConfiguration = "Debug"
allowLocationSimulation = "YES">
<AdditionalOptions>
</AdditionalOptions>
</LaunchAction>
<ProfileAction
savedToolIdentifier = ""
useCustomWorkingDirectory = "NO"
debugDocumentVersioning = "YES"
buildConfiguration = "Release"
shouldUseLaunchSchemeArgsEnv = "YES">
</ProfileAction>
<AnalyzeAction
buildConfiguration = "Debug">
</AnalyzeAction>
<ArchiveAction
buildConfiguration = "Release"
revealArchiveInOrganizer = "YES">
</ArchiveAction>
</Scheme>
| {
"pile_set_name": "Github"
} |
/*
* drivers/net/ethernet/mellanox/mlxsw/switchib.c
* Copyright (c) 2016 Mellanox Technologies. All rights reserved.
* Copyright (c) 2016 Elad Raz <[email protected]>
*
* 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 names of the copyright holders nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* Alternatively, this software may be distributed under the terms of the
* GNU General Public License ("GPL") version 2 as published by the Free
* Software Foundation.
*
* 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.
*/
#include <linux/kernel.h>
#include <linux/module.h>
#include <linux/types.h>
#include <linux/pci.h>
#include <linux/netdevice.h>
#include <linux/etherdevice.h>
#include <linux/slab.h>
#include <linux/device.h>
#include <linux/skbuff.h>
#include <linux/if_vlan.h>
#include <net/switchdev.h>
#include "pci.h"
#include "core.h"
#include "reg.h"
#include "port.h"
#include "trap.h"
#include "txheader.h"
#include "ib.h"
static const char mlxsw_sib_driver_name[] = "mlxsw_switchib";
static const char mlxsw_sib2_driver_name[] = "mlxsw_switchib2";
struct mlxsw_sib_port;
struct mlxsw_sib {
struct mlxsw_sib_port **ports;
struct mlxsw_core *core;
const struct mlxsw_bus_info *bus_info;
};
struct mlxsw_sib_port {
struct mlxsw_sib *mlxsw_sib;
u8 local_port;
struct {
u8 module;
} mapping;
};
/* tx_v1_hdr_version
* Tx header version.
* Must be set to 1.
*/
MLXSW_ITEM32(tx_v1, hdr, version, 0x00, 28, 4);
/* tx_v1_hdr_ctl
* Packet control type.
* 0 - Ethernet control (e.g. EMADs, LACP)
* 1 - Ethernet data
*/
MLXSW_ITEM32(tx_v1, hdr, ctl, 0x00, 26, 2);
/* tx_v1_hdr_proto
* Packet protocol type. Must be set to 1 (Ethernet).
*/
MLXSW_ITEM32(tx_v1, hdr, proto, 0x00, 21, 3);
/* tx_v1_hdr_swid
* Switch partition ID. Must be set to 0.
*/
MLXSW_ITEM32(tx_v1, hdr, swid, 0x00, 12, 3);
/* tx_v1_hdr_control_tclass
* Indicates if the packet should use the control TClass and not one
* of the data TClasses.
*/
MLXSW_ITEM32(tx_v1, hdr, control_tclass, 0x00, 6, 1);
/* tx_v1_hdr_port_mid
* Destination local port for unicast packets.
* Destination multicast ID for multicast packets.
*
* Control packets are directed to a specific egress port, while data
* packets are transmitted through the CPU port (0) into the switch partition,
* where forwarding rules are applied.
*/
MLXSW_ITEM32(tx_v1, hdr, port_mid, 0x04, 16, 16);
/* tx_v1_hdr_type
* 0 - Data packets
* 6 - Control packets
*/
MLXSW_ITEM32(tx_v1, hdr, type, 0x0C, 0, 4);
static void
mlxsw_sib_tx_v1_hdr_construct(struct sk_buff *skb,
const struct mlxsw_tx_info *tx_info)
{
char *txhdr = skb_push(skb, MLXSW_TXHDR_LEN);
memset(txhdr, 0, MLXSW_TXHDR_LEN);
mlxsw_tx_v1_hdr_version_set(txhdr, MLXSW_TXHDR_VERSION_1);
mlxsw_tx_v1_hdr_ctl_set(txhdr, MLXSW_TXHDR_ETH_CTL);
mlxsw_tx_v1_hdr_proto_set(txhdr, MLXSW_TXHDR_PROTO_ETH);
mlxsw_tx_v1_hdr_swid_set(txhdr, 0);
mlxsw_tx_v1_hdr_control_tclass_set(txhdr, 1);
mlxsw_tx_v1_hdr_port_mid_set(txhdr, tx_info->local_port);
mlxsw_tx_v1_hdr_type_set(txhdr, MLXSW_TXHDR_TYPE_CONTROL);
}
static int
mlxsw_sib_port_admin_status_set(struct mlxsw_sib_port *mlxsw_sib_port,
bool is_up)
{
struct mlxsw_sib *mlxsw_sib = mlxsw_sib_port->mlxsw_sib;
char paos_pl[MLXSW_REG_PAOS_LEN];
mlxsw_reg_paos_pack(paos_pl, mlxsw_sib_port->local_port,
is_up ? MLXSW_PORT_ADMIN_STATUS_UP :
MLXSW_PORT_ADMIN_STATUS_DOWN);
return mlxsw_reg_write(mlxsw_sib->core, MLXSW_REG(paos), paos_pl);
}
static int mlxsw_sib_port_mtu_set(struct mlxsw_sib_port *mlxsw_sib_port,
u16 mtu)
{
struct mlxsw_sib *mlxsw_sib = mlxsw_sib_port->mlxsw_sib;
char pmtu_pl[MLXSW_REG_PMTU_LEN];
int max_mtu;
int err;
mlxsw_reg_pmtu_pack(pmtu_pl, mlxsw_sib_port->local_port, 0);
err = mlxsw_reg_query(mlxsw_sib->core, MLXSW_REG(pmtu), pmtu_pl);
if (err)
return err;
max_mtu = mlxsw_reg_pmtu_max_mtu_get(pmtu_pl);
if (mtu > max_mtu)
return -EINVAL;
mlxsw_reg_pmtu_pack(pmtu_pl, mlxsw_sib_port->local_port, mtu);
return mlxsw_reg_write(mlxsw_sib->core, MLXSW_REG(pmtu), pmtu_pl);
}
static int mlxsw_sib_port_set(struct mlxsw_sib_port *mlxsw_sib_port, u8 port)
{
struct mlxsw_sib *mlxsw_sib = mlxsw_sib_port->mlxsw_sib;
char plib_pl[MLXSW_REG_PLIB_LEN] = {0};
int err;
mlxsw_reg_plib_local_port_set(plib_pl, mlxsw_sib_port->local_port);
mlxsw_reg_plib_ib_port_set(plib_pl, port);
err = mlxsw_reg_write(mlxsw_sib->core, MLXSW_REG(plib), plib_pl);
return err;
}
static int mlxsw_sib_port_swid_set(struct mlxsw_sib_port *mlxsw_sib_port,
u8 swid)
{
struct mlxsw_sib *mlxsw_sib = mlxsw_sib_port->mlxsw_sib;
char pspa_pl[MLXSW_REG_PSPA_LEN];
mlxsw_reg_pspa_pack(pspa_pl, swid, mlxsw_sib_port->local_port);
return mlxsw_reg_write(mlxsw_sib->core, MLXSW_REG(pspa), pspa_pl);
}
static int mlxsw_sib_port_module_info_get(struct mlxsw_sib *mlxsw_sib,
u8 local_port, u8 *p_module,
u8 *p_width)
{
char pmlp_pl[MLXSW_REG_PMLP_LEN];
int err;
mlxsw_reg_pmlp_pack(pmlp_pl, local_port);
err = mlxsw_reg_query(mlxsw_sib->core, MLXSW_REG(pmlp), pmlp_pl);
if (err)
return err;
*p_module = mlxsw_reg_pmlp_module_get(pmlp_pl, 0);
*p_width = mlxsw_reg_pmlp_width_get(pmlp_pl);
return 0;
}
static int mlxsw_sib_port_speed_set(struct mlxsw_sib_port *mlxsw_sib_port,
u16 speed, u16 width)
{
struct mlxsw_sib *mlxsw_sib = mlxsw_sib_port->mlxsw_sib;
char ptys_pl[MLXSW_REG_PTYS_LEN];
mlxsw_reg_ptys_ib_pack(ptys_pl, mlxsw_sib_port->local_port, speed,
width);
return mlxsw_reg_write(mlxsw_sib->core, MLXSW_REG(ptys), ptys_pl);
}
static bool mlxsw_sib_port_created(struct mlxsw_sib *mlxsw_sib, u8 local_port)
{
return mlxsw_sib->ports[local_port] != NULL;
}
static int __mlxsw_sib_port_create(struct mlxsw_sib *mlxsw_sib, u8 local_port,
u8 module, u8 width)
{
struct mlxsw_sib_port *mlxsw_sib_port;
int err;
mlxsw_sib_port = kzalloc(sizeof(*mlxsw_sib_port), GFP_KERNEL);
if (!mlxsw_sib_port)
return -ENOMEM;
mlxsw_sib_port->mlxsw_sib = mlxsw_sib;
mlxsw_sib_port->local_port = local_port;
mlxsw_sib_port->mapping.module = module;
err = mlxsw_sib_port_swid_set(mlxsw_sib_port, 0);
if (err) {
dev_err(mlxsw_sib->bus_info->dev, "Port %d: Failed to set SWID\n",
mlxsw_sib_port->local_port);
goto err_port_swid_set;
}
/* Expose the IB port number as it's front panel name */
err = mlxsw_sib_port_set(mlxsw_sib_port, module + 1);
if (err) {
dev_err(mlxsw_sib->bus_info->dev, "Port %d: Failed to set IB port\n",
mlxsw_sib_port->local_port);
goto err_port_ib_set;
}
/* Supports all speeds from SDR to FDR (bitmask) and support bus width
* of 1x, 2x and 4x (3 bits bitmask)
*/
err = mlxsw_sib_port_speed_set(mlxsw_sib_port,
MLXSW_REG_PTYS_IB_SPEED_EDR - 1,
BIT(3) - 1);
if (err) {
dev_err(mlxsw_sib->bus_info->dev, "Port %d: Failed to set speed\n",
mlxsw_sib_port->local_port);
goto err_port_speed_set;
}
/* Change to the maximum MTU the device supports, the SMA will take
* care of the active MTU
*/
err = mlxsw_sib_port_mtu_set(mlxsw_sib_port, MLXSW_IB_DEFAULT_MTU);
if (err) {
dev_err(mlxsw_sib->bus_info->dev, "Port %d: Failed to set MTU\n",
mlxsw_sib_port->local_port);
goto err_port_mtu_set;
}
err = mlxsw_sib_port_admin_status_set(mlxsw_sib_port, true);
if (err) {
dev_err(mlxsw_sib->bus_info->dev, "Port %d: Failed to change admin state to UP\n",
mlxsw_sib_port->local_port);
goto err_port_admin_set;
}
mlxsw_core_port_ib_set(mlxsw_sib->core, mlxsw_sib_port->local_port,
mlxsw_sib_port);
mlxsw_sib->ports[local_port] = mlxsw_sib_port;
return 0;
err_port_admin_set:
err_port_mtu_set:
err_port_speed_set:
err_port_ib_set:
mlxsw_sib_port_swid_set(mlxsw_sib_port, MLXSW_PORT_SWID_DISABLED_PORT);
err_port_swid_set:
kfree(mlxsw_sib_port);
return err;
}
static int mlxsw_sib_port_create(struct mlxsw_sib *mlxsw_sib, u8 local_port,
u8 module, u8 width)
{
int err;
err = mlxsw_core_port_init(mlxsw_sib->core, local_port);
if (err) {
dev_err(mlxsw_sib->bus_info->dev, "Port %d: Failed to init core port\n",
local_port);
return err;
}
err = __mlxsw_sib_port_create(mlxsw_sib, local_port, module, width);
if (err)
goto err_port_create;
return 0;
err_port_create:
mlxsw_core_port_fini(mlxsw_sib->core, local_port);
return err;
}
static void __mlxsw_sib_port_remove(struct mlxsw_sib *mlxsw_sib, u8 local_port)
{
struct mlxsw_sib_port *mlxsw_sib_port = mlxsw_sib->ports[local_port];
mlxsw_core_port_clear(mlxsw_sib->core, local_port, mlxsw_sib);
mlxsw_sib->ports[local_port] = NULL;
mlxsw_sib_port_admin_status_set(mlxsw_sib_port, false);
mlxsw_sib_port_swid_set(mlxsw_sib_port, MLXSW_PORT_SWID_DISABLED_PORT);
kfree(mlxsw_sib_port);
}
static void mlxsw_sib_port_remove(struct mlxsw_sib *mlxsw_sib, u8 local_port)
{
__mlxsw_sib_port_remove(mlxsw_sib, local_port);
mlxsw_core_port_fini(mlxsw_sib->core, local_port);
}
static void mlxsw_sib_ports_remove(struct mlxsw_sib *mlxsw_sib)
{
int i;
for (i = 1; i < MLXSW_PORT_MAX_IB_PORTS; i++)
if (mlxsw_sib_port_created(mlxsw_sib, i))
mlxsw_sib_port_remove(mlxsw_sib, i);
kfree(mlxsw_sib->ports);
}
static int mlxsw_sib_ports_create(struct mlxsw_sib *mlxsw_sib)
{
size_t alloc_size;
u8 module, width;
int i;
int err;
alloc_size = sizeof(struct mlxsw_sib_port *) * MLXSW_PORT_MAX_IB_PORTS;
mlxsw_sib->ports = kzalloc(alloc_size, GFP_KERNEL);
if (!mlxsw_sib->ports)
return -ENOMEM;
for (i = 1; i < MLXSW_PORT_MAX_IB_PORTS; i++) {
err = mlxsw_sib_port_module_info_get(mlxsw_sib, i, &module,
&width);
if (err)
goto err_port_module_info_get;
if (!width)
continue;
err = mlxsw_sib_port_create(mlxsw_sib, i, module, width);
if (err)
goto err_port_create;
}
return 0;
err_port_create:
err_port_module_info_get:
for (i--; i >= 1; i--)
if (mlxsw_sib_port_created(mlxsw_sib, i))
mlxsw_sib_port_remove(mlxsw_sib, i);
kfree(mlxsw_sib->ports);
return err;
}
static void
mlxsw_sib_pude_ib_event_func(struct mlxsw_sib_port *mlxsw_sib_port,
enum mlxsw_reg_pude_oper_status status)
{
if (status == MLXSW_PORT_OPER_STATUS_UP)
pr_info("ib link for port %d - up\n",
mlxsw_sib_port->mapping.module + 1);
else
pr_info("ib link for port %d - down\n",
mlxsw_sib_port->mapping.module + 1);
}
static void mlxsw_sib_pude_event_func(const struct mlxsw_reg_info *reg,
char *pude_pl, void *priv)
{
struct mlxsw_sib *mlxsw_sib = priv;
struct mlxsw_sib_port *mlxsw_sib_port;
enum mlxsw_reg_pude_oper_status status;
u8 local_port;
local_port = mlxsw_reg_pude_local_port_get(pude_pl);
mlxsw_sib_port = mlxsw_sib->ports[local_port];
if (!mlxsw_sib_port) {
dev_warn(mlxsw_sib->bus_info->dev, "Port %d: Link event received for non-existent port\n",
local_port);
return;
}
status = mlxsw_reg_pude_oper_status_get(pude_pl);
mlxsw_sib_pude_ib_event_func(mlxsw_sib_port, status);
}
static const struct mlxsw_listener mlxsw_sib_listener[] = {
MLXSW_EVENTL(mlxsw_sib_pude_event_func, PUDE, EMAD),
};
static int mlxsw_sib_taps_init(struct mlxsw_sib *mlxsw_sib)
{
int i;
int err;
for (i = 0; i < ARRAY_SIZE(mlxsw_sib_listener); i++) {
err = mlxsw_core_trap_register(mlxsw_sib->core,
&mlxsw_sib_listener[i],
mlxsw_sib);
if (err)
goto err_rx_listener_register;
}
return 0;
err_rx_listener_register:
for (i--; i >= 0; i--) {
mlxsw_core_trap_unregister(mlxsw_sib->core,
&mlxsw_sib_listener[i],
mlxsw_sib);
}
return err;
}
static void mlxsw_sib_traps_fini(struct mlxsw_sib *mlxsw_sib)
{
int i;
for (i = 0; i < ARRAY_SIZE(mlxsw_sib_listener); i++) {
mlxsw_core_trap_unregister(mlxsw_sib->core,
&mlxsw_sib_listener[i], mlxsw_sib);
}
}
static int mlxsw_sib_basic_trap_groups_set(struct mlxsw_core *mlxsw_core)
{
char htgt_pl[MLXSW_REG_HTGT_LEN];
mlxsw_reg_htgt_pack(htgt_pl, MLXSW_REG_HTGT_TRAP_GROUP_EMAD,
MLXSW_REG_HTGT_INVALID_POLICER,
MLXSW_REG_HTGT_DEFAULT_PRIORITY,
MLXSW_REG_HTGT_DEFAULT_TC);
mlxsw_reg_htgt_swid_set(htgt_pl, MLXSW_PORT_SWID_ALL_SWIDS);
mlxsw_reg_htgt_local_path_rdq_set(htgt_pl,
MLXSW_REG_HTGT_LOCAL_PATH_RDQ_SIB_EMAD);
return mlxsw_reg_write(mlxsw_core, MLXSW_REG(htgt), htgt_pl);
}
static int mlxsw_sib_init(struct mlxsw_core *mlxsw_core,
const struct mlxsw_bus_info *mlxsw_bus_info)
{
struct mlxsw_sib *mlxsw_sib = mlxsw_core_driver_priv(mlxsw_core);
int err;
mlxsw_sib->core = mlxsw_core;
mlxsw_sib->bus_info = mlxsw_bus_info;
err = mlxsw_sib_ports_create(mlxsw_sib);
if (err) {
dev_err(mlxsw_sib->bus_info->dev, "Failed to create ports\n");
return err;
}
err = mlxsw_sib_taps_init(mlxsw_sib);
if (err) {
dev_err(mlxsw_sib->bus_info->dev, "Failed to set traps\n");
goto err_traps_init_err;
}
return 0;
err_traps_init_err:
mlxsw_sib_ports_remove(mlxsw_sib);
return err;
}
static void mlxsw_sib_fini(struct mlxsw_core *mlxsw_core)
{
struct mlxsw_sib *mlxsw_sib = mlxsw_core_driver_priv(mlxsw_core);
mlxsw_sib_traps_fini(mlxsw_sib);
mlxsw_sib_ports_remove(mlxsw_sib);
}
static struct mlxsw_config_profile mlxsw_sib_config_profile = {
.used_max_system_port = 1,
.max_system_port = 48000,
.used_max_ib_mc = 1,
.max_ib_mc = 27,
.used_max_pkey = 1,
.max_pkey = 32,
.swid_config = {
{
.used_type = 1,
.type = MLXSW_PORT_SWID_TYPE_IB,
}
},
.resource_query_enable = 0,
};
static struct mlxsw_driver mlxsw_sib_driver = {
.kind = mlxsw_sib_driver_name,
.priv_size = sizeof(struct mlxsw_sib),
.init = mlxsw_sib_init,
.fini = mlxsw_sib_fini,
.basic_trap_groups_set = mlxsw_sib_basic_trap_groups_set,
.txhdr_construct = mlxsw_sib_tx_v1_hdr_construct,
.txhdr_len = MLXSW_TXHDR_LEN,
.profile = &mlxsw_sib_config_profile,
};
static struct mlxsw_driver mlxsw_sib2_driver = {
.kind = mlxsw_sib2_driver_name,
.priv_size = sizeof(struct mlxsw_sib),
.init = mlxsw_sib_init,
.fini = mlxsw_sib_fini,
.basic_trap_groups_set = mlxsw_sib_basic_trap_groups_set,
.txhdr_construct = mlxsw_sib_tx_v1_hdr_construct,
.txhdr_len = MLXSW_TXHDR_LEN,
.profile = &mlxsw_sib_config_profile,
};
static const struct pci_device_id mlxsw_sib_pci_id_table[] = {
{PCI_VDEVICE(MELLANOX, PCI_DEVICE_ID_MELLANOX_SWITCHIB), 0},
{0, },
};
static struct pci_driver mlxsw_sib_pci_driver = {
.name = mlxsw_sib_driver_name,
.id_table = mlxsw_sib_pci_id_table,
};
static const struct pci_device_id mlxsw_sib2_pci_id_table[] = {
{PCI_VDEVICE(MELLANOX, PCI_DEVICE_ID_MELLANOX_SWITCHIB2), 0},
{0, },
};
static struct pci_driver mlxsw_sib2_pci_driver = {
.name = mlxsw_sib2_driver_name,
.id_table = mlxsw_sib2_pci_id_table,
};
static int __init mlxsw_sib_module_init(void)
{
int err;
err = mlxsw_core_driver_register(&mlxsw_sib_driver);
if (err)
return err;
err = mlxsw_core_driver_register(&mlxsw_sib2_driver);
if (err)
goto err_sib2_driver_register;
err = mlxsw_pci_driver_register(&mlxsw_sib_pci_driver);
if (err)
goto err_sib_pci_driver_register;
err = mlxsw_pci_driver_register(&mlxsw_sib2_pci_driver);
if (err)
goto err_sib2_pci_driver_register;
return 0;
err_sib2_pci_driver_register:
mlxsw_pci_driver_unregister(&mlxsw_sib_pci_driver);
err_sib_pci_driver_register:
mlxsw_core_driver_unregister(&mlxsw_sib2_driver);
err_sib2_driver_register:
mlxsw_core_driver_unregister(&mlxsw_sib_driver);
return err;
}
static void __exit mlxsw_sib_module_exit(void)
{
mlxsw_pci_driver_unregister(&mlxsw_sib2_pci_driver);
mlxsw_pci_driver_unregister(&mlxsw_sib_pci_driver);
mlxsw_core_driver_unregister(&mlxsw_sib2_driver);
mlxsw_core_driver_unregister(&mlxsw_sib_driver);
}
module_init(mlxsw_sib_module_init);
module_exit(mlxsw_sib_module_exit);
MODULE_LICENSE("Dual BSD/GPL");
MODULE_AUTHOR("Elad Raz <eladr@@mellanox.com>");
MODULE_DESCRIPTION("Mellanox SwitchIB and SwitchIB-2 driver");
MODULE_ALIAS("mlxsw_switchib2");
MODULE_DEVICE_TABLE(pci, mlxsw_sib_pci_id_table);
MODULE_DEVICE_TABLE(pci, mlxsw_sib2_pci_id_table);
| {
"pile_set_name": "Github"
} |
/*
* Copyright (C) 2017-2019 Dremio Corporation
*
* 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.dremio.common.nodes;
import java.util.Collection;
import com.dremio.exec.proto.CoordinationProtos.NodeEndpoint;
/**
* Interface that returns a list of Dremio nodes.
*/
public interface NodeProvider {
/**
* Get a list of nodes.
* @return The list of nodes associated with this NodeProvider.
*/
Collection<NodeEndpoint> getNodes();
}
| {
"pile_set_name": "Github"
} |
<?xml version="1.0" encoding="utf-8"?>
<extension type="component" version="3.1" method="upgrade">
<name>com_categories</name>
<author>Joomla! Project</author>
<creationDate>December 2007</creationDate>
<copyright>(C) 2005 - 2020 Open Source Matters. All rights reserved.</copyright>
<license>GNU General Public License version 2 or later; see LICENSE.txt</license>
<authorEmail>[email protected]</authorEmail>
<authorUrl>www.joomla.org</authorUrl>
<version>3.0.0</version>
<description>COM_CATEGORIES_XML_DESCRIPTION</description>
<administration>
<files folder="admin">
<filename>categories.php</filename>
<filename>config.xml</filename>
<filename>controller.php</filename>
<folder>controllers</folder>
<folder>helpers</folder>
<folder>models</folder>
<folder>views</folder>
</files>
<languages folder="admin">
<language tag="en-GB">language/en-GB.com_categories.ini</language>
<language tag="en-GB">language/en-GB.com_categories.sys.ini</language>
</languages>
</administration>
</extension>
| {
"pile_set_name": "Github"
} |
This directory contains the Passenger main source code. There are source files written in various programming languages, including C++, Ruby and Javascript. Browse to a subdirectory for a README which explains that particular subdirectory.
If you aren't familiar with the Passenger codebase then we encourage you to read these first:
* [Contributors Guide](https://github.com/phusion/passenger/blob/master/CONTRIBUTING.md)
* [Design & Architecture](https://www.phusionpassenger.com/documentation/Design%20and%20Architecture.html)
* [Code walkthrough](http://vimeo.com/phusionnl/review/98027409/03ba678684)
| {
"pile_set_name": "Github"
} |
/*
* Copyright 2014 - 2020 Blazebit.
*
* 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.blazebit.persistence.integration.hibernate;
import com.blazebit.persistence.spi.DbmsDialect;
import org.hibernate.dialect.Dialect;
import org.hibernate.dialect.pagination.LimitHandler;
/**
* @author Christian Beikov
* @since 1.2.0
*/
public class Hibernate5LimitHandlingDialect extends Hibernate5DelegatingDialect {
private final DbmsDialect dbmsDialect;
public Hibernate5LimitHandlingDialect(Dialect delegate, DbmsDialect dbmsDialect) {
super(delegate);
this.dbmsDialect = dbmsDialect;
}
@Override
public LimitHandler getLimitHandler() {
return new Hibernate5LimitHandler(this, dbmsDialect);
}
}
| {
"pile_set_name": "Github"
} |
Red Pants
While writers whose business it is to be witty
often fail to produce, grave authors occasionally
are mirthful when laughter is farthest from their
minds. From a lifetime of undisciplined reading with
innocent pencil in hand and malice prepense in mind,
I have gleaned a harvest of what I am pleased to denominate
Red Pants items, a sampling of which follows.
My designation derives from a splash of vivid
writing in Francis Thompson's A Corymbus for Autumn
in which he proclaims how “day's dying dragon”
was
Panting red pants into the West.
In this trousers category, Thompson must share the
limelight with Coleridge by virtue of the line in Kubla
Khan :
As if this earth in fast thick pants were breathing.
Even Shelley may stake a claim, if only in the pajama
division of this sector, thanks to his description in
Epipsychidion of how
... the slow, silent night
Is measured by the pants of their calm sleep.
Since everthing is to be found in Shakespeare, it is not
surprising that on at least two occasions the Board has
contributed his own Red Pants nuggets. In Antony and
Cleopatra (Act IV, Scene VIII, lines 14 et seq .) Antony
commands the wounded Scarus to
... leap thou, attire and all,
Through proof of harness to my heart, and there
Ride on the pants triumphing.
And in Othello (Act II, Scene I, line 80) Cassio utters
the fervent prayer that Othello might
Make love's quick pants in Desdemona's arms.
A variation on this theme occurs in Alba de Céspedes'
The Secret (translated from the Italian by Isabel
Quigly: Simon and Schuster, New York, 1958, page
114) where she confides that “I still had a whole afternoon
before me to spend, and I used it to tidy up my
drawers....” One may well wonder what Miss Stowe
had in mind when, in Uncle Tom's Cabin (Chapter 5),
she narrates how “Mrs. Shelby stood like one stricken.
Finally, turning to her toilet, she rested her face in her
hands, and gave a sort of groan.” In this same vein, the
mirthless Milton adds his bit to the general hilarity of
nations when, in describing Mount Etna in Book I of
Paradise Lost (lines 236-7) he penned
And leave a singed bottom all involved
With stench and smoke: ...
And in Chapter VI of Vanity Fair , when Blenkinsop,
the housekeeper, sought to console Amelia for Joe
Sedley's jilting of her dear Rebecca, Thackeray confides
(indelicately?) that Amelia wept confidentially on
the housekeeper's shoulder “and relieved herself a good
deal.”
Chuckles often emanate from the British employment
of a term in a sense at variance with American
usage. There is that oft-quoted example, near the
opening of Trial by Jury , where Defendant asks, “Is
this the Court of the Exchequer?” and having been
assured that it was, Defendant (aside) commands himself
to “Be firm, be firm, my pecker.” The British, of
course, do not giggle at this bit of Gilbertian dialogue,
since to them pecker means `courage,' as in the phrase
“to keep your pecker up.” Two of the more common
examples of British-American divergence of usage are
screw and knock up . In Vanity Fair (Chapter 39), the
niggardly Sir Pitt was not nearly the aerial acrobat
your American sophomore might fancy him to be
when he “screwed his tenants by letter.” He was simply
making extortionate exactions upon his wretched lessees.
Similarly, when in Chapter XXXIV of the same
novel, Mrs. Bute reminds her husband that “You'd have
been screwed in goal, Bute, if I had not kept your
money,” she was not speaking of pleasures deferred. In
Bleak House (Chapter XXVII) Grandfather
Smallweed, referring to Mr. George, warns Mr.
Tulkinghorn that “I have him periodically in a vice. I'll
twist him, sir. I'll screw him, sir.” In Kipling's The
Light That Failed (Chapter XIII), Torpenhow urges
Dick to attend a party that night, “We shall be half
screwed before the morning,” is his dismal sales pitch
to Dick.
In Chapter VI of Vanity Fair , Thackeray reports
on Joe Sedley's drunken avowal to wed Becky Sharp the
next morning, even if he had to “knock up the Archbishop
of Canterbury at Lambeth,” in order to have
him in readiness to perform the ceremony. In Great
Expectations (Chapter VI), we learn how “... Mr.
Whopsle, being knocked up, was in such a very bad
temper.” And who could blame him?
Many a raucous snigger has been sniggered from
the pure-minded use of a word that suggests unmentionable
parts of the human body. It does not take a
too-wicked mind to read into such terms meanings of a
lewd nature. Who can, for instance, blame a youth
with but a mildly evil disposition from guffawing
when he reads in Pater's Marius The Epicurean (Chapter
V) a reference to Apuleius' The Golden Ass noting
that “all through the book, there is an unmistakably
real feeling for asses ...”? In Scott's The Bride of
Lammermoor (Chapter VII), one reads about a boy
“cudgelling an ass,” and one goes back over the passage
to reassure himself that it does not contain a typographical
error for “cuddling.”
One may be indulged a giggle even though he is
sure that Isak Dinesen did not intend an impropriety
when she recorded in Out of Africa (Part V, Chapter
4) how “Fathima's big white cock came strutting up
before me.” And one is certain that Kenneth Rexroth,
in his American Poetry in the Twentieth Century
(Herder and Herder, N.Y., 1971) did not intend to hint
at closet biographical matter when, in Chapter I, he
wrote that “Whitman's poems are full of men doing
things together,” or, later in the same chapter, when he
referred to “Whitman's joyous workmen swinging their
tools in the open air.” College freshman still read with
flendish glee the first line in Canto I of Spenser's The
Faerie Queene (and never mind the title!) that tells
how
A Gentle Knight was pricking on the plaine.
In his poem Mr Nixon (from Hugh Selwyn Mauberley ),
Ezra Pound's Mr. Nixon advises kindly
Don't kick against the pricks,
although the identities of the latter are not divulged.
One is entitled to speculate on what outrageous
proposal the narrator had made in Proust's Remembrance
of Things Past, Vol. 2—Cities of the Plain
(translated by C. K. Scott Moncrieff—Modern Library,
N.Y., 1934, Page 90) to cause the Duchess to say,
“Apart from your balls, can't I be of any use to you?”
There is a famous letter penned by Rupert Brooke to
his friend, Edward Marsh, from somewhere near Fiji
(p. 463 of A Treasury of the World's Great Letters ,
Simon and Schuster, N.Y., 1940) in which he relates
how he sends his native boy up a palm tree, where he
“cuts off a couple of vast nuts ...” (macho victim not
disclosed). In the first chapter of Uncle Tom's Cabin ,
Miss Stowe offers a dialogue between Haley and Mr.
Shelby, part of which goes, “ `Well,' said Haley, after
they had both silently picked their nuts for a season,
`what do you say?' ” In Bleak House (Chapter XXIV)
Dickens may cause some readers to blush when he
wrote of Mr. George's blush that “He reddened a little
through his brown.”
We must move ineluctably to a consideration of
perfectly reputable words which, having acquired sexual
connotations, cause adolescent—and often adult—
hilarity, even when read by a person of only mildly
prurient mind. In Forster's A Passage to India (Chapter
XXXI) a vivid picture is created by the sentence
“Tangles like this still interrupted their intercourse.”
Pages later (Chapter XXXVII), it is acknowledged that
“He, too, felt that this was their last free intercourse.”
Apparently from then on, it was going to have to be
cash or credit card only. In The Bride of Lammermoor
(Chapter V), we are informed that the heroine “placed
certain restrictions on their intercourse,” a limitation
that might have been more usefully set in that same
author's Rob Roy (Chapter VII) where we are told of
the chance that the narrator and Miss Vernon might be
“thrown into very close and frequent intercourse.”
A variation of this theme is found in Robert
Browning's The Flight of the Duchess (Section V):
—Not he! For in Paris they told the elf
Our rough North land was the Land of Lays,
even though it is generally acknowledged that Paris is
número uno in this area of human activity.
More picturesque are the references to erections.
An arresting one occurs in A Passage to India (Chapter
XXI) in which Forster describes a small building as “a
flimsy and frivolous erection,” while in The Mayor of
Casterbridge (Chapter XVI) the Mayor himself “beheld
the unattractive exterior of Farfrae's erection.” A
phrase can paint an astonishing picture for the reader.
Consider Dickens' sharp image in Bleak House (Chapter
LIV) when he describes how “Sir Leicester leans
back in his chair, and breathlessly ejaculates.... ”
Or, in Nicholas Nickleby (Chapter XLVII), where that
admirable novelist graphically portrays how old Arthur
Gride “again raised his hands, again chuckled,
and again ejaculated.” And in his short tale, Lionizing ,
Edgar Allan Poe is quite candid in describing the reaction
of one of his characters: “ ` Admirable! ' he ejaculated,
thrown quite off his guard by the beauty of the
manoeuvre.”
Alas for perfectly lovely words that acquire pejorative
meanings over the years! Earlier in this century,
pansy became a derogatory epithet to describe an effete
male, thereby cheapening forever lines like Shelley's
noble image in Adonais (verse XXXIII):
His head was bound with pansies over-blown,
not to mention Poe's odd allusion in For Annie :
With rue and the beautiful Puritan pansies.
Or, more slap-stickish, E.F. Benson's action picture in
Lucia in London (Chapter 8): “Georgie stepped on a
beautiful pansy.”
Of more recent vintage is gay . Nobody used to
snicker at Chaucer's line (No. 5818) in The Prologe of
the Wyf of Bathe , in which that harried dame asks:
Why is my neghebores wif so gay?
In his poem The Menagerie , one of William
Vaughan Moody's characters advises:
If nature made you so graceful, don't get gay,
while in Othello (ah, the Bard again!) in his dialogue
with Desdemona and Emilia on the praise of women,
Iago refers to the kind that
Never lack'd gold, and yet went never gay.
(Act II, Scene I, line 150)
And what in the world is one to make of William
Butler Yeats's startling revelation in his poem Lapis
Lazuli (from Last Poems ) that
They know that Hamlet and Lear are gay.?
Indeed it is an amusing, albeit utterly wasteful
pastime to pursue the quest for Red Pants examples.
May good cess befall all such quixotically misguided
readers! One caveat: never assume blithely that an odd
word or suspicious phrase is as lubricious as it sounds.
In The Bride of Lammermoor (Chapter VI) Bucklaw
vows, “I will chop them off with my whinger,” and one
feels quite let down when he learns that a whinger is
but a whinyard, which is merely a short sword.
“Turning a corner of the Mazza Gallerie into a women's
tennis store, I was startled to see ... hordes of giggling high
school girls ... ” [From an article by Dorothy Gilliam in
the Washington Post , . Submitted by .]
LIGHT REFRACTIONS
If you are a fan of old-fashioned jazz—what is now
known as “traditional” or “trad” jazz—you are familiar
with one of the standard “jump tunes” of the
genre—a tune most commonly called Muskrat Ramble .
Even if you are not a fan, you must have heard it
as least a dozen times. It is the one that goes, “Dah!
Dah! Dah! Dah! da-dat-dat-dah! Da-de-da-de-da-de-dat-dat-dah
! da-de-da-de-da-de-dat-dat-dah!”
That's it; sure; you've heard it.
I think I first bought a recording of Muskrat Ramble
back in about 1940, when I was in my early teens.
My memory is rickety, but I am sure my first recording
was labeled MUSKRAT RAMBLE, and I think, though I
am less sure, that it was played by the late “Muggsy”
Spanier, who was, to my mind, one of the greatest of
jazz trumpeters. Later, I got another recording of the
same tune, this one by, I think, Mezz Mezzrow. The
label said, MUSKAT RAMBLE. I thought that was surely
the first time I had ever seen such an obvious typographical
error in, of all things, a simple title on a
simple 78-rpm record. (This, remember, was in my
youth, and it was a time when typographical errors
were called typographical errors, not typos—at least
by kids in junior high.) Some time later, I got still
another version of MUSKRAT RAMBLE, with still another
version of the title. This time, it was MUSCAT RAMBLE.
That, I thought, was really absurd. Not only had they
left out the “R”; they'd changed the “K” to “C”. Now, it
made no sense at all. On the other hand, I reasoned, if
there were, in fact, some sort of cat called a muscat,
perhaps it wasn't so outrageous. I looked up muscat in
my Webster's and found that it is a `variety of grape.'
To name a ramble after a variety of grape seemed to
me preposterous. I was young and, by today's standards,
at least, pathetically innocent.
During my time in senior high, and, after that, in
the Army Air Force, I had other things on my mind
(there was a war on, after all), and I didn't give
the MUSKRAT-MUSKAT-MUSCAT RAMBLE problem any
thought.
Speaking of my time in the AAF, which was utterly
undistinguished, I think I must make a confession.
Now might be as good a time as any to reveal a
theft I committed at an Air Force Base near Seymour,
Indiana. It was winter and bitterly cold. The wind
used to sweep across that damned airfield with what
seemed an absolute determination to crystallize our
bodies. One day when the wind chill factor was nearing
absolute zero, I took shelter in the service club.
There was the omnipresent phonograph, or Vic , short
for Victrola, and the stack of records next to it. In
those days, people as a rule did not take much care of
phonograph records. Usually the records were taken
from their jackets and loaded naked in stacks, where
they picked up dust, scratched one another, and
traded static electricity. I was shuffling through a stack
of about fifty records, and I came across three Bessie
Smiths. I played all three, and the few other G.I.s in
the room, which was quite large—big enough for a
fair-sized dance with a small orchestra—either paid
no attention or asked me to put on something by Glenn
Miller or Jimmy or Tommy Dorsey instead. Among
Bessie's numbers were Dying Gambler's Blues, Sing
Sing Prison Blues , and one I had never heard called
Black Mountain Blues , which has the imcomparable
lines,
Home in Black Mountain a chile' will smack yo'
face;
Home in Black Mountain a chile' will smack yo'
face;
Babies cry for liquor an' all the birds sing bass.
and
Goin' back to Black Mountain, me an' my razor
an' my gun;
Goin' back to Black Mountain, me an' my razor
an my gun;
Goin' cut him if he stan' still, goin' shoot him if he
run.
I was, and still am, captivated by “Babies cry for
liquor an' the birds sing bass,” and in the arrogance of
my youth, I was certain that nobody else on the airfield
either knew or cared who Bessie Smith was, nor
would any other G.I. be enchanted by basso birds, so I
turned thief. I can't remember how I did it, but somehow
I smuggled those records back to my barracks and
got them home intact on my next furlough. I kept
them in good shape until my last 78-rpm turntable
died.
End of digression and back to MUSKRAT-KAT-CAT:
Muskrat Ramble is credited to Edward “Kid” Ory and
Ray Gilbert. “Kid” Ory played great jazz trombone.
The only thing I know about Gilbert is that I find him
listed as co-author of Muskrat Ramble .
About thirty years ago, when I was concocting an
epicurean dish and saw that I had no sherry on hand, I
went to the liquor store and bought a bottle of muscatel
that was being sold for an absurdly low price and
that I thought might be exactly right for my sauce. It
wasn't bad, The wine jogged my thoughts back to
Muscat Ramble . Muscatel is made from muscat
grapes, is sometimes called muscat , and, being relatively
cheap and sweet and high in alcohol content, is
the booze of choice for a great many wines. An old
college friend of mine who celebrated his twentieth
birthday—meaning twenty years of AA sobriety—a
couple of years ago, tells me that when he was on the
skids and riding the rails from drunk tank to drunk
tank, the favorite terms for muscat were muscadoodle
and Napa Valley smoke .
I made up my mind that Muscat Ramble was
almost certainly the original name of the tune. My
reasoning is that it is not likely that “Kid” Ory or Ray
Gilbert had ever seen a muskrat, and it's even less
likely that they or anyone else has ever seen a muskrat
doing anything that we would be likely to think of as
rambling. Muskrats, according to my encyclopedia,
look like giant rats, are found in and around the
mudbanks bordering marshes and quiet ponds, have
partially webbed feet, and do a good deal of swimming.
They do not appear to do much rambling. Muscat,
or muscatel, on the other hand, is found on skid
rows all over the land. A guy with a bottle-shaped
brown paper bag, damp and wrinkled at its upper
end, has almost certainly been slugging down a sweet
wine of high proof, and the odds are pretty good you
would find it is a muscadoodle . After the guy finishes
his Napa Valley smoke and has slept it off, he is looking
for the means to get another muscat fix. Now he is on a
ramble with his hand out and a pleading look in his
roadmapped eyes. I suspect that that is precisely the
song's origin.
My theory is that the “r” got put in there simply
because muskrat is a more common word than muscat .
It is the same reason most of us, I assume, have heard,
“He's in the hospital with prostrate trouble.” Prostrate
is a more common word that prostate , so prostrate is
what we get. The “r” fits in naturally. I got a strange
sort of corroboration from my good friend Rosy
McHargue, who is now pushing eighty-seven years and
has spent most of his life playing clarinet and sax with
some of the best jazzbands—Benny Goodman, Red
Nichols, Ted Weems, and a slew of others. Rosy, too,
had seen the tune as Muskrat, Muskat , and Muscat . I
asked him what he thought the original title was. He
had known “Kid” Ory well, and he said, “You know,
Tom, I'm not exactly sure. I once asked Ory about it
and he said, `It's m-u-s-c-a-t. Muskrat .' So I think that's
just the way everyone said muscat .”
There you are. I find a muskrat ramble difficult to
imagine visually. I picture muskrats wallowing about
in the mire and paddling sluggishly through the water,
but I wouldn't call that rambling. On the other hand,
a wino with an empty paper bag on a ramble to maintain
his muscat level—now that has a touch of poetry.
Maybe not in the same class with “all the birds sing
bass,” but poetry, nevertheless.
As a nonexpert, although interested, subscriber to
VERBATIM, it is “a bit mysterious” to me that the singular
noun absence takes the plural verb are . I refer to
the first sentence of your article about the Longman
Dictionary [XV,1].
Helen W. Power, in “Women on Language;
Women in Language,” [XV,2] may bewail the insensitivity
of the male. But she betrays her own elitist insensitivity
when she describes a flight attendant as “the
person who passes peanuts on an airplane.” I hope
Ms./Miss/Mrs. Power never needs to draw on the considerable
first-aid and emergency training that every
attendant must master.
Antipodean Newsletter
Leonard Bloomfield, having begun with a theory
of meaning which emphasized the environment in
which objects were present and named, had to add the
obvious proviso that we sometimes mention what is
not present. I have lately been reading accounts of the
exploration of the western and northwestern deserts of
Australia in the 1870s and I have become very aware of
the effect absent necessities might have on the frequency
of particular items in discourse. In the desert
the missing necessity is water. As the explorer Ernest
Giles put it, the explorer's experience is a “baptism
worse than that of fire—the baptism of no water.”
My impression was that in the journals of desert
explorers the word water , alone or in compounds, and
words relating to water, were unusually frequent. It is,
I suppose, likely that people with little money must
think of money more than the well-off do and that the
hungry will dwell on thoughts of food and the thirsty
on drink. Here was a chance to quantify such things. I
decided to make a count of words relating to water in
reports of desert exploration.
Taking quite at random a single page (page 7) in
the journals of the Gregory brothers recording an early
(1846) exploration of country east and north of Perth, I
find the word water used fifteen times. Ten pages on
(page 17), water occurs nine times but there are also
the related words stream (twice), well (twice), pool,
channel , and the circumlocution “essential element.”
Two words, dew and shower , refer in the context to the
presence of water; the rest are in contexts indicating its
absence.
I tried another explorer, Ernest Giles. Taking
page 17 again, I was reminded that Giles is rather
given to semi-serious poetic diction at times, and we
find him referring to the presence of water in the Finke
River as “the stream purling over its stony floor” or,
quoting some bygone poet, “brightly the brook through
the green leaflets, giddy with joyousness, dances
along.” Perhaps present water called for some stylistic
celebration. Two hundred pages further on there is less
exuberance in the circumlocution “that fluid so terribly
scarce in the region,” and in three other references
water is simply water . Giles is not always waxing poetic
and may, like other explorers, be useful as a source
for the history of Australian and general English. His
use of the word tank to refer to a hollowed-out reservoir
(“Gibson dug a small tank and the water soon
cleared”) antedates the OED , for instance.
Since this linguistic-statistical study of an obsession
might well prove to be an important contribution
to psycholinguistics, I decided to make a larger sample
of watery words, choosing the straightforward journals
of Colonel Peter Egerton Warburton, who led an expedition
across the western interior of Australia in
1873-4. In a randomly chosen sequence of ten pages
(151-60 of the published journal) there were twenty-eight
occurrences of the word water (eight of them in
compounds), no page being without at least one example.
In addition, there was a rich collection of words
relating to water, not necessarily indicating its presence.
“Hoping to find a lake” is included, though of
course it doesn't indicate the presence of water. Even
words which are usually of more general reference are
brought into relation with water in a text like this.
Gum-trees or rocks (in areas of sand) appear as signs of
possible water. Apart from these words and lake ,
words and phrases directly associated with thoughts of
water and reinforcing the sense of obsession include
pool, springs, drainage hole, clay hole, flood, channel,
water-courses, water-hole, rock-hole, drink, drinkable,
running water, stream , and native well .
The last two items merit comment. Stream is often
said not to be used in Australia except in metaphorical
ways, normally being replaced by creek .
Warburton's use: “sandbanks intercept the stream,
which finally splits into narow water-courses and
spreads itself over the plains, and so it ends as a creek”
suggests a somewhat more complex relation between
the two words. British-born explorers did not set out to
write Australian English, of course. Gregory uses
stream in the way normal in England; Giles consistently
refers to gens in the hills of central Australia,
though glen is not current (outside place-names) in
contemporary Australian English.
The other name, native well is, as a later explorer
David Carnegie, author of Spinifex and Sand (1898),
points out, a misnomer. He believes native wells are
essentially rock-holes (depressions in rock) buried in
fairly shallow sand, which, when hollowed out by the
natives, appear to be wells. This sort of misnomer
leads Carnegie to suppose that “to the uninitiated no
map is so misleading as that of West Australia where
lakes are salt-bogs without surface water, springs seldom
run, and native `wells' are merely tiny holes in the
rock, yielding from 0 to 200 gallons.”
Carnegie also describes namma-holes and soaks as
sources of water. Soaks are shallow wells sunk near the
base of an outcrop to tap an underground reservoir.
Namma-holes have been variously described; to Carnegie
they are depressions on the surface of rocks, often
with a rounded bottom, where stones are often found,
suggesting that the stones have something to do with
the formation of the holes.
Some nostalgic early Australians deplored the loss
in our speech of English country words, the glens and
streams (alive, anyway, in the journals of explorers),
coppices and brooks, woods, becks , and rivulets . Perhaps
these words did not really fit. We might have
done better with Arabic-speaking settlers. Wadi , for
instance, would describe an inland creek rather well.
Be that as it may, a later Australian visitor to English
drizzle might feel nostalgic when thinking of the
parched and thirsty but water-obsessed vocabulary developed
in the drier areas of our sunburnt land.
Favorite Grammatical Game: Puzzling Pronouns
Here is a game just made to while away the hours
on a commuter train with your favorite author,
a perfect place to hunt for Puzzling Pronouns .
Fowler lists five instances where a careless writer
can go wrong. There is really no excuse, Fowler says
(not he says!), but here we give examples of his third
case only, where “there should not be two parties justifying
even a momentary doubt about which the pronoun
represents.” And here the deluge of printed matter
abounds with such specimens that one would
suppose them to be the rule rather than the exceptions.
It is a game that is like fishing in a barrel, but more
stimulating mentally. I am not picking on the following
authors; it is just a random catch.
In Thomas Hardy's The Hand of Ethelberta , it is
suggested by Ethelberta that she and some others go to
see Milton's tomb in Cripplegate church. Her suitor,
Neigh, who had proposed marriage in a previous
chapter, appears somewhat apprehensive at Ethelberta's
suggestion. This apprehension is observed by a
Mr. Belmaine and mistaken by him for an indication
that Neigh has been dragged into going to the church
against his will “by his over-hasty wife.” One wonders
whether the marriage had secretly taken place between
the consecutive chapters! You see, it is
Belmaine's wife who was doing the dragging.
Somerset Maugham was a good and careful grammarian
but now and then he slipped. In The Letter , a
solicitor, Mr. Joyce, is approached by a Mr. Crosbie:
He spoke beautiful English, accenting each word
with precision, and Mr. Joyce had often wondered
at the extent of his vocabulary....
Sometimes I wonder about the extent of my own vocabulary,
too, but really, not when I'm interviewing a
client.
From The Once and Future King , by T. H.
White:
Naturally it was Lancelot who rescued her. Sir Boss
had managed to find him at the abbey, during his
two days' absence, and now he came back in the
nick of time to fight Sir Mador for the queen. Nobody
who knew him would have expected him to
do anything else, whether he had been sent away in
disgrace or not—but, as it was thought he had left
the country, his return did have a dramatic quality.
Not to say a quality of confusion—pronoun-cedly so.
From Oh What a Paradise it Seems , by John
Cheever:
The size of Chisholm's teeth, the thickness of his
glasses, his stoop and the spring with which he
walked all marked him, Sears thought, as a single-minded
reformer. His marriage, Sears guessed,
would have been unsuccessful and his children
would have difficulty finding themselves.
No wonder — we've lost them already.
Mark Twain poses us a little mystery in Pudd'nhead
Wilson: which knife does the killing? Quiet now.
Lights, action:
I was asleep, but Luigi was awake, and he thought
he detected a vague form nearing the bed. He
slipped the knife out of the sheath and was ready,
and unembarrassed by hampering bedclothes, for
the weather was hot and we hadn't any. Suddenly
that native rose at the bedside, and bent over me
with his right hand lifted and a dirk in it aimed at
my throat; but Luigi grabbed his wrist, pulled him
downward, and drove his own knife into the man's
neck. That is the whole story.
Well, was it Luigi's knife or the native's? If we had only
that scene to go by we would never really know, and
all because of a Puzzling Pronoun —or two!
Oh, it can lead one to a rhymed couplet:
He loves his brother and his wife,
Does he live a double life?
Give me my grammatical games any day to a crossword
puzzle.
The Joys and Oys of Yiddish
Rabbi Robert Schenkerman
Temple Beth Jacob
When Isaac Bashevis Singer was awarded the
Nobel Prize for Literature in 1978, he remarked
in his acceptance speech:
The high honor bestowed upon me is also a recognition
of the Yiddish language—a language of exile,
without a land, without frontiers, not supported
by any government, a language which
possesses no words for weapons, ammunition, military
exercises, war tactics.
There is a quiet humor in Yiddish and a gratitude
for every day of life, every crumb of success,
each encounter of love. In a figurative way, Yiddish
is the wise and humble language of us all, the idiom
of a frightened and hopeful humanity.
The word Yiddish derives from the German
judisch `Jewish.' The principal parent of Yiddish is
High German, the form of German encountered by
Jewish settlers from northern France in the eleventh
century. Yiddish is written in the characters of the
Hebrew alphabet and from right to left and enjoys
borrowing words from Russian, Polish, English, and
all the other languages and countries along the routes
that Jews have traveled during the past thousand years.
Journalist Charles Rappaport once quipped, “I speak
ten languages—all of them Yiddish.”
Although Yiddish has been in danger of dying out
for hundreds of years, the language is spoken today by
millions of people throughout the world—Russia, Poland,
Rumania, France, England, Israel, Africa,
Latin America, New Zealand, Australia, Canada, and
the United States, where, like the bagel, it was leavened
on both coasts, in New York and Hollywood. It is
spoken even in Transylvania: A beautiful girl awakens
in bed to find a vampire at her side. Quickly she holds
up a cross. “Zie gernisht helfen,” smiles the vampire.
Translation: “It won't do you any good.”
Most of us already speak a fair amount of Yiddish
(Yinglish) without fully realizing it. Webster's Third
New International Dictionary lists about 500 Yiddish
words that have become part of our everyday conversations,
including:
cockamamy (or cockamamie) `mixed-up, ridiculous.'
fin slang for `five-dollar bill,' from finf, the Yiddish
word for `five.'
gun moll a double clipping of gonif's Molly, Yiddish
for `thief's girl.'
kibitzer `one who comments, often in the form of
unwanted advice, during a game, often cards.'
mavin `expert.'
mazuma `money.'
mish-mosh `mess.'
schlep to `drag or haul.'
schlock `shoddy, cheaply produced merchandise.'
schmeer the `entire deal,' the `whole package.'
schnoz slang for `nose.'
yenta `blabbermouth, gossip; woman of low
origins.'
... and so on through the whole megillah : `long,
involved story.'
A number of poignant Yiddish words defy genuine
translation into English:
chutzpa `nerve; unmitigated gall;' a quality we
admire within ourselves, but never in others. In
his delightful study, The Joys of Yiddish (McGraw-Hill
1968), Leo Rosten offers two classic
definitions. “Chutzpa is that quality enshrined in
a man, who, having killed his mother and father,
throws himself on the mercy of the court because
he is an orphan. A chutzpanik may be defined as
the man who shouts `Help! Help!' while beating
you up.”
mensch a `real authentic human being—a person.'
naches the `glow of pleasure-plus-pride that only
a child can give to its parents': “This is my son,
the Doctor!”
oy not so much a word as an entire vocabulary, as
Rosten observes: “can express any emotion, from
trivial delight to the blackest woe.”
oy vay; oy vay in mir literally, “Oh, pain,” but, in
its long or short form, can be used for anything
from condolence to lament:
On August 6, 1945, the world's first nuclear
weapon was dropped on Hiroshima, Japan. Two
hundred and eighty-two thousand human beings
died and tens of thousands more were left
burned, maimed, and homeless. [Albert] Einstein,
whose letter to Roosevelt had initiated the
American effort that resulted in the atom bomb
and whose special theory of relativity formed its
theoretical basis, heard the news on the radio.
For a long time he could only find two Yiddish
words traditionally used by Jews in such circumstances:
“Oi vey.”
—The Little, Brown Book of Anecdotes
tsuris the gamut of painful emotions—some real,
some imagined, some self-inflicted.
Yiddish is especially versatile in describing those
poor souls who inhabit the world of the ineffectual,
and each is assigned a distinct place in the gallery of
pathetic types: schmo, schmendrik, schnook, schmegegge,
schlep, schlub, schmuck, putz, klutz, kvetch ,
and nudnik . Yiddish easily coins new names for new
personalities: a nudnik is a `pest'; a phudnik is a `nudnik
with a Ph.D.' The rich nuances that suffuse this
roll call are seen in the timeless distinction between a
schlemiel `clumsy jerk' and a schlimazel `habitual
loser': the schlemiel inevitably trips and spills his hot
soup—all over the schlimazel. (And the nebbish is the
one who has to clean it up.)
The Yiddish language, through its color, its target-accurate
expressions, its raw idioms, and its sayings
exudes a refreshing magic and laughter, mixed with
sober thought, that has been handed down from generation
to generation and from nation to nation. Yiddish
never apologizes for what it is—the earthy, wise
soul of an expressive people learning that life is but a
mingled yarn, good and ill together.
Which reminds us of the zaftig `buxom, well-rounded'
blonde who wore an enormous diamond to a
charity ball. “It happens to be the third most famous
diamond in the whole world,” she boasted. “The first is
the Hope diamond, then comes the Kohinoor, and then
comes this one, which is called the Lipschitz.”
“What a stone! How lucky you are!”
“Wait, wait,” said the lady. “Nothing in life is all
mazel [`good luck']. Unfortunately, with this famous
Lipschitz diamond comes also the famous Lipschitz
curse.”
The other women gasped and asked, “And what is
the famous Lipschitz curse?”
“Lipschitz,” sighed the lady.
The Women's History of the Word
Those who are not familiar with feminist writings
may find it useful and interesting to consider a book,
recently published in Britain, that is typical of the
harsher brand of such works. The work in question
offers nothing regarding language, so its review here is
ancillary to the main function of VERBATIM. The feminist
movement is very much alive in Britain, and the
“Greenham Common Women” are probably largely
responsible for much of the national sentiment against
the Cruise missiles installed at an American base near
that village. In Britain, as elsewhere, most books by
feminist writers are reviewed by women, usually feminists.
Men are seldom assigned to review them, possibly
because the editor fears that they will be either
ignorant of or unsympathetic to the issues raised, if not
biased against them, or because the editor is a woman.
Because writing an unfavorable review of a (bad) feminist
book would be tantamount to treachery, such
books are often unjustifiably praised, as was the case
with this work by Rosalind Miles, which was well received
on its publication in June.
According to the blurb on the dust jacket of this
distinctly unpleasant book, Rosalind Miles is head of
the Centre for Women's Studies at Coventry Polytechnic,
a lecturer, broadcaster, journalist, and author of
several other books, including a “highly acclaimed”
biography of Ben Jonson. One might like to believe
that this gives her the cachet of authoritative scholarship,
but the text does not bear out the promise.
For the most part, the book consists of a rewriting
of history, from the dawn of time, with the purpose of
demonstrating two main themes: the “fact” that
women were responsible for all the important contributions
to the advancement of civilization (as the development
of agriculture, for instance), often despite
the arrogance and stupidity of men; and the “fact”
that women have long been subjected to domination
by men. Miles suggests that such domination is a recent
phenomenon—only a couple of thousand years
old—for she points to the clear superiority of women
in (primitive) religions and matriarchies, right on
through to the Egyptian dynastic rulers. At one point,
she gets so carried away with her thesis that she suggests
that females were responsible not only for all of
human evolutionary biology but for the very notion of
counting (in order to keep track of menstruation) and,
probably by the same token, astronomy. She quotes
(and, presumably, accepts) another source which holds
that “woman first awakened in humankind the capacity
to recognize abstracts.” If you believe that balderdash,
you'll believe anything.
In the good old days, we were taught that the
pyramids were built by tens of thousands of slaves.
Recent speculation has it that they were not slaves
but—what would one call them? — ordinary laborers.
Here comes Miles, authoritatively quoting Diodorus,
the Greek historian, who recorded (60-30BC) that “innocent
women even swelled the ranks of pitiful slaves
whose forced labour built the pyramids:
... bound in fetters, they work continually
without being allowed any rest by night or day.
They have not a rag to cover their nakedness, and
neither the weakness of age nor women's infirmities
are any plea to excuse them, but they are driven by
blows until they drop dead.” [p.49]
As the pyramids were already about 2500 years old
when Diodorus wrote his World History , one is given
to wonder what his authority might have been for such
a vivid description. It is even less comprehensible how
a modern researcher could accept it and have the effrontery
to promulgate it. Miles's book is riddled with
many similar distortions, convenient omissions, and
generalizations:
... Women have always commanded over half
the sum total of human intelligence and creativity.
From the poet Sappho, who in the sixth century BC
was the first to use the lyric to write subjectively
and explore the range of female experience, to the
Chinese polymath Pan Chao (Ban Zhao), who
flourished around AD 100 as historian, poet, astronomer,
mathematician and educationalist, the range
is startling. In every field, women too numerous to
list were involved in developing knowledge and
contributing to the welfare of their societies as they
did so: the Roman Fabiola established a hospital
where she worked both as nurse and doctor, becoming
the first known woman surgeon before she
died in AD 399. [p.52]
Earlier, on page 49, we learnt about Agnodice, “who
lived to become the world's first known woman gynaecologist,”
in the fourth century BC. Clearly, this rosily
checkered past was soon to be replaced, chiefly, it
seems, as Judeo-Christian-Islamic-Confucian-Buddhist
cultures flourished. It was not too bad early on,
when, according to Miles, the seven Maccabean martyrs
who “saved Judaism” did so only at the instigation
of their mother. Miles continues:
In early Christianity likewise, women found not
merely a role, but an instrument of resistance to
male domination; in choosing to be a bride of
Christ they inevitably cocked a snook at lesser male
fry. Thousands of young women helped to build
the church of God with their body, blood and
bones when frenzied fathers, husbands or fiancés
preferred to see them die by fire, sword or the
fangs of wild beasts rather than live to flout [sic]
the duty and destiny of womanhood. [p.63]
But the situation soon deteriorated:
Even St. Paul, later the unregenerate prophet of
female inferiority, was forced to acknowledge the
help he received from Lydia, the seller of purple
dyes in Philippi. [ibid.]
This rewriting of history is punctuated by an array
of four-letter invectives applied to males and by
adjectives like brilliant, unusual, inspiring , and so
forth to women. Citing a Judaic law-book of the 16th
century which identified a woman for the days preceding,
during, and following her period as niddah
`impure,' Miles has the lack of taste to write the following:.
As a final stroke, in a grim foreshadowing of
what the future held in store for the Jews, the niddah
had to wear special clothing as a badge of her
separate and despised status. [p.83]
Here and there in this morass of misunderstanding,
Miles treads on solid ground if one can agree with
the eminent anthropologist Joseph Campbell. Campbell,
known for his extensive analyses of the world's
mythologies, religions, and cultures, noted the marked
bias against women emerging from Judaic concepts,
later reinforced by Christian and Islamic doctrine.
Most of the religions of the world connected woman
with mother earth, fertility, and all the other
progenetic and nurturing associations, and this was
borne out in the cultures of the people. According to
Campbell, the only godlike female figure in the Bible
is the Virgin Mary, and she appears, identified as virgin,
only in the Gospel according to Luke. As Luke was
a Greek, Campbell suggested that Mary was a carryover
from the paganism of the ancient Greek pantheon.
Although this might help explain the Judeo-Christian-Muslim
tendencies to subjugate women,
treating them essentially as chattel, it does not account
for a similar treatment accorded them in other cultures,
notably that of Japan. It is not entirely clear
whether Campbell was commenting on Hinduism,
Buddhism, etc. as they once existed, conceptually, for
it is unlikely that he could have ignored the treatment
of women in the modern reflexes of the cultures adhering
to those religous precepts.
Campbell held that the ancient mythologies and
religions are allegorical and that there was no real
distinction between gods and goddesses, who were
given sexual identity when in human form only to
make them more meaningful. With all respect, that
seems a highly debatable issue and one far too complex
for this discussion, though we can certainly trace a
diminution in the role of female divinities (or divinity)
when we come to examine Judaism and its congeners
and progeny. Other debatable aspects are the questions
of whether the debasement of women is a reflection of
the theology or the ritual, whether the scripture of any
religion should be understood allegorically or literally,
and so forth. If there is something wrong, it behooves
us to get at the roots of the problem, not to flail about
wildly, for only after the source of a disease has been
identified can one properly investigate its cure.
“History according to Rosalind Miles” blasts away
at the symptoms in a misconceived notion that alleviating
them will effect a cure of the disease. In this
jeremiad, males are viewed as the “enemy,” and are so
characterized throughout the book, which concludes
with exhortations to engage the foe and a strident call
to arms (though not men's).
Laurence Urdang
Archaeology & Language
[A VERBATIM Book Club Selection.]
Just when you thought it was safe to assume that
we now know all we are ever likely to know about the
past, someone digs another hole and unearths (literally
or figuratively) some ancient artifact: one day it is a
fragile scroll, found in a cave near the Dead Sea, that
turns out to be pre-Biblical; the next day it is an entire
terracotta army of Chinese soldiers: the next it is a
skull, excavated from the Olduvai Gorge, that compels
anthropologists (once again) to revise their guesses
about the earliest stages of Homo sapiens sapiens vs
hominids. Most of the relies from the past are gone
forever, destroyed by the plows of countless generations
of farmers, reduced to rubble by erosion, by conquerors,
by prehistoric (and modern) urban developers, by
fire and flood, and just by time. Many, we may hope,
have not yet been found. The interest in man's forebears
did not become fashionable upon the publication,
a few years ago, of Roots : on a far larger scale,
we have been trying to discover all we can about the
origins not of men but of man. Strange to say, however,
that interest does not seem to be more than a few
hundred years old: if the ancient Greeks and Romans,
the Indians, the Chinese and other peoples were curious
about their own prehistory, I have not heard of it.
Perhaps the fascination with man's past grew out of
the obsession with ruins evinced by Romanticism; certainly,
modern archaeology seems to have followed
close behind, for the excavation of the supposed site of
Troy took place only about 100 years ago. Perhaps it is
just as well, for only by the means available to modern
science are we now able to preserve some of the artifacts
that we find and, through radiocarbon dating,
determine their approximate age.
Archaeology is a popular pursuit, and its manifest
results not only receive considerable publicity but can
be seen in museums. Not so paleolinguistics, or the
reconstruction of ancient languages. Even the remnants
we have from early languages that had a writing
system are relatively sparse: Classical Latin and
Greek, Hebrew, and a few other languages are better
documented than others; but for most all we have to go
on are a handful of tablets here, a few inscriptions
there, barely enough in many cases to allow us to
identify the language, let alone draw any conclusions
regarding its structure or meaning. Perhaps one day
we shall find an Etruscan library, buried deep in the
Italian countryside; but for the present, we have to
make do with what we have, which is precious little.
About languages that had no writing system, we know
nothing at all. But some very clever comparative linguists,
beginning in Germany in the 19th century, theorized
about how the nature of the ancestors of the
more modern tongues. In some instances, ancient languages
have been decoded, some from multilingual
inscriptions. The work of Jean Francois Champollion
(1790-1832) in deciphering hieroglyphics from the Rosetta
Stone was an astonishing accomplishment, for it
enabled us to read the myriad writings of the ancient
Egyptians on papyrus and in wall inscriptions and
revealed an enormous amount of the knowledge we
have today about their civilization, which lasted for
about 2600 years. Another significant break-through
was that of Michael Ventris (1922-1956), who deciphered
the Linear B script found on Crete and identified
it as an early form of Greek. From the standpoint
of language, Ventris's work was more important, particularly
because it filled in a gap in our knowledge of
the early states of Indo-European languages.
Many years ago, a linguistic scholar counted all of
the languages then spoken of which he had evidence.
The total was approximately 2800, but that is probably
only a vague estimate: he undoubtedly missed
some; some have sprung up since his time (modern
Hebrew, for instance); and some have vanished. The
exact count is unimportant and, at best, spurious, for
it is extremely difficult to establish uniform criteria for
what distinguishes dialect from language. Then, too,
one must examine the techniques used to group the
many languages of the world.
Linguists examining Classical Greek, Latin, German,
English, Slavic, Swedish, Norwegian, Danish,
Dutch, Lithuanian, Iranian, Hindi, and the other languages
of India and Europe found that there were
correspondences among many of the common words.
Some, like French, Spanish, Italian, and Portuguese,
had more in common with one another than they did
with, say, German, English, Swedish, Danish, and
Dutch, which, in turn, bore only a remote resemblance
to Russian and Polish, on the one hand, and the
two extant varieties of, say, Gaelic, on the other. One
rapidly runs out of hands and must resort to fingers
and toes, for after years of laboriously categorizing
these languages, the number of different main
branches (called families and subfamilies) came to
about ten. Ingeniously, certain differences between
families were explained by various phonetic shifts that
(inexplicably) took place in one language group but
not in another. Although certain other languages were
geographically nearby, it was impossible to establish
any resemblances between them, hence Basque, for
example, is not classified as being in the same family
with other European languages, nor are Hungarian
and Finnish, both of which belong to their own group.
At the conclusion of this vast exercise, done without
the aid of computers, there emerged a pattern of familial
relationships that linked together languages spoken,
in earlier times, from Britain as far east as Chinese
Turkestan and from India as far north as
Lappland. Charts showing the chief languages and
their derivations can be found in many dictionaries—inside
the front cover of The Random House Unabridged ,
for example. Because linguists are constantly
learning more and more about the relationships
among languages, it is best to avoid using an older
chart; for the same reason, it would be wise not to
stake too much on the accuracy of even a current
chart.
The languages discussed here are what are usually
called the Indo-European family; similar family trees
could be drawn for the Semitic languages, Sino-Tibetan,
Japanese, Bantu, Malayo-Polynesian, and so on.
Each is a distinct phylum; although there may be
word-borrowing among them, lexicon is considered
less important in the classification of languages than
structure and grammar. It is important, too, to note
that writing systems are irrelevant: for instance, Polish
is written (today) using the Roman alphabet, but Russian,
a related Slavic language, uses the Cyrillic; Yiddish,
a Germanic language, is written in Hebrew characters;
Latin, Greek, and Sanskrit, which resemble
one another rather closely in some respects, all use
different alphabets; and early examples, utterly unrecognizable
to untrained readers of modern languages,
were written in cuneiform, quite suitable for writing
on soft clay tablets with a pointed stylus, and hieroglyphics.
It would be nice to think that while linguists were
working so hard to organize languages, they were
working alongside the archaeologists who were providing
the raw materials. But only rarely did they collaborate
and, with few exceptions, their work was not
correlated in a systematic way. Schliemann, who discovered
the site of Troy, used the evidence in Homer's
Iliad to determine his digging site, where any ruins
had long since disappeared from view. In many other
places, the ancient sites lay buried—and still
do—beneath modern cities: modern property owners
quite understandably take a dim view of tearing down
their buildings on the off chance that the remnants of
an ancient town will be found several yards below.
today, before a new building is erected in London, an
archaeological team examines the cleared site for its
archaeological significance. But there, as everywhere
else, nothing can interfere with progress and, regardless
of the finds and their importance, the archaeologist
must eventually yield to the bulldozer. Notwithstanding,
even the brief glimpses afforded by such
investigations can provide some insight into civilizations
that existed hundreds or, in some cases, thousands
of years earlier.
Based on the sparse evidence available, linguists
theorized about the earlier languages that had given
rise to those attested. In other words, based on what
they knew about a group of languages which were
documented, they tried to imagine the language that
they sprang from. In most cases, they dealt with words
and functional elements, creating what are called reconstructions
in hypothetical family prototypes called,
variously, Proto-Latin, Proto-Greek, Proto-Germanic,
Proto-Indo-Iranian, and so forth, the ultimate goal
being to posit a single language called Proto-Indo-European.
That is not entirely true, for linguists know
too much about language to suggest that there ever
was, literally, a single language from which all Indo-European
languages descended. Nonetheless, it is convenient
to think about the existence of a group of
proto-dialects which can be referred to as Proto-Indo-European.
It seems only natural that once an original language,
or Ursprache , was posited, the next step was to
speculate on its source, or Urheimat . That is what
Renfrew has tried to do. Essentially, he proposes that
the parent of all Indo-European languages was itself
born in central Anatolia, whence it spread eastward,
westward, and northward, being modified by the influences
of the languages with which it came into contact,
till it ultimately emerged in its recognizable,
modern manifestations which we categorize into Germanic,
Hellenic, Italic, Indo-Iranian, Anatolian, Armenian,
Celtic, Tocharian, Albanian, and BaltoSlavic.
I have no quarrel with Renfrew's theory—notwithstanding
the generally received wisdom that has
placed the homeland north of the Black Sea region
and the Volga steppes. It is difficult for the nonspecialist
reader (like me) to assess the validity of his arguments,
which are based on his contention that the
language (and its congeners) were carried along by the
spread of nomad pastoralism. Using the evidence available,
Renfrew contends that the original Indo-European
language, closely related to Hittite, separated
after 6500 BC, with the IE languages of western Europe
developing from western Anatolia and those of
Iran, India, and Pakistan from the eastern division.
The choice between the prevailing theory and Renfrew's
depends on whether one accepts a “wave” theory,
first promulgated more than a hundred years ago
by Johnanes Schmidt, a German linguist, or one of
indigenous development. Pottery finds can be interpreted
to support either the imposition of an elite culture
from Turkmenia or a late development of the
Indus civilization. Renfrew accepts the wave theory,
and in the last two thirds of Archaeology & Language
he sets forth his arguments in its favor. Unfortunately,
the presentation of his linguistic argument, where the
author is clearly treading on more speculative ground
than in those parts dealing with outright archaeology,
where he is on more familiar territory, is disorganized
and repetitious. It is difficult to place all the blame on
Renfrew, for his editor should have noticed the lack of
coherence. The result is an argument that is persuasive
but scarely convincing.
Nevertheless, good books on archaeology assimilable
by laymen are not easy to find, and if the reader
can tolerate its shortcomings and is not overly concerned
about the precise birthplace of Indo-European,
Archaelogy & Language provides an interesting march
through the millennia of prehistory in seven-league
boots.
Laurence Urdang
Webster's Electronic Thesaurus
This software consists of two disks, one labeled
Installation and Program, the other Synonym Linguibase,
and a manual. The manual sets forth everything
with clarity, and the program is simple to install, requiring
only a few minutes. Only one thing made me a
little suspicious when cranking up the system: in the
descriptive text that appears on the screen, the word
labeled is spelt “labelled”—decidedly un-American.
However, I went ahead, and, since I was typing the
text you are reading, returned to the beginning of the
paragraph to see how some of these words would fare.
I looked up the word preceding and was, after a brief
moment, asked to type in the word, which I did. The
screen bloomed forth with the following:
Query: preceding
1) adj being before especially in time or arrangement
There were also some other parts of speech: one
definition for the preposition and three for the verb
(participial) senses. I called up the synonyms for the
adj and the following appeared:
Synonyms:
antecedent, anterior, foregoing, former, past, precedent,
previous, prior
The way the program works is this: one uses the cursor
to highlight a particular word for which synonyms are
desired. It is similar, in principle, to finding a synonym
in a synonym dictionary and then looking up its synonyms
to find them. I am not sure why, but I expected
the program to “network” in the same way. However,
when I highlighted antecedent , what appeared on the
screen was the same list of synonyms but with antecedent
missing, and preceding had reappeared. If all this
is too complicated to follow, let me summarize: you
look up word X and get synonyms A, B, C, D, E, F,
and G. You look up the synonyms for word A, and you
get synonyms X, B, C, D, E, F, and G. Even the
definition provided for the sub-listings is identical in
wording to that of the word originally sought.
This is very economical of space and involves a
clever computer ploy, but it does not provide a particularly
useful synonym dictionary, for, as we all know,
synonymy in language does not yield to the commutative
law of mathematics; in language, “Things equal to
the same thing are not (necessarily) equal to each
other.” Perhaps the Proximity people thought that they
had got round that little problem by giving the same
definition for each of the items in the list; but we know
that only very rarely are two synonyms bi-unique
(which is another way of saying that if A = B, B does
not necessarily always equal A), an ineluctable fact of
language.
If a relatively limited access to a synonym dictionary
is likely to be of use, then this package may be of
service. It works with a hard disk or with a set of
floppies and can be used with 29 popular word-processing
programs. (That was the number listed when I
received my copy; it might have increased.) It also has
a few neat features, like suggesting a few alternatives if
you happen to think that preceding is spelt “preceeding”
(as many people do). It has a useful “Help” feature
that can be called upon at any stage. Also, if you
enter jump , you get the synonyms for that; but if you
enter jumped , you get the (same) synonyms but inflected—including
the variants leapt, leaped for leap .
All in all, for a relatively primitive system, it is not too
bad; but you would have to be in love with your computer
to use it in preference to a far more complete
books of synonyms available (especially The Synonym
Finder , Rodale in the U.S. and Canada, Longman
elsewhere, which offers more than 800,000 synonyms,
more than three times the number listed in any other
synonym book).
The blurb on this book/disk package reads, “Supplies
you with 470,000 true synonyms for 40,000 entries.”
My guess is that such a quantity might be
reached if one counted all the permutations and combinations;
in reality, though, there are probably far
fewer actual words. Readers can judge for themselves
the validity of this numerical legerdemain.
Laurence Urdang
Family Words
In 1962, American Speech published “Family
Words in English,” by Allen Walker Read, which was
reprinted in VERBATIM Vol. I, No. 4, (1975). The article
is a classic, probably the first on the subject to appear
in a scholarly journal, though there are other informal
references to family language, some of which are documented
by Dickson in his Bibliography.
Family words and expressions crop up everywhere.
Some are quite unique and their reporters cannot
imagine their origin; others, like Penn Station ,
“what one family terms a child's misinterpretation of a
famous line or phrase,” are clear: the generic term
comes from the Lord's Prayer—“And lead us not into
Penn Station.” Obviously, that works only for kids familiar
with New York City. Other Penn Stations :
Our Father, which art in heaven, Harold be Thy
name.
Land where the Pilgrims pried.
Bells on cocktails ring.
I pledge my allowance to the flag.
Gladly the cross-eyed bear
Onward Christian Soldiers,
Marching as to War,
With the cross-eyed Jesus,
Leaning on the phone.
...One nation, invisible...
...One nation, in a vegetable...
Many people know F.H.B. for `family hold back,' an
exhortation ensuring ample provender for guests.
This is not to suggest that Dickson's book is a
catalogue of bloopers, or what Amsel Greene (and
Jack Smith) like to call pullet surprises . There are
many interesting entries in Family Words which, as far
as I know, is the first documentation of the genre.
There are occasional hidden entries, as the list of diseases—among
them the dread mohogus —under the
entry for Fowlenzia . (In the VERBATIM family, some
suffer from Fowler's pip , an affliction affecting language
fanatics who base a slavish purism on a literal
interpretation of Modern English Usage .)
Family Words is useful and fun. Inevitably, some
of the entries are more imaginative than others; Dickson
will have his hands full if everyone responds giving
private words. Please sent yours to the author, c/o Addison-Wesley,
Reading, MA 01867, not to VERBATIM.
Laurence Urdang
A Midwesterner, Will Hays, Jr., who is proud of
his knowledge of post-Civil-War history, tells me the
following origin of shot , as in shotglass , absent from
“Gunning for the English Language”:
Although we associate trench warfare with World
War I, trenches were characteristic also of the Civil
War. A scaffold was built so that a rifleman—
who fired a single-shot, muzzle-loading shoulder
weapon—could step up and shoot over the top of the
trench. The soldier in charge would command, after
each firing, that the rank on the scaffold step down
and be replaced by the rank that had just reloaded,
thus alternating ranks and sustaining the rifle fire.
That war, like others, produced disgruntled veterans
and those more adventurous or more restless after
military service. They moved westward to start a new
life. The population increased markedly, with corresponding
demands for goods and services, among them
the need for saloons. Most new saloons were small and
the bars short, accommodating with difficulty the
many bunched up, in ranks, if you will, calling for
whiskey. Many of the thirsty crowd were veterans, as
were many of the bartenders. Thus, “Step down (or
back) and give me a shot” was readily understood. I've
not been able to corroborate this explanation, but I'll
never forget it.
Mr. Joseph Hymes' “Do Mistake—Learn Better”
[XV,1] brought to mind the time a Japanese acquaintance
told me of a friend of hers who decided to tackle
the original English version of three books she had
enjoyed while in Japan. She boldly marched into a
bookstore and asked the salesclerk for a copy each of
Hemingway's The Sun Come Up Again and Throw
Away the Gun and Steinbeck's The Angry Grape . Is
there a term for the errors that creep in while translating
a passage back into the original tongue?
Mr. Davidson's observations on the Scottishness of
Chambers 20th Century Dictionary [XV,1] bear out
my own formed over sixteen years of using one. An odd
sidelight on this came a few days after reading the
article. Definitions under pet end with “Petting Party
(coll.) a gathering for the purpose of caressing as an
organised sport. (Origin unknown; not from Gaelic)” I
think it hardly fanciful to discern a note of Calvinist
disapproval in this curt disclaimer.
Although I greatly enjoyed Richard Lederer's article,
I fear that one of his paragraphs is a load of brass
monkey balls.
The monkey on board ship was a lad employed to
fetch supplies—powder and so forth—to the guns. The
word might also have been used for a receptacle near
the guns where powder and balls were kept. However,
this receptacle would have taken the form of a wooden
box or something similar. The idea of a metal stand
carrying a pyramid of cannon balls so delicately balanced
as to be affected by the tiny differential expansion
of brass and iron does not bear thinking about in a
heavy sea.
So what is the explanation of the phrase cold
enough to freeze the balls off a brass monkey ? Well,
the obvious one, I believe. Anybody who asks “Why a
brass monkey?” is probably not aware that brass monkeys
were very common household ornaments in England
in the 19th and early 20th centuries. Originally,
they were probably imported from India, but were
later mass-produced in places such as Birmingham to
grace Victorian and Edwardian mantelshelves. They
can still be found today in so-called “gift shops.” Usually,
they come in sets of three, one with its hands over
its eyes, one over its ears, and one over its mouth: they
were said to represent “See no evil, Hear no evil, Speak
no evil.” There were various whimsical variants.
I am sure I am not the first to point out Joseph
Hynes's, “Do Mistake—Learn Better,” [XV,1] mistakes
in Japanizing English words, e.g., sei fu not “safe-o,”
nain not “nine-o.” The possibilities for representing
English with a language of only forty-seven syllables
are not that numerous, and the rules are very consistent.
The main problems are representing consonant
clusters and word-final consonants. These difficulties
produce such monstrosities as sutoraike for English
`strike'—one syllable in English, five in Japanese.
Every Japan veteran has his list of favorite mistakes.
Mine are the ones that are possible, but wrong,
English. Adding the Japanese final vowels produces
Gone with the Windo . Hypercorrection, where Japanese
speakers learn that many final vowels do not exist
in the American version of the tongue and so remove
them, sometimes incorrectly, gives us the California
cities of San Francisk and Sacrament . This process
resulted in the sign reading Pizz and Coffee .
My absolute favorite of these semantic mistakes,
however, does not come from the problem of sound.
Japanese has a verb inflection which expresses causation
or permission—in English, “to make someone or
to let someone do something.” One day during a university
English class, a very discomfited student, after
frantic and obtrusive dictionary work, handed a colleague
of mine a scrap of paper. On it was written this
sentence: “Please make me go to the bathroom.”
You Could Look It Up
As everyone in the world must know by now, William
Safire writes a column in The New York Times
Magazine called “On Language.” Considering the circulation
of The New York Times on Sundays, his column
is probably the most widely read commentary on
contemporary English in the world; that places more
than one uncommon burden on a writer: he must do
his utmost to be accurate; he must try to select subjects
likely to be of interest to his readers; and he must
write well.
Those familiar with Safire's editorial style, reflected
in his political columns on the editorial pages
of The N. Y. Times , may agree with me in the contention
that when he writes about language he seems to
be writing on his day off: I cannot put my finger on
why, but “On Language” always strikes me as an excruciating
effort to be cute. In part, that is attributable
to the designation of his correspondents, who
keep him informed on language that is not within
earshot, as the “Lexicographic Irregulars,” an amusing
reference the first time or two it was used but now
beginning to cloy. More often than it might prove of
interest to me, personally, Safire deals with insiders'
language in Washington (where he is based) or with
trivialities uttered by some politico.
As Andrew Norman wrote, in a letter published in
this book on page 113, “You flit freely back and forth
between prescriptivism and descriptivism.” But are not
many of us guilty of that? We are descriptive of the
usages we accept and prescriptive—perhaps proscriptive
would be more descriptive—of those we do not
like. At least Safire expresses an opinion; whether the
reader agrees with him is another matter, as are the
questions of his accuracy, which arise fairly often, and
that of the suitability of his style, which, as far as I
know, has not been broached before. It ill behooves
me, excoriated recently as enamored of the “cheap
larf,” to criticize Safire's arch puns, which permeate—“enliven”
is probably the word his editor would
use—his articles, but I find some kinds of humor unsuitable
for reading, however they might evoke a
chuckle when uttered viva voce . A handful of examples,
from the book at hand:
Therefore, I stand uncorrected. [p. 112]
...“Get your hand off my knee.” (That's a mnemonic,
pronounced knee-MONIC.)
Ize Right? [title, p. 114]
Juggernaughty but Nice [title, p. 115]
...slanguist...[p. 116]
Lex Appeal [title, p. 121]
Logue-Rolling [title, p. 123]
[on -logue vs. -log:] Some people prefer their
logues sawed off...[p. 123]
But the Library of Congress wants to be non-U [in
its spelling of -logue words]. [ibid.]
Writing containing such labored figures makes for
hard reading. I am interested in what Safire has to say
about language but find myself stymied: I get the feeling
that he has deliberately created a minefield of
interruptions in thought through which I must pick
my way to the end. Notwithstanding the valuable role
he plays in inspiring nonlinguists to think about language
and in informing them about myriad facets of
the subject, I find it hard slogging (or, as he would
probably write, “sloguing”).
You Could Look It Up is the umpteenth collection
of Safire's columns and, like the previous collections,
contains a selection of letters from readers. It is those
that are so sorely missed in his column. True, there is
an occasional mention in his column of a point raised
by a correspondent, and the Letters section of the
Magazine prints a comment from time to time, but an
important feature of the books is their inclusion of far
more writer-reader interaction than one might suspect
from reading the column alone. For one thing, the
letter-writers call attention to errors or misinterpretations
and are largely critical. Safire cannot be accused
of being copy-proud (except, evidently, of awful puns,
as in “ Ms. is deliberately msterious , but at least it is
not deliberately msleading ” and other mscegenations).
There is no gainsaying that Safire is one of the
most influential writers on contemporary English, and
it is essential that his books be in the libraries of all
who are interested in the subject, regardless of their
alignment with his opinions. For one thing, he documents
many neologisms, an activity that endears him
to many working lexicographers. From the sometimes
cavalier manner in which he treats his subject, one
wonders if Safire feels the burden of the responsibility
he has toward his readers.
The publisher sent unrevised bound proofs from
which this review was prepared; unfortunately, there
was no proof of an index, but the publisher has assured
me that there will be one in the published book, a
rather essential ingredient of a work with this title.
Laurence Urdang
Webster's New World Guide to Current American
Usage
Here is a commonsense style book, useful to those
who have the education and common sense to be in
doubt about questions of English usage. It has some
problems, if you want to be sticky about things: on p.
xv we read:
...Einstein's Special Theory of Relativity does
not say that E = MC² and in leap year MC³.
Indeed it does not. But it does say E = mc² ; the version
with the capital M and C is, essentially, meaningless
to those familiar with the conventional symbolism used
in physics.
While I acknowledge that it is not easy to know
how to sort out the many topics to be covered in a
usage book, most reasonable writers have taken a stab
at writing an entry under a heading that seems a likely
place to look, then have provided a detailed index. Not
Bernice Randall. True, one can find different from ,
etc., in an entry so headed, but for absolute constructions
one is referred to an entry called “Covered with
onions, relish, and ketchup, I ate a hotdog at the ball-park.”
If the user wants to find out about misplaced
adjectives and adverbs , reference is made to the entry
“Electric shaver for women with delicate floral design
on the handle.” A search for only would be futile.
Perhaps the subject and treatment of usage need
some lightening up, but I am hard put to agree that
they are quite as frivolous and light-headed as this
book would have us believe. Fun is fun, but those who
might rely on such a book are quite serious about the
information they are seeking, and it is unfair to play
fast and loose with their sincerity. A sense of humor
about a subject is born of a feeling of security about it,
but security is the one characteristic often lacking
among those who would use Current American Usage .
There is no doubt that Randall enjoys her work.
But of what use is a long entry on spoonerisms? And of
what use are the interminable examples, for instance,
of the misuse of like for as , which draw out the entry
to three pages? More than four pages are devoted to
clichés (under the guise of “Lo and behold, it's man's
best friend.,” which, being an exclamation, really
ought to end in an exclamation point). The article on
British/American English (“There's no home like Eaton
Place.”) is a good one, but, at six pages, its utility is
questionable. In the matter of pronunciations of
BrEng names, it is an old-fashioned fantasy of Americans
that Brits go round saying POM-frit for Pontefract :
most Brits that I have heard give the name a
spelling pronunciation these days; and so with many of
the old shibboleths. Of what relevance (to usage, notwithstanding
the fact that the topic is interesting) is an
entry on eponyms (“John Bull and John Hancock are
not just any johns.”)? That is not, strictly speaking, a
subject pertinent to the title of the book.
All of which is to say that the book is an interesting
work on the language and contains accurate,
though longwinded information about what it covers,
“interesting and useful facts about American English.”
Its only real faults are its title, which belies the content,
the cutesy headings, and the lack of a truly detailed
index: self-indexing does not provide coverage of
sufficient detail. As a reference work on usage, it is far
from complete: The Simon and Schuster Publicity Department
could have used an entry on foreword/
forward (spelt “foreward” in the release accompanying
the review copy).
A longish section, “Some Troublesome Idiomatic
Prepositions,” and a “Glossary of Grammatical and
Linguistic Terms Used in This Book,” followed by a list
of “References,” sources associated with specific entries,
round out the work.
Laurence Urdang
Language Notes from Abroad
“Once more unto the breach for the warriors of
1'Académie Française in their uphill battle to preserve
the purity of their native tongue. Examples of franglais
which they find particularly monstrous are, I
hear, to be condemned to a newly created “Musée des
horreurs.” The first is “sponsor, sponsoriser, sponsorisation.”
The academy also calls upon all French to send
in further examples of “linguistic pollution,” observing
ruefully that this is one museum which will be open 12
months a year. But the savants have passed barman,
blazer, bobsleigh , and boycott as fit for inclusion in
their new dictionary.” [From The Times , 15 January
1988]
Letter to the Editor of The Times
Penny Perrick regrets (January 11) that “There is
no word in English to describe that particular, special
sort of pride that one feels in the achievements of one's
children.” But the verb kvell , which exactly expresses
that emotion, is already (like other Yiddish loanwords,
such as chutzpah, meshugga and nosh ) to be found in
the Supplement to the Oxford-English Dictionary .
If you think that the practice in some Muslim countries
of amputating the hand of a thief is harsh, beware
of participating in horse shows in England,
where there is no capital punishment but the issue
arises every few years:
A carriage and team of Cleveland Bay horses,
driven by Mr Fred Pendlebury...[were] approaching
the water obstacle during the cross-country
section of the Harrods International Grand Prix
when the leading pair became confused, turned
back and became entangled with the second pair.
Mr Pendlebury, of Smithills, near Bolton, Greater
Manchester, was eliminated.
[From The Times , 16 May 1988]
Loose Cannons & Red Herrings
Readers should be familiar with Robert Claiborne's
earlier books, especially Our Marvelous Native
Tongue: The Life and Times of the English Language .
One might say that subtitling the present book “A
Book of Lost Metaphors” is an example of a loose
canon [sic] — unless metaphor is taken in its broadest
sense—but one is unlikely to find red herrings here: the
etymologies of a few hundred words and phrases are
given, many not readily findable in standard works of
reference. The rationale behind referring to them as
“lost” arises from the author's observation of an unfortunate
state of affairs: because of an increasingly widespread
lack of familiarity with the basic, structural
elements of our culture—Greek and Roman mythology,
the Bible, literature, and ordinary historical
fact—people today are unable to discern the origins of
terms like aphrodisiac, Achilles [sic] heel or tendon,
meet one's Waterloo, sow dragon's teeth , and hand-writing
on the wall , to name a few. There are many, of
course, but unaccountably, they are not the focus of
this book.
Claiborne investigates and reports on expressions
like sow one's wild oats , about which he tells us little
or nothing: the modern Latinate designation Avena
fatua came too many centuries after the original expression
to have any relevance to it, so why bring up
the information that fatua is Latin for `foolish': it was
also Latin for `wild,' which might be more to the
point. In any event, it is hard to discern, from the arch
style affected in an attempt to make dull facts interesting,
just what is the origin of sow one's wild oats . In
many entries, Claiborne labors the obvious, offering
little or nothing we do not already know, could easily
imagine, or for which the author offers no explanation.
Among examples of the first are spit and polish,
on the spot, on the square, stick one's neck out , etc.
Examples of the last include spill the beans, square the
circle, stalemate , etc. Between these is an occasional
flash of useful wisdom, much of it pretty well covered
by other books of this type (which seem to be proliferating).
What is missing, for example, at square the circle ,
is the information that because the area of a circle is
mathematically calculated using pi , which is irrational,
there is no mathematical way of calculating the
dimensions of a square with the same area as that of a
given circle. But that does not mean that such a square
cannot exist. As for stalemate , which is related to
checkmate , would it not have been important to indicate
that the - mate part has nothing to do with English,
having been borrowed from checkmate which is a
loanword from Persian (and has nothing to do with
check , either).
Often, an entry offers nothing in the way of etymology
and merely explains the meaning. Does any
reader need an entry like this one?
straddle . When you straddle a horse, you've got
one leg on either side of the animal. When a
politican straddles an issue, he's in much the same
position.
Some speculative suggestions, as the derivation (or
reinforcement) from Seidlitz powders for take a powder
are sheer nonsense. Not all entries contain misleading,
dull, or incorrect information, but those that do
not are marked by a lack of originality.
Laurence Urdang
Word Maps
Dialect geography, a branch of dialectology, describes
certain features of the dialects of a language
and their distribution. The field is about 100 years old.
Most prominent among its earliest practitioners in
England was Joseph Wright, who prepared the six-volume
English Dialect Dictionary , which was published
between 1898 and 1905; the best-known contemporary
British specialist is Harold Orton. In America,
work proceeded space during the 1930s, largely under
the direction of Raven McDavid, Hans Kurath, and,
later, Harold Allen; more recently, Lee Pedersen and
others have investigated American English dialects.
Between 1948 and 1961, fieldworkers based at the University
of Leeds conducted the Survey of English Dialects,
which studied 313 localities in England (which,
as everyone ought to know, does not include Wales or
Scotland). The present book is extracted from the two
major works that resulted from the Survey, The Linguistic
Atlas of England (1978) and A Word Geography
of England (1974), both under the direction of Harold
Orton, aided by Sanderson and Widdowson in the latter
effort.
People generally seem to find dialect study interesting.
One letter writer to The Times [21 June 1988]
reported:
Our close neighbour... in Bere Regis, who was
born in the village and who speaks with a delicious
Dorset burr, always uses “I” instead of “me.”...
“Well, it makes company for I and company for
she.” Another of his happy expressions is inner-wards,
meaning `since,' as in...“I chucked him
out the door and he's not been back innerwards.”
Another reported [same date]:
Let's get it right. The Bristol for “me” is not “I,”
but “oi.” When I was teaching there, the explanation
invariably given by boys brought to me for
scrapping in the playground was: “Ee it oi, so oi
it ee.”
The 100 maps selected for representation from the
Survey yield information on several hundred words,
some of which are clear variants, others quite different
lexical entities. For instance, Map 34 shows the areas,
marked off by boundary lines, where the variants
chimley chimbley, chimmock, chimdey, chimbey , and
chimney occur. Map 33 shows the distribution of child
(most of southern England) and of bairn (north of a
slightly wavy line between Boston, on the Wash to the
east, and Lancaster, on the west coast).
The authors have provided a brief introduction
which is easy to follow, a list of suggested readings,
and the names and addresses of the several institutions
and societies in Britain where readers may indulge a
more intensive interest in dialect study. The maps are
clear, each occupying a full page, and the word information
is well set forth on them. Where necessary,
brief but not cryptic explanations are provided of any
information that might seem to be out of the ordinary.
I have only one nit to pick with the authors. In their
description of isoglosses , they write:
These are drawn to run midway between/
localities which were shown by the Survey of
English Dialects to use the different words or
pronunciations which are the subject of the map.
Although it is true that isoglosses, in effect, set off the
various areas where a particular usage was recorded,
more accurately an isogloss is drawn to connect sites
either where speakers employ both usages or where
speakers using one or the other live in very close proximity.
Hence, the term isogloss , from iso - `same' + gloss
`word,' to describe the line on a map where the terms
are of equal distribution. Isoglosses are to dialect maps
what isobars and isotherms are to weather maps, what
isobaths are to geophysical maps of the oceans, etc.
The authors are not alone in getting this wrong: it is
incorrect in some dictionaries.
In those countries where dialect study is undertaken,
dialectologists observe that there are today
many factors militating against the strict maintenance
of older dialect boundaries: the standardization of terminology
as adopted by national periodicals, news
services, radio, and television; the establishment of
“prestige” dialects and, through the media, their
promulgation; and the huge population shifts that
have taken place, particularly in the U.S. since WWII.
Such shifts have been somewhat slower in England,
but seem now to be speeding up. There are many
other, lesser factors at work, but taken together, all
tend toward standardization, especially as the older
speakers die off. In some respects, it may not be long
before certain aspects of dialect geography will be
largely historical. The importance of dialect is emphasized
regularly in the press, where we read about people
being killed, as in parts of India, because they use
the wrong shibboleths.
This book is a good introduction to the subject (in
England); those familiar with dialectology in
America, and those interested in the study in England
or, indeed, generally would be well advised to add
Word Maps to their libraries.
Laurence Urdang
American Literary Almanac
This is an interesting, useful reference book containing
information about the better-known writers of
America. It is divided into eighteen chapters varying
in length, each dealing with a different aspect of the
authors and their works, among them,
Writers Related to Writers
Schooldays (which colleges and universities
spawned which writers)
American Literary Pseudonyms
American Literary Title Sources
Literary Cons: Hoaxes, Frauds, and Plagiarism
in American Literature
The Profession of Authorship:
Authors/Publishers/ Editors/Agents
Thrown to the Wolves: Reviews and Reviewers
These are supplemented by an extensive Bibliography
and a detailed Index.
As can be seen from the chapter headings, some of
the material is trivial, but nonetheless interesting for
that. It is not at once apparent why the book is styled
an “almanac,” but that is unimportant: there is no
other book I know of that contains as much diverse
information about American writers as this one. Its
readability and organization make it suitable for
browsing—even for reading straight through—so in
that respect, at least, it does not resemble books in the
“Oxford Companion” series. It contains many photographs
of writers, some quite early; these enliven the
appearance of the book but accomplish little else, unless
one is interested in what Samuel Clemens looked
like at the age of 15 (as a printer's devil) or in the
appearance of Hart Crane standing in the middle of a
railroad track in Cleveland in 1916.
It is difficult to make any sensible connection between
the lives of authors and their creations. A handful
might have led colorful existences, some are objects
of interest because they died early, committed suicide,
were related to (other) famous people, and so forth;
but such information seldom reveals as much about
their output as do the creations themselves, and in
certain cases one is probably better off not knowing
quite so much.
This book appears to have been diligently researched
and has much to recommend it as an adjunct
to most libraries, public and private, large and small,
general and specialized.
Laurence Urdang
“Faculty protest against apartheid at Cornell.” [TV
news tease, WHEC, Rochester, . Submitted
by .]
“[the tenor] brings the opera to its climax in his final
suicide.” [From a review of Handel's Tamerlano in the issue of Stereo Review. Submitted by
.]
I would like to make a couple of comments on
articles in the Autumn 1988 issue [XV,2]. Re the article
on Cuthbert, Dickens uses intercourse to mean `communication
between people' in A Christmas Carol
when Scrooge says “I will not be the man I must have
been but for this intercourse” to the third Spirit.
I would think that the words grand and stretch
would be known to more people than two of the words
the author gives as being familiar ( chippy and hootch ).
Incidentally, I seem to recall reading somewhere
that skins as slang for `dollars' dates from frontier days
when trappers used animal skins as currency, and is
therefore much older than early 20th-century Harlem.
“...the party consisted of Beckett, Dame Peggy Ashcroft,
Harold Pinter, and the late Alan Webb.” [from The Times
Diary , , ]
| {
"pile_set_name": "Github"
} |
package org.deta.boot.vpc.process;
public class CacheProcess {
public static void main(String[] args){
}
} | {
"pile_set_name": "Github"
} |
module Control(instruction, reg_dst, jump, branch, mem_to_reg, alu_op, mem_write, alu_src, reg_write);
input wire[31:0] instruction;
output reg reg_dst;
output reg jump;
output reg branch;
output reg mem_to_reg;
output reg alu_op;
output reg mem_write;
output reg[1:0] alu_src;
output reg reg_write;
always @(*) begin
case (instruction[31:26])
// r-type
6'd0: begin
// break
if (instruction[5:0] == 6'd13) begin
reg_dst = 0; jump = 0; branch = 0; mem_to_reg = 0; alu_op = 0; mem_write = 0; alu_src = 2'b00; reg_write = 0;
end
// sll, srl, sra
else if (instruction[5:0] < 6'd4) begin
reg_dst = 1; jump = 0; branch = 0; mem_to_reg = 0; alu_op = 1; mem_write = 0; alu_src = 2'b10; reg_write = 1;
end
// srlv, srav
else if (instruction[5:0] < 6'd8) begin
reg_dst = 1; jump = 0; branch = 0; mem_to_reg = 0; alu_op = 1; mem_write = 0; alu_src = 2'b11; reg_write = 1;
end
// add, sub, and, or, xor, nor, slt
else begin
reg_dst = 1; jump = 0; branch = 0; mem_to_reg = 0; alu_op = 1; mem_write = 0; alu_src = 2'b00; reg_write = 1;
end
end
// j
6'd2: begin
reg_dst = 0; jump = 1; branch = 0; mem_to_reg = 0; alu_op = 0; mem_write = 0; alu_src = 2'b00; reg_write = 0;
end
// beq
6'd4: begin
reg_dst = 0; jump = 0; branch = 1; mem_to_reg = 0; alu_op = 0; mem_write = 0; alu_src = 2'b00; reg_write = 0;
end
// addi
6'd8: begin
reg_dst = 0; jump = 0; branch = 0; mem_to_reg = 0; alu_op = 0; mem_write = 0; alu_src = 2'b01; reg_write = 1;
end
// slti
6'd10: begin
reg_dst = 0; jump = 0; branch = 0; mem_to_reg = 0; alu_op = 0; mem_write = 0; alu_src = 2'b01; reg_write = 1;
end
// andi
6'd12: begin
reg_dst = 0; jump = 0; branch = 0; mem_to_reg = 0; alu_op = 0; mem_write = 0; alu_src = 2'b01; reg_write = 1;
end
// ori
6'd13: begin
reg_dst = 0; jump = 0; branch = 0; mem_to_reg = 0; alu_op = 0; mem_write = 0; alu_src = 2'b01; reg_write = 1;
end
// xori
6'd14: begin
reg_dst = 0; jump = 0; branch = 0; mem_to_reg = 0; alu_op = 0; mem_write = 0; alu_src = 2'b01; reg_write = 1;
end
// lui
6'd15: begin
reg_dst = 0; jump = 0; branch = 0; mem_to_reg = 0; alu_op = 0; mem_write = 0; alu_src = 2'b01; reg_write = 1;
end
// lw
6'd35: begin
reg_dst = 0; jump = 0; branch = 0; mem_to_reg = 1; alu_op = 0; mem_write = 0; alu_src = 2'b01; reg_write = 1;
end
// sw
6'd43: begin
reg_dst = 0; jump = 0; branch = 0; mem_to_reg = 0; alu_op = 0; mem_write = 1; alu_src = 2'b01; reg_write = 0;
end
// Careful! Don't create a latch here!
default: begin
reg_dst = 0; jump = 0; branch = 0; mem_to_reg = 0; alu_op = 0; mem_write = 0; alu_src = 2'b00; reg_write = 0;
end
endcase
end
endmodule
| {
"pile_set_name": "Github"
} |
// Reduces input image (_MainTex) by 2x2.
// Outputs maximum value in R, minimum in G.
Shader "Hidden/Contrast Stretch Reduction" {
Properties {
_MainTex ("Base (RGB)", 2D) = "white" {}
}
Category {
SubShader {
Pass {
ZTest Always Cull Off ZWrite Off
CGPROGRAM
#pragma vertex vert
#pragma fragment frag
#include "UnityCG.cginc"
struct v2f {
float4 position : SV_POSITION;
float2 uv[4] : TEXCOORD0;
};
uniform sampler2D _MainTex;
v2f vert (appdata_img v) {
v2f o;
o.position = mul (UNITY_MATRIX_MVP, v.vertex);
float2 uv = MultiplyUV (UNITY_MATRIX_TEXTURE0, v.texcoord);
// Compute UVs to sample 2x2 pixel block.
o.uv[0] = uv + float2(0,0);
o.uv[1] = uv + float2(0,1);
o.uv[2] = uv + float2(1,0);
o.uv[3] = uv + float2(1,1);
return o;
}
float4 frag (v2f i) : SV_Target
{
// Sample pixel block
float4 v00 = tex2D(_MainTex, i.uv[0]);
float2 v01 = tex2D(_MainTex, i.uv[1]).xy;
float2 v10 = tex2D(_MainTex, i.uv[2]).xy;
float2 v11 = tex2D(_MainTex, i.uv[3]).xy;
float4 res;
// output x: maximum of the four values
res.x = max( max(v00.x,v01.x), max(v10.x,v11.x) );
// output y: minimum of the four values
res.y = min( min(v00.y,v01.y), min(v10.y,v11.y) );
// output zw unchanged from the first pixel
res.zw = v00.zw;
return res;
}
ENDCG
}
}
}
Fallback off
}
| {
"pile_set_name": "Github"
} |
=== Reading Properties from a File
[role="byline"]
by Tobias Bayer
==== Problem
You need to read a property file and access its key/value pairs.(((files, reading properties from)))((("properties, reading from files")))(((Java, java.util.Properties)))(((keys, accessing key-value pairs)))
==== Solution
The most straightforward way is to use the built-in
http://bit.ly/javadoc-properties[+java.util.Properties+]
class via Java interop. +java.util.Properties+ implements
+java.util.Map+, which can be easily consumed from Clojure, just like
any other map.(((Java, java.util.Map)))((("I/O (input/output) streams", "accessing key-value pairs")))
Here is an example property file to load, _fruitcolors.properties_:
----
banana=yellow
grannysmith=green
----
Populating an instance of +Properties+ from a file is straightforward,
using its +load+ method and passing in an instance of +java.io.Reader+
obtained using the +clojure.java.io+ namespace:
[source,clojure]
----
(require '[clojure.java.io :refer (reader)])
(def props (java.util.Properties.))
(.load props (reader "fruitcolors.properties"))
;; -> nil
props
;; -> {"banana" "yellow", "grannysmith" "green"}
----
Instead of using the built-in +Properties+ API via interop, you could
also use the +propertea+ library for simpler, more idiomatic Clojure
access to property files.(((propertea library)))
Include the `[propertea "1.2.3"]` dependency in your _project.clj_
file, or start a REPL using +lein-try+:
[source,shell-session]
----
$ lein try propertea 1.2.3
----
Then read the property file and access its key/value pairs:
[source,clojure]
----
(require '[propertea.core :refer (read-properties)])
(def props (read-properties "fruitcolors.properties"))
props
;; -> {:grannysmith "green", :banana "yellow"}
(props :banana)
;; -> "yellow"
----
==== Discussion
Although using +java.util.Properties+ directly is more straightforward
and doesn't require the addition of a dependency, +propertea+ does
provide some convenience. It returns an actual immutable Clojure map,
instead of just a +java.util.Map+. Although both are perfectly usable
from Clojure, an immutable map is probably preferable if you intend to
do any further manipulation or updates on it.
More importantly, +propertea+ converts all string keys into keywords,
which are more commonly used than strings as the keys of maps in
Clojure.
Additionally, +propertea+ has several other features, such as the
capability to parse values into numbers or Booleans, and providing
default values.
By default, ++propertea++'s +read-properties+ function treats all
property values as strings. Consider a file +other.properties+ with
an integer and Boolean key:
----
intkey=42
booleankey=true
----
You can force these properties to be parsed into their respective
types by supplying lists for the +:parse-int+ and +:parse-boolean+
options:
[source,clojure]
----
(def props (read-properties "other.properties"
:parse-int [:intkey]
:parse-boolean [:booleankey]))
(props :intkey)
;; -> 42
(class (props :intkey))
;; -> java.lang.Integer
(props :booleankey)
;; -> true
(class (props :booleankey))
;; -> java.lang.Boolean
----
Sometimes the property file might not contain a key/value pair, and you might want to set a reasonable default value in this case:
[source,clojure]
----
(def props (read-properties "other.properties" :default [:otherkey "awesome"]))
(props :otherkey)
;; -> "awesome"
----
You can also be strict on required properties. If an expected property is missing in your property file, you can throw an exception:
[source,clojure]
----
(def props (read-properties "other.properties" :required [:otherkey]))
;; -> java.lang.RuntimeException: (:otherkey) are required ...
----
==== See Also
* The https://github.com/jaycfields/propertea[+propertea+ GitHub repository]
* The http://bit.ly/javadoc-properties[+Properties+ API documentation]
| {
"pile_set_name": "Github"
} |
/* finite(). RISC-V version.
Copyright (C) 2017-2020 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C 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 2.1 of the License, or (at your option) any later version.
The GNU C 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 the GNU C Library. If not, see
<https://www.gnu.org/licenses/>. */
#include <math.h>
#include <fenv_private.h>
int
__finite (double x)
{
return _FCLASS (x) & ~(_FCLASS_INF | _FCLASS_NAN);
}
hidden_def (__finite)
weak_alias (__finite, finite)
| {
"pile_set_name": "Github"
} |
package tenants
import (
"github.com/mitchellh/mapstructure"
"github.com/rackspace/gophercloud"
"github.com/rackspace/gophercloud/pagination"
)
// Tenant is a grouping of users in the identity service.
type Tenant struct {
// ID is a unique identifier for this tenant.
ID string `mapstructure:"id"`
// Name is a friendlier user-facing name for this tenant.
Name string `mapstructure:"name"`
// Description is a human-readable explanation of this Tenant's purpose.
Description string `mapstructure:"description"`
// Enabled indicates whether or not a tenant is active.
Enabled bool `mapstructure:"enabled"`
}
// TenantPage is a single page of Tenant results.
type TenantPage struct {
pagination.LinkedPageBase
}
// IsEmpty determines whether or not a page of Tenants contains any results.
func (page TenantPage) IsEmpty() (bool, error) {
tenants, err := ExtractTenants(page)
if err != nil {
return false, err
}
return len(tenants) == 0, nil
}
// NextPageURL extracts the "next" link from the tenants_links section of the result.
func (page TenantPage) NextPageURL() (string, error) {
type resp struct {
Links []gophercloud.Link `mapstructure:"tenants_links"`
}
var r resp
err := mapstructure.Decode(page.Body, &r)
if err != nil {
return "", err
}
return gophercloud.ExtractNextURL(r.Links)
}
// ExtractTenants returns a slice of Tenants contained in a single page of results.
func ExtractTenants(page pagination.Page) ([]Tenant, error) {
casted := page.(TenantPage).Body
var response struct {
Tenants []Tenant `mapstructure:"tenants"`
}
err := mapstructure.Decode(casted, &response)
return response.Tenants, err
}
| {
"pile_set_name": "Github"
} |
<?php if ( ! defined('BASEPATH')) exit('No direct script access allowed');
/*
| -------------------------------------------------------------------
| SMILEYS
| -------------------------------------------------------------------
| This file contains an array of smileys for use with the emoticon helper.
| Individual images can be used to replace multiple simileys. For example:
| :-) and :) use the same image replacement.
|
| Please see user guide for more info:
| http://codeigniter.com/user_guide/helpers/smiley_helper.html
|
*/
$smileys = array(
// smiley image name width height alt
':-)' => array('grin.gif', '19', '19', 'grin'),
':lol:' => array('lol.gif', '19', '19', 'LOL'),
':cheese:' => array('cheese.gif', '19', '19', 'cheese'),
':)' => array('smile.gif', '19', '19', 'smile'),
';-)' => array('wink.gif', '19', '19', 'wink'),
// ';)' => array('wink.gif', '19', '19', 'wink'),
':smirk:' => array('smirk.gif', '19', '19', 'smirk'),
':roll:' => array('rolleyes.gif', '19', '19', 'rolleyes'),
':-S' => array('confused.gif', '19', '19', 'confused'),
':wow:' => array('surprise.gif', '19', '19', 'surprised'),
':bug:' => array('bigsurprise.gif', '19', '19', 'big surprise'),
':-P' => array('tongue_laugh.gif', '19', '19', 'tongue laugh'),
'%-P' => array('tongue_rolleye.gif', '19', '19', 'tongue rolleye'),
';-P' => array('tongue_wink.gif', '19', '19', 'tongue wink'),
':P' => array('raspberry.gif', '19', '19', 'raspberry'),
':blank:' => array('blank.gif', '19', '19', 'blank stare'),
':long:' => array('longface.gif', '19', '19', 'long face'),
':ohh:' => array('ohh.gif', '19', '19', 'ohh'),
':grrr:' => array('grrr.gif', '19', '19', 'grrr'),
':gulp:' => array('gulp.gif', '19', '19', 'gulp'),
'8-/' => array('ohoh.gif', '19', '19', 'oh oh'),
':down:' => array('downer.gif', '19', '19', 'downer'),
':red:' => array('embarrassed.gif', '19', '19', 'red face'),
':sick:' => array('sick.gif', '19', '19', 'sick'),
':shut:' => array('shuteye.gif', '19', '19', 'shut eye'),
':-/' => array('hmm.gif', '19', '19', 'hmmm'),
'>:(' => array('mad.gif', '19', '19', 'mad'),
':mad:' => array('mad.gif', '19', '19', 'mad'),
'>:-(' => array('angry.gif', '19', '19', 'angry'),
':angry:' => array('angry.gif', '19', '19', 'angry'),
':zip:' => array('zip.gif', '19', '19', 'zipper'),
':kiss:' => array('kiss.gif', '19', '19', 'kiss'),
':ahhh:' => array('shock.gif', '19', '19', 'shock'),
':coolsmile:' => array('shade_smile.gif', '19', '19', 'cool smile'),
':coolsmirk:' => array('shade_smirk.gif', '19', '19', 'cool smirk'),
':coolgrin:' => array('shade_grin.gif', '19', '19', 'cool grin'),
':coolhmm:' => array('shade_hmm.gif', '19', '19', 'cool hmm'),
':coolmad:' => array('shade_mad.gif', '19', '19', 'cool mad'),
':coolcheese:' => array('shade_cheese.gif', '19', '19', 'cool cheese'),
':vampire:' => array('vampire.gif', '19', '19', 'vampire'),
':snake:' => array('snake.gif', '19', '19', 'snake'),
':exclaim:' => array('exclaim.gif', '19', '19', 'excaim'),
':question:' => array('question.gif', '19', '19', 'question') // no comma after last item
);
/* End of file smileys.php */
/* Location: ./application/config/smileys.php */ | {
"pile_set_name": "Github"
} |
/*******************************************************************************
* Copyright (c) 2004, 2009 Actuate Corporation.
* 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:
* Actuate Corporation - initial API and implementation
*******************************************************************************/
package org.eclipse.birt.report.engine.content;
/**
* Provides the interfaces for the AutoText Content.
* <p>
* AutoText Content is created at the start of the process, but the text value
* is set at the end of the process. The typical implementation of AutoText is
* total page of report.
* <p>
* The following types of the AutoText content are predefined:
* <li><code>TOTAL_PAGE</code></li>
* <li><code>PAGE_NUMBER</code></li>
*/
public interface IAutoTextContent extends ITextContent
{
public static final int TOTAL_PAGE = 0;
public static final int PAGE_NUMBER = 1;
public static final int UNFILTERED_TOTAL_PAGE = 2;
public static final int UNFILTERED_PAGE_NUMBER = 3;
public static final int PAGE_VARIABLE = 4;
/**
* Set the type of the AutoText Content. This type must be one of the
* predefines.
* <li><code>TOTAL_PAGE</code></li>
* <li><code>PAGE_NUMBER</code></li>
* @param type
* the type of the AutoText Content.
*/
void setType ( int type );
/**
* Get the type of the AutoText Content.
* <p>
* The return value must be on of the
* predefines.
* <li><code>TOTAL_PAGE</code></li>
* <li><code>PAGE_NUMBER</code></li>
*/
int getType ( );
}
| {
"pile_set_name": "Github"
} |
package ecs
//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.
//
// Code generated by Alibaba Cloud SDK Code Generator.
// Changes may cause incorrect behavior and will be lost if the code is regenerated.
import (
"github.com/aliyun/alibaba-cloud-sdk-go/sdk/requests"
"github.com/aliyun/alibaba-cloud-sdk-go/sdk/responses"
)
// DescribeSnapshots invokes the ecs.DescribeSnapshots API synchronously
// api document: https://help.aliyun.com/api/ecs/describesnapshots.html
func (client *Client) DescribeSnapshots(request *DescribeSnapshotsRequest) (response *DescribeSnapshotsResponse, err error) {
response = CreateDescribeSnapshotsResponse()
err = client.DoAction(request, response)
return
}
// DescribeSnapshotsWithChan invokes the ecs.DescribeSnapshots API asynchronously
// api document: https://help.aliyun.com/api/ecs/describesnapshots.html
// asynchronous document: https://help.aliyun.com/document_detail/66220.html
func (client *Client) DescribeSnapshotsWithChan(request *DescribeSnapshotsRequest) (<-chan *DescribeSnapshotsResponse, <-chan error) {
responseChan := make(chan *DescribeSnapshotsResponse, 1)
errChan := make(chan error, 1)
err := client.AddAsyncTask(func() {
defer close(responseChan)
defer close(errChan)
response, err := client.DescribeSnapshots(request)
if err != nil {
errChan <- err
} else {
responseChan <- response
}
})
if err != nil {
errChan <- err
close(responseChan)
close(errChan)
}
return responseChan, errChan
}
// DescribeSnapshotsWithCallback invokes the ecs.DescribeSnapshots API asynchronously
// api document: https://help.aliyun.com/api/ecs/describesnapshots.html
// asynchronous document: https://help.aliyun.com/document_detail/66220.html
func (client *Client) DescribeSnapshotsWithCallback(request *DescribeSnapshotsRequest, callback func(response *DescribeSnapshotsResponse, err error)) <-chan int {
result := make(chan int, 1)
err := client.AddAsyncTask(func() {
var response *DescribeSnapshotsResponse
var err error
defer close(result)
response, err = client.DescribeSnapshots(request)
callback(response, err)
result <- 1
})
if err != nil {
defer close(result)
callback(nil, err)
result <- 0
}
return result
}
// DescribeSnapshotsRequest is the request struct for api DescribeSnapshots
type DescribeSnapshotsRequest struct {
*requests.RpcRequest
ResourceOwnerId requests.Integer `position:"Query" name:"ResourceOwnerId"`
Filter2Value string `position:"Query" name:"Filter.2.Value"`
SnapshotIds string `position:"Query" name:"SnapshotIds"`
Usage string `position:"Query" name:"Usage"`
SnapshotLinkId string `position:"Query" name:"SnapshotLinkId"`
SnapshotName string `position:"Query" name:"SnapshotName"`
PageNumber requests.Integer `position:"Query" name:"PageNumber"`
ResourceGroupId string `position:"Query" name:"ResourceGroupId"`
Filter1Key string `position:"Query" name:"Filter.1.Key"`
PageSize requests.Integer `position:"Query" name:"PageSize"`
DiskId string `position:"Query" name:"DiskId"`
Tag *[]DescribeSnapshotsTag `position:"Query" name:"Tag" type:"Repeated"`
DryRun requests.Boolean `position:"Query" name:"DryRun"`
ResourceOwnerAccount string `position:"Query" name:"ResourceOwnerAccount"`
OwnerAccount string `position:"Query" name:"OwnerAccount"`
SourceDiskType string `position:"Query" name:"SourceDiskType"`
Filter1Value string `position:"Query" name:"Filter.1.Value"`
Filter2Key string `position:"Query" name:"Filter.2.Key"`
OwnerId requests.Integer `position:"Query" name:"OwnerId"`
InstanceId string `position:"Query" name:"InstanceId"`
Encrypted requests.Boolean `position:"Query" name:"Encrypted"`
SnapshotType string `position:"Query" name:"SnapshotType"`
KMSKeyId string `position:"Query" name:"KMSKeyId"`
Status string `position:"Query" name:"Status"`
}
// DescribeSnapshotsTag is a repeated param struct in DescribeSnapshotsRequest
type DescribeSnapshotsTag struct {
Value string `name:"Value"`
Key string `name:"Key"`
}
// DescribeSnapshotsResponse is the response struct for api DescribeSnapshots
type DescribeSnapshotsResponse struct {
*responses.BaseResponse
RequestId string `json:"RequestId" xml:"RequestId"`
TotalCount int `json:"TotalCount" xml:"TotalCount"`
PageNumber int `json:"PageNumber" xml:"PageNumber"`
PageSize int `json:"PageSize" xml:"PageSize"`
Snapshots Snapshots `json:"Snapshots" xml:"Snapshots"`
}
// CreateDescribeSnapshotsRequest creates a request to invoke DescribeSnapshots API
func CreateDescribeSnapshotsRequest() (request *DescribeSnapshotsRequest) {
request = &DescribeSnapshotsRequest{
RpcRequest: &requests.RpcRequest{},
}
request.InitWithApiInfo("Ecs", "2014-05-26", "DescribeSnapshots", "ecs", "openAPI")
return
}
// CreateDescribeSnapshotsResponse creates a response to parse from DescribeSnapshots response
func CreateDescribeSnapshotsResponse() (response *DescribeSnapshotsResponse) {
response = &DescribeSnapshotsResponse{
BaseResponse: &responses.BaseResponse{},
}
return
}
| {
"pile_set_name": "Github"
} |
/*
**********************************************************************
* Copyright (C) 1998-2012, International Business Machines
* Corporation and others. All Rights Reserved.
**********************************************************************
*
* File date.c
*
* Modification History:
*
* Date Name Description
* 06/11/99 stephen Creation.
* 06/16/99 stephen Modified to use uprint.
* 08/11/11 srl added Parse and milli/second in/out
*******************************************************************************
*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "unicode/utypes.h"
#include "unicode/ustring.h"
#include "unicode/uclean.h"
#include "unicode/ucnv.h"
#include "unicode/udat.h"
#include "unicode/ucal.h"
#include "uprint.h"
int main(int argc, char **argv);
#if UCONFIG_NO_FORMATTING || UCONFIG_NO_CONVERSION
int main(int argc, char **argv)
{
printf("%s: Sorry, UCONFIG_NO_FORMATTING or UCONFIG_NO_CONVERSION was turned on (see uconfig.h). No formatting can be done. \n", argv[0]);
return 0;
}
#else
/* Protos */
static void usage(void);
static void version(void);
static void date(UDate when, const UChar *tz, UDateFormatStyle style, const char *format, UErrorCode *status);
static UDate getWhen(const char *millis, const char *seconds, const char *format, UDateFormatStyle style, const char *parse, const UChar *tz, UErrorCode *status);
UConverter *cnv = NULL;
/* The version of date */
#define DATE_VERSION "1.0"
/* "GMT" */
static const UChar GMT_ID [] = { 0x0047, 0x004d, 0x0054, 0x0000 };
#define FORMAT_MILLIS "%"
#define FORMAT_SECONDS "%%"
int
main(int argc,
char **argv)
{
int printUsage = 0;
int printVersion = 0;
int optInd = 1;
char *arg;
const UChar *tz = 0;
UDateFormatStyle style = UDAT_DEFAULT;
UErrorCode status = U_ZERO_ERROR;
const char *format = NULL;
char *parse = NULL;
char *seconds = NULL;
char *millis = NULL;
UDate when;
/* parse the options */
for(optInd = 1; optInd < argc; ++optInd) {
arg = argv[optInd];
/* version info */
if(strcmp(arg, "-v") == 0 || strcmp(arg, "--version") == 0) {
printVersion = 1;
}
/* usage info */
else if(strcmp(arg, "-h") == 0 || strcmp(arg, "--help") == 0) {
printUsage = 1;
}
/* display date in gmt */
else if(strcmp(arg, "-u") == 0 || strcmp(arg, "--gmt") == 0) {
tz = GMT_ID;
}
/* display date in gmt */
else if(strcmp(arg, "-f") == 0 || strcmp(arg, "--full") == 0) {
style = UDAT_FULL;
}
/* display date in long format */
else if(strcmp(arg, "-l") == 0 || strcmp(arg, "--long") == 0) {
style = UDAT_LONG;
}
/* display date in medium format */
else if(strcmp(arg, "-m") == 0 || strcmp(arg, "--medium") == 0) {
style = UDAT_MEDIUM;
}
/* display date in short format */
else if(strcmp(arg, "-s") == 0 || strcmp(arg, "--short") == 0) {
style = UDAT_SHORT;
}
else if(strcmp(arg, "-F") == 0 || strcmp(arg, "--format") == 0) {
if ( optInd + 1 < argc ) {
optInd++;
format = argv[optInd];
}
} else if(strcmp(arg, "-r") == 0) {
if ( optInd + 1 < argc ) {
optInd++;
seconds = argv[optInd];
}
} else if(strcmp(arg, "-R") == 0) {
if ( optInd + 1 < argc ) {
optInd++;
millis = argv[optInd];
}
} else if(strcmp(arg, "-P") == 0) {
if ( optInd + 1 < argc ) {
optInd++;
parse = argv[optInd];
}
}
/* POSIX.1 says all arguments after -- are not options */
else if(strcmp(arg, "--") == 0) {
/* skip the -- */
++optInd;
break;
}
/* unrecognized option */
else if(strncmp(arg, "-", strlen("-")) == 0) {
printf("icudate: invalid option -- %s\n", arg+1);
printUsage = 1;
}
/* done with options, display date */
else {
break;
}
}
/* print usage info */
if(printUsage) {
usage();
return 0;
}
/* print version info */
if(printVersion) {
version();
return 0;
}
/* get the 'when' (or now) */
when = getWhen(millis, seconds, format, style, parse, tz, &status);
if(parse != NULL) {
format = FORMAT_MILLIS; /* output in millis */
}
/* print the date */
date(when, tz, style, format, &status);
ucnv_close(cnv);
u_cleanup();
return (U_FAILURE(status) ? 1 : 0);
}
/* Usage information */
static void
usage()
{
puts("Usage: icudate [OPTIONS]");
puts("Options:");
puts(" -h, --help Print this message and exit.");
puts(" -v, --version Print the version number of date and exit.");
puts(" -u, --gmt Display the date in Greenwich Mean Time.");
puts(" -f, --full Use full display format.");
puts(" -l, --long Use long display format.");
puts(" -m, --medium Use medium display format.");
puts(" -s, --short Use short display format.");
puts(" -F <format>, --format <format> Use <format> as the display format.");
puts(" (Special formats: \"%\" alone is Millis since 1970, \"%%\" alone is Seconds since 1970)");
puts(" -r <seconds> Use <seconds> as the time (Epoch 1970) rather than now.");
puts(" -R <millis> Use <millis> as the time (Epoch 1970) rather than now.");
puts(" -P <string> Parse <string> as the time, output in millis format.");
}
/* Version information */
static void
version()
{
UErrorCode status = U_ZERO_ERROR;
const char *tzVer;
int len = 256;
UChar tzName[256];
printf("icudate version %s, created by Stephen F. Booth.\n",
DATE_VERSION);
puts(U_COPYRIGHT_STRING);
tzVer = ucal_getTZDataVersion(&status);
if(U_FAILURE(status)) {
tzVer = u_errorName(status);
}
printf("\n");
printf("ICU Version: %s\n", U_ICU_VERSION);
printf("ICU Data (major+min): %s\n", U_ICUDATA_NAME);
printf("Default Locale: %s\n", uloc_getDefault());
printf("Time Zone Data Version: %s\n", tzVer);
printf("Default Time Zone: ");
status = U_ZERO_ERROR;
u_init(&status);
len = ucal_getDefaultTimeZone(tzName, len, &status);
if(U_FAILURE(status)) {
fprintf(stderr, " ** Error getting default zone: %s\n", u_errorName(status));
}
uprint(tzName, stdout, &status);
printf("\n\n");
}
static int32_t charsToUCharsDefault(UChar *uchars, int32_t ucharsSize, const char*chars, int32_t charsSize, UErrorCode *status) {
int32_t len=-1;
if(U_FAILURE(*status)) return len;
if(cnv==NULL) {
cnv = ucnv_open(NULL, status);
}
if(cnv&&U_SUCCESS(*status)) {
len = ucnv_toUChars(cnv, uchars, ucharsSize, chars,charsSize, status);
}
return len;
}
/* Format the date */
static void
date(UDate when,
const UChar *tz,
UDateFormatStyle style,
const char *format,
UErrorCode *status )
{
UChar *s = 0;
int32_t len = 0;
UDateFormat *fmt;
UChar uFormat[100];
if(U_FAILURE(*status)) return;
if( format != NULL ) {
if(!strcmp(format,FORMAT_MILLIS)) {
printf("%.0f\n", when);
return;
} else if(!strcmp(format, FORMAT_SECONDS)) {
printf("%.3f\n", when/1000.0);
return;
}
}
fmt = udat_open(style, style, 0, tz, -1,NULL,0, status);
if ( format != NULL ) {
charsToUCharsDefault(uFormat,sizeof(uFormat)/sizeof(uFormat[0]),format,-1,status);
udat_applyPattern(fmt,FALSE,uFormat,-1);
}
len = udat_format(fmt, when, 0, len, 0, status);
if(*status == U_BUFFER_OVERFLOW_ERROR) {
*status = U_ZERO_ERROR;
s = (UChar*) malloc(sizeof(UChar) * (len+1));
if(s == 0) goto finish;
udat_format(fmt, when, s, len + 1, 0, status);
}
if(U_FAILURE(*status)) goto finish;
/* print the date string */
uprint(s, stdout, status);
/* print a trailing newline */
printf("\n");
finish:
if(U_FAILURE(*status)) {
fprintf(stderr, "Error in Print: %s\n", u_errorName(*status));
}
udat_close(fmt);
free(s);
}
static UDate getWhen(const char *millis, const char *seconds, const char *format,
UDateFormatStyle style, const char *parse, const UChar *tz, UErrorCode *status) {
UDateFormat *fmt = NULL;
UChar uFormat[100];
UChar uParse[256];
UDate when=0;
int32_t parsepos = 0;
if(millis != NULL) {
sscanf(millis, "%lf", &when);
return when;
} else if(seconds != NULL) {
sscanf(seconds, "%lf", &when);
return when*1000.0;
}
if(parse!=NULL) {
if( format != NULL ) {
if(!strcmp(format,FORMAT_MILLIS)) {
sscanf(parse, "%lf", &when);
return when;
} else if(!strcmp(format, FORMAT_SECONDS)) {
sscanf(parse, "%lf", &when);
return when*1000.0;
}
}
fmt = udat_open(style, style, 0, tz, -1,NULL,0, status);
if ( format != NULL ) {
charsToUCharsDefault(uFormat,sizeof(uFormat)/sizeof(uFormat[0]), format,-1,status);
udat_applyPattern(fmt,FALSE,uFormat,-1);
}
charsToUCharsDefault(uParse,sizeof(uParse)/sizeof(uParse[0]), parse,-1,status);
when = udat_parse(fmt, uParse, -1, &parsepos, status);
if(U_FAILURE(*status)) {
fprintf(stderr, "Error in Parse: %s\n", u_errorName(*status));
if(parsepos > 0 && parsepos <= (int32_t)strlen(parse)) {
fprintf(stderr, "ERR>\"%s\" @%d\n"
"ERR> %*s^\n",
parse,parsepos,parsepos,"");
}
}
udat_close(fmt);
return when;
} else {
return ucal_getNow();
}
}
#endif
| {
"pile_set_name": "Github"
} |
#!/bin/sh
# SleepyHollow
printf "\033]4;0;#572100;1;#ba3934;2;#91773f;3;#b55600;4;#5f63b4;5;#a17c7b;6;#8faea9;7;#af9a91;8;#4e4b61;9;#d9443f;10;#d6b04e;11;#f66813;12;#8086ef;13;#e2c2bb;14;#a4dce7;15;#d2c7a9\007"
printf "\033]10;#af9a91;#121214;#af9a91\007"
printf "\033]17;#575256\007"
printf "\033]19;#d2c7a9\007"
printf "\033]5;0;#af9a92\007"
| {
"pile_set_name": "Github"
} |
# These definitions are for the benefit of independent software contained -*- makefile -*-
# in ROSE. (Currently, this means SAGE and ROSETTA.)
# It defines ROSE_INCLUDES and ROSE_LIBS so they can use the ROSE codes.
# ROSE_INCLUDES contains the include flags for compiling with ROSE code.
# (ROSE software should set the include paths in their respective Makefile.am
# files, since they are expected to know the ROSE source tree structure.)
# To use ROSE_INCLUDES, the independent software packages contained in ROSE
# should define the variable ROSE_HOME to be the relative path to the root
# of the ROSE directory tree.
# This fixes some problem caused by automake or autoconf
# (detailed documentation is in the ChangeLog)
# MAKE=gmake
# DQ (8/10/2007): Valentin suggested this be commented out.
# DQ (4/23/2006): This is the default when build using automake version 1.6.3 but it
# causes errors so we would like to specify --run automake instead
# AUTOMAKE = ${SHELL} $(top_srcdir)/config/missing --run automake-1.6
# AUTOMAKE = ${SHELL} $(top_srcdir)/config/missing --run automake
# force ranlib to just call touch so that *.so (dynamic libraries) will not
# be run with ranlib (which is a error). This allows us to use dynamic
# libraries as the default within ROSE.
# JJW 7/25/2008: Do we really need this?
## RANLIB = touch
# JJW (2/25/2008): set a flag (only used when running ROSE applications) to
# have them run using the build tree rather than the install tree -- this is
# important for "make check" in an uninstalled copy of ROSE.
if USE_ROSE_IN_BUILD_TREE_VAR
export ROSE_IN_BUILD_TREE=$(top_builddir)
endif
# DQ (12/22/2008): Specification of Boost path for use with "-isystem" option (may be GNU
# specific). We use this option only if the configuration of ROSE has detected a
# previously installed version of Boost (which we do not want to use).
# Note that only one of these will be non-empty makefile variables.
ROSE_BOOST_PREINCLUDE_PATH = @ROSE_BOOST_PREINCLUDE_PATH@
ROSE_BOOST_NORMAL_INCLUDE_PATH = @ROSE_BOOST_NORMAL_INCLUDE_PATH@
# SQLite is a simpler database to use than MySQL
if ROSE_USE_SQLITE_DATABASE
ROSE_SQLITE_DATABASE_INCLUDE = $(SQLITE3_CFLAGS)
SQLITE_DATABASE_INCLUDE = $(SQLITE3_CFLAGS) -I$(top_srcdir)/src/roseExtensions/sqlite3x
SQLITE_DATABASE_LIBS = $(SQLITE3_LDFLAGS)
# ROSE_SQLITE_DATABASE_OBJS = $(top_builddir)/src/roseExtensions/sqlite3x/*o
ROSE_SQLITE_DATABASE_LIB_NAME = RoseSQLite3xDatabase
ROSE_SQLITE_DATABASE_LIB_FILE = lib$(ROSE_SQLITE_DATABASE_LIB_NAME).la
ROSE_SQLITE_DATABASE_LIBS = -l$(ROSE_SQLITE_DATABASE_LIB_NAME)
ROSE_SIDEEFFECT_INCLUDE = -I$(top_srcdir)/src/midend/programAnalysis/sideEffectAnalysis
endif
if ROSE_HAVE_LIBZ3
Z3_LIB_NAME = z3
Z3_LIB_FILE = lib$(Z3_LIB_NAME).so
Z3_LIBS = -l$(Z3_LIB_NAME)
Z3_INCLUDES = -I$(Z3_PREFIX)/include
Z3_LIB_INCLUDES = -L$(Z3_PREFIX)/lib
# The previous "Z3_*" variables should have been named "ROSE_Z3_*" following the pattern in the rest of this
# makefile. I don't want to break code that uses the wrong names, so I'll just add the correct ones. [Matzke 2017-10-17]
ROSE_Z3_INCLUDES = -I@ROSE_Z3_PREFIX@/include
ROSE_Z3_LIBS = -lz3
ROSE_Z3_LIBS_WITH_PATH = -L@ROSE_Z3_PREFIX@/lib -lz3
endif
# This is properly handled by automake even when specified in an include file
EDG_LIBS = @EDG_LIBS@
RT_LIBS = @RT_LIBS@
VALGRIND_BINARY = @VALGRIND_BINARY@
# Conditional support for Gabriel's QRose GUI Library
if ROSE_USE_QT
# ROSE_GUI_INCLUDE = -I${QROSE_PREFIX}/include
ROSE_GUI_INCLUDE = -I$(top_srcdir)/src/3rdPartyLibraries/qrose/Framework -I$(top_srcdir)/src/3rdPartyLibraries/qrose/Widgets -I$(top_srcdir)/src/3rdPartyLibraries/qrose/Components/Common -I$(top_srcdir)/src/3rdPartyLibraries/qrose/Components/QueryBox -I$(top_srcdir)/src/3rdPartyLibraries/qrose/Components/TreeBox -I$(top_srcdir)/src/3rdPartyLibraries/qrose/Components/QueryBox -I$(top_srcdir)/src/3rdPartyLibraries/qrose/Components/SourceBox
# ROSE_GUI_LIBS = -lqrose
# ROSE_GUI_LIBS_WITH_PATH = -L${QROSE_PREFIX}/lib -lqrose
# ROSE_GUI_LIBS_WITH_PATH = -L${top_builddir}/src/3rdPartyLibraries/qrose/QRoseLib/ -lqrose
ROSE_GUI_LIBS_WITH_PATH = ${top_builddir}/src/3rdPartyLibraries/qrose/QRoseLib/libqrose.la
# ROSE_GUI_LIB_FILE = libqrose.a
endif
if ROSE_USE_QT
ROSE_QT_INCLUDE = $(QT_INCLUDES)
# ROSE_QT_LIBS = -lqt
ROSE_QT_LIBS_WITH_PATH = ${QT_LDFLAGS}
# ROSE_QT_LIB_FILE = libqt.a
endif
# ROSE-HPCToolkit module
if ROSE_BUILD_ROSEHPCT
ROSE_ROSEHPCT_INCLUDES = -I$(top_srcdir)/src/roseExtensions/roseHPCToolkit/include
ROSE_ROSEHPCT_LIBS = -lrosehpct
ROSE_ROSEHPCT_LIBS_WITH_PATH = $(top_builddir)/src/roseExtensions/roseHPCToolkit/src/librosehpct.la
# ROSE_ROSEHPCT_LIB_FILE = librosehpct.so
endif
# ROSE-YICES Package (destributed by SRI as a static library)
if ROSE_HAVE_LIBYICES
ROSE_YICES_INCLUDES = -I@ROSE_YICES_PREFIX@/include
ROSE_YICES_LIBS = -lyices
ROSE_YICES_LIBS_WITH_PATH = @ROSE_YICES_PREFIX@/lib/libyices.a
endif
# YAML-CPP package for parsing YAML/JSON files
if ROSE_HAVE_LIBYAML
ROSE_YAML_INCLUDES = -I@ROSE_YAML_PREFIX@/include
ROSE_YAML_LIBS = -lyaml-cpp
ROSE_YAML_LIBS_WITH_PATH = -L@ROSE_YAML_PREFIX@/lib -lyaml-cpp
endif
# GNU readline
if ROSE_WITH_LIBREADLINE
ROSE_READLINE_INCLUDES = -I@LIBREADLINE_INCLUDE_PATH@
ROSE_READLINE_LIBS = @LIBREADLINE_LIBS@
ROSE_READLINE_LIBS_WITH_PATH = -L@LIBREADLINE_LIBRARY_PATH@ $(ROSE_READLINE_LIBS)
endif
# libmagic for identifying file types based on magic numbers
if ROSE_HAVE_LIBMAGIC
ROSE_LIBMAGIC_INCLUDES = -I@ROSE_LIBMAGIC_PREFIX@/include
ROSE_LIBMAGIC_LIBS = -lmagic
ROSE_LIBMAGIC_LIBS_WITH_PATH = -L@ROSE_LIBMAGIC_PREFIX@/lib -lmagic
endif
# PostgreSQL C++ API
if ROSE_HAVE_LIBPQXX
ROSE_LIBPQXX_INCLUDES = -I@ROSE_LIBPQXX_PREFIX@/include
ROSE_LIBPQXX_LIBS = -lpqxx -lpq
ROSE_LIBPQXX_LIBS_WITH_PATH = -L@ROSE_LIBPQXX_PREFIX@/lib -lpqxx -lpq
endif
# Capstone disassembler
if ROSE_HAVE_CAPSTONE
ROSE_CAPSTONE_INCLUDES = -I@ROSE_CAPSTONE_PREFIX@/include
ROSE_CAPSTONE_LIBS = -lcapstone
ROSE_CAPSTONE_LIBS_WITH_PATH = -L@ROSE_CAPSTONE_PREFIX@/lib -lcapstone
endif
# Math algorithms from http://dlib.net. This is a headers-only library neede by some binary analyses.
if ROSE_HAVE_DLIB
ROSE_DLIB_INCLUDES = -I@DLIB_PREFIX@
ROSE_DLIB_LIBS =
ROSE_DLIB_LIBS_WITH_PATH =
endif
# DQ (11/4/2016): Adding support for use of Address Sanitizer (for where the ROSE Test Handler (RTH) is used.
# Note the quotes and escapes that are required:
ADDRESS_SANITIZER_OPTIONS = "ASAN_OPTIONS=symbolize=1:detect_leaks=0 ASAN_SYMBOLIZER_PATH=\`which llvm-symbolizer\`"
# DQ(11/4/2016): Need a version when not using the ROSE Test Handler (RTH):
NON_RTH_ADDRESS_SANITIZER_OPTIONS = ASAN_OPTIONS=symbolize=1:detect_leaks=0 ASAN_SYMBOLIZER_PATH=`which llvm-symbolizer`
GLUT_LIBS = ${glut_path}
if ROSE_HAVE_LIBELF
ROSE_ELF_INCLUDES = @LIBELF_CPPFLAGS@
ROSE_ELF_LIBS_WITH_PATH = @LIBELF_LDFLAGS@
endif
# ROSE gcrypt support (for things like md5, sha1, etc)
if ROSE_HAVE_LIBGCRYPT
ROSE_GCRYPT_INCLUDES = @LIBGCRYPT_CPPFLAGS@
ROSE_GCRYPT_LIBS_WITH_PATH = @LIBGCRYPT_LDFLAGS@
endif
# ROSE-DWARF libdwarf support
if ROSE_HAVE_LIBDWARF
ROSE_DWARF_INCLUDES = @LIBDWARF_CPPFLAGS@
if ROSE_USE_INTEL_PIN
# DQ (3/13/2009):
# If Dwarf is used with Intel Pin then reference the same copy of libdwarf.a (in the same
# directory). However, it does NOT work to link both references to libdwarf into more
# than one dynamic (shared) library, so we need to link libdwarf dynamically.
# To avoid additional LD_LIBRARY_PATH requirements, we do so using rpath.
# To support this the libdwarf.so should be placed into $(INTEL_PIN_PATH)/intel64/lib-ext
# and the static libdwarf.a moved out (renamed) so that it will not be used.
# Note that this will also cause librose.so to use the shared library for
# dwarf when used with Intel Pin.
ROSE_DWARF_LIBS_WITH_PATH = -L$(INTEL_PIN_PATH)/intel64/lib-ext -ldwarf -lelf
# DQ (3/14/2009): This factors the lib paths.
INTEL_PIN_WITH_DWARF_LIBS_PATH = $(INTEL_PIN_LIB_PATHS) -lpin -lxed -ldl $(ROSE_DWARF_LIBS_WITH_PATH)
else
ROSE_DWARF_LIBS_WITH_PATH = @LIBDWARF_LDFLAGS@
endif
endif
# ROSE-WINE Package (Wine is a package to permit execution of Windows binaries under Linux)
if ROSE_USE_WINDOWS_ANALYSIS_SUPPORT
ROSE_WINE_INCLUDES = -I$(wine_path)/include
endif
if ROSE_USE_PHP
ROSE_PHP_INCLUDES = -I$(php_path)/include/phc -I$(php_path)/include/php
ROSE_PHP_LIBS = -lphp5 -lphc -lltdl
ROSE_PHP_LIBS_WITH_PATH = $(php_path)/lib/libphc.so $(php_path)/lib/libphp5.so $(LIBLTDL)
endif
# ASR (06/09/2010): adding llvm support variables
if ROSE_USE_LLVM
ROSE_LLVM_INCLUDES = -I$(llvm_path)/include
ROSE_LLVM_LIBS = -L$(llvm_path)/lib -lLLVMXCoreCodeGen -lLLVMXCoreAsmPrinter -lLLVMXCoreInfo -lLLVMSystemZCodeGen -lLLVMSystemZAsmPrinter -lLLVMSystemZInfo -lLLVMSparcCodeGen -lLLVMSparcAsmPrinter -lLLVMSparcInfo -lLLVMPowerPCCodeGen -lLLVMPowerPCAsmPrinter -lLLVMPowerPCInfo -lLLVMpic16passes -lLLVMPIC16AsmPrinter -lLLVMPIC16CodeGen -lLLVMPIC16Info -lLLVMMSP430CodeGen -lLLVMMSP430AsmPrinter -lLLVMMSP430Info -lLLVMMSIL -lLLVMMSILInfo -lLLVMMipsAsmPrinter -lLLVMMipsCodeGen -lLLVMMipsInfo -lLLVMMBlazeAsmPrinter -lLLVMMBlazeCodeGen -lLLVMMBlazeInfo -lLLVMLinker -lLLVMipo -lLLVMInterpreter -lLLVMInstrumentation -lLLVMJIT -lLLVMExecutionEngine -lLLVMCppBackend -lLLVMCppBackendInfo -lLLVMCellSPUCodeGen -lLLVMCellSPUAsmPrinter -lLLVMCellSPUInfo -lLLVMCBackend -lLLVMCBackendInfo -lLLVMBlackfinCodeGen -lLLVMBlackfinAsmPrinter -lLLVMBlackfinInfo -lLLVMBitWriter -lLLVMX86Disassembler -lLLVMX86AsmParser -lLLVMX86AsmPrinter -lLLVMX86CodeGen -lLLVMX86Info -lLLVMAsmParser -lLLVMARMAsmParser -lLLVMMCParser -lLLVMARMAsmPrinter -lLLVMARMCodeGen -lLLVMARMInfo -lLLVMArchive -lLLVMBitReader -lLLVMAlphaCodeGen -lLLVMSelectionDAG -lLLVMAlphaAsmPrinter -lLLVMAsmPrinter -lLLVMCodeGen -lLLVMScalarOpts -lLLVMInstCombine -lLLVMTransformUtils -lLLVMipa -lLLVMAnalysis -lLLVMTarget -lLLVMMC -lLLVMCore -lLLVMAlphaInfo -lLLVMSupport -lLLVMSystem
# adding all libraries for now
endif
# Python API support
if ROSE_USE_PYTHON_DEV
ROSE_PYTHON_INCLUDES = @PYTHON_CPPFLAGS@
ROSE_PYTHON_LIBS_WITH_PATH = @PYTHON_LDFLAGS@
endif
# SSL support permits use of MD5 checksums internally for binary library identification.
if ROSE_USE_SSL_SUPPORT
ROSE_SSL_LIBS = -lssl -lcrypto
endif
# support for precompiled headers
if ROSE_PCH
ROSE_PCH_INCLUDE = -Winvalid-pch -fPIC -DPIC
endif
if ROSE_USE_INTEL_PIN
INTEL_PIN_PATH = @IntelPin_path@
INTEL_PIN_INCLUDE_PATHS = -I$(INTEL_PIN_PATH)/source/include -I$(INTEL_PIN_PATH)/source/include/gen -I$(INTEL_PIN_PATH)/extras/xed2-intel64/include -I$(INTEL_PIN_PATH)/source/tools/InstLib
# DQ (3/8/2009): These cause rose/src/testSharedRoseLib to fail, I don't know why (fails in system call to map()).
# INTEL_PIN_LIB_PATHS = -L$(INTEL_PIN_PATH)/intel64/lib -L$(INTEL_PIN_PATH)/extras/xed2-intel64/lib -L$(INTEL_PIN_PATH)/intel64/lib-ext
INTEL_PIN_LIB_PATHS = -L$(INTEL_PIN_PATH)/intel64/lib -L$(INTEL_PIN_PATH)/extras/xed2-intel64/lib
# Do we want to handle this differently when Dwarf is used optionally with ROSE.
INTEL_PIN_LIBS = -lpin -lxed -ldwarf -lelf -ldl
#if ROSE_HAVE_LIBDWARF
# INTEL_PIN_LIBS = -lpin -lxed -lelf -ldl
#else
# INTEL_PIN_LIBS = -lpin -lxed -ldwarf -lelf -ldl
#endif
endif
if ROSE_USE_ETHER
ROSE_ETHER_INCLUDE = -I$(ETHER_PREFIX)/include
ROSE_ETHER_LIBS = -L$(ETHER_PREFIX)/lib -lxenctrl
endif
if ROSE_WITH_ATERM
ROSE_ATERM_INCLUDE = -I$(ATERM_LIBRARY_PATH)/../include
ROSE_ATERM_LIBS = -L$(ATERM_LIBRARY_PATH) -lATerm
endif
# Added support for Fortran front-end development using the flang (F18) compiler [Rasmussen 8/12/2019]
if ROSE_EXPERIMENTAL_FLANG_ROSE_CONNECTION
ROSE_FLANG_INCLUDES = -I$(FLANG_INSTALL_PATH)/include
ROSE_FLANG_LIBS = -L$(FLANG_INSTALL_PATH)/lib -lLLVMDemangle -lLLVMSupport -lLLVMFrontendOpenMP -lFortranParser -lFortranSemantics -lFortranEvaluate -lFortranCommon -lFortranDecimal -lFortranLower -lncurses
endif
# DQ (5/9/2017): Adding Ada library support.
if ROSE_EXPERIMENTAL_ADA_ROSE_CONNECTION
# ROSE_ADA_INCLUDES = -I$(ada_path)/include_xxx
ROSE_ADA_INCLUDES = -I$(ada_path)/include_xxx
DOT_ASIS_LIB_DIR_ ?= /home/quinlan1/ROSE/ADA/dot_asis/dot_asis_library/lib
ROSE_ADA_LIBS = -ldot_asis
ROSE_ADA_LIBS_WITH_PATH = $(DOT_ASIS_LIB_DIR_)/libdot_asis.so
endif
# RASMUSSEN (10/24/2017): Adding the GnuCOBOL parse-tree library support.
if ROSE_EXPERIMENTAL_COBOL_ROSE_CONNECTION
ROSE_COBOL_PT_LIBS_WITH_PATH = -L$(COBPT_LIBRARY_PATH) -lcob -lcobpt
endif
if ROSE_USE_EDG_QUAD_FLOAT
ROSE_QUAD_FLOAT_MATH = -lquadmath
endif
# DQ (1/9/2010): Added use of libimf with libm (the two go together when using Intel icc and icpc)
if USING_INTEL_COMPILER
# ROSE_INTEL_COMPILER_MATH_LIBS = -limf -lm
# DQ (11/16/2017): We need to link in these Intel specific required libraries to avoid: error hidden symbol `__intel_cpu_features_init_x'
# ROSE_INTEL_COMPILER_MATH_LIBS =
ROSE_INTEL_COMPILER_MATH_LIBS = -limf -lirng -lintlc -lsvml
if ROSE_BUILD_FORTRAN_LANGUAGE_SUPPORT
# ROSE_INTEL_COMPILER_MATH_LIBS += -limf
endif
ROSE_INTEL_COMPILER_MATH_LIBS += -lm
endif
if USING_CLANG_COMPILER
# DQ (4/13/2016): Is there were we put the support to include -lstdc++.so on the link line directly?
endif
# DQ (3/6/2013): We need to build a SWIG path that can't include the isystem option.
# Note use of "-isystem" option in ROSE_BOOST_PREINCLUDE_PATH to have the
# boost specified on the configure
# command-line be used instead of the OS version of boost that is sometimes
# installed with Linux (it is always a version too old to be used with ROSE).
# This is used only when the ROSE configuration detects a previously installed
# version of Boost (e.g /usr/include/boost) that we don't want to use.
if ROSE_USE_INTERNAL_FRONTEND_DEVELOPMENT
# ROSE_INCLUDES =
# $(ROSE_BOOST_PREINCLUDE_PATH)
ROSE_INCLUDES_WITHOUT_BOOST_ISYSTEM_PATH = \
-I$(top_builddir)/src/roseSupport \
-I$(top_builddir)/src/frontend/SageIII \
-I$(top_srcdir)/src \
-I$(top_srcdir)/src/frontend \
-I$(top_srcdir)/src/frontend/SageIII \
-I$(top_srcdir)/src/frontend/SageIII/astFixup \
-I$(top_srcdir)/src/frontend/SageIII/astPostProcessing \
-I$(top_srcdir)/src/frontend/SageIII/astVisualization \
-I$(top_srcdir)/src/frontend/SageIII/sageInterface \
-I$(top_srcdir)/src/frontend/SageIII/includeDirectivesProcessing \
-I$(top_srcdir)/src/frontend/SageIII/sage_support \
-I$(top_srcdir)/src/frontend/OpenFortranParser_SAGE_Connection \
-I$(top_srcdir)/src/frontend/ECJ_ROSE_Connection \
-I"$(JAVA_HOME)/include" \
-I$(top_srcdir)/src/frontend/BinaryFormats \
-I$(top_srcdir)/src/frontend/BinaryLoader \
-I$(top_srcdir)/src/frontend/Disassemblers \
-I$(top_srcdir)/src/backend/unparser \
-I$(top_srcdir)/src/backend/unparser/formatSupport \
-I$(top_srcdir)/src/backend/unparser/languageIndependenceSupport \
-I$(top_srcdir)/src/backend/unparser/CxxCodeGeneration \
-I$(top_srcdir)/src/backend/unparser/JavaCodeGeneration \
-I$(top_srcdir)/src/backend/unparser/FortranCodeGeneration \
-I$(top_srcdir)/src/backend/unparser/PHPCodeGeneration \
-I$(top_srcdir)/src/backend/unparser/PythonCodeGeneration \
-I$(top_srcdir)/src/backend/unparser/X10CodeGeneration \
-I$(top_srcdir)/src/backend/unparser/AdaCodeGeneration \
-I$(top_srcdir)/src/backend/unparser/JovialCodeGeneration \
-I$(top_srcdir)/src/backend/asmUnparser \
-I$(top_srcdir)/src/util \
-I$(top_srcdir)/src/util/support \
-I$(top_srcdir)/src/util/graphs \
-I$(top_srcdir)/src/util/stringSupport \
-I$(top_srcdir)/src/util/commandlineProcessing \
-I$(top_srcdir)/src/midend/astDiagnostics \
-I$(top_srcdir)/src/midend/astProcessing \
-I$(top_srcdir)/src/midend/astMatching \
-I$(top_srcdir)/src/midend/astQuery \
-I$(top_srcdir)/src/midend/BinaryAnalysis \
-I$(top_srcdir)/src/midend/programAnalysis \
-I$(top_srcdir)/src/roseSupport \
-I$(top_srcdir)/src/3rdPartyLibraries/MSTL \
-I$(top_srcdir)/src/util/graphs \
-I$(top_srcdir)/src/roseExtensions/failSafe \
$(ROSE_ATERM_INCLUDE) \
$(ROSE_FLANG_INCLUDES) \
$(ROSE_BOOST_NORMAL_INCLUDE_PATH)
else
# ROSE_INCLUDES =
# $(ROSE_BOOST_PREINCLUDE_PATH)
ROSE_INCLUDES_WITHOUT_BOOST_ISYSTEM_PATH = \
-I$(top_builddir)/src/roseSupport \
-I$(top_builddir)/src/frontend/SageIII \
-I$(top_srcdir)/src \
-I$(top_srcdir)/src/frontend \
-I$(top_srcdir)/src/frontend/SageIII \
-I$(top_srcdir)/src/frontend/SageIII/astFixup \
-I$(top_srcdir)/src/frontend/SageIII/astPostProcessing \
-I$(top_srcdir)/src/frontend/SageIII/astMerge \
-I$(top_srcdir)/src/frontend/SageIII/astVisualization \
-I$(top_srcdir)/src/frontend/SageIII/astFileIO \
-I$(top_srcdir)/src/frontend/SageIII/sageInterface \
-I$(top_srcdir)/src/frontend/SageIII/virtualCFG \
-I$(top_srcdir)/src/frontend/SageIII/astTokenStream \
-I$(top_srcdir)/src/frontend/SageIII/astHiddenTypeAndDeclarationLists \
-I$(top_builddir)/src/frontend/SageIII/astFileIO \
-I$(top_srcdir)/src/frontend/SageIII/astFromString \
-I$(top_srcdir)/src/frontend/SageIII/includeDirectivesProcessing \
-I$(top_srcdir)/src/frontend/SageIII/sage_support \
-I$(top_srcdir)/src/frontend/OpenFortranParser_SAGE_Connection \
-I$(top_srcdir)/src/frontend/ECJ_ROSE_Connection \
-I"$(JAVA_HOME)/include" \
-I$(top_srcdir)/src/frontend/PHPFrontend \
$(ROSE_CLANG_FRONTEND_INCLUDE) \
-I$(top_srcdir)/src/frontend/PythonFrontend \
-I$(top_srcdir)/src/frontend/BinaryFormats \
-I$(top_srcdir)/src/frontend/BinaryLoader \
-I$(top_srcdir)/src/frontend/Disassemblers \
$(ROSE_CLANG_INCLUDE) \
-I$(top_srcdir)/src/backend/unparser \
-I$(top_srcdir)/src/backend/unparser/formatSupport \
-I$(top_srcdir)/src/backend/unparser/languageIndependenceSupport \
-I$(top_srcdir)/src/backend/unparser/CxxCodeGeneration \
-I$(top_srcdir)/src/backend/unparser/JavaCodeGeneration \
-I$(top_srcdir)/src/backend/unparser/FortranCodeGeneration \
-I$(top_srcdir)/src/backend/unparser/PHPCodeGeneration \
-I$(top_srcdir)/src/backend/unparser/PythonCodeGeneration \
-I$(top_srcdir)/src/backend/unparser/X10CodeGeneration \
-I$(top_srcdir)/src/backend/unparser/AdaCodeGeneration \
-I$(top_srcdir)/src/backend/unparser/JovialCodeGeneration \
-I$(top_srcdir)/src/backend/asmUnparser \
-I$(top_srcdir)/src/util \
-I$(top_srcdir)/src/util/support \
-I$(top_srcdir)/src/util/graphs \
-I$(top_srcdir)/src/util/stringSupport \
-I$(top_srcdir)/src/util/commandlineProcessing \
-I$(top_srcdir)/src/midend/abstractHandle \
-I$(top_srcdir)/src/midend/abstractMemoryObject \
-I$(top_srcdir)/src/midend/abstractLayer \
-I$(top_srcdir)/src/midend/astDiagnostics \
-I$(top_srcdir)/src/midend/programTransformation/astInlining \
-I$(top_srcdir)/src/midend/programTransformation/astOutlining \
-I$(top_srcdir)/src/midend/programTransformation/transformationTracking \
-I$(top_srcdir)/src/midend/astProcessing \
-I$(top_srcdir)/src/midend/astMatching \
-I$(top_srcdir)/src/midend/astQuery \
-I$(top_srcdir)/src/midend/astRewriteMechanism \
-I$(top_srcdir)/src/midend/astUtil/annotation \
-I$(top_srcdir)/src/midend/astUtil/astInterface \
-I$(top_srcdir)/src/midend/astUtil/astSupport \
-I$(top_srcdir)/src/midend/astUtil/symbolicVal \
-I$(top_srcdir)/src/midend/BinaryAnalysis \
-I$(top_srcdir)/src/midend/BinaryAnalysis/dataflowanalyses \
-I$(top_srcdir)/src/midend/BinaryAnalysis/instructionSemantics \
-I$(top_srcdir)/src/midend/programTransformation/loopProcessing/computation \
-I$(top_srcdir)/src/midend/programTransformation/loopProcessing/depGraph \
-I$(top_srcdir)/src/midend/programTransformation/loopProcessing/depInfo \
-I$(top_srcdir)/src/midend/programTransformation/loopProcessing/driver \
-I$(top_srcdir)/src/midend/programTransformation/loopProcessing/outsideInterface \
-I$(top_srcdir)/src/midend/programTransformation/loopProcessing/prepostTransformation \
-I$(top_srcdir)/src/midend/programTransformation/ompLowering \
-I$(top_srcdir)/src/midend/programTransformation/extractFunctionArgumentsNormalization \
-I$(top_srcdir)/src/midend/programTransformation/singleStatementToBlockNormalization \
-I$(top_srcdir)/src/midend/programAnalysis \
-I$(top_srcdir)/src/midend/programAnalysis/arithmeticIntensity \
-I$(top_srcdir)/src/midend/programAnalysis/annotationLanguageParser \
-I$(top_srcdir)/src/midend/programAnalysis/CFG \
-I$(top_srcdir)/src/midend/programAnalysis/staticSingleAssignment \
-I$(top_srcdir)/src/midend/programAnalysis/ssaUnfilteredCfg \
-I$(top_srcdir)/src/midend/programAnalysis/systemDependenceGraph \
-I$(top_srcdir)/src/midend/programAnalysis/systemDependenceGraph \
-I$(top_srcdir)/src/midend/programAnalysis/CallGraphAnalysis \
-I$(top_srcdir)/src/midend/programAnalysis/OAWrap \
-I$(top_srcdir)/src/midend/programAnalysis/bitvectorDataflow \
-I$(top_srcdir)/src/midend/programAnalysis/VirtualFunctionAnalysis \
-I$(top_srcdir)/src/midend/programAnalysis/defUseAnalysis \
-I$(top_srcdir)/src/midend/programAnalysis/distributedMemoryAnalysis \
-I$(top_srcdir)/src/midend/programAnalysis/dominanceAnalysis \
-I$(top_srcdir)/src/midend/programAnalysis/pointerAnal \
-I$(top_srcdir)/src/midend/programAnalysis/staticInterproceduralSlicing \
-I$(top_srcdir)/src/midend/programAnalysis/valuePropagation \
-I$(top_srcdir)/src/midend/programAnalysis/variableRenaming \
$(ROSE_SIDEEFFECTS_INCLUDE) \
$(ROSE_DATABASE_INCLUDE) \
$(ROSE_GUI_INCLUDE) \
$(ROSE_QT_INCLUDE) \
$(ROSE_SQLITE_DATABASE_INCLUDE) \
$(ROSE_SIDEEFFECT_INCLUDE) \
$(SQLITE_DATABASE_INCLUDE) \
-I$(top_srcdir)/src/midend/programTransformation/partialRedundancyElimination \
-I$(top_srcdir)/src/midend/programTransformation/finiteDifferencing \
-I$(top_srcdir)/src/midend/programTransformation/functionCallNormalization \
-I$(top_srcdir)/src/midend/programTransformation/constantFolding \
-I$(top_srcdir)/src/midend/programTransformation/implicitCodeGeneration \
-I$(top_srcdir)/src/roseSupport \
-I$(top_srcdir)/src/3rdPartyLibraries/MSTL \
-I$(top_srcdir)/src/3rdPartyLibraries/libharu-2.1.0/include \
-I$(top_builddir)/src/3rdPartyLibraries/libharu-2.1.0/include \
-I$(top_srcdir)/src/3rdPartyLibraries/qrose/Framework \
-I$(top_srcdir)/src/3rdPartyLibraries/qrose/Widgets \
-I$(top_srcdir)/src/util/graphs \
-I$(top_srcdir)/src/midend/astUtil/astInterface \
-I$(top_srcdir)/libltdl \
-I$(top_srcdir)/src/roseExtensions/failSafe \
$(ROSE_PHP_INCLUDES) \
$(ROSE_PYTHON_INCLUDES) \
$(ROSE_YICES_INCLUDES) \
$(ROSE_Z3_INCLUDES) \
$(ROSE_YAML_INCLUDES) \
$(ROSE_LIBPQXX_INCLUDES) \
$(ROSE_CAPSTONE_INCLUDES) \
$(ROSE_READLINE_INCLUDES) \
$(ROSE_LIBMAGIC_INCLUDES) \
$(ROSE_DLIB_INCLUDES) \
$(ROSE_GCRYPT_INCLUDES) \
$(ROSE_ELF_INCLUDES) \
$(ROSE_DWARF_INCLUDES) \
$(ROSE_WINE_INCLUDES) \
$(VALGRIND_CFLAGS) \
$(SQLITE3_CFLAGS) \
$(ROSE_BOOST_NORMAL_INCLUDE_PATH) \
$(ROSE_PCH_INCLUDE) \
$(INTEL_PIN_INCLUDE_PATHS) \
$(ROSE_ETHER_INCLUDE) \
$(ROSE_ATERM_INCLUDE) \
$(ROSE_FLANG_INCLUDES) \
$(ROSE_CSHARP_INCLUDES) \
$(ROSE_ADA_INCLUDES) \
$(ROSE_JOVIAL_INCLUDES) \
$(ROSE_COBOL_INCLUDES) \
$(BOOST_CPPFLAGS)
endif
# DQ (10/23/2015): These paths have been replaces with the following variables.
# These variable are empty for now (reflecting the default usage, and need to
# be set properly where ever Clang support is processed as a configure option.
# -I$(top_srcdir)/src/frontend/CxxFrontend/ClangFrontend
# -I$(top_srcdir)/src/frontend/CxxFrontend/Clang
# $(ROSE_CLANG_FRONTEND_INCLUDE)
# $(ROSE_CLANG_INCLUDE)
SWIG_ROSE_INCLUDES = $(ROSE_INCLUDES_WITHOUT_BOOST_ISYSTEM_PATH)
ROSE_INCLUDES = $(ROSE_BOOST_PREINCLUDE_PATH) $(ROSE_INCLUDES_WITHOUT_BOOST_ISYSTEM_PATH)
# DQ (8/15/2010): I have removed these directories from the include paths since it no longer exists.
# I expect that the directories were removed and the include list not properly cleaned up.
# -I$(top_srcdir)/src/midend/binaryAnalyses/graph
# -I$(top_srcdir)/src/midend/programTransformation/runtimeTransformation
# -I$(top_srcdir)/projects/dataBase
# DQ (12/22/2008): Move Boost directory to front and used "-isystem" option so
# that a system with a previous (older) installation of boost does not interfer
# with the use of ROSE (and the version of boost specified using "--with-boost").
# $(BOOST_CPPFLAGS)
# DQ (10/28/2008): I think these should be included, I don't know why they
# were removed (used with Microsoft Windows tests, and Yices tests).
# DQ: Not used currently
# $(ROSE_WINE_INCLUDES)
# DQ (5/3/2007): Removed from ROSE
# -I$(top_srcdir)/src/midend/programAnalysis/dominatorTreesAndDominanceFrontiers
# -I$(top_srcdir)/src/midend/programAnalysis/staticProgramSlicing
# DQ (10/22/2004): Removed when I could not get annotation work to compile properly with make distcheck rule
# -I$(top_srcdir)/src/midend/programAnalysis/annotationLanguageParser
# New way using two libraries
# ROSE_LIBS_WITH_PATH = $(top_builddir)/src/librose.a $(top_builddir)/src/libedg.a
# ROSE_LIBS_WITH_PATH = $(top_builddir)/src/librose.so $(top_builddir)/src/libedg.so
# ROSE_LIBS_WITH_PATH = $(libdir)/librose.so $(libdir)/libedg.so
# ROSE_LIBS_WITH_PATH = $(top_builddir)/src/librose.la
# ROSE_LIBS_WITH_PATH = $(top_builddir)/src/librose.la $(JAVA_JVM_LIB)
# JJW 7/25/2008: This should probably just be the same as ROSE_LIBS
ROSE_LIBS_WITH_PATH = $(ROSE_LIBS)
# ROSE_LIBS = $(top_builddir)/src/librose.la -lm $(LEXLIB) $(SQLITE_DATABASE_LIBS) $(LIB_QT) $(WAVE_LDFLAGS) $(WAVE_LIBRARIES) $(WAVE_LIBS) $(JAVA_JVM_LIB) $(RT_LIBS)
# MS 10/19/2015: added ROSE_BOOST_LIBS variable to share exact same
# boost libs list in ROSE an in the ROSTTA Makefiles.
ROSE_BOOST_LIBS=$(BOOST_LDFLAGS) $(BOOST_DATE_TIME_LIB) $(BOOST_CHRONO_LIB) \
$(BOOST_THREAD_LIB) $(BOOST_FILESYSTEM_LIB) $(BOOST_PROGRAM_OPTIONS_LIB) \
$(BOOST_RANDOM_LIB) $(BOOST_REGEX_LIB) $(BOOST_SYSTEM_LIB) $(BOOST_SERIALIZATION_LIB) \
$(BOOST_WAVE_LIB) $(BOOST_IOSTREAMS_LIB) $(BOOST_PYTHON_LIB)
ROSE_LIBS = $(abspath $(top_builddir)/src/librose.la) -lm $(JAVA_JVM_LINK) \
$(SQLITE_DATABASE_LIBS) $(QT_LIBS) $(ROSE_BOOST_LIBS) \
$(SQLITE3_LDFLAGS) $(RT_LIBS) $(ROSE_YICES_LIBS_WITH_PATH) $(ROSE_Z3_LIBS_WITH_PATH) $(ROSE_PHP_LIBS_WITH_PATH) \
$(ROSE_DWARF_LIBS_WITH_PATH) $(ROSE_ELF_LIBS_WITH_PATH) \
$(ROSE_GUI_LIBS_WITH_PATH) $(ROSE_QT_LIBS_WITH_PATH) $(ROSE_SSL_LIBS) $(ROSE_ETHER_LIBS) \
$(ROSE_INTEL_COMPILER_MATH_LIBS) $(ROSE_ATERM_LIBS) $(ROSE_FLANG_LIBS) \
$(ROSE_YAML_LIBS_WITH_PATH) $(ROSE_LIBMAGIC_LIBS_WITH_PATH) $(ROSE_READLINE_LIBS_WITH_PATH) \
$(ROSE_DLIB_LIBS_WITH_PATH) $(ROSE_GCRYPT_LIBS_WITH_PATH) $(ROSE_LIBPQXX_LIBS_WITH_PATH) \
$(ROSE_ADA_LIBS_WITH_PATH) $(ROSE_COBOL_PT_LIBS_WITH_PATH) $(ROSE_PYTHON_LIBS_WITH_PATH) \
$(ROSE_QUAD_FLOAT_MATH) $(ROSE_CAPSTONE_LIBS_WITH_PATH)
if ROSE_USE_CLANG_FRONTEND
ROSE_LIBS += $(CLANG_LDFLAGS) -ltinfo
endif
#========================================================================================================================
# These are the "-R directory" switches that need to be passed to libtool running in link mode to make sure that ROSE
# executables have rpath properties that point to the directories containing the libraries we're using. Do not add
# system directories (or at least not at the front of this list) because that will cause the system-installed version of
# a library to be used rather than some user-specific version.
#
# Here's the motivation for using rpath instead of LD_LIBRARY_PATH: Consider what happens if some ROSE tool, call it
# myTranslator, is compiled and linked against a custom, user-installed version of libz.so (perhaps because myTranslator
# is using a custom version of some graphics library, like libgraphicsmagick.so, that needs a newer libz.so than what's
# installed on the system). If I then set LD_LIBRARY_PATH to point to the directory with my libz.so I'll be able to run
# myTranslator, however I probably won't be able any system installed tool that uses libz.so. This includes not being
# able to run /usr/bin/as, which might be called indirectly when myTranslator invokes the backend compiler (because
# LD_LIBRARY_PATH overrides the rpath built into /usr/bin/as). Run-time linking with the wrong dynamic library at best
# produces an error message from the linker, but more often just results in a fault of some sort.
#
# How does rpath fix this problem? It encodes into each executable the list of directories that should be searched when
# the executable is run, similar to LD_LIBRARY_PATH but on a per-executable basis.
#
# The filter-out is removing specific libraries (-lwhatever), the GCC's POSIX thread switch (-pthread), static libraries
# (whatever.a), and various system directories that might have the wrong library versions and which are searched
# automatically anyway. The outer patsubst is changing "-Ldirectory" to just "directory", and the addprefix is changing
# each directory to "-R directory" which is libtool's switch for adding an rpath to an executable.
#
# The inner-most patsubst needs more explanation: Although most low-level libraries like libz, libpng, etc. are normally
# installed in well-known system-wide locations (like /usr/lib), when testing ROSE in matrix testing using RMC, these
# libraries are often compiled and installed locally in such ways that they're not binary compatible with the
# system-installed versions. However, ROSE doesn't have configuration or cmake options for all these libraries because
# there could eventually be far too many. Therefore, we use the fact that RMC has already chosen the correct library
# directories and added their names to various environment variables. The lines of the form
# $(subst :, ,# $(whatever_LIBDIRS))
# split the named environment variable into individual directory names. If there's a ROSE configure option to specify
# the library location, then DO NOT list an environment variable here--use the directory from configure instead (which
# goes into ROSE_LIBS above).
ROSE_RPATHS = \
$(patsubst -L%,-R %, \
$(filter-out -L/lib% -L/usr/lib% -L/usr/local/lib% -L/var/lib%, \
$(filter -L%, \
$(ROSE_LIBS) \
$(subst :, , $(GNU_COMPILERS_LIBDIRS)) \
$(subst :, , $(LIBBZ2_LIBDIRS)) \
$(subst :, , $(LIBGRAPHICSMAGICK_LIBDIRS)) \
$(subst :, , $(LIBJPEG_LIBDIRS)) \
$(subst :, , $(LIBLCMS_LIBDIRS)) \
$(subst :, , $(LIBLZMA_LIBDIRS)) \
$(subst :, , $(LIBPNG_LIBDIRS)) \
$(subst :, , $(LIBTIFF_LIBDIRS)) \
$(subst :, , $(PYTHON_LIBDIRS)) \
$(subst :, , $(SPOT_LIBDIRS)) \
$(subst :, , $(ZLIB_LIBDIRS)) \
$(subst :, , $(INTEL_COMPILER_RPATHS)) \
) \
) \
)
# Rasmussen (3/23/2018): Added ROSE_LINK_RPATHS to enable linking on Mac OSX with ROSE installation
if OS_MACOSX
ROSE_LINK_RPATHS = $(addprefix -Xlinker -rpath -Xlinker , $(filter-out -R , $(ROSE_RPATHS)))
else
comma = ,
ROSE_LINK_RPATHS = $(addprefix -Wl$(comma)-rpath , $(filter-out -R , $(ROSE_RPATHS)))
endif
show-rpaths:
@echo "ROSE_LIBS = $(ROSE_LIBS)"
@echo "ROSE_RPATHS = $(ROSE_RPATHS)"
@echo "ROSE_LINK_RPATHS = $(ROSE_LINK_RPATHS)"
INTEL_COMPILER_RPATHS = $(shell $(top_srcdir)/scripts/intel-compiler-rpaths.sh)
# DQ (3/8/2009): This fails when I try to include it (fails in rose/src/testSharedRoseLib).
# $(INTEL_PIN_LIB_PATHS) $(INTEL_PIN_LIBS)
# DQ (3/14/2009): It is cleaner to just required that Intel Pin support require setting
# the LD_LIBRARYPATH to include: $(INTEL_PIN_PATH)/intel64/lib-ext
# This ROSE_SEPARATE_LIBS is used for the linking of preprocessor.C used within
# development. The use of the seperate libraries make the linking faster where the
# main librose library is not built. Libtool may have changed this so that we could
# just link to librose now just as easily, but one has to rebuild librose each time
# instead of just the individual shared library.
# JJW 7/25/2008: This should probably just be the same as ROSE_LIBS
ROSE_SEPARATE_LIBS = $(ROSE_LIBS)
# QY (11/2/04): removed -lastoutlining from ROSE_SEPARATE_LIBS
# DQ (10/22/2004): Removed when I could not get annotation work to compile properly
# with make distcheck rule
# -lannotationLanguageParser(appears after -lvaluePropagation)
# Test harness variables. See "rth_run.pl --help" for more info. The RTH_RUN_FLAGS is meant to be set on the
# "make" command-line, but the default depends on the value of the verbosity $(V) flag.
RTH_RUN_FLAGS_V_ =
RTH_RUN_FLAGS_V_0 =
RTH_RUN_FLAGS_V_1 = --immediate-output
RTH_RUN_FLAGS = $(RTH_RUN_FLAGS_V_$(V))
# Default timeout that you can override on the "make" commandline. Valid values
# are integers followed by "s" (seconds), "m" (minutes), "h" (hours), or the
# word "never". See scripts/rth_run.pl for detailed documentation.
RTH_TIMEOUT = 15m
RTH_RUN=$(top_srcdir)/scripts/rth_run.pl $(RTH_RUN_FLAGS) \
srcdir=$(abspath $(srcdir)) top_srcdir=$(abspath $(top_srcdir)) \
blddir=$$(pwd) top_blddir=$(abspath $(top_builddir)) \
VALGRIND=$(VALGRIND) TIMEOUT=$(RTH_TIMEOUT)
RTH_STATS=$(top_srcdir)/scripts/rth_stats.pl
# DQ (9/27/2015): Added to support new use of AM_CPPFLAGS instead of INCLUDES
# (depreicated in automake and for which many warnings are generated).
CPPFLAGS = $(AM_CPPFLAGS)
clean-test-targets:
rm -f $(TEST_TARGETS)
rm -f $(TEST_TARGETS:.passed=.failed)
rm -f $(TEST_TARGETS:.passed=.out)
rm -f $(TEST_TARGETS:.passed=.err)
clean-local: clean-test-targets
.PHONY: clean-test-targets
| {
"pile_set_name": "Github"
} |
{
"parent": "minecraft:recipes/root",
"rewards": {
"recipes": [
"create:gabbro_bricks_slab"
]
},
"criteria": {
"has_gabbro_bricks": {
"trigger": "minecraft:inventory_changed",
"conditions": {
"items": [
{
"item": "create:gabbro_bricks"
}
]
}
},
"has_the_recipe": {
"trigger": "minecraft:recipe_unlocked",
"conditions": {
"recipe": "create:gabbro_bricks_slab"
}
}
},
"requirements": [
[
"has_gabbro_bricks",
"has_the_recipe"
]
]
} | {
"pile_set_name": "Github"
} |
name: tensorflow-ci
dependencies:
- python=3.6.9
- pip
- pip:
- tensorflow==2.2.0
- tfdlpack-gpu
- pytest
- nose
- numpy
- cython
- scipy
- networkx
- matplotlib
- nltk
- requests[security]
- tqdm
| {
"pile_set_name": "Github"
} |
############################################################################
# tests/common/CMakeLists.txt
#
# Part of the STXXL. See http://stxxl.sourceforge.net
#
# Copyright (C) 2013-2014 Timo Bingmann <[email protected]>
#
# 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)
############################################################################
stxxl_build_test(test_binary_buffer)
stxxl_build_test(test_cmdline)
stxxl_build_test(test_counting_ptr)
if(USE_BOOST)
stxxl_build_test(test_external_shared_ptr)
endif(USE_BOOST)
stxxl_build_test(test_globals)
stxxl_build_test(test_log2)
stxxl_build_test(test_manyunits test_manyunits2)
stxxl_build_test(test_random)
stxxl_build_test(test_swap_vector)
stxxl_build_test(test_tuple)
stxxl_build_test(test_uint_types)
stxxl_build_test(test_winner_tree)
stxxl_test(test_binary_buffer)
stxxl_test(test_cmdline)
stxxl_test(test_counting_ptr)
if(USE_BOOST)
stxxl_test(test_external_shared_ptr)
endif(USE_BOOST)
stxxl_test(test_globals)
stxxl_test(test_log2)
stxxl_test(test_manyunits)
stxxl_test(test_random)
stxxl_test(test_swap_vector)
stxxl_test(test_tuple)
stxxl_test(test_uint_types)
stxxl_test(test_winner_tree)
| {
"pile_set_name": "Github"
} |
.. _downloadmrpt:
##############
Download MRPT
##############
.. contents:: :local:
Source code
-------------
Get the latest development version with:
.. code-block:: bash
git clone https://github.com/MRPT/mrpt.git --recursive
Next step: :ref:`compiling`
Debian/Ubuntu official repositories
---------------------------------------
Install the `official version <https://packages.ubuntu.com/source/groovy/mrpt>`_ for your distribution with:
.. code-block:: bash
sudo apt install libmrpt-dev mrpt-apps
.. note::
Versions in `official repositories <https://packages.ubuntu.com/source/groovy/mrpt>`_
may be quite outdated. It is strongly
recommended to use the PPAs (read below) or build from sources instead.
Debian/Ubuntu PPA
----------------------
Last **stable release** (`mrpt-stable PPA status <https://launchpad.net/~joseluisblancoc/+archive/ubuntu/mrpt-stable>`_) (from the ``master`` branch), for Ubuntu >=18.04:
.. code-block:: bash
sudo add-apt-repository ppa:joseluisblancoc/mrpt-stable # master (stable releases) branch
sudo apt install libmrpt-dev mrpt-apps
**Nightly builds** (`mrpt-nightly PPA status <https://launchpad.net/~joseluisblancoc/+archive/ubuntu/mrpt>`_) (from the ``develop`` branch) for Ubuntu >=18.04:
.. code-block:: bash
sudo add-apt-repository ppa:joseluisblancoc/mrpt # develop branch
sudo apt install libmrpt-dev mrpt-apps
.. note::
**Ubuntu 16.04 LTS users**: If you want to compile MRPT or install it from
a PPA, you must upgrade your gcc compiler to version >=7.
See `instructions here <https://gist.github.com/jlblancoc/99521194aba975286c80f93e47966dc5>`_.
Last **stable release** (`mrpt-stable-xenial PPA status <https://launchpad.net/~joseluisblancoc/+archive/ubuntu/mrpt-stable-xenial>`_), for Ubuntu 16.04 LTS Xenial (EOL: April 2021):
.. code-block:: bash
# Install pre-requisites (** ONLY FOR Ubuntu 16.04 Xenial **)
sudo add-apt-repository ppa:ubuntu-toolchain-r/test # gcc-7 Backport
sudo add-apt-repository ppa:joseluisblancoc/mrpt-stable-xenial
sudo apt-get update
sudo apt-get install libmrpt-dev mrpt-apps
**Nightly builds** (`mrpt-nightly-xenial PPA status <https://launchpad.net/~joseluisblancoc/+archive/ubuntu/mrpt-unstable-xenial>`_), for Ubuntu 16.04 LTS Xenial (EOL: April 2021):
.. code-block:: bash
# Install pre-requisites (** ONLY FOR Ubuntu 16.04 Xenial **)
sudo add-apt-repository ppa:ubuntu-toolchain-r/test # gcc-7 Backport
sudo add-apt-repository ppa:joseluisblancoc/mrpt-unstable-xenial
sudo apt-get update
sudo apt-get install libmrpt-dev mrpt-apps
Windows installers
--------------------
Executables (.exes and .dlls) and development libraries (.hs and .libs) included:
- `Last stable version <https://bintray.com/mrpt/mrpt-win-binaries/MRPT-nightly-builds/win64-stable>`_
- `Nightly builds <https://bintray.com/mrpt/mrpt-win-binaries/MRPT-nightly-builds/win64-develop>`_
| {
"pile_set_name": "Github"
} |
#version 450
layout( location = 0 ) in float vert_color;
layout( location = 0 ) out vec4 frag_color;
void main() {
frag_color = vec4( vert_color );
}
| {
"pile_set_name": "Github"
} |
// go run mksysnum.go https://svn.freebsd.org/base/stable/10/sys/kern/syscalls.master
// Code generated by the command above; see README.md. DO NOT EDIT.
// +build 386,freebsd
package unix
const (
// SYS_NOSYS = 0; // { int nosys(void); } syscall nosys_args int
SYS_EXIT = 1 // { void sys_exit(int rval); } exit sys_exit_args void
SYS_FORK = 2 // { int fork(void); }
SYS_READ = 3 // { ssize_t read(int fd, void *buf, size_t nbyte); }
SYS_WRITE = 4 // { ssize_t write(int fd, const void *buf, size_t nbyte); }
SYS_OPEN = 5 // { int open(char *path, int flags, int mode); }
SYS_CLOSE = 6 // { int close(int fd); }
SYS_WAIT4 = 7 // { int wait4(int pid, int *status, int options, struct rusage *rusage); }
SYS_LINK = 9 // { int link(char *path, char *link); }
SYS_UNLINK = 10 // { int unlink(char *path); }
SYS_CHDIR = 12 // { int chdir(char *path); }
SYS_FCHDIR = 13 // { int fchdir(int fd); }
SYS_MKNOD = 14 // { int mknod(char *path, int mode, int dev); }
SYS_CHMOD = 15 // { int chmod(char *path, int mode); }
SYS_CHOWN = 16 // { int chown(char *path, int uid, int gid); }
SYS_OBREAK = 17 // { int obreak(char *nsize); } break obreak_args int
SYS_GETPID = 20 // { pid_t getpid(void); }
SYS_MOUNT = 21 // { int mount(char *type, char *path, int flags, caddr_t data); }
SYS_UNMOUNT = 22 // { int unmount(char *path, int flags); }
SYS_SETUID = 23 // { int setuid(uid_t uid); }
SYS_GETUID = 24 // { uid_t getuid(void); }
SYS_GETEUID = 25 // { uid_t geteuid(void); }
SYS_PTRACE = 26 // { int ptrace(int req, pid_t pid, caddr_t addr, int data); }
SYS_RECVMSG = 27 // { int recvmsg(int s, struct msghdr *msg, int flags); }
SYS_SENDMSG = 28 // { int sendmsg(int s, struct msghdr *msg, int flags); }
SYS_RECVFROM = 29 // { int recvfrom(int s, caddr_t buf, size_t len, int flags, struct sockaddr * __restrict from, __socklen_t * __restrict fromlenaddr); }
SYS_ACCEPT = 30 // { int accept(int s, struct sockaddr * __restrict name, __socklen_t * __restrict anamelen); }
SYS_GETPEERNAME = 31 // { int getpeername(int fdes, struct sockaddr * __restrict asa, __socklen_t * __restrict alen); }
SYS_GETSOCKNAME = 32 // { int getsockname(int fdes, struct sockaddr * __restrict asa, __socklen_t * __restrict alen); }
SYS_ACCESS = 33 // { int access(char *path, int amode); }
SYS_CHFLAGS = 34 // { int chflags(const char *path, u_long flags); }
SYS_FCHFLAGS = 35 // { int fchflags(int fd, u_long flags); }
SYS_SYNC = 36 // { int sync(void); }
SYS_KILL = 37 // { int kill(int pid, int signum); }
SYS_GETPPID = 39 // { pid_t getppid(void); }
SYS_DUP = 41 // { int dup(u_int fd); }
SYS_PIPE = 42 // { int pipe(void); }
SYS_GETEGID = 43 // { gid_t getegid(void); }
SYS_PROFIL = 44 // { int profil(caddr_t samples, size_t size, size_t offset, u_int scale); }
SYS_KTRACE = 45 // { int ktrace(const char *fname, int ops, int facs, int pid); }
SYS_GETGID = 47 // { gid_t getgid(void); }
SYS_GETLOGIN = 49 // { int getlogin(char *namebuf, u_int namelen); }
SYS_SETLOGIN = 50 // { int setlogin(char *namebuf); }
SYS_ACCT = 51 // { int acct(char *path); }
SYS_SIGALTSTACK = 53 // { int sigaltstack(stack_t *ss, stack_t *oss); }
SYS_IOCTL = 54 // { int ioctl(int fd, u_long com, caddr_t data); }
SYS_REBOOT = 55 // { int reboot(int opt); }
SYS_REVOKE = 56 // { int revoke(char *path); }
SYS_SYMLINK = 57 // { int symlink(char *path, char *link); }
SYS_READLINK = 58 // { ssize_t readlink(char *path, char *buf, size_t count); }
SYS_EXECVE = 59 // { int execve(char *fname, char **argv, char **envv); }
SYS_UMASK = 60 // { int umask(int newmask); } umask umask_args int
SYS_CHROOT = 61 // { int chroot(char *path); }
SYS_MSYNC = 65 // { int msync(void *addr, size_t len, int flags); }
SYS_VFORK = 66 // { int vfork(void); }
SYS_SBRK = 69 // { int sbrk(int incr); }
SYS_SSTK = 70 // { int sstk(int incr); }
SYS_OVADVISE = 72 // { int ovadvise(int anom); } vadvise ovadvise_args int
SYS_MUNMAP = 73 // { int munmap(void *addr, size_t len); }
SYS_MPROTECT = 74 // { int mprotect(const void *addr, size_t len, int prot); }
SYS_MADVISE = 75 // { int madvise(void *addr, size_t len, int behav); }
SYS_MINCORE = 78 // { int mincore(const void *addr, size_t len, char *vec); }
SYS_GETGROUPS = 79 // { int getgroups(u_int gidsetsize, gid_t *gidset); }
SYS_SETGROUPS = 80 // { int setgroups(u_int gidsetsize, gid_t *gidset); }
SYS_GETPGRP = 81 // { int getpgrp(void); }
SYS_SETPGID = 82 // { int setpgid(int pid, int pgid); }
SYS_SETITIMER = 83 // { int setitimer(u_int which, struct itimerval *itv, struct itimerval *oitv); }
SYS_SWAPON = 85 // { int swapon(char *name); }
SYS_GETITIMER = 86 // { int getitimer(u_int which, struct itimerval *itv); }
SYS_GETDTABLESIZE = 89 // { int getdtablesize(void); }
SYS_DUP2 = 90 // { int dup2(u_int from, u_int to); }
SYS_FCNTL = 92 // { int fcntl(int fd, int cmd, long arg); }
SYS_SELECT = 93 // { int select(int nd, fd_set *in, fd_set *ou, fd_set *ex, struct timeval *tv); }
SYS_FSYNC = 95 // { int fsync(int fd); }
SYS_SETPRIORITY = 96 // { int setpriority(int which, int who, int prio); }
SYS_SOCKET = 97 // { int socket(int domain, int type, int protocol); }
SYS_CONNECT = 98 // { int connect(int s, caddr_t name, int namelen); }
SYS_GETPRIORITY = 100 // { int getpriority(int which, int who); }
SYS_BIND = 104 // { int bind(int s, caddr_t name, int namelen); }
SYS_SETSOCKOPT = 105 // { int setsockopt(int s, int level, int name, caddr_t val, int valsize); }
SYS_LISTEN = 106 // { int listen(int s, int backlog); }
SYS_GETTIMEOFDAY = 116 // { int gettimeofday(struct timeval *tp, struct timezone *tzp); }
SYS_GETRUSAGE = 117 // { int getrusage(int who, struct rusage *rusage); }
SYS_GETSOCKOPT = 118 // { int getsockopt(int s, int level, int name, caddr_t val, int *avalsize); }
SYS_READV = 120 // { int readv(int fd, struct iovec *iovp, u_int iovcnt); }
SYS_WRITEV = 121 // { int writev(int fd, struct iovec *iovp, u_int iovcnt); }
SYS_SETTIMEOFDAY = 122 // { int settimeofday(struct timeval *tv, struct timezone *tzp); }
SYS_FCHOWN = 123 // { int fchown(int fd, int uid, int gid); }
SYS_FCHMOD = 124 // { int fchmod(int fd, int mode); }
SYS_SETREUID = 126 // { int setreuid(int ruid, int euid); }
SYS_SETREGID = 127 // { int setregid(int rgid, int egid); }
SYS_RENAME = 128 // { int rename(char *from, char *to); }
SYS_FLOCK = 131 // { int flock(int fd, int how); }
SYS_MKFIFO = 132 // { int mkfifo(char *path, int mode); }
SYS_SENDTO = 133 // { int sendto(int s, caddr_t buf, size_t len, int flags, caddr_t to, int tolen); }
SYS_SHUTDOWN = 134 // { int shutdown(int s, int how); }
SYS_SOCKETPAIR = 135 // { int socketpair(int domain, int type, int protocol, int *rsv); }
SYS_MKDIR = 136 // { int mkdir(char *path, int mode); }
SYS_RMDIR = 137 // { int rmdir(char *path); }
SYS_UTIMES = 138 // { int utimes(char *path, struct timeval *tptr); }
SYS_ADJTIME = 140 // { int adjtime(struct timeval *delta, struct timeval *olddelta); }
SYS_SETSID = 147 // { int setsid(void); }
SYS_QUOTACTL = 148 // { int quotactl(char *path, int cmd, int uid, caddr_t arg); }
SYS_NLM_SYSCALL = 154 // { int nlm_syscall(int debug_level, int grace_period, int addr_count, char **addrs); }
SYS_NFSSVC = 155 // { int nfssvc(int flag, caddr_t argp); }
SYS_LGETFH = 160 // { int lgetfh(char *fname, struct fhandle *fhp); }
SYS_GETFH = 161 // { int getfh(char *fname, struct fhandle *fhp); }
SYS_SYSARCH = 165 // { int sysarch(int op, char *parms); }
SYS_RTPRIO = 166 // { int rtprio(int function, pid_t pid, struct rtprio *rtp); }
SYS_SEMSYS = 169 // { int semsys(int which, int a2, int a3, int a4, int a5); }
SYS_MSGSYS = 170 // { int msgsys(int which, int a2, int a3, int a4, int a5, int a6); }
SYS_SHMSYS = 171 // { int shmsys(int which, int a2, int a3, int a4); }
SYS_FREEBSD6_PREAD = 173 // { ssize_t freebsd6_pread(int fd, void *buf, size_t nbyte, int pad, off_t offset); }
SYS_FREEBSD6_PWRITE = 174 // { ssize_t freebsd6_pwrite(int fd, const void *buf, size_t nbyte, int pad, off_t offset); }
SYS_SETFIB = 175 // { int setfib(int fibnum); }
SYS_NTP_ADJTIME = 176 // { int ntp_adjtime(struct timex *tp); }
SYS_SETGID = 181 // { int setgid(gid_t gid); }
SYS_SETEGID = 182 // { int setegid(gid_t egid); }
SYS_SETEUID = 183 // { int seteuid(uid_t euid); }
SYS_STAT = 188 // { int stat(char *path, struct stat *ub); }
SYS_FSTAT = 189 // { int fstat(int fd, struct stat *sb); }
SYS_LSTAT = 190 // { int lstat(char *path, struct stat *ub); }
SYS_PATHCONF = 191 // { int pathconf(char *path, int name); }
SYS_FPATHCONF = 192 // { int fpathconf(int fd, int name); }
SYS_GETRLIMIT = 194 // { int getrlimit(u_int which, struct rlimit *rlp); } getrlimit __getrlimit_args int
SYS_SETRLIMIT = 195 // { int setrlimit(u_int which, struct rlimit *rlp); } setrlimit __setrlimit_args int
SYS_GETDIRENTRIES = 196 // { int getdirentries(int fd, char *buf, u_int count, long *basep); }
SYS_FREEBSD6_MMAP = 197 // { caddr_t freebsd6_mmap(caddr_t addr, size_t len, int prot, int flags, int fd, int pad, off_t pos); }
SYS_FREEBSD6_LSEEK = 199 // { off_t freebsd6_lseek(int fd, int pad, off_t offset, int whence); }
SYS_FREEBSD6_TRUNCATE = 200 // { int freebsd6_truncate(char *path, int pad, off_t length); }
SYS_FREEBSD6_FTRUNCATE = 201 // { int freebsd6_ftruncate(int fd, int pad, off_t length); }
SYS___SYSCTL = 202 // { int __sysctl(int *name, u_int namelen, void *old, size_t *oldlenp, void *new, size_t newlen); } __sysctl sysctl_args int
SYS_MLOCK = 203 // { int mlock(const void *addr, size_t len); }
SYS_MUNLOCK = 204 // { int munlock(const void *addr, size_t len); }
SYS_UNDELETE = 205 // { int undelete(char *path); }
SYS_FUTIMES = 206 // { int futimes(int fd, struct timeval *tptr); }
SYS_GETPGID = 207 // { int getpgid(pid_t pid); }
SYS_POLL = 209 // { int poll(struct pollfd *fds, u_int nfds, int timeout); }
SYS_SEMGET = 221 // { int semget(key_t key, int nsems, int semflg); }
SYS_SEMOP = 222 // { int semop(int semid, struct sembuf *sops, size_t nsops); }
SYS_MSGGET = 225 // { int msgget(key_t key, int msgflg); }
SYS_MSGSND = 226 // { int msgsnd(int msqid, const void *msgp, size_t msgsz, int msgflg); }
SYS_MSGRCV = 227 // { int msgrcv(int msqid, void *msgp, size_t msgsz, long msgtyp, int msgflg); }
SYS_SHMAT = 228 // { int shmat(int shmid, const void *shmaddr, int shmflg); }
SYS_SHMDT = 230 // { int shmdt(const void *shmaddr); }
SYS_SHMGET = 231 // { int shmget(key_t key, size_t size, int shmflg); }
SYS_CLOCK_GETTIME = 232 // { int clock_gettime(clockid_t clock_id, struct timespec *tp); }
SYS_CLOCK_SETTIME = 233 // { int clock_settime( clockid_t clock_id, const struct timespec *tp); }
SYS_CLOCK_GETRES = 234 // { int clock_getres(clockid_t clock_id, struct timespec *tp); }
SYS_KTIMER_CREATE = 235 // { int ktimer_create(clockid_t clock_id, struct sigevent *evp, int *timerid); }
SYS_KTIMER_DELETE = 236 // { int ktimer_delete(int timerid); }
SYS_KTIMER_SETTIME = 237 // { int ktimer_settime(int timerid, int flags, const struct itimerspec *value, struct itimerspec *ovalue); }
SYS_KTIMER_GETTIME = 238 // { int ktimer_gettime(int timerid, struct itimerspec *value); }
SYS_KTIMER_GETOVERRUN = 239 // { int ktimer_getoverrun(int timerid); }
SYS_NANOSLEEP = 240 // { int nanosleep(const struct timespec *rqtp, struct timespec *rmtp); }
SYS_FFCLOCK_GETCOUNTER = 241 // { int ffclock_getcounter(ffcounter *ffcount); }
SYS_FFCLOCK_SETESTIMATE = 242 // { int ffclock_setestimate( struct ffclock_estimate *cest); }
SYS_FFCLOCK_GETESTIMATE = 243 // { int ffclock_getestimate( struct ffclock_estimate *cest); }
SYS_CLOCK_GETCPUCLOCKID2 = 247 // { int clock_getcpuclockid2(id_t id,int which, clockid_t *clock_id); }
SYS_NTP_GETTIME = 248 // { int ntp_gettime(struct ntptimeval *ntvp); }
SYS_MINHERIT = 250 // { int minherit(void *addr, size_t len, int inherit); }
SYS_RFORK = 251 // { int rfork(int flags); }
SYS_OPENBSD_POLL = 252 // { int openbsd_poll(struct pollfd *fds, u_int nfds, int timeout); }
SYS_ISSETUGID = 253 // { int issetugid(void); }
SYS_LCHOWN = 254 // { int lchown(char *path, int uid, int gid); }
SYS_AIO_READ = 255 // { int aio_read(struct aiocb *aiocbp); }
SYS_AIO_WRITE = 256 // { int aio_write(struct aiocb *aiocbp); }
SYS_LIO_LISTIO = 257 // { int lio_listio(int mode, struct aiocb * const *acb_list, int nent, struct sigevent *sig); }
SYS_GETDENTS = 272 // { int getdents(int fd, char *buf, size_t count); }
SYS_LCHMOD = 274 // { int lchmod(char *path, mode_t mode); }
SYS_LUTIMES = 276 // { int lutimes(char *path, struct timeval *tptr); }
SYS_NSTAT = 278 // { int nstat(char *path, struct nstat *ub); }
SYS_NFSTAT = 279 // { int nfstat(int fd, struct nstat *sb); }
SYS_NLSTAT = 280 // { int nlstat(char *path, struct nstat *ub); }
SYS_PREADV = 289 // { ssize_t preadv(int fd, struct iovec *iovp, u_int iovcnt, off_t offset); }
SYS_PWRITEV = 290 // { ssize_t pwritev(int fd, struct iovec *iovp, u_int iovcnt, off_t offset); }
SYS_FHOPEN = 298 // { int fhopen(const struct fhandle *u_fhp, int flags); }
SYS_FHSTAT = 299 // { int fhstat(const struct fhandle *u_fhp, struct stat *sb); }
SYS_MODNEXT = 300 // { int modnext(int modid); }
SYS_MODSTAT = 301 // { int modstat(int modid, struct module_stat *stat); }
SYS_MODFNEXT = 302 // { int modfnext(int modid); }
SYS_MODFIND = 303 // { int modfind(const char *name); }
SYS_KLDLOAD = 304 // { int kldload(const char *file); }
SYS_KLDUNLOAD = 305 // { int kldunload(int fileid); }
SYS_KLDFIND = 306 // { int kldfind(const char *file); }
SYS_KLDNEXT = 307 // { int kldnext(int fileid); }
SYS_KLDSTAT = 308 // { int kldstat(int fileid, struct kld_file_stat* stat); }
SYS_KLDFIRSTMOD = 309 // { int kldfirstmod(int fileid); }
SYS_GETSID = 310 // { int getsid(pid_t pid); }
SYS_SETRESUID = 311 // { int setresuid(uid_t ruid, uid_t euid, uid_t suid); }
SYS_SETRESGID = 312 // { int setresgid(gid_t rgid, gid_t egid, gid_t sgid); }
SYS_AIO_RETURN = 314 // { int aio_return(struct aiocb *aiocbp); }
SYS_AIO_SUSPEND = 315 // { int aio_suspend( struct aiocb * const * aiocbp, int nent, const struct timespec *timeout); }
SYS_AIO_CANCEL = 316 // { int aio_cancel(int fd, struct aiocb *aiocbp); }
SYS_AIO_ERROR = 317 // { int aio_error(struct aiocb *aiocbp); }
SYS_OAIO_READ = 318 // { int oaio_read(struct oaiocb *aiocbp); }
SYS_OAIO_WRITE = 319 // { int oaio_write(struct oaiocb *aiocbp); }
SYS_OLIO_LISTIO = 320 // { int olio_listio(int mode, struct oaiocb * const *acb_list, int nent, struct osigevent *sig); }
SYS_YIELD = 321 // { int yield(void); }
SYS_MLOCKALL = 324 // { int mlockall(int how); }
SYS_MUNLOCKALL = 325 // { int munlockall(void); }
SYS___GETCWD = 326 // { int __getcwd(char *buf, u_int buflen); }
SYS_SCHED_SETPARAM = 327 // { int sched_setparam (pid_t pid, const struct sched_param *param); }
SYS_SCHED_GETPARAM = 328 // { int sched_getparam (pid_t pid, struct sched_param *param); }
SYS_SCHED_SETSCHEDULER = 329 // { int sched_setscheduler (pid_t pid, int policy, const struct sched_param *param); }
SYS_SCHED_GETSCHEDULER = 330 // { int sched_getscheduler (pid_t pid); }
SYS_SCHED_YIELD = 331 // { int sched_yield (void); }
SYS_SCHED_GET_PRIORITY_MAX = 332 // { int sched_get_priority_max (int policy); }
SYS_SCHED_GET_PRIORITY_MIN = 333 // { int sched_get_priority_min (int policy); }
SYS_SCHED_RR_GET_INTERVAL = 334 // { int sched_rr_get_interval (pid_t pid, struct timespec *interval); }
SYS_UTRACE = 335 // { int utrace(const void *addr, size_t len); }
SYS_KLDSYM = 337 // { int kldsym(int fileid, int cmd, void *data); }
SYS_JAIL = 338 // { int jail(struct jail *jail); }
SYS_SIGPROCMASK = 340 // { int sigprocmask(int how, const sigset_t *set, sigset_t *oset); }
SYS_SIGSUSPEND = 341 // { int sigsuspend(const sigset_t *sigmask); }
SYS_SIGPENDING = 343 // { int sigpending(sigset_t *set); }
SYS_SIGTIMEDWAIT = 345 // { int sigtimedwait(const sigset_t *set, siginfo_t *info, const struct timespec *timeout); }
SYS_SIGWAITINFO = 346 // { int sigwaitinfo(const sigset_t *set, siginfo_t *info); }
SYS___ACL_GET_FILE = 347 // { int __acl_get_file(const char *path, acl_type_t type, struct acl *aclp); }
SYS___ACL_SET_FILE = 348 // { int __acl_set_file(const char *path, acl_type_t type, struct acl *aclp); }
SYS___ACL_GET_FD = 349 // { int __acl_get_fd(int filedes, acl_type_t type, struct acl *aclp); }
SYS___ACL_SET_FD = 350 // { int __acl_set_fd(int filedes, acl_type_t type, struct acl *aclp); }
SYS___ACL_DELETE_FILE = 351 // { int __acl_delete_file(const char *path, acl_type_t type); }
SYS___ACL_DELETE_FD = 352 // { int __acl_delete_fd(int filedes, acl_type_t type); }
SYS___ACL_ACLCHECK_FILE = 353 // { int __acl_aclcheck_file(const char *path, acl_type_t type, struct acl *aclp); }
SYS___ACL_ACLCHECK_FD = 354 // { int __acl_aclcheck_fd(int filedes, acl_type_t type, struct acl *aclp); }
SYS_EXTATTRCTL = 355 // { int extattrctl(const char *path, int cmd, const char *filename, int attrnamespace, const char *attrname); }
SYS_EXTATTR_SET_FILE = 356 // { ssize_t extattr_set_file( const char *path, int attrnamespace, const char *attrname, void *data, size_t nbytes); }
SYS_EXTATTR_GET_FILE = 357 // { ssize_t extattr_get_file( const char *path, int attrnamespace, const char *attrname, void *data, size_t nbytes); }
SYS_EXTATTR_DELETE_FILE = 358 // { int extattr_delete_file(const char *path, int attrnamespace, const char *attrname); }
SYS_AIO_WAITCOMPLETE = 359 // { int aio_waitcomplete( struct aiocb **aiocbp, struct timespec *timeout); }
SYS_GETRESUID = 360 // { int getresuid(uid_t *ruid, uid_t *euid, uid_t *suid); }
SYS_GETRESGID = 361 // { int getresgid(gid_t *rgid, gid_t *egid, gid_t *sgid); }
SYS_KQUEUE = 362 // { int kqueue(void); }
SYS_KEVENT = 363 // { int kevent(int fd, struct kevent *changelist, int nchanges, struct kevent *eventlist, int nevents, const struct timespec *timeout); }
SYS_EXTATTR_SET_FD = 371 // { ssize_t extattr_set_fd(int fd, int attrnamespace, const char *attrname, void *data, size_t nbytes); }
SYS_EXTATTR_GET_FD = 372 // { ssize_t extattr_get_fd(int fd, int attrnamespace, const char *attrname, void *data, size_t nbytes); }
SYS_EXTATTR_DELETE_FD = 373 // { int extattr_delete_fd(int fd, int attrnamespace, const char *attrname); }
SYS___SETUGID = 374 // { int __setugid(int flag); }
SYS_EACCESS = 376 // { int eaccess(char *path, int amode); }
SYS_NMOUNT = 378 // { int nmount(struct iovec *iovp, unsigned int iovcnt, int flags); }
SYS___MAC_GET_PROC = 384 // { int __mac_get_proc(struct mac *mac_p); }
SYS___MAC_SET_PROC = 385 // { int __mac_set_proc(struct mac *mac_p); }
SYS___MAC_GET_FD = 386 // { int __mac_get_fd(int fd, struct mac *mac_p); }
SYS___MAC_GET_FILE = 387 // { int __mac_get_file(const char *path_p, struct mac *mac_p); }
SYS___MAC_SET_FD = 388 // { int __mac_set_fd(int fd, struct mac *mac_p); }
SYS___MAC_SET_FILE = 389 // { int __mac_set_file(const char *path_p, struct mac *mac_p); }
SYS_KENV = 390 // { int kenv(int what, const char *name, char *value, int len); }
SYS_LCHFLAGS = 391 // { int lchflags(const char *path, u_long flags); }
SYS_UUIDGEN = 392 // { int uuidgen(struct uuid *store, int count); }
SYS_SENDFILE = 393 // { int sendfile(int fd, int s, off_t offset, size_t nbytes, struct sf_hdtr *hdtr, off_t *sbytes, int flags); }
SYS_MAC_SYSCALL = 394 // { int mac_syscall(const char *policy, int call, void *arg); }
SYS_GETFSSTAT = 395 // { int getfsstat(struct statfs *buf, long bufsize, int flags); }
SYS_STATFS = 396 // { int statfs(char *path, struct statfs *buf); }
SYS_FSTATFS = 397 // { int fstatfs(int fd, struct statfs *buf); }
SYS_FHSTATFS = 398 // { int fhstatfs(const struct fhandle *u_fhp, struct statfs *buf); }
SYS_KSEM_CLOSE = 400 // { int ksem_close(semid_t id); }
SYS_KSEM_POST = 401 // { int ksem_post(semid_t id); }
SYS_KSEM_WAIT = 402 // { int ksem_wait(semid_t id); }
SYS_KSEM_TRYWAIT = 403 // { int ksem_trywait(semid_t id); }
SYS_KSEM_INIT = 404 // { int ksem_init(semid_t *idp, unsigned int value); }
SYS_KSEM_OPEN = 405 // { int ksem_open(semid_t *idp, const char *name, int oflag, mode_t mode, unsigned int value); }
SYS_KSEM_UNLINK = 406 // { int ksem_unlink(const char *name); }
SYS_KSEM_GETVALUE = 407 // { int ksem_getvalue(semid_t id, int *val); }
SYS_KSEM_DESTROY = 408 // { int ksem_destroy(semid_t id); }
SYS___MAC_GET_PID = 409 // { int __mac_get_pid(pid_t pid, struct mac *mac_p); }
SYS___MAC_GET_LINK = 410 // { int __mac_get_link(const char *path_p, struct mac *mac_p); }
SYS___MAC_SET_LINK = 411 // { int __mac_set_link(const char *path_p, struct mac *mac_p); }
SYS_EXTATTR_SET_LINK = 412 // { ssize_t extattr_set_link( const char *path, int attrnamespace, const char *attrname, void *data, size_t nbytes); }
SYS_EXTATTR_GET_LINK = 413 // { ssize_t extattr_get_link( const char *path, int attrnamespace, const char *attrname, void *data, size_t nbytes); }
SYS_EXTATTR_DELETE_LINK = 414 // { int extattr_delete_link( const char *path, int attrnamespace, const char *attrname); }
SYS___MAC_EXECVE = 415 // { int __mac_execve(char *fname, char **argv, char **envv, struct mac *mac_p); }
SYS_SIGACTION = 416 // { int sigaction(int sig, const struct sigaction *act, struct sigaction *oact); }
SYS_SIGRETURN = 417 // { int sigreturn( const struct __ucontext *sigcntxp); }
SYS_GETCONTEXT = 421 // { int getcontext(struct __ucontext *ucp); }
SYS_SETCONTEXT = 422 // { int setcontext( const struct __ucontext *ucp); }
SYS_SWAPCONTEXT = 423 // { int swapcontext(struct __ucontext *oucp, const struct __ucontext *ucp); }
SYS_SWAPOFF = 424 // { int swapoff(const char *name); }
SYS___ACL_GET_LINK = 425 // { int __acl_get_link(const char *path, acl_type_t type, struct acl *aclp); }
SYS___ACL_SET_LINK = 426 // { int __acl_set_link(const char *path, acl_type_t type, struct acl *aclp); }
SYS___ACL_DELETE_LINK = 427 // { int __acl_delete_link(const char *path, acl_type_t type); }
SYS___ACL_ACLCHECK_LINK = 428 // { int __acl_aclcheck_link(const char *path, acl_type_t type, struct acl *aclp); }
SYS_SIGWAIT = 429 // { int sigwait(const sigset_t *set, int *sig); }
SYS_THR_CREATE = 430 // { int thr_create(ucontext_t *ctx, long *id, int flags); }
SYS_THR_EXIT = 431 // { void thr_exit(long *state); }
SYS_THR_SELF = 432 // { int thr_self(long *id); }
SYS_THR_KILL = 433 // { int thr_kill(long id, int sig); }
SYS__UMTX_LOCK = 434 // { int _umtx_lock(struct umtx *umtx); }
SYS__UMTX_UNLOCK = 435 // { int _umtx_unlock(struct umtx *umtx); }
SYS_JAIL_ATTACH = 436 // { int jail_attach(int jid); }
SYS_EXTATTR_LIST_FD = 437 // { ssize_t extattr_list_fd(int fd, int attrnamespace, void *data, size_t nbytes); }
SYS_EXTATTR_LIST_FILE = 438 // { ssize_t extattr_list_file( const char *path, int attrnamespace, void *data, size_t nbytes); }
SYS_EXTATTR_LIST_LINK = 439 // { ssize_t extattr_list_link( const char *path, int attrnamespace, void *data, size_t nbytes); }
SYS_KSEM_TIMEDWAIT = 441 // { int ksem_timedwait(semid_t id, const struct timespec *abstime); }
SYS_THR_SUSPEND = 442 // { int thr_suspend( const struct timespec *timeout); }
SYS_THR_WAKE = 443 // { int thr_wake(long id); }
SYS_KLDUNLOADF = 444 // { int kldunloadf(int fileid, int flags); }
SYS_AUDIT = 445 // { int audit(const void *record, u_int length); }
SYS_AUDITON = 446 // { int auditon(int cmd, void *data, u_int length); }
SYS_GETAUID = 447 // { int getauid(uid_t *auid); }
SYS_SETAUID = 448 // { int setauid(uid_t *auid); }
SYS_GETAUDIT = 449 // { int getaudit(struct auditinfo *auditinfo); }
SYS_SETAUDIT = 450 // { int setaudit(struct auditinfo *auditinfo); }
SYS_GETAUDIT_ADDR = 451 // { int getaudit_addr( struct auditinfo_addr *auditinfo_addr, u_int length); }
SYS_SETAUDIT_ADDR = 452 // { int setaudit_addr( struct auditinfo_addr *auditinfo_addr, u_int length); }
SYS_AUDITCTL = 453 // { int auditctl(char *path); }
SYS__UMTX_OP = 454 // { int _umtx_op(void *obj, int op, u_long val, void *uaddr1, void *uaddr2); }
SYS_THR_NEW = 455 // { int thr_new(struct thr_param *param, int param_size); }
SYS_SIGQUEUE = 456 // { int sigqueue(pid_t pid, int signum, void *value); }
SYS_KMQ_OPEN = 457 // { int kmq_open(const char *path, int flags, mode_t mode, const struct mq_attr *attr); }
SYS_KMQ_SETATTR = 458 // { int kmq_setattr(int mqd, const struct mq_attr *attr, struct mq_attr *oattr); }
SYS_KMQ_TIMEDRECEIVE = 459 // { int kmq_timedreceive(int mqd, char *msg_ptr, size_t msg_len, unsigned *msg_prio, const struct timespec *abs_timeout); }
SYS_KMQ_TIMEDSEND = 460 // { int kmq_timedsend(int mqd, const char *msg_ptr, size_t msg_len,unsigned msg_prio, const struct timespec *abs_timeout);}
SYS_KMQ_NOTIFY = 461 // { int kmq_notify(int mqd, const struct sigevent *sigev); }
SYS_KMQ_UNLINK = 462 // { int kmq_unlink(const char *path); }
SYS_ABORT2 = 463 // { int abort2(const char *why, int nargs, void **args); }
SYS_THR_SET_NAME = 464 // { int thr_set_name(long id, const char *name); }
SYS_AIO_FSYNC = 465 // { int aio_fsync(int op, struct aiocb *aiocbp); }
SYS_RTPRIO_THREAD = 466 // { int rtprio_thread(int function, lwpid_t lwpid, struct rtprio *rtp); }
SYS_SCTP_PEELOFF = 471 // { int sctp_peeloff(int sd, uint32_t name); }
SYS_SCTP_GENERIC_SENDMSG = 472 // { int sctp_generic_sendmsg(int sd, caddr_t msg, int mlen, caddr_t to, __socklen_t tolen, struct sctp_sndrcvinfo *sinfo, int flags); }
SYS_SCTP_GENERIC_SENDMSG_IOV = 473 // { int sctp_generic_sendmsg_iov(int sd, struct iovec *iov, int iovlen, caddr_t to, __socklen_t tolen, struct sctp_sndrcvinfo *sinfo, int flags); }
SYS_SCTP_GENERIC_RECVMSG = 474 // { int sctp_generic_recvmsg(int sd, struct iovec *iov, int iovlen, struct sockaddr * from, __socklen_t *fromlenaddr, struct sctp_sndrcvinfo *sinfo, int *msg_flags); }
SYS_PREAD = 475 // { ssize_t pread(int fd, void *buf, size_t nbyte, off_t offset); }
SYS_PWRITE = 476 // { ssize_t pwrite(int fd, const void *buf, size_t nbyte, off_t offset); }
SYS_MMAP = 477 // { caddr_t mmap(caddr_t addr, size_t len, int prot, int flags, int fd, off_t pos); }
SYS_LSEEK = 478 // { off_t lseek(int fd, off_t offset, int whence); }
SYS_TRUNCATE = 479 // { int truncate(char *path, off_t length); }
SYS_FTRUNCATE = 480 // { int ftruncate(int fd, off_t length); }
SYS_THR_KILL2 = 481 // { int thr_kill2(pid_t pid, long id, int sig); }
SYS_SHM_OPEN = 482 // { int shm_open(const char *path, int flags, mode_t mode); }
SYS_SHM_UNLINK = 483 // { int shm_unlink(const char *path); }
SYS_CPUSET = 484 // { int cpuset(cpusetid_t *setid); }
SYS_CPUSET_SETID = 485 // { int cpuset_setid(cpuwhich_t which, id_t id, cpusetid_t setid); }
SYS_CPUSET_GETID = 486 // { int cpuset_getid(cpulevel_t level, cpuwhich_t which, id_t id, cpusetid_t *setid); }
SYS_CPUSET_GETAFFINITY = 487 // { int cpuset_getaffinity(cpulevel_t level, cpuwhich_t which, id_t id, size_t cpusetsize, cpuset_t *mask); }
SYS_CPUSET_SETAFFINITY = 488 // { int cpuset_setaffinity(cpulevel_t level, cpuwhich_t which, id_t id, size_t cpusetsize, const cpuset_t *mask); }
SYS_FACCESSAT = 489 // { int faccessat(int fd, char *path, int amode, int flag); }
SYS_FCHMODAT = 490 // { int fchmodat(int fd, char *path, mode_t mode, int flag); }
SYS_FCHOWNAT = 491 // { int fchownat(int fd, char *path, uid_t uid, gid_t gid, int flag); }
SYS_FEXECVE = 492 // { int fexecve(int fd, char **argv, char **envv); }
SYS_FSTATAT = 493 // { int fstatat(int fd, char *path, struct stat *buf, int flag); }
SYS_FUTIMESAT = 494 // { int futimesat(int fd, char *path, struct timeval *times); }
SYS_LINKAT = 495 // { int linkat(int fd1, char *path1, int fd2, char *path2, int flag); }
SYS_MKDIRAT = 496 // { int mkdirat(int fd, char *path, mode_t mode); }
SYS_MKFIFOAT = 497 // { int mkfifoat(int fd, char *path, mode_t mode); }
SYS_MKNODAT = 498 // { int mknodat(int fd, char *path, mode_t mode, dev_t dev); }
SYS_OPENAT = 499 // { int openat(int fd, char *path, int flag, mode_t mode); }
SYS_READLINKAT = 500 // { int readlinkat(int fd, char *path, char *buf, size_t bufsize); }
SYS_RENAMEAT = 501 // { int renameat(int oldfd, char *old, int newfd, char *new); }
SYS_SYMLINKAT = 502 // { int symlinkat(char *path1, int fd, char *path2); }
SYS_UNLINKAT = 503 // { int unlinkat(int fd, char *path, int flag); }
SYS_POSIX_OPENPT = 504 // { int posix_openpt(int flags); }
SYS_GSSD_SYSCALL = 505 // { int gssd_syscall(char *path); }
SYS_JAIL_GET = 506 // { int jail_get(struct iovec *iovp, unsigned int iovcnt, int flags); }
SYS_JAIL_SET = 507 // { int jail_set(struct iovec *iovp, unsigned int iovcnt, int flags); }
SYS_JAIL_REMOVE = 508 // { int jail_remove(int jid); }
SYS_CLOSEFROM = 509 // { int closefrom(int lowfd); }
SYS___SEMCTL = 510 // { int __semctl(int semid, int semnum, int cmd, union semun *arg); }
SYS_MSGCTL = 511 // { int msgctl(int msqid, int cmd, struct msqid_ds *buf); }
SYS_SHMCTL = 512 // { int shmctl(int shmid, int cmd, struct shmid_ds *buf); }
SYS_LPATHCONF = 513 // { int lpathconf(char *path, int name); }
SYS___CAP_RIGHTS_GET = 515 // { int __cap_rights_get(int version, int fd, cap_rights_t *rightsp); }
SYS_CAP_ENTER = 516 // { int cap_enter(void); }
SYS_CAP_GETMODE = 517 // { int cap_getmode(u_int *modep); }
SYS_PDFORK = 518 // { int pdfork(int *fdp, int flags); }
SYS_PDKILL = 519 // { int pdkill(int fd, int signum); }
SYS_PDGETPID = 520 // { int pdgetpid(int fd, pid_t *pidp); }
SYS_PSELECT = 522 // { int pselect(int nd, fd_set *in, fd_set *ou, fd_set *ex, const struct timespec *ts, const sigset_t *sm); }
SYS_GETLOGINCLASS = 523 // { int getloginclass(char *namebuf, size_t namelen); }
SYS_SETLOGINCLASS = 524 // { int setloginclass(const char *namebuf); }
SYS_RCTL_GET_RACCT = 525 // { int rctl_get_racct(const void *inbufp, size_t inbuflen, void *outbufp, size_t outbuflen); }
SYS_RCTL_GET_RULES = 526 // { int rctl_get_rules(const void *inbufp, size_t inbuflen, void *outbufp, size_t outbuflen); }
SYS_RCTL_GET_LIMITS = 527 // { int rctl_get_limits(const void *inbufp, size_t inbuflen, void *outbufp, size_t outbuflen); }
SYS_RCTL_ADD_RULE = 528 // { int rctl_add_rule(const void *inbufp, size_t inbuflen, void *outbufp, size_t outbuflen); }
SYS_RCTL_REMOVE_RULE = 529 // { int rctl_remove_rule(const void *inbufp, size_t inbuflen, void *outbufp, size_t outbuflen); }
SYS_POSIX_FALLOCATE = 530 // { int posix_fallocate(int fd, off_t offset, off_t len); }
SYS_POSIX_FADVISE = 531 // { int posix_fadvise(int fd, off_t offset, off_t len, int advice); }
SYS_WAIT6 = 532 // { int wait6(idtype_t idtype, id_t id, int *status, int options, struct __wrusage *wrusage, siginfo_t *info); }
SYS_CAP_RIGHTS_LIMIT = 533 // { int cap_rights_limit(int fd, cap_rights_t *rightsp); }
SYS_CAP_IOCTLS_LIMIT = 534 // { int cap_ioctls_limit(int fd, const u_long *cmds, size_t ncmds); }
SYS_CAP_IOCTLS_GET = 535 // { ssize_t cap_ioctls_get(int fd, u_long *cmds, size_t maxcmds); }
SYS_CAP_FCNTLS_LIMIT = 536 // { int cap_fcntls_limit(int fd, uint32_t fcntlrights); }
SYS_CAP_FCNTLS_GET = 537 // { int cap_fcntls_get(int fd, uint32_t *fcntlrightsp); }
SYS_BINDAT = 538 // { int bindat(int fd, int s, caddr_t name, int namelen); }
SYS_CONNECTAT = 539 // { int connectat(int fd, int s, caddr_t name, int namelen); }
SYS_CHFLAGSAT = 540 // { int chflagsat(int fd, const char *path, u_long flags, int atflag); }
SYS_ACCEPT4 = 541 // { int accept4(int s, struct sockaddr * __restrict name, __socklen_t * __restrict anamelen, int flags); }
SYS_PIPE2 = 542 // { int pipe2(int *fildes, int flags); }
SYS_AIO_MLOCK = 543 // { int aio_mlock(struct aiocb *aiocbp); }
SYS_PROCCTL = 544 // { int procctl(idtype_t idtype, id_t id, int com, void *data); }
SYS_PPOLL = 545 // { int ppoll(struct pollfd *fds, u_int nfds, const struct timespec *ts, const sigset_t *set); }
SYS_FUTIMENS = 546 // { int futimens(int fd, struct timespec *times); }
SYS_UTIMENSAT = 547 // { int utimensat(int fd, char *path, struct timespec *times, int flag); }
)
| {
"pile_set_name": "Github"
} |
LR_IROM1 0x00000000 0x8000 { ; load region size_region (32k)
ER_IROM1 0x00000000 0x8000 { ; load address = execution address
*.o (RESET, +First)
*(InRoot$$Sections)
.ANY (+RO)
}
; 8_byte_aligned(48 vect * 4 bytes) = 8_byte_aligned(0xC0) = 0xC0
; 6KB - 0xC0 = 0x1740
RW_IRAM1 0x100000C0 0x1740 {
.ANY (+RW +ZI)
}
RW_IRAM2 0x20004000 0x800 { ; RW data, USB RAM
.ANY (USBRAM)
}
}
| {
"pile_set_name": "Github"
} |
Force a time update with `ntp`
Change your `hostname` on systems using `systemd`
Incorrect time on dual boot systems
Preventing a user from logging into the system
Fixing `locale` issues in Debian systems | {
"pile_set_name": "Github"
} |
# *****************************************************************************
# Copyright (c) 2020, Intel Corporation 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.
#
# 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.
# *****************************************************************************
import contextlib
import functools
import llvmlite.binding as ll
from llvmlite import ir as lir
from .. import hio
from collections import defaultdict
import numba
from numba.core import typeinfer, ir, ir_utils, types
from numba.core.typing.templates import signature
from numba.extending import overload, intrinsic, register_model, models, box
from numba.core.ir_utils import (visit_vars_inner, replace_vars_inner,
compile_to_numba_ir, replace_arg_nodes)
from numba.core import analysis
from numba.parfors import array_analysis
import sdc
from sdc import distributed, distributed_analysis
from sdc.utilities.utils import (debug_prints, alloc_arr_tup, empty_like_type,
_numba_to_c_type_map)
from sdc.distributed_analysis import Distribution
from sdc.hiframes.pd_dataframe_type import DataFrameType, ColumnLoc
from sdc.hiframes.pd_dataframe_ext import get_structure_maps
from sdc.str_ext import string_type
from sdc.str_arr_ext import (string_array_type, to_string_list,
cp_str_list_to_array, str_list_to_array,
get_offset_ptr, get_data_ptr, convert_len_arr_to_offset,
pre_alloc_string_array, num_total_chars,
getitem_str_offset, copy_str_arr_slice)
from sdc.timsort import copyElement_tup, getitem_arr_tup
from sdc import objmode
import pandas as pd
import numpy as np
from sdc.types import Categorical
import pyarrow
import pyarrow.csv
class CsvReader(ir.Stmt):
def __init__(self, file_name, df_out, sep, df_colnames, out_vars, out_types, usecols, loc, skiprows=0):
self.file_name = file_name
self.df_out = df_out
self.sep = sep
self.df_colnames = df_colnames
self.out_vars = out_vars
self.out_types = out_types
self.usecols = usecols
self.loc = loc
self.skiprows = skiprows
def __repr__(self): # pragma: no cover
# TODO
return "{} = ReadCsv()".format(self.df_out)
def csv_array_analysis(csv_node, equiv_set, typemap, array_analysis):
post = []
# empty csv nodes should be deleted in remove dead
assert len(csv_node.out_vars) > 0, "empty csv in array analysis"
# create correlations for output arrays
# arrays of output df have same size in first dimension
# gen size variable for an output column
all_shapes = []
for col_var in csv_node.out_vars:
typ = typemap[col_var.name]
# TODO: string_series_type also?
if typ == string_array_type:
continue
(shape, c_post) = array_analysis._gen_shape_call(
equiv_set, col_var, typ.ndim, None)
equiv_set.insert_equiv(col_var, shape)
post.extend(c_post)
all_shapes.append(shape[0])
equiv_set.define(col_var, {})
if len(all_shapes) > 1:
equiv_set.insert_equiv(*all_shapes)
return [], post
array_analysis.array_analysis_extensions[CsvReader] = csv_array_analysis
def csv_distributed_analysis(csv_node, array_dists):
for v in csv_node.out_vars:
if v.name not in array_dists:
array_dists[v.name] = Distribution.OneD
return
distributed_analysis.distributed_analysis_extensions[CsvReader] = csv_distributed_analysis
def csv_typeinfer(csv_node, typeinferer):
for col_var, typ in zip(csv_node.out_vars, csv_node.out_types):
typeinferer.lock_type(col_var.name, typ, loc=csv_node.loc)
return
typeinfer.typeinfer_extensions[CsvReader] = csv_typeinfer
def visit_vars_csv(csv_node, callback, cbdata):
if debug_prints(): # pragma: no cover
print("visiting csv vars for:", csv_node)
print("cbdata: ", sorted(cbdata.items()))
# update output_vars
new_out_vars = []
for col_var in csv_node.out_vars:
new_var = visit_vars_inner(col_var, callback, cbdata)
new_out_vars.append(new_var)
csv_node.out_vars = new_out_vars
csv_node.file_name = visit_vars_inner(csv_node.file_name, callback, cbdata)
return
# add call to visit csv variable
ir_utils.visit_vars_extensions[CsvReader] = visit_vars_csv
def remove_dead_csv(csv_node, lives, arg_aliases, alias_map, func_ir, typemap):
# TODO
new_df_colnames = []
new_out_vars = []
new_out_types = []
new_usecols = []
for i, col_var in enumerate(csv_node.out_vars):
if col_var.name in lives:
new_df_colnames.append(csv_node.df_colnames[i])
new_out_vars.append(csv_node.out_vars[i])
new_out_types.append(csv_node.out_types[i])
new_usecols.append(csv_node.usecols[i])
csv_node.df_colnames = new_df_colnames
csv_node.out_vars = new_out_vars
csv_node.out_types = new_out_types
csv_node.usecols = new_usecols
if len(csv_node.out_vars) == 0:
return None
return csv_node
ir_utils.remove_dead_extensions[CsvReader] = remove_dead_csv
def csv_usedefs(csv_node, use_set=None, def_set=None):
if use_set is None:
use_set = set()
if def_set is None:
def_set = set()
# output columns are defined
def_set.update({v.name for v in csv_node.out_vars})
use_set.add(csv_node.file_name.name)
return analysis._use_defs_result(usemap=use_set, defmap=def_set)
analysis.ir_extension_usedefs[CsvReader] = csv_usedefs
def get_copies_csv(csv_node, typemap):
# csv doesn't generate copies, it just kills the output columns
kill_set = set(v.name for v in csv_node.out_vars)
return set(), kill_set
ir_utils.copy_propagate_extensions[CsvReader] = get_copies_csv
def apply_copies_csv(csv_node, var_dict, name_var_table, typemap, calltypes, save_copies):
"""apply copy propagate in csv node"""
# update output_vars
new_out_vars = []
for col_var in csv_node.out_vars:
new_var = replace_vars_inner(col_var, var_dict)
new_out_vars.append(new_var)
csv_node.out_vars = new_out_vars
csv_node.file_name = replace_vars_inner(csv_node.file_name, var_dict)
return
ir_utils.apply_copy_propagate_extensions[CsvReader] = apply_copies_csv
def build_csv_definitions(csv_node, definitions=None):
if definitions is None:
definitions = defaultdict(list)
for col_var in csv_node.out_vars:
definitions[col_var.name].append(csv_node)
return definitions
ir_utils.build_defs_extensions[CsvReader] = build_csv_definitions
def csv_distributed_run(csv_node, array_dists, typemap, calltypes, typingctx, targetctx, dist_pass):
parallel = False
n_cols = len(csv_node.out_vars)
# TODO: rebalance if output distributions are 1D instead of 1D_Var
# get column variables
arg_names = ", ".join("arr" + str(i) for i in range(n_cols))
func_text = "def csv_impl(fname):\n"
func_text += " ({},) = _csv_reader_py(fname)\n".format(arg_names)
# print(func_text)
loc_vars = {}
exec(func_text, {}, loc_vars)
csv_impl = loc_vars['csv_impl']
csv_reader_py = _gen_csv_reader_py(
csv_node.df_colnames, csv_node.out_types, csv_node.usecols,
csv_node.sep, typingctx, targetctx, parallel, csv_node.skiprows)
f_block = compile_to_numba_ir(csv_impl,
{'_csv_reader_py': csv_reader_py},
typingctx, (string_type,),
typemap, calltypes).blocks.popitem()[1]
replace_arg_nodes(f_block, [csv_node.file_name])
nodes = f_block.body[:-3]
for i in range(len(csv_node.out_vars)):
nodes[-len(csv_node.out_vars) + i].target = csv_node.out_vars[i]
# get global array sizes by calling allreduce on chunk lens
# TODO: get global size from C
for arr in csv_node.out_vars:
def f(A):
return sdc.distributed_api.dist_reduce(len(A), np.int32(_op))
f_block = compile_to_numba_ir(
f, {'sdc': sdc, 'np': np,
'_op': sdc.distributed_api.Reduce_Type.Sum.value},
typingctx, (typemap[arr.name],), typemap, calltypes).blocks.popitem()[1]
replace_arg_nodes(f_block, [arr])
nodes += f_block.body[:-2]
size_var = nodes[-1].target
dist_pass._array_sizes[arr.name] = [size_var]
out, start_var, end_var = dist_pass._gen_1D_div(
size_var, arr.scope, csv_node.loc, "$alloc", "get_node_portion",
sdc.distributed_api.get_node_portion)
dist_pass._array_starts[arr.name] = [start_var]
dist_pass._array_counts[arr.name] = [end_var]
nodes += out
return nodes
distributed.distributed_run_extensions[CsvReader] = csv_distributed_run
class StreamReaderType(types.Opaque):
def __init__(self):
super(StreamReaderType, self).__init__(name='StreamReaderType')
stream_reader_type = StreamReaderType()
register_model(StreamReaderType)(models.OpaqueModel)
@box(StreamReaderType)
def box_stream_reader(typ, val, c):
return val
# XXX: temporary fix pending Numba's #3378
# keep the compiled functions around to make sure GC doesn't delete them and
# the reference to the dynamic function inside them
# (numba/lowering.py:self.context.add_dynamic_addr ...)
compiled_funcs = []
# TODO: move to hpat.common
def to_varname(string):
"""Converts string to correct Python variable name.
Replaces unavailable symbols with _ and insert _ if string starts with digit.
"""
import re
return re.sub(r'\W|^(?=\d)', '_', string)
@contextlib.contextmanager
def pyarrow_cpu_count(cpu_count=pyarrow.cpu_count()):
old_cpu_count = pyarrow.cpu_count()
pyarrow.set_cpu_count(cpu_count)
try:
yield
finally:
pyarrow.set_cpu_count(old_cpu_count)
def pyarrow_cpu_count_equal_numba_num_treads(func):
"""Decorator. Set pyarrow cpu_count the same as NUMBA_NUM_THREADS."""
@functools.wraps(func)
def wrapper(*args, **kwargs):
with pyarrow_cpu_count(numba.config.NUMBA_NUM_THREADS):
return func(*args, **kwargs)
return wrapper
@pyarrow_cpu_count_equal_numba_num_treads
def pandas_read_csv(
filepath_or_buffer,
sep=',',
delimiter=None,
# Column and Index Locations and Names
header="infer",
names=None,
index_col=None,
usecols=None,
squeeze=False,
prefix=None,
mangle_dupe_cols=True,
# General Parsing Configuration
dtype=None,
engine=None,
converters=None,
true_values=None,
false_values=None,
skipinitialspace=False,
skiprows=None,
skipfooter=0,
nrows=None,
# NA and Missing Data Handling
na_values=None,
keep_default_na=True,
na_filter=True,
verbose=False,
skip_blank_lines=True,
# Datetime Handling
parse_dates=False,
infer_datetime_format=False,
keep_date_col=False,
date_parser=None,
dayfirst=False,
cache_dates=True,
# Iteration
iterator=False,
chunksize=None,
# Quoting, Compression, and File Format
compression="infer",
thousands=None,
decimal=b".",
lineterminator=None,
quotechar='"',
# quoting=csv.QUOTE_MINIMAL, # not supported
doublequote=True,
escapechar=None,
comment=None,
encoding=None,
dialect=None,
# Error Handling
error_bad_lines=True,
warn_bad_lines=True,
# Internal
delim_whitespace=False,
# low_memory=_c_parser_defaults["low_memory"], # not supported
memory_map=False,
float_precision=None,
):
"""Implements pandas.read_csv via pyarrow.csv.read_csv.
This function has the same interface as pandas.read_csv.
"""
if delimiter is None:
delimiter = sep
autogenerate_column_names = bool(names)
include_columns = None
if usecols:
if type(usecols[0]) == str:
if names:
include_columns = [f'f{names.index(col)}' for col in usecols]
else:
include_columns = usecols
elif type(usecols[0]) == int:
include_columns = [f'f{i}' for i in usecols]
else:
# usecols should be all str or int
assert False
# try:
# keys = [k for k, v in dtype.items() if isinstance(v, pd.CategoricalDtype)]
# if keys:
# for k in keys:
# del dtype[k]
# names_list = list(names)
# categories = [f"f{names_list.index(k)}" for k in keys]
# except: pass
categories = []
if dtype:
if names:
names_list = list(names)
if isinstance(dtype, dict):
column_types = {}
for k, v in dtype.items():
column_name = "f{}".format(names_list.index(k))
if isinstance(v, pd.CategoricalDtype):
categories.append(column_name)
column_type = pyarrow.string()
else:
column_type = pyarrow.from_numpy_dtype(v)
column_types[column_name] = column_type
else:
pa_dtype = pyarrow.from_numpy_dtype(dtype)
column_types = {f"f{names_list.index(k)}": pa_dtype for k in names}
elif usecols:
if isinstance(dtype, dict):
column_types = {k: pyarrow.from_numpy_dtype(v) for k, v in dtype.items()}
else:
column_types = {k: pyarrow.from_numpy_dtype(dtype) for k in usecols}
else:
if isinstance(dtype, dict):
column_types = {k: pyarrow.from_numpy_dtype(v) for k, v in dtype.items()}
else:
column_types = pyarrow.from_numpy_dtype(dtype)
else:
column_types = None
try:
for column in parse_dates:
name = f"f{column}"
# TODO: Try to help pyarrow infer date type - set DateType.
# dtype[name] = pyarrow.from_numpy_dtype(np.datetime64) # string
del column_types[name]
except: pass
parse_options = pyarrow.csv.ParseOptions(
delimiter=delimiter,
)
read_options = pyarrow.csv.ReadOptions(
skip_rows=skiprows,
# column_names=column_names,
autogenerate_column_names=autogenerate_column_names,
)
convert_options = pyarrow.csv.ConvertOptions(
column_types=column_types,
strings_can_be_null=True,
include_columns=include_columns,
)
table = pyarrow.csv.read_csv(
filepath_or_buffer,
read_options=read_options,
parse_options=parse_options,
convert_options=convert_options,
)
dataframe = table.to_pandas(
# categories=categories or None,
)
if names:
if usecols and len(names) != len(usecols):
if isinstance(usecols[0], int):
dataframe.columns = [names[col] for col in usecols]
elif isinstance(usecols[0], str):
dataframe.columns = [name for name in names if name in usecols]
else:
dataframe.columns = names
# fix when PyArrow will support predicted categories
if isinstance(dtype, dict):
for column_name, column_type in dtype.items():
if isinstance(column_type, pd.CategoricalDtype):
dataframe[column_name] = dataframe[column_name].astype(column_type)
return dataframe
def _gen_pandas_read_csv_func_text(col_names, col_typs, py_col_dtypes, usecols, signature=None):
func_name = 'csv_reader_py'
return_columns = usecols if usecols and isinstance(usecols[0], str) else col_names
column_loc, _, _ = get_structure_maps(col_typs, return_columns)
df_type = DataFrameType(
tuple(col_typs),
types.none,
tuple(col_names),
column_loc=column_loc
)
df_type_repr = repr(df_type)
# for some reason pandas and pyarrow read_csv() return CategoricalDtype with
# ordered=False in case when dtype is with ordered=None
df_type_repr = df_type_repr.replace('ordered=None', 'ordered=False')
# TODO: support non-numpy types like strings
date_inds = ", ".join(str(i) for i, t in enumerate(col_typs) if t.dtype == types.NPDatetime('ns'))
return_columns = usecols if usecols and isinstance(usecols[0], str) else col_names
if signature is None:
signature = "filepath_or_buffer"
# map generated func params into values used in inner call of pandas_read_csv
# if no transformation is needed just use outer param name (since APIs match)
# otherwise use value in the dictionary
inner_call_params = {'parse_dates': f"[{date_inds}]"}
used_read_csv_params = (
'filepath_or_buffer',
'names',
'skiprows',
'parse_dates',
'dtype',
'usecols',
'sep',
'delimiter'
)
# pyarrow reads unnamed header as " ", pandas reads it as "Unnamed: N"
# during inference from file names should be raplaced with "Unnamed: N"
# passing names to pyarrow means that one row is header and should be skipped
if col_names and any(map(lambda x: x.startswith('Unnamed: '), col_names)):
inner_call_params['names'] = str(col_names)
inner_call_params['skiprows'] = "(skiprows and skiprows + 1) or 1"
# dtype parameter of compiled function is not used at all, instead a python dict
# of columns dtypes is captured at compile time, because some dtypes (like datetime)
# are converted and also to avoid penalty of creating dict in objmode
inner_call_params['dtype'] = 'read_as_dtypes'
params_str = '\n'.join([
f" {param}={inner_call_params.get(param, param)}," for param in used_read_csv_params
])
func_text = '\n'.join([
f"def {func_name}({signature}):",
f" with objmode(df=\"{df_type_repr}\"):",
f" df = pandas_read_csv(\n{params_str}",
f" )",
f" return df"
])
global_vars = {
'read_as_dtypes': py_col_dtypes,
'objmode': objmode,
'pandas_read_csv': pandas_read_csv,
}
return func_text, func_name, global_vars
def _gen_csv_reader_py_pyarrow_py_func(func_text, func_name, global_vars):
locals = {}
exec(func_text, global_vars, locals)
func = locals[func_name]
return func
def _gen_csv_reader_py_pyarrow_jit_func(csv_reader_py):
# TODO: no_cpython_wrapper=True crashes for some reason
jit_func = numba.njit(csv_reader_py)
compiled_funcs.append(jit_func)
return jit_func
| {
"pile_set_name": "Github"
} |
Installation
============
.. note::
For troubleshooting information, see these pages:
`Linux <https://github.com/konlpy/konlpy/issues?q=label%3AOS%2FLinux>`_.
`Mac OS <https://github.com/konlpy/konlpy/issues?q=label%3AOS%2FMacOS>`_.
`Windows <https://github.com/konlpy/konlpy/issues?q=label%3AOS%2FWindows>`_.
Please record a `"New Issue" <https://github.com/konlpy/konlpy/issues/new>`_ if you have an error that is not listed.
.. Warning::
Python 2 End of Life Announced as January 1st 2020.
This page covers Python 3 only. The last-known version for Python 2 is v0.5.2, install it via `pip install konlpy==v0.5.2`.
Ubuntu
------
Supported: Xenial(16.04.3 LTS), Bionic(18.04.3 LTS), Disco(19.04), Eoan(19.10)
1. Install dependencies
.. sourcecode:: bash
# Install Java 1.8 or up
$ sudo apt-get install g++ openjdk-8-jdk python3-dev python3-pip curl
2. Install KoNLPy
.. sourcecode:: bash
$ python3 -m pip install --upgrade pip
$ python3 -m pip install konlpy # Python 3.x
3. Install MeCab (*optional*)
.. sourcecode:: bash
$ sudo apt-get install curl git
$ bash <(curl -s https://raw.githubusercontent.com/konlpy/konlpy/master/scripts/mecab.sh)
CentOS
------
Supported: CentOS 7, 8
1. Install dependencies
.. sourcecode:: bash
$ sudo yum install gcc-c++ java-1.8.0-openjdk-devel python3 python3-devel python3-pip make diffutils
2. Install KoNLPy
.. sourcecode:: bash
$ python3 -m pip install --upgrade pip
$ python3 -m pip install konlpy # Python 3.x
3. Install MeCab (*optional*)
.. sourcecode:: bash
$ sudo yum install curl git
$ bash <(curl -s https://raw.githubusercontent.com/konlpy/konlpy/master/scripts/mecab.sh)
Mac OS
------
1. Install KoNLPy
.. sourcecode:: bash
$ python3 -m pip install --upgrade pip
$ python3 -m pip install konlpy # Python 3.x
2. Install MeCab (*optional*)
.. sourcecode:: bash
$ bash <(curl -s https://raw.githubusercontent.com/konlpy/konlpy/master/scripts/mecab.sh)
Windows
-------
1. Does your Python installation's "bit version" match your Windows OS? If you're using a 64 bit Windows you need a 64 bit Python, and if you have a 32 bit Windows, you need a 32 bit Python. Reinstall your Python if your bit versions do not match.
- How to check your Windows bit version
.. image:: images/windows-bits.png
:width: 600px
- How to check your Python bit version
.. image:: images/python-bits.png
:width: 400px
2. Do you have a Java of version 1.7 or above installed, that matches your OS bit version? If not, `download and install a JDK <http://www.oracle.com/technetwork/java/javase/downloads/index.html>`_. Note again, that the bit versions must match.
3. Set `JAVA_HOME <http://docs.oracle.com/cd/E19182-01/820-7851/inst_cli_jdk_javahome_t/index.html>`_.
4. Download and install the `JPype1 (>=0.5.7) <http://www.lfd.uci.edu/~gohlke/pythonlibs/#jpype>`_ that matches your bit version: `win32` for 32 bit and `win-amd64` for 64 bit. You may have to `upgrade your pip <https://pip.pypa.io/en/stable/installing.html#upgrade-pip>`_ in order to install the downloaded `.whl` file.
.. sourcecode:: guess
> pip install --upgrade pip
> pip install JPype1-0.5.7-cp27-none-win_amd64.whl
5. From the command prompt, install KoNLPy.
.. sourcecode:: guess
> pip install konlpy
.. warning::
- KoNLPy's ``Mecab()`` class is not supported on Windows machines.
Docker
------
If you are familiar with Docker, it is easy to install `konlpy` and `java-1.7-openjdk` on `python:3` image.
.. sourcecode:: docker
> FROM python:3
> ENV JAVA_HOME /usr/lib/jvm/java-1.7-openjdk/jre
> RUN apt-get update && apt-get install -y g++ default-jdk
> RUN pip install konlpy
> # Write left part as you want
| {
"pile_set_name": "Github"
} |
{
GTK3 Interface
Dummy implementation. Not tested.
}
type
TTimerList = class
end;
var
FTimerList: TTimerList;
function CF_UNICODETEXT: TClipboardFormat;
begin
//todo
Result := TClipboardFormat(0);
end;
{
Only a few functions are necessary to compile VirtualTreeView:
BitBlt
GetCurrentObject
Set/KillTimer (Look at Qt/Gtk implementation)
}
{$define HAS_GETCURRENTOBJECT}
{.$define HAS_MAPMODEFUNCTIONS}
{.$define HAS_GETTEXTEXTENTEXPOINT}
{.$define HAS_GETDOUBLECLICKTIME}
{.$define HAS_GETTEXTALIGN}
{.$define HAS_GETWINDOWDC}
{.$define HAS_INVERTRECT}
{.$define HAS_OFFSETRGN}
{.$define HAS_REDRAWWINDOW}
{.$define HAS_SCROLLWINDOW}
{.$define HAS_SETBRUSHORGEX}
{$i ../generic/stubs.inc}
{$i ../generic/independentfunctions.inc}
{$i ../generic/unicodefunctions.inc}
function BitBlt(DestDC: HDC; X, Y, Width, Height: Integer; SrcDC: HDC; XSrc,
YSrc: Integer; Rop: DWORD): Boolean;
begin
Result := StretchMaskBlt(DestDC, X, Y, Width, Height, SrcDC, XSrc, YSrc,
Width, Height, 0, 0, 0, Rop);
end;
function GetCurrentObject(hdc: HDC; uObjectType: UINT): HGDIOBJ;
begin
Result := 0;
{ if GTK2WidgetSet.IsValidDC(hdc) then
with TGtkDeviceContext(hdc) do
begin
case uObjectType of
OBJ_BITMAP: Result := {%H-}HGDIOBJ(CurrentBitmap);
OBJ_BRUSH: Result := {%H-}HGDIOBJ(CurrentBrush);
OBJ_FONT: Result := {%H-}HGDIOBJ(CurrentFont);
OBJ_PEN: Result := {%H-}HGDIOBJ(CurrentPen);
end;
end;}
end;
function KillTimer(hWnd: THandle; nIDEvent: UINT_PTR):Boolean;
begin
Result := LCLIntf.KillTimer(hWnd, nIDEvent);
end;
function SetTimer(hWnd: THandle; nIDEvent: UINT_PTR; uElapse: LongWord; lpTimerFunc: TTimerNotify): UINT_PTR;
begin
Result := LCLIntf.SetTimer(hWnd, nIDEvent, uElapse, nil{lpTimerFunc});
end;
| {
"pile_set_name": "Github"
} |
//
// TwitterTimelineParser.m
// HelTweetica
//
// Created by Lucius Kwok on 3/30/10.
/*
Copyright (c) 2010, Felt Tip 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:
1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
3. Neither the name of the copyright holder(s) nor the names of any 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.
*/
#import "TwitterAtomParser.h"
@interface TwitterAtomParser (PrivateMethods)
- (void) parseTitle;
- (void) parseContent;
- (void) parseDate;
@end
@implementation TwitterAtomParser
@synthesize tweets, currentMessage, currentKey, currentText, directMessage, receivedTimestamp;
- (void) dealloc {
[interestingKeys release];
[tweets release];
[currentMessage release];
[currentKey release];
[currentText release];
[receivedTimestamp release];
[super dealloc];
}
- (id) init {
if (self = [super init]) {
interestingKeys = [[NSSet alloc] initWithObjects: @"id", @"title", @"content", @"published", nil];
}
return self;
}
- (NSArray*) parseData: (NSData*) xmlData {
NSXMLParser *parser = [[NSXMLParser alloc] initWithData:xmlData];
parser.delegate = self;
self.tweets = [NSMutableArray array];
[parser parse];
[parser release];
return self.tweets;
}
- (void)parser:(NSXMLParser *)parser parseErrorOccurred:(NSError *)parseError {
NSLog (@"XML parser error %@", parseError);
}
- (void)parser:(NSXMLParser *)parser didStartElement:(NSString *)elementName namespaceURI:(NSString *)namespaceURI qualifiedName:(NSString *)qName attributes:(NSDictionary *)attributeDict {
if ([elementName isEqualToString:@"entry"]) {
self.currentMessage = [[[TwitterStatusUpdate alloc] init] autorelease];
currentMessage.direct = directMessage;
if (receivedTimestamp != nil)
currentMessage.receivedDate = receivedTimestamp;
} else if ([elementName isEqualToString:@"link"]) {
NSString *type = [attributeDict objectForKey:@"type"];
NSString *href = [attributeDict objectForKey:@"href"];
if ([type hasPrefix:@"image"])
self.currentMessage.avatar = href;
} else if ([interestingKeys containsObject:elementName]) {
self.currentText = [[[NSMutableString alloc] init] autorelease];
}
}
- (void)parser:(NSXMLParser *)parser foundCharacters:(NSString *)string {
[currentText appendString:string];
}
- (void)parser:(NSXMLParser *)parser didEndElement:(NSString *)elementName namespaceURI:(NSString *)namespaceURI qualifiedName:(NSString *)qName {
if ([elementName isEqualToString:@"entry"]) {
[self.tweets addObject: self.currentMessage];
self.currentMessage = nil;
} else if ([interestingKeys containsObject:elementName]) {
if (self.currentText != nil) {
if ([elementName isEqualToString:@"id"]) {
// For the id, extract the last path component from the URL.
NSScanner *scanner = [NSScanner scannerWithString:[currentText lastPathComponent]];
SInt64 identifierInt64 = 0;
[scanner scanLongLong: &identifierInt64];
self.currentMessage.identifier = [NSNumber numberWithLongLong: identifierInt64];
} else if ([elementName isEqualToString:@"title"]) {
[self parseTitle];
} else if ([elementName isEqualToString:@"content"]) {
[self parseContent];
} else if ([elementName isEqualToString:@"published"]) {
[self parseDate];
}
}
self.currentText = nil;
}
}
- (void) parseTitle {
if (directMessage == YES) {
// For direct messages, extract the author's username from the title
NSArray *words = [self.currentText componentsSeparatedByCharactersInSet: [NSCharacterSet whitespaceCharacterSet]];
if (words.count > 2) {
self.currentMessage.userScreenName = [words objectAtIndex:2]; // from user is always third word
}
}
}
- (void) parseContent {
if (directMessage == YES) {
// For direct messages, the entire content is the message
self.currentMessage.content = currentText;
} else {
NSRange range = [currentText rangeOfString: @": "];
if (range.location != NSNotFound) {
self.currentMessage.userScreenName = [currentText substringToIndex: range.location];
self.currentMessage.content = [currentText substringFromIndex:range.location + range.length];
} else {
self.currentMessage.content = currentText;
}
}
}
- (void) parseDate {
NSDateFormatter *formatter = [[NSDateFormatter alloc] init];
[formatter setDateFormat:@"yyyy-MM-dd'T'HH:mm:ssZZZ"]; // 2010-04-01T04:32:26+00:00
self.currentMessage.createdDate = [formatter dateFromString:currentText];
[formatter release];
}
@end
| {
"pile_set_name": "Github"
} |
---
ko:
activerecord:
errors:
messages:
record_invalid: 데이터 검증에 실패하였습니다. %{errors}
restrict_dependent_destroy:
has_one: "%{record}가 존재하기 때문에 삭제할 수 없습니다"
has_many: "%{record}가 존재하기 때문에 삭제할 수 없습니다"
date:
abbr_day_names:
- 일
- 월
- 화
- 수
- 목
- 금
- 토
abbr_month_names:
-
- 1월
- 2월
- 3월
- 4월
- 5월
- 6월
- 7월
- 8월
- 9월
- 10월
- 11월
- 12월
day_names:
- 일요일
- 월요일
- 화요일
- 수요일
- 목요일
- 금요일
- 토요일
formats:
default: "%Y/%m/%d"
long: "%Y년 %m월 %d일 (%a)"
short: "%m/%d"
month_names:
-
- 1월
- 2월
- 3월
- 4월
- 5월
- 6월
- 7월
- 8월
- 9월
- 10월
- 11월
- 12월
order:
- :year
- :month
- :day
datetime:
distance_in_words:
about_x_hours:
one: 약 한 시간
other: 약 %{count}시간
about_x_months:
one: 약 한 달
other: 약 %{count}달
about_x_years:
one: 약 일 년
other: 약 %{count}년
almost_x_years:
one: 일 년 이하
other: "%{count}년 이하"
half_a_minute: 30초
less_than_x_seconds:
one: 일 초 이하
other: "%{count}초 이하"
less_than_x_minutes:
one: 일 분 이하
other: "%{count}분 이하"
over_x_years:
one: 일 년 이상
other: "%{count}년 이상"
x_seconds:
one: 일 초
other: "%{count}초"
x_minutes:
one: 일 분
other: "%{count}분"
x_days:
one: 하루
other: "%{count}일"
x_months:
one: 한 달
other: "%{count}달"
x_years:
one: 일 년
other: "%{count}년"
prompts:
second: 초
minute: 분
hour: 시
day: 일
month: 월
year: 년
errors:
format: "%{message}"
messages:
accepted: "%{attribute}을(를) 반드시 확인해야 합니다"
blank: "%{attribute}에 내용을 입력해 주세요"
confirmation: "%{attribute}은(는) 서로 일치해야 합니다"
empty: "%{attribute}에 내용을 입력해 주세요"
equal_to: "%{attribute}은(는) %{count}과 같아야 합니다"
even: "%{attribute}에 짝수를 입력해 주세요"
exclusion: "%{attribute}은(는) 이미 예약되어 있는 값입니다"
greater_than: "%{attribute}은(는) %{count}보다 커야 합니다"
greater_than_or_equal_to: "%{attribute}은(는) %{count}보다 크거야 같아야 합니다"
inclusion: "%{attribute}은(는) 목록에 포함되어 있는 값이 아닙니다"
invalid: "%{attribute}은(는) 올바르지 않은 값입니다"
less_than: "%{attribute}은(는) %{count}보다 작아야 합니다"
less_than_or_equal_to: "%{attribute}은(는) %{count}과 작거나 같아야 합니다"
model_invalid: "%{attribute}에 대한 데이터 검증에 실패하였습니다: %{errors}"
not_a_number: "%{attribute}에 숫자를 입력해 주세요"
not_an_integer: "%{attribute}에 정수를 입력해 주세요"
odd: "%{attribute}에 홀수를 입력해 주세요"
other_than: "%{attribute}은(는) %{count}와(과) 달라야 합니다"
present: "%{attribute}은(는) 비어있어야 합니다"
required: "%{attribute}은(는) 반드시 있어야 합니다"
taken: "%{attribute}은(는) 이미 존재합니다"
too_long: "%{attribute}은(는) %{count}자를 넘을 수 없습니다"
too_short: "%{attribute}은(는) 적어도 %{count}자를 넘어야 합니다"
wrong_length: "%{attribute}은(는) %{count}자여야 합니다"
template:
body: 아래 문제를 확인해 주세요.
header:
one: 한 개의 오류로 인해 %{model}을(를) 저장할 수 없습니다
other: "%{count}개의 오류로 인해 %{model}을(를) 저장할 수 없습니다"
helpers:
select:
prompt: 선택해주세요
submit:
create: 등록
submit: 제출
update: 수정
number:
currency:
format:
delimiter: ","
format: "%n%u"
precision: 0
separator: "."
significant: false
strip_insignificant_zeros: false
unit: 원
format:
delimiter: ","
precision: 3
separator: "."
significant: false
strip_insignificant_zeros: false
human:
decimal_units:
format: "%n%u"
units:
billion: 십억
million: 백만
quadrillion: 경
thousand: 천
trillion: 조
unit: ''
format:
delimiter: ''
precision: 3
significant: true
strip_insignificant_zeros: true
storage_units:
format: "%n%u"
units:
byte: 바이트
gb: 기가바이트
kb: 킬로바이트
mb: 메가바이트
tb: 테라바이트
percentage:
format:
delimiter: ''
format: "%n%"
precision:
format:
delimiter: ''
support:
array:
last_word_connector: ", "
two_words_connector: '와(과) '
words_connector: ", "
time:
am: 오전
formats:
default: "%Y/%m/%d %H:%M:%S"
long: "%Y년 %m월 %d일, %H시 %M분 %S초 %Z"
short: "%y/%m/%d %H:%M"
pm: 오후
| {
"pile_set_name": "Github"
} |
PKG=QUAGGAlibs
NAME="@PACKAGE_NAME@ - @PACKAGE_NAME@ common runtime libraries"
| {
"pile_set_name": "Github"
} |
# Event 4099 - task_0
###### Version: 1
## Description
None
## Data Dictionary
|Standard Name|Field Name|Type|Description|Sample Value|
|---|---|---|---|---|
|TBD|RawCommandLine|UnicodeString|None|`None`|
|TBD|ShowUsage|Boolean|None|`None`|
|TBD|DisplayDriveInfo|Boolean|None|`None`|
|TBD|TargetDriveLetter|UnicodeString|None|`None`|
|TBD|TargetAction|UInt32|None|`None`|
|TBD|NewSystemDriveLetter|UnicodeString|None|`None`|
|TBD|ShrinkSize|Int64|None|`None`|
|TBD|QuietMode|Boolean|None|`None`|
|TBD|AutoRestart|Boolean|None|`None`|
## Tags
* etw_level_Informational
* etw_opcode_Initialization
* etw_task_task_0 | {
"pile_set_name": "Github"
} |
南星良最新番号
【VND-191】アダルト祭り3
【VND-181】アダルト祭り2
【VNDS-3033】黒百合学園
【TT-545】desire 大乱交
【TT-523】Fourth5 麻川なな 鈴奈ひろみ 加藤由香 工藤エリナ 南星良
【VS-605】放課後の天使たち 10
【MA-308】先生はエロボディSpecial～こんなに濡れているのは君のせい～
【YR-004】レズビアン女学院 2
【YR-002】レズビアン女学院
【TT-231】Pure Friends Vol， 7
【MA-220】I AM SEXY DX MISSION 001→010
【MA-229】THE 女教師 DX
【SP-551】綺麗なお姉さんもアブノーマル
【UM-011】Lesbian オンナで感じる女達
【HE-045】激カラミ～チョ 「お姉さんが上に乗ってしてあげる」
【VS-564】制服堕天使 南星良
【CA-017】Lesson H Vol.4
【TVK-007】生 中出し [南星良]
【HP-055】私立美少女学園VOL.20
【EIB-007】黒人中出し 南星良
【SIH-001】School Love 三月あん＆南星良
【NWY-003】女愛～レズビアン～ 南セイラ 石坂麻希
【TRL-006】W中出し 南星良 石坂麻希</a>2001-07-29トリプル ワン$$$TRIPLE I45分钟 | {
"pile_set_name": "Github"
} |
/*
* AppArmor security module
*
* This file contains AppArmor resource mediation and attachment
*
* Copyright (C) 1998-2008 Novell/SUSE
* Copyright 2009-2010 Canonical Ltd.
*
* 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, version 2 of the
* License.
*/
#include <linux/audit.h>
#include "include/audit.h"
#include "include/context.h"
#include "include/resource.h"
#include "include/policy.h"
/*
* Table of rlimit names: we generate it from resource.h.
*/
#include "rlim_names.h"
struct aa_fs_entry aa_fs_entry_rlimit[] = {
AA_FS_FILE_STRING("mask", AA_FS_RLIMIT_MASK),
{ }
};
/* audit callback for resource specific fields */
static void audit_cb(struct audit_buffer *ab, void *va)
{
struct common_audit_data *sa = va;
audit_log_format(ab, " rlimit=%s value=%lu",
rlim_names[sa->aad->rlim.rlim], sa->aad->rlim.max);
}
/**
* audit_resource - audit setting resource limit
* @profile: profile being enforced (NOT NULL)
* @resoure: rlimit being auditing
* @value: value being set
* @error: error value
*
* Returns: 0 or sa->error else other error code on failure
*/
static int audit_resource(struct aa_profile *profile, unsigned int resource,
unsigned long value, int error)
{
struct common_audit_data sa;
struct apparmor_audit_data aad = {0,};
sa.type = LSM_AUDIT_DATA_NONE;
sa.aad = &aad;
aad.op = OP_SETRLIMIT,
aad.rlim.rlim = resource;
aad.rlim.max = value;
aad.error = error;
return aa_audit(AUDIT_APPARMOR_AUTO, profile, GFP_KERNEL, &sa,
audit_cb);
}
/**
* aa_map_resouce - map compiled policy resource to internal #
* @resource: flattened policy resource number
*
* Returns: resource # for the current architecture.
*
* rlimit resource can vary based on architecture, map the compiled policy
* resource # to the internal representation for the architecture.
*/
int aa_map_resource(int resource)
{
return rlim_map[resource];
}
/**
* aa_task_setrlimit - test permission to set an rlimit
* @profile - profile confining the task (NOT NULL)
* @task - task the resource is being set on
* @resource - the resource being set
* @new_rlim - the new resource limit (NOT NULL)
*
* Control raising the processes hard limit.
*
* Returns: 0 or error code if setting resource failed
*/
int aa_task_setrlimit(struct aa_profile *profile, struct task_struct *task,
unsigned int resource, struct rlimit *new_rlim)
{
struct aa_profile *task_profile;
int error = 0;
rcu_read_lock();
task_profile = aa_get_profile(aa_cred_profile(__task_cred(task)));
rcu_read_unlock();
/* TODO: extend resource control to handle other (non current)
* profiles. AppArmor rules currently have the implicit assumption
* that the task is setting the resource of a task confined with
* the same profile.
*/
if (profile != task_profile ||
(profile->rlimits.mask & (1 << resource) &&
new_rlim->rlim_max > profile->rlimits.limits[resource].rlim_max))
error = -EACCES;
aa_put_profile(task_profile);
return audit_resource(profile, resource, new_rlim->rlim_max, error);
}
/**
* __aa_transition_rlimits - apply new profile rlimits
* @old: old profile on task (NOT NULL)
* @new: new profile with rlimits to apply (NOT NULL)
*/
void __aa_transition_rlimits(struct aa_profile *old, struct aa_profile *new)
{
unsigned int mask = 0;
struct rlimit *rlim, *initrlim;
int i;
/* for any rlimits the profile controlled reset the soft limit
* to the less of the tasks hard limit and the init tasks soft limit
*/
if (old->rlimits.mask) {
for (i = 0, mask = 1; i < RLIM_NLIMITS; i++, mask <<= 1) {
if (old->rlimits.mask & mask) {
rlim = current->signal->rlim + i;
initrlim = init_task.signal->rlim + i;
rlim->rlim_cur = min(rlim->rlim_max,
initrlim->rlim_cur);
}
}
}
/* set any new hard limits as dictated by the new profile */
if (!new->rlimits.mask)
return;
for (i = 0, mask = 1; i < RLIM_NLIMITS; i++, mask <<= 1) {
if (!(new->rlimits.mask & mask))
continue;
rlim = current->signal->rlim + i;
rlim->rlim_max = min(rlim->rlim_max,
new->rlimits.limits[i].rlim_max);
/* soft limit should not exceed hard limit */
rlim->rlim_cur = min(rlim->rlim_cur, rlim->rlim_max);
}
}
| {
"pile_set_name": "Github"
} |
{
"name": "angular-animate",
"version": "",
"description": "AngularJS module for animations",
"main": "angular-animate.js",
"scripts": {
"test": "echo \"Error: no test specified\" && exit 1"
},
"repository": {
"type": "git",
"url": "https://github.com/angular/angular.js.git"
},
"keywords": [
"angular",
"framework",
"browser",
"animation",
"client-side"
],
"author": "Angular Core Team <[email protected]>",
"license": "MIT",
"bugs": {
"url": "https://github.com/angular/angular.js/issues"
},
"homepage": "http://angularjs.org"
}
| {
"pile_set_name": "Github"
} |
1 _CDefFolderMenu_MergeMenu@16
2 _CIDLData_CreateFromIDArray@16
3 _ConnectToConnectionPoint@24
4 DllCanUnloadNow
5 DllGetClassObject
6 DllRegisterServer
7 DllUnregisterServer
8 _GUIDFromStringW@8
9 _GetUIVersion@0
10 _IUnknown_AtomicRelease@4
11 _IUnknown_GetWindow@8
12 _IUnknown_QueryService@16
13 _IUnknown_Set@8
14 _IUnknown_SetSite@8
15 _IsOS@4
16 _ParseURLW@8
17 _SHUnicodeToAnsi@12
18 _SHCoCreateInstanceAC@20
19 _SHFormatDateTimeW@16
20 _SHGetMenuFromID@8
21 _SHGetObjectCompatFlags@8
22 _SHInvokeCommandOnContextMenu@20
23 _SHInvokeCommandsOnContextMenu@24
24 _SHLoadRegUIStringW@16
25 _SHStringFromGUIDW@12
26 _SHUnicodeToAnsi@12
| {
"pile_set_name": "Github"
} |
//--------------------------------------------------------------
//
// Microsoft Edge Implementation
// Copyright(c) Microsoft Corporation
// All rights reserved.
//
// MIT License
//
// 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.
//
//--------------------------------------------------------------
#include "PreComp.hxx"
#include "IterationStatementNode.hxx"
#include "IStringStream.hxx"
#include "GLSLParser.hxx"
#include "CompoundStatementNode.hxx"
MtDefine(IterationStatementNode, CGLSLParser, "IterationStatementNode");
//+----------------------------------------------------------------------------
//
// Function: Constructor
//
//-----------------------------------------------------------------------------
IterationStatementNode::IterationStatementNode()
{
}
//+----------------------------------------------------------------------------
//
// Function: Initialize
//
//-----------------------------------------------------------------------------
HRESULT IterationStatementNode::Initialize(
__in CGLSLParser* pParser, // The parser that owns the tree
__in ParseTreeNode* pChild // The statement or compound statement
)
{
CHK_START;
ParseTreeNode::Initialize(pParser);
if (pChild->GetParseNodeType() == ParseNodeType::compoundStatement)
{
CHK(AppendChild(pChild));
}
else
{
// If the child of this scope is not a compound_statement_with_scope, that means there
// is a single simple_statement. In order to generate a consistent parse tree,
// and have valid insertion points for moving statements, we'll place the
// simple_statement in a statement list and wrap that in a compound_statement_with_scope (i.e. fDefinesScope == true)
// and append the compound_statement_with_scope as the child.
TSmartPointer<CompoundStatementNode> spCompoundStatement;
CHK(pParser->WrapSimpleStatementAsCompoundStatement(pChild, /*fDefinesScope*/true, &spCompoundStatement));
CHK(AppendChild(spCompoundStatement));
}
CHK_RETURN;
}
//+----------------------------------------------------------------------------
//
// Function: OutputHLSL
//
// Synopsis: Output HLSL for this node of the tree
//
//-----------------------------------------------------------------------------
HRESULT IterationStatementNode::OutputHLSL(__in IStringStream* pOutput)
{
Assert(GetChild(0)->GetParseNodeType() == ParseNodeType::compoundStatement);
return GetChild(0)->OutputHLSL(pOutput);
}
//+----------------------------------------------------------------------------
//
// Function: GetDumpString
//
//-----------------------------------------------------------------------------
HRESULT IterationStatementNode::GetDumpString(__in IStringStream* pOutput)
{
return pOutput->WriteString("IterationStatementNode");
}
| {
"pile_set_name": "Github"
} |
//[kaspresso](../../index.md)/[com.kaspersky.kaspresso.systemsafety](../index.md)/[SystemDialogSafetyProviderImpl](index.md)/[SystemDialogSafetyProviderImpl](-system-dialog-safety-provider-impl.md)
# SystemDialogSafetyProviderImpl
[androidJvm]
Content
fun [SystemDialogSafetyProviderImpl](-system-dialog-safety-provider-impl.md)(logger: [UiTestLogger](../../com.kaspersky.kaspresso.logger/-ui-test-logger/index.md), uiDevice: UiDevice, adbServer: [AdbServer](../../com.kaspersky.kaspresso.device.server/-adb-server/index.md))
| {
"pile_set_name": "Github"
} |
/*
Copyright The Kubernetes Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
// Code generated by client-gen. DO NOT EDIT.
package v1
type LeaseExpansion interface{}
| {
"pile_set_name": "Github"
} |
ISO-10303-21;
HEADER;
FILE_DESCRIPTION(('ViewDefinition [DesignTransferView_V1.0]'),'2;1');
FILE_NAME('253-KTB','2018-05-23T16:27:29',(''),(''),'The EXPRESS Data Manager Version 5.02.0100.07 : 28 Aug 2013','20180423_1000(x64) - Exporter 18.3.1.0 - Alternate UI 18.3.1.0',$);
FILE_SCHEMA(('IFC4'));
ENDSEC;
DATA;
#1=IFCADVANCEDBREP(#2);
#2=IFCCLOSEDSHELL((#3,#84,#137,#178,#197,#220,#247,#264,#301,#308,#323,#340,#348,#374,#386,#412,#425,#450,#463,#488,#501,#518));
#3=IFCADVANCEDFACE((#4),#70,.T.);
#4=IFCFACEOUTERBOUND(#5,.T.);
#5=IFCEDGELOOP((#6,#16,#54,#62));
#6=IFCORIENTEDEDGE(*,*,#7,.T.);
#7=IFCEDGECURVE(#8,#10,#12,.T.);
#8=IFCVERTEXPOINT(#9);
#9=IFCCARTESIANPOINT((0.316595272235915,0.182482211466965,0.542862042398335));
#10=IFCVERTEXPOINT(#11);
#11=IFCCARTESIANPOINT((0.316595272235915,0.07,0.529050963453976));
#12=IFCTRIMMEDCURVE(#13,(#9),(#11),.T.,.CARTESIAN.);
#13=IFCLINE(#9,#14);
#14=IFCVECTOR(#15,0.3048);
#15=IFCDIRECTION((0.,-0.992546151641322,-0.12186934340515));
#16=IFCORIENTEDEDGE(*,*,#17,.T.);
#17=IFCEDGECURVE(#10,#18,#20,.T.);
#18=IFCVERTEXPOINT(#19);
#19=IFCCARTESIANPOINT((0.286595272235915,0.0700000000000001,0.529050963453976));
#20=IFCBSPLINECURVEWITHKNOTS(3,(#11,#21,#22,#23,#24,#24,#25,#26,#27,#28,#29,#29,#30,#31,#32,#33,#34,#35,#36,#37,#38,#39,#40,#41,#42,#43,#44,#44,#45,#45,#46,#47,#48,#49,#50,#50,#51,#52,#53,#19,#19),.UNSPECIFIED.,.F.,.U.,(4,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,4),(-1.,-0.958333333333333,-0.916666666666667,-0.895833333333333,-0.890625,-0.885416666666667,-0.875,-0.833333333333333,-0.791666666666667,-0.78125,-0.776041666666667,-0.770833333333333,-0.75,-0.708333333333333,-0.666666666666667,-0.638888888888889,-0.611111111111111,-0.555555555555556,-0.444444444444444,-0.388888888888889,-0.361111111111111,-0.333333333333333,-0.305555555555556,-0.277777777777778,-0.25,-0.236111111111111,-0.222222222222222,-0.215277777777778,-0.208333333333333,-0.194444444444444,-0.166666666666667,-0.138888888888889,-0.125,-0.111111111111111,-0.0972222222222222,-0.0833333333333333,-0.0555555555555556,-0.0277777777777778,0.),.UNSPECIFIED.);
#21=IFCCARTESIANPOINT((0.316521852217236,0.0700550650140097,0.528457324008753));
#22=IFCCARTESIANPOINT((0.31630452539325,0.0702170737714835,0.527332402035287));
#23=IFCCARTESIANPOINT((0.315850456251407,0.0705406620680996,0.526082122743539));
#24=IFCCARTESIANPOINT((0.315461454072732,0.0708029150539896,0.525345457335896));
#25=IFCCARTESIANPOINT((0.315126127734685,0.0710220840621777,0.524807064201859));
#26=IFCCARTESIANPOINT((0.314715129687274,0.0712848096494789,0.524240746134006));
#27=IFCCARTESIANPOINT((0.313883417840187,0.0717868843409975,0.523412678290888));
#28=IFCCARTESIANPOINT((0.312907327003451,0.0723014160859226,0.52271059990982));
#29=IFCCARTESIANPOINT((0.312303931109336,0.0725909239326712,0.522317665204249));
#30=IFCCARTESIANPOINT((0.311754547623664,0.0728444082463348,0.521974216670089));
#31=IFCCARTESIANPOINT((0.311010250963143,0.0731691597113861,0.521561314265526));
#32=IFCCARTESIANPOINT((0.309782173602102,0.0736396603026224,0.521024253863646));
#33=IFCCARTESIANPOINT((0.308411282446763,0.0740657082750721,0.520559613050389));
#34=IFCCARTESIANPOINT((0.30718199609552,0.0743760668705563,0.520223079768365));
#35=IFCCARTESIANPOINT((0.305727968034604,0.0746756941974801,0.519914966200879));
#36=IFCCARTESIANPOINT((0.303131497776574,0.0750325530290298,0.519556784431923));
#37=IFCCARTESIANPOINT((0.300074633385071,0.0750333390867344,0.519556388047806));
#38=IFCCARTESIANPOINT((0.29748162719965,0.0746787930130818,0.519911384578543));
#39=IFCCARTESIANPOINT((0.296029954279306,0.0743809583392937,0.520217797900716));
#40=IFCCARTESIANPOINT((0.294975984521503,0.0741158145949859,0.520504936097993));
#41=IFCCARTESIANPOINT((0.293944402668928,0.0738086051963822,0.52084149269837));
#42=IFCCARTESIANPOINT((0.292933073841707,0.0734593232777235,0.521227102148114));
#43=IFCCARTESIANPOINT((0.29212618599739,0.0731416911460694,0.521599620998239));
#44=IFCCARTESIANPOINT((0.291508311499593,0.0728765238032858,0.521932446778546));
#45=IFCCARTESIANPOINT((0.290845483968084,0.0725712595180102,0.522344762139806));
#46=IFCCARTESIANPOINT((0.290040226077197,0.0721736026853909,0.522886359066127));
#47=IFCCARTESIANPOINT((0.289330630612744,0.0717915485384036,0.523424784272433));
#48=IFCCARTESIANPOINT((0.288692866788521,0.0714162820743841,0.524025589091308));
#49=IFCCARTESIANPOINT((0.28824770759088,0.0711397338493399,0.52454911700728));
#50=IFCCARTESIANPOINT((0.287954322173673,0.0709513725045986,0.524965230695859));
#51=IFCCARTESIANPOINT((0.28738450569756,0.07056967404484,0.526015419966478));
#52=IFCCARTESIANPOINT((0.287060623833856,0.0703420934966555,0.526831590747281));
#53=IFCCARTESIANPOINT((0.286771465452221,0.0701316613407143,0.527893234261659));
#54=IFCORIENTEDEDGE(*,*,#55,.T.);
#55=IFCEDGECURVE(#18,#56,#58,.T.);
#56=IFCVERTEXPOINT(#57);
#57=IFCCARTESIANPOINT((0.286595272235915,0.182482211466965,0.542862042398335));
#58=IFCTRIMMEDCURVE(#59,(#19),(#57),.T.,.CARTESIAN.);
#59=IFCLINE(#19,#60);
#60=IFCVECTOR(#61,0.3048);
#61=IFCDIRECTION((0.,0.992546151641322,0.12186934340515));
#62=IFCORIENTEDEDGE(*,*,#63,.T.);
#63=IFCEDGECURVE(#56,#8,#64,.T.);
#64=IFCTRIMMEDCURVE(#65,(#57),(#9),.T.,.CARTESIAN.);
#65=IFCELLIPSE(#66,0.015,0.01);
#66=IFCAXIS2PLACEMENT3D(#67,#68,#69);
#67=IFCCARTESIANPOINT((0.301595272235915,0.182482211466965,0.542862042398335));
#68=IFCDIRECTION((0.,-0.992546151641322,-0.12186934340515));
#69=IFCDIRECTION((-1.,0.,0.));
#70=IFCSURFACEOFLINEAREXTRUSION(#71,#80,#83,0.437917092360513);
#71=IFCARBITRARYCLOSEDPROFILEDEF(.CURVE.,'Ruled Face Profile Curve',#72);
#72=IFCTRIMMEDCURVE(#73,(#78),(#79),.T.,.CARTESIAN.);
#73=IFCTRIMMEDCURVE(#74,(#78),(#79),.T.,.CARTESIAN.);
#74=IFCELLIPSE(#75,0.015,0.01);
#75=IFCAXIS2PLACEMENT3D(#76,#77,#69);
#76=IFCCARTESIANPOINT((0.301595272235915,0.05,0.526595272235917));
#77=IFCDIRECTION((0.,0.992546151641322,0.12186934340515));
#78=IFCCARTESIANPOINT((0.316595272235915,0.05,0.526595272235917));
#79=IFCCARTESIANPOINT((0.286595272235915,0.05,0.526595272235917));
#80=IFCAXIS2PLACEMENT3D(#78,#81,#82);
#81=IFCDIRECTION((0.,0.992546151641322,0.12186934340515));
#82=IFCDIRECTION((1.,0.,0.));
#83=IFCDIRECTION((0.,0.992546151641322,0.12186934340515));
#84=IFCADVANCEDFACE((#85),#127,.T.);
#85=IFCFACEOUTERBOUND(#86,.T.);
#86=IFCEDGELOOP((#87,#88,#120,#121));
#87=IFCORIENTEDEDGE(*,*,#55,.F.);
#88=IFCORIENTEDEDGE(*,*,#89,.T.);
#89=IFCEDGECURVE(#18,#10,#90,.T.);
#90=IFCBSPLINECURVEWITHKNOTS(3,(#19,#91,#92,#93,#94,#94,#95,#96,#97,#98,#99,#100,#101,#102,#103,#104,#105,#106,#107,#108,#109,#110,#111,#112,#113,#114,#115,#115,#116,#117,#118,#119,#11),.UNSPECIFIED.,.F.,.U.,(4,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,4),(-1.,-0.958333333333333,-0.916666666666667,-0.895833333333333,-0.890625,-0.885416666666667,-0.875,-0.833333333333333,-0.791666666666667,-0.78125,-0.770833333333333,-0.75,-0.708333333333333,-0.666666666666667,-0.611111111111111,-0.555555555555556,-0.444444444444444,-0.333333333333333,-0.277777777777778,-0.25,-0.222222222222222,-0.208333333333333,-0.194444444444444,-0.166666666666667,-0.138888888888889,-0.125,-0.111111111111111,-0.0972222222222222,-0.0833333333333333,-0.0555555555555556,0.),.UNSPECIFIED.);
#91=IFCCARTESIANPOINT((0.286668028596971,0.0700545672707921,0.529655488695811));
#92=IFCCARTESIANPOINT((0.286881586403405,0.070213753113007,0.530811233502241));
#93=IFCCARTESIANPOINT((0.287324526739002,0.0705296917956367,0.532122656879478));
#94=IFCCARTESIANPOINT((0.287702876901025,0.0707853768445622,0.532910109382301));
#95=IFCCARTESIANPOINT((0.288028666159123,0.0709990144236782,0.533491682076724));
#96=IFCCARTESIANPOINT((0.288426394474716,0.0712542518509946,0.534110996684791));
#97=IFCCARTESIANPOINT((0.289226112305424,0.0717399218954657,0.53504570669902));
#98=IFCCARTESIANPOINT((0.290170081673014,0.0722433564951803,0.535865338119445));
#99=IFCCARTESIANPOINT((0.290813073492316,0.0725562854511111,0.536368464264079));
#100=IFCCARTESIANPOINT((0.291242761815077,0.0727579789270004,0.536692573303316));
#101=IFCCARTESIANPOINT((0.292034266152329,0.0731091520651208,0.537226568887803));
#102=IFCCARTESIANPOINT((0.293254426636402,0.073585635568659,0.537897421493528));
#103=IFCCARTESIANPOINT((0.294968455285206,0.0741313166857469,0.53863153468523));
#104=IFCCARTESIANPOINT((0.296972640126648,0.0746041201344578,0.539244537080922));
#105=IFCCARTESIANPOINT((0.300022076417073,0.0750353555786552,0.539784971413685));
#106=IFCCARTESIANPOINT((0.303978757144088,0.0750347344612737,0.539784774867092));
#107=IFCCARTESIANPOINT((0.307742052346622,0.0743094141515763,0.538873671856753));
#108=IFCCARTESIANPOINT((0.310120657650939,0.0735195222745718,0.537808778553985));
#109=IFCCARTESIANPOINT((0.311399026093511,0.0730048626449077,0.537072036964469));
#110=IFCCARTESIANPOINT((0.312138394058348,0.0726719340125181,0.536556734425043));
#111=IFCCARTESIANPOINT((0.312705469646576,0.0723972841815405,0.536112775361865));
#112=IFCCARTESIANPOINT((0.313270434430873,0.0721103177161341,0.535649201215258));
#113=IFCCARTESIANPOINT((0.313948650561523,0.0717407733500829,0.535030203860004));
#114=IFCCARTESIANPOINT((0.314556841664557,0.0713802715484245,0.534354333596486));
#115=IFCCARTESIANPOINT((0.314982718474224,0.0711144162315146,0.533776926379395));
#116=IFCCARTESIANPOINT((0.315515298527032,0.0707668039669911,0.532853420070985));
#117=IFCCARTESIANPOINT((0.315817695069162,0.070561543582909,0.532201567861037));
#118=IFCCARTESIANPOINT((0.316259759717883,0.0702506304955074,0.530997855284527));
#119=IFCCARTESIANPOINT((0.316497088014751,0.0700736381658729,0.529858447687759));
#120=IFCORIENTEDEDGE(*,*,#7,.F.);
#121=IFCORIENTEDEDGE(*,*,#122,.T.);
#122=IFCEDGECURVE(#8,#56,#123,.T.);
#123=IFCTRIMMEDCURVE(#124,(#9),(#57),.T.,.CARTESIAN.);
#124=IFCELLIPSE(#125,0.015,0.01);
#125=IFCAXIS2PLACEMENT3D(#67,#126,#69);
#126=IFCDIRECTION((0.,-0.992546151641322,-0.12186934340515));
#127=IFCSURFACEOFLINEAREXTRUSION(#128,#134,#136,0.437917092360514);
#128=IFCARBITRARYCLOSEDPROFILEDEF(.CURVE.,'Ruled Face Profile Curve',#129);
#129=IFCTRIMMEDCURVE(#130,(#79),(#78),.T.,.CARTESIAN.);
#130=IFCTRIMMEDCURVE(#131,(#79),(#78),.T.,.CARTESIAN.);
#131=IFCELLIPSE(#132,0.015,0.01);
#132=IFCAXIS2PLACEMENT3D(#76,#133,#69);
#133=IFCDIRECTION((0.,0.992546151641322,0.12186934340515));
#134=IFCAXIS2PLACEMENT3D(#79,#135,#82);
#135=IFCDIRECTION((0.,0.992546151641322,0.12186934340515));
#136=IFCDIRECTION((0.,0.992546151641322,0.12186934340515));
#137=IFCADVANCEDFACE((#138),#166,.T.);
#138=IFCFACEOUTERBOUND(#139,.T.);
#139=IFCEDGELOOP((#140,#149,#158,#165));
#140=IFCORIENTEDEDGE(*,*,#141,.T.);
#141=IFCEDGECURVE(#56,#142,#144,.T.);
#142=IFCVERTEXPOINT(#143);
#143=IFCCARTESIANPOINT((0.286595272235915,0.21153917568445,0.534254977474486));
#144=IFCTRIMMEDCURVE(#145,(#57),(#143),.T.,.CARTESIAN.);
#145=IFCCIRCLE(#146,0.0380000000000002);
#146=IFCAXIS2PLACEMENT3D(#147,#69,#148);
#147=IFCCARTESIANPOINT((0.286595272235915,0.187113246516361,0.505145288635964));
#148=IFCDIRECTION((0.,-0.121869343405151,0.992546151641322));
#149=IFCORIENTEDEDGE(*,*,#150,.T.);
#150=IFCEDGECURVE(#142,#151,#153,.T.);
#151=IFCVERTEXPOINT(#152);
#152=IFCCARTESIANPOINT((0.316595272235915,0.21153917568445,0.534254977474486));
#153=IFCTRIMMEDCURVE(#154,(#143),(#152),.T.,.CARTESIAN.);
#154=IFCELLIPSE(#155,0.015,0.01);
#155=IFCAXIS2PLACEMENT3D(#156,#157,#69);
#156=IFCCARTESIANPOINT((0.301595272235915,0.21153917568445,0.534254977474486));
#157=IFCDIRECTION((0.,-0.766044443118978,0.642787609686539));
#158=IFCORIENTEDEDGE(*,*,#159,.T.);
#159=IFCEDGECURVE(#151,#8,#160,.T.);
#160=IFCTRIMMEDCURVE(#161,(#152),(#9),.T.,.CARTESIAN.);
#161=IFCCIRCLE(#162,0.0380000000000004);
#162=IFCAXIS2PLACEMENT3D(#163,#82,#164);
#163=IFCCARTESIANPOINT((0.316595272235915,0.187113246516361,0.505145288635964));
#164=IFCDIRECTION((0.,-0.121869343405151,0.992546151641322));
#165=IFCORIENTEDEDGE(*,*,#63,.F.);
#166=IFCSURFACEOFREVOLUTION(#167,$,#176);
#167=IFCARBITRARYCLOSEDPROFILEDEF(.CURVE.,'Revolved Face Profile Curve',#168);
#168=IFCTRIMMEDCURVE(#169,(#174),(#175),.T.,.CARTESIAN.);
#169=IFCTRIMMEDCURVE(#170,(#174),(#175),.T.,.CARTESIAN.);
#170=IFCELLIPSE(#171,0.015,0.01);
#171=IFCAXIS2PLACEMENT3D(#172,#173,#69);
#172=IFCCARTESIANPOINT((0.301595272235915,0.225113246516361,0.505145288635965));
#173=IFCDIRECTION((0.,0.,-1.));
#174=IFCCARTESIANPOINT((0.316595272235915,0.225113246516361,0.505145288635965));
#175=IFCCARTESIANPOINT((0.286595272235915,0.225113246516361,0.505145288635965));
#176=IFCAXIS1PLACEMENT(#177,#82);
#177=IFCCARTESIANPOINT((0.301595272235915,0.187113246516361,0.505145288635964));
#178=IFCADVANCEDFACE((#179),#190,.T.);
#179=IFCFACEOUTERBOUND(#180,.T.);
#180=IFCEDGELOOP((#181,#182,#188,#189));
#181=IFCORIENTEDEDGE(*,*,#159,.F.);
#182=IFCORIENTEDEDGE(*,*,#183,.T.);
#183=IFCEDGECURVE(#151,#142,#184,.T.);
#184=IFCTRIMMEDCURVE(#185,(#152),(#143),.T.,.CARTESIAN.);
#185=IFCELLIPSE(#186,0.015,0.01);
#186=IFCAXIS2PLACEMENT3D(#156,#187,#69);
#187=IFCDIRECTION((0.,-0.766044443118978,0.642787609686539));
#188=IFCORIENTEDEDGE(*,*,#141,.F.);
#189=IFCORIENTEDEDGE(*,*,#122,.F.);
#190=IFCSURFACEOFREVOLUTION(#191,$,#196);
#191=IFCARBITRARYCLOSEDPROFILEDEF(.CURVE.,'Revolved Face Profile Curve',#192);
#192=IFCTRIMMEDCURVE(#193,(#175),(#174),.T.,.CARTESIAN.);
#193=IFCTRIMMEDCURVE(#194,(#175),(#174),.T.,.CARTESIAN.);
#194=IFCELLIPSE(#195,0.015,0.01);
#195=IFCAXIS2PLACEMENT3D(#172,#173,#69);
#196=IFCAXIS1PLACEMENT(#177,#82);
#197=IFCADVANCEDFACE((#198),#217,.T.);
#198=IFCFACEOUTERBOUND(#199,.T.);
#199=IFCEDGELOOP((#200,#211));
#200=IFCORIENTEDEDGE(*,*,#201,.T.);
#201=IFCEDGECURVE(#202,#204,#206,.T.);
#202=IFCVERTEXPOINT(#203);
#203=IFCCARTESIANPOINT((0.316595272235915,0.214202811608578,0.532019921552959));
#204=IFCVERTEXPOINT(#205);
#205=IFCCARTESIANPOINT((0.286595272235915,0.214202811608578,0.532019921552959));
#206=IFCTRIMMEDCURVE(#207,(#203),(#205),.T.,.CARTESIAN.);
#207=IFCELLIPSE(#208,0.015,0.01);
#208=IFCAXIS2PLACEMENT3D(#209,#210,#69);
#209=IFCCARTESIANPOINT((0.301595272235915,0.214202811608578,0.532019921552959));
#210=IFCDIRECTION((0.,0.766044443118978,-0.642787609686539));
#211=IFCORIENTEDEDGE(*,*,#212,.T.);
#212=IFCEDGECURVE(#204,#202,#213,.T.);
#213=IFCTRIMMEDCURVE(#214,(#205),(#203),.T.,.CARTESIAN.);
#214=IFCELLIPSE(#215,0.015,0.01);
#215=IFCAXIS2PLACEMENT3D(#209,#216,#69);
#216=IFCDIRECTION((0.,0.766044443118978,-0.642787609686539));
#217=IFCPLANE(#218);
#218=IFCAXIS2PLACEMENT3D(#209,#219,#82);
#219=IFCDIRECTION((0.,0.766044443118978,-0.642787609686539));
#220=IFCADVANCEDFACE((#221),#237,.T.);
#221=IFCFACEOUTERBOUND(#222,.T.);
#222=IFCEDGELOOP((#223,#229,#230,#236));
#223=IFCORIENTEDEDGE(*,*,#224,.T.);
#224=IFCEDGECURVE(#142,#204,#225,.T.);
#225=IFCTRIMMEDCURVE(#226,(#143),(#205),.T.,.CARTESIAN.);
#226=IFCLINE(#143,#227);
#227=IFCVECTOR(#228,0.3048);
#228=IFCDIRECTION((0.,0.766044443118982,-0.642787609686535));
#229=IFCORIENTEDEDGE(*,*,#201,.F.);
#230=IFCORIENTEDEDGE(*,*,#231,.T.);
#231=IFCEDGECURVE(#202,#151,#232,.T.);
#232=IFCTRIMMEDCURVE(#233,(#203),(#152),.T.,.CARTESIAN.);
#233=IFCLINE(#203,#234);
#234=IFCVECTOR(#235,0.3048);
#235=IFCDIRECTION((0.,-0.766044443118982,0.642787609686535));
#236=IFCORIENTEDEDGE(*,*,#150,.F.);
#237=IFCSURFACEOFLINEAREXTRUSION(#238,#244,#246,0.0114079060088073);
#238=IFCARBITRARYCLOSEDPROFILEDEF(.CURVE.,'Ruled Face Profile Curve',#239);
#239=IFCTRIMMEDCURVE(#240,(#152),(#143),.T.,.CARTESIAN.);
#240=IFCTRIMMEDCURVE(#241,(#152),(#143),.T.,.CARTESIAN.);
#241=IFCELLIPSE(#242,0.015,0.01);
#242=IFCAXIS2PLACEMENT3D(#156,#243,#69);
#243=IFCDIRECTION((0.,0.766044443118978,-0.642787609686539));
#244=IFCAXIS2PLACEMENT3D(#152,#245,#82);
#245=IFCDIRECTION((0.,0.766044443118982,-0.642787609686535));
#246=IFCDIRECTION((0.,0.766044443118982,-0.642787609686535));
#247=IFCADVANCEDFACE((#248),#254,.T.);
#248=IFCFACEOUTERBOUND(#249,.T.);
#249=IFCEDGELOOP((#250,#251,#252,#253));
#250=IFCORIENTEDEDGE(*,*,#231,.F.);
#251=IFCORIENTEDEDGE(*,*,#212,.F.);
#252=IFCORIENTEDEDGE(*,*,#224,.F.);
#253=IFCORIENTEDEDGE(*,*,#183,.F.);
#254=IFCSURFACEOFLINEAREXTRUSION(#255,#261,#263,0.0114079060088073);
#255=IFCARBITRARYCLOSEDPROFILEDEF(.CURVE.,'Ruled Face Profile Curve',#256);
#256=IFCTRIMMEDCURVE(#257,(#143),(#152),.T.,.CARTESIAN.);
#257=IFCTRIMMEDCURVE(#258,(#143),(#152),.T.,.CARTESIAN.);
#258=IFCELLIPSE(#259,0.015,0.01);
#259=IFCAXIS2PLACEMENT3D(#156,#260,#69);
#260=IFCDIRECTION((0.,0.766044443118978,-0.642787609686539));
#261=IFCAXIS2PLACEMENT3D(#143,#262,#82);
#262=IFCDIRECTION((0.,0.766044443118982,-0.642787609686535));
#263=IFCDIRECTION((0.,0.766044443118982,-0.642787609686535));
#264=IFCADVANCEDFACE((#265),#298,.T.);
#265=IFCFACEOUTERBOUND(#266,.T.);
#266=IFCEDGELOOP((#267,#277,#285,#292));
#267=IFCORIENTEDEDGE(*,*,#268,.T.);
#268=IFCEDGECURVE(#269,#271,#273,.T.);
#269=IFCVERTEXPOINT(#270);
#270=IFCCARTESIANPOINT((0.326595272235915,0.0499999999999999,0.451595272235917));
#271=IFCVERTEXPOINT(#272);
#272=IFCCARTESIANPOINT((0.326595272235915,0.0499999999999999,0.559595272235917));
#273=IFCTRIMMEDCURVE(#274,(#270),(#272),.T.,.CARTESIAN.);
#274=IFCLINE(#270,#275);
#275=IFCVECTOR(#276,0.3048);
#276=IFCDIRECTION((0.,0.,1.));
#277=IFCORIENTEDEDGE(*,*,#278,.T.);
#278=IFCEDGECURVE(#271,#279,#281,.T.);
#279=IFCVERTEXPOINT(#280);
#280=IFCCARTESIANPOINT((0.276595272235915,0.0499999999999998,0.559595272235917));
#281=IFCTRIMMEDCURVE(#282,(#272),(#280),.T.,.CARTESIAN.);
#282=IFCCIRCLE(#283,0.025);
#283=IFCAXIS2PLACEMENT3D(#284,#173,#69);
#284=IFCCARTESIANPOINT((0.301595272235915,0.05,0.559595272235917));
#285=IFCORIENTEDEDGE(*,*,#286,.T.);
#286=IFCEDGECURVE(#279,#287,#289,.T.);
#287=IFCVERTEXPOINT(#288);
#288=IFCCARTESIANPOINT((0.276595272235915,0.05,0.451595272235917));
#289=IFCTRIMMEDCURVE(#290,(#280),(#288),.T.,.CARTESIAN.);
#290=IFCLINE(#280,#291);
#291=IFCVECTOR(#173,0.3048);
#292=IFCORIENTEDEDGE(*,*,#293,.T.);
#293=IFCEDGECURVE(#287,#269,#294,.T.);
#294=IFCTRIMMEDCURVE(#295,(#288),(#270),.T.,.CARTESIAN.);
#295=IFCCIRCLE(#296,0.025);
#296=IFCAXIS2PLACEMENT3D(#297,#276,#69);
#297=IFCCARTESIANPOINT((0.301595272235915,0.05,0.451595272235917));
#298=IFCCYLINDRICALSURFACE(#299,0.025);
#299=IFCAXIS2PLACEMENT3D(#300,#173,#69);
#300=IFCCARTESIANPOINT((0.301595272235915,0.05,0.436595272235917));
#301=IFCADVANCEDFACE((#302),#306,.T.);
#302=IFCFACEOUTERBOUND(#303,.T.);
#303=IFCEDGELOOP((#304,#305));
#304=IFCORIENTEDEDGE(*,*,#89,.F.);
#305=IFCORIENTEDEDGE(*,*,#17,.F.);
#306=IFCCYLINDRICALSURFACE(#307,0.025);
#307=IFCAXIS2PLACEMENT3D(#300,#173,#69);
#308=IFCADVANCEDFACE((#309),#306,.T.);
#309=IFCFACEBOUND(#310,.F.);
#310=IFCEDGELOOP((#311,#316,#317,#322));
#311=IFCORIENTEDEDGE(*,*,#312,.T.);
#312=IFCEDGECURVE(#279,#271,#313,.T.);
#313=IFCTRIMMEDCURVE(#314,(#280),(#272),.T.,.CARTESIAN.);
#314=IFCCIRCLE(#315,0.025);
#315=IFCAXIS2PLACEMENT3D(#284,#173,#69);
#316=IFCORIENTEDEDGE(*,*,#268,.F.);
#317=IFCORIENTEDEDGE(*,*,#318,.T.);
#318=IFCEDGECURVE(#269,#287,#319,.T.);
#319=IFCTRIMMEDCURVE(#320,(#270),(#288),.T.,.CARTESIAN.);
#320=IFCCIRCLE(#321,0.025);
#321=IFCAXIS2PLACEMENT3D(#297,#276,#69);
#322=IFCORIENTEDEDGE(*,*,#286,.F.);
#323=IFCADVANCEDFACE((#324),#338,.T.);
#324=IFCFACEOUTERBOUND(#325,.T.);
#325=IFCEDGELOOP((#326,#332,#337));
#326=IFCORIENTEDEDGE(*,*,#327,.T.);
#327=IFCEDGECURVE(#287,#328,#329,.T.);
#328=IFCVERTEXPOINT(#297);
#329=IFCTRIMMEDCURVE(#330,(#288),(#297),.T.,.CARTESIAN.);
#330=IFCLINE(#288,#331);
#331=IFCVECTOR(#82,0.3048);
#332=IFCORIENTEDEDGE(*,*,#333,.T.);
#333=IFCEDGECURVE(#328,#269,#334,.T.);
#334=IFCTRIMMEDCURVE(#335,(#297),(#270),.T.,.CARTESIAN.);
#335=IFCLINE(#297,#336);
#336=IFCVECTOR(#82,0.3048);
#337=IFCORIENTEDEDGE(*,*,#293,.F.);
#338=IFCPLANE(#339);
#339=IFCAXIS2PLACEMENT3D(#297,#173,#69);
#340=IFCADVANCEDFACE((#341),#346,.T.);
#341=IFCFACEOUTERBOUND(#342,.T.);
#342=IFCEDGELOOP((#343,#344,#345));
#343=IFCORIENTEDEDGE(*,*,#333,.F.);
#344=IFCORIENTEDEDGE(*,*,#327,.F.);
#345=IFCORIENTEDEDGE(*,*,#318,.F.);
#346=IFCPLANE(#347);
#347=IFCAXIS2PLACEMENT3D(#297,#173,#69);
#348=IFCADVANCEDFACE((#349),#372,.T.);
#349=IFCFACEOUTERBOUND(#350,.T.);
#350=IFCEDGELOOP((#351,#360,#367));
#351=IFCORIENTEDEDGE(*,*,#352,.T.);
#352=IFCEDGECURVE(#353,#355,#357,.T.);
#353=IFCVERTEXPOINT(#354);
#354=IFCCARTESIANPOINT((0.326595272235915,0.0499999999999999,0.592595272235917));
#355=IFCVERTEXPOINT(#356);
#356=IFCCARTESIANPOINT((0.301595272235915,0.05,0.592595272235917));
#357=IFCTRIMMEDCURVE(#358,(#354),(#356),.T.,.CARTESIAN.);
#358=IFCLINE(#354,#359);
#359=IFCVECTOR(#69,0.3048);
#360=IFCORIENTEDEDGE(*,*,#361,.T.);
#361=IFCEDGECURVE(#355,#362,#364,.T.);
#362=IFCVERTEXPOINT(#363);
#363=IFCCARTESIANPOINT((0.276595272235915,0.05,0.592595272235917));
#364=IFCTRIMMEDCURVE(#365,(#356),(#363),.T.,.CARTESIAN.);
#365=IFCLINE(#356,#366);
#366=IFCVECTOR(#69,0.3048);
#367=IFCORIENTEDEDGE(*,*,#368,.T.);
#368=IFCEDGECURVE(#362,#353,#369,.T.);
#369=IFCTRIMMEDCURVE(#370,(#363),(#354),.T.,.CARTESIAN.);
#370=IFCCIRCLE(#371,0.0249999999999999);
#371=IFCAXIS2PLACEMENT3D(#356,#276,#69);
#372=IFCPLANE(#373);
#373=IFCAXIS2PLACEMENT3D(#356,#276,#69);
#374=IFCADVANCEDFACE((#375),#384,.T.);
#375=IFCFACEOUTERBOUND(#376,.T.);
#376=IFCEDGELOOP((#377,#378,#383));
#377=IFCORIENTEDEDGE(*,*,#352,.F.);
#378=IFCORIENTEDEDGE(*,*,#379,.T.);
#379=IFCEDGECURVE(#353,#362,#380,.T.);
#380=IFCTRIMMEDCURVE(#381,(#354),(#363),.T.,.CARTESIAN.);
#381=IFCCIRCLE(#382,0.0249999999999999);
#382=IFCAXIS2PLACEMENT3D(#356,#276,#69);
#383=IFCORIENTEDEDGE(*,*,#361,.F.);
#384=IFCPLANE(#385);
#385=IFCAXIS2PLACEMENT3D(#356,#276,#69);
#386=IFCADVANCEDFACE((#387),#410,.T.);
#387=IFCFACEOUTERBOUND(#388,.T.);
#388=IFCEDGELOOP((#389,#396,#404,#409));
#389=IFCORIENTEDEDGE(*,*,#390,.T.);
#390=IFCEDGECURVE(#362,#391,#393,.T.);
#391=IFCVERTEXPOINT(#392);
#392=IFCCARTESIANPOINT((0.276595272235915,0.05,0.562595272235917));
#393=IFCTRIMMEDCURVE(#394,(#363),(#392),.T.,.CARTESIAN.);
#394=IFCLINE(#363,#395);
#395=IFCVECTOR(#173,0.3048);
#396=IFCORIENTEDEDGE(*,*,#397,.T.);
#397=IFCEDGECURVE(#391,#398,#400,.T.);
#398=IFCVERTEXPOINT(#399);
#399=IFCCARTESIANPOINT((0.326595272235915,0.0499999999999999,0.562595272235917));
#400=IFCTRIMMEDCURVE(#401,(#392),(#399),.T.,.CARTESIAN.);
#401=IFCCIRCLE(#402,0.0249999999999999);
#402=IFCAXIS2PLACEMENT3D(#403,#276,#69);
#403=IFCCARTESIANPOINT((0.301595272235915,0.05,0.562595272235917));
#404=IFCORIENTEDEDGE(*,*,#405,.T.);
#405=IFCEDGECURVE(#398,#353,#406,.T.);
#406=IFCTRIMMEDCURVE(#407,(#399),(#354),.T.,.CARTESIAN.);
#407=IFCLINE(#399,#408);
#408=IFCVECTOR(#276,0.3048);
#409=IFCORIENTEDEDGE(*,*,#368,.F.);
#410=IFCCYLINDRICALSURFACE(#411,0.0249999999999999);
#411=IFCAXIS2PLACEMENT3D(#300,#173,#69);
#412=IFCADVANCEDFACE((#413),#423,.T.);
#413=IFCFACEOUTERBOUND(#414,.T.);
#414=IFCEDGELOOP((#415,#416,#421,#422));
#415=IFCORIENTEDEDGE(*,*,#405,.F.);
#416=IFCORIENTEDEDGE(*,*,#417,.T.);
#417=IFCEDGECURVE(#398,#391,#418,.T.);
#418=IFCTRIMMEDCURVE(#419,(#399),(#392),.T.,.CARTESIAN.);
#419=IFCCIRCLE(#420,0.0249999999999999);
#420=IFCAXIS2PLACEMENT3D(#403,#276,#69);
#421=IFCORIENTEDEDGE(*,*,#390,.F.);
#422=IFCORIENTEDEDGE(*,*,#379,.F.);
#423=IFCCYLINDRICALSURFACE(#424,0.0249999999999999);
#424=IFCAXIS2PLACEMENT3D(#300,#173,#69);
#425=IFCADVANCEDFACE((#426),#448,.T.);
#426=IFCFACEOUTERBOUND(#427,.T.);
#427=IFCEDGELOOP((#428,#435,#442,#447));
#428=IFCORIENTEDEDGE(*,*,#429,.T.);
#429=IFCEDGECURVE(#391,#430,#432,.T.);
#430=IFCVERTEXPOINT(#431);
#431=IFCCARTESIANPOINT((0.278595272235915,0.05,0.562595272235917));
#432=IFCTRIMMEDCURVE(#433,(#392),(#431),.T.,.CARTESIAN.);
#433=IFCLINE(#392,#434);
#434=IFCVECTOR(#82,0.3048);
#435=IFCORIENTEDEDGE(*,*,#436,.T.);
#436=IFCEDGECURVE(#430,#437,#439,.T.);
#437=IFCVERTEXPOINT(#438);
#438=IFCCARTESIANPOINT((0.324595272235915,0.0499999999999999,0.562595272235917));
#439=IFCTRIMMEDCURVE(#440,(#431),(#438),.T.,.CARTESIAN.);
#440=IFCCIRCLE(#441,0.0230000000000001);
#441=IFCAXIS2PLACEMENT3D(#403,#276,#69);
#442=IFCORIENTEDEDGE(*,*,#443,.T.);
#443=IFCEDGECURVE(#437,#398,#444,.T.);
#444=IFCTRIMMEDCURVE(#445,(#438),(#399),.T.,.CARTESIAN.);
#445=IFCLINE(#438,#446);
#446=IFCVECTOR(#82,0.3048);
#447=IFCORIENTEDEDGE(*,*,#397,.F.);
#448=IFCPLANE(#449);
#449=IFCAXIS2PLACEMENT3D(#403,#173,#69);
#450=IFCADVANCEDFACE((#451),#461,.T.);
#451=IFCFACEOUTERBOUND(#452,.T.);
#452=IFCEDGELOOP((#453,#454,#459,#460));
#453=IFCORIENTEDEDGE(*,*,#443,.F.);
#454=IFCORIENTEDEDGE(*,*,#455,.T.);
#455=IFCEDGECURVE(#437,#430,#456,.T.);
#456=IFCTRIMMEDCURVE(#457,(#438),(#431),.T.,.CARTESIAN.);
#457=IFCCIRCLE(#458,0.0230000000000001);
#458=IFCAXIS2PLACEMENT3D(#403,#276,#69);
#459=IFCORIENTEDEDGE(*,*,#429,.F.);
#460=IFCORIENTEDEDGE(*,*,#417,.F.);
#461=IFCPLANE(#462);
#462=IFCAXIS2PLACEMENT3D(#403,#173,#69);
#463=IFCADVANCEDFACE((#464),#486,.T.);
#464=IFCFACEOUTERBOUND(#465,.T.);
#465=IFCEDGELOOP((#466,#473,#480,#485));
#466=IFCORIENTEDEDGE(*,*,#467,.T.);
#467=IFCEDGECURVE(#430,#468,#470,.T.);
#468=IFCVERTEXPOINT(#469);
#469=IFCCARTESIANPOINT((0.278595272235915,0.05,0.559595272235917));
#470=IFCTRIMMEDCURVE(#471,(#431),(#469),.T.,.CARTESIAN.);
#471=IFCLINE(#431,#472);
#472=IFCVECTOR(#173,0.3048);
#473=IFCORIENTEDEDGE(*,*,#474,.T.);
#474=IFCEDGECURVE(#468,#475,#477,.T.);
#475=IFCVERTEXPOINT(#476);
#476=IFCCARTESIANPOINT((0.324595272235915,0.0499999999999999,0.559595272235917));
#477=IFCTRIMMEDCURVE(#478,(#469),(#476),.T.,.CARTESIAN.);
#478=IFCCIRCLE(#479,0.0230000000000001);
#479=IFCAXIS2PLACEMENT3D(#284,#276,#69);
#480=IFCORIENTEDEDGE(*,*,#481,.T.);
#481=IFCEDGECURVE(#475,#437,#482,.T.);
#482=IFCTRIMMEDCURVE(#483,(#476),(#438),.T.,.CARTESIAN.);
#483=IFCLINE(#476,#484);
#484=IFCVECTOR(#276,0.3048);
#485=IFCORIENTEDEDGE(*,*,#436,.F.);
#486=IFCCYLINDRICALSURFACE(#487,0.0230000000000001);
#487=IFCAXIS2PLACEMENT3D(#300,#173,#69);
#488=IFCADVANCEDFACE((#489),#499,.T.);
#489=IFCFACEOUTERBOUND(#490,.T.);
#490=IFCEDGELOOP((#491,#492,#497,#498));
#491=IFCORIENTEDEDGE(*,*,#481,.F.);
#492=IFCORIENTEDEDGE(*,*,#493,.T.);
#493=IFCEDGECURVE(#475,#468,#494,.T.);
#494=IFCTRIMMEDCURVE(#495,(#476),(#469),.T.,.CARTESIAN.);
#495=IFCCIRCLE(#496,0.0230000000000001);
#496=IFCAXIS2PLACEMENT3D(#284,#276,#69);
#497=IFCORIENTEDEDGE(*,*,#467,.F.);
#498=IFCORIENTEDEDGE(*,*,#455,.F.);
#499=IFCCYLINDRICALSURFACE(#500,0.0230000000000001);
#500=IFCAXIS2PLACEMENT3D(#300,#173,#69);
#501=IFCADVANCEDFACE((#502),#516,.T.);
#502=IFCFACEOUTERBOUND(#503,.T.);
#503=IFCEDGELOOP((#504,#509,#510,#515));
#504=IFCORIENTEDEDGE(*,*,#505,.T.);
#505=IFCEDGECURVE(#271,#475,#506,.T.);
#506=IFCTRIMMEDCURVE(#507,(#272),(#476),.T.,.CARTESIAN.);
#507=IFCLINE(#272,#508);
#508=IFCVECTOR(#69,0.3048);
#509=IFCORIENTEDEDGE(*,*,#474,.F.);
#510=IFCORIENTEDEDGE(*,*,#511,.T.);
#511=IFCEDGECURVE(#468,#279,#512,.T.);
#512=IFCTRIMMEDCURVE(#513,(#469),(#280),.T.,.CARTESIAN.);
#513=IFCLINE(#469,#514);
#514=IFCVECTOR(#69,0.3048);
#515=IFCORIENTEDEDGE(*,*,#278,.F.);
#516=IFCPLANE(#517);
#517=IFCAXIS2PLACEMENT3D(#284,#276,#69);
#518=IFCADVANCEDFACE((#519),#525,.T.);
#519=IFCFACEOUTERBOUND(#520,.T.);
#520=IFCEDGELOOP((#521,#522,#523,#524));
#521=IFCORIENTEDEDGE(*,*,#511,.F.);
#522=IFCORIENTEDEDGE(*,*,#493,.F.);
#523=IFCORIENTEDEDGE(*,*,#505,.F.);
#524=IFCORIENTEDEDGE(*,*,#312,.F.);
#525=IFCPLANE(#526);
#526=IFCAXIS2PLACEMENT3D(#284,#276,#69);
#527=IFCPROJECT('3Mt2bGmnb4DBVQ5CWh8w1l',#539,'253-KTB',$,$,'Neubau Kindertagesst\X\E4tte Tornower Weg 8-10, 13439 Berlin','Vorabzug',(#540),#544);
#528=IFCOWNERHISTORY(#531,#532,$,.ADDED.,1576015757,$,$,0);
#529=IFCPERSON($,'Steve','',$,$,$,$,$);
#530=IFCORGANIZATION($,'Unspecified',$,$,$);
#531=IFCPERSONANDORGANIZATION(#529,#530,$);
#532=IFCAPPLICATION(#530,'Unspecified','Unspecified',$);
#533=IFCOWNERHISTORY(#534,#537,$,.NOCHANGE.,$,$,$,1526998472);
#534=IFCPERSONANDORGANIZATION(#535,#536,$);
#535=IFCPERSON($,$,'gerhard.toellner',$,$,$,$,$);
#536=IFCORGANIZATION($,$,$,$,$);
#537=IFCAPPLICATION(#538,'2018','Autodesk Revit 2018 (DEU)','Revit');
#538=IFCORGANIZATION($,'Autodesk Revit 2018 (DEU)',$,$,$);
#539=IFCOWNERHISTORY(#531,#532,$,.MODIFIED.,1576015757,$,$,0);
#540=IFCGEOMETRICREPRESENTATIONCONTEXT($,'Model',3,1.E-05,#541,#543);
#541=IFCAXIS2PLACEMENT3D(#542,$,$);
#542=IFCCARTESIANPOINT((0.,0.,0.));
#543=IFCDIRECTION((6.12303176911189E-17,1.));
#544=IFCUNITASSIGNMENT((#545,#546,#547,#548,#552,#553,#556,#557,#558,#559,#564,#567,#568,#569,#570,#571,#572,#573,#574,#579,#582,#583,#584));
#545=IFCSIUNIT(*,.LENGTHUNIT.,$,.METRE.);
#546=IFCSIUNIT(*,.AREAUNIT.,$,.SQUARE_METRE.);
#547=IFCSIUNIT(*,.VOLUMEUNIT.,$,.CUBIC_METRE.);
#548=IFCCONVERSIONBASEDUNIT(#549,.PLANEANGLEUNIT.,'DEGREE',#550);
#549=IFCDIMENSIONALEXPONENTS(0,0,0,0,0,0,0);
#550=IFCMEASUREWITHUNIT(IFCRATIOMEASURE(0.0174532925199433),#551);
#551=IFCSIUNIT(*,.PLANEANGLEUNIT.,$,.RADIAN.);
#552=IFCSIUNIT(*,.MASSUNIT.,.KILO.,.GRAM.);
#553=IFCDERIVEDUNIT((#554,#555),.MASSDENSITYUNIT.,$);
#554=IFCDERIVEDUNITELEMENT(#552,1);
#555=IFCDERIVEDUNITELEMENT(#545,-3);
#556=IFCSIUNIT(*,.TIMEUNIT.,$,.SECOND.);
#557=IFCSIUNIT(*,.FREQUENCYUNIT.,$,.HERTZ.);
#558=IFCSIUNIT(*,.THERMODYNAMICTEMPERATUREUNIT.,$,.DEGREE_CELSIUS.);
#559=IFCDERIVEDUNIT((#560,#561,#563),.THERMALTRANSMITTANCEUNIT.,$);
#560=IFCDERIVEDUNITELEMENT(#552,1);
#561=IFCDERIVEDUNITELEMENT(#562,-1);
#562=IFCSIUNIT(*,.THERMODYNAMICTEMPERATUREUNIT.,$,.KELVIN.);
#563=IFCDERIVEDUNITELEMENT(#556,-3);
#564=IFCDERIVEDUNIT((#565,#566),.VOLUMETRICFLOWRATEUNIT.,$);
#565=IFCDERIVEDUNITELEMENT(#545,3);
#566=IFCDERIVEDUNITELEMENT(#556,-1);
#567=IFCSIUNIT(*,.ELECTRICCURRENTUNIT.,$,.AMPERE.);
#568=IFCSIUNIT(*,.ELECTRICVOLTAGEUNIT.,$,.VOLT.);
#569=IFCSIUNIT(*,.POWERUNIT.,$,.WATT.);
#570=IFCSIUNIT(*,.FORCEUNIT.,.KILO.,.NEWTON.);
#571=IFCSIUNIT(*,.ILLUMINANCEUNIT.,$,.LUX.);
#572=IFCSIUNIT(*,.LUMINOUSFLUXUNIT.,$,.LUMEN.);
#573=IFCSIUNIT(*,.LUMINOUSINTENSITYUNIT.,$,.CANDELA.);
#574=IFCDERIVEDUNIT((#575,#576,#577,#578),.USERDEFINED.,'Luminous Efficacy');
#575=IFCDERIVEDUNITELEMENT(#552,-1);
#576=IFCDERIVEDUNITELEMENT(#545,-2);
#577=IFCDERIVEDUNITELEMENT(#556,3);
#578=IFCDERIVEDUNITELEMENT(#572,1);
#579=IFCDERIVEDUNIT((#580,#581),.LINEARVELOCITYUNIT.,$);
#580=IFCDERIVEDUNITELEMENT(#545,1);
#581=IFCDERIVEDUNITELEMENT(#556,-1);
#582=IFCMONETARYUNIT('\X2\20AC\X0\');
#583=IFCSIUNIT(*,.PRESSUREUNIT.,$,.PASCAL.);
#584=IFCDERIVEDUNIT((#585,#586,#587),.USERDEFINED.,'Friction Loss');
#585=IFCDERIVEDUNITELEMENT(#545,-2);
#586=IFCDERIVEDUNITELEMENT(#552,1);
#587=IFCDERIVEDUNITELEMENT(#556,-2);
ENDSEC;
END-ISO-10303-21;
| {
"pile_set_name": "Github"
} |
// tslint:disable non-literal-require no-console
import debug from 'debug';
import fs from 'fs';
import path from 'path';
import { config } from './config';
const log = debug('prime:fields');
// Resolve fields
export const fields = (config.fields || [])
.map((moduleName: string) => {
try {
const field = require(moduleName).default;
field.packageName = moduleName;
const pkgDir = moduleName.replace(/\/*(src\/*?)?$/, '');
let pkgJson;
try {
const dev = path.resolve(path.join('node_modules', pkgDir, 'package.json'));
const devFile = fs.realpathSync(dev);
field.mode = 'development';
field.dir = devFile.replace(/\/package.json$/, '');
pkgJson = require(devFile);
} catch (err) {
try {
const dist = path.resolve(path.join('..', '..', 'node_modules', pkgDir, 'package.json'));
const distFile = fs.realpathSync(dist);
field.mode = 'production';
field.dir = distFile.replace(/\/package.json$/, '');
pkgJson = require(distFile);
} catch (err2) {
// noop
}
}
if (pkgJson) {
if (pkgJson.prime) {
field.ui = path.join(field.dir, pkgJson.prime);
}
}
if (field.options && !field.defaultOptions) {
// Backwards compatible
field.defaultOptions = field.options;
}
let error;
if (!field.type) {
error = '%o has no static "type" property';
} else if (!field.title) {
error = '%o has no static "title" property';
}
if (error) {
log(error, moduleName);
return null;
}
return field;
} catch (err) {
log('Could not resolve field module %o because:\n%O', moduleName, err);
}
return null;
})
.filter(n => !!n);
| {
"pile_set_name": "Github"
} |
{-#
LANGUAGE
MultiParamTypeClasses,
GeneralizedNewtypeDeriving,
StandaloneDeriving,
DeriveDataTypeable,
FlexibleInstances,
ViewPatterns
#-}
import Prelude hiding ((*>))
import Control.Exception
import Control.Monad
import Control.DeepSeq
import Data.Typeable
import Data.Functor
import Data.List
import Data.Hashable
import Data.Binary
import Development.Shake hiding (command_)
import qualified Development.Shake as S (command_)
import Development.Shake.FilePath
import System.FilePath.Posix hiding ((</>), doesDirectoryExist)
import System.Posix.Directory
import System.Posix.Env hiding (getEnv)
import System.Directory hiding (doesDirectoryExist, doesFileExist)
import System.Environment (getArgs)
import System.Exit
import System.IO
import Distribution.Verbosity
import Distribution.Text (simpleParse)
import Distribution.Compiler
import Distribution.Package hiding (pkgName)
import Distribution.PackageDescription
import Distribution.PackageDescription.Parse
import Distribution.PackageDescription.PrettyPrint
import Distribution.PackageDescription.Configuration
import Text.Parsec
import Text.Parsec.String
import Data.Version
llvmVersion = "3.5.2"
llvmDir = "out" </> ("llvm-" ++ llvmVersion)
pkgName = "llvm-general"
wipedir :: FilePath -> Action ()
wipedir d = do
present <- doesDirectoryExist d
when present $ command_ [] "rm" [ "-r", d ]
mkdir :: FilePath -> Action ()
mkdir d = command_ [] "mkdir" [ "-p", d ]
untar :: FilePath -> FilePath -> Action ()
untar d tb = command_ [] "tar" [ "xCf", d, tb ]
needRecursive :: FilePath -> Action ()
needRecursive p = do
subdirs <- getDirectoryDirs p
forM [ s | s <- subdirs, s /= ".git" ] $ needRecursive . (p </>)
files <- getDirectoryFiles p ["*"]
need $ map (p </>) files
touch f = do
let d = dropFileName f
dExists <- doesDirectoryExist d
unless dExists $ command_ [] "mkdir" ["-p", d]
command_ [] "touch" [ f ]
command_ :: [CmdOption] -> String -> [String] -> Action ()
command_ opts c args = foldr x (S.command_ opts c args) opts
where x (Cwd p') rest = do
p <- liftIO $ canonicalizePath p'
putQuiet $ "Entering directory `" ++ p ++ "'"
rest
putQuiet $ "Leaving directory `" ++ p ++ "'"
x _ rest = rest
newtype BuildRoot = BuildRoot () deriving (Eq, Ord, Read, Show, Binary, Hashable, NFData, Typeable)
newtype LLVMConfig = LLVMConfig () deriving (Eq, Ord, Read, Show, Binary, Hashable, NFData, Typeable)
newtype CabalVersion = CabalVersion String deriving (Eq, Ord, Read, Show, Binary, Hashable, NFData, Typeable)
stamp :: ((String, String)) -> String
stamp (stage, pkg) = pkg </> "dist/shake/stamps" </> stage
parseStamp :: String -> (String, String)
parseStamp s = (takeFileName s, takeDirectory1 s)
needStamps :: [(String,String)] -> Action ()
needStamps ls = need (map stamp ls)
main = shake shakeOptions {
shakeVersion = "2",
shakeVerbosity = Normal
} $ do
action $ do
liftIO $ hSetBuffering stdout NoBuffering
liftIO $ hSetBuffering stderr NoBuffering
getBuildRoot <- addOracle $ \(BuildRoot _) -> do
liftIO $ getWorkingDirectory
getCabalVersion <- addOracle $ \(CabalVersion pkg) -> do
liftIO $ liftM (showVersion . pkgVersion . package . packageDescription) $ readPackageDescription silent (pkg </> pkg ++ ".cabal")
getLlvmConfig <- addOracle $ \(LLVMConfig _) -> do
Exit exitCode <- command [] "which" ["llvm-config"]
let x = exitCode /= ExitSuccess
when x $ do
done <- doesFileExist (llvmDir </> "install/bin/llvm-config")
unless done $ need [ (llvmDir </> "install/bin/llvm-config") ]
return x
ghPagesLock <- newResource "gh-pages lock" 1
action $ do
args <- liftIO getArgs
need (if null args then [ stamp ("tested", "llvm-general") ] else args)
phony "env" $ do
command_ [] "env" []
let shared = [ "--enable-shared" | True ]
let ghPages = "out" </> "gh-pages"
sandbox = "out" </> "sandbox"
sandboxConfigFile = "out" </> "cabal.sandbox.config"
let getCabalStep = do
buildRoot <- getBuildRoot (BuildRoot ())
ownLLVM <- getLlvmConfig (LLVMConfig ())
pathOpt <- if ownLLVM
then do
opt <- addPath [buildRoot </> llvmDir </> "install/bin"] []
return [opt]
else
return []
return $ \pkg args -> command_ ([Cwd pkg] ++ pathOpt) "cabal" $ [ "--sandbox-config-file=" ++ (buildRoot </> sandboxConfigFile) ] ++ args
let localPackageDeps "llvm-general" = [ "llvm-general-pure" ]
localPackageDeps _ = []
allPkgs = [ "llvm-general-pure", "llvm-general"]
needStage stage pkgs = needStamps [ (stage, pkg) | pkg <- pkgs ]
let cabal args = do
command_ [] "cabal" $ [ "--sandbox-config-file=" ++ sandboxConfigFile ] ++ args
let ensureSandbox = do
present <- doesFileExist sandboxConfigFile
unless present $ do
cabal [ "sandbox", "init", "--sandbox=" ++ sandbox ]
cabal $ [ "sandbox", "add-source" ] ++ allPkgs
phony "build" $ needStage "built" allPkgs
phony "test" $ needStage "tested" allPkgs
phony "doc" $ needStage "documented" allPkgs
phony "pubdoc" $ needStage "docPublished" allPkgs
stamp ("*","*") *> \(stmp@(parseStamp -> (stage, pkg))) -> (>> touch stmp) $ do
ensureSandbox
cabalStep <- getCabalStep
tag <- getCabalVersion (CabalVersion pkg)
buildRoot <- getBuildRoot (BuildRoot ())
case stage of
"configured" -> do
needStage "installed" (localPackageDeps pkg)
need [ pkg </> "Setup.hs" ]
need [ pkg </> pkg ++ ".cabal" ]
cabalStep pkg $ [ "install", "--only-dependencies", "--enable-tests" ] ++ shared
cabalStep pkg $ [ "configure", "--enable-tests", "-fshared-llvm" ] ++ shared
"built" -> do
needStage "configured" [pkg]
needRecursive $ pkg </> "src"
needRecursive $ pkg </> "test"
cabalStep pkg [ "build" ]
"installed" -> do
needStage "built" [pkg]
cabalStep pkg $ [ "install", "--reinstall", "--force-reinstalls" ] ++ shared
"tested" -> do
needStage "built" [pkg]
cabalStep pkg [ "test" ]
"documented" -> do
needStage "built" [pkg]
needStage "documented" (localPackageDeps pkg)
cabalStep pkg $ [
"haddock",
"--html-location=http://hackage.haskell.org/packages/archive/$pkg/$version/doc/html"
] ++ [
"--haddock-options=--read-interface="
++ ("/llvm-general" </> tag </> "doc/html" </> dpkg)
++ ","
++ (buildRoot </> dpkg </> "dist/doc/html" </> dpkg </> dpkg <.> "haddock")
| dpkg <- localPackageDeps pkg
]
"docPublished" -> do
needStage "documented" [pkg]
withResource ghPagesLock 1 $ do
ghPagesExists <- doesDirectoryExist ghPages
unless ghPagesExists $ command_ [Cwd "out"] "git" ["clone", buildRoot, "-b", "gh-pages", "gh-pages"]
command_ [] "rm" [ "-rf", ghPages </> tag </> "doc" </> "html" </> pkg ]
command_ [] "mkdir" [ "-p", ghPages </> tag </> "doc" </> "html" ]
command_ [] "cp" [ "-r", pkg </> "dist/doc/html" </> pkg, ghPages </> tag </> "doc" </> "html" ]
command_ [Cwd ghPages] "git" [ "add", "-A", "." ]
command_ [Cwd ghPages] "git" [ "commit", "-m", show ("update " ++ tag ++ " " ++ pkg ++ " doc") ]
command_ [Cwd ghPages] "git" [ "push" ]
llvmDir </> "install/bin/llvm-config" *> \out -> do
[tarball] <- getDirectoryFiles "." [ "downloads/llvm-" ++ llvmVersion ++ ".src.tar.*" ]
buildRoot <- askOracle (BuildRoot ())
need [ tarball ]
let buildDir = llvmDir </> "build"
wipedir buildDir
mkdir buildDir
untar buildDir tarball
(".":"..":[srcDir']) <- liftM sort $ liftIO $ System.Directory.getDirectoryContents buildDir
let srcDir = buildDir </> srcDir'
command_ [Cwd srcDir] "sh" [
"./configure",
"--prefix=" ++ buildRoot </> llvmDir </> "install",
"--enable-shared"
]
command_ [Cwd srcDir] "make" [ "-j", "8", "install" ]
wipedir buildDir
| {
"pile_set_name": "Github"
} |
{
"display": {
"icon": {
"item": "botania:light_relay"
},
"title": {
"translate": "advancement.botania:luminizerRide"
},
"description": {
"translate": "advancement.botania:luminizerRide.desc"
}
},
"parent": "botania:main/ender_air_make",
"__comment": "This is triggered by code in Botania. In the future, it may become data-driven",
"criteria": {
"code_triggered": {
"trigger": "minecraft:impossible"
}
}
} | {
"pile_set_name": "Github"
} |
/*=============================================================================
Copyright (c) 2001-2007 Joel de Guzman
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)
==============================================================================*/
#if !defined(FUSION_INCLUDE_REMOVE)
#define FUSION_INCLUDE_REMOVE
#include <boost/fusion/support/config.hpp>
#include <boost/fusion/algorithm/transformation/remove.hpp>
#endif
| {
"pile_set_name": "Github"
} |
#!/usr/bin/env perl
# Copyright 2009 The Go Authors. All rights reserved.
# Use of this source code is governed by a BSD-style
# license that can be found in the LICENSE file.
#
# Generate system call table for Darwin from sys/syscall.h
use strict;
if($ENV{'GOARCH'} eq "" || $ENV{'GOOS'} eq "") {
print STDERR "GOARCH or GOOS not defined in environment\n";
exit 1;
}
my $command = "mksysnum_darwin.pl " . join(' ', @ARGV);
print <<EOF;
// $command
// Code generated by the command above; see README.md. DO NOT EDIT.
// +build $ENV{'GOARCH'},$ENV{'GOOS'}
package unix
const (
EOF
while(<>){
if(/^#define\s+SYS_(\w+)\s+([0-9]+)/){
my $name = $1;
my $num = $2;
$name =~ y/a-z/A-Z/;
print " SYS_$name = $num;"
}
}
print <<EOF;
)
EOF
| {
"pile_set_name": "Github"
} |
// Used to import variables in components
@import 'custom_bootstrap_variables';
@import '../../../../../../node_modules/bootstrap/scss/mixins';
// -- Theme Colors here --
// Custom theme colors
// Refer _default_variables to generate colors
$theme-main-color: #e40046;
$theme-action-color: #e40046;
$primary-font: 'Roboto Regular';
$header-font-color: $white;
$theme-action-sub-color1: darken($theme-action-color, 25);
$theme-action-sub-color2: darken($theme-action-sub-color1, 30);
$theme-action-sub-color3: darken($theme-action-sub-color2, 25);
$theme-action-sub-color4: darken($theme-action-sub-color3 -10);
$theme-main-sub-color1:darken($theme-main-color, 25);
$theme-main-sub-color2: darken($theme-main-sub-color1, 30);
$theme-main-sub-color3: darken($theme-main-sub-color2, 25);
$theme-main-sub-color4: darken($theme-main-sub-color3, 25);
$footer-font-color: $header-font-color;
| {
"pile_set_name": "Github"
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.