text
stringlengths 2
100k
| meta
dict |
|---|---|
/*
===========================================================================
Copyright (C) 2000 - 2013, Raven Software, Inc.
Copyright (C) 2001 - 2013, Activision, Inc.
Copyright (C) 2013 - 2015, OpenJK contributors
This file is part of the OpenJK source code.
OpenJK is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License version 2 as
published by the Free Software Foundation.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, see <http://www.gnu.org/licenses/>.
===========================================================================
*/
// tr_image.c
#include "tr_local.h"
#include <map>
bool gServerSkinHack = false;
shader_t *R_FindServerShader( const char *name, const int *lightmapIndex, const byte *styles, qboolean mipRawImage );
static char *CommaParse( char **data_p );
/*
===============
RE_SplitSkins
input = skinname, possibly being a macro for three skins
return= true if three part skins found
output= qualified names to three skins if return is true, undefined if false
===============
*/
bool RE_SplitSkins(const char *INname, char *skinhead, char *skintorso, char *skinlower)
{ //INname= "models/players/jedi_tf/|head01_skin1|torso01|lower01";
if (strchr(INname, '|'))
{
char name[MAX_QPATH];
strcpy(name, INname);
char *p = strchr(name, '|');
*p=0;
p++;
//fill in the base path
strcpy (skinhead, name);
strcpy (skintorso, name);
strcpy (skinlower, name);
//now get the the individual files
//advance to second
char *p2 = strchr(p, '|');
assert(p2);
if (!p2)
{
return false;
}
*p2=0;
p2++;
strcat (skinhead, p);
strcat (skinhead, ".skin");
//advance to third
p = strchr(p2, '|');
assert(p);
if (!p)
{
return false;
}
*p=0;
p++;
strcat (skintorso,p2);
strcat (skintorso, ".skin");
strcat (skinlower,p);
strcat (skinlower, ".skin");
return true;
}
return false;
}
// given a name, go get the skin we want and return
qhandle_t RE_RegisterIndividualSkin( const char *name , qhandle_t hSkin)
{
skin_t *skin;
skinSurface_t *surf;
char *text, *text_p;
char *token;
char surfName[MAX_QPATH];
// load and parse the skin file
ri.FS_ReadFile( name, (void **)&text );
if ( !text ) {
#ifndef FINAL_BUILD
Com_Printf( "WARNING: RE_RegisterSkin( '%s' ) failed to load!\n", name );
#endif
return 0;
}
assert (tr.skins[hSkin]); //should already be setup, but might be an 3part append
skin = tr.skins[hSkin];
text_p = text;
while ( text_p && *text_p ) {
// get surface name
token = CommaParse( &text_p );
Q_strncpyz( surfName, token, sizeof( surfName ) );
if ( !token[0] ) {
break;
}
// lowercase the surface name so skin compares are faster
Q_strlwr( surfName );
if ( *text_p == ',' ) {
text_p++;
}
if ( !strncmp( token, "tag_", 4 ) ) { //these aren't in there, but just in case you load an id style one...
continue;
}
// parse the shader name
token = CommaParse( &text_p );
if ( !strcmp( &surfName[strlen(surfName)-4], "_off") )
{
if ( !strcmp( token ,"*off" ) )
{
continue; //don't need these double offs
}
surfName[strlen(surfName)-4] = 0; //remove the "_off"
}
if ((int)(sizeof( skin->surfaces) / sizeof( skin->surfaces[0] )) <= skin->numSurfaces)
{
assert( (int)(sizeof( skin->surfaces) / sizeof( skin->surfaces[0] )) > skin->numSurfaces );
Com_Printf( "WARNING: RE_RegisterSkin( '%s' ) more than %u surfaces!\n", name, (unsigned int)ARRAY_LEN(skin->surfaces) );
break;
}
surf = (skinSurface_t *) Hunk_Alloc( sizeof( *skin->surfaces[0] ), h_low );
skin->surfaces[skin->numSurfaces] = (_skinSurface_t *)surf;
Q_strncpyz( surf->name, surfName, sizeof( surf->name ) );
if (gServerSkinHack) surf->shader = R_FindServerShader( token, lightmapsNone, stylesDefault, qtrue );
else surf->shader = R_FindShader( token, lightmapsNone, stylesDefault, qtrue );
skin->numSurfaces++;
}
ri.FS_FreeFile( text );
// never let a skin have 0 shaders
if ( skin->numSurfaces == 0 ) {
return 0; // use default skin
}
return hSkin;
}
qhandle_t RE_RegisterSkin( const char *name ) {
qhandle_t hSkin;
skin_t *skin;
if ( !name || !name[0] ) {
Com_Printf( "Empty name passed to RE_RegisterSkin\n" );
return 0;
}
if ( strlen( name ) >= MAX_QPATH ) {
Com_Printf( "Skin name exceeds MAX_QPATH\n" );
return 0;
}
// see if the skin is already loaded
for ( hSkin = 1; hSkin < tr.numSkins ; hSkin++ ) {
skin = tr.skins[hSkin];
if ( !Q_stricmp( skin->name, name ) ) {
if( skin->numSurfaces == 0 ) {
return 0; // default skin
}
return hSkin;
}
}
// allocate a new skin
if ( tr.numSkins == MAX_SKINS ) {
Com_Printf( "WARNING: RE_RegisterSkin( '%s' ) MAX_SKINS hit\n", name );
return 0;
}
tr.numSkins++;
skin = (struct skin_s *)Hunk_Alloc( sizeof( skin_t ), h_low );
tr.skins[hSkin] = skin;
Q_strncpyz( skin->name, name, sizeof( skin->name ) );
skin->numSurfaces = 0;
// make sure the render thread is stopped
R_IssuePendingRenderCommands();
// If not a .skin file, load as a single shader
if ( strcmp( name + strlen( name ) - 5, ".skin" ) ) {
/* skin->numSurfaces = 1;
skin->surfaces[0] = (skinSurface_t *)Hunk_Alloc( sizeof(skin->surfaces[0]), h_low );
skin->surfaces[0]->shader = R_FindShader( name, lightmapsNone, stylesDefault, qtrue );
return hSkin;
*/
}
char skinhead[MAX_QPATH]={0};
char skintorso[MAX_QPATH]={0};
char skinlower[MAX_QPATH]={0};
if ( RE_SplitSkins(name, (char*)&skinhead, (char*)&skintorso, (char*)&skinlower ) )
{//three part
hSkin = RE_RegisterIndividualSkin(skinhead, hSkin);
if (hSkin)
{
hSkin = RE_RegisterIndividualSkin(skintorso, hSkin);
if (hSkin)
{
hSkin = RE_RegisterIndividualSkin(skinlower, hSkin);
}
}
}
else
{//single skin
hSkin = RE_RegisterIndividualSkin(name, hSkin);
}
return(hSkin);
}
/*
==================
CommaParse
This is unfortunate, but the skin files aren't
compatible with our normal parsing rules.
==================
*/
static char *CommaParse( char **data_p ) {
int c = 0, len;
char *data;
static char com_token[MAX_TOKEN_CHARS];
data = *data_p;
len = 0;
com_token[0] = 0;
// make sure incoming data is valid
if ( !data ) {
*data_p = NULL;
return com_token;
}
while ( 1 ) {
// skip whitespace
while( (c = *(const unsigned char* /*eurofix*/)data) <= ' ') {
if( !c ) {
break;
}
data++;
}
c = *data;
// skip double slash comments
if ( c == '/' && data[1] == '/' )
{
while (*data && *data != '\n')
data++;
}
// skip /* */ comments
else if ( c=='/' && data[1] == '*' )
{
while ( *data && ( *data != '*' || data[1] != '/' ) )
{
data++;
}
if ( *data )
{
data += 2;
}
}
else
{
break;
}
}
if ( c == 0 ) {
return "";
}
// handle quoted strings
if (c == '\"')
{
data++;
while (1)
{
c = *data++;
if (c=='\"' || !c)
{
com_token[len] = 0;
*data_p = ( char * ) data;
return com_token;
}
if (len < MAX_TOKEN_CHARS - 1)
{
com_token[len] = c;
len++;
}
}
}
// parse a regular word
do
{
if (len < MAX_TOKEN_CHARS - 1)
{
com_token[len] = c;
len++;
}
data++;
c = *data;
} while (c>32 && c != ',' );
com_token[len] = 0;
*data_p = ( char * ) data;
return com_token;
}
/*
===============
RE_RegisterServerSkin
Mangled version of the above function to load .skin files on the server.
===============
*/
qhandle_t RE_RegisterServerSkin( const char *name ) {
qhandle_t r;
if (ri.Cvar_VariableIntegerValue( "cl_running" ) &&
ri.Com_TheHunkMarkHasBeenMade() &&
ShaderHashTableExists())
{ //If the client is running then we can go straight into the normal registerskin func
return RE_RegisterSkin(name);
}
gServerSkinHack = true;
r = RE_RegisterSkin(name);
gServerSkinHack = false;
return r;
}
/*
===============
R_InitSkins
===============
*/
void R_InitSkins( void ) {
skin_t *skin;
tr.numSkins = 1;
// make the default skin have all default shaders
skin = tr.skins[0] = (struct skin_s *)ri.Hunk_Alloc( sizeof( skin_t ), h_low );
Q_strncpyz( skin->name, "<default skin>", sizeof( skin->name ) );
skin->numSurfaces = 1;
skin->surfaces[0] = (_skinSurface_t *)ri.Hunk_Alloc( sizeof( skinSurface_t ), h_low );
skin->surfaces[0]->shader = tr.defaultShader;
}
/*
===============
R_GetSkinByHandle
===============
*/
skin_t *R_GetSkinByHandle( qhandle_t hSkin ) {
if ( hSkin < 1 || hSkin >= tr.numSkins ) {
return tr.skins[0];
}
return tr.skins[ hSkin ];
}
| {
"pile_set_name": "Github"
} |
<!DOCTYPE html>
<html lang="en">
<head>
<meta http-equiv="refresh" content="0;URL=constant.IPPROTO_SEP.html">
</head>
<body>
<p>Redirecting to <a href="constant.IPPROTO_SEP.html">constant.IPPROTO_SEP.html</a>...</p>
<script>location.replace("constant.IPPROTO_SEP.html" + location.search + location.hash);</script>
</body>
</html> | {
"pile_set_name": "Github"
} |
<?xml version="1.0" encoding="utf-8"?>
<shape xmlns:android="http://schemas.android.com/apk/res/android" >
<gradient
android:startColor="#33000000"
android:centerColor="#11000000"
android:endColor="#00000000"
android:angle="270" />
</shape>
| {
"pile_set_name": "Github"
} |
/*
* Copyright (C) 2017 Advanced Micro Devices, Inc.
*
* 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 COPYRIGHT HOLDER(S) 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.
*/
#ifndef _vcn_1_0_OFFSET_HEADER
#define _vcn_1_0_OFFSET_HEADER
// addressBlock: uvd_uvd_pg_dec
// base address: 0x1fb00
#define mmUVD_PGFSM_CONFIG 0x00c0
#define mmUVD_PGFSM_CONFIG_BASE_IDX 1
#define mmUVD_PGFSM_STATUS 0x00c1
#define mmUVD_PGFSM_STATUS_BASE_IDX 1
#define mmUVD_POWER_STATUS 0x00c4
#define mmUVD_POWER_STATUS_BASE_IDX 1
#define mmCC_UVD_HARVESTING 0x00c7
#define mmCC_UVD_HARVESTING_BASE_IDX 1
#define mmUVD_DPG_LMA_CTL 0x00d1
#define mmUVD_DPG_LMA_CTL_BASE_IDX 1
#define mmUVD_DPG_LMA_DATA 0x00d2
#define mmUVD_DPG_LMA_DATA_BASE_IDX 1
#define mmUVD_DPG_LMA_MASK 0x00d3
#define mmUVD_DPG_LMA_MASK_BASE_IDX 1
#define mmUVD_DPG_PAUSE 0x00d4
#define mmUVD_DPG_PAUSE_BASE_IDX 1
#define mmUVD_SCRATCH1 0x00d5
#define mmUVD_SCRATCH1_BASE_IDX 1
#define mmUVD_SCRATCH2 0x00d6
#define mmUVD_SCRATCH2_BASE_IDX 1
#define mmUVD_SCRATCH3 0x00d7
#define mmUVD_SCRATCH3_BASE_IDX 1
#define mmUVD_SCRATCH4 0x00d8
#define mmUVD_SCRATCH4_BASE_IDX 1
#define mmUVD_SCRATCH5 0x00d9
#define mmUVD_SCRATCH5_BASE_IDX 1
#define mmUVD_SCRATCH6 0x00da
#define mmUVD_SCRATCH6_BASE_IDX 1
#define mmUVD_SCRATCH7 0x00db
#define mmUVD_SCRATCH7_BASE_IDX 1
#define mmUVD_SCRATCH8 0x00dc
#define mmUVD_SCRATCH8_BASE_IDX 1
#define mmUVD_SCRATCH9 0x00dd
#define mmUVD_SCRATCH9_BASE_IDX 1
#define mmUVD_SCRATCH10 0x00de
#define mmUVD_SCRATCH10_BASE_IDX 1
#define mmUVD_SCRATCH11 0x00df
#define mmUVD_SCRATCH11_BASE_IDX 1
#define mmUVD_SCRATCH12 0x00e0
#define mmUVD_SCRATCH12_BASE_IDX 1
#define mmUVD_SCRATCH13 0x00e1
#define mmUVD_SCRATCH13_BASE_IDX 1
#define mmUVD_SCRATCH14 0x00e2
#define mmUVD_SCRATCH14_BASE_IDX 1
#define mmUVD_DPG_LMI_VCPU_CACHE_64BIT_BAR_LOW 0x00e5
#define mmUVD_DPG_LMI_VCPU_CACHE_64BIT_BAR_LOW_BASE_IDX 1
#define mmUVD_DPG_LMI_VCPU_CACHE_64BIT_BAR_HIGH 0x00e6
#define mmUVD_DPG_LMI_VCPU_CACHE_64BIT_BAR_HIGH_BASE_IDX 1
#define mmUVD_DPG_VCPU_CACHE_OFFSET0 0x00e7
#define mmUVD_DPG_VCPU_CACHE_OFFSET0_BASE_IDX 1
// addressBlock: uvd_uvdgendec
// base address: 0x1fc00
#define mmUVD_LCM_CGC_CNTRL 0x0123
#define mmUVD_LCM_CGC_CNTRL_BASE_IDX 1
#define mmUVD_MIF_CURR_UV_ADDR_CONFIG 0x0184
#define mmUVD_MIF_CURR_UV_ADDR_CONFIG_BASE_IDX 1
#define mmUVD_MIF_REF_UV_ADDR_CONFIG 0x0185
#define mmUVD_MIF_REF_UV_ADDR_CONFIG_BASE_IDX 1
#define mmUVD_MIF_RECON1_UV_ADDR_CONFIG 0x0186
#define mmUVD_MIF_RECON1_UV_ADDR_CONFIG_BASE_IDX 1
#define mmUVD_MIF_CURR_ADDR_CONFIG 0x0192
#define mmUVD_MIF_CURR_ADDR_CONFIG_BASE_IDX 1
#define mmUVD_MIF_REF_ADDR_CONFIG 0x0193
#define mmUVD_MIF_REF_ADDR_CONFIG_BASE_IDX 1
#define mmUVD_MIF_RECON1_ADDR_CONFIG 0x01c5
#define mmUVD_MIF_RECON1_ADDR_CONFIG_BASE_IDX 1
// addressBlock: uvd_uvdnpdec
// base address: 0x20000
#define mmUVD_JPEG_CNTL 0x0200
#define mmUVD_JPEG_CNTL_BASE_IDX 1
#define mmUVD_JPEG_RB_BASE 0x0201
#define mmUVD_JPEG_RB_BASE_BASE_IDX 1
#define mmUVD_JPEG_RB_WPTR 0x0202
#define mmUVD_JPEG_RB_WPTR_BASE_IDX 1
#define mmUVD_JPEG_RB_RPTR 0x0203
#define mmUVD_JPEG_RB_RPTR_BASE_IDX 1
#define mmUVD_JPEG_RB_SIZE 0x0204
#define mmUVD_JPEG_RB_SIZE_BASE_IDX 1
#define mmUVD_JPEG_ADDR_CONFIG 0x021f
#define mmUVD_JPEG_ADDR_CONFIG_BASE_IDX 1
#define mmUVD_JPEG_PITCH 0x0222
#define mmUVD_JPEG_PITCH_BASE_IDX 1
#define mmUVD_JPEG_GPCOM_CMD 0x022c
#define mmUVD_JPEG_GPCOM_CMD_BASE_IDX 1
#define mmUVD_JPEG_GPCOM_DATA0 0x022d
#define mmUVD_JPEG_GPCOM_DATA0_BASE_IDX 1
#define mmUVD_JPEG_GPCOM_DATA1 0x022e
#define mmUVD_JPEG_GPCOM_DATA1_BASE_IDX 1
#define mmUVD_JPEG_JRB_BASE_LO 0x022f
#define mmUVD_JPEG_JRB_BASE_LO_BASE_IDX 1
#define mmUVD_JPEG_JRB_BASE_HI 0x0230
#define mmUVD_JPEG_JRB_BASE_HI_BASE_IDX 1
#define mmUVD_JPEG_JRB_SIZE 0x0232
#define mmUVD_JPEG_JRB_SIZE_BASE_IDX 1
#define mmUVD_JPEG_JRB_RPTR 0x0233
#define mmUVD_JPEG_JRB_RPTR_BASE_IDX 1
#define mmUVD_JPEG_JRB_WPTR 0x0234
#define mmUVD_JPEG_JRB_WPTR_BASE_IDX 1
#define mmUVD_JPEG_UV_ADDR_CONFIG 0x0238
#define mmUVD_JPEG_UV_ADDR_CONFIG_BASE_IDX 1
#define mmUVD_SEMA_ADDR_LOW 0x03c0
#define mmUVD_SEMA_ADDR_LOW_BASE_IDX 1
#define mmUVD_SEMA_ADDR_HIGH 0x03c1
#define mmUVD_SEMA_ADDR_HIGH_BASE_IDX 1
#define mmUVD_SEMA_CMD 0x03c2
#define mmUVD_SEMA_CMD_BASE_IDX 1
#define mmUVD_GPCOM_VCPU_CMD 0x03c3
#define mmUVD_GPCOM_VCPU_CMD_BASE_IDX 1
#define mmUVD_GPCOM_VCPU_DATA0 0x03c4
#define mmUVD_GPCOM_VCPU_DATA0_BASE_IDX 1
#define mmUVD_GPCOM_VCPU_DATA1 0x03c5
#define mmUVD_GPCOM_VCPU_DATA1_BASE_IDX 1
#define mmUVD_ENGINE_CNTL 0x03c6
#define mmUVD_ENGINE_CNTL_BASE_IDX 1
#define mmUVD_UDEC_DBW_UV_ADDR_CONFIG 0x03d2
#define mmUVD_UDEC_DBW_UV_ADDR_CONFIG_BASE_IDX 1
#define mmUVD_UDEC_ADDR_CONFIG 0x03d3
#define mmUVD_UDEC_ADDR_CONFIG_BASE_IDX 1
#define mmUVD_UDEC_DB_ADDR_CONFIG 0x03d4
#define mmUVD_UDEC_DB_ADDR_CONFIG_BASE_IDX 1
#define mmUVD_UDEC_DBW_ADDR_CONFIG 0x03d5
#define mmUVD_UDEC_DBW_ADDR_CONFIG_BASE_IDX 1
#define mmUVD_SUVD_CGC_GATE 0x03e4
#define mmUVD_SUVD_CGC_GATE_BASE_IDX 1
#define mmUVD_SUVD_CGC_STATUS 0x03e5
#define mmUVD_SUVD_CGC_STATUS_BASE_IDX 1
#define mmUVD_SUVD_CGC_CTRL 0x03e6
#define mmUVD_SUVD_CGC_CTRL_BASE_IDX 1
#define mmUVD_LMI_VCPU_CACHE1_64BIT_BAR_LOW 0x03ec
#define mmUVD_LMI_VCPU_CACHE1_64BIT_BAR_LOW_BASE_IDX 1
#define mmUVD_LMI_VCPU_CACHE1_64BIT_BAR_HIGH 0x03ed
#define mmUVD_LMI_VCPU_CACHE1_64BIT_BAR_HIGH_BASE_IDX 1
#define mmUVD_LMI_VCPU_CACHE2_64BIT_BAR_LOW 0x03f0
#define mmUVD_LMI_VCPU_CACHE2_64BIT_BAR_LOW_BASE_IDX 1
#define mmUVD_LMI_VCPU_CACHE2_64BIT_BAR_HIGH 0x03f1
#define mmUVD_LMI_VCPU_CACHE2_64BIT_BAR_HIGH_BASE_IDX 1
#define mmUVD_NO_OP 0x03ff
#define mmUVD_NO_OP_BASE_IDX 1
#define mmUVD_JPEG_CNTL2 0x0404
#define mmUVD_JPEG_CNTL2_BASE_IDX 1
#define mmUVD_VERSION 0x0409
#define mmUVD_VERSION_BASE_IDX 1
#define mmUVD_GP_SCRATCH8 0x040a
#define mmUVD_GP_SCRATCH8_BASE_IDX 1
#define mmUVD_GP_SCRATCH9 0x040b
#define mmUVD_GP_SCRATCH9_BASE_IDX 1
#define mmUVD_GP_SCRATCH10 0x040c
#define mmUVD_GP_SCRATCH10_BASE_IDX 1
#define mmUVD_GP_SCRATCH11 0x040d
#define mmUVD_GP_SCRATCH11_BASE_IDX 1
#define mmUVD_GP_SCRATCH12 0x040e
#define mmUVD_GP_SCRATCH12_BASE_IDX 1
#define mmUVD_GP_SCRATCH13 0x040f
#define mmUVD_GP_SCRATCH13_BASE_IDX 1
#define mmUVD_GP_SCRATCH14 0x0410
#define mmUVD_GP_SCRATCH14_BASE_IDX 1
#define mmUVD_GP_SCRATCH15 0x0411
#define mmUVD_GP_SCRATCH15_BASE_IDX 1
#define mmUVD_GP_SCRATCH16 0x0412
#define mmUVD_GP_SCRATCH16_BASE_IDX 1
#define mmUVD_GP_SCRATCH17 0x0413
#define mmUVD_GP_SCRATCH17_BASE_IDX 1
#define mmUVD_GP_SCRATCH18 0x0414
#define mmUVD_GP_SCRATCH18_BASE_IDX 1
#define mmUVD_GP_SCRATCH19 0x0415
#define mmUVD_GP_SCRATCH19_BASE_IDX 1
#define mmUVD_GP_SCRATCH20 0x0416
#define mmUVD_GP_SCRATCH20_BASE_IDX 1
#define mmUVD_GP_SCRATCH21 0x0417
#define mmUVD_GP_SCRATCH21_BASE_IDX 1
#define mmUVD_GP_SCRATCH22 0x0418
#define mmUVD_GP_SCRATCH22_BASE_IDX 1
#define mmUVD_GP_SCRATCH23 0x0419
#define mmUVD_GP_SCRATCH23_BASE_IDX 1
#define mmUVD_RB_BASE_LO2 0x0421
#define mmUVD_RB_BASE_LO2_BASE_IDX 1
#define mmUVD_RB_BASE_HI2 0x0422
#define mmUVD_RB_BASE_HI2_BASE_IDX 1
#define mmUVD_RB_SIZE2 0x0423
#define mmUVD_RB_SIZE2_BASE_IDX 1
#define mmUVD_RB_RPTR2 0x0424
#define mmUVD_RB_RPTR2_BASE_IDX 1
#define mmUVD_RB_WPTR2 0x0425
#define mmUVD_RB_WPTR2_BASE_IDX 1
#define mmUVD_RB_BASE_LO 0x0426
#define mmUVD_RB_BASE_LO_BASE_IDX 1
#define mmUVD_RB_BASE_HI 0x0427
#define mmUVD_RB_BASE_HI_BASE_IDX 1
#define mmUVD_RB_SIZE 0x0428
#define mmUVD_RB_SIZE_BASE_IDX 1
#define mmUVD_RB_RPTR 0x0429
#define mmUVD_RB_RPTR_BASE_IDX 1
#define mmUVD_RB_WPTR 0x042a
#define mmUVD_RB_WPTR_BASE_IDX 1
#define mmUVD_RB_WPTR4 0x0456
#define mmUVD_RB_WPTR4_BASE_IDX 1
#define mmUVD_JRBC_RB_RPTR 0x0457
#define mmUVD_JRBC_RB_RPTR_BASE_IDX 1
#define mmUVD_LMI_JPEG_VMID 0x045d
#define mmUVD_LMI_JPEG_VMID_BASE_IDX 1
#define mmUVD_LMI_VCPU_CACHE_64BIT_BAR_HIGH 0x045e
#define mmUVD_LMI_VCPU_CACHE_64BIT_BAR_HIGH_BASE_IDX 1
#define mmUVD_LMI_VCPU_CACHE_64BIT_BAR_LOW 0x045f
#define mmUVD_LMI_VCPU_CACHE_64BIT_BAR_LOW_BASE_IDX 1
#define mmUVD_LMI_RBC_IB_64BIT_BAR_HIGH 0x0466
#define mmUVD_LMI_RBC_IB_64BIT_BAR_HIGH_BASE_IDX 1
#define mmUVD_LMI_RBC_IB_64BIT_BAR_LOW 0x0467
#define mmUVD_LMI_RBC_IB_64BIT_BAR_LOW_BASE_IDX 1
#define mmUVD_LMI_RBC_RB_64BIT_BAR_HIGH 0x0468
#define mmUVD_LMI_RBC_RB_64BIT_BAR_HIGH_BASE_IDX 1
#define mmUVD_LMI_RBC_RB_64BIT_BAR_LOW 0x0469
#define mmUVD_LMI_RBC_RB_64BIT_BAR_LOW_BASE_IDX 1
// addressBlock: uvd_uvddec
// base address: 0x20c00
#define mmUVD_SEMA_CNTL 0x0500
#define mmUVD_SEMA_CNTL_BASE_IDX 1
#define mmUVD_LMI_JRBC_RB_64BIT_BAR_LOW 0x0503
#define mmUVD_LMI_JRBC_RB_64BIT_BAR_LOW_BASE_IDX 1
#define mmUVD_LMI_JRBC_RB_64BIT_BAR_HIGH 0x0504
#define mmUVD_LMI_JRBC_RB_64BIT_BAR_HIGH_BASE_IDX 1
#define mmUVD_LMI_JRBC_IB_64BIT_BAR_LOW 0x0505
#define mmUVD_LMI_JRBC_IB_64BIT_BAR_LOW_BASE_IDX 1
#define mmUVD_LMI_JRBC_IB_64BIT_BAR_HIGH 0x0506
#define mmUVD_LMI_JRBC_IB_64BIT_BAR_HIGH_BASE_IDX 1
#define mmUVD_LMI_JRBC_IB_VMID 0x0507
#define mmUVD_LMI_JRBC_IB_VMID_BASE_IDX 1
#define mmUVD_LMI_JRBC_RB_VMID 0x0508
#define mmUVD_LMI_JRBC_RB_VMID_BASE_IDX 1
#define mmUVD_JRBC_RB_WPTR 0x0509
#define mmUVD_JRBC_RB_WPTR_BASE_IDX 1
#define mmUVD_JRBC_RB_CNTL 0x050a
#define mmUVD_JRBC_RB_CNTL_BASE_IDX 1
#define mmUVD_JRBC_IB_SIZE 0x050b
#define mmUVD_JRBC_IB_SIZE_BASE_IDX 1
#define mmUVD_JRBC_LMI_SWAP_CNTL 0x050d
#define mmUVD_JRBC_LMI_SWAP_CNTL_BASE_IDX 1
#define mmUVD_LMI_JRBC_RB_MEM_WR_64BIT_BAR_LOW 0x050e
#define mmUVD_LMI_JRBC_RB_MEM_WR_64BIT_BAR_LOW_BASE_IDX 1
#define mmUVD_LMI_JRBC_RB_MEM_WR_64BIT_BAR_HIGH 0x050f
#define mmUVD_LMI_JRBC_RB_MEM_WR_64BIT_BAR_HIGH_BASE_IDX 1
#define mmUVD_LMI_JRBC_RB_MEM_RD_64BIT_BAR_LOW 0x0510
#define mmUVD_LMI_JRBC_RB_MEM_RD_64BIT_BAR_LOW_BASE_IDX 1
#define mmUVD_LMI_JRBC_RB_MEM_RD_64BIT_BAR_HIGH 0x0511
#define mmUVD_LMI_JRBC_RB_MEM_RD_64BIT_BAR_HIGH_BASE_IDX 1
#define mmUVD_JRBC_RB_REF_DATA 0x0512
#define mmUVD_JRBC_RB_REF_DATA_BASE_IDX 1
#define mmUVD_JRBC_RB_COND_RD_TIMER 0x0513
#define mmUVD_JRBC_RB_COND_RD_TIMER_BASE_IDX 1
#define mmUVD_JRBC_EXTERNAL_REG_BASE 0x0517
#define mmUVD_JRBC_EXTERNAL_REG_BASE_BASE_IDX 1
#define mmUVD_JRBC_SOFT_RESET 0x0519
#define mmUVD_JRBC_SOFT_RESET_BASE_IDX 1
#define mmUVD_JRBC_STATUS 0x051a
#define mmUVD_JRBC_STATUS_BASE_IDX 1
#define mmUVD_RB_RPTR3 0x051b
#define mmUVD_RB_RPTR3_BASE_IDX 1
#define mmUVD_RB_WPTR3 0x051c
#define mmUVD_RB_WPTR3_BASE_IDX 1
#define mmUVD_RB_BASE_LO3 0x051d
#define mmUVD_RB_BASE_LO3_BASE_IDX 1
#define mmUVD_RB_BASE_HI3 0x051e
#define mmUVD_RB_BASE_HI3_BASE_IDX 1
#define mmUVD_RB_SIZE3 0x051f
#define mmUVD_RB_SIZE3_BASE_IDX 1
#define mmJPEG_CGC_GATE 0x0526
#define mmJPEG_CGC_GATE_BASE_IDX 1
#define mmUVD_CTX_INDEX 0x0528
#define mmUVD_CTX_INDEX_BASE_IDX 1
#define mmUVD_CTX_DATA 0x0529
#define mmUVD_CTX_DATA_BASE_IDX 1
#define mmUVD_CGC_GATE 0x052a
#define mmUVD_CGC_GATE_BASE_IDX 1
#define mmUVD_CGC_STATUS 0x052b
#define mmUVD_CGC_STATUS_BASE_IDX 1
#define mmUVD_CGC_CTRL 0x052c
#define mmUVD_CGC_CTRL_BASE_IDX 1
#define mmUVD_GP_SCRATCH0 0x0534
#define mmUVD_GP_SCRATCH0_BASE_IDX 1
#define mmUVD_GP_SCRATCH1 0x0535
#define mmUVD_GP_SCRATCH1_BASE_IDX 1
#define mmUVD_GP_SCRATCH2 0x0536
#define mmUVD_GP_SCRATCH2_BASE_IDX 1
#define mmUVD_GP_SCRATCH3 0x0537
#define mmUVD_GP_SCRATCH3_BASE_IDX 1
#define mmUVD_GP_SCRATCH4 0x0538
#define mmUVD_GP_SCRATCH4_BASE_IDX 1
#define mmUVD_GP_SCRATCH5 0x0539
#define mmUVD_GP_SCRATCH5_BASE_IDX 1
#define mmUVD_GP_SCRATCH6 0x053a
#define mmUVD_GP_SCRATCH6_BASE_IDX 1
#define mmUVD_GP_SCRATCH7 0x053b
#define mmUVD_GP_SCRATCH7_BASE_IDX 1
#define mmUVD_LMI_VCPU_CACHE_VMID 0x053c
#define mmUVD_LMI_VCPU_CACHE_VMID_BASE_IDX 1
#define mmUVD_LMI_CTRL2 0x053d
#define mmUVD_LMI_CTRL2_BASE_IDX 1
#define mmUVD_MASTINT_EN 0x0540
#define mmUVD_MASTINT_EN_BASE_IDX 1
#define mmUVD_SYS_INT_EN 0x0541
#define mmUVD_SYS_INT_EN_BASE_IDX 1
#define mmJPEG_CGC_CTRL 0x0565
#define mmJPEG_CGC_CTRL_BASE_IDX 1
#define mmUVD_LMI_CTRL 0x0566
#define mmUVD_LMI_CTRL_BASE_IDX 1
#define mmUVD_LMI_STATUS 0x0567
#define mmUVD_LMI_STATUS_BASE_IDX 1
#define mmUVD_LMI_VM_CTRL 0x0568
#define mmUVD_LMI_VM_CTRL_BASE_IDX 1
#define mmUVD_LMI_SWAP_CNTL 0x056d
#define mmUVD_LMI_SWAP_CNTL_BASE_IDX 1
#define mmUVD_MPC_CNTL 0x0577
#define mmUVD_MPC_CNTL_BASE_IDX 1
#define mmUVD_MPC_SET_MUXA0 0x0579
#define mmUVD_MPC_SET_MUXA0_BASE_IDX 1
#define mmUVD_MPC_SET_MUXA1 0x057a
#define mmUVD_MPC_SET_MUXA1_BASE_IDX 1
#define mmUVD_MPC_SET_MUXB0 0x057b
#define mmUVD_MPC_SET_MUXB0_BASE_IDX 1
#define mmUVD_MPC_SET_MUXB1 0x057c
#define mmUVD_MPC_SET_MUXB1_BASE_IDX 1
#define mmUVD_MPC_SET_MUX 0x057d
#define mmUVD_MPC_SET_MUX_BASE_IDX 1
#define mmUVD_MPC_SET_ALU 0x057e
#define mmUVD_MPC_SET_ALU_BASE_IDX 1
#define mmUVD_GPCOM_SYS_CMD 0x057f
#define mmUVD_GPCOM_SYS_CMD_BASE_IDX 1
#define mmUVD_GPCOM_SYS_DATA0 0x0580
#define mmUVD_GPCOM_SYS_DATA0_BASE_IDX 1
#define mmUVD_GPCOM_SYS_DATA1 0x0581
#define mmUVD_GPCOM_SYS_DATA1_BASE_IDX 1
#define mmUVD_VCPU_CACHE_OFFSET0 0x0582
#define mmUVD_VCPU_CACHE_OFFSET0_BASE_IDX 1
#define mmUVD_VCPU_CACHE_SIZE0 0x0583
#define mmUVD_VCPU_CACHE_SIZE0_BASE_IDX 1
#define mmUVD_VCPU_CACHE_OFFSET1 0x0584
#define mmUVD_VCPU_CACHE_OFFSET1_BASE_IDX 1
#define mmUVD_VCPU_CACHE_SIZE1 0x0585
#define mmUVD_VCPU_CACHE_SIZE1_BASE_IDX 1
#define mmUVD_VCPU_CACHE_OFFSET2 0x0586
#define mmUVD_VCPU_CACHE_OFFSET2_BASE_IDX 1
#define mmUVD_VCPU_CACHE_SIZE2 0x0587
#define mmUVD_VCPU_CACHE_SIZE2_BASE_IDX 1
#define mmUVD_VCPU_CNTL 0x0598
#define mmUVD_VCPU_CNTL_BASE_IDX 1
#define mmUVD_SOFT_RESET 0x05a0
#define mmUVD_SOFT_RESET_BASE_IDX 1
#define mmUVD_LMI_RBC_IB_VMID 0x05a1
#define mmUVD_LMI_RBC_IB_VMID_BASE_IDX 1
#define mmUVD_RBC_IB_SIZE 0x05a2
#define mmUVD_RBC_IB_SIZE_BASE_IDX 1
#define mmUVD_RBC_RB_RPTR 0x05a4
#define mmUVD_RBC_RB_RPTR_BASE_IDX 1
#define mmUVD_RBC_RB_WPTR 0x05a5
#define mmUVD_RBC_RB_WPTR_BASE_IDX 1
#define mmUVD_RBC_RB_WPTR_CNTL 0x05a6
#define mmUVD_RBC_RB_WPTR_CNTL_BASE_IDX 1
#define mmUVD_RBC_RB_CNTL 0x05a9
#define mmUVD_RBC_RB_CNTL_BASE_IDX 1
#define mmUVD_RBC_RB_RPTR_ADDR 0x05aa
#define mmUVD_RBC_RB_RPTR_ADDR_BASE_IDX 1
#define mmUVD_STATUS 0x05af
#define mmUVD_STATUS_BASE_IDX 1
#define mmUVD_SEMA_TIMEOUT_STATUS 0x05b0
#define mmUVD_SEMA_TIMEOUT_STATUS_BASE_IDX 1
#define mmUVD_SEMA_WAIT_INCOMPLETE_TIMEOUT_CNTL 0x05b1
#define mmUVD_SEMA_WAIT_INCOMPLETE_TIMEOUT_CNTL_BASE_IDX 1
#define mmUVD_SEMA_WAIT_FAULT_TIMEOUT_CNTL 0x05b2
#define mmUVD_SEMA_WAIT_FAULT_TIMEOUT_CNTL_BASE_IDX 1
#define mmUVD_SEMA_SIGNAL_INCOMPLETE_TIMEOUT_CNTL 0x05b3
#define mmUVD_SEMA_SIGNAL_INCOMPLETE_TIMEOUT_CNTL_BASE_IDX 1
#define mmUVD_CONTEXT_ID 0x05bd
#define mmUVD_CONTEXT_ID_BASE_IDX 1
#define mmUVD_CONTEXT_ID2 0x05bf
#define mmUVD_CONTEXT_ID2_BASE_IDX 1
#define mmUVD_RBC_WPTR_POLL_CNTL 0x05d8
#define mmUVD_RBC_WPTR_POLL_CNTL_BASE_IDX 1
#define mmUVD_RBC_WPTR_POLL_ADDR 0x05d9
#define mmUVD_RBC_WPTR_POLL_ADDR_BASE_IDX 1
#define mmUVD_RB_BASE_LO4 0x05df
#define mmUVD_RB_BASE_LO4_BASE_IDX 1
#define mmUVD_RB_BASE_HI4 0x05e0
#define mmUVD_RB_BASE_HI4_BASE_IDX 1
#define mmUVD_RB_SIZE4 0x05e1
#define mmUVD_RB_SIZE4_BASE_IDX 1
#define mmUVD_RB_RPTR4 0x05e2
#define mmUVD_RB_RPTR4_BASE_IDX 1
#endif
| {
"pile_set_name": "Github"
} |
{
"pile_set_name": "Github"
} |
|
<?php
/**
* Zend Framework
*
* LICENSE
*
* This source file is subject to the new BSD license that is bundled
* with this package in the file LICENSE.txt.
* It is also available through the world-wide-web at this URL:
* http://framework.zend.com/license/new-bsd
* If you did not receive a copy of the license and are unable to
* obtain it through the world-wide-web, please send an email
* to [email protected] so we can send you a copy immediately.
*
* @category Zend
* @package Zend_Search_Lucene
* @subpackage Analysis
* @copyright Copyright (c) 2005-2011 Zend Technologies USA Inc. (http://www.zend.com)
* @license http://framework.zend.com/license/new-bsd New BSD License
* @version $Id: CaseInsensitive.php 23775 2011-03-01 17:25:24Z ralph $
*/
/** Zend_Search_Lucene_Analysis_Analyzer_Common_Utf8 */
require_once 'Zend/Search/Lucene/Analysis/Analyzer/Common/Utf8.php';
/** Zend_Search_Lucene_Analysis_TokenFilter_LowerCaseUtf8 */
require_once 'Zend/Search/Lucene/Analysis/TokenFilter/LowerCaseUtf8.php';
/**
* @category Zend
* @package Zend_Search_Lucene
* @subpackage Analysis
* @copyright Copyright (c) 2005-2011 Zend Technologies USA Inc. (http://www.zend.com)
* @license http://framework.zend.com/license/new-bsd New BSD License
*/
class Zend_Search_Lucene_Analysis_Analyzer_Common_Utf8_CaseInsensitive extends Zend_Search_Lucene_Analysis_Analyzer_Common_Utf8
{
public function __construct()
{
parent::__construct();
$this->addFilter(new Zend_Search_Lucene_Analysis_TokenFilter_LowerCaseUtf8());
}
}
| {
"pile_set_name": "Github"
} |
#ifndef __MONO_UTILS_HWCAP_X86_H__
#define __MONO_UTILS_HWCAP_X86_H__
#include "mono/utils/mono-hwcap.h"
extern gboolean mono_hwcap_x86_is_xen;
extern gboolean mono_hwcap_x86_has_cmov;
extern gboolean mono_hwcap_x86_has_fcmov;
extern gboolean mono_hwcap_x86_has_sse1;
extern gboolean mono_hwcap_x86_has_sse2;
extern gboolean mono_hwcap_x86_has_sse3;
extern gboolean mono_hwcap_x86_has_ssse3;
extern gboolean mono_hwcap_x86_has_sse41;
extern gboolean mono_hwcap_x86_has_sse42;
extern gboolean mono_hwcap_x86_has_sse4a;
#endif /* __MONO_UTILS_HWCAP_X86_H__ */
| {
"pile_set_name": "Github"
} |
# JSON Schema Test Suite [](https://github.com/json-schema-org/JSON-Schema-Test-Suite/actions?query=workflow%3A%22Test+Suite+Sanity+Checking%22)
This repository contains a set of JSON objects that implementors of JSON Schema
validation libraries can use to test their validators.
It is meant to be language agnostic and should require only a JSON parser.
The conversion of the JSON objects into tests within your test framework of
choice is still the job of the validator implementor.
## Structure of a Test
The tests in this suite are contained in the `tests` directory at the root of
this repository. Inside that directory is a subdirectory for each draft or
version of the specification.
Inside each draft directory, there are a number of `.json` files and one or more
special subdirectories. The subdirectories contain `.json` files meant for a
specific testing purpose, and each `.json` file logically groups a set of test
cases together. Often the grouping is by property under test, but not always.
The subdirectories are described in the next section.
Inside each `.json` file is a single array containing objects. It's easiest to
illustrate the structure of these with an example:
```json
{
"description": "The description of the test case",
"schema": {
"description": "The schema against which the data in each test is validated",
"type": "string"
},
"tests": [
{
"description": "Test for a valid instance",
"data": "the instance to validate",
"valid": true
},
{
"description": "Test for an invalid instance",
"data": 15,
"valid": false
}
]
}
```
In short: a description, a schema under test, and some tests, where each test
in the `tests` array is an objects with a description of the case itself, the
instance under test, and a boolean indicating whether it should be valid
or invalid.
## Test Subdirectories
There is currently only one subdirectory that may exist within each draft
directory. This is:
1. `optional/`: Contains tests that are considered optional.
## Coverage
Drafts 07, 06, 04, and 03 should have full coverage, with tests for drafts 06,
07, and 2019-09 being considered current and actively supported. Draft 2019-09
is almost fully covered.
Contributions are very welcome, especially from implementers as they add support
to their own implementations.
If you see anything missing from the current supported drafts, or incorrect on
any draft still accepting bug fixes, please
[file an issue](https://github.com/json-schema-org/JSON-Schema-Test-Suite/issues)
or [submit a PR](https://github.com/json-schema-org/JSON-Schema-Test-Suite).
## Who Uses the Test Suite
This suite is being used by:
### Clojure
* [jinx](https://github.com/juxt/jinx)
* [json-schema](https://github.com/tatut/json-schema)
### Coffeescript
* [jsck](https://github.com/pandastrike/jsck)
### Common Lisp
* [json-schema](https://github.com/fisxoj/json-schema)
### C++
* [Modern C++ JSON schema validator](https://github.com/pboettch/json-schema-validator)
### Dart
* [json_schema](https://github.com/patefacio/json_schema)
### Elixir
* [ex_json_schema](https://github.com/jonasschmidt/ex_json_schema)
### Erlang
* [jesse](https://github.com/for-GET/jesse)
### Go
* [gojsonschema](https://github.com/sigu-399/gojsonschema)
* [validate-json](https://github.com/cesanta/validate-json)
### Haskell
* [aeson-schema](https://github.com/timjb/aeson-schema)
* [hjsonschema](https://github.com/seagreen/hjsonschema)
### Java
* [json-schema-validator](https://github.com/daveclayton/json-schema-validator)
* [everit-org/json-schema](https://github.com/everit-org/json-schema)
* [networknt/json-schema-validator](https://github.com/networknt/json-schema-validator)
* [Justify](https://github.com/leadpony/justify)
* [Snow](https://github.com/ssilverman/snowy-json)
### JavaScript
* [json-schema-benchmark](https://github.com/Muscula/json-schema-benchmark)
* [direct-schema](https://github.com/IreneKnapp/direct-schema)
* [is-my-json-valid](https://github.com/mafintosh/is-my-json-valid)
* [jassi](https://github.com/iclanzan/jassi)
* [JaySchema](https://github.com/natesilva/jayschema)
* [json-schema-valid](https://github.com/ericgj/json-schema-valid)
* [Jsonary](https://github.com/jsonary-js/jsonary)
* [jsonschema](https://github.com/tdegrunt/jsonschema)
* [request-validator](https://github.com/bugventure/request-validator)
* [skeemas](https://github.com/Prestaul/skeemas)
* [tv4](https://github.com/geraintluff/tv4)
* [z-schema](https://github.com/zaggino/z-schema)
* [jsen](https://github.com/bugventure/jsen)
* [ajv](https://github.com/epoberezkin/ajv)
* [djv](https://github.com/korzio/djv)
### Node.js
For node.js developers, the suite is also available as an
[npm](https://www.npmjs.com/package/@json-schema-org/tests) package.
Node-specific support is maintained in a [separate
repository](https://github.com/json-schema-org/json-schema-test-suite-npm)
which also welcomes your contributions!
### .NET
* [Newtonsoft.Json.Schema](https://github.com/JamesNK/Newtonsoft.Json.Schema)
* [Manatee.Json](https://github.com/gregsdennis/Manatee.Json)
### Perl
* [JSON::Schema::Draft201909](https://github.com/karenetheridge/JSON-Schema-Draft201909)
* [Test::JSON::Schema::Acceptance](https://github.com/karenetheridge/Test-JSON-Schema-Acceptance)
### PHP
* [json-schema](https://github.com/justinrainbow/json-schema)
* [json-guard](https://github.com/thephpleague/json-guard)
### PostgreSQL
* [postgres-json-schema](https://github.com/gavinwahl/postgres-json-schema)
* [is_jsonb_valid](https://github.com/furstenheim/is_jsonb_valid)
### Python
* [jsonschema](https://github.com/Julian/jsonschema)
* [fastjsonschema](https://github.com/seznam/python-fastjsonschema)
* [hypothesis-jsonschema](https://github.com/Zac-HD/hypothesis-jsonschema)
### Ruby
* [json-schema](https://github.com/hoxworth/json-schema)
* [json_schemer](https://github.com/davishmcclurg/json_schemer)
### Rust
* [jsonschema](https://github.com/Stranger6667/jsonschema-rs)
* [valico](https://github.com/rustless/valico)
### Swift
* [JSONSchema](https://github.com/kylef/JSONSchema.swift)
If you use it as well, please fork and send a pull request adding yourself to
the list :).
## Contributing
If you see something missing or incorrect, a pull request is most welcome!
There are some sanity checks in place for testing the test suite. You can run
them with `bin/jsonschema_suite check` or `tox`. They will be run automatically
by [GitHub Actions](https://github.com/json-schema-org/JSON-Schema-Test-Suite/actions?query=workflow%3A%22Test+Suite+Sanity+Checking%22)
as well.
| {
"pile_set_name": "Github"
} |
<?xml version="1.0" ?>
<tei>
<teiHeader>
<fileDesc xml:id="0"/>
</teiHeader>
<text xml:lang="en">
<front>Information Synthesis for Answer Validation<lb/> Rui Wang 1 and Günter Neumann 2<lb/> 1 Saarland University<lb/> 66123 Saarbrücken, Germany<lb/> [email protected]<lb/> 2 LT-Lab, DFKI<lb/> Stuhlsatzenhausweg 3, 66123 Saarbrücken, Germany<lb/> [email protected]<lb/> Abstract. This report is about our participation in the Answer Validation Exercise (AVE2008).<lb/> Our system casts the AVE task into a Recognizing Textual Entailment (RTE) problem and uses an<lb/> existing RTE system to validate answers. Additional information from named-entity (NE)<lb/> recognizer, question analysis component, and so on, is also considered as assistances to make the<lb/> final decision. In all, we have submitted two runs, one run for English and the other for German.<lb/> They have achieved f-measures of 0.64 and 0.61 respectively. Compared with our system last year,<lb/> which purely depends on the output of the RTE system, the extra information does show its<lb/> effectiveness.<lb/> Keywords: Answer Validation, Recognizing Textual Entailment, Information Synthesis<lb/></front>
<body>
1 Introduction and Related Work<lb/>
Answer Validation is an important step for Question Answering (QA) systems, which aims to validate the<lb/> answers extracted from natural language texts, and select the most proper answers for the final output.<lb/>
Using Recognizing Textual Entailment (RTE-1 – Dagan et al., 2006; RTE-2 – Bar-Haim et al., 2006) to do<lb/> answer validation has shown a great success (Peñas et al., 2007). We also developed our own RTE system and<lb/> participated in AVE2007. The RTE system proposed a new sentence representation extracted from the<lb/> dependency structure, and utilized the Subsequence Kernel method (Bunescu and Mooney, 2006) to perform<lb/> machine learning. We have achieved fairly high results on both the RTE-2 data set (Wang and Neumann, 2007a)<lb/> and the RTE-3 data set (Wang and Neumann, 2007b), especially on Information Extraction (IE) and QA pairs.<lb/> However, on the AVE data sets, we still found much space for the improvement. Therefore, based on the<lb/> system we developed last year, our motivation this year is to see whether using extra information, e.g. named-<lb/>entity (NE) recognition, question analysis, etc., can make further improvement on the final results.<lb/> This report will start with a brief introduction of our RTE system and then followed by the whole AVE<lb/> system. The results of our two submission runs will be shown in section 4, and in the end, we will summarize<lb/> our work.<lb/>
2 The RTE System<lb/>
The RTE system (Wang and Neumann, 2007a; Wang and Neumann, 2007b) is developed for RTE-3 Challenge<lb/> (Giampiccolo et al., 2007). The system contains a main approach with two backup strategies. The main approach<lb/> extracts parts of the dependency structures to form a new representation, named Tree Skeleton, as the feature<lb/> space and then applies Subsequence Kernels to represent TSs and perform Machine Learning. The backup<lb/> strategies will deal with the T-H pairs which cannot be solved by the main approach. One backup strategy is<lb/> called Triple Matcher, as it calculates the overlapping ratio on top of the dependency structures in a triple<lb/> representation; the other is simply a Bag-of-Words (BoW) method, which calculates the overlapping ratio of<lb/> words in T and H.<lb/>
The main approach starts with processing H, since it is usually textually shorter than T, and the dependency<lb/> structure also simpler. Tree skeletons are extracted based on the dependency structures derived by Minipar (Lin,<lb/> 1998) for English and SMES (Neumann and Piskorski, 2002) for German. There are nouns in the lower part of<lb/> the parse tree, and they share a common parent node, which is (usually) a verb in the upper part. Since content<lb/> words usually convey most of the meaning of the sentence, we will mark the nouns as Topic Words and the verb<lb/> as the Root Node. Together with the dependency paths in between, they form a subtree of the original<lb/> dependency structure, which can be viewed as an extended version of Predicate-Argument Structure (Gildea and<lb/> Palmer, 2002). We call the subtree Tree Skeleton, the topic words Foot Nodes, and the dependency path from the<lb/> noun to the root node Spine. If there are two foot nodes, the corresponding spines will be the Left Spine and the<lb/> Right Spine.<lb/>
On top of the tree skeleton of H, the tree skeleton of T can also be extracted. We assume that if the entailment<lb/> holds from T to H, at least, they will share the same topics. Since in practice, there are different expressions for<lb/> the same entity, we have applied some fuzzy matching techniques to correspond the topic words in T and H, like<lb/> initialism, partial matching, etc. Once we successfully identify the topic words in T, we trace up along the<lb/> dependency parse tree to find the lowest common parent node, which will be marked as the root node of the tree<lb/> skeleton of T 1 .<lb/>
After some generalizations, we merge the two tree skeletons by 1) excluding the longest common prefixes for<lb/> left spines and 2) excluding the longest common suffixes for right spines. Finally, we will get the dissimilarity of<lb/> the two tree skeletons and we call it Spine Differences, i.e. Left Spine Difference (LSD) and Right Spine<lb/> Difference (RSD). Then, since all the remaining symbols are POS tags and (generalized) dependency relation<lb/> tags, they altogether form a Closed-Class Symbol (CCS) set. The spine difference is thus a sequence of CCSs. To<lb/> represent it, we have utilized a Subsequence Kernel and a Collocation Kernel (Wang and Neumann, 2007a).<lb/>
We have also considered the comparison between root nodes and their adjacent dependency relations. We<lb/> have observed that some adjacent dependency relations of the root node (e.g. <SUBJ>or <OBJ>) can play<lb/> important roles in predicting the entailment relationship. For instance, the verb "sell" has a direction of the action<lb/> from the subject to the object. In addition, the verb "sell" and "buy" convey totally different semantics.<lb/> Therefore, we assign them two extra simple kernels named Verb Consistence (VC) and Verb Relation<lb/> Consistence (VRC). The former indicates whether two root nodes have a similar meaning, and the latter<lb/> indicates whether the relations are contradictive (e.g. <SUBJ> and <OBJ> are contradictive).<lb/>
Finally, the main approach is assisted by two backup strategies: one is called the Triple Similarity and the<lb/> other is called the BoW Similarity. Chief requirements for the backup strategy are robustness and simplicity.<lb/> Accordingly, we construct a similarity function, which operates on two triple (dependency structure represented<lb/> in the form of <head, relation, modifier>) sets and determines how many triples of H are contained in T. The<lb/> core assumption here is that the higher the number of matching triple elements, the more similar both sets are,<lb/> and the more likely it is that T entails H. The function uses an approximate matching function. Different cases<lb/> (i.e. ignoring either the parent node or the child node, or the relation between nodes) might provide different<lb/> indications for the similarity of T and H. We then sum them up using different weights and divide the result by<lb/> the cardinality of H for normalization. The BoW similarity score is calculated by dividing the number of<lb/> overlapping words between T and H by the total number of words in H after a simple tokenization according to<lb/> the space between words.<lb/>
<note place="footnote">1 The Root Node of T is not necessary to be a verb, instead, it could be a noun, a preposition, or even a dependency relation.<lb/></note>
3<lb/> The AVE System<lb/>
Fig. 1.
Our AVE system uses the RTE system (Tera – Textual Entailment Recognition for Application) as a core component.<lb/> The preprocessing module mainly adapts questions, their corresponding answers, and supporting documents into Text (T)-<lb/>Hypothesis (H) pairs, assisted by some manually designed patterns. The post-processing module (i.e. the Answer Validation<lb/> in the picture) will validate each answer and select a most proper one based on the output of the RTE system. The new<lb/> modules added are the NE Recognition and Question Analysis. Thus, we will have extra information like NEs in the answers,<lb/> Expected Answer Types (EATs), etc.<lb/>
3.1 Preprocessing and Post-processing<lb/>
Since the input of the AVE task is a list of questions, their corresponding answers and the documents containing<lb/> these answers, we need to adapt them into T-H pairs for the RTE system. For instance, the question is,<lb/> How many "Superside" world championships did Steve Webster win between 1987 and 2004?<lb/> (id=87) 2<lb/>
The QA system gives out several candidate answers to this question, as follows,<lb/> ten (id=87_1)<lb/> 24 (id=87_2)<lb/> …
Each answer will have one supporting document where the answer comes from, like this,<lb/> The most successful sidecar racer in Superside has been Steve Webster MBE, who has won ten<lb/> world championships between 1987 and 2004. (id=87_1)<lb/>
The assumption here is that if the answer is relevant to the question, the document which contains the answer<lb/> should entail the statement derived by combining the question and the answer. This section will mainly focus on<lb/> the combination of the question and the answer and in the next sections the RTE system and how to deal with the<lb/> output of the system will be described.<lb/>
In order to combine the question and the answer into a statement, we need some language patterns. Normally,<lb/> we have different types of questions, such as Who-questions asking about persons, What-questions asking about<lb/> definitions, etc. Therefore, we manually construct some language patterns for the input questions. For the<lb/> example given above (id=87), we will apply the following pattern,<lb/> Steve Webster won <Answer> "Superside" world championships between 1987 and 2004.<lb/> (id=87)<lb/>
Consequently, we substitute the <Answer> by each candidate answer to form Hs – hypotheses. Since the<lb/> supporting documents are naturally the Ts – texts, the T-H pairs are built up accordingly,<lb/> Id: 87_1<lb/> Entailment: Unknown<lb/> Text: The most successful sidecar racer in Superside has been Steve Webster MBE, who has<lb/> won ten world championships between 1987 and 2004.<lb/> Hypothesis: Steve Webster won ten "Superside" world championships between 1987 and 2004.<lb/>
These T-H pairs can be the input for any generic RTE systems. In practice, after applying our RTE system, if<lb/> the T-H pairs are covered by our main approach, we will directly use the answers; if not, we will use a threshold<lb/>
<note place="footnote">2 The "id" comes from AVE 2008 test data, i.e. "AVE2008-annotated-test-EN.xml".<lb/></note>
to decide the answer based on the two similarity scores. Therefore, every T-H pair has a triple similarity score<lb/> and a BoW similarity score, and for some of the T-H pairs, we directly know whether the entailment holds. The<lb/> post-processing is straightforward, the "YES" entailment cases will be validated answers and the "NO"<lb/> entailment cases will be rejected answers. In addition, the selected answers (i.e. the best answers) will naturally<lb/> be the pairs covered by our main approach or (if not,) with the highest similarity scores.<lb/>
3.2 Additional Components<lb/>
The RTE system is used as a core component of the AVE system. Based on the error analysis of last year's<lb/> results, this year we use additional components to filter out noisy candidates. Therefore, two extra components<lb/> are added to the architecture, the NE recognizer and the question analyzer. For NE recognition, we use<lb/> StanfordNER (Finkel et al., 2005) for English and SPPC (Neumann and Piskorski, 2002) for German; and for<lb/> question analysis, we use the SMES system (Neumann and Piskorski, 2002). The detailed workflow is as follows,<lb/>
1. Annotate NEs in H, store them in an NE list; if the answer is an NE, store the NE type as A'_Type;<lb/>
2. Analyze the question and obtain expected answer type, store it as A_Type;<lb/>
3. Synthesize all the information, i.e. NE list, A_Type, A'_Type, BoW similarity, Triple similarity, etc.<lb/> As for the example mentioned above (id=87), the additional information will be,<lb/> NE list: Steve Webster (person), 1987 (date), 2004 (date);<lb/> A_Type: Number<lb/> A'_Type: Number<lb/>
Then, heuristic rules are straightforward to be applied, e.g. checking the consistence between<lb/> A_Type and A'_Type, checking whether all (or how many of) the NEs also appear in the documents,<lb/> etc. All these results together with the outputs of the RTE system will be synthesized to make the final<lb/> decision.<lb/>
4 Results<lb/>
We have submitted two runs for this year's AVE tasks, one for English and one for German. In the following, we<lb/> will first show the table of the results and then present an error analysis.<lb/>
Table 1. Results of our submissions compared with last year's<lb/>
Submission Runs<lb/> Recall Precision<lb/> F-measure<lb/> Estimated QA<lb/> Performance<lb/> QA Accuracy<lb/> 100% VALIDATED (EN)<lb/> 1 0.08<lb/> 0.14<lb/> N/A<lb/> N/A<lb/> 50%VALIDATED (EN)<lb/> 0.5<lb/> 0.08<lb/> 0.13<lb/> N/A<lb/> N/A<lb/> Perfect Selection (EN)<lb/> N/A<lb/> N/A<lb/> N/A<lb/> 0.56<lb/> 0.34<lb/> Best QA System (EN)<lb/> N/A<lb/> N/A<lb/> N/A<lb/> 0.21<lb/> 0.21<lb/> dfki07-run1 (EN)<lb/> 0.62<lb/> 0.37<lb/> 0.46<lb/> N/A<lb/> 0.16<lb/> dfki07-run2 (EN)<lb/> 0.71<lb/> 0.44<lb/> 0.55<lb/> N/A<lb/> 0.21<lb/> dfki08run1 (EN)<lb/> 0.78<lb/> 0.54<lb/> 0.64<lb/> 0.34<lb/> 0.24<lb/> 100% VALIDATED(DE)<lb/> 1 0.12<lb/> 0.21<lb/> N/A<lb/> N/A<lb/> 50% VALIDATED (DE)<lb/> 0.5<lb/> 0.12<lb/> 0.19<lb/> N/A<lb/> N/A<lb/> Perfect Selection (DE)<lb/> N/A<lb/> N/A<lb/> N/A<lb/> 0.77<lb/> 0.52<lb/> Best QA System (DE)<lb/> N/A<lb/> N/A<lb/> N/A<lb/> 0.38<lb/> 0.38<lb/> dfki08run1 (DE)<lb/> 0.71<lb/> 0.54<lb/> 0.61<lb/> 0.52<lb/> 0.43<lb/>
In the table, we notice that both for English and German, our validation system outperforms the best QA<lb/> systems, which suggests the necessity of the validation step. Although there is a gap between the system<lb/> performance and the perfect selection, the results are quite satisfactory. If we compare this year's results with<lb/> last year's, the additional information does improve the results significantly.<lb/>
Comparing the recall and precision, for both languages, the latter is worse. Therefore, we did some error<lb/> analysis to see whether there is still some space for improvements. An interesting example in the English data is<lb/> as follows,<lb/> Question: What is the name of the best known piece by Jeremiah Clarke? (id=0011)<lb/> Answer: a rondo (id=0011_7)<lb/> Document: The most famous piece known by that name, however, is a composition by<lb/> Jeremiah Clarke, properly a rondo for keyboard named Prince of Denmark's March.<lb/>
Our system wrongly validated this answer, because "a rondo" is not the name of that music work. In fact,<lb/> what we need here is a special proper name recognizer which can differentiate whether the noun is a name for a<lb/> music work.<lb/>
In the German data, other kinds of errors occur. For instance,<lb/> Question: Wer war Russlands Verteidigungsminister 1994? (id=0020 3 )<lb/> Answer: Pawel Gratschow (id=0020_6)<lb/> Document: Wie der russische Verteidigungsminister Pawel Gratschow am Mittwoch in Tiflis<lb/> weiter bekanntgab, will Rußland insgesamt fünf Militärstützpunkte in den Kaukasus-<lb/>Republiken Georgien, Armenien und Aserbaidschan einrichten. 1994-02-02<lb/>
The key problem here is that the year "1994" in the document might not be the year when the event happened,<lb/> but the year of the report. This asks us to further synthesize the information we have, i.e. NE annotation and<lb/> dependency parsing, to make better use of them.<lb/>
5 Conclusion and Future Work<lb/>
To sum up, in this paper, we described our participation of AVE 2008. Based on the experience of last year's<lb/> participation, apart from the RTE core system, we add two extra components, NE recognizer and question<lb/> analyzer, to further improve the results. The strategy is quite successful according to the comparison of system<lb/> performances.<lb/>
However, the problem has not been fully solved. Due to the noisy web data, filtering some documents in the<lb/> preprocessing step could be even more effective than working on the post-processing phase. Another direction<lb/> considered by us is to take a closer look at the different performances between different languages.<lb/>
</body>
<back>
<listBibl>
References<lb/>
1 Bar-Haim, R., Dagan, I., Dolan, B., Ferro, L., Giampiccolo, D., Magnini, B. and Szpektor, I. 2006. The Second PASCAL<lb/> Recognising Textual Entailment Challenge. In Proceedings of the Second PASCAL Challenges Workshop on<lb/> Recognising Textual Entailment, Venice, Italy.<lb/>
2 Bunescu, R. and Mooney, R. 2006. Subsequence Kernels for Relation Extraction. In Advances in Neural Information<lb/> Processing Systems 18. MIT Press.<lb/>
3 Dagan, I., Glickman, O., and Magnini, B. 2006. The PASCAL Recognising Textual Entailment Challenge. In Quiñonero-<lb/>Candela et al., editors, MLCW 2005, LNAI Volume 3944, pages 177-190. Springer-Verlag.<lb/>
4 Jenny Rose Finkel, Trond Grenager, and Christopher Manning. 2005. Incorporating Non-local Information into<lb/> Information Extraction Systems by Gibbs Sampling. Proceedings of the 43nd Annual Meeting of the Association for<lb/> Computational Linguistics (ACL 2005), pp. 363-370.<lb/>
5 Giampiccolo, D., Magnini, B., Dagan, I., and Dolan, B. 2007. The Third PASCAL Recognizing Textual Entailment<lb/> Challenge. In Proceedings of the Workshop on Textual Entailment and Paraphrasing, pages 1–9, Prague, June 2007.<lb/>
6 Gildea, D. and Palmer, M. 2002. The Necessity of Parsing for Predicate Argument Recognition. In Proceedings of the<lb/> 40th Meeting of the Association for Computational Linguistics (ACL 2002):239-246, Philadelphia, PA.<lb/>
7 Lin, D. 1998. Dependency-based Evaluation of MINIPAR. In Workshop on the Evaluation of Parsing Systems.<lb/>
8 Neumann, G. and Piskorski, J. 2002. A Shallow Text Processing Core Engine. Journal of Computational Intelligence,<lb/> Volume 18, Number 3, 2002, pages 451-476.<lb/>
9 Anselmo Peñas, Álvaro Rodrigo, Felisa Verdejo. 2007. Overview of the Answer Validation Exercise 2007. In the CLEF<lb/> 2007 Working Notes.<lb/>
10 Wang, R. and Neumann, G. 2007a. Recognizing Textual Entailment Using a Subsequence Kernel Method. In Proc. of<lb/> AAAI 2007.<lb/>
11 Wang, R. and Neumann, G. 2007b. Recognizing Textual Entailment Using Sentence Similarity based on Dependency<lb/> Tree Skeletons. In Proceedings of the Workshop on Textual Entailment and Paraphrasing, pages 36–41, Prague, June<lb/> 2007.<lb/>
12 Wang, R. and Neumann, G. 2007c. DFKI–LT at AVE 2007: Using Recognizing Textual Entailment for Answer<lb/> Validation. In online proceedings of CLEF 2007 Working Notes, ISBN: 2-912335-31-0, September 2007, Budapest,<lb/> Hungary.<lb/>
</listBibl>
<note place="footnote">3 This "id" comes from "AVE2008-annotated-test-DE.xml".</note>
</back>
</text>
</tei>
| {
"pile_set_name": "Github"
} |
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: $RCSfile$
Language: C++
Date: $Date$
Version: $Revision$
Copyright (c) Insight Software Consortium. All rights reserved.
See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notices for more information.
=========================================================================*/
#ifndef __itkPointSetToImageFilter_h
#define __itkPointSetToImageFilter_h
#include "itkImageSource.h"
#include "itkConceptChecking.h"
namespace itk
{
/** \class PointSetToImageFilter
* \brief Base class for filters that take a PointSet
* as input and produce an image as output.
* By default, if the user does not specify the size of the output image,
* the maximum size of the point-set's bounding box is used.
*/
template <class TInputPointSet, class TOutputImage>
class ITK_EXPORT PointSetToImageFilter : public ImageSource<TOutputImage>
{
public:
/** Standard class typedefs. */
typedef PointSetToImageFilter Self;
typedef ImageSource<TOutputImage> Superclass;
typedef SmartPointer<Self> Pointer;
typedef SmartPointer<const Self> ConstPointer;
typedef typename TOutputImage::SizeType SizeType;
typedef TOutputImage OutputImageType;
typedef typename OutputImageType::Pointer OutputImagePointer;
typedef typename OutputImageType::ValueType ValueType;
/** Method for creation through the object factory. */
itkNewMacro(Self);
/** Run-time type information (and related methods). */
itkTypeMacro(PointSetToImageFilter,ImageSource);
/** Superclass typedefs. */
typedef typename Superclass::OutputImageRegionType OutputImageRegionType;
/** Some convenient typedefs. */
typedef TInputPointSet InputPointSetType;
typedef typename InputPointSetType::Pointer InputPointSetPointer;
typedef typename InputPointSetType::ConstPointer InputPointSetConstPointer;
/** Dimension constants */
itkStaticConstMacro(InputPointSetDimension, unsigned int,
InputPointSetType::PointDimension);
itkStaticConstMacro(OutputImageDimension, unsigned int,
TOutputImage::ImageDimension);
/** Image spacing and origin typedefs */
typedef typename TOutputImage::SpacingType SpacingType;
typedef typename TOutputImage::PointType PointType;
/** Set/Get the input point-set of this process object. */
virtual void SetInput( const InputPointSetType *pointset);
virtual void SetInput( unsigned int, const InputPointSetType * pointset);
const InputPointSetType * GetInput(void);
const InputPointSetType * GetInput(unsigned int idx);
/** Set the spacing (size of a pixel) of the image. The
* spacing is the geometric distance between image samples.
* It is stored internally as double, but may be set from
* float. \sa GetSpacing() */
itkSetMacro(Spacing,SpacingType);
virtual void SetSpacing( const double* spacing);
virtual void SetSpacing( const float* spacing);
/** Get the spacing (size of a pixel) of the image. The
* spacing is the geometric distance between image samples.
* The value returned is a pointer to a double array.
* For ImageBase and Image, the default data spacing is unity. */
itkGetConstReferenceMacro(Spacing,SpacingType);
/** Set the origin of the image. The origin is the geometric
* coordinates of the image origin. It is stored internally
* as double but may be set from float.
* \sa GetOrigin() */
itkSetMacro(Origin,PointType);
virtual void SetOrigin( const double* origin);
virtual void SetOrigin( const float* origin);
/** Get the origin of the image. The origin is the geometric
* coordinates of the index (0,0). The value returned is a pointer
* to a double array. For ImageBase and Image, the default origin is
* 0. */
itkGetConstReferenceMacro(Origin,PointType);
/** Set/Get the value for pixels in the point-set.
* By default, this filter will return an image
* that contains values from the point-set specified as input.
* If this "inside" value is changed to a non-null value,
* the output produced by this filter will be a mask with inside/outside values
* specified by the user. */
itkSetMacro(InsideValue, ValueType);
itkGetMacro(InsideValue, ValueType);
/** Set/Get the value for pixels outside the point-set.
* By default, this filter will return an image
* that contains values from the point specified as input.
* If this "outside" value is changed to a non-null value,
* the output produced by this filter will be a mask with inside/outside values
* specified by the user. */
itkSetMacro(OutsideValue, ValueType);
itkGetMacro(OutsideValue, ValueType);
/** Set/Get Size */
itkSetMacro(Size,SizeType);
itkGetMacro(Size,SizeType);
protected:
PointSetToImageFilter();
~PointSetToImageFilter();
virtual void GenerateOutputInformation(){}; // do nothing
virtual void GenerateData();
SizeType m_Size;
SpacingType m_Spacing;
PointType m_Origin;
ValueType m_InsideValue;
ValueType m_OutsideValue;
virtual void PrintSelf(std::ostream& os, Indent indent) const;
private:
PointSetToImageFilter(const Self&); //purposely not implemented
void operator=(const Self&); //purposely not implemented
};
} // end namespace itk
#ifndef ITK_MANUAL_INSTANTIATION
#include "itkPointSetToImageFilter.txx"
#endif
#endif
| {
"pile_set_name": "Github"
} |
(ns benchmarks.readline
(:require [pixie.time :as time]
[pixie.io :as io]
[pixie.streams.utf8 :as utf8]))
(def file-name "/usr/share/dict/words")
(println "Lazy line-seq")
(time/time
(->> file-name
(io/open-read)
(io/buffered-input-stream)
(io/line-seq)
(count)))
(println "Reducing line-reader")
(time/time
(->> file-name
(io/open-read)
(io/buffered-input-stream)
(io/line-reader)
(into [])
(count)))
(println "Lazy UTF8 line-seq")
(time/time
(->> file-name
(io/open-read)
(io/buffered-input-stream)
(utf8/utf8-input-stream)
(io/line-seq)
(count)))
(println "Reducing UTF8 line-reader")
(time/time
(->> file-name
(io/open-read)
(io/buffered-input-stream)
(utf8/utf8-input-stream)
(io/line-reader)
(into [])
(count)))
| {
"pile_set_name": "Github"
} |
# Copyright 2015 The TensorFlow Authors. All Rights Reserved.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
# ==============================================================================
"""Functional tests for aggregate operations."""
from __future__ import absolute_import
from __future__ import division
from __future__ import print_function
import numpy as np
from tensorflow.python.framework import constant_op
from tensorflow.python.framework import dtypes
from tensorflow.python.framework import ops
from tensorflow.python.ops import embedding_ops
from tensorflow.python.ops import math_ops
from tensorflow.python.ops import resource_variable_ops
from tensorflow.python.ops import variable_scope
from tensorflow.python.ops import variables
from tensorflow.python.platform import test
from tensorflow.python.training import adagrad
class AdagradOptimizerTest(test.TestCase):
def doTestBasic(self, use_locking=False, use_resource=False):
for dtype in [dtypes.half, dtypes.float32, dtypes.float64]:
with self.test_session():
if use_resource:
var0 = resource_variable_ops.ResourceVariable([1.0, 2.0], dtype=dtype)
var1 = resource_variable_ops.ResourceVariable([3.0, 4.0], dtype=dtype)
else:
var0 = variables.Variable([1.0, 2.0], dtype=dtype)
var1 = variables.Variable([3.0, 4.0], dtype=dtype)
grads0 = constant_op.constant([0.1, 0.1], dtype=dtype)
grads1 = constant_op.constant([0.01, 0.01], dtype=dtype)
ada_opt = adagrad.AdagradOptimizer(
3.0, initial_accumulator_value=0.1, use_locking=use_locking)
ada_update = ada_opt.apply_gradients(
zip([grads0, grads1], [var0, var1]))
variables.global_variables_initializer().run()
# Fetch params to validate initial values
self.assertAllClose([1.0, 2.0], var0.eval())
self.assertAllClose([3.0, 4.0], var1.eval())
# Run 3 steps of adagrad
for _ in range(3):
ada_update.run()
# Validate updated params
self.assertAllCloseAccordingToType(
np.array([-1.6026098728179932, -0.6026098728179932]), var0.eval())
self.assertAllCloseAccordingToType(
np.array([2.715679168701172, 3.715679168701172]), var1.eval())
def testBasic(self):
self.doTestBasic(use_locking=False)
def testBasicResource(self):
self.doTestBasic(use_locking=False, use_resource=True)
def testBasicLocked(self):
self.doTestBasic(use_locking=True)
def testMinimizeSparseResourceVariable(self):
for dtype in [dtypes.half, dtypes.float32, dtypes.float64]:
with self.test_session():
var0 = resource_variable_ops.ResourceVariable(
[[1.0, 2.0], [3.0, 4.0]], dtype=dtype)
x = constant_op.constant([[4.0], [5.0]], dtype=dtype)
pred = math_ops.matmul(embedding_ops.embedding_lookup([var0], [0]), x)
loss = pred * pred
sgd_op = adagrad.AdagradOptimizer(1.0).minimize(loss)
variables.global_variables_initializer().run()
# Fetch params to validate initial values
self.assertAllCloseAccordingToType(
[[1.0, 2.0], [3.0, 4.0]], var0.eval())
# Run 1 step of sgd
sgd_op.run()
# Validate updated params
self.assertAllCloseAccordingToType(
[[0, 1], [3, 4]], var0.eval(), atol=0.01)
def testTensorLearningRate(self):
for dtype in [dtypes.half, dtypes.float32, dtypes.float64]:
with self.test_session():
var0 = variables.Variable([1.0, 2.0], dtype=dtype)
var1 = variables.Variable([3.0, 4.0], dtype=dtype)
grads0 = constant_op.constant([0.1, 0.1], dtype=dtype)
grads1 = constant_op.constant([0.01, 0.01], dtype=dtype)
ada_opt = adagrad.AdagradOptimizer(
constant_op.constant(3.0), initial_accumulator_value=0.1)
ada_update = ada_opt.apply_gradients(
zip([grads0, grads1], [var0, var1]))
variables.global_variables_initializer().run()
# Fetch params to validate initial values
self.assertAllClose([1.0, 2.0], var0.eval())
self.assertAllClose([3.0, 4.0], var1.eval())
# Run 3 steps of adagrad
for _ in range(3):
ada_update.run()
# Validate updated params
self.assertAllCloseAccordingToType(
np.array([-1.6026098728179932, -0.6026098728179932]), var0.eval())
self.assertAllCloseAccordingToType(
np.array([2.715679168701172, 3.715679168701172]), var1.eval())
def testSparseBasic(self):
for dtype in [dtypes.half, dtypes.float32, dtypes.float64]:
with self.test_session():
var0 = variables.Variable([[1.0], [2.0]], dtype=dtype)
var1 = variables.Variable([[3.0], [4.0]], dtype=dtype)
grads0 = ops.IndexedSlices(
constant_op.constant(
[0.1], shape=[1, 1], dtype=dtype),
constant_op.constant([0]),
constant_op.constant([2, 1]))
grads1 = ops.IndexedSlices(
constant_op.constant(
[0.01], shape=[1, 1], dtype=dtype),
constant_op.constant([1]),
constant_op.constant([2, 1]))
ada_opt = adagrad.AdagradOptimizer(3.0, initial_accumulator_value=0.1)
ada_update = ada_opt.apply_gradients(
zip([grads0, grads1], [var0, var1]))
variables.global_variables_initializer().run()
# Fetch params to validate initial values
self.assertAllClose([[1.0], [2.0]], var0.eval())
self.assertAllClose([[3.0], [4.0]], var1.eval())
# Run 3 step of sgd
for _ in range(3):
ada_update.run()
# Validate updated params
self.assertAllCloseAccordingToType(
np.array([[-1.6026098728179932], [2.0]]), var0.eval())
self.assertAllCloseAccordingToType(
np.array([[3.0], [3.715679168701172]]), var1.eval())
def testSparseRepeatedIndices(self):
for dtype in [dtypes.half, dtypes.float32, dtypes.float64]:
with self.test_session():
repeated_index_update_var = variables.Variable(
[[1.0], [2.0]], dtype=dtype)
aggregated_update_var = variables.Variable(
[[1.0], [2.0]], dtype=dtype)
grad_repeated_index = ops.IndexedSlices(
constant_op.constant(
[0.1, 0.1], shape=[2, 1], dtype=dtype),
constant_op.constant([1, 1]),
constant_op.constant([2, 1]))
grad_aggregated = ops.IndexedSlices(
constant_op.constant(
[0.2], shape=[1, 1], dtype=dtype),
constant_op.constant([1]),
constant_op.constant([2, 1]))
repeated_update = adagrad.AdagradOptimizer(3.0).apply_gradients(
[(grad_repeated_index, repeated_index_update_var)])
aggregated_update = adagrad.AdagradOptimizer(3.0).apply_gradients(
[(grad_aggregated, aggregated_update_var)])
variables.global_variables_initializer().run()
self.assertAllClose(aggregated_update_var.eval(),
repeated_index_update_var.eval())
for _ in range(3):
repeated_update.run()
aggregated_update.run()
self.assertAllClose(aggregated_update_var.eval(),
repeated_index_update_var.eval())
def testSparseRepeatedIndicesResourceVariable(self):
for dtype in [dtypes.half, dtypes.float32, dtypes.float64]:
with self.test_session():
var_repeated = resource_variable_ops.ResourceVariable(
[1.0, 2.0], dtype=dtype)
loss_repeated = math_ops.reduce_sum(
embedding_ops.embedding_lookup(var_repeated, [0, 0]))
var_aggregated = resource_variable_ops.ResourceVariable(
[1.0, 2.0], dtype=dtype)
loss_aggregated = 2 * math_ops.reduce_sum(
embedding_ops.embedding_lookup(var_aggregated, [0]))
update_op_repeated = adagrad.AdagradOptimizer(
2.0).minimize(loss_repeated)
update_op_aggregated = adagrad.AdagradOptimizer(
2.0).minimize(loss_aggregated)
variables.global_variables_initializer().run()
self.assertAllCloseAccordingToType(
var_repeated.eval(), var_aggregated.eval())
for _ in range(3):
update_op_repeated.run()
update_op_aggregated.run()
self.assertAllCloseAccordingToType(
var_repeated.eval(), var_aggregated.eval())
def testSparseStability(self):
for dtype in [dtypes.half, dtypes.float32, dtypes.float64]:
with self.test_session():
shape = [1, 6]
var0 = variables.Variable(
[[
0.00872496, -0.106952, 0.110467, 0.226505, -0.0147257,
-0.0105945
]],
dtype=dtype)
grads0 = ops.IndexedSlices(
constant_op.constant(
[[
-5.91278e-05, 5.31673e-05, -2.5779e-06, 4.29153e-05,
-8.4877e-05, -9.48906e-05
]],
shape=shape,
dtype=dtype),
constant_op.constant([0]),
constant_op.constant(shape))
ada_opt = adagrad.AdagradOptimizer(1.0, initial_accumulator_value=0.1)
ada_update = ada_opt.apply_gradients(zip([grads0], [var0]))
self.assertEqual(["accumulator"], ada_opt.get_slot_names())
slot0 = ada_opt.get_slot(var0, "accumulator")
init = variables.global_variables_initializer()
for _ in range(100):
init.run()
ada_update.run()
self.assertAllCloseAccordingToType(
np.array([[0.1, 0.1, 0.1, 0.1, 0.1, 0.1]]), slot0.eval())
self.assertAllCloseAccordingToType(
np.array([[
0.00891194, -0.10712013, 0.11047515, 0.22636929, -0.0144573,
-0.01029443
]]), var0.eval())
def testSharing(self):
for dtype in [dtypes.half, dtypes.float32, dtypes.float64]:
with self.test_session():
var0 = variables.Variable([1.0, 2.0], dtype=dtype)
var1 = variables.Variable([3.0, 4.0], dtype=dtype)
grads0 = constant_op.constant([0.1, 0.1], dtype=dtype)
grads1 = constant_op.constant([0.01, 0.01], dtype=dtype)
ada_opt = adagrad.AdagradOptimizer(3.0)
# Apply the optimizer twice. Both applications will use
# the same accums.
ada_update1 = ada_opt.apply_gradients(
zip([grads0, grads1], [var0, var1]))
ada_update2 = ada_opt.apply_gradients(
zip([grads0, grads1], [var0, var1]))
self.assertEqual(["accumulator"], ada_opt.get_slot_names())
slot0 = ada_opt.get_slot(var0, "accumulator")
self.assertEquals(slot0.get_shape(), var0.get_shape())
slot1 = ada_opt.get_slot(var1, "accumulator")
self.assertEquals(slot1.get_shape(), var1.get_shape())
variables.global_variables_initializer().run()
# Fetch params to validate initial values.
self.assertAllClose([1.0, 2.0], var0.eval())
self.assertAllClose([3.0, 4.0], var1.eval())
# Mix the first and the second adagrad for 3 steps.
ada_update1.run()
ada_update2.run()
ada_update1.run()
# Validate updated params (the same as with only 1 Adagrad).
self.assertAllCloseAccordingToType(
np.array([-1.6026098728179932, -0.6026098728179932]), var0.eval())
self.assertAllCloseAccordingToType(
np.array([2.715679168701172, 3.715679168701172]), var1.eval())
def testDynamicShapeVariable_Ok(self):
with self.test_session():
v = variable_scope.get_variable("v", initializer=constant_op.constant(1.),
validate_shape=False)
self.assertFalse(v.shape.is_fully_defined())
# Creating optimizer should cause no exception.
adagrad.AdagradOptimizer(3.0, initial_accumulator_value=0.1)
if __name__ == "__main__":
test.main()
| {
"pile_set_name": "Github"
} |
<?php
/**
* Controller that connects the front-end to the back-end
*/
require_once 'autoload.php';
require_once 'Cosmo.class.php';
$Cosmo = new Cosmo($pdo, $prefix, $salt);
$method = $_SERVER['REQUEST_METHOD']; # GET, POST, PUT, or DELETE
$uri = substr($_SERVER['REQUEST_URI'], 5 + strlen(FOLDER)); # remove '/api/' and prefix - (strlen($prefix) +)
$uri = explode('?', $uri); // Separate GET parameters
$segments = explode('/', $uri[0]);
$HTTPHeaderCode = 200;
$role = '';
// Check permissions for autorized requests
if(isset($_SERVER['HTTP_USERSID']) && $_SERVER['HTTP_USERSID']
&& isset($_SERVER['HTTP_TOKEN']) && $_SERVER['HTTP_TOKEN'])
{
if($Cosmo->tokensRead($_SERVER['HTTP_USERSID'], $_SERVER['HTTP_TOKEN'])){
$usersID = $_SERVER['HTTP_USERSID'];
$username = $_SERVER['HTTP_USERNAME'];
$roleRecord = $Cosmo->usersRead($usersID);
$role = $roleRecord['role'];
}
}
function checkPermissions($action, $publishedStatus=null, $url=null)
{
global $Cosmo;
global $username;
global $role;
// Admins can do anything. Skip permission checking
if($role === 'admin')
return true;
switch($action)
{
case 'createPage':
switch($role)
{
case 'editor':
$return = true;
break;
case 'author':
$return = true;
break;
case 'contributor': // Contributor's can't publish their own work. Must be set to draft mode
if($publishedStatus === 'draft')
$return = true;
else
$return = false;
break;
default:
$return = false;
break;
}
break;
case 'editPage':
switch($role)
{
case 'editor':
$return = true;
break;
case 'author':
$authorRecord = $Cosmo->contentRead($url);
$author = $authorRecord['author'];
if($author === $username)
$return = true;
else
$return = false;
break;
case 'contributor':
$content = $Cosmo->contentRead($url);
if($content['author'] === $username && $publishedStatus === 'draft')
$return = true;
else
$return = false;
break;
default:
$return = false;
break;
}
break;
case 'deletePage':
switch($role)
{
case 'editor':
$return = true;
break;
case 'author':
$authorRecord = $Cosmo->contentRead($url);
$author = $authorRecord['author'];
if($author === $username)
$return = true;
else
$return = false;
break;
case 'contributor':
$return = false;
break;
default:
$return = false;
break;
}
break;
default:
break;
}
return $return;
};
// Angular sends Data as JSON. jQuery and others don't. Accept both formats
switch($method)
{
case 'POST':
if(!$_POST)
$_POST = json_decode(file_get_contents("php://input"), TRUE);
break;
case 'PUT':
$_PUT = json_decode(file_get_contents("php://input"), TRUE);
break;
case 'DELETE':
break;
case 'GET':
break;
default:
break;
}
// Set HTTP error codes and return an error message
function error($code)
{
switch($code)
{
case 405:
header('HTTP/1.1 405 Method Not Allowed');
$message = array('error' => "This method is not allowed. You probably used the wrong verb (GET, POST, PUT, or DELETE) or you included/omitted an id parameter.");
break;
}
return $message;
}
switch($segments[0])
{
##################################################
# Blocks #
##################################################
case 'blocks':
switch($method)
{
case 'GET':
$url = isset($_GET['url']) ? $_GET['url'] : '';
$type = isset($_GET['type']) ? $_GET['type'] : '';
if(isset($segments[2]) && $segments[2] === 'requirements')
$response = $Cosmo->blocksRequirementsRead($segments[1]);
else if(isset($segments[1]))
$response['html'] = $Cosmo->blocksRead($segments[1]);
else if($type || $url)
$response = $Cosmo->blocksRead(NULL, $type, $url);
else
$response = $Cosmo->blocksRead();
break;
case 'POST':
if($role === 'admin')
{
$type = isset($_POST['type']) ? $_POST['type'] : '';
$requirement = isset($_POST['requirement']) ? $_POST['requirement'] : '';
$name = isset($_POST['name']) ? $_POST['name'] : '';
if(isset($segments[2]))
$response = $Cosmo->blocksRequirementsCreate($segments[1], $type, $requirement);
else
$response = $Cosmo->blocksCreate($name);
}
break;
case 'PUT':
if($role === 'admin')
{
$blockID = isset($_PUT['blockID']) ? $_PUT['blockID'] : '';
$type = isset($_PUT['type']) ? $_PUT['type'] : '';
$requirement = isset($_PUT['requirement']) ? $_PUT['requirement'] : '';
$name = isset($_PUT['name']) ? $_PUT['name'] : '';
$block = isset($_PUT['block']) ? $_PUT['block'] : '';
$priority = isset($_PUT['priority']) ? $_PUT['priority'] : '';
$area = isset($_PUT['area']) ? $_PUT['area'] : '';
if(isset($segments[3]))
$response = $Cosmo->blocksRequirementsUpdate($segments[3], $blockID, $type, $requirement);
else if(isset($segments[1]))
$response = $Cosmo->blocksUpdate($name, $block, $priority, $area, $segments[1]);
else
$response = error(405);
}
break;
case 'DELETE':
if($role === 'admin')
{
if(isset($segments[2]) && $segments[2] === 'requirements')
$response = $Cosmo->blocksRequirementsDelete ($segments[1]);
else if(isset($segments[1]))
$response = $Cosmo->blocksDelete($segments[1]);
else
$response = error(405);
}
break;
}
break;
##################################################
# Comments #
##################################################
case 'comments':
switch($method)
{
case 'GET':
$id = isset($_GET['id']) ? $_GET['id'] : '';
$response = $Cosmo->commentsRead($id);
break;
case 'POST':
$content_id = isset($_POST['content_id']) ? $_POST['content_id'] : '';
$path = isset($_POST['path']) ? $_POST['path'] : '';
$name = isset($_POST['name']) ? $_POST['name'] : '';
$email = isset($_POST['email']) ? $_POST['email'] : '';
$comment = isset($_POST['comment']) ? $_POST['comment'] : '';
$response = $Cosmo->commentsCreate($content_id, $path, $name, $email, $comment);
break;
case 'PUT':
$id = isset($_PUT['id']) ? $_PUT['id'] : '';
$comment = isset($_PUT['comment']) ? $_PUT['comment'] : '';
$response = $Cosmo->commentsUpdate($id, $comment);
break;
case 'DELETE':
$response = $Cosmo->commentsDelete($segments[1]);
break;
}
break;
##################################################
# Content #
##################################################
case 'content':
switch($method)
{
case 'GET':
if(count($segments) > 3 && $segments[2] === 'revisions')
$response = $Cosmo->revisionsRead($segments[3]);
else if(count($segments) > 2 && $segments[2] === 'revisions')
$response = $Cosmo->revisionsRead(NULL, $segments[1]);
else if(count($segments) > 2 && $segments[2] === 'tags')
$response = $Cosmo->contentTagsRead($segments[1]);
else if(count($segments) > 1 && $segments[1] === 'tags')
$response = $Cosmo->contentTagsRead('', $_GET['tag']);
else
$response = $Cosmo->contentRead(isset($_GET['url']) ? $_GET['url'] : '', $role==='admin');
break;
case 'POST':
$published = isset($_POST['published']) ? $_POST['published'] : '';
$name = isset($_POST['name']) ? $_POST['name'] : '';
$extra = isset($_POST['extra']) ? $_POST['extra'] : '';
$title = isset($_POST['title']) ? $_POST['title'] : '';
$description = isset($_POST['description']) ? $_POST['description'] : '';
$header = isset($_POST['header']) ? $_POST['header'] : '';
$subheader = isset($_POST['subheader']) ? $_POST['subheader'] : '';
$featured = isset($_POST['featured']) ? $_POST['featured'] : '';
$body = isset($_POST['body']) ? $_POST['body'] : '';
$url = isset($_POST['url']) ? $_POST['url'] : '';
$type = isset($_POST['type']) ? $_POST['type'] : '';
$published_date = isset($_POST['published_date']) ? $_POST['published_date'] : '';
$author = isset($_POST['author']) ? $_POST['author'] : '';
$tag = isset($_POST['tag']) ? $_POST['tag'] : '';
if(checkPermissions('createPage', $published))
{
if(count($segments) > 4 && $segments[2] === 'revisions' && $segments[4] === 'extras')
$response = $Cosmo->revisionsExtrasCreate($segments[3], $segments[1], $name, $extra);
if(count($segments) > 2 && $segments[2] === 'revisions')
$response['id'] = $Cosmo->revisionsCreate($segments[1], $title, $description, $header, $subheader, $featured, $body, $url, $type, $published, $published_date, $author);
else if(count($segments) > 2 && $segments[2] === 'extras')
$response = $Cosmo->contentExtrasCreate($segments[1], $name, $extra);
else if(count($segments) > 2 && $segments[2] === 'tags')
$response = $Cosmo->contentTagsCreate($segments[1], $tag);
else // Create a new page
$response['id'] = $Cosmo->contentCreate($title, $description, $header, $subheader, $featured, $body, $url, $author, $type, $published, $published_date);
}
break;
case 'PUT':
$published = isset($_PUT['published']) ? $_PUT['published'] : '';
$name = isset($_PUT['name']) ? $_PUT['name'] : '';
$extra = isset($_PUT['extra']) ? $_PUT['extra'] : '';
$title = isset($_PUT['title']) ? $_PUT['title'] : '';
$description = isset($_PUT['description']) ? $_PUT['description'] : '';
$header = isset($_PUT['header']) ? $_PUT['header'] : '';
$subheader = isset($_PUT['subheader']) ? $_PUT['subheader'] : '';
$featured = isset($_PUT['featured']) ? $_PUT['featured'] : '';
$body = isset($_PUT['body']) ? $_PUT['body'] : '';
$url = isset($_PUT['url']) ? $_PUT['url'] : '';
$type = isset($_PUT['type']) ? $_PUT['type'] : '';
$published_date = isset($_PUT['published_date']) ? $_PUT['published_date'] : '';
$author = isset($_PUT['author']) ? $_PUT['author'] : '';
$tag = isset($_PUT['tag']) ? $_PUT['tag'] : '';
if(isset($segments[1])){
if(checkPermissions('editPage', $_PUT['published'], $_PUT['url']))
$response = $Cosmo->contentUpdate($segments[1], $_PUT['title'], $_PUT['description'], $_PUT['header'], $_PUT['subheader'], $_PUT['featured'], $_PUT['body'], $_PUT['url'], $_PUT['author'], $_PUT['type'], $_PUT['published'], $_PUT['published_date']);
}
break;
case 'DELETE':
if(checkPermissions('deletePage')){
if(isset($segments[2]) && $segments[2] === 'revisions' && $segments[3])
$response = $Cosmo->revisionsDelete($segments[3]);
else if(isset($segments[2]) && $segments[2] === 'revisions')
$response = $Cosmo->revisionsDelete(NULL, $segments[1]);
else if(isset($segments[2]) && $segments[2] === 'extras')
$response = $Cosmo->contentExtrasDelete($segments[1]);
else if(isset($segments[2]) && $segments[2] === 'tags')
$response = $Cosmo->contentTagsDelete($segments[1]);
else
$response = $Cosmo->contentDelete($segments[1]);
}
break;
}
break;
##################################################
# Email #
##################################################
case 'email':
switch($method)
{
case 'POST':
$to = isset($_POST['to']) ? $_POST['to'] : '';
$subject = isset($_POST['subject']) ? $_POST['subject'] : '';
$message = isset($_POST['message']) ? $_POST['message'] : '';
$Cosmo->email($to, $subject, $message);
break;
}
break;
##################################################
# Files #
##################################################
case 'files':
switch($method)
{
case 'GET':
$url = isset($_GET['url']) ? $_GET['url'] : '';
if(isset($segments[1]))
$response = $Cosmo->filesRead($segments[1]);
else if($url)
$response = $Cosmo->filesRead(null, $url);
else
$response = $Cosmo->filesRead();
break;
case 'POST':
$published = isset($_POST['published']) ? $_POST['published'] : '';
$file = isset($_POST['file']) ? $_POST['file'] : '';
if(checkPermissions('createPage', $published))
$response = $Cosmo->filesCreate($file);
break;
case 'PUT':
break;
case 'DELETE':
if(checkPermissions('deletePage'))
$response = $Cosmo->filesDelete($segments[1]);
break;
}
break;
##################################################
# Menus #
##################################################
case 'menus':
switch($method)
{
case 'GET':
$response = $Cosmo->menusRead();
break;
case 'POST':
$name = isset($_POST['name']) ? $_POST['name'] : '';
if($role === 'admin')
$response = $Cosmo->menusCreate($name);
break;
case 'PUT':
$name = isset($_PUT['name']) ? $_PUT['name'] : '';
$menu = isset($_PUT['menu']) ? $_PUT['menu'] : '';
$area = isset($_PUT['area']) ? $_PUT['area'] : '';
if($role === 'admin')
$response = $Cosmo->menusUpdate($segments[1], $name, $menu, $area);
break;
case 'DELETE':
if(isset($segments[1])){
if($role === 'admin')
$response = $Cosmo->menusDelete($segments[1]);
}
break;
}
break;
##################################################
# Modules #
##################################################
case 'modules':
switch($method)
{
case 'GET':
$response = $Cosmo->modulesRead();
break;
case 'POST':
$module = isset($_POST['module']) ? $_POST['module'] : '';
if($role === 'admin')
$response = $Cosmo->modulesCreate($module);
break;
case 'PUT':
$status = isset($_PUT['status']) ? $_PUT['status'] : '';
if($role === 'admin')
$response = $Cosmo->modulesUpdate($segments[1], $status);
break;
case 'DELETE':
if($role === 'admin')
$response = $Cosmo->modulesDelete($segments[1]);
break;
}
break;
##################################################
# Settings #
##################################################
case 'settings':
switch($method)
{
case 'GET':
$response = $Cosmo->settingsRead();
break;
case 'PUT':
$siteName = isset($_PUT['siteName']) ? $_PUT['siteName'] : '';
$slogan = isset($_PUT['slogan']) ? $_PUT['slogan'] : '';
$logo = isset($_PUT['logo']) ? $_PUT['logo'] : '';
$favicon = isset($_PUT['favicon']) ? $_PUT['favicon'] : '';
$email = isset($_PUT['email']) ? $_PUT['email'] : '';
$language = isset($_PUT['language']) ? $_PUT['language'] : '';
$maintenanceURL = isset($_PUT['maintenanceURL']) ? $_PUT['maintenanceURL'] : '';
$maintenanceMode = isset($_PUT['maintenanceMode']) ? $_PUT['maintenanceMode'] : '';
if($role === 'admin')
$response = $Cosmo->settingsUpdate($siteName, $slogan, $logo, $favicon, $email, $language, $maintenanceURL, $maintenanceMode);
break;
default:
break;
}
break;
##################################################
# Themes #
##################################################
case 'themes':
switch($method)
{
case 'GET':
if(isset($segments[1]))
$response = $Cosmo->themesRead($segments[1]);
else
$response = $Cosmo->themesRead();
break;
case 'POST':
break;
case 'PUT':
$theme = isset($_PUT['theme']) ? $_PUT['theme'] : '';
if($role === 'admin')
$response = $Cosmo->themesUpdate($theme);
break;
case 'DELETE':
break;
}
break;
##################################################
# Users #
##################################################
case 'users':
switch($method)
{
case 'GET':
if(count($segments) > 1 && $segments[1])
$response = $Cosmo->usersRead($segments[1]);
else if($_GET['username'] && $_GET['password']) // Login
$response = $Cosmo->userLogin($_GET['username'], $_GET['password']);
else if($_GET['keyword']) // Get list of users starting with a keyword
$response = $Cosmo->usersRead(NULL, $_GET['keyword']);
else // Get a list of all users
$response = $Cosmo->usersRead();
break;
case 'POST':
$username = isset($_POST['username']) ? $_POST['username'] : '';
$email = isset($_POST['email']) ? $_POST['email'] : '';
$password = isset($_POST['password']) ? $_POST['password'] : '';
$response = $Cosmo->usersCreate($username, $email, $password);
break;
case 'PUT':
$username = isset($_PUT['username']) ? $_PUT['username'] : '';
$password = isset($_PUT['password']) ? $_PUT['password'] : '';
$name = isset($_PUT['name']) ? $_PUT['name'] : '';
$photo = isset($_PUT['photo']) ? $_PUT['photo'] : '';
$bio = isset($_PUT['bio']) ? $_PUT['bio'] : '';
$facebook = isset($_PUT['facebook']) ? $_PUT['facebook'] : '';
$twitter = isset($_PUT['twitter']) ? $_PUT['twitter'] : '';
$role = isset($_PUT['role']) ? $_PUT['role'] : '';
$email = isset($_PUT['email']) ? $_PUT['email'] : '';
$reset = isset($_PUT['reset']) ? $_PUT['reset'] : '';
$token = isset($_PUT['token']) ? $_PUT['token'] : '';
if($token) // Update your password
{
if($Cosmo->passwordResetVerify($segments[1], $token))
$response = $Cosmo->usersUpdate($segments[1], NULL, NULL, NULL, NULL, NULL, NULL, NULL, $password);
else
$response = FALSE;
} else if(count($segments) > 1 && $segments[1]) // Edit username, email, role, or password
{
// Make sure the user is editing their own info, or the user is an administrator
if($role === 'admin') // Allow the editing of the role too
$response = $Cosmo->usersUpdate($segments[1], $username, $name, $photo, $bio, $facebook, $twitter, $role, $email);
else if($username === $_PUT['username'])
$response = $Cosmo->usersUpdate($segments[1], $username, $name, $photo, $bio, $facebook, $twitter, NULL, $email);
} else if($reset) // Reset password
$response['token'] = $Cosmo->passwordReset($segments[1]);
break;
case 'DELETE':
if($role === 'admin')
{
if(isset($segments[2]))
$response = $Cosmo->usersRoleDelete($segments[1]);
else
$response = $Cosmo->usersDelete($segments[1]);
}
break;
}
break;
default:
break;
}
if(is_string($response))
$response = array('data'=>$response);
if($response === false){
$HTTPHeaderCode = 500;
header('HTTP/1.1 500 Internal Server Error');
}
// Set Headers
header("Content-Type: application/json", true);
header('Cache-Control: no-cache, no-store, must-revalidate'); // HTTP 1.1.
header('Pragma: no-cache'); // HTTP 1.0.
header('Expires: 0'); // Proxies.
header("Status: $HTTPHeaderCode");
echo json_encode($response);
?>
| {
"pile_set_name": "Github"
} |
/*
* $Id: wxProcessVideoThread.h 117 2007-03-05 14:11:26Z johmathe $
* $Date: 2007-03-05 15:11:26 +0100 (Mon, 05 Mar 2007) $
*/
#define Uses_wxThread
#include <errno.h>
#include <stdio.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <unistd.h>
#include <wx/image.h>
#include <wx/msgdlg.h>
#include <wx/wx.h>
#include "src/film.h"
#include "src/ui/dialog_shotdetect.h"
#ifndef __WXPROCESSVIDEOTHREAD_H__
#define __WXPROCESSVIDEOTHREAD_H__
// http://www.dent.med.uni-muenchen.de/~wmglo/wxthread/CompleteExample.html
class wxProcessVideoThread : public wxThread {
private:
list<film> *films;
void *Entry();
public:
wxWindow *dialogParent;
void Create(wxWindow *d, list<film> *films) {
this->films = films;
dialogParent = d;
wxThread::Create();
};
wxProcessVideoThread(wxThreadKind kind);
};
#endif
| {
"pile_set_name": "Github"
} |
/*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Copyright (C) 2012-2020 OpenFOAM Foundation
\\/ M anipulation |
-------------------------------------------------------------------------------
License
This file is part of OpenFOAM.
OpenFOAM 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.
OpenFOAM 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 OpenFOAM. If not, see <http://www.gnu.org/licenses/>.
\*---------------------------------------------------------------------------*/
#include "OBJstream.H"
#include "primitivePatch.H"
// * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * //
namespace Foam
{
defineTypeNameAndDebug(OBJstream, 0);
}
// * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * //
void Foam::OBJstream::writeAndCheck(const char c)
{
if (c == '\n')
{
startOfLine_ = true;
}
else if (startOfLine_)
{
startOfLine_ = false;
if (c == 'v')
{
nVertices_++;
}
}
OFstream::write(c);
}
// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
Foam::OBJstream::OBJstream
(
const fileName& filePath,
streamFormat format,
versionNumber version,
compressionType compression
)
:
OFstream(filePath, format, version, compression),
startOfLine_(true),
nVertices_(0)
{}
// * * * * * * * * * * * * * * * * Destructor * * * * * * * * * * * * * * * //
Foam::OBJstream::~OBJstream()
{}
// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
Foam::Ostream& Foam::OBJstream::write(const char c)
{
writeAndCheck(c);
return *this;
}
Foam::Ostream& Foam::OBJstream::write(const char* str)
{
for (const char* p = str; *p != '\0'; ++p)
{
writeAndCheck(*p);
}
return *this;
}
Foam::Ostream& Foam::OBJstream::write(const word& str)
{
write(str.c_str());
return *this;
}
Foam::Ostream& Foam::OBJstream::write(const string& str)
{
OFstream::write(char(token::BEGIN_STRING));
int backslash = 0;
for (string::const_iterator iter = str.begin(); iter != str.end(); ++iter)
{
char c = *iter;
if (c == '\\')
{
backslash++;
// suppress output until we know if other characters follow
continue;
}
else if (c == token::NL)
{
lineNumber_++;
backslash++; // backslash escape for newline
}
else if (c == token::END_STRING)
{
backslash++; // backslash escape for quote
}
// output pending backslashes
while (backslash)
{
OFstream::write('\\');
backslash--;
}
writeAndCheck(c);
}
// silently drop any trailing backslashes
// they would otherwise appear like an escaped end-quote
OFstream::write(char(token::END_STRING));
return *this;
}
Foam::Ostream& Foam::OBJstream::writeQuoted
(
const std::string& str,
const bool quoted
)
{
if (quoted)
{
OFstream::write(char(token::BEGIN_STRING));
int backslash = 0;
for
(
string::const_iterator iter = str.begin();
iter != str.end();
++iter
)
{
char c = *iter;
if (c == '\\')
{
backslash++;
// suppress output until we know if other characters follow
continue;
}
else if (c == token::NL)
{
lineNumber_++;
backslash++; // backslash escape for newline
}
else if (c == token::END_STRING)
{
backslash++; // backslash escape for quote
}
// output pending backslashes
while (backslash)
{
OFstream::write('\\');
backslash--;
}
writeAndCheck(c);
}
// silently drop any trailing backslashes
// they would otherwise appear like an escaped end-quote
OFstream::write(char(token::END_STRING));
}
else
{
// output unquoted string, only advance line number on newline
write(str.c_str());
}
return *this;
}
Foam::Ostream& Foam::OBJstream::write(const point& pt)
{
write("v ") << pt.x() << ' ' << pt.y() << ' ' << pt.z()
<< nl;
return *this;
}
Foam::Ostream& Foam::OBJstream::write(const point& pt, const vector& n)
{
write(pt);
OFstream::write("vn ") << n.x() << ' ' << n.y()
<< ' ' << n.z() << nl;
return *this;
}
Foam::Ostream& Foam::OBJstream::write(const edge& e, const UList<point>& points)
{
write(points[e[0]]);
write(points[e[1]]);
write("l ") << nVertices_-1 << ' ' << nVertices_ << nl;
return *this;
}
Foam::Ostream& Foam::OBJstream::write(const linePointRef& ln)
{
write(ln.start());
write(ln.end());
write("l ") << nVertices_-1 << ' ' << nVertices_ << nl;
return *this;
}
Foam::Ostream& Foam::OBJstream::write
(
const linePointRef& ln,
const vector& n0,
const vector& n1
)
{
write(ln.start(), n0);
write(ln.end(), n1);
write("l ") << nVertices_-1 << ' ' << nVertices_ << nl;
return *this;
}
Foam::Ostream& Foam::OBJstream::write
(
const triPointRef& f,
const bool lines
)
{
label start = nVertices_;
write(f.a());
write(f.b());
write(f.c());
if (lines)
{
write('l');
for (int i = 0; i < 3; i++)
{
write(' ') << start+1+i;
}
write(' ') << start+1 << '\n';
}
else
{
write('f');
for (int i = 0; i < 3; i++)
{
write(' ') << start+1+i;
}
write('\n');
}
return *this;
}
Foam::Ostream& Foam::OBJstream::write
(
const face& f,
const UList<point>& points,
const bool lines
)
{
label start = nVertices_;
forAll(f, i)
{
write(points[f[i]]);
}
if (lines)
{
write('l');
forAll(f, i)
{
write(' ') << start+1+i;
}
write(' ') << start+1 << '\n';
}
else
{
write('f');
forAll(f, i)
{
write(' ') << start+1+i;
}
write('\n');
}
return *this;
}
Foam::Ostream& Foam::OBJstream::write
(
const faceList& fcs,
const pointField& points,
const bool lines
)
{
SubList<face> allFcs(fcs, fcs.size());
primitivePatch pp(allFcs, points);
const pointField& localPoints = pp.localPoints();
const faceList& localFaces = pp.localFaces();
label start = nVertices_;
forAll(localPoints, i)
{
write(localPoints[i]);
}
if (lines)
{
const edgeList& edges = pp.edges();
forAll(edges, edgeI)
{
const edge& e = edges[edgeI];
write("l ") << start+e[0]+1 << ' ' << start+e[1]+1 << nl;
}
}
else
{
forAll(localFaces, facei)
{
const face& f = localFaces[facei];
write('f');
forAll(f, i)
{
write(' ') << start+f[i]+1;
}
write('\n');
}
}
return *this;
}
// ************************************************************************* //
| {
"pile_set_name": "Github"
} |
<?php
/*
* This file is part of the symfony package.
* (c) Fabien Potencier <[email protected]>
*
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*/
/**
* Swift_DoctrineSpool is a spool that uses Doctrine.
*
* Example schema:
*
* MailMessage:
* actAs: { Timestampable: ~ }
* columns:
* message: { type: clob, notnull: true }
*
* @package symfony
* @subpackage mailer
* @author Fabien Potencier <[email protected]>
* @version SVN: $Id$
*/
class Swift_DoctrineSpool extends Swift_ConfigurableSpool
{
protected
$model = null,
$column = null,
$method = null;
/**
* Constructor.
*
* @param string The Doctrine model to use to store the messages (MailMessage by default)
* @param string The column name to use for message storage (message by default)
* @param string The method to call to retrieve the query to execute (optional)
*/
public function __construct($model = 'MailMessage', $column = 'message', $method = 'createQuery')
{
$this->model = $model;
$this->column = $column;
$this->method = $method;
}
/**
* Tests if this Transport mechanism has started.
*
* @return boolean
*/
public function isStarted()
{
return true;
}
/**
* Starts this Transport mechanism.
*/
public function start()
{
}
/**
* Stops this Transport mechanism.
*/
public function stop()
{
}
/**
* Stores a message in the queue.
*
* @param Swift_Mime_Message $message The message to store
*/
public function queueMessage(Swift_Mime_Message $message)
{
$object = new $this->model;
if (!$object instanceof Doctrine_Record)
{
throw new InvalidArgumentException('The mailer message object must be a Doctrine_Record object.');
}
$object->{$this->column} = serialize($message);
$object->save();
$object->free(true);
}
/**
* Sends messages using the given transport instance.
*
* @param Swift_Transport $transport A transport instance
* @param string[] &$failedRecipients An array of failures by-reference
*
* @return int The number of sent emails
*/
public function flushQueue(Swift_Transport $transport, &$failedRecipients = null)
{
$table = Doctrine_Core::getTable($this->model);
$objects = $table->{$this->method}()->limit($this->getMessageLimit())->execute();
if (!$transport->isStarted())
{
$transport->start();
}
$count = 0;
$time = time();
foreach ($objects as $object)
{
$message = unserialize($object->{$this->column});
$object->delete();
try
{
$count += $transport->send($message, $failedRecipients);
}
catch (Exception $e)
{
// TODO: What to do with errors?
}
if ($this->getTimeLimit() && (time() - $time) >= $this->getTimeLimit())
{
break;
}
}
return $count;
}
}
| {
"pile_set_name": "Github"
} |
package yaml
import (
"reflect"
"unicode"
)
type keyList []reflect.Value
func (l keyList) Len() int { return len(l) }
func (l keyList) Swap(i, j int) { l[i], l[j] = l[j], l[i] }
func (l keyList) Less(i, j int) bool {
a := l[i]
b := l[j]
ak := a.Kind()
bk := b.Kind()
for (ak == reflect.Interface || ak == reflect.Ptr) && !a.IsNil() {
a = a.Elem()
ak = a.Kind()
}
for (bk == reflect.Interface || bk == reflect.Ptr) && !b.IsNil() {
b = b.Elem()
bk = b.Kind()
}
af, aok := keyFloat(a)
bf, bok := keyFloat(b)
if aok && bok {
if af != bf {
return af < bf
}
if ak != bk {
return ak < bk
}
return numLess(a, b)
}
if ak != reflect.String || bk != reflect.String {
return ak < bk
}
ar, br := []rune(a.String()), []rune(b.String())
for i := 0; i < len(ar) && i < len(br); i++ {
if ar[i] == br[i] {
continue
}
al := unicode.IsLetter(ar[i])
bl := unicode.IsLetter(br[i])
if al && bl {
return ar[i] < br[i]
}
if al || bl {
return bl
}
var ai, bi int
var an, bn int64
if ar[i] == '0' || br[i] == '0' {
for j := i-1; j >= 0 && unicode.IsDigit(ar[j]); j-- {
if ar[j] != '0' {
an = 1
bn = 1
break
}
}
}
for ai = i; ai < len(ar) && unicode.IsDigit(ar[ai]); ai++ {
an = an*10 + int64(ar[ai]-'0')
}
for bi = i; bi < len(br) && unicode.IsDigit(br[bi]); bi++ {
bn = bn*10 + int64(br[bi]-'0')
}
if an != bn {
return an < bn
}
if ai != bi {
return ai < bi
}
return ar[i] < br[i]
}
return len(ar) < len(br)
}
// keyFloat returns a float value for v if it is a number/bool
// and whether it is a number/bool or not.
func keyFloat(v reflect.Value) (f float64, ok bool) {
switch v.Kind() {
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:
return float64(v.Int()), true
case reflect.Float32, reflect.Float64:
return v.Float(), true
case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:
return float64(v.Uint()), true
case reflect.Bool:
if v.Bool() {
return 1, true
}
return 0, true
}
return 0, false
}
// numLess returns whether a < b.
// a and b must necessarily have the same kind.
func numLess(a, b reflect.Value) bool {
switch a.Kind() {
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:
return a.Int() < b.Int()
case reflect.Float32, reflect.Float64:
return a.Float() < b.Float()
case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr:
return a.Uint() < b.Uint()
case reflect.Bool:
return !a.Bool() && b.Bool()
}
panic("not a number")
}
| {
"pile_set_name": "Github"
} |
---
deprecated: true
author:
name: Linode
email: [email protected]
description: 'Use the GNU Mailman software to manage email listservs.'
keywords: ["mailman", "listserv", "email", "postfix"]
tags: ["debian","postfix","email"]
license: '[CC BY-ND 4.0](https://creativecommons.org/licenses/by-nd/4.0)'
aliases: ['/email/mailman/debian-6-squeeze/']
modified: 2011-05-23
modified_by:
name: Linode
published: 2011-04-05
title: 'Manage Email Lists with GNU Mailman on Debian 6 (Squeeze)'
---
GNU Mailman is a commonly used Listserv Management application that allows users to create and manage discussion and announcement email lists. Mailman includes support for numerous features including a web-based administrative interface, multiple domains, lists, and complex moderation and access control tools. The Mailman software is primarily written in the Python programing language and has been a popular choice for managing email lists for more than a decade.
Be sure to review this guide in its entirety before beginning the procedure outlined below. If you have an existing mail system configured before you begin this, take special care to ensure that installing Mailman will not conflict with delivery of existing mail.
# Set the Hostname
Before you begin installing and configuring the components described in this guide, please make sure you've followed our instructions for [setting your hostname](/docs/getting-started/#setting-the-hostname). Issue the following commands to make sure it is set properly:
hostname
hostname -f
# Installing Mailman
Before proceeding with the installation of Mailman, make sure your package repositories and installed programs are up to date by issuing the following commands:
apt-get update
apt-get upgrade --show-upgraded
Mailman can be configured to use a number of different mail transfer agents. We recommend using the postfix MTA, though mailman will work with whatever MTA you have installed. If you do not have any MTA installed, issue the following command to install postfix:
apt-get install postfix
During the postfix installation, you will want to select "**Internet Site**" as the "General type of mail configuration." You will also want to set the host or domain name for your server as the system name, (e.g. `example.com` or similar.) Now install Mailman with the following command:
apt-get install mailman
During the Mailman installation, you will be required to specify the languages that you wish your Mailman instance support. Select all required languages before continuing. The installation process will also provide a note regarding the next step of the installation process, which you can accept and allow the installation process to continue.
# Configure Mailman
Consider the "[Configure Virtual Hosting](/docs/email/mailman/manage-email-lists-with-gnu-mailman-on-debian-6-squeeze/#configure-virtual-hosting)" section before preceding. In most cases where you will be hosting you will want to skip this section and continue with that procedure. Mailman requires a "base" list, from which it can send email to welcome new members to lists and send password reminders when needed. Create this list by issuing the following command:
newlist mailman
During the list creation process, Mailman will prompt you for the administrators email address and an initial mailman password. Mailman will then produce the following output that you will want to include in your `/etc/aliases` file.
{{< file "/etc/aliases" >}}
\#\# mailman mailing list mailman: "|/var/lib/mailman/mail/mailman post mailman" mailman-admin: "|/var/lib/mailman/mail/mailman admin mailman" mailman-bounces: "|/var/lib/mailman/mail/mailman bounces mailman" mailman-confirm: "|/var/lib/mailman/mail/mailman confirm mailman" mailman-join: "|/var/lib/mailman/mail/mailman join mailman" mailman-leave: "|/var/lib/mailman/mail/mailman leave mailman" mailman-owner: "|/var/lib/mailman/mail/mailman owner mailman" mailman-request: "|/var/lib/mailman/mail/mailman request mailman" mailman-subscribe: "|/var/lib/mailman/mail/mailman subscribe mailman" mailman-unsubscribe: "|/var/lib/mailman/mail/mailman unsubscribe mailman"
{{< /file >}}
Replace `example.com` and `lists.example.com` with the relevant domains for your instance. Ensure that you have configured the [MX Records](/docs/dns-guides/introduction-to-dns/#mx) for both domains that you want to receive email with. Additionally, add the following lines to your `/etc/postfix/master.cf` file:
{{< file "/etc/postfix/master.cf" >}}
mailman unix - n n - - pipe
flags=FR user=list
argv=/var/lib/mailman/bin/postfix-to-mailman.py ${nexthop} ${mailbox}
{{< /file >}}
These lines enable postfix to hand off email to Mailman for processing directly. Add the following line to the `/etc/postfix/transport` file, modifying `lists.example.com` as needed.
{{< file "/etc/postfix/transport" >}}
lists.example.com mailman:
# Configure Virtual Hosting
Finally, modify the `/etc/mailman/mm_cfg.py` file to set the following values. After you've edited the `/etc/postfix/transport` file, and after every successive edit of this file, issue the following command to rebuild postfix's transport database:
{{< file "/etc/aliases" >}}
relay_domains = $mydestination, lists.example.com
relay_recipient_maps = hash:/var/lib/mailman/data/virtual-mailman
transport_maps = hash:/etc/postfix/transport
mailman_destination_recipient_limit = 1
{{< /file >}}
This controls how Mailman processes the mail that it receives from postfix. Continue configuring Mailman by editing following file to update Mailman to interact properly with postfix:
{{< file "/etc/postfix/master.cf" >}}
mailman unix - n n - - pipe
flags=FR user=list
argv=/var/lib/mailman/bin/postfix-to-mailman.py ${nexthop} ${mailbox}
{{< /file >}}
{{< /file >}}
{{< file "/etc/postfix/transport" >}}
lists.example.com mailman:
{{< /file >}}
Ensure that the fields `DEFAULT_EMAIL_HOST` and `DEFAULT_URL_HOST` match the sub-domain you are using for lists (e.g. `lists.example.com`,) as follows:
{{< file "/etc/mailman/mm\\_cfg.py" >}}
#-------------------------------------------------------------
# Default domain for email addresses of newly created MLs
DEFAULT_EMAIL_HOST = 'lists.example.com'
#-------------------------------------------------------------
# Default host for web interface of newly created MLs
DEFAULT_URL_HOST = 'lists.example.com'
#-------------------------------------------------------------
# Required when setting any of its arguments.
add_virtualhost(DEFAULT_URL_HOST, DEFAULT_EMAIL_HOST)
{{< /file >}}
{{< file "/etc/mailman/mm\\_cfg.py" >}}
MTA = 'Postfix'
POSTFIX_STYLE_VIRTUAL_DOMAINS = ['lists.example.com']
# alias for postmaster, abuse and mailer-daemon
DEB_LISTMASTER = '[email protected]'
{{< /file >}}
If you need to configure additional domains for use, ensure that you've made the proper additions to the `relay_domains` field in the `main.cf` file and `/etc/postfix/transport` file. Append an item to the `POSTFIX_STYLE_VIRTUAL_DOMAINS` line and create additional `add_virtualhost` calls in the following form for every new domain:
{{< file "/etc/mailman/mm\\_cfg.py" >}}
#-------------------------------------------------------------
# Default domain for email addresses of newly created MLs
DEFAULT_EMAIL_HOST = 'lists.example.com'
#-------------------------------------------------------------
# Default host for web interface of newly created MLs
DEFAULT_URL_HOST = 'lists.example.com'
#-------------------------------------------------------------
# Required when setting any of its arguments.
add_virtualhost(DEFAULT_URL_HOST, DEFAULT_EMAIL_HOST)
{{< /file >}}
# Modify the following line, if it exists
POSTFIX_STYLE_VIRTUAL_DOMAINS = ['lists.example.com', 'lists.example.org']
{{< file "/etc/mailman/mm\\_cfg.py" >}}
add_virtualhost('lists.example.org', 'lists.example.org')
# Modify the following line, if it exists
POSTFIX_STYLE_VIRTUAL_DOMAINS = ['lists.example.com', 'lists.example.org']
{{< /file >}}
Ensure that your domains have valid MX and [A Records](/docs/dns-guides/introduction-to-dns#types-of-dns-records) that point to your Linode. When you've finished configuring Mailman, issue the following commands to create the default list (which will prompt you to enter an address for the list administrator and a password), restart postfix, and start Mailman for the first time:
newlist mailman
/etc/init.d/postfix restart
/etc/init.d/mailman start
If you created lists using the `/etc/aliases` method, you will have to recreate those lists by issuing the following commands.:
/var/lib/mailman/bin/genaliases
postmap /var/lib/mailman/data/virtual-mailman
From this point forward, you can create new lists by issuing `newlist` commands as root. Additionally, all administration and functions of the Mailman lists can be accomplished by way of the web based interface.
# Configuring Mailman with Alternate Mail Configurations
If you wish to deploy Mailman on a system that has an existing mail set up, such as the [Postfix with Dovecot and MySQL](/docs/email/postfix/dovecot-mysql-debian-6-squeeze/) or the [Postfix with Dovecot and System Users](/docs/email/postfix/dovecot-system-users-debian-6-squeeze/) configurations described in other documents, consider the following recommendations:
Complete your basic mail configuration according to the appropriate guide before beginning to install and configure Mailman.
It is absolutely crucial that the `DEFAULT_EMAIL_HOST` and `DEFAULT_URL_HOST` are **not** served by your previously configured email system. Any additional domains served by mailman by way of the `add_virtualhost` function must also **not** overlap any domains served by another domain on this host. If these domains overlap there will be collisions, and neither system will function as expected.
In all other respects, as long as you deploy Mailman with virtual hosting on its own domain using Mailman with an existing email solution poses no complications. Congratulations, you now have a fully functional email list management solution!
# More Information
You may wish to consult the following resources for additional information on this topic. While these are provided in the hope that they will be useful, please note that we cannot vouch for the accuracy or timeliness of externally hosted materials.
- [The Official GNU Mailman Site](http://www.gnu.org/software/mailman/index.html)
- [GNU Mailman Wiki](http://wiki.list.org/dashboard.action)
- [GNU Mailman Documentation](http://staff.imsa.edu/~ckolar/mailman/)
| {
"pile_set_name": "Github"
} |
\begin{code}
doSensitiveThings :: Proxy 'Admin -> IO ()
doSensitiveThings = ...
\end{code}
| {
"pile_set_name": "Github"
} |
Scribus icons for version 1.5.x+ (as distributed with Scribus or through Scribus SVN) under GPL2 or later version per the below standard text)
Copyright (C) 2015 Dezso Markon ([email protected])
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
| {
"pile_set_name": "Github"
} |
<?xml version="1.0" encoding="utf-8"?>
<android.support.design.widget.CoordinatorLayout xmlns:android="http://schemas.android.com/apk/res/android"
xmlns:app="http://schemas.android.com/apk/res-auto"
xmlns:tools="http://schemas.android.com/tools"
android:layout_width="match_parent"
android:layout_height="match_parent"
android:fitsSystemWindows="true"
tools:context="com.haozhang.widget.MainActivity">
<android.support.design.widget.AppBarLayout
android:layout_width="match_parent"
android:layout_height="wrap_content"
android:theme="@style/AppTheme.AppBarOverlay">
<android.support.v7.widget.Toolbar
android:id="@+id/toolbar"
android:layout_width="match_parent"
android:layout_height="?attr/actionBarSize"
android:background="?attr/colorPrimary"
app:popupTheme="@style/AppTheme.PopupOverlay" />
</android.support.design.widget.AppBarLayout>
<include layout="@layout/content_main" />
<android.support.design.widget.FloatingActionButton
android:id="@+id/fab"
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:layout_gravity="bottom|end"
android:layout_margin="@dimen/fab_margin"
android:src="@android:drawable/ic_dialog_email" />
</android.support.design.widget.CoordinatorLayout>
| {
"pile_set_name": "Github"
} |
#![cfg(feature = "guardduty")]
extern crate env_logger;
extern crate rusoto_core;
extern crate rusoto_guardduty;
use rusoto_core::Region;
use rusoto_guardduty::{GuardDuty, GuardDutyClient, ListInvitationsRequest};
#[tokio::test]
async fn should_list_invitations() {
let _ = env_logger::try_init();
let client = GuardDutyClient::new(Region::UsWest2);
let request = ListInvitationsRequest {
..Default::default()
};
let result = client.list_invitations(request).await;
println!("{:#?}", result);
assert!(result.is_ok());
}
| {
"pile_set_name": "Github"
} |
package utils.date
{
/**
* Returns true if date is in the past.
* If the date is exactly equal to the current time, it will return false.
*
* @author Mims H. Wright
*/
public function isPast(date:Date):Boolean
{
return (new Date().getTime() - date.getTime()) > 0;
}
} | {
"pile_set_name": "Github"
} |
1
| {
"pile_set_name": "Github"
} |
/*
* smb.c
* Copyright (C) 2009-2011 by ipoque GmbH
*
* This file is part of OpenDPI, an open source deep packet inspection
* library based on the PACE technology by ipoque GmbH
*
* OpenDPI 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.
*
* OpenDPI 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 OpenDPI. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include "ipq_protocols.h"
#ifdef IPOQUE_PROTOCOL_SMB
static void ipoque_int_smb_add_connection(struct ipoque_detection_module_struct
*ipoque_struct)
{
ipoque_int_add_connection(ipoque_struct, IPOQUE_PROTOCOL_SMB, IPOQUE_REAL_PROTOCOL);
}
void ipoque_search_smb_tcp(struct ipoque_detection_module_struct *ipoque_struct)
{
struct ipoque_packet_struct *packet = &ipoque_struct->packet;
struct ipoque_flow_struct *flow = ipoque_struct->flow;
// struct ipoque_id_struct *src=ipoque_struct->src;
// struct ipoque_id_struct *dst=ipoque_struct->dst;
IPQ_LOG(IPOQUE_PROTOCOL_SMB, ipoque_struct, IPQ_LOG_DEBUG, "search SMB.\n");
if (packet->tcp->dest == htons(445)
&& packet->payload_packet_len > (32 + 4 + 4)
&& (packet->payload_packet_len - 4) == ntohl(get_u32(packet->payload, 0))
&& get_u32(packet->payload, 4) == htonl(0xff534d42)) {
IPQ_LOG(IPOQUE_PROTOCOL_SMB, ipoque_struct, IPQ_LOG_DEBUG, "found SMB.\n");
ipoque_int_smb_add_connection(ipoque_struct);
return;
}
IPQ_LOG(IPOQUE_PROTOCOL_SMB, ipoque_struct, IPQ_LOG_DEBUG, "exclude SMB.\n");
IPOQUE_ADD_PROTOCOL_TO_BITMASK(flow->excluded_protocol_bitmask, IPOQUE_PROTOCOL_SMB);
}
#endif
| {
"pile_set_name": "Github"
} |
<?xml version="1.0" encoding="UTF-8"?>
<project version="4">
<component name="VcsDirectoryMappings">
<mapping directory="$PROJECT_DIR$/../../.." vcs="Git" />
</component>
</project> | {
"pile_set_name": "Github"
} |
/*******************************
Container
*******************************/
/*-------------------
Element
--------------------*/
/* Minimum Gutter is used to determine the maximum container width for a given device */
@maxWidth: 100%;
/* Devices */
@mobileMinimumGutter: 0em;
@mobileWidth: auto;
@mobileGutter: 1em;
@tabletMinimumGutter: (@emSize * 1);
@tabletWidth: @tabletBreakpoint - (@tabletMinimumGutter * 2) - @scrollbarWidth;
@tabletGutter: auto;
@computerMinimumGutter: (@emSize * 1.5);
@computerWidth: @computerBreakpoint - (@computerMinimumGutter * 2) - @scrollbarWidth;
@computerGutter: auto;
@largeMonitorMinimumGutter: (@emSize * 2);
@largeMonitorWidth: @largeMonitorBreakpoint - (@largeMonitorMinimumGutter * 2) - @scrollbarWidth;
@largeMonitorGutter: auto;
/* Coupling (Add Negative Margin to container size) */
@gridGutterWidth: 2rem;
@relaxedGridGutterWidth: 3rem;
@veryRelaxedGridGutterWidth: 5rem;
@mobileGridWidth: @mobileWidth;
@tabletGridWidth: ~"calc("@tabletWidth~" + "@gridGutterWidth~")";
@computerGridWidth: ~"calc("@computerWidth~" + "@gridGutterWidth~")";
@largeMonitorGridWidth: ~"calc("@largeMonitorWidth~" + "@gridGutterWidth~")";
@mobileRelaxedGridWidth: @mobileWidth;
@tabletRelaxedGridWidth: ~"calc("@tabletWidth~" + "@relaxedGridGutterWidth~")";
@computerRelaxedGridWidth: ~"calc("@computerWidth~" + "@relaxedGridGutterWidth~")";
@largeMonitorRelaxedGridWidth: ~"calc("@largeMonitorWidth~" + "@relaxedGridGutterWidth~")";
@mobileVeryRelaxedGridWidth: @mobileWidth;
@tabletVeryRelaxedGridWidth: ~"calc("@tabletWidth~" + "@veryRelaxedGridGutterWidth~")";
@computerVeryRelaxedGridWidth: ~"calc("@computerWidth~" + "@veryRelaxedGridGutterWidth~")";
@largeMonitorVeryRelaxedGridWidth: ~"calc("@largeMonitorWidth~" + "@veryRelaxedGridGutterWidth~")";
/*-------------------
Types
--------------------*/
/* Text */
@textWidth: 700px;
@textFontFamily: @pageFont;
@textLineHeight: 1.5;
@textSize: @large; | {
"pile_set_name": "Github"
} |
./type.tests: line 9: type: -r: invalid option
type: usage: type [-afptP] name [name ...]
./type.tests: line 12: type: notthere: not found
function
keyword
builtin
file
file
file
func is a function
func ()
{
echo this is func
}
while is a shell keyword
while is a shell keyword
builtin is a shell builtin
/bin/sh is /bin/sh
func
func is a function
func ()
{
echo this is func
}
while
while is a shell keyword
./type.tests: line 43: type: m: not found
alias m='more'
alias m='more'
m is aliased to `more'
alias
alias m='more'
alias m='more'
alias m='more'
m is aliased to `more'
builtin
builtin is a shell builtin
/bin/sh
/bin/sh is /bin/sh
./type.tests: line 65: type: func: not found
./type.tests: line 67: type: m: not found
/bin/sh
/tmp/bash
bash is hashed (/tmp/bash)
file
hits command
3 /tmp/bash
1 /bin/sh
f is a function
f ()
{
v='^A'
}
foo is a function
foo ()
{
echo $(<x1)
}
bar is a function
bar ()
{
echo $(<x1)
}
foo is a function
foo ()
{
echo;
cat <<END
bar
END
cat <<EOF
qux
EOF
}
bar
qux
bar
qux
foo is a function
foo ()
{
rm -f a b c;
for f in a b c;
do
cat <<-EOF >> ${f}
file
EOF
done
grep . a b c
}
a:file
b:file
c:file
bb is a function
bb ()
{
( cat <<EOF
foo
bar
EOF
)
echo after subshell
}
mkcoprocs is a function
mkcoprocs ()
{
coproc a {
cat <<EOF1
producer 1
EOF1
}
coproc b {
cat <<EOF2
producer 2
EOF2
}
echo "coprocs created"
}
mkcoprocs is a function
mkcoprocs ()
{
coproc COPROC ( b cat <<EOF
heredoc
body
EOF
)
echo "coprocs created"
}
| {
"pile_set_name": "Github"
} |
<?php
/***********************************************************************************
* X2Engine Open Source Edition is a customer relationship management program developed by
* X2 Engine, Inc. Copyright (C) 2011-2019 X2 Engine Inc.
*
* This program is free software; you can redistribute it and/or modify it under
* the terms of the GNU Affero General Public License version 3 as published by the
* Free Software Foundation with the addition of the following permission added
* to Section 15 as permitted in Section 7(a): FOR ANY PART OF THE COVERED WORK
* IN WHICH THE COPYRIGHT IS OWNED BY X2ENGINE, X2ENGINE DISCLAIMS THE WARRANTY
* OF NON INFRINGEMENT OF THIRD PARTY RIGHTS.
*
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more
* details.
*
* You should have received a copy of the GNU Affero General Public License along with
* this program; if not, see http://www.gnu.org/licenses or write to the Free
* Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
* 02110-1301 USA.
*
* You can contact X2Engine, Inc. P.O. Box 610121, Redwood City,
* California 94061, USA. or at email address [email protected].
*
* The interactive user interfaces in modified source and object code versions
* of this program must display Appropriate Legal Notices, as required under
* Section 5 of the GNU Affero General Public License version 3.
*
* In accordance with Section 7(b) of the GNU Affero General Public License version 3,
* these Appropriate Legal Notices must retain the display of the "Powered by
* X2 Engine" logo. If the display of the logo is not reasonably feasible for
* technical reasons, the Appropriate Legal Notices must display the words
* "Powered by X2 Engine".
**********************************************************************************/
$heading = Yii::t('contacts','{module} Lists', array('{module}'=>Modules::displayName(false)));
$this->pageTitle = $heading;
$opportunityModule = Modules::model()->findByAttributes(array('name'=>'opportunities'));
$accountModule = Modules::model()->findByAttributes(array('name'=>'accounts'));
$menuOptions = array(
'all', 'lists', 'create', 'createList',
);
if ($opportunityModule->visible && $accountModule->visible)
$menuOptions[] = 'quick';
$this->insertMenu($menuOptions);
Yii::app()->clientScript->registerScript('search', "
$('.search-button').click(function(){
$('.search-form').toggle();
return false;
});
$('.search-form form').submit(function(){
$.fn.yiiGridView.update('contacts-grid', {
data: $(this).serialize()
});
return false;
});
");
?>
<?php
foreach(Yii::app()->user->getFlashes() as $key => $message) {
echo '<div class="flash-' . $key . '">' . $message . "</div>\n";
} ?>
<?php
$attributeLabels = CActiveRecord::model('X2List')->attributeLabels();
$this->widget('X2GridViewGeneric', array(
'id'=>'lists-grid',
//'enableSorting'=>tru,
//'baseScriptUrl'=>Yii::app()->theme->getBaseUrl().'/css/gridview',
//'htmlOptions'=>array('class'=>'grid-view contact-lists fullscreen'),
'template'=> '<div class="page-title icon contacts"><h2>'.$heading.'</h2>{buttons}{filterHint}{summary}</div>{items}{pager}',
'buttons' => array('clearFilters', 'autoResize'),
'summaryText' => Yii::t('app','<b>{start}–{end}</b> of <b>{count}</b>')
. '<div class="form no-border" style="display:inline;"> '
. CHtml::dropDownList('resultsPerPage', Profile::getResultsPerPage(),Profile::getPossibleResultsPerPage(),array(
'ajax' => array(
'url' => $this->createUrl('/profile/setResultsPerPage'),
'data' => 'js:{results:$(this).val()}',
'complete' => 'function(response) { $.fn.yiiGridView.update("lists-grid"); }',
),
// 'style' => 'margin: 0;',
))
. ' </div>',
'dataProvider'=>$contactLists,
'filter' => $filter,
'gvSettingsName' => 'listsGrid',
// 'filter'=>$model,
//'rowCssClassExpression'=>'$data["id"]==="all"?"bold":"$this->rowCssClass[$row%"',
'rowCssClassExpression'=>'$this->rowCssClass[$row%2].($data["id"]==="all"?" bold":"")',
'defaultGvSettings' => array (
'name' => 180,
'type' => 180,
'assignedTo' => 180,
'count' => 180,
'gvControls' => 75,
),
'columns'=>array(
array(
'name'=>'name',
'header'=>$attributeLabels['name'],
'type'=>'raw',
'value'=>'CHtml::link($data["name"],X2List::getRoute($data["id"]))',
),
array(
'name'=>'type',
'header'=>$attributeLabels['type'],
'type'=>'raw',
'value'=>'$data["type"]=="static"? Yii::t("contacts","Static") : Yii::t("contacts","Dynamic")',
),
array(
'name'=>'assignedTo',
'header'=>$attributeLabels['assignedTo'],
'type'=>'raw',
'value'=>'User::getUserLinks($data["assignedTo"])',
),
array(
'name'=>'count',
'header'=>$attributeLabels['count'],
'headerHtmlOptions'=>array('class'=>'contact-count'),
'htmlOptions'=>array('class'=>'contact-count'),
'filter' => '',
// Show estimated count for dynamic lists to avoid multiple expensive calculations
'value'=>'Yii::app()->locale->numberFormatter->formatDecimal(($data["type"] == "dynamic") ? $data["count"] : $data->calculateCount ())',
),
array (
'id' => 'C_gvControls',
'class' => 'X2ButtonColumn',
'header' => Yii::t('app','Tools'),
'updateButtonUrl' =>
"Yii::app()->createUrl ('/contacts/updateList', array ('id' => \$data['id']))",
'cssClassExpression' =>
"!is_numeric (\$data['id']) ? 'hide-edit-delete-buttons' : ''",
'viewButtonUrl' =>
"X2List::getRoute (\$data['id'])",
'deleteButtonUrl' =>
"Yii::app()->createUrl ('/contacts/deleteList', array ('id' => \$data['id']))",
),
),
)); ?>
<div class="form">
<?php echo CHtml::link('<span>'.Yii::t('app','New List').'</span>',array('/products/products/createList'),array('class'=>'x2-button')); ?>
</div>
| {
"pile_set_name": "Github"
} |
{
"tests": [
{
"name": "ApiManagement Service Products - Minimal",
"definition": "https://schema.management.azure.com/schemas/2018-01-01/Microsoft.ApiManagement.json#/resourceDefinitions/service_products",
"json": {
"apiVersion": "2018-01-01",
"type": "Microsoft.ApiManagement/service/products",
"name": "testproduct",
"properties": {
"displayName": "Test Template ProductName 4",
"subscriptionRequired": true,
"approvalRequired": false,
"state": "notPublished"
}
}
},
{
"name": "ApiManagement Service Products - invalidType",
"expectedErrors": [
{
"message": "No enum match for: \"Microsoft.ApiManagement/invalidType\"",
"dataPath": "/type",
"schemaPath": "/properties/type/type"
},
{
"message": "No enum match for: \"2015-10-12\"",
"dataPath": "/apiVersion",
"schemaPath": "/properties/apiVersion/type"
}
],
"definition": "https://schema.management.azure.com/schemas/2018-01-01/Microsoft.ApiManagement.json#/resourceDefinitions/service_products",
"json": {
"type": "Microsoft.ApiManagement/invalidType",
"apiVersion": "2015-10-12",
"name": "testproduct",
"properties": {
"displayName": "Test Template ProductName 4",
"subscriptionRequired": true,
"approvalRequired": false,
"state": "notPublished"
}
}
}
]
} | {
"pile_set_name": "Github"
} |
from .bert import BERT
from .language_model import BERTLM
| {
"pile_set_name": "Github"
} |
<?php
/**
* Squiz_Sniffs_Functions_MultiLineFunctionDeclarationSniff.
*
* PHP version 5
*
* @category PHP
* @package PHP_CodeSniffer
* @author Greg Sherwood <[email protected]>
* @copyright 2006-2014 Squiz Pty Ltd (ABN 77 084 670 600)
* @license https://github.com/squizlabs/PHP_CodeSniffer/blob/master/licence.txt BSD Licence
* @link http://pear.php.net/package/PHP_CodeSniffer
*/
if (class_exists('PEAR_Sniffs_Functions_FunctionDeclarationSniff', true) === false) {
$error = 'Class PEAR_Sniffs_Functions_FunctionDeclarationSniff not found';
throw new PHP_CodeSniffer_Exception($error);
}
/**
* Squiz_Sniffs_Functions_MultiLineFunctionDeclarationSniff.
*
* Ensure single and multi-line function declarations are defined correctly.
*
* @category PHP
* @package PHP_CodeSniffer
* @author Greg Sherwood <[email protected]>
* @copyright 2006-2014 Squiz Pty Ltd (ABN 77 084 670 600)
* @license https://github.com/squizlabs/PHP_CodeSniffer/blob/master/licence.txt BSD Licence
* @version Release: @package_version@
* @link http://pear.php.net/package/PHP_CodeSniffer
*/
class Squiz_Sniffs_Functions_MultiLineFunctionDeclarationSniff extends PEAR_Sniffs_Functions_FunctionDeclarationSniff
{
/**
* A list of tokenizers this sniff supports.
*
* @var array
*/
public $supportedTokenizers = array(
'PHP',
'JS',
);
/**
* Determine if this is a multi-line function declaration.
*
* @param PHP_CodeSniffer_File $phpcsFile The file being scanned.
* @param int $stackPtr The position of the current token
* in the stack passed in $tokens.
* @param int $openBracket The position of the opening bracket
* in the stack passed in $tokens.
* @param array $tokens The stack of tokens that make up
* the file.
*
* @return void
*/
public function isMultiLineDeclaration(PHP_CodeSniffer_File $phpcsFile, $stackPtr, $openBracket, $tokens)
{
$bracketsToCheck = array($stackPtr => $openBracket);
// Closures may use the USE keyword and so be multi-line in this way.
if ($tokens[$stackPtr]['code'] === T_CLOSURE) {
$use = $phpcsFile->findNext(T_USE, ($tokens[$openBracket]['parenthesis_closer'] + 1), $tokens[$stackPtr]['scope_opener']);
if ($use !== false) {
$open = $phpcsFile->findNext(T_OPEN_PARENTHESIS, ($use + 1));
if ($open !== false) {
$bracketsToCheck[$use] = $open;
}
}
}
foreach ($bracketsToCheck as $stackPtr => $openBracket) {
// If the first argument is on a new line, this is a multi-line
// function declaration, even if there is only one argument.
$next = $phpcsFile->findNext(PHP_CodeSniffer_Tokens::$emptyTokens, ($openBracket + 1), null, true);
if ($tokens[$next]['line'] !== $tokens[$stackPtr]['line']) {
return true;
}
$closeBracket = $tokens[$openBracket]['parenthesis_closer'];
$end = $phpcsFile->findEndOfStatement($openBracket + 1);
while ($tokens[$end]['code'] === T_COMMA) {
// If the next bit of code is not on the same line, this is a
// multi-line function declaration.
$next = $phpcsFile->findNext(PHP_CodeSniffer_Tokens::$emptyTokens, ($end + 1), $closeBracket, true);
if ($next === false) {
continue(2);
}
if ($tokens[$next]['line'] !== $tokens[$end]['line']) {
return true;
}
$end = $phpcsFile->findEndOfStatement($next);
}
// We've reached the last argument, so see if the next content
// (should be the close bracket) is also on the same line.
$next = $phpcsFile->findNext(PHP_CodeSniffer_Tokens::$emptyTokens, ($end + 1), $closeBracket, true);
if ($next !== false && $tokens[$next]['line'] !== $tokens[$end]['line']) {
return true;
}
}//end foreach
return false;
}//end isMultiLineDeclaration()
/**
* Processes multi-line declarations.
*
* @param PHP_CodeSniffer_File $phpcsFile The file being scanned.
* @param int $stackPtr The position of the current token
* in the stack passed in $tokens.
* @param array $tokens The stack of tokens that make up
* the file.
*
* @return void
*/
public function processMultiLineDeclaration(PHP_CodeSniffer_File $phpcsFile, $stackPtr, $tokens)
{
// We do everything the parent sniff does, and a bit more.
parent::processMultiLineDeclaration($phpcsFile, $stackPtr, $tokens);
$openBracket = $tokens[$stackPtr]['parenthesis_opener'];
$this->processBracket($phpcsFile, $openBracket, $tokens, 'function');
if ($tokens[$stackPtr]['code'] !== T_CLOSURE) {
return;
}
$use = $phpcsFile->findNext(T_USE, ($tokens[$stackPtr]['parenthesis_closer'] + 1), $tokens[$stackPtr]['scope_opener']);
if ($use === false) {
return;
}
$openBracket = $phpcsFile->findNext(T_OPEN_PARENTHESIS, ($use + 1), null);
$this->processBracket($phpcsFile, $openBracket, $tokens, 'use');
// Also check spacing.
if ($tokens[($use - 1)]['code'] === T_WHITESPACE) {
$gap = strlen($tokens[($use - 1)]['content']);
} else {
$gap = 0;
}
}//end processMultiLineDeclaration()
/**
* Processes the contents of a single set of brackets.
*
* @param PHP_CodeSniffer_File $phpcsFile The file being scanned.
* @param int $openBracket The position of the open bracket
* in the stack passed in $tokens.
* @param array $tokens The stack of tokens that make up
* the file.
* @param string $type The type of the token the brackets
* belong to (function or use).
*
* @return void
*/
public function processBracket(PHP_CodeSniffer_File $phpcsFile, $openBracket, $tokens, $type='function')
{
$errorPrefix = '';
if ($type === 'use') {
$errorPrefix = 'Use';
}
$closeBracket = $tokens[$openBracket]['parenthesis_closer'];
// The open bracket should be the last thing on the line.
if ($tokens[$openBracket]['line'] !== $tokens[$closeBracket]['line']) {
$next = $phpcsFile->findNext(PHP_CodeSniffer_Tokens::$emptyTokens, ($openBracket + 1), null, true);
if ($tokens[$next]['line'] !== ($tokens[$openBracket]['line'] + 1)) {
$error = 'The first parameter of a multi-line '.$type.' declaration must be on the line after the opening bracket';
$fix = $phpcsFile->addFixableError($error, $next, $errorPrefix.'FirstParamSpacing');
if ($fix === true) {
$phpcsFile->fixer->addNewline($openBracket);
}
}
}
// Each line between the brackets should contain a single parameter.
$lastComma = null;
for ($i = ($openBracket + 1); $i < $closeBracket; $i++) {
// Skip brackets, like arrays, as they can contain commas.
if (isset($tokens[$i]['bracket_opener']) === true) {
$i = $tokens[$i]['bracket_closer'];
continue;
}
if (isset($tokens[$i]['parenthesis_opener']) === true) {
$i = $tokens[$i]['parenthesis_closer'];
continue;
}
if ($tokens[$i]['code'] !== T_COMMA) {
continue;
}
$next = $phpcsFile->findNext(T_WHITESPACE, ($i + 1), null, true);
if ($tokens[$next]['line'] === $tokens[$i]['line']) {
$error = 'Multi-line '.$type.' declarations must define one parameter per line';
$fix = $phpcsFile->addFixableError($error, $next, $errorPrefix.'OneParamPerLine');
if ($fix === true) {
$phpcsFile->fixer->addNewline($i);
}
}
}//end for
}//end processBracket()
}//end class
| {
"pile_set_name": "Github"
} |
designer: "Nicole Fally"
link: "https://plus.google.com/103935580494601406708/about"
avatar: {
file_name: "nicole_fally.png"
} | {
"pile_set_name": "Github"
} |
// excerpts from http://code.google.com/p/muduo/
//
// Use of this source code is governed by a BSD-style license
// that can be found in the License file.
//
// Author: Shuo Chen (chenshuo at chenshuo dot com)
#include "EPoller.h"
#include "Channel.h"
#include "logging/Logging.h"
#include <boost/static_assert.hpp>
#include <assert.h>
#include <errno.h>
#include <poll.h>
#include <sys/epoll.h>
using namespace muduo;
// On Linux, the constants of poll(2) and epoll(4)
// are expected to be the same.
BOOST_STATIC_ASSERT(EPOLLIN == POLLIN);
BOOST_STATIC_ASSERT(EPOLLPRI == POLLPRI);
BOOST_STATIC_ASSERT(EPOLLOUT == POLLOUT);
BOOST_STATIC_ASSERT(EPOLLRDHUP == POLLRDHUP);
BOOST_STATIC_ASSERT(EPOLLERR == POLLERR);
BOOST_STATIC_ASSERT(EPOLLHUP == POLLHUP);
namespace
{
const int kNew = -1;
const int kAdded = 1;
const int kDeleted = 2;
}
EPoller::EPoller(EventLoop* loop)
: ownerLoop_(loop),
epollfd_(::epoll_create1(EPOLL_CLOEXEC)),
events_(kInitEventListSize)
{
if (epollfd_ < 0)
{
LOG_SYSFATAL << "EPoller::EPoller";
}
}
EPoller::~EPoller()
{
::close(epollfd_);
}
Timestamp EPoller::poll(int timeoutMs, ChannelList* activeChannels)
{
int numEvents = ::epoll_wait(epollfd_,
&*events_.begin(),
static_cast<int>(events_.size()),
timeoutMs);
Timestamp now(Timestamp::now());
if (numEvents > 0)
{
LOG_TRACE << numEvents << " events happended";
fillActiveChannels(numEvents, activeChannels);
if (implicit_cast<size_t>(numEvents) == events_.size())
{
events_.resize(events_.size()*2);
}
}
else if (numEvents == 0)
{
LOG_TRACE << " nothing happended";
}
else
{
LOG_SYSERR << "EPoller::poll()";
}
return now;
}
void EPoller::fillActiveChannels(int numEvents,
ChannelList* activeChannels) const
{
assert(implicit_cast<size_t>(numEvents) <= events_.size());
for (int i = 0; i < numEvents; ++i)
{
Channel* channel = static_cast<Channel*>(events_[i].data.ptr);
#ifndef NDEBUG
int fd = channel->fd();
ChannelMap::const_iterator it = channels_.find(fd);
assert(it != channels_.end());
assert(it->second == channel);
#endif
channel->set_revents(events_[i].events);
activeChannels->push_back(channel);
}
}
void EPoller::updateChannel(Channel* channel)
{
assertInLoopThread();
LOG_TRACE << "fd = " << channel->fd() << " events = " << channel->events();
const int index = channel->index();
if (index == kNew || index == kDeleted)
{
// a new one, add with EPOLL_CTL_ADD
int fd = channel->fd();
if (index == kNew)
{
assert(channels_.find(fd) == channels_.end());
channels_[fd] = channel;
}
else // index == kDeleted
{
assert(channels_.find(fd) != channels_.end());
assert(channels_[fd] == channel);
}
channel->set_index(kAdded);
update(EPOLL_CTL_ADD, channel);
}
else
{
// update existing one with EPOLL_CTL_MOD/DEL
int fd = channel->fd();
(void)fd;
assert(channels_.find(fd) != channels_.end());
assert(channels_[fd] == channel);
assert(index == kAdded);
if (channel->isNoneEvent())
{
update(EPOLL_CTL_DEL, channel);
channel->set_index(kDeleted);
}
else
{
update(EPOLL_CTL_MOD, channel);
}
}
}
void EPoller::removeChannel(Channel* channel)
{
assertInLoopThread();
int fd = channel->fd();
LOG_TRACE << "fd = " << fd;
assert(channels_.find(fd) != channels_.end());
assert(channels_[fd] == channel);
assert(channel->isNoneEvent());
int index = channel->index();
assert(index == kAdded || index == kDeleted);
size_t n = channels_.erase(fd);
(void)n;
assert(n == 1);
if (index == kAdded)
{
update(EPOLL_CTL_DEL, channel);
}
channel->set_index(kNew);
}
void EPoller::update(int operation, Channel* channel)
{
struct epoll_event event;
bzero(&event, sizeof event);
event.events = channel->events();
event.data.ptr = channel;
int fd = channel->fd();
if (::epoll_ctl(epollfd_, operation, fd, &event) < 0)
{
if (operation == EPOLL_CTL_DEL)
{
LOG_SYSERR << "epoll_ctl op=" << operation << " fd=" << fd;
}
else
{
LOG_SYSFATAL << "epoll_ctl op=" << operation << " fd=" << fd;
}
}
}
| {
"pile_set_name": "Github"
} |
/*
* Copyright (c) 2009 Baptiste Coudurier <[email protected]>
*
* This file is part of FFmpeg.
*
* FFmpeg 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.
*
* FFmpeg 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 FFmpeg; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef AVUTIL_RANDOM_SEED_H
#define AVUTIL_RANDOM_SEED_H
#include <stdint.h>
/**
* @addtogroup lavu_crypto
* @{
*/
/**
* Get a seed to use in conjunction with random functions.
* This function tries to provide a good seed at a best effort bases.
* Its possible to call this function multiple times if more bits are needed.
* It can be quite slow, which is why it should only be used as seed for a faster
* PRNG. The quality of the seed depends on the platform.
*/
uint32_t av_get_random_seed(void);
/**
* @}
*/
#endif /* AVUTIL_RANDOM_SEED_H */
| {
"pile_set_name": "Github"
} |
package com.eveningoutpost.dexdrip.watch.lefun.messages;
// jamorham
public class RxFind extends BaseRx {
public static byte opcode = 0x0A;
{
length = 4;
}
@Override
public BaseRx fromBytes(final byte[] bytes) {
this.bytes = bytes;
if (!validate(opcode)) {
return null;
}
return this;
}
}
| {
"pile_set_name": "Github"
} |
{
"cells": [
{
"cell_type": "code",
"execution_count": 5,
"metadata": {
"collapsed": false
},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"681\n"
]
}
],
"source": [
"import random\n",
"number=random.randint(1,1000)\n",
"print(number)"
]
},
{
"cell_type": "code",
"execution_count": 12,
"metadata": {
"collapsed": false
},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"9.800899899920305\n",
"10\n",
"9\n"
]
}
],
"source": [
"import random,math\n",
"number=random.randint(1,1000)\n",
"print(math.log2(number))\n",
"print(math.ceil(math.log2(number)))\n",
"max_times=int(math.log2(number))\n",
"print(max_times)"
]
},
{
"cell_type": "code",
"execution_count": 14,
"metadata": {
"collapsed": false
},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"i= 0\n",
"===========\n",
"the i in if == 100\n",
"==========\n",
"i= 0\n",
"j= 0\n",
"j= 1\n",
"j= 2\n",
"break\n",
"i= 1\n",
"j= 2\n",
"break\n",
"i= 2\n",
"j= 2\n",
"break\n",
"i= 3\n",
"j= 2\n",
"break\n",
"i= 4\n",
"j= 2\n",
"break\n"
]
}
],
"source": [
"i=0\n",
"while i<1000:\n",
" print(\"i=\",i)\n",
" break\n",
"print(\"===========\")\n",
"i=0\n",
"while i<1000:\n",
" i+=1\n",
" if i==100:\n",
" print(\"the i in if ==\",i)\n",
" break\n",
"print(\"==========\")\n",
"i=0\n",
"j=0\n",
"while i<5:\n",
" print('i=',i)\n",
" while j<100:\n",
" print(\"j=\",j)\n",
" if j==2:\n",
" print(\"break\")\n",
" break\n",
" j+=1\n",
" i+=1"
]
},
{
"cell_type": "code",
"execution_count": 21,
"metadata": {
"collapsed": false
},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"please enter m :1\n",
"please enter k :9\n",
"please enter n5\n",
"2.32379000772445\n"
]
}
],
"source": [
"import random,math\n",
"\n",
"m=int(input('please enter m :'))\n",
"k=int(input('please enter k :'))\n",
"n=int(input('please enter n'))\n",
"total=0\n",
"i=0\n",
"\n",
"while i<n:\n",
" i+=1\n",
" total+=random.randint(m,k)\n",
"print(math.sqrt(total/n))"
]
},
{
"cell_type": "code",
"execution_count": 1,
"metadata": {
"collapsed": false
},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"plz enter n: 9\n",
"plz enter m: 1\n",
"plz enter k: 9\n",
"12.737288958943898 1.816068701548853\n"
]
}
],
"source": [
"import random,math\n",
"\n",
"n=int(input('plz enter n: '))\n",
"m=int(input('plz enter m: '))\n",
"k=int(input('plz enter k: '))\n",
"\n",
"total1=0\n",
"total2=0\n",
"i=0\n",
"while i<n:\n",
" temp=random.randint(m,k)\n",
" total1+=math.log(temp)\n",
" total2+=1/total1\n",
" i+=1\n",
"print(total1,total2,sep=' ')"
]
},
{
"cell_type": "code",
"execution_count": 11,
"metadata": {
"collapsed": false
},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"plz enter n :5\n",
"tempt 7\n",
"total 7\n",
"tempt 77\n",
"total 84\n",
"tempt 777\n",
"total 861\n",
"tempt 7777\n",
"total 8638\n",
"tempt 77777\n",
"total 86415\n",
"the toal number is : 86415\n"
]
}
],
"source": [
"import math,random\n",
"\n",
"i=0\n",
"single=random.randint(1,9)\n",
"total=0\n",
"temp=0\n",
"n=int(input('plz enter n :'))\n",
"\n",
"while i<n:\n",
" temp=(10*temp+single)\n",
" i+=1\n",
" print(\"tempt\",temp)\n",
" total+=temp\n",
" print('total',total)\n",
"print('the toal number is : ',total)"
]
},
{
"cell_type": "code",
"execution_count": 1,
"metadata": {
"collapsed": false
},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"=====MENU=====\n",
" 1. how to play\n",
" 2. start game\n",
" 3. quit\n",
" 4. info\n",
" =====MENU=====\n",
"Please enter your choice: 1\n",
"First enter the biggest number you may hold in your mind\n",
" Then I will guess a number and tell you what it is\n",
" If the number is smaller than the one you are thinking about, please tell me bigger\n",
" If the number is bigger than that, please tell me smaller\n",
" Otherwise please tell me bingo\n",
" Have a good time!\n",
"=====MENU=====\n",
" 1. how to play\n",
" 2. start game\n",
" 3. quit\n",
" 4. info\n",
" =====MENU=====\n",
"Please enter your choice: 4\n",
"programmed,designed and sponsored by: Wanqiong Xie\n",
" Thanks for my teacher though I don't know who he is(X)\n",
" Sending you times of kisses~(Actually I won't do that, I promiss)\n",
"=====MENU=====\n",
" 1. how to play\n",
" 2. start game\n",
" 3. quit\n",
" 4. info\n",
" =====MENU=====\n",
"Please enter your choice: 2\n",
"Please enter the biggest number you may guess50\n",
"25 , right?\n",
"bigger\n",
"37 , right?\n",
"bigger\n",
"43 , right?\n",
"smaller\n",
"40 , right?\n",
"smaller\n",
"38 , right?\n",
"bingo\n",
"Haha, quite so easy! \n",
"=====MENU=====\n",
" 1. how to play\n",
" 2. start game\n",
" 3. quit\n",
" 4. info\n",
" =====MENU=====\n",
"Please enter your choice: 3\n",
"See you~\n"
]
}
],
"source": [
"import random, math\n",
"\n",
"\n",
"def win():\n",
" print(\"Haha, quite so easy! \")\n",
" \n",
"def lose():\n",
" print(\"Hum...I bet I'll win the next time!\")\n",
"\n",
"def game_over():\n",
" print(\"See you~\")\n",
"\n",
"def show_team():\n",
" print('''programmed,designed and sponsored by: Wanqiong Xie\n",
" Thanks for my teacher though I don't know who he is(X)\n",
" Sending you times of kisses~(Actually I won't do that, I promiss)''')\n",
"\n",
"def show_instruction():\n",
" print('''First enter the biggest number you may hold in your mind\n",
" Then I will guess a number and tell you what it is\n",
" If the number is smaller than the one you are thinking about, please tell me bigger\n",
" If the number is bigger than that, please tell me smaller\n",
" Otherwise please tell me bingo\n",
" Have a good time!''')\n",
"\n",
"def menu():\n",
" print('''=====MENU=====\n",
" 1. how to play\n",
" 2. start game\n",
" 3. quit\n",
" 4. info\n",
" =====MENU=====''')\n",
" \n",
"def guess_game():\n",
" n = int(input('Please enter the biggest number you may guess'))\n",
" max_times = math.ceil(math.log(n, 2))\n",
" chances = 0\n",
" a=1\n",
" b=n\n",
" \n",
" while chances<=max_times:\n",
" guess=int((a+b)/2)\n",
" print(guess,\", right?\")\n",
" judge=input()\n",
" if judge==\"smaller\":\n",
" b=guess\n",
" elif judge==\"bigger\":\n",
" a=guess\n",
" else :\n",
" win()\n",
" break\n",
" chances+=1\n",
" if chances>max_times :\n",
" lose()\n",
" \n",
" \n",
"\n",
"# 主函数\n",
"def main():\n",
" while True:\n",
" menu()\n",
" choice = int(input('Please enter your choice: '))\n",
" if choice == 1:\n",
" show_instruction()\n",
" elif choice == 2:\n",
" guess_game()\n",
" elif choice == 3:\n",
" game_over()\n",
" break\n",
" else:\n",
" show_team()\n",
"\n",
"\n",
"#主程序\n",
"if __name__ == '__main__':\n",
" main()"
]
},
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"collapsed": true
},
"outputs": [],
"source": []
}
],
"metadata": {
"kernelspec": {
"display_name": "Python 3",
"language": "python",
"name": "python3"
},
"language_info": {
"codemirror_mode": {
"name": "ipython",
"version": 3
},
"file_extension": ".py",
"mimetype": "text/x-python",
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
"version": "3.6.0"
}
},
"nbformat": 4,
"nbformat_minor": 2
}
| {
"pile_set_name": "Github"
} |
#!/bin/bash
DIR=$(cd `dirname $0` && pwd)
TASK="build"
POSITIONAL=()
while [[ $# -gt 0 ]]
do
key="$1"
case $key in
-t|--task)
TASK="$2"
shift # past argument
shift # past value
;;
*) # unknown option
POSITIONAL+=("$1") # save it in an array for later
shift # past argument
;;
esac
done
set -- "${POSITIONAL[@]}" # restore positional parameters
echo TASK: "$TASK"
if [ "$TASK" = "npm" ]; then
cd ${DIR}
npm install -g gulp-cli
npm install
fi
if [ "$TASK" = "build" ]; then
#cd ${DIR}
gulp styles --themes Default,DeepForest,Funny,Sand --build a
gulp js:build --build a
gulp js:min --build a
#gulp test
fi
if [ "$TASK" = "pack" ]; then
PRODUCT_VERSION=`cat VERSION`
echo CREATE ZIP FILE: "${PRODUCT_NAME}_${PRODUCT_VERSION}.zip"
zip -rq ${PRODUCT_NAME}_${PRODUCT_VERSION}.zip data/settings/config.json data/settings/modules modules static system vendor dev ".htaccess" dav.php index.php LICENSE VERSION README.md CHANGELOG.txt favicon.ico robots.txt package.json composer.json composer.lock modules.json gulpfile.js pre-config.json -x **/*.bak *.git*
fi
if [ "$TASK" = "upload" ]; then
cd ${DIR}
PRODUCT_VERSION=`cat VERSION`
echo UPLOAD ZIP FILE: "${PRODUCT_NAME}_${PRODUCT_VERSION}.zip"
curl -v --ftp-create-dirs --retry 6 -T ${PRODUCT_NAME}_${PRODUCT_VERSION}.zip -u ${FTP_USER}:${FTP_PASSWORD} ftp://afterlogic.com/
fi
| {
"pile_set_name": "Github"
} |
/* Test module for bug-dlsym1.c test case. */
extern int dlopen_test_variable;
extern char foo (void);
/* here to get the unresolved symbol in our .so */
char foo(void)
{
return dlopen_test_variable;
}
| {
"pile_set_name": "Github"
} |
// Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file
// for details. All rights reserved. Use of this source code is governed by a
// BSD-style license that can be found in the LICENSE file.
// WARNING: Do not edit - generated code.
part of $LIBRARYNAME;
$(ANNOTATIONS)$(NATIVESPEC)$(CLASS_MODIFIERS)class $CLASSNAME$EXTENDS$IMPLEMENTS {
@Creates('Null') // Set from Dart code; does not instantiate a native type.
var _dartDetail;
factory $CLASSNAME(String type,
{bool canBubble: true, bool cancelable: true, Object$NULLABLE detail}) {
final CustomEvent e = document._createEvent('CustomEvent') $#NULLSAFECAST(as CustomEvent);
e._dartDetail = detail;
// Only try setting the detail if it's one of these types to avoid
// first-chance exceptions. Can expand this list in the future as needed.
if (detail is List || detail is Map || detail is String || detail is num) {
try {
detail = convertDartToNative_SerializedScriptValue(detail);
e._initCustomEvent(type, canBubble, cancelable, detail);
} catch(_) {
e._initCustomEvent(type, canBubble, cancelable, null);
}
} else {
e._initCustomEvent(type, canBubble, cancelable, null);
}
return e;
}
get detail {
if (_dartDetail != null) {
return _dartDetail;
}
return _detail;
}
$!MEMBERS
}
| {
"pile_set_name": "Github"
} |
var locale = require('relative-time-format/locale/lb')
module.exports = {
locale: locale.locale,
// Standard styles.
long: locale.long,
short: locale.short,
narrow: locale.narrow,
// Quantifier.
quantify: locale.quantify
} | {
"pile_set_name": "Github"
} |
#if defined( USE_LIGHTMAP ) || defined( USE_AOMAP )
attribute vec2 uv2;
varying vec2 vUv2;
#endif | {
"pile_set_name": "Github"
} |
-- This is a Cabal package environment file.
-- THIS FILE IS AUTO-GENERATED. DO NOT EDIT DIRECTLY.
-- Please create a 'cabal.config' file in the same directory
-- if you want to change the default settings for this sandbox.
local-repo: /home/me/doctest-haskell/.cabal-sandbox/packages
logs-dir: /home/me/doctest-haskell/.cabal-sandbox/logs
world-file: /home/me/doctest-haskell/.cabal-sandbox/world
user-install: False
package-db: /home/me/doctest-haskell/.cabal-sandbox/i386-osx-ghc-7.6.3-packages.conf.d
build-summary: /home/me/doctest-haskell/.cabal-sandbox/logs/build.log
install-dirs
prefix: /home/me/doctest-haskell/.cabal-sandbox
bindir: $prefix/bin
libdir: $prefix/lib
libsubdir: $arch-$os-$compiler/$pkgid
libexecdir: $prefix/libexec
datadir: $prefix/share
datasubdir: $arch-$os-$compiler/$pkgid
docdir: $datadir/doc/$arch-$os-$compiler/$pkgid
htmldir: $docdir/html
haddockdir: $htmldir
sysconfdir: $prefix/etc
| {
"pile_set_name": "Github"
} |
# @fortawesome/fontawesome-common-types - SVG with JavaScript
> "I came here to chew bubblegum and install Font Awesome 5 - and I'm all out of bubblegum"
[](https://www.npmjs.com/package/@fortawesome/fontawesome-common-types)
## What is this package?
Font Awesome 5 JavaScript packages support TypeScript. This package abstracts out some of the common definitions that those packages use.
## Here be dragons
If you are trying to import types from this package we *highly* recommend you do the following instead as *all types in this package are re-exported to the main fontawesome package*.
your.ts
```
import {
IconName
} from `@fortawesome/fontawesome`
const myIcon: IconName = "..."
```
## Issues and support
Start with [GitHub issues](https://github.com/FortAwesome/Font-Awesome/issues) and ping us on [Twitter](https://twitter.com/fontawesome) if you need to.
| {
"pile_set_name": "Github"
} |
{
"core": {
"third-party": {
"login": {
"tests/login": {}
},
"home": {
"tests/home": {}
},
"settings": {
"tests/settings": {}
}
}
},
"widget/common": {
"widget/follow": {},
"widget/gallery": {},
"widget/share": {}
},
"WidgetShare": {}
}
| {
"pile_set_name": "Github"
} |
# bash shell function completion -*- shell-script -*-
_function()
{
local cur prev words cword
_init_completion || return
if [[ $1 == @(declare|typeset) ]]; then
if [[ $cur == [-+]* ]]; then
local opts
opts=($(_parse_usage "$1"))
# Most options also have a '+' form. We'll exclude the ones that don't with compgen.
opts+=(${opts[*]/-/+})
COMPREPLY=($(compgen -W "${opts[*]}" -X '+[Ffgp]' -- "$cur"))
else
local i=1
while [[ ${words[i]} == [-+]* ]]; do
if [[ ${words[i]} == -*[fF]* ]]; then
COMPREPLY=($(compgen -A function -- "$cur"))
return
fi
((i++))
done
if ((i > 1)); then
# There was at least one option and it was not one that limited operations to functions
COMPREPLY=($(compgen -A variable -- "$cur"))
fi
fi
elif ((cword == 1)); then
COMPREPLY=($(compgen -A function -- "$cur"))
else
COMPREPLY=("() $(type -- ${words[1]} | command sed -e 1,2d)")
fi
} &&
complete -F _function function declare typeset
# ex: filetype=sh
| {
"pile_set_name": "Github"
} |
# Miro - an RSS based video player application
# Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2011
# Participatory Culture Foundation
#
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
#
# In addition, as a special exception, the copyright holders give
# permission to link the code of portions of this program with the OpenSSL
# library.
#
# You must obey the GNU General Public License in all respects for all of
# the code used other than OpenSSL. If you modify file(s) with this
# exception, you may extend this exception to your version of the file(s),
# but you are not obligated to do so. If you do not wish to do so, delete
# this exception statement from your version. If you delete this exception
# statement from all source files in the program, then also delete it here.
"""browser.py -- portable browser code. It checks if incoming URLs to see
what to do with them.
"""
import logging
from urlparse import urlparse
from miro import app
from miro import flashscraper
from miro import filetypes
from miro import messages
from miro import subscription
from miro import util
from miro.plat import resources
from miro.plat.frontends.widgets import timer
from miro.plat.frontends.widgets import widgetset
from miro.plat.frontends.widgets.threads import call_on_ui_thread
from miro.frontends.widgets import itemlistwidgets
from miro.frontends.widgets import separator
from miro.frontends.widgets import imagebutton
from miro.frontends.widgets import imagepool
from miro.frontends.widgets import widgetutil
from miro.gtcache import gettext as _
class BrowserLoadingImage(widgetset.HBox):
THROBBER_WIDTH = 55
DOWNLOAD_WIDTH = 62
def __init__(self):
widgetset.HBox.__init__(self)
self.download = imagepool.get_image_display(
resources.path('images/download-started.png'))
self.throbber_shown = False
self.download_shown = False
self._width = None
self.set_size_request(62, 37)
@staticmethod
def get_throbber():
# XXX this is a hack; having one throbber attribute doesn't seem to
# correctly re-pack it a second time
return widgetset.AnimatedImageDisplay(
resources.path('images/throbber.gif'))
def do_size_allocated(self, width, height):
if self._width != width:
self._width = width
self.redraw()
def clear(self):
for widget in list(self.children):
self.remove(widget)
def redraw(self):
if self._width is None:
# Haven't seen a size-allocated signal yet. Wait until we get one
# to draw ourselves
return
self.clear()
available = self._width
right_padding = 0
if self.download_shown:
self.pack_start(self.download)
available -= self.DOWNLOAD_WIDTH
right_padding = self.DOWNLOAD_WIDTH
if (self.throbber_shown and
available >= (self.THROBBER_WIDTH + right_padding)):
self.pack_start(widgetutil.align_center(self.get_throbber(),
right_pad=right_padding),
expand=True)
def set_throbber(self, value):
if value != self.throbber_shown:
self.throbber_shown = value
self.redraw()
def set_download(self, value):
if value != self.download_shown:
self.download_shown = value
self.redraw()
class BrowserToolbar(itemlistwidgets.Titlebar):
"""
Forward/back/home & "display in browser" buttons
"""
def __init__(self):
itemlistwidgets.Titlebar.__init__(self)
hbox = widgetset.HBox()
self.add(hbox)
self.create_signal('browser-reload')
self.create_signal('browser-back')
self.create_signal('browser-forward')
self.create_signal('browser-stop')
self.create_signal('browser-home')
self.create_signal('address-entered')
self.create_signal('browser-download')
self.create_signal('browser-open')
self.back_button = imagebutton.ImageButton('navback')
self.back_button.set_squish_width(True)
self.back_button.connect('clicked', self._on_back_button_clicked)
self.back_button.disable()
hbox.pack_start(widgetutil.align_middle(self.back_button, left_pad=10))
nav_separator = widgetset.ImageDisplay(imagepool.get(
resources.path('images/navseparator.png')))
hbox.pack_start(widgetutil.align_middle(nav_separator))
self.forward_button = imagebutton.ImageButton('navforward')
self.forward_button.set_squish_width(True)
self.forward_button.connect('clicked', self._on_forward_button_clicked)
self.forward_button.disable()
hbox.pack_start(widgetutil.align_middle(self.forward_button))
self.reload_button = imagebutton.ImageButton('navreload')
self.reload_button.connect('clicked', self._on_reload_button_clicked)
hbox.pack_start(widgetutil.align_middle(self.reload_button,
left_pad=4))
self.stop_button = imagebutton.ImageButton('navstop')
self.stop_button.connect('clicked', self._on_stop_button_clicked)
hbox.pack_start(widgetutil.align_middle(self.stop_button, left_pad=4))
self.home_button = imagebutton.ImageButton('navhome')
self.home_button.connect('clicked', self._on_home_button_clicked)
hbox.pack_start(widgetutil.align_middle(self.home_button, left_pad=4))
self.browser_open_button = widgetutil.TitlebarButton(
_('Open in browser'), 'navopen')
self.browser_open_button.connect(
'clicked', self._on_browser_open_activate)
hbox.pack_end(widgetutil.align_middle(self.browser_open_button,
right_pad=10))
self.download_button = widgetutil.TitlebarButton(
_("Download this video"), 'navdownload')
self.download_button.connect('clicked',
self._on_download_button_clicked)
self.download_button = widgetutil.HideableWidget(self.download_button)
hbox.pack_end(widgetutil.align_middle(self.download_button,
right_pad=4))
self.loading_icon = BrowserLoadingImage()
hbox.pack_start(widgetutil.align_middle(self.loading_icon),
expand=True)
def _on_back_button_clicked(self, button):
self.emit('browser-back')
def _on_forward_button_clicked(self, button):
self.emit('browser-forward')
def _on_stop_button_clicked(self, button):
self.emit('browser-stop')
def _on_reload_button_clicked(self, button):
self.emit('browser-reload')
def _on_home_button_clicked(self, button):
self.emit('browser-home')
def _on_download_button_clicked(self, button):
self.emit('browser-download')
def _on_browser_open_activate(self, button):
self.emit('browser-open')
class Browser(widgetset.Browser):
def __init__(self, guide_info):
widgetset.Browser.__init__(self)
self.create_signal('download-started')
self.guide_info = guide_info
self.seen_cache = {}
def handle_unknown_url(self, url):
self.seen_cache[url] = 1
self.navigate(url)
def unknown_callback(self, url):
""" callback to use for unknown URLs"""
call_on_ui_thread(self.handle_unknown_url, url)
def should_load_url(self, url):
"""Returns True if the Miro browser should handle the url and
False otherwise.
Situations which should return false:
* if the url is something that Miro should download instead
* other things?
"""
logging.debug("got %s", url)
if url in self.seen_cache:
del self.seen_cache[url]
return True
url = util.to_uni(url)
if subscription.is_subscribe_link(url):
self.emit('download-started')
messages.SubscriptionLinkClicked(url).send_to_backend()
return False
if filetypes.is_maybe_rss_url(url):
logging.debug("miro wants to handle %s", url)
self.emit('download-started')
messages.DownloadURL(url, self.unknown_callback).send_to_backend()
return False
# parse the path out of the url and run that through the filetypes
# code to see if it might be a video, audio or torrent file.
# if so, try downloading it.
ret = urlparse(url)
if filetypes.is_allowed_filename(ret[2]):
logging.debug("miro wants to handle %s", url)
self.emit('download-started')
messages.DownloadURL(url, self.unknown_callback).send_to_backend()
return False
if util.is_magnet_uri(url):
logging.debug("miro wants to handle %s", url)
self.emit('download-started')
messages.DownloadURL(url, self.unknown_callback).send_to_backend()
return False
return True
def should_load_mimetype(self, url, mimetype):
"""Like should_load_url(), but for mimetype checking. """
# FIXME: this never gets called on windows
if filetypes.is_allowed_mimetype(mimetype):
logging.debug("miro wants to handle %s", url)
metadata = {'mime_type': mimetype}
self.emit('download-started')
messages.DownloadURL(url, self.unknown_callback,
metadata).send_to_backend()
return False
return self.should_load_url(url)
def should_download_url(self, url, mimetype=None):
if mimetype and filetypes.is_download_mimetype(mimetype):
logging.debug('downloading %s (%s)', url, mimetype)
return True
if filetypes.is_download_url(url):
logging.debug('downloading %s' % url)
return True
return False
def do_download_finished(self, url):
logging.debug('finished downloading %s', url)
self.emit('download-started')
messages.DownloadURL(url, self.unknown_callback).send_to_backend()
class BrowserNav(widgetset.VBox):
def __init__(self, guide_info):
widgetset.VBox.__init__(self)
self.browser = Browser(guide_info)
self.toolbar = BrowserToolbar()
self.guide_info = guide_info
self.home_url = guide_info.url
self.pack_start(self.toolbar)
color1 = widgetutil.css_to_color('#bcbcbc')
color2 = widgetutil.css_to_color('#020202')
self.pack_start(separator.HSeparator(color1, color2))
self.pack_start(self.browser, expand=True)
self.toolbar.connect_weak('browser-back', self._on_browser_back)
self.toolbar.connect_weak('browser-forward', self._on_browser_forward)
self.toolbar.connect_weak('browser-reload', self._on_browser_reload)
self.toolbar.connect_weak('browser-stop', self._on_browser_stop)
self.toolbar.connect_weak('browser-home', self._on_browser_home)
self.toolbar.connect_weak('browser-download',
self._on_browser_download)
self.toolbar.connect_weak('browser-open', self._on_browser_open)
self.browser.connect_weak('net-start', self._on_net_start)
self.browser.connect_weak('net-stop', self._on_net_stop)
self.browser.connect_weak('download-started',
self._on_download_started)
self.browser.navigate(self.guide_info.url)
def enable_disable_navigation(self):
if self.browser.can_go_back():
self.toolbar.back_button.enable()
else:
self.toolbar.back_button.disable()
if self.browser.can_go_forward():
self.toolbar.forward_button.enable()
else:
self.toolbar.forward_button.disable()
def _on_net_start(self, widget):
self.toolbar.stop_button.enable()
self.enable_disable_navigation()
self.toolbar.loading_icon.set_throbber(True)
self.toolbar.download_button.hide()
def _on_net_stop(self, widget):
self.toolbar.stop_button.disable()
self.enable_disable_navigation()
self.toolbar.loading_icon.set_throbber(False)
logging.debug("checking %s", self.browser.get_current_url())
if flashscraper.is_maybe_flashscrapable(
unicode(self.browser.get_current_url())):
self.toolbar.download_button.show()
def _on_browser_back(self, widget):
self.browser.back()
def _on_browser_forward(self, widget):
self.browser.forward()
def _on_browser_reload(self, widget):
self.browser.reload()
def _on_browser_stop(self, widget):
self.browser.stop()
def _on_browser_home(self, widget):
self.browser.navigate(self.home_url)
def _on_browser_download(self, widget):
metadata = {"title": unicode(self.browser.get_current_title())}
messages.DownloadURL(self.browser.get_current_url(),
metadata=metadata).send_to_backend()
def _on_browser_open(self, widget):
app.widgetapp.open_url(self.browser.get_current_url())
def _on_download_started(self, widget):
"""
Shows the download started icon for 5 seconds, then hide it.
"""
self.toolbar.loading_icon.set_download(True)
timer.add(5, lambda: self.toolbar.loading_icon.set_download(False))
def destroy(self):
self.browser.destroy()
| {
"pile_set_name": "Github"
} |
/* XMRig
* Copyright 2010 Jeff Garzik <[email protected]>
* Copyright 2012-2014 pooler <[email protected]>
* Copyright 2014 Lucas Jones <https://github.com/lucasjones>
* Copyright 2014-2016 Wolf9466 <https://github.com/OhGodAPet>
* Copyright 2016 Jay D Dee <[email protected]>
* Copyright 2017-2018 XMR-Stak <https://github.com/fireice-uk>, <https://github.com/psychocrypt>
* Copyright 2018-2019 SChernykh <https://github.com/SChernykh>
* Copyright 2016-2019 XMRig <https://github.com/xmrig>, <[email protected]>
*
* 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/>.
*/
#ifndef XMRIG_API_H
#define XMRIG_API_H
#include <vector>
#include <cstdint>
#include "base/kernel/interfaces/IBaseListener.h"
#include "base/tools/Object.h"
#include "base/tools/String.h"
namespace xmrig {
class Base;
class Httpd;
class HttpData;
class IApiListener;
class IApiRequest;
class String;
class Api : public IBaseListener
{
public:
XMRIG_DISABLE_COPY_MOVE_DEFAULT(Api)
Api(Base *base);
~Api() override;
inline const char *id() const { return m_id; }
inline const char *workerId() const { return m_workerId; }
inline void addListener(IApiListener *listener) { m_listeners.push_back(listener); }
void request(const HttpData &req);
void start();
void stop();
protected:
void onConfigChanged(Config *config, Config *previousConfig) override;
private:
void exec(IApiRequest &request);
void genId(const String &id);
void genWorkerId(const String &id);
Base *m_base;
char m_id[32]{};
String m_workerId;
const uint64_t m_timestamp;
Httpd *m_httpd = nullptr;
std::vector<IApiListener *> m_listeners;
};
} // namespace xmrig
#endif /* XMRIG_API_H */
| {
"pile_set_name": "Github"
} |
"use strict";
module.exports = function (t, a) {
a(typeof t(), "boolean");
};
| {
"pile_set_name": "Github"
} |
/**
* Copyright (C) 2011-2020 Aratelia Limited - Juan A. Rubio and contributors
*
* This file is part of Tizonia
*
* Tizonia 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.
*
* Tizonia 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 Tizonia. If not, see <chromecast://www.gnu.org/licenses/>.
*/
/**
* @file cc_gmusicprc_decls.h
* @author Juan A. Rubio <[email protected]>
*
* @brief Google Music Chromecast renderer - processor declarations
*
*
*/
#ifndef CC_GMUSICPRC_DECLS_H
#define CC_GMUSICPRC_DECLS_H
#ifdef __cplusplus
extern "C" {
#endif
#include <stdbool.h>
#include <OMX_Core.h>
#include <tizgmusic_c.h>
#include <tizplatform.h>
#include "cc_prc_decls.h"
#include "cc_prc.h"
typedef struct cc_gmusic_prc cc_gmusic_prc_t;
struct cc_gmusic_prc
{
/* Object */
const cc_prc_t _;
OMX_TIZONIA_AUDIO_PARAM_GMUSICSESSIONTYPE gm_session_;
OMX_TIZONIA_AUDIO_PARAM_GMUSICPLAYLISTTYPE gm_playlist_;
tiz_gmusic_t * p_gm_;
};
typedef struct cc_gmusic_prc_class cc_gmusic_prc_class_t;
struct cc_gmusic_prc_class
{
/* Class */
const cc_prc_class_t _;
/* NOTE: Class methods might be added in the future */
};
#ifdef __cplusplus
}
#endif
#endif /* CC_GMUSICPRC_DECLS_H */
| {
"pile_set_name": "Github"
} |
// Copyright © 2017-present Sam Hocevar <[email protected]>
// Apache2
using System;
using System.Collections.Generic;
using System.IO;
namespace Typography.OpenFont.Tables
{
public class COLR : TableEntry
{
public const string _N = "COLR";
public override string Name => _N;
// Read the COLR table
// https://www.microsoft.com/typography/otspec/colr.htm
protected override void ReadContentFrom(BinaryReader reader)
{
long offset = reader.BaseStream.Position;
ushort version = reader.ReadUInt16();
ushort glyphCount = reader.ReadUInt16();
uint glyphsOffset = reader.ReadUInt32();
uint layersOffset = reader.ReadUInt32();
ushort layersCount = reader.ReadUInt16();
GlyphLayers = new ushort[layersCount];
GlyphPalettes = new ushort[layersCount];
reader.BaseStream.Seek(offset + glyphsOffset, SeekOrigin.Begin);
for (int i = 0; i < glyphCount; ++i)
{
ushort gid = reader.ReadUInt16();
LayerIndices[gid] = reader.ReadUInt16();
LayerCounts[gid] = reader.ReadUInt16();
}
reader.BaseStream.Seek(offset + layersOffset, SeekOrigin.Begin);
for (int i = 0; i < GlyphLayers.Length; ++i)
{
GlyphLayers[i] = reader.ReadUInt16();
GlyphPalettes[i] = reader.ReadUInt16();
}
}
public ushort[] GlyphLayers { get; private set; }
public ushort[] GlyphPalettes { get; private set; }
public readonly Dictionary<ushort, ushort> LayerIndices = new Dictionary<ushort, ushort>();
public readonly Dictionary<ushort, ushort> LayerCounts = new Dictionary<ushort, ushort>();
}
}
| {
"pile_set_name": "Github"
} |
/*
* Copyright (C) 2018 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.google.android.exoplayer2.trackselection;
import androidx.annotation.Nullable;
import com.google.android.exoplayer2.source.TrackGroupArray;
import com.google.android.exoplayer2.trackselection.DefaultTrackSelector.SelectionOverride;
import com.google.android.exoplayer2.trackselection.TrackSelection.Definition;
import org.checkerframework.checker.nullness.compatqual.NullableType;
/** Track selection related utility methods. */
public final class TrackSelectionUtil {
private TrackSelectionUtil() {}
/** Functional interface to create a single adaptive track selection. */
public interface AdaptiveTrackSelectionFactory {
/**
* Creates an adaptive track selection for the provided track selection definition.
*
* @param trackSelectionDefinition A {@link Definition} for the track selection.
* @return The created track selection.
*/
TrackSelection createAdaptiveTrackSelection(Definition trackSelectionDefinition);
}
/**
* Creates track selections for an array of track selection definitions, with at most one
* multi-track adaptive selection.
*
* @param definitions The list of track selection {@link Definition definitions}. May include null
* values.
* @param adaptiveTrackSelectionFactory A factory for the multi-track adaptive track selection.
* @return The array of created track selection. For null entries in {@code definitions} returns
* null values.
*/
public static @NullableType TrackSelection[] createTrackSelectionsForDefinitions(
@NullableType Definition[] definitions,
AdaptiveTrackSelectionFactory adaptiveTrackSelectionFactory) {
TrackSelection[] selections = new TrackSelection[definitions.length];
boolean createdAdaptiveTrackSelection = false;
for (int i = 0; i < definitions.length; i++) {
Definition definition = definitions[i];
if (definition == null) {
continue;
}
if (definition.tracks.length > 1 && !createdAdaptiveTrackSelection) {
createdAdaptiveTrackSelection = true;
selections[i] = adaptiveTrackSelectionFactory.createAdaptiveTrackSelection(definition);
} else {
selections[i] =
new FixedTrackSelection(
definition.group, definition.tracks[0], definition.reason, definition.data);
}
}
return selections;
}
/**
* Updates {@link DefaultTrackSelector.Parameters} with an override.
*
* @param parameters The current {@link DefaultTrackSelector.Parameters} to build upon.
* @param rendererIndex The renderer index to update.
* @param trackGroupArray The {@link TrackGroupArray} of the renderer.
* @param isDisabled Whether the renderer should be set disabled.
* @param override An optional override for the renderer. If null, no override will be set and an
* existing override for this renderer will be cleared.
* @return The updated {@link DefaultTrackSelector.Parameters}.
*/
public static DefaultTrackSelector.Parameters updateParametersWithOverride(
DefaultTrackSelector.Parameters parameters,
int rendererIndex,
TrackGroupArray trackGroupArray,
boolean isDisabled,
@Nullable SelectionOverride override) {
DefaultTrackSelector.ParametersBuilder builder =
parameters
.buildUpon()
.clearSelectionOverrides(rendererIndex)
.setRendererDisabled(rendererIndex, isDisabled);
if (override != null) {
builder.setSelectionOverride(rendererIndex, trackGroupArray, override);
}
return builder.build();
}
}
| {
"pile_set_name": "Github"
} |
# Packages
&PACKAGES
useGMRedi=.TRUE.,
usePTRACERS=.TRUE.,
useGCHEM=.TRUE.,
#useMNC=.TRUE.,
useDiagnostics=.TRUE.,
&
| {
"pile_set_name": "Github"
} |
AR ?= ar
CC ?= gcc
PREFIX ?= /usr/local
CFLAGS = -O3 -std=c99 -Wall -Wextra -Ideps
SRCS = src/list.c \
src/list_node.c \
src/list_iterator.c
OBJS = $(SRCS:.c=.o)
all: build/liblist.a
install: all
cp -f build/liblist.a $(PREFIX)/lib/liblist.a
cp -f src/list.h $(PREFIX)/include/list.h
uninstall:
rm -f $(PREFIX)/lib/liblist.a
rm -f $(PREFIX)/include/list.h
build/liblist.a: $(OBJS)
@mkdir -p build
$(AR) rcs $@ $^
bin/test: test.o $(OBJS)
@mkdir -p bin
$(CC) $^ -o $@
bin/benchmark: benchmark.o $(OBJS)
@mkdir -p bin
$(CC) $^ -o $@
%.o: %.c
$(CC) $< $(CFLAGS) -c -o $@
clean:
rm -fr bin build *.o src/*.o
test: bin/test
@./$<
benchmark: bin/benchmark
@./$<
.PHONY: test benchmark clean install uninstall
| {
"pile_set_name": "Github"
} |
// Code generated by linux/mkall.go generatePtraceRegSet("arm64"). DO NOT EDIT.
package unix
import "unsafe"
// PtraceGetRegSetArm64 fetches the registers used by arm64 binaries.
func PtraceGetRegSetArm64(pid, addr int, regsout *PtraceRegsArm64) error {
iovec := Iovec{(*byte)(unsafe.Pointer(regsout)), uint64(unsafe.Sizeof(*regsout))}
return ptrace(PTRACE_GETREGSET, pid, uintptr(addr), uintptr(unsafe.Pointer(&iovec)))
}
// PtraceSetRegSetArm64 sets the registers used by arm64 binaries.
func PtraceSetRegSetArm64(pid, addr int, regs *PtraceRegsArm64) error {
iovec := Iovec{(*byte)(unsafe.Pointer(regs)), uint64(unsafe.Sizeof(*regs))}
return ptrace(PTRACE_SETREGSET, pid, uintptr(addr), uintptr(unsafe.Pointer(&iovec)))
}
| {
"pile_set_name": "Github"
} |
import vscode = require('vscode');
import cp = require('child_process');
import { LuaParse } from '../LuaParse'
import { LuaInfoManager } from '../LuaInfoManager'
import { LuaFiledCompletionInfo } from "../provider/LuaFiledCompletionInfo"
import { FileCompletionItemManager } from "../manager/FileCompletionItemManager"
import { LuaFileCompletionItems } from "../manager/LuaFileCompletionItems";
import { LuaInfo, TokenInfo, TokenTypes, LuaComment, LuaRange, LuaErrorEnum, LuaError, LuaInfoType } from '../TokenInfo';
import { LuaCompletionItemControler } from "./LuaCompletionItemControler";
import { CLog, getSelfToModuleName, getCurrentFunctionName, getTokens, isIdentifierPart } from '../Utils'
export function byteOffsetAt(document: vscode.TextDocument, position: vscode.Position): vscode.Location {
var lineText = document.lineAt(position.line).text;
if (lineText.trim().substring(0, 2) == "--") {
return checkComment(lineText, position)
}
//检查是不是路径字符串
var tempStr = lineText.substring(position.character)
var endIndex = tempStr.indexOf('"')
if (endIndex > -1) {
var startStr = lineText.substring(0, position.character)
var findex = startStr.lastIndexOf('"')
if (findex > -1) {
var moduleName = lineText.substring(findex + 1, endIndex + position.character)
if (moduleName.length > 0) {
var uri = LuaFileCompletionItems.getLuaFileCompletionItems().getUriCompletionByModuleName(moduleName)
if (uri) {
var location: vscode.Location =
new vscode.Location(uri, new vscode.Position(0, 0))
return location;
}
}
}
}
let offset = document.offsetAt(position);
let text = document.getText();
let byteOffset = 0;
var isFun: boolean = false;
var nameChats: Array<string> = new Array<string>();
var luaManager: LuaInfoManager = LuaParse.lp.luaInfoManager;
var lp: LuaParse = LuaParse.lp;
var tokens: Array<TokenInfo> = getTokens(document, position)
var isFun: boolean = false
var i: number = 0;
var lashToken: TokenInfo = null
if (tokens) {
i = tokens.length - 1;
}
while (i >= 0) {
CLog();
var token: TokenInfo = tokens[i];
i--;
if (lp.consume(':', token, TokenTypes.Punctuator) ||
lp.consume('.', token, TokenTypes.Punctuator)
) {
if (i - 1 >= 0) {
if (tokens[i].type == TokenTypes.Identifier &&
lp.consume('function', tokens[i - 1], TokenTypes.Keyword)) {
var posToken = tokens[i - 1]
var line = posToken.line;
return new vscode.Location(document.uri, new vscode.Position(line, 0))
}
}
}
if (lp.consume('function', token, TokenTypes.Keyword)) {
return null;
}
if (token.type == TokenTypes.Keyword || lp.consume('(', token, TokenTypes.Punctuator)
|| lp.consume(')', token, TokenTypes.Punctuator)
) {
isFun = true
break;
} else if (
lp.consume('+', token, TokenTypes.Punctuator)
|| lp.consume('-', token, TokenTypes.Punctuator)
|| lp.consume('*', token, TokenTypes.Punctuator)
|| lp.consume('/', token, TokenTypes.Punctuator)
|| lp.consume('>', token, TokenTypes.Punctuator)
|| lp.consume('<', token, TokenTypes.Punctuator)
|| lp.consume('>=', token, TokenTypes.Punctuator)
|| lp.consume('<=', token, TokenTypes.Punctuator)
|| lp.consume('==', token, TokenTypes.Punctuator)
|| lp.consume('~=', token, TokenTypes.Punctuator)
|| lp.consume('=', token, TokenTypes.Punctuator)
|| lp.consume('#', token, TokenTypes.Punctuator)
|| lp.consume('}', token, TokenTypes.Punctuator)
|| lp.consume('{', token, TokenTypes.Punctuator)
|| lp.consume(']', token, TokenTypes.Punctuator)
|| lp.consume('[', token, TokenTypes.Punctuator)
|| lp.consume(',', token, TokenTypes.Punctuator)
|| lp.consume(';', token, TokenTypes.Punctuator)
|| lp.consume('else', token, TokenTypes.Punctuator)
|| lp.consume('elseif', token, TokenTypes.Punctuator)
|| lp.consume('do', token, TokenTypes.Keyword)
) {
break;
}
nameChats.push(token.value);
lashToken = token;
if (i >= 0) {
var nextToken: TokenInfo = tokens[i];
if (token.type == TokenTypes.Identifier && (
nextToken.type == TokenTypes.Identifier ||
nextToken.type == TokenTypes.NumericLiteral ||
nextToken.type == TokenTypes.Keyword ||
nextToken.type == TokenTypes.StringLiteral ||
nextToken.type == TokenTypes.NilLiteral ||
nextToken.type == TokenTypes.BooleanLiteral)) {
break;
}
}
}
nameChats = nameChats.reverse()
for (let i = offset; i < text.length; i++) {
var chat = text.charCodeAt(i)
if (isIdentifierPart(chat)) {
nameChats.push(text[i])
}
else if (text[i] == '=' ||
text[i] == '==' ||
text[i] == '~=' ||
text[i] == ')' ||
text[i] == ']' ||
text[i] == '[' ||
text[i] == '}' ||
text[i] == '+' ||
text[i] == '-' ||
text[i] == '*' ||
text[i] == '/' ||
text[i] == '>' ||
text[i] == '<' ||
text[i] == '>=' ||
text[i] == '<='
) {
break;
}
else {
if (chat == 40) {
isFun = true;
}
break;
}
}
var n = ""
nameChats.forEach(c => {
n += c;
});
// console.log(n)
//分割
var keyNames: Array<string> = new Array<string>();
var tempNames: Array<string> = n.split('.')
for (var i = 0; i < tempNames.length; i++) {
if (i == tempNames.length - 1) {
var tempNames1 = tempNames[tempNames.length - 1].split(':')
for (var j = 0; j < tempNames1.length; j++) {
keyNames.push(tempNames1[j])
}
} else {
keyNames.push(tempNames[i])
}
}
var isSelf: boolean = false;
if (keyNames[0] == 'self') {
var data = getSelfToModuleName(tokens, lp)
keyNames[0] = data.moduleName
isSelf = true
}
var location: vscode.Location = null;
location = checkCurrentDocument(document, luaManager, keyNames, tokens);
if (location) {
return location;
}
// var findInfos: Array<LuaFiledCompletionInfo> = new Array<LuaFiledCompletionInfo>();
// getLocation(keyNames, luaManager, 1, findInfos)
// getLocation(keyNames, luaManager, 2, findInfos)
// var fInfo: LuaFiledCompletionInfo;
// for (var i = 0; i < keyNames.length; i++) {
// for (var j = 0; j < findInfos.length; j++) {
// var f: LuaFiledCompletionInfo = findInfos[j]
// if (f.parent && f.parent.uri.path.toLocaleLowerCase().indexOf(keyNames[i].toLocaleLowerCase()) > -1) {
// fInfo = f;
// break
// }
// else if (f.uri.path.toLocaleLowerCase().indexOf(keyNames[i].toLocaleLowerCase()) > -1) {
// fInfo = f;
// break
// }
// }
// if (fInfo != null) {
// location = new vscode.Location(fInfo.uri, fInfo.position)
// return location
// }
// }
// if (findInfos.length > 0) {
// location = new vscode.Location(findInfos[0].uri, findInfos[0].position)
// return location
// }
// if (isSelf == true && location == null) {
// var rootInfo: FileCompletionItemManager = luaManager.fileCompletionItemManagers.get(document.uri.path)
// if (rootInfo) {
// var selfCInfo: LuaFiledCompletionInfo;//= rootInfo.luaFiledCompletionInfo;
// keyNames[0] = 'self'
// for (var i = 0; i < keyNames.length; i++) {
// selfCInfo = selfCInfo.getItemByKey(keyNames[i])
// }
// if (selfCInfo) {
// var location: vscode.Location =
// new vscode.Location(selfCInfo.uri, selfCInfo.position)
// return location;
// }
// }
// }
// return location;
return location;
}
function checkCurrentDocument(document: vscode.TextDocument, luaManager: LuaInfoManager, keyNames: Array<string>, tokens: Array<TokenInfo>) {
var citems: Array<LuaFiledCompletionInfo> = new Array<LuaFiledCompletionInfo>();
var fcim = luaManager.getFcim(document.uri)
var functionNames: Array<string> = getCurrentFunctionName(tokens)
var funRootItem = null;
if (functionNames != null && functionNames.length > 0) {
var args = fcim.getSymbolArgsByNames(functionNames)
if (keyNames.length == 1) {
//参数查找
for (var index = 0; index < args.length; index++) {
var arg = args[index];
if (arg.label == keyNames[0]) {
var location: vscode.Location =
new vscode.Location(document.uri, arg.position)
return location
}
}
}
//方法内的变量
for (var index = 0; index < functionNames.length; index++) {
var fname = functionNames[index];
funRootItem = fcim.luaFunFiledCompletions.get(fname)
funRootItem = DefinitionFindItem(funRootItem, keyNames, 0)
if (funRootItem != null) {
return new vscode.Location(funRootItem.uri, funRootItem.position)
}
}
//方法查找
}
funRootItem = DefinitionFindItem(fcim.luaFunCompletionInfo, keyNames, 0);
if (funRootItem != null && funRootItem.isNewVar == true) {
return new vscode.Location(funRootItem.uri, funRootItem.position)
}
//文件全局查找
funRootItem = DefinitionFindItem(fcim.luaFileGolbalCompletionInfo, keyNames, 0);
if (funRootItem != null && funRootItem.isNewVar == true) {
return new vscode.Location(funRootItem.uri, funRootItem.position)
}
//项目全局
funRootItem = DefinitionFindItem(fcim.luaGolbalCompletionInfo, keyNames, 0);
if (funRootItem != null && funRootItem.isNewVar == true) {
return new vscode.Location(funRootItem.uri, funRootItem.position)
}
//先 根据变量名字 找找对应的文件名 如果有 那么 直接确定为该文件
var fileCompletionItemManagers: Map<string, FileCompletionItemManager> = luaManager.fileCompletionItemManagers
for (var info of fileCompletionItemManagers) {
if (info[0].indexOf("modulePath") > -1) {
var xx = 1;
}
console.log(info[0])
funRootItem = DefinitionFindItem(info[1].luaGolbalCompletionInfo, keyNames, 0);
if (funRootItem != null && funRootItem.isNewVar == true) {
return new vscode.Location(funRootItem.uri, funRootItem.position)
}
funRootItem = DefinitionFindItem(info[1].luaFunCompletionInfo, keyNames, 0);
if (funRootItem != null) {
return new vscode.Location(funRootItem.uri, funRootItem.position)
}
if (info[1].rootCompletionInfo != null && keyNames[0] == info[1].rootCompletionInfo.label) {
funRootItem = DefinitionFindItem(info[1].rootCompletionInfo, keyNames, 2);
if (funRootItem != null && funRootItem.isNewVar == true) {
return new vscode.Location(funRootItem.uri, funRootItem.position)
}
}
}
}
function FindItemByFileName(keyNames: Array<string>) {
//还没找到 那么就根据名字找依照
for (var index = 0; index < keyNames.length; index++) {
var element = keyNames[index];
}
}
function DefinitionFindItem(rootItem: LuaFiledCompletionInfo, keys: Array<string>, index: number) {
if (rootItem == null) return null
rootItem = rootItem.getItemByKey(keys[index])
if (index == keys.length - 1) {
return rootItem
} else {
if (rootItem != null) {
index++;
rootItem = DefinitionFindItem(rootItem, keys, index)
return rootItem
} else {
return null
}
}
}
function checkComment(line: string, position: vscode.Position) {
var index1 = line.indexOf('[')
var index2 = line.indexOf(']');
var moduleName = line.substring(index1 + 1, index2)
if (position.character > index1 && position.character < index2) {
var uri = LuaFileCompletionItems.getLuaFileCompletionItems().getUriCompletionByModuleName(moduleName)
var location: vscode.Location =
new vscode.Location(uri, new vscode.Position(0, 0))
return location;
}
}
function getCompletionByKeyNams(cinfo: LuaFiledCompletionInfo, keyNames: Array<string>, type: number): LuaFiledCompletionInfo {
var findInfo: LuaFiledCompletionInfo = cinfo;
var i: number = 0
for (i = 0; i < keyNames.length; i++) {
var key: string = keyNames[i];
var tempInfo: LuaFiledCompletionInfo = findInfo.getItemByKey(key, type == 1);
if (tempInfo != null) {
findInfo = tempInfo;
i++;
break;
}
}
for (i; i < keyNames.length; i++) {
var key: string = keyNames[i];
var tempInfo: LuaFiledCompletionInfo = findInfo.getItemByKey(key, type == 1);
if (tempInfo != null) {
findInfo = tempInfo;
} else {
findInfo = null;
break
}
}
if (findInfo != null && findInfo != cinfo) {
return findInfo;
} else {
return null;
}
}
function getLocation(keyNames: Array<string>, luaManager: LuaInfoManager, type: number, findInfos: Array<LuaFiledCompletionInfo>) {
var notModlueInfos: Array<LuaFiledCompletionInfo> = new Array<LuaFiledCompletionInfo>();
var notModlueInfosIndex: Array<number> = new Array<number>();
var notModlueInfosIndex: Array<number> = new Array<number>();
//先找fun
var cinfo: LuaFiledCompletionInfo = null;
var location: vscode.Location = null
luaManager.fileCompletionItemManagers.forEach((v, k) => {
if (k != LuaParse.checkTempFilePath) {
var tempInfo: LuaFiledCompletionInfo = null;
if (type == 1) {
tempInfo = v.luaFunCompletionInfo;//.getItemByKey(key,true)
}
else if (type == 2) {
tempInfo = v.luaGolbalCompletionInfo;//.getItemByKey(key)
}
var findInfo: LuaFiledCompletionInfo = getCompletionByKeyNams(tempInfo, keyNames, type)
if (findInfo) {
findInfos.push(findInfo)
}
}
})
}
/**
* 只解析 table 定义 和 方法
*/
export class LuaDefinitionProvider implements vscode.DefinitionProvider {
public provideDefinition(
document: vscode.TextDocument,
position: vscode.Position,
token: vscode.CancellationToken): Thenable<vscode.Location> {
// 找出单词
//往前找
//往后找
// document.getText()
let pos = new vscode.Position(1, 1);
let wordAtPosition = document.getWordRangeAtPosition(position);
let location = byteOffsetAt(document, position);
return new Promise<vscode.Location>((resolve, reject) => {
return resolve(location);
});
}
}
| {
"pile_set_name": "Github"
} |
<!doctype html>
<head>
<script src="http://cdnjs.cloudflare.com/ajax/libs/jquery/2.0.3/jquery.min.js"></script>
<script src="http://cdnjs.cloudflare.com/ajax/libs/raphael/2.1.2/raphael-min.js"></script>
<script src="../morris.js"></script>
<script src="http://cdnjs.cloudflare.com/ajax/libs/prettify/r224/prettify.min.js"></script>
<script src="lib/example.js"></script>
<link rel="stylesheet" href="lib/example.css">
<link rel="stylesheet" href="http://cdnjs.cloudflare.com/ajax/libs/prettify/r224/prettify.min.css">
<link rel="stylesheet" href="../morris.css">
</head>
<body>
<h1>Stacked Bars chart</h1>
<div id="graph"></div>
<pre id="code" class="prettyprint linenums">
// Use Morris.Bar
Morris.Bar({
element: 'graph',
data: [
{x: '2011 Q1', y: 3, z: 2, a: 3},
{x: '2011 Q2', y: 2, z: null, a: 1},
{x: '2011 Q3', y: 0, z: 2, a: 4},
{x: '2011 Q4', y: 2, z: 4, a: 3}
],
xkey: 'x',
ykeys: ['y', 'z', 'a'],
labels: ['Y', 'Z', 'A'],
stacked: true
});
</pre>
</body>
| {
"pile_set_name": "Github"
} |
.class public interface abstract annotation Landroid/support/annotation/CheckResult;
.super Ljava/lang/Object;
# interfaces
.implements Ljava/lang/annotation/Annotation;
# annotations
.annotation system Ldalvik/annotation/AnnotationDefault;
value = .subannotation Landroid/support/annotation/CheckResult;
suggest = ""
.end subannotation
.end annotation
.annotation runtime Ljava/lang/annotation/Documented;
.end annotation
.annotation runtime Ljava/lang/annotation/Retention;
value = .enum Ljava/lang/annotation/RetentionPolicy;->CLASS:Ljava/lang/annotation/RetentionPolicy;
.end annotation
.annotation runtime Ljava/lang/annotation/Target;
value = {
.enum Ljava/lang/annotation/ElementType;->METHOD:Ljava/lang/annotation/ElementType;
}
.end annotation
# virtual methods
.method public abstract suggest()Ljava/lang/String;
.end method
| {
"pile_set_name": "Github"
} |
*quotes.txt* For Vim version 7.4. Last change: 2010 Nov 03
VIM REFERENCE MANUAL by Bram Moolenaar
*quotes*
Here are some nice quotes about Vim that I collected from news and mail.
vim (vim) noun - Ebullient vitality and energy. [Latin, accusative of vis,
strength] (Dictionary)
Vim is so much better than vi that a great many of my old vi :map's became
immediately obsolete! (Tony Nugent, Australia)
Coming with a very GUI mindset from Windows, I always thought of people using
Vi as some kind of outer space alien in human clothes. Once I tried I really
got addicted by its power and now I found myself typing Vim keypresses in the
oddest places! That's why I would like to see Vim embedded in every
application which deals with text editing. (José Fonseca)
I was a 12-year emacs user who switched to Vim about a year ago after finally
giving up on the multiple incompatible versions, flaky contributed packages,
disorganized keystrokes, etc. And it was one of the best moves I ever made.
(Joel Burton)
Although all of the programs were used during the preparation of the new and
revised material, most of the editing was done with Vim versions 4.5 and 5.0
under GNU-Linux (Redhat 4.2). (Arnold Robbins, Israel, author of "Learning
the Vi editor")
Out of all the open software i've ever seen and used, and i've seen a lot, Vim
is the best, most useful and highest quality to work with, second only to the
linux kernel itself. (Peter Jay Salzman)
It's well worth noting that the _entirety_ of SourceForge was written using
Vim and its nifty PHP syntax highlighting. I think the entire SF.net tech
staff uses Vim and we're all excited to have you aboard! (Tim Perdue)
Vim is one of a select bunch of tools for which I have no substitute. It is
a brilliant piece of work! (Biju Chacko)
A previous girlfriend of mine switched to emacs. Needless to say, the
relationship went nowhere. (Geoffrey Mann)
I rarely think about Vim, in the same way that I guess a fish rarely thinks
about water. It's the environment in which everything else happens. I'm a
fairly busy system administrator working on a lot of different platforms. Vim
is the only thing that's consistent across all my systems, and it's just about
the only thing that doesn't break from time to time. When a new system comes
in the door without Vim, I install it right away. Great to have a tool that's
the same everywhere, that's completely reliable, so I can ignore it and think
about other things. (Pete Schaeffer)
Having recently succeeded in running Vim via telnet through a Nokia
Communicator, I can now report that it works nicely on a Palm Pilot too.
(Allan Kelly, Scotland)
You've done a tremendous job with 'VIM', Bram! The more I use it, the more
impressed I get (I am an old 'vi' die hard who once started out with early
versions of 'emacs' in the late 1970's and was relieved by finding 'vi' in the
first UNIX I came across in 1983). In my opinion, it's about time 'VIM'
replace 'emacs' as the standard for top editors. (Bo Thide', Sweden)
I love and use VIM heavily too. (Larry Wall)
Vi is like a Ferrari, if you're a beginner, it handles like a bitch, but once
you get the hang of it, it's small, powerful and FAST! (Unknown)
VIM is like a new model Ferrari, and sounds like one too - "VIIIIIIMMM!"
(Stephen Riehm, Germany)
Schon bei Nutzung eines Bruchteils der VIM-Funktionen wird der Benutzer recht
schnell die Vorzuege dieses Editors kennen- und schaetzenlernen.
Translated: Even when only using a fraction of VIM-functions, the user will
quickly get used to and appreciate the advantages of this editor. (Garry
Glendown, conclusion of an article on VIM in iX magazine 9/1998)
I've recently acquired the O'Reilly book on VI (it also discusses VIM
in-depth), and I'm amazed at just how powerful this application is. (Jeffrey
Rankin)
This guide was written using the Windows 9.x distribution of GVIM, which is
quite possibly the greatest thing to come along since God created the naked
girl. (Michael DiBernardo)
Boy, I thought I knew almost everything about VIM, but every time I browse the
online documentation, I hit upon a minor but cool aspect of a VIM feature that
I didn't know before! I must say the documentation is one the finest I've
ever seen in a product -- even better than most commercial products.
(Gautam Mudunuri)
VIM 4.5 is really a fantastic editor. It has sooooo many features and more
importantly, the defaults are so well thought out that you really don't have
to change anything!! Words cannot express my amazement and gratitude to the
creators of VIM. Keep it up. (Vikas, USA)
I wonder how long it will be before people will refer to other Vi editors as
VIM clones? (Darren Hiebert)
I read about [auto-positioning-in-file-based-on-the-errors-from-make] in one
of those "Perfect Programmer's Editor" threads and was delighted to discover
that VIM already supports it. (Brendan Macmillan, Australia)
I just discovered VIM (5.0) and I'm telling everyone I know about it!
I tell them VIM stands for VI for the new (M)illenium. Thanks so much!
(Matt F. Valentine)
I think from now on "vi" should be called "Vim Imitation", not the other way
around. (Rungun Ramanathan)
The Law of VIM:
For each member b of the possible behaviour space B of program P, there exists
a finite time t before which at least one user u in the total user space U of
program P will request b becomes a member of the allowed behaviour space B'
(B' <= B).
In other words: Sooner or later everyone wants everything as an option.
(Negri)
Whenever I move to a new computing platform, the first thing I do is to port
VIM. Lately, I am simply stunned by its ease of compilation using the
configure facility. (A.M. Sabuncu, Turkey)
The options are really excellent and very powerful. (Anish Maharaj)
The Spring user-interface designs are in, and word from the boutiques is that
80x24 text-only mode is back with a *vengeance! Vi editor clone VIM burst onto
March desk-tops with a dazzling show of pastel syntax highlights for its 5.0
look. Strident and customizable, VIM raises eyebrows with its interpretation
of the classic Vi single-key macro collection.
http://www.ntk.net/index.cgi?back=archive98/now0327.txt&line=179#l
I just wanted to take this opportunity to let you know that VIM 5 ROCKS!
Syntax highlighting: how did I survive without it?! Thank you for creating
mankind's best editor! (Mun Johl, USA)
Thanks again for VIM. I use it every day on Linux. (Eric Foster-Johnson,
author of the book "UNIX Programming Tools")
The BEST EDITOR EVER (Stuart Woolford)
I have used most of VIM's fancy features at least once, many frequently, and I
can honestly say that I couldn't live with anything less anymore. My
productivity has easily doubled compared to what it was when I used vi.
(Sitaram Chamarty)
I luv VIM. It is incredible. I'm naming my first-born Vimberly. (Jose
Unpingco, USA)
Hint: "VIM" is "vi improved" - much better! (Sven Guckes, Germany)
I use VIM every day. I spend more time in VIM than in any other program...
It's the best vi clone there is. I think it's great. (Craig Sanders,
Australia)
I strongly advise using VIM--its infinite undo/redo saved me much grief.
(Terry Brown)
Thanks very much for writing what in my opinion is the finest text editor on
the planet. If I were to get another cat, I would name it "Vim".
(Bob Sheehan, USA)
I typed :set all and the screen FILLED up with options. A whole screen of
things to be set and unset. I saw some of my old friends like wrapmargin,
modelines and showmode, but the screen was FILLED with new friends! I love
them all! I love VIM! I'm so happy that I've found this editor! I feel
like how I once felt when I started using vi after a couple of years of using
ed. I never thought I'd forsake my beloved ed, but vi ... oh god, vi was
great. And now, VIM. (Peter Jay Salzman, USA)
I am really happy with such a wonderful software package. Much better than
almost any expensive, off the shelf program. (Jeff Walker)
Whenever I reread the VIM documentation I'm overcome with excitement at the
power of the editor. (William Edward Webber, Australia)
Hurrah for VIM!! It is "at your fingertips" like vi, and has the extensions
that vi sorely needs: highlighting for executing commands on blocks, an easily
navigable and digestible help screen, and more. (Paul Pax)
The reason WHY I don't have this amazingly useful macro anymore, is that I
now use VIM - and this is built in!! (Stephen Riehm, Germany)
I am a user of VIM and I love it. I use it to do all my programming, C,
C++, HTML what ever. (Tim Allwine)
I discovered VIM after years of struggling with the original vi, and I just
can't live without it anymore. (Emmanuel Mogenet, USA)
Emacs has not a bit of chance to survive so long as VIM is around. Besides,
it also has the most detailed software documentation I have ever seen---much
better than most commercial software! (Leiming Qian)
This version of VIM will just blow people apart when they discover just how
fantastic it is! (Tony Nugent, Australia)
I took your advice & finally got VIM & I'm really impressed. Instant convert.
(Patrick Killelea, USA)
VIM is by far my favorite piece of shareware and I have been particularly
pleased with version 3.0. This is really a solid piece of work. (Robert
Colon, USA)
VIM is a joy to use, it is so well thought and practical that I wonder why
anybody would use visual development tools. VIM is powerful and elegant, it
looks deceptively simple but is almost as complex as a 747 (especially when I
look at my growing .vimrc), keep up that wonderful job, VIM is a centerpiece
of the free software world. (Louis-David Mitterand, USA)
I cannot believe how great it is to use VIM. I think the guys at work are
getting tired of hearing me bragging about it. Others eyes are lighting up.
(Rick Croote)
Emacs takes way too much time to start up and run, it is too big and bulky for
effective use and the interface is more confusing than it is of any help. VIM
however is short, it is fast, it is powerful, it has a good interface and it
is all purpose. (Paal Ditlefsen Ekran)
From the first time I got VIM3.0, I was very enthusiastic. It has almost no
problems. The swapfile handling and the backup possibilities are robust, also
the protection against editing one file twice. It is very compatible to the
real VI (and that is a MUST, because my brain is trained over years in using
it). (Gert van Antwerpen, Holland)
Visual mode in VIM is a very powerful thing! (Tony Nugent, Australia)
I have to say that VIM is =THE= single greatest piece of source code to ever
come across the net (Jim Battle, USA).
In fact, if you do want to get a new vi I'd suggest VIM-3.0. This is, by
far, the best version of vi I've ever seen (Albert W. Schueller).
I should mention that VIM is a very good editor and can compete with anything
(Ilya Beloozerov).
To tell the truth sometimes I used elvis, vile, xvi, calvin, etc. And this is
the reason that I can state that VIM is the best! (Ferenc Deak, Hungary)
VIM is by far the best editor that I have used in a long time, and I have
looked at just about every thing that is available for every platform that I
use. VIM is the best on all of them. (Guy L. Oliver)
VIM is the greatest editor since the stone chisel. (Jose Unpingco, USA)
I would like to say that with VIM I am finally making the 'emacs to vi'
transition - as an Editor it is so much better in many ways: keyboard layout,
memory usage, text alteration to name 3. (Mark Adam)
In fact, now if I want to know what a particular setting does in vi, I fire up
VIM and check out its help! (Nikhil Patel, USA)
As a vi user, VIM has made working with text a far more pleasant task than
before I encountered this program. (Steinar Knutsen, Norway)
I use VIM since version 3.0. Since that time, it is the ONLY editor I use,
with Solaris, Linux and OS/2 Warp. I suggest all my friends to use VIM, they
try, and they continue using it. VIM is really the best software I have ever
downloaded from the Internet, and the best editor I know of. (Marco
Eccettuato, Italy)
In summary:
__ ___ _ _ _ ___ _____ `
\ \ / (_)_ __ ___ (_)___ | | | |/ _ \_ _| `
\ \ / /| | '_ ` _ \ | / __| | |_| | | | || | `
\ V / | | | | | | | | \__ \ | _ | |_| || | `
\_/ |_|_| |_| |_| |_|___/ |_| |_|\___/ |_| `
____ _____ _ _ _____ _____ _ _ `
/ ___|_ _| | | | ___| ___| | | `
\___ \ | | | | | | |_ | |_ | | | `
___) || | | |_| | _| | _| |_|_| `
|____/ |_| \___/|_| |_| (_|_) (Tony Nugent, Australia) `
vim:tw=78:ts=8:ft=help:norl:
| {
"pile_set_name": "Github"
} |
-- boundary2.test
--
-- db eval {
-- SELECT a FROM t1 WHERE r >= 549755813888 ORDER BY r DESC
-- }
SELECT a FROM t1 WHERE r >= 549755813888 ORDER BY r DESC | {
"pile_set_name": "Github"
} |
Before reporting an issue, please ensure you are using the latest release of fsnotify.
### Which operating system (GOOS) and version are you using?
Linux: lsb_release -a
macOS: sw_vers
Windows: systeminfo | findstr /B /C:OS
### Please describe the issue that occurred.
### Are you able to reproduce the issue? Please provide steps to reproduce and a code sample if possible.
| {
"pile_set_name": "Github"
} |
// Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT license. See LICENSE file in the project root for full license information.
namespace Microsoft.VisualStudio.TestPlatform.CommandLine.Processors
{
using System;
using System.Globalization;
using Microsoft.VisualStudio.TestPlatform.Client;
using Microsoft.VisualStudio.TestPlatform.Common.ExtensionFramework;
using Microsoft.VisualStudio.TestPlatform.Common.SettingsProvider;
using Microsoft.VisualStudio.TestPlatform.ObjectModel.Logging;
using Microsoft.VisualStudio.TestPlatform.Utilities;
using CommandLineResources = Microsoft.VisualStudio.TestPlatform.CommandLine.Resources.Resources;
internal class ListExtensionsArgumentProcessorCapabilities : BaseArgumentProcessorCapabilities
{
private string commandName;
/// <summary>
/// Initializes a new instance of the <see cref="ListExtensionsArgumentProcessorCapabilities"/> class.
/// </summary>
/// <param name="commandName">Name of the command</param>
public ListExtensionsArgumentProcessorCapabilities(string commandName)
{
this.commandName = commandName;
}
public override string CommandName => this.commandName;
/// <inheritdoc />
public override bool AllowMultiple => false;
/// <inheritdoc />
public override bool IsAction => true;
}
internal abstract class ListExtensionsArgumentProcessor : IArgumentProcessor
{
private Lazy<IArgumentProcessorCapabilities> metadata;
private Lazy<IArgumentExecutor> executor;
private Func<IArgumentExecutor> getExecutor;
private Func<IArgumentProcessorCapabilities> getCapabilities;
public ListExtensionsArgumentProcessor(Func<IArgumentExecutor> getExecutor, Func<IArgumentProcessorCapabilities> getCapabilities)
{
this.getExecutor = getExecutor;
this.getCapabilities = getCapabilities;
}
public Lazy<IArgumentExecutor> Executor
{
get
{
if (this.executor == null)
{
this.executor = new Lazy<IArgumentExecutor>(getExecutor);
}
return this.executor;
}
set
{
this.executor = value;
}
}
public Lazy<IArgumentProcessorCapabilities> Metadata
{
get
{
if (this.metadata == null)
{
this.metadata = new Lazy<IArgumentProcessorCapabilities>(getCapabilities);
}
return this.metadata;
}
}
}
#region List discoverers
/// <summary>
/// Argument Executor for the "/ListDiscoverers" command line argument.
/// </summary>
internal class ListDiscoverersArgumentProcessor : ListExtensionsArgumentProcessor
{
private const string CommandName = "/ListDiscoverers";
public ListDiscoverersArgumentProcessor()
: base(() => new ListDiscoverersArgumentExecutor(), () => new ListExtensionsArgumentProcessorCapabilities(CommandName))
{
}
}
internal class ListDiscoverersArgumentExecutor : IArgumentExecutor
{
public void Initialize(string argument)
{
}
public ArgumentProcessorResult Execute()
{
ConsoleOutput.Instance.WriteLine(CommandLineResources.AvailableDiscoverersHeaderMessage, OutputLevel.Information);
var testPlatform = TestPlatformFactory.GetTestPlatform();
var extensionManager = TestDiscoveryExtensionManager.Create();
foreach (var extension in extensionManager.Discoverers)
{
ConsoleOutput.Instance.WriteLine(extension.Value.GetType().FullName, OutputLevel.Information);
ConsoleOutput.Instance.WriteLine(string.Format(CultureInfo.CurrentCulture, CommandLineResources.UriOfDefaultExecutor, extension.Metadata.DefaultExecutorUri), OutputLevel.Information);
ConsoleOutput.Instance.WriteLine(string.Format(CultureInfo.CurrentCulture, CommandLineResources.SupportedFileTypesIndicator + " " + string.Join(", ", extension.Metadata.FileExtension)), OutputLevel.Information);
}
return ArgumentProcessorResult.Success;
}
}
#endregion
#region List executors
/// <summary>
/// Argument Executor for the "/ListExecutors" command line argument.
/// </summary>
internal class ListExecutorsArgumentProcessor : ListExtensionsArgumentProcessor
{
private const string CommandName = "/ListExecutors";
public ListExecutorsArgumentProcessor()
: base(() => new ListExecutorsArgumentExecutor(), () => new ListExtensionsArgumentProcessorCapabilities(CommandName))
{
}
}
internal class ListExecutorsArgumentExecutor : IArgumentExecutor
{
public void Initialize(string argument)
{
}
public ArgumentProcessorResult Execute()
{
ConsoleOutput.Instance.WriteLine(CommandLineResources.AvailableExecutorsHeaderMessage, OutputLevel.Information);
var testPlatform = TestPlatformFactory.GetTestPlatform();
var extensionManager = TestExecutorExtensionManager.Create();
foreach (var extension in extensionManager.TestExtensions)
{
ConsoleOutput.Instance.WriteLine(extension.Value.GetType().FullName, OutputLevel.Information);
ConsoleOutput.Instance.WriteLine(string.Format(CultureInfo.CurrentCulture, CommandLineResources.AvailableExtensionsMetadataFormat, "Uri", extension.Metadata.ExtensionUri), OutputLevel.Information);
}
return ArgumentProcessorResult.Success;
}
}
#endregion
#region List loggers
/// <summary>
/// Argument Executor for the "/ListLoggers" command line argument.
/// </summary>
internal class ListLoggersArgumentProcessor : ListExtensionsArgumentProcessor
{
private const string CommandName = "/ListLoggers";
public ListLoggersArgumentProcessor()
: base(() => new ListLoggersArgumentExecutor(), () => new ListExtensionsArgumentProcessorCapabilities(CommandName))
{
}
}
internal class ListLoggersArgumentExecutor : IArgumentExecutor
{
public void Initialize(string argument)
{
}
public ArgumentProcessorResult Execute()
{
ConsoleOutput.Instance.WriteLine(CommandLineResources.AvailableLoggersHeaderMessage, OutputLevel.Information);
var testPlatform = TestPlatformFactory.GetTestPlatform();
var extensionManager = TestLoggerExtensionManager.Create(new NullMessageLogger());
foreach (var extension in extensionManager.TestExtensions)
{
ConsoleOutput.Instance.WriteLine(extension.Value.GetType().FullName, OutputLevel.Information);
ConsoleOutput.Instance.WriteLine(string.Format(CultureInfo.CurrentCulture, CommandLineResources.AvailableExtensionsMetadataFormat, "Uri", extension.Metadata.ExtensionUri), OutputLevel.Information);
ConsoleOutput.Instance.WriteLine(string.Format(CultureInfo.CurrentCulture, CommandLineResources.AvailableExtensionsMetadataFormat, "FriendlyName", string.Join(", ", extension.Metadata.FriendlyName)), OutputLevel.Information);
}
return ArgumentProcessorResult.Success;
}
private class NullMessageLogger : IMessageLogger
{
public void SendMessage(TestMessageLevel testMessageLevel, string message)
{
}
}
}
#endregion
#region List settings providers
/// <summary>
/// Argument Executor for the "/ListSettingsProviders" command line argument.
/// </summary>
internal class ListSettingsProvidersArgumentProcessor : ListExtensionsArgumentProcessor
{
private const string CommandName = "/ListSettingsProviders";
public ListSettingsProvidersArgumentProcessor()
: base(() => new ListSettingsProvidersArgumentExecutor(), () => new ListExtensionsArgumentProcessorCapabilities(CommandName))
{
}
}
internal class ListSettingsProvidersArgumentExecutor : IArgumentExecutor
{
public void Initialize(string argument)
{
}
public ArgumentProcessorResult Execute()
{
ConsoleOutput.Instance.WriteLine(CommandLineResources.AvailableSettingsProvidersHeaderMessage, OutputLevel.Information);
var testPlatform = TestPlatformFactory.GetTestPlatform();
var extensionManager = SettingsProviderExtensionManager.Create();
foreach (var extension in extensionManager.SettingsProvidersMap.Values)
{
ConsoleOutput.Instance.WriteLine(extension.Value.GetType().FullName, OutputLevel.Information);
ConsoleOutput.Instance.WriteLine(string.Format(CultureInfo.CurrentCulture, CommandLineResources.AvailableExtensionsMetadataFormat, "SettingName", extension.Metadata.SettingsName), OutputLevel.Information);
}
return ArgumentProcessorResult.Success;
}
}
#endregion
}
| {
"pile_set_name": "Github"
} |
extends Area2D
const DEFAULT_SPEED = 100
var direction = Vector2.LEFT
onready var _initial_pos = position
onready var _speed = DEFAULT_SPEED
func _process(delta):
_speed += delta * 2
position += _speed * delta * direction
func reset():
direction = Vector2.LEFT
position = _initial_pos
_speed = DEFAULT_SPEED
| {
"pile_set_name": "Github"
} |
<!DOCTYPE html>
<html>
<head>
<title>Internal Server Error</title>
<link href="https://fonts.googleapis.com/css?family=Lato:100" rel="stylesheet" type="text/css">
<style>
html, body {
height: 100%;
}
body {
margin: 0;
padding: 0;
width: 100%;
color: #B0BEC5;
display: table;
font-weight: 100;
font-family: 'Lato';
}
.container {
text-align: center;
display: table-cell;
vertical-align: middle;
}
.content {
text-align: center;
display: inline-block;
}
.title {
font-size: 72px;
margin-bottom: 40px;
}
</style>
</head>
<body>
<div class="container">
<div class="content">
<div class="title">Something went wrong.</div>
@if(!empty(Sentry::getLastEventID()))
<div class="subtitle">Error ID: {{ Sentry::getLastEventID() }}</div>
@endif
@unless(empty($sentryID))
<!-- Sentry JS SDK 2.1.+ required -->
<script src="https://cdn.ravenjs.com/3.3.0/raven.min.js"></script>
<script>
Raven.showReportDialog({
eventId: '{{ Sentry::getLastEventID() }}',
// use the public DSN (dont include your secret!)
dsn: 'https://[email protected]/3235',
user: {
'name': 'Jane Doe',
'email': '[email protected]',
}
});
</script>
@endunless
</div>
</div>
</body>
</html>
| {
"pile_set_name": "Github"
} |
var class_v_s_t_g_u_i_1_1_c_nine_part_tiled_bitmap =
[
[ "CNinePartTiledBitmap", "class_v_s_t_g_u_i_1_1_c_nine_part_tiled_bitmap.html#a54652c1e80176166c0e2ebdb437c7acf", null ],
[ "CNinePartTiledBitmap", "class_v_s_t_g_u_i_1_1_c_nine_part_tiled_bitmap.html#a27251ab8126c9793786a0255633b358b", null ],
[ "~CNinePartTiledBitmap", "class_v_s_t_g_u_i_1_1_c_nine_part_tiled_bitmap.html#af22f1f6d5afa1f6251926d9d1535eae1", null ],
[ "draw", "class_v_s_t_g_u_i_1_1_c_nine_part_tiled_bitmap.html#abe4a2d2349bc6a85310950ec9363beac", null ],
[ "getPartOffsets", "class_v_s_t_g_u_i_1_1_c_nine_part_tiled_bitmap.html#aec9e8905cd2509f734d332cf1893d3d7", null ],
[ "isTypeOf", "class_v_s_t_g_u_i_1_1_c_nine_part_tiled_bitmap.html#aaf248cb201bf89979b96525b82c5041f", null ],
[ "newCopy", "class_v_s_t_g_u_i_1_1_c_nine_part_tiled_bitmap.html#a624f67fa321bcb03a632d38161b1f216", null ],
[ "setPartOffsets", "class_v_s_t_g_u_i_1_1_c_nine_part_tiled_bitmap.html#addf8005186612f7333bb50b51968ab88", null ],
[ "offsets", "class_v_s_t_g_u_i_1_1_c_nine_part_tiled_bitmap.html#a942bbd2d9bc603519fedd42f2b270c39", null ]
]; | {
"pile_set_name": "Github"
} |
/* ssd_widget.h - defines a generic widget
*
* LICENSE:
*
* Copyright 2006 Ehud Shabtai
*
* This file is part of RoadMap.
*
* RoadMap is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* RoadMap 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 RoadMap; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#ifndef __SSD_WIDGET_H_
#define __SSD_WIDGET_H_
#include "../roadmap_gui.h"
#include "../roadmap_keyboard.h"
#include "../roadmap_input_type.h"
#define SSD_MIN_SIZE -1
#define SSD_MAX_SIZE -2
#define SSD_X_SCREEN_LEFT (-1)
#define SSD_X_SCREEN_RIGHT (-2)
#define SSD_Y_SCREEN_TOP (-1)
#define SSD_Y_SCREEN_BOTTOM (-2)
#define SSD_ALIGN_CENTER 0x1
#define SSD_ALIGN_RIGHT 0x2
#define SSD_START_NEW_ROW 0x4
#define SSD_END_ROW 0x8
#define SSD_ALIGN_VCENTER 0x10
#define SSD_ALIGN_GRID 0x20
#define SSD_VAR_SIZE 0x40
#define SSD_WIDGET_SPACE 0x80
#define SSD_WIDGET_HIDE 0x100
#define SSD_ALIGN_BOTTOM 0x200
#define SSD_ALIGN_LTR 0x400
#define SSD_PERSISTENT 0x800 /* This flag is generic for widgets and dialogs.
* defines if widget should be deallocated in the cleanup process
*/
#define SSD_WS_TABSTOP 0x00100000
#define SSD_WS_DEFWIDGET 0x00200000
#define SSD_TAB_CONTROL 0x00400000
#define SSD_POINTER_LOCATION 0x00800000
#define SSD_POINTER_NONE 0x01000000
#define SSD_POINTER_COMMENT 0x02000000
#define SSD_POINTER_MENU 0x04000000
#define SSD_POINTER_FIXED_LOCATION 0x08000000
#define SSD_ROUNDED_BLACK 0x10000000
#define SSD_ROUNDED_WHITE 0x40000000
/* Draw flags */
#define SSD_GET_SIZE 0x1
#define SSD_GET_CONTAINER_SIZE 0x2
/* Buttons flags */
#define SSD_BUTTON_KEY 0x1000
#define SSD_BUTTON_TEXT 0x2000
#define SSD_BUTTON_TEXT_BELOW 0x4000
/* Dialogs */
#define SSD_DIALOG_FLOAT 0x10000
#define SSD_DIALOG_TRANSPARENT 0x20000
#define SSD_DIALOG_GUI_TAB_ORDER 0x40000
#define SSD_DIALOG_VERTICAL 0x80000
#define SSD_DIALOG_NO_SCROLL 0x100000
#define SSD_DIALOG_NO_BACK 0x200000
#define SSD_DIALOG_ADDITION_BELOW 0x400000
#define SSD_DIALOG_MODAL 0x800000
/* Container flags */
#define SSD_CONTAINER_BORDER 0x1000
#define SSD_CONTAINER_TITLE 0x2000
#define SSD_ROUNDED_CORNERS 0x4000
#define SSD_SHADOW_BG 0x8000
#define SSD_CONTAINER_TXT_BOX 0x20000000
#define SSD_CONTAINER_SEARCH_BOX 0x80000000
/* Text flags */
#define SSD_TEXT_LABEL 0x1000 /* Adds a ':' sign */
#define SSD_TEXT_PASSWORD 0x2000
#define SSD_TEXT_READONLY 0x4000
#define SSD_TEXT_NORMAL_FONT 0x8000
#define SSD_TEXT_INPUT 0x10000
#define SSD_TEXT_SINGLE_LINE 0x20000
/* Bitmap flags */
#define SSD_BITMAP_MIDDLE_STRETCH 0x1000 /* Stretch image indicator */
/* Context-menu flags */
#define SSD_CONTEXTMENU_ROUNDED 0x0000
#define SSD_CONTEXTMENU_SIMPLE_LIST 0x0001
#define SSD_CONTEXTMENU_DROP_DOWN 0x0002
#define SSD_CONTEXTMENU_USE_SIZE 0x0004
#define SSD_ROUNDED_CORNER_WIDTH (7)
#define SSD_ROUNDED_CORNER_HEIGHT (7)
#define SSD_MAIN_TEXT_SIZE (15)
#define SSD_SECONDARY_TEXT_SIZE (11)
#define SSD_HEADER_TEXT_SIZE (13)
#define SSD_FOOTER_TEXT_SIZE (11)
#define SSD_ROW_HEIGHT (60)
#define SSD_CONTAINER_FLAGS (SSD_ROUNDED_CORNERS|SSD_ROUNDED_WHITE)
#define SSD_CONTAINER_TEXT_COLOR ("#000000")
#define SOFT_MENU_BAR_HEIGHT (24)
#define TITLE_BAR_HEIGHT (24)
/** TODO:: These have to be configurable because the PPI differs for various screens !!! * AGA */
#define SSD_DIALOG_OBJ_FRAME_OFFSET_X 35
#define SSD_DIALOG_OBJ_FRAME_OFFSET_Y 35
typedef enum {
FOCUS_BACK,
FOCUS_FORWARD,
FOCUS_LEFT,
FOCUS_RIGHT,
FOCUS_UP,
FOCUS_DOWN
} SSD_FOCUS_DIRECTION;
typedef struct ssd_size {
short width;
short height;
} SsdSize;
typedef struct ssd_point {
short x;
short y;
} SsdPoint;
typedef struct {
int left;
int top;
int right;
int bottom;
} SsdClickOffsets;
struct ssd_widget;
typedef struct ssd_widget *SsdWidget;
/* Widget callback. If it returns non zero, the new_value should not be
* applied.
*/
typedef int (*SsdCallback) (SsdWidget widget, const char *new_value);
typedef int (*SsdSoftKeyCallback) (SsdWidget widget, const char *new_value, void *context);
typedef BOOL(*CB_OnWidgetKeyPressed) (SsdWidget widget, const char* utf8char, uint32_t flags);
typedef void(*SsdDrawCallback)(SsdWidget widget, RoadMapGuiRect *rect, int flags);
struct ssd_widget {
char* _typeid;
SsdWidget parent;
SsdWidget next;
SsdWidget children;
const char *name;
char *value;
SsdSize size;
SsdSize cached_size;
int offset_x;
int offset_y;
int flags;
int additional_flags;
BOOL tab_stop; // Can we receive the focus?
BOOL default_widget; // First this to receive the focus in the dialog
BOOL in_focus; // Keyboard focus
BOOL focus_highlight; // Keyboard focus highlight ( TRUE by default )
BOOL background_focus; // Visability-only focus (nested context menus)
int tab_sequence;
SsdWidget prev_tabstop; // Previous this in the tab order
SsdWidget next_tabstop; // Next this in the tab order
SsdWidget tabstop_left; // GUI location tab-stop: Left
SsdWidget tabstop_right; // GUI location tab-stop: Right
SsdWidget tabstop_above; // GUI location tab-stop: Up
SsdWidget tabstop_below; // GUI location tab-stop: Down
void* parent_dialog; // Parent dialog
const char *fg_color;
const char *bg_color;
SsdCallback callback;
void *context; /* References a caller-specific context. */
RoadMapGuiPoint position;
const char *right_softkey;
const char *left_softkey;
BOOL force_click; /* Force click in case of motion in the click area */
SsdClickOffsets click_offsets; /* Offsets added to the widget borders in order
* to determine that the object was clicked
*/
SsdSoftKeyCallback right_softkey_callback;
SsdSoftKeyCallback left_softkey_callback;
void *data; /* Widget specific data */
const char * (*get_value)(SsdWidget widget);
const void * (*get_data)(SsdWidget widget);
int (*set_value) (SsdWidget widget, const char *value);
int (*set_data) (SsdWidget widget, const void *value);
void (*draw) (SsdWidget widget, RoadMapGuiRect *rect, int flags);
int (*pointer_down) (SsdWidget widget, const RoadMapGuiPoint *point);
int (*pointer_up) (SsdWidget widget, const RoadMapGuiPoint *point);
int (*short_click) (SsdWidget widget, const RoadMapGuiPoint *point);
int (*long_click) (SsdWidget widget, const RoadMapGuiPoint *point);
int (*drag_start) (SsdWidget widget, const RoadMapGuiPoint *point);
int (*drag_end) (SsdWidget widget, const RoadMapGuiPoint *point);
int (*drag_motion) (SsdWidget widget, const RoadMapGuiPoint *point);
BOOL (*key_pressed) (SsdWidget widget, const char* utf8char, uint32_t flags);
void (*release) (SsdWidget widget );
roadmap_input_type
(*get_input_type) (SsdWidget widget);
};
SsdWidget ssd_widget_new (const char *name, CB_OnWidgetKeyPressed key_pressed, int flags);
SsdWidget ssd_widget_get (SsdWidget child, const char *name);
void ssd_widget_draw (SsdWidget w, const RoadMapGuiRect *rect,
int parent_flags);
void ssd_widget_set_callback (SsdWidget widget, SsdCallback callback);
int ssd_widget_rtl (SsdWidget parent);
int ssd_widget_pointer_down (SsdWidget widget, const RoadMapGuiPoint *point);
int ssd_widget_pointer_up (SsdWidget widget, const RoadMapGuiPoint *point);
int ssd_widget_short_click (SsdWidget widget, const RoadMapGuiPoint *point);
int ssd_widget_long_click (SsdWidget widget, const RoadMapGuiPoint *point);
void ssd_widget_set_backgroundfocus( SsdWidget w, BOOL set);
BOOL ssd_widget_set_focus (SsdWidget widget);
void ssd_widget_loose_focus (SsdWidget widget);
SsdWidget ssd_widget_move_focus (SsdWidget w, SSD_FOCUS_DIRECTION direction);
SsdWidget ssd_widget_get_next_focus( SsdWidget w);
SsdWidget ssd_widget_sort_tab_order (void* parent_dialog, SsdWidget head);
SsdWidget ssd_widget_sort_gui_tab_order(SsdWidget first_tab_stop);
void ssd_widget_reset_tab_order (SsdWidget head);
void ssd_widget_reset_position (SsdWidget w);
BOOL ssd_widget_on_key_pressed (SsdWidget widget, const char* utf8char, uint32_t flags);
const char *ssd_widget_get_value (const SsdWidget widget, const char *name);
const void *ssd_widget_get_data (const SsdWidget widget, const char *name);
int ssd_widget_set_value (const SsdWidget widget, const char *name,
const char *value);
int ssd_widget_set_data (const SsdWidget widget, const char *name,
const void *value);
void ssd_widget_add (SsdWidget parent, SsdWidget child);
SsdWidget ssd_widget_remove (SsdWidget parent, SsdWidget child);
SsdWidget ssd_widget_replace(SsdWidget parent, SsdWidget old_child, SsdWidget new_child);
void ssd_widget_set_flags (SsdWidget widget, int flags);
void ssd_widget_set_size (SsdWidget widget, int width, int height);
void ssd_widget_set_offset (SsdWidget widget, int x, int y);
void ssd_widget_set_context (SsdWidget widget, void *context);
void ssd_widget_get_size (SsdWidget w, SsdSize *size, const SsdSize *max);
void ssd_widget_set_color (SsdWidget w, const char *fg_color,
const char *bg_color);
void ssd_widget_container_size (SsdWidget dialog, SsdSize *size);
void *ssd_widget_get_context (SsdWidget w);
void ssd_widget_reset_cache (SsdWidget w);
void ssd_widget_hide (SsdWidget w);
void ssd_widget_show (SsdWidget w);
SsdWidget ssd_widget_find_by_pos (SsdWidget widget,
const RoadMapGuiPoint *point, BOOL use_offsets );
BOOL ssd_widget_check_point_location(SsdWidget widget,
const RoadMapGuiPoint *point, int frame_offset_x, int frame_ofset_y );
BOOL ssd_widget_find_clickable_by_pos (SsdWidget widget, const RoadMapGuiPoint *point,
SsdWidget* widget_short_click, SsdWidget* widget_long_click );
int ssd_widget_set_left_softkey_text(SsdWidget widget, const char *value);
int ssd_widget_set_right_softkey_text(SsdWidget widget, const char *value);
void ssd_widget_set_right_softkey_callback (SsdWidget widget, SsdSoftKeyCallback callback);
void ssd_widget_set_left_softkey_callback (SsdWidget widget, SsdSoftKeyCallback callback);
int ssd_widget_pointer_down_force_click (SsdWidget widget, const RoadMapGuiPoint *point);
int ssd_widget_pointer_up_force_click (SsdWidget widget, const RoadMapGuiPoint *point);
void ssd_widget_set_pointer_force_click( SsdWidget widget );
void ssd_widget_set_click_offsets( SsdWidget widget, const SsdClickOffsets* offsets );
void ssd_widget_set_click_offsets_ext( SsdWidget widget, int left, int top, int right, int bottom );
BOOL ssd_widget_contains_point( SsdWidget widget, const RoadMapGuiPoint *point, BOOL use_offsets );
void ssd_widget_set_focus_highlight( SsdWidget widget, BOOL is_highlight );
void ssd_widget_free( SsdWidget widget, BOOL force, BOOL update_parent );
void ssd_widget_set_recalculate( BOOL value );
int ssd_widget_get_flags ( SsdWidget w );
#endif // __SSD_WIDGET_H_
| {
"pile_set_name": "Github"
} |
[
{name:"app-1.0.1", value:"app-1.0.1.tgz"},
{name:"db-1.0.1", value:"db-1.0.1.tgz"},
{name:"web-1.0.1", value:"web-1.0.1.tgz"},
] | {
"pile_set_name": "Github"
} |
/*
* Copyright (c) 1995, 2007, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package java.awt.peer;
import java.awt.*;
/**
* The peer interface for {@link Dialog}. This adds a couple of dialog specific
* features to the {@link WindowPeer} interface.
*
* The peer interfaces are intended only for use in porting
* the AWT. They are not intended for use by application
* developers, and developers should not implement peers
* nor invoke any of the peer methods directly on the peer
* instances.
*/
public interface DialogPeer extends WindowPeer {
/**
* Sets the title on the dialog window.
*
* @param title the title to set
*
* @see Dialog#setTitle(String)
*/
void setTitle(String title);
/**
* Sets if the dialog should be resizable or not.
*
* @param resizeable {@code true} when the dialog should be resizable,
* {@code false} if not
*
* @see Dialog#setResizable(boolean)
*/
void setResizable(boolean resizeable);
/**
* Block the specified windows. This is used for modal dialogs.
*
* @param windows the windows to block
*
* @see Dialog#modalShow()
*/
void blockWindows(java.util.List<Window> windows);
}
| {
"pile_set_name": "Github"
} |
# Event 5547 - task_0
###### Version: 0
## Description
None
## Data Dictionary
|Standard Name|Field Name|Type|Description|Sample Value|
|---|---|---|---|---|
|TBD|CollectionId|UnicodeString|None|`None`|
|TBD|ProviderName|UnicodeString|None|`None`|
|TBD|HRESULT|UInt32|None|`None`|
## Tags
* etw_level_Warning
* etw_task_task_0 | {
"pile_set_name": "Github"
} |
Error: File 'xxx.xml' is not accessible (No such file or directory).
Quitting (on error).
| {
"pile_set_name": "Github"
} |
'use strict';
angular.module("ngLocale", [], ["$provide", function($provide) {
var PLURAL_CATEGORY = {ZERO: "zero", ONE: "one", TWO: "two", FEW: "few", MANY: "many", OTHER: "other"};
$provide.value("$locale", {
"DATETIME_FORMATS": {
"AMPMS": [
"\u0635",
"\u0645"
],
"DAY": [
"\u0627\u0644\u0623\u062d\u062f",
"\u0627\u0644\u0627\u062b\u0646\u064a\u0646",
"\u0627\u0644\u062b\u0644\u0627\u062b\u0627\u0621",
"\u0627\u0644\u0623\u0631\u0628\u0639\u0627\u0621",
"\u0627\u0644\u062e\u0645\u064a\u0633",
"\u0627\u0644\u062c\u0645\u0639\u0629",
"\u0627\u0644\u0633\u0628\u062a"
],
"MONTH": [
"\u0643\u0627\u0646\u0648\u0646 \u0627\u0644\u062b\u0627\u0646\u064a",
"\u0634\u0628\u0627\u0637",
"\u0622\u0630\u0627\u0631",
"\u0646\u064a\u0633\u0627\u0646",
"\u0623\u064a\u0627\u0631",
"\u062d\u0632\u064a\u0631\u0627\u0646",
"\u062a\u0645\u0648\u0632",
"\u0622\u0628",
"\u0623\u064a\u0644\u0648\u0644",
"\u062a\u0634\u0631\u064a\u0646 \u0627\u0644\u0623\u0648\u0644",
"\u062a\u0634\u0631\u064a\u0646 \u0627\u0644\u062b\u0627\u0646\u064a",
"\u0643\u0627\u0646\u0648\u0646 \u0627\u0644\u0623\u0648\u0644"
],
"SHORTDAY": [
"\u0627\u0644\u0623\u062d\u062f",
"\u0627\u0644\u0627\u062b\u0646\u064a\u0646",
"\u0627\u0644\u062b\u0644\u0627\u062b\u0627\u0621",
"\u0627\u0644\u0623\u0631\u0628\u0639\u0627\u0621",
"\u0627\u0644\u062e\u0645\u064a\u0633",
"\u0627\u0644\u062c\u0645\u0639\u0629",
"\u0627\u0644\u0633\u0628\u062a"
],
"SHORTMONTH": [
"\u0643\u0627\u0646\u0648\u0646 \u0627\u0644\u062b\u0627\u0646\u064a",
"\u0634\u0628\u0627\u0637",
"\u0622\u0630\u0627\u0631",
"\u0646\u064a\u0633\u0627\u0646",
"\u0623\u064a\u0627\u0631",
"\u062d\u0632\u064a\u0631\u0627\u0646",
"\u062a\u0645\u0648\u0632",
"\u0622\u0628",
"\u0623\u064a\u0644\u0648\u0644",
"\u062a\u0634\u0631\u064a\u0646 \u0627\u0644\u0623\u0648\u0644",
"\u062a\u0634\u0631\u064a\u0646 \u0627\u0644\u062b\u0627\u0646\u064a",
"\u0643\u0627\u0646\u0648\u0646 \u0627\u0644\u0623\u0648\u0644"
],
"fullDate": "EEEE\u060c d MMMM\u060c y",
"longDate": "d MMMM\u060c y",
"medium": "MMM d, y h:mm:ss a",
"mediumDate": "MMM d, y",
"mediumTime": "h:mm:ss a",
"short": "d\u200f/M\u200f/y h:mm a",
"shortDate": "d\u200f/M\u200f/y",
"shortTime": "h:mm a"
},
"NUMBER_FORMATS": {
"CURRENCY_SYM": "\u00a3",
"DECIMAL_SEP": "\u066b",
"GROUP_SEP": "\u066c",
"PATTERNS": [
{
"gSize": 3,
"lgSize": 3,
"macFrac": 0,
"maxFrac": 3,
"minFrac": 0,
"minInt": 1,
"negPre": "-",
"negSuf": "",
"posPre": "",
"posSuf": ""
},
{
"gSize": 3,
"lgSize": 3,
"macFrac": 0,
"maxFrac": 2,
"minFrac": 2,
"minInt": 1,
"negPre": "\u00a4\u00a0-",
"negSuf": "",
"posPre": "\u00a4\u00a0",
"posSuf": ""
}
]
},
"id": "ar-lb",
"pluralCat": function (n, opt_precision) { if (n == 0) { return PLURAL_CATEGORY.ZERO; } if (n == 1) { return PLURAL_CATEGORY.ONE; } if (n == 2) { return PLURAL_CATEGORY.TWO; } if (n % 100 >= 3 && n % 100 <= 10) { return PLURAL_CATEGORY.FEW; } if (n % 100 >= 11 && n % 100 <= 99) { return PLURAL_CATEGORY.MANY; } return PLURAL_CATEGORY.OTHER;}
});
}]); | {
"pile_set_name": "Github"
} |
// 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/>.
package aligncheck
import (
"fmt"
"go/build"
"log"
"sort"
"unsafe"
"go/types"
"golang.org/x/tools/go/loader"
)
type LinterAligncheck struct {
}
func (l *LinterAligncheck) ComputeMetric(projectPath string) []string {
importPaths := []string{projectPath}
if len(importPaths) == 0 {
importPaths = []string{"."}
}
ctx := build.Default
loadcfg := loader.Config{
Build: &ctx,
}
rest, err := loadcfg.FromArgs(importPaths, false)
if err != nil {
log.Fatalf("could not parse arguments: %s", err)
}
if len(rest) > 0 {
log.Fatalf("unhandled extra arguments: %v", rest)
}
program, err := loadcfg.Load()
if err != nil {
log.Fatalf("could not type check: %s", err)
}
var lines []string
for _, pkgInfo := range program.InitialPackages() {
for _, obj := range pkgInfo.Defs {
if obj == nil {
continue
}
if _, ok := obj.(*types.TypeName); !ok {
continue
}
typ, ok := obj.Type().(*types.Named)
if !ok {
continue
}
strukt, ok := typ.Underlying().(*types.Struct)
if !ok {
continue
}
structAlign := int(stdSizes.Alignof(strukt))
structSize := int(stdSizes.Sizeof(strukt))
if structSize%structAlign != 0 {
structSize += structAlign - structSize%structAlign
}
minSize := 0
for i := 0; i < strukt.NumFields(); i++ {
field := strukt.Field(i)
fieldType := field.Type()
typeSize := int(stdSizes.Sizeof(fieldType))
minSize += typeSize
}
if minSize%structAlign != 0 {
minSize += structAlign - minSize%structAlign
}
if minSize != structSize {
pos := program.Fset.Position(obj.Pos())
lines = append(lines, fmt.Sprintf(
"%s: %s:%d:%d: struct %s could have size %d (currently %d)",
obj.Pkg().Path(),
pos.Filename,
pos.Line,
pos.Column,
obj.Name(),
minSize,
structSize,
))
}
}
}
sort.Strings(lines)
// for _, line := range lines {
// fmt.Println(line)
// }
return lines
// os.Exit(exitStatus)
}
var stdSizes = types.StdSizes{
WordSize: int64(unsafe.Sizeof(int(0))),
MaxAlign: 8,
}
| {
"pile_set_name": "Github"
} |
Pod::Spec.new do |spec|
spec.name = "WeChatSelectAll" #Pod的名字
spec.version = "1.2" #版本号
spec.summary = "非群主可以@所有人的微信插件"
spec.description = <<-DESC #Pod的描述
基于MonkeyDev开发的非群主可以@所有人的微信插件
DESC
spec.homepage = "https://github.com/ZWXAllen/WeChatSelectAll" #Pod的地址
spec.license = { :type => "BSD", :file => "LICENSE" } #License
spec.author = { "Allen" => "[email protected]" } #作者
spec.social_media_url = "https://github.com/ZWXAllen/" #weibo
spec.platform = :ios, "8.0" #平台、版本
spec.source = { :git => "https://github.com/ZWXAllen/WeChatSelectAll.git", :tag => 1.2 } #代码的git地址以及tag
spec.source_files = "**/*.{h,m}" #本地验证，表示当前目录以及子目录的所有h或m结尾的文件 如果发布到MonkeyPodSpecs需要填写git clone下来的对应的路径
#spec.public_header_files = "WeChatSelectAll.h" #需要对外导出的头文件 此处为本地验证
spec.requires_arc = true #ARC
spec.pod_target_xcconfig = { "ONLY_ACTIVE_ARCH" => "No" } #这个必须有，不要修改
end
| {
"pile_set_name": "Github"
} |
dependencies:
- name: jupyterhub
version: "0.9.0"
repository: "https://jupyterhub.github.io/helm-chart"
| {
"pile_set_name": "Github"
} |
/**
* Indefinitely repeat the values of a given iterator.
*
* @this {Iterable<T>}
* @example Basic Usage
*
* ```javascript
* [1,2,3]::repeat(); // yields [1,2,3,1,2,3...]
* ```
*/
export function * repeat <T> (
) : Iterable<T> {
const items = [...this];
while ( true ) {
yield * items;
}
};
| {
"pile_set_name": "Github"
} |
/*
* Copyright (C) 2016+ AzerothCore <www.azerothcore.org>, released under GNU GPL v2 license: https://github.com/azerothcore/azerothcore-wotlk/blob/master/LICENSE-GPL2
* Copyright (C) 2008-2016 TrinityCore <http://www.trinitycore.org/>
* Copyright (C) 2005-2009 MaNGOS <http://getmangos.com/>
*/
#ifndef _BYTEBUFFER_H
#define _BYTEBUFFER_H
#include "Common.h"
#include "Errors.h"
#include "Util.h"
#include "ByteConverter.h"
#include <exception>
#include <list>
#include <map>
#include <string>
#include <vector>
#include <cstring>
// Root of ByteBuffer exception hierarchy
class ByteBufferException : public std::exception
{
public:
~ByteBufferException() throw() { }
char const* what() const throw() { return msg_.c_str(); }
protected:
std::string& message() throw() { return msg_; }
private:
std::string msg_;
};
class ByteBufferPositionException : public ByteBufferException
{
public:
ByteBufferPositionException(bool add, size_t pos, size_t size, size_t valueSize);
~ByteBufferPositionException() throw() { }
};
class ByteBufferSourceException : public ByteBufferException
{
public:
ByteBufferSourceException(size_t pos, size_t size, size_t valueSize);
~ByteBufferSourceException() throw() { }
};
class ByteBuffer
{
public:
const static size_t DEFAULT_SIZE = 0x1000;
// constructor
ByteBuffer() : _rpos(0), _wpos(0)
{
_storage.reserve(DEFAULT_SIZE);
}
ByteBuffer(size_t reserve) : _rpos(0), _wpos(0)
{
_storage.reserve(reserve);
}
// copy constructor
ByteBuffer(const ByteBuffer& buf) : _rpos(buf._rpos), _wpos(buf._wpos),
_storage(buf._storage)
{
}
/* requried as of C++ 11 */
#if __cplusplus >= 201103L
ByteBuffer(ByteBuffer&&) = default;
ByteBuffer& operator=(const ByteBuffer&) = default;
ByteBuffer& operator=(ByteBuffer&&) = default;
#endif
void clear()
{
_storage.clear();
_rpos = _wpos = 0;
}
template <typename T> void append(T value)
{
EndianConvert(value);
append((uint8*)&value, sizeof(value));
}
template <typename T> void put(size_t pos, T value)
{
EndianConvert(value);
put(pos, (uint8*)&value, sizeof(value));
}
ByteBuffer& operator<<(uint8 value)
{
append<uint8>(value);
return *this;
}
ByteBuffer& operator<<(uint16 value)
{
append<uint16>(value);
return *this;
}
ByteBuffer& operator<<(uint32 value)
{
append<uint32>(value);
return *this;
}
ByteBuffer& operator<<(uint64 value)
{
append<uint64>(value);
return *this;
}
// signed as in 2e complement
ByteBuffer& operator<<(int8 value)
{
append<int8>(value);
return *this;
}
ByteBuffer& operator<<(int16 value)
{
append<int16>(value);
return *this;
}
ByteBuffer& operator<<(int32 value)
{
append<int32>(value);
return *this;
}
ByteBuffer& operator<<(int64 value)
{
append<int64>(value);
return *this;
}
// floating points
ByteBuffer& operator<<(float value)
{
append<float>(value);
return *this;
}
ByteBuffer& operator<<(double value)
{
append<double>(value);
return *this;
}
ByteBuffer& operator<<(const std::string& value)
{
if (size_t len = value.length())
append((uint8 const*)value.c_str(), len);
append((uint8)0);
return *this;
}
ByteBuffer& operator<<(const char* str)
{
if (size_t len = (str ? strlen(str) : 0))
append((uint8 const*)str, len);
append((uint8)0);
return *this;
}
ByteBuffer& operator>>(bool& value)
{
value = (read<char>() > 0);
return *this;
}
ByteBuffer& operator>>(uint8& value)
{
value = read<uint8>();
return *this;
}
ByteBuffer& operator>>(uint16& value)
{
value = read<uint16>();
return *this;
}
ByteBuffer& operator>>(uint32& value)
{
value = read<uint32>();
return *this;
}
ByteBuffer& operator>>(uint64& value)
{
value = read<uint64>();
return *this;
}
//signed as in 2e complement
ByteBuffer& operator>>(int8& value)
{
value = read<int8>();
return *this;
}
ByteBuffer& operator>>(int16& value)
{
value = read<int16>();
return *this;
}
ByteBuffer& operator>>(int32& value)
{
value = read<int32>();
return *this;
}
ByteBuffer& operator>>(int64& value)
{
value = read<int64>();
return *this;
}
ByteBuffer& operator>>(float& value)
{
value = read<float>();
if (!myisfinite(value))
{
value = 0.0f;
//throw ByteBufferException();
}
return *this;
}
ByteBuffer& operator>>(double& value)
{
value = read<double>();
if (!myisfinite(value))
{
value = 0.0f;
//throw ByteBufferException();
}
return *this;
}
ByteBuffer& operator>>(std::string& value)
{
value.clear();
while (rpos() < size()) // prevent crash at wrong string format in packet
{
char c = read<char>();
if (c == 0)
break;
value += c;
}
return *this;
}
uint8& operator[](size_t const pos)
{
if (pos >= size())
throw ByteBufferPositionException(false, pos, 1, size());
return _storage[pos];
}
uint8 const& operator[](size_t const pos) const
{
if (pos >= size())
throw ByteBufferPositionException(false, pos, 1, size());
return _storage[pos];
}
size_t rpos() const { return _rpos; }
size_t rpos(size_t rpos_)
{
_rpos = rpos_;
return _rpos;
}
void rfinish()
{
_rpos = wpos();
}
size_t wpos() const { return _wpos; }
size_t wpos(size_t wpos_)
{
_wpos = wpos_;
return _wpos;
}
template<typename T>
void read_skip() { read_skip(sizeof(T)); }
void read_skip(size_t skip)
{
if (_rpos + skip > size())
throw ByteBufferPositionException(false, _rpos, skip, size());
_rpos += skip;
}
template <typename T> T read()
{
T r = read<T>(_rpos);
_rpos += sizeof(T);
return r;
}
template <typename T> T read(size_t pos) const
{
if (pos + sizeof(T) > size())
throw ByteBufferPositionException(false, pos, sizeof(T), size());
T val = *((T const*)&_storage[pos]);
EndianConvert(val);
return val;
}
void read(uint8* dest, size_t len)
{
if (_rpos + len > size())
throw ByteBufferPositionException(false, _rpos, len, size());
std::memcpy(dest, &_storage[_rpos], len);
_rpos += len;
}
void readPackGUID(uint64& guid)
{
if (rpos() + 1 > size())
throw ByteBufferPositionException(false, _rpos, 1, size());
guid = 0;
uint8 guidmark = 0;
(*this) >> guidmark;
for (int i = 0; i < 8; ++i)
{
if (guidmark & (uint8(1) << i))
{
if (rpos() + 1 > size())
throw ByteBufferPositionException(false, _rpos, 1, size());
uint8 bit;
(*this) >> bit;
guid |= (uint64(bit) << (i * 8));
}
}
}
uint32 ReadPackedTime()
{
uint32 packedDate = read<uint32>();
tm lt = tm();
lt.tm_min = packedDate & 0x3F;
lt.tm_hour = (packedDate >> 6) & 0x1F;
//lt.tm_wday = (packedDate >> 11) & 7;
lt.tm_mday = ((packedDate >> 14) & 0x3F) + 1;
lt.tm_mon = (packedDate >> 20) & 0xF;
lt.tm_year = ((packedDate >> 24) & 0x1F) + 100;
return uint32(mktime(<));
}
ByteBuffer& ReadPackedTime(uint32& time)
{
time = ReadPackedTime();
return *this;
}
uint8* contents()
{
if (_storage.empty())
throw ByteBufferException();
return &_storage[0];
}
const uint8* contents() const
{
if (_storage.empty())
throw ByteBufferException();
return &_storage[0];
}
size_t size() const { return _storage.size(); }
bool empty() const { return _storage.empty(); }
void resize(size_t newsize)
{
_storage.resize(newsize, 0);
_rpos = 0;
_wpos = size();
}
void reserve(size_t ressize)
{
if (ressize > size())
_storage.reserve(ressize);
}
void append(const char* src, size_t cnt)
{
return append((const uint8*)src, cnt);
}
template<class T> void append(const T* src, size_t cnt)
{
return append((const uint8*)src, cnt * sizeof(T));
}
void append(const uint8* src, size_t cnt)
{
if (!cnt)
throw ByteBufferSourceException(_wpos, size(), cnt);
if (!src)
throw ByteBufferSourceException(_wpos, size(), cnt);
ASSERT(size() < 10000000);
size_t newsize = _wpos + cnt;
if (_storage.capacity() < newsize) // pussywizard
{
if (newsize < 100)
_storage.reserve(300);
else if (newsize < 750)
_storage.reserve(2500);
else if (newsize < 6000)
_storage.reserve(10000);
else
_storage.reserve(400000);
}
if (_storage.size() < newsize)
_storage.resize(newsize);
memcpy(&_storage[_wpos], src, cnt);
_wpos = newsize;
}
void append(const ByteBuffer& buffer)
{
if (buffer.wpos())
append(buffer.contents(), buffer.wpos());
}
// can be used in SMSG_MONSTER_MOVE opcode
void appendPackXYZ(float x, float y, float z)
{
uint32 packed = 0;
packed |= ((int)(x / 0.25f) & 0x7FF);
packed |= ((int)(y / 0.25f) & 0x7FF) << 11;
packed |= ((int)(z / 0.25f) & 0x3FF) << 22;
*this << packed;
}
void appendPackGUID(uint64 guid)
{
uint8 packGUID[8 + 1];
packGUID[0] = 0;
size_t size = 1;
for (uint8 i = 0; guid != 0; ++i)
{
if (guid & 0xFF)
{
packGUID[0] |= uint8(1 << i);
packGUID[size] = uint8(guid & 0xFF);
++size;
}
guid >>= 8;
}
append(packGUID, size);
}
void AppendPackedTime(time_t time)
{
tm lt;
localtime_r(&time, <);
append<uint32>((lt.tm_year - 100) << 24 | lt.tm_mon << 20 | (lt.tm_mday - 1) << 14 | lt.tm_wday << 11 | lt.tm_hour << 6 | lt.tm_min);
}
void put(size_t pos, const uint8* src, size_t cnt)
{
if (pos + cnt > size())
throw ByteBufferPositionException(true, pos, cnt, size());
if (!src)
throw ByteBufferSourceException(_wpos, size(), cnt);
std::memcpy(&_storage[pos], src, cnt);
}
void hexlike(bool outString = false) const;
protected:
size_t _rpos, _wpos;
std::vector<uint8> _storage;
};
template <typename T>
inline ByteBuffer& operator<<(ByteBuffer& b, std::vector<T> v)
{
b << (uint32)v.size();
for (typename std::vector<T>::iterator i = v.begin(); i != v.end(); ++i)
{
b << *i;
}
return b;
}
template <typename T>
inline ByteBuffer& operator>>(ByteBuffer& b, std::vector<T>& v)
{
uint32 vsize;
b >> vsize;
v.clear();
while (vsize--)
{
T t;
b >> t;
v.push_back(t);
}
return b;
}
template <typename T>
inline ByteBuffer& operator<<(ByteBuffer& b, std::list<T> v)
{
b << (uint32)v.size();
for (typename std::list<T>::iterator i = v.begin(); i != v.end(); ++i)
{
b << *i;
}
return b;
}
template <typename T>
inline ByteBuffer& operator>>(ByteBuffer& b, std::list<T>& v)
{
uint32 vsize;
b >> vsize;
v.clear();
while (vsize--)
{
T t;
b >> t;
v.push_back(t);
}
return b;
}
template <typename K, typename V>
inline ByteBuffer& operator<<(ByteBuffer& b, std::map<K, V>& m)
{
b << (uint32)m.size();
for (typename std::map<K, V>::iterator i = m.begin(); i != m.end(); ++i)
{
b << i->first << i->second;
}
return b;
}
template <typename K, typename V>
inline ByteBuffer& operator>>(ByteBuffer& b, std::map<K, V>& m)
{
uint32 msize;
b >> msize;
m.clear();
while (msize--)
{
K k;
V v;
b >> k >> v;
m.insert(make_pair(k, v));
}
return b;
}
/// @todo Make a ByteBuffer.cpp and move all this inlining to it.
template<> inline std::string ByteBuffer::read<std::string>()
{
std::string tmp;
*this >> tmp;
return tmp;
}
template<>
inline void ByteBuffer::read_skip<char*>()
{
std::string temp;
*this >> temp;
}
template<>
inline void ByteBuffer::read_skip<char const*>()
{
read_skip<char*>();
}
template<>
inline void ByteBuffer::read_skip<std::string>()
{
read_skip<char*>();
}
#endif
| {
"pile_set_name": "Github"
} |
/**
* Copyright (c) 1999~2017, Altibase Corp. and/or its affiliates. All rights reserved.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License, version 3,
* as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package com.altibase.altilinker.worker;
import java.util.LinkedList;
/**
* Thread pool interface
*/
public interface ThreadPool
{
/**
* Set daemon thread
*
* @param aDaemon Whether daemon thread set or not
*/
public void setDaemon(boolean aDaemon);
/**
* Set thread count
*
* @param aThreadCount Thread count
*/
public void setThreadCount(int aThreadCount);
/**
* Set thread sleep time as millisecond unit
*
* @param aThreadSleepTime Thread sleep time as millisecond unit
*/
public void setThreadSleepTime(int aThreadSleepTime);
/**
* Start thread pool
*
* @return true, if success. false, if fail.
*/
public boolean start();
/**
* Stop thread pool
*/
public void stop();
/**
* Request to process a task
*
* @param aTask Task to process
* @return true, if task queue enqueue successfully. false, if fail.
*/
public boolean requestTask(Task aTask);
/**
* Clear enqueued tasks
*/
public void clearEnqueuedTasks();
/**
* Get current processing task
*
* @return Current processing task
*/
public LinkedList getCurrentTasks();
/**
* Un-assign to a thread for linker session
*
* @param aLinkerSessionId Linker session ID
*/
public void unassign(int aLinkerSessionId);
/**
* Get RemoteWorker ThreadPool Stack Trace
*
* @return true, if success. false, if fail.
*/
public boolean printAllStackTraces();
/**
* BUG-39001
* Drop Task from TaskThread
*
* @param aLinkserSessionID Linker Session ID
*/
public void dropTask( int aLinkerSessionID );
}
| {
"pile_set_name": "Github"
} |
/****************************************************************************
**
** Copyright (C) 2016 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the QtGui module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 3 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL3 included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 3 requirements
** will be met: https://www.gnu.org/licenses/lgpl-3.0.html.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 2.0 or (at your option) the GNU General
** Public license version 3 or any later version approved by the KDE Free
** Qt Foundation. The licenses are as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3
** included in the packaging of this file. Please review the following
** information to ensure the GNU General Public License requirements will
** be met: https://www.gnu.org/licenses/gpl-2.0.html and
** https://www.gnu.org/licenses/gpl-3.0.html.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef QTEXTIMAGEHANDLER_P_H
#define QTEXTIMAGEHANDLER_P_H
//
// W A R N I N G
// -------------
//
// This file is not part of the Qt API. It exists purely as an
// implementation detail. This header file may change from version to
// version without notice, or even be removed.
//
// We mean it.
//
#include <QtGui/private/qtguiglobal_p.h>
#include "QtCore/qobject.h"
#include "QtGui/qabstracttextdocumentlayout.h"
QT_BEGIN_NAMESPACE
class QTextImageFormat;
class Q_GUI_EXPORT QTextImageHandler : public QObject,
public QTextObjectInterface
{
Q_OBJECT
Q_INTERFACES(QTextObjectInterface)
public:
explicit QTextImageHandler(QObject *parent = 0);
virtual QSizeF intrinsicSize(QTextDocument *doc, int posInDocument, const QTextFormat &format) override;
virtual void drawObject(QPainter *p, const QRectF &rect, QTextDocument *doc, int posInDocument, const QTextFormat &format) override;
QImage image(QTextDocument *doc, const QTextImageFormat &imageFormat);
};
QT_END_NAMESPACE
#endif // QTEXTIMAGEHANDLER_P_H
| {
"pile_set_name": "Github"
} |
/****************************************************************************
**
** Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the examples of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:BSD$
** You may use this file under the terms of the BSD license as follows:
**
** "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 Digia Plc and its Subsidiary(-ies) nor the names
** of its contributors may be used to endorse or promote products derived
** from this software without specific prior written permission.
**
**
** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE."
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef CODEEDITOR_H
#define CODEEDITOR_H
#include <QPlainTextEdit>
#include <QObject>
#include <QCompleter>
#include "PythonAccess/jedi.h"
QT_BEGIN_NAMESPACE
class QPaintEvent;
class QResizeEvent;
class QSize;
class QWidget;
QT_END_NAMESPACE
class LineNumberArea;
class CodeEditor : public QPlainTextEdit {
Q_OBJECT
public:
CodeEditor(QWidget *parent = nullptr);
void lineNumberAreaPaintEvent(QPaintEvent *event);
int lineNumberAreaWidth();
void setCompleter(QCompleter *completer);
void setJediCompleter(QCompleter *completer, const QString &getJediCode);
QCompleter* completer() const;
QCompleter* jediCompleter() const;
protected:
void resizeEvent(QResizeEvent *event);
void keyPressEvent(QKeyEvent *e);
void focusInEvent(QFocusEvent *e);
private slots:
void updateLineNumberAreaWidth(int newBlockCount);
void updateLineNumberArea(const QRect &, int);
void insertCompletion(const QString &completion);
private:
QWidget *lineNumberArea;
QCompleter *m_completer;
QCompleter *m_jediCompleter;
Jedi *m_jedi;
QString GetLine();
QString textUnderCursor() const;
bool KeepIndent();
void SelectLineMarginBlock();
};
class LineNumberArea : public QWidget {
public:
LineNumberArea(CodeEditor *editor) : QWidget(editor) {
codeEditor = editor;
}
QSize sizeHint() const {
return QSize(codeEditor->lineNumberAreaWidth(), 0);
}
protected:
void paintEvent(QPaintEvent *event) {
codeEditor->lineNumberAreaPaintEvent(event);
}
private:
CodeEditor *codeEditor;
};
#endif
| {
"pile_set_name": "Github"
} |
# ordered maps are represented as
# a sequence of mappings, with
# each mapping having one key
--- !!omap
- Mark McGwire: 65
- Sammy Sosa: 63
- Ken Griffy: 58
| {
"pile_set_name": "Github"
} |
// cgo -godefs types_openbsd.go | go run mkpost.go
// Code generated by the command above; see README.md. DO NOT EDIT.
// +build amd64,openbsd
package unix
const (
sizeofPtr = 0x8
sizeofShort = 0x2
sizeofInt = 0x4
sizeofLong = 0x8
sizeofLongLong = 0x8
)
type (
_C_short int16
_C_int int32
_C_long int64
_C_long_long int64
)
type Timespec struct {
Sec int64
Nsec int64
}
type Timeval struct {
Sec int64
Usec int64
}
type Rusage struct {
Utime Timeval
Stime Timeval
Maxrss int64
Ixrss int64
Idrss int64
Isrss int64
Minflt int64
Majflt int64
Nswap int64
Inblock int64
Oublock int64
Msgsnd int64
Msgrcv int64
Nsignals int64
Nvcsw int64
Nivcsw int64
}
type Rlimit struct {
Cur uint64
Max uint64
}
type _Gid_t uint32
const (
S_IFMT = 0xf000
S_IFIFO = 0x1000
S_IFCHR = 0x2000
S_IFDIR = 0x4000
S_IFBLK = 0x6000
S_IFREG = 0x8000
S_IFLNK = 0xa000
S_IFSOCK = 0xc000
S_ISUID = 0x800
S_ISGID = 0x400
S_ISVTX = 0x200
S_IRUSR = 0x100
S_IWUSR = 0x80
S_IXUSR = 0x40
)
type Stat_t struct {
Mode uint32
Dev int32
Ino uint64
Nlink uint32
Uid uint32
Gid uint32
Rdev int32
Atim Timespec
Mtim Timespec
Ctim Timespec
Size int64
Blocks int64
Blksize uint32
Flags uint32
Gen uint32
Pad_cgo_0 [4]byte
X__st_birthtim Timespec
}
type Statfs_t struct {
F_flags uint32
F_bsize uint32
F_iosize uint32
Pad_cgo_0 [4]byte
F_blocks uint64
F_bfree uint64
F_bavail int64
F_files uint64
F_ffree uint64
F_favail int64
F_syncwrites uint64
F_syncreads uint64
F_asyncwrites uint64
F_asyncreads uint64
F_fsid Fsid
F_namemax uint32
F_owner uint32
F_ctime uint64
F_fstypename [16]int8
F_mntonname [90]int8
F_mntfromname [90]int8
F_mntfromspec [90]int8
Pad_cgo_1 [2]byte
Mount_info [160]byte
}
type Flock_t struct {
Start int64
Len int64
Pid int32
Type int16
Whence int16
}
type Dirent struct {
Fileno uint64
Off int64
Reclen uint16
Type uint8
Namlen uint8
X__d_padding [4]uint8
Name [256]int8
}
type Fsid struct {
Val [2]int32
}
const (
PathMax = 0x400
)
type RawSockaddrInet4 struct {
Len uint8
Family uint8
Port uint16
Addr [4]byte /* in_addr */
Zero [8]int8
}
type RawSockaddrInet6 struct {
Len uint8
Family uint8
Port uint16
Flowinfo uint32
Addr [16]byte /* in6_addr */
Scope_id uint32
}
type RawSockaddrUnix struct {
Len uint8
Family uint8
Path [104]int8
}
type RawSockaddrDatalink struct {
Len uint8
Family uint8
Index uint16
Type uint8
Nlen uint8
Alen uint8
Slen uint8
Data [24]int8
}
type RawSockaddr struct {
Len uint8
Family uint8
Data [14]int8
}
type RawSockaddrAny struct {
Addr RawSockaddr
Pad [92]int8
}
type _Socklen uint32
type Linger struct {
Onoff int32
Linger int32
}
type Iovec struct {
Base *byte
Len uint64
}
type IPMreq struct {
Multiaddr [4]byte /* in_addr */
Interface [4]byte /* in_addr */
}
type IPv6Mreq struct {
Multiaddr [16]byte /* in6_addr */
Interface uint32
}
type Msghdr struct {
Name *byte
Namelen uint32
Pad_cgo_0 [4]byte
Iov *Iovec
Iovlen uint32
Pad_cgo_1 [4]byte
Control *byte
Controllen uint32
Flags int32
}
type Cmsghdr struct {
Len uint32
Level int32
Type int32
}
type Inet6Pktinfo struct {
Addr [16]byte /* in6_addr */
Ifindex uint32
}
type IPv6MTUInfo struct {
Addr RawSockaddrInet6
Mtu uint32
}
type ICMPv6Filter struct {
Filt [8]uint32
}
const (
SizeofSockaddrInet4 = 0x10
SizeofSockaddrInet6 = 0x1c
SizeofSockaddrAny = 0x6c
SizeofSockaddrUnix = 0x6a
SizeofSockaddrDatalink = 0x20
SizeofLinger = 0x8
SizeofIPMreq = 0x8
SizeofIPv6Mreq = 0x14
SizeofMsghdr = 0x30
SizeofCmsghdr = 0xc
SizeofInet6Pktinfo = 0x14
SizeofIPv6MTUInfo = 0x20
SizeofICMPv6Filter = 0x20
)
const (
PTRACE_TRACEME = 0x0
PTRACE_CONT = 0x7
PTRACE_KILL = 0x8
)
type Kevent_t struct {
Ident uint64
Filter int16
Flags uint16
Fflags uint32
Data int64
Udata *byte
}
type FdSet struct {
Bits [32]uint32
}
const (
SizeofIfMsghdr = 0xf8
SizeofIfData = 0xe0
SizeofIfaMsghdr = 0x18
SizeofIfAnnounceMsghdr = 0x1a
SizeofRtMsghdr = 0x60
SizeofRtMetrics = 0x38
)
type IfMsghdr struct {
Msglen uint16
Version uint8
Type uint8
Hdrlen uint16
Index uint16
Tableid uint16
Pad1 uint8
Pad2 uint8
Addrs int32
Flags int32
Xflags int32
Data IfData
}
type IfData struct {
Type uint8
Addrlen uint8
Hdrlen uint8
Link_state uint8
Mtu uint32
Metric uint32
Pad uint32
Baudrate uint64
Ipackets uint64
Ierrors uint64
Opackets uint64
Oerrors uint64
Collisions uint64
Ibytes uint64
Obytes uint64
Imcasts uint64
Omcasts uint64
Iqdrops uint64
Noproto uint64
Capabilities uint32
Pad_cgo_0 [4]byte
Lastchange Timeval
Mclpool [7]Mclpool
Pad_cgo_1 [4]byte
}
type IfaMsghdr struct {
Msglen uint16
Version uint8
Type uint8
Hdrlen uint16
Index uint16
Tableid uint16
Pad1 uint8
Pad2 uint8
Addrs int32
Flags int32
Metric int32
}
type IfAnnounceMsghdr struct {
Msglen uint16
Version uint8
Type uint8
Hdrlen uint16
Index uint16
What uint16
Name [16]int8
}
type RtMsghdr struct {
Msglen uint16
Version uint8
Type uint8
Hdrlen uint16
Index uint16
Tableid uint16
Priority uint8
Mpls uint8
Addrs int32
Flags int32
Fmask int32
Pid int32
Seq int32
Errno int32
Inits uint32
Rmx RtMetrics
}
type RtMetrics struct {
Pksent uint64
Expire int64
Locks uint32
Mtu uint32
Refcnt uint32
Hopcount uint32
Recvpipe uint32
Sendpipe uint32
Ssthresh uint32
Rtt uint32
Rttvar uint32
Pad uint32
}
type Mclpool struct {
Grown int32
Alive uint16
Hwm uint16
Cwm uint16
Lwm uint16
}
const (
SizeofBpfVersion = 0x4
SizeofBpfStat = 0x8
SizeofBpfProgram = 0x10
SizeofBpfInsn = 0x8
SizeofBpfHdr = 0x14
)
type BpfVersion struct {
Major uint16
Minor uint16
}
type BpfStat struct {
Recv uint32
Drop uint32
}
type BpfProgram struct {
Len uint32
Pad_cgo_0 [4]byte
Insns *BpfInsn
}
type BpfInsn struct {
Code uint16
Jt uint8
Jf uint8
K uint32
}
type BpfHdr struct {
Tstamp BpfTimeval
Caplen uint32
Datalen uint32
Hdrlen uint16
Pad_cgo_0 [2]byte
}
type BpfTimeval struct {
Sec uint32
Usec uint32
}
type Termios struct {
Iflag uint32
Oflag uint32
Cflag uint32
Lflag uint32
Cc [20]uint8
Ispeed int32
Ospeed int32
}
type Winsize struct {
Row uint16
Col uint16
Xpixel uint16
Ypixel uint16
}
const (
AT_FDCWD = -0x64
AT_SYMLINK_NOFOLLOW = 0x2
)
type PollFd struct {
Fd int32
Events int16
Revents int16
}
const (
POLLERR = 0x8
POLLHUP = 0x10
POLLIN = 0x1
POLLNVAL = 0x20
POLLOUT = 0x4
POLLPRI = 0x2
POLLRDBAND = 0x80
POLLRDNORM = 0x40
POLLWRBAND = 0x100
POLLWRNORM = 0x4
)
type Utsname struct {
Sysname [256]byte
Nodename [256]byte
Release [256]byte
Version [256]byte
Machine [256]byte
}
| {
"pile_set_name": "Github"
} |
//
// LabelUtilityProtocol.swift
// TraceCovid19
//
// Created by yosawa on 2020/04/20.
//
import UIKit
protocol LabelUtilityProtocol: class, HasAssociatedObjects {
var attributes: [NSAttributedString.Key: Any] { get set }
var paragraphStyle: NSMutableParagraphStyle? { get }
func setParagraph<T>(_ value: T, for keyPath: ReferenceWritableKeyPath<NSMutableParagraphStyle, T>)
}
private let attributeKey = "_attributeKey"
extension LabelUtilityProtocol where Self: UILabel {
var attributes: [NSAttributedString.Key: Any] {
get {
return associatedObjects[attributeKey] as? [NSAttributedString.Key: Any] ?? [:]
}
set {
associatedObjects[attributeKey] = newValue
adaptAttributes(attributes: attributes)
}
}
private func adaptAttributes(attributes: [NSAttributedString.Key: Any]?) {
let string = attributedText?.string ?? text ?? ""
attributedText = NSAttributedString(string: string, attributes: attributes)
}
}
extension LabelUtilityProtocol where Self: UILabel {
var paragraphStyle: NSMutableParagraphStyle? {
return attributes[.paragraphStyle] as? NSMutableParagraphStyle
}
func setParagraph<T>(_ value: T, for keyPath: ReferenceWritableKeyPath<NSMutableParagraphStyle, T>) {
let style = paragraphStyle ?? makeDefaultParagraphStyle()
style[keyPath: keyPath] = value
attributes[.paragraphStyle] = style
}
private func makeDefaultParagraphStyle() -> NSMutableParagraphStyle {
let paragraphStyle = NSMutableParagraphStyle()
paragraphStyle.alignment = textAlignment
paragraphStyle.lineBreakMode = lineBreakMode
return paragraphStyle
}
}
| {
"pile_set_name": "Github"
} |
<?php
/*
* Copyright 2014 Google Inc.
*
* 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.
*/
class Google_Service_RecommendationsAI_GoogleCloudRecommendationengineV1beta1ImportErrorsConfig extends Google_Model
{
public $gcsPrefix;
public function setGcsPrefix($gcsPrefix)
{
$this->gcsPrefix = $gcsPrefix;
}
public function getGcsPrefix()
{
return $this->gcsPrefix;
}
}
| {
"pile_set_name": "Github"
} |
package com.mxy.rsaservice;
import java.io.IOException;
import java.io.PrintWriter;
import javax.servlet.ServletException;
import javax.servlet.annotation.WebServlet;
import javax.servlet.http.HttpServlet;
import javax.servlet.http.HttpServletRequest;
import javax.servlet.http.HttpServletResponse;
/**
* Servlet implementation class EncryptedByRSAPublicKey
*/
@WebServlet("/EncryptedByRSAPublicKey")
public class EncryptedByRSAPublicKey extends HttpServlet {
private static final long serialVersionUID = 1L;
protected void doGet(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {
request.setCharacterEncoding("UTF-8");
response.setCharacterEncoding("UTF-8");
String path = this.getClass().getResource("").getPath();
String webInfPath = path.substring(0, path.indexOf("WEB-INF/") + "WEB-INF/".length());
String privateKeyPath = webInfPath + "rsakey/rsa_public_key.pem"; // replace your public key path here
String publicKeyPath = webInfPath + "rsakey/pkcs8_private_key.pem"; // replace your private path here
String data = request.getParameter("data").replaceAll(" ", "");
String encryptedData = "";
PrintWriter out = response.getWriter();
try {
RSAEncryptor rsaEncryptor = new RSAEncryptor(privateKeyPath, publicKeyPath);
encryptedData = rsaEncryptor.encryptedByPublicKey(data);
} catch (Exception e) {
e.printStackTrace();
out.write(encryptedData);
}
out.write(encryptedData);
}
protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {
doGet(request, response);
}
}
| {
"pile_set_name": "Github"
} |
h1 {
color: red;
}
| {
"pile_set_name": "Github"
} |
body {
padding-top: 0;
}
.starter-template {
padding: 40px 15px;
text-align: center;
}
.navigationLinkButton:hover {
cursor: pointer;
}
a {
color: #03A9F4;
}
| {
"pile_set_name": "Github"
} |
``locale_name``
===============
.. versionadded:: 2.12
The ``locale_name`` filter was added in Twig 2.12.
The ``locale_name`` filter returns the locale name given its two-letter
code:
.. code-block:: twig
{# German #}
{{ 'de'|locale_name }}
By default, the filter uses the current locale. You can pass it explicitly:
.. code-block:: twig
{# allemand #}
{{ 'de'|locale_name('fr') }}
{# français (Canada) #}
{{ 'fr_CA'|locale_name('fr_FR') }}
.. note::
The ``locale_name`` filter is part of the ``IntlExtension`` which is not
installed by default. Install it first:
.. code-block:: bash
$ composer req twig/intl-extra
Then, use the ``twig/extra-bundle`` on Symfony projects or add the extension
explictly on the Twig environment::
use Twig\Extra\Intl\IntlExtension;
$twig = new \Twig\Environment(...);
$twig->addExtension(new IntlExtension());
Arguments
---------
* ``locale``: The locale
| {
"pile_set_name": "Github"
} |
/*
* Copyright (C) 2020 Otto-von-Guericke-Universität Magdeburg
*
* This file is subject to the terms and conditions of the GNU Lesser General
* Public License v2.1. See the file LICENSE in the top level directory for more
* details.
*/
/**
* @ingroup drivers_at86rf2xx
*
* The extended feature set of at86rf2xx transceivers comprises a
* hardware implementation of AES. There are two supported block
* cipher modes, ECB and CBC.
*
* @{
*
* @file
* @brief Interface of the at86rf2xx security module (AES)
*
* @author Fabian Hüßler <[email protected]>
*/
#ifndef AT86RF2XX_AES_H
#define AT86RF2XX_AES_H
#include "at86rf2xx.h"
#ifdef __cplusplus
extern "C" {
#endif
/**
* @brief AES key length in bits
*/
#define AT86RF2XX_AES_KEY_BITS (128U)
/**
* @brief AES key length in bytes
*/
#define AT86RF2XX_AES_KEY_LENGTH ((AT86RF2XX_AES_KEY_BITS) / 8)
/**
* @brief AES block size in bytes
*/
#define AT86RF2XX_AES_BLOCK_SIZE ((AT86RF2XX_AES_KEY_BITS) / 8)
/**
* @brief Time to complete the AES algorithm in us
*/
#define AT86RF2XX_AES_DELAY_US (24)
/**
* @name AES rigister addresses
* @{
*/
#define AT86RF2XX_REG__AES_STATUS (0x82)
#define AT86RF2XX_REG__AES_CTRL (0x83)
#define AT86RF2XX_REG__AES_KEY_START (0x84)
#define AT86RF2XX_REG__AES_KEY_END (0x93)
#define AT86RF2XX_REG__AES_DATA_START (0x84)
#define AT86RF2XX_REG__AES_DATA_END (0x93)
#define AT86RF2XX_REG__AES_CTRL_MIRROR (0x94)
/** @} */
/**
* @name Layout of register AES_STATUS
* @{
*/
#define AT86RF2XX_AES_STATUS_MASK__AES_ER (0x80)
#define AT86RF2XX_AES_STATUS_MASK__AES_DONE (0x01)
#define AT86RF2XX_AES_STATUS_AES_ER__NO_ERROR (0x00)
#define AT86RF2XX_AES_STATUS_AES_ER__ERROR (0x80)
#define AT86RF2XX_AES_STATUS_AES_DONE__NOT_DONE (0x00)
#define AT86RF2XX_AES_STATUS_AES_DONE__DONE (0x01)
/** @} */
/**
* @name Layout of register AES_CTRL
* @{
*/
#define AT86RF2XX_AES_CTRL_MASK__AES_REQUEST (0x80)
#define AT86RF2XX_AES_CTRL_MASK__AES_MODE (0x70)
#define AT86RF2XX_AES_CTRL_MASK__AES_DIR (0x08)
#define AT86RF2XX_AES_CTRL_AES_REQUEST__IDLE (0x00)
#define AT86RF2XX_AES_CTRL_AES_REQUEST__START (0x80)
#define AT86RF2XX_AES_CTRL_AES_MODE__ECB (0x00)
#define AT86RF2XX_AES_CTRL_AES_MODE__KEY (0x10)
#define AT86RF2XX_AES_CTRL_AES_MODE__CBC (0x20)
#define AT86RF2XX_AES_CTRL_AES_DIR__ENC (0x00)
#define AT86RF2XX_AES_CTRL_AES_DIR__DEC (0x08)
/** @} */
/**
* @name Layout of register AES_CTRL_MIRROR
* @{
*/
#define AT86RF2XX_AES_CTRL_MIRROR_MASK__AES_REQUEST (0x80)
#define AT86RF2XX_AES_CTRL_MIRROR_MASK__AES_MODE (0x70)
#define AT86RF2XX_AES_CTRL_MIRROR_MASK__AES_DIR (0x08)
#define AT86RF2XX_AES_CTRL_MIRROR_AES_REQUEST__IDLE (0x00)
#define AT86RF2XX_AES_CTRL_MIRROR_AES_REQUEST__START (0x80)
#define AT86RF2XX_AES_CTRL_MIRROR_AES_MODE__ECB (0x00)
#define AT86RF2XX_AES_CTRL_MIRROR_AES_MODE__KEY (0x10)
#define AT86RF2XX_AES_CTRL_MIRROR_AES_MODE__CBC (0x20)
#define AT86RF2XX_AES_CTRL_MIRROR_AES_DIR__ENC (0x00)
#define AT86RF2XX_AES_CTRL_MIRROR_AES_DIR__DEC (0x08)
/** @} */
/**
* @brief An AES block
*
* AES works on blocks of 16 bytes
*/
typedef uint8_t aes_block_t[AT86RF2XX_AES_BLOCK_SIZE];
/**
* @brief Read the AES key used for encryption
*
* @param[in] dev Device
* @param[out] key Buffer to store the key
*/
void at86rf2xx_aes_key_read_encrypt(at86rf2xx_t *dev,
uint8_t key[AT86RF2XX_AES_KEY_LENGTH]);
/**
* @brief Write the AES key used for encryption
*
* It is important to write the encryption key, before encryption is done
*
* @param[in] dev Device
* @param[in] key Buffer which stores the key
*/
void at86rf2xx_aes_key_write_encrypt(at86rf2xx_t *dev,
const uint8_t key[AT86RF2XX_AES_KEY_LENGTH]);
/**
* @brief Read the AES key used for decryption
*
* @param[in] dev Device
* @param[out] key Buffer to store the key
*/
void at86rf2xx_aes_key_read_decrypt(at86rf2xx_t *dev,
uint8_t key[AT86RF2XX_AES_KEY_LENGTH]);
/**
* @brief Write the AES key used for decryption
*
* It is important to write the decryption key, before decryption is done
*
* @param[in] dev Device
* @param[in] key Buffer which stores the key
*/
void at86rf2xx_aes_key_write_decrypt(at86rf2xx_t *dev,
const uint8_t key[AT86RF2XX_AES_KEY_LENGTH]);
/**
* @brief Perform AES algorithm and encrypt data blocks
* in @p plain to cipher data blocks, using ECB mode
*
* @note The encryption key must have been written before.
*
* @param[in] dev Device
* @param[out] cipher If not NULL, cipher data blocks
* @param[out] key If not NULL, last round encryption key is stored
* @param[in] plain Plain data blocks
* @param[in] nblocks Number of blocks
*/
void at86rf2xx_aes_ecb_encrypt(at86rf2xx_t *dev,
aes_block_t *cipher,
uint8_t key[AT86RF2XX_AES_BLOCK_SIZE],
const aes_block_t *plain,
uint8_t nblocks);
/**
* @brief Perform AES algorithm and decrypt data blocks
* in @p cipher to plain data blocks, using ECB mode
*
* @note The decryption key must have been written before.
*
* @param[in] dev Device
* @param[out] plain If not NULL, plain data blocks
* @param[out] key If not NULL, last round decryption key is stored
* @param[in] cipher Cipher data blocks
* @param[in] nblocks Number of blocks
*/
void at86rf2xx_aes_ecb_decrypt(at86rf2xx_t *dev,
aes_block_t *plain,
uint8_t key[AT86RF2XX_AES_BLOCK_SIZE],
const aes_block_t *cipher,
uint8_t nblocks);
/**
* @brief Perform AES algorithm and encrypt data blocks
* in @p plain to cipher data blocks, using CBC mode
*
* @note The encryption key must have been written before.
*
* @param[in] dev Device
* @param[out] cipher If not NULL, cipher blocks
* @param[out] key If not NULL, last round encryption key is stored
* @param[in,out] iv in: initial vector, out: last cipher block if cipher is NULL
* @param[in] plain Plain data blocks
* @param[in] nblocks Number of blocks
*/
void at86rf2xx_aes_cbc_encrypt(at86rf2xx_t *dev,
aes_block_t *cipher,
uint8_t key[AT86RF2XX_AES_BLOCK_SIZE],
uint8_t iv[AT86RF2XX_AES_BLOCK_SIZE],
const aes_block_t *plain,
uint8_t nblocks);
/**
* @brief Perform AES algorithm and decrypt data blocks
* in @p cipher to plain data blocks, using CBC mode
*
* @note The decryption key must have been written before.
*
* @param[in] dev Device
* @param[out] plain If not NUll, plain data blocks
* @param[out] key If not NULL, last round decryption key is stored
* @param[in,out] iv in: initial vector, out: last plain block if plain is NULL
* @param[in] cipher Cipher data blocks
* @param[in] nblocks Number of blocks
*/
void at86rf2xx_aes_cbc_decrypt(at86rf2xx_t *dev,
aes_block_t *plain,
uint8_t key[AT86RF2XX_AES_BLOCK_SIZE],
uint8_t iv[AT86RF2XX_AES_BLOCK_SIZE],
const aes_block_t *cipher,
uint8_t nblocks);
#ifdef __cplusplus
}
#endif
#endif /* AT86RF2XX_AES_H */
/** @} */
| {
"pile_set_name": "Github"
} |
module Travis::API::V3
class Models::Trial
include Models::Owner
attr_reader :id, :permissions, :owner, :created_at, :status, :builds_remaining
def initialize(attributes = {})
@id = attributes.fetch('id')
@permissions = Models::BillingPermissions.new(attributes.fetch('permissions'))
@owner = fetch_owner(attributes.fetch('owner'))
@created_at = attributes.fetch('created_at') && DateTime.parse(attributes.fetch('created_at'))
@status = attributes.fetch('status')
@builds_remaining = attributes.fetch('builds_remaining')
end
end
end
| {
"pile_set_name": "Github"
} |
<?xml version="1.0" encoding="UTF-8"?>
<!--
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.
-->
<!DOCTYPE api-answers PUBLIC "-//NetBeans//DTD Arch Answers//EN" "../../nbbuild/antsrc/org/netbeans/nbbuild/Arch.dtd" [
<!ENTITY api-questions SYSTEM "../../nbbuild/antsrc/org/netbeans/nbbuild/Arch-api-questions.xml">
]>
<api-answers
question-version="1.29"
author="[email protected]"
>
&api-questions;
<!--
<question id="arch-overall" when="init">
Describe the overall architecture.
<hint>
What will be API for
<a href="http://openide.netbeans.org/tutorial/api-design.html#design.apiandspi">
clients and what support API</a>?
What parts will be pluggable?
How will plug-ins be registered? Please use <code><api type="export"/></code>
to describe your general APIs and specify their
<a href="http://openide.netbeans.org/tutorial/api-design.html#category-private">
stability categories</a>.
If possible please provide simple diagrams.
</hint>
</question>
-->
<answer id="arch-overall">
<p>
This is a general SPI for writing context sensitive actions.
</p>
</answer>
<!--
<question id="arch-quality" when="init">
How will the <a href="http://www.netbeans.org/community/guidelines/q-evangelism.html">quality</a>
of your code be tested and
how are future regressions going to be prevented?
<hint>
What kind of testing do
you want to use? How much functionality, in which areas,
should be covered by the tests? How you find out that your
project was successful?
</hint>
</question>
-->
<answer id="arch-quality">
<p>
It is very heavily covered by unit tests.
</p>
</answer>
<!--
<question id="arch-time" when="init">
What are the time estimates of the work?
<hint>
Please express your estimates of how long the design, implementation,
stabilization are likely to last. How many people will be needed to
implement this and what is the expected milestone by which the work should be
ready?
</hint>
</question>
-->
<answer id="arch-time">
<p>
Stabilization hopefully in time for 7.0, one person.
</p>
</answer>
<!--
<question id="arch-usecases" when="init">
<hint>
Content of this answer will be displayed as part of page at
http://www.netbeans.org/download/dev/javadoc/usecases.html
You can use tags <usecase name="name> regular html description </usecase>
and if you want to use an URL you can prefix if with @TOP@ to begin
at the root of your javadoc
</hint>
Describe the main <a href="http://openide.netbeans.org/tutorial/api-design.html#usecase">
use cases</a> of the new API. Who will use it under
what circumstances? What kind of code would typically need to be written
to use the module?
</question>
-->
<answer id="arch-usecases">
<ul>
<li>
Writing actions which are sensitive to some object in the global
selection lookup returned by Utilities.actionsGlobalContext().
</li>
<li>
Writing actions which are sensitive to some object in the lookup
belonging to a Lookup.Provider subclass (e.g. Node, DataObject, Project)
in the global selection lookup. The nesting of Lookup.Providers
can be arbitrarily deep (e.g. global -> Node -> DataObject -> whatever)
</li>
<li>
Writing actions which are sensitive to multiple types of object
in the global selection or as described above, as a merged
action generated by a factory from multiple actions each of
which handles a single case.
</li>
</ul>
</answer>
<!--
<question id="arch-what" when="init">
What is this project good for?
<hint>
Please provide here a few lines describing the project,
what problem it should solve, provide links to documentation,
specifications, etc.
</hint>
</question>
-->
<answer id="arch-what">
<p>
Writing context sensitive actions
</p>
</answer>
<!--
<question id="arch-where" when="impl">
Where one can find sources for your module?
<hint>
Please provide link to the Hg web client at
http://hg.netbeans.org/
or just use tag defaultanswer generate='here'
</hint>
</question>
-->
<answer id="arch-where">
<defaultanswer generate='here' />
</answer>
<!--
<question id="compat-deprecation" when="init">
How the introduction of your project influences functionality
provided by previous version of the product?
<hint>
If you are planning to deprecate/remove/change any existing APIs,
list them here accompanied with the reason explaining why you
are doing so.
</hint>
</question>
-->
<answer id="compat-deprecation">
<p>
XXX no answer for compat-deprecation
</p>
</answer>
<!--
<question id="compat-i18n" when="impl">
Is your module correctly internationalized?
<hint>
Correct internationalization means that it obeys instructions
at <a href="http://www.netbeans.org/download/dev/javadoc/org-openide-modules/org/openide/modules/doc-files/i18n-branding.html">
NetBeans I18N pages</a>.
</hint>
</question>
-->
<answer id="compat-i18n">
<p>
N/A. It contains no localized strings.
</p>
</answer>
<!--
<question id="compat-standards" when="init">
Does the module implement or define any standards? Is the
implementation exact or does it deviate somehow?
</question>
-->
<answer id="compat-standards">
<p>
N/A
</p>
</answer>
<!--
<question id="compat-version" when="impl">
Can your module coexist with earlier and future
versions of itself? Can you correctly read all old settings? Will future
versions be able to read your current settings? Can you read
or politely ignore settings stored by a future version?
<hint>
Very helpful for reading settings is to store version number
there, so future versions can decide whether how to read/convert
the settings and older versions can ignore the new ones.
</hint>
</question>
-->
<answer id="compat-version">
<p>
N/A
</p>
</answer>
<!--
<question id="dep-jre" when="final">
Which version of JRE do you need (1.2, 1.3, 1.4, etc.)?
<hint>
It is expected that if your module runs on 1.x that it will run
on 1.x+1 if no, state that please. Also describe here cases where
you run different code on different versions of JRE and why.
</hint>
</question>
-->
<answer id="dep-jre">
<p>
1.5 or greater
</p>
</answer>
<!--
<question id="dep-jrejdk" when="final">
Do you require the JDK or is the JRE enough?
</question>
-->
<answer id="dep-jrejdk">
<p>
JRE
</p>
</answer>
<!--
<question id="dep-nb" when="init">
What other NetBeans projects and modules does this one depend on?
<hint>
Depending on other NetBeans projects influnces the ability of
users of your work to customize their own branded version of
NetBeans by enabling and disabling some modules. Too
much dependencies restrict this kind of customization. If that
is your case, then you may want to split your functionality into
pieces of autoload, eager and regular modules which can be
enabled independently. Usually the answer to this question
is generated from your <code>project.xml</code> file, but
if it is not guessed correctly, you can suppress it by
specifying <defaultanswer generate="none"/> and
write here your own. Please describe such projects as imported APIs using
the <code><api name="identification" type="import or export" category="stable" url="where is the description" /></code>.
By doing this information gets listed in the summary page of your
javadoc.
</hint>
</question>
-->
<answer id="dep-nb">
<defaultanswer generate='here' />
</answer>
<!--
<question id="dep-non-nb" when="init">
What other projects outside NetBeans does this one depend on?
<hint>
Depending on 3rd party libraries is always problematic,
especially if they are not open source, as that complicates
the licensing scheme of NetBeans. Please enumerate your
external dependencies here, so it is correctly understood since
the begining what are the legal implications of your project.
Also please note that
some non-NetBeans projects are packaged as NetBeans modules
(see <a href="http://libs.netbeans.org/">libraries</a>) and
it is preferred to use this approach when more modules may
depend and share such third-party libraries.
</hint>
</question>
-->
<answer id="dep-non-nb">
<p>
No
</p>
</answer>
<!--
<question id="dep-platform" when="init">
On which platforms does your module run? Does it run in the same
way on each?
<hint>
If you plan any dependency on OS or any usage of native code,
please describe why you are doing so and describe how you envision
to enforce the portability of your code.
Please note that there is a support for <a href="http://www.netbeans.org/download/dev/javadoc/org-openide-modules/org/openide/modules/doc-files/api.html#how-os-specific">OS conditionally
enabled modules</a> which together with autoload/eager modules
can allow you to enable to provide the best OS aware support
on certain OSes while providing compatibility bridge on the not
supported ones.
Also please list the supported
OSes/HW platforms and mentioned the lovest version of JDK required
for your project to run on. Also state whether JRE is enough or
you really need JDK.
</hint>
</question>
-->
<answer id="dep-platform">
<p>
Any
</p>
</answer>
<!--
<question id="deploy-dependencies" when="final">
What do other modules need to do to declare a dependency on this one,
in addition to or instead of the normal module dependency declaration
(e.g. tokens to require)?
<hint>
Provide a sample of the actual lines you would add to a module manifest
to declare a dependency, for example OpenIDE-Module-Requires: some.token.
If other modules should not depend on this module, or should just use a
simple regular module dependency, you can just answer "nothing". If you
intentionally expose a semistable API to clients using implementation
dependencies, you should mention that here (but there is no need to give
an example of usage).
</hint>
</question>
-->
<answer id="deploy-dependencies">
<p>
Currently exports a friend API, so modules that want to use it need to
be added to the list.
</p>
</answer>
<!--
<question id="deploy-jar" when="impl">
Do you deploy just module JAR file(s) or other files as well?
<hint>
Usually a module consist of one JAR file (perhaps with Class-Path
extensions) and also a configuration file that enables it. If you
have any other files, use
<api group="java.io.File" name="yourname" type="export" category="friend">...</api>
to define the location, name and stability of your files (of course
changing "yourname" and "friend" to suit your needs).
If it uses more than one JAR, describe where they are located, how
they refer to each other.
If it consist of module JAR(s) and other files, please describe
what is their purpose, why other files are necessary. Please
make sure that installation/uninstallation leaves the system
in state as it was before installation.
</hint>
</question>
-->
<answer id="deploy-jar">
<p>
JAR only
</p>
</answer>
<!--
<question id="deploy-nbm" when="impl">
Can you deploy an NBM via the Update Center?
<hint>
If not why?
</hint>
</question>
-->
<answer id="deploy-nbm">
<p>
Yes
</p>
</answer>
<!--
<question id="deploy-packages" when="init">
Are packages of your module made inaccessible by not declaring them
public?
<hint>
By default NetBeans build harness treats all packages are private.
If you export some of them - either as public or friend packages,
you should have a reason. If the reason is described elsewhere
in this document, you can ignore this question.
</hint>
</question>
-->
<answer id="deploy-packages">
<p>
There is only one package and it is public to friends
</p>
</answer>
<!--
<question id="deploy-shared" when="final">
Do you need to be installed in the shared location only, or in the user directory only,
or can your module be installed anywhere?
<hint>
Installation location shall not matter, if it does explain why.
Consider also whether <code>InstalledFileLocator</code> can help.
</hint>
</question>
-->
<answer id="deploy-shared">
<p>
Anywhere
</p>
</answer>
<!--
<question id="exec-ant-tasks" when="impl">
Do you define or register any ant tasks that other can use?
<hint>
If you provide an ant task that users can use, you need to be very
careful about its syntax and behaviour, as it most likely forms an
API for end users and as there is a lot of end users, their reaction
when such API gets broken can be pretty strong.
</hint>
</question>
-->
<answer id="exec-ant-tasks">
<p>
No
</p>
</answer>
<!--
<question id="exec-classloader" when="impl">
Does your code create its own class loader(s)?
<hint>
A bit unusual. Please explain why and what for.
</hint>
</question>
-->
<answer id="exec-classloader">
<p>
No
</p>
</answer>
<!--
<question id="exec-component" when="impl">
Is execution of your code influenced by any (string) property
of any of your components?
<hint>
Often <code>JComponent.getClientProperty</code>, <code>Action.getValue</code>
or <code>PropertyDescriptor.getValue</code>, etc. are used to influence
a behavior of some code. This of course forms an interface that should
be documented. Also if one depends on some interface that an object
implements (<code>component instanceof Runnable</code>) that forms an
API as well.
</hint>
</question>
-->
<answer id="exec-component">
<p>
No specific strings, no. Action.getValue()/putValue() are supported, but
this module does not use the values, it just implements the methods
and fires changes as appropriate.
</p>
</answer>
<!--
<question id="exec-introspection" when="impl">
Does your module use any kind of runtime type information (<code>instanceof</code>,
work with <code>java.lang.Class</code>, etc.)?
<hint>
Check for cases when you have an object of type A and you also
expect it to (possibly) be of type B and do some special action. That
should be documented. The same applies on operations in meta-level
(Class.isInstance(...), Class.isAssignableFrom(...), etc.).
</hint>
</question>
-->
<answer id="exec-introspection">
<p>
No
</p>
</answer>
<!--
<question id="exec-privateaccess" when="final">
Are you aware of any other parts of the system calling some of
your methods by reflection?
<hint>
If so, describe the "contract" as an API. Likely private or friend one, but
still API and consider rewrite of it.
</hint>
</question>
-->
<answer id="exec-privateaccess">
<p>
No
</p>
</answer>
<!--
<question id="exec-process" when="impl">
Do you execute an external process from your module? How do you ensure
that the result is the same on different platforms? Do you parse output?
Do you depend on result code?
<hint>
If you feed an input, parse the output please declare that as an API.
</hint>
</question>
-->
<answer id="exec-process">
<p>
No
</p>
</answer>
<!--
<question id="exec-property" when="impl">
Is execution of your code influenced by any environment or
Java system (<code>System.getProperty</code>) property?
On a similar note, is there something interesting that you
pass to <code>java.util.logging.Logger</code>? Or do you observe
what others log?
<hint>
If there is a property that can change the behavior of your
code, somebody will likely use it. You should describe what it does
and the <a href="http://openide.netbeans.org/tutorial/api-design.html#life">stability category</a>
of this API. You may use
<pre>
<api type="export" group="property" name="id" category="private" url="http://...">
description of the property, where it is used, what it influence, etc.
</api>
</pre>
</hint>
</question>
-->
<answer id="exec-property">
<p>
No
</p>
</answer>
<!--
<question id="exec-reflection" when="impl">
Does your code use Java Reflection to execute other code?
<hint>
This usually indicates a missing or insufficient API in the other
part of the system. If the other side is not aware of your dependency
this contract can be easily broken.
</hint>
</question>
-->
<answer id="exec-reflection">
<p>
No
</p>
</answer>
<!--
<question id="exec-threading" when="init">
What threading models, if any, does your module adhere to? How the
project behaves with respect to threading?
<hint>
Is your API threadsafe? Can it be accessed from any threads or
just from some dedicated ones? Any special relation to AWT and
its Event Dispatch thread? Also
if your module calls foreign APIs which have a specific threading model,
indicate how you comply with the requirements for multithreaded access
(synchronization, mutexes, etc.) applicable to those APIs.
If your module defines any APIs, or has complex internal structures
that might be used from multiple threads, declare how you protect
data against concurrent access, race conditions, deadlocks, etc.,
and whether such rules are enforced by runtime warnings, errors, assertions, etc.
Examples: a class might be non-thread-safe (like Java Collections); might
be fully thread-safe (internal locking); might require access through a mutex
(and may or may not automatically acquire that mutex on behalf of a client method);
might be able to run only in the event queue; etc.
Also describe when any events are fired: synchronously, asynchronously, etc.
Ideas: <a href="http://core.netbeans.org/proposals/threading/index.html#recommendations">Threading Recommendations</a> (in progress)
</hint>
</question>
-->
<answer id="exec-threading">
<p>
action code is threadsafe; invocation depends on the UI displaying
the action
</p>
</answer>
<!--
<question id="format-clipboard" when="impl">
Which data flavors (if any) does your code read from or insert to
the clipboard (by access to clipboard on means calling methods on <code>java.awt.datatransfer.Transferable</code>?
<hint>
Often Node's deal with clipboard by usage of <code>Node.clipboardCopy, Node.clipboardCut and Node.pasteTypes</code>.
Check your code for overriding these methods.
</hint>
</question>
-->
<answer id="format-clipboard">
<p>
N/A
</p>
</answer>
<!--
<question id="format-dnd" when="impl">
Which protocols (if any) does your code understand during Drag & Drop?
<hint>
Often Node's deal with clipboard by usage of <code>Node.drag, Node.getDropType</code>.
Check your code for overriding these methods. Btw. if they are not overridden, they
by default delegate to <code>Node.clipboardCopy, Node.clipboardCut and Node.pasteTypes</code>.
</hint>
</question>
-->
<answer id="format-dnd">
<p>
N/A
</p>
</answer>
<!--
<question id="format-types" when="impl">
Which protocols and file formats (if any) does your module read or write on disk,
or transmit or receive over the network? Do you generate an ant build script?
Can it be edited and modified?
<hint>
<p>
Files can be read and written by other programs, modules and users. If they influence
your behaviour, make sure you either document the format or claim that it is a private
api (using the <api> tag).
</p>
<p>
If you generate an ant build file, this is very likely going to be seen by end users and
they will be attempted to edit it. You should be ready for that and provide here a link
to documentation that you have for such purposes and also describe how you are going to
understand such files during next release, when you (very likely) slightly change the
format.
</p>
</hint>
</question>
-->
<answer id="format-types">
<p>
N/A
</p>
</answer>
<!--
<question id="lookup-lookup" when="init">
Does your module use <code>org.openide.util.Lookup</code>
or any similar technology to find any components to communicate with? Which ones?
<hint>
NetBeans is build around a generic registry of services called
lookup. It is preferable to use it for registration and discovery
if possible. See
<a href="http://www.netbeans.org/download/dev/javadoc/org-openide-util/org/openide/util/lookup/doc-files/index.html">
The Solution to Comunication Between Components
</a>. If you do not plan to use lookup and insist usage
of other solution, then please describe why it is not working for
you.
<br/>
When filling the final version of your arch document, please
describe the interfaces you are searching for, where
are defined, whether you are searching for just one or more of them,
if the order is important, etc. Also classify the stability of such
API contract. Use <api group=&lookup& /> tag, so
your information gets listed in the summary page of your javadoc.
</hint>
</question>
-->
<answer id="lookup-lookup">
<p>
Utilities.actionsGlobalContext()
</p>
</answer>
<!--
<question id="lookup-register" when="final">
Do you register anything into lookup for other code to find?
<hint>
Do you register using layer file or using <code>META-INF/services</code>?
Who is supposed to find your component?
</hint>
</question>
-->
<answer id="lookup-register">
<p>
No
</p>
</answer>
<!--
<question id="lookup-remove" when="final">
Do you remove entries of other modules from lookup?
<hint>
Why? Of course, that is possible, but it can be dangerous. Is the module
your are masking resource from aware of what you are doing?
</hint>
</question>
-->
<answer id="lookup-remove">
<p>
No
</p>
</answer>
<!--
<question id="perf-exit" when="final">
Does your module run any code on exit?
</question>
-->
<answer id="perf-exit">
<p>
No
</p>
</answer>
<!--
<question id="perf-huge_dialogs" when="final">
Does your module contain any dialogs or wizards with a large number of
GUI controls such as combo boxes, lists, trees, or text areas?
</question>
-->
<answer id="perf-huge_dialogs">
<p>
No
</p>
</answer>
<!--
<question id="perf-limit" when="init">
Are there any hard-coded or practical limits in the number or size of
elements your code can handle?
<hint>
Most of algorithms have increasing memory and speed complexity
with respect to size of data they operate on. What is the critical
part of your project that can be seen as a bottleneck with
respect to speed or required memory? What are the practical
sizes of data you tested your project with? What is your estimate
of potential size of data that would cause visible performance
problems? Is there some kind of check to detect such situation
and prevent "hard" crashes - for example the CloneableEditorSupport
checks for size of a file to be opened in editor
and if it is larger than 1Mb it shows a dialog giving the
user the right to decide - e.g. to cancel or commit suicide.
</hint>
</question>
-->
<answer id="perf-limit">
<p>
No
</p>
</answer>
<!--
<question id="perf-mem" when="final">
How much memory does your component consume? Estimate
with a relation to the number of windows, etc.
</question>
-->
<answer id="perf-mem">
<p>
Depends on how many action instances the application creates
</p>
</answer>
<!--
<question id="perf-menus" when="final">
Does your module use dynamically updated context menus, or
context-sensitive actions with complicated and slow enablement logic?
<hint>
If you do a lot of tricks when adding actions to regular or context menus, you can significantly
slow down display of the menu, even when the user is not using your action. Pay attention to
actions you add to the main menu bar, and to context menus of foreign nodes or components. If
the action is conditionally enabled, or changes its display dynamically, you need to check the
impact on performance. In some cases it may be more appropriate to make a simple action that is
always enabled but does more detailed checks in a dialog if it is actually run.
</hint>
</question>
-->
<answer id="perf-menus">
<p>
No
</p>
</answer>
<!--
<question id="perf-progress" when="final">
Does your module execute any long-running tasks?
<hint>Long running tasks should never block
AWT thread as it badly hurts the UI
<a href="http://performance.netbeans.org/responsiveness/issues.html">
responsiveness</a>.
Tasks like connecting over
network, computing huge amount of data, compilation
be done asynchronously (for example
using <code>RequestProcessor</code>), definitively it should
not block AWT thread.
</hint>
</question>
-->
<answer id="perf-progress">
<p>
No
</p>
</answer>
<!--
<question id="perf-scale" when="init">
Which external criteria influence the performance of your
program (size of file in editor, number of files in menu,
in source directory, etc.) and how well your code scales?
<hint>
Please include some estimates, there are other more detailed
questions to answer in later phases of implementation.
</hint>
</question>
-->
<answer id="perf-scale">
<p>
Merged actions performance will likely degrade logarithmically with
the number of actions merged, but more than two or three merged
actions unlikely to have a use-case.
</p>
</answer>
<!--
<question id="perf-spi" when="init">
How the performance of the plugged in code will be enforced?
<hint>
If you allow foreign code to be plugged into your own module, how
do you enforce that it will behave correctly and quickly and will not
negatively influence the performance of your own module?
</hint>
</question>
-->
<answer id="perf-spi">
<p>
It will not be
</p>
</answer>
<!--
<question id="perf-startup" when="final">
Does your module run any code on startup?
</question>
-->
<answer id="perf-startup">
<p>
No
</p>
</answer>
<!--
<question id="perf-wakeup" when="final">
Does any piece of your code wake up periodically and do something
even when the system is otherwise idle (no user interaction)?
</question>
-->
<answer id="perf-wakeup">
<p>
No
</p>
</answer>
<!--
<question id="resources-file" when="final">
Does your module use <code>java.io.File</code> directly?
<hint>
NetBeans provide a logical wrapper over plain files called
<code>org.openide.filesystems.FileObject</code> that
provides uniform access to such resources and is the preferred
way that should be used. But of course there can be situations when
this is not suitable.
</hint>
</question>
-->
<answer id="resources-file">
<p>
No
</p>
</answer>
<!--
<question id="resources-layer" when="final">
Does your module provide own layer? Does it create any files or
folders in it? What it is trying to communicate by that and with which
components?
<hint>
NetBeans allows automatic and declarative installation of resources
by module layers. Module register files into appropriate places
and other components use that information to perform their task
(build menu, toolbar, window layout, list of templates, set of
options, etc.).
</hint>
</question>
-->
<answer id="resources-layer">
<p>
No
</p>
</answer>
<!--
<question id="resources-mask" when="final">
Does your module mask/hide/override any resources provided by other modules in
their layers?
<hint>
If you mask a file provided by another module, you probably depend
on that and do not want the other module to (for example) change
the file's name. That module shall thus make that file available as an API
of some stability category.
</hint>
</question>
-->
<answer id="resources-mask">
<p>
No
</p>
</answer>
<!--
<question id="resources-preferences" when="final">
Does your module uses preferences via Preferences API? Does your module use NbPreferences or
or regular JDK Preferences ? Does it read, write or both ?
Does it share preferences with other modules ? If so, then why ?
<hint>
You may use
<api type="export" group="preferences"
name="preference node name" category="private">
description of individual keys, where it is used, what it
influences, whether the module reads/write it, etc.
</api>
Due to XML ID restrictions, rather than /org/netbeans/modules/foo give the "name" as org.netbeans.modules.foo.
Note that if you use NbPreferences this name will then be the same as the code name base of the module.
</hint>
</question>
-->
<answer id="resources-preferences">
<p>
No
</p>
</answer>
<!--
<question id="resources-read" when="final">
Does your module read any resources from layers? For what purpose?
<hint>
As this is some kind of intermodule dependency, it is a kind of API.
Please describe it and classify according to
<a href="http://openide.netbeans.org/tutorial/api-design.html#categories">
common stability categories</a>.
</hint>
</question>
-->
<answer id="resources-read">
<p>
No
</p>
</answer>
<!--
<question id="security-grant" when="final">
Does your code grant additional rights to some other code?
<hint>Avoid using a class loader that adds extra
permissions to loaded code unless really necessary.
Also note that your API implementation
can also expose unneeded permissions to enemy code by
calling AccessController.doPrivileged().</hint>
</question>
-->
<answer id="security-grant">
<p>
No
</p>
</answer>
<!--
<question id="security-policy" when="final">
Does your functionality require modifications to the standard policy file?
<hint>Your code might pass control to third-party code not
coming from trusted domains. This could be code downloaded over the
network or code coming from libraries that are not bundled
with NetBeans. Which permissions need to be granted to which domains?</hint>
</question>
-->
<answer id="security-policy">
<p>
No
</p>
</answer>
</api-answers>
| {
"pile_set_name": "Github"
} |
/*
* If TRACE_SYSTEM is defined, that will be the directory created
* in the ftrace directory under /sys/kernel/tracing/events/<system>
*
* The define_trace.h below will also look for a file name of
* TRACE_SYSTEM.h where TRACE_SYSTEM is what is defined here.
* In this case, it would look for sample-trace.h
*
* If the header name will be different than the system name
* (as in this case), then you can override the header name that
* define_trace.h will look up by defining TRACE_INCLUDE_FILE
*
* This file is called trace-events-sample.h but we want the system
* to be called "sample-trace". Therefore we must define the name of this
* file:
*
* #define TRACE_INCLUDE_FILE trace-events-sample
*
* As we do an the bottom of this file.
*
* Notice that TRACE_SYSTEM should be defined outside of #if
* protection, just like TRACE_INCLUDE_FILE.
*/
#undef TRACE_SYSTEM
#define TRACE_SYSTEM sample-trace
/*
* TRACE_SYSTEM is expected to be a C valid variable (alpha-numeric
* and underscore), although it may start with numbers. If for some
* reason it is not, you need to add the following lines:
*/
#undef TRACE_SYSTEM_VAR
#define TRACE_SYSTEM_VAR sample_trace
/*
* But the above is only needed if TRACE_SYSTEM is not alpha-numeric
* and underscored. By default, TRACE_SYSTEM_VAR will be equal to
* TRACE_SYSTEM. As TRACE_SYSTEM_VAR must be alpha-numeric, if
* TRACE_SYSTEM is not, then TRACE_SYSTEM_VAR must be defined with
* only alpha-numeric and underscores.
*
* The TRACE_SYSTEM_VAR is only used internally and not visible to
* user space.
*/
/*
* Notice that this file is not protected like a normal header.
* We also must allow for rereading of this file. The
*
* || defined(TRACE_HEADER_MULTI_READ)
*
* serves this purpose.
*/
#if !defined(_TRACE_EVENT_SAMPLE_H) || defined(TRACE_HEADER_MULTI_READ)
#define _TRACE_EVENT_SAMPLE_H
/*
* All trace headers should include tracepoint.h, until we finally
* make it into a standard header.
*/
#include <linux/tracepoint.h>
/*
* The TRACE_EVENT macro is broken up into 5 parts.
*
* name: name of the trace point. This is also how to enable the tracepoint.
* A function called trace_foo_bar() will be created.
*
* proto: the prototype of the function trace_foo_bar()
* Here it is trace_foo_bar(char *foo, int bar).
*
* args: must match the arguments in the prototype.
* Here it is simply "foo, bar".
*
* struct: This defines the way the data will be stored in the ring buffer.
* The items declared here become part of a special structure
* called "__entry", which can be used in the fast_assign part of the
* TRACE_EVENT macro.
*
* Here are the currently defined types you can use:
*
* __field : Is broken up into type and name. Where type can be any
* primitive type (integer, long or pointer).
*
* __field(int, foo)
*
* __entry->foo = 5;
*
* __field_struct : This can be any static complex data type (struct, union
* but not an array). Be careful using complex types, as each
* event is limited in size, and copying large amounts of data
* into the ring buffer can slow things down.
*
* __field_struct(struct bar, foo)
*
* __entry->bar.x = y;
* __array: There are three fields (type, name, size). The type is the
* type of elements in teh array, the name is the name of the array.
* size is the number of items in the array (not the total size).
*
* __array( char, foo, 10) is the same as saying: char foo[10];
*
* Assigning arrays can be done like any array:
*
* __entry->foo[0] = 'a';
*
* memcpy(__entry->foo, bar, 10);
*
* __dynamic_array: This is similar to array, but can vary its size from
* instance to instance of the tracepoint being called.
* Like __array, this too has three elements (type, name, size);
* type is the type of the element, name is the name of the array.
* The size is different than __array. It is not a static number,
* but the algorithm to figure out the length of the array for the
* specific instance of tracepoint. Again, size is the numebr of
* items in the array, not the total length in bytes.
*
* __dynamic_array( int, foo, bar) is similar to: int foo[bar];
*
* Note, unlike arrays, you must use the __get_dynamic_array() macro
* to access the array.
*
* memcpy(__get_dynamic_array(foo), bar, 10);
*
* Notice, that "__entry" is not needed here.
*
* __string: This is a special kind of __dynamic_array. It expects to
* have a nul terminated character array passed to it (it allows
* for NULL too, which would be converted into "(null)"). __string
* takes two paramenter (name, src), where name is the name of
* the string saved, and src is the string to copy into the
* ring buffer.
*
* __string(foo, bar) is similar to: strcpy(foo, bar)
*
* To assign a string, use the helper macro __assign_str().
*
* __assign_str(foo, bar);
*
* In most cases, the __assign_str() macro will take the same
* parameters as the __string() macro had to declare the string.
*
* __bitmask: This is another kind of __dynamic_array, but it expects
* an array of longs, and the number of bits to parse. It takes
* two parameters (name, nr_bits), where name is the name of the
* bitmask to save, and the nr_bits is the number of bits to record.
*
* __bitmask(target_cpu, nr_cpumask_bits)
*
* To assign a bitmask, use the __assign_bitmask() helper macro.
*
* __assign_bitmask(target_cpus, cpumask_bits(bar), nr_cpumask_bits);
*
*
* fast_assign: This is a C like function that is used to store the items
* into the ring buffer. A special variable called "__entry" will be the
* structure that points into the ring buffer and has the same fields as
* described by the struct part of TRACE_EVENT above.
*
* printk: This is a way to print out the data in pretty print. This is
* useful if the system crashes and you are logging via a serial line,
* the data can be printed to the console using this "printk" method.
* This is also used to print out the data from the trace files.
* Again, the __entry macro is used to access the data from the ring buffer.
*
* Note, __dynamic_array, __string, and __bitmask require special helpers
* to access the data.
*
* For __dynamic_array(int, foo, bar) use __get_dynamic_array(foo)
* Use __get_dynamic_array_len(foo) to get the length of the array
* saved. Note, __get_dynamic_array_len() returns the total allocated
* length of the dynamic array; __print_array() expects the second
* parameter to be the number of elements. To get that, the array length
* needs to be divided by the element size.
*
* For __string(foo, bar) use __get_str(foo)
*
* For __bitmask(target_cpus, nr_cpumask_bits) use __get_bitmask(target_cpus)
*
*
* Note, that for both the assign and the printk, __entry is the handler
* to the data structure in the ring buffer, and is defined by the
* TP_STRUCT__entry.
*/
/*
* It is OK to have helper functions in the file, but they need to be protected
* from being defined more than once. Remember, this file gets included more
* than once.
*/
#ifndef __TRACE_EVENT_SAMPLE_HELPER_FUNCTIONS
#define __TRACE_EVENT_SAMPLE_HELPER_FUNCTIONS
static inline int __length_of(const int *list)
{
int i;
if (!list)
return 0;
for (i = 0; list[i]; i++)
;
return i;
}
enum {
TRACE_SAMPLE_FOO = 2,
TRACE_SAMPLE_BAR = 4,
TRACE_SAMPLE_ZOO = 8,
};
#endif
/*
* If enums are used in the TP_printk(), their names will be shown in
* format files and not their values. This can cause problems with user
* space programs that parse the format files to know how to translate
* the raw binary trace output into human readable text.
*
* To help out user space programs, any enum that is used in the TP_printk()
* should be defined by TRACE_DEFINE_ENUM() macro. All that is needed to
* be done is to add this macro with the enum within it in the trace
* header file, and it will be converted in the output.
*/
TRACE_DEFINE_ENUM(TRACE_SAMPLE_FOO);
TRACE_DEFINE_ENUM(TRACE_SAMPLE_BAR);
TRACE_DEFINE_ENUM(TRACE_SAMPLE_ZOO);
TRACE_EVENT(foo_bar,
TP_PROTO(const char *foo, int bar, const int *lst,
const char *string, const struct cpumask *mask),
TP_ARGS(foo, bar, lst, string, mask),
TP_STRUCT__entry(
__array( char, foo, 10 )
__field( int, bar )
__dynamic_array(int, list, __length_of(lst))
__string( str, string )
__bitmask( cpus, num_possible_cpus() )
),
TP_fast_assign(
strlcpy(__entry->foo, foo, 10);
__entry->bar = bar;
memcpy(__get_dynamic_array(list), lst,
__length_of(lst) * sizeof(int));
__assign_str(str, string);
__assign_bitmask(cpus, cpumask_bits(mask), num_possible_cpus());
),
TP_printk("foo %s %d %s %s %s %s (%s)", __entry->foo, __entry->bar,
/*
* Notice here the use of some helper functions. This includes:
*
* __print_symbolic( variable, { value, "string" }, ... ),
*
* The variable is tested against each value of the { } pair. If
* the variable matches one of the values, then it will print the
* string in that pair. If non are matched, it returns a string
* version of the number (if __entry->bar == 7 then "7" is returned).
*/
__print_symbolic(__entry->bar,
{ 0, "zero" },
{ TRACE_SAMPLE_FOO, "TWO" },
{ TRACE_SAMPLE_BAR, "FOUR" },
{ TRACE_SAMPLE_ZOO, "EIGHT" },
{ 10, "TEN" }
),
/*
* __print_flags( variable, "delim", { value, "flag" }, ... ),
*
* This is similar to __print_symbolic, except that it tests the bits
* of the value. If ((FLAG & variable) == FLAG) then the string is
* printed. If more than one flag matches, then each one that does is
* also printed with delim in between them.
* If not all bits are accounted for, then the not found bits will be
* added in hex format: 0x506 will show BIT2|BIT4|0x500
*/
__print_flags(__entry->bar, "|",
{ 1, "BIT1" },
{ 2, "BIT2" },
{ 4, "BIT3" },
{ 8, "BIT4" }
),
/*
* __print_array( array, len, element_size )
*
* This prints out the array that is defined by __array in a nice format.
*/
__print_array(__get_dynamic_array(list),
__get_dynamic_array_len(list) / sizeof(int),
sizeof(int)),
__get_str(str), __get_bitmask(cpus))
);
/*
* There may be a case where a tracepoint should only be called if
* some condition is set. Otherwise the tracepoint should not be called.
* But to do something like:
*
* if (cond)
* trace_foo();
*
* Would cause a little overhead when tracing is not enabled, and that
* overhead, even if small, is not something we want. As tracepoints
* use static branch (aka jump_labels), where no branch is taken to
* skip the tracepoint when not enabled, and a jmp is placed to jump
* to the tracepoint code when it is enabled, having a if statement
* nullifies that optimization. It would be nice to place that
* condition within the static branch. This is where TRACE_EVENT_CONDITION
* comes in.
*
* TRACE_EVENT_CONDITION() is just like TRACE_EVENT, except it adds another
* parameter just after args. Where TRACE_EVENT has:
*
* TRACE_EVENT(name, proto, args, struct, assign, printk)
*
* the CONDITION version has:
*
* TRACE_EVENT_CONDITION(name, proto, args, cond, struct, assign, printk)
*
* Everything is the same as TRACE_EVENT except for the new cond. Think
* of the cond variable as:
*
* if (cond)
* trace_foo_bar_with_cond();
*
* Except that the logic for the if branch is placed after the static branch.
* That is, the if statement that processes the condition will not be
* executed unless that traecpoint is enabled. Otherwise it still remains
* a nop.
*/
TRACE_EVENT_CONDITION(foo_bar_with_cond,
TP_PROTO(const char *foo, int bar),
TP_ARGS(foo, bar),
TP_CONDITION(!(bar % 10)),
TP_STRUCT__entry(
__string( foo, foo )
__field( int, bar )
),
TP_fast_assign(
__assign_str(foo, foo);
__entry->bar = bar;
),
TP_printk("foo %s %d", __get_str(foo), __entry->bar)
);
int foo_bar_reg(void);
void foo_bar_unreg(void);
/*
* Now in the case that some function needs to be called when the
* tracepoint is enabled and/or when it is disabled, the
* TRACE_EVENT_FN() serves this purpose. This is just like TRACE_EVENT()
* but adds two more parameters at the end:
*
* TRACE_EVENT_FN( name, proto, args, struct, assign, printk, reg, unreg)
*
* reg and unreg are functions with the prototype of:
*
* void reg(void)
*
* The reg function gets called before the tracepoint is enabled, and
* the unreg function gets called after the tracepoint is disabled.
*
* Note, reg and unreg are allowed to be NULL. If you only need to
* call a function before enabling, or after disabling, just set one
* function and pass in NULL for the other parameter.
*/
TRACE_EVENT_FN(foo_bar_with_fn,
TP_PROTO(const char *foo, int bar),
TP_ARGS(foo, bar),
TP_STRUCT__entry(
__string( foo, foo )
__field( int, bar )
),
TP_fast_assign(
__assign_str(foo, foo);
__entry->bar = bar;
),
TP_printk("foo %s %d", __get_str(foo), __entry->bar),
foo_bar_reg, foo_bar_unreg
);
/*
* Each TRACE_EVENT macro creates several helper functions to produce
* the code to add the tracepoint, create the files in the trace
* directory, hook it to perf, assign the values and to print out
* the raw data from the ring buffer. To prevent too much bloat,
* if there are more than one tracepoint that uses the same format
* for the proto, args, struct, assign and printk, and only the name
* is different, it is highly recommended to use the DECLARE_EVENT_CLASS
*
* DECLARE_EVENT_CLASS() macro creates most of the functions for the
* tracepoint. Then DEFINE_EVENT() is use to hook a tracepoint to those
* functions. This DEFINE_EVENT() is an instance of the class and can
* be enabled and disabled separately from other events (either TRACE_EVENT
* or other DEFINE_EVENT()s).
*
* Note, TRACE_EVENT() itself is simply defined as:
*
* #define TRACE_EVENT(name, proto, args, tstruct, assign, printk) \
* DEFINE_EVENT_CLASS(name, proto, args, tstruct, assign, printk); \
* DEFINE_EVENT(name, name, proto, args)
*
* The DEFINE_EVENT() also can be declared with conditions and reg functions:
*
* DEFINE_EVENT_CONDITION(template, name, proto, args, cond);
* DEFINE_EVENT_FN(template, name, proto, args, reg, unreg);
*/
DECLARE_EVENT_CLASS(foo_template,
TP_PROTO(const char *foo, int bar),
TP_ARGS(foo, bar),
TP_STRUCT__entry(
__string( foo, foo )
__field( int, bar )
),
TP_fast_assign(
__assign_str(foo, foo);
__entry->bar = bar;
),
TP_printk("foo %s %d", __get_str(foo), __entry->bar)
);
/*
* Here's a better way for the previous samples (except, the first
* exmaple had more fields and could not be used here).
*/
DEFINE_EVENT(foo_template, foo_with_template_simple,
TP_PROTO(const char *foo, int bar),
TP_ARGS(foo, bar));
DEFINE_EVENT_CONDITION(foo_template, foo_with_template_cond,
TP_PROTO(const char *foo, int bar),
TP_ARGS(foo, bar),
TP_CONDITION(!(bar % 8)));
DEFINE_EVENT_FN(foo_template, foo_with_template_fn,
TP_PROTO(const char *foo, int bar),
TP_ARGS(foo, bar),
foo_bar_reg, foo_bar_unreg);
/*
* Anytime two events share basically the same values and have
* the same output, use the DECLARE_EVENT_CLASS() and DEFINE_EVENT()
* when ever possible.
*/
/*
* If the event is similar to the DECLARE_EVENT_CLASS, but you need
* to have a different output, then use DEFINE_EVENT_PRINT() which
* lets you override the TP_printk() of the class.
*/
DEFINE_EVENT_PRINT(foo_template, foo_with_template_print,
TP_PROTO(const char *foo, int bar),
TP_ARGS(foo, bar),
TP_printk("bar %s %d", __get_str(foo), __entry->bar));
#endif
/***** NOTICE! The #if protection ends here. *****/
/*
* There are several ways I could have done this. If I left out the
* TRACE_INCLUDE_PATH, then it would default to the kernel source
* include/trace/events directory.
*
* I could specify a path from the define_trace.h file back to this
* file.
*
* #define TRACE_INCLUDE_PATH ../../samples/trace_events
*
* But the safest and easiest way to simply make it use the directory
* that the file is in is to add in the Makefile:
*
* CFLAGS_trace-events-sample.o := -I$(src)
*
* This will make sure the current path is part of the include
* structure for our file so that define_trace.h can find it.
*
* I could have made only the top level directory the include:
*
* CFLAGS_trace-events-sample.o := -I$(PWD)
*
* And then let the path to this directory be the TRACE_INCLUDE_PATH:
*
* #define TRACE_INCLUDE_PATH samples/trace_events
*
* But then if something defines "samples" or "trace_events" as a macro
* then we could risk that being converted too, and give us an unexpected
* result.
*/
#undef TRACE_INCLUDE_PATH
#undef TRACE_INCLUDE_FILE
#define TRACE_INCLUDE_PATH .
/*
* TRACE_INCLUDE_FILE is not needed if the filename and TRACE_SYSTEM are equal
*/
#define TRACE_INCLUDE_FILE trace-events-sample
#include <trace/define_trace.h>
| {
"pile_set_name": "Github"
} |
`protect begin_protected
`protect version = 1
`protect encrypt_agent = "XILINX"
`protect encrypt_agent_info = "Xilinx Encryption Tool 2014"
`protect key_keyowner = "Cadence Design Systems.", key_keyname= "cds_rsa_key", key_method = "rsa"
`protect encoding = (enctype = "BASE64", line_length = 76, bytes = 64)
`protect key_block
lz3B4KHX5z7HJK6kHiZGMmcEnUqLtTRT/n7HdY7szClNEEBtVq2UQW/wdwwMN27AnOLZPVfuS67c
Y2O4fk1xOw==
`protect key_keyowner = "Mentor Graphics Corporation", key_keyname= "MGC-VERIF-SIM-RSA-1", key_method = "rsa"
`protect encoding = (enctype = "BASE64", line_length = 76, bytes = 128)
`protect key_block
OUoXLY9rVEqAKiJgtR19Q8FIQUm9wPmLFXF2sem6w9gJVRflCYIHWjOAqv6eppRvqeqcjaja3KKN
iRxsDXzkmdVb18CNyYXYPgZU4MySqAPoAE8BZ3alC446EKqG5bo3Faah4iFiaQ2fsSYQDhznQFWV
FIedseAJGSJjdgeT43M=
`protect key_keyowner = "Xilinx", key_keyname= "xilinx_2014_03", key_method = "rsa"
`protect encoding = (enctype = "BASE64", line_length = 76, bytes = 256)
`protect key_block
bHuGx6phwwi065A2gw0E1Tqc2OLDUoohEHY7mOoJcUQwvr9OEJ4yz01Uls3wx2UOc24N+ANXe8aM
YdyfwspjYSBviz8nI/XUT5fPMjNbtL8HFChLorcX+K00Sc+A9m1I9+5W+Wd6GLSKBCVYKnWRn9Os
rc68y/GTowadTW08aEEccqOavDD8XG+R6gQqGpi5C8xq75oqBRmE5yNpxpBXxQRz9mmAsJcZ773H
BpObF8UUngkYlRzDjfxz3vzf6lVAPrLm55l1zEsel1LRtdqlRT8kBTrz1kke43v4c6xNv0u+i1Y0
dvxmNCEmLNrwBuVbcA8l6Jjp0k0WZScEgrEOCA==
`protect key_keyowner = "Synopsys", key_keyname= "SNPS-VCS-RSA-1", key_method = "rsa"
`protect encoding = (enctype = "BASE64", line_length = 76, bytes = 128)
`protect key_block
4sCk5d4E+rPjLUhUiUrzCNkXo2ztvWgfU4Ic3n3YDGHZzWC7cjzTKSJroiCXwtIaQEIL5FpdrGOo
eHf9JlqikZvG/pLSpSZr6BTZioOpsjgI4CJq9n0wGhpyClKm24hGzYEPH8AkBs4wVmgt4sOHvyYc
mYqTUQDFFlehrx6Wh0E=
`protect key_keyowner = "Aldec", key_keyname= "ALDEC08_001", key_method = "rsa"
`protect encoding = (enctype = "BASE64", line_length = 76, bytes = 256)
`protect key_block
cjjanW9F+fseEMt2SDd6R3KYZVrfLHKeq8ULFHbP0E7BiwY4Vkec6zVJkc5FOAAhZdR5Ywc2FOnS
jk9bJ37QuAeSdAcrSzysHiIJYxA3kbMVuIa63kiSn3dKlLmPc1gZ2/UtM3HTBff0RPQzxl944kH8
SUid8bQM/bx+7wxLnTLuo6uTok/+c8ipzvZZ5iJ9DgzZyHiiuOtKu8JWNRVw1P5d1QqQT3EZ7Q8j
fnqcUNAmoR2w1hlmAhXTJgZbpiKUcMF+Y9/twpUzFl3rdEE6PKGzb5YQ/Re4uf+MJU96/KSTzmBR
Xfe8WjI4zLk+NlEm8eNku5cgYGTA1pkwApl+6w==
`protect data_method = "AES128-CBC"
`protect encoding = (enctype = "BASE64", line_length = 76, bytes = 31376)
`protect data_block
PKlpisMKFINH4hoELw81Ae+vpIr0xr/BIQZISQh02QmAYRngfWchi+A+2gXJ0ErM+PWm3fbvLHaf
UADT/opvnHMCrmwuOuQX48J/a1y0sztlHgsA7XTu3se9+qgRV127Gr/cdb+LDyldoH6Wo5xriLwb
Iwea2VF+9INr3badrDkqVBKd90MomiXDl7b/tDl1pJJJ5fUuHyAjAp4u2X5rmBPFdm6F2n22QSFs
sDl+y+xUItciIPufPpfFSlI7d6VScr9f1Tk6aydipp9SFkCDUerCnyVACmhyb4kvof6cBIFWy11D
/rBVN8/83uZHauZhPRA0XrYJ2z1qG9Mml+JXNJjA16JbRZgrTOGJ9zgvYMvYADSAHWaNgn9uzMtD
1GtkoD5aaSKf+yEkgnLj3Yrvrf4j3K+RKLKQUxah5SGMjasqZubtnNR1h7UEPzUUGZ6qMSDEMV+2
x3dyXQV43Ml+cAlyTGTqRQV7u1A6DsPKF6sbEVtEJwCqiC2u79YbD0k7/qDmXlFAEm7YOxfF8Kja
oRtPWRqsuFrCiYGK/pvcadr4zHrqzf/4wTA/aJr13Lh7+nlq9cjlN2J2wNcqlLUTro1ekuMg3WYT
3QxJtnjKe1Qkv0+Y19LG/N7eCO+y4irSccEqTdiQ/9BgVVQEX9Eyt7ZAbhox8vmzvpFK0Yn7pznd
h0mglaxIYPV33Ve2GtnEobJr6qczhojzMu4hGO4e/hobRBbM9AgLgYGRzQx68/jjr9/kp4POunQq
Tw5B5Lwc7lV8v3yjKtzGc3OWJfSE2LQqoYJyDuqOKXVy0yeYfWqRUr03yFr3Ekt8aLQFhrhAWBrV
GHFTOgsnk8CgM8quOo9Zi/84sEC10oqZA9nzSAFA+rLkE5F24t1cxO9RrEe0QzFihVXyFjDNLEhU
WMV9ueVzMS05ilbmBJ5NQ44xzDmY097m0KO45PxlKQrBA6ePddt/02pMLT6tBsD1ly4zm87x8LdO
K+bdEbW0cBQUibD6YRHtQSpwJn1GlA6rNVsJyoapYcDpP0hQNvQjAR5kbUfYZORdfuyRQcxHXu7A
1W+ihpL+/su5m/Q8mpTJOdQHosaDGQloP82y7yO6rAt4GGjrLgE8Mk+OyJ+y+sK1ybMaVeG3JOIq
rBJbtEZgH8pCDF/5VrUmoAIm3Xpj5diTLvd4B/uhJUttJCldR5dnZ369uUdXDZRK7BsLC20gUMZB
PXpyrOgZTkjiYkyF/AD1Pju4pAM6/CJ10tOkyPdgsRNh++P6xO7T5iiHQ7Lca6S4QJb3CnDSazNB
l+XjmAJmJEq2IK2/nqLnyUoP6xrra3DOYx7dzfrFWK1V/vNXGmNgmYhmxMuNNUtcVFA6s9nQInJ+
zjqaTMD6PLJ9jdhlRSvrm1x6bX6a7gy7j2dxYY88ZP+dKiD7qnsKQtN9Fa+HBD7yDqosdZ1XF+Z6
CPejOjgL1vQ1q/MVYbitgeOC41eQto8k7WsL4vQw1ClwN3L1pdkWobDIDZFAF+XGb9VNFZQABt9A
xc19fqWdO0Vh2lg06Wk5UmUelW4Qd6qiYsrD//nypuimh47IQTS7AqB4TaJtUrEvCWODlGLbdmNR
gGiD37ekMI44/OkK3hiGi5Lc0/MJaHUTELJkxpDIQd7E6wdyZx28KnEGu35B6rBFqZ0ctET3G/ep
5acE9tEh4xAa+eqyDX4zuQlMxOCqlq7DzuQqVgXBgwR0DM55A+b6H1gBiBshiCdJ9cxqg3D5nA7P
SkCAqoFiLVaelzSKqmV5Y+i33hWqyqZ4pkM/gLTkg+Pe0dYLUKUrbHIjaO0FYbUFeyFbvQr7+ScN
A+GfS4iXok+lldv2ECkqWoPcZNgA51oZg4j/Qa8m2TSnxZ3r7LUc54ygOU7eX03hlCNUWKfGmv7K
tXypBghLBzdRKEy+VrlXkVjM9uJGJrd59ZFjIam7BXbD5zJZZNWE29IxBKy5206EJp7pJcAz4VQp
nwM71UFuhQK8sNDV0TxYVZnvuUgCaqGOsGA9rGANzr59siXK0AOcIGgauchLy4KD0UVpnxukmMZ3
qCyO6jUf5a1rWCWHFG21RYDZLRL9bUVMhlNCq9Z9+NGsVUuSursZYDXZUQ+8Q2+R05h5Sm/j8JYE
ASM6qzAcFk5C8fBuxA0kuFU4iPz2KcgA3otA80CttkgFFSj+N8qBPu0kIqaw1teuqcQuHgQ6886a
lNfYgS5pVO32x2ZWEBtWIaX48GJ059WJSAdTtIyI786swsAKh0AecKHrQOoRzRQXTkjRRknrPphk
VahBrKjGs/Kg1RzYFdRkaydajcmPj0+ovICf/gnx9tFOVOWaBw87xIwbk89JYYM2+wBQ28lbmROg
qwtXuubIHMA4OGZrJyvK+dEZy6hI/7kUxISrZnGiyrmw/qnS2qnC6yMZtftpwJauIqB63cxqIYXl
zLNNfQob9y+XqJ0xha4y+6ONvqaYys/Akl2bQF7TG26c+7WEF5AeCTPkpT9QdqEvoQPkNGeZwDKA
k70uXTpd5t9NcToWMP5TdX39kU6o3XTflqp8+6lXXxkblsPYikBj4TG14/dyaCXb8XxtdB40QiaE
3n7/f/+7sqKPyKCAAFy+AgF6AbS4j5KfH8gtDODoJOL+lX9gF1LLDFQ2YzdX9dbR+Ml+RrxyCF2F
n6tX7eK+esun5PznBy6HtEEO5+jeFBoy5R7FT24/avhoGQoJeGYZ/qXKDfIyqpTwtZYpN6TzmU1t
5jNQS8WgiX2VC993AuOfo+7JpmM7tpk32dV/EPULOZgAV6igpvTvqTgb7mU+/GrxE4HEXX0LyJp0
UTT6jGnpPIkYFSkjn5kgeofKRBBuLD0pk5xFhf5hm79Xofa3EGwdvK0XiwU9pro+N0tHax5Jz33R
AjuUcTDokHXPYKyt+3xLc5i84CrLct/K7wkSK7f93I3ZtZuh5jjXtzSx7ITnjvLJBVBUcT9APUTu
vXNOqRSkWV7Tfw+KJfeOk9c/hMcvTp9VGnh0wX3nWpRHla/8PHHCCjZ6oVeb063x08PkQNthT2zs
Q9FiUsRfz+ceaTZ6nzKSXPjLrTzPxn/uva9JRNe26CYP67JyQfDVnCGqHWJHh06FSNzaSlLJS5Zv
WvtlpAfnhUme42GgZQylF1Hx51kVYNwAXpEclgR6x+ROxEYSBJewLr11PVmJAwTD/Yrv8/2XycSx
JfDPT8KQZWzEhomw84Gb8Hg/bPB/sPEPwak6aOS40Llia4itAgxAvoAvVDiU9K4IU0/plgcM0BPk
fsCLDg6ouJsgISw+WKizUIjmpSmmgYlKJV6d9U7M0V3USOuZfkz48QTtDXd6c4/GXpFmMz4lOdPg
YQ4gfyDpsMW74g9bLIUSDMzOhCKc9B1s4Vv2GspFxs0Ww3nFOjbHHEsgrOLRxReBT6PnK+gdbCow
0APPROmVPpp7n2iN7AjmwjPl4+elL+ZYtiqWSob9FrgrORMBQd0bWkDWnLISz52pP+p6S/bGvIsn
k0SdpP7vAKwQJnoZUJ4juV10VQmYipToVbU8Q9GuFgJF7NiaGbTiCs02BnyXS4V7VrivZy2yVslj
cjvyuHf/Z7xNysOTA5cRgpRw/GxoNmm6dXqGKlnzPpsklyQ5uf+yL0nsJrY7fBZnLOdjkg553rEf
8aK4AL1Iri7WkqqgOmwD4zYMGEuTKo8nysKXlFNUDaIe9nNo7E1Y9Kvo2OWOFBb01Ci5FYPwlIiL
WjC5/px/Kz9HQuUyKBz7fqLoW7hE0sBMytF/MaTjwUo3eVP46m1YTpsz/Kx5ggiWQ8pDvsWLPMXp
0S5NsMen+Qq1qUNEsR2fEaN1XIvymH6tG8JpjXtl9jnksGWuMR/q18hxOoomWJZyuP0TOKiV/zEi
8kwaF8by+ntqEnpx+1e8HQ11m38vda7xGaTOBAAISXu+3NwXRKggYPj013NIdnrlWCmQLxlbBnVU
+yD09BP6gexj7Dmh6pPpJCd3PVFdRT8O1HFly7rW1YepF1kC9gYPnGNhEYys0yjZR/GVoa9+P40o
nwiyTV4OFYI5z0ZGQxPK912ALmq5D+19JLIQ3BKGfpSu8rF8cb+2uoIx7IsF49LP3HkkU/9aY/NI
oLR1458SnB685uWnoRMBz6yvq6d+yay0OEjS+kRmzkPL9mpoC8hKvUwWVWSJi9612bVTJpmzrDKR
PxG67PHy2x0Vdmm6rzVCyoJTl0LFHOkPmqUV30LUCQSHXaovjFr7VWmbl9fXgjfmLtdU2l16fFZf
iHy3WrCVvb4LEmh1rFatZaBRbMPD1dtHlR6byHl/83OIAhLP4frpdjrEMOUbd5KRQMiNcPRlc/wj
pebZD+CibysL7JiTOd3WpXGy64fio6dkAt5KAEPgJjmuKI5bivduGHsbbn86wDqML+p6ecs1U1cF
UVy4cCxcNAF4qxjFLrQki2NFzhllre49yeP3v2rKLJuwb1kb+tG1rSkZjSRzmw2RB1/QfJYUwHJl
NMGf8TESr6THb89R2apOyXTfCTFz6Os50pYrAiMdeIVtA9Ibi22dhtR9PRR5VcEDKwtq9FCxBuWr
1zv+fGBT0sn+KAUz/gRdZB3SO8QQK/nrUx++ilf1wZo3eFaHzaQPUd8lqmCHMx/fCkI/kXUbXwQt
DDxZIW2MjU8effE6rF3UHUa2O3RU47f9bCyhqmgtUKVErvkN+WRsVRMfG10qZAtpGFzZHF0Txj3s
IqgIWKWW0I95RGVzvHhRFkpdYHlM4QSC29AvzT7oW3GtKkJyeozvSPKcxNzW0Pre9droCF5igxD6
KO6vzu/uf5pKZ5LAuotKnmUFyZJEODyHe+iNTBgwFckJKdq7PEi+2Z9HlSUA/BgX+gNRsh9EXAQe
40Ith1sdcUVnhKuRJIM6e7VeSz13PW68zjE8y9SADE6BIx8IQU7QPNzNpq9Lvxzj0A0R1Mt8syGE
HDXLi4jdCccl63oNz0Y0u+7mij8MLX9fRl8zXxn9Z8LLCNMCSZVXNPDHZQrIc438QhTUYFlch894
As8dazw2x3LDEdA1k19kTMOt4C4IJWZaXLaS/PCnhJomMbtiGcyx8GuYJxydQ7vU1lhl9Y8fPbio
I4VF2n1ZqQ8tATQZSqFToWKMzOOVBSYKbhUqAs48bIRyxshpJY67whnqJfA8VZMxjk6zFH2AoriB
ynFLOQRwtiMdy23DEibt+d2rY+rueqtc8Vy97kdxz3ea/lb2glJHFq+/SocWYX+t6xylntbg/8mW
w1W/1YOPt2j47k+SWFOeS7Z7WB6xshd/8R9106eVv3jsZIlpBiL4GO+TCSsBwl/x0/IMy3BndOFY
YXC4Pw0M3pDdPxgZNULHyrWKxEOKzI/OFjYRZj7XAeUxK0GauHwF2fB481wYOjlOT66Xwto5eaof
WvYI9ekR5Y6bh4UO8fdIBG7TrSp66hvXxVqEywS0ZVag3m9aFWfeFHS7W2aeDhCVxJwmHl953iMN
wSnb3O3LNauNHdT+O89YwjKX7s17DnP8utGC63xcpCIgidcCModjhMfmjQy/lHQRrdLyzunbsGD9
lvZyOoBGK4fPjDjcLU8lucZxa80QEx9rxssznnbPqcX/hYB9XRh2i2Ctd6+Rlx3T+ZRFNpDADuJP
/aoEIQKw2cyVAgHddycD+fNzpA7dApUjjYnG+4IG7Exp1dudPac3gXzQUwri5tsMEr/6jcRdj/Ab
SbEb9nyoN0vDIjcoR3mNg4vOi+r3AoX3g8oADqVoTbzXyArWoc40J/TBrI8Lo3q+YXGPLQjenxAO
+SxVR17ywkTYxRGIQMH6rcMPePprwG7xD6AWF5AlVFS3QgRPstQY6P/pRHTiOXiYv/uZVIUiotOm
RsWJ1WNFW6fvQocGUTdCg6BqLFB665ujypc9qm0jIB4VEYs6UjKpw10fQt3jvGuHIsZVG3BGfuLZ
ckGJPvzNS2RIr8B9JvLRvx1ZZwAOjTGe/KYg8OIuA5wp1xDIySLfyb6I+3Es/Mc6knrVTC02yesq
NxvIScNQXR4savweKL0pOSah7uJyPyyI9/vtaK4jHbDyG4CaDYo2JVGVWv93g6HpOrLP9FRVikFc
pcyQXrfHZ/Ryr1gYYdzu9FotFykw7ce/Rl2OyTy0QoNiRuKZgFoiCxx3wVzLDDaexxDwOw6KwJlC
0de3PhsiH89dNi/KuaeSnDHHroNR7FfgOPC/LVvfFFN83Q073ujaBinj6KuC0cYzwzCfIJOhVQil
k3XWe5wsP8sVBuuVtib95HGDznfysc29uLpd4gPmbLCPz4s5NyCCcYOnoeK+cLtJ4SliFJ5RTw6S
Qde8svuEHpAj74gqGyfyx5hrfLsDO654dLjWuGgrymCxvyWwf0BA6n7KDFYymYhy5dhHSUO7TUrO
s5mYKoSFZ3iBC3WC+ExvdyObdbPDJ3JJDzb6xMrIKcJQE8jIO9PD3BqaKJxynLFSXsU4FaqdoY1H
WIyDzp3EAF5xHkpR6j53xLR2LG3kUcX5LmkM1WTmR36VrFSjlS9n+eU+1sduTyNNAv3ONNM4u/nH
hCnF4srQMrgEDHBaOX8nYwUP+uIxk2hAPSPT+0LHyFooAKzHrg9fsnTgXeTiB+yozOxAsBwUqiSj
dZ7Hkf8iwqw797eczUHzlDYPnrJhQnBOoR8iNeyBb4AcTXiacbPO51OBLCHYOgu+M/Vgno+SYrH3
8tfelmVweHM44xDJVdh14niPD21n85LYriuKMGp5ihvEAWhtMarM6qGPPvSN7m0+xa4OUl0839h+
UjDcwhnxX/T4ojzEkSqyHl23C3zMKArMLuNfgECA7R3MM3YBl5mua9iMuvD2f7LMmXwddxB86vnd
IB+ibAbUwIffVOMOL6kEencRUMlODcy0pgt7Z6fs0M8Rw6lcBGdivYim1bSayrgTJAU3NgeskZu9
Ewo4eFm1Zjh+qlsG8Af8wtVI4psHSg8qtDBiwYFm0to1n/25JY9oL0tQWJxVpq+KXHZkXp77GL05
xGm+PJmUrvsPOpx2Od4OA7FQI6VcSX5fFLATMGnZ5KPpNZXIcBXuqwmzgnfqhz4a+wxigGvh0Ujk
jq/ojP5LKsraZKU5Uwp6fIRQTyujgsXamP5lqIw/BRGu79VNqLi4G7Cdv6LNSsTSK6GcmrxgOXXe
/ybsZH9s7lJbbgswXGMD+89wBpyYCPrwoFzIu03hkOr3Qekv+4SNsGRJbSXDOhXj/RoD3Rcv1tC7
Ix6S0meLb8CDF/Ns9v+KolFNOeG/QP3zpd2N5kKeiRMFfxGxXT8ZTUdAZvqEw4Mg9/jphqh01jg9
JXlkTRhK8IXRoNpsI1vSKU4Xh8HxsT+1SnWAiTCHW9x3WHXOyu2qP0jvD7f+fVmYaCogBd+YODnU
pLwTzNa85BL83jw6dxtQuQpqIKDK0BXilXaXDennRDFOvGis35KPWB9xWLKXB433esFY9PzCcsXE
6CdDhWtiaJ8QWlZ/3+81Abyhb1vA0vZWuew8f6rdPhW9RW+oTnPDQChlkWhrsezer9gordNqQAeK
MsQze+WhW4GxDxwboNGs1JZDE5ezp53rhK1wUPDIKdirnDeNT19sUAd5eyBdxEaTw1oPLZAzzrpG
Q3aEO1EokcEAmZMB3/e7upAzAYEpI0oZtnVSRbuR3Hvp+aaSeuesSpkrb7xu1zA9U+XO/mBW0T67
AtheG9pcYy5glRp5GenX+WYBXeGdJxPz4Q6+tl6s+ZsDGP2E5PboV2HMlE1YWSKOtthp4PzIEzgW
VhDlXaabduh0kTSYxNUtMu9fIxC+0StA9YPrjJsPiYMW41/yFf7oETusFLHZl4NmTAoFKwlijaWg
VhXTyzuwKZyM+OWh70GoEHh0tJ5GQWZ7xYFZjyKTCicN8em5sLBrpAt1fe8CM2v3Lj4JfM0zF68A
GVSrxWXHDMuQ8ODhq1Pnybfcgmuxd2juPmBgFabm5tcGmmlhJTEHLd1Zd+j5CxNX5vHdEUEsnquH
SPsnfRYXpcLLWGXA0CxIkf1/w0Um+2I1SObv8JKiX6EbLAzMvzlseCwi7NnbXlqpZp+pu42XPDP4
6ba7xb2TC5lA8rguLrvuySn0kTQgTx/nokX+dMYBd9C8Z9SNORXQ73900LE055oaujIOczcXCooA
3XfvjKK4yUMIUALpalvx9bquEYovIaBtc+cfm2hxUdL36j9vWwy/H+jan79WL8BuJmW8+ON48t8E
zPbYvHn8H88//tBkqBWOnyhZcMmSW036kdQBrMIzHbDFDRiOS1jXH/t9YQBQ2kQKbwv1c69fP7o/
i27grcmgJtfF3JRfqWlAr/Cx7fysP8Y6eDI5rjurm8uA72d8ixVOu6oS4N1M+dWD08du2jAwAWwV
pLouZEfBH7I+QCCjK/c8aEdXrLl7v34BFdRKW0rZg85weEBDUi+DN8EsQfQbGHFAAk5CDw/2IWmM
aHoc6WdfBeC/GiHk9oivut3pjLC7y5EZbgZREusRelAVnXWEpl6KTtSVpRyp38A5AE4cH9NJgxE/
5tLIb+Q6KI3JYqlHVjw0eb9XxRaGgrl5FivTFE6oJX6l/BOdBpsnLWtEpR8utv1tVQyqjyeGHXkq
luMhvaBnd6wkD5qf7SkRkomge8kvr4CbV/R4K61GYcB2ipsN51Nn58tAFTxBg0i3rCEdlTM4h+fn
gWjzfguTU08URF38qBhs/L579rCNHpof1h1Sk3CAarDbmdrFlmY7SZdVPPM8a5td+WDGXmTPNQJi
8mQXLbec4z3xGZznd2uLcxG0Yp6c1cIse0QxlcAG52w7pSDDvRbIdSC8r6C0qT4NJxNPJrGgk2Pk
7tI4ToVkZ2HApCixv+kYtwVic+UxQ9y3azilpyFtE/sfTgjSX+7Um0BEiS8qYITzKSl6MJSzpi0Y
wUBG9gpSsv3QkLwsx21qg5875QTFz/q5mpfZkmk9dmTCw8uzdrnhvPryNUc9732zYJoT8dW+gUxr
9LWgCjvPG5iAQAnQzaPdj1MvMWjMhq2VHINsmwck3BjyNAUhfwztx2jzP6fB0BeCuAVQjiIQjQcW
m1D23lOd8vEIBSIPOUd5oujE4V1Q4N2RE9bUUM4R+pLvNefLFk0J+fQsDQJZ9sEEhHn+9lNInt+j
c8YOpyKz1bgJVt2CHxqHOtze1Y+Y/0ogPlUyGSpP6N0j+zcXe+zZEEnliwhQd0eGyzTThTPOr21Q
lEPHyLhNajPmQ6awnj/G2tsWhYQ9YO5Ri2ojsSOanaX1UOgfJnv59YcGGyApXJ9UOYRFhwDx8KUh
+Ai5E8w0vikxnGx9EmCeKUHgJde4bl8LEvtOUwUNYaJ+tO316KQmLRAWJ5ovd6RY8kQuB+7fQiwN
eUP+7KJ9rDUh25oVqKl6N5YG+9DV1eqozIrK201nlCnDmltTpOnjISBGKgg3URyFhyOw0k7ybfLy
Vmtnoh2W0hNdNcPaZIrV6extznW0UceG8hkwswHuS4/CGwXRDs9yAKmHNb9AW7TUYtZnrmb4EEzK
whXjFIerVfWLEhkGksTvOK/MIMZLV/gErvRjJvg7GefWhZ9BAfDsTrWpXQq25c9FOfMrvxdUdzji
tCRRh4tClQs+hV3RTWFjAhidx0maRU94+mi89OVe1ARni3LVME3kR4Y2n46UnRhpPEg85za2/gb1
2BJ2Y4mF3ItjrscMspMlhXCd+vwIP3F4Z1D/RaX5UA/KAqtnuRtaFTMKBJZeJPS3VH2CZuodGNP+
gS6XGVGtHjKXlEVbpKycSPftcxjST4xkPXyXg4C/NJKAjBBfLtLK3sfJHrrjtdHhTEgbySdb4fOR
FtyWsxt8fVk6LkH4iX5mTvCf72wn4MxyOQrf3XC6+Fj6ca21hjsX5haNMIVSl3iZymU9FKxP+oxr
ze+KC5gDYnH+ssQA/t8hJ8AC7MutVK5ppcIj1e6vwiSDDDj+Cali2ZQaoWCavTZ3ZuvmtTGJR6Dz
BcV0YzF0pyYmKPevzBK5I7qr1gmT02UwTCj3clglxuQ8s3BzaoBX4KZX7QU+eKQOKbjCRhSpzmWE
ZhK0oONf8g8Jg0RiL9/o/+jI02J6xjOjDPFyt1YH6pG0XOLjTrTX1FTjyGa//ET7x62S+F/FIay4
2ClbfWuLezWJ9Rb+r55PdGsIjWjIi0cfSRrXCCZ2ugHBEq1Onqu3UV5Xaa1YAJ9S3rS7KbCicdKO
rplXBkSdAEC61FdIhiOxo2cNQP/HDV+AxPonrQCqIJxtbamSbT2f27U5d31lCJot4AXBGpFbV22/
JK51LPf/B+kzgGsMKw3SJE5WIaQ/zN46aFgXrfR8tolW9y9AXyDkzPIxlSnvyaTr13dNUXE6s8Xp
Fi0i+HZfZ7w+/Q+1rFk0xn5PKebDCQGJixgVbkv2CXiyQqL6WJhl2aBuNHhNTOyg1SSV6sRsKqor
ZV5Ll1YdXL8CJGohtBlpwOgWTV8/AjWUnX0lpeF7TCCpQyhxLdMEAt3nOjCmCFR8iAfXva+HoN2E
q/n4lfLzI+yBaNCzTmqxvbUD9JISxcI7Uxaj9wFj7riNmPD/4/mmdMivUiRvsAOONSCvEug62XUi
6DBON6ti9V79+2PqJW04GpNEw4ej2SztcBOc9hxUaLTy+nSixs1XhMYxqAT/WuotsZzbCCV4MmXH
4MMXVE11uiNd9MwqI0A6oPXIHCURJtQLX6LACHhVjKPvL79QAxc6X7H6sUaJgxkUTvAE3mi5pENz
9FGMVFg63a5wOHD3eTXmADHDH4hIaL8AG/4bKkvGkdbr5RSi5ifcSCsOhK4Ax6NK/YrLg6pBf9n2
eKcu9IYkPnBEeiOM6wkMBm/xxKEr920fuoSjpPF57vef3COszWIHCZEWJ87puia9ZMeNdiouTy0I
goxnZz1ep1GXTgPno+4DXuzvHCZ8lDH5KPCqQ0rMNvHVorzlkVEJfrmiLcjfA0EBe8MDxlGEOhKo
KJ1hl858jS6kqPT2+aopudhYjF9NxgS/3GwD5rFSVssINACezdZc0iChcin5VwgtRMcN04kEgIEQ
RvaFLTABb2JwQwYT8UOnkUaTsH0jAbz/aDOttraD7TZ7Cs9da3ax2qMndKyJyP8uej73vPVMhCBN
7O2Xvz0awD0RLeSowgHjxaqddL4UI8a+TqXi0JJ/JPRXfw/JiNBkfdKYPoIWcGfIvcggYA/iJ9nA
gCxBPMER28p3sJYQo0nWrKTmFDCcKTBtBLWWsaG9NjmPV4RHrPwK1O0dvzh47OdsXA9IcuAVWI9k
J4OjjGOnjOk8gbCHSZGFH8kBI79bZvQz2uOdVrZpKpSIlLBBOXStsJWEqm/lbPRcuJGigISMrF8u
F2aNx8CUTVES46s09EB5zPvRoQYN4dahUP8/aXJcq8qhsEJrvwqc1lu3yrqU784JTTSwD0GwRJIc
M546MHS2NXhXdxv0Hm8RC7GFB96rxL/VW8vqWoV3XbMYrkd+/qc/cGVHpcK/MYtg+b0xiVZBbUT+
1o3Nh2ZSzsuZl/XYVU0aSUkeL4RejdJhJIjZXTFzu7YccPkJJCVbw91xRbyz45Vf2HW0hq11sqoc
vv/PuDGGwpKLgONrLruQapT3XyEvKbQvguc1LAPB/HRm/RLkq8LFVrIrahg3K1rOdN1mtXieb+Ow
shSEXD6QDEUY1v6wmm0g9gkJhHYi6HT7+0B0wOJTZnIydoPxXmwj0SVKOa3/dPejhUgPbBgYe679
n+kToPEQs+cexSdEcm4L1DdkfpT+3gefyzGyu/CCGAUV4WLaDc0oYbtHBgBMADNl0qFW4YFHAjoc
GUFYvrV+ITWle6vjQ/5fgJb1W8/CRlJPU8N8rc+YnkSyTwwvv5ZpYrbJrg4C3IH2rDDgeGFwEGKY
Mwmd85mBPO39DkrR6CKP2hyLbSJ8UkHjUs4Vet5yghuiZ3E6hRXbOqCoH78wdU4hU+CZ2btebghE
dYsto04PznmldYdbJyldul2pJoOgODgcjZiQimB9KYv7eVXnRbGl1yW/5iK3HIP31k6Zz4muL01M
DJl4+xHXUw+R2ervxsnwhjYXdG3GK2rcca8QTMgfyaOhJcLvtQ3WAnRMTBUpdS2iVsB2lt57LYag
V/CPeI+tzKv3CREdA5vm6QhWv5ypupz4LeeXxRRwPWnD/fJSy5zMUWpVPZHXtT2I0yc870A4J1UE
oZagrqqxxE5qiZh4M1jazk76zQsqiitBwxZajxfNymvIqeYL2+/xvTZhHSYYPKJ+anAU1MpnU+Ie
m207bok3XfxojScaj0qDI7AQRgqwpPlnOUb3YyMr7XczD/gT4eQ3qoQAvqr15GQ592tzK5hxZ87v
Tvz42Rw0NrFl8P7g1h0xWupW1GFTQSFDBbNHab/aANu9EdS4tI4Dy+QCuyH9mvC3MxfPUuLDcDL/
jtVpE/a6pjz0wwLScbus7PBcTvFnV43yoLRKLw3j9yssZ93KWx2jbKWXm57n2PkRMpNpSu/Pnfgt
V/4KG7jk64PWcA3vi3ma3FPxDnJbZ5OBHCNXU9lDuxxyon33tO1DscTpd/DUZLsPO7XEKnhfW8X6
0WRRCYaR0F1e8OOYsBj7IWoG1HYdl6DtRvbaYUc4EZ2DEj8UGBXiof50NRKcORP33SefQcepj9Aq
O1W1NZHgHucAaqiwrr6Y4n2xthW5L7MR2aGLulJotSs5KJipKkbGLpa2ntLnxHmVsfVIJvdHxBb7
U+UEujk/PtM9o+/D7jOCB4QPGGlNG0jbfKItwDDtA1RLM9Vrc9v5hjxu5OKXb4ExquTjBy7zL+ix
sXOVToZ64M1G71W6G7lgBzOa3DWi/mZgWPp5OXO4j06n0R0r7Omd1OLBzNsCx4B1yLQtZ0Mipjz8
RjWr1ZEr5/swdoDMxtbii4hW3Wzo6wQDplBMo1OiHqipZTlFI9uVJVVtTFhX6Ua7O7Gu55z8yCZr
RYkFPuxNWAvHFHwV4v2GqhQCzKVmzcbpikYHg6H159gqKEabqOoeHluMhKJDN01+60EjYjBn5Wq4
yvf/IDrJJzCtYc0413nrsi40Xu1nD7Q2+ArTXaYNP3dJ2I/t3oLDakhanyr3gOYoDd+Yv97itPUW
ubEISFvZEjMOqxfV97LQhBdju07CWTlnopeRhl8Az1msJ3COzXgTBiW6ncezCOkLlISDvkJSsY2P
QkHXCa3K2S5bMxTX8J/JgICti2JvCZFP6wKpps2xGzp3zQVGSbeZxIAenQkWLFNeGGuMKzpnmzYF
Reaua5rrXmnq0Vk3YC0Ewmdrl+tKYA88Ubz2xamSIAXhv7hCMLi+otDkpbtyenVuW5WtGagrpDOs
1WdWmJ9xVmiQXH+FytJ/PEBs/x1k+U+R8tGDLR3AfveCfSBXK3lSvj0KPTp+z4Jd84IFnNU9QtfB
S7sbEvWUehS/XYLhcNKii3mFSnIDqpfw3AS/f1oa7OkWAssZ0YM/iv6fPQBDhfWAV8yKrL7RWmbu
OF6uDkQEgpbq+RTs+W0lDWfmZXnqt8we68NiAIbnDs4HUPgXM19CkLKzRHz+g/+5DMFDFYCgHJRS
HiZVB/NZmdWGcADRecj8YaW+EVQwFkD4Rt7wY5QJqunvdsSuIHg0fvHk3A9FB7X9DeC0u/TnZQGQ
+Zsd7K94eusEfaRuCRInTBJ4B7yo0tCUB+Fd7bEUbamRKwkOUYYjXw7Jg9+Kf2gLU4Qq2bI60S+5
v4XT+TUAceX/R6JdxYNviZhH1k/+84LYbIcvfZExmfTFCwfiR3MY2fkr18+YEXDaNBEh3GmLyp3B
HYLi3F41/LvNvWeSSeFablqd7zJenKjnQ6I9twFJO3RxfUDnuaO2DXVdlOT//MfySX2atQnspGqZ
Y5dKuF8na/Dxxzpwo2KFX9dk8jgZfr4cezfa05mxYXn7fIsGFxRv9cATkFxt2w+bj76SVixYLFg5
2nowOs+WT8DL/nLYFNzjAQEJHgJmwiI36KaXTJEDZNZeoEXbmNGCzKrdO5kVubOFXkTHtJqI/FN1
Eix5Z9LZ4aeIzG5oCAbG5SGi9HYTUtwRzuQBkF5wYkS1uOENpYG9HjKTpVZVvGR/VGNOTnu9THKY
nnojli1n72v21xBrKfs3JUFsgE44W6cHk1O4JM2asl9QfkLfGdA+2zcpR1CEDOZPc0lPIu8Lmstg
9tx1+EVeoLZmbteDkQXdPTC7K1ndd9BcvgTST1czbKX6axdRv7XIPcnq5zvLrEjkwqH+5maD618B
LUt/XDgGyj8b/e1riOn1QT7HzUBQwg8ofqCRV09tMyX5vSheeSIu1diShCnxYk9uViskZykAmY9M
8NdCslRGZU6FcKBH0ZBNdYHuBrYXSwXu/HqGUnM8y52mb7lVbvMcp/ljTB0GJiFtnZINqzVZEXQF
Gu0GAaAnMiVnPywkX8HfcG7uT6r+xFvRq7CEDpbMyYdwdLocNLy2FyhS7nj3WqX6qRjh50FMINPW
BH3F17J59N2GiJ8vJk+W7VZl4Z4emBHWADCColopoV3K/NT3GbNsUrgJnYfXThMYeJzlDaNnh5U7
glF91AFNRi2YI9mnrIJ3+lZA25LDqdgDAlpuJpA/p/u11xdFWjeFquj3TMWub+RB4Ol7rcHLj+YA
dg0vVBTAFuAFJWSafU4Nez21m2MYqBtjN9pq6U9MCP98CqZalR733Q98RXe+oLvzuUCteVIwMcB/
wuQI8pgweL0I2bH84VaRPFdcu0rw6YG3Mw02aPONE/FBwaTioGFZ9F1pu5a4cXTjrwxgDUXxVyf7
4LfS9v9S0mQJv8Vj+pfucXHGA2djL0OtM1EkJjLzKvkYRvY08m/wuN4sayLy6GQlXYZCFmCS16KO
r9nfQWI0TdZCWrgxTWkIV+Z6E6izC0msDU5xjyG9jp3/iyT84QdH4IG/aq07t8tLJyvVhjacE2HP
q3gYhZVyZsS0zXIOBGkcfDibbaH17BdSOvEZT97Efw/llP7mlkmWSlZpxKPT7eR+YQFjVVVMCukH
nlEU4oCgUQE7B2humgBqj/xi2/1qxg14QMiOMvQH/+51ZNQ2XKLp2xIdbdxiXXTAv9Sg4AlSYSyy
shlveI6bBZ76UISQONy3SHQp6poiNstRPAHusTwiykxp+SeCEtKM5yiQ6YWiIYtq1WfzDJSRL3gS
HZaFR2ys72TA1wd3UW1IabZzoaD6PLU47f4HHSEZI7Wlzn0eF1V3YyXNXRTBOcxf2dBI1rk+3yHJ
35+Gizl093C4uQYQ6bqyr81B2UXahMyHmu8YjqCqOQASpoPTgnncXyLq3NOX7mMgBfPQO0sm51AB
13J6MXl3kmjJhzsc32iqp1Xuk4s0GykD9DpHxCdkJcpFdz6UxUBzG5r8rCenHiKtwQhtgDfQDbBS
rDZ7SfnQDk3BAcFVRNIxPi8KXkB7w+zl+m4dU43oLEmk4MAfZ1P07xpL/r5S7wKrBFqptMAWnqb5
qQSh1xy+yU/wkzlHwOu41c/slSspNiybU/c/h3Tr82RpXIFhsMuTr0mLrjqq5mVZlbOpyV0TOy1L
1oWmdCoENgPPLICE44WlufCCJM0ypGsRjNqdPnXg0IZa5FpqWVOGcqCCKM/EEeyiJEgM1KqkxlF4
Xdy+LKWvsfLUNzgWnX5I/AxeXndqEVyTDOWAFB6NuAxbsmCWfy151UIwa2M5EmE32yOfYzjrkqDW
CByFG61RUSBZww/9YG9xj5IpOVTNdHs/DxvQRMNOovNedjsh7JKPIrPvzsF+rfnG1qA2HlAc46cT
wRQm5IeixEZQabH9xFnrpsFudnW6f2VCCGUBifFZGDjtCvlBFiPpeVgnc0AtG0iUpMSYa48LGkYN
celWhB2B19NE5pA2C4FQ79Y3KjE9TYI+pMVaXuI93wx7VKSdAcyPRMqNkvjMvJLKDsalYr+6h21+
FwfjdLwZnDg/K85KNhY4hbMfF1asazA0aZpiF0SXNeY2tQE4AeamTDjAjtaKpzpzOXsRee0iOT2a
MDcj6p9u/FI7F9VSnQFrQpzz+UMt06MPFYyJS9Y0stzH8QuoIgKs9puRW8QgwWudDaval78hUo75
3WqLHpc7foUew8cckFlYIiIYAMDUrNXavPzoCEnsCHa8UFRMGCshBfggQOKvGMsXCZjIG9eIc1fj
ucwQKnFdUQf7bfSOm+3HeVA8SCnUpAMXnTyVpDifYM7jSaJ+RRsfAwkg//ENTOVBVY5KRBD4uT/1
lhfU+nX6bqUCPM7BsTeDZH7OkqOnKfUGVn+2a3HP0ZXuNjrlyC827XU3kRUm9RCuoubCc9sWxtLa
mJEe31e35vRzu8h/MT0wDfJAO4PWrjTtcrCQ9VoiRVKNDAVPubNnZ5B2H3OHRsujMge7M5Ts5N/K
nORBlaR0N1TmcOJEiIeJB04SAHfkiZMRWm3eQyWYpWRvhC/OkO6aoGYTaHiOwKt8o7sddaX/27vO
rMVmo/yRURKLy8Jc5GXg5m3whdbB6lEsbL9mGobFSLT22VQ9lpCiJN84HXK1KozCmeyjIOl+yzf2
/wQG6g9LxP4HCLyWzZWrVjB21qaYS6pl0IoMv5bms7rKGFu/Vb+Taxlnn08ZHlBOTkpra/m1peAG
lVgcJd4BSIl7UP3EjdrMB1NggxgBBSZBOFdnjBnWt5vDv4lqSXYZFr+vcPMUFTTtPH5vhlRT8miO
ilL5gN033RO+SsOB1D4nA/Ph88GcP8qxoXzyXhDxXeLH4yasA/oj+FE/fExSnuZjbtj94HKBa7Io
WbcS8fzzEZCyLbUD4Bh9yuPg0snBA5Rjfbwvnyb7FUXgUCkn7DUE9P+e67v9oW1hE+vTmNyhn5db
jpXb//vi5cOOBm93MQwVyQtJlzbZMGhjn5wWwVGvr8VlOKNgWvnNRE3MizNh0d/UQ8EQvpJQ3kUA
2t+x3odg28fA2youoFZNbB4tDcf9GrtYzEz8e1gkxxbiZwxQqSo+wC9ProotE2iJbd3nL26wuiwR
w+uwpTDz3LIVIkgR9RG+ZaskHzS2sW8cUDSCp3yhat47kq791Kwo+tB7xOQuRBZSqM4+nxSNRFI5
M3sUfzQ16TnvXMfXvUvqtJM1l1cv2sS5E1zx2cZbYgIfPUHGcMUb/RHHNN74EO9rLOGMX7BEXznv
O99tW5cXCvDclyEDpDkQXhgzOWMJ8+FEudhjufVEJbbabO+stwaU0Sm1uxWQOTuPA4tGtHdoGDoI
urcD/QeJ1jhZ4l8yyGHOYLYXREZxtpvMJEPBwUD5BMClFIi0r9AC7tFIGC7VuK5oYmw3S5RY06M5
rb9hO76Ka0zhQKkhIW+6BZY4mOAXsIN3L6AJ7PIj2M/wdn37tdExNAYryUA3jo7eDxaD4xAuQ82a
eFcah5QRnGxI7IE/oYFLnHUXyp91lty6QWoumI2Gsyeq014/r5PFqey93p9X1u/VDoSDIJM5PFmo
RBOC2N+9GylsC5iyWDT5RL+7W732XyfmdPgjDBvjKol98QCNEz9A0wOvFvqtYHxMJjl0/CwA8vKV
W5O1jM/HIPeXJRG6XEjnP4NlWON6LxUZullDIEuwJQdhKl15jlOqnEtpBfMdIu1vSxBEoU1c+sYv
x4JnS8dVBsZsmMx2Tey80Hgz+ynHvBTSMFNiTEw2on752+fajUlzJ96ZWdMo1wk4PVyCz/EY7FMQ
vj6+qnXN/e/u6kvLXwxWIeyLeTwjlTSAqJ7wH6U5SglFMrowH4VdTD69j1Lgixomwtmt7k88/dm7
8jpvY2qs1VlzFDhHVLjetuvbzQfkTXtk0nPd0c0gu6d2vp1UGMpoA0HxJR9FWAbJ08XoRcmLl/BS
DBPVHiNaT73edbMbeawuh7wMDlFB7jRVIdNBlfyfqMWbWiMy3ySNY1bc5JJbIK9gpC8xttW3SaDH
kO8Lag67v07NVXCjlrbBa35eJCDynwlobyh/j3MytgXy3pMAVSwu20SAvsb7RG+MK+WuIChL1wab
imqEzaNh2Ff8eKyg8q1zT/h5JYikLDSipVmQJafpWloYdaJ+73LeJyGl2USOdot6gypFkQpzt9/R
/n5Kk1W5LP+LHZjAoWBiQyuIUq7nspnwN8QCKjtdFe6udnehRw5Ao1oklXqGJ55F225xgOtoss5T
sFqmd8ENklMmywfa9BWFqIiPOnIHHFYSREpOEfPW7pr79B1OHpG/sh/UbO0tTL9SLik7eOh5qews
X6vmOymSaf60XVoa+O9YddbE5uUwVHXg/edbACu0+aUglHz4spZ5pdvlNQC/7mSuYit6gYZVizQr
uMTOLMc8DMZob7fwGE57YHSE6cEsMiytIak7TcY+UOIrIGNH3TQs81spDQFUXO+3T7XYdEnaGxu5
7CNU6CiWpfZ6Nx4NPI52NdXh0ZviPLvEk18uCIW68G9RwEIzY8ye1bZAV/mbGhjgSeyfZXx57PKF
+DEgMZVwoRC3PxuoYmXN2UooFxLOuHzh1/RkRAMfbRn3h3PfE24xsm7At8cHBtKGzdrgif9sJAHx
KeAy5OerqDLXU1epFcHtj8OLjM7lzLdSsw7oP+320aYqCEXoRTe9GesHVqmFeeVF4WmulLB4wMfn
HuFDOwXACP3oDqVX2cwTr6Vp8umpDrBHnpCIjCs7ySK584wWJIqdtE/dWMuy47DzbDNd51lew0pn
phRcwHfNNar9JsIzsM4wRXUj44RxDMVOfxvzIsNtWThbZa3iNV/XpZhSKEHsy4Tf4ESiIvBLgq4u
DUbqDC5aD8T7pxTCzw8tIRqx6JjitLtAhE0W5/XtsOfiKh2juBv4BAdiMCXVXNzy1dhlBs4i57hu
Lo+YBpiLXbEEY73ArVhNAfK78da81wJIytKLH/MyLW1JNQzuCizqwOc4PN8vEgosEIbZFaVr2Ths
/PqnKt8yzbilTiWNTKP82Vq94WFDX1i7Q1jgzgvqWf9TGnlQSRo2wErvLoyr/BOIdrv2IAlMvmqY
Q8I3LUfH+5eGeHbEHZ69FODOYa5pNApdojPpx0zsN0zhbPE3LgUQprZgZvfGQwDoBdFOhM0Isx1c
4wo9XKLTM6RuxG7XCDOwxdHkfgKHz84mbDvPiIp+E48c7k+BbDSLHyhuIL4GEIyPph+O/i45cLbC
8Wp4mQb+XodpbO2KTGUbsdjBDOKNS16E+Vj3nJTxd/cpAWd2SPZ3l0F9cRLk4SBf8ohqNVUeLOrE
59hco8mRYZhtqSaRBl0VH0HjEATgin+1nABPTuscKZkHUp6q+YigolYI9k2mWSHdL9fPu09b42Nw
d4CWiT/MGie1KsOO9gsTqyX8pJEmzRnj7pXiABSCE7VpJ7wJRqHv/JWhs8pR2++KEb2KM1OjOb0L
PGrSmMOqWPr9QPUFx5OBCvBHKaz/rGS7TalcOxJ9/HOpEqbDUzW0jkBGQRsQ2z67b80+hPClsJW0
lSsY7FeCB+50QaFCMbOpFQzmRXXBHHjYGOlIKf4IVsbmLX51BOxoc+7Ey6auBZuEc9xstLYyVXx+
GmYw50Rc2gKDDutpSm2e45MFXbGV/4xFk9gGuYONKt6EP0xm+vQPZ0AvwEYWtsAJbN87vSTZgH2k
AXB+CJEIAYC6fq5Q4ugN9MkMayXZZQRCvNI8MU8T1R1lWx6dL0GJzHdcGZ11X006AMYF36qjswr2
mh0CN/6km3N+MEKNVNKca3XLl0Kyy71g4+G3vaJaPhadWYzgIBqsSszKhkq/MiC6yi5JhcTz9Mez
opA0JsVGfLGRkuoRAAx1cTrrc6TVhUq0WlUy5qTPAVpsUM1qDfAuT04g7y3YJMvPNzYJwx7IpNr3
nZUOqm3471g2qzlm6xR0Elx+yliuKUXPCYj1J0cL3rZGhUaUBL1g7+JIjZA+maJTn9aermMp3fVX
pHtWrgOOMPWCfX393hTuKQB0LFt9PDeyIV2H8oTOvuZuL7rt9VYg1qtY9SK21VVbbPUnNstCh80H
9cp+KkPPiSpdEzIkc1upcoWGMP5FBlFsfwZPDJ5ePIajeCFUxEKQvKA2nV6xJ6BaLejV6SR0zpp6
3Odv4QEg19IUtjl/yFDEpqTOoP0GHS1DC6sXO6/nNQUm2zabuueuvMBUDkTYxnF8VE61NCEt93Qk
jGUa8xYVEBPoaeV1UPVuB20+ffEXRbET3p4NEAlsBuyvrjRS1hHCKd5Lp0qdduZSAflusDPvCqIT
Deav7lutpANm+MIf/7Mu32FTScXAYvJPsYk/7wogrmph1l5+PBqBSstPoC01ZS8bGpXzfNIbnj8J
WsnpD8ic2v0WxgYmSqZn07Y+wqfRCjpgiA+Spo28LcAJ/OeG9LSwfasj43Ej9SpiGfVJFaiRZ6bV
ha6IJdI18TH5hLZKwEW8mV2VNFBqAZNYyfcoXzMoWpUfl/QDllxqOmboVPE7QVLpWCIWyEvxWyFp
jLkV5Zkg8B991NsIrJBpZUq4rn6UJZjVkaivZ2QVU2uaXE9xz7c7USdNaLsN2tshsMhs0KSJUAVo
iHfly9gLzFRw3M4ka8n5AGO1rnrRjgSe6oylmqm4upFqvSeQN+wGfx/Kcp9bS1H1W7Ob4SC9ad7k
Z2+z+fCKFRjhUWCDiWC3YdPtodw7R3nVK8G8GTqQuq64TvXgUKKVVUOfzWCGkAM0V2pP1u3rXCc/
M5CF+gCeG/21/MFiO/yrEXtEmoUjfZWYumAK/vGTEIW9NSZpzjZOthfMnWbyZFyDIcHHIJNtvUtG
s+pdbGiVey8Td7Pi5Pcf7llK4rp/wFlLhxjJNia1MeYTGNMvTz1VVffi9v55l69GEA5rUkVqrT3E
RxQyFXktjHCSVcAvZTnltWDEHbA/p60MRV0OKlm6ECq3RKMp4YvFkmdILNM4OjH6KZsr6aAPXp39
v05crj5zL1PaqOYNV7n8VjkgYryn+SlupbU29owgjw/UD0nbsVozMHZifLV4qw2UpGkZaNDr1x36
S7QJ6KWsOiidZsVlFOiUc5ztoMMiHxp+/uexl1OvImgmjlRGqnSNU3vwMu5Ij8sVvsqdVXhw/1OL
DVgSzjHDnLAMUPm+zwB2R50myDOWZ9NVWdWZiaRGCZjB3NLVjQmkudxeblVNBpyD2VFuTa6YKmMF
3ND6SeyZfGkSxnG4AWD7xThgr/Rms0DrvwAhJRlmU/iEclGA80BRi4vct2QDGt9pLWT7VI0HUJVq
rx2qWHs04JEnzDyQER9TGhewY3v281IWK6qP1bme3XhPtfWd4idoxRx9rSTn3BA2NtwnzxvSR2To
S9c5uAhzzKXtYIrcQ3aiSEQksJLwTavpEOLBVArx7xoP4kGaL4sljAFfQl1IAWZ8zHcxQNxvjiuS
q3Dnsuv8teRgNDPsZtfKVzzQh11ClnbcXDJ+jrKUkg2jC1XSirPu2By8uBvteU9ms68wHt+L4mP2
2su1QQVOX5TaL9tKTYYkK+xkp3xZN7mhFgNOyHG6Cp+vkxxu3rblGLufJiUqqeqEPHGhVpKzJGYt
YnEwinT/uioqvn7jwNyCAWm7aY05JqpaTZdH11rMDYzwNV0F2MvUHveq53OKJ8bVwAnjvjbTuwyO
TF0vpfGBIoRVvRqZgzJnwtmvdMa/9MFx2YwgYgSYMQ57rMB9rq2IUQw6WD5eurrA8cjcB8iGfvTC
w4F3zIj7A5MM7E0GwMIzV6Y6qpylKJ8GjTATigTvZJIFfAVUozx0/1dPrjJLlgWhPKXViNMtDXgn
7zMwHEi8uzHgg71DEKxy1NCN53xr1dDPTVwXsxD0Oylhfc31c9JhyTwWeb21n8miXixT4FK8cYF7
NoP7cm7YYOO+u21JhkVh3N8uYrlLzSIIRmlAXdIum0UUHoavpSLH9ol91oFeiZQfhISmAAvJJ7oI
As94d+61tmbYtkMts9DVjT+X1akl1VsscUaBLi6lSssFJp2WtkYvYyVqDSp24rQUqyIqD6rcvc3B
qDap88a2hpCLm4UAKFR3+PT6LTgWFOvXjLXDaP4FYZAmFNhkSUOBc+x1flGq+btBx4/yu7JwFnLN
l8y+K7DyvT2rPvlHUPvUG3BjjKwb8GtkPx+wzr91YubkxywdDs7iWzBw27CCRSAuS34/ZNNhDBNy
lp+NLKpYeOhDb+VvOQQNYm6092/rxbXDem6/zYDb89YGIvZjrmecM261k3Z8GAOb96SZUrBRHUmd
Vd773PrgT3u5to82kCN1930H6BgqWJ9zPhcPxXTowAM3TfshONekb683nS+QTkkWURkqbMX8JulX
/EBEqL2csCm826fR9sXhLoTztU/KjUKhyg+5wTwjOhgcAfvjVMpRM5TnxYgg10JOvhudlvG0lIiV
VMfcNpLCy9sWcNMszVo8sc84jC+la7vHHvtQIzBcBsnwT8/4BCuoPpEXyHS9LfLKSop/XZMtYw3M
YSfUV+GI1i2vrkrO41WRuAWjdU9c5gHpW0BbswJNqCiMgwpFGqglF2FLcxXvtFEMPwLVhUorl5Tk
FAVgMgA0y0csSmQ2PhqHsQNXZlcjdLr5ZXTk46ATgzbtC36Qbtofvpb6ikNpqnPpvdz5p4Z6kbTA
YtVeXehpFT5l3ydpa/SE/e99shLrsJ4489ORWpKszJJaUJvRmHPZre0lh/rPnCh1JE9nFTDW5GrW
IUUNFV9exHBXmW+kukrwB2OQekhLtzBpXtP9GXY3MxZIryXOmN9gFNFcEEcLJB7eII2XHe67GEqV
9fH+23++IS6Tpm7CcIM2AeI4mq8lPArB+sEcCC2alI6FsDxj41xpfLWp5yeyjVlXLChf2TDJFp0T
nTBO7xkZvpgT+gbvmlsLTENtWoIH5yJx0S4K5CPA0VE+l6EoxGG+TrppKht/GGzlT8maIRdUdc8f
hq/3CBr5+qVd/qrvxvunGtzFeBw2e5sj0tFevzzhODCmpws35/L5rL2m4141LVF9qmBe9hsj1NJj
Ip65Vn0whHHgkQKwT48El4vVzWw+qzHgS5d9TXnvFWwn3hiFnqyOla/aA0tY60Nq+CTUHguqadbo
4jmCDOeq40VlwYcyzHXRLMlVGimMeJnSB5cwdVLfahDGZhZrPfjBPl7M1pbI4Hx1ImNG77oFJz3r
cthozieKik4dQXSpncCsuoCzdivzXnHk1ywjvnA7UIW+eR+9gUTNvEtPKqRV7zkXoBUDtzsZI1JP
RJZCYcMZ2LSaNTao17A+YkuvaJo5inBay3+SiOzEmwm7NQ865g20ldbhMQklnEeJHD9TCK0gtcy/
Vp6UEyEv+DcwRCjaMBJOAWzE2WNJbsMWLYeAGpK2a+nh549PqeNEz/Z3TC/PPzCYyAOMLVXiW/yc
mTQF4aP10zBzh0LYEfKyEU/CweeyE2qs35n+WQ6co/PNEKFV0aPAYhTS7eUeaoKceEFT2+DyBB8E
y/LeDXJiB4M1vrqzacaW9cDK1/ZG9qQt9cECwfQddLMPDbth0+9TT3kjysflIV/WzxUzXcI4zrkK
X17FaGxLKFAsP+1Bd7qiEI6Ruqw2M4UAmSNqUvnHfOGDscOp0PwpGh/bcvAT1TDxoqA7qrAmxrp7
u1vvy7JYUg73KwO5Pcn6hKaLobJJZybTCwAom7emgMAJDn6RdbiVS6aHPJUC47n3ZRJMng+KPyuF
Y8tcFkbPu0NLQpzUp6LVXSoZLJNCNAET2/lErq8ue7a4b602+9BttDBHBl1O3h8mxeMr4PI6szxv
JWUwBMTR99kUoby5WIObCX5hvAllMfLLQlmQ5Sup9P+cvW3K37N9no9Oifpwh0H7F1rV0RdYC50b
Rzf4nFswN5qJ+/wPUYpsLO2FLhWBQ/zwalLqNBBZMMIdqLChkeCZwHlrEWqYNkjo0uSqi3Id5Lr8
Qnx9dO/j+PKXgz/NGAGE6098VOUr/XyIpXZe7pybBgReAWTdejgghCughAdj6SUqs/O8azqu89P7
UZXXfAo1T1mw6dgqNPp1z9MZ+2RaXj74GldTy9Tx/Cs+HPcwGriwJ3WpGCr/55WAj4YHzy8gkxM9
OuvFzGnmevAha/bROf+NGeM3TY4U4/T0EKhGJ6fHaymEnVSvmJclu3omIL5k3YnsKdv99uxHFwH+
QbZZ8cSf+eQ2gGjHN7+ExUtVoS7/KcLOL+0Fik9aQHtvq8SXiSN0qGekkHD+5/1WO6ha66vlY4Ms
rX/8EvDX1uvgd2Zf28MiH7VBXvOgC0W3kdXrF5c5aBXPpYVJd4HJ36YF7c7EYTeZsrYMA/SO0kT+
5eM4WA9bb+sKX8CRR6cRRw2icxukhyPwLHX7WVjccrde7qTbQbFN7ey/sCXXlqO6Cwoq1S9ZK5l+
9Flzhddv/n5OI24uwBg9GY/FfWJsLVUjqYkSAN9CRpTdd7jSYo3FJG44UVwSmnG7BkDe+d7TppPm
KxyG6k8SeivdHjGhAr4WV0Tqgulgi2yyHDVlNw3vvRWWJ9EeT5RcCUN2SPDRqGobYxpZA1HLgGsJ
GQ40mRh/6kCLnmTD2zxerpmIoM1nnqyYXY91OjUkFpjRQI6mXaiEQlH7c7pPLwtFG+kVCxBgCG5D
86B2tpqe+tX8eWaXD6CgNyXb1Mp0Ma4KfLLkHlpk+y37CCEHFfTt3N/fLoaoyWQ1gRrs5Ie4rOdE
GoGpU+pqlYfFfAYtSNP6CsGp5m2JPXddr4nFnFpIu9ZAq11zvJqaehgAM20VjEuIu0shkX1NTskx
5o8cSCixHeg8kIs+NFnhg5kFbJ2zqsKD3E9/76BV7u5gF6HGMOcUCFUSWrJ6ZepRPj8f2SO6cCA9
bExAYm6g/oXhzoQyKFULiP6cPgAWYXTJP0LL7B4ad98XGsEFyOS3/sjyYCraywug6tp422uMlxAu
G8Afjfh6R1CRydVfjjacMrAymu500eWtVTtNI+Kl7AS5MruuqLKQfpjx2kgnNz521GLN/eKvef1T
san/ew/EwX38FwiF/V/VXFcp4X+FG/EuId+V+wnTjYKzEifzk3haxbdkO2L7ibCDPiehYynSHFls
xAfkoHZCDTN+F3NEcheuG/Rf/HCiAtdlrhHx3e3nGY+h2UITF9qspNEuXwY12R0VJu0BDuA9YReF
1+RmxL2w4scGHBrlyWVB2WbgygwwT6m2C4mhIY7B4FI5Mt/7/9XoVAcslwpIR6fY381ROvIUhEKI
/ernnbFa/pVSb5MAC0m3hCOUaYajdjGebZcEJuh4JFlks9vHEenu9AZs67cJmZDVuBdNRnB6AqB/
L3Kcu5T9lTfvIHWYkXOCHgZuox3ILEfSo7+NF+Grq1ucMUiVY4zxS1/RWiRZOz0PFJm1e/zF+oAx
aq/jRwidqpkkA3J2dmm4pD5gVquElp2igZsaNFm2oQD1VBXIX79OmKgVJm/vbhDx8S3yttL9BD8i
foM9m+AZKghiuDE8Y20CD0WH/8LH8ds+82/tHDhShvr4KM+gL7IuyMx95JOeDrXXMPDsCovwzYEN
U5Jh5XZoeIdSpb3syOL6eNB4c0fdnkOwkRr6YGPW/SKm62OPVE+wmjNtDBVZuRmDV2HTbnkn7hl6
jaNgT3I6trOPNSuKdN18T3Eni7zbavLYzbpO9B20pICKGTHLtD594gQU7eL3niAcANkwdsWgLc9Y
pmbZdVYAk0iE00ijPqXDVG7Z3d08Ybvq3PK3SZqHX2NMVxkj72CkpyOfx4Msz+UNWTY98S8CuvfO
oAf9vEa/Gvqf7BopjYNVcOxsAN6y4N5M2kyIoNiA5ncCcMklUNzI9p9vBqoNFG6/PtQ8WLSjAO21
PkgrV9xmJFXBUdAYPxQxs+Ky8b+S0URG2h98xelgWw3wVs1up1P9Bvj59RTl211BqEbn3bJPmxgd
OuC3Hvxwjv/XVNlTYvVoISYQs9eohMJyvRktcdrdQ60E5vUrNvLgqytN8PdmsvEDXGt51yMq0P6N
8drTeajzOcF0XsKqqtoaoIEAPFxrLf1m07oV+waZvTnl7N+1INWwSCNrrrRznNy8Ap8KFANKugFt
kkcnpvwpR/jpS/NoJNg0OmA1Za0cZTIK08ZXawYSlZU393YLCO2qBszRLiCPxcrdO3gfKQRrpRsu
bgRhDJSLSEAZ6HGeXblIhJ02XfCjeRuTiozXy6dtVkHjhP7eXnep4o1SsvImSKr11i11rG/GNnwi
iQiwdz8ftJw/8y3xfVMoWxRMCC6co/TlyDyg+BiMv1iRWJY4ob8FjGfFcr4K5uz0Vyv/kDDuR/iT
lr9UQe3pq8lNq3HFdLAEUB9S76OBkFSPG8KA6J3t9SrZ4BhjjHvI84CUvUvCOZPSe476TYyW4sIQ
fJfMhvnzoI93EUkHAhwgrt3CCiyCcNq23sdjC1u2jypZq635KwZ7Giyg9f+LoLi6+fmmW87ND6MY
WesFDPnmVqrhJNGREcwVUTfaGmMJEiaM2c2tgy1Y8D3TEsBWu9bGmzQA90AZw0rF/XaDriSuaIQs
vm1SQGwVesNaJkoZ3KGWVLG8O1vUPdLlG18Jb90/KcL5oajEKpLQW6oPJgvABlTEeuvOMkwBZutM
cq2Ofa5fUeojfE0X2y0gsF3xI4Gtg34EoxlPFaSabHU0MfYi5JKlI/3yFqrLipUk4dmhizXIGo2N
WOddqDb45V1gQq/9Ppk3mWz15+elj5FQVDfytDKc4NTbcdsBJ/3Dw4lAwEdR9yQ4kB2BXfuHcQ8t
/mnDA9+ToUP7m7oMxfQ+qekFG7+5/rWzRyPuvRNaUb6bRiY8SFv01ufFypB6wRF6Ph8itl+tjnk4
JNjLNzzsPukBRO1TDf1YpWn0iiOVOTZKZlM6772YvISm1fSai2R5EDl4/M37dv3osEj8SKycY1QZ
xFhzl5TXHV3tk7myd6fzKTiOo8cuvPU2Q60Q/BylQpx+A9pxbl0Wk1ZjDnQeeC9t/TNoX7syi44R
U7dC9aAdKczAeANo1vhikK+KxSra8jNBKuisrHLH8hO7NeJ0CAMnaPCJz0EdNWv6xUl00gazwRy3
eYrRiH1OXgQYa+j59PlnY19litTHBrgJkNbS+gsfRFJyGCLJAT2GE7m3fzje2Qms6ZiTvb8x9GmF
Ag1nZd/9DYvBxlY/s4OsCEgI7Zi29DuOjniVPylQimXPUiusWXnMADYv0hdq0ZymUDuvL47p8tcT
rATcWtXW3RZ9chsEd2nXuMd/JQHodlSLJ/FfKNSskQ8ZOQIfRrFLULkmliiC5MTkxYVxFBcjVB/V
r3VxRCfr2TB1rS8N4HnVXif5xgIsh7Rauy1/WVdpky2r/0h8eC0RS+tNqSYoCx2wWJHWhA7rUaHM
QmirYRLWY518JwjitIrIn7vA9Bn1OZWSOWIpUfkxfbouMtKytFiunCcVr/f5LIDNZafBAsqIQWqW
bj//OO99PVNh7x7IrgPz9BbBwk1A77eqeikEJH3mWBFHyd0BtUiz2+rtYrR37p/GXYlGYrgpYMQd
JgTfD9rKwFyj1UngReT8c+uuEi8qVKjnMXiG5aCIVaFtG42TubQEe31ruOrVJ4/sQjSbZuivTtEa
88OijYrSedWa4goi4aKQaX2NTWhb/YEFbNpUTCJbfZpDgLoWoyZvDqSRI5lWEeSHK8+Qpx3w19Yh
JQj3H8eePwIxHT/5GlSUTcQ/Dim//MTbvbCZz0KkINxcVKmSIEEjO88CdNwngA3a26UeBZzr4zZO
RFmGC+oTU6T+RuREnlDTts75KMLZj1E6SwE+dLoqcgAf7RYgKSZ8PT5M4ZusVqxT7TfVlDqROxG0
n0BcaCHccrAFFoVOsoCBRqTJepBh9L0sGkUYUMX7xqVzvXsW3NPBJdFTmA//mAzxOerUXJ5jnqMK
4mKz21L63AHEg4Up7MIZi0Ru+afHLyFWGwdtYPvohLRppb6B7tP4c2DTDLVDJZBfdKJkHW+31BDz
ENMY28+4PL/2I3zIrsUozSo0RanyXW3T+tvIxsiPZcGvWFS2lb9D1IGSGjJ1CGT1DIUo7TPfbGml
DmiHKtZEbPiTsj3d51xMJ/5kBJzDD5/FHyTQfVILSfip3pluUh9YA2wtlfZKmLzQXc1KhnYuaE0c
f2Plxfk3Sudt//3NYnkgRVMVDcdyQ2C3JDm4iuSr+jw7ZqlqRWyy/vuOGpyASFNW3LHhK4y4Rl//
3bal98np/BuK8gFKjOzj97b8JjkN1ijzdWvZmQS0A4/Bkw+HW8aTodtl9ud1wVUmI1Zqimibif9r
hof7nBmqrAtwACBEwwoq84UNR1R+q4TmumbtN0oSQ6forqpjtkqJaNfoUSjMzbXCJOu1cVo2SWnk
koXq8ZbteRSvwZn0U4DnCP5I2VbUsqEk7AQlk3+b3J8A+lbqHT6VH/I++NMP+8sLCVkvU+mBmTnJ
+IvJUJIczqgEXHy2N86eg9o+AtH/yMtR7n4iOiXnuwfiNGyxdF6anRjAmZ9WENeC1jZjpxAYTN30
gUqhoQhShz1sEduMlG7v1dhPyOE4qokB335lZ25Y4naRLS4XTxjmzaum7YpjJLnoZ1nsPJVa1QQt
83I7SMstlOhiVbhpwdlhUFbR+WfnUM6S5RJ+NszFIOQcpR1KJuWeGzgBdUbw7GJv20HC1lEGozhR
8El7nEPRs/DGIsCCLu86aihdIBQKZYo9F1grNy7RjzhOWbyDEZNkUgv5mOjlLvLPppYDzo5pogFw
EMUGPVUaCtymXEJQmAEhV6y8oc9iRp7i38qBMPZhXVBx71Pk03In+e2iNcnif7+FtvDcLuO8QDOn
E8ttGx7A/7sJKVee4ujummcRr61SqZxV7q+K6DeMwuAIYov6EHyG37gFf1wL+CvSWRc6pRk8qcz2
dWKuFYr137PnI+JOwPD/eqA/255r9K3ZlJ/iOqIJPxju0gFNd3VKhsDkr1zzeYWfem46xLoCdTti
S4rdVh9iLNCU2OB6c7VbS/DVmYLklGTQrtG7nStZfeOdFLUjQpppy8NT8RsJIEEVgPsAK0oMNH1V
bOhDt21ms83UjdYpQKkA6RjQrvgGnpvl2mSMRQZaCva4PblN0QxSfqn5TvJceHzvX1wlJkcKf8L9
ZAN8/JfGRh/3rSXMQrreSNzkuUFbDknS4fNO125hbRYZCSV+0/up7UOuzAP2B0vWiCKJMN6BbDnx
zXl5/4DGdiYsk5cOx2IbBMGqXA0p4ndppHZEX+zJT3rTK5FIkcKUcNBszPMfKRKDpxd1V2Rm74PL
vg+TNoMvYoi70GG2T3kTFwS13oAJJdIXOFP8a1WxJKy2WtAjjH+irhVAGjMytIuuIUTWkdhSOeWy
WVT2CtQH1xbqSfzlcYPa0G/xEneiODxn7HNNw7Te82/Jcfu2PilUvpg9ltb8QRnbLRUVVDjAnjY5
Fckb2vbbElY5ouVcrWDMKscFIPOi4AchgCuSQz9At3Nrn++pTm7blZdVXcSAX8vZzgx6K6F5Rvu6
tQiK1nRe0uR7j3pT+iddbvK+NiknflIkVu6gByMgwtiBm6Hd7dNXOF3WYuFf+d65rPDd0IvXAm2J
kxzDs92ExKSKpBoggFw2LpMmSI/hLqhPIuSuRfcQBXbcFqV/a0DeQtIb8cAVGmuaRx4NyFcZ1sj3
f1u90dC1myfzPla1cstAtul5Qbr7n3ECZ/xVLOJDXs2bgLWVtaBVezyg8COfON5N8N0CitmsHUxV
eaA3kzOOG8CflmuVP5k/oBeApgcXsD20njhAvxYix6FSujd7QJ6EkNDEC/0P99JSGuKbSt56Ts8O
2SPMabSupCzWAVHXsPsCOgCvn1ASaGBMyUJFZ68u52QMYkW/ZCICBU9GWtR+6n3gc6stSjP8NKpn
5naSIF83Y4wOAzGBpJlxXK1gHynAlR/Zeld7EZE2wBDzXdCmJTAWpAPc6RRVHyxFVNgURnIYvPi5
nkIQv5ZqaoIQJ+WrzROSXuuA+aPl7PA7M47sS4/LVnxaA8L3MhdS5Pr6m7EZQY/z67Lhls4oc8gG
r4N0ZGHAFOcVh5rDujkIKt7BAgQRjMqc4la5GqOp9r+xW6FQgYRJ/mpTsPn0TPSO7wPJIZV7/UFG
Yui+5J2kboDe00lvYZJHwd9h9Iibyv6oJG5qbP/VdRoQ3OkYeql0JEvXBh1CQtMzXtXeLlG9b9bK
qePZmEuD1lRnh4IQkGSfCv8Lkwyh/KtOgAC2NJ2l0qNRJsIBXzCaCgXmQSfcalFUtBC8Zg+K9+5o
mKl7VkkL7kP6+u9WiamPBic2+cKPwYxIhZ1uqT10X3qtXsMTv+TzTgJAthBnQ+oxCbKDeTo+Kxn4
S91tjkRUX0KvNtqYI8E5FPSQM5/5T0NiKPPH3I92qAWa3lAp44sbxqd7Ye2AByyarkURbzfglnbO
4hLya7t1mTdUkszat0al4cHKaQEAi93F8dxZ4/zZLBYyXdHI0gi4Uqf72BlZOU2sWUFLB5GLZtve
91BcFbtyCrPaliNbT86Vij7BSIqTl8DsAzkxdbdanukzyiQ/aeS4MU73vdeGliaY05EzsQtCXEzI
j7xWe45deBzcJa9nVwxzQi2sqJzZRKgQcuC2ZMmSL2fiYEoXa5ejkf113JyizSjeE9Z/fCsBniXG
E0pwcvd056KJogACHJYW0fLZc2eCBDori/2mwiotb6hhP0ieoiJwhtzQGyCk8ouhuHelrMgsFXKX
yi8phRicfGUN/x8a1kGtwNcJ1I/Creqt3JM9SfDRdVCzmZ1b8MIIt13hqYVxbYee3kTpZeDuvO/i
WXKQfsrU+4uSiTxzPnZ4wC2Wj3QUz4LVP4VU4zvuISFYud12h9E4f5LQ41tGI1Bf6b3eViAEe0s9
QfHqrucBI+cNGX8PnK1v8CQuJrJXCZhaYNR7/eDtAqYjwWNaR3sqbyKEAgSKctTBjrzJzZl5KhtY
WrAkamXd+P701jqEx5n9QLE14reRT3wQPwwbaTb3kXU3Dfx7W84UUK1vohCJQUCHJGU/TgWtvwDQ
lz7c6oVXM0gqG+QmoZbivcxabGoCZIsinNCpo9rieTFDrPR7ThjO36A4lzWdzmin3KJtzcu3WeDz
qm1VqwDrIGV4O+YyC5uWlpxPPE7c3Hhj7qcXIGDiHqyaQErotwptQbkZDrV2g26PCjZqWpW1Bcxp
pOXeYi4yMgyH55t8YRganX71vejc9nxpUPwVSi8wluwrY44Nl4U51b/31OHD5F1dVjeH6nnOvhTM
o5X/0TdwIQhtjwnKcs02diWWic2b6FikYhadLC59Bovrw2vB7iCVog4cb/uCR8nwMQ2okc79EOZZ
USVLDtwZgAZzXEeM2Pv7HJMvS7TmrtfawrtaKVJJryBFG/UkyD1ztJngfxNwsyEfHjE8sUDDeJHy
rX5eeXiQftFIFndRfy7oxH4TamkQ9hk8zSMuV+GTW9Jxtcta0lxJszQzlhz1PtDP0dogRgy0lD0M
DYdDoFyelKcnpINjoUTuyLvz92UvcGZ18YZbMS59LAYlbOvZWIXvpEGA+7/3gewC2CRZMrwuxdVL
awyNZJ9GihLeZztCkwHOMw/oJGKSPArsxzaZp6oculOk5UdQA79nutv7tk1jRn5JUXgf5H5N9Ym1
QdbR5+tLI4xsbxQyj65gRw/H3OjcKcLM5TFBhoKHNNJbkRWU5qVOJ4miDga5yjT+T1ZA01x1IN6p
qyvcL+3HpgyP1RJZkiU3JRFkrGrSqdiXK4zWrOxleb0ZnkUakZaE853QCgaqERNh+VObdA9XPT2z
KwEcn9BEIFFZ7Fb81c47RS6lHKR8kPbMD67beuwxMcqSLWTy/ZsnGPZ2uguGq7QgSBSv4uvHtHlB
ncCKYxL3wDPjJkTjKD7SBht746p3Nq6n9vq+gnubMLLu2gZBXA4GuHWlMye3c0+q8W5HH0+gA2tb
mota9v5QprfgMN/FUksuAz1sW6526sbDBpa3QFgk2vJkh+hLb/axFxO6sU5LOLO+sW/diGBFK7Zr
FSwXVWpEvBr1IUe7k9BBEdmxlBP9Yo6icb1T9v0ZnDpKQD7tGPLOi4EXq7mptl4KNMOtfvK5Spou
TAPhTFrVvaFwTtb4Ak6fjSZ2FE87v8kY/MEg/ylq4pBIkTnpC+FbWQgC66TTYhrKqPiJIQFLtKPI
bheUQWJMdSjlsxKRyGqmokO0Sr+tcVoXqlHq68eX32PnLpxPH2XNP4eR5xlSz6whSCMnbIAwDlM1
TKtKZ5rjaAfHh/reAKAKGGqZuXnblwWijas2wCNA2+fYgqQHHCCDVTtES3KNq1EjXX2+So8O5/u4
cg8ZxDzNXqgrTiQDXGNNgDEfb10tuYddCQCTqPelh8FlvR0k+yDiIeuXkhOrn0QXDBI7D/ZVNOXg
mUu/mhVy+izZqMK1gT952mqyoi+6ccwxW7iggmXljMNgLUF+40fpMedcZF1rBcQJ8yJjE46kl/R7
f+0fJzNs4aj3du+PnsNZHInSV/yYgjxLGBpWWRLXVIva2FJWW/FNUbpNCh7usFEwWkfr3uMR3W+U
TLU3A6lLHSPwiO/vkXO2YA59+ULQB6zi1e4qrbw0QeMbhS9IA0nzvQLMztsKP4t6jyZqzKr39NiD
HJKpzX9hJUSIy/6Ng7DF94Ua6pyTnE0iaWgK5o+6jDNLf79nf4QvCRbNCenOqV3knaI0I5ULOTD+
49npbYXHaTw5poSZOuGXB+SMQf3t0q42Mlnmcpqf62FdkTQui4tviZc50tcLjaKJ4jCLXM5koDz7
OJ+gzEXHnDdf5BsaQk1/tiKNCHfUR+nI6cEsoLvYWtJYX1PwxyxrACuNRNt9LL/bmAfD1JUhB78L
qyOK9WM5iTW6ElP/lXTHivb803GmBQuZPcX4poNWwu8l640PQGRadxWjLYM/ViE0d2r6C2Qv8VtN
Wa1JX2BwgTkAq6rO5jAXRfNv5fEI7C+WwvAgsRTQf/ORRwI7L2tATSdYHsJ6uWLB0rUI86cHqHt0
9X9/1QpvU+4z7puWLMN0m4FsPL1j3ofcvTioITFDVmYAurdGuw9ACaubhnDCYU9Ty2NcWmlopQNf
VxJXQ43MZ+MLVhfSPBvfhAtDhUIyxmf9QpM6TsGKpTKL1iy/3Sv+Xbpqq1IVwumsa/mvi+uofHOT
0y5MHCGpoPUqjexvaWYVa+HlG3BtyFTOVXUnD+Vri2Kz+eMtoGt/Q/ucVkYlPDLO6wX31qLObd3N
l+to7q249Gqgr5mnkBZwx7GbFFizBqo5xuWqH+h4c3M3Fe1NvWWbxrcdMvrqV9gIBCLa3esX7fuw
Q55LYBjGUWEIB23fUtdY65veMiUbUhYRNqL1XY+f9azmbOUhBsdS820b66CwglKYGdiZB6mmSeS1
hSml4nQh00cds6kbYcxT/V5sKRWOwsz2DT3AccRCfGVBHkWEAyeYcFvsdFilHLkQ70guIcZo11Px
EZeQx3Id4EaqfqTTzX9T0VyzGkioIixtEZ+nscuYhRkZHRFiIQOg5M5axN1FedLVwSDVSb+Tqw8L
DSIvC0KEEJJCAwLEB3WJmr+ZZ0OqZ9PnJ2lda2S9QcdmHgn3ifFXxwbV6vClJwMA0hCO4cRAAJSE
YSthArAdpWOUvDkSiYQ6svcxCB7KhaDlWvsVbGXzWVEylzRPqSFQFhj2ykVmJ0Rck1HdclbKUWrt
Ofv8o9+P+xEPHuuzoDMCOGpp2eUUXDIKbYVM2CUczbsOS5R6NkiY3NQaLvqF4gTFYdOmDbUWEsZi
yXxAhnDAnjTyq+T0wF2m6C4eLjvDfmpulXg7cHSdQuV3VFw7U/pElUECZmBJnX8h0JVFr0lHUu3W
kNXeLL79y/vErfbd8mSGhiStUBedEpdn/4DVLrB2xwoK0oxYy8C/oOHj0Kx0NT2W59b2ENIMZXXX
lXYpUvskybFR4RuyHbcMUyx9huMLQrSwGlItZX+Klw4oeGytfXbXv7G3of6IVT2SD5bEH5UWslWm
IiAzqx0RKPeuGyXw4my+G2wLwKAwM99tt2hRpW/20TYCM72xqTBnYc8bI4QGiPtpL5245sFbB5LJ
noSc1Z5H7TKsTWogmlc7szsT7tgu54O9rrnCWq5Fe5U/OUNq6iLQ6nq0YBxCiZDpMviuorDYoO5m
xezx7Uc36CJII2IXzSaCrcVbNK52fsUht2mc8ysVQ2iB20ufKA/zy1PVUzxKgpdfKq1wBHdWZmzC
sqMdB74C7JZvSeSGuJAL6HvnBlEgU3d/4YC9Ty+5sxW1vhf5etSAVwPm5i4eY5W609zMKIN+LtJC
TBDlFweL1QZWoxYTNh13hev7IVP00g/FWkIALvVKRmgL89PITiy1xMj1qIdwEt0u4KMrTIPwhpw2
2g1h0BKycMiFfYgJI3uRgyqkEGNKAvULUfEhvdK+hbuGpNvP4GdNobPprwvTNrUgtAgON/HZzg0y
26WxcI1bF3Qdh5FRpmebJAimyLMYsE6qIFTFhA+SURPa18JWut7xAswtiQADu4naqUSlR+x9j5pg
Mb54BZ6dfM1Rgh2KBvECu+2bORH0DFThj0bQ5wXiQkdorQftUPaYZQnA7qNgcJ5QyJ/t6t4IZ2R6
FCHj66Ym+KrsiLqq4Q736vFJIfCco2+q/40ZEIf44enMZ9raEVzawGFV7RzyJ+tEcGh1GfAi85jG
l22f1FsDPIKEfSOrPD+24IL4RRUMzbmDis0ErZp+F6bWcXRf6raLHxHXQXp6tLSy1/YRbe2StFdj
lAhxaYae33KNwHKT6JWw+2EIPU/8HFSeRP1UJ8Y9I8y9pz+ZtjNJX3clkfN7Hxzjat6HS3PBpmpW
9ZvVXll1yj+Lbt+ngCKCfnvecL1uYmO/lwqwczC5ViJa7dhFavc5UOIEfSJxv2OjHANg5vC+9++z
b56cKGk5d2FX1OfZwOFy4aziCoLW/DKZa3EGZavjPALUsXuj11KuoxbJ3Z9YZsHOD7P3FojwXFVh
5Mu+lItnFm/lk52KvFzeW/MVAZCKITJYL+KUXwgbTF2wCpW1GhwMFE/3FjV4pGOKaI+PFNzUvHFt
Rb7OaWmWVdhX5myzegc/hnrLN3TSOxqR5KdaMFwBqWIkjXBZ/0HMwc9I4MoheoXMelX9N5KF+LVZ
qw01qUgNg9/wL2dye3Jt/2+1XuNqA42lLJkKT2URAa2KfH7i7xQZ/gG018Fh1ghtwRyHNfhS+3LO
pAjB3vp3Pic0bnU9cnwsyjc4Kk3UHH8bY3WoEee3hXTMwlJda3afWFluUAdRd8Ta9awZXinf0DWf
JCZmdqh/4zTOjSxZew0DnBXCSdejhvrkvj7bIh4WqSLWPRTV98CiKK6g8K4RsD9aCtevDT3U12uL
jknOeuDyZcBkYYRXTVQMQxzoMGsWGJxwRSAaJ/YDGrTQVlr4/VyKaKXKltf5iNXRWOVNezM8Ce/o
hgQb3z6muIbKVQC5GEhYQCzk0fBPQJ2ZS9GzXbyv/GvoFTgzfbsOQmuTj//XGKUQmCShqavDE9Mi
piOE4tZOWIjn0g41+5WoY+e0W6LZ3flxHgJc6z6uVhlt0p5fioHGjMOQYm/KoEmCbVvGdK59mLjl
x7Yzg0yGlZN1jqaSzv+qo73s8/0SjJQXDmrkl38GXb/iVQzmQmftU2RFc0BvTGLMskzDM0M/JdWF
z1sZzpU9xIYinVmIIMZn072xIuIDFckPUh4nFJhn02s5WOQcocdCRGgxAYxNKs9UL8xfydKfILr4
ffeLawGjJEWakzAD3gaK5eWemvNtMMSn69X5V1o6lL6etmlp/0qDhLoJOJ6uiRpDzVg2ygsBDnck
uA5qVs3F005na9RZk2T02zGLRsWKJwHDTNGXb3hLv29LMhnEyFbd1D++++LdYXJGKDYCf+jLb0dN
vihiSqelSHfFrFn4k5RnUCj4/+t3TJZHodtZzQmBj3PQZs+oKr46HIwpJZyKCWz2M7Euz6pMqb73
1nr4t9uCiAuY9frENO/khn8+KP+ILBUUtpTDahtcnxGdNpJ5oUfCcAzBwDEI9FEPI/rpP1q61v/H
IPIuj5eF78RUNCwvkW2+119wIPuGC+yx3+E6f7kSE4moudOzevTpLAnkrSZ04dPGlDFkW2HxZc8K
/oNuQZOYNHUmvt8cHbw6USUZPbGx07SA6cHEtFbaBwAqXj+2AAIpdeYGJpGa6Zw9XdeJPFwzX+Il
UMbgHU9PtCSNIiSAk5MC9YFjGH+bj0YWpSIdJ9LmSfloQoWSOYqi1kDcPsbOsENKWridqFZKYWww
UUrvlCLQt4zrgZ2suNcCtWpvJb+PCvfukC/f5fqmT6x6yZya9Cxc1NkBI9ldcpZSdoxFCv3vbo7h
IlpM2eiIE10rFtltQaunRe3g9ZdbIgPPTwP5FcHlc3s5wBIzaJ8pHLkxTmXOJFYy7kxbPFQcTJYQ
Jn+PJMh6qypmhwPT0PwUh0hypvHWgsBjOa+pNgFQrWwKJfzsR3gpKeo2AVYMv6eQX9LkR6pBVJp0
XxWbGNMi+WyUi/13ZRAXJBoq/VJSThG4+Lh25jG/30ICEBpRXS6J0Kq0BbrRX9d9Qihio+rQjrBX
W8LP8hufQQ5a4AlDXDUSh89pX0PdaaRl4/TnFRMvp+ddlQjrbU+aLhaB+bksXKiFeb8vd3asxNiT
aN4v6qToQ69jdZng4SkjfytpCx7piYiLhYHqFgRTqAnsMb+R21Nh5k/hZd8rWf8E0koMMV7IIR1C
zPz5hHyCS1y/+NqJPj3VjVMQFOQOarIjMkJX8QZeJ82LYnxOvpvsPlzEnJ6IKwBWGL9P9pMwJExE
1X2SrkkUXw9xhbAmM/l8lx+WK0//lcmgf+YMO5ZkdUui3BEdqLfQeTrVovJiEw2VOS/Fldh63Axo
TAv9ZuKMNbzeptsQjcN5rhFzqYgKMbQVVyN9ui1mA2xTJahyHbbF/iOs3SdaB3jk5+4GiIWYQnQT
mFxpnVZjIKB0KSdOyN5El2hkd5NntTuDwG9qn9C6BThyaTqKhXoh7haoaRuVT8iYsmhO3d5WKvdg
zZN9qdH8wxF9hhS/Bs5PcESxlWaCGRyfsPhIJUefdtzJVhcXovyHmAbqGsq+taGBiZgUCIUHd40l
HAaCXfTCsnl2SfLshp/rJLNGUvAB9IglUtBsGp3GO4zodJBOQoiu21Mzs0JQGU3vSCNi8vFLXjlN
4PWV6b+NkhPu9Wna9CZEhn4N3WdjRDSfsRAAOPYc0hkzWAY4a156gZ491u+YJyygzUUlatUZvGk1
1tUIu2oHXKDGC/wHNqlVwcEAKgmLGtpKCP8ctHTORT+RtH8L+U1qcTMl3VzlwJ0waAndzkgsdo1h
qbO3l3h91Q/OBVlQXEUFJdhgrp0SM2Zfnh2FapL85QJc7WNi3ZbX7UmcIJzDHZOmC7YPkJ8wIuv8
A72mE48jCGHLCwu2bw0StVyMTXmgKkTbotukVboSHJTh1u67Yev+TDGE7FA9jUcuOACirlHQqlcs
KKQDMgCYzA+vfVk2oMKcJoRuTK1ZUQbzS5d+/Cjbwala9l+fRVndOkLoVqDHhXqwDQmrd1N3AIBL
36U6Wy8oGjKtFtjPkYdiac3m8cYaf40w90OGE80l3M+6Zb3fSrJ139d1GI8AfubPbayHjOTNA2UO
tn8Rt9PYAPV9BtsmCXRvbbGuwv7w720FO+YutZPFioPJkYmoUgqJF46djEYDQJ2PzXq/9P3ykbOh
D7x0UMPd73n4cAh8FMgZJp3RXu+aNXuQeirJ4eblJIi83Iyv0PeG60zc1V7ucYJq6HJz6Be6rGhm
4PX3vsupSWcCQsZJl1F+c14FLOFWPxwfTrkd0gAnKYF3q8Kq8wAetcL8AGX9t4dEGOsNaGzwhmnx
R0hH/o3QPVZ7YMDvcAQOx1m3ifeGwCrZTaC5DsAu0td1usUY4ikfTaX/jxztW6pZiHEgVYIpIupc
7ySx0Ah/ynrHuueqcCfxLWxXvXII///dFbwdyZ9EskZFcsXYCgKPGTv3L3YVbtao+XHWfDr6crbV
W2Nx5dVaVZrlE/EREQNGPHf18zPKWBmoMy7/VD1HtVH8cIKOdCC8/tBhVmxgPRdtdywekOCzWQso
SABS24DxIUqfBhsMkdEt4rOUjflK/LFPpmx7k1XlaT07afsQKTrEYHEtPwkX2WPzRwjn2L9qKv0m
HlGirlYo/Vd3ijZ74DkWHzwGTS7ovsfRrSJhVCJwCrTfZqijJvreZD4UTIuIjo8gu179pG00hR4F
yNtDfHdOIMH0ex80b2SNcW5n03UOwvTIZclVAcbUCgmso5k0BMK2hUwAFyuwE51L9/IUbqL5YK/2
Al+fFP2zAQoe611PlGOFkaH43DwS2EzCwN8/S98ZOgOBuTSTWo8A7eDg/sIooOZd9Zp4SgDarBKn
WfMXpBd3W7tCTc9y44I03xEvtzGPuIFzadHqC95b7JftFkkdj3V0CAYvUYRtqT4F/98r/VjoKjt9
PynOiRVkWvVxRCs+Uif3QPBCUkhPGAT/El4VE89N/2M7E+duq7Hm/J0nsAGVP8hnyupYKhXyfqGx
wmHX2keJ6LOivnYqZ9kXQy61hc2B3lt3k4D6h24t7tv7j4lPmVmgK8NC8TWV8VHoZAcCFBi+YtXq
BJ1cJqIq7VErXj+7KAuh54V3zT9nbGzePnG/8fl/oe7MafvS2X9S3m/9IHagZnjgVFQ3G8zYt5cp
yJg8227Pyueb/wxYyWl31oQ5/YfIejH3VUZnPrmOwVrlUMezOnrX525mGXNqTUdVWyvs33HZPH2K
ectAfotBTICDwd3E2lGNKfLuA5M6Y0mB1SjyfdVbQPWZ350Kf8iC0yoefsQI17Yn08LEVv6Xkto2
fBQn9CNsTwtyXQClNczQcUUiJNe4zBLby4nC/n+2/Lu6hA63lEBlQBFPgMrT7RfTimUM3GDi1HjY
HT6Wq50Wy2TOBvUCDsymwzzHB3fIxZkJsFYOFrgpA3PXNtVa0Ylcx6LpX6rbb0a8T5vjZxuQCJJj
xDIT3Jt5gxGMYF0BjD7P4aIfvKsRB1EUNl8xtBzWMo+avsD+3+FSkNneDL3Mfz8Ct80piLLzih1E
uqbPHVaG9Khh5IZvxOWp6erLmLfz7hEPWHCN0FMg0/riFa1ZQlsNpq6+gvjr7/q29TzaHdUeFSJt
ZS12KSSOxf4sSGf5EZIu+B8S2PAO4eprlIhe3q5RNUnyBbqZHC6Ivxs+zDb5AiW0xvJJFry3igvD
4Y1lG8tt9zG2YwN0dByz1+pb77ac1ugmdrH0jdHdO0K5JhxDP5SOmyl0T4qCYrr37LanN6RmYaUw
DNCSrOTu2n7aeFa7XD3QwODI2iDGVr6wmslxJvmnG8wk9pk5opqDJ/qLPwy3EMHoSl9LXsKu9siq
/xRxAF+Nn5be+fWBX0J2pmTM5StwLvgK1fgmGDP8vgQrA6Z05XfE+EhkwppSzcsKT0cfkSGShMKd
3wR0Ajts919S8oe0IntcjgDHEo6/tDpAyiEfw0Ow/9cR8lk2O3lXZNv2oyUSvoH7DQeWwVjJes+7
Sj2Kz8JzDEhJS4dmJ5V5yEHqsuMvxvuKBeWsCC6EXc3LC7Yrpl2exSPLBEb+PJ1DB+26Vh3Vvgcx
ZKH/B9zz8nZQzN+8+Q5Hs5ZdzFGQGRxmdazIdCPgiu63h4VZQr4i5pEPF3uAzp4Nq+4Z3QN4EJRS
ugqSzXHmxu7pWn7bnjnZaIoUGnU86F4TNdfIoO7xisNZlRSB9jHWkVnoRcTGUmqwxxjIhzu/0hmQ
IA8LtzUSNfnMpm5ZGyWiywxJDOEUd58OkcpHB/olTkhSsbEVJfbhPbN0Qk60xMgN0wcVD+hVq62/
D3tk39N3U7pLXt68Za1Y4lgq8jNnyw6FxgWwcV0yWCLKSwob/om28k1y6vlnMHJYJS31FkafsbYg
y11Ymq2su1lgkgw75zo63DpS0dwGyGI71EdvXfbCF5jNz4Y9AqqzsEH9TzKPmUVgAbzfFGrIVSPM
gUlwZPqKLewfat1zLKShXRPaWJalz8okS0l880xxlm9PH60sAOSOnhZgZ2gc3tTJu2r0R8JG5XUS
280L6nXXHTACmkXwlcMS92N4ssH6kQ4cZLK3MM+NusSVLQ5mr5VJCtOHnb1R3kQJhb/hwX2G1PJD
JgmFVQAzEcfVvOse9fh/fLtXLBvnkox5KA4s0YsQ8nL3j5F1nIYTnQpt58g/bOIubTeHHqtxxYRX
U3msoONjkVDqx87oCHotrIBv3hXj5jG0kwGpJEFdDczsQj0nppTB1iWxJuYTZpPHxgoeO6ySpSDT
ZL/8ZfvBM1wPpEHaDCcmYL5M4iVx0DnZ+S6L3QyJ1o2g+OAT8mUXuBcFaHB5Ngy5RoXIH02PxBtX
bvcrWfN3nPlv/hyYmCDE2RmLhnbIqX2QfKBh/IL/1SlJ9ApXGHZUIScDLJI8hJUvkKX3c1SogKKM
5DOVRunWWN7Xury8ZjLUyByGuClxMVJNzOd7p3SJdlSYbCeqf6+K9W6ib3/nESgEb+bgM9KlLi8M
84PzJvKxVOpaIEkY2uFJz/qPffBZMaST2Em4cZIc9cpgF9BnQm9dM6BkiZZmIywYq/ESGVnP1deO
5MQzZoju9Wl+IWMen5oo1G9YcktSpy4uX1qKxUtBiYIXnvXccjdxwha4ojDW9kHH2BsruFEqZCi8
bp/7Pm/6irZcXk2SGz0GhGKWcca4UZJTPeOLdkydOuT24ifGMdiL0kxesmCLYOGPxVOLIM3clkkT
AwvCfROwkx8AtSGa4GyoyxU3TLXg253AUaXzkp7SBaml3nKNwrROW/p+O6rzH37CQ8uE7zJJ/kxJ
NNpV76taJRKBRc43FN+OqnfX0UwQ7SyJcB6OrqNdBRL6RIIdrVjOcQrX6eb9SH4fsoazkEvvFBLr
KZdLiJLoyQ7PyPXJgflN6LI0wLogNWMMVzAogwQydSa+bZeLNLUQTw2mawl+4Xduu5vz6K//g29h
TU0Ayw0DH2PLlE7K5c+sm7mpRP7gF1zXt45x4uZ3IrwUgq9ceT/y4K6wljBzQkudqqScavnnxrSX
o20N0TrqsxZKGY0EE+dRkaAUb+d8BdQj6a9uhPYZ7ZhG2meEs7td/lesUh6zcsO8tW4FBFykf0ZA
Pkc+JLcUoAM9OudjC8C2w6DaP3148mlU0chNbdI1rbGiI76OgE3ggsVRClhYeFRxalRko5npetPB
9LOaqJSj6AIYlx01nbMVimx4WVO4qWdUNW1j9tyOl2htASVxdGL3jxMfvyU6PvDoAiO25PUZQ3Vz
gSHKpxCqui5ghb7peDSH3axAIOlMk3KfNVf3YmZYIV7nQukUCKzLNgaSh/ViZL0YhoYYOTikS7Un
ludBnz7nL/y9K1iLUzgP8wwwsr50N1JpIC7hzZ4OvWP9w4JBIGshNdzyzJdiANszVKVUM74q6zhR
ea6L4+ndpI+v8OXKIkExCnsKT8uyIV04RKoxZf2frvHLg+qknCsuy1TjTcbs0aC+D5VVLcqiZBJJ
EBu5a+u5Qng7NapKU0PRaOISHPslXS664q44OIqsPJ+kGbQU+r3zLKQAniG/dwUPz7SWuriNem+w
LprpcIE44z3MURcMlQj59yo49cLcDLSCvJDMt5g3jM5SsTJNFT2qJ1SMayuJRzC4YxMgkoEHCCIl
KJDFp6786LVGAir8xOiSe5nkT3aEHX2IenBgUhgHPmnEiu4Ql1VPGJ/YjxjI3epejevuHXc6kzNM
Y6oWlbFFQ5J69n/IZrAszCvTIfq0nKw/MK5oT3ajvBL0ObqIl65OHRxaRHfgjd8yjqXNzaDs38e1
WUBc/gU0RnHvvZrivqJSS2cp9HTvZ84fY08imZw7OxbCCgb5rQsASnRfUNILtPTpn0r96dPXJwEF
JRXFg3cCvGGSMcRafjeDpO85iUiR/9G2WTZn2Ozh2sna9irby+Ua50AXOHqLNjRIrr5bYRd3cOtS
k9ufNSXDSftsVoiS6GbalV6JNWi0yO8FPug=
`protect end_protected
| {
"pile_set_name": "Github"
} |
# include the utils rb file which has extra functionality for the ext theme
dir = File.dirname(__FILE__)
require File.join(dir, 'lib', 'utils.rb')
# register ext4 as a compass framework
Compass::Frameworks.register 'ext4', dir | {
"pile_set_name": "Github"
} |
// STLport configuration file
// It is internal STLport header - DO NOT include it directly
// AS/400 C++ config
# ifdef _REENTRANT
# define _PTHREADS
# endif
# define _STLP_NO_NEW_NEW_HEADER 1
# define _STLP_NO_BOOL
# define _STLP_LIMITED_DEFAULT_TEMPLATES
# define _STLP_HAS_NO_NAMESPACES
# define _STLP_NEED_TYPENAME
# define _STLP_NEED_EXPLICIT
# define _STLP_HAS_NO_EXCEPTIONS
# define _STLP_NO_EXCEPTION_SPEC
# define _STLP_NO_ARROW_OPERATOR
# define _STLP_NO_NEW_STYLE_CASTS
# define _STLP_NEED_MUTABLE
# define _STLP_NO_PARTIAL_SPECIALIZATION_SYNTAX
# define _STLP_NO_BAD_ALLOC
# define _STLP_NO_MEMBER_TEMPLATES
# define _STLP_NO_MEMBER_TEMPLATE_CLASSES
# define _STLP_NO_MEMBER_TEMPLATE_KEYWORD
# define _STLP_NO_QUALIFIED_FRIENDS
# define _STLP_NO_CLASS_PARTIAL_SPECIALIZATION
# define _STLP_NO_FUNCTION_TMPL_PARTIAL_ORDER
# define _STLP_NO_METHOD_SPECIALIZATION
# define _STLP_NO_EXPLICIT_FUNCTION_TMPL_ARGS
// # define _STLP_NO_EXCEPTION_HEADER
# define _STLP_HAS_NO_NEW_C_HEADERS
# define _STLP_STATIC_CONST_INIT_BUG
# define _STLP_THROW_RETURN_BUG
# define _STLP_LINK_TIME_INSTANTIATION
# define _STLP_NO_TEMPLATE_CONVERSIONS
# define _STLP_NON_TYPE_TMPL_PARAM_BUG 1
# define _STLP_TRIVIAL_DESTRUCTOR_BUG 1
# if defined(_LONG_LONG)
# define _STLP_LONG_LONG long long
# endif
# if defined(_PTHREADS)
# define _MULTI_THREADED
# endif
// fbp : to fix __partition() problem
# define _STLP_NONTEMPL_BASE_MATCH_BUG 1
| {
"pile_set_name": "Github"
} |
@bracketMatching
@matchBrackets
@MatchResult
| {
"pile_set_name": "Github"
} |
<!--
~ Copyright 2009-2017. DigitalGlobe, Inc.
~
~ 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.
-->
<assembly xmlns="http://maven.apache.org/plugins/maven-assembly-plugin/assembly/1.1.0">
<id>distribution</id>
<formats>
<format>tar.gz</format>
</formats>
<includeBaseDirectory>false</includeBaseDirectory>
<!-- project jar -->
<files>
<file>
<source>${project.build.directory}/${project.artifactId}-${project.parent.version}.jar</source>
<outputDirectory>/</outputDirectory>
</file>
</files>
<dependencySets>
<!-- 3rd party jars -->
<dependencySet>
<outputDirectory>lib</outputDirectory>
<useProjectArtifact>false</useProjectArtifact>
<unpack>false</unpack>
<scope>runtime</scope>
</dependencySet>
</dependencySets>
</assembly>
| {
"pile_set_name": "Github"
} |
<?xml version="1.0"?>
<ZopeData>
<record id="1" aka="AAAAAAAAAAE=">
<pickle>
<global name="GadgetField" module="Products.ERP5Form.GadgetField"/>
</pickle>
<pickle>
<dictionary>
<item>
<key> <string>id</string> </key>
<value> <string>my_jsplumb_graph</string> </value>
</item>
<item>
<key> <string>message_values</string> </key>
<value>
<dictionary>
<item>
<key> <string>external_validator_failed</string> </key>
<value> <string>The input failed the external validator.</string> </value>
</item>
<item>
<key> <string>required_not_found</string> </key>
<value> <string>Input is required but no input given.</string> </value>
</item>
</dictionary>
</value>
</item>
<item>
<key> <string>overrides</string> </key>
<value>
<dictionary>
<item>
<key> <string>alternate_name</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>css_class</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>default</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>description</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>display_maxwidth</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>display_width</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>editable</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>enabled</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>external_validator</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>extra</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>gadget_url</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>hidden</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>js_sandbox</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>required</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>title</string> </key>
<value> <string></string> </value>
</item>
</dictionary>
</value>
</item>
<item>
<key> <string>tales</string> </key>
<value>
<dictionary>
<item>
<key> <string>alternate_name</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>css_class</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>data_url</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>default</string> </key>
<value>
<persistent> <string encoding="base64">AAAAAAAAAAI=</string> </persistent>
</value>
</item>
<item>
<key> <string>description</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>display_maxwidth</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>display_width</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>editable</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>enabled</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>external_validator</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>extra</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>gadget_url</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>hidden</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>js_sandbox</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>renderjs_extra</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>required</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>title</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>validator_field_id</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>validator_form_id</string> </key>
<value> <string></string> </value>
</item>
</dictionary>
</value>
</item>
<item>
<key> <string>values</string> </key>
<value>
<dictionary>
<item>
<key> <string>alternate_name</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>css_class</string> </key>
<value> <string>page</string> </value>
</item>
<item>
<key> <string>data_url</string> </key>
<value> <int>0</int> </value>
</item>
<item>
<key> <string>default</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>description</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>display_maxwidth</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>display_width</string> </key>
<value> <int>20</int> </value>
</item>
<item>
<key> <string>editable</string> </key>
<value> <int>1</int> </value>
</item>
<item>
<key> <string>enabled</string> </key>
<value> <int>1</int> </value>
</item>
<item>
<key> <string>external_validator</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>extra</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>gadget_url</string> </key>
<value> <string>dream_graph_editor/jsplumb/index.html</string> </value>
</item>
<item>
<key> <string>hidden</string> </key>
<value> <int>0</int> </value>
</item>
<item>
<key> <string>js_sandbox</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>renderjs_extra</string> </key>
<value>
<list/>
</value>
</item>
<item>
<key> <string>required</string> </key>
<value> <int>0</int> </value>
</item>
<item>
<key> <string>title</string> </key>
<value> <string>Graph</string> </value>
</item>
<item>
<key> <string>validator_field_id</string> </key>
<value> <string></string> </value>
</item>
<item>
<key> <string>validator_form_id</string> </key>
<value> <string></string> </value>
</item>
</dictionary>
</value>
</item>
</dictionary>
</pickle>
</record>
<record id="2" aka="AAAAAAAAAAI=">
<pickle>
<global name="TALESMethod" module="Products.Formulator.TALESField"/>
</pickle>
<pickle>
<dictionary>
<item>
<key> <string>_text</string> </key>
<value> <string>context/DCWorkflow_getGraph</string> </value>
</item>
</dictionary>
</pickle>
</record>
</ZopeData>
| {
"pile_set_name": "Github"
} |
.. _net.sf.openfx.MatteMonitorPlugin:
MatteMonitor node
=================
*This documentation is for version 1.0 of MatteMonitor.*
Description
-----------
A Matte Monitor: make alpha values that are strictly between 0 and 1 more visible.
After applying a Keyer, a scaling operation is usually applied to clean the matte. However, it is difficult to visualize on the output values that are very close to 0 or 1, but not equal. This plugin can be used to better visualize these values: connect it to the output of the scaling operator, then to a viewer, and visualize the alpha channel.
Alpha values lower or equal to 0 and greater or equal to 1 are leaved untouched, and alpha values in between are stretched towards 0.5 (using the slope parameter), making them more visible.
The output of this plugin should not be used for firther processing, but only for viewing.
The Matte Monitor is described in “Digital Compositing for Film and Video” by Steve Wright (Sec. 3.1).
See also the video at http://www.vfxio.com/images/movies/Comp_Tip_2.mov
Inputs
------
+--------+-------------+----------+
| Input | Description | Optional |
+========+=============+==========+
| Source | | No |
+--------+-------------+----------+
Controls
--------
.. tabularcolumns:: |>{\raggedright}p{0.2\columnwidth}|>{\raggedright}p{0.06\columnwidth}|>{\raggedright}p{0.07\columnwidth}|p{0.63\columnwidth}|
.. cssclass:: longtable
+-------------------------+--------+---------+----------------------------------------------------------+
| Parameter / script name | Type | Default | Function |
+=========================+========+=========+==========================================================+
| Slope / ``slope`` | Double | 0.5 | Slope applied to alpha values striuctly between 0 and 1. |
+-------------------------+--------+---------+----------------------------------------------------------+
| {
"pile_set_name": "Github"
} |
using System.Windows;
namespace OfficeRibbonXEditor.Interfaces
{
public interface IMessageBoxService
{
MessageBoxResult Show(string text, string caption, MessageBoxButton button = MessageBoxButton.OK, MessageBoxImage image = MessageBoxImage.None);
}
}
| {
"pile_set_name": "Github"
} |
var parser = require('../');
var test = require('tape');
var JSONStream = require('JSONStream');
var packer = require('browser-pack');
test('bundle', function (t) {
t.plan(1);
var p = parser(__dirname + '/files/main.js');
p.on('error', t.fail.bind(t));
var pack = packer();
p.pipe(JSONStream.stringify()).pipe(pack);
var src = '';
pack.on('data', function (buf) { src += buf });
pack.on('end', function () {
Function('console', src)({
log: function (s) { t.equal(s, 'main: 1055') }
});
});
});
| {
"pile_set_name": "Github"
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.