text
stringlengths 1
22.8M
|
|---|
```go
package vm
import "bytes"
func opInvert(vm *virtualMachine) error {
err := vm.applyCost(1)
if err != nil {
return err
}
top, err := vm.top()
if err != nil {
return err
}
err = vm.applyCost(int64(len(top)))
if err != nil {
return err
}
// Could rewrite top in place but maybe it's a shared data
// structure?
newTop := make([]byte, 0, len(top))
for _, b := range top {
newTop = append(newTop, ^b)
}
vm.dataStack[len(vm.dataStack)-1] = newTop
return nil
}
func opAnd(vm *virtualMachine) error {
err := vm.applyCost(1)
if err != nil {
return err
}
b, err := vm.pop(true)
if err != nil {
return err
}
a, err := vm.pop(true)
if err != nil {
return err
}
min, max := len(a), len(b)
if min > max {
min, max = max, min
}
err = vm.applyCost(int64(min))
if err != nil {
return err
}
res := make([]byte, 0, min)
for i := 0; i < min; i++ {
res = append(res, a[i]&b[i])
}
return vm.push(res, true)
}
func opOr(vm *virtualMachine) error {
return doOr(vm, false)
}
func opXor(vm *virtualMachine) error {
return doOr(vm, true)
}
func doOr(vm *virtualMachine, xor bool) error {
err := vm.applyCost(1)
if err != nil {
return err
}
b, err := vm.pop(true)
if err != nil {
return err
}
a, err := vm.pop(true)
if err != nil {
return err
}
min, max := len(a), len(b)
if min > max {
min, max = max, min
}
err = vm.applyCost(int64(max))
if err != nil {
return err
}
res := make([]byte, 0, max)
for i := 0; i < max; i++ {
var aByte, bByte, resByte byte
if i >= len(a) {
aByte = 0
} else {
aByte = a[i]
}
if i >= len(b) {
bByte = 0
} else {
bByte = b[i]
}
if xor {
resByte = aByte ^ bByte
} else {
resByte = aByte | bByte
}
res = append(res, resByte)
}
return vm.push(res, true)
}
func opEqual(vm *virtualMachine) error {
res, err := doEqual(vm)
if err != nil {
return err
}
return vm.pushBool(res, true)
}
func opEqualVerify(vm *virtualMachine) error {
res, err := doEqual(vm)
if err != nil {
return err
}
if res {
return nil
}
return ErrVerifyFailed
}
func doEqual(vm *virtualMachine) (bool, error) {
err := vm.applyCost(1)
if err != nil {
return false, err
}
b, err := vm.pop(true)
if err != nil {
return false, err
}
a, err := vm.pop(true)
if err != nil {
return false, err
}
min, max := len(a), len(b)
if min > max {
min, max = max, min
}
err = vm.applyCost(int64(min))
if err != nil {
return false, err
}
return bytes.Equal(a, b), nil
}
```
|
```php
<?php
/**
* FecShop file.
*
* @link path_to_url
* @license path_to_url
*/
namespace fecshop\app\console\modules\Category;
use fecshop\app\console\modules\ConsoleModule;
/**
* @author Terry Zhao <2358269014@qq.com>
* @since 1.0
*/
class Module extends ConsoleModule
{
public $blockNamespace;
public function init()
{
parent::init();
//
$nameSpace = __NAMESPACE__;
$this->controllerNamespace = $nameSpace . '\\controllers';
$this->blockNamespace = $nameSpace . '\\block';
}
}
```
|
```viml
"======================================================================
"
" utils.vim -
"
" Created by skywind on 2021/12/15
" Last Modified: 2021/12/15 06:33:42
"
"======================================================================
" vim: set ts=4 sw=4 tw=78 noet :
your_sha256_hash------
" internal
your_sha256_hash------
let s:windows = has('win32') || has('win95') || has('win64') || has('win16')
your_sha256_hash------
" output msg
your_sha256_hash------
function! asyncrun#utils#errmsg(msg)
redraw
echohl ErrorMsg
echom 'ERROR: ' . a:msg
echohl NONE
return 0
endfunc
your_sha256_hash------
" strip string
your_sha256_hash------
function! asyncrun#utils#strip(text)
return substitute(a:text, '^\s*\(.\{-}\)\s*$', '\1', '')
endfunc
your_sha256_hash------
" Replace string
your_sha256_hash------
function! asyncrun#utils#replace(text, old, new)
let l:data = split(a:text, a:old, 1)
return join(l:data, a:new)
endfunc
your_sha256_hash------
" display require message
your_sha256_hash------
function! asyncrun#utils#require(what)
call asyncrun#utils#errmsg('require: ' . a:what . ' ')
endfunc
your_sha256_hash------
" shellescape
your_sha256_hash------
function! asyncrun#utils#shellescape(...) abort
let args = []
for arg in a:000
if arg =~# '^[A-Za-z0-9_/.-]\+$'
let args += [arg]
elseif &shell =~# 'c\@<!sh'
let args += [substitute(shellescape(arg), '\\\n', '\n', 'g')]
else
let args += [shellescape(arg)]
endif
endfor
return join(args, ' ')
endfunction
your_sha256_hash------
" tempname
your_sha256_hash------
function! asyncrun#utils#tempname() abort
let temp = tempname()
if has('win32')
return fnamemodify(fnamemodify(temp, ':h'), ':p').fnamemodify(temp, ':t')
endif
return temp
endfunction
your_sha256_hash------
" isolate environ
your_sha256_hash------
function! asyncrun#utils#isolate(request, keep, ...) abort
let keep = ['SHELL', 'HOME'] + a:keep
let command = ['cd ' . shellescape(getcwd())]
for line in split(system('env'), "\n")
let var = matchstr(line, '^\w\+\ze=')
if !empty(var) && var !~# '^\%(_\|SHLVL\|PWD\|VIM\|VIMRUNTIME\|MYG\=VIMRC\)$' && index(keep, var) < 0
if &shell =~# 'csh'
let command += split('setenv '.var.' '.shellescape(eval('$'.var)), "\n")
else
let command += split('export '.var.'='.asyncrun#utils#shellescape(eval('$'.var)), "\n")
endif
endif
endfor
for cmd in a:000
if type(cmd) == type('')
let command += [cmd]
elseif type(cmd) == type(0)
let command += [cmd]
elseif type(cmd) == type([])
let command += cmd
endif
endfor
let temp = type(a:request) == type({}) ? a:request.file . '.script' : asyncrun#utils#tempname()
call writefile(command, temp)
return 'env -i ' . join(map(copy(keep), 'v:val."=". asyncrun#utils#shellescape(eval("$".v:val))." "'), '') . &shell . ' ' . temp
endfunction
your_sha256_hash------
" set title
your_sha256_hash------
function! asyncrun#utils#set_title(title, expanded)
return asyncrun#utils#shellescape('printf',
\ '\033]1;%s\007\033]2;%s\007',
\ a:title, a:expanded)
endfunction
your_sha256_hash------
" try to open quickfix
your_sha256_hash------
function! asyncrun#utils#quickfix_request()
let height = get(g:, "asyncrun_open", 0)
if height > 0
call asyncrun#quickfix_toggle(height, 1)
endif
endfunc
your_sha256_hash------
" compare path
your_sha256_hash------
function! asyncrun#utils#path_equal(path1, path2) abort
let p1 = fnamemodify(a:path1, ':p')
let p2 = fnamemodify(a:path2, ':p')
if has('win32') || has('win16') || has('win64') || has('win95')
let p1 = tolower(substitute(p1, '\/', '\\', 'g'))
let p2 = tolower(substitute(p2, '\/', '\\', 'g'))
else
let p1 = substitute(p1, '\\', '\/', 'g')
let p2 = substitute(p2, '\\', '\/', 'g')
endif
return (p1 == p2)? 1 : 0
endfunc
```
|
The twenty-eighth season of Saturday Night Live, an American sketch comedy series, originally aired in the United States on NBC between October 5, 2002 and May 17, 2003.
Cast
Repertory players
Rachel Dratch
Jimmy Fallon
Tina Fey
Darrell Hammond
Chris Kattan
Tracy Morgan
Chris Parnell
Amy Poehler
Maya Rudolph
Horatio Sanz
Featured players
Fred Armisen
Dean Edwards
Will Forte
Seth Meyers
Jeff Richards
bold denotes Weekend Update anchor
Writers
Episodes
Specials
References
28
Saturday Night Live in the 2000s
2002 American television seasons
2003 American television seasons
Television shows directed by Beth McCarthy-Miller
|
The Hong Kong Jockey Club Champion Awards are given annually by the Hong Kong Jockey Club (HKJC) to the outstanding horses and people in Hong Kong Thoroughbred horse racing.
The most prestigious award for horses is Hong Kong Horse of the Year.
The equivalent in Australia is the Australian Thoroughbred racing awards, in Canada the Sovereign Awards, in the United States the Eclipse Awards, in Japan the JRA Awards and in Europe, the Cartier Racing Awards.
Current awards:
Hong Kong Horse of the Year
Hong Kong Most Popular Horse of the Year
Hong Kong Champion Sprinter
Hong Kong Champion Miler
Hong Kong Champion Middle-distance Horse
Hong Kong Champion Stayer
Hong Kong Champion Griffin
Hong Kong Most Improved Horse
References
Hong Kong Jockey Club News Archive
Horse racing awards
Horse racing in Hong Kong
zh:冠軍人馬獎
|
Deerwalk Institute of Technology provides extensive undergraduate programs, namely the Bachelor of Science in Computer Application and Information Technology (B.Sc.CSIT) and the Bachelor of Computer Applications (BCA). These programs are affiliated with Tribhuvan University.
History
Deerwalk Institute of Technology was founded by Rudra Raj Pandey in 2010. It was first established collaboration between Nepalese entrepreneurs and the US-based software company, Deerwalk Inc.
The first batch had a total of eight students.
Buildings and Infrastructure
The DWIT campus is situated in Sifal, Kathmandu. With lavish gardens, large and extended campus area, and canteen in its front yard, DWIT is spread over 11 ropanis campus. The top-floor of the main building is occupied by Sagarmatha Hall where all the major sessions are held. It is a spacious establishment with a capacity of over 250 people.
Library
DWIT Library consists of a significant number of books related to Computer Science. It is solely handled by Students interns at DWIT.
All of the library transactions are done using Gyansangalo, DWIT's Library Management System.
Cafeteria
The DWIT cafeteria is situated at the front yard of the DWIT building. An online portal, Canteen Management System is used to carry out the canteen transactions.
All members associated with DWIT can login into the system using their respective dwit emails and order the food from a range of food options.
Well Equipped Classrooms
All the classrooms in DWIT have access to internet, TV, well maintained tables and chairs.
Academics
DWIT offers Bachelors of Science in Computer Science and Information Technology (B. Sc. CSIT) and Bachelor in Computer Application (BCA) run under the curriculum of Tribhuvan University. These are among the comprehensive computer science courses offered by Tribhuvan University. The four-year course is categorized into two domains – Computer Science and Mathematics. In the first three-semester the course mainly consists of mathematics and basic programming concepts. In the latter semesters, the course progresses towards computational theory and artificial intelligence.
Student life
The students in DWIT come from different cities and towns of Nepal.
Clubs and activities
There are twelve student-run clubs in DWIT, considered and established by students solely. Each club has a club president, a club vice-president, and five members at its core. Major activities and fundraising events are organized by the clubs.
Internship
Deerwalk Services
Deerwalk is a privately held company based in Lexington, Massachusetts, with over 300 employees worldwide, including a technology campus, DWIT. DWIT and Deerwalk Services occupy the same territory.
Deerwalk Compare Nepal
Deerwalk Compware is a subsidiary of Deerwalk Group and was founded in July 2017. It is the provider of IT consulting services, custom software development and IT products-distributor in Nepal.
Deerwalk Teaching Fellowship Program
In between 6th and 7th Semester, students of DWIT participate in a Deerwalk Teaching Fellowship Program. Deerwalk Institute of Technology has partnered with institutions like Edu Tech Nepal for this purpose.
Deerwalk Incubation Center
Deerwalk Incubation Center provides transitory and facilitative assistance to students who want to venture out with their own startups. Students are provided with basic office infrastructure and both legal and business counselling services.
Research
DWIT Research and Development Unit (R&D Unit)
The DWIT Research and Development (R&D) team is the innovative unit of DWIT. The goal of the team is typically to research new products and services and add to the DWIT facilities and the society. The students of DWIT work in this department as interns.
The major task of the team is the production of digital video classes. The video lectures are distributed for free by Deerwalk Learning Center. The videos are interactive learning resources for Grades 4-12, designed as per the curriculum prescribed by Curriculum Development Center. The videos have an estimated reach of more than 30 Lakhs in Nepal.
DWIT Incubation-center
DWIT provides a workplace for budding and neo-startups, known as the Incubation Center. It is a space given to student entrepreneurs to develop their businesses in the initial and transitional phases. The facility is provided until the start-ups are moderately stable.
Major Events
DWIT boasts of major events.
DWIT Job Fair - DWIT JOB FAIR is an annual event run by DWIT. The idea behind the fair is to bring together the IT Academia and IT industry in one common place providing a platform to directly interact with each other. In its first edition, DWIT JOB FAIR 2017, more than 20 different software companies participated in the event with over 1200 participants. This year we have 25+ companies participating in the event. More than 1500 students and graduates have already registered for the event.
DeerHack - DeerHack is an annual hackathon event organized by The Software Club of DWIT in association with the college. This is a 48 hours contest where teams from Nepal participate. The first edition of the event was held on May 5th - May 7th 2023 at Deerwalk Complex, Sifal.
References
External links
Foods System
DWIT News
Deerwalk Learning Center
Deerwalk
Education in Kathmandu
Technical universities and colleges
|
```clojure
(ns quo.components.profile.profile-card.view
(:require
[quo.components.avatars.user-avatar.view :as user-avatar]
[quo.components.buttons.button.view :as button]
[quo.components.icon :as icon]
[quo.components.markdown.text :as text]
[quo.components.profile.profile-card.style :as style]
[quo.components.tags.tag :as tag]
[quo.foundations.colors :as colors]
[react-native.core :as rn]
[react-native.hole-view :as hole-view]
[utils.i18n :as i18n]))
(defn profile-card
[{:keys [keycard-account? profile-picture name
customization-color emoji-hash on-options-press
show-emoji-hash? show-options-button? show-user-hash?
show-logged-in? on-card-press login-card? last-item? card-style]
:or {show-emoji-hash? false
show-user-hash? false
customization-color :turquoise
show-options-button? false
show-logged-in? false
keycard-account? false
login-card? false
last-item? false
card-style {:padding-horizontal 20
:flex 1}}
:as args}]
(let [{:keys [width]} (rn/get-window)
padding-bottom (cond
login-card? 38
show-emoji-hash? 12
:else 10)
border-bottom-radius (if (or (not login-card?) last-item?) 16 0)]
[rn/pressable
{:on-press on-card-press
:accessibility-label :profile-card}
[hole-view/hole-view
{:key (str name last-item?) ;; Key is required to force removal of holes
:style (merge {:flex-direction :row} card-style)
:holes (if (or (not login-card?) last-item?)
[]
[{:x 20
:y 108
:width (- width 40)
:height 50
:borderRadius 16}])}
[rn/view
{:style (style/card-container
{:customization-color customization-color
:padding-bottom padding-bottom
:border-bottom-radius border-bottom-radius})}
[rn/view
{:style style/card-header}
[user-avatar/user-avatar
{:full-name name
:profile-picture profile-picture
:size :medium
:status-indicator? false
:static? true}]
[rn/view {:flex-direction :row}
(when show-logged-in?
[tag/tag
{:type :icon
:size 32
:blurred? true
:labelled? true
:resource :i/check
:accessibility-label :logged-in-tag
:icon-color colors/success-50
:override-theme :dark
:label (i18n/label :t/logged-in)}])
(when show-options-button?
[button/button
{:size 32
:type :grey
:background :blur
:icon-only? true
:container-style style/option-button
:on-press on-options-press
:accessibility-label :profile-card-options}
:i/options])]]
[rn/view
{:style style/name-container}
[text/text
{:size :heading-2
:weight :semi-bold
:number-of-lines 1
:style style/user-name} name]
(when keycard-account?
[icon/icon
:i/keycard
style/keycard-icon])]
(when show-user-hash?
[text/text
{:weight :monospace
:style style/user-hash}
(:hash args)])
(when (and show-emoji-hash? emoji-hash)
[text/text
{:weight :monospace
:number-of-lines 1
:style style/emoji-hash} emoji-hash])]]]))
```
|
```css
`vh` and `vw`, `vmin` and `vmax`
Use `background-repeat` to repeat a background image horizontally or vertically
Use pseudo-classes to describe a special state of an element
Highlight input forms using `:focus` pseudo-class
Select items using negative `nth-child`
```
|
María José Aguilar Carrillo (born 7 June 1994), known professionally as Majo Aguilar, is a Mexican singer and songwriter. She is currently signed to Universal Music Group.
Aguilar's first extended play, Tributo (2017), is a musical tribute to her grandparents Antonio Aguilar and Flor Silvestre. She then signed with Universal Music and co-wrote the tracks of her second extended play, Soy (2019).
"No voy a llorar" (2021), the first single of her debut studio album, reached No. 1 on the Billboard Mexico Popular Airplay chart.
Family
María José "Majo" Aguilar is a member of the Aguilar family, also known as "the Aguilar dynasty." She is the daughter of singer and actor Antonio Aguilar, hijo, and a paternal granddaughter of singers Antonio Aguilar and Flor Silvestre, two stars of Mexico's Golden Age of Mexican cinema.
Her uncle Pepe Aguilar, cousins Leonardo Aguilar and Ángela Aguilar, and aunts Dalia Inés and Marcela Rubiales, are also singers.
Career
In 2015, Majo recorded the single "Lo busqué" with her cousins Leonardo and Ángela Aguilar.
In 2016, she began producing, recording, and uploading her own music. She uploaded the music video for her first single, "Triste recuerdo", on 3 July. She recorded a cover version of her grandmother's signature song, "Mi destino fue quererte", on 27 October, and it is currently one of the most viewed videos on her YouTube channel.
In 2017, she released her first extended play, Tributo, which includes cover versions of her grandmother's hits "Cielo rojo" and "Cruz de olvido" and her grandfather's hits "Albur de amor" and "Triste recuerdo", as well as two songs she wrote ("Alas" and "Extraño").
In 2019, Aguilar signed a recording contract with Universal Music Group and released her third single, "Un ratito", on 25 July. She released her fourth single, "Quiero verte bailar", on 29 August. She released her second extended play, Soy (Spanish for "I Am"), in November. Soy includes six songs she wrote (including "Un ratito" and "Quiero verte bailar") and blends various genres, including pop and tropical music.
In October 2020, she began a series of videos called Sesiones en casa in which he performs acoustic versions of some Mexican music hits. The first video, "La media vuelta", was released that same month. Two other videos, "Cielo rojo" and "Amor eterno", were recorded at her paternal grandparents' ranch.
Discography
Singles
"Los busqué" (2015) (with Leonardo and Ángela Aguilar)
"Cielo rojo (2016)
"Un ratito" (2019)
"Quiero verte bailar" (2019)
"Un beso a medias" (2020) (with El Bebeto and Vicente Fernández, Jr.)
"Tik tik tik" (2021) (with Aarón y su Grupo Ilusión)
"No voy a llorar" (2021)
"Me vale" (2021)
"En toda la chapa" (2021)
"Asi es la vida" (2021)
"Amor ilegal" (2021)
"Amigos" (2021)
Triste recuerdo (2023)
Extended plays
Tributo (2017)
Soy (2019)
Studio albums
Mi herencia, mi sangre (2021)
Se canta con el corazón (2022)
Se canta con el corazón (Deluxe) (2023)
Appearances
"¿Por qué dejaste que te amara?" (2021) from El Bebeto's album Cuando te enamores
References
External links
1994 births
Mexican women singers
Mexican women singer-songwriters
Mexican singer-songwriters
Singers from Mexico City
Universal Music Group artists
Living people
Women in Latin music
|
```yaml
category: Data Enrichment & Threat Intelligence
commonfields:
id: Github Feed
version: -1
configuration:
- defaultvalue: 'true'
display: Fetch indicators
name: feed
required: false
type: 8
- defaultvalue: path_to_url
display: Base URL
name: url
type: 0
additionalinfo: The URL to the GitHub API.
section: Connect
required: true
- displaypassword: API Token
name: api_token
type: 9
hiddenusername: true
section: Connect
required: false
- display: Trust any certificate (not secure)
name: insecure
required: false
type: 8
- defaultvalue: ""
display: Owner
name: owner
type: 0
additionalinfo: Username of the repository owner
section: Connect
required: true
- defaultvalue: ""
display: Repository / Path to fetch
name: repo
type: 0
additionalinfo: The name of the repository.
section: Connect
required: true
- defaultvalue: ""
display: Feed type
name: feedType
options:
- YARA
- STIX
- IOCs
type: 15
additionalinfo: |
Predefined list of indicator types:
- YARA: Parses YARA rules from the feed. The "Yara" pack is required for this type.
- STIX: Parses STIX data from the feed.
- IOCs: Parses Indicators of Compromise (IOCs) using regex patterns.
section: Collect
required: true
- display: Branch name
name: branch_head
type: 0
required: true
defaultvalue: main
additionalinfo: The name of the main branch to which to compare.
section: Collect
advanced: true
- display: Files extensions to fetch
name: extensions_to_fetch
type: 16
required: true
defaultvalue: txt,yar,json
options:
- txt
- yar
- json
additionalinfo: The extension of the file names to target.
section: Collect
advanced: true
- additionalinfo: Reliability of the source providing the intelligence data.
defaultvalue: F - Reliability cannot be judged
display: Source Reliability
name: feedReliability
options:
- A - Completely reliable
- B - Usually reliable
- C - Fairly reliable
- D - Not usually reliable
- E - Unreliable
- F - Reliability cannot be judged
required: true
type: 15
- additionalinfo: The Traffic Light Protocol (TLP) designation to apply to indicators fetched from the feed.
display: Traffic Light Protocol Color
name: tlp_color
options:
- RED
- AMBER
- GREEN
- WHITE
required: false
type: 15
- display: First fetch time
additionalinfo: First commit date of first published indicators to bring. e.g., "1 min ago","2 weeks ago","3 months ago".
name: fetch_since
type: 0
defaultvalue: '90 days ago'
required: false
- display: Feed Fetch Interval
name: feedFetchInterval
type: 19
defaultvalue: '240'
required: false
- additionalinfo: When selected, the exclusion list is ignored for indicators from this feed. This means that if an indicator from this feed is on the exclusion list, the indicator might still be added to the system.
defaultvalue: 'true'
display: Bypass exclusion list
name: feedBypassExclusionList
required: false
type: 8
- display: Use system proxy settings
name: proxy
required: false
type: 8
- display: ''
name: feedExpirationPolicy
type: 17
required: false
options:
- never
- interval
- indicatorType
- display: ''
name: feedExpirationInterval
type: 1
required: false
- display: Tags
name: feedTags
type: 0
additionalinfo: Supports CSV values.
required: false
display: Github Feed
name: Github Feed
script:
commands:
- arguments:
- defaultValue: '7 days'
description: 'The start date from which to fetch indicators. Accepts date strings like "7 days ago", "2 weeks ago", etc.'
name: since
- description: 'The end date until which to fetch indicators. Accepts date strings like "now", "2023-05-19", etc.'
name: until
- defaultValue: '50'
description: The maximum number of results to return.
name: limit
description: Gets indicators from the feed within a specified date range and up to a maximum limit..
name: github-get-indicators
dockerimage: demisto/taxii2:1.0.0.105766
feed: true
isfetch: false
longRunning: false
longRunningPort: false
runonce: false
script: '-'
subtype: python3
type: python
fromversion: 6.8.0
description: This is the Feed GitHub integration for getting started with your feed integration.
marketplaces:
- xsoar
- marketplacev2
tests:
- No tests (auto formatted)
```
|
```python
#
#
# 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 unittest
import test_collective_api_base as test_base
class TestCollectiveAllgatherObjectAPI(test_base.TestDistBase):
def _setup_config(self):
pass
def test_allgather_nccl(self):
self.check_with_place(
"collective_allgather_object_api_dygraph.py",
"allgather_object",
"nccl",
static_mode="0",
dtype="pyobject",
)
def test_allgather_gloo_dygraph(self):
self.check_with_place(
"collective_allgather_object_api_dygraph.py",
"allgather_object",
"gloo",
"3",
static_mode="0",
dtype="pyobject",
)
if __name__ == '__main__':
unittest.main()
```
|
Kamona () is a Bengali drama film directed by Nabendu Sundar. This movie was released on 4 March 1949 in the banner of Kirti Pictures. This is the second film of iconic legendary Bengali actor Uttam Kumar after Drishtidan and debut as the leading person crediting him as Uttam Chatterjee instead of Arun Kumar Chatterjee. Film become huge flop at the box office
Plot
Cast
Uttam Kumar
Chhabi Roy
Tulsi Chakraborty
Jahar Ganguly
Jamuna Sinha
Amar Choudhury
Rajlakshmi Debi
Ashu Bose
Priti Majumdar
Phani Ray
Soundtrack
References
1949 films
Bengali-language Indian films
1949 drama films
1940s Bengali-language films
Indian drama films
Indian black-and-white films
|
```java
/*
This file is part of the iText (R) project.
Authors: Apryse Software.
This program is offered under a commercial and under the AGPL license.
For commercial licensing, contact us at path_to_url For AGPL licensing, see below.
AGPL licensing:
This program is free software: you can redistribute it and/or modify
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with this program. If not, see <path_to_url
*/
package com.itextpdf.bouncycastlefips.tsp;
import com.itextpdf.bouncycastlefips.asn1.ASN1ObjectIdentifierBCFips;
import com.itextpdf.commons.bouncycastle.asn1.IASN1ObjectIdentifier;
import com.itextpdf.commons.bouncycastle.tsp.ITimeStampRequest;
import com.itextpdf.commons.bouncycastle.tsp.ITimeStampRequestGenerator;
import java.math.BigInteger;
import java.util.Objects;
import org.bouncycastle.tsp.TimeStampRequestGenerator;
/**
* Wrapper class for {@link org.bouncycastle.tsp.TimeStampRequestGenerator}.
*/
public class TimeStampRequestGeneratorBCFips implements ITimeStampRequestGenerator {
private final TimeStampRequestGenerator requestGenerator;
/**
* Creates new wrapper instance for {@link TimeStampRequestGenerator}.
*
* @param requestGenerator {@link TimeStampRequestGenerator} to be wrapped
*/
public TimeStampRequestGeneratorBCFips(TimeStampRequestGenerator requestGenerator) {
this.requestGenerator = requestGenerator;
}
/**
* Gets actual org.bouncycastle object being wrapped.
*
* @return wrapped {@link TimeStampRequestGenerator}.
*/
public TimeStampRequestGenerator getRequestGenerator() {
return requestGenerator;
}
/**
* {@inheritDoc}
*/
@Override
public void setCertReq(boolean var1) {
requestGenerator.setCertReq(var1);
}
/**
* {@inheritDoc}
*/
@Override
public void setReqPolicy(String reqPolicy) {
requestGenerator.setReqPolicy(reqPolicy);
}
/**
* {@inheritDoc}
*/
@Override
public ITimeStampRequest generate(IASN1ObjectIdentifier objectIdentifier, byte[] imprint, BigInteger nonce) {
return new TimeStampRequestBCFips(requestGenerator.generate(
((ASN1ObjectIdentifierBCFips) objectIdentifier).getASN1ObjectIdentifier(), imprint, nonce));
}
/**
* Indicates whether some other object is "equal to" this one. Compares wrapped objects.
*/
@Override
public boolean equals(Object o) {
if (this == o) {
return true;
}
if (o == null || getClass() != o.getClass()) {
return false;
}
TimeStampRequestGeneratorBCFips that = (TimeStampRequestGeneratorBCFips) o;
return Objects.equals(requestGenerator, that.requestGenerator);
}
/**
* Returns a hash code value based on the wrapped object.
*/
@Override
public int hashCode() {
return Objects.hash(requestGenerator);
}
/**
* Delegates {@code toString} method call to the wrapped object.
*/
@Override
public String toString() {
return requestGenerator.toString();
}
}
```
|
```java
package com.codeest.geeknews.presenter.zhihu;
import com.codeest.geeknews.base.RxPresenter;
import com.codeest.geeknews.model.DataManager;
import com.codeest.geeknews.model.bean.HotListBean;
import com.codeest.geeknews.base.contract.zhihu.HotContract;
import com.codeest.geeknews.util.RxUtil;
import com.codeest.geeknews.widget.CommonSubscriber;
import java.util.List;
import javax.inject.Inject;
import io.reactivex.functions.Function;
/**
* Created by codeest on 16/8/12.
*/
public class HotPresenter extends RxPresenter<HotContract.View> implements HotContract.Presenter{
private DataManager mDataManager;
@Inject
public HotPresenter(DataManager mDataManager) {
this.mDataManager = mDataManager;
}
@Override
public void getHotData() {
addSubscribe(mDataManager.fetchHotListInfo()
.compose(RxUtil.<HotListBean>rxSchedulerHelper())
.map(new Function<HotListBean, HotListBean>() {
@Override
public HotListBean apply(HotListBean hotListBean) {
List<HotListBean.RecentBean> list = hotListBean.getRecent();
for(HotListBean.RecentBean item : list) {
item.setReadState(mDataManager.queryNewsId(item.getNews_id()));
}
return hotListBean;
}
})
.subscribeWith(new CommonSubscriber<HotListBean>(mView) {
@Override
public void onNext(HotListBean hotListBean) {
mView.showContent(hotListBean);
}
})
);
}
@Override
public void insertReadToDB(int id) {
mDataManager.insertNewsId(id);
}
}
```
|
```objective-c
/* ====================================================================
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* 3. All advertising materials mentioning features or use of this
* software must display the following acknowledgment:
* "This product includes software developed by the OpenSSL Project
* for use in the OpenSSL Toolkit. (path_to_url"
*
* 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
* endorse or promote products derived from this software without
* prior written permission. For written permission, please contact
* openssl-core@openssl.org.
*
* 5. Products derived from this software may not be called "OpenSSL"
* nor may "OpenSSL" appear in their names without prior written
* permission of the OpenSSL Project.
*
* 6. Redistributions of any form whatsoever must retain the following
* acknowledgment:
* "This product includes software developed by the OpenSSL Project
* for use in the OpenSSL Toolkit (path_to_url"
*
* THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
* EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
* ====================================================================
*
* This product includes cryptographic software written by Eric Young
* (eay@cryptsoft.com). This product includes software written by Tim
* Hudson (tjh@cryptsoft.com). */
#ifndef OPENSSL_HEADER_BASE_H
#define OPENSSL_HEADER_BASE_H
// This file should be the first included by all BoringSSL headers.
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include <sys/types.h>
#if defined(__MINGW32__)
// stdio.h is needed on MinGW for __MINGW_PRINTF_FORMAT.
#include <stdio.h>
#endif
#if defined(__APPLE__)
#include <TargetConditionals.h>
#endif
// Include a BoringSSL-only header so consumers including this header without
// setting up include paths do not accidentally pick up the system
// opensslconf.h.
#include <openssl/is_boringssl.h>
#include <openssl/opensslconf.h>
#include <openssl/target.h> // IWYU pragma: export
#if defined(BORINGSSL_PREFIX)
#include <boringssl_prefix_symbols.h>
#endif
#if defined(__cplusplus)
extern "C" {
#endif
#if defined(__APPLE__)
// Note |TARGET_OS_MAC| is set for all Apple OS variants. |TARGET_OS_OSX|
// targets macOS specifically.
#if defined(TARGET_OS_OSX) && TARGET_OS_OSX
#define OPENSSL_MACOS
#endif
#if defined(TARGET_OS_IPHONE) && TARGET_OS_IPHONE
#define OPENSSL_IOS
#endif
#endif
#define OPENSSL_IS_BORINGSSL
#define OPENSSL_VERSION_NUMBER 0x1010107f
#define SSLEAY_VERSION_NUMBER OPENSSL_VERSION_NUMBER
// BORINGSSL_API_VERSION is a positive integer that increments as BoringSSL
// changes over time. The value itself is not meaningful. It will be incremented
// whenever is convenient to coordinate an API change with consumers. This will
// not denote any special point in development.
//
// A consumer may use this symbol in the preprocessor to temporarily build
// against multiple revisions of BoringSSL at the same time. It is not
// recommended to do so for longer than is necessary.
#define BORINGSSL_API_VERSION 32
#if defined(BORINGSSL_SHARED_LIBRARY)
#if defined(OPENSSL_WINDOWS)
#if defined(BORINGSSL_IMPLEMENTATION)
#define OPENSSL_EXPORT __declspec(dllexport)
#else
#define OPENSSL_EXPORT __declspec(dllimport)
#endif
#else // defined(OPENSSL_WINDOWS)
#if defined(BORINGSSL_IMPLEMENTATION)
#define OPENSSL_EXPORT __attribute__((visibility("default")))
#else
#define OPENSSL_EXPORT
#endif
#endif // defined(OPENSSL_WINDOWS)
#else // defined(BORINGSSL_SHARED_LIBRARY)
#define OPENSSL_EXPORT
#endif // defined(BORINGSSL_SHARED_LIBRARY)
#if defined(_MSC_VER)
// OPENSSL_DEPRECATED is used to mark a function as deprecated. Use
// of any functions so marked in caller code will produce a warning.
// OPENSSL_BEGIN_ALLOW_DEPRECATED and OPENSSL_END_ALLOW_DEPRECATED
// can be used to suppress the warning in regions of caller code.
#define OPENSSL_DEPRECATED __declspec(deprecated)
#define OPENSSL_BEGIN_ALLOW_DEPRECATED \
__pragma(warning(push)) __pragma(warning(disable : 4996))
#define OPENSSL_END_ALLOW_DEPRECATED __pragma(warning(pop))
#elif defined(__GNUC__) || defined(__clang__)
#define OPENSSL_DEPRECATED __attribute__((__deprecated__))
#define OPENSSL_BEGIN_ALLOW_DEPRECATED \
_Pragma("GCC diagnostic push") \
_Pragma("GCC diagnostic ignored \"-Wdeprecated-declarations\"")
#define OPENSSL_END_ALLOW_DEPRECATED _Pragma("GCC diagnostic pop")
#else
#define OPENSSL_DEPRECATED
#define OPENSSL_BEGIN_ALLOW_DEPRECATED
#define OPENSSL_END_ALLOW_DEPRECATED
#endif
#if defined(__GNUC__) || defined(__clang__)
// MinGW has two different printf implementations. Ensure the format macro
// matches the selected implementation. See
// path_to_url
#if defined(__MINGW_PRINTF_FORMAT)
#define OPENSSL_PRINTF_FORMAT_FUNC(string_index, first_to_check) \
__attribute__( \
(__format__(__MINGW_PRINTF_FORMAT, string_index, first_to_check)))
#else
#define OPENSSL_PRINTF_FORMAT_FUNC(string_index, first_to_check) \
__attribute__((__format__(__printf__, string_index, first_to_check)))
#endif
#else
#define OPENSSL_PRINTF_FORMAT_FUNC(string_index, first_to_check)
#endif
// OPENSSL_CLANG_PRAGMA emits a pragma on clang and nothing on other compilers.
#if defined(__clang__)
#define OPENSSL_CLANG_PRAGMA(arg) _Pragma(arg)
#else
#define OPENSSL_CLANG_PRAGMA(arg)
#endif
// OPENSSL_MSVC_PRAGMA emits a pragma on MSVC and nothing on other compilers.
#if defined(_MSC_VER)
#define OPENSSL_MSVC_PRAGMA(arg) __pragma(arg)
#else
#define OPENSSL_MSVC_PRAGMA(arg)
#endif
#if defined(__GNUC__) || defined(__clang__)
#define OPENSSL_UNUSED __attribute__((unused))
#else
#define OPENSSL_UNUSED
#endif
// C and C++ handle inline functions differently. In C++, an inline function is
// defined in just the header file, potentially emitted in multiple compilation
// units (in cases the compiler did not inline), but each copy must be identical
// to satsify ODR. In C, a non-static inline must be manually emitted in exactly
// one compilation unit with a separate extern inline declaration.
//
// In both languages, exported inline functions referencing file-local symbols
// are problematic. C forbids this altogether (though GCC and Clang seem not to
// enforce it). It works in C++, but ODR requires the definitions be identical,
// including all names in the definitions resolving to the "same entity". In
// practice, this is unlikely to be a problem, but an inline function that
// returns a pointer to a file-local symbol
// could compile oddly.
//
// Historically, we used static inline in headers. However, to satisfy ODR, use
// plain inline in C++, to allow inline consumer functions to call our header
// functions. Plain inline would also work better with C99 inline, but that is
// not used much in practice, extern inline is tedious, and there are conflicts
// with the old gnu89 model:
// path_to_url
#if defined(__cplusplus)
#define OPENSSL_INLINE inline
#else
// Add OPENSSL_UNUSED so that, should an inline function be emitted via macro
// (e.g. a |STACK_OF(T)| implementation) in a source file without tripping
// clang's -Wunused-function.
#define OPENSSL_INLINE static inline OPENSSL_UNUSED
#endif
#if defined(__cplusplus)
// enums can be predeclared, but only in C++ and only if given an explicit type.
// C doesn't support setting an explicit type for enums thus a #define is used
// to do this only for C++. However, the ABI type between C and C++ need to have
// equal sizes, which is confirmed in a unittest.
#define BORINGSSL_ENUM_INT : int
enum ssl_early_data_reason_t BORINGSSL_ENUM_INT;
enum ssl_encryption_level_t BORINGSSL_ENUM_INT;
enum ssl_private_key_result_t BORINGSSL_ENUM_INT;
enum ssl_renegotiate_mode_t BORINGSSL_ENUM_INT;
enum ssl_select_cert_result_t BORINGSSL_ENUM_INT;
enum ssl_select_cert_result_t BORINGSSL_ENUM_INT;
enum ssl_ticket_aead_result_t BORINGSSL_ENUM_INT;
enum ssl_verify_result_t BORINGSSL_ENUM_INT;
#else
#define BORINGSSL_ENUM_INT
#endif
// ossl_ssize_t is a signed type which is large enough to fit the size of any
// valid memory allocation. We prefer using |size_t|, but sometimes we need a
// signed type for OpenSSL API compatibility. This type can be used in such
// cases to avoid overflow.
//
// Not all |size_t| values fit in |ossl_ssize_t|, but all |size_t| values that
// are sizes of or indices into C objects, can be converted without overflow.
typedef ptrdiff_t ossl_ssize_t;
// CBS_ASN1_TAG is the type used by |CBS| and |CBB| for ASN.1 tags. See that
// header for details. This type is defined in base.h as a forward declaration.
typedef uint32_t CBS_ASN1_TAG;
// CRYPTO_THREADID is a dummy value.
typedef int CRYPTO_THREADID;
// An |ASN1_NULL| is an opaque type. asn1.h represents the ASN.1 NULL value as
// an opaque, non-NULL |ASN1_NULL*| pointer.
typedef struct asn1_null_st ASN1_NULL;
typedef int ASN1_BOOLEAN;
typedef struct ASN1_ITEM_st ASN1_ITEM;
typedef struct asn1_object_st ASN1_OBJECT;
typedef struct asn1_pctx_st ASN1_PCTX;
typedef struct asn1_string_st ASN1_BIT_STRING;
typedef struct asn1_string_st ASN1_BMPSTRING;
typedef struct asn1_string_st ASN1_ENUMERATED;
typedef struct asn1_string_st ASN1_GENERALIZEDTIME;
typedef struct asn1_string_st ASN1_GENERALSTRING;
typedef struct asn1_string_st ASN1_IA5STRING;
typedef struct asn1_string_st ASN1_INTEGER;
typedef struct asn1_string_st ASN1_OCTET_STRING;
typedef struct asn1_string_st ASN1_PRINTABLESTRING;
typedef struct asn1_string_st ASN1_STRING;
typedef struct asn1_string_st ASN1_T61STRING;
typedef struct asn1_string_st ASN1_TIME;
typedef struct asn1_string_st ASN1_UNIVERSALSTRING;
typedef struct asn1_string_st ASN1_UTCTIME;
typedef struct asn1_string_st ASN1_UTF8STRING;
typedef struct asn1_string_st ASN1_VISIBLESTRING;
typedef struct asn1_type_st ASN1_TYPE;
typedef struct AUTHORITY_KEYID_st AUTHORITY_KEYID;
typedef struct BASIC_CONSTRAINTS_st BASIC_CONSTRAINTS;
typedef struct DIST_POINT_st DIST_POINT;
typedef struct DSA_SIG_st DSA_SIG;
typedef struct GENERAL_NAME_st GENERAL_NAME;
typedef struct ISSUING_DIST_POINT_st ISSUING_DIST_POINT;
typedef struct NAME_CONSTRAINTS_st NAME_CONSTRAINTS;
typedef struct Netscape_spkac_st NETSCAPE_SPKAC;
typedef struct Netscape_spki_st NETSCAPE_SPKI;
typedef struct RIPEMD160state_st RIPEMD160_CTX;
typedef struct X509_VERIFY_PARAM_st X509_VERIFY_PARAM;
typedef struct X509_algor_st X509_ALGOR;
typedef struct X509_crl_st X509_CRL;
typedef struct X509_extension_st X509_EXTENSION;
typedef struct X509_info_st X509_INFO;
typedef struct X509_name_entry_st X509_NAME_ENTRY;
typedef struct X509_name_st X509_NAME;
typedef struct X509_pubkey_st X509_PUBKEY;
typedef struct X509_req_st X509_REQ;
typedef struct X509_sig_st X509_SIG;
typedef struct bignum_ctx BN_CTX;
typedef struct bignum_st BIGNUM;
typedef struct bio_method_st BIO_METHOD;
typedef struct bio_st BIO;
typedef struct blake2b_state_st BLAKE2B_CTX;
typedef struct bn_gencb_st BN_GENCB;
typedef struct bn_mont_ctx_st BN_MONT_CTX;
typedef struct buf_mem_st BUF_MEM;
typedef struct cbb_st CBB;
typedef struct cbs_st CBS;
typedef struct cmac_ctx_st CMAC_CTX;
typedef struct conf_st CONF;
typedef struct conf_value_st CONF_VALUE;
typedef struct crypto_buffer_pool_st CRYPTO_BUFFER_POOL;
typedef struct crypto_buffer_st CRYPTO_BUFFER;
typedef struct ctr_drbg_state_st CTR_DRBG_STATE;
typedef struct dh_st DH;
typedef struct dsa_st DSA;
typedef struct ec_group_st EC_GROUP;
typedef struct ec_key_st EC_KEY;
typedef struct ec_point_st EC_POINT;
typedef struct ecdsa_method_st ECDSA_METHOD;
typedef struct ecdsa_sig_st ECDSA_SIG;
typedef struct engine_st ENGINE;
typedef struct env_md_ctx_st EVP_MD_CTX;
typedef struct env_md_st EVP_MD;
typedef struct evp_aead_st EVP_AEAD;
typedef struct evp_aead_ctx_st EVP_AEAD_CTX;
typedef struct evp_cipher_ctx_st EVP_CIPHER_CTX;
typedef struct evp_cipher_st EVP_CIPHER;
typedef struct evp_encode_ctx_st EVP_ENCODE_CTX;
typedef struct evp_hpke_aead_st EVP_HPKE_AEAD;
typedef struct evp_hpke_ctx_st EVP_HPKE_CTX;
typedef struct evp_hpke_kdf_st EVP_HPKE_KDF;
typedef struct evp_hpke_kem_st EVP_HPKE_KEM;
typedef struct evp_hpke_key_st EVP_HPKE_KEY;
typedef struct evp_pkey_ctx_st EVP_PKEY_CTX;
typedef struct evp_pkey_st EVP_PKEY;
typedef struct hmac_ctx_st HMAC_CTX;
typedef struct md4_state_st MD4_CTX;
typedef struct md5_state_st MD5_CTX;
typedef struct ossl_init_settings_st OPENSSL_INIT_SETTINGS;
typedef struct pkcs12_st PKCS12;
typedef struct pkcs8_priv_key_info_st PKCS8_PRIV_KEY_INFO;
typedef struct private_key_st X509_PKEY;
typedef struct rand_meth_st RAND_METHOD;
typedef struct rc4_key_st RC4_KEY;
typedef struct rsa_meth_st RSA_METHOD;
typedef struct rsa_pss_params_st RSA_PSS_PARAMS;
typedef struct rsa_st RSA;
typedef struct sha256_state_st SHA256_CTX;
typedef struct sha512_state_st SHA512_CTX;
typedef struct sha_state_st SHA_CTX;
typedef struct spake2_ctx_st SPAKE2_CTX;
typedef struct srtp_protection_profile_st SRTP_PROTECTION_PROFILE;
typedef struct ssl_cipher_st SSL_CIPHER;
typedef struct ssl_credential_st SSL_CREDENTIAL;
typedef struct ssl_ctx_st SSL_CTX;
typedef struct ssl_early_callback_ctx SSL_CLIENT_HELLO;
typedef struct ssl_ech_keys_st SSL_ECH_KEYS;
typedef struct ssl_method_st SSL_METHOD;
typedef struct ssl_private_key_method_st SSL_PRIVATE_KEY_METHOD;
typedef struct ssl_quic_method_st SSL_QUIC_METHOD;
typedef struct ssl_session_st SSL_SESSION;
typedef struct ssl_st SSL;
typedef struct ssl_ticket_aead_method_st SSL_TICKET_AEAD_METHOD;
typedef struct st_ERR_FNS ERR_FNS;
typedef struct trust_token_st TRUST_TOKEN;
typedef struct trust_token_client_st TRUST_TOKEN_CLIENT;
typedef struct trust_token_issuer_st TRUST_TOKEN_ISSUER;
typedef struct trust_token_method_st TRUST_TOKEN_METHOD;
typedef struct v3_ext_ctx X509V3_CTX;
typedef struct v3_ext_method X509V3_EXT_METHOD;
typedef struct x509_attributes_st X509_ATTRIBUTE;
typedef struct x509_lookup_st X509_LOOKUP;
typedef struct x509_lookup_method_st X509_LOOKUP_METHOD;
typedef struct x509_object_st X509_OBJECT;
typedef struct x509_purpose_st X509_PURPOSE;
typedef struct x509_revoked_st X509_REVOKED;
typedef struct x509_st X509;
typedef struct x509_store_ctx_st X509_STORE_CTX;
typedef struct x509_store_st X509_STORE;
typedef void *OPENSSL_BLOCK;
// BSSL_CHECK aborts if |condition| is not true.
#define BSSL_CHECK(condition) \
do { \
if (!(condition)) { \
abort(); \
} \
} while (0);
#if defined(__cplusplus)
} // extern C
#elif !defined(BORINGSSL_NO_CXX)
#define BORINGSSL_NO_CXX
#endif
#if defined(BORINGSSL_PREFIX)
#define BSSL_NAMESPACE_BEGIN \
namespace bssl { \
inline namespace BORINGSSL_PREFIX {
#define BSSL_NAMESPACE_END \
} \
}
#else
#define BSSL_NAMESPACE_BEGIN namespace bssl {
#define BSSL_NAMESPACE_END }
#endif
// MSVC doesn't set __cplusplus to 201103 to indicate C++11 support (see
// path_to_url
// so MSVC is just assumed to support C++11.
#if !defined(BORINGSSL_NO_CXX) && __cplusplus < 201103L && !defined(_MSC_VER)
#define BORINGSSL_NO_CXX
#endif
#if !defined(BORINGSSL_NO_CXX)
extern "C++" {
#include <memory>
// STLPort, used by some Android consumers, not have std::unique_ptr.
#if defined(_STLPORT_VERSION)
#define BORINGSSL_NO_CXX
#endif
} // extern C++
#endif // !BORINGSSL_NO_CXX
#if defined(BORINGSSL_NO_CXX)
#define BORINGSSL_MAKE_DELETER(type, deleter)
#define BORINGSSL_MAKE_UP_REF(type, up_ref_func)
#else
extern "C++" {
BSSL_NAMESPACE_BEGIN
namespace internal {
// The Enable parameter is ignored and only exists so specializations can use
// SFINAE.
template <typename T, typename Enable = void>
struct DeleterImpl {};
struct Deleter {
template <typename T>
void operator()(T *ptr) {
// Rather than specialize Deleter for each type, we specialize
// DeleterImpl. This allows bssl::UniquePtr<T> to be used while only
// including base.h as long as the destructor is not emitted. This matches
// std::unique_ptr's behavior on forward-declared types.
//
// DeleterImpl itself is specialized in the corresponding module's header
// and must be included to release an object. If not included, the compiler
// will error that DeleterImpl<T> does not have a method Free.
DeleterImpl<T>::Free(ptr);
}
};
template <typename T, typename CleanupRet, void (*init)(T *),
CleanupRet (*cleanup)(T *)>
class StackAllocated {
public:
StackAllocated() { init(&ctx_); }
~StackAllocated() { cleanup(&ctx_); }
StackAllocated(const StackAllocated &) = delete;
StackAllocated& operator=(const StackAllocated &) = delete;
T *get() { return &ctx_; }
const T *get() const { return &ctx_; }
T *operator->() { return &ctx_; }
const T *operator->() const { return &ctx_; }
void Reset() {
cleanup(&ctx_);
init(&ctx_);
}
private:
T ctx_;
};
template <typename T, typename CleanupRet, void (*init)(T *),
CleanupRet (*cleanup)(T *), void (*move)(T *, T *)>
class StackAllocatedMovable {
public:
StackAllocatedMovable() { init(&ctx_); }
~StackAllocatedMovable() { cleanup(&ctx_); }
StackAllocatedMovable(StackAllocatedMovable &&other) {
init(&ctx_);
move(&ctx_, &other.ctx_);
}
StackAllocatedMovable &operator=(StackAllocatedMovable &&other) {
move(&ctx_, &other.ctx_);
return *this;
}
T *get() { return &ctx_; }
const T *get() const { return &ctx_; }
T *operator->() { return &ctx_; }
const T *operator->() const { return &ctx_; }
void Reset() {
cleanup(&ctx_);
init(&ctx_);
}
private:
T ctx_;
};
} // namespace internal
#define BORINGSSL_MAKE_DELETER(type, deleter) \
namespace internal { \
template <> \
struct DeleterImpl<type> { \
static void Free(type *ptr) { deleter(ptr); } \
}; \
}
// Holds ownership of heap-allocated BoringSSL structures. Sample usage:
// bssl::UniquePtr<RSA> rsa(RSA_new());
// bssl::UniquePtr<BIO> bio(BIO_new(BIO_s_mem()));
template <typename T>
using UniquePtr = std::unique_ptr<T, internal::Deleter>;
#define BORINGSSL_MAKE_UP_REF(type, up_ref_func) \
inline UniquePtr<type> UpRef(type *v) { \
if (v != nullptr) { \
up_ref_func(v); \
} \
return UniquePtr<type>(v); \
} \
\
inline UniquePtr<type> UpRef(const UniquePtr<type> &ptr) { \
return UpRef(ptr.get()); \
}
BSSL_NAMESPACE_END
} // extern C++
#endif // !BORINGSSL_NO_CXX
#endif // OPENSSL_HEADER_BASE_H
```
|
```css
Make text unselectable
`calc()` for simpler maths
Property names require American English
Use pseudo-elements to style specific parts of an element
Styling elements using `::before` and `::after`
```
|
Allen Park is a city in Wayne County in the U.S. state of Michigan. As of the 2020 Census, the population was 28,638.
Ford Motor Company is an integral part of the community. Many of the company's offices and facilities lie within the city limits. Since 2002, Allen Park is the practice home of the Detroit Lions football team and is also the site of the team's headquarters. The city is known for its tree-lined streets, brick houses, and the Fairlane Green Shopping Center that opened in 2006. The city was once recognized in Money Magazine's list of America's Best Small Cities. Allen Park is part of the collection of communities known as Downriver.
Allen Park is home to the Uniroyal Giant Tire, the largest non-production tire scale model ever built, and one of the world's largest roadside attractions. Originally a Ferris wheel at the 1964 New York World's Fair, the structure was moved to Allen Park in 1966.
Geography
According to the United States Census Bureau, the city has a total area of , of which is land and (0.71%) is water.
Boundaries
Allen Park borders Southgate to the South, Lincoln Park to the east, Melvindale to the northeast, Dearborn to the north, Dearborn Heights to the northwest, and Taylor to the west.
Major roads
runs through the southeast corner of Allen Park between Goddard Road and the Lincoln Park border.
runs through the northern portion of Allen Park between Pelham Road and the Rouge River.
, Southfield Road, is an eight-lane boulevard that travels in a northwest–southeast direction between the Lincoln Park border and I-94. It becomes the Southfield Freeway and curves to the northeast after the I-94 interchange.
History
Allen Park was incorporated as a village in 1927, and as a city in 1957. It was named after Lewis Allen, a well-to-do lawyer and lumberman whose 276½ acres of land (primarily in Ecorse Township) included holdings in what are now Allen Park and Melvindale. Hubert Champaign (for whom Champaign Park is named) and Edward Pepper were two other early residents of the area.
In 1950 Allen Park did not include the part of the city directly west of Melvindale; that area was still part of Ecorse Township.
Demographics
2010 census
As of the census of 2010, there were 28,210 people, 11,580 households, and 7,606 families living in the city. The population density was . There were 12,206 housing units at an average density of . The racial makeup of the city was 92.9% White, 2.1% African American, 0.5% Native American, 0.8% Asian, 2.0% from other races, and 1.6% from two or more races. Hispanic or Latino of any race were 8.1% of the population.
There were 11,580 households, of which 29.1% had children under the age of 18 living with them, 49.1% were married couples living together, 11.6% had a female householder with no husband present, 5.0% had a male householder with no wife present, and 34.3% were non-families. 30.1% of all households were made up of individuals, and 14.3% had someone living alone who was 65 years of age or older. The average household size was 2.42 and the average family size was 3.02.
The median age in the city was 41.7 years. 21.7% of residents were under the age of 18; 7.7% were between the ages of 18 and 24; 24.8% were from 25 to 44; 28.5% were from 45 to 64; and 17.2% were 65 years of age or older. The gender makeup of the city was 48.1% male and 51.9% female.
2000 census
As of the census of 2000, there were 29,376 people, 11,974 households, and 8,202 families living in the city. The population density was . There were 12,254 housing units at an average density of . The racial makeup of the city was 95.6% White, 0.7% African American, 0.36% Native American, 0.81% Asian, 0.02% Pacific Islander, 1.21% from other races, and 1.27% from two or more races. Hispanic or Latino of any race were 4.73% of the population. There were 11,974 households, out of which 27.5% had children under the age of 18 living with them, 55.0% were married couples living together, 9.9% had a female householder with no husband present, and 31.5% were non-families. 28.2% of all households were made up of individuals, and 14.9% had someone living alone who was 65 years of age or older. The average household size was 2.43 and the average family size was 2.99.
In the city, the population was spread out, with 22.2% under the age of 18, 6.5% from 18 to 24, 28.2% from 25 to 44, 22.2% from 45 to 64, and 20.9% who were 65 years of age or older. The median age was 41 years. For every 100 females, there were 91.0 males. For every 100 women age eighteen and over, there were 88.1 men.
The median income for a household in the city was $51,992, and the median income for a family was $63,350. Males had a median income of $50,143 versus $31,168 for females. The per capita income for the city was $24,980. About 1.9% of families and 3.2% of the population were below the poverty line, including 3.3% of those under age 18 and 4.5% of those age 65 or over.
Politics
The Mayor of Allen Park is Gail McLeod, who has served since 2019. Six members sit on the city council, including Felice "Tony" Lalli, Daniel Loyd, Matthew Valerius, Gary Schlack, Charles Blevins, and Dennis Marcos.
Education
Public schools
Most of Allen Park is within the Allen Park School District. The district has three elementary schools: Arno, Lindemann, and Bennie. The district also includes Allen Park Middle School, Allen Park High School, and Allen Park Community School.
Northern Allen Park is within the Melvindale-Northern Allen Park Public Schools. Rogers Early Elementary School is within Allen Park. Residents in Melvindale-Northern Allen Park go on to Melvindale High School.
The Southgate Community School District serves Allen Park south of the Sexton-Kilfoil Drain.
Prior to the establishment of Allen Park High School in 1950, education in Allen Park, provided at the Lapham school, ended after the eighth grade. Students in the Allen Park school district had to travel to Detroit Southwestern High School, Lincoln Park High School, and/or Melvindale High School.
Private schools
Private schools in Allen Park include Inter-City Baptist School and St. Frances Cabrini Schools (including Cabrini High School). Historically religious private schools in Ecorse, River Rouge, and Taylor served Allen Park residents.
Sports
In 2009, the Professional Bowlers Association (PBA) announced that Thunderbowl Lanes in Allen Park would be the main site for the inaugural PBA World Series of Bowling. This unique event featured the first seven tournaments of the PBA's 2009–10 season all contested in the same area. One tournament (Motor City Open) was contested in nearby Taylor, MI, while the other six (including the PBA World Championship qualifying and match play rounds) took place at Thunderbowl. The 2009 events ran August 2-September 6, with the televised finals being taped by ESPN on September 5–6. Thunderbowl Lanes has hosted additional PBA tournaments since that time, including the five-event PBA Fall Swing in September, 2016 and both the 2018 and 2021 PBA Tour Finals. The World Series of Bowling returned to Thunderbowl Lanes for its tenth anniversary in the 2019 PBA Tour season, with events running March 11–21.
The National Football League's Detroit Lions have their offices and training facility in Allen Park.
Notable residents
Terry Andrysiak, football quarterback
Jeff Bernard, unlimited hydroplane driver
John Bizon, member of the Michigan Senate
Amanda Chidester, softball player
Frank Liberati, former member of the Michigan House of Representatives
Tullio Liberati, member of the Michigan House of Representatives
Jennifer Valoppi, journalist
John Varvatos, fashion designer
References
Broglin, Sharon. Allen Park. Arcadia Publishing, 2007. , 9780738551098.
Notes
External links
City of Allen Park
Cities in Wayne County, Michigan
Metro Detroit
Hungarian-American culture in Michigan
1927 establishments in Michigan
Populated places established in 1927
|
```c++
#include "inspector_agent.h"
#include "env-inl.h"
#include "inspector/main_thread_interface.h"
#include "inspector/node_string.h"
#include "inspector/runtime_agent.h"
#include "inspector/tracing_agent.h"
#include "inspector/worker_agent.h"
#include "inspector/worker_inspector.h"
#include "inspector_io.h"
#include "node/inspector/protocol/Protocol.h"
#include "node_errors.h"
#include "node_internals.h"
#include "node_options-inl.h"
#include "node_process.h"
#include "node_url.h"
#include "util-inl.h"
#include "v8-inspector.h"
#include "v8-platform.h"
#include "libplatform/libplatform.h"
#ifdef __POSIX__
#include <pthread.h>
#include <climits> // PTHREAD_STACK_MIN
#endif // __POSIX__
#include <algorithm>
#include <cstring>
#include <sstream>
#include <unordered_map>
#include <vector>
namespace node {
namespace inspector {
namespace {
using node::FatalError;
using v8::Context;
using v8::Function;
using v8::Global;
using v8::HandleScope;
using v8::Isolate;
using v8::Local;
using v8::Message;
using v8::Object;
using v8::Value;
using v8_inspector::StringBuffer;
using v8_inspector::StringView;
using v8_inspector::V8Inspector;
using v8_inspector::V8InspectorClient;
static uv_sem_t start_io_thread_semaphore;
static uv_async_t start_io_thread_async;
// This is just an additional check to make sure start_io_thread_async
// is not accidentally re-used or used when uninitialized.
static std::atomic_bool start_io_thread_async_initialized { false };
// Protects the Agent* stored in start_io_thread_async.data.
static Mutex start_io_thread_async_mutex;
std::unique_ptr<StringBuffer> ToProtocolString(Isolate* isolate,
Local<Value> value) {
TwoByteValue buffer(isolate, value);
return StringBuffer::create(StringView(*buffer, buffer.length()));
}
// Called on the main thread.
void StartIoThreadAsyncCallback(uv_async_t* handle) {
static_cast<Agent*>(handle->data)->StartIoThread();
}
#ifdef __POSIX__
static void StartIoThreadWakeup(int signo, siginfo_t* info, void* ucontext) {
uv_sem_post(&start_io_thread_semaphore);
}
inline void* StartIoThreadMain(void* unused) {
for (;;) {
uv_sem_wait(&start_io_thread_semaphore);
Mutex::ScopedLock lock(start_io_thread_async_mutex);
CHECK(start_io_thread_async_initialized);
Agent* agent = static_cast<Agent*>(start_io_thread_async.data);
if (agent != nullptr)
agent->RequestIoThreadStart();
}
return nullptr;
}
static int StartDebugSignalHandler() {
// Start a watchdog thread for calling v8::Debug::DebugBreak() because
// it's not safe to call directly from the signal handler, it can
// deadlock with the thread it interrupts.
CHECK_EQ(0, uv_sem_init(&start_io_thread_semaphore, 0));
pthread_attr_t attr;
CHECK_EQ(0, pthread_attr_init(&attr));
#if defined(PTHREAD_STACK_MIN) && !defined(__FreeBSD__)
// PTHREAD_STACK_MIN is 2 KB with musl libc, which is too small to safely
// receive signals. PTHREAD_STACK_MIN + MINSIGSTKSZ is 8 KB on arm64, which
// is the musl architecture with the biggest MINSIGSTKSZ so let's use that
// as a lower bound and let's quadruple it just in case. The goal is to avoid
// creating a big 2 or 4 MB address space gap (problematic on 32 bits
// because of fragmentation), not squeeze out every last byte.
// Omitted on FreeBSD because it doesn't seem to like small stacks.
const size_t stack_size = std::max(static_cast<size_t>(4 * 8192),
static_cast<size_t>(PTHREAD_STACK_MIN));
CHECK_EQ(0, pthread_attr_setstacksize(&attr, stack_size));
#endif // defined(PTHREAD_STACK_MIN) && !defined(__FreeBSD__)
CHECK_EQ(0, pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED));
sigset_t sigmask;
// Mask all signals.
sigfillset(&sigmask);
sigset_t savemask;
CHECK_EQ(0, pthread_sigmask(SIG_SETMASK, &sigmask, &savemask));
sigmask = savemask;
pthread_t thread;
const int err = pthread_create(&thread, &attr,
StartIoThreadMain, nullptr);
// Restore original mask
CHECK_EQ(0, pthread_sigmask(SIG_SETMASK, &sigmask, nullptr));
CHECK_EQ(0, pthread_attr_destroy(&attr));
if (err != 0) {
fprintf(stderr, "node[%u]: pthread_create: %s\n",
uv_os_getpid(), strerror(err));
fflush(stderr);
// Leave SIGUSR1 blocked. We don't install a signal handler,
// receiving the signal would terminate the process.
return -err;
}
RegisterSignalHandler(SIGUSR1, StartIoThreadWakeup);
// Unblock SIGUSR1. A pending SIGUSR1 signal will now be delivered.
sigemptyset(&sigmask);
sigaddset(&sigmask, SIGUSR1);
CHECK_EQ(0, pthread_sigmask(SIG_UNBLOCK, &sigmask, nullptr));
return 0;
}
#endif // __POSIX__
#ifdef _WIN32
DWORD WINAPI StartIoThreadProc(void* arg) {
Mutex::ScopedLock lock(start_io_thread_async_mutex);
CHECK(start_io_thread_async_initialized);
Agent* agent = static_cast<Agent*>(start_io_thread_async.data);
if (agent != nullptr)
agent->RequestIoThreadStart();
return 0;
}
static int GetDebugSignalHandlerMappingName(DWORD pid, wchar_t* buf,
size_t buf_len) {
return _snwprintf(buf, buf_len, L"node-debug-handler-%u", pid);
}
static int StartDebugSignalHandler() {
wchar_t mapping_name[32];
HANDLE mapping_handle;
DWORD pid;
LPTHREAD_START_ROUTINE* handler;
pid = uv_os_getpid();
if (GetDebugSignalHandlerMappingName(pid,
mapping_name,
arraysize(mapping_name)) < 0) {
return -1;
}
mapping_handle = CreateFileMappingW(INVALID_HANDLE_VALUE,
nullptr,
PAGE_READWRITE,
0,
sizeof *handler,
mapping_name);
if (mapping_handle == nullptr) {
return -1;
}
handler = reinterpret_cast<LPTHREAD_START_ROUTINE*>(
MapViewOfFile(mapping_handle,
FILE_MAP_ALL_ACCESS,
0,
0,
sizeof *handler));
if (handler == nullptr) {
CloseHandle(mapping_handle);
return -1;
}
*handler = StartIoThreadProc;
UnmapViewOfFile(static_cast<void*>(handler));
return 0;
}
#endif // _WIN32
const int CONTEXT_GROUP_ID = 1;
std::string GetWorkerLabel(node::Environment* env) {
std::ostringstream result;
result << "Worker[" << env->thread_id() << "]";
return result.str();
}
class ChannelImpl final : public v8_inspector::V8Inspector::Channel,
public protocol::FrontendChannel {
public:
explicit ChannelImpl(Environment* env,
const std::unique_ptr<V8Inspector>& inspector,
std::shared_ptr<WorkerManager> worker_manager,
std::unique_ptr<InspectorSessionDelegate> delegate,
std::shared_ptr<MainThreadHandle> main_thread_,
bool prevent_shutdown)
: delegate_(std::move(delegate)), prevent_shutdown_(prevent_shutdown),
retaining_context_(false) {
session_ = inspector->connect(CONTEXT_GROUP_ID, this, StringView());
node_dispatcher_ = std::make_unique<protocol::UberDispatcher>(this);
tracing_agent_ =
std::make_unique<protocol::TracingAgent>(env, main_thread_);
tracing_agent_->Wire(node_dispatcher_.get());
if (worker_manager) {
worker_agent_ = std::make_unique<protocol::WorkerAgent>(worker_manager);
worker_agent_->Wire(node_dispatcher_.get());
}
runtime_agent_ = std::make_unique<protocol::RuntimeAgent>();
runtime_agent_->Wire(node_dispatcher_.get());
}
~ChannelImpl() override {
tracing_agent_->disable();
tracing_agent_.reset(); // Dispose before the dispatchers
if (worker_agent_) {
worker_agent_->disable();
worker_agent_.reset(); // Dispose before the dispatchers
}
runtime_agent_->disable();
runtime_agent_.reset(); // Dispose before the dispatchers
}
void dispatchProtocolMessage(const StringView& message) {
std::string raw_message = protocol::StringUtil::StringViewToUtf8(message);
std::unique_ptr<protocol::DictionaryValue> value =
protocol::DictionaryValue::cast(protocol::StringUtil::parseMessage(
raw_message, false));
int call_id;
std::string method;
node_dispatcher_->parseCommand(value.get(), &call_id, &method);
if (v8_inspector::V8InspectorSession::canDispatchMethod(
Utf8ToStringView(method)->string())) {
session_->dispatchProtocolMessage(message);
} else {
node_dispatcher_->dispatch(call_id, method, std::move(value),
raw_message);
}
}
void schedulePauseOnNextStatement(const std::string& reason) {
std::unique_ptr<StringBuffer> buffer = Utf8ToStringView(reason);
session_->schedulePauseOnNextStatement(buffer->string(), buffer->string());
}
bool preventShutdown() {
return prevent_shutdown_;
}
bool notifyWaitingForDisconnect() {
retaining_context_ = runtime_agent_->notifyWaitingForDisconnect();
return retaining_context_;
}
bool retainingContext() {
return retaining_context_;
}
private:
void sendResponse(
int callId,
std::unique_ptr<v8_inspector::StringBuffer> message) override {
sendMessageToFrontend(message->string());
}
void sendNotification(
std::unique_ptr<v8_inspector::StringBuffer> message) override {
sendMessageToFrontend(message->string());
}
void flushProtocolNotifications() override { }
void sendMessageToFrontend(const StringView& message) {
delegate_->SendMessageToFrontend(message);
}
void sendMessageToFrontend(const std::string& message) {
sendMessageToFrontend(Utf8ToStringView(message)->string());
}
using Serializable = protocol::Serializable;
void sendProtocolResponse(int callId,
std::unique_ptr<Serializable> message) override {
sendMessageToFrontend(message->serializeToJSON());
}
void sendProtocolNotification(
std::unique_ptr<Serializable> message) override {
sendMessageToFrontend(message->serializeToJSON());
}
void fallThrough(int callId,
const std::string& method,
const std::string& message) override {
DCHECK(false);
}
std::unique_ptr<protocol::RuntimeAgent> runtime_agent_;
std::unique_ptr<protocol::TracingAgent> tracing_agent_;
std::unique_ptr<protocol::WorkerAgent> worker_agent_;
std::unique_ptr<InspectorSessionDelegate> delegate_;
std::unique_ptr<v8_inspector::V8InspectorSession> session_;
std::unique_ptr<protocol::UberDispatcher> node_dispatcher_;
bool prevent_shutdown_;
bool retaining_context_;
};
class InspectorTimer {
public:
InspectorTimer(Environment* env,
double interval_s,
V8InspectorClient::TimerCallback callback,
void* data) : env_(env),
callback_(callback),
data_(data) {
uv_timer_init(env->event_loop(), &timer_);
int64_t interval_ms = 1000 * interval_s;
uv_timer_start(&timer_, OnTimer, interval_ms, interval_ms);
timer_.data = this;
}
InspectorTimer(const InspectorTimer&) = delete;
void Stop() {
if (timer_.data == nullptr) return;
timer_.data = nullptr;
uv_timer_stop(&timer_);
env_->CloseHandle(reinterpret_cast<uv_handle_t*>(&timer_), TimerClosedCb);
}
inline Environment* env() const { return env_; }
private:
static void OnTimer(uv_timer_t* uvtimer) {
InspectorTimer* timer = node::ContainerOf(&InspectorTimer::timer_, uvtimer);
timer->callback_(timer->data_);
}
static void TimerClosedCb(uv_handle_t* uvtimer) {
std::unique_ptr<InspectorTimer> timer(
node::ContainerOf(&InspectorTimer::timer_,
reinterpret_cast<uv_timer_t*>(uvtimer)));
// Unique_ptr goes out of scope here and pointer is deleted.
}
~InspectorTimer() = default;
Environment* env_;
uv_timer_t timer_;
V8InspectorClient::TimerCallback callback_;
void* data_;
friend std::unique_ptr<InspectorTimer>::deleter_type;
};
class InspectorTimerHandle {
public:
InspectorTimerHandle(Environment* env, double interval_s,
V8InspectorClient::TimerCallback callback, void* data) {
timer_ = new InspectorTimer(env, interval_s, callback, data);
env->AddCleanupHook(CleanupHook, this);
}
InspectorTimerHandle(const InspectorTimerHandle&) = delete;
~InspectorTimerHandle() {
Stop();
}
private:
void Stop() {
if (timer_ != nullptr) {
timer_->env()->RemoveCleanupHook(CleanupHook, this);
timer_->Stop();
}
timer_ = nullptr;
}
static void CleanupHook(void* data) {
static_cast<InspectorTimerHandle*>(data)->Stop();
}
InspectorTimer* timer_;
};
class SameThreadInspectorSession : public InspectorSession {
public:
SameThreadInspectorSession(
int session_id, std::shared_ptr<NodeInspectorClient> client)
: session_id_(session_id), client_(client) {}
~SameThreadInspectorSession() override;
void Dispatch(const v8_inspector::StringView& message) override;
private:
int session_id_;
std::weak_ptr<NodeInspectorClient> client_;
};
void NotifyClusterWorkersDebugEnabled(Environment* env) {
Isolate* isolate = env->isolate();
HandleScope handle_scope(isolate);
Local<Context> context = env->context();
// Send message to enable debug in cluster workers
Local<Object> message = Object::New(isolate);
message->Set(context, FIXED_ONE_BYTE_STRING(isolate, "cmd"),
FIXED_ONE_BYTE_STRING(isolate, "NODE_DEBUG_ENABLED")).Check();
ProcessEmit(env, "internalMessage", message);
}
#ifdef _WIN32
bool IsFilePath(const std::string& path) {
// '\\'
if (path.length() > 2 && path[0] == '\\' && path[1] == '\\')
return true;
// '[A-Z]:[/\\]'
if (path.length() < 3)
return false;
if ((path[0] >= 'A' && path[0] <= 'Z') || (path[0] >= 'a' && path[0] <= 'z'))
return path[1] == ':' && (path[2] == '/' || path[2] == '\\');
return false;
}
#else
bool IsFilePath(const std::string& path) {
return path.length() && path[0] == '/';
}
#endif // __POSIX__
} // namespace
class NodeInspectorClient : public V8InspectorClient {
public:
explicit NodeInspectorClient(node::Environment* env, bool is_main)
: env_(env), is_main_(is_main) {
client_ = V8Inspector::create(env->isolate(), this);
// TODO(bnoordhuis) Make name configurable from src/node.cc.
std::string name =
is_main_ ? GetHumanReadableProcessName() : GetWorkerLabel(env);
ContextInfo info(name);
info.is_default = true;
contextCreated(env->context(), info);
}
void runMessageLoopOnPause(int context_group_id) override {
waiting_for_resume_ = true;
runMessageLoop();
}
void waitForSessionsDisconnect() {
waiting_for_sessions_disconnect_ = true;
runMessageLoop();
}
void waitForFrontend() {
waiting_for_frontend_ = true;
runMessageLoop();
}
void maxAsyncCallStackDepthChanged(int depth) override {
if (waiting_for_sessions_disconnect_) {
// V8 isolate is mostly done and is only letting Inspector protocol
// clients gather data.
return;
}
if (auto agent = env_->inspector_agent()) {
if (depth == 0) {
agent->DisableAsyncHook();
} else {
agent->EnableAsyncHook();
}
}
}
void contextCreated(Local<Context> context, const ContextInfo& info) {
auto name_buffer = Utf8ToStringView(info.name);
auto origin_buffer = Utf8ToStringView(info.origin);
std::unique_ptr<StringBuffer> aux_data_buffer;
v8_inspector::V8ContextInfo v8info(
context, CONTEXT_GROUP_ID, name_buffer->string());
v8info.origin = origin_buffer->string();
if (info.is_default) {
aux_data_buffer = Utf8ToStringView("{\"isDefault\":true}");
} else {
aux_data_buffer = Utf8ToStringView("{\"isDefault\":false}");
}
v8info.auxData = aux_data_buffer->string();
client_->contextCreated(v8info);
}
void contextDestroyed(Local<Context> context) {
client_->contextDestroyed(context);
}
void quitMessageLoopOnPause() override {
waiting_for_resume_ = false;
}
void runIfWaitingForDebugger(int context_group_id) override {
waiting_for_frontend_ = false;
}
int connectFrontend(std::unique_ptr<InspectorSessionDelegate> delegate,
bool prevent_shutdown) {
int session_id = next_session_id_++;
channels_[session_id] = std::make_unique<ChannelImpl>(env_,
client_,
getWorkerManager(),
std::move(delegate),
getThreadHandle(),
prevent_shutdown);
return session_id;
}
void disconnectFrontend(int session_id) {
auto it = channels_.find(session_id);
if (it == channels_.end())
return;
bool retaining_context = it->second->retainingContext();
channels_.erase(it);
if (retaining_context) {
for (const auto& id_channel : channels_) {
if (id_channel.second->retainingContext())
return;
}
contextDestroyed(env_->context());
}
if (waiting_for_sessions_disconnect_ && !is_main_)
waiting_for_sessions_disconnect_ = false;
}
void dispatchMessageFromFrontend(int session_id, const StringView& message) {
channels_[session_id]->dispatchProtocolMessage(message);
}
Local<Context> ensureDefaultContextInGroup(int contextGroupId) override {
return env_->context();
}
void installAdditionalCommandLineAPI(Local<Context> context,
Local<Object> target) override {
Local<Function> installer = env_->inspector_console_extension_installer();
if (!installer.IsEmpty()) {
Local<Value> argv[] = {target};
// If there is an exception, proceed in JS land
USE(installer->Call(context, target, arraysize(argv), argv));
}
}
void ReportUncaughtException(Local<Value> error, Local<Message> message) {
Isolate* isolate = env_->isolate();
Local<Context> context = env_->context();
int script_id = message->GetScriptOrigin().ScriptID()->Value();
Local<v8::StackTrace> stack_trace = message->GetStackTrace();
if (!stack_trace.IsEmpty() && stack_trace->GetFrameCount() > 0 &&
script_id == stack_trace->GetFrame(isolate, 0)->GetScriptId()) {
script_id = 0;
}
const uint8_t DETAILS[] = "Uncaught";
client_->exceptionThrown(
context,
StringView(DETAILS, sizeof(DETAILS) - 1),
error,
ToProtocolString(isolate, message->Get())->string(),
ToProtocolString(isolate, message->GetScriptResourceName())->string(),
message->GetLineNumber(context).FromMaybe(0),
message->GetStartColumn(context).FromMaybe(0),
client_->createStackTrace(stack_trace),
script_id);
}
void startRepeatingTimer(double interval_s,
TimerCallback callback,
void* data) override {
timers_.emplace(std::piecewise_construct, std::make_tuple(data),
std::make_tuple(env_, interval_s, callback,
data));
}
void cancelTimer(void* data) override {
timers_.erase(data);
}
// Async stack traces instrumentation.
void AsyncTaskScheduled(const StringView& task_name, void* task,
bool recurring) {
client_->asyncTaskScheduled(task_name, task, recurring);
}
void AsyncTaskCanceled(void* task) {
client_->asyncTaskCanceled(task);
}
void AsyncTaskStarted(void* task) {
client_->asyncTaskStarted(task);
}
void AsyncTaskFinished(void* task) {
client_->asyncTaskFinished(task);
}
void AllAsyncTasksCanceled() {
client_->allAsyncTasksCanceled();
}
void schedulePauseOnNextStatement(const std::string& reason) {
for (const auto& id_channel : channels_) {
id_channel.second->schedulePauseOnNextStatement(reason);
}
}
bool hasConnectedSessions() {
for (const auto& id_channel : channels_) {
// Other sessions are "invisible" more most purposes
if (id_channel.second->preventShutdown())
return true;
}
return false;
}
bool notifyWaitingForDisconnect() {
bool retaining_context = false;
for (const auto& id_channel : channels_) {
if (id_channel.second->notifyWaitingForDisconnect())
retaining_context = true;
}
return retaining_context;
}
std::shared_ptr<MainThreadHandle> getThreadHandle() {
if (!interface_) {
interface_ = std::make_shared<MainThreadInterface>(
env_->inspector_agent());
}
return interface_->GetHandle();
}
std::shared_ptr<WorkerManager> getWorkerManager() {
if (!is_main_) {
return nullptr;
}
if (worker_manager_ == nullptr) {
worker_manager_ =
std::make_shared<WorkerManager>(getThreadHandle());
}
return worker_manager_;
}
bool IsActive() {
return !channels_.empty();
}
private:
bool shouldRunMessageLoop() {
if (waiting_for_frontend_)
return true;
if (waiting_for_sessions_disconnect_ || waiting_for_resume_) {
return hasConnectedSessions();
}
return false;
}
void runMessageLoop() {
if (running_nested_loop_)
return;
running_nested_loop_ = true;
while (shouldRunMessageLoop()) {
if (interface_) interface_->WaitForFrontendEvent();
env_->RunAndClearInterrupts();
}
running_nested_loop_ = false;
}
double currentTimeMS() override {
return env_->isolate_data()->platform()->CurrentClockTimeMillis();
}
std::unique_ptr<StringBuffer> resourceNameToUrl(
const StringView& resource_name_view) override {
std::string resource_name =
protocol::StringUtil::StringViewToUtf8(resource_name_view);
if (!IsFilePath(resource_name))
return nullptr;
node::url::URL url = node::url::URL::FromFilePath(resource_name);
// TODO(ak239spb): replace this code with url.href().
// Refs: path_to_url
return Utf8ToStringView(url.protocol() + "//" + url.path());
}
node::Environment* env_;
bool is_main_;
bool running_nested_loop_ = false;
std::unique_ptr<V8Inspector> client_;
// Note: ~ChannelImpl may access timers_ so timers_ has to come first.
std::unordered_map<void*, InspectorTimerHandle> timers_;
std::unordered_map<int, std::unique_ptr<ChannelImpl>> channels_;
int next_session_id_ = 1;
bool waiting_for_resume_ = false;
bool waiting_for_frontend_ = false;
bool waiting_for_sessions_disconnect_ = false;
// Allows accessing Inspector from non-main threads
std::shared_ptr<MainThreadInterface> interface_;
std::shared_ptr<WorkerManager> worker_manager_;
};
Agent::Agent(Environment* env)
: parent_env_(env),
debug_options_(env->options()->debug_options()),
host_port_(env->inspector_host_port()) {}
Agent::~Agent() {}
bool Agent::Start(const std::string& path,
const DebugOptions& options,
std::shared_ptr<ExclusiveAccess<HostPort>> host_port,
bool is_main) {
path_ = path;
debug_options_ = options;
CHECK_NOT_NULL(host_port);
host_port_ = host_port;
client_ = std::make_shared<NodeInspectorClient>(parent_env_, is_main);
if (parent_env_->owns_inspector()) {
Mutex::ScopedLock lock(start_io_thread_async_mutex);
CHECK_EQ(start_io_thread_async_initialized.exchange(true), false);
CHECK_EQ(0, uv_async_init(parent_env_->event_loop(),
&start_io_thread_async,
StartIoThreadAsyncCallback));
uv_unref(reinterpret_cast<uv_handle_t*>(&start_io_thread_async));
start_io_thread_async.data = this;
// Ignore failure, SIGUSR1 won't work, but that should not block node start.
StartDebugSignalHandler();
parent_env_->AddCleanupHook([](void* data) {
Environment* env = static_cast<Environment*>(data);
{
Mutex::ScopedLock lock(start_io_thread_async_mutex);
start_io_thread_async.data = nullptr;
}
// This is global, will never get freed
env->CloseHandle(&start_io_thread_async, [](uv_async_t*) {
CHECK(start_io_thread_async_initialized.exchange(false));
});
}, parent_env_);
}
AtExit(parent_env_, [](void* env) {
Agent* agent = static_cast<Environment*>(env)->inspector_agent();
if (agent->IsActive()) {
agent->WaitForDisconnect();
}
}, parent_env_);
bool wait_for_connect = options.wait_for_connect();
if (parent_handle_) {
wait_for_connect = parent_handle_->WaitForConnect();
parent_handle_->WorkerStarted(client_->getThreadHandle(), wait_for_connect);
} else if (!options.inspector_enabled || !StartIoThread()) {
return false;
}
// Patch the debug options to implement waitForDebuggerOnStart for
// the NodeWorker.enable method.
if (wait_for_connect) {
CHECK(!parent_env_->has_serialized_options());
debug_options_.EnableBreakFirstLine();
parent_env_->options()->get_debug_options()->EnableBreakFirstLine();
client_->waitForFrontend();
}
return true;
}
bool Agent::StartIoThread() {
if (io_ != nullptr)
return true;
CHECK_NOT_NULL(client_);
io_ = InspectorIo::Start(client_->getThreadHandle(),
path_,
host_port_,
debug_options_.inspect_publish_uid);
if (io_ == nullptr) {
return false;
}
NotifyClusterWorkersDebugEnabled(parent_env_);
return true;
}
void Agent::Stop() {
io_.reset();
}
std::unique_ptr<InspectorSession> Agent::Connect(
std::unique_ptr<InspectorSessionDelegate> delegate,
bool prevent_shutdown) {
CHECK_NOT_NULL(client_);
int session_id = client_->connectFrontend(std::move(delegate),
prevent_shutdown);
return std::unique_ptr<InspectorSession>(
new SameThreadInspectorSession(session_id, client_));
}
std::unique_ptr<InspectorSession> Agent::ConnectToMainThread(
std::unique_ptr<InspectorSessionDelegate> delegate,
bool prevent_shutdown) {
CHECK_NOT_NULL(parent_handle_);
CHECK_NOT_NULL(client_);
auto thread_safe_delegate =
client_->getThreadHandle()->MakeDelegateThreadSafe(std::move(delegate));
return parent_handle_->Connect(std::move(thread_safe_delegate),
prevent_shutdown);
}
void Agent::WaitForDisconnect() {
CHECK_NOT_NULL(client_);
bool is_worker = parent_handle_ != nullptr;
parent_handle_.reset();
if (client_->hasConnectedSessions() && !is_worker) {
fprintf(stderr, "Waiting for the debugger to disconnect...\n");
fflush(stderr);
}
if (!client_->notifyWaitingForDisconnect()) {
client_->contextDestroyed(parent_env_->context());
} else if (is_worker) {
client_->waitForSessionsDisconnect();
}
if (io_ != nullptr) {
io_->StopAcceptingNewConnections();
client_->waitForSessionsDisconnect();
}
}
void Agent::ReportUncaughtException(Local<Value> error,
Local<Message> message) {
if (!IsListening())
return;
client_->ReportUncaughtException(error, message);
WaitForDisconnect();
}
void Agent::PauseOnNextJavascriptStatement(const std::string& reason) {
client_->schedulePauseOnNextStatement(reason);
}
void Agent::RegisterAsyncHook(Isolate* isolate,
Local<Function> enable_function,
Local<Function> disable_function) {
enable_async_hook_function_.Reset(isolate, enable_function);
disable_async_hook_function_.Reset(isolate, disable_function);
if (pending_enable_async_hook_) {
CHECK(!pending_disable_async_hook_);
pending_enable_async_hook_ = false;
EnableAsyncHook();
} else if (pending_disable_async_hook_) {
CHECK(!pending_enable_async_hook_);
pending_disable_async_hook_ = false;
DisableAsyncHook();
}
}
void Agent::EnableAsyncHook() {
if (!enable_async_hook_function_.IsEmpty()) {
ToggleAsyncHook(parent_env_->isolate(), enable_async_hook_function_);
} else if (pending_disable_async_hook_) {
CHECK(!pending_enable_async_hook_);
pending_disable_async_hook_ = false;
} else {
pending_enable_async_hook_ = true;
}
}
void Agent::DisableAsyncHook() {
if (!disable_async_hook_function_.IsEmpty()) {
ToggleAsyncHook(parent_env_->isolate(), disable_async_hook_function_);
} else if (pending_enable_async_hook_) {
CHECK(!pending_disable_async_hook_);
pending_enable_async_hook_ = false;
} else {
pending_disable_async_hook_ = true;
}
}
void Agent::ToggleAsyncHook(Isolate* isolate,
const Global<Function>& fn) {
// Guard against running this during cleanup -- no async events will be
// emitted anyway at that point anymore, and calling into JS is not possible.
// This should probably not be something we're attempting in the first place,
// Refs: path_to_url#discussion_r456006039
if (!parent_env_->can_call_into_js()) return;
CHECK(parent_env_->has_run_bootstrapping_code());
HandleScope handle_scope(isolate);
CHECK(!fn.IsEmpty());
auto context = parent_env_->context();
v8::TryCatch try_catch(isolate);
USE(fn.Get(isolate)->Call(context, Undefined(isolate), 0, nullptr));
if (try_catch.HasCaught() && !try_catch.HasTerminated()) {
PrintCaughtException(isolate, context, try_catch);
FatalError("\nnode::inspector::Agent::ToggleAsyncHook",
"Cannot toggle Inspector's AsyncHook, please report this.");
}
}
void Agent::AsyncTaskScheduled(const StringView& task_name, void* task,
bool recurring) {
client_->AsyncTaskScheduled(task_name, task, recurring);
}
void Agent::AsyncTaskCanceled(void* task) {
client_->AsyncTaskCanceled(task);
}
void Agent::AsyncTaskStarted(void* task) {
client_->AsyncTaskStarted(task);
}
void Agent::AsyncTaskFinished(void* task) {
client_->AsyncTaskFinished(task);
}
void Agent::AllAsyncTasksCanceled() {
client_->AllAsyncTasksCanceled();
}
void Agent::RequestIoThreadStart() {
// We need to attempt to interrupt V8 flow (in case Node is running
// continuous JS code) and to wake up libuv thread (in case Node is waiting
// for IO events)
CHECK(start_io_thread_async_initialized);
uv_async_send(&start_io_thread_async);
parent_env_->RequestInterrupt([this](Environment*) {
StartIoThread();
});
CHECK(start_io_thread_async_initialized);
uv_async_send(&start_io_thread_async);
}
void Agent::ContextCreated(Local<Context> context, const ContextInfo& info) {
if (client_ == nullptr) // This happens for a main context
return;
client_->contextCreated(context, info);
}
bool Agent::WillWaitForConnect() {
if (debug_options_.wait_for_connect()) return true;
if (parent_handle_)
return parent_handle_->WaitForConnect();
return false;
}
bool Agent::IsActive() {
if (client_ == nullptr)
return false;
return io_ != nullptr || client_->IsActive();
}
void Agent::SetParentHandle(
std::unique_ptr<ParentInspectorHandle> parent_handle) {
parent_handle_ = std::move(parent_handle);
}
std::unique_ptr<ParentInspectorHandle> Agent::GetParentHandle(
int thread_id, const std::string& url) {
if (!parent_handle_) {
return client_->getWorkerManager()->NewParentHandle(thread_id, url);
} else {
return parent_handle_->NewParentInspectorHandle(thread_id, url);
}
}
void Agent::WaitForConnect() {
CHECK_NOT_NULL(client_);
client_->waitForFrontend();
}
std::shared_ptr<WorkerManager> Agent::GetWorkerManager() {
CHECK_NOT_NULL(client_);
return client_->getWorkerManager();
}
std::string Agent::GetWsUrl() const {
if (io_ == nullptr)
return "";
return io_->GetWsUrl();
}
SameThreadInspectorSession::~SameThreadInspectorSession() {
auto client = client_.lock();
if (client)
client->disconnectFrontend(session_id_);
}
void SameThreadInspectorSession::Dispatch(
const v8_inspector::StringView& message) {
auto client = client_.lock();
if (client)
client->dispatchMessageFromFrontend(session_id_, message);
}
} // namespace inspector
} // namespace node
```
|
Lieutenant General Colin Campbell (1754–1814) was Lieutenant Governor of Gibraltar.
Military career
Campbell was commissioned into the 71st Regiment of Foot in 1771 and then transferred to the 6th Regiment of Foot in 1783. In 1796 he went to Ireland and two years later fought at the Battle of Vinegar Hill.
In 1810 he was appointed Lieutenant Governor of Gibraltar. During the Peninsular War he insisted on keeping Gibraltar well garrisoned and also regarded Tarifa as within his command and denied it to the French invading force there.
His son Guy Campbell was created a Baronet in his honour in 1815.
References
|-
1754 births
1814 deaths
British Army lieutenant generals
Governors of Gibraltar
71st Highlanders officers
People of the Irish Rebellion of 1798
Royal Warwickshire Fusiliers officers
British Army personnel of the Napoleonic Wars
18th-century British Army personnel
|
```yaml
homepage: "path_to_url"
language: jvm
primary_contact: "ebourg@apache.org"
auto_ccs:
- "emmanuel.bourg@gmail.com"
fuzzing_engines:
- libfuzzer
sanitizers:
- address
main_repo: "path_to_url"
```
|
```c++
#include <vector>
#include "xtensor/xmultiindex_iterator.hpp"
#include "test_common.hpp"
namespace xt
{
TEST_SUITE("xmultiindex_iterator")
{
TEST_CASE("sum")
{
using shape_type = std::vector<std::size_t>;
using iter_type = xmultiindex_iterator<shape_type>;
shape_type roi_begin{2, 3, 4};
shape_type roi_end{3, 5, 6};
shape_type current{2, 3, 4};
iter_type iter(roi_begin, roi_end, current, 0);
iter_type end(roi_begin, roi_end, roi_end, 4);
shape_type should(3);
for (should[0] = roi_begin[0]; should[0] < roi_end[0]; ++should[0])
{
for (should[1] = roi_begin[1]; should[1] < roi_end[1]; ++should[1])
{
for (should[2] = roi_begin[2]; should[2] < roi_end[2]; ++should[2])
{
EXPECT_EQ(*iter, should);
++iter;
}
}
}
EXPECT_TRUE(iter == end);
}
}
}
```
|
```c
/**
******************************************************************************
* @file usb_prop.c
* @author MCD Application Team
* @version V4.0.0
* @date 21-January-2013
* @brief All processings related to Custom HID Demo
******************************************************************************
* @attention
*
* <h2><center>© COPYRIGHT 2013 STMicroelectronics</center></h2>
*
*
* 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.
*
******************************************************************************
*/
/* Includes your_sha256_hash--*/
#include "hw_config.h"
#include "usb_lib.h"
#include "usb_conf.h"
#include "usb_prop.h"
#include "usb_desc.h"
#include "usb_pwr.h"
#include "usb_bot.h"
#include "memory.h"
#include "mass_mal.h"
/* Private typedef -----------------------------------------------------------*/
/* Private define ------------------------------------------------------------*/
/* Private macro -------------------------------------------------------------*/
/* Private variables ---------------------------------------------------------*/
uint32_t ProtocolValue;
__IO uint8_t EXTI_Enable;
__IO uint8_t Request = 0;
uint8_t Report_Buf[2];
/* your_sha256_hash---------- */
/* Structures initializations */
/* your_sha256_hash---------- */
DEVICE Device_Table =
{
EP_NUM,
1
};
DEVICE_PROP Device_Property =
{
CustomHID_init,
CustomHID_Reset,
CustomHID_Status_In,
CustomHID_Status_Out,
CustomHID_Data_Setup,
CustomHID_NoData_Setup,
CustomHID_Get_Interface_Setting,
CustomHID_GetDeviceDescriptor,
CustomHID_GetConfigDescriptor,
CustomHID_GetStringDescriptor,
0,
0x40 /*MAX PACKET SIZE*/
};
USER_STANDARD_REQUESTS User_Standard_Requests =
{
CustomHID_GetConfiguration,
CustomHID_SetConfiguration,
CustomHID_GetInterface,
CustomHID_SetInterface,
CustomHID_GetStatus,
CustomHID_ClearFeature,
CustomHID_SetEndPointFeature,
CustomHID_SetDeviceFeature,
CustomHID_SetDeviceAddress
};
ONE_DESCRIPTOR Device_Descriptor =
{
(uint8_t*)Composite_DeviceDescriptor,
Composite_SIZ_DEVICE_DESC
};
ONE_DESCRIPTOR Config_Descriptor =
{
(uint8_t*)Composite_ConfigDescriptor,
Composite_SIZ_CONFIG_DESC
};
ONE_DESCRIPTOR CustomHID_Report_Descriptor =
{
(uint8_t *)CustomHID_ReportDescriptor,
CUSTOMHID_SIZ_REPORT_DESC
};
ONE_DESCRIPTOR CustomHID_Hid_Descriptor =
{
(uint8_t*)Composite_ConfigDescriptor + CUSTOMHID_OFF_HID_DESC,
CUSTOMHID_SIZ_HID_DESC
};
ONE_DESCRIPTOR String_Descriptor[4] =
{
{(uint8_t*)Composite_StringLangID, Composite_SIZ_STRING_LANGID},
{(uint8_t*)Composite_StringVendor, Composite_SIZ_STRING_VENDOR},
{(uint8_t*)Composite_StringProduct, Composite_SIZ_STRING_PRODUCT},
{(uint8_t*)Composite_StringSerial, Composite_SIZ_STRING_SERIAL}
};
/* Extern variables ----------------------------------------------------------*/
/* Private function prototypes -----------------------------------------------*/
/* Extern function prototypes ------------------------------------------------*/
/* Private functions ---------------------------------------------------------*/
/*CustomHID_SetReport_Feature function prototypes*/
uint8_t *CustomHID_SetReport_Feature(uint16_t Length);
extern unsigned char Bot_State;
extern Bulk_Only_CBW CBW;
uint32_t Max_Lun = 0;
/*******************************************************************************
* Function Name : Get_Max_Lun
* Description : Handle the Get Max Lun request.
* Input : uint16_t Length.
* Output : None.
* Return : None.
*******************************************************************************/
uint8_t *Get_Max_Lun(uint16_t Length)
{
if (Length == 0)
{
pInformation->Ctrl_Info.Usb_wLength = LUN_DATA_LENGTH;
return 0;
}
else
{
return((uint8_t*)(&Max_Lun));
}
}
/*******************************************************************************
* Function Name : CustomHID_init.
* Description : Custom HID init routine.
* Input : None.
* Output : None.
* Return : None.
*******************************************************************************/
void CustomHID_init(void)
{
/* Update the serial number string descriptor with the data from the unique
ID*/
Get_SerialNum();
pInformation->Current_Configuration = 0;
/* Connect the device */
PowerOn();
/* Perform basic device initialization operations */
USB_SIL_Init();
bDeviceState = UNCONNECTED;
}
/*******************************************************************************
* Function Name : CustomHID_Reset.
* Description : Custom HID reset routine.
* Input : None.
* Output : None.
* Return : None.
*******************************************************************************/
void CustomHID_Reset(void)
{
/* Set Composite_DEVICE as not configured */
pInformation->Current_Configuration = 0;
pInformation->Current_Interface = 0;/*the default Interface*/
/* Current Feature initialization */
pInformation->Current_Feature = Composite_ConfigDescriptor[7];
SetBTABLE(BTABLE_ADDRESS);
/* Initialize Endpoint 0 */
SetEPType(ENDP0, EP_CONTROL);
SetEPTxStatus(ENDP0, EP_TX_STALL);
SetEPRxAddr(ENDP0, ENDP0_RXADDR);
SetEPTxAddr(ENDP0, ENDP0_TXADDR);
Clear_Status_Out(ENDP0);
SetEPRxCount(ENDP0, Device_Property.MaxPacketSize);
SetEPRxValid(ENDP0);
/* Initialize Endpoint 1 */
SetEPType(ENDP1, EP_INTERRUPT);
SetEPTxAddr(ENDP1, ENDP1_TXADDR);
SetEPRxAddr(ENDP1, ENDP1_RXADDR);
SetEPTxCount(ENDP1, 2);
SetEPRxCount(ENDP1, 2);
SetEPRxStatus(ENDP1, EP_RX_VALID);
SetEPTxStatus(ENDP1, EP_TX_NAK);
/* Initialize Endpoint 2 IN */
SetEPType(ENDP2, EP_BULK);
SetEPTxCount(ENDP1, 64);
SetEPTxAddr(ENDP2, ENDP1_TXADDR);
SetEPTxStatus(ENDP2, EP_TX_NAK);
/* Initialize Endpoint 2 OUT */
SetEPType(ENDP2, EP_BULK);
SetEPRxAddr(ENDP2, ENDP2_RXADDR);
SetEPRxCount(ENDP2, 64);
SetEPRxStatus(ENDP2, EP_RX_VALID);
/* Set this device to response on default address */
SetDeviceAddress(0);
CBW.dSignature = BOT_CBW_SIGNATURE;
Bot_State = BOT_IDLE;
bDeviceState = ATTACHED;
}
/*******************************************************************************
* Function Name : CustomHID_SetConfiguration.
* Description : Update the device state to configured and command the ADC
* conversion.
* Input : None.
* Output : None.
* Return : None.
*******************************************************************************/
void CustomHID_SetConfiguration(void)
{
if (pInformation->Current_Configuration != 0)
{
/* Device configured */
bDeviceState = CONFIGURED;
/* Start ADC Software Conversion */
#if defined(STM32L1XX_MD) || defined(STM32L1XX_HD)|| defined(STM32L1XX_MD_PLUS)|| defined(STM32F37X)
ADC_SoftwareStartConv(ADC1);
#elif defined (STM32F30X)
ADC_StartConversion(ADC1);
#else
ADC_SoftwareStartConvCmd(ADC1, ENABLE);
#endif /* STM32L1XX_XD */
ClearDTOG_TX(ENDP2);
ClearDTOG_RX(ENDP2);
Bot_State = BOT_IDLE; /* set the Bot state machine to the IDLE state */
}
}
/*******************************************************************************
* Function Name : CustomHID_SetConfiguration.
* Description : Update the device state to addressed.
* Input : None.
* Output : None.
* Return : None.
*******************************************************************************/
void CustomHID_SetDeviceAddress (void)
{
bDeviceState = ADDRESSED;
}
/*******************************************************************************
* Function Name : CustomHID_Status_In.
* Description : Joystick status IN routine.
* Input : None.
* Output : None.
* Return : None.
*******************************************************************************/
void CustomHID_Status_In(void)
{
BitAction Led_State;
if (Report_Buf[1] == 0)
{
Led_State = Bit_RESET;
}
else
{
Led_State = Bit_SET;
}
switch (Report_Buf[0])
{
/*Change LED's status according to the host report*/
case 1: /* Led 1 */
if (Led_State != Bit_RESET)
{
STM_EVAL_LEDOn(LED1);
}
else
{
STM_EVAL_LEDOff(LED1);
}
break;
case 2: /* Led 2 */
if (Led_State != Bit_RESET)
{
STM_EVAL_LEDOn(LED2);
}
else
{
STM_EVAL_LEDOff(LED2);
}
break;
case 3:/* Led 3 */
if (Led_State != Bit_RESET)
{
STM_EVAL_LEDOn(LED3);
}
else
{
STM_EVAL_LEDOff(LED3);
}
break;
case 4:/* Led 4 */
if (Led_State != Bit_RESET)
{
STM_EVAL_LEDOn(LED4);
}
else
{
STM_EVAL_LEDOff(LED4);
}
break;
default:
STM_EVAL_LEDOff(LED1);
STM_EVAL_LEDOff(LED2);
STM_EVAL_LEDOff(LED3);
STM_EVAL_LEDOff(LED4);
break;
}
}
/*******************************************************************************
* Function Name : CustomHID_Status_Out
* Description : Joystick status OUT routine.
* Input : None.
* Output : None.
* Return : None.
*******************************************************************************/
void CustomHID_Status_Out (void)
{
}
/*******************************************************************************
* Function Name : CustomHID_Data_Setup
* Description : Handle the data class specific requests.
* Input : Request Nb.
* Output : None.
* Return : USB_UNSUPPORT or USB_SUCCESS.
*******************************************************************************/
RESULT CustomHID_Data_Setup(uint8_t RequestNo)
{
uint8_t *(*CopyRoutine)(uint16_t);
if (pInformation->USBwIndex != 0)
return USB_UNSUPPORT;
CopyRoutine = NULL;
if ((RequestNo == GET_DESCRIPTOR)
&& (Type_Recipient == (STANDARD_REQUEST | INTERFACE_RECIPIENT))
)
{
if (pInformation->USBwValue1 == REPORT_DESCRIPTOR)
{
CopyRoutine = CustomHID_GetReportDescriptor;
}
else if (pInformation->USBwValue1 == HID_DESCRIPTOR_TYPE)
{
CopyRoutine = CustomHID_GetHIDDescriptor;
}
} /* End of GET_DESCRIPTOR */
/*** GET_PROTOCOL, GET_REPORT, SET_REPORT ***/
else if ( (Type_Recipient == (CLASS_REQUEST | INTERFACE_RECIPIENT)) )
{
switch( RequestNo )
{
case GET_PROTOCOL:
CopyRoutine = CustomHID_GetProtocolValue;
break;
case SET_REPORT:
CopyRoutine = CustomHID_SetReport_Feature;
Request = SET_REPORT;
break;
default:
break;
}
}
if (CopyRoutine == NULL)
{
return USB_UNSUPPORT;
}
pInformation->Ctrl_Info.CopyData = CopyRoutine;
pInformation->Ctrl_Info.Usb_wOffset = 0;
(*CopyRoutine)(0);
return USB_SUCCESS;
}
/*******************************************************************************
* Function Name : CustomHID_SetReport_Feature
* Description : Set Feature request handling
* Input : Length.
* Output : None.
* Return : Buffer
*******************************************************************************/
uint8_t *CustomHID_SetReport_Feature(uint16_t Length)
{
if (Length == 0)
{
pInformation->Ctrl_Info.Usb_wLength = 2;
return NULL;
}
else
{
return Report_Buf;
}
}
/*******************************************************************************
* Function Name : CustomHID_NoData_Setup
* Description : handle the no data class specific requests
* Input : Request Nb.
* Output : None.
* Return : USB_UNSUPPORT or USB_SUCCESS.
*******************************************************************************/
RESULT CustomHID_NoData_Setup(uint8_t RequestNo)
{
if ((Type_Recipient == (CLASS_REQUEST | INTERFACE_RECIPIENT))
&& (RequestNo == SET_PROTOCOL))
{
return CustomHID_SetProtocol();
}
else
{
return USB_UNSUPPORT;
}
}
/*******************************************************************************
* Function Name : CustomHID_GetDeviceDescriptor.
* Description : Gets the device descriptor.
* Input : Length
* Output : None.
* Return : The address of the device descriptor.
*******************************************************************************/
uint8_t *CustomHID_GetDeviceDescriptor(uint16_t Length)
{
return Standard_GetDescriptorData(Length, &Device_Descriptor);
}
/*******************************************************************************
* Function Name : CustomHID_GetConfigDescriptor.
* Description : Gets the configuration descriptor.
* Input : Length
* Output : None.
* Return : The address of the configuration descriptor.
*******************************************************************************/
uint8_t *CustomHID_GetConfigDescriptor(uint16_t Length)
{
return Standard_GetDescriptorData(Length, &Config_Descriptor);
}
/*******************************************************************************
* Function Name : CustomHID_GetStringDescriptor
* Description : Gets the string descriptors according to the needed index
* Input : Length
* Output : None.
* Return : The address of the string descriptors.
*******************************************************************************/
uint8_t *CustomHID_GetStringDescriptor(uint16_t Length)
{
uint8_t wValue0 = pInformation->USBwValue0;
if (wValue0 > 4)
{
return NULL;
}
else
{
return Standard_GetDescriptorData(Length, &String_Descriptor[wValue0]);
}
}
/*******************************************************************************
* Function Name : CustomHID_GetReportDescriptor.
* Description : Gets the HID report descriptor.
* Input : Length
* Output : None.
* Return : The address of the configuration descriptor.
*******************************************************************************/
uint8_t *CustomHID_GetReportDescriptor(uint16_t Length)
{
return Standard_GetDescriptorData(Length, &CustomHID_Report_Descriptor);
}
/*******************************************************************************
* Function Name : CustomHID_GetHIDDescriptor.
* Description : Gets the HID descriptor.
* Input : Length
* Output : None.
* Return : The address of the configuration descriptor.
*******************************************************************************/
uint8_t *CustomHID_GetHIDDescriptor(uint16_t Length)
{
return Standard_GetDescriptorData(Length, &CustomHID_Hid_Descriptor);
}
/*******************************************************************************
* Function Name : CustomHID_Get_Interface_Setting.
* Description : tests the interface and the alternate setting according to the
* supported one.
* Input : - Interface : interface number.
* - AlternateSetting : Alternate Setting number.
* Output : None.
* Return : USB_SUCCESS or USB_UNSUPPORT.
*******************************************************************************/
RESULT CustomHID_Get_Interface_Setting(uint8_t Interface, uint8_t AlternateSetting)
{
if (AlternateSetting > 0)
{
return USB_UNSUPPORT;
}
else if (Interface > 0)
{
return USB_UNSUPPORT;
}
return USB_SUCCESS;
}
/*******************************************************************************
* Function Name : CustomHID_SetProtocol
* Description : Joystick Set Protocol request routine.
* Input : None.
* Output : None.
* Return : USB SUCCESS.
*******************************************************************************/
RESULT CustomHID_SetProtocol(void)
{
uint8_t wValue0 = pInformation->USBwValue0;
ProtocolValue = wValue0;
return USB_SUCCESS;
}
/*******************************************************************************
* Function Name : CustomHID_GetProtocolValue
* Description : get the protocol value
* Input : Length.
* Output : None.
* Return : address of the protocol value.
*******************************************************************************/
uint8_t *CustomHID_GetProtocolValue(uint16_t Length)
{
if (Length == 0)
{
pInformation->Ctrl_Info.Usb_wLength = 1;
return NULL;
}
else
{
return (uint8_t *)(&ProtocolValue);
}
}
void CustomHID_ClearFeature (void)
{
if (CBW.dSignature != BOT_CBW_SIGNATURE)
Bot_Abort(BOTH_DIR);
}
/************************ (C) COPYRIGHT STMicroelectronics *****END OF FILE****/
```
|
The Joy of Sets is an Australian comedy television series looking at the elements used to construct television shows. The show was originally broadcast weekly by the Nine Network, premiering on 20 September 2011.
The show was written and hosted by comedians Tony Martin and Ed Kavalee, and produced by Zapruder's Other Films, the production company owned by Andrew Denton. Martin and Kavalee previously worked together in 2006 and 2007 hosting the popular Australian radio program Get This.
Outline
The premise of The Joy of Sets was to have each episode focus on one element of television production. The first episode, for example, focused on opening credits of television shows, while the episode's title referred to the term used in the entertainment industry for credits, "selling the meat".
The show was filmed in front of a studio audience at Technology Park, Alexandria, Sydney, however it did not screen live-to-air.
Prior to its production, it was stated that the show would offer "a unique take on television – the good, the bad and the gloriously misguided". While this led to early comparisons with another popular Zapruder production, The Gruen Transfer, the release of The Joy of Sets revealed it to have a completely different structure and content.
Each episode of the show employed various methods to explain the techniques used, including discussion and banter between hosts Martin and Kavalee, video clips from classic and contemporary free-to-air and pay TV programs, a celebrity guest related to the topic of that week's episode, re-enactments by the hosts and guests, and audience participation.
Warwick Capper appeared as a guest in each episode, making an unexpected cameo appearance dressed only in gold hotpants during one or more of the re-enactments. A regular segment in each episode was a quiz called "Not on my network", where a member of the audience had to identify which of three unlikely options had actually been a real television program; this included a gift shop featuring a different attendant each episode, usually a former gift shop host from an old Australian television game show, and different tacky television memorabilia each program as possible prizes. Another regular part of the program was Martin announcing that the show would conclude with a special feature under the end credits, only to have Kavalee remind him that the show had no end credits, which would be met with an angry outburst by Martin or an invited guest just as the episode faded off air.
Episodes
The first episode aired nationally in Australia at 9:00 pm on Tuesday, 20 September 2011, and featured guests Warwick Capper and Peter Phelps. The first season was scheduled for eight episodes. The first four episodes remained in the 9:00 pm timeslot, however, from the fifth episode, the program was screened in the 10:30 pm Tuesday slot.
Reception
The Joy of Sets achieved good ratings for their debut episode on 20 September 2011, achieving an audience of over 1.1 million viewers. However the second episode which aired on 27 September drew an audience of 545,000 viewers. By the fourth episode (aired on 11 October), audiences had slumped to 488,000 which prompted Ch-9 to move the program to its later timeslot. The final episode which aired at 10.30pm on 8 November drew an audience of 225,000.
Reviews were mixed. Andrew Murfett of the Melbourne Age thought that TJOS was the best Australian light-entertainment show of 2011, calling it the 'hidden gem' of the year and saying it deserved a better audience. The TV review website Change the Channel referred to the debut episode of TJOS as enjoyable but lightweight, commenting that "Tony and Ed seem to be enjoying themselves but at the end of the day, this is a nice, amusing, chat show about TV".
Matt Smith, writing on Crikey.com praised the show, saying it was "smart, funny, and interesting all at once. It's well-scripted and Tony Martin and Ed Kavalee are entertaining hosts". Andrew Williams of 6PR radio, praised the show saying the opening segment (of episode 1) was "funnier than a whole episode of Good News World. These guys have a natural easy chemistry that just works." He also commented that the show felt a little awkward at times but overall was "charming". Joey Alcock on imdb.com wrote that the show gave the hosts great leeway to create humorous moments and most of the gags hit the mark. "Arguably the most compelling edge that The Joy of Sets has is Martin's extensive knowledge of television shows, and particularly some of the more obscure and often esoteric moments in TV history". He did comment on the disproportionately high number of longterm fans of Martin's and Kavalee's previous work (particularly Get This) amongst the live audience which he believed prompted the hosts to sometimes overly rely on legacy material and in-jokes.
David Knox writing on tvtonight felt the show was cheap and cheerful but overly scripted, missing the chance to work on the hosts’ abilities to perform live. W D Nicholson, who attended the live taping of two of the episodes, wrote "hosts Tony Martin and Ed Kavalee were in fine form. Simply put-they are funny. The comedic interaction between the pair has always been excellent". He also wrote that during the taping, the show was "Get This in the flesh" but when the recorded material was cut down to 22 minutes, the quality did not feel the same. Melinda Houston of the Sunday Age, nominated it as the most disappointing Australian show of 2011, saying "It pains me to say it. I wanted to love it so badly". Deborah Grunfeld, writing in WHO magazine, included the show on her list of worst TV shows of 2011.
References
2011 Australian television series debuts
2011 Australian television series endings
Nine Network original programming
2010s Australian comedy television series
English-language television shows
|
Ponneri railway station is one of the railway stations of the Chennai Central–Gummidipoondi section of the Chennai Suburban Railway Network. It serves the neighbourhood of Ponneri, a suburb of Chennai, and is located 34 km north of Chennai Central railway station. It has an elevation of 15 m above sea level.
History
The lines at the station were electrified on 13 April 1979, with the electrification of the Chennai Central–Gummidipoondi section.
See also
Chennai Suburban Railway
References
External links
Ponneri railway station on IndiaRailInfo.com
Stations of Chennai Suburban Railway
Railway stations in Tiruvallur district
|
Hirnyk () is a surname of Ukrainian origin. It literally means a miner (occupation).
Notable Hirnyks
Oleksa Hirnyk (1912–1978), Hero of Ukraine, a Soviet dissident, burned himself in protest against Russification
See also
Eastern Slavic naming customs
External links
The origin of names and surnames
Ukrainian-language surnames
|
```objective-c
/*
**
** Permission is hereby granted, free of charge, to any person obtaining a copy
** of this software and/or associated documentation files (the "Materials"),
** to deal in the Materials without restriction, including without limitation
** the rights to use, copy, modify, merge, publish, distribute, sublicense,
** and/or sell copies of the Materials, and to permit persons to whom the
** Materials are 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 Materials.
**
** MODIFICATIONS TO THIS FILE MAY MEAN IT NO LONGER ACCURATELY REFLECTS KHRONOS
** STANDARDS. THE UNMODIFIED, NORMATIVE VERSIONS OF KHRONOS SPECIFICATIONS AND
** HEADER INFORMATION ARE LOCATED AT path_to_url
**
** THE MATERIALS ARE 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 MATERIALS OR THE USE OR OTHER DEALINGS
** IN THE MATERIALS.
*/
#ifndef OPENCLstd_H
#define OPENCLstd_H
#ifdef __cplusplus
namespace OpenCLLIB {
enum Entrypoints {
// Section 2.1: Math extended instructions
Acos = 0,
Acosh = 1,
Acospi = 2,
Asin = 3,
Asinh = 4,
Asinpi = 5,
Atan = 6,
Atan2 = 7,
Atanh = 8,
Atanpi = 9,
Atan2pi = 10,
Cbrt = 11,
Ceil = 12,
Copysign = 13,
Cos = 14,
Cosh = 15,
Cospi = 16,
Erfc = 17,
Erf = 18,
Exp = 19,
Exp2 = 20,
Exp10 = 21,
Expm1 = 22,
Fabs = 23,
Fdim = 24,
Floor = 25,
Fma = 26,
Fmax = 27,
Fmin = 28,
Fmod = 29,
Fract = 30,
Frexp = 31,
Hypot = 32,
Ilogb = 33,
Ldexp = 34,
Lgamma = 35,
Lgamma_r = 36,
Log = 37,
Log2 = 38,
Log10 = 39,
Log1p = 40,
Logb = 41,
Mad = 42,
Maxmag = 43,
Minmag = 44,
Modf = 45,
Nan = 46,
Nextafter = 47,
Pow = 48,
Pown = 49,
Powr = 50,
Remainder = 51,
Remquo = 52,
Rint = 53,
Rootn = 54,
Round = 55,
Rsqrt = 56,
Sin = 57,
Sincos = 58,
Sinh = 59,
Sinpi = 60,
Sqrt = 61,
Tan = 62,
Tanh = 63,
Tanpi = 64,
Tgamma = 65,
Trunc = 66,
Half_cos = 67,
Half_divide = 68,
Half_exp = 69,
Half_exp2 = 70,
Half_exp10 = 71,
Half_log = 72,
Half_log2 = 73,
Half_log10 = 74,
Half_powr = 75,
Half_recip = 76,
Half_rsqrt = 77,
Half_sin = 78,
Half_sqrt = 79,
Half_tan = 80,
Native_cos = 81,
Native_divide = 82,
Native_exp = 83,
Native_exp2 = 84,
Native_exp10 = 85,
Native_log = 86,
Native_log2 = 87,
Native_log10 = 88,
Native_powr = 89,
Native_recip = 90,
Native_rsqrt = 91,
Native_sin = 92,
Native_sqrt = 93,
Native_tan = 94,
// Section 2.2: Integer instructions
SAbs = 141,
SAbs_diff = 142,
SAdd_sat = 143,
UAdd_sat = 144,
SHadd = 145,
UHadd = 146,
SRhadd = 147,
URhadd = 148,
SClamp = 149,
UClamp = 150,
Clz = 151,
Ctz = 152,
SMad_hi = 153,
UMad_sat = 154,
SMad_sat = 155,
SMax = 156,
UMax = 157,
SMin = 158,
UMin = 159,
SMul_hi = 160,
Rotate = 161,
SSub_sat = 162,
USub_sat = 163,
U_Upsample = 164,
S_Upsample = 165,
Popcount = 166,
SMad24 = 167,
UMad24 = 168,
SMul24 = 169,
UMul24 = 170,
UAbs = 201,
UAbs_diff = 202,
UMul_hi = 203,
UMad_hi = 204,
// Section 2.3: Common instructions
FClamp = 95,
Degrees = 96,
FMax_common = 97,
FMin_common = 98,
Mix = 99,
Radians = 100,
Step = 101,
Smoothstep = 102,
Sign = 103,
// Section 2.4: Geometric instructions
Cross = 104,
Distance = 105,
Length = 106,
Normalize = 107,
Fast_distance = 108,
Fast_length = 109,
Fast_normalize = 110,
// Section 2.5: Relational instructions
Bitselect = 186,
Select = 187,
// Section 2.6: Vector Data Load and Store instructions
Vloadn = 171,
Vstoren = 172,
Vload_half = 173,
Vload_halfn = 174,
Vstore_half = 175,
Vstore_half_r = 176,
Vstore_halfn = 177,
Vstore_halfn_r = 178,
Vloada_halfn = 179,
Vstorea_halfn = 180,
Vstorea_halfn_r = 181,
// Section 2.7: Miscellaneous Vector instructions
Shuffle = 182,
Shuffle2 = 183,
// Section 2.8: Misc instructions
Printf = 184,
Prefetch = 185,
};
} // end namespace OpenCLLIB
#else
enum OpenCLstd_Entrypoints {
// Section 2.1: Math extended instructions
OpenCLstd_Acos = 0,
OpenCLstd_Acosh = 1,
OpenCLstd_Acospi = 2,
OpenCLstd_Asin = 3,
OpenCLstd_Asinh = 4,
OpenCLstd_Asinpi = 5,
OpenCLstd_Atan = 6,
OpenCLstd_Atan2 = 7,
OpenCLstd_Atanh = 8,
OpenCLstd_Atanpi = 9,
OpenCLstd_Atan2pi = 10,
OpenCLstd_Cbrt = 11,
OpenCLstd_Ceil = 12,
OpenCLstd_Copysign = 13,
OpenCLstd_Cos = 14,
OpenCLstd_Cosh = 15,
OpenCLstd_Cospi = 16,
OpenCLstd_Erfc = 17,
OpenCLstd_Erf = 18,
OpenCLstd_Exp = 19,
OpenCLstd_Exp2 = 20,
OpenCLstd_Exp10 = 21,
OpenCLstd_Expm1 = 22,
OpenCLstd_Fabs = 23,
OpenCLstd_Fdim = 24,
OpenCLstd_Floor = 25,
OpenCLstd_Fma = 26,
OpenCLstd_Fmax = 27,
OpenCLstd_Fmin = 28,
OpenCLstd_Fmod = 29,
OpenCLstd_Fract = 30,
OpenCLstd_Frexp = 31,
OpenCLstd_Hypot = 32,
OpenCLstd_Ilogb = 33,
OpenCLstd_Ldexp = 34,
OpenCLstd_Lgamma = 35,
OpenCLstd_Lgamma_r = 36,
OpenCLstd_Log = 37,
OpenCLstd_Log2 = 38,
OpenCLstd_Log10 = 39,
OpenCLstd_Log1p = 40,
OpenCLstd_Logb = 41,
OpenCLstd_Mad = 42,
OpenCLstd_Maxmag = 43,
OpenCLstd_Minmag = 44,
OpenCLstd_Modf = 45,
OpenCLstd_Nan = 46,
OpenCLstd_Nextafter = 47,
OpenCLstd_Pow = 48,
OpenCLstd_Pown = 49,
OpenCLstd_Powr = 50,
OpenCLstd_Remainder = 51,
OpenCLstd_Remquo = 52,
OpenCLstd_Rint = 53,
OpenCLstd_Rootn = 54,
OpenCLstd_Round = 55,
OpenCLstd_Rsqrt = 56,
OpenCLstd_Sin = 57,
OpenCLstd_Sincos = 58,
OpenCLstd_Sinh = 59,
OpenCLstd_Sinpi = 60,
OpenCLstd_Sqrt = 61,
OpenCLstd_Tan = 62,
OpenCLstd_Tanh = 63,
OpenCLstd_Tanpi = 64,
OpenCLstd_Tgamma = 65,
OpenCLstd_Trunc = 66,
OpenCLstd_Half_cos = 67,
OpenCLstd_Half_divide = 68,
OpenCLstd_Half_exp = 69,
OpenCLstd_Half_exp2 = 70,
OpenCLstd_Half_exp10 = 71,
OpenCLstd_Half_log = 72,
OpenCLstd_Half_log2 = 73,
OpenCLstd_Half_log10 = 74,
OpenCLstd_Half_powr = 75,
OpenCLstd_Half_recip = 76,
OpenCLstd_Half_rsqrt = 77,
OpenCLstd_Half_sin = 78,
OpenCLstd_Half_sqrt = 79,
OpenCLstd_Half_tan = 80,
OpenCLstd_Native_cos = 81,
OpenCLstd_Native_divide = 82,
OpenCLstd_Native_exp = 83,
OpenCLstd_Native_exp2 = 84,
OpenCLstd_Native_exp10 = 85,
OpenCLstd_Native_log = 86,
OpenCLstd_Native_log2 = 87,
OpenCLstd_Native_log10 = 88,
OpenCLstd_Native_powr = 89,
OpenCLstd_Native_recip = 90,
OpenCLstd_Native_rsqrt = 91,
OpenCLstd_Native_sin = 92,
OpenCLstd_Native_sqrt = 93,
OpenCLstd_Native_tan = 94,
// Section 2.2: Integer instructions
OpenCLstd_SAbs = 141,
OpenCLstd_SAbs_diff = 142,
OpenCLstd_SAdd_sat = 143,
OpenCLstd_UAdd_sat = 144,
OpenCLstd_SHadd = 145,
OpenCLstd_UHadd = 146,
OpenCLstd_SRhadd = 147,
OpenCLstd_URhadd = 148,
OpenCLstd_SClamp = 149,
OpenCLstd_UClamp = 150,
OpenCLstd_Clz = 151,
OpenCLstd_Ctz = 152,
OpenCLstd_SMad_hi = 153,
OpenCLstd_UMad_sat = 154,
OpenCLstd_SMad_sat = 155,
OpenCLstd_SMax = 156,
OpenCLstd_UMax = 157,
OpenCLstd_SMin = 158,
OpenCLstd_UMin = 159,
OpenCLstd_SMul_hi = 160,
OpenCLstd_Rotate = 161,
OpenCLstd_SSub_sat = 162,
OpenCLstd_USub_sat = 163,
OpenCLstd_U_Upsample = 164,
OpenCLstd_S_Upsample = 165,
OpenCLstd_Popcount = 166,
OpenCLstd_SMad24 = 167,
OpenCLstd_UMad24 = 168,
OpenCLstd_SMul24 = 169,
OpenCLstd_UMul24 = 170,
OpenCLstd_UAbs = 201,
OpenCLstd_UAbs_diff = 202,
OpenCLstd_UMul_hi = 203,
OpenCLstd_UMad_hi = 204,
// Section 2.3: Common instructions
OpenCLstd_FClamp = 95,
OpenCLstd_Degrees = 96,
OpenCLstd_FMax_common = 97,
OpenCLstd_FMin_common = 98,
OpenCLstd_Mix = 99,
OpenCLstd_Radians = 100,
OpenCLstd_Step = 101,
OpenCLstd_Smoothstep = 102,
OpenCLstd_Sign = 103,
// Section 2.4: Geometric instructions
OpenCLstd_Cross = 104,
OpenCLstd_Distance = 105,
OpenCLstd_Length = 106,
OpenCLstd_Normalize = 107,
OpenCLstd_Fast_distance = 108,
OpenCLstd_Fast_length = 109,
OpenCLstd_Fast_normalize = 110,
// Section 2.5: Relational instructions
OpenCLstd_Bitselect = 186,
OpenCLstd_Select = 187,
// Section 2.6: Vector Data Load and Store instructions
OpenCLstd_Vloadn = 171,
OpenCLstd_Vstoren = 172,
OpenCLstd_Vload_half = 173,
OpenCLstd_Vload_halfn = 174,
OpenCLstd_Vstore_half = 175,
OpenCLstd_Vstore_half_r = 176,
OpenCLstd_Vstore_halfn = 177,
OpenCLstd_Vstore_halfn_r = 178,
OpenCLstd_Vloada_halfn = 179,
OpenCLstd_Vstorea_halfn = 180,
OpenCLstd_Vstorea_halfn_r = 181,
// Section 2.7: Miscellaneous Vector instructions
OpenCLstd_Shuffle = 182,
OpenCLstd_Shuffle2 = 183,
// Section 2.8: Misc instructions
OpenCLstd_Printf = 184,
OpenCLstd_Prefetch = 185,
};
#endif
#endif // #ifndef OPENCLstd_H
```
|
```java
package com.ctrip.xpipe.redis.checker;
import com.ctrip.xpipe.cluster.ClusterType;
/**
* @author lishanglin
* date 2021/3/17
*/
public class TestBeaconManager implements BeaconManager {
@Override
public void registerCluster(String clusterId, ClusterType clusterType, int orgId) {
}
}
```
|
Henri Ory (28 April 1884 – 4 August 1963) was a French racing cyclist. He rode in the 1920 Tour de France.
References
1884 births
1963 deaths
French male cyclists
Place of birth missing
|
Qualification for the 2000 AFC U-16 Championship.
Group 1
All matches played in Muscat, Oman.
Group 2
All matches played in Bahrain.
Group 3
All matches played in Tehran, Iran.
Group 4
All matches played in Calcutta, India.
Group 5
All matches played in Kathmandu, Nepal.
Group 6
All matches played in Bangkok, Thailand.
Group 7
All matches played in Seoul, South Korea.
Group 8
All matches played in Nagoya, Japan.
Group 9
All matches played in Yangon, Myanmar.
Qualified teams
(host)
References
RSSSF Archive
Qual
AFC U-16 Championship qualification
|
```glsl
//
//
// 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.
#version 450
#extension GL_ARB_separate_shader_objects : enable
#extension GL_ARB_shading_language_420pack : enable
#extension GL_GOOGLE_include_directive : enable
#include "lib_math.glsl"
#include "gbuffer.inc.glsl"
// Ubos
PER_MATERIAL_UBO;
PER_INSTANCE_UBO;
// Bindings
BINDINGS_GBUFFER;
layout(binding = 6) uniform sampler2D emissiveTex;
// Input
layout(location = 0) in vec3 inNormal;
layout(location = 1) in vec3 inTangent;
layout(location = 2) in vec3 inBinormal;
layout(location = 3) in vec3 inColor;
layout(location = 4) in vec2 inUV0;
// Output
OUTPUT
void main()
{
const mat3 TBN = mat3(inTangent, inBinormal, inNormal);
const vec2 uv0 = UV0_TRANSFORM_ANIMATED(inUV0);
GBuffer gbuffer;
{
gbuffer.albedo = texture(albedoTex, uv0) * uboPerInstance.colorTint;
gbuffer.normal = normalize(TBN * textureNormal(normalTex, uv0));
const vec2 pbr = texture(pbrTex, uv0).rg;
gbuffer.metalMask = pbr.r + uboPerMaterial.pbrBias.r;
gbuffer.specular = 0.5 + uboPerMaterial.pbrBias.g;
gbuffer.roughness = adjustRoughness(pbr.g + uboPerMaterial.pbrBias.b,
uboPerMaterial.data1.x);
gbuffer.materialBufferIdx = uboPerMaterial.data0.x;
gbuffer.emissive = texture(emissiveTex, uv0).r;
gbuffer.occlusion = 1.0;
}
writeGBuffer(gbuffer, outAlbedo, outNormal, outParameter0);
}
```
|
Robert Else (17 November 1876 – 16 September 1955) was an English first-class cricketer who played for Derbyshire in 1901 and 1903.
Else was born at Lea, Holloway, Derbyshire, the son of John Else and his wife Henrietta Lowe. His father was a bobbin maker and in 1881 they were all living with his grandparents at the Old Hat Factory in Wirksworth. Else made his debut for Derbyshire in May 1901 against Surrey, when his scores were 1 and 2. He played again that season against the South Africans when he opened the batting scoring a duck in the first innings and surviving the whole of the second innings for 6 not out. He did not play again until July 1903 when against London County he took a wicket and made his top score of 28. He played his last two matches in 1903 and made little impression in them.
Else was a left-hand batsman and played ten innings in five first-class matches with an average of 7.3 and a top score of 28. He bowled fifteen overs and took 1 first-class wicket for 61 runs in total.
Else died at Broomhill, Sheffield, Yorkshire at the age of 78.
References
1876 births
1955 deaths
Derbyshire cricketers
English cricketers
People from Dethick, Lea and Holloway
Cricketers from Derbyshire
|
```yaml
version: "2"
services:
foo:
# create a pod
image: "foobar"
restart: "no"
environment:
GITHUB: surajssd
ports:
- "6379/tcp"
- "6379/udp"
- "3000"
- "3000-3005"
- "8000:8000"
- "9090-9091:8080-8081"
- "49100:22"
- "127.0.0.1:8001:8001"
- "127.0.0.1:5000-5010:5000-5010"
mem_limit: 10000
group_add:
- "1234"
redis:
image: redis:3.0
labels:
kompose.service.type: loadbalancer
ports:
- "6379/tcp"
- "1234:1235/udp"
mem_limit: 10000Mb
```
|
```python
# Polychromatic is licensed under the GPLv3.
"""
Module for determining where files are located.
"""
import os
import sys
class Paths():
"""
Reference file/folder paths for data files, configuration and cache directories.
"""
def __init__(self):
# System-wide data
self.data_dir = self.get_data_path()
# Local data
self.config = self.get_config_path()
self.cache = self.get_cache_path()
self.dev = self.set_dev_mode()
self.pid_dir = self.get_pid_path()
# Caches
self.assets_cache = os.path.join(self.cache, "assets")
self.effects_cache = os.path.join(self.cache, "effects")
self.webview_cache = os.path.join(self.cache, "editor")
# Save Data
self.devices = os.path.join(self.config, "devices")
self.dpi = os.path.join(self.config, "dpi")
self.effects = os.path.join(self.config, "effects")
self.presets = os.path.join(self.config, "presets")
self.custom_icons = os.path.join(self.config, "custom_icons")
self.states = os.path.join(self.config, "states")
# Files
self.preferences = os.path.join(self.config, "preferences.json")
self.colours = os.path.join(self.config, "colours.json")
# Legacy (<= v0.3.12)
self.old_profile_folder = os.path.join(self.config, "profiles")
self.old_profile_backups = os.path.join(self.config, "backups")
self.old_devicestate = os.path.join(self.config, "devicestate.json")
self.create_dirs_if_not_exist()
def create_dirs_if_not_exist(self):
"""
Ensure all the directories exist for the application.
"""
for folder in [self.config, self.presets, self.custom_icons, self.states, self.devices, self.effects,
self.cache, self.assets_cache, self.effects_cache, self.webview_cache, self.dpi]:
if not os.path.exists(folder):
os.makedirs(folder)
def set_dev_mode(self):
"""
When developing within the repository, change the paths accordingly.
"""
try:
if os.environ["POLYCHROMATIC_DEV_CFG"] == "true":
# __file__ = polychromatic/base.py
self.cache = os.path.realpath(os.path.join(os.path.dirname(__file__), "..", "savedatadev", "cache"))
self.config = os.path.realpath(os.path.join(os.path.dirname(__file__), "..", "savedatadev", "config"))
except KeyError:
return False
return True
@staticmethod
def get_data_path():
"""
For development/opt, this is normally adjacent to the application executable.
For system-wide installs, this is generally /usr/share/polychromatic.
"""
module_path = __file__
if os.path.exists(os.path.join(os.path.dirname(module_path), "../data/img/")):
return os.path.abspath(os.path.join(os.path.dirname(module_path), "../data/"))
for directory in ["/usr/local/share/polychromatic", "/usr/share/polychromatic"]:
if os.path.exists(directory):
return directory
print("Cannot locate data directory! Please reinstall the application.")
sys.exit(1)
@staticmethod
def get_config_path():
"""
Path for persistent save data for the application.
"""
try:
return os.path.join(os.environ["XDG_CONFIG_HOME"], "polychromatic")
except KeyError:
return os.path.join(os.path.expanduser("~"), ".config", "polychromatic")
@staticmethod
def get_cache_path():
"""
Path for temporary data to speed up processing later.
"""
try:
return os.path.join(os.environ["XDG_CACHE_HOME"], "polychromatic")
except KeyError:
return os.path.join(os.path.expanduser("~"), ".cache", "polychromatic")
@staticmethod
def get_pid_path():
"""
Runtime directory for PID text files that reference other Polychromatic processes.
"""
try:
return os.path.join(os.environ["XDG_RUNTIME_DIR"], "polychromatic")
except KeyError:
return "/tmp/polychromatic"
```
|
Conus purvisi is a species of sea snail, a marine gastropod mollusk in the family Conidae, the cone snails, cone shells or cones.
These snails are predatory and venomous. They are capable of "stinging" humans.
Description
Distribution
This marine species of cone snail is endemic to the Cape Verdes.
References
Cossignani T. & Fiadeiro R. (2017). Otto nuovi coni da Capo Verde. Malacologia Mostra Mondiale. 94: 26-36.page(s): 27
purvisi
Gastropods described in 2017
Gastropods of Cape Verde
|
The Kenya Conference of Catholic Bishops (KCCB) is the assembly of bishops of the Catholic Church in Kenya. Its statutes were approved by the Holy See on December 7, 1976.
Structure
The plenary sessions of the KCCB are attended by all the diocesan bishops, emeritus and auxiliary bishops, the apostolic vicar, and the military chaplaincy. The Conference accomplishes its mission through the Catholic Secretariat which, through the Episcopal Commissions, coordinates and implements the decisions of the plenary assembly, providing the appropriate technical support. Currently, there are 15 committees reporting to the KCCB: liturgy, doctrine, lay apostolate, mission, justice and peace, ecumenism, interreligious dialogue, refugees, and others. There are also two sub-committees (canon law and apostolate of the nomads).
Regional bodies
The KCCB is a member of the Association of Member Episcopal Conferences in Eastern Africa (AMECEA) and Symposium of Episcopal Conferences of Africa and Madagascar (SECAM).
Presidents
1969-1970: John Joseph McCarthy, the Archbishop of Nairobi
1970-1976: Maurice Michael Otunga, Cardinal, Archbishop of Nairobi
1976-1982: John Njenga, bishop of Eldoret
1982-1988: Raphael Ndingi Mwana'a Nzeki, Bishop of Nakuru
1988-1991: Nicodemus Kirima, Archbishop of Nyeri
1991-1997: Zacchaeus Okoth, Archbishop of Kisumu
1997-2003: John Njue, Bishop of Embu
2003-2006: Cornelius Arap Korir Kipng'eno, Bishop of Eldoret
2006-2015: John Njue, Cardinal, Archbishop of Nairobi
2015- : Philip Arnold Subira Anyolo, Bishop of Homabay
References
External links
http://www.kccb.or.ke/
http://www.gcatholic.org/dioceses/country/KE.htm
http://www.catholic-hierarchy.org/country/ke.html
Kenya
Catholic Church in Kenya
|
```c
/*
* eepro100.c -- This file implements the eepro100 driver for etherboot.
*
*
* written by R.E.Wolff -- R.E.Wolff@BitWizard.nl
*
*
* AW Computer Systems is contributing to the free software community
* by paying for this driver and then putting the result under GPL.
*
* If you need a Linux device driver, please contact BitWizard for a
* quote.
*
*
* This program is free software; you can redistribute it and/or
* published by the Free Software Foundation; either version 2, or (at
* your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
*
* along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*
*
* date version by what
* Written: May 29 1997 V0.10 REW Initial revision.
* changes: May 31 1997 V0.90 REW Works!
* Jun 1 1997 V0.91 REW Cleanup
* Jun 2 1997 V0.92 REW Add some code documentation
* Jul 25 1997 V1.00 REW Tested by AW to work in a PROM
* Cleanup for publication
*
* This is the etherboot intel etherexpress Pro/100B driver.
*
* It was written from scratch, with Donald Beckers eepro100.c kernel
* driver as a guideline. Mostly the 82557 related definitions and the
* lower level routines have been cut-and-pasted into this source.
*
* The driver was finished before Intel got the NDA out of the closet.
* I still don't have the docs.
* */
/* Philosophy of this driver.
*
* Probing:
*
* Using the pci.c functions of the Etherboot code, the 82557 chip is detected.
* It is verified that the BIOS initialized everything properly and if
* something is missing it is done now.
*
*
* Initialization:
*
*
* The chip is then initialized to "know" its ethernet address, and to
* start recieving packets. The Linux driver has a whole transmit and
* recieve ring of buffers. This is neat if you need high performance:
* you can write the buffers asynchronously to the chip reading the
* buffers and transmitting them over the network. Performance is NOT
* an issue here. We can boot a 400k kernel in about two
* seconds. (Theory: 0.4 seconds). Booting a system is going to take
* about half a minute anyway, so getting 10 times closer to the
* theoretical limit is going to make a difference of a few percent.
*
*
* Transmitting and recieving.
*
* We have only one transmit descriptor. It has two buffer descriptors:
* one for the header, and the other for the data.
* We have only one receive buffer. The chip is told to recieve packets,
* and suspend itself once it got one. The recieve (poll) routine simply
* looks at the recieve buffer to see if there is already a packet there.
* if there is, the buffer is copied, and the reciever is restarted.
*
* Caveats:
*
* The etherboot framework moves the code to the 32k segment from
* 0x98000 to 0xa0000. There is just a little room between the end of
* this driver and the 0xa0000 address. If you compile in too many
* features, this will overflow.
* The number under "hex" in the output of size that scrolls by while
* compiling should be less than 8000. Maybe even the stack is up there,
* so that you need even more headroom.
*/
/* The etherboot authors seem to dislike the argument ordering in
* outb macros that Linux uses. I disklike the confusion that this
* has caused even more.... This file uses the Linux argument ordering. */
/* Sorry not us. It's inherted code from FreeBSD. [The authors] */
#include "etherboot.h"
#include "nic.h"
#include "pci.h"
#include "cards.h"
#include "timer.h"
#undef virt_to_bus
#define virt_to_bus(x) ((unsigned long)x)
static int ioaddr;
typedef unsigned char u8;
typedef signed char s8;
typedef unsigned short u16;
typedef signed short s16;
typedef unsigned int u32;
typedef signed int s32;
enum speedo_offsets {
SCBStatus = 0, SCBCmd = 2, /* Rx/Command Unit command and status. */
SCBPointer = 4, /* General purpose pointer. */
SCBPort = 8, /* Misc. commands and operands. */
SCBflash = 12, SCBeeprom = 14, /* EEPROM and flash memory control. */
SCBCtrlMDI = 16, /* MDI interface control. */
SCBEarlyRx = 20, /* Early receive byte count. */
};
static int do_eeprom_cmd(int cmd, int cmd_len);
void hd(void *where, int n);
/***********************************************************************/
/* I82557 related defines */
/***********************************************************************/
/* Serial EEPROM section.
A "bit" grungy, but we work our way through bit-by-bit :->. */
/* EEPROM_Ctrl bits. */
#define EE_SHIFT_CLK 0x01 /* EEPROM shift clock. */
#define EE_CS 0x02 /* EEPROM chip select. */
#define EE_DATA_WRITE 0x04 /* EEPROM chip data in. */
#define EE_DATA_READ 0x08 /* EEPROM chip data out. */
#define EE_WRITE_0 0x4802
#define EE_WRITE_1 0x4806
#define EE_ENB (0x4800 | EE_CS)
#define udelay(n) waiton_timer2(((n)*TICKS_PER_MS)/1000)
/* The EEPROM commands include the alway-set leading bit. */
#define EE_READ_CMD 6
/* The SCB accepts the following controls for the Tx and Rx units: */
#define CU_START 0x0010
#define CU_RESUME 0x0020
#define CU_STATSADDR 0x0040
#define CU_SHOWSTATS 0x0050 /* Dump statistics counters. */
#define CU_CMD_BASE 0x0060 /* Base address to add to add CU commands. */
#define CU_DUMPSTATS 0x0070 /* Dump then reset stats counters. */
#define RX_START 0x0001
#define RX_RESUME 0x0002
#define RX_ABORT 0x0004
#define RX_ADDR_LOAD 0x0006
#define RX_RESUMENR 0x0007
#define INT_MASK 0x0100
#define DRVR_INT 0x0200 /* Driver generated interrupt. */
enum phy_chips { NonSuchPhy=0, I82553AB, I82553C, I82503, DP83840, S80C240,
S80C24, PhyUndefined, DP83840A=10, };
/* Commands that can be put in a command list entry. */
enum commands {
CmdNOp = 0,
CmdIASetup = 1,
CmdConfigure = 2,
CmdMulticastList = 3,
CmdTx = 4,
CmdTDR = 5,
CmdDump = 6,
CmdDiagnose = 7,
/* And some extra flags: */
CmdSuspend = 0x4000, /* Suspend after completion. */
CmdIntr = 0x2000, /* Interrupt after completion. */
CmdTxFlex = 0x0008, /* Use "Flexible mode" for CmdTx command. */
};
/* How to wait for the command unit to accept a command.
Typically this takes 0 ticks. */
static inline void wait_for_cmd_done(int cmd_ioaddr)
{
short wait = 100;
do ;
while(inb(cmd_ioaddr) && --wait >= 0);
}
/* Elements of the dump_statistics block. This block must be lword aligned. */
static struct speedo_stats {
u32 tx_good_frames;
u32 tx_coll16_errs;
u32 tx_late_colls;
u32 tx_underruns;
u32 tx_lost_carrier;
u32 tx_deferred;
u32 tx_one_colls;
u32 tx_multi_colls;
u32 tx_total_colls;
u32 rx_good_frames;
u32 rx_crc_errs;
u32 rx_align_errs;
u32 rx_resource_errs;
u32 rx_overrun_errs;
u32 rx_colls_errs;
u32 rx_runt_errs;
u32 done_marker;
} lstats;
/* A speedo3 TX buffer descriptor with two buffers... */
static struct TxFD {
volatile s16 status;
s16 command;
u32 link; /* void * */
u32 tx_desc_addr; /* (almost) Always points to the tx_buf_addr element. */
s32 count; /* # of TBD (=2), Tx start thresh., etc. */
/* This constitutes two "TBD" entries: hdr and data */
u32 tx_buf_addr0; /* void *, header of frame to be transmitted. */
s32 tx_buf_size0; /* Length of Tx hdr. */
u32 tx_buf_addr1; /* void *, data to be transmitted. */
s32 tx_buf_size1; /* Length of Tx data. */
} txfd;
struct RxFD { /* Receive frame descriptor. */
volatile s16 status;
s16 command;
u32 link; /* struct RxFD * */
u32 rx_buf_addr; /* void * */
u16 count;
u16 size;
char packet[1518];
};
#ifdef USE_LOWMEM_BUFFER
#define rxfd ((struct RxFD *)(0x10000 - sizeof(struct RxFD)))
#define ACCESS(x) x->
#else
static struct RxFD rxfd;
#define ACCESS(x) x.
#endif
static int congenb = 0; /* Enable congestion control in the DP83840. */
static int txfifo = 8; /* Tx FIFO threshold in 4 byte units, 0-15 */
static int rxfifo = 8; /* Rx FIFO threshold, default 32 bytes. */
static int txdmacount = 0; /* Tx DMA burst length, 0-127, default 0. */
static int rxdmacount = 0; /* Rx DMA length, 0 means no preemption. */
/* I don't understand a byte in this structure. It was copied from the
* Linux kernel initialization for the eepro100. -- REW */
static struct ConfCmd {
s16 status;
s16 command;
u32 link;
unsigned char data[22];
} confcmd = {
0, CmdConfigure,
(u32) & txfd,
{22, 0x08, 0, 0, 0, 0x80, 0x32, 0x03, 1, /* 1=Use MII 0=Use AUI */
0, 0x2E, 0, 0x60, 0,
0xf2, 0x48, 0, 0x40, 0xf2, 0x80, /* 0x40=Force full-duplex */
0x3f, 0x05, }
};
/***********************************************************************/
/* Locally used functions */
/***********************************************************************/
/* Support function: mdio_write
*
* This probably writes to the "physical media interface chip".
* -- REW
*/
static int mdio_write(int phy_id, int location, int value)
{
int val, boguscnt = 64*4; /* <64 usec. to complete, typ 27 ticks */
outl(0x04000000 | (location<<16) | (phy_id<<21) | value,
ioaddr + SCBCtrlMDI);
do {
udelay(16);
val = inl(ioaddr + SCBCtrlMDI);
if (--boguscnt < 0) {
printf(" mdio_write() timed out with val = %X.\n", val);
}
} while (! (val & 0x10000000));
return val & 0xffff;
}
/* Support function: mdio_read
*
* This probably reads a register in the "physical media interface chip".
* -- REW
*/
static int mdio_read(int phy_id, int location)
{
int val, boguscnt = 64*4; /* <64 usec. to complete, typ 27 ticks */
outl(0x08000000 | (location<<16) | (phy_id<<21), ioaddr + SCBCtrlMDI);
do {
udelay(16);
val = inl(ioaddr + SCBCtrlMDI);
if (--boguscnt < 0) {
printf( " mdio_read() timed out with val = %X.\n", val);
}
} while (! (val & 0x10000000));
return val & 0xffff;
}
/* The fixes for the code were kindly provided by Dragan Stancevic
<visitor@valinux.com> to strictly follow Intel specifications of EEPROM
access timing.
The publicly available sheet 64486302 (sec. 3.1) specifies 1us access
interval for serial EEPROM. However, it looks like that there is an
additional requirement dictating larger udelay's in the code below.
2000/05/24 SAW */
static int do_eeprom_cmd(int cmd, int cmd_len)
{
unsigned retval = 0;
long ee_addr = ioaddr + SCBeeprom;
outw(EE_ENB, ee_addr); udelay(2);
outw(EE_ENB | EE_SHIFT_CLK, ee_addr); udelay(2);
/* Shift the command bits out. */
do {
short dataval = (cmd & (1 << cmd_len)) ? EE_WRITE_1 : EE_WRITE_0;
outw(dataval, ee_addr); udelay(2);
outw(dataval | EE_SHIFT_CLK, ee_addr); udelay(2);
retval = (retval << 1) | ((inw(ee_addr) & EE_DATA_READ) ? 1 : 0);
} while (--cmd_len >= 0);
outw(EE_ENB, ee_addr); udelay(2);
/* Terminate the EEPROM access. */
outw(EE_ENB & ~EE_CS, ee_addr);
return retval;
}
static inline void whereami (const char *str)
{
#if 0
printf ("%s\n", str);
sleep (2);
#endif
}
/* function: eepro100_reset
* resets the card. This is used to allow Etherboot to probe the card again
* from a "virginal" state....
* Arguments: none
*
* returns: void.
*/
static void eepro100_reset(struct nic *nic)
{
outl(0, ioaddr + SCBPort);
}
/* function: eepro100_transmit
* This transmits a packet.
*
* Arguments: char d[6]: destination ethernet address.
* unsigned short t: ethernet protocol type.
* unsigned short s: size of the data-part of the packet.
* char *p: the data for the packet.
* returns: void.
*/
static void eepro100_transmit(struct nic *nic, const char *d, unsigned int t, unsigned int s, const char *p)
{
struct eth_hdr {
unsigned char dst_addr[ETH_ALEN];
unsigned char src_addr[ETH_ALEN];
unsigned short type;
} hdr;
unsigned short status;
int to;
int s1, s2;
status = inw(ioaddr + SCBStatus);
/* Acknowledge all of the current interrupt sources ASAP. */
outw(status & 0xfc00, ioaddr + SCBStatus);
#ifdef DEBUG
printf ("transmitting type %hX packet (%d bytes). status = %hX, cmd=%hX\n",
t, s, status, inw (ioaddr + SCBCmd));
#endif
memcpy (&hdr.dst_addr, d, ETH_ALEN);
memcpy (&hdr.src_addr, nic->node_addr, ETH_ALEN);
hdr.type = htons (t);
txfd.status = 0;
txfd.command = CmdSuspend | CmdTx | CmdTxFlex;
txfd.link = virt_to_bus (&txfd);
txfd.count = 0x02208000;
txfd.tx_desc_addr = (u32)&txfd.tx_buf_addr0;
txfd.tx_buf_addr0 = virt_to_bus (&hdr);
txfd.tx_buf_size0 = sizeof (hdr);
txfd.tx_buf_addr1 = virt_to_bus (p);
txfd.tx_buf_size1 = s;
#ifdef DEBUG
printf ("txfd: \n");
hd (&txfd, sizeof (txfd));
#endif
outl(virt_to_bus(&txfd), ioaddr + SCBPointer);
outw(INT_MASK | CU_START, ioaddr + SCBCmd);
wait_for_cmd_done(ioaddr + SCBCmd);
s1 = inw (ioaddr + SCBStatus);
load_timer2(10*TICKS_PER_MS); /* timeout 10 ms for transmit */
while (!txfd.status && timer2_running())
/* Wait */;
s2 = inw (ioaddr + SCBStatus);
#ifdef DEBUG
printf ("s1 = %hX, s2 = %hX.\n", s1, s2);
#endif
}
/* function: eepro100_poll / eth_poll
* This recieves a packet from the network.
*
* Arguments: none
*
* returns: 1 if a packet was recieved.
* 0 if no pacet was recieved.
* side effects:
* returns the packet in the array nic->packet.
* returns the length of the packet in nic->packetlen.
*/
static int eepro100_poll(struct nic *nic)
{
if (!ACCESS(rxfd)status)
return 0;
/* Ok. We got a packet. Now restart the reciever.... */
ACCESS(rxfd)status = 0;
ACCESS(rxfd)command = 0xc000;
outl(virt_to_bus(&(ACCESS(rxfd)status)), ioaddr + SCBPointer);
outw(INT_MASK | RX_START, ioaddr + SCBCmd);
wait_for_cmd_done(ioaddr + SCBCmd);
#ifdef DEBUG
printf ("Got a packet: Len = %d.\n", ACCESS(rxfd)count & 0x3fff);
#endif
nic->packetlen = ACCESS(rxfd)count & 0x3fff;
memcpy (nic->packet, ACCESS(rxfd)packet, nic->packetlen);
#ifdef DEBUG
hd (nic->packet, 0x30);
#endif
return 1;
}
static void eepro100_disable(struct nic *nic)
{
/* See if this PartialReset solves the problem with interfering with
kernel operation after Etherboot hands over. - Ken 20001102 */
outl(2, ioaddr + SCBPort);
}
/* exported function: eepro100_probe / eth_probe
* initializes a card
*
* side effects:
* leaves the ioaddress of the 82557 chip in the variable ioaddr.
* leaves the 82557 initialized, and ready to recieve packets.
*/
struct nic *eepro100_probe(struct nic *nic, unsigned short *probeaddrs, struct pci_device *p)
{
unsigned short sum = 0;
int i;
int read_cmd, ee_size;
unsigned short value;
int options;
int promisc;
/* we cache only the first few words of the EEPROM data
be careful not to access beyond this array */
unsigned short eeprom[16];
if (probeaddrs == 0 || probeaddrs[0] == 0)
return 0;
ioaddr = probeaddrs[0] & ~3; /* Mask the bit that says "this is an io addr" */
adjust_pci_device(p);
if ((do_eeprom_cmd(EE_READ_CMD << 24, 27) & 0xffe0000)
== 0xffe0000) {
ee_size = 0x100;
read_cmd = EE_READ_CMD << 24;
} else {
ee_size = 0x40;
read_cmd = EE_READ_CMD << 22;
}
for (i = 0, sum = 0; i < ee_size; i++) {
unsigned short value = do_eeprom_cmd(read_cmd | (i << 16), 27);
if (i < (int)(sizeof(eeprom)/sizeof(eeprom[0])))
eeprom[i] = value;
sum += value;
}
for (i=0;i<ETH_ALEN;i++) {
nic->node_addr[i] = (eeprom[i/2] >> (8*(i&1))) & 0xff;
}
printf ("Ethernet addr: %!\n", nic->node_addr);
if (sum != 0xBABA)
printf("eepro100: Invalid EEPROM checksum %#hX, "
"check settings before activating this device!\n", sum);
outl(0, ioaddr + SCBPort);
udelay (10000);
whereami ("Got eeprom.");
outl(virt_to_bus(&lstats), ioaddr + SCBPointer);
outw(INT_MASK | CU_STATSADDR, ioaddr + SCBCmd);
wait_for_cmd_done(ioaddr + SCBCmd);
whereami ("set stats addr.");
/* INIT RX stuff. */
/* Base = 0 */
outl(0, ioaddr + SCBPointer);
outw(INT_MASK | RX_ADDR_LOAD, ioaddr + SCBCmd);
wait_for_cmd_done(ioaddr + SCBCmd);
whereami ("set rx base addr.");
ACCESS(rxfd)status = 0x0001;
ACCESS(rxfd)command = 0x0000;
ACCESS(rxfd)link = virt_to_bus(&(ACCESS(rxfd)status));
ACCESS(rxfd)rx_buf_addr = (int) &nic->packet;
ACCESS(rxfd)count = 0;
ACCESS(rxfd)size = 1528;
outl(virt_to_bus(&(ACCESS(rxfd)status)), ioaddr + SCBPointer);
outw(INT_MASK | RX_START, ioaddr + SCBCmd);
wait_for_cmd_done(ioaddr + SCBCmd);
whereami ("started RX process.");
/* Start the reciever.... */
ACCESS(rxfd)status = 0;
ACCESS(rxfd)command = 0xc000;
outl(virt_to_bus(&(ACCESS(rxfd)status)), ioaddr + SCBPointer);
outw(INT_MASK | RX_START, ioaddr + SCBCmd);
/* INIT TX stuff. */
/* Base = 0 */
outl(0, ioaddr + SCBPointer);
outw(INT_MASK | CU_CMD_BASE, ioaddr + SCBCmd);
wait_for_cmd_done(ioaddr + SCBCmd);
whereami ("set TX base addr.");
txfd.command = (CmdIASetup);
txfd.status = 0x0000;
txfd.link = virt_to_bus (&confcmd);
{
char *t = (char *)&txfd.tx_desc_addr;
for (i=0;i<ETH_ALEN;i++)
t[i] = nic->node_addr[i];
}
#ifdef DEBUG
printf ("Setup_eaddr:\n");
hd (&txfd, 0x20);
#endif
/* options = 0x40; */ /* 10mbps half duplex... */
options = 0x00; /* Autosense */
promisc = 0;
if ( ((eeprom[6]>>8) & 0x3f) == DP83840
|| ((eeprom[6]>>8) & 0x3f) == DP83840A) {
int mdi_reg23 = mdio_read(eeprom[6] & 0x1f, 23) | 0x0422;
if (congenb)
mdi_reg23 |= 0x0100;
printf(" DP83840 specific setup, setting register 23 to %hX.\n",
mdi_reg23);
mdio_write(eeprom[6] & 0x1f, 23, mdi_reg23);
}
whereami ("Done DP8340 special setup.");
if (options != 0) {
mdio_write(eeprom[6] & 0x1f, 0,
((options & 0x20) ? 0x2000 : 0) | /* 100mbps? */
((options & 0x10) ? 0x0100 : 0)); /* Full duplex? */
whereami ("set mdio_register.");
}
confcmd.command = CmdSuspend | CmdConfigure;
confcmd.status = 0x0000;
confcmd.link = virt_to_bus (&txfd);
confcmd.data[1] = (txfifo << 4) | rxfifo;
confcmd.data[4] = rxdmacount;
confcmd.data[5] = txdmacount + 0x80;
confcmd.data[15] = promisc ? 0x49: 0x48;
confcmd.data[19] = (options & 0x10) ? 0xC0 : 0x80;
confcmd.data[21] = promisc ? 0x0D: 0x05;
outl(virt_to_bus(&txfd), ioaddr + SCBPointer);
outw(INT_MASK | CU_START, ioaddr + SCBCmd);
wait_for_cmd_done(ioaddr + SCBCmd);
whereami ("started TX thingy (config, iasetup).");
load_timer2(10*TICKS_PER_MS);
while (!txfd.status && timer2_running())
/* Wait */;
nic->reset = eepro100_reset;
nic->poll = eepro100_poll;
nic->transmit = eepro100_transmit;
nic->disable = eepro100_disable;
return nic;
}
/*********************************************************************/
#ifdef DEBUG
/* Hexdump a number of bytes from memory... */
void hd (void *where, int n)
{
int i;
while (n > 0) {
printf ("%X ", where);
for (i=0;i < ( (n>16)?16:n);i++)
printf (" %hhX", ((char *)where)[i]);
printf ("\n");
n -= 16;
where += 16;
}
}
#endif
```
|
```go
/*
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.
*/
package v1beta1
import (
metav1 "k8s.io/apimachinery/pkg/apis/meta/v1"
)
// Authorization is calculated against
// 1. evaluation of ClusterRoleBindings - short circuit on match
// 2. evaluation of RoleBindings in the namespace requested - short circuit on match
// 3. deny by default
const (
APIGroupAll = "*"
ResourceAll = "*"
VerbAll = "*"
NonResourceAll = "*"
GroupKind = "Group"
ServiceAccountKind = "ServiceAccount"
UserKind = "User"
// AutoUpdateAnnotationKey is the name of an annotation which prevents reconciliation if set to "false"
AutoUpdateAnnotationKey = "rbac.authorization.kubernetes.io/autoupdate"
)
// Authorization is calculated against
// 1. evaluation of ClusterRoleBindings - short circuit on match
// 2. evaluation of RoleBindings in the namespace requested - short circuit on match
// 3. deny by default
// PolicyRule holds information that describes a policy rule, but does not contain information
// about who the rule applies to or which namespace the rule applies to.
type PolicyRule struct {
// Verbs is a list of Verbs that apply to ALL the ResourceKinds contained in this rule. '*' represents all verbs.
// +listType=atomic
Verbs []string `json:"verbs" protobuf:"bytes,1,rep,name=verbs"`
// APIGroups is the name of the APIGroup that contains the resources. If multiple API groups are specified, any action requested against one of
// the enumerated resources in any API group will be allowed. "" represents the core API group and "*" represents all API groups.
// +optional
// +listType=atomic
APIGroups []string `json:"apiGroups,omitempty" protobuf:"bytes,2,rep,name=apiGroups"`
// Resources is a list of resources this rule applies to. '*' represents all resources in the specified apiGroups.
// '*/foo' represents the subresource 'foo' for all resources in the specified apiGroups.
// +optional
// +listType=atomic
Resources []string `json:"resources,omitempty" protobuf:"bytes,3,rep,name=resources"`
// ResourceNames is an optional white list of names that the rule applies to. An empty set means that everything is allowed.
// +optional
// +listType=atomic
ResourceNames []string `json:"resourceNames,omitempty" protobuf:"bytes,4,rep,name=resourceNames"`
// NonResourceURLs is a set of partial urls that a user should have access to. *s are allowed, but only as the full, final step in the path
// Since non-resource URLs are not namespaced, this field is only applicable for ClusterRoles referenced from a ClusterRoleBinding.
// Rules can either apply to API resources (such as "pods" or "secrets") or non-resource URL paths (such as "/api"), but not both.
// +optional
// +listType=atomic
NonResourceURLs []string `json:"nonResourceURLs,omitempty" protobuf:"bytes,5,rep,name=nonResourceURLs"`
}
// Subject contains a reference to the object or user identities a role binding applies to. This can either hold a direct API object reference,
// or a value for non-objects such as user and group names.
type Subject struct {
// Kind of object being referenced. Values defined by this API group are "User", "Group", and "ServiceAccount".
// If the Authorizer does not recognized the kind value, the Authorizer should report an error.
Kind string `json:"kind" protobuf:"bytes,1,opt,name=kind"`
// APIGroup holds the API group of the referenced subject.
// Defaults to "" for ServiceAccount subjects.
// Defaults to "rbac.authorization.k8s.io" for User and Group subjects.
// +optional
APIGroup string `json:"apiGroup,omitempty" protobuf:"bytes,2,opt,name=apiGroup"`
// Name of the object being referenced.
Name string `json:"name" protobuf:"bytes,3,opt,name=name"`
// Namespace of the referenced object. If the object kind is non-namespace, such as "User" or "Group", and this value is not empty
// the Authorizer should report an error.
// +optional
Namespace string `json:"namespace,omitempty" protobuf:"bytes,4,opt,name=namespace"`
}
// RoleRef contains information that points to the role being used
type RoleRef struct {
// APIGroup is the group for the resource being referenced
APIGroup string `json:"apiGroup" protobuf:"bytes,1,opt,name=apiGroup"`
// Kind is the type of resource being referenced
Kind string `json:"kind" protobuf:"bytes,2,opt,name=kind"`
// Name is the name of resource being referenced
Name string `json:"name" protobuf:"bytes,3,opt,name=name"`
}
// +genclient
// +k8s:deepcopy-gen:interfaces=k8s.io/apimachinery/pkg/runtime.Object
// +k8s:prerelease-lifecycle-gen:introduced=1.6
// +k8s:prerelease-lifecycle-gen:deprecated=1.17
// +k8s:prerelease-lifecycle-gen:removed=1.22
// +k8s:prerelease-lifecycle-gen:replacement=rbac.authorization.k8s.io,v1,Role
// Role is a namespaced, logical grouping of PolicyRules that can be referenced as a unit by a RoleBinding.
// Deprecated in v1.17 in favor of rbac.authorization.k8s.io/v1 Role, and will no longer be served in v1.22.
type Role struct {
metav1.TypeMeta `json:",inline"`
// Standard object's metadata.
// +optional
metav1.ObjectMeta `json:"metadata,omitempty" protobuf:"bytes,1,opt,name=metadata"`
// Rules holds all the PolicyRules for this Role
// +optional
// +listType=atomic
Rules []PolicyRule `json:"rules" protobuf:"bytes,2,rep,name=rules"`
}
// +genclient
// +k8s:deepcopy-gen:interfaces=k8s.io/apimachinery/pkg/runtime.Object
// +k8s:prerelease-lifecycle-gen:introduced=1.6
// +k8s:prerelease-lifecycle-gen:deprecated=1.17
// +k8s:prerelease-lifecycle-gen:removed=1.22
// +k8s:prerelease-lifecycle-gen:replacement=rbac.authorization.k8s.io,v1,RoleBinding
// RoleBinding references a role, but does not contain it. It can reference a Role in the same namespace or a ClusterRole in the global namespace.
// It adds who information via Subjects and namespace information by which namespace it exists in. RoleBindings in a given
// namespace only have effect in that namespace.
// Deprecated in v1.17 in favor of rbac.authorization.k8s.io/v1 RoleBinding, and will no longer be served in v1.22.
type RoleBinding struct {
metav1.TypeMeta `json:",inline"`
// Standard object's metadata.
// +optional
metav1.ObjectMeta `json:"metadata,omitempty" protobuf:"bytes,1,opt,name=metadata"`
// Subjects holds references to the objects the role applies to.
// +optional
// +listType=atomic
Subjects []Subject `json:"subjects,omitempty" protobuf:"bytes,2,rep,name=subjects"`
// RoleRef can reference a Role in the current namespace or a ClusterRole in the global namespace.
// If the RoleRef cannot be resolved, the Authorizer must return an error.
RoleRef RoleRef `json:"roleRef" protobuf:"bytes,3,opt,name=roleRef"`
}
// +k8s:deepcopy-gen:interfaces=k8s.io/apimachinery/pkg/runtime.Object
// +k8s:prerelease-lifecycle-gen:introduced=1.6
// +k8s:prerelease-lifecycle-gen:deprecated=1.17
// +k8s:prerelease-lifecycle-gen:removed=1.22
// +k8s:prerelease-lifecycle-gen:replacement=rbac.authorization.k8s.io,v1,RoleBindingList
// RoleBindingList is a collection of RoleBindings
// Deprecated in v1.17 in favor of rbac.authorization.k8s.io/v1 RoleBindingList, and will no longer be served in v1.22.
type RoleBindingList struct {
metav1.TypeMeta `json:",inline"`
// Standard object's metadata.
// +optional
metav1.ListMeta `json:"metadata,omitempty" protobuf:"bytes,1,opt,name=metadata"`
// Items is a list of RoleBindings
Items []RoleBinding `json:"items" protobuf:"bytes,2,rep,name=items"`
}
// +k8s:deepcopy-gen:interfaces=k8s.io/apimachinery/pkg/runtime.Object
// +k8s:prerelease-lifecycle-gen:introduced=1.6
// +k8s:prerelease-lifecycle-gen:deprecated=1.17
// +k8s:prerelease-lifecycle-gen:removed=1.22
// +k8s:prerelease-lifecycle-gen:replacement=rbac.authorization.k8s.io,v1,RoleList
// RoleList is a collection of Roles
// Deprecated in v1.17 in favor of rbac.authorization.k8s.io/v1 RoleList, and will no longer be served in v1.22.
type RoleList struct {
metav1.TypeMeta `json:",inline"`
// Standard object's metadata.
// +optional
metav1.ListMeta `json:"metadata,omitempty" protobuf:"bytes,1,opt,name=metadata"`
// Items is a list of Roles
Items []Role `json:"items" protobuf:"bytes,2,rep,name=items"`
}
// +genclient
// +genclient:nonNamespaced
// +k8s:deepcopy-gen:interfaces=k8s.io/apimachinery/pkg/runtime.Object
// +k8s:prerelease-lifecycle-gen:introduced=1.6
// +k8s:prerelease-lifecycle-gen:deprecated=1.17
// +k8s:prerelease-lifecycle-gen:removed=1.22
// +k8s:prerelease-lifecycle-gen:replacement=rbac.authorization.k8s.io,v1,ClusterRole
// ClusterRole is a cluster level, logical grouping of PolicyRules that can be referenced as a unit by a RoleBinding or ClusterRoleBinding.
// Deprecated in v1.17 in favor of rbac.authorization.k8s.io/v1 ClusterRole, and will no longer be served in v1.22.
type ClusterRole struct {
metav1.TypeMeta `json:",inline"`
// Standard object's metadata.
// +optional
metav1.ObjectMeta `json:"metadata,omitempty" protobuf:"bytes,1,opt,name=metadata"`
// Rules holds all the PolicyRules for this ClusterRole
// +optional
// +listType=atomic
Rules []PolicyRule `json:"rules" protobuf:"bytes,2,rep,name=rules"`
// AggregationRule is an optional field that describes how to build the Rules for this ClusterRole.
// If AggregationRule is set, then the Rules are controller managed and direct changes to Rules will be
// stomped by the controller.
// +optional
AggregationRule *AggregationRule `json:"aggregationRule,omitempty" protobuf:"bytes,3,opt,name=aggregationRule"`
}
// AggregationRule describes how to locate ClusterRoles to aggregate into the ClusterRole
type AggregationRule struct {
// ClusterRoleSelectors holds a list of selectors which will be used to find ClusterRoles and create the rules.
// If any of the selectors match, then the ClusterRole's permissions will be added
// +optional
// +listType=atomic
ClusterRoleSelectors []metav1.LabelSelector `json:"clusterRoleSelectors,omitempty" protobuf:"bytes,1,rep,name=clusterRoleSelectors"`
}
// +genclient
// +genclient:nonNamespaced
// +k8s:deepcopy-gen:interfaces=k8s.io/apimachinery/pkg/runtime.Object
// +k8s:prerelease-lifecycle-gen:introduced=1.6
// +k8s:prerelease-lifecycle-gen:deprecated=1.17
// +k8s:prerelease-lifecycle-gen:removed=1.22
// +k8s:prerelease-lifecycle-gen:replacement=rbac.authorization.k8s.io,v1,ClusterRoleBinding
// ClusterRoleBinding references a ClusterRole, but not contain it. It can reference a ClusterRole in the global namespace,
// and adds who information via Subject.
// Deprecated in v1.17 in favor of rbac.authorization.k8s.io/v1 ClusterRoleBinding, and will no longer be served in v1.22.
type ClusterRoleBinding struct {
metav1.TypeMeta `json:",inline"`
// Standard object's metadata.
// +optional
metav1.ObjectMeta `json:"metadata,omitempty" protobuf:"bytes,1,opt,name=metadata"`
// Subjects holds references to the objects the role applies to.
// +optional
// +listType=atomic
Subjects []Subject `json:"subjects,omitempty" protobuf:"bytes,2,rep,name=subjects"`
// RoleRef can only reference a ClusterRole in the global namespace.
// If the RoleRef cannot be resolved, the Authorizer must return an error.
RoleRef RoleRef `json:"roleRef" protobuf:"bytes,3,opt,name=roleRef"`
}
// +k8s:deepcopy-gen:interfaces=k8s.io/apimachinery/pkg/runtime.Object
// +k8s:prerelease-lifecycle-gen:introduced=1.6
// +k8s:prerelease-lifecycle-gen:deprecated=1.17
// +k8s:prerelease-lifecycle-gen:removed=1.22
// +k8s:prerelease-lifecycle-gen:replacement=rbac.authorization.k8s.io,v1,ClusterRoleBindingList
// ClusterRoleBindingList is a collection of ClusterRoleBindings.
// Deprecated in v1.17 in favor of rbac.authorization.k8s.io/v1 ClusterRoleBindingList, and will no longer be served in v1.22.
type ClusterRoleBindingList struct {
metav1.TypeMeta `json:",inline"`
// Standard object's metadata.
// +optional
metav1.ListMeta `json:"metadata,omitempty" protobuf:"bytes,1,opt,name=metadata"`
// Items is a list of ClusterRoleBindings
Items []ClusterRoleBinding `json:"items" protobuf:"bytes,2,rep,name=items"`
}
// +k8s:deepcopy-gen:interfaces=k8s.io/apimachinery/pkg/runtime.Object
// +k8s:prerelease-lifecycle-gen:introduced=1.6
// +k8s:prerelease-lifecycle-gen:deprecated=1.17
// +k8s:prerelease-lifecycle-gen:removed=1.22
// +k8s:prerelease-lifecycle-gen:replacement=rbac.authorization.k8s.io,v1,ClusterRoleList
// ClusterRoleList is a collection of ClusterRoles.
// Deprecated in v1.17 in favor of rbac.authorization.k8s.io/v1 ClusterRoles, and will no longer be served in v1.22.
type ClusterRoleList struct {
metav1.TypeMeta `json:",inline"`
// Standard object's metadata.
// +optional
metav1.ListMeta `json:"metadata,omitempty" protobuf:"bytes,1,opt,name=metadata"`
// Items is a list of ClusterRoles
Items []ClusterRole `json:"items" protobuf:"bytes,2,rep,name=items"`
}
```
|
```rust
#![feature(test)]
extern crate test;
use digest::bench_update;
use sha3::{Sha3_224, Sha3_256, Sha3_384, Sha3_512, Shake128, Shake256};
use test::Bencher;
bench_update!(
Sha3_224::default();
sha3_224_10 10;
sha3_224_100 100;
sha3_224_1000 1000;
sha3_224_10000 10000;
);
bench_update!(
Sha3_256::default();
sha3_256_10 10;
sha3_265_100 100;
sha3_256_1000 1000;
sha3_256_10000 10000;
);
bench_update!(
Sha3_384::default();
sha3_384_10 10;
sha3_384_100 100;
sha3_384_1000 1000;
sha3_384_10000 10000;
);
bench_update!(
Sha3_512::default();
sha3_512_10 10;
sha3_512_100 100;
sha3_512_1000 1000;
sha3_512_10000 10000;
);
bench_update!(
Shake128::default();
shake128_10 10;
shake128_100 100;
shake128_1000 1000;
shake128_10000 10000;
);
bench_update!(
Shake256::default();
shake256_10 10;
shake256_100 100;
shake256_1000 1000;
shake256_10000 10000;
);
```
|
```ruby
class OpenSceneGraph < Formula
desc "3D graphics toolkit"
homepage "path_to_url"
license "LGPL-2.1-or-later" => { with: "WxWindows-exception-3.1" }
revision 2
head "path_to_url", branch: "master"
stable do
url "path_to_url"
sha256 your_sha256_hash
# patch to fix build from source when asio library is present
patch do
url "path_to_url"
sha256 your_sha256_hash
end
end
bottle do
sha256 arm64_sonoma: your_sha256_hash
sha256 arm64_ventura: your_sha256_hash
sha256 arm64_monterey: your_sha256_hash
sha256 arm64_big_sur: your_sha256_hash
sha256 sonoma: your_sha256_hash
sha256 ventura: your_sha256_hash
sha256 monterey: your_sha256_hash
sha256 big_sur: your_sha256_hash
sha256 catalina: your_sha256_hash
sha256 x86_64_linux: your_sha256_hash
end
depends_on "cmake" => :build
depends_on "doxygen" => :build
depends_on "graphviz" => :build
depends_on "pkg-config" => :build
depends_on "fontconfig"
depends_on "freetype"
depends_on "jpeg-turbo"
depends_on "sdl2"
uses_from_macos "zlib"
on_linux do
depends_on "cairo"
depends_on "giflib"
depends_on "glib"
depends_on "libpng"
depends_on "librsvg"
depends_on "libx11"
depends_on "libxinerama"
depends_on "libxrandr"
depends_on "mesa"
end
def install
# Fix "fatal error: 'os/availability.h' file not found" on 10.11 and
# "error: expected function body after function declarator" on 10.12
# Requires the CLT to be the active developer directory if Xcode is installed
ENV["SDKROOT"] = MacOS.sdk_path if OS.mac? && MacOS.version <= :sierra
args = %w[
-DBUILD_DOCUMENTATION=ON
-DCMAKE_DISABLE_FIND_PACKAGE_FFmpeg=ON
-DCMAKE_DISABLE_FIND_PACKAGE_GDAL=ON
-DCMAKE_DISABLE_FIND_PACKAGE_Jasper=ON
-DCMAKE_DISABLE_FIND_PACKAGE_OpenEXR=ON
-DCMAKE_DISABLE_FIND_PACKAGE_SDL=ON
-DCMAKE_DISABLE_FIND_PACKAGE_TIFF=ON
-DCMAKE_CXX_FLAGS=-Wno-error=narrowing
]
if OS.mac?
arch = Hardware::CPU.arm? ? "arm64" : "x86_64"
args += %W[
-DCMAKE_OSX_ARCHITECTURES=#{arch}
-DOSG_DEFAULT_IMAGE_PLUGIN_FOR_OSX=imageio
-DOSG_WINDOWING_SYSTEM=Cocoa
]
end
system "cmake", "-S", ".", "-B", "build", *args, *std_cmake_args
system "cmake", "--build", "build"
system "cmake", "--build", "build", "--target", "doc_openscenegraph"
system "cmake", "--install", "build"
doc.install Dir["#{prefix}/doc/OpenSceneGraphReferenceDocs/*"]
end
test do
(testpath/"test.cpp").write <<~EOS
#include <iostream>
#include <osg/Version>
using namespace std;
int main()
{
cout << osgGetVersion() << endl;
return 0;
}
EOS
system ENV.cxx, "test.cpp", "-I#{include}", "-L#{lib}", "-losg", "-o", "test"
assert_match version.to_s, shell_output("./test")
end
end
```
|
```c++
// (see accompanying file LICENSE_1_0.txt or a copy at
// path_to_url
// Home at path_to_url
#ifndef BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_CONST_BIND_HPP_
#define BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_CONST_BIND_HPP_
#include <boost/local_function/detail/preprocessor/keyword/bind.hpp>
#include <boost/local_function/detail/preprocessor/keyword/const.hpp>
#include <boost/local_function/detail/preprocessor/keyword/facility/add.hpp>
#include <boost/preprocessor/control/iif.hpp>
#include <boost/preprocessor/tuple/eat.hpp>
// PRIVATE //
// These are not local macros -- DO NOT #UNDEF.
#define BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_BIND_IS_bind (1) /* unary */
#define bind_BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_BIND_IS (1) /* unary */
#define BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_BIND_REMOVE_bind /* nothing */
#define bind_BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_BIND_REMOVE /* nothing */
// PUBLIC //
// Is.
#define BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_IS_CONST_BIND_FRONT_(tokens) \
BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_IS_BIND_FRONT( \
BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_CONST_REMOVE_FRONT(tokens))
#define BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_IS_CONST_BIND_FRONT(tokens) \
BOOST_PP_IIF(BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_IS_CONST_FRONT(tokens),\
BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_IS_CONST_BIND_FRONT_ \
, \
0 BOOST_PP_TUPLE_EAT(1) \
)(tokens)
#define BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_IS_CONST_BIND_BACK_(tokens) \
BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_IS_CONST_BACK( \
BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_BIND_REMOVE_BACK(tokens))
#define BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_IS_CONDT_BIND_BACK(tokens) \
BOOST_PP_IIF(BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_IS_BIND_BACK(tokens) \
BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_IS_CONST_BIND_BACK_ \
, \
0 BOOST_PP_TUPLE_EAT(1) \
)(tokens)
// Remove.
#define BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_CONST_BIND_REMOVE_FRONT(tokens) \
BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_BIND_REMOVE_FRONT( \
BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_CONST_REMOVE_FRONT(tokens))
#define BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_CONST_BIND_REMOVE_BACK(tokens) \
BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_CONST_REMOVE_BACK( \
BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_BIND_REMOVE_BACK(tokens))
// Add.
#define BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_CONST_BIND_ADD_FRONT(tokens) \
BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_FACILITY_ADD_FRONT(tokens, \
BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_IS_CONST_BIND_FRONT, \
const bind)
#define BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_CONST_BIND_ADD_BACK(tokens) \
BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_FACILITY_ADD_BACK(tokens, \
BOOST_LOCAL_FUNCTION_DETAIL_PP_KEYWORD_IS_CONST_BIND_BACK, \
const bind)
#endif // #include guard
```
|
```go
package semver
import (
"fmt"
"strconv"
"strings"
"unicode"
)
type wildcardType int
const (
noneWildcard wildcardType = iota
majorWildcard wildcardType = 1
minorWildcard wildcardType = 2
patchWildcard wildcardType = 3
)
func wildcardTypefromInt(i int) wildcardType {
switch i {
case 1:
return majorWildcard
case 2:
return minorWildcard
case 3:
return patchWildcard
default:
return noneWildcard
}
}
type comparator func(Version, Version) bool
var (
compEQ comparator = func(v1 Version, v2 Version) bool {
return v1.Compare(v2) == 0
}
compNE = func(v1 Version, v2 Version) bool {
return v1.Compare(v2) != 0
}
compGT = func(v1 Version, v2 Version) bool {
return v1.Compare(v2) == 1
}
compGE = func(v1 Version, v2 Version) bool {
return v1.Compare(v2) >= 0
}
compLT = func(v1 Version, v2 Version) bool {
return v1.Compare(v2) == -1
}
compLE = func(v1 Version, v2 Version) bool {
return v1.Compare(v2) <= 0
}
)
type versionRange struct {
v Version
c comparator
}
// rangeFunc creates a Range from the given versionRange.
func (vr *versionRange) rangeFunc() Range {
return Range(func(v Version) bool {
return vr.c(v, vr.v)
})
}
// Range represents a range of versions.
// A Range can be used to check if a Version satisfies it:
//
// range, err := semver.ParseRange(">1.0.0 <2.0.0")
// range(semver.MustParse("1.1.1") // returns true
type Range func(Version) bool
// OR combines the existing Range with another Range using logical OR.
func (rf Range) OR(f Range) Range {
return Range(func(v Version) bool {
return rf(v) || f(v)
})
}
// AND combines the existing Range with another Range using logical AND.
func (rf Range) AND(f Range) Range {
return Range(func(v Version) bool {
return rf(v) && f(v)
})
}
// ParseRange parses a range and returns a Range.
// If the range could not be parsed an error is returned.
//
// Valid ranges are:
// - "<1.0.0"
// - "<=1.0.0"
// - ">1.0.0"
// - ">=1.0.0"
// - "1.0.0", "=1.0.0", "==1.0.0"
// - "!1.0.0", "!=1.0.0"
//
// A Range can consist of multiple ranges separated by space:
// Ranges can be linked by logical AND:
// - ">1.0.0 <2.0.0" would match between both ranges, so "1.1.1" and "1.8.7" but not "1.0.0" or "2.0.0"
// - ">1.0.0 <3.0.0 !2.0.3-beta.2" would match every version between 1.0.0 and 3.0.0 except 2.0.3-beta.2
//
// Ranges can also be linked by logical OR:
// - "<2.0.0 || >=3.0.0" would match "1.x.x" and "3.x.x" but not "2.x.x"
//
// AND has a higher precedence than OR. It's not possible to use brackets.
//
// Ranges can be combined by both AND and OR
//
// - `>1.0.0 <2.0.0 || >3.0.0 !4.2.1` would match `1.2.3`, `1.9.9`, `3.1.1`, but not `4.2.1`, `2.1.1`
func ParseRange(s string) (Range, error) {
parts := splitAndTrim(s)
orParts, err := splitORParts(parts)
if err != nil {
return nil, err
}
expandedParts, err := expandWildcardVersion(orParts)
if err != nil {
return nil, err
}
var orFn Range
for _, p := range expandedParts {
var andFn Range
for _, ap := range p {
opStr, vStr, err := splitComparatorVersion(ap)
if err != nil {
return nil, err
}
vr, err := buildVersionRange(opStr, vStr)
if err != nil {
return nil, fmt.Errorf("Could not parse Range %q: %s", ap, err)
}
rf := vr.rangeFunc()
// Set function
if andFn == nil {
andFn = rf
} else { // Combine with existing function
andFn = andFn.AND(rf)
}
}
if orFn == nil {
orFn = andFn
} else {
orFn = orFn.OR(andFn)
}
}
return orFn, nil
}
// splitORParts splits the already cleaned parts by '||'.
// Checks for invalid positions of the operator and returns an
// error if found.
func splitORParts(parts []string) ([][]string, error) {
var ORparts [][]string
last := 0
for i, p := range parts {
if p == "||" {
if i == 0 {
return nil, fmt.Errorf("First element in range is '||'")
}
ORparts = append(ORparts, parts[last:i])
last = i + 1
}
}
if last == len(parts) {
return nil, fmt.Errorf("Last element in range is '||'")
}
ORparts = append(ORparts, parts[last:])
return ORparts, nil
}
// buildVersionRange takes a slice of 2: operator and version
// and builds a versionRange, otherwise an error.
func buildVersionRange(opStr, vStr string) (*versionRange, error) {
c := parseComparator(opStr)
if c == nil {
return nil, fmt.Errorf("Could not parse comparator %q in %q", opStr, strings.Join([]string{opStr, vStr}, ""))
}
v, err := Parse(vStr)
if err != nil {
return nil, fmt.Errorf("Could not parse version %q in %q: %s", vStr, strings.Join([]string{opStr, vStr}, ""), err)
}
return &versionRange{
v: v,
c: c,
}, nil
}
// inArray checks if a byte is contained in an array of bytes
func inArray(s byte, list []byte) bool {
for _, el := range list {
if el == s {
return true
}
}
return false
}
// splitAndTrim splits a range string by spaces and cleans whitespaces
func splitAndTrim(s string) (result []string) {
last := 0
var lastChar byte
excludeFromSplit := []byte{'>', '<', '='}
for i := 0; i < len(s); i++ {
if s[i] == ' ' && !inArray(lastChar, excludeFromSplit) {
if last < i-1 {
result = append(result, s[last:i])
}
last = i + 1
} else if s[i] != ' ' {
lastChar = s[i]
}
}
if last < len(s)-1 {
result = append(result, s[last:])
}
for i, v := range result {
result[i] = strings.Replace(v, " ", "", -1)
}
// parts := strings.Split(s, " ")
// for _, x := range parts {
// if s := strings.TrimSpace(x); len(s) != 0 {
// result = append(result, s)
// }
// }
return
}
// splitComparatorVersion splits the comparator from the version.
// Input must be free of leading or trailing spaces.
func splitComparatorVersion(s string) (string, string, error) {
i := strings.IndexFunc(s, unicode.IsDigit)
if i == -1 {
return "", "", fmt.Errorf("Could not get version from string: %q", s)
}
return strings.TrimSpace(s[0:i]), s[i:], nil
}
// getWildcardType will return the type of wildcard that the
// passed version contains
func getWildcardType(vStr string) wildcardType {
parts := strings.Split(vStr, ".")
nparts := len(parts)
wildcard := parts[nparts-1]
possibleWildcardType := wildcardTypefromInt(nparts)
if wildcard == "x" {
return possibleWildcardType
}
return noneWildcard
}
// createVersionFromWildcard will convert a wildcard version
// into a regular version, replacing 'x's with '0's, handling
// special cases like '1.x.x' and '1.x'
func createVersionFromWildcard(vStr string) string {
// handle 1.x.x
vStr2 := strings.Replace(vStr, ".x.x", ".x", 1)
vStr2 = strings.Replace(vStr2, ".x", ".0", 1)
parts := strings.Split(vStr2, ".")
// handle 1.x
if len(parts) == 2 {
return vStr2 + ".0"
}
return vStr2
}
// incrementMajorVersion will increment the major version
// of the passed version
func incrementMajorVersion(vStr string) (string, error) {
parts := strings.Split(vStr, ".")
i, err := strconv.Atoi(parts[0])
if err != nil {
return "", err
}
parts[0] = strconv.Itoa(i + 1)
return strings.Join(parts, "."), nil
}
// incrementMajorVersion will increment the minor version
// of the passed version
func incrementMinorVersion(vStr string) (string, error) {
parts := strings.Split(vStr, ".")
i, err := strconv.Atoi(parts[1])
if err != nil {
return "", err
}
parts[1] = strconv.Itoa(i + 1)
return strings.Join(parts, "."), nil
}
// expandWildcardVersion will expand wildcards inside versions
// following these rules:
//
// * when dealing with patch wildcards:
// >= 1.2.x will become >= 1.2.0
// <= 1.2.x will become < 1.3.0
// > 1.2.x will become >= 1.3.0
// < 1.2.x will become < 1.2.0
// != 1.2.x will become < 1.2.0 >= 1.3.0
//
// * when dealing with minor wildcards:
// >= 1.x will become >= 1.0.0
// <= 1.x will become < 2.0.0
// > 1.x will become >= 2.0.0
// < 1.0 will become < 1.0.0
// != 1.x will become < 1.0.0 >= 2.0.0
//
// * when dealing with wildcards without
// version operator:
// 1.2.x will become >= 1.2.0 < 1.3.0
// 1.x will become >= 1.0.0 < 2.0.0
func expandWildcardVersion(parts [][]string) ([][]string, error) {
var expandedParts [][]string
for _, p := range parts {
var newParts []string
for _, ap := range p {
if strings.Index(ap, "x") != -1 {
opStr, vStr, err := splitComparatorVersion(ap)
if err != nil {
return nil, err
}
versionWildcardType := getWildcardType(vStr)
flatVersion := createVersionFromWildcard(vStr)
var resultOperator string
var shouldIncrementVersion bool
switch opStr {
case ">":
resultOperator = ">="
shouldIncrementVersion = true
case ">=":
resultOperator = ">="
case "<":
resultOperator = "<"
case "<=":
resultOperator = "<"
shouldIncrementVersion = true
case "", "=", "==":
newParts = append(newParts, ">="+flatVersion)
resultOperator = "<"
shouldIncrementVersion = true
case "!=", "!":
newParts = append(newParts, "<"+flatVersion)
resultOperator = ">="
shouldIncrementVersion = true
}
var resultVersion string
if shouldIncrementVersion {
switch versionWildcardType {
case patchWildcard:
resultVersion, _ = incrementMinorVersion(flatVersion)
case minorWildcard:
resultVersion, _ = incrementMajorVersion(flatVersion)
}
} else {
resultVersion = flatVersion
}
ap = resultOperator + resultVersion
}
newParts = append(newParts, ap)
}
expandedParts = append(expandedParts, newParts)
}
return expandedParts, nil
}
func parseComparator(s string) comparator {
switch s {
case "==":
fallthrough
case "":
fallthrough
case "=":
return compEQ
case ">":
return compGT
case ">=":
return compGE
case "<":
return compLT
case "<=":
return compLE
case "!":
fallthrough
case "!=":
return compNE
}
return nil
}
// MustParseRange is like ParseRange but panics if the range cannot be parsed.
func MustParseRange(s string) Range {
r, err := ParseRange(s)
if err != nil {
panic(`semver: ParseRange(` + s + `): ` + err.Error())
}
return r
}
```
|
NSU is a Tide Light Rail station in Norfolk, Virginia. It opened in August 2011 and is situated adjacent to Norfolk State University, just west of Brambleton Avenue. It is the only Tide station that is elevated, and is accessible by stairs and elevator.
References
External links
NSU station
Tide Light Rail stations
Railway stations in the United States opened in 2011
2011 establishments in Virginia
Railway stations in Virginia at university and college campuses
|
Hans-Christian Biallas (26 December 1956 – 27 February 2022) was a German politician and Protestant theologian. He was the president of the Klosterkammer Hannover of Lower Saxony.
Life
Biallas attended schools in Soltau and Buxtehude, and then studied Protestant theology in Göttingen, Kiel and Amsterdam. He began work as a vicar in Preetz in 1981, and was from 1983 to 1994 pastor in Cuxhaven-.
Politics
Biallas joined the CDU in 1992. From 1996, he was at times a member of the municipal council of Cuxhaven. From 1994 to 2011, he served as a member of the Landtag of Lower Saxony.
Klosterkammer Hannover
The state government appointed him president of the Klosterkammer Hannover as of 1 June 2011, succeeding Sigrid Maier-Knapp-Herbst. He held the position until his death.
Private life
Biallas was divorced and had three children. He died on 27 February at age 65.
References
External links
1956 births
2022 deaths
20th-century German politicians
21st-century German politicians
Members of the Landtag of Lower Saxony
20th-century German Protestant theologians
21st-century German Protestant theologians
Christian Democratic Union of Germany politicians
Politicians from Hanover
|
Skithegga is a small river running out of lake Gjellum in Norway. It starts further up in Kjekstadmarka at the lake Heggsjøen and runs through Åsåker, Røyken, Buskerud county, and Hallenskog. The river normally has limited water, but during springtime it floods and put several farm areas under water.
Rivers of Viken
Rivers of Norway
|
```javascript
const debug = require("debug")("blot:build:dateStamp");
const fromPath = require("./fromPath");
const fromMetadata = require("./fromMetadata");
const type = require("helper/type");
const moment = require("moment");
require("moment-timezone");
module.exports = function (blog, path, metadata) {
const { id, dateFormat, timeZone } = blog;
let dateStamp;
debug("Blog:", id, "dateFormat:", dateFormat, "timeZone", timeZone, path);
// If the user specified a date
// field in the entry's metadata,
// try and parse a timestamp from it.
if (metadata.date) {
let parsedFromMetadata = fromMetadata(metadata.date, dateFormat, timeZone);
dateStamp = validate(parsedFromMetadata.created);
if (dateStamp && parsedFromMetadata.adjusted) {
return dateStamp;
} else if (dateStamp) {
return adjustByBlogTimezone(timeZone, dateStamp);
}
}
if (dateStamp !== undefined) return dateStamp;
// The user didn't specify a valid
// date in the entry's metadata. Try
// and extract one from the file's path
dateStamp = validate(fromPath(path, timeZone).created);
if (dateStamp !== undefined) {
dateStamp = adjustByBlogTimezone(timeZone, dateStamp);
return dateStamp;
}
// It is important we return undefined since we fall back
// to the file's created date if that's the case
return undefined;
};
function validate(stamp) {
if (type(stamp, "number") && !isNaN(stamp) && moment.utc(stamp).isValid())
return stamp;
return undefined;
}
function adjustByBlogTimezone(timeZone, stamp) {
var zone = moment.tz.zone(timeZone);
var offset = zone.utcOffset(stamp);
return moment.utc(stamp).add(offset, "minutes").valueOf();
}
```
|
```c++
#ifndef BOOST_SMART_PTR_DETAIL_SPINLOCK_GCC_ARM_HPP_INCLUDED
#define BOOST_SMART_PTR_DETAIL_SPINLOCK_GCC_ARM_HPP_INCLUDED
//
//
// See accompanying file LICENSE_1_0.txt or copy at
// path_to_url
//
#include <boost/smart_ptr/detail/yield_k.hpp>
#if defined(__ARM_ARCH_7__) || defined(__ARM_ARCH_7A__) || defined(__ARM_ARCH_7R__) || defined(__ARM_ARCH_7M__) || defined(__ARM_ARCH_7EM__) || defined(__ARM_ARCH_7S__)
# define BOOST_SP_ARM_BARRIER "dmb"
# define BOOST_SP_ARM_HAS_LDREX
#elif defined(__ARM_ARCH_6__) || defined(__ARM_ARCH_6J__) || defined(__ARM_ARCH_6K__) || defined(__ARM_ARCH_6Z__) || defined(__ARM_ARCH_6ZK__) || defined(__ARM_ARCH_6T2__)
# define BOOST_SP_ARM_BARRIER "mcr p15, 0, r0, c7, c10, 5"
# define BOOST_SP_ARM_HAS_LDREX
#else
# define BOOST_SP_ARM_BARRIER ""
#endif
namespace boost
{
namespace detail
{
class spinlock
{
public:
int v_;
public:
bool try_lock()
{
int r;
#ifdef BOOST_SP_ARM_HAS_LDREX
__asm__ __volatile__(
"ldrex %0, [%2]; \n"
"cmp %0, %1; \n"
"strexne %0, %1, [%2]; \n"
BOOST_SP_ARM_BARRIER :
"=&r"( r ): // outputs
"r"( 1 ), "r"( &v_ ): // inputs
"memory", "cc" );
#else
__asm__ __volatile__(
"swp %0, %1, [%2];\n"
BOOST_SP_ARM_BARRIER :
"=&r"( r ): // outputs
"r"( 1 ), "r"( &v_ ): // inputs
"memory", "cc" );
#endif
return r == 0;
}
void lock()
{
for( unsigned k = 0; !try_lock(); ++k )
{
boost::detail::yield( k );
}
}
void unlock()
{
__asm__ __volatile__( BOOST_SP_ARM_BARRIER ::: "memory" );
*const_cast< int volatile* >( &v_ ) = 0;
__asm__ __volatile__( BOOST_SP_ARM_BARRIER ::: "memory" );
}
public:
class scoped_lock
{
private:
spinlock & sp_;
scoped_lock( scoped_lock const & );
scoped_lock & operator=( scoped_lock const & );
public:
explicit scoped_lock( spinlock & sp ): sp_( sp )
{
sp.lock();
}
~scoped_lock()
{
sp_.unlock();
}
};
};
} // namespace detail
} // namespace boost
#define BOOST_DETAIL_SPINLOCK_INIT {0}
#undef BOOST_SP_ARM_BARRIER
#undef BOOST_SP_ARM_HAS_LDREX
#endif // #ifndef BOOST_SMART_PTR_DETAIL_SPINLOCK_GCC_ARM_HPP_INCLUDED
```
|
Atte Johannes Muhonen (20 October 1888, Laukaa - 16 February 1954) was a Finnish farmer and politician. He was a member of the Parliament of Finland from 1922 to 1929 and again from 1936 to 1939, representing the Social Democratic Party of Finland (SDP).
References
1888 births
1954 deaths
People from Laukaa
Politicians from Vaasa Province (Grand Duchy of Finland)
Social Democratic Party of Finland politicians
Members of the Parliament of Finland (1922–1924)
Members of the Parliament of Finland (1924–1927)
Members of the Parliament of Finland (1927–1929)
Members of the Parliament of Finland (1936–1939)
|
```xml
export * from './Bar'
export * from './BarCanvas'
export * from './BarItem'
export * from './BarTooltip'
export * from './BarTotals'
export * from './ResponsiveBar'
export * from './ResponsiveBarCanvas'
export * from './props'
export * from './types'
```
|
Traci Townsend is a 2006 comedy film directed by Craig Ross Jr. and starring Jazsmin Lewis and Mari Morrow. It was written by Bobby Thompson, who was also a producer of the film.
Premise
A beautiful and successful journalist interviews her three previous boyfriends to find out why they never proposed. Each distinctly different interview comically teaches Traci more about herself than she would care to know.
Cast
Jazsmin Lewis as Traci Townsend
Mari Morrow as Sylvia
Richard T. Jones as Travis
Jay Acovone as Jesse "The Boss"
Victor Williams as Darrell
Suzanne Whang as Rosa
Marlon Young as Pierre
Amy Hunter as Vick
Aaron D. Spears as Dante
Myquan Jackson as Jay
Accolades
2006 Boston International Film Festival
Best Acting Performance — Jazsmin Lewis (winner)
2006 Hollywood Black Film Festival
Audience Choice Award (winner)
References
External links
2006 films
2006 comedy films
African-American comedy films
2000s English-language films
2000s American films
|
The Pinchot–Ballinger controversy, also known as the "Ballinger Affair", was a dispute between U.S. Forest Service Chief Gifford Pinchot and U.S. Secretary of the Interior Richard A. Ballinger that contributed to the split of the Republican Party before the 1912 presidential election and helped to define the U.S. conservation movement in the early 20th century.
Ballinger's appointment
In March 1909, President William Howard Taft began his administration by replacing Theodore Roosevelt's Secretary of the Interior, James Rudolph Garfield, with Richard A. Ballinger, a former Mayor of Seattle who had served as Commissioner of the General Land Office (GLO) under Secretary Garfield. Ballinger's appointment was a disappointment to conservationists, who interpreted the replacement of Garfield as a break with Roosevelt administration policies on conservationism. Within weeks of taking office, Ballinger reversed some of Garfield's policies, restoring 3 million acres (12,000 km²) to private use.
Allegations by Pinchot and Glavis
By July 1909, Gifford Pinchot, who had been appointed by President William McKinley to head the USDA Division of Forestry in 1898, and who had run the U.S. Forest Service since it had taken over management of forest reserves from the General Land Office in 1905, became convinced that Ballinger intended to "stop the conservation movement". In August, speaking at the annual meeting of the National Irrigation Congress in Spokane, Washington, he accused Ballinger of siding with private trusts in his handling of water power issues. At the same time, he helped to arrange a meeting between President Taft and Louis Glavis, chief of the Portland, Oregon, Field Division of the GLO. Glavis met with the president at Taft's summer retreat in Beverly, Massachusetts, and presented him with a 50-page report accusing Ballinger of an improper interest in his handling of coal field claims in Alaska.
Glavis claimed that Ballinger, first as Commissioner of the General Land Office, and then as Secretary of the Interior, had interfered with investigations of coal claim purchases made by Clarence Cunningham of Idaho. In 1907, Cunningham had partnered with the Morgan–Guggenheim "Alaska Syndicate" to develop coal interests in Alaska. The GLO had launched an anti-trust investigation, headed by Glavis. Ballinger, then head of the GLO, rejected Glavis's findings and removed him from the investigation. In 1908, Ballinger stepped down from the GLO, and took up a private law practice in Seattle. Cunningham became a client.
Convinced that Ballinger, now the head of the United States Department of Interior, had a personal interest in obstructing an investigation of the Cunningham case, Glavis had sought support from the U.S. Forest Service, whose jurisdiction over the Chugach National Forest included several of the Cunningham claims. He received a sympathetic response from Alexander Shaw, Overton Price and Pinchot, who helped him to prepare the presentation for Taft.
Dismissals, investigations, and scandal
Taft consulted with Attorney General George Wickersham before issuing a public letter in September, exonerating Ballinger and authorizing the dismissal of Glavis on grounds of insubordination. At the same time, Taft tried to conciliate Pinchot and affirm his administration's pro-conservation stance.
Glavis took his case to the press. In November, Collier's Weekly published an article elaborating his allegations, entitled The Whitewashing of Ballinger: Are the Guggenheims in Charge of the Department of the Interior?
In January 1910, Pinchot sent an open letter to Senator Jonathan P. Dolliver, who read it into the Congressional Record. Pinchot praised Glavis as a "patriot", openly rebuked Taft, and asked for Congressional hearings into the propriety of Ballinger's dealings. Pinchot was promptly fired, but from January to May, the United States House of Representatives held hearings on Ballinger. Ballinger was cleared of any wrongdoing, but criticized from some quarters for favoring private enterprise and the exploitation of natural resources over conservationism.
Consequences
The firing of Pinchot, a close friend of Teddy Roosevelt, alienated many progressives within the Republican party and drove a wedge between Taft and Roosevelt himself, leading to the split of the Republican Party in the 1912 presidential election.
Investigation
The affair was officially investigated over two decades later by Secretary of the Interior Harold L. Ickes. Ickes published a popular account of his findings in the Saturday Evening Post. His official findings were expanded to 58 pages and published by the Department under the title "Not Guilty : an official inquiry into the charges made by Glavis and Pinchot against Richard A. Ballinger, Secretary of the interior, 1909-1911" (Washington: Government Printing Office, 1940). Ickes declares Ballinger innocent and paints Pinchot as a publicity-seeking, vindictive man who pursued Ballinger even after the accused had died (page 3).
Notes
1909 in the United States
Political scandals in the United States
Political history of the United States
Pre-statehood history of Alaska
Progressive Era in the United States
|
{{Infobox school
| name = St. John's College
| native_name = பரி. யோவான் கல்லூரி
| latin_name =
| logo = St John's College Jaffna crest.png
| logo_size = 150px
| seal_image =
| image = Knight block, St. John's College, Jaffna, Sri Lanka (2010).jpg
| alt =
| caption = Knight block
| motto = | motto_translation = Light Shines in the Darkness
| location =
| streetaddress = Main Street, Chundikuli
| region =
| city = Jaffna, Jaffna District
| province = Northern Province
| zipcode = 40000
| country = Sri Lanka
| coordinates =
| pushpin_map = Sri Lanka Jaffna Central
| pushpin_image =
| pushpin_mapsize =
| pushpin_map_alt =
| pushpin_map_caption = Location in central Jaffna
| pushpin_label =
| pushpin_label_position = bottom
| schooltype = 1AB
| fundingtype =
| type = Private
| religious_affiliation =
| religion = Christianity
| denomination = Anglicanism
| patron = St. John
| established =
| founded =
| founder = Joseph Knight
| district = Jaffna Education Zone
| authority = Church of Ceylon
| category =
| category_label =
| oversight =
| oversight_label =
| authorizer =
| superintendent =
| trustee =
| specialist =
| session =
| schoolnumber = 1001029
| school code =
| president =
| chair =
| chairman =
| chairperson =
| dean =
| administrator =
| rector =
| director =
| principal = V. S. B. Thuseetharan
| campus director =
| headmistress =
| headmaster = A. H. Gnanarajan
| head of school =
| head_teacher = V. Kumanan
| executive_headteacher =
| acting_headteacher =
| head =
| head_label =
| chaplain = S. S. Jebaselvan
| staff =
| faculty =
| teaching_staff = 95
| employees =
| key_people =
| grades = 1 - 13
| years =
| gender = Boys
| lower_age =
| upper_age =
| age range = 5 - 18
| enrolment =
| enrollment =
| enrollment_as_of =
| students =
| sixth_form_students =
| pupils =
| other =
| other_grade_enrollment =
| other_grade_label =
| international_students =
| classes =
| avg_class_size =
| ratio =
| system =
| classes_offered =
| medium =
| language = Tamil, English
| schedtyp =
| schedule =
| hours_in_day =
| classrooms =
| campuses =
| campus =
| campus size =
| area =
| campus type =
| houses = Handy Johnstone Pargiter PetoThompson
| colors = Red and Black
| song =
| roll = 2130
| alumni_name = Old Johnians
| website =
}}
St. John's College ( Ceṉ. Yōvāṉ Kallūri, SJC) is a private school in Jaffna, Sri Lanka. Founded in 1823 by British Anglican missionaries, it is one of Sri Lanka's oldest schools.
History
In 1817 the Anglican Church Mission Society (CMS) approved the establishment of missions in Ceylon. On 20 December 1817 four clergymen – Joseph Knight, Samuel Lambrick, Robert Major and Benjamin Ward – and their wives left England and sailed to Ceylon on board the Vittoria. They arrived in late June 1818. Knight went to Jaffna, Lambrick went to Colombo, Major and his wife went to Galle and Ward and his wife to Trincomalee. Knight started his missionary work in 1818 in Nallur.
The Nallur English Seminary was established in March 1823 by Knight. The school had only 7 students and was located in Knight's bungalow. In 1845 the school was relocated to Chundikuli and renamed the Chundikuli Seminary.
In the same year the Church Mission Society took over the old Portuguese St. John the Baptist church. In 1846 the school moved into a hall next to the church. The church was demolished in 1859 and replaced by the current church.
The school was renamed St. John's College in 1891. The free education system was introduced by the government in 1945 but SJC chose to remain outside the system. In 1951 SJC joined the free education system. Most private schools in Ceylon were taken over by the government in 1960 but SJC chose to remain as a private and non-fee levying school.
SJC's principal C. E. Anandarajan was shot dead on 26 June 1985 in Jaffna. It is alleged that the Liberation Tigers of Tamil Eelam assassinated Anandarajan for organising a cricket match with the Sri Lankan military.
Big Match
SJC plays Jaffna Central College in the annual cricket match known as the "Battle of the North''". The first match took place in 1904.
Principals
1823-1825 Rev. Joseph Knight
1825-1839 Rev. W. Adley
1839-1841 Rev. F. W. Taylor
1841-1846 Rev. I. T. Johnstone
1846-1866 Rev. R. Pargiter
1866-1874 Rev. T. Good
1874-1878 Rev. D. Wood
1878-1879 Rev. E. Blackmore
1879-1889 Rev. G. T. Fleming
1889-1892 Rev. C. C. Handy (Acting)
1892-1895 Rev. J. W. Fall
1895-1899 Rev. I. Carter
1899-1900 Rev. R. W. Ryde
1900-1919 Rev. Jacob Thomson
1919 Rev. K. C. Mc Pherson (Acting)
1920-1940 Rev. Henry Peto
1940-1957 Rev. J. T. Arulanantham
1957-1959 P. T. Mathai
1959-1966 A. W. Rajasekeram
1967-1976 K. Pooranampillai
1976-1985 C. E. Anandarajan
1985-1987 T. Gunaseelan
1987 K. Pooranampillai
1988-1993 Dr. E. S. Thevasagayam
1990-1993 S. Thanapalan (Acting)
1993-2006 S. Thanapalan
2006-2019 Rev. N. J. Gnanaponrajah
2019 Ven. Samuel J. Ponniah (Acting)
2020- V. S. B. Thuseetharan
Notable alumni
See also
List of schools in Northern Province, Sri Lanka
Notes
References
External links
St. John's College
Old Boys Association
Old Boys Association, Sydney, Australia
Old Boys Association, Victoria, Australia
Old Boys Association, South Sri Lanka
Chundikuli St. John's Past Pupils Association, UKA
1823 establishments in Ceylon
Boys' schools in Sri Lanka
Church of Ceylon schools in the Diocese of Colombo
Educational institutions established in 1823
Private schools in Sri Lanka
Schools in Jaffna
|
```javascript
export default function HelloPage(props) {
return (
<>
<p>hello from app/dashboard/rootonly/hello</p>
</>
)
}
export const runtime = 'experimental-edge'
export const preferredRegion = ['iad1', 'sfo1']
```
|
Digitaria platycarpha is a species of flowering plant in the family Poaceae (grasses), native to the Bonin Islands and the Volcano Islands, both belonging to Japan.
References
platycarpha
Flora of the Volcano Islands
Flora of the Bonin Islands
Plants described in 1834
|
Amelita Alanes-Saberon (born 28 February 1952) is a Filipino sprinter. She competed in the women's 100 metres at the 1972 Summer Olympics. She won gold in the women's 100 metres as well as the women's 4x400m relay race at the 1973 Asian championships.
References
External links
1952 births
Living people
Athletes (track and field) at the 1972 Summer Olympics
Filipino female sprinters
Olympic track and field athletes for the Philippines
Asian Games medalists in athletics (track and field)
Asian Games silver medalists for the Philippines
Asian Games bronze medalists for the Philippines
Athletes (track and field) at the 1970 Asian Games
Athletes (track and field) at the 1974 Asian Games
Athletes (track and field) at the 1978 Asian Games
Medalists at the 1970 Asian Games
Medalists at the 1978 Asian Games
Olympic female sprinters
Asian Athletics Championships winners
|
Joachim is a Germanic surname, ultimately derived from the Biblical king Jehoiakim. Pronunciation varies, and may be wa-keem' or jo'-akim.
People with this surname
Amalie Joachim (1839–1899), Austrian-German contralto and voice teacher, wife of Joseph
Attila Joachim (1923–1947), Hungarian Holocaust victim
Aurélien Joachim (born 1986), Luxembourgian footballer
Benoît Joachim (born 1976), Luxembourgian professional road racing cyclist
Charlie Joachim (1920–2002), American basketball player
Ferenc Joachim (1882–1964), Hungarian (Magyar) painter of portraits and landscapes
Harold H. Joachim (1868–1938), British idealist philosopher
Irène Joachim (1913–2001), French soprano; grand-daughter of the violinist Joseph Joachim
Joseph Joachim (1831–1907), Hungarian violinist, conductor, composer and teacher, husband of Amalie
(1834–1904), Swiss author
Julian Joachim (born 1974), English professional footballer
Otto Joachim (composer) (1910–2010), German-born Canadian musician and composer of electronic music
Suresh Joachim (fl. 2005), Sri Lankan (Tamil) international Record collector
See also
Joachim (given name)
Joachim genannt Thalbach (disambiguation)
German-language surnames
Surnames of Jewish origin
Hebrew-language surnames
Yiddish-language surnames
|
```kotlin
package mega.privacy.android.domain.usecase.node
import com.google.common.truth.Truth.assertThat
import kotlinx.coroutines.test.runTest
import mega.privacy.android.domain.entity.node.NodeId
import mega.privacy.android.domain.entity.node.NodeNameCollision
import mega.privacy.android.domain.entity.node.chat.ChatDefaultFile
import mega.privacy.android.domain.exception.NotEnoughQuotaMegaException
import mega.privacy.android.domain.exception.QuotaExceededMegaException
import mega.privacy.android.domain.exception.node.ForeignNodeException
import mega.privacy.android.domain.repository.NodeRepository
import mega.privacy.android.domain.usecase.node.chat.GetChatFilesUseCase
import org.junit.jupiter.api.AfterEach
import org.junit.jupiter.api.BeforeEach
import org.junit.jupiter.api.Test
import org.junit.jupiter.api.assertThrows
import org.mockito.kotlin.any
import org.mockito.kotlin.anyOrNull
import org.mockito.kotlin.doReturn
import org.mockito.kotlin.mock
import org.mockito.kotlin.reset
import org.mockito.kotlin.whenever
internal class CopyCollidedNodeUseCaseTest {
private val getChatFilesUseCase: GetChatFilesUseCase = mock()
private val copyTypedNodeUseCase: CopyTypedNodeUseCase = mock()
private val nodeRepository: NodeRepository = mock()
private lateinit var underTest: CopyCollidedNodeUseCase
@BeforeEach
fun setUp() {
underTest = CopyCollidedNodeUseCase(
getChatFilesUseCase = getChatFilesUseCase,
copyTypedNodeUseCase = copyTypedNodeUseCase,
nodeRepository = nodeRepository
)
}
@AfterEach
fun resetMocks() {
reset(nodeRepository, copyTypedNodeUseCase, getChatFilesUseCase)
}
@Test
fun `test that CopyCollidedNodeUseCase correctly copies a node when there is no exception`() =
runTest {
val nodeNameCollision = mock<NodeNameCollision.Default> {
on { nodeHandle } doReturn 1L
on { parentHandle } doReturn 2L
on { renameName } doReturn "new name"
on { serializedData } doReturn null
}
whenever(
nodeRepository.copyNode(
NodeId(any()),
any(),
NodeId(any()),
anyOrNull()
)
).thenReturn(
NodeId(
1L
)
)
val result = underTest(nodeNameCollision, rename = true)
assertThat(result.count).isEqualTo(1)
assertThat(result.errorCount).isEqualTo(0)
}
@Test
fun `test that CopyCollidedNodeUseCase correctly handles exceptions and returns the appropriate MoveRequestResult`() =
runTest {
val nodeNameCollision = mock<NodeNameCollision.Default> {
on { nodeHandle } doReturn 1L
on { parentHandle } doReturn 2L
on { renameName } doReturn "new name"
on { serializedData } doReturn null
}
whenever(
nodeRepository.copyNode(
NodeId(any()),
anyOrNull(),
NodeId(any()),
anyOrNull()
)
).thenThrow(RuntimeException::class.java)
val result = underTest(nodeNameCollision, rename = true)
assertThat(result.count).isEqualTo(1)
assertThat(result.errorCount).isEqualTo(1)
}
@Test
fun `test that CopyCollidedNodeUseCase correctly copies a chat node when there is no exception`() =
runTest {
val chatFile = mock<ChatDefaultFile> {
on { id } doReturn NodeId(1L)
}
val nodeNameCollision = mock<NodeNameCollision.Chat> {
on { nodeHandle } doReturn 1L
on { parentHandle } doReturn 2L
on { chatId } doReturn 1L
on { messageId } doReturn 1L
on { serializedData } doReturn null
}
whenever(getChatFilesUseCase(1L, 1L)).thenReturn(listOf(chatFile))
whenever(copyTypedNodeUseCase(chatFile, NodeId(2L), null)).thenReturn(NodeId(2L))
val result = underTest(nodeNameCollision, rename = false)
assertThat(result.count).isEqualTo(1)
assertThat(result.errorCount).isEqualTo(0)
}
@Test
fun `test that CopyCollidedNodeUseCase correctly handles exceptions and returns the appropriate MoveRequestResult when chat file is not found`() =
runTest {
val chatFile = mock<ChatDefaultFile> {
on { id } doReturn NodeId(9L)
}
val name = "new name"
val nodeNameCollision = mock<NodeNameCollision.Chat> {
on { nodeHandle } doReturn 1L
on { parentHandle } doReturn 2L
on { renameName } doReturn "new name"
on { chatId } doReturn 1L
on { messageId } doReturn 1L
}
whenever(getChatFilesUseCase(1L, 1L)).thenReturn(listOf(chatFile))
whenever(copyTypedNodeUseCase(chatFile, NodeId(2L), name)).thenReturn(NodeId(1L))
val result = underTest(nodeNameCollision, rename = true)
assertThat(result.count).isEqualTo(1)
assertThat(result.errorCount).isEqualTo(1)
}
@Test
fun `test that CopyCollidedNodeUseCase correctly handles exceptions and returns the appropriate MoveRequestResult when copying a chat node`() =
runTest {
val chatFile = mock<ChatDefaultFile>()
val nodeNameCollision = mock<NodeNameCollision.Chat> {
on { nodeHandle } doReturn 1L
on { parentHandle } doReturn 2L
on { renameName } doReturn "new name"
on { chatId } doReturn 1L
on { messageId } doReturn 1L
}
whenever(getChatFilesUseCase(any(), any())).thenThrow(RuntimeException::class.java)
whenever(
copyTypedNodeUseCase(
chatFile,
NodeId(2L),
null
)
).thenThrow(RuntimeException::class.java)
val result = underTest(nodeNameCollision, rename = false)
assert(result.count == 1)
assert(result.errorCount == 1)
}
@Test
fun `test that CopyCollidedNodeUseCase throws exception when copy node throw ForeignNodeException`() =
runTest {
val nodeNameCollision = mock<NodeNameCollision.Default> {
on { nodeHandle } doReturn 1L
on { parentHandle } doReturn 2L
on { serializedData } doReturn null
}
whenever(
nodeRepository.copyNode(
NodeId(any()),
anyOrNull(),
NodeId(any()),
anyOrNull()
)
)
.thenThrow(ForeignNodeException::class.java)
assertThrows<ForeignNodeException> {
underTest(nodeNameCollision, false)
}
}
@Test
fun `test that CopyCollidedNodeUseCase throws exception when copy node throw NotEnoughQuotaMegaException`() =
runTest {
val nodeNameCollision = mock<NodeNameCollision.Default> {
on { nodeHandle } doReturn 1L
on { parentHandle } doReturn 2L
on { serializedData } doReturn "data"
}
whenever(
nodeRepository.copyNode(
NodeId(any()),
anyOrNull(),
NodeId(any()),
anyOrNull()
)
)
.thenAnswer {
throw NotEnoughQuotaMegaException(1, "")
}
assertThrows<NotEnoughQuotaMegaException> {
underTest(nodeNameCollision, false)
}
}
@Test
fun `test that CopyCollidedNodeUseCase throws exception when copy node throw QuotaExceededMegaException`() =
runTest {
val nodeNameCollision = mock<NodeNameCollision.Default> {
on { nodeHandle } doReturn 1L
on { parentHandle } doReturn 2L
on { serializedData } doReturn "data"
}
whenever(
nodeRepository.copyNode(
NodeId(any()),
anyOrNull(),
NodeId(any()),
anyOrNull()
)
)
.thenAnswer {
throw QuotaExceededMegaException(1, "")
}
assertThrows<QuotaExceededMegaException> {
underTest(nodeNameCollision, false)
}
}
}
```
|
The Bozeman Daily Chronicle is a daily newspaper published in Bozeman, Montana.
History
Founded in 1883, the paper was originally a weekly. Since 1996, the Chronicle has been published each morning, and its first Saturday edition was published in 1997. The paper converted to a morning publication with a new design in April 1996. Owner Pioneer News Group sold its papers to Adams Publishing Group in 2017.
It is noted by many of its residents and non-residents to have an entertaining Police Reports section, which include "many minor crimes of a more humorous or absurd nature". In 2011, they published a book We Don't Make This Stuff Up a compilation of over 30 years of some of these crimes.
Notes
External links
Bozeman Daily Chronicle
Newspapers published in Montana
Publications established in 1883
1883 establishments in Montana Territory
Daily newspapers published in the United States
|
```java
/*
* 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 implied.
*/
package org.apache.rocketmq.broker.processor;
import io.netty.channel.ChannelHandlerContext;
import org.apache.rocketmq.broker.BrokerController;
import org.apache.rocketmq.common.constant.LoggerName;
import org.apache.rocketmq.logging.InternalLogger;
import org.apache.rocketmq.logging.InternalLoggerFactory;
import org.apache.rocketmq.remoting.netty.AsyncNettyRequestProcessor;
import org.apache.rocketmq.remoting.netty.NettyRequestProcessor;
import org.apache.rocketmq.remoting.protocol.RemotingCommand;
public class ForwardRequestProcessor extends AsyncNettyRequestProcessor implements NettyRequestProcessor {
private static final InternalLogger log = InternalLoggerFactory.getLogger(LoggerName.BROKER_LOGGER_NAME);
private final BrokerController brokerController;
public ForwardRequestProcessor(final BrokerController brokerController) {
this.brokerController = brokerController;
}
@Override
public RemotingCommand processRequest(ChannelHandlerContext ctx, RemotingCommand request) {
return null;
}
@Override
public boolean rejectRequest() {
return false;
}
}
```
|
Évreux Cathedral, otherwise the Cathedral of Our Lady of Évreux (), is a Catholic church located in Évreux, Normandy, France. The cathedral is a national monument and is the seat of the Bishop of Évreux.
Building description
The cathedral is devoted to Notre-Dame at Evreux, which is 80 km west of Paris. Built in the 10th century, the nave retains the semi-circular arcades from the Romanesque period. Part of the lower portion of the nave dates from the 11th century. A fire in 1119 destroyed much of the earlier building. Master of the work in 1253 was Gautier de Varinfroy, who also worked on Saint-Étienne de Meaux. Varinfroy worked on the upper levels of the nave.
The west façade, with its two towers, is mostly from the late 16th century. The north tower is the bell tower. Its foundation is said to have been laid in 1392, and to have been finished in 1417. Various styles of the intervening period are represented in the rest of the church.
The elaborate north transept and portal are in the late Gothic flamboyant style; the choir, the finest part of the interior, is in an earlier Gothic architectural style. Jean Balue, bishop of Évreux in the second half of the 15th century, constructed the octagonal central tower, with its elegant spire. In August 1465, King Louis XI granted Bishop Balue a subsidy from the gabelle to allow him to resume work on the restoration of the cathedral, which had begun under the patronage of Charles VII but which had ceased from lack of funds. To Balue is also due the Lady chapel, which is remarkable for its finely preserved stained glass. Two rose windows in the transepts and the carved wooden screens of the side chapels are masterpieces of 16th-century workmanship. The windows also picture important figures of the time. For example, the Virgin Mary, patron saints, powerful Norman figures, and influential royal figures. Two styles of these windows incorporate different meanings that are very influential. The stained windows that are more elegant and perfectly modeled embody the contemporary paintings that are showcased in Paris. While the more flat, decorative, and detailed windows embody the monuments of the 14th-century Norman glass paintings.
The bishop's palace, a building of the 15th century, adjoins the south side of the cathedral.
A thorough restoration was completed in 1896.
The stained glass windows were destroyed during World War II but were restored by Jean-Jacques Grüber in 1953. The spire, called "Clocher d’Argent", rises to a height of 78m after its reconstruction after being bombed during the Second World War. A wooden octagonal belfry and spire surmounting the south-west tower was not restored and is missing.
The organ
The new organ was built in 2006 by the Atelier Quoirin of Saint-Didier, organ builders, and contains around 4000 pipes. The inaugural concerts have been given by famous organists, such as Thierry Escaich, Pierre Pincemaille or André Isoir.
Design
This building is a 7-bay aisled nave that faces the west with twin towers in a post-medieval style. The plan is in a cross-style layout with a northern transept arm in a Gothic style with vaulted spaces at each end, one to the west and one to the south. Next to the transept arm, is a trapezoidal shape followed by three bays that protrude out that include aisles and chapels. When it comes to the interior, there is only one entrance to the building. Looking inside, there are semicircular arches in the Norman style, except for the moldings. There are oak screens that section off the chapels located in the cathedral. The Virgin Chapel is the biggest one of the other chapels in the cathedral, with its dimensions equaling the size of other chapels in France at the time. The nave in the cathedral has three stories, which each has specific design elements. The main level has columns that separate the bays, and the level has a rib-vaulted ceiling. The second level is a triforium where the organ resides and has interlaced arches. Some of the bays on this floor have cusped arches, which were designed by Gauthier de Varinfroy. Clerestory windows can be seen on this level with "Parisian" tracery and above, rib vaults. Later, the rib vaults were causing problems which Louis XI rebuilt under his supervision.
Gallery
See also
History of medieval Arabic and Western European domes
References
Sources
Catholic Hierarchy: Evreux
Photos of Evreux Cathedral
External links
High-resolution 360° Panorama and Images of Évreux Cathedral | Art Atlas
Churches in Eure
Roman Catholic cathedrals in France
|
```c++
#include "voxel_instance_library_scene_item.h"
namespace zylann::voxel {
void VoxelInstanceLibrarySceneItem::set_scene(Ref<PackedScene> scene) {
if (scene != _scene) {
_scene = scene;
notify_listeners(IInstanceLibraryItemListener::CHANGE_SCENE);
}
}
Ref<PackedScene> VoxelInstanceLibrarySceneItem::get_scene() const {
return _scene;
}
void VoxelInstanceLibrarySceneItem::_bind_methods() {
ClassDB::bind_method(D_METHOD("set_scene", "scene"), &VoxelInstanceLibrarySceneItem::set_scene);
ClassDB::bind_method(D_METHOD("get_scene"), &VoxelInstanceLibrarySceneItem::get_scene);
ADD_PROPERTY(
PropertyInfo(Variant::OBJECT, "scene", PROPERTY_HINT_RESOURCE_TYPE, PackedScene::get_class_static()),
"set_scene",
"get_scene"
);
}
} // namespace zylann::voxel
```
|
Peter Dews (26 September 1929, Wakefield, Yorkshire, England – 25 August 1997) was an English stage director.
Born and educated in Wakefield, Yorkshire he then took an M.A. at University College, Oxford. After two years teaching history he joined the BBC, in Birmingham, working first in radio (it is thought that he was the director of the episode of The Archers which featured the death of Grace Archer in a fire, a spoiler for the opening of independent television) and then television, as a director. He won the BAFTA 'Best Director' Award in 1960 for An Age of Kings, a television adaptation of Shakespeare's history plays. He subsequently directed Shakespeare's Roman plays in the series The Spread of the Eagle.
After a period of freelance theatre work he joined the Birmingham Repertory Theatre as Artistic Director in the autumn of 1965, in its original building - the first purpose built repertory theatre in the UK - and remained in that post until the company moved to the new venue in 1971, leaving in 1972, his last production there being the double-bill of Sophocles Oedipus the King and Sheridan's The Critic with Derek Jacobi in both plays' leading roles. Previously his productions of Shakespeare's As You Like It and Peter Luke's Hadrian VII had transferred from the old Birmingham Rep to London's West End, the latter going on to New York gaining Dews a Tony Award for its direction. Other notable productions at the Rep included Hamlet, with Richard Chamberlain in 1969, Quick, Quick Slow (1969) a musical by Monty Norman and Julian More, based on a play by David Turner, who also scripted the musical, and The Sorrows of Frederick, an epic play about Frederick the Great by Romulus Linney, in 1970.
At the Chichester Festival Theatre he guest-directed, amongst other productions, Antony and Cleopatra with Sir John Clements and Margaret Leighton, and the original production of Robert Bolt's Vivat! Vivat Regina! which transferred to London's West End and Broadway. Dews succeeded Keith Michell as the fourth artistic director of the Chichester Festival Theatre in 1978 and directed three Festival seasons. One notable production during this period was Julius Caesar in Puritan costume suggesting the plotting of the Gunpowder Plot. He also directed he original production of Royce Ryton's Crown Matrimonial, about the 1936 Abdication crisis, in the West End, with Wendy Hiller as Queen Mary. He also directed productions in the USA, Canada, South Africa, Israel, Malta, Éire and Hong Kong, in the UK he also directed at Nottingham Playhouse (A Midsummer Night's Dream), Edinburgh Lyceum Theatre (Bertolt Brecht's Galileo, which he directed again at Birmingham) and Greenwich Theatre (Inferno by Ian Curteis).
External links
1933 births
1997 deaths
Alumni of University College, Oxford
English theatre directors
Tony Award winners
|
```smalltalk
#if !__WATCHOS__ && !MONOMAC
using System;
using System.Drawing;
using Foundation;
using UIKit;
using NUnit.Framework;
namespace MonoTouchFixtures.UIKit {
[TestFixture]
[Preserve (AllMembers = true)]
public class DictationPhraseTest {
[Test]
public void Defaults ()
{
using (UIDictationPhrase dp = new UIDictationPhrase ()) {
Assert.Null (dp.AlternativeInterpretations, "AlternativeInterpretations");
Assert.Null (dp.Text, "Text");
}
}
}
}
#endif // !__WATCHOS__
```
|
```yaml
apiVersion: monitoring.coreos.com/v1
kind: ServiceMonitor
metadata:
labels:
app.kubernetes.io/name: coredns
app.kubernetes.io/part-of: kube-prometheus
name: coredns
namespace: monitoring
spec:
endpoints:
- bearerTokenFile: /var/run/secrets/kubernetes.io/serviceaccount/token
interval: 15s
metricRelabelings:
- action: drop
regex: coredns_cache_misses_total
sourceLabels:
- __name__
port: metrics
jobLabel: app.kubernetes.io/name
namespaceSelector:
matchNames:
- kube-system
selector:
matchLabels:
k8s-app: kube-dns
```
|
Pandeism (or pan-deism), a theological doctrine which combines aspects of pantheism into deism, and holds that the creator deity became the universe and ceased to exist as a separate and conscious entity, has been noted by various authors to encompass many religious beliefs found in Asia, with examples primarily being drawn from India and China.
Pandeism in China
Physicist and philosopher Max Bernhard Weinstein in his 1910 work Welt- und Lebensanschauungen, Hervorgegangen aus Religion, Philosophie und Naturerkenntnis ("World and Life Views, Emerging From Religion, Philosophy and Perception of Nature"), presented the broadest and most far-reaching examination of pandeism written up to that point. Weinstein found varieties of pandeism in the religious views held in China, especially with respect to Taoism as expressed by Lao-Tze.
Pandeism (in Chinese, 泛自然神论) was described by Wen Chi, in a Peking University lecture, as embodying "a major feature of Chinese philosophical thought," in that "there is a harmony between man and the divine, and they are equal." Zhang Dao Kui (张道葵) of the China Three Gorges University proposed that the art of China's Three Gorges area is influenced by "a representation of the romantic essence that is created when integrating rugged simplicity with the natural beauty spoken about by pandeism." Literary critic Wang Junkang (王俊康) has written that, in Chinese folk religion as conveyed in the early novels of noted folk writer Ye Mei (叶梅), "the romantic spirit of Pandeism can be seen everywhere." Wang Junkang additionally writes of Ye Mei's descriptions of "the worship of reproduction under Pandeism, as demonstrated in romantic songs sung by village people to show the strong impulse of vitality and humanity and the beauty of wildness." It has been noted that author Shen Congwen has attributed a kind of hysteria that "afflicts those young girls who commit suicide by jumping into caves-"luodong" 落洞" to "the repressive local military culture that imposes strict sexual codes on women and to the influence of pan-deism among Miao people," since "for a nymphomaniac, jumping into a cave leads to the ultimate union with the god of the cave" (the cave being a metaphor for death itself).
Pandeism in India
In 1833, religionist Godfrey Higgins theorized in his Anacalypsis that "Pandeism was a doctrine, which had been received both by Buddhists and Brahmins." In 1896, historian Gustavo Uzielli described the world's population as influenced "by a superhuman idealism in Christianity, by an anti-human nihilism in Buddhism, and by an incipient but growing pandeism in Indian Brahmanism." But the following year, the Reverend Henry Grattan Guinness wrote critically that in India, "God is everything, and everything is God, and, therefore, everything may be adored. ... Her pan-deism is a pandemonium." Likewise, twenty years earlier, in 1877, Peruvian scholar and historian Carlos Wiesse Portocarrero had written in an essay titled Philosophical Systems of India that in that country, "Metaphysics is pandeistic and degenerates into idealism."
German physicist-philosopher Max Bernhard Weinstein also found Pandeism to be prevalent in India, especially in the Hindu Bhagavad Gita. In 2014, German political philosopher Jürgen Hartmann observed that Hindu pandeism (along with vegetarianism) has contributed to friction with monotheistic Islam. In 2019, Swiss thinker James B. Glattfelder wrote that "in Hinduism, the notion of lila is akin to the concept of pandeism". Within non-dualist philosophical schools of Indian philosophy, Lila is a way of describing all reality, including the cosmos, as the outcome of creative play by the divine absolute (Brahman). In the dualistic schools of Vaishnavism, Lila refers to the activities of God and his devotee, as well as the macrocosmic actions of the manifest universe, as seen in the Vaishnava scripture Srimad Bhagavatam, verse 3.26.4:
Pandeism elsewhere in Asia
Weinstein similarly found the views of 17th century Japanese Neo-Confucian philosopher Yamazaki Ansai, who espoused a cosmology of universal mutual interconnectedness, to be especially consonant with pandeism. Because cosmologically everything was interconnected, Ansai believed that the actions of an individual (in a similar manner to modern chaos theory) affect the entire universe. He stressed the Confucian concept of Great Learning, in which a person's actions (the center of a series of concentric circles) extend outward toward the family, society, and finally to the cosmos.
Charles Anselm Bolton, a former Catholic priest who left the Catholic Church to teach Reformation doctrines, alluded to Pandeism in Asia in a 1963 article, Beyond the Ecumenical: Pan-deism?, published in Christianity Today, an Evangelical Christian magazine founded by the Reverend Billy Graham. In the article, Bolton addressed the role of Asia in the relationship between Christianity and pandeism, contending that the Catholic Church intended to use pandeism as a sort of umbrella belief system under which to bring religions of Asia toward Catholicism. Bolton notes that "To those familiar with the history of Roman Catholic missions in recent centuries, the idea of fraternization with oriental religions is not completely new," and that "to unite with Hindus and Buddhists, Christians should explore the hidden reality—the “ultimate reality,” the infinite, the absolute, the everlasting, the all-pervading spirit that marks the religious experience of the Orient."
See also
Lila (Hinduism)
Tat Tvam Asi
Notes
External links
Pandeism in Hinduism by Robert G. Brown (excerpt from A Theorem Concerning God)
Pandeism in Buddhism by Robert G. Brown (excerpt from A Theorem Concerning God)
Pandeism in Bahá'i by Robert G. Brown (excerpt from A Theorem Concerning God)
Deism
Pantheism
Religion in Asia
|
```javascript
Abbreviate commands in npm
Deprecate npm packages
Combining script commands in npm
List binaries for scripting in npm
devDependencies in `npm`
```
|
A lumped parameter cardiovascular model is a zero-dimensional mathematical model used to describe the hemodynamics of the cardiovascular system. Given a set of parameters that have a physical meaning (e.g. resistances to blood flow), it allows to study the changes in blood pressures or flow rates throughout the cardiovascular system. Modifying the parameters, it is possible to study the effects of a specific disease. For example, arterial hypertension is modeled increasing the arterial resistances of the model.
The lumped parameter model is used to study the hemodynamics of a three-dimensional space (the cardiovascular system) by means of a zero-dimensional space that exploits the analogy between pipes and electrical circuits. The reduction from three to zero dimensions is performed by splitting the cardiovascular system into different compartments, each of them representing a specific component of the system, e.g. right atrium or systemic arteries. Each compartment is made up of simple circuital components, like resistances or capacitors, while the blood flux behaves like the current flowing through the circuit according to Kirchoff's laws, under the action of the blood pressure (voltage drop).
The lumped parameter model consists in a system of ordinary differential equations that describes the evolution in time of the volumes of the heart chambers, and the blood pressures and fluxes through the blood vessels.
Model description
The lumped parameter model consists in a system of ordinary differential equations that adhere to the principles of conservation of mass and momentum. The model is obtained exploiting the electrical analogy where the current represents the blood flow, the voltage represents the pressure difference, the electric resistance plays the role of the vascular resistance (determined by the section and the length of the blood vessel), the capacitance plays the role of the vascular compliance (the ability of the vessel to distend and increase volume with increasing transmural pressure, that is the difference in pressure between two sides of a vessel wall) and the inductance represents the blood inertia. Each heart chamber is modeled by means of the elastances that describe the contractility of the cardiac muscle and the unloaded volume, that is the blood volume contained in the chamber at zero-pressure. The valves are modeled as diodes. The parameter of the model are the resistances, the capacitances, the inductances and the elastances. The unknowns of the system are the blood volumes inside each heart chamber, the blood pressures and fluxes inside each compartment of the circulation. The system of ordinary differential equations is solved by means of a numerical method for temporal discretization, e.g., a Runge-Kutta method.
The cardiovascular system is split into different compartments:
the four heart chambers: left and right atrium and left and right ventricles;
the systemic circulation that can be split into arteries, veins and, if needed, in other compartments accounting for different blood vessels;
the pulmonary circulation that can be split into arteries, veins and, if needed, in other compartments accounting for different blood vessels.
Downstream of the left atrium and ventricle and right atrium and ventricle there are the four cardiac valves: mitral, aortic, tricuspid and pulmonary valves, respectively.
The splitting of the pulmonary and systemic circulation is not fixed, for example, if the interest of the study is in systemic capillaries, the compartment accounting for the systemic capillaries can be added to the lumped parameter model. Each compartment is described by a Windkessel circuit with the number of elements depending on the specific compartment. The ordinary differential equations of the model are derived from the Windkessel circuits and the Kirchoff's laws.
In what follows the focus will be on a specific lumped parameter model. The compartments considered are the four heart chambers, the systemic and pulmonary arteries and veins.
Heart chambers equations
The parameters related to the four heart chambers are the passive and active elastances and (where the subscripts vary among and if the elastances refer to the right atrium or ventricle or the left atrium or ventricle, respectively) and the unloaded volumes . The dynamics of the heart chambers are described by the time-dependent elastance:
where is a periodic (with period of an heartbeat) time dependent function ranging from to that accounts for the activation phases of the heart during a heartbeat. From the above equation, the passive elastance represents the minimum elastance of the heart chamber, whereas the sum of and the maximum elastance of it. The time-dependent elastance allows the computation of the pressure inside a specific heart chamber as follows:
where is the volume of blood contained in the heart chamber and the volumes for each chamber are the solutions to the following ordinary differential equations that account for inward and outward blood fluxes associated with the heart chamber:
where and are the fluxes through the mitral, aortic, tricuspid and pulmonary valves respectively and and are the fluxes through the pulmonary and systemic veins, respectively.
Valves equations
The valves are modeled as diodes and the blood fluxes across the valves depend on the pressure jumps between the upstream and downstream compartment:
where the pressure inside each heart chamber is defined in the previous section, and are the time-dependent pressures inside the systemic and pulmonary artery compartment and is the flux across the valve depending on the pressure jump:
where and are the resistances of the valves when they are open and closed respectively.
Circulation compartments equations
Each compartment of the blood vessels is characterized by a combination of resistances, capacitances and inductances. For example, the arterial systemic circulation can be described by three parameters and that represent the arterial systemic resistance, capacitance and inductance. The ordinary differential equations that describes the systemic arterial circulation are:
where is the blood flux across the systemic arterial compartment and is the pressure inside the veins compartment.
Analogous equations with similar notation hold for the other compartments describing the blood circulation.
Ordinary differential equation system
Assembling the equations described above the following system is obtained: it holds
with the final time. The first two equations are related to the volumes in the left atrium and ventricles respectively. The equations from the third to the sixth are related to the pressures, and fluxes of the systemic arterial and venous systems. The last equations are related to the right heart and the pulmonary circulation in an analogous way. The system is completed with initial conditions for each of the unknowns.
From a mathematical point of view, the well-posedness of the problem is a consequence of the Cauchy–Lipschitz theorem, so its solution exists and it is unique. The solution of the system is approximated by means of a numerical method. The numerical simulation has to be computed for more than heartbeats (the final time depends on the number of heartbeats and the heart rate) to approach the limit cycle of the dynamical system, so that the solution behaves in a similar way to a periodic function emulating the periodicity of the cardiac cycle.
Further developments
The model described above is a specific lumped parameter model. It can be easily modified adding or removing compartments or circuit components inside any compartment as needed. The equations that govern the new or the modified compartments are the Kirchoff's laws as before.
The cardiovascular lumped parameter models can be enhanced adding a lumped parameter model for the respiratory system. As for the cardiovascular system, the respiratory system is split into different compartments modeling, for example, the larynx, the pharinx or the trachea. Moreover, the cardiopulmonary model can be combined with a model for blood oxygenation to study, for example, the levels of blood saturation.
There are several lumped parameter models and the choice of the model depends on the purpose of the work or the research. Complex models can describe different dynamics, but the increase in complexity entails a larger computational cost to solve the system of differential equations.
Some of the 0-D compartments of the lumped parameter model could be substituted by -dimensional components () to describe geometrically a specific component of the cardiovascular system (e.g., the 0-D compartment of the left ventricle can be substituted by a 3-D representation of it). As a consequence, the system of equations will include also partial differential equations to describe the dimensional components and it will entail a larger computational cost to be numerically solved.
See also
Blood vessel
Discretization
Finite element method
Heart
Lumped-element model
Model order reduction
References
Further reading
Cardiovascular system
Ordinary differential equations
|
The 2013 Melbourne Storm season was the 16th in the club's history. They competed in the 2013 NRL season. They were coached by Craig Bellamy and captained by Cameron Smith. They had previously won the NRL's 2012 Telstra Premiership therefore started the season as reigning premiers.
Seven straight wins to start the season extended the club's winning streak to 15 games dating back to the previous campaign. The Origin period proved difficult to negotiate however with team unable to come up with some crucial wins at the business end of the season, eventually finishing in third place. Two finals losses to the Rabbitohs and Knights prematurely ended the season, as Storm did not make the Preliminary final stage for just the second time in eight years. The Storm attack was the shining light of the season, producing 98 tries to be ranked second in the competition. The team also had the best home record of any side in the NRL, losing just the one game at AAMI Park during the season. Cooper Cronk was rewarded for several seasons of brilliance, claiming his first Dally Medal Play of the Year honour. Off the field Storm experienced a change at the helm with Mark Evans replacing Ron Gauci as CEO midway through the season.
Season summary
11 February – Craig Bellamy signed a contract that will see him remain as coach of the Storm until the end of 2016. The Storm also depart for England to compete in the World Club Challenge.
22 February – The Storm won the 2013 World Club Challenge 18–14 against Leeds Rhinos to be crowned World Champions for 2013.
Round 1 – The Storm began the season with a win over St George Illawarra in hot conditions.
Round 2 – The Storm's win over North Queensland also marked their 10th consecutive win, with the streak beginning in Round 22 of the 2012 season and extending through the finals.
Round 3 – Ryan Hoffman played his 200th NRL Game.
Round 4 – The Melbourne Storm played its 400th game. The Storm also won its 12th consecutive game, thus equalling its all-time record achieved in the 2011 NRL season.
Round 5 – The Storm won their 13th consecutive game, breaking their all-time club record.
Round 6 – The Storm defeated the South Sydney Rabbitohs to remain the only undefeated side in the NRL in 2013.
19 April – Gareth Widdop announces he will leave the Storm for the St George Illawarra Dragons at the end of the season.
19–21 April – The Storm provide 9 players to the three representative games over this weekend.
Round 7 – The Storms winning streak continued to 15 games with a win over the New Zealand Warriors on ANZAC Day.
1 May – The Storm re-sign Will Chambers to a contract that will see him remain with the club until 2017.
Round 8 – Melbourne suffers its first loss of the season ending its club record winning streak at 15 games. The Storm are one of only seven teams in the history of the NSWRL/ARL/NRL to have achieved this.
21 May – A syndicate led by Bart Campbell take over the club as News Corp Australia divest their ownership of the companies holding the NRL franchise.
Round 10 – Melbourne Storm and Manly Sea Eagles Draw 10 all, the first draw of the NRL season.
Round 11 – Jordan Mclean made his debut as the 150th player for the Storm. Cameron Smith scored his 1400th point for the club.
Round 13 – Cameron Smith played his 250th NRL game and Justin O'Neill played his 50th.
Round 15 – Playing without Smith, Slater, Cronk and Hoffman the Storm lose 18–12 to Gold Coast. Ben Hampton scored 2 tries on debut and Gareth Widdop suffered a dislocated hip, ending his season.
Rounds 15–20 – The Storm encounter a poor run of form not helped by the State of Origin period where they gave up 4 first choice players to lose 4 out of five games.
Round 21 – The Storm returned to form with a massive 64-point win over the Canberra Raiders. The win equalled their all-time greatest winning margin record set in 2001 against Wests Tigers. During the Game, Billy Slater also scored his 150th try.
Round 22 – Brett Finch plays his 50th Game for the Melbourne Storm in a 26–8 win over South Sydney.
Round 23 – Bryan Norrie plays his 150th NRL Game.
Round 24 – The Storm defeat the Parramatta Eels 64 – 4 in their biggest ever win over the Eels. Kevin Proctor also plays his 100th game.
Round 26 – The Storm win their final game of the regular season in Golden point extra time against Gold Coast Titans. Cameron Smith also kicks his 1500th point in the match.
Finals Series – The Storms season ended with two consecutive losses in the Finals series to South Sydney and then Newcastle.
Milestone games
Jersey
In 2013 the Storm jerseys were again made by Kooga. They created a New Jersey for 2013 which featured more navy blue and a more prominent and deeper V that integrated the sponsor's (Crown Casino) logo into the design better, the lightning bolts are also now purple for the first time. Colours yellow and white were removed and reduced respectively so that the jersey is essentially half navy blue and half purple. The away jersey is a white version of the home jersey.
Special Jerseys
For Round 10, the Storm released a special jersey for the "Women of League" round, it was worn on 20 May against Manly Sea Eagles. The jersey consisted of navy blue and pink horizontal hoops.
For Round 13 the Storm wore a jersey to promote the Superman movie Man of Steel. The jerseys design is similar to that of the costume worn in the movie with the red S logo on the front.
For Round 14 the Storm wore their 2013 heritage jersey, which was a replica of their original 1998 jersey.
For the Round 17 game against the Brisbane Broncos they wore their "Big Battle" jersey.
Statistics
Statistics Source: Table current as at the end of 2013 season.
Most Points in a Game: 20
Cameron Smith – 10 Goals vs Canberra Raiders (4 August)
Cameron Smith – 10 Goals vs Parramatta Eels (25 August)
Most tries in a Game: 3
Billy Slater vs Brisbane (29 March)
Mahe Fonua vs Canberra (4 August)
Sisa Waqa vs Canberra (4 August)
Billy Slater vs Parramatta (25 August)
Highest score in a game: 68 points
vs Canberra Raiders (4 August)
Greatest winning margin: 64 points
vs Canberra Raiders (4 August)
Fixtures
Pre Season
Regular season
Finals
Source NRL.com:
Ladder
2013 Coaches
Craig Bellamy -Head Coach
Kevin Walters – Assistant Coach
David Kidwell -Assistant Coach
Anthony Seibold -U/20 Coach
Alex Corvo -Strength and Conditioning
Tony Ayoub -Head Physiotherapist
2013 Squad
As of 16 July 2013.
2013 player movement
2013 Squad Signings
2013 Squad Departures
Representative honours
The following players have played a representative match in 2013. (C) = Captain
Awards
Trophy Cabinet
2013 World Club Challenge Trophy
Melbourne Storm Awards Night
Held at Peninsula Docklands on Friday 11 October 2013.
Melbourne Storm Player of the Year: Cameron Smith
Melbourne Storm Rookie of the Year: Tohu Harris
Sukuki Members' Player of Year: Cameron Smith
Melbourne Storm Most Improved: Kenny Bromwich
Melbourne Storm Best Back: Cooper Cronk
Melbourne Storm Best Forward: Jesse Bromwich
Feeder Club Player of the Year:
Darren Bell U20s Player of Year: Pride Petterson-Robati
Greg Brentnall Young Achiever’s Award: Brandon Manase
U20s Best Back:
U20s Best Forward:
Mick Moore Club Person of the Year:
Life Member Inductee: Ryan Hoffman
Best try: Will Chambers
Dally M Awards Night
The NRL Dally M Awards were held on 1 October 2013.
Dally M Medal: Cooper Cronk
Dally M Captain of the Year: Cameron Smith
Dally M Representative Player of the Year: Cameron Smith
Dally M Hooker of the Year: Cameron Smith
Dally M Halfback of the Year: Cooper Cronk
RLPA Awards Night
RLPA Australia Representative Player of the Year: Cameron Smith
NRL Academic Player of the Year: Bryan Norrie
Additional Awards
World Club Challenge Medal: Cooper Cronk
QRL Ron McAuliffe Medal: Cameron Smith
Petero Civoniceva Medal; Cody Walker
Notes
References
Melbourne Storm seasons
Melbourne Storm season
|
```go
package cli
import (
"encoding/json"
"errors"
"fmt"
"os"
"time"
"github.com/urfave/cli"
)
var statsCmd = cli.Command{
Name: "stats",
Usage: "view stats",
Action: stats,
Flags: []cli.Flag{
cli.Int64Flag{
Name: "site-id",
Usage: "ID of the site to retrieve stats for",
},
cli.StringFlag{
Name: "start-date",
Usage: "start date, expects a date in format 2006-01-02",
},
cli.StringFlag{
Name: "end-date",
Usage: "end date, expects a date in format 2006-01-02",
},
cli.BoolFlag{
Name: "json",
Usage: "get a json response",
},
},
}
func stats(c *cli.Context) error {
start, _ := time.Parse("2006-01-02", c.String("start-date"))
if start.IsZero() {
return errors.New("Invalid argument: supply a valid --start-date")
}
end, _ := time.Parse("2006-01-02", c.String("end-date"))
if end.IsZero() {
return errors.New("Invalid argument: supply a valid --end-date")
}
// TODO: add method for getting total sum of pageviews across sites
siteID := c.Int64("site-id")
result, err := app.database.GetAggregatedSiteStats(siteID, start, end)
if err != nil {
return err
}
if c.Bool("json") {
return json.NewEncoder(os.Stdout).Encode(result)
}
fmt.Printf("%s - %s\n", start.Format("Jan 01, 2006"), end.Format("Jan 01, 2006"))
fmt.Printf("===========================\n")
fmt.Printf("Visitors: \t%d\n", result.Visitors)
fmt.Printf("Pageviews: \t%d\n", result.Pageviews)
fmt.Printf("Sessions: \t%d\n", result.Sessions)
fmt.Printf("Avg duration: \t%s\n", result.FormattedDuration())
fmt.Printf("Bounce rate: \t%.0f%%\n", result.BounceRate*100.00)
return nil
}
```
|
```python
#
# Properties
#
_PROPERTIES__SCHEMA = """
version: 2
models:
- name: model_a
columns:
- name: id
tags: [column_level_tag]
data_tests:
- unique
- name: incremental_ignore
columns:
- name: id
tags: [column_level_tag]
data_tests:
- unique
- name: incremental_ignore_target
columns:
- name: id
tags: [column_level_tag]
data_tests:
- unique
- name: incremental_append_new_columns
columns:
- name: id
tags: [column_level_tag]
data_tests:
- unique
- name: incremental_append_new_columns_target
columns:
- name: id
tags: [column_level_tag]
data_tests:
- unique
- name: incremental_sync_all_columns
columns:
- name: id
tags: [column_level_tag]
data_tests:
- unique
- name: incremental_sync_all_columns_target
columns:
- name: id
tags: [column_leveL_tag]
data_tests:
- unique
"""
#
# Models
#
_MODELS__INCREMENTAL_SYNC_REMOVE_ONLY = """
{{
config(
materialized='incremental',
unique_key='id',
on_schema_change='sync_all_columns'
)
}}
WITH source_data AS (SELECT * FROM {{ ref('model_a') }} )
{% set string_type = 'varchar(10)' %}
{% if is_incremental() %}
SELECT id,
cast(field1 as {{string_type}}) as field1
FROM source_data WHERE id NOT IN (SELECT id from {{ this }} )
{% else %}
select id,
cast(field1 as {{string_type}}) as field1,
cast(field2 as {{string_type}}) as field2
from source_data where id <= 3
{% endif %}
"""
_MODELS__INCREMENTAL_IGNORE = """
{{
config(
materialized='incremental',
unique_key='id',
on_schema_change='ignore'
)
}}
WITH source_data AS (SELECT * FROM {{ ref('model_a') }} )
{% if is_incremental() %}
SELECT id, field1, field2, field3, field4 FROM source_data WHERE id NOT IN (SELECT id from {{ this }} )
{% else %}
SELECT id, field1, field2 FROM source_data LIMIT 3
{% endif %}
"""
_MODELS__INCREMENTAL_SYNC_REMOVE_ONLY_TARGET = """
{{
config(materialized='table')
}}
with source_data as (
select * from {{ ref('model_a') }}
)
{% set string_type = 'varchar(10)' %}
select id
,cast(field1 as {{string_type}}) as field1
from source_data
order by id
"""
_MODELS__INCREMENTAL_IGNORE_TARGET = """
{{
config(materialized='table')
}}
with source_data as (
select * from {{ ref('model_a') }}
)
select id
,field1
,field2
from source_data
"""
_MODELS__INCREMENTAL_FAIL = """
{{
config(
materialized='incremental',
unique_key='id',
on_schema_change='fail'
)
}}
WITH source_data AS (SELECT * FROM {{ ref('model_a') }} )
{% if is_incremental() %}
SELECT id, field1, field2 FROM source_data
{% else %}
SELECT id, field1, field3 FROm source_data
{% endif %}
"""
_MODELS__INCREMENTAL_SYNC_ALL_COLUMNS = """
{{
config(
materialized='incremental',
unique_key='id',
on_schema_change='sync_all_columns'
)
}}
WITH source_data AS (SELECT * FROM {{ ref('model_a') }} )
{% set string_type = 'varchar(10)' %}
{% if is_incremental() %}
SELECT id,
cast(field1 as {{string_type}}) as field1,
cast(field3 as {{string_type}}) as field3, -- to validate new fields
cast(field4 as {{string_type}}) AS field4 -- to validate new fields
FROM source_data WHERE id NOT IN (SELECT id from {{ this }} )
{% else %}
select id,
cast(field1 as {{string_type}}) as field1,
cast(field2 as {{string_type}}) as field2
from source_data where id <= 3
{% endif %}
"""
_MODELS__INCREMENTAL_APPEND_NEW_COLUMNS_REMOVE_ONE = """
{{
config(
materialized='incremental',
unique_key='id',
on_schema_change='append_new_columns'
)
}}
{% set string_type = 'varchar(10)' %}
WITH source_data AS (SELECT * FROM {{ ref('model_a') }} )
{% if is_incremental() %}
SELECT id,
cast(field1 as {{string_type}}) as field1,
cast(field3 as {{string_type}}) as field3,
cast(field4 as {{string_type}}) as field4
FROM source_data WHERE id NOT IN (SELECT id from {{ this }} )
{% else %}
SELECT id,
cast(field1 as {{string_type}}) as field1,
cast(field2 as {{string_type}}) as field2
FROM source_data where id <= 3
{% endif %}
"""
_MODELS__A = """
{{
config(materialized='table')
}}
with source_data as (
select 1 as id, 'aaa' as field1, 'bbb' as field2, 111 as field3, 'TTT' as field4
union all select 2 as id, 'ccc' as field1, 'ddd' as field2, 222 as field3, 'UUU' as field4
union all select 3 as id, 'eee' as field1, 'fff' as field2, 333 as field3, 'VVV' as field4
union all select 4 as id, 'ggg' as field1, 'hhh' as field2, 444 as field3, 'WWW' as field4
union all select 5 as id, 'iii' as field1, 'jjj' as field2, 555 as field3, 'XXX' as field4
union all select 6 as id, 'kkk' as field1, 'lll' as field2, 666 as field3, 'YYY' as field4
)
select id
,field1
,field2
,field3
,field4
from source_data
"""
_MODELS__INCREMENTAL_APPEND_NEW_COLUMNS_TARGET = """
{{
config(materialized='table')
}}
{% set string_type = 'varchar(10)' %}
with source_data as (
select * from {{ ref('model_a') }}
)
select id
,cast(field1 as {{string_type}}) as field1
,cast(field2 as {{string_type}}) as field2
,cast(CASE WHEN id <= 3 THEN NULL ELSE field3 END as {{string_type}}) AS field3
,cast(CASE WHEN id <= 3 THEN NULL ELSE field4 END as {{string_type}}) AS field4
from source_data
"""
_MODELS__INCREMENTAL_APPEND_NEW_COLUMNS = """
{{
config(
materialized='incremental',
unique_key='id',
on_schema_change='append_new_columns'
)
}}
{% set string_type = 'varchar(10)' %}
WITH source_data AS (SELECT * FROM {{ ref('model_a') }} )
{% if is_incremental() %}
SELECT id,
cast(field1 as {{string_type}}) as field1,
cast(field2 as {{string_type}}) as field2,
cast(field3 as {{string_type}}) as field3,
cast(field4 as {{string_type}}) as field4
FROM source_data WHERE id NOT IN (SELECT id from {{ this }} )
{% else %}
SELECT id,
cast(field1 as {{string_type}}) as field1,
cast(field2 as {{string_type}}) as field2
FROM source_data where id <= 3
{% endif %}
"""
_MODELS__INCREMENTAL_SYNC_ALL_COLUMNS_TARGET = """
{{
config(materialized='table')
}}
with source_data as (
select * from {{ ref('model_a') }}
)
{% set string_type = 'varchar(10)' %}
select id
,cast(field1 as {{string_type}}) as field1
--,field2
,cast(case when id <= 3 then null else field3 end as {{string_type}}) as field3
,cast(case when id <= 3 then null else field4 end as {{string_type}}) as field4
from source_data
order by id
"""
_MODELS__INCREMENTAL_APPEND_NEW_COLUMNS_REMOVE_ONE_TARGET = """
{{
config(materialized='table')
}}
{% set string_type = 'varchar(10)' %}
with source_data as (
select * from {{ ref('model_a') }}
)
select id,
cast(field1 as {{string_type}}) as field1,
cast(CASE WHEN id > 3 THEN NULL ELSE field2 END as {{string_type}}) AS field2,
cast(CASE WHEN id <= 3 THEN NULL ELSE field3 END as {{string_type}}) AS field3,
cast(CASE WHEN id <= 3 THEN NULL ELSE field4 END as {{string_type}}) AS field4
from source_data
"""
#
# Tests
#
_TESTS__SELECT_FROM_INCREMENTAL_IGNORE = """
select * from {{ ref('incremental_ignore') }} where false
"""
_TESTS__SELECT_FROM_A = """
select * from {{ ref('model_a') }} where false
"""
_TESTS__SELECT_FROM_INCREMENTAL_APPEND_NEW_COLUMNS_TARGET = """
select * from {{ ref('incremental_append_new_columns_target') }} where false
"""
_TESTS__SELECT_FROM_INCREMENTAL_SYNC_ALL_COLUMNS = """
select * from {{ ref('incremental_sync_all_columns') }} where false
"""
_TESTS__SELECT_FROM_INCREMENTAL_SYNC_ALL_COLUMNS_TARGET = """
select * from {{ ref('incremental_sync_all_columns_target') }} where false
"""
_TESTS__SELECT_FROM_INCREMENTAL_IGNORE_TARGET = """
select * from {{ ref('incremental_ignore_target') }} where false
"""
_TESTS__SELECT_FROM_INCREMENTAL_APPEND_NEW_COLUMNS = """
select * from {{ ref('incremental_append_new_columns') }} where false
"""
```
|
```objective-c
/**
******************************************************************************
* @file stm32f30x_gpio.h
* @author MCD Application Team
* @version V1.0.1
* @date 23-October-2012
* @brief This file contains all the functions prototypes for the GPIO
* firmware library.
******************************************************************************
* @attention
*
* <h2><center>© COPYRIGHT 2012 STMicroelectronics</center></h2>
*
*
* 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.
*
******************************************************************************
*/
/* Define to prevent recursive inclusion -------------------------------------*/
#ifndef __STM32F30x_GPIO_H
#define __STM32F30x_GPIO_H
#ifdef __cplusplus
extern "C" {
#endif
/* Includes your_sha256_hash--*/
#include "stm32f30x.h"
/** @addtogroup STM32F30x_StdPeriph_Driver
* @{
*/
/** @addtogroup GPIO
* @{
*/
/* Exported types ------------------------------------------------------------*/
#define IS_GPIO_ALL_PERIPH(PERIPH) (((PERIPH) == GPIOA) || \
((PERIPH) == GPIOB) || \
((PERIPH) == GPIOC) || \
((PERIPH) == GPIOD) || \
((PERIPH) == GPIOE) || \
((PERIPH) == GPIOF))
#define IS_GPIO_LIST_PERIPH(PERIPH) (((PERIPH) == GPIOA) || \
((PERIPH) == GPIOB) || \
((PERIPH) == GPIOD))
/** @defgroup Configuration_Mode_enumeration
* @{
*/
typedef enum
{
GPIO_Mode_IN = 0x00, /*!< GPIO Input Mode */
GPIO_Mode_OUT = 0x01, /*!< GPIO Output Mode */
GPIO_Mode_AF = 0x02, /*!< GPIO Alternate function Mode */
GPIO_Mode_AN = 0x03 /*!< GPIO Analog In/Out Mode */
}GPIOMode_TypeDef;
#define IS_GPIO_MODE(MODE) (((MODE) == GPIO_Mode_IN)|| ((MODE) == GPIO_Mode_OUT) || \
((MODE) == GPIO_Mode_AF)|| ((MODE) == GPIO_Mode_AN))
/**
* @}
*/
/** @defgroup Output_type_enumeration
* @{
*/
typedef enum
{
GPIO_OType_PP = 0x00,
GPIO_OType_OD = 0x01
}GPIOOType_TypeDef;
#define IS_GPIO_OTYPE(OTYPE) (((OTYPE) == GPIO_OType_PP) || ((OTYPE) == GPIO_OType_OD))
/**
* @}
*/
/** @defgroup Output_Maximum_frequency_enumeration
* @{
*/
typedef enum
{
GPIO_Speed_Level_1 = 0x01, /*!< Fast Speed */
GPIO_Speed_Level_2 = 0x02, /*!< Meduim Speed */
GPIO_Speed_Level_3 = 0x03 /*!< High Speed */
}GPIOSpeed_TypeDef;
#define IS_GPIO_SPEED(SPEED) (((SPEED) == GPIO_Speed_Level_1) || ((SPEED) == GPIO_Speed_Level_2) || \
((SPEED) == GPIO_Speed_Level_3))
/**
* @}
*/
/** @defgroup Configuration_Pull-Up_Pull-Down_enumeration
* @{
*/
typedef enum
{
GPIO_PuPd_NOPULL = 0x00,
GPIO_PuPd_UP = 0x01,
GPIO_PuPd_DOWN = 0x02
}GPIOPuPd_TypeDef;
#define IS_GPIO_PUPD(PUPD) (((PUPD) == GPIO_PuPd_NOPULL) || ((PUPD) == GPIO_PuPd_UP) || \
((PUPD) == GPIO_PuPd_DOWN))
/**
* @}
*/
/** @defgroup Bit_SET_and_Bit_RESET_enumeration
* @{
*/
typedef enum
{
Bit_RESET = 0,
Bit_SET
}BitAction;
#define IS_GPIO_BIT_ACTION(ACTION) (((ACTION) == Bit_RESET) || ((ACTION) == Bit_SET))
/**
* @}
*/
/**
* @brief GPIO Init structure definition
*/
typedef struct
{
uint32_t GPIO_Pin; /*!< Specifies the GPIO pins to be configured.
This parameter can be any value of @ref GPIO_pins_define */
GPIOMode_TypeDef GPIO_Mode; /*!< Specifies the operating mode for the selected pins.
This parameter can be a value of @ref GPIOMode_TypeDef */
GPIOSpeed_TypeDef GPIO_Speed; /*!< Specifies the speed for the selected pins.
This parameter can be a value of @ref GPIOSpeed_TypeDef */
GPIOOType_TypeDef GPIO_OType; /*!< Specifies the operating output type for the selected pins.
This parameter can be a value of @ref GPIOOType_TypeDef */
GPIOPuPd_TypeDef GPIO_PuPd; /*!< Specifies the operating Pull-up/Pull down for the selected pins.
This parameter can be a value of @ref GPIOPuPd_TypeDef */
}GPIO_InitTypeDef;
/* Exported constants --------------------------------------------------------*/
/** @defgroup GPIO_Exported_Constants
* @{
*/
/** @defgroup GPIO_pins_define
* @{
*/
#define GPIO_Pin_0 ((uint16_t)0x0001) /*!< Pin 0 selected */
#define GPIO_Pin_1 ((uint16_t)0x0002) /*!< Pin 1 selected */
#define GPIO_Pin_2 ((uint16_t)0x0004) /*!< Pin 2 selected */
#define GPIO_Pin_3 ((uint16_t)0x0008) /*!< Pin 3 selected */
#define GPIO_Pin_4 ((uint16_t)0x0010) /*!< Pin 4 selected */
#define GPIO_Pin_5 ((uint16_t)0x0020) /*!< Pin 5 selected */
#define GPIO_Pin_6 ((uint16_t)0x0040) /*!< Pin 6 selected */
#define GPIO_Pin_7 ((uint16_t)0x0080) /*!< Pin 7 selected */
#define GPIO_Pin_8 ((uint16_t)0x0100) /*!< Pin 8 selected */
#define GPIO_Pin_9 ((uint16_t)0x0200) /*!< Pin 9 selected */
#define GPIO_Pin_10 ((uint16_t)0x0400) /*!< Pin 10 selected */
#define GPIO_Pin_11 ((uint16_t)0x0800) /*!< Pin 11 selected */
#define GPIO_Pin_12 ((uint16_t)0x1000) /*!< Pin 12 selected */
#define GPIO_Pin_13 ((uint16_t)0x2000) /*!< Pin 13 selected */
#define GPIO_Pin_14 ((uint16_t)0x4000) /*!< Pin 14 selected */
#define GPIO_Pin_15 ((uint16_t)0x8000) /*!< Pin 15 selected */
#define GPIO_Pin_All ((uint16_t)0xFFFF) /*!< All pins selected */
#define IS_GPIO_PIN(PIN) ((PIN) != (uint16_t)0x00)
#define IS_GET_GPIO_PIN(PIN) (((PIN) == GPIO_Pin_0) || \
((PIN) == GPIO_Pin_1) || \
((PIN) == GPIO_Pin_2) || \
((PIN) == GPIO_Pin_3) || \
((PIN) == GPIO_Pin_4) || \
((PIN) == GPIO_Pin_5) || \
((PIN) == GPIO_Pin_6) || \
((PIN) == GPIO_Pin_7) || \
((PIN) == GPIO_Pin_8) || \
((PIN) == GPIO_Pin_9) || \
((PIN) == GPIO_Pin_10) || \
((PIN) == GPIO_Pin_11) || \
((PIN) == GPIO_Pin_12) || \
((PIN) == GPIO_Pin_13) || \
((PIN) == GPIO_Pin_14) || \
((PIN) == GPIO_Pin_15))
/**
* @}
*/
/** @defgroup GPIO_Pin_sources
* @{
*/
#define GPIO_PinSource0 ((uint8_t)0x00)
#define GPIO_PinSource1 ((uint8_t)0x01)
#define GPIO_PinSource2 ((uint8_t)0x02)
#define GPIO_PinSource3 ((uint8_t)0x03)
#define GPIO_PinSource4 ((uint8_t)0x04)
#define GPIO_PinSource5 ((uint8_t)0x05)
#define GPIO_PinSource6 ((uint8_t)0x06)
#define GPIO_PinSource7 ((uint8_t)0x07)
#define GPIO_PinSource8 ((uint8_t)0x08)
#define GPIO_PinSource9 ((uint8_t)0x09)
#define GPIO_PinSource10 ((uint8_t)0x0A)
#define GPIO_PinSource11 ((uint8_t)0x0B)
#define GPIO_PinSource12 ((uint8_t)0x0C)
#define GPIO_PinSource13 ((uint8_t)0x0D)
#define GPIO_PinSource14 ((uint8_t)0x0E)
#define GPIO_PinSource15 ((uint8_t)0x0F)
#define IS_GPIO_PIN_SOURCE(PINSOURCE) (((PINSOURCE) == GPIO_PinSource0) || \
((PINSOURCE) == GPIO_PinSource1) || \
((PINSOURCE) == GPIO_PinSource2) || \
((PINSOURCE) == GPIO_PinSource3) || \
((PINSOURCE) == GPIO_PinSource4) || \
((PINSOURCE) == GPIO_PinSource5) || \
((PINSOURCE) == GPIO_PinSource6) || \
((PINSOURCE) == GPIO_PinSource7) || \
((PINSOURCE) == GPIO_PinSource8) || \
((PINSOURCE) == GPIO_PinSource9) || \
((PINSOURCE) == GPIO_PinSource10) || \
((PINSOURCE) == GPIO_PinSource11) || \
((PINSOURCE) == GPIO_PinSource12) || \
((PINSOURCE) == GPIO_PinSource13) || \
((PINSOURCE) == GPIO_PinSource14) || \
((PINSOURCE) == GPIO_PinSource15))
/**
* @}
*/
/** @defgroup GPIO_Alternate_function_selection_define
* @{
*/
/**
* @brief AF 0 selection
*/
#define GPIO_AF_0 ((uint8_t)0x00) /* JTCK-SWCLK, JTDI, JTDO/TRACESW0, JTMS-SWDAT,
MCO, NJTRST, TRACED, TRACECK */
/**
* @brief AF 1 selection
*/
#define GPIO_AF_1 ((uint8_t)0x01) /* OUT, TIM2, TIM15, TIM16, TIM17 */
/**
* @brief AF 2 selection
*/
#define GPIO_AF_2 ((uint8_t)0x02) /* COMP1_OUT, TIM1, TIM2, TIM3, TIM4, TIM8, TIM15 */
/**
* @brief AF 3 selection
*/
#define GPIO_AF_3 ((uint8_t)0x03) /* COMP7_OUT, TIM8, TIM15, Touch */
/**
* @brief AF 4 selection
*/
#define GPIO_AF_4 ((uint8_t)0x04) /* I2C1, I2C2, TIM1, TIM8, TIM16, TIM17 */
/**
* @brief AF 5 selection
*/
#define GPIO_AF_5 ((uint8_t)0x05) /* IR_OUT, I2S2, I2S3, SPI1, SPI2, TIM8, USART4, USART5 */
/**
* @brief AF 6 selection
*/
#define GPIO_AF_6 ((uint8_t)0x06) /* IR_OUT, I2S2, I2S3, SPI2, SPI3, TIM1, TIM8 */
/**
* @brief AF 7 selection
*/
#define GPIO_AF_7 ((uint8_t)0x07) /* AOP2_OUT, CAN, COMP3_OUT, COMP5_OUT, COMP6_OUT,
USART1, USART2, USART3 */
/**
* @brief AF 8 selection
*/
#define GPIO_AF_8 ((uint8_t)0x08) /* COMP1_OUT, COMP2_OUT, COMP3_OUT, COMP4_OUT,
COMP5_OUT, COMP6_OUT */
/**
* @brief AF 9 selection
*/
#define GPIO_AF_9 ((uint8_t)0x09) /* AOP4_OUT, CAN, TIM1, TIM8, TIM15 */
/**
* @brief AF 10 selection
*/
#define GPIO_AF_10 ((uint8_t)0x0A) /* AOP1_OUT, AOP3_OUT, TIM2, TIM3, TIM4, TIM8, TIM17 */
/**
* @brief AF 11 selection
*/
#define GPIO_AF_11 ((uint8_t)0x0B) /* TIM1, TIM8 */
/**
* @brief AF 12 selection
*/
#define GPIO_AF_12 ((uint8_t)0x0E) /* TIM1 */
/**
* @brief AF 14 selection
*/
#define GPIO_AF_14 ((uint8_t)0x0E) /* USBDM, USBDP */
/**
* @brief AF 15 selection
*/
#define GPIO_AF_15 ((uint8_t)0x0F) /* OUT */
#define IS_GPIO_AF(AF) (((AF) == GPIO_AF_0)||((AF) == GPIO_AF_1)||\
((AF) == GPIO_AF_2)||((AF) == GPIO_AF_3)||\
((AF) == GPIO_AF_4)||((AF) == GPIO_AF_5)||\
((AF) == GPIO_AF_6)||((AF) == GPIO_AF_7)||\
((AF) == GPIO_AF_8)||((AF) == GPIO_AF_9)||\
((AF) == GPIO_AF_10)||((AF) == GPIO_AF_11)||\
((AF) == GPIO_AF_14)||((AF) == GPIO_AF_15))
/**
* @}
*/
/** @defgroup GPIO_Speed_Legacy
* @{
*/
#define GPIO_Speed_10MHz GPIO_Speed_Level_1 /*!< Fast Speed:10MHz */
#define GPIO_Speed_2MHz GPIO_Speed_Level_2 /*!< Medium Speed:2MHz */
#define GPIO_Speed_50MHz GPIO_Speed_Level_3 /*!< High Speed:50MHz */
/**
* @}
*/
/**
* @}
*/
/* Exported macro ------------------------------------------------------------*/
/* Exported functions ------------------------------------------------------- */
/* Function used to set the GPIO configuration to the default reset state *****/
void GPIO_DeInit(GPIO_TypeDef* GPIOx);
/* Initialization and Configuration functions *********************************/
void GPIO_Init(GPIO_TypeDef* GPIOx, GPIO_InitTypeDef* GPIO_InitStruct);
void GPIO_StructInit(GPIO_InitTypeDef* GPIO_InitStruct);
void GPIO_PinLockConfig(GPIO_TypeDef* GPIOx, uint16_t GPIO_Pin);
/* GPIO Read and Write functions **********************************************/
uint8_t GPIO_ReadInputDataBit(GPIO_TypeDef* GPIOx, uint16_t GPIO_Pin);
uint16_t GPIO_ReadInputData(GPIO_TypeDef* GPIOx);
uint8_t GPIO_ReadOutputDataBit(GPIO_TypeDef* GPIOx, uint16_t GPIO_Pin);
uint16_t GPIO_ReadOutputData(GPIO_TypeDef* GPIOx);
void GPIO_SetBits(GPIO_TypeDef* GPIOx, uint16_t GPIO_Pin);
void GPIO_ResetBits(GPIO_TypeDef* GPIOx, uint16_t GPIO_Pin);
void GPIO_WriteBit(GPIO_TypeDef* GPIOx, uint16_t GPIO_Pin, BitAction BitVal);
void GPIO_Write(GPIO_TypeDef* GPIOx, uint16_t PortVal);
/* GPIO Alternate functions configuration functions ***************************/
void GPIO_PinAFConfig(GPIO_TypeDef* GPIOx, uint16_t GPIO_PinSource, uint8_t GPIO_AF);
#ifdef __cplusplus
}
#endif
#endif /* __STM32F30x_GPIO_H */
/**
* @}
*/
/**
* @}
*/
/************************ (C) COPYRIGHT STMicroelectronics *****END OF FILE****/
```
|
, often lengthened to Shibusashirazu Orchestra, is a popular Japanese jazz orchestra. The group was formed in 1989 by bassist Daisuke Fuwa and since then many of Japan's jazz musicians, Butoh dancers and other performance artists have passed through the orchestra.
The majority of the group's original work is composed and arranged by Daisuke Fuwa. Their style stems from the jazz movement of the 60s, with the influence of 80s punk and No Wave. Although featuring extended free improvisation, there is also an element of rock music that makes the orchestra more accessible to a wider audience than a lot of other free jazz.
In 2007 they signed to Avex Trax, one of Japan's leading labels for commercial pop and dance music.
The orchestra performed four times in a row at the annual Fuji Rock Festival from 2000 and have performed at the Glastonbury Festival in 2002 and 2016. They tour Europe frequently although are not well known in the United States.
Discography
Dettaramen (Nutmeg, 1993)
Shibusamichi (Nutmeg, 1993)
Something Different (Chitei, 1994)
Be Cool (Chitei, 1995)
Shibusai (Chitei, 1997)
On Stage at Amsterdam (New Gate, 1999)
Shiburyu (Chitei, 1999)
Shibu-Hata (Chitei, 2002)
Shibuboshi (Chitei, 2004)
Never Be Cool Naked (Mona, 2004)
Shibusa Shirazu Orchestra (Aright's, 2005)
Lost Direction (Moers Music, 2005)
Katayama Hiroaki with Shibusashirazu (Studio Wee, 2006)
Shibuzen (Avex Io, 2006)
Shibuki (Avex Io, 2007)
Paris Shibu Bukyoku (Chitei, 2008)
Shibu-Yotabi Plankton (Vivo, 2010)
Shibusaikayoutaizen (Tokuma Japan Communications, 2014)
Juju (Chitei, 2017)
External links
Official homepage
Chitei Records
Full member list (2005)
Japanese jazz ensembles
Avex Group artists
Musical groups established in 1989
|
Nicholas von Hoffman (October 16, 1929 – February 1, 2018) was an American journalist and author. He first worked as a community organizer for Saul Alinsky in Chicago for ten years from 1953 to 1963. Later, Von Hoffman wrote for The Washington Post, and most notably, was a commentator on the CBS Point-Counterpoint segment for 60 Minutes, from which Don Hewitt fired him in 1974. von Hoffman was also a columnist for The Huffington Post.
Life and career
A native New Yorker of German and Russian descent, von Hoffman was born to Anna L. Bruenn, a dentist, and Carl von Hoffman, an explorer and adventurer. Von Hoffman never attended college. In the 1950s, he worked on the research staff of the Industrial Relations Center of the University of Chicago, and then for Saul Alinsky as a field representative of the Industrial Areas Foundation in Chicago, where his best known role was as lead organizer for The Woodlawn Organization.
Ben Bradlee, former editor of The Washington Post, hired von Hoffman from the Chicago Daily News. While at the Post, he wrote a column for the paper's Style section. In her memoirs, Katharine Graham, then the newspaper's publisher, wrote of him: "My life would have been a lot simpler had Nicholas von Hoffman not appeared in the paper." She added that "I firmly believed that he belonged at the Post".
Beginning in 1979 and continuing through the 1980s, von Hoffman recorded over two-hundred radio commentaries, audio op-eds in the sardonic style he used on 60 Minutes. These commentaries were broadcast on the nationally syndicated daily radio program, Byline, which was sponsored by the Cato Institute. Subjects of von Hoffman's audio op-eds included the 1984 Democratic primary candidates, the Reagan administration's foreign policy in Central America and the Middle East, and the cynical, self-serving misuse of language by politicians.
Von Hoffman wrote more than a dozen books, notably: Capitalist Fools: Tales of American Business, from Carnegie to Forbes to the Milken Gang (1992), Citizen Cohn (1988), a biography of Roy Cohn, which was made into an HBO movie, and Hoax: Why Americans Are Suckered by White House Lies (2004). Von Hoffman also wrote a libretto for Deborah Drattell's Nicholas and Alexandra for the Los Angeles Opera which was performed in the 2003–2004 season under the direction of Plácido Domingo. Between April 2007 and February 2008, starting with an article about soaking the rich to pay for George W. Bush's Iraq War, he was a columnist for the New York Observer.
Von Hoffman was fired by Don Hewitt for referring to President Richard Nixon, at the height of the Watergate scandal, as "the dead mouse on the kitchen floor of America, and the only question now is who's going to pick him up by his tail and throw him in the garbage." His collaborations, both literary and otherwise, with Doonesbury cartoonist Garry Trudeau are worth noting, in particular the 1976 book Tales From the Margaret Mead Taproom. In this book, he recounted his adventures in American Samoa with Trudeau and actress Elizabeth Ashley, as they and several others experienced life in the American territory, which Trudeau had lampooned in a series of Doonesbury strips involving Uncle Duke's adventures as the territory's appointed governor. He also wrote for the Architectural Digest.
Von Hoffman died on February 1, 2018, and was survived by three sons: Alexander von Hoffman, a noted historian; Aristodemos, who works in intelligence; and Constantine, also a journalist.
Works
(partial list)
The Multiversity: A Personal Report on What Happens to Today's Students at American Universities
We Are the People Our Parents Warned Us Against
Mississippi Notebook
Two, Three, Many More
Organized Crimes
Citizen Cohn (Doubleday, 1988)
Capitalist Fools: Tales of American Business, from Carnegie to Forbes to the Milken Gang
Hoax: Why Americans Are Suckered by White House Lies
Geneva (play)
Radical: A Portrait of Saul Alinsky (Nation Books, July 2010)
In popular culture
In 1988, fictional presidential candidate Jack Tanner named von Hoffman as his pick for Chairman of the Federal Reserve Board in Robert Altman's HBO series Tanner '88.
References
Further reading
External links
C-SPAN Q&A interview with von Hoffman, September 12, 2010
Incomplete Collection of Nicholas von Hoffman commentaries on CBS Radio Spectrum, 1972–1973
Nicholas von Hoffman, Post Reporter and Columnist with a Literary Flair, dies at 88
1929 births
2018 deaths
American male journalists
Journalists from New York City
American columnists
American people of German-Russian descent
American opera librettists
The New York Observer people
Chicago Daily News people
The Washington Post journalists
60 Minutes correspondents
HuffPost writers and columnists
20th-century American journalists
20th-century American male writers
21st-century American journalists
21st-century American male writers
|
Olivier Krumbholz (born 12 September 1958) is a French handball coach of German descent for the French women's national team. He brought the French team to victory at the 2003 World Women's Handball Championship in Croatia, and has later coached the team at the 2004 Summer Olympics and the 2008 Summer Olympics.
He was coach for the French team at the 2009 World Women's Handball Championship in China, where the French team has reached the final.
References
French male handball players
French handball coaches
Olympic coaches for France
Living people
1958 births
Sportspeople from Moselle (department)
Handball coaches of international teams
French people of German descent
|
```java
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/* This is stub code written based on com.oracle.truffle.api.nodes package
* javadoc published for GraalVM. It makes possible to compile code, which uses
* GraalVM features on JDK 8. The compiled stub classes should never be
* included in the final product.
*/
package com.oracle.truffle.api.nodes;
/**
*
* @author Tomas Hurka
*/
public class LanguageInfo {
public String getId() {return null;}
}
```
|
Mimopolyocha is a monotypic snout moth genus described by Shōnen Matsumura in 1925. Its only species, Mimopolyocha obscurella, had been described by the same author in 1911. It is found in Russia.
References
Moths described in 1911
Phycitinae
Taxa named by Shōnen Matsumura
Monotypic moth genera
Moths of Asia
|
```objective-c
/* Various declarations for functions found in mbchar.c
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it under
Software Foundation; either version 2, or (at your option) any later
version.
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
for more details.
along with GCC; see the file COPYING. If not, write to the Free
Software Foundation, 59 Temple Place - Suite 330, Boston, MA
02111-1307, USA. */
#ifndef GCC_MBCHAR_H
#define GCC_MBCHAR_H
#ifdef MULTIBYTE_CHARS
/* Escape character used for JIS encoding */
#define JIS_ESC_CHAR 0x1b
#define ISSJIS1(c) (((c) >= 0x81 && (c) <= 0x9f) || ((c) >= 0xe0 && (c) <= 0xef))
#define ISSJIS2(c) (((c) >= 0x40 && (c) <= 0x7e) || ((c) >= 0x80 && (c) <= 0xfc))
#define ISEUCJP(c) ((c) >= 0xa1 && (c) <= 0xfe)
#define ISJIS(c) ((c) >= 0x21 && (c) <= 0x7e)
extern int local_mbtowc PARAMS ((wchar_t *, const char *, size_t));
extern int local_mblen PARAMS ((const char *, size_t));
extern int local_mb_cur_max PARAMS ((void));
/* The locale being used for multibyte characters in string/char literals. */
extern const char *literal_codeset;
#endif /* MULTIBYTE_CHARS */
#endif /* ! GCC_MBCHAR_H */
```
|
This is a bibliography of works by writer Peter David.
Novels
Alien Nation: Body and Soul, Pocket Books, 1993.
Battlestar Galactica: Sagittarius Is Bleeding, Tor Books, 2006.
Darkness of the Light, Tor Books, 2007.
Dinotopia: The Maze, Random House Books, 1998.
Fantastic Four: What Lies Between, Pocket Star Books, 2007.
Howling Mad, Ace Books, 1989.
What Savage Beast, Diane Pub Co, 1995.
Tigerheart, Del Rey Books, 2008.
Election Day, Pocket Star Books, 2008.
Year of the Black Rainbow (with Claudio Sanchez), 2010
Fable: The Balverine Order, 2010.
Fable: Blood Ties, 2011.
The Camelot Papers, 2011.
Pulling Up Stakes, 2012.
Pulling Up Stakes 2, 2012.
Artful: A Novel, 2014.
Halo: Hunters in the Dark, 2015.
Modern Arthur
Knight Life, Ace Hardcover, 1987.
One Knight Only, Ace, 2003.
Fall of Knight, Ace Hardcover, 2006.
Photon
Written as David Peters:
For the Glory (1987)
High Stakes (1987)
In Search of Mom (1987)
This Is Your Life, Bhodi Li (1987)
Exile (1987)
Skin Deep (1988)
Psi-Man
Written as David Peters:
Mind-Force Warrior, Diamond/Charter, 1990.
Deathscape, Diamond/Charter, 1990.
Main Street D.O.A., Diamond/Charter, 1991.
The Chaos Kid, Diamond/Charter, 1991.
Stalker, Diamond/Charter, 1991.
Haven, Diamond/Charter, 1992.
Sir Apropos of Nothing
Sir Apropos of Nothing, Pocket Books, 2002.
The Woad to Wuin, Pocket Star, 2003.
Tong Lashing, Pocket Star, 2003.
Sir Apropos of Nothing and the Adventure of the Receding Heir (short story, published in the anthology Heroes in Training, 2007, )
Gypsies, Vamps, and Thieves (with Robin Riggs), IDW Publishing, 2009.
Pyramid Schemes, Second Age, Inc., 2016.
Movie novelizations
The Return of Swamp Thing, Berkley, 1989.
The Rocketeer, Bantam, 1991.
Batman Forever (with Janet Scott-Batchler, Lee Batchler, Akiva Goldsman, and Bob Kane), Warner Books Inc., 1995.
Fantastic Four, Pocket Star, 2005.
Hulk, Del Rey, 2003.
The Incredible Hulk, Del Rey, 2008.
Spider-Man, Del Rey, 2002.
Spider-Man 2, Del Rey, 2004.
Spider-Man 3, Del Rey, 2007.
Iron Man, Del Rey, 2008.
Transformers: Dark of the Moon, 2011
Battleship, 2012
After Earth, 2013
Babylon 5
Based on an outline by J. Michael Straczynski:
Legions of Fire, Book 1—The Long Night of Centauri Prime, Del Rey, 1999.
Legions of Fire, Book 2—Armies of Light and Dark, Del Rey, 2000.
Legions of Fire, Book 3—Out of the Darkness, Del Rey, 2000.
Babylon 5: In the Beginning, Del Rey, 1995. (Movie novelization; Based on a screenplay by J. Michael Straczynski)
Babylon 5: Thirdspace, Del Rey, 1998. (Movie novelization; Based on a screenplay by J. Michael Straczynski)
Comics
Action Comics Weekly #608–620 (Green Lantern serial; #615, 619–620 plot with Richard Howell) (1988)
The Phantom #1-4 (1988)
Justice #15-32 (1988-1989)
Dreadstar #41-64 (1989-1991)
Creepy: The Limited Series #1-4 (1992)
Sachs and Violens #1-4 (1993)Captain America Drug War (1994)Dreadstar #0.5, 1-6 (1994)DC vs. Marvel (#2 and #4 only) (1996)Heroes Reborn: The Return #1-4 (1997)Babylon 5: In Valen's Name (with J. Michael Straczynski), DC Comics, 1998. Powerpuff Girls: Hide and Go Mojo (2002) The Haunted #1-4 (2002)The Haunted: Gray Matters #1 (2002)Red Sonja vs. Thulsa Doom #1-4 (with Luke Lieberman and Will Conrad), Dynamite Entertainment, 2006. Spike: Old Times (with Scott Tipton and Fernando Goni), IDW Publishing, 2006. Spike vs. Dracula #1-5 (with Joe Corroney and Mike Ratera), IDW Publishing, 2006.
Wonder Man: My Fair Super Hero #1-5 (2007)
The Scream #1-4 (2007)
"One Fateful Knight" in the anthology Short Trips: The Quality of Leadership, Big Finish Productions, 2008. Halo: Helljumper #1-5 (2009)Deadpool’s Art of War #1-4 (2014)The Phantom: Danger in the Forbidden City #1-6 (2014)
AquamanThe Atlantis Chronicles #1-7 (1990).Aquaman: Time and Tide #1-4 (with Kirk Jarvinen) (1993), Aquaman Vol.5 #0-46, Annual 1-4 (1994–1998)
AvengersThe Last Avengers Story #1-2 (1995)Avengers: Season One (2012)Avengers: Back to Basics #1-6 (2018)
Captain Marvel (Marvel Comics)Captain Marvel Vol. 4 #1–35, 0 (1999-2002)Captain Marvel Vol. 5 #1–25 (2002-2004)Genis-Vell: Captain Marvel #1-5 (2022)
Fallen AngelFallen Angel #1–20 (DC) (2003-2005)Fallen Angel #1–33 (IDW) (2005-2008)Fallen Angel: Reborn #1–4 (2010)Fallen Angel: Return of the Son #1–4 (2011)
Fantastic FourBefore the Fantastic Four: Reed Richards #1-3 (2000)Marvel 1602: Fantastick Four #1-5 (2005)Fantastic Four: The Prodigal Sun #1 (2019)Silver Surfer: The Prodigal Sun #1 (2019)Guardians of the Galaxy: The Prodigal Sun #1 (2019)New Fantastic Four #1-5 (2022)
The Incredible HulkHulk Visionaries: Peter David, Volume 1 (with Todd McFarlane), Marvel Comics, 2005. . Collects Incredible Hulk #331–339 (1987–1988).Hulk Visionaries: Peter David, Volume 2 (with Todd McFarlane, Erik Larsen, and Jeff Purves), Marvel Comics, 2005. . Collects Incredible Hulk #340–348 (1988).Hulk Visionaries: Peter David, Volume 3 (with Jeff Purves, Alex Saviuk, and Keith Pollard), Marvel Comics, 2006. . Collects Incredible Hulk #349–354 and Web of Spider-Man #44 (1988–1989).Hulk Visionaries: Peter David, Volume 4 (with Bob Harras, Jeff Purves, and Dan Reed), Marvel Comics, 2007. . Collects Incredible Hulk #355–363 and Marvel Comics Presents #26 and #45 (1989–1990).Hulk Visionaries: Peter David, Volume 5 (with Jeff Purves, Dale Keown, Sam Kieth, and Angel Medina), Marvel Comics, 2008. . Collects Incredible Hulk #364–372 and Incredible Hulk Annual #16 (1989–1990).Hulk Visionaries: Peter David, Volume 6 (with Dale Keown,), Marvel Comics, 2009. . Collects Incredible Hulk #373–382 (1990–1991).Hulk Visionaries: Peter David, Volume 7 (with Dale Keown,), Marvel Comics, 2010. . Collects Incredible Hulk #383–389 and Incredible Hulk Annual #17 (1991–1992).Hulk Visionaries: Peter David, Volume 8 (with Dale Keown), Marvel Comics, 2011. . Collects Incredible Hulk #390–396, X-Factor #76 and Incredible Hulk Annual #18 (1992).Epic Collection 19: Ghosts of the Past (with Dale Keown), Marvel Comics, 2015. . Collects Incredible Hulk #397–406 and Incredible Hulk Annual #18–19 (1992).Epic Collection 20: Future Imperfect, Marvel Comics, 2017 . Collects Incredible Hulk #407–419, Annual #20, Incredible Hulk: Future Imperfect #1–2 and material from Marvel Holiday Special #3Epic Collection 21: Fall of the Pantheon, Marvel Comics 2018.. Collects Tales to Astonish (1994) #1, Incredible Hulk vs. Venom #1, Incredible Hulk #420–435Epic Collection 22: Ghosts of the Future, Marvel Comics, 2019.. Collects Incredible Hulk #436–448, Savage Hulk #1 and more.Tempest Fugit (with Lee Weeks), Marvel Comics, 2005. . Collects Incredible Hulk Vol. 2 #77–82.House of M: Incredible Hulk, Marvel Comics, 2006 . Collects Incredible Hulk Vol. 2 #83-87Incredible Hulk #328, 331–359, 361–467, −1 (1987–1998)Incredible Hulk Annual #16–20 (1990–1994)Incredible Hulk Vol. 2 #33 (reprints Incredible Hulk #335), #77–87 (2005)Incredible Hulk: Future Imperfect #1–2 (1992)Incredible Hulk vs. Venom #1 (1994)Tales to Astonish vol. 3 #1 (1994)Prime vs. The Incredible Hulk #0 (1995)Savage Hulk #1 (1996)Incredible Hulk/Hercules: Unleashed #1 (1996)Hulk/Pitt #1 (1997)Hulk: The End #1 (2002)What If General Ross Had Become the Hulk? #1 (2005)Hulk: Destruction #1–4 (2005)Giant-Size Hulk #1 (2006)World War Hulk Prologue: World Breaker #1 (2007)Marvel Adventures: Hulk #13-16 (2008)Hulk vs. Fin Fang Foom #1 (2008)The Incredible Hulk: The Big Picture #1 (2008)Hulk: Broken Worlds #1 (2009)Future Imperfect: Warzones! #1-5 (2015)Secret Wars: Battleworld #4 (2015)Incredible Hulk: Last Call #1 (2019)Maestro #1-5 (2020)Maestro: War and Pax #1-5 (2021)Maestro: World War M #1-5 (2022)Joe Fixit #1-5 (2023)
She-HulkThe Sensational She-Hulk #12 (1989)She-Hulk Vol. 2 #22–38 (2007–2009)She-Hulk: Cosmic Collision #1 (2009)She-Hulk: Sensational #1 (2010)
Soulsearchers & CompanySoulsearchers & Company: On the Case! #1-82 (1993-2007) (with Richard Howell, Amanda Conner, Jim Mooney)
Spider-ManThe Death of Jean DeWolff (with Rich Buckler), Marvel Comics, 1991. Amazing Spider-Man #266–267, 278, 289, 525Peter Parker, The Spectacular Spider-Man #103, 105-110, 112-113, 115-119, 121-123, 128-129Peter Parker, The Spectacular Spider-Man Annual #5–6The Spectacular Spider-Man #134–136Web of Spider-Man #7, 12–13. 40–44, 49Web of Spider-Man Annual #6Spider-Man Special Edition #1 (1992)Spider-Man 2099 #1–44 (1993–1996)Spider-Man 2099 Annual #1Spider-Man 2099 Meets Spider-Man #1Spider-Man Gen¹³ #1 (1996)Spider-Man Family Featuring Spider-Clan #1 (2005)Friendly Neighborhood Spider-Man #1, 4–23 (2005-2007)Friendly Neighborhood Spider-Man Annual #1Marvel Knights: Spider-Man #19 (2005)Spider-Man: The Other (with Reginald Hudlin, J. Michael Straczynski, Pat Lee, Mike Wieringo, and Mike Deodato), Marvel Comics, 2006. Marvel Adventures: Spider-Man #17–19 (2006), 31 (2007)What If? Spider-Man: The Other (2007)Amazing Spider-Man Vol. 3 #1 (2014)Spider-Man 2099 Vol. 2 #1–12 (2014–2015)Spider-Man 2099 Vol. 3 #1-25 (2015–2017)Secret Wars 2099 #1-5 (2015)Ben Reilly: The Scarlet Spider #1-25 (2017-2018)Sensational Spider-Man: Self-Improvement (2019)Symbiote Spider-Man #1-5 (2019)Absolute Carnage: Symbiote Spider-Man #1 (2019)Symbiote Spider-Man: Alien Reality #1-5 (2019-2020)Symbiote Spider-Man: King in Black #1-5 (2020-2021)Symbiote Spider-Man: Crossroads #1-5 (2021)
Spyboy
Written with Pop Mhan and Norman Lee.SpyBoy #1-12, 14-17 (1999-2001)SpyBoy: Motorola Special (2000)SpyBoy/Young Justice #1-3 (2002)SpyBoy Special: The Manchurian Candy Date (2002)SpyBoy: The M.A.N.G.A Affair (also known as SpyBoy #13.1-13.3, compiled The M.A.N.G.A Affair miniseries #1–3) (2003)
SpyBoy: Final Exam #1-4 (2004)
Supergirl
Supergirl Vol. 4 #1–80, Annual #1–2, Supergirl Plus #1, #1000000 (with Gary Frank and Terry Dodson), DC Comics (1996-2003)
Many Happy Returns (written with Ed Benes), DC Comics, 2003.
Wolverine
Wolverine Volume 2 #9, 11-16, 24, 44 (1989, 1990, 1991)
Wolverine: Rahne of Terra (1991)
Wolverine: Global Jeopardy #1 (1993)
Wolverine: Blood Hungry, collecting Marvel Comics Presents #85-92, Wolverine serial (1993)
Wolverine: First Class #13-21 (2009)
X-Factor
X-Factor vol. 1 #55, 70–89 (1990-1993)
X-Factor Annual #6–8
MadroX: Multiple Choice (with Pablo Raimondi), Marvel Comics, 2005.
X-Factor Vol. 3 #1–50, #200–262 (2005–2013)
X-Factor: The Quick and the Dead #1
X-Factor: Layla Miller #1
Nation X: X-Factor #1
All-New X-Factor #1–20 (2014–2015)
X-Men Legends vol. 1 #5-6 (2021)
Young Justice
Young Justice #1–7, 9–21, 23–55, & 1000000 DC Comics (1998–2003)
Young Justice: Sins of Youth #1-2 (2000)
Young Justice: A League of Their Own (with Todd Nauck), DC Comics, 2000.
Star Trek
Collections of DC Comics issues
The Trial of James T. Kirk (Star Trek Comics Classics trade paperback, reprint of DC Comics issues, with James W. Fry and Gordon Purcell), Titan Books, 2006.
Death Before Dishonor (Star Trek Comics Classics trade paperback, reprint of DC Comics issues, with James W. Fry and Arne Starr), Titan Books, 2006.
Star Trek Archives Volume 1: Best of Peter David, 2008,
Captain Sulu Adventures
Cacophony (under the pseudonym J.J. Molloy), Simon & Schuster (Trade Division), 1994.
Captain's Table
Once Burned, Pocket Books, 1998.
Tales From The Captain's Table, story "Pain Management", Pocket Books, 2005.
Deep Space Nine
The Siege, Pocket Books, 1993.
Wrath of the Prophets (with Robert Greenberger and Michael Jan Friedman), Pocket Books, 1997.
Gateways
Cold Wars, Pocket Books, 2001.
What Lay Beyond (with Diane Carey, Keith R. A. DeCandido, Christie Golden, Robert Greenberger, Susan Wright), Pocket Books, 2002.
Starfleet Academy
Worf's First Adventure, Simon & Schuster, 1993.
Line of Fire, Simon & Schuster, 1993.
Starfleet Academy—Survival, Simon & Schuster, 1994.
New Frontier
House of Cards, Pocket Books, 1997.
Into the Void, Pocket Books, 1997.
The Two Front War, Pocket Books, 1997.
End Game, Pocket Books, 1997.
Martyr, Pocket Books, 1998.
Fire on High, Pocket Books, 1998.
Star Trek: New Frontier (collection), Pocket Books, 1998.
The Quiet Place, Pocket Books, 1999.
Dark Allies, Pocket Books, 1999.
Double Time (graphic novel), DC Comics, 2000.
Excalibur, Book 1: Requiem, Pocket Books, 2000.
Excalibur, Book 2: Renaissance, Pocket Books, 2000.
Excalibur, Book 3: Restoration, Pocket Books, 2001.
Being Human, Pocket Books, 2001.
Gods Above, Pocket Books, 2003.
Stone and Anvil, Pocket Books, 2004.
After the Fall, Pocket Books, 2004.
Missing in Action, Pocket Books, 2006.
Treason, Pocket Books, 2009.
Blind Man's Bluff, Gallery Books, 2011.
The Returned: Part 1, Pocket Books, 2015.
The Returned: Part 2, Pocket Books, 2015.
The Returned: Part 3, Pocket Books, 2015.
The Next Generation
Strike Zone, Pocket Books, 1989.
A Rock and a Hard Place, Pocket Books, 1990.
Vendetta, Pocket Books, 1991.
Q-in-Law, Pocket Books, 1991.
Imzadi, Pocket Books, 1993.
Q-Squared, Pocket Books, 1994.
Double Helix—Double or Nothing, Pocket Books, 1999.
Imzadi II: Triangle, Pocket Books, 1999.
I, Q (with John de Lancie), Pocket Books, 2000.
Imazadi Forever, Pocket Books, 2003.
Before Dishonor, Pocket Books, 2007.
Star Trek: The Next Generation - IDW 2020(comic special), IDW Comics, 2019.
The Original Series
The Rift, Pocket Books, 1991.
The Disinherited (with Michael Jan Friedman and Robert Greenberger), Pocket Books, 1992.
The Captain's Daughter, Pocket Books, 1995.
Non-fiction
Beam Me Up, Scotty (co-author, autobiography of James Doohan), 1996.
Short fiction
"The Robin Hood Fan's Tale," The Fans are Buried Tales, Crazy 8 Press
Essays and instructional
But I Digress, Krause Publications, 1994.
Writing for Comics with Peter David, Impact Books, 2006.
More Digressions: A New Collection of 'But I Digress' Columns, Mad Norwegian Press, 2009.
Mr. Sulu Grabbed My Ass, and Other Highlights from a Life in Comics, Novels, Television, Films and Video Games, McFarland, 2020.
External links
Bibliography on Peter David Official site
Bibliographies of American writers
Bibliographies by writer
Science fiction bibliographies
Lists of comics by creator
Comics by Peter David
|
The Bolshaya Ercha () is a river in the Sakha Republic (Yakutia), Russia. It is a tributary of the Indigirka. The river has a length of and a drainage basin area of .
The river flows north of the Arctic Circle, across desolate territories of the Allaikhovsky District.
Course
The Bolshaya Ercha is a right tributary of the Indigirka. It has its sources in the northern slopes of the Ulakhan-Sis range. The river flows first northwestwards in its uppermost section, and then in a roughly western / WSW direction skirting the Kondakov Plateau which rises to the north. In its last stretch the river descends into the Indigirka floodplain among numerous lakes where it meanders strongly, forming oxbow lakes. Finally the Bolshaya Ercha joins the Indigirka from its mouth. Now uninhabited Vorontsovo village lies near the confluence, on the facing bank of the Indigirka.
Tributaries
The main tributary of the Bolshaya Ercha is the long Malaya Ercha on the right, as well as the long Kusagan-Yurekh (Кусаган-Юрэх), the long At-Khaya (Ат-Хайа), the long Kistike (Кистикэ) and the long Erkichan (Эркичан) on the left. The river is frozen between the beginning of October and the beginning of June. There are more than 600 lakes in its basin.
See also
List of rivers of Russia
References
External links
Fishing & Tourism in Yakutia
Сибирь. Древний Гранитный город Улахан-Сис - Rutube
Tributaries of the Indigirka
Rivers of the Sakha Republic
East Siberian Lowland
|
Baotou East railway station is a station of Jingbao Railway in Inner Mongolia. It was built in 1923 and was at one time the main railway station in Baotou. In 1956, the station was renamed "Baotou East".
See also
List of stations on Jingbao railway
References
Railway stations in Inner Mongolia
Railway stations in China opened in 1923
|
Listrac-Médoc (; ) is a commune in the Gironde department in the Nouvelle-Aquitaine region in southwestern France.
Geography
The commune is situated in the Médoc on the Route nationale 215, between Bordeaux and Le Verdon-sur-Mer.
Population
Wine
Lying northwest of the city of Bordeaux, the village is best known as one of the six appellations of the great wine-growing regions of the Médoc. In a region where a mere can be the difference between a great wine and an average one, its distance from the beneficial effect of the Garonne means that its wines are not as highly rated as those of the other appellations. Nonetheless, it is home to many vineyards whose blends of cabernet sauvignon, merlot and cabernet franc can age over a long period.
See also
Communes of the Gironde department
References
External links
Listrac-Médoc on the site of Insee
Communes of Gironde
|
Radha Lakshmi Vilasam "RLV" College of Music and Fine Arts is an academic institution situated in Thripunithura, Kochi in the state of Kerala, India. It is affiliated to the Mahatma Gandhi University and offers graduate and postgraduate courses in music, performing arts and visual arts. The current principal is Prof. C.J Suseela
History
The college began in a single apartment belonging to the Cochin Royal family.
The then King of Cochin, Kerala Varma Midukkan Thampuran and his wife Smt. Lakshmikutty Nethyaramma invited experts in stitching, kaikottikkali, and painting to impart learning to girls and elder ladies. This endeavor developed into an institution in the name of the King’s daughter Radha and wife Lakshmi and was named ‘Radha Lakshmi Vilasam Academy’ incorporating vocal music also.
In 1956, the institution was brought under the control of the government of Kerala and was renamed as RLV Academy of Music and Fine Arts. Diploma and Post Diploma Courses in vocal music, Bharathanatyam, Kathakali, and painting were started.
In 1998, the institution was affiliated to the Mahatma Gandhi University, Kerala at Kottayam. The Diploma and Post Diploma Courses were restructured as degree and postgraduate courses.
Faculties and departments
Faculty of Music
Department of Vocal
Department of Veena
Department of Violin
Department of Mridangam
Faculty of Performing Arts
Department of Bharatanatyam
Department of Mohiniyattam
Department of Kathakali Vesham
Department of Kathakali Sangeetham
Department of Chenda
Department of Maddalam
Faculty of Visual Arts
Department of Painting
Department of Sculpture
Department of Applied Arts
Courses
Bachelor of Arts - Music and Performing Arts
Master of Arts - Music and Performing Arts
Bachelor of Fine Arts - Visual Arts
Master of Fine Arts - Visual Arts
Notable alumni
K.J. Yesudas
Thiruvizha Jayashankar
Thonnakkal Peethambaran
Mayyanad Kesavan Namboodiri
Benoy Varghese
Vaikom Valliammal
Vaikom Vasudevan Namboothiri
Haripad KPN Pillai
Seema G. Nair
Gowry Lekshmi
Sabareesh Prabhaker
RLV Ramakrishnan
Minmini
Principals
N.V.Narayana Bhagavathar 1956-57
K.S.Kumaraswamy Iyer 1957-66
K.S.Harihara Iyer 1966-68
Nellai T.V.Krishnamoorthy 1969-70
Parassala B.Ponnammal 1970-80
Mavelikkara R.Prabhakara Varma 1981-84
Smt. S. Janaki 1984-85
T.P.Moni Iyer1985-86
K.K.Dharmarajan 1986-88
P. Leela 1988-94
V.I.Suku 1994-96
Avaneeswaram Ramachandran 1996-98
Tripunithura K.Lalitha 2000-02
P.S.Vanajam 2002-2009
R.Kamakshi 2009-12
Prof M.Balasubramoniam (2012- 2014)
Dr K.S.Jays ( 2014-2015 )
Prof T.N.Govindan Namboothiri ( 2015 -
Prof. Chalakkudy V.K.Ramesan
References
Arts and Science colleges in Kerala
Colleges affiliated to the University of Kerala
Music schools in India
Universities and colleges in Kochi
1997 establishments in Kerala
Music schools in Kerala
|
The Eye of Argon is a 1970 heroic fantasy novella by Jim Theis (1953–2002) that narrates the adventures of Grignr, a mighty barbarian. It has been notorious within science fiction fandom since its publication, described as "one of the genre's most beloved pieces of appalling prose," the "infamous 'worst fantasy novel ever' published for fans' enjoyment," and "the apotheosis of bad writing". Science fiction conventions have long held group readings of the work in which participants are challenged to read it aloud for extended periods without laughing.
History
Writing and publication
The novella was written by Jim Theis, a St. Louis, Missouri, science fiction fan, at age 16. The work was first published in 1970 in OSFAN 10, the fanzine of the Ozark Science Fiction Association. Theis was "a malaprop genius, a McGonagall of prose with an eerie gift for choosing the wrong word and then misapplying it," according to David Langford in SFX. Many misspellings also arose from the fanzine transcription's poor typing. Theis was not completely happy with the published version and continued to work on the story. In an interview published three months later, he said:
In fact, I have changed it. I went over it for an independent study for English in school. You know, like adjectives changed and places where sentences should be deleted; things of this type. Even so it is nothing to be proud of and yet it is. Because how many people have had their first story published at 16—even if it is in a fanzine or a clubzine? How many writers have written a complete story at so early an age? Even so, "Eye of Argon" isn't great. I basically don't know much about structure or composition.
Spread and notoriety
Sometime in the 1970s, science fiction author Thomas N. Scortia obtained a copy, which he mailed to horror novelist Chelsea Quinn Yarbro. Yarbro wrote to Darrell Schweitzer in 2003:
Tom Scortia sent me the fanzine pages as a kind of shared amusement, since both of us tended to look for poor use of language in stories. Don Simpson and I were still married then, and one of our entertainments was reading aloud to each other. This work was such a mish-mash that we took turns reading it to each other until we could stand no more...
About two weeks after the story arrived, we had a dinner party, mainly for MWA (Mystery Writers of America) and book dealer friends, and Joe Gores got to talking about some of the really hideous language misuse he had seen in recent anthology submissions and had brought along a few of the most egregious. I mentioned I had something that put his examples in the shade, and brought out "The Eye of Argon." It was a huge hit. [Locus reviewer] Tom Whitmore asked if he could make a copy of it, and I loaned it to him, and readings of it started to become a hideous entertainment. I never typed out a copy of it, but I am afraid I did start the ball rolling.
The work was copied and distributed widely around science fiction fandom, often uncredited. Readings quickly became a common activity at science fiction conventions: "People sit in a circle and take turns reading from photocopies of the story. The reader's turn is over when he begins to laugh uncontrollably."
Later editions
An edition of The Eye of Argon was published in 1987 by Hypatia Press, illustrated by Lynne Adams (). The story was also reprinted in 1995, attributed to "G. Ecordian," as a nod to the story's protagonist.
Later, a version became available on the Internet, ARGON.DOC, which was manually transcribed by Don Simpson and placed online by Doug Faunt. It bears this note at the bottom:
No mere transcription can give the true flavor of the original printing of The Eye of Argon. It was mimeographed with stencils cut on an elite manual typewriter. Many letters were so faint as to be barely readable, others were overstruck, and some that were to be removed never got painted out with correction fluid. Usually, only one space separated sentences, while paragraphs were separated by a blank line and were indented ten spaces. Many words were grotesquely hyphenated. And there were illustrations — I cannot do them justice in mere words, but they were a match for the text. These are the major losses of this version (#02) of TEoA.
Otherwise, all effort has been made to retain the full and correct text, preserving even mis-spellings and dropped spaces. An excellent proofreader has checked it for errors both omitted and committed. What mismatches remain are mine.
However, the online version was found to contain errors when an original copy of the fanzine was discovered in Temple University's Paskow Science Fiction Collection in 2003.
Finding the lost ending
The ending of The Eye of Argon was missing from Scortia's copy and all the copies made of it. The last page of the story was on the last sheet of the fanzine, which had fallen off the staples. The online version ended with the phrase "-END OF AVAILABLE COPY-". The original copy found in 2003 was also incomplete.
The ending was considered lost until a complete copy of the fanzine was discovered by librarian Gene Bundy at the Jack Williamson Science Fiction Library at Eastern New Mexico University in 2005. Bundy reported the discovery to Lee Weinstein, who had found the copy in Philadelphia, and subsequently published the article "In Search of Jim Theis" in the New York Review of Science Fiction 195.
In 2006, Wildside Press published a paperback edition of the complete work.
Plot summary
Chapter 1 The story starts with a sword fight, in the empire of Noregolia between the Ecordian barbarian Grignr and some mercenaries who are pursuing him. After killing them, Grignr resumes his journey to the Noregolian city of Gorzom in search of wenches and plunder.
Chapter 2 Grignr arrives in Gorzom and goes to a tavern, where he picks up a local wench (with a "lithe, opaque nose"). A drunken guard challenges him over the woman; he beheads the guard, but is arrested by the man's companions and brought before the local prince Agaphim, whom he proceeds to insult. Infuriated, Agaphim condemns him to a life of forced labor in the mines. Enraged, Grignr seizes a sword and after running it through the prince's advisor, Agafnd, is about to kill Agaphim when he is knocked unconscious. This chapter contains the first of several occasions when the word slut is applied to a man, presumably as an insult.
Chapter 3 Grignr awakens in a dark, dismal cell. He sits despondently, thinking of his homeland.
Chapter 3½ A scene of a pagan ritual involving a group of "shamen [sic]" preparing to sacrifice a young woman to the titular Eye of Argon: a grotesque "many fauceted scarlet emerald [sic]" idol.
Chapter 4 Losing track of time, Grignr sits bored and anguished in his cell. A large rat attacks him and he decapitates it. It then inspires him with a plan involving the corpse of the rat, which he dismembers.
Chapter 5 The pagan ritual proceeds, with a priest ordering the young woman up to the altar. When she ignores him, he attempts to grope her. She vomits onto the priest, who chokes her. She then disables him with a hard kick between the testicles, causing him to ooze ichor. Enraged, the other shamans grab and molest her.
Chapter 6 Grignr is taken from his cell by two soldiers. He takes the rat pelvis he has fashioned into a dagger and slits one soldier's throat. He then strangles the second and takes his clothes, torch, and ax. He wanders the catacombs for a time, finding a storeroom, and narrowly avoids being killed by a booby-trap. Below this room, he finds the palace mausoleum. He resets the booby-trap in case he is being pursued.
He hears a scream apparently coming from a sarcophagus. He opens it to find the scream is coming from below. He opens a trap door to see the pagan ritual. Seeing a shaman about to sacrifice the young woman, Grignr plows into the group of shamans with the ax and takes the Eye. The young woman, Carthena, turns out to be the tavern wench. They depart.
Chapter 7 One priest, who had been suffering an epileptic seizure during Grignr's attack, recovers. Maddened by what he sees, he draws a scimitar and follows Grignr and Carthena through the trap door in the ceiling.
Chapter 7½ The priest strikes at Grignr but he triggers and is killed by, the reset booby-trap before his sword can connect. Carthena tells Grignr of the prince, Agaphim, who had condemned him to the mines. They encounter Agaphim and kill him, as well as his inexplicably resurrected advisor Agafnd.
As Grignr and Carthena leave, Grignr pulls the Eye of Argon out of his pouch to admire. The jewel melts and turns into a writhing blob with a leechlike mouth. The blob attacks him and begins sucking his blood. Carthena faints. Grignr, beginning to lose consciousness, grabs a torch and thrusts it into the blob's mouth.
Traditional photocopied and Internet versions end at this point, incomplete since page 49 of the fanzine had been lost. The ending was rediscovered in 2004 and published in The New York Review of Science Fiction #198, February 2005.
The Lost Ending (Remainder of Ch. 7½) The blob explodes into a thousand pieces, leaving nothing behind except "a dark red blotch upon the face of the earth, blotching things up." Grignr and the still-unconscious Carthena ride off into the distance.
Readings
At SF conventions
For a number of years circa the 1990s The Eye of Argon was read aloud, usually as charity events, at several American science fiction conventions, such as OryCon, LosCon, and 5Con. A panel of volunteers would take turns reading passages, and the audience would bid to stop that passage or continue (for some set number of minutes, or paragraphs after each successful bid). At some of these events, some members of the audience acted out the scenes being read as mime.
As a party game
Reading The Eye of Argon aloud has been made into a game, as described by SF critic Dave Langford in SFX magazine: "The challenge of death, at SF conventions, is to read The Eye of Argon aloud, straight-faced, without choking and falling over. The grandmaster challenge is to read it with a squeaky voice after inhaling helium. What fun we fans have." To encourage the game, a "Competitive Reading Edition" of the story is freely available, which is a careful copy of the original publication.
Author
James Francis "Jim" Theis (pronounced ; August 9, 1953 – March 26, 2002) wrote The Eye of Argon at age 16. It was published in a fanzine on August 21, 1970, a few days after his seventeenth birthday. He published one more fantasy story in another fanzine, Son of Grafan, in 1972, and later pursued and earned a degree in journalism. His hobbies included collecting books, comics, and German swords. He also collected, traded, and sold tapes of radio programs of the 1930s, '40s, and '50s under the business name The Phantom of Radio Past. After his death at age 48, his family requested donations to the American Heart Association.
In an interview on Hour 25 (the presenters of which would periodically stage a reading of The Eye of Argon) in 1984, Theis stated that he was hurt that his story was being mocked and vowed never to write again. In a later interview he complained about being mocked for something he had written thirty years ago, at age sixteen. He participated in readings of the story in St. Louis at the Archon convention. A copy of the 1995 reprinting was sent to him, with no response.
Other attributed authors and distributors
Before copies of the original fanzine were rediscovered, the story's authorship was in doubt. Because the novelette was at least once re-typed and photocopied for distribution without provenance, many readers found it hard to believe the story was not a collaborative effort, satire, or both. A now-defunct site called "Wulf's 'Eye of Argon' Shrine" argued that the story "was actually well paced and plotted," and noted that "at least one sf professional today claims that the story was a cunning piece of satire passed off as real fan fiction."
David Langford reported the following, sent in by author Michael Swanwick, in Ansible #193:
I had a surprising conversation at Readercon with literary superstar Samuel R. Delany, who told me of how at an early Clarion the students and teachers had decided to see exactly how bad a story they could write if they put their minds to it. Chip [Delany] himself contributed a paragraph to the round robin effort. Its title? "The Eye of Argon".
Author Stephen Goldin said that, during a convention, he met a woman who told him she had done the actual mimeographing for the OSFAN publication. Lee Weinstein reports that he had originally heard that Dorothy Fontana had distributed the photocopies. Weinstein, however, later discovered Usenet posts by Richard W. Zellich, who was involved in running the St. Louis-area convention Archon. Zellich reported in 1991 posts that Jim Theis was real and attended the convention for years.
What Weinstein calls "the smoking gun...the long missing citation" was a 1994 posting from New York fan Richard Newsome, who transcribed an interview with Theis published in OSFAN 13. The interviewer praised Theis, saying, "When they were kidding you about it, you took it so well....You showed real character." Theis replied, "I mean, it was easier than showing bad character and inviting trouble."
See also
Amanda McKittrick Ros, novelist whose work has also been read aloud in similar competitions.
Chuck Tingle, science fiction novelist whose work is known for its ridiculousness.
Fifty Shades of Grey, a story begun as Twilight fan fiction with a similar reputation for the low quality of its writing.
My Immortal, a 2006–07 Harry Potter fan fiction also infamous as an example of poorly written literature.
References
External links
Interview with Jim Theis — OSFAN No. 13, November 21, 1970
The Eye Of Argon — Rules for a Reading by Mary Mason
The Eye of Argon — full text (OSFAN #7)
About The Eye of Argon — David Langford's page with links to the complete text (HTML) and scans of the original fanzine pages (PDF).
1970 short stories
Fantasy short stories
Gemstones in fiction
American science fiction works
American novellas
Heroic fantasy
Heroic fantasy short stories
|
Ivan Stoyanov (; born 9 July 1991) is a Bulgarian footballer who plays as a defender.
References
External links
1991 births
Living people
Bulgarian men's footballers
Men's association football defenders
FC Pirin Gotse Delchev players
First Professional Football League (Bulgaria) players
|
```shell
What is stored in a commit?
How to set your username and email
Make your log output pretty
Limiting log output by time
Use `short` status to make output more compact
```
|
Cannon Fodder 2: Once More unto the Breach, or simply Cannon Fodder 2, is an action-strategy shoot 'em up game developed by Sensible Software and published by Virgin Interactive for the Amiga and DOS in November 1994. The game is the sequel to Cannon Fodder, a successful game released for multiple formats in 1993. The game is a combination of action and strategy involving a small number of soldiers battling through a time-travel scenario. The protagonists are heavily outnumbered and easily killed. The player must rely on strategy and heavy secondary weapons to overcome enemies, their vehicles and installations.
The game retained the mechanics and gameplay of its predecessor but introduced new levels, settings and graphics. Former journalist Stuart Campbell designed the game's levels, making them harder and more tactically demanding, as well as introducing a multitude of pop culture references in the level titles. The development of the game's plot was hampered by budget constraints and the resulting lack of explanation confused reviewers. Critics enjoyed the gameplay retained from the original Cannon Fodder but were disappointed at the lack of new mechanics or weapons, comparing the game to a data disk. Reviewers praised the game's level design, though less so those of its alien planet. Critics gave Cannon Fodder 2 positive reviews but lower scores than its predecessor and gave mixed criticism of the new theme music and increased difficulty.
Synopsis
Cannon Fodder 2 is a military-themed action game with strategy and shoot 'em up elements. The player controls a small squad of up to four soldiers. These soldiers are armed with machine guns which kill enemy infantry with a single round. The player's troops are similarly fragile, and while they possess superior fire-power at the game's outset the enemy infantry becomes more powerful as the game progresses. As well as foot soldiers, the antagonists include vehicles and missile-armed turrets. The player must also destroy buildings which spawn enemy soldiers. For these targets, which are invulnerable to machine gun fire, the player must use secondary, explosive weaponry: grenades and rockets. Ammunition for these weapons is limited and the player must find supply crates to replenish his troops. Wasting these weapons can potentially result in the player not having enough to fulfil the mission objectives. The player can opt to shoot crates – destroying enemy troops and buildings in the ensuing explosion – at less risk to his soldiers than retrieving them, but again at a greater risk of depleting ammunition.
The player proceeds through 24 missions divided into several "phases" each, making 72 levels in all. There are various settings including medieval, gangster-themed Chicago, an alien spacecraft and an alien planet. The player must also contend with mines and other booby traps. As well as shooting action, the game features strategy elements and employs a point-and-click control system more common to strategy than action games. As the player's troops are heavily outnumbered and easily killed, he must use caution, as well as careful planning and positioning. To this end, he can split the squad into smaller units to take up separate positions or risk fewer soldiers when moving into dangerous areas. In alternative settings, heavy weapons are replaced graphically by such units as battering rams (replaces trucks) and wizards (replaces rockets).
The game's plot – minimally expounded in the manual – concerns soldiers partaking in a Middle Eastern conflict (which forms the game's early levels) abducted by aliens to do battle on an alien world (which forms the later levels). During the process of space travel, the aliens send the soldiers to various times and places, resulting in the intervening medieval and Chicago settings.
Development
The game is the sequel to Cannon Fodder, which drew criticism for its juxtaposition of war and humour and its use of iconography closely resembling the remembrance poppy. The cover art's poppy was ultimately replaced with a soldier, in turn replaced by a hand grenade for Cannon Fodder 2, regarding which Amiga Power joked: "The great thing about an explosive charge wrapped in hundreds of meters wound-inflicting wire is that it doesn't have the same child-frightening, 'responsible adult' freaking, society-disrupting effect as an iddy-biddy flower". The One felt the new historical and science-fiction themes an attempt to avoid similar controversy as befell Cannon Fodder. Amiga Power itself had become embroiled in the controversy due to its planned use of the poppy on its cover (also abandoned) and perceived inflammatory commentary its editor Stuart Campbell. Campbell later left the magazine to join Sensible Software as a programmer and worked on the sequel as his first game.
A small team of "essentially four" people – among them first-time level-designer Campbell – created the game, retaining the Cannon Fodder engine. Prior to Campbell's arrival from a journalism career, Sensible Software had devised the game's time-travelling theme and decided upon the various settings. However, it had not yet developed a plot to expound these themes. It was not possible to illustrate the story in the game itself, due to Cannon Fodder 2'''s simple nature and so Campbell began work on an elaborate "plot-to-be", partially completing a novella intended to accompany the final product. This version of the story had the time-travelling aliens plotting to intervene in various parts of human history to create chaos, which they intended to exploit to enslave and destroy humanity. The protagonists' kidnappers were envisioned as sympathisers who would send them through time to defend mankind. Virgin vetoed the proposal as too expensive and took charge of the manual's production. The result was a simplified explanation which described the soldiers as in the employ of the aliens and did not clarify the time-travel element. Campbell later said the loss of the novella was an example of a publisher preferring to maximise profit from a game rather than build intellectual property towards the end of the Amiga's commercial life.
As the game was to retain the same engine, the developers could not add new gameplay features. Campbell instead set out to make the levels more interesting, creating multiple paths through the missions. More obvious solutions would be more difficult, and the hidden, "proper" paths easier to execute once deduced. While Campbell intended the game to be harder, he also wished to improve the difficulty curve, which he argued was a flaw of its predecessor. He also tended to make the levels smaller and reduced instances of water obstacles, which he regarded as frustrating in the first game. The designer conceded that some levels turned out to be too difficult – due to his inexperience as a developer and the fact he became so skilled while play testing – but maintained that level 8 of the original was worse than any of his creations. Campbell named most of the game's levels after songs titles and lyrics (prominently The Jesus and Mary Chain), but also referenced wider pop culture artifacts such as gameshows and Bugs Bunny cartoons, as well as some original titles. He also referenced classic games in the level design itself.
At the time, Jon Hare said changing the formula would be detrimental, and unnecessary to provide enjoyment and value. He later reflected that Sensible had poorly managed the project in "delegating" the design to newcomer Campbell. He felt this to be a consequence of Sensible Software avariciously spreading itself thin, by that point attempting to exploit its success. Hare sold Sensible to Codemasters in 1999 and consequently worked on an abortive Cannon Fodder 3, with such a title ultimately published by Russia's Game Factory Interactive for the PC in 2012.
ReceptionCannon Fodder 2 retains the same mechanics and core gameplay of its predecessor, prompting reviewers to say: "It's still as wonderfully playable as it ever was", and to acknowledge "all the amazing control and playability" of the original. Reviewers complained about the lack of plot, with Amiga Power stating: "There's little explanation as to why you're doing this time-travelling and absolutely none in the game. As a result, the game doesn't hang together". AUI called the plot "pointless", while Amiga Computing called it a "slight problem", saying "you have to guess what is going on in the game because there's no plot explanation [...] it's all very confusing!"
The game is markedly more difficult than its predecessor. Amiga Format called this "good/bad news", whereas The One directed its "major criticism" at the difficulty level, saying that "some of the levels are quite simply horrendous", and that the game is "close to being intensely frustrating at times". Amiga Computing also felt the high difficulty to be the "biggest problem": "I like a game to get progressively harder rather than getting virtually impossible after just four missions". Amiga Format also criticised the difficulty and felt "some of the levels are a bit of a drag". Amiga Power was annoyed at the early tutorial missions, finding them redundant, but otherwise noted the increased challenge as a positive, and said: "The original game went in pulses of fiendishly hard and stupidly simple levels, but in CF2 the difficulty curve's, well, more of a curve". The reviewer praised the clever level design, explaining: "The levels penalise you for taking the obvious route and reward you for trying an obscure approach [...] loads of levels make you think before you move, injecting puzzle elements into the killing", citing the example of traps with empty vehicles as bait. The reviewer praised the smaller, tighter levels with a difficulty curve within those levels: "gung-ho" sections building to tactical play against tougher enemies. He compared this favourably with the first game: "The level design is consistently better", in particular the "Beirut, Mediaevil and Chicago levels look and play wonderfully". He nevertheless felt the thematic shifts lacked coherence and atmosphere.
The game's alien planet levels drew much criticism, on which Amiga Computing opined "whoever chose the colour schemes should be thrown away in jail". While he praised their mechanics, Amiga Power's reviewer said: "I hate the entire look of the alien planet [...] From the disgusting purple pools to the silly flowers". Some reviewers enjoyed the graphics but felt there was no change between the two games. CU Amiga said "it's the same game tarted up with new graphics" as well as the new levels. Amiga Computing praised the new main theme music. Amiga Power said it was not as good as its predecessor and also pointed out that the in-game music remained the same as the original Cannon Fodder and had grown tiresome. The magazine questioned the lack of an option to disable it. Critics decried the lack of new weapons, pointing out that the original armaments and vehicles had merely been made to look different in the various settings, while behaving in the same manner.
Reviewers more generally criticised the similarity between Cannon Fodder and Cannon Fodder 2. The One, AUI, and Amiga Computing compared the new game to a "data disk" rather than a full sequel. Kieron Gillen later reflected that it would be called a "semi-sequel" or "stand-alone add-on pack" if released today. CU Amiga conceded that the designers could have added little new to such a simple game without tampering with the basic, successful mechanics; Sensible Software was accused of "laziness" by The One, and of "greed" by AUI.
While it awarded 90%, Amiga Power felt the game was poor value for money compared to the original, while CU Amiga said it was "still worth buying". AUI said the game was "a must" for those without the original, otherwise Cannon Fodder 2 is "basically exactly the same game as before", with the "saving grace" of new levels. Amiga Computing enjoyed the game but said it was not as good as expected and that there are "too many similarities and not enough differences to make this sequel a classic". The One'' summarised: "If you've got CF1, love it, and want seconds, only harder, look no further – but, if like myself you've played Cannon Fodder to death and would've liked to have seen the game developed in some way, I think you'll be a bit disappointed".
References
External links
Cannon Fodder 2 at MobyGames
Cannon Fodder 2: The Untold Story, Stuart Campbell's level-by-level account of the game's development
1994 video games
Action games
Amiga games
DOS games
Military science fiction video games
Sensible Software games
Shoot 'em ups
Shooter games
Strategy video games
Video games about time travel
Video games with isometric graphics
Virgin Interactive games
Video games scored by Jon Hare
Video games scored by Richard Joseph
Games commercially released with DOSBox
Single-player video games
Video games developed in the United Kingdom
|
```xml
/*
* @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.
*/
/* eslint-disable @typescript-eslint/no-invalid-this */
import isMatrixLike = require( './index' );
// TESTS //
// The function returns a boolean...
{
const matrix = {
'data': [ 2, 1, 1, 2 ],
'ndims': 2,
'shape': [ 2, 2 ],
'strides': [ 2, 1 ],
'offset': 0,
'order': 'row-major',
'dtype': 'generic',
'length': 4,
'flags': {},
'get': function get( i: number, j: number ): number {
const idx = ( this.strides[ 0 ] * i ) + ( this.strides[ 1 ] * j );
return this.data[ idx ];
},
'set': function set( i: number, j: number, v: number ): number {
const idx = ( this.strides[ 0 ] * i ) + ( this.strides[ 1 ] * j );
this.data[ idx ] = v;
return v;
}
};
isMatrixLike( matrix ); // $ExpectType boolean
isMatrixLike( [] ); // $ExpectType boolean
isMatrixLike( false ); // $ExpectType boolean
}
// The compiler throws an error if the function is provided an unsupported number of arguments...
{
isMatrixLike(); // $ExpectError
}
```
|
```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\Compute;
class InstantSnapshotsScopedListWarningData extends \Google\Model
{
/**
* @var string
*/
public $key;
/**
* @var string
*/
public $value;
/**
* @param string
*/
public function setKey($key)
{
$this->key = $key;
}
/**
* @return string
*/
public function getKey()
{
return $this->key;
}
/**
* @param string
*/
public function setValue($value)
{
$this->value = $value;
}
/**
* @return string
*/
public function getValue()
{
return $this->value;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(InstantSnapshotsScopedListWarningData::class, 'Google_Service_Compute_InstantSnapshotsScopedListWarningData');
```
|
```java
Short-circuit evaluation
Use meaningful names
Using the `Console`
Using Inheritance to reduce code repetition
Locks in `static synchronized` methods
```
|
Winks are Flash-based animated files that appear in Windows Live Messenger. When a user sends a Wink to a friend, the animation file is transferred over the Internet and is displayed on the recipient's computer screen. Microsoft provides some Winks for free with Windows Live Messenger and also links to third party websites where other Winks can be purchased.
References
Web animation
|
```java
package com.aspsine.irecyclerview.bean;
import android.os.Parcel;
import android.os.Parcelable;
/**
* 10
*/
public class PageBean implements Parcelable {
private int page=0;
private int rows=10;
private int totalCount;
private int totalPage;
private boolean refresh=true;
public int getLoadPage() {
if(refresh){
return page=1;
}
return ++page;
}
public int getPage() {
return page;
}
public void setPage(int page) {
this.page = page;
}
public int getRows() {
return rows;
}
public void setRows(int rows) {
this.rows = rows;
}
public int getTotalCount() {
return totalCount;
}
public void setTotalCount(int totalCount) {
this.totalCount = totalCount;
}
public int getTotalPage() {
return totalPage;
}
public void setTotalPage(int totalPage) {
this.totalPage = totalPage;
}
public boolean isRefresh() {
return refresh;
}
public void setRefresh(boolean refresh) {
this.refresh = refresh;
}
@Override
public int describeContents() {
return 0;
}
@Override
public void writeToParcel(Parcel dest, int flags) {
dest.writeInt(this.page);
dest.writeInt(this.rows);
dest.writeInt(this.totalCount);
dest.writeInt(this.totalPage);
dest.writeByte(refresh ? (byte) 1 : (byte) 0);
}
public PageBean() {
}
protected PageBean(Parcel in) {
this.page = in.readInt();
this.rows = in.readInt();
this.totalCount = in.readInt();
this.totalPage = in.readInt();
this.refresh = in.readByte() != 0;
}
public static final Creator<PageBean> CREATOR = new Creator<PageBean>() {
@Override
public PageBean createFromParcel(Parcel source) {
return new PageBean(source);
}
@Override
public PageBean[] newArray(int size) {
return new PageBean[size];
}
};
}
```
|
```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 your_sha256_hashALLOCATION_INTERVAL_TREE_HPP
#define your_sha256_hashALLOCATION_INTERVAL_TREE_HPP
#include <algorithm>
#include <functional>
#include <set>
#include <vector>
#include "virtual_reg.hpp"
namespace dnnl {
namespace impl {
namespace graph {
namespace gc {
namespace xbyak {
/* *
* Non-overlapping balanced interval tree implemetation based on std::set.
* */
class interval_tree_t {
public:
// constructor
interval_tree_t() = default;
// destructor
virtual ~interval_tree_t() = default;
bool empty() { return node_map_.empty(); }
// insert new interval
void insert(stmt_index_t start, stmt_index_t end, virtual_reg_t *virt_reg) {
node_map_.insert(node_t(start, end, virt_reg));
}
// remove existing interval
void remove(stmt_index_t start, stmt_index_t end, virtual_reg_t *virt_reg) {
erase_nodes(start, end, virt_reg, [](node_t node) {});
}
// divide existing interval using cut range
void divide(stmt_index_t start, stmt_index_t end, virtual_reg_t *virt_reg) {
std::vector<node_t> erased_nodes;
auto node_func = [&](node_t node) { erased_nodes.push_back(node); };
erase_nodes(start, end, virt_reg, node_func);
for (auto &node : erased_nodes) {
// front
stmt_index_t start_front = node.start_;
stmt_index_t end_front = std::min(node.end_, start);
if (start_front < end_front) {
insert(start_front, end_front, virt_reg);
}
// back
stmt_index_t start_back = std::max(node.start_, end);
stmt_index_t end_back = node.end_;
if (start_back < end_back) {
insert(start_back, end_back, virt_reg);
}
}
}
// search interval for overlap
bool search(stmt_index_t start, stmt_index_t end) {
auto iter = node_map_.lower_bound(node_t(start, end, nullptr));
if (iter != node_map_.begin()) { iter--; }
while (iter != node_map_.end()) {
auto &node = *iter;
if (end <= node.start_) { break; }
if (node.intersects(start, end)) { return true; }
iter++;
}
return false;
}
// query interval for overlap
void query(stmt_index_t start, stmt_index_t end,
std::function<void(virtual_reg_t *)> func) {
auto iter = node_map_.lower_bound(node_t(start, end, nullptr));
if (iter != node_map_.begin()) { iter--; }
while (iter != node_map_.end()) {
auto &node = *iter;
if (end <= node.start_) { break; }
if (node.intersects(start, end)) { func(node.virtual_reg_); }
iter++;
}
}
private:
// Internal node
struct node_t {
stmt_index_t start_;
stmt_index_t end_;
virtual_reg_t *virtual_reg_;
bool intersects(stmt_index_t start, stmt_index_t end) const {
return std::max(start_, start) < std::min(end_, end);
}
bool operator<(const node_t &b) const { return start_ < b.start_; }
node_t(stmt_index_t start, stmt_index_t end, virtual_reg_t *virt_reg)
: start_(start), end_(end), virtual_reg_(virt_reg) {
// must contain valid range
assert(start < end);
}
};
// Internal RB-tree
std::set<node_t> node_map_;
// erase interval node
void erase_nodes(stmt_index_t start, stmt_index_t end,
virtual_reg_t *virt_reg, std::function<void(node_t)> func) {
auto iter = node_map_.lower_bound(node_t(start, end, nullptr));
if (iter != node_map_.begin()) { iter--; }
while (iter != node_map_.end()) {
auto &node = *iter;
if (end <= node.start_) { break; }
if (node.virtual_reg_ == virt_reg) {
func(node);
iter = node_map_.erase(iter);
} else {
iter++;
}
}
}
};
} // namespace xbyak
} // namespace gc
} // namespace graph
} // namespace impl
} // namespace dnnl
#endif
```
|
```vue
<template>
<section class="page page--ui-slider">
<h2 class="page__title">UiSlider</h2>
<p>UiSlider allows the user to select a value from a continuous range of values by moving the slider thumb, clicking on the slider, or using the keyboard arrow keys.</p>
<p>UiSlider supports an icon and a disabled state. The slider is keyboard accessible.</p>
<h3 class="page__section-title">
Examples <a href="path_to_url" target="_blank" rel="noopener">View Source</a>
</h3>
<div class="page__examples">
<h4 class="page__demo-title">Basic</h4>
<ui-slider v-model="slider1"></ui-slider>
<h4 class="page__demo-title">With icon</h4>
<ui-slider v-model="slider2" icon="volume_up"></ui-slider>
<h4 class="page__demo-title">With marker</h4>
<ui-slider v-model="slider3" show-marker></ui-slider>
<h4 class="page__demo-title">With custom min and max: [1, 15]</h4>
<ui-slider v-model="slider4" show-marker :min="1" :max="15" :step="1"></ui-slider>
<h4 class="page__demo-title">Snap to steps: 20</h4>
<ui-slider
v-model="slider5"
show-marker
snap-to-steps
:step="20"
></ui-slider>
<h4 class="page__demo-title">In a modal</h4>
<ui-button @click="openModal">Open modal</ui-button>
<ui-modal ref="modal" title="Slider in a modal" dismiss-on="close-button esc">
<ui-slider v-model="slider7"></ui-slider>
</ui-modal>
<h4 class="page__demo-title">Disabled</h4>
<ui-slider v-model="slider6" icon="volume_up" disabled></ui-slider>
<div class="reset-sliders">
<ui-button @click="resetSliders">Reset Sliders</ui-button>
</div>
</div>
<h3 class="page__section-title">API</h3>
<ui-tabs raised>
<ui-tab title="Props">
<div class="table-responsive">
<table class="table">
<thead>
<tr>
<th>Name</th>
<th>Type</th>
<th>Default</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td>name</td>
<td>String</td>
<td></td>
<td>
<p>The <code>name</code> attribute of the slider's hidden input element. Useful when traditionally submitting a form the slider is a part of.</p>
</td>
</tr>
<tr>
<td class="no-wrap">modelValue, v-model *</td>
<td>Number</td>
<td>(required)</td>
<td>
<p>The model that the slider value syncs to. Changing this value will update the slider.</p>
<p>If you are not using <code>v-model</code>, you should listen for the <code>update:modelValue</code> event and update <code>modelValue</code>.</p>
</td>
</tr>
<tr>
<td>icon</td>
<td>String</td>
<td></td>
<td>
<p>The slider icon. Can be any of the <a href="path_to_url" target="_blank" rel="noopener">Material Icons</a>.</p>
<p>You can also use the <code>icon</code> slot to show a custom or SVG icon.</p>
</td>
</tr>
<tr>
<td>min</td>
<td>Number</td>
<td><code>0</code></td>
<td>The minimum slider value.</td>
</tr>
<tr>
<td>max</td>
<td>Number</td>
<td><code>100</code></td>
<td>The maximum slider value.</td>
</tr>
<tr>
<td>step</td>
<td>Number</td>
<td><code>10</code></td>
<td>The amount to increment or decrement the slider value by when using the keyboard arrow keys. Also determines the snap points on the slider when <code>snapToSteps</code> is <code>true</code>.</td>
</tr>
<tr>
<td>snapToSteps</td>
<td>Boolean</td>
<td><code>false</code></td>
<td>Whether or not the slider value should be snapped to discrete steps. Setting to <code>true</code> will ensure that the value is always a multiple of the <code>step</code> prop when a drag is completed.</td>
</tr>
<tr>
<td>showMarker</td>
<td>Boolean</td>
<td><code>false</code></td>
<td>Whether or not to show a marker (like a tooltip) above the slider which shows the current value. The value shown can be customized using the <code>markerValue</code> prop.</td>
</tr>
<tr>
<td>markerValue</td>
<td>Number, String</td>
<td></td>
<td>The value shown in the marker when <code>showMarker</code> is <code>true</code>. If not provided and <code>showMarker</code> is <code>true</code>, the slider's value is shown in the marker.</td>
</tr>
<tr>
<td>tabindex</td>
<td>Number, String</td>
<td></td>
<td>The slider input <code>tabindex</code>.</td>
</tr>
<tr>
<td>disabled</td>
<td>Boolean</td>
<td><code>false</code></td>
<td>
<p>Whether or not the slider is disabled.</p>
<p>Set to <code>true</code> to disable the slider.</p>
</td>
</tr>
</tbody>
</table>
</div>
* Required prop
</ui-tab>
<ui-tab title="Slots">
<div class="table-responsive">
<table class="table">
<thead>
<tr>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td>icon</td>
<td>Holds the slider icon and can be used to show a custom or SVG icon.</td>
</tr>
</tbody>
</table>
</div>
</ui-tab>
<ui-tab title="Events">
<div class="table-responsive">
<table class="table">
<thead>
<tr>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td>focus</td>
<td>
<p>Emitted when the slider is focused.</p>
<p>Listen for it using <code>@focus</code>.</p>
</td>
</tr>
<tr>
<td>blur</td>
<td>
<p>Emitted when the slider loses focus.</p>
<p>Listen for it using <code>@blur</code>.</p>
</td>
</tr>
<tr>
<td>update:modelValue</td>
<td>
<p>Emitted when the slider value is changed. The handler is called with the new value.</p>
<p>If you are not using <code>v-model</code>, you should listen for this event and update the <code>modelValue</code> prop.</p>
<p>Listen for it using <code>@update:modelValue</code>.</p>
</td>
</tr>
<tr>
<td>change</td>
<td>
<p>Emitted when the value of the slider is changed. The handler is called with the new value.</p>
<p>Listen for it using <code>@change</code>.</p>
</td>
</tr>
<tr>
<td>dragstart</td>
<td>
<p>Emitted when the user starts dragging the slider thumb. The handler is called with the current value and the drag event object.</p>
<p>Listen for it using <code>@dragstart</code>.</p>
</td>
</tr>
<tr>
<td>dragend</td>
<td>
<p>Emitted when the user stops dragging the slider thumb. The handler is called with the current value and the drag event object.</p>
<p>Listen for it using <code>@dragend</code>.</p>
</td>
</tr>
</tbody>
</table>
</div>
</ui-tab>
<ui-tab title="Methods">
<div class="table-responsive">
<table class="table">
<thead>
<tr>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><code>focus()</code></td>
<td>
<p>Call this method to programmatically focus the slider.</p>
</td>
</tr>
<tr>
<td><code>reset()</code></td>
<td>Call this method to reset the slider's value to its initial value.</td>
</tr>
</tbody>
</table>
</div>
</ui-tab>
</ui-tabs>
</section>
</template>
<script>
import UiButton from '@/UiButton.vue';
import UiModal from '@/UiModal.vue';
import UiSlider from '@/UiSlider.vue';
import UiTab from '@/UiTab.vue';
import UiTabs from '@/UiTabs.vue';
export default {
components: {
UiButton,
UiModal,
UiSlider,
UiTab,
UiTabs
},
data() {
return {
slider1: 25,
slider2: 50,
slider3: 60,
slider4: 8,
slider5: 40,
slider6: 75,
slider7: 30
};
},
methods: {
resetSliders() {
this.slider1 = 25;
this.slider2 = 50;
this.slider3 = 60;
this.slider4 = 7;
this.slider5 = 40;
this.slider6 = 75;
this.slider7 = 30;
},
openModal() {
this.$refs.modal.open();
}
}
};
</script>
<style lang="scss">
@import '@/styles/imports';
.page--ui-slider {
.page__examples {
max-width: rem(500px);
}
.ui-slider {
margin-bottom: rem(8px);
}
.reset-sliders .ui-button {
margin-top: rem(36px);
}
}
</style>
```
|
```css
/**/
footer.text-muted {
position: fixed;
bottom: 0;
z-index: 1000;
width: 100%;
background-color: #FFF;
}
body {
font-family: "Microsoft YaHei";
}
.ztree li span.button.root_close {
background-position: -126px -23px;
}
.ztree li span.button.root_open {
background-position: -106px -23px;
}
::-webkit-scrollbar {
width: 10px;
height: 10px;
background-color: #F5F5F5;
}
/* +*/
::-webkit-scrollbar-track {
-webkit-box-shadow: inset 0 0 6px rgba(0, 0, 0, 0.3);
border-radius: 10px;
background-color: #F5F5F5;
}
/* +*/
::-webkit-scrollbar-thumb {
border-radius: 10px;
-webkit-box-shadow: inset 0 0 6px rgba(0, 0, 0, .3);
background-color: #555;
}
textarea {
resize: none;
}
table tbody td span {
cursor: pointer;
}
a, a:hover, a:focus {
color: #333;
}
ul {
padding: 0;
}
li {
list-style: none;
}
/**/
.navigation > li > ul li:last-child {
padding-bottom: 0;
}
.navigation > li > ul li:first-child {
padding-top: 0;
}
.navigation-main li > ul, .navigation-main ul > li > a {
position: relative;
}
.navigation-main li > ul:before {
content: "";
display: block;
position: absolute;
z-index: 1;
left: 28px;
top: 20px;
bottom: 20px;
border-left: 1px solid #425668;
}
.navigation-main > li > ul > li > ul:before {
left: 55px;
}
.navigation-main > li > ul > li > ul > li > ul:before {
left: 80px;
}
.navigation-main ul > li > a:before {
content: "";
display: inline-block;
position: absolute;
width: 8px;
height: 8px;
border-radius: 4px !important;
left: 24px;
top: 17px;
background-color: #425668;
z-index: 2;
}
.navigation-main > li > ul > li > ul > li > a:before {
left: 51px;
}
.navigation-main > li > ul > li > ul > li > ul > li > a:before {
left: 76px;
}
.navigation>li:nth-child(2),.navigation>li:nth-child(3),.navigation>li:nth-child(4),
.navigation>li:nth-child(5),.navigation>li:nth-child(6){
}
/**/
.has-feedback.search {
top: 8px;
}
.search.has-feedback .form-control {
height: 30px;
line-height: 30px;
min-width: 220px;
}
.search .form-control-feedback {
height: 30px;
line-height: 30px;
}
/**/
.control-label .text-danger {
/* margin-left: 2px; */
}
/**/
.modal .modal-dialog {
margin-top: 120px;
}
.modal-header {
padding: 10px 15px;
border-bottom: 1px solid #eee;
}
.modal-header .close {
top: 30%;
}
.modal-body .deleteText {
font-size: 16px;
}
#timedTaskDelete .modal-dialog {
margin-top: 20%;
}
/**/
.tooltip-inner {
white-space: nowrap;
}
.tooltip.top {
left: -17px !important;
}
/**/
.dataTables_filter input {
min-width: 200px;
}
.dataTables_filter .add-btn {
margin-right: 20px;
position: relative;
top: -3px;
}
.dataTables_filter .add-btn i {
margin-right: 5px;
position: relative;
top: -3px;
}
.selectboxit-container .selectboxit-options{
padding: 0;
}
.ztree {
padding: 5px;
}
.ztree li a, .ztree li a.curSelectedNode {
display: inline-block;
height: 26px;
line-height: 26px;
}
.ztree li a.curSelectedNode {
background-color: rgba(0, 0, 0, .1);
}
.ztree li span {
font-size: 14px;
}
.tree-editable {
padding: 10px;
}
.ztree li span.button.add, .ztree li span.button.edit, .ztree li span.button.remove {
vertical-align: middle;
}
.saveSet{
margin-bottom: 10px;
}
.saveSet i{
margin-right: 5px;
position: relative;
top:-2px;
}
/**/
.datepicker.dropdown-menu {
z-index: 1099;
}
.validation-error-label, .validation-valid-label {
margin-bottom:0px;
}
/* */
.loading {
position: fixed;
top: 0;
left: 0;
width: 100%;
height: 100%;
display: none;
z-index: 99999;
}
.loading_bg {
background-color: #000;
opacity: 0.5;
filter: alpha(opacity=50);
-moz-opacity: 0.5;
position: absolute;
top: 0;
left: 0;
right: 0;
height: 100%;
width: 100%;
}
.loading_mean {
width: 40px;
height: 40px;
background: #fff;
position: absolute;
top: 50%;
margin-top: -25px;
left: 50%;
margin-left: -25px;
border-radius: 5px;
text-align: center;
padding-top: 7px;
}
```
|
```smalltalk
using Microsoft.MixedReality.Toolkit.UI;
using UnityEditor;
using UnityEngine;
namespace Microsoft.MixedReality.Toolkit.Utilities.Editor
{
[CustomEditor(typeof(ToolTipConnector))]
public class ToolTipConnectorInspector : UnityEditor.Editor
{
private const string EditorSettingsFoldoutKey = "MRTK_ToolTipConnector_Inspector_EditorSettings";
private const string DrawManualDirectionHandleKey = "MRTK_ToopTipConnector_Inspector_DrawManualDirectionHandle";
private static bool editorSettingsFoldout = false;
private static float pivotDirectionControlWidth = 50;
private static float pivotDirectionControlHeight = 35;
private static bool DrawManualDirectionHandle = false;
protected ToolTipConnector connector;
private static readonly GUIContent EditorSettingsContent = new GUIContent("Editor Settings");
private static GUIStyle multiLineHelpBoxStyle;
private static float connectorPivotDirectionArrowLength = 1f;
private SerializedProperty connectorTarget;
private SerializedProperty connectorFollowType;
private SerializedProperty pivotMode;
private SerializedProperty pivotDirection;
private SerializedProperty pivotDirectionOrient;
private SerializedProperty manualPivotDirection;
private SerializedProperty manualPivotLocalPosition;
private SerializedProperty pivotDistance;
protected virtual void OnEnable()
{
DrawManualDirectionHandle = SessionState.GetBool(DrawManualDirectionHandleKey, DrawManualDirectionHandle);
editorSettingsFoldout = SessionState.GetBool(EditorSettingsFoldoutKey, editorSettingsFoldout);
connector = (ToolTipConnector)target;
serializedObject.ApplyModifiedProperties();
}
public override void OnInspectorGUI()
{
serializedObject.Update();
if (multiLineHelpBoxStyle == null)
{
multiLineHelpBoxStyle = new GUIStyle(EditorStyles.helpBox);
multiLineHelpBoxStyle.wordWrap = true;
}
connectorTarget = serializedObject.FindProperty("target");
connectorFollowType = serializedObject.FindProperty("connectorFollowType");
pivotMode = serializedObject.FindProperty("pivotMode");
pivotDirection = serializedObject.FindProperty("pivotDirection");
pivotDirectionOrient = serializedObject.FindProperty("pivotDirectionOrient");
manualPivotDirection = serializedObject.FindProperty("manualPivotDirection");
manualPivotLocalPosition = serializedObject.FindProperty("manualPivotLocalPosition");
pivotDistance = serializedObject.FindProperty("pivotDistance");
editorSettingsFoldout = EditorGUILayout.Foldout(editorSettingsFoldout, EditorSettingsContent, true);
SessionState.SetBool(EditorSettingsFoldoutKey, editorSettingsFoldout);
if (editorSettingsFoldout)
{
EditorGUI.BeginChangeCheck();
DrawManualDirectionHandle = EditorGUILayout.Toggle("Draw Manual Direction Handle", DrawManualDirectionHandle);
if (EditorGUI.EndChangeCheck())
{
SessionState.SetBool(DrawManualDirectionHandleKey, DrawManualDirectionHandle);
}
}
if (connectorTarget.objectReferenceValue == null)
{
EditorGUILayout.HelpBox("No target set. ToolTip will not use connector component.", MessageType.Info);
EditorGUILayout.PropertyField(connectorTarget);
}
else
{
EditorGUILayout.PropertyField(connectorTarget);
string helpText = string.Empty;
switch (connector.ConnectorFollowingType)
{
case ConnectorFollowType.AnchorOnly:
helpText = "Only the tooltip's anchor will follow the target. Tooltip content will not be altered.";
break;
case ConnectorFollowType.Position:
helpText = "The entire tooltip will follow the target. Tooltip will not rotate.";
break;
case ConnectorFollowType.PositionAndYRotation:
helpText = "The entire tooltip will follow the target. Tooltip will match target's Y rotation.";
break;
case ConnectorFollowType.PositionAndXYRotation:
helpText = "The entire tooltip will follow the target. Tooltip will match target's X and Y rotation.";
break;
}
EditorGUILayout.BeginVertical(EditorStyles.helpBox);
EditorGUILayout.LabelField(helpText, EditorStyles.miniLabel);
EditorGUILayout.EndVertical();
EditorGUILayout.PropertyField(connectorFollowType);
switch (connector.ConnectorFollowingType)
{
case ConnectorFollowType.AnchorOnly:
// Pivot mode doesn't apply to anchor-only connections
break;
default:
EditorGUILayout.PropertyField(pivotMode);
switch (connector.PivotMode)
{
case ConnectorPivotMode.Manual:
// We just want to set the pivot ourselves
EditorGUILayout.BeginVertical(EditorStyles.helpBox);
EditorGUILayout.LabelField("Pivot will not be altered by connector.", EditorStyles.miniLabel);
EditorGUILayout.EndVertical();
break;
case ConnectorPivotMode.Automatic:
EditorGUILayout.PropertyField(pivotDirectionOrient);
switch (connector.PivotDirectionOrient)
{
case ConnectorOrientType.OrientToCamera:
EditorGUILayout.BeginVertical(EditorStyles.helpBox);
EditorGUILayout.LabelField("Pivot will be set in direction relative to camera.", EditorStyles.miniLabel);
EditorGUILayout.EndVertical();
break;
case ConnectorOrientType.OrientToObject:
EditorGUILayout.BeginVertical(EditorStyles.helpBox);
EditorGUILayout.LabelField("Pivot will be set in direction relative to target.", EditorStyles.miniLabel);
EditorGUILayout.EndVertical();
break;
}
ConnectorPivotDirection newPivotDirection = DrawPivotDirection(connector.PivotDirection);
pivotDirection.intValue = (int)newPivotDirection;
switch (connector.PivotDirection)
{
case ConnectorPivotDirection.Manual:
EditorGUILayout.PropertyField(manualPivotDirection);
break;
default:
break;
}
EditorGUILayout.PropertyField(pivotDistance);
break;
case ConnectorPivotMode.LocalPosition:
EditorGUILayout.BeginVertical(EditorStyles.helpBox);
EditorGUILayout.LabelField("Pivot will be set to position relative to target.", EditorStyles.miniLabel);
EditorGUILayout.EndVertical();
EditorGUILayout.PropertyField(manualPivotLocalPosition);
break;
}
break;
}
}
serializedObject.ApplyModifiedProperties();
}
public override bool RequiresConstantRepaint()
{
return true;
}
private ConnectorPivotDirection DrawPivotDirection(ConnectorPivotDirection selection)
{
EditorGUILayout.Space();
EditorGUILayout.BeginHorizontal();
GUILayout.FlexibleSpace();
EditorGUILayout.BeginVertical();
selection = DrawPivotDirectionButton(ConnectorPivotDirection.Manual, "Manual", selection, 3);
EditorGUILayout.BeginHorizontal();
selection = DrawPivotDirectionButton(ConnectorPivotDirection.Northeast, "NE", selection);
selection = DrawPivotDirectionButton(ConnectorPivotDirection.North, "North", selection);
selection = DrawPivotDirectionButton(ConnectorPivotDirection.Northwest, "NW", selection);
EditorGUILayout.EndHorizontal();
EditorGUILayout.BeginHorizontal();
selection = DrawPivotDirectionButton(ConnectorPivotDirection.East, "East", selection);
selection = DrawPivotDirectionButton(ConnectorPivotDirection.InFront, "Front", selection);
selection = DrawPivotDirectionButton(ConnectorPivotDirection.West, "West", selection);
EditorGUILayout.EndHorizontal();
EditorGUILayout.BeginHorizontal();
selection = DrawPivotDirectionButton(ConnectorPivotDirection.Southeast, "SE", selection);
selection = DrawPivotDirectionButton(ConnectorPivotDirection.South, "South", selection);
selection = DrawPivotDirectionButton(ConnectorPivotDirection.Southwest, "SW", selection);
EditorGUILayout.EndHorizontal();
EditorGUILayout.EndVertical();
GUILayout.FlexibleSpace();
EditorGUILayout.EndHorizontal();
EditorGUILayout.Space();
return selection;
}
private ConnectorPivotDirection DrawPivotDirectionButton(ConnectorPivotDirection direction, string displayName, ConnectorPivotDirection selection, float widthMultiplier = 1)
{
GUI.color = (direction == selection) ? Color.white : Color.gray;
if (GUILayout.Button(
displayName,
EditorStyles.miniButtonMid,
GUILayout.MinWidth(pivotDirectionControlWidth * widthMultiplier),
GUILayout.MinHeight(pivotDirectionControlHeight),
GUILayout.MaxWidth(pivotDirectionControlWidth * widthMultiplier),
GUILayout.MaxHeight(pivotDirectionControlHeight)))
{
return direction;
}
GUI.color = Color.white;
return selection;
}
protected virtual void OnSceneGUI()
{
if (connector.Target == null)
return;
ToolTip toolTip = connector.GetComponent<ToolTip>();
if (toolTip == null)
return;
switch (connector.PivotMode)
{
case ConnectorPivotMode.Automatic:
switch (connector.PivotDirection)
{
case ConnectorPivotDirection.Manual:
// If we're using an automatic / manual combination, draw a handle that lets us set a manual pivot direction
Transform targetTransform = connector.Target.transform;
Vector3 targetPosition = targetTransform.position;
Vector3 pivotPosition = toolTip.PivotPosition;
float handleSize = HandleUtility.GetHandleSize(pivotPosition) * connectorPivotDirectionArrowLength;
Handles.color = MixedRealityInspectorUtility.LineVelocityColor;
Handles.ArrowHandleCap(0, pivotPosition, Quaternion.LookRotation(connector.ManualPivotDirection, targetTransform.up), handleSize, EventType.Repaint);
Vector3 newPivotPosition = Handles.PositionHandle(pivotPosition, targetTransform.rotation);
if ((newPivotPosition - pivotPosition).sqrMagnitude > 0)
{
manualPivotDirection = serializedObject.FindProperty("manualPivotDirection");
manualPivotDirection.vector3Value = (newPivotPosition - targetPosition).normalized;
serializedObject.ApplyModifiedProperties();
}
break;
default:
break;
}
break;
default:
break;
}
}
}
}
```
|
```java
package com.baronzhang.android.library.util.system;
import android.app.Activity;
import android.view.Window;
import android.view.WindowManager;
import java.lang.reflect.Field;
/**
* @author baronzhang (baron[dot]zhanglei[at]gmail[dot]com)
* 2017/6/2
*/
class FlymeHelper implements SystemHelper {
/**
*
* Flyme
*
* @param isFontColorDark
* @return boolean true
*/
@Override
public boolean setStatusBarLightMode(Activity activity, boolean isFontColorDark) {
Window window = activity.getWindow();
boolean result = false;
if (window != null) {
try {
WindowManager.LayoutParams lp = window.getAttributes();
Field darkFlag = WindowManager.LayoutParams.class
.getDeclaredField("MEIZU_FLAG_DARK_STATUS_BAR_ICON");
Field flymeFlags = WindowManager.LayoutParams.class
.getDeclaredField("meizuFlags");
darkFlag.setAccessible(true);
flymeFlags.setAccessible(true);
int bit = darkFlag.getInt(null);
int value = flymeFlags.getInt(lp);
if (isFontColorDark) {
value |= bit;
} else {
value &= ~bit;
}
flymeFlags.setInt(lp, value);
window.setAttributes(lp);
result = true;
} catch (Exception e) {
e.printStackTrace();
}
}
return result;
}
}
```
|
The 2000 Asian Speed Skating Championships were held between 14 January and 15 January 2000 at Handgait Ice Rink in Ulan Bator, Mongolia.
Women championships
Day 1
Day 2
Allround Results
Men championships
Day 1
Day 2
Allround Results
References
Men's result
Women's result
Asian Speed Skating Championships
2000 in speed skating
International speed skating competitions hosted by Mongolia
Sports competitions in Ulaanbaatar
Asian Speed Skating Championships
20th century in Ulaanbaatar
|
```objective-c
// 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
#ifndef KUDU_FS_BLOCK_ID_H
#define KUDU_FS_BLOCK_ID_H
#include <cinttypes>
#include <cstddef>
#include <cstdint>
#include <iosfwd>
#include <string>
#include <unordered_set>
#include <vector>
#include "kudu/gutil/stringprintf.h"
namespace kudu {
class BlockIdPB;
class BlockId {
public:
BlockId()
: id_(kInvalidId) {
}
explicit BlockId(uint64_t id) {
SetId(id);
}
void SetId(uint64_t id) {
id_ = id;
}
bool IsNull() const { return id_ == kInvalidId; }
std::string ToString() const {
return StringPrintf("%016" PRIu64, id_);
}
bool operator==(const BlockId& other) const {
return id_ == other.id_;
}
bool operator!=(const BlockId& other) const {
return id_ != other.id_;
}
bool operator<(const BlockId& other) const {
return id_ < other.id_;
}
// Returns the raw ID. Use with care; in most cases the BlockId should be
// treated as a completely opaque value.
uint64_t id() const { return id_; }
// Join the given block IDs with ','. Useful for debug printouts.
static std::string JoinStrings(const std::vector<BlockId>& blocks);
void CopyToPB(BlockIdPB* pb) const;
static BlockId FromPB(const BlockIdPB& pb);
private:
static const uint64_t kInvalidId;
uint64_t id_;
};
std::ostream& operator<<(std::ostream& o, const BlockId& block_id);
struct BlockIdHash {
size_t operator()(const BlockId& block_id) const {
return block_id.id();
}
};
struct BlockIdCompare {
bool operator()(const BlockId& first, const BlockId& second) const {
return first < second;
}
};
struct BlockIdEqual {
bool operator()(const BlockId& first, const BlockId& second) const {
return first == second;
}
};
typedef std::unordered_set<BlockId, BlockIdHash, BlockIdEqual> BlockIdSet;
typedef std::vector<BlockId> BlockIdContainer;
} // namespace kudu
#endif /* KUDU_FS_BLOCK_ID_H */
```
|
```smalltalk
/*
This file is part of the iText (R) project.
Authors: Apryse Software.
This program is offered under a commercial and under the AGPL license.
For commercial licensing, contact us at path_to_url For AGPL licensing, see below.
AGPL licensing:
This program is free software: you can redistribute it and/or modify
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with this program. If not, see <path_to_url
*/
using System;
using System.IO;
using iText.Commons.Bouncycastle.Cert;
using iText.Commons.Bouncycastle.Crypto;
using iText.Kernel.Crypto;
using iText.Kernel.Pdf;
namespace iText.Kernel.Crypto.Securityhandler {
public class PubSecHandlerUsingStandard40 : PubKeySecurityHandler {
public PubSecHandlerUsingStandard40(PdfDictionary encryptionDictionary, IX509Certificate[] certs, int[] permissions
, bool encryptMetadata, bool embeddedFilesOnly) {
InitKeyAndFillDictionary(encryptionDictionary, certs, permissions, encryptMetadata, embeddedFilesOnly);
}
public PubSecHandlerUsingStandard40(PdfDictionary encryptionDictionary, IPrivateKey certificateKey, IX509Certificate
certificate, bool encryptMetadata) {
InitKeyAndReadDictionary(encryptionDictionary, certificateKey, certificate, encryptMetadata);
}
public override OutputStreamEncryption GetEncryptionStream(Stream os) {
return new OutputStreamStandardEncryption(os, nextObjectKey, 0, nextObjectKeySize);
}
public override IDecryptor GetDecryptor() {
return new StandardDecryptor(nextObjectKey, 0, nextObjectKeySize);
}
protected internal override String GetDigestAlgorithm() {
return "SHA-1";
}
protected internal override void InitKey(byte[] globalKey, int keyLength) {
mkey = new byte[keyLength / 8];
Array.Copy(globalKey, 0, mkey, 0, mkey.Length);
}
protected internal override void SetPubSecSpecificHandlerDicEntries(PdfDictionary encryptionDictionary, bool
encryptMetadata, bool embeddedFilesOnly) {
encryptionDictionary.Put(PdfName.Filter, PdfName.Adobe_PubSec);
encryptionDictionary.Put(PdfName.R, new PdfNumber(2));
PdfArray recipients = CreateRecipientsArray();
encryptionDictionary.Put(PdfName.V, new PdfNumber(1));
encryptionDictionary.Put(PdfName.SubFilter, PdfName.Adbe_pkcs7_s4);
encryptionDictionary.Put(PdfName.Recipients, recipients);
}
}
}
```
|
```makefile
libavcodec/flashsv.o: libavcodec/flashsv.c libavutil/intreadwrite.h \
libavutil/avconfig.h libavutil/attributes.h libavutil/bswap.h config.h \
libavcodec/avcodec.h libavutil/samplefmt.h libavutil/avutil.h \
libavutil/common.h libavutil/macros.h libavutil/version.h \
libavutil/intmath.h libavutil/mem.h libavutil/error.h \
libavutil/internal.h libavutil/timer.h libavutil/log.h libavutil/cpu.h \
libavutil/dict.h libavutil/pixfmt.h libavutil/libm.h \
libavutil/intfloat.h libavutil/mathematics.h libavutil/rational.h \
libavutil/attributes.h libavutil/avutil.h libavutil/buffer.h \
libavutil/cpu.h libavutil/channel_layout.h libavutil/dict.h \
libavutil/frame.h libavutil/buffer.h libavutil/samplefmt.h \
libavutil/log.h libavutil/pixfmt.h libavutil/rational.h \
libavcodec/version.h libavutil/version.h libavcodec/bytestream.h \
libavutil/avassert.h libavutil/common.h libavcodec/get_bits.h \
libavcodec/mathops.h libavcodec/vlc.h libavcodec/internal.h \
libavutil/mathematics.h
```
|
Deer Creek Township is one of fourteen townships in Carroll County, Indiana. As of the 2010 census, its population was 4,571 and it contained 1,970 housing units.
History
Deer Creek Township was organized in 1828.
The Baum-Shaeffer Farm, Carrollton Bridge, Deer Creek Valley Rural Historic District, Delphi Lime Kilns, Lock No. 33 Lock Keeper's House, and Wabash and Erie Canal Lock No. 33, Fred and Minnie Raber Farm, Sunset Point, and Wilson Bridge are listed on the National Register of Historic Places.
Geography
According to the 2010 census, the township has a total area of , of which (or 99.45%) is land and (or 0.55%) is water.
Cities and towns
Delphi (the county seat)
Unincorporated towns
Harley (extinct)
Adjacent townships
Adams (north)
Rock Creek (northeast)
Jackson (east)
Monroe (southeast)
Madison (south)
Washington Township, Tippecanoe County (southwest)
Tippecanoe (west)
Tippecanoe Township, Tippecanoe County (west)
Major highways
U.S. Route 421
Indiana State Road 18
Indiana State Road 25
Indiana State Road 218
Cemeteries
The township contains eight cemeteries: Bostetter, Delphi, Mears, Robinson, Saint Josephs, Sharp Point, Whistler and Wingard.
References
United States Census Bureau cartographic boundary files
External links
Indiana Township Association
United Township Association of Indiana
Townships in Carroll County, Indiana
Lafayette metropolitan area, Indiana
Townships in Indiana
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.