text
stringlengths 1
22.8M
|
|---|
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\CloudBuild;
class TaskRef extends \Google\Collection
{
protected $collection_key = 'params';
/**
* @var string
*/
public $name;
protected $paramsType = Param::class;
protected $paramsDataType = 'array';
/**
* @var string
*/
public $resolver;
/**
* @param string
*/
public function setName($name)
{
$this->name = $name;
}
/**
* @return string
*/
public function getName()
{
return $this->name;
}
/**
* @param Param[]
*/
public function setParams($params)
{
$this->params = $params;
}
/**
* @return Param[]
*/
public function getParams()
{
return $this->params;
}
/**
* @param string
*/
public function setResolver($resolver)
{
$this->resolver = $resolver;
}
/**
* @return string
*/
public function getResolver()
{
return $this->resolver;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(TaskRef::class, 'Google_Service_CloudBuild_TaskRef');
```
|
```objective-c
//
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing, software
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
#pragma once
#include "paddle/common/adt_type_id.h"
namespace pir {
class Attribute;
class BoolAttribute;
class Complex64Attribute;
class Complex128Attribute;
class FloatAttribute;
class DoubleAttribute;
class Int32Attribute;
class IndexAttribute;
class Int64Attribute;
class PointerAttribute;
class TypeAttribute;
class StrAttribute;
class ArrayAttribute;
class TensorNameAttribute;
} // namespace pir
namespace pir::shape {
class SymbolAttribute;
}
namespace paddle::dialect {
class KernelAttribute;
class IntArrayAttribute;
class ScalarAttribute;
class DataTypeAttribute;
class PlaceAttribute;
class DataLayoutAttribute;
} // namespace paddle::dialect
namespace cinn::dialect {
class GroupInfoAttribute;
class CINNKernelInfoAttribute;
class FusionTrackerPtrAttribute;
} // namespace cinn::dialect
namespace cinn::dialect::ir {
class UnclassifiedAttribute {};
// clang-format off
#define FOR_EACH_PIR_ATTRIBUTE_TYPE(__macro) \
__macro(pir::BoolAttribute) \
__macro(pir::Complex64Attribute) \
__macro(pir::Complex128Attribute) \
__macro(pir::FloatAttribute) \
__macro(pir::DoubleAttribute) \
__macro(pir::Int32Attribute) \
__macro(pir::IndexAttribute) \
__macro(pir::Int64Attribute) \
__macro(pir::PointerAttribute) \
__macro(pir::TypeAttribute) \
__macro(pir::StrAttribute) \
__macro(pir::ArrayAttribute) \
__macro(pir::TensorNameAttribute) \
__macro(pir::shape::SymbolAttribute) \
__macro(paddle::dialect::KernelAttribute) \
__macro(paddle::dialect::IntArrayAttribute) \
__macro(paddle::dialect::ScalarAttribute) \
__macro(paddle::dialect::DataTypeAttribute) \
__macro(paddle::dialect::PlaceAttribute) \
__macro(paddle::dialect::DataLayoutAttribute) \
__macro(cinn::dialect::GroupInfoAttribute) \
__macro(cinn::dialect::CINNKernelInfoAttribute) \
__macro(cinn::dialect::FusionTrackerPtrAttribute)
// clang-format on
using AttrAdtTypeIdBase = ::common::AdtBaseTypeId<
#define AS_ATTR_ADT_TYPE_ID_ALTERNATIVE(cls) cls,
FOR_EACH_PIR_ATTRIBUTE_TYPE(AS_ATTR_ADT_TYPE_ID_ALTERNATIVE)
#undef AS_ATTR_ADT_TYPE_ID_ALTERNATIVE
UnclassifiedAttribute>;
struct AttrAdtTypeId : public AttrAdtTypeIdBase {
using AttrAdtTypeIdBase::AttrAdtTypeIdBase;
};
AttrAdtTypeId GetAttrAdtTypeId(const pir::Attribute& attribute);
} // namespace cinn::dialect::ir
```
|
```c++
// This Source Code Form is subject to the terms of the Mozilla Public
// file, You can obtain one at path_to_url
#include <limits>
#include "../include/register_events_command.hpp"
#include <vsomeip/internal/logger.hpp>
namespace vsomeip_v3 {
namespace protocol {
register_events_command::register_events_command()
: command(id_e::REGISTER_EVENT_ID) {
}
bool
register_events_command::add_registration(const register_event &_register_event) {
size_t its_size(size_ + COMMAND_HEADER_SIZE
+ sizeof(_register_event.get_service()) + sizeof(_register_event.get_instance())
+ sizeof(_register_event.get_event()) + sizeof(_register_event.get_event_type())
+ sizeof(_register_event.is_provided()) + sizeof(_register_event.get_reliability())
+ sizeof(_register_event.is_cyclic()) + sizeof(_register_event.get_num_eventgroups())
+ (_register_event.get_num_eventgroups() * sizeof(eventgroup_t) ));
// check size
if (its_size > std::numeric_limits<command_size_t>::max())
return false;
// set size
size_ = static_cast<command_size_t>(its_size - COMMAND_HEADER_SIZE);
registrations_.push_back(_register_event);
return true;
}
void
register_events_command::serialize(std::vector<byte_t> &_buffer, error_e &_error) const {
if (size_ + COMMAND_HEADER_SIZE > std::numeric_limits<command_size_t>::max()) {
_error = error_e::ERROR_MAX_COMMAND_SIZE_EXCEEDED;
return;
}
// resize buffer
_buffer.resize(size_+COMMAND_HEADER_SIZE);
// serialize header
command::serialize(_buffer, _error);
if (_error != error_e::ERROR_OK)
return;
// serialize payload
size_t its_offset(COMMAND_HEADER_SIZE);
for(auto ® : registrations_) {
reg.serialize(_buffer, its_offset, _error);
if (_error != error_e::ERROR_OK)
return;
}
}
void
register_events_command::deserialize(const std::vector<byte_t> &_buffer, error_e &_error) {
registrations_.clear();
if(_buffer.size() < COMMAND_HEADER_SIZE) {
_error = error_e::ERROR_NOT_ENOUGH_BYTES;
return;
}
// deserialize header
command::deserialize(_buffer, _error);
if (_error != error_e::ERROR_OK)
return;
size_t its_offset(COMMAND_HEADER_SIZE);
while (its_offset < _buffer.size()) {
register_event event_command;
event_command.deserialize(_buffer, its_offset, _error);
if (_error != error_e::ERROR_OK)
return;
registrations_.push_back(event_command);
}
}
std::size_t
register_events_command::get_num_registrations() const {
return registrations_.size();
}
bool
register_events_command::get_registration_at(std::size_t _position, register_event & _reg) const {
if(_position < registrations_.size()) {
_reg = registrations_[_position];
return true;
}
return false;
}
} // namespace protocol
} // namespace vsomeip_v3
```
|
This is a list of video games featuring the fictional character Barbie. Some games are adaptations of Barbie films or TV series, while others feature original premises.
1984–1994
Mattel Interactive (1996–2000)
Vivendi Universal Games (2001–2005)
Activision (2006–2009)
2010–present
References
Barbie
Barbie
|
```python
import sys
# Credit to Hugh Bothwell from path_to_url
class TablePrinter(object):
"Print a list of dicts as a table"
def __init__(self, fmt, sep=' ', ul=None):
"""
@param fmt: list of tuple(heading, key, width)
heading: str, column label
key: dictionary key to value to print
width: int, column width in chars
@param sep: string, separation between columns
@param ul: string, character to underline column label, or None for no underlining
"""
super(TablePrinter,self).__init__()
self.fmt = str(sep).join('{lb}{0}:{1}{rb}'.format(key, width, lb='{', rb='}') for heading,key,width in fmt)
self.head = {key:heading for heading,key,width in fmt}
self.ul = {key:str(ul)*width for heading,key,width in fmt} if ul else None
self.width = {key:width for heading,key,width in fmt}
def row(self, data):
if sys.version_info < (3,):
return self.fmt.format(**{ k:str(data.get(k,''))[:w] for k,w in self.width.iteritems() })
else:
return self.fmt.format(**{ k:str(data.get(k,''))[:w] for k,w in self.width.items() })
def __call__(self, dataList):
_r = self.row
res = [_r(data) for data in dataList]
res.insert(0, _r(self.head))
if self.ul:
res.insert(1, _r(self.ul))
return '\n'.join(res)
```
|
```objective-c
/***************************************************************************/
/* */
/* t1parse.h */
/* */
/* Type 1 parser (specification). */
/* */
/* David Turner, Robert Wilhelm, and Werner Lemberg. */
/* */
/* This file is part of the FreeType project, and may only be used, */
/* modified, and distributed under the terms of the FreeType project */
/* license, LICENSE.TXT. By continuing to use, modify, or distribute */
/* this file you indicate that you have read the license and */
/* understand and accept it fully. */
/* */
/***************************************************************************/
#ifndef __T1PARSE_H__
#define __T1PARSE_H__
#include <ft2build.h>
#include FT_INTERNAL_TYPE1_TYPES_H
#include FT_INTERNAL_STREAM_H
FT_BEGIN_HEADER
/*************************************************************************/
/* */
/* <Struct> */
/* T1_ParserRec */
/* */
/* <Description> */
/* A PS_ParserRec is an object used to parse a Type 1 fonts very */
/* quickly. */
/* */
/* <Fields> */
/* root :: The root parser. */
/* */
/* stream :: The current input stream. */
/* */
/* base_dict :: A pointer to the top-level dictionary. */
/* */
/* base_len :: The length in bytes of the top dictionary. */
/* */
/* private_dict :: A pointer to the private dictionary. */
/* */
/* private_len :: The length in bytes of the private dictionary. */
/* */
/* in_pfb :: A boolean. Indicates that we are handling a PFB */
/* file. */
/* */
/* in_memory :: A boolean. Indicates a memory-based stream. */
/* */
/* single_block :: A boolean. Indicates that the private dictionary */
/* is stored in lieu of the base dictionary. */
/* */
typedef struct T1_ParserRec_
{
PS_ParserRec root;
FT_Stream stream;
FT_Byte* base_dict;
FT_ULong base_len;
FT_Byte* private_dict;
FT_ULong private_len;
FT_Bool in_pfb;
FT_Bool in_memory;
FT_Bool single_block;
} T1_ParserRec, *T1_Parser;
#define T1_Add_Table( p, i, o, l ) (p)->funcs.add( (p), i, o, l )
#define T1_Release_Table( p ) \
do \
{ \
if ( (p)->funcs.release ) \
(p)->funcs.release( p ); \
} while ( 0 )
#define T1_Skip_Spaces( p ) (p)->root.funcs.skip_spaces( &(p)->root )
#define T1_Skip_PS_Token( p ) (p)->root.funcs.skip_PS_token( &(p)->root )
#define T1_ToInt( p ) (p)->root.funcs.to_int( &(p)->root )
#define T1_ToFixed( p, t ) (p)->root.funcs.to_fixed( &(p)->root, t )
#define T1_ToCoordArray( p, m, c ) \
(p)->root.funcs.to_coord_array( &(p)->root, m, c )
#define T1_ToFixedArray( p, m, f, t ) \
(p)->root.funcs.to_fixed_array( &(p)->root, m, f, t )
#define T1_ToToken( p, t ) \
(p)->root.funcs.to_token( &(p)->root, t )
#define T1_ToTokenArray( p, t, m, c ) \
(p)->root.funcs.to_token_array( &(p)->root, t, m, c )
#define T1_Load_Field( p, f, o, m, pf ) \
(p)->root.funcs.load_field( &(p)->root, f, o, m, pf )
#define T1_Load_Field_Table( p, f, o, m, pf ) \
(p)->root.funcs.load_field_table( &(p)->root, f, o, m, pf )
FT_LOCAL( FT_Error )
T1_New_Parser( T1_Parser parser,
FT_Stream stream,
FT_Memory memory,
PSAux_Service psaux );
FT_LOCAL( FT_Error )
T1_Get_Private_Dict( T1_Parser parser,
PSAux_Service psaux );
FT_LOCAL( void )
T1_Finalize_Parser( T1_Parser parser );
FT_END_HEADER
#endif /* __T1PARSE_H__ */
/* END */
```
|
```emacs lisp
;;; telega-ffplay.el --- Interface to ffplay for telega -*- lexical-binding:t -*-
;; Author: Zajcev Evgeny <zevlg@yandex.ru>
;; Created: Wed Jan 23 20:58:35 2019
;; Keywords:
;; telega is free software: you can redistribute it and/or modify
;; (at your option) any later version.
;; telega 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
;; along with telega. If not, see <path_to_url
;;; Commentary:
;;
;;; Code:
(require 'cl-lib)
(require 'rx)
(require 'telega-core)
(defvar telega-ffplay-media-timestamp nil
"Bind this variable to start playing at the given media timestamp.")
(defconst telega-ffplay-buffer-name
(concat (unless telega-debug " ") "*ffplay telega*"))
(defconst telega-ffplay--check-regexp
(rx string-start
space
(group (any ?. ?D)) ; decoder
(group (any ?. ?E)) ; encoder
(0+ (not space))
space
(group (0+ (not (any ?= space)))) ;
space
(0+ any)
string-end)
"Regexp to match output ffmpeg's output.")
(defun telega-ffplay--check-ffmpeg-output (option &rest names)
"Check the ffmpeg output for the OPTION for the NAMES.
Return cons cell, where car is a list of decoders and cdr is a list of
encoders."
(let* ((output (shell-command-to-string (concat "ffmpeg -v quiet " option)))
(decoders nil)
(encoders nil))
(dolist (line (split-string output "\n" t))
(when (string-match telega-ffplay--check-regexp line)
(let ((d (match-string 1 line))
(e (match-string 2 line))
(codec (match-string 3 line))
(enc-list (when (string-match "(encoders: \\([^)]+\\))" line)
(split-string (match-string 1 line) " " t " ")))
(dec-list (when (string-match "(decoders: \\([^)]+\\))" line)
(split-string (match-string 1 line) " " t " "))))
(when (member codec names)
(when (string= "D" d)
(setq decoders (nconc decoders (cons codec dec-list))))
(when (string= "E" e)
(setq encoders (nconc encoders (cons codec enc-list))))))))
(cons decoders encoders)))
(defconst telega-ffplay--codecs
(telega-ffplay--check-ffmpeg-output
"-codecs" "opus" "hevc" "aac" "h264" "webp" "vp9")
"Cons, where car is a list of encoders, and cdr is a list of decoders.")
(defun telega-ffplay-has-encoder-p (codec-name)
"Return non-nil if ffmpeg supports CODEC-NAME as encoder."
(member codec-name (cdr telega-ffplay--codecs)))
(defun telega-ffplay-has-decoder-p (codec-name)
"Return non-nil if ffmpeg supports CODEC-NAME as decoder."
(member codec-name (car telega-ffplay--codecs)))
(defun telega-ffplay-proc ()
"Return current ffplay process."
(let ((buf (get-buffer telega-ffplay-buffer-name)))
(when (buffer-live-p buf)
(get-buffer-process buf))))
(defun telega-ffplay-progress (proc)
"Return current ffplay progress."
(when-let* ((ffproc proc)
(proc-plist (process-plist ffproc)))
(plist-get proc-plist :progress)))
(defun telega-ffplay-pause (ffproc &optional pause-at no-callback-p)
"Pause ffplay process FFPROC.
PAUSE-AT is the moment to pause at, by default pause at
current `(telega-ffplay-progress)'.
Specify non-nil NO-CALLBACK-P to ignore ffplay callbacks."
(when (process-live-p ffproc)
(telega-debug "ffplay PAUSE at %S"
(or pause-at (telega-ffplay-progress ffproc)))
;; Do not trigger callbacks, ffplay is about to be restarted
(when no-callback-p
(let ((proc-plist (process-plist ffproc)))
(plist-put proc-plist :callback nil)
(plist-put proc-plist :progress-callback nil)
(set-process-plist ffproc proc-plist)))
(unless pause-at
(setq pause-at (or (telega-ffplay-progress ffproc) 0)))
;; Fix negative value when backward forwarding
(when (< pause-at 0)
(setq pause-at 0))
(telega-ffplay-stop ffproc (cons 'paused pause-at))))
(defun telega-ffplay-playing-p (proc)
"Return non-nil if ffplay PROC is running."
(process-live-p proc))
(defun telega-ffplay-stop-reason (proc)
"Return stop reason for ffplay process PROC."
(when-let* ((ffproc proc)
(proc-plist (process-plist ffproc)))
(plist-get proc-plist :stop-reason)))
(defun telega-ffplay-paused-p (proc)
"Return non-nil if PROC as been paused by `telega-ffplay-pause'.
If ffplay is paused, then return progress at which ffplay has been
paused."
(let ((stop-reason (telega-ffplay-stop-reason proc)))
(when (and (consp stop-reason) (eq 'paused (car stop-reason)))
(cdr stop-reason))))
(defun telega-ffplay-resume (&optional proc)
"Resume ffplay process PROC."
;; SIGCONT to resume ffplay
(let ((ffproc (or proc (telega-ffplay-proc))))
(when (process-live-p ffproc)
(telega-debug "ffplay RESUME")
(signal-process ffproc 18)
; (continue-process ffproc t)
)))
(defun telega-ffplay-stop (&optional proc stop-reason)
"Stop running ffplay process."
(when-let* ((ffproc (or proc (telega-ffplay-proc)))
(buf (process-buffer ffproc)))
(when (buffer-live-p buf)
(plist-put (process-plist ffproc) :stop-reason
(or stop-reason 'killed))
(kill-buffer buf)
;; Wait for process to die? `inhibit-quit' is non-nil if
;; already running under process output
(while (and (process-live-p ffproc) (null inhibit-quit))
(accept-process-output ffproc)))))
(defun telega-ffplay--sentinel (proc _event)
"Sentinel for the ffplay process."
;; NOTE: Killing "docker exec" process won't kill underlining
;; process running in the docker container, because process could be
;; running under shell
(when telega-use-docker
(shell-command-to-string
;; NOTE: We use killall from "psmisc" package, this killall tool
;; supports --wait flag to wait for process to terminate
(telega-docker-exec-cmd "/usr/bin/killall --quiet --wait ffmpeg ffplay"
nil nil 'no-error)))
(telega-debug "ffplay SENTINEL: status=%S, live=%S, callback=%S"
(process-status proc) (process-live-p proc)
(plist-get (process-plist proc) :progress-callback))
(unless (process-live-p proc)
(let* ((proc-plist (process-plist proc))
(callback (plist-get proc-plist :progress-callback)))
(unless (telega-ffplay-stop-reason proc)
;; Process exited gracefully
(plist-put proc-plist :stop-reason 'finished)
(set-process-plist proc proc-plist))
(when callback
(funcall callback proc))
;; NOTE: sentinel might be called multiple times with 'exit
;; status, handle this situation simply by unsetting callback
(set-process-plist proc (plist-put proc-plist :progress-callback nil)))))
(defun telega-ffplay--filter (proc output)
"Filter for the telega-server process."
(let* ((buffer (process-buffer proc))
(proc-plist (process-plist proc))
(callback (plist-get proc-plist :progress-callback))
(progress (plist-get proc-plist :progress)))
(when (buffer-live-p buffer)
(with-current-buffer buffer
(goto-char (point-max))
(insert output)
(let (new-progress)
(cond ((save-excursion
(re-search-backward "
\\s-*\\([0-9.]+\\)" nil t))
;; ffplay format when playing
(setq new-progress (string-to-number (match-string 1))))
((save-excursion
(re-search-backward
" time=\\([0-9][0-9]\\):\\([0-9][0-9]\\):\\([0-9.]+\\) "
nil t))
;; ffmpeg voice note capture format
(setq new-progress
(+ (* 3600 (string-to-number (match-string 1)))
(* 60 (string-to-number (match-string 2)))
(string-to-number (match-string 3))))))
(when new-progress
(set-process-plist
proc (plist-put proc-plist :progress new-progress))
(when (and callback (> new-progress progress))
(funcall callback proc))))
(unless telega-debug
(delete-region (point-min) (point-max))))
)))
(defun telega-ffplay-run-command (cmd &optional callback)
"Run arbitrary ffplay/ffmpeg/ffprobe command CMD."
;; Kill previously running ffplay if any
(telega-ffplay-stop)
;; Start new ffplay
(telega-debug "ffplay START: %s" cmd)
(with-current-buffer (get-buffer-create telega-ffplay-buffer-name)
(let ((proc (apply 'start-process "ffplay" (current-buffer)
(split-string cmd " " t))))
(set-process-plist proc (list :progress-callback callback
:progress 0.0))
(set-process-query-on-exit-flag proc nil)
(set-process-sentinel proc #'telega-ffplay--sentinel)
(set-process-filter proc #'telega-ffplay--filter)
proc)))
(defun telega-ffplay-run (filename ffplay-args &optional callback)
"Start ffplay to play FILENAME.
FFPLAY-ARGS is additional arguments string for the ffplay.
CALLBACK is called on updates with single argument - process.
Return newly created process."
(declare (indent 2))
;; Additional args:
;; -nodisp for sounds
;; -ss <SECONDS> to seek
;; Kill previously running ffplay if any
(telega-ffplay-stop)
;; Start new ffplay
(let ((args (nconc (list "-hide_banner" "-autoexit")
(split-string (or ffplay-args "") " " t)
(list (expand-file-name filename))))
(ffplay-bin (or (executable-find "ffplay")
(error "ffplay not found in `exec-path'"))))
(telega-debug "ffplay START: %s %s"
ffplay-bin (mapconcat #'identity args " "))
(with-current-buffer (get-buffer-create telega-ffplay-buffer-name)
(let ((proc (apply 'start-process "ffplay" (current-buffer)
ffplay-bin args)))
(set-process-plist proc (list :progress-callback callback
:progress 0.0))
(set-process-query-on-exit-flag proc nil)
(set-process-sentinel proc #'telega-ffplay--sentinel)
(set-process-filter proc #'telega-ffplay--filter)
proc))))
(defun telega-ffplay-get-fps-ratio (filename &optional default)
"Return fps ratio for the FILENAME video file.
Return list where first element is <fps_numerator> and second element
is <fps_denominator>. f.i. \\(30000 1001\\) is returned for 29.97fps.
If fps is not available for FILENAME, then return DEFAULT or \\(30 1\\)."
(let ((fps-ratio (telega-strip-newlines
(shell-command-to-string
(telega-docker-exec-cmd
(concat "ffprobe -v error -select_streams v:0 "
"-show_entries stream=r_frame_rate "
"-of default=noprint_wrappers=1:nokey=1 "
"\"" (expand-file-name filename) "\"")
'try-host-cmd-first)))))
(if (string-match "\\([0-9]+\\)/\\([0-9]+\\)" fps-ratio)
(list (string-to-number (match-string 1 fps-ratio))
(string-to-number (match-string 2 fps-ratio)))
(or default '(30 1)))))
(defun telega-ffplay-get-nframes (filename)
"Probe number of frames of FILENAME video file."
(string-to-number
(shell-command-to-string
(telega-docker-exec-cmd
(concat "ffprobe -v error -select_streams v:0 "
"-show_entries stream=nb_frames "
"-of default=nokey=1:noprint_wrappers=1 "
"\"" (expand-file-name filename) "\"")
'try-host-cmd-first))))
(defun telega-ffplay-get-metadata (filename)
"Return metadata as alist for the media FILENAME."
(let ((raw-metadata (shell-command-to-string
(telega-docker-exec-cmd
(concat "ffmpeg -v 0 -i "
"\"" (expand-file-name filename) "\" "
" -f ffmetadata -")
'try-host-cmd-first))))
(delq nil (mapcar (lambda (line)
(when (string-match "\\([a-zA-Z]+\\)=\\(.+$\\)" line)
(cons (match-string 1 line) (match-string 2 line))))
(split-string raw-metadata "\n" t " \t")))))
(defun telega-ffplay-get-duration (filename)
"Return duration as float number for the media FILENAME."
(string-to-number
(shell-command-to-string
(telega-docker-exec-cmd
(concat "ffprobe -v error "
"-show_entries format=duration "
"-of default=nokey=1:noprint_wrappers=1 "
"\"" (expand-file-name filename) "\"")
'try-host-cmd-first))))
(defun telega-ffplay-get-resolution (filename)
"Return resolution for video FILENAME.
Return cons cell with width and height if resolution is extracted, nil
otherwise."
(let ((raw-res (shell-command-to-string
(telega-docker-exec-cmd
(concat "ffprobe -v error "
"-show_entries stream=width,height "
"-of default=nokey=1:noprint_wrappers=1 "
"\"" (expand-file-name filename) "\"")
'try-host-cmd-first))))
(when (string-match "\\([0-9]+\\)\n\\([0-9]+\\)" raw-res)
(cons (string-to-number (match-string 1 raw-res))
(string-to-number (match-string 2 raw-res))))))
(defun telega-ffplay--png-extract ()
"Extract png image data from current buffer.
Return cons cell where car is the frame number and cdr is frame
filename.
Return nil if no image is available."
(save-excursion
(goto-char (point-min))
(when (re-search-forward "^\\([0-9]+\\) \\([^\r\n]+\\)\r?\n" nil t)
(let ((frame-num (match-string 1))
(frame-filename (match-string 2)))
(delete-region (match-beginning 0) (match-end 0))
(cons (string-to-number frame-num) frame-filename)))))
(defun telega-ffplay--png-sentinel (proc event)
"Sentinel for png extractor, see `telega-ffplay-to-png'."
(telega-debug "ffplay-png SENTINEL: status=%S, live=%S, callback=%S"
(process-status proc) (process-live-p proc)
(plist-get (process-plist proc) :callback))
;; NOTE: `telega-ffplay--sentinel' has some docker-related
;; logic, and sets stop reason
(telega-ffplay--sentinel proc event)
(unless (process-live-p proc)
(let* ((proc-plist (process-plist proc))
(callback (plist-get proc-plist :callback))
(callback-args (plist-get proc-plist :callback-args))
(paused-p (telega-ffplay-paused-p proc))
(all-frames (plist-get proc-plist :frames)))
;; DONE executing.
;; If paused, show last frame
(when callback
(apply callback proc (when paused-p (car all-frames)) callback-args))
;; Delete all produced files for frames
;; If paused, keep last shown frame
(dolist (frame (if paused-p (cdr all-frames) all-frames))
(delete-file (cdr frame)))
;; NOTE: sentinel might be called multiple times with 'exit
;; status, handle this situation simply by unsetting callback
(set-process-plist proc (plist-put proc-plist :callback nil)))))
(defun telega-ffplay--png-filter (proc output)
"Filter for png extractor, see `telega-ffplay-to-png'."
(let* ((proc-plist (process-plist proc))
(callback (plist-get proc-plist :callback))
(callback-args (plist-get proc-plist :callback-args))
(buffer (process-buffer proc)))
(when (buffer-live-p buffer)
(with-current-buffer (process-buffer proc)
(goto-char (point-max))
(insert output)
;; If got multiple frames, skip to the latest
(let ((next-frame (telega-ffplay--png-extract))
frame)
(while next-frame
(setq frame next-frame
next-frame (telega-ffplay--png-extract))
(when next-frame
(telega-debug "ffplay-png: skipping frame %S" frame)
(delete-file (cdr frame))))
(when frame
;; Put frame in the list
(let ((all-frames (plist-get proc-plist :frames)))
(plist-put proc-plist :frames (cons frame all-frames))
(set-process-plist proc proc-plist))
(when callback
(apply callback proc frame callback-args)))
)))))
(defun telega-ffplay-to-png--internal (ffmpeg-args callback &optional
callback-args pngext-args)
"Play video FILENAME extracting png images from it.
FFMPEG-ARGS is a string for additional arguments to ffmpeg.
PNGEXT-ARGS is a string for additional arguments to pngextractor."
(declare (indent 1))
(cl-assert (string-suffix-p " -vcodec png -" ffmpeg-args))
;; Stop any ffplay running
(telega-ffplay-stop)
;; Start new ffmpeg
(with-current-buffer (get-buffer-create telega-ffplay-buffer-name)
(let* ((prefix (telega-temp-name "png-video"))
(ffmpeg-bin (executable-find "ffmpeg"))
(ffmpeg-cmd-args
(concat " -hide_banner -loglevel quiet"
(when ffmpeg-args
(concat " " ffmpeg-args))))
(pngext-cmd-args
(concat "-E " prefix
(when pngext-args
(concat " " pngext-args))))
(shell-cmd
(cond (ffmpeg-bin
(format "%s %s | %s %s" ffmpeg-bin ffmpeg-cmd-args
(telega-docker-exec-cmd telega-server-command
'try-host-cmd-first "-i")
pngext-cmd-args))
(telega-use-docker
(telega-docker-exec-cmd
(format "sh -c \"ffmpeg %s | telega-server %s\""
ffmpeg-cmd-args pngext-cmd-args)))
(t
(error "ffmpeg not found in `exec-path'"))))
(process-adaptive-read-buffering nil) ;no buffering please
(proc (start-process-shell-command
"ffmpeg" (current-buffer) shell-cmd)))
(telega-debug "ffplay RUN: %s" shell-cmd)
(set-process-plist proc (list :prefix prefix
:nframes -1
:frames nil
:callback callback
:callback-args callback-args))
(set-process-query-on-exit-flag proc nil)
(set-process-sentinel proc 'telega-ffplay--png-sentinel)
(set-process-filter proc 'telega-ffplay--png-filter)
proc)))
(cl-defun telega-ffplay-to-png (filename ffmpeg-args callback-spec
&key seek speed vcodec)
"Play video FILENAME extracting png images from it.
FFMPEG-ARGS is a string for additional arguments to ffplay.
CALLBACK-SPEC specifies a callback to be used. car of the
CALLBACK-SPEC is a function to be called and rest are additional
arguments to that function.
Callback is called with args: <proc> <filename.png> <additional-arguments>.
Callback is called with nil filename when finished.
SEEK specifies seek position to start playing from.
SPEED specifies a speed of png images extraction, default is 1 (realtime).
Return newly created proc."
(declare (indent 2))
(let* ((fps-ratio (let ((fn-fps (telega-ffplay-get-fps-ratio
(expand-file-name filename))))
(if (or (not speed) (equal speed 1))
fn-fps
;; Adjust fps ratio according to SPEED
(list (* speed (nth 0 fn-fps)) (nth 1 fn-fps)))))
(callback (if (listp callback-spec)
(car callback-spec)
(cl-assert (functionp callback-spec))
callback-spec))
(callback-args (when (listp callback-spec)
(cdr callback-spec)))
(proc (telega-ffplay-to-png--internal
(concat (when seek
(format " -ss %.2f" seek))
(when vcodec
(concat " -vcodec " vcodec))
" -i '" (expand-file-name filename) "'"
(when ffmpeg-args
(concat " " ffmpeg-args))
" -f image2pipe -vcodec png -")
callback callback-args
(concat "-f " (mapconcat #'int-to-string fps-ratio "/"))))
(proc-plist (process-plist proc)))
;; Adjust `:nframes' and `:fps-ratio' for correct progress calculation
(plist-put proc-plist :nframes (telega-ffplay-get-nframes filename))
(set-process-plist proc proc-plist)
proc))
;;; Video Player
(defun telega-video-player--sentinel (proc _event)
"Sentinel for incremental player."
(telega-debug "video-player SENTINEL: status=%S, live=%S"
(process-status proc) (process-live-p proc))
(let* ((proc-plist (process-plist proc))
(done-callback (plist-get proc-plist :done-callback)))
(unless (process-live-p proc)
(when done-callback
(funcall done-callback)))))
(defun telega-video-player-run (filename &optional msg done-callback)
"Start playing video FILENAME with `telega-video-player-command' command.
DONE-CALLBACK - callback to call, when done viewing video."
(declare (indent 2))
(unless telega-video-player-command
(user-error "telega: `telega-video-player-command' is unset"))
(let* ((video-player-cmd
(if (listp telega-video-player-command)
(eval telega-video-player-command)
(cl-assert (stringp telega-video-player-command))
telega-video-player-command))
(player-cmd-args (split-string video-player-cmd " " t))
(proc (apply #'start-process "telega-video-player" nil
(append player-cmd-args (list filename)))))
(telega-debug "video-player RUN: %s %s" video-player-cmd filename)
(set-process-plist proc (list :done-callback done-callback
:message msg))
(set-process-query-on-exit-flag proc nil)
(set-process-sentinel proc 'telega-video-player--sentinel)
proc))
(provide 'telega-ffplay)
;;; telega-ffplay.el ends here
```
|
```kotlin
package net.corda.nodeapi.internal.serialization.kryo
import org.junit.Ignore
import org.junit.Test
import org.junit.jupiter.api.assertDoesNotThrow
import java.util.LinkedList
import kotlin.test.assertEquals
class KryoCheckpointTest {
private val testSize = 1000L
/**
* This test just ensures that the checkpoints still work in light of [LinkedHashMapEntrySerializer].
*/
@Test(timeout=300_000)
fun `linked hash map can checkpoint without error`() {
var lastKey = ""
val dummyMap = linkedMapOf<String, Long>()
for (i in 0..testSize) {
dummyMap[i.toString()] = i
}
var it = dummyMap.iterator()
while (it.hasNext()) {
lastKey = it.next().key
val bytes = KryoCheckpointSerializer.serialize(it, KRYO_CHECKPOINT_CONTEXT)
it = KryoCheckpointSerializer.deserialize(bytes, it.javaClass, KRYO_CHECKPOINT_CONTEXT)
}
assertEquals(testSize.toString(), lastKey)
}
@Test(timeout=300_000)
fun `empty linked hash map can checkpoint without error`() {
val dummyMap = linkedMapOf<String, Long>()
val it = dummyMap.iterator()
val itKeys = dummyMap.keys.iterator()
val itValues = dummyMap.values.iterator()
val bytes = KryoCheckpointSerializer.serialize(it, KRYO_CHECKPOINT_CONTEXT)
val bytesKeys = KryoCheckpointSerializer.serialize(itKeys, KRYO_CHECKPOINT_CONTEXT)
val bytesValues = KryoCheckpointSerializer.serialize(itValues, KRYO_CHECKPOINT_CONTEXT)
assertDoesNotThrow {
KryoCheckpointSerializer.deserialize(bytes, it.javaClass, KRYO_CHECKPOINT_CONTEXT)
KryoCheckpointSerializer.deserialize(bytesKeys, itKeys.javaClass, KRYO_CHECKPOINT_CONTEXT)
KryoCheckpointSerializer.deserialize(bytesValues, itValues.javaClass, KRYO_CHECKPOINT_CONTEXT)
}
}
@Test(timeout=300_000)
fun `linked hash map with null values can checkpoint without error`() {
val dummyMap = linkedMapOf<String?, Long?>().apply {
put("foo", 2L)
put(null, null)
put("bar", 3L)
}
val it = dummyMap.iterator()
val bytes = KryoCheckpointSerializer.serialize(it, KRYO_CHECKPOINT_CONTEXT)
val itKeys = dummyMap.keys.iterator()
itKeys.next()
itKeys.next()
val bytesKeys = KryoCheckpointSerializer.serialize(itKeys, KRYO_CHECKPOINT_CONTEXT)
val itValues = dummyMap.values.iterator()
val bytesValues = KryoCheckpointSerializer.serialize(itValues, KRYO_CHECKPOINT_CONTEXT)
assertDoesNotThrow {
KryoCheckpointSerializer.deserialize(bytes, it.javaClass, KRYO_CHECKPOINT_CONTEXT)
val desItKeys = KryoCheckpointSerializer.deserialize(bytesKeys, itKeys.javaClass, KRYO_CHECKPOINT_CONTEXT)
assertEquals("bar", desItKeys.next())
KryoCheckpointSerializer.deserialize(bytesValues, itValues.javaClass, KRYO_CHECKPOINT_CONTEXT)
}
}
@Test(timeout=300_000)
fun `linked hash map keys can checkpoint without error`() {
var lastKey = ""
val dummyMap = linkedMapOf<String, Long>()
for (i in 0..testSize) {
dummyMap[i.toString()] = i
}
var it = dummyMap.keys.iterator()
while (it.hasNext()) {
lastKey = it.next()
val bytes = KryoCheckpointSerializer.serialize(it, KRYO_CHECKPOINT_CONTEXT)
it = KryoCheckpointSerializer.deserialize(bytes, it.javaClass, KRYO_CHECKPOINT_CONTEXT)
}
assertEquals(testSize.toString(), lastKey)
}
@Test(timeout=300_000)
fun `linked hash map values can checkpoint without error`() {
var lastValue = 0L
val dummyMap = linkedMapOf<String, Long>()
for (i in 0..testSize) {
dummyMap[i.toString()] = i
}
var it = dummyMap.values.iterator()
while (it.hasNext()) {
lastValue = it.next()
val bytes = KryoCheckpointSerializer.serialize(it, KRYO_CHECKPOINT_CONTEXT)
it = KryoCheckpointSerializer.deserialize(bytes, it.javaClass, KRYO_CHECKPOINT_CONTEXT)
}
assertEquals(testSize, lastValue)
}
@Test(timeout = 300_000)
fun `linked hash map values can checkpoint without error, even with repeats`() {
var lastValue = "0"
val dummyMap = linkedMapOf<String, String>()
for (i in 0..testSize) {
dummyMap[i.toString()] = (i % 10).toString()
}
var it = dummyMap.values.iterator()
while (it.hasNext()) {
lastValue = it.next()
val bytes = KryoCheckpointSerializer.serialize(it, KRYO_CHECKPOINT_CONTEXT)
it = KryoCheckpointSerializer.deserialize(bytes, it.javaClass, KRYO_CHECKPOINT_CONTEXT)
}
assertEquals((testSize % 10).toString(), lastValue)
}
@Ignore("Kryo optimizes boxed primitives so this does not work. Need to customise ReferenceResolver to stop it doing it.")
@Test(timeout = 300_000)
fun `linked hash map values can checkpoint without error, even with repeats for boxed primitives`() {
var lastValue = 0L
val dummyMap = linkedMapOf<String, Long>()
for (i in 0..testSize) {
dummyMap[i.toString()] = (i % 10)
}
var it = dummyMap.values.iterator()
while (it.hasNext()) {
lastValue = it.next()
val bytes = KryoCheckpointSerializer.serialize(it, KRYO_CHECKPOINT_CONTEXT)
it = KryoCheckpointSerializer.deserialize(bytes, it.javaClass, KRYO_CHECKPOINT_CONTEXT)
}
assertEquals(testSize % 10, lastValue)
}
/**
* This test just ensures that the checkpoints still work in light of [LinkedHashMapEntrySerializer].
*/
@Test(timeout=300_000)
fun `linked hash set can checkpoint without error`() {
var result: Any = 0L
val dummySet = linkedSetOf<Any>().apply { addAll(0..testSize) }
var it = dummySet.iterator()
while (it.hasNext()) {
result = it.next()
val bytes = KryoCheckpointSerializer.serialize(it, KRYO_CHECKPOINT_CONTEXT)
it = KryoCheckpointSerializer.deserialize(bytes, it.javaClass, KRYO_CHECKPOINT_CONTEXT)
}
assertEquals(testSize, result)
}
/**
* This test just ensures that the checkpoints still work in light of [LinkedListItrSerializer].
*/
@Test(timeout=300_000)
fun `linked list can checkpoint without error`() {
var result: Any = 0L
val dummyList = LinkedList<Long>().apply { addAll(0..testSize) }
var it = dummyList.iterator()
while (it.hasNext()) {
result = it.next()
val bytes = KryoCheckpointSerializer.serialize(it, KRYO_CHECKPOINT_CONTEXT)
it = KryoCheckpointSerializer.deserialize(bytes, it.javaClass, KRYO_CHECKPOINT_CONTEXT)
}
assertEquals(testSize, result)
}
}
```
|
```c++
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "src/compiler/escape-analysis-reducer.h"
#include "src/compiler/all-nodes.h"
#include "src/compiler/simplified-operator.h"
#include "src/compiler/type-cache.h"
#include "src/execution/frame-constants.h"
namespace v8 {
namespace internal {
namespace compiler {
#ifdef DEBUG
#define TRACE(...) \
do { \
if (FLAG_trace_turbo_escape) PrintF(__VA_ARGS__); \
} while (false)
#else
#define TRACE(...)
#endif // DEBUG
EscapeAnalysisReducer::EscapeAnalysisReducer(
Editor* editor, JSGraph* jsgraph, EscapeAnalysisResult analysis_result,
Zone* zone)
: AdvancedReducer(editor),
jsgraph_(jsgraph),
analysis_result_(analysis_result),
object_id_cache_(zone),
node_cache_(jsgraph->graph(), zone),
arguments_elements_(zone),
zone_(zone) {}
Reduction EscapeAnalysisReducer::ReplaceNode(Node* original,
Node* replacement) {
const VirtualObject* vobject =
analysis_result().GetVirtualObject(replacement);
if (replacement->opcode() == IrOpcode::kDead ||
(vobject && !vobject->HasEscaped())) {
RelaxEffectsAndControls(original);
return Replace(replacement);
}
Type const replacement_type = NodeProperties::GetType(replacement);
Type const original_type = NodeProperties::GetType(original);
if (replacement_type.Is(original_type)) {
RelaxEffectsAndControls(original);
return Replace(replacement);
}
// We need to guard the replacement if we would widen the type otherwise.
DCHECK_EQ(1, original->op()->EffectOutputCount());
DCHECK_EQ(1, original->op()->EffectInputCount());
DCHECK_EQ(1, original->op()->ControlInputCount());
Node* effect = NodeProperties::GetEffectInput(original);
Node* control = NodeProperties::GetControlInput(original);
original->TrimInputCount(0);
original->AppendInput(jsgraph()->zone(), replacement);
original->AppendInput(jsgraph()->zone(), effect);
original->AppendInput(jsgraph()->zone(), control);
NodeProperties::SetType(
original,
Type::Intersect(original_type, replacement_type, jsgraph()->zone()));
NodeProperties::ChangeOp(original,
jsgraph()->common()->TypeGuard(original_type));
ReplaceWithValue(original, original, original, control);
return NoChange();
}
namespace {
Node* SkipTypeGuards(Node* node) {
while (node->opcode() == IrOpcode::kTypeGuard) {
node = NodeProperties::GetValueInput(node, 0);
}
return node;
}
} // namespace
Node* EscapeAnalysisReducer::ObjectIdNode(const VirtualObject* vobject) {
VirtualObject::Id id = vobject->id();
if (id >= object_id_cache_.size()) object_id_cache_.resize(id + 1);
if (!object_id_cache_[id]) {
Node* node = jsgraph()->graph()->NewNode(jsgraph()->common()->ObjectId(id));
NodeProperties::SetType(node, Type::Object());
object_id_cache_[id] = node;
}
return object_id_cache_[id];
}
Reduction EscapeAnalysisReducer::Reduce(Node* node) {
if (Node* replacement = analysis_result().GetReplacementOf(node)) {
DCHECK(node->opcode() != IrOpcode::kAllocate &&
node->opcode() != IrOpcode::kFinishRegion);
DCHECK_NE(replacement, node);
return ReplaceNode(node, replacement);
}
switch (node->opcode()) {
case IrOpcode::kAllocate:
case IrOpcode::kTypeGuard: {
const VirtualObject* vobject = analysis_result().GetVirtualObject(node);
if (vobject && !vobject->HasEscaped()) {
RelaxEffectsAndControls(node);
}
return NoChange();
}
case IrOpcode::kFinishRegion: {
Node* effect = NodeProperties::GetEffectInput(node, 0);
if (effect->opcode() == IrOpcode::kBeginRegion) {
RelaxEffectsAndControls(effect);
RelaxEffectsAndControls(node);
}
return NoChange();
}
case IrOpcode::kNewArgumentsElements:
arguments_elements_.insert(node);
return NoChange();
default: {
// TODO(sigurds): Change this to GetFrameStateInputCount once
// it is working. For now we use EffectInputCount > 0 to determine
// whether a node might have a frame state input.
if (node->op()->EffectInputCount() > 0) {
ReduceFrameStateInputs(node);
}
return NoChange();
}
}
}
// While doing DFS on the FrameState tree, we have to recognize duplicate
// occurrences of virtual objects.
class Deduplicator {
public:
explicit Deduplicator(Zone* zone) : is_duplicate_(zone) {}
bool SeenBefore(const VirtualObject* vobject) {
VirtualObject::Id id = vobject->id();
if (id >= is_duplicate_.size()) {
is_duplicate_.resize(id + 1);
}
bool is_duplicate = is_duplicate_[id];
is_duplicate_[id] = true;
return is_duplicate;
}
private:
ZoneVector<bool> is_duplicate_;
};
void EscapeAnalysisReducer::ReduceFrameStateInputs(Node* node) {
DCHECK_GE(node->op()->EffectInputCount(), 1);
for (int i = 0; i < node->InputCount(); ++i) {
Node* input = node->InputAt(i);
if (input->opcode() == IrOpcode::kFrameState) {
Deduplicator deduplicator(zone());
if (Node* ret = ReduceDeoptState(input, node, &deduplicator)) {
node->ReplaceInput(i, ret);
}
}
}
}
Node* EscapeAnalysisReducer::ReduceDeoptState(Node* node, Node* effect,
Deduplicator* deduplicator) {
if (node->opcode() == IrOpcode::kFrameState) {
NodeHashCache::Constructor new_node(&node_cache_, node);
// This input order is important to match the DFS traversal used in the
// instruction selector. Otherwise, the instruction selector might find a
// duplicate node before the original one.
for (int input_id : {kFrameStateOuterStateInput, kFrameStateFunctionInput,
kFrameStateParametersInput, kFrameStateContextInput,
kFrameStateLocalsInput, kFrameStateStackInput}) {
Node* input = node->InputAt(input_id);
new_node.ReplaceInput(ReduceDeoptState(input, effect, deduplicator),
input_id);
}
return new_node.Get();
} else if (node->opcode() == IrOpcode::kStateValues) {
NodeHashCache::Constructor new_node(&node_cache_, node);
for (int i = 0; i < node->op()->ValueInputCount(); ++i) {
Node* input = NodeProperties::GetValueInput(node, i);
new_node.ReplaceValueInput(ReduceDeoptState(input, effect, deduplicator),
i);
}
return new_node.Get();
} else if (const VirtualObject* vobject =
analysis_result().GetVirtualObject(SkipTypeGuards(node))) {
if (vobject->HasEscaped()) return node;
if (deduplicator->SeenBefore(vobject)) {
return ObjectIdNode(vobject);
} else {
std::vector<Node*> inputs;
for (int offset = 0; offset < vobject->size(); offset += kTaggedSize) {
Node* field =
analysis_result().GetVirtualObjectField(vobject, offset, effect);
CHECK_NOT_NULL(field);
if (field != jsgraph()->Dead()) {
inputs.push_back(ReduceDeoptState(field, effect, deduplicator));
}
}
int num_inputs = static_cast<int>(inputs.size());
NodeHashCache::Constructor new_node(
&node_cache_,
jsgraph()->common()->ObjectState(vobject->id(), num_inputs),
num_inputs, &inputs.front(), NodeProperties::GetType(node));
return new_node.Get();
}
} else {
return node;
}
}
void EscapeAnalysisReducer::VerifyReplacement() const {
AllNodes all(zone(), jsgraph()->graph());
for (Node* node : all.reachable) {
if (node->opcode() == IrOpcode::kAllocate) {
if (const VirtualObject* vobject =
analysis_result().GetVirtualObject(node)) {
if (!vobject->HasEscaped()) {
FATAL("Escape analysis failed to remove node %s#%d\n",
node->op()->mnemonic(), node->id());
}
}
}
}
}
void EscapeAnalysisReducer::Finalize() {
for (Node* node : arguments_elements_) {
int mapped_count = NewArgumentsElementsMappedCountOf(node->op());
Node* arguments_frame = NodeProperties::GetValueInput(node, 0);
if (arguments_frame->opcode() != IrOpcode::kArgumentsFrame) continue;
Node* arguments_length = NodeProperties::GetValueInput(node, 1);
if (arguments_length->opcode() != IrOpcode::kArgumentsLength) continue;
// If mapped arguments are specified, then their number is always equal to
// the number of formal parameters. This allows to use just the three-value
// {ArgumentsStateType} enum because the deoptimizer can reconstruct the
// value of {mapped_count} from the number of formal parameters.
DCHECK_IMPLIES(
mapped_count != 0,
mapped_count == FormalParameterCountOf(arguments_length->op()));
ArgumentsStateType type = IsRestLengthOf(arguments_length->op())
? ArgumentsStateType::kRestParameter
: (mapped_count == 0)
? ArgumentsStateType::kUnmappedArguments
: ArgumentsStateType::kMappedArguments;
Node* arguments_length_state = nullptr;
for (Edge edge : arguments_length->use_edges()) {
Node* use = edge.from();
switch (use->opcode()) {
case IrOpcode::kObjectState:
case IrOpcode::kTypedObjectState:
case IrOpcode::kStateValues:
case IrOpcode::kTypedStateValues:
if (!arguments_length_state) {
arguments_length_state = jsgraph()->graph()->NewNode(
jsgraph()->common()->ArgumentsLengthState(type));
NodeProperties::SetType(arguments_length_state,
Type::OtherInternal());
}
edge.UpdateTo(arguments_length_state);
break;
default:
break;
}
}
bool escaping_use = false;
ZoneVector<Node*> loads(zone());
for (Edge edge : node->use_edges()) {
Node* use = edge.from();
if (!NodeProperties::IsValueEdge(edge)) continue;
if (use->use_edges().empty()) {
// A node without uses is dead, so we don't have to care about it.
continue;
}
switch (use->opcode()) {
case IrOpcode::kStateValues:
case IrOpcode::kTypedStateValues:
case IrOpcode::kObjectState:
case IrOpcode::kTypedObjectState:
break;
case IrOpcode::kLoadElement:
if (mapped_count == 0) {
loads.push_back(use);
} else {
escaping_use = true;
}
break;
case IrOpcode::kLoadField:
if (FieldAccessOf(use->op()).offset == FixedArray::kLengthOffset) {
loads.push_back(use);
} else {
escaping_use = true;
}
break;
default:
// If the arguments elements node node is used by an unhandled node,
// then we cannot remove this allocation.
escaping_use = true;
break;
}
if (escaping_use) break;
}
if (!escaping_use) {
Node* arguments_elements_state = jsgraph()->graph()->NewNode(
jsgraph()->common()->ArgumentsElementsState(type));
NodeProperties::SetType(arguments_elements_state, Type::OtherInternal());
ReplaceWithValue(node, arguments_elements_state);
for (Node* load : loads) {
switch (load->opcode()) {
case IrOpcode::kLoadElement: {
Node* index = NodeProperties::GetValueInput(load, 1);
// {offset} is a reverted index starting from 1. The base address is
// adapted to allow offsets starting from 1.
Node* offset = jsgraph()->graph()->NewNode(
jsgraph()->simplified()->NumberSubtract(), arguments_length,
index);
NodeProperties::SetType(offset,
TypeCache::Get()->kArgumentsLengthType);
NodeProperties::ReplaceValueInput(load, arguments_frame, 0);
NodeProperties::ReplaceValueInput(load, offset, 1);
NodeProperties::ChangeOp(
load, jsgraph()->simplified()->LoadStackArgument());
break;
}
case IrOpcode::kLoadField: {
DCHECK_EQ(FieldAccessOf(load->op()).offset,
FixedArray::kLengthOffset);
Node* length = NodeProperties::GetValueInput(node, 1);
ReplaceWithValue(load, length);
break;
}
default:
UNREACHABLE();
}
}
}
}
}
Node* NodeHashCache::Query(Node* node) {
auto it = cache_.find(node);
if (it != cache_.end()) {
return *it;
} else {
return nullptr;
}
}
NodeHashCache::Constructor::Constructor(NodeHashCache* cache,
const Operator* op, int input_count,
Node** inputs, Type type)
: node_cache_(cache), from_(nullptr) {
if (node_cache_->temp_nodes_.size() > 0) {
tmp_ = node_cache_->temp_nodes_.back();
node_cache_->temp_nodes_.pop_back();
int tmp_input_count = tmp_->InputCount();
if (input_count <= tmp_input_count) {
tmp_->TrimInputCount(input_count);
}
for (int i = 0; i < input_count; ++i) {
if (i < tmp_input_count) {
tmp_->ReplaceInput(i, inputs[i]);
} else {
tmp_->AppendInput(node_cache_->graph_->zone(), inputs[i]);
}
}
NodeProperties::ChangeOp(tmp_, op);
} else {
tmp_ = node_cache_->graph_->NewNode(op, input_count, inputs);
}
NodeProperties::SetType(tmp_, type);
}
Node* NodeHashCache::Constructor::Get() {
DCHECK(tmp_ || from_);
Node* node;
if (!tmp_) {
node = node_cache_->Query(from_);
if (!node) node = from_;
} else {
node = node_cache_->Query(tmp_);
if (node) {
node_cache_->temp_nodes_.push_back(tmp_);
} else {
node = tmp_;
node_cache_->Insert(node);
}
}
tmp_ = from_ = nullptr;
return node;
}
Node* NodeHashCache::Constructor::MutableNode() {
DCHECK(tmp_ || from_);
if (!tmp_) {
if (node_cache_->temp_nodes_.empty()) {
tmp_ = node_cache_->graph_->CloneNode(from_);
} else {
tmp_ = node_cache_->temp_nodes_.back();
node_cache_->temp_nodes_.pop_back();
int from_input_count = from_->InputCount();
int tmp_input_count = tmp_->InputCount();
if (from_input_count <= tmp_input_count) {
tmp_->TrimInputCount(from_input_count);
}
for (int i = 0; i < from_input_count; ++i) {
if (i < tmp_input_count) {
tmp_->ReplaceInput(i, from_->InputAt(i));
} else {
tmp_->AppendInput(node_cache_->graph_->zone(), from_->InputAt(i));
}
}
NodeProperties::SetType(tmp_, NodeProperties::GetType(from_));
NodeProperties::ChangeOp(tmp_, from_->op());
}
}
return tmp_;
}
#undef TRACE
} // namespace compiler
} // namespace internal
} // namespace v8
```
|
```javascript
'use strict';
// This test is to assert that we can SIGINT a script which loops forever.
// Ref(http):
// groups.google.com/group/nodejs-dev/browse_thread/thread/e20f2f8df0296d3f
const common = require('../common');
const assert = require('assert');
const spawn = require('child_process').spawn;
console.log('start');
const c = spawn(process.execPath, ['-e', 'while(true) { console.log("hi"); }']);
let sentKill = false;
c.stdout.on('data', function(s) {
// Prevent race condition:
// Wait for the first bit of output from the child process
// so that we're sure that it's in the V8 event loop and not
// just in the startup phase of execution.
if (!sentKill) {
c.kill('SIGINT');
console.log('SIGINT infinite-loop.js');
sentKill = true;
}
});
c.on('exit', common.mustCall(function(code) {
assert.ok(code !== 0);
console.log('killed infinite-loop.js');
}));
process.on('exit', function() {
assert.ok(sentKill);
});
```
|
Bangladesh Bank () is the central bank of Bangladesh and is a member of the Asian Clearing Union. It is fully owned by the Government of Bangladesh.
The bank is active in developing green banking and financial inclusion policy and is an important member of the Alliance for Financial Inclusion. Bangladesh Financial Intelligence Unit (BFIU), a department of Bangladesh Bank, has got the membership of Egmont Group of Financial Intelligence Units.
Bangladesh Bank is the first central bank in the world to introduce a dedicated hotline (16236) for people to complain about any banking-related problem. Moreover, the organisation is the first central bank in the world to issue a "Green Banking Policy". To acknowledge this contribution, then-governor Dr. Atiur Rahman was given the title 'Green Governor' at the 2012 United Nations Climate Change Conference, held at the Qatar National Convention Centre in Doha.
History
On 7 April 1972, after the Independence War and the eventual independence of Bangladesh, the Government of Bangladesh passed the Bangladesh Bank Order, 1972 (P.O. No. 127 of 1972), reorganising the Dhaka branch of the State Bank of Pakistan as Bangladesh Bank, the country's central bank and apex regulatory body for the country's monetary and financial system.
The 1972 Mujib government pursued a pro-socialist agenda. In 1972, the government decided to nationalise all banks to channel funds to the public sector and to prioritise credit to those sectors that sought to reconstruct the war-torn country – mainly industry and agriculture. However, government control of the wrong sectors prevented these banks from functioning well. This was compounded by the fact that loans were handed out to the public sector without commercial considerations; banks had poor capital lease, provided poor customer service and lacked all market-based monetary instruments. Because loans were given out without commercial considerations, and because they took a long time to call a non-performing loan, and once they did, recovery under the erstwhile judicial system was so expensive, loan recovery was abysmally poor. While the government made a point of intervening everywhere, it did not set up a proper regulatory system to diagnose such problems and correct them. Hence, banking concepts like profitability and liquidity were alien to bank managers, and capital adequacy took a backseat.
In 1982, the first reform program was initiated, wherein the government denationalised two of the six nationalised commercial banks and permitted private local banks to compete in the banking sector. In 1986, a National Commission on Money, Banking and Credit was appointed to deal with the problems of the banking sector, and a number of steps were taken for the recovery targets for the nationalised commercial banks and development financial institutions and prohibiting defaulters from getting new loans. Yet the efficiency of the banking sector could not be improved.
The Financial Sector Adjustment Credit (FSAC) and Financial Sector Reform Programme (FSRP) were formed in 1990, upon contracts with the World Bank. These programs sought to remove government distortions and lessen the financial repression. Policies made use of the McKinnon-Shaw hypothesis, which stated that removing distortions augments efficiency in the credit market and increases competition. The policies therefore involved banks providing loans on a commercial basis, enhancing bank efficiency and limiting government control to monetary policy only. FSRP forced banks to have a minimum capital adequacy, to systematically classify loans and to implement modern computerised systems, including those that handle accounting. It forced the central bank to free up interest rates, revise financial laws and increase supervision in the credit market. The government also developed the capital market, which was also performing poorly.
FSRP expired in 1996. Afterwards, the Government of Bangladesh formed a Bank Reform Committee (BRC), whose recommendations were largely unaddressed by the then-government.
At present it has ten offices located at Motijheel, Sadarghat, Chittagong, Khulna, Bogra, Rajshahi, Sylhet, Barisal, Rangpur and Mymensingh in Bangladesh; total manpower stood at 5807 (officials 3981, subordinate staff 1826) as of 31 March 2015.
Branch offices
Functions
The Bangladesh Bank performs all the functions that a central bank in any country is expected to perform. Such functions include maintaining price stability through economic and monetary policy measures, managing the country's foreign exchange and gold reserve, and regulating the banking sector of the country. Like all other central banks, Bangladesh Bank is both the government's banker and the banker's bank, a "lender of last resort". Bangladesh Bank, like most other central banks, exercises a monopoly over the issue of currency and banknotes. Except for the one, two, and five taka notes and coins which are the responsibility of the Ministry of Finance of the Government of Bangladesh.
The major functional areas include :
Formulation and implementation of monetary and credit policies.
Regulation and supervision of banks and non-bank financial institutions, promotion and development of domestic financial markets.
Management of the country's international reserves.
Issuance of currency notes.
Regulation and supervision of the payment system.
Acting as banker to the government .
Money laundering prevention.
Collection and furnishing of credit information.
Implementation of the Foreign Exchange Regulation Act.
Managing a deposit insurance scheme .
Organisation
The bank's highest official is the governor (currently Abdur Rouf Talukder). His seat is in Motijheel, Dhaka. The governor chairs the board of directors. The executive staff, also headed by the governor, is responsible for the bank's day-to-day affairs.
Bangladesh Bank also has a number of departments under it, namely Debt Management, Law, and so on, each headed by one or more general managers. The Bank has 10 physical branches: Mymensingh, Motijheel, Sadarghat, Barisal, Khulna, Sylhet, Bogra, Rajshahi, Rangpur and Chittagong; each is headed by an executive director. Headquarters are located in the Bangladesh Bank Building in Motijheel, which has two general managers.
Hierarchy
The executive staff is responsible for daily affairs, and includes the governor and four deputy governors. Under the governors, there are executive directors and an economic advisor.
The general managers of the departments come under the executive directors, and are not part of the executive staff.
The four deputy governors are:
Ahmed Jamal,
Kazi Sayedur Rahman,
A.K.M. Sajedur Rahman Khan and
Abu Farah Md. Nasser
.
Board of directors
The board of directors consists of the bank's governor and eight other members. They are responsible for the policies undertaken by the bank.
Publications of Bangladesh Bank
Bangladesh Bank publishes a range of periodical publications, research papers, and reports that contain monetary and banking developments, economic reviews, as well as various other statistical data. These include:
Annual Report
Bangladesh Bank Quarterly
Monetary Policy Review
CSR Initiatives in Banks
BBTA Journal : Thoughts on Banking and Finance
Annual Report on Green Banking
Import Payments
Financial Stability Assessment Report
Governors
Since its conception, the Bangladesh Bank has had 12 governors:
Bangladesh Bank Award
Bangladesh Bank Award is introduced in 2000.
The winners are:
Rehman Sobhan (2000)
Nurul Islam (2009)
Mosharraf Hossain (2011)
Muzaffar Ahmed and Swadesh Ranjan Bose (2013)
Azizur Rahman Khan and Mahbub Hossain (2017)
Wahiduddin Mahmud (2020)
See also
Bangladesh Bank Taka Museum
Bangladesh Bank robbery
Economy of Bangladesh
References
External links
Bangladesh Bank Facebook Page
Banks Information BD All Banks information in Bangladesh
Bangladesh
Economy of Bangladesh
Banks of Bangladesh
Banks of Bangladesh with Islamic banking services
Banks established in 1971
Bangladeshi companies established in 1971
Government agencies of Bangladesh
Organisations based in Motijheel
|
Events from the year 1776 in Great Britain.
Incumbents
Monarch – George III
Prime Minister – Frederick North, Lord North (Tory)
Parliament – 14th
Events
10 January – American Revolution: Thomas Paine publishes his pamphlet Common Sense "written by an Englishman" in Philadelphia arguing for independence from British rule in the Thirteen Colonies.
27 February – American Revolution: at the Battle of Moore's Creek Bridge, Scottish American Loyalists are defeated by North Carolina Patriots.
2–3 March – American Revolution:
Battle of Nassau: The American Continental Navy and Marines make a successful assault on Nassau, Bahamas.
Battle of the Rice Boats: American Patriots resist the Royal Navy on the Savannah River. British control over the Province of Georgia is lost.
9 March – economist Adam Smith publishes The Wealth of Nations.
17 March – American Revolution: British forces evacuate Boston, Massachusetts, after George Washington commands the placement of artillery overlooking the city at Dorchester Heights, ending the 11‑month Siege of Boston.
12 April – American Revolution: The Royal Colony of North Carolina produces the Halifax Resolves, making it the first British colony officially to authorize its Continental Congress delegates to vote for independence from Great Britain.
4 May – American Revolution: Rhode Island becomes the first American colony to renounce allegiance to George III.
15–26 May – American Revolution: Battle of The Cedars – British forces skirmish with the American Continental Army around Les Cèdres, Quebec.
23 May – first purpose-built Freemasons' Hall in England opened in London to a design by Thomas Sandby.
8 June – American Revolution: Battle of Trois-Rivières – the invading American Continental Army is driven back at Trois-Rivières, Quebec.
29 June – American Revolution: Battle of Turtle Gut Inlet – the American Continental Navy successfully challenges the Royal Navy blockade off New Jersey.
4 July – American Revolution: United States Declaration of Independence – the Second Continental Congress meeting in Philadelphia ratifies the declaration by the United States of its independence from the Kingdom of Great Britain.
12 July – Captain James Cook sets off from Plymouth in HMS Resolution on his third voyage, to the Pacific Ocean and Arctic, which will be fatal.
27 August – American Revolution: At the Battle of Long Island Washington's troops are routed in Brooklyn by British under William Howe.
11 September – American Revolution: abortive peace conference between British and Americans on Staten Island.
15 September – American Revolution: Landing at Kip's Bay – British troops land on Manhattan at Kips Bay.
16 September – American Revolution: Battle of Harlem Heights – the Continental Army under Washington are victorious against the British on Manhattan.
24 September – first running of the St. Leger Stakes horse race (not yet named), first of the British Classic Races, devised by Anthony St Leger, on Cantley Common at Doncaster. The winner is a filly (later named Allabaculia) owned by the organiser, the 2nd Marquess of Rockingham.
11 October – American Revolution: Battle of Valcour Island – on Lake Champlain near Valcour Island, a British fleet led by Sir Guy Carleton defeats 15 American gunboats commanded by Brigadier General Benedict Arnold. Although nearly all of Arnold's ships are destroyed, the defense of Lake Champlain prevents a further British advance toward Albany, New York.
18 October – American Revolution: Battle of Pell's Point – troops of the American Continental Army resist a British and Hessian force in The Bronx.
28 October – American Revolution: Battle of White Plains – British forces arrive at White Plains, attack and capture Chatterton Hill from the Continental Army.
16 November – American Revolution: Battle of Fort Washington – Hessian forces under Lieutenant General Wilhelm von Knyphausen capture Fort Washington in New York from the Continental Army.
20 November – American Revolution: Fort Lee in New Jersey is captured by the British forces.
26 December – American Revolution: The Continental Army led by Washington defeats a Hessian brigade at the Battle of Trenton.
Undated – Member of Parliament David Hartley unsuccessfully introduces a motion to the House of Commons calling for the abolition of slavery.
Publications
The first volume of Edward Gibbon's The History of the Decline and Fall of the Roman Empire.
Adam Smith's The Wealth of Nations.
Augustus Toplady's hymn "Rock of Ages" (final versions, in The Gospel Magazine, March, and his Psalms and Hymns for Public and Private Worship, July).
William Withering's The botanical arrangement of all the vegetables naturally growing in Great Britain, the first flora in English based on Linnaean taxonomy.
Approximate date – folk song "The Lincolnshire Poacher" (first printed edition).
Births
10 January – George Birkbeck, doctor, academic and philanthropist (died 1841)
16 January – Richard Onslow, archdeacon (died 1849)
17 January (baptism date) – Jane Porter, novelist (died 1850)
23 January – Howard Douglas, army general (died 1861)
12 February – Richard Mant, writer and cleric (died 1848)
16 February – Abraham Raimbach, engraver (died 1843)
23 February
John Walter, newspaper editor (died 1847)
Heneage Horsley, Scottish Episcopal dean (died 1847)
25 February – George William Tighe, expatriate (died 1837)
9 March – Thomas Evans, army general (died 1863)
12 March – Lady Hester Stanhope, archaeologist (died 1839)
20 March – Richard Temple-Nugent-Brydges-Chandos-Grenville, 1st Duke of Buckingham and Chandos, politician (died 1839)
23 March – Robert Eden Duncombe Shafto, politician (died 1848)
11 April – Macvey Napier, lawyer and encyclopedia editor (died 1847)
12 April – Henry Hobhouse, archivist (died 1854)
20 April
William Weston Young, Quaker businessman (died 1847)
25 April
Princess Mary, Duchess of Gloucester and Edinburgh, member of the royal family (died 1857)
Edward Solly, merchant and art collector (died 1844)
28 April – Charles Bennet, 5th Earl of Tankerville, politician (died 1859)
6 May – Stephen Rumbold Lushington, politician and administrator in British India (died 1868)
8 May – Edward Leveson-Gower, admiral (died 1853)
10 May – George Thomas Smart, musician (died 1867)
8 June – Thomas Rickman, architect and architectural antiquary (died 1841)
11 June – John Constable, landscape painter (died 1837)
21 June
Charles Horsfall, merchant and politician (died 1846)
William Wadd, surgeon and medical author (died 1829)
28 June – Charles Mathews, actor (died 1835)
3 July – Henry Parnell, 1st Baron Congleton, Anglo-Irish politician (died 1842)
18 July – John Struthers, Scottish poet (died 1853)
22 July – Etheldred Benett, geologist (died 1845)
30 July – Sir Edward Kerrison, 1st Baronet, army general (died 1853)
2 August – Thomas Assheton Smith II, landowner and sportsman (died 1858)
12 August – David Erskine, 2nd Baron Erskine, politician (died 1855)
18 August
Thomas Howard, 16th Earl of Suffolk, noble (died 1851)
Sir Robert Newman, 1st Baronet, politician (died 1848)
25 August – Thomas Bladen Capel, admiral (died 1853)
11 September – Thomas Arbuthnot, army general (died 1849)
18 September – Thomas Gleadowe-Newcomen, 2nd Viscount Newcomen, politician (died 1825)
21 September – John Fitchett, epic poet (died 1838)
6 October
James Duff, 4th Earl Fife, Scottish army general in Spanish service (died 1857)
James Stuart-Wortley, 1st Baron Wharncliffe, politician (died 1845)
13 October
Peter Barlow, mathematician (died 1862)
John Gibb, Scottish civil engineering contractor (died 1850)
14 October – Robert Townsend Farquhar, colonial administrator (died 1830)
20 October – John Rolls of The Hendre, judge (died 1837)
22 October – Edward Draper, army officer and colonial administrator (died 1841)
7 November – James Abercromby, 1st Baron Dunfermline, politician (died 1858)
10 November – Henry Seymour (Knoyle), politician (died 1849)
15 November – Aaron Manby, ironmaster and civil engineer (died 1850)
16 November – Mary Matilda Betham, diarist, scholar and poet (died 1852)
30 November – Bartholomew Frere, diplomat (died 1851)
12 December – Nicholas Conyngham Tindal, lawyer and politician (died 1846)
19 December – Lord Robert Somerset, army general (died 1842)
Deaths
2 February – Francis Hayman, painter and illustrator (born 1708)
24 March – John Harrison, clockmaker (born 1693)
29 April – Edward Wortley Montagu, traveller and writer (born 1713)
13 June – William Battie, psychiatrist (born 1703 or 1704)
20 June – Benjamin Huntsman, inventor and manufacturer (born 1704)
7 July – Jeremiah Markland, classical scholar (born 1693)
17 July – Harriet Pelham-Holles, Duchess of Newcastle-upon-Tyne, widow of the Prime Minister (born 1701)
25 August – David Hume, Scottish philosopher (born 1711)
17 November – James Ferguson, Scottish astronomer (born 1710)
See also
1776 in Wales
References
Further reading
Years in Great Britain
1776 by country
1776 in Europe
1770s in Great Britain
|
Mari Albert Johan van Manen (Nijmegen, 16 April 1877 – Kolkata, 17 March 1943) was a Dutch orientalist and the first Dutch Tibetologist. A large portion of his collected manuscripts and art and ethnographic projects now make up the Van Manen collection at Leiden University's Kern Institute.
Career
Beginning in 1908 he resided at the Theosophical Society headquarters in Adyar, near Chennai, India, and worked as the secretary of C. W. Leadbeater. In 1908 he was appointed as assistant librarian at the Adyar Library.
in 1916-18 he moved lived in Ghoom in the Darjeeling Himalayan hill region of northeastern India and studied Tibetan culture and language.
From 1919 until his death in 1943 he lived in Calcutta, working first as librarian for the Imperial Library and then as an assistant in the Indian Museum, as the General Secretary of the Royal Asiatic Society of Bengal, and finally, during the Second World War, as an official in the censor's office.
He died on 17 March 1943.
References
Further reading
Peter Richardus, The Dutch Orientalist Johan van Manen: His Life and Work, Leiden: The Kern Institure, 1989
External links
Van Manen, Johan at Theospophy World
Tibetologists
People from Nijmegen
1877 births
1943 deaths
Dutch orientalists
|
```javascript
Using the double tilde `~~`
Setting the length of an array
`NaN` is a number
Avoid using `with`
Detect **DO NOT TRACK** status
```
|
```python
import email.utils
import mimetypes
from .packages import six
def guess_content_type(filename, default='application/octet-stream'):
"""
Guess the "Content-Type" of a file.
:param filename:
The filename to guess the "Content-Type" of using :mod:`mimetypes`.
:param default:
If no "Content-Type" can be guessed, default to `default`.
"""
if filename:
return mimetypes.guess_type(filename)[0] or default
return default
def format_header_param(name, value):
"""
Helper function to format and quote a single header parameter.
Particularly useful for header parameters which might contain
non-ASCII values, like file names. This follows RFC 2231, as
suggested by RFC 2388 Section 4.4.
:param name:
The name of the parameter, a string expected to be ASCII only.
:param value:
The value of the parameter, provided as a unicode string.
"""
if not any(ch in value for ch in '"\\\r\n'):
result = '%s="%s"' % (name, value)
try:
result.encode('ascii')
except UnicodeEncodeError:
pass
else:
return result
if not six.PY3: # Python 2:
value = value.encode('utf-8')
value = email.utils.encode_rfc2231(value, 'utf-8')
value = '%s*=%s' % (name, value)
return value
class RequestField(object):
"""
A data container for request body parameters.
:param name:
The name of this request field.
:param data:
The data/value body.
:param filename:
An optional filename of the request field.
:param headers:
An optional dict-like object of headers to initially use for the field.
"""
def __init__(self, name, data, filename=None, headers=None):
self._name = name
self._filename = filename
self.data = data
self.headers = {}
if headers:
self.headers = dict(headers)
@classmethod
def from_tuples(cls, fieldname, value):
"""
A :class:`~urllib3.fields.RequestField` factory from old-style tuple parameters.
Supports constructing :class:`~urllib3.fields.RequestField` from
parameter of key/value strings AND key/filetuple. A filetuple is a
(filename, data, MIME type) tuple where the MIME type is optional.
For example::
'foo': 'bar',
'fakefile': ('foofile.txt', 'contents of foofile'),
'realfile': ('barfile.txt', open('realfile').read()),
'typedfile': ('bazfile.bin', open('bazfile').read(), 'image/jpeg'),
'nonamefile': 'contents of nonamefile field',
Field names and filenames must be unicode.
"""
if isinstance(value, tuple):
if len(value) == 3:
filename, data, content_type = value
else:
filename, data = value
content_type = guess_content_type(filename)
else:
filename = None
content_type = None
data = value
request_param = cls(fieldname, data, filename=filename)
request_param.make_multipart(content_type=content_type)
return request_param
def _render_part(self, name, value):
"""
Overridable helper function to format a single header parameter.
:param name:
The name of the parameter, a string expected to be ASCII only.
:param value:
The value of the parameter, provided as a unicode string.
"""
return format_header_param(name, value)
def _render_parts(self, header_parts):
"""
Helper function to format and quote a single header.
Useful for single headers that are composed of multiple items. E.g.,
'Content-Disposition' fields.
:param header_parts:
A sequence of (k, v) typles or a :class:`dict` of (k, v) to format
as `k1="v1"; k2="v2"; ...`.
"""
parts = []
iterable = header_parts
if isinstance(header_parts, dict):
iterable = header_parts.items()
for name, value in iterable:
if value:
parts.append(self._render_part(name, value))
return '; '.join(parts)
def render_headers(self):
"""
Renders the headers for this request field.
"""
lines = []
sort_keys = ['Content-Disposition', 'Content-Type', 'Content-Location']
for sort_key in sort_keys:
if self.headers.get(sort_key, False):
lines.append('%s: %s' % (sort_key, self.headers[sort_key]))
for header_name, header_value in self.headers.items():
if header_name not in sort_keys:
if header_value:
lines.append('%s: %s' % (header_name, header_value))
lines.append('\r\n')
return '\r\n'.join(lines)
def make_multipart(self, content_disposition=None, content_type=None,
content_location=None):
"""
Makes this request field into a multipart request field.
This method overrides "Content-Disposition", "Content-Type" and
"Content-Location" headers to the request parameter.
:param content_type:
The 'Content-Type' of the request body.
:param content_location:
The 'Content-Location' of the request body.
"""
self.headers['Content-Disposition'] = content_disposition or 'form-data'
self.headers['Content-Disposition'] += '; '.join([
'', self._render_parts(
(('name', self._name), ('filename', self._filename))
)
])
self.headers['Content-Type'] = content_type
self.headers['Content-Location'] = content_location
```
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
// MODULES //
var addon = require( './../src/addon.node' );
// MAIN //
/**
* Computes the complete elliptic integral of the first kind.
*
* @private
* @param {number} m - input value
* @returns {number} evaluated elliptic integral
*
* @example
* var v = ellipk( 0.5 );
* // returns ~1.854
*
* v = ellipk( 2.0 );
* // returns NaN
*
* v = ellipk( -1.0 );
* // returns ~1.311
*
* v = ellipk( Infinity );
* // returns NaN
*
* v = ellipk( -Infinity );
* // returns NaN
*
* v = ellipk( NaN );
* // returns NaN
*/
function ellipk( m ) {
return addon( m );
}
// EXPORTS //
module.exports = ellipk;
```
|
```java
package com.yahoo.searchlib.expression;
import com.yahoo.vespa.objects.Deserializer;
import com.yahoo.vespa.objects.ObjectVisitor;
import com.yahoo.vespa.objects.Serializer;
/**
* This function is an instruction to negate its argument.
*
* @author baldersheim
* @author Simon Thoresen Hult
*/
public class MathFunctionNode extends MultiArgFunctionNode {
// Make sure these match the definition in c++ searchlib/src/searchlib/expression/mathfunctionnode.h.
public static enum Function {
EXP(0),
POW(1),
LOG(2),
LOG1P(3),
LOG10(4),
SIN(5),
ASIN(6),
COS(7),
ACOS(8),
TAN(9),
ATAN(10),
SQRT(11),
SINH(12),
ASINH(13),
COSH(14),
ACOSH(15),
TANH(16),
ATANH(17),
CBRT(18),
HYPOT(19),
FLOOR(20);
private final int id;
private Function(int id) {
this.id = id;
}
private static Function valueOf(int id) {
for (Function fnc : values()) {
if (id == fnc.id) {
return fnc;
}
}
return null;
}
}
public static final int classId = registerClass(0x4000 + 136, MathFunctionNode.class, MathFunctionNode::new);
private Function fnc;
public MathFunctionNode() {
this(Function.LOG);
}
public MathFunctionNode(Function fnc) {
this(null, fnc);
}
public MathFunctionNode(ExpressionNode exp, Function fnc) {
this.fnc = fnc;
if (exp != null) {
addArg(exp);
}
}
@Override
protected boolean onExecute() {
getArg(0).execute();
double result = switch (fnc) {
case EXP -> Math.exp(getArg(0).getResult().getFloat());
case POW -> Math.pow(getArg(0).getResult().getFloat(), getArg(1).getResult().getFloat());
case LOG -> Math.log(getArg(0).getResult().getFloat());
case LOG1P -> Math.log1p(getArg(0).getResult().getFloat());
case LOG10 -> Math.log10(getArg(0).getResult().getFloat());
case SIN -> Math.sin(getArg(0).getResult().getFloat());
case ASIN -> Math.asin(getArg(0).getResult().getFloat());
case COS -> Math.cos(getArg(0).getResult().getFloat());
case ACOS -> Math.acos(getArg(0).getResult().getFloat());
case TAN -> Math.tan(getArg(0).getResult().getFloat());
case ATAN -> Math.atan(getArg(0).getResult().getFloat());
case SQRT -> Math.sqrt(getArg(0).getResult().getFloat());
case SINH -> Math.sinh(getArg(0).getResult().getFloat());
case ASINH -> throw new IllegalArgumentException("Inverse hyperbolic sine(asinh) is not supported in java");
case COSH -> Math.cosh(getArg(0).getResult().getFloat());
case ACOSH ->
throw new IllegalArgumentException("Inverse hyperbolic cosine (acosh) is not supported in java");
case TANH -> Math.tanh(getArg(0).getResult().getFloat());
case ATANH ->
throw new IllegalArgumentException("Inverse hyperbolic tangents (atanh) is not supported in java");
case FLOOR -> Math.floor(getArg(0).getResult().getFloat());
case CBRT -> Math.cbrt(getArg(0).getResult().getFloat());
case HYPOT -> Math.hypot(getArg(0).getResult().getFloat(), getArg(1).getResult().getFloat());
};
((FloatResultNode)getResult()).setValue(result);
return true;
}
@Override
public void onPrepareResult() {
setResult(new FloatResultNode());
}
@Override
protected int onGetClassId() {
return classId;
}
@Override
protected void onSerialize(Serializer buf) {
super.onSerialize(buf);
buf.putByte(null, (byte)fnc.id);
}
@Override
protected void onDeserialize(Deserializer buf) {
super.onDeserialize(buf);
int b = buf.getByte(null);
fnc = Function.valueOf(b & 0xff);
}
@Override
protected boolean equalsMultiArgFunction(MultiArgFunctionNode obj) {
return fnc == ((MathFunctionNode)obj).fnc;
}
@Override
public MathFunctionNode clone() {
MathFunctionNode obj = (MathFunctionNode)super.clone();
obj.fnc = fnc;
return obj;
}
@Override
public void visitMembers(ObjectVisitor visitor) {
super.visitMembers(visitor);
visitor.visit("function", fnc);
}
}
```
|
```javascript
'use strict';
const home = require('../home.js');
module.exports = function (stamp) {
return {
allow: home(stamp),
note: 'seems not compatible with freebsd network headers',
};
};
```
|
Niagara Central Dorothy Rungeling Airport or Welland/Niagara Central Dorothy Rungeling Aerodrome, , is a registered aerodrome located in Pelham, west of Welland, Ontario, Canada. Niagara Central accommodates a flight school, skydivers, aerial photographers, itinerant light aircraft and an automatic weather station. It was built in 1940 by the Royal Canadian Air Force as part of the British Commonwealth Air Training Plan and served as the relief airfield for the No. 6 Service Flying Training School in nearby Dunnville.
The airport is the home of the 87th Eagle Squadron of the Royal Canadian Air Cadets who have training and administration space in the airport's former meeting place of Welland Fire Company Number 1. The Southern Ontario Gliding Centre (SOGC) of the Royal Canadian Air Cadets also use the airport for spring and fall familiarization flights for the cadets.
In 1995, various members of Fonthill Branch 613 of the Royal Canadian Legion lobbied to have the airport renamed "Bud Kerr Welland Airport" in recognition of a local World War II Spitfire fighter pilot, but were unsuccessful. In 2015 the airport was renamed Niagara Central Dorothy Rungeling Airport, in honour of the legendary Canadian pilot Dorothy Rungeling, CM.
See also
St. Catharines/Niagara District Airport
Niagara Falls/Niagara South Airport
References
External links
Page about this airport on COPA's Places to Fly airport directory
Official website, see About Us for history
Niagara Skydive, major tenant
St. Catharines Flying Club, major tenant
Registered aerodromes in Ontario
Transport in Welland
Royal Canadian Air Force stations
Military airbases in Ontario
Airports of the British Commonwealth Air Training Plan
Military history of Ontario
1940 establishments in Ontario
|
```javascript
declare export default var a: number
```
|
```javascript
/*
*
*/
import React from "react";
import { createRoot } from "react-dom/client";
import { hashHistory, Route, Switch, HashRouter } from "react-router-dom";
import Scroll from "react-scroll";
import { StickyContainer } from "react-sticky";
import { ThemeProvider } from "@material-ui/styles";
import Grid from "@material-ui/core/Grid";
import { common } from "@material-ui/core/colors";
import MenuBar from "./components/menubar";
import Docs from "./components/docs";
import theme from "./components/megadrafttheme";
import Example from "./components/example";
import Header from "./components/header";
import { highlightCode } from "./components/highlightCode";
import LetsRockArrow from "./components/icons/arrow-down";
import ToggleButton from "./components/toggleButton";
const LinkScroll = Scroll.Link;
const scroller = Scroll.scroller;
class Page extends React.Component {
constructor(props) {
super(props);
this.state = {
content: true
};
}
componentDidMount() {
highlightCode(this);
}
componentDidUpdate() {
highlightCode(this);
scroller.scrollTo("appbar", { duration: 300 });
}
handleClick = () => {
if (this.state.content) {
highlightCode(this);
this.setState({
content: !this.state.content
});
} else {
highlightCode(this);
this.setState({
content: !this.state.content
});
}
};
render() {
const { content } = this.state;
const menuBarBackground = content ? common.white : common.black;
const toggleButtonColor = content ? "inherit" : "yellow";
const toggleButtonContent = content ? "VIEW CONTENT JSON" : "EDITOR";
const exampleBlockClassName = content ? "" : "container--dark";
return (
<ThemeProvider theme={theme}>
<Header />
<StickyContainer>
<LinkScroll
className="hero__call-to-action"
to="appbar"
spy={true}
smooth={true}
duration={600}
>
LET'S ROCK
<div className="hero__arrow-call-to-action">
<LetsRockArrow />
</div>
</LinkScroll>
<MenuBar showLeft={!!content} background={menuBarBackground}>
<Grid container justify="flex-end">
<ToggleButton
onClick={this.handleClick}
color={toggleButtonColor}
>
{toggleButtonContent}
</ToggleButton>
</Grid>
</MenuBar>
<div className={exampleBlockClassName}>
<Example activeContent={content} />
</div>
</StickyContainer>
</ThemeProvider>
);
}
}
const root = createRoot(document.getElementById("react-container"));
root.render(
<HashRouter history={hashHistory}>
<Switch>
<Route path="/docs/:doc" component={Docs} />
<Route path="/" component={Page} exact />
</Switch>
</HashRouter>
);
/* global hljs */
hljs.initHighlightingOnLoad();
if (process.env.NODE_ENV === "production") {
(function(i, s, o, g, r, a, m) {
i["GoogleAnalyticsObject"] = r;
(i[r] =
i[r] ||
function() {
(i[r].q = i[r].q || []).push(arguments);
}),
(i[r].l = 1 * new Date());
(a = s.createElement(o)), (m = s.getElementsByTagName(o)[0]);
a.async = 1;
a.src = g;
m.parentNode.insertBefore(a, m);
})(
window,
document,
"script",
"path_to_url",
"ga"
);
/* global ga */
ga("create", "UA-77313227-1", "auto");
ga("send", "pageview");
}
```
|
```shell
## our_shell: ysh
## oils_failures_allowed: 1
#### Local place
# Work around stdin buffering issue with read --line
#
# The framework test/sh_spec.py uses echo "$code_string" | $SH
#
# But then we have TWO different values of file descriptor 0 (stdin)
#
# - the pipe with the code
# - the pipe created in th shell for echo zzz | read --line
#
# Shells read one line at a time, but read --line explicitly avoids this.
#
# TODO: I wonder if we should consider outlawing read --line when stdin has code
# Only allow it for:
#
# $SH -c 'echo hi'
# $SH myscript.sh
#
# There could be a warning like read --line --no-fighting or something.
cat >tmp.sh <<'EOF'
func f(place) {
var x = 'f'
echo zzz | read --all (place)
echo "f x=$x"
}
func fillPlace(place) {
var x = 'fillPlace'
call f(place)
echo "fillPlace x=$x"
}
proc p {
var x = 'hi'
call fillPlace(&x)
echo "p x=$x"
}
x=global
p
echo "global x=$x"
EOF
$SH tmp.sh
## STDOUT:
f x=f
fillPlace x=fillPlace
p x=zzz
global x=global
## END
#### place->setValue()
func f(place) {
var x = 'f'
call place->setValue('zzz')
echo "f x=$x"
}
func fillPlace(place) {
var x = 'fillPlace'
call f(place)
echo "fillPlace x=$x"
}
proc p {
var x = 'hi'
call fillPlace(&x)
echo "p x=$x"
}
x=global
p
echo "global x=$x"
## STDOUT:
f x=f
fillPlace x=fillPlace
p x=zzz
global x=global
## END
#### Places can't dangle; they should be passed UP the stakc only
func f() {
var f_local = null
return (&f_local)
}
func g() {
# This place is now INVALID!
var place = f()
# Should fail when we try to use the place
echo zzz | read --all (place)
# This should also fail
# call place->setValue('zzz')
}
call g()
echo done
## status: 1
## STDOUT:
## END
#### Container Place (Dict)
var d = {key: 'hi'}
echo zzz | read --all (&d.key)
# I guess this works
echo newkey | read --all (&d.newkey)
echo key=$[d.key]
echo key=$[d.newkey]
## STDOUT:
## END
```
|
```xml
<dict>
<key>LayoutID</key>
<integer>16</integer>
<key>PathMapRef</key>
<array>
<dict>
<key>CodecID</key>
<array>
<integer>283902550</integer>
</array>
<key>Headphone</key>
<dict>
<key>DefaultVolume</key>
<integer>4292870144</integer>
<key>Headset_dBV</key>
<integer>3239051264</integer>
</dict>
<key>Inputs</key>
<array>
<string>Mic</string>
<string>LineIn</string>
</array>
<key>IntSpeaker</key>
<dict>
<key>AmpPostDelay</key>
<integer>100</integer>
<key>AmpPreDelay</key>
<integer>100</integer>
<key>MaximumBootBeepValue</key>
<integer>64</integer>
<key>SignalProcessing</key>
<dict>
<key>SoftwareDSP</key>
<dict>
<key>DspFunction0</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>0</integer>
<key>DspFuncName</key>
<string>DspEqualization32</string>
<key>DspFuncProcessingIndex</key>
<integer>0</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>9</key>
<integer>0</integer>
<key>Filter</key>
<array>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1111497458</integer>
<key>7</key>
<integer>1060439283</integer>
<key>8</key>
<integer>-1069504319</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>1</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1113739479</integer>
<key>7</key>
<integer>1060439283</integer>
<key>8</key>
<integer>-1069504319</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>2</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1107617038</integer>
<key>7</key>
<integer>1060439283</integer>
<key>8</key>
<integer>-1069504319</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>3</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1102074071</integer>
<key>7</key>
<integer>1060439283</integer>
<key>8</key>
<integer>-1069504319</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>4</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1130904737</integer>
<key>7</key>
<integer>1095839619</integer>
<key>8</key>
<integer>-1061325794</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>9</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134497726</integer>
<key>7</key>
<integer>1087084869</integer>
<key>8</key>
<integer>-1072785033</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>24</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>6</integer>
<key>6</key>
<integer>1183030795</integer>
<key>7</key>
<integer>1107740340</integer>
<key>8</key>
<integer>0</integer>
</dict>
</array>
</dict>
<key>PatchbayInfo</key>
<dict/>
</dict>
<key>DspFunction1</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>1</integer>
<key>DspFuncName</key>
<string>DspVirtualization</string>
<key>DspFuncProcessingIndex</key>
<integer>1</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>10</key>
<integer>0</integer>
<key>11</key>
<integer>1</integer>
<key>12</key>
<integer>-1060850508</integer>
<key>13</key>
<integer>-1039948378</integer>
<key>14</key>
<integer>10</integer>
<key>15</key>
<integer>210</integer>
<key>16</key>
<integer>-1047049396</integer>
<key>17</key>
<integer>5</integer>
<key>18</key>
<integer>182</integer>
<key>19</key>
<integer>418</integer>
<key>2</key>
<integer>0</integer>
<key>20</key>
<integer>-1051567526</integer>
<key>21</key>
<integer>3</integer>
<key>22</key>
<integer>1633</integer>
<key>23</key>
<integer>4033</integer>
<key>24</key>
<integer>-1047697047</integer>
<key>25</key>
<integer>4003</integer>
<key>26</key>
<integer>9246</integer>
<key>27</key>
<integer>153</integer>
<key>28</key>
<integer>1061393299</integer>
<key>29</key>
<integer>0</integer>
<key>3</key>
<integer>-1076949235</integer>
<key>30</key>
<integer>-1048128813</integer>
<key>31</key>
<integer>982552730</integer>
<key>32</key>
<integer>16</integer>
<key>33</key>
<integer>-1063441106</integer>
<key>34</key>
<integer>1008902816</integer>
<key>35</key>
<integer>4</integer>
<key>36</key>
<integer>-1059986974</integer>
<key>37</key>
<integer>0</integer>
<key>38</key>
<integer>234</integer>
<key>39</key>
<integer>1</integer>
<key>4</key>
<integer>-1094466626</integer>
<key>40</key>
<integer>-1047912930</integer>
<key>41</key>
<integer>1022423360</integer>
<key>42</key>
<integer>0</integer>
<key>43</key>
<data>your_sha512_hash/PoLzKPoE9VliZvVAiGD1DUa692FG0PaD8kb1s7dW8Cvd1P4AH1rx9+your_sha256_hasheu8wK0EvN4bnzwcZ4o8XuerPN1Lhzk6gfk7OnQgvG5lGrzURc+8ogiRvJL8ELwRvBg8qQGUPM4QWzzNMaQ7QlzSu3iKYbsKSbK7kk/tuhTxlruJRKu6DVSwORAuiLrWfoA6Hp+your_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashAAAAAAAAAAAAAAAAAAAAAAACasrC7Y0/Tu/+3lLv0l7I5r0STO4dM6DtPRRM8zbj/O+Y2ijtWlU67mDwmvK2+GLyKIpu7Sp34um8TZDkTvp+7UZuaOWcGRTrf22i7D3MfPOY9aTyK8oA94CaQPc3Y2z0d9Ik+N3BQPv60hz28u6M975E8PZYjDT2eVgk9Xp1GPfiKqz3S4U49E7QoPZLzJj3+XNg8D5bCPMiRlTyuLAM9dBEcPTXIDT0m1xE9o7/NPE+Cazye/qw7Xhdjuyen1LtqMOG7/Eo9uxlBXDt1St07kpvdO/gnTjt2Fp+your_sha256_hash7lxMiOe/WVDsBH407KMBOO9ILWDn1ciO7L+CmuyDt3bue4My7DhNpu0im9jqJ+8E7SMSkOz/fcTuD/q46618ZO3WrlDvWWeQ6c5P0O7L/zjvkHyw8jTzBO4rc27wJi9C8CA22vV/your_sha256_hashn3rzvEbC8mcWGvHkexLz8tKu86dpLvOicNbzF2eK7zCAvu2TPYTpu+pw7oyjHO5aduDv60iA7afr8uq46j7sjqZK7q6Aeuxms8bjz6Ks6MH/your_sha256_hashyour_sha256_hashuvdhRtD2g/JG9bO3VvAr3dT+AB9a8ffmRvYRgtD2DIq69OpUYPa0bmb0oX4E9Cs+your_sha256_hash5Ozp0ILxuZRq81EXPvKIIkbyS/your_sha256_hashoi61n6AOh6fmTg=</data>
<key>5</key>
<integer>-1064304640</integer>
<key>6</key>
<integer>0</integer>
<key>7</key>
<integer>0</integer>
<key>8</key>
<integer>0</integer>
<key>9</key>
<integer>0</integer>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>0</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>0</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction10</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>10</integer>
<key>DspFuncName</key>
<string>Dsp3ChOutput</string>
<key>DspFuncProcessingIndex</key>
<integer>10</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>10</key>
<integer>0</integer>
<key>11</key>
<integer>0</integer>
<key>12</key>
<integer>0</integer>
<key>14</key>
<integer>1073819211</integer>
<key>15</key>
<integer>1073819211</integer>
<key>16</key>
<integer>1073819211</integer>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>1043084177</integer>
<key>6</key>
<integer>0</integer>
<key>7</key>
<integer>0</integer>
<key>8</key>
<integer>0</integer>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>8</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>8</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
<key>InputPort2</key>
<dict>
<key>PortInstance</key>
<integer>2</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>9</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort3</key>
<dict>
<key>PortInstance</key>
<integer>3</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>9</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction2</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>2</integer>
<key>DspFuncName</key>
<string>DspEqualization32</string>
<key>DspFuncProcessingIndex</key>
<integer>2</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>9</key>
<integer>0</integer>
<key>Filter</key>
<array>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1120230993</integer>
<key>7</key>
<integer>1060160268</integer>
<key>8</key>
<integer>-1068637246</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>1</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1114105964</integer>
<key>7</key>
<integer>1060439283</integer>
<key>8</key>
<integer>-1069504319</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>2</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1110548911</integer>
<key>7</key>
<integer>1060439283</integer>
<key>8</key>
<integer>-1069504319</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>3</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1105264640</integer>
<key>7</key>
<integer>1060439283</integer>
<key>8</key>
<integer>-1069504319</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>4</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1147235974</integer>
<key>7</key>
<integer>1096325049</integer>
<key>8</key>
<integer>-1087159146</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>5</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1136886945</integer>
<key>7</key>
<integer>1088193924</integer>
<key>8</key>
<integer>-1066910782</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>6</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1128619601</integer>
<key>7</key>
<integer>1087350440</integer>
<key>8</key>
<integer>-1081440652</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>7</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1157222277</integer>
<key>7</key>
<integer>1091164447</integer>
<key>8</key>
<integer>-1068512851</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>8</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1138665472</integer>
<key>7</key>
<integer>1090199894</integer>
<key>8</key>
<integer>-1057320623</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>9</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1140201472</integer>
<key>7</key>
<integer>1089833454</integer>
<key>8</key>
<integer>-1072251010</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>10</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1135512630</integer>
<key>7</key>
<integer>1099792396</integer>
<key>8</key>
<integer>-1072251010</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>11</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1141314290</integer>
<key>7</key>
<integer>1092114722</integer>
<key>8</key>
<integer>-1057320623</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>12</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1142223764</integer>
<key>7</key>
<integer>1089568764</integer>
<key>8</key>
<integer>-1072785033</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>13</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1143032185</integer>
<key>7</key>
<integer>1077146883</integer>
<key>8</key>
<integer>-1081440652</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>14</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1145639343</integer>
<key>7</key>
<integer>1095277979</integer>
<key>8</key>
<integer>-1081440652</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>15</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1169921416</integer>
<key>7</key>
<integer>1094718988</integer>
<key>8</key>
<integer>-1080372607</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>16</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1161433139</integer>
<key>7</key>
<integer>1090921657</integer>
<key>8</key>
<integer>-1062126828</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>17</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1165741360</integer>
<key>7</key>
<integer>1076442225</integer>
<key>8</key>
<integer>-1080372607</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>18</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1175093878</integer>
<key>7</key>
<integer>1085125442</integer>
<key>8</key>
<integer>-1079304561</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>19</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1178371166</integer>
<key>7</key>
<integer>1089769695</integer>
<key>8</key>
<integer>-1061859817</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>20</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1167858775</integer>
<key>7</key>
<integer>1093631170</integer>
<key>8</key>
<integer>-1070114919</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>21</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1171967603</integer>
<key>7</key>
<integer>1091295308</integer>
<key>8</key>
<integer>-1077168470</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>22</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1159348648</integer>
<key>7</key>
<integer>1091961523</integer>
<key>8</key>
<integer>-1063728896</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>23</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1153930298</integer>
<key>7</key>
<integer>1090833234</integer>
<key>8</key>
<integer>-1072785033</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>24</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1176537177</integer>
<key>7</key>
<integer>1090010626</integer>
<key>8</key>
<integer>-1071182965</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>25</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1177324909</integer>
<key>7</key>
<integer>1102098839</integer>
<key>8</key>
<integer>-1060791771</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>26</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1176711032</integer>
<key>7</key>
<integer>1106921585</integer>
<key>8</key>
<integer>-1062660851</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>27</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>6</integer>
<key>6</key>
<integer>1163652889</integer>
<key>7</key>
<integer>1076497564</integer>
<key>8</key>
<integer>1066042996</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>28</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1165741360</integer>
<key>7</key>
<integer>1092966569</integer>
<key>8</key>
<integer>-1069580896</integer>
</dict>
<dict>
<key>2</key>
<integer>2</integer>
<key>3</key>
<integer>29</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1150626287</integer>
<key>7</key>
<integer>1084498103</integer>
<key>8</key>
<integer>-1076100424</integer>
</dict>
</array>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>1</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>1</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction3</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>3</integer>
<key>DspFuncName</key>
<string>DspMultiBandCompressor</string>
<key>DspFuncProcessingIndex</key>
<integer>3</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>2</key>
<integer>0</integer>
<key>21</key>
<integer>0</integer>
<key>26</key>
<integer>1134051455</integer>
<key>27</key>
<integer>1174371896</integer>
<key>28</key>
<integer>1184645120</integer>
<key>29</key>
<integer>1</integer>
<key>3</key>
<integer>2</integer>
<key>30</key>
<integer>0</integer>
<key>Compressor</key>
<array>
<dict>
<key>10</key>
<integer>1116471296</integer>
<key>11</key>
<integer>0</integer>
<key>12</key>
<integer>1065353216</integer>
<key>13</key>
<integer>0</integer>
<key>14</key>
<integer>0</integer>
<key>15</key>
<integer>1070691421</integer>
<key>16</key>
<integer>-1054867456</integer>
<key>17</key>
<integer>1072706866</integer>
<key>18</key>
<integer>1080060515</integer>
<key>19</key>
<integer>0</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>0</integer>
<key>6</key>
<integer>0</integer>
<key>7</key>
<integer>0</integer>
<key>8</key>
<integer>1</integer>
<key>9</key>
<integer>1092616192</integer>
</dict>
<dict>
<key>10</key>
<integer>1116471296</integer>
<key>11</key>
<integer>0</integer>
<key>12</key>
<integer>1065353216</integer>
<key>13</key>
<integer>0</integer>
<key>14</key>
<integer>0</integer>
<key>15</key>
<integer>1071835322</integer>
<key>16</key>
<integer>-1054867456</integer>
<key>17</key>
<integer>1072706866</integer>
<key>18</key>
<integer>1084363763</integer>
<key>19</key>
<integer>0</integer>
<key>4</key>
<integer>1</integer>
<key>5</key>
<integer>0</integer>
<key>6</key>
<integer>0</integer>
<key>7</key>
<integer>0</integer>
<key>8</key>
<integer>1</integer>
<key>9</key>
<integer>1092616192</integer>
</dict>
<dict>
<key>10</key>
<integer>1116471296</integer>
<key>11</key>
<integer>0</integer>
<key>12</key>
<integer>1065353216</integer>
<key>13</key>
<integer>0</integer>
<key>14</key>
<integer>0</integer>
<key>15</key>
<integer>1069547520</integer>
<key>16</key>
<integer>-1054867456</integer>
<key>17</key>
<integer>1072706866</integer>
<key>18</key>
<integer>1084363763</integer>
<key>19</key>
<integer>0</integer>
<key>4</key>
<integer>2</integer>
<key>5</key>
<integer>0</integer>
<key>6</key>
<integer>0</integer>
<key>7</key>
<integer>0</integer>
<key>8</key>
<integer>1</integer>
<key>9</key>
<integer>1092616192</integer>
</dict>
</array>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>2</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>2</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction4</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>4</integer>
<key>DspFuncName</key>
<string>DspMultiBandCompressor</string>
<key>DspFuncProcessingIndex</key>
<integer>4</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>2</key>
<integer>0</integer>
<key>21</key>
<integer>0</integer>
<key>26</key>
<integer>1140594757</integer>
<key>27</key>
<integer>1157804269</integer>
<key>28</key>
<integer>1184645120</integer>
<key>29</key>
<integer>1</integer>
<key>3</key>
<integer>2</integer>
<key>30</key>
<integer>0</integer>
<key>Compressor</key>
<array>
<dict>
<key>10</key>
<integer>1115947008</integer>
<key>11</key>
<integer>-1055350354</integer>
<key>12</key>
<integer>1076702509</integer>
<key>13</key>
<integer>0</integer>
<key>14</key>
<integer>1</integer>
<key>15</key>
<integer>1068403619</integer>
<key>16</key>
<integer>-1032847360</integer>
<key>17</key>
<integer>1065353216</integer>
<key>18</key>
<integer>0</integer>
<key>19</key>
<integer>1</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>0</integer>
<key>6</key>
<integer>0</integer>
<key>7</key>
<integer>0</integer>
<key>8</key>
<integer>1</integer>
<key>9</key>
<integer>1095761920</integer>
<key>Filter</key>
<array>
<dict>
<key>20</key>
<integer>0</integer>
<key>22</key>
<integer>1</integer>
<key>23</key>
<integer>1127599054</integer>
<key>24</key>
<integer>1082537644</integer>
<key>25</key>
<integer>1111573912</integer>
</dict>
<dict>
<key>20</key>
<integer>1</integer>
<key>22</key>
<integer>0</integer>
<key>23</key>
<integer>1101004800</integer>
<key>24</key>
<integer>0</integer>
<key>25</key>
<integer>1056964608</integer>
</dict>
<dict>
<key>20</key>
<integer>2</integer>
<key>22</key>
<integer>0</integer>
<key>23</key>
<integer>1101004800</integer>
<key>24</key>
<integer>0</integer>
<key>25</key>
<integer>1056964608</integer>
</dict>
<dict>
<key>20</key>
<integer>3</integer>
<key>22</key>
<integer>0</integer>
<key>23</key>
<integer>1101004800</integer>
<key>24</key>
<integer>0</integer>
<key>25</key>
<integer>1056964608</integer>
</dict>
<dict>
<key>20</key>
<integer>4</integer>
<key>22</key>
<integer>0</integer>
<key>23</key>
<integer>1148846080</integer>
<key>24</key>
<integer>0</integer>
<key>25</key>
<integer>1056964608</integer>
</dict>
<dict>
<key>20</key>
<integer>5</integer>
<key>22</key>
<integer>0</integer>
<key>23</key>
<integer>1148846080</integer>
<key>24</key>
<integer>0</integer>
<key>25</key>
<integer>1056964608</integer>
</dict>
</array>
</dict>
<dict>
<key>10</key>
<integer>1115947008</integer>
<key>11</key>
<integer>-1065573970</integer>
<key>12</key>
<integer>1074317513</integer>
<key>13</key>
<integer>0</integer>
<key>14</key>
<integer>1</integer>
<key>15</key>
<integer>1068403619</integer>
<key>16</key>
<integer>-1032847360</integer>
<key>17</key>
<integer>1065353216</integer>
<key>18</key>
<integer>0</integer>
<key>19</key>
<integer>0</integer>
<key>4</key>
<integer>1</integer>
<key>5</key>
<integer>0</integer>
<key>6</key>
<integer>0</integer>
<key>7</key>
<integer>0</integer>
<key>8</key>
<integer>1</integer>
<key>9</key>
<integer>1095761920</integer>
</dict>
<dict>
<key>10</key>
<integer>1115947008</integer>
<key>11</key>
<integer>-1066953670</integer>
<key>12</key>
<integer>1077497508</integer>
<key>13</key>
<integer>0</integer>
<key>14</key>
<integer>0</integer>
<key>15</key>
<integer>1082130432</integer>
<key>16</key>
<integer>-1032847360</integer>
<key>17</key>
<integer>1065353216</integer>
<key>18</key>
<integer>0</integer>
<key>19</key>
<integer>0</integer>
<key>4</key>
<integer>2</integer>
<key>5</key>
<integer>0</integer>
<key>6</key>
<integer>0</integer>
<key>7</key>
<integer>0</integer>
<key>8</key>
<integer>1</integer>
<key>9</key>
<integer>1095761920</integer>
</dict>
</array>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>3</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>3</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction5</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>5</integer>
<key>DspFuncName</key>
<string>DspLimiter</string>
<key>DspFuncProcessingIndex</key>
<integer>5</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>2</key>
<integer>1084227582</integer>
<key>3</key>
<integer>1099593255</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>0</integer>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>4</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>4</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction6</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>6</integer>
<key>DspFuncName</key>
<string>DspLoudness</string>
<key>DspFuncProcessingIndex</key>
<integer>6</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>10</key>
<integer>1143017157</integer>
<key>11</key>
<integer>1153579796</integer>
<key>12</key>
<integer>1053867276</integer>
<key>13</key>
<integer>1054460931</integer>
<key>14</key>
<integer>-1059344068</integer>
<key>15</key>
<integer>-1036638366</integer>
<key>16</key>
<integer>-1043378290</integer>
<key>17</key>
<integer>-1044186096</integer>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>0</integer>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>5</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>5</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction7</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>7</integer>
<key>DspFuncName</key>
<string>DspCrossover2Dot1</string>
<key>DspFuncProcessingIndex</key>
<integer>7</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>10</key>
<integer>1151090688</integer>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>1065353216</integer>
<key>5</key>
<integer>2</integer>
<key>6</key>
<integer>1172501203</integer>
<key>7</key>
<integer>1065353216</integer>
<key>9</key>
<integer>2</integer>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>6</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>6</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction8</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>8</integer>
<key>DspFuncName</key>
<string>DspEqualization32</string>
<key>DspFuncProcessingIndex</key>
<integer>8</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>9</key>
<integer>0</integer>
<key>Filter</key>
<array>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>3</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1162327107</integer>
<key>7</key>
<integer>1104000716</integer>
<key>8</key>
<integer>-1066910782</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>4</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1172156066</integer>
<key>7</key>
<integer>1111129326</integer>
<key>8</key>
<integer>-1096615800</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>5</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1159976148</integer>
<key>7</key>
<integer>1101808649</integer>
<key>8</key>
<integer>-1072785033</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>7</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1163829781</integer>
<key>7</key>
<integer>1101791285</integer>
<key>8</key>
<integer>-1067978828</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>8</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1156119800</integer>
<key>7</key>
<integer>1084063743</integer>
<key>8</key>
<integer>-1065330965</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>9</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1169843194</integer>
<key>7</key>
<integer>1097772610</integer>
<key>8</key>
<integer>-1065063953</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>10</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1169091857</integer>
<key>7</key>
<integer>1101791256</integer>
<key>8</key>
<integer>-1073319056</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>11</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1175642804</integer>
<key>7</key>
<integer>1098789340</integer>
<key>8</key>
<integer>-1060257748</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>12</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1176768079</integer>
<key>7</key>
<integer>1100994664</integer>
<key>8</key>
<integer>-1061325794</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>13</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1177564428</integer>
<key>7</key>
<integer>1101845263</integer>
<key>8</key>
<integer>-1064262919</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>14</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1178836854</integer>
<key>7</key>
<integer>1099584154</integer>
<key>8</key>
<integer>-1077168470</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>15</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1179667826</integer>
<key>7</key>
<integer>1092214020</integer>
<key>8</key>
<integer>-1061058782</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>16</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1180386270</integer>
<key>7</key>
<integer>1103181829</integer>
<key>8</key>
<integer>-1064529931</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>17</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1181676008</integer>
<key>7</key>
<integer>1095876660</integer>
<key>8</key>
<integer>-1059723725</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>18</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1182152086</integer>
<key>7</key>
<integer>1112481633</integer>
<key>8</key>
<integer>-1064262919</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>19</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1182832130</integer>
<key>7</key>
<integer>1117112078</integer>
<key>8</key>
<integer>-1063728896</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>20</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1180340553</integer>
<key>7</key>
<integer>1068581256</integer>
<key>8</key>
<integer>-1096615800</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>2</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1173185536</integer>
<key>7</key>
<integer>1100334870</integer>
<key>8</key>
<integer>-1068512851</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>3</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1156022853</integer>
<key>7</key>
<integer>1099635812</integer>
<key>8</key>
<integer>-1060791771</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>4</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1175504309</integer>
<key>7</key>
<integer>1103011915</integer>
<key>8</key>
<integer>-1065063953</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>5</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1155058319</integer>
<key>7</key>
<integer>1081289331</integer>
<key>8</key>
<integer>-1080372607</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>6</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1167916377</integer>
<key>7</key>
<integer>1091579115</integer>
<key>8</key>
<integer>-1070114919</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>7</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1168963338</integer>
<key>7</key>
<integer>1093332266</integer>
<key>8</key>
<integer>-1065330965</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>8</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1175989043</integer>
<key>7</key>
<integer>1104900771</integer>
<key>8</key>
<integer>-1059990737</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>9</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1177148941</integer>
<key>7</key>
<integer>1097811530</integer>
<key>8</key>
<integer>-1060524760</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>10</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1177625019</integer>
<key>7</key>
<integer>1102406151</integer>
<key>8</key>
<integer>-1062393839</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>11</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1178040506</integer>
<key>7</key>
<integer>1105691792</integer>
<key>8</key>
<integer>-1059990737</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>12</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1179165780</integer>
<key>7</key>
<integer>1111352147</integer>
<key>8</key>
<integer>-1053270950</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>13</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1179503362</integer>
<key>7</key>
<integer>1110920726</integer>
<key>8</key>
<integer>-1050867848</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>14</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1180446862</integer>
<key>7</key>
<integer>1102019589</integer>
<key>8</key>
<integer>-1052736927</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>15</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1181373050</integer>
<key>7</key>
<integer>1103437665</integer>
<key>8</key>
<integer>-1056341581</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>16</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1182420421</integer>
<key>7</key>
<integer>1093958721</integer>
<key>8</key>
<integer>-1068512851</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>17</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1179840944</integer>
<key>7</key>
<integer>1109925232</integer>
<key>8</key>
<integer>-1048998768</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>18</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1183081858</integer>
<key>7</key>
<integer>1078346060</integer>
<key>8</key>
<integer>-1077168470</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>19</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1169912941</integer>
<key>7</key>
<integer>1096384878</integer>
<key>8</key>
<integer>-1082886964</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>20</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1180914284</integer>
<key>7</key>
<integer>1110187061</integer>
<key>8</key>
<integer>-1051401870</integer>
</dict>
</array>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>7</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>7</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction9</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>9</integer>
<key>DspFuncName</key>
<string>DspEqualization32</string>
<key>DspFuncProcessingIndex</key>
<integer>9</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>9</key>
<integer>0</integer>
<key>Filter</key>
<array>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>4</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1138033804</integer>
<key>7</key>
<integer>1084751867</integer>
<key>8</key>
<integer>-1068512851</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>5</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1143867172</integer>
<key>7</key>
<integer>1088502544</integer>
<key>8</key>
<integer>-1065063953</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>6</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1157137741</integer>
<key>7</key>
<integer>1087292660</integer>
<key>8</key>
<integer>-1071716987</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>7</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1165550586</integer>
<key>7</key>
<integer>1093891953</integer>
<key>8</key>
<integer>-1062393839</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>8</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1163439530</integer>
<key>7</key>
<integer>1091438896</integer>
<key>8</key>
<integer>-1072785033</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>9</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1159348133</integer>
<key>7</key>
<integer>1094279017</integer>
<key>8</key>
<integer>-1070114919</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>10</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1161234918</integer>
<key>7</key>
<integer>1088569766</integer>
<key>8</key>
<integer>-1071716987</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>4</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1138033804</integer>
<key>7</key>
<integer>1084751867</integer>
<key>8</key>
<integer>-1068512851</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>5</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1143867172</integer>
<key>7</key>
<integer>1088502544</integer>
<key>8</key>
<integer>-1065063953</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>6</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1157137741</integer>
<key>7</key>
<integer>1087292660</integer>
<key>8</key>
<integer>-1071716987</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>7</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1165550586</integer>
<key>7</key>
<integer>1093891953</integer>
<key>8</key>
<integer>-1062393839</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>8</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1163439530</integer>
<key>7</key>
<integer>1091438896</integer>
<key>8</key>
<integer>-1072785033</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>9</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1159348133</integer>
<key>7</key>
<integer>1094279017</integer>
<key>8</key>
<integer>-1070114919</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>10</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1161234918</integer>
<key>7</key>
<integer>1088569766</integer>
<key>8</key>
<integer>-1071716987</integer>
</dict>
</array>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>7</integer>
<key>SourcePortIndex</key>
<integer>2</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>7</integer>
<key>SourcePortIndex</key>
<integer>3</integer>
</dict>
</dict>
</dict>
</dict>
</dict>
</dict>
<key>LineIn</key>
<dict>
<key>HeadsetMic_dBV</key>
<integer>1088421888</integer>
<key>MuteGPIO</key>
<integer>1342242841</integer>
<key>SignalProcessing</key>
<dict>
<key>SoftwareDSP</key>
<dict>
<key>DspFunction0</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>0</integer>
<key>DspFuncName</key>
<string>DspNoiseReduction</string>
<key>DspFuncProcessingIndex</key>
<integer>0</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>-1063256063</integer>
<key>5</key>
<data>O7qJwvAsd8IxFYLCNC+Iwgh8h8JYT3zCTGxtwjCQbMLsb3/C58KIwmIAjcKqEZTCM22Xwr5/k8L6Q5DCUXiPwhlqksKOQ5TCQS2XwkCYnMLSmqPCbK+your_sha256_hashqwvxyqcLWr6XCdkajwulQpMJs1afCbmCqwqbpqcIaSKrCSrmpwjv+p8KjIqjCVkOowh9WqMLun6nCudimwvISp8K686rC+your_sha256_hash8GswgJLr8Ku2a/your_sha256_hashCQGK1woYFtcIw7LHCOMuxwiKZs8K8YrXC6nO4ws5cu8KCa73CJjG+wqekvMK9RLnC4/a2wuKBt8Jyyour_sha512_hash/Rwhmf0cImvtPClErXwmrF18JUfdvCNi7fwty43cL+WdvCuqrawiIL3cKCR+HCYPDnwqQ67MLYserCshHowl7L6MK2guzCsvrvwu4o8cJyfv7C</data>
</dict>
<key>PatchbayInfo</key>
<dict/>
</dict>
<key>DspFunction1</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>1</integer>
<key>DspFuncName</key>
<string>DspEqualization32</string>
<key>DspFuncProcessingIndex</key>
<integer>1</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>9</key>
<integer>0</integer>
<key>Filter</key>
<array>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1120623594</integer>
<key>7</key>
<integer>1060439283</integer>
<key>8</key>
<integer>-1069504319</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>3</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134130816</integer>
<key>7</key>
<integer>1068239080</integer>
<key>8</key>
<integer>-1073964333</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>4</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1143149396</integer>
<key>7</key>
<integer>1069838081</integer>
<key>8</key>
<integer>-1072785033</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>5</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1161109679</integer>
<key>7</key>
<integer>1093706804</integer>
<key>8</key>
<integer>-1069580896</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>7</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1138536183</integer>
<key>7</key>
<integer>1094714319</integer>
<key>8</key>
<integer>-1069046873</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>9</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134823262</integer>
<key>7</key>
<integer>1088568216</integer>
<key>8</key>
<integer>-1073319056</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>10</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1140763936</integer>
<key>7</key>
<integer>1095878445</integer>
<key>8</key>
<integer>-1066910782</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>11</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1150711009</integer>
<key>7</key>
<integer>1082220668</integer>
<key>8</key>
<integer>-1072251010</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>22</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1169045837</integer>
<key>7</key>
<integer>1080998247</integer>
<key>8</key>
<integer>-1076100424</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>23</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>6</integer>
<key>6</key>
<integer>1174718752</integer>
<key>7</key>
<integer>1074226939</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>24</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1174256827</integer>
<key>7</key>
<integer>1091118565</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1120623594</integer>
<key>7</key>
<integer>1060439283</integer>
<key>8</key>
<integer>-1069504319</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>3</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134130816</integer>
<key>7</key>
<integer>1068239080</integer>
<key>8</key>
<integer>-1073964333</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>4</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1143149396</integer>
<key>7</key>
<integer>1069838081</integer>
<key>8</key>
<integer>-1072785033</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>5</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1161109679</integer>
<key>7</key>
<integer>1093706804</integer>
<key>8</key>
<integer>-1069580896</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>7</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1138536183</integer>
<key>7</key>
<integer>1094714319</integer>
<key>8</key>
<integer>-1069046873</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>9</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134823262</integer>
<key>7</key>
<integer>1088568216</integer>
<key>8</key>
<integer>-1073319056</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>10</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1140763936</integer>
<key>7</key>
<integer>1095878445</integer>
<key>8</key>
<integer>-1066910782</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>11</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1150711009</integer>
<key>7</key>
<integer>1082220668</integer>
<key>8</key>
<integer>-1072251010</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>22</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1169045837</integer>
<key>7</key>
<integer>1080998247</integer>
<key>8</key>
<integer>-1076100424</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>23</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>6</integer>
<key>6</key>
<integer>1174718752</integer>
<key>7</key>
<integer>1074226939</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>24</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1174256827</integer>
<key>7</key>
<integer>1091118565</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
</array>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>0</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>0</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction2</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>2</integer>
<key>DspFuncName</key>
<string>DspGainStage</string>
<key>DspFuncProcessingIndex</key>
<integer>2</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>2</key>
<integer>1065353216</integer>
<key>3</key>
<integer>1065353216</integer>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>1</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>1</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction3</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>3</integer>
<key>DspFuncName</key>
<string>DspClientGainAdjustStage</string>
<key>DspFuncProcessingIndex</key>
<integer>3</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>1</integer>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>1082130432</integer>
<key>4</key>
<integer>1103626240</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1082130432</integer>
<key>7</key>
<integer>3</integer>
<key>8</key>
<integer>0</integer>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>2</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>2</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
</dict>
</dict>
</dict>
<key>Mic</key>
<dict>
<key>HeadsetMic_dBV</key>
<integer>1088421888</integer>
<key>MuteGPIO</key>
<integer>0</integer>
<key>SignalProcessing</key>
<dict>
<key>SoftwareDSP</key>
<dict>
<key>DspFunction0</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>0</integer>
<key>DspFuncName</key>
<string>DspNoiseReduction</string>
<key>DspFuncProcessingIndex</key>
<integer>0</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>-1063256063</integer>
<key>5</key>
<data>O7qJwvAsd8IxFYLCNC+Iwgh8h8JYT3zCTGxtwjCQbMLsb3/C58KIwmIAjcKqEZTCM22Xwr5/k8L6Q5DCUXiPwhlqksKOQ5TCQS2XwkCYnMLSmqPCbK+your_sha256_hashqwvxyqcLWr6XCdkajwulQpMJs1afCbmCqwqbpqcIaSKrCSrmpwjv+p8KjIqjCVkOowh9WqMLun6nCudimwvISp8K686rC+your_sha256_hash8GswgJLr8Ku2a/your_sha256_hashCQGK1woYFtcIw7LHCOMuxwiKZs8K8YrXC6nO4ws5cu8KCa73CJjG+wqekvMK9RLnC4/a2wuKBt8Jyyour_sha512_hash/Rwhmf0cImvtPClErXwmrF18JUfdvCNi7fwty43cL+WdvCuqrawiIL3cKCR+HCYPDnwqQ67MLYserCshHowl7L6MK2guzCsvrvwu4o8cJyfv7C</data>
</dict>
<key>PatchbayInfo</key>
<dict/>
</dict>
<key>DspFunction1</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>1</integer>
<key>DspFuncName</key>
<string>DspEqualization32</string>
<key>DspFuncProcessingIndex</key>
<integer>1</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>9</key>
<integer>0</integer>
<key>Filter</key>
<array>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1120623594</integer>
<key>7</key>
<integer>1060439283</integer>
<key>8</key>
<integer>-1069504319</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>3</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134130816</integer>
<key>7</key>
<integer>1068239080</integer>
<key>8</key>
<integer>-1073964333</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>4</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1143149396</integer>
<key>7</key>
<integer>1069838081</integer>
<key>8</key>
<integer>-1072785033</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>5</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1161109679</integer>
<key>7</key>
<integer>1093706804</integer>
<key>8</key>
<integer>-1069580896</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>7</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1138536183</integer>
<key>7</key>
<integer>1094714319</integer>
<key>8</key>
<integer>-1069046873</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>9</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134823262</integer>
<key>7</key>
<integer>1088568216</integer>
<key>8</key>
<integer>-1073319056</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>10</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1140763936</integer>
<key>7</key>
<integer>1095878445</integer>
<key>8</key>
<integer>-1066910782</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>11</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1150711009</integer>
<key>7</key>
<integer>1082220668</integer>
<key>8</key>
<integer>-1072251010</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>22</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1169045837</integer>
<key>7</key>
<integer>1080998247</integer>
<key>8</key>
<integer>-1076100424</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>23</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>6</integer>
<key>6</key>
<integer>1174718752</integer>
<key>7</key>
<integer>1074226939</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>24</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1174256827</integer>
<key>7</key>
<integer>1091118565</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1120623594</integer>
<key>7</key>
<integer>1060439283</integer>
<key>8</key>
<integer>-1069504319</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>3</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134130816</integer>
<key>7</key>
<integer>1068239080</integer>
<key>8</key>
<integer>-1073964333</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>4</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1143149396</integer>
<key>7</key>
<integer>1069838081</integer>
<key>8</key>
<integer>-1072785033</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>5</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1161109679</integer>
<key>7</key>
<integer>1093706804</integer>
<key>8</key>
<integer>-1069580896</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>7</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1138536183</integer>
<key>7</key>
<integer>1094714319</integer>
<key>8</key>
<integer>-1069046873</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>9</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134823262</integer>
<key>7</key>
<integer>1088568216</integer>
<key>8</key>
<integer>-1073319056</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>10</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1140763936</integer>
<key>7</key>
<integer>1095878445</integer>
<key>8</key>
<integer>-1066910782</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>11</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1150711009</integer>
<key>7</key>
<integer>1082220668</integer>
<key>8</key>
<integer>-1072251010</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>22</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1169045837</integer>
<key>7</key>
<integer>1080998247</integer>
<key>8</key>
<integer>-1076100424</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>23</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>6</integer>
<key>6</key>
<integer>1174718752</integer>
<key>7</key>
<integer>1074226939</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>24</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1174256827</integer>
<key>7</key>
<integer>1091118565</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
</array>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>0</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>0</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction2</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>2</integer>
<key>DspFuncName</key>
<string>DspGainStage</string>
<key>DspFuncProcessingIndex</key>
<integer>2</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>2</key>
<integer>1065353216</integer>
<key>3</key>
<integer>1065353216</integer>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>1</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>1</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction3</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>3</integer>
<key>DspFuncName</key>
<string>DspClientGainAdjustStage</string>
<key>DspFuncProcessingIndex</key>
<integer>3</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>1</integer>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>1082130432</integer>
<key>4</key>
<integer>1103626240</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1082130432</integer>
<key>7</key>
<integer>3</integer>
<key>8</key>
<integer>0</integer>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>2</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>2</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
</dict>
</dict>
</dict>
<key>Outputs</key>
<array>
<string>Headphone</string>
<string>IntSpeaker</string>
</array>
<key>PathMapID</key>
<integer>256</integer>
</dict>
</array>
</dict>
```
|
```sqlpl
-- Write your MySQL query statement below
select substring(email, position('@' in email) + 1) as email_domain,
count(*) as count
from emails
where email like '%@%.com'
group by 1
order by 1;
```
|
John McKenna (born 1882) was an English footballer who played as a defender.
External links
LFC History profile
1882 births
English men's footballers
Liverpool F.C. players
English Football League players
Year of death missing
Men's association football defenders
Place of birth missing
|
```xml
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
import { DOCUMENT } from '@angular/common';
import { HttpClientTestingModule } from '@angular/common/http/testing';
import { Component, DebugElement, ViewChild } from '@angular/core';
import { ComponentFixture, fakeAsync, TestBed, tick } from '@angular/core/testing';
import { By } from '@angular/platform-browser';
import { NoopAnimationsModule } from '@angular/platform-browser/animations';
import { Router, RouterModule } from '@angular/router';
import { RouterTestingModule } from '@angular/router/testing';
import { ACLService } from '@delon/acl';
import { AlainThemeModule, MenuIcon, MenuService, SettingsService } from '@delon/theme';
import { deepCopy } from '@delon/util/other';
import { WINDOW } from '@delon/util/token';
import { NzSafeAny } from 'ng-zorro-antd/core/types';
import { LayoutDefaultNavComponent, Nav } from './layout-nav.component';
import { LayoutDefaultModule } from './layout.module';
const floatingShowCls = '.sidebar-nav__floating-show';
const MOCKMENUS = [
{
text: '',
group: true,
children: [
{
text: '',
children: [
{ text: 'v1', link: '/v1' },
{ text: 'v2', link: '#/v2', i18n: 'v2-i18n' },
{ text: 'v3' },
{
text: 'externalLink-blank',
externalLink: '//ng-alain.com/blank',
target: '_blank'
},
{
text: 'externalLink-top',
externalLink: '//ng-alain.com/top',
target: '_top'
}
]
},
{
text: 'widgets',
disabled: true
}
]
}
] as Nav[];
const MOCKOPENSTRICTLY = [
{
text: '',
group: true,
children: [
{
text: '',
link: '/v1',
open: true,
children: [{ text: '' }]
},
{
text: '',
link: '/v1',
open: true,
children: [{ text: '' }]
}
]
}
] as Nav[];
class MockACLService {
can(val: string): boolean {
return val === 'admin';
}
}
class MockWindow {
location = new MockLocation();
open(): void {}
}
class MockLocation {
private url!: string;
get href(): string {
return this.url;
}
set href(url: string) {
this.url = url;
}
}
describe('theme: layout-default-nav', () => {
let fixture: ComponentFixture<TestComponent>;
let dl: DebugElement;
let context: TestComponent;
let router: Router;
let setSrv: SettingsService;
let menuSrv: MenuService;
let page: PageObject;
let doc: Document;
function createModule(): void {
TestBed.configureTestingModule({
imports: [
NoopAnimationsModule,
RouterModule.forRoot([]),
AlainThemeModule,
HttpClientTestingModule,
LayoutDefaultModule
],
declarations: [TestComponent],
providers: [
{ provide: ACLService, useClass: MockACLService },
{ provide: WINDOW, useFactory: () => new MockWindow() }
]
});
}
function createComp(needMockNavigateByUrl: boolean = true, callback?: () => void): void {
fixture = TestBed.createComponent(TestComponent);
dl = fixture.debugElement;
context = fixture.componentInstance;
fixture.detectChanges();
router = TestBed.inject<Router>(Router);
setSrv = TestBed.inject<SettingsService>(SettingsService);
menuSrv = TestBed.inject<MenuService>(MenuService);
doc = TestBed.inject(DOCUMENT);
menuSrv.add(deepCopy(MOCKMENUS));
page = new PageObject();
if (needMockNavigateByUrl) spyOn(router, 'navigateByUrl');
if (callback) callback();
}
describe('', () => {
beforeEach(() => createModule());
describe('[default]', () => {
it('should be navigate url', () => {
createComp();
spyOn(context, 'select');
const data = deepCopy(MOCKMENUS);
menuSrv.add(data);
expect(context.select).not.toHaveBeenCalled();
expect(router.navigateByUrl).not.toHaveBeenCalled();
const itemEl = page.getEl<HTMLElement>('.sidebar-nav__depth1 a');
itemEl!.click();
fixture.detectChanges();
expect(context.select).toHaveBeenCalled();
expect(router.navigateByUrl).toHaveBeenCalled();
});
describe('should be navigate external link', () => {
it('with target is _blank', () => {
createComp();
const win = TestBed.inject(WINDOW);
spyOn(win, 'open');
const itemEl = page.getEl<HTMLElement>('.sidebar-nav__item [data-id="6"]');
itemEl!.click();
expect(win.open).toHaveBeenCalled();
});
it('with target is _top', () => {
createComp();
const win = TestBed.inject(WINDOW);
const itemEl = page.getEl<HTMLElement>('.sidebar-nav__item [data-id="7"]');
itemEl!.click();
expect(win.location.href).toBe(`//ng-alain.com/top`);
});
});
it('should be hide group name', () => {
createComp();
page.checkCount('.sidebar-nav__group-title');
const data = deepCopy(MOCKMENUS) as Nav[];
data[0].group = false;
menuSrv.add(data);
fixture.detectChanges();
page.checkCount('.sidebar-nav__group-title', 0);
});
it('should be toggle open', () => {
createComp();
const data = deepCopy(MOCKMENUS);
menuSrv.add(data);
expect(data[0].children![0]._open).toBeUndefined();
const subTitleEl = page.getEl<HTMLElement>('.sidebar-nav__item-link');
subTitleEl!.click();
fixture.detectChanges();
expect(data[0].children![0]._open).toBe(true);
});
it('should be reset menu when service is changed', () => {
createComp();
page.checkText('.sidebar-nav__group-title', MOCKMENUS[0].text);
const newMenu = deepCopy(MOCKMENUS);
newMenu[0].text = 'new';
menuSrv.add(newMenu);
fixture.detectChanges();
page.checkText('.sidebar-nav__group-title', newMenu[0].text);
});
it('should be block click menu when is disabled', () => {
createComp();
spyOn(context, 'select');
const newMenus = [
{
text: '',
children: [{ text: 'new menu', disabled: true }]
}
];
menuSrv.add(newMenus);
expect(context.select).not.toHaveBeenCalled();
const itemEl = page.getEl<HTMLElement>('.sidebar-nav__item-disabled');
itemEl!.click();
fixture.detectChanges();
expect(context.select).toHaveBeenCalled();
});
it('should be support html in text or i18n', () => {
createComp();
menuSrv.add([{ text: 'text <strong>1</strong>' }]);
page.checkText('.sidebar-nav__item', `text 1`);
menuSrv.add([{ i18n: 'i18n <strong>1</strong>' }]);
page.checkText('.sidebar-nav__item', `i18n 1`);
});
});
describe('#icon', () => {
function updateIcon(icon: string | MenuIcon): void {
createComp();
menuSrv.add([
{
text: '',
group: true,
children: [
{
text: '',
icon
}
]
}
] as Nav[]);
fixture.detectChanges();
}
describe('with icon', () => {
it('when is string and includes [anticon-]', () => {
updateIcon('anticon-edit');
const el = page.getEl('.sidebar-nav__item-icon') as HTMLElement;
expect(el.classList).toContain('anticon-edit');
});
it('when is string and http prefix', () => {
updateIcon('path_to_url
page.checkCount('.sidebar-nav__item-img', 1);
});
it('when is class string', () => {
updateIcon('demo-class');
page.checkCount('.demo-class', 1);
});
});
it('with className', () => {
updateIcon({ type: 'class', value: 'demo-class' });
page.checkCount('.demo-class', 1);
});
it('with img', () => {
updateIcon({ type: 'img', value: '1.jpg' });
page.checkCount('.sidebar-nav__item-img', 1);
});
it('with svg', () => {
updateIcon({ type: 'svg', value: '<svg></svg>' });
page.checkCount('.sidebar-nav__item-svg', 1);
});
});
describe('[collapsed]', () => {
describe('#default', () => {
beforeEach(() => {
createComp();
setSrv.layout.collapsed = true;
fixture.detectChanges();
});
it(`should be won't show sub-menu when not collapse`, () => {
setSrv.layout.collapsed = false;
fixture.detectChanges();
page.showSubMenu(false);
});
it('should be show sub-menu', () => {
page.showSubMenu();
});
it('should be displayed full submenu', () => {
const clientHeight = spyOnProperty(doc.documentElement, 'clientHeight').and.returnValue(0);
spyOnProperty(doc.querySelector('body')!, 'clientHeight').and.returnValue(0);
expect(clientHeight).not.toHaveBeenCalled();
page.showSubMenu();
expect(clientHeight).toHaveBeenCalled();
});
it('should be working when include badge', () => {
const mockMenu = deepCopy(MOCKMENUS) as Nav[];
mockMenu[0].children![0].badge = 1;
menuSrv.add(mockMenu);
fixture.detectChanges();
expect(page.getEl('.ant-badge') != null).toBe(true);
page.showSubMenu();
expect(page.getEl('.sidebar-nav__floating-container .sidebar-nav__item', true) != null).toBe(true);
});
it('should be ingore children title trigger event', () => {
spyOn(context, 'select');
expect(context.select).not.toHaveBeenCalled();
const mockMenu = deepCopy(MOCKMENUS) as Nav[];
mockMenu[0].children![0].children = [{ text: 'a', children: [{ text: 'b' }] }];
menuSrv.add(mockMenu);
fixture.detectChanges();
page.showSubMenu();
const containerEl = page.getEl<HTMLElement>(floatingShowCls, true)!;
(containerEl.querySelector('.sidebar-nav__item-link') as HTMLElement).click();
expect(context.select).not.toHaveBeenCalled();
});
});
describe('should be hide sub-menu in floating container', () => {
it('muse be hide via click menu link', () => {
createComp();
setSrv.layout.collapsed = true;
fixture.detectChanges();
page.showSubMenu();
page.hideSubMenu();
expect(router.navigateByUrl).toHaveBeenCalled();
});
it('muse be hide via mouse leave area', () => {
createComp();
setSrv.layout.collapsed = true;
fixture.detectChanges();
page.showSubMenu();
page.getEl<HTMLElement>(floatingShowCls, true)!.dispatchEvent(new Event('mouseleave'));
fixture.detectChanges();
expect(page.getEl<HTMLElement>(floatingShowCls, true)).toBeNull();
});
it('muse be not hide via click except menu link area', () => {
createComp();
setSrv.layout.collapsed = true;
fixture.detectChanges();
page.showSubMenu();
const containerEl = page.getEl<HTMLElement>(floatingShowCls, true);
containerEl!.querySelectorAll('li')[1].click();
fixture.detectChanges();
expect(router.navigateByUrl).not.toHaveBeenCalled();
});
it('muse be hide via click span of menu item', () => {
createComp();
setSrv.layout.collapsed = true;
fixture.detectChanges();
page.showSubMenu();
const containerEl = page.getEl<HTMLElement>(floatingShowCls, true);
containerEl!.querySelectorAll('span')[1].click();
fixture.detectChanges();
expect(router.navigateByUrl).toHaveBeenCalled();
});
it('muse be hide via document click', () => {
createComp();
setSrv.layout.collapsed = true;
fixture.detectChanges();
page.showSubMenu();
document.dispatchEvent(new MouseEvent('click'));
fixture.detectChanges();
expect(router.navigateByUrl).not.toHaveBeenCalled();
});
it('muse be hide when move to other item', () => {
createComp();
setSrv.layout.collapsed = true;
fixture.detectChanges();
page.showSubMenu();
expect(page.isShowSubMenu()).toBe(true);
const widgetEl = page.getEl<HTMLElement>('.sidebar-nav__item-disabled', true);
widgetEl!.dispatchEvent(new Event('mouseenter'));
fixture.detectChanges();
expect(page.isShowSubMenu()).toBe(false);
});
});
it('#52', () => {
createComp();
setSrv.layout.collapsed = true;
fixture.detectChanges();
page.showSubMenu();
spyOn(context.comp['floatingEl'], 'remove');
page.hideSubMenu();
expect(page.getEl<HTMLElement>(floatingShowCls, true)).toBeNull();
});
});
describe('#disabledAcl', () => {
const newMenus = [
{
text: '',
children: [
{ text: 'new menu', acl: 'admin' },
{ text: 'new menu', acl: 'user' }
]
}
];
beforeEach(() => createComp());
it('should be disabled item when with true', () => {
context.disabledAcl = true;
fixture.detectChanges();
menuSrv.add(newMenus);
const itemEl = page.getEl<HTMLElement>('.sidebar-nav__item [data-id="3"]');
expect(itemEl!.classList).toContain('sidebar-nav__item-disabled');
});
it('should be hidden item when with false', () => {
context.disabledAcl = false;
fixture.detectChanges();
menuSrv.add(newMenus);
const itemEl = page.getEl<HTMLElement>('.sidebar-nav__item [data-id="3"]');
expect(itemEl == null).toBe(true);
});
});
describe('#openStrictly', () => {
beforeEach(() => {
createComp();
context.openStrictly = true;
fixture.detectChanges();
menuSrv.add(deepCopy(MOCKOPENSTRICTLY));
fixture.detectChanges();
});
it('should working', () => {
page.checkCount('.sidebar-nav__open', 2);
});
it(`should be won't close other item`, () => {
const list = dl.queryAll(By.css('.sidebar-nav__item-link'));
expect(list.length).toBe(4);
(list[0].nativeElement as HTMLElement).click();
fixture.detectChanges();
page.checkCount('.sidebar-nav__open', 1);
(list[2].nativeElement as HTMLElement).click();
fixture.detectChanges();
page.checkCount('.sidebar-nav__open', 0);
});
});
});
describe('[underPad]', () => {
beforeEach(createModule);
it('should be auto collapsed when less than pad', fakeAsync(() => {
// create test component
TestBed.overrideTemplate(
TestComponent,
`<layout-default-nav #comp [autoCloseUnderPad]="true"></layout-default-nav>`
);
const defaultCollapsed = false;
createComp(false, () => {
spyOnProperty(window, 'innerWidth').and.returnValue(767);
setSrv.layout.collapsed = defaultCollapsed;
fixture.detectChanges();
});
router.navigateByUrl('/');
fixture.detectChanges();
tick(20);
expect(setSrv.layout.collapsed).toBe(!defaultCollapsed);
}));
it(`should be won't collapsed when more than pad`, fakeAsync(() => {
// create test component
TestBed.overrideTemplate(
TestComponent,
`<layout-default-nav #comp [autoCloseUnderPad]="true"></layout-default-nav>`
);
const defaultCollapsed = false;
createComp(false, () => {
spyOnProperty(window, 'innerWidth').and.returnValue(769);
setSrv.layout.collapsed = defaultCollapsed;
fixture.detectChanges();
});
router.navigateByUrl('/');
fixture.detectChanges();
tick(1000);
expect(setSrv.layout.collapsed).toBe(defaultCollapsed);
}));
it('should be auto expaned when less than pad trigger click', fakeAsync(() => {
// create test component
TestBed.overrideTemplate(
TestComponent,
`<layout-default-nav #comp [autoCloseUnderPad]="true"></layout-default-nav>`
);
createComp();
setSrv.layout.collapsed = true;
fixture.detectChanges();
spyOnProperty(window, 'innerWidth').and.returnValue(767);
expect(setSrv.layout.collapsed).toBe(true);
page.getEl<HTMLElement>('.sidebar-nav')!.click();
fixture.detectChanges();
tick(20);
expect(setSrv.layout.collapsed).toBe(false);
}));
});
describe('should be recursive path', () => {
beforeEach(() => {
TestBed.configureTestingModule({
imports: [
RouterModule.forRoot([]),
AlainThemeModule,
LayoutDefaultModule,
RouterTestingModule.withRoutes([
{ path: 'user', component: TestRouteComponent },
{ path: 'user2', component: TestRouteComponent },
{ path: 'user/type', component: TestRouteComponent }
])
],
declarations: [TestComponent, TestRouteComponent]
});
});
beforeEach(fakeAsync(() => {
fixture = TestBed.createComponent(TestComponent);
dl = fixture.debugElement;
context = fixture.componentInstance;
menuSrv = TestBed.inject<MenuService>(MenuService);
fixture.detectChanges();
createComp(false);
menuSrv.add([
{
text: '',
group: true,
children: [
{ text: 'user1', link: '/user' },
{ text: 'user2', link: '/user' }
]
}
]);
}));
it('with true', fakeAsync(() => {
context.recursivePath = true;
fixture.detectChanges();
router.navigateByUrl('/user2');
tick();
fixture.detectChanges();
page.checkCount('.sidebar-nav__selected', 0);
router.navigateByUrl('/user/type');
tick();
fixture.detectChanges();
page.checkCount('.sidebar-nav__selected', 1);
}));
it('with false', fakeAsync(() => {
context.recursivePath = false;
fixture.detectChanges();
router.navigateByUrl('/user2');
tick();
fixture.detectChanges();
page.checkCount('.sidebar-nav__selected', 0);
router.navigateByUrl('/user/type');
tick();
fixture.detectChanges();
page.checkCount('.sidebar-nav__selected', 0);
}));
it('should be ingore _open when enabled openStrictly', fakeAsync(() => {
context.openStrictly = true;
fixture.detectChanges();
menuSrv.add(deepCopy(MOCKOPENSTRICTLY));
page.checkCount('.sidebar-nav__open', 2);
router.navigateByUrl('/user2');
fixture.detectChanges();
page.checkCount('.sidebar-nav__open', 2);
}));
});
class PageObject {
getEl<T>(cls: string, body: boolean = false): T | null {
const el = body
? document.querySelector(cls)
: dl.query(By.css(cls))
? dl.query(By.css(cls)).nativeElement
: null;
return el ? (el as T) : null;
}
checkText(cls: string, value: NzSafeAny): void {
const el = this.getEl<HTMLElement>(cls);
expect(el ? el.innerText.trim() : '').toBe(value);
}
checkCount(cls: string, count: number = 1): this {
expect(dl.queryAll(By.css(cls)).length).toBe(count);
return this;
}
/** `true` */
showSubMenu(resultExpectShow: boolean = true): void {
let conEl = this.getEl<HTMLElement>(floatingShowCls, true);
expect(conEl).toBeNull();
const subTitleEl = this.getEl<HTMLElement>('.sidebar-nav__item-link');
subTitleEl!.dispatchEvent(new Event('mouseenter'));
fixture.detectChanges();
conEl = this.getEl<HTMLElement>(floatingShowCls, true);
if (resultExpectShow) {
expect(conEl).not.toBeNull();
} else {
expect(conEl).toBeNull();
}
}
/** `true` */
hideSubMenu(resultExpectHide: boolean = true): void {
const containerEl = this.getEl<HTMLElement>(floatingShowCls, true);
expect(containerEl).not.toBeNull();
containerEl!.querySelector(resultExpectHide ? 'a' : 'li')!.click();
fixture.detectChanges();
const conEl = this.getEl<HTMLElement>(floatingShowCls, true);
if (resultExpectHide) expect(conEl).toBeNull();
else expect(conEl).not.toBeNull();
}
isShowSubMenu(): boolean {
return page.getEl(floatingShowCls, true) != null;
}
}
});
@Component({
template: `
<layout-default-nav
#comp
[disabledAcl]="disabledAcl"
[autoCloseUnderPad]="autoCloseUnderPad"
[recursivePath]="recursivePath"
[openStrictly]="openStrictly"
(select)="select()"
></layout-default-nav>
`
})
class TestComponent {
@ViewChild('comp', { static: true })
comp!: LayoutDefaultNavComponent;
disabledAcl = false;
autoCloseUnderPad = false;
recursivePath = false;
openStrictly = false;
select(): void {}
}
@Component({ template: `` })
class TestRouteComponent {}
```
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
// MODULES //
var addon = require( './../src/addon.node' );
// MAIN //
/**
* Computes the reciprocal square root of a single-precision floating-point number.
*
* @private
* @param {number} x - input value
* @returns {number} reciprocal square root
*
* @example
* var v = rsqrtf( 4.0 );
* // returns 0.5
*
* @example
* var v = rsqrtf( 0.0 );
* // returns Infinity
*
* @example
* var v = rsqrtf( Infinity );
* // returns 0.0
*
* @example
* var v = rsqrtf( -4.0 );
* // returns NaN
*
* @example
* var v = rsqrtf( NaN );
* // returns NaN
*/
function rsqrtf( x ) {
return addon( x );
}
// EXPORTS //
module.exports = rsqrtf;
```
|
```graphql
# import B from "b.graphql"
type Query {
a: B
}
type Mutation {
a: B
}
```
|
Bekbol Sagyn (, Bekbol Ubaıdollauly Saģyn; born in 1972) Kazakh statesman.
Biography
Sagyn was born in 1972 in Aktobe. He enrolled in the Kazakh State Academy of Management. He did not graduate but transferred to the Kazakh Humanitarian Law University, and later graduated from the Kazakh Engineering and Technical Academy with an undergraduate degree. Sagyn later received a graduate degree in economic sciences.
He began his professional career in 1993 by working in the financial systems of the region. From 1998 to 2003, he was employed in numerous tax departments of the Aktobe region. He also served as deputy head of education for the entire Aktobe region from 2003 to 2004. In addition, he served as the deputy akim (mayor) of the Aktobe region from February 2004 to August later that year.
Sagyn was appointed to the position of Akim Aktobe in October 2015. His predecessor Erkhan Umarov had decided to move to a new employment, thus leaving the mayor position empty. In Kazakhstan, akims are not elected locally, but are appointed by the regional governor of the Aktobe. The governor Berdibek Saparbayev accepted the resignation of the predecessor and, on the advice of the president, appointed Sagyn. In July 2016, he left the post of akim.
He delivered remarks on the state of the district and a plan of the future, an open forum hosted by the Akim of Alamty at the Eurasian National University. There, he laid out a vision for 2020 and laid out the future of the region, and later listening to and answering the questions regarding the needs of the people, especially the elderly.
Sagyn helped sponsor the construction of the largest ice rink in Astana in 2015.
References
Kazakhstani politicians
Living people
1972 births
|
Sandy is the second solo album by British folk rock musician Sandy Denny. Work on the album began just a fortnight after her UK tour promoting her debut solo album, The North Star Grassman and the Ravens, ended in early November 1971 and continued through to May 1972.The album was released in September 1972.
History
The first song recorded for the album was "The Quiet Joys of Brotherhood", a Richard Fariña lyric he had set to a traditional Irish melody "My Lagan Love"; Denny's ambitious multi-tracked vocal arrangement was inspired by the Ensemble of the Bulgarian Republic. Demo sessions continued at the recently constructed Manor Studio in Oxfordshire, the first studio owned by Richard Branson's Virgin label. It was here that Denny, together with contemporaries, recorded a one-off project called The Bunch, a collection of rock and roll era standards released under the title Rock On. That collection marked Trevor Lucas's debut as a producer for Island Records and he took the helm on Sandy; the album was once again engineered by John Wood. The Manor sessions resulted in rough versions of "Sweet Rosemary", "The Lady", "The Music Weaver", "Listen Listen", "For Nobody to Hear" and "Bushes and Briars". A further two tracks were begun but not finished: a cover version of fellow folk singer Anne Briggs's "Go Your Own Way My Love" and another Denny original "After Halloween", which was reworked three years later for Fairport Convention's Rising for the Moon album.
All of the album's songs were finished at Sound Techniques and Island studios in about five sessions between the end of April and late May, during which string arrangements by Harry Robinson were added and two further Denny compositions were recorded: "It Suits Me Well" and "It'll Take A Long Time". A cover version (the by now ubiquitous Bob Dylan cover) of "Tomorrow Is a Long Time" completed the LP. Allen Toussaint’s brass arrangement on "For Nobody To Hear" was recorded at Deep South Studio in Baton Rouge, Louisiana.
The guest musicians include Fairport Convention colleagues Richard Thompson and Dave Swarbrick, as well as Sneaky Pete Kleinow (of Flying Burrito Brothers fame) on steel guitar, and friend and fellow singer Linda Thompson on backing vocals.
The album was originally issued in a gatefold sleeve featuring on its front a photograph by David Bailey, which came to define Denny's public image. The gatefold of the LP opened to show the song lyrics handwritten by Denny herself and bordered by garlands of flowers drawn by Trevor Lucas's sister, the illustrator Marion Appleton. The back cover featured the track listing and credits. Radio One DJ Tony Blackburn picked the album's lead single, "Listen, Listen", as his single of the week in September 1972.
Track listing
All tracks credited to Sandy Denny unless otherwise stated
"It'll Take a Long Time" - 5:13
"Sweet Rosemary" - 2:29
"For Nobody to Hear" - 4:14
"Tomorrow Is a Long Time" (Bob Dylan) - 3:56
"The Quiet Joys of Brotherhood" (Music: Traditional; Lyrics: Richard Fariña) - 4:28
"Listen, Listen" - 3:58
"The Lady" - 4:01
"Bushes and Briars" - 3:53
"It Suits Me Well" - 5:05
"The Music Weaver" - 3:19
The remastered and reissued version included five bonus tracks:
"Here In Silence" (Peter Elford, Don Fraser) - 3:53
"Man of Iron" (Peter Elford, Don Fraser) - 7:40
"Sweet Rosemary" [Demo Version] - 3:00
"Ecoute, Ecoute" - 3:59
"It'll Take a Long Time" [Live Version] - 5:22
Personnel
Sandy Denny - lead vocals, acoustic guitar , piano
Richard Thompson - electric guitar , acoustic guitar , mandolin
Trevor Lucas - acoustic guitar
Sneaky Pete Kleinow - pedal steel guitar
Dave Swarbrick - violin
John Bundrick - organ , piano
Pat Donaldson - bass
Timi Donald - drums
John Kirkpatrick - concertina
Linda Thompson - vocals
Harry Robinson - string arrangement
Allen Toussaint - brass arrangement
uncredited musicians - autoharp , harmonica , flute organ
Production
Producer: Trevor Lucas
Recording Engineers: John Wood, Cy Frost
Art Direction: n/a
Photography: David Bailey
Liner Notes to 2005 re-release: David Suff
References
1972 albums
Sandy Denny albums
Island Records albums
A&M Records albums
|
```objective-c
#ifndef __VCG_SIMPLE_VOLUME
#define __VCG_SIMPLE_VOLUME
#include<vector>
namespace vcg
{
template <class VOX_TYPE>
class SimpleVolume
{
public:
typedef VOX_TYPE VoxelType;
std::vector<VoxelType> Vol;
Point3i sz; /// Dimensioni griglia come numero di celle per lato
const Point3i &ISize() {return sz;}; /// Dimensioni griglia come numero di celle per lato
void Init(Point3i _sz)
{
sz=_sz;
Vol.resize(sz[0]*sz[1]*sz[2]);
}
float Val(const int &x,const int &y,const int &z) const {
return cV(x,y,z).V();
//else return numeric_limits<float>::quiet_NaN( );
}
float &Val(const int &x,const int &y,const int &z) {
return V(x,y,z).V();
//else return numeric_limits<float>::quiet_NaN( );
}
VOX_TYPE &V(const int &x,const int &y,const int &z) {
return Vol[x+y*sz[0]+z*sz[0]*sz[1]];
}
const VOX_TYPE &cV(const int &x,const int &y,const int &z) const {
return Vol[x+y*sz[0]+z*sz[0]*sz[1]];
}
typedef enum { XAxis=0,YAxis=1,ZAxis=2} VolumeAxis;
template < class VertexPointerType, VolumeAxis AxisVal >
void GetIntercept(const vcg::Point3i &p1, const vcg::Point3i &p2, VertexPointerType &v, const float thr)
{
float f1 = Val(p1.X(), p1.Y(), p1.Z())-thr;
float f2 = Val(p2.X(), p2.Y(), p2.Z())-thr;
float u = (float) f1/(f1-f2);
if(AxisVal==XAxis) v->P().X() = (float) p1.X()*(1-u) + u*p2.X();
else v->P().X() = (float) p1.X();
if(AxisVal==YAxis) v->P().Y() = (float) p1.Y()*(1-u) + u*p2.Y();
else v->P().Y() = (float) p1.Y();
if(AxisVal==ZAxis) v->P().Z() = (float) p1.Z()*(1-u) + u*p2.Z();
else v->P().Z() = (float) p1.Z();
}
template < class VertexPointerType >
void GetXIntercept(const vcg::Point3i &p1, const vcg::Point3i &p2, VertexPointerType &v, const float thr)
{ GetIntercept<VertexPointerType,XAxis>(p1,p2,v,thr); }
template < class VertexPointerType >
void GetYIntercept(const vcg::Point3i &p1, const vcg::Point3i &p2, VertexPointerType &v, const float thr)
{ GetIntercept<VertexPointerType,YAxis>(p1,p2,v,thr); }
template < class VertexPointerType >
void GetZIntercept(const vcg::Point3i &p1, const vcg::Point3i &p2, VertexPointerType &v, const float thr)
{ GetIntercept<VertexPointerType,ZAxis>(p1,p2,v,thr); }
};
template <class VolumeType>
class RawVolumeImporter
{
public:
enum DataType
{
// Funzioni superiori
UNDEF=0,
BYTE=1,
SHORT=2,
FLOAT=3
};
static bool Open(const char *filename, VolumeType &V, Point3i sz, DataType d)
{
return true;
}
};
class SimpleVoxel
{
private:
float _v;
public:
float &V() {return _v;};
float V() const {return _v;};
};
} // end namespace
#endif // __VCG_SIMPLE_VOLUME
```
|
The Xe Bang Fai River (Nam Xebangfai) is a river in Laos. It originates in the Annamite Range on the border between Laos and Vietnam at . It flows through Khammouane Province and Savannakhet Province.
Xe Bang Fai River Cave
Xe Bang Fai River Cave is in Hin Namno National Park in Khammouane Province. It is believed to be one of the largest river caves in the world with passages some 120 meters tall and 200 meters wide, and a subterranean channel seven kilometres long.
Notes
References
External links
Account of a visit to the Xe Bang Fai cave in 2014
Account of a second visit to the Xe Bang Fai cave, Tham Khoun Xe in 2015
Rivers of Laos
Geography of Savannakhet province
Geography of Khammouane province
|
```javascript
'use strict';
const {Script} = require('vm');
const {
lookupCompiler,
removeShebang
} = require('./compiler');
const {
transformer
} = require('./transformer');
const objectDefineProperties = Object.defineProperties;
const MODULE_PREFIX = '(function (exports, require, module, __filename, __dirname) { ';
const STRICT_MODULE_PREFIX = MODULE_PREFIX + '"use strict"; ';
const MODULE_SUFFIX = '\n});';
/**
* Class Script
*
* @public
*/
class VMScript {
/**
* The script code with wrapping. If set will invalidate the cache.<br>
* Writable only for backwards compatibility.
*
* @public
* @readonly
* @member {string} code
* @memberOf VMScript#
*/
/**
* The filename used for this script.
*
* @public
* @readonly
* @since v3.9.0
* @member {string} filename
* @memberOf VMScript#
*/
/**
* The line offset use for stack traces.
*
* @public
* @readonly
* @since v3.9.0
* @member {number} lineOffset
* @memberOf VMScript#
*/
/**
* The column offset use for stack traces.
*
* @public
* @readonly
* @since v3.9.0
* @member {number} columnOffset
* @memberOf VMScript#
*/
/**
* The compiler to use to get the JavaScript code.
*
* @public
* @readonly
* @since v3.9.0
* @member {(string|compileCallback)} compiler
* @memberOf VMScript#
*/
/**
* The prefix for the script.
*
* @private
* @member {string} _prefix
* @memberOf VMScript#
*/
/**
* The suffix for the script.
*
* @private
* @member {string} _suffix
* @memberOf VMScript#
*/
/**
* The compiled vm.Script for the VM or if not compiled <code>null</code>.
*
* @private
* @member {?vm.Script} _compiledVM
* @memberOf VMScript#
*/
/**
* The compiled vm.Script for the NodeVM or if not compiled <code>null</code>.
*
* @private
* @member {?vm.Script} _compiledNodeVM
* @memberOf VMScript#
*/
/**
* The compiled vm.Script for the NodeVM in strict mode or if not compiled <code>null</code>.
*
* @private
* @member {?vm.Script} _compiledNodeVMStrict
* @memberOf VMScript#
*/
/**
* The resolved compiler to use to get the JavaScript code.
*
* @private
* @readonly
* @member {compileCallback} _compiler
* @memberOf VMScript#
*/
/**
* The script to run without wrapping.
*
* @private
* @member {string} _code
* @memberOf VMScript#
*/
/**
* Whether or not the script contains async functions.
*
* @private
* @member {boolean} _hasAsync
* @memberOf VMScript#
*/
/**
* Create VMScript instance.
*
* @public
* @param {string} code - Code to run.
* @param {(string|Object)} [options] - Options map or filename.
* @param {string} [options.filename="vm.js"] - Filename that shows up in any stack traces produced from this script.
* @param {number} [options.lineOffset=0] - Passed to vm.Script options.
* @param {number} [options.columnOffset=0] - Passed to vm.Script options.
* @param {(string|compileCallback)} [options.compiler="javascript"] - The compiler to use.
* @throws {VMError} If the compiler is unknown or if coffee-script was requested but the module not found.
*/
constructor(code, options) {
const sCode = `${code}`;
let useFileName;
let useOptions;
if (arguments.length === 2) {
if (typeof options === 'object') {
useOptions = options || {__proto__: null};
useFileName = useOptions.filename;
} else {
useOptions = {__proto__: null};
useFileName = options;
}
} else if (arguments.length > 2) {
// We do it this way so that there are no more arguments in the function.
// eslint-disable-next-line prefer-rest-params
useOptions = arguments[2] || {__proto__: null};
useFileName = options || useOptions.filename;
} else {
useOptions = {__proto__: null};
}
const {
compiler = 'javascript',
lineOffset = 0,
columnOffset = 0
} = useOptions;
// Throw if the compiler is unknown.
const resolvedCompiler = lookupCompiler(compiler);
objectDefineProperties(this, {
__proto__: null,
code: {
__proto__: null,
// Put this here so that it is enumerable, and looks like a property.
get() {
return this._prefix + this._code + this._suffix;
},
set(value) {
const strNewCode = String(value);
if (strNewCode === this._code && this._prefix === '' && this._suffix === '') return;
this._code = strNewCode;
this._prefix = '';
this._suffix = '';
this._compiledVM = null;
this._compiledNodeVM = null;
this._compiledCode = null;
},
enumerable: true
},
filename: {
__proto__: null,
value: useFileName || 'vm.js',
enumerable: true
},
lineOffset: {
__proto__: null,
value: lineOffset,
enumerable: true
},
columnOffset: {
__proto__: null,
value: columnOffset,
enumerable: true
},
compiler: {
__proto__: null,
value: compiler,
enumerable: true
},
_code: {
__proto__: null,
value: sCode,
writable: true
},
_prefix: {
__proto__: null,
value: '',
writable: true
},
_suffix: {
__proto__: null,
value: '',
writable: true
},
_compiledVM: {
__proto__: null,
value: null,
writable: true
},
_compiledNodeVM: {
__proto__: null,
value: null,
writable: true
},
_compiledNodeVMStrict: {
__proto__: null,
value: null,
writable: true
},
_compiledCode: {
__proto__: null,
value: null,
writable: true
},
_hasAsync: {
__proto__: null,
value: false,
writable: true
},
_compiler: {__proto__: null, value: resolvedCompiler}
});
}
/**
* Wraps the code.<br>
* This will replace the old wrapping.<br>
* Will invalidate the code cache.
*
* @public
* @deprecated Since v3.9.0. Wrap your code before passing it into the VMScript object.
* @param {string} prefix - String that will be appended before the script code.
* @param {script} suffix - String that will be appended behind the script code.
* @return {this} This for chaining.
* @throws {TypeError} If prefix or suffix is a Symbol.
*/
wrap(prefix, suffix) {
const strPrefix = `${prefix}`;
const strSuffix = `${suffix}`;
if (this._prefix === strPrefix && this._suffix === strSuffix) return this;
this._prefix = strPrefix;
this._suffix = strSuffix;
this._compiledVM = null;
this._compiledNodeVM = null;
this._compiledNodeVMStrict = null;
return this;
}
/**
* Compile this script. <br>
* This is useful to detect syntax errors in the script.
*
* @public
* @return {this} This for chaining.
* @throws {SyntaxError} If there is a syntax error in the script.
*/
compile() {
this._compileVM();
return this;
}
/**
* Get the compiled code.
*
* @private
* @return {string} The code.
*/
getCompiledCode() {
if (!this._compiledCode) {
const comp = this._compiler(this._prefix + removeShebang(this._code) + this._suffix, this.filename);
const res = transformer(null, comp, false, false, this.filename);
this._compiledCode = res.code;
this._hasAsync = res.hasAsync;
}
return this._compiledCode;
}
/**
* Compiles this script to a vm.Script.
*
* @private
* @param {string} prefix - JavaScript code that will be used as prefix.
* @param {string} suffix - JavaScript code that will be used as suffix.
* @return {vm.Script} The compiled vm.Script.
* @throws {SyntaxError} If there is a syntax error in the script.
*/
_compile(prefix, suffix) {
return new Script(prefix + this.getCompiledCode() + suffix, {
__proto__: null,
filename: this.filename,
displayErrors: false,
lineOffset: this.lineOffset,
columnOffset: this.columnOffset
});
}
/**
* Will return the cached version of the script intended for VM or compile it.
*
* @private
* @return {vm.Script} The compiled script
* @throws {SyntaxError} If there is a syntax error in the script.
*/
_compileVM() {
let script = this._compiledVM;
if (!script) {
this._compiledVM = script = this._compile('', '');
}
return script;
}
/**
* Will return the cached version of the script intended for NodeVM or compile it.
*
* @private
* @return {vm.Script} The compiled script
* @throws {SyntaxError} If there is a syntax error in the script.
*/
_compileNodeVM() {
let script = this._compiledNodeVM;
if (!script) {
this._compiledNodeVM = script = this._compile(MODULE_PREFIX, MODULE_SUFFIX);
}
return script;
}
/**
* Will return the cached version of the script intended for NodeVM in strict mode or compile it.
*
* @private
* @return {vm.Script} The compiled script
* @throws {SyntaxError} If there is a syntax error in the script.
*/
_compileNodeVMStrict() {
let script = this._compiledNodeVMStrict;
if (!script) {
this._compiledNodeVMStrict = script = this._compile(STRICT_MODULE_PREFIX, MODULE_SUFFIX);
}
return script;
}
}
exports.MODULE_PREFIX = MODULE_PREFIX;
exports.STRICT_MODULE_PREFIX = STRICT_MODULE_PREFIX;
exports.MODULE_SUFFIX = MODULE_SUFFIX;
exports.VMScript = VMScript;
```
|
```turing
#
# This software may be used and distributed according to the terms of the
# directory of this source tree.
$ . "${TEST_FIXTURES}/library.sh"
$ REPOTYPE="blob_files"
$ ENABLED_DERIVED_DATA='["git_commits", "git_trees", "git_delta_manifests_v2", "unodes", "filenodes", "hgchangesets"]' setup_common_config $REPOTYPE
$ GIT_REPO_ORIGIN="${TESTTMP}/origin/repo-git"
$ GIT_REPO_SUBMODULE="${TESTTMP}/origin/repo-submodule"
$ GIT_REPO="${TESTTMP}/repo-git"
$ HG_REPO="${TESTTMP}/repo-hg"
$ BUNDLE_PATH="${TESTTMP}/repo_bundle.bundle"
$ cat >> repos/repo/server.toml <<EOF
> [source_control_service]
> permit_writes = true
> EOF
# Setup submodule git repository
$ mkdir -p "$GIT_REPO_SUBMODULE"
$ cd "$GIT_REPO_SUBMODULE"
$ git init -q
$ echo "this is submodule file1" > sub_file1
$ git add sub_file1
$ git commit -q -am "Add submodule file1"
$ echo "this is submodule file2" > sub_file2
$ git add sub_file2
$ git commit -q -am "Add submodule file2"
# Setup git repository
$ mkdir -p "$GIT_REPO_ORIGIN"
$ cd "$GIT_REPO_ORIGIN"
$ git init -q
$ echo "this is file1" > file1
$ git add file1
$ git commit -q -am "Add file1"
$ git tag -a -m"new tag" first_tag
$ echo "this is file2" > file2
$ git add file2
$ git commit -q -am "Add file2"
# Add a submodule in this repository (use relative path as $TESTTMP in a commit makes the hash unstable)
$ git submodule add "../repo-submodule"
Cloning into '$TESTTMP/origin/repo-git/repo-submodule'...
done.
$ git add .
$ git commit -q -am "Add a new submodule"
$ git tag -a empty_tag -m ""
$ cd "$TESTTMP"
$ git clone "$GIT_REPO_ORIGIN"
Cloning into 'repo-git'...
done.
# Capture all the known Git objects from the repo
$ cd $GIT_REPO
$ git fetch "$GIT_REPO_ORIGIN" +refs/*:refs/* --prune -u
From $TESTTMP/origin/repo-git
- [deleted] (none) -> origin/master
(refs/remotes/origin/HEAD has become dangling)
$ git rev-list --objects --all | git cat-file --batch-check='%(objectname) %(objecttype) %(rest)' | sort > $TESTTMP/object_list
$ cat $TESTTMP/object_list
433eb172726bc7b6d60e8d68efb0f0ef4e67a667 blob file1
441e95750f7eb05137204a7684a4cafe7cc0da0f blob .gitmodules
7327e6c9b533787eeb80877d557d50f39c480f54 tree
7565d37e20d5b551bee27c9676e4856d47bc1806 tree
7aa1d50cd2865dd8fd86444d7a8ff5b2a23fe3b2 tag empty_tag
8963e1f55d1346a07c3aec8c8fc72bf87d0452b1 tag first_tag
8ce3eae44760b500bf3f2c3922a95dcd3c908e9e commit
cb2ef838eb24e4667fee3a8b89c930234ae6e4bb tree
e8615d6f149b876be0a2f30a1c5bf0c42bf8e136 commit
f138820097c8ef62a012205db0b1701df516f6d5 blob file2
fbae2e73cbaa3acf4d844c32bcbd5c79e722630d commit
# Get the repository log
$ git log --pretty=format:"%h %an %s %D" > $TESTTMP/repo_log
$ cat $TESTTMP/repo_log
fbae2e7 mononoke Add a new submodule HEAD -> master, tag: empty_tag
e8615d6 mononoke Add file2
8ce3eae mononoke Add file1 tag: first_tag (no-eol)
# Look at the commit that introduced the submodule:
# The .gitmodules file gets updated. a new blob of type: submodule gets added at repo-submodule that is the actual submodule
$ git show fbae2e7
commit fbae2e73cbaa3acf4d844c32bcbd5c79e722630d
Author: mononoke <mononoke@mononoke>
Date: Sat Jan 1 00:00:00 2000 +0000
Add a new submodule
diff --git a/.gitmodules b/.gitmodules
new file mode 100644
index 0000000..441e957
--- /dev/null
+++ b/.gitmodules
@@ -0,0 +1,3 @@
+[submodule "repo-submodule"]
+ path = repo-submodule
+ url = ../repo-submodule
diff --git a/repo-submodule b/repo-submodule
new file mode 160000
index 0000000..de0c53c
--- /dev/null
+++ b/repo-submodule
@@ -0,0 +1 @@
+Subproject commit de0c53cc213a98b1382aec1dcbcb01bf088273e4
# Import it into Mononoke
$ cd "$TESTTMP"
$ with_stripped_logs gitimport "$GIT_REPO" --generate-bookmarks --discard-submodules full-repo
using repo "repo" repoid RepositoryId(0)
GitRepo:$TESTTMP/repo-git commit 3 of 3 - Oid:fbae2e73 => Bid:4cd77220
Ref: "refs/heads/master": Some(ChangesetId(Blake2(your_sha256_hash)))
Ref: "refs/tags/empty_tag": Some(ChangesetId(Blake2(your_sha256_hash)))
Ref: "refs/tags/first_tag": Some(ChangesetId(Blake2(your_sha256_hash)))
Initializing repo: repo
Initialized repo: repo
All repos initialized. It took: * seconds (glob)
Bookmark: "heads/master": ChangesetId(Blake2(your_sha256_hash)) (created)
Bookmark: "tags/empty_tag": ChangesetId(Blake2(your_sha256_hash)) (created)
Bookmark: "tags/first_tag": ChangesetId(Blake2(your_sha256_hash)) (created)
# We can see that the bonsai changesets graph we created looks correct
$ mononoke_newadmin changelog -R repo graph -i your_sha256_hash -M -I
o message: Add a new submodule
, id: your_sha256_hash
o message: Add file2
, id: your_sha256_hash
o message: Add file1
, id: your_sha256_hash
# Look at the commit that introduced the submodule:
# While the edit to the normal file: `.gitmodules` is preserved, the addition of the submodule itself was removed
# from the commit at import time.
$ mononoke_newadmin fetch -R repo -i your_sha256_hash
BonsaiChangesetId: your_sha256_hash
Author: mononoke <mononoke@mononoke>
Message: Add a new submodule
FileChanges:
ADDED/MODIFIED: .gitmodules your_sha256_hash
# Note: with the current git-bundle implementation, we cannot generate a bundle from this at the moment
$ mononoke_newadmin git-bundle create from-repo -R repo --output-location "$BUNDLE_PATH"
Error: Error in generating pack item stream
Caused by:
0: Error while calculating object count
*: a batch dependency has not been derived (glob) (?)
*: failed to derive batch dependencies (glob) (?)
1: Error in deriving RootGitDeltaManifestV2Id for changeset ChangesetId(Blake2(your_sha256_hash))
2: failed to derive dependent types
*: failed to derive git_trees batch (start:your_sha256_hash, end:your_sha256_hash) (glob)
*: Raw Git tree with hash fc59e10f3c37ad53e0af6882e382f0169eae51ac should have been present already (glob)
*: The object corresponding to object ID fc59e10f3c37ad53e0af6882e382f0169eae51ac or its packfile item does not exist in the data store (glob)
[1]
```
|
```protocol buffer
syntax = "proto3";
package envoy.type.matcher;
import "envoy/type/matcher/regex.proto";
import "envoy/annotations/deprecation.proto";
import "udpa/annotations/status.proto";
import "validate/validate.proto";
option java_package = "io.envoyproxy.envoy.type.matcher";
option java_outer_classname = "StringProto";
option java_multiple_files = true;
option go_package = "github.com/envoyproxy/go-control-plane/envoy/type/matcher";
option (udpa.annotations.file_status).package_version_status = FROZEN;
// [#protodoc-title: String matcher]
// Specifies the way to match a string.
// [#next-free-field: 7]
message StringMatcher {
oneof match_pattern {
option (validate.required) = true;
// The input string must match exactly the string specified here.
//
// Examples:
//
// * *abc* only matches the value *abc*.
string exact = 1;
// The input string must have the prefix specified here.
// Note: empty prefix is not allowed, please use regex instead.
//
// Examples:
//
// * *abc* matches the value *abc.xyz*
string prefix = 2 [(validate.rules).string = {min_len: 1}];
// The input string must have the suffix specified here.
// Note: empty prefix is not allowed, please use regex instead.
//
// Examples:
//
// * *abc* matches the value *xyz.abc*
string suffix = 3 [(validate.rules).string = {min_len: 1}];
// The input string must match the regular expression specified here.
// The regex grammar is defined `here
// <path_to_url`_.
//
// Examples:
//
// * The regex ``\d{3}`` matches the value *123*
// * The regex ``\d{3}`` does not match the value *1234*
// * The regex ``\d{3}`` does not match the value *123.456*
//
// .. attention::
// This field has been deprecated in favor of `safe_regex` as it is not safe for use with
// untrusted input in all cases.
string regex = 4 [
deprecated = true,
(validate.rules).string = {max_bytes: 1024},
(envoy.annotations.disallowed_by_default) = true
];
// The input string must match the regular expression specified here.
RegexMatcher safe_regex = 5 [(validate.rules).message = {required: true}];
}
// If true, indicates the exact/prefix/suffix matching should be case insensitive. This has no
// effect for the safe_regex match.
// For example, the matcher *data* will match both input string *Data* and *data* if set to true.
bool ignore_case = 6;
}
// Specifies a list of ways to match a string.
message ListStringMatcher {
repeated StringMatcher patterns = 1 [(validate.rules).repeated = {min_items: 1}];
}
```
|
```smalltalk
using System.Linq;
using Microsoft.Dafny.LanguageServer.Language;
using Xunit;
namespace Microsoft.Dafny.LanguageServer.IntegrationTest.Unit;
public class TextReaderFromCharArraysTest {
[Fact]
public void ReadBlockEmptyMiddle() {
var fourAs = new[] { 'a', 'a', 'a', 'a' };
var chunks = new[] { fourAs, new char[] { }, fourAs };
var emptyMiddleReader = new TextReaderFromCharArrays(chunks);
var end = emptyMiddleReader.ReadToEnd();
Assert.Equal("aaaaaaaa", end);
}
[Fact]
public void ReadPeekEmptyStart() {
var emptyStart = new[] { new char[] { }, new[] { 'a', 'b', 'c', 'd' } };
var emptyStartReader = new TextReaderFromCharArrays(emptyStart);
var firstPeek = emptyStartReader.Peek();
var firstRead = emptyStartReader.Read();
Assert.Equal('a', firstPeek);
Assert.Equal('a', firstRead);
}
[Fact]
public void ReadEmptyMiddle() {
var emptyMiddleReader = new TextReaderFromCharArrays(new[] { new[] { 'a' }, new char[] { }, new[] { 'b' } });
var a = emptyMiddleReader.Read();
var b = emptyMiddleReader.Read();
Assert.Equal('a', a);
Assert.Equal('b', b);
}
[Fact]
public void ReadMoreThanContent() {
var abcd = new[] { 'a', 'b', 'c', 'd' };
var chunks = new[] { abcd, abcd };
var reader = new TextReaderFromCharArrays(chunks);
var buffer = new char[1024];
var readCount = reader.Read(buffer, 0, buffer.Length);
Assert.Equal(8, readCount);
Assert.Equal("abcdabcd", new string(buffer.Take(8).ToArray()));
}
[Fact]
public void ReadPerChar() {
var ab = new[] { 'a', 'b' };
var chunks = new[] { ab };
var reader = new TextReaderFromCharArrays(chunks);
var first = reader.Read();
var second = reader.Read();
var third = reader.Read();
Assert.Equal('a', first);
Assert.Equal('b', second);
Assert.Equal(-1, third);
}
}
```
|
```objective-c
% ROUNDTRIP Test utility which (1) writes a MATLAB
% table to a Feather V1 file and then (2) reads the
% resulting the Feather V1 file back into MATLAB
% as a table.
% contributor license agreements. See the NOTICE file distributed with
% this work for additional information regarding copyright ownership.
%
% path_to_url
%
% Unless required by applicable law or agreed to in writing, software
% WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
function tRead = roundtrip(filename, tWrite)
arguments
filename (1, 1) string
tWrite table
end
featherwrite(filename, tWrite);
tRead = featherread(filename);
end
```
|
The Nagore Durgha (or Nagore Dargah) is a shrine in Singapore built by Muslims from southern India between 1828 and 1830, and was originally known as Shahul Hamid Dargha. When this shrine was first built, Telok Ayer Street where the shrine is located was a sandy beach crowded with sailing craft. While its physical surroundings have changed beyond recognition, the monument itself – save for conservation and preservation work in 2007 – has changed little since the late 19th century. It has a unique blend of Classical and Indian Muslim motifs.
History
Nagore Durgha was built to commemorate a visit to the island by a Muslim holy man of the Chulia people (Muslims from India's Coromandel Coast), who was travelling around Southeast Asia propagating the teachings of Islam. The land on which the shrine stands was granted to a certain man named Kaderpillai in 1827 on condition that it was not to be used for a building of wood and attap.
In 1893, by an order of court, the Nagore Durgha property came under new trustees who were also appointed for the Masjid Al-Abrar. The building resembles a multi-tiered wedding cake, its sharp arches decorated with intricate moldings. The architectural features of the building blend classical motifs like moulded arches and columns with Indian Muslim elements such as perforated grilles at the roof. In 1974, it was gazetted a national monument.
The shrine was closed in the 1990s due to fears that the structure would weaken. Restoration works to turn the shrine into an Indian Muslim heritage centre started in January 2007 and were due to be completed in the fourth quarter of the same year at a cost of S$1.8 million. President S. R. Nathan attended a fund-raising event organised by Indian Muslims on 3 December 2006; at that time, the community had raised $200,000.
Architecture
The most interesting visual feature of Nagore Durgha is its facade: two arched windows flank an arched doorway, with columns in between. Above these is a "miniature palace" – a massive replica of the facade of a palace, with tiny cutout windows and a small arched doorway in the middle. The cutouts in white plaster make the facade look like lace. From the corners of the facade, two 14-level minarets rise, with three little domed cutouts on each level and onion domes on top. Inside, the prayer halls and two shrines are painted and decorated in bright colours.
References
Further reading
.
.
External links
Singapore Nagore Dargah – A Sacred Space to Celebrate Islamic Spirituality
Official website of Nagore Dargah, Singapore (www.ndsociety.sg)
Religious buildings and structures completed in 1830
Chinatown, Singapore
Ethnic museums in Singapore
Islam in Singapore
National monuments of Singapore
Outram, Singapore
Religious museums in Singapore
Religious buildings and structures in Singapore
1830 establishments in the British Empire
Islamic shrines
19th-century architecture in Singapore
|
```python
# or more contributor license agreements. See the NOTICE file
# distributed with this work for additional information
# regarding copyright ownership. The ASF licenses this file
#
# path_to_url
#
# Unless required by applicable law or agreed to in writing,
# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
# specific language governing permissions and limitations
#
def make_messy_frame(num_rows, num_cols, num_cats, num_ints):
fid = open("/etc/dictionaries-common/words")
words=[line.strip() for line in fid.readlines()]
perm = np.random.permutation(num_cols)
num_catints = num_cats + num_ints
float_ids = perm[num_catints:]
int_ids = perm[num_cats:num_catints]
cat_ids = perm[0:num_cats]
d = {}
dtypes = {}
for col in cat_ids:
X = np.zeros((num_rows,), dtype=np.object);
for row in xrange(0, num_rows):
num_newlines = np.random.randint(3,7)
num_commas = np.random.randint(3,7)
X[row] = ""
tricky_delims = np.asarray(["\n"] * num_newlines + [","] * num_commas)
np.random.shuffle(tricky_delims)
for delim in tricky_delims:
X[row] += string.join(random.sample(words, 5), ' ')
X[row] += delim
X[row] += string.join(random.sample(words, 5), ' ')
d[col] = X
dtypes[col] = 'string'
for col in float_ids:
d[col] = np.random.randn(num_rows)
dtypes[col] = 'float'
min_int = [0, -2**7, 0 , -2**15, 0, -2**31, 0, -2**62]
max_int = [2**8, 2**7, 2**16, 2**15, 2**32, 2**31, 2**62, 2**62]
dtypes_int = ["uint8", "int8", "uint16", "int16", "uint32", "int32", "uint64", "int64"]
for col in int_ids:
j = np.random.randint(0, len(min_int))
d[col] = np.random.randint(min_int[j], max_int[j], num_rows)
dtypes[col] = dtypes_int[j]
return d, dtypes
```
|
```smalltalk
/*
* PROJECT: Atomix Development
* LICENSE: BSD 3-Clause (LICENSE.md)
* PURPOSE: fmul x86 instruction
* PROGRAMMERS: Aman Priyadarshi (aman.eureka@gmail.com)
*/
namespace Atomix.Assembler.x86
{
public class Fmul : OnlyDestination
{
public Fmul()
: base("fmul") { }
}
}
```
|
```python
# mypy: allow-untyped-defs
import inspect
from typing import Any, Callable, Dict, Iterable, Optional, Tuple, Type, Union
import torch
from torch._streambase import _EventBase, _StreamBase
get_cuda_stream: Optional[Callable[[int], int]]
if torch.cuda._is_compiled():
from torch._C import _cuda_getCurrentRawStream as get_cuda_stream
else:
get_cuda_stream = None
_device_t = Union[torch.device, str, int, None]
# Recording the device properties in the main process but used in worker process.
caching_worker_device_properties: Dict[str, Any] = {}
caching_worker_current_devices: Dict[str, int] = {}
class DeviceInterfaceMeta(type):
def __new__(metacls, *args, **kwargs):
class_member = args[2]
if "Event" in class_member:
assert inspect.isclass(class_member["Event"]) and issubclass(
class_member["Event"], _EventBase
), "DeviceInterface member Event should be inherit from _EventBase"
if "Stream" in class_member:
assert inspect.isclass(class_member["Stream"]) and issubclass(
class_member["Stream"], _StreamBase
), "DeviceInterface member Stream should be inherit from _StreamBase"
return super().__new__(metacls, *args, **kwargs)
class DeviceInterface(metaclass=DeviceInterfaceMeta):
"""
This is a simple device runtime interface for Inductor. It enables custom
backends to be integrated with Inductor in a device-agnostic semantic.
"""
class device:
def __new__(cls, device: _device_t):
raise NotImplementedError
class Worker:
"""
Worker API to query device properties that will work in multi processing
workers that cannot use the GPU APIs (due to processing fork() and
initialization time issues). Properties are recorded in the main process
before we fork the workers.
"""
@staticmethod
def set_device(device: int):
raise NotImplementedError
@staticmethod
def current_device() -> int:
raise NotImplementedError
@staticmethod
def get_device_properties(device: _device_t = None):
raise NotImplementedError
@staticmethod
def current_device():
raise NotImplementedError
@staticmethod
def set_device(device: _device_t):
raise NotImplementedError
@staticmethod
def maybe_exchange_device(device: int) -> int:
raise NotImplementedError
@staticmethod
def exchange_device(device: int) -> int:
raise NotImplementedError
@staticmethod
def device_count():
raise NotImplementedError
@staticmethod
def is_available() -> bool:
raise NotImplementedError
@staticmethod
def stream(stream: torch.Stream):
raise NotImplementedError
@staticmethod
def current_stream():
raise NotImplementedError
@staticmethod
def set_stream(stream: torch.Stream):
raise NotImplementedError
@staticmethod
def _set_stream_by_id(stream_id: int, device_index: int, device_type: int):
raise NotImplementedError
@staticmethod
def get_raw_stream():
raise NotImplementedError
@staticmethod
def synchronize(device: _device_t = None):
raise NotImplementedError
@staticmethod
def get_device_properties(device: _device_t = None):
raise NotImplementedError
@staticmethod
def get_compute_capability(device: _device_t = None):
raise NotImplementedError
@staticmethod
def is_bf16_supported(including_emulation: bool = False):
raise NotImplementedError
class DeviceGuard:
"""
This class provides a context manager for device switching. This is a stripped
down version of torch.{device_name}.device.
The context manager changes the current device to the given device index
on entering the context and restores the original device on exiting.
The device is switched using the provided device interface.
"""
def __init__(
self, device_interface: Type[DeviceInterface], index: Optional[int]
) -> None:
self.device_interface = device_interface
self.idx = index
self.prev_idx = -1
def __enter__(self):
if self.idx is not None:
self.prev_idx = self.device_interface.exchange_device(self.idx)
def __exit__(self, type: Any, value: Any, traceback: Any):
if self.idx is not None:
self.idx = self.device_interface.maybe_exchange_device(self.prev_idx)
return False
class CudaInterface(DeviceInterface):
device = torch.cuda.device
# register Event and Stream class into the backend interface
# make sure Event and Stream are implemented and inherited from the _EventBase and _StreamBase
Event = torch.cuda.Event
Stream = torch.cuda.Stream
class Worker:
@staticmethod
def set_device(device: int):
caching_worker_current_devices["cuda"] = device
@staticmethod
def current_device() -> int:
if "cuda" in caching_worker_current_devices:
return caching_worker_current_devices["cuda"]
return torch.cuda.current_device()
@staticmethod
def get_device_properties(device: _device_t = None):
if device is not None:
if isinstance(device, str):
device = torch.device(device)
assert device.type == "cuda"
if isinstance(device, torch.device):
device = device.index
if device is None:
device = CudaInterface.Worker.current_device()
if "cuda" not in caching_worker_device_properties:
device_prop = [
torch.cuda.get_device_properties(i)
for i in range(torch.cuda.device_count())
]
caching_worker_device_properties["cuda"] = device_prop
return caching_worker_device_properties["cuda"][device]
current_device = staticmethod(torch.cuda.current_device)
set_device = staticmethod(torch.cuda.set_device)
device_count = staticmethod(torch.cuda.device_count)
stream = staticmethod(torch.cuda.stream) # type: ignore[assignment]
current_stream = staticmethod(torch.cuda.current_stream)
set_stream = staticmethod(torch.cuda.set_stream) # type: ignore[assignment]
_set_stream_by_id = staticmethod(torch.cuda._set_stream_by_id) # type: ignore[assignment]
synchronize = staticmethod(torch.cuda.synchronize)
get_device_properties = staticmethod(torch.cuda.get_device_properties) # type: ignore[assignment]
get_raw_stream = staticmethod(get_cuda_stream) # type: ignore[arg-type]
exchange_device = staticmethod(torch.cuda._exchange_device) # type: ignore[arg-type]
maybe_exchange_device = staticmethod(torch.cuda._maybe_exchange_device) # type: ignore[arg-type]
is_bf16_supported = staticmethod(torch.cuda.is_bf16_supported) # type: ignore[arg-type]
# Can be mock patched by @patch decorator.
@staticmethod
def is_available() -> bool:
return torch.cuda.is_available()
@staticmethod
def get_compute_capability(device: _device_t = None):
if torch.version.hip is None:
major, min = torch.cuda.get_device_capability(device)
return major * 10 + min
else:
return torch.cuda.get_device_properties(device).gcnArchName.split(":", 1)[0]
get_xpu_stream: Optional[Callable[[int], int]]
if torch.xpu._is_compiled():
from torch._C import _xpu_getCurrentRawStream as get_xpu_stream
else:
get_xpu_stream = None
class XpuInterface(DeviceInterface):
device = torch.xpu.device
Event = torch.xpu.Event
Stream = torch.xpu.Stream
class Worker:
@staticmethod
def set_device(device: int):
caching_worker_current_devices["xpu"] = device
@staticmethod
def current_device() -> int:
if "xpu" in caching_worker_current_devices:
return caching_worker_current_devices["xpu"]
return torch.xpu.current_device()
@staticmethod
def get_device_properties(device: _device_t = None):
if device is not None:
if isinstance(device, str):
device = torch.device(device)
assert device.type == "xpu"
if isinstance(device, torch.device):
device = device.index
if device is None:
device = XpuInterface.Worker.current_device()
if "xpu" not in caching_worker_device_properties:
device_prop = [
torch.xpu.get_device_properties(i)
for i in range(torch.xpu.device_count())
]
caching_worker_device_properties["xpu"] = device_prop
return caching_worker_device_properties["xpu"][device]
current_device = staticmethod(torch.xpu.current_device)
set_device = staticmethod(torch.xpu.set_device)
device_count = staticmethod(torch.xpu.device_count)
stream = staticmethod(torch.xpu.stream) # type: ignore[assignment]
current_stream = staticmethod(torch.xpu.current_stream)
set_stream = staticmethod(torch.xpu.set_stream) # type: ignore[assignment]
_set_stream_by_id = staticmethod(torch.xpu._set_stream_by_id) # type: ignore[assignment]
synchronize = staticmethod(torch.xpu.synchronize)
get_device_properties = staticmethod(torch.xpu.get_device_properties) # type: ignore[assignment]
get_raw_stream = staticmethod(get_xpu_stream) # type: ignore[arg-type]
exchange_device = staticmethod(torch.xpu._exchange_device) # type: ignore[arg-type]
maybe_exchange_device = staticmethod(torch.xpu._maybe_exchange_device) # type: ignore[arg-type]
# Can be mock patched by @patch decorator.
@staticmethod
def is_available() -> bool:
return torch.xpu.is_available()
@staticmethod
def get_compute_capability(device: _device_t = None):
cc = torch.xpu.get_device_capability(device)
return cc
@staticmethod
def is_bf16_supported(including_emulation: bool = False) -> bool:
return torch.xpu.is_bf16_supported()
device_interfaces: Dict[str, Type[DeviceInterface]] = {}
_device_initialized = False
def register_interface_for_device(
device: Union[str, torch.device], device_interface: Type[DeviceInterface]
):
if isinstance(device, torch.device):
device = str(device)
device_interfaces[device] = device_interface
def get_interface_for_device(device: Union[str, torch.device]) -> Type[DeviceInterface]:
if isinstance(device, torch.device):
device = str(device)
if not _device_initialized:
init_device_reg()
if device in device_interfaces:
return device_interfaces[device]
raise NotImplementedError(f"No interface for device {device}")
def get_registered_device_interfaces() -> Iterable[Tuple[str, Type[DeviceInterface]]]:
if not _device_initialized:
init_device_reg()
return device_interfaces.items()
def init_device_reg():
global _device_initialized
register_interface_for_device("cuda", CudaInterface)
for i in range(torch.cuda.device_count()):
register_interface_for_device(f"cuda:{i}", CudaInterface)
register_interface_for_device("xpu", XpuInterface)
for i in range(torch.xpu.device_count()):
register_interface_for_device(f"xpu:{i}", XpuInterface)
_device_initialized = True
```
|
```asciidoc
= nats_stream
:type: output
:status: stable
:categories: ["Services"]
////
THIS FILE IS AUTOGENERATED!
To make changes, edit the corresponding source file under:
path_to_url
And:
path_to_url
////
// 2024 Redpanda Data Inc.
component_type_dropdown::[]
Publish to a NATS Stream subject.
[tabs]
======
Common::
+
--
```yml
# Common config fields, showing default values
output:
label: ""
nats_stream:
urls: [] # No default (required)
cluster_id: "" # No default (required)
subject: "" # No default (required)
client_id: ""
max_in_flight: 64
```
--
Advanced::
+
--
```yml
# All config fields, showing default values
output:
label: ""
nats_stream:
urls: [] # No default (required)
cluster_id: "" # No default (required)
subject: "" # No default (required)
client_id: ""
max_in_flight: 64
tls:
enabled: false
skip_cert_verify: false
enable_renegotiation: false
root_cas: ""
root_cas_file: ""
client_certs: []
auth:
nkey_file: ./seed.nk # No default (optional)
user_credentials_file: ./user.creds # No default (optional)
user_jwt: "" # No default (optional)
user_nkey_seed: "" # No default (optional)
inject_tracing_map: meta = @.merge(this) # No default (optional)
```
--
======
[CAUTION]
.Deprecation notice
====
The NATS Streaming Server is being deprecated. Critical bug fixes and security fixes will be applied until June of 2023. NATS-enabled applications requiring persistence should use path_to_url
====
== Authentication
There are several components within Redpanda Connect which uses NATS services. You will find that each of these components
support optional advanced authentication parameters for path_to_url
and path_to_url Credentials^].
See an path_to_url tutorial^].
=== NKey file
The NATS server can use these NKeys in several ways for authentication. The simplest is for the server to be configured
with a list of known public keys and for the clients to respond to the challenge by signing it with its private NKey
configured in the `nkey_file` field.
path_to_url details^].
=== User credentials
NATS server supports decentralized authentication based on JSON Web Tokens (JWT). Clients need an path_to_url#json-web-tokens[user JWT^]
and a corresponding path_to_url secret^] when connecting to a server
which is configured to use this authentication scheme.
The `user_credentials_file` field should point to a file containing both the private key and the JWT and can be
generated with the path_to_url tool^].
Alternatively, the `user_jwt` field can contain a plain text JWT and the `user_nkey_seed`can contain
the plain text NKey Seed.
path_to_url details^].
== Performance
This output benefits from sending multiple messages in flight in parallel for improved performance. You can tune the max number of in flight messages (or message batches) with the field `max_in_flight`.
== Fields
=== `urls`
A list of URLs to connect to. If an item of the list contains commas it will be expanded into multiple URLs.
*Type*: `array`
```yml
# Examples
urls:
- nats://127.0.0.1:4222
urls:
- nats://username:password@127.0.0.1:4222
```
=== `cluster_id`
The cluster ID to publish to.
*Type*: `string`
=== `subject`
The subject to publish to.
*Type*: `string`
=== `client_id`
The client ID to connect with.
*Type*: `string`
*Default*: `""`
=== `max_in_flight`
The maximum number of messages to have in flight at a given time. Increase this to improve throughput.
*Type*: `int`
*Default*: `64`
=== `tls`
Custom TLS settings can be used to override system defaults.
*Type*: `object`
=== `tls.enabled`
Whether custom TLS settings are enabled.
*Type*: `bool`
*Default*: `false`
=== `tls.skip_cert_verify`
Whether to skip server side certificate verification.
*Type*: `bool`
*Default*: `false`
=== `tls.enable_renegotiation`
Whether to allow the remote server to repeatedly request renegotiation. Enable this option if you're seeing the error message `local error: tls: no renegotiation`.
*Type*: `bool`
*Default*: `false`
Requires version 3.45.0 or newer
=== `tls.root_cas`
An optional root certificate authority to use. This is a string, representing a certificate chain from the parent trusted root certificate, to possible intermediate signing certificates, to the host certificate.
[CAUTION]
====
This field contains sensitive information that usually shouldn't be added to a config directly, read our xref:configuration:secrets.adoc[secrets page for more info].
====
*Type*: `string`
*Default*: `""`
```yml
# Examples
root_cas: |-
-----BEGIN CERTIFICATE-----
...
-----END CERTIFICATE-----
```
=== `tls.root_cas_file`
An optional path of a root certificate authority file to use. This is a file, often with a .pem extension, containing a certificate chain from the parent trusted root certificate, to possible intermediate signing certificates, to the host certificate.
*Type*: `string`
*Default*: `""`
```yml
# Examples
root_cas_file: ./root_cas.pem
```
=== `tls.client_certs`
A list of client certificates to use. For each certificate either the fields `cert` and `key`, or `cert_file` and `key_file` should be specified, but not both.
*Type*: `array`
*Default*: `[]`
```yml
# Examples
client_certs:
- cert: foo
key: bar
client_certs:
- cert_file: ./example.pem
key_file: ./example.key
```
=== `tls.client_certs[].cert`
A plain text certificate to use.
*Type*: `string`
*Default*: `""`
=== `tls.client_certs[].key`
A plain text certificate key to use.
[CAUTION]
====
This field contains sensitive information that usually shouldn't be added to a config directly, read our xref:configuration:secrets.adoc[secrets page for more info].
====
*Type*: `string`
*Default*: `""`
=== `tls.client_certs[].cert_file`
The path of a certificate to use.
*Type*: `string`
*Default*: `""`
=== `tls.client_certs[].key_file`
The path of a certificate key to use.
*Type*: `string`
*Default*: `""`
=== `tls.client_certs[].password`
A plain text password for when the private key is password encrypted in PKCS#1 or PKCS#8 format. The obsolete `pbeWithMD5AndDES-CBC` algorithm is not supported for the PKCS#8 format.
Because the obsolete pbeWithMD5AndDES-CBC algorithm does not authenticate the ciphertext, it is vulnerable to padding oracle attacks that can let an attacker recover the plaintext.
[CAUTION]
====
This field contains sensitive information that usually shouldn't be added to a config directly, read our xref:configuration:secrets.adoc[secrets page for more info].
====
*Type*: `string`
*Default*: `""`
```yml
# Examples
password: foo
password: ${KEY_PASSWORD}
```
=== `auth`
Optional configuration of NATS authentication parameters.
*Type*: `object`
=== `auth.nkey_file`
An optional file containing a NKey seed.
*Type*: `string`
```yml
# Examples
nkey_file: ./seed.nk
```
=== `auth.user_credentials_file`
An optional file containing user credentials which consist of an user JWT and corresponding NKey seed.
*Type*: `string`
```yml
# Examples
user_credentials_file: ./user.creds
```
=== `auth.user_jwt`
An optional plain text user JWT (given along with the corresponding user NKey Seed).
[CAUTION]
====
This field contains sensitive information that usually shouldn't be added to a config directly, read our xref:configuration:secrets.adoc[secrets page for more info].
====
*Type*: `string`
=== `auth.user_nkey_seed`
An optional plain text user NKey Seed (given along with the corresponding user JWT).
[CAUTION]
====
This field contains sensitive information that usually shouldn't be added to a config directly, read our xref:configuration:secrets.adoc[secrets page for more info].
====
*Type*: `string`
=== `inject_tracing_map`
EXPERIMENTAL: A xref:guides:bloblang/about.adoc[Bloblang mapping] used to inject an object containing tracing propagation information into outbound messages. The specification of the injected fields will match the format used by the service wide tracer.
*Type*: `string`
Requires version 4.23.0 or newer
```yml
# Examples
inject_tracing_map: meta = @.merge(this)
inject_tracing_map: root.meta.span = this
```
```
|
A dog crate (sometimes dog cage) is a metal, wire, plastic, or fabric enclosure with a door in which a dog may be kept for security or transportation. Dog crates are designed to replicate a dog's natural den and as such can provide them with a place of refuge at home or when traveling to new surroundings. Other common reasons for using a dog crate are for toilet training a new puppy, transporting a dog, limiting access while the dog learns rules, ensuring the dog's safety, confining a dog in locations where dogs cannot safely or legally roam freely, or giving a dog a place to go when visitors come to the house.
Crate training accustoms the dog to the crate so that they can rest in it without stress.
Using a crate for a dog is similar to having a playpen for a toddler or a crib for a baby, and allows the owner to take their eyes off their pet. However, misuse (such as prolonged locking) can cause the dog psychological harm.
Types
There are many types of dog crates, and variations within the types. Factors to consider when choosing an appropriate crate include cost, durability, portability, safety, and style.
Solid plastic crates are usually more suitable than other types for secure travel, such as in an airplane. They might also be safer in a car accident than wire crates. Disadvantages are that they take up a lot of space and do not fold for storage.
Travel Crates are designed specifically for use in vehicles for pet vehicle transportation. These crates are not intended for use on airplanes or for carrying pets outside of vehicles. They also do not make good housebreaking crates.
Aluminum crates can be either fixed or folding. A few of their advantages are: light weight, very strong when constructed with appropriate bracing, will not rust, excellent airflow and vision for the dogs. Aluminum crates are suitable for use at veterinary hospitals, car travel, as a permanent "den" for your dog inside the home and in breeding kennel environments. Some aluminum crates have solid walls and some have bars. The crates with bars may be more suitable for dogs who need to see out to feel comfortable. Other dogs may prefer the den like feel of the solid wall variety to feel secure.
Wire crates usually can be folded for storage or transport, although it might be difficult to do and they are fairly heavy for their size. They provide more airflow for the dog and provide people with a clearer view inside and they range in size. Such crates are often used in car travel, at veterinary hospitals, and at kennels. There are a variety of covers and pads available to make crates safe and more comfortable.
Wire crates are also popular at dog shows; they allow the dog to be clearly seen by spectators, and sashes, rosettes, and ribbons won can be hung on the crate for display.
Hybrid crates are a combination of aluminum, coated steel wire mesh and reinforced plastic. These crates have the durability of traditional aluminum crates and the airflow and clear view of the dog that wire crates offer. Some additional features are rounded edges that prevent injuries to dogs and humans that are common with wire crates and an ergonomic handle, that makes the crate easier to open (especially for those with limited hand mobility, like the elderly and autistic).
Soft-sided crates (fabric on a metal frame) can be easily folded for storage or transport and are lightweight. They provide the dog with a stronger sense of security but still allow visibility and airflow. They cannot be used with dogs who are likely to dig or chew at the crate, and they are unsuitable for transporting dogs in vehicles.
Dog tents are an alternative to soft crates. They offer many of the same advantages (and disadvantages) of soft crates but fold down to an even smaller size and are ultra lightweight so that they can be stuffed into tent bags and taken virtually anywhere. They are good enclosures for dog owners who need to pack their soft crates into cramped vehicles or suitcases or for people who hike, camp, or are involved in dog sports. Like soft crates, they are not suitable for dogs who are not housebroken, or for vehicle travel.
Decorative crates, made of finished wood, rattan, or other custom materials designed to match a home's decor, aren't usually good for transportation and are not good for destructive dogs, but fulfill a need for confinement at home.
See also
Exercise pen
Pet carrier
References
External links
Here is Some Website There You Can know All About Dog Crate .
Dog equipment
Buildings and structures used to confine animals
Dogs as pets
|
Andreas Bach (born 10 October 1968, in Erfurt) is a German former track cyclist. He won the team pursuit at the 1994 UCI Track Cycling World Championships with Guido Fulst, Danilo Hondo and Jens Lehmann.
Major results
1986
2nd Team pursuit, UCI Junior World Championships
1993
2nd Team pursuit, UCI World Championships
1994
1st Team pursuit, UCI World Championships
1st Team pursuit, National Track Championships
References
External links
1968 births
Living people
Cyclists from Thuringia
German male cyclists
Sportspeople from Erfurt
UCI Track Cycling World Champions (men)
German track cyclists
East German male cyclists
People from Bezirk Erfurt
|
The All-Ireland Minor Camogie Championship is a competition for under-18 teams in the women's field sport of camogie. Counties compete for the Síghle Nic an Ultaigh Cup. There are graded competitions at Minor B and Minor C level.
History
The competition was established in 1974 for under-16 teams. In 2006 the age limit was raised from 16 to 18 and a separate under-16 championship established. Championships are also held at Minor B and Minor C level.
Top winners
Click on the year for details and team line-outs from each individual championship.
All Ireland Minor Camogie Finals
In 2006 the age limit for minor was raised from under-16 to under-18, to bring camogie in line with other Gaelic Games.
The first figure is the number of goals scored (equal to 3 points each) and the second total is the number of points scored, the figures are combined to determine the winner of a match in Gaelic Games
Click on the year for details and team line-outs from each individual championship.
2006 Kilkenny 4–10 Galway 2-05
2007 Kilkenny 3–12 Cork 0-07
2008 Kilkenny 3–15 Clare 1-07
2009 Kilkenny 5–10 Clare 3-08
2010 Galway 1-07 Clare 1-07
Replay Galway 2–12 Clare 2-08
2011 Tipperary 4-04 Kilkenny 2-09
2012 Galway 2–12 Kilkenny 1–10
2013 Kilkenny 3–4 Cork 1–10
Replay Kilkenny 1–12 Cork 0-06
2014 Limerick 2–11 Cork 3-08
Replay Limerick 3–11 Cork 1-09
2015 Kilkenny 3-09 Tipperary 1–12
2016 Tipperary 2-10 Galway 1-13
Replay Tipperary 4-09 Galway 2-06
2017 Galway 4–14 Clare 0-06
2018 Cork 0-18 Galway 1-11
2019 Cork 3–15 Clare 2–12
2020 Not Played
2021 Kilkenny 2–12 Cork 0-12
2022 Cork 2–11 Galway 2-07
2023 Cork
All Ireland Minor B Finals
Click on the year for details and team line-outs from each individual championship.
In 2006 the age limit for minor was raised from under-16 to under-18, to bring camogie in line with other Gaelic Games.
2006 Down 5-08 Antrim 6-04
2007 Antrim 3-18 Down 5-03
2008 Offaly 4-13 Waterford 2-07
2009 Limerick 3-10 Waterford 1-15
2010 Derry 3-10 Antrim 0-09
2011 Limerick 4-10 Antrim 2-08
2012 Derry 2-16 Wexford 2-05
2013 Offaly 6-14 Wexford 1-07
2014 Waterford 4-06 Derry 0-02
2015 Meath 4-06 Derry 2-10
2016 Down 1-06 Roscommon 0-06
2017 Antrim 1-11 Kildare 2-05
2018 Antrim 3.13 Westmeath 3.12
2019 Laois 4-06 Limerick 2-05
2020 Not Played
2021 Antrim 2-07 Offaly 0-13
Replay Antrim 3-15 Offaly 3-08
2022 Offaly 2-10 Laois 1-12
All Ireland Minor C Finals
2009 Laois 3-05 Carlow 2-03
2010 Carlow 5-10 Armagh 1-12
2011 Armagh 3-05 Meath 1-10
2012 Down 1-16 Kerry 0-10
2013 Kildare 2-11 Armagh 2-09
2014 Meath 1-13 Armagh 0-05
2015 Roscommon 2-06 Armagh 0-04
2016 Armagh 2-16 Westmeath 1-11
2017 Carlow 4-10 Roscommon 0-12
2018
2019 Tyrone 3-12 Kerry 0-06
2020 Not Played
2021 Cavan 2-05 Mayo 0-08
2022 Wicklow 4-04 Mayo 0-06
All-Ireland Under 16 Championship: Top Winners
All Ireland Under-16 Camogie Finals
Until 2006 when the age limit for minor was raised from under-16 to under-18, to bring camogie in line with other Gaelic games, the description "minor" was applied to under-16 camogie competitions from 1974 to 2005 which were played at under-16 level. Hence the under-16 competition from 1974 to 2005 was described as "minor" in contemporary documentation and media.
1974 Down 3-00 Cork 0-01
1975 Cork 6-02 Galway 0-03
1976 Cork 4-06 Down 2-01
1977 Galway 5-04 Dublin 2-01
1978 Cork 5-01 Dublin 3-04
1979 Cork 5-03 Cavan 3-00
1980 Cork 5-05 Cavan 0-02
1981 Galway 3-04 Antrim 3-03
1982 Dublin 5-02 Galway 2-03
1983 Cork 3-03 Dublin 2-03
1984 Cork 2-12 Galway 5-00
1985 Cork 3-08 Galway 2-03
1986 Galway 2-08 Wexford 1-04
1987 Galway 1-11 Cork 3-03
1988 Kilkenny 5-06 Armagh 2-05
1989 Kilkenny 9-10 Tipperary 3-08
1990 Tipperary 2-11 Kilkenny 3-06
1991 Kilkenny 4-12 Galway 3-07
1992 Tipperary 4-09 Kilkenny 1-03
1993 Tipperary 1-05 Galway 1-05
Replay Tipperary 3-10 Galway 2-09
1994 Galway 7-13 Tipperary 3-09
1995 Wexford 2-09 Galway 1-07
1996 Galway 3-16 Tipperary 4-11
1997 Galway 2-14 Cork 1-06
1998 Cork 3-18 Derry 1-05
1999 Cork 2-12 Galway 3-08
2000 Galway 2-09 Wexford 0-03
2001 Cork 6-15 Kilkenny 2-07
2002 Cork 2-11 Galway 1-05
2003 Cork 3-12 Galway 1-04
2004 Galway 3-16 Kilkenny 2-06
2005 Kilkenny 4-07 Tipperary 2-07
2006 Kilkenny 2-10 Cork 0-04
2007 Kilkenny 8-11 Cork 0-06
2008 Kilkenny 3-06 Cork 2-04
2009 Galway 2-11 Tipperary 2-07
2010 Galway 2-11 Tipperary 2-07
2011 Tipperary 2-08 Kilkenny 0-13
2012 Dublin 4-10 Galway 2-08
2013 Tipperary 4-06 Galway 2-08
2014 Tipperary 3-13 Galway 1-07
2015 Galway beat Cork
2016 Galway 3-14 Kilkenny 1-11
2017 Galway 2-16 Wexford 2-05
2018 Galway 3-14 Cork 1-07
2019 Cork 1-14 Galway 2-10
2020 Not Played
2021 Cork 2-12 Kilkenny 2-10
2022 Cork 2-18 Tipperary 0-10
All Ireland Under-16 B Finals
The under-16 B competition from 2000 to 2005 was described as "minor B" in contemporary documentation and media.
2000 Laois 9-14 Tyrone 2-01
2001 Limerick 3-18 Carlow 1-01
2002 Limerick 5-07 Offaly 0-02
2003 Waterford 6-11 Armagh 1-04
2004 Antrim 1-09 Roscommon 0-03
2005 Offaly 2-14 Armagh 3-09
2006 Derry 3-03 Armagh 1-02
2007 Derry 2-07 Waterford 3-04
Replay Derry 3-14 Waterford 2-02
2008 Derry 6-18 Offaly 0-06
2009 Wexford 2-11 Waterford 1-12
2010 Derry 3-09 Limerick 1-06
2011 Limerick 3-12 Offaly 0-09
2012 Offaly 5-10 Derry 2-06
2013 Cork 4-08 Waterford 2-10
2014 Waterford 6-17 Derry 3-05
2015 Waterford 2-08 Dublin 1-07
2016 Westmeath 2-13 Laois 0-06
2017 Laois 3-06 Antrim 1.10
2018 Antrim 3-09 Derry 2-06
2019 Waterford
2020 Not Played
2021 Meath 9-13 Offaly 4-12
2022 Laois 4-07 Antrim 3-07
All Ireland Under-16 C Finals
2009 Westmeath 6-09 Tyrone 5-03
2010 Carlow 4-08 Meath 1-04
2011 Down 1-03 Carlow 1-02
2012 Westmeath 1-10 Armagh 2-04
2013 Meath 1-10 Laois 2-03
2014 Laois
2015 Westmeath
2016 Kildare 1-11 Carlow 1-08
2017 Armagh 2-09 Carlow 2-08
2018 Carlow
2019 Roscommon
2020 Not Played
2021 Westmeath 1-01 Roscommon 0-03
2022
All Ireland Under-16 D Finals
2021 Wicklow 3-11 Mayo 0-02
2022
See also
All-Ireland Senior Camogie Championship
All-Ireland Junior Camogie Championship
All-Ireland Intermediate Camogie Championship
Wikipedia List of Camogie players
National Camogie League
Camogie All Stars Awards
Ashbourne Cup
References
External links
An Cumann Camógaíochta
Camogie on official GAA website
Camogie on GAA Oral History Project
4
|
```ruby
# or more contributor license agreements. See the NOTICE file
# distributed with this work for additional information
# regarding copyright ownership. The ASF licenses this file
#
# path_to_url
#
# Unless required by applicable law or agreed to in writing,
# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
# specific language governing permissions and limitations
class DictionaryDataTypeTest < Test::Unit::TestCase
sub_test_case(".new") do
def setup
@index_data_type = :int8
@value_data_type = :string
@ordered = true
end
test("ordered arguments") do
assert_equal("dictionary<values=string, indices=int8, ordered=1>",
Arrow::DictionaryDataType.new(@index_data_type,
@value_data_type,
@ordered).to_s)
end
test("description") do
assert_equal("dictionary<values=string, indices=int8, ordered=1>",
Arrow::DictionaryDataType.new(index_data_type: @index_data_type,
value_data_type: @value_data_type,
ordered: @ordered).to_s)
end
end
end
```
|
Are You Sleepy? is the debut album of The Gerbils.
Track listing
Personnel
Scott Spillane - Vocals, Guitar, Bass
Will Westbrook - Vocal, Guitars, Crystal Calibrator, Tape Manipulation, Bells
Jeremy Barnes - Drums, Vocals
John D'Azzo - Vocals, Guitar, Bass, Piano, Air Organ, Drums
References
The Gerbils albums
1998 debut albums
|
```shell
Using tags for version control
Pushing tags to a server
You can use git offline!
Search for commits by author
Use `short` status to make output more compact
```
|
Arching or compressive membrane action (CMA) in reinforced concrete slabs occurs as a result of the great difference between the tensile and compressive strength of concrete. Cracking of the concrete causes a migration of the neutral axis which is accompanied by in-plane expansion of the slab at its boundaries. If this natural tendency to expand is restrained, the development of arching action enhances the strength of the slab.
The term arching action is normally used to describe the arching phenomenon in one-way spanning slabs and compressive membrane action is normally used to describe the arching phenomenon in two-way spanning slabs.
Background
The strength enhancing effects of arching action in reinforced concrete floors were first recognised near the beginning of last century. However, it was not until the full scale destructive load tests by Ockleston on the Old Dental Hospital in Johannesburg that the extent of strength enhancement caused by arching action was really appreciated. In these tests, collapse loads of between 3 and 4 times those predicted by yield-line theory were obtained.
Approaches to treatment of arching action (CMA)
Since the 1950s there have been several attempts to develop theories for arching action in both one and two-way slabs. One of the principal approaches to membrane action was that due to Park which has been used as a basis for many studies into arching action in slabs. Park's approach was based on rigid plastic slab strip theory, and required the assumption of a critical deflection of one half of the slab depth at failure. Park's approach was later extended by Park and Gamble in their method for predicting the plastic load-deformation response of laterally restrained slabs.
In 1971, the American Concrete Institute produced a special publication which presented the most recent research, to that time, on arching and compressive membrane action in reinforced concrete slabs.
A comprehensive review of the literature and studies of both rigid-plastic and elastic-plastic approaches to arching have been compiled by Braestrup and Braestrup and Morley. Lahlouh and Waldron were some of the earliest researchers to achieve a degree of success in finite element modelling of the phenomenon. In 1993, Kuang and Morley presented a plasticity approach which included the effect of compressive membrane action on the punching shear strength of laterally restrained concrete slabs.
United Kingdom approach to CMA in bridge deck design
In the United Kingdom, the method developed by Kirkpatrick, Rankin & Long in 1984 and substantiated by testing a full-scale bridge in 1986 first led to the introduction of new rules for the economic design of reinforced concrete beam and slab bridge decks in Northern Ireland. The concept and method were later incorporated, by the United Kingdom Highways Agency, into the UK design manual for roads and bridges, BD 81/02, 'Use of Compressive Membrane Action in Bridge Decks'. Use of this CMA methodology normally results in substantial savings in reinforcement in the slab of a beam and slab bridge deck, provided certain limitations and boundary conditions are satisfied.
Kirkpatrick, Rankin & Long's approach to the prediction of the enhanced punching strength of bridge deck slabs was based on the punching shear prediction equation derived by Long for the shear mode of punching failure, combined with an effective reinforcement ratio, which represented the arching action strength enhancement. The effective reinforcement ratio was determined from the maximum arching moment of resistance in a rigidly restrained concrete slab, which Rankin had derived for laterally restrained concrete slabs from McDowell, McKee and Sevin's arching action deformation theory for masonry walls. The derivation of the maximum arching moment of resistance of laterally restrained concrete bridge deck slabs utilised Rankin's idealised elastic-plastic stress-strain criterion for concrete, valid for concrete cylinder strengths up to at least 70N/mm2, which he had derived on the basis of Hognestad, Hanson and McHenry's ultimate parabolic stress block coefficients for concrete.
The adaptation of Kirkpatrick, Rankin & Long's punching strength prediction method for laterally restrained bridge deck slabs, given in BD 81/02, is summarised as follows:
The concrete equivalent cylinder strength, , is given by:
The plastic strain value, , of an idealised elastic-plastic concrete is given by:
The non-dimensional parameter, , for the arching moment of resistance is given by:
In order to treat the slab as restrained, must be less than 0.26. If is greater than 0.26, the deck slab shall be treated as if it were unrestrained.
The non-dimensional arching moment coefficient, , is given by:
The effective reinforcement ratio, , is given by:
The predicted ultimate punching load for a single wheel, (N), is given by:
where:
= average effective depth to tensile reinforcement (mm)
= characteristic concrete cube strength (N/mm2)
= overall slab depth (mm)
= half span of slab strip with boundary restraint (mm)
= diameter of loaded area (mm)
= partial safety factor for strength
Further details on the derivation of the method and how to deal with situations of less than rigid lateral restraint are given by Rankin and Rankin & Long. Long and Rankin claim that the concepts of arching or compressive membrane action in beam and slab bridge decks are also applicable to flat slab and cellular reinforced concrete structures where considerable strength enhancements over design code predictions can also be achieved.
Research into arching or compressive membrane action has continued over the years at Queen's University Belfast, with the work of Niblock, who investigated the effects of CMA in uniformly loaded laterally restrained slabs; Skates, who researched CMA in cellular concrete structures; Ruddle, who researched arching action in laterally restrained rectangular and Tee-beams; Peel-Cross, who researched CMA in composite floor slab construction; Taylor who researched CMA in high strength concrete bridge deck slabs, and Shaat who researched CMA using Finite Element Analysis (FEA) techniques. A comprehensive guide to compressive membrane action in concrete bridge decks, was compiled by Taylor, Rankin and Cleland in 2002.
North American approach to CMA in bridge-deck design
In North America, a more pragmatic approach has been adopted and research into compressive membrane action has primarily stemmed from the work of Hewitt and Batchelor and Batchelor and Tissington in the 1970s. They carried out an extensive series of field tests, which led to the introduction of an empirical method of design into the Ontario Highway Bridge Design Code in 1979. This required minimum isotropic reinforcement (0.3%) in bridge deck slabs, provided certain boundary conditions were satisfied. In the 1990s Mufti et al. extended this research and showed that significant enhancements in the durability of laterally restrained slabs can be achieved by utilising fibre reinforced deck slabs without steel reinforcement. Later, Mufti and Newhook adapted Hewitt and Batchelor's model to develop a method for evaluating the ultimate capacity of fibre reinforced deck slabs using external steel straps for the provision of lateral restraint.
References
Structural engineering
|
"Vasoline" is a song by American rock band Stone Temple Pilots from their second album, Purple. The song was the second single of the album, reaching number one on the Billboard Mainstream Rock Tracks chart for two weeks. The song's odd-sounding intro was created by Robert DeLeo, who ran his bass through a wah-wah pedal to get the said effect. The song's lyrics were written by vocalist Scott Weiland. "Vasoline" also appears on the greatest hits compilation album Thank You. A live version also appears on The Family Values 2001 Tour compilation.
Composition and meaning
During STP's performance of "Vasoline" on VH1 Storytellers, Weiland says that the song is about "feeling like an insect under a magnifying glass." During an interview with Greg Prato from SongFacts.com on October 14, 2014, Scott Weiland confirmed that the key line in this song came from a misheard lyric: His parents put on the Eagles song "Life in the Fast Lane", and Weiland thought they were singing, "Flies in the Vaseline."
In his autobiography Not Dead and Not For Sale, he adds that it "is about being stuck in the same situation over and over again. It's about me becoming a junkie. It's about lying to [my first wife] Jannina (Castaneda) and lying to the band about my heroin addiction."
Music videos
The music videos (directed by Kevin Kerslake) were in heavy rotation on MTV when the single was released in 1994. There are at least three different versions of the video, labeled "X Version", "Y Version", and "Z Version". All versions are similar, using parts of the same footage with some minor differences and shown in different orders. The single album art is taken directly from the music video. One portion of the "X Version" was censored when it aired on MTV. During the table scene, a man is bound to a chair while a sadistic guard prepares to puncture his eye with a drill. The uncensored version can be seen on Kerslake's YouTube channel, while the censored version is found on the band's YouTube page.
Differentiation
X Version – begins with a shot of flypaper and then a laughing clown [Robert DeLeo]
Y Version – begins with a butterfly-catching girl [Deanna Stevens] skipping up to the camera
Z Version – begins with a man using a sharpening stone wheel
Track listings
UK, European, and Australian CD single
"Vasoline" – 2:56
"Meatplow" – 3:38
"Andy Warhol" (David Bowie cover live from MTV Unplugged) – 3:05
"Crackerman" (live from MTV Unplugged) – 4:03
German CD single
"Vasoline" – 2:56
"Meatplow" – 3:38
Charts
References
External links
1994 singles
1994 songs
Music videos directed by Kevin Kerslake
Song recordings produced by Brendan O'Brien (record producer)
Songs about drugs
Songs written by Dean DeLeo
Songs written by Eric Kretz
Songs written by Robert DeLeo
Songs written by Scott Weiland
Stone Temple Pilots songs
|
```emacs lisp
;;; calc-bin.el --- binary functions for Calc
;; Author: David Gillespie <daveg@synaptics.com>
;; This file is part of GNU Emacs.
;; GNU Emacs is free software: you can redistribute it and/or modify
;; (at your option) any later version.
;; GNU Emacs 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
;; along with GNU Emacs. If not, see <path_to_url
;;; Commentary:
;;; Code:
;; This file is autoloaded from calc-ext.el.
(require 'calc-ext)
(require 'calc-macs)
;;; Some useful numbers
(defconst math-bignum-logb-digit-size
(logb math-bignum-digit-size)
"The logb of the size of a bignum digit.
This is the largest value of B such that 2^B is less than
the size of a Calc bignum digit.")
(defconst math-bignum-digit-power-of-two
(expt 2 (logb math-bignum-digit-size))
"The largest power of 2 less than the size of a Calc bignum digit.")
;;; b-prefix binary commands.
(defun calc-and (n)
(interactive "P")
(calc-slow-wrapper
(calc-enter-result 2 "and"
(append '(calcFunc-and)
(calc-top-list-n 2)
(and n (list (prefix-numeric-value n)))))))
(defun calc-or (n)
(interactive "P")
(calc-slow-wrapper
(calc-enter-result 2 "or"
(append '(calcFunc-or)
(calc-top-list-n 2)
(and n (list (prefix-numeric-value n)))))))
(defun calc-xor (n)
(interactive "P")
(calc-slow-wrapper
(calc-enter-result 2 "xor"
(append '(calcFunc-xor)
(calc-top-list-n 2)
(and n (list (prefix-numeric-value n)))))))
(defun calc-diff (n)
(interactive "P")
(calc-slow-wrapper
(calc-enter-result 2 "diff"
(append '(calcFunc-diff)
(calc-top-list-n 2)
(and n (list (prefix-numeric-value n)))))))
(defun calc-not (n)
(interactive "P")
(calc-slow-wrapper
(calc-enter-result 1 "not"
(append '(calcFunc-not)
(calc-top-list-n 1)
(and n (list (prefix-numeric-value n)))))))
(defun calc-lshift-binary (n)
(interactive "P")
(calc-slow-wrapper
(let ((hyp (if (calc-is-hyperbolic) 2 1)))
(calc-enter-result hyp "lsh"
(append '(calcFunc-lsh)
(calc-top-list-n hyp)
(and n (list (prefix-numeric-value n))))))))
(defun calc-rshift-binary (n)
(interactive "P")
(calc-slow-wrapper
(let ((hyp (if (calc-is-hyperbolic) 2 1)))
(calc-enter-result hyp "rsh"
(append '(calcFunc-rsh)
(calc-top-list-n hyp)
(and n (list (prefix-numeric-value n))))))))
(defun calc-lshift-arith (n)
(interactive "P")
(calc-slow-wrapper
(let ((hyp (if (calc-is-hyperbolic) 2 1)))
(calc-enter-result hyp "ash"
(append '(calcFunc-ash)
(calc-top-list-n hyp)
(and n (list (prefix-numeric-value n))))))))
(defun calc-rshift-arith (n)
(interactive "P")
(calc-slow-wrapper
(let ((hyp (if (calc-is-hyperbolic) 2 1)))
(calc-enter-result hyp "rash"
(append '(calcFunc-rash)
(calc-top-list-n hyp)
(and n (list (prefix-numeric-value n))))))))
(defun calc-rotate-binary (n)
(interactive "P")
(calc-slow-wrapper
(let ((hyp (if (calc-is-hyperbolic) 2 1)))
(calc-enter-result hyp "rot"
(append '(calcFunc-rot)
(calc-top-list-n hyp)
(and n (list (prefix-numeric-value n))))))))
(defun calc-clip (n)
(interactive "P")
(calc-slow-wrapper
(calc-enter-result 1 "clip"
(append '(calcFunc-clip)
(calc-top-list-n 1)
(and n (list (prefix-numeric-value n)))))))
(defun calc-word-size (n)
(interactive "P")
(calc-wrapper
(or n (setq n (read-string (format "Binary word size: (default %d) "
calc-word-size))))
(setq n (if (stringp n)
(if (equal n "")
calc-word-size
(if (string-match "\\`[-+]?[0-9]+\\'" n)
(string-to-number n)
(error "Expected an integer")))
(prefix-numeric-value n)))
(or (= n calc-word-size)
(if (> (math-abs n) 100)
(calc-change-mode 'calc-word-size n calc-leading-zeros)
(calc-change-mode '(calc-word-size calc-previous-modulo)
(list n (math-power-of-2 (math-abs n)))
calc-leading-zeros)))
(setq math-2-word-size (math-power-of-2 (math-abs n)))
(setq math-half-2-word-size (math-power-of-2 (1- (math-abs n))))
(calc-do-refresh)
(calc-refresh-evaltos)
(if (< n 0)
(message "Binary word size is %d bits (two's complement)" (- n))
(message "Binary word size is %d bits" n))))
;;; d-prefix mode commands.
(defun calc-radix (n &optional arg)
(interactive "NDisplay radix (2-36): ")
(calc-wrapper
(if (and (>= n 2) (<= n 36))
(progn
(calc-change-mode
(list 'calc-number-radix 'calc-twos-complement-mode)
(list n (or arg (calc-is-option))) t)
;; also change global value so minibuffer sees it
(setq-default calc-number-radix calc-number-radix))
(setq n calc-number-radix))
(if calc-twos-complement-mode
(message "Number radix is %d, two's complement mode is on." n)
(message "Number radix is %d" n))))
(defun calc-decimal-radix ()
(interactive)
(calc-radix 10))
(defun calc-binary-radix (&optional arg)
(interactive "P")
(calc-radix 2 arg))
(defun calc-octal-radix (&optional arg)
(interactive "P")
(calc-radix 8 arg))
(defun calc-hex-radix (&optional arg)
(interactive "P")
(calc-radix 16 arg))
(defun calc-leading-zeros (n)
(interactive "P")
(calc-wrapper
(if (calc-change-mode 'calc-leading-zeros n t t)
(message "Zero-padding integers to %d digits (assuming radix %d)"
(let* ((calc-internal-prec 6))
(math-compute-max-digits (math-abs calc-word-size)
calc-number-radix))
calc-number-radix)
(message "Omitting leading zeros on integers"))))
(defvar math-power-of-2-cache (list 1 2 4 8 16 32 64 128 256 512 1024))
(defvar math-big-power-of-2-cache nil)
(defun math-power-of-2 (n) ; [I I] [Public]
(if (and (natnump n) (<= n 100))
(or (nth n math-power-of-2-cache)
(let* ((i (length math-power-of-2-cache))
(val (nth (1- i) math-power-of-2-cache)))
(while (<= i n)
(setq val (math-mul val 2)
math-power-of-2-cache (nconc math-power-of-2-cache
(list val))
i (1+ i)))
val))
(let ((found (assq n math-big-power-of-2-cache)))
(if found
(cdr found)
(let ((po2 (math-ipow 2 n)))
(setq math-big-power-of-2-cache
(cons (cons n po2) math-big-power-of-2-cache))
po2)))))
(defun math-integer-log2 (n) ; [I I] [Public]
(let ((i 0)
(p math-power-of-2-cache)
val)
(while (and p (Math-natnum-lessp (setq val (car p)) n))
(setq p (cdr p)
i (1+ i)))
(if p
(and (equal val n)
i)
(while (Math-natnum-lessp
(prog1
(setq val (math-mul val 2))
(setq math-power-of-2-cache (nconc math-power-of-2-cache
(list val))))
n)
(setq i (1+ i)))
(and (equal val n)
i))))
;;; Bitwise operations.
(defun calcFunc-and (a b &optional w) ; [I I I] [Public]
(cond ((Math-messy-integerp w)
(calcFunc-and a b (math-trunc w)))
((and w (not (integerp w)))
(math-reject-arg w 'fixnump))
((and (integerp a) (integerp b))
(math-clip (logand a b) w))
((or (eq (car-safe a) 'mod) (eq (car-safe b) 'mod))
(math-binary-modulo-args 'calcFunc-and a b w))
((not (Math-num-integerp a))
(math-reject-arg a 'integerp))
((not (Math-num-integerp b))
(math-reject-arg b 'integerp))
(t (math-clip (cons 'bigpos
(math-and-bignum (math-binary-arg a w)
(math-binary-arg b w)))
w))))
(defun math-binary-arg (a w)
(if (not (Math-integerp a))
(setq a (math-trunc a)))
(if (Math-integer-negp a)
(math-not-bignum (cdr (math-bignum-test (math-sub -1 a)))
(math-abs (if w (math-trunc w) calc-word-size)))
(cdr (Math-bignum-test a))))
(defun math-binary-modulo-args (f a b w)
(let (mod)
(if (eq (car-safe a) 'mod)
(progn
(setq mod (nth 2 a)
a (nth 1 a))
(if (eq (car-safe b) 'mod)
(if (equal mod (nth 2 b))
(setq b (nth 1 b))
(math-reject-arg b "*Inconsistent modulus"))))
(setq mod (nth 2 b)
b (nth 1 b)))
(if (Math-messy-integerp mod)
(setq mod (math-trunc mod))
(or (Math-integerp mod)
(math-reject-arg mod 'integerp)))
(let ((bits (math-integer-log2 mod)))
(if bits
(if w
(if (/= w bits)
(calc-record-why
"*Warning: Modulus inconsistent with word size"))
(setq w bits))
(calc-record-why "*Warning: Modulus is not a power of 2"))
(math-make-mod (if b
(funcall f a b w)
(funcall f a w))
mod))))
(defun math-and-bignum (a b) ; [l l l]
(and a b
(let ((qa (math-div-bignum-digit a math-bignum-digit-power-of-two))
(qb (math-div-bignum-digit b math-bignum-digit-power-of-two)))
(math-mul-bignum-digit (math-and-bignum (math-norm-bignum (car qa))
(math-norm-bignum (car qb)))
math-bignum-digit-power-of-two
(logand (cdr qa) (cdr qb))))))
(defun calcFunc-or (a b &optional w) ; [I I I] [Public]
(cond ((Math-messy-integerp w)
(calcFunc-or a b (math-trunc w)))
((and w (not (integerp w)))
(math-reject-arg w 'fixnump))
((and (integerp a) (integerp b))
(math-clip (logior a b) w))
((or (eq (car-safe a) 'mod) (eq (car-safe b) 'mod))
(math-binary-modulo-args 'calcFunc-or a b w))
((not (Math-num-integerp a))
(math-reject-arg a 'integerp))
((not (Math-num-integerp b))
(math-reject-arg b 'integerp))
(t (math-clip (cons 'bigpos
(math-or-bignum (math-binary-arg a w)
(math-binary-arg b w)))
w))))
(defun math-or-bignum (a b) ; [l l l]
(and (or a b)
(let ((qa (math-div-bignum-digit a math-bignum-digit-power-of-two))
(qb (math-div-bignum-digit b math-bignum-digit-power-of-two)))
(math-mul-bignum-digit (math-or-bignum (math-norm-bignum (car qa))
(math-norm-bignum (car qb)))
math-bignum-digit-power-of-two
(logior (cdr qa) (cdr qb))))))
(defun calcFunc-xor (a b &optional w) ; [I I I] [Public]
(cond ((Math-messy-integerp w)
(calcFunc-xor a b (math-trunc w)))
((and w (not (integerp w)))
(math-reject-arg w 'fixnump))
((and (integerp a) (integerp b))
(math-clip (logxor a b) w))
((or (eq (car-safe a) 'mod) (eq (car-safe b) 'mod))
(math-binary-modulo-args 'calcFunc-xor a b w))
((not (Math-num-integerp a))
(math-reject-arg a 'integerp))
((not (Math-num-integerp b))
(math-reject-arg b 'integerp))
(t (math-clip (cons 'bigpos
(math-xor-bignum (math-binary-arg a w)
(math-binary-arg b w)))
w))))
(defun math-xor-bignum (a b) ; [l l l]
(and (or a b)
(let ((qa (math-div-bignum-digit a math-bignum-digit-power-of-two))
(qb (math-div-bignum-digit b math-bignum-digit-power-of-two)))
(math-mul-bignum-digit (math-xor-bignum (math-norm-bignum (car qa))
(math-norm-bignum (car qb)))
math-bignum-digit-power-of-two
(logxor (cdr qa) (cdr qb))))))
(defun calcFunc-diff (a b &optional w) ; [I I I] [Public]
(cond ((Math-messy-integerp w)
(calcFunc-diff a b (math-trunc w)))
((and w (not (integerp w)))
(math-reject-arg w 'fixnump))
((and (integerp a) (integerp b))
(math-clip (logand a (lognot b)) w))
((or (eq (car-safe a) 'mod) (eq (car-safe b) 'mod))
(math-binary-modulo-args 'calcFunc-diff a b w))
((not (Math-num-integerp a))
(math-reject-arg a 'integerp))
((not (Math-num-integerp b))
(math-reject-arg b 'integerp))
(t (math-clip (cons 'bigpos
(math-diff-bignum (math-binary-arg a w)
(math-binary-arg b w)))
w))))
(defun math-diff-bignum (a b) ; [l l l]
(and a
(let ((qa (math-div-bignum-digit a math-bignum-digit-power-of-two))
(qb (math-div-bignum-digit b math-bignum-digit-power-of-two)))
(math-mul-bignum-digit (math-diff-bignum (math-norm-bignum (car qa))
(math-norm-bignum (car qb)))
math-bignum-digit-power-of-two
(logand (cdr qa) (lognot (cdr qb)))))))
(defun calcFunc-not (a &optional w) ; [I I] [Public]
(cond ((Math-messy-integerp w)
(calcFunc-not a (math-trunc w)))
((eq (car-safe a) 'mod)
(math-binary-modulo-args 'calcFunc-not a nil w))
((and w (not (integerp w)))
(math-reject-arg w 'fixnump))
((not (Math-num-integerp a))
(math-reject-arg a 'integerp))
((< (or w (setq w calc-word-size)) 0)
(math-clip (calcFunc-not a (- w)) w))
(t (math-normalize
(cons 'bigpos
(math-not-bignum (math-binary-arg a w)
w))))))
(defun math-not-bignum (a w) ; [l l]
(let ((q (math-div-bignum-digit a math-bignum-digit-power-of-two)))
(if (<= w math-bignum-logb-digit-size)
(list (logand (lognot (cdr q))
(1- (lsh 1 w))))
(math-mul-bignum-digit (math-not-bignum (math-norm-bignum (car q))
(- w math-bignum-logb-digit-size))
math-bignum-digit-power-of-two
(logxor (cdr q)
(1- math-bignum-digit-power-of-two))))))
(defun calcFunc-lsh (a &optional n w) ; [I I] [Public]
(setq a (math-trunc a)
n (if n (math-trunc n) 1))
(if (eq (car-safe a) 'mod)
(math-binary-modulo-args 'calcFunc-lsh a n w)
(setq w (if w (math-trunc w) calc-word-size))
(or (integerp w)
(math-reject-arg w 'fixnump))
(or (Math-integerp a)
(math-reject-arg a 'integerp))
(or (Math-integerp n)
(math-reject-arg n 'integerp))
(if (< w 0)
(math-clip (calcFunc-lsh a n (- w)) w)
(if (Math-integer-negp a)
(setq a (math-clip a w)))
(cond ((or (Math-lessp n (- w))
(Math-lessp w n))
0)
((< n 0)
(math-quotient (math-clip a w) (math-power-of-2 (- n))))
(t
(math-clip (math-mul a (math-power-of-2 n)) w))))))
(defun calcFunc-rsh (a &optional n w) ; [I I] [Public]
(calcFunc-lsh a (math-neg (or n 1)) w))
(defun calcFunc-ash (a &optional n w) ; [I I] [Public]
(if (or (null n)
(not (Math-negp n)))
(calcFunc-lsh a n w)
(setq a (math-trunc a)
n (if n (math-trunc n) 1))
(if (eq (car-safe a) 'mod)
(math-binary-modulo-args 'calcFunc-ash a n w)
(setq w (if w (math-trunc w) calc-word-size))
(or (integerp w)
(math-reject-arg w 'fixnump))
(or (Math-integerp a)
(math-reject-arg a 'integerp))
(or (Math-integerp n)
(math-reject-arg n 'integerp))
(if (< w 0)
(math-clip (calcFunc-ash a n (- w)) w)
(if (Math-integer-negp a)
(setq a (math-clip a w)))
(let ((two-to-sizem1 (math-power-of-2 (1- w)))
(sh (calcFunc-lsh a n w)))
(cond ((Math-natnum-lessp a two-to-sizem1)
sh)
((Math-lessp n (- 1 w))
(math-add (math-mul two-to-sizem1 2) -1))
(t (let ((two-to-n (math-power-of-2 (- n))))
(math-add (calcFunc-lsh (math-add two-to-n -1)
(+ w n) w)
sh)))))))))
(defun calcFunc-rash (a &optional n w) ; [I I] [Public]
(calcFunc-ash a (math-neg (or n 1)) w))
(defun calcFunc-rot (a &optional n w) ; [I I] [Public]
(setq a (math-trunc a)
n (if n (math-trunc n) 1))
(if (eq (car-safe a) 'mod)
(math-binary-modulo-args 'calcFunc-rot a n w)
(setq w (if w (math-trunc w) calc-word-size))
(or (integerp w)
(math-reject-arg w 'fixnump))
(or (Math-integerp a)
(math-reject-arg a 'integerp))
(or (Math-integerp n)
(math-reject-arg n 'integerp))
(if (< w 0)
(math-clip (calcFunc-rot a n (- w)) w)
(if (Math-integer-negp a)
(setq a (math-clip a w)))
(cond ((or (Math-integer-negp n)
(not (Math-natnum-lessp n w)))
(calcFunc-rot a (math-mod n w) w))
(t
(math-add (calcFunc-lsh a (- n w) w)
(calcFunc-lsh a n w)))))))
(defun math-clip (a &optional w) ; [I I] [Public]
(cond ((Math-messy-integerp w)
(math-clip a (math-trunc w)))
((eq (car-safe a) 'mod)
(math-binary-modulo-args 'math-clip a nil w))
((and w (not (integerp w)))
(math-reject-arg w 'fixnump))
((not (Math-num-integerp a))
(math-reject-arg a 'integerp))
((< (or w (setq w calc-word-size)) 0)
(setq a (math-clip a (- w)))
(if (Math-natnum-lessp a (math-power-of-2 (- -1 w)))
a
(math-sub a (math-power-of-2 (- w)))))
((Math-negp a)
(math-normalize (cons 'bigpos (math-binary-arg a w))))
((and (integerp a) (< a math-small-integer-size))
(if (> w (logb math-small-integer-size))
a
(logand a (1- (lsh 1 w)))))
(t
(math-normalize
(cons 'bigpos
(math-clip-bignum (cdr (math-bignum-test (math-trunc a)))
w))))))
(defalias 'calcFunc-clip 'math-clip)
(defun math-clip-bignum (a w) ; [l l]
(let ((q (math-div-bignum-digit a math-bignum-digit-power-of-two)))
(if (<= w math-bignum-logb-digit-size)
(list (logand (cdr q)
(1- (lsh 1 w))))
(math-mul-bignum-digit (math-clip-bignum (math-norm-bignum (car q))
(- w math-bignum-logb-digit-size))
math-bignum-digit-power-of-two
(cdr q)))))
(defvar math-max-digits-cache nil)
(defun math-compute-max-digits (w r)
(let* ((pair (+ (* r 100000) w))
(res (assq pair math-max-digits-cache)))
(if res
(cdr res)
(let* ((calc-command-flags nil)
(digs (math-ceiling (math-div w (math-real-log2 r)))))
(setq math-max-digits-cache (cons (cons pair digs)
math-max-digits-cache))
digs))))
(defvar math-log2-cache (list '(2 . 1)
'(4 . 2)
'(8 . 3)
'(10 . (float 332193 -5))
'(16 . 4)
'(32 . 5)))
(defun math-real-log2 (x) ;;; calc-internal-prec must be 6
(let ((res (assq x math-log2-cache)))
(if res
(cdr res)
(let* ((calc-symbolic-mode nil)
(calc-display-working-message nil)
(log (calcFunc-log x 2)))
(setq math-log2-cache (cons (cons x log) math-log2-cache))
log))))
(defconst math-radix-digits ["0" "1" "2" "3" "4" "5" "6" "7" "8" "9"
"A" "B" "C" "D" "E" "F" "G" "H" "I" "J"
"K" "L" "M" "N" "O" "P" "Q" "R" "S" "T"
"U" "V" "W" "X" "Y" "Z"])
(defsubst math-format-radix-digit (a) ; [X D]
(aref math-radix-digits a))
(defun math-format-radix (a) ; [X S]
(if (< a calc-number-radix)
(if (< a 0)
(concat "-" (math-format-radix (- a)))
(math-format-radix-digit a))
(let ((s ""))
(while (> a 0)
(setq s (concat (math-format-radix-digit (% a calc-number-radix)) s)
a (/ a calc-number-radix)))
s)))
(defconst math-binary-digits ["000" "001" "010" "011"
"100" "101" "110" "111"])
(defun math-format-binary (a) ; [X S]
(if (< a 8)
(if (< a 0)
(concat "-" (math-format-binary (- a)))
(math-format-radix a))
(let ((s ""))
(while (> a 7)
(setq s (concat (aref math-binary-digits (% a 8)) s)
a (/ a 8)))
(concat (math-format-radix a) s))))
(defun math-format-bignum-radix (a) ; [X L]
(cond ((null a) "0")
((and (null (cdr a))
(< (car a) calc-number-radix))
(math-format-radix-digit (car a)))
(t
(let ((q (math-div-bignum-digit a calc-number-radix)))
(concat (math-format-bignum-radix (math-norm-bignum (car q)))
(math-format-radix-digit (cdr q)))))))
(defun math-format-bignum-binary (a) ; [X L]
(cond ((null a) "0")
((null (cdr a))
(math-format-binary (car a)))
(t
(let ((q (math-div-bignum-digit a 512)))
(concat (math-format-bignum-binary (math-norm-bignum (car q)))
(aref math-binary-digits (/ (cdr q) 64))
(aref math-binary-digits (% (/ (cdr q) 8) 8))
(aref math-binary-digits (% (cdr q) 8)))))))
(defun math-format-bignum-octal (a) ; [X L]
(cond ((null a) "0")
((null (cdr a))
(math-format-radix (car a)))
(t
(let ((q (math-div-bignum-digit a 512)))
(concat (math-format-bignum-octal (math-norm-bignum (car q)))
(math-format-radix-digit (/ (cdr q) 64))
(math-format-radix-digit (% (/ (cdr q) 8) 8))
(math-format-radix-digit (% (cdr q) 8)))))))
(defun math-format-bignum-hex (a) ; [X L]
(cond ((null a) "0")
((null (cdr a))
(math-format-radix (car a)))
(t
(let ((q (math-div-bignum-digit a 256)))
(concat (math-format-bignum-hex (math-norm-bignum (car q)))
(math-format-radix-digit (/ (cdr q) 16))
(math-format-radix-digit (% (cdr q) 16)))))))
;;; Decompose into integer and fractional parts, without depending
;;; on calc-internal-prec.
(defun math-float-parts (a need-frac) ; returns ( int frac fracdigs )
(if (>= (nth 2 a) 0)
(list (math-scale-rounding (nth 1 a) (nth 2 a)) '(float 0 0) 0)
(let* ((d (math-numdigs (nth 1 a)))
(n (- (nth 2 a))))
(if need-frac
(if (>= n d)
(list 0 a n)
(let ((qr (math-idivmod (nth 1 a) (math-scale-int 1 n))))
(list (car qr) (math-make-float (cdr qr) (- n)) n)))
(list (math-scale-rounding (nth 1 a) (nth 2 a))
'(float 0 0) 0)))))
(defun math-format-radix-float (a prec)
(let ((fmt (car calc-float-format))
(figs (nth 1 calc-float-format))
(point calc-point-char)
(str nil)
pos)
(if (eq fmt 'fix)
(let* ((afigs (math-abs figs))
(fp (math-float-parts a (> afigs 0)))
(calc-internal-prec (+ 3 (max (nth 2 fp)
(math-convert-radix-digits
afigs t))))
(int (car fp))
(frac (math-round (math-mul (math-normalize (nth 1 fp))
(math-radix-float-power afigs)))))
(if (not (and (math-zerop frac) (math-zerop int) (< figs 0)))
(let ((math-radix-explicit-format nil))
(let ((calc-group-digits nil))
(setq str (if (> afigs 0) (math-format-number frac) ""))
(if (< (length str) afigs)
(setq str (concat (make-string (- afigs (length str)) ?0)
str))
(if (> (length str) afigs)
(setq str (substring str 1)
int (math-add int 1))))
(setq str (concat (math-format-number int) point str)))
(when calc-group-digits
(setq str (math-group-float str))))
(setq figs 0))))
(or str
(let* ((prec calc-internal-prec)
(afigs (if (> figs 0)
figs
(max 1 (+ figs
(1- (math-convert-radix-digits
(max prec
(math-numdigs (nth 1 a)))))))))
(calc-internal-prec (+ 3 (math-convert-radix-digits afigs t)))
(explo -1) (vlo (math-radix-float-power explo))
(exphi 1) (vhi (math-radix-float-power exphi))
expmid vmid eadj)
(setq a (math-normalize a))
(if (Math-zerop a)
(setq explo 0)
(if (math-lessp-float '(float 1 0) a)
(while (not (math-lessp-float a vhi))
(setq explo exphi vlo vhi
exphi (math-mul exphi 2)
vhi (math-radix-float-power exphi)))
(while (math-lessp-float a vlo)
(setq exphi explo vhi vlo
explo (math-mul explo 2)
vlo (math-radix-float-power explo))))
(while (not (eq (math-sub exphi explo) 1))
(setq expmid (math-div2 (math-add explo exphi))
vmid (math-radix-float-power expmid))
(if (math-lessp-float a vmid)
(setq exphi expmid vhi vmid)
(setq explo expmid vlo vmid)))
(setq a (math-div-float a vlo)))
(let* ((sc (math-round (math-mul a (math-radix-float-power
(1- afigs)))))
(math-radix-explicit-format nil))
(let ((calc-group-digits nil))
(setq str (math-format-number sc))))
(if (> (length str) afigs)
(setq str (substring str 0 -1)
explo (1+ explo)))
(if (and (eq fmt 'float)
(math-lessp explo (+ (if (= figs 0)
(1- (math-convert-radix-digits
prec))
afigs)
calc-display-sci-high 1))
(math-lessp calc-display-sci-low explo))
(let ((dpos (1+ explo)))
(cond ((<= dpos 0)
(setq str (concat "0" point (make-string (- dpos) ?0)
str)))
((> dpos (length str))
(setq str (concat str (make-string (- dpos (length str))
?0) point)))
(t
(setq str (concat (substring str 0 dpos) point
(substring str dpos)))))
(setq explo nil))
(setq eadj (if (eq fmt 'eng)
(min (math-mod explo 3) (length str))
0)
str (concat (substring str 0 (1+ eadj)) point
(substring str (1+ eadj)))))
(setq pos (length str))
(while (eq (aref str (1- pos)) ?0) (setq pos (1- pos)))
(and explo (eq (aref str (1- pos)) ?.) (setq pos (1- pos)))
(setq str (substring str 0 pos))
(when calc-group-digits
(setq str (math-group-float str)))
(if explo
(let ((estr (let ((calc-number-radix 10)
(calc-group-digits nil))
(math-format-number
(math-sub explo eadj)))))
(setq str (if (or (memq calc-language '(math maple))
(> calc-number-radix 14))
(format "%s*%d.^%s" str calc-number-radix estr)
(format "%se%s" str estr)))))))
str))
(defvar math-radix-digits-cache nil)
(defun math-convert-radix-digits (n &optional to-dec)
(let ((key (cons n (cons to-dec calc-number-radix))))
(or (cdr (assoc key math-radix-digits-cache))
(let* ((calc-internal-prec 6)
(log (math-div (math-real-log2 calc-number-radix)
'(float 332193 -5))))
(cdr (car (setq math-radix-digits-cache
(cons (cons key (math-ceiling (if to-dec
(math-mul n log)
(math-div n log))))
math-radix-digits-cache))))))))
(defvar math-radix-float-cache-tag nil)
(defvar math-radix-float-cache)
(defun math-radix-float-power (n)
(if (eq n 0)
'(float 1 0)
(or (and (eq calc-number-radix (car math-radix-float-cache-tag))
(<= calc-internal-prec (cdr math-radix-float-cache-tag)))
(setq math-radix-float-cache-tag (cons calc-number-radix
calc-internal-prec)
math-radix-float-cache nil))
(math-normalize
(or (cdr (assoc n math-radix-float-cache))
(cdr (car (setq math-radix-float-cache
(cons (cons
n
(let ((calc-internal-prec
(cdr math-radix-float-cache-tag)))
(if (math-negp n)
(math-div-float '(float 1 0)
(math-radix-float-power
(math-neg n)))
(math-mul-float (math-sqr-float
(math-radix-float-power
(math-div2 n)))
(if (math-evenp n)
'(float 1 0)
(math-float
calc-number-radix))))))
math-radix-float-cache))))))))
;;; Two's complement mode
(defun math-format-twos-complement (a)
"Format an integer in two's complement mode."
(let* (;(calc-leading-zeros t)
(overflow nil)
(negative nil)
(num
(cond
((or (eq a 0)
(and (Math-integer-posp a)))
(if (integerp a)
(math-format-radix a)
(math-format-bignum-radix (cdr a))))
((Math-integer-negp a)
(let ((newa (math-add a math-2-word-size)))
(if (integerp newa)
(math-format-radix newa)
(math-format-bignum-radix (cdr newa))))))))
(let* ((calc-internal-prec 6)
(digs (math-compute-max-digits (math-abs calc-word-size)
calc-number-radix))
(len (length num)))
(if (< len digs)
(setq num (concat (make-string (- digs len) ?0) num))))
(when calc-group-digits
(setq num (math-group-float num)))
(concat
(number-to-string calc-number-radix)
"##"
num)))
(provide 'calc-bin)
;;; calc-bin.el ends here
```
|
```cmake
# or more contributor license agreements. See the NOTICE file
# distributed with this work for additional information
# regarding copyright ownership. The ASF licenses this file
#
# path_to_url
#
# Unless required by applicable law or agreed to in writing,
# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
# specific language governing permissions and limitations
if(ARROW_PROTOBUF_USE_SHARED)
set(Protobuf_USE_STATIC_LIBS OFF)
else()
set(Protobuf_USE_STATIC_LIBS ON)
endif()
set(find_package_args)
if(ProtobufAlt_FIND_VERSION)
list(APPEND find_package_args ${ProtobufAlt_FIND_VERSION})
endif()
if(ProtobufAlt_FIND_QUIETLY)
list(APPEND find_package_args QUIET)
endif()
find_package(protobuf CONFIG ${find_package_args})
set(ProtobufAlt_FOUND ${protobuf_FOUND})
if(ProtobufAlt_FOUND)
if(Protobuf_PROTOC_EXECUTABLE)
# work around path_to_url
set_target_properties(protobuf::protoc PROPERTIES IMPORTED_LOCATION_RELEASE
"${Protobuf_PROTOC_EXECUTABLE}")
endif()
set(ProtobufAlt_VERSION ${protobuf_VERSION})
set(ProtobufAlt_VERSION_MAJOR ${protobuf_VERSION_MAJOR})
set(ProtobufAlt_VERSION_MINOR ${protobuf_VERSION_MINOR})
set(ProtobufAlt_VERSION_PATCH ${protobuf_VERSION_PATCH})
set(ProtobufAlt_VERSION_TWEEK ${protobuf_VERSION_TWEEK})
else()
find_package(Protobuf ${find_package_args})
set(ProtobufAlt_FOUND ${Protobuf_FOUND})
if(ProtobufAlt_FOUND)
set(ProtobufAlt_VERSION ${Protobuf_VERSION})
set(ProtobufAlt_VERSION_MAJOR ${Protobuf_VERSION_MAJOR})
set(ProtobufAlt_VERSION_MINOR ${Protobuf_VERSION_MINOR})
set(ProtobufAlt_VERSION_PATCH ${Protobuf_VERSION_PATCH})
set(ProtobufAlt_VERSION_TWEEK ${Protobuf_VERSION_TWEEK})
endif()
endif()
```
|
The Center for HIV Law and Policy (CHLP) is a national legal and policy resource and strategy center in the United States working to reduce the impact of HIV on vulnerable and marginalized communities and to secure the human rights of people affected by HIV. CHLP's founder and executive director is Catherine Hanssens.
Work
CHLP is the organizational home of the Positive Justice Project (PJP), a national coalition of organizations and individuals in the United States working to end HIV criminalization. PJP released the first national statement against HIV criminalization, and this statement has been endorsed by organizations and individuals across the country. Over the last few years, there has been a growing movement to end the use of criminal laws that target persons with HIV, and even the United States federal government is taking a closer look at this issue.
Another CHLP initiative, Teen SENSE, works to secure the right of youth in state custody to comprehensive, LGBTQ-inclusive sexual health care and sexual health literacy programs.
CHLP is known for its HIV Policy Resource Bank, a free, public, online collection of research, reports and other HIV-related materials. The HIV Policy Resource Bank also includes publications from the Center for HIV Law and Policy, such as "When Sex is a Crime and Spit is a Dangerous Weapon", mapping HIV criminalization in the United States.
In May 2014, the Center for Gender and Sexuality Law at Columbia Law School published a report co-authored by the Center for HIV Law and Policy, the Center for American Progress and Streetwise & Safe called "Roadmap for Change: Federal Policy Recommendations for Addressing the Criminalization of LGBT People and People Living with HIV."
THE REPEAL HIV Discrimination Act
The REPEAL HIV Discrimination Act was the abbreviated name of the 'Repeal Existing Policies that Encourage and Allow Legal HIV Discrimination Act' (H.R. 3053), also called the REPEAL Act, proposed legislation that was introduced in the U.S. Congress on September 23, 2011, by Rep. Barbara Lee (D-CA). It called for review of all federal and state laws, policies, and regulations regarding the criminal prosecution of individuals for HIV-related offenses. It was the first piece of federal legislation to address HIV criminalization and provided incentives for states to reconsider laws and practices that target people with HIV for consensual sexual activity and conduct that poses no risk of HIV transmission. The bill had 41 cosponsors and was referred in September/October 2011 to three subcommittees, where it died.
Barbara Lee re-introduced the REPEAL HIV Discrimination Act 2013 as H.R. 1843 in May 2013 with 42 cosponsors, and it again died in three subcommittees. Senator Chris Coons introduced the legislation as S.1790 on December 10, 2013, and it did not make it out of the Judiciary Committee.
See also
Criminal transmission of HIV
Criminal transmission of HIV in the United States
Presidential Advisory Council on HIV/AIDS
Nushawn Williams
Infectious diseases within American prisons#HIV/AIDS
References
External links
Positive Justice Project
The Center for HIV Law and Policy
State-by-State: HIV Laws
HIV/AIDS organizations in the United States
Legal organizations based in the United States
|
```python
import demistomock as demisto
from CommonServerPython import *
from CommonServerUserPython import *
import base64
import zlib
def get_file_data(file_path: str, is_zip: bool = False):
with open(file_path, 'rb') as f:
data = f.read()
if is_zip:
data = zlib.compress(data)
return base64.b64encode(data).decode('utf-8')
def main():
list_name = demisto.args()['listName']
is_zip = (demisto.args()['zipFile'] == 'true')
entry_id = demisto.args()['entryId']
res = demisto.getFilePath(entry_id)
if not res:
return_error(f"Entry {entry_id} not found")
file_path = res['path']
file_base64 = get_file_data(file_path, is_zip)
res = demisto.executeCommand("createList", {"listName": list_name, "listData": file_base64})
if isError(res):
return res
return {
'Contents': file_base64,
'ContentsFormat': formats['text'],
'HumanReadable': tableToMarkdown(
'File successfully stored in list',
{
'File Entry ID': entry_id,
'List Name': list_name,
'Size': len(file_base64)
}
),
'HumanReadableFormat': formats['markdown'],
}
if __name__ in ('__main__', '__builtin__', 'builtins'):
demisto.results(main())
```
|
```python
"""SCons.Tool.sunc++
Tool-specific initialization for C++ on SunOS / Solaris.
There normally shouldn't be any need to import this module directly.
It will usually be imported through the generic SCons.Tool.Tool()
selection method.
"""
#
#
# Permission is hereby granted, free of charge, to any person obtaining
# a copy of this software and associated documentation files (the
# "Software"), to deal in the Software without restriction, including
# without limitation the rights to use, copy, modify, merge, publish,
# distribute, sublicense, and/or sell copies of the Software, and to
# permit persons to whom the Software is furnished to do so, subject to
# the following conditions:
#
# The above copyright notice and this permission notice shall be included
# in all copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY
# KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE
# WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
# NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
# LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
# OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
# WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
#
__revision__ = "src/engine/SCons/Tool/sunc++.py bee7caf9defd6e108fc2998a2520ddb36a967691 2019-12-17 02:07:09 bdeegan"
#forward proxy to the preffered cxx version
from SCons.Tool.suncxx import *
# Local Variables:
# tab-width:4
# indent-tabs-mode:nil
# End:
# vim: set expandtab tabstop=4 shiftwidth=4:
```
|
```python
# your_sha256_hash___________
#
# Pyomo: Python Optimization Modeling Objects
# National Technology and Engineering Solutions of Sandia, LLC
# Under the terms of Contract DE-NA0003525 with National Technology and
# Engineering Solutions of Sandia, LLC, the U.S. Government retains certain
# rights in this software.
# your_sha256_hash___________
#
# Unit Tests for Port
#
import pyomo.common.unittest as unittest
from io import StringIO
from pyomo.environ import (
ConcreteModel,
AbstractModel,
Var,
Set,
NonNegativeReals,
Binary,
Reals,
Integers,
RangeSet,
)
from pyomo.network import Port, Arc
class TestPort(unittest.TestCase):
def test_default_scalar_constructor(self):
model = ConcreteModel()
model.c = Port()
self.assertEqual(len(model.c), 1)
self.assertEqual(len(model.c.vars), 0)
model = AbstractModel()
model.c = Port()
self.assertEqual(len(model.c), 0)
# FIXME: Not sure I like this behavior: but since this is
# (currently) an attribute, there is no way to check for
# construction without converting it to a property.
#
# TODO: if we move away from multiple inheritance for
# simplevars, then this can trigger an exception (cleanly)
self.assertEqual(len(model.c.vars), 0)
inst = model.create_instance()
self.assertEqual(len(inst.c), 1)
self.assertEqual(len(inst.c.vars), 0)
def test_default_indexed_constructor(self):
model = ConcreteModel()
model.c = Port([1, 2, 3])
self.assertEqual(len(model.c), 3)
self.assertEqual(len(model.c[1].vars), 0)
model = AbstractModel()
model.c = Port([1, 2, 3])
self.assertEqual(len(model.c), 0)
self.assertRaises(ValueError, model.c.__getitem__, 1)
inst = model.create_instance()
self.assertEqual(len(inst.c), 3)
self.assertEqual(len(inst.c[1].vars), 0)
def test_add_scalar_vars(self):
pipe = ConcreteModel()
pipe.flow = Var()
pipe.pIn = Var(within=NonNegativeReals)
pipe.pOut = Var(within=NonNegativeReals)
pipe.OUT = Port()
pipe.OUT.add(pipe.flow, "flow")
pipe.OUT.add(pipe.pOut, "pressure")
self.assertEqual(len(pipe.OUT), 1)
self.assertEqual(len(pipe.OUT.vars), 2)
self.assertFalse(pipe.OUT.vars['flow'].is_expression_type())
pipe.IN = Port()
pipe.IN.add(-pipe.flow, "flow")
pipe.IN.add(pipe.pIn, "pressure")
self.assertEqual(len(pipe.IN), 1)
self.assertEqual(len(pipe.IN.vars), 2)
self.assertTrue(pipe.IN.vars['flow'].is_expression_type())
def test_add_indexed_vars(self):
pipe = ConcreteModel()
pipe.SPECIES = Set(initialize=['a', 'b', 'c'])
pipe.flow = Var()
pipe.composition = Var(pipe.SPECIES)
pipe.pIn = Var(within=NonNegativeReals)
pipe.OUT = Port()
pipe.OUT.add(pipe.flow, "flow")
pipe.OUT.add(pipe.composition, "composition")
pipe.OUT.add(pipe.pIn, "pressure")
self.assertEqual(len(pipe.OUT), 1)
self.assertEqual(len(pipe.OUT.vars), 3)
def test_fixed(self):
pipe = ConcreteModel()
pipe.SPECIES = Set(initialize=['a', 'b', 'c'])
pipe.flow = Var()
pipe.composition = Var(pipe.SPECIES)
pipe.pIn = Var(within=NonNegativeReals)
pipe.OUT = Port()
self.assertTrue(pipe.OUT.is_fixed())
pipe.OUT.add(pipe.flow, "flow")
self.assertFalse(pipe.OUT.is_fixed())
pipe.flow.fix(0)
self.assertTrue(pipe.OUT.is_fixed())
pipe.OUT.add(-pipe.pIn, "pressure")
self.assertFalse(pipe.OUT.is_fixed())
pipe.pIn.fix(1)
self.assertTrue(pipe.OUT.is_fixed())
pipe.OUT.add(pipe.composition, "composition")
self.assertFalse(pipe.OUT.is_fixed())
pipe.composition['a'].fix(1)
self.assertFalse(pipe.OUT.is_fixed())
pipe.composition['b'].fix(1)
pipe.composition['c'].fix(1)
self.assertTrue(pipe.OUT.is_fixed())
m = ConcreteModel()
m.SPECIES = Set(initialize=['a', 'b', 'c'])
m.flow = Var()
m.composition = Var(m.SPECIES)
m.pIn = Var(within=NonNegativeReals)
m.port = Port()
m.port.add(m.flow, "flow")
m.port.add(-m.pIn, "pressure")
m.port.add(m.composition, "composition")
m.port.fix()
self.assertTrue(m.port.is_fixed())
def test_polynomial_degree(self):
pipe = ConcreteModel()
pipe.SPECIES = Set(initialize=['a', 'b', 'c'])
pipe.flow = Var()
pipe.composition = Var(pipe.SPECIES)
pipe.pIn = Var(within=NonNegativeReals)
pipe.OUT = Port()
self.assertEqual(pipe.OUT.polynomial_degree(), 0)
pipe.OUT.add(pipe.flow, "flow")
self.assertEqual(pipe.OUT.polynomial_degree(), 1)
pipe.flow.fix(0)
self.assertEqual(pipe.OUT.polynomial_degree(), 0)
pipe.OUT.add(-pipe.pIn, "pressure")
self.assertEqual(pipe.OUT.polynomial_degree(), 1)
pipe.pIn.fix(1)
self.assertEqual(pipe.OUT.polynomial_degree(), 0)
pipe.OUT.add(pipe.composition, "composition")
self.assertEqual(pipe.OUT.polynomial_degree(), 1)
pipe.composition['a'].fix(1)
self.assertEqual(pipe.OUT.polynomial_degree(), 1)
pipe.composition['b'].fix(1)
pipe.composition['c'].fix(1)
self.assertEqual(pipe.OUT.polynomial_degree(), 0)
pipe.OUT.add(pipe.flow * pipe.pIn, "quadratic")
self.assertEqual(pipe.OUT.polynomial_degree(), 0)
pipe.flow.unfix()
self.assertEqual(pipe.OUT.polynomial_degree(), 1)
pipe.pIn.unfix()
self.assertEqual(pipe.OUT.polynomial_degree(), 2)
pipe.OUT.add(pipe.flow / pipe.pIn, "nonLin")
self.assertEqual(pipe.OUT.polynomial_degree(), None)
def test_potentially_variable(self):
m = ConcreteModel()
m.x = Var()
m.p = Port()
self.assertTrue(m.p.is_potentially_variable())
m.p.add(-m.x)
self.assertTrue(m.p.is_potentially_variable())
def test_binary(self):
m = ConcreteModel()
m.x = Var(domain=Binary)
m.y = Var(domain=Reals)
m.p = Port()
self.assertTrue(m.p.is_binary())
m.p.add(m.x)
self.assertTrue(m.p.is_binary())
m.p.add(-m.x, "foo")
self.assertTrue(m.p.is_binary())
m.p.add(m.y)
self.assertFalse(m.p.is_binary())
m.p.remove('y')
self.assertTrue(m.p.is_binary())
m.p.add(-m.y, "bar")
self.assertFalse(m.p.is_binary())
def test_integer(self):
m = ConcreteModel()
m.x = Var(domain=Integers)
m.y = Var(domain=Reals)
m.p = Port()
self.assertTrue(m.p.is_integer())
m.p.add(m.x)
self.assertTrue(m.p.is_integer())
m.p.add(-m.x, "foo")
self.assertTrue(m.p.is_integer())
m.p.add(m.y)
self.assertFalse(m.p.is_integer())
m.p.remove('y')
self.assertTrue(m.p.is_integer())
m.p.add(-m.y, "bar")
self.assertFalse(m.p.is_integer())
def test_continuous(self):
m = ConcreteModel()
m.x = Var(domain=Reals)
m.y = Var(domain=Integers)
m.p = Port()
self.assertTrue(m.p.is_continuous())
m.p.add(m.x)
self.assertTrue(m.p.is_continuous())
m.p.add(-m.x, "foo")
self.assertTrue(m.p.is_continuous())
m.p.add(m.y)
self.assertFalse(m.p.is_continuous())
m.p.remove('y')
self.assertTrue(m.p.is_continuous())
m.p.add(-m.y, "bar")
self.assertFalse(m.p.is_continuous())
def test_getattr(self):
m = ConcreteModel()
m.x = Var()
m.port = Port()
m.port.add(m.x)
self.assertIs(m.port.x, m.x)
def test_arc_lists(self):
m = ConcreteModel()
m.x = Var()
m.p1 = Port()
m.p2 = Port()
m.p3 = Port()
m.p4 = Port()
m.p5 = Port()
m.p1.add(m.x)
m.p2.add(m.x)
m.p3.add(m.x)
m.p4.add(m.x)
m.p5.add(m.x)
m.a1 = Arc(source=m.p1, destination=m.p2)
m.a2 = Arc(source=m.p1, destination=m.p3)
m.a3 = Arc(source=m.p4, destination=m.p1)
m.a4 = Arc(source=m.p5, destination=m.p1)
self.assertEqual(len(m.p1.dests()), 2)
self.assertEqual(len(m.p1.sources()), 2)
self.assertEqual(len(m.p1.arcs()), 4)
self.assertEqual(len(m.p2.dests()), 0)
self.assertEqual(len(m.p2.sources()), 1)
self.assertEqual(len(m.p2.arcs()), 1)
self.assertIn(m.a1, m.p1.dests())
self.assertIn(m.a1, m.p2.sources())
self.assertNotIn(m.a1, m.p1.sources())
self.assertNotIn(m.a1, m.p2.dests())
self.assertEqual(len(m.p1.dests(active=True)), 2)
self.assertEqual(len(m.p1.sources(active=True)), 2)
self.assertEqual(len(m.p1.arcs(active=True)), 4)
self.assertEqual(len(m.p2.dests(active=True)), 0)
self.assertEqual(len(m.p2.sources(active=True)), 1)
self.assertEqual(len(m.p2.arcs(active=True)), 1)
self.assertIn(m.a1, m.p1.dests(active=True))
self.assertIn(m.a1, m.p2.sources(active=True))
self.assertNotIn(m.a1, m.p1.sources(active=True))
self.assertNotIn(m.a1, m.p2.dests(active=True))
m.a2.deactivate()
self.assertNotIn(m.a2, m.p1.dests(active=True))
self.assertNotIn(m.a2, m.p3.sources(active=True))
self.assertIn(m.a2, m.p1.dests(active=False))
self.assertIn(m.a2, m.p3.sources(active=False))
self.assertIn(m.a2, m.p1.arcs(active=False))
self.assertIn(m.a2, m.p3.arcs(active=False))
self.assertIn(m.a2, m.p1.dests())
self.assertIn(m.a2, m.p3.sources())
self.assertIn(m.a2, m.p1.arcs())
self.assertIn(m.a2, m.p3.arcs())
def test_remove(self):
m = ConcreteModel()
m.x = Var()
m.port = Port()
m.port.add(m.x)
self.assertIn('x', m.port.vars)
self.assertIn('x', m.port._rules)
m.port.remove('x')
self.assertNotIn('x', m.port.vars)
self.assertNotIn('x', m.port._rules)
def test_extends(self):
m = ConcreteModel()
m.x = Var()
m.p1 = Port()
m.p1.add(m.x, rule=Port.Extensive)
m.p2 = Port(extends=m.p1)
self.assertIs(m.p2.x, m.x)
self.assertIs(m.p2.rule_for('x'), Port.Extensive)
self.assertTrue(m.p2.is_extensive('x'))
self.assertFalse(m.p2.is_equality('x'))
def test_add_from_containers(self):
m = ConcreteModel()
m.x = Var()
m.y = Var()
m.p1 = Port(initialize=[m.x, m.y])
m.p2 = Port(initialize=[(m.x, Port.Equality), (m.y, Port.Extensive)])
m.p3 = Port(initialize=dict(this=m.x, that=m.y))
m.p4 = Port(
initialize=dict(this=(m.x, Port.Equality), that=(m.y, Port.Extensive))
)
self.assertIs(m.p1.x, m.x)
self.assertIs(m.p1.y, m.y)
self.assertIs(m.p2.x, m.x)
self.assertTrue(m.p2.is_equality('x'))
self.assertIs(m.p2.y, m.y)
self.assertTrue(m.p2.is_extensive('y'))
self.assertIs(m.p3.this, m.x)
self.assertIs(m.p3.that, m.y)
self.assertIs(m.p4.this, m.x)
self.assertTrue(m.p4.is_equality('this'))
self.assertIs(m.p4.that, m.y)
self.assertTrue(m.p4.is_extensive('that'))
def test_fix_unfix(self):
m = ConcreteModel()
m.x = Var()
m.port = Port()
m.port.add(m.x)
m.x.value = 10
m.port.fix()
self.assertTrue(m.x.is_fixed())
m.port.unfix()
self.assertFalse(m.x.is_fixed())
def test_iter_vars(self):
def contains(item, container):
# use this instead of "in" to avoid "==" operation
return any(item is mem for mem in container)
m = ConcreteModel()
m.s = RangeSet(5)
m.x = Var()
m.y = Var()
m.z = Var(m.s)
m.a = Var()
m.b = Var()
m.c = Var()
expr = m.a + m.b * m.c
p = m.p = Port()
v = list(p.iter_vars())
self.assertEqual(len(v), 0)
p.add(m.x)
v = list(p.iter_vars())
self.assertEqual(len(v), 1)
p.add(m.y)
v = list(p.iter_vars())
self.assertEqual(len(v), 2)
p.add(m.z)
v = list(p.iter_vars())
self.assertEqual(len(v), 7)
self.assertTrue(contains(m.x, v))
self.assertTrue(contains(m.z[3], v))
p.add(expr, "expr")
v = list(p.iter_vars())
self.assertEqual(len(v), 8)
self.assertTrue(contains(m.x, v))
self.assertTrue(contains(m.z[3], v))
self.assertTrue(contains(expr, v))
m.x.fix(0)
v = list(p.iter_vars())
self.assertEqual(len(v), 8)
v = list(p.iter_vars(fixed=False))
self.assertEqual(len(v), 7)
self.assertTrue(contains(m.z[3], v))
self.assertTrue(contains(expr, v))
v = list(p.iter_vars(fixed=True))
self.assertEqual(len(v), 1)
self.assertIn(m.x, v)
v = list(p.iter_vars(expr_vars=True))
self.assertEqual(len(v), 10)
self.assertFalse(contains(expr, v))
self.assertTrue(contains(m.a, v))
self.assertTrue(contains(m.b, v))
m.a.fix(0)
v = list(p.iter_vars(expr_vars=True, fixed=False))
self.assertEqual(len(v), 8)
m.b.fix(0)
m.c.fix(0)
v = list(p.iter_vars(expr_vars=True, fixed=False))
self.assertEqual(len(v), 6)
v = list(p.iter_vars(fixed=False))
self.assertEqual(len(v), 6)
self.assertFalse(contains(expr, v))
v = list(p.iter_vars(expr_vars=True, names=True))
self.assertEqual(len(v), 10)
self.assertEqual(len(v[0]), 3)
for t in v:
if t[0] == 'x':
self.assertIs(t[2], m.x)
break
def test_pprint(self):
pipe = ConcreteModel()
pipe.SPECIES = Set(initialize=['a', 'b', 'c'])
pipe.flow = Var()
pipe.composition = Var(pipe.SPECIES)
pipe.pIn = Var(within=NonNegativeReals)
pipe.OUT = Port(implicit=['imp'])
pipe.OUT.add(-pipe.flow, "flow")
pipe.OUT.add(pipe.composition, "composition")
pipe.OUT.add(pipe.composition['a'], "comp_a")
pipe.OUT.add(pipe.pIn, "pressure")
os = StringIO()
pipe.OUT.pprint(ostream=os)
self.assertEqual(
os.getvalue(),
"""OUT : Size=1, Index=None
Key : Name : Size : Variable
None : comp_a : 1 : composition[a]
: composition : 3 : composition
: flow : 1 : - flow
: imp : - : None
: pressure : 1 : pIn
""",
)
def _IN(m, i):
return {'pressure': pipe.pIn, 'flow': pipe.composition[i] * pipe.flow}
pipe.IN = Port(pipe.SPECIES, rule=_IN)
os = StringIO()
pipe.IN.pprint(ostream=os)
self.assertEqual(
os.getvalue(),
"""IN : Size=3, Index=SPECIES
Key : Name : Size : Variable
a : flow : 1 : composition[a]*flow
: pressure : 1 : pIn
b : flow : 1 : composition[b]*flow
: pressure : 1 : pIn
c : flow : 1 : composition[c]*flow
: pressure : 1 : pIn
""",
)
def test_display(self):
pipe = ConcreteModel()
pipe.SPECIES = Set(initialize=['a', 'b', 'c'])
pipe.flow = Var(initialize=10)
pipe.composition = Var(pipe.SPECIES, initialize=lambda m, i: ord(i) - ord('a'))
pipe.pIn = Var(within=NonNegativeReals, initialize=3.14)
pipe.OUT = Port(implicit=['imp'])
pipe.OUT.add(-pipe.flow, "flow")
pipe.OUT.add(pipe.composition, "composition")
pipe.OUT.add(pipe.pIn, "pressure")
os = StringIO()
pipe.OUT.display(ostream=os)
self.assertEqual(
os.getvalue(),
"""OUT : Size=1
Key : Name : Value
None : composition : {'a': 0, 'b': 1, 'c': 2}
: flow : -10
: imp : -
: pressure : 3.14
""",
)
def _IN(m, i):
return {'pressure': pipe.pIn, 'flow': pipe.composition[i] * pipe.flow}
pipe.IN = Port(pipe.SPECIES, rule=_IN)
os = StringIO()
pipe.IN.display(ostream=os)
self.assertEqual(
os.getvalue(),
"""IN : Size=3
Key : Name : Value
a : flow : 0
: pressure : 3.14
b : flow : 10
: pressure : 3.14
c : flow : 20
: pressure : 3.14
""",
)
if __name__ == "__main__":
unittest.main()
```
|
The list of ship launches in 1927 includes a chronological list of some ships launched in 1927.
References
Sources
1927
Ship launches
|
Universal Pulse is a mini-LP and the tenth studio album by American rock band 311, released on July 19, 2011 on 311 Records/ATO Records. It clocks in at almost 29 minutes, making it the shortest album 311 ever released, as well as their first release on their own independent record company. It has a 57 out of 100 on Metacritic, indicating "mixed or average reviews".
Album information
Like its predecessor, Uplifter, this album was produced by Bob Rock, who has produced or engineered albums by numerous notable acts, such as Metallica, Aerosmith, Mötley Crüe, Bon Jovi, The Cult, Our Lady Peace and The Offspring. Unlike previous albums where their record label requested that the drums be recorded at an alternate location, all tracks, including the drums, were recorded at the Hive Studio. To support the album, 311 invited Sublime with Rome to co-headline the 2011 Unity Tour, with special guests DJ Soulman and DJ Trichrome. The artwork was done by Sonny Kay. With only eight songs and clocking within less than thirty minutes, it's their shortest album to date.
The album's first single "Sunset in July" was released on June 3, 2011. The album's second single "Count Me In" was released on October 4, 2011.
Reception
Allmusic editor Stephen Thomas Erlewine gave Universal Pulse a 2.5/5, commenting "Within the sharp relief of Bob Rock’s immaculate production, this can mean that the fuzz-toned guitars and crunching riffs are strenuously underlined: they are the foundation of this unusually rock-oriented 311 album yet in this crystal-clear atmosphere they drill, not pummel." and concludes that "Universal Pulse can be wearying even at its half-hour length." Consequence of Sound gave the album a 3.5/5 and declares that it's the band's best album since From Chaos, saying "Once this album has completed its first full rotation, there’s an immediate urge to play it again. It’s short, sweet, and a perfect follow-up to where the band was in 2009."
Track listing
Charts
Personnel
Credits adapted from album’s liner notes.
311
Nick Hexum – vocals, rhythm guitar
Doug "SA" Martinez – vocals
Tim Mahoney – lead guitar
P-Nut – bass
Chad Sexton – drums, mixing
Production
Bob Rock – producer, engineer
Giff Tripp – engineer
Joe Gastwirt – mastering
Jason Walters – studio manager
References
External links
311 (band) albums
2011 albums
Albums produced by Bob Rock
|
```objective-c
/**
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
/*
*
*
*/
#ifndef __LESWAPS_H
#define __LESWAPS_H
#include "LETypes.h"
/**
* \file
* \brief C++ API: Endian independent access to data for LayoutEngine
*/
U_NAMESPACE_BEGIN
/**
* A convenience macro which invokes the swapWord member function
* from a concise call.
*
* @deprecated ICU 54. See {@link icu::LayoutEngine}
*/
#define SWAPW(value) LESwaps::swapWord((le_uint16)(value))
/**
* A convenience macro which invokes the swapLong member function
* from a concise call.
*
* @deprecated ICU 54. See {@link icu::LayoutEngine}
*/
#define SWAPL(value) LESwaps::swapLong((le_uint32)(value))
/**
* This class is used to access data which stored in big endian order
* regardless of the conventions of the platform.
*
* All methods are static and inline in an attempt to induce the compiler
* to do most of the calculations at compile time.
*
* @deprecated ICU 54. See {@link icu::LayoutEngine}
*/
class U_LAYOUT_API LESwaps /* not : public UObject because all methods are static */ {
public:
/**
* Reads a big-endian 16-bit word and returns a native-endian value.
* No-op on a big-endian platform, byte-swaps on a little-endian platform.
*
* @param value - the word to be byte swapped
*
* @return the byte swapped word
*
* @deprecated ICU 54. See {@link icu::LayoutEngine}
*/
static le_uint16 swapWord(le_uint16 value)
{
#if (defined(U_IS_BIG_ENDIAN) && U_IS_BIG_ENDIAN) || \
(defined(BYTE_ORDER) && defined(BIG_ENDIAN) && (BYTE_ORDER == BIG_ENDIAN)) || \
defined(__BIG_ENDIAN__)
// Fastpath when we know that the platform is big-endian.
return value;
#else
// Reads a big-endian value on any platform.
const le_uint8 *p = reinterpret_cast<const le_uint8 *>(&value);
return (le_uint16)((p[0] << 8) | p[1]);
#endif
};
/**
* Reads a big-endian 32-bit word and returns a native-endian value.
* No-op on a big-endian platform, byte-swaps on a little-endian platform.
*
* @param value - the long to be byte swapped
*
* @return the byte swapped long
*
* @deprecated ICU 54. See {@link icu::LayoutEngine}
*/
static le_uint32 swapLong(le_uint32 value)
{
#if (defined(U_IS_BIG_ENDIAN) && U_IS_BIG_ENDIAN) || \
(defined(BYTE_ORDER) && defined(BIG_ENDIAN) && (BYTE_ORDER == BIG_ENDIAN)) || \
defined(__BIG_ENDIAN__)
// Fastpath when we know that the platform is big-endian.
return value;
#else
// Reads a big-endian value on any platform.
const le_uint8 *p = reinterpret_cast<const le_uint8 *>(&value);
return (le_uint32)((p[0] << 24) | (p[1] << 16) | (p[2] << 8) | p[3]);
#endif
};
private:
LESwaps() {} // private - forbid instantiation
};
U_NAMESPACE_END
#endif
```
|
The Potato Control Law (1929) was based upon an economic policy enacted by U.S. President Herbert Hoover's Federal Emergency Relief Administration at the beginning of the Great Depression. The policy became a formal act in 1935, and its legislative sponsors were from the state of North Carolina. Hoover's presidential successor, Franklin D. Roosevelt, signed the Act into law on August 24, 1935.
The law was enforced by the Agricultural Adjustment Administration (AAA) to protect about 30,000 farmers who made their main living growing potatoes, and who feared that the potato market would be glutted by other farmers whose land had been legislatively idled by other AAA controls.
The law restricted the export of potatoes and mandated that they be used instead to provide direct relief to those in need. Because of the federal government's direct involvement in the economic affairs of American potato growers, this law was widely regarded as one of the most radical and controversial pieces of legislation enacted during the New Deal. The United States Supreme Court declared it unconstitutional in 1936.
The Potato Control legislation prevented individuals and companies from buying or offering to buy potatoes which were not packed in closed containers approved by the Secretary of Agriculture and bearing official government stamps. Penalties included a $1,000 fine on the first offense, and a year in jail and an additional $1,000 fine for a second offense. Farmers and brokers would not be issued the official stamps unless they paid a tax of $0.45 per bushel, or if they received tax-exemption stamps from the Secretary of Agriculture.
The law sparked considerable protest, as evident in the following 1935 declaration signed by citizens of West Amwell Township, New Jersey: That we protest against and declare that we will not be bound by the 'Potato Control Law,' an unconstitutional measure recently enacted by the United States Congress. We shall produce on our own land such potatoes as we may wish to produce and will dispose of them in such manner as we may deem proper. Included in the 1935 Potato Control Act was a provision that created the Federal Surplus Relief Corporation, a forerunner to The Emergency Food Assistance Program (TEFAP), which provides commodity food items like potatoes to soup kitchens, homeless shelters, and similar organizations that serve meals to the homeless and other individuals in need.
See also
Agricultural Adjustment Act Amendment of 1935
Critics of the New Deal
New Deal
Great Depression
New Deal coalition
References
External links
1929 in American law
History of the potato
New Deal legislation
United States federal agriculture legislation
es:Ley de Ajuste Agrario
nl:Agricultural Adjustment Administration
ja:農業調整法
pt:Agricultural Adjustment Administration
|
Sailor Moon, also known under the nickname of Saban Moon, is an unaired proof of concept pilot episode that loosely adapts the Japanese manga and anime television series Sailor Moon. The pilot episode featured a mixture of live-action and animation, as well as a diverse cast of young women who secretly fight evil. A two minute music video was created alongside the pilot.
The pilot was not picked up for production and was not distributed; the two minute music video was shown at an Anime Expo convention in 1995, where it was videotaped via camcorder. The pilot episode was considered to be lost media until its discovery in 2022 by YouTuber Ray Mona.
Synopsis
The pilot episode began with an animated section that shows how Sailor Moon and her friends, the Princess Warriors, were forced to flee to Earth. The evil Queen Beryl has taken over the outer Solar System and taken their Jewels of Power. Only the Moon, Earth, Jupiter, Mars, Venus, and Mercury still hold their Jewels of Power, infuriating Queen Beryl. These remaining planets have come together to form a federation led by Queen Serenity of the moon, in hopes of becoming strong enough to put an end to Queen Beryl's evil. Meanwhile Sailor Moon has fallen in love with Prince Darian of the Earth and intend to wed. Their betrothal ceremony is interrupted and Sailor Moon, her white cat Luna, and her friends are forced to flee the moon with their planets' Jewels of Power. Plans to meet up with Darian are shattered when his spaceship is destroyed in the fight. With few other options available to them, the girls use a black hole to travel to Earth.
The live-action portion shows the girls' life on Earth, where they attend a girls' academy and live in their dorms. Their peaceful lives there are disrupted by Luna informing them that they must travel to and defend the planet Jupiter. Their battle is shown as another animated segment where they manage to overcome all of the enemies save one, which is larger than the others. Sailor Moon is only able to defeat the monster after an unknown man in a tuxedo shows up and gives her extra power via a single white rose that he throws towards the monster and Sailor Moon. With the monsters successfully vanquished, the girls return to Earth.
Cast
The identity of the actors used in the pilot were not disclosed in the footage. YouTuber Ray Mona was able to ascertain their identities by interviewing the actress who portrayed Sailor Jupiter, Tami-Adrian George. The identity of the actors portraying Prince Darian and Sailor Venus was unable to be confirmed.
Stephanie Dicker as Victoria/Sailor Moon
Melinda "Mindy" Cowan as Sailor Mercury
Danny "Dani" DeLacey as Sailor Mars
Tami-Adrian George as Sailor Jupiter
Melendy Britt as the voice of Luna
Adrienne Barbeau as Queen Serenity / Queen Beryl
Patricia Alice Albrecht as the Narrator
Development
Plans to develop an American adaptation of Sailor Moon began in 1993. Per Ray Mona, Bandai and Toei Animation wanted to introduce the series to Western audiences and developed "Project Y" towards this end. Possible methods included a live-action film, an unrelated cartoon series, and dubbing the existing series into English. Renaissance-Atlantic Entertainment and Toon Makers, Inc. were brought on to the project, and it was decided that the series would be a new creation loosely based on the source material. The show would utilize both animation and live-action, and a seventeen (reduced eventually to 10) minute proof of concept pilot was created alongside a music video on a budget of $280,000.
Several girls auditioned for the pilot. The girls were individually selected by producers Rocky Solotoff and Steven Wilzbach, who wanted to feature a diverse cast. Solotoff, who served as the pilot's director, stated that he "wanted to keep the flavor of Sailor Moon and make it something where people who had no idea what it was could identify with these characters.” Sets from the American television series Saved by the Bell were used for the pilot, and actress Adrienne Barbeau was brought on to portray both Queen Beryl and Queen Serenity at the behest of Solotoff. Other actresses who performed in the pilot included Tami-Adrian George, Melendy Britt, and Patricia Alice Albrecht. For Solotoff, the cat portraying Luna was drugged in order to keep it docile and compliant, resulting in it "peeing on everything". Toon Makers, Inc. were given specific concept requirements for the pilot, one of which were sailboards that the Sailors would use for transport, which Solotoff believed was designed for toy sales. The characters of Luna and Artemis were also combined into a single white cat that would telepathically communicate with Sailor Moon.
Originally intended to enter full production in 1994 as part of the children's programming on Fox, the series was eventually scrapped in favor of dubbing the original anime produced by DiC Entertainment (Now WildBrain). Per Rich Johnston, this move was made due to the expense of creating the live-action and animated portions, which would require the use of union workers. The logo created for the pilot would be later re-used for the English dub; Irwin Toy released a "Moon Cycle" as part of its merchandise for the show, based on vehicles designed for the pilot. Frank Ward, along with his company Renaissance-Atlantic Entertainment, tried to salvage the concept of a live-action Sailor Moon series and created a 2-minute reel for a prospective series named Team Angel. The series would have followed four girls who would travel to Earth in order to defeat evil.
Discovery
The two-minute music video, which contained footage from the pilot, was screened at the 1995 Anime Expo in Los Angeles, where it was taped via camcorder. This footage would later be uploaded to video sites such as YouTube. It was given the colloquial name of "Saban Moon" despite having no connection with Saban Entertainment save for Renaissance-Atlantic Entertainment, which worked with the company on Power Rangers.
The pilot episode was considered lost media, and Solotoff was frequently contacted about the music video footage by people hoping to locate the full pilot. Rich Johnston covered the search for Bleeding Cool, noting that Solotoff was contacted approximately twice a week about the missing pilot. He further remarked that copyright would pose a potential barrier if the pilot were discovered, as the holders would need to grant their permission for the pilot to be shared, and that the copyright owner was believed to be Toei.
The pilot's script and animation cels were uncovered in Los Angeles in 2012, after a storage locker believed to have been owned by producer and animator Raymond Iacovacci was auctioned off. The buyer placed the script and cels on eBay. After the pilot failed, Iacovacci was given the scripts and animation cels for safekeeping. In 2018, Kotaku's Cecilia D'Anastasio wrote an article about her research into the unaired pilot episode. She interviewed Solotoff and Frank Ward, then president of Renaissance Atlantic, who made her aware of the Team Angel proof of concept. At the time of D'Anastasio's investigation, Ward believed that she was looking for footage of Team Angel, the second attempt made to bring a live-action Sailor Moon to fruition. He informed D'Anastasio that he still had a copy of the proof of concept and screened it for the journalist, who had been expecting Solotoff's pilot episode. Further discussion between D'Anastasio, Solotoff, and Ward resulted in both men stating that they were unaware if any of the pilot's footage still existed or where it might be found. The footage for the second proof of concept, which had never been previously publicly released, was published via Kotaku.
In 2022, YouTuber Ray Mona published a two-part documentary series on the history of Sailor Moon being brought to Western audiences, the pilot's creation, and her search for the episode on her channel, entitled "The Western World of Sailor Moon". Assisted in her search by D'Anastasio, Ray Mona was able to locate a copy of the pilot in the Library of Congress; the second part of the documentary discussed her search for the pilot and petitioning for access, as well as the pilot in its entirety. Ray Mona was granted permission by Ward to access the pilot and release it on YouTube.
Reception and legacy
Video footage of the music video's screening at AnimeExpo shows the audience reacting to the footage with laughter. Victoria McNally of The Mary Sue commented on the footage in 2014, remarking that "I know we’re laughing at this video because it’s cheesy compared to the original, but we all would have watched the hell out of this show. The ’90s was a very, very cheesy time." Timothy Donohoo of CBR.com, referring to the material uncovered in the storage locker and the AnimeExpo footage, was critical of the changes made to the characters and of the animation, calling it a "genuine trash fire" and that the "show's art direction fits in much better with an early '80s cartoon than one from the early '90s, making its other questionable components even worse."
The discovery of the pilot episode received media attention from outlets such as IGN and The Verge, the latter of which felt that the pilot was "totally worth the wait". GameRevolution remarked on the pilot, calling it the "holy grail of lost media" and praised Ray Mona's documentary series as a "fascinating journey and opens the door to dive into further aspects of its development." Nerdist also covered the pilot, calling it a "'90's time capsule" and writing that "they totally westernized Sailor Moon’s animation style, losing all of its anime flavor. Sailor Moon and her friends look more like Jem and the Holograms. And the live-action footage feels like an episode of the ’90s sitcom Blossom." Shane Stahl of Collider criticized the pilot as "flush with awkwardness", questioning "are the girls entering a different dimension when they transform into their animated counterparts? Are they time-traveling? What does any of this mean?" Princess Weekes of The Mary Sue criticized the pilot as cringy and not having much to praise while also noting that the presence of a disabled main character (Sailor Mercury is depicted as a wheelchair user) as "one of the actually promising and interesting things about the pilot."
On August 31, 2022, the Library of Congress highlighted the findings on their blog. Eric Graf, the individual who fulfilled Mona’s order, revealed himself to be an avid anime fan, and recalled being “jaw-floored” upon seeing the request and that “it’s been even bigger than I expected”. The Library of Congress wrote that the series’ newfound reception “says something quite positive about the cult of fandom as well as the value in collecting and then enabling to endure even the most minor and fleeting efforts of creative endeavor.”
Notes
References
External links
1994 in television
Rediscovered television
Sailor Moon mass media
Unaired television pilots
|
```objective-c
//
// YYKlineModel.m
// YYKline
//
//
#import "YYKlineModel.h"
#import "UIColor+YYKline.h"
@implementation YYKlineModel
- (NSString *)V_Date {
if (!_V_Date) {
NSDate *date = [NSDate dateWithTimeIntervalSince1970:_Timestamp.doubleValue];
NSDateFormatter *formatter = [[NSDateFormatter alloc]init];
formatter.dateFormat = @"yyyy-MM-dd HH:mm";
NSString *dateStr = [formatter stringFromDate:date];
_V_Date = dateStr;
}
return _V_Date;
}
- (NSString *)V_HHMM {
if (!_V_HHMM) {
NSDate *date = [NSDate dateWithTimeIntervalSince1970:_Timestamp.doubleValue];
NSDateFormatter *formatter = [[NSDateFormatter alloc]init];
formatter.dateFormat = @"HH:mm";
NSString *dateStr = [formatter stringFromDate:date];
_V_HHMM = dateStr;
}
return _V_HHMM;
}
- (NSAttributedString *)V_Price {
if (!_V_Price) {
_V_Price = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" %@ %.3f %.3f %.3f %.3f ", self.V_Date, self.Open.floatValue, self.High.floatValue, self.Low.floatValue, self.Close.floatValue] attributes:@{
NSForegroundColorAttributeName: [UIColor grayColor],
}];
}
return _V_Price;
}
- (NSAttributedString *)V_MA {
if (!_V_MA) {
NSAttributedString *str1 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" %@ %.3f %.3f %.3f %.3f ", self.V_Date, self.Open.floatValue, self.High.floatValue, self.Low.floatValue, self.Close.floatValue] attributes:@{
NSForegroundColorAttributeName: [UIColor grayColor],
}];
NSAttributedString *str2 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" MA10%.3f ",self.MA.MA1.floatValue] attributes:@{
NSForegroundColorAttributeName: [UIColor line1Color],
}];
NSAttributedString *str3 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" MA30%.3f ",self.MA.MA2.floatValue] attributes:@{
NSForegroundColorAttributeName: [UIColor line2Color],
}];
NSAttributedString *str4 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" MA60%.3f ",self.MA.MA3.floatValue] attributes:@{
NSForegroundColorAttributeName: [UIColor line3Color],
}];
NSMutableAttributedString *mStr = [[NSMutableAttributedString alloc] initWithAttributedString:str1];
[mStr appendAttributedString:str2];
[mStr appendAttributedString:str3];
[mStr appendAttributedString:str4];
_V_MA = [mStr copy];
}
return _V_MA;
}
- (NSAttributedString *)V_EMA {
if (!_V_EMA) {
NSAttributedString *str1 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" %@ %.3f %.3f %.3f %.3f ", self.V_Date, self.Open.floatValue, self.High.floatValue, self.Low.floatValue, self.Close.floatValue] attributes:@{
NSForegroundColorAttributeName: [UIColor grayColor],
}];
NSAttributedString *str2 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" EMA7%.3f ",self.EMA.EMA1.floatValue] attributes:@{
NSForegroundColorAttributeName: [UIColor line1Color],
}];
NSAttributedString *str3 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" EMA30%.3f ",self.EMA.EMA2.floatValue] attributes:@{
NSForegroundColorAttributeName: [UIColor line2Color],
}];
NSMutableAttributedString *mStr = [[NSMutableAttributedString alloc] initWithAttributedString:str1];
[mStr appendAttributedString:str2];
[mStr appendAttributedString:str3];
_V_EMA = [mStr copy];
}
return _V_EMA;
}
- (NSAttributedString *)V_BOLL {
if (!_V_BOLL) {
NSAttributedString *str1 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" %@ %.3f %.3f %.3f %.3f ", self.V_Date, self.Open.floatValue, self.High.floatValue, self.Low.floatValue, self.Close.floatValue] attributes:@{
NSForegroundColorAttributeName: [UIColor grayColor],
}];
NSAttributedString *str2 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" UP%.3f ",self.BOLL.UP.floatValue] attributes:@{
NSForegroundColorAttributeName: [UIColor line1Color],
}];
NSAttributedString *str3 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" MID%.3f ",self.BOLL.MID.floatValue] attributes:@{
NSForegroundColorAttributeName: [UIColor line2Color],
}];
NSAttributedString *str4 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" LOW%.3f ",self.BOLL.LOW.floatValue] attributes:@{
NSForegroundColorAttributeName: [UIColor line3Color],
}];
NSMutableAttributedString *mStr = [[NSMutableAttributedString alloc] initWithAttributedString:str1];
[mStr appendAttributedString:str2];
[mStr appendAttributedString:str3];
[mStr appendAttributedString:str4];
_V_BOLL = [mStr copy];
}
return _V_BOLL;
}
- (NSAttributedString *)V_Volume {
if (!_V_Volume) {
_V_Volume = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" %.0f", self.Volume.floatValue] attributes:@{
NSForegroundColorAttributeName: [UIColor grayColor],
}];
}
return _V_Volume;
}
- (NSAttributedString *)V_MACD {
if (!_V_MACD) {
NSAttributedString *str1 = [[NSAttributedString alloc] initWithString:@" MACD(12,26,9)" attributes:@{
NSForegroundColorAttributeName: [UIColor grayColor],
}];
NSAttributedString *str2 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" DIFF%.4f ",self.MACD.DIFF.floatValue] attributes:@{
NSForegroundColorAttributeName: [UIColor line1Color],
}];
NSAttributedString *str3 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" DEA%.4f ",self.MACD.DEA.floatValue] attributes:@{
NSForegroundColorAttributeName: [UIColor line2Color],
}];
NSAttributedString *str4 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" MACD%.4f ",self.MACD.MACD.floatValue] attributes:@{
NSForegroundColorAttributeName: self.MACD.MACD.floatValue < 0 ? UIColor.upColor : UIColor.downColor,
}];
NSMutableAttributedString *mStr = [[NSMutableAttributedString alloc] initWithAttributedString:str1];
[mStr appendAttributedString:str2];
[mStr appendAttributedString:str3];
[mStr appendAttributedString:str4];
_V_MACD = [mStr copy];
}
return _V_MACD;
}
- (NSAttributedString *)V_KDJ {
if (!_V_KDJ) {
NSAttributedString *str1 = [[NSAttributedString alloc] initWithString:@" KDJ(9,3,3)" attributes:@{
NSForegroundColorAttributeName: [UIColor grayColor],
}];
NSAttributedString *str2 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" K%.3f ",self.KDJ.K.floatValue] attributes:@{
NSForegroundColorAttributeName: UIColor.line1Color,
}];
NSAttributedString *str3 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" D%.3f ",self.KDJ.D.floatValue] attributes:@{
NSForegroundColorAttributeName: UIColor.line2Color,
}];
NSAttributedString *str4 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" J%.3f ",self.KDJ.J.floatValue] attributes:@{
NSForegroundColorAttributeName: UIColor.line3Color,
}];
NSMutableAttributedString *mStr = [[NSMutableAttributedString alloc] initWithAttributedString:str1];
[mStr appendAttributedString:str2];
[mStr appendAttributedString:str3];
[mStr appendAttributedString:str4];
_V_KDJ = [mStr copy];
}
return _V_KDJ;
}
- (NSAttributedString *)V_RSI {
if (!_V_RSI) {
NSAttributedString *str1 = [[NSAttributedString alloc] initWithString:@" RSI(6,12,24)" attributes:@{
NSForegroundColorAttributeName: [UIColor grayColor],
}];
NSAttributedString *str2 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" RSI6%.3f ",self.RSI.RSI1.floatValue] attributes:@{
NSForegroundColorAttributeName: UIColor.line1Color,
}];
NSAttributedString *str3 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" RSI12%.3f ",self.RSI.RSI2.floatValue] attributes:@{
NSForegroundColorAttributeName: UIColor.line2Color,
}];
NSAttributedString *str4 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" RSI24%.3f ",self.RSI.RSI3.floatValue] attributes:@{
NSForegroundColorAttributeName: UIColor.line3Color,
}];
NSMutableAttributedString *mStr = [[NSMutableAttributedString alloc] initWithAttributedString:str1];
[mStr appendAttributedString:str2];
[mStr appendAttributedString:str3];
[mStr appendAttributedString:str4];
_V_RSI = [mStr copy];
}
return _V_RSI;
}
- (NSAttributedString *)V_WR {
if (!_V_WR) {
NSAttributedString *str1 = [[NSAttributedString alloc] initWithString:@" WR(6,10)" attributes:@{
NSForegroundColorAttributeName: [UIColor grayColor],
}];
NSAttributedString *str2 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" WR6%.3f ",self.WR.WR1.floatValue] attributes:@{
NSForegroundColorAttributeName: UIColor.line1Color,
}];
NSAttributedString *str3 = [[NSAttributedString alloc] initWithString:[NSString stringWithFormat:@" WR10%.3f ",self.WR.WR2.floatValue] attributes:@{
NSForegroundColorAttributeName: UIColor.line2Color,
}];
NSMutableAttributedString *mStr = [[NSMutableAttributedString alloc] initWithAttributedString:str1];
[mStr appendAttributedString:str2];
[mStr appendAttributedString:str3];
_V_WR = [mStr copy];
}
return _V_WR;
}
- (BOOL)isUp {
if (self.Close.floatValue == self.Open.floatValue) {
return YES;
}
return self.Close.floatValue > self.Open.floatValue;
}
@end
```
|
```scss
/**
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
:host {
position: relative;
.fill-height {
height: 100%;
}
}
.tb-protobuf-content-toolbar {
button.mat-mdc-button-base, button.mat-mdc-button-base.tb-mat-32 {
align-items: center;
vertical-align: middle;
min-width: 32px;
min-height: 15px;
padding: 4px;
margin: 0;
font-size: .8rem;
line-height: 15px;
color: #7b7b7b;
background: rgba(220, 220, 220, .35);
&:not(:last-child) {
margin-right: 4px;
}
}
button.mat-mdc-button-base:not(.mat-mdc-icon-button) {
height: 23px;
}
}
.tb-protobuf-content-panel {
height: 100%;
margin-left: 15px;
border: 1px solid #c0c0c0;
#tb-protobuf-input {
width: 100%;
min-width: 200px;
min-height: 160px;
height: 100%;
&:not(.fill-height) {
min-height: 200px;
}
}
}
```
|
```c++
/*
* C99PipelineLayout.cpp
*
*/
#include <LLGL/PipelineLayout.h>
#include <LLGL-C/PipelineLayout.h>
#include "C99Internal.h"
// namespace LLGL {
using namespace LLGL;
LLGL_C_EXPORT uint32_t llglGetPipelineLayoutNumHeapBindings(LLGLPipelineLayout pipelineLayout)
{
return LLGL_PTR(PipelineLayout, pipelineLayout)->GetNumHeapBindings();
}
LLGL_C_EXPORT uint32_t llglGetPipelineLayoutNumBindings(LLGLPipelineLayout pipelineLayout)
{
return LLGL_PTR(PipelineLayout, pipelineLayout)->GetNumBindings();
}
LLGL_C_EXPORT uint32_t llglGetPipelineLayoutNumStaticSamplers(LLGLPipelineLayout pipelineLayout)
{
return LLGL_PTR(PipelineLayout, pipelineLayout)->GetNumStaticSamplers();
}
LLGL_C_EXPORT uint32_t llglGetPipelineLayoutNumUniforms(LLGLPipelineLayout pipelineLayout)
{
return LLGL_PTR(PipelineLayout, pipelineLayout)->GetNumUniforms();
}
// } /namespace LLGL
// ================================================================================
```
|
```java
package com.sina.util.dnscache.score.plugin;
import com.sina.util.dnscache.model.IpModel;
import com.sina.util.dnscache.score.IPlugIn;
import com.sina.util.dnscache.score.PlugInManager;
import java.util.ArrayList;
public class SuccessNumPlugin implements IPlugIn {
@Override
public void run(ArrayList<IpModel> list) {
//
float MAX_SUCCESSNUM = 0;
for (int i = 0; i < list.size(); i++) {
IpModel temp = list.get(i);
if (temp.success_num == null || temp.success_num.equals(""))
continue;
float successNum = Float.parseFloat(temp.success_num);
MAX_SUCCESSNUM = Math.max(MAX_SUCCESSNUM, successNum);
}
//
if (MAX_SUCCESSNUM == 0) {
return;
}
float bi = getWeight() / MAX_SUCCESSNUM;
//
for (int i = 0; i < list.size(); i++) {
IpModel temp = list.get(i);
if (temp.success_num == null || temp.success_num.equals("")){
continue;
}
float successNum = Float.parseFloat(temp.success_num);
temp.grade += (successNum * bi);
}
}
@Override
public float getWeight() {
return PlugInManager.SuccessNumPluginNum;
}
@Override
public boolean isActivated() {
return true;
}
}
```
|
Subero is a surname. Notable people with the surname include:
Alfonso Subero (born 1970), Spanish footballer
Carlos Subero (born 1972), Venezuelan baseball coach and player
Cristhian Subero (born 1991), Colombian footballer
|
The following is a list of episodes of the Inspector Gadget television series.
Series overview
Episodes
Pilot (1982)
Series 1 (1983)
Series 2 (1985–86)
See also
List of Inspector Gadget (2015 TV series) episodes
References
Lists of American children's animated television series episodes
Lists of American comedy television series episodes
Lists of Canadian children's animated television series episodes
Lists of French animated television series episodes
|
The Battle at Springmartin was a series of gun battles in Belfast, Northern Ireland on 13–14 May 1972, as part of The Troubles. It involved the British Army, the Provisional Irish Republican Army (IRA), and the Ulster Volunteer Force (UVF).
The violence began when a car bomb, planted by Ulster loyalists, exploded outside a crowded public house in the mainly Irish nationalist and Catholic district of Ballymurphy. UVF snipers then opened fire on the survivors from an abandoned high-rise flat. This began the worst fighting in Northern Ireland since the suspension of the Parliament of Northern Ireland and the imposition of direct rule from London. For the rest of the night and throughout the next day, local IRA units fought gun battles with both the UVF and British Army. Most of the fighting took place along the interface between the Catholic Ballymurphy and Ulster Protestant Springmartin housing estates, and the British Army base that sat between them.
Seven people were killed in the violence: five civilians (four Catholics, one Protestant), a British soldier and a member of the IRA Youth Section. Four of the dead were teenagers.
Bombing of Kelly's Bar
Shortly after 5:00 PM on Saturday 13 May 1972, a car bomb exploded without warning outside Kelly's Bar, at the junction of the Springfield Road and Whiterock Road. The pub was in a mainly Irish Catholic and nationalist area and most of its customers were from the area. At the time of the blast, the pub was crowded with men watching an association football match between England and West Germany on colour television. Sixty-three people were injured, eight of them seriously. John Moran (19), who had been working at Kelly's as a part-time barman, died of his injuries on 23 May.
At first, the British Army claimed that the blast had been an "accident" caused by a Provisional IRA bomb. The Secretary of State for Northern Ireland, William Whitelaw, told the House of Commons on 18 May that the blast was caused by a Provisional IRA bomb that exploded prematurely. However, locals suspected that the loyalist Ulster Defence Association (UDA) had planted the bomb. Republican sources said that IRA volunteers would not have risked storing such a large amount of explosives in such a crowded pub. It later emerged that the bomb had indeed been planted by loyalists.
A memorial plaque on the site of the former pub names three members of staff who lost their lives as a result of the bomb and the gun battles that followed. It reads: "...here on 13th May 1972 a no warning Loyalist car bomb exploded. As a result, 66 people were injured and three innocent members of staff of Kelly's Bar lost their lives. They were: Tommy McIlroy (died 13th May 1972), John Moran (died from his injuries 23rd May 1972), Gerard Clarke (died from his injuries 6th September 1989)."
The gun battles
Saturday 13 May
The night before the bombing, gunmen from the UVF West Belfast Brigade had taken up position along the second floor of an abandoned row of maisonettes (or flats) at the edge of the Protestant Springmartin estate. The flats overlooked the Catholic Ballymurphy estate. Rifles, mostly Second World War stock, were ferried to the area from dumps in the Shankill.
Not long after the explosion, the UVF unit opened fire on those gathered outside the wrecked pub, including those who had been caught in the blast. A British Army spokesman said that the shooting began at about 5:35 PM, when 30 high-velocity shots were heard. Social Democratic and Labour Party Member of Parliament Gerry Fitt said that shots had been fired from the Springmartin estate only minutes after the bombing. William Whitelaw, however, claimed that the shooting did not begin until 40 minutes after the blast. Ambulances braved the gunfire to reach the wounded, which included a number of children. Tommy McIlroy (50), a Catholic civilian who worked at Kelly's Bar, was shot in the chest and killed outright. He was the first to be killed in the violence.
Members of both the Provisional and Official wings of the IRA "joined forces to return the fire", using Thompson submachine guns, M1 carbines and a Bren light machine gun in an attempt to provide cover fire for the injured civilians . Neither the Royal Army or the RUC took any action against the Loyalist gunmen. British troops responded to the scene of bombing and exchanged gunfire with the IRA units. Corporal Alan Buckley (22) of the 1st Battalion, The Kings Regiment was fatally shot by the Provisionals on Whiterock Road. A platoon of soldiers then gave covering fire while a medical officer tried to help him. Another soldier was also wounded in the gunfight. Following this, 300 members of the Parachute Regiment were sent to back up the King's Own Scottish Borderers.
Over the next few hours there were 35 separate shooting incidents reported, making it the most violent night since the suspension of the Northern Ireland government and imposition of Direct Rule from London earlier that year. The IRA exchanged fire with both the British Army and with the UVF snipers on the Springmartin flats. Most of the IRA's fire was aimed at the Henry Taggart Army base—near the Springmartin flats—which was hit by over 400 rounds in the first 14 hours of the battle. Although most of the republican gunfire came from the Ballymurphy estate, British soldiers also reported shots being fired from the nearby mountain slopes. According to journalist Malachi O'Doherty, a source claimed that the British Army had also fired into Belfast City Cemetery between the Whiterock and Springfield roads.
Two more people were killed that night. The first was 15-year-old Michael Magee, a member of Fianna Éireann (the IRA youth wing), who was found shot in the chest at New Barnsley Crescent, near his home. He died shortly after he was brought to the Royal Victoria Hospital. Two men who took him there claimed they were beaten by British soldiers who had just heard of Corporal Buckley's death. A death notice said that Magee was killed by the British Army but the republican publication Belfast Graves claimed he had been accidentally shot. The other was a Catholic civilian, Robert McMullan (32), who was shot at New Barnsley Park, also near his home. Witnesses said there was heavy gunfire in the area at 8 and then "a single shot rang out and Robert McMullan fell to the ground". It is thought that he was shot by soldiers firing from Henry Taggart base.
On the first night of the battle, the Royal Ulster Constabulary (RUC) arrested two young UVF members, Trevor King and William Graham. They were found at a house in Blackmountain Pass trying to fix a rifle that had jammed. During a search of the house, the RUC found three Steyr rifles, ammunition and illuminating flares.
Sunday 14 May
The fighting between the IRA, UVF and British Army resumed the following day. According to the book UVF (1997), British soldiers were moved into the ground floor of the abandoned flats while the UVF snipers continued firing from the flats above them. The soldiers and UVF were both firing into Ballymurphy, and according to the book both were "initially unaware of each other". However, according to a UVF gunman involved in the battle, there was collusion between the UVF and British soldiers. He alleged that a British foot patrol caught a UVF unit hiding guns in a bin but ignored their cache with a wink when the UVF member said the guns were "rubbish". According to Jim Cusack and Henry McDonald, Jim Hanna – who later became UVF Chief of Staff – was one of the snipers operating from Springmartin during the battle. Jim Hanna told journalist Kevin Myers that, during the clashes, a British Army patrol helped Hanna and two other UVF members get into Corry's Timber Yard, which overlooked the Catholic Ballymurphy estate. When a British Army Major heard of the incident he ordered his men to withdraw, but they did not arrest the UVF members, who were allowed to hold their position. The IRA's Ballymurphy unit was returning fire at an equal rate and some 400 strike marks were later counted on the flats.
In the Springmartin estate, gunfire killed Protestant teenager John Pedlow (17) and wounded his friend. According to the book Lost Lives, they had been shot by soldiers. His friend said that they had been walking home from a shop when there was a burst of gunfire, which "came from near the Taggart Memorial Army post and seemed to be directed towards Black Mountain Parade". However, Malcolm Sutton's Index of Deaths from the Conflict in Ireland states that he was killed by the IRA. An inquest into Pedlow's death found that he had been hit by a .303 bullet, which was likely a ricochet. Pedlow was given a loyalist funeral, but police said there was nothing to link him with any "illegal organisation or acts".
UVF snipers continued to fire from the high-rise flats on the hill at Springmartin Road. About three hours after the shooting of Pedlow, a bullet fatally struck a 13-year-old Catholic girl, Martha Campbell, as she walked along Springhill Avenue. She was among a group of young girls and a witness said the firing must have been directed at himself and the girls, as nobody else was in the area at the time. Reliable loyalist sources say that the schoolgirl was shot by the UVF.
Shortly afterwards, the loyalist UDA used roadblocks and barricades to seal-off the Woodvale area into a "no-go" zone, controlled by the UDA's B Company, which was then commanded by former British soldier Davy Fogel.
See also
Chronology of Provisional Irish Republican Army actions (1970–1979)
Timeline of Ulster Volunteer Force actions
References
1972 in Northern Ireland
Conflicts in 1972
Car and truck bombings in Northern Ireland
Deaths by firearm in Northern Ireland
British Army in Operation Banner
Mass murder in 1972
Military actions and engagements during the Troubles (Northern Ireland)
Provisional Irish Republican Army actions
Ulster Volunteer Force actions
Urban warfare
The Troubles in Belfast
May 1972 events in the United Kingdom
1972 crimes in the United Kingdom
People killed by security forces during The Troubles (Northern Ireland)
|
```python
#
# This file is part of pyasn1-modules software.
#
#
# SNMPv2c message syntax
#
# ASN.1 source from:
# path_to_url
#
from pyasn1.type import namedtype
from pyasn1.type import namedval
from pyasn1.type import univ
class Message(univ.Sequence):
componentType = namedtype.NamedTypes(
namedtype.NamedType('version', univ.Integer(namedValues=namedval.NamedValues(('version-2c', 1)))),
namedtype.NamedType('community', univ.OctetString()),
namedtype.NamedType('data', univ.Any())
)
```
|
```css
Position elements with `position: sticky`
Difference between `display: none` and `visibility: hidden`
Controlling cellpadding and cellspacing in CSS
Inherit `box-sizing`
`direction`: `column-reverse`
```
|
Simon Aspelin and Julian Knowle were the defending champions, but lost in the second round to Igor Kunitsyn and Dmitry Tursunov.
Bob Bryan and Mike Bryan won in the final 7–6(7–5), 7–6(12–10), against Lukáš Dlouhý and Leander Paes.
Seeds
Draw
Finals
Top half
Section 1
Section 2
Bottom half
Section 3
Section 4
External links
Draw
2008 US Open – Men's draws and results at the International Tennis Federation
Men's Doubles
US Open (tennis) by year – Men's doubles
|
```chuck
/*++
version 3. Alternative licensing terms are available. Contact
info@minocacorp.com for details. See the LICENSE file at the root of this
project for complete licensing information.
Module Name:
Spawn Module
Abstract:
This directory builds the spawn module, which is used to launch other
processes in Chalk.
Author:
Evan Green 21-Jun-2017
Environment:
C
--*/
from menv import compiledSources, group, mconfig, staticLibrary;
from apps.ck.modules.build import chalkSharedModule;
function build() {
var buildOs = mconfig.build_os;
var buildSources;
var commonSources;
var lib;
var entries;
var objs;
var posixSources;
var win32Sources;
commonSources = [
"entry.c",
"spawn.c"
];
posixSources = ["uos.c"];
win32Sources = ["win32.c"];
//
// Create the static and dynamic versions of the module targeted at Minoca.
//
lib = {
"label": "spawn_static",
"output": "spawn",
"inputs": commonSources + posixSources
};
objs = compiledSources(lib);
entries = staticLibrary(lib);
lib = {
"label": "spawn_dynamic",
"output": "spawn",
"inputs": objs[0]
};
entries += chalkSharedModule(lib);
//
// Create the static and dynamic versions of the module for the build
// machine.
//
if (buildOs == "Windows") {
buildSources = commonSources + win32Sources;
} else {
buildSources = commonSources + posixSources;
}
lib = {
"label": "build_spawn_static",
"output": "spawn",
"inputs": buildSources,
"build": true,
"prefix": "build"
};
objs = compiledSources(lib);
entries += staticLibrary(lib);
lib = {
"label": "build_spawn_dynamic",
"output": "spawn",
"inputs": objs[0],
"build": true,
"prefix": "build"
};
entries += chalkSharedModule(lib);
entries += group("all", [":spawn_static", ":spawn_dynamic"]);
entries += group("build_all",
[":build_spawn_static", ":build_spawn_dynamic"]);
return entries;
}
```
|
```smalltalk
using System.Reflection;
using System.Net.Http.Headers;
using Boilerplate.Shared.Controllers;
namespace Boilerplate.Client.Core.Services.HttpMessageHandlers;
public class AuthDelegatingHandler(IAuthTokenProvider tokenProvider, IServiceProvider serviceProvider, IStorageService storageService, RetryDelegatingHandler handler)
: DelegatingHandler(handler)
{
protected override async Task<HttpResponseMessage> SendAsync(HttpRequestMessage request, CancellationToken cancellationToken)
{
if (request.Headers.Authorization is null && HasNoAuthHeaderPolicy(request) is false)
{
var access_token = await tokenProvider.GetAccessTokenAsync();
if (access_token is not null)
{
request.Headers.Authorization = new AuthenticationHeaderValue("Bearer", access_token);
}
}
try
{
return await base.SendAsync(request, cancellationToken);
}
catch (KnownException _) when (_ is ForbiddenException or UnauthorizedException)
{
// Let's update the access token by refreshing it when a refresh token is available.
// Following this procedure, the newly acquired access token may now include the necessary roles or claims.
if (tokenProvider.IsInitialized is false ||
request.RequestUri?.LocalPath?.Contains("api/Identity/Refresh", StringComparison.InvariantCultureIgnoreCase) is true /* To prevent refresh token loop */) throw;
var authManager = serviceProvider.GetRequiredService<AuthenticationManager>();
var refresh_token = await storageService.GetItem("refresh_token");
if (refresh_token is null) throw;
// In the AuthenticationStateProvider, the access_token is refreshed using the refresh_token (if available).
await authManager.RefreshToken();
var access_token = await tokenProvider.GetAccessTokenAsync();
if (string.IsNullOrEmpty(access_token)) throw;
request.Headers.Authorization = new AuthenticationHeaderValue("Bearer", access_token);
return await base.SendAsync(request, cancellationToken);
}
}
/// <summary>
/// <see cref="NoAuthorizeHeaderPolicyAttribute"/>
/// </summary>
private static bool HasNoAuthHeaderPolicy(HttpRequestMessage request)
{
if (request.Options.TryGetValue(new(RequestOptionNames.IControllerType), out Type? controllerType) is false)
return false;
var parameterTypes = ((Dictionary<string, Type>)request.Options.GetValueOrDefault(RequestOptionNames.ActionParametersInfo)!).Select(p => p.Value).ToArray();
var method = controllerType!.GetMethod((string)request.Options.GetValueOrDefault(RequestOptionNames.ActionName)!, parameterTypes)!;
return method.GetCustomAttribute<NoAuthorizeHeaderPolicyAttribute>() is not null;
}
}
```
|
```php
<?php
/*
*
* ____ _ _ __ __ _ __ __ ____
* | _ \ ___ ___| | _____| |_| \/ (_)_ __ ___ | \/ | _ \
* | |_) / _ \ / __| |/ / _ \ __| |\/| | | '_ \ / _ \_____| |\/| | |_) |
* | __/ (_) | (__| < __/ |_| | | | | | | | __/_____| | | | __/
* |_| \___/ \___|_|\_\___|\__|_| |_|_|_| |_|\___| |_| |_|_|
*
* This program is free software: you can redistribute it and/or modify
* (at your option) any later version.
*
* @author PocketMine Team
* @link path_to_url
*
*
*/
declare(strict_types=1);
namespace pocketmine\event\player;
use pocketmine\event\Cancellable;
use pocketmine\event\CancellableTrait;
use pocketmine\lang\Translatable;
use pocketmine\player\Player;
/**
* Called after the player has successfully authenticated, before it spawns. The player is on the loading screen when
* this is called.
* Cancelling this event will cause the player to be disconnected with the kick message set.
*/
class PlayerLoginEvent extends PlayerEvent implements Cancellable{
use CancellableTrait;
public function __construct(
Player $player,
protected Translatable|string $kickMessage
){
$this->player = $player;
}
public function setKickMessage(Translatable|string $kickMessage) : void{
$this->kickMessage = $kickMessage;
}
public function getKickMessage() : Translatable|string{
return $this->kickMessage;
}
}
```
|
Even Granås (born 1977) is a drummer and guitarist from Hell, Norway.
He is a member of the bands Sugarfoot and The Pink Moon, and has also been a member of The Moving Oos, New Violators, Sanderfinger, The International Tussler Society, Thrush, Ryanbanden and I Love Wynona.
References
1977 births
Norwegian drummers
Male drummers
Norwegian guitarists
Norwegian male guitarists
Living people
21st-century Norwegian guitarists
21st-century Norwegian drummers
21st-century Norwegian male musicians
|
Leopoldo Sabbatini (14 July 1861, Camerino, Marche, Italy – 1914, Milan, Italy) was an Italian lawyer, the first dean and president of Bocconi University, the first business school in Italy.
His parents were Eugenio Sabbatini and Silvia Piermarini. He started to study law in 1879 at the University of Pisa, graduating with a thesis on commercial law in 1883. He also married very young, in 1880. Soon after that, he was admitted as vice-secretary of the Commerce Chamber of Milano, where he was instrumental in achieving the first comprehensive survey and publication of statistics about commerce and industry in Milano. In his free time, Sabbatini collaborated with Antonio Maffi in the management of popular schools for adults of both sexes, which had been founded on 1875 by workers and artisans associations.
In the year 1897, Sabbatini was presented to Ferdinando Bocconi, a publisher who founded and owned a chain of big magazines, Alle città d'Italia. He wanted to pay homage to his son Luigi, who had been killed at the Battle of Adua, during the Italian-Ethiopian War in 1896, by establishing a school of commerce with his name. Bocconi's brother was a member of the Chamber of Commerce and introduced him to Sabbatini. Bocconi wanted a radical departure from the traditional Italian universities, which were too much theoretical and very little pragmatic in business education. Sabbatini took the bait and presented to Bocconi a school where economic sciences would be the key discipline, which would permeate the entire cycle of studies, in order to provide the future business leaders the tools to understand and to practice in the real world.
Sabbatini stated that the University's mission should be to "promote harmony between school and life".
The proposal was very well received by Bocconi and other Milanesi businessmen and within two years the Universitá Commerciale "Luigi Bocconi" was founded. Sabbatini became president and later dean of the University, where he worked indefatigably and with great management acumen until his premature death, in 1914.
Leopoldo Sabbatini was also an important player in the creation of a federation of all chambers of commerce of Italy, the Unioncamere, on June 7. 1901. He participated as a vice-president until 1912, when he resigned.
External links
Marzio A. Romani. Costruire le istituzioni: un'intervista immaginaria a Leopoldo Sabbatini Impresa & Stato n°43
1861 births
1914 deaths
19th-century Italian lawyers
Academic staff of Bocconi University
Heads of universities in Italy
Date of death missing
|
The Regular Grand Lodge of Macedonia is a Grand Lodge of Freemasonry operating in North Macedonia. It has three constituent lodges:
Lodge Saint Naum of Ohrid
Lodge Old Skopje
Lodge Justinian The Great
The Regular Grand Lodge of Macedonia is not recognised as a Regular Masonic jurisdiction by the United Grand Lodge of England or other regular jurisdictions. The regular body in North Macedonia is the older Grand Lodge of Macedonia.
External links
Freemasonry in North Macedonia
|
```c++
#include <memory>
#include <Parsers/ASTFunction.h>
#include <Parsers/ASTProjectionSelectQuery.h>
#include <Parsers/CommonParsers.h>
#include <Parsers/ExpressionElementParsers.h>
#include <Parsers/ExpressionListParsers.h>
#include <Parsers/IParserBase.h>
#include <Parsers/ParserProjectionSelectQuery.h>
namespace DB
{
bool ParserProjectionSelectQuery::parseImpl(Pos & pos, ASTPtr & node, Expected & expected)
{
auto select_query = std::make_shared<ASTProjectionSelectQuery>();
node = select_query;
ParserKeyword s_with(Keyword::WITH);
ParserKeyword s_select(Keyword::SELECT);
ParserKeyword s_group_by(Keyword::GROUP_BY);
ParserKeyword s_order_by(Keyword::ORDER_BY);
ParserNotEmptyExpressionList exp_list_for_with_clause(false);
ParserNotEmptyExpressionList exp_list_for_select_clause(true); /// Allows aliases without AS keyword.
ParserExpression order_expression_p;
ASTPtr with_expression_list;
ASTPtr select_expression_list;
ASTPtr group_expression_list;
ASTPtr order_expression;
/// WITH expr list
{
if (s_with.ignore(pos, expected))
{
if (!exp_list_for_with_clause.parse(pos, with_expression_list, expected))
return false;
}
}
/// SELECT [DISTINCT] [TOP N [WITH TIES]] expr list
{
if (!s_select.ignore(pos, expected))
return false;
if (!exp_list_for_select_clause.parse(pos, select_expression_list, expected))
return false;
}
// If group by is specified, AggregatingMergeTree engine is used, and the group by keys are implied to be order by keys
if (s_group_by.ignore(pos, expected))
{
if (!ParserList(std::make_unique<ParserExpression>(), std::make_unique<ParserToken>(TokenType::Comma))
.parse(pos, group_expression_list, expected))
return false;
}
// ORDER BY needs to be an ASTFunction so that we can use it as a sorting key
if (s_order_by.ignore(pos, expected))
{
ASTPtr expr_list;
if (!ParserList(std::make_unique<ParserExpression>(), std::make_unique<ParserToken>(TokenType::Comma)).parse(pos, expr_list, expected))
return false;
if (expr_list->children.size() == 1)
{
order_expression = expr_list->children.front();
}
else
{
auto function_node = std::make_shared<ASTFunction>();
function_node->name = "tuple";
function_node->arguments = expr_list;
function_node->children.push_back(expr_list);
order_expression = function_node;
}
}
select_query->setExpression(ASTProjectionSelectQuery::Expression::WITH, std::move(with_expression_list));
select_query->setExpression(ASTProjectionSelectQuery::Expression::SELECT, std::move(select_expression_list));
select_query->setExpression(ASTProjectionSelectQuery::Expression::GROUP_BY, std::move(group_expression_list));
select_query->setExpression(ASTProjectionSelectQuery::Expression::ORDER_BY, std::move(order_expression));
return true;
}
}
```
|
```c++
//
// 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 NVIDIA CORPORATION 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 ``AS IS'' AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
// OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// This file was generated by NvParameterized/scripts/GenParameterized.pl
#include "ImpactObjectEvent_0p2.h"
#include <string.h>
#include <stdlib.h>
using namespace NvParameterized;
namespace nvidia
{
namespace parameterized
{
using namespace ImpactObjectEvent_0p2NS;
const char* const ImpactObjectEvent_0p2Factory::vptr =
NvParameterized::getVptr<ImpactObjectEvent_0p2, ImpactObjectEvent_0p2::ClassAlignment>();
const uint32_t NumParamDefs = 21;
static NvParameterized::DefinitionImpl* ParamDefTable; // now allocated in buildTree [NumParamDefs];
static const size_t ParamLookupChildrenTable[] =
{
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
};
#define TENUM(type) nvidia::##type
#define CHILDREN(index) &ParamLookupChildrenTable[index]
static const NvParameterized::ParamLookupNode ParamLookupTable[NumParamDefs] =
{
{ TYPE_STRUCT, false, 0, CHILDREN(0), 13 },
{ TYPE_STRING, false, (size_t)(&((ParametersStruct*)0)->eventSetName), NULL, 0 }, // eventSetName
{ TYPE_REF, false, (size_t)(&((ParametersStruct*)0)->iofxAssetName), NULL, 0 }, // iofxAssetName
{ TYPE_REF, false, (size_t)(&((ParametersStruct*)0)->iosAssetName), NULL, 0 }, // iosAssetName
{ TYPE_F32, false, (size_t)(&((ParametersStruct*)0)->angleLow), NULL, 0 }, // angleLow
{ TYPE_F32, false, (size_t)(&((ParametersStruct*)0)->angleHigh), NULL, 0 }, // angleHigh
{ TYPE_F32, false, (size_t)(&((ParametersStruct*)0)->speedLow), NULL, 0 }, // speedLow
{ TYPE_F32, false, (size_t)(&((ParametersStruct*)0)->speedHigh), NULL, 0 }, // speedHigh
{ TYPE_F32, false, (size_t)(&((ParametersStruct*)0)->lifeLow), NULL, 0 }, // lifeLow
{ TYPE_F32, false, (size_t)(&((ParametersStruct*)0)->lifeHigh), NULL, 0 }, // lifeHigh
{ TYPE_F32, false, (size_t)(&((ParametersStruct*)0)->delay), NULL, 0 }, // delay
{ TYPE_U32, false, (size_t)(&((ParametersStruct*)0)->particleSpawnCount), NULL, 0 }, // particleSpawnCount
{ TYPE_ENUM, false, (size_t)(&((ParametersStruct*)0)->impactAxis), NULL, 0 }, // impactAxis
{ TYPE_STRUCT, false, (size_t)(&((ParametersStruct*)0)->lodParamDesc), CHILDREN(13), 7 }, // lodParamDesc
{ TYPE_U32, false, (size_t)(&((emitterLodParamDesc_Type*)0)->version), NULL, 0 }, // lodParamDesc.version
{ TYPE_F32, false, (size_t)(&((emitterLodParamDesc_Type*)0)->maxDistance), NULL, 0 }, // lodParamDesc.maxDistance
{ TYPE_F32, false, (size_t)(&((emitterLodParamDesc_Type*)0)->distanceWeight), NULL, 0 }, // lodParamDesc.distanceWeight
{ TYPE_F32, false, (size_t)(&((emitterLodParamDesc_Type*)0)->speedWeight), NULL, 0 }, // lodParamDesc.speedWeight
{ TYPE_F32, false, (size_t)(&((emitterLodParamDesc_Type*)0)->lifeWeight), NULL, 0 }, // lodParamDesc.lifeWeight
{ TYPE_F32, false, (size_t)(&((emitterLodParamDesc_Type*)0)->separationWeight), NULL, 0 }, // lodParamDesc.separationWeight
{ TYPE_F32, false, (size_t)(&((emitterLodParamDesc_Type*)0)->bias), NULL, 0 }, // lodParamDesc.bias
};
bool ImpactObjectEvent_0p2::mBuiltFlag = false;
NvParameterized::MutexType ImpactObjectEvent_0p2::mBuiltFlagMutex;
ImpactObjectEvent_0p2::ImpactObjectEvent_0p2(NvParameterized::Traits* traits, void* buf, int32_t* refCount) :
NvParameters(traits, buf, refCount)
{
//mParameterizedTraits->registerFactory(className(), &ImpactObjectEvent_0p2FactoryInst);
if (!buf) //Do not init data if it is inplace-deserialized
{
initDynamicArrays();
initStrings();
initReferences();
initDefaults();
}
}
ImpactObjectEvent_0p2::~ImpactObjectEvent_0p2()
{
freeStrings();
freeReferences();
freeDynamicArrays();
}
void ImpactObjectEvent_0p2::destroy()
{
// We cache these fields here to avoid overwrite in destructor
bool doDeallocateSelf = mDoDeallocateSelf;
NvParameterized::Traits* traits = mParameterizedTraits;
int32_t* refCount = mRefCount;
void* buf = mBuffer;
this->~ImpactObjectEvent_0p2();
NvParameters::destroy(this, traits, doDeallocateSelf, refCount, buf);
}
const NvParameterized::DefinitionImpl* ImpactObjectEvent_0p2::getParameterDefinitionTree(void)
{
if (!mBuiltFlag) // Double-checked lock
{
NvParameterized::MutexType::ScopedLock lock(mBuiltFlagMutex);
if (!mBuiltFlag)
{
buildTree();
}
}
return(&ParamDefTable[0]);
}
const NvParameterized::DefinitionImpl* ImpactObjectEvent_0p2::getParameterDefinitionTree(void) const
{
ImpactObjectEvent_0p2* tmpParam = const_cast<ImpactObjectEvent_0p2*>(this);
if (!mBuiltFlag) // Double-checked lock
{
NvParameterized::MutexType::ScopedLock lock(mBuiltFlagMutex);
if (!mBuiltFlag)
{
tmpParam->buildTree();
}
}
return(&ParamDefTable[0]);
}
NvParameterized::ErrorType ImpactObjectEvent_0p2::getParameterHandle(const char* long_name, Handle& handle) const
{
ErrorType Ret = NvParameters::getParameterHandle(long_name, handle);
if (Ret != ERROR_NONE)
{
return(Ret);
}
size_t offset;
void* ptr;
getVarPtr(handle, ptr, offset);
if (ptr == NULL)
{
return(ERROR_INDEX_OUT_OF_RANGE);
}
return(ERROR_NONE);
}
NvParameterized::ErrorType ImpactObjectEvent_0p2::getParameterHandle(const char* long_name, Handle& handle)
{
ErrorType Ret = NvParameters::getParameterHandle(long_name, handle);
if (Ret != ERROR_NONE)
{
return(Ret);
}
size_t offset;
void* ptr;
getVarPtr(handle, ptr, offset);
if (ptr == NULL)
{
return(ERROR_INDEX_OUT_OF_RANGE);
}
return(ERROR_NONE);
}
void ImpactObjectEvent_0p2::getVarPtr(const Handle& handle, void*& ptr, size_t& offset) const
{
ptr = getVarPtrHelper(&ParamLookupTable[0], const_cast<ImpactObjectEvent_0p2::ParametersStruct*>(¶meters()), handle, offset);
}
/* Dynamic Handle Indices */
void ImpactObjectEvent_0p2::freeParameterDefinitionTable(NvParameterized::Traits* traits)
{
if (!traits)
{
return;
}
if (!mBuiltFlag) // Double-checked lock
{
return;
}
NvParameterized::MutexType::ScopedLock lock(mBuiltFlagMutex);
if (!mBuiltFlag)
{
return;
}
for (uint32_t i = 0; i < NumParamDefs; ++i)
{
ParamDefTable[i].~DefinitionImpl();
}
traits->free(ParamDefTable);
mBuiltFlag = false;
}
#define PDEF_PTR(index) (&ParamDefTable[index])
void ImpactObjectEvent_0p2::buildTree(void)
{
uint32_t allocSize = sizeof(NvParameterized::DefinitionImpl) * NumParamDefs;
ParamDefTable = (NvParameterized::DefinitionImpl*)(mParameterizedTraits->alloc(allocSize));
memset(ParamDefTable, 0, allocSize);
for (uint32_t i = 0; i < NumParamDefs; ++i)
{
NV_PARAM_PLACEMENT_NEW(ParamDefTable + i, NvParameterized::DefinitionImpl)(*mParameterizedTraits);
}
// Initialize DefinitionImpl node: nodeIndex=0, longName=""
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[0];
ParamDef->init("", TYPE_STRUCT, "STRUCT", true);
}
// Initialize DefinitionImpl node: nodeIndex=1, longName="eventSetName"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[1];
ParamDef->init("eventSetName", TYPE_STRING, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
#else
static HintImpl HintTable[1];
static Hint* HintPtrTable[1] = { &HintTable[0], };
HintTable[0].init("shortDescription", "The name of the event set (you can put multiple events in an event set)", true);
ParamDefTable[1].setHints((const NvParameterized::Hint**)HintPtrTable, 1);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
}
// Initialize DefinitionImpl node: nodeIndex=2, longName="iofxAssetName"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[2];
ParamDef->init("iofxAssetName", TYPE_REF, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
#else
static HintImpl HintTable[1];
static Hint* HintPtrTable[1] = { &HintTable[0], };
HintTable[0].init("shortDescription", "The name of the instanced object effects asset that will render the particles", true);
ParamDefTable[2].setHints((const NvParameterized::Hint**)HintPtrTable, 1);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
static const char* const RefVariantVals[] = { "IOFX" };
ParamDefTable[2].setRefVariantVals((const char**)RefVariantVals, 1);
}
// Initialize DefinitionImpl node: nodeIndex=3, longName="iosAssetName"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[3];
ParamDef->init("iosAssetName", TYPE_REF, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
#else
static HintImpl HintTable[1];
static Hint* HintPtrTable[1] = { &HintTable[0], };
HintTable[0].init("shortDescription", "The asset name of the particle system that will simulate the particles", true);
ParamDefTable[3].setHints((const NvParameterized::Hint**)HintPtrTable, 1);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
static const char* const RefVariantVals[] = { "BasicIosAsset", "ParticleIosAsset" };
ParamDefTable[3].setRefVariantVals((const char**)RefVariantVals, 2);
}
// Initialize DefinitionImpl node: nodeIndex=4, longName="angleLow"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[4];
ParamDef->init("angleLow", TYPE_F32, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
#else
static HintImpl HintTable[1];
static Hint* HintPtrTable[1] = { &HintTable[0], };
HintTable[0].init("shortDescription", "The particle emission angle range in degrees", true);
ParamDefTable[4].setHints((const NvParameterized::Hint**)HintPtrTable, 1);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
}
// Initialize DefinitionImpl node: nodeIndex=5, longName="angleHigh"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[5];
ParamDef->init("angleHigh", TYPE_F32, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
#else
static HintImpl HintTable[1];
static Hint* HintPtrTable[1] = { &HintTable[0], };
HintTable[0].init("shortDescription", "The particle emission angle range in degrees", true);
ParamDefTable[5].setHints((const NvParameterized::Hint**)HintPtrTable, 1);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
}
// Initialize DefinitionImpl node: nodeIndex=6, longName="speedLow"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[6];
ParamDef->init("speedLow", TYPE_F32, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
#else
static HintImpl HintTable[1];
static Hint* HintPtrTable[1] = { &HintTable[0], };
HintTable[0].init("shortDescription", "The particle emission speed range", true);
ParamDefTable[6].setHints((const NvParameterized::Hint**)HintPtrTable, 1);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
}
// Initialize DefinitionImpl node: nodeIndex=7, longName="speedHigh"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[7];
ParamDef->init("speedHigh", TYPE_F32, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
#else
static HintImpl HintTable[1];
static Hint* HintPtrTable[1] = { &HintTable[0], };
HintTable[0].init("shortDescription", "The particle emission speed range", true);
ParamDefTable[7].setHints((const NvParameterized::Hint**)HintPtrTable, 1);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
}
// Initialize DefinitionImpl node: nodeIndex=8, longName="lifeLow"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[8];
ParamDef->init("lifeLow", TYPE_F32, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
#else
static HintImpl HintTable[1];
static Hint* HintPtrTable[1] = { &HintTable[0], };
HintTable[0].init("shortDescription", "The particle life range in seconds", true);
ParamDefTable[8].setHints((const NvParameterized::Hint**)HintPtrTable, 1);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
}
// Initialize DefinitionImpl node: nodeIndex=9, longName="lifeHigh"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[9];
ParamDef->init("lifeHigh", TYPE_F32, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
#else
static HintImpl HintTable[1];
static Hint* HintPtrTable[1] = { &HintTable[0], };
HintTable[0].init("shortDescription", "The particle life range in seconds", true);
ParamDefTable[9].setHints((const NvParameterized::Hint**)HintPtrTable, 1);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
}
// Initialize DefinitionImpl node: nodeIndex=10, longName="delay"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[10];
ParamDef->init("delay", TYPE_F32, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
static HintImpl HintTable[2];
static Hint* HintPtrTable[2] = { &HintTable[0], &HintTable[1], };
HintTable[0].init("defaultValue", uint64_t(0), true);
HintTable[1].init("min", uint64_t(0), true);
ParamDefTable[10].setHints((const NvParameterized::Hint**)HintPtrTable, 2);
#else
static HintImpl HintTable[3];
static Hint* HintPtrTable[3] = { &HintTable[0], &HintTable[1], &HintTable[2], };
HintTable[0].init("defaultValue", uint64_t(0), true);
HintTable[1].init("min", uint64_t(0), true);
HintTable[2].init("shortDescription", "The delay (in seconds) after impact to wait before triggering", true);
ParamDefTable[10].setHints((const NvParameterized::Hint**)HintPtrTable, 3);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
}
// Initialize DefinitionImpl node: nodeIndex=11, longName="particleSpawnCount"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[11];
ParamDef->init("particleSpawnCount", TYPE_U32, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
static HintImpl HintTable[2];
static Hint* HintPtrTable[2] = { &HintTable[0], &HintTable[1], };
HintTable[0].init("defaultValue", uint64_t(10), true);
HintTable[1].init("min", uint64_t(0), true);
ParamDefTable[11].setHints((const NvParameterized::Hint**)HintPtrTable, 2);
#else
static HintImpl HintTable[3];
static Hint* HintPtrTable[3] = { &HintTable[0], &HintTable[1], &HintTable[2], };
HintTable[0].init("defaultValue", uint64_t(10), true);
HintTable[1].init("min", uint64_t(0), true);
HintTable[2].init("shortDescription", "The number of particles emitted per impact", true);
ParamDefTable[11].setHints((const NvParameterized::Hint**)HintPtrTable, 3);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
}
// Initialize DefinitionImpl node: nodeIndex=12, longName="impactAxis"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[12];
ParamDef->init("impactAxis", TYPE_ENUM, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
static HintImpl HintTable[1];
static Hint* HintPtrTable[1] = { &HintTable[0], };
HintTable[0].init("defaultValue", "reflection", true);
ParamDefTable[12].setHints((const NvParameterized::Hint**)HintPtrTable, 1);
#else
static HintImpl HintTable[2];
static Hint* HintPtrTable[2] = { &HintTable[0], &HintTable[1], };
HintTable[0].init("defaultValue", "reflection", true);
HintTable[1].init("shortDescription", "The method used to emit particles at the point of impact", true);
ParamDefTable[12].setHints((const NvParameterized::Hint**)HintPtrTable, 2);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
static const char* const EnumVals[] = { "incident", "normal", "reflection" };
ParamDefTable[12].setEnumVals((const char**)EnumVals, 3);
}
// Initialize DefinitionImpl node: nodeIndex=13, longName="lodParamDesc"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[13];
ParamDef->init("lodParamDesc", TYPE_STRUCT, "emitterLodParamDesc", true);
}
// Initialize DefinitionImpl node: nodeIndex=14, longName="lodParamDesc.version"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[14];
ParamDef->init("version", TYPE_U32, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
static HintImpl HintTable[1];
static Hint* HintPtrTable[1] = { &HintTable[0], };
HintTable[0].init("defaultValue", uint64_t(0), true);
ParamDefTable[14].setHints((const NvParameterized::Hint**)HintPtrTable, 1);
#else
static HintImpl HintTable[2];
static Hint* HintPtrTable[2] = { &HintTable[0], &HintTable[1], };
HintTable[0].init("defaultValue", uint64_t(0), true);
HintTable[1].init("shortDescription", "Helpful documentation goes here", true);
ParamDefTable[14].setHints((const NvParameterized::Hint**)HintPtrTable, 2);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
}
// Initialize DefinitionImpl node: nodeIndex=15, longName="lodParamDesc.maxDistance"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[15];
ParamDef->init("maxDistance", TYPE_F32, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
static HintImpl HintTable[2];
static Hint* HintPtrTable[2] = { &HintTable[0], &HintTable[1], };
HintTable[0].init("defaultValue", uint64_t(0), true);
HintTable[1].init("min", uint64_t(0), true);
ParamDefTable[15].setHints((const NvParameterized::Hint**)HintPtrTable, 2);
#else
static HintImpl HintTable[3];
static Hint* HintPtrTable[3] = { &HintTable[0], &HintTable[1], &HintTable[2], };
HintTable[0].init("defaultValue", uint64_t(0), true);
HintTable[1].init("min", uint64_t(0), true);
HintTable[2].init("shortDescription", "Objects greater than this distance from the player will be culled more aggressively", true);
ParamDefTable[15].setHints((const NvParameterized::Hint**)HintPtrTable, 3);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
}
// Initialize DefinitionImpl node: nodeIndex=16, longName="lodParamDesc.distanceWeight"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[16];
ParamDef->init("distanceWeight", TYPE_F32, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
static HintImpl HintTable[3];
static Hint* HintPtrTable[3] = { &HintTable[0], &HintTable[1], &HintTable[2], };
HintTable[0].init("defaultValue", uint64_t(1), true);
HintTable[1].init("max", uint64_t(1), true);
HintTable[2].init("min", uint64_t(0), true);
ParamDefTable[16].setHints((const NvParameterized::Hint**)HintPtrTable, 3);
#else
static HintImpl HintTable[4];
static Hint* HintPtrTable[4] = { &HintTable[0], &HintTable[1], &HintTable[2], &HintTable[3], };
HintTable[0].init("defaultValue", uint64_t(1), true);
HintTable[1].init("max", uint64_t(1), true);
HintTable[2].init("min", uint64_t(0), true);
HintTable[3].init("shortDescription", "Weight given to distance parameter in LOD function", true);
ParamDefTable[16].setHints((const NvParameterized::Hint**)HintPtrTable, 4);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
}
// Initialize DefinitionImpl node: nodeIndex=17, longName="lodParamDesc.speedWeight"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[17];
ParamDef->init("speedWeight", TYPE_F32, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
static HintImpl HintTable[3];
static Hint* HintPtrTable[3] = { &HintTable[0], &HintTable[1], &HintTable[2], };
HintTable[0].init("defaultValue", uint64_t(0), true);
HintTable[1].init("max", uint64_t(1), true);
HintTable[2].init("min", uint64_t(0), true);
ParamDefTable[17].setHints((const NvParameterized::Hint**)HintPtrTable, 3);
#else
static HintImpl HintTable[4];
static Hint* HintPtrTable[4] = { &HintTable[0], &HintTable[1], &HintTable[2], &HintTable[3], };
HintTable[0].init("defaultValue", uint64_t(0), true);
HintTable[1].init("max", uint64_t(1), true);
HintTable[2].init("min", uint64_t(0), true);
HintTable[3].init("shortDescription", "Weight given to velocity parameter in LOD function", true);
ParamDefTable[17].setHints((const NvParameterized::Hint**)HintPtrTable, 4);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
}
// Initialize DefinitionImpl node: nodeIndex=18, longName="lodParamDesc.lifeWeight"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[18];
ParamDef->init("lifeWeight", TYPE_F32, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
static HintImpl HintTable[3];
static Hint* HintPtrTable[3] = { &HintTable[0], &HintTable[1], &HintTable[2], };
HintTable[0].init("defaultValue", uint64_t(0), true);
HintTable[1].init("max", uint64_t(1), true);
HintTable[2].init("min", uint64_t(0), true);
ParamDefTable[18].setHints((const NvParameterized::Hint**)HintPtrTable, 3);
#else
static HintImpl HintTable[4];
static Hint* HintPtrTable[4] = { &HintTable[0], &HintTable[1], &HintTable[2], &HintTable[3], };
HintTable[0].init("defaultValue", uint64_t(0), true);
HintTable[1].init("max", uint64_t(1), true);
HintTable[2].init("min", uint64_t(0), true);
HintTable[3].init("shortDescription", "Weight given to life remain parameter in LOD function", true);
ParamDefTable[18].setHints((const NvParameterized::Hint**)HintPtrTable, 4);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
}
// Initialize DefinitionImpl node: nodeIndex=19, longName="lodParamDesc.separationWeight"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[19];
ParamDef->init("separationWeight", TYPE_F32, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
static HintImpl HintTable[3];
static Hint* HintPtrTable[3] = { &HintTable[0], &HintTable[1], &HintTable[2], };
HintTable[0].init("defaultValue", uint64_t(0), true);
HintTable[1].init("max", uint64_t(1), true);
HintTable[2].init("min", uint64_t(0), true);
ParamDefTable[19].setHints((const NvParameterized::Hint**)HintPtrTable, 3);
#else
static HintImpl HintTable[4];
static Hint* HintPtrTable[4] = { &HintTable[0], &HintTable[1], &HintTable[2], &HintTable[3], };
HintTable[0].init("defaultValue", uint64_t(0), true);
HintTable[1].init("max", uint64_t(1), true);
HintTable[2].init("min", uint64_t(0), true);
HintTable[3].init("shortDescription", "Weight given to separation parameter in LOD function", true);
ParamDefTable[19].setHints((const NvParameterized::Hint**)HintPtrTable, 4);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
}
// Initialize DefinitionImpl node: nodeIndex=20, longName="lodParamDesc.bias"
{
NvParameterized::DefinitionImpl* ParamDef = &ParamDefTable[20];
ParamDef->init("bias", TYPE_F32, NULL, true);
#ifdef NV_PARAMETERIZED_HIDE_DESCRIPTIONS
static HintImpl HintTable[2];
static Hint* HintPtrTable[2] = { &HintTable[0], &HintTable[1], };
HintTable[0].init("defaultValue", uint64_t(1), true);
HintTable[1].init("min", uint64_t(0), true);
ParamDefTable[20].setHints((const NvParameterized::Hint**)HintPtrTable, 2);
#else
static HintImpl HintTable[3];
static Hint* HintPtrTable[3] = { &HintTable[0], &HintTable[1], &HintTable[2], };
HintTable[0].init("defaultValue", uint64_t(1), true);
HintTable[1].init("min", uint64_t(0), true);
HintTable[2].init("shortDescription", "Bias given to objects spawned by this emitter, relative to other emitters in the same IOS", true);
ParamDefTable[20].setHints((const NvParameterized::Hint**)HintPtrTable, 3);
#endif /* NV_PARAMETERIZED_HIDE_DESCRIPTIONS */
}
// SetChildren for: nodeIndex=0, longName=""
{
static Definition* Children[13];
Children[0] = PDEF_PTR(1);
Children[1] = PDEF_PTR(2);
Children[2] = PDEF_PTR(3);
Children[3] = PDEF_PTR(4);
Children[4] = PDEF_PTR(5);
Children[5] = PDEF_PTR(6);
Children[6] = PDEF_PTR(7);
Children[7] = PDEF_PTR(8);
Children[8] = PDEF_PTR(9);
Children[9] = PDEF_PTR(10);
Children[10] = PDEF_PTR(11);
Children[11] = PDEF_PTR(12);
Children[12] = PDEF_PTR(13);
ParamDefTable[0].setChildren(Children, 13);
}
// SetChildren for: nodeIndex=13, longName="lodParamDesc"
{
static Definition* Children[7];
Children[0] = PDEF_PTR(14);
Children[1] = PDEF_PTR(15);
Children[2] = PDEF_PTR(16);
Children[3] = PDEF_PTR(17);
Children[4] = PDEF_PTR(18);
Children[5] = PDEF_PTR(19);
Children[6] = PDEF_PTR(20);
ParamDefTable[13].setChildren(Children, 7);
}
mBuiltFlag = true;
}
void ImpactObjectEvent_0p2::initStrings(void)
{
eventSetName.isAllocated = true;
eventSetName.buf = NULL;
}
void ImpactObjectEvent_0p2::initDynamicArrays(void)
{
}
void ImpactObjectEvent_0p2::initDefaults(void)
{
freeStrings();
freeReferences();
freeDynamicArrays();
angleLow = float(0);
angleHigh = float(90);
speedLow = float(0);
speedHigh = float(1);
lifeLow = float(5);
lifeHigh = float(10);
delay = float(0);
particleSpawnCount = uint32_t(10);
impactAxis = (const char*)"reflection";
lodParamDesc.version = uint32_t(0);
lodParamDesc.maxDistance = float(0);
lodParamDesc.distanceWeight = float(1);
lodParamDesc.speedWeight = float(0);
lodParamDesc.lifeWeight = float(0);
lodParamDesc.separationWeight = float(0);
lodParamDesc.bias = float(1);
initDynamicArrays();
initStrings();
initReferences();
}
void ImpactObjectEvent_0p2::initReferences(void)
{
iofxAssetName = NULL;
iosAssetName = NULL;
}
void ImpactObjectEvent_0p2::freeDynamicArrays(void)
{
}
void ImpactObjectEvent_0p2::freeStrings(void)
{
if (eventSetName.isAllocated && eventSetName.buf)
{
mParameterizedTraits->strfree((char*)eventSetName.buf);
}
}
void ImpactObjectEvent_0p2::freeReferences(void)
{
if (iofxAssetName)
{
iofxAssetName->destroy();
}
if (iosAssetName)
{
iosAssetName->destroy();
}
}
} // namespace parameterized
} // namespace nvidia
```
|
San Antonio is a department of the province of Río Negro (Argentina).
References
Departments of Río Negro Province
|
Laurel Collins (born May 7, 1984) is a Canadian politician who was elected to represent the riding of Victoria in the House of Commons of Canada in the 2019 Canadian federal election. Prior to her election in the House of Commons, she was a city councillor for Victoria City Council. She is the NDP Critic for the Environment and Climate Change and the NDP Deputy Caucus Chair.
Background
Collins was born in Kispiox in northern British Columbia, one of three children. Her parents, school teachers, separated when she was a baby, and she moved around the province, attending elementary school on Salt Spring Island, Alert Bay, and in Port Hardy. She went to high school in Sussex, New Brunswick and did her undergraduate degree at the University of Kings College and Dalhousie University in Halifax, Nova Scotia. She did a master's degree in Human Security and Peacebuilding at Royal Roads University.
Career
Collins worked at Victoria Women in Need, running programs for women who have experienced abuse. She co-founded and co-chaired Divest Victoria, a non-profit organization that advocates for cities to take their money out of fossil fuels and put them into environmentally responsible investments. While researching climate migration and displacement, she worked with the United Nations High Commissioner for Refugees (UNHCR) in Northern Uganda helping to create durable solutions for internally displaced persons in the aftermath of deadly conflict.
From 2014 to 2019, Collins taught courses at the University of Victoria, including courses in Social Inequality, Social Justice Studies, Political Sociology, and the Sociology of Genders. In 2015, she co-published a book, Women, Adult Education, and Leadership in Canada. And, in 2017, she won a Victoria Community Leadership Award in Sustainability and Community Building.
In October 2018, Collins was elected as a city councillor for Victoria City Council with the electoral organization Together Victoria. She would resign from this position a year later, after her election to the House of Commons in late October 2019. The byelection following her departure was delayed due to the coronavirus pandemic until December 2020, where it eventually resulted in the election of Stephen Andrew and the defeat of Together Victoria's candidate Stephanie Hardman.
Collins was re-elected in the 2021 federal election.
She is the NDP Critic for the Environment and Climate Change and the Deputy Critic for Families, Children, and Social Development.
Electoral record
References
External links
Living people
New Democratic Party MPs
Members of the House of Commons of Canada from British Columbia
Victoria, British Columbia city councillors
Year of birth uncertain
Women members of the House of Commons of Canada
1984 births
|
The term homolysis generally means breakdown (lysis) to equal pieces (homo = same). There are separate meanings for the word in chemistry and biology:
Homolysis (biology), the fact that the dividing cell gives two equal-size daughter cells
Homolysis (chemistry), a chemical bond dissociation of a neutral molecule generating two free radicals
See also
Heterolysis (disambiguation)
Science disambiguation pages
|
```javascript
/* ========================================================================
* Bootstrap: collapse.js v3.3.7
* path_to_url#collapse
* ========================================================================
* ======================================================================== */
/* jshint latedef: false */
+function ($) {
'use strict';
// COLLAPSE PUBLIC CLASS DEFINITION
// ================================
var Collapse = function (element, options) {
this.$element = $(element)
this.options = $.extend({}, Collapse.DEFAULTS, options)
this.$trigger = $('[data-toggle="collapse"][href="#' + element.id + '"],' +
'[data-toggle="collapse"][data-target="#' + element.id + '"]')
this.transitioning = null
if (this.options.parent) {
this.$parent = this.getParent()
} else {
this.addAriaAndCollapsedClass(this.$element, this.$trigger)
}
if (this.options.toggle) this.toggle()
}
Collapse.VERSION = '3.3.7'
Collapse.TRANSITION_DURATION = 350
Collapse.DEFAULTS = {
toggle: true
}
Collapse.prototype.dimension = function () {
var hasWidth = this.$element.hasClass('width')
return hasWidth ? 'width' : 'height'
}
Collapse.prototype.show = function () {
if (this.transitioning || this.$element.hasClass('in')) return
var activesData
var actives = this.$parent && this.$parent.children('.panel').children('.in, .collapsing')
if (actives && actives.length) {
activesData = actives.data('bs.collapse')
if (activesData && activesData.transitioning) return
}
var startEvent = $.Event('show.bs.collapse')
this.$element.trigger(startEvent)
if (startEvent.isDefaultPrevented()) return
if (actives && actives.length) {
Plugin.call(actives, 'hide')
activesData || actives.data('bs.collapse', null)
}
var dimension = this.dimension()
this.$element
.removeClass('collapse')
.addClass('collapsing')[dimension](0)
.attr('aria-expanded', true)
this.$trigger
.removeClass('collapsed')
.attr('aria-expanded', true)
this.transitioning = 1
var complete = function () {
this.$element
.removeClass('collapsing')
.addClass('collapse in')[dimension]('')
this.transitioning = 0
this.$element
.trigger('shown.bs.collapse')
}
if (!$.support.transition) return complete.call(this)
var scrollSize = $.camelCase(['scroll', dimension].join('-'))
this.$element
.one('bsTransitionEnd', $.proxy(complete, this))
.emulateTransitionEnd(Collapse.TRANSITION_DURATION)[dimension](this.$element[0][scrollSize])
}
Collapse.prototype.hide = function () {
if (this.transitioning || !this.$element.hasClass('in')) return
var startEvent = $.Event('hide.bs.collapse')
this.$element.trigger(startEvent)
if (startEvent.isDefaultPrevented()) return
var dimension = this.dimension()
this.$element[dimension](this.$element[dimension]())[0].offsetHeight
this.$element
.addClass('collapsing')
.removeClass('collapse in')
.attr('aria-expanded', false)
this.$trigger
.addClass('collapsed')
.attr('aria-expanded', false)
this.transitioning = 1
var complete = function () {
this.transitioning = 0
this.$element
.removeClass('collapsing')
.addClass('collapse')
.trigger('hidden.bs.collapse')
}
if (!$.support.transition) return complete.call(this)
this.$element
[dimension](0)
.one('bsTransitionEnd', $.proxy(complete, this))
.emulateTransitionEnd(Collapse.TRANSITION_DURATION)
}
Collapse.prototype.toggle = function () {
this[this.$element.hasClass('in') ? 'hide' : 'show']()
}
Collapse.prototype.getParent = function () {
return $(this.options.parent)
.find('[data-toggle="collapse"][data-parent="' + this.options.parent + '"]')
.each($.proxy(function (i, element) {
var $element = $(element)
this.addAriaAndCollapsedClass(getTargetFromTrigger($element), $element)
}, this))
.end()
}
Collapse.prototype.addAriaAndCollapsedClass = function ($element, $trigger) {
var isOpen = $element.hasClass('in')
$element.attr('aria-expanded', isOpen)
$trigger
.toggleClass('collapsed', !isOpen)
.attr('aria-expanded', isOpen)
}
function getTargetFromTrigger($trigger) {
var href
var target = $trigger.attr('data-target')
|| (href = $trigger.attr('href')) && href.replace(/.*(?=#[^\s]+$)/, '') // strip for ie7
return $(target)
}
// COLLAPSE PLUGIN DEFINITION
// ==========================
function Plugin(option) {
return this.each(function () {
var $this = $(this)
var data = $this.data('bs.collapse')
var options = $.extend({}, Collapse.DEFAULTS, $this.data(), typeof option == 'object' && option)
if (!data && options.toggle && /show|hide/.test(option)) options.toggle = false
if (!data) $this.data('bs.collapse', (data = new Collapse(this, options)))
if (typeof option == 'string') data[option]()
})
}
var old = $.fn.collapse
$.fn.collapse = Plugin
$.fn.collapse.Constructor = Collapse
// COLLAPSE NO CONFLICT
// ====================
$.fn.collapse.noConflict = function () {
$.fn.collapse = old
return this
}
// COLLAPSE DATA-API
// =================
$(document).on('click.bs.collapse.data-api', '[data-toggle="collapse"]', function (e) {
var $this = $(this)
if (!$this.attr('data-target')) e.preventDefault()
var $target = getTargetFromTrigger($this)
var data = $target.data('bs.collapse')
var option = data ? 'toggle' : $this.data()
Plugin.call($target, option)
})
}(jQuery);
```
|
Michal Seidler (born 5 April 1990), is a Czech futsal player who plays for BTS Rekord Bielsko-Biała and the Czech Republic national futsal team.
References
External links
1990 births
Living people
Futsal forwards
Czech men's futsal players
|
Wigmore Abbey was an abbey of Canons Regular with a grange, from 1179 to 1530, situated about a mile (2 km) north of the village of Wigmore, Herefordshire, England: grid reference SO 410713.
Only ruins of the abbey now remain and on Historic England's Heritage at Risk Register their condition is listed as 'very bad'.
History of the abbey
The founding of the abbey was contemplated by Ranulph de Mortimer in the reign of Henry I, but only brought to fruition by his son, Hugh de Mortimer, who had the abbey consecrated at Wigmore in 1179 in the parish of Leintwardine by Robert Foliot, the Bishop of Hereford. The construction of the abbey was also assisted by other local landowners, especially Brian de Brampton and his John, who contributed building materials from their woods and quarries. The abbey community had been some thirty years in moving through various sites in northern Herefordshire before this final consecration. In this it was one of the most moved foundations in the country, having been settled during these years occasionally at Shobdon, Llanthony Priory and Lye or Eye as it has been written.
At the time it has been suggested that this was the largest monastery in the county, followed by Abbey Dore and Leominster Priory.
The first abbot was Simon Merlymond. Andrew of St Victor (–1175) was abbot from 1148–1155 and 1162–1175.
The abbey church, like the church at Wigmore, was dedicated to St James. As they were the principal patrons of the abbey, many members of the Mortimer family were buried there, among them five Earls of March.
The abbey continued to flourish until the period of the Dissolution of the Monasteries in 1530, when it was destroyed. The remains of the building were given to Sir T. Palmer.
Wigmore Abbey is thought to be the place of origin of a manuscript outlining its own history and founding, as well as the lineage of Roger Mortimer, whose father Edmund petitioned Parliament (successfully) to be named heir to the throne in 1374. His claim was superseded by King Henry IV's accession to the throne. The manuscript concerning the Mortimers and the foundation of Wigmore Abbey is now housed at the University of Chicago. Another chronicle has been lost, but copies of the beginning and the end of this have survived in Manchester and Dublin.
Burials
Ranulph de Mortimer
Stephen of Aumale and his wife, Hawise de Mortimer d'Aumale
Roger Mortimer of Wigmore
Maud de Braose, Baroness Mortimer
Roger Mortimer, 1st Baron Mortimer
Roger Mortimer, 1st Earl of March
Joan de Geneville, 2nd Baroness Geneville
Roger Mortimer, 2nd Earl of March
Edmund Mortimer (1302–1331)
Edmund Mortimer, 3rd Earl of March
Roger Mortimer, 4th Earl of March
Hugh de Mortimer and his wife, Maud le Meschin
Edmund Mortimer, 2nd Baron Mortimer
Margaret Mortimer, Baroness Mortimer
Ralph de Mortimer
Recent history of the remains
The land encompassing the abbey remains was owned by the Powell family, and later by the Brierley family. Several fields have been purchased by local farmers. The ruins themselves were sold to British actor John Challis (best known as Boycie from Only Fools and Horses), who lived in the abbot's lodging from 1998 until his death in 2021. The Green Green Grass, starring John Challis, was filmed at Wigmore Abbey along with other locations in the area.
References
Challis, John, (2016). Wigmore Abbey: The Treasure of Mortimer, Wigmore Books Ltd. ()
Remfry, P.M., The Mortimers of Wigmore, 1066 to 1181. Part 1: Wigmore Castle ()
Remfry, P.M., The Wigmore Chronicle, 1066 to 1377:A Translation of John Rylands Manuscript 215 and Trinity College, Dublin, MS.488, ff. 295-9 ()
External links
Guide to Wigmore Abbey chronicle and Brut chronicle. Manuscript, 14th and 15th centuries at the University of Chicago Special Collections Research Center
1179 establishments in England
Grade I listed buildings in Herefordshire
Monasteries in Herefordshire
Burial sites of the Mortimer family
|
```go
package registry
import (
"encoding/base64"
"encoding/json"
"fmt"
"io"
"net/http"
"os"
"path/filepath"
"strings"
"github.com/docker/docker/api/types/registry"
"github.com/sirupsen/logrus"
)
type DockerConfig struct {
Auths map[string]registry.AuthConfig `json:"auths"`
}
// readDockerConfig reads the docker config file.
func readDockerConfig() (DockerConfig, error) {
dockerConfigPath := filepath.Join(os.Getenv("HOME"), ".docker", "config.json")
file, err := os.Open(dockerConfigPath)
if err != nil {
logrus.WithError(err).Error("failed to open docker config file")
return DockerConfig{}, err
}
defer file.Close()
data, err := io.ReadAll(file)
if err != nil {
logrus.WithError(err).Error("failed to read docker config file")
return DockerConfig{}, err
}
var dockerConfig DockerConfig
if err := json.Unmarshal(data, &dockerConfig); err != nil {
logrus.WithError(err).Error("failed to unmarshal docker config")
return DockerConfig{}, err
}
return dockerConfig, nil
}
// getAuthFromDockerConfig retrieves the auth from the docker config.
func getAuthFromDockerConfig(registryURL string) (registry.AuthConfig, error) {
dockerConfig, err := readDockerConfig()
if err != nil {
return registry.AuthConfig{}, err
}
for reg, auth := range dockerConfig.Auths {
if strings.Contains(reg, registryURL) {
decoded, err := base64.URLEncoding.DecodeString(auth.Auth)
if err != nil {
return registry.AuthConfig{}, fmt.Errorf("failed to decode auth: %w", err)
}
parts := strings.Split(string(decoded), ":")
return registry.AuthConfig{
Username: parts[0],
Password: parts[1],
ServerAddress: registryURL,
}, nil
}
}
return registry.AuthConfig{}, fmt.Errorf("no auth found for %s", registryURL)
}
// getBearerToken retrieves a bearer token to use for the image.
func getBearerToken(registry Registry, scope string) (string, error) {
return getBearerTokenWithAuth("", registry, scope)
}
// getBearerTokenWithDefaultAuth retrieves a bearer token to use for the image with default authentication.
// Default authentication is the authentication from the docker config.
func getBearerTokenWithDefaultAuth(registry Registry, scope string) (string, error) {
auth, err := getAuthFromDockerConfig(registry.URL())
if err != nil {
return "", fmt.Errorf("failed to get auth from docker config: %w", err)
}
return getBearerTokenWithAuth(fmt.Sprintf("%s:%s", auth.Username, auth.Password), registry, scope)
}
// getBearerTokenWithAuth retrieves a bearer token to use for the image with given authentication.
func getBearerTokenWithAuth(auth string, registry Registry, scope string) (string, error) {
tokenURL := registry.TokenURL(scope)
logrus.WithField("tokenURL", tokenURL).Debug("Getting bearer token")
req, err := http.NewRequest(http.MethodGet, tokenURL, nil)
if err != nil {
return "", err
}
if auth != "" {
parts := strings.Split(auth, ":")
req.SetBasicAuth(parts[0], parts[1])
}
res, err := http.DefaultClient.Do(req)
if err != nil {
return "", err
}
defer res.Body.Close()
if res.StatusCode != http.StatusOK {
return "", fmt.Errorf("failed to get bearer token: %s", res.Status)
}
resp := map[string]interface{}{}
if err := json.NewDecoder(res.Body).Decode(&resp); err != nil {
return "", err
}
return resp["token"].(string), nil
}
// registryAuthStr returns the base64 encoded registry auth string.
func registryAuthStr(registry Registry) (string, error) {
registryAuthConfig, err := getAuthFromDockerConfig(registry.URL())
if err != nil {
logrus.WithError(err).Error("failed to get auth config")
return "", err
}
registryAuth, err := json.Marshal(registryAuthConfig)
if err != nil {
logrus.WithError(err).Error("failed to marshal auth config")
return "", err
}
return base64.URLEncoding.EncodeToString(registryAuth), nil
}
```
|
```smalltalk
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// Tencent is pleased to support the open source community by making behaviac available.
//
//
//
// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////
namespace Behaviac.Design.Attributes
{
partial class DesignerTypeEnumEditor
{
/// <summary>
/// Required designer variable.
/// </summary>
private System.ComponentModel.IContainer components = null;
/// <summary>
/// Clean up any resources being used.
/// </summary>
/// <param name="disposing">true if managed resources should be disposed; otherwise, false.</param>
protected override void Dispose(bool disposing)
{
if (disposing && (components != null))
{
components.Dispose();
}
base.Dispose(disposing);
}
#region Windows Form Designer generated code
/// <summary>
/// Required method for Designer support - do not modify
/// the contents of this method with the code editor.
/// </summary>
private void InitializeComponent()
{
this.comboBox = new System.Windows.Forms.ComboBox();
this.SuspendLayout();
//
// comboBox
//
this.comboBox.Anchor = ((System.Windows.Forms.AnchorStyles)((((System.Windows.Forms.AnchorStyles.Top | System.Windows.Forms.AnchorStyles.Bottom)
| System.Windows.Forms.AnchorStyles.Left)
| System.Windows.Forms.AnchorStyles.Right)));
this.comboBox.BackColor = System.Drawing.Color.FromArgb(((int)(((byte)(65)))), ((int)(((byte)(65)))), ((int)(((byte)(65)))));
this.comboBox.DrawMode = System.Windows.Forms.DrawMode.OwnerDrawFixed;
this.comboBox.DropDownStyle = System.Windows.Forms.ComboBoxStyle.DropDownList;
this.comboBox.FlatStyle = System.Windows.Forms.FlatStyle.Popup;
this.comboBox.ForeColor = System.Drawing.Color.LightGray;
this.comboBox.FormattingEnabled = true;
this.comboBox.Location = new System.Drawing.Point(2, 1);
this.comboBox.Name = "comboBox";
this.comboBox.Size = new System.Drawing.Size(200, 22);
this.comboBox.TabIndex = 0;
this.comboBox.DrawItem += new System.Windows.Forms.DrawItemEventHandler(this.comboBox_DrawItem);
this.comboBox.DropDown += new System.EventHandler(this.comboBox_DropDown);
this.comboBox.SelectedIndexChanged += new System.EventHandler(this.comboBox_SelectedIndexChanged);
this.comboBox.MouseEnter += new System.EventHandler(this.comboBox_MouseEnter);
//
// DesignerTypeEnumEditor
//
this.AutoScaleDimensions = new System.Drawing.SizeF(6F, 12F);
this.BackColor = System.Drawing.Color.FromArgb(((int)(((byte)(56)))), ((int)(((byte)(56)))), ((int)(((byte)(56)))));
this.Controls.Add(this.comboBox);
this.Name = "DesignerTypeEnumEditor";
this.Size = new System.Drawing.Size(204, 24);
this.KeyPress += new System.Windows.Forms.KeyPressEventHandler(this.DesignerTypeEnumEditor_KeyPress);
this.ResumeLayout(false);
}
#endregion
private System.Windows.Forms.ComboBox comboBox;
}
}
```
|
```objective-c
/*
* (C) 1999 Lars Knoll (knoll@kde.org)
* (C) 2000 Dirk Mueller (mueller@kde.org)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
*
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#ifndef InlineTextBox_h
#define InlineTextBox_h
#include "core/layout/LayoutText.h" // so textLayoutObject() can be inline
#include "core/layout/line/InlineBox.h"
#include "platform/text/TextRun.h"
#include "wtf/Forward.h"
namespace blink {
class DocumentMarker;
class GraphicsContext;
const unsigned short cNoTruncation = USHRT_MAX;
const unsigned short cFullTruncation = USHRT_MAX - 1;
class InlineTextBox : public InlineBox {
public:
InlineTextBox(LayoutObject& obj, int start, unsigned short length)
: InlineBox(obj)
, m_prevTextBox(nullptr)
, m_nextTextBox(nullptr)
, m_start(start)
, m_len(length)
, m_truncation(cNoTruncation)
{
setIsText(true);
}
LayoutText& layoutObject() const { return toLayoutText(InlineBox::layoutObject()); }
virtual void destroy() override final;
InlineTextBox* prevTextBox() const { return m_prevTextBox; }
InlineTextBox* nextTextBox() const { return m_nextTextBox; }
void setNextTextBox(InlineTextBox* n) { m_nextTextBox = n; }
void setPreviousTextBox(InlineTextBox* p) { m_prevTextBox = p; }
// FIXME: These accessors should ASSERT(!isDirty()). See path_to_url
unsigned start() const { return m_start; }
unsigned end() const { return m_len ? m_start + m_len - 1 : m_start; }
unsigned len() const { return m_len; }
void offsetRun(int delta);
unsigned short truncation() { return m_truncation; }
virtual void markDirty() override final;
using InlineBox::hasHyphen;
using InlineBox::setHasHyphen;
using InlineBox::canHaveLeadingExpansion;
using InlineBox::setCanHaveLeadingExpansion;
static inline bool compareByStart(const InlineTextBox* first, const InlineTextBox* second) { return first->start() < second->start(); }
virtual int baselinePosition(FontBaseline) const override final;
virtual LayoutUnit lineHeight() const override final;
bool getEmphasisMarkPosition(const ComputedStyle&, TextEmphasisPosition&) const;
LayoutRect logicalOverflowRect() const;
void setLogicalOverflowRect(const LayoutRect&);
LayoutUnit logicalTopVisualOverflow() const { return logicalOverflowRect().y(); }
LayoutUnit logicalBottomVisualOverflow() const { return logicalOverflowRect().maxY(); }
// charactersWithHyphen, if provided, must not be destroyed before the TextRun.
TextRun constructTextRun(const ComputedStyle&, const Font&, StringBuilder* charactersWithHyphen = nullptr) const;
TextRun constructTextRun(const ComputedStyle&, const Font&, StringView, int maximumLength, StringBuilder* charactersWithHyphen = nullptr) const;
#ifndef NDEBUG
virtual void showBox(int = 0) const override;
#endif
virtual const char* boxName() const override;
virtual String debugName() const override;
String text() const;
public:
TextRun constructTextRunForInspector(const ComputedStyle&, const Font&) const;
virtual LayoutRect calculateBoundaries() const override { return LayoutRect(x(), y(), width(), height()); }
virtual LayoutRect localSelectionRect(int startPos, int endPos);
bool isSelected(int startPos, int endPos) const;
void selectionStartEnd(int& sPos, int& ePos) const;
// These functions both paint markers and update the DocumentMarker's renderedRect.
virtual void paintDocumentMarker(GraphicsContext*, const LayoutPoint& boxOrigin, DocumentMarker*, const ComputedStyle&, const Font&, bool grammar);
virtual void paintTextMatchMarker(GraphicsContext*, const LayoutPoint& boxOrigin, DocumentMarker*, const ComputedStyle&, const Font&);
virtual void move(const LayoutSize&) override final;
protected:
virtual void paint(const PaintInfo&, const LayoutPoint&, LayoutUnit lineTop, LayoutUnit lineBottom) override;
virtual bool nodeAtPoint(HitTestResult&, const HitTestLocation& locationInContainer, const LayoutPoint& accumulatedOffset, LayoutUnit lineTop, LayoutUnit lineBottom) override;
private:
virtual void deleteLine() override final;
virtual void extractLine() override final;
virtual void attachLine() override final;
public:
virtual LayoutObject::SelectionState selectionState() const override final;
private:
virtual void clearTruncation() override final { m_truncation = cNoTruncation; }
virtual LayoutUnit placeEllipsisBox(bool flowIsLTR, LayoutUnit visibleLeftEdge, LayoutUnit visibleRightEdge, LayoutUnit ellipsisWidth, LayoutUnit &truncatedWidth, bool& foundBox) override final;
public:
virtual bool isLineBreak() const override final;
void setExpansion(int newExpansion)
{
m_logicalWidth -= expansion();
InlineBox::setExpansion(newExpansion);
m_logicalWidth += newExpansion;
}
private:
virtual bool isInlineTextBox() const override final { return true; }
public:
virtual int caretMinOffset() const override final;
virtual int caretMaxOffset() const override final;
LayoutUnit textPos() const; // returns the x position relative to the left start of the text line.
public:
virtual int offsetForPosition(LayoutUnit x, bool includePartialGlyphs = true) const;
virtual LayoutUnit positionForOffset(int offset) const;
bool containsCaretOffset(int offset) const; // false for offset after line break
// Fills a vector with the pixel width of each character.
void characterWidths(Vector<float>&) const;
private:
InlineTextBox* m_prevTextBox; // The previous box that also uses our LayoutObject
InlineTextBox* m_nextTextBox; // The next box that also uses our LayoutObject
int m_start;
unsigned short m_len;
// Where to truncate when text overflow is applied. We use special constants to denote
// no truncation (the whole run paints) and full truncation (nothing paints at all).
unsigned short m_truncation;
private:
TextRun::ExpansionBehavior expansionBehavior() const
{
return (canHaveLeadingExpansion() ? TextRun::AllowLeadingExpansion : TextRun::ForbidLeadingExpansion)
| (expansion() && nextLeafChild() ? TextRun::AllowTrailingExpansion : TextRun::ForbidTrailingExpansion);
}
};
DEFINE_INLINE_BOX_TYPE_CASTS(InlineTextBox);
void alignSelectionRectToDevicePixels(LayoutRect&);
} // namespace blink
#endif // InlineTextBox_h
```
|
Alice Saxby MVO (1904 – 28 November 1987) was a British nurse who was matron to King Edward VII's Hospital for Officers, London, from 1948 to 1969. She was previously in charge of an officer's wing at Botleys Mansion during the Second World War and cared for many casualties from the Normandy landings.
During her tenure at the hospital, she modelled herself on its founder, Sister Agnes, who had been matron before her, and she looked after, among others, Harold Macmillan and Field Marshal Viscount Montgomery of Alamein. Several members of the British Royal Family were cared for at the hospital during her time in office, including Princess Alexandra and Queen Elizabeth The Queen Mother.
In 1958, Saxby was made a Member of the Royal Victorian Order. She retired in 1969.
Early life and career
Alice Saxby, known by some as "Sax", was born in Maidenhead, Berkshire, in 1904. She completed her nursing training at St. Thomas's Hospital, London.
In January 1939, she was appointed to the nursing staff of the Queen Alexandra's Royal Army Nursing Corps. During the Second World War she was in charge of an officer's wing at St Thomas's Emergency Bed Service based at the former mental institution at Botleys Park, where she cared for many of the first casualties from the Normandy landings.
Post-war career
In 1948, Saxby was appointed matron to King Edward VII's Hospital for Officers, London. Prior to 1940, Sister Agnes had been matron and between September 1940 and October 1948, the hospital had been closed. In October 1948, at the opening of the hospital at Beaumont Street, London, Saxby appeared in two official photographs; in one standing beside Queen Mary and surrounded by the nursing staff, and in the other standing with Queen Mary, Sir Harold Augustus Wernher, Lady Zia Wernher and Sir George Ogilvie. By 1949, the hospital could make claim to an elite medical and surgical staff, but, according to Richard Hough (in his book Sister Agnes, The History of King Edward VII's Hospital for Officers 1899 - 1999: "like Sister Agnes, Matron Alice Saxby did not allow them to get above themselves".
During Saxby's tenure at the hospital, she modelled herself on its founder Sister Agnes, and she looked after several members of the Royal family. She arranged the nursing care of Prince Henry, Duke of Gloucester when he suffered a stroke. Others who were cared for at the hospital during her time in office included Harold Macmillan, Field Marshal Viscount Montgomery of Alamein in 1955, and Princess Alexandra who was admitted for the extraction of a wisdom tooth. In 1959, Edward Heath (British Prime Minister 1970-1974), was admitted with jaundice. The Queen Mother was treated for appendicitis, the Duke of Kent attended for a minor illness, and Prince Bertil, Duke of Halland, underwent a series of operations in 1961.
In 1958, Saxby was appointed a member of the Royal Victorian Order (MVO). She retired in 1969 and was succeeded by Margaret Dalglish. She was listed as a new member in the "Report of the Society of the Friends of St Georges and the Descendants of the Royal Knights of the Garter" (1980-1981).
Recollections
Saxby appears in several memoirs. Princess Alice, Duchess of Gloucester, remembered that Saxby had been "a great admirer of Prince Henry from the days when he had been her President at King Edward's". A long-time physician at the hospital, Sir Brian Warren, recalled that Saxby "liked titles and I have never seen such a low curtsy, when this was called for - which was as often as possible. She liked titles even more than Sister Agnes did." Edward Heath wrote in his autobiography that during his earlier admission to King Edward's in 1959, "the matron appeared, a trim and imposing figure".
Death
Saxby died at the age of 83 on 28 November 1987 at her home in Maidenhead. Her death was widely reported, including in an obituary in The Daily Telegraph which described her as "a neat precise woman with a soft light brown hair with a sharp wit; small in stature but tough". Dorothy Shipsey (later matron 1980-1994) reported that many attended the thanksgiving service for her life held at St James's Church, Spanish Place, including representatives of the royal family.
References
Bibliography
Hough, Richard (1998). Sister Agnes: The History of King Edward VII's Hospital for Officers 1899-1999. London: John Murray.
External links
1904 births
1987 deaths
British nurses
Nursing in the United Kingdom
People from Maidenhead
Members of the Royal Victorian Order
|
An undine is an ophthalmic irrigation device which was used to trickle a cleansing liquid over the conjunctival surface while controlling the flow with the thumb or finger over the filling hole. It has now been superseded by more modern equipment.
The undine is a spherical or pear-shaped glass flask generally about 2 to 3 inches in diameter with a 2 to 3-inch narrowing spout on one side and a collared opening on the top about half an inch wide.
They were used predominantly from the 1930s to the 1960s after which single-use plastic disposable equivalents became available. As glass undines require careful cleaning and sterilization after each use, single-use plastic equivalents were preferred as they are cheaper and require no careful handling.
References
Ophthalmic equipment
Ophthalmology
|
```xml
import { map } from "rxjs";
import { Jsonify } from "type-fest";
import {
ORGANIZATION_MANAGEMENT_PREFERENCES_DISK,
StateProvider,
UserKeyDefinition,
} from "../../../platform/state";
import {
OrganizationManagementPreference,
OrganizationManagementPreferencesService,
} from "../../abstractions/organization-management-preferences/organization-management-preferences.service";
/**
* This helper function can be used to quickly create `KeyDefinitions` that
* target the `ORGANIZATION_MANAGEMENT_PREFERENCES_DISK` `StateDefinition`
* and that have the default deserializer and `clearOn` options. Any
* contenders for options to add to this service will likely use these same
* options.
*/
function buildKeyDefinition<T>(key: string): UserKeyDefinition<T> {
return new UserKeyDefinition<T>(ORGANIZATION_MANAGEMENT_PREFERENCES_DISK, key, {
deserializer: (obj: Jsonify<T>) => obj as T,
clearOn: ["logout"],
});
}
export const AUTO_CONFIRM_FINGERPRINTS = buildKeyDefinition<boolean>("autoConfirmFingerPrints");
export class DefaultOrganizationManagementPreferencesService
implements OrganizationManagementPreferencesService
{
constructor(private stateProvider: StateProvider) {}
autoConfirmFingerPrints = this.buildOrganizationManagementPreference(
AUTO_CONFIRM_FINGERPRINTS,
false,
);
/**
* Returns an `OrganizationManagementPreference` object for the provided
* `KeyDefinition`. This object can then be used by callers to subscribe to
* a given key, or set its value in state.
*/
private buildOrganizationManagementPreference<T>(
keyDefinition: UserKeyDefinition<T>,
defaultValue: T,
) {
return new OrganizationManagementPreference<T>(
this.getKeyFromState(keyDefinition).state$.pipe(map((x) => x ?? defaultValue)),
this.setKeyInStateFn(keyDefinition),
);
}
/**
* Returns the full `ActiveUserState` value for a given `keyDefinition`
* The returned value can then be called for subscription || set operations
*/
private getKeyFromState<T>(keyDefinition: UserKeyDefinition<T>) {
return this.stateProvider.getActive(keyDefinition);
}
/**
* Returns a function that can be called to set the given `keyDefinition` in state
*/
private setKeyInStateFn<T>(keyDefinition: UserKeyDefinition<T>) {
return async (value: T) => {
await this.getKeyFromState(keyDefinition).update(() => value);
};
}
}
```
|
```html
<!DOCTYPE html>
<html lang="de">
<head>
<!-- R1.00.0379.0102 eQ-3 -->
<% Call("/esp/system.fn::CheckUserFavorite()"); %>
<meta http-equiv="Content-Language" content="de">
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<link rel="shortcut icon" href="/ise/img/rm-favicon.ico" type="image/vnd.microsoft.icon"/>
<link rel="icon" href="/ise/img/rm-favicon.ico" type="image/vnd.microsoft.icon" />
<link rel="stylesheet" type="text/css" href="/webui/css/extern/nfs_datepicker.css" />
<link rel="stylesheet" type="text/css" href="/webui/css/extern/jquery.powertip.css" />
<link rel="stylesheet" type="text/css" href="/webui/css/extern/jquery.jqplot.css" />
<link rel="stylesheet" type="text/css" href="/webui/css/extern/msdropdown/dd.css" />
<link rel="stylesheet" type="text/css" href="/webui/css/extern/spectrum.css" />
<link id="idCss" rel="stylesheet" type="text/css" href="/webui/style.cgi" />
<link rel="apple-touch-icon" href="/ise/img/rm-touch-icon-iphone.png" />
<link rel="apple-touch-icon" sizes="180x180" href="/ise/img/rm-touch-icon-iphone-retina.png" />
<title>HomeMatic WebUI</title>
<script type="text/javascript" src="/webui/js/extern/jquery.js"></script>
<script type="text/javascript" src="/webui/js/extern/jqueryURLPlugin.js"></script>
<script type="text/javascript" src="/webui/js/extern/jquery.powertip.js"></script>
<script type="text/javascript" src="/webui/js/extern/jquery.blockUI.js"></script>
<script type="text/javascript" src="/webui/js/extern/jquery.form.js"></script>
<script type="text/javascript" src="/webui/js/extern/prototype.js"></script>
<script type="text/javascript" src="/webui/js/extern/scriptaculous.js?load=builder,effects,dragdrop,slider"></script>
<script type="text/javascript" src="/webui/js/extern/wz_jsgraphics.js"></script>
<script type="text/javascript" src="/webui/js/extern/template.js"></script>
<script type="text/javascript" src="/webui/js/extern/nfs_datepicker.js"></script>
<script type="text/javascript" src="/webui/js/extern/sliderControl.js"></script>
<script type="text/javascript" src="/webui/js/extern/jquery.jqplot.min.js"></script>
<script type="text/javascript" src="/webui/js/extern/jquery.dd.min.js"></script>
<script type="text/javascript" src="/webui/js/extern/jqplot.barRenderer.min.js"></script>
<script type="text/javascript" src="/webui/js/extern/jqplot.dateAxisRenderer.min.js"></script>
<script type="text/javascript" src="/webui/js/extern/jqplot.categoryAxisRenderer.min.js"></script>
<script type="text/javascript" src="/webui/js/extern/jqplot.canvasAxisTickRenderer.min.js"></script>
<script type="text/javascript" src="/webui/js/extern/jqplot.canvasTextRenderer.min.js"></script>
<script type="text/javascript" src="/webui/js/extern/jqplot.cursor.js"></script>
<script type="text/javascript" src="/webui/js/extern/jqplot.enhancedLegendRenderer.min.js"></script>
<script type="text/javascript" src="/webui/js/extern/jqplot.highlighter.min.js"></script>
<script type="text/javascript" src="/webui/js/extern/jqplot.markerRenderer.js"></script>
<script type="text/javascript" src="/webui/js/lang/loadTextResource.js"></script>
<script type="text/javascript" src="/webui/js/lang/translate.js"></script>
<script type="text/javascript" src="/webui/js/extern/knockout.js"></script>
<script type="text/javascript" src="/webui/js/common/viewmodels.js"></script>
<script type="text/javascript" src="/webui/js/extern/json2min.js"></script>
<script type="text/javascript" src="/webui/js/extern/spectrum.js"></script>
<link href="/webui/css/extern/smoothness/jquery-ui.min.css" rel="stylesheet" type="text/css">
<link href="/webui/css/extern/smoothness/jquery.ui.timepicker.css?v=0.3.2" rel="stylesheet" type="text/css" />
<script src="/webui/js/extern/jquery-ui.min.js"></script>
<script src="/webui/js/extern/jquery.ui.timepicker.js"></script>
<!--[if IE 9]><meta http-equiv="X-UA-Compatible" content="IE=EmulateIE9" /><![endif]-->
<!--[if lt IE 9]><script language="javascript" type="text/javascript" src="/webui/js/extern/excanvas.js"></script><![endif]-->
<script type="text/javascript">
/*########################################################################*/
/*# Konstanten #*/
/*########################################################################*/
PLATFORM = "Central";
WEBUI_VERSION = "3.55.5.20201226";
PRODUCT = "raspmatic_rpi3";
/**
* Flags
**/
iufNone = <% Write( iufNone ); %>;
iufVisible = <% Write( iufVisible ); %>;
iufInternal = <% Write( iufInternal ); %>;
iufReadyState = <% Write( iufReadyState ); %>;
iufOperated = <% Write( iufOperated ); %>;
iufVirtualChn = <% Write( iufVirtualChn ); %>;
iufReadable = <% Write( iufReadable ); %>;
iufWriteable = <% Write( iufWriteable ); %>;
iufEventable = <% Write( iufEventable ); %>;
iufAll = <% Write( iufAll ); %>;
/**
* User Privilege Level. Gibt die Nutzerrechte des angemeldeten Nutzers an.
**/
ul = <% Write( oUser.UserLevel()); %>;
userId = <% Write(oUser.ID()); %>;
/**
* Privilegstufen.
**/
UPL_NONE = 0;
UPL_GUEST = 1;
UPL_USER = 2;
UPL_ADMIN = 8;
/*########################################################################*/
/*# Globale Variablen #*/
/*########################################################################*/
isHTTPS = window.location.protocol.startsWith("https:");
forceUpdate = false;
preventInterfaceCheck = (jQuery.url().param('preventInterfaceCheck') == "true") ? true : false;
urlParamInterfaces = jQuery.url().param('showInterfaces');
urlDebug = jQuery.url().param('debug');
createNewProgram = false;
showAPITools = jQuery.url().param('showAPITools');
showRFAddress = (jQuery.url().param('showRFAddress') == "true") ? true : false;
/**
* jg_250
* JS-Graphics-Objekt fr die Anzeige der vergrerten Bilder von HomeMatic
* Gerten, Kanalgruppen und Kanlen.
**/
var jg_250;
var mainMenu;
<%
object oUser = dom.GetObject( system.GetSessionVar('sessionUserID') );
string sUserFullName = oUser.UserFirstName()#' '#oUser.UserLastName();
if( sUserFullName == ' ' ){ sUserFullName = oUser.Name(); }
string sUserLevel = "lblGuest";
if (oUser.UserLevel() == iulAdmin) { sUserLevel = "lblAdmin"; }
elseif (oUser.UserLevel() == iulUser) { sUserLevel = "lblUser" ; }
string sUserEasyMode = "lblUIModeExpert";
if (oUser.UserEasyLinkMode()) { sUserEasyMode = "lblUIModeEasy"; }
WriteLine('var userName = "' # sUserFullName # ' (" + translateKey("' # sUserLevel # '") + ") | " + translateKey("lblEasyModeActiveShort") + " " + translateKey("' # sUserEasyMode # '");');
WriteLine('var userLink = "CreatePopup(ID_USER_ACCOUNT_CONFIG_ADMIN, '#oUser.ID()#')"');
%>
/*########################################################################*/
/*# Funktionen #*/
/*########################################################################*/
/**
* Ermittelt die Privilegstufe des momentan angemeldeten Benutzers.
**/
function getUPL ()
{
<%
integer sessionUPL = 0;
string sUser = system.GetSessionVarStr(sessionId);
if ("" != sUser)
{
string sUPL = sUser.StrValueByIndex(";", 1);
sessionUPL = sUPL.ToInteger();
}
Write("return " # sessionUPL # ";");
%>
}
/**
* Prft, ob der Benutzer eine bestimmte Privilegstufe besitzt
**/
function hasUPL(upl)
{
return (upl <= getUPL());
}
function getSessionId()
{
return "<%Write(sessionId);%>";
}
</script>
<script type="text/javascript">
document.onkeypress = Backspace;
function Backspace(event) {
if (event.keyCode == 8) {
if (document.activeElement.tagName == "INPUT" || "textarea") {
return true;
} else {
alert(unescape(translateKey('dialogBackspacePrevent') ));
return false;
}
}
}
try {
history.pushState(null, document.title, location.href);
window.addEventListener('popstate', function (event) {
history.pushState(null, document.title, location.href);
alert(unescape(translateKey('dialogBackspacePrevent')));
});
} catch (e) {}
</script>
<link rel="stylesheet" type="text/css" href="/webui/js/extern/codemirror/lib/codemirror.css">
<link rel="stylesheet" type="text/css" href="/webui/js/extern/codemirror/addon/hint/show-hint.css">
<link rel="stylesheet" type="text/css" href="/webui/js/extern/codemirror/addon/fold/foldgutter.css">
<link rel="stylesheet" type="text/css" href="/webui/js/extern/codemirror/addon/display/fullscreen.css">
<link rel="stylesheet" type="text/css" href="/webui/js/extern/codemirror/addon/dialog/dialog.css">
<link rel="stylesheet" type="text/css" href="/webui/js/extern/codemirror/addon/search/matchesonscrollbar.css">
<script type="text/javascript" src="/webui/js/extern/codemirror/lib/codemirror.js"></script>
<script type="text/javascript" src="/webui/js/extern/codemirror/mode/clike/clike.js"></script>
<script type="text/javascript" src="/webui/js/extern/codemirror/addon/edit/matchbrackets.js"></script>
<script type="text/javascript" src="/webui/js/extern/codemirror/addon/edit/closebrackets.js"></script>
<script type="text/javascript" src="/webui/js/extern/codemirror/addon/hint/show-hint.js"></script>
<script type="text/javascript" src="/webui/js/extern/codemirror/addon/hint/anyword-hint.js"></script>
<script type="text/javascript" src="/webui/js/extern/codemirror/addon/fold/foldcode.js"></script>
<script type="text/javascript" src="/webui/js/extern/codemirror/addon/fold/foldgutter.js"></script>
<script type="text/javascript" src="/webui/js/extern/codemirror/addon/fold/brace-fold.js"></script>
<script type="text/javascript" src="/webui/js/extern/codemirror/addon/fold/indent-fold.js"></script>
<script type="text/javascript" src="/webui/js/extern/codemirror/addon/fold/comment-fold.js"></script>
<script type="text/javascript" src="/webui/js/extern/codemirror/addon/display/fullscreen.js"></script>
<script type="text/javascript" src="/webui/js/extern/codemirror/addon/dialog/dialog.js"></script>
<script type="text/javascript" src="/webui/js/extern/codemirror/addon/search/searchcursor.js"></script>
<script type="text/javascript" src="/webui/js/extern/codemirror/addon/search/search.js"></script>
<script type="text/javascript" src="/webui/js/extern/codemirror/addon/scroll/annotatescrollbar.js"></script>
<script type="text/javascript" src="/webui/js/extern/codemirror/addon/search/matchesonscrollbar.js"></script>
<script type="text/javascript" src="/webui/js/extern/codemirror/addon/search/jump-to-line.js"></script>
</head>
<body id="body" onload="WebUI.start();" >
<div id="webuiloader_wrapper">
<div id="webuiloader_background">
<div id="webuiloader">
<div id="webuiloader_icon"><img src="/ise/img/rm-logo_small_gray.png" /></div>
<!-- div id="webuiloader_caption">HomeMatic WebUI wird geladen...</div-->
<div id="webuiloader_caption"></div>
<script type="text/javascript">jQuery("#webuiloader_caption").html(translateKey("loadWebUI"));</script>
</div>
</div>
</div>
<script type="text/javascript" src="/webui/webui.js" ></script>
</body>
</html>
```
|
```go
package commitlog_test
import (
"testing"
"github.com/stretchr/testify/require"
"github.com/travisjeffery/jocko/commitlog"
)
func TestSegmentScanner(t *testing.T) {
var err error
l := setupWithOptions(t, commitlog.Options{
MaxSegmentBytes: 1000,
MaxLogBytes: 1000,
})
defer cleanup(t, l)
for _, msgSet := range msgSets {
_, err = l.Append(msgSet)
require.NoError(t, err)
}
segments := l.Segments()
segment := segments[0]
scanner := commitlog.NewSegmentScanner(segment)
ms, err := scanner.Scan()
require.NoError(t, err)
require.Equal(t, msgSets[0], ms)
}
```
|
```c++
/*******************************************************************************
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*******************************************************************************/
#include "gtest/gtest.h"
#include "graph/unit/backend/dnnl/dnnl_test_common.hpp"
#include "graph/unit/unit_test_common.hpp"
#include "graph/unit/utils.hpp"
namespace graph = dnnl::impl::graph;
namespace utils = dnnl::graph::tests::unit::utils;
TEST(test_interpolate_execute, InterpolateForwardNearest) {
graph::engine_t *engine = get_engine();
graph::stream_t *strm = get_stream();
std::vector<float> src {-2.0, -1.5, -1.0, -0.5};
std::vector<float> dst {0.0, 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0};
std::vector<float> ref_dst {
-2.f, -1.5f, -1.5f, -1.f, -0.5f, -0.5f, -1.f, -0.5f, -0.5f};
graph::op_t op(graph::op_kind::Interpolate);
op.set_attr<std::string>(graph::op_attr::mode, "nearest");
op.set_attr(graph::op_attr::sizes, std::vector<int64_t> {3, 3});
op.set_attr<std::string>(
graph::op_attr::coordinate_transformation_mode, "half_pixel");
op.set_attr<std::string>(graph::op_attr::data_format, "NCX");
graph::logical_tensor_t src_lt = utils::logical_tensor_init(
0, {1, 1, 2, 2}, graph::data_type::f32);
graph::logical_tensor_t dst_lt = utils::logical_tensor_init(
1, graph::data_type::f32, graph::layout_type::strided);
op.add_input(src_lt);
op.add_output(dst_lt);
graph::graph_t g(engine->kind());
g.add_op(&op);
g.finalize();
graph::pass::pass_base_ptr apass = get_pass("interpolate_pass");
apass->run(g);
ASSERT_EQ(g.get_num_partitions(), 1U);
auto part = g.get_partitions()[0];
ASSERT_TRUE(part != nullptr);
// compile
graph::partition_t p;
p.init(part);
graph::compiled_partition_t cp(p);
std::vector<const graph::logical_tensor_t *> lt_ins {&src_lt};
std::vector<const graph::logical_tensor_t *> lt_outs {&dst_lt};
p.compile(&cp, lt_ins, lt_outs, engine);
graph::logical_tensor_t lt;
cp.query_logical_tensor(dst_lt.id, <);
test_tensor src_ts(src_lt, engine, src);
test_tensor dst_ts(lt, engine, dst);
cp.execute(strm, {src_ts.get()}, {dst_ts.get()});
strm->wait();
dst = dst_ts.as_vec_type<float>();
for (size_t i = 0; i < dst.size(); ++i) {
ASSERT_FLOAT_EQ(dst[i], ref_dst[i]);
}
}
TEST(test_interpolate_execute, InterpolateAddForwardNearest) {
graph::engine_t *engine = get_engine();
graph::stream_t *strm = get_stream();
std::vector<float> src {-2.0, -1.5, -1.0, -0.5};
std::vector<float> src1 {0.f, 0.5f, 1.f, 1.5f, 2.0f, 2.5f, 3.0f, 3.5f, 4.f};
std::vector<float> dst_add {0.0, 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0};
std::vector<float> ref_dst {
-2.f, -1.f, -0.5f, 0.5f, 1.5f, 2.f, 2.f, 3.f, 3.5f};
graph::op_t interpolate_node(0, graph::op_kind::Interpolate, "interpolate");
interpolate_node.set_attr<std::string>(graph::op_attr::mode, "nearest");
interpolate_node.set_attr(
graph::op_attr::sizes, std::vector<int64_t> {3, 3});
interpolate_node.set_attr<std::string>(
graph::op_attr::coordinate_transformation_mode, "half_pixel");
interpolate_node.set_attr<std::string>(graph::op_attr::data_format, "NCX");
graph::op_t add_node(1, graph::op_kind::Add, "add_node");
graph::logical_tensor_t src_lt = utils::logical_tensor_init(
0, {1, 1, 2, 2}, graph::data_type::f32);
graph::logical_tensor_t dst_lt = utils::logical_tensor_init(
1, graph::data_type::f32, graph::layout_type::strided);
graph::logical_tensor_t src1_lt = utils::logical_tensor_init(2,
{1, 1, 3, 3}, graph::data_type::f32, graph::layout_type::strided);
graph::logical_tensor_t dst_add_lt = utils::logical_tensor_init(3,
{1, 1, 3, 3}, graph::data_type::f32, graph::layout_type::strided);
interpolate_node.add_input(src_lt);
interpolate_node.add_output(dst_lt);
add_node.add_input(dst_lt);
add_node.add_input(src1_lt);
add_node.add_output(dst_add_lt);
graph::graph_t g(engine->kind());
g.add_op(&interpolate_node);
g.add_op(&add_node);
g.finalize();
graph::pass::pass_base_ptr apass = get_pass("interpolate_post_ops_fusion");
apass->run(g);
ASSERT_EQ(g.get_num_partitions(), 1U);
auto part = g.get_partitions()[0];
ASSERT_TRUE(part != nullptr);
// compile
graph::partition_t p;
p.init(part);
graph::compiled_partition_t cp(p);
std::vector<const graph::logical_tensor_t *> lt_ins {&src_lt, &src1_lt};
std::vector<const graph::logical_tensor_t *> lt_outs {&dst_add_lt};
p.compile(&cp, lt_ins, lt_outs, engine);
test_tensor src_ts(src_lt, engine, src);
test_tensor src1_ts(src1_lt, engine, src1);
test_tensor dst_add_ts(*lt_outs[0], engine, dst_add);
cp.execute(strm, {src_ts.get(), src1_ts.get()}, {dst_add_ts.get()});
strm->wait();
dst_add = dst_add_ts.as_vec_type<float>();
for (size_t i = 0; i < dst_add.size(); ++i) {
ASSERT_FLOAT_EQ(dst_add[i], ref_dst[i]);
}
}
TEST(test_interpolate_execute, InterpolateSwish) {
graph::engine_t *engine = get_engine();
graph::stream_t *strm = get_stream();
std::vector<float> src {-2.0, -1.5, -1.0, -0.5};
std::vector<float> dst_mul {0.0, 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0};
graph::op_t interpolate_node(0, graph::op_kind::Interpolate, "interpolate");
interpolate_node.set_attr<std::string>(graph::op_attr::mode, "nearest");
interpolate_node.set_attr(
graph::op_attr::sizes, std::vector<int64_t> {3, 3});
interpolate_node.set_attr<std::string>(
graph::op_attr::coordinate_transformation_mode, "half_pixel");
interpolate_node.set_attr<std::string>(graph::op_attr::data_format, "NCX");
graph::op_t sigmoid_node(1, graph::op_kind::Sigmoid, "sigmoid_node");
graph::op_t mul_node(2, graph::op_kind::Multiply, "multiply_node");
graph::logical_tensor_t src_lt = utils::logical_tensor_init(
0, {1, 1, 2, 2}, graph::data_type::f32);
graph::logical_tensor_t dst_lt = utils::logical_tensor_init(
1, graph::data_type::f32, graph::layout_type::strided);
graph::logical_tensor_t dst_sigmoid_lt = utils::logical_tensor_init(2,
{1, 1, 3, 3}, graph::data_type::f32, graph::layout_type::strided);
graph::logical_tensor_t dst_mul_lt = utils::logical_tensor_init(3,
{1, 1, 3, 3}, graph::data_type::f32, graph::layout_type::strided);
interpolate_node.add_input(src_lt);
interpolate_node.add_output(dst_lt);
sigmoid_node.add_input(dst_lt);
sigmoid_node.add_output(dst_sigmoid_lt);
mul_node.add_input(dst_sigmoid_lt);
mul_node.add_input(dst_lt);
mul_node.add_output(dst_mul_lt);
graph::graph_t g(engine->kind());
ASSERT_EQ(g.add_op(&interpolate_node), graph::status::success);
ASSERT_EQ(g.add_op(&sigmoid_node), graph::status::success);
ASSERT_EQ(g.add_op(&mul_node), graph::status::success);
ASSERT_EQ(g.finalize(), graph::status::success);
ASSERT_EQ(g.num_ops(), 3U);
graph::pass::pass_base_ptr apass = get_pass("interpolate_post_ops_fusion");
apass->run(g);
ASSERT_EQ(g.get_num_partitions(), 1U);
auto part = g.get_partitions()[0];
ASSERT_TRUE(part != nullptr);
// compile
graph::partition_t p;
p.init(part);
graph::compiled_partition_t cp(p);
std::vector<const graph::logical_tensor_t *> lt_ins {&src_lt};
std::vector<const graph::logical_tensor_t *> lt_outs {&dst_mul_lt};
p.compile(&cp, lt_ins, lt_outs, engine);
test_tensor src_ts(src_lt, engine, src);
test_tensor dst_mul_ts(*lt_outs[0], engine, dst_mul);
cp.execute(strm, {src_ts.get()}, {dst_mul_ts.get()});
strm->wait();
}
TEST(test_interpolate_execute, Interpolate3PostOps) {
graph::engine_t *engine = get_engine();
graph::stream_t *strm = get_stream();
std::vector<float> src {-2.0, -1.5, -1.0, -0.5};
std::vector<float> src_div {1.0, -1.0, -1.0, -1.5, 2.0, 3.0, 4.0, 5.0, 6.0};
std::vector<float> dst_div(9, 1.0);
graph::op_t interpolate_node(0, graph::op_kind::Interpolate, "interpolate");
interpolate_node.set_attr<std::string>(graph::op_attr::mode, "nearest");
interpolate_node.set_attr(
graph::op_attr::sizes, std::vector<int64_t> {3, 3});
interpolate_node.set_attr<std::string>(
graph::op_attr::coordinate_transformation_mode, "half_pixel");
interpolate_node.set_attr<std::string>(graph::op_attr::data_format, "NCX");
graph::op_t relu_node(1, graph::op_kind::ReLU, "relu_node");
graph::op_t sigmoid_node(2, graph::op_kind::Sigmoid, "sigmoid_node");
graph::op_t div_node(3, graph::op_kind::Divide, "div_node");
graph::logical_tensor_t src_lt = utils::logical_tensor_init(
0, {1, 1, 2, 2}, graph::data_type::f32);
graph::logical_tensor_t dst_lt = utils::logical_tensor_init(
1, graph::data_type::f32, graph::layout_type::strided);
graph::logical_tensor_t dst_relu_lt = utils::logical_tensor_init(2,
{1, 1, 3, 3}, graph::data_type::f32, graph::layout_type::strided);
graph::logical_tensor_t dst_sigmoid_lt = utils::logical_tensor_init(3,
{1, 1, 3, 3}, graph::data_type::f32, graph::layout_type::strided);
graph::logical_tensor_t src_div_lt = utils::logical_tensor_init(4,
{1, 1, 3, 3}, graph::data_type::f32, graph::layout_type::strided);
graph::logical_tensor_t dst_div_lt = utils::logical_tensor_init(5,
{1, 1, 3, 3}, graph::data_type::f32, graph::layout_type::strided);
interpolate_node.add_input(src_lt);
interpolate_node.add_output(dst_lt);
relu_node.add_input(dst_lt);
relu_node.add_output(dst_relu_lt);
sigmoid_node.add_input(dst_relu_lt);
sigmoid_node.add_output(dst_sigmoid_lt);
div_node.add_input(dst_sigmoid_lt);
div_node.add_input(src_div_lt);
div_node.add_output(dst_div_lt);
graph::graph_t g(engine->kind());
ASSERT_EQ(g.add_op(&interpolate_node), graph::status::success);
ASSERT_EQ(g.add_op(&relu_node), graph::status::success);
ASSERT_EQ(g.add_op(&sigmoid_node), graph::status::success);
ASSERT_EQ(g.add_op(&div_node), graph::status::success);
ASSERT_EQ(g.finalize(), graph::status::success);
ASSERT_EQ(g.num_ops(), 4U);
graph::pass::pass_base_ptr apass = get_pass("interpolate_post_ops_fusion");
apass->run(g);
ASSERT_EQ(g.get_num_partitions(), 1U);
auto part = g.get_partitions()[0];
ASSERT_TRUE(part != nullptr);
// compile
graph::partition_t p;
p.init(part);
graph::compiled_partition_t cp(p);
std::vector<const graph::logical_tensor_t *> lt_ins {&src_lt, &src_div_lt};
std::vector<const graph::logical_tensor_t *> lt_outs {&dst_div_lt};
p.compile(&cp, lt_ins, lt_outs, engine);
test_tensor src_ts(src_lt, engine, src);
test_tensor src_div_ts(src_div_lt, engine, src_div);
test_tensor dst_div_ts(dst_div_lt, engine, dst_div);
cp.execute(strm, {src_ts.get(), src_div_ts.get()}, {dst_div_ts.get()});
strm->wait();
}
TEST(test_interpolate_execute, InterpolatePostOps) {
graph::engine_t *engine = get_engine();
graph::stream_t *strm = get_stream();
const std::vector<graph::op_kind_t> supported_post_ops = {
graph::op_kind::Abs,
graph::op_kind::Clamp,
graph::op_kind::Elu,
graph::op_kind::Exp,
graph::op_kind::GELU,
graph::op_kind::HardSwish,
graph::op_kind::Log,
graph::op_kind::Sigmoid,
graph::op_kind::SoftPlus,
graph::op_kind::ReLU,
graph::op_kind::Round,
graph::op_kind::Sqrt,
graph::op_kind::Square,
graph::op_kind::Tanh,
graph::op_kind::Add,
graph::op_kind::Multiply,
graph::op_kind::Maximum,
graph::op_kind::Minimum,
graph::op_kind::Divide,
graph::op_kind::Subtract,
};
const std::vector<graph::op_kind_t> two_inputs_ops {
graph::op_kind::Multiply,
graph::op_kind::Add,
graph::op_kind::Maximum,
graph::op_kind::Minimum,
graph::op_kind::Divide,
graph::op_kind::Subtract,
};
for (const auto &post_op_kind : supported_post_ops) {
std::vector<float> src {-2.0, -1.5, -1.0, -0.5};
std::vector<float> src1 {
0.f, 0.5f, 1.f, 1.5f, 2.0f, 2.5f, 3.0f, 3.5f, 4.f};
std::vector<float> dst_add {
0.0, 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0};
graph::op_t interpolate_node(
0, graph::op_kind::Interpolate, "interpolate");
interpolate_node.set_attr<std::string>(graph::op_attr::mode, "nearest");
interpolate_node.set_attr(
graph::op_attr::sizes, std::vector<int64_t> {3, 3});
interpolate_node.set_attr<std::string>(
graph::op_attr::coordinate_transformation_mode, "half_pixel");
interpolate_node.set_attr<std::string>(
graph::op_attr::data_format, "NCX");
graph::op_t post_node(1, post_op_kind, "post_op_node");
if (post_op_kind == graph::op_kind::Elu) {
post_node.set_attr<float>(graph::op_attr::alpha, 1.0f);
} else if (post_op_kind == graph::op_kind::Clamp) {
post_node.set_attr<float>(graph::op_attr::min, 1.0f);
post_node.set_attr<float>(graph::op_attr::max, 3.0f);
}
graph::logical_tensor_t src_lt = utils::logical_tensor_init(
0, {1, 1, 2, 2}, graph::data_type::f32);
graph::logical_tensor_t dst_lt = utils::logical_tensor_init(
1, graph::data_type::f32, graph::layout_type::strided);
graph::logical_tensor_t src1_lt
= utils::logical_tensor_init(2, {1, 1, 3, 3},
graph::data_type::f32, graph::layout_type::strided);
graph::logical_tensor_t dst_post_lt
= utils::logical_tensor_init(3, {1, 1, 3, 3},
graph::data_type::f32, graph::layout_type::strided);
interpolate_node.add_input(src_lt);
interpolate_node.add_output(dst_lt);
post_node.add_input(dst_lt);
if (std::find(
two_inputs_ops.begin(), two_inputs_ops.end(), post_op_kind)
!= two_inputs_ops.end()) {
post_node.add_input(src1_lt);
}
post_node.add_output(dst_post_lt);
graph::graph_t g(engine->kind());
g.add_op(&interpolate_node);
g.add_op(&post_node);
g.finalize();
graph::pass::pass_base_ptr apass
= get_pass("interpolate_post_ops_fusion");
apass->run(g);
ASSERT_EQ(g.get_num_partitions(), 1U);
auto part = g.get_partitions()[0];
ASSERT_TRUE(part != nullptr);
// compile
graph::partition_t p;
p.init(part);
graph::compiled_partition_t cp(p);
std::vector<const graph::logical_tensor_t *> lt_ins {&src_lt};
if (std::find(
two_inputs_ops.begin(), two_inputs_ops.end(), post_op_kind)
!= two_inputs_ops.end()) {
lt_ins.emplace_back(&src1_lt);
}
std::vector<const graph::logical_tensor_t *> lt_outs {&dst_post_lt};
p.compile(&cp, lt_ins, lt_outs, engine);
test_tensor src_ts(src_lt, engine, src);
test_tensor src1_ts(src1_lt, engine, src1);
test_tensor dst_add_ts(*lt_outs[0], engine, dst_add);
if (std::find(
two_inputs_ops.begin(), two_inputs_ops.end(), post_op_kind)
!= two_inputs_ops.end()) {
cp.execute(strm, {src_ts.get(), src1_ts.get()}, {dst_add_ts.get()});
} else {
cp.execute(strm, {src_ts.get()}, {dst_add_ts.get()});
}
strm->wait();
}
}
TEST(test_interpolate_execute, InterpolateForwardLinear) {
graph::engine_t *engine = get_engine();
graph::stream_t *strm = get_stream();
std::vector<float> src {-2.0, -1.5, -1.0, -0.5};
std::vector<float> dst {0.0, 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0};
std::vector<float> ref_dst {
-2.f, -1.75f, -1.5f, -1.5f, -1.25f, -1.f, -1.f, -0.75f, -0.5f};
graph::op_t op(graph::op_kind::Interpolate);
op.set_attr<std::string>(graph::op_attr::mode, "linear");
op.set_attr(graph::op_attr::sizes, std::vector<int64_t> {3, 3});
op.set_attr<std::string>(
graph::op_attr::coordinate_transformation_mode, "half_pixel");
op.set_attr<std::string>(graph::op_attr::data_format, "NXC");
graph::logical_tensor_t src_lt = utils::logical_tensor_init(
0, {1, 2, 2, 1}, graph::data_type::f32);
graph::logical_tensor_t dst_lt = utils::logical_tensor_init(
1, graph::data_type::f32, graph::layout_type::strided);
op.add_input(src_lt);
op.add_output(dst_lt);
graph::graph_t g(engine->kind());
g.add_op(&op);
g.finalize();
graph::pass::pass_base_ptr apass = get_pass("interpolate_pass");
apass->run(g);
ASSERT_EQ(g.get_num_partitions(), 1U);
auto part = g.get_partitions()[0];
ASSERT_TRUE(part != nullptr);
// compile
graph::partition_t p;
p.init(part);
graph::compiled_partition_t cp(p);
std::vector<const graph::logical_tensor_t *> lt_ins {&src_lt};
std::vector<const graph::logical_tensor_t *> lt_outs {&dst_lt};
p.compile(&cp, lt_ins, lt_outs, engine);
graph::logical_tensor_t dst_lt_tmp;
cp.query_logical_tensor(dst_lt.id, &dst_lt_tmp);
test_tensor src_ts(src_lt, engine, src);
test_tensor dst_ts(dst_lt_tmp, engine, dst);
cp.execute(strm, {src_ts.get()}, {dst_ts.get()});
strm->wait();
dst = dst_ts.as_vec_type<float>();
for (size_t i = 0; i < dst.size(); ++i) {
ASSERT_FLOAT_EQ(dst[i], ref_dst[i]);
}
}
TEST(test_interpolate_execute, InterpolateBackwardNearest) {
graph::engine_t *eng = get_engine();
std::vector<float> src {-2.0, -1.5, -1.0, -0.5};
std::vector<float> diff_dst {0.0, 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0};
std::vector<float> diff_src {0.0, 0.0, 0.0, 0.0};
std::vector<float> ref_diff_src {0.f, 3.f, 9.f, 24.f};
graph::op_t op(graph::op_kind::InterpolateBackward);
op.set_attr(graph::op_attr::sizes, std::vector<int64_t> {3, 3});
op.set_attr<std::string>(graph::op_attr::mode, "nearest");
op.set_attr<std::string>(graph::op_attr::data_format, "NCX");
graph::logical_tensor_t diff_dst_lt = utils::logical_tensor_init(
0, {1, 1, 3, 3}, graph::data_type::f32);
graph::logical_tensor_t src_lt = utils::logical_tensor_init(
1, {1, 1, 2, 2}, graph::data_type::f32);
graph::logical_tensor_t diff_src_lt = utils::logical_tensor_init(2,
{1, 1, 2, 2}, graph::data_type::f32, graph::layout_type::strided);
op.add_input(src_lt);
op.add_input(diff_dst_lt);
op.add_output(diff_src_lt);
graph::graph_t g(eng->kind());
g.add_op(&op);
g.finalize();
graph::pass::pass_base_ptr apass = get_pass("interpolate_bwd_pass");
apass->run(g);
ASSERT_EQ(g.get_num_partitions(), 1U);
auto part = g.get_partitions()[0];
graph::partition_t p;
p.init(part);
graph::compiled_partition_t cp(p);
std::vector<const graph::logical_tensor_t *> inputs {&src_lt, &diff_dst_lt};
std::vector<const graph::logical_tensor_t *> outputs {&diff_src_lt};
ASSERT_EQ(p.compile(&cp, inputs, outputs, eng), graph::status::success);
test_tensor src_ts(src_lt, eng, src);
test_tensor diff_dst_ts(diff_dst_lt, eng, diff_dst);
test_tensor diff_src_ts(diff_src_lt, eng, diff_src);
graph::stream_t *strm = get_stream();
cp.execute(strm, {src_ts.get(), diff_dst_ts.get()}, {diff_src_ts.get()});
strm->wait();
diff_src = diff_src_ts.as_vec_type<float>();
for (size_t i = 0; i < diff_src.size(); ++i) {
ASSERT_FLOAT_EQ(diff_src[i], ref_diff_src[i]);
}
}
TEST(test_interpolate_execute, InterpolateBackwardLinear) {
graph::engine_t *eng = get_engine();
std::vector<float> src {-2.0, -1.5, -1.0, -0.5};
std::vector<float> diff_dst {0.0, 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0};
std::vector<float> diff_src {0.0, 0.0, 0.0, 0.0};
std::vector<float> ref_diff_src {3.f, 6.f, 12.f, 15.f};
graph::op_t op(graph::op_kind::InterpolateBackward);
op.set_attr(graph::op_attr::sizes, std::vector<int64_t> {3, 3});
op.set_attr<std::string>(graph::op_attr::mode, "bilinear");
op.set_attr<std::string>(graph::op_attr::data_format, "NCX");
graph::logical_tensor_t diff_dst_lt = utils::logical_tensor_init(
0, {1, 1, 3, 3}, graph::data_type::f32);
graph::logical_tensor_t src_lt = utils::logical_tensor_init(
1, {1, 1, 2, 2}, graph::data_type::f32);
graph::logical_tensor_t diff_src_lt = utils::logical_tensor_init(2,
{1, 1, 2, 2}, graph::data_type::f32, graph::layout_type::strided);
op.add_input(src_lt);
op.add_input(diff_dst_lt);
op.add_output(diff_src_lt);
graph::graph_t g(eng->kind());
g.add_op(&op);
g.finalize();
graph::pass::pass_base_ptr apass = get_pass("interpolate_bwd_pass");
apass->run(g);
ASSERT_EQ(g.get_num_partitions(), 1U);
auto part = g.get_partitions()[0];
graph::partition_t p;
p.init(part);
graph::compiled_partition_t cp(p);
std::vector<const graph::logical_tensor_t *> inputs {&src_lt, &diff_dst_lt};
std::vector<const graph::logical_tensor_t *> outputs {&diff_src_lt};
ASSERT_EQ(p.compile(&cp, inputs, outputs, eng), graph::status::success);
test_tensor src_ts(src_lt, eng, src);
test_tensor diff_dst_ts(diff_dst_lt, eng, diff_dst);
test_tensor diff_src_ts(diff_src_lt, eng, diff_src);
graph::stream_t *strm = get_stream();
cp.execute(strm, {src_ts.get(), diff_dst_ts.get()}, {diff_src_ts.get()});
strm->wait();
diff_src = diff_src_ts.as_vec_type<float>();
for (size_t i = 0; i < diff_src.size(); ++i) {
ASSERT_FLOAT_EQ(diff_src[i], ref_diff_src[i]);
}
}
```
|
The Colden Family Cemetery (also known as Colden Cemetery) is a Registered Historic Place in the Town of Montgomery in Orange County, New York, United States. It is located off Maple Avenue south of NY 17K, surrounded by a small stone wall.
It was established in the 1780s by the descendants of area resident Cadwallader Colden, one of the last colonial governors of New York. The ruins of the family home are at the junction of 17K and NY 747, approximately a mile (1.6 km) to the northeast. While Colden himself is buried another private cemetery in the Queens community of Flushing where he died, a tablet was erected in his memory at the entrance. Many of his progeny are here, along with some of the family's slaves and members of other families. The earliest grave is that of his last wife Elizabeth, who died in 1782. The most recent grave is that of Anna Colden Harris, who died in 1937.
The cemetery was added to the National Register of Historic Places in 2005.
See also
List of cemeteries in New York
National Register of Historic Places listings in Orange County, New York
References
External links
Listing of graves at interment.net
Cemeteries in Orange County, New York
National Register of Historic Places in Orange County, New York
Cemeteries on the National Register of Historic Places in New York (state)
1782 establishments in New York (state)
Cemeteries established in the 1780s
|
The Rybinskian Gorizont ("Rybinskian Horizon") is a Lower Triassic biostratigraphic unit in Western Russia. It is a part of the Vetlugian Supergorizont and corresponds to the earliest part of the Olenekian stage, lying above the late Induan-age Zaplavnian Horizon and below the Sludkian Gorizont. The Rybinskian Gorizont is sometimes known as the Benthosuchus fauna, due to abundant fossils of Benthosuchus, a temnospondyl amphibian index fossil. Related amphibians such as Thoosuchus also increase in abundance, and the interval additionally hosts the oldest fossils of procolophonines and putative true archosaurs in the region.
The Rybinskian is exposed in several svitas (equivalent to geological formations) spread out over a wide area: the type assemblage is the Rybinskaya Svita in the Moscow Syncline, and another is the Staritskya Svita in the Southern Urals area.
References
Geologic formations of Russia
Triassic System of Europe
Triassic Russia
Olenekian Stage
Paleontology in Russia
|
This is a list of electoral results for the electoral district of Forrestfield in Western Australian state elections.
Members for Forrestfield
Election results
Elections in the 2020s
Elections in the 2010s
Elections in the 2000s
References
Western Australian state electoral results by district
|
Dawn Jeannine Wright (born April 15, 1961) is an American geographer and oceanographer. She is a leading authority in the application of geographic information system (GIS) technology to the field of ocean and coastal science, and played a key role in creating the first GIS data model for the oceans. Wright is Chief Scientist of the Environmental Systems Research Institute (aka Esri). She has also been a professor of geography and oceanography at Oregon State University since 1995 and is a former Oregon Professor of the Year as named by the Council for the Advancement and Support of Education and the Carnegie Foundation for the Advancement of Teaching. Wright was the first African-American female to dive to the ocean floor in the deep submersible ALVIN. On July 12, 2022 she became the first and only Black person to dive to Challenger Deep, the deepest point on Earth, and to successfully operate a sidescan sonar at full-ocean depth.
Education
Wright earned a Bachelor of Science cum laude in geology from Wheaton College in 1983, a Master of Science in oceanography from Texas A&M University in 1986, and an Individual Interdisciplinary Ph.D. in Physical Geography and Marine Geology from University of California, Santa Barbara in 1994. In 2007 she received a Distinguished Alumna Award from UCSB and was also a UCSB College of Letters and Science commencement speaker.
Career
Wright's research interests are mapping of seafloor spreading zones and coral reefs, spatial analysis and geographic information systems as applied to the marine environment. She co-edited one of the first books on marine GIS and is widely known as one of the most influential researchers in this area. Another influential work was a 1997 article widely cited for its analysis of the perception of GIS among geographers in the early 1990s.
Wright began her career as a seagoing marine technician for the Ocean Drilling Program, sailing on ten 2-month expeditions from 1986 to 1989 aboard the JOIDES Resolution, mostly throughout the Indian and Pacific Oceans. Her most prominent service has included the National Academy of Sciences Ocean Studies Board, the Science Advisory Board of NOAA, the Science Advisory Board of the EPA, the National Council of the American Association of Geographers, and Research Chair and Board Member of the University Consortium for Geographic Information Science. A strong advocate of STEM as well as science communication, she has been profiled by outlets such as Women Oceanographers.org, The Oceanography Society, The Atlantic, NOAA's Sea Grant Program, NOAA's National Marine Sanctuaries Program, Science magazine, Harvard Design magazine, Environment, Coastal & Offshore (ECO) magazine, The HistoryMakers, Let Science Speak, COMPASS Blogs, Ensia, Nature News, BBC radio and a host of student projects (e.g.,).
Wright is member of a number of Editorial boards including GigaScience, Geography Compass, Journal of Coastal Conservation, The Anthropocene Review, Annals of the American Association of Geographers, International Journal of Geographical Information Science, Marine Geodesy, and Transactions in GIS.
In 2018, Wright appeared in the Tribeca Film Festival in the short film series "Let Science Speak."
Awards and honors
Wright is an elected member of the National Academy of Sciences, the National Academy of Engineering and the American Academy of Arts and Sciences, a fellow of the American Association for the Advancement of Science and of the Aldo Leopold Leadership Program. Other honors include:
Fellow, The Oceanography Society, 2020
Geosciences Innovator Award, Texas A&M University College of Geosciences, 2019
Fellow of the California Academy of Sciences, 2018
Steinbach Visiting Scholar (at-large), MIT/WHOI Joint Program in Oceanography/Applied Ocean Science & Engineering, 2018
18th Roger Revelle Commemorative Lecturer, National Academy of Sciences Ocean Studies Board, 2017
Fellow of the Geological Society of America, 2016
Randolph W. “Bill” and Cecile T. Bromery Award for Minorities, Geological Society of America, 2015
Leptoukh Lecture Award, Earth and Space Science Informatics Focus Group, American Geophysical Union (AGU), 2015
Distinguished Teaching Honors, Association of American Geographers (now the American Association of Geographers), 2013
Presidential Achievement Award, Association of American Geographers (now the American Association of Geographers), 2012
Milton Harris Award for Excellence in Basic Research, OSU College of Science, 2005
NSF CAREER Award, 1995
Selected publications
Wright has authored nearly 100 peer-reviewed journal articles and 12 books. A selection is listed here.
Diversity and inclusion
Wright is a member of the American Geophysical Union's Diversity and Inclusion Advisory Committee. She is also a supporter and participant in the Black in Marine Science organization.
See also
List of people who descended to Challenger Deep
References
External links
Dawn Wright's homepage
Esri and the Science Community
Dawn Wright Wakelet
Dawn Wright Oral History Interview
Let Science Speak - Dr. Dawn Wright
20th-century African-American scientists
20th-century African-American women
20th-century American geologists
20th-century American women scientists
21st-century American geologists
21st-century American scientists
21st-century American women scientists
21st-century African-American scientists
21st-century African-American women
1961 births
African-American women scientists
American geographers
American oceanographers
American women geologists
Living people
Fellows of the American Association for the Advancement of Science
Members of the United States National Academy of Sciences
Texas A&M University alumni
University of California, Santa Barbara alumni
Wheaton College (Illinois) alumni
Women oceanographers
|
James MacKillop (born May 31, 1939, Pontiac, Michigan) is an American professor and scholar of Celtic and Irish studies and an arts journalist A child of Gaelic-speaking Highland emigrants, he is also a near relative of St Mary MacKillop of Australia (1842-1909).
Early life and education
MacKillop was raised in Southeast Michigan and attended the University of Detroit High School and Wayne State University (BA, MA in English). At Wayne he wrote for the Daily Collegian and captained the university team on the GE College Bowl television program. He received a Ph.D. from Syracuse University and was a visiting fellow in Celtic Languages at Harvard University. He has lived in Upstate New York since the late sixties.
Career
MacKillop taught for more than forty years at various universities. Appointments include Michigan Technological University,
Onondaga Community College, State University of New York College at Cortland and the S. I. Newhouse School of Public Communications. He also held a year's appointment as Professeur Invité at the University of Rennes 1 in France. He was awarded the SUNY Chancellor's Award for Excellence..
MacKillop has published nine books, dozens of scholarly articles, and thousands of newspaper items. His best-known book is probably The Dictionary of Celtic Mythology (Oxford), once the top seller in Celtic scholarship. Myth & Legends of the Celts (Penguin) is widely cited. His Irish Literature: A Reader (Syracuse), with Maureen Murphy is frequently used in university Irish literature courses. Speaking of Words (Holt, Rinehart) was co-edited with Donna Woolfolk Cross, later author of the international best-seller Pope Joan (Crown). Writing for newspapers since college years, MacKillop has been most associated with the Syracuse New Times , where he has been the drama critic for decades, winning the Syracuse Press Club Award for criticism sixteen times.
Joining as a graduate student, MacKillop has long been active in the American Conference for Irish Studies (ACIS), serving on the executive committee for ten years, organizing three national conventions (Syracuse, 1989; Belfast-Queens U., 1995; Albany, 1997), and serving as president, 1995–97.
Awards
National Endowment for the Humanities, Fellowship for Independent Study
SUNY Chancellor's Award for Excellence in Teaching
Appointed Professeur Invité, Université de Rennes, d’Haute Bretagne
Syracuse Press Club Award for Criticism, sixteen times
Publications
Books
With Donna Woolfolk Cross, Speaking of Words: A Language Reader New York: Holt, Rinehart & Winston, 1978, 1982, 1986
With Thomas Friedmann,The Copy Book New York: Holt, Rinehart & Winston, 1980
Fionn mac Cumhaill: Celtic Myth in English Literature Syracuse: Syracuse University Press, 1986, 2001
With Maureen O'Rourke Murphy, Irish Literature: A Reader Syracuse: Syracuse University Press, 1987. Revised as An Irish Literature Reader. Syracuse: Syracuse University Press, 2005
Dictionary of Celtic Mythology Oxford: Oxford University Press, 1998
Contemporary Irish Cinema: From the Quiet Man to Dancing at Lughnasa Syracuse: Syracuse University Press, 1999
Myths and Legends of the Celts London: Penguin Books, 2005
Unauthorized History of the American Conference for Irish Studies 2012
“The Rebels” and Selected Short Fiction by Richard Power Syracuse: Syracuse University Press, 2018
Articles (selected)
A Primer of Irish Numbers, Irish Spirit, ed. Patricia Monaghan. Dublin: Wolfhound Press, 2001. .
Politics and Spelling Irish, or Thirteen Ways of Looking at ‘Banshee’, Canadian Journal of Irish Studies, 27, no. 2 (Dec., 1991), 93–102.
Fitzgerald's Gatsby: Star of Stag and Screen, The Recorder: A Journal of the American Irish Historical Society, 3, no. 2 (Winter, 1989), 76–88.
Fionn mac Cumhaill, Our Contemporary, Mythe et folklore celtiques et leurs expressions littéraires en Irlande, ed. R. Alluin et B. Esbarbelt. Lille, Fr: Université de Lille, 1986 (1988). .
The Quiet Man Speaks, Working Papers in Irish Studies [Northeastern University, Boston], 87-2/3 (Spring, 1987), 32–44.
Meville's Bartleby on Film, American Short Stories on Film, ed. E. Alsen. Munich: Langenscheidt-Longman, 1986. .
Ireland and the Movies: From the Volta Cinema to RTÉ, Éire-Ireland, 18, no. 3 (Summer, 1984), 7-22.
The Hungry Grass: Richard Power's Pastoral Elegy, Éire-Ireland, 18, no. 3 (Fall, 1983), 86–99.
Yeats, Joyce and the Irish Language, Éire-Ireland, 15, no. 1 (Spring, 1980), 138–148.
Finn MacCool: The Hero and the Anti-Hero, Views of the Irish Peasantry, 1800-1916, ed. D. Casey and R. E. Rhodes. Hamden, Ct: Archon Books, 1977. .
Ulster Violence in Fiction, Conflict in Ireland, ed. E. A. Sullivan and H. A. Wilson. Gainesville: University of Florida, Department of Behavioral Studies, 1976. .
Yeats and the Gaelic Muse, Antigonish Review, no. 11 (Autumn, 1972), 96–109.
References
External links
1939 births
Living people
People from Pontiac, Michigan
Wayne State University alumni
Syracuse University alumni
Celtic studies scholars
|
```java
package org.eclipse.milo.opcua.sdk.client.model.types.variables;
import java.util.concurrent.CompletableFuture;
import org.eclipse.milo.opcua.stack.core.UaException;
import org.eclipse.milo.opcua.stack.core.types.builtin.StatusCode;
import org.eclipse.milo.opcua.stack.core.types.structured.SamplingIntervalDiagnosticsDataType;
public interface SamplingIntervalDiagnosticsArrayType extends BaseDataVariableType {
/**
* Get the local value of the SamplingIntervalDiagnostics Node.
* <p>
* The returned value is the last seen; it is not read live from the server.
*
* @return the local value of the SamplingIntervalDiagnostics Node.
* @throws UaException if an error occurs creating or getting the SamplingIntervalDiagnostics Node.
*/
SamplingIntervalDiagnosticsDataType getSamplingIntervalDiagnostics() throws UaException;
/**
* Set the local value of the SamplingIntervalDiagnostics Node.
* <p>
* The value is only updated locally; it is not written to the server.
*
* @param samplingIntervalDiagnostics the local value to set for the SamplingIntervalDiagnostics Node.
* @throws UaException if an error occurs creating or getting the SamplingIntervalDiagnostics Node.
*/
void setSamplingIntervalDiagnostics(
SamplingIntervalDiagnosticsDataType samplingIntervalDiagnostics) throws UaException;
/**
* Read the value of the SamplingIntervalDiagnostics Node from the server and update the local value if the
* operation succeeds.
*
* @return the {@link SamplingIntervalDiagnosticsDataType} value read from the server.
* @throws UaException if a service- or operation-level error occurs.
*/
SamplingIntervalDiagnosticsDataType readSamplingIntervalDiagnostics() throws UaException;
/**
* Write a new value for the SamplingIntervalDiagnostics Node to the server and update the local value if
* the operation succeeds.
*
* @param samplingIntervalDiagnostics the {@link SamplingIntervalDiagnosticsDataType} value to write to the server.
* @throws UaException if a service- or operation-level error occurs.
*/
void writeSamplingIntervalDiagnostics(
SamplingIntervalDiagnosticsDataType samplingIntervalDiagnostics) throws UaException;
/**
* An asynchronous implementation of {@link #readSamplingIntervalDiagnostics()}.
*
* @return a CompletableFuture that completes successfully with the property value or completes
* exceptionally if an operation- or service-level error occurs.
*/
CompletableFuture<? extends SamplingIntervalDiagnosticsDataType> readSamplingIntervalDiagnosticsAsync(
);
/**
* An asynchronous implementation of {@link #writeSamplingIntervalDiagnostics(SamplingIntervalDiagnosticsDataType)}.
*
* @return a CompletableFuture that completes successfully with the operation result or
* completes exceptionally if a service-level error occurs.
*/
CompletableFuture<StatusCode> writeSamplingIntervalDiagnosticsAsync(
SamplingIntervalDiagnosticsDataType samplingIntervalDiagnostics);
/**
* Get the SamplingIntervalDiagnostics {@link SamplingIntervalDiagnosticsType} Node, or {@code null} if it does not exist.
* <p>
* The Node is created when first accessed and cached for subsequent calls.
*
* @return the SamplingIntervalDiagnostics {@link SamplingIntervalDiagnosticsType} Node, or {@code null} if it does not exist.
* @throws UaException if an error occurs creating or getting the Node.
*/
SamplingIntervalDiagnosticsType getSamplingIntervalDiagnosticsNode() throws UaException;
/**
* Asynchronous implementation of {@link #getSamplingIntervalDiagnosticsNode()}.
*
* @return a CompletableFuture that completes successfully with the
* ? extends SamplingIntervalDiagnosticsType Node or completes exceptionally if an error occurs
* creating or getting the Node.
*/
CompletableFuture<? extends SamplingIntervalDiagnosticsType> getSamplingIntervalDiagnosticsNodeAsync(
);
}
```
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.