text
stringlengths 1
22.8M
|
|---|
```smalltalk
using System;
using System.Collections.Generic;
using System.Collections.Specialized;
using CoreGraphics;
using Foundation;
using UIKit;
namespace Xamarin.Forms.Platform.iOS
{
public class CarouselViewController : ItemsViewController<CarouselView>
{
protected readonly CarouselView Carousel;
CarouselViewLoopManager _carouselViewLoopManager;
bool _initialPositionSet;
bool _updatingScrollOffset;
List<View> _oldViews;
int _gotoPosition = -1;
CGSize _size;
ILoopItemsViewSource LoopItemsSource => ItemsSource as ILoopItemsViewSource;
bool _isDragging;
public CarouselViewController(CarouselView itemsView, ItemsViewLayout layout) : base(itemsView, layout)
{
Carousel = itemsView;
CollectionView.AllowsSelection = false;
CollectionView.AllowsMultipleSelection = false;
Carousel.PropertyChanged += CarouselViewPropertyChanged;
Carousel.Scrolled += CarouselViewScrolled;
_oldViews = new List<View>();
}
public override UICollectionViewCell GetCell(UICollectionView collectionView, NSIndexPath indexPath)
{
UICollectionViewCell cell;
if (Carousel?.Loop == true && _carouselViewLoopManager != null)
{
var cellAndCorrectedIndex = _carouselViewLoopManager.GetCellAndCorrectIndex(collectionView, indexPath, DetermineCellReuseId());
cell = cellAndCorrectedIndex.cell;
var correctedIndexPath = NSIndexPath.FromRowSection(cellAndCorrectedIndex.correctedIndex, 0);
if (cell is DefaultCell defaultCell)
UpdateDefaultCell(defaultCell, correctedIndexPath);
if (cell is TemplatedCell templatedCell)
UpdateTemplatedCell(templatedCell, correctedIndexPath);
}
else
{
cell = base.GetCell(collectionView, indexPath);
}
var element = (cell as TemplatedCell)?.VisualElementRenderer?.Element;
if (element != null)
VisualStateManager.GoToState(element, CarouselView.DefaultItemVisualState);
return cell;
}
public override nint GetItemsCount(UICollectionView collectionView, nint section) => LoopItemsSource.LoopCount;
public override void ViewDidLoad()
{
_carouselViewLoopManager = new CarouselViewLoopManager(Layout as UICollectionViewFlowLayout);
base.ViewDidLoad();
}
public override void ViewWillLayoutSubviews()
{
base.ViewWillLayoutSubviews();
UpdateVisualStates();
}
public override void ViewDidLayoutSubviews()
{
base.ViewDidLayoutSubviews();
if (Carousel?.Loop == true && _carouselViewLoopManager != null)
{
_updatingScrollOffset = true;
_carouselViewLoopManager.CenterIfNeeded(CollectionView, IsHorizontal);
_updatingScrollOffset = false;
}
if (CollectionView.Bounds.Size != _size)
{
_size = CollectionView.Bounds.Size;
BoundsSizeChanged();
}
else
{
UpdateInitialPosition();
}
}
void BoundsSizeChanged()
{
//if the size changed center the item
Carousel.ScrollTo(Carousel.Position, position: Xamarin.Forms.ScrollToPosition.Center, animate: false);
}
public override void DraggingStarted(UIScrollView scrollView)
{
_isDragging = true;
Carousel.SetIsDragging(true);
}
public override void DraggingEnded(UIScrollView scrollView, bool willDecelerate)
{
Carousel.SetIsDragging(false);
_isDragging = false;
}
public override void UpdateItemsSource()
{
UnsubscribeCollectionItemsSourceChanged(ItemsSource);
base.UpdateItemsSource();
//we don't need to Subscribe because base calls CreateItemsViewSource
_carouselViewLoopManager?.SetItemsSource(LoopItemsSource);
if (_initialPositionSet)
{
Carousel.SetValueFromRenderer(CarouselView.CurrentItemProperty, null);
Carousel.SetValueFromRenderer(CarouselView.PositionProperty, 0);
}
_initialPositionSet = false;
UpdateInitialPosition();
}
protected override bool IsHorizontal => (Carousel?.ItemsLayout)?.Orientation == ItemsLayoutOrientation.Horizontal;
protected override UICollectionViewDelegateFlowLayout CreateDelegator() => new CarouselViewDelegator(ItemsViewLayout, this);
protected override string DetermineCellReuseId()
{
if (Carousel.ItemTemplate != null)
return CarouselTemplatedCell.ReuseId;
return base.DetermineCellReuseId();
}
protected override void RegisterViewTypes()
{
CollectionView.RegisterClassForCell(typeof(CarouselTemplatedCell), CarouselTemplatedCell.ReuseId);
base.RegisterViewTypes();
}
protected override IItemsViewSource CreateItemsViewSource()
{
var itemsSource = ItemsSourceFactory.CreateForCarouselView(Carousel.ItemsSource, this, Carousel.Loop);
_carouselViewLoopManager?.SetItemsSource(itemsSource);
SubscribeCollectionItemsSourceChanged(itemsSource);
return itemsSource;
}
protected override void CacheCellAttributes(NSIndexPath indexPath, CGSize size)
{
var itemIndex = GetIndexFromIndexPath(indexPath);
base.CacheCellAttributes(NSIndexPath.FromItemSection(itemIndex, 0), size);
}
internal void TearDown()
{
Carousel.PropertyChanged -= CarouselViewPropertyChanged;
Carousel.Scrolled -= CarouselViewScrolled;
UnsubscribeCollectionItemsSourceChanged(ItemsSource);
_carouselViewLoopManager?.Dispose();
_carouselViewLoopManager = null;
}
internal void UpdateIsScrolling(bool isScrolling) => Carousel.IsScrolling = isScrolling;
internal NSIndexPath GetScrollToIndexPath(int position)
{
if (Carousel?.Loop == true && _carouselViewLoopManager != null)
return _carouselViewLoopManager.GetGoToIndex(CollectionView, position);
return NSIndexPath.FromItemSection(position, 0);
}
internal int GetIndexFromIndexPath(NSIndexPath indexPath)
{
if (Carousel?.Loop == true && _carouselViewLoopManager != null)
return _carouselViewLoopManager.GetCorrectedIndexFromIndexPath(indexPath);
return indexPath.Row;
}
void CarouselViewScrolled(object sender, ItemsViewScrolledEventArgs e)
{
if (_updatingScrollOffset)
return;
if (_isDragging)
{
return;
}
SetPosition(e.CenterItemIndex);
UpdateVisualStates();
}
int _positionAfterUpdate = -1;
void CollectionViewUpdating(object sender, NotifyCollectionChangedEventArgs e)
{
int carouselPosition = Carousel.Position;
_positionAfterUpdate = carouselPosition;
var currentItemPosition = ItemsSource.GetIndexForItem(Carousel.CurrentItem).Row;
var count = ItemsSource.ItemCount;
if (e.Action == NotifyCollectionChangedAction.Remove)
_positionAfterUpdate = GetPositionWhenRemovingItems(e.OldStartingIndex, carouselPosition, currentItemPosition, count);
if (e.Action == NotifyCollectionChangedAction.Reset)
_positionAfterUpdate = GetPositionWhenResetItems();
if (e.Action == NotifyCollectionChangedAction.Add)
_positionAfterUpdate = GetPositionWhenAddingItems(carouselPosition, currentItemPosition);
}
void CollectionViewUpdated(object sender, NotifyCollectionChangedEventArgs e)
{
if (_positionAfterUpdate == -1)
{
return;
}
_gotoPosition = -1;
var targetPosition = _positionAfterUpdate;
_positionAfterUpdate = -1;
SetPosition(targetPosition);
SetCurrentItem(targetPosition);
}
int GetPositionWhenAddingItems(int carouselPosition, int currentItemPosition)
{
//If we are adding a new item make sure to maintain the CurrentItemPosition
return currentItemPosition != -1 ? currentItemPosition : carouselPosition;
}
int GetPositionWhenResetItems()
{
//If we are reseting the collection Position should go to 0
Carousel.SetValueFromRenderer(CarouselView.CurrentItemProperty, null);
return 0;
}
int GetPositionWhenRemovingItems(int oldStartingIndex, int carouselPosition, int currentItemPosition, int count)
{
bool removingCurrentElement = currentItemPosition == -1;
bool removingFirstElement = oldStartingIndex == 0;
bool removingLastElement = oldStartingIndex == count;
bool removingCurrentElementAndLast = removingCurrentElement && removingLastElement && Carousel.Position > 0;
if (removingCurrentElementAndLast)
{
//If we are removing the last element update the position
carouselPosition = Carousel.Position - 1;
}
else if (removingFirstElement && !removingCurrentElement)
{
//If we are not removing the current element set position to the CurrentItem
carouselPosition = currentItemPosition;
}
return carouselPosition;
}
void SubscribeCollectionItemsSourceChanged(IItemsViewSource itemsSource)
{
if (itemsSource is ObservableItemsSource newItemsSource)
{
newItemsSource.CollectionViewUpdating += CollectionViewUpdating;
newItemsSource.CollectionViewUpdated += CollectionViewUpdated;
}
}
void UnsubscribeCollectionItemsSourceChanged(IItemsViewSource oldItemsSource)
{
if (oldItemsSource is ObservableItemsSource oldObservableItemsSource)
{
oldObservableItemsSource.CollectionViewUpdating -= CollectionViewUpdating;
oldObservableItemsSource.CollectionViewUpdated -= CollectionViewUpdated;
}
}
void CarouselViewPropertyChanged(object sender, System.ComponentModel.PropertyChangedEventArgs changedProperty)
{
if (changedProperty.Is(CarouselView.PositionProperty))
UpdateFromPosition();
else if (changedProperty.Is(CarouselView.CurrentItemProperty))
UpdateFromCurrentItem();
else if (changedProperty.Is(CarouselView.LoopProperty))
UpdateLoop();
}
void UpdateLoop()
{
var carouselPosition = Carousel.Position;
if (LoopItemsSource != null)
LoopItemsSource.Loop = Carousel.Loop;
CollectionView.ReloadData();
ScrollToPosition(carouselPosition, carouselPosition, false, true);
}
void ScrollToPosition(int goToPosition, int carouselPosition, bool animate, bool forceScroll = false)
{
if (Carousel.Loop)
carouselPosition = _carouselViewLoopManager?.GetCorrectPositionForCenterItem(CollectionView) ?? -1;
//no center item found, collection could be empty
//also if we are dragging we don't need to ScrollTo
if (Carousel.IsDragging || carouselPosition == -1)
return;
if (_gotoPosition == -1 && (goToPosition != carouselPosition || forceScroll))
{
_gotoPosition = goToPosition;
Carousel.ScrollTo(goToPosition, position: Xamarin.Forms.ScrollToPosition.Center, animate: animate);
}
}
void SetPosition(int position)
{
if (position == -1)
return;
//we arrived center
if (position == _gotoPosition)
_gotoPosition = -1;
//If _gotoPosition is != -1 we are scrolling to that possition
if (_gotoPosition == -1 && Carousel.Position != position)
Carousel.SetValueFromRenderer(CarouselView.PositionProperty, position);
}
void SetCurrentItem(int carouselPosition)
{
if (ItemsSource.ItemCount == 0)
return;
var item = GetItemAtIndex(NSIndexPath.FromItemSection(carouselPosition, 0));
Carousel.SetValueFromRenderer(CarouselView.CurrentItemProperty, item);
UpdateVisualStates();
}
void UpdateFromCurrentItem()
{
if (Carousel?.CurrentItem == null || ItemsSource == null || ItemsSource.ItemCount == 0)
return;
var currentItemPosition = GetIndexForItem(Carousel.CurrentItem).Row;
ScrollToPosition(currentItemPosition, Carousel.Position, Carousel.AnimateCurrentItemChanges);
UpdateVisualStates();
}
void UpdateFromPosition()
{
var itemsCount = ItemsSource?.ItemCount;
if (itemsCount == 0)
return;
var currentItemPosition = GetIndexForItem(Carousel.CurrentItem).Row;
var carouselPosition = Carousel.Position;
if (carouselPosition == _gotoPosition)
_gotoPosition = -1;
ScrollToPosition(carouselPosition, currentItemPosition, Carousel.AnimatePositionChanges);
SetCurrentItem(carouselPosition);
}
void UpdateInitialPosition()
{
var itemsCount = ItemsSource?.ItemCount;
if (itemsCount == 0)
return;
if (!_initialPositionSet)
{
_initialPositionSet = true;
int position = Carousel.Position;
var currentItem = Carousel.CurrentItem;
if (currentItem != null)
{
position = ItemsSource.GetIndexForItem(currentItem).Row;
}
else
{
SetCurrentItem(position);
}
Carousel.ScrollTo(position, -1, Xamarin.Forms.ScrollToPosition.Center, false);
}
UpdateVisualStates();
}
void UpdateVisualStates()
{
var cells = CollectionView.VisibleCells;
var newViews = new List<View>();
var carouselPosition = Carousel.Position;
var previousPosition = carouselPosition - 1;
var nextPosition = carouselPosition + 1;
foreach (var cell in cells)
{
if (!((cell as CarouselTemplatedCell)?.VisualElementRenderer?.Element is View itemView))
return;
var item = itemView.BindingContext;
var pos = ItemsSource.GetIndexForItem(item).Row;
if (pos == carouselPosition)
{
VisualStateManager.GoToState(itemView, CarouselView.CurrentItemVisualState);
}
else if (pos == previousPosition)
{
VisualStateManager.GoToState(itemView, CarouselView.PreviousItemVisualState);
}
else if (pos == nextPosition)
{
VisualStateManager.GoToState(itemView, CarouselView.NextItemVisualState);
}
else
{
VisualStateManager.GoToState(itemView, CarouselView.DefaultItemVisualState);
}
newViews.Add(itemView);
if (!Carousel.VisibleViews.Contains(itemView))
{
Carousel.VisibleViews.Add(itemView);
}
}
foreach (var itemView in _oldViews)
{
if (!newViews.Contains(itemView))
{
VisualStateManager.GoToState(itemView, CarouselView.DefaultItemVisualState);
if (Carousel.VisibleViews.Contains(itemView))
{
Carousel.VisibleViews.Remove(itemView);
}
}
}
_oldViews = newViews;
}
protected internal override void UpdateVisibility()
{
if (ItemsView.IsVisible)
{
CollectionView.Hidden = false;
}
else
{
CollectionView.Hidden = true;
}
}
}
class CarouselViewLoopManager : IDisposable
{
int _indexOffset = 0;
UICollectionViewFlowLayout _layout;
const int LoopCount = 3;
ILoopItemsViewSource _itemsSource;
bool _disposed;
public CarouselViewLoopManager(UICollectionViewFlowLayout layout)
{
if (layout == null)
throw new ArgumentNullException(nameof(layout), "LoopManager expects a UICollectionViewFlowLayout");
_layout = layout;
}
public void CenterIfNeeded(UICollectionView collectionView, bool isHorizontal)
{
if (isHorizontal)
CenterHorizontalIfNeeded(collectionView);
else
CenterVerticallyIfNeeded(collectionView);
}
protected virtual void Dispose(bool disposing)
{
if (!_disposed)
{
if (disposing)
{
_itemsSource = null;
}
_disposed = true;
}
}
public void Dispose()
{
Dispose(disposing: true);
GC.SuppressFinalize(this);
}
public (UICollectionViewCell cell, int correctedIndex) GetCellAndCorrectIndex(UICollectionView collectionView, NSIndexPath indexPath, string reuseId)
{
var cell = collectionView.DequeueReusableCell(reuseId, indexPath) as UICollectionViewCell;
var correctedIndex = GetCorrectedIndexFromIndexPath(indexPath);
return (cell, correctedIndex);
}
public int GetCorrectedIndexFromIndexPath(NSIndexPath indexPath)
{
return GetCorrectedIndex(indexPath.Row - _indexOffset);
}
public int GetCorrectPositionForCenterItem(UICollectionView collectionView)
{
NSIndexPath centerIndexPath = GetIndexPathForCenteredItem(collectionView);
if (centerIndexPath == null)
return -1;
return GetCorrectedIndexFromIndexPath(centerIndexPath);
}
public NSIndexPath GetGoToIndex(UICollectionView collectionView, int newPosition)
{
NSIndexPath centerIndexPath = GetIndexPathForCenteredItem(collectionView);
if (centerIndexPath == null)
return NSIndexPath.FromItemSection(0, 0);
var currentCarouselPosition = GetCorrectedIndexFromIndexPath(centerIndexPath);
var itemSourceCount = _itemsSource.ItemCount;
var diffToStart = currentCarouselPosition + (itemSourceCount - newPosition);
var diffToEnd = itemSourceCount - currentCarouselPosition + newPosition;
var increment = currentCarouselPosition - newPosition;
var incrementAbs = Math.Abs(increment);
int goToPosition;
if (diffToStart < incrementAbs)
goToPosition = centerIndexPath.Row - diffToStart;
else if (diffToEnd < incrementAbs)
goToPosition = centerIndexPath.Row + diffToEnd;
else
goToPosition = centerIndexPath.Row - increment;
NSIndexPath goToIndexPath = NSIndexPath.FromItemSection(goToPosition, 0);
return goToIndexPath;
}
public void SetItemsSource(ILoopItemsViewSource itemsSource) => _itemsSource = itemsSource;
void CenterVerticallyIfNeeded(UICollectionView collectionView)
{
var cellHeight = _layout.ItemSize.Height;
var cellPadding = 0;
var currentOffset = collectionView.ContentOffset;
var contentHeight = GetTotalContentHeight();
var boundsHeight = collectionView.Bounds.Size.Height;
if (contentHeight == 0 || cellHeight == 0)
return;
var centerOffsetY = (LoopCount * contentHeight - boundsHeight) / 2;
var distFromCenter = centerOffsetY - currentOffset.Y;
if (Math.Abs(distFromCenter) > (contentHeight / GetMinLoopCount()))
{
var cellcount = distFromCenter / (cellHeight + cellPadding);
var shiftCells = (int)((cellcount > 0) ? Math.Floor(cellcount) : Math.Ceiling(cellcount));
var offsetCorrection = (Math.Abs(cellcount) % 1.0) * (cellHeight + cellPadding);
if (collectionView.ContentOffset.Y < centerOffsetY)
{
collectionView.ContentOffset = new CGPoint(currentOffset.X, centerOffsetY - offsetCorrection);
}
else if (collectionView.ContentOffset.Y > centerOffsetY)
{
collectionView.ContentOffset = new CGPoint(currentOffset.X, centerOffsetY + offsetCorrection);
}
FinishCenterIfNeeded(collectionView, shiftCells);
}
}
void CenterHorizontalIfNeeded(UICollectionView collectionView)
{
var cellWidth = _layout.ItemSize.Width;
var cellPadding = 0;
var currentOffset = collectionView.ContentOffset;
var contentWidth = GetTotalContentWidth();
var boundsWidth = collectionView.Bounds.Size.Width;
if (contentWidth == 0 || cellWidth == 0)
return;
var centerOffsetX = (LoopCount * contentWidth - boundsWidth) / 2;
var distFromCentre = centerOffsetX - currentOffset.X;
if (Math.Abs(distFromCentre) > (contentWidth / GetMinLoopCount()))
{
var cellcount = distFromCentre / (cellWidth + cellPadding);
var shiftCells = (int)((cellcount > 0) ? Math.Floor(cellcount) : Math.Ceiling(cellcount));
var offsetCorrection = (Math.Abs(cellcount % 1.0f)) * (cellWidth + cellPadding);
if (collectionView.ContentOffset.X < centerOffsetX)
{
collectionView.ContentOffset = new CGPoint(centerOffsetX - offsetCorrection, currentOffset.Y);
}
else if (collectionView.ContentOffset.X > centerOffsetX)
{
collectionView.ContentOffset = new CGPoint(centerOffsetX + offsetCorrection, currentOffset.Y);
}
FinishCenterIfNeeded(collectionView, shiftCells);
}
}
void FinishCenterIfNeeded(UICollectionView collectionView, int shiftCells)
{
ShiftContentArray(shiftCells);
collectionView.ReloadData();
}
int GetCorrectedIndex(int indexToCorrect)
{
var itemsCount = GetItemsSourceCount();
if ((indexToCorrect < itemsCount && indexToCorrect >= 0) || itemsCount == 0)
return indexToCorrect;
var countInIndex = (double)(indexToCorrect / itemsCount);
var flooredValue = (int)(Math.Floor(countInIndex));
var offset = itemsCount * flooredValue;
var newIndex = indexToCorrect - offset;
if (newIndex < 0)
return (itemsCount - Math.Abs(newIndex));
return newIndex;
}
NSIndexPath GetIndexPathForCenteredItem(UICollectionView collectionView)
{
var centerPoint = new CGPoint(collectionView.Center.X + collectionView.ContentOffset.X, collectionView.Center.Y + collectionView.ContentOffset.Y);
var centerIndexPath = collectionView.IndexPathForItemAtPoint(centerPoint);
return centerIndexPath;
}
int GetMinLoopCount() => Math.Min(LoopCount, GetItemsSourceCount());
int GetItemsSourceCount() => _itemsSource.ItemCount;
nfloat GetTotalContentWidth() => GetItemsSourceCount() * _layout.ItemSize.Width;
nfloat GetTotalContentHeight() => GetItemsSourceCount() * _layout.ItemSize.Height;
void ShiftContentArray(int shiftCells)
{
var correctedIndex = GetCorrectedIndex(shiftCells);
_indexOffset += correctedIndex;
}
}
}
```
|
```nsis
Section "Uninstall"
# uninstall for all users
setShellVarContext all
# Delete (optionally) installed files
{{range $}}Delete $INSTDIR\{{.}}
{{end}}
Delete $INSTDIR\uninstall.exe
# Delete install directory
rmDir $INSTDIR
# Delete start menu launcher
Delete "$SMPROGRAMS\${APPNAME}\${APPNAME}.lnk"
Delete "$SMPROGRAMS\${APPNAME}\Attach.lnk"
Delete "$SMPROGRAMS\${APPNAME}\Uninstall.lnk"
rmDir "$SMPROGRAMS\${APPNAME}"
# Firewall - remove rules if exists
SimpleFC::AdvRemoveRule "Geth incoming peers (TCP:30303)"
SimpleFC::AdvRemoveRule "Geth outgoing peers (TCP:30303)"
SimpleFC::AdvRemoveRule "Geth UDP discovery (UDP:30303)"
# Remove IPC endpoint (path_to_url
${un.EnvVarUpdate} $0 "ETHEREUM_SOCKET" "R" "HKLM" "\\.\pipe\geth.ipc"
# Remove install directory from PATH
Push "$INSTDIR"
Call un.RemoveFromPath
# Cleanup registry (deletes all sub keys)
DeleteRegKey HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\${GROUPNAME} ${APPNAME}"
SectionEnd
```
|
```html
<html>
<head>
<title>libvorbisenc - Documentation</title>
<link rel=stylesheet href="style.css" type="text/css">
</head>
<body bgcolor=white text=black link="#5555ff" alink="#5555ff" vlink="#5555ff">
<table border=0 width=100%>
<tr>
<td><p class=tiny>libvorbisenc documentation</p></td>
<td align=right><p class=tiny>libvorbisenc version 1.3.2 - 20101101</p></td>
</tr>
</table>
<h1>Libvorbisenc Documentation</h1>
<p>
Libvorbisenc is a convenient API for setting up an encoding environment using libvorbis. Libvorbisenc encapsulates the actions needed to set up the encoder properly.
<p>
<a href="overview.html">libvorbisenc api overview</a><br>
<a href="reference.html">libvorbisenc api reference</a><br>
<a href="changes.html">libvorbisenc api changes from 1.0 and 1.0.1</a><br>
<a href="examples.html">libvorbisenc encode setup examples</a><br>
<br><br>
<hr noshade>
<table border=0 width=100%>
<tr valign=top>
<td><p class=tiny>copyright © 2000-2010 Xiph.Org</p></td>
<td align=right><p class=tiny><a href="path_to_url">Ogg Vorbis</a></p></td>
</tr><tr>
<td><p class=tiny>libvorbisenc documentation</p></td>
<td align=right><p class=tiny>libvorbisenc version 1.3.2 - 20101101</p></td>
</tr>
</table>
</body>
</html>
```
|
Gaoliangqiao () is a bridge situated in Haidian District, Beijing. It was first built in 1292 during the Yuan dynasty.
History
Kublai Khan built the bridge to meet the water needs of Beijing. He commissioned Guo Shoujing to dredge the water ways and construct a bridge. During the Ming and Qing dynasties, it formed part of the route between Beijing and the Western Hills. According to legend, the Sorghum River comes from the story about Zhe Gao. There was a river in the north side of the Xizhimen. It was said that both the Yuan emperor and Liu Bowen wanted to make the newly formed city of Dadu (now part of Beijing) the capital of China. However, Beijing was a sea of river at that time so, Liu threatened the Dragon King to move the water to another place. Days later, the Dragon King flew away with his wife. Liu ordered Gao Liang to arrest the King. Gao caught up with the Dragon King, but Gao drowned in the river during the ensuing battle. In commemoration of the hero, the people named the bridge after him.
References
Bridges in Beijing
|
Fung Hoi Man (, born 12 March 1977) is a Hong Kong football coach and a former player.
He holds an AFC A Licence and The FA International Coaching Licence.
Club career
Fung's club career was more or less unsuccessful. He played for Eastern and Sing Tao youth team before being promoted to the first team at Sing Tao. However, under great competition at the club, he failed to establish his position and thus moved on to his managerial career, where he found success.
He returned football playing career as he joined newly promoted side HKFC in 2006. However, he was forced to retire due to an anterior cruciate ligament injury.
Managerial career
Early career
He started managing Jockey Club Ti-I College football team in 1997. He then managed Diocesan Boys' School in 2000, at the same time when he was managing Jockey Club Ti-I College, leading Diocesan Boys' School gain promotion from Third Division to First Division in five years, as well as leading them as the champions of the All Hong Kong Schools Jing Ying Football Tournament in 2003, when they were still competing in Third Division. Due to his impressive results in managerial career, Hong Kong Third Division club Sham Shui Po invited him as the head coach of the club in 2002. He left the club after spending one season with them, as he joined Hong Kong 08 as an assistant coach, alongside famous coach Chan Hiu Ming.
Southern
He joined Southern in 2008 as a coach alongside Cheng Siu Chung. He brought the club to a success as he led the club gain promotion to the First Division for the first time in club history, as well as claiming the Hong Kong Junior Challenge Shield champions in 2011. Southern's first season in the First Division was a great success as they placed 4th in the league, gaining a place for 2012–13 Hong Kong season play-offs, as well as reaching semi-finals of the Senior Shield. He was awarded the Coach of the Year at the end of the season.
Lee Man
Fung left Southern following the 2014-15 season and the following two seasons as head coach at Yuen Long and then at Rangers. After Lee & Man Paper withdrew their sponsorship of Rangers in order to field their own HKPL club, Fung moved to Lee Man to become an assistant under head coach Fung Ka Ki.
Following Ka Ki's resignation, Fung was promoted to co-head coach on 10 April 2018.
Hoi King
In April 2018, Hong Kong First Division club Hoi King applied for promotion to the 2018–19 Hong Kong Premier League, despite not finishing in an automatic promotion place. The club, which was co-founded by Fung, had their application accepted and Fung confirmed in June that he would take up full time head coaching duties for the 2018–19 season.
Tai Po
On 29 July 2019, Fung was announced as a co-head coach at Tai Po along with Kwok Kar Lok. He changed his role to director of football after the club signed Davor Berber to be their new head coach.
On 29 May 2020, it was revealed that Fung had stepped down due to ongoing salary arrears at Tai Po.
He claimed that he had taken the "initiative" to resign in hopes that any remaining money at the club would go towards the players.
References
1977 births
Hong Kong men's footballers
Hong Kong football managers
Sing Tao SC players
Living people
Men's association football midfielders
|
```c++
// Sieve of Eratosthenes
//
// Author: Bedir Tapkan
//
// Desc: Find the prime numbers from 1 - n
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
void sieve(long n, bool * composite, vector<int> &primes){
// n -> the max number to check for primes
// composite -> bool arr to mark composite nums
// primes -> vector that contains primes from 2 -> n
// O(n*sqrt(n)) - but much faster in practice
for (long i = 2; i <= n; ++i){
// Check 2->n if they are already marked as composite
// and mark composites along the way
if (!composite[i]){
// Checking if prime
primes.push_back(i);
for (long j = i*i; j <= n; j += i){
composite[j] = true;
}
}
}
}
void printVector(vector<int> vc) {
for (int i = 0; i < vc.size(); ++i)
cout << vc[i] << " ";
cout << endl << endl;
}
int main() {
long n;
cin >> n; // number to check for primes up to
bool composite[n+1];
memset(composite, false, sizeof composite);
vector<int> primes;
sieve(n, composite, primes);
printVector(primes);
}
```
|
The list of shipwrecks in August 1945 includes ships sunk, foundered, grounded, or otherwise lost during August 1945.
1 August
2 August
3 August
4 August
5 August
6 August
7 August
8 August
9 August
10 August
11 August
12 August
13 August
14 August
15 August
16 August
17 August
18 August
19 August
20 August
21 August
22 August
23 August
24 August
25 August
26 August
28 August
30 August
31 August
Unknown date
References
1945-08
|
```xml
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE language SYSTEM "language.dtd"
[
<!-- Regular expression constants: -->
<!ENTITY LETTER "A-Za-z\xc0-\xd6\xd8-\xf6\xf8-\xff"> <!-- Latin-1 letters. -->
<!ENTITY IDENT "[&LETTER;_][&LETTER;0-9_']*"> <!-- ATS identifiers. -->
<!ENTITY ESC "(\\[ntbr'"\\]|\\[0-9]{3}|\\x[0-9A-Fa-f]{2})"> <!-- ATS character code escapes. -->
<!ENTITY DEC "[0-9][0-9_]*"> <!-- Decimal digits with underscores. -->
]>
<language name="ATS" version="3" kateversion="5.0" section="Sources" extensions="*.dats;*.sats;*.hats" mimetype="" author="Kiwamu Okabe (kiwamu@debian.or.jp)" license="LGPL">
<highlighting>
<list name="keywords">
<item>abstype</item>
<item>abst0ype</item>
<item>absprop</item>
<item>absview</item>
<item>absvtype</item>
<item>absviewtype</item>
<item>absvt0ype</item>
<item>absviewt0ype</item>
<item>and</item>
<item>as</item>
<item>assume</item>
<item>begin</item>
<item>break</item>
<item>case</item>
<item>continue</item>
<item>classdec</item>
<item>datasort</item>
<item>datatype</item>
<item>dataprop</item>
<item>dataview</item>
<item>datavtype</item>
<item>dataviewtype</item>
<item>do</item>
<item>dynload</item>
<item>else</item>
<item>end</item>
<item>exception</item>
<item>extern</item>
<item>extype</item>
<item>extval</item>
<item>if</item>
<item>in</item>
<item>infix</item>
<item>infixl</item>
<item>infixr</item>
<item>prefix</item>
<item>postfix</item>
<item>let</item>
<item>local</item>
<item>macdef</item>
<item>macrodef</item>
<item>nonfix</item>
<item>overload</item>
<item>of</item>
<item>op</item>
<item>rec</item>
<item>scase</item>
<item>sif</item>
<item>sortdef</item>
<item>sta</item>
<item>stacst</item>
<item>stadef</item>
<item>stavar</item>
<item>staload</item>
<item>symelim</item>
<item>symintr</item>
<item>then</item>
<item>try</item>
<item>tkindef</item>
<item>type</item>
<item>typedef</item>
<item>propdef</item>
<item>viewdef</item>
<item>vtypedef</item>
<item>viewtypedef</item>
<item>val</item>
<item>prval</item>
<item>var</item>
<item>prvar</item>
<item>when</item>
<item>where</item>
<item>for</item>
<item>while</item>
<item>with</item>
<item>withtype</item>
<item>withprop</item>
<item>withview</item>
<item>withvtype</item>
<item>withviewtype</item>
</list>
<list name="special keywords">
<item>$arrpsz</item>
<item>$arrptrsize</item>
<item>$delay</item>
<item>$ldelay</item>
<item>$effmask</item>
<item>$effmask_ntm</item>
<item>$effmask_exn</item>
<item>$effmask_ref</item>
<item>$effmask_wrt</item>
<item>$effmask_all</item>
<item>$extern</item>
<item>$extkind</item>
<item>$extype</item>
<item>$extype_struct</item>
<item>$extval</item>
<item>$lst</item>
<item>$lst_t</item>
<item>$lst_vt</item>
<item>$list</item>
<item>$list_t</item>
<item>$list_vt</item>
<item>$rec</item>
<item>$rec_t</item>
<item>$rec_vt</item>
<item>$record</item>
<item>$record_t</item>
<item>$record_vt</item>
<item>$tup</item>
<item>$tup_t</item>
<item>$tup_vt</item>
<item>$tuple</item>
<item>$tuple_t</item>
<item>$tuple_vt</item>
<item>$raise</item>
<item>$showtype</item>
<item>$myfilename</item>
<item>$mylocation</item>
<item>$myfunction</item>
<item>#assert</item>
<item>#define</item>
<item>#elif</item>
<item>#elifdef</item>
<item>#elifndef</item>
<item>#else</item>
<item>#endif</item>
<item>#error</item>
<item>#if</item>
<item>#ifdef</item>
<item>#ifndef</item>
<item>#include</item>
<item>#print</item>
<item>#then</item>
<item>#undef</item>
</list>
<list name="function keywords">
<item>fn</item>
<item>fnx</item>
<item>fun</item>
<item>prfn</item>
<item>prfun</item>
<item>praxi</item>
<item>castfn</item>
<item>implmnt</item>
<item>implement</item>
<item>primplmnt</item>
<item>primplement</item>
<item>lam</item>
<item>llam</item>
<item>fix</item>
</list>
<contexts>
<context attribute="Normal Text" lineEndContext="#stay" name="Normal">
<StringDetect attribute="Comment" context="Rest-of-file Comment" String="////" beginRegion="comment" />
<Detect2Chars attribute="Comment" context="Multiline Comment" char="(" char1="*" beginRegion="comment" />
<Detect2Chars attribute="Comment" context="Multiline C-style Comment" char="/" char1="*" beginRegion="Comment"/>
<Detect2Chars attribute="Comment" context="Singleline C++ style Comment" char="/" char1="/"/>
<Detect2Chars attribute="Termination Metrics" context="Termination Metrics Context" char="." char1="<" />
<RegExpr attribute="Constructor" context="#stay" String="`\s*&IDENT;"/>
<!-- Identifiers and keywords. -->
<keyword attribute="Keyword" context="#stay" String="keywords" />
<keyword attribute="Function Keyword" context="Function Keyword Context" String="function keywords" />
<keyword attribute="Special Keyword" context="#stay" String="special keywords" />
<RegExpr attribute="Identifier" context="#stay" String="&IDENT;" />
<!-- Numeric constants. -->
<!-- Note that they may contain underscores. -->
<RegExpr attribute="Hexadecimal" context="#stay" String="~?0[xX][0-9A-Fa-f_]+" />
<RegExpr attribute="Float" context="#stay" String="~?&DEC;((\.(&DEC;)?([eE][-+]?&DEC;)?)|([eE][-+]?&DEC;))" />
<RegExpr attribute="Decimal" context="#stay" String="~?&DEC;" />
</context>
<context attribute="Comment" lineEndContext="#stay" name="Rest-of-file Comment"/>
<context attribute="Comment" lineEndContext="#stay" name="Multiline Comment">
<!-- Support for nested comments -->
<Detect2Chars attribute="Comment" context="#pop" char="*" char1=")" endRegion="comment" />
<Detect2Chars attribute="Comment" context="Multiline Comment" char="(" char1="*" beginRegion="comment" />
<IncludeRules context="##Comments" />
</context>
<context attribute="Comment" lineEndContext="#stay" name="Multiline C-style Comment">
<Detect2Chars attribute="Comment" context="#pop" char="*" char1="/" endRegion="Comment"/>
<IncludeRules context="##Comments" />
</context>
<context attribute="Comment" lineEndContext="#pop" name="Singleline C++ style Comment">
<IncludeRules context="##Comments" />
</context>
<context attribute="Termination Metrics" lineEndContext="#stay" name="Termination Metrics Context">
<Detect2Chars attribute="Termination Metrics" context="#pop" char=">" char1="." />
</context>
<context attribute="Normal Text" lineEndContext="#stay" name="Function Keyword Context">
<DetectChar attribute="Normal Text" context="#pop" char="=" />
<DetectChar attribute="Universal" context="Universal Context" char="{" />
<DetectChar attribute="Existential" context="Existential Context" char="[" />
<IncludeRules context="Normal"/>
</context>
<context attribute="Universal" lineEndContext="#stay" name="Universal Context">
<DetectChar attribute="Universal" context="#pop" char="}" />
</context>
<context attribute="Existential" lineEndContext="#stay" name="Existential Context">
<DetectChar attribute="Existential" context="#pop" char="]" />
</context>
</contexts>
<itemDatas>
<itemData name="Normal Text" defStyleNum="dsNormal"/>
<itemData name="Identifier" defStyleNum="dsNormal"/>
<itemData name="Keyword" defStyleNum="dsKeyword"/>
<itemData name="Function Keyword" defStyleNum="dsKeyword"/>
<itemData name="Special Keyword" defStyleNum="dsDataType"/>
<itemData name="Termination Metrics" defStyleNum="dsDataType"/>
<itemData name="Universal" defStyleNum="dsDataType"/>
<itemData name="Existential" defStyleNum="dsDataType"/>
<itemData name="Decimal" defStyleNum="dsDecVal"/>
<itemData name="Hexadecimal" defStyleNum="dsBaseN"/>
<itemData name="Float" defStyleNum="dsFloat"/>
<itemData name="Comment" defStyleNum="dsComment"/>
<itemData name="Constructor" defStyleNum="dsDataType"/>
</itemDatas>
</highlighting>
<general>
<keywords casesensitive="1" />
<comments>
<comment name="singleLine" start="//" />
<comment name="multiLine" start="(*" end="*)" region="comment" />
</comments>
</general>
</language>
<!-- kate: space-indent on; indent-width 2; replace-tabs on; -->
```
|
Amata ragazzii is a species of moth of the family Erebidae first described by Emilio Turati in 1917. It is found in Italy.
Adults have been recorded on wing in June and July.
The larvae feed on various low-growing plants, including Plantago, Rumex, Galium and Taraxacum species.
Subspecies
Amata ragazzii ragazzii
Amata ragazzii asperomontana (Stauder, 1917)
Amata ragazzii silaensis Obraztsov, 1966
References
ragazzii
Endemic fauna of Italy
Moths of Europe
Moths described in 1917
|
The Tamil Nesan () was a Tamil language newspaper published in Malaysia. Established in 1924, it was the oldest running Tamil newspaper in the country until its disestablishment in 2019.
First issued on 24 September 1924, the Tamil Nesan was a paper catering to the ethnic Indian community in Malaysia, primarily Tamilians, serving its readers with a variety of political, religious, nation, world, educational and Tamil cinema news. It was published daily and approximately 20,000 copies were sold every day. Like the Makkal Osai, the paper was affiliated with the Malaysian Indian Congress through its ownership by the family of former MIC president Samy Vellu.
The paper ceased publication on 1 February 2019, citing 10 years of financial difficulties.
References
External links
Newspaper web page ("under construction" as of Jan 2008)
Newspapers published in Malaysia
Tamil-language newspapers
Newspapers established in 1924
Publications disestablished in 2019
1924 establishments in British Malaya
2019 disestablishments in Malaysia
|
```javascript
import React from 'react';
import { Popper } from 'react-popper';
import user from '@testing-library/user-event';
import { render, screen } from '@testing-library/react';
import '@testing-library/jest-dom';
import TooltipPopoverWrapper from '../TooltipPopoverWrapper';
describe('Tooltip', () => {
let element;
let container;
beforeEach(() => {
element = document.createElement('div');
container = document.createElement('div');
element.innerHTML =
'<p id="target">This is the Tooltip <span id="innerTarget">target</span>.</p>';
element.setAttribute('id', 'testContainer');
container.setAttribute('id', 'container');
container.setAttribute('data-testid', 'container');
element.appendChild(container);
document.body.appendChild(element);
jest.useFakeTimers();
jest.resetModules();
Popper.mockClear();
});
afterEach(() => {
jest.clearAllTimers();
document.body.removeChild(element);
element = null;
container = null;
});
it('should render arrow by default', () => {
render(
<TooltipPopoverWrapper target="target" isOpen>
Tooltip Content
</TooltipPopoverWrapper>,
);
expect(document.querySelector('.arrow')).toBeInTheDocument();
});
it('should render not render arrow if hiderArrow is true', () => {
render(
<TooltipPopoverWrapper target="target" isOpen hideArrow>
Tooltip Content
</TooltipPopoverWrapper>,
);
expect(document.querySelector('.arrow')).not.toBeInTheDocument();
});
it('should not render children if isOpen is false', () => {
render(
<TooltipPopoverWrapper target="target" isOpen={false}>
Tooltip Content
</TooltipPopoverWrapper>,
);
expect(screen.queryByText(/tooltip content/i)).not.toBeInTheDocument();
});
it('should render if isOpen is true', () => {
render(
<TooltipPopoverWrapper
target="target"
isOpen
className="tooltip show"
trigger="hover"
>
Tooltip Content
</TooltipPopoverWrapper>,
);
expect(screen.queryByText(/tooltip content/i)).toBeInTheDocument();
expect(document.querySelector('.tooltip.show')).toBeInTheDocument();
});
it('should render with target object', () => {
render(
<TooltipPopoverWrapper
target={document.getElementById('target')}
isOpen
className="tooltip show"
>
Tooltip Content
</TooltipPopoverWrapper>,
);
expect(document.getElementsByClassName('tooltip show')).toHaveLength(1);
expect(screen.queryByText(/tooltip content/i)).toBeInTheDocument();
});
it('should toggle isOpen', () => {
const { rerender } = render(
<TooltipPopoverWrapper
target="target"
isOpen={false}
className="tooltip show"
>
Tooltip Content
</TooltipPopoverWrapper>,
);
expect(screen.queryByText(/tooltip content/i)).not.toBeInTheDocument();
rerender(
<TooltipPopoverWrapper target="target" isOpen className="tooltip show">
Tooltip Content
</TooltipPopoverWrapper>,
);
expect(screen.queryByText(/tooltip content/i)).toBeInTheDocument();
rerender(
<TooltipPopoverWrapper
target="target"
isOpen={false}
className="tooltip show"
>
Tooltip Content
</TooltipPopoverWrapper>,
);
jest.advanceTimersByTime(150);
expect(screen.queryByText(/tooltip content/i)).not.toBeInTheDocument();
});
it('should handle target clicks', () => {
const toggle = jest.fn();
const { rerender } = render(
<TooltipPopoverWrapper target="target" isOpen={false} toggle={toggle}>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.click(screen.getByText(/this is the Tooltip/i));
jest.advanceTimersByTime(150);
expect(toggle).toBeCalled();
toggle.mockClear();
rerender(
<TooltipPopoverWrapper target="target" isOpen toggle={toggle}>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.click(screen.getByText(/this is the Tooltip/i));
jest.advanceTimersByTime(150);
expect(toggle).toBeCalled();
});
it('should handle inner target clicks', () => {
const toggle = jest.fn();
render(
<TooltipPopoverWrapper target="target" isOpen={false} toggle={toggle}>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.click(screen.getByText(/target/i));
jest.advanceTimersByTime(150);
expect(toggle).toBeCalled();
});
it('should not do anything when document click outside of target', () => {
const toggle = jest.fn();
render(
<TooltipPopoverWrapper target="target" isOpen={false} toggle={toggle}>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.click(screen.getByTestId('container'));
expect(toggle).not.toBeCalled();
});
it('should open after receiving single touchstart and single click', () => {
const toggle = jest.fn();
render(
<TooltipPopoverWrapper
target="target"
isOpen={false}
toggle={toggle}
trigger="click"
>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.click(screen.getByText(/target/i));
jest.advanceTimersByTime(200);
expect(toggle).toHaveBeenCalled();
// TODO: RTL currently doesn't support touch events
});
it('should close after receiving single touchstart and single click', () => {
const toggle = jest.fn();
render(
<TooltipPopoverWrapper
target="target"
isOpen
toggle={toggle}
trigger="click"
>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.click(screen.getByText(/target/i));
jest.advanceTimersByTime(200);
expect(toggle).toHaveBeenCalled();
// TODO: RTL currently doesn't support touch events
});
it('should pass down custom modifiers', () => {
render(
<TooltipPopoverWrapper
isOpen
target="target"
modifiers={[
{
name: 'offset',
options: {
offset: [2, 2],
},
},
{
name: 'preventOverflow',
options: {
boundary: 'viewport',
},
},
]}
>
Tooltip Content
</TooltipPopoverWrapper>,
);
expect(Popper.mock.calls[0][0].modifiers).toEqual(
expect.arrayContaining([
expect.objectContaining({
name: 'offset',
options: {
offset: [2, 2],
},
}),
]),
);
expect(Popper.mock.calls[0][0].modifiers).toEqual(
expect.arrayContaining([
expect.objectContaining({
name: 'preventOverflow',
options: {
boundary: 'viewport',
},
}),
]),
);
});
describe('PopperContent', () => {
beforeEach(() => {
jest.doMock('../PopperContent', () => {
return jest.fn((props) => {
return props.children({
update: () => {},
ref: () => {},
style: {},
placement: props.placement,
arrowProps: { ref: () => {}, style: {} },
isReferenceHidden: false,
});
});
});
});
it('should pass down cssModule', () => {
// eslint-disable-next-line global-require
const PopperContent = require('../PopperContent');
// eslint-disable-next-line global-require
const TooltipPopoverWrapper = require('../TooltipPopoverWrapper').default;
const cssModule = {
a: 'b',
};
render(
<TooltipPopoverWrapper isOpen target="target" cssModule={cssModule}>
Tooltip Content
</TooltipPopoverWrapper>,
);
expect(PopperContent).toBeCalledTimes(1);
expect(PopperContent.mock.calls[0][0]).toEqual(
expect.objectContaining({
cssModule: expect.objectContaining({
a: 'b',
}),
}),
);
});
it('should pass down offset', () => {
// eslint-disable-next-line global-require
const PopperContent = require('../PopperContent');
// eslint-disable-next-line global-require
const TooltipPopoverWrapper = require('../TooltipPopoverWrapper').default;
render(
<TooltipPopoverWrapper isOpen target="target" offset={[0, 12]}>
Tooltip content
</TooltipPopoverWrapper>,
);
expect(PopperContent).toBeCalledTimes(1);
expect(PopperContent.mock.calls[0][0].offset).toEqual(
expect.arrayContaining([0, 12]),
);
});
it('should pass down flip', () => {
// eslint-disable-next-line global-require
const PopperContent = require('../PopperContent');
// eslint-disable-next-line global-require
const TooltipPopoverWrapper = require('../TooltipPopoverWrapper').default;
render(
<TooltipPopoverWrapper isOpen target="target" flip={false}>
Tooltip Content
</TooltipPopoverWrapper>,
);
expect(PopperContent).toBeCalledTimes(1);
expect(PopperContent.mock.calls[0][0].flip).toBe(false);
});
it('should handle inner target click and correct placement', () => {
const toggle = jest.fn();
// eslint-disable-next-line global-require
const PopperContent = require('../PopperContent');
// eslint-disable-next-line global-require
const TooltipPopoverWrapper = require('../TooltipPopoverWrapper').default;
const { rerender } = render(
<TooltipPopoverWrapper target="target" isOpen={false} toggle={toggle}>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.click(screen.getByText(/target/i));
jest.advanceTimersByTime(200);
expect(toggle).toBeCalled();
rerender(
<TooltipPopoverWrapper target="target" isOpen toggle={toggle}>
Tooltip Content
</TooltipPopoverWrapper>,
);
expect(PopperContent.mock.calls[0][0].target.id).toBe('target');
});
});
it('should not call props.toggle when disabled ', () => {
const toggle = jest.fn();
render(
<TooltipPopoverWrapper target="target" disabled isOpen toggle={toggle}>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.click(screen.getByText(/target/i));
expect(toggle).not.toHaveBeenCalled();
});
it('should not throw when props.toggle is not provided ', () => {
render(
<TooltipPopoverWrapper target="target" disabled isOpen>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.click(screen.getByText(/target/i));
});
it('should not throw when passed a ref object as the target', () => {
const targetObj = React.createRef();
targetObj.current = {
addEventListener: jest.fn(),
removeEventListener: jest.fn(),
};
const { unmount } = render(
<TooltipPopoverWrapper isOpen={false} target={targetObj}>
Yo!
</TooltipPopoverWrapper>,
);
unmount();
expect(targetObj.current.addEventListener).toHaveBeenCalled();
expect(targetObj.current.removeEventListener).toHaveBeenCalled();
});
describe('multi target', () => {
let targets;
let targetContainer;
beforeEach(() => {
targetContainer = document.createElement('div');
targetContainer.innerHTML =
"<span class='example first'>Target 1</span><span class='example second'>Target 2<span class='inner_example'>Inner target</span></span>";
element.appendChild(targetContainer);
targets = targetContainer.querySelectorAll('.example');
});
afterEach(() => {
element.removeChild(targetContainer);
targets = null;
});
it('should attach tooltip on multiple target when a target selector matches multiple elements', () => {
const toggle = jest.fn();
render(
<TooltipPopoverWrapper
target=".example"
isOpen={false}
toggle={toggle}
delay={0}
>
Yo!
</TooltipPopoverWrapper>,
);
user.click(targets[0]);
jest.advanceTimersByTime(200);
expect(toggle).toHaveBeenCalledTimes(1);
user.click(targets[1]);
jest.advanceTimersByTime(200);
expect(toggle).toHaveBeenCalledTimes(2);
});
it('should attach tooltip on second target with correct placement, when inner element is clicked', () => {
const toggle = jest.fn();
render(
<TooltipPopoverWrapper
target=".example"
isOpen={false}
toggle={toggle}
delay={0}
>
Yo!
</TooltipPopoverWrapper>,
);
user.click(targets[0]);
jest.advanceTimersByTime(200);
expect(toggle).toHaveBeenCalledTimes(1);
});
});
describe('delay', () => {
it('should accept a number', () => {
const toggle = jest.fn();
render(
<TooltipPopoverWrapper
target="target"
isOpen
toggle={toggle}
delay={200}
>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.click(screen.getByText(/target/i));
jest.advanceTimersByTime(100);
expect(toggle).not.toBeCalled();
jest.advanceTimersByTime(100);
expect(toggle).toBeCalled();
});
it('should accept an object', () => {
const toggle = jest.fn();
render(
<TooltipPopoverWrapper
target="target"
isOpen
toggle={toggle}
delay={{ show: 400, hide: 400 }}
>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.click(screen.getByText(/target/i));
jest.advanceTimersByTime(200);
expect(toggle).not.toBeCalled();
jest.advanceTimersByTime(200);
expect(toggle).toBeCalled();
});
it('should use default value if value is missing from object', () => {
const toggle = jest.fn();
render(
<TooltipPopoverWrapper
target="target"
isOpen
toggle={toggle}
delay={{ show: 0 }}
>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.click(screen.getByText(/target/i));
jest.advanceTimersByTime(10);
expect(toggle).not.toBeCalled();
jest.advanceTimersByTime(40); // default hide value is 50
expect(toggle).toBeCalled();
});
});
describe('hide', () => {
it('should call toggle when isOpen', () => {
const toggle = jest.fn();
render(
<TooltipPopoverWrapper target="target" isOpen toggle={toggle}>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.click(screen.getByText(/target/i));
jest.advanceTimersByTime(200);
expect(toggle).toHaveBeenCalled();
});
});
describe('show', () => {
it('should call toggle when isOpen', () => {
const toggle = jest.fn();
render(
<TooltipPopoverWrapper target="target" isOpen={false} toggle={toggle}>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.click(screen.getByText(/target/i));
jest.advanceTimersByTime(200);
expect(toggle).toHaveBeenCalled();
});
});
describe('onMouseOverTooltip', () => {
it('should clear timeout if it exists on target click', () => {
const toggle = jest.fn();
const { rerender } = render(
<TooltipPopoverWrapper
target="target"
isOpen={false}
toggle={toggle}
delay={200}
trigger="hover"
>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.hover(screen.getByText(/target/i));
rerender(
<TooltipPopoverWrapper
target="target"
isOpen
toggle={toggle}
delay={200}
trigger="hover"
>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.unhover(screen.getByText(/target/i));
jest.advanceTimersByTime(200);
expect(toggle).toHaveBeenCalledTimes(1);
});
it('should not call .toggle if isOpen', () => {
const toggle = jest.fn();
render(
<TooltipPopoverWrapper
target="target"
isOpen
toggle={toggle}
delay={200}
trigger="hover"
>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.hover(screen.getByText(/target/i));
jest.advanceTimersByTime(200);
expect(toggle).not.toHaveBeenCalled();
});
});
describe('onMouseLeaveTooltip', () => {
it('should clear timeout if it exists on target click', () => {
const toggle = jest.fn();
const { rerender } = render(
<TooltipPopoverWrapper
target="target"
isOpen
toggle={toggle}
delay={200}
trigger="hover"
>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.unhover(screen.getByText(/target/i));
rerender(
<TooltipPopoverWrapper
target="target"
isOpen={false}
toggle={toggle}
delay={200}
trigger="hover"
>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.hover(screen.getByText(/target/i));
jest.advanceTimersByTime(200);
expect(toggle).toHaveBeenCalledTimes(1);
});
it('should not call .toggle if isOpen is false', () => {
const toggle = jest.fn();
render(
<TooltipPopoverWrapper
target="target"
isOpen={false}
toggle={toggle}
delay={200}
trigger="hover"
>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.unhover(screen.getByText(/target/i));
jest.advanceTimersByTime(200);
expect(toggle).not.toHaveBeenCalled();
});
});
describe('autohide', () => {
it('should keep Tooltip around when false and onmouseleave from Tooltip content', () => {
const toggle = jest.fn();
render(
<TooltipPopoverWrapper
trigger="hover"
target="target"
autohide={false}
isOpen
toggle={toggle}
delay={200}
>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.hover(screen.getByText(/tooltip content/i));
jest.advanceTimersByTime(200);
expect(toggle).not.toHaveBeenCalled();
user.unhover(screen.getByText(/tooltip content/i));
jest.advanceTimersByTime(200);
expect(toggle).toHaveBeenCalled();
});
it('clears showTimeout and hideTimeout in onMouseLeaveTooltipContent', () => {
const toggle = jest.fn();
render(
<TooltipPopoverWrapper
trigger="hover"
target="target"
autohide={false}
isOpen
toggle={toggle}
delay={200}
>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.unhover(screen.getByText(/tooltip content/i));
user.hover(screen.getByText(/tooltip content/i));
user.unhover(screen.getByText(/tooltip content/i));
jest.advanceTimersByTime(200);
expect(toggle).toBeCalledTimes(1);
});
it('should not keep Tooltip around when autohide is true and Tooltip content is hovered over', () => {
const toggle = jest.fn();
render(
<TooltipPopoverWrapper
target="target"
autohide
isOpen
toggle={toggle}
delay={200}
trigger="click hover focus"
>
Tooltip Content
</TooltipPopoverWrapper>,
);
user.unhover(screen.getByText(/target/i));
user.hover(screen.getByText(/tooltip content/i));
jest.advanceTimersByTime(200);
expect(toggle).toHaveBeenCalled();
});
it('should allow a function to be used as children', () => {
const renderChildren = jest.fn();
render(
<TooltipPopoverWrapper target="target" isOpen>
{renderChildren}
</TooltipPopoverWrapper>,
);
expect(renderChildren).toHaveBeenCalled();
});
it('should render children properly when children is a function', () => {
render(
<TooltipPopoverWrapper
target="target"
isOpen
className="tooltip show"
trigger="hover"
>
{() => 'Tooltip Content'}
</TooltipPopoverWrapper>,
);
expect(screen.getByText(/tooltip content/i)).toBeInTheDocument();
});
});
});
```
|
David Foulis (19 April 1868 – 11 June 1950) was a Scottish-American professional golfer who played in the late 19th century and early 20th century. Foulis tied for eighth place in the 1897 U.S. Open, held at the Chicago Golf Club in Wheaton, Illinois. He was the inventor of the golf hole cup liner or "golf flag support" and received a patent for the invention in 1912. He and his brother James were co-inventors of the modern 7-iron, which they called a "mashie-niblick".
Early life
Foulis was born on 19 April 1868 in the family home at 9 Crails Lane in St Andrews, Scotland, to James Foulis (1841–1925) and Helen Ann Foulis (née Jamieson) (1847–1928). At age 23 he was working as an ironmonger's assistant. He emigrated to the United States in 1896 and became a naturalized American citizen. He married Janet Fowler in 1898 and they had two children, Jessie Helen Foulis (1899–1973) and James Ronald Foulis (1903–1969). His son James played in the first Masters tournament in 1934, carding rounds of 78-74-76-72=300.
Golf career
Foulis played in the 1897 U.S. Open held at Chicago Golf Club in Wheaton, Illinois, where his brother James was the head professional. He scored rounds of 86-87=173 and tied for eighth place with Horace Rawlins and H. J. Whigham. None of the three competitors won any prize money.
In 1905 Foulis succeeded his brother James as the professional at Chicago Golf Club where he remained until 1916. In 1921 David became the professional and greenskeeper at the Hinsdale Golf Club in Chicago where he remained until his retirement in 1939. Foulis and his brother James were the proprietors of the J & D Foulis Company of Chicago, producing golf clubs and "American Eagle" golf balls until 1921.
Golf flag support invention
He was the inventor of the "golf flag support" and received a patent on 5 April 1912 for the invention.
Mashie-Niblick invention
David and his brother James played a significant part in the evolution of golf equipment. They invented the bramble patterning for Coburn Haskell's new rubber-cored ball. In response to the demands of the new ball they developed the "mashie-niblick", the modern 7-iron, which fell between the traditional mashie (5-iron) and niblick (9-iron), and patented the design.
Family
Foulis had four brothers (John, James, Robert, and Simpson) who were all professional golfers. He also had two sisters, Annie and Maggie. His brother James won the 1896 U.S. Open.
Death and legacy
Foulis died on 11 June 1950 at Hinsdale Hospital near Chicago, aged 82. He was buried in Wheaton Cemetery in Wheaton, Illinois. Foulis is remembered as the inventor of the golf flag support and the modern 7-iron, two significant inventions in the history of golf.
References
Scottish male golfers
Golfers from St Andrews
Scottish inventors
Scottish emigrants to the United States
1868 births
1950 deaths
|
```asciidoc
= Performance Testing
This document presents results from performance testing of WinFsp. These results show that WinFsp has excellent performance that rivals or exceeds that of NTFS in many file system scenarios. Some further optimization opportunities are also identified.
== Summary
Two reference WinFsp file systems, MEMFS and NTPTFS, are compared against NTFS in multiple file system scenarios. MEMFS is an in-memory file system, whereas NTPTFS (NT passthrough file system) is a file system that passes all file system requests onto an underlying NTFS file system.
The test results are summarized in the charts below. The "File Tests" chart summarizes performance of file path namespace manipulations (e.g. creating/deleting files, opening files, listing files, etc.). The "Read/Write Tests" chart summarizes performance of file I/O (e.g. cached read/write, memory mapped I/O, etc.)
The important takeaways are:
- MEMFS is faster than NTFS is most scenarios. This is a somewhat expected result because MEMFS is an in-memory file system, whereas NTFS is a disk file system. However it shows that WinFsp does not add significant overhead and user mode file systems can be fast.
- MEMFS and NTPTFS both outperform NTFS when doing cached file I/O! This is a significant result because doing file I/O is the primary purpose of a file system. It is also an unexpected result at least in the case of NTPTFS, since NTPTFS runs on top of NTFS.
The following sections present the testing methodology used, provide instructions for independent verification, describe the individual tests in detail and provide an explanation for the observed results.
[cols="a,a", frame=none, grid=none]
|===
|image::WinFsp-Performance-Testing/file_tests.png[]
|image::WinFsp-Performance-Testing/rdwr_tests.png[]
|===
== Methodology
A test run consists of performance tests run one after the other (in sequence). The test driver is careful to clear system caches before each test to minimize timing interference between the tests (because we would not want operations performed in test A to affect measurements of test B). Tests are run on an idle computer to minimize interference from third party components.
Each test run is run a number of times (default: 3) against each file system and the smallest time value for the particular test and file system is chosen. The assumption is that even in a seemingly idle system there is some activity that affects the results; the smallest value is the preferred one to use because it reflects the time when there is less or no other system activity.
For the NTFS file system we use the default configuration as it ships with Windows (e.g. 8.3 names are enabled). For the NTPTFS file system we disable anti-virus checks on the lower file system, because it makes no sense for NTPTFS to pay for virus checking twice. (Consider an NTPTFS file system that exposes a lower NTFS directory `C:\t` as an upper drive `X:`. Such a file system would have virus checking applied on file accesses to `X:`, but also to its own accesses to `C:\t`. This is unnecessary and counter-productive.)
Note that the sequential nature of the tests represents a worst case scenario for WinFsp. The reason is that a single file system operation may require a roundtrip to the user mode file system and such a roundtrip requires two process context switches (i.e. address space and thread switches): one context switch to carry the file system request to the user mode file system and one context switch to carry the response back to the originating process. WinFsp performs better when multiple processes issue file system operations concurrently, because multiple requests are queued in its internal queues and multiple requests can be handled in a single context switch.
For more information refer to the link:WinFsp-Performance-Testing/WinFsp-Performance-Testing-Analysis.ipynb[Performance Testing Analysis] notebook. This notebook together with the `run-all-perf-tests.bat` script can be used for replication and independent verification of the results presented in this document.
The test environment for the results presented in this document is as follows:
----
Dell XPS 13 9300
Intel Core i7-1065G7 CPU
32GB 3733MHz LPDDR4x RAM
2TB M.2 PCIe NVMe SSD
Windows 11 (64-bit) Version 21H2 (OS Build 22000.258)
WinFsp 2022+ARM64 Beta3 (v1.11B3)
----
== Results
In the charts below we use consistent coloring and markers to quickly identify a file system. Blue and the letter 'N' is used for NTFS, orange and the letter 'M' is used for MEMFS, green and the letter 'P' is used for NTPTFS.
In bar charts shorter bars are better. In plot charts lower times are better. (Better means that the file system is faster).
=== File Tests
File tests are tests that are performed against the hierarchical path namespace of a file system. These tests measure the performance of creating, opening, overwriting, listing and deleting files.
Measured times for these tests are normalized against the NTFS time (so that the NTFS value is always 1). This allows for easy comparison between file systems across all file tests.
MEMFS has the best performance in most of these tests. NTFS performs better in some tests; these are discussed further below. NTPTFS is last as it has the overhead of both NTFS and WinFsp.
image::WinFsp-Performance-Testing/file_tests.png[]
==== file_create_test
This test measures the performance of creating new files using `CreateFileW(CREATE_NEW)` / `CloseHandle`. MEMFS has the best performance here, while NTFS has worse performance as it has to update its data structures on disk.
image::WinFsp-Performance-Testing/file_create_test.png[]
==== file_open_test
This test measures the performance of opening different files using `CreateFileW(OPEN_EXISTING)` / `CloseHandle`. MEMFS again has the best performance, followed by NTFS and then NTPTFS.
image::WinFsp-Performance-Testing/file_open_test.png[]
==== iter.file_open_test
This test measures the performance of opening the same files repeatedly using `CreateFileW(OPEN_EXISTING)` / `CloseHandle`. NTFS has the best performance, with MEMFS following and NTPTFS a distant third.
This test shows that NTFS does a better job than WinFsp when re-opening a file. The problem is that in most cases the WinFsp API design requires a round-trip to the user mode file system when opening a file. Improving WinFsp performance here would likely require substantial changes to the WinFsp API.
image::WinFsp-Performance-Testing/iter.file_open_test.png[]
==== file_overwrite_test
This test measures the performance of overwriting files using `CreateFileW(CREATE_ALWAYS)` / `CloseHandle`. MEMFS is fastest, followed by NTFS and then NTPTFS.
image::WinFsp-Performance-Testing/file_overwrite_test.png[]
==== file_list_test
This test measures the performance of listing files using `FindFirstFileW` / `FindNextFile` / `FindClose`. MEMFS is again fastest with NTFS and NTPTFS following.
It should be noted that NTFS can perform better in this test, if 8.3 (i.e. short) names are disabled (see `fsutil 8dot3name`). However Microsoft ships NTFS with 8.3 names enabled by default and these tests are performed against the default configuration of NTFS.
image::WinFsp-Performance-Testing/file_list_test.png[]
==== file_list_single_test
This test measures the performance of listing a single file using `FindFirstFileW` / `FindNextFile` / `FindClose`. NTFS has again best performance, with MEMFS following and NTPTFS a distant third.
This test shows that NTFS does a better job than WinFsp at caching directory data. Improving WinFsp performance here would likely require a more aggressive and/or intelligent directory caching scheme than the one used now.
image::WinFsp-Performance-Testing/file_list_single_test.png[]
==== file_delete_test
This test measures the performance of deleting files using `DeleteFileW`. MEMFS has the best performance, followed by NTFS and NTPTFS.
image::WinFsp-Performance-Testing/file_delete_test.png[]
=== Read/Write Tests
Read/write tests are tests that measure the performance of cached, non-cached and memory-mapped I/O.
Measured times for these tests are normalized against the NTFS time (so that the NTFS value is always 1). This allows for easy comparison between file systems across all read/write tests.
MEMFS and NTPTFS outperform NTFS in cached and non-cached I/O tests and have equal performance to NTFS in memory mapped I/O tests. This result may be somewhat counter-intuitive (especially for NTPTFS), but the reasons are explained below.
image::WinFsp-Performance-Testing/rdwr_tests.png[]
==== rdwr_cc_read_page_test
This test measures the performance of cached `ReadFile` with 1 page reads. MEMFS and NTPTFS outperform NTFS by a considerable margin.
Cached reads are satisfied from cache and they can effectively be a "memory copy" from the operating system's buffers into the `ReadFile` buffer. Both WinFsp and NTFS implement NT "fast I/O" and one explanation for the test's result is that the WinFsp "fast I/O" implementation is more performant than the NTFS one.
An alternative explanation is that MEMFS and NTPTFS are simply faster in filling the file system cache when a cache miss occurs. While this may be true for MEMFS (because it maintains file data in user mode memory), it cannot be true for NTPTFS. Recall that the test driver clears system caches prior to running every test, which means that when NTPTFS tries to fill its file system cache for the upper file system, it has to access lower file system data from disk (the same as NTFS).
image::WinFsp-Performance-Testing/rdwr_cc_read_page_test.png[]
==== rdwr_cc_write_page_test
This test measures the performance of cached `WriteFile` with 1 page writes. As in the read case, MEMFS and NTPTFS outperform NTFS albeit with a smaller margin.
Similar comments as for `rdwr_cc_read_page_test` apply.
image::WinFsp-Performance-Testing/rdwr_cc_write_page_test.png[]
==== rdwr_nc_read_page_test
This test measures the performance of non-cached `ReadFile` with 1 page reads. Although MEMFS and NTPTFS have better performance than NTFS, this result is not as interesting, because MEMFS is an in-memory file system and NTPTFS currently implements only cached I/O (this may change in the future). However we include this test for completeness.
image::WinFsp-Performance-Testing/rdwr_nc_read_page_test.png[]
==== rdwr_nc_write_page_test
This test measures the performance of non-cached `WriteFile` with 1 page writes. Again MEMFS and NTPTFS have better performance than NTFS, but similar comments as for `rdwr_nc_read_page_test` apply.
image::WinFsp-Performance-Testing/rdwr_nc_write_page_test.png[]
==== mmap_read_test
This test measures the performance of memory mapped reads. NTFS and WinFsp have identical performance here, which actually makes sense because memory mapped I/O is effectively cached by buffers that are mapped into the address space of the process doing the I/O.
image::WinFsp-Performance-Testing/mmap_read_test.png[]
==== mmap_write_test
This test measures the performance of memory mapped writes. NTFS and WinFsp have again identical performance here. Similar comments as for `mmap_read_test` apply.
image::WinFsp-Performance-Testing/mmap_write_test.png[]
```
|
```javascript
var baseIteratee = require('./_baseIteratee'),
basePullAt = require('./_basePullAt');
/**
* Removes all elements from `array` that `predicate` returns truthy for
* and returns an array of the removed elements. The predicate is invoked
* with three arguments: (value, index, array).
*
* **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`
* to pull elements from an array by value.
*
* @static
* @memberOf _
* @since 2.0.0
* @category Array
* @param {Array} array The array to modify.
* @param {Array|Function|Object|string} [predicate=_.identity]
* The function invoked per iteration.
* @returns {Array} Returns the new array of removed elements.
* @example
*
* var array = [1, 2, 3, 4];
* var evens = _.remove(array, function(n) {
* return n % 2 == 0;
* });
*
* console.log(array);
* // => [1, 3]
*
* console.log(evens);
* // => [2, 4]
*/
function remove(array, predicate) {
var result = [];
if (!(array && array.length)) {
return result;
}
var index = -1,
indexes = [],
length = array.length;
predicate = baseIteratee(predicate, 3);
while (++index < length) {
var value = array[index];
if (predicate(value, index, array)) {
result.push(value);
indexes.push(index);
}
}
basePullAt(array, indexes);
return result;
}
module.exports = remove;
```
|
Friends of the Earth Europe (FoEE) is the European branch of the world's largest grassroots environmental network, Friends of the Earth International (FOEI). It includes 33 national organizations and thousands of local groups.
The Friends of the Earth Europe office in Brussels fulfills a number of functions. It represents the network's member groups towards the European institutions aiming to influence EU-policymaking; raises public awareness of environmental issues; runs capacity building projects for its membership, and is a secretariat for its 33 national members.
The FoEE office is located in a sustainable building housing Belgian and European NGOs near the European Parliament in Brussels.
FoEE Member organisations
Campaigns
The current campaign priorities of Friends of the Earth Europe are:
Climate justice and energy
Food, agriculture and biodiversity
Economic justice
Resource justice and sustainability
Climate justice and energy
Friends of the Earth Europe is "working to create the much-needed, fair and urgent transition to a fossil fuel free Europe. It wants to deliver a 100% renewable, no nuclear, super energy-efficient, zero-fossil-fuel Europe by 2030."
The organization calls for radical improvements in energy efficiency, an accelerated phase-out of fossil fuels, a dramatic shift towards community-owned renewable energies, and reduced overall resource consumption and lifestyle changes. This often means targeting extractive industries, especially those who are involved in fracking and tar sands extraction.
Food, agriculture and biodiversity
The organization has been a key participant in the European movement against GMOs which has been successful in stopping the planting of GM crops across most of Europe.
The organization advocates for more environmentally friendly, equitable and sustainable farming. This includes campaigning to reform the European Common Agricultural Policy (CAP) in ways that can mitigate climate change emissions (especially through reducing reliance on soy imports for livestock), protect biodiversity, and stop the collapse of family farming in Europe's agriculture sector.
FoEE has also been active in its opposition to EU trade deals, such as the CETA agreement with Canada and TTIP with the US, because of a belief that those trade deals do not support human rights and the environment.
One of FoEE's campaigns aims to protect nature and biodiversity by supporting local groups in their preservation initiatives.
Economic Justice
Friends of the Earth Europe's economic justice program is occupied with the influence of companies over EU decision-making and the economic, social and environmental consequences of corporate practices. It works to expose cases of corporate capture of EU regulation and examples of the influence of corporate interests over EU policy process which often results in a lack of regulation or weak regulation.
The program looks into the issue of European companies which have subsidiaries outside of Europe. Such subsidiaries of multinational companies often fail to respect EU laws and workers’ rights when operating abroad, and victims too often do not have access to justice. It campaigns for guarantees that companies abide by the same safety and social standards for their workers and facilities outside of Europe as in Europe; and that European companies are held accountable for their practices outside of Europe, in particular in cases of abuses.
In the area of lobby transparency, FoEE looks at how companies exert their influence over and sometimes directly shape decision-making in the EU. It campaigns in favor of transparency in business influence and more balanced representation of stakeholders in EU policy making. FoEE has been active in exposing cases of revolving door scandals, misleading lobby registrations and deceptive lobby practices. It has been lobbying EU Commission and Parliament in favor of stricter EU legislation in order to close the current loopholes and prevent such scandals.
Resource justice and sustainability
FoEE recognizes and promotes the environmental, economic and social benefits of reducing Europe's resource consumption. They focus on reducing Europe's land, water, materials and carbon use – including the embedded resources Europe consumes beyond its borders.
The organization promotes the reuse and recycling of materials, opposes incineration, and is calling for the full implementation of the Sustainable Development Goals and the EU 2030 Agenda.
School of Sustainability
FoEE's School of Sustainability project is inspired by the Latin American Escuela de la Sustentabilidad. Driven by popular education techniques, the project aims to strengthen the regional network of Friends of the Earth Europe, and create common political analyses for a system of change from environmental justice and human rights abuses to challenging power.
Coalitions
FoEE is an active member of many coalitions working on environmental issues in Europe including:
The Green 10, consisting of BirdLife International (European Community Office), Climate Action Network Europe (CAN Europe), CEE Bankwatch Network, European Environmental Bureau (EEB), European Federation for Transport and Environment (T&E), Health and Environment Alliance, Greenpeace Europe, International Friends of Nature (IFN), WWF European Policy Office and Friends of the Earth Europe.
The Alliance for Lobbying Transparency and Ethics Regulation (ALTER-EU): FoEE is one of the founding and current steering group members of the Alliance for Lobbying Transparency and Ethics Regulation (ALTER-EU), which was launched in Brussels in July 2005. ALTER-EU gathers 160 civil society groups that are concerned by the growing influence of the corporate sector on EU decision-making.
The European Coalition for Corporate Justice
Youth Network (Young Friends of the Earth Europe)
In 2007 a youth network called Young Friends of the Earth Europe (YFoEE), was established by national Young Friends of the Earth groups affiliated to FoE member groups. YFoEE is an autonomous and self organised youth-led network, with structures and ways of working set and led by young people, yet retains strong links to Friends of the Earth Europe and the Friends of the Earth International Federation and their mission, vision and values.
The YFoEE network unites youth organisations and youth groups working on social and environmental justice in Europe, and runs campaigning and educational activities for young people on a European level. It consists of youth member groups in 15 countries from both EU and Non EU countries, including Natur og Ungdom (Norway), BUNDjugend (Germany) or YFoE Ukraine.
The key campaigning topic of the network since 2007 has been advocating for climate justice, in particular opposing what it considers to be false solutions to climate change, such as nuclear energy, and educating young people to create a youth movement for climate justice. In 2010, YFoEE hosted a parallel convergence to the COP16 UN Climate Talks in Cancún, Mexico, in Brussels, Belgium as an alternative forum to the International political negotiations and to build the regional European Youth Climate Movement.
YFoEE has been active as part of the Youth Climate Movement and youth delegation at the UNFCCC international climate negotiations, and is one of the founding members of European Youth Climate Movement.
Ways of working
The YFoEE network is supported by a secretariat in the office of FoEE in Brussels, and coordinated by a Steering Group of 8 volunteers, elected from the YFoEE network annually at the Annual General Meeting.
Campaigns and events are led and developed by individual volunteers and representatives of member groups who make up working groups.
Revenue
Friends of the Earth Europe receives funding from a variety of government and non-government sources. These include the European Commission under the ‘LIFE+ regulation’, the European Climate Foundation, Oak Foundation, and Isvara Foundation, amongst others. It also gets membership fees from national Friends of the Earth groups.
References
Friends of the Earth
Anti-nuclear organizations
International climate change organizations
Environmental organisations based in Belgium
|
```go
//go:build !linux
// +build !linux
//
//
// 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.
// This is a sample chained plugin that supports multiple CNI versions. It
// parses prevResult according to the cniVersion
package plugin
import "errors"
// ErrNotImplemented is returned when a requested feature is not implemented.
var ErrNotImplemented = errors.New("not implemented")
// Program defines a method which programs iptables based on the parameters
// provided in Redirect.
func (ipt *iptables) Program(podName, netns string, rdrct *Redirect) error {
return ErrNotImplemented
}
```
|
```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.shardingsphere.infra.database.testcontainers.type;
import org.apache.shardingsphere.infra.database.core.type.DatabaseType;
import org.apache.shardingsphere.infra.spi.type.typed.TypedSPILoader;
import java.util.Collection;
import java.util.Collections;
import java.util.Optional;
/**
* Database type of MSSQL Server in testcontainers-java.
*/
public final class TcSQLServerDatabaseType implements TestcontainersDatabaseType {
@Override
public Collection<String> getJdbcUrlPrefixes() {
return Collections.singleton("jdbc:tc:sqlserver:");
}
@Override
public Optional<DatabaseType> getTrunkDatabaseType() {
return Optional.of(TypedSPILoader.getService(DatabaseType.class, "SQLServer"));
}
@Override
public String getType() {
return "TC-SQLServer";
}
}
```
|
HMS Swindon was a Hunt-class minesweeper of the Aberdare sub-class built for the Royal Navy during World War I. She was not finished in time to participate in the First World War and was sold into civilian service in 1921.
Design and description
The Aberdare sub-class were enlarged versions of the original Hunt-class ships with a more powerful armament. The ships displaced at normal load. They had a length between perpendiculars of and measured long overall. The Aberdares had a beam of and a draught of . The ships' complement consisted of 74 officers and ratings.
The ships had two vertical triple-expansion steam engines, each driving one shaft, using steam provided by two Yarrow boilers. The engines produced a total of and gave a maximum speed of . They carried a maximum of of coal which gave them a range of at .
The Aberdare sub-class was armed with a quick-firing (QF) gun forward of the bridge and a QF twelve-pounder (76.2 mm) anti-aircraft gun aft. Some ships were fitted with six- or three-pounder guns in lieu of the twelve-pounder.
Construction and career
Swindon was renamed from HMS Bantry in 1918 to avoid any conflict between the vessel name and a coastal location. In 1921 she was sold off and converted to a coastal passenger/freight steamer by the Coaster Construction Co of Montrose, Scotland for the Union Steamship Co of British Columbia. She was laid up and sold to Coast Ferries in 1951, then scrapped at Gambier Island, BC in 1952.
See also
Swindon, Wiltshire
Notes
References
Hunt-class minesweepers (1916)
Royal Navy ship names
1918 ships
|
```c++
namespace Envoy {
void foo() {
grpc_shutdown();
}
} // namespace Envoy
```
|
Melwin Beckman (born 2000) is a Polish handball player for HK Aranäs and the Polish national team.
References
2000 births
Living people
People from Kungsbacka
Expatriate handball players
Polish male handball players
21st-century Polish people
|
```xml
<?xml version="1.0" encoding="UTF-8"?>
<xliff xmlns="urn:oasis:names:tc:xliff:document:1.2" version="1.2">
<file source-language="en" target-language="ca" datatype="plaintext" original="email.en.xlf">
<body>
</body>
</file>
</xliff>
```
|
Yvonne Furneaux (born Elisabeth Yvonne Scatcherd; 11 May 1926) is a French-British retired actress. A graduate of the Royal Academy of Dramatic Art, she worked with notable filmmakers like Peter Brook, Federico Fellini, Roman Polanski, Michelangelo Antonioni, and Claude Chabrol, as well as in several genre productions.
Early life
Furneaux was born Elisabeth Yvonne Scatcherd to English parents living in Roubaix, France. Her Yorkshireman father, Joseph Scatcherd, was a director at a local branch of Lloyds Bank. Her mother, Amy Furneaux, was from Devon. She had a sister, Jeanne.
The family moved to England prior to the outbreak of World War II, and Yvonne enrolled in St Hilda's College, Oxford in 1946 to study Modern Languages, where she was known as "Tessa Scatcherd". While studying at Oxford she became involved in university theatre groups, and after graduating enrolled in the Royal Academy of Dramatic Art.
Career
Furneaux made her stage debut at the age of 24. She played in productions of Macbeth and The Taming of the Shrew, and was photographed by Norman Parkinson as one of "The Young Look in the Theatre" for the January 1953 issue of Vogue.
She made her film debut with a minor role in Anthony Pelissier's omnibus comedy Meet Me Tonight (1952). She subsequently played several supporting parts, including in Peter Brook's 1953 film version of The Beggar's Opera, the adventure films The Master of Ballantrae and The Dark Avenger, and the mystery film The House of the Arrow. She played the female lead in the Hammer horror film The Mummy.
In 1955, she starred in Michelangelo Antonioni's Le Amiche, which won the Silver Lion at the Venice Film Festival, and launched a successful parallel career in Italian cinema. She played Emma, the fiancée to Marcello Mastroianni's character, in Federico Fellini's La Dolce Vita. She played leading roles in several peplum films, and she returned to her native France to star in a pair of films for director Claude Autant-Lara (The Count of Monte Cristo and Enough Rope).
In 1965, she played the sister of Catherine Deneuve's character in Roman Polanski's psychological thriller Repulsion.
Personal life
She was married to the cinematographer Jacques Natteau, who died on 17 April 2007. They had one son, Nicholas. Since 1985, she has resided in Lausanne, Switzerland.
Filmography
Film
Television
References
External links
Yvonne Furneaux at aenigma
1926 births
Living people
20th-century British actresses
20th-century French actresses
Alumni of St Hilda's College, Oxford
British film actresses
British people of French descent
British expatriates in Switzerland
French film actresses
French expatriates in Switzerland
French expatriates in the United Kingdom
French emigrants to England
French people of English descent
People from Roubaix
RADA
|
The T140W TSS was the last motorcycle model made by Triumph Engineering at their Meriden factory.
Development history
Designed to appeal to the US market, the TSS had an eight valve Weslake Engineering cylinder head developed by Triumph's Brian Jones from a 1978/9 design originally commissioned from Nourish Racing of Rutland following 1960s designs for the 650cc twins by the Rickman Brothers.
The crank was a fully machined single forging with increased big end diameter making it much stiffer and better-balanced and producing one of the smoothest running motorcycles in the Triumph range. The head had smaller valves set at a steeper angle (30°). Recesses in the pistons allowed a 10:1 compression ratio.
UK models had a pair of 34 mm Amal MkII carburetors while the export models had Bing constant velocity carburetors. Other changes from the standard T140E included offset connecting rods, steel-linered alloy barrels, a strengthened swinging arm, and a high output three-phase alternator.
A modified TSS raced by Jon Minonno for Texan Jack Wilson's Big D Triumph dealership achieved outstanding results in the Battle of the Twins races for 1981–1982.
Specification
Launched in 1982 with an electric starter as standard, the all-new top end of the engine featured Cooper rings sealing the 8-valve cylinder head to the barrel. American Morris alloy wheels were an option with dual Automotive Products Lockheed disc brakes upfront as standard. The fins of the black painted engine were polished although, like the Triumph TR65 Thunderbird, many alloy cycle parts that had in the past been bright–polished or chromed were now painted satin black. Mudguards were stainless steel as were the Italian Radaelli rims for the wire-spoked wheel option. The high specification air-oil 'Strada' rear suspension units were supplied by Italian firm Marzocchi. Like the Italian–sourced petrol tank, other OEM components were now from mainland Europe: French Veglia clocks, Italian Paioli petrol taps and German Bumm mirrors, Magura choke lever and ULO direction indicators
Unlike most Triumph models, no USA style with high handlebars and two-gallon tank was officially specified (until the TSX8-see below), all advertised models coming with the Italian four-gallon tank and low handlebars as well as the newly introduced alloy 'dog leg' clutch and front brake levers. The actual version exported to the USA received a black paint scheme with gold-lined red 'wings' along with newly shaped megaphone mufflers and German Bing carburettors. A one-off variant in line with the Triumph Bonneville T140EX Executive was produced for a London dealer, albeit again in gold-lined black, but with the Executive's standard Brealey-Smith 'Sabre' fairing and luggage by Sigma. All TSS were shod with Avon Roadrunner tyres.
Only 112 TSS bikes were actually exported by Triumph, as on 26 August 1983 the factory at Meriden went into voluntary liquidation. It is calculated that 438 TSS units were made in total.
The TSS, particularly the engine, was generally well received by the British and international press although a long term test by Motor Cycle Weekly revealed early cylinder heads to be porous and wet weather braking failure. In an interview in US magazine, Motorcyclist, Meriden's Director of Engineering, Brian Jones revealed that the epoxy coating on the initial cylinder heads supplied by Weslake disguised the porosity problem from their factory testers.
TSSAV
Fitting an eight-valve engine in an anti-vibration frame was first mooted by the factory at the 1981 Earls Court motorcycle show on the prototype super-tourer, TS8-1. Now displayed at the London Motorcycle Museum, the TS8-1 had plastic bodywork by Ian Dyson of contracted stylists, Plastic Fantastic.
For the unrealised 1984 range, the TSS was to have had Meriden's 'Enforcer' anti-vibration frame as standard where the engine was rubber-mounted in a special anti-vibration frame. Styling changes included the adoption of parts from the Triumph T140 TSX model such as the abbreviated rear mudguard albeit in stainless steel and side panels with a TSX-styled TSS badge affixed. These replaced the original side panels which had been extended to cover the Bing carburettor linkages on the USA export models. A plastic 'ducktail' seat unit was mounted above the shortened rear mudguard of the projected 1984 civilian model and rear set footrests, brake and gear shift mechanisms fitted. Police TSS AV retained the standard footrest/control arrangement as well as conventional cycle parts over the ducktail and TSX parts. Due to the height clearance limitations caused by the engine jogging about its rubber mounts within the Enforcer frame, the shorter Amal Mk2 carburettors instead of Bings were fitted.
Only three examples of the TSS AV in police and civilian specification were ever made(and one bare frame) including one for the late Chris Buckle, proprietor of former Triumph dealers, Roebucks Motorcycles. Not quite to the envisaged 1984 specification, this was made on 27 June 1983 and is, according to the factory production records held by the Vintage Motor Cycle Club, the last complete Meriden Triumph. This is the pictured burgundy-coloured example now on display at the National Motorcycle Museum in Solihull, West Midlands close to the former factory site. It was factory -fitted with Koni rear suspension units and omitted the 'ducktail' in favour of the conventional rear mudguard arrangement.
TSX8
Another prototype from the unrealised 1984 range, a TSS engine, with Bings, in Triumph T140 TSX cycle parts was to be marketed as the TSX8, the original four-valve version renamed as the TSX4. Wayne Moulton who designed the TSX, had originally done so with the 8-valve TSS engine in mind.
Notes
T140W TSS
Motorcycles powered by straight-twin engines
|
```vue
<template lang="html">
<div class="main-wrapper page-container">
<div class="ant-row">
<div class="aside-container ant-col-xs-24 ant-col-sm-24 ant-col-md-6 ant-col-lg-4">
<v-menu mode="inline" :data="menuData" :expand="true">
<template slot-scope="{data}">
<a v-if="data.href" :href="data.href" style="display:inline" :target="data.target">{{data.name}}</a>
<router-link v-else :to="data.link" style="display:inline" :target="data.target">{{data.name}}</router-link>
</template>
</v-menu>
</div>
<div class="main-container ant-col-xs-24 ant-col-sm-24 ant-col-md-18 ant-col-lg-20">
<router-view keep-alive class="markdown"></router-view>
</div>
</div>
</div>
</template>
<script>
export default {
data: () => ({
menuData: [{
name: '',
children: [{
name: '',
link: { name: 'start' },
}, {
name: 'CSS',
link: { name: 'css' },
}, {
name: 'Polyfill',
link: { name: 'polyfill' },
}, {
name: '',
link: { name: 'contribute' },
}],
}, {
name: '',
href: 'path_to_url
target: '_blank',
}, {
name: 'Components',
groups: [{
groupName: 'General',
list: [{
name: 'Button ',
link: { name: 'button' },
}, {
name: 'Icon ',
link: { name: 'icon' },
}],
}, {
groupName: 'Layout',
list: [{
name: 'Grid ',
link: { name: 'grid' },
}, {
name: 'Layout ',
link: { name: 'layout' },
}, {
name: 'MorePanel ',
link: { name: 'morePanel' },
}],
}, {
groupName: 'Navigation',
list: [{
name: 'Affix ',
link: { name: 'affix' },
}, {
name: 'Breadcrumb ',
link: { name: 'breadcrumb' },
}, {
name: 'Menu ',
link: { name: 'menu' },
}, {
name: 'Dropdown ',
link: { name: 'dropdown' },
}, {
name: 'Pagination ',
link: { name: 'pagination' },
}, {
name: 'Steps ',
link: { name: 'steps' },
}, {
name: 'Tabs ',
link: { name: 'tabs' },
}],
}, {
groupName: 'Data Entry',
list: [{
name: 'AutoComplete ',
link: { name: 'autoComplete' },
}, {
name: 'Cascader ',
link: { name: 'cascader' },
}, {
name: 'DatePicker ',
link: { name: 'datePicker' },
}, {
name: 'Form ',
link: { name: 'form' },
}, {
name: 'InputNumber ',
link: { name: 'inputNumber' },
}, {
name: 'Input ',
link: { name: 'input' },
}, {
name: 'Rate ',
link: { name: 'rate' },
}, {
name: 'Radio ',
link: { name: 'radio' },
}, {
name: 'Checkbox ',
link: { name: 'checkbox' },
}, {
name: 'Select ',
link: { name: 'select' },
}, {
name: 'Slider ',
link: { name: 'slider' },
}, {
name: 'Switch ',
link: { name: 'switch' },
}, {
name: 'TreeSelect ',
link: { name: 'treeSelect' },
}, {
name: 'TimePicker ',
link: { name: 'timePicker' },
}, {
name: 'Transfer ',
link: { name: 'transfer' },
}, {
name: 'Upload ',
link: { name: 'upload' },
}],
}, {
groupName: 'Data Display',
list: [{
name: 'Avatar ',
link: { name: 'avatar' },
}, {
name: 'Badge ',
link: { name: 'badge' },
}, {
name: 'Card ',
link: { name: 'card' },
}, {
name: 'Carousel ',
link: { name: 'carousel' },
}, {
name: 'Collapse ',
link: { name: 'collapse' },
}, {
name: 'Popover ',
link: { name: 'popover' },
}, {
name: 'Tooltip ',
link: { name: 'tooltip' },
}, {
name: 'DataTable ',
link: { name: 'dataTable' },
}, {
name: 'Tag ',
link: { name: 'tag' },
}, {
name: 'Timeline ',
link: { name: 'timeline' },
}, {
name: 'Tree ',
link: { name: 'tree' },
}],
}, {
groupName: 'Feedback',
list: [{
name: 'Alert ',
link: { name: 'alert' },
}, {
name: 'Message ',
link: { name: 'message' },
}, {
name: 'Modal ',
link: { name: 'modal' },
}, {
name: 'Notification ',
link: { name: 'notification' },
}, {
name: 'Progress ',
link: { name: 'progress' },
}, {
name: 'Popconfirm ',
link: { name: 'popconfirm' },
}, {
name: 'Spin',
link: { name: 'spin' },
}],
}, {
groupName: 'Other',
list: [{
name: 'BackTop ',
link: { name: 'backTop' },
}],
}],
}, {
name: 'Directives',
children: [{
name: 'Tooltip ',
link: { name: 'tooltipd' },
}],
}],
}),
};
</script>
<style lang="less">
.main-wrapper {
background: #fff;
width: 92%;
margin: 0 auto;
border-radius: 4px;
overflow: hidden;
padding: 24px 0 0;
margin-bottom: 24px;
position: relative;
}
.main-container {
padding: 0 6% 120px 4% !important;
margin-left: -1px;
min-height: 500px;
border-left: 1px solid #e9e9e9;
}
.page-container {
/*color: #666;*/
font-size: 14px;
line-height: 1.5;
h1 {
color: #404040;
font-weight: 500;
line-height: 40px;
margin-bottom: 24px;
margin-top: 8px;
font-size: 28px;
font-family: lato, Helvetica Neue, Helvetica, PingFang SC, Hiragino Sans GB, Microsoft YaHei, Arial, sans-serif;
}
& > h2 {
font-size: 24px;
}
hr {
border-radius: 10px;
height: 3px;
border: 0;
background: #eee;
margin: 20px 0;
}
code, kbd, pre, samp {
font-family: Consolas, monospace;
}
code {
margin: 0 3px;
}
& > ul li {
list-style: circle;
margin-left: 20px;
}
& > ol li {
list-style: decimal;
margin-left: 20px;
padding-left: 8px;
}
.table {
font-size: 13px;
border-collapse: collapse;
border-spacing: 0px;
empty-cells: show;
border: 1px solid #e9e9e9;
width: 100%;
margin: 16px 0;
th{
background: #F7F7F7;
white-space: nowrap;
color: #5C6B77;
font-weight: 600;
}
td:first-child {
background: #fcfcfc;
font-weight: 500;
width: 20%;
font-family: "Lucida Console", Consolas, Menlo, Courier, monospace;
}
th,td{
border: 1px solid #e9e9e9;
padding: 8px 16px;
text-align: left;
}
}
}
.main-container > section > h3 {
color: #404040;
font-family: lato, Helvetica Neue, Helvetica, PingFang SC, Hiragino Sans GB, Microsoft YaHei, Arial, sans-serif;
margin: 1.6em 0 .6em;
font-weight: 500;
clear: both;
}
.code-boxes-col-2-1 {
display: inline-block;
vertical-align: top;
padding: 0 8px;
}
.aside-container {
padding-bottom: 50px;
}
.aside-container .ant-menu-item a, .aside-container .ant-menu-submenu-name span, .aside-container > .ant-menu-item {
font-size: 14px;
text-overflow: ellipsis;
overflow: hidden;
}
.header-anchor {
margin-left: -18px;
}
.markdown {
& > ul{
margin-top: 1rem;
margin-bottom: 1rem;
& > li {
list-style: circle;
margin-left: 1rem;
}
}
h1, h2, h3{
a{
font-size: .8em;
opacity: 0;
font-weight: normal;
transition: opacity .2s ease-in-out;
}
&:hover a {
opacity: 1;
}
}
blockquote {
font-size: 90%;
color: #999;
border-left: 4px solid #e9e9e9;
padding-left: 0.8em;
margin: 1em 0;
}
code{
margin: 0 1px;
background: #f7f7f7;
padding: .2em .4em;
border-radius: 3px;
font-size: .9em;
border: 1px solid #eee;
}
& > p, & > pre {
margin-top: 1rem;
margin-bottom: 1rem;
}
}
</style>
```
|
Koro Nulu, also known as Koro Ija, is a Plateau language of Nigeria, one of several languages which go by the ethnic name Koro. It is not closely related to other languages. It has very low (~ 7%) lexical similarity with Koro Zuba, which speakers consider to be a variant of the same language (along with the Jilic languages) due to ethnic identity.
However, the Jilic languages are Plateau and Koro Zuba is apparently Nupoid, and Koro Nulu has yet to be classified.
References
Languages of Nigeria
South Plateau languages
|
```go
// Code generated by counterfeiter. DO NOT EDIT.
package fake
import (
"sync"
"github.com/hyperledger/fabric/common/channelconfig"
)
type ApplicationConfigRetriever struct {
GetApplicationConfigStub func(string) (channelconfig.Application, bool)
getApplicationConfigMutex sync.RWMutex
getApplicationConfigArgsForCall []struct {
arg1 string
}
getApplicationConfigReturns struct {
result1 channelconfig.Application
result2 bool
}
getApplicationConfigReturnsOnCall map[int]struct {
result1 channelconfig.Application
result2 bool
}
invocations map[string][][]interface{}
invocationsMutex sync.RWMutex
}
func (fake *ApplicationConfigRetriever) GetApplicationConfig(arg1 string) (channelconfig.Application, bool) {
fake.getApplicationConfigMutex.Lock()
ret, specificReturn := fake.getApplicationConfigReturnsOnCall[len(fake.getApplicationConfigArgsForCall)]
fake.getApplicationConfigArgsForCall = append(fake.getApplicationConfigArgsForCall, struct {
arg1 string
}{arg1})
fake.recordInvocation("GetApplicationConfig", []interface{}{arg1})
fake.getApplicationConfigMutex.Unlock()
if fake.GetApplicationConfigStub != nil {
return fake.GetApplicationConfigStub(arg1)
}
if specificReturn {
return ret.result1, ret.result2
}
fakeReturns := fake.getApplicationConfigReturns
return fakeReturns.result1, fakeReturns.result2
}
func (fake *ApplicationConfigRetriever) GetApplicationConfigCallCount() int {
fake.getApplicationConfigMutex.RLock()
defer fake.getApplicationConfigMutex.RUnlock()
return len(fake.getApplicationConfigArgsForCall)
}
func (fake *ApplicationConfigRetriever) GetApplicationConfigCalls(stub func(string) (channelconfig.Application, bool)) {
fake.getApplicationConfigMutex.Lock()
defer fake.getApplicationConfigMutex.Unlock()
fake.GetApplicationConfigStub = stub
}
func (fake *ApplicationConfigRetriever) GetApplicationConfigArgsForCall(i int) string {
fake.getApplicationConfigMutex.RLock()
defer fake.getApplicationConfigMutex.RUnlock()
argsForCall := fake.getApplicationConfigArgsForCall[i]
return argsForCall.arg1
}
func (fake *ApplicationConfigRetriever) GetApplicationConfigReturns(result1 channelconfig.Application, result2 bool) {
fake.getApplicationConfigMutex.Lock()
defer fake.getApplicationConfigMutex.Unlock()
fake.GetApplicationConfigStub = nil
fake.getApplicationConfigReturns = struct {
result1 channelconfig.Application
result2 bool
}{result1, result2}
}
func (fake *ApplicationConfigRetriever) GetApplicationConfigReturnsOnCall(i int, result1 channelconfig.Application, result2 bool) {
fake.getApplicationConfigMutex.Lock()
defer fake.getApplicationConfigMutex.Unlock()
fake.GetApplicationConfigStub = nil
if fake.getApplicationConfigReturnsOnCall == nil {
fake.getApplicationConfigReturnsOnCall = make(map[int]struct {
result1 channelconfig.Application
result2 bool
})
}
fake.getApplicationConfigReturnsOnCall[i] = struct {
result1 channelconfig.Application
result2 bool
}{result1, result2}
}
func (fake *ApplicationConfigRetriever) Invocations() map[string][][]interface{} {
fake.invocationsMutex.RLock()
defer fake.invocationsMutex.RUnlock()
fake.getApplicationConfigMutex.RLock()
defer fake.getApplicationConfigMutex.RUnlock()
copiedInvocations := map[string][][]interface{}{}
for key, value := range fake.invocations {
copiedInvocations[key] = value
}
return copiedInvocations
}
func (fake *ApplicationConfigRetriever) recordInvocation(key string, args []interface{}) {
fake.invocationsMutex.Lock()
defer fake.invocationsMutex.Unlock()
if fake.invocations == nil {
fake.invocations = map[string][][]interface{}{}
}
if fake.invocations[key] == nil {
fake.invocations[key] = [][]interface{}{}
}
fake.invocations[key] = append(fake.invocations[key], args)
}
```
|
The 2019–20 season was Swansea City's 100th season in the English football league system, and their second season back in the Championship since 2010–11 following relegation from the Premier League in the 2017–18 season. Along with competing in the Championship, the club competed in the FA Cup and EFL Cup losing in the third round of each respectively.
The season covered the period from 1 July 2019 to 30 June 2020 but was extraordinarily extended to 30 July 2020 because of the COVID-19 pandemic.
Club
First-team staff
First-team squad
(on loan from Chelsea)
(on loan from Basel)
(on loan from Liverpool)
(on loan from Watford)
(on loan from Newcastle United)
(on loan from Chelsea)
Transfers
Transfers in
Transfers out
Loans in
Loans out
New contracts
Pre-season
The Swans announced pre-season fixtures against Mansfield Town, Crawley Town, Yeovil Town, Exeter City, Bristol Rovers and Atalanta.
Competitions
Overview
{| class="wikitable" style="text-align: center"
|-
!rowspan=2|Competition
!colspan=8|Record
|-
!
!
!
!
!
!
!
!
|-
| Championship
|-
| FA Cup
|-
| EFL Cup
|-
! Total
Championship
League table
Results summary
Results by matchday
Matches
On Thursday, 20 June 2019, the EFL Championship fixtures were revealed.
Championship play-offs
FA Cup
The second round draw was made live on BBC Two from Etihad Stadium, Micah Richards and Tony Adams conducted the draw.
EFL Cup
The first round draw was made on 20 June. The second round draw was made on 13 August 2019 following the conclusion of all but one first-round matches. The third round draw was confirmed on 28 August 2019, live on Sky Sports.
Statistics
Appearances, goals, and cards
|-
! colspan=14 style=background:#dcdcdc; text-align:center| Goalkeepers
|-
! colspan=14 style=background:#dcdcdc; text-align:center| Defenders
|-
! colspan=14 style=background:#dcdcdc; text-align:center| Midfielders
|-
! colspan=14 style=background:#dcdcdc; text-align:center| Forwards
|-
! colspan=14 style=background:#dcdcdc; text-align:center| Out On Loan
|-
! colspan=14 style=background:#dcdcdc; text-align:center| Left During Season
|-
Disciplinary record
References
Swansea City
Swansea City A.F.C. seasons
Welsh football clubs 2019–20 season
|
```go
// Code generated by protoc-gen-go-pulsar. DO NOT EDIT.
package govv1beta1
import (
_ "cosmossdk.io/api/amino"
fmt "fmt"
runtime "github.com/cosmos/cosmos-proto/runtime"
_ "github.com/cosmos/gogoproto/gogoproto"
protoreflect "google.golang.org/protobuf/reflect/protoreflect"
protoiface "google.golang.org/protobuf/runtime/protoiface"
protoimpl "google.golang.org/protobuf/runtime/protoimpl"
io "io"
reflect "reflect"
sync "sync"
)
var _ protoreflect.List = (*_GenesisState_2_list)(nil)
type _GenesisState_2_list struct {
list *[]*Deposit
}
func (x *_GenesisState_2_list) Len() int {
if x.list == nil {
return 0
}
return len(*x.list)
}
func (x *_GenesisState_2_list) Get(i int) protoreflect.Value {
return protoreflect.ValueOfMessage((*x.list)[i].ProtoReflect())
}
func (x *_GenesisState_2_list) Set(i int, value protoreflect.Value) {
valueUnwrapped := value.Message()
concreteValue := valueUnwrapped.Interface().(*Deposit)
(*x.list)[i] = concreteValue
}
func (x *_GenesisState_2_list) Append(value protoreflect.Value) {
valueUnwrapped := value.Message()
concreteValue := valueUnwrapped.Interface().(*Deposit)
*x.list = append(*x.list, concreteValue)
}
func (x *_GenesisState_2_list) AppendMutable() protoreflect.Value {
v := new(Deposit)
*x.list = append(*x.list, v)
return protoreflect.ValueOfMessage(v.ProtoReflect())
}
func (x *_GenesisState_2_list) Truncate(n int) {
for i := n; i < len(*x.list); i++ {
(*x.list)[i] = nil
}
*x.list = (*x.list)[:n]
}
func (x *_GenesisState_2_list) NewElement() protoreflect.Value {
v := new(Deposit)
return protoreflect.ValueOfMessage(v.ProtoReflect())
}
func (x *_GenesisState_2_list) IsValid() bool {
return x.list != nil
}
var _ protoreflect.List = (*_GenesisState_3_list)(nil)
type _GenesisState_3_list struct {
list *[]*Vote
}
func (x *_GenesisState_3_list) Len() int {
if x.list == nil {
return 0
}
return len(*x.list)
}
func (x *_GenesisState_3_list) Get(i int) protoreflect.Value {
return protoreflect.ValueOfMessage((*x.list)[i].ProtoReflect())
}
func (x *_GenesisState_3_list) Set(i int, value protoreflect.Value) {
valueUnwrapped := value.Message()
concreteValue := valueUnwrapped.Interface().(*Vote)
(*x.list)[i] = concreteValue
}
func (x *_GenesisState_3_list) Append(value protoreflect.Value) {
valueUnwrapped := value.Message()
concreteValue := valueUnwrapped.Interface().(*Vote)
*x.list = append(*x.list, concreteValue)
}
func (x *_GenesisState_3_list) AppendMutable() protoreflect.Value {
v := new(Vote)
*x.list = append(*x.list, v)
return protoreflect.ValueOfMessage(v.ProtoReflect())
}
func (x *_GenesisState_3_list) Truncate(n int) {
for i := n; i < len(*x.list); i++ {
(*x.list)[i] = nil
}
*x.list = (*x.list)[:n]
}
func (x *_GenesisState_3_list) NewElement() protoreflect.Value {
v := new(Vote)
return protoreflect.ValueOfMessage(v.ProtoReflect())
}
func (x *_GenesisState_3_list) IsValid() bool {
return x.list != nil
}
var _ protoreflect.List = (*_GenesisState_4_list)(nil)
type _GenesisState_4_list struct {
list *[]*Proposal
}
func (x *_GenesisState_4_list) Len() int {
if x.list == nil {
return 0
}
return len(*x.list)
}
func (x *_GenesisState_4_list) Get(i int) protoreflect.Value {
return protoreflect.ValueOfMessage((*x.list)[i].ProtoReflect())
}
func (x *_GenesisState_4_list) Set(i int, value protoreflect.Value) {
valueUnwrapped := value.Message()
concreteValue := valueUnwrapped.Interface().(*Proposal)
(*x.list)[i] = concreteValue
}
func (x *_GenesisState_4_list) Append(value protoreflect.Value) {
valueUnwrapped := value.Message()
concreteValue := valueUnwrapped.Interface().(*Proposal)
*x.list = append(*x.list, concreteValue)
}
func (x *_GenesisState_4_list) AppendMutable() protoreflect.Value {
v := new(Proposal)
*x.list = append(*x.list, v)
return protoreflect.ValueOfMessage(v.ProtoReflect())
}
func (x *_GenesisState_4_list) Truncate(n int) {
for i := n; i < len(*x.list); i++ {
(*x.list)[i] = nil
}
*x.list = (*x.list)[:n]
}
func (x *_GenesisState_4_list) NewElement() protoreflect.Value {
v := new(Proposal)
return protoreflect.ValueOfMessage(v.ProtoReflect())
}
func (x *_GenesisState_4_list) IsValid() bool {
return x.list != nil
}
var (
md_GenesisState protoreflect.MessageDescriptor
fd_GenesisState_starting_proposal_id protoreflect.FieldDescriptor
fd_GenesisState_deposits protoreflect.FieldDescriptor
fd_GenesisState_votes protoreflect.FieldDescriptor
fd_GenesisState_proposals protoreflect.FieldDescriptor
fd_GenesisState_deposit_params protoreflect.FieldDescriptor
fd_GenesisState_voting_params protoreflect.FieldDescriptor
fd_GenesisState_tally_params protoreflect.FieldDescriptor
)
func init() {
file_cosmos_gov_v1beta1_genesis_proto_init()
md_GenesisState = File_cosmos_gov_v1beta1_genesis_proto.Messages().ByName("GenesisState")
fd_GenesisState_starting_proposal_id = md_GenesisState.Fields().ByName("starting_proposal_id")
fd_GenesisState_deposits = md_GenesisState.Fields().ByName("deposits")
fd_GenesisState_votes = md_GenesisState.Fields().ByName("votes")
fd_GenesisState_proposals = md_GenesisState.Fields().ByName("proposals")
fd_GenesisState_deposit_params = md_GenesisState.Fields().ByName("deposit_params")
fd_GenesisState_voting_params = md_GenesisState.Fields().ByName("voting_params")
fd_GenesisState_tally_params = md_GenesisState.Fields().ByName("tally_params")
}
var _ protoreflect.Message = (*fastReflection_GenesisState)(nil)
type fastReflection_GenesisState GenesisState
func (x *GenesisState) ProtoReflect() protoreflect.Message {
return (*fastReflection_GenesisState)(x)
}
func (x *GenesisState) slowProtoReflect() protoreflect.Message {
mi := &file_cosmos_gov_v1beta1_genesis_proto_msgTypes[0]
if protoimpl.UnsafeEnabled && x != nil {
ms := protoimpl.X.MessageStateOf(protoimpl.Pointer(x))
if ms.LoadMessageInfo() == nil {
ms.StoreMessageInfo(mi)
}
return ms
}
return mi.MessageOf(x)
}
var _fastReflection_GenesisState_messageType fastReflection_GenesisState_messageType
var _ protoreflect.MessageType = fastReflection_GenesisState_messageType{}
type fastReflection_GenesisState_messageType struct{}
func (x fastReflection_GenesisState_messageType) Zero() protoreflect.Message {
return (*fastReflection_GenesisState)(nil)
}
func (x fastReflection_GenesisState_messageType) New() protoreflect.Message {
return new(fastReflection_GenesisState)
}
func (x fastReflection_GenesisState_messageType) Descriptor() protoreflect.MessageDescriptor {
return md_GenesisState
}
// Descriptor returns message descriptor, which contains only the protobuf
// type information for the message.
func (x *fastReflection_GenesisState) Descriptor() protoreflect.MessageDescriptor {
return md_GenesisState
}
// Type returns the message type, which encapsulates both Go and protobuf
// type information. If the Go type information is not needed,
// it is recommended that the message descriptor be used instead.
func (x *fastReflection_GenesisState) Type() protoreflect.MessageType {
return _fastReflection_GenesisState_messageType
}
// New returns a newly allocated and mutable empty message.
func (x *fastReflection_GenesisState) New() protoreflect.Message {
return new(fastReflection_GenesisState)
}
// Interface unwraps the message reflection interface and
// returns the underlying ProtoMessage interface.
func (x *fastReflection_GenesisState) Interface() protoreflect.ProtoMessage {
return (*GenesisState)(x)
}
// Range iterates over every populated field in an undefined order,
// calling f for each field descriptor and value encountered.
// Range returns immediately if f returns false.
// While iterating, mutating operations may only be performed
// on the current field descriptor.
func (x *fastReflection_GenesisState) Range(f func(protoreflect.FieldDescriptor, protoreflect.Value) bool) {
if x.StartingProposalId != uint64(0) {
value := protoreflect.ValueOfUint64(x.StartingProposalId)
if !f(fd_GenesisState_starting_proposal_id, value) {
return
}
}
if len(x.Deposits) != 0 {
value := protoreflect.ValueOfList(&_GenesisState_2_list{list: &x.Deposits})
if !f(fd_GenesisState_deposits, value) {
return
}
}
if len(x.Votes) != 0 {
value := protoreflect.ValueOfList(&_GenesisState_3_list{list: &x.Votes})
if !f(fd_GenesisState_votes, value) {
return
}
}
if len(x.Proposals) != 0 {
value := protoreflect.ValueOfList(&_GenesisState_4_list{list: &x.Proposals})
if !f(fd_GenesisState_proposals, value) {
return
}
}
if x.DepositParams != nil {
value := protoreflect.ValueOfMessage(x.DepositParams.ProtoReflect())
if !f(fd_GenesisState_deposit_params, value) {
return
}
}
if x.VotingParams != nil {
value := protoreflect.ValueOfMessage(x.VotingParams.ProtoReflect())
if !f(fd_GenesisState_voting_params, value) {
return
}
}
if x.TallyParams != nil {
value := protoreflect.ValueOfMessage(x.TallyParams.ProtoReflect())
if !f(fd_GenesisState_tally_params, value) {
return
}
}
}
// Has reports whether a field is populated.
//
// Some fields have the property of nullability where it is possible to
// distinguish between the default value of a field and whether the field
// was explicitly populated with the default value. Singular message fields,
// member fields of a oneof, and proto2 scalar fields are nullable. Such
// fields are populated only if explicitly set.
//
// In other cases (aside from the nullable cases above),
// a proto3 scalar field is populated if it contains a non-zero value, and
// a repeated field is populated if it is non-empty.
func (x *fastReflection_GenesisState) Has(fd protoreflect.FieldDescriptor) bool {
switch fd.FullName() {
case "cosmos.gov.v1beta1.GenesisState.starting_proposal_id":
return x.StartingProposalId != uint64(0)
case "cosmos.gov.v1beta1.GenesisState.deposits":
return len(x.Deposits) != 0
case "cosmos.gov.v1beta1.GenesisState.votes":
return len(x.Votes) != 0
case "cosmos.gov.v1beta1.GenesisState.proposals":
return len(x.Proposals) != 0
case "cosmos.gov.v1beta1.GenesisState.deposit_params":
return x.DepositParams != nil
case "cosmos.gov.v1beta1.GenesisState.voting_params":
return x.VotingParams != nil
case "cosmos.gov.v1beta1.GenesisState.tally_params":
return x.TallyParams != nil
default:
if fd.IsExtension() {
panic(fmt.Errorf("proto3 declared messages do not support extensions: cosmos.gov.v1beta1.GenesisState"))
}
panic(fmt.Errorf("message cosmos.gov.v1beta1.GenesisState does not contain field %s", fd.FullName()))
}
}
// Clear clears the field such that a subsequent Has call reports false.
//
// Clearing an extension field clears both the extension type and value
// associated with the given field number.
//
// Clear is a mutating operation and unsafe for concurrent use.
func (x *fastReflection_GenesisState) Clear(fd protoreflect.FieldDescriptor) {
switch fd.FullName() {
case "cosmos.gov.v1beta1.GenesisState.starting_proposal_id":
x.StartingProposalId = uint64(0)
case "cosmos.gov.v1beta1.GenesisState.deposits":
x.Deposits = nil
case "cosmos.gov.v1beta1.GenesisState.votes":
x.Votes = nil
case "cosmos.gov.v1beta1.GenesisState.proposals":
x.Proposals = nil
case "cosmos.gov.v1beta1.GenesisState.deposit_params":
x.DepositParams = nil
case "cosmos.gov.v1beta1.GenesisState.voting_params":
x.VotingParams = nil
case "cosmos.gov.v1beta1.GenesisState.tally_params":
x.TallyParams = nil
default:
if fd.IsExtension() {
panic(fmt.Errorf("proto3 declared messages do not support extensions: cosmos.gov.v1beta1.GenesisState"))
}
panic(fmt.Errorf("message cosmos.gov.v1beta1.GenesisState does not contain field %s", fd.FullName()))
}
}
// Get retrieves the value for a field.
//
// For unpopulated scalars, it returns the default value, where
// the default value of a bytes scalar is guaranteed to be a copy.
// For unpopulated composite types, it returns an empty, read-only view
// of the value; to obtain a mutable reference, use Mutable.
func (x *fastReflection_GenesisState) Get(descriptor protoreflect.FieldDescriptor) protoreflect.Value {
switch descriptor.FullName() {
case "cosmos.gov.v1beta1.GenesisState.starting_proposal_id":
value := x.StartingProposalId
return protoreflect.ValueOfUint64(value)
case "cosmos.gov.v1beta1.GenesisState.deposits":
if len(x.Deposits) == 0 {
return protoreflect.ValueOfList(&_GenesisState_2_list{})
}
listValue := &_GenesisState_2_list{list: &x.Deposits}
return protoreflect.ValueOfList(listValue)
case "cosmos.gov.v1beta1.GenesisState.votes":
if len(x.Votes) == 0 {
return protoreflect.ValueOfList(&_GenesisState_3_list{})
}
listValue := &_GenesisState_3_list{list: &x.Votes}
return protoreflect.ValueOfList(listValue)
case "cosmos.gov.v1beta1.GenesisState.proposals":
if len(x.Proposals) == 0 {
return protoreflect.ValueOfList(&_GenesisState_4_list{})
}
listValue := &_GenesisState_4_list{list: &x.Proposals}
return protoreflect.ValueOfList(listValue)
case "cosmos.gov.v1beta1.GenesisState.deposit_params":
value := x.DepositParams
return protoreflect.ValueOfMessage(value.ProtoReflect())
case "cosmos.gov.v1beta1.GenesisState.voting_params":
value := x.VotingParams
return protoreflect.ValueOfMessage(value.ProtoReflect())
case "cosmos.gov.v1beta1.GenesisState.tally_params":
value := x.TallyParams
return protoreflect.ValueOfMessage(value.ProtoReflect())
default:
if descriptor.IsExtension() {
panic(fmt.Errorf("proto3 declared messages do not support extensions: cosmos.gov.v1beta1.GenesisState"))
}
panic(fmt.Errorf("message cosmos.gov.v1beta1.GenesisState does not contain field %s", descriptor.FullName()))
}
}
// Set stores the value for a field.
//
// For a field belonging to a oneof, it implicitly clears any other field
// that may be currently set within the same oneof.
// For extension fields, it implicitly stores the provided ExtensionType.
// When setting a composite type, it is unspecified whether the stored value
// aliases the source's memory in any way. If the composite value is an
// empty, read-only value, then it panics.
//
// Set is a mutating operation and unsafe for concurrent use.
func (x *fastReflection_GenesisState) Set(fd protoreflect.FieldDescriptor, value protoreflect.Value) {
switch fd.FullName() {
case "cosmos.gov.v1beta1.GenesisState.starting_proposal_id":
x.StartingProposalId = value.Uint()
case "cosmos.gov.v1beta1.GenesisState.deposits":
lv := value.List()
clv := lv.(*_GenesisState_2_list)
x.Deposits = *clv.list
case "cosmos.gov.v1beta1.GenesisState.votes":
lv := value.List()
clv := lv.(*_GenesisState_3_list)
x.Votes = *clv.list
case "cosmos.gov.v1beta1.GenesisState.proposals":
lv := value.List()
clv := lv.(*_GenesisState_4_list)
x.Proposals = *clv.list
case "cosmos.gov.v1beta1.GenesisState.deposit_params":
x.DepositParams = value.Message().Interface().(*DepositParams)
case "cosmos.gov.v1beta1.GenesisState.voting_params":
x.VotingParams = value.Message().Interface().(*VotingParams)
case "cosmos.gov.v1beta1.GenesisState.tally_params":
x.TallyParams = value.Message().Interface().(*TallyParams)
default:
if fd.IsExtension() {
panic(fmt.Errorf("proto3 declared messages do not support extensions: cosmos.gov.v1beta1.GenesisState"))
}
panic(fmt.Errorf("message cosmos.gov.v1beta1.GenesisState does not contain field %s", fd.FullName()))
}
}
// Mutable returns a mutable reference to a composite type.
//
// If the field is unpopulated, it may allocate a composite value.
// For a field belonging to a oneof, it implicitly clears any other field
// that may be currently set within the same oneof.
// For extension fields, it implicitly stores the provided ExtensionType
// if not already stored.
// It panics if the field does not contain a composite type.
//
// Mutable is a mutating operation and unsafe for concurrent use.
func (x *fastReflection_GenesisState) Mutable(fd protoreflect.FieldDescriptor) protoreflect.Value {
switch fd.FullName() {
case "cosmos.gov.v1beta1.GenesisState.deposits":
if x.Deposits == nil {
x.Deposits = []*Deposit{}
}
value := &_GenesisState_2_list{list: &x.Deposits}
return protoreflect.ValueOfList(value)
case "cosmos.gov.v1beta1.GenesisState.votes":
if x.Votes == nil {
x.Votes = []*Vote{}
}
value := &_GenesisState_3_list{list: &x.Votes}
return protoreflect.ValueOfList(value)
case "cosmos.gov.v1beta1.GenesisState.proposals":
if x.Proposals == nil {
x.Proposals = []*Proposal{}
}
value := &_GenesisState_4_list{list: &x.Proposals}
return protoreflect.ValueOfList(value)
case "cosmos.gov.v1beta1.GenesisState.deposit_params":
if x.DepositParams == nil {
x.DepositParams = new(DepositParams)
}
return protoreflect.ValueOfMessage(x.DepositParams.ProtoReflect())
case "cosmos.gov.v1beta1.GenesisState.voting_params":
if x.VotingParams == nil {
x.VotingParams = new(VotingParams)
}
return protoreflect.ValueOfMessage(x.VotingParams.ProtoReflect())
case "cosmos.gov.v1beta1.GenesisState.tally_params":
if x.TallyParams == nil {
x.TallyParams = new(TallyParams)
}
return protoreflect.ValueOfMessage(x.TallyParams.ProtoReflect())
case "cosmos.gov.v1beta1.GenesisState.starting_proposal_id":
panic(fmt.Errorf("field starting_proposal_id of message cosmos.gov.v1beta1.GenesisState is not mutable"))
default:
if fd.IsExtension() {
panic(fmt.Errorf("proto3 declared messages do not support extensions: cosmos.gov.v1beta1.GenesisState"))
}
panic(fmt.Errorf("message cosmos.gov.v1beta1.GenesisState does not contain field %s", fd.FullName()))
}
}
// NewField returns a new value that is assignable to the field
// for the given descriptor. For scalars, this returns the default value.
// For lists, maps, and messages, this returns a new, empty, mutable value.
func (x *fastReflection_GenesisState) NewField(fd protoreflect.FieldDescriptor) protoreflect.Value {
switch fd.FullName() {
case "cosmos.gov.v1beta1.GenesisState.starting_proposal_id":
return protoreflect.ValueOfUint64(uint64(0))
case "cosmos.gov.v1beta1.GenesisState.deposits":
list := []*Deposit{}
return protoreflect.ValueOfList(&_GenesisState_2_list{list: &list})
case "cosmos.gov.v1beta1.GenesisState.votes":
list := []*Vote{}
return protoreflect.ValueOfList(&_GenesisState_3_list{list: &list})
case "cosmos.gov.v1beta1.GenesisState.proposals":
list := []*Proposal{}
return protoreflect.ValueOfList(&_GenesisState_4_list{list: &list})
case "cosmos.gov.v1beta1.GenesisState.deposit_params":
m := new(DepositParams)
return protoreflect.ValueOfMessage(m.ProtoReflect())
case "cosmos.gov.v1beta1.GenesisState.voting_params":
m := new(VotingParams)
return protoreflect.ValueOfMessage(m.ProtoReflect())
case "cosmos.gov.v1beta1.GenesisState.tally_params":
m := new(TallyParams)
return protoreflect.ValueOfMessage(m.ProtoReflect())
default:
if fd.IsExtension() {
panic(fmt.Errorf("proto3 declared messages do not support extensions: cosmos.gov.v1beta1.GenesisState"))
}
panic(fmt.Errorf("message cosmos.gov.v1beta1.GenesisState does not contain field %s", fd.FullName()))
}
}
// WhichOneof reports which field within the oneof is populated,
// returning nil if none are populated.
// It panics if the oneof descriptor does not belong to this message.
func (x *fastReflection_GenesisState) WhichOneof(d protoreflect.OneofDescriptor) protoreflect.FieldDescriptor {
switch d.FullName() {
default:
panic(fmt.Errorf("%s is not a oneof field in cosmos.gov.v1beta1.GenesisState", d.FullName()))
}
panic("unreachable")
}
// GetUnknown retrieves the entire list of unknown fields.
// The caller may only mutate the contents of the RawFields
// if the mutated bytes are stored back into the message with SetUnknown.
func (x *fastReflection_GenesisState) GetUnknown() protoreflect.RawFields {
return x.unknownFields
}
// SetUnknown stores an entire list of unknown fields.
// The raw fields must be syntactically valid according to the wire format.
// An implementation may panic if this is not the case.
// Once stored, the caller must not mutate the content of the RawFields.
// An empty RawFields may be passed to clear the fields.
//
// SetUnknown is a mutating operation and unsafe for concurrent use.
func (x *fastReflection_GenesisState) SetUnknown(fields protoreflect.RawFields) {
x.unknownFields = fields
}
// IsValid reports whether the message is valid.
//
// An invalid message is an empty, read-only value.
//
// An invalid message often corresponds to a nil pointer of the concrete
// message type, but the details are implementation dependent.
// Validity is not part of the protobuf data model, and may not
// be preserved in marshaling or other operations.
func (x *fastReflection_GenesisState) IsValid() bool {
return x != nil
}
// ProtoMethods returns optional fastReflectionFeature-path implementations of various operations.
// This method may return nil.
//
// The returned methods type is identical to
// "google.golang.org/protobuf/runtime/protoiface".Methods.
// Consult the protoiface package documentation for details.
func (x *fastReflection_GenesisState) ProtoMethods() *protoiface.Methods {
size := func(input protoiface.SizeInput) protoiface.SizeOutput {
x := input.Message.Interface().(*GenesisState)
if x == nil {
return protoiface.SizeOutput{
NoUnkeyedLiterals: input.NoUnkeyedLiterals,
Size: 0,
}
}
options := runtime.SizeInputToOptions(input)
_ = options
var n int
var l int
_ = l
if x.StartingProposalId != 0 {
n += 1 + runtime.Sov(uint64(x.StartingProposalId))
}
if len(x.Deposits) > 0 {
for _, e := range x.Deposits {
l = options.Size(e)
n += 1 + l + runtime.Sov(uint64(l))
}
}
if len(x.Votes) > 0 {
for _, e := range x.Votes {
l = options.Size(e)
n += 1 + l + runtime.Sov(uint64(l))
}
}
if len(x.Proposals) > 0 {
for _, e := range x.Proposals {
l = options.Size(e)
n += 1 + l + runtime.Sov(uint64(l))
}
}
if x.DepositParams != nil {
l = options.Size(x.DepositParams)
n += 1 + l + runtime.Sov(uint64(l))
}
if x.VotingParams != nil {
l = options.Size(x.VotingParams)
n += 1 + l + runtime.Sov(uint64(l))
}
if x.TallyParams != nil {
l = options.Size(x.TallyParams)
n += 1 + l + runtime.Sov(uint64(l))
}
if x.unknownFields != nil {
n += len(x.unknownFields)
}
return protoiface.SizeOutput{
NoUnkeyedLiterals: input.NoUnkeyedLiterals,
Size: n,
}
}
marshal := func(input protoiface.MarshalInput) (protoiface.MarshalOutput, error) {
x := input.Message.Interface().(*GenesisState)
if x == nil {
return protoiface.MarshalOutput{
NoUnkeyedLiterals: input.NoUnkeyedLiterals,
Buf: input.Buf,
}, nil
}
options := runtime.MarshalInputToOptions(input)
_ = options
size := options.Size(x)
dAtA := make([]byte, size)
i := len(dAtA)
_ = i
var l int
_ = l
if x.unknownFields != nil {
i -= len(x.unknownFields)
copy(dAtA[i:], x.unknownFields)
}
if x.TallyParams != nil {
encoded, err := options.Marshal(x.TallyParams)
if err != nil {
return protoiface.MarshalOutput{
NoUnkeyedLiterals: input.NoUnkeyedLiterals,
Buf: input.Buf,
}, err
}
i -= len(encoded)
copy(dAtA[i:], encoded)
i = runtime.EncodeVarint(dAtA, i, uint64(len(encoded)))
i--
dAtA[i] = 0x3a
}
if x.VotingParams != nil {
encoded, err := options.Marshal(x.VotingParams)
if err != nil {
return protoiface.MarshalOutput{
NoUnkeyedLiterals: input.NoUnkeyedLiterals,
Buf: input.Buf,
}, err
}
i -= len(encoded)
copy(dAtA[i:], encoded)
i = runtime.EncodeVarint(dAtA, i, uint64(len(encoded)))
i--
dAtA[i] = 0x32
}
if x.DepositParams != nil {
encoded, err := options.Marshal(x.DepositParams)
if err != nil {
return protoiface.MarshalOutput{
NoUnkeyedLiterals: input.NoUnkeyedLiterals,
Buf: input.Buf,
}, err
}
i -= len(encoded)
copy(dAtA[i:], encoded)
i = runtime.EncodeVarint(dAtA, i, uint64(len(encoded)))
i--
dAtA[i] = 0x2a
}
if len(x.Proposals) > 0 {
for iNdEx := len(x.Proposals) - 1; iNdEx >= 0; iNdEx-- {
encoded, err := options.Marshal(x.Proposals[iNdEx])
if err != nil {
return protoiface.MarshalOutput{
NoUnkeyedLiterals: input.NoUnkeyedLiterals,
Buf: input.Buf,
}, err
}
i -= len(encoded)
copy(dAtA[i:], encoded)
i = runtime.EncodeVarint(dAtA, i, uint64(len(encoded)))
i--
dAtA[i] = 0x22
}
}
if len(x.Votes) > 0 {
for iNdEx := len(x.Votes) - 1; iNdEx >= 0; iNdEx-- {
encoded, err := options.Marshal(x.Votes[iNdEx])
if err != nil {
return protoiface.MarshalOutput{
NoUnkeyedLiterals: input.NoUnkeyedLiterals,
Buf: input.Buf,
}, err
}
i -= len(encoded)
copy(dAtA[i:], encoded)
i = runtime.EncodeVarint(dAtA, i, uint64(len(encoded)))
i--
dAtA[i] = 0x1a
}
}
if len(x.Deposits) > 0 {
for iNdEx := len(x.Deposits) - 1; iNdEx >= 0; iNdEx-- {
encoded, err := options.Marshal(x.Deposits[iNdEx])
if err != nil {
return protoiface.MarshalOutput{
NoUnkeyedLiterals: input.NoUnkeyedLiterals,
Buf: input.Buf,
}, err
}
i -= len(encoded)
copy(dAtA[i:], encoded)
i = runtime.EncodeVarint(dAtA, i, uint64(len(encoded)))
i--
dAtA[i] = 0x12
}
}
if x.StartingProposalId != 0 {
i = runtime.EncodeVarint(dAtA, i, uint64(x.StartingProposalId))
i--
dAtA[i] = 0x8
}
if input.Buf != nil {
input.Buf = append(input.Buf, dAtA...)
} else {
input.Buf = dAtA
}
return protoiface.MarshalOutput{
NoUnkeyedLiterals: input.NoUnkeyedLiterals,
Buf: input.Buf,
}, nil
}
unmarshal := func(input protoiface.UnmarshalInput) (protoiface.UnmarshalOutput, error) {
x := input.Message.Interface().(*GenesisState)
if x == nil {
return protoiface.UnmarshalOutput{
NoUnkeyedLiterals: input.NoUnkeyedLiterals,
Flags: input.Flags,
}, nil
}
options := runtime.UnmarshalInputToOptions(input)
_ = options
dAtA := input.Buf
l := len(dAtA)
iNdEx := 0
for iNdEx < l {
preIndex := iNdEx
var wire uint64
for shift := uint(0); ; shift += 7 {
if shift >= 64 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrIntOverflow
}
if iNdEx >= l {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, io.ErrUnexpectedEOF
}
b := dAtA[iNdEx]
iNdEx++
wire |= uint64(b&0x7F) << shift
if b < 0x80 {
break
}
}
fieldNum := int32(wire >> 3)
wireType := int(wire & 0x7)
if wireType == 4 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, fmt.Errorf("proto: GenesisState: wiretype end group for non-group")
}
if fieldNum <= 0 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, fmt.Errorf("proto: GenesisState: illegal tag %d (wire type %d)", fieldNum, wire)
}
switch fieldNum {
case 1:
if wireType != 0 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, fmt.Errorf("proto: wrong wireType = %d for field StartingProposalId", wireType)
}
x.StartingProposalId = 0
for shift := uint(0); ; shift += 7 {
if shift >= 64 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrIntOverflow
}
if iNdEx >= l {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, io.ErrUnexpectedEOF
}
b := dAtA[iNdEx]
iNdEx++
x.StartingProposalId |= uint64(b&0x7F) << shift
if b < 0x80 {
break
}
}
case 2:
if wireType != 2 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, fmt.Errorf("proto: wrong wireType = %d for field Deposits", wireType)
}
var msglen int
for shift := uint(0); ; shift += 7 {
if shift >= 64 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrIntOverflow
}
if iNdEx >= l {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, io.ErrUnexpectedEOF
}
b := dAtA[iNdEx]
iNdEx++
msglen |= int(b&0x7F) << shift
if b < 0x80 {
break
}
}
if msglen < 0 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrInvalidLength
}
postIndex := iNdEx + msglen
if postIndex < 0 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrInvalidLength
}
if postIndex > l {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, io.ErrUnexpectedEOF
}
x.Deposits = append(x.Deposits, &Deposit{})
if err := options.Unmarshal(dAtA[iNdEx:postIndex], x.Deposits[len(x.Deposits)-1]); err != nil {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, err
}
iNdEx = postIndex
case 3:
if wireType != 2 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, fmt.Errorf("proto: wrong wireType = %d for field Votes", wireType)
}
var msglen int
for shift := uint(0); ; shift += 7 {
if shift >= 64 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrIntOverflow
}
if iNdEx >= l {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, io.ErrUnexpectedEOF
}
b := dAtA[iNdEx]
iNdEx++
msglen |= int(b&0x7F) << shift
if b < 0x80 {
break
}
}
if msglen < 0 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrInvalidLength
}
postIndex := iNdEx + msglen
if postIndex < 0 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrInvalidLength
}
if postIndex > l {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, io.ErrUnexpectedEOF
}
x.Votes = append(x.Votes, &Vote{})
if err := options.Unmarshal(dAtA[iNdEx:postIndex], x.Votes[len(x.Votes)-1]); err != nil {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, err
}
iNdEx = postIndex
case 4:
if wireType != 2 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, fmt.Errorf("proto: wrong wireType = %d for field Proposals", wireType)
}
var msglen int
for shift := uint(0); ; shift += 7 {
if shift >= 64 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrIntOverflow
}
if iNdEx >= l {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, io.ErrUnexpectedEOF
}
b := dAtA[iNdEx]
iNdEx++
msglen |= int(b&0x7F) << shift
if b < 0x80 {
break
}
}
if msglen < 0 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrInvalidLength
}
postIndex := iNdEx + msglen
if postIndex < 0 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrInvalidLength
}
if postIndex > l {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, io.ErrUnexpectedEOF
}
x.Proposals = append(x.Proposals, &Proposal{})
if err := options.Unmarshal(dAtA[iNdEx:postIndex], x.Proposals[len(x.Proposals)-1]); err != nil {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, err
}
iNdEx = postIndex
case 5:
if wireType != 2 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, fmt.Errorf("proto: wrong wireType = %d for field DepositParams", wireType)
}
var msglen int
for shift := uint(0); ; shift += 7 {
if shift >= 64 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrIntOverflow
}
if iNdEx >= l {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, io.ErrUnexpectedEOF
}
b := dAtA[iNdEx]
iNdEx++
msglen |= int(b&0x7F) << shift
if b < 0x80 {
break
}
}
if msglen < 0 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrInvalidLength
}
postIndex := iNdEx + msglen
if postIndex < 0 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrInvalidLength
}
if postIndex > l {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, io.ErrUnexpectedEOF
}
if x.DepositParams == nil {
x.DepositParams = &DepositParams{}
}
if err := options.Unmarshal(dAtA[iNdEx:postIndex], x.DepositParams); err != nil {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, err
}
iNdEx = postIndex
case 6:
if wireType != 2 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, fmt.Errorf("proto: wrong wireType = %d for field VotingParams", wireType)
}
var msglen int
for shift := uint(0); ; shift += 7 {
if shift >= 64 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrIntOverflow
}
if iNdEx >= l {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, io.ErrUnexpectedEOF
}
b := dAtA[iNdEx]
iNdEx++
msglen |= int(b&0x7F) << shift
if b < 0x80 {
break
}
}
if msglen < 0 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrInvalidLength
}
postIndex := iNdEx + msglen
if postIndex < 0 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrInvalidLength
}
if postIndex > l {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, io.ErrUnexpectedEOF
}
if x.VotingParams == nil {
x.VotingParams = &VotingParams{}
}
if err := options.Unmarshal(dAtA[iNdEx:postIndex], x.VotingParams); err != nil {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, err
}
iNdEx = postIndex
case 7:
if wireType != 2 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, fmt.Errorf("proto: wrong wireType = %d for field TallyParams", wireType)
}
var msglen int
for shift := uint(0); ; shift += 7 {
if shift >= 64 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrIntOverflow
}
if iNdEx >= l {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, io.ErrUnexpectedEOF
}
b := dAtA[iNdEx]
iNdEx++
msglen |= int(b&0x7F) << shift
if b < 0x80 {
break
}
}
if msglen < 0 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrInvalidLength
}
postIndex := iNdEx + msglen
if postIndex < 0 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrInvalidLength
}
if postIndex > l {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, io.ErrUnexpectedEOF
}
if x.TallyParams == nil {
x.TallyParams = &TallyParams{}
}
if err := options.Unmarshal(dAtA[iNdEx:postIndex], x.TallyParams); err != nil {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, err
}
iNdEx = postIndex
default:
iNdEx = preIndex
skippy, err := runtime.Skip(dAtA[iNdEx:])
if err != nil {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, err
}
if (skippy < 0) || (iNdEx+skippy) < 0 {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, runtime.ErrInvalidLength
}
if (iNdEx + skippy) > l {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, io.ErrUnexpectedEOF
}
if !options.DiscardUnknown {
x.unknownFields = append(x.unknownFields, dAtA[iNdEx:iNdEx+skippy]...)
}
iNdEx += skippy
}
}
if iNdEx > l {
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, io.ErrUnexpectedEOF
}
return protoiface.UnmarshalOutput{NoUnkeyedLiterals: input.NoUnkeyedLiterals, Flags: input.Flags}, nil
}
return &protoiface.Methods{
NoUnkeyedLiterals: struct{}{},
Flags: protoiface.SupportMarshalDeterministic | protoiface.SupportUnmarshalDiscardUnknown,
Size: size,
Marshal: marshal,
Unmarshal: unmarshal,
Merge: nil,
CheckInitialized: nil,
}
}
// Code generated by protoc-gen-go. DO NOT EDIT.
// versions:
// protoc-gen-go v1.27.0
// protoc (unknown)
// source: cosmos/gov/v1beta1/genesis.proto
const (
// Verify that this generated code is sufficiently up-to-date.
_ = protoimpl.EnforceVersion(20 - protoimpl.MinVersion)
// Verify that runtime/protoimpl is sufficiently up-to-date.
_ = protoimpl.EnforceVersion(protoimpl.MaxVersion - 20)
)
// GenesisState defines the gov module's genesis state.
type GenesisState struct {
state protoimpl.MessageState
sizeCache protoimpl.SizeCache
unknownFields protoimpl.UnknownFields
// starting_proposal_id is the ID of the starting proposal.
StartingProposalId uint64 `protobuf:"varint,1,opt,name=starting_proposal_id,json=startingProposalId,proto3" json:"starting_proposal_id,omitempty"`
// deposits defines all the deposits present at genesis.
Deposits []*Deposit `protobuf:"bytes,2,rep,name=deposits,proto3" json:"deposits,omitempty"`
// votes defines all the votes present at genesis.
Votes []*Vote `protobuf:"bytes,3,rep,name=votes,proto3" json:"votes,omitempty"`
// proposals defines all the proposals present at genesis.
Proposals []*Proposal `protobuf:"bytes,4,rep,name=proposals,proto3" json:"proposals,omitempty"`
// deposit_params defines all the parameters related to deposit.
DepositParams *DepositParams `protobuf:"bytes,5,opt,name=deposit_params,json=depositParams,proto3" json:"deposit_params,omitempty"`
// voting_params defines all the parameters related to voting.
VotingParams *VotingParams `protobuf:"bytes,6,opt,name=voting_params,json=votingParams,proto3" json:"voting_params,omitempty"`
// tally_params defines all the parameters related to tally.
TallyParams *TallyParams `protobuf:"bytes,7,opt,name=tally_params,json=tallyParams,proto3" json:"tally_params,omitempty"`
}
func (x *GenesisState) Reset() {
*x = GenesisState{}
if protoimpl.UnsafeEnabled {
mi := &file_cosmos_gov_v1beta1_genesis_proto_msgTypes[0]
ms := protoimpl.X.MessageStateOf(protoimpl.Pointer(x))
ms.StoreMessageInfo(mi)
}
}
func (x *GenesisState) String() string {
return protoimpl.X.MessageStringOf(x)
}
func (*GenesisState) ProtoMessage() {}
// Deprecated: Use GenesisState.ProtoReflect.Descriptor instead.
func (*GenesisState) Descriptor() ([]byte, []int) {
return file_cosmos_gov_v1beta1_genesis_proto_rawDescGZIP(), []int{0}
}
func (x *GenesisState) GetStartingProposalId() uint64 {
if x != nil {
return x.StartingProposalId
}
return 0
}
func (x *GenesisState) GetDeposits() []*Deposit {
if x != nil {
return x.Deposits
}
return nil
}
func (x *GenesisState) GetVotes() []*Vote {
if x != nil {
return x.Votes
}
return nil
}
func (x *GenesisState) GetProposals() []*Proposal {
if x != nil {
return x.Proposals
}
return nil
}
func (x *GenesisState) GetDepositParams() *DepositParams {
if x != nil {
return x.DepositParams
}
return nil
}
func (x *GenesisState) GetVotingParams() *VotingParams {
if x != nil {
return x.VotingParams
}
return nil
}
func (x *GenesisState) GetTallyParams() *TallyParams {
if x != nil {
return x.TallyParams
}
return nil
}
var File_cosmos_gov_v1beta1_genesis_proto protoreflect.FileDescriptor
var file_cosmos_gov_v1beta1_genesis_proto_rawDesc = []byte{
0x0a, 0x20, 0x63, 0x6f, 0x73, 0x6d, 0x6f, 0x73, 0x2f, 0x67, 0x6f, 0x76, 0x2f, 0x76, 0x31, 0x62,
0x65, 0x74, 0x61, 0x31, 0x2f, 0x67, 0x65, 0x6e, 0x65, 0x73, 0x69, 0x73, 0x2e, 0x70, 0x72, 0x6f,
0x74, 0x6f, 0x12, 0x12, 0x63, 0x6f, 0x73, 0x6d, 0x6f, 0x73, 0x2e, 0x67, 0x6f, 0x76, 0x2e, 0x76,
0x31, 0x62, 0x65, 0x74, 0x61, 0x31, 0x1a, 0x14, 0x67, 0x6f, 0x67, 0x6f, 0x70, 0x72, 0x6f, 0x74,
0x6f, 0x2f, 0x67, 0x6f, 0x67, 0x6f, 0x2e, 0x70, 0x72, 0x6f, 0x74, 0x6f, 0x1a, 0x1c, 0x63, 0x6f,
0x73, 0x6d, 0x6f, 0x73, 0x2f, 0x67, 0x6f, 0x76, 0x2f, 0x76, 0x31, 0x62, 0x65, 0x74, 0x61, 0x31,
0x2f, 0x67, 0x6f, 0x76, 0x2e, 0x70, 0x72, 0x6f, 0x74, 0x6f, 0x1a, 0x11, 0x61, 0x6d, 0x69, 0x6e,
0x6f, 0x2f, 0x61, 0x6d, 0x69, 0x6e, 0x6f, 0x2e, 0x70, 0x72, 0x6f, 0x74, 0x6f, 0x22, 0x9e, 0x04,
0x0a, 0x0c, 0x47, 0x65, 0x6e, 0x65, 0x73, 0x69, 0x73, 0x53, 0x74, 0x61, 0x74, 0x65, 0x12, 0x30,
0x0a, 0x14, 0x73, 0x74, 0x61, 0x72, 0x74, 0x69, 0x6e, 0x67, 0x5f, 0x70, 0x72, 0x6f, 0x70, 0x6f,
0x73, 0x61, 0x6c, 0x5f, 0x69, 0x64, 0x18, 0x01, 0x20, 0x01, 0x28, 0x04, 0x52, 0x12, 0x73, 0x74,
0x61, 0x72, 0x74, 0x69, 0x6e, 0x67, 0x50, 0x72, 0x6f, 0x70, 0x6f, 0x73, 0x61, 0x6c, 0x49, 0x64,
0x12, 0x4e, 0x0a, 0x08, 0x64, 0x65, 0x70, 0x6f, 0x73, 0x69, 0x74, 0x73, 0x18, 0x02, 0x20, 0x03,
0x28, 0x0b, 0x32, 0x1b, 0x2e, 0x63, 0x6f, 0x73, 0x6d, 0x6f, 0x73, 0x2e, 0x67, 0x6f, 0x76, 0x2e,
0x76, 0x31, 0x62, 0x65, 0x74, 0x61, 0x31, 0x2e, 0x44, 0x65, 0x70, 0x6f, 0x73, 0x69, 0x74, 0x42,
0x15, 0xc8, 0xde, 0x1f, 0x00, 0xaa, 0xdf, 0x1f, 0x08, 0x44, 0x65, 0x70, 0x6f, 0x73, 0x69, 0x74,
0x73, 0xa8, 0xe7, 0xb0, 0x2a, 0x01, 0x52, 0x08, 0x64, 0x65, 0x70, 0x6f, 0x73, 0x69, 0x74, 0x73,
0x12, 0x42, 0x0a, 0x05, 0x76, 0x6f, 0x74, 0x65, 0x73, 0x18, 0x03, 0x20, 0x03, 0x28, 0x0b, 0x32,
0x18, 0x2e, 0x63, 0x6f, 0x73, 0x6d, 0x6f, 0x73, 0x2e, 0x67, 0x6f, 0x76, 0x2e, 0x76, 0x31, 0x62,
0x65, 0x74, 0x61, 0x31, 0x2e, 0x56, 0x6f, 0x74, 0x65, 0x42, 0x12, 0xc8, 0xde, 0x1f, 0x00, 0xaa,
0xdf, 0x1f, 0x05, 0x56, 0x6f, 0x74, 0x65, 0x73, 0xa8, 0xe7, 0xb0, 0x2a, 0x01, 0x52, 0x05, 0x76,
0x6f, 0x74, 0x65, 0x73, 0x12, 0x52, 0x0a, 0x09, 0x70, 0x72, 0x6f, 0x70, 0x6f, 0x73, 0x61, 0x6c,
0x73, 0x18, 0x04, 0x20, 0x03, 0x28, 0x0b, 0x32, 0x1c, 0x2e, 0x63, 0x6f, 0x73, 0x6d, 0x6f, 0x73,
0x2e, 0x67, 0x6f, 0x76, 0x2e, 0x76, 0x31, 0x62, 0x65, 0x74, 0x61, 0x31, 0x2e, 0x50, 0x72, 0x6f,
0x70, 0x6f, 0x73, 0x61, 0x6c, 0x42, 0x16, 0xc8, 0xde, 0x1f, 0x00, 0xaa, 0xdf, 0x1f, 0x09, 0x50,
0x72, 0x6f, 0x70, 0x6f, 0x73, 0x61, 0x6c, 0x73, 0xa8, 0xe7, 0xb0, 0x2a, 0x01, 0x52, 0x09, 0x70,
0x72, 0x6f, 0x70, 0x6f, 0x73, 0x61, 0x6c, 0x73, 0x12, 0x53, 0x0a, 0x0e, 0x64, 0x65, 0x70, 0x6f,
0x73, 0x69, 0x74, 0x5f, 0x70, 0x61, 0x72, 0x61, 0x6d, 0x73, 0x18, 0x05, 0x20, 0x01, 0x28, 0x0b,
0x32, 0x21, 0x2e, 0x63, 0x6f, 0x73, 0x6d, 0x6f, 0x73, 0x2e, 0x67, 0x6f, 0x76, 0x2e, 0x76, 0x31,
0x62, 0x65, 0x74, 0x61, 0x31, 0x2e, 0x44, 0x65, 0x70, 0x6f, 0x73, 0x69, 0x74, 0x50, 0x61, 0x72,
0x61, 0x6d, 0x73, 0x42, 0x09, 0xc8, 0xde, 0x1f, 0x00, 0xa8, 0xe7, 0xb0, 0x2a, 0x01, 0x52, 0x0d,
0x64, 0x65, 0x70, 0x6f, 0x73, 0x69, 0x74, 0x50, 0x61, 0x72, 0x61, 0x6d, 0x73, 0x12, 0x50, 0x0a,
0x0d, 0x76, 0x6f, 0x74, 0x69, 0x6e, 0x67, 0x5f, 0x70, 0x61, 0x72, 0x61, 0x6d, 0x73, 0x18, 0x06,
0x20, 0x01, 0x28, 0x0b, 0x32, 0x20, 0x2e, 0x63, 0x6f, 0x73, 0x6d, 0x6f, 0x73, 0x2e, 0x67, 0x6f,
0x76, 0x2e, 0x76, 0x31, 0x62, 0x65, 0x74, 0x61, 0x31, 0x2e, 0x56, 0x6f, 0x74, 0x69, 0x6e, 0x67,
0x50, 0x61, 0x72, 0x61, 0x6d, 0x73, 0x42, 0x09, 0xc8, 0xde, 0x1f, 0x00, 0xa8, 0xe7, 0xb0, 0x2a,
0x01, 0x52, 0x0c, 0x76, 0x6f, 0x74, 0x69, 0x6e, 0x67, 0x50, 0x61, 0x72, 0x61, 0x6d, 0x73, 0x12,
0x4d, 0x0a, 0x0c, 0x74, 0x61, 0x6c, 0x6c, 0x79, 0x5f, 0x70, 0x61, 0x72, 0x61, 0x6d, 0x73, 0x18,
0x07, 0x20, 0x01, 0x28, 0x0b, 0x32, 0x1f, 0x2e, 0x63, 0x6f, 0x73, 0x6d, 0x6f, 0x73, 0x2e, 0x67,
0x6f, 0x76, 0x2e, 0x76, 0x31, 0x62, 0x65, 0x74, 0x61, 0x31, 0x2e, 0x54, 0x61, 0x6c, 0x6c, 0x79,
0x50, 0x61, 0x72, 0x61, 0x6d, 0x73, 0x42, 0x09, 0xc8, 0xde, 0x1f, 0x00, 0xa8, 0xe7, 0xb0, 0x2a,
0x01, 0x52, 0x0b, 0x74, 0x61, 0x6c, 0x6c, 0x79, 0x50, 0x61, 0x72, 0x61, 0x6d, 0x73, 0x42, 0xc0,
0x01, 0x0a, 0x16, 0x63, 0x6f, 0x6d, 0x2e, 0x63, 0x6f, 0x73, 0x6d, 0x6f, 0x73, 0x2e, 0x67, 0x6f,
0x76, 0x2e, 0x76, 0x31, 0x62, 0x65, 0x74, 0x61, 0x31, 0x42, 0x0c, 0x47, 0x65, 0x6e, 0x65, 0x73,
0x69, 0x73, 0x50, 0x72, 0x6f, 0x74, 0x6f, 0x50, 0x01, 0x5a, 0x2e, 0x63, 0x6f, 0x73, 0x6d, 0x6f,
0x73, 0x73, 0x64, 0x6b, 0x2e, 0x69, 0x6f, 0x2f, 0x61, 0x70, 0x69, 0x2f, 0x63, 0x6f, 0x73, 0x6d,
0x6f, 0x73, 0x2f, 0x67, 0x6f, 0x76, 0x2f, 0x76, 0x31, 0x62, 0x65, 0x74, 0x61, 0x31, 0x3b, 0x67,
0x6f, 0x76, 0x76, 0x31, 0x62, 0x65, 0x74, 0x61, 0x31, 0xa2, 0x02, 0x03, 0x43, 0x47, 0x58, 0xaa,
0x02, 0x12, 0x43, 0x6f, 0x73, 0x6d, 0x6f, 0x73, 0x2e, 0x47, 0x6f, 0x76, 0x2e, 0x56, 0x31, 0x62,
0x65, 0x74, 0x61, 0x31, 0xca, 0x02, 0x12, 0x43, 0x6f, 0x73, 0x6d, 0x6f, 0x73, 0x5c, 0x47, 0x6f,
0x76, 0x5c, 0x56, 0x31, 0x62, 0x65, 0x74, 0x61, 0x31, 0xe2, 0x02, 0x1e, 0x43, 0x6f, 0x73, 0x6d,
0x6f, 0x73, 0x5c, 0x47, 0x6f, 0x76, 0x5c, 0x56, 0x31, 0x62, 0x65, 0x74, 0x61, 0x31, 0x5c, 0x47,
0x50, 0x42, 0x4d, 0x65, 0x74, 0x61, 0x64, 0x61, 0x74, 0x61, 0xea, 0x02, 0x14, 0x43, 0x6f, 0x73,
0x6d, 0x6f, 0x73, 0x3a, 0x3a, 0x47, 0x6f, 0x76, 0x3a, 0x3a, 0x56, 0x31, 0x62, 0x65, 0x74, 0x61,
0x31, 0x62, 0x06, 0x70, 0x72, 0x6f, 0x74, 0x6f, 0x33,
}
var (
file_cosmos_gov_v1beta1_genesis_proto_rawDescOnce sync.Once
file_cosmos_gov_v1beta1_genesis_proto_rawDescData = file_cosmos_gov_v1beta1_genesis_proto_rawDesc
)
func file_cosmos_gov_v1beta1_genesis_proto_rawDescGZIP() []byte {
file_cosmos_gov_v1beta1_genesis_proto_rawDescOnce.Do(func() {
file_cosmos_gov_v1beta1_genesis_proto_rawDescData = protoimpl.X.CompressGZIP(file_cosmos_gov_v1beta1_genesis_proto_rawDescData)
})
return file_cosmos_gov_v1beta1_genesis_proto_rawDescData
}
var file_cosmos_gov_v1beta1_genesis_proto_msgTypes = make([]protoimpl.MessageInfo, 1)
var file_cosmos_gov_v1beta1_genesis_proto_goTypes = []interface{}{
(*GenesisState)(nil), // 0: cosmos.gov.v1beta1.GenesisState
(*Deposit)(nil), // 1: cosmos.gov.v1beta1.Deposit
(*Vote)(nil), // 2: cosmos.gov.v1beta1.Vote
(*Proposal)(nil), // 3: cosmos.gov.v1beta1.Proposal
(*DepositParams)(nil), // 4: cosmos.gov.v1beta1.DepositParams
(*VotingParams)(nil), // 5: cosmos.gov.v1beta1.VotingParams
(*TallyParams)(nil), // 6: cosmos.gov.v1beta1.TallyParams
}
var file_cosmos_gov_v1beta1_genesis_proto_depIdxs = []int32{
1, // 0: cosmos.gov.v1beta1.GenesisState.deposits:type_name -> cosmos.gov.v1beta1.Deposit
2, // 1: cosmos.gov.v1beta1.GenesisState.votes:type_name -> cosmos.gov.v1beta1.Vote
3, // 2: cosmos.gov.v1beta1.GenesisState.proposals:type_name -> cosmos.gov.v1beta1.Proposal
4, // 3: cosmos.gov.v1beta1.GenesisState.deposit_params:type_name -> cosmos.gov.v1beta1.DepositParams
5, // 4: cosmos.gov.v1beta1.GenesisState.voting_params:type_name -> cosmos.gov.v1beta1.VotingParams
6, // 5: cosmos.gov.v1beta1.GenesisState.tally_params:type_name -> cosmos.gov.v1beta1.TallyParams
6, // [6:6] is the sub-list for method output_type
6, // [6:6] is the sub-list for method input_type
6, // [6:6] is the sub-list for extension type_name
6, // [6:6] is the sub-list for extension extendee
0, // [0:6] is the sub-list for field type_name
}
func init() { file_cosmos_gov_v1beta1_genesis_proto_init() }
func file_cosmos_gov_v1beta1_genesis_proto_init() {
if File_cosmos_gov_v1beta1_genesis_proto != nil {
return
}
file_cosmos_gov_v1beta1_gov_proto_init()
if !protoimpl.UnsafeEnabled {
file_cosmos_gov_v1beta1_genesis_proto_msgTypes[0].Exporter = func(v interface{}, i int) interface{} {
switch v := v.(*GenesisState); i {
case 0:
return &v.state
case 1:
return &v.sizeCache
case 2:
return &v.unknownFields
default:
return nil
}
}
}
type x struct{}
out := protoimpl.TypeBuilder{
File: protoimpl.DescBuilder{
GoPackagePath: reflect.TypeOf(x{}).PkgPath(),
RawDescriptor: file_cosmos_gov_v1beta1_genesis_proto_rawDesc,
NumEnums: 0,
NumMessages: 1,
NumExtensions: 0,
NumServices: 0,
},
GoTypes: file_cosmos_gov_v1beta1_genesis_proto_goTypes,
DependencyIndexes: file_cosmos_gov_v1beta1_genesis_proto_depIdxs,
MessageInfos: file_cosmos_gov_v1beta1_genesis_proto_msgTypes,
}.Build()
File_cosmos_gov_v1beta1_genesis_proto = out.File
file_cosmos_gov_v1beta1_genesis_proto_rawDesc = nil
file_cosmos_gov_v1beta1_genesis_proto_goTypes = nil
file_cosmos_gov_v1beta1_genesis_proto_depIdxs = nil
}
```
|
```c++
#include "source/extensions/filters/udp/udp_proxy/session_filters/dynamic_forward_proxy/config.h"
#include "envoy/registry/registry.h"
#include "envoy/server/filter_config.h"
#include "source/extensions/common/dynamic_forward_proxy/dns_cache_manager_impl.h"
#include "source/extensions/filters/udp/udp_proxy/session_filters/dynamic_forward_proxy/proxy_filter.h"
namespace Envoy {
namespace Extensions {
namespace UdpFilters {
namespace UdpProxy {
namespace SessionFilters {
namespace DynamicForwardProxy {
DynamicForwardProxyNetworkFilterConfigFactory::DynamicForwardProxyNetworkFilterConfigFactory()
: FactoryBase("envoy.filters.udp.session.dynamic_forward_proxy") {}
FilterFactoryCb DynamicForwardProxyNetworkFilterConfigFactory::createFilterFactoryFromProtoTyped(
const FilterConfig& proto_config, Server::Configuration::FactoryContext& context) {
Extensions::Common::DynamicForwardProxy::DnsCacheManagerFactoryImpl cache_manager_factory(
context);
ProxyFilterConfigSharedPtr filter_config(
std::make_shared<ProxyFilterConfig>(proto_config, cache_manager_factory, context));
return [filter_config](Network::UdpSessionFilterChainFactoryCallbacks& callbacks) -> void {
callbacks.addReadFilter(std::make_shared<ProxyFilter>(filter_config));
};
}
/**
* Static registration for the dynamic_forward_proxy filter. @see RegisterFactory.
*/
REGISTER_FACTORY(DynamicForwardProxyNetworkFilterConfigFactory, NamedUdpSessionFilterConfigFactory);
} // namespace DynamicForwardProxy
} // namespace SessionFilters
} // namespace UdpProxy
} // namespace UdpFilters
} // namespace Extensions
} // namespace Envoy
```
|
Parliamentary elections were held in Armenia on 20 May 1990, although further rounds were held on 3 June and 15 July due to low turnouts invalidating earlier results. By 21 July, 64 seats were still unfilled, with 16 still unfilled in February the following year. The result was a victory for the Communist Party of Armenia, which won 136 of the 259 seats. The remaining candidates were all officially independents, but almost all were members of the Pan-Armenian National Movement. Overall voter turnout was 60%.
Results
References
1990 in Armenia
Armenia
1990s in Armenian politics
Election and referendum articles with incomplete results
May 1990 events in Europe
Parliamentary elections in Armenia
|
Parishia is an Asian plant genus in the family Anacardiaceae, subfamily Anacardioideae. It is found in Indo-China and Malesia; no subspecies are listed in the Catalogue of Life. It was named in 1860, by Joseph Dalton Hooker, in honour of the botanist and plant collector Charles Samuel Pollock Parish.
The type species is P. insignis, the first specimens of which were collected by Parish in the Andaman Islands.
Species
The Catalogue of Life lists:
Parishia coriacea
Parishia dinghouiana
Parishia insignis
Parishia maingayi
Parishia malabog
Parishia paucijuga
Parishia sericea
Parishia trifoliolata
References
Anacardiaceae
Flora of Indo-China
Flora of Malesia
|
Henry Raine Barker (11 November 1829 – 1902) was an English lawyer, banker and rower who won three events at Henley Royal Regatta in the same year in 1852
Life
He was the son of Richard Barker of London, educated at Westminster School and Christ Church, Oxford. In 1852 he was a member of the Oxford University eight which won the Grand Challenge Cup at Henley Royal Regatta. He was also in the Oxford four which won the Stewards Challenge Cup and he won Silver Goblets partnering Philip Henry Nind.
Barker was admitted at Inner Temple in 1858. He became a banker and army agent. 1881 with his wife Caroline and children
Barker married Caroline Haynes and lived in Kensington and later at Harrow-on-the Hill. They were the parents of England footballer Richard Raine Barker and artist Anthony Raine Barker.
Barker died in North London at the age of 72.
References
1829 births
1902 deaths
People educated at Westminster School, London
Alumni of Christ Church, Oxford
British male rowers
Members of the Inner Temple
|
```java
/*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
package io.flutter.perf;
import com.intellij.openapi.Disposable;
import com.intellij.openapi.fileEditor.FileEditor;
import io.flutter.inspector.DiagnosticsNode;
import java.util.concurrent.CompletableFuture;
/**
* Interface defining what information about widget performance can be fetched
* from the running device.
* <p>
* See VMServiceWidgetPerfProvider for the non-test implementation of this class.
*/
public interface WidgetPerfProvider extends Disposable {
void setTarget(WidgetPerfListener widgetPerfListener);
boolean isStarted();
boolean isConnected();
boolean shouldDisplayPerfStats(FileEditor editor);
CompletableFuture<DiagnosticsNode> getWidgetTree();
}
```
|
Trechus zvarici is a species of ground beetle in the subfamily Trechinae. It was described by Belousov & Kabak in 1998.
References
zvarici
Beetles described in 1998
|
Shih Chi-yang ( ; 5 May 1935 – 5 May 2019) was a Taiwanese politician. He was Vice Premier of the Republic of China from 1988 to 1993 and convener of the Executive Yuan's Mainland Affairs Committee, which was established in 1988, and became the first Minister of the Mainland Affairs Council of the Executive Yuan when it was established in 1991. He was President of the Judicial Yuan from 1994 to 1999.
Shih died at home in Sanxia District, New Taipei, of multiple organ failure on 5 May 2019.
Family
He was married to Jeanne Li.
Awards
2013, Order of Propitious Clouds with Special Grand Cordon
References
1935 births
2019 deaths
Taiwanese Ministers of Justice
National Taiwan University alumni
Heidelberg University alumni
Taiwanese Presidents of the Judicial Yuan
Politicians of the Republic of China on Taiwan from Changhua County
Deaths from multiple organ failure
20th-century Taiwanese politicians
Recipients of the Order of Propitious Clouds
|
Shams al-Din Juvayni (; also spelled Joveyni) was a Persian statesman and member of the Juvayni family. He was an influential figure in early Ilkhanate politics, serving as sahib-i divan (vizier and minister of finance) under four Mongol Ilkhans – Hulagu, Abaqa, Tekuder and Arghun Khan. In 1284, Arghun accused Shams al-Din of having poisoned the Ilkhan Abaqa, who may actually have died of the effects of alcoholism; Shams al-Din was duly executed and replaced as vizier by Buqa. A skillful political and military leader, Shams al-Din is also known to have patronized the arts. The musician Safi al-Din al-Urmawi was one of those he supported.
Background
A native of the Juvayn area in Khorasan, Shams al-Din belonged to the namesake Juvaynis, a Persian family of officials and scholars, that claimed ancestry from al-Fadl ibn al-Rabi' (d. 823/4), who had served in high offices under the Abbasid caliph Harun al-Rashid (). The family had previously worked for the Seljuk and Khwarazmian empires before serving the Mongol Empire and its breakaway state, the Ilkhanate. The father of Shams al-Din, Baha al-Din Muhammad, originally an official of the last Khwarazmshah, Jalal ad-Din Mingburnu (), began working for the Mongol governor (basqaq) of Khorasan and Mazandaran, Chin Temür, becoming his saheb-i divan in 1235, a post which he held until his death in 1253/4.
Shams al-Din was also the younger brother of the historian Ata-Malik Juvayni, who wrote the Tarikh-i Jahangushay ("History of the World Conqueror"). His family is generally portrayed as Shafi‘ites like its ancestor, al-Juvayni.
Biography
In 1263, Hulagu Khan () appointed Shams al-Din as his sahib-i divan. The reason behind influence rising may have been due to his friendship with Nasir al-Din al-Tusi, the famed scholar and Hulagu's close advisor, and his marriage to the daughter of the Mongol governor of Khorasan, Arghun Aqa. Shams al-Din's influence soon increased even further; he received the governorship of Tabriz and played a prominent role in rebuilding Iran, which had suffered greatly from the Mongol conquest. He had a bridge constructed in Azerbaijan and a dam near Saveh, rebuilt mosques in Iraq, and supported the opening of Hajj passages. Shams al-Din also took part in deciding military conclusions; he gave instructions to Hulagu's son and successor Abaqa () before the battle of Herat in 1270 against the Chagatai Khanate, and later in 1277 was the head of an army that participated in Abaqa's expedition into Anatolia, where he made Abaqa's army spare Muslim villages and towns in Anatolia. He also clashed with Caucasian tribes on his return to Iran.
Shams al-Din was also closely linked with the local vassal states of the Ilkhanids, such as the Kartids of Herat, the Qutlugh-Khanids of Kerman, the Salghurids of Fars, and the Hazaraspids of Luristan. He maintained Ilkhanid bureaucrats in each realm, and had a representative in charge of the rejuvenation of the Yazd area. Furthermore, he also increased the influence and authority of his family by giving them posts within the country; his eldest son Baha al-Din Muhammad was appointed governor of Persian Iraq, whilst another son of his, Sharaf al-Din Harun Juvayni, was appointed governor of Anatolia. Shams al-Din's older brother Ata-Malik Juvayni had already been given the governorship of Iraq in 1259 before the latter's rise.
During his term as sahib-i divan, Shams al-Din amassed a hefty sum of revenue, mainly in properties, but also through marketable investments in Hormuz, which greatly profited Shams al-Din and his associate, Sunjaq, who served as joint vizier under Abaqa. Shams al-Din's illustrious career resulted in much resentment; in 1277, his former apprentice Majd al-Mulk Yazdi accused Shams al-Din and Ata-Malik Juvayni of secretly collaborating with the Mamluk Sultanate of Egypt, which proved unsuccessful due to the lack of proof. However, three years later, Majd al-Molk made a more successful attempt; he not only once again accused the brothers of collaborating with the Mamluks, but also stealing hefty amount of riches from the treasury. Whilst Shams al-Din avoided punishment with the help of Hulagu's widow, his brother Ata-Malik was arrested, but later released in late 1281 due to interference of Mongol princes and princesses, only to return to jail a few months later due being the target of further accusations. The accusations towards Shams al-Din also made Abaqa appoint Majd al-Mulk as his joint vizier, which considerably reduced Shams al-Din's authority.
A dynastic struggle followed after Abaqa's death in 1282 between his younger brother Tekuder and son Arghun.
His wife Khoshak was the daughter of Awak Zak'arean-Mkhargrdzeli, Lord High Constable of Georgia, and Gvantsa, a noblewoman who went on to become queen of Georgia.
References
Sources
Further reading
1284 deaths
13th-century births
People executed by the Mongol Empire
13th-century Iranian people
Juvayni family
People from Khorasan
Viziers of the Ilkhanate
|
```c
/*
*
*/
#include "soc/twai_periph.h"
#include "soc/gpio_sig_map.h"
const twai_controller_signal_conn_t twai_controller_periph_signals = {
.controllers = {
[0] = {
.module = PERIPH_TWAI0_MODULE,
.irq_id = ETS_TWAI0_INTR_SOURCE,
.tx_sig = TWAI0_TX_PAD_OUT_IDX,
.rx_sig = TWAI0_RX_PAD_IN_IDX,
.bus_off_sig = TWAI0_BUS_OFF_ON_PAD_OUT_IDX,
.clk_out_sig = TWAI0_CLKOUT_PAD_OUT_IDX,
.stand_by_sig = TWAI0_STANDBY_PAD_OUT_IDX,
},
[1] = {
.module = PERIPH_TWAI1_MODULE,
.irq_id = ETS_TWAI1_INTR_SOURCE,
.tx_sig = TWAI1_TX_PAD_OUT_IDX,
.rx_sig = TWAI1_RX_PAD_IN_IDX,
.bus_off_sig = TWAI1_BUS_OFF_ON_PAD_OUT_IDX,
.clk_out_sig = TWAI1_CLKOUT_PAD_OUT_IDX,
.stand_by_sig = TWAI1_STANDBY_PAD_OUT_IDX,
},
[2] = {
.module = PERIPH_TWAI2_MODULE,
.irq_id = ETS_TWAI2_INTR_SOURCE,
.tx_sig = TWAI2_TX_PAD_OUT_IDX,
.rx_sig = TWAI2_RX_PAD_IN_IDX,
.bus_off_sig = TWAI2_BUS_OFF_ON_PAD_OUT_IDX,
.clk_out_sig = TWAI2_CLKOUT_PAD_OUT_IDX,
.stand_by_sig = TWAI2_STANDBY_PAD_OUT_IDX,
}
}
};
```
|
Augustus Washington ( – June 7, 1875) was an American photographer and daguerreotypist. He was born in New Jersey as a free person of color and migrated to Liberia in 1852. He is one of the few African-American daguerreotypists whose career has been documented.
Early life
Augustus Washington was born in Trenton, New Jersey, as the son of a former slave and a woman who was said to be of South Asian descent. His mother died when he was a child. He studied at Oneida Institute in Whitesboro, New York, and the Kimball Union Academy, before entering Dartmouth College in 1843. He learned making daguerreotypes during his first year to finance his college education, but had to leave Dartmouth College in 1844 due to increasing debts. He moved to Hartford, Connecticut, teaching black students at a local school and opening a Daguerrean studio in 1846.
Move to Liberia
Washington made the decision in 1852 to leave his home in Hartford, Connecticut, to emigrate to Liberia in West Africa. It took him a year to raise the funds to travel, and he moved in 1853 with his wife, Cordelia, and their two small children. He wanted to move to Liberia to join thousands of other African Americans in leaving the United States to start a new free black nation in Africa where they would no longer be discriminated against and would enjoy equal rights. The American Colonization Society started the process of moving African Americans to Liberia to help fund the colony. While Washington's intentions were to pave the way for a colony made by and for African Americans, the whole movement was still framed within a colonial context and Washington himself viewed the native Africans who were already living in Liberia as "heathen inhabitants" who would appreciate the African-American colonizers for bringing with them civilization and Western religion.
Washington opened a daguerrean studio in the Liberian capital Monrovia in 1853 and also traveled to the neighboring countries Sierra Leone, Gambia and Senegal. His daguerreotypes came at a vital moment for the Liberian nation as they were a visible way to document the progress of the colony not only for the Liberians but also to create an image of the colony for Western audiences. Many of his daguerreotypes were even commissioned by the American Colonization Society to provide images that would be vital for presenting an idealized image of the nation to the men and women in the United States weighing the merits of recolonization in Africa. Washington's Liberian portraits are of meticulously-posed elite members of the Liberian colony and focus on showing off the grooming, clothing, decoration and self-possession of his upper- and middle-class subjects.
In addition to photographing members of the Liberian upper and middle classes, Washington also photographed many of Liberia's political leaders. These include likenesses of President Stephen Allen Benson, Vice President Beverly Page Yates, Senate chaplain Reverend Philip Coker, a number of senators, as well as the secretary, clerk, and sergeant-at-arms of the Senate. The items placed in these portraits all held symbolic value for the representation of the Liberian politicians, from the papers found on desks in the foreground to the expensive material of the desks themselves. These were all meant to boost the public's view of the legitimacy of the new Liberian government.
While his photography was extremely important to crafting an image of a new African colony, it was just that, an image. Instead of depicting the reality of the colony, Washington's portraits present and highlight an idealized vision of the colony, with highly constructed false representations. As Shawn Michelle Smith points out in the journal article '"Augustus Washington Looks to Liberia", Washington's portraits "project a nation yet to come", and serve to double the vision of his work.
Political career
After many years of producing such daguerreotypes, Washington began to realize the social hierarchies at play in Liberia and the length of their dependence on the African natives for everything from food to supplies. This disillusionment came as Washington noticed the distinct differences in which the African natives and the colonizers were treated by doctors and politicians. In Washington's view, the colonists were no longer bringing aid and enlightenment to the native Africans but were instead playing into a dangerous cycle of bigoted colonization through alienating the native other.
Washington later gave up his photographic work and became a sugarcane grower on the shores of the Saint Paul River. In 1858 he began a political career, serving in both the House of Representatives and the Senate of Liberia. He served as Speaker of the House of Representatives from 1865 to 1869. He died in Monrovia in 1875.
Works
Washington is best known for a famous daguerreotype of John Brown.
See also
African-American officeholders during and following the Reconstruction era
References
External links
Exhibition at the National Portrait Gallery
"African Colonization--By a Man of Color". Letter by Augustus Washington to The Tribune, July 3, 1851.
U.S. Library of Congress, Prints & Photographs division. Items by Augustus Washington
African-American photographers
Year of birth uncertain
1875 deaths
Americo-Liberian people
Members of the Senate of Liberia
Speakers of the House of Representatives of Liberia
Dartmouth College alumni
People from Monrovia
19th-century American photographers
19th-century Liberian politicians
Oneida Institute alumni
|
```xml
<?xml version="1.0" encoding="utf-8"?>
<Project ToolsVersion="4.0" xmlns="path_to_url">
<ItemGroup>
<Filter Include="Source Files">
<UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
<Extensions>cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
</Filter>
<Filter Include="Header Files">
<UniqueIdentifier>{93995380-89BD-4b04-88EB-625FBE52EBFB}</UniqueIdentifier>
<Extensions>h;hpp;hxx;hm;inl;inc;xsd</Extensions>
</Filter>
<Filter Include="Resource Files">
<UniqueIdentifier>{67DA6AB6-F800-4c08-8B7A-83BB121AAD01}</UniqueIdentifier>
<Extensions>rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms</Extensions>
</Filter>
</ItemGroup>
<ItemGroup>
<ClCompile Include="DeleteDuplication.cpp">
<Filter>Source Files</Filter>
</ClCompile>
</ItemGroup>
</Project>
```
|
Yang Tingbao (; 1901–1982) was a Chinese architect and architectural educator known as one of "the Four Modern Masters in Architecture" in mainland China, along with Liang Sicheng, Tung Chuin, and Liu Dunzhen.
Education
Born in Nanyang, Henan, China, Yang entered Tsinghua College in 1915 to study architecture.
Career as an architect
Major projects directed by Yang involved Nanjing Central Stadium, the Tsinghua University Library Addition, Heping Hotel, Southeast University (China) campus amongst others. He also took part in the design of People's Grand Hall, Beijing Train Station and the Chairman Mao Memorial. He presided, participated, or directed over 100 projects in China, mainly in Nanjing and Beijing.
Republic of China era (1912–49)
In 1927, he returned to China and joined Jitai Architecture and Engineering as a design supervisor. He worked there until 1948.
Between 1930 and 1931, Yang added the West and Middle side to the Tsinghua University Library, in which the East side was earlier designed by the American architect, Henry Murphy. The library was used as a wartime hospital during the Sino-Japanese War. In 1982, a second addition was designed by a professor Guan Zhaoye of Tsinghua University.
After the fourth National Athletic Games in Hangzhou in 1930, Republican President Chiang Kai-shek announced that a central stadium would be built in the capital Nanjing for the National Athletic Games in the future. In 1931, Yang Tingbao and his team won the competition for Nanjing Central Statium and construction was completed in the same year.
In 1932, Yang took part in the Historical Building Renovation Project in Beijing, where he worked closely with local craftsmen in Beijing.
People's Republic of China 1949-1982
In the early 1950s, Chinese architecture witnessed the growth of the "Large Roof Style Movement" (), which supporters claimed to align with Chinese tradition and to be expressive of the Chinese spirit. However, the leading critic of this movement, Liang Sicheng, ridiculed the style as: "Wearing the Western suit with a Manchurian hat."
Yang was indifferent to the fad and said: "I'm not against the Large Roof Style, but it's a waste of money. We designers shouldn't be slaves to fads and fashions." In 1952, he designed the Heping Hotel in Beijing, which was built to hold the Asia-Pacific Peace Conference. The Heping Hotel was then the first high-rise in Beijing at one story taller than Beijing Hotel. When it was built, the Heping Hotel's austere and modernistic look drew much controversy although it would later be seen as an exemplary work of public building design.
Educational career
In 1940, Yang became a professor in the architecture department of Central University. In 1949, Central University was renamed National Nanjing University, and he became the chair of its architecture department. In 1952, the architecture department and other engineering departments at Nanjing's Southwestern University were reestablished as the Nanjing Institute of Technology, which in 1988 would be renamed Southeast University. Yang subsequently remained as architecture department chair at the newly established university.
Political career
He served as vice president of the Chinese Architects Association four times, and president once. The Chinese Architects Association became affiliated with the International Union of Architects (IUA). Yang served as the vice president of the IUA between 1957 and 1963. From 1979 to 1982, he served as the vice governor of Jiangsu Province.
Publications
Yang authored Comprehensive Hospital Architecture Design, Yang Tingbao Design Work, Yang Tingbao Watercolor, Yang Tingbao Drawing. He also wrote articles about urban planning and landscape design.
References
1901 births
1982 deaths
Chinese architects
Educators from Henan
Members of the Chinese Academy of Sciences
Academic staff of the National Central University
People from Nanyang, Henan
Academic staff of Southeast University
Tsinghua University alumni
University of Pennsylvania School of Design alumni
|
Kiamari Railway Station (, Sindhi: ڪياماڙي ريلوي اسٽيشن) is located in Kiamari Town, Karachi, Sindh, Pakistan.
See also
List of railway stations in Pakistan
Pakistan Railways
References
Railway stations in Karachi
Railway stations on Karachi–Peshawar Line (ML 1)
|
Doctors Charter School of Miami Shores is a public charter school located on at Barry University Campus in Miami Shores, in the U.S. state of Florida.
Overview
Doctors Charter School of Miami Shores is a community-based, "A" rated college preparatory school. It is located within the Miami-Dade County Public School District and holds a municipal charter through the Village of Miami Shores.
History
Doctors Charter School of Miami Shores originally opened in 1997 as a middle school called Miami Shores/Barry University Charter School. The school included nine portable structures built on the corner of NW 115th Street and NW 2nd Avenue, and served as an alternative to Horace Mann Middle School for Miami Shores residents.
Upon gaining further funding in 2005, the school was renamed Doctors Charter School of Miami Shores. A permanent structure was built on land that once was the home of the Biscayne Kennel Club, and later owned by Barry University. It was built with funds from the North Dade Medical Foundation and the financial support of the citizens of Miami Shores.
See also
Miami-Dade County Public Schools
High school
Education in the United States
References
External links
Doctors Charter School official website
Miami-Dade County Public Schools site
Public middle schools in Florida
Miami-Dade County Public Schools
Educational institutions established in 2005
High schools in Miami-Dade County, Florida
Charter schools in Florida
Public high schools in Florida
2005 establishments in Florida
|
Samodhpur is a village in Khutahan, Jaunpur district, Varanasi division, Uttar Pradesh, India. It is a small village located on the border of Jaunpur adjoining Sultanpur. It has an inter college for higher secondary education and a degree college for graduate and postgraduate studies. Village also has a rural bank named Kashi Sanyut Gomati Gramin Bank. Village Samodhpur has a post office and its Pincode 223102. The village has a fair proportion of Muslim and Hindu population. The village has produced many scholars serving for many national and international organisation.
References
Villages in Jaunpur district
|
```yaml
---
parsed_sample:
- bundle_name: "Po1"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth1/1"
- "Eth2/1"
member_interface_status:
- "P"
- "P"
- bundle_name: "Po2"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth1/2"
- "Eth2/2"
member_interface_status:
- "P"
- "P"
- bundle_name: "Po3"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth1/3"
- "Eth2/3"
member_interface_status:
- "P"
- "P"
- bundle_name: "Po4"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth1/4"
- "Eth2/4"
member_interface_status:
- "P"
- "P"
- bundle_name: "Po12"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth1/5"
- "Eth2/5"
member_interface_status:
- "P"
- "P"
- bundle_name: "Po13"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth1/6"
- "Eth2/6"
member_interface_status:
- "P"
- "P"
- bundle_name: "Po14"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth1/7"
- "Eth2/7"
member_interface_status:
- "P"
- "P"
- bundle_name: "Po801"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth5/6"
- "Eth6/6"
member_interface_status:
- "P"
- "P"
- bundle_name: "Po802"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth5/7"
- "Eth6/7"
member_interface_status:
- "P"
- "P"
- bundle_name: "Po803"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth15/17"
- "Eth16/17"
member_interface_status:
- "P"
- "P"
- bundle_name: "Po804"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth15/24"
- "Eth16/24"
member_interface_status:
- "P"
- "P"
- bundle_name: "Po811"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth15/8"
- "Eth15/28"
- "Eth16/8"
- "Eth16/28"
member_interface_status:
- "P"
- "P"
- "P"
- "P"
- bundle_name: "Po812"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth15/36"
- "Eth16/36"
- "Eth17/8"
- "Eth18/8"
member_interface_status:
- "P"
- "P"
- "P"
- "P"
- bundle_name: "Po813"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth15/15"
- "Eth16/15"
member_interface_status:
- "P"
- "P"
- bundle_name: "Po814"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth15/22"
- "Eth16/22"
member_interface_status:
- "P"
- "P"
- bundle_name: "Po821"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth15/30"
- "Eth16/30"
- "Eth17/29"
- "Eth18/29"
member_interface_status:
- "P"
- "P"
- "P"
- "P"
- bundle_name: "Po822"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth15/38"
- "Eth16/38"
- "Eth17/30"
- "Eth18/30"
member_interface_status:
- "P"
- "P"
- "P"
- "P"
- bundle_name: "Po823"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth3/9"
- "Eth4/9"
member_interface_status:
- "P"
- "P"
- bundle_name: "Po824"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth3/10"
- "Eth4/10"
member_interface_status:
- "P"
- "P"
- bundle_name: "Po825"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth3/3"
member_interface_status:
- "P"
- bundle_name: "Po826"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth4/3"
member_interface_status:
- "P"
- bundle_name: "Po827"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth5/3"
member_interface_status:
- "P"
- bundle_name: "Po828"
bundle_protocol: "LACP"
bundle_protocol_state: ""
bundle_status: "RU"
member_interface:
- "Eth6/3"
member_interface_status:
- "P"
```
|
Berry Hill High School and Sports College was a mixed, secondary school in Berry Hill, Stoke-on-Trent, one of the two predecessors to St Peter's Academy.
With almost 900 students in 2005, merger proposals saw student numbers drop to around 500 by 2010. This period also saw a high turnover of staff. The school closed in summer 2011, and was demolished in 2015.
Admissions
The school taught around 500 pupils, all between the ages of 11 and 16; broken up into Key Stage 3 (Years 7, 8 and 9), and Key Stage 4 (Years 10 and 11). Most pupils were White British and qualified for free school meals, mostly coming from 'hard pressed families'.
The majority of its students lived in the surrounding areas, and the suburbs of Bentilee, Bucknall, and Hanley. It was located by the Berryhill Fields.
History
The school opened in September 1964, originally with sixteen staff members and 196 pupils.
Mr Stephen Daniels was appointed as Headteacher in June 1998. A November 1999 OFTED inspection noted that the school had a below average to well below average performance, though this performance was rated as average to above average compared with similar schools. The school was generally satisfactory, with good behaviour, leadership and ethos, and unsatisfactory attendance. The school's expenditure was £2,032,741 for 1999, an average spending of £2,181 on each pupil.
Around 2003 Mr Daniels left the school to become headteacher of Ilkeston Grammar School, and was replaced by Ruth Poppleton.
In September 2004 the school was awarded Sports College status.
In October 2005 - the school's first inspection for six years - the school was graded as 'Satisfactory'.
In January 2007 the school received national attention when then-Headteacher Ruth Poppleton excluded eleven pupils who walked out in protest amid complaints over poor education standards. Protesters complained that as much as 75% of teachers were employed on a supply basis.
In September 2008 another Ofsted inspection also handed out a Satisfactory grade. In December 2008, Poppleton left the school, and Deputy Head Mark Ranford was appointed Headteacher. Since that time Ofsted declared that they had found "satisfactory progress in making improvements and inadequate progress in demonstrating a better capacity for sustained improvement". The October 2009 report acknowledged Ranford had "worked extremely hard... in difficult circumstances".
Merger
Proposals were made for the school to merge with St Peter's, Mitchell, James Brindley, Edensor, Trentham, Blurton and Brownhills to form five academies; a plan supported by then-Mayor Mark Meredith. The school would merge with Mitchell and Edensor and be replaced by a new academy at Park Hall. Some parents were outraged by the decision, insisting that Park Hall was too far a distance. The Berry Hill area is a difficult site to build upon, with ground instability due to old mines, and the City Council insisted upon the Park Hall plan. The building projects were delayed after protests by parents at Trentham High, and planning permission issues, despite the City Council's determination to move ahead with the plans.
A new merger plan would see the school merge with St Peter's CofE (A) High School on the site of the old Stoke-on-Trent Sixth Form College to create a new faith school. These plans also met with strong opposition from staff, pupils and parents.
By March 2010, merger plans are still under discussion. By then the discussed location was Adderley Green, as opposed to Park Hall. One Ofsted report noted that "uncertainty about the school’s future has led to a rapid reduction in pupil numbers." In five years the school's student numbers reduced from around 900 to just over 500; almost a 50% reduction.
The school closed in summer 2011, though as St Peters Academy was as yet to be built, the site continued to welcome schoolchildren for the 2011–12 academic year. It was demolished in 2015.
Academic standards
According to Ofsted's October 2009 report, 31% of students achieved A*to C grades in English and mathematics, below the national average. The report showed that academic standards were improving at the school.
Performance table
Note From 2006 onwards rankings were based on percentage of students achieving five GCSE grades A*-C including Maths & English. Before then rankings were based purely on percentage of students achieving five GCSE grades A*-C. In 2011 the ranking is out of 16.
Feeder Schools
The main feeder school was Eaton Park Primary School, located on the opposite side of the street from Berry Hill High. Other feeder schools included Marychurch C of E Primary School in Bucknall and St Luke's C of E Primary School in Hanley.
The school itself was a feeder of Stoke-on-Trent College and the City of Stoke-on-Trent Sixth Form College.
Notable alumni and staff
John Caudwell, student, billionaire businessman
Ray Williams, Mathematics teacher, former Port Vale footballer and Northwich Victoria manager
See also
List of schools in Stoke-on-Trent
References
Educational institutions established in 1964
Educational institutions disestablished in 2011
Defunct schools in Stoke-on-Trent
1964 establishments in England
2011 disestablishments in England
Sport schools in the United Kingdom
|
Assfactor 4 was a hardcore punk band from Columbia, South Carolina, formed by two members of Tonka (Jay and Alex) and two members of Unherd (Eric and Kevin). They formed in the fall of 1992 and broke up in late 1997. Assfactor 4's sonic approach drew heavily from San Diego's early-1990s group Heroin, but their song structure was notably more akin to 1980's thrash and hardcore, placing Assfactor 4 in a unique position within the DIY hardcore scene of the era. Their contemporaries in the southeast U.S. included Columbia's In/Humanity and Premonition, Raleigh's Rights Reserved; and Richmond's Action Patrol. HeartattaCkzine readers voted Assfactor 4 "Coolest Band to Hang Out With" in 1995. Assorted Porkchops has planned on releasing a discography in the near future.
Discography
s/t demo tape (1993)
split 7-inch w/ Rights Reserved (1993)
Sometimes I Suck 7-inch (Repercussion Records/ Auricle Records, 1993)
Smoked Out 7-inch (Old Glory Records, 1994)
s/t LP (Old Glory Records, 1995)
Sports LP (Old Glory Records, 2000)
Compilation appearances
"12 Years Of Living Hell" – "No Idea No. 11" comp CD/LP/zine (No Idea Records, 1994)
"Close Captioning For The Blind" – "All the President's Men" comp LP (Old Glory, 1995)
"Boy Cult Seavers" – "Yo Hablo" comp 7-inch (Lengua Armada Records, 1995)
"Nemo" – "We've Lost Beauty" comp LP (File Thirteen Records, 1996)
"Bonkee #3" and "Cleenkee/hairheart?" – "Nothing's Quiet On the Eastern Front" comp LP/CD (Reservoir Records, 1996)
American emo musical groups
American screamo musical groups
Musical groups from South Carolina
Musical groups established in 1992
Musical groups disestablished in 1997
|
```ruby
# or more contributor license agreements. See the NOTICE file
# distributed with this work for additional information
# regarding copyright ownership. The ASF licenses this file
#
# path_to_url
#
# Unless required by applicable law or agreed to in writing,
# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
# specific language governing permissions and limitations
class TestInt8Array < Test::Unit::TestCase
include Helper::Buildable
def test_new
assert_equal(build_int8_array([-1, 2, nil]),
Arrow::Int8Array.new(3,
Arrow::Buffer.new([-1, 2].pack("c*")),
Arrow::Buffer.new([0b011].pack("C*")),
-1))
end
def test_buffer
builder = Arrow::Int8ArrayBuilder.new
builder.append_value(-1)
builder.append_value(2)
builder.append_value(-4)
array = builder.finish
assert_equal([-1, 2, -4].pack("c*"), array.buffer.data.to_s)
end
def test_value
builder = Arrow::Int8ArrayBuilder.new
builder.append_value(-1)
array = builder.finish
assert_equal(-1, array.get_value(0))
end
def test_values
builder = Arrow::Int8ArrayBuilder.new
builder.append_value(-1)
builder.append_value(2)
builder.append_value(-4)
array = builder.finish
assert_equal([-1, 2, -4], array.values)
end
sub_test_case("#sum") do
def test_with_null
array = build_int8_array([2, -4, nil])
assert_equal(-2, array.sum)
end
def test_empty
array = build_int8_array([])
assert_equal(0, array.sum)
end
end
end
```
|
```xml
/**
* AddressBarView.tsx
*
* Component to manage address bar state (whether it is focused or not)
*/
import * as React from "react"
import styled from "styled-components"
import { TextInputView } from "./../../UI/components/LightweightText"
import { Sneakable } from "./../../UI/components/Sneakable"
import { withProps } from "./../../UI/components/common"
const AddressBarWrapper = styled.div`
width: 100%;
height: 2.5em;
line-height: 2.5em;
text-align: left;
`
const EditableAddressBarWrapper = withProps<{}>(styled.div)`
border: 1px solid ${p => p.theme["highlight.mode.insert.background"]};
&, & input {
background-color: ${p => p.theme["editor.background"]};
color: ${p => p.theme["editor.foreground"]};
}
& input {
margin-left: 1em;
}
`
export interface IAddressBarViewProps {
url: string
onAddressChanged: (newAddress: string) => void
}
export interface IAddressBarViewState {
isActive: boolean
}
export class AddressBarView extends React.PureComponent<
IAddressBarViewProps,
IAddressBarViewState
> {
constructor(props: IAddressBarViewProps) {
super(props)
this.state = {
isActive: false,
}
}
public render(): JSX.Element {
const contents = this.state.isActive ? this._renderTextInput() : this._renderAddressSpan()
return <AddressBarWrapper>{contents}</AddressBarWrapper>
}
private _renderTextInput(): JSX.Element {
return (
<EditableAddressBarWrapper>
<TextInputView
defaultValue={this.props.url}
onComplete={evt => {
this._onComplete(evt)
}}
onCancel={() => this._onCancel()}
/>
</EditableAddressBarWrapper>
)
}
private _renderAddressSpan(): JSX.Element {
return (
<Sneakable callback={() => this._setActive()} tag={"browser.address"}>
<span onClick={() => this._setActive()}>{this.props.url}</span>
</Sneakable>
)
}
private _setActive(): void {
this.setState({
isActive: true,
})
}
private _onCancel(): void {
this.setState({
isActive: false,
})
}
private _onComplete(val: string): void {
this.props.onAddressChanged(val)
this._onCancel()
}
}
```
|
```php
<?php
/*************************************************************************
Generated via "php artisan localization:missing" at 2018/04/18 16:23:42
*************************************************************************/
return array (
//============================== New strings to translate ==============================//
// Defined in file C:\\wamp\\www\\attendize\\resources\\views\\ManageEvent\\Partials\\SurveyBlankSlate.blade.php
'create_question' => ' ',
//==================================== Translations ====================================//
'Q' => 'Q',
'add_another_option' => ' ',
'answer' => '',
'attendee_details' => ' ',
'make_this_a_required_question' => ' ',
'no_answers' => ', .',
'no_questions_yet' => ' ',
'no_questions_yet_text' => ' , .',
'question' => '',
'question_options' => ' ',
'question_placeholder' => ': ?',
'question_type' => ' ',
'require_this_question_for_ticket(s)' => ' ()',
);
```
|
The tansy is a plant.
Tansy may also refer to:
Tansy beetle (Chrysolina graminis), a species of leaf beetle which feeds on tansy
Tansy cakes, medieval English dessert
Tansy Davies (born 1973), British composer
Tansy Rayner Roberts (born 1978), Australian fantasy writer
Tansy Saylor, a main character in Conjure Wife, a supernatural horror novel by Fritz Leiber
Tansy Taylor, in the film adaptation Night of the Eagle
Teton River (Montana), also known as the Tansy River
Tansy (film), a 1921 British silent drama
|
```javascript
(function ($) {
$.fn.countTo = function (options) {
options = options || {};
return $(this).each(function () {
// set options for current element
var settings = $.extend({}, $.fn.countTo.defaults, {
from: $(this).data('from'),
to: $(this).data('to'),
speed: $(this).data('speed'),
refreshInterval: $(this).data('refresh-interval'),
decimals: $(this).data('decimals')
}, options);
// how many times to update the value, and how much to increment the value on each update
var loops = Math.ceil(settings.speed / settings.refreshInterval),
increment = (settings.to - settings.from) / loops;
// references & variables that will change with each update
var self = this,
$self = $(this),
loopCount = 0,
value = settings.from,
data = $self.data('countTo') || {};
$self.data('countTo', data);
// if an existing interval can be found, clear it first
if (data.interval) {
clearInterval(data.interval);
}
data.interval = setInterval(updateTimer, settings.refreshInterval);
// initialize the element with the starting value
render(value);
function updateTimer() {
value += increment;
loopCount++;
render(value);
if (typeof(settings.onUpdate) == 'function') {
settings.onUpdate.call(self, value);
}
if (loopCount >= loops) {
// remove the interval
$self.removeData('countTo');
clearInterval(data.interval);
value = settings.to;
if (typeof(settings.onComplete) == 'function') {
settings.onComplete.call(self, value);
}
}
}
function render(value) {
var formattedValue = settings.formatter.call(self, value, settings);
$self.text(formattedValue);
}
});
};
$.fn.countTo.defaults = {
from: 0, // the number the element should start at
to: 0, // the number the element should end at
speed: 1000, // how long it should take to count between the target numbers
refreshInterval: 100, // how often the element should be updated
decimals: 0, // the number of decimal places to show
formatter: formatter, // handler for formatting the value before rendering
onUpdate: null, // callback method for every time the element is updated
onComplete: null // callback method for when the element finishes updating
};
function formatter(value, settings) {
return value.toFixed(settings.decimals);
}
}(jQuery));
```
|
```jsx
import React from 'react';
import { MegaRenderMixin } from '../../../../mixins';
import Invite from './invite.jsx';
export default class Search extends MegaRenderMixin {
static inputRef = React.createRef();
static focus = () => {
return Search.inputRef && Search.inputRef.current && Search.inputRef.current.focus();
};
render() {
const { value, placeholder, onChange } = this.props;
return (
<div className={`${Invite.NAMESPACE}-field`}>
<i className="sprite-fm-mono icon-preview-reveal" />
<input
type="text"
autoFocus={true}
placeholder={l[23750].replace('[X]', placeholder) /* `Search [X] contacts...` */}
ref={Search.inputRef}
value={value}
onChange={onChange}
/>
</div>
);
}
}
```
|
```c
/*
*
*/
#include "unity.h"
#include "unity_test_utils.h"
#include "esp_heap_caps.h"
#include "freertos/FreeRTOS.h"
#include "freertos/task.h"
#define TEST_MEMORY_LEAK_THRESHOLD (200)
static size_t before_free_8bit;
static size_t before_free_32bit;
void setUp(void)
{
before_free_8bit = heap_caps_get_free_size(MALLOC_CAP_8BIT);
before_free_32bit = heap_caps_get_free_size(MALLOC_CAP_32BIT);
}
void tearDown(void)
{
size_t after_free_8bit = heap_caps_get_free_size(MALLOC_CAP_8BIT);
size_t after_free_32bit = heap_caps_get_free_size(MALLOC_CAP_32BIT);
printf("\n");
unity_utils_check_leak(before_free_8bit, after_free_8bit, "8BIT", TEST_MEMORY_LEAK_THRESHOLD);
unity_utils_check_leak(before_free_32bit, after_free_32bit, "32BIT", TEST_MEMORY_LEAK_THRESHOLD);
}
void app_main(void)
{
// _ _ _____ ____ _____ ______ _____ _____ _
// | | | |/ ____| _ \ / ____| ____| __ \|_ _| /\ | |
// | | | | (___ | |_) || (___ | |__ | |__) | | | / \ | |
// | | | |\___ \| _ < \___ \| __| | _ / | | / /\ \ | |
// | |__| |____) | |_) | ____) | |____| | \ \ _| |_ / ____ \| |____
// \____/|_____/|____/ |_____/|______|_| \_\_____/_/ \_\______|
printf("\n");
printf(" _ _ _____ ____ _____ ______ _____ _____ _ \n");
printf("| | | |/ ____| _ \\ / ____| ____| __ \\|_ _| /\\ | | \n");
printf("| | | | (___ | |_) || (___ | |__ | |__) | | | / \\ | | \n");
printf("| | | |\\___ \\| _ < \\___ \\| __| | _ / | | / /\\ \\ | | \n");
printf("| |__| |____) | |_) | ____) | |____| | \\ \\ _| |_ / ____ \\| |____ \n");
printf(" \\____/|_____/|____/ |_____/|______|_| \\_\\_____/_/ \\_\\______|\n");
unity_run_menu();
}
```
|
Émile Boitout was a French sports shooter. He competed in two events at the 1920 Summer Olympics.
References
External links
Year of birth missing
Year of death missing
French male sport shooters
Olympic shooters for France
Shooters at the 1920 Summer Olympics
Place of birth missing
|
The 2018 Rugby Europe Sevens Conferences are the lower divisions of Rugby Europe's 2018 sevens season. Conference 1 is held in Zenica, Bosnia and Herzegovina, with the two top-placing teams advancing to the 2019 Trophy, while Conference 2 is held in Tallinn, Estonia, with the top two advancing to Conference 1 for 2019.
Conference 1
Will be held in Zenica, Bosnia and Herzegovina on 23–24 June.
Pool Stage
Pool A
Pool B
Pool C
Knockout stage
Challenge Trophy
5th Place
Cup
Conference 2
Will be played in Tartu, Estonia on 14–15 July.
External links
Conference 1 page
Conference 2 page
References
Conferences
2018 rugby sevens competitions
2018 in Bosnia and Herzegovina sport
2018 in Estonian sport
|
Rockcliffe railway station, later Rockcliffe Halt was a station which served the rural area around Rockcliffe, Rockcliffe parish, north of Carlisle in the English county of Cumberland (now part of Cumbria). It was served by local trains on what is now known as the West Coast Main Line. The nearest station for Rockcliffe is now at Carlisle. It lay some distance from the village.
History
Opened by the Caledonian Railway, it became part of the London Midland and Scottish Railway during the Grouping of 1923 and BR in 1948. It closed briefly during WW1 and was renamed as Rockcliffe Halt in 1950 when regular passenger service ceased after which it was only used by railway workers at the nearby marshalling yards until 1965.
The station had a stationmaster's house, with combined ticket office and a waiting room. The line is still double track here.
The site today
Trains pass at speed on the electrified West Coast Main Line. The station platforms have been demolished, the pedestrian overbridge has been removed, however the stationmaster's house remains as a private dwelling.
References
Notes
Sources
External links
Rail Brit
Cumbrian Railways Association
Rockcliffe Station
Cumbria Gazetteer
Railway stations in Great Britain opened in 1847
Railway stations in Great Britain closed in 1917
Railway stations in Great Britain opened in 1919
Railway stations in Great Britain closed in 1965
Disused railway stations in Cumbria
Former Caledonian Railway stations
1847 establishments in England
1965 disestablishments in England
Rockcliffe, Cumbria
|
David Brain may refer to:
David Brain (born 1964), Zimbabwean cricketer
Dave Brain (1879–1959), English baseball player
See also
David Braine (disambiguation)
|
Middle Island is an island in the Australian state of South Australia located in Spencer Gulf within Pondalowie Bay on the south-western coast of Yorke Peninsula. It is the largest of three islands within the bay with an approximate area of . It first obtained protected area status as a fauna conservation reserve declared under the Crown Lands Act 1929-1966 on 16 March 1967 and is currently located within the boundaries of the Innes National Park. It is also located within a habitat protection zone of the Southern Spencer Gulf Marine Park. DEWNR lists the islands as 'no access' areas for the general public.
Fauna
A biodiversity survey was conducted on Middle Island in November 1982. Species recorded included (but are not limited to): black-faced cormorant, Caspian tern, sooty oystercatcher and the little penguin. Little penguin breeding sites were noted in a 1996 survey of South Australia's offshore islands.
See also
Royston Island
South Island (South Australia)
References
Islands of South Australia
Spencer Gulf
Seabird colonies
Penguin colonies
|
The postal, courier, and parcel services in Germany deliver mail and parcels in that country. Multiple companies compete to provide such services. After the automotive industry and trade, the logistics sector is the country's third-largest commercial sector. The post-and-parcel service branch alone employed around 570,000 people in 2019.
Development
Since 2002, the industry added 70,000 workers to cope with the rapidly growing online trade. The Covid pandemic further drove growth in online trade and parcel-delivery. German Post and DHL said in 2021 that world trade could recover from the economic slump caused by the pandemic.
Investment plans
2022 research from University of Bamberg reported that planned investment focused almost exclusively on technology. "Rather, smartphones, tablets, handheld scanners, onboard computers as well as control and assistance systems are used to further simplify workflows, to transmit the specifications from the headquarters in a smaller-mesh manner, to offer multilingual translations of work instructions and to enforce more precise and tightly timed instructions for low-skilled and semi-skilled workers."
Companies
DHL
DPD
GLS
Hermes Logistik
References
Express mail
Logistics companies of Germany
|
```html
<!DOCTYPE html>
<html lang="en-US">
<head>
<link href="/assets/index.css" rel="stylesheet" type="text/css" />
<script crossorigin="anonymous" src="/test-harness.js"></script>
<script crossorigin="anonymous" src="/test-page-object.js"></script>
<script crossorigin="anonymous" src="/__dist__/webchat-es5.js"></script>
</head>
<body>
<main id="webchat"></main>
<script>
run(
async function () {
const { directLine, store } = testHelpers.createDirectLineEmulator();
WebChat.renderWebChat({ directLine, store }, document.getElementById('webchat'));
await pageConditions.uiConnected();
await directLine.emulateIncomingActivity({
attachments: [
{
contentType: 'video/*',
contentUrl: 'path_to_url
}
],
type: 'message'
});
await pageConditions.numActivitiesShown(1);
await pageConditions.became('iframe has loaded', () => document.getElementsByTagName('iframe').length, 5000);
const sandboxAttributeValue = document.getElementsByTagName('iframe')[0].getAttribute('sandbox');
expect(sandboxAttributeValue).toBeTruthy();
},
// `axe-core` is accessing the IFRAME using `postMessage` and YouTube does not like it.
// Nevertheless, we do not need to check accessibilty of YouTube.
{ skipCheckAccessibility: true }
);
</script>
</body>
</html>
```
|
```javascript
define("echarts/chart/pie",["require","./base","zrender/shape/Text","zrender/shape/Ring","zrender/shape/Circle","zrender/shape/Sector","zrender/shape/Polyline","../config","../util/ecData","zrender/tool/util","zrender/tool/math","zrender/tool/color","../chart"],function(e){function t(e,t,n,a,o){i.call(this,e,t,n,a,o);var r=this;r.shapeHandler.onmouseover=function(e){var t=e.target,i=h.get(t,"seriesIndex"),n=h.get(t,"dataIndex"),a=h.get(t,"special"),o=[t.style.x,t.style.y],s=t.style.startAngle,l=t.style.endAngle,d=((l+s)/2+360)%360,c=t.highlightStyle.color,m=r.getLabel(i,n,a,o,d,c,!0);m&&r.zr.addHoverShape(m);var p=r.getLabelLine(i,n,o,t.style.r0,t.style.r,d,c,!0);p&&r.zr.addHoverShape(p)},this.refresh(a)}var i=e("./base"),n=e("zrender/shape/Text"),a=e("zrender/shape/Ring"),o=e("zrender/shape/Circle"),r=e("zrender/shape/Sector"),s=e("zrender/shape/Polyline"),l=e("../config");l.pie={zlevel:0,z:2,clickable:!0,legendHoverLink:!0,center:["50%","50%"],radius:[0,"75%"],clockWise:!0,startAngle:90,minAngle:0,selectedOffset:10,itemStyle:{normal:{borderColor:"rgba(0,0,0,0)",borderWidth:1,label:{show:!0,position:"outer"},labelLine:{show:!0,length:20,lineStyle:{width:1,type:"solid"}}},emphasis:{borderColor:"rgba(0,0,0,0)",borderWidth:1,label:{show:!1},labelLine:{show:!1,length:20,lineStyle:{width:1,type:"solid"}}}}};var h=e("../util/ecData"),d=e("zrender/tool/util"),c=e("zrender/tool/math"),m=e("zrender/tool/color");return t.prototype={type:l.CHART_TYPE_PIE,_buildShape:function(){var e=this.series,t=this.component.legend;this.selectedMap={},this._selected={};var i,n,r;this._selectedMode=!1;for(var s,d=0,c=e.length;c>d;d++)if(e[d].type===l.CHART_TYPE_PIE){if(e[d]=this.reformOption(e[d]),this.legendHoverLink=e[d].legendHoverLink||this.legendHoverLink,s=e[d].name||"",this.selectedMap[s]=t?t.isSelected(s):!0,!this.selectedMap[s])continue;i=this.parseCenter(this.zr,e[d].center),n=this.parseRadius(this.zr,e[d].radius),this._selectedMode=this._selectedMode||e[d].selectedMode,this._selected[d]=[],this.deepQuery([e[d],this.option],"calculable")&&(r={zlevel:e[d].zlevel,z:e[d].z,hoverable:!1,style:{x:i[0],y:i[1],r0:n[0]<=10?0:n[0]-10,r:n[1]+10,brushType:"stroke",lineWidth:1,strokeColor:e[d].calculableHolderColor||this.ecTheme.calculableHolderColor||l.calculableHolderColor}},h.pack(r,e[d],d,void 0,-1),this.setCalculable(r),r=n[0]<=10?new o(r):new a(r),this.shapeList.push(r)),this._buildSinglePie(d),this.buildMark(d)}this.addShapeList()},_buildSinglePie:function(e){for(var t,i=this.series,n=i[e],a=n.data,o=this.component.legend,r=0,s=0,l=0,h=Number.NEGATIVE_INFINITY,d=[],c=0,m=a.length;m>c;c++)t=a[c].name,this.selectedMap[t]=o?o.isSelected(t):!0,this.selectedMap[t]&&!isNaN(a[c].value)&&(0!==+a[c].value?r++:s++,l+=+a[c].value,h=Math.max(h,+a[c].value));if(0!==l){for(var p,u,g,V,U,y,f=100,_=n.clockWise,b=(n.startAngle.toFixed(2)-0+360)%360,x=n.minAngle||.01,k=360-x*r-.01*s,v=n.roseType,c=0,m=a.length;m>c;c++)if(t=a[c].name,this.selectedMap[t]&&!isNaN(a[c].value)){if(u=o?o.getColor(t):this.zr.getColor(c),f=a[c].value/l,p="area"!=v?_?b-f*k-(0!==f?x:.01):f*k+b+(0!==f?x:.01):_?b-360/m:360/m+b,p=p.toFixed(2)-0,f=(100*f).toFixed(2),g=this.parseCenter(this.zr,n.center),V=this.parseRadius(this.zr,n.radius),U=+V[0],y=+V[1],"radius"===v?y=a[c].value/h*(y-U)*.8+.2*(y-U)+U:"area"===v&&(y=Math.sqrt(a[c].value/h)*(y-U)+U),_){var L;L=b,b=p,p=L}this._buildItem(d,e,c,f,a[c].selected,g,U,y,b,p,u),_||(b=p)}this._autoLabelLayout(d,g,y);for(var c=0,m=d.length;m>c;c++)this.shapeList.push(d[c]);d=null}},_buildItem:function(e,t,i,n,a,o,r,s,l,d,c){var m=this.series,p=((d+l)/2+360)%360,u=this.getSector(t,i,n,a,o,r,s,l,d,c);h.pack(u,m[t],t,m[t].data[i],i,m[t].data[i].name,n),e.push(u);var g=this.getLabel(t,i,n,o,p,c,!1),V=this.getLabelLine(t,i,o,r,s,p,c,!1);V&&(h.pack(V,m[t],t,m[t].data[i],i,m[t].data[i].name,n),e.push(V)),g&&(h.pack(g,m[t],t,m[t].data[i],i,m[t].data[i].name,n),g._labelLine=V,e.push(g))},getSector:function(e,t,i,n,a,o,s,l,h,d){var p=this.series,u=p[e],g=u.data[t],V=[g,u],U=this.deepMerge(V,"itemStyle.normal")||{},y=this.deepMerge(V,"itemStyle.emphasis")||{},f=this.getItemStyleColor(U.color,e,t,g)||d,_=this.getItemStyleColor(y.color,e,t,g)||("string"==typeof f?m.lift(f,-.2):f),b={zlevel:u.zlevel,z:u.z,clickable:this.deepQuery(V,"clickable"),style:{x:a[0],y:a[1],r0:o,r:s,startAngle:l,endAngle:h,brushType:"both",color:f,lineWidth:U.borderWidth,strokeColor:U.borderColor,lineJoin:"round"},highlightStyle:{color:_,lineWidth:y.borderWidth,strokeColor:y.borderColor,lineJoin:"round"},_seriesIndex:e,_dataIndex:t};if(n){var x=((b.style.startAngle+b.style.endAngle)/2).toFixed(2)-0;b.style._hasSelected=!0,b.style._x=b.style.x,b.style._y=b.style.y;var k=this.query(u,"selectedOffset");b.style.x+=c.cos(x,!0)*k,b.style.y-=c.sin(x,!0)*k,this._selected[e][t]=!0}else this._selected[e][t]=!1;return this._selectedMode&&(b.onclick=this.shapeHandler.onclick),this.deepQuery([g,u,this.option],"calculable")&&(this.setCalculable(b),b.draggable=!0),(this._needLabel(u,g,!0)||this._needLabelLine(u,g,!0))&&(b.onmouseover=this.shapeHandler.onmouseover),b=new r(b)},getLabel:function(e,t,i,a,o,r,s){var l=this.series,h=l[e],m=h.data[t];if(this._needLabel(h,m,s)){var p,u,g,V=s?"emphasis":"normal",U=d.merge(d.clone(m.itemStyle)||{},h.itemStyle),y=U[V].label,f=y.textStyle||{},_=a[0],b=a[1],x=this.parseRadius(this.zr,h.radius),k="middle";y.position=y.position||U.normal.label.position,"center"===y.position?(p=_,u=b,g="center"):"inner"===y.position||"inside"===y.position?(x=(x[0]+x[1])*(y.distance||.5),p=Math.round(_+x*c.cos(o,!0)),u=Math.round(b-x*c.sin(o,!0)),r="#fff",g="center"):(x=x[1]- -U[V].labelLine.length,p=Math.round(_+x*c.cos(o,!0)),u=Math.round(b-x*c.sin(o,!0)),g=o>=90&&270>=o?"right":"left"),"center"!=y.position&&"inner"!=y.position&&"inside"!=y.position&&(p+="left"===g?20:-20),m.__labelX=p-("left"===g?5:-5),m.__labelY=u;var v=new n({zlevel:h.zlevel,z:h.z+1,hoverable:!1,style:{x:p,y:u,color:f.color||r,text:this.getLabelText(e,t,i,V),textAlign:f.align||g,textBaseline:f.baseline||k,textFont:this.getFont(f)},highlightStyle:{brushType:"fill"}});return v._radius=x,v._labelPosition=y.position||"outer",v._rect=v.getRect(v.style),v._seriesIndex=e,v._dataIndex=t,v}},getLabelText:function(e,t,i,n){var a=this.series,o=a[e],r=o.data[t],s=this.deepQuery([r,o],"itemStyle."+n+".label.formatter");return s?"function"==typeof s?s.call(this.myChart,{seriesIndex:e,seriesName:o.name||"",series:o,dataIndex:t,data:r,name:r.name,value:r.value,percent:i}):"string"==typeof s?(s=s.replace("{a}","{a0}").replace("{b}","{b0}").replace("{c}","{c0}").replace("{d}","{d0}"),s=s.replace("{a0}",o.name).replace("{b0}",r.name).replace("{c0}",r.value).replace("{d0}",i)):void 0:r.name},getLabelLine:function(e,t,i,n,a,o,r,l){var h=this.series,m=h[e],p=m.data[t];if(this._needLabelLine(m,p,l)){var u=l?"emphasis":"normal",g=d.merge(d.clone(p.itemStyle)||{},m.itemStyle),V=g[u].labelLine,U=V.lineStyle||{},y=i[0],f=i[1],_=a,b=this.parseRadius(this.zr,m.radius)[1]- -V.length,x=c.cos(o,!0),k=c.sin(o,!0);return new s({zlevel:m.zlevel,z:m.z+1,hoverable:!1,style:{pointList:[[y+_*x,f-_*k],[y+b*x,f-b*k],[p.__labelX,p.__labelY]],strokeColor:U.color||r,lineType:U.type,lineWidth:U.width},_seriesIndex:e,_dataIndex:t})}},_needLabel:function(e,t,i){return this.deepQuery([t,e],"itemStyle."+(i?"emphasis":"normal")+".label.show")},_needLabelLine:function(e,t,i){return this.deepQuery([t,e],"itemStyle."+(i?"emphasis":"normal")+".labelLine.show")},_autoLabelLayout:function(e,t,i){for(var n=[],a=[],o=0,r=e.length;r>o;o++)("outer"===e[o]._labelPosition||"outside"===e[o]._labelPosition)&&(e[o]._rect._y=e[o]._rect.y,e[o]._rect.x<t[0]?n.push(e[o]):a.push(e[o]));this._layoutCalculate(n,t,i,-1),this._layoutCalculate(a,t,i,1)},_layoutCalculate:function(e,t,i,n){function a(t,i,n){for(var a=t;i>a;a++)if(e[a]._rect.y+=n,e[a].style.y+=n,e[a]._labelLine&&(e[a]._labelLine.style.pointList[1][1]+=n,e[a]._labelLine.style.pointList[2][1]+=n),a>t&&i>a+1&&e[a+1]._rect.y>e[a]._rect.y+e[a]._rect.height)return void o(a,n/2);o(i-1,n/2)}function o(t,i){for(var n=t;n>=0&&(e[n]._rect.y-=i,e[n].style.y-=i,e[n]._labelLine&&(e[n]._labelLine.style.pointList[1][1]-=i,e[n]._labelLine.style.pointList[2][1]-=i),!(n>0&&e[n]._rect.y>e[n-1]._rect.y+e[n-1]._rect.height));n--);}function r(e,t,i,n,a){for(var o,r,s,l=i[0],h=i[1],d=a>0?t?Number.MAX_VALUE:0:t?Number.MAX_VALUE:0,c=0,m=e.length;m>c;c++)r=Math.abs(e[c]._rect.y-h),s=e[c]._radius-n,o=n+s>r?Math.sqrt((n+s+20)*(n+s+20)-Math.pow(e[c]._rect.y-h,2)):Math.abs(e[c]._rect.x+(a>0?0:e[c]._rect.width)-l),t&&o>=d&&(o=d-10),!t&&d>=o&&(o=d+10),e[c]._rect.x=e[c].style.x=l+o*a,e[c]._labelLine&&(e[c]._labelLine.style.pointList[2][0]=l+(o-5)*a,e[c]._labelLine.style.pointList[1][0]=l+(o-20)*a),d=o}e.sort(function(e,t){return e._rect.y-t._rect.y});for(var s,l=0,h=e.length,d=[],c=[],m=0;h>m;m++)s=e[m]._rect.y-l,0>s&&a(m,h,-s,n),l=e[m]._rect.y+e[m]._rect.height;this.zr.getHeight()-l<0&&o(h-1,l-this.zr.getHeight());for(var m=0;h>m;m++)e[m]._rect.y>=t[1]?c.push(e[m]):d.push(e[m]);r(c,!0,t,i,n),r(d,!1,t,i,n)},reformOption:function(e){var t=d.merge;return e=t(t(e||{},d.clone(this.ecTheme.pie||{})),d.clone(l.pie)),e.itemStyle.normal.label.textStyle=this.getTextStyle(e.itemStyle.normal.label.textStyle),e.itemStyle.emphasis.label.textStyle=this.getTextStyle(e.itemStyle.emphasis.label.textStyle),this.z=e.z,this.zlevel=e.zlevel,e},refresh:function(e){e&&(this.option=e,this.series=e.series),this.backupShapeList(),this._buildShape()},addDataAnimation:function(e,t){function i(){s--,0===s&&t&&t()}for(var n=this.series,a={},o=0,r=e.length;r>o;o++)a[e[o][0]]=e[o];var s=0,h={},d={},c={},m=this.shapeList;this.shapeList=[];for(var p,u,g,V={},o=0,r=e.length;r>o;o++)p=e[o][0],u=e[o][2],g=e[o][3],n[p]&&n[p].type===l.CHART_TYPE_PIE&&(u?(g||(h[p+"_"+n[p].data.length]="delete"),V[p]=1):g?V[p]=0:(h[p+"_-1"]="delete",V[p]=-1),this._buildSinglePie(p));for(var U,y,o=0,r=this.shapeList.length;r>o;o++)switch(p=this.shapeList[o]._seriesIndex,U=this.shapeList[o]._dataIndex,y=p+"_"+U,this.shapeList[o].type){case"sector":h[y]=this.shapeList[o];break;case"text":d[y]=this.shapeList[o];break;case"polyline":c[y]=this.shapeList[o]}this.shapeList=[];for(var f,o=0,r=m.length;r>o;o++)if(p=m[o]._seriesIndex,a[p]){if(U=m[o]._dataIndex+V[p],y=p+"_"+U,f=h[y],!f)continue;if("sector"===m[o].type)"delete"!=f?(s++,this.zr.animate(m[o].id,"style").when(400,{startAngle:f.style.startAngle,endAngle:f.style.endAngle}).done(i).start()):(s++,this.zr.animate(m[o].id,"style").when(400,V[p]<0?{startAngle:m[o].style.startAngle}:{endAngle:m[o].style.endAngle}).done(i).start());else if("text"===m[o].type||"polyline"===m[o].type)if("delete"===f)this.zr.delShape(m[o].id);else switch(m[o].type){case"text":s++,f=d[y],this.zr.animate(m[o].id,"style").when(400,{x:f.style.x,y:f.style.y}).done(i).start();break;case"polyline":s++,f=c[y],this.zr.animate(m[o].id,"style").when(400,{pointList:f.style.pointList}).done(i).start()}}this.shapeList=m,s||t&&t()},onclick:function(e){var t=this.series;if(this.isClick&&e.target){this.isClick=!1;for(var i,n=e.target,a=n.style,o=h.get(n,"seriesIndex"),r=h.get(n,"dataIndex"),s=0,d=this.shapeList.length;d>s;s++)if(this.shapeList[s].id===n.id){if(o=h.get(n,"seriesIndex"),r=h.get(n,"dataIndex"),a._hasSelected)n.style.x=n.style._x,n.style.y=n.style._y,n.style._hasSelected=!1,this._selected[o][r]=!1;else{var m=((a.startAngle+a.endAngle)/2).toFixed(2)-0;n.style._hasSelected=!0,this._selected[o][r]=!0,n.style._x=n.style.x,n.style._y=n.style.y,i=this.query(t[o],"selectedOffset"),n.style.x+=c.cos(m,!0)*i,n.style.y-=c.sin(m,!0)*i}this.zr.modShape(n.id)}else this.shapeList[s].style._hasSelected&&"single"===this._selectedMode&&(o=h.get(this.shapeList[s],"seriesIndex"),r=h.get(this.shapeList[s],"dataIndex"),this.shapeList[s].style.x=this.shapeList[s].style._x,this.shapeList[s].style.y=this.shapeList[s].style._y,this.shapeList[s].style._hasSelected=!1,this._selected[o][r]=!1,this.zr.modShape(this.shapeList[s].id));this.messageCenter.dispatch(l.EVENT.PIE_SELECTED,e.event,{selected:this._selected,target:h.get(n,"name")},this.myChart),this.zr.refreshNextFrame()}}},d.inherits(t,i),e("../chart").define("pie",t),t});
```
|
```yaml
models:
- columns:
- name: id
tests:
- unique
- not_null
- relationships:
field: id
to: ref('node_0')
name: node_1560
version: 2
```
|
```javascript
(function() {
// mobile nav
// var body = document.getElementsByTagName('body')[0];
var html = document.getElementsByTagName('html')[0];
var navToggle = document.getElementById('mobile-nav-toggle');
var dimmer = document.getElementById('mobile-nav-dimmer');
var CLASS_NAME = 'mobile-nav-on';
if (!navToggle) return;
navToggle.addEventListener('click', function(e) {
e.preventDefault();
e.stopPropagation();
// body.classList.toggle(CLASS_NAME);
html.classList.toggle(CLASS_NAME);
});
dimmer.addEventListener('click', function(e) {
if (!html.classList.contains(CLASS_NAME)) return;
e.preventDefault();
html.classList.remove(CLASS_NAME);
});
}());
(function() {
// article toc
var tocList = document.getElementById('article-toc-inner-list');
if (!tocList) return;
window.addEventListener('resize', setMaxHeight);
setMaxHeight();
function setMaxHeight() {
var maxHeight = window.innerHeight - 45;
tocList.style['max-height'] = maxHeight + 'px';
}
}());
(function() {
// lang select
function changeLang() {
var lang = this.value;
var canonical = this.dataset.canonical;
var path = '/';
if (lang !== 'en') path += lang + '/';
var expires = new Date();
expires.setFullYear(expires.getFullYear() + 1);
document.cookie = 'nf_lang=' + lang + ';path=/;expires=' + expires.toGMTString();
location.href = path + canonical;
}
document.getElementById('lang-select').addEventListener('change', changeLang);
document.getElementById('mobile-lang-select').addEventListener('change', changeLang);
}());
(function() {
// playground
/* global liquidjs, ace */
if (!location.pathname.match(/playground.html$/)) return;
updateVersion(liquidjs.version);
const engine = new liquidjs.Liquid();
const editor = createEditor('editorEl', 'liquid');
const dataEditor = createEditor('dataEl', 'json');
const preview = createEditor('previewEl', 'html');
preview.setReadOnly(true);
preview.renderer.setShowGutter(false);
preview.renderer.setPadding(20);
const init = parseArgs(location.hash.slice(1));
if (init) {
editor.setValue(init.tpl, 1);
dataEditor.setValue(init.data, 1);
}
editor.on('change', update);
dataEditor.on('change', update);
update();
ready();
function ready() {
const loader = document.querySelector('.loader');
loader.classList.add('hide');
loader.setAttribute('aria-busy', false);
const editors = document.querySelector('#editors');
editors.classList.remove('hide');
editors.setAttribute('aria-hide', false);
}
function createEditor(id, lang) {
const editor = ace.edit(id);
editor.setTheme('ace/theme/tomorrow_night');
editor.getSession().setMode('ace/mode/' + lang);
editor.getSession().setOptions({
tabSize: 2,
useSoftTabs: true
});
editor.renderer.setScrollMargin(15);
return editor;
}
function parseArgs(hash) {
if (!hash) return;
try {
let [tpl, data] = hash.split(',').map(atou);
data = data || '{}';
return { tpl, data };
} catch (e) {}
}
function serializeArgs(obj) {
return utoa(obj.tpl) + ',' + utoa(obj.data);
}
async function update() {
const tpl = editor.getValue();
const data = dataEditor.getValue();
history.replaceState({}, '', '#' + serializeArgs({tpl, data}));
try {
const html = await engine.parseAndRender(tpl, JSON.parse(data));
preview.setValue(html, 1);
} catch (err) {
preview.setValue(err.stack, 1);
throw err;
}
}
function atou(str) {
return decodeURIComponent(escape(atob(str)));
}
function utoa(str) {
return btoa(unescape(encodeURIComponent(str)));
}
function updateVersion(version) {
document.querySelector('.version').innerHTML = `
liquidjs@<a target="_blank" href="path_to_url{version}">${version}</a>
`
}
}());
if ('serviceWorker' in navigator) {
window.addEventListener('load', function() {
navigator.serviceWorker.register('/sw.js').then(function(reg) {
console.log('ServiceWorker registration successful with scope: ', reg.scope);
}).catch(function(err) {
console.log('ServiceWorker registration failed: ', err);
});
});
}
```
|
Brogliano is a town in the province of Vicenza, Veneto, Italy. It is southeast of SP246.
Twin towns
Brogliano is twinned with:
Alella, Spain
Sources
(Google Maps)
References
Cities and towns in Veneto
|
```python
# tests.test_model_selection.test_dropping_curve
# Tests for the DroppingCurve visualizer
#
# Author: Larry Gray
# Created: Fri Apr 15 06:25:05 2022 -0400
#
# For license information, see LICENSE.txt
#
# ID: test_dropping_curve.py [c5355ee] lwgray@gmail.com $
"""
Tests for the DroppingCurve visualizer
"""
##########################################################################
# Imports
##########################################################################
import sys
import pytest
import numpy as np
from unittest.mock import patch
from tests.base import VisualTestCase
from sklearn.svm import SVC
from sklearn.naive_bayes import BernoulliNB, MultinomialNB
from sklearn.tree import DecisionTreeRegressor
from sklearn.preprocessing import OneHotEncoder, MinMaxScaler
from sklearn.neighbors import KNeighborsClassifier
from sklearn.model_selection import ShuffleSplit, StratifiedKFold
from sklearn.pipeline import Pipeline
from yellowbrick.datasets import load_mushroom
from yellowbrick.exceptions import YellowbrickValueError
from yellowbrick.model_selection import DroppingCurve, dropping_curve
try:
import pandas as pd
except ImportError:
pd = None
##########################################################################
# Test Cases
##########################################################################
@pytest.mark.usefixtures("classification", "regression")
class TestDroppingCurve(VisualTestCase):
"""
Test the DroppingCurve visualizer
"""
@patch.object(DroppingCurve, "draw")
def test_fit(self, mock_draw):
"""
Assert that fit returns self and creates expected properties
"""
X, y = self.classification
params = (
"train_scores_",
"train_scores_mean_",
"train_scores_std_",
"valid_scores_",
"valid_scores_mean_",
"valid_scores_std_",
)
oz = DroppingCurve(
MultinomialNB(),
feature_sizes=np.linspace(0.05, 1, 20)
)
for param in params:
assert not hasattr(oz, param)
assert oz.fit(X, y) is oz
mock_draw.assert_called_once()
for param in params:
assert hasattr(oz, param)
@pytest.mark.xfail(sys.platform == "win32", reason="images not close on windows")
def test_classifier(self):
"""
Test image closeness on a classification dataset with MultinomialNB
"""
X, y = self.classification
cv = ShuffleSplit(3, random_state=288)
oz = DroppingCurve(
KNeighborsClassifier(),
cv=cv,
feature_sizes=np.linspace(0.05, 1, 20),
random_state=42
)
oz.fit(X, y)
oz.finalize()
self.assert_images_similar(oz)
def test_regression(self):
"""
Test image closeness on a regression dataset with a DecisionTree
"""
X, y = self.regression
cv = ShuffleSplit(3, random_state=938)
param_range = np.arange(3, 10)
oz = DroppingCurve(
DecisionTreeRegressor(random_state=23),
param_name="max_depth",
param_range=param_range,
cv=cv,
scoring="r2",
random_state=42
)
oz.fit(X, y)
oz.finalize()
self.assert_images_similar(oz, tol=12.0)
@pytest.mark.xfail(sys.platform == "win32", reason="images not close on windows")
def test_quick_method(self):
"""
Test validation curve quick method with image closeness on SVC
"""
X, y = self.classification
pr = np.logspace(-6, -1, 3)
cv = ShuffleSplit(n_splits=5, test_size=0.2, random_state=321)
viz = dropping_curve(
SVC(), X, y, logx=True, param_name="gamma",
param_range=pr, cv=cv, show=False, random_state=42
)
self.assert_images_similar(viz)
@pytest.mark.xfail(sys.platform == "win32", reason="images not close on windows")
@pytest.mark.skipif(pd is None, reason="test requires pandas")
def test_pandas_integration(self):
"""
Test on mushroom dataset with pandas DataFrame and Series and NB
"""
data = load_mushroom(return_dataset=True)
X, y = data.to_pandas()
X = pd.get_dummies(X)
assert isinstance(X, pd.DataFrame)
assert isinstance(y, pd.Series)
cv = StratifiedKFold(n_splits=2, shuffle=True, random_state=11)
oz = DroppingCurve(MultinomialNB(), cv=cv, random_state=42)
oz.fit(X, y)
oz.finalize()
self.assert_images_similar(oz)
@pytest.mark.xfail(sys.platform == "win32", reason="images not close on windows")
def test_numpy_integration(self):
"""
Test on mushroom dataset with NumPy arrays
"""
data = load_mushroom(return_dataset=True)
X, y = data.to_numpy()
X = OneHotEncoder().fit_transform(X).toarray()
cv = StratifiedKFold(n_splits=2, shuffle=True, random_state=11)
pr = np.linspace(0.1, 3.0, 6)
oz = DroppingCurve(BernoulliNB(), cv=cv,
param_range=pr, param_name="alpha",
random_state=42)
oz.fit(X, y)
oz.finalize()
self.assert_images_similar(oz)
def test_bad_train_sizes(self):
"""
Test learning curve with bad input for feature size.
"""
with pytest.raises(YellowbrickValueError):
DroppingCurve(SVC(), param_name="gamma", feature_sizes=100)
def test_within_pipeline(self):
"""
Test that visualizer can be accessed within a sklearn pipeline
"""
X, y = load_mushroom(return_dataset=True).to_numpy()
X = OneHotEncoder().fit_transform(X).toarray()
model = Pipeline([
('minmax', MinMaxScaler()),
('matrix', DroppingCurve(BernoulliNB(), random_state=42))
])
model.fit(X, y)
model['matrix'].finalize()
self.assert_images_similar(model['matrix'], tol=12)
def test_within_pipeline_quickmethod(self):
"""
Test that visualizer quickmethod can be accessed within a
sklearn pipeline
"""
X, y = load_mushroom(return_dataset=True).to_numpy()
X = OneHotEncoder().fit_transform(X).toarray()
model = Pipeline([
('minmax', MinMaxScaler()),
('matrix', dropping_curve(BernoulliNB(), X, y, show=False,
random_state=42))
])
self.assert_images_similar(model['matrix'], tol=12)
def test_pipeline_as_model_input(self):
"""
Test that visualizer can handle sklearn pipeline as model input
"""
X, y = load_mushroom(return_dataset=True).to_numpy()
X = OneHotEncoder().fit_transform(X).toarray()
model = Pipeline([
('minmax', MinMaxScaler()),
('nb', BernoulliNB())
])
oz = DroppingCurve(model, random_state=42)
oz.fit(X, y)
oz.finalize()
self.assert_images_similar(oz, tol=12)
def test_pipeline_as_model_input_quickmethod(self):
"""
Test that visualizer can handle sklearn pipeline as model input
within a quickmethod
"""
X, y = load_mushroom(return_dataset=True).to_numpy()
X = OneHotEncoder().fit_transform(X).toarray()
model = Pipeline([
('minmax', MinMaxScaler()),
('nb', BernoulliNB())
])
oz = dropping_curve(model, X, y, show=False, random_state=42)
self.assert_images_similar(oz, tol=12)
def test_get_params(self):
"""
Ensure dropping curve get params works correctly
"""
oz = DroppingCurve(MultinomialNB())
params = oz.get_params()
assert len(params) > 0
```
|
Celestine Cook (1924-1985, New Orleans) was an African American businesswoman, and community and political activist. She was the first African American to serve on the National Business Committee of the Arts.
Early life and education
Celestine Strode Cook was born in 1924 in Teague, Texas. Her father worked for the Rock Island Railroad as a machinist and her mother was a housewife. Cook graduated from Jack Yates High School in Houston and went on to receive her undergraduate degree in physical education in 1944 from the Tuskegee Institute in Alabama.
Career
Cook was a teacher for Houston public schools until her first husband, Bethel J. Strode, died in 1947. Cook was 24 with two children, Bethel Strode, Jr., and Bethelynn Strode. She took over the properties and investments that her husband had in Illinois and Texas, serving as the president of his estate. From 1949 to 1953, she was a member of the board for the City of Galveston Recreation and Park. In the mid-1950s, she married her second husband, Jessie W. Cook, a Good Citizen’s Life Insurance company executive, and they moved to New Orleans.
In New Orleans, Cook worked as the executive secretary for the Good Citizens Life Insurance Company and Good Citizens Funeral Systems Inc. In 1972, she was elected to serve on the Board of Directors for the Liberty Bank and Trust Company, making her the only African American woman serving on the board of a New Orleans bank at the time.
Cook was politically active and worked on several campaigns. She was involved with the campaigns for Dorothy Mae Taylor, Mayor Moon Landrieu, Rose Loving, and Congresswoman Lindy Boggs. Mayor Moon Landrieu appointed her to the Cultural Resources Committee in 1971 and she was also appointed by Governor John McKeithen to the Committee on Employment of the Physically Handicapped. In 1982, she worked with Mayor Dutch Morial’s re-election campaign, serving as the chairwoman of the Women’s Committee.
Cook was the first African American and second woman to serve on the National Business Committee of the Arts. She was president of the New Orleans Links.
Community involvement
Cook was heavily involved in the New Orleans community, and active in the cultural, political, social, and economic realms of the city. Cook was committed to providing assistance to young artists.
She served on the board of several different organizations including the 1984 World’s Fair in New Orleans, the New Orleans Museum of Art, the Business Arts Council, the Bayou Classic, and the Louisiana Division of the Arts.
Cook encouraged other African American women to be involved in the community and introduced them to African American artists. She urged Leah Chase to consider joining the New Orleans Museum of Art’s (NOMA) board of trustees. Chase joined and was later invited to become a trustee for life.
Her civic activities also involved serving as a trustee for Loyola University, Amistad Research Center, and NOMA.
She was involved with organizations such as the Methodist Church, New Orleans Museum of Art (NOMA), Zeta Phi Beta Sorority, Friends of the Free Southern Theater, the Arts Council of New Orleans, the Women’s Auxiliary of Flint-Goodridge Hospital, New Orleans chapter of the Links, and the Tuskegee Alumni Association.
Awards and honors
In 1955, Cook was awarded the Tuskegee Institute Alumni Merit Award and Zeta Phi Beta’s Woman of the Year.
References
1924 births
1985 deaths
Businesspeople from New Orleans
20th-century African-American businesspeople
African-American women in business
American community activists
American political activists
Tuskegee Institute alumni
|
```objective-c
/*
*
* Use of this source code is governed by a BSD-style license
* that can be found in the LICENSE file in the root of the source
* tree. An additional intellectual property rights grant can be found
* in the file PATENTS. All contributing project authors may
* be found in the AUTHORS file in the root of the source tree.
*/
#ifndef API_ANDROID_JNI_ANDROIDVIDEOTRACKSOURCE_H_
#define API_ANDROID_JNI_ANDROIDVIDEOTRACKSOURCE_H_
#include <jni.h>
#include "common_video/libyuv/include/webrtc_libyuv.h"
#include "media/base/adapted_video_track_source.h"
#include "rtc_base/checks.h"
#include "rtc_base/thread.h"
#include "rtc_base/timestamp_aligner.h"
#include "sdk/android/src/jni/video_frame.h"
namespace webrtc {
namespace jni {
// This class needs to be used in conjunction with the Java corresponding class
// NativeAndroidVideoTrackSource. This class is thred safe and methods can be
// called from any thread, but if frames A, B, ..., are sent to adaptFrame(),
// the adapted frames adaptedA, adaptedB, ..., needs to be passed in the same
// order to onFrameCaptured().
class AndroidVideoTrackSource : public rtc::AdaptedVideoTrackSource {
public:
AndroidVideoTrackSource(rtc::Thread* signaling_thread,
JNIEnv* jni,
bool is_screencast,
bool align_timestamps);
~AndroidVideoTrackSource() override;
bool is_screencast() const override;
// Indicates that the encoder should denoise video before encoding it.
// If it is not set, the default configuration is used which is different
// depending on video codec.
absl::optional<bool> needs_denoising() const override;
void SetState(SourceState state);
SourceState state() const override;
bool remote() const override;
// This function should be called before delivering any frame to determine if
// the frame should be dropped or what the cropping and scaling parameters
// should be. This function is thread safe and can be called from any thread.
// This function returns
// NativeAndroidVideoTrackSource.FrameAdaptationParameters, or null if the
// frame should be dropped.
ScopedJavaLocalRef<jobject> AdaptFrame(JNIEnv* env,
jint j_width,
jint j_height,
jint j_rotation,
jlong j_timestamp_ns);
// This function converts and passes the frame on to the rest of the C++
// WebRTC layer. Note that GetFrameAdaptationParameters() is expected to be
// called first and that the delivered frame conforms to those parameters.
// This function is thread safe and can be called from any thread.
void OnFrameCaptured(JNIEnv* env,
jint j_rotation,
jlong j_timestamp_ns,
const JavaRef<jobject>& j_video_frame_buffer);
void SetState(JNIEnv* env,
jboolean j_is_live);
void AdaptOutputFormat(JNIEnv* env,
jint j_landscape_width,
jint j_landscape_height,
const JavaRef<jobject>& j_max_landscape_pixel_count,
jint j_portrait_width,
jint j_portrait_height,
const JavaRef<jobject>& j_max_portrait_pixel_count,
const JavaRef<jobject>& j_max_fps);
void SetIsScreencast(JNIEnv* env, jboolean j_is_screencast);
private:
rtc::Thread* signaling_thread_;
std::atomic<SourceState> state_;
std::atomic<bool> is_screencast_;
rtc::TimestampAligner timestamp_aligner_;
const bool align_timestamps_;
};
} // namespace jni
} // namespace webrtc
#endif // API_ANDROID_JNI_ANDROIDVIDEOTRACKSOURCE_H_
```
|
Wayne G. Sayles (born March 8, 1943) is an American numismatist and author, who specializes in ancient numismatics, especially coins of Cilicia, which is located in modern-day Turkey. He is a numismatic and military author, having published or contributed to hundreds of books, articles, and papers.
Biography
Sayles was born in Waukesha, Wisconsin to Wayne F. and Betty J. Sayles. He attended Horicon High School, and upon graduation in 1961 enlisted in the U.S. Air Force. His time in the Air Force included training in Communications-Electronics Maintenance at Keesler AFB, MS, and station assignments in Gander, Newfoundland; Fort Bragg, NC; McCoy AFB, FL; San Isidro AB, Dominican Republic; Incirlik AB, Turkey and McClellan AFB, CA. In 1972 he was commissioned as an officer, following completion (with honors) of Officer's Training School. Following assignments included Commander, 2081st Comm Sq. Goodfellow AFB, TX; Maintenance Control Officer, 2140th Comm Group, Athens, Greece; Commander, Detachment 15, 2140th Comm Gp., Levkas, Greece; Advisor, Air National Guard and USAF Reserve, seven north central states; Team Chief, Air Force Communications Command Inspector General, Scott AFB, IL.
His interest in coins of Cilicia was born during his tour of duty in Turkey.
In 1986 Wayne founded the monthly journal The Celator, which specialized in ancient and medieval coins.
In 2004 he founded the Ancient Coin Collectors Guild (ACCG) an advocacy group for private collectors of Ancient Coins.
Education
1972 – University of Nebraska at Omaha where he earned a bachelor's degree in History
1972, May – Officer's Training School, completing the program as an Honor Graduate and received commission in the USAF
1986 – University of Wisconsin (Madison), Master's degree in Art History. Presented his thesis on the influence of ancient coins in the work of 17th century Flemish painter Peter Paul Rubens.
Publications
First to Fall: the story of William Edward Cramsie, Clio's Cabinet, 2008.
With William F. Spengler: Turkoman Figural Bronze Coins and Their Iconography, 2 vols., Clio's Cabinet, 1992–1996.
Classical Deception: Counterfeits, Forgeries and Reproductions of Ancient Coins, Krause Publications, 2001.
Ancient Coin Collecting Vol. I, 2nd ed., Krause Publications, 1996.
Ancient Coin Collecting Vol. II : Numismatic Art of the Greek World (2nd ed.)
Ancient Coin Collecting, Vol. III: The Roman World: Politics and Propaganda (2nd ed.)
Ancient Coin Collecting IV: Roman Provincial Coins, Krause Publications, 1998.
Ancient Coin Collecting V: The Romaion/Byzantine Culture, Krause Publications, 1998.
Ancient Coin Collecting VI: Non-Classical Cultures, Krause Publications, 1999.
The Ned H. and Gloria A Griner Greek and Roman Coin Collection, David Owsley Museum of Art, 2002.
Organizational affiliations
Ancient Coin Collectors Guild – Founder,
416th Bomb Group Archive – Founder,
416th Bomb Group Veterans Association – Honorary veteran and Command Pilot,
Military Officers Association of America – Life Member
9th Air Force Association – Life Member,
Air Force Communicators and Air Traffic Controllers Association – Life Member,
American Numismatic Society – Life Fellow,
Royal Numismatic Society (London) – Fellow,
Hellenic Numismatic Society (Athens) – Life Member,
American Israel Numismatic Society – Life Member,
Ozark County Genealogical and Historical Society – Life Member,
American Numismatic Association – Member,
Numismatic Literary Guild – Member,
Krause Numismatic Ambassadors – Member,
Gainesville Missouri Lions Club – board of directors
Notes and references
External links
Wayne G. Sayles, Official Website of Wayne G. Sayles
American classical scholars
American numismatists
American art historians
Linguists of Etruscan
1943 births
Living people
Scholars of Byzantine numismatics
|
Jacob Hendrik "Jack" Achilles (born 6 February 1943) is a Dutch shooter. He competed in the 1984 Summer Olympics.
References
1943 births
Living people
Shooters at the 1984 Summer Olympics
Dutch male sport shooters
Olympic shooters for the Netherlands
Sportspeople from Haarlem
|
```c
/*! @file
* \brief Finds a row permutation so that the matrix has large entries on the diagonal
*
* <pre>
* -- SuperLU routine (version 4.0) --
* Lawrence Berkeley National Laboratory.
* June 30, 2009
* </pre>
*/
#include "slu_cdefs.h"
extern int_t mc64id_(int_t*);
extern int_t mc64ad_(int_t*, int_t*, int_t*, int_t [], int_t [], double [],
int_t*, int_t [], int_t*, int_t[], int_t*, double [],
int_t [], int_t []);
/*! \brief
*
* <pre>
* Purpose
* =======
*
* CLDPERM finds a row permutation so that the matrix has large
* entries on the diagonal.
*
* Arguments
* =========
*
* job (input) int
* Control the action. Possible values for JOB are:
* = 1 : Compute a row permutation of the matrix so that the
* permuted matrix has as many entries on its diagonal as
* possible. The values on the diagonal are of arbitrary size.
* HSL subroutine MC21A/AD is used for this.
* = 2 : Compute a row permutation of the matrix so that the smallest
* value on the diagonal of the permuted matrix is maximized.
* = 3 : Compute a row permutation of the matrix so that the smallest
* value on the diagonal of the permuted matrix is maximized.
* The algorithm differs from the one used for JOB = 2 and may
* have quite a different performance.
* = 4 : Compute a row permutation of the matrix so that the sum
* of the diagonal entries of the permuted matrix is maximized.
* = 5 : Compute a row permutation of the matrix so that the product
* of the diagonal entries of the permuted matrix is maximized
* and vectors to scale the matrix so that the nonzero diagonal
* entries of the permuted matrix are one in absolute value and
* all the off-diagonal entries are less than or equal to one in
* absolute value.
* Restriction: 1 <= JOB <= 5.
*
* n (input) int
* The order of the matrix.
*
* nnz (input) int
* The number of nonzeros in the matrix.
*
* adjncy (input) int*, of size nnz
* The adjacency structure of the matrix, which contains the row
* indices of the nonzeros.
*
* colptr (input) int*, of size n+1
* The pointers to the beginning of each column in ADJNCY.
*
* nzval (input) complex*, of size nnz
* The nonzero values of the matrix. nzval[k] is the value of
* the entry corresponding to adjncy[k].
* It is not used if job = 1.
*
* perm (output) int*, of size n
* The permutation vector. perm[i] = j means row i in the
* original matrix is in row j of the permuted matrix.
*
* u (output) double*, of size n
* If job = 5, the natural logarithms of the row scaling factors.
*
* v (output) double*, of size n
* If job = 5, the natural logarithms of the column scaling factors.
* The scaled matrix B has entries b_ij = a_ij * exp(u_i + v_j).
* </pre>
*/
int
cldperm(int_t job, int_t n, int_t nnz, int_t colptr[], int_t adjncy[],
complex nzval[], int_t *perm, float u[], float v[])
{
int_t i, liw, ldw, num;
int_t *iw, icntl[10], info[10];
double *dw;
double *nzval_d = (double *) SUPERLU_MALLOC(nnz * sizeof(double));
#if ( DEBUGlevel>=1 )
CHECK_MALLOC(0, "Enter cldperm()");
#endif
liw = 5*n;
if ( job == 3 ) liw = 10*n + nnz;
if ( !(iw = intMalloc(liw)) ) ABORT("Malloc fails for iw[]");
ldw = 3*n + nnz;
if ( !(dw = (double*) SUPERLU_MALLOC(ldw * sizeof(double))) )
ABORT("Malloc fails for dw[]");
/* Increment one to get 1-based indexing. */
for (i = 0; i <= n; ++i) ++colptr[i];
for (i = 0; i < nnz; ++i) ++adjncy[i];
#if ( DEBUGlevel>=2 )
printf("LDPERM(): n %d, nnz %d\n", n, nnz);
slu_PrintInt10("colptr", n+1, colptr);
slu_PrintInt10("adjncy", nnz, adjncy);
#endif
/*
* NOTE:
* =====
*
* MC64AD assumes that column permutation vector is defined as:
* perm(i) = j means column i of permuted A is in column j of original A.
*
* Since a symmetric permutation preserves the diagonal entries. Then
* by the following relation:
* P'(A*P')P = P'A
* we can apply inverse(perm) to rows of A to get large diagonal entries.
* But, since 'perm' defined in MC64AD happens to be the reverse of
* SuperLU's definition of permutation vector, therefore, it is already
* an inverse for our purpose. We will thus use it directly.
*
*/
mc64id_(icntl);
#if 0
/* Suppress error and warning messages. */
icntl[0] = -1;
icntl[1] = -1;
#endif
for (i = 0; i < nnz; ++i) nzval_d[i] = c_abs1(&nzval[i]);
mc64ad_(&job, &n, &nnz, colptr, adjncy, nzval_d, &num, perm,
&liw, iw, &ldw, dw, icntl, info);
#if ( DEBUGlevel>=2 )
slu_PrintInt10("perm", n, perm);
printf(".. After MC64AD info %d\tsize of matching %d\n", info[0], num);
#endif
if ( info[0] == 1 ) { /* Structurally singular */
printf(".. The last %d permutations:\n", n-num);
slu_PrintInt10("perm", n-num, &perm[num]);
}
/* Restore to 0-based indexing. */
for (i = 0; i <= n; ++i) --colptr[i];
for (i = 0; i < nnz; ++i) --adjncy[i];
for (i = 0; i < n; ++i) --perm[i];
if ( job == 5 )
for (i = 0; i < n; ++i) {
u[i] = dw[i];
v[i] = dw[n+i];
}
SUPERLU_FREE(iw);
SUPERLU_FREE(dw);
SUPERLU_FREE(nzval_d);
#if ( DEBUGlevel>=1 )
CHECK_MALLOC(0, "Exit cldperm()");
#endif
return info[0];
}
```
|
Bakersfield Sports Village, also known as Kaiser Permanente Sports Village, is a tournament-style sporting complex located in Bakersfield, California, located along Taft Highway between Ashe Road and Gosford Road. Phase 1 (which was completed in 2011) contains 8 soccer fields. When fully constructed, it will have 16 soccer fields, 10 baseball fields, 4 football fields, and an indoor gymnasium. There will also be a large stadium which can be configured for either soccer or football. Surrounding facilities will include a recreational park with a large lake, and two retail shopping areas.
References
External links
Bakersfield Sports Village
Sports venues in Bakersfield, California
|
```objective-c
#ifndef SRC_INSPECTOR_TRACING_AGENT_H_
#define SRC_INSPECTOR_TRACING_AGENT_H_
#include "node/inspector/protocol/NodeTracing.h"
#include "tracing/agent.h"
#include "v8.h"
namespace node {
class Environment;
namespace inspector {
class MainThreadHandle;
namespace protocol {
class TracingAgent : public NodeTracing::Backend {
public:
explicit TracingAgent(Environment*, std::shared_ptr<MainThreadHandle>);
~TracingAgent() override;
void Wire(UberDispatcher* dispatcher);
DispatchResponse start(
std::unique_ptr<protocol::NodeTracing::TraceConfig> traceConfig) override;
DispatchResponse stop() override;
DispatchResponse getCategories(
std::unique_ptr<protocol::Array<String>>* categories) override;
private:
Environment* env_;
std::shared_ptr<MainThreadHandle> main_thread_;
tracing::AgentWriterHandle trace_writer_;
int frontend_object_id_;
std::shared_ptr<NodeTracing::Frontend> frontend_;
};
} // namespace protocol
} // namespace inspector
} // namespace node
#endif // SRC_INSPECTOR_TRACING_AGENT_H_
```
|
```javascript
!function(a){a.fn.datepicker.dates.si={days:["","","","","","",""],daysShort:["","","","","","",""],daysMin:["","","","","","",""],months:["","","","","","","","","","","",""],monthsShort:["","","","","","","","","","","",""],today:"",monthsTitle:"",clear:"",weekStart:0,format:"yyyy-mm-dd"}}(jQuery);
```
|
Haleloke Kahauolopua (1923 – 2004) was a 20th-century Hawaiian singer. She was sometimes billed under just her first name, Haleloke.
Biography
Kahauolopua was born on February 2, 1923, in Hilo, Hawaii, into a musical family, her mother being active in Hilo music circles. She sang in glee clubs in high school but her studies at the University of Hawaii were cut short by World War II.
Kahauolopua was a featured vocalist on the radio show Hawaii Calls, hosted by Webley Edwards, from 1945 to 1950. Kahauolopua then came to the attention of Arthur Godfrey who brought her to New York, where she appeared frequently on his shows, dancing the hula as well as singing, and in a number of Hawaiian extravaganzas staged by Godfrey. In contrast to the typical Hawaiian "ha'i" (falsetto) voice use by many Hawaiian singers of the time, Kahauolopua sang in a husky alto.
Kahauolopua cut a number of records, usually accompanied by Godfrey and his ukulele and the Archie Bleyer Orchestra, and sometimes by The Mariners vocal group. She was the only Hawaiian musician on her album Hawaiian Blossoms.
Godfrey became infamous for peremptorily firing employees, such as Julius LaRosa, fired on the air, and in April 1955 he fired Kahauolopua (along with Marion Marlowe, The Mariners, and three writers). This occasioned some criticism in the press.
Kahauolopua then retired from show business at a fairly young age, to the small rural town of Union City, Indiana to live with her friends the Paul Keck family. She died in her adopted town on December 16, 2004.
Discography
Singles
"Ke Kal Nei Au (Wedding Song Of Hawaii) / Lovely Hula Hands" (Columbia CO 46446)
"Lei Aloha / White Ginger Blossoms"
"The Haole Hula" (1950, Presto)
"Yaaka Hula Hickey Dula"
Albums
Hawaiian Blossoms (with Arthur Godfrey; 1951, Columbia CL 6190)
Compilations
Christmas With Arthur Godfrey and All The Little Godfreys (1953, Columbia B-348; Kahauolopua sings Mele Kalikimaka)
Al Kealoha Perry & His Singing Surfriders: Aloha, Hula Hawaiian Style (1996, Hana Ola Records. Perry was musical director of Hawaii Calls 1937–1967, and all the artists on this record were from that show. Kahauolopua (billed as "Haleloke") sings "Alekoki", "Kolopa", and "Pua O Ka Makahala")
My Isle of Golden Dreams (2003; Kahauolopua (billed as "Haleloke") sings "Pua O Ka Makahala")
References
External links
"Haleloke est morte", appreciation and reminiscences of Haleloke Kahauolopua
1923 births
2004 deaths
People from Hilo, Hawaii
Native Hawaiian musicians
20th-century American singers
People from Union City, Indiana
20th-century American women singers
21st-century American women
|
Azizabad (, also Romanized as ‘Azīzābād; also known as Deldap) is a village in Sarbuk Rural District, Sarbuk District, Qasr-e Qand County, Sistan and Baluchestan Province, Iran. At the 2006 census, its population was 382, composed of 71 families.
References
Populated places in Qasr-e Qand County
|
Nominate reports, also known as nominative reports, named reports and private reports, is a legal term from common-law jurisdictions referring to the various published collections of reports of English cases in various courts from the Middle Ages to the 1860s, when law reporting was officially taken over by the Incorporated Council of Law Reporting, for example Edmund F. Moore's Reports of Cases Heard and Determined by the Judicial Committee and the Lords of His Majesty's most Honourable Privy Council on Appeal from the Supreme and Sudder Dewanny Courts in the East Indies published in London from 1837 to 1873, referred to as Moore's Indian Appeals and cited for example as: Moofti Mohummud Ubdoollah v. Baboo Mootechund 1 M.I.A. 383.
Most (but not all) are reprinted in the English Reports.
They are described as "nominate" in order to distinguish them from the Year Books, which are anonymous.
List
Acton
Addams
Adolphus and Ellis
Aleyn
Ambler
Anderson
Andrews
Anstruther
Atkyns
Barnardiston's Chancery Reports
Barnardiston's King's Bench Reports
Barnes
Barnewall and Adolphus
Barnewall and Alderson
Barnewall and Cresswell
Beavan
Bell
Bellewe
Benloe
Benloe and Dalison
Best and Smith
Bingham
Bingham, New Cases
Blackstone, Henry
Blackstone, William
Bligh
Bligh, New Series
Bosanquet and Puller
Bosanquet and Puller, New Reports
Bridgman, Sir J.
Bridgeman, Sir O.
Broderip and Bingham
Brook's New Cases
Browning and Lushington
Brown's Chancery Cases (Belt)
Brown's Parliament Cases
Brownlow and Goldsborough
Bulstrode
Bunberry
Burrell
Burrow
Calthorpe
Campbell
Carrington and Kirwan
Carrington and Marsham
Carrington and Payne
Carter
Carthew
Cary
Cases in Chancery
Choyce Cases in Chancery
Clark and Finelly
Coke's Reports
Colles
Collyer
Comberbach
The Common Bench Reports
The Common Bench Reports, New Series
Comyns
Cooke
Cooper's Practice Cases
Cooper, G
Cooper, temp Brougham
Cooper, temp Cottenham
Cowper
Cox
Craig and Phillips
Croke, Eliz.
Croke, Jac.
Croke, Car.
Crompton and Jervis
Crompton and Meeson
Crompton, Meeson and Roscoe
Cunningham
Curteis
Daniell
Davis, Ireland
Deane and Swabey
Dearsly
Dearsly and Bell
De Gex, Fisher and Jones
De Gex, Jones and Smith
De Gex, M'Naghten and Gorden
De Gex and Smale
Denison
Dickens
Dodson
Donnelly
Douglas
Dow
Dow and Clark
Dowling and Ryland
Drewry
Drewry and Smale
Dyer
East
Eden
Edwards
Ellis and Blackburn
Ellis and Blackburn and Ellis
Ellis and Ellis
Equity Cases Abridged
Espinasse's Reports
The Exchequer Reports (Welsby, Hurlstone and Gordon)
Fitzgibbon
Forrest
Fortescue
Foster's Crown Cases
Foster and Finlason
Freeman's Chancery Reports
Freeman's King's Bench Reports
Giffard
Gibert's Cases in Law and Equity
Gilbert
Godbolt
Gouldsborough
Gow
Haggard's Admiralty Reports
Haggard's Consistory Reports
Haggard's Ecclesiastical Reports
Hall and Twells
Hardes
Hardwicke, cases temp
Hare
Hay and Marriott
Hemming and Miller
Hetley
Hobart
Holt, Nisi Prius
Holt, Equity
Holt, King's Bench
House of Lords Cases (Clark)
Hurlstone and Coltman
Hurlstone and Newman
Hutton
Jacob
Jacob and Walker
Jenkins (Eight centuries of cases)
Johnson
Johnson and Hemming
Jones, T
Jones, W
Kay
Kay and Johnson
Keble
Keen
Keilway
Kelyng
Kenyon
Knapp
Lane
Latch
Leach
Lee
Leigh and Cave
Leonard
Levinz
Lewin's Crown Cases on the Northern Circuit
Ley
Lilly-Assize
Littleton
Lofft
Lushington
Lutwyche
Maclaen and Robinson
M'Cleland
M'Cleland and Younge
M'Naghten and Gordon
Maddock
Manning and Granger
March, New Cases
Maule and Selwyn
Meeson and Welsby
Merivale
The Modern Reports
Moody's Crown Cases Reserved
Moody and Malkin
Moody and Robinson
Moore, King's Bench
Moore, Privy Council
Moore, Privy Council, New Series
Moore's Indian Appeals
Mosely
Mylne and Craig
Mylne and Keen
Nelson
Noy
Owen
Palmer
Parker
Peake
Peake, Additional Cases
Peere Williams
Philimore
Phillips
Plowden's Commentaries
Pollexfen
Popham
Port
Precedents in Chancery (T Finch)
Price
The Queen's Bench Reports
Lord Raymond's Reports
Raymond, Sir T
Reports in Chancery
Reports, temp Finch
Ridgeway, temp Hardwicke
Robertson
Robinson, C
Robinson, W
Rolle
Russell
Russell and Mylne
Russell and Ryan
Ryan and Moody
Salkfield
Saunders (edition by Peere Williams is called William's Saunders)
Saville
Sayer
Searle and Smith
Select Cases, temp King
Session Cases
Shower, House of Lords
Shower, King's Bench
Siderfin
Simons
Simons, New Series
Simons and Stuart
Skinner
Smale and Giffard
Spelman
Spinks
Spinks' Prize Cases
Starkie
The State Trials (Cobbett and Howell)
The State Trials, New Series (Macdonell)
Strange
Style
Swabey
Swabey and Tristram
Swanston
Talbot, cases temp
Tamyln
Taunton
The Term Reports (Durnford and East)
Tothill
Turner and Russell
Vaughan
Ventris
Vernon
Vesey Senior
Vesey Senior, supplement by Belt
Vesey Junior
Vesey Junior, supplement by Hovenden
Vesey and Beams
West
West, temp Hardwicke
Wightwick
Willes
Wilmot
Wilson
Wilson, Chancery
Wilson, King's Bench
Winch
Yelverton
Younge
Younge and Collyer
Younge and Collyer C C
Younge and Jervis
See also
Law report: England and Wales
References
Wallace, John William. The Reporters. Third Edition Revised. T & J W Johnson. Philadelphia. 1855. Digitised copy from Google Books.
J. W. Wallace, The Reporters, 4th ed., 1882
John Charles Fox, Handbook of English Law Reports, 1913, Internet Archive
William Thomas Shave Daniel, History and Origin of the Law Reports (London, 1884)
Clarence Gabriel Moran. The Heralds of the Law. London. 1948.
Van Vechten Veeder, "The English Reports, 1292-1865" (1901) 15 Harvard Law Review 1 and 109; reprinted at 2 Select Essays in Anglo American Legal History 123
L W Abbott. Law Reporting in England 1485-1585. (University of London Legal Series No 10). The Athlone Press. London. 1973.
William Searle Holdsworth. "Law Reporting in the Nineteenth and Twentieth Centuries". Anglo-American Legal History Series, No. 5 (1941). Reprinted in Goodhart and Hanbury (eds) Essays in Law and History, by Sir William S Holdsworth, Clarendon Press, Oxford, 1946, reprinted by The Lawbook Exchange Limited (Union, New Jersey) 1995. Page 284 et seq.
Chantal Stebbings (ed). Law Reporting in Britain: Proceedings of the Eleventh British Legal History Conference. 1995. Hambledon Press. . Google Books. Chapters 5 and 7 to 9.
Notes
Legal terminology
Legal research
|
```markdown
# Download/Saving CIFAR-10 images in Inception format
--------------------------------------
In this script, we download the CIFAR-10 images and transform/save them in the Inception Retraining Format. The end purpose of the files is for re-training the Google Inception tensorflow model to work on the CIFAR-10.
We start by loading the necessary libraries and clearing out any current default computational graph.```
```python
import os
import tarfile
import _pickle as cPickle
import numpy as np
import urllib.request
import scipy.misc
from tensorflow.python.framework import ops
ops.reset_default_graph()
```
```markdown
Download the data.```
```python
cifar_link = 'path_to_url~kriz/cifar-10-python.tar.gz'
data_dir = 'temp'
if not os.path.isdir(data_dir):
os.makedirs(data_dir)
# Download tar file
target_file = os.path.join(data_dir, 'cifar-10-python.tar.gz')
if not os.path.isfile(target_file):
print('CIFAR-10 file not found. Downloading CIFAR data (Size = 163MB)')
print('This may take a few minutes, please wait.')
filename, headers = urllib.request.urlretrieve(cifar_link, target_file)
# Extract into memory
tar = tarfile.open(target_file)
tar.extractall(path=data_dir)
tar.close()
objects = ['airplane', 'automobile', 'bird', 'cat', 'deer',
'dog', 'frog', 'horse', 'ship', 'truck']
```
```markdown
Next we save the images in the corresponding train or test folders.```
```python
# Create train image folders
train_folder = 'train_dir'
if not os.path.isdir(os.path.join(data_dir, train_folder)):
for i in range(10):
folder = os.path.join(data_dir, train_folder, objects[i])
os.makedirs(folder)
# Create test image folders
test_folder = 'validation_dir'
if not os.path.isdir(os.path.join(data_dir, test_folder)):
for i in range(10):
folder = os.path.join(data_dir, test_folder, objects[i])
os.makedirs(folder)
# Extract images accordingly
data_location = os.path.join(data_dir, 'cifar-10-batches-py')
train_names = ['data_batch_' + str(x) for x in range(1,6)]
test_names = ['test_batch']
```
```markdown
Next we create a function that will load the images from the files.```
```python
def load_batch_from_file(file):
file_conn = open(file, 'rb')
image_dictionary = cPickle.load(file_conn, encoding='latin1')
file_conn.close()
return image_dictionary
```
```markdown
Create a function that will save the images from a dictionary into correctly formatted image files.```
```python
def save_images_from_dict(image_dict, folder='data_dir'):
# image_dict.keys() = 'labels', 'filenames', 'data', 'batch_label'
for ix, label in enumerate(image_dict['labels']):
folder_path = os.path.join(data_dir, folder, objects[label])
filename = image_dict['filenames'][ix]
#Transform image data
image_array = image_dict['data'][ix]
image_array.resize([3, 32, 32])
# Save image
output_location = os.path.join(folder_path, filename)
scipy.misc.imsave(output_location,image_array.transpose())
```
```markdown
Next we sort the training and test images into the corresponding folders```
```python
# Sort train images
for file in train_names:
print('Saving images from file: {}'.format(file))
file_location = os.path.join(data_dir, 'cifar-10-batches-py', file)
image_dict = load_batch_from_file(file_location)
save_images_from_dict(image_dict, folder=train_folder)
# Sort test images
for file in test_names:
print('Saving images from file: {}'.format(file))
file_location = os.path.join(data_dir, 'cifar-10-batches-py', file)
image_dict = load_batch_from_file(file_location)
save_images_from_dict(image_dict, folder=test_folder)
```
```markdown
Correctly label the images/folders in a text file:```
```python
# Create labels file
cifar_labels_file = os.path.join(data_dir,'cifar10_labels.txt')
print('Writing labels file, {}'.format(cifar_labels_file))
with open(cifar_labels_file, 'w') as labels_file:
for item in objects:
labels_file.write("{}
".format(item))
```
```markdown
Now we have the images in the following format:
```
-train_dir
|--airplane
|--automobile
|--bird
|--cat
|--deer
|--dog
|--frog
|--horse
|--ship
|--truck
-validation_dir
|--airplane
|--automobile
|--bird
|--cat
|--deer
|--dog
|--frog
|--horse
|--ship
|--truck
```
After this is done, we proceed with the [TensorFlow fine-tuning tutorial](path_to_url
path_to_url```
```python
```
|
```java
package com.rxjava2.android.samples.ui.cache.model;
public class Data {
public String source;
@SuppressWarnings("CloneDoesntDeclareCloneNotSupportedException")
@Override
public Data clone() {
return new Data();
}
}
```
|
Darwinian literary studies (also known as literary Darwinism) is a branch of literary criticism that studies literature in the context of evolution by means of natural selection, including gene-culture coevolution. It represents an emerging trend of neo-Darwinian thought in intellectual disciplines beyond those traditionally considered as evolutionary biology: evolutionary psychology, evolutionary anthropology, behavioral ecology, evolutionary developmental psychology, cognitive psychology, affective neuroscience, behavioural genetics, evolutionary epistemology, and other such disciplines.
History and scope
Interest in the relationship between Darwinism and the study of literature began in the nineteenth century, for example, among Italian literary critics. For example, Ugo Angelo Canello argued that literature was the history of the human psyche, and as such, played a part in the struggle for natural selection, while Francesco de Sanctis argued that Emile Zola "brought the concepts of natural selection, struggle for existence, adaptation and environment to bear in his novels".
Modern Darwinian literary studies arose in part as a result of its proponents' dissatisfaction with the poststructuralist and postmodernist philosophies that had come to dominate literary study during the 1970s and 1980s. In particular, the Darwinists took issue with the argument that discourse constructs reality. The Darwinists argue that biologically grounded dispositions constrain and inform discourse. This argument runs counter to what evolutionary psychologists assert is the central idea in the "Standard Social Science Model": that culture wholly constitutes human values and behaviors.
Literary Darwinists use concepts from evolutionary biology and the evolutionary human sciences to formulate principles of literary theory and interpret literary texts. They investigate interactions between human nature and the forms of cultural imagination, including literature and its oral antecedents. By "human nature", they mean a pan-human, genetically transmitted set of dispositions: motives, emotions, features of personality, and forms of cognition. Because the Darwinists concentrate on relations between genetically transmitted dispositions and specific cultural configurations, they often describe their work as "biocultural critique".
Many literary Darwinists aim not just at creating another "approach" or "movement" in literary theory; they aim at fundamentally altering the paradigm within which literary study is now conducted. They want to establish a new alignment among the disciplines and ultimately to encompass all other possible approaches to literary study. They rally to Edward O. Wilson's cry for "consilience" among all the branches of learning. Like Wilson, they envision nature as an integrated set of elements and forces extending in an unbroken chain of material causation from the lowest level of subatomic particles to the highest levels of cultural imagination. And like Wilson, they regard evolutionary biology as the pivotal discipline uniting the hard sciences with the social sciences and the humanities. They believe that humans have evolved in an adaptive relation to their environment. They argue that for humans, as for all other species, evolution has shaped the anatomical, physiological, and neurological characteristics of the species, and they think that human behavior, feeling, and thought are fundamentally shaped by those characteristics. They make it their business to consult evolutionary biology and evolutionary social science in order to determine what those characteristics are, and they bring that information to bear on their understanding of the products of the human imagination.
Evolutionary literary criticism of a minimalist kind consists in identifying basic, common human needs—survival, sex, and status, for instance—and using those categories to describe the behavior of characters depicted in literary texts. Others pose for themselves a form of criticism involving an overarching interpretive challenge: to construct continuous explanatory sequences linking the highest level of causal evolutionary explanation to the most particular effects in individual works of literature. Within evolutionary biology, the highest level of causal explanation involves adaptation by means of natural selection. Starting from the premise that the human mind has evolved in an adaptive relation to its environment, literary Darwinists undertake to characterize the phenomenal qualities of a literary work (tone, style, theme, and formal organization), locate the work in a cultural context, explain that cultural context as a particular organization of the elements of human nature within a specific set of environmental conditions (including cultural traditions), identify an implied author and an implied reader, examine the responses of actual readers (for instance, other literary critics), describe the socio-cultural, political, and psychological functions the work fulfills, locate those functions in relation to the evolved needs of human nature, and link the work comparatively with other artistic works, using a taxonomy of themes, formal elements, affective elements, and functions derived from a comprehensive model of human nature.
Contributors to evolutionary studies in literature have included humanists, biologists, and social scientists. Some of the biologists and social scientists have adopted primarily discursive methods for discussing literary subjects, and some of the humanists have adopted the empirical, quantitative methods typical of research in the sciences. Literary scholars and scientists have also collaborated in research that combines the methods typical of work in the humanities with methods typical of work in the sciences.
Adaptive function of literature and the arts
The most hotly debated issue in evolutionary literary study concerns the adaptive functions of literature and other arts—whether there are any adaptive functions, and if so, what they might be. Proposed functions include transmitting information, including about kin relations, and by providing the audience with a model and rehearsal for how to behave in similar situations that may arise in the future. Steven Pinker (How the Mind Works, 1997) suggests that aesthetic responsiveness is merely a side effect of cognitive powers that evolved to fulfill more practical functions, but Pinker also suggests that narratives can provide information for adaptively relevant problems. Geoffrey Miller (The Mating Mind, 2000) argues that artistic productions in the ancestral environment served as forms of sexual display in order to demonstrate fitness and attract mates, similarly to the function of the peacock's tail. Brian Boyd (On the Origin of Stories, 2009) argues that the arts are forms of cognitive "play" that enhance pattern recognition. In company with Ellen Dissanayake (Art and Intimacy, 2000), Boyd also argues that the arts provide means of creating shared social identity and help create and maintain human bonding. Dissanayake, Joseph Carroll (Literary Darwinism 2004), and Denis Dutton (The Art Instinct, 2009) all argue that the arts help organize the human mind by giving emotionally and aesthetically modulated models of reality. By participating in the simulated life of other people one gains a greater understanding of the motivations of oneself and other people. The idea that the arts function as means of psychological organization subsumes the ideas that the arts provide adaptively relevant information, enable us to consider alternative behavioral scenarios, enhance pattern recognition, and serve as means for creating shared social identity. And of course, the arts can be used for sexual display. In that respect, the arts are like most other human products—clothing, jewelry, shelter, means of transportation, etc. The hypothesis that the arts help organize the mind is not incompatible with the hypothesis of sexual display, but it subordinates sexual display to a more primary adaptive function.
Hypotheses about formal literary features
Some Darwinists have proposed explanations for formal literary features, including genres. Poetic meter has been attributed to a biologically based three-second metric. Gender preferences for pornography and romance novels have been explained by sexual selection. Different genres have been conjectured to correspond to different basic emotions: tragedy corresponding to sadness, fear, and anger; comedy to joy and surprise; and satire to anger, disgust, and contempt. Tragedy has also been associated with status conflict and comedy with mate selection. The satiric dystopian novel has been explained by contrasting universal human needs and oppressive state organization.
Distinguishing literary Darwinism
Cosmic evolutionism and evolutionary analogism: Literary Theorists who would call themselves "literary Darwinists" or claim some close alignment with the literary Darwinists share one central idea: that the adapted mind produces literature and that literature reflects the structure and character of the adapted mind. There are at least two other ways of integrating evolution into literary theory: cosmic evolutionism and evolutionary analogism. Cosmic evolutionists identify some universal process of development or progress and identify literary structures as microcosmic versions of that process. Proponents of cosmic evolution include Frederick Turner, Alex Argyros, and Richard Cureton. Evolutionary analogists take the process of Darwinian evolution—blind variation and selective retention—as a widely applicable model for all development. The psychologist Donald Campbell advances the idea that all intellectual creativity can be conceived as a form of random variation and selective retention. Rabkin and Simon offer an instance in literary study. They argue that cultural creations "evolve in the same way as do biological organisms, that is, as complex adaptive systems that succeed or fail according to their fitness to their environment." Other critics or theorists who have some affiliation with evolutionary biology but who would not identify themselves as literary Darwinists include William Benzon (Beethoven's Anvil) and William Flesch (Comeuppance).
Cognitive rhetoric: Practitioners of "cognitive rhetoric" or cognitive poetics affiliate themselves with certain language-centered areas of cognitive psychology. The chief theorists in this school argue that language is based in metaphors, and they claim that metaphors are themselves rooted in biology or the body, but they do not argue that human nature consists in a highly structured set of motivational and cognitive dispositions that have evolved through an adaptive process regulated by natural selection. Cognitive rhetoricians are generally more anxious than literary Darwinists to associate themselves with postmodern theories of "discourse," but some cognitive rhetoricians make gestures toward evolutionary psychology, and some critics closely affiliated with evolutionary psychology have found common ground with the cognitive rhetoricians. The seminal authorities in cognitive rhetoric are the language philosophers Mark Johnson and George Lakoff. The most prominent literary theorist in the field is Mark Turner. Other literary scholars associated with cognitive rhetoric include Mary Thomas Crane, F. Elizabeth Hart, Tony Jackson, Alan Richardson, Ellen Spolsky, Francis Steen, and Lisa Zunshine.
Critical commentaries
Some of the commentaries included in the special double issue of Style are critical of literary Darwinism. Other critical commentaries include those of William Benzon, "Signposts for a Naturalist Criticism," (Entelechy: Mind & Culture, Fall 2005/Winter 2006); William Deresiewicz, "Adaptation: On Literary Darwinism," The Nation June 8, 2009: 26-31; William Flesch, Comeuppance: Costly Signaling, Altruistic Punishment, and Other Biological Components of Fiction, (Cambridge: Harvard UP, 2008); Eugene Goodheart, Darwinian Misadventures in the Humanities, (New Brunswick: NJ: Transaction, 2007); Jonathan Kramnick, "Against Literary Darwinism," in Critical Inquiry, Winter 2011; "Debating Literary Darwinism," a set of responses to Jonathan Kramnick's essay, along with Kramnick's rejoinder, in Critical Inquiry, Winter 2012; Alan Richardson, "Studies in Literature and Cognition: A Field Map," in The Work of Fiction: Cognition, Culture, and Complexity, ed. Alan Richardson and Ellen Spolsky (Burlington, VT: Ashgate, 2004 1-29); and Lisa Zunshine, "What is Cognitive Cultural Studies?," in Introduction to Cognitive Cultural Studies (Johns Hopkins UP, 2010 1-33). Goodheart and Deresiewicz, adopting a traditional humanist perspective, reject efforts to ground literary study in biology. Richardson disavows the Darwinists' tendency to attack poststructuralism. Richardson and Benzon both align themselves with cognitive science and distinguish that alignment from one with evolutionary psychology. Flesch makes use of evolutionary research on game theory, costly signaling, and altruistic punishment but, like Stephen Jay Gould, professes himself hostile to evolutionary psychology. For a commentary that is sympathetic to evolutionary psychology but skeptical about the possibilities of using it for literary study, see Steven Pinker, "Toward a Consilient Study of Literature," a review of The Literary Animal, Philosophy and Literature 31 (2007): 162-178. David Fishelov has argued that the attempt to link Darwinism to literary studies has failed "to produce compelling evidence to support some of its basic assumptions (notably that literature is an adaptation)" and has called on literary scholars to be more conceptually rigorous when they pursue "empirical research into different aspects of literary evolution."<ref> David Fishelov, "Evolution and Literary Studies: Time to Evolve," Philosophy and Literature, Vol. 41, No. 2 (October 2017): 286.</ref> Whitley Kaufman has argued that the Darwinist approach to literature has caused its proponents to misunderstand what is important and great in literature.
See also
James Arthur Anderson
Brian Boyd
Joseph Carroll
Ellen Dissanayake
Denis Dutton
Jonathan Gottschall
Mathias Clasen
Evolutionary psychology
Universal Darwinism
References
Bibliography
In addition to books oriented specifically to literature, this list includes books on cinema and books by authors who propound theories like those of the literary Darwinists but discuss the arts in general.
Anderson, James Arthur. 2020. Excavating Stephen King: A Darwinist Hermeneutic Study of the Fiction. Lexington Books.
Anderson, Joseph. 1996. The Reality of Illusion: An Ecological Approach to Cognitive Film Theory. Southern Illinois Press.
Austin, Michael. 2010. Useful Fictions: Evolution, Anxiety, and the Origins of Literature. University of Nebraska Press.
Barash, David P., and Nanelle Barash. 2005. Madame Bovary's Ovaries: A Darwinian Look at Literature. Delacorte Press.
Blair, Linda Nicole. 2017. Virginia Woolf and the Power of Story: A Literary Darwinist Reading of Six Novels. McFarland.
Bordwell, David. 2008. Poetics of Cinema. Routledge.
Boyd, Brian. 2009. On the Origin of Stories: Evolution, Cognition. and Fiction. Harvard University Press.
Boyd, Brian, Joseph Carroll, and Jonathan Gottschall, eds. 2010. Evolution, Literature, and Film: A Reader. Columbia University Press.
Canello, Ugo Angelo. 1882. Letteratura e darwinismo: lezioni due. Padova, Tipografia A. Draghi.
Carroll, Joseph. 1995. Evolution and Literary Theory. University of Missouri.
Carroll, Joseph. 2004. Literary Darwinism: Evolution, Human Nature, and Literature. Routledge.
Carroll, Joseph. 2011. Reading Human Nature: Literary Darwinism in Theory and Practice. SUNY Press.
Carroll, Joseph, Jonathan Gottschall, John Johnson, and Daniel Kruger. 2012. Graphing Jane Austen: The Evolutionary Basis of Literary Meaning. Palgrave.
Clasen, Mathias. 2017. Why Horror Seduces. Oxford University Press.
Coe, Kathryn. 2003. The Ancestress Hypothesis: Visual Art as Adaptation. Rutgers University Press.
Cooke, Brett. 2002. Human Nature in Utopia: Zamyatin's We. Northwestern University Press.
Cooke, Brett, and Frederick Turner, eds. 1999. Biopoetics: Evolutionary Explorations in the Arts. ICUS.
Dissanayake, Ellen. 2000. Art and Intimacy: How the Arts Began. University of Washington Press.
Dissanayake, Ellen. 1995. Homo Aestheticus. University of Washington Press.
Dissanayake, Ellen. 1990. What Is Art For? University of Washington Press.
Dutton, Denis. 2009. The Art Instinct: Beauty, Pleasure, and Human Evolution. Oxford University Press.
Easterlin, Nancy. 2012. A Biocultural Approach to Literary Theory and Interpretation. Johns Hopkins University Press.
Fromm, Harold. 2009. The Nature of Being Human: From Environmentalism to Consciousness. Johns Hopkins University Press.
Gottschall, Jonathan. 2008. Literature, Science, and a New Humanities. Palgrave Macmillan.
Gottschall, Jonathan. 2007. The Rape of Troy: Evolution, Violence, and the World of Homer. Cambridge.
Gottschall, Jonathan. 2012. The Storytelling Animal: How Stories Make Us Human. Houghton Mifflin.
Gottschall, Jonathan, and David Sloan Wilson, eds. 2005. The Literary Animal: Evolution and the Nature of Narrative. Northwestern University Press.
Grodal, Torben. 2009. Embodied Visions: Evolution, Emotion, Culture, and Film. Oxford University Press.
Headlam Wells, Robin. 2005. Shakespeare's Humanism. Cambridge University Press.
Headlam Wells, Robin, and JonJoe McFadden, eds. 2006. Human Nature: Fact and Fiction. Continuum.
Hoeg, Jerry, and Kevin S. Larsen, eds. 2009. Interdisciplinary Essays on Darwinism in Hispanic Literature and Film: The Intersection of Science and the Humanities. Mellen.
Hood, Randall. 1979. The Genetic Function and Nature of Literature. Cal Poly, San Luis Obispo.
Kaufman, Whitley. 2016. Human Nature and the Limits of Darwinism. Palgrave, New York.
Love, Glen. 2003. Practical Ecocriticism: Literature, Biology, and the Environment. University of Virginia Press.
Machann, Clinton. 2009. Masculinity in Four Victorian Epics: A Darwinist Reading. Ashgate.
Martindale, Colin, and Paul Locher, and Vladimir M. Petrov, eds. 2007. Evolutionary and Neurocognitive Approaches to Aesthetics, Creativity, and the Arts. Baywood.
Nordlund, Marcus. 2007. Shakespeare and the Nature of Love: Literature, Culture, Evolution. Northwestern University Press.
Parrish, Alex C. 2013. Adaptive Rhetoric: Evolution, Culture, and the Art of Persuasion. Routledge.
Salmon, Catherine, and Donald Symons. 2001. Warrior Lovers: Erotic Fiction, Evolution, and Female Sexuality. Weidenfeld & Nicolson.
Saunders, Judith. 2009. Reading Edith Wharton through A Darwinian Lens: Evolutionary Biological Issues In Her Fiction. McFarland.
Saunders, Judith. 2018. American Literary Classics: Evolutionary Perspectives. Academic Studies Press.
Storey, Robert. 1996. Mimesis and the Human Animal: On the Biogenetic Foundations of Literary Representation. Northwestern University Press.
Swirski, Peter. 2010. Literature, Analytically Speaking: Explorations in the Theory of Interpretation, Analytic Aesthetics, and Evolution. University of Texas Press.
Swirski, Peter. 2007. Of Literature and Knowledge: Explorations in Narrative Thought Experiments, Evolution, and Game Theory. Routledge.
Vermeule, Blakey. 2010. Why Do We Care about Literary Characters? Johns Hopkins University Press.Edited collections: The volume edited by Boyd, Carroll, and Gottschall (2010) is an anthology, that is, a selection of essays and book excerpts, most of which had been previously published. Collections of essays that had not, for the most part, been previously published include those edited by Cooke and Turner (1999); Gottschall and Wilson (2005); Headlam Wells and McFadden (2006); Martindale, Locher, and Petrov (2007); Gansel and Vanderbeke;and Hoeg and Larsen (2009).Journals: Much evolutionary literary criticism has been published in the journal Philosophy and Literature. The journal Style has also been an important venue for the Darwinists. Social science journals that have published research on the arts include Evolution and Human Behavior, , and Human Nature. The first issue of an annual volume The Evolutionary Review: Art, Science, Culture appeared in 2010; the journal ceased publication in 2013. The first issue of a semi-annual journal Evolutionary Studies in Imaginative Culture appeared in spring of 2017.Symposia: A special double-issue of the journal Style (vol. 42, numbers 2/3, summer/fall 2008) was devoted to evolutionary literary theory and criticism, with a target article by Joseph Carroll ("An Evolutionary Paradigm for Literary Study"), responses by 35 scholars and scientists, and a rejoinder by Carroll. Also, a special evolutionary issue of the journal Politics and Culture contains 32 essays, including contributions to a symposium on the question "How is culture biological?", which includes six primary essays along with responses and rejoinders.Discussion groups: Online forums for news and discussion include the Biopoetics listserv, the Facebook group for Evolutionary Narratology, and the Facebook homepage for The Evolutionary Review. Researchers with similar interests can also be located on Academia.edu'' by searching for people who have a research interest in Evolutionary Literary Criticism and Theory / Biopoetics or in Literary Darwinism or Evolutionary Literary Theory.
External links
Mathias Clasen's website (in English and Danish)
The Evolutionary Review: Art, Science, Culture
The Literature Project: Maya Lessov's Interviews with Scholars Involved in the Debate over the Two Cultures
Evolutionary Studies in Imaginative Culture
Darwinism
Literary theory
Evolutionary biology
Evolutionary psychology
|
Mary Beale (; 26 March 1633 8 October 1699) was an English portrait painter. She was part of a small band of female professional artists working in London. Beale became the main financial provider for her family through her professional work – a career she maintained from 1670/71 to the 1690s. Beale was also a writer, whose prose Discourse on Friendship of 1666 presents scholarly, uniquely female take on the subject. Her 1663 manuscript Observations, on the materials and techniques employed "in her painting of Apricots", though not printed, is the earliest known instructional text in English written by a female painter. Praised first as a "virtuous" practitioner in "Oyl Colours" by Sir William Sanderson in his 1658 book Graphice: Or The use of the Pen and Pensil; In the Excellent Art of PAINTING, Beale's work was later commended by court painter Sir Peter Lely and, soon after her death, by the author of "An Essay towards an English-School", his account of the most noteworthy artists of her generation.
Life
Mary Beale was born in the rectory of Barrow, Suffolk, in late March 1633. She was baptised on 26 March by her father John Cradock in All Saints Church in the village. Her mother was Dorothy Brunton/Brinton. Aside from being a rector, John Cradock was also an amateur painter, who may have taught Mary how to paint. It was common for fathers to teach their daughters how to paint at the time . Growing up in Barrow, Mary lived close to Bury St Edmunds. A group of painters worked in Bury St Edmunds, including Peter Lely and Matthew Snelling, whom Mary may have met in her youth. On 23 August 1643, Dorothy Cradock gave birth to a son named John. Dorothy died not long after the birth, leaving Mary motherless at age ten. During the Civil War, John Cradock appointed Walter Cradock, a distant cousin of his, as guardian of his children John and Mary.
Mary Cradock met Charles Beale (1632-1705), a cloth merchant who was also an amateur painter, during a visit to the Heighams of Wickhambrook, who were related to the Yelverton and Beale families. Charles Beale wrote her a passionate love letter and poem on 25 July of an unknown year. Mary Cradock married Charles Beale on 8 March 1652 at the age of eighteen. Her father, John Cradock, was gravely ill at the time and died a few days after Mary's marriage. The couple moved to Walton-on-Thames at some point afterward. Charles Beale was a Civil Service Clerk at the time, but eventually became Mary's studio manager once she became a professional painter. At some point, Charles was working for the Board of Green Cloth where he mixed colour pigments. Circa 1660–64 the family moved to Albrook, (now Allbrook), Otterbourne, Hampshire, to escape the plague. Throughout their marriage, Mary and Charles worked together as equals and as business partners, which was not often seen at the time. On 18 October 1654 Charles and Mary's first son, Bartholomew, was buried. Little else is known about their first son. Their second son was baptised on 14 February 1655/6 and also named Bartholomew. Their third son Charles was born in 1660.
Mary Beale died on 8 October 1699 at the age of sixty-five. Her death was mistaken for the death of Mary Beadle, whose recorded death is on 28 December 1697. Not much is known about her death besides that she died in a house on Pall Mall and was buried under the communion table of St James's Church, Piccadilly on 8 October 1699. Her tomb was destroyed by enemy bombs during the Second World War. A memorial to her lies within the church.
Career and education
The most common way to learn how to paint at the time was to copy great works and masterpieces that were accessible. Mary Beale preferred to paint in oil and water colours. Whenever she did a drawing, she would draw in crayon. Peter Lely, who succeeded Anthony van Dyck as the court painter, took a great interest in Mary's progress as an artist, especially since she would practice painting by imitating some of his work. Mary Beale started working by painting favours for people she knew in exchange for small gifts or favors. Charles Beale kept close record of everything Mary did as an artist. He would take notes on how she painted, what business transactions took place, who came to visit, and what praise she would receive. Charles wrote thirty notebooks' worth of observations over the years, calling Mary "my dearest heart". She became a semi-professional portrait painter in the 1650s and 1660s, working from her home, first in Covent Garden and later in Fleet Street in London. When living in Covent Garden, Beale was a near neighbor to artist Joan Carlile.
Training
Mary received no formal training from an academy, had no connection to an artist guild, and no royal or courtly patronage. She received a humanist education from her father, who is most likely the one who taught Mary how to draw and paint. During her childhood in Suffolk Mary's father was friendly with contemporary British artists such as Sir Nathaniel Bacon, Robert Walker, and Sir Peter Lely, leading to both Robert Walker and Peter Lely being "the most likely drawing masters to the young Mary". The exact time of Mary's introduction to Lely is debated and one theory has the two meeting prior to her marriage to Charles, when she was living in Suffolk. The other theory has the pair meeting in either 1655 or 1656 when Mary and Charles moved to Convent Garden in London and became Lely's neighbour.
In detailed documents kept by Charles Beale of his wife's practice it states that Lely would visit the Beale home occasionally to observe Mary paint and praise her work. Their friendship led to Lely loaning Beale and her family some of his old master paintings for them to copy from. The Beale's commissioned many portraits from Lely of themselves and their friends. It is noted by contemporary George Vertue that portraits of Mary and her family were present at their home at Hind Court in 1661.
Writings
In 1663 Mary Beale wrote Observations, an instruction on painting apricots using oils. The work marks one of the earliest writings on oil painting instruction to come out of England by an artist of either gender. It was never released on its own in print, however scholars believe that manuscripts of the work were distributed. The work was found in a notebook collecting writings by Charles Beale but was written entirely by Mary, which Helen Draper states is "a unique example of husband-and-wife collaboration in the history of technical literature on painting."
Mary Beale also wrote a manuscript called Discourse on Friendship in 1666 and four poems in 1667.
The business of painting
The key for a female to become a successful professional painter was to earn a good reputation. Mary's father, an amateur artist, funded her general education may have including courses in painting and drawing. It could be easy to misconstrue strangers entering a woman's home for a business transaction as something that would portray the woman in an impure light. Once Mary did start painting for money in the 1670s, she carefully picked whom she would paint, and used the praise of her circle of friends to build a good reputation as a painter. Some of these people included Queen Henrietta Maria and John Tillotson, a clergyman from St James' Church, a close friend of Mary Beale who eventually became the Archbishop of Canterbury. It may be due to Mary's father, John, who was a rector, or her close connection to Tillotson that kept the clergymen of St James' as consistent customers.{original research} Mary's connection to Tillotson as well as her strong Puritan marriage to Charles worked in her favour in building up her good reputation. Mary Beale typically charged five pounds for a painting of a head and ten pounds for half of a body for oil paintings. She made about two hundred pounds a year and gave ten per cent of her earnings to charity. This income was enough to support her family, and she did so. Needless to say, it is truly remarkable that Mary Beale was responsible for being the breadwinner of the family. By 1681 Mary's commissions were beginning to diminish.
In 1681, Mary Beale took on two students, Keaty Trioche and Mr. More, who worked with her in the studio. In 1691, Sarah Curtis from Yorkshire became another student of Mary's. Sarah had similar behaviours and dispositions as Mary.
Prominent sitters
Distinguished Anglican Clergyman Dr. John Tillotson (1630–1694) was a frequent sitter for Mrs. Beale. She painted him a total of five times in 1664,1672,1677, 1681, and 1687. Dr. Tillotson was related to the Cromwell family because he married the niece of Oliver Cromwell, Elizabeth in 1664. Elizabeth was a close friend of Mary's and was one of the individuals who received her writing "The Discourse on Friendship". the Beale's would commission a portrait of Dr. Tillotson for themselves by Sir Peter Lely in 1672.
Royalist Colonel Giles Strangways (1615–1675) was an admirer of Mary Beale's paintings and another important patron. Strangways fought for King Charles I during the English civil war and also had a hand in the secret escape of Charles II into exile in 1651, as well as his reinstatement in 1660. Mary was commissioned by Strangways to paint his portrait along with ones of his wife, his son and his daughter during the 1670s.
Nobleman Henry Cavendish (1630–1691) was another important sitter for Mary Beale. He became the 2nd Duke of Newcastle in 1676 and he and his Duchess Frances née Pierrepont were frequent patrons of Mary, from whom they commissioned their portraits in 1677. The Duke and Duchess were introduced to Mary's work through Frances' father, the Hon. William Pierrepont (1607–1678) whose portrait was also painted by Mary around 1670. William Pierrepont was supportive of Oliver Cromwell during the English Civil War and remained an opponent to the Restoration of the Stuart Monarchy.
The Beale children
Charles and Bartholomew Beale helped with work in the studio in their youth, where they painted draperies and sculpted ovals; these ovals were a critical piece in Mary Beale's head portraits. Young Charles Beale, the third son and named after his father, showed great talent in painting and went to study miniature painting on 5 March 1677. He enjoyed painting miniature sculptures from 1679 to 1688, when his eyesight started to fail him. From then on, he worked on full scale portraits. Bartholomew Beale, the second son, started with painting but instead turned to medicine. In 1680, he studied at Clare Hall, Cambridge and graduated MB in 1682. Bartholomew set up his medical practice on a small property in Coventry, which his father owned.
Style
The style that Mary Beale painted in was Baroque. Baroque art is a style of sculpture, painting, music, and architecture that was prominent in Europe from the early 17th century until the mid 18th. Baroque art is characterized by use of light and shadow, depictions of movement, as well as use of rich color, all to elicit a sense of grandeur and awe. Baroque portraiture in particular is known for its rich colors, light contrasts, and attention to fabric detail.
Mary Beale's paintings are often described as "vigorous" and "masculine". (It was common to praise a woman for her work by calling her "masculine".) The colour is seen as pure, sweet, natural, clear and fresh, although some critics see her colouring as "heavy and stiff". Due to copying Italian masterpieces as practice, Mary Beale is said to have acquired "an Italian air and style". Not too many could compete with her "colour, strength, force, or life". Sir Peter Lely admired Beale's work, saying she "worked with a wonderful body of colour, and was exceedingly industrious." Others criticise her work as weak in expression and finish with disagreeable colours and poorly rendered hands. It is sometimes described as "scratchy" with a "limited colour palette" and too closely imitates the work of Lely. In the decades after her death, art historian George Vertue praised her work by saying "Mrs. Mary Beale painted in oil very well" and "work'd with a wonderfull body of colors".
Some of her work can be found on display in the Geffrye Museum in London, though the largest public collection can be found at Moyse's Hall museum, Bury St Edmunds, Suffolk. Beale was the subject of a solo exhibition at the Geffrye Museum in 1975, which transferred to the Towner Art Gallery in Eastbourne the following year.
Notes
Bibliography
Tabitha Barber, Mary Beale (1632/3-1699): portrait of a seventeenth-century painter, her family and her studio, [exhibition catalogue, 21 September 1999 to 30 January 2000, Geffrye Museum, London], (London: Geffrye Museum Trust, 1999).
Ellen C. Clayton, English Female Artists, 2 vols, (London: Tinsley Brothers, 1876), vol. 1, pp. 40–53.
Dr Helen Draper, 'Her Painting of Apricots': the invisibility of Mary Beale (1633–1699)', Forum for Modern Language Studies, 48:4 (2012), pp. 389–405; Oxford University Press Academic Journals [online, free to view].<> [accessed 29 April 2020].
Dr Helen Draper, 'Mary Beale and Art's lost laborers: women Painter Stainers', Early Modern Women: an Interdisciplinary Journal, 10:1, (Fall) 2015, pp. 141–151; JSTOR [online] <Women Painter Stainers> [accessed 29 May 2020]
Dr Helen Draper, 'Mary Beale (1633–1699) and her objects of affection', [ch. 6, in] Gemma Watson & Robert F. W. Smith eds, Writing the Lives of People and Things, AD 500–1700: a multi-disciplinary future for biography, (Farnham: Ashgate, 2016), pp. 115–141.
Delia Gaze, Dictionary of women artists, vol. 1, (London: Routledge, 1997), pp. 224–26.
Robert Edmund Graves, 'Beale, Mary', Dictionary of National Biography, (London: Smith, Elder & Co., 1885–1900), vol. 4, [online] <Beale, Mary> [accessed 29 May 2020]
Richard Jeffree, 'Beale, Mary' in 'Beale family', Grove Art / Oxford Art Online, Oxford University Press [online] <Beale family> [accessed 29 April 2020].
Sir Oliver Millar, 'Mary Beale. London', Burlington Magazine, 142:1162 (2000), pp. 48–49; JSTOR [online] <Mary Beale. London> [accessed 29 May 2020].
Christopher Reeve, Mrs Mary Beale Paintress 1633–1699, [a catalogue of the paintings bequeathed by Richard Jeffree, together with other paintings by Mary Beale in the collections of St Edmundsbury Borough Council], (Bury St Edmunds: Manor House Museum, 1994).
Christopher Reeve, 'Beale [nee Cradock], Mary', [2008], Oxford Dictionary of National Biography [online] <Beale [née Cradock], Mary (bap. 1633, d. 1699), portrait painter physician> [accessed 29 May 2020]
Elizabeth Walsh, 'Mary Beale', Burlington Magazine, 90:544 (1948), p. 209; JSTOR [online] <Mary Beale>
Elizabeth Walsh & Richard Jeffree, The Excellent Mrs Mary Beale, [exhibition catalogue, 13 October-21 December 1975, Geffrye Museum, London; 10 January-21 February 1976, Towner Art Gallery, Eastbourne. Introduction by Sir Oliver Millar and special contributions by Margaret Toynbee and Richard Sword], (London: Inner London Education Authority, 1975).
External links
Chronological list of paintings by Mary Beale
Mary Beale on ArtNet
English Female Artists
'Her Painting of Apricots': The Invisibility of Mary Beale (1633–1699)
Mary Beale. Burlington Magazine 142
Mary Beale. Burlington Magazine 90
"Beale" Page 1
"Beale" Page 2
Mary Beale online (ArtCyclopedia)
Mary Beale Trust (Campaign to save, conserve and repair Mary Beale's Hampshire home, Allbrook Farmhouse and its historic smallholding)
Paintings by Mary Beale (National Portrait Gallery, London)
Mary Beale self-portrait (National Portrait Gallery)
St Edmundsbury Heritage Service (Bury St Edmunds; holds a large public collection)
Mary Beale exhibition (Geffrye Museum, London)
Project Continua: Biography of Mary Beale Project Continua is a web-based multimedia resource dedicated to the creation and preservation of women's intellectual history from the earliest surviving evidence into the 21st Century.
1633 births
1699 deaths
British Baroque painters
English women painters
People from the Borough of St Edmundsbury
English portrait painters
17th-century English women
17th-century English painters
17th-century English women artists
British women painters
Burials at St James's Church, Piccadilly
|
```html
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="utf-8" />
<meta name="viewport" content="width=device-width, initial-scale=1" />
<title>Create React App TypeScript Todo Example 2020</title>
<link rel="manifest" href="/manifest.json" />
<link rel="icon" type="image/x-icon" href="/favicon.ico" />
</head>
<body>
<noscript>You need to enable JavaScript to run this app.</noscript>
<div id="root"></div>
</body>
</html>
```
|
```javascript
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
// MODULE
import {bar} from "modules-init1.js";
assertEquals(5, bar);
```
|
```javascript
describe('SnapshotController', function() {
beforeEach(angular.mock.module('cerebro'));
beforeEach(angular.mock.inject(function($rootScope, $controller, $injector) {
this.scope = $rootScope.$new();
this.AlertService = $injector.get('AlertService');
this.SnapshotsDataService = $injector.get('SnapshotsDataService');
this.ModalService = $injector.get('ModalService');
this.createController = function() {
return $controller('SnapshotController',
{$scope: this.scope}, this.SnapshotsDataService, this.AlertService, this.ModalService);
};
this._controller = this.createController();
}));
describe('setup', function() {
it('loads repositories and indices', function() {
var data = {indices: ['idx 1', 'idx 2'], repositories: ['repo 1', 'repo 2']};
this.SnapshotsDataService.load = function(success, error) {
success(data);
}
spyOn(this.scope, 'refreshIndices').and.callThrough();
spyOn(this.SnapshotsDataService, 'load').and.callThrough();
this.scope.setup();
expect(this.SnapshotsDataService.load).toHaveBeenCalled();
expect(this.scope.repositories).toEqual(['repo 1', 'repo 2']);
expect(this.scope.indices).toEqual(['idx 1', 'idx 2']);
expect(this.scope.refreshIndices).toHaveBeenCalled();
});
it('handles error while loading data', function() {
this.SnapshotsDataService.load = function(success, error) {
error("kaput");
}
spyOn(this.SnapshotsDataService, 'load').and.callThrough();
spyOn(this.AlertService, 'error').and.returnValue();
this.scope.setup();
expect(this.SnapshotsDataService.load).toHaveBeenCalled();
expect(this.scope.repositories).toEqual([]);
expect(this.scope.indices).toEqual([]);
expect(this.AlertService.error).toHaveBeenCalledWith('Error loading repositories', 'kaput');
});
});
describe('restore', function() {
it('restores a snapshot', function() {
this.SnapshotsDataService.restore = function(
repository,
snapshot,
renamePattern,
renameReplacement,
ignoreUnavailable,
includeAliases,
includeGlobalState,
indices,
success,
error) {
success('ack');
}
spyOn(this.SnapshotsDataService, 'restore').and.callThrough();
spyOn(this.AlertService, 'info').and.returnValue();
var form = {includeAliases: false, includeGlobalState: true, ignoreUnavailable: true};
this.scope.restore('repo name', 'the snap', form);
expect(this.SnapshotsDataService.restore).toHaveBeenCalledWith('repo name', 'the snap', undefined, undefined, true, false, true, undefined, jasmine.any(Function), jasmine.any(Function));
expect(this.AlertService.info).toHaveBeenCalledWith('Snapshot successfully restored', 'ack');
});
it('fails to restore snapshot', function() {
this.SnapshotsDataService.restore = function(
repository,
snapshot,
renamePattern,
renameReplacement,
ignoreUnavailable,
includeAliases,
includeGlobalState,
indices,
success,
error) {
error('kaput');
}
spyOn(this.SnapshotsDataService, 'restore').and.callThrough();
spyOn(this.AlertService, 'error').and.returnValue();
var form = {includeAliases: false, includeGlobalState: true, ignoreUnavailable: true};
this.scope.restore('repo name', 'the snap', form);
expect(this.SnapshotsDataService.restore).toHaveBeenCalledWith('repo name', 'the snap', undefined, undefined, true, false, true, undefined, jasmine.any(Function), jasmine.any(Function));
expect(this.AlertService.error).toHaveBeenCalledWith('Error restoring snapshot', 'kaput');
});
});
describe('create', function() {
it('creates a snapshot', function() {
this.SnapshotsDataService.create = function(
repository,
snapshot,
ignoreUnavailable,
includeGlobalState,
indices,
success,
error) {
success('ack');
}
this.scope.repository = 'currentRepo';
spyOn(this.SnapshotsDataService, 'create').and.callThrough();
spyOn(this.AlertService, 'info').and.returnValue();
spyOn(this.scope, 'loadSnapshots').and.returnValue();
this.scope.create('repo name', 'the snap', false, true, []);
expect(this.SnapshotsDataService.create).toHaveBeenCalledWith('repo name', 'the snap', false, true, [], jasmine.any(Function), jasmine.any(Function));
expect(this.scope.loadSnapshots).toHaveBeenCalledWith('currentRepo');
expect(this.AlertService.info).toHaveBeenCalledWith('Snapshot successfully created', 'ack');
});
it('fails to create snapshot', function() {
this.SnapshotsDataService.create = function(
repository,
snapshot,
ignoreUnavailable,
includeGlobalState,
indices,
success,
error) {
error('kaput!');
}
spyOn(this.SnapshotsDataService, 'create').and.callThrough();
spyOn(this.AlertService, 'error').and.returnValue();
this.scope.create('repo name', 'the snap', false, true, []);
expect(this.SnapshotsDataService.create).toHaveBeenCalledWith('repo name', 'the snap', false, true, [], jasmine.any(Function), jasmine.any(Function));
expect(this.AlertService.error).toHaveBeenCalledWith('Error creating snapshot', 'kaput!');
});
});
describe('loadSnapshots', function() {
it('loads snapshots', function() {
var snaps = ['snap 1', 'snap 2'];
this.SnapshotsDataService.loadSnapshots = function(
repository,
success,
error) {
success(snaps);
}
spyOn(this.SnapshotsDataService, 'loadSnapshots').and.callThrough();
this.scope.loadSnapshots('repo name');
expect(this.SnapshotsDataService.loadSnapshots).toHaveBeenCalledWith('repo name', jasmine.any(Function), jasmine.any(Function));
expect(this.scope.snapshots).toEqual(snaps);
});
it('skip loading snapshots if no repository selected', function() {
spyOn(this.SnapshotsDataService, 'loadSnapshots').and.callThrough();
this.scope.loadSnapshots();
expect(this.SnapshotsDataService.loadSnapshots).not.toHaveBeenCalled();
});
it('fails loading snapshots', function() {
this.SnapshotsDataService.loadSnapshots = function(
repository,
success,
error) {
error('pff');
}
spyOn(this.SnapshotsDataService, 'loadSnapshots').and.callThrough();
spyOn(this.AlertService, 'error').and.returnValue();
this.scope.loadSnapshots('repo name');
expect(this.SnapshotsDataService.loadSnapshots).toHaveBeenCalledWith('repo name', jasmine.any(Function), jasmine.any(Function));
expect(this.AlertService.error).toHaveBeenCalledWith('Error loading snapshots', 'pff');
});
});
describe('watch repository', function() {
it('loads snapshots', function() {
spyOn(this.scope, 'loadSnapshots').and.returnValue();
this.scope.repository = 'new value';
this.scope.$digest();
expect(this.scope.loadSnapshots).toHaveBeenCalled();
});
});
describe('watch showSpecialIndices', function() {
it('loads snapshots', function() {
spyOn(this.scope, 'refreshIndices').and.returnValue();
this.scope.showSpecialIndices = true;
this.scope.$digest();
expect(this.scope.refreshIndices).toHaveBeenCalled();
});
});
describe('refreshIndices', function() {
it('exclude special indices from visible indices', function() {
this.scope._indices = [{name: 'aaa', special: false}, {name: '.bbbb', special: true}];
this.scope.refreshIndices();
expect(this.scope.indices).toEqual([{name: 'aaa', special: false}]);
});
it('include special indices on list of visible indices', function() {
var indices = [{name: 'aaa', special: false}, {name: '.bbbb', special: true}];
this.scope._indices = indices;
this.scope.showSpecialIndices = true;
this.scope.refreshIndices();
expect(this.scope.indices).toEqual(indices);
});
});
});
```
|
```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\BeyondCorp\Resource;
use Google\Service\BeyondCorp\GoogleIamV1Policy;
use Google\Service\BeyondCorp\GoogleIamV1SetIamPolicyRequest;
use Google\Service\BeyondCorp\GoogleIamV1TestIamPermissionsRequest;
use Google\Service\BeyondCorp\GoogleIamV1TestIamPermissionsResponse;
/**
* The "tenants" collection of methods.
* Typical usage is:
* <code>
* $beyondcorpService = new Google\Service\BeyondCorp(...);
* $tenants = $beyondcorpService->organizations_locations_global_tenants;
* </code>
*/
class OrganizationsLocationsBeyondcorpGlobalTenants extends \Google\Service\Resource
{
/**
* Gets the access control policy for a resource. Returns an empty policy if the
* resource exists and does not have a policy set. (tenants.getIamPolicy)
*
* @param string $resource REQUIRED: The resource for which the policy is being
* requested. See [Resource
* names](path_to_url for the
* appropriate value for this field.
* @param array $optParams Optional parameters.
*
* @opt_param int options.requestedPolicyVersion Optional. The maximum policy
* version that will be used to format the policy. Valid values are 0, 1, and 3.
* Requests specifying an invalid value will be rejected. Requests for policies
* with any conditional role bindings must specify version 3. Policies with no
* conditional role bindings may specify any valid value or leave the field
* unset. The policy in the response might use the policy version that you
* specified, or it might use a lower policy version. For example, if you
* specify version 3, but the policy has no conditional role bindings, the
* response uses version 1. To learn which resources support conditions in their
* IAM policies, see the [IAM
* documentation](path_to_url
* policies).
* @return GoogleIamV1Policy
*/
public function getIamPolicy($resource, $optParams = [])
{
$params = ['resource' => $resource];
$params = array_merge($params, $optParams);
return $this->call('getIamPolicy', [$params], GoogleIamV1Policy::class);
}
/**
* Sets the access control policy on the specified resource. Replaces any
* existing policy. Can return `NOT_FOUND`, `INVALID_ARGUMENT`, and
* `PERMISSION_DENIED` errors. (tenants.setIamPolicy)
*
* @param string $resource REQUIRED: The resource for which the policy is being
* specified. See [Resource
* names](path_to_url for the
* appropriate value for this field.
* @param GoogleIamV1SetIamPolicyRequest $postBody
* @param array $optParams Optional parameters.
* @return GoogleIamV1Policy
*/
public function setIamPolicy($resource, GoogleIamV1SetIamPolicyRequest $postBody, $optParams = [])
{
$params = ['resource' => $resource, 'postBody' => $postBody];
$params = array_merge($params, $optParams);
return $this->call('setIamPolicy', [$params], GoogleIamV1Policy::class);
}
/**
* Returns permissions that a caller has on the specified resource. If the
* resource does not exist, this will return an empty set of permissions, not a
* `NOT_FOUND` error. Note: This operation is designed to be used for building
* permission-aware UIs and command-line tools, not for authorization checking.
* This operation may "fail open" without warning. (tenants.testIamPermissions)
*
* @param string $resource REQUIRED: The resource for which the policy detail is
* being requested. See [Resource
* names](path_to_url for the
* appropriate value for this field.
* @param GoogleIamV1TestIamPermissionsRequest $postBody
* @param array $optParams Optional parameters.
* @return GoogleIamV1TestIamPermissionsResponse
*/
public function testIamPermissions($resource, GoogleIamV1TestIamPermissionsRequest $postBody, $optParams = [])
{
$params = ['resource' => $resource, 'postBody' => $postBody];
$params = array_merge($params, $optParams);
return $this->call('testIamPermissions', [$params], GoogleIamV1TestIamPermissionsResponse::class);
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(OrganizationsLocationsBeyondcorpGlobalTenants::class, your_sha256_hashorpGlobalTenants');
```
|
```xml
import { QueryRange } from './query-range';
import { Model } from './model';
import ModelQuery from './query';
/*
Public: Instances of QueryResultSet hold a set of models retrieved
from the database at a given offset.
Complete vs Incomplete:
QueryResultSet keeps an array of item ids and a lookup table of models.
The lookup table may be incomplete if the QuerySubscription isn't finished
preparing results. You can use `isComplete` to determine whether the set
has every model.
Offset vs Index:
To avoid confusion, "index" refers to an item's position in an
array, and "offset" refers to it's position in the query result set. For example,
an item might be at index 20 in the _ids array, but at offset 120 in the result.
*/
export class QueryResultSet<T extends Model> {
_offset: number;
_query: ModelQuery<T> | ModelQuery<T[]>;
_idToIndexHash?: { [id: string]: number };
_modelsHash?: { [id: string]: T };
_ids: string[] = [];
static setByApplyingModels(set, models) {
if (models instanceof Array) {
throw new Error('setByApplyingModels: A hash of models is required.');
}
const out = set.clone();
out._modelsHash = models;
out._idToIndexHash = null;
return out;
}
constructor(other: Partial<QueryResultSet<T>> = {}) {
this._offset = other._offset !== undefined ? other._offset : null;
this._query = other._query !== undefined ? other._query : null;
this._idToIndexHash = other._idToIndexHash !== undefined ? other._idToIndexHash : null;
// Clone, since the others may be frozen
this._modelsHash = Object.assign({}, other._modelsHash || {});
this._ids = [].concat(other._ids || []);
}
clone() {
return new (this.constructor as any)({
_ids: [...this._ids],
_modelsHash: { ...this._modelsHash },
_idToIndexHash: { ...this._idToIndexHash },
_query: this._query,
_offset: this._offset,
});
}
isComplete() {
return this._ids.every(id => !!this._modelsHash[id]);
}
range() {
return new QueryRange({ offset: this._offset, limit: this._ids.length });
}
query() {
return this._query;
}
count() {
return this._ids.length;
}
empty() {
return this.count() === 0;
}
ids() {
return this._ids;
}
idAtOffset(offset: number) {
return this._ids[offset - this._offset];
}
models() {
return this._ids.map(id => this._modelsHash[id]);
}
modelCacheCount() {
return Object.keys(this._modelsHash).length;
}
modelAtOffset(offset: number) {
if (!Number.isInteger(offset)) {
throw new Error(
'QueryResultSet.modelAtOffset() takes a numeric index. Maybe you meant modelWithId()?'
);
}
return this._modelsHash[this._ids[offset - this._offset]];
}
modelWithId(id: string): T {
return this._modelsHash[id];
}
buildIdToIndexHash() {
this._idToIndexHash = {};
this._ids.forEach((id, idx) => {
this._idToIndexHash[id] = idx;
});
}
offsetOfId(id: string) {
if (this._idToIndexHash === null) {
this.buildIdToIndexHash();
}
if (this._idToIndexHash[id] === undefined) {
return -1;
}
return this._idToIndexHash[id] + this._offset;
}
}
```
|
```kotlin
#!/usr/bin/env kotlin
/**
* Copy this file to scripts/collect-diagnostics.main.kts and add the below to your
* Github Actions workflow file:
*
* - name: Collect Diagnostics
* if: always()
* run: ./scripts/collect-diagnostics.main.kts
* - uses: actions/upload-artifact@v3
* if: always()
* with:
* name: diagnostics
* path: diagnostics.zip
*/
import java.io.File
import java.util.zip.ZipEntry
import java.util.zip.ZipOutputStream
val home = System.getenv("HOME")
println("HOME: $home")
val coreDir = File("$home/Library/Logs/DiagnosticReports/")
ZipOutputStream(File("diagnostics.zip").outputStream()).use { zipOutputStream ->
if (coreDir.exists()) {
zipOutputStream.addDirectory(coreDir, coreDir, "diagnostics/cores")
}
File(".").walk().filter {
it.name == "build"
}.map {
it.resolve("reports")
}.filter {
it.exists()
}.forEach {
zipOutputStream.addDirectory(File("."), it, "diagnostics/tests")
}
}
fun ZipOutputStream.addDirectory(repoDir: File, reportsDir: File, prefix: String) {
reportsDir.walk().filter { it.isFile }.forEach {
val path = it.relativeTo(repoDir).path
val name = "$prefix/$path"
println("- $name")
putNextEntry(ZipEntry(name))
it.inputStream().use {
it.copyTo(this)
}
}
}
```
|
```java
package ai.vespa.client.dsl;
public class GeoLocation extends QueryChain {
private final String fieldName;
private final Double longitude;
private final Double latitude;
private final String radius;
public GeoLocation(String fieldName, Double longitude, Double latitude, String radius) {
this.fieldName = fieldName;
this.longitude = longitude;
this.latitude = latitude;
this.radius = radius;
this.nonEmpty = true;
}
@Override
boolean hasPositiveSearchField(String fieldName) {
return this.fieldName.equals(fieldName);
}
@Override
boolean hasPositiveSearchField(String fieldName, Object value) {
return false;
}
@Override
boolean hasNegativeSearchField(String fieldName) {
return false;
}
@Override
boolean hasNegativeSearchField(String fieldName, Object value) {
return false;
}
@Override
public String toString() {
return Text.format("geoLocation(%s, %f, %f, %s)", fieldName, longitude, latitude, Q.toJson(radius));
}
}
```
|
```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.Collections.Generic;
using iText.StyledXmlParser.Jsoup.Helper;
using iText.StyledXmlParser.Jsoup.Nodes;
using iText.StyledXmlParser.Jsoup.Parser;
using iText.StyledXmlParser.Jsoup.Select;
namespace iText.StyledXmlParser.Jsoup.Safety {
/// <summary>The safelist based HTML cleaner.</summary>
/// <remarks>
/// The safelist based HTML cleaner. Use to ensure that end-user provided HTML contains only the elements and attributes
/// that you are expecting; no junk, and no cross-site scripting attacks!
/// <para />
/// The HTML cleaner parses the input as HTML and then runs it through a safe-list, so the output HTML can only contain
/// HTML that is allowed by the safelist.
/// <para />
/// It is assumed that the input HTML is a body fragment; the clean methods only pull from the source's body, and the
/// canned safe-lists only allow body contained tags.
/// <para />
/// Rather than interacting directly with a Cleaner object, generally see the
/// <c>clean</c>
/// methods in
/// <see cref="iText.StyledXmlParser.Jsoup.Jsoup"/>.
/// </remarks>
public class Cleaner {
private readonly Safelist safelist;
/// <summary>Create a new cleaner, that sanitizes documents using the supplied safelist.</summary>
/// <param name="safelist">safe-list to clean with</param>
public Cleaner(Safelist safelist) {
Validate.NotNull(safelist);
this.safelist = safelist;
}
/// <summary>
/// Use
/// <see cref="Cleaner(Safelist)"/>
/// instead.
/// </summary>
[System.ObsoleteAttribute(@"as of 1.14.1.")]
public Cleaner(Whitelist whitelist) {
Validate.NotNull(whitelist);
this.safelist = whitelist;
}
/// <summary>Creates a new, clean document, from the original dirty document, containing only elements allowed by the safelist.
/// </summary>
/// <remarks>
/// Creates a new, clean document, from the original dirty document, containing only elements allowed by the safelist.
/// The original document is not modified. Only elements from the dirty document's <c>body</c> are used. The
/// OutputSettings of the original document are cloned into the clean document.
/// </remarks>
/// <param name="dirtyDocument">Untrusted base document to clean.</param>
/// <returns>cleaned document.</returns>
public virtual Document Clean(Document dirtyDocument) {
Validate.NotNull(dirtyDocument);
Document clean = Document.CreateShell(dirtyDocument.BaseUri());
CopySafeNodes(dirtyDocument.Body(), clean.Body());
clean.OutputSettings((OutputSettings)dirtyDocument.OutputSettings().Clone());
return clean;
}
/// <summary>Determines if the input document <b>body</b>is valid, against the safelist.</summary>
/// <remarks>
/// Determines if the input document <b>body</b>is valid, against the safelist. It is considered valid if all the tags and attributes
/// in the input HTML are allowed by the safelist, and that there is no content in the <c>head</c>.
/// <para />
/// This method can be used as a validator for user input. An invalid document will still be cleaned successfully
/// using the
/// <see cref="Clean(iText.StyledXmlParser.Jsoup.Nodes.Document)"/>
/// document. If using as a validator, it is recommended to still clean the document
/// to ensure enforced attributes are set correctly, and that the output is tidied.
/// </remarks>
/// <param name="dirtyDocument">document to test</param>
/// <returns>true if no tags or attributes need to be removed; false if they do</returns>
public virtual bool IsValid(Document dirtyDocument) {
Validate.NotNull(dirtyDocument);
Document clean = Document.CreateShell(dirtyDocument.BaseUri());
int numDiscarded = CopySafeNodes(dirtyDocument.Body(), clean.Body());
return numDiscarded == 0 && dirtyDocument.Head().ChildNodes().IsEmpty();
}
// because we only look at the body, but we start from a shell, make sure there's nothing in the head
public virtual bool IsValidBodyHtml(String bodyHtml) {
Document clean = Document.CreateShell("");
Document dirty = Document.CreateShell("");
ParseErrorList errorList = ParseErrorList.Tracking(1);
IList<iText.StyledXmlParser.Jsoup.Nodes.Node> nodes = iText.StyledXmlParser.Jsoup.Parser.Parser.ParseFragment
(bodyHtml, dirty.Body(), "", errorList);
dirty.Body().InsertChildren(0, nodes);
int numDiscarded = CopySafeNodes(dirty.Body(), clean.Body());
return numDiscarded == 0 && errorList.IsEmpty();
}
/// <summary>Iterates the input and copies trusted nodes (tags, attributes, text) into the destination.</summary>
private sealed class CleaningVisitor : NodeVisitor {
//\cond DO_NOT_DOCUMENT
internal int numDiscarded = 0;
//\endcond
private readonly iText.StyledXmlParser.Jsoup.Nodes.Element root;
private iText.StyledXmlParser.Jsoup.Nodes.Element destination;
//\cond DO_NOT_DOCUMENT
// current element to append nodes to
internal CleaningVisitor(Cleaner _enclosing, iText.StyledXmlParser.Jsoup.Nodes.Element root, iText.StyledXmlParser.Jsoup.Nodes.Element
destination) {
this._enclosing = _enclosing;
this.root = root;
this.destination = destination;
}
//\endcond
public void Head(iText.StyledXmlParser.Jsoup.Nodes.Node source, int depth) {
if (source is iText.StyledXmlParser.Jsoup.Nodes.Element) {
iText.StyledXmlParser.Jsoup.Nodes.Element sourceEl = (iText.StyledXmlParser.Jsoup.Nodes.Element)source;
if (this._enclosing.safelist.IsSafeTag(sourceEl.NormalName())) {
// safe, clone and copy safe attrs
Cleaner.ElementMeta meta = this._enclosing.CreateSafeElement(sourceEl);
iText.StyledXmlParser.Jsoup.Nodes.Element destChild = meta.el;
this.destination.AppendChild(destChild);
this.numDiscarded += meta.numAttribsDiscarded;
this.destination = destChild;
}
else {
if (source != this.root) {
// not a safe tag, so don't add. don't count root against discarded.
this.numDiscarded++;
}
}
}
else {
if (source is TextNode) {
TextNode sourceText = (TextNode)source;
TextNode destText = new TextNode(sourceText.GetWholeText());
this.destination.AppendChild(destText);
}
else {
if (source is DataNode && this._enclosing.safelist.IsSafeTag(source.Parent().NodeName())) {
DataNode sourceData = (DataNode)source;
DataNode destData = new DataNode(sourceData.GetWholeData());
this.destination.AppendChild(destData);
}
else {
// else, we don't care about comments, xml proc instructions, etc
this.numDiscarded++;
}
}
}
}
public void Tail(iText.StyledXmlParser.Jsoup.Nodes.Node source, int depth) {
if (source is iText.StyledXmlParser.Jsoup.Nodes.Element && this._enclosing.safelist.IsSafeTag(source.NodeName
())) {
this.destination = (iText.StyledXmlParser.Jsoup.Nodes.Element)this.destination.Parent();
}
}
private readonly Cleaner _enclosing;
// would have descended, so pop destination stack
}
private int CopySafeNodes(iText.StyledXmlParser.Jsoup.Nodes.Element source, iText.StyledXmlParser.Jsoup.Nodes.Element
dest) {
Cleaner.CleaningVisitor cleaningVisitor = new Cleaner.CleaningVisitor(this, source, dest);
NodeTraversor.Traverse(cleaningVisitor, source);
return cleaningVisitor.numDiscarded;
}
private Cleaner.ElementMeta CreateSafeElement(iText.StyledXmlParser.Jsoup.Nodes.Element sourceEl) {
String sourceTag = sourceEl.TagName();
Attributes destAttrs = new Attributes();
iText.StyledXmlParser.Jsoup.Nodes.Element dest = new iText.StyledXmlParser.Jsoup.Nodes.Element(iText.StyledXmlParser.Jsoup.Parser.Tag
.ValueOf(sourceTag), sourceEl.BaseUri(), destAttrs);
int numDiscarded = 0;
Attributes sourceAttrs = sourceEl.Attributes();
foreach (iText.StyledXmlParser.Jsoup.Nodes.Attribute sourceAttr in sourceAttrs) {
if (safelist.IsSafeAttribute(sourceTag, sourceEl, sourceAttr)) {
destAttrs.Put(sourceAttr);
}
else {
numDiscarded++;
}
}
Attributes enforcedAttrs = safelist.GetEnforcedAttributes(sourceTag);
destAttrs.AddAll(enforcedAttrs);
return new Cleaner.ElementMeta(dest, numDiscarded);
}
private class ElementMeta {
//\cond DO_NOT_DOCUMENT
internal iText.StyledXmlParser.Jsoup.Nodes.Element el;
//\endcond
//\cond DO_NOT_DOCUMENT
internal int numAttribsDiscarded;
//\endcond
//\cond DO_NOT_DOCUMENT
internal ElementMeta(iText.StyledXmlParser.Jsoup.Nodes.Element el, int numAttribsDiscarded) {
this.el = el;
this.numAttribsDiscarded = numAttribsDiscarded;
}
//\endcond
}
}
}
```
|
```html
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "path_to_url">
<html xmlns="path_to_url">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.17"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Jetson Inference: File Members</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectlogo"><img alt="Logo" src="NVLogo_2D.jpg"/></td>
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Jetson Inference
</div>
<div id="projectbrief">DNN Vision Library</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.17 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('globals_func_m.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="contents">
 
<h3><a id="index_m"></a>- m -</h3><ul>
<li>make_float2()
: <a class="el" href="cudaMath_8h.html#ae157a97cf7d77e6a05db0e0d22b85fb7">cudaMath.h</a>
</li>
<li>make_float3()
: <a class="el" href="cudaMath_8h.html#a89bbe6b4a0958acfadfebbf29499bcf4">cudaMath.h</a>
</li>
<li>make_float4()
: <a class="el" href="cudaMath_8h.html#aede75d583193065b30cf6fab0604b572">cudaMath.h</a>
</li>
<li>make_int2()
: <a class="el" href="cudaMath_8h.html#a3be05aff487ded3c05aab21d24dd6439">cudaMath.h</a>
</li>
<li>make_int3()
: <a class="el" href="cudaMath_8h.html#aa72ad70768ab882bd2d74319b3afbcbe">cudaMath.h</a>
</li>
<li>make_int4()
: <a class="el" href="cudaMath_8h.html#a2374cd64552e8716f8e4f5194484fd2d">cudaMath.h</a>
</li>
<li>make_uchar3()
: <a class="el" href="cudaMath_8h.html#aa8a7a118682683e8e44f41de6862f6e1">cudaMath.h</a>
</li>
<li>make_uchar4()
: <a class="el" href="cudaMath_8h.html#ad2b004654ffbdfc2c808e294f41e5d04">cudaMath.h</a>
</li>
<li>make_uint2()
: <a class="el" href="cudaMath_8h.html#a0c63d36196448ce9bb8fb1d30db90a0c">cudaMath.h</a>
</li>
<li>make_uint3()
: <a class="el" href="cudaMath_8h.html#a5e8423baf776bebe1a2dbe99d5abcb53">cudaMath.h</a>
</li>
<li>make_uint4()
: <a class="el" href="cudaMath_8h.html#a622e6d9f0fde597549dae79b03e6c7d2">cudaMath.h</a>
</li>
<li>make_vec()
: <a class="el" href="cudaVector_8h.html#ad7b90b5d083311b5744ee6cc448a5b33">cudaVector.h</a>
</li>
<li>mat33_cast()
: <a class="el" href="group__matrix.html#ga2a59a3e770f0f421c2e21df6f86df48f">mat33.h</a>
</li>
<li>mat33_copy()
: <a class="el" href="group__matrix.html#ga4081852912b45ee44f0243ff5718203c">mat33.h</a>
</li>
<li>mat33_det()
: <a class="el" href="group__matrix.html#ga337284e19938f8654d8ebf6dcf6f257b">mat33.h</a>
</li>
<li>mat33_identity()
: <a class="el" href="group__matrix.html#ga984ddbe902542e96416bb22c5c824b80">mat33.h</a>
</li>
<li>mat33_inverse()
: <a class="el" href="group__matrix.html#gab7c879d25c250f9b0bbf43d1ca351a84">mat33.h</a>
</li>
<li>mat33_multiply()
: <a class="el" href="group__matrix.html#ga17719324015094525794f664c86ba20d">mat33.h</a>
</li>
<li>mat33_print()
: <a class="el" href="group__matrix.html#ga58d12875af4d112afdc1354e66f488d2">mat33.h</a>
</li>
<li>mat33_rank()
: <a class="el" href="group__matrix.html#gafa786e888812cb8d884c5e585914b609">mat33.h</a>
</li>
<li>mat33_rotation()
: <a class="el" href="group__matrix.html#ga538c44222723e66a248894a05b607523">mat33.h</a>
</li>
<li>mat33_scale()
: <a class="el" href="group__matrix.html#ga00f088c37cb0ec42cea53fa7794457e3">mat33.h</a>
</li>
<li>mat33_shear()
: <a class="el" href="group__matrix.html#ga389b2d87bdb9ab09c3d873a6dcbf2e87">mat33.h</a>
</li>
<li>mat33_swap()
: <a class="el" href="group__matrix.html#ga14a2f030b3997bbf73afa1b9868534ec">mat33.h</a>
</li>
<li>mat33_trace()
: <a class="el" href="group__matrix.html#ga494f9ef8df9d1e14afce204581247fa4">mat33.h</a>
</li>
<li>mat33_transform()
: <a class="el" href="group__matrix.html#ga3cd7f8bbd5028eb6a4c6fa3f1e83cbe0">mat33.h</a>
</li>
<li>mat33_translate()
: <a class="el" href="group__matrix.html#gafc607b02cc864b8571d5a984bc3f1851">mat33.h</a>
</li>
<li>mat33_transpose()
: <a class="el" href="group__matrix.html#gaef64fca8bb6b4a04d2b7497551719c08">mat33.h</a>
</li>
<li>mat33_zero()
: <a class="el" href="group__matrix.html#gaf896d4d3e9b5019d367d9f3707305083">mat33.h</a>
</li>
<li>max()
: <a class="el" href="cudaMath_8h.html#af082905f7eac6d03e92015146bbc1925">cudaMath.h</a>
</li>
<li>min()
: <a class="el" href="cudaMath_8h.html#a4d54be3b6388d6a2a0d095b880de4d4a">cudaMath.h</a>
</li>
<li>modelTypeFromPath()
: <a class="el" href="group__tensorNet.html#ga675fb15bc5d4e2b8c4758c62adc6920d">tensorNet.h</a>
</li>
<li>modelTypeFromStr()
: <a class="el" href="group__tensorNet.html#ga85f7b445f4341d24c65bb3bbc4a3204c">tensorNet.h</a>
</li>
<li>modelTypeToStr()
: <a class="el" href="group__tensorNet.html#gae771c047f44cc49238c00d0e8af48106">tensorNet.h</a>
</li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated on Tue Mar 28 2023 14:27:59 for Jetson Inference by
<a href="path_to_url">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.17 </li>
</ul>
</div>
</body>
</html>
```
|
```python
'''
Author: Vedant Wakalkar
Python Program to multiply Matrix (of size m*n) with scalar number.
'''
def input_matrix(m,n):
# m,n -> size of Matrix (m*n)
mat = []
for i in range(m):
# Enter space seperated input for elements of matrix
# Enter 'n' no. of elemnts row wise and press enter for next row elements
temp = map(int,input('Elements Row '+str(i+1)+' : ').strip().split(' '))
mat.append(list(temp))
return mat
def scalar_multiply(k,M1,m,n):
# parameters:
# k -> scalar multiple
# M1 -> Matrix 1
# m,n -> size of Matrix (m*n)
mat = []
for i in range(m):
tmp = []
for j in range(n):
tmp.append([])
mat.append(tmp)
for i in range(m):
for j in range(n):
mat[i][j] = M1[i][j] * k
return mat
if __name__ == "__main__":
# input Matrix of size m*n
print("\n-- Matrix Size m*n --")
m = int(input("Enter m : "))
n = int(input("Enter n : "))
# Input Matrix 1
print("\nInput Elements for Matrix1 :")
M1 = input_matrix(m,n)
print("Matrix 1:",M1)
k = int(input("\nEnter Scalar Multiple : "))
M2 = scalar_multiply(k,M1,m,n)
print("\n",k,"X (Matrix 1) : ",M2)
'''
Output:
-- Matrix Size m*n --
Enter m : 2
Enter n : 2
Input Elements for Matrix1 :
Elements Row 1 : 2 4
Elements Row 2 : 5 7
Matrix 1: [[2, 4], [5, 7]]
Enter Scalar Multiple : 5
5 X (Matrix 1) : [[10, 20], [25, 35]]
'''
```
|
```java
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
*
* Subject to the condition set forth below, permission is hereby granted to any
* person obtaining a copy of this software, associated documentation and/or
* data (collectively the "Software"), free of charge and under any and all
* copyright rights in the Software, and any and all patent rights owned or
* freely licensable by each licensor hereunder covering either (i) the
* unmodified Software as contributed to or provided by such licensor, or (ii)
* the Larger Works (as defined below), to deal in both
*
* (a) the Software, and
*
* (b) any piece of software and/or hardware listed in the lrgrwrks.txt file if
* one is included with the Software each a "Larger Work" to which the Software
* is contributed by such licensors),
*
* without restriction, including without limitation the rights to copy, create
* derivative works of, display, perform, and distribute the Software and make,
* use, sell, offer for sale, import, export, have made, and have sold the
* Software and the Larger Work(s), and to sublicense the foregoing rights on
* either these or other terms.
*
* This license is subject to the following condition:
*
* The above copyright notice and either this complete permission notice or at a
* minimum a reference to the UPL must be included in all copies or substantial
* portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
package com.oracle.truffle.api.test.polyglot;
import com.oracle.truffle.api.test.ReflectionUtils;
import org.graalvm.nativeimage.ImageInfo;
import org.graalvm.polyglot.Context;
import org.graalvm.polyglot.HostAccess;
import org.graalvm.polyglot.Value;
import org.junit.AfterClass;
import org.junit.Assume;
import org.junit.BeforeClass;
import org.junit.Test;
import com.oracle.truffle.api.test.CompileImmediatelyCheck;
import com.oracle.truffle.tck.tests.TruffleTestAssumptions;
import java.lang.ref.ReferenceQueue;
import java.util.Map;
/*
* Please note that any OOME exceptions when running this test indicate memory leaks in Truffle.
* This test requires -Xmx32M to reliably fail.
*/
public class GR30288Test {
@BeforeClass
public static void runWithWeakEncapsulationOnly() {
TruffleTestAssumptions.assumeWeakEncapsulation();
}
@Test
public void test() throws Exception {
Assume.assumeFalse(CompileImmediatelyCheck.isCompileImmediately());
// it is important that a new host access is created each time for this test to fail
for (int i = 0; i < 10000; i++) {
HostAccess access = HostAccess.newBuilder().allowPublicAccess(true).build();
try (Context context = Context.newBuilder().allowHostAccess(access).build()) {
/*
* We use several classes to hit the problem earlier.
*/
for (Object value : TEST_VALUES) {
Value v = context.asValue(value);
// materialize all member access
v.getMemberKeys().size();
}
}
}
}
/***
* Cleans up leaked {@link ClassValue} values on HotSpot after the test. Although the
* {@link ClassValue} instances in the {@code HostClassCache} are released, their values are
* still strongly reachable from the {@code Class#classValueMap} field. In order to release them
* you need to actively use {@code ClassValueMap}. You need to populate the
* {@code ClassValueMap#cacheLoadLimit} values. The {@code ClassValueMap#cacheLoadLimit} can be
* quite high, so we clean the {@code ClassValueMap} using a reflection. The
* {@code ClassValueMap} holds {@link ClassValue} values in three places.
* <ol>
* <li>{@code ClassValueMap.Entry#value}</li>
* <li>Constant folding cache {@code ClassValueMap#cacheArray}</li>
* <li>Enqueued {@code ClassValueMap.Entry}s in the {@code ClassValueMap}
* {@link ReferenceQueue}</li>
* </ol>
* We need to clear all these three references.
*/
@AfterClass
public static void tearDown() throws Exception {
if (!ImageInfo.inImageRuntimeCode()) {
// Perform GC to process weak references.
System.gc();
for (Object value : TEST_VALUES) {
// Clean the constants folding cache
Map<?, ?> classValueMap = (Map<?, ?>) ReflectionUtils.getField(value.getClass(), "classValueMap");
if (classValueMap != null) {
ReflectionUtils.invoke(classValueMap, "removeStaleEntries");
// Clean the ClassValueMap entries with weakly reachable ClassValues from both
// the map and the reference queue.
for (int i = 0; i < 10 && classValueMap.size() > 0; i++) {
// Give a GC a chance to enqueue references into a reference queue.
Thread.sleep(100);
}
}
}
}
}
static class BaseClass {
public void m0() {
}
public void m1() {
}
public void m2() {
}
public void m3() {
}
public void m4() {
}
public void m5() {
}
public void m6() {
}
public void m7() {
}
public void m8() {
}
public void m9() {
}
public void m10() {
}
public void m11() {
}
public void m12() {
}
public void m13() {
}
public void m14() {
}
public void m15() {
}
public void m16() {
}
public void m17() {
}
public void m18() {
}
public void m19() {
}
public void m20() {
}
public void m21() {
}
}
public static class TestClass1 extends BaseClass {
}
public static class TestClass2 extends BaseClass {
}
public static class TestClass3 extends BaseClass {
}
public static class TestClass4 extends BaseClass {
}
public static class TestClass5 extends BaseClass {
}
public static class TestClass6 extends BaseClass {
}
public static class TestClass7 extends BaseClass {
}
private static final BaseClass[] TEST_VALUES = new BaseClass[]{
new TestClass1(),
new TestClass2(),
new TestClass3(),
new TestClass4(),
new TestClass5(),
new TestClass6(),
new TestClass7(),
};
}
```
|
```ruby
# frozen_string_literal: true
# shareable_constant_value: literal
require 'date'
# :stopdoc:
# = time.rb
#
# When 'time' is required, Time is extended with additional methods for parsing
# and converting Times.
#
# == Features
#
# This library extends the Time class with the following conversions between
# date strings and Time objects:
#
# * date-time defined by {RFC 2822}[path_to_url
# * HTTP-date defined by {RFC 2616}[path_to_url
# * dateTime defined by XML Schema Part 2: Datatypes ({ISO
# 8601}[path_to_url
# * various formats handled by Date._parse
# * custom formats handled by Date._strptime
# :startdoc:
class Time
class << Time
#
# A hash of timezones mapped to hour differences from UTC. The
# set of time zones corresponds to the ones specified by RFC 2822
# and ISO 8601.
#
ZoneOffset = { # :nodoc:
'UTC' => 0,
# ISO 8601
'Z' => 0,
# RFC 822
'UT' => 0, 'GMT' => 0,
'EST' => -5, 'EDT' => -4,
'CST' => -6, 'CDT' => -5,
'MST' => -7, 'MDT' => -6,
'PST' => -8, 'PDT' => -7,
# Following definition of military zones is original one.
# See RFC 1123 and RFC 2822 for the error in RFC 822.
'A' => +1, 'B' => +2, 'C' => +3, 'D' => +4, 'E' => +5, 'F' => +6,
'G' => +7, 'H' => +8, 'I' => +9, 'K' => +10, 'L' => +11, 'M' => +12,
'N' => -1, 'O' => -2, 'P' => -3, 'Q' => -4, 'R' => -5, 'S' => -6,
'T' => -7, 'U' => -8, 'V' => -9, 'W' => -10, 'X' => -11, 'Y' => -12,
}
#
# Return the number of seconds the specified time zone differs
# from UTC.
#
# Numeric time zones that include minutes, such as
# <code>-10:00</code> or <code>+1330</code> will work, as will
# simpler hour-only time zones like <code>-10</code> or
# <code>+13</code>.
#
# Textual time zones listed in ZoneOffset are also supported.
#
# If the time zone does not match any of the above, +zone_offset+
# will check if the local time zone (both with and without
# potential Daylight Saving \Time changes being in effect) matches
# +zone+. Specifying a value for +year+ will change the year used
# to find the local time zone.
#
# If +zone_offset+ is unable to determine the offset, nil will be
# returned.
#
# require 'time'
#
# Time.zone_offset("EST") #=> -18000
#
# You must require 'time' to use this method.
#
def zone_offset(zone, year=self.now.year)
off = nil
zone = zone.upcase
if /\A([+-])(\d\d)(:?)(\d\d)(?:\3(\d\d))?\z/ =~ zone
off = ($1 == '-' ? -1 : 1) * (($2.to_i * 60 + $4.to_i) * 60 + $5.to_i)
elsif zone.match?(/\A[+-]\d\d\z/)
off = zone.to_i * 3600
elsif ZoneOffset.include?(zone)
off = ZoneOffset[zone] * 3600
elsif ((t = self.local(year, 1, 1)).zone.upcase == zone rescue false)
off = t.utc_offset
elsif ((t = self.local(year, 7, 1)).zone.upcase == zone rescue false)
off = t.utc_offset
end
off
end
# :stopdoc:
def zone_utc?(zone)
# * +0000
# In RFC 2822, +0000 indicate a time zone at Universal Time.
# Europe/Lisbon is "a time zone at Universal Time" in Winter.
# Atlantic/Reykjavik is "a time zone at Universal Time".
# Africa/Dakar is "a time zone at Universal Time".
# So +0000 is a local time such as Europe/London, etc.
# * GMT
# GMT is used as a time zone abbreviation in Europe/London,
# Africa/Dakar, etc.
# So it is a local time.
#
# * -0000, -00:00
# In RFC 2822, -0000 the date-time contains no information about the
# local time zone.
# In RFC 3339, -00:00 is used for the time in UTC is known,
# but the offset to local time is unknown.
# They are not appropriate for specific time zone such as
# Europe/London because time zone neutral,
# So -00:00 and -0000 are treated as UTC.
zone.match?(/\A(?:-00:00|-0000|-00|UTC|Z|UT)\z/i)
end
private :zone_utc?
def force_zone!(t, zone, offset=nil)
if zone_utc?(zone)
t.utc
elsif offset ||= zone_offset(zone)
# Prefer the local timezone over the fixed offset timezone because
# the former is a real timezone and latter is an artificial timezone.
t.localtime
if t.utc_offset != offset
# Use the fixed offset timezone only if the local timezone cannot
# represent the given offset.
t.localtime(offset)
end
else
t.localtime
end
end
private :force_zone!
LeapYearMonthDays = [31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31] # :nodoc:
CommonYearMonthDays = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31] # :nodoc:
def month_days(y, m)
if ((y % 4 == 0) && (y % 100 != 0)) || (y % 400 == 0)
LeapYearMonthDays[m-1]
else
CommonYearMonthDays[m-1]
end
end
private :month_days
def apply_offset(year, mon, day, hour, min, sec, off)
if off < 0
off = -off
off, o = off.divmod(60)
if o != 0 then sec += o; o, sec = sec.divmod(60); off += o end
off, o = off.divmod(60)
if o != 0 then min += o; o, min = min.divmod(60); off += o end
off, o = off.divmod(24)
if o != 0 then hour += o; o, hour = hour.divmod(24); off += o end
if off != 0
day += off
days = month_days(year, mon)
if days and days < day
mon += 1
if 12 < mon
mon = 1
year += 1
end
day = 1
end
end
elsif 0 < off
off, o = off.divmod(60)
if o != 0 then sec -= o; o, sec = sec.divmod(60); off -= o end
off, o = off.divmod(60)
if o != 0 then min -= o; o, min = min.divmod(60); off -= o end
off, o = off.divmod(24)
if o != 0 then hour -= o; o, hour = hour.divmod(24); off -= o end
if off != 0 then
day -= off
if day < 1
mon -= 1
if mon < 1
year -= 1
mon = 12
end
day = month_days(year, mon)
end
end
end
return year, mon, day, hour, min, sec
end
private :apply_offset
def make_time(date, year, yday, mon, day, hour, min, sec, sec_fraction, zone, now)
if !year && !yday && !mon && !day && !hour && !min && !sec && !sec_fraction
raise ArgumentError, "no time information in #{date.inspect}"
end
off = nil
if year || now
off_year = year || now.year
off = zone_offset(zone, off_year) if zone
end
if yday
unless (1..366) === yday
raise ArgumentError, "yday #{yday} out of range"
end
mon, day = (yday-1).divmod(31)
mon += 1
day += 1
t = make_time(date, year, nil, mon, day, hour, min, sec, sec_fraction, zone, now)
diff = yday - t.yday
return t if diff.zero?
day += diff
if day > 28 and day > (mday = month_days(off_year, mon))
if (mon += 1) > 12
raise ArgumentError, "yday #{yday} out of range"
end
day -= mday
end
return make_time(date, year, nil, mon, day, hour, min, sec, sec_fraction, zone, now)
end
if now and now.respond_to?(:getlocal)
if off
now = now.getlocal(off) if now.utc_offset != off
else
now = now.getlocal
end
end
usec = nil
usec = sec_fraction * 1000000 if sec_fraction
if now
begin
break if year; year = now.year
break if mon; mon = now.mon
break if day; day = now.day
break if hour; hour = now.hour
break if min; min = now.min
break if sec; sec = now.sec
break if sec_fraction; usec = now.tv_usec
end until true
end
year ||= 1970
mon ||= 1
day ||= 1
hour ||= 0
min ||= 0
sec ||= 0
usec ||= 0
if year != off_year
off = nil
off = zone_offset(zone, year) if zone
end
if off
year, mon, day, hour, min, sec =
apply_offset(year, mon, day, hour, min, sec, off)
t = self.utc(year, mon, day, hour, min, sec, usec)
force_zone!(t, zone, off)
t
else
self.local(year, mon, day, hour, min, sec, usec)
end
end
private :make_time
# :startdoc:
#
# Takes a string representation of a Time and attempts to parse it
# using a heuristic.
#
# This method **does not** function as a validator. If the input
# string does not match valid formats strictly, you may get a
# cryptic result. Should consider to use `Time.strptime` instead
# of this method as possible.
#
# require 'time'
#
# Time.parse("2010-10-31") #=> 2010-10-31 00:00:00 -0500
#
# Any missing pieces of the date are inferred based on the current date.
#
# require 'time'
#
# # assuming the current date is "2011-10-31"
# Time.parse("12:00") #=> 2011-10-31 12:00:00 -0500
#
# We can change the date used to infer our missing elements by passing a second
# object that responds to #mon, #day and #year, such as Date, Time or DateTime.
# We can also use our own object.
#
# require 'time'
#
# class MyDate
# attr_reader :mon, :day, :year
#
# def initialize(mon, day, year)
# @mon, @day, @year = mon, day, year
# end
# end
#
# d = Date.parse("2010-10-28")
# t = Time.parse("2010-10-29")
# dt = DateTime.parse("2010-10-30")
# md = MyDate.new(10,31,2010)
#
# Time.parse("12:00", d) #=> 2010-10-28 12:00:00 -0500
# Time.parse("12:00", t) #=> 2010-10-29 12:00:00 -0500
# Time.parse("12:00", dt) #=> 2010-10-30 12:00:00 -0500
# Time.parse("12:00", md) #=> 2010-10-31 12:00:00 -0500
#
# If a block is given, the year described in +date+ is converted
# by the block. This is specifically designed for handling two
# digit years. For example, if you wanted to treat all two digit
# years prior to 70 as the year 2000+ you could write this:
#
# require 'time'
#
# Time.parse("01-10-31") {|year| year + (year < 70 ? 2000 : 1900)}
# #=> 2001-10-31 00:00:00 -0500
# Time.parse("70-10-31") {|year| year + (year < 70 ? 2000 : 1900)}
# #=> 1970-10-31 00:00:00 -0500
#
# If the upper components of the given time are broken or missing, they are
# supplied with those of +now+. For the lower components, the minimum
# values (1 or 0) are assumed if broken or missing. For example:
#
# require 'time'
#
# # Suppose it is "Thu Nov 29 14:33:20 2001" now and
# # your time zone is EST which is GMT-5.
# now = Time.parse("Thu Nov 29 14:33:20 2001")
# Time.parse("16:30", now) #=> 2001-11-29 16:30:00 -0500
# Time.parse("7/23", now) #=> 2001-07-23 00:00:00 -0500
# Time.parse("Aug 31", now) #=> 2001-08-31 00:00:00 -0500
# Time.parse("Aug 2000", now) #=> 2000-08-01 00:00:00 -0500
#
# Since there are numerous conflicts among locally defined time zone
# abbreviations all over the world, this method is not intended to
# understand all of them. For example, the abbreviation "CST" is
# used variously as:
#
# -06:00 in America/Chicago,
# -05:00 in America/Havana,
# +08:00 in Asia/Harbin,
# +09:30 in Australia/Darwin,
# +10:30 in Australia/Adelaide,
# etc.
#
# Based on this fact, this method only understands the time zone
# abbreviations described in RFC 822 and the system time zone, in the
# order named. (i.e. a definition in RFC 822 overrides the system
# time zone definition.) The system time zone is taken from
# <tt>Time.local(year, 1, 1).zone</tt> and
# <tt>Time.local(year, 7, 1).zone</tt>.
# If the extracted time zone abbreviation does not match any of them,
# it is ignored and the given time is regarded as a local time.
#
# ArgumentError is raised if Date._parse cannot extract information from
# +date+ or if the Time class cannot represent specified date.
#
# This method can be used as a fail-safe for other parsing methods as:
#
# Time.rfc2822(date) rescue Time.parse(date)
# Time.httpdate(date) rescue Time.parse(date)
# Time.xmlschema(date) rescue Time.parse(date)
#
# A failure of Time.parse should be checked, though.
#
# You must require 'time' to use this method.
#
def parse(date, now=self.now)
comp = !block_given?
d = Date._parse(date, comp)
year = d[:year]
year = yield(year) if year && !comp
make_time(date, year, d[:yday], d[:mon], d[:mday], d[:hour], d[:min], d[:sec], d[:sec_fraction], d[:zone], now)
end
#
# Works similar to +parse+ except that instead of using a
# heuristic to detect the format of the input string, you provide
# a second argument that describes the format of the string.
#
# If a block is given, the year described in +date+ is converted by the
# block. For example:
#
# Time.strptime(...) {|y| y < 100 ? (y >= 69 ? y + 1900 : y + 2000) : y}
#
# Below is a list of the formatting options:
#
# %a :: The abbreviated weekday name ("Sun")
# %A :: The full weekday name ("Sunday")
# %b :: The abbreviated month name ("Jan")
# %B :: The full month name ("January")
# %c :: The preferred local date and time representation
# %C :: Century (20 in 2009)
# %d :: Day of the month (01..31)
# %D :: Date (%m/%d/%y)
# %e :: Day of the month, blank-padded ( 1..31)
# %F :: Equivalent to %Y-%m-%d (the ISO 8601 date format)
# %g :: The last two digits of the commercial year
# %G :: The week-based year according to ISO-8601 (week 1 starts on Monday
# and includes January 4)
# %h :: Equivalent to %b
# %H :: Hour of the day, 24-hour clock (00..23)
# %I :: Hour of the day, 12-hour clock (01..12)
# %j :: Day of the year (001..366)
# %k :: hour, 24-hour clock, blank-padded ( 0..23)
# %l :: hour, 12-hour clock, blank-padded ( 0..12)
# %L :: Millisecond of the second (000..999)
# %m :: Month of the year (01..12)
# %M :: Minute of the hour (00..59)
# %n :: Newline (\n)
# %N :: Fractional seconds digits
# %p :: Meridian indicator ("AM" or "PM")
# %P :: Meridian indicator ("am" or "pm")
# %r :: time, 12-hour (same as %I:%M:%S %p)
# %R :: time, 24-hour (%H:%M)
# %s :: Number of seconds since 1970-01-01 00:00:00 UTC.
# %S :: Second of the minute (00..60)
# %t :: Tab character (\t)
# %T :: time, 24-hour (%H:%M:%S)
# %u :: Day of the week as a decimal, Monday being 1. (1..7)
# %U :: Week number of the current year, starting with the first Sunday as
# the first day of the first week (00..53)
# %v :: VMS date (%e-%b-%Y)
# %V :: Week number of year according to ISO 8601 (01..53)
# %W :: Week number of the current year, starting with the first Monday
# as the first day of the first week (00..53)
# %w :: Day of the week (Sunday is 0, 0..6)
# %x :: Preferred representation for the date alone, no time
# %X :: Preferred representation for the time alone, no date
# %y :: Year without a century (00..99)
# %Y :: Year which may include century, if provided
# %z :: Time zone as hour offset from UTC (e.g. +0900)
# %Z :: Time zone name
# %% :: Literal "%" character
# %+ :: date(1) (%a %b %e %H:%M:%S %Z %Y)
#
# require 'time'
#
# Time.strptime("2000-10-31", "%Y-%m-%d") #=> 2000-10-31 00:00:00 -0500
#
# You must require 'time' to use this method.
#
def strptime(date, format, now=self.now)
d = Date._strptime(date, format)
raise ArgumentError, "invalid date or strptime format - `#{date}' `#{format}'" unless d
if seconds = d[:seconds]
if sec_fraction = d[:sec_fraction]
usec = sec_fraction * 1000000
usec *= -1 if seconds < 0
else
usec = 0
end
t = Time.at(seconds, usec)
if zone = d[:zone]
force_zone!(t, zone)
end
else
year = d[:year]
year = yield(year) if year && block_given?
yday = d[:yday]
if (d[:cwyear] && !year) || ((d[:cwday] || d[:cweek]) && !(d[:mon] && d[:mday]))
# make_time doesn't deal with cwyear/cwday/cweek
return Date.strptime(date, format).to_time
end
if (d[:wnum0] || d[:wnum1]) && !yday && !(d[:mon] && d[:mday])
yday = Date.strptime(date, format).yday
end
t = make_time(date, year, yday, d[:mon], d[:mday], d[:hour], d[:min], d[:sec], d[:sec_fraction], d[:zone], now)
end
t
end
MonthValue = { # :nodoc:
'JAN' => 1, 'FEB' => 2, 'MAR' => 3, 'APR' => 4, 'MAY' => 5, 'JUN' => 6,
'JUL' => 7, 'AUG' => 8, 'SEP' => 9, 'OCT' =>10, 'NOV' =>11, 'DEC' =>12
}
#
# Parses +date+ as date-time defined by RFC 2822 and converts it to a Time
# object. The format is identical to the date format defined by RFC 822 and
# updated by RFC 1123.
#
# ArgumentError is raised if +date+ is not compliant with RFC 2822
# or if the Time class cannot represent specified date.
#
# See #rfc2822 for more information on this format.
#
# require 'time'
#
# Time.rfc2822("Wed, 05 Oct 2011 22:26:12 -0400")
# #=> 2010-10-05 22:26:12 -0400
#
# You must require 'time' to use this method.
#
def rfc2822(date)
if /\A\s*
(?:(?:Mon|Tue|Wed|Thu|Fri|Sat|Sun)\s*,\s*)?
(\d{1,2})\s+
(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\s+
(\d{2,})\s+
(\d{2})\s*
:\s*(\d{2})
(?:\s*:\s*(\d\d))?\s+
([+-]\d{4}|
UT|GMT|EST|EDT|CST|CDT|MST|MDT|PST|PDT|[A-IK-Z])/ix =~ date
# Since RFC 2822 permit comments, the regexp has no right anchor.
day = $1.to_i
mon = MonthValue[$2.upcase]
year = $3.to_i
short_year_p = $3.length <= 3
hour = $4.to_i
min = $5.to_i
sec = $6 ? $6.to_i : 0
zone = $7
if short_year_p
# following year completion is compliant with RFC 2822.
year = if year < 50
2000 + year
else
1900 + year
end
end
off = zone_offset(zone)
year, mon, day, hour, min, sec =
apply_offset(year, mon, day, hour, min, sec, off)
t = self.utc(year, mon, day, hour, min, sec)
force_zone!(t, zone, off)
t
else
raise ArgumentError.new("not RFC 2822 compliant date: #{date.inspect}")
end
end
alias rfc822 rfc2822
#
# Parses +date+ as an HTTP-date defined by RFC 2616 and converts it to a
# Time object.
#
# ArgumentError is raised if +date+ is not compliant with RFC 2616 or if
# the Time class cannot represent specified date.
#
# See #httpdate for more information on this format.
#
# require 'time'
#
# Time.httpdate("Thu, 06 Oct 2011 02:26:12 GMT")
# #=> 2011-10-06 02:26:12 UTC
#
# You must require 'time' to use this method.
#
def httpdate(date)
if date.match?(/\A\s*
(?:Mon|Tue|Wed|Thu|Fri|Sat|Sun),\x20
(\d{2})\x20
(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\x20
(\d{4})\x20
(\d{2}):(\d{2}):(\d{2})\x20
GMT
\s*\z/ix)
self.rfc2822(date).utc
elsif /\A\s*
(?:Monday|Tuesday|Wednesday|Thursday|Friday|Saturday|Sunday),\x20
(\d\d)-(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)-(\d\d)\x20
(\d\d):(\d\d):(\d\d)\x20
GMT
\s*\z/ix =~ date
year = $3.to_i
if year < 50
year += 2000
else
year += 1900
end
self.utc(year, $2, $1.to_i, $4.to_i, $5.to_i, $6.to_i)
elsif /\A\s*
(?:Mon|Tue|Wed|Thu|Fri|Sat|Sun)\x20
(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\x20
(\d\d|\x20\d)\x20
(\d\d):(\d\d):(\d\d)\x20
(\d{4})
\s*\z/ix =~ date
self.utc($6.to_i, MonthValue[$1.upcase], $2.to_i,
$3.to_i, $4.to_i, $5.to_i)
else
raise ArgumentError.new("not RFC 2616 compliant date: #{date.inspect}")
end
end
#
# Parses +time+ as a dateTime defined by the XML Schema and converts it to
# a Time object. The format is a restricted version of the format defined
# by ISO 8601.
#
# ArgumentError is raised if +time+ is not compliant with the format or if
# the Time class cannot represent the specified time.
#
# See #xmlschema for more information on this format.
#
# require 'time'
#
# Time.xmlschema("2011-10-05T22:26:12-04:00")
# #=> 2011-10-05 22:26:12-04:00
#
# You must require 'time' to use this method.
#
def xmlschema(time)
if /\A\s*
(-?\d+)-(\d\d)-(\d\d)
T
(\d\d):(\d\d):(\d\d)
(\.\d+)?
(Z|[+-]\d\d(?::?\d\d)?)?
\s*\z/ix =~ time
year = $1.to_i
mon = $2.to_i
day = $3.to_i
hour = $4.to_i
min = $5.to_i
sec = $6.to_i
usec = 0
if $7
usec = Rational($7) * 1000000
end
if $8
zone = $8
off = zone_offset(zone)
year, mon, day, hour, min, sec =
apply_offset(year, mon, day, hour, min, sec, off)
t = self.utc(year, mon, day, hour, min, sec, usec)
force_zone!(t, zone, off)
t
else
self.local(year, mon, day, hour, min, sec, usec)
end
else
raise ArgumentError.new("invalid xmlschema format: #{time.inspect}")
end
end
alias iso8601 xmlschema
end # class << self
#
# Returns a string which represents the time as date-time defined by RFC 2822:
#
# day-of-week, DD month-name CCYY hh:mm:ss zone
#
# where zone is [+-]hhmm.
#
# If +self+ is a UTC time, -0000 is used as zone.
#
# require 'time'
#
# t = Time.now
# t.rfc2822 # => "Wed, 05 Oct 2011 22:26:12 -0400"
#
# You must require 'time' to use this method.
#
def rfc2822
strftime('%a, %d %b %Y %T ') << (utc? ? '-0000' : strftime('%z'))
end
alias rfc822 rfc2822
#
# Returns a string which represents the time as RFC 1123 date of HTTP-date
# defined by RFC 2616:
#
# day-of-week, DD month-name CCYY hh:mm:ss GMT
#
# Note that the result is always UTC (GMT).
#
# require 'time'
#
# t = Time.now
# t.httpdate # => "Thu, 06 Oct 2011 02:26:12 GMT"
#
# You must require 'time' to use this method.
#
def httpdate
getutc.strftime('%a, %d %b %Y %T GMT')
end
#
# Returns a string which represents the time as a dateTime defined by XML
# Schema:
#
# CCYY-MM-DDThh:mm:ssTZD
# CCYY-MM-DDThh:mm:ss.sssTZD
#
# where TZD is Z or [+-]hh:mm.
#
# If self is a UTC time, Z is used as TZD. [+-]hh:mm is used otherwise.
#
# +fraction_digits+ specifies a number of digits to use for fractional
# seconds. Its default value is 0.
#
# require 'time'
#
# t = Time.now
# t.iso8601 # => "2011-10-05T22:26:12-04:00"
#
# You must require 'time' to use this method.
#
def xmlschema(fraction_digits=0)
fraction_digits = fraction_digits.to_i
s = strftime("%FT%T")
if fraction_digits > 0
s << strftime(".%#{fraction_digits}N")
end
s << (utc? ? 'Z' : strftime("%:z"))
end
alias iso8601 xmlschema
end
```
|
```java
package com.airbnb.epoxy;
import androidx.annotation.LayoutRes;
import androidx.annotation.Nullable;
import java.lang.CharSequence;
import java.lang.Number;
import java.lang.Object;
import java.lang.Override;
import java.lang.String;
/**
* Generated file. Do not modify!
*/
public class ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ extends ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName implements GeneratedModel<Object>, ModelWithPrivateFieldWithSameAsFieldGetterAndSetterNameBuilder {
private OnModelBoundListener<ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_, Object> onModelBoundListener_epoxyGeneratedModel;
private OnModelUnboundListener<ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_, Object> onModelUnboundListener_epoxyGeneratedModel;
private OnModelVisibilityStateChangedListener<ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_, Object> onModelVisibilityStateChangedListener_epoxyGeneratedModel;
private OnModelVisibilityChangedListener<ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_, Object> onModelVisibilityChangedListener_epoxyGeneratedModel;
public ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_() {
super();
}
@Override
public void addTo(EpoxyController controller) {
super.addTo(controller);
addWithDebugValidation(controller);
}
@Override
public void handlePreBind(final EpoxyViewHolder holder, final Object object, final int position) {
validateStateHasNotChangedSinceAdded("The model was changed between being added to the controller and being bound.", position);
}
@Override
public void handlePostBind(final Object object, int position) {
if (onModelBoundListener_epoxyGeneratedModel != null) {
onModelBoundListener_epoxyGeneratedModel.onModelBound(this, object, position);
}
validateStateHasNotChangedSinceAdded("The model was changed during the bind call.", position);
}
/**
* Register a listener that will be called when this model is bound to a view.
* <p>
* The listener will contribute to this model's hashCode state per the {@link
* com.airbnb.epoxy.EpoxyAttribute.Option#DoNotHash} rules.
* <p>
* You may clear the listener by setting a null value, or by calling {@link #reset()}
*/
public ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ onBind(
OnModelBoundListener<ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_, Object> listener) {
onMutation();
this.onModelBoundListener_epoxyGeneratedModel = listener;
return this;
}
@Override
public void unbind(Object object) {
super.unbind(object);
if (onModelUnboundListener_epoxyGeneratedModel != null) {
onModelUnboundListener_epoxyGeneratedModel.onModelUnbound(this, object);
}
}
/**
* Register a listener that will be called when this model is unbound from a view.
* <p>
* The listener will contribute to this model's hashCode state per the {@link
* com.airbnb.epoxy.EpoxyAttribute.Option#DoNotHash} rules.
* <p>
* You may clear the listener by setting a null value, or by calling {@link #reset()}
*/
public ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ onUnbind(
OnModelUnboundListener<ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_, Object> listener) {
onMutation();
this.onModelUnboundListener_epoxyGeneratedModel = listener;
return this;
}
@Override
public void onVisibilityStateChanged(int visibilityState, final Object object) {
if (onModelVisibilityStateChangedListener_epoxyGeneratedModel != null) {
onModelVisibilityStateChangedListener_epoxyGeneratedModel.onVisibilityStateChanged(this, object, visibilityState);
}
super.onVisibilityStateChanged(visibilityState, object);
}
/**
* Register a listener that will be called when this model visibility state has changed.
* <p>
* The listener will contribute to this model's hashCode state per the {@link
* com.airbnb.epoxy.EpoxyAttribute.Option#DoNotHash} rules.
*/
public ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ onVisibilityStateChanged(
OnModelVisibilityStateChangedListener<ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_, Object> listener) {
onMutation();
this.onModelVisibilityStateChangedListener_epoxyGeneratedModel = listener;
return this;
}
@Override
public void onVisibilityChanged(float percentVisibleHeight, float percentVisibleWidth,
int visibleHeight, int visibleWidth, final Object object) {
if (onModelVisibilityChangedListener_epoxyGeneratedModel != null) {
onModelVisibilityChangedListener_epoxyGeneratedModel.onVisibilityChanged(this, object, percentVisibleHeight, percentVisibleWidth, visibleHeight, visibleWidth);
}
super.onVisibilityChanged(percentVisibleHeight, percentVisibleWidth, visibleHeight, visibleWidth, object);
}
/**
* Register a listener that will be called when this model visibility has changed.
* <p>
* The listener will contribute to this model's hashCode state per the {@link
* com.airbnb.epoxy.EpoxyAttribute.Option#DoNotHash} rules.
*/
public ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ onVisibilityChanged(
OnModelVisibilityChangedListener<ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_, Object> listener) {
onMutation();
this.onModelVisibilityChangedListener_epoxyGeneratedModel = listener;
return this;
}
public ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ isValue(boolean isValue) {
onMutation();
super.setValue(isValue);
return this;
}
public boolean isValue() {
return super.isValue();
}
@Override
public ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ id(long id) {
super.id(id);
return this;
}
@Override
public ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ id(@Nullable Number... ids) {
super.id(ids);
return this;
}
@Override
public ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ id(long id1, long id2) {
super.id(id1, id2);
return this;
}
@Override
public ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ id(@Nullable CharSequence key) {
super.id(key);
return this;
}
@Override
public ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ id(@Nullable CharSequence key,
@Nullable CharSequence... otherKeys) {
super.id(key, otherKeys);
return this;
}
@Override
public ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ id(@Nullable CharSequence key,
long id) {
super.id(key, id);
return this;
}
@Override
public ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ layout(@LayoutRes int layoutRes) {
super.layout(layoutRes);
return this;
}
@Override
public ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ spanSizeOverride(
@Nullable EpoxyModel.SpanSizeOverrideCallback spanSizeCallback) {
super.spanSizeOverride(spanSizeCallback);
return this;
}
@Override
public ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ show() {
super.show();
return this;
}
@Override
public ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ show(boolean show) {
super.show(show);
return this;
}
@Override
public ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ hide() {
super.hide();
return this;
}
@Override
public ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ reset() {
onModelBoundListener_epoxyGeneratedModel = null;
onModelUnboundListener_epoxyGeneratedModel = null;
onModelVisibilityStateChangedListener_epoxyGeneratedModel = null;
onModelVisibilityChangedListener_epoxyGeneratedModel = null;
super.setValue(false);
super.reset();
return this;
}
@Override
public boolean equals(Object o) {
if (o == this) {
return true;
}
if (!(o instanceof ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_)) {
return false;
}
if (!super.equals(o)) {
return false;
}
ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_ that = (ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_) o;
if (((onModelBoundListener_epoxyGeneratedModel == null) != (that.onModelBoundListener_epoxyGeneratedModel == null))) {
return false;
}
if (((onModelUnboundListener_epoxyGeneratedModel == null) != (that.onModelUnboundListener_epoxyGeneratedModel == null))) {
return false;
}
if (((onModelVisibilityStateChangedListener_epoxyGeneratedModel == null) != (that.onModelVisibilityStateChangedListener_epoxyGeneratedModel == null))) {
return false;
}
if (((onModelVisibilityChangedListener_epoxyGeneratedModel == null) != (that.onModelVisibilityChangedListener_epoxyGeneratedModel == null))) {
return false;
}
if ((isValue() != that.isValue())) {
return false;
}
return true;
}
@Override
public int hashCode() {
int _result = super.hashCode();
_result = 31 * _result + (onModelBoundListener_epoxyGeneratedModel != null ? 1 : 0);
_result = 31 * _result + (onModelUnboundListener_epoxyGeneratedModel != null ? 1 : 0);
_result = 31 * _result + (onModelVisibilityStateChangedListener_epoxyGeneratedModel != null ? 1 : 0);
_result = 31 * _result + (onModelVisibilityChangedListener_epoxyGeneratedModel != null ? 1 : 0);
_result = 31 * _result + (isValue() ? 1 : 0);
return _result;
}
@Override
public String toString() {
return "ModelWithPrivateFieldWithSameAsFieldGetterAndSetterName_{" +
"isValue=" + isValue() +
"}" + super.toString();
}
}
```
|
Qal'eh Dokhtar () is a historical castle located in Bardaskan County in Razavi Khorasan Province, The longevity of this fortress dates back to the 6th to 8th centuries AH.
References
Castles in Iran
|
Passport to Nowhere is a 1947 American short documentary film produced by Frederic Ullman Jr. as part of RKO Pictures' documentary series This Is America. Its subject was European refugees after World War II. It was nominated for an Academy Award for Best Documentary Short.
References
External links
1947 films
1940s short documentary films
1947 documentary films
American short documentary films
American black-and-white films
Black-and-white documentary films
RKO Pictures short films
1940s English-language films
1940s American films
|
Gétye is a village in Zala County, Hungary.
References
Populated places in Zala County
|
Lavender () is a 1953 Austrian-German comedy film directed by Arthur Maria Rabenalt and starring Gretl Schörg, Karl Schönböck, and Hans Holt. It was made at the Schönbrunn Studios in Vienna. The film's sets were designed by the art director Felix Smetana.
Cast
References
External links
1953 comedy films
Austrian comedy films
German comedy films
West German films
Films directed by Arthur Maria Rabenalt
Adultery in films
Films shot at Schönbrunn Studios
Austrian black-and-white films
German black-and-white films
1950s German films
|
Berlin is a town in Cullman County, Alabama, United States. It is located roughly five miles east of the city of Cullman in northern Alabama. U.S. Route 278 and Cullman County Road 747 intersect at Walker's Corner, considered to be the center of Berlin. The Berlin Community Center is located on U.S. Route 278, just west of the crossroads.
History
The town was originally known as Hobart, possibly named after Garret Hobart, a New Jersey Congressman who served as vice-president under William McKinley. A post office was established in the town in 1895, but was closed in 1903. The name was changed circa 1914 to honor the capital of Germany, the former homeland of many of the town's ethnic German residents. The new name was selected by John (Kritner) Kreitner. The town was incorporated in 2018.
The historic Lidy Walker Covered Bridge was located just north of Berlin at the farm of Winford I. "Lidy" Walker on Lidy's Lake from 1958 until its collapse in 2001. Originally called the Big Branch Covered Bridge, it was built near Blountsville in Blount County in 1926 and moved to Berlin 32 years later.
Residents of Berlin voted 45-23 to incorporate in 2018.
Geography
Demographics
Education
Berlin is in the Cullman County School District.
References
Footnotes
Sources
Dale J. Travis, Covered Bridges. Lidy Walker CB: Credits. Retrieved May 19, 2013.
Towns in Alabama
Towns in Cullman County, Alabama
Populated places established in 2018
|
```html
<!DOCTYPE html>
<html lang="en-US">
<head>
<meta charset="utf-8" />
<meta name="viewport" content="width=device-width" />
<title>Fetch polyfill example</title>
<link rel="stylesheet" href="" />
</head>
<body>
<h1>Fetch basic example</h1>
<img src="" class="my-image" alt="A flower" />
<!-- Minified version of `es6-promise-auto` below. -->
<script src="path_to_url"></script>
<script src="path_to_url"></script>
<script src="fetch.js"></script>
<script>
var myImage = document.querySelector(".my-image");
fetch("flowers.jpg").then(function (response) {
response.blob().then(function (myBlob) {
var objectURL = URL.createObjectURL(myBlob);
myImage.src = objectURL;
});
});
</script>
</body>
</html>
```
|
Dillsburg is a borough in York County, Pennsylvania, United States. The population was 2,643 as of the 2020 census.
Geography
Dillsburg is surrounded by Carroll Township in northwestern York County. According to the United States Census Bureau, the borough has a total area of , all land.
History
The town is named for Matthew Dill, an immigrant from County Monaghan, Ireland, who settled the town in 1740. The village became a center for local agriculture.
During the Civil War's Gettysburg Campaign, Dillsburg was twice invaded by Confederate cavalry, first by Albert G. Jenkins's brigade, then by Maj. Gen. J.E.B. Stuart's division.
Dill's Tavern, founded in the 1750s with a current building constructed between 1794 and 1819, and the Rev. Anderson B. Quay House are listed on the National Register of Historic Places.
Demographics
As of the census of 2000, there were 2,063 people, 902 households, and 579 families living in the borough. The population density was . There were 936 housing units at an average density of . The racial makeup of the borough was 97.19% White, 0.48% African American, 0.44% Native American, 1.21% Asian, and 0.68% from two or more races. Hispanic or Latino of any race were 0.29% of the population.
There were 902 households, out of which 30.3% had children under the age of 18 living with them, 50.1% were married couples living together, 10.8% had a female householder with no husband present, and 35.7% were non-families. 31.8% of all households were made up of individuals, and 14.7% had someone living alone who was 65 years of age or older. The average household size was 2.29 and the average family size was 2.89.
In the borough, the population was spread out, with 24.6% under the age of 18, 7.6% from 18 to 24, 31.2% from 25 to 44, 22.2% from 45 to 64, and 14.5% who were 65 years of age or older. The median age was 37 years. For every 100 females there were 87.2 males. For every 100 females age 18 and over, there were 81.2 males.
The median income for a household in the borough was $37,530, and the median income for a family was $46,797. Males had a median income of $42,235 versus $21,995 for females. The per capita income for the borough was $19,801. About 7.5% of families and 6.3% of the population were below the poverty line, including 9.6% of those under age 18 and 6.4% of those age 65 or over.
Town festivals
Dillsburg's Farmers Fair celebration is held annually during the third weekend in October. Among the many attractions are the parades on Friday and Saturday evenings, the classic car and farm tractor parade Saturday afternoon, and Civil War reenactments at the nearby Dill's Tavern. A wide variety of food can be found, from common concessions to specialty theme items such as fried pickles and pickle soup.
Dillsburg drops a larger-than-life pickle on New Year's Eve in an event called the "Pickle Drop".
District schools
Northern York County School District
Dillsburg Elementary School
Northern Elementary School
South Mountain Elementary School
Wellsville Elementary School
Northern Middle School
Northern High School
Notable people
David A. Day (1851-1897), Lutheran missionary
Daniel J. Dill (1830-1917), Wisconsin State Assemblyman
Danny DiPrima (born 1991), Professional soccer player
Cody Eppley (born 1985), Professional baseball player
Dawn Keefer (born 1972), Member of the Pennsylvania House of Representatives
Chris Kilmore (born 1973), Keyboardist for the rock band Incubus
Henry Logan (1784-1866), Member of the U.S. House of Representatives from Pennsylvania
Matthew Quay (1833-1904), U.S. Senator from Pennsylvania
References
External links
Borough of Dillsburg official website
Populated places established in 1740
Boroughs in York County, Pennsylvania
1740 establishments in Pennsylvania
1833 establishments in Pennsylvania
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.