text
stringlengths 0
1.59M
| meta
dict |
|---|---|
Q:
MKOverlay update flashing
In my app, I use an MKPolyline to track the user's path. Sometimes (and not all the time, which I don't understand), when a new line segment gets added to the map, the entire line flashes. Sometimes it doesn't. This is the code being used to add the lines:
CLLocationCoordinate2D coords[2];
coords[0] = CLLocationCoordinate2DMake(newLocation.coordinate.latitude, newLocation.coordinate.longitude);
coords[1] = CLLocationCoordinate2DMake(oldLocation.coordinate.latitude, oldLocation.coordinate.longitude);
MKPolyline* line = [MKPolyline polylineWithCoordinates:coords count:2];
[mapView addOverlay:line];
Am I missing something?
Edit: This usually happens upon the app's return from being sent to the background. I'm not exactly sure why, though, because I am only adding an overlay, not modifying the entire mapView.overlays array. ...right?
A:
This may not be related, but Apple does state in the Managing the Map's Overlay Objects section of the Location Awareness Programming Guide...
Because the map view is an interface item, any modifications to the
overlays array should be synchronized and performed on the
application’s main thread.
| {
"pile_set_name": "StackExchange"
} |
Conventionally, inks comprise colorants such as pigment or dye compounds. Pigment based inks, for example, are typically prepared by dispersing pigment agglomerates, formed when individual pigment particles cluster together, in a dispersant. The size of the pigment agglomerates may be reduced by grinding the pigment dispersion using conventional grinding media such as glass, stainless steel, or zirconium oxide.
When preparing pigment dispersions for use in ink-jet inks, for example, conventional grinding media have been found to be unacceptable because they either alter (usually by increasing) the pH of the dispersion to an unacceptable level or result in contamination of the dispersion. An unacceptably high pH can result in inks having incompatibility with ink processing and printing equipment. Contamination can result in, for example, discoloration of inks prepared from the above-described pigment dispersions.
This invention is based on the discovery that plastic media for grinding colorant dispersions, while satisfactorily reducing the colorant agglomerate size in the pigment dispersion, do not unacceptably alter the pH or unduly contaminate the dispersion. Moreover, using plastic media, as described herein, unexpectedly results in an ink composition having a superior color gamut. | {
"pile_set_name": "USPTO Backgrounds"
} |
{% extends "base.html" %}
{% block title %}{{ SITENAME }} - Authors{% endblock %}
{% block content %}
<h1>Authors on {{ SITENAME }}</h1>
<ul>
{%- for author, articles in authors|sort %}
<li><a href="{{ SITEURL }}/{{ author.url }}">{{ author }}</a> ({{ articles|count }})</li>
{% endfor %}
</ul>
{% endblock %}
| {
"pile_set_name": "Github"
} |
190 P.3d 54 (2008)
DOLBY
v.
WORTHY.
No. 81025-7.
Supreme Court of Washington, Special Department.
August 5, 2008.
Disposition of petition for review. Denied.
| {
"pile_set_name": "FreeLaw"
} |
Imelda Wiguno
Imelda Wiguna (also known as Imelda Wigoena, , born 12 October 1951) is a former badminton player from Indonesia who played at the world class level from the mid-1970s through the mid-1980s.
Career
A doubles specialist, Wiguna's two most impressive years in badminton were 1979 and 1980. In 1979 she won both doubles events, women's doubles with Verawaty Wiharjo and mixed doubles with Christian Hadinata, at the prestigious All-England Championships. The following year she reached the final of both events at the then triennial IBF World Championships in Jakarta, losing the women's doubles with Verawaty but winning the mixed doubles with Christian. Thereafter, though Wiguna continued to play at a high level, the demands of motherhood and strong competition from Chinese Mainland players made winning the biggest tournaments more difficult. Her other titles included women's doubles at the Asian Games (1978), the Danish Open (1978), the Canadian Open (1979), and the Southeast Asian Games (1979, 1985); and mixed doubles at the Canadian Open (1979), and the Southeast Asian Games (1979, 1981, 1985).
Wiguna played in five consecutive Uber Cup (women's international team) competitions for Indonesia between 1974 and 1986. She helped her nation to capture its first world title (over Japan) in 1975, and to reach the final round in 1978, 1981, and 1986.
Achievements
Women's doubles
Mix's doubles
References
Category:1951 births
Category:Living people
Category:Indonesian female badminton players
Category:Indonesian Christians
Category:Asian Games medalists in badminton
Category:Badminton players at the 1974 Asian Games
Category:Badminton players at the 1978 Asian Games
Category:Badminton players at the 1986 Asian Games
Category:World Games bronze medalists
Category:Competitors at the 1981 World Games
Category:Asian Games gold medalists for Indonesia
Category:Asian Games silver medalists for Indonesia
Category:Asian Games bronze medalists for Indonesia
Category:Southeast Asian Games gold medalists for Indonesia
Category:Southeast Asian Games medalists in badminton
Category:Medalists at the 1974 Asian Games
Category:Medalists at the 1978 Asian Games
Category:Medalists at the 1986 Asian Games
Category:Competitors at the 1979 Southeast Asian Games
Category:Competitors at the 1981 Southeast Asian Games
Category:Competitors at the 1985 Southeast Asian Games | {
"pile_set_name": "Wikipedia (en)"
} |
Interdisciplinary treatment of abused families in Kentucky.
The recognition and management of child sexual abuse has gained increased attention by primary care physicians. Examined are the results of a 3-year interdisciplinary clinical treatment program and clinical data which enhance the primary care physician's assessment and management of child sexual abuse. Specific criteria used in diagnosis and strategies for abuse are explored. Psychological factors involved in the adaptation process and long-term impact on the child and family are discussed. | {
"pile_set_name": "PubMed Abstracts"
} |
Q:
Symfony2 Form Mapping Issue
Im having issues with data mapping to an entity after it is submitted
The Entity:
<?php
namespace Site\UserBundle\Entity;
use Doctrine\ORM\Mapping as ORM;
use Doctrine\ORM\EntityManager;
use JMS\Serializer\Annotation as Serializer;
use JMS\Serializer\Annotation\Groups;
use Symfony\Component\Security\Core\User\AdvancedUserInterface;
use Symfony\Component\Validator\Constraints as Assert;
use Doctrine\Common\Collections\ArrayCollection;
/**
* UserAddress
*
* @ORM\Table(name="user_address")
* @ORM\Entity
*
* @Serializer\ExclusionPolicy("all")
* ---------- SERIALIZER GROUPS -----
* all -- All entries
*/
class UserAddress
{
/**
* @var integer
*
* @ORM\Column(name="id", type="integer")
* @ORM\Id
* @ORM\GeneratedValue(strategy="IDENTITY")
*
* @Serializer\Type("integer")
* @Serializer\Expose
* @serializer\SerializedName("ID")
* @serializer\Groups({"all"})
*/
public $ID;
/**
* @var integer
*
* @ORM\Column(name="user_id", type="integer", nullable=false)
*/
public $UserId;
/**
* @var integer
*
* @ORM\Column(name="level_id", type="integer", nullable=false)
*
* @Serializer\Type("integer")
* @Serializer\Expose
* @serializer\SerializedName("LevelId")
* @serializer\Groups({"all"})
*/
public $LevelId;
/**
* @var integer
*
* @ORM\Column(name="address_type_id", type="integer", nullable=false)
*
* @Serializer\Type("integer")
* @Serializer\Expose
* @serializer\SerializedName("AddressTypeId")
* @serializer\Groups({"all"})
*
* @Assert\NotBlank()
*/
public $AddressTypeId;
/**
* @var string
*
* @ORM\Column(name="address_data", type="text", nullable=false)
*
* @Serializer\Type("string")
* @Serializer\Expose
* @serializer\SerializedName("Address Data")
* @serializer\Groups({"all"})
*
* @Assert\NotBlank()
*/
public $AddressData;
/**
* @var integer
*
* @ORM\Column(name="public_yn", type="integer", nullable=false)
*
* @Serializer\Type("boolean")
* @Serializer\Expose
* @serializer\SerializedName("PublicYN")
* @serializer\Groups({"all"})
*
* @Assert\NotBlank()
*/
public $PublicYN;
/**
* @var integer
*
* @ORM\Column(name="primary_yn", type="integer", nullable=false)
*
* @Serializer\Type("boolean")
* @Serializer\Expose
* @serializer\SerializedName("PrimaryYN")
* @serializer\Groups({"all"})
*
* @Assert\NotBlank()
*/
public $PrimaryYN;
/**
* @ORM\ManyToOne(targetEntity="Site\UserBundle\Entity\UserMain", inversedBy="UserAddress")
* @ORM\JoinColumn(name="user_id", referencedColumnName="user_id")
*/
public $User;
/**
* @ORM\ManyToOne(targetEntity="Site\UserBundle\Entity\UserAddressType", inversedBy="UserAddress")
* @ORM\JoinColumn(name="address_type_id", referencedColumnName="address_type_id")
*
* @Serializer\Type("Site\UserBundle\Entity\UserAddressType")
* @Serializer\Expose
* @serializer\SerializedName("UserAddressType")
* @serializer\Groups({"all"})
*/
public $UserAddressType;
/**
* Get ID
*
* @return integer
*/
public function getID()
{
return $this->ID;
}
/**
* Set UserId
*
* @param integer $userId
* @return UserAddress
*/
public function setUserId($userId)
{
$this->UserId = $userId;
return $this;
}
/**
* Get UserId
*
* @return integer
*/
public function getUserId()
{
return $this->UserId;
}
/**
* Set LevelId
*
* @param integer $levelId
* @return UserAddress
*/
public function setLevelId($levelId)
{
$this->LevelId = $levelId;
return $this;
}
/**
* Get LevelId
*
* @return integer
*/
public function getLevelId()
{
return $this->LevelId;
}
/**
* Set AddressTypeId
*
* @param integer $addressTypeId
* @return UserAddress
*/
public function setAddressTypeId($addressTypeId)
{
$this->AddressTypeId = $addressTypeId;
return $this;
}
/**
* Get AddressTypeId
*
* @return integer
*/
public function getAddressTypeId()
{
return $this->AddressTypeId;
}
/**
* Set AddressData
*
* @param string $addressData
* @return UserAddress
*/
public function setAddressData($addressData)
{
$this->AddressData = $addressData;
return $this;
}
/**
* Get AddressData
*
* @return string
*/
public function getAddressData()
{
return $this->AddressData;
}
/**
* Set PublicYN
*
* @param integer $publicYN
* @return UserAddress
*/
public function setPublicYN($publicYN)
{
$this->PublicYN = $publicYN;
return $this;
}
/**
* Get PublicYN
*
* @return integer
*/
public function getPublicYN()
{
return $this->PublicYN;
}
/**
* Set PrimaryYN
*
* @param integer $primaryYN
* @return UserAddress
*/
public function setPrimaryYN($primaryYN)
{
$this->PrimaryYN = $primaryYN;
return $this;
}
/**
* Get PrimaryYN
*
* @return integer
*/
public function getPrimaryYN()
{
return $this->PrimaryYN;
}
/**
* Set User
*
* @param \Site\UserBundle\Entity\UserMain $user
* @return UserAddress
*/
public function setUser(\Site\UserBundle\Entity\UserMain $user = null)
{
$this->User = $user;
return $this;
}
/**
* Get User
*
* @return \Site\UserBundle\Entity\UserMain
*/
public function getUser()
{
return $this->User;
}
/**
* Set UserAddressType
*
* @param \Site\UserBundle\Entity\UserAddressType $userAddressType
* @return UserAddress
*/
public function setUserAddressType(\Site\UserBundle\Entity\UserAddressType $userAddressType = null)
{
$this->UserAddressType = $userAddressType;
return $this;
}
/**
* Get UserAddressType
*
* @return \Site\UserBundle\Entity\UserAddressType
*/
public function getUserAddressType()
{
return $this->UserAddressType;
}
}
The form is:
namespace Site\UserBundle\Form;
use Symfony\Component\Form\AbstractType;
use Symfony\Component\Form\FormBuilderInterface;
use Symfony\Component\OptionsResolver\OptionsResolverInterface;
use Doctrine\ORM\EntityRepository;
class UserAddressType extends AbstractType
{
/**
* @param FormBuilderInterface $builder
* @param array $options
*/
public function buildForm(FormBuilderInterface $builder, array $options)
{
$builder
->add('UserId','hidden')
->add('LevelId', 'integer', array(
'label'=>'Sort Rate (Order)'
))
->add('AddressTypeId', 'entity', array(
'class'=>'SiteUserBundle:UserAddressType',
'query_builder'=> function(EntityRepository $er){
return $er->createQueryBuilder('t')
->orderBy('t.AddressDescription', 'ASC');
},
'property'=>'AddressDescription',
'label'=>'Address Type'
))
->add('AddressData', 'text')
->add('PublicYN', 'choice', array(
'choices' => array( 'false'=>'Private', 'true'=>'Public'),
'required'=>true,
'label'=>'Pubicly Visable'
))
->add('PrimaryYN', 'choice', array(
'choices' => array( 'false'=>'Secondary', 'true'=>'Primary'),
'required'=>true,
'label'=>'Primary Contact',
))
->add('save', 'submit', array(
'label'=>'Add Address',
'attr'=>array(
'class'=>'btn btn-primary',
),
))
;
}
/**
* @param OptionsResolverInterface $resolver
*/
public function setDefaultOptions(OptionsResolverInterface $resolver)
{
$resolver->setDefaults(array(
'data_class' => 'Site\UserBundle\Entity\UserAddress',
'csrf_protection'=>false,
));
}
/**
* @return string
*/
public function getName()
{
return 'Create_User_Address';
}
}
Controller Function is: (I'm using fosrestbundle)
public function newAddressAction($userid, Request $request)
{
$statusCode = 201;
$address = new UserAddress();
$address->setUserId($userid);
$form = $this->createForm( new UserAddressType(), $address, array(
'method'=>'GET',
));
$form->handleRequest($request);
if($form->isValid()){
$em = $this->getDoctrine()->getManager();
$em->persist($address);
$em->flush();
return new Response('User Added to system');
}
return $this->render('SiteUserBundle:UserAddress:newUserAddress.html.twig', array(
'form' => $form->createView(),
));
}
The Twig template is very simple. All the data is posted correctly to the server: (Query String Parameters )
Create_User_Address[LevelId]:0
Create_User_Address[AddressTypeId]:5
Create_User_Address[AddressData]:555-555-5555
Create_User_Address[PublicYN]:false
Create_User_Address[PrimaryYN]:false
Create_User_Address[save]:
Create_User_Address[UserId]:3
but i keep getting the following error:
An exception occurred while executing 'INSERT INTO user_address (user_id, level_id, address_type_id, address_data, public_yn, primary_yn) VALUES (?, ?, ?, ?, ?, ?)' with params [null, 0, null, "555-555-5555", "false", "false"]:
SQLSTATE[23000]: Integrity constraint violation: 1048 Column 'user_id' cannot be null
As you can see the UserID and AddressTypeId fields are not mapping from the form to the Entity. I have looked over the code for all 3 pieces over and ove and for the life of me i can't see where the mismatch is happening. I did at one point change the names of those two fields in the Entity but i deleted all the getters and setters and regenerated them as well as clear the dev cache.
My hunch is there is a file somewhere in Symfony2 there is a mapping class that is wrong but i can't find it..
Thanks all
EDIT:
I tried clearing the doctrine cache as stated here: Symfony2 doctrine clear cache .
app/console doctrine:cache:clear-metadata
app/console doctrine:cache:clear-query
app/console doctrine:cache:clear-result
this resulted in the same error being generated,so the cache issue may be off the table.
EDIT:
As per Isaac's suggestion i removed ->add('UserId', 'hidden') . The form still posted with the same error message. The field is being generated correctly to the page;
<input type="hidden" id="Create_User_Address_UserId" name="Create_User_Address[UserId]" class=" form-control" value="3">
and as you can see from the Query Parameters above being posted back to the server correctly.
EDIT:
I tracked the issue down to the User and UserAddressType variables. If i remove these two variables and their getters and setters the form works perfectly without other modifications of my code. I should note that these two variables are joins to other entities. Some how they seem to be wiping out the data being submitted by the forms.
A:
As per lsouza suggestion I had to create a data transformer.
namespace Site\UserBundle\Form\DataTransformer;
use Symfony\Component\Form\DataTransformerInterface;
use Symfony\Component\Form\Exception\TransformationFailedException;
use Doctrine\Common\Persistence\ObjectManager;
use Site\UserBundle\Entity\UserAddressType;
class AddressTypeToNumber implements DataTransformerInterface
{
/**
* @var ObjectManager
*/
private $om;
/**
* @param ObjectManager $om
*/
public function __construct(ObjectManager $om)
{
$this->om = $om;
}
/**
* Transforms an object(val) to a string
*
* @param UserAddressType|null $val
* @return string
*/
public function transform($val)
{
if (null === $val) {
return "";
}
return array();
}
/**
* Transfers a string to an object (UserAddressType)
*
* @param string $val
* @return UserAddressType|null
* @throws TransformationFailedException if object is not found
*/
public function reverseTransform($val)
{
if (!$val) {
return null;
}
$addId = $this->om
->getRepository('SiteUserBundle:UserAddressType')
->findOneBy(array('AddressTypeId' => $val));
if (null === $addId) {
throw new TransformationFailedException(sprintf(
'An Address Type with the ID of "%s" does not exsist in the system',
$val
));
}
return $addId;
}
}
Please note that the Transformer function is currently returning null but this should return a value that can be used by the form.
Some other notes that may help others are that the form class needs to be changed as well.
The setDefaultOptions function needs the following added to the $resolver variable:
->setRequired(array(
'em',
))
->setAllowedTypes(array(
'em'=>'Doctrine\Common\Persistence\ObjectManager',
));
The buildForm function needs to be changed slightly to accept the em option:
public function buildForm(FormBuilderInterface $builder, array $options)
{
$em = $options['em'];
$transformer = new AddressTypeToNumber($em);
The field needs to be change to the varrable that holds the relationship in the Entity and not the field that is use in the link:
->add(
$builder->create('UserAddressType', 'entity', array(
'class' => 'SiteUserBundle:UserAddressType',
'property' => 'AddressDescription',
'label' => 'Address Type'
))
->addModelTransformer($transformer)
)
Finally in your controller you need to pass an instance of $this->getDoctrine()->getManager() to the form class:
$form = $this->createForm( new UserAddressType(), $address, array(
'em' => $this->getDoctrine()->getManager(),
));
I hope this helps others.
| {
"pile_set_name": "StackExchange"
} |
/**
* @fileoverview Tests the common tags file.
*
* @author Pete LePage <[email protected]>
*/
'use strict';
/**
* Tests and validates a commonTags.json file.
* Note: The returned promise always resolves, it will never reject.
*
* @param {string} filename The name of the file to be tested.
* @param {Object} tags The parsed contents of the tags file.
* @return {Promise} A promise with the result of the test.
*/
function test(filename, tags) {
if (Array.isArray(tags) === true) {
return Promise.resolve(true);
}
return Promise.reject({
level: 'ERROR',
filename: filename,
message: `Common tags file must be an array, was ${typeof tags}`,
});
}
exports.test = test;
| {
"pile_set_name": "Github"
} |
Q:
"How to fix 'class, interface, or enum expected' for my code
I am unable to find the solution for my code, I receive a 'class, interface, or enum expected' when trying to compile my code.
I have tried to research on how to fox the problem but I was unfortunately unable to do so as it seems like nothing is working for me...also if there are any errors that would lead up to it not working once this part is fixed, please let me know as to what I can change!
The code:
class MyDate {
//properties of date object
private int day, month, year;
//Constructor with arguments
public MyDate(int day, int month, int year) {
this.day = day;
this.month = month;
this.year = year;
}
public boolean isValidDate() {
if (month > 12 || month < 1 || day < 1) { // if negative values found
return false;
} else if (year <= 1582 && month <= 10 && day <= 15) { // starting date
// checking
return false;
} // for 31 day months
else if (month == 1 || month == 3 || month == 5 || month == 7 || month == 8 || month == 10 || month == 12) {
if (day > 31) {
return false;
}
} // for 30 day months
else if (month == 4 || month == 6 || month == 9 || month == 11) {
if (day > 30) {
return false;
}
} else if (month == 2) // February check
{
if (isLeapYear()) // Leap year check for February
{
if (day > 29) {
return false;
}
} else {
if (day > 28) {
return false;
}
}
}
return true;
}
// checks if this year is leap year
private boolean isLeapYear() {
if (year % 4 != 0) {
return false;
} else if (year % 400 == 0) {
return true;
} else if (year % 100 == 0) {
return false;
} else {
return true;
}
}
/**
* @return the day
*/
public int getDay() {
return day;
}
/**
* @param day
* the day to set
*/
public void setDay(int day) {
this.day = day;
}
/**
* @return the month
*/
public int getMonth() {
return month;
}
/**
* @param month
* the month to set
*/
public void setMonth(int month) {
this.month = month;
}
/**
* @return the year
*/
public int getYear() {
return year;
}
/**
* @param year
* the year to set
*/
public void setYear(int year) {
this.year = year;
}
@Override
public String toString() {
return day + "/" + month + "/" + year;
}
}
import java.util.Scanner;
public class MyCalendar {
//enums for days of week
public static enum Day {
SUNDAY, MONDAY, TUESDAY, WEDNESDAY, THURSDAY, FRIDAY, SATURDAY;
};
//enum for month of year
public static enum Month {
JANUARY, FEBRUARY, MARCH, APRIL, MAY, JUNE, JULY, AUGUST, SEPTEMBER,
OCTOBER, NOVEMBER, DECEMBER;
};
//enums for week numbers
public static enum Week { FIRST, SECOND, THIRD, FOURTH;
};
//to store Date object
private MyDate date;
//constructor taking mydate object
public MyCalendar(MyDate enteredDate) {
this.date = enteredDate;
}
//main method
public static void main(String[] args) {
boolean validDate = false; //valid date false
Scanner input = new Scanner(System.in); //scanner for input
MyDate enteredDate = null;
//till valid date found
while (!validDate) {
System.out.print("Enter the date as day month year : ");
//taking input and creating date object
enteredDate = new MyDate(input.nextInt(), input.nextInt(),
input.nextInt());
//validdating date object
if (enteredDate.isValidDate()) { //if valid
MyCalendar myCalendar = new MyCalendar(enteredDate); //creating
calendar object
myCalendar.printDateInfo(); //printing date info
myCalendar.printCalendar(); //printing calendar
validDate = true; //setting validate to true
} else {
System.out.println("Please enter a Valid Date...");
}
}
input.close();
}
// returns number of days in current month
private int getNumberOfDays() {
int days = 31;
int month = date.getMonth();
if (month == 4 || month == 6 || month == 9 || month == 11)
days = 30;
return days;
}
//print calendar of this month
public void printCalender() {
System.out.println("\n\nThe Calendar of "+Month.values()
[date.getMonth()-1]+" "+date.getYear()+" is :");
int numberOfMonthDays = getNumberOfDays();
Day firstWeekdayOfMonth = getDayOfWeek(1, date.getMonth(),
date.getYear());
int weekdayIndex = 0;
System.out.println("SUN MON TUE WED THU FRI SAT"); // The order of days
// depends on your
// calendar
for (int day = 0; Day.values()[day] != firstWeekdayOfMonth; day++) {
System.out.print(" "); // this loop to print the first day in
his
// correct place
weekdayIndex++;
}
for (int day = 1; day <= numberOfMonthDays; day++) {
if (day < 10)
System.out.print(day + " ");
else
System.out.print(day);
weekdayIndex++;
if (weekdayIndex == 7) {
weekdayIndex = 0;
System.out.println();
} else {
System.out.print(" ");
}
}
System.out.println();
}
//method to print about date information in literal form
public void printDateInfo() {
System.out.println(date + " is a " + getDayOfWeek(date.getDay(),
date.getMonth(), date.getYear())
+ " located in the " + Week.values()[getWeekOfMonth() - 1] + "
week of "
+ Month.values()[date.getMonth() - 1] + " " + date.getYear());
}
/*
* gets day of the week, returns enum type Day
*
* day of week (h) = (q+(13*(m+1)/5)+K+(K/4)+(J/4)+5J)%7 ,q- day of month,
* m- month, k = year of century (year%100), J = (year/100)
*/
public Day getDayOfWeek(int day, int month, int year) {
int q = day;
int m = month;
if (m < 3) {
m = 12 + date.getMonth();
year = year - 1;
}
int K = year % 100;
int J = year / 100;
//calculating h value
int h = (q + (13 * (m + 1) / 5) + K + (K / 4) + (J / 4) + 5 * J) % 7;
Day output = null;
if (h < Day.values().length && h >= 0) {
output = Day.values()[h - 1]; //getting respective enum value
}
return output; //returning enum value
}
// get week number of current date
public int getWeekOfMonth() {
int days = date.getDay();
int weeks = days / 7;
days = days % 7;
if (days > 0)
weeks++;
return weeks;
}
}
The error:
MyCalendar.java:120: class, interface, or enum expected
import java.util.Scanner;
^
Error given when I move the import to the top (UPDATED):
MyCalendar.java:164: cannot find symbol
symbol : method printCalendar()
location: class MyCalendar
myCalendar.printCalendar(); //printing calendar
Expected code:
java MyCalendar 29/02/2019
29/02/2019 in not a valid date, please re-input a valid date: 25/05/2019
25/05/2019 is a Saturday and located in the fourth week of May 2019
The calendar of May 2019 is:
SUN MON TUE WED THU FRI SAT
1 2 3 4
5 6 7 8 9 10 11
12 13 14 15 16 17 18
19 20 21 22 23 24 25
26 27 28 29 30 31
A:
the method public void printCalender() should be called or invoked as printCalender() not as printCalendar()
your method is printCalender() whereas you are calling printCalendar() which does not exist.
| {
"pile_set_name": "StackExchange"
} |
Designers
Designers have an extraordinary gift that allows them to see what no-one else can, above and beyond a simple range of colours. Silestone offers you more than 90 colours with infinite possibilities in terms of design, finish, edges and endless shapes, to add inimitable artistic value to your project.
Technical documentation
Download all the technical documentation you need to execute your project and find out about the benefits that Silestone offers in comparison with other construction materials. | {
"pile_set_name": "Pile-CC"
} |
Apheloria montana
Apheloria montana is a species of flat-backed millipede in the family Xystodesmidae. It is found in North America.
References
Further reading
Category:Polydesmida
Category:Articles created by Qbugbot
Category:Animals described in 1887 | {
"pile_set_name": "Wikipedia (en)"
} |
#include <libjrpc/jrpc.h>
struct jrpc_mapper *a6o_get_rpcbe_mapper(void);
| {
"pile_set_name": "Github"
} |
817 F.2d 1047
55 USLW 2617, 16 Collier Bankr.Cas.2d 934
In re DIAZ CONTRACTING, INC., A New Jersey Corporation (Debtor).DIAZ CONTRACTING, INC., A New Jersey Corporationv.NANCO CONTRACTING CORP., A New York Corporation; Quickway,Inc., A Pennsylvania Corporation.Appeal of NANCO CONTRACTING CORP.
No. 86-5198.
United States Court of Appeals,Third Circuit.
Argued Dec. 15, 1986.Decided April 30, 1987.As Amended May 12, 1987.
Michael A. Mulqueen, (argued), Ross and Cohen, New York City, for appellant.
Joseph Lubertazzi, Jr. (argued), Richard W. Hill, McCarter and English, Newark, N.J., for appellee.
Before HIGGINBOTHAM and BECKER, Circuit Judges, and DUMBAULD, District Judge.*
OPINION OF THE COURT
A. LEON HIGGINBOTHAM, JR., Circuit Judge.
1
This action began as an adversary proceeding before the United States Bankruptcy Court for the District of New Jersey (Camden Division) to recover monies owed. Defendant-appellant Nanco Contracting Corporation ("Nanco") appeals from the order of the district court affirming the prior order of the bankruptcy court that, in pertinent part, denied Nanco's motion to dismiss the complaint of plaintiff-appellee Diaz Contracting, Incorporated ("Diaz"). We must determine whether the district and bankruptcy courts erred in refusing to enforce a forum selection clause in the parties' contract requiring that all actions arising under the contract be brought in the courts of the State of New York. For the reasons set forth below, we will reverse the judgment of the district court.
I.
2
"[O]rders denying a pretrial motion to enforce a forum selection clause are reviewable by courts of appeals on three grounds: as interlocutory decisions under 28 U.S.C. Sec. 1291(a)(2) (1982), as collaterally final orders under 28 U.S.C. Sec. 1291, and under the All Writs Act, 28 U.S.C. Sec. 1651 (1982)." General Eng'g Corp. v. Martin Marietta Alumina, Inc., 783 F.2d 352, 355-56 (3d Cir.1986) (citing Coastal Steel Corp. v. Tilghman Wheelabrator, Ltd., 709 F.2d 190, 193-97 (3d Cir.), cert. denied, 464 U.S. 938, 104 S.Ct. 349, 78 L.Ed.2d 315 (1983)). Accordingly, we may properly exercise appellate jurisdiction over the order of the district court upholding the non-enforcement in the bankruptcy court of the contractual forum selection clause between Nanco and Diaz.
3
This appeal arises out of an adversary proceeding instituted by Diaz in connection with its petition under Chapter 11 of the Bankruptcy Code, 11 U.S.C. Secs. 541 & 542 (1982), against Nanco. In that proceeding, Diaz moved to recover, as property of the debtor's estate, certain monies allegedly owed to it by Nanco.1 Nanco filed a cross-motion for an order dismissing the proceeding on the basis of the forum selection clause in the parties' subcontract that requires actions arising thereunder to be brought in the courts of the State of New York. Nanco relied upon this Court's opinion in Coastal Steel Corp. v. Tilghman Wheelabrator Ltd., 709 F.2d 190 (3d Cir.), cert. denied, 464 U.S. 938, 104 S.Ct. 349, 78 L.Ed.2d 315 (1983), wherein now Chief Judge Gibbons noted the rule, first articulated by the Supreme Court in The Bremen v. Zapata Off-Shore Co., 407 U.S. 1, 92 S.Ct. 1907, 32 L.Ed.2d 513 (1972), "that a forum selection clause is presumptively valid." 709 F.2d at 202. Acknowledging the applicability of Coastal Steel and The Bremen, the bankruptcy court nevertheless apparently concluded that Diaz had overcome the presumption of enforceability by demonstrating financial difficulty. See Appendix ("App.") at A37-38. Specifically, the bankruptcy court stated:
4
As I read the Coastal Steel case, I believe it does leave the Court with a certain degree of discretion and certainly allows them to take into account certain mitigating or equitable factors.
5
* * *
6
I am familiar with the financial difficulty of this particular Chapter 11 debtor. Mr. Diaz, both by way of his corporate filing and by several other related filings, is before this Court and has experienced great difficulties so far as cash flow of the estate is concerned and I think I am bound to take that into consideration.
7
App. at A37-38. The bankruptcy judge, accordingly, refused to direct the parties' dispute to the courts of New York.
8
Nanco subsequently moved before the United States District Court for the District of New Jersey for leave to appeal the bankruptcy court's denial of its motion to dismiss. The district court granted Nanco's motion for leave to appeal. The order of the bankruptcy court was subsequently affirmed by the district court which noted that it "[could] not find on the record before it that [the bankruptcy court] abused [its] discretion and th[us would] not second-guess [that] decision." App. at A63.
9
On appeal, Nanco argues that the district court erroneously applied an abuse of discretion standard of review to the bankruptcy court's determination that the forum selection clause need not be enforced, and that both courts erred as a matter of law in refusing to enforce the clause. Diaz responds that this Court's decision in Zimmerman v. Continental Airlines, Inc., 712 F.2d 55 (3d Cir.1983), cert. denied, 464 U.S. 1038, 104 S.Ct. 699, 79 L.Ed.2d 165 (1984), modified our prior holding in Coastal Steel and renders forum selection clauses non-binding on bankruptcy courts. Based on Zimmerman, Diaz maintains that the purposes underlying the broad jurisdiction of the bankruptcy courts require that their decisions to enforce forum selection clauses be discretionary. Thus, Diaz argues, the district court properly reviewed the bankruptcy court's determination that the forum selection clause not be enforced for an abuse of discretion. Finally, Diaz argues that under whatever standard the enforceability determination is reviewed, it carried its burden of establishing that, on the facts of this case, litigation in another jurisdiction would be unreasonable. We turn first to a review of the law governing the enforceability of forum selection clauses.
II.
A.
10
A preliminary concern in determining the enforceability of a forum selection clause is what law, state or federal, governs that determination. In General Eng'g Corp. v. Martin Marietta Alumina, Inc., 783 F.2d 352 (3d Cir.1986), this Court "correct[ed] the assumption that federal courts are bound as a matter of federal common law to apply The Bremen standard to forum selection clauses." Id. at 356. Instead, we noted that the law of the state or other jurisdictions whose law governs the construction of the contract generally applies to the enforceability determination unless "a significant conflict between some federal policy or interest and the use of state law [exists]." Id. (quoting Miree v. DeKalb County, Georgia, 433 U.S. 25, 31-32, 97 S.Ct. 2490, 2494-95, 53 L.Ed.2d 557 (1977) (emphasis in original)); cf. Coastal Steel, 709 F.2d at 201 ("It is not entirely clear why, absent a [federal] statute ..., the enforceability of a contractual forum selection clause should properly be divorced from the law which in other respects governs the contract.").
11
In the instant appeal, the parties' Subcontract Agreement provides that "[t]he rights of the parties shall be construed pursuant to the laws of the state of New York." App. at A-22.2 Under New York law, the enforceability of forum selection clauses is governed by the standard enunciated in The Bremen. See Bense v. Interstate Battery Sys. of Am., 683 F.2d 718, 721 (2d Cir.1982) (quoting The Bremen, 407 U.S. at 15, 92 S.Ct. at 1916) (forum selection clauses generally enforced absent a strong 'show[ing] that enforcement would be unreasonable and unjust, or that the clause was invalid for such reasons as fraud or overreaching'). Moreover, this Court, in Coastal Steel, held that The Bremen standard was applicable even in a bankruptcy proceeding.3 See Coastal Steel, 709 F.2d at 202. Similarly, the Second Circuit has recognized the applicability of that standard in bankruptcy courts as well as district courts exercising federal question jurisdiction.4 See Envirolite Enter. v. Glastechnische Indus. Peter Lisec Gesellschaft M.B.H., 53 B.R. 1007 (S.D.N.Y.1985) (applying The Bremen ), aff'd, 788 F.2d 5 (2d Cir.1986). Thus, the determination whether the forum selection clause in the instant action should be enforced must be made in accordance with the standard enunciated in The Bremen.5
B.
12
In The Bremen, the Supreme Court chronicled the historic disapproval of forum selection clauses by American courts. Notwithstanding such disapproval, the Court adopted a new, more expansive approach to the enforceability of forum selection clauses, one that, the Court maintained, "accords with ancient concepts of freedom of contract...."6 407 U.S. at 11, 92 S.Ct. at 1914. In addition, the Court stressed the elimination of uncertainties in trade relationships as a paramount goal undergirding the presumptive enforceability of forum selection clauses. The Court thus concluded that a forum selection clause "is prima facie valid and should be enforced unless enforcement is shown by the resisting party to be 'unreasonable' under the circumstances." Id. at 10, 92 S.Ct. 1913.
13
Setting forth the elements of proof under this new approach, this Court in Coastal Steel stated that
14
a forum selection clause is presumptively valid and will be enforced unless the party objecting to its enforcement establishes (1) that it is the result of fraud or overreaching, (2) that enforcement would violate a strong public policy of the forum, or (3) that enforcement would in the particular circumstances of the case result in litigation in a jurisdiction so seriously inconvenient as to be unreasonable.
15
709 F.2d at 202. Applying this test to the facts before it,7 the bankruptcy court apparently concluded that the third prong of that test had been satisfied due to Diaz's "financial difficulty." App. at A38. The district court, reviewing the bankruptcy court order denying Nanco's motion to dismiss, similarly focused on the third prong and was satisfied that Diaz's "perilous financial condition" justified the bankruptcy court's refusal to enforce the forum selection clause.8 App. at A62. Thus, both courts rested their decisions on the "unreasonableness" of remitting Diaz's contract claims to the courts of the State of New York.9 Nanco now challenges the sufficiency of Diaz's purported "financial difficulty" as the sole ground for non-enforcement of the parties' contractual forum selection clause.
16
In Martin Marietta, we reaffirmed the rule that a party objecting to the enforcement of a forum selection clause as "unreasonable" must meet a strict standard of proof. Interpreting the command of The Bremen, we observed:
17
That the Court intended ... a strict standard in favor of enforcement is shown by the Court's admonition that enforcement may be denied only where it would be 'seriously inconvenient,' such that the resisting party 'would be effectively deprived of its day in court.' The Court underscored this rule by observing that absent allegations that the inclusion of the forum selection clause was a product of fraud or coercion, 'where it can be said with reasonable assurance that at the time they entered the contract, the parties ... contemplated the claimed inconvenience, it is difficult to see why any such claim of the inconvenience should be heard to render the forum selection clause unenforceable.'
18
783 F.2d at 356 (citations omitted) (emphasis in original). We must determine whether Diaz met its heavy burden under The Bremen of proving "that enforcement would be unreasonable and unjust." The Bremen, 407 U.S. at 15, 92 S.Ct. at 1916.
19
Diaz attempts to demonstrate that its financial condition renders enforcement of the forum selection clause unreasonable because "trial in the contractual forum will be so gravely difficult and inconvenient that [Diaz] ... will for all practical purposes be deprived of [its] day in court." The Bremen, 407 U.S. at 18, 92 S.Ct. at 1917. Specifically, Diaz first maintains that, unlike the debtor in Coastal Steel, it has been unable to propose a satisfactory reorganization plan under the Bankruptcy Code for the discharge of its debts. This fact, Diaz argues, counsels against requiring it to commence new litigation in New York. Such a requirement would adversely affect the reorganization, the success of which, according to Diaz, "depends on the debtor's ability to marshall its assets." Brief for the Appellee at 11. Second, Diaz asserts that, although its current counsel maintains an office in New York,10 the chief attorney in this litigation is not admitted to the New York Bar and that, at any rate, McCarter & English would not represent it in a state construction action. Thus, "Diaz would be forced to locate another attorney, and would lose the benefit of the knowledge of this litigation gained by his present attorneys." Id. Finally, Diaz simply asserts that it has no funds to finance additional litigation and that its precarious financial condition greatly reduces its chances of retaining new counsel even on a contingency fee basis.
20
Nanco suggests that Diaz's failure to submit evidence to substantiate its position that its contractual claims should be retained by the bankruptcy court amounts to a failure to meet the unreasonableness prong of The Bremen test. In response, Diaz maintains that its poor financial state was understood by both parties and by the court, and therefore, there was no need to submit any evidence.11 Indeed, the bankruptcy court cited its familiarity with Diaz's financial condition as its basis for refusing to enforce the forum selection clause. See App. at A38. Nevertheless, neither the bankruptcy court's intimate knowledge of nor Nanco's concessions concerning Diaz's precarious financial condition operates to discharge its burden of establishing grave inconvenience under The Bremen. Although Diaz arguably demonstrated some inconvenience in litigating in the contractual forum,12 its assertions are insufficient to meet its heavy burden of proving unreasonableness and injustice. " 'Mere inconvenience or additional expense is not the test of unreasonableness, since it may be assumed that the plaintiff received under the contract consideration for these things.' " Deolalikar v. Murlas Commodities, Inc., 602 F.Supp. 12, 15 (E.D.Pa.1984) (quoting Central Contracting Co. v. Maryland Casualty Co., 367 F.2d 341, 344 (3rd Cir.1966)).
21
Stripped to its essence, Diaz's contention is that a debtor in bankruptcy is entitled to a more lenient standard of proof. This is simply not the law. In Coastal Steel, this Court enforced a forum selection clause against a debtor in bankruptcy thereby requiring the debtor to commence its action in England rather than New Jersey. Similarly, in Envirolite Enterprises, the district court rejected the argument that the debtor-plaintiff need not comply with the contractual forum selection clause that required that litigation be brought in Austria. Here, Diaz has not carried its burden of demonstrating that requiring that litigation be brought in New York as opposed to New Jersey would effectively deprive it of its day in court.
22
We are also not persuaded by Diaz's attempt to distinguish its situation from that of the debtor in Coastal Steel. The fact that Diaz has been unable to confirm a plan of reorganization has little or no bearing on its ability to commence litigation in New York. Moreover, Diaz has not explained why its current counsel cannot or will not represent it in litigation there. Nor has it explained why transfer of its case to another attorney--whether with McCarter & English or not13--would pose unique problems that would mandate non-enforcement of the forum clause. It is not uncommon for legal representation to change hands during the course of very complex and lengthy litigation. We are simply unable to discern why Diaz's breach of contract claims against Nanco are such that new representation would prove devastating. Finally, Diaz has not established, or even maintained, that it cannot secure new representation to pursue its claims in New York. Instead, Diaz merely claims that "[i]ts chances of finding another attorney ... are slim to none." Brief for the Appellee at 12 (emphasis added).
23
For the foregoing reasons, we conclude that the bankruptcy court incorrectly found that Diaz met its burden under The Bremen. We turn next to the district court's review of the bankruptcy court's order denying Nanco's motion to dismiss based on the forum selection clause.
III.
24
In affirming the bankruptcy court's decision not to enforce the forum selection clause, the district court cited this Court's decision in Zimmerman v. Continental Airlines, Inc., 712 F.2d 55 (3d Cir.1983), cert. denied, 464 U.S. 1038, 104 S.Ct. 699, 79 L.Ed.2d 165 (1984), for the proposition that "[t]he standard of review on appeal is whether the bankruptcy court abused its discretion in denying Nanco's motion to dismiss." App. at A62. Applying that standard, the district court concluded that no abuse had occurred and, accordingly, that it would not "second-guess" the bankruptcy court's decision. Id. at A63. Nanco argues that application of an abuse of discretion standard was error. We agree.
25
Under Coastal Steel, absent applicable state law, bankruptcy courts must apply The Bremen test to determine whether a forum selection clause should be enforced. In turn, absent a strong showing by the party opposing enforcement that the conditions under The Bremen have been met, the bankruptcy court must enforce the forum selection clause. Diaz argues, however, that this Court's subsequent decision in Zimmerman, in effect, undercut the prior pronouncement in Coastal Steel by affording bankruptcy courts considerable discretion in determining whether to enforce a forum selection clause. Diaz emphasizes our statement in Zimmerman that "[t]he economic fragility of the bankrupt's estate, the excess of creditors' demands over the debtors' assets, and the goal of rehabilitating the debtor all argue for expeditious resolution of the bankruptcy proceeding," 712 F.2d at 58, and concludes that "[u]nder Zimmerman, the decision to enforce a forum selection clause is left within the sound discretion of the Bankruptcy Court ... [and] will only be reversed upon a finding that the Court abused its discretion." Brief for the Appellee at 7. Diaz miscontrues our holding.
26
In Zimmerman, this Court addressed the issue whether the bankruptcy court is exempt from the commands of the United States Arbitration Act, 9 U.S.C. Secs. 1-208 (1982). Specifically, we considered whether Sec. 3 of that Act, which provides for a mandatory stay of all court proceedings pending the completion of arbitration, was binding on the bankruptcy court. We concluded that, notwithstanding the strong federal policy favoring arbitration, the policies underlying the Bankruptcy Reform Act of 1978, Act of Nov. 6, 1978, Pub.L. No. 95-598, 92 Stat. 2549, viz., to avoid unnecessary delays and duplication of effort, outweigh those policies underlying the mandatory stay provisions of Sec. 3. Consequently, we held that "the granting of a stay pending arbitration, even when the arbitration clause is contractual, is a matter left to the sound discretion of the bankruptcy judge." 712 F.2d at 56.
27
Diaz cites this Court's recognition in Coastal Steel of the analytical similarity between motions to enforce forum selection clauses and motions to stay proceedings pending arbitration, see 709 F.2d at 194, as indicative of the applicability of Zimmerman to this appeal. Notwithstanding that recognition--which by its own terms was limited to the issue of jurisdiction, see id.,--two principal factors distinguish our decision in Zimmerman and militate against its extension to the instant appeal. First, the uniqueness of arbitration as an alternative method of dispute resolution14 is such that the enforceability of arbitration clauses, though generally favored, is not governed by the same standard federal courts generally apply (absent applicable state law) to contractual forum selection clauses, namely, The Bremen test. Under that test, as discussed supra, enforcement is mandated absent a strong showing of unreasonableness and injustice. Conversely, federal courts apply a more exacting standard in determining whether to remit the parties' cause to arbitration. A host of factors may inform that determination. For instance, a court may consider whether in fact an arbitrable issue exists; whether that issue arises out of a collective bargaining agreement, a federal statute, or some other source; whether, if the issue is a federal statutory claim, Congress has foreclosed arbitration of that claim. See, e.g., Jacobson v. Merrill Lynch, Pierce, Fenner & Smith, Inc., 797 F.2d 1197 (3d Cir.1986) petition for cert. filed, 55 U.S.L.W. 3259 (U.S. Sept. 25, 1986) (No. 86487). Thus, in determining in Zimmerman whether the congressional desire for expedited disposition of bankruptcy proceedings outweighed the congressional policy favoring enforcement of arbitration clauses, we were faced with very different policy concerns arising from the nature of the competing forums. Here, however, where both competing forums are judicial, the concern cited in Zimmerman, 712 F.2d at 58-59, over the relative delay, expense and duplication of effort involved in the respective forums is not implicated.15
28
Second, and more important, the policy concerns that animated this court in Zimmerman were embodied in two congressional acts. Underlying our decision in that case, then, was the accommodation of two competing federal statutes. See Zimmerman, 712 F.2d at 56 ("This appeal requires us to reconcile two contradictory federal policies.") There is no similar conflict in the instant appeal. Rather, we are urged to hold that the Bankruptcy Act itself favors discretionary enforcement of forum selection clauses in bankruptcy proceedings. We believe, however, and hereby hold that our decision in Zimmerman is best limited to those cases where the identical policy concerns are at issue, namely, arbitration cases. Thus, contrary to Diaz's assertion, Zimmerman does not announce a new standard governing the enforceability of forum selection clauses in bankruptcy courts. Nor does it represent an internal construction of the Bankruptcy Act. Rather, Zimmerman holds that where the policies underlying the Bankruptcy Act and the United States Arbitration Act conflict, the decision whether to stay a bankruptcy proceeding pending resolution of a contractually agreed-upon arbitration is left to the sound discretion of the bankruptcy judge. See 712 F.2d at 60.
29
In sum, Zimmerman does not affect the law, as articulated in Coastal Steel, concerning the enforceability of forum selection clauses in bankruptcy proceedings. Instead, as this Court specifically held in Martin Marietta,
30
[t]he court's determination of the circumstances underlying its conclusion [whether to enforce a forum selection clause] are basic or inferred facts entitled to the presumption of correctness under the clearly erroneous standard of review. The court's decision that these circumstances warrant refusing enforcement of the forum selection clause, [however,] is a legal conclusion or ultimate fact subject to plenary review.
31
783 F.2d at 359 (emphasis added). Accordingly, the district court erred in its reliance on Zimmerman in reviewing the order of the bankruptcy court denying Nanco's motion to dismiss.
CONCLUSION
32
For the foregoing reasons we will reverse the judgment of the district court and direct that the bankruptcy court dismiss Diaz's adversary proceeding with leave to commence a new action in the courts of the State of New York.
*
Honorable Edward Dumbauld, United States District Judge for the Western District of Pennsylvania, sitting by designation
1
The underlying basis of Diaz's claim arose from a public works improvement contract entered into by Nanco, as general contractor, and the New York City Department of Transportation, as owner, for yard construction and track work at the Brooklyn Waterfront Rail Preservation Yard. Pursuant to a written Subcontract Agreement between Nanco and Diaz, Diaz agreed to furnish certain specified work at the project site for a total of $1.29 million
In its complaint in the adversary proceeding, Diaz maintained that Nanco breached the subcontract by failing to make certain progress payments required thereunder. The merits of Diaz's claim against Nanco, however, are not germane to the instant appeal, which concerns the non-enforcement of the forum selection clause contained in the Subcontract Agreement.
2
Although the bankruptcy judge acknowledged that New York law "appears to be the governing law of the contract," App. at A38, and announced her intention to apply it, there is no indication on the record that the substance or applicability of New York law concerning forum selection was explored. As indicated infra, however, New York law on forum selection is identical to the federal common law announced in The Bremen
3
Coastal Steel involved a challenge by a debtor, the third-party beneficiary of the enforcement of a forum selection clause in a contract between two defendants. This Court held that in the absence of a legally sufficient showing regarding the unreasonableness of enforcement, the forum selection clause would be enforced against the debtor who should have foreseen becoming a third-party beneficiary to the main contract
4
The Eleventh Circuit recently held that venue in cases predicated on diversity jurisdiction is a matter of federal procedural law, and thus contractual forum selection clauses are enforceable in diversity actions regardless of whether the law of the forum state deems such clauses as contrary to public policy. Stewart Org., Inc. v. Ricoh Corp., 810 F.2d 1066 (11th Cir.1987) (per curiam) (en banc)
5
This result is not altered by the application of New Jersey law, the only other state whose law could arguably apply, because it also follows The Bremen. See Coastal Steel, 709 F.2d at 202 (citing New Jersey precedent)
6
The Court also noted that favoring the enforceability of forum selection clauses "reflects an appreciation of the expanding horizons of American contractors who seek business in all parts of the world." 407 U.S. at 11, 92 S.Ct. at 1914. The international considerations of the Court's decision, of course, are not relevant to the interstate contract between Diaz and Nanco
7
The bankruptcy judge properly identified the applicable standard as follows:
forum selection clauses are presumptively valid and will be enforced unless a party objects and can establish either that the clause was the result of fraud or overreaching or would violate a strong public policy of the forum, or in a particular circumstance of a particular case would seriously inconvenience the objector or the debtor so as to be unreasonable.
App. at A37.
8
The district court reviewed the bankruptcy court's enforceability determination for an abuse of discretion. The application of that standard, however, as opposed to a plenary standard of review, is independently challenged by Nanco and will be discussed infra
9
As to the first prong of The Bremen test, the bankruptcy court specifically noted that there was no allegation or evidence of fraud or overreaching. See App. at A38. Nor does Diaz assert on appeal that the forum selection clause was included as a result of fraud or misrepresentation. As to the second prong, regarding public policy of the forum, neither the bankruptcy nor the district court considered whether the Bankruptcy Code reflects a public policy against enforcement of forum selection clauses under the circumstances of this case
Coastal Steel rejected the notion that the policy of the bankruptcy court of facilitating the collection and distribution of debtor estates in itself exempts that court from the public policy favoring the enforceability of forum selection clauses. See 709 F.2d at 202. Instead, we observed that "[a]t best the grant to protective federal jurisdiction over proceedings related to title 11 is one circumstance to be taken into account in making the unreasonableness determination." Id. Diaz, however, has asserted that the adversary proceeding that is the subject of this opinion is a "core" bankruptcy proceeding and that Congress could not have intended to permit contractual forum selection clauses to override the policy of the Bankruptcy Code to concentrate core bankruptcy proceedings in the bankruptcy court in order to effectuate the Congressional purpose of speedy rehabilitation of the debtor. This argument is not foreclosed by our decision in Coastal Steel. In view of the fact, however, that the controversy at issue here is plainly a "non-core" bankruptcy proceeding, one that could have as easily been instituted in a state court as well as a district court, see In Re: Colorado Energy Supply, 728 F.2d 1283, 1286 (10th Cir.1984), we need not address this question.
10
Diaz is represented by the law firm of McCarter & English, which maintains offices in Newark, New Jersey and New York City
11
Specifically, Diaz maintains "that such testimony was rendered unnecessary by [Nanco's] own concessions." Brief for the Appellee at 2. We need not determine here the extent of evidence required to sustain an allegation of unreasonableness. We are satisfied, however, that Diaz's bald assertions do not establish the manifest and grave inconvenience contemplated by The Bremen and its progeny
12
Nanco argued before both this Court and the courts below (1) that "since New York and New Jersey are contiguous states, the burden Diaz would face by having to litigate in New York is no greater than the burden it undertook when it initially agreed to perform the underlying subcontract ... in ... New York;" (2) that the distance between the adversary proceedings forum and the contractual forum is no less than one hundred miles; (3) that Diaz's current counsel operate their main offices in Newark, New Jersey, which is significantly closer to New York City--the contractual forum--than it is to Camden, New Jersey--the site of the instant adversary proceedings; (4) that Diaz's current counsel maintain offices in New York City; and, finally, (5) that approximately one-third of the firm's lawyers are admitted to practice in New York. See Brief for the Appellant at 20-21. Of course, the burden set forth in The Bremen is not on Nanco to disprove Diaz's alleged inconvenience, although these undisputed facts would seem to satisfy such a burden if it existed. Rather, the "heavy burden of showing not only that the balance of convenience is strongly in favor of trial in [the current forum] ..., but also that a [New York] trial will be so manifestly and gravely inconvenient ... that [Diaz] will be effectively deprived of a meaningful day in court," The Bremen, 407 U.S. at 19, 92 S.Ct. at 1918 (emphasis added), rests squarely with Diaz
13
But see, supra note 12
14
"An agreement to arbitrate before a specific tribunal is, in effect, a specialized kind of forum selection clause that posits not only the situs of suit but also the procedure to be used in resolving the dispute." Scherk v. Alberto-Culver Co., 417 U.S. 506, 519, 94 S.Ct. 2449, 2457, 41 L.Ed.2d 270 (1974)
15
We note that even if the policy concerns considered in Zimmerman were controlling here, since we have determined that Diaz's adversary proceeding is a "non-core" proceeding, see supra note 9, the identical result would obtain. As indicated by Nanco, "the fact that this is a 'non-core' proceeding means that trial of the adversary proceeding by the bankruptcy court will only result in delays and duplications of efforts, since either party may demand a de novo review in the district court." Letter of Michael A. Mulqueen at 4 (Dec. 18, 1986); see also 28 U.S.C. Sec. 157(c)(1) (1982) ("any final order or judgment [in a non-core bankruptcy proceeding] shall be entered by the district judge after considering the bankruptcy judge's proposed findings and conclusions and after reviewing de novo those matters to which any party has timely and specifically objected")
| {
"pile_set_name": "FreeLaw"
} |
//TODO: Осталось сделать только список цветов с перебором по букве диска
//TODO: И аналогично для цвета фона градусника/картинок/текста и самого градусника
/*
Copyright (c) 2010-present Maximus5
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the authors may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ''AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifdef _DEBUG
// Раскомментировать, чтобы сразу после загрузки плагина показать MessageBox, чтобы прицепиться дебаггером
// #define SHOW_STARTED_MSGBOX
// #define SHOW_WRITING_RECTS
#endif
#include "../common/Common.h"
#include "../common/CEStr.h"
#ifdef _DEBUG
#pragma warning( disable : 4995 )
#endif
#include "../common/pluginW1761.hpp" // Отличается от 995 наличием SynchoApi
#ifdef _DEBUG
#pragma warning( default : 4995 )
#endif
#define GDIPVER 0x0110
#include "../common/GdiPlusLt.h"
#include "../common/xmllite.h"
#include "../common/MStrDup.h"
#include "../common/MStream.h"
#include "../common/UnicodeChars.h"
#include "../common/FarVersion.h"
#include "../common/MSectionSimple.h"
#include "../common/WThreads.h"
#include "ConEmuBg.h"
#define MAKEFARVERSION(major,minor,build) ( ((major)<<8) | (minor) | ((build)<<16))
#define DBGSTR(s) OutputDebugString(s);
#if defined(__GNUC__)
extern "C" {
BOOL WINAPI DllMain(HANDLE hModule, DWORD ul_reason_for_call, LPVOID lpReserved);
void WINAPI SetStartupInfoW(void *aInfo);
void WINAPI OnConEmuLoaded(struct ConEmuLoadedArg* pConEmuInfo);
void WINAPI GetPluginInfoWcmn(void *piv);
};
#endif
#ifndef DT_HIDEPREFIX
#define DT_HIDEPREFIX 0x00100000
#endif
HMODULE ghPluginModule = NULL; // ConEmuBg.dll - сам плагин
//wchar_t* gszRootKey = NULL;
FarVersion gFarVersion = {};
static RegisterBackground_t gfRegisterBackground = NULL;
bool gbInStartPlugin = false;
bool gbSetStartupInfoOk = false;
ConEmuBgSettings gSettings[] = {
{L"PluginEnabled", (LPBYTE)&gbBackgroundEnabled, REG_BINARY, 1},
{L"XmlConfigFile", (LPBYTE)gsXmlConfigFile, REG_SZ, countof(gsXmlConfigFile)},
//{L"LinesColor", (LPBYTE)&gcrLinesColor, REG_DWORD, 4},
//{L"HilightType", (LPBYTE)&giHilightType, REG_DWORD, 4},
//{L"HilightPlugins", (LPBYTE)&gbHilightPlugins, REG_BINARY, 1},
//{L"HilightPlugBack", (LPBYTE)&gcrHilightPlugBack, REG_DWORD, 4},
{NULL}
};
BOOL gbBackgroundEnabled = FALSE;
wchar_t gsXmlConfigFile[MAX_PATH] = {};
BOOL gbMonitorFileChange = FALSE;
//COLORREF gcrLinesColor = RGB(0,0,0xA8); // чуть светлее синего
//int giHilightType = 0; // 0 - линии, 1 - полосы
//BOOL gbHilightPlugins = FALSE;
//COLORREF gcrHilightPlugBack = RGB(0xA8,0,0); // чуть светлее красного
// minimal(?) FAR version 2.0 alpha build FAR_X_VER
int WINAPI GetMinFarVersionW(void)
{
// ACTL_SYNCHRO required
return MAKEFARVERSION(2,0,std::max(1007,FAR_X_VER));
}
void WINAPI GetPluginInfoWcmn(void *piv)
{
if (gFarVersion.dwBuild>=FAR_Y2_VER)
FUNC_Y2(GetPluginInfoW)(piv);
else if (gFarVersion.dwBuild>=FAR_Y1_VER)
FUNC_Y1(GetPluginInfoW)(piv);
else
FUNC_X(GetPluginInfoW)(piv);
}
BOOL gbInfoW_OK = FALSE;
void WINAPI ExitFARW(void);
void WINAPI ExitFARW3(void*);
int WINAPI ConfigureW(int ItemNumber);
int WINAPI ConfigureW3(void*);
bool FMatch(LPCWSTR asMask, LPWSTR asPath);
#include "../common/SetExport.h"
ExportFunc Far3Func[] =
{
{"ExitFARW", (void*)ExitFARW, (void*)ExitFARW3},
{"ConfigureW", (void*)ConfigureW, (void*)ConfigureW3},
{NULL}
};
BOOL WINAPI DllMain(HANDLE hModule, DWORD ul_reason_for_call, LPVOID lpReserved)
{
switch(ul_reason_for_call)
{
case DLL_PROCESS_ATTACH:
{
ghPluginModule = (HMODULE)hModule;
//ghWorkingModule = hModule;
HeapInitialize();
#ifdef SHOW_STARTED_MSGBOX
if (!IsDebuggerPresent())
MessageBoxA(NULL, "ConEmuBg*.dll loaded", "ConEmuBg plugin", 0);
#endif
bool lbExportsChanged = false;
if (LoadFarVersion())
{
if (gFarVersion.dwVerMajor == 3)
{
lbExportsChanged = ChangeExports( Far3Func, ghPluginModule );
if (!lbExportsChanged)
{
_ASSERTE(lbExportsChanged);
}
}
}
}
break;
case DLL_PROCESS_DETACH:
HeapDeinitialize();
break;
}
return TRUE;
}
#if defined(CRTSTARTUP)
extern "C" {
BOOL WINAPI _DllMainCRTStartup(HANDLE hDll,DWORD dwReason,LPVOID lpReserved);
};
BOOL WINAPI _DllMainCRTStartup(HANDLE hDll,DWORD dwReason,LPVOID lpReserved)
{
DllMain(hDll, dwReason, lpReserved);
return TRUE;
}
#endif
BOOL LoadFarVersion()
{
wchar_t ErrText[512]; ErrText[0] = 0;
BOOL lbRc = LoadFarVersion(gFarVersion, ErrText);
if (!lbRc)
{
gFarVersion.dwVerMajor = 2;
gFarVersion.dwVerMinor = 0;
gFarVersion.dwBuild = FAR_X_VER;
}
return lbRc;
}
void WINAPI SetStartupInfoW(void *aInfo)
{
gbSetStartupInfoOk = true;
if (!gFarVersion.dwVerMajor) LoadFarVersion();
if (gFarVersion.dwBuild>=FAR_Y2_VER)
FUNC_Y2(SetStartupInfoW)(aInfo);
else if (gFarVersion.dwBuild>=FAR_Y1_VER)
FUNC_Y1(SetStartupInfoW)(aInfo);
else
FUNC_X(SetStartupInfoW)(aInfo);
//_ASSERTE(gszRootKey!=NULL && *gszRootKey!=0);
gbInfoW_OK = TRUE;
StartPlugin(FALSE);
}
struct DrawInfo
{
LPCWSTR szVolume, szVolumeRoot, szVolumeSize, szVolumeFree;
DWORD nDriveType;
enum {
dib_Small = 0, dib_Large = 1, dib_Off = 2
} nSpaceBar;
wchar_t szPic[MAX_PATH]; // Это относительный путь! считая от папки с плагином ("img/plugin.png")
wchar_t szText[MAX_PATH]; // Текст, который отображается под картинкой ("G: 128Gb")
COLORREF crBack[32]; // Цвет фона
int nBackCount;
COLORREF crDark[32]; // Цвет спрайтов, текста, фона градусника
int nDarkCount;
COLORREF crLight[32]; // Цвет градусника
int nLightCount;
enum DrawInfoFlags
{
dif_PicFilled = 0x0000001,
dif_TextFilled = 0x0000002,
dif_BackFilled = 0x0000004,
dif_DarkFilled = 0x0000008,
dif_LightFilled = 0x0000010,
dif_ShiftBackColor = 0x0000020,
dif_Disabled = 0x8000000,
};
DWORD Flags; // of DrawInfoFlags
};
bool gbGdiPlusInitialized = false;
typedef HRESULT (WINAPI* CreateXmlReader_t)(REFIID riid, void** ppvObject, void* pMalloc);
CreateXmlReader_t gfCreateXmlReader = NULL;
HMODULE ghXmlLite = NULL;
struct XmlConfigFile
{
MSectionSimple* cr;
FILETIME FileTime;
LPBYTE FileData;
DWORD FileSize;
};
XmlConfigFile XmlFile = {};
wchar_t* gpszXmlFile = NULL;
wchar_t* gpszXmlFolder = NULL;
HANDLE ghXmlNotification = NULL;
const wchar_t* szDefaultXmlName = L"Background.xml";
void ReportFail(LPCWSTR asInfo)
{
wchar_t szTitle[128];
swprintf_c(szTitle, L"ConEmuBg, PID=%u", GetCurrentProcessId());
wchar_t* pszErr = lstrmerge(asInfo,
L"\n" L"Config value: ", gsXmlConfigFile[0] ? gsXmlConfigFile : szDefaultXmlName,
L"\n" L"Expanded: ", gpszXmlFile ? gpszXmlFile : L"<NULL>");
MessageBox(NULL, pszErr, szTitle, MB_ICONSTOP|MB_SYSTEMMODAL);
free(pszErr);
}
bool WasXmlLoaded()
{
return (XmlFile.FileData != NULL);
}
// Возвращает TRUE, если файл изменился
bool CheckXmlFile(bool abUpdateName /*= false*/)
{
bool lbChanged = false, lbNeedCheck = false;
DWORD nNotify = 0;
wchar_t szErr[128];
_ASSERTE(XmlFile.cr && XmlFile.cr->IsInitialized());
MSectionLockSimple CS; CS.Lock(XmlFile.cr);
if (abUpdateName)
{
bool lbNameOk = false;
size_t cchMax = MAX_PATH+1;
if (!gpszXmlFile)
gpszXmlFile = (wchar_t*)malloc(cchMax*sizeof(*gpszXmlFile));
if (gpszXmlFile)
{
gpszXmlFile[0] = 0;
// If config file has full path or environment variable (supposing full path with %FARHOME% or %ConEmuDir%)
if (*gsXmlConfigFile && (wcschr(gsXmlConfigFile, L'\\') || wcschr(gsXmlConfigFile, L'%')))
{
DWORD nRc = ExpandEnvironmentStrings(gsXmlConfigFile, gpszXmlFile, MAX_PATH+1);
if (!nRc || nRc > MAX_PATH)
{
gpszXmlFile[0] = 0;
ReportFail(L"Too long xml path after ExpandEnvironmentStrings");
}
else
{
lbNameOk = true;
}
}
if (!lbNameOk && !*gpszXmlFile)
{
LPCWSTR pszXmlName = *gsXmlConfigFile ? gsXmlConfigFile : szDefaultXmlName;
int nNameLen = lstrlen(pszXmlName);
if (GetModuleFileName(ghPluginModule, gpszXmlFile, MAX_PATH-nNameLen))
{
wchar_t* pszSlash = wcsrchr(gpszXmlFile, L'\\');
if (pszSlash) pszSlash++; else pszSlash = gpszXmlFile;
_wcscpy_c(pszSlash, cchMax-(pszSlash-gpszXmlFile), pszXmlName);
lbNameOk = true;
}
}
}
if (!lbNameOk)
{
if (gpszXmlFile)
{
free(gpszXmlFile);
gpszXmlFile = NULL;
};
ReportFail(L"Can't initialize name of xml file");
lbChanged = false;
goto wrap;
}
// Notification - мониторинг изменения файла
if (ghXmlNotification && (ghXmlNotification != INVALID_HANDLE_VALUE))
{
FindCloseChangeNotification(ghXmlNotification);
ghXmlNotification = NULL;
}
if (gpszXmlFolder)
free(gpszXmlFolder);
gpszXmlFolder = lstrdup(gpszXmlFile);
if (gpszXmlFolder)
{
wchar_t* pszSlash = wcsrchr(gpszXmlFolder, L'\\');
if (pszSlash)
{
if (wcschr(gpszXmlFolder, L'\\') < pszSlash)
pszSlash[0] = 0;
else
pszSlash[1] = 0;
}
//Issue 1230
if (gbMonitorFileChange)
{
ghXmlNotification = FindFirstChangeNotification(gpszXmlFolder, FALSE, FILE_NOTIFY_CHANGE_FILE_NAME|FILE_NOTIFY_CHANGE_SIZE|FILE_NOTIFY_CHANGE_LAST_WRITE);
}
else
{
_ASSERTE(ghXmlNotification==NULL);
lbNeedCheck = true;
}
}
}
if (ghXmlNotification && (ghXmlNotification != INVALID_HANDLE_VALUE))
{
nNotify = WaitForSingleObject(ghXmlNotification, 0);
if (nNotify == WAIT_OBJECT_0)
{
lbNeedCheck = true;
//FindNextChangeNotification(ghXmlNotification); -- в конце позовем
}
}
// в первый раз - выставляем строго
if (!lbNeedCheck && !XmlFile.FileData)
lbNeedCheck = true;
if (gpszXmlFile && *gpszXmlFile && lbNeedCheck)
{
HANDLE hFile = CreateFile(gpszXmlFile, GENERIC_READ, FILE_SHARE_READ, 0, OPEN_EXISTING, 0, NULL);
if (hFile && hFile != INVALID_HANDLE_VALUE)
{
BY_HANDLE_FILE_INFORMATION inf = {};
GetFileInformationByHandle(hFile, &inf);
if (!inf.nFileSizeLow)
{
ReportFail(L"Configuration xml file is empty");
}
else if (!XmlFile.FileData)
{
lbChanged = true;
}
else
{
if ((memcmp(&inf.ftLastWriteTime, &XmlFile.FileTime, sizeof(XmlFile.FileTime)) != 0)
|| (inf.nFileSizeLow != XmlFile.FileSize))
{
lbChanged = true;
}
}
if (lbChanged)
{
DWORD dwRead = 0;
LPBYTE ptrData = (LPBYTE)calloc(inf.nFileSizeLow+1, sizeof(*ptrData));
if (!ptrData)
{
swprintf_c(szErr, L"Can't allocate %u bytes for xml configuration", inf.nFileSizeLow+1);
ReportFail(szErr);
}
else if (!ReadFile(hFile, ptrData, inf.nFileSizeLow, &dwRead, NULL) || (dwRead != inf.nFileSizeLow))
{
swprintf_c(szErr, L"Can't read %u bytes from xml configuration file", inf.nFileSizeLow);
ReportFail(szErr);
}
else
{
if (XmlFile.FileData)
free(XmlFile.FileData);
XmlFile.FileData = ptrData;
ptrData = NULL;
XmlFile.FileSize = dwRead;
}
if (ptrData) // Если ошибка, освободить память
free(ptrData);
}
// Done
CloseHandle(hFile);
}
else
{
// В первый раз - на отсутствие файла ругнемся
if (!XmlFile.FileData)
{
ReportFail(L"Configuration xml file was not found in the plugin folder");
}
}
}
// Если файла нет, или его не удалось прочитать - подсунем пустышку
if (!XmlFile.FileData)
{
XmlFile.FileSize = 0;
XmlFile.FileData = (LPBYTE)calloc(1,sizeof(*XmlFile.FileData));
}
wrap:
if (ghXmlNotification && (ghXmlNotification != INVALID_HANDLE_VALUE) && (nNotify == WAIT_OBJECT_0))
{
FindNextChangeNotification(ghXmlNotification);
}
return lbChanged;
}
#define DllGetFunction(hModule, FunctionName) FunctionName = (FunctionName##_t)GetProcAddress(hModule, #FunctionName)
enum tag_GdiStrMagics
{
eGdiStr_Decoder = 0x2001,
eGdiStr_Image = 0x2002,
};
struct CachedImage
{
DWORD nMagic;
BOOL bUsed;
// Имя картинки
wchar_t sImgName[MAX_PATH]; // i.e. L"img/plugin.png"
// Хэндлы. CompatibleDC & Bitmap
HDC hDc;
HBITMAP hBmp, hOldBmp;
int nWidth, nHeight;
// Next pointer
CachedImage *pNextImage;
bool Init(LPCWSTR apszName, HDC ahDc, UINT anWidth, UINT anHeight, const HDC hScreenDC)
{
_ASSERTE(hDc==NULL && hBmp==NULL && hOldBmp==NULL);
nMagic = eGdiStr_Image;
bUsed = TRUE;
wcscpy_c(sImgName, apszName);
//hDc = ahDc; ahDc = NULL;
//hBmp = ahBmp; ahBmp = NULL;
//hOldBmp = ahOldBmp; ahOldBmp = NULL;
nWidth = anWidth;
nHeight = anHeight;
hDc = CreateCompatibleDC(hScreenDC);
hBmp = CreateCompatibleBitmap(hScreenDC, nWidth, nHeight);
if (!hDc || !hBmp)
{
ReportFail(L"CreateCompatible[DC|Bitmap] failed in CachedImage::Init");
if (hDc)
{
DeleteDC(hDc);
hDc = NULL;
}
if (hBmp)
{
DeleteObject(hBmp);
hBmp = NULL;
}
return false;
}
hOldBmp = (HBITMAP)SelectObject(hDc, hBmp);
//BitBlt, MaskBlt, AlphaBlend, TransparentBlt
BitBlt(hDc, 0, 0, nWidth, nHeight, ahDc, 0, 0, SRCCOPY); // PATINVERT/PATPAINT?
return true;
};
// Деструктор
void Close()
{
sImgName[0] = 0;
if (hOldBmp && hDc)
{
SelectObject(hDc, hOldBmp);
hOldBmp = NULL;
}
if (hDc)
{
DeleteDC(hDc);
hDc = NULL;
}
if (hBmp)
{
DeleteObject(hBmp);
hBmp = NULL;
}
if (pNextImage)
{
pNextImage->Close();
}
free(this);
};
};
struct GDIPlusDecoder
{
DWORD nMagic;
HMODULE hGDIPlus;
ULONG_PTR gdiplusToken; bool bTokenInitialized;
HRESULT nLastError;
BOOL bCoInitialized;
wchar_t sModulePath[MAX_PATH];
CachedImage *pImages;
typedef Gdiplus::Status(WINAPI *GdiplusStartup_t)(ULONG_PTR *token, const Gdiplus::GdiplusStartupInput *input, void /*Gdiplus::GdiplusStartupOutput*/ *output);
typedef VOID (WINAPI *GdiplusShutdown_t)(ULONG_PTR token);
typedef Gdiplus::Status(WINAPI *GdipCreateBitmapFromFile_t)(GDIPCONST WCHAR* filename, Gdiplus::GpBitmap **bitmap);
typedef Gdiplus::Status(WINAPI *GdipGetImageWidth_t)(Gdiplus::GpImage *image, UINT *width);
typedef Gdiplus::Status(WINAPI *GdipGetImageHeight_t)(Gdiplus::GpImage *image, UINT *height);
typedef Gdiplus::Status(WINAPI *GdipDisposeImage_t)(Gdiplus::GpImage *image);
//typedef Gdiplus::Status(WINAPI *GdipCreateHBITMAPFromBitmap_t)(Gdiplus::GpBitmap* bitmap, HBITMAP* hbmReturn, ARGB background);
typedef Gdiplus::Status(WINAPI *GdipDrawImageI_t)(Gdiplus::GpGraphics *graphics, Gdiplus::GpImage *image, INT x, INT y);
typedef Gdiplus::Status(WINAPI *GdipCreateFromHDC_t)(HDC hdc, Gdiplus::GpGraphics **graphics);
typedef Gdiplus::Status(WINAPI *GdipDeleteGraphics_t)(Gdiplus::GpGraphics *graphics);
typedef Gdiplus::Status(WINAPI *GdipGetDC_t)(Gdiplus::GpGraphics* graphics, HDC * hdc);
typedef Gdiplus::Status(WINAPI *GdipReleaseDC_t)(Gdiplus::GpGraphics* graphics, HDC hdc);
typedef Gdiplus::Status(WINAPI *GdipGetImageGraphicsContext_t)(Gdiplus::GpImage *image, Gdiplus::GpGraphics **graphics);
typedef Gdiplus::Status(WINAPI *GdipBitmapConvertFormat_t)(Gdiplus::GpBitmap *pInputBitmap, Gdiplus::PixelFormat format, Gdiplus::DitherType dithertype, Gdiplus::PaletteType palettetype, Gdiplus::ColorPalette *palette, DWORD alphaThresholdPercent);
GdiplusStartup_t GdiplusStartup;
GdiplusShutdown_t GdiplusShutdown;
GdipCreateBitmapFromFile_t GdipCreateBitmapFromFile;
GdipGetImageWidth_t GdipGetImageWidth;
GdipGetImageHeight_t GdipGetImageHeight;
GdipDisposeImage_t GdipDisposeImage;
//GdipCreateHBITMAPFromBitmap_t GdipCreateHBITMAPFromBitmap;
GdipDrawImageI_t GdipDrawImageI;
GdipCreateFromHDC_t GdipCreateFromHDC;
GdipDeleteGraphics_t GdipDeleteGraphics;
GdipGetDC_t GdipGetDC;
GdipReleaseDC_t GdipReleaseDC;
GdipGetImageGraphicsContext_t GdipGetImageGraphicsContext;
GdipBitmapConvertFormat_t GdipBitmapConvertFormat;
bool Init()
{
nMagic = eGdiStr_Decoder;
hGDIPlus = NULL; gdiplusToken = 0; bTokenInitialized = false;
nLastError = 0;
if (!GetModuleFileName(ghPluginModule, sModulePath, countof(sModulePath)))
{
ReportFail(L"GetModuleFileName failed in GDIPlusDecoder::Init");
sModulePath[0] = 0;
}
else
{
wchar_t* pszSlash = wcsrchr(sModulePath, L'\\');
if (pszSlash)
pszSlash[1] = 0; // Оставить слеш.
else
sModulePath[0] = 0; // Ошибка?
}
bool result = false;
HRESULT hrCoInitialized = CoInitializeEx(nullptr, COINIT_MULTITHREADED);
bCoInitialized = SUCCEEDED(hrCoInitialized);
_ASSERTE(bCoInitialized);
//wchar_t FullPath[MAX_PATH*2+15]; FullPath[0] = 0;
hGDIPlus = LoadLibraryW(L"GdiPlus.dll");
if (!hGDIPlus)
{
ReportFail(L"GdiPlus.dll not found!");
}
else
{
DllGetFunction(hGDIPlus, GdiplusStartup);
DllGetFunction(hGDIPlus, GdiplusShutdown);
DllGetFunction(hGDIPlus, GdipCreateBitmapFromFile);
DllGetFunction(hGDIPlus, GdipGetImageWidth);
DllGetFunction(hGDIPlus, GdipGetImageHeight);
DllGetFunction(hGDIPlus, GdipDisposeImage);
//DllGetFunction(hGDIPlus, GdipCreateHBITMAPFromBitmap);
DllGetFunction(hGDIPlus, GdipDrawImageI);
DllGetFunction(hGDIPlus, GdipCreateFromHDC);
DllGetFunction(hGDIPlus, GdipDeleteGraphics);
DllGetFunction(hGDIPlus, GdipGetDC);
DllGetFunction(hGDIPlus, GdipReleaseDC);
DllGetFunction(hGDIPlus, GdipGetImageGraphicsContext);
DllGetFunction(hGDIPlus, GdipBitmapConvertFormat); // may be absent in old versions of GdiPlus.dll
if (GdiplusStartup && GdiplusShutdown && GdipCreateBitmapFromFile
&& GdipGetImageWidth && GdipGetImageHeight
&& GdipDisposeImage //&& GdipCreateHBITMAPFromBitmap
&& GdipDrawImageI && GdipCreateFromHDC && GdipDeleteGraphics
&& GdipGetDC && GdipReleaseDC && GdipGetImageGraphicsContext
)
{
Gdiplus::GdiplusStartupInput gdiplusStartupInput;
Gdiplus::Status lRc = GdiplusStartup(&gdiplusToken, &gdiplusStartupInput, NULL);
result = (lRc == Gdiplus::Ok);
if (!result)
{
nLastError = GetLastError();
GdiplusShutdown(gdiplusToken); bTokenInitialized = false;
ReportFail(L"GdiplusStartup failed");
}
else
{
bTokenInitialized = true;
}
}
else
{
ReportFail(L"Functions not found in GdiPlus.dll");
}
if (!result)
FreeLibrary(hGDIPlus);
}
return result;
};
// При использовании в фаре GdiPlus иногда может зависать на FreeLibrary.
// Причины пока не выяснены
static DWORD WINAPI FreeThreadProc(LPVOID lpParameter)
{
struct GDIPlusDecoder* p = (struct GDIPlusDecoder*)lpParameter;
if (p && p->hGDIPlus)
{
FreeLibrary(p->hGDIPlus);
}
return 0;
}
void Close()
{
if (pImages)
{
pImages->Close();
pImages = NULL;
}
if (bTokenInitialized)
{
GdiplusShutdown(gdiplusToken);
bTokenInitialized = false;
}
if (hGDIPlus)
{
//FreeLibrary(hGDIPlus);
DWORD nFreeTID = 0, nWait = 0, nErr = 0;
HANDLE hFree = apiCreateThread(FreeThreadProc, this, &nFreeTID, "Bg::FreeThreadProc");
if (!hFree)
{
nErr = GetLastError();
FreeLibrary(hGDIPlus);
}
else
{
nWait = WaitForSingleObject(hFree, 5000);
if (nWait != WAIT_OBJECT_0)
apiTerminateThread(hFree, 100);
CloseHandle(hFree);
}
UNREFERENCED_PARAMETER(nErr);
hGDIPlus = NULL;
}
if (bCoInitialized)
{
bCoInitialized = FALSE;
CoUninitialize();
}
free(this);
};
CachedImage* GetImage(LPCWSTR asRelativeName)
{
if (!asRelativeName || !*asRelativeName)
return NULL;
size_t cchFullName = MAX_PATH*2;
wchar_t* szFullName = (wchar_t*)malloc(cchFullName*sizeof(*szFullName));
size_t cchName = MAX_PATH;
wchar_t* szName = (wchar_t*)malloc(cchName*sizeof(*szName));
size_t cchError = MAX_PATH*3;
wchar_t* szError = (wchar_t*)malloc(cchError*sizeof(*szError));
wchar_t* psz = NULL;
Gdiplus::Status lRc;
Gdiplus::GpBitmap *bmp = NULL;
Gdiplus::GpGraphics *gr = NULL;
CachedImage *pI = NULL, *pLast = NULL;
UINT nW = 0, nH = 0;
HDC hDc = NULL, hCompDc = NULL;
HBITMAP hBmp = NULL, hOldBmp = NULL;
const HDC hScreenDC = GetDC(0);
if (!szFullName || !szName || !szError)
{
ReportFail(L"Can't allocate memory for szFullName");
goto wrap;
}
if (*asRelativeName == L'\\' || *asRelativeName == L'/')
asRelativeName++;
// Заменить "/" на "\"
_wcscpy_c(szName, cchName, asRelativeName);
psz = wcschr(szName, L'/');
while (psz)
{
*psz = L'\\';
psz = wcschr(psz+1, L'/');
}
// Lowercase, для сравнения
CharLowerBuff(szName, lstrlen(szName));
// Может уже есть?
pI = pImages;
while (pI != NULL)
{
pLast = pI;
if (pI->bUsed && lstrcmp(pI->sImgName, szName) == 0)
{
goto wrap;
}
pI = pI->pNextImage;
}
// Загрузить из файла
_ASSERTE(pI == NULL);
pI = NULL;
_wcscpy_c(szFullName, cchFullName, sModulePath);
_wcscat_c(szFullName, cchFullName, szName);
lRc = GdipCreateBitmapFromFile(szFullName, &bmp);
if (lRc != Gdiplus::Ok)
{
swprintf_c(szError, cchError/*#SECURELEN*/, L"Can't load image, Err=%i\n%s", (int)lRc, szFullName);
ReportFail(szError);
_ASSERTE(bmp == NULL);
bmp = NULL;
goto wrap;
}
if (GdipBitmapConvertFormat)
{
Gdiplus::ColorPalette pal[2];
pal[0].Flags = Gdiplus::PaletteFlagsGrayScale;
pal[0].Count = 2;
pal[0].Entries[0] = (DWORD)0;
pal[0].Entries[1] = (DWORD)-1;
GdipBitmapConvertFormat(bmp, PixelFormat1bppIndexed, Gdiplus::DitherTypeSolid, Gdiplus::PaletteTypeFixedBW, pal, 0);
}
if (((lRc = GdipGetImageWidth(bmp, &nW)) != Gdiplus::Ok) || (GdipGetImageHeight(bmp, &nH) != Gdiplus::Ok)
|| (nW < 1) || (nH < 1))
{
swprintf_c(szError, cchError/*#SECURELEN*/, L"GetImageSize failed, Err=%i\n%s", (int)lRc, szFullName);
ReportFail(szError);
goto wrap;
}
hCompDc = CreateCompatibleDC(hScreenDC);
hBmp = CreateCompatibleBitmap(hScreenDC, nW, nH);
if (!hCompDc || !hBmp)
{
ReportFail(L"CreateCompatible[DC|Bitmap] failed");
goto wrap;
}
hOldBmp = (HBITMAP)SelectObject(hCompDc, hBmp);
lRc = GdipCreateFromHDC(hCompDc, &gr);
if (lRc != Gdiplus::Ok)
{
swprintf_c(szError, cchError/*#SECURELEN*/, L"GdipCreateFromHDC failed, Err=%i\n%s", (int)lRc, szFullName);
ReportFail(szError);
goto wrap;
}
lRc = GdipDrawImageI(gr, bmp, 0, 0);
if (lRc != Gdiplus::Ok)
{
swprintf_c(szError, cchError/*#SECURELEN*/, L"GdipDrawImageI failed, Err=%i\n%s", (int)lRc, szFullName);
ReportFail(szError);
goto wrap;
}
//lRc = GdipGetImageGraphicsContext(bmp, &gr);
//if (lRc != Gdiplus::Ok || !gr)
//{
// swprintf_c(szError, cchError/*#SECURELEN*/, L"GdipGetImageGraphicsContext failed, Err=%i\n%s", (int)lRc, szFullName);
// ReportFail(szError);
// goto wrap;
//}
lRc = GdipGetDC(gr, &hDc);
if (lRc != Gdiplus::Ok || !hDc)
{
swprintf_c(szError, cchError/*#SECURELEN*/, L"GdipGetDC failed, Err=%i\n%s", (int)lRc, szFullName);
ReportFail(szError);
goto wrap;
}
#ifdef _DEBUG
//SelectObject(hDc, (HPEN)GetStockObject(WHITE_PEN));
//MoveToEx(hDc, 0,0, NULL);
//LineTo(hDc, nW, nH);
/*{
RECT rcDbg = {nW/2,nH/2, nW, nH};
FillRect(hDc, &rcDbg, (HBRUSH)GetStockObject(WHITE_BRUSH));
//BitBlt(hScreenDC, 0, 0, nW, nH, hDc, 0, 0, SRCCOPY); // PATINVERT/PATPAINT?
}*/
#endif
// OK, теперь можно запомнить в кеше
if (!pLast)
{
_ASSERTE(pImages == NULL);
pImages = (CachedImage*)calloc(1,sizeof(CachedImage));
pI = pImages;
}
else
{
pI = (CachedImage*)calloc(1,sizeof(CachedImage));
pLast->pNextImage = pI;
}
if (!pI)
{
ReportFail(L"Can't allocate memory for CachedImage");
goto wrap;
}
// Done
if (!pI->Init(szName, hDc, nW, nH, hScreenDC))
{
if (pLast)
pLast->pNextImage = NULL;
if (pI == pImages)
pImages = NULL;
pI->Close();
pI = NULL;
goto wrap;
}
wrap:
if (szFullName)
free(szFullName);
if (szName)
free(szName);
if (szError)
free(szError);
if (hDc && gr)
GdipReleaseDC(gr, hDc);
if (gr)
GdipDeleteGraphics(gr);
if (hCompDc && hOldBmp)
SelectObject(hCompDc, hOldBmp);
if (hCompDc)
DeleteDC(hCompDc);
if (hBmp)
DeleteObject(hBmp);
if (bmp)
GdipDisposeImage(bmp);
if (hScreenDC)
ReleaseDC(0, hScreenDC);
return pI;
}
};
GDIPlusDecoder* gpDecoder = NULL;
bool GdipInit()
{
if (gbGdiPlusInitialized)
return true; // уже
_ASSERTE(XmlFile.cr && XmlFile.cr->IsInitialized());
// Загрузить его содержимое
CheckXmlFile(true);
// Инициализация XMLLite
ghXmlLite = LoadLibrary(L"xmllite.dll");
if (!ghXmlLite)
{
ReportFail(L"xmllite.dll not found");
}
else
{
gfCreateXmlReader = (CreateXmlReader_t)GetProcAddress(ghXmlLite, "CreateXmlReader");
if (!gfCreateXmlReader)
{
ReportFail(L"function CreateXmlReader in the xmllite.dll not found");
FreeLibrary(ghXmlLite);
ghXmlLite = NULL;
}
}
gpDecoder = (GDIPlusDecoder*)calloc(1,sizeof(*gpDecoder));
if (!gpDecoder->Init())
{
gpDecoder->Close();
gpDecoder = NULL;
}
gbGdiPlusInitialized = true;
return true;
}
void GdipDone()
{
if (!gbGdiPlusInitialized)
return; // Не выполнялось
MSectionLockSimple CS;
if (XmlFile.cr)
{
CS.Lock(XmlFile.cr);
}
if (ghXmlLite)
{
FreeLibrary(ghXmlLite);
ghXmlLite = NULL;
}
gfCreateXmlReader = NULL;
if (gpszXmlFile)
{
free(gpszXmlFile);
gpszXmlFile = NULL;
}
if (gpszXmlFolder)
{
free(gpszXmlFolder);
gpszXmlFolder = NULL;
}
if (XmlFile.FileData)
{
free(XmlFile.FileData);
XmlFile.FileData = NULL;
}
XmlFile.FileSize = 0;
if (ghXmlNotification && (ghXmlNotification != INVALID_HANDLE_VALUE))
{
FindCloseChangeNotification(ghXmlNotification);
ghXmlNotification = NULL;
}
if (XmlFile.cr)
{
CS.Unlock();
SafeDelete(XmlFile.cr);
}
if (gpDecoder)
{
gpDecoder->Close();
gpDecoder = NULL;
}
gbGdiPlusInitialized = false;
}
bool CompareNames(LPCWSTR asMaskList, LPWSTR asPath)
{
if (!asMaskList || !asPath)
return false;
if ((*asMaskList && !*asPath) || (*asPath && !*asMaskList))
return false;
wchar_t szMask[MAX_PATH];
while (*asMaskList)
{
LPCWSTR pszSep = wcschr(asMaskList, L'|');
if (pszSep)
{
int nLen = (int)std::min((INT_PTR)countof(szMask)-1,(INT_PTR)(pszSep-asMaskList));
lstrcpyn(szMask, asMaskList, nLen+1);
szMask[nLen] = 0;
}
else
{
lstrcpyn(szMask, asMaskList, countof(szMask));
}
wchar_t* pszSlash = wcschr(szMask, L'/');
while (pszSlash)
{
*pszSlash = L'\\';
pszSlash = wcschr(pszSlash+1, L'/');
}
if (FMatch(szMask, asPath))
return true;
if (!pszSep)
break;
asMaskList = pszSep+1;
}
return false;
}
struct RGBColor
{
union
{
COLORREF clr;
struct
{
BYTE R, G, B, Dummy;
};
};
};
void ParseColors(LPCWSTR asColors, BOOL abSwap/*RGB->COLORREF*/, COLORREF (&crValues)[32], int &nCount)
{
int i = 0;
wchar_t* pszEnd = NULL;
while (asColors && *asColors)
{
if (abSwap)
{
// Нам нужен COLORREF - это перевернутые R&B
RGBColor rgb = {}, bgr;
if (*asColors == L'#')
bgr.clr = wcstoul(asColors+1, &pszEnd, 16) & 0xFFFFFF;
else
bgr.clr = wcstoul(asColors, &pszEnd, 10) & 0xFFFFFF;
rgb.R = bgr.B;
rgb.G = bgr.G;
rgb.B = bgr.R;
crValues[i++] = rgb.clr;
}
else
{
RGBColor rgb;
if (*asColors == L'#')
rgb.clr = wcstoul(asColors+1, &pszEnd, 16) & 0xFFFFFF;
else
rgb.clr = wcstoul(asColors, &pszEnd, 10) & 0xFFFFFF;
crValues[i++] = rgb.clr;
}
if (pszEnd && *pszEnd == L'|')
asColors = pszEnd + 1;
else
break;
}
nCount = i;
//while (i < countof(crValues))
//{
// crValues[i++] = (COLORREF)-1;
//}
}
int FillPanelParams(PaintBackgroundArg* pBk, BkPanelInfo *pPanel, DrawInfo *pDraw)
{
int iFound = 0;
MStream strm;
IXmlReader* pXmlReader = NULL;
HRESULT hr = S_OK;
//int WindowType = -1;
struct ChunkInfo
{
enum {
ci_WindowNone = 0,
ci_WindowPanels = 1,
ci_WindowEditor = 2,
ci_WindowViewer = 3,
} WindowType;
enum {
ci_PanelNone = 0,
ci_PanelDrive = 1,
ci_PanelPlugin = 2,
ci_PanelTree = 3,
ci_PanelQView = 4,
ci_PanelInfo = 5,
} PanelType;
BOOL CondFailed;
bool Valid()
{
if (WindowType == ci_WindowNone)
return false;
if (WindowType == ci_WindowPanels)
{
if (PanelType == ci_PanelNone)
return false;
}
return true;
}
bool Equal(ChunkInfo* pTest)
{
if (pTest->WindowType == ci_WindowNone || pTest->WindowType != this->WindowType)
return false;
if (pTest->WindowType == ci_WindowPanels)
{
if (pTest->PanelType == ci_PanelNone || pTest->PanelType != this->PanelType)
return false;
}
if (CondFailed)
return false;
return true;
}
};
bool bFound = false;
ChunkInfo Test = {ChunkInfo::ci_WindowPanels, ChunkInfo::ci_PanelNone};
ChunkInfo Panel = {ChunkInfo::ci_WindowPanels, ChunkInfo::ci_PanelNone};
MSectionLockSimple CS;
LPWSTR pszFormat = lstrdup(pPanel->szFormat ? pPanel->szFormat : L"");
size_t nMaxLen = lstrlen(pPanel->szCurDir ? pPanel->szCurDir : L"");
LPWSTR pszPath = (wchar_t*)malloc((nMaxLen+2)*sizeof(*pszPath));
_wcscpy_c(pszPath, nMaxLen+1, pPanel->szCurDir ? pPanel->szCurDir : L"");
if (nMaxLen > 1 && pszPath[nMaxLen-1] != L'\\')
{
pszPath[nMaxLen] = L'\\';
pszPath[nMaxLen+1] = 0;
}
BOOL bTempPath = FALSE;
wchar_t szTemp[MAX_PATH+1];
// Проверка, путь - %TEMP%?
if (*pszPath)
{
if (!bTempPath)
{
lstrcpyn(szTemp, pszPath, countof(szTemp));
CharUpperBuff(szTemp, lstrlen(szTemp));
if (wcsstr(szTemp, L"\\TEMP\\") != NULL)
bTempPath = TRUE;
}
if (!bTempPath && GetTempPath(countof(szTemp)-1, szTemp))
{
szTemp[countof(szTemp)-1] = 0;
if (lstrcmpi(pszPath, szTemp) == 0)
bTempPath = TRUE;
}
}
pDraw->Flags = 0;
if (pBk->Place == pbp_Panels)
{
Panel.WindowType = ChunkInfo::ci_WindowPanels;
if (pPanel->bPlugin)
{
Panel.PanelType = ChunkInfo::ci_PanelPlugin;
}
else if (pPanel->nPanelType == PTYPE_FILEPANEL)
{
Panel.PanelType = ChunkInfo::ci_PanelDrive;
}
else
{
switch (pPanel->nPanelType)
{
case PTYPE_TREEPANEL:
Panel.PanelType = ChunkInfo::ci_PanelTree;
break;
case PTYPE_QVIEWPANEL:
Panel.PanelType = ChunkInfo::ci_PanelQView;
break;
case PTYPE_INFOPANEL:
Panel.PanelType = ChunkInfo::ci_PanelInfo;
break;
}
}
}
else if (pBk->Place == pbp_Editor || pBk->Place == pbp_Viewer)
{
Panel.WindowType = (pBk->Place == pbp_Editor) ? ChunkInfo::ci_WindowEditor : ChunkInfo::ci_WindowViewer;
}
else
{
_ASSERTE(pBk->Place == pbp_Panels || pBk->Place == pbp_Editor || pBk->Place == pbp_Viewer);
goto wrap;
}
CS.Lock(XmlFile.cr);
if (!XmlFile.FileData || !XmlFile.FileSize)
{
CS.Unlock();
goto wrap;
}
strm.SetData(XmlFile.FileData, XmlFile.FileSize);
CS.Unlock();
hr = gfCreateXmlReader(IID_IXmlReader, (void**)&pXmlReader, NULL);
if (SUCCEEDED(hr))
{
hr = pXmlReader->SetInput(&strm);
// read through the stream
XmlNodeType nodeType;
while (!iFound && (S_OK == (hr = pXmlReader->Read(&nodeType))))
{
PCWSTR pszName = NULL;
PCWSTR pszValue = NULL;
#ifdef _DEBUG
PCWSTR pszPrefix = NULL;
#endif
PCWSTR pszAttrName = NULL;
PCWSTR pszAttrValue = NULL;
switch (nodeType)
{
case XmlNodeType_EndElement:
hr = pXmlReader->GetLocalName(&pszName, NULL);
if (SUCCEEDED(hr))
{
bool bEndWindow = (lstrcmpi(pszName, L"window") == 0);
if (bEndWindow || (lstrcmpi(pszName, L"panel") == 0))
{
if (bEndWindow)
Test.WindowType = ChunkInfo::ci_WindowNone;
Test.PanelType = ChunkInfo::ci_PanelNone;
Test.CondFailed = FALSE;
if (bFound)
iFound = TRUE;
}
}
break;
case XmlNodeType_Element:
hr = pXmlReader->GetLocalName(&pszName, NULL);
if (FAILED(hr))
{
continue;
}
if (lstrcmpi(pszName, L"window") == 0)
{
// Сначала - сброс
Test.WindowType = ChunkInfo::ci_WindowNone;
// Смотрим атрибуты
hr = pXmlReader->MoveToFirstAttribute();
if (SUCCEEDED(hr))
{
do {
#ifdef _DEBUG
hr = pXmlReader->GetPrefix(&pszPrefix, NULL);
#endif
if (SUCCEEDED(hr = pXmlReader->GetLocalName(&pszAttrName, NULL)))
{
if (SUCCEEDED(hr = pXmlReader->GetValue(&pszAttrValue, NULL)))
{
if (lstrcmpi(pszAttrName, L"type") == 0)
{
if (lstrcmpi(pszAttrValue, L"PANELS") == 0 || lstrcmpi(pszAttrValue, L"PANEL") == 0)
Test.WindowType = ChunkInfo::ci_WindowPanels;
else if (lstrcmpi(pszAttrValue, L"EDITOR") == 0)
Test.WindowType = ChunkInfo::ci_WindowEditor;
else if (lstrcmpi(pszAttrValue, L"VIEWER") == 0)
Test.WindowType = ChunkInfo::ci_WindowViewer;
// Check
if (Test.WindowType != Panel.WindowType)
Test.CondFailed = TRUE;
}
}
}
} while (!Test.CondFailed && (hr = pXmlReader->MoveToNextAttribute()) == S_OK);
}
}
else if (lstrcmpi(pszName, L"panel") == 0)
{
if ((Test.WindowType == ChunkInfo::ci_WindowNone) || (Test.WindowType != Panel.WindowType))
{
Test.CondFailed = TRUE;
}
else
{
// Сначала - сброс
Test.PanelType = ChunkInfo::ci_PanelNone;
// Смотрим атрибуты
hr = pXmlReader->MoveToFirstAttribute();
if (SUCCEEDED(hr))
{
do {
#ifdef _DEBUG
hr = pXmlReader->GetPrefix(&pszPrefix, NULL);
#endif
if (SUCCEEDED(hr = pXmlReader->GetLocalName(&pszAttrName, NULL)))
{
if (SUCCEEDED(hr = pXmlReader->GetValue(&pszAttrValue, NULL)))
{
if (lstrcmpi(pszAttrName, L"type") == 0)
{
if (lstrcmpi(pszAttrValue, L"DRIVE") == 0)
Test.PanelType = ChunkInfo::ci_PanelDrive;
else if (lstrcmpi(pszAttrValue, L"PLUGIN") == 0)
Test.PanelType = ChunkInfo::ci_PanelPlugin;
else if (lstrcmpi(pszAttrValue, L"TREE") == 0)
Test.PanelType = ChunkInfo::ci_PanelTree;
else if (lstrcmpi(pszAttrValue, L"QVIEW") == 0)
Test.PanelType = ChunkInfo::ci_PanelQView;
else if (lstrcmpi(pszAttrValue, L"INFO") == 0)
Test.PanelType = ChunkInfo::ci_PanelInfo;
else
Test.PanelType = ChunkInfo::ci_PanelNone;
// Check
if (Test.PanelType != Panel.PanelType)
Test.CondFailed = TRUE;
}
else if (lstrcmpi(pszAttrName, L"drivetype") == 0)
{
DWORD nDriveType = DRIVE_UNKNOWN;
if (lstrcmpi(pszAttrValue, L"NO_ROOT_DIR") == 0)
nDriveType = DRIVE_NO_ROOT_DIR;
else if (lstrcmpi(pszAttrValue, L"REMOVABLE") == 0)
nDriveType = DRIVE_REMOVABLE;
else if (lstrcmpi(pszAttrValue, L"FIXED") == 0)
nDriveType = DRIVE_FIXED;
else if (lstrcmpi(pszAttrValue, L"REMOTE") == 0)
nDriveType = DRIVE_REMOTE;
else if (lstrcmpi(pszAttrValue, L"CDROM") == 0)
nDriveType = DRIVE_CDROM;
else if (lstrcmpi(pszAttrValue, L"RAMDISK") == 0)
nDriveType = DRIVE_RAMDISK;
else
nDriveType = DRIVE_UNKNOWN;
// Check
if (nDriveType != pDraw->nDriveType)
Test.CondFailed = TRUE;
}
else if (lstrcmpi(pszAttrName, L"pathtype") == 0)
{
if (lstrcmpi(pszAttrValue, L"TEMP") == 0)
{
if (!bTempPath)
Test.CondFailed = TRUE;
}
}
else if (lstrcmpi(pszAttrName, L"pathmatch") == 0)
{
if (!CompareNames(pszAttrValue, pszPath))
Test.CondFailed = TRUE;
}
else if (lstrcmpi(pszAttrName, L"format") == 0)
{
if (!CompareNames(pszAttrValue, pszFormat))
Test.CondFailed = TRUE;
}
}
}
} while (!Test.CondFailed && (hr = pXmlReader->MoveToNextAttribute()) == S_OK);
}
}
}
else if (Test.Valid() && Test.Equal(&Panel))
{
if (lstrcmpi(pszName, L"disabled") == 0)
{
pDraw->Flags |= DrawInfo::dif_Disabled;
iFound = TRUE;
break;
}
// Блок подошел, больше не проверяем
bFound = true;
// Смотрим, что там настроили
if (lstrcmpi(pszName, L"color") == 0)
{
// Смотрим атрибуты
hr = pXmlReader->MoveToFirstAttribute();
if (SUCCEEDED(hr))
{
do {
#ifdef _DEBUG
hr = pXmlReader->GetPrefix(&pszPrefix, NULL);
#endif
if (SUCCEEDED(hr = pXmlReader->GetLocalName(&pszAttrName, NULL)))
{
if (SUCCEEDED(hr = pXmlReader->GetValue(&pszAttrValue, NULL)))
{
if (lstrcmpi(pszAttrName, L"rgb") == 0)
{
// Нам нужен COLORREF - это перевернутые R&B
ParseColors(pszAttrValue, TRUE/*RGB->COLORREF*/, pDraw->crBack, pDraw->nBackCount);
pDraw->Flags |= DrawInfo::dif_BackFilled;
}
else if (lstrcmpi(pszAttrName, L"rgb_dark") == 0)
{
// Нам нужен COLORREF - это перевернутые R&B
ParseColors(pszAttrValue, TRUE/*RGB->COLORREF*/, pDraw->crDark, pDraw->nDarkCount);
pDraw->Flags |= DrawInfo::dif_DarkFilled;
}
else if (lstrcmpi(pszAttrName, L"rgb_light") == 0)
{
// Нам нужен COLORREF - это перевернутые R&B
ParseColors(pszAttrValue, TRUE/*RGB->COLORREF*/, pDraw->crLight, pDraw->nLightCount);
pDraw->Flags |= DrawInfo::dif_LightFilled;
}
else if (lstrcmpi(pszAttrName, L"bgr") == 0)
{
ParseColors(pszAttrValue, FALSE/*RGB->COLORREF*/, pDraw->crBack, pDraw->nBackCount);
pDraw->Flags |= DrawInfo::dif_BackFilled;
}
else if (lstrcmpi(pszAttrName, L"bgr_dark") == 0)
{
ParseColors(pszAttrValue, FALSE/*RGB->COLORREF*/, pDraw->crDark, pDraw->nDarkCount);
pDraw->Flags |= DrawInfo::dif_DarkFilled;
}
else if (lstrcmpi(pszAttrName, L"bgr_light") == 0)
{
ParseColors(pszAttrValue, FALSE/*RGB->COLORREF*/, pDraw->crLight, pDraw->nLightCount);
pDraw->Flags |= DrawInfo::dif_LightFilled;
}
else if (lstrcmpi(pszAttrName, L"shift") == 0)
{
if (lstrcmpi(pszAttrValue, L"yes") == 0)
pDraw->Flags |= DrawInfo::dif_ShiftBackColor;
}
}
}
} while ((hr = pXmlReader->MoveToNextAttribute()) == S_OK);
}
}
else if (lstrcmpi(pszName, L"space") == 0)
{
// Смотрим атрибуты
hr = pXmlReader->MoveToFirstAttribute();
if (SUCCEEDED(hr))
{
do {
#ifdef _DEBUG
hr = pXmlReader->GetPrefix(&pszPrefix, NULL);
#endif
if (SUCCEEDED(hr = pXmlReader->GetLocalName(&pszAttrName, NULL)))
{
if (SUCCEEDED(hr = pXmlReader->GetValue(&pszAttrValue, NULL)))
{
if (lstrcmpi(pszAttrName, L"type") == 0)
{
if (lstrcmpi(pszAttrValue, L"large") == 0)
pDraw->nSpaceBar = DrawInfo::dib_Large;
else if (lstrcmpi(pszAttrValue, L"off") == 0)
pDraw->nSpaceBar = DrawInfo::dib_Off;
else //if (lstrcmpi(pszAttrValue, L"small") == 0)
pDraw->nSpaceBar = DrawInfo::dib_Small;
}
}
}
} while ((hr = pXmlReader->MoveToNextAttribute()) == S_OK);
}
}
else if (lstrcmpi(pszName, L"title") == 0)
{
//TODO: Обработка функций
hr = pXmlReader->Read(&nodeType);
if (SUCCEEDED(hr) && (nodeType == XmlNodeType_Text))
{
hr = pXmlReader->GetValue(&pszValue, NULL);
//lstrcpyn(pDraw->szText, pszValue, countof(pDraw->szPic));
// szTemp
pDraw->szText[0] = 0;
szTemp[0] = 0;
wchar_t* pszDst = pDraw->szText;
wchar_t* pszEnd = pDraw->szText+countof(pDraw->szText)-1;
wchar_t* pszTemp = szTemp;
wchar_t* pszTempEnd = szTemp+countof(szTemp)-1;
bool bPlain = false;
while (TRUE)
{
if (*pszValue == L'"')
{
if (!bPlain)
{
bPlain = true;
}
else if (pszValue[1] == L'"')
{
pszValue++;
*(pszDst++) = L'"';
}
else
{
bPlain = false;
}
pszValue++;
}
else if (bPlain)
{
*(pszDst++) = *(pszValue++);
if (pszDst >= pszEnd)
break;
}
else if (!*pszValue || wcschr(L" \t\r\n+", *pszValue))
{
if (*szTemp)
{
*pszTemp = 0;
LPCWSTR pszVar = szTemp;
if (lstrcmpi(szTemp, L"VOLUME") == 0)
lstrcpyn(szTemp, pDraw->szVolume, countof(szTemp));
else if (lstrcmpi(szTemp, L"VOLUMESIZE") == 0)
lstrcpyn(szTemp, pDraw->szVolumeSize, countof(szTemp));
else if (lstrcmpi(szTemp, L"VOLUMEFREE") == 0)
lstrcpyn(szTemp, pDraw->szVolumeFree, countof(szTemp));
else if (lstrcmpi(szTemp, L"PANELFORMAT") == 0)
lstrcpyn(szTemp, pPanel->szFormat ? pPanel->szFormat : L"", countof(szTemp));
int nTempLen = lstrlen(pszVar);
if ((pszDst + nTempLen) >= pszEnd)
break;
lstrcpyn(pszDst, pszVar, nTempLen+1);
pszDst += nTempLen;
pszTemp = szTemp;
*szTemp = 0;
}
if (!*pszValue)
break;
pszValue++;
}
else
{
*(pszTemp++) = *(pszValue++);
if (pszTemp >= pszTempEnd)
break;
}
}
while ((pszDst > pDraw->szText) && (*(pszDst-1) == L' '))
pszDst--;
*pszDst = 0; // ASCIIZ
pDraw->Flags |= DrawInfo::dif_TextFilled;
}
}
else if (lstrcmpi(pszName, L"img") == 0)
{
if (SUCCEEDED(hr = pXmlReader->MoveToAttributeByName(L"ref", NULL)))
{
if (SUCCEEDED(hr = pXmlReader->GetValue(&pszAttrValue, NULL)))
{
lstrcpyn(pDraw->szPic, pszAttrValue, countof(pDraw->szPic));
pDraw->Flags |= DrawInfo::dif_PicFilled;
}
}
}
}
break;
default:
; // GCC warning elimination
}
} // end - while (!iFound && (S_OK == (hr = pXmlReader->Read(&nodeType))))
pXmlReader->Release();
}
wrap:
if (pszPath)
free(pszPath);
if (pszFormat)
free(pszFormat);
return iFound;
}
// HSB
#if 0
struct HSBColor
{
double Hue, Saturnation, Brightness;
};
struct RGBColor
{
union
{
COLORREF clr;
struct
{
BYTE Red, Green, Blue, Dummy;
};
};
};
void COLORREF2HSB(COLORREF rgbclr, HSBColor& hsb)
{
double minRGB, maxRGB, Delta;
double H, s, b;
RGBColor rgb; rgb.clr = rgbclr;
H = 0.0;
minRGB = std::min(std::min(rgb.Red, rgb.Green), rgb.Blue);
maxRGB = std::max(std::max(rgb.Red, rgb.Green), rgb.Blue);
Delta = (maxRGB - minRGB);
b = maxRGB;
if (maxRGB != 0.0)
{
s = 255.0 * Delta / maxRGB;
}
else
{
s = 0.0;
}
if (s != 0.0)
{
if (rgb.Red == maxRGB)
{
H = (rgb.Green - rgb.Blue) / Delta;
}
else if (rgb.Green == maxRGB)
{
H = 2.0 + (rgb.Blue - rgb.Red) / Delta;
}
else if (rgb.Blue == maxRGB)
{
H = 4.0 + (rgb.Red - rgb.Green) / Delta;
}
}
else
{
H = -1.0;
}
H = H * 60 ;
if (H < 0.0)
{
H = H + 360.0;
}
hsb.Hue = H;
hsb.Saturnation = s * 100 / 255;
hsb.Brightness = b * 100 / 255;
}
inline BYTE ClrPart(double v)
{
return (v < 0) ? 0 : (v > 1) ? 255 : (int)(v*255);
}
inline double Abs(double v)
{
return (v < 0) ? (-v) : v;
}
void HSB2COLORREF(const HSBColor& hsb, COLORREF& rgbclr)
{
RGBColor rgb = {};
double C, H1, m, X;
//C = (1 - Abs(2*(hsb.Brightness/100.0) - 1)) * (hsb.Saturnation/100.0);
C = (hsb.Brightness/100.0) * (hsb.Saturnation/100.0);
H1 = (hsb.Hue / 60);
X = C*(1 - Abs((H1 - 2*(int)(H1 / 2)) - 1));
m = 0;// (hsb.Brightness/100.0) - (C / 2); -- пока без доп.яркости
if ((hsb.Brightness == 0) || (hsb.Hue < 0 || hsb.Hue >= 360))
{
rgb.clr = 0;
}
else if (hsb.Saturnation == 0)
{
rgb.Red = rgb.Green = rgb.Blue = ClrPart(hsb.Brightness/100);
}
else
{
// double r=0,g=0,b=0;
// double temp1,temp2;
// temp2 = (((hsb.Brightness/100)<=0.5)
// ? (hsb.Brightness/100)*(1.0+(hsb.Saturnation/100))
// : (hsb.Brightness/100)+(hsb.Saturnation/100)-((hsb.Brightness/100)*(hsb.Saturnation/100)));
// temp1 = 2.0*(hsb.Brightness/100)-temp2;
//
// double t3[]={hsb.Hue/360+1.0/3.0,hsb.Hue/360,(hsb.Hue/360)-1.0/3.0};
// double clr[]={0,0,0};
// for(int i=0;i<3;i++)
// {
// if(t3[i]<0)
// t3[i]+=1.0;
// if(t3[i]>1)
// t3[i]-=1.0;
//
// if(6.0*t3[i] < 1.0)
// clr[i]=temp1+(temp2-temp1)*t3[i]*6.0;
// else if(2.0*t3[i] < 1.0)
// clr[i]=temp2;
// else if(3.0*t3[i] < 2.0)
// clr[i]=(temp1+(temp2-temp1)*((2.0/3.0)-t3[i])*6.0);
// else
// clr[i]=temp1;
// }
// r=clr[0];
// g=clr[1];
// b=clr[2];
//rgb.Red = ClrPart(255*r); rgb.Green = ClrPart(255*g); rgb.Blue = ClrPart(255*b);
if (0 <= H1 && H1 < 1)
{
rgb.Red = ClrPart(C+m); rgb.Green = ClrPart(X+m); rgb.Blue = ClrPart(0+m);
}
else if (1 <= H1 && H1 < 2)
{
rgb.Red = ClrPart(X+m); rgb.Green = ClrPart(C+m); rgb.Blue = ClrPart(0+m);
}
else if (2 <= H1 && H1 < 3)
{
rgb.Red = ClrPart(0+m); rgb.Green = ClrPart(C+m); rgb.Blue = ClrPart(X+m);
}
else if (3 <= H1 && H1 < 4)
{
rgb.Red = ClrPart(0+m); rgb.Green = ClrPart(X+m); rgb.Blue = ClrPart(C+m);
}
else if (4 <= H1 && H1 < 5)
{
rgb.Red = ClrPart(X+m); rgb.Green = ClrPart(0+m); rgb.Blue = ClrPart(C+m);
}
else if (5 <= H1 && H1 < 6)
{
rgb.Red = ClrPart(C+m); rgb.Green = ClrPart(0+m); rgb.Blue = ClrPart(X+m);
}
}
rgbclr = rgb.clr;
}
#endif
//#define RETURN_HSV(h, s, v) {HSV.H = h; HSV.S = s; HSV.V = v; return
//HSV;}
//
//#define RETURN_RGB(r, g, b) {RGB.R = r; RGB.G = g; RGB.B = b; return
//RGB;}
#define UNDEFINED 0
// Theoretically, hue 0 (pure red) is identical to hue 6 in these transforms. Pure
// red always maps to 6 in this implementation. Therefore UNDEFINED can be
// defined as 0 in situations where only unsigned numbers are desired.
//typedef struct {float R, G, B;} RGBType;
//
//typedef struct {float H, S, V;} HSVType;
struct HSVColor
{
int H; // (0..1)*360
int S; // (0..1)*100
int V; // (0..1)*100
};
void RGB2HSV(const RGBColor& rgb, HSVColor& HSV)
{
// rgb are each on [0, 1]. S and V are returned on [0, 1] and H is
// returned on [0, 1]. Exception: H is returned UNDEFINED if S==0.
int R = rgb.R, G = rgb.G, B = rgb.B, v, x, f;
int i;
x = std::min(R, G);
x = std::min(x, B);
v = std::max(R, G);
v = std::max(v, B);
if (v == x)
{
HSV.H = UNDEFINED;
HSV.S = 0;
HSV.V = v;
}
else if (v == 0)
{
_ASSERTE(v!=0);
HSV.H = UNDEFINED;
HSV.S = 0;
HSV.V = v;
}
else
{
f = (R == x) ? G - B : ((G == x) ? B - R : R - G); // -255 .. 255
i = (R == x) ? 3 : ((G == x) ? 5 : 1);
HSV.H = (((360*i) - ((360*f)/(v - x)))/6);
HSV.S = (100*(v - x))/v;
HSV.V = 100*v/255;
}
}
inline BYTE ClrPart(int v)
{
return (v < 0) ? 0 : (v > 100) ? 255 : (int)((v*255)/100);
}
void HSV2RGB(const HSVColor& HSV, RGBColor& rgb)
{
rgb.clr = 0;
// H is given on [0, 1] or UNDEFINED. S and V are given on [0, 1].
// rgb are each returned on [0, 1].
int h = HSV.H * 6, s = HSV.S, v = HSV.V, m, n, f;
int i;
//if (h == 0) h = 1;
if ((HSV.H < 0) /*== UNDEFINED*/ || (!HSV.H && !HSV.V))
{
rgb.R = rgb.G = rgb.B = ClrPart(v);
}
else
{
//i = floorf(h);
if (HSV.H < 60)
i = 0;
else if (HSV.H < 120)
i = 1;
else if (HSV.H < 180)
i = 2;
else if (HSV.H < 240)
i = 3;
else if (HSV.H < 300)
i = 4;
else if (HSV.H < 360)
i = 5;
else
i = 6;
//TODO:
f = h - i*360;
if(!(i & 1)) f = 360 - f; // if i is even
m = v * (100 - s) / 100;
n = v * (100 - s * f / 360) / 100;
#define RETURN_RGB(r,g,b) rgb.R = ClrPart(r); rgb.G = ClrPart(g); rgb.B = ClrPart(b);
switch (i)
{
case 6:
case 0: RETURN_RGB(v, n, m); break;
case 1: RETURN_RGB(n, v, m); break;
case 2: RETURN_RGB(m, v, n); break;
case 3: RETURN_RGB(m, n, v); break;
case 4: RETURN_RGB(n, m, v); break;
case 5: RETURN_RGB(v, m, n); break;
default: RETURN_RGB(0, 0, 0);
}
}
}
// Сколько линий в области статуса (без учета рамок)
int GetStatusLineCount(struct PaintBackgroundArg* pBk, BOOL bLeft)
{
if (!(pBk->FarPanelSettings.ShowStatusLine))
{
// Что-то при запуске (1.7x?) иногда картинки прыгают, как будто статус сразу не нашли
_ASSERTE(pBk->FarPanelSettings.ShowStatusLine);
return 0;
}
if ((bLeft ? pBk->LeftPanel.nPanelType : pBk->RightPanel.nPanelType) != PTYPE_FILEPANEL)
{
_ASSERTE(((UINT)(bLeft ? pBk->LeftPanel.nPanelType : pBk->RightPanel.nPanelType)) <= PTYPE_INFOPANEL);
return 0;
}
RECT rcPanel = bLeft ? pBk->LeftPanel.rcPanelRect : pBk->RightPanel.rcPanelRect;
if ((rcPanel.bottom-rcPanel.top) <= ((pBk->FarPanelSettings.ShowColumnTitles) ? 5 : 4))
return 1; // минимальная высота панели
COORD bufSize = {(SHORT)(rcPanel.right-rcPanel.left+1), std::min<SHORT>(10, (SHORT)(rcPanel.bottom-rcPanel.top))};
COORD bufCoord = {0,0};
HANDLE hStd = GetStdHandle(STD_OUTPUT_HANDLE);
CONSOLE_SCREEN_BUFFER_INFO csbi = {};
short nShiftX = 0, nShiftY = 0;
if (GetConsoleScreenBufferInfo(hStd, &csbi))
{
// Начиная с какой-то версии в фаре поменяли координаты :(
if (rcPanel.top <= 1)
{
nShiftY = csbi.dwSize.Y - (csbi.srWindow.Bottom - csbi.srWindow.Top + 1);
}
}
SMALL_RECT readRect = {
(SHORT)rcPanel.left + nShiftX,
(SHORT)(rcPanel.bottom-bufSize.Y)+nShiftY,
(SHORT)rcPanel.right+nShiftX,
(SHORT)rcPanel.bottom+nShiftY
};
PCHAR_INFO pChars = (PCHAR_INFO)malloc(bufSize.X*bufSize.Y*sizeof(*pChars));
if (!pChars)
{
_ASSERTE(pChars);
return 1;
}
int nLines = 0;
BOOL lbReadRc = ReadConsoleOutputW(hStd, pChars, bufSize, bufCoord, &readRect);
if (!lbReadRc)
{
_ASSERTE(lbReadRc);
}
else
{
for (int i = 2; i <= bufSize.Y; i++)
{
if ((pChars[bufSize.X*(bufSize.Y-i)].Char.UnicodeChar == ucBoxDblVertSinglRight)
|| (pChars[bufSize.X*(bufSize.Y-i)+bufSize.X-1].Char.UnicodeChar == ucBoxDblVertSinglLeft))
{
nLines = i - 1;
break;
}
}
}
// Что-то при запуске (1.7x?) иногда картинки прыгают, как будто статус сразу не нашли
#ifdef _DEBUG
int nArea = -1;
if (nLines<1)
{
static bool bWarnLines = false;
if (!bWarnLines)
{
nArea = GetMacroArea();
if (nArea == 1/*MACROAREA_SHELL*/ || nArea == 5/*MACROAREA_SEARCH*/)
{
bWarnLines = true;
// Far 3.0.3716. Assert при старте. Плагин активирован, а панелей на экране еще НЕТ.
_ASSERTE(nLines>0);
}
}
}
#endif
free(pChars);
return nLines;
}
void FormatSize(ULARGE_INTEGER size, wchar_t* out)
{
if (size.QuadPart)
{
// Сформатировать размер
uint64_t lSize = size.QuadPart, lDec = 0;
const wchar_t *SizeSymbol[]={L"B",L"KB",L"MB",L"GB",L"TB",L"PB"};
for (size_t n = 0; n < countof(SizeSymbol); n++)
{
if (lSize < 1000)
{
if (lDec > 0 && lDec < 10 && lSize < 10)
swprintf_c(out, MAX_PATH/*#SECURELEN*/, L"%u.%u %s", (UINT)lSize, (UINT)lDec, SizeSymbol[n]);
else
swprintf_c(out, MAX_PATH/*#SECURELEN*/, L"%u %s", (UINT)lSize, SizeSymbol[n]);
break;
}
uint64_t lNext = lSize >> 10;
lDec = (lSize % 1024) / 100;
lSize = lNext;
}
//if (!*szVolumeSize)
//{
// swprintf_c(szVolumeSize, MAX_PATH/*#SECURELEN*/, L"%u %s", (UINT)lSize, SizeSymbol[countof(SizeSymbol)-1]);
//}
}
}
int PaintPanel(struct PaintBackgroundArg* pBk, BOOL bLeft, COLORREF& crOtherColor, int& cOtherDrive)
{
DrawInfo* pDraw = (DrawInfo*)calloc(sizeof(*pDraw), 1);
if (!pDraw)
return FALSE;
wchar_t szDbg[128];
// Инициализация и начальное определение размеров и прочего...
int nStatusLines = GetStatusLineCount(pBk, bLeft);
RECT rcPanel = bLeft ? pBk->rcDcLeft : pBk->rcDcRight;
RECT rcConPanel = bLeft ? pBk->LeftPanel.rcPanelRect : pBk->RightPanel.rcPanelRect;
BkPanelInfo *bkInfo = bLeft ? &pBk->LeftPanel : &pBk->RightPanel;
// Не должен содержать рамки
int nPanelWidth = std::max<int>(1, rcConPanel.right - rcConPanel.left + 1); // ширина в символах
int nPanelHeight = std::max<int>(1, rcConPanel.bottom - rcConPanel.top + 1); // высота в символах
RECT rcWork = {}; //rcPanel;
rcWork.left = rcPanel.left + ((rcPanel.right - rcPanel.left + 1) / nPanelWidth);
rcWork.right = rcPanel.right - ((rcPanel.right - rcPanel.left + 1) / nPanelWidth);
rcWork.top = rcPanel.top + ((rcPanel.bottom - rcPanel.top + 1) / nPanelHeight);
rcWork.bottom = rcPanel.bottom - ((rcPanel.bottom - rcPanel.top + 1) / nPanelHeight);
RECT rcInt = rcWork;
if (nStatusLines > 0)
rcInt.bottom -= ((rcPanel.bottom - rcPanel.top + 1) * (nStatusLines + 1) / nPanelHeight);
int nMaxPicSize = (rcInt.bottom - rcInt.top) * 35 / 100;
ULARGE_INTEGER llTotalSize = {}, llFreeSize = {};
UINT nDriveType = DRIVE_UNKNOWN;
BOOL bProgressAllowed = FALSE; // Градусник свободного места
int nMaxVolumeLen = lstrlen(bkInfo->szCurDir ? bkInfo->szCurDir : L"");
wchar_t* szVolumeRoot = (wchar_t*)calloc(nMaxVolumeLen+2,sizeof(*szVolumeRoot));
wchar_t* szVolumeSize = (wchar_t*)calloc(MAX_PATH,sizeof(*szVolumeSize));
wchar_t* szVolumeFree = (wchar_t*)calloc(MAX_PATH,sizeof(*szVolumeFree));
wchar_t* szVolume = (wchar_t*)calloc(MAX_PATH,sizeof(*szVolume));
if (bkInfo->szCurDir && *bkInfo->szCurDir)
{
if (!bkInfo->bPlugin)
{
// Определить размер свободного места на диске
bool lbSizeOk = false, lbTypeOk = false;
_wcscpy_c(szVolumeRoot, nMaxVolumeLen+2, bkInfo->szCurDir);
if (szVolumeRoot[nMaxVolumeLen-1] != L'\\')
{
szVolumeRoot[nMaxVolumeLen++] = L'\\';
szVolumeRoot[nMaxVolumeLen] = 0;
}
int nLen = lstrlen(szVolumeRoot);
while (!(lbSizeOk && lbTypeOk) && (nLen > 0))
{
// To determine whether a drive is a USB-type drive,
// call SetupDiGetDeviceRegistryProperty and specify the SPDRP_REMOVAL_POLICY property.
ULARGE_INTEGER llTotal = {}, llFree = {};
UINT nType = DRIVE_UNKNOWN;
if (!lbSizeOk && GetDiskFreeSpaceEx(szVolumeRoot, &llFree, &llTotal, NULL))
{
llTotalSize.QuadPart = llTotal.QuadPart;
llFreeSize.QuadPart = llFree.QuadPart;
lbSizeOk = TRUE;
}
if (!lbTypeOk && ((nType = GetDriveType(szVolumeRoot)) != DRIVE_UNKNOWN))
{
nDriveType = nType;
lbTypeOk = TRUE;
}
// Если не все определили - пробуем откусить папку
if (!lbSizeOk || !lbTypeOk)
{
if (szVolumeRoot[nLen-1] != L'\\')
{
_ASSERTE(szVolumeRoot[nLen-1] == L'\\');
break;
}
szVolumeRoot[--nLen] = 0;
// Найти следующий слеш
while ((nLen > 0) && (szVolumeRoot[nLen-1] != L'\\'))
nLen--;
// Пропустить все слеши
while ((nLen > 0) && (szVolumeRoot[nLen-1] == L'\\'))
nLen--;
// Откусить
szVolumeRoot[nLen] = 0;
}
}
FormatSize(llTotalSize, szVolumeSize);
FormatSize(llFreeSize, szVolumeFree);
}
// Извлечь "Букву" диска
LPCWSTR psz = bkInfo->szCurDir;
if (psz[0] == L'\\' && psz[1] == L'\\' && (psz[2] == L'.' || psz[2] == L'?') && psz[3] == L'\\')
{
psz += 4;
if (psz[0] == L'U' && psz[1] == L'N' && psz[2] == L'C' && psz[3] == L'\\')
psz += 4;
}
LPCWSTR pszSlash = wcschr(psz, L'\\');
if (!pszSlash)
pszSlash = wcschr(psz, L'/');
if (!pszSlash)
pszSlash = psz + lstrlen(psz);
if (pszSlash > psz)
lstrcpyn(szVolume, psz, (int)(pszSlash - psz + 1));
}
pDraw->szVolume = szVolume;
pDraw->szVolumeRoot = szVolumeRoot;
pDraw->szVolumeSize = szVolumeSize;
pDraw->szVolumeFree = szVolumeFree;
pDraw->nDriveType = nDriveType;
if (nDriveType != DRIVE_UNKNOWN && nDriveType != DRIVE_CDROM && nDriveType != DRIVE_NO_ROOT_DIR)
{
bProgressAllowed = TRUE;
}
else
{
bProgressAllowed = FALSE;
}
// Если есть xml - получить из него настройки для текущего случая
if (gfCreateXmlReader && XmlFile.FileData && XmlFile.FileSize)
{
FillPanelParams(pBk, bkInfo, pDraw);
}
if ((pDraw->Flags & DrawInfo::dif_Disabled))
{
if (pBk->dwLevel == 0)
{
DWORD nPanelBackIdx = CONBACKCOLOR(pBk->nFarColors[col_PanelText]);
COLORREF crPanel = pBk->crPalette[nPanelBackIdx];
swprintf_c(szDbg, L"ConEmuBk: Disabled %s - {%i,%i,%i,%i) #%06X\n",
bLeft ? L"Left" : L"Right", rcConPanel.left, rcConPanel.top, rcConPanel.right, rcConPanel.bottom,
crPanel);
DBGSTR(szDbg);
HBRUSH hBr = CreateSolidBrush(crPanel);
FillRect(pBk->hdc, &rcPanel, hBr);
DeleteObject(hBr);
}
}
else
{
// Если не было задано - инициализируем умолчания
if (!(pDraw->Flags & DrawInfo::dif_BackFilled))
{
if (bkInfo->bPlugin)
{
pDraw->crBack[0] = RGB(128,128,128);
}
else
{
switch (nDriveType)
{
case DRIVE_REMOVABLE:
pDraw->crBack[0] = 0x00D98C; break;
case DRIVE_REMOTE:
pDraw->crBack[0] = 0xFF00E6; break;
case DRIVE_CDROM:
pDraw->crBack[0] = 0x7E00FF; break;
case DRIVE_RAMDISK:
pDraw->crBack[0] = 0x008080; break;
default:
pDraw->crBack[0] = 0xFF0000;
}
pDraw->Flags |= DrawInfo::dif_ShiftBackColor;
}
pDraw->nBackCount = 1;
}
int nLetter = 0;
if ((pDraw->Flags & DrawInfo::dif_ShiftBackColor) && pDraw->crBack && (szVolume[1] == L':'))
{
nLetter = (szVolume[0] >= L'a' && szVolume[0] <= L'b') ? (szVolume[0] - L'a' + 24) :
(szVolume[0] >= L'c' && szVolume[0] <= L'z') ? (szVolume[0] - L'c') :
(szVolume[0] >= L'A' && szVolume[0] <= L'B') ? (szVolume[0] - L'A' + 24) :
(szVolume[0] >= L'C' && szVolume[0] <= L'Z') ? (szVolume[0] - L'C') :
0;
if (pDraw->nBackCount > 0)
{
_ASSERTE(pDraw->nBackCount <= countof(pDraw->crBack));
pDraw->crBack[0] = pDraw->crBack[nLetter % pDraw->nBackCount];
}
else
{
// Сконвертить в HSV, сдвинуть, и обратно в COLORREF
int nShift = (nLetter % 5) * 15;
HSVColor hsv = {};
RGBColor rgb; rgb.clr = *pDraw->crBack;
//COLORREF2HSB(pDraw->crBack, hsb);
RGB2HSV(rgb, hsv);
#ifdef _DEBUG
HSV2RGB(hsv, rgb);
#endif
//hsv.H += nShift;
hsv.S -= nShift;
if (hsv.S < 0) hsv.S += 100;
hsv.V = hsv.V / 2;
HSV2RGB(hsv, rgb);
//hsv.Brightness *= 0.7;
//HSB2COLORREF(hsb, clr);
if (bLeft)
{
crOtherColor = rgb.clr;
cOtherDrive = nLetter;
}
else if ((rgb.clr == crOtherColor) && (cOtherDrive != nLetter))
{
hsv.H += 15;
HSV2RGB(hsv, rgb);
}
pDraw->crBack[0] = rgb.clr;
}
}
// Цвет спрайтов, текста, фона градусника
if (!(pDraw->Flags & DrawInfo::dif_DarkFilled))
{
RGBColor rgb; rgb.clr = *pDraw->crBack;
rgb.R = (BYTE)((int)rgb.R * 2 / 3);
rgb.G = (BYTE)((int)rgb.G * 2 / 3);
rgb.B = (BYTE)((int)rgb.B * 2 / 3);
pDraw->crDark[0] = rgb.clr;
pDraw->nDarkCount = 1;
}
else if (pDraw->Flags & DrawInfo::dif_ShiftBackColor)
{
if (pDraw->nDarkCount > 0)
{
_ASSERTE(pDraw->nDarkCount <= countof(pDraw->crDark));
pDraw->crDark[0] = pDraw->crDark[nLetter % pDraw->nDarkCount];
}
}
// Цвет градусника
if (!(pDraw->Flags & DrawInfo::dif_LightFilled))
{
HSVColor hsv = {};
RGBColor rgb; rgb.clr = *pDraw->crBack;
RGB2HSV(rgb, hsv);
hsv.H += 20;
hsv.S = std::min(100,hsv.S+25);
hsv.V = std::min(100,hsv.V+25);
HSV2RGB(hsv, rgb);
pDraw->crLight[0] = rgb.clr;
pDraw->nLightCount = 1;
}
else if (pDraw->Flags & DrawInfo::dif_ShiftBackColor)
{
if (pDraw->nLightCount > 0)
{
_ASSERTE(pDraw->nLightCount <= countof(pDraw->crLight));
pDraw->crLight[0] = pDraw->crLight[nLetter % pDraw->nLightCount];
}
}
if (!(pDraw->Flags & DrawInfo::dif_PicFilled))
{
if (bkInfo->bPlugin)
{
wcscpy_c(pDraw->szPic, L"img/plugin.png");
}
else
{
switch (nDriveType)
{
case DRIVE_REMOVABLE:
wcscpy_c(pDraw->szPic, L"img/drive_removable.png"); break;
case DRIVE_REMOTE:
wcscpy_c(pDraw->szPic, L"img/drive_network.png"); break;
case DRIVE_CDROM:
wcscpy_c(pDraw->szPic, L"img/drive_cdrom.png"); break;
case DRIVE_RAMDISK:
wcscpy_c(pDraw->szPic, L"img/drive_ramdisk.png"); break;
default:
wcscpy_c(pDraw->szPic, L"img/drive_fixed.png");
}
}
}
if (!(pDraw->Flags & DrawInfo::dif_TextFilled))
{
TODO("Размер диска");
wcscpy_c(pDraw->szText, szVolume);
}
// Поехали рисовать
if (pBk->dwLevel == 0)
{
swprintf_c(szDbg, L"ConEmuBk: %s - {%i,%i,%i,%i) #%06X\n",
bLeft ? L"Left" : L"Right", rcConPanel.left, rcConPanel.top, rcConPanel.right, rcConPanel.bottom,
*pDraw->crBack);
DBGSTR(szDbg);
HBRUSH hBrush = CreateSolidBrush(*pDraw->crBack);
FillRect(pBk->hdc, &rcPanel, hBrush);
DeleteObject(hBrush);
}
LOGFONT lf = {};
lf.lfHeight = std::max<LONG>(20, (rcInt.bottom - rcInt.top) * 12 / 100);
lf.lfWeight = 700;
lstrcpy(lf.lfFaceName, L"Arial");
// GO
HFONT hText = CreateFontIndirect(&lf);
HFONT hOldFont = (HFONT)SelectObject(pBk->hdc, hText);
#define IMG_SHIFT_X 0
#define IMG_SHIFT_Y 0
#define LINE_SHIFT_Y (lf.lfHeight)
#define LINE_SHIFT_X (lf.lfHeight/6)
// Determine appropriate font size:
int nY = std::max(rcInt.top, rcInt.bottom - (LINE_SHIFT_Y));
RECT rcText = {rcInt.left+IMG_SHIFT_X, nY, rcInt.right-LINE_SHIFT_X, nY+LINE_SHIFT_Y};
RECT rcTemp = rcText;
DrawText(pBk->hdc, pDraw->szText, -1, &rcTemp, DT_HIDEPREFIX|DT_RIGHT|DT_SINGLELINE|DT_TOP|DT_CALCRECT);
LONG width = rcText.right - rcText.left;
LONG actualWidth = rcTemp.right - rcTemp.left;
if (actualWidth > width)
{
// Delete current font:
SelectObject(pBk->hdc, hOldFont);
DeleteObject(hText);
// Create new font of appropriate size:
lf.lfHeight = lf.lfHeight * width / actualWidth;
hText = CreateFontIndirect(&lf);
hOldFont = (HFONT)SelectObject(pBk->hdc, hText);
}
CachedImage* pI = NULL;
if (gpDecoder && *pDraw->szPic)
{
pI = gpDecoder->GetImage(pDraw->szPic);
if (pI)
{
int nPicDim = std::max(pI->nWidth,pI->nHeight);
int nW = std::min(nMaxPicSize,nPicDim), nH = std::min(nMaxPicSize,nPicDim); //TODO: Пропорционально pI->nWidth/pI->nHeight
if (pI && (rcWork.top <= (rcText.top - nH - IMG_SHIFT_Y)) && (rcWork.left <= (rcWork.right - nW - IMG_SHIFT_X)))
{
// - картинки чисто черного цвета
#if 0
const HDC hScreenDC = GetDC(0);
HDC hReadyDC = CreateCompatibleDC(hScreenDC);
HBITMAP hReadyBmp = CreateCompatibleBitmap(hScreenDC, nW, nH);
HBITMAP hOldReadyBmp = (HBITMAP)SelectObject(hReadyDC, hReadyBmp);
StretchBlt(hReadyDC, 0, 0, nW, nH, pI->hDc, 0,0, pI->nWidth, pI->nHeight, SRCCOPY);
BitBlt(pBk->hdc, rcWork.right - nW - IMG_SHIFT_X, rcText.top - nH - IMG_SHIFT_Y, nW, nH,
hReadyDC, 0,0, SRCAND);
SelectObject(hReadyDC, hOldReadyBmp);
DeleteObject(hReadyBmp);
DeleteDC(hReadyDC);
ReleaseDC(0, hScreenDC);
#endif
// OK
#if 1
const HDC hScreenDC = GetDC(0);
HDC hMaskDC = CreateCompatibleDC(hScreenDC);
HBITMAP hMaskBmp = CreateCompatibleBitmap(hScreenDC, pI->nWidth, pI->nHeight);
HBITMAP hOldMaskBmp = (HBITMAP)SelectObject(hMaskDC, hMaskBmp);
StretchBlt(hMaskDC, 0, 0, nW, nH, pI->hDc, 0,0, pI->nWidth, pI->nHeight, NOTSRCCOPY);
HDC hInvDC = CreateCompatibleDC(hScreenDC);
HBITMAP hInvBmp = CreateCompatibleBitmap(hScreenDC, pI->nWidth, pI->nHeight);
HBITMAP hOldInvBmp = (HBITMAP)SelectObject(hInvDC, hInvBmp);
HBRUSH hDarkBr = CreateSolidBrush(*pDraw->crDark);
HBRUSH hOldBr = (HBRUSH)SelectObject(hInvDC, hDarkBr);
BitBlt(hInvDC, 0, 0, nW, nH,
hMaskDC, 0,0, MERGECOPY);
SelectObject(hInvDC, hOldBr);
HDC hReadyDC = CreateCompatibleDC(hScreenDC);
HBITMAP hReadyBmp = CreateCompatibleBitmap(hScreenDC, nW, nH);
HBITMAP hOldReadyBmp = (HBITMAP)SelectObject(hReadyDC, hReadyBmp);
HBRUSH hBackBr = CreateSolidBrush(*pDraw->crBack);
hOldBr = (HBRUSH)SelectObject(hReadyDC, hBackBr);
BitBlt(hMaskDC, 0, 0, nW, nH,
hMaskDC, 0,0, DSTINVERT);
BitBlt(hReadyDC, 0, 0, nW, nH,
hMaskDC, 0,0, MERGECOPY);
SelectObject(hReadyDC, hOldBr);
BitBlt(hReadyDC, 0, 0, nW, nH,
hInvDC, 0,0, SRCPAINT);
DeleteObject(hDarkBr);
DeleteObject(hBackBr);
BitBlt(pBk->hdc, rcWork.right - nW - IMG_SHIFT_X, rcText.top - nH - IMG_SHIFT_Y, nW, nH,
hReadyDC, 0,0, SRCCOPY);
SelectObject(hReadyDC, hOldReadyBmp);
DeleteObject(hReadyBmp);
DeleteDC(hReadyDC);
SelectObject(hInvDC, hOldInvBmp);
DeleteObject(hInvBmp);
DeleteDC(hInvDC);
SelectObject(hMaskDC, hOldMaskBmp);
DeleteObject(hMaskBmp);
DeleteDC(hMaskDC);
ReleaseDC(0, hScreenDC);
#endif
#if 0
const HDC hScreenDC = GetDC(0);
HDC hInvDC = CreateCompatibleDC(hScreenDC);
HBITMAP hInvBmp = CreateCompatibleBitmap(hScreenDC, pI->nWidth, pI->nHeight);
HBITMAP hOldInvBmp = (HBITMAP)SelectObject(hInvDC, hInvBmp);
RECT rcFill = {0,0,pI->nWidth, pI->nHeight};
HBRUSH hDarkBr = CreateSolidBrush(/*RGB(128,128,128)*/ *pDraw->crDark);
FillRect(hInvDC, &rcFill, hDarkBr);
DeleteObject(hDarkBr);
BitBlt(hInvDC, 0, 0, pI->nWidth, pI->nHeight,
pI->hDc, 0,0, SRCAND);
HDC hReadyDC = CreateCompatibleDC(hScreenDC);
HBITMAP hReadyBmp = CreateCompatibleBitmap(hScreenDC, nW, nH);
HBITMAP hOldReadyBmp = (HBITMAP)SelectObject(hReadyDC, hReadyBmp);
//SetStretchBltMode(hReadyDC, HALFTONE);
rcFill.right = nW; rcFill.bottom = nH;
FillRect(hReadyDC, &rcFill, (HBRUSH)GetStockObject(BLACK_BRUSH));
StretchBlt(hReadyDC, 0, 0, nW, nH, hInvDC, 0,0, pI->nWidth, pI->nHeight, SRCINVERT);
BitBlt(pBk->hdc, rcWork.right - nW - IMG_SHIFT_X, rcText.top - nH - IMG_SHIFT_Y, nW, nH,
hReadyDC, 0,0, SRCCOPY);
SelectObject(hReadyDC, hOldReadyBmp);
DeleteObject(hReadyBmp);
DeleteDC(hReadyDC);
ReleaseDC(0, hScreenDC);
#endif
// - Черная окантовка вокруг плагиновой картинки
#if 0
const HDC hScreenDC = GetDC(0);
HDC hInvDC = CreateCompatibleDC(hScreenDC);
HBITMAP hInvBmp = CreateCompatibleBitmap(hScreenDC, pI->nWidth, pI->nHeight);
HBITMAP hOldInvBmp = (HBITMAP)SelectObject(hInvDC, hInvBmp);
BitBlt(hInvDC, 0, 0, pI->nWidth, pI->nHeight, pI->hDc, 0,0, SRCCOPY); //NOTSRCCOPY
HDC hCompDC = CreateCompatibleDC(hScreenDC);
HBITMAP hCompBmp = CreateCompatibleBitmap(hScreenDC, pI->nWidth, pI->nHeight);
HBITMAP hOldCompBmp = (HBITMAP)SelectObject(hCompDC, hCompBmp);
HDC hBackDC = CreateCompatibleDC(hScreenDC);
HBITMAP hBackBmp = CreateCompatibleBitmap(hScreenDC, pI->nWidth, pI->nHeight);
HBITMAP hOldBackBmp = (HBITMAP)SelectObject(hBackDC, hBackBmp);
HBRUSH hPaintBr = CreateSolidBrush(*pDraw->crDark);
HBRUSH hBackBr = CreateSolidBrush(*pDraw->crBack);
RECT rcFill = {0,0,pI->nWidth, pI->nHeight};
HBRUSH hOldCompBr = (HBRUSH)SelectObject(hCompDC, hBackBr);
BitBlt(hCompDC, 0, 0, pI->nWidth, pI->nHeight, hInvDC, 0,0, MERGECOPY);
BitBlt(hInvDC, 0, 0, pI->nWidth, pI->nHeight, pI->hDc, 0,0, NOTSRCCOPY);
HBRUSH hOldBackBr = (HBRUSH)SelectObject(hBackDC, hPaintBr);
BitBlt(hBackDC, 0, 0, pI->nWidth, pI->nHeight, hInvDC, 0,0, MERGECOPY);
BitBlt(hCompDC, 0, 0, pI->nWidth, pI->nHeight, hBackDC, 0,0, SRCPAINT);
HDC hReadyDC = CreateCompatibleDC(hScreenDC);
HBITMAP hReadyBmp = CreateCompatibleBitmap(hScreenDC, nW, nH);
HBITMAP hOldReadyBmp = (HBITMAP)SelectObject(hReadyDC, hReadyBmp);
StretchBlt(hReadyDC, 0, 0, nW, nH, hCompDC, 0,0, pI->nWidth, pI->nHeight, SRCCOPY); //NOTSRCCOPY
BOOL lbBitRc = BitBlt(pBk->hdc, rcWork.right - nW - IMG_SHIFT_X, rcText.top - nH - IMG_SHIFT_Y, nW, nH,
hReadyDC, 0,0, SRCCOPY);
SelectObject(hReadyDC, hOldReadyBmp);
DeleteObject(hReadyBmp);
DeleteDC(hReadyDC);
DeleteObject(hPaintBr);
SelectObject(hCompDC, hOldCompBr);
DeleteObject(hBackBr);
SelectObject(hInvDC, hOldInvBmp);
DeleteObject(hInvBmp);
DeleteDC(hInvDC);
SelectObject(hCompDC, hOldCompBmp);
DeleteObject(hCompBmp);
DeleteDC(hCompDC);
SelectObject(hBackDC, hOldBackBmp);
DeleteObject(hBackBmp);
DeleteDC(hBackDC);
ReleaseDC(0, hScreenDC);
#endif
}
}
}
SetBkMode(pBk->hdc, TRANSPARENT);
SetTextColor(pBk->hdc, *pDraw->crDark);
DrawText(pBk->hdc, pDraw->szText, -1, &rcText, DT_HIDEPREFIX|DT_RIGHT|DT_SINGLELINE|DT_TOP);
/*
OffsetRect(&rcText, 0, LINE_SHIFT_Y);
swprintf_c(szText, L"Volume: «%s» %s, Format: «%s»", szVolume, szVolumeSize, bkInfo->szFormat ? bkInfo->szFormat : L"");
DrawText(pBk->hdc, szText, -1, &rcText, DT_HIDEPREFIX|DT_RIGHT|DT_SINGLELINE|DT_TOP);
OffsetRect(&rcText, 0, LINE_SHIFT_Y);
if (bkInfo->szCurDir)
DrawText(pBk->hdc, bkInfo->szCurDir, -1, &rcText, DT_HIDEPREFIX|DT_RIGHT|DT_SINGLELINE|DT_TOP|DT_PATH_ELLIPSIS);
OffsetRect(&rcText, 0, LINE_SHIFT_Y);
*/
TODO("В Far3 можно и в плагинах свободное место получить");
if (bProgressAllowed && pDraw->nSpaceBar == DrawInfo::dib_Off)
bProgressAllowed = FALSE;
if (bProgressAllowed && (nStatusLines > 0) && !bkInfo->bPlugin && llTotalSize.QuadPart)
{
//llTotalSize = {},
HBRUSH hUsedBr = CreateSolidBrush(*pDraw->crLight);
HBRUSH hFreeBr = CreateSolidBrush(*pDraw->crDark);
RECT rcUsed = (pDraw->nSpaceBar == DrawInfo::dib_Small) ? rcWork : rcPanel;
int iShift = (pDraw->nSpaceBar == DrawInfo::dib_Small) ? 0 : 2;
rcUsed.top = rcUsed.bottom - (nStatusLines+iShift) * ((rcPanel.bottom - rcPanel.top + 1) / nPanelHeight);
rcUsed.right = rcUsed.right - (int)((uint64_t)(rcUsed.right - rcUsed.left + 1) * llFreeSize.QuadPart / llTotalSize.QuadPart);
if (rcUsed.right > rcWork.right)
{
_ASSERTE(rcUsed.right <= rcWork.right);
rcUsed.right = rcWork.right;
}
else if (rcUsed.right < rcWork.left)
{
_ASSERTE(rcUsed.right >= rcWork.left);
rcUsed.right = rcWork.left;
}
RECT rcFree = rcUsed;
rcFree.left = rcUsed.right;
rcFree.right = (pDraw->nSpaceBar == DrawInfo::dib_Small) ? rcWork.right : rcPanel.right;
FillRect(pBk->hdc, &rcFree, hFreeBr);
FillRect(pBk->hdc, &rcUsed, hUsedBr);
DeleteObject(hUsedBr);
DeleteObject(hFreeBr);
}
SelectObject(pBk->hdc, hOldFont);
DeleteObject(hText);
}
// Free pointers
free(pDraw);
free(szVolume);
free(szVolumeSize);
free(szVolumeFree);
return TRUE;
}
int WINAPI PaintConEmuBackground(struct PaintBackgroundArg* pBk)
{
int iLeftRc = 0, iRightRc = 0;
if (pBk->Place == pbp_Finalize)
{
GdipDone();
return TRUE;
}
if (!gbGdiPlusInitialized)
{
if (!GdipInit())
{
return FALSE;
}
}
else
{
// Проверить, может содержимое xml-ки изменилось?
CheckXmlFile();
}
wchar_t szDbg[128];
COLORREF crOtherColor = (COLORREF)-1;
int cOtherDrive = -1;
if (pBk->LeftPanel.bVisible)
{
iLeftRc = PaintPanel(pBk, TRUE/*bLeft*/, crOtherColor, cOtherDrive);
}
else
{
RECT rcConPanel = pBk->LeftPanel.rcPanelRect;
swprintf_c(szDbg, L"ConEmuBk: Invisible Left - {%i,%i,%i,%i)\n",
rcConPanel.left, rcConPanel.top, rcConPanel.right, rcConPanel.bottom);
DBGSTR(szDbg);
}
if (pBk->RightPanel.bVisible)
{
iRightRc = PaintPanel(pBk, FALSE/*bLeft*/, crOtherColor, cOtherDrive);
}
else
{
RECT rcConPanel = pBk->RightPanel.rcPanelRect;
swprintf_c(szDbg, L"ConEmuBk: Invisible Right - {%i,%i,%i,%i)\n",
rcConPanel.left, rcConPanel.top, rcConPanel.right, rcConPanel.bottom);
DBGSTR(szDbg);
}
UNREFERENCED_PARAMETER(iLeftRc); UNREFERENCED_PARAMETER(iRightRc);
return TRUE;
//DWORD nPanelBackIdx = (pBk->nFarColors[col_PanelText] & 0xF0) >> 4;
//
//if (bDragBackground)
//{
// if (pBk->LeftPanel.bVisible)
// {
// COLORREF crPanel = pBk->crPalette[nPanelBackIdx];
//
// if (pBk->LeftPanel.bPlugin && gbHilightPlugins)
// crPanel = gcrHilightPlugBack;
//
// HBRUSH hBr = CreateSolidBrush(crPanel);
// FillRect(pBk->hdc, &pBk->rcDcLeft, hBr);
// DeleteObject(hBr);
// }
//
// if (pBk->RightPanel.bVisible)
// {
// COLORREF crPanel = pBk->crPalette[nPanelBackIdx];
//
// if (pBk->RightPanel.bPlugin && gbHilightPlugins)
// crPanel = gcrHilightPlugBack;
//
// HBRUSH hBr = CreateSolidBrush(crPanel);
// FillRect(pBk->hdc, &pBk->rcDcRight, hBr);
// DeleteObject(hBr);
// }
//}
//
//if ((pBk->LeftPanel.bVisible || pBk->RightPanel.bVisible) /*&& pBk->MainFont.nFontHeight>0*/)
//{
// HPEN hPen = CreatePen(PS_SOLID, 1, gcrLinesColor);
// HPEN hOldPen = (HPEN)SelectObject(pBk->hdc, hPen);
// HBRUSH hBrush = CreateSolidBrush(gcrLinesColor);
// int nCellHeight = 12;
//
// if (pBk->LeftPanel.bVisible)
// nCellHeight = pBk->rcDcLeft.bottom / (pBk->LeftPanel.rcPanelRect.bottom - pBk->LeftPanel.rcPanelRect.top + 1);
// else
// nCellHeight = pBk->rcDcRight.bottom / (pBk->RightPanel.rcPanelRect.bottom - pBk->RightPanel.rcPanelRect.top + 1);
//
// int nY1 = (pBk->LeftPanel.bVisible) ? pBk->rcDcLeft.top : pBk->rcDcRight.top;
// int nY2 = (pBk->rcDcLeft.bottom >= pBk->rcDcRight.bottom) ? pBk->rcDcLeft.bottom : pBk->rcDcRight.bottom;
// int nX1 = (pBk->LeftPanel.bVisible) ? 0 : pBk->rcDcRight.left;
// int nX2 = (pBk->RightPanel.bVisible) ? pBk->rcDcRight.right : pBk->rcDcLeft.right;
//
// bool bDrawStipe = true;
//
// for(int Y = nY1; Y < nY2; Y += nCellHeight)
// {
// if (giHilightType == 0)
// {
// MoveToEx(pBk->hdc, nX1, Y, NULL);
// LineTo(pBk->hdc, nX2, Y);
// }
// else if (giHilightType == 1)
// {
// if (bDrawStipe)
// {
// bDrawStipe = false;
// RECT rc = {nX1, Y - nCellHeight + 1, nX2, Y};
// FillRect(pBk->hdc, &rc, hBrush);
// }
// else
// {
// bDrawStipe = true;
// }
// }
// }
//
// SelectObject(pBk->hdc, hOldPen);
// DeleteObject(hPen);
// DeleteObject(hBrush);
//}
//
//return TRUE;
}
void WINAPI OnConEmuLoaded(struct ConEmuLoadedArg* pConEmuInfo)
{
gfRegisterBackground = pConEmuInfo->RegisterBackground;
ghPluginModule = pConEmuInfo->hPlugin;
if (gfRegisterBackground && gbBackgroundEnabled)
{
StartPlugin(FALSE/*считать параметры из реестра*/);
}
}
void SettingsLoad()
{
if (!gbSetStartupInfoOk)
{
_ASSERTE(gbSetStartupInfoOk);
return;
}
if (!*gsXmlConfigFile)
{
lstrcpyn(gsXmlConfigFile, szDefaultXmlName, countof(gsXmlConfigFile));
}
if (gFarVersion.dwVerMajor == 1)
SettingsLoadA();
else if (gFarVersion.dwBuild >= FAR_Y2_VER)
FUNC_Y2(SettingsLoadW)();
else if (gFarVersion.dwBuild >= FAR_Y1_VER)
FUNC_Y1(SettingsLoadW)();
else
FUNC_X(SettingsLoadW)();
}
void SettingsLoadReg(LPCWSTR pszRegKey)
{
HKEY hkey = NULL;
if (!RegOpenKeyExW(HKEY_CURRENT_USER, pszRegKey, 0, KEY_READ, &hkey))
{
DWORD nVal, nType, nSize; BYTE cVal;
for (ConEmuBgSettings *p = gSettings; p->pszValueName; p++)
{
if (p->nValueType == REG_BINARY)
{
_ASSERTE(p->nValueSize == 1);
if (!RegQueryValueExW(hkey, p->pszValueName, 0, &(nType = REG_BINARY), &cVal, &(nSize = sizeof(cVal))))
*((BOOL*)p->pValue) = (cVal != 0);
}
else if (p->nValueType == REG_DWORD)
{
_ASSERTE(p->nValueSize == 4);
if (!RegQueryValueExW(hkey, p->pszValueName, 0, &(nType = REG_DWORD), (LPBYTE)&nVal, &(nSize = sizeof(nVal))))
*((DWORD*)p->pValue) = nVal;
}
else if (p->nValueType == REG_SZ)
{
wchar_t szValue[MAX_PATH] = {};
if (!RegQueryValueExW(hkey, p->pszValueName, 0, &(nType = REG_SZ), (LPBYTE)szValue, &(nSize = sizeof(szValue))))
lstrcpyn((wchar_t*)p->pValue, szValue, p->nValueSize);
}
}
RegCloseKey(hkey);
}
}
void SettingsSave()
{
if (gFarVersion.dwVerMajor == 1)
SettingsSaveA();
else if (gFarVersion.dwBuild >= FAR_Y2_VER)
FUNC_Y2(SettingsSaveW)();
else if (gFarVersion.dwBuild >= FAR_Y1_VER)
FUNC_Y1(SettingsSaveW)();
else
FUNC_X(SettingsSaveW)();
}
void SettingsSaveReg(LPCWSTR pszRegKey)
{
HKEY hkey = NULL;
if (!RegCreateKeyExW(HKEY_CURRENT_USER, pszRegKey, 0, 0, 0, KEY_ALL_ACCESS, 0, &hkey, NULL))
{
BYTE cVal;
for (ConEmuBgSettings *p = gSettings; p->pszValueName; p++)
{
if (p->nValueType == REG_BINARY)
{
_ASSERTE(p->nValueSize == 1);
cVal = (BYTE)*(BOOL*)p->pValue;
RegSetValueExW(hkey, p->pszValueName, 0, REG_BINARY, &cVal, sizeof(cVal));
}
else if (p->nValueType == REG_DWORD)
{
_ASSERTE(p->nValueSize == 4);
RegSetValueExW(hkey, p->pszValueName, 0, REG_DWORD, p->pValue, p->nValueSize);
}
else if (p->nValueType == REG_SZ)
{
RegSetValueExW(hkey, p->pszValueName, 0, REG_SZ, p->pValue, sizeof(wchar_t)*(1+lstrlenW((wchar_t*)p->pValue)));
}
}
RegCloseKey(hkey);
}
}
void StartPlugin(BOOL bConfigure)
{
if (gbInStartPlugin)
{
// Вложенных вызовов быть не должно
_ASSERTE(gbInStartPlugin==false);
return;
}
gbInStartPlugin = true;
if (!XmlFile.cr)
{
XmlFile.cr = new MSectionSimple(true);
}
if (!bConfigure)
{
SettingsLoad();
}
static bool bWasRegistered = false;
if (gfRegisterBackground)
{
if (gbBackgroundEnabled)
{
if (bConfigure && bWasRegistered)
{
RegisterBackgroundArg upd = {sizeof(RegisterBackgroundArg), rbc_Redraw};
gfRegisterBackground(&upd);
}
else
{
RegisterBackgroundArg reg = {sizeof(RegisterBackgroundArg), rbc_Register, ghPluginModule};
reg.PaintConEmuBackground = ::PaintConEmuBackground;
reg.dwPlaces = pbp_Panels;
reg.dwSuggestedLevel = 0;
gfRegisterBackground(®);
bWasRegistered = true;
}
}
else
{
RegisterBackgroundArg unreg = {sizeof(RegisterBackgroundArg), rbc_Unregister, ghPluginModule};
gfRegisterBackground(&unreg);
bWasRegistered = false;
}
}
else
{
bWasRegistered = false;
}
// Вернуть флаг обратно
gbInStartPlugin = false;
}
void ExitPlugin(void)
{
if (gfRegisterBackground != NULL)
{
RegisterBackgroundArg inf = {sizeof(RegisterBackgroundArg), rbc_Unregister, ghPluginModule};
gfRegisterBackground(&inf);
}
// Вообще-то это нужно делать в нити отрисовки, но на всякий случай, дернем здесь (LastChance)
GdipDone();
gbSetStartupInfoOk = false;
}
void WINAPI ExitFARW(void)
{
ExitPlugin();
if (gFarVersion.dwBuild>=FAR_Y2_VER)
FUNC_Y2(ExitFARW)();
else if (gFarVersion.dwBuild>=FAR_Y1_VER)
FUNC_Y1(ExitFARW)();
else
FUNC_X(ExitFARW)();
}
void WINAPI ExitFARW3(void*)
{
ExitPlugin();
if (gFarVersion.dwBuild>=FAR_Y2_VER)
FUNC_Y2(ExitFARW)();
else if (gFarVersion.dwBuild>=FAR_Y1_VER)
FUNC_Y1(ExitFARW)();
else
FUNC_X(ExitFARW)();
}
LPCWSTR GetMsgW(int aiMsg)
{
if (gFarVersion.dwVerMajor==1)
return L"";
else if (gFarVersion.dwBuild>=FAR_Y2_VER)
return FUNC_Y2(GetMsgW)(aiMsg);
else if (gFarVersion.dwBuild>=FAR_Y1_VER)
return FUNC_Y1(GetMsgW)(aiMsg);
else
return FUNC_X(GetMsgW)(aiMsg);
}
HANDLE WINAPI OpenW(const void* Info)
{
HANDLE hResult = NULL;
if (gFarVersion.dwBuild>=FAR_Y2_VER)
hResult = FUNC_Y2(OpenW)(Info);
else if (gFarVersion.dwBuild>=FAR_Y1_VER)
hResult = FUNC_Y1(OpenW)(Info);
else
{
_ASSERTE(FALSE && "Must not called in Far2");
}
return hResult;
}
int WINAPI ConfigureW(int ItemNumber)
{
if (gFarVersion.dwVerMajor==1)
return false;
else if (gFarVersion.dwBuild>=FAR_Y2_VER)
return FUNC_Y2(ConfigureW)(ItemNumber);
else if (gFarVersion.dwBuild>=FAR_Y1_VER)
return FUNC_Y1(ConfigureW)(ItemNumber);
else
return FUNC_X(ConfigureW)(ItemNumber);
}
int WINAPI ConfigureW3(void*)
{
if (gFarVersion.dwVerMajor==1)
return false;
else if (gFarVersion.dwBuild>=FAR_Y2_VER)
return FUNC_Y2(ConfigureW)(0);
else if (gFarVersion.dwBuild>=FAR_Y1_VER)
return FUNC_Y1(ConfigureW)(0);
else
return FUNC_X(ConfigureW)(0);
}
HANDLE OpenPluginWcmn(int OpenFrom,INT_PTR Item)
{
HANDLE hResult = (gFarVersion.dwVerMajor >= 3) ? NULL : INVALID_HANDLE_VALUE;
if (!gbInfoW_OK)
return hResult;
ConfigureW(0);
return hResult;
}
bool FMatch(LPCWSTR asMask, LPWSTR asPath)
{
if (!asMask || !asPath)
return false;
if ((*asMask && !*asPath) || (*asPath && !*asMask))
return false;
if (gFarVersion.dwVerMajor==1)
{
bool lbRc = false;
int nMaskLen = lstrlenW(asMask);
char* pszMask = (char*)malloc(nMaskLen+1);
int nPathLen = lstrlenW(asPath);
char* pszPath = (char*)malloc(nPathLen+1);
if (pszMask && pszPath)
{
WideCharToMultiByte(CP_ACP, 0, asMask, nMaskLen+1, pszMask, nMaskLen+1, 0,0);
WideCharToMultiByte(CP_ACP, 0, asPath, nPathLen+1, pszPath, nPathLen+1, 0,0);
lbRc = FMatchA(pszMask, pszPath);
}
if (pszMask)
free(pszMask);
if (pszPath)
free(pszPath);
return lbRc;
}
else if (gFarVersion.dwBuild>=FAR_Y2_VER)
return FUNC_Y2(FMatchW)(asMask, asPath);
else if (gFarVersion.dwBuild>=FAR_Y1_VER)
return FUNC_Y1(FMatchW)(asMask, asPath);
else
return FUNC_X(FMatchW)(asMask, asPath);
}
int GetMacroArea()
{
int nMacroArea = 0/*MACROAREA_OTHER*/;
if (gFarVersion.dwVerMajor==1)
{
_ASSERTE(gFarVersion.dwVerMajor>1);
nMacroArea = 1; // в Far 1.7x не поддерживается
}
else if (gFarVersion.dwBuild>=FAR_Y2_VER)
nMacroArea = FUNC_Y2(GetMacroAreaW)();
else if (gFarVersion.dwBuild>=FAR_Y1_VER)
nMacroArea = FUNC_Y1(GetMacroAreaW)();
else
nMacroArea = FUNC_X(GetMacroAreaW)();
return nMacroArea;
}
| {
"pile_set_name": "Github"
} |
Coastal communities at high risk within a generation
“Rising sea levels will claim homes, roads and fields around the coast of England, the government’s official advisers have warned, and many people are unaware of the risks they face.
The new report from the Committee on Climate Change (CCC) said existing government plans to “hold the line” in many places – building defences to keep shores in their current position – were unaffordable for a third of the country’s coast. Instead, the CCC said, discussions about the “hard choices” needed must be started with communities that will have to move inland.
“There genuinely will be homes that it will not be possible to save,” said Baroness Brown, chair of the CCC’s adaptation committee. “The current approach is not fit for purpose. This report is really a wake-up call to the fact that we can’t protect the whole English coast to today’s standard.”
She added: “We could see as much as a metre of sea level rise before the end of the century, so within the lifetime of today’s children, and that has a major impact on coastal flooding and erosion.” Prof Jim Hall, another member of the committee, said: “We are not prepared.”
The regions affected include areas with soft, eroding shores in the south and east, as well as low-lying areas in East Anglia, Lincolnshire, parts of the south-west such as the Somerset Levels, and the coast between Liverpool and Blackpool in the north-west.
The entire coast of England is already covered by shoreline management plans, developed by the Environment Agency and local councils. These would cost £18-30bn to implement, but have no funding and no legal force. The CCC analysis found that, for more than 150km of coast, the plans to hold the line would cost more than the property and land that would be protected.
For another 1,460km of coast, the benefit of holding the line was twice the cost, but the government only currently funds defences with at least a sixfold cost-benefit ratio. “Funding for these locations is unlikely and realistic plans to adapt to the inevitability of change are needed now,” said the report.
The report also found that 520,000 properties are already in areas with significant coastal flood risk. However, this may treble to 1.5m by the 2080s without action.
Currently, 8,900 properties are at risk from coastal erosion and in 2014 the Environment Agency calculated that 7,000 homes, worth more than £1bn, would fall into the sea this century. But the CCC report found that in the 2080s another 100,000 properties would be at risk of sliding into the sea.
As well as properties, key infrastructure is also at risk from the sea level rise and bigger storms being driven by climate change. In the 2080s, 1,600km of major roads, 650km of railway line and 92 stations will be at risk, the CCC found. Ports, power stations and gas terminals are also in danger. A further risk is toxic waste from old landfill sites falling into the sea as the coast is eroded; a 2016 study found 1,000 such sites at risk.
Pollution risk from over 1,000 old UK landfill sites due to coastal erosion.
Brown said people living in coastal areas do not have access to good information about the risks they face. “A retired couple could buy, with cash, a house with a fabulous sea view without being given any information about whether it was at risk of erosion,” she said.
Making better information easily available would alarm people but was vital, said Hall. It would also affect property values, he said: “If it was better communicated, as we think it should be, then that would have a [negative] impact on house prices.”
The government must work with local councils on long-term, funded programmes that engage people and help them move if necessary, the CCC said. “Those are very difficult decisions,” said Brown. “Local councils are in a very tough situation having to raise those kind of issues with their communities. There may be a bit of denial going on in local authorities.” …” | {
"pile_set_name": "Pile-CC"
} |
{
"info" : {
"version" : 1,
"author" : "xcode"
}
} | {
"pile_set_name": "Github"
} |
Judy Pfaff - × × × ÷ ÷ ÷ ☰ + + + ,
Opening Reception July 7, 6-8pm
Wellfleet
July 7 – August 11, 2018
Press Release
JUDY PFAFF
× × × ÷ ÷ ÷ ☰ + + + ,
July 7 - August 11, 2018
Opening Reception July 7, 6 - 8pm
Gaa Gallery Wellfleet
Gaa Gallery Wellfleet is pleased to announce its forthcoming exhibition from artist Judy Pfaff, with the symbol-based title of × × × ÷ ÷ ÷ ☰ + + + , read as X’s and Oh’s, opening on Saturday, July 7, and on view through August 11.
For more than 40 years, Pfaff has created work that resists easy classification, spanning the disciplines of sculpture, printmaking, and painting to create expansive physical projects that have often been described as painting in space. The recipient of awards and honors including a MacArthur “genius” grant, a National Endowment for the Arts grant, and a Guggenheim Fellowship, Pfaff’s work has been exhibited in galleries, museums, and institutions worldwide.
Drawing on botany, spirituality, and art history, the artist creates deeply visual and tactile work that is marked by both sprawl and precision, by a muscular scope and intricate application. Pfaff has described her extraordinary process and varied materials as a strategy to get to “the silence, to the breath, to a sweeter sense of things.”
At Gaa Gallery Wellfleet, the artist will install wall-based installations and sculptures, featuring distorted photographic backdrops and framed works on paper. The exhibition is a textured and multidimensional exploration of the reciprocity of material, as Pfaff merges concrete shapes and symbols with the often borderless depths of visual abstraction.
× × × ÷ ÷ ÷ ☰ + + + , will open on Saturday, July 7, with a reception from 6-8 pm, and will remain on view through August 11.
Artists
News
Judy Pfaff - × × × ÷ ÷ ÷ ☰ + + +,
July 2018
Gaa Gallery Wellfleet is pleased to announce its forthcoming exhibition from artist Judy Pfaff, with the symbol-based title of × × × ÷ ÷ ÷ ☰ + + +, read as X’s and Oh’s, opening on Saturday, July 7, and on view through August 11. Please join us in Wellfleet on Saturday, July 7 for an opening reception from 6 - 8pm. | {
"pile_set_name": "Pile-CC"
} |
Archdeacon of Rochester
The Archdeacon of Rochester is a senior office-holder in the Diocese of Rochester (a division of the Church of England Province of Canterbury.) Like other archdeacons, they are administrators in the diocese at large (having oversight of parishes in roughly one-third of the diocese). The present incumbent is the Venerable Andy Wooding Jones.
History
The first Archdeacon of Rochester is recorded , at approximately the same sort of time as archdeacons were being appointed across the country. At this point, this archdeacon was the sole archdeacon in the diocese, functioning as an assistant to the bishop. The archidiaconal and diocesan boundaries remained similar for almost 750 years until 1 January 1846 when the three archdeaconries of Colchester, Essex and St Albans from the Diocese of London were added to the diocese while all of west Kent but the Deanery of Rochester was given to the Diocese of Canterbury – at this point, the diocese covered all of Essex. The archdeaconry of Rochester, having been reduced severely, was first suppressed at the next vacancy (Walter King's death in 1859) then held by the Archdeacon of St Albans. The archdeaconry was then given to Canon Cheetham, a residentiary canon of Rochester Cathedral and the bishop's examining chaplain, who held it until after the Kentish territory was returned.
Those three archdeaconries created the new Diocese of St Albans in 1877, but the diocese received part of Surrey (which part was constituted into the Southwark archdeaconry the next year) a few months later: in 1879 the Kingston archdeaconry was split off from Southwark; those two archdeaconries were erected into the Diocese of Southwark in 1905 while west Kent was returned to the Rochester diocese – immediately prior to that date the Diocese of Rochester covered a large portion of Surrey (now southern Greater London) immediately south of the Thames. Once again, Rochester was the sole archdeaconry of the diocese until it was split to create the Archdeaconry of Tonbridge in 1906; it was further split in 1955 to create the Archdeaconry of Bromley, so that there are today three archdeaconries in the present diocese, covering West Kent plus the two London boroughs of Bromley and Bexley – an area broadly similar to that covered until 1846.
List of archdeacons
High Medieval
bef. 1107–aft. 1107: Ansketil
bef. 1122–aft. 1115: Hervey or Herwis
bef. 1134–bef. 1145 (res.): Robert Pullen (became cardinal-priest of San Martino ai Monti)
bef. 1145–aft. 1190: Paris
bef. 1193–aft. 1225: William son of Peter
bef. 1238–aft. 1245: a vicar of Frindsbury
bef. 1253–1274 (d.): William de Sancto Martino
bef. 1278–1288 (d.): John de Sancto Dionysio
bef. 1289–9 February 1321 (deprived): Roger de Weseham
Late Medieval
1321–bef. 1323 (res.): Pierre Cardinal Desprès (Cardinal-priest of Santa Pudenziana)
1323–bef. 1359 (res.): William de le Dene
20 June 1359–bef. 1364 (res.): William Reed
1364–aft. 1366: William Wyvel of Wenlock
bef. 1368–aft. 1368: Roger
?–bef. 1373 (res.): William de Navesby
1373–bef. 1396 (d.): Roger de Denford
31 July 1396 – 1400 (d.): Thomas Halle
bef. 1402–aft. 1402: William Hunden
bef. 1418–1418 (d.): William Purcell
1420–bef. 1452 (d.): Richard Cordon or Brouns
21 November 1452–aft. 1467: John Lowe
bef. 1474–aft. 1475: Roger Rotherham
bef. 1480–1489 (d.): Henry Sharp
bef. 1497–bef. 1512 (res.): Henry Edyall
26 November 1512–bef. 1537 (res.): Nicholas Metcalfe
27 August 1537 – 1554 (res.): Maurice Griffith (became Bishop of Rochester)
Early modern
20 July 1554–bef. 1560 (res.): John Kennall
3 February 1560–bef. 1571 (res.): John Bridgewater
10 July 1571–bef. 1576 (d.): John Calverley
5 July 1576–bef. 1593 (res.): Ralph Pickover (became Archdeacon of Salisbury)
2 July 1593 – 1606 (d.): Thomas Staller
13 August 1606–bef. 1614 (d.): Thomas Sanderson
9 April 1614 – 1624 (d.): Richard Tillesley
20 April 1625–bef. 1652 (d.): Elizeus Burgess
1660–12 June 1679 (d.): John Lee
21 June 1679 – 20 November 1704 (d.): Thomas Plume
4 December 1704 – 10 May 1720 (d.): Thomas Sprat
24 May 1720 – 10 May 1728 (d.): the Hon Henry Bridges
23 June–15 July 1728 (d.): William Bradford
22 July 1728 – 5 August 1767 (d.): John Denne
3 September 1767 – 5 February 1827 (d.): John Law
6 July 1827 – 13 March 1859 (d.): Walker King
Late modern
1859–1863: archdeaconry suppressed (from King's death) by Order in Council, 8 August 1845
1863–1882 (res.): Anthony Grant, Archdeacon of St Albans
1882–9 July 1908 (d.): Samuel Cheetham (previously Archdeacon of Southwark)
1908–29 April 1915 (d.): Tetley Rowe
1915–24 September 1932 (d.): Donald Tait (also Vice-Dean of Rochester from 1924)
1933–1951 (ret.): Walter Browne (afterwards archdeacon emeritus)
1951–1969 (ret.): Lawrence Harland (afterwards archdeacon emeritus)
1969–1976 (ret.): David Stewart-Smith
1977–1983 (res.): Derek Palmer
1984–1988 (res.): Michael Turnbull (became Bishop of Rochester)
1989–2000 (res.): Norman Warren
2001–2009 (ret.): Peter Lock
24 January 20103 July 2018 (res.): Simon Burton-Jones (became Bishop of Tonbridge)
11 September 2018present: Andy Wooding Jones
References
Sources
Category:Diocese of Rochester
Category:Lists of Anglicans
Archdeacon of Rochester | {
"pile_set_name": "Wikipedia (en)"
} |
Hello John. As good a place as any to post. I am reminded of the last time I visited an art exhibition. It was mostly painting, and most of the pictures were not very good. Quite forgettable in fact. People forget that historically most art has not been very good. I don't think that matters too much. This was about people making an attempt to express something within, and without that step no-one will get better. All painters start somewhere. Photography is just catching up with the other arts. While not necessarily disagreeing with him, I think the author frets too much. I should be sorry to see traditional story telling skills lost in the current digital wave, but I'd give it another 20 years before making up my mind on that one.As for the "happy snappers". Clearly something else is going on here. To make any painting, good or bad, takes commitment, and pointing an iphone doesn't. But that is nothing new. 130 years ago they were called "camera fiends" The Photographic News in July 1891 reported that when Prince George of Greece was travelling to America, he was “pursued by 150 ladies, all armed with cameras, who persisted in photographing him, despite his protests and his attempts to cover his face". There was outrage expressed in parliament when Queen Victoria was snapped laughing. It seems those days have returned. To quote the 4th October 1910 issue of The Amateur Photographer: “Our moral character dwindles as our instruments get smaller”
Edit: forgot to say thank you for the link
Second edit:I just saw this in today's newspaper:"Fruit - the original easy-to-eat food - has become the latest pre- peeled, ready-sliced convenience food, as stores sell it in bright little packages for "time-hungry" consumers. It's not just tricky produce like pineapples or pomegranates either. Some Fruit World franchises are now making our days easier by selling pre-peeled mandarins - that's the fruit marketed as "easy-peel"."This makes me want to lie down in a dark room. In the world of photography, I suppose George Eastman began this trend. Must remind myself : in all things, just because most of the rest of the world does it, doesn't mean I have to.
Well written. I can't remember who said it, but the quote was, "Why is it that if you buy a violin you own a violin, but if you buy a camera you're a photographer?" Tr truth today is quite simple, though, that most of the images made will never be seen, and of those shared, most will never be looked at more than once, and by far most of them will be viewed on a non-colour-calibrated, small screen. When we stop trying to make it art and relegate it to the category of the children's drawings or macaroni art that we hang proudly on the fridge door, those are still making photographic art will be sought out.
Mike.
Logged
If your mind is attuned to beauty, you find beauty in everything.~ Jean Cooke ~
I can't speak to the merit of the thesis made by the author of the article without at least seeing the entries. But I do find the title of the article to be mildly ridiculous: "Humanity takes millions of photos every day. Why are most so forgettable?"
Imagine a chef saying, "Humanity cooks millions of meals every day. Why are most so forgettable?"
Or,
A novelist, "Humanity writes millions of words every day. Why are most so forgettable?"
In fact, the first thing that came to mind when reading the article was the famous Terence Donovan quotation:
The most difficult thing for the amateur is finding a reason to take a photograph.
It gets no more true than that. I find it to be my own current experience as well. When I was working as a photographer the work that I picked up was the raison d’être, purpose and justification of all the effort, time and money involved in its creation. Remove the business factor and there’s a huge void that screams to be filled. And it can’t be filled. The difference between shooting a photograph of a girl for ‘fun’ and doing it for reward is immeasurable. On the one hand there’s the buzz of the assignment, the need to outdo what one (or more importantly one’s predecessor) did before as well as the suppressed fear that something might have gone wrong unnoticed and that it will all turn to dust or, at best, a reshoot. It’s a helluva nervous high.
When a professional shoot is for self, then two things happen (to me): I get doubts about the marketability of the product; I worry about the financial investment if the first doubt proves correct. That was the main problem with stock, and why I preferred to use surplus material from commissioned shoots. The work was created on a high and so it was better and more successful in its secondary role as stock.
So there you are – remove the pro element and I’m where I find myself today: wandering about aimlessly with a cellpix machine or an expensive dslr, and in the end, it’s all the bloody same. Photography is, of itself, an amazing experience, but it can’t stand alone. Spend your life in it and it’s impossible to let go when your time is up, and you end up trying to continue doing what you used to do because you love it so, But that is impossible; desire is but a tiny part of the circle.
Photography needs real purpose. That has to come first and from it, given the ability, all else follows.
I can't speak to the merit of the thesis made by the author of the article without at least seeing the entries. But I do find the title of the article to be mildly ridiculous: "Humanity takes millions of photos every day. Why are most so forgettable?"
Imagine a chef saying, "Humanity cooks millions of meals every day. Why are most so forgettable?"
Or,
A novelist, "Humanity writes millions of words every day. Why are most so forgettable?"
In my case, at least, my reaction is, "is that a problem?"
Maybe the internet and social media has just made the deluge of digital pictures more visible and means people compete for attention or maybe the difference is with the intent: most people won't think they are a chef because they cooked a meal but might think they are a photographer because they took an iphone picture with instagram.
What the guy you linked to does not explain, is whu an increase in volume should lead to a decrease in top quality
Why? Because digital allows the distancing of cost, which was always a consideration, even for the top pros: everyone has a budget.So, take away that consideration, and what's to stop the machine gun opening up? Better a sniper.
I thought one of the most striking things was the implied victory of technique over content. What the guy was saying is that they had lots of perfectly exposed and processed pretty pictures, but none that meant anything, especially in the context of literally hundreds of other pretty pictures. If there's nothing to distinguish them (like a story) then what's the point? It's the thing we've sort of argued here several times, especially after Mark writes one of his essays about high-end cameras. I mean, is photography really nothing more than the best possible technique? There's a school of painting called "The Boston School" which has led to a proliferation of "atliers" in the US, in which people spend a fairly rigid four or five years drawing and then learning to paint, and I find their end-product product to be banal and generally unviewable. The problem is the same as in this kind of photography: a victory of technique over content. There are no ideas in the work, other than technique: in fact, technique IS their idea, and for me, that's simply not enough. I'm not against good technique, understand, but it's no where near sufficient on its own.
I thought one of the most striking things was the implied victory of technique over content. What the guy was saying is that they had lots of perfectly exposed and processed pretty pictures, but none that meant anything, especially in the context of literally hundreds of other pretty pictures. If there's nothing to distinguish them (like a story) then what's the point? It's the thing we've sort of argued here several times, especially after Mark writes one of his essays about high-end cameras. I mean, is photography really nothing more than the best possible technique? There's a school of painting called "The Boston School" which has led to a proliferation of "atliers" in the US, in which people spend a fairly rigid four or five years drawing and then learning to paint, and I find their end-product product to be banal and generally unviewable. The problem is the same as in this kind of photography: a victory of technique over content. There are no ideas in the work, other than technique: in fact, technique IS their idea, and for me, that's simply not enough. I'm not against good technique, understand, but it's no where near sufficient on its own.
The article was interesting but if that was his message then you stated it better in a single paragraph.
I'm a little unclear about the requirements for the category they judged but if it was for photo essay--multiple photographs telling a story--that seems to be something that relatively few photographers have ever mastered and something there seems to be little market or call for today. I think the essays he cited in Life and National Geographic were usually the result of good/great photographers working with good/great editors.
There's a school of painting called "The Boston School" which has led to a proliferation of "atliers" in the US, in which people spend a fairly rigid four or five years drawing and then learning to paint, and I find their end-product product to be banal and generally unviewable.
I agree, but the question I'd ask is whether this is anything new?There are millions of photos being taken every hour with the modern equivalent of the brownie box camera. I don't see this as the victory of technique over content, because there is no technique. It's all in the camera's software (or later in the computer). How can it not be perfectly exposed and processed?The thing is, human nature doesn't change just because of the introduction of new technology. To question why so many photos are forgettable is a bit silly really. To question why so much art is forgettable is a more interesting question, but one that ignores human nature and its fads and follies. Don't get me started on some of the art world's latest fads. There is some great photography being done. The difference now is that the the web is the first place most folks go to see it. The web is the new "art gallery", and it is a gallery swamped by a tsunami of images that in the past were safely hidden away in the family album. You have to shovel hard.
I agree, but the question I'd ask is whether this is anything new?There are millions of photos being taken every hour with the modern equivalent of the brownie box camera. I don't see this as the victory of technique over content, because there is no technique. It's all in the camera's software (or later in the computer). How can it not be perfectly exposed and processed?The thing is, human nature doesn't change just because of the introduction of new technology. To question why so many photos are forgettable is a bit silly really. To question why so much art is forgettable is a more interesting question, but one that ignores human nature and its fads and follies. Don't get me started on some of the art world's latest fads. There is some great photography being done. The difference now is that the the web is the first place most folks go to see it. The web is the new "art gallery", and it is a gallery swamped by a tsunami of images that in the past were safely hidden away in the family album. You have to shovel hard.
The article was good, but we've known this for some time. However it's far from limited to photography either.We are not in the age of golden photography or golden anything else. We are in the age of the "Wannabe"
Youtube is full of ho hum videos be they personal broadcasts with reviews or comments, or bands looking for a record label to notice them. Everyone is taking ultra shallow DOF videos in the desperate attempt to become the next in demand cinematographer that some Hollywood studio pays a bomb for.
I partly blame these reality shows (which are getting a bit tiresome and overdone) pluck average Joe/s from obscurity and throw them on TV with the promise of a record contract, or instant fame or some other job they walk into just for being on our screens. It's the next gimmick with people. Be honest in 10 years time do you think anyone will consider "Gangnam Style", to be one of the greatest songs ever done? I doubt it.
Never Mind the Quality, Feel the Width - Never did cut it for photography, video work, or writing songs or painting.
I think half the problem is the way we live in society. People are celebrated for being in the ultra elite or super wealthy. It's a ladder for some people to try to climb. Does Damien Hirst really deserve to be the richest most successful artist living and worth over £200 million? Or is he just talentless and reliant on gimmicks and shock tactics? I'd wager the last category myself.
Putting a bunch of sausages into an acrylic case with silicone isn't art. Neither is showing a dead carcass.
The article was good, but we've known this for some time. However it's far from limited to photography either.We are not in the age of golden photography or golden anything else. We are in the age of the "Wannabe"
Youtube is full of ho hum videos be they personal broadcasts with reviews or comments, or bands looking for a record label to notice them. Everyone is taking ultra shallow DOF videos in the desperate attempt to become the next in demand cinematographer that some Hollywood studio pays a bomb for.
I partly blame these reality shows (which are getting a bit tiresome and overdone) pluck average Joe/s from obscurity and throw them on TV with the promise of a record contract, or instant fame or some other job they walk into just for being on our screens. It's the next gimmick with people. Be honest in 10 years time do you think anyone will consider "Gangnam Style", to be one of the greatest songs ever done? I doubt it.
Never Mind the Quality, Feel the Width - Never did cut it for photography, video work, or writing songs or painting.
I think half the problem is the way we live in society. People are celebrated for being in the ultra elite or super wealthy. It's a ladder for some people to try to climb. Does Damien Hirst really deserve to be the richest most successful artist living and worth over £200 million? Or is he just talentless and reliant on gimmicks and shock tactics? I'd wager the last category myself.
Putting a bunch of sausages into an acrylic case with silicone isn't art. Neither is showing a dead carcass.
Most of them were created as ephemeral amusements, so it's really not hard to understand why they are forgettable.
Quote
One of his most memorable photo essays is an ongoing series of pictures taken from the front porch of his house: his kids playing on a toboggan in a blizzard, his wife’s belly, the dog. They mean something to him...
aka Family snapshots.
Quote
But when “everybody with a phone thinks they’re a photographer,”...
Everybody with a phone doesn't think they're a photographer -- they think they have a source of amusement that they can share with their acquaintances. | {
"pile_set_name": "Pile-CC"
} |
package com.example.service;
import com.example.domain.Customer;
import com.example.repository.CustomerRepository;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.stereotype.Service;
import java.util.List;
@Service
public class CustomerService {
@Autowired
CustomerRepository customerRepository;
public Customer save(Customer customer) {
return customerRepository.save(customer);
}
public List<Customer> findAll() {
return customerRepository.findAll();
}
// その他のメソッドは次章で定義します
}
| {
"pile_set_name": "Github"
} |
Q:
jQuery get attributes and values of element
Say I have this HTML code:
<img id="idgoeshere" src="srcgoeshere" otherproperty="value" />
I can reference the element by its id: $('#idgoeshere')) Now, I want to get all the properties and their values on that element:
src=srcgoeshere
otherproperty=value
Is there some way I can do that programmatically using jQuery and/or plain Javascript?
A:
You can get a listing by inspecting the attributes property:
var attributes = document.getElementById('idgoeshere').attributes;
// OR
var attributes = $('#idgoeshere')[0].attributes;
alert(attributes[0].name);
alert(attributes[0].value);
$(attributes).each(function()
{
// Loop over each attribute
});
A:
The syntax is
$('idgoeshere').attr('otherproperty')
For more information - http://api.jquery.com/attr/
| {
"pile_set_name": "StackExchange"
} |
Adrift (video game)
Adrift (stylized as ADR1FT) is a first-person adventure video game developed by Three One Zero and published by 505 Games. It was released on March 28, 2016 for Microsoft Windows and July 15, 2016 for PlayStation 4. An Xbox One version of the game was planned but has been cancelled. The story follows an astronaut, who floats through the wreckage of a destroyed space station with no memory of the incident. Over the course of the game, players find clues that piece together the events of the incident, and attempt to repair the escape vehicle to return home.
Development began in 2013, following creator Adam Orth's resignation from Microsoft. The development team envision the game as a "first-person experience", purposefully avoiding violence. Orth compares the game to the upheaval in his life following his controversial comments about the Xbox One's DRM proposal.
Gameplay
Adrift is played from a first-person view. In the game, players take control of Commander Alex Oshima, floating and moving in any direction through the open environment, which takes place in zero gravity. The environment may be fully explored, but players will be restrained from exploring too far. One of the restraints is an oxygen limit, which players must monitor to avoid suffocation. When running low on oxygen, players' vision becomes blurred; they must obtain an oxygen tank to stay alive. Players move throughout five areas, completing a series of puzzles. Players are able to locate audio logs that will expand on the events of the incident; the game is set in the year 2037. Players will also find artifacts from the dead crew and must decide whether to return them to Earth. The game is said to have two main objectives: to survive, and to return home safely.
Development
The conception of Adrift was a direct result from the events that occurred to Adam Orth in 2013. When Microsoft's Xbox One was announced, it received controversy for its digital rights management that would require users to remain online to use the console. After seeing people quarrel over this, Orth—then a creative director at Microsoft—told them to "deal with it", which resulted in a mass of complaints leading to Orth's resignation from the company. This led him to move from Seattle to Southern California. Orth noted that the game is a metaphor, comparing it to the events in his life; both Orth and the player character find themselves in the middle of a disaster, and must "do the hard work to put things together". He has stated that the game is about "action, consequence and redemption". Orth wrote the story without any science fiction or supernatural themes in mind, stating that he "wanted to make stories and characters that hopefully resonate with people because they're not typical video game stories".
Following his resignation from Microsoft, Orth approached his former colleague Omar Aziz with the idea of founding a new studio. Although initially hesitant, Aziz agreed with the idea after hearing Orth's pitch for Adrift, and the two founded the development studio Three One Zero. After building a prototype for the game, Orth contacted and hired other former colleagues. The development team found that they were interested in developing Adrift due to its unique nature, setting it apart from first-person shooters. "I've gotten a lot of FPS fatigue over the years, having worked on them for many, many years I've gotten tired of them," said producer Matteo Marsala. The team envision the game as a "first-person experience", making an intentional diversion from violence. The game's development ultimately lasted approximately 13 months, with a core team of six developers. Throughout development, the team hired various contractors for a number of weeks in order to complete certain tasks, such as animation.
The team noted that the "look" of the game was the biggest change that occurred during development. Orth compared the game's art style to the minimalist presentation of the 1968 film 2001: A Space Odyssey. Orth also acknowledged the comparisons between Adrift and the 2013 film Gravity, stating that the game was conceived prior to the film's release. Upon watching the film, he felt confident that the two are "very different". The team consider the game's scope and scale to be similar to Gravity, the immersion of the world similar to the Half-Life series, and the presentation and storytelling similar to Journey (2012). Orth also admitted that he was largely inspired by the game Proteus (2013) while developing Adrift. The game's logo was designed by graphic designer Cory Schmitz, while the team hired Hogarth de la Plante as a prototype artist, Dave Flamburis as a technical artist, Oscar Cafaro as a concept artist and Chad King as an environment artist. The game's soundtrack was mainly composed by Orth, with contributions from the American band Weezer. The game's sounds were recorded by Al Nelson of Skywalker Sound, at Skywalker Ranch. Nelson stated that he intended to "[tell] a story and [present] emotion with sound".
The game was developed simultaneously for Microsoft Windows, PlayStation 4 and Xbox One. It was released on March 28, 2016 for Windows, and is scheduled to release on July 15, 2016 for PlayStation 4. it was originally intended for release in September 2015, but was delayed to coincide with the launch of the Oculus Rift. The game will feature Oculus Rift support, a feature that they intended since's the game's conception. The original prototype for the game was developed for potential publishers by three people in ten weeks, using the Unity game engine. The game's functionality was entirely rebuilt for use with the Unreal Engine 4.
Adrift was officially announced on June 4, 2014, prior to the full gameplay reveal at The Game Awards on December 5, 2014. A trailer for the game leaked a few days prior to E3 2015, in June 2015. On June 12, 2015, Three One Zero announced a partnership with Top Cow Productions and Image Comics to produce a comic book series based on Adrift; the first issue was released on the same day. The series is written by Matt Hawkins, with artwork by Luca Casalanguida.
Reception
References
External links
Category:2016 video games
Category:505 Games
Category:Adventure games set in space
Category:Cancelled Xbox One games
Category:First-person adventure games
Category:Oculus Rift games
Category:PlayStation 4 games
Category:Single-player video games
Category:Unreal Engine games
Category:Video games developed in the United States
Category:Video games featuring female protagonists
Category:Video games set in outer space
Category:Windows games
Category:Works about astronauts | {
"pile_set_name": "Wikipedia (en)"
} |
List of crossings of the River Tees
This is a list of crossings of the River Tees, heading downstream, including road, rail, pipe and foot/cycle bridges and fords.
Source to Barnard Castle
Moor House Bridge
Birkdale Footbridge
Cronkley Bridge (private road bridge)
Holwick Head Footbridge
Winch Footbridge
Scoberry Footbridge
Middleton in Teesdale Bridge (B6277 road)
Beckstones Wath Footbridge
Eggleston Bridge (B6281 road)
Cotherstone Bridge (footbridge).
Barnard Castle to Piercebridge
Deepdale Footbridge
Barnard Castle Bridge (A67 road)
Thorngate Footbridge
Abbey Bridge (Unclassified and unnamed road linking Abbey Rd to Westwick Road)
Whorlton Bridge (unclassified and unnamed road)
Winston Bridge (B6274 road)
West Tees Railway Bridge (dismantled rail)
Gainford Railway Bridge (dismantled rail)
Barforth Hall Bridge (private road bridge).
Piercebridge to Yarm
Piercebridge Pipe Bridge (water pipe)
Piercebridge Bridge (B6275 road)
A1(M) Bridge, Low Coniscliffe (road)
Blackwell Bridge (A66 road)
Croft Road Bridge (A167 road)
Tees Bridge (East Coast Main Line - rail)
Low Hail Bridge (private road bridge)
Neasham Hall Bridge (private footbridge)
Girsby Bridge (footbridge)
Fishlocks Bridge (private footbridge)
Over Dinsdale Bridge (unclassified and unnamed road).
Yarm to the river mouth
Yarm Viaduct (North TransPennine Line)
Yarm Road Bridge (A67 road)
Preston Pipe Bridge (water pipe)
Jubilee Bridge (carrying Queen Elizabeth Way)
Surtees Bridge (A66 road)
Surtees Rail Bridge (Tees Valley Line)
Victoria Bridge (A1130 road)
Teesquay Millennium Footbridge
Princess of Wales Bridge (carrying Teesdale Boulevard)
Infinity Bridge (foot and cycle)
Tees Barrage (road, cycle and foot)
Tees Viaduct (A19 road)
Tees Newport Bridge (A1032 road)
Middlesbrough Transporter Bridge (A178 road).
See also
Tees Railway Viaduct (1860-1971).
References
*
Tees | {
"pile_set_name": "Wikipedia (en)"
} |
Lambert Verdonk
Lambert Verdonk (born September 20, 1944) is a Dutch former international football striker.
References
International stats
Profile
Category:1944 births
Category:Living people
Category:Dutch footballers
Category:Netherlands international footballers
Category:Association football forwards
Category:PSV Eindhoven players
Category:Sparta Rotterdam players
Category:NEC Nijmegen players
Category:Go Ahead Eagles players
Category:Olympique de Marseille players
Category:AC Ajaccio players
Category:Ligue 1 players
Category:Angoulême-Soyaux Charente players
Category:Dutch expatriate footballers
Category:Expatriate footballers in France
Category:People from Heerlen | {
"pile_set_name": "Wikipedia (en)"
} |
Polyketide synthase (PKS) systems are generally known in the art as enzyme complexes derived from fatty acid synthase (FAS) systems, but which are often highly modified to produce specialized products that typically show little resemblance to fatty acids. Researchers have attempted to exploit polyketide synthase (PKS) systems that have been described in the literature as falling into one of three basic types, typically referred to as: Type II, Type I iterative (fungal-like) and Type I modular. The Type II system is characterized by separable proteins, each of which carries out a distinct enzymatic reaction. The enzymes work in concert to produce the end product and each individual enzyme of the system typically participates several times in the production of the end product. This type of system operates in a manner analogous to the fatty acid synthase (FAS) systems found in plants and bacteria. Type I iterative (fungal-like) PKS systems are similar to the Type II system in that the enzymes are used in an iterative fashion to produce the end product. In other words, the same set of reactions is carried out in each cycle until the end product is obtained. There is no allowance for the introduction of unique reactions during the biosynthetic procedure. The Type I iterative (fungal-like) PKS system differs from Type II in that enzymatic activities, instead of being associated with separable proteins, occur as domains of larger proteins. This system is analogous to the Type I FAS systems found in animals and fungi.
In contrast to the Type I iterative (fungal-like) and Type II systems, in Type I modular PKS systems, each enzyme domain is used only once in the production of the end product. The domains are found in very large proteins that do not utilize the economy of iterative reactions (i.e., a distinct domain is required for each reaction) and the product of each reaction is passed on to another domain in the PKS protein. Additionally, in all of the PKS systems described above, if a carbon-carbon double bond is incorporated into the end product, it is always in the trans configuration.
Polyunsaturated fatty acids (PUFAs) are critical components of membrane lipids in most eukaryotes (Lauritzen et al., Prog. Lipid Res. 40 1 (2001); McConn et al., Plant J. 15, 521 (1998)) and are precursors of certain hormones and signaling molecules (Heller et al., Drugs 55, 487 (1998); Creelman et al., Annu. Rev. Plant Physiol. Plant Mol. Biol. 48, 355 (1997)). Known pathways of PUFA synthesis involve the processing of saturated 16:0 or 18:0 fatty acids (the abbreviation X:Y indicates an acyl group containing X carbon atoms and Y cis double bonds; double-bond positions of PUFAs are indicated relative to the methyl carbon of the fatty acid chain (ω3 or ω6) with systematic methylene interruption of the double bonds) derived from fatty acid synthase (FAS) by elongation and aerobic desaturation reactions (Sprecher, Curr. Opin. Clin. Nutr. Metab. Care 2, 135 (1999); Parker-Barnes et al., Proc. Natl. Acad. Sci. USA 97, 8284 (2000); Shanklin et al., Annu. Rev. Plant Physiol. Plant Nol. Biol. 49, 611 (1998)). Starting from acetyl-CoA, the synthesis of DHA requires approximately 30 distinct enzyme activities and nearly 70 reactions including the four repetitive steps of the fatty acid synthesis cycle. Polyketide synthases (PKSs) carry out some of the same reactions as FAS (Hopwood et al., Annu. Rev. Genet. 24, 37 (1990); Bentley et al., Annu. Rev. Microbiol. 53, 411 (1999)) and use the same small protein (or domain), acyl carrier protein (ACP), as a covalent attachment site for the growing carbon chain. However, in these enzyme systems, the complete cycle of reduction, dehydration and reduction seen in FAS is often abbreviated so that a highly derivatized carbon chain is produced, typically containing many keto- and hydroxy-groups as well as carbon-carbon double bonds in the trans configuration. The linear products of PKSs are often cyclized to form complex biochemicals that include antibiotics and many other secondary products (Hopwood et al., (1990) supra; Bentley et al., (1999), supra; Keating et al., Curr. Opin. Chem. Biol. 3, 598 (1999)).
Very long chain PUFAs such as docosahexaenoic acid (DHA; 22:6ω3) and eicosapentaenoic acid (EPA; 20:5ω3) have been reported from several species of marine bacteria, including Shewanella sp (Nichols et al., Curr. Op. Biotechnol. 10, 240 (1999); Yazawa, Lipids 31, S (1996); DeLong et al., Appl. Environ. Microbiol. 51, 730 (1986)). Analysis of a genomic fragment (cloned as plasmid pEPA) from Shewanella sp. strain SCRC2738 led to the identification of five open reading frames (Orfs), totaling 20 Kb, that are necessary and sufficient for EPA production in E. coli (Yazawa, (1996), supra). Several of the predicted protein domains were homologues of FAS enzymes, while other regions showed no homology to proteins of known function. On the basis of these observations and biochemical studies, it was suggested that PUFA synthesis in Shewanella involved the elongation of 16- or 18-carbon fatty acids produced by FAS and the insertion of double bonds by undefined aerobic desaturases (Watanabe et al., J. Biochem. 122, 467 (1997)). The recognition that this hypothesis was incorrect began with a reexamination of the protein sequences encoded by the five Shewanella Orfs. At least 11 regions within the five Orfs were identifiable as putative enzyme domains (See Metz et al., Science 293:290-293 (2001)). When compared with sequences in the gene databases, seven of these were more strongly related to PKS proteins than to FAS proteins. Included in this group were domains putatively encoding malonyl-CoA:ACP acyltransferase (MAT), 3-ketoacyl-ACP synthase (KS), 3-ketoacyl-ACP reductase (KR), acyltransferase (AT), phosphopantetheine transferase, chain length (or chain initiation) factor (CLF) and a highly unusual cluster of six ACP domains (i.e., the presence of more than two clustered ACP domains has not previously been reported in PKS or FAS sequences). However, three regions were more highly homologous to bacterial FAS proteins. One of these was similar to the newly-described Triclosan-resistant enoyl reductase (ER) from Streptococcus pneumoniae (Heath et al., Nature 406, 145 (2000)); comparison of ORF8 peptide with the S. pneumoniae enoyl reductase using the LALIGN program (matrix, BLOSUM50; gap opening penalty, −10; elongation penalty −1) indicated 49% similarity over a 386aa overlap). Two regions were homologues of the E. coli FAS protein encoded by fabA, which catalyzes the synthesis of trans-2-decenoyl-ACP and the reversible isomerization of this product to cis-3-decenoyl-ACP (Heath et al., J. Biol. Chem., 271, 27795 (1996)). On this basis, it seemed likely that at least some of the double bonds in EPA from Shewanella are introduced by a dehydrase-isomerase mechanism catalyzed by the FabA-like domains in Orf7.
Anaerobically-grown E. coli cells harboring the pEPA plasmid accumulated EPA to the same levels as aerobic cultures (Metz et al., 2001, supra), indicating that an oxygen-dependent desaturase is not involved in EPA synthesis. When pEPA was introduced into a fabB− mutant of E. coli, which is unable to synthesize monounsaturated fatty acids and requires unsaturated fatty acids for growth, the resulting cells lost their fatty acid auxotrophy. They also accumulated much higher levels of EPA than other pEPA-containing strains, suggesting that EPA competes with endogenously produced monounsaturated fatty acids for transfer to glycerolipids. When pEPA-containing E. coli cells were grown in the presence of [13C]-acetate, the data from 13C-NMR analysis of purified EPA from the cells confirmed the identity of EPA and provided evidence that this fatty acid was synthesized from acetyl-CoA and malonyl-CoA (See Metz et al., 2001, supra). A cell-free homogenate from pEPA-containing fabB− cells synthesized both EPA and saturated fatty acids from [14C]-malonyl-CoA. When the homogenate was separated into a 200,000×g high-speed pellet and a membrane-free supernatant fraction, saturated fatty acid synthesis was confined to the supernatant, consistent with the soluble nature of the Type II FAS enzymes (Magnuson et al., Microbiol. Rev. 57, 522 (1993)). Synthesis of EPA was found only in the high-speed pellet fraction, indicating that EPA synthesis can occur without reliance on enzymes of the E. coli FAS or on soluble intermediates (such as 16:0-ACP) from the cytoplasmic fraction. Since the proteins encoded by the Shewanella EPA genes are not particularly hydrophobic, restriction of EPA synthesis activity to this fraction may reflect a requirement for a membrane-associated acyl acceptor molecule. Additionally, in contrast to the E. coli FAS, EPA synthesis is specifically NADPH-dependent and does not require NADH. All these results are consistent with the pEPA genes encoding a multifunctional PKS that acts independently of FAS, elongase, and desaturase activities to synthesize EPA directly. It is likely that the PKS pathway for PUFA synthesis that has been identified in Shewanella is widespread in marine bacteria. Genes with high homology to the Shewanella gene cluster have been identified in Photobacterium profundum (Allen et al., Appli. Environ. Microbiol. 65:1710 (1999)) and in Moritella marina (Vibrio marinus) (Tanaka et al., Biotechnol. Lett. 21:939 (1999)).
The biochemical and molecular-genetic analyses performed with Shewanella provide compelling evidence for polyketide synthases that are capable of synthesizing PUFAs from malonyl-CoA. A complete scheme for synthesis of EPA by the Shewanella PKS has been proposed. The identification of protein domains homologous to the E. coli FabA protein, and the observation that bacterial EPA synthesis occurs anaerobically, provide evidence for one mechanism wherein the insertion of cis double bonds occurs through the action of a bifunctional dehydratase/2-trans, 3-cis isomerase (DH/2,3I). In E. coli, condensation of the 3-cis acyl intermediate with malonyl-ACP requires a particular ketoacyl-ACP synthase and this may provide a rationale for the presence of two KS in the Shewanella gene cluster (in Orf5 and Orf7). However, the PKS cycle extends the chain in two-carbon increments while the double bonds in the EPA product occur at every third carbon. This disjunction can be solved if the double bonds at C-14 and C-8 of EPA are generated by 2-trans, 2-cis isomerization (DH/2,2I) followed by incorporation of the cis double bond into the elongating fatty acid chain. The enzymatic conversion of a trans double bond to the cis configuration without bond migration is known to occur, for example, in the synthesis of 11-cis-retinal in the retinoid cycle (Jang et al., J. Biol. Chem. 275, 28128 (2000)). Although such an enzyme function has not yet been identified in the Shewanella PKS, it may reside in one of the unassigned protein domains.
The PKS pathways for PUFA synthesis in Shewanella and another marine bacteria, Vibrio marinus, are described in detail in U.S. Pat. No. 6,140,486 (issued from U.S. application Ser. No. 09/090,793, filed Jun. 4, 1998, entitled “Production of Polyunsaturated Fatty Acids by Expression of Polyketide-like Synthesis Genes in Plants”, which is incorporated herein by reference in its entirety).
Polyunsaturated fatty acids (PUFAs) are considered to be useful for nutritional, pharmaceutical, industrial, and other purposes. An expansive supply of PUFAs from natural sources and from chemical synthesis are not sufficient for commercial needs. Because a number of separate desaturase and elongase enzymes are required for fatty acid synthesis from linoleic acid (LA, 18:2 Δ 9, 12), common in most plant species, to the more saturated and longer chain PUFAs, engineering plant host cells for the expression of PUFAs such as EPA and DHA may require expression of five or six separate enzyme activities to achieve expression, at least for EPA and DHA. Additionally, for production of useable quantities of such PUFAs, additional engineering efforts may be required, for instance the down regulation of enzymes competing for substrate, engineering of higher enzyme activities such as by mutagenesis or targeting of enzymes to plastid organelles. Therefore it is of interest to obtain genetic material involved in PUFA biosynthesis from species that naturally produce these fatty acids and to express the isolated material alone or in combination in a heterologous system which can be manipulated to allow production of commercial quantities of PUFAs.
The discovery of a PUFA PKS system in marine bacteria such as Shewanella and Vibrio marinus (see U.S. Pat. No. 6,140,486, ibid.) provides a resource for new methods of commercial PUFA production. However, these marine bacteria have limitations which will ultimately restrict their usefulness on a commercial level. First, although U.S. Pat. No. 6,140,486 discloses that the marine bacteria PUFA PKS systems can be used to genetically modify plants, the marine bacteria naturally live and grow in cold marine environments and the enzyme systems of these bacteria do not function well above 30° C. In contrast, many crop plants, which are attractive targets for genetic manipulation using the PUFA PKS system, have normal growth conditions at temperatures above 30° C. and ranging to higher than 40° C. Therefore, the marine bacteria PUFA PKS system is not predicted to be readily adaptable to plant expression under normal growth conditions. Moreover, the marine bacteria PUFA PKS genes, being from a bacterial source, may not be compatible with the genomes of eukaryotic host cells, or at least may require significant adaptation to work in eukaryotic hosts. Additionally, the known marine bacteria PUFA PKS systems do not directly produce triglycerides, whereas direct production of triglycerides would be desirable because triglycerides are a lipid storage product in microorganisms and as a result can be accumulated at very high levels (e.g. up to 80-85% of cell weight) in microbial/plant cells (as opposed to a “structural” lipid product (e.g. phospholipids) which can generally only accumulate at low levels (e.g. less than 10-15% of cell weight at maximum)).
Therefore, there is a need in the art for other PUFA PKS systems having greater flexibility for commercial use. | {
"pile_set_name": "USPTO Backgrounds"
} |
Introduction {#s1}
============
With the derivation of pluripotent human embryonic stem (ES) ([@pbio.0000074-Thomson1]) and embryonic germ (EG) ([@pbio.0000074-Shamblott1]) cells that can differentiate into many different cell types, excitement has increased for the prospect of replacing dysfunctional or failing cells and organs. Very little is known, however, about critical molecular mechanisms that can harness or manipulate the potential of cells to foster therapeutic applications targeted to specific tissues.
A related fundamental problem is the molecular definition of developmental potential. Traditionally, potential has been operationally defined as "the total of all fates of a cell or tissue region which can be achieved by any environmental manipulation" ([@pbio.0000074-Slack1]). Developmental potential has thus been likened to potential energy, represented by Waddington\'s epigenetic landscape ([@pbio.0000074-Waddington1]), as development naturally progresses from "totipotent" fertilized eggs with unlimited differentiation potential to terminally differentiated cells, analogous to a ball moving from high to low points on a slope. Converting differentiated cells to pluripotent cells, a key problem for the future of any stem cell-based therapy, would thus be an "up-hill battle," opposite the usual direction of cell differentiation. The only current way to do this is by nuclear transplantation into enucleated oocytes, but the success rate gradually decreases according to developmental stages of donor cells, providing yet another operational definition of developmental potential ([@pbio.0000074-Hochedlinger1]; [@pbio.0000074-Yanagimachi1]).
What molecular determinants underlie or accompany the potential of cells? Can the differential activities of genes provide the distinction between totipotent cells, pluripotent cells, and terminally differentiated cells? Systematic genomic methodologies ([@pbio.0000074-Ko1]) provide a powerful approach to these questions. One of these methods, cDNA microarray/chip technology, is providing useful information ([@pbio.0000074-Ivanova1]; [@pbio.0000074-Ramalho-Santos1]; [@pbio.0000074-Tanaka3]), although analyses have been restricted to a limited number of genes and cell types. To obtain a broader understanding of these problems, it is important to analyze all transcripts/genes in a wide selection of cell types, including totipotent fertilized eggs, pluripotent embryonic cells, a variety of ES and adult stem cells, and terminally differentiated cells. Despite the collection of a large number of expressed sequence tags (ESTs) ([@pbio.0000074-Adams1]; [@pbio.0000074-Marra1]) and full-insert cDNA sequences ([@pbio.0000074-Okazaki1]), systematic collection of ESTs on these hard-to-obtain cells and tissues has been done previously only on a limited scale ([@pbio.0000074-Sasaki1]; [@pbio.0000074-Ko2]; [@pbio.0000074-Solter1]).
Accordingly, we have attempted to (i) complement other public collections of mouse gene catalogs and cDNA clones by obtaining and indexing the transcriptome of mouse early embryos and stem cells and (ii) search for molecular differences among these cell types and infer features of the nature of developmental potential by analyzing their repertoire and frequency of ESTs. Here we report the collection of approximately 250,000 ESTs, enriched for long-insert cDNAs, and signature genes associated with the potential of cells, various types of stem cells, and preimplantation embryos.
Results and Discussion {#s2}
======================
Novel Genes Derived from Early Mouse Embryos and Stem Cells {#s2a}
-----------------------------------------------------------
Twenty-one long-insert-enriched cDNA libraries with insert ranges from 2--8 kb ([@pbio.0000074-Piao1]) were generated from preimplantation embryos (unfertilized egg, fertilized egg, two-cell embryo, four-cell embryo, eight-cell embryo, morula, and blastocyst), ES cells ([@pbio.0000074-Anisimov1]) and EG cells ([@pbio.0000074-Matsui1]), trophoblast stem (TS) cells ([@pbio.0000074-Tanaka1]), adult stem cells (e.g., neural stem/progenitor \[NS\] cells) ([@pbio.0000074-Galli1]), mesenchymal stem (MS) cells ([@pbio.0000074-Makino1]), osteoblasts ([@pbio.0000074-Ochi1]), and hematopoietic stem/progenitor (HS) cells ([@pbio.0000074-Ortiz1]), their differentiated cells, and newborn organs (e.g., brain and heart) (see [Protocol S1](#sd013){ref-type="supplementary-material"} and [Dataset S1](#sd001){ref-type="supplementary-material"} for methods, full list of libraries, and references). In total, 249,200 ESTs (170,059 cDNA clones: 114,437 5′ ESTs and 134,763 3′ ESTs) were generated and assembled together with public data into a gene index (see [Materials and Methods](#s4){ref-type="sec"}; [Protocol S1](#sd013){ref-type="supplementary-material"}).
Of 29,810 mouse genes identified in our gene index ([Figure 1](#pbio.0000074-g001){ref-type="fig"}; [Dataset S2](#sd002){ref-type="supplementary-material"}; [Dataset S3](#sd003){ref-type="supplementary-material"}), 977 were not present as either known or predicted transcripts in other major transcriptome databases, such as RefSeq ([@pbio.0000074-Pruitt1]), Ensembl ([@pbio.0000074-Hubbard1]), and RIKEN ([@pbio.0000074-Okazaki1]) (see [Dataset S3](#sd003){ref-type="supplementary-material"} for details and [Dataset S4](#sd004){ref-type="supplementary-material"} for sequences). These genes represent possible novel mouse genes, as they either encode open reading frames (ORFs) greater than 100 amino acids or have multiple exons. In particular, 554 of the 977 genes remained novel with high confidence even after more thorough searches against GenBank and other databases. Comparisons of these 977 genes against all National Center for Biotechnology Information (NCBI) UniGene representative sequences showed that 377 genes did not match even fragmentary ESTs and are therefore unique to the National Institute on Aging (NIA) cDNA collection (see [Dataset S3](#sd003){ref-type="supplementary-material"}). A random subset of 19 cDNA clones representing these genes was sequenced completely to confirm their novelty ([Figure 2](#pbio.0000074-g002){ref-type="fig"}). Protein domain searches using InterPro ([@pbio.0000074-Mulder1]) revealed that one of them, *U004160*, is an orthologue of human gene Midasin (*MDN1*), but the remaining 18 genes do not encode any known protein motifs. However, they were split into multiple exons in the alignment to the mouse genome sequences, and we therefore considered them genes. As these sequences are mainly derived from early embryos and stem cells, they most likely represent new candidates for genes specific to particular types of stem cells. RT--PCR analysis revealed that they are expressed in specific cell types ([Figure 2](#pbio.0000074-g002){ref-type="fig"}; [Dataset S5](#sd005){ref-type="supplementary-material"}). For example, the expression of gene *U035352* was unique to ES cells, expression of *U004912* unique to ES and TS cells, and expression of *U001905* unique to ES and EG cells. In addition, one gene showed apparent specific expression in several stem cells and is thus a potential pan-stem cell marker (*U029765*). Taken together, these data suggest that most of the putative genes represented only in the NIA cDNA collection are bona fide genes that have not been previously identified.
![Flow Chart of Sequence Data Analysis\
Using TIGR gene indices clustering tools ([@pbio.0000074-Pertea1]), 249,200 ESTs were clustered, generating 58,713 consensuses and singletons. NIA consensuses and singletons were further clustered with Ensembl transcripts ([@pbio.0000074-Hubbard1]), RIKEN transcripts ([@pbio.0000074-Okazaki1]), and RefSeq transcripts and transcript predictions ([@pbio.0000074-Pruitt1]). Alignments of these sequences to the mouse genome (UCSC February 2002 freeze data, available from <ftp://genome.cse.ucsc.edu/goldenPath/mmFeb2002>) ([@pbio.0000074-Waterston1]) using BLAT ([@pbio.0000074-Kent1]) helped to avoid false clustering of similar sequences at nonmatching genome locations. Erroneous clusters were reassembled based on the analysis of genome alignment. A total 94,039 putative transcripts were thus generated and then grouped into 39,678 putative genes based on their overlap in the genome on the same chromosome strand and on clone-linking information. Using criteria of an ORF greater than 100 amino acids or of multiple exons (excluding sequences that are potentially located in a wrong strand), 29,810 mouse genes were identified. Finally, 977 genes unique to the NIA database were identified.](pbio.0000074.g001){#pbio.0000074-g001}
{ref-type="supplementary-material"}). The exon number was predicted from alignment with the mouse genome sequence, and the amino acid sequence was predicted with the ORF finder from NCBI.](pbio.0000074.g002){#pbio.0000074-g002}
Signature Genes That Characterize Preimplantation Embryos and Stem Cells {#s2b}
------------------------------------------------------------------------
To identify genes that were consistently overrepresented in a given set of cDNA libraries when compared with other libraries, we performed the correlation analysis of log-transformed EST frequency combined with the false discovery rate (FDR) method ([@pbio.0000074-Benjamini1]) (FDR = 0.1) ([Figure 3](#pbio.0000074-g003){ref-type="fig"}; [Dataset S6](#sd006){ref-type="supplementary-material"}; [Dataset S7](#sd007){ref-type="supplementary-material"}).
{#pbio.0000074-g003}
First, we analyzed various combinations of preimplantation stages and identified the following genes: (i) 196 genes specific to unfertilized eggs (oocytes) and fertilized eggs (Group A in [Figure 3](#pbio.0000074-g003){ref-type="fig"}), (ii) 122 genes specific to two- to four-cell embryos (Group B in [Figure 3](#pbio.0000074-g003){ref-type="fig"}), (iii) 119 genes specific to eight-cell embryos, morula, and blastocyst (Group C in [Figure 3](#pbio.0000074-g003){ref-type="fig"}), (iv) 81 genes specific to all preimplantation embryos (Group D in [Figure 3](#pbio.0000074-g003){ref-type="fig"}), and (v) 143 genes specific to all preimplantation embryos except for blastocysts (Group E in [Figure 3](#pbio.0000074-g003){ref-type="fig"}) (see also [Dataset S7](#sd007){ref-type="supplementary-material"}). Blastocyst EST frequencies are unique even among preimplantation embryos, most likely reflecting the switch of the transcriptome from the maternal genetic program to the zygotic genetic program ([@pbio.0000074-Latham1]; [@pbio.0000074-Solter1]) or to the differentiation of the trophectoderm. At least 35 out of 196 genes in the egg signature gene list (Group A in [Figure 3](#pbio.0000074-g003){ref-type="fig"}) have ATP-related protein domains. Genes in the following categories were also enriched in this gene list: the ubiquitin--proteasome pathway, the energy pathway, cell signaling (kinase and membrane) proteins, ribosomal proteins, and zinc finger proteins. Two *SWI/SNF*-related genes (*5930405J04Rik*, the homologue of human *SMARCC2*, and *Smarcf1*) and two *Polycomb* genes (*Scmh1* and *Sfmbt*) overrepresented in eggs may be candidate genes for strong chromatin remodeling activity of eggs during nuclear transplantation of somatic cell nuclei.
Addition of ES and EG cells to preimplantation embryos (143 genes; Group E in [Figure 3](#pbio.0000074-g003){ref-type="fig"}) yielded only 54 signature genes (Group F in [Figure 3](#pbio.0000074-g003){ref-type="fig"}). Addition of adult stem cells, MS and NS, or MS, NS, and HS (Lin^−^, Kit^+^, Sca1^+^ and Lin^−^, Kit^−^, Sca1^+^) cells further reduced the number of signature genes to five and one, in Groups G and H, respectively ([Dataset S7](#sd007){ref-type="supplementary-material"}). Taken together, these results seem to indicate that preimplantation embryos, particularly totipotent fertilized eggs and highly pluripotent cells (ES and EG cells), have quite distinct genetic programs, but that less pluripotent adult stem cells (MS, NS, and HS) have even more specialized genetic programs. This supports the notion of a gradual decrease of developmental potential from preimplantation embryos to stem cells to differentiated cells.
Additional analysis was done to determine genes that are enriched in stem cells, but not in preimplantation embryos and other tissues (see [Figure 3](#pbio.0000074-g003){ref-type="fig"}; [Dataset S6](#sd006){ref-type="supplementary-material"}; [Dataset S7](#sd007){ref-type="supplementary-material"}). In this analysis, 140 genes were identified as signature genes for pluripotent stem cells (ES, EG, NS, and MS in Group I in [Figure 3](#pbio.0000074-g003){ref-type="fig"}), whereas 93 genes were identified as signature genes for these stem cells and their differentiated forms (cultured cells in Group J in [Figure 3](#pbio.0000074-g003){ref-type="fig"}). Similarly, 75 and 39 genes, respectively, were identified as ES- and TS-specific (Group K in [Figure 3](#pbio.0000074-g003){ref-type="fig"}), whereas 44 genes were identified as signature genes for adult stem cells (NS, MS, and HS in Group M in [Figure 3](#pbio.0000074-g003){ref-type="fig"}). Lists of these genes showed that distinctive sets of genes are responsible for cell specificity ([Figure 3](#pbio.0000074-g003){ref-type="fig"}).
FDR analysis revealed that 113 genes were specifically expressed in ES and EG cells in Group O (the most pluripotent stem cells), but not in all other cell types examined ([Figure 3](#pbio.0000074-g003){ref-type="fig"}; [Dataset S7](#sd007){ref-type="supplementary-material"}). The most abundant group of these genes was transcription regulatory factors (about 30% of all specific genes), most of which were members of the zinc finger family, including *Mtf2*, *Ing5*, *Mkrn1*, *Hic2*, and the KRAB box zinc finger. Other abundant genes specifically expressed in ES and EG cells included matrix/cytoskeleton/membrane structural proteins such as *Itga3*, *Dstn*, *Smtn*, *Dctn1*, and *Col18a1* and the DNA remodeling proteins such as *Rcc1*, *Kars-ps1*, *Pola2*, *Mov10*, and *Rad54l* . These two groups of genes may be associated with the unique feature of ES/EG cell cycle structure, where greater than 70% of the cell population are in S phase ([@pbio.0000074-Savatier1]).
Previous studies have identified genes specific to particular stem cells or genes common to a group of stem cells, although there was little agreement about which transcripts are commonly enriched in these studies (e.g., [@pbio.0000074-Anisimov1]; [@pbio.0000074-Ivanova1]; [@pbio.0000074-Ramalho-Santos1]; [@pbio.0000074-Tanaka3]). The difference in the method and platform used could be a major reason for the difficulty in identifying a common gene set. The analysis of limited number of cell types could also contribute to differences in the resulting gene lists, because genes that appeared specific to certain cell types may also be expressed in other cells that were not included in the analysis. In contrast, the current study has analyzed a large number of different stem cells, preimplantation embryos, and newborn organs from our own EST collections as well as all publicly available ESTs that were derived from a few hundred cell types. Combined with stringent FDR statistics (see [Materials and Methods](#s4){ref-type="sec"}), the analysis of this large number of cell types may provide broader perspectives on this issue. Comparison between the gene lists of the present study and the gene lists from the previously published studies identified areas of agreement (common genes), but also revealed that many genes previously reported as specifically expressed in one cell type or group of cells are actually expressed in other cell types and thus are not specific (see the details in [Dataset S8](#sd008){ref-type="supplementary-material"}). The signature genes identified in this study distinguish different stem cells, and this gene list may provide a way to recognize or purify specific stem cell types and provide insights into stem cell--specific functions.
Principal Component Analysis Identified Clusters of Cells/Tissues with Similar EST Frequency {#s2c}
--------------------------------------------------------------------------------------------
The global expression patterns of 2,812 relatively abundant genes (see [Materials and Methods](#s4){ref-type="sec"}; [Dataset S9](#sd009){ref-type="supplementary-material"}) were further analyzed by principal component analysis (PCA), which reduces high-dimensionality data into a limited number of principal components. The first principal component (PC1) captures the largest contributing factor of variation, which in this case corresponds to the average EST frequency in all tissues, and subsequent principal components correspond to other factors with smaller effects, which characterize the differential expression of genes. As we were interested in the differential gene expression component, we plotted the position of each cell type against the PC2, PC3, and PC4 axis in three-dimensional (3D) space by using virtual reality modeling language (VRML) ([Figure 4](#pbio.0000074-g004){ref-type="fig"}A; [Video S1](#sv001){ref-type="supplementary-material"}; a full interactive view is available on <http://lgsun.grc.nia.nih.gov/Supplemental-Information>). Genes were also plotted in the same 3D space (a version of PCA called a biplot) ([@pbio.0000074-Chapman1]) to see their association with cell/tissue types. Close examination of the 3D model identified PC2 and PC3 as the most representative views of the 3D model ([Figure 4](#pbio.0000074-g004){ref-type="fig"}B). A two-dimensional (2D) plot of PC2 and PC3 is therefore used for the following discussion, with references to the 3D model. It is important to keep in mind that the distance between cell types along principal components has a substantial error associated with randomness of clone counts in EST libraries. The estimated error range (2\*SE) in the PC3 scale is about 7%--9% based on Poisson distribution ([Figure 4](#pbio.0000074-g004){ref-type="fig"}B). Nonetheless, PCA identifies major trends and clusters in gene expression among these cell types.
{#pbio.0000074-g004}
The most conspicuous trend was that cells that differ in their developmental potential appeared well separated along the PC3 axis. In [Figure 4](#pbio.0000074-g004){ref-type="fig"}A and [4](#pbio.0000074-g004){ref-type="fig"}B, preimplantation embryos (unfertilized egg, fertilized egg, two-cell, four-cell, eight-cell, morula, and blastocyst) are positioned at the top of the PC3 axis; embryos and extraembryonic tissues from early- to mid-gestation stage, such as E6.5, E7.5, E8.5, and E9.5, are positioned at the middle; and cells and tissues mostly from terminally differentiated cells (newborn ovary, newborn heart, and newborn brain) are positioned at the bottom. PCA is unsupervised (performed without using knowledge of developmental stages of each cell types), and so this ordering along the PC3 axis seems to reflect the structures of global gene expression patterns among the cells. The PC2 axis provided an additional dimension to separate cells into developmental stages, functional groups, or both. The correlation of the PC2 axis to known biological stages, functions, or both, however, remains unclear.
Interestingly, both ES cells and adult stem cells are positioned at the middle of the PC3 axis together with whole-embryo libraries from early- to mid-gestation stages ([Figure 4](#pbio.0000074-g004){ref-type="fig"}B). ES and EG cells were derived from embryos, and thus their positions matched with their developmental timing. Although NS, MS, and HS cells were all derived from adult organs (brain, bone marrow, and bone marrow, respectively), their position along the PC3 axis corresponded to early embryonic tissues and embryo-derived stem cells (ES and EG). The results are consistent with the notion that adult stem cells acquire or retain the pluripotency with characters of less-differentiated cell types. This also suggests that the PC3 axis does not represent just developmental timing, but also indicates the developmental potential of cells, with totipotent eggs at the top, pluripotent embryonic cells and stem cells at the middle, and terminally differentiated cells at the bottom.
This hypothesis seems to be consistent with another interesting observation that the differentiated forms of stem cells were always positioned lower than their stem cell counterparts (undifferentiated forms) in the PC3 axis ([Figure 4](#pbio.0000074-g004){ref-type="fig"}A and [4](#pbio.0000074-g004){ref-type="fig"}B). For example, the position of NS (differentiated) cells, a mixture of neuron and glia obtained after culturing NS cells in the differentiation conditions, was lower and nearer to the terminally differentiated cells than were NS cells. Osteoblast cells, which are more differentiated than the MS cells from which they are derived, were again positioned lower than the MS cells. The same holds true for ES (LIF^−^) cells (lower PC3 position), which were obtained by culturing ES cells in the absence of leukemia inhibitory factor (LIF), allowing ES cells to differentiate into many different cell types, and ES (LIF^+^) cells (higher PC3 position), which were maintained as highly pluripotent by culturing them in the presence of LIF. For HS cells, all four cell types were selected first as lineage marker-negative cells, and thus they were all relatively undifferentiated cells. These cells were then sorted by c-Kit^+^ and Sca1^+^ into four separate fractions. The most pluripotent cells (Lin^−^, c-Kit^+^, Sca1^+^) were again positioned higher than other three cell types in the PC3 axis. Finally, TS cells were positioned at the least-potent place among stem cells, which seemed to fit to their known characteristics. It has previously been shown that TS cells are already committed to the extraembryonic lineage and are less pluripotent than ES and EG cells, because TS cells injected back to mouse blastocysts only differentiate into extraembryonic trophoblast lineages ([@pbio.0000074-Tanaka1]). The microarray analysis of TS cells also shows that they already express many placenta-specific genes, which is a sign of lineage-committed cells ([@pbio.0000074-Tanaka3]).
Finally, it is interesting to note that EG cells were positioned closely to E8.5 whole embryos and E9.5 whole embryos, whereas ES cells were positioned closely to blastocysts, E6.5, and E7.5 whole embryos ([Figure 4](#pbio.0000074-g004){ref-type="fig"}). Because ES cells are derived from E3.5 blastocysts and EG cells are derived from primordial germ cells (PGCs) of E8.5 (in this particular line), these results indicate that the expression patterns of relatively abundant genes in ES and EG cells reflect their developmental stages of origin. Although ES and EG cells were established from different sources, EG cells are often considered to be ES cells and the distinction of their origin is ignored. However, the result here suggests potentially significant differences between the genetic programs of EG cells and ES cells.
Genes Correlated with the Developmental Potential of Cells {#s2d}
----------------------------------------------------------
To identify a group of genes associated with the PC3 axis, we first fixed the coordinate of each cell type on PC3 and searched for genes whose log-transformed frequencies correlated with this coordinate in each cell type. Correlation analysis combined with the FDR method (FDR = 0.1) revealed 88 genes whose expression levels were significantly associated with PC3 ([Dataset S10](#sd010){ref-type="supplementary-material"}). To test how well these genes represent PC3, we plotted the sum of log-transformed EST frequencies for these 88 genes versus PC3 projections of the same cell types ([Figure 5](#pbio.0000074-g005){ref-type="fig"}). Most cells were positioned diagonally relative to the original PC3 coordinates, indicating that the average expression levels of these 88 genes can roughly represent cell type position along the PC3 coordinate. Because the PC3 axis does not have a unit and cannot be directly translated to variables measured by molecular biological techniques, the possible use of 88 genes as a surrogate for the PC3 axis will help to test this working hypothesis in the future.
{ref-type="supplementary-material"}).](pbio.0000074.g005){#pbio.0000074-g005}
What are the characteristics of these 88 potential correlating genes? Based on the available protein domain information, Gene Ontology (GO) annotation ([@pbio.0000074-Ashburner1]; <http://www.geneontology.org/doc/GO.annotation.html)>, and literature, 58 genes can be classified into putative functional categories ([Dataset S10](#sd010){ref-type="supplementary-material"}). For example, signature genes in the "transcriptional control" category include eight genes, such as MAD homologue 4 interacting transcription coactivator 1 (*Mitc1*), *Drosophila* Deltex 2 homologue (*Dtx2*), and oocyte-specific homeobox 5 (*Obox5*); the "RNA binding" category includes five genes such as RNA-binding region containing 1 (*Rnpc1*) and 2′-5′-oligoadenylate synthetase 1D (*Oas1d*); the "signal transduction" category includes ten genes, such as AMP-activated protein kinase (*Prkab1*) and regulator of G-protein signaling 2 (*Rgs2*); and the "proteolysis" category includes six genes, such as Ret finger protein-like 4 (*Rfpl4*) and ring finger protein 35 (*Rnf35*). These categories were diverse, and the domination of any specific categories was not observed.
Although all 88 genes shared the general trend of continuous decrease of expression levels from eggs to terminally differentiated tissues, these genes can be further subdivided by their expression patterns. First, 53 genes were those identified as preimplantation specific, particularly unfertilized and fertilized egg-specific genes, which include already well-known genes for their functions in oogenesis and zygotic gene activation, such as *Gdf9*, *Bmp15*, *Rfpl4*, *Fmn2*, *Tcl1*, *Obox5*, and *Oosp1*. Second, ten genes were represented as ESTs in both preimplantation embryos and postimplantation embryos, including *Cyp11a* and *D7Ertd784e*. Third, 25 genes were represented well as ESTs in preimplantation embryos, postimplantation embryos, and stem cells, including *Mitc1*, actin-binding Kelch family protein, *Dtx2*, *Cdc25a*, *Spin*, *Rgs2*, *Prkab1*, and *Birc2*. The seemingly continuous decrease of the expression of these genes is therefore not caused by passive dilution of transcripts that are abundant in oocytes, but is most likely caused by a specific mechanism that actively regulates the expression levels of these genes.
Concluding Remarks {#s3}
==================
The sequence information and cDNA clones collected in this work provide the most comprehensive database and resources for genes functioning in early mouse embryos and stem cells. All cDNA clones developed in this project have been made available through the American Type Culture Collection (ATCC). The subset of these cDNA clones have been rearrayed into the condensed clone sets, the NIA Mouse 15K cDNA Clone Set ([@pbio.0000074-Tanaka2]; [@pbio.0000074-Kargul1]) and the 7.4K cDNA Clone Set ([@pbio.0000074-VanBuren1]), which have been made available through designated academic distribution centers. Many genes that are uniquely or predominantly expressed in mouse early embryos and stem cells have been recently incorporated into a 60mer oligonucleotide microarray ([@pbio.0000074-Carter1]). Sequence information has been made available at public sequence databases (e.g., dbEST \[[@pbio.0000074-Boguski1]\]). Finally, all the information discussed here, as well as the graphical interfaces of the Mouse Gene Index, is available on our Web site at <http://lgsun.grc.nia.nih.gov/cDNA/cDNA.html>.
Although the full appreciation of these resources is yet to be realized, the initial assessment of the first comprehensive transcriptome of early mouse embryos and stem cells has already provided three major points presented in this report.
First, approximately 1,000 putative genes that were newly identified using our cDNA collection most likely represent mouse genes unidentified previously, as they either encode ORFs greater than 100 amino acids or have multiple exons. The RT--PCR analysis of 19 selected genes confirmed the notion that novel cDNAs from our libraries tend to be expressed specifically in cells and tissues that we used in this project. These gene candidates will be a rich source of genes that are expressed at low levels, but play major roles in ES cells and adult stem cells as well as in early embryos.
Second, the analysis provided lists of genes specific to particular embryonic stages or stem cells and not expressed in other cell types. For example, we have identified signature genes for the individual preimplantation stages, all preimplantation stages, ES cells, and adult stem cells.
Finally, the PCA of 2,812 genes with relatively abundant expression revealed 88 genes with average expression levels that correlate well to the developmental potentials of cells. These genes may provide the first scale to characterize the developmental potential of cells and tissues at the molecular level.
The developmental potential of cells is a fundamental concept in developmental biology, providing a conceptual framework of sequential transition from totipotent fertilized eggs to pluripotent embryonic cells and stem cells to terminally differentiated cells. It is worth noting that genes associated with developmental potential can be identified only by simultaneous analysis of preimplantation embryos and a variety of stem cells. The analyses of stem cells alone could not provide these broader perspectives ([@pbio.0000074-Ivanova1]; [@pbio.0000074-Ramalho-Santos1]; [@pbio.0000074-Tanaka3]). The 88 genes we have identified here may provide a set of marker genes for scaling the potential of cells. It is important to note that this scale is an operational construct. As such, further studies of the genes in the list will be required to test whether they provide critical clues to resolve the classic problem of the relation of stem cells to development. But the list could have immediate practical utility in assessing the effectiveness of treatments, gene manipulation, or both to convert differentiated cells such as fibroblasts into more potent cells such as ES---one of the most important goals required to achieve stem cell--based therapy.
Materials and Methods {#s4}
=====================
{#s4a}
### cDNA library construction, clone handling, and sequencing {#s4a1}
Sources of tissue materials and RNA extraction methods are available as associated documents in the GenBank DNA sequence records (see also <http://lgsun.grc.nia.nih.gov/cDNA/cDNA.html>). cDNA libraries were constructed as described elsewhere ([@pbio.0000074-Piao1]). More details are available in [Protocol S1](#sd013){ref-type="supplementary-material"}.
### Assembling of a gene index {#s4a2}
See description in the legend to [Figure 1](#pbio.0000074-g001){ref-type="fig"} and in [Protocol S1](#sd013){ref-type="supplementary-material"}.
### Analysis of 19 cDNA clones {#s4a3}
Sequencing of full-length cDNA clones and RT--PCR analysis were done by the standard methods. More details are available as [Protocol S1](#sd013){ref-type="supplementary-material"}.
### Identification of differentially expressed genes {#s4a4}
Most methods for selecting differentially expressed genes from EST frequencies are based on the assumption that each cDNA clone is a random sample from the mRNA pool in the cell and hence that EST frequencies correspond to the Poisson distribution ([@pbio.0000074-Audic1]). Real EST libraries, however, do not satisfy this assumption because even small changes in experimental conditions may affect the stability of particular species of mRNA, which in turn will cause a bias in EST frequency. Thus, a reliable detection of differentially expressed genes requires either library replications or comparison of classes of libraries. Because our EST libraries do not have true replications, we selected the latter approach, which yields genes that are specifically expressed in one class of tissues/stages and do not express in other tissues/stages. Some cDNA clones were represented by 5′ EST, some were by 3′ EST, and some were by both 5′ EST and 3′ EST. To avoid counting the same cDNA clone twice by 5′ EST and 3′ EST, all EST frequency analysis was done at the cDNA clone level.
To detect genes specific to a particular group of libraries, we first estimated the correlation between log-transformed clone frequencies, log(1000\**n~i~*/*N* + 0.05), where *n~i~* is the abundance of clone *i* in the library and *N* is the total number of clones, with membership indicated (0 or 1) in a particular group (see [Dataset S6](#sd006){ref-type="supplementary-material"}). The first three group classifications are targeted on oocytes. The next two classifications include all preimplantation stages with and without blastocysts. There are four classifications attempting to differentiate between pluripotent cells and other tissues. The final nine classifications capture various groups of stem cells. Results of these analyses are given in [Dataset S7](#sd007){ref-type="supplementary-material"} and a subset of the data is shown in [Figure 3](#pbio.0000074-g003){ref-type="fig"}. We analyzed only positive correlations because we were interested in genes that are overexpressed in tissues of interest, and *P*-values were estimated using a one-tailed *t*-test. Because *P*-values cannot be used for simultaneous assessment of multiple hypotheses, we determined significant genes using the FDR method ([@pbio.0000074-Benjamini1]). The FDR was set to 0.1, which corresponds to the average proportion of false positives equal to 10%.
As this study is focused on embryo- and stem cell--specific genes, we analyzed EST frequencies in public databases ([@pbio.0000074-Boguski1]) to exclude those genes that are predominantly expressed in adult tissues. A total of 3,338,847 public ESTs have been grouped into the following categories: NIA Collection, Preimplantation, Embryo, Embryonic Stem Cells, Fetus, Neonate, Adult, Adult Gonad, Adult Stem Cells, Adult Tumor, and Unclassified/Pooled Tissues ([Dataset S11](#sd011){ref-type="supplementary-material"}). Of 29,810 mouse genes, 5,425 genes were not represented by ESTs, 11,574 genes were expressed predominantly in adult tissues (EST frequency in adult tissues exceeds one-third of the maximum EST frequencies in all tissues), and 12,811 were genes expressed in embryos or in gonads, tumors, and stem cells. By removing 2,055 gonad-specific and 56 tumor-specific genes (20 times more ESTs in gonad or tumors than in other tissues), we obtained 10,700 genes that are predominantly expressed in embryos and stem cells ([Dataset S12](#sd012){ref-type="supplementary-material"}). Only ESTs matching to these genes were analyzed for differential expression.
### PCA of clone frequencies {#s4a5}
For the PCA shown in [Figure 4](#pbio.0000074-g004){ref-type="fig"}, we selected 2,812 genes that had transcript frequencies of greater than or equal to 0.1% in at least one library (see [Dataset S9](#sd009){ref-type="supplementary-material"}). Clone/EST frequencies were log-transformed as log(1000\**n~i~*/N + 0.05), where *n~i~* is the number of clones in U-cluster *i* in the library, and *N* is the total number of all clones in this library.
Statistical significance of gene contribution to PC3 (see [Figure 5](#pbio.0000074-g005){ref-type="fig"}) was evaluated using correlation between log-transformed clone frequencies in various libraries and library position on the PC3 axis. *P*-values, estimated using a one-tailed *t*-distribution, characterize the significance of correlation for a single clone. To control the proportion of false positives, we used FDR, which was set to 0.1.
Supporting Information {#s5}
======================
To view this Supporting Information with dynamic Web links, see <http://lgsun.grc.nia.nih.gov/Supplemental-Information/>.
The NIA Mouse Gene Index has recently made available to the public (<http://lgsun.grc.nia.nih.gov/geneindex/>). The Web interface provides a view of transcripts and genes on the mouse genome sequence. Unique IDs (U plus 6 digits, e.g., U018631) have been assigned to individual genes in the gene index. "U numbers" in the following datasets have direct links to corresponding genes in the NIA Mouse Gene Index. Clicking the "U number" in the datasets will lead to a Web page of the NIA public Web site.
###### List of NIA Mouse cDNA Libraries and the Number of ESTs Generated
(22 KB XLS).
######
Click here for additional data file.
###### Summary of Gene Counts in the NIA Mouse Gene Index
In addition to the list here, the Web interface at <http://lgsun.grc.nia.nih.gov/geneindex> provides a view of transcripts and genes on the mouse genome sequence.
(36 KB XLS).
######
Click here for additional data file.
###### List of 977 Genes Unique to the NIA Mouse cDNA Collection
These are not found in RefSeq, Ensembl, and RIKEN. For sequence information, see Dataset S4.
(268 KB XLS).
######
Click here for additional data file.
###### Sequence Information of 977 Genes in the FASTA Format
(685 KB TXT).
######
Click here for additional data file.
###### Primer Sequences for RT--PCR Analysis
(30 KB DOC).
######
Click here for additional data file.
###### Classification of cDNA Libraries for the Analysis of Differentially Expressed Genes
This table describes how cDNA libraries were logically grouped for further EST analysis, where membership to a group is indicated with a 1 and nonmembership is indicated with a 0.
(19 KB XLS).
######
Click here for additional data file.
######
List of Genes Overexpressed in Preimplantation Embryos and Stem Cells
This table identifies the genes overexpressed in each group of cells/tissues described in Dataset S6.
(510 KB XLS).
######
Click here for additional data file.
###### Comparison of the Gene Lists Identified in Dataset S7 with the Published Data
(23 KB DOC).
######
Click here for additional data file.
###### List of 2,812 Genes Used for PCA to Investigate the Global Feature of Gene Expression Patterns
(633 KB XLS).
######
Click here for additional data file.
###### List of 88 Genes Correlated with Developmental Potential of Cells
(72 KB XLS).
######
Click here for additional data file.
###### Comprehensive Data about EST Frequencies of Genes in NIA Mouse cDNA Libraries and in Public Sequence Databases
(13.9 MB XLS).
######
Click here for additional data file.
###### List of 10,699 Genes Predominantly Expressed in Embryos and Stem Cells
These genes were identified by the analysis of NIA EST and public EST datasets.
(3.2 MB XLS).
######
Click here for additional data file.
###### Supplemental Materials and Methods
(59 KB DOC).
######
Click here for additional data file.
###### 3D View of Results Obtained by PCA of Log-Transformed EST Frequencies in NIA Mouse cDNA Libraries
Red spheres represent libraries and yellow boxes represent genes. Gene names can be legible at closer distance. (For Windows, Media Player or Real Player is required to view. For Macintosh, Quicktime Player is required.) A virtual reality modeling language (VRML) formatted version is also available on our Web site (<http://lgsun.grc.nia.nih.gov/Supplemental-Information>). The VRML version allows users to freely rotate and zoom the image in 3D space. Genes are also hyperlinked to the NIA Mouse Gene Index Web site (mentioned in Dataset S2).
(3.9 MB AVI).
######
Click here for additional data file.
Accession Numbers {#s5a}
-----------------
The LocusLink (<http://www.ncbi.nih.gov/LocusLink/>) accession numbers for the genes discussed in this paper are *1810015H18Rik* (LocusLink ID 69104), *2210021E03Rik* (LocusLink ID 52570), *2410003C07Rik* (LocusLink ID 66977), *2610005B21Rik* (LocusLink ID 72119), *2610005H11Rik* (LocusLink ID 72114), *3230401D17Rik* (LocusLink ID 66680), *4833422F24Rik* (LocusLink ID 74614), *4921528E07Rik* (LocusLink ID 114874), *4933428G09Rik* (LocusLink ID 66768), *5730419I09Rik* (LocusLink ID 74741), *5930405J04Rik* (LocusLink ID 68094), *A030007L17Rik* (LocusLink ID 68252), *A930014I12Rik* (LocusLink ID 77805), *AA617276* (LocusLink ID 100012), actin-binding Kelch family protein (LocusLink ID 246293), *Bcl2l10* (LocusLink ID 12049), *Birc2* (LocusLink ID 11796), *Bmp15* (LocusLink ID 12155), *Btg4* (LocusLink ID 56057), *Cdc25a* (LocusLink ID 12530), *Col18a1* (LocusLink ID 12822), *Cyp11a* (LocusLink ID 13070), *D7Ertd784e* (LocusLink ID 52428), *Dctn1* (LocusLink ID 13191), *Dstn* (LocusLink ID 56431), *Dtx2* (LocusLink ID 74198), *E130301L11Rik* (LocusLink ID 78733), *E2f1* (LocusLink ID 13555), *Fmn2* (LocusLink ID 54418), *Folr4* (LocusLink ID 64931), *Gdf9* (LocusLink ID 14566), *Hic2* (LocusLink ID 58180), *Ing5* (LocusLink ID 66262), *Itga3* (LocusLink ID 16400), *Kars-ps1* (LocusLink ID 85307), KRAB box zinc finger (LocusLink ID 170763), *Krt2--16* (LocusLink ID 16680), *MGC32471* (LocusLink ID 212980), *MGC38133* (LocusLink ID 243362), *MGC38960* (LocusLink ID 235493), *Mitc1* (LocusLink ID 75901), *Mkrn1* (LocusLink ID 54484), *Mov10* (LocusLink ID 17454), *Mtf2* (LocusLink ID 17765), *Oas1d* (LocusLink ID 100535), *Oas1e* (LocusLink ID 231699), *Obox3* (LocusLink ID 246791), *Obox5* (LocusLink ID 252829), *Oosp1* (LocusLink ID 170834), *Pola2* (LocusLink ID 18969), *Prkab1* (LocusLink ID 19079), *Rad54l* (LocusLink ID 19366), *Rcc1* (LocusLink ID 100088), *Rfpl4* (LocusLink ID 192658), *Rgs2* (LocusLink ID 19735), *Rnf35* (LocusLink ID 260296), *Rnpc1* (LocusLink ID 56190), *Scmh1* (LocusLink ID 29871), *Sfmbt* (LocusLink ID 54650), *Slc21a11* (LocusLink ID 108116), *SMARCC2* (LocusLink ID 6601), *Smarcf1* (LocusLink ID 93760), *Smtn* (LocusLink ID 29856), *Spin* (LocusLink ID 20729), *Tcl1* (LocusLink ID 21432), *Tcl1b1* (LocusLink ID 27379), and *Tcl1b3* (LocusLink ID 27378).
The GenBank (<http://www.ncbi.nih.gov/Genbank/index.html>) accession numbers of new ESTs reported in this paper are AA406988--AA407326, AA409386--AA409982, AA409984--AA410173, AW536060--AW536143, AW537733--AW537828, AW545917--AW545921, BE824469--BE825132, BI076411--BI076872, BM114148--BM121445, BM121647--BM125459, BM194710--BM203257, BM203259--BM214569, BM214575--BM251183, BM293391--BM293823, BU576966--BU576966, CA530650--CA580325, CA870176--CA882792, CA882932--CA896558, CD538085--CD544029, CD544034--CD555913, CD559752--CD565790, CF153424--CF161651, and CF161657--CF175178.
We thank M. A. Espiritu, A. Ebrahimi, J. J. Evans, S. J. Olson, M. Roque-Briewer, and N. Caffo at Applied Biosystems for contract-based sequencing and S. Chacko for setting up the mouse genome database on Biowulf. This study utilized the high-performance computational capabilities of the Biowulf/LoBoS3 cluster at the National Institutes of Health (NIH), Bethesda, Maryland, United States of America. Sequencing of cDNA clones was solely supported by the research and development funds of the National Institute on Aging (NIA). The project was mainly supported by the Intramural Research Program of the NIA. The collection of HS cells has been funded in part with federal funds from the National Cancer Institute, under contract number NO1-CO-5600.
**Conflicts of interest.** The authors have declared that no conflicts of interest exist.
**Author contributions.** MSHK conceived and designed the experiments. YP, RM, GF, PRM, CAS, UCB, YW, MGC, TH, KA, HA, LS, TST, WLK, TY, SAJ, SP, and MSHK performed the experiments. AAS, YP, RM, DBD, YQ, VV, GF, J. Kelso, WH, and MSHK analyzed the data. RN, KRB, DDT, RJH, DLL, DS, J. Keller, EK, GHK, AU, AV, JR, TK, BLMH, AC, MD, J. Kelso, and WH contributed reagents/materials/analysis tools. AAS, YP, RM, VV, GF, and MSHK wrote the paper.
Academic Editor: Patrick Tam, University of Sydney
ATCC
: American Type Culture Collection
2D
: two dimensional
3D
: three dimensional
EG
: embryonic germ (cell)
ES
: embryonic stem (cell)
EST
: expressed sequence tag
FDR
: false discovery rate
GAP-DH
: glyceraldegyde-3-phosphate dehydrogenase
HS
: hematopoietic stem/progenitor (cell)
LIF
: leukemia inhibitory factor
MS
: mesenchymal stem (cell)
NCBI
: National Center for Biotechnology Information
NIA
: National Institute on Aging
NS
: neural stem/progenitor (cell)
ORF
: open reading frame
PC1
: first principal component
PCA
: principal component analysis
PGC
: primordial germ cell
TS
: trophoblast stem (cell)
VRML
: virtual reality modeling language
| {
"pile_set_name": "PubMed Central"
} |
Bekæmpelse af skattesvig (forhandling)
Formanden
Næste punkt på dagsordenen er betænkning af Sharon Bowles for Økonomi- og Valutaudvalget om det nødvendige i, at der udvikles en samordnet strategi til forbedring af bekæmpelsen af skattesvig.
Sharon Bowles
ordfører. - (EN) Hr. formand! Jeg vil gerne først benytte lejligheden til at takke kollegerne for deres bidrag, især på et eller to punkter, hvor vi stadig har forskellige opfattelser. Jeg tror, der er mere, der samler end skiller os, og at vi kan nå til et tilfredsstillende resultat, hvis vi ikke bevæger os for langt væk fra det centrale emne.
De almene principper, der ligger til grund for denne betænkning om skattesvig, er enkle, og kun bedragerne selv kan være uenige heri. Det er svært at vurdere afgiftstab som følge af svig. Bedragere og skatteunddragere sørger for at skjule deres aktiviteter for skattemyndighederne, men man anslår, at svig beløber sig til 200-250 milliarder euro eller 2-2,5 % af EU's totale BNP.
Mit spørgsmål er, om vi sætter 2-2,5 % af vores samlede indsats ind på at løse det? Eftersom svaret på dette spørgsmål er et klart nej, kan der kun være én konklusion. Der kræves større indsats, mere opmærksomhed og især en større samlet opmærksomhed i et samarbejde mellem medlemsstaterne.
Momssvig, især svig med forsvunden forhandler eller karruselsvig, er måske den største enkeltårsag til afgiftstab. Det sker, simpelthen fordi der er smuthuller i momssystemerne, hvor moms ikke opkræves på grænseoverskridende handel inden for Fællesskabet. Så momsfrie køb kan videresælges, momsen bliver stukket i lommen, og så forsvinder forhandleren. Uskyldige forhandlere kan blive indviklet i komplekse karruseller, og foranstaltninger inden for medlemsstaterne til bekæmpelse af svig, som f.eks. at indefryse rabatter, kan være til skade for uskyldige virksomheder. Det er et velkendt problem i mit eget land, Det Forenede Kongerige. Så det er endnu en grund til at gribe fat om nældens rod.
Nøgternt set er moms nødt til at forblive en forbrugsskat, der er baseret på at tilfalde skattemyndigheden på bestemmelsesstedet. I betænkningen forslås det at pålægge moms på leverancer inden for Fællesskabet med minimumssatsen på 15 %, hvor de importerende medlemsstater så pålægger deres egne satser i de videre forløb.
De 15 %, der opkræves af oprindelsesmedlemsstaten, skal så afleveres til den medlemsstat, hvor det faktiske forbrug finder sted, ved hjælp af en clearing- eller afregningsmetode. Dette er nu teknisk muligt, så meget desto mere som vi uundgåeligt overgår til realtidsregistrering af transaktioner. Og det behøver ikke blive centraliseret, det kan gøres decentralt eller bilateralt.
Hvad angår andre måder at bekæmpe svig og skatteunddragelse på, er udveksling af oplysninger og samarbejde af central værdi, og, hvis jeg tør sige det: Den "kontanter her og nu”-holdning, der ses nogle steder, hvor man spørger "hvad får jeg ud af det?”, er ikke vejen frem og viser et kortsigtet synspunkt. Tilbagebetalingen kommer på et andet tidspunkt, når man kan anmode herom.
Skattemyndighederne skal vide noget om aktiver for at kunne opspore skjulte indtægter, som måske er udeklarerede, eller selv hidrører fra kriminelle aktiviteter. Dette undermineres, hvis udvekslingen af oplysninger mellem myndighederne begrænses. Her er vi også nødt til at handle internationalt for at være mest effektive.
Endelig fører dette mig frem til en revidering af rentebeskatningsdirektivet. Det er hensigtsmæssigt at overveje dette direktiv igen, f.eks. for at lukke smuthuller som det at bruge alternative, retlige enheder, som f.eks. fonde, for at omgå dets bestemmelser. Kildeskat er ikke ideel, men her er vi delte i spørgsmålet om, om det kan gennemføres uden uønskede konsekvenser.
Disse er de spørgsmål, vi behandler i betænkningen. Jeg anbefaler Dem den og ser med interesse frem til den forestående forhandling.
László Kovács
medlem af Kommissionen. - (EN) Hr. formand! Først og fremmest vil jeg gerne takke Parlamentet og især ordføreren, fru Bowles, for deres meget konstruktive betænkning om en samordnet strategi til forbedring af bekæmpelsen af skattesvig.
I maj 2006 udsendte Kommissionen en meddelelse, hvis formål var at igangsætte en bred debat om de forskellige faktorer, der skal medtages i en strategi til bekæmpelse af skattesvig i Fællesskabet.
Det glæder mig, at Parlamentet anerkender og støtter de initiativer, der er taget, og den holdning, Kommissionen har valgt i sin meddelelse. Ligeledes glæder det mig at se, at Parlamentet inviterer Kommissionen til at stille yderligere forslag.
Betænkningen udgør et meget brugbart og omfattende bidrag til den vedvarende diskussion om bekæmpelse af skattesvig. Kommissionen er helt enig i, at skattesvig ikke er et problem, der kan bekæmpes med held på nationalt niveau alene.
Kommissionen vil medtage de talrige kommentarer og forslag, Parlamentet er kommet med, i sit arbejde med de eksisterende og forestående lovforslag til konventionelle foranstaltninger til bekæmpelse af skattesvig.
Hvad angår afgørelser forudset for 2008, kan jeg bekræfte, at Kommissionen planlægger at fremlægge tre sæt lovforslag - ét i oktober, et andet i november og et tredje i december 2008. Disse sæt foranstaltninger omfatter forbedrede procedurer for registrering og sletning af registreringer af afgiftspligtige personer for at sikre, at falske afgiftspligtige personer hurtigt opdages og slettes i registret, og for at skabe større sikkerhed for ærlige virksomheder. Lovforslagene vil også dække erhvervsdrivendes solidariske hæftelse, oprettelse af et europæisk netværk (EUROFISC) til forbedring af samarbejdet for at opdage bedragere på et tidligt tidspunkt, ordning af betingelserne for momsfritagelse ved import, gensidig hjælp til inddrivelse, automatisk adgang til oplysninger, bekræftelse af navne og adresser på skatteborgere i databasen for systemet til udveksling af momsoplysninger og medansvar for at beskytte alle medlemsstaters skatteindtægter.
Inden oktober vil Kommissionen udsende en meddelelse, hvori den opstiller sammenhængen i den holdning, den vil fremlægge, sammen med en tidsplan for yderligere tiltag. I meddelelsen vil vi også behandle spørgsmål vedrørende en langsigtet holdning, navnlig nødvendigheden af at undersøge, hvordan man kan gøre bedre brug af moderne teknologi, hvilket også er understreget i Deres betænkning.
Kommissionen er stadig åben over for at undersøge alternative systemer til det nuværende momssystem, forudsat visse betingelser opfyldes. I den sammenhæng nævnes der i betænkningen en "reverse-charge”-mekanisme og beskatning af leverancer inden for Fællesskabet. Kommissionen har tilbudt begge disse radikale muligheder til overvejelse hos Økofinrådet, men hidtil har medlemsstaterne ikke vist politisk vilje til at træffe så vidtrækkende foranstaltninger.
Hvad angår direkte skatter, arbejder Kommissionen i øjeblikket på en revidering af rentebeskatningsdirektivet, og det er hensigten at fremlægge en rapport om direktivets funktion før udgangen af september, sådan som Økofinrådet anmodede om den 14. maj 2008. Under revideringsprocessen har vi omhyggeligt analyseret direktivets nuværende rækkevidde og behovet for ændringer for at øge dets effektivitet. Rapporten vil blive fulgt op med et forslag til sådanne ændringer af rentebeskatningsdirektivet, der måtte vise sig nødvendige og hensigtsmæssige. Kommissionen har også omhyggeligt bemærket Økofinrådets konklusioner af samme dato, idet den understreger vigtigheden af at fremme principperne om god regeringsførelse på skatteområdet - dvs. gennemsigtighed, udveksling af oplysninger og rimelig skattekonkurrence - samt inkludering af tilsvarende bestemmelser i aftaler med tredjelande og tredjelandsgrupperinger.
Takket være et tæt samarbejde med medlemsstaterne i Kommissionens ekspertgruppe for strategi til bekæmpelse af skattesvig er idéen om en strategi til bekæmpelse af skattesvig på EU-niveau ved at tage konkret form. De annoncerede foranstaltninger vil være et stort skridt fremad, selv hvis det bliver nødvendigt med en yderligere indsats.
Hvad angår Deres diskussion om skattekonkurrence, ved De sikkert, at vi i Gruppen vedrørende Adfærdskodeksen har arbejdet med at afskaffe skadelige erhvervsbeskatningssystemer i EU. Alt i alt har Gruppen vedrørende Adfærdskodeksen vurderet mere end 400 foranstaltninger i de nuværende 27 medlemsstater og deres besiddelser og oversøiske territorier, og mere end hundrede heraf er vurderet som skadelige. Næsten alle blandt disse hundrede er allerede afskaffet, og resten bliver det i henhold til overgangsordningerne. Arbejdet under kodeksen har været succesrigt og har medført, at næsten alle skadelige skatteforanstaltninger er blevet afviklet i medlemsstaterne og deres afhængige eller tilknyttede territorier.
Sluttelig vil jeg gerne takke Parlamentet for dets konstruktive bidrag til forhandlingen om en samordnet strategi til forbedring af bekæmpelsen af skattesvig.
Othmar Karas
Hr. kommissær, hr. formand, fru ordfører! Tak for det gode samarbejde og Deres betænkning.
Jeg vil gerne nævne fire punkter. Vi mener for det første, at det er vigtigt at understrege, at skattesvig ikke kan bekæmpes isoleret, og at der er behov for en samordnet indsats både blandt de enkelte medlemsstater og med tredjelande. For det andet er de planlægte pilotprojekter til bekæmpelse af karruselsvig en god idé, som vi tager til efterretning, men vi vil gerne påpege, at det ikke må føre til en forringelse af rammebetingelserne for små og mellemstore virksomheder. For det tredje støtter vi udtrykkeligt Kommissionens forslag til ændring af momsdirektivet og forordningen om administrativt samarbejde på området. For det fjerde er jeg glad for, at der ikke var flertal for en generel ophævelse af bankhemmeligheden i nogen af udvalgene, og idéen således er blevet forkastet af et stort flertal.
Werner Langen
Hr. formand! Jeg vil gerne tilslutte mig lykønskningerne af ordføreren. Bekæmpelse af skattesvig har været et tema i Parlamentet i årevis, og til trods for mange initiativer og omfattende støtte fra Parlamentet har kommissæren desværre kun kunnet fremvise meget begrænsede resultater - selv om der er stort behov for dem - fordi medlemsstaterne i større eller mindre grad har stillet sig hindrende i vejen. Man skulle tro, at det var i medlemsstaternes interesse at gøre fremskridt inden for bekæmpelse af skattesvig, for vi taler om et beløb på 200 milliarder euro om året - dvs. mere end EU's budget - der kan hentes hjem igen uden at hæve skatterne for de ærlige skatteborgere. I enhver debat om sagen er det derfor vigtigt at understrege, at noget af ansvaret ligger hos medlemsstaterne selv.
Det viste sig at være vanskeligt at få betænkningen vedtaget, fordi der i starten opstod problemer om et specielt punkt i udvalget, men det er løst nu. Fru Bowles viste stor vilje til at samarbejde. For vores vedkommende var det en vanskelig betænkning, fordi den indeholdt et ændringsforslag, som vi ikke kan støtte. Selv nu er der forslag om at presse den sidste dråbe ud af skatteyderne og skattekilderne. Om det er hensigtsmæssigt eller blot vil medføre nye lovovertrædelser, må vi vente og se. Men vi kan frem for alt ikke støtte ændringsforslag 4, som blev stillet af to medlemmer af Den Socialdemokratiske Gruppe og tager sigte på at afskaffe rentebeskatningsdirektivet.
Vores holdning er således som følger: Vi støtter fuldt ud fru Bowles' betænkning i alle andre henseender, men hvis der bliver flertal for ændringsforslag 4 om at afskaffe rentebeskatningsdirektivet, så vil vi forkaste betænkningen som helhed.
Benoît Hamon
Hr. formand! Jeg vil på min side også gerne takke fru Bowles for det flotte arbejde og for det resultat, vi kom frem til i Økonomi- og Valutaudvalget, om en så vigtig tekst som denne. Jeg vil gerne minde vores kolleger om, at de offentlige finanser i dag unddrages 200-250 milliarder euro på grund af skatte- og afgiftssvig i det indre marked. Disse forsvundne milliarder betyder så mange færre offentlige investeringer, så mange færre skoler, offentlige tjenester og sociale behov, som ikke kan tilfredsstilles. Naturligvis bliver de ofte dækket ved en forhøjelse af andre skatter, der rammer de ærligste og langt mindre velstående skatteborgere, som ikke har lyst eller lejlighed til at give sig af med skatteflugt og skattefiduser.
Det glæder mig, at der er bred enighed i Parlamentet om at gøre en ende på momssvig og udnyttelse af svaghederne i overgangsordningen fra 1993. Siden Liechtensteinskandalen er alle bekendt med, at det største skattesvig også skyldes, at store kapitalejere anbringer betydelige summer i tredjelande, ofte skattely, for at unddrage sig beskatning.
EU råder altså over et instrument til bekæmpelse af denne form for svig, nemlig rentebeskatningsdirektivet. Som fru Bowles har pointeret, er der imidlertid for mange huller i dette direktiv, der kun gælder fysiske personers renteindtægter. Det er altså stadig alt for let at oprette fiktive juridiske personer - sommetider med en enkelt parthaver eller aktionær - eller opfinde finansielle indtægter, som strengt taget ikke er renter, for at undgå beskatning.
Det er derfor absolut nødvendigt og et moralsk krav at udvide dette direktivs anvendelsesområde, som det foreslås i betænkningen, således at det i det mindste bliver mindre let at begå skattesvig.
Jeg må indrømme, at PPE's ændringsforslag forbavser og skuffer mig på grund af spagfærdigheden såvel som indstillingen, fordi det egentlig går ud på ikke at lave om på noget, men bevare status quo med hensyn til skattesvig.
Vi vil forelægge den europæiske opinion disse holdninger, bl.a. den tyske opinion, og vi får se, hvordan den tyske og europæiske opinion dømmer de valg, der træffes her. Jeg har hørt heftige ytringer om skattesvig i medierne, bl.a. de tyske. Her i Europa-Parlament træffes andre valg i stilhed. Jeg håber, de europæiske borgere vil opkaste sig til dommere i denne sag.
Zbigniew Krzysztof Kuźmiuk
for UEN-Gruppen. - (PL) Hr. formand, hr. kommissær! Jeg vil gerne gøre opmærksom på tre forhold i denne forhandling. Det vurderes for det første, at afgiftstabene ved svig med moms og punktafgifter udgør over 2 % af EU's BNP, hvilket svarer til et beløb på 200-250 milliarder euro. Der er altså tale om enorme beløb, der udhuler de nationale budgetter, men det indvirker også på indtægtsstrukturen i EU-budgettet, da det medfører et øget behov for at anvende medlemsstaternes egne ressourcer på baggrund af bruttonationalindkomsten.
På trods af denne diagnose kan betænkningens forslag om transaktioner inden for Fællesskabet for det andet skabe mere skade end gavn. Det handler bl.a. om reverse-charge-mekanismen, altså en afgift betalt af modtageren frem for leverandøren, samt ønsker om at harmonisere momssatserne, hvilket i praksis vil fjerne de lave satser. Det handler sluttelig om oprettelsen af et clearinginstitut, der skal afregne skat mellem medlemsstaterne.
Det forekommer for det tredje nødvendigt, at medlemsstaternes skattemyndigheder indgår i et tættere samarbejde for at begrænse skattesviget. Samarbejdet skal først og fremmest indebære en hurtigere informationsudveksling, og måske automatisk adgang til skatteoplysninger om moms og punktafgifter.
Hans-Peter Martin
(DE) Hr. formand! Jeg har bedt om ordet af to grunde. For det første fordi det er et emne, vi - som hr. Langen sagde - har haft på dagsordenen i mange år, og vi virkelig bør spørge os selv, hvorfor der ikke bliver gjort fremskridt, særligt når vi taler om momsunddragelse. For det andet er det uacceptabelt for et flertal af europæerne, at vi så hyklerisk taler om skatteunddragelse og -svig - det er jo skatteborgernes penge - uden at tage de problemer op, vi selv har her i Parlamentet.
Parlamentet, repræsenteret ved mange parlamentsmedlemmer, er et arnested for svig. Det kan vi læse om i hr. Galvins betænkning og også andre steder, men det forsøges fejet ind under gulvtæppet. Jeg behøver blot at nævne hr. Chichester, hr. Purvis eller visse parlamentsmedlemmer fra De Liberale. Det er skandaløst. Så længe vi ikke tager os af tilfældene af svig i egne rækker, er vi ikke troværdige og har ikke ret til at kritisere andre.
Jeg opfordrer OLAF, og især Parlamentets administration og grupperne, til at skabe klarhed her. Det er uhyrligt, at der bliver gjort forsøg på at skjule noget her.
Zsolt László Becsey
- (HU) Hr. formand! Tak. Jeg er meget glad for, at en fællesskabsstrategi er på vej på dette område, omend langsomt, måske for langsomt. Jeg er enig i, at bekæmpelse af skattesvig på den ene side skal indarbejdes i medlemsstaternes individuelle, nationale forpligtelser, men det skal også indarbejdes i Fællesskabets Lissabonprogram.
Mine betragtninger er som følger: For det første er jeg ikke enig i ordlyden i Parlamentets betænkning, hvor der står, at en styrkelse af skattekonkurrencen ville skabe unødvendige forvridninger i det indre marked og underminere den sociale model. Det afspejler en besættelse af at fastlægge minimumsniveauer for beskatning på hvert eneste beskatningsområde, der findes, hvilket faktisk ville skabe uretfærdighed foruden inflation, eftersom det ville ramme dem, der ellers har beskikket deres huse og kan sænke skatterne. Med hensyn til indirekte beskatning, som også hører ind under Fællesskabets kompetence, er det uacceptabelt med en politik, hvor man udelukkende refererer til minimumsværdier, uden at man får os til at regulere maksimum. Jeg vil gerne have det noteret, at arnestedet for det misbrug, der sker med punktafgifter, er stigningen i minimumsniveauer, fordi det stimulerer udbredelsen af sortbørsøkonomi og fremstilling af hjemmelavede produkter, hvilket er i modstrid med alle Fællesskabets politikker. Dernæst er jeg på momsområdet glad for den politik, at man tager små skridt, og for den eksperimentelle idé med "reverse-charge”, men der er også brug for beslutsomme skridt fremad her. Efter min mening ville dette, med det teknologiniveau, vi har i dag, let kunne gøres for grænseoverskridende transaktioner inden for et indre marked, og en leverandørs moms til bestemmelseslandet ville let kunne inddrives og overføres til bestemmelseslandet. For at kunne gøre dette skal der selvfølgelig være større vilje til samarbejde mellem skattemyndighederne i medlemsstaterne, hvilket stadig mangler, og vi kan tage en dyb indånding og opnå dette nu, hvor euroen er indført, og betalingstjenestedirektivet er kommet til verden. Endelig føler jeg, det er vigtigt at træffe foranstaltninger vedrørende især offshorevirksomheders virke uden for Unionen, fordi skattegrundlaget ofte kanaliseres dér før beskatning, før den sendes tilbage til virksomheder i Unionen via snuskede transaktioner for at undgå skat, og det er ikke til gavn for det at vælge en favorabel skattemæssig beliggenhed.
Antolín Sánchez Presedo
. - (ES) Hr. formand! Hr. kommissær Kovács, mine damer og herrer, skatteunddragelsen i Europa vurderes til at overstige 6 % af skatteindtægterne, og det er nedbrydende for tilliden til skattesystemerne, skattemyndighedernes evner og rimelige behandling samt borgernes velfærd. Skattesvig danner grobund for sort arbejde og organiseret kriminalitet.
På EU-plan påvirker skattesviget det indre markeds ordentlige funktion, det forvrider konkurrencen og skader EU's finansielle interesser samt opfyldelsen af Lissabonstrategien.
Hvis en fjerdedel af verdens rigdom, som ifølge oplysninger fra Den Internationale Valutafond er skjult i skatteparadiser, betalte skat, kunne vi med lethed opfylde alle FN's milleniumsmål.
EU bør være hård i bekæmpelsen af skattesvig. Det er muligt at gøre det sikkert og ansvarligt og uden at skabe ekstraordinært store byrder for vores økonomi. Væksten i den grænseoverskridende handel og virkningerne af globaliseringen gør det påkrævet at fremme en beslutsom strategi mod skattesvig på europæisk plan, for det er ikke længere nok med nationale aktioner.
Denne strategi bør have en intern dimension og behandle de problemer, som skatteunddragelsen giver anledning til i forbindelse med momsen og andre særskatter, hvortil kommer problemerne med skatteunddragelse i forbindelse med de direkte skatter. Strategien bør derudover have en ekstern dimension for at understrege EU's økonomisk vægt.
Vi må ikke skuffe vores borgere, som opfylder deres skatteforpligtelser til punkt og prikke, og som forventer et lederskab fra EU's side.
I denne forbindelse kræver vi, at den pakke af foranstaltninger til bekæmpelse af momssvig, som Kommissionen vil forelægge til oktober, bliver ambitiøs, og at den betænkning, der er planlagt til at komme i slutningen af denne måned om gennemførelse af beskatning af opsparing, bliver nyttig, så vi kan tage et definitivt skridt i bekæmpelsen af svig på dette område i Europa. Vi er glade for det generelle indhold i Bowles-betænkningen, og vi lykønsker ordføreren og håber, at den bliver vedtaget i plenarforsamlingen, og hvis den ikke bliver forbedret, håber vi, at den i det mindste ikke bliver forringet.
Desislav Chukolov
- (BG) Hr. formand! Jeg beundrer Deres ønske, fru Bowles, om at få bugt med skattesvig på EU-niveau.
Overvej dog, hvad dette vil betyde for dem, der regerer Bulgarien nu. Hvis der ikke kommer flere tilfælde af skattesvig i Bulgarien, forsikrer jeg Dem for, at ved det næste valg vil de liberale fra det muslimske parti Movement for Rights and Freedoms (MRF) ikke engang vinde det halve antal af de stemmer, de vinder nu. Hvis tyveriet af offentlige midler i mit land standses én gang for alle, kan socialisterne ikke længere sponsorere deres kampagner eller deres absurde initiativer.
Som medlem af Attackpartiet vil jeg støtte denne betænkning, for Attack er det eneste parti i Bulgarien, der arbejder for at standse omdirigeringen af statsmidler, og Attack er et parti, hvis program omfatter en fast forpligtelse til at gennemgå alle lyssky og anløbne forretninger, som har været til skade for statsbudgettet, og som indtil nu ikke har været til gavn for nogen politiske kræfter.
Astrid Lulling
- (FR) Hr. formand! Lad mig først sige til hr. Hamon, at hans trussel på ingen måde skræmmer os, og jeg beklager, at han åbenbart er offer for en vældig misforståelse.
Jeg billiger i hovedtrækkende fru Bowles' betænkning, men vil dog fremhæve et par punkter. For det første har overgangsordningen for moms fra 1993 vist sin begrænsning. Jeg mener ikke, vi kan nøjes ret meget længere med noget midlertidigt, som varer ved. Skattesvig, som vi alle fordømmer på grund af de direkte og indirekte virkninger, skyldes til dels mangler i det nuværende system. Derfor skal det ændres. Jeg er udmærket klar over, at det er forbundet med visse problemer. Derfor henstiller jeg til Kommissionen at fremme den løsning, organisationen RTvat har udtænkt, og som vil forhindre et afgiftsindtægtstab på 275 millioner euro om dagen og samtidig formindske de administrative udgifter for små og mellemstore virksomheder.
Det andet punkt drejer sig om skatteunddragelse i tilknytning til rentebeskatningsdirektivet. Betænkningen indeholder ubegrundede bemærkninger, som fik mig til at stille nogle ændringsforslag, der skulle rette op på situationen. Bekæmpelse af skattesvig er berettiget og nødvendig, men må ikke foranledige os til at rejse tvivl om princippet om skattekonkurrence. Det nægter jeg pure, for de to ting har intet med hinanden at gøre. Desuden viser erfaringen, at det er mere hensigtsmæssigt at indeholde kildeskat på renteindtægter, selv om man alle steder forsøger at påtvinge det forfejlede system for udveksling af oplysninger.
Endelig er kravene om at ændre nævnte direktiv hen mod en udvidelse af anvendelsesområdet, så det omfatter alle retlige enheder og alle andre indtægtsskabende kilder, også meget uigennemtænkte, fordi det blot vil bevirke, opsparet kapital jages ud af EU. Derfor vil jeg have disse punkter ændret, for ellers vil vi ikke stemme for denne betænkning.
Andrzej Jan Szejna
(PL) Hr. formand! Skattesvig har en vis tid udgjort et globalt problem. Tabene vurderes til at udgøre 2-2,5 % BNP, hvilket er 200-250 milliarder euro på europæisk plan. Det er derfor meget nødvendigt at koordinere handlingerne på fællesskabsplan og skabe et tættere samarbejde mellem medlemsstaterne.
EF-traktatens artikel 10 og 280 fastsætter, at medlemsstaterne skal træffe passende foranstaltninger for at opfylde traktatens krav og samordne deres optræden med henblik på at beskytte fællesskabets finansielle interesser. Vi skal huske på, at den frie bevægelighed for varer og tjenesteydelser inden for fællesskabsmarkedet gør det vanskeligt for medlemsstaterne individuelt at bekæmpe denne form for svig. De iværksatte tiltag må dog ikke skabe hindringer for den økonomiske aktivitet eller skabe unødvendige byrder for skatteyderne.
László Kovács
medlem af Kommissionen. - (EN) Hr. formand! Allerførst vil jeg gerne takke medlemmerne af Parlamentet for de kommentarer og synspunkter, de har givet udtryk for under forhandlingen.
Som jeg sagde i mine indledende bemærkninger, sætter Kommissionen meget stor pris på Parlamentets bidrag til forhandlingen om en samordnet strategi til forbedring af bekæmpelsen af skattesvig. Kommissionen har påtaget sig sit ansvar og vil tage yderligere skridt til at styrke de retlige rammer og det administrative samarbejde mellem medlemsstaterne. Medlemsstaterne skal bestemt gøre det samme.
Nogle iblandt Dem har refereret til revideringen af rentebeskatningsdirektivet, og jeg kan forsikre Dem om, at den igangværende revidering er meget grundig. Vi undersøger detaljeret, om den nuværende rækkevidde er effektiv og fordele og ulemper ved at udvide den. Det er en kompleks sag, hvor mange faktorer skal tages i betragtning: effektivitet med hensyn til at overholde skatteregler; administrative byrder for markedsoperatører og også for skattestyrelser; behov for lige konkurrencevilkår både inden for EU og i forhold til verden udenfor - for blot at nævne nogle få. Som jeg sagde tidligere, fremlægger vi snart rapporten. Den vil blive fulgt op af forslag til ændringer af rentebeskatningsdirektivet, og vi vil gøre vores yderste for at ramme den rigtige balance.
Det er klart, at der ikke findes nogen enkeltstående og global løsning til eliminering af skattesvig. Med hver enkelt foranstaltning bør der tilføres værdi, men kun ved at gennemføre dem i deres helhed får skattemyndighederne udvidet rammerne til bekæmpelse af skatteunddragelse og skattesvig.
Sharon Bowles
ordfører. - (EN) Hr. formand! Skattesvig er EU's sag, fordi bedragere udnytter grænseoverskridende smuthuller, og det er dem, vi forsøger at lukke.
Som kommissæren siger, er spørgsmålene om rentebeskatning komplekse. Jeg tror, det er muligt for os at nå til enighed ved vores afstemning om, at vi ikke kommer de mere detaljerede drøftelser for meget i forkøbet, som vi er nødt til at tage om dette emne, når Kommissionen fremkommer med sine næste forslag. Jeg tror ligeledes, at vi også kan undgå at referere til skattekonkurrence, hvor vores opfattelser er forskellige, men hvor emnet ikke er afgørende i denne betænkning. Jeg tror derfor, vi kan opnå nogen enighed iblandt os.
På alle disse fronter mener jeg ikke, at manglende handling eller foreløbig handling er noget hensigtsmæssigt svar. 2,5 % af BNP er på spil. Det er kæmpe luns af skattegrundlaget. Som vores kollega Sánchez Presedo påpeger, er det muligvis 5 % af skatten.
Hvis nogen politiker her eller i nogen medlemsstat ville drive kampagne på basis af at sætte skatten op med 5 % for at betale for ingenting, ville de ikke komme ret langt. Så, og dette siger jeg til medlemsstaterne i særdeleshed, at blive kilden med hensyn til udveksling af oplysninger, foretage sig et minimum og være frygtsom, det er nøjagtig det samme som en skat på 5 % for ingenting, for det er, hvad det koster den ærlige skatteborger. Det er den besked, jeg ønsker at sende med denne betænkning, og jeg tror på, at det er den kollektive besked, som Parlamentet ønsker at sende med denne betænkning, idet Parlamentet støtter kommissæren i hans indsats og tilskynder ham til at være dristig.
Formanden
Forhandlingen er afsluttet.
Afstemningen finder sted tirsdag.
Skriftlig erklæring (artikel 142)
Siiri Oviir
skriftlig. - (ET) Skattesvig er et problem for både EU og medlemsstaterne, idet konkurrencen forvrides, og indtægtsgrundlaget for EU såvel som for medlemsstaterne reduceres.
En af årsagerne til problemet anføres at være den nuværende overgangsordning for moms, der er kompleks og forældet. Den trænger til opdatering. I den henseende er Parlamentets forslag om, at Kommissionen kommer med en beslutning om en ny momsordning i 2010, uden tvivl velkommen.
Ved udarbejdelsen af en ny momsordning skal man naturligvis sikre, at det nuværende afgiftssystem ikke erstattes af ét, der er mere komplekst og bureaukratisk. Det er naturligvis også vigtigt at understrege, at det, før det anvendes i hele EU, skal afprøves i et pilotprojekt for at sikre, at det fungerer i praksis, for det vil forhindre mange problemer, der kan vise sig senere hen.
Et lige så vigtigt skridt til at bekæmpe skattesvig er at opdatere tilgængeligheden af oplysninger mellem staterne, en proces, der kunne understøttes med oprettelse af et paneuropæisk informationscenter om e-skatteforvaltning.
Balancen mellem offentlighedens interesse og individets grundlæggende rettigheder og frihedsrettigheder vil ikke blive tilsidesat, når personlige oplysninger behandles.
Endelig skal udtrykket "skattely” også, i lyset af stridsspørgsmålet her, anses som vigtigt. Jeg bifalder de idéer, der er fremsat i betænkningen om, at EU bør gøre det til et prioriteringsområde at eliminere skattely globalt set.
| {
"pile_set_name": "EuroParl"
} |
Distinguishing the cyanobacterial neurotoxin beta-N-methylamino-L-alanine (BMAA) from its structural isomer 2,4-diaminobutyric acid (2,4-DAB).
The cyanobacterial neurotoxin beta-N-methylamino-L-alanine (BMAA) has been associated with certain forms of progressive neurodegenerative disease, including sporadic Amyotrophic Lateral Sclerosis and Alzheimer's disease. Reports of BMAA in cyanobacterial blooms from lakes, reservoirs, and other water resources continue to be made by investigators in a variety of laboratories. Recently it was suggested that during analysis BMAA may be confused with its structural isomer 2,4-diaminobutyric acid (2,4-DAB), or that current detection methods may mistake other compounds for BMAA. We here review the evidence that BMAA can be consistently and reliably separated from 2,4-DAB during reversed-phase HPLC, and that BMAA can be confidently distinguished from 2,4-DAB during triple quadrupole LC-MS/MS analysis by i) different retention times, ii) diagnostic product ions resulting from collision-induced dissociation, and iii) consistent ratios between selected reaction monitoring (SRM) transitions. Furthermore, underivatized BMAA can be separated from 2,4-DAB with an amino acid analyzer with post-column visualization using ninhydrin. Other compounds that may be theoretically confused with BMAA during chloroformate derivatization during GC analysis are distinguished due to their different retention times. | {
"pile_set_name": "PubMed Abstracts"
} |
Luque (disambiguation)
Luque may refer to:
Luque, a city in Central Department, Paraguay
Luque, Spain, a city in Spanish province of Córdoba
People
Luque is a surname of Spanish and Portuguese origin and refers to:
Hernando de Luque (d. 1533), Spanish priest
Leopoldo Luque (b. 1949), Argentine football player
Albert Luque (b. 1979), Spanish football player
Eduardo Castro Luque, assassinated Mexican politician
Dolf Luque (1890–1957), former early 20th century Cuban Major League Baseball pitcher
José Juan Luque (b.1977), former Spanish football player
Vicente Luque (b. 1991), Brazilian mixed martial artist | {
"pile_set_name": "Wikipedia (en)"
} |
Our Secret Weapon: The Truth
Our Secret Weapon: The Truth was a public affairs program broadcast on the DuMont Television Network from October 22, 1950 to April 17, 1951 and hosted by conservative commentators Leo Cherne and Ralph de Toledano.
Production
Our Secret Weapon: The Truth had its origins in the Freedom House radio program Our Secret Weapon (1942–43), a CBS Radio series hosted by Rex Stout, which was created to counter Axis shortwave radio propaganda broadcasts during World War II.
The concept was revived during the Korean War as a weekly series that would "answer Communist lies about us" with testimony from special guests. The program featured conservative commentators Leo Cherne and Ralph de Toledano.
Episode status
As with most DuMont series, no episodes are known to exist.
See also
List of programs broadcast by the DuMont Television Network
List of surviving DuMont Television Network broadcasts
References
Bibliography
David Weinstein, The Forgotten Network: DuMont and the Birth of American Television (Philadelphia: Temple University Press, 2004)
Alex McNeil, Total Television, Fourth edition (New York: Penguin Books, 1980)
Tim Brooks and Earle Marsh, The Complete Directory to Prime Time Network TV Shows, Third edition (New York: Ballantine Books, 1964)
External links
DuMont historical website
Category:DuMont Television Network original programming
Category:1950 American television series debuts
Category:1951 American television series endings
Category:1950s American television series
Category:Black-and-white television programs
Category:Lost television programs | {
"pile_set_name": "Wikipedia (en)"
} |
184 S.W.3d 521 (2005)
Sharon Jo Ann HARRISON Appellant,
v.
George R. VALENTINI, M.D. Appellee.
No. 2004-SC-000015-DG.
Supreme Court of Kentucky.
December 22, 2005.
As Modified on Denial of Rehearing March 23, 2006.
*522 Freeda M. Clark, Louisville, KY, Counsel for Appellant.
Craig L. Johnson, Whonsetler & Johnson, PLLC, Louisville, KY, Counsel for Appellee.
LAMBERT, Chief Justice.
This case arises from medical complications ensuing from breast lift surgery. The Appellant, Sharon Jo Ann Harrison filed a medical negligence claim against Dr. George Valentini who performed the lift surgery and administered follow-up care. The trial court dismissed the action *523 as time-barred and the Court of Appeals affirmed. We granted discretionary review to consider whether the continuing treatment Appellant received from Appellee tolled the applicable statute of limitations, rendering her claim timely. Our close examination of the doctrine and its rationale convinces us to answer in the affirmative.[1] We therefore reverse and remand the case to the trial court for further proceedings.
Ms. Harrison, who had previously received breast implants, underwent breast lift surgery on October 2, 1997. She began experiencing complications within a couple of weeks. Specifically, she experienced drainage from her breasts and skin deterioration, ultimately resulting in the loss of her left nipple and numbness in her right nipple. Dr. Valentini made several subsequent unsuccessful attempts to replace her nipple and to correct additional disfigurement resulting from the 1997 surgery. Appellant remained in Dr. Valentini's care for nearly three years. During this time she had initial consultations with three other doctors to explore additional treatment options, but each told her to give the healing process more time or suggested that she remain in Dr. Valentini's care. She continued primary treatment with Dr. Valentini until April 11, 2000.
On November 16, 2000, more than three years after the 1997 surgery, but within one year of Harrison's last appointment with Dr. Valentini, suit was filed. After preliminary discovery, Dr. Valentini moved for summary judgment on two grounds: 1) that Ms. Harrison's action should be barred by the applicable statute of limitations and 2) that Ms. Harrison failed to offer adequate expert testimony that Dr. Valentini's treatment deviated from the requisite standard of care. The trial court granted summary judgment in Dr. Valentini's favor, holding that Ms. Harrison's cause of action was barred by the statute of limitations. The Court of Appeals affirmed. Neither court reached the issue of the sufficiency of the expert testimony on the standard of care issue.
On her appeal to this Court, Ms. Harrison contends that the statute of limitations should have been tolled because Dr. Valentini obstructed her from filing suit, and/or that this Court should recognize the continuous course of treatment rule. As there is little evidence of obstruction, we need not address the issue. Rather, the fact of Appellant's continuing treatment by Dr. Valentini will be our decisional basis.
Generally, a medical negligence lawsuit must be brought within one year of the date the cause of action accrues or is discovered.[2] This rule, which is codified in KRS 413.140(2), establishes the time that the action accrues if an injury is not immediately discoverable.[3] It establishes the date of accrual as the date that the injury is or, with reasonable care, should have been discovered.[4]
Applying the rule in medical malpractice cases can be confusing because *524 "injury" is a term of art in the law.[5] Undesirable results of medical treatment do not constitute compensable injury.[6] Rather, such injury is defined as "the invasion of any legally protected interest of another."[7] Thus, "[legal] injury in the medical malpractice context refers to the actual wrongdoing, or the malpractice itself."[8]
Accordingly, under the discovery rule, actual or constructive knowledge of the medical negligence triggers the commencement of the statute of limitations.[9] This is problematic because often the patient cannot know whether the undesirable outcome is simply an unfortunate result of proficient medical care or whether it is the consequence of substandard treatment. Thus, a patient is left to speculate about the cause of the problem.
Moreover, neither the discovery rule nor KRS 413.190 affords the physician and patient an opportunity to significantly cooperate with each other to improve the initial results or mitigate the damages caused by the poor treatment. Rather the patient is required to file suit immediately to avoid the risk of his suit being time-barred.[10] Such a requirement operates to undermine rather than bolster the relationship of trust and confidence that a patient should be able to have with his or her physician.[11]
Ms. Harrison suggests that the continuous course of treatment doctrine can eliminate these concerns. Under this doctrine, the statute of limitations is tolled as long as the patient is under the continuing care of the physician for the injury caused by the negligent act or omission.[12]
This court has previously held that the continuous representation rule in legal malpractice cases coalesces with the legislative intent inherent in the enactment of the discovery rule. In Alagia, Day, Trautwein & Smith v. Broadbent,[13] this Court elaborated on the underlying principles for the continuous representation rule:
[W]e believe it [the continuous representation rule] reflects the intent of the general assembly with its enactment of the discovery rule. Moreover, we perceive a practical advantage in the continuous representation rule. In a proper case, a negligent attorney may be able to correct or mitigate the harm if there is time and opportunity and if the parties choose such a course. Without it, the client has no alternative but to terminate the relationship, perhaps prematurely, and institute litigation.
These sound principles are equally persuasive in the context of medical malpractice.
The rationale for the continuous treatment exception rests on a number of doctrinal assumptions. Thus it is posited that the trust and confidence that marks the physician-patient relationship puts the patient at a disadvantage to question the doctor's techniques, and gives the patient the right to rely upon the doctor's professional skill without the necessity of interrupting a continuing course of treatment by instituting suit. This exception not only provides the patient with the opportunity to seek *525 corrective treatment from the doctor, but also gives the physician a reasonable chance to identify and correct errors made at an earlier stage of treatment.[14]
Though this Court has never squarely addressed the continuous course of treatment doctrine, we have implicitly expressed our approval of the doctrine's rationale through discourse concerning the discovery rule in the medical malpractice arena. Specifically, in Wiseman v. Alliant Hospitals, Inc.,[15] we stated:
One who possesses no medical knowledge should not be held responsible for discovering an injury based on the wrongful act of a physician. The nature of the tort and the character of the injury usually require reliance on what the patient is told by the physician or surgeon. The fiduciary relationship between the parties grants a patient the right to rely on the physician's knowledge and skill.
It is entirely logical that the patient's right of reliance extends throughout his treatment with the physician. While treatment continues, the patient's ability to make an informed judgment as to negligent treatment is impaired. Under such circumstances, it can scarcely be said that discovery has occurred. Accordingly, a continuing course of treatment has the effect of preventing discovery of a character necessary to commence the running of the statute of limitations.[16]
This rule should be limited, however, by a requirement of patient good faith. Inherent in the doctrine is the expectation that the patient and physician harbor a genuine desire to improve the patient's condition. No benefits will inure to a patient who feigns a desire to continue treatment for the purpose of obtaining more time to "shop around" for another physician to corroborate the malpractice or for a lawyer to file suit. Claims of patient bad faith shall be heard and determined by the trial court and subject to appellate review for abuse of discretion. However, where a patient relies, in good faith, on his physician's advice and treatment or, knowing that the physician has rendered poor treatment, but continues treatment in an effort to allow the physician to correct any consequences of the poor treatment, the continuous course of treatment doctrine operates to toll the statute of limitations until the treatment terminates at which time running of the statute begins.
Applying the foregoing rule in the instant case, we hold that Ms. Harrison's suit against Dr. Valentini was timely filed. She filed suit on November 16, 2000, well within one year of her discontinuance of treatment with Dr. Valentini.
As the trial court and Court of Appeals did not address whether an issue of fact was presented by the testimony of Ms. Harrison's expert witness, we will not review that issue here. Rather, the case will be remanded to the trial court for further consistent proceedings.
JOHNSTONE, SCOTT, and WINTERSHEIMER, JJ., concur.
ROACH, J., dissents by separate opinion in which COOPER and GRAVES, JJ., join.
ROACH, Justice, dissenting.
The majority opinion advances persuasive policy arguments for the adoption of *526 the continuous course of treatment doctrine. If I were serving as a legislator and these arguments were made on the floor of the General Assembly, I would probably support the adoption of the continuous course of treatment doctrine. However, we do not sit as legislators, and, therefore, I must dissent.
Our predecessor court made clear that "[t]he legislature's power to enact statutes of limitation governing the time in which a cause of action must be asserted by suit is, of course, unquestioned." Saylor v. Hall, 497 S.W.2d 218, 224 (Ky.1973) (emphasis added); see also Gilbert v. Barkes, 987 S.W.2d 772, 776 (Ky.1999) (citing to Saylor and stating that "[i]t is well established that the legislature has the power to limit the time in which a common law action can be brought"). In medical malpractice cases, the General Assembly has unequivocally answered this policy question. KRS 413.140(1)(e) states that a negligence action against a physician "shall be commenced within one (1) year after the cause of action accrued." KRS 413.140(2) then states that for actions subject to KRS 413.140(1)(e), "the cause of action shall be deemed to accrue at the time the injury is first discovered or in the exercise of reasonable care should have been discovered."
By requiring that actions be brought within one year of the time the "injury is first discovered or in the exercise of reasonable care should have been discovered," the General Assembly has adopted the discovery rule for tolling the medical malpractice statute of limitation. And, quite simply, the phrases "injury is first discovered" and "should have been discovered" means precisely what they say: that the statute of limitation begins to run when the injury is first discovered or should have been discovered. Discovery occurs when a patient knows that he or she has been wronged and by whom the wrong has been committed. Wiseman v. Alliant Hospitals, Inc., 37 S.W.3d 709, 712 (Ky. 2000).
The evidence clearly established that Ms. Harrison had discovered or at least should have discovered her injury by 1998. Her post-operative difficulties from her 1997 surgery were easily observable. As the Court of Appeals noted, the 1997 surgery resulted in "[d]isfiguring complications..., including nipple loss." As a result, she sought "second opinions" from a second doctor, then a third doctor, and then a fourth doctor. She was concerned enough that in 1998 she even consulted with an attorney (on whose advice she consulted the third doctor). There is simply no way that Ms. Harrison had no knowledge of her injury. Thus, her suit against Dr. Valentini in November 2000 was clearly time-barred under KRS 413.140.
The majority, however, has, through pure judicial fiat, supplanted the statutorily prescribed discovery rule with the continuous course of treatment rule. The majority opinion admits that "neither the discovery rule nor KRS 413.140 affords the physician and patient an opportunity to significantly cooperate with each other to improve the initial results or mitigate the damages caused by the poor treatment." Ante at 524.[1] This is, in effect, an admission that the continuous course of treatment rule is different than the discovery *527 rule that is clearly set forth in KRS 413.140. This is where the inquiry as to what rule to apply should end. However, the majority has succumbed to the siren's call to make "good" policy and, preferring a rule that facilitates physician-patient cooperation, chooses to ignore both the clear language of the statute and our settled precedent concerning statutes of limitation. The result of this reasoning is the blanket application of a new bright-line rule that has not been enacted by the General Assembly. I am awestruck by the Court's willingness to make such a raw policymaking pronouncement, especially in the face of decades of controlling precedent and, more importantly, statutory enactment.
In an attempt to find any legal authority in Kentucky for its enactment of this new policy, the majority relies upon Alagia, Day, Trautwein & Smith v. Broadbent, 882 S.W.2d 121 (Ky.1994). Although the Court discussed the legal malpractice analog of the continuous course of treatment rule, namely the continuous representation rule, in Alagia, Day, it did so only in dicta. Ultimately, the Court did not adopt the continuous representation rule, noting that the rule "is not controlling here" and that the case "must be decided on the occurrence rule." Id. at 125.[2]
The majority also claims support for adoption of the rule in the following language from Wiseman v. Alliant Hospitals, Inc., 37 S.W.3d 709 (Ky.2000):
One who possesses no medical knowledge should not be held responsible for discovering an injury based on the wrongful act of a physician. The nature of the tort and the character of the injury usually require reliance on what the patient is told by the physician or surgeon. The fiduciary relationship between the parties grants a patient the right to rely on the physician's knowledge and skill.
Id. at 712-13. What this language means, however, is that the continuous course of treatment doctrine (as opposed to "rule") might, at most, be a useful tool for tolling a statute of limitation based on the discovery rulein an appropriate case. This is why the dicta in Alagia, Day noted that "the continuous representation rule is a branch of the discovery rule," rather than a replacement. 882 S.W.2d at 125. As a court of law, however, we simply are not at liberty to adopt a wholly new rule to replace the one that the General Assembly has enacted. Furthermore, it is unnecessary in this case to consider the application of the continuous course of treatment doctrine as a tolling method given that Ms. Harrison's injury was so very obvious. Yet, this is exactly what the majority has done.
The General Assembly has determined that a medical negligence claim must be brought within one year after the "injury is first discovered" and since the judiciary has no power to re-write the statute to *528 conform to our own notions of right and wrong, I respectfully dissent.
COOPER and GRAVES, JJ., join this dissenting opinion.
NOTES
[1] See, e.g., Lane v. Lane, 295 Ark. 671, 752 S.W.2d 25 (Ark.1988); Borgia v. City of New York, 12 N.Y.2d 151, 237 N.Y.S.2d 319, 187 N.E.2d 777 (1962); Horton v. Carolina Medicorp, Inc., 344 N.C. 133, 472 S.E.2d 778 (1996); Ishler v. Miller, 56 Ohio St.2d 447, 384 N.E.2d 296 (Oh.1978); Hotelling v. Walther, 169 Or. 559, 130 P.2d 944 (1942); Farley v. Goode, 219 Va. 969, 252 S.E.2d 594 (1979); Metzger v. Kalke, 709 P.2d 414 (Wyo. 1985).
[2] KRS 413.140(1)(e).
[3] Wiseman v. Alliant Hospitals, Inc., 37 S.W.3d 709 (Ky.2000).
[4] Hackworth v. Hart, 474 S.W.2d 377 (Ky. 1971).
[5] Wiseman, 37 S.W.3d 709.
[6] Id.
[7] Id. at 712.
[8] Id. at 712.
[9] Id.
[10] Watkins v. Fromm, 108 A.D.2d 233, 488 N.Y.S.2d 768 (1985).
[11] See Ison, 249 S.W.2d 791.
[12] Langner v. Simpson, 533 N.W.2d 511 (Iowa 1995).
[13] 882 S.W.2d 121 (Ky.1994).
[14] Watkins v. Fromm, 108 A.D.2d 233, 488 N.Y.S.2d 768, 772 (1985).
[15] 37 S.W.3d 709, 712-13 (Ky.2000) (quoting Black v. Littlejohn, 312 N.C. 626, 325 S.E.2d 469 (1985)).
[16] Watkins, 108 A.D.2d 233, 488 N.Y.S.2d 768.
[1] The majority also describes the requirements of the discovery rule as "problematic." Ante at 524. While noting the various deficiencies in the discovery rule may very well be a good policy argument against the discovery rule, the simple fact is that the discovery rule is what the General Assembly has chosen to enact.
[2] The "occurrence" rule is unique to the legal malpractice statute of limitation and is not a part of the medical malpractice statute of limitation, which uses only the discovery rule. Compare KRS 413.245 (legal malpractice statute of limitation), with KRS 413.140(1)(e) & (2) (medical malpractice statute of limitation). The occurrence rule basically establishes a second limitation period, separate and in addition to that stemming from the discovery rule, for legal malpractice cases. See Alagia, Day, 882 S.W.2d at 125 "[T]here are actually two periods of limitation, the first being one year from the date of the occurrence and the second being one year from the date of discovery if it is later in time." (citing Michels v. Sklavos, 869 S.W.2d 728 (1994)).
| {
"pile_set_name": "FreeLaw"
} |
Effect of exercise level on the diagnostic accuracy of thallium-201 SPECT scintigraphy.
The sensitivity of electrocardiographic ST analysis for detecting coronary artery disease is markedly decreased in patients unable to exercise vigorously. To determine the diagnostic accuracy of Thallium-201 SPECT scintigraphy at various exercise levels, we evaluated 179 patients without evidence of prior myocardial infarction or other confounding factors who performed symptom-limited exercise with Thallium-201 SPECT scintigraphy. Sensitivity decreased from 89% in those patients achieving greater than or equal to 85% of maximal heart rate to 63% in those achieving less than 65%. Like ST segment analysis, Thallium 201 SPECT scintigraphy has decreased diagnostic yield at low levels of exertion. | {
"pile_set_name": "PubMed Abstracts"
} |
36 Meadowvale DriveGrovedale
Contact Agent
2
2
4
Property Features
Property ID: 3314727
Land Size
3386.00 m2
Well Designed and Space for the Whole Family
Situated in a lovely pocket of Grovedale this truly impressive home has so much to offer. A well-designed spacious property with 4 bedrooms, 2 bathrooms and 3 living areas on a substantial allotment of 3386sqm approx. (RGZ2). The large central kitchen and dining/sitting area is the perfect place for entertaining as it adjoins the sunroom and alfresco area and overlooks the expansive sunny garden. The master suite is on a grand scale with an ensuite and BIR and three other good-sized bedrooms all have BIR's and plenty of natural light with easy access to the central family bathroom. Gas central heating and evaporative cooling throughout, large laundry with plenty of storage, double carport and a double garage. The property has direct access behind to the Waurn Ponds Creek Trail, walking-distance to the Waurn Ponds Shopping Complex, Deakin University, Epworth Hospital and the Waurn Ponds Train Station as well as easy access to the ring road. | {
"pile_set_name": "Pile-CC"
} |
Serotypes of Yersinia pseudotuberculosis recovered from domestic livestock.
The serological identity of 234 strains of Yersinia pseudotuberculosis recovered from domestic animals and birds in New Zealand was determined by slide agglutination test. Thirty strains were also examined by tube agglutination test. The strains were isolated from cattle (56), sheep (8), deer (117), goats (13), pigs (7), rabbits (6), guinea pigs (5), and aviary species of birds (22). All strains were isolated from animals or birds which had died or shown signs of ill health and amongst which diarrhoea was a common feature. Serotype I accounted for 23% (53) of strains, serotype II for 13% (30) of strains and serotype III for 64% (151) of strains. It was concluded that further investigations on the prevalence and serological identity of strains recovered from clinically healthy animals mav provide useful information in assessing the significance of various serotypes as a cause of disease in livestock. | {
"pile_set_name": "PubMed Abstracts"
} |
Q:
Find the possible value of $x$ for $ \Bigg\vert \frac{3|x|-2}{|x|-1} \Bigg\vert \ge2 \ $
Find the possible value of $x$ for
$$ \left\vert \frac{3|x|-2}{|x|-1} \right\vert \ge 2.$$
A:
Set $y = |x|$ and cross-multiply to get
$$|3y-2| \ge 2|y-1|$$
This is equivalent to $$9y^2-12y+4 = |3y-2|^2 \ge 4|y-1|^2 = 4y^2-8y+4$$
or $y(5y-4) \ge 0$. Therefore $y \in \langle -\infty, 0] \cup \left[\frac45, +\infty\right\rangle$.
Hence $|x| \ge \frac45$ or $|x| = 0$ and by inspection in the original equation we also get $|x| \ne 1$.
We conclude $x \in \Big(\left\langle -\infty, -\frac45\right] \cup \{0\} \cup\left[ \frac45, -\infty\right\rangle \Big)\setminus \{-1,1\}$.
| {
"pile_set_name": "StackExchange"
} |
Troopers said a crash occurred following a chase in Anderson County Sunday night.
The incident was reported at 11:07 p.m. along Osteen Hill Road at Mustang Drive in Pelzer
The Anderson County Sheriff's Office said a deputy spotted a vehicle failing to stay in its lane and weaving. When the deputy activated lights and sirens in an attempt to pull the driver over, he said the driver fled at a high rate of speed.
The pursuit continued onto Osteen Hill Road where the driver lost control and flipped the vehicle multiple times before it landed on its roof.
According to the incident report, the deputy held the driver and a passenger at gunpoint until backup arrived on scene. Deputies identified the driver as 37-year-old Anthony Brian Cowart of Fountain Inn.
Cowart was transported to the hospital after complaining of severe lower back pain and later released. He was transported to the Anderson County Detention Center.
Investigators said a small bag was found in the coin pocket of Cowart's pants which field-tested positive for methamphetamine.
Cowart is charged with driving under suspension, second offense, failure to stop for blue lights and siren, and possession of methamphetamine. | {
"pile_set_name": "Pile-CC"
} |
Chronic myeloid leukemia in a patient with acquired immune deficiency syndrome: complete cytogenetic response with imatinib mesylate: report of a case and review of the literature.
We report a patient with acquired immune deficiency syndrome (AIDS) who developed Philadelphia-positive chronic myeloid leukemia (CML) and was successfully treated with imatinib mesylate. He achieved a complete cytogenetic response after 7 months of treatment. It appears that there is no in vivo interaction between imatinib and highly active anti-retroviral therapy (HAART) and these drugs can be concurrently administered with safety to patients with CML and AIDS. | {
"pile_set_name": "PubMed Abstracts"
} |
Q:
How can I get my first epic mount in WoW?
I'm close to level 85 and I want to know the easiest way to get my first epic mount that's different from the common mounts I can buy from vendors.
Which one should I go for? And how can I obtain it?
I'm a troll hunter.
A:
You can find detailed information on available mounts at WoWpedia. I'm not going to list all available mounts here, but you can find them all at that page. I'll try to summarize the general approaches you can take to getting a more exciting epic flying mount.
Basic wyverns are available from vendors when you hit level 70 and buy the Artisan (300) flying skill. Other mounts like the various drakes are typically available as faction mounts or rare drops.
Some are boss drops such as the Bronze Drake, others are reputation rewards such as the Netherwing Drake Mounts or the Red Drake. If you're a tailor, you can craft a flying carpet or its winterized version. Engineers and alchemists can also create flying mounts for themselves.
You can also buy this blue wind rider from Dalaran, but it's not terribly different from the common mounts except in colour.
Last but not least, there are mounts like the Violet Proto-drake that are awarded for getting certain achievements.
As you can see, the list of options is long and varied. Since you're nearing level 85, pretty much any of these should be available to you at least as far as plain level requirements go. Which mount you should go for first depends entirely on what you feel like getting and how much time/gold you're prepared to spend to do it.
A:
The easiest mount to get that is epic is the Bronze Drake. To ride this mount you will need to purchase Artisan Riding (300) from a flying trainer. You will find the bronze Drake in the Culling of Stratholme Dungeon on Heroic difficulty. On heroic you will be timed so taking a tank and a healer from your guild will make it easier on you. Once you are through the last corridor of the dungeon, the final boss is to the right, but to the left you will find the other boss who drops this Drake 100% of the time.
| {
"pile_set_name": "StackExchange"
} |
The invention relates to providing a rear looking image of the region behind a vehicle such as a car, truck, boat, train or plane.
When operating an automobile, it is awkward to attempt to use the images from both the side view and rearview mirrors to check the area to the rear of the operator. The operator may look behind the vehicle, but this too is awkward and may be dangerous since the operator is no longer watching the area in front of the car.
Thus, there is a need for a system that better enables an operator to be advised about hazards to the sides and rear of a vehicle. | {
"pile_set_name": "USPTO Backgrounds"
} |
Fusion pore in live cells.
Earlier electrophysiological measurements on live secretory cells suggested the presence of fusion pores at the plasma membrane, where secretory vesicles fuse to release vesicular contents. Recent studies using atomic force microscopy demonstrate for the first time the presence of the fusion pore and reveal its morphology and dynamics at near-nanometer resolution and in real time. | {
"pile_set_name": "PubMed Abstracts"
} |
Molecular dynamics simulations of oligopeptides in solution will be used to study the ways in which hydrogen bonds characteristic of protein secondary structure are made and broken. Structures considered will include 13-membered rings closed by a hydrogen bond (found in alpha-helices) and 10-membered rings (found in beta-turns and 3-10 helices). The simulations will consider both sequences known (by NMR analysis) to contain significant populations of secondary structure as well as sequences of more general interest (e.g. X-Pro-Gly-X for the case of tight turns.) Two general computational approaches will be used: in the first, "umbrella" sampling techniques will generate free energy profiles (potentials of mean force) for reaction coordinates corresponding to making or breaking particular hydrogen bonds. The second approach will use thermodynamic perturbation theory to estimate the free energy changes due to sequence changes for both folded and "random" conformers. The polypeptides studied will be from four to twelve amino acids in length. This work should have important application in understanding the earliest events in protein folding, when initial pieces of secondary structure are formed. In addition, a deeper understanding of the solution structure of polypeptides should aid in the design of novel peptide hormones and neurotransmitters. Antibodies to peptides appear to recognize nascent structures similar to those seen in a corresponding sequence in intact proteins; hence, an understanding of the forces and sequence specificity involved in forming internal hydrogen bonds in polypeptides may aid in understanding antibody-antigen recognition and in the design of synthetic vaccines. The study will be carried out in parallel with NMR analyses of polypeptides from the laboratory of Dr. Peter Wright. Sequences studied by both experimental and theoretical techniques will include those derived from influenza virus hemagglutinin, from a malaria parasite circumsporozite protein, and from myohemerythrin. | {
"pile_set_name": "NIH ExPorter"
} |
Train journeys in Japan
Like this post? Help us by sharing it! Our group tours manager, Elisa was recently lucky enough to spend time on the Cruise Train Seven Stars – a luxury sleeper train in Kyushu. Like this post? Help us by sharing it! | {
"pile_set_name": "Pile-CC"
} |
You\'ve survived but the best friend was turned into zombie. Now you can rely on yourself only. Drive your truck through the hordes of zombies, defeat bosses and save civilians on your way. Upgrade your truck and weapons and escape from these cursed lands. WASD or Arrow Keys - Drive. Mouse - Aim and Shoot.
Enjoy a very exciting gameplay and try to win the great desert battle in this awesome game! Enemies will surround you, but do not worry, you have some great weapons available. Change them and make them better by picking up power ups, which will also grant you extra speed, health and will protect you with a shield. Between levels you will also be able to buy some cool upgrades to improve your performance. Be fast, be brave and destroy the boss in the final level to win the game! Have fun! Use your arrow keys to drive, your Z key to shoot and your space bar to use nuke.
Your country is at war once again, so you must once again take up arms in this sequel to Army Sharpshooter. As the invading forces close in on your position, success or failure depends solely on you. Gun down the opposing army soldiers when they break cover, using a variety of guns. Good luck Sharpshooter!
As a kid you had a best friend, you played everyday in the sea, oh, yeah, it was a dolphin. But, those days were over when some bad guys kidnapped your best friend and took him away... Now, you are older and you are going after those guys in order to save your friend. Can you win the fight? upgrade your ships and win!
Blast those block zombies before they attack you! Its an all-out rampage against the zombies while you try to stay alive. Use the Arrow Keys to move and [SPACEBAR] to shoot. The number keys [1 -8] allow you to choose different weapons when they become available.
What are the best kind of bullets to kill zombies? The kind that hit them in the brain! Zombie Shooter 2 will have you popping z-heads with zee lead. Meet this puzzle-shooter at high noon in Undead Mans Gulch.
This is the next game after Vinnies Shooting Yard 3. As well as all other parts this one is a shooting game where you choose your weapons and need to hit appearing targets. This time your weapons are somewhat more varied, you have more settings and the targets are stickmen. The rest is the same. Aim and shoot with the mouse. Reload with Space.
Games Root - Game Root - GameRoot - Free Online Games on GamesRoot
Arcade Games Racing Games Classic Games Shooting Games Logic and Strategy Skill Games Sports Games Space Ships Games Fighting Games Puzzle & Board Games Card & Casino Games Adult Games | {
"pile_set_name": "Pile-CC"
} |
Some plasma membrane sensor proteins that detect nutrients look a lot like the transporters that move those small molecules across the membrane. On page 327, Wu et al. present a model suggesting that the sensors work like them, too---minus the transport step.
Previous work showed that a single mutation in the Ssy1p amino acid sensor increased its basal signaling level and made it hyperresponsive to extracellular ligand. Starting from those data, the team developed a model of how the sensor might control transcriptional activation of amino acid transporters.
According to the model, the sensor could sit in the membrane with its ligand-binding site facing the intracellular or extracellular space. In its unbound state, the sensor freely flips between inside- and outside-facing conformations. But ligand freezes the sensor in one conformation or the other so it cannot readily shift between the two sides of the membrane. Transporters, by contrast, do their job by flipping their ligand binding site from one side of the membrane to the other when ligand is bound.
When the sensor is facing the outside of the cell, it initiates signaling. If the model were correct, then increased levels of intracellular amino acids should inhibit signaling. When the team tested this by raising the levels of intracellular leucine, they found that Ssy1p signaling was inhibited.
By converting the extracellular and intracellular nutrient concentrations into a regulated signaling pathway, Ssy1p may better control nutrient homeostasis. Now the question is whether the model can be generalized to other sensors, such as those that detect glucose. 
[^1]: <[email protected]>
| {
"pile_set_name": "PubMed Central"
} |
require 'rx'
source = Rx::Observable.repeat(42, 3)
subscription = source.subscribe(
lambda {|x|
puts 'Next: ' + x.to_s
},
lambda {|err|
puts 'Error: ' + err.to_s
},
lambda {
puts 'Completed'
})
#=> Next: 42
# => Next: 42
# => Next: 42
# => Completed
| {
"pile_set_name": "Github"
} |
Cold Case: canceled or renewed? information
After seven years on the beat, the show’s over for Detective Lily Rush (Kathryn Morris). CBS has officially cancelled Cold Case.
Each episode of Cold Case begins by showing an unsolved crime from the past. The scene then flashes forward to the present day and a group of homicide detectives try to piece together what really happened, using old evidence and new interviews. The series stars Morris, Danny Pino, John Finn, Jeremy Ratchford, Thom Barry, and Tracie Thoms.
Cold Case began in September of 2003 and quickly became a staple of the CBS Sunday night schedule. The crime drama had a successful first season and, by season two, was averaging a 3.5 rating in the 18-49 demographic and 15.1 million viewers. For the next couple seasons, total viewership fell a bit but the all-important demo numbers rose, reaching a 3.8 in season four. | {
"pile_set_name": "Pile-CC"
} |
John Hardress-Lloyd
Brigadier-General John Hardress Lloyd (14 August 1874 – 28 February 1952) was an Anglo-Irish soldier and polo player. He was awarded a DSO and made a Chevalier of the Légion d’Honneur for his service in the British Army during the First World War. As a polo player he won a silver medal with the Ireland team at the 1908 Summer Olympics.
Biography
Hardress Lloyd was born into an Anglo-Irish family with connections to County Offaly. He was the son of John Lloyd, a lawyer, and Susanna Frances Julia Colclough. He was the second of their seven children and their oldest son. On 5 August 1903 he married Adeline Wilson. They did not have any children. Hardress-Lloyd is the great uncle of John Lloyd, the TV producer behind the Blackadder series.
Polo player
As a polo player, Hardress Lloyd, together with John Paul McCann, Percy O'Reilly and Auston Rotheram, was a member of the Ireland team that won a silver medal at the 1908 Summer Olympics. The Ireland team was part of the Great Britain Olympic team. In 1911 he also captained the England team that played in the United States
British Army soldier
Hardress Lloyd was commissioned a second lieutenant in the 4th Royal Irish Dragoon Guards on 10 October 1894. He was promoted to lieutenant on 1 July 1896, and served in the Tirah Campaign on the North West Frontier in 1897-98. Joining the 21st Lancers in South Africa for the Second Boer War, he served as aide-de-camp to Lieutenant-General Sir Edward Locke Elliot between 26 March 1901 and September 1902. He resigned his commission in the 21st Lancers on 8 October 1902.
On the outbreak of the First World War he served on the Western Front before joining Major-General Beauvoir De Lisle’s 1st Cavalry Division staff. He followed De Lisle to Gallipoli when the latter took command of the 29th Division. Hardress Lloyd was appointed second in command of the 1st Battalion Royal Inniskilling Fusiliers in May 1916, becoming its commanding officer a month later. Whilst commanding this battalion he was awarded the DSO in January 1917. In February 1917 he was appointed commander of D Battalion, one of the founding units of the Heavy Branch Machine Gun Corps.
The battalion's first actions were at the Battle of Arras (1917) and included the disastrous Bullecourt operation in April 1917. The 3rd Tank Brigade was formed under his command on 27 April 1917 and Hardress-Lloyd remained in charge of this brigade until the war ended. He was promoted to Brigadier-General on 16 April 1918 and a Bar was added to his DSO in July. He was also mentioned in despatches six times and appointed a Chevalier of the Légion d’Honneur.
References
Category:1874 births
Category:1952 deaths
Category:Members of the Ireland polo team at the 1908 Summer Olympics
Category:Anglo-Irish people
Category:English polo players
Category:British Army personnel of the Second Boer War
Category:Royal Inniskilling Fusiliers officers
Category:4th Royal Irish Dragoon Guards officers
Category:Chevaliers of the Légion d'honneur
Category:Companions of the Distinguished Service Order
Category:Irish officers in the British Army
Category:Roehampton Trophy
Category:International Polo Cup
Category:British military personnel of the Tirah Campaign
Category:British Army cavalry generals of World War I
Category:Medalists at the 1908 Summer Olympics
Category:Olympic silver medallists for Great Britain | {
"pile_set_name": "Wikipedia (en)"
} |
Q:
Reading the certifcate information of a web page
Suppose I visit a web page www.example.com and is successfully loaded into my browser.
When this page is loaded, we can see the certificate information www.example.com by clicking on padlock icon (on left side of address).
The certificate includes the information like owner/organisation, connection status, certificate verified by, cookies set by the page and so on.
Is there any way to get this information programmatically from the browser like by using javascript/Ajax or any other language.
A:
I found this link very helpful:
https://developer.mozilla.org/en-US/docs/Web/API/XMLHttpRequest/How_to_check_the_secruity_state_of_an_XMLHTTPRequest_over_SSL
| {
"pile_set_name": "StackExchange"
} |
The U.S. Small Business Administration’s top lenders have signed on with the SBA’s Veteran Pledge Initiative to pump up their loans to veterans by 5 percent a year for the next five years. The SBA has enlisted its top 20 national lenders and about 100 regional and community lenders to help veteran-owned small businesses. SBA […] [...]
Editor’s Note: This post has been updated to reflect new fundraising figures different from those referenced in the May 24, 2013 print edition. It will be wheels up for the last time this October when the Mississippi Gulf Coast Honor Flight (MGCHF) holds its final flight to honor the state’s surviving World War II veterans. […] [...] | {
"pile_set_name": "Pile-CC"
} |
Resonant exit time in stochastic and deterministic systems.
The motion of a particle in the field of a time-dependent potential is studied here both at absolute zero and in the presence of thermal agitation. The potential executes either random fluctuations or deterministic harmonic oscillations. Assuming absorbing boundaries it is always possible to find an exit time tau(ex)(kappa) which has a local minimum as a function of the potential flip rate kappa. Thus resonant activation, usually associated with diffussive systems, exists in purely deterministic systems as well. Thermal agitation merely extends the range of admissible initial conditions and renders all exit times finite. | {
"pile_set_name": "PubMed Abstracts"
} |
Choose Other Models to Add
they love it its the bestest car and great car even my parents love it it is such a solid and beautiful, amazing and everyone loves it all the thunderbird models are great except the one which is not a convertible its so fun to ride in it and to feel the wind in your face its the best
Avg. Dealer Rating: (17 reviews)
"Don't bother with Baldwin auto sales or the owners
son/salesman Don. I drove a total of 300 miles the day
before Thanksgiving in Los Angeles traffic to have the
owners son (Don) insult my 35 years of experience of
working & teaching in the automotive repair field. It took us 4
1/2 hours to get there. The Buick Enclave I test drove had a
pretty healthy oil leak, but according to the self proclaimed
car guru Don himself, he said, "if it doesn't leave drops on
the floor...it can't be that bad." I had told Don on several
phone calls what I do for a living, and how I'm a licensed
ASE Master Mechanic along w/many many years of
experience & a teaching credential. I told him the whole
right side & middle of the frame & under carriage was hosed
down with oil. So then he tells me, "well, it does have
118,000 miles on it". I told him I have a 2006 Chevy Tahoe
w/150,000 miles on it (which by the way I also found on
CarGurus as well) at home that's bone clean underneath &
it's never even had the valve cover gaskets replaced on it. I
know, because I got all the service records on it when I
purchased it from the GM dealer in Idaho. But, Don, instead
of being concerned or offering to fix the SUV before sluffing
it off on me....wanted to go inside & talk numbers. Forget
this so called "family business". Run as far as you can.
Plus, the bad Oman I saw was when a guy who had just
bought a car THE SAME DAY came back with a check
engine light on. Don had a scan tool plugged into it trying to
get the fault codes on it. What I didn't tell Don is that I've had
a 7000 sq ft repair facility in Chatsworth since 1995 & I had
cash with me to buy this thing. But, thanks to his rude
behavior & his cavalier attitude,....I packed the wife & kids
right back into my car & got the heck out of that place. Plus.
After I got home, I looked him up on Yelp. And sure
enough!!!....TERRIBLE REVIEWS!!! Big surprise huh? =))
People like this guy should not be in the business of selling
used cars because he gives our industry a bad name. I
would not do business with this car lot no matter how nice
the deal may seem. Stay away!!! Update: I did a little bit of
research on Buick Enclaves & the 3.6L V-6. Turns out they
have a big problem with the front timing cover gaskets
leaking as early as 30K miles. Plus they have camshaft end
play problems as well as timing chain stretch issues. I can
guarantee that the oil leak on this Buick Enclave is from the
front timing cover & requires having the engine removed
since it's a transverse setup and there is no room to pull the
timing cover off the front passenger side. A VERY expensive
fix if you include the timing chains replaced. "
Average time on market:
38 days
Certified Pre-Owned: No
Transmission: Automatic
Color: Merlot
Description:
Used 2004 Ford Thunderbird Base Convertible for sale
- $14,926, 60,544 miles with Leather Seats
Avg. Dealer Rating: (20 reviews)
"Lengthy and detailed discussion regarding working out a trade only to find out 3 hours later that another sales person had already sold the vehicle. Timing is everything!"
Avg. Dealer Rating: (9 reviews)
"Very nice, not pushy and informative. By the time I got out to the lot the car
was gone. :(
They still remain in contact but in a very tasteful way. Appreciate it. I believe
I would buy a vehicle from this dealer if the price is right. I haven't gone to
negotiating stage and that's where it can all fall apart. Overall pleasant." | {
"pile_set_name": "Pile-CC"
} |
Component mobility by a minute quantity of the appropriate solvent as a principal motif in the acceleration of solid-supported reactions.
The effects solvents have on fluoride-promoted heterogeneous hydrolysis and alcoholysis of various organo-phosphorus (OP) compounds on the surface of KF/Al2O3 are described. Solid-state magic angle spinning NMR analyses and SEM microscopy have shown that not only is the identity of the solvent important in these reactions but also its quantity. That is, minimal solvent amounts are favored and much more effective in such solid-supported reactions (and maybe generally) than those featuring solvent-free or excess solvent (>50 wt %) conditions. The addition of a minute quantity of the correct solvent (3-10 wt %, molar equivalent scale) avoids reagents leaching from the matrix, permits mobility (mass transport) of the reaction components and ensures their very high local concentration in close proximity to the solid-support large porous surface area. Accordingly, significant acceleration of reactions rates by orders of magnitude is obtained. Fascinatingly, even challenging phosphoesters with poor leaving groups, which were found to be very stable in the presence of solvent-free KF/Al2O3 or wetted with excess water, were efficiently hydrolyzed with a minute amount of this solvent. | {
"pile_set_name": "PubMed Abstracts"
} |
Lack you piece of garbage! Play Markstrom till the real number 1 goalie comes back. Make a damn save bail your D out for once. There goes all those Lack lover saying look at his numbers he must be better.
I didn't go, but here is a funny story about it
http://www.wrestlezo...-story-included
Wrestling fan and Reddit user "illmurray" attended WWE's live event at the Pacific Coliseum in Vancouver, BC last night, but he and a friend did not experience the show quite like thousands of other WWE fans in attendance did. According to his hilarious and detailed live report, featured below, the fans took "about two grams of mushrooms" before arriving at the Coliseum.
At around a quarter to seven PM, I took about two grams of psilocybe cubensis mushrooms with another redditor at an undisclosed location. We then took the #135 bus deep into east Vancouver to see WWE live at the Agrodome [aka Pacific Coliseum].
The effects hit me strong when we get off the bus at Hastings and Renfrew. The mild stomach discomfort becomes a peculiar warm and cuddly sensation all over my body. We are both giggling as we walk towards the searchlights in the distance.
When we get into the arena, the opening match is already in progress and literally everyone in the arena is chanting 'Axel sucks.' We can't figure out how to get to the floor and end up walking up and down the stairs several times before we find our seats. I see an elderly Indian woman in a John Cena t-shirt and my eyes start watering for some reason.
Xavier Woods enters the ring wearing a sparkly jacket. His entrance video looks like an animated gif image. He becomes my favourite wrestler. During the match, I experience severe time dilation as Hunico gives him a backdrop and then puts him in a chinlock again and again. I feel as though the match is stuck in an infinite loop and Hunico will continue to backdrop Xavier Woods forever. They do this spot for what feels like five or six times before Xavier finally backflips out of it and takes Hunico to the woodshed. Someone behind me yells that Xavier Woods looks like Richard Pryor and I spend a lot of time thinking about whether that was racist or not, considering he doesn't.
There is a divas match. I am looking at AJ standing on the apron and it strikes me how before these people were characters on a TV show, electron pulses on a screen, and now I can see the light reflecting off AJ's midriff and I can see the texture of her skin in infinitesimal detail down to the pores. Tamina doesn't tag her in. I count AJ's ribs.
I look over at my friend and he is slowly waving his hand in front of his face and at first I think he is doing the Cena thing but then I realize he is also really high.
During Daniel Bryan and Randy Orton's match, Daniel elbows Orton in the face so hard that, swear to god, a bloody tooth flies out of his mouth. I feel like these two could wrestle eachother again and again for the next thousand years and it would never not be amazing. Orton does so many little things in the ring that are so perfect that you really have to watch him closely to pick up on, and it kills me that I have to boo him on principle because he's so good but Daniel Bryan is from the Pacific Northwest and weird looking and therefore My Guy.
I yell 'dishonourable discharge' at Orton when he's near my corner but he doesn't hear me.
Any time anyone goes on the microphone, all I can hear is 'womp womp womp womp womp womp.' Tony Chimel goes on the microphone and says 'womp womp womp womp womp fifteen minute intermission.'
I go to buy a Fandango t-shirt but they don't have any.
It is when Los Matadores come out around nine o'clock that I realize I am peaking. El Torito comes out and I begin screaming. I have never been as excited by anything in my life. I cannot put into words the elation I am experiencing watching him run down the rampway. I feel as though millions of years of human evolution and history have led to me being here, watching a small man in a bull costume jump on the ropes and wave at people. I start tearing up again and try to start an El Torito chant, but then 3MB comes out and all the brown kids freak out over Jinder Mahal. He has never, ever been more over than he was tonight.
My friend is disappointed that there are no other mini wrestlers to fight El Torito, but I say it was enough just to be blessed by his presence.
Fandango comes out. He is wearing a purple satin shirt, which I begin wilding out over, but not as hard as I was wilding for El Torito. Great Khali comes out and again the crowd goes crazy, but I am staring at Fandango as he teases taking off the satin shirt. I am losing my mind. Finally he takes off the shirt and the light hits his abs. I swear to god Fandango's body is sparkling, glowing. His abs are crystalline. I almost start crying for a third time because his body is so f***ing beautiful. We make eye contact and I become bonded to him in eternity.
'His face is shaped like a Pringle,' my friend says of Great Khali.
Fandango gets on the microphone. 'Vancouver womp womp womp womp womp dance,' he says. Fandango is a really great wrestler because his selling can actually create the illusion of Khali moving around.
The main event is CM Punk vs. Luke Harper. CM Punk is my favourite wrestler and the entire arena is chanting his name but I am already exhausted because I have marked out so severely and completely over Fandango's shirt and El Torito.
CM Punk gets on the microphone. 'Womp womp Vancouver womp womp womp womp womp,' he says. Everyone goes home happy. I feel exhausted. I get on the bus and go straight back downtown to eat a triple cheeseburger at A&W.
It was delicious. | {
"pile_set_name": "Pile-CC"
} |
Q:
How to enable hibernation in 15.04?
I did a clean install of 15.04, tried to enable hibernation per instruction from http://ubuntuhandbook.org/index.php/2014/10/enable-hibernate-option-in-ubuntu-14-10-unity/
but it works only if I boot with upstart and not with systemd.
How can I get it to work with systemd?
EDIT>After installing hibernate package I can run it from the terminal, but still it is not available in the shutdown menu.
A:
Create the following file: /etc/polkit-1/localauthority/10-vendor.d/com.ubuntu.desktop.pkla
Copy / paste the following content into it:
[Enable hibernate by default in upower]
Identity=unix-user:*
Action=org.freedesktop.upower.hibernate
ResultActive=yes
[Enable hibernate by default in logind]
Identity=unix-user:*
Action=org.freedesktop.login1.hibernate;org.freedesktop.login1.handle-hibernate-key;org.freedesktop.login1;org.freedesktop.login1.hibernate-multiple-sessions;org.freedesktop.login1.hibernate-ignore-inhibit
ResultActive=yes
Log out and check that you can see the hibernate menu item on the login screen, do the same once you logged in.
The reason the above manual step needs to be done is that they seem to have disabled hibernate by default in Ubuntu 15.04.
| {
"pile_set_name": "StackExchange"
} |
Aroã language
Aruán (Aroã) is an extinct Arawakan language of Brazil. Aikhenvald (1999) classifies it as a close relative of Palikur.
References
Category:Arawakan languages
Category:Languages of Brazil | {
"pile_set_name": "Wikipedia (en)"
} |
package org.opencb.opencga.storage.core.metadata;
import org.opencb.biodata.models.variant.metadata.VariantMetadata;
import org.opencb.biodata.models.variant.metadata.VariantStudyMetadata;
import org.opencb.commons.datastore.core.Query;
import org.opencb.commons.datastore.core.QueryOptions;
import org.opencb.opencga.storage.core.exceptions.StorageEngineException;
import org.opencb.opencga.storage.core.metadata.adaptors.FileMetadataDBAdaptor;
import org.opencb.opencga.storage.core.metadata.models.StudyMetadata;
import org.opencb.opencga.storage.core.variant.query.projection.VariantQueryProjection;
import org.opencb.opencga.storage.core.variant.query.projection.VariantQueryProjectionParser;
import java.util.List;
import java.util.Map;
import java.util.stream.Collectors;
/**
* Creates a VariantMetadata from other metadata information stored in the database.
*
* Created on 17/08/17.
*
* @author Jacobo Coll <[email protected]>
*/
public class VariantMetadataFactory {
protected final VariantStorageMetadataManager scm;
public VariantMetadataFactory(VariantStorageMetadataManager variantStorageMetadataManager) {
scm = variantStorageMetadataManager;
}
public VariantMetadata makeVariantMetadata() throws StorageEngineException {
return makeVariantMetadata(new Query(), new QueryOptions());
}
public VariantMetadata makeVariantMetadata(Query query, QueryOptions queryOptions) throws StorageEngineException {
VariantQueryProjection queryFields = VariantQueryProjectionParser.parseVariantQueryFields(query, queryOptions, scm);
return makeVariantMetadata(queryFields, queryOptions);
}
protected VariantMetadata makeVariantMetadata(VariantQueryProjection queryFields, QueryOptions queryOptions)
throws StorageEngineException {
VariantMetadata metadata = new VariantMetadataConverter(scm)
.toVariantMetadata(queryFields);
Map<String, StudyMetadata> studyConfigurationMap = queryFields.getStudies().values().stream()
.collect(Collectors.toMap(VariantQueryProjection.StudyVariantQueryProjection::getName,
VariantQueryProjection.StudyVariantQueryProjection::getStudyMetadata));
for (VariantStudyMetadata variantStudyMetadata : metadata.getStudies()) {
StudyMetadata studyMetadata = studyConfigurationMap.get(variantStudyMetadata.getId());
List<Integer> fileIds = queryFields.getStudy(studyMetadata.getId()).getFiles();
if (fileIds != null && !fileIds.isEmpty()) {
Query query = new Query()
.append(FileMetadataDBAdaptor.VariantFileMetadataQueryParam.STUDY_ID.key(), studyMetadata.getId())
.append(FileMetadataDBAdaptor.VariantFileMetadataQueryParam.FILE_ID.key(), fileIds);
scm.variantFileMetadataIterator(query, new QueryOptions()).forEachRemaining(fileMetadata -> {
variantStudyMetadata.getFiles().removeIf(file -> file.getId().equals(fileMetadata.getId()));
variantStudyMetadata.getFiles().add(fileMetadata.getImpl());
});
}
}
return metadata;
}
}
| {
"pile_set_name": "Github"
} |
// Pingus - A free Lemmings clone
// Copyright (C) 2000 Ingo Ruhnke <[email protected]>
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
#ifndef HEADER_PINGUS_PINGUS_ACTIONS_FALLER_HPP
#define HEADER_PINGUS_PINGUS_ACTIONS_FALLER_HPP
#include "pingus/pingu_action.hpp"
#include "pingus/state_sprite.hpp"
namespace Actions {
class Faller : public PinguAction
{
private:
StateSprite faller;
StateSprite tumbler;
public:
Faller(Pingu*);
virtual ~Faller();
void draw (SceneContext& gc);
void update();
bool change_allowed (ActionName::Enum new_action);
ActionName::Enum get_type() const { return ActionName::FALLER; }
bool is_tumbling () const;
private:
Faller (const Faller&);
Faller& operator= (const Faller&);
};
} // namespace Actions
#endif
/* EOF */
| {
"pile_set_name": "Github"
} |
T.C. Memo. 2001-137
UNITED STATES TAX COURT
DAVID FURNISS, Petitioner v.
COMMISSIONER OF INTERNAL REVENUE, Respondent
Docket No. 13860-99. Filed June 11, 2001.
David Furniss, pro se.
William F. Castor, for respondent.
MEMORANDUM OPINION
MARVEL, Judge: In separate notices of deficiency,
respondent determined the following income tax deficiencies and
penalties with respect to petitioner’s Federal income taxes:1
1
All section references are to the Internal Revenue Code in
effect for the years in issue, and all Rule references are to the
Tax Court Rules of Practice and Procedure. Monetary amounts are
rounded to the nearest dollar.
- 2 -
Addition to tax Addition to tax
Taxable Year Deficiency Sec. 6651(a)(1) Sec. 6654
1990 $5,917 $1,479 $387
1994 4,425 939 191
1996 4,093 1,023 218
After concessions,2 the only remaining issues for decision
are:3 (1) Whether petitioner received unreported income during
1990, 1994, and 1996 of $25,838, $30,243, and $29,812,
respectively; (2) whether petitioner is liable for additions to
tax for failure to file Federal income tax returns for 1990,
1994, and 1996; and (3) whether petitioner is liable for
additions to tax for failure to make sufficient estimated tax
payments in 1990, 1994, and 1996.
Some of the facts have been stipulated, and the stipulations
are incorporated herein by this reference. Petitioner resided in
Lawton, Oklahoma, at the time the petition was filed.
During 1990, petitioner received commissions of $17,516, a
pension of $3,433, unemployment compensation of $4,065, dividends
of $20, and wages of $804. During 1994, petitioner received
unemployment compensation of $2,450, dividends of $46, and wages
of $27,747. During 1996, petitioner received a pension of
2
Petitioner did not dispute, nor did he present evidence
regarding, respondent’s determination that petitioner had self-
employment income in 1990 of $17,516 and was liable for self-
employment tax on that income. This adjustment is deemed
conceded in accordance with Rule 34(b)(4).
3
The only other issues raised in the notices of deficiency
are computational.
- 3 -
$5,920, unemployment compensation of $3,705, interest of $20,
dividends of $36, and wages of $20,131. Petitioner did not file
income tax returns for 1990, 1994, or 1996.
I. Unreported Income
Respondent determined that all of petitioner’s receipts
during the years in issue were income to petitioner. Petitioner
does not dispute that he received the income; rather, he contends
there is insufficient authority to hold him liable for an income
tax.
The crux of petitioner’s argument is found in his trial
memorandum and supplement to trial memorandum.4 These trial
memoranda are merely lists of disjointed brief quotations and
erroneous statements of law. Giving petitioner the benefit of
the doubt, we construe petitioner’s argument to be that the
income tax is unconstitutional and, alternatively, that the
definition of income excludes his receipts. We reject
4
The Court directed the parties to file simultaneous briefs,
together with simultaneous reply briefs. Petitioner did not file
a brief. We could declare petitioner in default and dismiss his
case. See Rule 123; Stringer v. Commissioner, 84 T.C. 693
(1985), affd. without published opinion 789 F.2d 917 (4th Cir.
1986); Pace v. Commissioner, T.C. Memo. 2000-300. We also could
conclude that petitioner abandoned his claims after trial and
decide this case against petitioner because he failed to meet his
burden of proof. See Calcutt v. Commissioner, 84 T.C. 716, 721-
722 (1985); Hartman v. Commissioner, T.C. Memo. 1999-176. We
choose, instead, to decide the case on the merits in the hope
that this opinion will guide petitioner’s future decisions
regarding his tax obligations. See Calcutt v. Commissioner,
supra at 721-722; Pace v. Commissioner, supra; Bissell v.
Commissioner, T.C. Memo. 1991-163.
- 4 -
petitioner’s argument for well-established reasons. First, the
income tax repeatedly has been held constitutional. See Charczuk
v. Commissioner, 771 F.2d 471, 472-473 (10th Cir. 1985), affg.
T.C. Memo. 1983-433; Abrams v. Commissioner, 82 T.C. 403, 406-407
(1984); Bivolcic v. Commissioner, T.C. Memo. 2000-62; see also
Stelly v. Commissioner, 761 F.2d 1113, 1115 (5th Cir. 1985)
(listing cases in each circuit holding the income tax
constitutional). Second, section 61(a) defines gross income
generally as “all income from whatever source derived,”
including, but not limited to, compensation for services,
commissions, interest, dividends, and pensions. See sec.
61(a)(1), (4), (7), (11). Section 85(a) provides: “In the case
of an individual, gross income includes unemployment
compensation.” Under section 61(a)(1), (4), (7), and (11), and
section 85(a), petitioner clearly is required to include in gross
income all his receipts in the years in issue.
Petitioner contends that income is defined only by section
911 and the regulations under section 861 and that his receipts
are excluded from those definitions. Neither section 911 nor
section 861 operates to prevent section 61 from applying to
petitioner’s receipts. See Solomon v. Commissioner, T.C. Memo.
1993-509, affd. without published opinion 42 F.3d 1391 (7th Cir.
1994).
- 5 -
Petitioner’s reliance on section 911 is misplaced. Section
911(a) allows an exclusion from gross income for foreign earned
income at the election of a qualified individual, defined as an
individual whose tax home is in a foreign country. See sec.
911(d)(1). Petitioner had no foreign earned income and is not a
qualified individual for purposes of section 911(a). Section
911(a) has no bearing on the taxation of petitioner’s receipts.
Petitioner’s reliance on section 861 likewise is misplaced.
Petitioner reads section 861 to provide that items not defined
therein are not subject to tax. Section 861(a)(1) and (3)
provides that interest from the United States and compensation
for labor or personal services performed in the United States
(with exceptions not applicable here) are items of gross income
which shall be treated as income from sources within the United
States. Nothing in section 861 operates to exclude from income
any of petitioner’s receipts.
We hold that petitioner received unreported income of
$25,838, $30,243, and $29,812 during 1990, 1994, and 1996,
respectively.
II. Schedules A and C Deductions
Petitioner asserted that he was entitled to Schedule A,
Itemized Deductions, and Schedule C, Profit or Loss From
- 6 -
Business, deductions for the years in issue.5 Petitioner has the
burden of proof on this issue. See Rule 142(a). We allowed
petitioner ample time to present evidence establishing these
deductions. Petitioner failed to introduce any such evidence or
even indicate the specific deductions to which he believed he was
entitled. We hold that petitioner failed to carry his burden of
proof. See INDOPCO, Inc. v. Commissioner, 503 U.S. 79, 84
(1992); New Colonial Ice Co. v. Helvering, 292 U.S. 435, 440
(1934); Wichita Terminal Elevator Co. v. Commissioner, 6 T.C.
1158, 1165 (1946), affd. 162 F.2d 513 (10th Cir. 1947).
Petitioner is not entitled to any Schedules A or C deductions for
the years in issue.
III. Section 6651(a)(1) Addition to Tax
Section 6651(a)(1) authorizes the imposition of an addition
to tax for failure to file a timely return, unless it is shown
that such failure is due to reasonable cause and not due to
willful neglect. See sec. 6651(a)(1); United States v. Boyle,
469 U.S. 241, 245 (1985); United States v. Nordbrock, 38 F.3d
440, 444 (9th Cir. 1994); Harris v. Commissioner, T.C. Memo.
1998-332.
5
Petitioner also asserted he was entitled to Schedule B,
Interest and Ordinary Dividends, deductions for the years at
issue. Schedule B is a form used to report the taxpayer’s
receipt of interest and ordinary dividends. There are no
Schedule B deductions; therefore, petitioner is not entitled to
any such deduction.
- 7 -
Petitioner did not file Federal income tax returns or
applications for extensions of time to file for 1990, 1994, or
1996. Petitioner stated in his petition that he was not liable
for penalties as determined by respondent. The record is devoid
of any evidence establishing a reasonable cause for his failure
to file a return; thus, we hold petitioner is liable for the
section 6651(a)(1) addition to tax.
IV. Section 6654(a) Addition to Tax
Section 6654(a) imposes an addition to tax in the case of
any underpayment of estimated tax by an individual. Unless a
statutory exception applies, the addition to tax under section
6654(a) is mandatory. See sec. 6654(a), (e); Recklitis v.
Commissioner, 91 T.C. 874, 913 (1988); Grosshandler v.
Commissioner, 75 T.C. 1, 20-21 (1980); Estate of Ruben v.
Commissioner, 33 T.C. 1071, 1072 (1960) (“This section has no
provision relating to reasonable cause and lack of willful
neglect. It is mandatory and extenuating circumstances are
irrelevant.”). None of the statutory exceptions under section
6654(e) applies in this case. Petitioner stated in his petition
that he was not liable for penalties as determined by respondent,
but presented no further argument regarding payments of estimated
tax. We thus hold petitioner liable for the section 6654(a)
addition to tax.
- 8 -
V. Conclusion
We have carefully considered all remaining arguments made by
petitioner for contrary holdings and, to the extent not
discussed, find them to be irrelevant or without merit.
To reflect the foregoing,
Decision will be entered
for respondent.
| {
"pile_set_name": "FreeLaw"
} |
Q:
More on "Cylinder shading with pgf TiKZ"
In his answer to Cylinder shading with PGF/TikZ, Jake provides a code to draw a shaded cylinder with a not shaded top.
This code draws a cylinder node (from shapes.geometric library) and after that, with a second draw command, an ellipse is drawn over it.
I've tried to join both steps within a mycylinder/.style with an append after command option without any success. I still don't completely understand what \pgfinterruptpath, \pgfextra do, so may be my code is not correct. I imagine that covering ellipse must be drawn after shading the cylinder but I don't know how to do it. Could you explain what's wrong?
\documentclass[tikz,border=1mm]{standalone}
\usetikzlibrary{calc,fit,backgrounds,positioning,arrows,shapes.geometric}
\begin{document}
\begin{tikzpicture}[font=\sffamily\small,
>=stealth',
mycylinder/.style={
draw,
shape=cylinder,
alias=cyl, % Will be used by the ellipse to reference the cylinder
aspect=1.5,
minimum height=3cm,
minimum width=2cm,
left color=blue!30,
right color=blue!60,
middle color=blue!10, % Has to be called after left color and middle color
outer sep=-0.5\pgflinewidth, % to make sure the ellipse does not draw over the lines
shape border rotate=90,
append after command={%
\pgfextra{%
\pgfinterruptpath
% \begin{pgfonlayer}{foreground layer}
\fill [blue!10] let
\p1 = ($(\tikzlastnode.before top)!0.5! (\tikzlastnode.after top)$),
\p2 = (\tikzlastnode.top),
\p3 = (\tikzlastnode.before top),
\n1={veclen(\x3-\x1,\y3-\y1)},
\n2={veclen(\x2-\x1,\y2-\y1)},
\n3={atan2((\y2-\y1),(\x2-\x1))}
in
(\p1) ellipse [x radius=\n1, y radius = \n2, rotate=\n3];
% \end{pgfonlayer}
\endpgfinterruptpath%
}
}
}
]
% Left cylinder. Wrong one.
% I would like to draw right cylinder with only one command.
\path node [mycylinder, label=below:Wrong] (disc) {};
% Right cylinder. Correct one but with two commands.
\path node [mycylinder, right=1cm of disc, label=below:Good] (disc2) {};
\fill [blue!10] let
\p1 = ($(cyl.before top)!0.5!(cyl.after top)$),
\p2 = (cyl.top),
\p3 = (cyl.before top),
\n1={veclen(\x3-\x1,\y3-\y1)},
\n2={veclen(\x2-\x1,\y2-\y1)},
\n3={atan2((\y2-\y1),(\x2-\x1))}
in
(\p1) ellipse [x radius=\n1, y radius = \n2, rotate=\n3];
\end{tikzpicture}
\end{document}
A:
TikZ already includes the possibility to insert a separate path in the current one: the edge.
(Unfortunately, you cannot use pgfonlayer here. But as the argument append after command will be executed after the node has been placed, this shouldn’t be an issue here.)
Since the CVS version swapped the arguments to the atan2 function (atan2(x, y) to atan2(y, x)), I also included a small block in the preamble to sort this out and define the functions atanXY and atanYX.
I also chose to not change the outer seps but instead to subtract \pgflinewidth directly from the radius. It is an annoyance that these values cannot be accessed after the node.
Code
\documentclass[tikz]{standalone}
\usetikzlibrary{calc,shapes.geometric}
\pgfmathparse{atan2(0,1)}
\ifdim\pgfmathresult pt=0pt % atan2(y, x)
\tikzset{declare function={atanXY(\x,\y)=atan2(\y,\x);atanYX(\y,\x)=atan2(\y,\x);}}
\else % atan2(x, y)
\tikzset{declare function={atanXY(\x,\y)=atan2(\x,\y);atanYX(\y,\x)=atan2(\x,\y);}}
\fi
\begin{document}
\begin{tikzpicture}[font=\sffamily\small,
mycylinder/.style={draw, shape=cylinder, aspect=1.5, minimum height=+3cm,
minimum width=+2cm, left color=blue!30, right color=blue!60, middle color=blue!10,
shape border rotate=90, append after command={%
let \p{cyl@center} = ($(\tikzlastnode.before top)!0.5! (\tikzlastnode.after top)$),
\p{cyl@x} = ($(\tikzlastnode.before top)-(\p{cyl@center})$),
\p{cyl@y} = ($(\tikzlastnode.top) -(\p{cyl@center})$)
in (\p{cyl@center}) edge[draw=none, fill=blue!10, to path={
ellipse [x radius=veclen(\p{cyl@x})-1\pgflinewidth,
y radius=veclen(\p{cyl@y})-1\pgflinewidth,
rotate=atanXY(\p{cyl@x})]}] () }}]
\node[mycylinder, label=below:Better?] {};
\end{tikzpicture}
\end{document}
Output
Another idea.
The cylinder shape already has the option to fill the two parts differently with the options
cylinder body fill=<color>,
cylinder end fill=<color> and the switch
cylinder uses custom fill.
Unfortunately, the shading in
cylinder end fill=blue!10, cylinder uses custom fill,
preaction={draw=red, left color=blue!30, right color=blue!60, middle color=blue!10}
will be drawn on top of the cylinder end fill (which is done in a behindbackgroundpath) even though the shading itself is in a preaction.
It may be possible to solve this with a custom shape.
The keys Cylinder end shade and Cylinder body shade actually are implemented by setting their content with \tikzset and using \tikz@finish (similar how the backgroundpath and the foregroundpath are applied).
Code
\documentclass[tikz]{standalone}
\usetikzlibrary{shapes.geometric}
\pgfset{
Cylinder end fill/.initial=,
Cylinder body fill/.initial=,
Cylinder end shade/.initial=,
Cylinder body shade/.initial=}
\makeatletter
\pgfdeclareshape{Cylinder}{%
\inheritsavedanchors[from=cylinder]%
\inheritbackgroundpath[from=cylinder]%
\inheritanchorborder[from=cylinder]%
\inheritanchor[from=cylinder]{center}\inheritanchor[from=cylinder]{shape center}%
\inheritanchor[from=cylinder]{mid}\inheritanchor[from=cylinder]{mid east}%
\inheritanchor[from=cylinder]{mid west}\inheritanchor[from=cylinder]{base}%
\inheritanchor[from=cylinder]{base east}\inheritanchor[from=cylinder]{base west}%
\inheritanchor[from=cylinder]{north}\inheritanchor[from=cylinder]{south}%
\inheritanchor[from=cylinder]{east}\inheritanchor[from=cylinder]{west}%
\inheritanchor[from=cylinder]{north east}\inheritanchor[from=cylinder]{south west}%
\inheritanchor[from=cylinder]{south east}\inheritanchor[from=cylinder]{north west}%
\inheritanchor[from=cylinder]{before top}\inheritanchor[from=cylinder]{top}%
\inheritanchor[from=cylinder]{after top}\inheritanchor[from=cylinder]{before bottom}%
\inheritanchor[from=cylinder]{bottom}\inheritanchor[from=cylinder]{after bottom}%
\behindbackgroundpath{%
\ifpgfcylinderusescustomfill%
\getcylinderpoints%
\pgf@x\xradius\relax%
\advance\pgf@x-\outersep\relax%
\edef\xradius{\the\pgf@x}%
\pgf@y\yradius\relax%
\advance\pgf@y-\outersep\relax%
\edef\yradius{\the\pgf@y}%
{%
\pgftransformshift{\centerpoint}%
\pgftransformrotate{\rotate}%
\pgfpathmoveto{\afterbottom}%
\pgfpatharc{90}{270}{\xradius and \yradius}%
\pgfpathlineto{\beforetop\pgf@y-\pgf@y}%
\pgfpatharc{270}{90}{\xradius and \yradius}%
\pgfpathclose%
\edef\pgf@temp{\pgfkeysvalueof{/pgf/Cylinder body fill}}%
\ifx\pgf@temp\pgfutil@empty
\edef\pgf@temp{\pgfkeysvalueof{/pgf/Cylinder body shade}}%
\ifx\pgf@temp\pgfutil@empty
\pgfusepath{discard}%
\else % make shading:
\begingroup
\expandafter\tikzset\expandafter{\pgf@temp}
\tikz@finish
\fi
\else
\pgfsetfillcolor{\pgf@temp}%
\pgfusepath{fill}%
\fi
%
\pgfpathmoveto{\beforetop}%
\pgfpatharc{90}{-270}{\xradius and \yradius}%
\pgfpathclose
\edef\pgf@temp{\pgfkeysvalueof{/pgf/Cylinder end fill}}%
\ifx\pgf@temp\pgfutil@empty
\edef\pgf@temp{\pgfkeysvalueof{/pgf/Cylinder end shade}}%
\ifx\pgf@temp\pgfutil@empty
\pgfusepath{discard}%
\else % make shading:
\begingroup
\expandafter\tikzset\expandafter{\pgf@temp}
\tikz@finish
\fi
\else
\pgfsetfillcolor{\pgf@temp}%
\pgfusepath{fill}%
\fi
}%
\fi
}%
}
\makeatother
\begin{document}
\begin{tikzpicture}[font=\sffamily\small, opacity=1,
mycylinder/.style={shape=Cylinder, aspect=1.5, minimum height=+3cm, draw,
cylinder uses custom fill, Cylinder end fill=blue!10,
Cylinder body shade={left color=blue!30, right color=blue!60, middle color=blue!10},
minimum width=+2cm, shape border rotate=90,
}]
\node[mycylinder, label=below:Betterer?] {};
\end{tikzpicture}
\end{document}
Output
| {
"pile_set_name": "StackExchange"
} |
Polybrominated diphenyl ethers: neurobehavioral effects following developmental exposure.
Polybrominated diphenyl ethers (PBDEs), a class of widely used flame retardants, are becoming widespread environmental pollutants, as indicated by studies on sentinel animal species, as well as humans. Of particular concern are the reported increasingly high levels of PBDEs in human milk, as should be given that almost no information is available on their potential effects on developing organisms. In order to address this issue, studies have been conducted in mice and rats to assess the potential neurotoxic effects of perinatal exposure to PBDEs (congeners 47, 99, 153 and the penta-BDE mixture DE-71). Characteristic endpoints of PBDE neurotoxicity are, among others, endocrine disruption (e.g. decreased thyroid hormone levels), alteration in cholinergic system activity (behavioral hyporesponsivity to nicotine challenge), as well as alterations of several behavioral parameters. In particular, the main hallmark of PBDE neurotoxicity is a marked hyperactivity at adulthood. Furthermore, a deficit in learning and memory processes has been found at adulthood in neonatally exposed animals. Some of neurotoxic effects of PBDEs are comparable to those of polychlorinated biphenyls (PCBs), though the latter class of compounds seems to exert a stronger toxic effect. Available information on PBDE neurotoxicity obtained from animal studies and the possibility of neonatal exposure to PBDEs via the mother's milk suggest that these compounds may represent a potential risk for neurobehavioral development in humans. | {
"pile_set_name": "PubMed Abstracts"
} |
Fell admits tough Games task
02 May 2012 / 14:24
Olympic silver medallist Heather Fell rates herself as an outsider to make the Great Britain modern pentathlon team for the London Games.
The 29-year-old maintained Britain's record of having won at least one medal at every Olympics since the women's competition was introduced in 2000 when she finished as runner-up to Germany's Lena Schoneborn in Beijing four years ago.
But the competition for the two places available in London is among the toughest in any sport, with six women beginning the year with realistic expectations of qualification.
That has been reduced to four with the confirmation on Tuesday that Fell, Mhairi Spence, Samantha Murray and Freyja Prentice will make up the team for next week's World Championships in Rome, ending the Olympic hopes of Katy Livingston, who was seventh in Beijing, and Katy Burke.
Fell sits ninth in the world rankings, second only to fifth-placed Spence in British terms, but Spence and Murray have both won World Cup medals this season while Prentice is the only British woman to have already met the Olympic selection criteria courtesy of her top-eight finish at the European Championships last year.
Fell told Press Association Sport: "I would put myself as the fourth member of the World Championship team.
"From the way the year has gone I feel like I've crept in there but you've got to be in it to win it and I'm there. I think we're all starting again with a fresh slate so hopefully I can move myself up in the rankings."
Fell can draw on memories of the same process ahead of the Beijing Games, when she also had to contend with the loss of her funding following injury problems.
She said: "I remember back in 2007 when I qualified I never once thought for one minute that I'd be going because there were so many hurdles in front of me. Now we're only a few months away and it still feels the same as it did then.
"I can't envisage that far ahead but I'm one step closer by having the chance to compete at the World Championships and I know I've got the World Cup Final as well so I've just got to focus on those two competitions and hope I can do enough." | {
"pile_set_name": "Pile-CC"
} |
[Intestinal diversions in the treatment of Hirschsprung's disease].
Forty six enterostomies performed among one hundred and thirty one patients with Hirschsprung's diseases are reviewed. The advantages and disadvantages of the different types of intestinal diversions are considered. We conclude that the best option is to make a terminal enterostomy just proximal to the aganglionic gut. | {
"pile_set_name": "PubMed Abstracts"
} |
Q:
SQL to answer: which customers were active in a given month, based on activate/deactivate records
Given a table
custid | date | action
1 | 2011-04-01 | activate
1 | 2011-04-10 | deactivate
1 | 2011-05-02 | activate
2 | 2011-04-01 | activate
3 | 2011-03-01 | activate
3 | 2011-04-01 | deactivate
The database is PostgreSQL.
I want an SQL query to show customers that were active at any stage during May.
So, in the above, that would be 1 and 2.
I just can't get my head around the way to approach this. Any pointers?
update
Customer 2 was active during May, as he was activated Before May, and not Deactivated since he was Activated. As in, I'm alive this Month, but wasn't born this month, and I've not died.
select distinct custid
from MyTable
where action = 'active' and date >= '20110501' and date < '20110601'
This approach won't work, as it only shows activations during may, not 'actives'.
A:
Note: This would be a starting point and only works for 2011.
Ignoring any lingering bugs, this code (for each customer) looks at 1) The customer's latest status update before may and 2) Did the customer become active during may?
SELECT
Distinct CustId
FROM
MyTable -- Start with the Main table
-- So, was this customer active at the start of may?
LEFT JOIN -- Find this customer's latest entry before May of This Year
(select
max(Date)
from
MyTable
where
Date < '2011-05-01') as CustMaxDate_PreMay on CustMaxDate_PreMay.CustID = MyTable.CustID
-- Return a record "1" here if the Customer was Active on this Date
LEFT JOIN
(select
1 as Bool,
date
from
MyTable
) as CustPreMay_Activated on CustPreMay_Activated.Date = CustMaxDate_PreMay.Date and CustPreMay_Activated.CustID = MyTable.CustID and CustPreMay_Activated = 'activated'
-- Fallback plan: If the user wasn't already active at the start of may, did they turn active during may? If so, return a record here "1"
LEFT JOIN
(select
1 as Bool
from
MyTable
where
Date <= '2011-05-01' and Date < '2011-06-01' and action = 'activated') as TurnedActiveInMay on TurnedActiveInMay .CustID = MyTable.CustID
-- The Magic: If CustPreMay_Activated is Null, then they were not active before May
-- If TurnedActiveInMay is also Null, they did not turn active in May either
WHERE
ISNULL(CustPreMay_Activated.Bool, ISNULL(TurnedActiveInMay.Bool, 0)) = 1
Note:
You might need replace the `FROM MyTable' with
From (Select distinct CustID from MyTable) as Customers
It is unclear to me just looking at this code whether or not it will A) be too slow or B) somehow cause dupes or problems due starting the FROM clause @ MYTable which may contain many records per customer. The DISTINCT clause probably takes care of this, but figured I'd mention this workaround.
Finally, I'll leave it to you to make this work across different years.
A:
Try this
select t2.custid from
(
-- select the most recent entry for each customer
select custid, date, action
from cust_table t1
where date = (select max(date)
from cust_table where custid = t1.custid)
) as t2
where t2.date < '2011-06-01'
-- where the most recent entry is in May or is an activate entry
-- assumes they have to have an activate entry before they get a deactivate entry
and (date > '2011-05-01' or [action] = 'activate')
| {
"pile_set_name": "StackExchange"
} |
Q:
How to only create table if it doesn't exist? Using "object_id('table') IS NULL" doesn't work?
I would like to check if the table does not exist, then create one, otherwise, insert data into it.
use tempdb
if object_id('guest.my_tmpTable') IS NULL
begin
CREATE TABLE guest.my_tmpTable (
id int,
col1 varchar(100)
)
end
--- do insert here ...
The first time run, the table was created but the 2nd run the sybase complains the table already exist.
Thanks!
A:
The reason is that the entire statement - if and its "true" part are compiled as one.
If the table exists during compilation - error.
So you could put the CREATE TABLE statement into a dynamic sql statemetn EXEC('CREATE TABLE....')
Then all that Sybase sees at compilation is:
IF object_id('mytab') IS NULL
EXEC('something or other')
The contents of EXEC are not compiled until execution, by when you know there's no table and all is well.
| {
"pile_set_name": "StackExchange"
} |
“Every living being is an engine geared to the wheelwork of the universe. Though seemingly affected only by its immediate surroundings, the sphere of external influence extends to infinite distance.”—Nikola Tesla
So it is. From amoeba to man,
out of the mire, up to the skies.
And so it is on a strange planet
orbiting a distant star.
The paradigmatic two eyes
crawl out of the indifferent water,
the wide lungs of a dinosaur,
the father, mother, son and daughter
of the first mammal in his jaws.
A billion years will likely pass
before they walk on their two feet,
a billion more if they amass
sharp tools and swords and written laws,
a billion more until we meet. | {
"pile_set_name": "Pile-CC"
} |
Silvie The Perfect Maid
A fantasy comes true in our new Hegre-Art film. Sexy Silvie will be your personal maid for the week!
You will be delighted to know that Silvie is more interested in teasing you than getting on with the daily chores. So sit back and watch in awe as Silvie performs a slow striptease for you in not one, but two little outfits.
Filmed before Silvie shaved off her bush – this is room service like never before!
With the sexy smolder in her eyes – you just know that Silvie was maid for pleasure!
RECENT NEWS:
The ancient Taoists believed that self-love was an important part of a healthy and youthful life. Just like you care for your muscles or your heart, so you should care for the sexual organs of the body.More
TANTRA NEWS:
It’s the beginning of the year and it brings many opportunities to start new chapters in different areas of your personal life. What about your career, relationship, health, sexual life and family relationships?More
RECENT NEWS:
The product of two very different countries, Canada and Egypt, Kasia has stunning features and gorgeous skin tones. She is a girl you could get lost in, a girl you could run away with on the adventure of your life.More
RECENT NEWS:
You might think of figure skating as a soft and easy sport, basically a bit of dancing on ice. Well, you try gliding at frightening speed across rock hard ice, planting you skate into the ice and propelling your body metres into the air, and then landing again on one single blade.More | {
"pile_set_name": "Pile-CC"
} |
The rise of LinkedIn’s news feed - japhyr
http://venturebeat.com/2012/09/15/the-rise-of-linkedins-news-feed-and-how-twitter-made-a-big-dumb-mistake/
======
arturadib
> "Feeds are now full of relevant engaging posts because LinkedIn user’s post
> stuff they think will be relevant to their audience"
My 200+ connections must be very quiet - all I see in my feed are job title
and skill changes.
That being said, if LinkedIn enabled folks to follow without connecting, that
could be very interesting indeed.
~~~
diminish
As a successful massive social network with engaged users Linked in makes me
think what "engaged" truly means and how it can be measured. "X connected with
Y. Z updated his profile." was all that comes out (I am a member since its
first year) and now add to it some news. Linkedin seems to be club you went
with all your ex/colleagues and ex/bosses. Since no one is drunk yet, no one
dances or speaks.
The only valuable engagement seems to be clicking on a profile of someone.
Knowing that he will see you doing this, is what stops me from clicking.
Finally, people mostly pay for membership due to this instinct to see "who
looked at me?".
------
Aloisius
I use LinkedIn's news feed quite frequently, though through Flipboard. It is
hard to compare it to Twitter because I follow a radically different group of
people. First five stories from LinkedIn right now on my flipboard:
How to evaluate whether or not you should join a startup
How to Win Over someone Who Doesn't Like You
Why termites explode
Twitter Marketing Software
How Disney Built a big data platform on a startup budget
My Twitter feed however is filled with mostly political and local news
stories.
------
joshhart
I'm a tech lead working on the feed backend at LinkedIn. I work both on
storage and feed relevance. Happy to answer any questions if I can. I will say
we're always looking for passionate engineers, especially those with a
background in machine learning or information retrieval.
~~~
davros
Could you please add an unsubscribe from the linkedin updates email - I've
been told by customer service the only way to stop getting that is by deleting
my account : (
~~~
dmcy22
Not 100% if this is what you're asking, but if you go to settings (hover over
the triangle near the top right corner) there's a "email preferences" tab near
the bottom left. You can change the frequency and kinds of emails you receive
there.
~~~
davros
Thanks, you can unsubscribe from some emails there, but the linkedin update
and a bunch of other email communications are not covered.
I've solved the problem by marking it as spam.
------
dredmorbius
Meh. I use LinkedIn for job leads. And that's only when necessary.
I've been getting increasingly spammed by the site, and am getting
consistently lower and lower quality recruiter contacts (both on and off LI),
in conjunction with a number of privacy-violating moves, which have lead me to
greatly reduce the information on my profile.
LinkedIn has a certain role, but shouldn't push too far beyond that.
Twitter? What's that?
------
hapless
I turned off the news feed the second day I saw it. As it turns out, I don't
really want to receive articles shared by every professional contact I've ever
had.
"People I've worked with" is just not a good filter function for content.
------
runn1ng
Hm. I am not a LinkedIn user, but I was under the impression that LinkedIn is
something like "Facebook for people that are looking for a job" and I have it,
in my mind, connected with "boring serious business" issues. (I am a student
with a really small income, but not currently looking for a job.)
Did LinkedIn somehow became a social sharing platform while I was not looking?
When exactly?
How do you connect "a better kind of CV" (which I always thought is LI
purpose) with social sharing?
~~~
dasil003
Like a cocktail party but online.
------
endyourif
yeah i've been seeing some nice traffic from them for articles i share with my
community.
| {
"pile_set_name": "HackerNews"
} |
Cholesterol and cardiovascular disease: how strong is the evidence?
The relationship between elevated serum cholesterol and cardiovascular disease, specifically coronary heart disease (CHD), has been and continues to be a source of debate in the medical community. Other issues under debate include criteria for screening for elevated cholesterol, criteria for treatment, and whether intervention to lower elevated cholesterol prior to a cardiac event is cost effective. Most physicians believe this latter statement to be true; however, reports of no decrease in overall mortality rates in those without clinical coronary disease in whom aggressive lowering of cholesterol is achieved may have contributed to the lack of consensus on this most important issue. In this presentation the evidence that links cholesterol and CHD is reviewed and it is demonstrated that lowering elevated cholesterol concentrations can improve quality of life and life expectancy. | {
"pile_set_name": "PubMed Abstracts"
} |
Q:
How to covert this expression to LINQ
Hi I have this FilterAlerts Function which I think can be implemented using LINQ. I am fairly new to C# and need help converting it. Also is there a better way to assign errors to the expression in the end?
new public BusinessProfileStateModel Create(BusinessProfileViewModel profileViewModel)
{
var businessProfileState = base.Create(profileViewModel);
if (profileViewModel != null)
{
businessProfileState.DialogLocations = profileViewModel.DialogLocations;
businessProfileState.IsCommunityMember = profileViewModel.IsCommunityMember;
businessProfileState.IsLocalReport = profileViewModel.IsLocalReport;
businessProfileState.IsMultiLocation = profileViewModel.IsMultiLocation;
}
return FilterAlerts(businessProfileState);
}
private BusinessProfileStateModel FilterAlerts(BusinessProfileStateModel businessProfileStateModel)
{
var errors = new List<BPAlert>();
foreach (BPAlert alert in businessProfileStateModel.Display.Alerts.AllAlerts)
{
if (AlertFinderUtil.IsValidAlertTypeId(alert))
{
errors.Add(alert);
}
}
businessProfileStateModel.Display.Alerts.AllAlerts = errors;
return businessProfileStateModel;
}
}
A:
You can try this.
businessProfileStateModel.Display.Alerts.AllAlerts =
businessProfileState.Display.Alerts.AllAlerts.Where(alert => AlertFinderUtil.IsValidAlertTypeId(alert)).ToList();
Hope it helps!
| {
"pile_set_name": "StackExchange"
} |
/***************************************************************************
*
* truncate.c-释放指定i节点在设备上占用的所有逻辑块
* 包括直接块、一次间接块和二次间接块，从而将文件对应的
* 长度截为零，并释放占用的设备空间
*
* Copyright (C) 2010 杨习辉
***************************************************************************/
#include "type.h"
#include "blk.h"
#include "process.h"
#include "fs.h"
/*释放一次间接块，block是间接块的块号*/
private void free_level1(int dev,int block)
{
struct_mem_buffer *mbuffer;
int i;
u16 *p;
/*块号不能为零*/
if(!block)
{
return;
}
/*下面释放一次间接块中指向的数据块号*/
if(mbuffer = bread(dev,block))
{
p = (u16 *)mbuffer->data;
for(i = 0 ; i < (BLOCK_SIZE / sizeof(u16)) ; i ++)
{
if(*p)
{
free_block(dev,*p);
}
}
brelease(mbuffer);
}
/*最后释放一次间接块*/
free_block(dev,block);
}
/*释放二次间接块，block是二次间接块的块号*/
private void free_level2(int dev,int block)
{
struct_mem_buffer *mbuffer;
int i;
u16 *p;
/*块号不能为零*/
if(!block)
{
return;
}
if(mbuffer = bread(dev,block))
{
p = (u16 *)mbuffer->data;
/*下面循环释放多个可以看作为一次间接块的块*/
for(i = 0 ; i <= BLOCK_SIZE / sizeof(u16) ; i ++)
{
if(*p)
{
free_level1(dev,*p);
}
}
brelease(mbuffer);
}
/*最后再释放二次间接块本身*/
free_block(dev,block);
}
/*将文件截断为零，并释放占用的空间*/
/*由于此函数供文件系统本身调用，所以不考虑竞争条件*/
public void truncate(struct_mem_inode *inode)
{
int i;
/*参数合法性检查*/
if(!inode)
{
return;
}
/*判断是不是目录文件或普通文件，只有这两种文件才可以进行操作*/
if(IS_DIR(inode->mode) || IS_NORMAL(inode->mode))
{
/*首先释放直接块号*/
for(i = 0 ; i < INDEX_LEVEL1 ; i ++)
{
free_block(inode->dev,inode->data[i]);
inode->data[i] = 0;
}
/*一次间接块*/
free_level1(inode->dev,inode->data[INDEX_LEVEL1]);
free_level2(inode->dev,inode->data[INDEX_LEVEL2]);
inode->data[INDEX_LEVEL1] = 0;
inode->data[INDEX_LEVEL2] = 0;
/*文件长度为0*/
inode->size = 0;
/*已修改inode*/
inode->dirty = TRUE;
/*时间*/
inode->modify_time = CURRENT_TIME;
inode->last_access = CURRENT_TIME;
}
}
| {
"pile_set_name": "Github"
} |
Google AU -- Dont stop me now - delinquentme
http://www.google.com.au/
======
derrida
In case you are wondering, press 'play'.
| {
"pile_set_name": "HackerNews"
} |
Q:
How to store in a variable an echo | cut result?
for example
echo "filename.pdf" | cut -d'.' -f 1
This way I get the "filename" string.
I'd like to store it in a variable called FILE and then use it like this:
DIR=$PATH/$FILE.txt
So, my script wants to create a file.txt with the same name of the pdf (not a copy of the file, just the name)
This way I tried to assign the result of echo | cut
FILE=
but I get only "path/.txt" so the filename is missing.
A:
FILE=$(echo "filename.pdf" | cut -d'.' -f 1)
| {
"pile_set_name": "StackExchange"
} |
Camp Moremi is situated in the Xakanaxa region of Moremi Game Reserve in the Okavango Delta region of northern Botswana. The camp is a hidden gem sited at the point where the waters of the delta meet the vast plains of the Kalahari Desert into which the waters drain, the result of which is a patchwork of mopane woodland, open grasslands, seasonal floodplains and riverine habitats; one of the most diverse anywhere in the Okavango.
OVERVIEW
The camp comprises just eleven luxury safari tents, raised on hardwood decks and each featuring en-suite facilities and a private deck, from which guests can easily see whatever wildlife wanders past. The bird-life around Camp Moremi is prolific and varied, and each boat trip affords guests exceptional bird-watching opportunities. The main guest area at Camp Moremi consist of a secluded swimming pool and sundeck, an elevated viewing platform with a breathtaking panorama of Xakanaxa Lagoon, and a thatched boma where guests can enjoy brunch or afternoon tea.
Camp Moremi offers a wide range of game viewing activities on both land and water including morning and afternoon game drives in open top 4×4 safari vehicles tracking wildlife in the beautiful surroundings of Moremi Game Reserve known for its frequent sightings of lion, leopard, cheetah as well as African Wild Dog, a highly endangered species rare to see elsewhere. Water activities involve motorised boat excursions on Xakanaxa Lagoon and the surrounding Okavango Delta channels. | {
"pile_set_name": "Pile-CC"
} |
Q:
How do you enable short-tag syntax in codeigniter?
I have an app (CodeIgniter) that uses the
<?=$variable?>
syntax instead of
<?php echo $variable; ?>
and I would like for it to work on my local host. What is it that I need to enable in my php.ini file to do this?
Please note, I am not asking how to enable short_open_tag, but how to enable this in CodeIgniter.
Thanks in advance..
A:
In CodeIgniter's config.php:
/*
|--------------------------------------------------------------------------
| Rewrite PHP Short Tags
|--------------------------------------------------------------------------
|
| If your PHP installation does not have short tag support enabled CI
| can rewrite the tags on-the-fly, enabling you to utilize that syntax
| in your view files. Options are TRUE or FALSE (boolean)
|
*/
$config['rewrite_short_tags'] = FALSE;
This will also mean that it isn't host dependent.
A:
Read on this: PHP Short Open Tag: Convenient Shortcut or Short Changing Security?
A:
Search for php.ini file in your php installed directory
open it by any text editor then just you search again "short_open_tag" if you find that line like ";short_open_tag = Off" then just remove the ";" and restart your apache server it will work. But I highly request you not to use php short tag due to not all the web server accept the php short tag.
| {
"pile_set_name": "StackExchange"
} |
Specific lack of the hypermodified nucleoside, queuosine, in hepatoma mitochondrial aspartate transfer RNA and its possible biological significance.
Tumor nucleic acids have frequently been found to be deficient in methylated and other modified nucleotides. In particular, cytoplasmic transfer RNAs (tRNAs) from various neoplasms partially lack the hypermodified nucleoside queuosine, a modification specific for anticodons of histidine-, tyrosine-, asparagine-, and aspartic acid-accepting tRNAs. Using aspartate tRNA as an example, we show here that liver mitochondria contain tRNA fully modified with respect to queuosine, while the corresponding tRNA from mitochondria of Morris hepatoma 5123D completely lacks this constituent. The sequences of these tRNAs, which were determined by a highly sensitive 32P-postlabeling procedure entailing the direct identification of each position of the polynucleotide chains, were found to be (sequence in text) Lack of queuosine in the hepatoma mitochondrial tRNA may be due to the inavailability of queuine in the hepatoma mitochondria for incorporation into tRNA or to inhibition of the modifying enzyme, tRNA (guanine)-transglycosylase, in the tumor. Taking into account results of others indicating a possible involvement of the queuosine modification in differentiation of eukaryotic cells, we hypothesize that the queuosine defect may develop at an early stage of carcinogenesis (i.e., during the promotion phase) and be directly involved in abnormalities of mitochondria which have been observed frequently in transformed cells and tumors. | {
"pile_set_name": "PubMed Abstracts"
} |
Medical reduction of stone risk in a network of treatment centers compared to a research clinic.
We determined whether a network of 7 comprehensive kidney stone treatment centers supported by specialized stone management software and laboratory resources could achieve reductions in urine supersaturation comparable to those in a single research clinic devoted to metabolic stone prevention. Supersaturation values for calcium oxalate, calcium phosphate and uric acid in 24-hour urine samples were calculated from a set of kidney stone risk factor measurements made at a central laboratory site for the network and research laboratory for the clinic. Individual results and group outcomes were presented to each center in time sequential table graphics. The decrease in supersaturation with treatment was compared in the network and clinic using analysis of variance. Supersaturation was effectively reduced in the network and clinic, and the reduction was proportional to the initial supersaturation value and increase in urine volume. The clinic achieved a greater supersaturation reduction, higher fraction of patient followup and greater increase in urine volume but the treatment effects in the network were, nevertheless, substantial and significant. Given proper software and laboratory support, a network of treatment centers can rival but not quite match results in a dedicated metabolic stone research and prevention clinic. Therefore, large scale stone prevention in a network system appears feasible and effective. | {
"pile_set_name": "PubMed Abstracts"
} |
Q:
Can I install heat mat and backer board over cork flooring?
I am installing a new bathroom floor. I plan on getting an electric underfloor heating mat, 2 backer boards for under the heating, screed the mat and tile over this.
My question is can I place the back boards on the cork vinyl(even though it's got glue on top) or do I need to remove the cork.
Another option is cleaning the glue off the cork and using the cork as the subfloor. Is this possible?
Thanks for the help, first timer here.
A:
When I am redoing a bathroom and adding the needed backer board to a subfloor assembly, I would remove all existing finish floors no matter how many to get back down to the original subfloor. Then evaluate that, repair it if needed, add to it if needed to make it stiff enough for tile, then add the one layer of 1/4" backer board, then the heating wires, screed, then thinset and tile.
All these layers together will add up to a reasonably thick floor, if the all original flooring is not removed, you will have a potentially sizable rise in height from one floor to another
A:
I've never had to do this (install tile over cork), but I think you need to remove the cork.
Backer/cement boards needs to be firmly fastened to the sub-floor. Any kind of softness, give, or "springiness" will be transferred up the tiles and will cause the tiles or the tile joints to crack.
| {
"pile_set_name": "StackExchange"
} |
Q:
Why wont this position properly using css?
This should be simple, it is just three div tags inside of another div tag. The three div tags should just line up in a row. Instead they are lined up vertically. Nothing I do seems to fix it.
<head>
<link href="css.css" rel="stylesheet" type="text/css" />
</head>
<body>
<?php
function NameChange($num) {
$card = $_POST["state".$num];
$spaces = " ";
$underscore = "_";
$imagename = str_replace($spaces, $underscore, $card);
return $imagename;
}
?>
<div id="main">
<div id="3c1">
<?php
echo '<script type="text/javascript">
function myPopup1() {
window.open( "images/'.NameChange(1).'.jpg", "myWindow",
"status = 1, height = 691, width = 468, resizable = 0" )
}
</script>';
echo '<script type="text/javascript">
function myPopup2() {
window.open( "images/'.NameChange(2).'.jpg", "myWindow",
"status = 1, height = 691, width = 468, resizable = 0" )
}
</script>';
echo '<script type="text/javascript">
function myPopup3() {
window.open( "images/'.NameChange(3).'.jpg", "myWindow",
"status = 1, height = 691, width = 468, resizable = 0" )
}
</script>';
echo '<img src=images/'.NameChange(1).'_tn.jpg />';
echo "<br />";
echo '<input type="button" onClick="myPopup1()" value="Image">';
echo '<script type="text/javascript">
function myPopup1t() {
window.open( "/'.$_POST[state1].'.html", "myWindow",
"status = 1, height = 691, width = 468, resizable = 0" )
}
</script>';
echo '<input type="button" onClick="myPopup1t()" value="Meaning">';
?>
</div>
<div id="3c2">
<?php
echo '<img src=images/'.NameChange(2).'_tn.jpg />';
echo "<br />";
echo '<input type="button" onClick="myPopup2()" value="Image">';
echo '<script type="text/javascript">
function myPopup2t() {
window.open( "/'.$_POST[state2].'.html", "myWindow",
"status = 1, height = 691, width = 468, resizable = 0" )
}
</script>';
echo '<input type="button" onClick="myPopup2t()" value="Meaning">';
?>
</div>
<div id="3c3">
<?php
echo '<img src=images/'.NameChange(3).'_tn.jpg />';
echo "<br />";
echo '<input type="button" onClick="myPopup3()" value="Image">';
echo '<script type="text/javascript">
function myPopup3t() {
window.open( "/'.$_POST[state3].'.html", "myWindow",
"status = 1, height = 691, width = 468, resizable = 0" )
}
</script>';
echo '<input type="button" onClick="myPopup3t()" value="Meaning">';
?>
</div>
</div>
</body>
And the CSS
#main {
width: 808px;
margin-right: auto;
margin-left: auto;
left: auto;
right: auto;
border-top-style: solid;
border-right-style: solid;
border-bottom-style: solid;
border-left-style: solid;
}
#main #3c1 {
height: 200px;
width: 200px;
display: inline;
}
#main #3c2 {
height: 200px;
width: 200px;
display: inline;
}
#main #3c3 {
height: 200px;
width: 200px;
display: inline;
}
A:
If display:inline is not doing the right thing thing you can float the divs.
<div>
<div style="float:left">stuff</div>
<div style="float:left">stuff</div>
<div style="float:left">stuff</div>
<br style="clear:both;"/>
</div>
A:
The id's cannot start with numbers. You cannot set height and width (among other attributes) on inline elements. Use display:inline-block for that. Also use a single class if all 3 divs will have the exact same CSS rules.
| {
"pile_set_name": "StackExchange"
} |
The compression pressure produced above the cylinder of an internal combustion engine has been measured by a compression gauge connected to the sparkplug opening in the cylinder above the piston head. After about three compression strokes of the piston, the pressure reading on the gauge will equal that normally in the cylinder and will give a good indication of the condition of the piston rings on the piston head. Various constructions of compression testers have been utilized for this purpose and have used a movable line pointer which moves over a fixed scale mounted on the device. Because of the small area of the pointer, slight changes in pointer position are not easily observed. Also, because of the smallness of the pointer, the tester had to be carefully handled to prevent damage to the pointer. | {
"pile_set_name": "USPTO Backgrounds"
} |
St. Mary's Church, Sønderborg
The St. Mary's Church is a church owned by the Church of Denmark in Sønderborg, Denmark and the church of the parish with the same name. Thanks to its location on a hill, the church building is very iconic for the city.
History
In the Middle Ages there was a leper colony on a hill just outside the city. It was named after Saint George and around 1300 the chapel of this leper colony stood in the place of the present St. Mary's Church. After the old parish church of the city, the St. Nicholas Church, was demolished around 1530, the Saint-George chapel became the new main church. Towards the end of the 16th century, John II, Duke of Schleswig-Holstein-Sonderburg commissioned the enlargement of the building in order to make it suitable for the function of the parish church of his city.
The current St. Mary's Church
In 1595 a start was made on the partial demolition of the old church and the construction of the new church. Only parts of the old medieval church remained. From the medieval church, a medieval wooden wall cupboard dating from about 1400 remained. The solemn inauguration of the new parish church took place just before Christmas in 1600. In 1649 the George Church was renamed as the Mary Church. The name of Saint George stayed in the Danish names Sankt Jørgensgade and Jørgensbjerg.
References
Category:Buildings and structures in Sønderborg Municipality
Category:Churches in Denmark
Category:Church of Denmark churches | {
"pile_set_name": "Wikipedia (en)"
} |
Q:
netbeans form loading issues
Error in loading component: [jDialog]->mainPanel->titleBar
cannot create instance of <qualified classname>
The component cannot be loaded.
Error in loading layout: [JDialog]->mainPanel->[layout]
Failed to initialize layout of this container
Errors occured in loading the form data. It is not recommended to use this form now in editable mode - data that could not be loaded would be lost after saving the form. Please go through the reported errors, try to fix them if possible, and open the form again. If you choose to open the form as View Only you may see which beans are missing.
recently moved a class that was being used in several forms but all the paths in both form and java files were updated to point to the new location. Anyone know what could cause an error like this?
Things I have tried: clean + build, removeing and re-adding all library jar files, making sure the title bar and the old version in SVN were identical except for the package changes. Doing the same comparison with their respective form files.
A:
In the View menu there is an IDE log option that allowed me to see what was happening behind the scenes to cause this error.
custom code for the text of one of the labels was throwing an exception.
| {
"pile_set_name": "StackExchange"
} |
Studencheskaya (Novosibirsk Metro)
Studencheskaya () is a station on the Leninskaya Line of the Novosibirsk Metro. It opened on December 28, 1985.
Category:Novosibirsk Metro stations
Category:Railway stations opened in 1985
Category:Leninsky City District, Novosibirsk
Category:Railway stations located underground in Russia | {
"pile_set_name": "Wikipedia (en)"
} |
You are here
Model Chapter Program
The purpose of the Model Chapter Program is to strengthen the overall chapter structure and program of activities. In the late fall chapters receive notice of the program. To apply, chapters must first establish a set of goals for the coming calendar year which are attainable, yet require some effort. These goals are then submitted online to the Member and Chapter Services Department at AFCEA International by early February.
All chapters enrolled in the Model Chapter Program will submit a Final Achievement report-out of their efforts for review by their Regional Vice President by mid-February.
This recognition program is a prerequisite to being nominated for the Harry C. Ingles Chapter Award.
Through its established worldwide network of individual members, chapters and member organizations across the globe, AFCEA has led the ethical exchange of information for nearly 70 years, with roots that trace back to the U.S. Civil War. We offer individual, corporate, student and military/government membership levels. We welcome you and promise to provide superior service, value and support. Join the community that has been the connection for global security since 1946. | {
"pile_set_name": "Pile-CC"
} |
1. Field of the Invention
The present invention relates to a multifunctional conduit, and in particular, to a multifunctional conduit acting as a structural member constituting a structure, an attaching member to which various fluid and electrical devices can be attached, and a conduit duct in which pipes and wires are accommodated.
2. Description of Prior Art
When connected to a fluid-pressure device or its controller mounted on a working structure, pipes and wires are conventionally accommodated and protected in a conduit.
Conventional conduits, however, only have a function for simply accommodating pipes and wires to protect them, so they cannot be incorporated into the structure or used to connect the above devices together. They can only be attached to the structure as simple accessories for piping and wiring. Consequently, such conduits are cumbersome to handle, and their attachment and removal operations are complicated. | {
"pile_set_name": "USPTO Backgrounds"
} |
The invention is directed to a process for the separation of bis pentaerythritol monoformal from crude pentaerythritol.
In the customary production of pentaerythritol by condensation of formaldehyde with acetaldehyde there is formed a crude pentaerythritol contaminated by various byproducts. A particularly disturbing product is bis pentaerythritol monoformal. The content of this byproduct generally amounts to about 2 to 5%.
It is known to remove the bis pentaerythritol monoformal from the crude pentaerythritol by treating aqueous solutions of the crude pentaerythritol at a temperature of 50.degree. to 150.degree. C. with a strongly acid cation exchange resin (Hercules British Pat. No. 799,182) or at a temperature of 150.degree. to 300.degree. C. under pressure with a cracking catalyst (Maury U.S. Pat. No. 2,939,837). These processes are expensive and therefore are little suited for use on an industrial scale. | {
"pile_set_name": "USPTO Backgrounds"
} |
Your information is being collected and processed by Countrywide. All information will be processed in accordance with the General Data Protection Regulation. Full details of how we process your information can be found on our website Privacy Policy. Print copies of our privacy notice are available on request. If you need to discuss how your information is being processed, please contact us at [email protected].
A beautifully presented one bedroom modern apartment with a south facing aspect, large balcony and stunning communal roof top garden. The property is conveniently placed for Deptford Station and Cutty Sark DLR for a swift commute to Canary Wharf, London Bridge and the C
Asking Price £345,000
LAUNCHING THIS OCTOBER Vision House is the reinvention of a classic Art Deco building into a collection of high specification apartments designed for modern living. Opposite the development is Wimbledon Chase with direct Thameslink trains to Central London.
Asking Price £340,000
A nicely presented 1 bedroom apartment located in the popular New Capital Quay develepment with a private balcony. The property is located within close proximity to Greenwich Park and Market as well as the Cutty Sark DLR Station for a swift commute to the City and...
Asking Price £340,000
Situated in one of Whetstone’s premier tunings within only a short walk to both Oakleigh Park Main Line Station with its fast train into Kings Cross and Moorgate, and to Totteridge & Whetstone Northern Line Tube as well as the lovely shops and café bars along the High R
Guide Price £339,000
A well presented modern apartment finished to an exceptionally high standard and equipped for modern living. The open plan living space offers ample storage with a contemporary fitted kitchen by Alno and fitted appliances throughout. Sliding patio doors open out onto a
Guide Price £329,000
A split-level 3 bedroom ex-local authority apartment located on the 2nd and 3rd floor. The apartment features a reception room with a balcony, separate kitchen, 3 bedrooms, bathroom and downstairs WC. There is ample storage throughout the property and includes a...
Offers in excess of £325,000
This is a well proportioned 1 bedroom flat that has been recently renovated and refurbished. There is a good balance of accommodation with an eat-in kitchen, double bedroom, good sized reception room and bathroom. The flat is close to Earlsfield Station and the new...
Asking Price £325,000
A ground floor, two bedroom flat within this small block in Russell Road. A convenient location within a short walk of Oakleigh Road North where you have a bus route to Arnos Grove in one direction or Totteridge & Whetstone in the other for the Tube Stations. Close by...
If 'no results' continues to show, we may not have any properties for sale in your desired location.
Can’t find what you’re looking for?
Due to the fast moving pace of the Short Let market, many of our properties never make it to the website. If you can’t find what you’re looking for, please give our Short Let team a call as we may have the ideal property for you.
Related Links
Follow Hamptons International
Hamptons International is a trading name of Countrywide Estate Agents. Registered Office Greenwood House, 1st Floor, 91-99 New London Road, Chelmsford, Essex, CM2 0PP. Registered in England Number 00789476 which is regulated by ARLA/Propertymark. Countrywide Estate Agents is an appointed representative of Countrywide Principal Services Limited which is authorised and regulated by the Financial Conduct Authority.
Privacy Policy
We use cookies on our website which are strictly necessary to ensure optimal site performance, functionality and for analytics. You can manage your cookie preferences via your browser settings. To learn more about the different types of cookies and how we use these, please see our Cookies Policy. | {
"pile_set_name": "Pile-CC"
} |
2013 Kawasaki Ninja ZX-10R (ABS) | Preview
Since its major overhaul for the 2011 model year, the Kawasaki Ninja ZX-10R has pleased the crowds with its nimble chassis and powerful 998cc inline four, offering much competition for Yamaha’s YZ-R1, Honda’s CBR1000RR and Suzuki’s GSX-R1000.
How powerful? How about 197 base horsepower after EPA officials allegedly forced Kawasaki to reduce the output by 20 horsepower in America.
Nothing changed for the 2012 year except for some color schemes, Kawasaki offering its Ninja liter bike as a carryover. But for 2013 the ZX-10R receives some upgrades, including a new electronic steering damper developed b Kawasaki and Ohlins, and a new color scheme – Pearl Flat White/Metallic Spark Black.
And like it has since its overhaul in 2011, the ZX-10R arrives with Sport-Kawasaki Traction Control (S-KTRC) and the optional Advanced Kawasaki Intelligent Anti-lock Braking System, the ABS adding $1000 to the standard MSRP of $14,299.
The S-KTRC is unique to Kawasaki, and different from other traction control units; the S-KTRC continuously monitors the ZX-10R’s wheel speed, throttle position, engine RPM and other data to “help ensure the optimal amount of traction.”
And this system is far advanced for quick response to these changing conditions, the S-KTRC confirming conditions 200 times per second before governing them with the ignition. The ZX-10R’s KTRC is available in three different modes based on the rider’s needs.
As for the Advanced Kawasaki Intelligent Anti-lock Braking System, it “monitors a wide range of data, and allows optimum wheelspin while enhancing rider control.”
The new-for-2013 Kawasaki/Ohlins-designed steering damper features much advanced technology, the damper controlled by an ECU under the gas-tank cover. Kawasaki says
the “damper reacts to the rate of acceleration or deceleration, as well as rear wheel speed, to help provide the ideal level of damping force across a wide range of riding scenarios.
“The result is a light and nimble steering feel at low speed, as well as superior damping at higher speeds or during extreme acceleration/deceleration. The anodized damper unit incorporates Öhlins’ patented twin-tube design to help ensure stable damping performance and superior kickback absorption. It is mounted horizontally at the front of the fuel tank and requires very few additional components and ads almost no weight compared to last year’s steering damper.”
Regarding the chassis, the Ninja has an optimal design, which features an aluminum-alloy frame that is only cast in seven places. Up front, the 2013 ZX-10R features a 43mm Big Piston Fork that features a piston design nearly twice the size of a conventional cartridge fork, offering “smooth action, less stiction, light weight and enhanced damping performance on the compression and rebound circuits.”
Out back, the Ninja features a Horizontal Back-Link design that positions the shock and linkage above the swingarm. Kawasaki says “benefits include mass centralization, good road holding, compliance and stability, smooth action in the mid-stroke and good overall feedback. The fully adjustable shock features a piggyback reservoir and dual-range (low- and high-speed) compression damping.”
As for the ZX-10R’s 16-valve, DOHC liquid-cooled inline four, it’s is more compact due to the stacked transmission, and it features innovative technology such as a slipper clutch that limits back torque to assist in corner entry.
The 998cc engine is tuned to optimize power delivery, center of gravity and actual engine placement within the chassis. Torque peaks at an rpm range that helps eliminate power peaks and valleys that make it difficult for racers and track-day riders to open the throttle with confidence.
And with this performance arrives stylish color options, including the all new for 2013 Pearl Flat White/Metallic Spark Black, and re-stylized Lime Green/Metallic Spark Black
Following are the highlights, specs, color options and MSRP for the 2013 Kawasaki Ninja ZX-10R.
2013 Kawasaki Ninja ZX-10R (ABS) Highlights:
New for 2013: Ohlins-Kawasaki Electronic Steering Damper
Specially tuned for the 2013 ZX-10R, this new electronic damper helps provide the ideal amount of damping force across a wide range of riding scenarios
Maintains a high level of rider feedback by allowing lower damping forces under less taxing conditions, but quickly adapts to increase damping and enhance high-speed stability when required
Reacts to current speed as well as rate of acceleration or deceleration to help provide light steering feel at low speed, as well as superior damping at higher speeds or during extreme acceleration/deceleration
Intake and exhaust valves are titanium to reduce reciprocating weight and stress at high rpm
Dual-injector Digital Fuel Injection
Large 47mm throttle bodies help with throttle control
Secondary fuel injectors enhance power output and power characteristics at high rpm; the lower injectors are always on, while upper injectors come on as needed according to degree of throttle opening and engine rpm
A highly sophisticated electronic system based on actual Kawasaki racing experience that’s designed to maximize forward motion by allowing racers to ride closer to the edge of traction
The system crunches a wide range of data, including throttle position, wheel speed, engine rpm, wheel slippage and acceleration, with help from a speed sensor fitted to each wheel
The quickest acceleration requires a certain amount of wheel slippage, so to optimize traction, S-KTRC actually allows for optimum wheelspin
Using complex analysis, the system is able to predict when traction conditions are about to become unfavorable. By acting before slippage exceeds the range for optimal traction, the system can quickly and smoothly reduce power slightly so the wheel regains traction
S-KTRC confirms conditions 200 times per second and governs ignition, which allows extremely quick response to changing conditions
Riders can choose between three operational modes, depending on skill level and conditions
A level meter on the LCD instrument panel displays how much electronic intervention the system is providing, in real time
S-KTRC confirms conditions 200 times per second and governs ignition, which allows extremely quick reaction
Riders can choose between three operational modes, depending on skill level and conditions
A level meter on the LCD instrument panel lets the rider know when the system is operating
Kawasaki Intelligent Anti-lock Braking System (KIBS)
Advanced track-ready anti-lock braking system
Utilizes a Bosch-built ABS unit that’s half the size of a standard unit and considerably lighter
A highly efficient and forward-positioned ram air intake is designed for low intake noise and good intake efficiency
9-liter airbox enhances breathing and power
Oval-section intake funnels promote non-turbulent flow at all rpm
Titanium Exhaust System
Titanium-header exhaust system with hydroformed header pipes and small, lightweight muffler assembly uses a pre-chamber that houses two catalyzers for emissions and sound
Headers have nearly identical specs to their roadracing counterparts, which makes it easier for riders to increase track performance with the simple addition of a less-restrictive muffler; now there’s no need to replace the lightweight and race-spec header assembly
Frame is an all-cast construction of only seven pieces, with ideal wall thicknesses that provide adequate strength and optimized rigidity
Front end weight aids aggressive, on-the-gas corner exits
Modifying or removing the exhaust pre-chamber (for racetrack applications only) enables two chain links to be removed, which offers riders the opportunity to alter chassis geometry by shortening the wheelbase by up to 16mm to suit different track layouts
Like the frame, the alloy swingarm is an all-cast design, with just three pieces
The design positions the shock’s upper link to spread out the load and contribute to enhanced overall frame rigidity and chassis balance
The fully adjustable shock features a piggyback reservoir and dual (high- and low-speed) compression damping, which enables fine tuning for racing or track-day use
The Big Piston Fork (BPF) and Back-link suspension system contribute to rider control and faster lap times
Big Piston Fork (BPF)
The Big Piston Fork’s (BPF) 43mm inner tubes is one of the contributing factors to the bike’s composure under braking
Compared to a cartridge-type fork of the same size, the BPF features a 39.6mm main piston
Oil inside the BPF acts on a surface area almost four times the size of a conventional fork’s. The larger surface area allows damping pressure to be reduced while helping to ensure that damping force remains the same
Reducing damping pressure allows the inner fork tube to move more smoothly, which is especially noticeable at the initial part of the stroke. The result is greater control as the fork compresses and very calm attitude change as vehicle weight shifts forward under braking, and contributing to greater chassis stability on corner entry
Because the BPF eliminates many of the internal components of a traditional cartridge fork, construction is simplified and overall fork weight is reduced
Compression and rebound damping adjustments are located at the top of each fork tube, while preload is now at the bottom
Three-spoke Cast Aluminum Wheels
Gravity-cast alloy wheels feature a three-spoke design
Light wheels mean low unsprung weight, which allows the suspension system to work more efficiently
Search
Stay Connected
If it has two wheels, Ultimate Motorcycling has the inside scoop. From the latest motorcycle and apparel reviews, to MotoGP results and OEM sales reports, Ultimate Motorcycling covers it all. Our small but passionate staff works endlessly to deliver quality and enjoyable motorcycle content. | {
"pile_set_name": "Pile-CC"
} |
Q:
UNIX: List files in directory with relative path
The question is:
What command would you use to list the text files in your
fileAsst directory (using a relative path)?
The previous question was:
Give a command to list the names of those text files, using an absolute path to the fileAsst directory as part of your command.
The answer was:
~/UnixCourse/fileAsst/*.txt
I was wondering how I can list the files in this directory using a relative path. I've tried several commands including:
ls ~/UnixCourse/fileAsst/*.txt|awk -F"/" '{print $NF}'
(cd ~/UnixCourse/fileAsst/*.txt && ls )
and a bunch of others.
But it keeps telling me their invalid. I know it has to be a correct answer because others have gotten past this. But right now I'm stuck and extremely frustrated =(
UPDATE:
After going to the CS lab someone helped me figure out the problem. I needed to be in a certain working directory at first, and I wasn't. After switching to that directory all I needed was the command:
../UnixCourse/fileAsst/*.txt
and that took care of it for me. Thanks to everyone that helped and I hope this helps someone else.
A:
try:
$ cd ~/UnixCourse/fileAsst/
$ find .
as a one-liner (executing in a sub-shell)
$ (cd ~/UnixCourse/fileAsst/ && find .)
another approach
$ (cd ~/UnixCourse && ls fileAsst/*.txt
$ ls ~/UnixCourse/fileAsst/*.txt
| {
"pile_set_name": "StackExchange"
} |
Depression is among the most prevalent of all psychiatric disorders. Consistent with the NIH objectives of promoting discovery in the brain and behavioral sciences to fuel research on the causes of mental disorders and charting mental illness trajectories to determine when, where, and how to intervene, a critical public health priority is the development of methods for identifying and altering factors and mechanisms that increase individuals' vulnerability to depression. Offspring of depressed parents are known to be at elevated risk for developing depression; consequently, assessing these children has been an important strategy for elucidating factors associated with the increased risk for psychiatric disorder. To date, however, few studies have gone beyond documenting the magnitude of this risk to examine specific mechanisms that might underlie the intergenerational transmission of risk for depression. Over the last four years we have worked hard to recruit and test a large, carefully diagnosed, sample of 10- to 14-year-old never-disordered girls at either high or low familial risk for depression. Each girl has a biological mother who either has experienced recurrent episodes of Major Depressive Disorder (MDD) during her daughter's lifetime (high risk) or has never experienced an episode of any Axis-I disorder (low risk). Although the high-risk girls are asymptomatic, we have found that they nevertheless already exhibit characteristics of MDD, including selective attention to sad faces, higher and more prolonged cortisol secretion in response to a laboratory stressor, higher levels of awakening cortisol, smaller hippocampi, and anomalous neural functioning both in response to reward and punishment and while experiencing and regulating a sad mood. Because we began recruiting the girls in this study at this young age only four years ago, we have not yet been able to examine fully whether these difficulties predict the subsequent onset of a first episode of MDD. Therefore, we propose to conduct a 54-month follow-up diagnostic session with this sample and to add a second fMRI scan to assess differences in the stability of neural structure and function between high-risk girls who do, and who do not, develop MDD. We also propose to recruit a new sample of high-risk daughters, to teach them either through attentional bias training or through real-time neurofeedback training to alter mechanisms that we posit underlie the development of MDD, and to assess both short- and long-term effects of modulating these mechanisms. We propose to examine immediate changes in stress reactivity, cognitive biases, and reward processing as a function of training. We also propose to conduct an 18-month follow-up assessment to examine longer-term effects of training on specific clinical constructs, such as levels of depressive symptoms, coping strategies, and the onset of MDD. This project will yield new insights concerning psychological and biological risk factors for MDD, and will provide important information that can be used to develop innovative and effective approaches to the prevention of depression. | {
"pile_set_name": "NIH ExPorter"
} |
Teaching Hiatus
Hi folks! I've relocated to southern California and am actively taking time off from teaching yoga. Check back soon (or scroll down and add yourself to my email list) to see when I'll be back in New Jersey teaching, and when I'll be starting up a California schedule. Thanks! | {
"pile_set_name": "Pile-CC"
} |
Digital (Safety) Needles - 1 Point Nano .20mm (5 PK)
Regular price
$55.00
Sale
Packs
NC Digital 1-point Nano Safety Cartridge -.20mm
The maximum quantity you can order for this product is 5.
The safety needles fit on the standard safety hand piece. For the protection of both the technician and the client, the Nouveau Contour Needle Cartridge System works unlike anything on the market today. The needle and the needle “tube” are integrated in one disposable cartridge system. Internal diaphragms halt and prevent fluid and airborne contaminants from entering the hand piece, which is therefore completely independent of the disposable cartridge and void of any possibility of cross-contamination.
When the cartridge is detached from the hand piece the needle automatically retracts back into the cartridge, preventing an accidental “stick” to the technician, or client. | {
"pile_set_name": "Pile-CC"
} |
<?php
/**
* WordPress Administration Scheme API
*
* Here we keep the DB structure and option values.
*
* @package WordPress
* @subpackage Administration
*/
/**
* Declare these as global in case schema.php is included from a function.
*
* @global wpdb $wpdb WordPress database abstraction object.
* @global array $wp_queries
* @global string $charset_collate
*/
global $wpdb, $wp_queries, $charset_collate;
/**
* The database character collate.
*/
$charset_collate = $wpdb->get_charset_collate();
/**
* Retrieve the SQL for creating database tables.
*
* @since 3.3.0
*
* @global wpdb $wpdb WordPress database abstraction object.
*
* @param string $scope Optional. The tables for which to retrieve SQL. Can be all, global, ms_global, or blog tables. Defaults to all.
* @param int $blog_id Optional. The site ID for which to retrieve SQL. Default is the current site ID.
* @return string The SQL needed to create the requested tables.
*/
function wp_get_db_schema( $scope = 'all', $blog_id = null ) {
global $wpdb;
$charset_collate = $wpdb->get_charset_collate();
if ( $blog_id && $blog_id != $wpdb->blogid ) {
$old_blog_id = $wpdb->set_blog_id( $blog_id );
}
// Engage multisite if in the middle of turning it on from network.php.
$is_multisite = is_multisite() || ( defined( 'WP_INSTALLING_NETWORK' ) && WP_INSTALLING_NETWORK );
/*
* Indexes have a maximum size of 767 bytes. Historically, we haven't need to be concerned about that.
* As of 4.2, however, we moved to utf8mb4, which uses 4 bytes per character. This means that an index which
* used to have room for floor(767/3) = 255 characters, now only has room for floor(767/4) = 191 characters.
*/
$max_index_length = 191;
// Blog-specific tables.
$blog_tables = "CREATE TABLE $wpdb->termmeta (
meta_id bigint(20) unsigned NOT NULL auto_increment,
term_id bigint(20) unsigned NOT NULL default '0',
meta_key varchar(255) default NULL,
meta_value longtext,
PRIMARY KEY (meta_id),
KEY term_id (term_id),
KEY meta_key (meta_key($max_index_length))
) $charset_collate;
CREATE TABLE $wpdb->terms (
term_id bigint(20) unsigned NOT NULL auto_increment,
name varchar(200) NOT NULL default '',
slug varchar(200) NOT NULL default '',
term_group bigint(10) NOT NULL default 0,
PRIMARY KEY (term_id),
KEY slug (slug($max_index_length)),
KEY name (name($max_index_length))
) $charset_collate;
CREATE TABLE $wpdb->term_taxonomy (
term_taxonomy_id bigint(20) unsigned NOT NULL auto_increment,
term_id bigint(20) unsigned NOT NULL default 0,
taxonomy varchar(32) NOT NULL default '',
description longtext NOT NULL,
parent bigint(20) unsigned NOT NULL default 0,
count bigint(20) NOT NULL default 0,
PRIMARY KEY (term_taxonomy_id),
UNIQUE KEY term_id_taxonomy (term_id,taxonomy),
KEY taxonomy (taxonomy)
) $charset_collate;
CREATE TABLE $wpdb->term_relationships (
object_id bigint(20) unsigned NOT NULL default 0,
term_taxonomy_id bigint(20) unsigned NOT NULL default 0,
term_order int(11) NOT NULL default 0,
PRIMARY KEY (object_id,term_taxonomy_id),
KEY term_taxonomy_id (term_taxonomy_id)
) $charset_collate;
CREATE TABLE $wpdb->commentmeta (
meta_id bigint(20) unsigned NOT NULL auto_increment,
comment_id bigint(20) unsigned NOT NULL default '0',
meta_key varchar(255) default NULL,
meta_value longtext,
PRIMARY KEY (meta_id),
KEY comment_id (comment_id),
KEY meta_key (meta_key($max_index_length))
) $charset_collate;
CREATE TABLE $wpdb->comments (
comment_ID bigint(20) unsigned NOT NULL auto_increment,
comment_post_ID bigint(20) unsigned NOT NULL default '0',
comment_author tinytext NOT NULL,
comment_author_email varchar(100) NOT NULL default '',
comment_author_url varchar(200) NOT NULL default '',
comment_author_IP varchar(100) NOT NULL default '',
comment_date datetime NOT NULL default '0000-00-00 00:00:00',
comment_date_gmt datetime NOT NULL default '0000-00-00 00:00:00',
comment_content text NOT NULL,
comment_karma int(11) NOT NULL default '0',
comment_approved varchar(20) NOT NULL default '1',
comment_agent varchar(255) NOT NULL default '',
comment_type varchar(20) NOT NULL default 'comment',
comment_parent bigint(20) unsigned NOT NULL default '0',
user_id bigint(20) unsigned NOT NULL default '0',
PRIMARY KEY (comment_ID),
KEY comment_post_ID (comment_post_ID),
KEY comment_approved_date_gmt (comment_approved,comment_date_gmt),
KEY comment_date_gmt (comment_date_gmt),
KEY comment_parent (comment_parent),
KEY comment_author_email (comment_author_email(10))
) $charset_collate;
CREATE TABLE $wpdb->links (
link_id bigint(20) unsigned NOT NULL auto_increment,
link_url varchar(255) NOT NULL default '',
link_name varchar(255) NOT NULL default '',
link_image varchar(255) NOT NULL default '',
link_target varchar(25) NOT NULL default '',
link_description varchar(255) NOT NULL default '',
link_visible varchar(20) NOT NULL default 'Y',
link_owner bigint(20) unsigned NOT NULL default '1',
link_rating int(11) NOT NULL default '0',
link_updated datetime NOT NULL default '0000-00-00 00:00:00',
link_rel varchar(255) NOT NULL default '',
link_notes mediumtext NOT NULL,
link_rss varchar(255) NOT NULL default '',
PRIMARY KEY (link_id),
KEY link_visible (link_visible)
) $charset_collate;
CREATE TABLE $wpdb->options (
option_id bigint(20) unsigned NOT NULL auto_increment,
option_name varchar(191) NOT NULL default '',
option_value longtext NOT NULL,
autoload varchar(20) NOT NULL default 'yes',
PRIMARY KEY (option_id),
UNIQUE KEY option_name (option_name),
KEY autoload (autoload)
) $charset_collate;
CREATE TABLE $wpdb->postmeta (
meta_id bigint(20) unsigned NOT NULL auto_increment,
post_id bigint(20) unsigned NOT NULL default '0',
meta_key varchar(255) default NULL,
meta_value longtext,
PRIMARY KEY (meta_id),
KEY post_id (post_id),
KEY meta_key (meta_key($max_index_length))
) $charset_collate;
CREATE TABLE $wpdb->posts (
ID bigint(20) unsigned NOT NULL auto_increment,
post_author bigint(20) unsigned NOT NULL default '0',
post_date datetime NOT NULL default '0000-00-00 00:00:00',
post_date_gmt datetime NOT NULL default '0000-00-00 00:00:00',
post_content longtext NOT NULL,
post_title text NOT NULL,
post_excerpt text NOT NULL,
post_status varchar(20) NOT NULL default 'publish',
comment_status varchar(20) NOT NULL default 'open',
ping_status varchar(20) NOT NULL default 'open',
post_password varchar(255) NOT NULL default '',
post_name varchar(200) NOT NULL default '',
to_ping text NOT NULL,
pinged text NOT NULL,
post_modified datetime NOT NULL default '0000-00-00 00:00:00',
post_modified_gmt datetime NOT NULL default '0000-00-00 00:00:00',
post_content_filtered longtext NOT NULL,
post_parent bigint(20) unsigned NOT NULL default '0',
guid varchar(255) NOT NULL default '',
menu_order int(11) NOT NULL default '0',
post_type varchar(20) NOT NULL default 'post',
post_mime_type varchar(100) NOT NULL default '',
comment_count bigint(20) NOT NULL default '0',
PRIMARY KEY (ID),
KEY post_name (post_name($max_index_length)),
KEY type_status_date (post_type,post_status,post_date,ID),
KEY post_parent (post_parent),
KEY post_author (post_author)
) $charset_collate;\n";
// Single site users table. The multisite flavor of the users table is handled below.
$users_single_table = "CREATE TABLE $wpdb->users (
ID bigint(20) unsigned NOT NULL auto_increment,
user_login varchar(60) NOT NULL default '',
user_pass varchar(255) NOT NULL default '',
user_nicename varchar(50) NOT NULL default '',
user_email varchar(100) NOT NULL default '',
user_url varchar(100) NOT NULL default '',
user_registered datetime NOT NULL default '0000-00-00 00:00:00',
user_activation_key varchar(255) NOT NULL default '',
user_status int(11) NOT NULL default '0',
display_name varchar(250) NOT NULL default '',
PRIMARY KEY (ID),
KEY user_login_key (user_login),
KEY user_nicename (user_nicename),
KEY user_email (user_email)
) $charset_collate;\n";
// Multisite users table.
$users_multi_table = "CREATE TABLE $wpdb->users (
ID bigint(20) unsigned NOT NULL auto_increment,
user_login varchar(60) NOT NULL default '',
user_pass varchar(255) NOT NULL default '',
user_nicename varchar(50) NOT NULL default '',
user_email varchar(100) NOT NULL default '',
user_url varchar(100) NOT NULL default '',
user_registered datetime NOT NULL default '0000-00-00 00:00:00',
user_activation_key varchar(255) NOT NULL default '',
user_status int(11) NOT NULL default '0',
display_name varchar(250) NOT NULL default '',
spam tinyint(2) NOT NULL default '0',
deleted tinyint(2) NOT NULL default '0',
PRIMARY KEY (ID),
KEY user_login_key (user_login),
KEY user_nicename (user_nicename),
KEY user_email (user_email)
) $charset_collate;\n";
// Usermeta.
$usermeta_table = "CREATE TABLE $wpdb->usermeta (
umeta_id bigint(20) unsigned NOT NULL auto_increment,
user_id bigint(20) unsigned NOT NULL default '0',
meta_key varchar(255) default NULL,
meta_value longtext,
PRIMARY KEY (umeta_id),
KEY user_id (user_id),
KEY meta_key (meta_key($max_index_length))
) $charset_collate;\n";
// Global tables.
if ( $is_multisite ) {
$global_tables = $users_multi_table . $usermeta_table;
} else {
$global_tables = $users_single_table . $usermeta_table;
}
// Multisite global tables.
$ms_global_tables = "CREATE TABLE $wpdb->blogs (
blog_id bigint(20) NOT NULL auto_increment,
site_id bigint(20) NOT NULL default '0',
domain varchar(200) NOT NULL default '',
path varchar(100) NOT NULL default '',
registered datetime NOT NULL default '0000-00-00 00:00:00',
last_updated datetime NOT NULL default '0000-00-00 00:00:00',
public tinyint(2) NOT NULL default '1',
archived tinyint(2) NOT NULL default '0',
mature tinyint(2) NOT NULL default '0',
spam tinyint(2) NOT NULL default '0',
deleted tinyint(2) NOT NULL default '0',
lang_id int(11) NOT NULL default '0',
PRIMARY KEY (blog_id),
KEY domain (domain(50),path(5)),
KEY lang_id (lang_id)
) $charset_collate;
CREATE TABLE $wpdb->blogmeta (
meta_id bigint(20) unsigned NOT NULL auto_increment,
blog_id bigint(20) NOT NULL default '0',
meta_key varchar(255) default NULL,
meta_value longtext,
PRIMARY KEY (meta_id),
KEY meta_key (meta_key($max_index_length)),
KEY blog_id (blog_id)
) $charset_collate;
CREATE TABLE $wpdb->registration_log (
ID bigint(20) NOT NULL auto_increment,
email varchar(255) NOT NULL default '',
IP varchar(30) NOT NULL default '',
blog_id bigint(20) NOT NULL default '0',
date_registered datetime NOT NULL default '0000-00-00 00:00:00',
PRIMARY KEY (ID),
KEY IP (IP)
) $charset_collate;
CREATE TABLE $wpdb->site (
id bigint(20) NOT NULL auto_increment,
domain varchar(200) NOT NULL default '',
path varchar(100) NOT NULL default '',
PRIMARY KEY (id),
KEY domain (domain(140),path(51))
) $charset_collate;
CREATE TABLE $wpdb->sitemeta (
meta_id bigint(20) NOT NULL auto_increment,
site_id bigint(20) NOT NULL default '0',
meta_key varchar(255) default NULL,
meta_value longtext,
PRIMARY KEY (meta_id),
KEY meta_key (meta_key($max_index_length)),
KEY site_id (site_id)
) $charset_collate;
CREATE TABLE $wpdb->signups (
signup_id bigint(20) NOT NULL auto_increment,
domain varchar(200) NOT NULL default '',
path varchar(100) NOT NULL default '',
title longtext NOT NULL,
user_login varchar(60) NOT NULL default '',
user_email varchar(100) NOT NULL default '',
registered datetime NOT NULL default '0000-00-00 00:00:00',
activated datetime NOT NULL default '0000-00-00 00:00:00',
active tinyint(1) NOT NULL default '0',
activation_key varchar(50) NOT NULL default '',
meta longtext,
PRIMARY KEY (signup_id),
KEY activation_key (activation_key),
KEY user_email (user_email),
KEY user_login_email (user_login,user_email),
KEY domain_path (domain(140),path(51))
) $charset_collate;";
switch ( $scope ) {
case 'blog':
$queries = $blog_tables;
break;
case 'global':
$queries = $global_tables;
if ( $is_multisite ) {
$queries .= $ms_global_tables;
}
break;
case 'ms_global':
$queries = $ms_global_tables;
break;
case 'all':
default:
$queries = $global_tables . $blog_tables;
if ( $is_multisite ) {
$queries .= $ms_global_tables;
}
break;
}
if ( isset( $old_blog_id ) ) {
$wpdb->set_blog_id( $old_blog_id );
}
return $queries;
}
// Populate for back compat.
$wp_queries = wp_get_db_schema( 'all' );
/**
* Create WordPress options and set the default values.
*
* @since 1.5.0
* @since 5.1.0 The $options parameter has been added.
*
* @global wpdb $wpdb WordPress database abstraction object.
* @global int $wp_db_version WordPress database version.
* @global int $wp_current_db_version The old (current) database version.
*
* @param array $options Optional. Custom option $key => $value pairs to use. Default empty array.
*/
function populate_options( array $options = array() ) {
global $wpdb, $wp_db_version, $wp_current_db_version;
$guessurl = wp_guess_url();
/**
* Fires before creating WordPress options and populating their default values.
*
* @since 2.6.0
*/
do_action( 'populate_options' );
// If WP_DEFAULT_THEME doesn't exist, fall back to the latest core default theme.
$stylesheet = WP_DEFAULT_THEME;
$template = WP_DEFAULT_THEME;
$theme = wp_get_theme( WP_DEFAULT_THEME );
if ( ! $theme->exists() ) {
$theme = WP_Theme::get_core_default_theme();
}
// If we can't find a core default theme, WP_DEFAULT_THEME is the best we can do.
if ( $theme ) {
$stylesheet = $theme->get_stylesheet();
$template = $theme->get_template();
}
$timezone_string = '';
$gmt_offset = 0;
/*
* translators: default GMT offset or timezone string. Must be either a valid offset (-12 to 14)
* or a valid timezone string (America/New_York). See https://www.php.net/manual/en/timezones.php
* for all timezone strings supported by PHP.
*/
$offset_or_tz = _x( '0', 'default GMT offset or timezone string' ); // phpcs:ignore WordPress.WP.I18n.NoEmptyStrings
if ( is_numeric( $offset_or_tz ) ) {
$gmt_offset = $offset_or_tz;
} elseif ( $offset_or_tz && in_array( $offset_or_tz, timezone_identifiers_list(), true ) ) {
$timezone_string = $offset_or_tz;
}
$defaults = array(
'siteurl' => $guessurl,
'home' => $guessurl,
'blogname' => __( 'My Site' ),
/* translators: Site tagline. */
'blogdescription' => __( 'Just another WordPress site' ),
'users_can_register' => 0,
'admin_email' => '[email protected]',
/* translators: Default start of the week. 0 = Sunday, 1 = Monday. */
'start_of_week' => _x( '1', 'start of week' ),
'use_balanceTags' => 0,
'use_smilies' => 1,
'require_name_email' => 1,
'comments_notify' => 1,
'posts_per_rss' => 10,
'rss_use_excerpt' => 0,
'mailserver_url' => 'mail.example.com',
'mailserver_login' => '[email protected]',
'mailserver_pass' => 'password',
'mailserver_port' => 110,
'default_category' => 1,
'default_comment_status' => 'open',
'default_ping_status' => 'open',
'default_pingback_flag' => 1,
'posts_per_page' => 10,
/* translators: Default date format, see https://www.php.net/manual/datetime.format.php */
'date_format' => __( 'F j, Y' ),
/* translators: Default time format, see https://www.php.net/manual/datetime.format.php */
'time_format' => __( 'g:i a' ),
/* translators: Links last updated date format, see https://www.php.net/manual/datetime.format.php */
'links_updated_date_format' => __( 'F j, Y g:i a' ),
'comment_moderation' => 0,
'moderation_notify' => 1,
'permalink_structure' => '',
'rewrite_rules' => '',
'hack_file' => 0,
'blog_charset' => 'UTF-8',
'moderation_keys' => '',
'active_plugins' => array(),
'category_base' => '',
'ping_sites' => 'http://rpc.pingomatic.com/',
'comment_max_links' => 2,
'gmt_offset' => $gmt_offset,
// 1.5.0
'default_email_category' => 1,
'recently_edited' => '',
'template' => $template,
'stylesheet' => $stylesheet,
'comment_registration' => 0,
'html_type' => 'text/html',
// 1.5.1
'use_trackback' => 0,
// 2.0.0
'default_role' => 'subscriber',
'db_version' => $wp_db_version,
// 2.0.1
'uploads_use_yearmonth_folders' => 1,
'upload_path' => '',
// 2.1.0
'blog_public' => '1',
'default_link_category' => 2,
'show_on_front' => 'posts',
// 2.2.0
'tag_base' => '',
// 2.5.0
'show_avatars' => '1',
'avatar_rating' => 'G',
'upload_url_path' => '',
'thumbnail_size_w' => 150,
'thumbnail_size_h' => 150,
'thumbnail_crop' => 1,
'medium_size_w' => 300,
'medium_size_h' => 300,
// 2.6.0
'avatar_default' => 'mystery',
// 2.7.0
'large_size_w' => 1024,
'large_size_h' => 1024,
'image_default_link_type' => 'none',
'image_default_size' => '',
'image_default_align' => '',
'close_comments_for_old_posts' => 0,
'close_comments_days_old' => 14,
'thread_comments' => 1,
'thread_comments_depth' => 5,
'page_comments' => 0,
'comments_per_page' => 50,
'default_comments_page' => 'newest',
'comment_order' => 'asc',
'sticky_posts' => array(),
'widget_categories' => array(),
'widget_text' => array(),
'widget_rss' => array(),
'uninstall_plugins' => array(),
// 2.8.0
'timezone_string' => $timezone_string,
// 3.0.0
'page_for_posts' => 0,
'page_on_front' => 0,
// 3.1.0
'default_post_format' => 0,
// 3.5.0
'link_manager_enabled' => 0,
// 4.3.0
'finished_splitting_shared_terms' => 1,
'site_icon' => 0,
// 4.4.0
'medium_large_size_w' => 768,
'medium_large_size_h' => 0,
// 4.9.6
'wp_page_for_privacy_policy' => 0,
// 4.9.8
'show_comments_cookies_opt_in' => 1,
// 5.3.0
'admin_email_lifespan' => ( time() + 6 * MONTH_IN_SECONDS ),
// 5.5.0
'disallowed_keys' => '',
'comment_previously_approved' => 1,
'auto_plugin_theme_update_emails' => array(),
);
// 3.3.0
if ( ! is_multisite() ) {
$defaults['initial_db_version'] = ! empty( $wp_current_db_version ) && $wp_current_db_version < $wp_db_version
? $wp_current_db_version : $wp_db_version;
}
// 3.0.0 multisite.
if ( is_multisite() ) {
/* translators: %s: Network title. */
$defaults['blogdescription'] = sprintf( __( 'Just another %s site' ), get_network()->site_name );
$defaults['permalink_structure'] = '/%year%/%monthnum%/%day%/%postname%/';
}
$options = wp_parse_args( $options, $defaults );
// Set autoload to no for these options.
$fat_options = array(
'moderation_keys',
'recently_edited',
'disallowed_keys',
'uninstall_plugins',
'auto_plugin_theme_update_emails',
);
$keys = "'" . implode( "', '", array_keys( $options ) ) . "'";
$existing_options = $wpdb->get_col( "SELECT option_name FROM $wpdb->options WHERE option_name in ( $keys )" ); // phpcs:ignore WordPress.DB.PreparedSQL.NotPrepared
$insert = '';
foreach ( $options as $option => $value ) {
if ( in_array( $option, $existing_options, true ) ) {
continue;
}
if ( in_array( $option, $fat_options, true ) ) {
$autoload = 'no';
} else {
$autoload = 'yes';
}
if ( is_array( $value ) ) {
$value = serialize( $value );
}
if ( ! empty( $insert ) ) {
$insert .= ', ';
}
$insert .= $wpdb->prepare( '(%s, %s, %s)', $option, $value, $autoload );
}
if ( ! empty( $insert ) ) {
$wpdb->query( "INSERT INTO $wpdb->options (option_name, option_value, autoload) VALUES " . $insert ); // phpcs:ignore WordPress.DB.PreparedSQL.NotPrepared
}
// In case it is set, but blank, update "home".
if ( ! __get_option( 'home' ) ) {
update_option( 'home', $guessurl );
}
// Delete unused options.
$unusedoptions = array(
'blodotgsping_url',
'bodyterminator',
'emailtestonly',
'phoneemail_separator',
'smilies_directory',
'subjectprefix',
'use_bbcode',
'use_blodotgsping',
'use_phoneemail',
'use_quicktags',
'use_weblogsping',
'weblogs_cache_file',
'use_preview',
'use_htmltrans',
'smilies_directory',
'fileupload_allowedusers',
'use_phoneemail',
'default_post_status',
'default_post_category',
'archive_mode',
'time_difference',
'links_minadminlevel',
'links_use_adminlevels',
'links_rating_type',
'links_rating_char',
'links_rating_ignore_zero',
'links_rating_single_image',
'links_rating_image0',
'links_rating_image1',
'links_rating_image2',
'links_rating_image3',
'links_rating_image4',
'links_rating_image5',
'links_rating_image6',
'links_rating_image7',
'links_rating_image8',
'links_rating_image9',
'links_recently_updated_time',
'links_recently_updated_prepend',
'links_recently_updated_append',
'weblogs_cacheminutes',
'comment_allowed_tags',
'search_engine_friendly_urls',
'default_geourl_lat',
'default_geourl_lon',
'use_default_geourl',
'weblogs_xml_url',
'new_users_can_blog',
'_wpnonce',
'_wp_http_referer',
'Update',
'action',
'rich_editing',
'autosave_interval',
'deactivated_plugins',
'can_compress_scripts',
'page_uris',
'update_core',
'update_plugins',
'update_themes',
'doing_cron',
'random_seed',
'rss_excerpt_length',
'secret',
'use_linksupdate',
'default_comment_status_page',
'wporg_popular_tags',
'what_to_show',
'rss_language',
'language',
'enable_xmlrpc',
'enable_app',
'embed_autourls',
'default_post_edit_rows',
'gzipcompression',
'advanced_edit',
);
foreach ( $unusedoptions as $option ) {
delete_option( $option );
}
// Delete obsolete magpie stuff.
$wpdb->query( "DELETE FROM $wpdb->options WHERE option_name REGEXP '^rss_[0-9a-f]{32}(_ts)?$'" );
// Clear expired transients.
delete_expired_transients( true );
}
/**
* Execute WordPress role creation for the various WordPress versions.
*
* @since 2.0.0
*/
function populate_roles() {
populate_roles_160();
populate_roles_210();
populate_roles_230();
populate_roles_250();
populate_roles_260();
populate_roles_270();
populate_roles_280();
populate_roles_300();
}
/**
* Create the roles for WordPress 2.0
*
* @since 2.0.0
*/
function populate_roles_160() {
// Add roles.
add_role( 'administrator', 'Administrator' );
add_role( 'editor', 'Editor' );
add_role( 'author', 'Author' );
add_role( 'contributor', 'Contributor' );
add_role( 'subscriber', 'Subscriber' );
// Add caps for Administrator role.
$role = get_role( 'administrator' );
$role->add_cap( 'switch_themes' );
$role->add_cap( 'edit_themes' );
$role->add_cap( 'activate_plugins' );
$role->add_cap( 'edit_plugins' );
$role->add_cap( 'edit_users' );
$role->add_cap( 'edit_files' );
$role->add_cap( 'manage_options' );
$role->add_cap( 'moderate_comments' );
$role->add_cap( 'manage_categories' );
$role->add_cap( 'manage_links' );
$role->add_cap( 'upload_files' );
$role->add_cap( 'import' );
$role->add_cap( 'unfiltered_html' );
$role->add_cap( 'edit_posts' );
$role->add_cap( 'edit_others_posts' );
$role->add_cap( 'edit_published_posts' );
$role->add_cap( 'publish_posts' );
$role->add_cap( 'edit_pages' );
$role->add_cap( 'read' );
$role->add_cap( 'level_10' );
$role->add_cap( 'level_9' );
$role->add_cap( 'level_8' );
$role->add_cap( 'level_7' );
$role->add_cap( 'level_6' );
$role->add_cap( 'level_5' );
$role->add_cap( 'level_4' );
$role->add_cap( 'level_3' );
$role->add_cap( 'level_2' );
$role->add_cap( 'level_1' );
$role->add_cap( 'level_0' );
// Add caps for Editor role.
$role = get_role( 'editor' );
$role->add_cap( 'moderate_comments' );
$role->add_cap( 'manage_categories' );
$role->add_cap( 'manage_links' );
$role->add_cap( 'upload_files' );
$role->add_cap( 'unfiltered_html' );
$role->add_cap( 'edit_posts' );
$role->add_cap( 'edit_others_posts' );
$role->add_cap( 'edit_published_posts' );
$role->add_cap( 'publish_posts' );
$role->add_cap( 'edit_pages' );
$role->add_cap( 'read' );
$role->add_cap( 'level_7' );
$role->add_cap( 'level_6' );
$role->add_cap( 'level_5' );
$role->add_cap( 'level_4' );
$role->add_cap( 'level_3' );
$role->add_cap( 'level_2' );
$role->add_cap( 'level_1' );
$role->add_cap( 'level_0' );
// Add caps for Author role.
$role = get_role( 'author' );
$role->add_cap( 'upload_files' );
$role->add_cap( 'edit_posts' );
$role->add_cap( 'edit_published_posts' );
$role->add_cap( 'publish_posts' );
$role->add_cap( 'read' );
$role->add_cap( 'level_2' );
$role->add_cap( 'level_1' );
$role->add_cap( 'level_0' );
// Add caps for Contributor role.
$role = get_role( 'contributor' );
$role->add_cap( 'edit_posts' );
$role->add_cap( 'read' );
$role->add_cap( 'level_1' );
$role->add_cap( 'level_0' );
// Add caps for Subscriber role.
$role = get_role( 'subscriber' );
$role->add_cap( 'read' );
$role->add_cap( 'level_0' );
}
/**
* Create and modify WordPress roles for WordPress 2.1.
*
* @since 2.1.0
*/
function populate_roles_210() {
$roles = array( 'administrator', 'editor' );
foreach ( $roles as $role ) {
$role = get_role( $role );
if ( empty( $role ) ) {
continue;
}
$role->add_cap( 'edit_others_pages' );
$role->add_cap( 'edit_published_pages' );
$role->add_cap( 'publish_pages' );
$role->add_cap( 'delete_pages' );
$role->add_cap( 'delete_others_pages' );
$role->add_cap( 'delete_published_pages' );
$role->add_cap( 'delete_posts' );
$role->add_cap( 'delete_others_posts' );
$role->add_cap( 'delete_published_posts' );
$role->add_cap( 'delete_private_posts' );
$role->add_cap( 'edit_private_posts' );
$role->add_cap( 'read_private_posts' );
$role->add_cap( 'delete_private_pages' );
$role->add_cap( 'edit_private_pages' );
$role->add_cap( 'read_private_pages' );
}
$role = get_role( 'administrator' );
if ( ! empty( $role ) ) {
$role->add_cap( 'delete_users' );
$role->add_cap( 'create_users' );
}
$role = get_role( 'author' );
if ( ! empty( $role ) ) {
$role->add_cap( 'delete_posts' );
$role->add_cap( 'delete_published_posts' );
}
$role = get_role( 'contributor' );
if ( ! empty( $role ) ) {
$role->add_cap( 'delete_posts' );
}
}
/**
* Create and modify WordPress roles for WordPress 2.3.
*
* @since 2.3.0
*/
function populate_roles_230() {
$role = get_role( 'administrator' );
if ( ! empty( $role ) ) {
$role->add_cap( 'unfiltered_upload' );
}
}
/**
* Create and modify WordPress roles for WordPress 2.5.
*
* @since 2.5.0
*/
function populate_roles_250() {
$role = get_role( 'administrator' );
if ( ! empty( $role ) ) {
$role->add_cap( 'edit_dashboard' );
}
}
/**
* Create and modify WordPress roles for WordPress 2.6.
*
* @since 2.6.0
*/
function populate_roles_260() {
$role = get_role( 'administrator' );
if ( ! empty( $role ) ) {
$role->add_cap( 'update_plugins' );
$role->add_cap( 'delete_plugins' );
}
}
/**
* Create and modify WordPress roles for WordPress 2.7.
*
* @since 2.7.0
*/
function populate_roles_270() {
$role = get_role( 'administrator' );
if ( ! empty( $role ) ) {
$role->add_cap( 'install_plugins' );
$role->add_cap( 'update_themes' );
}
}
/**
* Create and modify WordPress roles for WordPress 2.8.
*
* @since 2.8.0
*/
function populate_roles_280() {
$role = get_role( 'administrator' );
if ( ! empty( $role ) ) {
$role->add_cap( 'install_themes' );
}
}
/**
* Create and modify WordPress roles for WordPress 3.0.
*
* @since 3.0.0
*/
function populate_roles_300() {
$role = get_role( 'administrator' );
if ( ! empty( $role ) ) {
$role->add_cap( 'update_core' );
$role->add_cap( 'list_users' );
$role->add_cap( 'remove_users' );
$role->add_cap( 'promote_users' );
$role->add_cap( 'edit_theme_options' );
$role->add_cap( 'delete_themes' );
$role->add_cap( 'export' );
}
}
if ( ! function_exists( 'install_network' ) ) :
/**
* Install Network.
*
* @since 3.0.0
*/
function install_network() {
if ( ! defined( 'WP_INSTALLING_NETWORK' ) ) {
define( 'WP_INSTALLING_NETWORK', true );
}
dbDelta( wp_get_db_schema( 'global' ) );
}
endif;
/**
* Populate network settings.
*
* @since 3.0.0
*
* @global wpdb $wpdb WordPress database abstraction object.
* @global object $current_site
* @global WP_Rewrite $wp_rewrite WordPress rewrite component.
*
* @param int $network_id ID of network to populate.
* @param string $domain The domain name for the network (eg. "example.com").
* @param string $email Email address for the network administrator.
* @param string $site_name The name of the network.
* @param string $path Optional. The path to append to the network's domain name. Default '/'.
* @param bool $subdomain_install Optional. Whether the network is a subdomain installation or a subdirectory installation.
* Default false, meaning the network is a subdirectory installation.
* @return bool|WP_Error True on success, or WP_Error on warning (with the installation otherwise successful,
* so the error code must be checked) or failure.
*/
function populate_network( $network_id = 1, $domain = '', $email = '', $site_name = '', $path = '/', $subdomain_install = false ) {
global $wpdb, $current_site, $wp_rewrite;
$errors = new WP_Error();
if ( '' === $domain ) {
$errors->add( 'empty_domain', __( 'You must provide a domain name.' ) );
}
if ( '' === $site_name ) {
$errors->add( 'empty_sitename', __( 'You must provide a name for your network of sites.' ) );
}
// Check for network collision.
$network_exists = false;
if ( is_multisite() ) {
if ( get_network( (int) $network_id ) ) {
$errors->add( 'siteid_exists', __( 'The network already exists.' ) );
}
} else {
if ( $network_id == $wpdb->get_var( $wpdb->prepare( "SELECT id FROM $wpdb->site WHERE id = %d", $network_id ) ) ) {
$errors->add( 'siteid_exists', __( 'The network already exists.' ) );
}
}
if ( ! is_email( $email ) ) {
$errors->add( 'invalid_email', __( 'You must provide a valid email address.' ) );
}
if ( $errors->has_errors() ) {
return $errors;
}
if ( 1 == $network_id ) {
$wpdb->insert(
$wpdb->site,
array(
'domain' => $domain,
'path' => $path,
)
);
$network_id = $wpdb->insert_id;
} else {
$wpdb->insert(
$wpdb->site,
array(
'domain' => $domain,
'path' => $path,
'id' => $network_id,
)
);
}
populate_network_meta(
$network_id,
array(
'admin_email' => $email,
'site_name' => $site_name,
'subdomain_install' => $subdomain_install,
)
);
$site_user = get_userdata( (int) $wpdb->get_var( $wpdb->prepare( "SELECT meta_value FROM $wpdb->sitemeta WHERE meta_key = %s AND site_id = %d", 'admin_user_id', $network_id ) ) );
/*
* When upgrading from single to multisite, assume the current site will
* become the main site of the network. When using populate_network()
* to create another network in an existing multisite environment, skip
* these steps since the main site of the new network has not yet been
* created.
*/
if ( ! is_multisite() ) {
$current_site = new stdClass;
$current_site->domain = $domain;
$current_site->path = $path;
$current_site->site_name = ucfirst( $domain );
$wpdb->insert(
$wpdb->blogs,
array(
'site_id' => $network_id,
'blog_id' => 1,
'domain' => $domain,
'path' => $path,
'registered' => current_time( 'mysql' ),
)
);
$current_site->blog_id = $wpdb->insert_id;
update_user_meta( $site_user->ID, 'source_domain', $domain );
update_user_meta( $site_user->ID, 'primary_blog', $current_site->blog_id );
if ( $subdomain_install ) {
$wp_rewrite->set_permalink_structure( '/%year%/%monthnum%/%day%/%postname%/' );
} else {
$wp_rewrite->set_permalink_structure( '/blog/%year%/%monthnum%/%day%/%postname%/' );
}
flush_rewrite_rules();
if ( ! $subdomain_install ) {
return true;
}
$vhost_ok = false;
$errstr = '';
$hostname = substr( md5( time() ), 0, 6 ) . '.' . $domain; // Very random hostname!
$page = wp_remote_get(
'http://' . $hostname,
array(
'timeout' => 5,
'httpversion' => '1.1',
)
);
if ( is_wp_error( $page ) ) {
$errstr = $page->get_error_message();
} elseif ( 200 == wp_remote_retrieve_response_code( $page ) ) {
$vhost_ok = true;
}
if ( ! $vhost_ok ) {
$msg = '<p><strong>' . __( 'Warning! Wildcard DNS may not be configured correctly!' ) . '</strong></p>';
$msg .= '<p>' . sprintf(
/* translators: %s: Host name. */
__( 'The installer attempted to contact a random hostname (%s) on your domain.' ),
'<code>' . $hostname . '</code>'
);
if ( ! empty( $errstr ) ) {
/* translators: %s: Error message. */
$msg .= ' ' . sprintf( __( 'This resulted in an error message: %s' ), '<code>' . $errstr . '</code>' );
}
$msg .= '</p>';
$msg .= '<p>' . sprintf(
/* translators: %s: Asterisk symbol (*). */
__( 'To use a subdomain configuration, you must have a wildcard entry in your DNS. This usually means adding a %s hostname record pointing at your web server in your DNS configuration tool.' ),
'<code>*</code>'
) . '</p>';
$msg .= '<p>' . __( 'You can still use your site but any subdomain you create may not be accessible. If you know your DNS is correct, ignore this message.' ) . '</p>';
return new WP_Error( 'no_wildcard_dns', $msg );
}
}
return true;
}
/**
* Creates WordPress network meta and sets the default values.
*
* @since 5.1.0
*
* @global wpdb $wpdb WordPress database abstraction object.
* @global int $wp_db_version WordPress database version.
*
* @param int $network_id Network ID to populate meta for.
* @param array $meta Optional. Custom meta $key => $value pairs to use. Default empty array.
*/
function populate_network_meta( $network_id, array $meta = array() ) {
global $wpdb, $wp_db_version;
$network_id = (int) $network_id;
$email = ! empty( $meta['admin_email'] ) ? $meta['admin_email'] : '';
$subdomain_install = isset( $meta['subdomain_install'] ) ? (int) $meta['subdomain_install'] : 0;
// If a user with the provided email does not exist, default to the current user as the new network admin.
$site_user = ! empty( $email ) ? get_user_by( 'email', $email ) : false;
if ( false === $site_user ) {
$site_user = wp_get_current_user();
}
if ( empty( $email ) ) {
$email = $site_user->user_email;
}
$template = get_option( 'template' );
$stylesheet = get_option( 'stylesheet' );
$allowed_themes = array( $stylesheet => true );
if ( $template != $stylesheet ) {
$allowed_themes[ $template ] = true;
}
if ( WP_DEFAULT_THEME != $stylesheet && WP_DEFAULT_THEME != $template ) {
$allowed_themes[ WP_DEFAULT_THEME ] = true;
}
// If WP_DEFAULT_THEME doesn't exist, also include the latest core default theme.
if ( ! wp_get_theme( WP_DEFAULT_THEME )->exists() ) {
$core_default = WP_Theme::get_core_default_theme();
if ( $core_default ) {
$allowed_themes[ $core_default->get_stylesheet() ] = true;
}
}
if ( function_exists( 'clean_network_cache' ) ) {
clean_network_cache( $network_id );
} else {
wp_cache_delete( $network_id, 'networks' );
}
wp_cache_delete( 'networks_have_paths', 'site-options' );
if ( ! is_multisite() ) {
$site_admins = array( $site_user->user_login );
$users = get_users(
array(
'fields' => array( 'user_login' ),
'role' => 'administrator',
)
);
if ( $users ) {
foreach ( $users as $user ) {
$site_admins[] = $user->user_login;
}
$site_admins = array_unique( $site_admins );
}
} else {
$site_admins = get_site_option( 'site_admins' );
}
/* translators: Do not translate USERNAME, SITE_NAME, BLOG_URL, PASSWORD: those are placeholders. */
$welcome_email = __(
'Howdy USERNAME,
Your new SITE_NAME site has been successfully set up at:
BLOG_URL
You can log in to the administrator account with the following information:
Username: USERNAME
Password: PASSWORD
Log in here: BLOG_URLwp-login.php
We hope you enjoy your new site. Thanks!
--The Team @ SITE_NAME'
);
$misc_exts = array(
// Images.
'jpg',
'jpeg',
'png',
'gif',
// Video.
'mov',
'avi',
'mpg',
'3gp',
'3g2',
// "audio".
'midi',
'mid',
// Miscellaneous.
'pdf',
'doc',
'ppt',
'odt',
'pptx',
'docx',
'pps',
'ppsx',
'xls',
'xlsx',
'key',
);
$audio_exts = wp_get_audio_extensions();
$video_exts = wp_get_video_extensions();
$upload_filetypes = array_unique( array_merge( $misc_exts, $audio_exts, $video_exts ) );
$sitemeta = array(
'site_name' => __( 'My Network' ),
'admin_email' => $email,
'admin_user_id' => $site_user->ID,
'registration' => 'none',
'upload_filetypes' => implode( ' ', $upload_filetypes ),
'blog_upload_space' => 100,
'fileupload_maxk' => 1500,
'site_admins' => $site_admins,
'allowedthemes' => $allowed_themes,
'illegal_names' => array( 'www', 'web', 'root', 'admin', 'main', 'invite', 'administrator', 'files' ),
'wpmu_upgrade_site' => $wp_db_version,
'welcome_email' => $welcome_email,
/* translators: %s: Site link. */
'first_post' => __( 'Welcome to %s. This is your first post. Edit or delete it, then start writing!' ),
// @todo - Network admins should have a method of editing the network siteurl (used for cookie hash).
'siteurl' => get_option( 'siteurl' ) . '/',
'add_new_users' => '0',
'upload_space_check_disabled' => is_multisite() ? get_site_option( 'upload_space_check_disabled' ) : '1',
'subdomain_install' => $subdomain_install,
'global_terms_enabled' => global_terms_enabled() ? '1' : '0',
'ms_files_rewriting' => is_multisite() ? get_site_option( 'ms_files_rewriting' ) : '0',
'initial_db_version' => get_option( 'initial_db_version' ),
'active_sitewide_plugins' => array(),
'WPLANG' => get_locale(),
);
if ( ! $subdomain_install ) {
$sitemeta['illegal_names'][] = 'blog';
}
$sitemeta = wp_parse_args( $meta, $sitemeta );
/**
* Filters meta for a network on creation.
*
* @since 3.7.0
*
* @param array $sitemeta Associative array of network meta keys and values to be inserted.
* @param int $network_id ID of network to populate.
*/
$sitemeta = apply_filters( 'populate_network_meta', $sitemeta, $network_id );
$insert = '';
foreach ( $sitemeta as $meta_key => $meta_value ) {
if ( is_array( $meta_value ) ) {
$meta_value = serialize( $meta_value );
}
if ( ! empty( $insert ) ) {
$insert .= ', ';
}
$insert .= $wpdb->prepare( '( %d, %s, %s)', $network_id, $meta_key, $meta_value );
}
$wpdb->query( "INSERT INTO $wpdb->sitemeta ( site_id, meta_key, meta_value ) VALUES " . $insert ); // phpcs:ignore WordPress.DB.PreparedSQL.NotPrepared
}
/**
* Creates WordPress site meta and sets the default values.
*
* @since 5.1.0
*
* @global wpdb $wpdb WordPress database abstraction object.
*
* @param int $site_id Site ID to populate meta for.
* @param array $meta Optional. Custom meta $key => $value pairs to use. Default empty array.
*/
function populate_site_meta( $site_id, array $meta = array() ) {
global $wpdb;
$site_id = (int) $site_id;
if ( ! is_site_meta_supported() ) {
return;
}
if ( empty( $meta ) ) {
return;
}
/**
* Filters meta for a site on creation.
*
* @since 5.2.0
*
* @param array $meta Associative array of site meta keys and values to be inserted.
* @param int $site_id ID of site to populate.
*/
$site_meta = apply_filters( 'populate_site_meta', $meta, $site_id );
$insert = '';
foreach ( $site_meta as $meta_key => $meta_value ) {
if ( is_array( $meta_value ) ) {
$meta_value = serialize( $meta_value );
}
if ( ! empty( $insert ) ) {
$insert .= ', ';
}
$insert .= $wpdb->prepare( '( %d, %s, %s)', $site_id, $meta_key, $meta_value );
}
$wpdb->query( "INSERT INTO $wpdb->blogmeta ( blog_id, meta_key, meta_value ) VALUES " . $insert ); // phpcs:ignore WordPress.DB.PreparedSQL.NotPrepared
wp_cache_delete( $site_id, 'blog_meta' );
wp_cache_set_sites_last_changed();
}
| {
"pile_set_name": "Github"
} |
The relationship between exercise-induced muscle fatigue, arterial blood flow and muscle perfusion after 56 days local muscle unloading.
In the light of the dynamic nature of habitual plantar flexor activity, we utilized an incremental isokinetic exercise test (IIET) to assess the work-related power deficit (WoRPD) as a measure for exercise-induced muscle fatigue before and after prolonged calf muscle unloading and in relation to arterial blood flow and muscle perfusion. Eleven male subjects (31 ± 6 years) wore the HEPHAISTOS unloading orthosis unilaterally for 56 days. It allows habitual ambulation while greatly reducing plantar flexor activity and torque production. Endpoint measurements encompassed arterial blood flow, measured in the femoral artery using Doppler ultrasound, oxygenation of the soleus muscle assessed by near-infrared spectroscopy, lactate concentrations determined in capillary blood and muscle activity using soleus muscle surface electromyography. Furthermore, soleus muscle biopsies were taken to investigate morphological muscle changes. After the intervention, maximal isokinetic torque was reduced by 23·4 ± 8·2% (P<0·001) and soleus fibre size was reduced by 8·5 ± 13% (P = 0·016). However, WoRPD remained unaffected as indicated by an unchanged loss of relative plantar flexor power between pre- and postexperiments (P = 0·88). Blood flow, tissue oxygenation, lactate concentrations and EMG median frequency kinematics during the exercise test were comparable before and after the intervention, whereas the increase of RMS in response to IIET was less following the intervention (P = 0·03). In conclusion, following submaximal isokinetic muscle work exercise-induced muscle fatigue is unaffected after prolonged local muscle unloading. The observation that arterial blood flow was maintained may underlie the unchanged fatigability. | {
"pile_set_name": "PubMed Abstracts"
} |
Choosing a Generator – Gas vs. Diesel and More.
Best Generators – A Guide
As I am looking for a generator I found this helpful guide. Some really great info on the diesel ones. Both the Omaha and Sioux Falls AMSOIL stores get customers sent in from Northern and other shops for the best motor oil for their newly purchased generators. Some use our 0W-30 Signature Series and others prefer our commercial grade small engine 10W-30. (good for diesel too). So the frequency of this got me thinking I should have a generator too.
The Sioux Falls store has a lot of brown outs due to a power grid which goes out often when a pole get’s hit around here. I’ve also got a ham radio hobby and sometimes have to work remotely on other projects. But having a generator for stand-by emergencies is a nice option to have.
I think a lot of these substandard generators, especially the 2-cycle ones were not built to last. Customers know that maintenance is everything and the AMSOIL products especially the Saber Pro 2-cycle will indeed double their life and even improve performance.
Nanofiber Cold Air Intake Filters – Replace that Oiled one The famous replacement mass air intake filters should not be overlooked! Media developed for the military unparalleled by the market! “One of my favorite AMSOIL products because it once again adds a... | {
"pile_set_name": "Pile-CC"
} |
Electrical and biochemical properties of an enzyme model of the sodium pump.
The electrochemical properties of a widely accepted six-step reaction scheme for the Na+, K+-ATPase have been studied by computer simulation. Rate coefficients were chosen to fit the nonvectorial biochemical data for the isolated enzyme and a current-voltage (I-V) relation consistent with physiological observations was obtained with voltage dependence restricted to one (but not both) of the two translocational steps. The vectorial properties resulting from these choices were consistent with physiological activation of the electrogenic sodium pump by intracellular and extracellular sodium (Na+) and potassium (K+) ions. The model exhibited K+/K+ exchange but little Na+/Na+ exchange unless the energy available from the splitting of adenosine triphosphate (ATP) was reduced, mimicking the behavior seen in squid giant axon. The vectorial ionic activation curves were voltage dependent, resulting in large shifts in apparent Km's with depolarization. At potentials more negative than the equilibrium or reversal potential transport was greatly diminished unless the free energy of ATP splitting was reduced. While the pump reversal potential is at least 100 mV hyperpolarized relative to the resting potential of most cells, the voltage-dependent distribution of intermediate forms of the enzyme allows the possibility of considerable slope conductance of the pump I-V relation in the physiological range of membrane potentials. Some of the vectorial properties of an electrogenic sodium pump appear to be inescapable consequences of the nonvectorial properties of the isolated enzyme. Future application of this approach should allow rigorous quantitative testing of interpretative ideas concerning the mechanism and stoichiometry of the sodium pump. | {
"pile_set_name": "PubMed Abstracts"
} |
Main navigation
Author “Tuesday” – Sharon Hodde Miller (Free of Me)
I don’t know about you, but sometimes I need the reminder that life is not all about me. Even in the midst of the holiday season, when we try our hardest to give generously and lean into a slow and sacred waiting, I can still find ways to ensure the world spins in my favor. If this sounds like you, I think you’ll LOVE Sharon Hodde Miller’s new book, Free of Me. Check out this interview with her and leave a comment at the end to win a copy of the book. Enjoy!
—
—
Tell us a bit about yourself, will you? I am a Southerner–North Carolinian, born and bred!–and I earned both my undergraduate and M.Div. degrees at Duke. I’ve spent the last 15 years in some form of ministry, writing, and speaking, in addition to getting my PhD on women and calling. My husband is a pastor, and we have two little boys with a baby girl on the way (!!!!!).
I feel an especially strong pull toward writing, and I have been blogging at SheWorships.com for about 10 years now. I have also had the honor of contributing to places like Her.meneutics, Christianity Today, She Reads Truth, Relevant, and Propel. I have a particular heart for women in the church, and one of my favorite challenges is taking the deep things of God and making them accessible to the average follower of Christ. Nearly everything I write gets run through that filter.
Let’s talk about your book: what, in a nutshell, is your book about anyway? Free of Me is, very simply, about self-forgetfulness. It’s about the freedom of focusing on God and others, instead of yourself. It looks at the different areas of our lives that we are tempted to make “about us”–family, calling, possessions, faith–and it examines the consequences of this misplaced focus.
Do tell, what was the inspiration behind it? Several years ago, I was wrestling with some of my own insecurities–specifically, my need to be seen and affirmed in my work–but all the traditional “remedies” for insecurity weren’t helping. I knew God loved me and created me for a purpose. I understood my identity in Christ, and I believed it. And yet it wasn’t freeing me the way I thought it should.
Over time I came to the realization that insecurity has two causes. The first gets the most attention: low self-esteem. Low self-esteem is an inability to see yourself the way God sees you, and the gospel has an answer for it. We respond to the lies and wounds of low self-esteem with truth and affirmation from God’s Word.
However, there is a second cause of insecurity that we almost never address, which is self-preoccupation. Self-preoccupation raises the stakes on everything in your life, by making it all a referendum on your worth. It is the brokenness of making things about you that are not about you, and that was my problem. I didn’t need higher self-esteem; I needed to focus on myself less. Once I pinpointed that issue, and began the work of dealing with it, it changed everything for me.
How do you hope readers will be changed by your words? I hope my book will accomplish two things. First, I hope it will name a struggle that many of us have misdiagnosed. For many of us, our struggle is not simply low self-esteem, but self-preoccupation, and all the positive self-talk in the world can’t help it. So it’s important to know the difference.
Second, I hope readers will experience a new level of freedom and purpose in their lives. When we turn the gospel into little more than a self-help project, we take a lot of the power out of our faith. I want to help restore readers to a more Christ-centered vision for their lives, by inviting them into a bigger story that is not, fundamentally, about them.
Lest we forget to ask, how have YOU been changed by writing the book? The beauty of this message is that it prepared me for the writing and publishing process. Authoring a book, and then releasing it into the world, is a risky thing to do. It’s easy for your identity to get entangled in the successes or failures of that journey. Thankfully, this book equipped me with the tools to receive it all in a spiritually healthy way. I truly do believe that my work is not about me, but for the love of God and others, and that conviction is both a freedom and a protection of sorts.
Yup, she’s the real deal, friends! Leave a comment here or on the Instagram post to win a copy of Free of Me. What about this interview with Sharon make you excited to grab a copy of her book? What intrigues you? Contest ends Monday, November 27th. Good luck! | {
"pile_set_name": "Pile-CC"
} |
// Copyright 2017 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// Functions to access/create device major and minor numbers matching the
// encoding used in Darwin's sys/types.h header.
package unix
// Major returns the major component of a Darwin device number.
func Major(dev uint64) uint32 {
return uint32((dev >> 24) & 0xff)
}
// Minor returns the minor component of a Darwin device number.
func Minor(dev uint64) uint32 {
return uint32(dev & 0xffffff)
}
// Mkdev returns a Darwin device number generated from the given major and minor
// components.
func Mkdev(major, minor uint32) uint64 {
return (uint64(major) << 24) | uint64(minor)
}
| {
"pile_set_name": "Github"
} |
Trait anxiety and probabilistic learning: Behavioral and electrophysiological findings.
Anxiety is a negative emotion that affects various aspects of people's daily life. To explain why individuals with high anxiety tend to make suboptimal decisions, we suggest that their learning ability might play an important role. Regarding that anxiety modulates both outcome expectation and attention allocation, it is reasonable to hypothesize that the function of feedback learning should be sensitive to individual level of anxiety. However, previous studies that directly examined this hypothesis were scarce. In this study, forty-two Chinese participants were assigned to a high-trait anxiety (HTA) group or a low-trait anxiety (LTA) group according to their scores in the Trait form of Spielberger's State-Trait Anxiety Inventory (STAI-T). Both groups finished a reward learning task in which two options were associated with different winning probabilities. The event-related potential (ERP) elicited by outcome feedback during the task was recorded and analyzed. Behavioral results revealed that, when the winning probability was 80% for one option and 20% for another, the HTA group chose the 80% winning option less often than the LTA group at the initial stage (i.e., first 20 trials) of the task, but there was no between-group difference in total number of choice. In addition, HTA participants took more time to make decisions in the 80/20 condition than in the 50/50 condition, but this effect was insignificant in the LTA group. ERP results indicated that anxiety affects learning in two ways. First, compared to their LTA counterparts, HTA participants showed a smaller feedback-related negativity (FRN) in response to negative feedback, indicating the impact of anxiety on outcome expectation. Second, HTA participants showed a larger P3 component in the 80/20 condition than in the 50/50 condition, indicating the impact of anxiety on attention allocation. Accordingly, we suggest that individuals' ability of feedback learning could be negatively modulated by anxiety. | {
"pile_set_name": "PubMed Abstracts"
} |
Q:
Car AC sometime cold sometimes not
Recently I have noticed that the air from ac vents sometimes cold, but sometime less cool/fan mode for a while, before return to cold.
I also noticed almost continuous "hissing" sound from around the place where cabin filter is located.
I checked the low pressure when AC is on max, it shows 32 PSI on ambient temp of 33C (91F) at 48% humidity. Refrigerant is R134a.
I have visited repair shop once, and they suspect the selenoid valve in ac compressor gets dirty, so they cleaned it. But I could feel the problem persist, but it does feel better, (the "fan mode" get shorter). They said, the clutch is engaging when its not cold, so its not a clutch or belt issue.
I wonder if is it caused by not enough refrigerant?
Note : When AC is off, the low pressure is 80 PSI.
Thanks!
A:
I would suggest few areas to inspect. When you notice no cold air from the vent outlets, go and check the A/C tubing under the hood. At least some of them must be freezing cold.
Depending on the A/C system type, you might or might not have an orifice valve inside one of the A/C tubes - this will make one part of the tube hot and the other part freezing cold.
You can have the refrigerant amount checked by A/C shop - let them suck everything out and refill it back and watch for the difference in amounts. It will cost you few bucks for the job and for some of the refrigerant as not everything can be recovered from the system. If you suspect leak, let the system be tested for leaks. Be aware though, that the vacuum test done by A/C machine doesn't necessarily find a leak unless it's big enough. Best if they have some sort of leak detectors.
| {
"pile_set_name": "StackExchange"
} |
``odd``
=======
``odd`` returns ``true`` if the given number is odd:
.. code-block:: twig
{{ var is odd }}
.. seealso:: :doc:`even<../tests/even>`
| {
"pile_set_name": "Github"
} |