text
stringlengths
3
1.04M
BB Crafts is a one-stop solution for all your decorative requirements. However, you can get all kind of ribbons from our online store at reasonable and wholesale prices. Faux Burlap reflected as the best alternative fabric for Burlap. And also it shows the signs of original burlap in rustic look and fuzzy texture that includes its stylish, natural appearance. As we are ribbon supply store so just have a look at our products, you will be amazed at our supplier's collection. Our faux burlap plaid and dot ribbons fabric are flexible and robust that can easily use for decoration your wedding bridal goods, invitation card, cake, and gifts. It is available in various colors such as Pastel Multi Color, Black, and Light Pink and much more. When you use these ribbons for your craft propose, it gives an elegant appearance to your work. Attempt our online store once and saves on all your art supplies, florist supplies, and Christmas décor. You will be surely come to know that why BB Crafts has become one of the largest suppliers of all things Creative.
When standardized health care answers do not solve problems, it takes creative, innovative responses to be successful. Innovative Health Care is a company dedicated to finding and developing these types of solutions. Based on a clinical, evidence-based approach to problem-solving, Innovative Health Care is unique in its success story. Stuart J. Yoffe, M.D. has been involved with jail medical care for over twelve years. He has established health care programs in the following county jails: Washington, Waller, Burleson and Milam. At each jail, one major goal was to integrate the health care service team with the jail security staff. He has achieved this by an educational program and by reinforcing the benefits to each department . “What Jail Staff Needs to Know about the Jail Medical System” is a compilation of lectures provided by Dr. Yoffe along with responses to commonly posed questions about specific medical conditions from the Security Staff. Stuart J. Yoffe, M.D., F.A.A.P. Speaker at Sheriff’s Association Meeting 2009. Dr. Yoffe is a board certified pediatrician with specialty training in allergy and immunology, who thirty years ago worked with nurse practitioners, physician assistants and who had in his office an audiologist, speech pathologist, part-time nutritionist and part- time psychologist. This was in the 1970s and 1980s. Innovative is not a new word to him. Recipient of one of five national Education Certificates from the American Academy of Pediatrics in 2010. Georgia LaPointe Yoffe is an educator. With a Master’s Degree in English, she has served as a school teacher and administrator. Her specific interest is high risk children. Based on a wealth of experience, her well-conceived project of a teen parenting program serves as a model for successful development of young parents through education and direction. "What County Jail Staff Needs to Know about the Jail Medical Care System--Basic Course" "What County Jail Staff Needs to Know about the Jail Medical Care System--An Advanced Course" "What County Jail Staff Needs to Know about the Psychiatric Care System." Without beating around the bush, if you are spending an inordinate amount of money on the health care for your inmates or you do not feel you are getting your money’s worth, then Stuart J. Yoffe, M.D. is available for short or long term consultations to modify your system. Fees are determined by what the individual jail wishes to accomplish and by the length of time needed to accomplish the task. The first nine years as Medical Director for the Washington County Jail, Dr. Yoffe saved the county over $1,000,000 increasing the efficiency of health care in the system. Although specific numbers are not available, health care costs have been considerably reduced in Milam, Burleson and Waller County Jail Programs also. "I can say that Dr. Yoffe has been very effective as a consultant with his recommendations and their implementation. In the past 16 months, HCJ has considerably increased its ability to control expenditures. I can strongly recommend Dr. Yoffe as a consultant in the field of County Jail Medicine." To provide educationally appropriate medical information to correctional staff to improve general medical knowledge. To create a more confident correctional staff member when required to deal with inmate medical problems. To promote better sense of joint purpose between correctional staff and medical staff. To supply educationally appropriate level of medical information to correctional staff so that communication between the two teams is at the highest level. All courses will be automatically graded and the results will be sent to the individual jail purchasing the course and the participant for accreditation purposes. This is why sign in information is so important to us. If you wish to take this course personally or for your staff, you will be asked to provide a credit card number for payment, the name of the organization, the state and county in which it is located, the number of participants wishing to take the course and the email of the participant and organization (its representative) for grade presentation. You will be asked to supply the mailing address of the organization for certificate presentation. Once payment is provided via credit card (Visa,Mastercard), you will be issued a code for each participant and that code will be good for a two- year period during which time the test can be accessed. At the end of the two-year period or when question #120 is answered, the score will be provided to both the participant and the organization (its representative). Link to sign up for this course. There is a pre-test before each section of information. The pre-tests are not scored, but instead they are guides to what information is considered valuable. Every individual will automatically receive a grade of P or U on their pre-test, but that grade does not count. The post-tests are scored and a score sheet will be provided to you/your jail after all the tests are finished. Your tests will be scored at the end of each lesson. Read the information carefully, but because this is an open-book program, you will be allowed to use the educational information while taking the test. Test Explanation continued... Your tests will be scored at the end of each section. 70% or more correctly answered is Pass. Read the information carefully, but this is an open-book program, and so you will be allowed to use the educational information while taking the test. You can have access to your test results only when you finish the entire program. You will not be allowed to return to the educational information once you finish the 10th test (question #100). 61 pages chocked full of information for nurses, medical assistants and even jail physicians. Every jail should have this book as a reference. If desiring to purchase this booklet, email your order to [email protected] or call 979 277 2094.
<?php namespace BlogBundle\Form; use Symfony\Component\Form\AbstractType; use Symfony\Component\Form\FormBuilderInterface; use Symfony\Component\OptionsResolver\OptionsResolver; class Profiltype extends AbstractType{ public function buildForm(FormBuilderInterface $builder, array $options){ $builder->add('themes'); } public function configureOptions(OptionsResolver $resolver) { $resolver->setDefaults(array( 'data_class' => 'BlogBundle\Entity\User' )); } } /** * Created by PhpStorm. * User: pierrelardy * Date: 11/06/2017 * Time: 18:31 */
def extractHappyfloofBlogspotCom(item): ''' Parser for 'happyfloof.blogspot.com' ''' vol, chp, frag, postfix = extractVolChapterFragmentPostfix(item['title']) if not (chp or vol) or "preview" in item['title'].lower(): return None tagmap = [ ('HILSBO', 'Hero? I\'ve Long Stopped Being One', 'translated'), ('PRC', 'PRC', 'translated'), ('Loiterous', 'Loiterous', 'oel'), ] for tagname, name, tl_type in tagmap: if tagname in item['tags']: return buildReleaseMessageWithType(item, name, vol, chp, frag=frag, postfix=postfix, tl_type=tl_type) return False
/*************************************************************************** * * * This program is free software; you can redistribute it and/or modify * * it under the terms of the GNU General Public License as published by * * the Free Software Foundation; either version 2 of the License, or * * (at your option) any later version. * * * ***************************************************************************/ /* * GameCube/Wii Port by Infact <infact quantentunnel de> 2012 */ //------------------------------------------------------------------------------ // Sound Driver wrapper (Source File) //------------------------------------------------------------------------------ #include <stdlib.h> #include <stdio.h> #include <string.h> #include <gccore.h> #include <aesndlib.h> #include <gcmodplay.h> #include "sound.h" #include "audiodrv.h" // generated mod .h files #include "title_mod.h" #include "boss_mod.h" #include "tune1_mod.h" #include "tune2_mod.h" #include "complete_mod.h" #include "empty_mod.h" // generated pcm .h files #include "blow_raw.h" #include "bowling_raw.h" #include "candle_raw.h" #include "car_raw.h" #include "card_raw.h" #include "chicken_raw.h" #include "cookie_raw.h" #include "crying_raw.h" #include "day_raw.h" #include "die2_raw.h" #include "duck_raw.h" #include "feather_raw.h" #include "finlev1_raw.h" #include "hurry_raw.h" #include "marble_raw.h" #include "mask_raw.h" #include "moon_raw.h" #include "oil_raw.h" #include "pickup1_raw.h" #include "pstar_raw.h" #include "redstar_raw.h" #include "spiningtop_raw.h" #include "spit_raw.h" #include "splat_raw.h" #include "tap_raw.h" #include "train_raw.h" #include "tribble_raw.h" #include "turbo_raw.h" #include "twinkle_raw.h" #include "wings_raw.h" #include "wpotion_raw.h" #include "xylo_raw.h" // The mod player static MODPlay methane_music; // Helper function: Frees the voice if end reached static void VoiceCallBack(AESNDPB *pb, u32 state) { if (state == VOICE_STATE_STOPPED) AESND_FreeVoice(pb); } //------------------------------------------------------------------------------ //! \brief Sound driver constructor //------------------------------------------------------------------------------ CAudioDrv::CAudioDrv() { m_AudioValidFlag = 0; sound_volume = 10; music_volume = 64; // Disables music / sound output #ifdef NOMUSIC m_DisableMusicFlag = 1; #else m_DisableMusicFlag = 0; #endif #ifdef NOSOUND m_DisableSamplesFlag = 1; #else m_DisableSamplesFlag = 0; #endif } //------------------------------------------------------------------------------ //! \brief Destroy the sound driver //------------------------------------------------------------------------------ CAudioDrv::~CAudioDrv() { RemoveDriver(); } //------------------------------------------------------------------------------ //! \brief Initialise the sound driver //------------------------------------------------------------------------------ void CAudioDrv::InitDriver(void) { RemoveDriver(); // Initialise the audio subsystem AESND_Init(); // Initialise Player MODPlay_Init(&methane_music); m_AudioValidFlag = 1; } //------------------------------------------------------------------------------ //! \brief Remove the sound driver //------------------------------------------------------------------------------ void CAudioDrv::RemoveDriver(void) { if (!m_AudioValidFlag) return; StopModule(); AESND_Pause(true); m_AudioValidFlag = 0; } //------------------------------------------------------------------------------ //! \brief Play a sample (called from the game) //! //! \param id = SND_xxx id //! \param pos = Sample Position to use 0 to 255 //! \param rate = The rate //------------------------------------------------------------------------------ void CAudioDrv::PlaySample(int id, int pos, int rate) { if (m_DisableSamplesFlag) return; const void *sound_ptr = NULL; u32 sound_length = 0; if (rate == 0) rate = VOICE_FREQ32KHZ; switch(id) { case SND_CAR: sound_ptr = &car_raw; sound_length = car_raw_size; break; case SND_TRAIN: sound_ptr = &train_raw; sound_length = train_raw_size; break; case SND_DUCK: sound_ptr = &duck_raw; sound_length = duck_raw_size; break; case SND_PICKUP1: sound_ptr = &pickup1_raw; sound_length = pickup1_raw_size; break; case SND_TRIBBLE: sound_ptr = &tribble_raw; sound_length = tribble_raw_size; break; case SND_HURRY: sound_ptr = &hurry_raw; sound_length = hurry_raw_size; break; case SND_DAY: sound_ptr = &day_raw; sound_length = day_raw_size; break; case SND_CRYING: sound_ptr = &crying_raw; sound_length = crying_raw_size; break; case SND_DIE2: sound_ptr = &die2_raw; sound_length = die2_raw_size; break; case SND_SPIT: sound_ptr = &spit_raw; sound_length = spit_raw_size; break; case SND_SPLAT: sound_ptr = &splat_raw; sound_length = splat_raw_size; break; case SND_BLOW: sound_ptr = &blow_raw; sound_length = blow_raw_size; break; case SND_TWINKLE: sound_ptr = &twinkle_raw; sound_length = twinkle_raw_size; break; case SND_FINLEV1: sound_ptr = &finlev1_raw; sound_length = finlev1_raw_size; break; case SND_PSTAR: sound_ptr = &pstar_raw; sound_length = pstar_raw_size; break; case SND_XYLO: sound_ptr = &xylo_raw; sound_length = xylo_raw_size; break; case SND_CARDSOUND: sound_ptr = &card_raw; sound_length = card_raw_size; break; case SND_BOWLINGSOUND: sound_ptr = &bowling_raw; sound_length = bowling_raw_size; break; case SND_CANDLESOUND: sound_ptr = &candle_raw; sound_length = candle_raw_size; break; case SND_MARBLESOUND: sound_ptr = &marble_raw; sound_length = marble_raw_size; break; case SND_TAPSOUND: sound_ptr = &tap_raw; sound_length = tap_raw_size; break; case SND_OILSOUND: sound_ptr = &oil_raw; sound_length = oil_raw_size; break; case SND_SPININGTOPSOUND: sound_ptr = &spiningtop_raw; sound_length = spiningtop_raw_size; break; case SND_WINGSSOUND: sound_ptr = &wings_raw; sound_length = wings_raw_size; break; case SND_MOONSOUND: sound_ptr = &moon_raw; sound_length = moon_raw_size; break; case SND_MASKSOUND: sound_ptr = &mask_raw; sound_length = mask_raw_size; break; case SND_REDSTARSOUND: sound_ptr = &redstar_raw; sound_length = redstar_raw_size; break; case SND_TURBOSOUND: sound_ptr = &turbo_raw; sound_length = turbo_raw_size; break; case SND_CHICKENSOUND: sound_ptr = &chicken_raw; sound_length = chicken_raw_size; break; case SND_FEATHERSOUND: sound_ptr = &feather_raw; sound_length = feather_raw_size; break; case SND_WPOTIONSOUND: sound_ptr = &wpotion_raw; sound_length = wpotion_raw_size; break; case SND_COOKIESOUND: sound_ptr = &cookie_raw; sound_length = cookie_raw_size; break; default: // Error: unknown sample return; } // Add a voice AESNDPB* this_voice = AESND_AllocateVoice(VoiceCallBack); // Check if voice was available if (this_voice) { AESND_PlayVoice(this_voice, VOICE_STEREO16, sound_ptr, sound_length, rate, 0, 0); // Do volume math (with fake panning) int vol_l = ((255 - pos) > 0) ? (255 - pos) : 0; vol_l = (vol_l > 255) ? 255 : vol_l; vol_l = (float) sound_volume * (float) vol_l / 10.0; int vol_r = (pos > 0) ? pos : 0; vol_r = (vol_r > 255) ? 255 : vol_r; vol_r = (float) sound_volume * (float) pos / 10.0; AESND_SetVoiceVolume(this_voice, vol_l, vol_r); } } //------------------------------------------------------------------------------ //! \brief Stop the module (called from the game) //------------------------------------------------------------------------------ void CAudioDrv::StopModule(void) { if (!m_AudioValidFlag) return; if (m_DisableMusicFlag) return; MODPlay_Stop(&methane_music); } //------------------------------------------------------------------------------ //! \brief Play a module (called from the game) //! //! \param id = SMOD_xxx id //------------------------------------------------------------------------------ void CAudioDrv::PlayModule(int id) { if (!m_AudioValidFlag) return; if (m_DisableMusicFlag) return; MODPlay_Stop(&methane_music); if (m_DisableMusicFlag) id = SMOD_EMPTY; switch(id) { case SMOD_TUNE1: MODPlay_SetMOD(&methane_music, tune1_mod); break; case SMOD_TUNE2: MODPlay_SetMOD(&methane_music, tune2_mod); break; case SMOD_BOSS: MODPlay_SetMOD(&methane_music, boss_mod); break; case SMOD_COMPLETE: MODPlay_SetMOD(&methane_music, complete_mod); break; case SMOD_TITLE: MODPlay_SetMOD(&methane_music, title_mod); break; default: MODPlay_SetMOD(&methane_music, empty_mod); break; } // Set the volume, cause it resets on every new mod MODPlay_SetVolume(&methane_music, music_volume, music_volume); MODPlay_Start(&methane_music); } //------------------------------------------------------------------------------ //! \brief Change the music and sound volume //! \param s = sound volume (0 to 10) //! \param m = music volume (0 to 10) //------------------------------------------------------------------------------ void CAudioDrv::ChangeVolume(int s, int m) { sound_volume = s; music_volume = m * 6.4; // Set the volume for the current mod MODPlay_SetVolume(&methane_music, music_volume, music_volume); }
/* * Copyright (C) 2013 Google Inc. 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. * * THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND ANY * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE * DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef SecurityPolicyViolationEvent_h #define SecurityPolicyViolationEvent_h #include "core/events/Event.h" #include "core/events/SecurityPolicyViolationEventInit.h" namespace blink { class SecurityPolicyViolationEvent final : public Event { DEFINE_WRAPPERTYPEINFO(); public: static SecurityPolicyViolationEvent* create() { return new SecurityPolicyViolationEvent(); } static SecurityPolicyViolationEvent* create(const AtomicString& type, const SecurityPolicyViolationEventInit& initializer) { return new SecurityPolicyViolationEvent(type, initializer); } const String& documentURI() const { return m_documentURI; } const String& referrer() const { return m_referrer; } const String& blockedURI() const { return m_blockedURI; } const String& violatedDirective() const { return m_violatedDirective; } const String& effectiveDirective() const { return m_effectiveDirective; } const String& originalPolicy() const { return m_originalPolicy; } const String& sourceFile() const { return m_sourceFile; } int lineNumber() const { return m_lineNumber; } int columnNumber() const { return m_columnNumber; } uint16_t statusCode() const { return m_statusCode; } const AtomicString& interfaceName() const override { return EventNames::SecurityPolicyViolationEvent; } DEFINE_INLINE_VIRTUAL_TRACE() { Event::trace(visitor); } private: SecurityPolicyViolationEvent() { } SecurityPolicyViolationEvent(const AtomicString& type, const SecurityPolicyViolationEventInit& initializer) : Event(type, initializer) , m_lineNumber(0) , m_columnNumber(0) , m_statusCode(0) { if (initializer.hasDocumentURI()) m_documentURI = initializer.documentURI(); if (initializer.hasReferrer()) m_referrer = initializer.referrer(); if (initializer.hasBlockedURI()) m_blockedURI = initializer.blockedURI(); if (initializer.hasViolatedDirective()) m_violatedDirective = initializer.violatedDirective(); if (initializer.hasEffectiveDirective()) m_effectiveDirective = initializer.effectiveDirective(); if (initializer.hasOriginalPolicy()) m_originalPolicy = initializer.originalPolicy(); if (initializer.hasSourceFile()) m_sourceFile = initializer.sourceFile(); if (initializer.hasLineNumber()) m_lineNumber = initializer.lineNumber(); if (initializer.hasColumnNumber()) m_columnNumber = initializer.columnNumber(); if (initializer.hasStatusCode()) m_statusCode = initializer.statusCode(); } String m_documentURI; String m_referrer; String m_blockedURI; String m_violatedDirective; String m_effectiveDirective; String m_originalPolicy; String m_sourceFile; int m_lineNumber; int m_columnNumber; int m_statusCode; }; } // namespace blink #endif // SecurityPolicyViolationEvent_h
If you are environmentally conscious, Blissfield(OH) funeral homes can assist you in planning a green burial for a deceased loved one. A natural or green burial is an alternative choice in funeral planning as the body is not prepped with embalming chemicals nor is it cremated. Going "green" is an environmental sustainability movement that goes for a more natural approach to death care. Funeral homes in Blissfield(OH) can guide you through a selection of caskets or even a burial shroud that is biodegradable. Concrete grave liners and burial vaults are eschewed to allow proper decomposition of the deceased and the natural return to the outside earthly elements. The phrase "ashes to ashes, dust to dust", tied irrevocably to death and funerals, truly fits the bill with a green burial. Green burials are not a new concept as it was the norm pre-19th century.Traditional embalming uses chemicals like formaldehyde, a component discovered in the latter part of the 19th century. However, the practice has ancient ties to the Han Dynasty in China and even the ancient Egyptians who used herbs and spices. Funeral homes in Blissfield(OH) will tell you that embalming became a popular method during the American Civil War as a way to preserve the bodies of dead soldiers being sent back home. So why are green burials making a comeback in the 21st century? A greater consciousness about environmental harm is the predominant driving force. Some people simply see it as the latest fad though and are just trying to buck traditional. Blissfield(OH) funeral homes have discovered a number of other reasons why more people are going green. In addition to a greater environmental consciousness, overall cost is a great motivator. Green burials do not involve embalming, decorative caskets or concrete liners or vaults - examples of some of the priciest funeral products. In some instances, when you simply cannot imagine the deceased not housed within some type of container against the elements, you can provide an alternative container of your choice to Blissfield(OH) funeral homes. There are very inexpensive biodegradable coffins for sale and even kits to craft one for a loved one. If the thought of millions of square feet of hardwood or tons of metal has you cringing, a green burial can aid in conserving natural resources. You can also protect the environment by declining the embalming process for the deceased. Chemicals from the process have the potential to leach into the soil, groundwater or even the sewer system. Keep in mind though that some funeral homes in Blissfield(OH) might require it if the funeral cannot happen within a reasonable amount of time or you request a public viewing before final disposition. Imagining your deceased loved one forever a part of a natural landscape can be another reason for choosing a green burial. Talk with the funeral directors of Blissfield(OH) funeral homes to see who can best help you choose a nature area to forever inter your loved one. There are different green cemeteries as well as ecological and wildlife preserves that allow for a green burial. Because green burial is enjoying resurgence, there are more options now than there were five or ten years ago. You will likely see green options on published general price lists of Blissfield(OH) funeral homes. In addition, casket and outer burial container price lists might have biodegradable containers and shrouds for the deceased. Some traditional cemeteries might have designated sections for green burials. There are also cemeteries designated as "green" only. Funeral homes in Blissfield(OH) may also steer you towards other green burial location alternatives such as park lands, habitat areas and conservation tracts specifically designated for environmentally friendly burials. Each green burial location might have different rules such as using natural rock as grave markers or even a discrete ground marker. Blissfield(OH) funeral homes can assist in finding the right green burial situation for your loved one. Depending on where you live, there might not be a location that supports truly green burials. In this instance, funeral homes in Blissfield(OH) can present to you some compromises that help you stay as true as possible to a green burial. For instance, a simple burial can be modified to be environmentally conscious by forgoing embalming and being buried in a shroud or a biodegradable coffin. This option might preclude a public viewing however. Blissfield(OH) funeral homes can help you locate a cemetery that does not require a burial vault. However, if this is not possible, inquire about whether the lid can be cast off and the vault turned upside down so that the deceased is exposed to soil bottom for better composition and return to the earth. If your desire is to have a green burial for a deceased loved one, funeral homes in Blissfield(OH) will work hard to help you realize it.
Take your love of Ferrari to the next level with this inspired watch from the Aspire collection. Crafted from all stainless steel, the striking case features bolts inspired by those found on the cover of Ferraris. A three hand model with blue textured dial, date window, 50M water resistance, and topped with a mineral crystal.
The position is located in the Mechanism Archives and Records Section, Registry, The Hague Branch. Under the supervision of the Chief Archivist, the incumbent will be responsible for supporting the management of the digital records of the Mechanism for International Criminal Tribunals (“Mechanism”) and the digital component of the Archives of the International Criminal Tribunals (i.e. the International Criminal Tribunal for Rwanda (“ICTR”), the International Criminal Tribunal for the former Yugoslavia (“ICTY”) and the Mechanism). Support development and implementation of policies, processes and systems for preserving the digital component of the Archives of the International Criminal Tribunals to ensure that they remain trustworthy, accessible and usable. This includes development, implementation and operation of a Trusted Digital Repository. Assist in developing and implementing SOPs for administration, maintenance and operation of the digital repository. Assist in preparing Submission Information Packages (SIPs) for ingest into the Digital Repository. This includes transforming digital content from various ICTR and ICTY source systems into required SIP formats for ingest. Assist in ingesting digital content into the Digital Repository. Support the day to day operation of the Digital Repository. This includes performing routine analysis of repository content; producing content profiles; analysing and parsing repository logs; and reporting on various repository metrics in support of preservation operations. Assist in developing preservation plans for digital content including comprehensive testing of the plans, particularly the migration paths and migration tools. Contribute to continuous improvement of operations and services by: keeping abreast of professional developments, recommending improvements and implementing approved initiatives. Support development and implementation of policies, processes and systems for record-keeping in the Mechanism, specifically the creation, organization and storage of digital records and early identification and protection of those to be retained as part of the Archives. Participate in development and implementation of the Mechanism’s Electronic Document and Records Management System (EDRMS), HP Records Manager. Participate in business process analyses, identify opportunities for improvement and implement approved initiatives.  Establish and, subsequently, maintain inventories of digital records and recordkeeping systems in the Mechanism. Assist in designing and delivering training on good record-keeping, including effective use of the EDRMS. Participate in advising, guiding and supporting Mechanism staff on digital recordkeeping issues and practices. Support development and implementation of policies, processes and systems for providing access to the digital component of the Archives in accordance with United Nations policies, balancing the need for openness and transparency with the need to protect sensitive information. Support implementation of the Mechanism’s information security and access regime and assist in implementing decisions on classification / declassification, in collaboration with the Associate Research Officer. Assist in providing access to the digital component of the Archives of the International Criminal Tribunals, in accordance with United Nations policies.  Participate in integrating the Digital Repository with the Archival Collection Management System and the EDRMS. Oversee the work of junior staff relating to the functions described above. Professionalism – Demonstrable knowledge of recordkeeping theory and practice, and of established standards in records management and archives management. Demonstrable knowledge of current standards, best practices and trends in digital preservation and digital recordkeeping. Demonstrable conceptual, analytical and evaluative skills. Ability to conduct research and analysis, and formulate and present recommendations. Commitment to implementing the goal of gender equality by ensuring the equal participation and full involvement of women and men in all aspects of work. Shows pride in work and in achievements; demonstrates professional competence and mastery of subject matter; is conscientious and efficient in meeting commitments, observing deadlines and achieving results; is motivated by professional rather than personal concerns; shows persistence when faced with difficult problems or challenges; remains calm in stressful situations. Planning and Organising – Develops clear goals that are consistent with agreed strategies; identifies priority activities and assignments; adjusts priorities as required; allocates appropriate amount of time and resources for completing work; foresees risks and allows for contingencies when planning; monitors and adjusts plans and actions as necessary; uses time efficiently. Teamwork – Works collaboratively with colleagues to achieve organisational goals; solicits input by genuinely valuing others’ ideas and expertise; is willing to learn from others; places team agenda before personal agenda; supports and acts in accordance with final group decision, even when such decisions may not entirely reflect own position; shares credit for team accomplishments and accepts joint responsibility for team shortcomings.
Ensure you reach your fundraising goal with these handy resources and your efforts will have a long lasting impact! Download and print this poster in honour of International Women's Day. Download or print your complete guide to help you reach your fundraising goal! As little as $25 can help to restore sight to a person who is needlessly blind. See the impact your fundraising can have to restore sight. Use this poster to ask your friends and family to support your trek. A poster to put up at your Coastrek fundraising event. Update your Facebook cover photo to tell your friends about your challenge. Add this to your email signature and include the link to your fundraising page! Post this image to tell your friends about your Coastrek challenge. Post this on your Facebook page in honour of International Women's Day.
/* * This Source Code Form is subject to the terms of the Mozilla Public * License, v. 2.0. If a copy of the MPL was not distributed with this * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ /* * Copyright (c) 2018, Joyent, Inc. */ /* * Test cross-DC image copying. */ var path = require('path'); var util = require('util'); var sdcClients = require('sdc-clients'); var uuid = require('uuid'); var vasync = require('vasync'); var mockImgapi = require('./mock/imgapi'); /* Globals */ var CAN_RUN_TEST = process.env.IMGAPI_XDC_ENABLED === 'true'; if (!CAN_RUN_TEST) { console.warn('WARNING: skipping xdc tests (IMGAPI_XDC_ENABLED!=true)'); } var ACCOUNT_ADMIN = 'ba28f844-8cb4-f141-882d-46d6251e6a9f'; var ACCOUNT_VADER = '86055c40-2547-11e2-8a6b-4bb37edc84ba'; /* Public image in remote DC which must be owned by admin */ var ADMIN_IMAGE = '7a1b1967-6ecf-1e4c-8f09-f49094cc36ad'; /* Existing private image that must exist in both DCs */ var EXISTING_IMAGE = '9f819499-8298-9842-8cc5-1c2838196ab4'; /* Private image in the remote DC, owned by Vader */ var PRIVATE_IMAGE = 'f3078f0c-a53b-4140-b7af-fbb6308a8e35'; /* Private incremental image in the remote DC, owned by Vader. */ var PRIVATE_INC_IMAGE = '649d6948-4f1d-11e8-8249-1b9928638559'; /* Origin chain for PRIVATE_INC_IMAGE, the first one is the base image. */ var PRIVATE_INC_IMAGE_ORIGIN_CHAIN = [ 'c58161c0-2547-11e2-a75e-9fdca1940570', /* base - public and admin owned */ '900cffef-55e3-4e7d-b7ec-ccf439a159e3', /* vader owned inc image */ '15963d90-61d7-4664-87a6-f56b16492d5a', /* vader owned inc image */ PRIVATE_INC_IMAGE /* vader owned inc image */ ]; var IMGAPI_URL = process.env.IMGAPI_URL || 'http://localhost'; var MOCK_IMGAPI_PORT = 8082; var TEST_DC_NAME = 'TestDc'; var imgapi; var mockServer; /* Helpers */ function deleteOneImage(imageUuid, t, callback) { imgapi.deleteImage(imageUuid, ACCOUNT_VADER, function _delIncrementalImgCb(err) { // Allow a 404 error. if (!err || err.statusCode !== 404) { t.ok(!err, 'should be no error deleting image'); } callback(); }); } function deleteIncrementalImages(t, callback) { vasync.forEachPipeline({ inputs: PRIVATE_INC_IMAGE_ORIGIN_CHAIN.slice(1).reverse(), func: function deleteLayerN(imageUuid, next) { deleteOneImage(imageUuid, t, next); } }, callback); } function removeTestImages(t, callback) { vasync.pipeline({funcs: [ function deletePrivateImage(_, next) { deleteOneImage(PRIVATE_IMAGE, t, next); }, function deleteIncImages(_, next) { deleteIncrementalImages(t, next); } ]}, callback); } /* Tests */ if (CAN_RUN_TEST) exports['x-DC'] = { setup: function _testModuleSetup(t) { imgapi = new sdcClients.IMGAPI({ url: IMGAPI_URL, agent: false }); t.ok(imgapi, 'setup imgapi client'); var mockOpts = { adminAccount: ACCOUNT_ADMIN, imagesDir: path.join(__dirname, 'data/xdc'), port: MOCK_IMGAPI_PORT }; mockImgapi.setupServer(mockOpts, function (err, server) { if (err) { t.done(err); return; } mockServer = server; t.ok(mockServer, 'setup imock server'); removeTestImages(t, function _onRemoveTestImgCb(err2) { t.ok(!err2, 'removeTestImages should not fail'); t.done(); }); }); }, 'invalid account test': function (t) { var unknownAccount = uuid.v4(); imgapi.importImageFromDatacenterAndWait(PRIVATE_IMAGE, unknownAccount, {datacenter: TEST_DC_NAME}, function _invalidAccountCb(err) { t.ok(err, 'expected import image to return an error'); if (err) { t.equal(err.statusCode, 404, 'err.statusCode should be 404'); t.ok(err.body, 'err.body'); if (err.body) { t.equal(err.body.code, 'NotFoundError', 'err.body should be a NotFoundError error'); } } t.done(); }); }, 'unknown DC test': function (t) { imgapi.importImageFromDatacenter(EXISTING_IMAGE, ACCOUNT_VADER, {datacenter: 'unknown'}, function _unknownDcCb(err) { t.ok(err, 'expected import to have an error'); if (err) { t.equal(err.statusCode, 422, 'err.statusCode should be 422'); t.ok(err.body, 'err.body'); if (err.body) { t.equal(err.body.code, 'ValidationFailed', 'err.body should be a ValidationFailed error'); var msg = err.body.message || ''; var containsTestDc = msg.indexOf(TEST_DC_NAME) > 0; t.ok(containsTestDc, 'error message contains test dc name'); } } t.done(); }); }, 'image already exists': function (t) { imgapi.importImageFromDatacenter(EXISTING_IMAGE, ACCOUNT_VADER, {datacenter: TEST_DC_NAME}, function _alreadyExistsCb(err) { t.ok(err, 'expected import to have an error'); if (err) { t.equal(err.statusCode, 409, 'err.statusCode should be 409'); t.ok(err.body, 'err.body'); if (err.body) { t.equal(err.body.code, 'ImageUuidAlreadyExists', 'err.body should be a ImageUuidAlreadyExists error'); } } t.done(); }); }, 'user cannot import an admin image': function (t) { imgapi.importImageFromDatacenter(ADMIN_IMAGE, ACCOUNT_VADER, {datacenter: TEST_DC_NAME}, function _importAdminCb(err) { t.ok(err, 'expected import to have an error'); if (err) { t.equal(err.statusCode, 401, 'err.statusCode should be 401'); t.ok(err.body, 'err.body'); if (err.body) { t.equal(err.body.code, 'UnauthorizedError', 'err.body should be a UnauthorizedError error'); } } t.done(); }); }, 'user cannot import into the same DC': function (t) { if (!process.env.IMGAPI_DC_NAME) { console.warn('Warning: skipping same DC import test - ' + 'no process.env.IMGAPI_DC_NAME set'); t.done(); return; } imgapi.importImageFromDatacenter(EXISTING_IMAGE, ACCOUNT_VADER, {datacenter: process.env.IMGAPI_DC_NAME}, function _importSameDcCb(err) { t.ok(err, 'expected import to have an error'); if (err) { t.equal(err.statusCode, 422, 'err.statusCode should be 422'); t.ok(err.body, 'err.body'); if (err.body) { t.equal(err.body.code, 'ValidationFailed', 'err.body should be a ValidationFailed error'); } } t.done(); }); }, /** * Import a private (owned by vader) single layer image. * * Result: This should import one new image. */ 'import image': function (t) { imgapi.importImageFromDatacenterAndWait(PRIVATE_IMAGE, ACCOUNT_VADER, {datacenter: TEST_DC_NAME}, function _importIncCb(err, img) { t.ok(!err, 'import should not fail'); t.ok(img, 'img'); imgapi.getImage(PRIVATE_IMAGE, ACCOUNT_VADER, function _incImportImageCb(err2, img2) { t.ok(!err2, 'getImage for imported image should not fail'); t.ok(img2, 'img2'); t.done(); }); }); }, /** * Import a private (owned by vader) multi-layer image, with the base image * layer being owned by the admin (i.e. operator image). * * Result: This should import three new images (2 intermediate layers). */ 'import incremental image': function (t) { imgapi.importImageFromDatacenterAndWait(PRIVATE_INC_IMAGE, ACCOUNT_VADER, {datacenter: TEST_DC_NAME}, function _importIncCb(err, img) { t.ok(!err, 'import incremental image should not fail'); t.ok(img, 'img'); imgapi.getImage(PRIVATE_INC_IMAGE, ACCOUNT_VADER, function _incImportImageCb(err2, img2) { t.ok(!err2, 'getImage for imported inc image should not fail'); t.ok(img2, 'img2'); t.done(); }); }); }, 'delete incremental image layers': function (t) { deleteIncrementalImages(t, t.done.bind(t)); }, /** * Import a private (owned by vader) multi-layer image one layer at a time. * This is meant to test importing an image when a number of images in the * origin chain have already been imported. * * Result: This should import three new images. */ 'import incremental image in steps': function (t) { vasync.forEachPipeline({ inputs: PRIVATE_INC_IMAGE_ORIGIN_CHAIN.slice(1), func: function importLayerN(imageUuid, next) { imgapi.importImageFromDatacenterAndWait(imageUuid, ACCOUNT_VADER, {datacenter: TEST_DC_NAME}, function _importIncNCb(err, img) { t.ok(!err, 'import layer-n image should not fail'); t.ok(img, 'img'); imgapi.getImage(imageUuid, ACCOUNT_VADER, function _importLayerNImageCb(err2, img2) { t.ok(!err2, 'getImage for layer-n image should not fail'); t.ok(img2, 'img2'); next(err || err2); }); }); } }, t.done.bind(t)); }, teardown: function _testModuleTeardown(t) { removeTestImages(t, function _teardownRemoveImagesCb(err) { t.ok(!err, 'removeTestImages should not fail'); imgapi.close(); if (mockServer) { mockServer.close(); } t.done(); }); } };
# frozen_string_literal: true # # Copyright 2016, PillPack, Inc. # # This file is part of Flagstaff. # # Flagstaff is free software: you can redistribute it and/or modify # it under the terms of the GNU Affero 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 Affero General Public License for more details. # # You should have received a copy of the GNU Affero General Public License # along with this program. If not, see <http://www.gnu.org/licenses/>. module Flagstaff # The current version of the Flagstaff gem. VERSION = '1.0.0' end
Annual leave may commonly be known as holiday leave or holiday pay. It enables an employee to have time off work for any reason while being paid. Annual leave is an important employee entitlement, so it is essential to appreciate how it accrues. The information in this article will assist in understanding how annual leave accrues, is calculated and paid. Under the National Employment Standards contained in the Fair Work Act 2009 (Cth) (FW Act) employees are entitled to 4 weeks of paid annual leave for each year of service with their employer. Shiftworkers are entitled to 5 weeks of paid annual leave for each year of service with their employer. An employee’s entitlement to paid annual leave accrues progressively during a year of service according to the employee’s ordinary hours of work. Similarly, a part-time employee will accrue 0.076923* hours of annual leave for each ordinary hour they work. *The accrual rate has been rounded to six decimal places. Employees engaged under a specified term or specified task contract also accrue annual leave according to their ordinary hours of work. Casual employees are not entitled to annual leave.Annual leave accrues while an employee is on a period of paid leave, such as annual leave, personal/carer’s leave, compassionate leave or long service leave. Annual leave does not accrue while an employee is on a period of unpaid leave or on an unauthorised absence. Annual leave accumulates from year to year, so an employee’s accrual does not restart after a year of service or at the end of each calendar or financial year. For example, a part-time employee working 30 hours per week will accrue 120 hours of annual leave per year (30 hours per week x 4 weeks of annual leave per year). If the employee does not take any annual leave, after two years of employment they will have 240 hours of annual leave available (120 hours of annual leave per year x 2 years). An employee and their employer may agree to the employee taking a period of paid annual leave. Employers must not unreasonably refuse a request for annual leave. Employers should assess annual leave requests on a case by case basis and accommodate employees where possible. A request for annual leave may be refused where the employer has strong operational grounds for the refusal, e.g. where they are short-staffed. Where an employee takes a period of paid annual leave, the employer must pay the employee at the employee’s base rate of pay for their ordinary hours of work in the period.Where an employee’s employment ends, and the employee has a period of untaken paid annual leave, the employer must pay the employee the amount that would have been payable had the employee taken that period of leave during employment.
// // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // * Neither the name of NVIDIA CORPORATION nor the names of its // contributors may be used to endorse or promote products derived // from this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ``AS IS'' AND ANY // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY // OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Copyright (c) 2008-2019 NVIDIA Corporation. All rights reserved. // Copyright (c) 2004-2008 AGEIA Technologies, Inc. All rights reserved. // Copyright (c) 2001-2004 NovodeX AG. All rights reserved. #ifndef PX_PHYSICS_COMMON_PX_TYPEINFO #define PX_PHYSICS_COMMON_PX_TYPEINFO /** \addtogroup common @{ */ #include "common/PxPhysXCommonConfig.h" #if !PX_DOXYGEN namespace physx { #endif /** \brief an enumeration of concrete classes inheriting from PxBase Enumeration space is reserved for future PhysX core types, PhysXExtensions, PhysXVehicle and Custom application types. @see PxBase, PxTypeInfo */ struct PxConcreteType { enum Enum { eUNDEFINED, eHEIGHTFIELD, eCONVEX_MESH, eTRIANGLE_MESH_BVH33, eTRIANGLE_MESH_BVH34, eRIGID_DYNAMIC, eRIGID_STATIC, eSHAPE, eMATERIAL, eCONSTRAINT, eAGGREGATE, eARTICULATION, eARTICULATION_REDUCED_COORDINATE, eARTICULATION_LINK, eARTICULATION_JOINT, eARTICULATION_JOINT_REDUCED_COORDINATE, ePRUNING_STRUCTURE, eBVH_STRUCTURE, ePHYSX_CORE_COUNT, eFIRST_PHYSX_EXTENSION = 256, eFIRST_VEHICLE_EXTENSION = 512, eFIRST_USER_EXTENSION = 1024 }; }; /** \brief a structure containing per-type information for types inheriting from PxBase @see PxBase, PxConcreteType */ template<typename T> struct PxTypeInfo {}; #define PX_DEFINE_TYPEINFO(_name, _fastType) \ class _name; \ template <> struct PxTypeInfo<_name> { static const char* name() { return #_name; } enum { eFastTypeId = _fastType }; }; /* the semantics of the fastType are as follows: an object A can be cast to a type B if B's fastType is defined, and A has the same fastType. * This implies that B has no concrete subclasses or superclasses. */ PX_DEFINE_TYPEINFO(PxBase, PxConcreteType::eUNDEFINED) PX_DEFINE_TYPEINFO(PxMaterial, PxConcreteType::eMATERIAL) PX_DEFINE_TYPEINFO(PxConvexMesh, PxConcreteType::eCONVEX_MESH) PX_DEFINE_TYPEINFO(PxTriangleMesh, PxConcreteType::eUNDEFINED) PX_DEFINE_TYPEINFO(PxBVH33TriangleMesh, PxConcreteType::eTRIANGLE_MESH_BVH33) PX_DEFINE_TYPEINFO(PxBVH34TriangleMesh, PxConcreteType::eTRIANGLE_MESH_BVH34) PX_DEFINE_TYPEINFO(PxHeightField, PxConcreteType::eHEIGHTFIELD) PX_DEFINE_TYPEINFO(PxActor, PxConcreteType::eUNDEFINED) PX_DEFINE_TYPEINFO(PxRigidActor, PxConcreteType::eUNDEFINED) PX_DEFINE_TYPEINFO(PxRigidBody, PxConcreteType::eUNDEFINED) PX_DEFINE_TYPEINFO(PxRigidDynamic, PxConcreteType::eRIGID_DYNAMIC) PX_DEFINE_TYPEINFO(PxRigidStatic, PxConcreteType::eRIGID_STATIC) PX_DEFINE_TYPEINFO(PxArticulationLink, PxConcreteType::eARTICULATION_LINK) PX_DEFINE_TYPEINFO(PxArticulationJoint, PxConcreteType::eARTICULATION_JOINT) PX_DEFINE_TYPEINFO(PxArticulationJointReducedCoordinate, PxConcreteType::eARTICULATION_JOINT_REDUCED_COORDINATE) PX_DEFINE_TYPEINFO(PxArticulation, PxConcreteType::eARTICULATION) PX_DEFINE_TYPEINFO(PxArticulationReducedCoordinate, PxConcreteType::eARTICULATION_REDUCED_COORDINATE) PX_DEFINE_TYPEINFO(PxAggregate, PxConcreteType::eAGGREGATE) PX_DEFINE_TYPEINFO(PxConstraint, PxConcreteType::eCONSTRAINT) PX_DEFINE_TYPEINFO(PxShape, PxConcreteType::eSHAPE) PX_DEFINE_TYPEINFO(PxPruningStructure, PxConcreteType::ePRUNING_STRUCTURE) #if !PX_DOXYGEN } // namespace physx #endif /** @} */ #endif
# steven-vue-starter-kit > Steven's Vue Starter Kit ## Build Setup ``` bash # install dependencies npm install # serve with hot reload at localhost:8080 npm run dev # build for production with minification npm run build # run unit tests npm run unit # run e2e tests npm run e2e # run all tests npm test ``` For detailed explanation on how things work, checkout the [guide](http://vuejs-templates.github.io/webpack/) and [docs for vue-loader](http://vuejs.github.io/vue-loader).
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> <html> <head> <meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /> <title>fadeOut</title> <!-- uiut js --> <script src="../uiut/uiut.js"></script> <!-- uiut js --> <!-- tangram js --> <script type="text/javascript" src="http://img.baidu.com/js/tangram-1.1.0.js"></script> <!-- tangram js --> <!-- fx.js --> <script type="text/javascript" src="../../../src/fx.js"></script> <script type="text/javascript" src="../../../src/fx/_Timeline.js"></script> <script type="text/javascript" src="../../../src/fx/Effect.js"></script> <script type="text/javascript" src="../../../src/fx/Opacity.js"></script> <script type="text/javascript" src="../../../src/fx/_getDefaultDisplay.js"></script> <script type="text/javascript" src="../../../src/fx/fadeIn.js"></script> <script type="text/javascript" src="../../../src/fx/fadeOut.js"></script> <!-- fx.js --> <style type="text/css"> button { width: 100px; height: 100px; border: 1px solide #765432; background: #6600CC; color: green; font-size: 18px; } iframe { width: 100px; height: 100px; border: 1px solide #765432; background: #339933; color: green; font-size: 18px; } object { width: 100px; height: 100px; border: 1px solide #765432; background: #FF6666; color: green; font-size: 18px; } td { text-align: center; } </style> </head> <body> <p style="color:#66CC66" align="center"> 可变元素 </p> <table id="table" border=1> <tr> <td> <button id="i_button"> button </button> </td> <td> <iframe id="i_iframe"> iframe </iframe> <p id="r_bs"> </p> </td> <td> <object id="i_object" width="100" height="50"> <param name="BorderStyle" value="1" /><param name="MousePointer" value="0" /><param name="Enabled" value="1" /><param name="Min" value="0" /><param name="Max" value="10" /> </object> <p id="r_bs_a"> </p> <p id="r_bu_a"> </p> <p id="r_au_a"> </p> <p id="r_af_a"> </p> </td> </tr> </table> <script type="text/javascript"> //before start options var start = 1; options_bs = { 'duration': 3000, 'transition': function(schedule){ return schedule; }, 'onbeforestart': function(){ baidu.G("r_bs").innerHTML = "before start:" + start; ++start; } }; function sleep(time){ uiut.nan(); setTimeout(function(){ uiut.an(); }, time); } uiut.at({ name: "未给定options参数时正常fadeOut", test_no_options: function(){ baidu.fx.fadeOut(baidu.G('i_button')); } }); uiut.at({ name: "options参数的onbeforeupdate事件", test_beforeupdate: function(){ baidu.fx.fadeOut('i_iframe', options_bs); sleep(3000); } }); //event case options var all_start = 1, all_update = 1, all_update_a = 1, all_finish = 1; options_all = { 'duration': 3000, 'transition': function(schedule){ return schedule; }, 'onbeforestart': function(){ baidu.G("r_bs_a").innerHTML = "before start:" + all_start; ++all_start; }, 'onbeforeupdate': function(){ baidu.G("r_bu_a").innerHTML = "before update:" + all_update; ++all_update; }, 'onafterupdate': function(){ baidu.G("r_au_a").innerHTML = "after update:" + all_update_a; ++all_update_a; }, 'onafterfinish': function(){ baidu.G("r_af_a").innerHTML = "after finish:" + all_finish; ++all_finish; } }; uiut.at({ name: "options参数含有所有属性", test_all: function(){ baidu.fx.fadeOut(baidu.G('i_object'), options_all); sleep(3000); } }); </script> </body> </html>
The Bestway Inflated Luxury Lounge is a great accessory for a day in the swimming pool. The Bestway Inflated Luxury Lounge is a great accessory for a day in the swimming pool. It is extremely comfortable and will provide hours of leisure in the sun.
'use strict'; module.exports = function (ngModule) { require('./home.scss'); require('./home.config')(ngModule); require('./home.controller')(ngModule); require('./poll.directive')(ngModule); };
On this website we recommend many pictures abaout Quick Easy Hairstyles For School that we have collected from various sites Coloring for Your Inspiration, and of course what we recommend is the most excellent of picture for Quick Easy Hairstyles For School. If you like the picture on our website, please do not hesitate to visit again and get inspiration from our website. Similar Keyword Quick Easy Hairstyles For School : cute quick easy hairstyles for school, easy quick hairstyles for school, hairstyles quick and easy for school, quick easy hairstyles for middle school girls, quick easy hairstyles for school, quick easy hairstyles for school for girls, very quick and easy hairstyles for school, and more.
Muth, F. and Leonard, A.S. 2019. Exposure to a neonicotinoid pesticide negatively affects foraging behaviours, but not learning, in free-flying bumblebees. Scientific Reports. 9: 4764. https://doi.org/10.1038/s41598-019-39701-5. Muth, F., Breslow, P.*, Masek, P. and Leonard, A.S. 2018 A pollen fatty acid enhances learning and survival in bumblebees. Behavioral Ecology. 29:1371-1379. Muth, F., Cooper, T.R.*, Bonilla, R.F.* and Leonard, A.S. 2017. A novel protocol for studying bee cognition in the wild. Methods in Ecology and Evolution. 00:1–10. https://doi.org/10.1111. Featured on Methods.blog with helpful video! Leonard, A.S. and Francis, J.S. 2017. Plant-animal communication: Past, present, and future. Evolutionary Ecology. 31: 143-151. Muth, F., Papaj, D.R. and Leonard, A.S. 2017. Multiple rewards have asymmetric effects on learning in bumblebees. Animal Behaviour. 126:123-133. Muth, F., Francis, J.S. and Leonard, A.S. 2016. Bees use the taste of pollen to determine which flowers to visit. Biology Letters 12: 20160356. Scientific American podcast "60-Second Science" about this paper! Russell, A.L., Gillette, H.D.*, Leonard, A.S. and Papaj, D.R. 2016. Concealed floral rewards and the role of experience in floral sonication by bees. Animal Behaviour. 120: 83-91. New York Times Science Times coverage of this work! Francis, J., Muth, F. Papaj, D.R., and Leonard, A.S. 2016. Nutritional complexity and the structure of bee foraging bouts. Behavioral Ecology. 27 (3): 903-911. Muth, F., Papaj, D.R. and Leonard, A.S. 2016. Bees remember flowers for more than one reason: Pollen mediates associative learning. Animal Behaviour 111:93-100. Russell, A.L., Golden, R.E.*, Leonard, A.S. and Papaj, D.R. 2016. Bees learn preferences for plant species that offer only pollen as a floral reward. Behavioral Ecology. 27 (3): 731-740. Muth, F., Papaj, D.R. and Leonard, A.S. 2015. Colour learning when foraging for nectar and pollen: Bees learn two colours at once. Biology Letters 11: 20150628. Anthony, W.E.*, Palmer-Young, E.C., Leonard, A.S., Irwin, R.E. and Adler, L.S. 2015. Testing dose-dependent effects of the nectar alkaloid anabasine on trypanosome parasite loads in adult bumble bees PLoS ONE 10(11): e0142496. Richardson, L.L, Adler, L.S., Leonard, A.S., Andicoechea, J.*, Regan, K.H.*, Anthony, W.*, Manson, J.S., and Irwin, R.E. 2015. Secondary metabolites in floral nectar reduce parasite infections in bumble bees. Proceedings of the Royal Society Series B: Biological Sciences 282(1803):20142471. Featured as a Nature "Research Highlight" and received some cool attention in the press! Long, S.M., Leonard, A.S., Carey, A.*, and Jakob, E.M. 2015. Vibration as an effective stimulus for aversive conditioning in jumping spiders. Journal of Arachnology 43:111-114. Muth, F., Scampini, A.V.*, and Leonard, A.S. 2015. The effect of acute stress on learning and memory in the bumble bee. Learning and Motivation 50: 39-41. Leonard, A.S. and Masek, P. 2014. Multisensory integration of colors and scents: Insights from bees and flowers. Journal of Comparative Physiology: Series A 200:463-474. Jones, B.M.*, Leonard, A.S., Papaj, D.R. and Gronenberg, W. 2013. Plasticity of the worker bumblebee brain in relation to age and rearing environment. Brain, Behavior and Evolution 82:250-261. Leonard, A.S., Brent, J.*, Papaj, D.R. and Dornhaus, A. 2013. Floral nectar guide patterns discourage nectar robbing by bumble bees. PLoS ONE 8(2): e55914. Featured in PLOS "Author Spotlight" Leonard, A.S., Dornhaus, A. and Papaj, D.R. 2012. Why are floral signals complex? An outline of functional hypotheses. In Evolution of Plant-Pollinator Relationships, Patiny, S. ed. Cambridge, UK: Cambridge University Press. Kaczorowski, R.L., Leonard, A.S., Dornhaus, A. and Papaj, D.R. 2012. Floral signal complexity as a possible adaptation to environmental variability: a test using nectar-foraging bumble bees. Animal Behaviour 83: 905-913. Leonard, A.S. and Papaj, D.R. 2011. "X" marks the spot: The possible benefits of nectar guides to bees and plants. Functional Ecology. 25: 1-9. Leonard, A.S., Dornhaus, A. and Papaj, D.R. 2011. Flowers help bees cope with uncertainty: signal detection and the function of complex floral signals. Journal of Experimental Biology 214: 113-121. Faculty of 1000 "must read" Leonard, A.S., Dornhaus, A. and Papaj, D.R. 2011. Forget-me-not: complex floral signals, inter-signal interactions, and pollinator cognition. Current Zoology 57: 215-224. Invited contribution to special issue on "Complex Signaling" Leonard A.S. and Hedrick, A.V. 2010. Long distance signals influence assessment of close range mating displays in the field cricket, Gryllus integer. Biological Journal of The Linnean Society 100: 856-865. Leonard, A.S. and Hedrick, A.V. 2009. Male and female crickets use different decision rules in response to mating signals. Behavioral Ecology 20: 1175-1184. Leonard, A.S. and Hedrick, A.V. 2009. Single versus multiple cues in mate discrimination by males and females. Animal Behaviour 77:151-159. Leonard, A.S. and Morse, D.H. 2006. Line-following preferences of male crab spiders, Misumena vatia. Animal Behaviour 71: 717-724.
2017 was, among other things, the year that brought us fancy fast-casual spots, unicorn lattes and dessert tasting menus. Join us on a gastronomic retrospective of the past 12 months—here’s to many more great meals in the new year. When it gets cold, our hibernatory instincts tell us to go underground…and have a really lavish meal. This gorgeous subterranean restaurant with a courtyard inside NoMad’s MADE Hotel focuses on seasonal dishes created by the hotshot former chef of Le Turtle, Greg Proechel. That means carrot agnolotti, Iberico pork collar and a killer côte de boeuf (rib steak) with all the fixings. Another legendary spot has been given new life: the former Four Seasons in the Seagram Building, which has been revamped by the folks behind Carbone and Santina. As you might expect, it’s a pretty fancy affair, with servers in tuxedos, a midcentury-chophouse-inspired menu (think: prime rib and foie gras) and a gorgeously restored interior. The all-day counterpart to Union Square Café has already become a neighborhood staple. Stop by for its famous crullers, next-level sandwiches and something magical called “cake in a cup,” which comes drizzled with espresso-chocolate ganache. In case you’re wondering: Cake definitely tastes better when eaten with a spoon. East Villagers have a new spot to get their pho fix. Along with soul-warming soup (including an incredible vegetarian version made with seaweed and charred Brussels sprouts), the family-style menu also includes an uni bánh mì and pomelo and shrimp salad. We're obsessed with Chef Alex Stupak's downtown spots, so we're stoked we can now chow down on his inventive Mexican fare above 34th Street. You're definitely going to need an order crab nachos with sea urchin "queso" and the unreal avocado dessert. The city’s love affair with modern-Indian fare is still going strong, as evidenced by this sleek new spot. Grab a table under the funky mural and dig into shareable plates like octopus with coconut-turmeric mousse, butter-pepper lobster tail and tomato-basil-cream-cheese naan. Yep, this is a fancy food court, not a restaurant, which means multiple amazing options in one place. To name just a few: Bunker Vietnamese, the Arepa Lady, Hard Times Sundaes and—most exciting of all—Katz’s first-ever spin-off after 129 years. Pastrami, here we come. We know where we'll be hanging out all next summer: at this stunning waterfront spot, an Italian hot spot (owned by swanky members-only club Soho House) with locations in Miami, L.A. and London. Settle into one of the plush chairs (or grab a seat in the prime sidewalk café) and watch the sunset over wood-fired pizza and lobster spaghetti. OK, technically this one opened at the tail end of 2016, but it’s more than worth the inclusion: After serving as executive chef of ABC Kitchen and ABC Cocina, Dan Kluger finally got a place of his own. No surprise—the man is an absolute genius with vegetables. The specialty here is mixian: thin, spaghetti-shaped rice noodles from China’s Yunnan province. While the bowls are rich, they won’t leave you in the same full-blown salt coma as ramen. Garnishes such as housemade pickles, fermented vegetables and fresh herbs also help add bright bursts of flavor. This modern-Israeli newcomer excels at shareable plates like housemade labne and lamb shawarma-topped hummus. And once it warms up again, you can be sure we’ll be first in line to chow down on shakshuka in its backyard garden. This Thai spot opened on a quiet stretch in Carroll Gardens and promptly drew hordes upon hordes of spice-seekers, who happily endure the wait to feast on dishes like snapper in ginger-tamarind sauce, spicy duck salad and five-spice pork-leg stew. Be forewarned: When the menu says something is “brutally spicy,” it means it. Few things can replace a Hamptons getaway…except for maybe a meal at this charmingly breezy new spot, which feels like it was uprooted from Montauk. The menu includes a seafood crudo section, naturally, but also farmhouse roasted chicken, mint pappardelle and some of the prettiest chocolate truffles we’ve ever seen. Union Square, you’re looking great these days. And it might have something to do with the one-two punch of the globally influenced brasserie Bowery Road (helmed by the former Locanda Verde chef de cuisine) and the adjacent cocktail bar in a luxe, inviting space. This izakaya, helmed by a sake sommelier and former wd~50 chef, serves up just the kind of creative-but-somehow-familiar dishes we could snack on all day, like a baguette with kombu butter and smoked salt, and corn on the cob with bonito and Parmesan. We love the city’s greasy spoons, but sometimes we want the old-school vibe without, well, the grease. This Chinatown eatery offers the best of both worlds with diner classics (lox bagel, BEC) and inventive options like tuna tartare and a kale cashew bowl. Cooking over an open flame is the M.O. here, and we’re not mad about it, when it means dishes like crispy lamb with squash and crème fraîche or beef-tallow potatoes with spicy paprika. Does the city need another ramen shop? It does when it’s a spin-off of the legendary Tokyo-based ramen chain known for its high-quality dekitate noodles (translation: “still warm, please eat right away”). Along with Tokyo-style tonkotsu and housemade noodles, you’ll find nambutekkiyakki dishes (made on a cast iron griddle), kushiyaki (skewers), karaage (fried chicken), cocktails and an Instagram-worthy dining room. Eleven Madison Park underwent a major revamp this year, but it also rolled out a brand-new fast-casual spot—where the most expensive dish is $22. (Be still our heart.) Expect the same culinary brilliance in composed bowls (like one with steak á la plancha, charred cabbage salad and crispy rice), roast chicken and herb frites, and soft serve with oat shortbread and honey brittle. Oh, and did we mention there’s rosé on tap? When a celebrated Beijing chef opens a stateside outpost of his acclaimed roast Peking duck house, you pay attention. And we’re happy to report that the signature bird does not disappoint—and neither do modern Chinese dishes like lobster and saffron rice or seared Wagyu beef with preserved Sicuhan vegetables. This all-day bar/café/restaurant wins the award for Interior That’s So Inviting We’d Like to Live There, Please. But it’s much more than just good looks: You’ll find super-tasty shareable plates like chicken leg with za’atar stuffing and carbonara shortbread, plus a well-curated wine list.
Stories about female fighters and escaping from IS. A new magazine for women with a fresh and brave approach to journalism hits the streets of Sulaymaniyah in Iraqi Kurdistan this week. The cover shows the smiling face of a woman without a headscarf. Much anticipation surrounds the launch of ZHIN, a new magazine for women in Iraqi Kurdistan available on the streets of the capital Sulaymaniyah in February. The magazine, supported by International Media Support, consists of an entirely female staff, some joining the team from other media in Sulemaniya and some coming from Europe. The magazine seeks to entice women between the ages of 18 and 40 with stories that are relevant to their every day’s lives and with information of special interest to women, which is otherwise not available in Iraqi Kurdistan. The aim as described by the magazine itself, is to make women aware of their choices, offer them opportunities, and make them aware of their rights to help them play a stronger position in the political and economic sectors in society in general. “It is about time there is a truly independent magazine for women,” says Ala Latif, editor of the magazine, to IMS’s partner Metro Center for Journalists Rights & Advocacy in Kurdistan. The magazine covers social issues, as well as fashion, beauty and lifestyle. Sometimes with a critical tone, sometimes with humour – the magazine always takes the female perspective. Articles in the first edition feature serious stories about escaping from IS and female fighters in the news, but also lighter topics on how to save money, valentine’s gifts and shopping. “We want to lead the way for a different type of professional journalism that will not seek scandal and flashy headlines. We will directly touch upon real issues of women, and will seek practical alternatives, and that will set us apart from the dominant media in the market,” Ala Latif says. Watch this space for in-depth interviews in the coming days with some of the women behind ZHIN.
// Copyright (c) 2013 The Chromium Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #ifndef BASE_MEMORY_DISCARDABLE_MEMORY_H_ #define BASE_MEMORY_DISCARDABLE_MEMORY_H_ #include "base/base_export.h" #include "base/basictypes.h" #include "base/compiler_specific.h" namespace base { enum LockDiscardableMemoryStatus { DISCARDABLE_MEMORY_FAILED = -1, DISCARDABLE_MEMORY_PURGED = 0, DISCARDABLE_MEMORY_SUCCESS = 1 }; // Platform abstraction for discardable memory. DiscardableMemory is used to // cache large objects without worrying about blowing out memory, both on mobile // devices where there is no swap, and desktop devices where unused free memory // should be used to help the user experience. This is preferable to releasing // memory in response to an OOM signal because it is simpler, though it has less // flexibility as to which objects get discarded. // // Discardable memory has two states: locked and unlocked. While the memory is // locked, it will not be discarded. Unlocking the memory allows the OS to // reclaim it if needed. Locks do not nest. // // Notes: // - The paging behavior of memory while it is locked is not specified. While // mobile platforms will not swap it out, it may qualify for swapping // on desktop platforms. It is not expected that this will matter, as the // preferred pattern of usage for DiscardableMemory is to lock down the // memory, use it as quickly as possible, and then unlock it. // - Because of memory alignment, the amount of memory allocated can be // larger than the requested memory size. It is not very efficient for // small allocations. // // References: // - Linux: http://lwn.net/Articles/452035/ // - Mac: http://trac.webkit.org/browser/trunk/Source/WebCore/platform/mac/PurgeableBufferMac.cpp // the comment starting with "vm_object_purgable_control" at // http://www.opensource.apple.com/source/xnu/xnu-792.13.8/osfmk/vm/vm_object.c class BASE_EXPORT DiscardableMemory { public: DiscardableMemory(); // If the discardable memory is locked, the destructor will unlock it. // The opened file will also be closed after this. ~DiscardableMemory(); // Check whether the system supports discardable memory. static bool Supported(); // Initialize the DiscardableMemory object. On success, this function returns // true and the memory is locked. This should only be called once. // This call could fail because of platform-specific limitations and the user // should stop using the DiscardableMemory afterwards. bool InitializeAndLock(size_t size); // Lock the memory so that it will not be purged by the system. Returns // DISCARDABLE_MEMORY_SUCCESS on success. If the return value is // DISCARDABLE_MEMORY_FAILED then this object should be discarded and // a new one should be created. If the return value is // DISCARDABLE_MEMORY_PURGED then the memory is present but any data that // was in it is gone. LockDiscardableMemoryStatus Lock() WARN_UNUSED_RESULT; // Unlock the memory so that it can be purged by the system. Must be called // after every successful lock call. void Unlock(); // Return the memory address held by this object. The object must be locked // before calling this. Otherwise, this will cause a DCHECK error. void* Memory() const; // Testing utility calls. // Check whether a purge of all discardable memory in the system is supported. // Use only for testing! static bool PurgeForTestingSupported(); // Purge all discardable memory in the system. This call has global effects // across all running processes, so it should only be used for testing! static void PurgeForTesting(); private: #if defined(OS_ANDROID) // Maps the discardable memory into the caller's address space. // Returns true on success, false otherwise. bool Map(); // Unmaps the discardable memory from the caller's address space. void Unmap(); // Reserve a file descriptor. When reaching the fd limit, this call returns // false and initialization should fail. bool ReserveFileDescriptor(); // Release a file descriptor so that others can reserve it. void ReleaseFileDescriptor(); #endif // OS_ANDROID void* memory_; size_t size_; bool is_locked_; #if defined(OS_ANDROID) int fd_; #endif // OS_ANDROID DISALLOW_COPY_AND_ASSIGN(DiscardableMemory); }; } // namespace base #endif // BASE_MEMORY_DISCARDABLE_MEMORY_H_
import demistomock as demisto def test_parse_alert_to_incident(mocker): """ Given: - Alert with event_values as list When: - Parsing the alert Then: - Ensure parsing does not fail - Verify parsed alert returned as expected """ mocker.patch.object( demisto, 'params', return_value={ 'server': 'server', 'credentials': { 'identifier': 'identifier', 'password': 'password' }, 'insecure': False, 'version': 'v3' } ) from FireEyeHX import parse_alert_to_incident assert parse_alert_to_incident({'event_values': []}) == {'name': 'New Event: ', 'rawJSON': '{"event_values": []}'}
Have you ever heard of a galette? It's a sort of free form pie, filled with anything that your heart desires. I was first inspired to make one when I stopped by to visit my friends, Dina and Tony. Dina was cooking up a storm (as always) and she had made an apple galette for dessert, which was SO delish! I thought "what could be easier?" It kind of takes all fear out of making a pie. So, I decided to make one too, only I chose blackberries and mangoes for the filling. The mangoes were SO juicy and ripe, and the blackberries were just as plump as could be. I thought, why not? So here it is. It's my own recipe and I hope you like it! Place fruit in a small mixing bowl. Add remaining filling ingredients. Gently toss until coated. On a lightly floured work surface, roll out the pie crust into a large circle. Carefully roll up the pie crust over your floured rolling pin, then unroll it onto a parchment lined baking tray. Pile the fruit mixture into the center of the pie crust. Spread it out a little, leaving a 2" border around the edges. Fold pie crust edges over the fruit. Brush the crust with an egg wash, if desired, then sprinkle with a little white sugar + a little cinnamon. Bake for 30-35 minutes, or until the crust is golden and fruit is bubbly. Let it cool for 15 minutes before serving. Serve with a dollop of whipped cream or a scoop of vanilla bean ice cream. You can tell if a mango is really ripe when most of the peel becomes a deep red. If it's mostly green, it's not ripe enough. But go ahead and purchase it anyway, then let it sit in a paper bag at room temperature for 2 or 3 days until it ripens. Can't find blackberries? Use blueberries instead! Don't like mangoes? Use peaches instead! Btw, an egg wash is simply a beaten egg with a little bit of water added to it. When you brush it onto any bread or crust, it gives a nice golden shine to whatever you're baking.
Taylor Swift was spotted over the holiday weekend at the Fairfax Flea Market wearing a vintage dress from Salvage Life! I love that she is wearing is wearing one of our pieces while doing my favorite activity, warms my heart! She really does look perfect in the 50's silhouette, and jewel tones are especially flattering. Thanks Tay for making our clothes look so good! That must be so exciting! Have you had an opportunity to meet her, or to style her? Maybe she would get a hint to get more dress from you. She looks good in Salvage Life. :) How fun for you.
Finding an Xcite gown that makes the most of your figure is a breeze. These dresses are designed to take advantage of every curve. A variety of body-conscious designs are available, and there are plenty of flowing, figure-skimming styles as well. When it comes to looking great, confidence is key. You'll be at the top of your game when you're decked out in one of these dazzling little dresses, which are available in popular silhouettes like A-line dresses, mermaid dresses, fit-and-flare dresses, high-low dresses and many others.
SINGAPORE: The first car to arrive in Tarim, a historic town in the Hadhramaut Valley of Yemen, was an American Studebaker. It had traveled across oceans and continents to get there — but not without the help of one prominent Arab family in Singapore. “Tarim’s first car was bought and imported to Singapore by the Alkaff family,” said Zahra Aljunied, whose forefathers came from Tarim. The 62-year-old senior librarian is a fifth-generation Singaporean Arab from the lineage of Syed Omar Aljunied, one of the first Arabs to set foot in the port in 1820. Though the Indian Ocean separates the Asian metropolis of Singapore and the Arabian deserts of Hadhramaut, the ties that bind them run deep and go back centuries. Almost all Arabs in Southeast Asia trace their ancestry to Hadhramaut, a region on the southern tip of the Arabian Peninsula in present-day Yemen. Referred to as Hadhrami Arabs, they began migrating to Indonesia, Malaysia and Singapore in large numbers from the mid-18th century. Names such as Aljunied, Alkaff and Alsagoff are familiar to most Singaporeans, as streets, buildings, mosques, schools and even a district have been named after these prominent Arab clans. Yet few realize the impact the early Muslim settlers had on colonial Singapore, or on the families they left behind in the homeland. “When Sir Stamford Raffles founded Singapore in 1819, one of the first things he did was to persuade Hadhrami families to come here,” recounted Singapore’s former foreign minister George Yeo at the launch of a 2010 exhibition about Arabs in Southeast Asia. “Syed Mohammed Harun Aljunied and (his nephew) Syed Omar Aljunied from Palembang (in present-day Indonesia) were given a warm welcome, and from that time on Singapore became the center of the Hadhrami network in Southeast Asia,” Yeo said. Attracted by Singapore’s free port status, the two men — already successful merchants in Palembang — brought everything they owned “lock, stock and barrel,” said Zahra, whose paternal grandmother came from the line of Syed Omar. Syed Omar was born in 1792 in Tarim, a small town in South Yemen widely considered a theological, judicial and academic hub in Hadhramaut. The Malays saw him as a prince because the Aljunied family, being part of the Ba’alawi tribe, can trace their ancestry to the Prophet Muhammad and were regarded as legitimate custodians of Islam. But growing up, Tarim was a place that Zahra and her siblings shunned. That journey drew her back to Hadhramaut five times, and also to Palembang and Java in Indonesia. She discovered that decades of Southeast Asian influence gave Hadhramaut a unique culture not found in other parts of the Middle East. “When I first went to Hadhramaut, it was so different from Sanaa … It’s their way of life — what they eat, wear, even the language,” she said. While men in Sanaa usually wear the traditional Yemeni dress called a thobe, men in Hadhramaut prefer shirts and sarongs, traditional Indonesian clothing often made of Javanese batik. “Yes, they dress differently … They eat belacan (the shrimp paste condiment used in Southeast Asia) and keropok (Malay/Indonesian prawn crackers), all imported from Indonesia,” Zahra said. Hadhramis have been traversing the Indian Ocean for centuries, said Syed Farid Alatas, professor of sociology at the National University of Singapore. Situated at the crossroads of Africa, Asia and the Middle East, Hadhramaut was at that time a key post on the ancient spice trade route. “The migration to Southeast Asia was relatively recent compared with the other migrations in East Africa and southern India,” said Alatas, who is also from a prominent Hadhrami family in Southeast Asia. However, the homeland was never far from their hearts. Parents used to send their young sons to Hadhramaut to study in religious schools, where they would to learn Arabic and Islamic values. Sometimes they also married off their local-born daughters to Hadhrami men. Remittances from the Far East soon became the most important source of income for those in the homeland as overpopulation, poverty and arid farming conditions made it difficult to sustain traditional livelihoods such as agriculture, herding and trade. By the 19th century, Arabs in Southeast Asia dominated trade, commerce and maritime networks. They operated the largest fleets and vessels in the Indo-Malay archipelago, and the port of Singapore became the hub of Hadhrami shipping. For a time, Singapore was also the major transit point for Hajj pilgrims. Hadhrami Arabs were instrumental in the spread of Islam in the region. Many held high positions in civic and religious affairs or took part in politics. Others owned large swathes of land in the early colonial days — an estimated 50 percent of Singapore’s total land mass at one time, according to one scholar. Known for their philanthropy, they also donated much of their land for cemeteries, hospitals and places of worship including famous landmarks such as St. Andrew’s Cathedral and Singapore’s first mosque, Masjid Omar Kampong Melaka — both of which still stand today. After World War II, however, Arab wealth and prominence in Singapore began to fade, due in part to rent controls as the government sought to curb inflation. The introduction of the 1966 land acquisition act also affected Arab land ownership as the post-independence government bought property for state development. Estimates put the Arab population in Singapore at about 10,000 today, but some say that the numbers are difficult to determine as many have assimilated into the Malay community and no longer distinguish themselves as Arabs. Some observers say that Singaporean Arabs have lost their identity since many young Arabs no longer speak Arabic and have little ties to Hadhramaut, but Alatas disagreed. Arabs are no exception, he said. “You have Arabs in Singapore who feel and strongly identify themselves as Arab. On the other hand, you have those who have assimilated into Malay society — they know they have Arab ancestry, but they feel Malay. The war in Yemen has taken a huge human and economic toll on the country and disrupted transport links. Even those hoping to maintain ties with their ancestral home find it hard to return. Flights have become irregular and expensive, and reaching Tarim now involves a 10-hour bus journey from Salalah in Oman, Zahra said.
<html> <META HTTP-EQUIV=Content-Type Content="text/html; charset=big5"> <!-- Mirrored from lis.ly.gov.tw/lghtml/lawstat/version2/01933/0193396121800.htm by HTTrack Website Copier/3.x [XR&CO'2010], Sun, 24 Mar 2013 09:16:48 GMT --> <head><title>ªk½s¸¹:01933 ª©¥»:096121800</title> <link rel="stylesheet" type="text/css" href="../../version.css" > </HEAD> <body><left> <table><tr><td><FONT COLOR=blue SIZE=5>°Ó·~µn°Oªk(01933)</font> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td> <table><tr><td>&nbsp;&nbsp;&nbsp;</td> <tr><td align=left valign=top> <a href=0193326061800.html target=law01933><nobr><font size=2>¤¤µØ¥Á°ê 26 ¦~ 6 ¤ë 18 ¤é</font></nobr></a> </td> <td valign=top><font size=2>¨î©w29±ø</font></td> <tr><td align=left valign=top><nobr><font size=2>¤¤µØ¥Á°ê 26 ¦~ 6 ¤ë 28 ¤é¤½¥¬</font></nobr></td> <tr><td align=left valign=top> <a href=0193356111400.html target=law01933><nobr><font size=2>¤¤µØ¥Á°ê 56 ¦~ 11 ¤ë 14 ¤é</font></nobr></a> </td> <td valign=top><font size=2>­×¥¿¥þ¤å42±ø</font></td> <tr><td align=left valign=top><nobr><font size=2>¤¤µØ¥Á°ê 56 ¦~ 11 ¤ë 28 ¤é¤½¥¬</font></nobr></td> <tr><td align=left valign=top> <a href=0193378100500.html target=law01933><nobr><font size=2>¤¤µØ¥Á°ê 78 ¦~ 10 ¤ë 5 ¤é</font></nobr></a> </td> <td valign=top><font size=2>­×¥¿¥þ¤å41±ø</font></td> <tr><td align=left valign=top><nobr><font size=2>¤¤µØ¥Á°ê 78 ¦~ 10 ¤ë 23 ¤é¤½¥¬</font></nobr></td> <tr><td align=left valign=top> <a href=0193388120700.html target=law01933><nobr><font size=2>¤¤µØ¥Á°ê 88 ¦~ 12 ¤ë 7 ¤é</font></nobr></a> </td> <td valign=top><font size=2>­×¥¿²Ä4, 31, 32, 33, 34, 35, 36±ø<br> §R°£²Ä37±ø</font></td> <tr><td align=left valign=top><nobr><font size=2>¤¤µØ¥Á°ê 88 ¦~ 12 ¤ë 29 ¤é¤½¥¬</font></nobr></td> <tr><td align=left valign=top> <a href=0193389040700.html target=law01933><nobr><font size=2>¤¤µØ¥Á°ê 89 ¦~ 4 ¤ë 7 ¤é</font></nobr></a> </td> <td valign=top><font size=2>­×¥¿²Ä6±ø</font></td> <tr><td align=left valign=top><nobr><font size=2>¤¤µØ¥Á°ê 89 ¦~ 4 ¤ë 26 ¤é¤½¥¬</font></nobr></td> <tr><td align=left valign=top> <a href=0193391011600.html target=law01933><nobr><font size=2>¤¤µØ¥Á°ê 91 ¦~ 1 ¤ë 16 ¤é</font></nobr></a> </td> <td valign=top><font size=2>§R°£²Ä20±ø<br> ­×¥¿²Ä3, 13, 17, 22, 41±ø</font></td> <tr><td align=left valign=top><nobr><font size=2>¤¤µØ¥Á°ê 91 ¦~ 2 ¤ë 6 ¤é¤½¥¬</font></nobr></td> <tr><td align=left valign=top> <a href=0193391112600.html target=law01933><nobr><font size=2>¤¤µØ¥Á°ê 91 ¦~ 11 ¤ë 26 ¤é</font></nobr></a> </td> <td valign=top><font size=2>­×¥¿²Ä8±ø</font></td> <tr><td align=left valign=top><nobr><font size=2>¤¤µØ¥Á°ê 91 ¦~ 12 ¤ë 18 ¤é¤½¥¬</font></nobr></td> <tr><td align=left valign=top> <a href=0193396121800.html target=law01933><nobr><font size=2>¤¤µØ¥Á°ê 96 ¦~ 12 ¤ë 18 ¤é</font></nobr></a> </td> <td valign=top><font size=2>­×¥¿¥þ¤å37±ø<br> ²Ä15±ø²Ä2¶µ¡B²Ä23±ø¡B²Ä26±ø²Ä2¶µ¡A¦Û98¦~4¤ë13¤é¬I¦æ</font></td> <tr><td align=left valign=top><nobr><font size=2>¤¤µØ¥Á°ê 97 ¦~ 1 ¤ë 16 ¤é¤½¥¬</font></nobr></td> <tr><td align=left valign=top> <a href=0193398010600.html target=law01933><nobr><font size=2>¤¤µØ¥Á°ê 98 ¦~ 1 ¤ë 6 ¤é</font></nobr></a> </td> <td valign=top><font size=2>­×¥¿²Ä28±ø</font></td> <tr><td align=left valign=top><nobr><font size=2>¤¤µØ¥Á°ê 98 ¦~ 1 ¤ë 21 ¤é¤½¥¬</font></nobr></td> </table></table></table></table> <p><table><tr><td><font color=blue size=4>¥Á°ê96¦~12¤ë18¤é(«D²{¦æ±ø¤å)</font></td> <td><a href=http://lis.ly.gov.tw/lghtml/lawstat/reason2/0193396121800.htm target=reason><font size=2>¥ßªk²z¥Ñ</font></a></td> <td><a href=http://lis.ly.gov.tw/lgcgi/lglawproc?0193396121800 target=proc><font size=2>¥ßªk¬ö¿ý</font></a></td> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤@±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~µn°O¡A¨Ì¥»ªk¤§³W©w¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤G±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@¥»ªk©ÒºÙ¥DºÞ¾÷Ãö¡G¦b¤¤¥¡¬°¸gÀÙ³¡¡F¦bª½ÁÒ¥«¬°ª½ÁÒ¥«¬F©²¡F¦b¿¤¡]¥«¡^¬°¿¤¡]¥«¡^¬F©²¡C<br> ¡@¡@ª½ÁÒ¥«¬F©²¡B¿¤¡]¥«¡^¬F©²¡A¥²­n®É±o³ø¸g¸gÀÙ³¡®Ö©w¡A±N¥»ªk³¡¤À·~°È©e¥ô©Î©e¿ì°Ï¡B¶m¡]Âí¡B¥«¡B°Ï¡^¤½©Ò©Î©e°Uª½ÁÒ¥«¡B¿¤¡]¥«¡^¤§°Ó·~·|¿ì²z¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤T±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@¥»ªk©ÒºÙ°Ó·~¡A«ü¥HÀç§Q¬°¥Øªº¡A¥H¿W¸ê©Î¦X¹Ù¤è¦¡¸gÀ礧¨Æ·~¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¥|±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~°£²Ä¤­±ø³W©w¥~¡A«D¸g°Ó·~©Ò¦b¦a¥DºÞ¾÷Ãöµn°O¡A¤£±o¦¨¥ß¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤­±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@¤U¦C¦U´Ú¤p³W¼Ò°Ó·~¡A±o§K¨Ì¥»ªk¥Ó½Ðµn°O¡G<br> ¡@¡@¤@¡BÅu³c¡C<br> ¡@¡@¤G¡B®a®x¹A¡BªL¡Bº®¡Bªª·~ªÌ¡C<br> ¡@¡@¤T¡B®a®x¤â¤u·~ªÌ¡C<br> ¡@¡@¥|¡B¥Á±J¸gÀçªÌ¡C<br> ¡@¡@¤­¡B¨C¤ë¾P°âÃB¥¼¹FÀç·~µ|°_¼xÂIªÌ¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤»±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~·~°È¡A¨Ìªk«ß©Îªk³W©R¥O¡A¶·¸g¦U¸Ó¥Øªº¨Æ·~¥DºÞ¾÷Ãö³\¥iªÌ¡A©ó»â±o³\¥i¤å¥ó«á¡A¤è±o¥Ó½Ð°Ó·~µn°O¡C<br> ¡@¡@«e¶µ·~°È¤§³\¥i¡A¸g¥Øªº¨Æ·~¥DºÞ¾÷ÃöºM¾P©Î¼o¤î½T©wªÌ¡A¦U¸Ó¥Øªº¨Æ·~¥DºÞ¾÷ÃöÀ³³qª¾°Ó·~©Ò¦b¦a¥DºÞ¾÷ÃöºM¾P©Î¼o¤î¨ä°Ó·~µn°O©Î³¡¤Àµn°O¨Æ¶µ¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤C±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~¤§¸gÀ禳¹H¤Ïªk«ß©Îªk³W©R¥O¡A¨ü°Ç¥O·²·~³B¤À½T©wªÌ¡AÀ³¥Ñ³B¤À¾÷Ãö³qª¾°Ó·~©Ò¦b¦a¥DºÞ¾÷Ãö¡A¼o¤î¨ä°Ó·~µn°O©Î³¡¤Àµn°O¨Æ¶µ¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤K±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~µn°O¤§¥Ó½Ð¡A¥Ñ°Ó·~­t³d¤H¦V°Ó·~©Ò¦b¦a¤§¥DºÞ¾÷Ãö¬°¤§¡F¨ä©e°U¥L¤H¿ì²zªÌ¡AÀ³ªþ¨ã©e°U®Ñ¡C<br> ¡@¡@°Ó·~Ä~©Ó¤§µn°O¡AÀ³¥Ñ¦XªkÄ~©Ó¤H¥þÅéÁp¦W¥Ó½Ð¡AÄ~©Ó¤H¤¤¦³¥¼¦¨¦~ªÌ¡A¥Ñ¨äªk©w¥N²z¤H¥N¬°¥Ó½Ð¡FÄ~©Ó¶}©l®É¡AÄ~©Ó¤H¤§¦³µL¤£©úªÌ¡A¥Ñ¿ò²£ºÞ²z¤H¥N¬°¥Ó½Ð¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤E±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~¶}·~«e¡AÀ³±N¤U¦C¦U´Ú¥Ó½Ðµn°O¡G<br> ¡@¡@¤@¡B¦WºÙ¡C<br> ¡@¡@¤G¡B²Õ´¡C<br> ¡@¡@¤T¡B©ÒÀç·~°È¡C<br> ¡@¡@¥|¡B¸ê¥»ÃB¡C<br> ¡@¡@¤­¡B©Ò¦b¦a¡C<br> ¡@¡@¤»¡B­t³d¤H¤§©m¦W¡B¦í¡B©~©Ò¡B¨­¤ÀÃÒ©ú¤å¥ó¦r¸¹¡B¥X¸êºØÃþ¤Î¼ÆÃB¡C<br> ¡@¡@¤C¡B¦X¹Ù²Õ´ªÌ¡A¦X¹Ù¤H¤§©m¦W¡B¦í¡B©~©Ò¡B¨­¤ÀÃÒ©ú¤å¥ó¦r¸¹¡B¥X¸êºØÃþ¡B¼ÆÃB¤Î¦X¹Ù«´¬ù°Æ¥»¡C<br> ¡@¡@¤K¡B¨ä¥L¸g¤¤¥¡¥DºÞ¾÷Ãö³W©w¤§¨Æ¶µ¡C<br> ¡@¡@«e¶µ¤Î¨ä¥L¨Ì¥»ªk³W©wÀ³µn°O¨Æ¶µ¡A°Ó·~©Ò¦b¦a¥DºÞ¾÷Ãö±oÀH®É¬£­û©â¬d¡F°Ó·~­t³d¤H¤Î¨ä±q·~¤H­û¡A¤£±o³WÁסB§«Ãª©Î©Úµ´¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤Q±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@¥»ªk©ÒºÙ°Ó·~­t³d¤H¡A¦b¿W¸ê²Õ´¡A¬°¥X¸ê¤H©Î¨äªk©w¥N²z¤H¡F¦b¦X¹Ù²Õ´ªÌ¡A¬°°õ¦æ·~°È¤§¦X¹Ù¤H¡C<br> ¡@¡@¸g²z¤H¦b°õ¦æ¾°È½d³ò¤º¡A¥ç¬°°Ó·~­t³d¤H¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤Q¤@±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@­­¨î¦æ¬°¯à¤O¤H¡A¸gªk©w¥N²z¤H¤§¤¹³\¡A¿W¥ßÀç·~©Î¬°¦X¹Ù¨Æ·~¤§¦X¹Ù¤HªÌ¡A¥Ó½Ðµn°O®É¡AÀ³ªþ°eªk©w¥N²z¤H¤§¦P·N®Ñ¡C<br> ¡@¡@ªk©w¥N²z¤H¦pµoı«e¶µ¦æ¬°¦³¤£³Ó¥ô±¡§Î¡AºM¾P¨ä¤¹³\©Î¥[¥H­­¨îªÌ¡AÀ³±N¨ä¨Æ¥Ñ¥Ó½Ð°Ó·~©Ò¦b¦a¥DºÞ¾÷Ãöµn°O¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤Q¤G±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@ªk©w¥N²z¤H¬°µL¦æ¬°¯à¤O¤H©Î­­¨î¦æ¬°¯à¤O¤H¸gÀç¤wµn°O¤§°Ó·~ªÌ¡A«hªk©w¥N²z¤H¬°°Ó·~­t³d¤H¡AÀ³©ó¤Q¤­¤é¤º¥Ó½Ðµn°O¡Aµn°O®ÉÀ³¥[¨ãªk©w¥N²z¤HÃÒ©ú¤å¥ó¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤Q¤T±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@¸g²z¤H¤§¥ô§K©Î½Õ°Ê¡AÀ³¦Û¨Æ¹êµo¥Í¤§¤é°_¤Q¤­¤é¤º¥Ó½Ðµn°O¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤Q¥|±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~¤§¤À¤ä¾÷ºc¡A¨ä¿W¥ß³]¸m±bïªÌ¡AÀ³¦Û³]¥ß¤§¤é°_¤Q¤­¤é¤º¡A±N¤U¦C¦U´Ú¨Æ¶µ¡A¦V¤À¤ä¾÷ºc©Ò¦b¦a¤§¥DºÞ¾÷Ãö¥Ó½Ðµn°O¡G<br> ¡@¡@¤@¡B¤À¤ä¾÷ºc¦WºÙ¡C<br> ¡@¡@¤G¡B¤À¤ä¾÷ºc©Ò¦b¦a¡C<br> ¡@¡@¤T¡B¤À¤ä¾÷ºc¸g²z¤H¤§©m¦W¡B¦í¡B©~©Ò¡B¨­¤ÀÃÒ©ú¤å¥ó¦r¸¹¡C<br> ¡@¡@¥|¡B¨ä¥L¸g¤¤¥¡¥DºÞ¾÷Ãö³W©w¤§¨Æ¶µ¡C<br> ¡@¡@«e¶µ¤À¤ä¾÷ºc²×¤îÀç·~®É¡AÀ³¦Û¨Æ¹êµo¥Í¤§¤é°_¤Q¤­¤é¤º¡A¦V¤À¤ä¾÷ºc©Ò¦b¦a¤§¥DºÞ¾÷Ãö¥Ó½Ð¼o¤îµn°O¡C<br> ¡@¡@¤À¤ä¾÷ºc©Ò¦b¦a¥DºÞ¾÷Ãö¨Ì«e¤G¶µ³W©w®Ö­ã©Î¼o¤îµn°O«á¡AÀ³¥H°Æ¥»§Û°e¥»°Ó·~©Ò¦b¦a¤§ª½ÁÒ¥«¬F©²©Î¿¤¡]¥«¡^¬F©²¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤Q¤­±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@µn°O¨Æ¶µ¦³Åܧó®É¡A°£Ä~©Ó¤§µn°OÀ³¦ÛÄ~©Ó¶}©l«á¤»­Ó¤ë¤º¬°¤§¥~¡AÀ³¦Û¨Æ¹êµo¥Í¤§¤é°_¤Q¤­¤é¤º¡A¥Ó½Ð¬°Åܧóµn°O¡C<br> ¡@¡@°Ó·~¤§¦UÃþµn°O¨Æ¶µ¡A¨ä¥Ó½Ðµ{§Ç¡BÀ³À˪þ¤§¤å¥ó¡B¸ê®Æ¤Î¨ä¥LÀ³¿í¦æ¨Æ¶µ¤§¿ìªk¡A¥Ñ¤¤¥¡¥DºÞ¾÷Ãö©w¤§¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤Q¤»±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~¾E²¾©ó­ìµn°O¾÷Ãö¤§ºÞÁÒ°Ï°ì¥H¥~®É¡AÀ³¦V¾E¤J°Ï°ì¤§¥DºÞ¾÷Ãö¥Ó½Ð¾E§}¤§µn°O¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤Q¤C±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~¼È°±Àç·~¤@­Ó¤ë¥H¤WªÌ¡AÀ³©ó°±·~«e¥Ó½Ð°±·~¤§µn°O¡A¨Ã©ó´_·~«e¥Ó½Ð´_·~¤§µn°O¡C¦ý¤w¨Ì¥[­È«¬¤Î«D¥[­È«¬Àç·~µ|ªk³W©w¥Ó³øªÌ¡A¤£¦b¦¹­­¡C<br> ¡@¡@«e¶µ°±·~´Á¶¡¡A³Ìªø¤£±o¶W¹L¤@¦~¡C¦ý¦³¥¿·í²z¥Ñ¡A¸g°Ó·~©Ò¦b¦a¥DºÞ¾÷Ãö®Ö­ãªÌ¡A¤£¦b¦¹­­¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤Q¤K±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~²×¤îÀç·~®É¡AÀ³¦Û¨Æ¹êµo¥Í¤§¤é°_¤Q¤­¤é¤º¡A¥Ó½Ð·²·~µn°O¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤Q¤E±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@¤wµn°O¤§¨Æ¶µ¡A©Ò¦b¦a¥DºÞ¾÷ÃöÀ³¤½§i¤§¡C<br> ¡@¡@¤½§i»Pµn°O¤£²ÅªÌ¡A¥Hµn°O¬°·Ç¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤G¤Q±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~³]¥ßµn°O«á¡A¦³À³µn°O¨Æ¶µ¦Ó¥¼µn°O¡A©Î¤wµn°O¨Æ¶µ¦³Åܧó¦Ó¥¼¬°Åܧ󤧵n°OªÌ¡A¤£±o¥H¨ä¨Æ¶µ¹ï§Üµ½·N²Ä¤T¤H¡C<br> ¡@¡@©ó¤À¤ä¾÷ºc©Ò¦b¦a¦³À³µn°O¨Æ¶µ¦Ó¥¼µn°O¡A©Î¤wµn°O¨Æ¶µ¦³Åܧó¦Ó¥¼¬°Åܧ󤧵n°OªÌ¡A«e¶µ³W©w¡A¶È´N¸Ó¤À¤ä¾÷ºc¾A¥Î¤§¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤G¤Q¤@±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~¤§µn°O¡A¦p¨Ì¨ä¥Lªk«ß¤§³W©w¡A¶·¿ì²z¥LºØµn°OªÌ¡AÀ³¹ê¬I²Î¤@µoÃÒ¡F¨ä¿ìªk¥Ñ¦æ¬F°|©w¤§¡C<br> ¡@¡@µn°OÃҥѤ¤¥¡¥DºÞ¾÷Ãö³W©w®æ¦¡¡A¥Ñ¦U¦a¤è¥DºÞ¾÷Ãö¦Û¦æ¦L»s¡C<br> ¡@¡@«e¤G¶µ³W©w¤§¬I¦æ´Á­­¡A¥Ñ¦æ¬F°|©w¤§¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤G¤Q¤G±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~©Ò¦b¦a¥DºÞ¾÷Ãö¹ï©ó°Ó·~µn°O¤§¥Ó½Ð¡A»{¦³¹H¤Ïªk¥O©Î¤£¦Xªk©wµ{¦¡ªÌ¡AÀ³¦Û¦¬¤å¤§¤é°_¤­¤é¤º³qª¾¸É¥¿¡A¨äÀ³¦æ¸É¥¿¨Æ¶µ¡AÀ³¤@¦¸³qª¾¤§¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤G¤Q¤T±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~©Ò¦b¦a¥DºÞ¾÷Ãö¿ì²z°Ó·~µn°O®×¥ó¤§´Á¶¡¡A¦Û¦¬¥ó¤§¤é°_¦Ü®Ö­ãµn°O¤§¤é¤î¡A¤£±o¹O¤C¤é¡C¦ý¨Ì«e±ø³W©w³qª¾¸É¥¿´Á¶¡¡A¤£­p¦b¤º¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤G¤Q¥|±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~µn°O«á¡A¥Ó½Ð¤Hµo²{¨äµn°O¨Æ¶µ¦³¿ù»~©Î¿òº|®É¡A±o¥Ó½Ð§ó¥¿¡F¥²­n®É¨ÃÀ³À˨ãÃÒ©ú¤å¥ó¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤G¤Q¤­±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~­t³d¤H©Î§Q®`Ãö«Y¤H¡A±o½Ð¨D°Ó·~©Ò¦b¦a¥DºÞ¾÷Ãö´N¤wµn°O¨Æ¶µµoµ¹ÃÒ©ú®Ñ¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤G¤Q¤»±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~­t³d¤H©Î§Q®`Ãö«Y¤H¡A±o±Ô©ú²z¥Ñ¡A¦V°Ó·~©Ò¦b¦a¥DºÞ¾÷Ãö½Ð¨D¬d¾\©Î§Û¿ýµn°Oï¤Î¨äªþÄݤå¥ó¡C¦ýÅãµL¥²­nªÌ¡A°Ó·~©Ò¦b¦a¥DºÞ¾÷Ãö±o©Úµ´§Û¾\©Î­­¨î¨ä§Û¾\½d³ò¡C<br> ¡@¡@°Ó·~¤§¤U¦Cµn°O¨Æ¶µ¡A¨ä©Ò¦b¦a¥DºÞ¾÷ÃöÀ³¤½¶}©ó¸ê°Tºô¯¸¡A¥H¨Ñ¬d¾\¡G<br> ¡@¡@¤@¡B¦WºÙ¡C<br> ¡@¡@¤G¡B²Õ´¡C<br> ¡@¡@¤T¡B©ÒÀç·~°È¡C<br> ¡@¡@¥|¡B¸ê¥»ÃB¡C<br> ¡@¡@¤­¡B©Ò¦b¦a¡C<br> ¡@¡@¤»¡B­t³d¤H¤§©m¦W¡C<br> ¡@¡@¤C¡B¦X¹Ù²Õ´ªÌ¡A¨ä¦X¹Ù¤H¤§©m¦W¡C<br> ¡@¡@¤K¡B¤À¤ä¾÷ºc¤§¦WºÙ¡B©Ò¦b¦a¤Î¸g²z¤H¤§©m¦W¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤G¤Q¤C±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~¤§¦WºÙ¡A±o¥H¨ä­t³d¤H©m¦W©Î¨ä¥L¦WºÙ¥R¤§¡C¦ý¤£±o¨Ï¥Î©ö©ó¨Ï¤H»~»{¬°»P¬F©²¾÷Ãö©Î¤½¯q¹ÎÅ馳Ãö¤§¦WºÙ¡C¥H¦X¹Ù¤H¤§©m©Î©m¦W¬°°Ó·~¦WºÙªÌ¡A¸Ó¦X¹Ù¤H°h¹Ù¡A¦p¤´¥Î¨ä©m©Î©m¦W¬°°Ó·~¦WºÙ®É¡A¶·±o¨ä¦P·N¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤G¤Q¤K±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~¦b¦P¤@ª½ÁÒ¥«©Î¿¤¡]¥«¡^¡A¤£±o¨Ï¥Î¬Û¦P©ÎÃþ¦ü¥L¤H¤wµn°O¤§°Ó¸¹¦WºÙ¡A¸gÀç¦PÃþ·~°È¡C¦ý²K³]¤À¤ä¾÷ºc©ó¥Lª½ÁÒ¥«©Î¿¤¡]¥«¡^¡Aªþ°O¨¬¥Hªí¥Ü¨ä¬°¤À¤ä¾÷ºc¤§©ú½T¦r¼ËªÌ¡A¤£¦b¦¹­­¡C<br> ¡@¡@°Ó¸¹¤§¦WºÙ¡A°£¤£±o¨Ï¥Î¤½¥q¦r¼Ë¥~¡A¦p»P¤½¥q¦WºÙ¬Û¦P©ÎÃþ¦ü®É¡A¤£¨ü«e¶µ³W©w¤§­­¨î¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤G¤Q¤E±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~¦³¤U¦C±¡¨Æ¤§¤@ªÌ¡A¨ä©Ò¦b¦a¥DºÞ¾÷Ãö±o¨Ì¾Åv¡BÀ˹î¾÷Ãö³qª¾©Î§Q®`Ãö«Y¤H¥Ó½Ð¡AºM¾P©Î¼o¤î¨ä°Ó·~µn°O©Î³¡¤Àµn°O¨Æ¶µ¡G<br> ¡@¡@¤@¡Bµn°O¨Æ¶µ¦³°°³y¡BÅܳy¤å®Ñ¡A¸g¦³¸o§P¨M½T©w¡C<br> ¡@¡@¤G¡Bµn°O«áº¡¤»­Ó¤ë©|¥¼¶}©lÀç·~¡A©Î¶}©lÀç·~«á¦Û¦æ°±¤îÀç·~¤»­Ó¤ë¥H¤W¡C<br> ¡@¡@¤T¡B¾EÂ÷­ì§}¡A¹O¤»­Ó¤ë¥¼¥Ó½ÐÅܧóµn°O¡A¸g°Ó·~©Ò¦b¦a¥DºÞ¾÷Ãö³qª¾¤´¥¼¿ì²z¡C<br> ¡@¡@¥|¡Bµn°O«á¸g¦³Ãö¾÷Ãö½Õ¬d¡Aµo²{µLÀç·~¸ñ¶H¡A¨Ã¸g©Ð«Î©Ò¦³Åv¤HÃÒ©úµL¯²­É©Ð«Î±¡¨Æ¡C<br> ¡@¡@«e¶µ²Ä¤G´Ú©Ò©w´Á­­¡A¦p¦³¥¿·í¨Æ¥Ñ¡A±o¥Ó½Ð­ã¤©©µ®i¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤T¤Q±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@¥Ó½Ðµn°O¨Æ¶µ¦³µê°°±¡¨ÆªÌ¡A¨ä°Ó·~­t³d¤H³B·s»O¹ô¤»¤d¤¸¥H¤W¤T¸U¤¸¥H¤U»@Áì¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤T¤Q¤@±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@¥¼¸g³]¥ßµn°O¦Ó¥H°Ó·~¦W¸q¸gÀç·~°È©Î¬°¨ä¥Lªk«ß¦æ¬°ªÌ¡A°Ó·~©Ò¦b¦a¥DºÞ¾÷ÃöÀ³©R¦æ¬°¤H­­´Á¿ì§´µn°O¡F©¡´Á¥¼¿ì§´ªÌ¡A³B·s»O¹ô¤@¸U¤¸¥H¤W¤­¸U¤¸¥H¤U»@Áì¡A¨Ã±o«ö¦¸³sÄò³B»@¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤T¤Q¤G±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°£«e±ø³W©w¥~¡A¨ä¥L¦³À³µn°O¨Æ¶µ¦Ó¤£µn°OªÌ¡A¨ä°Ó·~­t³d¤H³B·s»O¹ô¤G¤d¤¸¥H¤W¤@¸U¤¸¥H¤U»@Áì¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤T¤Q¤T±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@¹O²Ä¤Q¤G±ø¦Ü²Ä¤Q¤­±ø³W©w¥Ó½Ðµn°O¤§´Á­­ªÌ¡A¨ä°Ó·~­t³d¤H³B·s»O¹ô¤@¤d¤¸¥H¤W¤­¤d¤¸¥H¤U»@Áì¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤T¤Q¥|±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~­t³d¤H©Î¨ä±q·~¤H­û¹H¤Ï²Ä¤E±ø²Ä¤G¶µ³W©w¡A³WÁסB§«Ãª©Î©Úµ´°Ó·~©Ò¦b¦a¥DºÞ¾÷Ãö¤H­û©â¬dªÌ¡A¨ä°Ó·~­t³d¤H³B·s»O¹ô¤»¤d¤¸¥H¤W¤T¸U¤¸¥H¤U»@Áì¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤T¤Q¤­±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@°Ó·~©Ò¦b¦a¥DºÞ¾÷Ãö¨Ì¥»ªk¨ü²z°Ó·~¦WºÙ¤Î©ÒÀç·~°È¹w¬d¡Bµn°O¡B¬d¾\¡B§Û¿ý¤Î¦UºØÃÒ©ú®Ñ¡AÀ³¦¬¨ú¼f¬d¶O¡Bµn°O¶O¡B¬d¾\¶O¡B§Û¿ý¶O¤ÎÃÒ·Ó¶O¡F¨ä¶OÃB¡A¥Ñ¤¤¥¡¥DºÞ¾÷Ãö©w¤§¡C<br> ¡@¡@°±·~µn°O¡B´_·~µn°O¡B·²·~µn°O¡A§Kúµn°O¶O¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤T¤Q¤»±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@¥»ªk¬I¦æ²Ó«h¡A¥Ñ¤¤¥¡¥DºÞ¾÷Ãö©w¤§¡C<br> </td> </table> </table> </table> <table><tr><td>&nbsp;&nbsp;&nbsp;</td><td><font color=8000ff>²Ä¤T¤Q¤C±ø</font> </font> <table><tr><td>&nbsp;&nbsp;&nbsp;&nbsp;</td> <td> ¡@¡@¥»ªk¦Û¤½¥¬¤é¬I¦æ¡C¦ý²Ä¤Q¤­±ø²Ä¤G¶µ¡B²Ä¤G¤Q¤T±ø¡B²Ä¤G¤Q¤»±ø²Ä¤G¶µ¤§¬I¦æ¤é´Á¡A¥Ñ¦æ¬F°|©w¤§¡C<br> </td> </table> </table> </table> </left> </body> <!-- Mirrored from lis.ly.gov.tw/lghtml/lawstat/version2/01933/0193396121800.htm by HTTrack Website Copier/3.x [XR&CO'2010], Sun, 24 Mar 2013 09:16:48 GMT --> </html>
// Copyright 2014 The Chromium Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #ifndef COMPONENTS_TRANSLATE_CORE_BROWSER_TRANSLATE_CLIENT_H_ #define COMPONENTS_TRANSLATE_CORE_BROWSER_TRANSLATE_CLIENT_H_ #include <memory> #include <string> #include "base/memory/ref_counted.h" #include "build/build_config.h" #include "components/translate/core/browser/translate_prefs.h" #include "components/translate/core/browser/translate_step.h" #include "components/translate/core/common/translate_errors.h" class GURL; class PrefService; namespace infobars { class InfoBar; } // namespace infobars namespace translate { class TranslateAcceptLanguages; class TranslateDriver; class TranslateInfoBarDelegate; // A client interface that needs to be supplied to TranslateManager by the // embedder. // // Each client instance is associated with a given context within which a // TranslateManager is used (e.g. a single tab). class TranslateClient { public: virtual ~TranslateClient() {} // Gets the TranslateDriver associated with the client. virtual TranslateDriver* GetTranslateDriver() = 0; // Returns the associated PrefService. virtual PrefService* GetPrefs() = 0; // Returns the associated TranslatePrefs. virtual std::unique_ptr<TranslatePrefs> GetTranslatePrefs() = 0; // Returns the associated TranslateAcceptLanguages. virtual TranslateAcceptLanguages* GetTranslateAcceptLanguages() = 0; #if defined(OS_ANDROID) || defined(OS_IOS) // Returns a translate infobar that owns |delegate|. virtual std::unique_ptr<infobars::InfoBar> CreateInfoBar( std::unique_ptr<TranslateInfoBarDelegate> delegate) const = 0; // Returns the resource ID of the icon to be shown for the Translate infobars. virtual int GetInfobarIconID() const = 0; #endif // Called when the embedder should present UI to the user corresponding to the // user's current |step|. Returns false if the method decided not to show the // UI (e.g. because of TranslateRanker overrides, or same-language // navigation). virtual bool ShowTranslateUI(translate::TranslateStep step, const std::string& source_language, const std::string& target_language, TranslateErrors::Type error_type, bool triggered_from_menu) = 0; // Returns true if the URL can be translated. virtual bool IsTranslatableURL(const GURL& url) = 0; // Returns if AutofillAssistant is running. Translation should be disabled // while AutofillAssistant is running. virtual bool IsAutofillAssistantRunning() const = 0; }; } // namespace translate #endif // COMPONENTS_TRANSLATE_CORE_BROWSER_TRANSLATE_CLIENT_H_
Keep all those worn out brushes or those that have spread because they were not cleaned properly, or those that have some parts of the brush welded together with hardened paint. These brushes are great for creating the interesting random marks you might need for such things like the painting of grass with acrylic/oil paint or creating interesting textures or patterns. Don’t forget the other end of the brush also. The wooden bit is useful for creating those tiny branches at the end of trees when using watercolour. Use a small blob of water colour at the end of the branch and drag it out with the wooden end of the brush, twiddle it a bit to make it look good! Painting grasses and random flowers in a landscape can be tricky, but here are a couple of ideas that might help. Cut a piece from an old pair of corduroy trousers and make a simple pad from it, making sure the lines are not striaght. Dab on some colour and dab the pad on the canvas/board/paper and instant grass. This can produce rather organised grass which would not be suitable if you are after realism. A more random method is get a length of string paint it and and slap in on the canvas, it can create some interesting effects. If you tie a knot in the end of the string and paint the knot liberally in red and the string in green flick in onto the canvas and you have instant poppies. More in the Monet style than Andrew Wyeth, who? He died recently at the age of 91, he was a great realist painter. Google him!
The Alumni Association will host the 26th Annual ESF Golf Tournament at The Pompey Club in Jamesville, NY. The Pompey Club is a championship course offering challenging play with stunning views of the surrounding Butternut Creek Valley. Sponsors qualify for one to four free golfers (depending on the level), and they will be acknowledged on our website and at the tournament throughout the day. Whether you hit the green in two or ten, our captain-and-crew format keeps play challenging and entertaining for all. Enjoy a wonderful day on the links while supporting student scholarships at ESF — all tournament proceeds help fund the Alumni Association Memorial Scholarship in recognition of ESF alumni who gave their lives in service to their country. We hope that you'll mark your calendars now and make plans to join us!
Thank you for visiting the SIM USA, Inc. (“SIM”) web site (the “Site”). This page sets out the terms and conditions (“Terms and Conditions”) which govern use of the Site and compliance with these rules is a condition of use. All content included on the Site (including, without limitation, text, graphics, logos, button icons, images, audio clips, digital downloads, data compilations, and software) (the “Site Content”), and the compilation of all such Site Content on the Site, is the property of SIM or its content suppliers and may be protected by United States and international copyright laws. You may not frame or utilize framing techniques to enclose any name, trademarks, service marks, Site Content, or other proprietary information of SIM without the express written consent of SIM. All trademarks not owned by SIM or its subsidiaries that appear on the Site are the property of their respective owners, who may or may not be affiliated with, connected to, or sponsored by SIM or its subsidiaries. Although SIM attempts to ensure the integrity and accurateness of the Site, it makes no guarantees whatsoever as to the correctness or accuracy of the Site. It is possible that the Site could include typographical errors, inaccuracies or other errors, and that unauthorized additions, deletions, and alterations could be made to the Site by third parties. In the event that an inaccuracy arises, please inform SIM so that it can be corrected. Information contained on the Site may be changed or updated without notice. SIM DOES NOT WARRANT THAT ACCESS TO OR USE OF THE SITE WILL BE UNINTERRUPTED OR ERROR-FREE OR THAT DEFECTS IN THE SITE WILL BE CORRECTED. THE SITE, INCLUDING ANY SITE CONTENT OR OTHER INFORMATION CONTAINED WITHIN IT OR ANY SITE-RELATED SERVICE, IS PROVIDED “AS IS,” WITH ALL FAULTS, WITH NO REPRESENTATIONS OR WARRANTIES OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, QUALITY OF INFORMATION, QUIET ENJOYMENT, AND TITLE/NONINFRINGEMENT. SIM SPECIFICALLY DISCLAIMS ALL LIABILITY FOR ERRORS OR OMISSIONS IN, OR THE MISUSE OR MISINTERPRETATION OF, ANY INFORMATION OBTAINED THROUGH THE SITE. SIM DOES NOT WARRANT THE ACCURACY, COMPLETENESS OR TIMELINESS OF THE INFORMATION OBTAINED THROUGH THE SITE. YOU ASSUME TOTAL RESPONSIBILITY AND RISK FOR YOUR USE OF THE SITE, SITE-RELATED SERVICES, AND HYPERLINKED WEB SITES. CERTAIN STATE LAWS DO NOT ALLOW LIMITATIONS ON IMPLIED WARRANTIES. IF THESE LAWS APPLY TO YOU, SOME OR ALL OF THE ABOVE DISCLAIMERS, EXCLUSIONS, OR LIMITATIONS MAY NOT APPLY TO YOU, AND YOU MAY HAVE ADDITIONAL RIGHTS. SIM DOES NOT WARRANT THAT FILES AVAILABLE FOR DOWNLOAD WILL BE FREE OF VIRUSES, WORMS, TROJAN HORSES, OR OTHER DESTRUCTIVE PROGRAMMING. YOU ARE RESPONSIBLE FOR IMPLEMENTING PROCEDURES SUFFICIENT TO SATISFY YOUR NEEDS FOR DATA BACK UP AND SECURITY. YOU AGREE THAT SIM SHALL NOT BE LIABLE FOR ANY COST OR DAMAGE ARISING DIRECTLY OF INDIRECTLY FROM ANY SUCH CODE. YOU ASSUME TOTAL RESPONSIBILITY AND RISK FOR YOUR USE OF THE SITE AND OF THE INTERNET. SIM AND ANY THIRD PARTIES MENTIONED ON THE SITE ARE NEITHER RESPONSIBLE NOR LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, CONSEQUENTIAL, SPECIAL, EXEMPLARY, PUNITIVE, OR OTHER DAMAGES WHATSOEVER (INCLUDING, WITHOUT LIMITATION, THOSE RESULTING FROM LOST PROFITS, LOST DATA, OR BUSINESS INTERRUPTION) ARISING OUT OF OR RELATING IN ANY WAY TO THE SITE, SITE-RELATED SERVICES, SITE CONTENT OR OTHER INFORMATION CONTAINED WITHIN THE SITE, AND/OR ANY HYPERLINKED WEB SITE, WHETHER BASED ON WARRANTY, CONTRACT, TORT, OR ANY OTHER LEGAL THEORY AND WHETHER OR NOT ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. YOUR SOLE REMEDY FOR DISSATISFACTION WITH THE SITE, SITE-RELATED SERVICES, AND/OR HYPERLINKED WEB SITES IS TO STOP USING THE SITE AND/OR THOSE SERVICES. CERTAIN STATE LAWS DO NOT ALLOW LIMITATIONS ON IMPLIED WARRANTIES. IF THESE LAWS APPLY TO YOU, SOME OR ALL OF THE ABOVE DISCLAIMERS, EXCLUSIONS, OR LIMITATIONS MAY NOT APPLY TO YOU, AND YOU MIGHT HAVE ADDITIONAL RIGHTS. The Site may contain links to websites operated by parties other than SIM. Such links are provided for the users’ convenience only. Their inclusion does not imply any endorsement of the linked site or any association with its operators. Such websites are not under the control of SIM, and as such, SIM is not responsible for their contents, including without limitation any link contained in them, or any changes or updates to them. SIM is not responsible for any form of transmission received from such websites. SIM is not responsible for the terms, conditions and policies of such websites. You are encouraged to review the terms, conditions, and privacy statements of such websites so that you can know how those websites collect, use and share your information. You are solely responsible for evaluating the accuracy and completeness of any information contained on third party websites, and also the value and integrity of any goods and services offered by such websites. Your sole remedy for dissatisfaction with the site, site related services, and/or hyperlinked websites, is to stop using the site and/or those services. Certain state laws do not allow limitations on implied warranties. If these laws apply to you, some or all of the above disclaimers, exclusions or limitations may not apply to you, and you may have additional rights. It is up to you to take precautions to ensure that whatever you select for your use or download is free of such items as viruses, worms, Trojan horses, and other items of a destructive nature. If you decide to access any of the third party sites linked to the Site, you do this entirely at your own risk.
# -*- coding: utf-8 -*- # This file is part of Shoop. # # Copyright (c) 2012-2015, Shoop Ltd. All rights reserved. # # This source code is licensed under the AGPLv3 license found in the # LICENSE file in the root directory of this source tree. from __future__ import unicode_literals from abc import abstractmethod import six from django.utils.encoding import force_text from django.utils.text import camel_case_to_spaces from jinja2.exceptions import TemplateError from shoop.apps.provides import get_identifier_to_object_map from shoop.notify.enums import ( ConstantUse, TemplateUse, UNILINGUAL_TEMPLATE_LANGUAGE ) from shoop.notify.template import render_in_context, Template from shoop.utils.text import snake_case, space_case from .typology import Type class BaseMetaclass(type): def __new__(cls, name, bases, namespace): variables = [] bindings = [] for key in list(namespace.keys()): value = namespace[key] if isinstance(value, Binding): dest_list = bindings elif isinstance(value, Variable): dest_list = variables else: dest_list = None if dest_list is not None: dest_list.append((key, value)) del namespace[key] namespace.setdefault("variables", {}).update(variables) namespace.setdefault("bindings", {}).update(bindings) # Figure out some sane defaults if "identifier" not in namespace: namespace["identifier"] = snake_case(camel_case_to_spaces(name)) if namespace.get("identifier") and not namespace.get("name"): namespace["name"] = space_case(namespace["identifier"]).title() return type.__new__(cls, name, bases, namespace) class Variable(object): _creation_counter = 0 # For sorting, incremented by `__init__` def __init__(self, name, type=Type, required=True, help_text=""): self.position = Variable._creation_counter Variable._creation_counter += 1 if callable(type): type = type() assert isinstance(type, Type), "`type` must be a Type instance" assert isinstance(required, bool), "`required` must be a bool (it's %r)" % required self.name = name self.type = type self.required = bool(required) self.help_text = help_text def get_matching_types(self, variable_dict): return set( name for name, variable in six.iteritems(variable_dict) if self.type.is_coercible_from(variable.type) ) class Binding(Variable): def __init__(self, name, type=Type, required=False, help_text="", constant_use=ConstantUse.VARIABLE_ONLY, default=None): super(Binding, self).__init__(name=name, type=type, required=required, help_text=help_text) self.constant_use = constant_use self.default = default @property def accepts_any_type(self): return (not self.type.identifier) @property def allow_constant(self): return self.constant_use in (ConstantUse.CONSTANT_ONLY, ConstantUse.VARIABLE_OR_CONSTANT) @property def allow_variable(self): return self.constant_use in (ConstantUse.VARIABLE_ONLY, ConstantUse.VARIABLE_OR_CONSTANT) def get_value(self, context, bind_data): if bind_data: assert isinstance(bind_data, dict), "invalid bind data" if self.allow_constant and "constant" in bind_data: return self.type.unserialize(bind_data["constant"]) if self.allow_variable and "variable" in bind_data: return context.get(bind_data["variable"], self.default) return self.default class TemplatedBinding(Binding): def __init__(self, *args, **kwargs): super(TemplatedBinding, self).__init__(*args, **kwargs) if self.allow_variable: raise ValueError("TemplatedBindings may not allow variable binding for security reasons") def get_value(self, context, bind_data): value = super(TemplatedBinding, self).get_value(context, bind_data) try: return render_in_context(context, value) except TemplateError: # Return the unrendered value if there was template trouble. return value class Base(six.with_metaclass(BaseMetaclass)): identifier = None name = None description = None variables = {} # Filled by the metaclass bindings = {} # Filled by the metaclass provide_category = None @classmethod def class_for_identifier(cls, identifier): return get_identifier_to_object_map(cls.provide_category).get(identifier) class Event(Base): provide_category = "notify_event" identifier = None #: The name of the variable to be used as the log target for this event. #: #: The target variable must have an `add_log_entry` method. log_target_variable = None def __init__(self, **variable_values): if not self.identifier: raise ValueError("Attempting to instantiate identifierless event") self.variable_values = {} self.load_variables(variable_values) @property def log_target(self): return self.variable_values.get(self.log_target_variable) def load_variables(self, variable_values): for key in sorted(variable_values.keys()): variable = self.variables.get(key) if not variable: raise ValueError("Unknown variable %r for event %s" % (key, self.identifier)) self.variable_values[key] = variable.type.unserialize(variable_values.pop(key)) for name, variable in six.iteritems(self.variables): if variable.required and name not in self.variable_values: raise ValueError("Required variable %r missing for event %s" % (name, self.identifier)) def run(self): from .runner import run_event run_event(event=self) class ScriptItem(Base): provide_category = None def __init__(self, data, validate=True): if not self.identifier: # pragma: no cover raise ValueError("Attempting to initialize %s without identifier: %r" % (self.__class__.__name__, self)) self.data = data if validate: self.verify_bindings() def verify_bindings(self): unbound = set() for name, binding in six.iteritems(self.bindings): if binding.required and name not in self.data: unbound.add(name) if unbound: raise ValueError("Bindings unbound for %r: %r" % (self.identifier, unbound)) def get_value(self, context, binding_name): """ Get the actual value of a binding from the given script context. :param context: Script Context :type context: shoop.notify.script.Context :param binding_name: Binding name. :type binding_name: str :return: The variable value """ binding = self.bindings[binding_name] bind_data = self.data.get(binding_name) return binding.get_value(context, bind_data) def get_values(self, context): """ Get all binding values in a dict. :param context: Script Context :type context: shoop.notify.script.Context :return: Dict of binding name -> value :rtype: dict[name, value] """ return dict((binding_name, self.get_value(context, binding_name)) for binding_name in self.bindings) @classmethod def unserialize(cls, data, validate=True): data = data.copy() obj_cls = cls.class_for_identifier(data.pop("identifier")) assert issubclass(obj_cls, cls) return obj_cls(data, validate=validate) def serialize(self): data = dict(identifier=self.identifier) data.update(**self.data) return data def __eq__(self, other): return self.identifier == other.identifier and self.data == other.data def __ne__(self, other): return not self.__eq__(other) @classmethod def get_ui_info_map(cls): map = {} for identifier, object in six.iteritems(get_identifier_to_object_map(cls.provide_category)): map[identifier] = { "identifier": str(identifier), "name": force_text(object.name), "description": force_text(getattr(object, "description", None) or ""), } return map class Condition(ScriptItem): provide_category = "notify_condition" @abstractmethod def test(self, context): return False # pragma: no cover class Action(ScriptItem): provide_category = "notify_action" template_use = TemplateUse.NONE template_fields = {} @abstractmethod def execute(self, context): """ :param context: Script Context :type context: shoop.notify.script.Context """ pass # pragma: no cover def get_template(self, context): """ Get this action's template instance, bound in the context. :rtype: shoop.notify.template.Template """ data = self.data.get("template_data") if not data: raise ValueError("No template data in action") return Template(context, data=data) def get_template_values(self, context, language_preferences=()): """ Render this Action's template with data from the given context. :param context: Script Context :type context: shoop.notify.script.Context :param language_preferences: Language preference list. The first language in the template to have values for all fields will be used. Has no effect for UNILINGUAL template_use. :type language_preferences: list[str] :return: Dict of field name -> rendered template text. :rtype: dict[str, str]|None """ if self.template_use == TemplateUse.NONE: raise ValueError("Attempting to `get_template_values` on an action with no template use") template = self.get_template(context) fields = self.template_fields.keys() if self.template_use == TemplateUse.UNILINGUAL: language_preferences = [UNILINGUAL_TEMPLATE_LANGUAGE] return template.render_first_match(language_preferences, fields)
<?php $updates['u0055'] = array( 'to_version' => 'u0056', 'name' => 'added cleanup users_games', 'description' => 'added cleanup users_games', ); function update_u0055($conn) { $stmt_games = $conn->prepare('SELECT id, title FROM games'); $stmt_games->execute(); $games = []; while ($row_games = $stmt_games->fetch()) { $games[intval($row_games['id'])] = $row_games['title']; } $stmt_users_games = $conn->prepare('SELECT id, gameid FROM users_games'); $stmt_users_games->execute(); while ($row = $stmt_users_games->fetch()) { $id = intval($row['id']); $gameid = intval($row['gameid']); if (!isset($games[$gameid])) { $conn->prepare('DELETE FROM users_games WHERE id = ?')->execute(array($id)); } } return true; }
<a href='https://github.com/angular/angular.js/edit/v1.3.x/?message=docs(error%2FngOptions)%3A%20describe%20your%20change...' class='improve-docs btn btn-primary'><i class="glyphicon glyphicon-edit">&nbsp;</i>Improve this Doc</a> <h1>ngOptions</h1> <div class="description"> Here are the list of errors in the ngOptions namespace. </div> <div class="component-breakdown"> <div> <table class="definition-table"> <tr> <th>Name</th> <th>Description</th> </tr> <tr> <td><a href="error/ngOptions/iexp">iexp</td> <td>Invalid Expression</td> </tr> <tr> <td><a href="error/ngOptions/trkslct">trkslct</td> <td>Comprehension expression cannot contain both `select as` and `track by` expressions.</td> </tr> </table> </div> </div>
using System; using System.Globalization; using System.Windows; using System.Windows.Data; namespace HttpFuzzer.Gui.Helpers { [Localizability(LocalizationCategory.NeverLocalize)] public class BooleanToVisibilityInverseConverter : IValueConverter { public object Convert(object value, Type targetType, object parameter, CultureInfo culture) { bool bValue = false; if (value is bool) { bValue = (bool)value; } else if (value is Nullable<bool>) { Nullable<bool> tmp = (Nullable<bool>)value; bValue = tmp.HasValue ? tmp.Value : false; } return (bValue) ? Visibility.Collapsed : Visibility.Visible; } public object ConvertBack(object value, Type targetType, object parameter, CultureInfo culture) { if (value is Visibility) { return (Visibility)value != Visibility.Visible; } else { return true; } } } }
/* * Copyright 2010-2017 Amazon.com, Inc. or its affiliates. All Rights Reserved. * * Licensed under the Apache License, Version 2.0 (the "License"). * You may not use this file except in compliance with the License. * A copy of the License is located at * * http://aws.amazon.com/apache2.0 * * or in the "license" file accompanying this file. This file is distributed * on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either * express or implied. See the License for the specific language governing * permissions and limitations under the License. */ #pragma once #include <aws/elasticloadbalancingv2/ElasticLoadBalancingv2_EXPORTS.h> #include <aws/elasticloadbalancingv2/ElasticLoadBalancingv2Request.h> #include <aws/core/utils/memory/stl/AWSString.h> #include <aws/core/utils/memory/stl/AWSVector.h> #include <aws/elasticloadbalancingv2/model/LoadBalancerSchemeEnum.h> #include <aws/elasticloadbalancingv2/model/LoadBalancerTypeEnum.h> #include <aws/elasticloadbalancingv2/model/IpAddressType.h> #include <aws/elasticloadbalancingv2/model/SubnetMapping.h> #include <aws/elasticloadbalancingv2/model/Tag.h> #include <utility> namespace Aws { namespace ElasticLoadBalancingv2 { namespace Model { /** */ class AWS_ELASTICLOADBALANCINGV2_API CreateLoadBalancerRequest : public ElasticLoadBalancingv2Request { public: CreateLoadBalancerRequest(); // Service request name is the Operation name which will send this request out, // each operation should has unique request name, so that we can get operation's name from this request. // Note: this is not true for response, multiple operations may have the same response name, // so we can not get operation's name from response. inline virtual const char* GetServiceRequestName() const override { return "CreateLoadBalancer"; } Aws::String SerializePayload() const override; protected: void DumpBodyToUrl(Aws::Http::URI& uri ) const override; public: /** * <p>The name of the load balancer.</p> <p>This name must be unique per region per * account, can have a maximum of 32 characters, must contain only alphanumeric * characters or hyphens, must not begin or end with a hyphen, and must not begin * with "internal-".</p> */ inline const Aws::String& GetName() const{ return m_name; } /** * <p>The name of the load balancer.</p> <p>This name must be unique per region per * account, can have a maximum of 32 characters, must contain only alphanumeric * characters or hyphens, must not begin or end with a hyphen, and must not begin * with "internal-".</p> */ inline bool NameHasBeenSet() const { return m_nameHasBeenSet; } /** * <p>The name of the load balancer.</p> <p>This name must be unique per region per * account, can have a maximum of 32 characters, must contain only alphanumeric * characters or hyphens, must not begin or end with a hyphen, and must not begin * with "internal-".</p> */ inline void SetName(const Aws::String& value) { m_nameHasBeenSet = true; m_name = value; } /** * <p>The name of the load balancer.</p> <p>This name must be unique per region per * account, can have a maximum of 32 characters, must contain only alphanumeric * characters or hyphens, must not begin or end with a hyphen, and must not begin * with "internal-".</p> */ inline void SetName(Aws::String&& value) { m_nameHasBeenSet = true; m_name = std::move(value); } /** * <p>The name of the load balancer.</p> <p>This name must be unique per region per * account, can have a maximum of 32 characters, must contain only alphanumeric * characters or hyphens, must not begin or end with a hyphen, and must not begin * with "internal-".</p> */ inline void SetName(const char* value) { m_nameHasBeenSet = true; m_name.assign(value); } /** * <p>The name of the load balancer.</p> <p>This name must be unique per region per * account, can have a maximum of 32 characters, must contain only alphanumeric * characters or hyphens, must not begin or end with a hyphen, and must not begin * with "internal-".</p> */ inline CreateLoadBalancerRequest& WithName(const Aws::String& value) { SetName(value); return *this;} /** * <p>The name of the load balancer.</p> <p>This name must be unique per region per * account, can have a maximum of 32 characters, must contain only alphanumeric * characters or hyphens, must not begin or end with a hyphen, and must not begin * with "internal-".</p> */ inline CreateLoadBalancerRequest& WithName(Aws::String&& value) { SetName(std::move(value)); return *this;} /** * <p>The name of the load balancer.</p> <p>This name must be unique per region per * account, can have a maximum of 32 characters, must contain only alphanumeric * characters or hyphens, must not begin or end with a hyphen, and must not begin * with "internal-".</p> */ inline CreateLoadBalancerRequest& WithName(const char* value) { SetName(value); return *this;} /** * <p>The IDs of the public subnets. You can specify only one subnet per * Availability Zone. You must specify either subnets or subnet mappings.</p> * <p>[Application Load Balancers] You must specify subnets from at least two * Availability Zones.</p> <p>[Network Load Balancers] You can specify subnets from * one or more Availability Zones.</p> */ inline const Aws::Vector<Aws::String>& GetSubnets() const{ return m_subnets; } /** * <p>The IDs of the public subnets. You can specify only one subnet per * Availability Zone. You must specify either subnets or subnet mappings.</p> * <p>[Application Load Balancers] You must specify subnets from at least two * Availability Zones.</p> <p>[Network Load Balancers] You can specify subnets from * one or more Availability Zones.</p> */ inline bool SubnetsHasBeenSet() const { return m_subnetsHasBeenSet; } /** * <p>The IDs of the public subnets. You can specify only one subnet per * Availability Zone. You must specify either subnets or subnet mappings.</p> * <p>[Application Load Balancers] You must specify subnets from at least two * Availability Zones.</p> <p>[Network Load Balancers] You can specify subnets from * one or more Availability Zones.</p> */ inline void SetSubnets(const Aws::Vector<Aws::String>& value) { m_subnetsHasBeenSet = true; m_subnets = value; } /** * <p>The IDs of the public subnets. You can specify only one subnet per * Availability Zone. You must specify either subnets or subnet mappings.</p> * <p>[Application Load Balancers] You must specify subnets from at least two * Availability Zones.</p> <p>[Network Load Balancers] You can specify subnets from * one or more Availability Zones.</p> */ inline void SetSubnets(Aws::Vector<Aws::String>&& value) { m_subnetsHasBeenSet = true; m_subnets = std::move(value); } /** * <p>The IDs of the public subnets. You can specify only one subnet per * Availability Zone. You must specify either subnets or subnet mappings.</p> * <p>[Application Load Balancers] You must specify subnets from at least two * Availability Zones.</p> <p>[Network Load Balancers] You can specify subnets from * one or more Availability Zones.</p> */ inline CreateLoadBalancerRequest& WithSubnets(const Aws::Vector<Aws::String>& value) { SetSubnets(value); return *this;} /** * <p>The IDs of the public subnets. You can specify only one subnet per * Availability Zone. You must specify either subnets or subnet mappings.</p> * <p>[Application Load Balancers] You must specify subnets from at least two * Availability Zones.</p> <p>[Network Load Balancers] You can specify subnets from * one or more Availability Zones.</p> */ inline CreateLoadBalancerRequest& WithSubnets(Aws::Vector<Aws::String>&& value) { SetSubnets(std::move(value)); return *this;} /** * <p>The IDs of the public subnets. You can specify only one subnet per * Availability Zone. You must specify either subnets or subnet mappings.</p> * <p>[Application Load Balancers] You must specify subnets from at least two * Availability Zones.</p> <p>[Network Load Balancers] You can specify subnets from * one or more Availability Zones.</p> */ inline CreateLoadBalancerRequest& AddSubnets(const Aws::String& value) { m_subnetsHasBeenSet = true; m_subnets.push_back(value); return *this; } /** * <p>The IDs of the public subnets. You can specify only one subnet per * Availability Zone. You must specify either subnets or subnet mappings.</p> * <p>[Application Load Balancers] You must specify subnets from at least two * Availability Zones.</p> <p>[Network Load Balancers] You can specify subnets from * one or more Availability Zones.</p> */ inline CreateLoadBalancerRequest& AddSubnets(Aws::String&& value) { m_subnetsHasBeenSet = true; m_subnets.push_back(std::move(value)); return *this; } /** * <p>The IDs of the public subnets. You can specify only one subnet per * Availability Zone. You must specify either subnets or subnet mappings.</p> * <p>[Application Load Balancers] You must specify subnets from at least two * Availability Zones.</p> <p>[Network Load Balancers] You can specify subnets from * one or more Availability Zones.</p> */ inline CreateLoadBalancerRequest& AddSubnets(const char* value) { m_subnetsHasBeenSet = true; m_subnets.push_back(value); return *this; } /** * <p>The IDs of the public subnets. You can specify only one subnet per * Availability Zone. You must specify either subnets or subnet mappings.</p> * <p>[Application Load Balancers] You must specify subnets from at least two * Availability Zones. You cannot specify Elastic IP addresses for your * subnets.</p> <p>[Network Load Balancers] You can specify subnets from one or * more Availability Zones. You can specify one Elastic IP address per subnet if * you need static IP addresses for your internet-facing load balancer. For * internal load balancers, you can specify one private IP address per subnet from * the IPv4 range of the subnet.</p> */ inline const Aws::Vector<SubnetMapping>& GetSubnetMappings() const{ return m_subnetMappings; } /** * <p>The IDs of the public subnets. You can specify only one subnet per * Availability Zone. You must specify either subnets or subnet mappings.</p> * <p>[Application Load Balancers] You must specify subnets from at least two * Availability Zones. You cannot specify Elastic IP addresses for your * subnets.</p> <p>[Network Load Balancers] You can specify subnets from one or * more Availability Zones. You can specify one Elastic IP address per subnet if * you need static IP addresses for your internet-facing load balancer. For * internal load balancers, you can specify one private IP address per subnet from * the IPv4 range of the subnet.</p> */ inline bool SubnetMappingsHasBeenSet() const { return m_subnetMappingsHasBeenSet; } /** * <p>The IDs of the public subnets. You can specify only one subnet per * Availability Zone. You must specify either subnets or subnet mappings.</p> * <p>[Application Load Balancers] You must specify subnets from at least two * Availability Zones. You cannot specify Elastic IP addresses for your * subnets.</p> <p>[Network Load Balancers] You can specify subnets from one or * more Availability Zones. You can specify one Elastic IP address per subnet if * you need static IP addresses for your internet-facing load balancer. For * internal load balancers, you can specify one private IP address per subnet from * the IPv4 range of the subnet.</p> */ inline void SetSubnetMappings(const Aws::Vector<SubnetMapping>& value) { m_subnetMappingsHasBeenSet = true; m_subnetMappings = value; } /** * <p>The IDs of the public subnets. You can specify only one subnet per * Availability Zone. You must specify either subnets or subnet mappings.</p> * <p>[Application Load Balancers] You must specify subnets from at least two * Availability Zones. You cannot specify Elastic IP addresses for your * subnets.</p> <p>[Network Load Balancers] You can specify subnets from one or * more Availability Zones. You can specify one Elastic IP address per subnet if * you need static IP addresses for your internet-facing load balancer. For * internal load balancers, you can specify one private IP address per subnet from * the IPv4 range of the subnet.</p> */ inline void SetSubnetMappings(Aws::Vector<SubnetMapping>&& value) { m_subnetMappingsHasBeenSet = true; m_subnetMappings = std::move(value); } /** * <p>The IDs of the public subnets. You can specify only one subnet per * Availability Zone. You must specify either subnets or subnet mappings.</p> * <p>[Application Load Balancers] You must specify subnets from at least two * Availability Zones. You cannot specify Elastic IP addresses for your * subnets.</p> <p>[Network Load Balancers] You can specify subnets from one or * more Availability Zones. You can specify one Elastic IP address per subnet if * you need static IP addresses for your internet-facing load balancer. For * internal load balancers, you can specify one private IP address per subnet from * the IPv4 range of the subnet.</p> */ inline CreateLoadBalancerRequest& WithSubnetMappings(const Aws::Vector<SubnetMapping>& value) { SetSubnetMappings(value); return *this;} /** * <p>The IDs of the public subnets. You can specify only one subnet per * Availability Zone. You must specify either subnets or subnet mappings.</p> * <p>[Application Load Balancers] You must specify subnets from at least two * Availability Zones. You cannot specify Elastic IP addresses for your * subnets.</p> <p>[Network Load Balancers] You can specify subnets from one or * more Availability Zones. You can specify one Elastic IP address per subnet if * you need static IP addresses for your internet-facing load balancer. For * internal load balancers, you can specify one private IP address per subnet from * the IPv4 range of the subnet.</p> */ inline CreateLoadBalancerRequest& WithSubnetMappings(Aws::Vector<SubnetMapping>&& value) { SetSubnetMappings(std::move(value)); return *this;} /** * <p>The IDs of the public subnets. You can specify only one subnet per * Availability Zone. You must specify either subnets or subnet mappings.</p> * <p>[Application Load Balancers] You must specify subnets from at least two * Availability Zones. You cannot specify Elastic IP addresses for your * subnets.</p> <p>[Network Load Balancers] You can specify subnets from one or * more Availability Zones. You can specify one Elastic IP address per subnet if * you need static IP addresses for your internet-facing load balancer. For * internal load balancers, you can specify one private IP address per subnet from * the IPv4 range of the subnet.</p> */ inline CreateLoadBalancerRequest& AddSubnetMappings(const SubnetMapping& value) { m_subnetMappingsHasBeenSet = true; m_subnetMappings.push_back(value); return *this; } /** * <p>The IDs of the public subnets. You can specify only one subnet per * Availability Zone. You must specify either subnets or subnet mappings.</p> * <p>[Application Load Balancers] You must specify subnets from at least two * Availability Zones. You cannot specify Elastic IP addresses for your * subnets.</p> <p>[Network Load Balancers] You can specify subnets from one or * more Availability Zones. You can specify one Elastic IP address per subnet if * you need static IP addresses for your internet-facing load balancer. For * internal load balancers, you can specify one private IP address per subnet from * the IPv4 range of the subnet.</p> */ inline CreateLoadBalancerRequest& AddSubnetMappings(SubnetMapping&& value) { m_subnetMappingsHasBeenSet = true; m_subnetMappings.push_back(std::move(value)); return *this; } /** * <p>[Application Load Balancers] The IDs of the security groups for the load * balancer.</p> */ inline const Aws::Vector<Aws::String>& GetSecurityGroups() const{ return m_securityGroups; } /** * <p>[Application Load Balancers] The IDs of the security groups for the load * balancer.</p> */ inline bool SecurityGroupsHasBeenSet() const { return m_securityGroupsHasBeenSet; } /** * <p>[Application Load Balancers] The IDs of the security groups for the load * balancer.</p> */ inline void SetSecurityGroups(const Aws::Vector<Aws::String>& value) { m_securityGroupsHasBeenSet = true; m_securityGroups = value; } /** * <p>[Application Load Balancers] The IDs of the security groups for the load * balancer.</p> */ inline void SetSecurityGroups(Aws::Vector<Aws::String>&& value) { m_securityGroupsHasBeenSet = true; m_securityGroups = std::move(value); } /** * <p>[Application Load Balancers] The IDs of the security groups for the load * balancer.</p> */ inline CreateLoadBalancerRequest& WithSecurityGroups(const Aws::Vector<Aws::String>& value) { SetSecurityGroups(value); return *this;} /** * <p>[Application Load Balancers] The IDs of the security groups for the load * balancer.</p> */ inline CreateLoadBalancerRequest& WithSecurityGroups(Aws::Vector<Aws::String>&& value) { SetSecurityGroups(std::move(value)); return *this;} /** * <p>[Application Load Balancers] The IDs of the security groups for the load * balancer.</p> */ inline CreateLoadBalancerRequest& AddSecurityGroups(const Aws::String& value) { m_securityGroupsHasBeenSet = true; m_securityGroups.push_back(value); return *this; } /** * <p>[Application Load Balancers] The IDs of the security groups for the load * balancer.</p> */ inline CreateLoadBalancerRequest& AddSecurityGroups(Aws::String&& value) { m_securityGroupsHasBeenSet = true; m_securityGroups.push_back(std::move(value)); return *this; } /** * <p>[Application Load Balancers] The IDs of the security groups for the load * balancer.</p> */ inline CreateLoadBalancerRequest& AddSecurityGroups(const char* value) { m_securityGroupsHasBeenSet = true; m_securityGroups.push_back(value); return *this; } /** * <p>The nodes of an Internet-facing load balancer have public IP addresses. The * DNS name of an Internet-facing load balancer is publicly resolvable to the * public IP addresses of the nodes. Therefore, Internet-facing load balancers can * route requests from clients over the internet.</p> <p>The nodes of an internal * load balancer have only private IP addresses. The DNS name of an internal load * balancer is publicly resolvable to the private IP addresses of the nodes. * Therefore, internal load balancers can route requests only from clients with * access to the VPC for the load balancer.</p> <p>The default is an * Internet-facing load balancer.</p> */ inline const LoadBalancerSchemeEnum& GetScheme() const{ return m_scheme; } /** * <p>The nodes of an Internet-facing load balancer have public IP addresses. The * DNS name of an Internet-facing load balancer is publicly resolvable to the * public IP addresses of the nodes. Therefore, Internet-facing load balancers can * route requests from clients over the internet.</p> <p>The nodes of an internal * load balancer have only private IP addresses. The DNS name of an internal load * balancer is publicly resolvable to the private IP addresses of the nodes. * Therefore, internal load balancers can route requests only from clients with * access to the VPC for the load balancer.</p> <p>The default is an * Internet-facing load balancer.</p> */ inline bool SchemeHasBeenSet() const { return m_schemeHasBeenSet; } /** * <p>The nodes of an Internet-facing load balancer have public IP addresses. The * DNS name of an Internet-facing load balancer is publicly resolvable to the * public IP addresses of the nodes. Therefore, Internet-facing load balancers can * route requests from clients over the internet.</p> <p>The nodes of an internal * load balancer have only private IP addresses. The DNS name of an internal load * balancer is publicly resolvable to the private IP addresses of the nodes. * Therefore, internal load balancers can route requests only from clients with * access to the VPC for the load balancer.</p> <p>The default is an * Internet-facing load balancer.</p> */ inline void SetScheme(const LoadBalancerSchemeEnum& value) { m_schemeHasBeenSet = true; m_scheme = value; } /** * <p>The nodes of an Internet-facing load balancer have public IP addresses. The * DNS name of an Internet-facing load balancer is publicly resolvable to the * public IP addresses of the nodes. Therefore, Internet-facing load balancers can * route requests from clients over the internet.</p> <p>The nodes of an internal * load balancer have only private IP addresses. The DNS name of an internal load * balancer is publicly resolvable to the private IP addresses of the nodes. * Therefore, internal load balancers can route requests only from clients with * access to the VPC for the load balancer.</p> <p>The default is an * Internet-facing load balancer.</p> */ inline void SetScheme(LoadBalancerSchemeEnum&& value) { m_schemeHasBeenSet = true; m_scheme = std::move(value); } /** * <p>The nodes of an Internet-facing load balancer have public IP addresses. The * DNS name of an Internet-facing load balancer is publicly resolvable to the * public IP addresses of the nodes. Therefore, Internet-facing load balancers can * route requests from clients over the internet.</p> <p>The nodes of an internal * load balancer have only private IP addresses. The DNS name of an internal load * balancer is publicly resolvable to the private IP addresses of the nodes. * Therefore, internal load balancers can route requests only from clients with * access to the VPC for the load balancer.</p> <p>The default is an * Internet-facing load balancer.</p> */ inline CreateLoadBalancerRequest& WithScheme(const LoadBalancerSchemeEnum& value) { SetScheme(value); return *this;} /** * <p>The nodes of an Internet-facing load balancer have public IP addresses. The * DNS name of an Internet-facing load balancer is publicly resolvable to the * public IP addresses of the nodes. Therefore, Internet-facing load balancers can * route requests from clients over the internet.</p> <p>The nodes of an internal * load balancer have only private IP addresses. The DNS name of an internal load * balancer is publicly resolvable to the private IP addresses of the nodes. * Therefore, internal load balancers can route requests only from clients with * access to the VPC for the load balancer.</p> <p>The default is an * Internet-facing load balancer.</p> */ inline CreateLoadBalancerRequest& WithScheme(LoadBalancerSchemeEnum&& value) { SetScheme(std::move(value)); return *this;} /** * <p>One or more tags to assign to the load balancer.</p> */ inline const Aws::Vector<Tag>& GetTags() const{ return m_tags; } /** * <p>One or more tags to assign to the load balancer.</p> */ inline bool TagsHasBeenSet() const { return m_tagsHasBeenSet; } /** * <p>One or more tags to assign to the load balancer.</p> */ inline void SetTags(const Aws::Vector<Tag>& value) { m_tagsHasBeenSet = true; m_tags = value; } /** * <p>One or more tags to assign to the load balancer.</p> */ inline void SetTags(Aws::Vector<Tag>&& value) { m_tagsHasBeenSet = true; m_tags = std::move(value); } /** * <p>One or more tags to assign to the load balancer.</p> */ inline CreateLoadBalancerRequest& WithTags(const Aws::Vector<Tag>& value) { SetTags(value); return *this;} /** * <p>One or more tags to assign to the load balancer.</p> */ inline CreateLoadBalancerRequest& WithTags(Aws::Vector<Tag>&& value) { SetTags(std::move(value)); return *this;} /** * <p>One or more tags to assign to the load balancer.</p> */ inline CreateLoadBalancerRequest& AddTags(const Tag& value) { m_tagsHasBeenSet = true; m_tags.push_back(value); return *this; } /** * <p>One or more tags to assign to the load balancer.</p> */ inline CreateLoadBalancerRequest& AddTags(Tag&& value) { m_tagsHasBeenSet = true; m_tags.push_back(std::move(value)); return *this; } /** * <p>The type of load balancer. The default is <code>application</code>.</p> */ inline const LoadBalancerTypeEnum& GetType() const{ return m_type; } /** * <p>The type of load balancer. The default is <code>application</code>.</p> */ inline bool TypeHasBeenSet() const { return m_typeHasBeenSet; } /** * <p>The type of load balancer. The default is <code>application</code>.</p> */ inline void SetType(const LoadBalancerTypeEnum& value) { m_typeHasBeenSet = true; m_type = value; } /** * <p>The type of load balancer. The default is <code>application</code>.</p> */ inline void SetType(LoadBalancerTypeEnum&& value) { m_typeHasBeenSet = true; m_type = std::move(value); } /** * <p>The type of load balancer. The default is <code>application</code>.</p> */ inline CreateLoadBalancerRequest& WithType(const LoadBalancerTypeEnum& value) { SetType(value); return *this;} /** * <p>The type of load balancer. The default is <code>application</code>.</p> */ inline CreateLoadBalancerRequest& WithType(LoadBalancerTypeEnum&& value) { SetType(std::move(value)); return *this;} /** * <p>[Application Load Balancers] The type of IP addresses used by the subnets for * your load balancer. The possible values are <code>ipv4</code> (for IPv4 * addresses) and <code>dualstack</code> (for IPv4 and IPv6 addresses). Internal * load balancers must use <code>ipv4</code>.</p> */ inline const IpAddressType& GetIpAddressType() const{ return m_ipAddressType; } /** * <p>[Application Load Balancers] The type of IP addresses used by the subnets for * your load balancer. The possible values are <code>ipv4</code> (for IPv4 * addresses) and <code>dualstack</code> (for IPv4 and IPv6 addresses). Internal * load balancers must use <code>ipv4</code>.</p> */ inline bool IpAddressTypeHasBeenSet() const { return m_ipAddressTypeHasBeenSet; } /** * <p>[Application Load Balancers] The type of IP addresses used by the subnets for * your load balancer. The possible values are <code>ipv4</code> (for IPv4 * addresses) and <code>dualstack</code> (for IPv4 and IPv6 addresses). Internal * load balancers must use <code>ipv4</code>.</p> */ inline void SetIpAddressType(const IpAddressType& value) { m_ipAddressTypeHasBeenSet = true; m_ipAddressType = value; } /** * <p>[Application Load Balancers] The type of IP addresses used by the subnets for * your load balancer. The possible values are <code>ipv4</code> (for IPv4 * addresses) and <code>dualstack</code> (for IPv4 and IPv6 addresses). Internal * load balancers must use <code>ipv4</code>.</p> */ inline void SetIpAddressType(IpAddressType&& value) { m_ipAddressTypeHasBeenSet = true; m_ipAddressType = std::move(value); } /** * <p>[Application Load Balancers] The type of IP addresses used by the subnets for * your load balancer. The possible values are <code>ipv4</code> (for IPv4 * addresses) and <code>dualstack</code> (for IPv4 and IPv6 addresses). Internal * load balancers must use <code>ipv4</code>.</p> */ inline CreateLoadBalancerRequest& WithIpAddressType(const IpAddressType& value) { SetIpAddressType(value); return *this;} /** * <p>[Application Load Balancers] The type of IP addresses used by the subnets for * your load balancer. The possible values are <code>ipv4</code> (for IPv4 * addresses) and <code>dualstack</code> (for IPv4 and IPv6 addresses). Internal * load balancers must use <code>ipv4</code>.</p> */ inline CreateLoadBalancerRequest& WithIpAddressType(IpAddressType&& value) { SetIpAddressType(std::move(value)); return *this;} private: Aws::String m_name; bool m_nameHasBeenSet; Aws::Vector<Aws::String> m_subnets; bool m_subnetsHasBeenSet; Aws::Vector<SubnetMapping> m_subnetMappings; bool m_subnetMappingsHasBeenSet; Aws::Vector<Aws::String> m_securityGroups; bool m_securityGroupsHasBeenSet; LoadBalancerSchemeEnum m_scheme; bool m_schemeHasBeenSet; Aws::Vector<Tag> m_tags; bool m_tagsHasBeenSet; LoadBalancerTypeEnum m_type; bool m_typeHasBeenSet; IpAddressType m_ipAddressType; bool m_ipAddressTypeHasBeenSet; }; } // namespace Model } // namespace ElasticLoadBalancingv2 } // namespace Aws
Bitum manufactures and supplies products for the paving industry: Coats for asphaltic applications, sprays and primers. Bitum develops, manufactures and markets its leading products – the most advanced of their kind. For more than 60 years, Bitum has led the market with sealing products for all applications: bitumen enhanced with polymers, bitumen mastic applied by spray, standardized bitumen sheets, acrylic sealing products, silicones, polyurethanes and cementitious materials. Bitum provides various solutions for thermal insulation – notably, BTI: Innovative insulation consisting of polyester fibers and aluminum. In addition, Bitum holds a line of acoustic insulation products based on polyester fibers. Alongside these prime products, the company manufactures and markets products for the paving industry, including bituminious emulsions. Bitum exports its fine products to a vast number of countries in both Western and Eastern Europe, USA, South Africa, Australia and many more, for use in public and private projects. These have made Bitum a well-established and respected company, leading the market in its field and taking part in worldwide projects. Sealing new concrete roofs, old bitumen sheets coated with aggregates, old acrylic coatings, old polyurethane coatings and metal roofs. Mastigum 10 is used for sealing shower floors, small balconies prior to tiling, sealing basement walls and beams and sealing exterior walls covered in stone. A multi- layer insulation system that combines reflective radiation barrier with a flexible fibre insulation layer. Insulation layer comprises clean and unconditioned polyester fibres. Flexigum is based on a special bitumen emulsion, enriched with high concentration polymeric latex of the highest quality, making it highly elastic and resistant to temperature. Manufacturing cold or hot asphaltic mixtures, sprays and patching materials. Highly elastic cement coating for walls and floor sealing.
@charset "utf-8"; pre code { font-size: 12px; } #code-list { padding-top: 16px; padding-left: 24px; background-color: white; margin-left: 14px; margin-bottom: 0; counter-reset: item; list-style-type: none; } #code-list li { display: block; } #code-list li:before { content: counter(item) " "; counter-increment: item; margin-left: -32px; padding-right: 12px; font-size: 10px; font-weight: bold; font-family: 'Source Sans Pro', sans-serif; } #code-list > li:hover { /* annotations show up on mouseover */ background-color: #fcfcfc; opacity: 1.0; cursor: pointer; } #code-list > li { position: relative; width: 80ch; background: white; padding: 3px 1px; padding-left: 6px; margin-left: -12px; } #code-list > li > code { width: 80ch; } #code-list > li > div { width: 80ch; } .add-annotation-btn { background: #090; color: #fff; display: none; left: 0; margin-left: -16px; position: absolute; font-size: 8px; line-height: 18px; text-align: center; height: 20px; width: 20px; border-radius: 4px; box-shadow: 0 1px 4px rgba(0,0,0,0.15); } .add-annotation-btn:hover { -ms-transform: scale(1.2); /* IE 9 */ -webkit-transform: scale(1.2); /* Chrome, Safari, Opera */ transform: scale(1.2); } #code-list > li:hover > .add-annotation-btn { display: inline; } .ann-box { border: 1px solid #ddd; border-radius: .25em; margin: .5em; font-family: 'Source Sans Pro', sans-serif; font-size: 14px; overflow: hidden; } .ann-box:hover { border: 1px solid #bbb; } .ann-box > .header { background: #eee; padding: .5em; font-weight: bold; } .ann-box > .header > .delete, .ann-box > .header > .edit { border: 1px solid transparent; display: inline-block; font-weight: bold; text-align: center; width: 2em; float: right; color: #666; line-height: 28px; margin-top: -6px; border-radius: 4px; } .ann-box .score-box { float: right; background-color: #ddd; border-radius: 2px; font-size: 10px; margin-right: 4px; overflow: hidden; } .ann-box .score-box span { line-height: 20px; padding: 4px; } .ann-box .score-box span:first-child { background-color: #ccc; } .ann-box > .header > .delete:hover, .ann-box > .header > .edit:hover { border: 1px solid #ccc; } .ann-box > .body { background: #fff; padding: .5em; } .annotation-form { width: 94%; border: 1px solid #ccc; border-radius: 4px; font-family: 'Source Sans Pro', sans-serif; padding: 6px; background-color: #fff; margin-top: 6px; } .annotation-edit-form { border-radius: 4px; font-family: 'Source Sans Pro', sans-serif; padding: 6px; background-color: #fff; margin-top: 6px; } .annotation-form hr { margin-top: 10px; margin-bottom: 10px; } #code-box pre { padding-top: 0; padding-bottom: 0; }
//===- JdwpHandler.h - ART-DEBUGGER ------------------------------*- C++ -*-===// // // ANDROID REVERSE TOOLKIT // // This file is distributed under the GNU GENERAL PUBLIC LICENSE // V3 License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // JdwpHandler is used to handle jdwp request. // //===----------------------------------------------------------------------===// #ifndef PROJECT_JDWPHANDLER_H #define PROJECT_JDWPHANDLER_H #include "JdwpReader.h" #include <QVector> #include "JdwpReader.h" #include "jdwp.h" #include <vector> /* JDWP Command * cmd cmdset name * * VirtualMachine command set (1) * 1 1 VirtualMachine.Version * 1 2 VirtualMachine.ClassesBySignature * 1 3 VirtualMachine.AllClasses * 1 4 VirtualMachine.AllThreads * 1 5 VirtualMachine.TopLevelThreadGroups * 1 6 VirtualMachine.Dispose * 1 7 VirtualMachine.IDSizes * 1 8 VirtualMachine.Suspend * 1 9 VirtualMachine.Resume * 1 10 VirtualMachine.Exit * 1 11 VirtualMachine.CreateString * 1 12 VirtualMachine.Capabilities * 1 13 VirtualMachine.ClassPaths * 1 14 VirtualMachine.DisposeObjects * 1 15 VirtualMachine.HoldEvents * 1 16 VirtualMachine.ReleaseEvents * 1 17 VirtualMachine.CapabilitiesNew * 1 18 VirtualMachine.RedefineClasses * 1 19 VirtualMachine.SetDefaultStratum * 1 20 VirtualMachine.AllClassesWithGeneric * 1 21 VirtualMachine.InstanceCounts * * ReferenceType command set (2) * 2 1 ReferenceType.Signature * 2 2 ReferenceType.ClassLoader * 2 3 ReferenceType.Modifiers * 2 4 ReferenceType.Fields * 2 5 ReferenceType.Methods * 2 6 ReferenceType.GetValues * 2 7 ReferenceType.SourceFile * 2 8 ReferenceType.NestedTypes * 2 9 ReferenceType.Status * 2 10 ReferenceType.Interfaces * 2 11 ReferenceType.ClassObject * 2 12 ReferenceType.SourceDebugExtension * 2 13 ReferenceType.SignatureWithGeneric * 2 14 ReferenceType.FieldsWithGeneric * 2 15 ReferenceType.MethodsWithGeneric * 2 16 ReferenceType.Instances * 2 17 ReferenceType.ClassFileVersion * 2 18 ReferenceType.ConstantPool * * ClassType command set (3) * 3 1 ClassType.Superclass * 3 2 ClassType.SetValues * 3 3 ClassType.InvokeMethod * 3 4 ClassType.NewInstance * * ArrayType command set (4) * 4 1 ArrayType.NewInstance * * InterfaceType command set (5) * * Method command set (6) * 6 1 Method.LineTable * 6 2 Method.VariableTable * 6 3 Method.Bytecodes * 6 4 Method.IsObsolete * 6 5 Method.VariableTableWithGeneric * * Field command set (8) * * ObjectReference command set (9) * 9 1 ObjectReference.ReferenceType * 9 2 ObjectReference.GetValues * 9 3 ObjectReference.SetValues * 9 4 ObjectReference.UNUSED * 9 5 ObjectReference.MonitorInfo * 9 6 ObjectReference.InvokeMethod * 9 7 ObjectReference.DisableCollection * 9 8 ObjectReference.EnableCollection * 9 9 ObjectReference.IsCollected * 9 10 ObjectReference.ReferringObjects * * StringReference command set (10) * 10 1 StringReference.Value * * ThreadReference command set (11) * 11 1 ThreadReference.Name * 11 2 ThreadReference.Suspend * 11 3 ThreadReference.Resume * 11 4 ThreadReference.Status * 11 5 ThreadReference.ThreadGroup * 11 6 ThreadReference.Frames * 11 7 ThreadReference.FrameCount * 11 8 ThreadReference.OwnedMonitors * 11 9 ThreadReference.CurrentContendedMonitor * 11 10 ThreadReference.Stop * 11 11 ThreadReference.Interrupt * 11 12 ThreadReference.SuspendCount * 11 13 ThreadReference.OwnedMonitorsStackDepthInfo * 11 14 ThreadReference.ForceEarlyReturn * * ThreadGroupReference command set (12) * 12 1 ThreadGroupReference.Name * 12 2 ThreadGroupReference.Parent * 12 3 ThreadGroupReference.Children * * ArrayReference command set (13) * 13 1 ArrayReference.Length * 13 2 ArrayReference.GetValues * 13 3 ArrayReference.SetValues * * ClassLoaderReference command set (14) * 14 1 ClassLoaderReference.VisibleClasses * * EventRequest command set (15) * 15 1 EventRequest.Set * 15 2 EventRequest.Clear * 15 3 EventRequest.ClearAllBreakpoints * * StackFrame command set (16) * 16 1 StackFrame.GetValues * 16 2 StackFrame.SetValues * 16 3 StackFrame.ThisObject * 16 4 StackFrame.PopFrames * * ClassObjectReference command set (17) * 17 1 ClassObjectReference.ReflectedType * * Event command set (64) * 64 100 Event.Composite * * 199 1 DDM.Chunk * */ namespace JDWP { namespace VirtualMachine { const static uint8_t set_ = 1; struct Version : public JdwpReader { Version(const uint8_t* bytes, uint32_t available); QByteArray version; uint32_t major; uint32_t minor; QByteArray javaVersion; QByteArray javaVmName; static QByteArray buildReq(int id = 0); const static uint8_t cmd = 1; }; struct ClassesBySignature : public JdwpReader { ClassesBySignature(const uint8_t* bytes, uint32_t available); uint32_t mSize; std::vector<ClassInfo> mInfos; static QByteArray buildReq(const QByteArray &classDescriptor, int id = 0); const static uint8_t cmd = 2; }; struct AllClasses : public JdwpReader { AllClasses(const uint8_t* bytes, uint32_t available); uint32_t mSize; std::vector<ClassInfo> mInfos; static QByteArray buildReq(int id = 0); const static uint8_t cmd = 3; }; struct AllThreads : public JdwpReader { AllThreads(const uint8_t* bytes, uint32_t available); uint32_t mSize; std::vector<ObjectId> mThreadIds; static QByteArray buildReq(int id = 0); const static uint8_t cmd = 4; }; struct TopLevelThreadGroups : public JdwpReader { TopLevelThreadGroups(const uint8_t* bytes, uint32_t available); uint32_t mGroups; ObjectId mThreadGroupId; static QByteArray buildReq(int id = 0); const static uint8_t cmd = 5; }; struct Dispose : public JdwpReader { Dispose(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(int id = 0); const static uint8_t cmd = 6; }; struct IDSizes : public JdwpReader { IDSizes(const uint8_t* bytes, uint32_t available); uint32_t mFieldIdSize; uint32_t mMethodIdSize; uint32_t mObjectIdSize; uint32_t mRefTypeIdSize; uint32_t mFrameIdSize; static QByteArray buildReq(int id = 0); const static uint8_t cmd = 7; }; struct Suspend : public JdwpReader { Suspend(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(int id = 0); const static uint8_t cmd = 8; }; struct Resume : public JdwpReader { Resume(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(int id = 0); const static uint8_t cmd = 9; }; struct Exit : public JdwpReader { Exit(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(int id = 0); const static uint8_t cmd = 10; }; struct CreateString : public JdwpReader { CreateString(const uint8_t* bytes, uint32_t available); ObjectId mStringId; static QByteArray buildReq(const QByteArray str, int id = 0); const static uint8_t cmd = 11; }; struct Capabilities : public JdwpReader { Capabilities(const uint8_t* bytes, uint32_t available); uint8_t mCanWatchFieldModification; uint8_t mCanWatchFieldAccess; uint8_t mCanGetBytecodes; uint8_t mCanGetSyntheticAttribute; uint8_t mCanGetOwnedMonitorInfo; uint8_t mCanGetCurrentContendedMonitor; uint8_t mCanGetMonitorInfo; static QByteArray buildReq(int id = 0); const static uint8_t cmd = 12; }; struct ClassPaths : public JdwpReader { ClassPaths(const uint8_t* bytes, uint32_t available); QByteArray mSlash; // string "/"? uint32_t mClassPathSize; std::vector<QByteArray> mClassPath; uint32_t mBootClassPathSize; std::vector<QByteArray> mBootClassPath; static QByteArray buildReq(int id = 0); const static uint8_t cmd = 13; }; struct DisposeObjects : public JdwpReader { DisposeObjects(const uint8_t* bytes, uint32_t available); struct DispObj { ObjectId id; uint32_t refCount; }; static QByteArray buildReq ( const std::vector<DispObj> &objs,int id = 0); const static uint8_t cmd = 14; }; struct HoldEvents : public JdwpReader { HoldEvents(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(int id = 0); const static uint8_t cmd = 15; }; struct ReleaseEvents : public JdwpReader { ReleaseEvents(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(int id = 0); const static uint8_t cmd = 16; }; struct CapabilitiesNew : public Capabilities { CapabilitiesNew(const uint8_t* bytes, uint32_t available); uint8_t mCanRedefineClasses; uint8_t mCanAddMethod; uint8_t mCanUnrestrictedlyRedefineClasses; uint8_t mCanPopFrames; uint8_t mCanUseInstanceFilters; uint8_t mCanGetSourceDebugExtension; uint8_t mCanRequestVMDeathEvent; uint8_t mCanSetDefaultStratum; uint8_t mCanGetInstanceInfo; uint8_t mCanRequestMonitorEvents; uint8_t mCanGetMonitorFrameInfo; uint8_t mCanUseSourceNameFilters; uint8_t mCanGetConstantPool; uint8_t mCanForceEarlyReturn; static QByteArray buildReq(int id = 0); const static uint8_t cmd = 17; }; struct RedefineClasses : public JdwpReader { RedefineClasses(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(int id = 0); const static uint8_t cmd = 18; }; struct SetDefaultStratum : public JdwpReader { SetDefaultStratum(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(int id = 0); const static uint8_t cmd = 19; }; struct AllClassesWithGeneric : public JdwpReader { AllClassesWithGeneric(const uint8_t* bytes, uint32_t available); uint32_t mSize; QVector<ClassInfo> mInfos; static QByteArray buildReq(int id = 0); const static uint8_t cmd = 20; }; struct InstanceCounts : public JdwpReader { InstanceCounts(const uint8_t* bytes, uint32_t available); uint32_t mCountSize; std::vector<uint64_t > mCounts; static QByteArray buildReq( const std::vector<RefTypeId > &class_ids, int id = 0); const static uint8_t cmd = 21; }; } namespace ReferenceType { const static uint8_t set_ = 2; struct Signature : public JdwpReader { Signature(const uint8_t* bytes, uint32_t available); QByteArray mSignature; static QByteArray buildReq(RefTypeId refTypeId, int id = 0); const static uint8_t cmd = 1; }; struct ClassLoader : public JdwpReader { ClassLoader(const uint8_t* bytes, uint32_t available); ObjectId mClassId; static QByteArray buildReq(RefTypeId refTypeId, int id = 0); const static uint8_t cmd = 2; }; struct Modifiers : public JdwpReader { Modifiers(const uint8_t* bytes, uint32_t available); uint32_t mFlags; static QByteArray buildReq(RefTypeId refTypeId, int id = 0); const static uint8_t cmd = 3; }; struct Fields : public JdwpReader { Fields(const uint8_t* bytes, uint32_t available); uint32_t mSize; std::vector<FieldInfo> mFields; static QByteArray buildReq(RefTypeId refTypeId, int id = 0); const static uint8_t cmd = 4; }; struct Methods : public JdwpReader { Methods(const uint8_t* bytes, uint32_t available); uint32_t mSize; std::vector<MethodInfo> mMethods; static QByteArray buildReq(RefTypeId refTypeId, int id = 0); const static uint8_t cmd = 5; }; struct GetValues : public JdwpReader { GetValues(const uint8_t* bytes, uint32_t available); uint32_t mSize; QVector<JValue> mValue; static QByteArray buildReq(RefTypeId refTypeId, const QVector<FieldId > &fieldids, int id = 0); const static uint8_t cmd = 6; }; struct SourceFile : public JdwpReader { SourceFile(const uint8_t* bytes, uint32_t available); QByteArray mSourceFile; static QByteArray buildReq(RefTypeId refTypeId, int id = 0); const static uint8_t cmd = 7; }; struct NestedTypes : public JdwpReader { NestedTypes(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(RefTypeId refTypeId, int id = 0); const static uint8_t cmd = 8; }; struct Status : public JdwpReader { Status(const uint8_t* bytes, uint32_t available); uint32_t mClassStatus; static QByteArray buildReq(RefTypeId refTypeId, int id = 0); const static uint8_t cmd = 9; }; struct Interfaces : public JdwpReader { Interfaces(const uint8_t* bytes, uint32_t available); uint32_t mCounts; std::vector<RefTypeId> mDirectInterfaces; static QByteArray buildReq(RefTypeId refTypeId, int id = 0); const static uint8_t cmd = 10; }; struct ClassObject : public JdwpReader { ClassObject(const uint8_t* bytes, uint32_t available); ObjectId mClassId; static QByteArray buildReq(RefTypeId refTypeId, int id = 0); const static uint8_t cmd = 11; }; struct SourceDebugExtension : public JdwpReader { SourceDebugExtension(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(RefTypeId refTypeId, int id = 0); const static uint8_t cmd = 12; }; struct SignatureWithGeneric : public Signature { SignatureWithGeneric(const uint8_t* bytes, uint32_t available); QByteArray mSignatureGeneric; static QByteArray buildReq(RefTypeId refTypeId, int id = 0); const static uint8_t cmd = 13; }; struct FieldsWithGeneric : public JdwpReader { FieldsWithGeneric(const uint8_t* bytes, uint32_t available); uint32_t mSize; QVector<FieldInfo> mFields; static QByteArray buildReq(RefTypeId refTypeId, int id = 0); const static uint8_t cmd = 14; }; struct MethodsWithGeneric : public JdwpReader { MethodsWithGeneric(const uint8_t* bytes, uint32_t available); uint32_t mSize; QVector<MethodInfo> mMethods; static QByteArray buildReq(RefTypeId refTypeId, int id = 0); const static uint8_t cmd = 15; }; struct Instances : public JdwpReader { Instances(const uint8_t* bytes, uint32_t available); struct tagObj { JDWP::JdwpTag tag; ObjectId objectId; }; uint32_t mSize; std::vector<tagObj> mObjTags; static QByteArray buildReq(RefTypeId refTypeId, int32_t maxcount, int id = 0); const static uint8_t cmd = 16; }; struct ClassFileVersion : public JdwpReader { ClassFileVersion(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(RefTypeId refTypeId, int id = 0); const static uint8_t cmd = 17; }; struct ConstantPool : public JdwpReader { ConstantPool(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(RefTypeId refTypeId, int id = 0); const static uint8_t cmd = 18; }; } namespace ClassType { const static uint8_t set_ = 3; struct Superclass : public JdwpReader { Superclass(const uint8_t* bytes, uint32_t available); RefTypeId mSuperClassId; static QByteArray buildReq(RefTypeId refTypeId, int id = 0); const static uint8_t cmd = 1; }; struct SetValues : public JdwpReader { SetValues(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(RefTypeId refTypeId, const std::vector<FieldInfo> &infos, int id = 0); const static uint8_t cmd = 2; }; struct InvokeMethod : public JdwpReader { InvokeMethod(const uint8_t* bytes, uint32_t available); JValue mResult; JValue mObject; static QByteArray buildReq(RefTypeId class_id, ObjectId thread_id, MethodId method_id,const std::vector<JValue> &argValues, uint32_t options, int id = 0); const static uint8_t cmd = 3; }; struct NewInstance : public JdwpReader { NewInstance(const uint8_t* bytes, uint32_t available); JValue mResult; JValue mObject; static QByteArray buildReq(RefTypeId class_id, ObjectId thread_id, MethodId method_id,const std::vector<JValue> &argValues, uint32_t options, int id = 0); const static uint8_t cmd = 4; }; } namespace ArrayType { const static uint8_t set_ = 4; struct NewInstance : public JdwpReader { NewInstance(const uint8_t* bytes, uint32_t available); JValue mObject; static QByteArray buildReq(RefTypeId arrayTypeId, uint32_t length, int id = 0); const static uint8_t cmd = 1; }; } namespace InterfaceType { const static uint8_t set_ = 5; } namespace Method { const static uint8_t set_ = 6; struct LineTable : public JdwpReader { struct LineLabel { uint64_t address; uint32_t line_number; }; public: LineTable(const uint8_t* bytes, uint32_t available); uint64_t mStart; uint64_t mEnd; size_t mNumLines; std::vector<LineLabel> mItems; static QByteArray buildReq(RefTypeId refTypeId, MethodId method_id, int id = 0); const static uint8_t cmd = 1; }; struct VariableTable : public JdwpReader { struct VarLabel { uint64_t startAddress; QByteArray name; QByteArray descriptor; QByteArray signature; uint32_t size; uint32_t slot; }; public: VariableTable(const uint8_t* bytes, uint32_t available); uint32_t mNumArgRegisters; size_t mVariableCount; std::vector<VarLabel> mItems; static QByteArray buildReq(RefTypeId class_id, MethodId method_id, int id = 0); const static uint8_t cmd = 2; }; struct Bytecodes : public JdwpReader { Bytecodes(const uint8_t* bytes, uint32_t available); uint32_t mByteCodesSize; std::vector<uint8_t > mByteCodes; static QByteArray buildReq(RefTypeId class_id, MethodId method_id, int id = 0); const static uint8_t cmd = 3; }; struct IsObsolete : public JdwpReader { IsObsolete(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(RefTypeId class_id, MethodId method_id, int id = 0); const static uint8_t cmd = 4; }; struct VariableTableWithGeneric : public JdwpReader { struct VarLabel { uint64_t startAddress; QByteArray name; QByteArray descriptor; QByteArray signature; uint32_t size; uint32_t slot; }; public: VariableTableWithGeneric(const uint8_t* bytes, uint32_t available); uint32_t mNumArgRegisters; size_t mVariableCount; std::vector<VarLabel> mItems; static QByteArray buildReq(RefTypeId class_id, MethodId method_id, int id = 0); const static uint8_t cmd = 5; }; } namespace Field { const static uint8_t set_ = 8; } namespace ObjectReference { const static uint8_t set_ = 9; struct ReferenceType : public JdwpReader { ReferenceType(const uint8_t* bytes, uint32_t available); JdwpTypeTag tag; RefTypeId mTypeId; static QByteArray buildReq(ObjectId object_id, int id = 0); const static uint8_t cmd = 1; }; struct GetValues : public JdwpReader { GetValues(const uint8_t* bytes, uint32_t available); uint32_t mSize; QVector<JValue> mValue; static QByteArray buildReq(ObjectId object_id, const QVector<FieldId > &fields, int id = 0); const static uint8_t cmd = 2; }; struct SetValues : public JdwpReader { SetValues(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(ObjectId object_id, const std::vector<FieldInfo> &fields, int id = 0); const static uint8_t cmd = 3; }; struct UNUSED : public JdwpReader { UNUSED(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(int id = 0); const static uint8_t cmd = 4; }; struct MonitorInfo : public JdwpReader { MonitorInfo(const uint8_t* bytes, uint32_t available); ObjectId mMonitorInfo; uint32_t mEntryCount; uint32_t mWaiterSize; std::vector<ObjectId> mWaiters; static QByteArray buildReq(ObjectId object_id, int id = 0); const static uint8_t cmd = 5; }; struct InvokeMethod : public JdwpReader { InvokeMethod(const uint8_t* bytes, uint32_t available); JValue mResult; JValue mObject; static QByteArray buildReq(ObjectId object_id, ObjectId thread_id, RefTypeId class_id, MethodId method_id, const std::vector<JValue> &argValues,uint32_t options, int id = 0); const static uint8_t cmd = 6; }; struct DisableCollection : public JdwpReader { DisableCollection(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(ObjectId object_id,int id = 0); const static uint8_t cmd = 7; }; struct EnableCollection : public JdwpReader { EnableCollection(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(ObjectId object_id,int id = 0); const static uint8_t cmd = 8; }; struct IsCollected : public JdwpReader { IsCollected(const uint8_t* bytes, uint32_t available); bool mIsCollected; static QByteArray buildReq(ObjectId object_id,int id = 0); const static uint8_t cmd = 9; }; struct ReferringObjects : public JdwpReader { ReferringObjects(const uint8_t* bytes, uint32_t available); int mSize; std::vector<JValue> mObjs; static QByteArray buildReq(ObjectId object_id, int32_t max_count, int id = 0); const static uint8_t cmd = 10; }; } namespace StringReference { const static uint8_t set_ = 10; struct Value : public JdwpReader { Value(const uint8_t* bytes, uint32_t available); QByteArray mStr; static QByteArray buildReq(ObjectId stringObject, int id = 0); const static uint8_t cmd = 1; }; } namespace ThreadReference { const static uint8_t set_ = 11; struct Name : public JdwpReader { Name(const uint8_t* bytes, uint32_t available); QByteArray mName; static QByteArray buildReq(ObjectId thread_id, int id = 0); const static uint8_t cmd = 1; }; struct Suspend : public JdwpReader { Suspend(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(ObjectId thread_id, int id = 0); const static uint8_t cmd = 2; }; struct Resume : public JdwpReader { Resume(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(ObjectId thread_id, int id = 0); const static uint8_t cmd = 3; }; struct Status : public JdwpReader { Status(const uint8_t* bytes, uint32_t available); uint32_t mThreadStatus; uint32_t mSuspendStatus; static QByteArray buildReq(ObjectId thread_id, int id = 0); const static uint8_t cmd = 4; }; struct ThreadGroup : public JdwpReader { ThreadGroup(const uint8_t* bytes, uint32_t available); ObjectId mThreadGroupId; static QByteArray buildReq(ObjectId thread_id, int id = 0); const static uint8_t cmd = 5; }; struct Frames : public JdwpReader { struct Frame { ObjectId frame_id; JdwpLocation location; }; public: Frames(const uint8_t* bytes, uint32_t available); int mFrameCount; QVector<Frame> mFrames; static QByteArray buildReq(ObjectId thread_id, uint32_t start_frame, uint32_t length, int id = 0); const static uint8_t cmd = 6; }; struct FrameCount : public JdwpReader { FrameCount(const uint8_t* bytes, uint32_t available); int mFrameCount; static QByteArray buildReq(ObjectId thread_id, int id = 0); const static uint8_t cmd = 7; }; struct OwnedMonitors : public JdwpReader { OwnedMonitors(const uint8_t* bytes, uint32_t available); int mMonitorSize; std::vector<JValue> mMonitors; static QByteArray buildReq(ObjectId thread_id, int id = 0); const static uint8_t cmd = 8; }; struct CurrentContendedMonitor : public JdwpReader { CurrentContendedMonitor(const uint8_t* bytes, uint32_t available); JValue mContendedMonitor; static QByteArray buildReq(ObjectId thread_id, int id = 0); const static uint8_t cmd = 9; }; struct Stop : public JdwpReader { Stop(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(ObjectId thread_id, int id = 0); const static uint8_t cmd = 10; }; struct Interrupt : public JdwpReader { Interrupt(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(ObjectId thread_id, int id = 0); const static uint8_t cmd = 11; }; struct SuspendCount : public JdwpReader { SuspendCount(const uint8_t* bytes, uint32_t available); uint32_t mSuspendCount; static QByteArray buildReq(ObjectId thread_id, int id = 0); const static uint8_t cmd = 12; }; struct OwnedMonitorsStackDepthInfo : public JdwpReader { struct Monitor{ JValue monitor; uint32_t depth; }; public: OwnedMonitorsStackDepthInfo(const uint8_t* bytes, uint32_t available); int mMonitorSize; std::vector<Monitor> mMonitors; static QByteArray buildReq(ObjectId thread_id, int id = 0); const static uint8_t cmd = 13; }; struct ForceEarlyReturn : public JdwpReader { ForceEarlyReturn(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(ObjectId thread_id, int id = 0); const static uint8_t cmd = 14; }; } namespace ThreadGroupReference { const static uint8_t set_ = 12; struct ForceEarlyReturn : public JdwpReader { ForceEarlyReturn(const uint8_t* bytes, uint32_t available); QByteArray mThreadGroupName; static QByteArray buildReq(ObjectId thread_group_id, int id = 0); const static uint8_t cmd = 1; }; struct Parent : public JdwpReader { Parent(const uint8_t* bytes, uint32_t available); ObjectId mThreadParentgroup; static QByteArray buildReq(ObjectId thread_group_id, int id = 0); const static uint8_t cmd = 2; }; struct Children : public JdwpReader { Children(const uint8_t* bytes, uint32_t available); int mThreadIdSize; std::vector<ObjectId> mThreadIds; int mChildThreadGroupIdSize; std::vector<ObjectId> mChildThreadGroupsIds; static QByteArray buildReq(ObjectId thread_group_id, int id = 0); const static uint8_t cmd = 3; }; } namespace ArrayReference { const static uint8_t set_ = 13; struct Length : public JdwpReader { Length(const uint8_t* bytes, uint32_t available); int mLength; static QByteArray buildReq(ObjectId array_id, int id = 0); const static uint8_t cmd = 1; }; struct GetValues : public JdwpReader { GetValues(const uint8_t* bytes, uint32_t available); JdwpTag mTag; int mCount; QVector<JValue> mElements; static QByteArray buildReq(ObjectId array_id, uint32_t offset, uint32_t length, int id = 0); const static uint8_t cmd = 2; }; struct SetValues : public JdwpReader { SetValues(const uint8_t* bytes, uint32_t available); static QByteArray buildReq (ObjectId array_id,uint32_t offset,JdwpTag tag, const std::vector<JValue> &elements,int id = 0); const static uint8_t cmd = 3; }; } namespace ClassLoaderReference { const static uint8_t set_ = 14; struct VisibleClasses : public JdwpReader { VisibleClasses(const uint8_t* bytes, uint32_t available); int mClassSize; std::vector<JValue> mClasses; static QByteArray buildReq(ObjectId classLoaderObject, int id = 0); const static uint8_t cmd = 1; }; } namespace EventRequest { const static uint8_t set_ = 15; struct Set : public JdwpReader { Set(const uint8_t* bytes, uint32_t available); uint32_t mRequestId; static QByteArray buildReq(JdwpEventKind eventkind, JdwpSuspendPolicy policy, const std::vector<JdwpEventMod>& mod, int id = 0); const static uint8_t cmd = 1; }; struct Clear : public JdwpReader { Clear(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(JdwpEventKind kind, uint32_t requestId, int id = 0); const static uint8_t cmd = 2; }; struct ClearAllBreakpoints : public JdwpReader { ClearAllBreakpoints(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(int id = 0); const static uint8_t cmd = 3; }; } namespace StackFrame { const static uint8_t set_ = 16; struct StackFrameData { uint32_t slot; JValue val; }; struct GetValues : public JdwpReader { GetValues(const uint8_t* bytes, uint32_t available); uint32_t mSlotCount; QVector<JValue> mSlots; static QByteArray buildReq (ObjectId thread_id,FrameId frame_id, const QVector<StackFrameData>& frames, int id = 0); const static uint8_t cmd = 1; }; struct SetValues : public JdwpReader { SetValues(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(ObjectId thread_id, FrameId frame_id, const QVector<StackFrameData>& frames, int id = 0); const static uint8_t cmd = 2; }; struct ThisObject : public JdwpReader { ThisObject(const uint8_t* bytes, uint32_t available); JValue mObject; static QByteArray buildReq(ObjectId thread_id, FrameId frame_id, int id = 0); const static uint8_t cmd = 3; }; struct PopFrames : public JdwpReader { PopFrames(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(ObjectId thread_id, FrameId frame_id, int id = 0); const static uint8_t cmd = 4; }; } namespace ClassObjectReference { const static uint8_t set_ = 17; struct ReflectedType : public JdwpReader { ReflectedType(const uint8_t* bytes, uint32_t available); JValue mClass; static QByteArray buildReq(RefTypeId class_object_id, int id = 0); const static uint8_t cmd = 1; }; } namespace Composite { const static uint8_t set_ = 64; struct ReflectedType : public JdwpReader { struct EventObject { JdwpEventKind mEventKind; uint32_t mRequestId; virtual ~EventObject() {}; }; /* * Tell the debugger that we have finished initializing. This is always * sent, even if the debugger hasn't requested it. * * This should be sent "before the main thread is started and before * any application code has been executed". The thread ID in the message * must be for the main thread. */ struct EventVmStart: public EventObject { ObjectId mThreadId; ~EventVmStart() {}; }; /* * A location of interest has been reached. This handles: * Breakpoint * SingleStep * MethodEntry * MethodExit * These four types must be grouped together in a single response. The * "eventFlags" indicates the type of event(s) that have happened. * * Valid mods: * Count, ThreadOnly, ClassOnly, ClassMatch, ClassExclude, InstanceOnly * LocationOnly (for breakpoint/step only) * Step (for step only) * * Interesting test cases: * - Put a breakpoint on a native method. Eclipse creates METHOD_ENTRY * and METHOD_EXIT events with a ClassOnly mod on the method's class. * - Use "run to line". Eclipse creates a BREAKPOINT with Count=1. * - Single-step to a line with a breakpoint. Should get a single * event message with both events in it. */ struct EventLocationEvent: public EventObject { ObjectId mThreadId; JdwpLocation mLocation; ~EventLocationEvent() {} }; /* * A thread is starting or stopping. * * Valid mods: * Count, ThreadOnly */ struct EventThreadChange: public EventObject { ObjectId mThreadId; ~EventThreadChange() {} }; /* * Send a polite "VM is dying" message to the debugger. * * Skips the usual "event token" stuff. */ struct EventVmDeath: public EventObject { ~EventVmDeath() {} }; /* * An exception has been thrown. It may or may not have been caught. * * Valid mods: * Count, ThreadOnly, ClassOnly, ClassMatch, ClassExclude, LocationOnly, * ExceptionOnly, InstanceOnly * * The "exceptionId" has not been added to the GC-visible object registry, * because there's a pretty good chance that we're not going to send it * up the debugger. */ struct EventException: public EventObject { ObjectId mThreadId; JdwpLocation mThrowLoc; JdwpTag mTag; RefTypeId mExceptionId; JdwpLocation mCatchLoc; ~EventException(){}; }; /* * Announce that a class has been loaded. * * Valid mods: * Count, ThreadOnly, ClassOnly, ClassMatch, ClassExclude */ struct EventClassPrepare: public EventObject { ObjectId mThreadId; JdwpTag mTag; RefTypeId mTypeId; QByteArray mSignature; uint32_t mStatus; ~EventClassPrepare(){}; }; public: ReflectedType(const uint8_t* bytes, uint32_t available); ~ReflectedType(); JdwpSuspendPolicy mSuspendPolicy; int32_t mCount; QVector<EventObject*> mEventList; static QByteArray buildReq(int id = 0); const static uint8_t cmd = 100; }; } namespace DDM { // These command is used by DDMS. const static uint8_t set_ = 199; struct Chunk : public JdwpReader { Chunk(const uint8_t* bytes, uint32_t available); static QByteArray buildReq(int id = 0); const static uint8_t cmd = 1; }; } bool Write1(QByteArray &s, uint8_t v); bool Write2(QByteArray &s, uint16_t v); bool Write4(QByteArray &s, uint32_t v); bool Write8(QByteArray &s, uint64_t v); bool WriteValue(QByteArray &s, uint64_t v, size_t width); bool WriteString(QByteArray &s, const QByteArray &l); bool WriteFieldId(QByteArray &s, uint32_t v); bool WriteMethodId(QByteArray &s, uint32_t v); bool WriteObjectId(QByteArray &s, uint64_t v); bool WriteRefTypeId(QByteArray &s, uint64_t v); bool WriteFrameId(QByteArray &s, uint64_t v); bool WriteThreadId(QByteArray &s, uint64_t v); bool WriteJdwpLocation(QByteArray &s, const JdwpLocation &location); QByteArray BuildReq(int id, int cmdset, int cmd, const QByteArray &extra); } #endif //PROJECT_JDWPHANDLER_H
<div :class="[componentClass, 'bbn-textbox']" @keydown.enter.stop="" > <div class="bbn-100" ref="element" @change="onChange"> <slot></slot> </div> </div>
/* * (c) 2008-2010 Alexander Warg <[email protected]> * economic rights: Technische Universität Dresden (Germany) * * This file is part of TUD:OS and distributed under the terms of the * GNU General Public License 2. * Please see the COPYING-GPL-2 file for details. */ #pragma once #include <l4/re/log> #include <l4/re/env> #include <l4/re/rm> #include <l4/sys/scheduler> #include <l4/re/util/object_registry> #include <l4/re/util/cap_alloc> #include <l4/cxx/ipc_server> #include "server.h" class App_task : public Ned::Server_object { private: long _ref_cnt; public: enum State { Initializing, Running, Zombie }; long remove_ref() { return --_ref_cnt; } void add_ref() { ++_ref_cnt; } long ref_cnt() const { return _ref_cnt; } private: // hm, missing template typedefs template< typename T > struct Auto_del_cap : public L4Re::Util::Auto_del_cap<T> {}; // hm, missing template typedefs template< typename T > struct Auto_cap : public L4Re::Util::Auto_cap<T> {}; Ned::Registry *_r; Auto_del_cap<L4::Task>::Cap _task; Auto_del_cap<L4::Thread>::Cap _thread; Auto_del_cap<L4Re::Rm>::Cap _rm; State _state; unsigned long _exit_code; l4_cap_idx_t _observer; public: State state() const { return _state; } unsigned long exit_code() const { return _exit_code; } l4_cap_idx_t observer() const { return _observer; } void observer(l4_cap_idx_t o) { _observer = o; } void running() { _state = Running; add_ref(); // so we run do not silently kick this task } App_task(Ned::Registry *r, L4::Cap<L4::Factory> alloc); //L4::Cap<L4Re::Mem_alloc> allocator() const { return _ma; } int dispatch(l4_umword_t obj, L4::Ipc::Iostream &ios); L4::Cap<L4Re::Rm> rm() { return _rm.get(); } L4::Cap<L4::Task> task_cap() const { return _task.get(); } L4::Cap<L4::Thread> thread_cap() const { return _thread.get(); } virtual void terminate(); virtual ~App_task(); };
Have you ever noticed at Chick-Fil-A, when you thank them for your food, they say, “My pleasure.” Note: They’ve started doing this at McDonalds, too. I obviously eat more fast food than I should. Anyway, I’m not writing about fast food, I’m writing about giving. I give a lot in my life. I guess a lot of giving just comes with the territory when you are a caregiver. I don’t only give a lot at home, though. I give a lot at work, too. I am a leader. I believe leaders should be servants. Servants give. I often find myself at the end of my rope. I am just empty. I hate it. I want to be able to give more, because I can see more is needed. Honestly, that’s the number one reason I’ve strayed away from writing on this blog – because I just don’t have anything to give. To write. To say. I feel guilty about this. I think it’s easiest to give when it is my pleasure. I wish it was always a pleasure, but it’s not. Especially before I have any coffee. We work an overnight schedule. Translation: We don’t sleep. Every Friday, we are exhausted and aim to sleep for about 12 hours. When I really sleep on Fridays, I dream. I almost always dream that I am constantly woken up and asked for things. It’s usually Michael who asks me for things in my dreams. Last night, I had this dream back-to-back about 6 times, then I woke up to him actually asking for something, and I got it for him but I was not nice about it. Failure. This morning, Michael woke up with a scratchy throat. We decided to stay home from church. I was sweet to him, right off the bat. I got him some medicine, stroked his hair. I was all impressed with myself. I got the thermometer to take his temperature, did that, then he made one unsolicited comment – something about wiping the thermometer off with an alcohol swab and BOOM, I got mad. No longer my pleasure. My service was tainted. I was annoyed, feeling like a victim, like a slave, like I’m just here to do the work. I actually felt the change happen in my heart. And I hate it! I want it to be my pleasure. I constantly have to fight for my pleasure. I have to confess, pray, listen to music, have alone time, write, talk to other wives who get it, and eventually I can get back to the place where I can take care of him with a sweet spirit. I hate that I have to fight for this. I wish it was easier. Earlier this week, Michael’s home health aide called out sick. (We’re thinking that’s where he got the throat thing.) I had already woken up an hour early so I could be out of our bedroom and out of the way, so I was mad I was going to have to step up and get him up and dressed myself, and I had to do it without an hour of sleep I would have had, had I known when we went to bed that she wouldn’t be coming in that night. I started getting him ready and then we were thrown a curveball. I’m not going into detail, but it was not fun. I have a mode I go into when this happens and I went into the mode. I am a household appliance. I’m a tornado of plastic gloves, washcloths, anti-bacterial spray and laundry detergent. I clean up the mess and theoretically, it’s gone. But the fact that it happened hurts. And the hurt lingers. And I fight with God: Why? How? So many questions. Don’t you see? Don’t you care? I broke down in tears and laid down with Michael. Snuggled beside him on his right shoulder. He accepts me when I am a mess like this. When I can’t do it. When it’s not my pleasure. When I pity him. When I pity us. When I can’t climb and claw and fight my way to just face the day. Once I got him up, I made coffee and warmed up dinner and I went upstairs to get ready for work. And the waves kept crashing. I couldn’t rally. I ended up taking a sick day. I fell asleep on the couch. I made it through the night, after all. I look back at our live together over the last five years and I remember so many days that were filled with pity in those early years. I serve more out of pleasure, these days, thank God! When this happened the other night, Michael brought up Sisyphys. I told him I used to feel like Sisyphus all the time. Now, it’s rare. I’m not sure if that’s a good thing, or not. On one hand, at least I’m not pushing that rock up the hill already exhausted. On the other hand, I am out of practice. The bottom line here is it’s way easier to serve, to give, out of pleasure than it is out of pity. I love this article because I can so relate to it. I take care of my cp daughter, who is actually quite self-sufficient, then go to work at a daycare, then come home to help her some more. I usually have that "pity party" every evening; "I have to get up again! Can't anyone see how tired I am?", I think to myself. But I keep smiling and remind myself how thankful I am that she's here.
import Vue from 'vue' import Vuex from 'vuex' import axios from 'axios' Vue.use(Vuex); const store = new Vuex.Store({ state: { tasks: [ { id: 1, name: "task1", description: "task1" } ], images: [ { name: "python", tags: [ "2.7", "2.7-slim" ] }, { name: "java", tags: [ "7", "8" ] } ] }, actions: { fetchTasks ({ commit }) { axios.get("/tasks") .then((response) => { commit('setTasks', response.data.tasks) }) }, fetchImages ({ commit }) { axios.get("/images") .then((response) => { commit('setImages', response.data.images) }) }, addTask ({ commit }, task) { axios.post("/tasks", task) .then((response) => { commit('addTask', response.data) }); } }, mutations: { addTask (state, task) { state.tasks.push(task) }, setTasks (state, tasks) { state.tasks = tasks }, setImages (state, images) { state.images = images } }, getters: { tasks: state => { return state.tasks }, getTaskById: (state) => (id) => { return state.tasks.find(x => x.id === id) }, taskCount: state => { return state.tasks.length }, images: state => { return state.images }, filterImagesByName: (state) => (name) => { return state.images.find(x => x.name.startWith(name)) } } }); export default store
to receive our media releases direct to your inbox. Safer speeds for Hamilton - what do you think? A speed limit of 30km/h around schools is one of the principles proposed in Hamilton’s Speed Management Plan, which is now open for consultation. Hamilton City Council chief executive Richard Briggs says views expressed by Councillor James Casson on social media over the weekend are in no way shared or endorsed by the Council. Work starts on Monday 1 April to upgrade a section of London St footpath on the south side of the street, between Victoria and Barton Sts. The stadium was recognised for its exceptional delivery of two Rugby League World Cup 2017 matches in November 2017 as well as the city’s inaugural HSBC NZ Sevens in February 2018. A new campaign aims to get people to not only look but see as they approach intersections. Feedback is now open on Hamilton’s Prostitution Bylaw. The bylaw was last reviewed in 2009 and is required to be reviewed every 10 years. A low-lying section of the river path network just north of the central business district will be closed for half a day today (20 March 2019) to allow for remedial work. It's an exciting and new chapter for the city with our biggest capital investment spend ever and we want to increase our visibility and involvement with you, the community. Hamilton City Council met on 14 March 2019. The information below is a summary of decisions made and is not the formal minutes of the meeting. People who travel by bus will soon notice improvements to their travel experience with new bus shelters, lighting and raised kerbs being installed. A new raised pedestrian platform has been welcomed by students, teachers and parents. The Chengdu International Sister Cities Youth Music Festival in July is a colourful celebration of international friendship. The Council is inviting people to have their say on the new Rototuna village being developed in the fast-growing north-eastern suburbs of Hamilton. The stretch between Fraser St and Lake Rd will be closed next week for maintenance work. The Mayor and Councillors were presented with the proposed budget for the 2019/20 Annual Plan at Tuesday’s Hamilton City Council meeting. The flag above the Hamilton City Council building will fly at half-mast on Thursday 21 February, in recognition of the passing of Giuseppe “Joe” Di Maio. A section of Hamilton’s River Rd will be under traffic control this Wednesday (20 February) to allow for a tree management project. Comedy, DJs, Shakespeare, opera and a business-focussed summit are among the diverse range of events offered in this year’s Hamilton Gardens Arts Festival.
#include "led_module.h" #include "xmc_gpio.h" const XMC_GPIO_CONFIG_t LED_conf = { .mode = XMC_GPIO_MODE_OUTPUT_PUSH_PULL, .output_level = XMC_GPIO_OUTPUT_LEVEL_LOW, .output_strength = XMC_GPIO_OUTPUT_STRENGTH_STRONG_SOFT_EDGE, }; void leds_init(void){ XMC_GPIO_Init(XMC_GPIO_PORT1, 1, &LED_conf); XMC_GPIO_Init(XMC_GPIO_PORT1, 0, &LED_conf); } void led_on(leds_t led){ XMC_GPIO_SetOutputHigh(XMC_GPIO_PORT1, led); } void led_off(leds_t led){ XMC_GPIO_SetOutputLow(XMC_GPIO_PORT1, led); } void led_toggle(leds_t led){ XMC_GPIO_ToggleOutput(XMC_GPIO_PORT1, led); }
Olly Murs insists Harry Styles and Caroline Flack's relationship should stay "private". Olly Murs has commented on Harry Styles and Caroline Flack's romance. The 'Heart Skips a Beat' singer, who co-hosted ITV2's The Xtra Factor with Flack, said that the pair's relationship is not yet "concrete". Speaking to the Daily Star, Murs divulged: "Nothing's concrete. It's all good. "Everyone tweets what they want but no-one knows the inside truth - that's private. All this taking pictures and stuff is unfair." The 27-year-old added: "Harry is a good looking lad and most girls in this country would want to snog him." Earlier this month, Styles was photographed leaving Flack's North London home reportedly carrying a bag of his belongings.
#!/bin/bash # verify user ID if [ $USER != "lfs" ]; then echo "need lfs user to build temporary system." exit 1 fi echo "start to build temporary system ..." pushd . > /dev/null scripts=`find . -maxdepth 1 -name '[0-9][0-9]-*.sh' | sort` notify_dir=/lfs/tmp/notify mkdir -pv ${notify_dir} for script in $scripts; do NAME=`readlink -f $script` LOG=${NAME%.sh}.log s=`basename ${script%.sh}` touch ${notify_dir}/${s}-start ( ./$script 2>&1 | tee $LOG && exit $PIPESTATUS ) if [ $? -eq 0 ]; then touch ${notify_dir}/${s}-success else touch ${notify_dir}/${s}-failed exit 1 fi done popd > /dev/null echo "... build temporary system success" touch ${notify_dir}/lfs-success
#! /usr/bin/env python3 # This script is for running peru directly from the repo, mainly for # development. This isn't what gets installed when you install peru. That would # be a script generated by setup.py, which calls peru.main.main(). import os import sys repo_root = os.path.dirname(os.path.realpath(__file__)) sys.path.insert(0, repo_root) import peru.main # noqa: E402 sys.exit(peru.main.main())
#!/usr/bin/env zsh # # This is a clean-room implementation of the Fish[1] shell's history search # feature, where you can type in any part of any previously entered command # and press the UP and DOWN arrow keys to cycle through the matching commands. # #----------------------------------------------------------------------------- # Usage #----------------------------------------------------------------------------- # # 1. Load this script into your interactive ZSH session: # # % source history-substring-search.zsh # # If you want to use the zsh-syntax-highlighting[6] script along with this # script, then make sure that you load it *before* you load this script: # # % source zsh-syntax-highlighting.zsh # % source history-substring-search.zsh # # 2. Type any part of any previous command and then: # # * Press the UP arrow key to select the nearest command that (1) contains # your query and (2) is older than the current command in the command # history. # # * Press the DOWN arrow key to select the nearest command that (1) # contains your query and (2) is newer than the current command in the # command history. # # * Press ^U (the Control and U keys simultaneously) to abort the search. # # 3. If a matching command spans more than one line of text, press the LEFT # arrow key to move the cursor away from the end of the command, and then: # # * Press the UP arrow key to move the cursor to the line above. When the # cursor reaches the first line of the command, pressing the UP arrow # key again will cause this script to perform another search. # # * Press the DOWN arrow key to move the cursor to the line below. When # the cursor reaches the last line of the command, pressing the DOWN # arrow key again will cause this script to perform another search. # #----------------------------------------------------------------------------- # Configuration #----------------------------------------------------------------------------- # # This script defines the following global variables. You may override their # default values only after having loaded this script into your ZSH session. # # * HISTORY_SUBSTRING_SEARCH_HIGHLIGHT_FOUND is a global variable that defines # how the query should be highlighted inside a matching command. Its default # value causes this script to highlight using bold, white text on a magenta # background. See the "Character Highlighting" section in the zshzle(1) man # page to learn about the kinds of values you may assign to this variable. # # * HISTORY_SUBSTRING_SEARCH_HIGHLIGHT_NOT_FOUND is a global variable that # defines how the query should be highlighted when no commands in the # history match it. Its default value causes this script to highlight using # bold, white text on a red background. See the "Character Highlighting" # section in the zshzle(1) man page to learn about the kinds of values you # may assign to this variable. # # * HISTORY_SUBSTRING_SEARCH_GLOBBING_FLAGS is a global variable that defines # how the command history will be searched for your query. Its default value # causes this script to perform a case-insensitive search. See the "Globbing # Flags" section in the zshexpn(1) man page to learn about the kinds of # values you may assign to this variable. # #----------------------------------------------------------------------------- # History #----------------------------------------------------------------------------- # # This script was originally written by Peter Stephenson[2], who published it # to the ZSH users mailing list (thereby making it public domain) in September # 2009. It was later revised by Guido van Steen and released under the BSD # license (see below) as part of the fizsh[3] project in January 2011. # # It was later extracted from fizsh[3] release 1.0.1, refactored heavily, and # repackaged as both an oh-my-zsh plugin[4] and as an independently loadable # ZSH script[5] by Suraj N. Kurapati in 2011. # # It was further developed[4] by Guido van Steen, Suraj N. Kurapati, Sorin # Ionescu, and Vincent Guerci in 2011. # # [1]: http://fishshell.com # [2]: http://www.zsh.org/mla/users/2009/msg00818.html # [3]: http://sourceforge.net/projects/fizsh/ # [4]: https://github.com/robbyrussell/oh-my-zsh/pull/215 # [5]: https://github.com/sunaku/zsh-history-substring-search # [6]: https://github.com/nicoulaj/zsh-syntax-highlighting # ############################################################################## # # Copyright (c) 2009 Peter Stephenson # Copyright (c) 2011 Guido van Steen # Copyright (c) 2011 Suraj N. Kurapati # Copyright (c) 2011 Sorin Ionescu # Copyright (c) 2011 Vincent Guerci # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # # * Redistributions in binary form must reproduce the above # copyright notice, this list of conditions and the following # disclaimer in the documentation and/or other materials provided # with the distribution. # # * Neither the name of the FIZSH nor the names of its contributors # may be used to endorse or promote products derived from this # software without specific prior written permission. # # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE # POSSIBILITY OF SUCH DAMAGE. # ############################################################################## #----------------------------------------------------------------------------- # configuration variables #----------------------------------------------------------------------------- HISTORY_SUBSTRING_SEARCH_HIGHLIGHT_FOUND='bg=magenta,fg=white,bold' HISTORY_SUBSTRING_SEARCH_HIGHLIGHT_NOT_FOUND='bg=red,fg=white,bold' HISTORY_SUBSTRING_SEARCH_GLOBBING_FLAGS='i' #----------------------------------------------------------------------------- # the main ZLE widgets #----------------------------------------------------------------------------- function history-substring-search-up() { _history-substring-search-begin _history-substring-search-up-history || _history-substring-search-up-buffer || _history-substring-search-up-search _history-substring-search-end } function history-substring-search-down() { _history-substring-search-begin _history-substring-search-down-history || _history-substring-search-down-buffer || _history-substring-search-down-search _history-substring-search-end } zle -N history-substring-search-up zle -N history-substring-search-down bindkey '\e[A' history-substring-search-up bindkey '\e[B' history-substring-search-down #----------------------------------------------------------------------------- # implementation details #----------------------------------------------------------------------------- setopt extendedglob zmodload -F zsh/parameter # # We have to "override" some keys and widgets if the # zsh-syntax-highlighting plugin has not been loaded: # # https://github.com/nicoulaj/zsh-syntax-highlighting # if [[ $+functions[_zsh_highlight] -eq 0 ]]; then # # Dummy implementation of _zsh_highlight() # that simply removes existing highlights # function _zsh_highlight() { region_highlight=() } # # Remove existing highlights when the user # inserts printable characters into $BUFFER # function ordinary-key-press() { if [[ $KEYS == [[:print:]] ]]; then region_highlight=() fi zle .self-insert } zle -N self-insert ordinary-key-press # # Override ZLE widgets to invoke _zsh_highlight() # # https://github.com/nicoulaj/zsh-syntax-highlighting/blob/ # bb7fcb79fad797a40077bebaf6f4e4a93c9d8163/zsh-syntax-highlighting.zsh#L121 # #--------------8<-------------------8<-------------------8<----------------- # # Copyright (c) 2010-2011 zsh-syntax-highlighting contributors # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are # met: # # * Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # # * Redistributions in binary form must reproduce the above copyright # notice, this list of conditions and the following disclaimer in the # documentation and/or other materials provided with the distribution. # # * Neither the name of the zsh-syntax-highlighting contributors nor the # names of its contributors may be used to endorse or promote products # derived from this software without specific prior written permission. # # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS # IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, # THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR # PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR # CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, # EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, # PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR # PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF # LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING # NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS # SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. # Load ZSH module zsh/zleparameter, needed to override user defined widgets. zmodload zsh/zleparameter 2>/dev/null || { echo 'zsh-syntax-highlighting: failed loading zsh/zleparameter, exiting.' >&2 return -1 } # Override ZLE widgets to make them invoke _zsh_highlight. for event in ${${(f)"$(zle -la)"}:#(_*|orig-*|.run-help|.which-command)}; do if [[ "$widgets[$event]" == completion:* ]]; then eval "zle -C orig-$event ${${${widgets[$event]}#*:}/:/ } ; $event() { builtin zle orig-$event && _zsh_highlight } ; zle -N $event" else case $event in accept-and-menu-complete) eval "$event() { builtin zle .$event && _zsh_highlight } ; zle -N $event" ;; # The following widgets should NOT remove any previously # applied highlighting. Therefore we do not remap them. .forward-char|.backward-char|.up-line-or-history|.down-line-or-history) ;; .*) clean_event=$event[2,${#event}] # Remove the leading dot in the event name case ${widgets[$clean_event]-} in (completion|user):*) ;; *) eval "$clean_event() { builtin zle $event && _zsh_highlight } ; zle -N $clean_event" ;; esac ;; *) ;; esac fi done unset event clean_event #-------------->8------------------->8------------------->8----------------- fi function _history-substring-search-begin() { _history_substring_search_move_cursor_eol=false _history_substring_search_query_highlight= # # Continue using the previous $_history_substring_search_result by default, # unless the current query was cleared or a new/different query was entered. # if [[ -z $BUFFER || $BUFFER != $_history_substring_search_result ]]; then # # For the purpose of highlighting we will also keep # a version without doubly-escaped meta characters. # _history_substring_search_query=$BUFFER # # $BUFFER contains the text that is in the command-line currently. # we put an extra "\\" before meta characters such as "\(" and "\)", # so that they become "\\\(" and "\\\)". # _history_substring_search_query_escaped=${BUFFER//(#m)[\][()|\\*?#<>~^]/\\$MATCH} # # Find all occurrences of the search query in the history file. # # (k) turns it an array of line numbers. # # (on) seems to remove duplicates, which are default # options. They can be turned off by (ON). # _history_substring_search_matches=(${(kon)history[(R)(#$HISTORY_SUBSTRING_SEARCH_GLOBBING_FLAGS)*${_history_substring_search_query_escaped}*]}) # # Define the range of values that $_history_substring_search_match_index # can take: [0, $_history_substring_search_matches_count_plus]. # _history_substring_search_matches_count=$#_history_substring_search_matches _history_substring_search_matches_count_plus=$(( _history_substring_search_matches_count + 1 )) _history_substring_search_matches_count_sans=$(( _history_substring_search_matches_count - 1 )) # # If $_history_substring_search_match_index is equal to # $_history_substring_search_matches_count_plus, this indicates that we # are beyond the beginning of $_history_substring_search_matches. # # If $_history_substring_search_match_index is equal to 0, this indicates # that we are beyond the end of $_history_substring_search_matches. # # If we have initially pressed "up" we have to initialize # $_history_substring_search_match_index to # $_history_substring_search_matches_count_plus so that it will be # decreased to $_history_substring_search_matches_count. # # If we have initially pressed "down" we have to initialize # $_history_substring_search_match_index to # $_history_substring_search_matches_count so that it will be increased to # $_history_substring_search_matches_count_plus. # if [[ $WIDGET == history-substring-search-down ]]; then _history_substring_search_match_index=$_history_substring_search_matches_count else _history_substring_search_match_index=$_history_substring_search_matches_count_plus fi fi } function _history-substring-search-end() { _history_substring_search_result=$BUFFER # move the cursor to the end of the command line if [[ $_history_substring_search_move_cursor_eol == true ]]; then CURSOR=${#BUFFER} fi # highlight command line using zsh-syntax-highlighting _zsh_highlight # highlight the search query inside the command line if [[ -n $_history_substring_search_query_highlight && -n $_history_substring_search_query ]]; then # # The following expression yields a variable $MBEGIN, which # indicates the begin position + 1 of the first occurrence # of _history_substring_search_query_escaped in $BUFFER. # : ${(S)BUFFER##(#m$HISTORY_SUBSTRING_SEARCH_GLOBBING_FLAGS)($_history_substring_search_query##)} local begin=$(( MBEGIN - 1 )) local end=$(( begin + $#_history_substring_search_query )) region_highlight+=("$begin $end $_history_substring_search_query_highlight") fi # For debugging purposes: # zle -R "mn: "$_history_substring_search_match_index" m#: "${#_history_substring_search_matches} # read -k -t 200 && zle -U $REPLY # Exit successfully from the history-substring-search-* widgets. true } function _history-substring-search-up-buffer() { # # Check if the UP arrow was pressed to move the cursor within a multi-line # buffer. This amounts to three tests: # # 1. $#buflines -gt 1. # # 2. $CURSOR -ne $#BUFFER. # # 3. Check if we are on the first line of the current multi-line buffer. # If so, pressing UP would amount to leaving the multi-line buffer. # # We check this by adding an extra "x" to $LBUFFER, which makes # sure that xlbuflines is always equal to the number of lines # until $CURSOR (including the line with the cursor on it). # local buflines XLBUFFER xlbuflines buflines=(${(f)BUFFER}) XLBUFFER=$LBUFFER"x" xlbuflines=(${(f)XLBUFFER}) if [[ $#buflines -gt 1 && $CURSOR -ne $#BUFFER && $#xlbuflines -ne 1 ]]; then zle up-line-or-history return true fi false } function _history-substring-search-down-buffer() { # # Check if the DOWN arrow was pressed to move the cursor within a multi-line # buffer. This amounts to three tests: # # 1. $#buflines -gt 1. # # 2. $CURSOR -ne $#BUFFER. # # 3. Check if we are on the last line of the current multi-line buffer. # If so, pressing DOWN would amount to leaving the multi-line buffer. # # We check this by adding an extra "x" to $RBUFFER, which makes # sure that xrbuflines is always equal to the number of lines # from $CURSOR (including the line with the cursor on it). # local buflines XRBUFFER xrbuflines buflines=(${(f)BUFFER}) XRBUFFER="x"$RBUFFER xrbuflines=(${(f)XRBUFFER}) if [[ $#buflines -gt 1 && $CURSOR -ne $#BUFFER && $#xrbuflines -ne 1 ]]; then zle down-line-or-history return true fi false } function _history-substring-search-up-history() { # # Behave like up in ZSH, except clear the $BUFFER # when beginning of history is reached like in Fish. # if [[ -z $_history_substring_search_query ]]; then # we have reached the absolute top of history if [[ $HISTNO -eq 1 ]]; then BUFFER= # going up from somewhere below the top of history else zle up-history fi return true fi false } function _history-substring-search-down-history() { # # Behave like down-history in ZSH, except clear the # $BUFFER when end of history is reached like in Fish. # if [[ -z $_history_substring_search_query ]]; then # going down from the absolute top of history if [[ $HISTNO -eq 1 && -z $BUFFER ]]; then BUFFER=${history[1]} _history_substring_search_move_cursor_eol=true # going down from somewhere above the bottom of history else zle down-history fi return true fi false } function _history-substring-search-up-search() { _history_substring_search_move_cursor_eol=true # # Highlight matches during history-substring-up-search: # # The following constants have been initialized in # _history-substring-search-up/down-search(): # # $_history_substring_search_matches is the current list of matches # $_history_substring_search_matches_count is the current number of matches # $_history_substring_search_matches_count_plus is the current number of matches + 1 # $_history_substring_search_matches_count_sans is the current number of matches - 1 # $_history_substring_search_match_index is the index of the current match # # The range of values that $_history_substring_search_match_index can take # is: [0, $_history_substring_search_matches_count_plus]. A value of 0 # indicates that we are beyond the end of # $_history_substring_search_matches. A value of # $_history_substring_search_matches_count_plus indicates that we are beyond # the beginning of $_history_substring_search_matches. # # In _history-substring-search-up-search() the initial value of # $_history_substring_search_match_index is # $_history_substring_search_matches_count_plus. This value is set in # _history-substring-search-begin(). _history-substring-search-up-search() # will initially decrease it to $_history_substring_search_matches_count. # if [[ $_history_substring_search_match_index -ge 2 ]]; then # # Highlight the next match: # # 1. Decrease the value of $_history_substring_search_match_index. # # 2. Use $HISTORY_SUBSTRING_SEARCH_HIGHLIGHT_FOUND # to highlight the current buffer. # (( _history_substring_search_match_index-- )) BUFFER=$history[$_history_substring_search_matches[$_history_substring_search_match_index]] _history_substring_search_query_highlight=$HISTORY_SUBSTRING_SEARCH_HIGHLIGHT_FOUND elif [[ $_history_substring_search_match_index -eq 1 ]]; then # # We will move beyond the end of $_history_substring_search_matches: # # 1. Decrease the value of $_history_substring_search_match_index. # # 2. Save the current buffer in $_history_substring_search_old_buffer, # so that it can be retrieved by # _history-substring-search-down-search() later. # # 3. Make $BUFFER equal to $_history_substring_search_query. # # 4. Use $HISTORY_SUBSTRING_SEARCH_HIGHLIGHT_NOT_FOUND # to highlight the current buffer. # (( _history_substring_search_match_index-- )) _history_substring_search_old_buffer=$BUFFER BUFFER=$_history_substring_search_query _history_substring_search_query_highlight=$HISTORY_SUBSTRING_SEARCH_HIGHLIGHT_NOT_FOUND elif [[ $_history_substring_search_match_index -eq $_history_substring_search_matches_count_plus ]]; then # # We were beyond the beginning of $_history_substring_search_matches but # UP makes us move back to $_history_substring_search_matches: # # 1. Decrease the value of $_history_substring_search_match_index. # # 2. Restore $BUFFER from $_history_substring_search_old_buffer. # # 3. Use $HISTORY_SUBSTRING_SEARCH_HIGHLIGHT_FOUND # to highlight the current buffer. # (( _history_substring_search_match_index-- )) BUFFER=$_history_substring_search_old_buffer _history_substring_search_query_highlight=$HISTORY_SUBSTRING_SEARCH_HIGHLIGHT_FOUND fi } function _history-substring-search-down-search() { _history_substring_search_move_cursor_eol=true # # Highlight matches during history-substring-up-search: # # The following constants have been initialized in # _history-substring-search-up/down-search(): # # $_history_substring_search_matches is the current list of matches # $_history_substring_search_matches_count is the current number of matches # $_history_substring_search_matches_count_plus is the current number of matches + 1 # $_history_substring_search_matches_count_sans is the current number of matches - 1 # $_history_substring_search_match_index is the index of the current match # # The range of values that $_history_substring_search_match_index can take # is: [0, $_history_substring_search_matches_count_plus]. A value of 0 # indicates that we are beyond the end of # $_history_substring_search_matches. A value of # $_history_substring_search_matches_count_plus indicates that we are beyond # the beginning of $_history_substring_search_matches. # # In _history-substring-search-down-search() the initial value of # $_history_substring_search_match_index is # $_history_substring_search_matches_count. This value is set in # _history-substring-search-begin(). # _history-substring-search-down-search() will initially increase it to # $_history_substring_search_matches_count_plus. # if [[ $_history_substring_search_match_index -le $_history_substring_search_matches_count_sans ]]; then # # Highlight the next match: # # 1. Increase $_history_substring_search_match_index by 1. # # 2. Use $HISTORY_SUBSTRING_SEARCH_HIGHLIGHT_FOUND # to highlight the current buffer. # (( _history_substring_search_match_index++ )) BUFFER=$history[$_history_substring_search_matches[$_history_substring_search_match_index]] _history_substring_search_query_highlight=$HISTORY_SUBSTRING_SEARCH_HIGHLIGHT_FOUND elif [[ $_history_substring_search_match_index -eq $_history_substring_search_matches_count ]]; then # # We will move beyond the beginning of $_history_substring_search_matches: # # 1. Increase $_history_substring_search_match_index by 1. # # 2. Save the current buffer in $_history_substring_search_old_buffer, so # that it can be retrieved by _history-substring-search-up-search() # later. # # 3. Make $BUFFER equal to $_history_substring_search_query. # # 4. Use $HISTORY_SUBSTRING_SEARCH_HIGHLIGHT_NOT_FOUND # to highlight the current buffer. # (( _history_substring_search_match_index++ )) _history_substring_search_old_buffer=$BUFFER BUFFER=$_history_substring_search_query _history_substring_search_query_highlight=$HISTORY_SUBSTRING_SEARCH_HIGHLIGHT_NOT_FOUND elif [[ $_history_substring_search_match_index -eq 0 ]]; then # # We were beyond the end of $_history_substring_search_matches but DOWN # makes us move back to the $_history_substring_search_matches: # # 1. Increase $_history_substring_search_match_index by 1. # # 2. Restore $BUFFER from $_history_substring_search_old_buffer. # # 3. Use $HISTORY_SUBSTRING_SEARCH_HIGHLIGHT_FOUND # to highlight the current buffer. # (( _history_substring_search_match_index++ )) BUFFER=$_history_substring_search_old_buffer _history_substring_search_query_highlight=$HISTORY_SUBSTRING_SEARCH_HIGHLIGHT_FOUND fi } # -*- mode: zsh; sh-indentation: 2; indent-tabs-mode: nil; sh-basic-offset: 2; -*- # vim: ft=zsh sw=2 ts=2 et
We will be screening EVERY 6 Nations match over the coming weeks and we can’t wait for another great tournament. During every Ireland match pints of Guiness are 4e for anyone wearing an Irish jersey. Book a table now to reserve your seats.
Projectors may have marks or scratches from general use, these are surplus stock that were only taken out of service for upgrades. The item “Epson PowerLite Pro G5650W HD HDMI Widescreen Projector 3LCD 4500 Lumens” is in sale since Thursday, March 21, 2019. This item is in the category “Consumer Electronics\TV, Video & Home Audio\TV & Video\Home Theater Projectors”. The seller is “dehlol” and is located in Tucson, Arizona. This item can be shipped to United States, Canada, United Kingdom, Denmark, Romania, Slovakia, Bulgaria, Czech republic, Finland, Hungary, Latvia, Lithuania, Malta, Estonia, Australia, Greece, Portugal, Cyprus, Slovenia, Japan, Sweden, South Korea, Indonesia, Taiwan, Belgium, France, Hong Kong, Ireland, Netherlands, Poland, Spain, Italy, Germany, Austria, Bahamas, Israel, New Zealand, Philippines, Singapore, Switzerland, Norway, Saudi arabia, Ukraine, United arab emirates, Qatar, Kuwait, Bahrain, Croatia, Uruguay, China, Antigua and barbuda, Aruba, Belize, Dominica, Grenada, Saint kitts and nevis, Montserrat, Turks and caicos islands, Barbados, Bangladesh, Bermuda, Brunei darussalam, Bolivia, Egypt, French guiana, Gibraltar, Guadeloupe, Iceland, Jordan, Cambodia, Cayman islands, Liechtenstein, Luxembourg, Martinique, Maldives, Nicaragua, Oman, Pakistan, Paraguay, Reunion. Heres a projector the whole family can enjoy; from watching box sets to delivering sharp presentations, this XGA projector has the tools for the job. Theres no need to worry about ambient light; it produces a bright and clear display with 3,600 lumens and 3LCD technology. It’s also easy to transport and set up. Add to Favorite Sellers. Bigger is better Whether youre watching your favourite blockbusters or delivering a presentation, this projector can achieve an impressive 300-inch display. It’s great quality too, with 3LCD technology that makes the display up to three times brighter than competitor products². In addition to its bright and vivid colours, the 15,000:1 contrast ratio produces defined shadows and deep blacks. From family and friends to business colleagues and clients, it’s sure to get everyones attention. High-quality, bright images Even in bright rooms, this powerful yet affordable XGA projector delivers exceptionally bright yet colourful images with clear details. It’s all thanks to 3LCD technology, which produces an equally high White and Colour Light Output of 3,600 lumens. Long-lasting solution Looking for a long-term, hassle-free and affordable solution for your projection needs? With this model’s long-lasting lamp light source, you could watch a film every day for 15 years¹. Stress-free set up Heres a projector thats designed with portability and quick set up in mind. The carry case makes it easy to move from room to room, and you can quickly position the image with keystone correction and access content simply with the HDMI inputs. With the optional ELPAP10 adapter, it offers Wi-Fi connectivity, allowing you to share content from a smart device using the iProjection app. Create the big screen experience. Bright even with ambient light. Portable and quick to set up. Based on watching an average 1hr 45mins film every day and the lamp set in Eco mode. 2 Colour brightness (Colour Light Output) in brightest mode, measured by a third-party lab in accordance with IDMS 15.4. Colour brightness will vary depending on usage conditions. The item “Epson EB-X41 XGA 3600 Lumens 3LCD Smart HD Ready Home Office Projector White” is in sale since Wednesday, February 27, 2019. This item is in the category “Sound & Vision\DVD, Blu-ray & Home Cinema\Home Cinema Projectors”. The seller is “epson_official_outlet” and is located in Hemel Hempstead, Hertfordshire. This item can be shipped to United Kingdom. The Hi for sale here is a brand new Epson Tw9300. Ive owned since October 2018. This has not been used at all. This has no Box so collection only. The item “Epson Eh-tw9300 2500 ANSI 3lcd Full HD 4k Enhanced Home Cinema Projector” is in sale since Tuesday, March 12, 2019. This item is in the category “Sound & Vision\DVD, Blu-ray & Home Cinema\Home Cinema Projectors”. The seller is “fubar1976″ and is located in Worcester. This item can’t be shipped, the buyer must pick up the item. Epson EB-U05 Full HD 3LCD Projector 15,000:1 3400 Lumens 1920×1200 2.8kg. Barely used, in great condition. Very easy set up. All contents pictured. The item “Epson EB-U05 Full HD 3LCD Projector 15,0001 3400 Lumens 1920×1200 2.8kg” is in sale since Friday, February 15, 2019. This item is in the category “Sound & Vision\DVD, Blu-ray & Home Cinema\Home Cinema Projectors”. The seller is “cerpie0″ and is located in Chester. This item can be shipped to United Kingdom. Epson 5040UB PowerLite 3LCD Projector, 4K Enhancement & HDR (Open Box). Delivers an immersive viewing experience (3D glasses required). The 2D-to-3D conversion allows you to easily transform 2D images into stunning 3D content. 2500 lumens of color brightness and 2500 lumens of white brightness. Boost display visibility and produce clear, vibrant on-screen images. High dynamic range (HDR) creates a more realistic picture. HDR technology expands the contrast and color range of the pixels on your projector to reveal a better, brighter, more colorful image. The picture quality is noticeably more natural. Delivers 3x brighter colors and reliable performance for brilliant images with true-to-life color. Get brilliant, color-rich performance that displays the entire sRGB color space, plus DCI in Digital Cinema Mode. Epson® Image Enhancement Technology. Features Super-resolution and improved Detail Enhancement to sharpen and refine images for lifelike smoothness and clarity. Accepts 4K input and supports HDCP 2.2 for scenes with 4K content. Shifts each pixel diagonally by 0.5 pixels to double the resolution and surpass Full HD image quality. Epson projectors that call out color or white brightness Color brightness (color light output) and white brightness (white light output) will vary depending on usage conditions. Color light output measured in accordance with IDMS 15.4. White light output measured in accordance with ISO 21118. Epson projectors that call out 3LCD, 3-chip technology Compared to leading 1-chip DLP business and education projectors based on NPD data, July 2011 through June 2012. Color brightness (color light output) measured in accordance with IDMS 15.4. Color brightness will vary depending on usage conditions. We’re committed to providing you with the best experience possible, every time you shop. Prices fluctuate in this market on a daily basis in accordance with manufacturers marketing guidelines. If your item has already left the warehouse, we cannot match any reduced pricing. We do not sell to resellers. May require additional customer verification. If information cannot be verified, we reserve the right to cancel the order. If your item is in fact defective, we will replace it at no extra cost to you. If your item is in fact damaged, we will replace it at no extra cost to you. WE ARE HERE TO HELP WITH ANY AND ALL ISSUES. We are excited to help you with all of you A/V and Home Theater needs. Each one of our customers is treated as VIP and we always strive for you to have a five star experience! We are here to serve you best! The item “Epson 5040UB PowerLite 3LCD Projector, 4K Enhancement & HDR (Open Box)” is in sale since Thursday, November 8, 2018. This item is in the category “Consumer Electronics\TV, Video & Home Audio\TV & Video\Home Theater Projectors”. The seller is “five-star-buy” and is located in Multiple locations. This item can be shipped to United States, United Kingdom, Denmark, Romania, Slovakia, Bulgaria, Czech republic, Finland, Hungary, Latvia, Lithuania, Malta, Estonia, Australia, Greece, Portugal, Cyprus, Slovenia, Japan, Sweden, South Korea, Indonesia, Belgium, France, Hong Kong, Ireland, Netherlands, Poland, Spain, Italy, Germany, Austria, Bahamas, Israel, New Zealand, Singapore, Switzerland, Norway, Saudi arabia, Ukraine, United arab emirates, Qatar, Bahrain, Croatia, Viet nam, Uruguay. Epson G5200W 3LCD Projector. Professionally-Refurbished Projector in Perfect/Excellent Working Condition. Internal Optic has been cleaned to ensure the highest possible imaging quality. The life expectancy of the projectors lamp is estimated to be at least at 65% of the original. Bright, sharp, crisp and clear, high-quality image. The projectors body may have some scratches or marks. Our experienced technicians perform an in-depth, 5-point quality inspection/testing on every projector and refurbish it if necessary. The reconditioned projector of the highest quality at the price you can afford! Notes: At TeKswamp we make every effort to make sure that every projector we sell has been thoroughly cleaned of all the dust and dirt on the inside. All the vital components are meticulously tested for optimal performance and replaced, if necessary. FREE Convenient Accessories Included by TeKswamp. No other cables or accessories are included. A power cable is NOT included in international orders. The operation of any electronics using foreign adapters may cause the equipment to malfunction and/or become a fire hazard. 2 Included is a high quality remote custom programmed to specifically work with your model of projector. Equipment may have some cosmetic marks, scratches and/or blemishes in areas other than what is shown. At TeKSwamp we have more than 10 years of positive experience specializing in refurbishing electronics! To maintain the highest standards of service to our customers we pledge ALL of the following. Information below is for educational purposes only. The following information should be viewed as constructive advice based on years of experience. Projector Image Quality, Image Brightness, Thoroughness of Inspections, Proper Product Representation. There are many factors that may affect image quality, brightness and overall value of a projector, most of which goes unnoticed by the untrained eye. Dust Optic Burns Image Quality. Optic burns may discolor the image or create discolored spots. These spots can be caused by the long hours of use, inappropriate temperature or dust. Dust accumulation is present in most used projectors. It tends to create darker projection image and can leave spots on the projection by getting attached to the optic inside. It may be nearly impossible to remove the dust from the optic without completely disassembling the projector first. It can also attach itself to heat sensitive areas of the projector, causing it to overheat or malfunction. TeKswamp technicians check the quality of the projection image and thoroughly clean the inside and outside of the projectors to eliminate as much dust as possible. Important Information about Projector Lamps. Many non-authentic, non-OEM lamps can stop functioning within 6 to 12 months whether the projector has been used or not. Generic lamps may produce a darker or brighter image than an OEM lamp. Non-authentic lamps die more quickly because of inferior build quality, when the gas sealed within the lamp begins to leak. Also, the lamp can be brighter than specified and may burn the projectors optic by running on a higher temperature than the projector is designed for. TeKswamp ensures that you receive a lamp with low hours. In addition, TeKswamp inspects every lamp to check for burns, dust and clarity of the lamp reflector. Projector Inspections and Testing. Used projectors MUST be thoroughly inspected and tested for optimal functionality and endurance. For example, some used projectors can overheat and simply turn off to prevent any further damage. Also, it is hard to notice smaller malfunctions until it is too late, such as malfunctioning legs/buttons or high lamp hours, etc. Example: If a projector leg doesnt function properly, it could create some major hassle if you need to constantly set up, jimmy and move your projector around. TeKswamp inspects EVERY aspect of the projectors it sells. Why do we go through so much hassle? We Take Pride in Our Work and in Our Ability to Offer the Very Best High Tech Reconditioned Products Available! Important Information with Regard to Projector Specifications. It is important to familiarize yourself with projector specifications. You can decide for yourself whether a particular projector suits your type of needs. With TeKswamp, you will always get your moneys worth and then some! Right Kind of a Projector for You Specific Needs. OCCASIONAL USAGE [Really Tight Budget, Bright Picture Required]. Examples: Family reunions, Parties, Ceremonies – when you want to make a great impression but have a limited budget. WEEKLY USAGE [School/College, Church]. Examples: For teachers, consider a Short Throw LCD Projector that will not blind teachers eyes every time he/she looks at the projector. (Search short throw projector for more information). LCD projector 2000+ (recommended for a darker room) or 2500+ ANSI lumens. Important Note: DLP projectors are not recommended in this case. They are less reliable and create a rainbow effect in motion images. (Search: DLP projector rainbow effect for more information). COMMERCIAL USAGE (Powerpoints, Short Video Presentations). Use LCD for lower-speed presentations, such as PowerPoint presentations. They produce richer color, more reliable in transportation, but bigger. Alternative: Use DLP for video presentations or when the size and weight are of importance: 3-4lb for DLP vs 6-7lb for LCD. WEEKLY USAGE (Home Theater, Games). High contrast LCD (preferably) 2000:1 or more 3D DLP 3000+ lumens for 3D movies Native Wide Resolution or at least 1024×768 2500+ lumens HDMI input. OCCASIONAL USAGE (Home Theater, Games). DLP 2500+ lumens with HDMI adapter 1080i supported. Brightness of the projection is even more important outdoors. Please look for larger, commercial-grade projectors. They have better cooling abilities and can better cope with different weather conditions (temperature, humidity, etc). The item “Epson G5200W 3LCD Projector 4200 Lumens HD 1080i HDMI withAccessories bundle” is in sale since Monday, November 12, 2018. This item is in the category “Consumer Electronics\TV, Video & Home Audio\TV & Video\Home Theater Projectors”. The seller is “tekswamp_projectors” and is located in Sarasota, Florida. This item can be shipped worldwide.
Sponsored post in partnership with Hudson Whiskey. In 2001, when we purchased the Tuthilltown Gristmill to open a rock climber’s ranch, the neighbours baulked. So we had to find another way. The 240-year history of the mill led us to it. Grain, water, yeast and a new purpose: We decided to make whiskey. With our own skills and a lot of hard work, we converted the two granaries into the first whiskey distillery in New York State since Prohibition. We didn’t know anything about distilling whiskey. We decided not to think “out of the box.” Instead, we burned the box and started fresh. For two years we travelled to distilleries and talked to experts around the globe. All the while building our distillery, acquiring our permits and waiting for our stills to arrive. It took six months of experimentation to produce great, rich whiskey by hand, one batch at a time. Along the way, we changed the way whiskey is made and we changed our lives. The Industrial Revolution dies at the beginning of our driveway. We’re about handcrafted spirits. Our Distillerymen are always in direct contact with the materials and the spirit of the distillery. From grain to glass, we take great care and pride in all of our spirits. We’ve captured local flavour and ambience using the agricultural resources of local farmers while leaving a smaller footprint on the environment. Like true New Yorkers, we’ve toughed it out and thrived. Our staff is honoured and thrilled to have been named “Best Artisan Distiller of 2010” by the American Distilling Institute. Just regular folk making whiskey that has earned its place on the top shelf. It was quite a climb, but it sure looks good from here. Many thanks, Fate. The next round’s on us.
/* * linux/arch/alpha/kernel/sys_noritake.c * * Copyright (C) 1995 David A Rusling * Copyright (C) 1996 Jay A Estabrook * Copyright (C) 1998, 1999 Richard Henderson * * Code supporting the NORITAKE (AlphaServer 1000A), * CORELLE (AlphaServer 800), and ALCOR Primo (AlphaStation 600A). */ #include <linux/kernel.h> #include <linux/types.h> #include <linux/mm.h> #include <linux/sched.h> #include <linux/pci.h> #include <linux/init.h> #include <linux/bitops.h> #include <asm/ptrace.h> #include <asm/system.h> #include <asm/dma.h> #include <asm/irq.h> #include <asm/mmu_context.h> #include <asm/io.h> #include <asm/pgtable.h> #include <asm/core_apecs.h> #include <asm/core_cia.h> #include <asm/tlbflush.h> #include "proto.h" #include "irq_impl.h" #include "pci_impl.h" #include "machvec_impl.h" /* Note mask bit is true for ENABLED irqs. */ static int cached_irq_mask; static inline void noritake_update_irq_hw(int irq, int mask) { int port = 0x54a; if (irq >= 32) { mask >>= 16; port = 0x54c; } outw(mask, port); } static void noritake_enable_irq(unsigned int irq) { noritake_update_irq_hw(irq, cached_irq_mask |= 1 << (irq - 16)); } static void noritake_disable_irq(unsigned int irq) { noritake_update_irq_hw(irq, cached_irq_mask &= ~(1 << (irq - 16))); } static unsigned int noritake_startup_irq(unsigned int irq) { noritake_enable_irq(irq); return 0; } static struct hw_interrupt_type noritake_irq_type = { .typename = "NORITAKE", .startup = noritake_startup_irq, .shutdown = noritake_disable_irq, .enable = noritake_enable_irq, .disable = noritake_disable_irq, .ack = noritake_disable_irq, .end = noritake_enable_irq, }; static void noritake_device_interrupt(unsigned long vector, struct pt_regs *regs) { unsigned long pld; unsigned int i; /* Read the interrupt summary registers of NORITAKE */ pld = (((unsigned long) inw(0x54c) << 32) | ((unsigned long) inw(0x54a) << 16) | ((unsigned long) inb(0xa0) << 8) | inb(0x20)); /* * Now for every possible bit set, work through them and call * the appropriate interrupt handler. */ while (pld) { i = ffz(~pld); pld &= pld - 1; /* clear least bit set */ if (i < 16) { isa_device_interrupt(vector, regs); } else { handle_irq(i, regs); } } } static void noritake_srm_device_interrupt(unsigned long vector, struct pt_regs * regs) { int irq; irq = (vector - 0x800) >> 4; /* * I really hate to do this, too, but the NORITAKE SRM console also * reports PCI vectors *lower* than I expected from the bit numbers * in the documentation. * But I really don't want to change the fixup code for allocation * of IRQs, nor the alpha_irq_mask maintenance stuff, both of which * look nice and clean now. * So, here's this additional grotty hack... :-( */ if (irq >= 16) irq = irq + 1; handle_irq(irq, regs); } static void __init noritake_init_irq(void) { long i; if (alpha_using_srm) alpha_mv.device_interrupt = noritake_srm_device_interrupt; outw(0, 0x54a); outw(0, 0x54c); for (i = 16; i < 48; ++i) { irq_desc[i].status = IRQ_DISABLED | IRQ_LEVEL; irq_desc[i].chip = &noritake_irq_type; } init_i8259a_irqs(); common_init_isa_dma(); } /* * PCI Fixup configuration. * * Summary @ 0x542, summary register #1: * Bit Meaning * 0 All valid ints from summary regs 2 & 3 * 1 QLOGIC ISP1020A SCSI * 2 Interrupt Line A from slot 0 * 3 Interrupt Line B from slot 0 * 4 Interrupt Line A from slot 1 * 5 Interrupt line B from slot 1 * 6 Interrupt Line A from slot 2 * 7 Interrupt Line B from slot 2 * 8 Interrupt Line A from slot 3 * 9 Interrupt Line B from slot 3 *10 Interrupt Line A from slot 4 *11 Interrupt Line B from slot 4 *12 Interrupt Line A from slot 5 *13 Interrupt Line B from slot 5 *14 Interrupt Line A from slot 6 *15 Interrupt Line B from slot 6 * * Summary @ 0x544, summary register #2: * Bit Meaning * 0 OR of all unmasked ints in SR #2 * 1 OR of secondary bus ints * 2 Interrupt Line C from slot 0 * 3 Interrupt Line D from slot 0 * 4 Interrupt Line C from slot 1 * 5 Interrupt line D from slot 1 * 6 Interrupt Line C from slot 2 * 7 Interrupt Line D from slot 2 * 8 Interrupt Line C from slot 3 * 9 Interrupt Line D from slot 3 *10 Interrupt Line C from slot 4 *11 Interrupt Line D from slot 4 *12 Interrupt Line C from slot 5 *13 Interrupt Line D from slot 5 *14 Interrupt Line C from slot 6 *15 Interrupt Line D from slot 6 * * The device to slot mapping looks like: * * Slot Device * 7 Intel PCI-EISA bridge chip * 8 DEC PCI-PCI bridge chip * 11 PCI on board slot 0 * 12 PCI on board slot 1 * 13 PCI on board slot 2 * * * This two layered interrupt approach means that we allocate IRQ 16 and * above for PCI interrupts. The IRQ relates to which bit the interrupt * comes in on. This makes interrupt processing much easier. */ static int __init noritake_map_irq(struct pci_dev *dev, u8 slot, u8 pin) { static char irq_tab[15][5] __initdata = { /*INT INTA INTB INTC INTD */ /* note: IDSELs 16, 17, and 25 are CORELLE only */ { 16+1, 16+1, 16+1, 16+1, 16+1}, /* IdSel 16, QLOGIC */ { -1, -1, -1, -1, -1}, /* IdSel 17, S3 Trio64 */ { -1, -1, -1, -1, -1}, /* IdSel 18, PCEB */ { -1, -1, -1, -1, -1}, /* IdSel 19, PPB */ { -1, -1, -1, -1, -1}, /* IdSel 20, ???? */ { -1, -1, -1, -1, -1}, /* IdSel 21, ???? */ { 16+2, 16+2, 16+3, 32+2, 32+3}, /* IdSel 22, slot 0 */ { 16+4, 16+4, 16+5, 32+4, 32+5}, /* IdSel 23, slot 1 */ { 16+6, 16+6, 16+7, 32+6, 32+7}, /* IdSel 24, slot 2 */ { 16+8, 16+8, 16+9, 32+8, 32+9}, /* IdSel 25, slot 3 */ /* The following 5 are actually on PCI bus 1, which is across the built-in bridge of the NORITAKE only. */ { 16+1, 16+1, 16+1, 16+1, 16+1}, /* IdSel 16, QLOGIC */ { 16+8, 16+8, 16+9, 32+8, 32+9}, /* IdSel 17, slot 3 */ {16+10, 16+10, 16+11, 32+10, 32+11}, /* IdSel 18, slot 4 */ {16+12, 16+12, 16+13, 32+12, 32+13}, /* IdSel 19, slot 5 */ {16+14, 16+14, 16+15, 32+14, 32+15}, /* IdSel 20, slot 6 */ }; const long min_idsel = 5, max_idsel = 19, irqs_per_slot = 5; return COMMON_TABLE_LOOKUP; } static u8 __init noritake_swizzle(struct pci_dev *dev, u8 *pinp) { int slot, pin = *pinp; if (dev->bus->number == 0) { slot = PCI_SLOT(dev->devfn); } /* Check for the built-in bridge */ else if (PCI_SLOT(dev->bus->self->devfn) == 8) { slot = PCI_SLOT(dev->devfn) + 15; /* WAG! */ } else { /* Must be a card-based bridge. */ do { if (PCI_SLOT(dev->bus->self->devfn) == 8) { slot = PCI_SLOT(dev->devfn) + 15; break; } pin = bridge_swizzle(pin, PCI_SLOT(dev->devfn)) ; /* Move up the chain of bridges. */ dev = dev->bus->self; /* Slot of the next bridge. */ slot = PCI_SLOT(dev->devfn); } while (dev->bus->self); } *pinp = pin; return slot; } #if defined(CONFIG_ALPHA_GENERIC) || !defined(CONFIG_ALPHA_PRIMO) static void noritake_apecs_machine_check(unsigned long vector, unsigned long la_ptr, struct pt_regs * regs) { #define MCHK_NO_DEVSEL 0x205U #define MCHK_NO_TABT 0x204U struct el_common *mchk_header; unsigned int code; mchk_header = (struct el_common *)la_ptr; /* Clear the error before any reporting. */ mb(); mb(); /* magic */ draina(); apecs_pci_clr_err(); wrmces(0x7); mb(); code = mchk_header->code; process_mcheck_info(vector, la_ptr, regs, "NORITAKE APECS", (mcheck_expected(0) && (code == MCHK_NO_DEVSEL || code == MCHK_NO_TABT))); } #endif /* * The System Vectors */ #if defined(CONFIG_ALPHA_GENERIC) || !defined(CONFIG_ALPHA_PRIMO) struct alpha_machine_vector noritake_mv __initmv = { .vector_name = "Noritake", DO_EV4_MMU, DO_DEFAULT_RTC, DO_APECS_IO, .machine_check = noritake_apecs_machine_check, .max_isa_dma_address = ALPHA_MAX_ISA_DMA_ADDRESS, .min_io_address = EISA_DEFAULT_IO_BASE, .min_mem_address = APECS_AND_LCA_DEFAULT_MEM_BASE, .nr_irqs = 48, .device_interrupt = noritake_device_interrupt, .init_arch = apecs_init_arch, .init_irq = noritake_init_irq, .init_rtc = common_init_rtc, .init_pci = common_init_pci, .pci_map_irq = noritake_map_irq, .pci_swizzle = noritake_swizzle, }; ALIAS_MV(noritake) #endif #if defined(CONFIG_ALPHA_GENERIC) || defined(CONFIG_ALPHA_PRIMO) struct alpha_machine_vector noritake_primo_mv __initmv = { .vector_name = "Noritake-Primo", DO_EV5_MMU, DO_DEFAULT_RTC, DO_CIA_IO, .machine_check = cia_machine_check, .max_isa_dma_address = ALPHA_MAX_ISA_DMA_ADDRESS, .min_io_address = EISA_DEFAULT_IO_BASE, .min_mem_address = CIA_DEFAULT_MEM_BASE, .nr_irqs = 48, .device_interrupt = noritake_device_interrupt, .init_arch = cia_init_arch, .init_irq = noritake_init_irq, .init_rtc = common_init_rtc, .init_pci = cia_init_pci, .kill_arch = cia_kill_arch, .pci_map_irq = noritake_map_irq, .pci_swizzle = noritake_swizzle, }; ALIAS_MV(noritake_primo) #endif
<?php /** Lozi (Silozi) * * See MessagesQqq.php for message documentation incl. usage of parameters * To improve a translation please visit http://translatewiki.net * * @ingroup Language * @file * * @author Kaganer * @author Litingatinga Silozi * @author Ooswesthoesbes * @author SF-Language */ $messages = array( # User preference toggles 'tog-underline' => "Tumana ling'ko:", 'tog-highlightbroken' => 'Kamukile ling\'ki bufosi <a href="" class="new">sa</a> (lyam: sa<a href="" class="internal">?</a>).', 'tog-justify' => 'Singanyekile silamina', 'tog-usenewrc' => 'Inenset petuho nca (JavaScript)', 'tog-numberheadings' => 'Auto-palo mukunguna', 'tog-showtoolbar' => "Kamukile hloli ye ng'i toolbar (bulukezi JavaScript)", 'tog-editondblclick' => "Hloli ye ng'i petulo di 'klik' dubo (JavaScript)", 'tog-editsection' => "Nyembulisize [hloli ye ng'i] di akes di lyangutukezi ling'ki", 'tog-rememberpassword' => 'Askevusize zwa menuhile kwa bye kompyuta (for a maximum of $1 {{PLURAL:$1|day|days}})', 'tog-watchcreations' => 'Pusize petulo a hloli di zwa mukoloko di kentezi', 'tog-watchdefault' => "Pusize petulo a hloli ye ng'i di zwa mukoloko di kentezi", 'tog-watchmoves' => 'Pusize petulo a nyanganyisoze di zwa mukoloko di kentezi', 'tog-watchdeletion' => 'Pusize petulo a afi kulobala di zwa mukoloko di kentezi', 'tog-previewontop' => "Kamukile PendiBe pre boks di hloli ye ng'i", 'tog-previewonfirst' => 'Kamukile PendiBe kwa afi 1', 'tog-nocache' => 'Amutembwe petulo kahili', 'tog-enotifwatchlistpages' => 'Meli di zwa di petulo a kentezi sa petuhisize', 'tog-enotifusertalkpages' => 'Meli di zwa di zwa bulelezi sa petuhisize', 'tog-enotifrevealaddr' => 'Kamukile zwa adress di meli di xete peson kwa melina notifikasyona', 'tog-shownumberswatching' => 'Kamukile tali di kentezi sebelu', 'tog-fancysig' => "Ro sebu e data (dicon ling'ki auto)", 'tog-externaleditor' => "Sebelize hloli ye ng'i ektenali dauto", 'tog-externaldiff' => 'Sebelize petuho ektenali dauto', 'tog-showjumplinks' => 'Nyembulisize "sinkumukezi" ling\'ki', 'tog-uselivepreview' => 'Sebelize live PendiBe (bulukezi JavaScript) (yem nca)', 'tog-watchlisthideown' => 'Cwankekile zwa afina di zwa mukoloko di kentezi', 'tog-watchlisthidebots' => 'Cwankekile roboti di zwa mukoloko di kentezi', 'tog-nolangconversion' => 'Dinyembulisize selti konfesyoni', 'tog-ccmeonemails' => 'Afi di zwa dubina di melina a afi di xetewi sebelu', 'tog-diffonly' => 'Ni sa kamukile petulo selt pre petuho', 'underline-always' => 'Xet', 'underline-never' => 'Yexet', 'underline-default' => 'Pokuhe', # Dates 'sunday' => 'La Pumulo', 'monday' => 'La Mubulo', 'tuesday' => 'La Bubeli', 'wednesday' => 'La Bulalu', 'thursday' => 'La Bune', 'friday' => 'La Butanu', 'saturday' => 'La Mukibelo', 'sun' => 'Pum', 'mon' => 'Mub', 'tue' => 'Bub', 'wed' => 'Bul', 'thu' => 'Bun', 'fri' => 'But', 'sat' => 'Muk', 'january' => 'Sopa', 'february' => 'Yowa', 'march' => 'Liatamanyi', 'april' => 'Lungu', 'may_long' => 'Kandao', 'june' => 'Mbuwana', 'july' => 'Sikulu', 'august' => 'Muyana', 'september' => 'Muimunene', 'october' => 'Yenda', 'november' => 'Njimwana', 'december' => "Ng'ulule", 'january-gen' => 'Sopa', 'february-gen' => 'Yowa', 'march-gen' => 'Liatamanyi', 'april-gen' => 'Lungu', 'may-gen' => 'Kandao', 'june-gen' => 'Mbuwana', 'july-gen' => 'Sikulu', 'august-gen' => 'Muyana', 'september-gen' => 'Muimunene', 'october-gen' => 'Yenda', 'november-gen' => 'Njimwana', 'december-gen' => "Ng'ulule", 'jan' => 'Sop', 'feb' => 'Yow', 'mar' => 'Lia', 'apr' => 'Lun', 'may' => 'Kan', 'jun' => 'Mbu', 'jul' => 'Sik', 'aug' => 'Muy', 'sep' => 'Mui', 'oct' => 'Yen', 'nov' => 'Nji', 'dec' => 'Ngu', # Categories related messages 'pagecategories' => '{{PLURAL:$1|Kattegori|Kattegorina}}', 'category_header' => 'Kattegori petulo di "$1"', 'subcategories' => 'Subkattegori', 'category-media-header' => 'Kattegori media di "$1"', 'category-empty' => "''Wo kattegori cwale fumile ishi petulo nji media.''", 'listingcontinuesabbrev' => 'kepoli', 'about' => "Ngesi ye ng'i atulile", 'article' => 'Petulo', 'newwindow' => '(apuzi kwa nca windo)', 'cancel' => 'Ngambu', 'moredotdotdot' => 'Ye plus...', 'mypage' => 'Zwa petulo', 'mytalk' => 'Zwa bulelezi', 'anontalk' => 'Bulelezi di bye IP', 'navigation' => 'Muya', 'and' => '&#32;e', # Cologne Blue skin 'qbfind' => 'Fatukile', 'qbbrowse' => 'Nepile', 'qbedit' => "Hloli ye ng'i", 'qbpageoptions' => 'Bye petulo', 'qbpageinfo' => 'Petulo tuto', 'qbmyoptions' => 'Zwa petulona', 'qbspecialpages' => 'Petulo zwenti', 'faq' => 'Alabile', 'faqpage' => 'Project:Alabile', 'errorpagetitle' => 'Bufosi', 'returnto' => 'Kutezi $1.', 'tagline' => 'Di {{SITENAME}}', 'help' => 'Likitisize', 'search' => 'Fatukile', 'searchbutton' => 'Fatukile', 'go' => 'Afi', 'searcharticle' => 'Afi', 'history' => 'Bundau petulo', 'history_short' => 'Bundau', 'updatedmarker' => 'sa updeti di zwa sadi ladu', 'printableversion' => "Petulo printezi ye ng'i", 'permalink' => 'Permalink', 'print' => 'Aprintile', 'edit' => "Hloli ye ng'i", 'editthispage' => "Hloli ye ng'i bye petulo", 'delete' => 'Afi kulobala', 'deletethispage' => 'Afi kulobala bye petulo', 'undelete_short' => 'Afi kulobala tamuhile {{PLURAL:$1|1 hlolu|$1 hloluna}}', 'protect' => 'Bukelezi', 'protect_change' => 'fetuhile bukelezi', 'protectthispage' => 'Bukelezi bye petulo', 'unprotect' => 'bukelezi tamuhile', 'unprotectthispage' => 'Bukelezi tamuhile bye petulo', 'newpage' => 'Petulo hlolinu', 'talkpage' => 'Bulelezi bye petulo', 'talkpagelinktext' => 'Bulelezi', 'specialpage' => 'Petulo Zwenti', 'personaltools' => 'Solume sisebelisoni', 'postcomment' => 'Bulelezi mulumiwa', 'articlepage' => 'Kamukile petulo', 'talk' => 'Bulelezi', 'views' => 'Kamukile', 'toolbox' => 'Sisebelisoni', 'userpage' => 'Kamukile sebelu petulo', 'projectpage' => 'Kamukile prohyeti petulo', 'imagepage' => 'Kamukile imegi petulo', 'mediawikipage' => 'Kamukile mulumiwa', 'templatepage' => 'Kamukile yegani petulo', 'viewhelppage' => 'Kamukile likitisize petulo', 'categorypage' => 'Kamukile kattegori', 'viewtalkpage' => 'Kamukile bulelezi', 'otherlanguages' => 'Silozi kibuzi', 'redirectedfrom' => '(Petulo abezi di $1)', 'redirectpagesub' => 'Petulo abezi', 'lastmodifiedat' => 'Bye petulo sa petuhisize di lila kwa $2, $1.', 'viewcount' => 'Bye petulo sa akusi {{PLURAL:$1|1×|$1×}}.', 'protectedpage' => 'Petulo bukelezi', 'jumpto' => 'Yezi:', 'jumptonavigation' => 'muya', 'jumptosearch' => 'fatukile', # All link text and link target definitions of links into project namespace that get used by other message strings, with the exception of user group pages (see grouppage) and the disambiguation template definition (see disambiguations). 'aboutsite' => "Ngesi ye ng'i atulile {{SITENAME}}", 'aboutpage' => "Project:Ngesi ye ng'i atulile", 'copyright' => 'Bye sa ilonungi di $1.', 'copyrightpage' => "{{ns:project}}:Copyright ng'i", 'currentevents' => 'Muembatami', 'currentevents-url' => 'Project:Muembatami', 'disclaimers' => 'Dikulemi', 'disclaimerpage' => 'Project:Dikulemi generali', 'edithelp' => "Hloli ye ng'i", 'edithelppage' => "Help:Hloli ye ng'i", 'helppage' => 'Help:Buinaneli di petulo', 'mainpage' => 'Petulo yem efro', 'mainpage-description' => 'Petulo yem efro', 'policy-url' => 'Project:Busize', 'portal' => 'Petulo Bulili', 'portal-url' => 'Project:Petulo Bulili', 'privacy' => 'Busize likunutu', 'privacypage' => 'Project:Busize likunutu', 'badaccess' => 'Bufosi pemiko', 'badaccess-group0' => 'Zwa eksyon ni sa di sebelu kwa zwa kattegorina. Kyon ni sa vanu.', 'badaccess-groups' => 'Zwa eksyon sa di sebelu kwa 1 di kattegorina $1.', 'versionrequired' => 'Pane $1 di MediaWiki sa nidyisize', 'versionrequiredtext' => 'Pane $1 di MediaWiki sa nidyisize di sebesize bye petulo. Kamukile [[Special:Version|pane]].', 'ok' => 'lumelisize', 'retrievedfrom' => 'Bulukezi ye ng\'i di "$1"', 'youhavenewmessages' => 'A sa pozefisize $1 ($2).', 'newmessageslink' => 'nca mulumiwani', 'newmessagesdifflink' => 'nca petuho te-i', 'youhavenewmessagesmulti' => 'Nca $1 mulumiwani', 'editsection' => "hloli ye ng'i", 'editold' => "hloli ye ng'i", 'editsectionhint' => "Hloli ye ng'i silami: $1", 'toc' => 'Petuloni', 'showtoc' => 'kamukile', 'hidetoc' => 'cwankekile', 'thisisdeleted' => 'Kamukile/afi kulobala tamuhile $1?', 'viewdeleted' => 'Kamukile $1?', 'restorelink' => '{{PLURAL:$1|1 afi bye sa afi kulobala|$1 afina bye sa afi kulobala}}', 'feedlinks' => 'Feed (sa sadumi kabili padi):', 'feed-invalid' => 'Subskripsyon feed tapi bufosi.', 'site-rss-feed' => '$1 RSS Feed (sa sadumi kabili padi)', 'site-atom-feed' => '$1 Atom Feed (sa sadumi kabili padi)', 'page-rss-feed' => '"$1" RSS Feed (sa sadumi kabili padi)', 'page-atom-feed' => '"$1" Atom Feed (sa sadumi kabili padi)', # Short words for each namespace, by default used in the namespace tab in monobook 'nstab-main' => 'Petulo', 'nstab-user' => 'Sebelu petulo', 'nstab-media' => 'Media', 'nstab-special' => 'Zwenti', 'nstab-project' => 'Prohyeti petulo', 'nstab-image' => 'Imegi', 'nstab-mediawiki' => 'Mulumiwa', 'nstab-template' => 'Yegani', 'nstab-help' => 'Likitisize', 'nstab-category' => 'Kattegori', # Main script and global functions 'nosuchaction' => 'Ni eksyon', 'nosuchspecialpage' => 'Ni petulo zwenti', # General errors 'error' => 'Bufosi', 'databaseerror' => 'Bufosi di database', 'readonly' => 'Databesi sa loko', 'internalerror' => 'Interni bufosi', 'internalerror_info' => 'Interni bufosi: $1', 'filecopyerror' => 'Ni sa dubolisize media "$1" di "$2".', 'filerenameerror' => 'Ni sa nyanganyisize media "$1" di "$2".', 'filedeleteerror' => 'Ni sa afi kulobala media "$1".', 'directorycreateerror' => 'Ni sa hloli direktori "$1".', 'filenotfound' => 'Ni sa fatukile media "$1".', 'fileexistserror' => 'Ni sa ubelisize di media "$1": media sa', 'unexpected' => 'Teko lishokomoki: "$1"="$2".', 'formerror' => 'Bufosi: ni bulukezi form', 'badtitle' => 'Sebu sa bani', 'badtitletext' => "Bufosi di petulo sigirikisize, kusize, interling'ki. A sa selt di bufosi.", 'wrong_wfQuery_params' => "Inkorrekt parameteri di wfQuery()<br /> Fung'ksyun: $1<br /> Query: $2", 'viewsource' => "Kamukile ng'i", 'viewsourcetext' => 'A sa kamukile wiki-selt di bye petulo:', 'sqlhidden' => '(SQL query sa cwankekile)', # Login and logout pages 'yourname' => 'Sebelu:', 'yourpassword' => 'Sebu dafi:', 'yourpasswordagain' => 'Ritapi sebu dafi:', 'remembermypassword' => 'Askevusize zwa menuhile kwa bye kompyuta (for a maximum of $1 {{PLURAL:$1|day|days}})', 'yourdomainname' => 'Zwa domeni:', 'login' => 'Menuhile', 'nav-login-createaccount' => 'Menuhile / ipupezi sebelu', 'loginprompt' => 'A sa nyembulisize di kukina di menuhile kwa {{SITENAME}}.', 'userlogin' => 'Menuhile / ipupezi sebelu', 'logout' => 'Ile', 'userlogout' => 'Ile', 'notloggedin' => 'Ile sa akwezi', 'nologin' => "Ni menuhile? '''$1'''.", 'nologinlink' => 'Ipupezi sebelu', 'createaccount' => 'Ipupezi sebelu', 'gotaccount' => "Xete a sa sebelu? '''$1'''.", 'gotaccountlink' => 'Menuhile', 'createaccountmail' => 'dimeli', 'badretype' => 'Sebu dafi ni sa identikali.', 'userexists' => 'Sebu di sebelu sa sebelize. Hloli veti sebu petuho.', 'loginerror' => 'Bufosi di menuhile', 'nocookieslogin' => '{{SITENAME}} sebelize kukina di menuhile sebelu. A ni sa kukina. Sa kukina.', 'noname' => 'A sa sebelu consa sebelu bufosi.', 'loginsuccesstitle' => 'Menuhile ni condi bufosi', 'loginsuccess' => "'''A sa menuhile di {{SITENAME}} con sebelu \"\$1\".'''", 'nosuchuser' => 'No sebelu "$1". Tembile/ipupezi.', 'nosuchusershort' => 'No sebelu "$1". Tembile.', 'nouserspecified' => 'A tumbelezi sebelunom.', 'wrongpassword' => 'Bufosi sebu dafi. Tembile.', 'wrongpasswordempty' => 'No sebu dafi. Tembile.', 'passwordtooshort' => 'Zwa sebu dafi sa bufosi/kuswani. A sa $1 di selt e petuho di zwa sebelunom.', 'mailmypassword' => 'Meli sebu dafi', 'passwordremindertitle' => 'Nca sebu dafi temporali di {{SITENAME}}', 'passwordremindertext' => 'Ku (sa a, dIP $1) kusizi sebu dafi di {{SITENAME}} ($4). Sebu dafi di sebelu "$2" sa "$3". A sa menuhile e hloli zwa sebu dafi. Sa ku bye fatukile zwa sebu dafi e a ni petuho, ni petuho e mulumiwasibukirisize.', 'noemail' => 'No meli di sebelu "$1".', 'passwordsent' => 'Nca sebu dafi sa meli di sebelu "$1". Menuhile post tamibukisimelize.', 'eauthentsent' => 'Meli sa meli di meli adresi. Pre xete meli sa meli di sebelu, inisidusize melisaku, di saguridimi sebelu.', 'mailerror' => 'Bufosi afi mail: $1', 'accountcreated' => 'Sebelu sa hloli', 'accountcreatedtext' => 'Sebelu di $1 sa hloli.', 'createaccount-title' => 'Sebelu sa hloli di {{SITENAME}}', 'loginlanguagelabel' => 'Zwa Siselect: $1', # Change password dialog 'resetpass' => 'Lisetize sebelu sebu dafi', 'resetpass_header' => 'Lisetize sebu dafi', 'retypenew' => 'Sebu dafi:', 'resetpass_submit' => 'Setize sebu dafi e menuhile', # Edit page toolbar 'bold_sample' => 'Selt ombelu', 'bold_tip' => 'Selt ombelu', 'italic_sample' => 'Selt itali', 'italic_tip' => 'Selt itali', 'link_sample' => "Sebu di ling'ko", 'link_tip' => "Ling'ko bulili in", 'extlink_sample' => "http://www.example.com sebu di ling'ko", 'extlink_tip' => "Ling'ko bulili out (¡con http://!)", 'headline_sample' => 'Selt di pagafi', 'headline_tip' => 'Pagafi (2)', 'nowiki_sample' => "Sebu di 'ni-Wikicode' apukisize", 'nowiki_tip' => "'Ni Wiki-code' apukisize", 'image_sample' => 'Kamukile.jpg', 'image_tip' => 'Kamukile imegi', 'media_sample' => 'Kamukile.ogg', 'media_tip' => 'Kamukile media', 'sig_tip' => 'Sebu di sebelu con xete data (4× ~)', 'hr_tip' => 'Lani - (sepalati)', # Edit pages 'summary' => 'Lyangutukezi:', 'subject' => 'Lyangutukezi selt:', 'minoredit' => 'A sa pili kenki', 'watchthis' => 'Kantezi bye petulo', 'savearticle' => 'Bulukezi', 'preview' => 'PendiBe', 'showpreview' => 'Kamukile PendiBe', 'showlivepreview' => "Lyangutukezi 'Live'", 'showdiff' => 'Kamukile nca petuho', 'anoneditwarning' => "'''!:''' A ni sa menuhile. Zwa adresi di IP sa bulukezi kwa kenki bundau di petulo.", 'summary-preview' => 'Lyangutukezi pendiBe:', 'blockedtitle' => 'Sebelu sa bolok', 'blockedtext' => "'''Zwa sebelu/IP sa bolok.''' $1 bolok a. Lyangutukezireason sa ''$2''. * Bolok ungekile: $8 * Bolok simpekile: $6 * Tokwezi bolok: $7 A bulelezi $1/[[{{MediaWiki:Grouppage-sysop}}|xetewi sesop]] bolok. A ni sebilize 'meli sebelu' ka a ni afi adresi di meli kwa zwa [[Special:Preferences|petohoni]] e no sa bolok di sebelize. A IP sa $3, e ID di bolok sa #$5. Bulelezi IP e ID kwa bukizisize.", 'whitelistedittext' => "A sa $1 di hloli ye ng'i petulo.", 'nosuchsectiontitle' => 'Ni di lyangutukezi', 'loginreqlink' => 'menuhile', 'loginreqpagetext' => 'A sa $1 di kamukile xeti di petulo.', 'newarticle' => '(Nca)', 'newarticletext' => "Bye petulo ni sa, tiguki zwa ling'ki. Di hloli, seltisize kwa sisebelisoni (kamukile [[{{MediaWiki:Helppage}}|likitisize]]). A sa nca di bufosi, tampi '''back'''.", 'noarticletext' => 'Sa no selt kwa petulo, a sa [[Special:Search/{{PAGENAME}}|fatukile di petulonom]] kwa xete petulo/[{{fullurl:{{FULLPAGENAME}}|action=edit}} petulo kenki].', 'updated' => '(sa updeti)', 'note' => "'''Lyangutukezi:'''", 'previewnote' => "'''A sa in kamukile PendiBe; petuho ni sa bulukezi!'''", 'editing' => "Hloli ye ng'i $1", 'editingsection' => "Hloli ye ng'i $1 (lyangutukezi)", 'editingcomment' => "Hloli ye ng'i $1 (lyangutukezi)", 'yourtext' => 'Zwa selt', 'storedversion' => 'Selt bulukezi', 'yourdiff' => 'Petuhoni', 'copyrightwarning' => "Xete kenki di {{SITENAME}} sa rilisi kwa $2 (fatukile $1 di pagu). A ni tokwezi zwa selt sa kenki a ridistributi kwa tokwi, ni bulukezi.<br /> A sumekezi zwa selt sa dya, a kopisize di publiki domeni, a ike risorsi. '''NI BULUKEZI SELT KOPINITUMELELO E NI TUMELELO!'''", 'templatesused' => 'Yegani sebelize di bye petulo:', 'templatesusedpreview' => 'Yegani sebelize kwa bye PendiBe:', 'template-protected' => '(sa bukelezi)', 'template-semiprotected' => '(bukelezi di pagafi)', 'nocreatetext' => '{{SITENAME}} sa simplekile petulo. A afi e kenki/[[Special:UserLogin|menuhile]].', 'recreate-moveddeleted-warn' => "'''!: A sa hloli petulo dy sa afi kulobala.''' A sa luku a kenki dyangitubilinisize petulo. Desu dafi kulobala di petulo sa gi di informasi:", # Account creation failure 'cantcreateaccounttitle' => 'Ni sa hloli di sebelu', # History pages 'viewpagelogs' => 'Kamukile desu di petulo', 'currentrev' => 'Selt nca', 'revisionasof' => 'Selt di $1', 'revision-info' => 'Selt di $1 di $2', 'previousrevision' => '←Kona selt', 'nextrevision' => 'Lila selt→', 'currentrevisionlink' => 'Selt nca', 'cur' => 'bye', 'last' => 'pu-lila', 'page_first' => 'pu-kona', 'page_last' => 'pu-lila', 'histlegend' => 'Petuho seleksi: nyansulize selt sisebelisoni di radio e dusize enter.<br /> Informasi: (bye) = petuho a nca selt, (pu-lila) = petuho a pre selt, p = pili kenki.', 'histfirst' => 'Pu-kona', 'histlast' => 'Pu-lila', 'historyempty' => '(necafeti)', # Revision feed 'history-feed-title' => 'Bundau di selt', 'history-feed-description' => 'Bundau di selt di petulo di wiki.', 'history-feed-item-nocomment' => '$1 di $2', # Revision deletion 'rev-deleted-comment' => '(lyangutukezi sa afi kulobala)', 'rev-deleted-user' => '(sebu di sebelu sa afi kulobala)', 'rev-deleted-event' => '(petulo sa afi kulobala)', 'rev-delundel' => 'kamukile/cwankekile', # History merging 'mergehistory-from' => 'Petulo dolege:', # Diffs 'history-title' => 'Bundau di selt di "$1"', 'difference' => '(Petuho kwa selt)', 'lineno' => 'Lani $1:', 'compareselectedversions' => 'Bapisize', 'editundo' => "afi hloli ye ng'i", 'diff-multi' => '({{PLURAL:$1|1 selt amebusilize|$1 selt amebusilize}} ni kamukile.)', # Search results 'searchresults' => 'Fatukile kamukile', 'searchsubtitle' => "A fatukile di '''[[:$1]]'''", 'searchsubtitleinvalid' => "A fatukile di '''$1'''", 'titlematches' => 'Sebu di petulo ekali', 'notitlematches' => 'Ni sebu di petulo ekali', 'textmatches' => 'Selt di petulo ekali', 'notextmatches' => 'Ni selt di petulo ekali', 'prevn' => 'kona {{PLURAL:$1|$1}}', 'nextn' => 'lila {{PLURAL:$1|$1}}', 'viewprevnext' => 'Kamukile ($1 {{int:pipe-separator}} $2) ($3)', 'searchhelp-url' => 'Help:Buinaneli di petulo', 'searchall' => 'xete', 'showingresults' => "Kamukile opi {{PLURAL:$1|'''1''' ekali|'''$1''' ekalina}} di #'''$2'''.", 'showingresultsnum' => "Kamukile {{PLURAL:$3|'''1''' ekali|'''$3''' ekalina}} di #'''$2'''.", 'powersearch' => 'Fatukile', # Quickbar 'qbsettings-none' => 'Ni', # Preferences page 'preferences' => 'Petohoni di sebelu', 'mypreferences' => 'Zwa petohoni di sebelu', 'prefs-edits' => "Hloli ye ng'inabi:", 'prefsnologin' => 'Ni menuhile', 'prefs-skin' => 'PendiBe', 'skin-preview' => 'PendiBe', 'datedefault' => 'Ni di petohoni di sebelu', 'prefs-datetime' => 'Data', 'prefs-rc' => 'Petuho nca', 'prefs-watchlist' => 'Mukoloko di kentezi', 'saveprefs' => 'Bulukezi', 'resetprefs' => 'Lisetize', 'prefs-editing' => "Hloli ye ng'i", 'rows' => 'Roo:', 'columns' => 'Kalom:', 'searchresultshead' => 'Fatukile', 'resultsperpage' => 'Hit di petulo:', 'timezoneoffset' => 'Ufiseti¹', 'default' => 'auto', 'prefs-files' => 'Imegini', 'youremail' => 'Imeli:', 'username' => 'Sebelu:', 'uid' => 'Sebelu ID:', 'yourrealname' => 'Sebu monida:', 'yourlanguage' => 'Siselect:', 'yourvariant' => 'Pane:', 'yournick' => 'Kamukile di sebelu printezi:', 'badsig' => 'Ro sebu di sebelu con xete data bufosi; kamukile HTML tegina.', 'email' => 'Imeli', 'prefs-help-realname' => 'Nom sa opsi e a sa kisize providisize sa tekini atribusi di zwa selt.', 'prefs-help-email-required' => 'Adressi di meli sa nidyisize.', # Groups 'group-all' => '(xete)', 'grouppage-sysop' => '{{ns:project}}:Sesop', # User rights log 'rightslog' => 'Desu di petuhoni kwa sebelu', 'rightsnone' => '(ni)', # Recent changes 'nchanges' => '$1 {{PLURAL:$1|petuho|petuho}}', 'recentchanges' => 'Petuho nca', 'recentchanges-feed-description' => 'Kamukile petuho nca di wiki kwa bye feed.', 'rcnote' => "Bye {{PLURAL:$1|sa '''1''' petuho|sa pu-lila '''$1''' petuhoni}} kwa pu-lila {{PLURAL:$2|dia|'''$2''' dia}}, di $3.", 'rcnotefrom' => "Bye sa petuho di '''$2''' (di '''$1''' sa kamukile).", 'rclistfrom' => 'Kamukile nca petuho di $1', 'rcshowhideminor' => '$1 pili kenki', 'rcshowhidebots' => '$1 roboti', 'rcshowhideliu' => '$1 sebelu', 'rcshowhideanons' => '$1 IP', 'rcshowhidepatr' => '$1 afina patoli', 'rcshowhidemine' => '$1 zwa afina', 'rclinks' => 'Kamukile lapu-lila $1 petuhoni di lapu-lila $2 dia<br />$3', 'diff' => 'petuho', 'hist' => 'bundau', 'hide' => 'Cwankekile', 'show' => 'Kamukile', 'minoreditletter' => 'p', 'newpageletter' => 'n', 'boteditletter' => 'r', 'newsectionsummary' => '/* $1 */ nca bulelezi', # Recent changes linked 'recentchangeslinked' => 'Petuho adusi', 'recentchangeslinked-feed' => 'Petuho adusi', 'recentchangeslinked-toolbox' => 'Petuho adusi', 'recentchangeslinked-title' => 'Petuho dadusi di "$1"', 'recentchangeslinked-noresult' => "Ni petuhoni kwa ling'ki petulo kwa bye datum.", 'recentchangeslinked-summary' => "Bye petulo zwenti kamukile lapu-kona petuho di petulo sa ling'ki. Petulo di zwa mukoloko di kentezi sa '''ombelu'''.", # Upload 'upload' => 'Imegi uplodezi', 'uploadbtn' => 'Imegi uplodezi', 'uploadnologin' => 'Ni menuhile', 'uploadnologintext' => 'A sa [[Special:UserLogin|menuhile]] di uplodezi media.', 'uploaderror' => 'Bufosi duplodezi', 'uploadlogpage' => 'Desu di uplodezi', 'filename' => 'Imegi', 'filedesc' => 'Lyangutukezi', 'fileuploadsummary' => 'Lyangutukezi:', 'filesource' => "Ng'i", 'uploadedfiles' => 'Imegina uplodezi', 'savefile' => 'Bulukezi imegi', 'uploadedimage' => 'sa uplodezi "[[$1]]"', 'overwroteimage' => 'sa uplodezi nca imegi petuho di "[[$1]]"', 'sourcefilename' => "Ng'i di imegi", 'watchthisupload' => 'Kentezi bye petulo', 'upload-file-error' => 'Interni bufosi', 'license-nopreview' => '(PendiBe di nupdeti)', # Special:ListFiles 'imgfile' => 'imegi', 'listfiles' => 'Mukoloko di imegina', 'listfiles_user' => 'Sebelu', # File description page 'file-anchor-link' => 'Imegi', 'filehist' => 'Imegi bundau', 'filehist-help' => 'Tampa datum/taimi di kamukile imegi a sa kwa bye datum.', 'filehist-current' => 'bye', 'filehist-datetime' => 'Datumi/Taimi', 'filehist-user' => 'Sebelu', 'filehist-dimensions' => 'Dimensyoni', 'filehist-filesize' => 'Imegispani', 'filehist-comment' => 'Lyangutukezi', 'imagelinks' => "Ling'kina", 'linkstoimage' => "Bye petulo sa ling'ki di bye media:", 'nolinkstoimage' => "No petulo ling'ki a imegi.", 'sharedupload' => 'Imegi sa uplodezi kwa wiki dy apukolobili sa e sa kubi xetewi proyeti.', 'uploadnewversion-linktext' => 'Uplodezi nca selt di bye media', # File reversion 'filerevert-comment' => 'Lyangutukezi:', # File deletion 'filedelete' => 'Afi kulobala $1', 'filedelete-legend' => 'Afi kulobala imegi', 'filedelete-intro' => "Sa afi kulobala '''[[Media:$1|$1]]'''.", 'filedelete-comment' => 'Lyangutukezi:', 'filedelete-submit' => 'Afi kulobala', 'filedelete-success' => "'''$1''' sa afi kulobala.", # MIME search 'mimesearch' => 'MIME fatukile', 'download' => 'dawnlodezi', # List redirects 'listredirects' => 'Mukoloko di petulo abezi', # Unused templates 'unusedtemplates' => 'Yegani kopu', # Random page 'randompage' => 'Petulo fona', # Random redirect 'randomredirect' => 'Petulo abezi fona', # Statistics 'statistics' => 'Mukoloko di kamukile', 'statistics-header-users' => 'Mukoloko di kamukile di sebelu', 'disambiguations' => 'Disamebigasina', 'doubleredirects' => 'Petulo abezi sa dužemi', 'brokenredirects' => 'Petulo abezi bufosi', 'brokenredirects-edit' => "hloli ye ng'i", 'brokenredirects-delete' => 'afi kulobala', 'withoutinterwiki' => 'Petulo dicon interwikina', 'fewestrevisions' => 'Petuho con lapu-mina hlolina', # Miscellaneous special pages 'nbytes' => '$1 {{PLURAL:$1|bat|bati}}', 'ncategories' => '$1 {{PLURAL:$1|kattegori|kattegorina}}', 'nlinks' => "$1 {{PLURAL:$1|ling'ki|ling'ki}}", 'nmembers' => '$1 {{PLURAL:$1|peta|petani}}', 'nrevisions' => '$1 {{PLURAL:$1|hloli|hlolina}}', 'nviews' => '$1 {{PLURAL:$1|kamukile|kamukile}}', 'specialpage-empty' => 'Kamukile ni sa bundau.', 'lonelypages' => "Petulo coni ling'ki di a", 'lonelypagestext' => "Petulo kamukile ni sa con ling'ki di xeti petulo di {{SITENAME}}.", 'uncategorizedpages' => 'Petulo coni kattegori', 'uncategorizedcategories' => 'Kattegori coni kattegori', 'uncategorizedimages' => 'Imegi coni kattegori', 'uncategorizedtemplates' => 'Yegani coni kattegori', 'unusedcategories' => 'Kattegori kopu', 'unusedimages' => 'Imegi kopu', 'popularpages' => 'Petulo populali', 'wantedcategories' => "Ni sa kattegorina con ling'ki", 'wantedpages' => "Ni sa petulo con ling'ki", 'mostlinked' => "Petulo con plus ling'ki di a", 'mostlinkedcategories' => "Kattegorina con plus ling'ki di a", 'mostlinkedtemplates' => "Yegani con plus ling'ki di a", 'mostcategories' => 'Petulo con plus kattegorina', 'mostimages' => "Imegi con plus ling'ki di a", 'mostrevisions' => 'Petulo con plus hlolina', 'prefixindex' => 'Petulo bye abuce pelifikise', 'shortpages' => 'Mukoloko di kuswani petulo', 'longpages' => 'Mukoloko di petulo–amuha', 'deadendpages' => "Mukoloko di petulo-ni ling'ki", 'deadendpagestext' => "Bye petulo ni sa ling'ki medi petulo di {{SITENAME}}.", 'protectedpages' => 'Petulo sa bukelelize', 'listusers' => 'Mukoloko di sebelu', 'newpages' => 'Nca petulo', 'newpages-username' => 'Sebelu:', 'ancientpages' => 'Petulo bye sa kona afina', 'move' => 'Nyanganyisize', 'movethispage' => 'Nyanganyisize bye petulo', # Book sources 'booksources' => 'Desusorsi', 'booksources-go' => 'Afi', # Special:Log 'specialloguserlabel' => 'Sebelu:', 'speciallogtitlelabel' => 'Sebu:', 'log' => 'Desuni', 'all-logs-page' => 'Xete desu', # Special:AllPages 'allpages' => 'Mukoloko di petulo', 'alphaindexline' => '$1 di $2', 'nextpage' => 'Lila petulo ($1)', 'prevpage' => 'Kona petulo ($1)', 'allpagesfrom' => 'Kamukile petulo di:', 'allarticles' => 'Mukoloko di petulo', 'allpagesprev' => 'Kona', 'allpagesnext' => 'Lila', 'allpagessubmit' => 'Afi', 'allpagesprefix' => 'Kamukile petulo di pifeto di:', # Special:Categories 'categories' => 'Kattegori', # Special:DeletedContributions 'deletedcontributions' => 'Afina di sebelu bye sa afi kulobala', 'deletedcontributions-title' => 'Afina di sebelu bye sa afi kulobala', # Special:ListUsers 'listusersfrom' => 'Kamukile sebelu di:', 'listusers-submit' => 'Kamukile', 'listusers-noresult' => 'Ni-di sebelu.', # E-mail user 'emailuser' => 'Imeli bye sebelu', 'emailpage' => 'Imeli sebelu', 'defemailsubject' => '{{SITENAME}} meli', 'noemailtitle' => 'Ni meli adresi', 'noemailtext' => 'Bye sebelu ni sa meli adresi, dicon sa sosize ni sa meli di kupo sebelu.', 'emailfrom' => 'Poti', 'emailto' => 'Atipo', 'emailsubject' => 'Lyangutukezi', 'emailmessage' => 'Mulumiwa', 'emailsend' => 'Afi', 'emailsent' => 'Meli sa afi', 'emailsenttext' => 'Zwa meli sa afi.', # Watchlist 'watchlist' => 'Zwa mukoloko di kentezi', 'mywatchlist' => 'Zwa mukoloko di kentezi', 'watchnologin' => 'A ni sa menuhile', 'watchnologintext' => "A sa [[Special:UserLogin|menuhile]] di hloli ye ng'i zwa mukoloko di kentezi.", 'addedwatchtext' => "Petulo \"[[:\$1]]\" sa vugisize di zwa [[Special:Watchlist|mukoloko di kentezi]]. Petuhoni di bye petulo e sa bulelezi sa mukolokosize ta, e '''ombelu''' kwa [[Special:RecentChanges|petuho nca]] di kwazidisize akusize. A sa afi kulobala di zwa mukoloko di kentezi, tampi \"ngambu kentezi\".", 'removedwatchtext' => 'Petulo "[[:$1]]" sa afi kulobala di zwa mukoloko di kentezi.', 'watch' => 'Kentezi', 'watchthispage' => 'Kentezi bye petulo', 'unwatch' => 'Ngambu kentezi', 'unwatchthispage' => 'Ngambu kentezi', 'notanarticle' => 'Ni di petulo infomelo', 'watchlist-details' => '{{PLURAL:$1|$1 petulo|$1 petulo}} sa kentezi e no bulelezi.', 'wlshowlast' => 'Kamukile lapu-lila $1 holani $2 dia $3', # Displayed when you click the "watch" button and it is in the process of watching 'watching' => 'Kentezi...', 'unwatching' => 'Dikentezi...', 'enotif_newpagetext' => 'Bye sa nca petulo.', 'enotif_impersonal_salutation' => '{{SITENAME}} sebelu', 'changed' => 'petuhoni', 'created' => 'hlolini', # Delete 'deletepage' => 'Afi kulobala petulo', 'confirm' => 'Afi pe', 'excontent' => "Petulo sa ng'i: '$1'", 'excontentauthor' => "Petulo sa ng'i: '$1' (sebelu sa ng'i '[[Special:Contributions/$2|$2]]')", 'exbeforeblank' => "Petulo sa ng'i blanco: '$1'", 'exblank' => 'petulo sa blanco', 'historywarning' => 'Petulo, sa afi kulobala, sa bundau di sebelu:', 'confirmdeletetext' => 'A sa afi kulobala petulo e bundau. A sa ukisize a sa ni bufosi e a sa iki di [[{{MediaWiki:Policy-url}}|polisi]].', 'actioncomplete' => 'Sa afi', 'deletedtext' => '"$1" sa afi kulobala. Fatukile $2 di desu di afi kulobala nca.', 'dellogpage' => 'Desu di afi kulobala', 'deletecomment' => 'Lyangutukezi:', 'deleteotherreason' => 'Xetewi/ewi lyangutukezi:', 'deletereasonotherlist' => 'Xetewi lyangutukezi', # Rollback 'rollback' => "Afi hlolina ye ng'i lila", 'rollback_short' => "Afi hloli ye ng'i lila", 'rollbacklink' => "afi hloli ye ng'i lila", 'rollbackfailed' => "Bufosi dafi hloli ye ng'i lila", # Protect 'protectlogpage' => 'Desu di bukelize', 'protectedarticle' => 'sa bukelelize "[[$1]]"', 'unprotectedarticle' => 'sa ati-bukelelize "[[$1]]"', 'prot_1movedto2' => '[[$1]] nyanganyisize di [[$2]]', 'protect-legend' => 'Bukelezi', 'protectcomment' => 'Lyangutukezi:', 'protectexpiry' => 'Simpekile:', 'protect_expiry_invalid' => 'Bufosi di simpekile.', 'protect_expiry_old' => 'Simpekile sa kwa bundau.', 'protect-text' => "A sa kamukile e hloli bukelezi di petulo '''$1'''.", 'protect-locked-access' => "Zwa sebelu ni sa hloli bukelezi. Petohoni di petulo '''$1''' sa:", 'protect-cascadeon' => 'Bye petulo sa bukelezi a sa kwa bye {{PLURAL:$1|petulo|petulo}}, asa kaskedi. A sa hloli bukelezi, a ni sa afakize kaskedi.', 'protect-default' => '(auto)', 'protect-fallback' => 'No "$1" tumelelo', 'protect-level-autoconfirmed' => 'Bolok sebelu dIP', 'protect-level-sysop' => 'Sesopinuli', 'protect-summary-cascade' => "xete ling'ki kentezi", 'protect-expiring' => 'simpekile $1 (UTC)', 'protect-cascade' => 'Bukelezi petulo kwa bye petulo (kaskedi)', 'protect-cantedit' => "A ni ku hloli a bukelezi di bye petulo, a ni sa tumelelo di hloli ye ng'i.", 'protect-expiry-options' => '2 ora:2 hours,1 dia:1 day,3 dia:3 days,1 wiki:1 week,2 wiki:2 weeks,1 muna:1 month,3 muna:3 months,6 muna:6 months,1 anu:1 year,di simuluzi:infinite', 'restriction-type' => 'Tumelelo:', 'restriction-level' => 'Bolok tumelelo:', # Restrictions (nouns) 'restriction-edit' => "Hloli ye ng'i", 'restriction-move' => 'Nyanganyisize', 'restriction-create' => 'Hloli', # Restriction levels 'restriction-level-all' => 'xete', # Undelete 'undelete' => 'Kamukile afi kulobala petulo', 'viewdeletedpage' => 'Kamukile afi kulobala petulo', 'undeletebtn' => 'Ati-afi kulobala', 'undeletereset' => 'Lisetize', 'undeletecomment' => 'Lyangutukezi:', 'undelete-search-box' => 'Fatukile afi kulobala petulo', 'undelete-search-prefix' => 'Kamukile petulo di:', 'undelete-search-submit' => 'Fatukile', # Namespace form on various pages 'namespace' => 'Fatukile efro:', 'invert' => "Fatukile efro ye ng'i", 'blanknamespace' => '(Yem efro)', # Contributions 'contributions' => 'Afina di sebelu', 'mycontris' => 'Zwa afina', 'contribsub2' => 'Di $1 ($2)', 'uctop' => "(nca ng'i)", 'month' => 'Di muna (previ):', 'year' => 'Dyanu (previ):', 'sp-contributions-newbies' => 'Kamukile afina di sebelu nca', 'sp-contributions-newbies-sub' => 'Di nca sebelu', 'sp-contributions-blocklog' => 'Desu di bolok', 'sp-contributions-deleted' => 'Afina di sebelu bye sa afi kulobala', 'sp-contributions-talk' => 'Bulelezi', 'sp-contributions-search' => 'Fatukile di afina', 'sp-contributions-username' => 'IP/sebelu:', 'sp-contributions-submit' => 'Fatukile', # What links here 'whatlinkshere' => "Ling'ki di bye petulo", 'whatlinkshere-title' => "Petulo bye ling'ki di $1", 'whatlinkshere-page' => 'Petulo:', 'linkshere' => "Bye petulo ling'ki di '''[[:$1]]''':", 'nolinkshere' => "0 petulo ling'ki di '''[[:$1]]'''.", 'nolinkshere-ns' => "0 petulo ling'ki di '''[[:$1]]''' bye sa di bye fatukile efro.", 'isredirect' => 'petulo abezi', 'istemplate' => "yang'idole", 'whatlinkshere-prev' => '{{PLURAL:$1|kona|kona $1}}', 'whatlinkshere-next' => '{{PLURAL:$1|lila|lila $1}}', 'whatlinkshere-links' => "← ling'ki", # Block/unblock 'blockip' => 'Bolok sebelu', 'ipadressorusername' => 'IP/sebelu:', 'ipboptions' => '2 ora:2 hours,1 dia:1 day,3 dia:3 days,1 wiki:1 week,2 wiki:2 weeks,1 muna:1 month,3 muna:3 months,6 muna:6 months,1 anu:1 year,di simuluzi:infinite', 'badipaddress' => 'IP ni sa', 'ipblocklist' => 'Mukoloko di IP e sebelu bye sa bolok', 'ipblocklist-submit' => 'Fatukile', 'blocklink' => 'bolok', 'unblocklink' => 'bolok tamuhile', 'contribslink' => 'afina', 'blocklogpage' => 'Desu di bolok', 'blocklogentry' => 'sa bolok [[$1]] e simpekile sa $2 $3', 'proxyblocksuccess' => 'Afi.', # Move page 'move-page-legend' => 'Nyanganyisize petulo', 'movepagetext' => "A sa nyanganyisize xete bundau di nom nca e petulo. Xisiti nom sa petulo abezi post nyanganyisize. Ling'ki di xisiti nom no kenki; luku di petulo abezi bufosi e petulo abezi sa bužemi. A sa gutukilimisize di ling'ki. Petulo sa '''no''' nyanganyisize di nca nom e nca nom sa xete, xete a sa petulo abezi e ni bundau/no selt petulo. A sa nyanganyisize petulo a orži. '''!''' Petulo populari sa drastiki bufosi e nyanganyisize; a sa gukilize di nyanganyisize.", 'movepagetalktext' => "Bulelezi sa nyanganyisize '''teri:''' *Bulelezi e selt sa kwa nca nom, *Okižekilize sisebelisoni. Teri yaki, a nyanganyisize.", 'movearticle' => 'Nyanganyisize petulo:', 'movenologin' => 'A ni sa menuhile', 'newtitle' => 'Di nca petulo:', 'move-watch' => 'Kentezi bye petulo', 'movepagebtn' => 'Nyanganyisize petulo', 'pagemovedsub' => 'Nyanganyisize sa afi.', 'articleexists' => 'Petulo zwa nyanganyisize afi sa, e nom sa bufosi. Xete nom sa kulikawi.', 'talkexists' => "'''No bufosi di nyanganyisize petulo, bufosi di nyanganyisize bulelezi, tubi hani.'''", 'movedto' => 'nyanganyisize di', 'movetalk' => 'Nyanganyisize petulo di bulelezi', 'movelogpage' => 'Desu di nyanganyisize', 'movelogpagetext' => 'Bye mukoloko sa mukoloko di petulo nyanganyisize.', 'movereason' => 'Lyangutukezi:', 'revertmove' => 'afi', 'delete_and_move' => 'Afi kulobala alo-di nyanganyisize', # Export 'export' => 'Petulo export', 'export-submit' => 'Petulo export', # Namespace 8 related 'allmessages' => 'Mulumiwani', 'allmessagesname' => 'Sebu', 'allmessagesdefault' => 'Selt orge', 'allmessagescurrent' => 'Selt nca', 'allmessagestext' => 'Bye mukoloko sa mukoloko di mulumiwani di MediaWiki poo. Please visit [//www.mediawiki.org/wiki/Localisation MediaWiki Localisation] and [//translatewiki.net translatewiki.net] if you wish to contribute to the generic MediaWiki localisation.', # Thumbnails 'thumbnail-more' => 'Pusize', 'thumbnail_error' => 'Bufosi hloli tumbneli: $1', # Special:Import 'import' => 'Petulo import', 'import-interwiki-submit' => 'Petulo import', 'import-comment' => 'Lyangutukezi:', # Import log 'importlogpage' => 'Desu di import', # Tooltip help for the actions 'tooltip-pt-userpage' => 'Zwa sebelu petulo', 'tooltip-pt-anonuserpage' => "Petulo di sebelu di IP, sa hloli ye ng'i.", 'tooltip-pt-mytalk' => 'Zwa bulelezi petulo', 'tooltip-pt-anontalk' => 'Bulelezi di hlolina di bye IP', 'tooltip-pt-preferences' => 'Zwa petohoni di sebelu', 'tooltip-pt-watchlist' => 'Mukoloko di petulo a kentezi di petuhoni', 'tooltip-pt-mycontris' => 'Mukoloko di zwa afina', 'tooltip-pt-login' => 'A sa ikokotozi di menuhile, a ni sa musebezi.', 'tooltip-pt-logout' => 'Ile', 'tooltip-ca-talk' => 'Bulelezi di bye petulo', 'tooltip-ca-edit' => "A sa hloli ye ng'i bye petulo. Kamukile PendiBe pe bulukezi.", 'tooltip-ca-addsection' => 'Lyangutukezi bye bulelezi.', 'tooltip-ca-viewsource' => 'Bye petulo sa bukelezi. A sa kamukile afina.', 'tooltip-ca-history' => 'Petuho kona, bundau, di petulo.', 'tooltip-ca-protect' => 'Bukelezi bye petulo', 'tooltip-ca-delete' => 'Afi kulobala bye petulo', 'tooltip-ca-move' => 'Nyanganyisize bye petulo', 'tooltip-ca-watch' => 'Tendile petulo kwa zwa mukoloko di kentezi', 'tooltip-ca-unwatch' => 'Afi kulobala bye petulo di zwa mukoloko di kentezi', 'tooltip-search' => 'Fatukile {{SITENAME}}', 'tooltip-search-fulltext' => 'Fatukile petulo di bye selt', 'tooltip-p-logo' => 'Petulo yem efro', 'tooltip-n-mainpage' => 'Sadi petulo yem efro', 'tooltip-n-portal' => 'Con e di poyeti, o a sa, o a sa fatukile', 'tooltip-n-currentevents' => 'Fatukile informasi di muembatami', 'tooltip-n-recentchanges' => 'Mukoloko di petuho nca di wiki.', 'tooltip-n-randompage' => 'Apuzi petulo fona', 'tooltip-n-help' => 'Yembani di fatukile.', 'tooltip-t-whatlinkshere' => "Mukoloko di xete petulo di wiki bye sa ling'ki", 'tooltip-t-recentchangeslinked' => "Petuho nca di petulo sa ling'ki di bye petulo", 'tooltip-feed-rss' => 'RSS feed bye petulo', 'tooltip-feed-atom' => 'Atom feed bye petulo', 'tooltip-t-contributions' => 'Kamukile mukoloko di afina di bye sebelu', 'tooltip-t-emailuser' => 'Afi meli di bye sebelu', 'tooltip-t-upload' => 'Imegi/media uplodezi', 'tooltip-t-specialpages' => 'Mukoloko di xete petulo zwenti', 'tooltip-t-print' => 'Petulo printezi di bye petulo', 'tooltip-t-permalink' => 'Permalink di bye selt di petulo', 'tooltip-ca-nstab-main' => 'Kamukile xadine petulo', 'tooltip-ca-nstab-user' => 'Kamukile sebelu petulo', 'tooltip-ca-nstab-media' => 'Kamukile imegi petulo', 'tooltip-ca-nstab-special' => "Bye sa petulo zwenti, a ni sa hloli ye ng'i bye petulo", 'tooltip-ca-nstab-project' => 'Kamukile prohyeti petulo', 'tooltip-ca-nstab-image' => 'Kamukile imegi petulo', 'tooltip-ca-nstab-mediawiki' => 'Kamukile mulumiwa petulo', 'tooltip-ca-nstab-template' => 'Kamukile yegani petulo', 'tooltip-ca-nstab-help' => 'Kamukile likitisize petulo', 'tooltip-ca-nstab-category' => 'Kamukile kattegori petulo', 'tooltip-minoredit' => 'Afi kenki ka pili kenki', 'tooltip-save' => 'Bulukezi zwa petuhoni', 'tooltip-preview' => 'Kamukile zwa petuhoni, sa bye pe bulukezi!', 'tooltip-diff' => 'Kamukile zwa petuhoni di selt.', 'tooltip-compareselectedversions' => 'Kamukile petuhoni di 2 bapisize di bye petulo.', 'tooltip-watch' => 'Tendile petulo kwa zwa mukoloko di kentezi', 'tooltip-recreate' => 'Hloli bye petulo sonis a sa afi kulobala', 'tooltip-upload' => 'Uplodezi', # Attribution 'anonymous' => 'Sebelu con IP di {{SITENAME}}', 'siteuser' => '{{SITENAME}} sebelu $1', 'siteusers' => '{{SITENAME}} sebelu $1', # Image deletion 'filedeleteerror-short' => 'Bufosi di afi kulobala di media/imegi: $1', 'filedeleteerror-long' => 'Bufosi sa, abi sa afi kulobala di media/imegi: $1', # Browsing diffs 'previousdiff' => '← Kona petuho', 'nextdiff' => 'Lila petuho →', # Media information 'widthheightpage' => '$1 × $2, $3 petulo', 'file-info-size' => '$1 × $2 pixel, imegi: $3, MIME type: $4', 'file-nohires' => 'A sa risolusi aku balise.', 'svg-long-desc' => 'SVG imegi, nominali $1 × $2 pixel, imega: $3', 'show-big-image' => 'Risolusi bakisize', # Special:NewFiles 'newimages' => 'Imegina nca', 'ilsubmit' => 'Fatukile', 'sp-newimages-showfrom' => 'Kamukile nca imegi di $1', # Bad image list 'bad_image_list' => "A fumato sa: Xi mukoloko petulo (di *) sa konsidisize. 1-ling'ki di lina sa ling'ki dimegi bufosi. Xete ling'ki kwa lina sa konsidisize desepo. Petulo dimedi inlinenikusize.", # Metadata 'metadata' => 'Metadatani', 'metadata-help' => 'Imega sa informasi,di kamera digitali/skenni. Sat, imega sa kenki di selt nyazi, informasi kubalisize di kenki imegi.', 'metadata-expand' => 'Kamukile datani', 'metadata-collapse' => 'Cwankekile petulo tabu', 'metadata-fields' => 'EXIF metadata fields mukoloko kwa mulumiwa sa ike kwa imegipetulo ka metadata tablu sa tibekile. Xetewi sa cwankekile auto. * make * model * datetimeoriginal * exposuretime * fnumber * isospeedratings * focallength * artist * copyright * imagedescription * gpslatitude * gpslongitude * gpsaltitude', # EXIF tags 'exif-imagedescription' => 'Sebu di imegi', # External editor support 'edit-externally' => 'Kenki imegi sebilize pagini lakusi', 'edit-externally-help' => 'Boniselelize [//www.mediawiki.org/wiki/Manual:External_editors instruksi setup] kwa informasi.', # 'all' in various places, this might be different for inflected languages 'watchlistall2' => 'xeti', 'namespacesall' => 'xeti', 'monthsall' => 'xeti', # action=purge 'confirm_purge_button' => 'Afi', # Multipage image navigation 'imgmultipageprev' => '← kona petulo', 'imgmultipagenext' => 'lila petulo →', 'imgmultigo' => 'Afi!', # Table pager 'ascending_abbrev' => 'asendin', 'descending_abbrev' => 'disendin', 'table_pager_next' => 'Lila petulo', 'table_pager_prev' => 'Kona petulo', 'table_pager_limit' => 'Kamukile $1 hits di petulo', 'table_pager_limit_submit' => 'Afi', 'table_pager_empty' => 'Ni-di lani con info', # Auto-summaries 'autosumm-blank' => 'Sa blanki petulo', 'autosumm-replace' => "Sa blanki info con '$1'", 'autoredircomment' => 'Abezi di [[$1]]', 'autosumm-new' => 'Nca petulo: $1', # Watchlist editor 'watchlistedit-numitems' => 'Zwa mukoloko di kentezi sa pozefisize {{PLURAL:$1|1 petulo|$1 petulo}}, dicon bulelezina.', 'watchlistedit-noitems' => 'Zwa mukoloko di kentezi sa pozefisize 0 petulo.', 'watchlistedit-normal-title' => "Hloli ye ng'i mukoloko di kentezi", 'watchlistedit-normal-legend' => 'Afi kulobala petulo di mukoloko di kentezi', 'watchlistedit-normal-submit' => 'Afi kulobala petulo', 'watchlistedit-normal-done' => '{{PLURAL:$1|1 petulo|$1 petulo}} sa afi kulobala di zwa mukoloko di kentezi:', 'watchlistedit-raw-title' => "Hloli ye ng'i ro mukoloko di kentezi", 'watchlistedit-raw-legend' => "Hloli ye ng'i ro mukoloko di kentezi", 'watchlistedit-raw-titles' => 'Petulo:', 'watchlistedit-raw-submit' => 'Updetisize mukoloko di kentezi', 'watchlistedit-raw-done' => 'Zwa mukoloko di kentezi sa updetisize.', 'watchlistedit-raw-removed' => '{{PLURAL:$1|1 petulo|$1 petulo}} sa afi kulobala:', # Watchlist editing tools 'watchlisttools-view' => 'Kamukile petuho desi imepotani', 'watchlisttools-edit' => "Kamukile e hloli ye ng'i mukoloko di kentezi", 'watchlisttools-raw' => "Hloli ye ng'i ro mukoloko di kentezi", # Special:Version 'version' => 'Pane', # Special:SpecialPages 'specialpages' => 'Petulo zwenti', );
During your stay you will receive consultations with a Health Consultant, Fitness Expert and Nutritional Consultant. Using a sample of blood, our sophisticated diagnostic blood analyser will examine three important blood chemistries from a selection of Cholesterol, Glucose, Triglycerides, GGT and Haemoglobin. Our team can then advise a strategy, that works best with your body’s design, to restore balance, improve functioning and help to rejuvenate your health. A gentle purgative treatment for the liver and colon, particularly useful for helping the body to detoxify. Castor oil penetrates deep into the skin and acts on the lymphatic system, making lymph more fluid and boosting the production of immune cells. Additional beneficial effects are reducing pain and bloating. Specialised massage techniques help to relieve many of our stress related, bowel, lower back and emotional problems. This abdominal massage helps to restore the whole digestive system aiding the relief of IBS, constipation, bloating and tiredness. Therapeutic essential oils and hot poultices complete this truly holistic treatment. A Thalassotherapy bath with sequences underwater massage jets which powerfully stimulate the lymphatic system and circulation. The Body Composition Analysis test determines your lean body mass and percentages of fat, bone and muscle, a far better indication than weight alone. Highly informative lectures explain which foods help and which foods hinder your health; practical advice on how to further improve your digestion and how stress and other lifestyle factors may be sabotaging your health goals. One-to-one sessions are available for anyone wishing to explore this aspect further. If during your Health Consultation it is identified that you require or would like further tests we will refer you for further investigation which may involve additional blood work. If necessary, the Health Consultant will consult with our Specialists who will tailor your programme or make recommendations for additional therapies or treatments to be incorporated. Additional tests and analyses will vary and will be discussed and costed on an individual basis.
Where to stay near Sonceboz-Sombeval? Our 2019 accommodation listings offer a large selection of 17 holiday rentals near Sonceboz-Sombeval. From 16 Studios to 16 Condos/Apartments, find unique holiday homes for you to enjoy a memorable holiday or a weekend with your family and friends. The best place to stay near Sonceboz-Sombeval is on HomeAway. Can I rent Studios in Sonceboz-Sombeval? Can I find a holiday accommodation with pool in Sonceboz-Sombeval? Yes, you can select your preferred holiday accommodation with pool among our 2 holiday homes with pool available in Sonceboz-Sombeval. Please use our search bar to access the selection of holiday rentals available.
Valleri James, Author at Mannix Marketing, Inc. As the Director of Digital Sales & Strategy, Valleri is unabashed in her love for what she does. She helps our clients and local businesses get found on the web through various digital marketing strategies. Valleri loves interacting with clients from beginning to end, often seeing their excitement after a successful project. Throughout her professional and personal life, Valleri stands by the simple idea that the three keys to success are belief, attitude and commitment.Prior to joining Mannix Marketing, Valleri managed her own network marketing business, and brings this experience to our diverse team. If I had a time machine I would visit the sixties! It was a time of great change in our country. My greatest accomplishment is my children, Lauren and Nathan. To watch them grow into amazing young people and know I had a part in shaping them into who they are. Priceless! I love to travel to any new town, especially small ones or foreign cities. I like to get off the beaten path and try to look at the place from the perspective of the locals. If I were an animal I would be a cat!
Welcome back our great Leonardo! Your post is a real piece of contemporary philosophy. Return again and tell us your news from the world of distance.
Rose of the year 2006. Clusters of pinky buds open to medium creamy white blooms with an apricot centre. Dark, glossy foliage and a pleasing fragrance. The perfect present for any occasion worth toasting! Unique to us in the UK. (Floribunda) A Compact Floribunda this is a charming little rose of creamy-white with hints of pink on the petals and with a honey coloured centre to each flower. The fully double blooms are borne in large numbers and and the petals are tidily arranged to form a neat cushion-like flower. Named for Colby School in North Norfolk, upon their centenary in 2006. The late Peter Beales attended this school, when aged five. (H.T) One of the first H.T's to achieve popularity. Shapely, creamy-white fragrant flowers shaded with pink. Moderately vigorous. (Floribunda) An outstanding, free flowering white floribunda with lovely foliage. Of great value to any border for producing great quantities of bloom; useful for hedging and in containers. Not many thorns. (Floribunda) Superb, white shapely flowers which are highly scented. Healthy, dark foliage and good bushy growth. Makes a superb cut flower. (Hybrid Tea) A shapely, free flowering, creamy-white, borne on strong stems amid attractive foliage. An outstanding rose. (Hybrid Tea) (Rose of the Year 1985). Shapely, full blooms of pure white. Slightly scented. Vigorous and healthy with dark green foliage. (Floribunda) Double pure white blooms from cream coloured buds. Not hugely scented but healthy. A white hybrid tea with double blooms pale creamy pink blooms continuously flowering all summer. (Hybrid Tea) Large white blooms. Semi glossy light green foliage. (Hybrid Tea) Full, shapely flowers of white to creamy-white, held firmly on a bushy plant with dark green foliage.
-- -------------------------------------------------------- -- Host: 127.0.0.1 -- Server version: 5.6.24-log - MySQL Community Server (GPL) -- Server OS: Win64 -- HeidiSQL Version: 9.2.0.4947 -- -------------------------------------------------------- /*!40101 SET @OLD_CHARACTER_SET_CLIENT=@@CHARACTER_SET_CLIENT */; /*!40101 SET NAMES utf8mb4 */; /*!40014 SET @OLD_FOREIGN_KEY_CHECKS=@@FOREIGN_KEY_CHECKS, FOREIGN_KEY_CHECKS=0 */; /*!40101 SET @OLD_SQL_MODE=@@SQL_MODE, SQL_MODE='NO_AUTO_VALUE_ON_ZERO' */; -- Dumping structure for table dspdb.pet_list CREATE TABLE IF NOT EXISTS `pet_list` ( `petid` int(10) unsigned NOT NULL AUTO_INCREMENT, `name` char(15) NOT NULL, `poolid` int(10) unsigned NOT NULL DEFAULT '0', `minLevel` tinyint(2) unsigned NOT NULL DEFAULT '0', `maxLevel` tinyint(2) unsigned NOT NULL DEFAULT '0', `time` int(10) unsigned NOT NULL DEFAULT '0', `element` tinyint(3) unsigned NOT NULL DEFAULT '0', PRIMARY KEY (`petid`) ) ENGINE=MyISAM AUTO_INCREMENT=83 DEFAULT CHARSET=utf8; -- Dumping data for table dspdb.pet_list: 80 rows DELETE FROM `pet_list`; /*!40000 ALTER TABLE `pet_list` DISABLE KEYS */; INSERT INTO `pet_list` (`petid`, `name`, `poolid`, `minLevel`, `maxLevel`, `time`, `element`) VALUES (0, 'FireSpirit', 1341, 1, 99, 0, 1), (1, 'IceSpirit', 2043, 1, 99, 0, 5), (2, 'AirSpirit', 71, 1, 99, 0, 4), (3, 'EarthSpirit', 1160, 1, 99, 0, 2), (4, 'ThunderSpirit', 3912, 1, 99, 0, 6), (5, 'WaterSpirit', 4309, 1, 99, 0, 3), (6, 'LightSpirit', 2413, 1, 99, 0, 7), (7, 'DarkSpirit', 913, 1, 99, 0, 8), (8, 'Carbuncle', 4588, 1, 99, 0, 7), (9, 'Fenrir', 4581, 1, 99, 0, 8), (10, 'Ifrit', 4582, 1, 99, 0, 1), (11, 'Titan', 4583, 1, 99, 0, 2), (12, 'Leviathan', 4584, 1, 99, 0, 3), (13, 'Garuda', 4585, 1, 99, 0, 4), (14, 'Shiva', 4586, 1, 99, 0, 5), (15, 'Ramuh', 4587, 1, 99, 0, 6), (16, 'Diabolos', 4590, 1, 99, 0, 8), (17, 'Alexander', 4589, 1, 99, 0, 7), (18, 'Odin', 4591, 1, 99, 0, 8), (19, 'Atomos', 1, 1, 99, 0, 0), (20, 'CaitSith', 1, 1, 99, 0, 0), (21, 'SheepFamiliar', 4598, 23, 35, 3600, 0), (22, 'HareFamiliar', 4641, 23, 35, 5400, 0), (23, 'CrabFamiliar', 4610, 23, 55, 1800, 0), (24, 'CourierCarrie', 4611, 23, 75, 1800, 0), (25, 'Homunculus', 4616, 23, 75, 3600, 0), (26, 'FlytrapFamiliar', 4619, 28, 40, 3600, 0), (27, 'TigerFamiliar', 4604, 28, 40, 3600, 0), (28, 'FlowerpotBill', 4602, 28, 40, 3600, 0), (29, 'EftFamiliar', 4621, 33, 45, 3600, 0), (30, 'LizardFamiliar', 4600, 33, 45, 3600, 0), (31, 'MayflyFamiliar', 4596, 33, 45, 3600, 0), (32, 'FunguarFamiliar', 4614, 33, 65, 3600, 0), (33, 'BeetleFamiliar', 4606, 38, 45, 3600, 0), (34, 'AntlionFamiliar', 4625, 38, 50, 3600, 0), (35, 'MiteFamiliar', 4623, 43, 55, 3600, 0), (36, 'LullabyMelodia', 4599, 43, 55, 3600, 0), (37, 'KeenearedSteffi', 4595, 43, 55, 5400, 0), (38, 'FlowerpotBen', 4603, 51, 63, 3600, 0), (39, 'SaberSiravarde', 4605, 51, 63, 3600, 0), (40, 'ColdbloodComo', 4601, 53, 65, 3600, 0), (41, 'ShellbusterOrob', 4597, 53, 65, 3600, 0), (42, 'VoraciousAudrey', 4620, 53, 75, 3600, 0), (43, 'AmbusherAllie', 4622, 58, 75, 3600, 0), (44, 'LifedrinkerLars', 4624, 63, 75, 3600, 0), (45, 'PanzerGalahad', 4607, 63, 75, 3600, 0), (46, 'ChopsueyChucky', 4626, 63, 85, 1800, 0), (47, 'AmigoSabotender', 4618, 75, 85, 1200, 0), (48, 'Wyvern', 5551, 1, 99, 0, 0), (49, 'Crafty Clyvonne', 4608, 76, 90, 7200, 0), (50, 'Bloodclaw Shasr', 4609, 90, 99, 7200, 0), (51, 'Lucky Lulush', 4612, 76, 99, 7200, 0), (52, 'Fatso Fargann', 4613, 81, 99, 7200, 0), (53, 'Discreet Louise', 4615, 79, 99, 7200, 0), (54, 'Swift Sieghard', 4617, 86, 94, 7200, 0), (55, 'Dipper Yuly', 4627, 76, 99, 7200, 0), (56, 'Flowerpot Merle', 4628, 76, 99, 10800, 0), (57, 'Nursery Nazuna', 4629, 76, 86, 7200, 0), (58, 'Mailbuster Ceta', 4630, 85, 95, 7200, 0), (59, 'Audacious Anna', 4631, 85, 95, 7200, 0), (60, 'Presto Julio', 4632, 83, 93, 7200, 0), (61, 'Bugeyed Broncha', 4633, 90, 99, 7200, 0), (62, 'Gooey Gerard', 4634, 95, 99, 5400, 0), (63, 'Gorefang Hobs', 4635, 93, 99, 7200, 0), (64, 'Faithful Falcor', 4636, 86, 99, 5400, 0), (65, 'Crude Raphie', 4637, 96, 99, 5400, 0), (66, 'Dapper Mac', 4638, 76, 99, 7200, 0), (67, 'Slippery Silas', 4639, 23, 99, 1800, 0), (68, 'Turbid Toloi', 4640, 23, 99, 3600, 0), (69, 'HarlequinFrame', 5124, 1, 99, 0, 0), (70, 'ValoredgeFrame', 5125, 1, 99, 0, 0), (71, 'SharpshotFrame', 5126, 1, 99, 0, 0), (72, 'StormwakerFrame', 5127, 1, 99, 0, 0), (73, 'Volker', 7000, 1, 99, 0, 0), (74, 'Ayame', 7001, 1, 99, 0, 0), (75, 'Luopan', 6999, 1, 99, 0, 0), (76, 'Storm', 6999, 1, 99, 0, 0), (77, 'Cherukiki', 7002, 1, 99, 0, 0), (78, 'Ingrid', 7003, 1, 99, 0, 0), (79, 'Curilla', 7004, 1, 99, 0, 0); /*!40000 ALTER TABLE `pet_list` ENABLE KEYS */; /*!40101 SET SQL_MODE=IFNULL(@OLD_SQL_MODE, '') */; /*!40014 SET FOREIGN_KEY_CHECKS=IF(@OLD_FOREIGN_KEY_CHECKS IS NULL, 1, @OLD_FOREIGN_KEY_CHECKS) */; /*!40101 SET CHARACTER_SET_CLIENT=@OLD_CHARACTER_SET_CLIENT */;
On this page you will find the direct link to download the Hisense U929 File Stock ROM (original firmware) on your Computer. The Stock ROM package comes in a zip or rar package and contains Flash File, Flash Tool, USB Driver, and How-to Flash Manual. Step 1: Download and extract the Hisense U929 Stock ROM on your computer. Step 4: Follow the How-to Flash Manual to flash the Stock ROM on your Hisense U929 Device.
using System; using System.Linq; using CRP.Core.Domain; using CRP.Tests.Core.Extensions; using CRP.Tests.Core.Helpers; using Microsoft.VisualStudio.TestTools.UnitTesting; using UCDArch.Testing.Extensions; namespace CRP.Tests.Repositories.ItemRepositoryTests { public partial class ItemRepositoryTests { #region TransactionQuestionSet Tests #region Invalid Tests /// <summary> /// Tests the question sets with duplicate transaction value does not save. /// </summary> [TestMethod] [ExpectedException(typeof(ApplicationException))] public void TestQuestionSetsWithDuplicateTransactionValueDoesNotSave1() { Item item = null; try { #region Arrange var questionSet = CreateValidEntities.QuestionSet(1); item = GetValid(9); item.AddTransactionQuestionSet(questionSet); item.AddTransactionQuestionSet(questionSet); #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act } catch (Exception) { Assert.IsNotNull(item); var results = item.ValidationResults().AsMessageList(); results.AssertErrorsAre("TransactionQuestionSet: Transaction Question is already added"); Assert.IsTrue(item.IsTransient()); Assert.IsFalse(item.IsValid()); throw; } } /// <summary> /// Tests the question sets with duplicate transaction value does not save. /// </summary> [TestMethod] [ExpectedException(typeof(ApplicationException))] public void TestQuestionSetsWithDuplicateTransactionValueDoesNotSave2() { Item item = null; try { #region Arrange var questionSet1 = CreateValidEntities.QuestionSet(1); var questionSet2 = CreateValidEntities.QuestionSet(1); item = GetValid(9); item.AddTransactionQuestionSet(questionSet1); item.AddTransactionQuestionSet(questionSet2); item.AddTransactionQuestionSet(questionSet1); #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act } catch (Exception) { Assert.IsNotNull(item); var results = item.ValidationResults().AsMessageList(); results.AssertErrorsAre("TransactionQuestionSet: Transaction Question is already added"); Assert.IsTrue(item.IsTransient()); Assert.IsFalse(item.IsValid()); throw; } } #endregion Invalid Tests #region Valid Tests /// <summary> /// Tests the transaction ignores duplicate in quantity and saves. /// </summary> [TestMethod] public void TestTransactionIgnoresDuplicateInQuantityAndSaves() { #region Arrange var questionSet = CreateValidEntities.QuestionSet(1); var item = GetValid(9); item.AddTransactionQuestionSet(questionSet); item.AddQuantityQuestionSet(questionSet); #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.AreEqual(1, item.QuestionSets.Where(a => a.TransactionLevel).Count()); Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } #endregion Valid Tests #endregion TransactionQuestionSet Tests #region QuantityQuestionSet Tests #region Invalid Tests /// <summary> /// Tests the question sets with duplicate quantity value does not save1. /// </summary> [TestMethod] [ExpectedException(typeof(ApplicationException))] public void TestQuestionSetsWithDuplicateQuantityValueDoesNotSave1() { Item item = null; try { #region Arrange var questionSet = CreateValidEntities.QuestionSet(1); item = GetValid(9); item.AddQuantityQuestionSet(questionSet); item.AddQuantityQuestionSet(questionSet); #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act } catch (Exception) { Assert.IsNotNull(item); var results = item.ValidationResults().AsMessageList(); results.AssertErrorsAre("QuantityQuestionSet: Quantity Question is already added"); Assert.IsTrue(item.IsTransient()); Assert.IsFalse(item.IsValid()); throw; } } /// <summary> /// Tests the question sets with duplicate quantity value does not save2. /// </summary> [TestMethod] [ExpectedException(typeof(ApplicationException))] public void TestQuestionSetsWithDuplicateQuantityValueDoesNotSave2() { Item item = null; try { #region Arrange var questionSet1 = CreateValidEntities.QuestionSet(1); var questionSet2 = CreateValidEntities.QuestionSet(1); item = GetValid(9); item.AddQuantityQuestionSet(questionSet1); item.AddQuantityQuestionSet(questionSet2); item.AddQuantityQuestionSet(questionSet1); #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act } catch (Exception) { Assert.IsNotNull(item); var results = item.ValidationResults().AsMessageList(); results.AssertErrorsAre("QuantityQuestionSet: Quantity Question is already added"); Assert.IsTrue(item.IsTransient()); Assert.IsFalse(item.IsValid()); throw; } } #endregion Invalid Tests #region Valid Tests /// <summary> /// Tests the transaction ignores duplicate in transaction and saves. /// </summary> [TestMethod] public void TestTransactionIgnoresDuplicateInTransactionAndSaves() { #region Arrange var questionSet = CreateValidEntities.QuestionSet(1); var item = GetValid(9); item.AddQuantityQuestionSet(questionSet); item.AddTransactionQuestionSet(questionSet); #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.AreEqual(1, item.QuestionSets.Where(a => a.QuantityLevel).Count()); Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } #endregion Valid Tests #endregion QuantityQuestionSet Tests #region AllowCheckPayment Tests /// <summary> /// Tests the AllowCheckPayment is false saves. /// </summary> [TestMethod] public void TestAllowCheckPaymentIsFalseSaves() { #region Arrange Item item = GetValid(9); item.AllowCheckPayment = false; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.AllowCheckPayment); Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the AllowCheckPayment is true saves. /// </summary> [TestMethod] public void TestAllowCheckPaymentIsTrueSaves() { #region Arrange var item = GetValid(9); item.AllowCheckPayment = true; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsTrue(item.AllowCheckPayment); Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } #endregion AllowCheckPayment Tests #region AllowCreditPayment Tests /// <summary> /// Tests the AllowCreditPayment is false saves. /// </summary> [TestMethod] public void TestAllowCreditPaymentIsFalseSaves() { #region Arrange Item item = GetValid(9); item.AllowCreditPayment = false; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.AllowCreditPayment); Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the AllowCreditPayment is true saves. /// </summary> [TestMethod] public void TestAllowCreditPaymentIsTrueSaves() { #region Arrange var item = GetValid(9); item.AllowCreditPayment = true; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsTrue(item.AllowCreditPayment); Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } #endregion AllowCreditPayment Tests #region AllowedPaymentMethods Tests /// <summary> /// Tests the allowed payment methods allows save with default values. /// </summary> [TestMethod] public void TestAllowedPaymentMethodsAllowsSaveWithDefaultValues() { #region Arrange var item = GetValid(9); #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsTrue(item.AllowCreditPayment); Assert.IsTrue(item.AllowCheckPayment); Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the allowed payment methods prevents save with both payment method values false. /// </summary> [TestMethod] [ExpectedException(typeof(ApplicationException))] public void TestAllowedPaymentMethodsPreventsSaveWithBothPaymentMethodValuesFalse() { Item item = null; try { #region Arrange item = GetValid(9); item.AllowCreditPayment = false; item.AllowCheckPayment = false; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act } catch (Exception) { Assert.IsNotNull(item); Assert.IsFalse(item.AllowCreditPayment); Assert.IsFalse(item.AllowCheckPayment); var results = item.ValidationResults().AsMessageList(); results.AssertErrorsAre("AllowedPaymentMethods: Must check at least one payment method"); Assert.IsTrue(item.IsTransient()); Assert.IsFalse(item.IsValid()); throw; } } #endregion AllowedPaymentMethods Tests #region Summary Tests #region Invalid Tests /// <summary> /// Tests the Summary with null value does not save. /// </summary> [TestMethod] [ExpectedException(typeof(ApplicationException))] public void TestSummaryWithNullValueDoesNotSave() { Item item = null; try { #region Arrange item = GetValid(9); item.Summary = null; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act } catch (Exception) { Assert.IsNotNull(item); var results = item.ValidationResults().AsMessageList(); results.AssertErrorsAre("Summary: may not be null or empty"); Assert.IsTrue(item.IsTransient()); Assert.IsFalse(item.IsValid()); throw; } } /// <summary> /// Tests the Summary with empty string does not save. /// </summary> [TestMethod] [ExpectedException(typeof(ApplicationException))] public void TestSummaryWithEmptyStringDoesNotSave() { Item item = null; try { #region Arrange item = GetValid(9); item.Summary = string.Empty; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act } catch (Exception) { Assert.IsNotNull(item); var results = item.ValidationResults().AsMessageList(); results.AssertErrorsAre("Summary: may not be null or empty"); Assert.IsTrue(item.IsTransient()); Assert.IsFalse(item.IsValid()); throw; } } /// <summary> /// Tests the Summary with spaces only does not save. /// </summary> [TestMethod] [ExpectedException(typeof(ApplicationException))] public void TestSummaryWithSpacesOnlyDoesNotSave() { Item item = null; try { #region Arrange item = GetValid(9); item.Summary = " "; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act } catch (Exception) { Assert.IsNotNull(item); var results = item.ValidationResults().AsMessageList(); results.AssertErrorsAre("Summary: may not be null or empty"); Assert.IsTrue(item.IsTransient()); Assert.IsFalse(item.IsValid()); throw; } } /// <summary> /// Tests the Summary with too long value does not save. /// </summary> [TestMethod] [ExpectedException(typeof(ApplicationException))] public void TestSummaryWithTooLongValueDoesNotSave() { Item item = null; try { #region Arrange item = GetValid(9); item.Summary = "x".RepeatTimes((750 + 1)); #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act } catch (Exception) { Assert.IsNotNull(item); Assert.AreEqual(750 + 1, item.Summary.Length); var results = item.ValidationResults().AsMessageList(); results.AssertErrorsAre("Summary: length must be between 0 and 750"); Assert.IsTrue(item.IsTransient()); Assert.IsFalse(item.IsValid()); throw; } } #endregion Invalid Tests #region Valid Tests /// <summary> /// Tests the Summary with one character saves. /// </summary> [TestMethod] public void TestSummaryWithOneCharacterSaves() { #region Arrange var item = GetValid(9); item.Summary = "x"; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the Summary with long value saves. /// </summary> [TestMethod] public void TestSummaryWithLongValueSaves() { #region Arrange var item = GetValid(9); item.Summary = "x".RepeatTimes(750); #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.AreEqual(750, item.Summary.Length); Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } #endregion Valid Tests #endregion Summary Tests #region DonationLinkLegend Tests #region Invalid Tests /// <summary> /// Tests the DonationLinkLegend with too long value does not save. /// </summary> [TestMethod] [ExpectedException(typeof(ApplicationException))] public void TestDonationLinkLegendWithTooLongValueDoesNotSave() { Item item = null; try { #region Arrange item = GetValid(9); item.DonationLinkLegend = "x".RepeatTimes((50 + 1)); #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act } catch (Exception) { Assert.IsNotNull(item); Assert.AreEqual(50 + 1, item.DonationLinkLegend.Length); var results = item.ValidationResults().AsMessageList(); results.AssertErrorsAre("DonationLinkLegend: length must be between 0 and 50"); Assert.IsTrue(item.IsTransient()); Assert.IsFalse(item.IsValid()); throw; } } #endregion Invalid Tests #region Valid Tests /// <summary> /// Tests the DonationLinkLegend with null value saves. /// </summary> [TestMethod] public void TestDonationLinkLegendWithNullValueSaves() { #region Arrange var item = GetValid(9); item.DonationLinkLegend = null; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the DonationLinkLegend with empty string saves. /// </summary> [TestMethod] public void TestDonationLinkLegendWithEmptyStringSaves() { #region Arrange var item = GetValid(9); item.DonationLinkLegend = string.Empty; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the DonationLinkLegend with one space saves. /// </summary> [TestMethod] public void TestDonationLinkLegendWithOneSpaceSaves() { #region Arrange var item = GetValid(9); item.DonationLinkLegend = " "; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the DonationLinkLegend with one character saves. /// </summary> [TestMethod] public void TestDonationLinkLegendWithOneCharacterSaves() { #region Arrange var item = GetValid(9); item.DonationLinkLegend = "x"; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the DonationLinkLegend with long value saves. /// </summary> [TestMethod] public void TestDonationLinkLegendWithLongValueSaves() { #region Arrange var item = GetValid(9); item.DonationLinkLegend = "x".RepeatTimes(50); #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.AreEqual(50, item.DonationLinkLegend.Length); Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } #endregion Valid Tests #endregion DonationLinkLegend Tests #region DonationLinkInformation Tests #region Invalid Tests /// <summary> /// Tests the DonationLinkInformation with too long value does not save. /// </summary> [TestMethod] [ExpectedException(typeof(ApplicationException))] public void TestDonationLinkInformationWithTooLongValueDoesNotSave() { Item item = null; try { #region Arrange item = GetValid(9); item.DonationLinkInformation = "x".RepeatTimes((500 + 1)); #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act } catch (Exception) { Assert.IsNotNull(item); Assert.AreEqual(500 + 1, item.DonationLinkInformation.Length); var results = item.ValidationResults().AsMessageList(); results.AssertErrorsAre("DonationLinkInformation: length must be between 0 and 500"); Assert.IsTrue(item.IsTransient()); Assert.IsFalse(item.IsValid()); throw; } } #endregion Invalid Tests #region Valid Tests /// <summary> /// Tests the DonationLinkInformation with null value saves. /// </summary> [TestMethod] public void TestDonationLinkInformationWithNullValueSaves() { #region Arrange var item = GetValid(9); item.DonationLinkInformation = null; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the DonationLinkInformation with empty string saves. /// </summary> [TestMethod] public void TestDonationLinkInformationWithEmptyStringSaves() { #region Arrange var item = GetValid(9); item.DonationLinkInformation = string.Empty; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the DonationLinkInformation with one space saves. /// </summary> [TestMethod] public void TestDonationLinkInformationWithOneSpaceSaves() { #region Arrange var item = GetValid(9); item.DonationLinkInformation = " "; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the DonationLinkInformation with one character saves. /// </summary> [TestMethod] public void TestDonationLinkInformationWithOneCharacterSaves() { #region Arrange var item = GetValid(9); item.DonationLinkInformation = "x"; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the DonationLinkInformation with long value saves. /// </summary> [TestMethod] public void TestDonationLinkInformationWithLongValueSaves() { #region Arrange var item = GetValid(9); item.DonationLinkInformation = "x".RepeatTimes(500); #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.AreEqual(500, item.DonationLinkInformation.Length); Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } #endregion Valid Tests #endregion DonationLinkInformation Tests #region DonationLinkText Tests #region Invalid Tests /// <summary> /// Tests the DonationLinkText with too long value does not save. /// </summary> [TestMethod] [ExpectedException(typeof(ApplicationException))] public void TestDonationLinkTextWithTooLongValueDoesNotSave() { Item item = null; try { #region Arrange item = GetValid(9); item.DonationLinkText = "x".RepeatTimes((50 + 1)); #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act } catch (Exception) { Assert.IsNotNull(item); Assert.AreEqual(50 + 1, item.DonationLinkText.Length); var results = item.ValidationResults().AsMessageList(); results.AssertErrorsAre("DonationLinkText: length must be between 0 and 50"); Assert.IsTrue(item.IsTransient()); Assert.IsFalse(item.IsValid()); throw; } } #endregion Invalid Tests #region Valid Tests /// <summary> /// Tests the DonationLinkText with null value saves. /// </summary> [TestMethod] public void TestDonationLinkTextWithNullValueSaves() { #region Arrange var item = GetValid(9); item.DonationLinkText = null; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the DonationLinkText with empty string saves. /// </summary> [TestMethod] public void TestDonationLinkTextWithEmptyStringSaves() { #region Arrange var item = GetValid(9); item.DonationLinkText = string.Empty; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the DonationLinkText with one space saves. /// </summary> [TestMethod] public void TestDonationLinkTextWithOneSpaceSaves() { #region Arrange var item = GetValid(9); item.DonationLinkText = " "; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the DonationLinkText with one character saves. /// </summary> [TestMethod] public void TestDonationLinkTextWithOneCharacterSaves() { #region Arrange var item = GetValid(9); item.DonationLinkText = "x"; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the DonationLinkText with long value saves. /// </summary> [TestMethod] public void TestDonationLinkTextWithLongValueSaves() { #region Arrange var item = GetValid(9); item.DonationLinkText = "x".RepeatTimes(50); #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.AreEqual(50, item.DonationLinkText.Length); Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } #endregion Valid Tests #endregion DonationLinkText Tests #region DonationLinkLink Tests #region Invalid Tests /// <summary> /// Tests the DonationLinkLink with too long value does not save. /// </summary> [TestMethod] [ExpectedException(typeof(ApplicationException))] public void TestDonationLinkLinkWithTooLongValueDoesNotSave() { Item item = null; try { #region Arrange item = GetValid(9); item.DonationLinkLink = "x".RepeatTimes((200 + 1)); #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act } catch (Exception) { Assert.IsNotNull(item); Assert.AreEqual(200 + 1, item.DonationLinkLink.Length); var results = item.ValidationResults().AsMessageList(); results.AssertErrorsAre("DonationLinkLink: length must be between 0 and 200"); Assert.IsTrue(item.IsTransient()); Assert.IsFalse(item.IsValid()); throw; } } #endregion Invalid Tests #region Valid Tests /// <summary> /// Tests the DonationLinkLink with null value saves. /// </summary> [TestMethod] public void TestDonationLinkLinkWithNullValueSaves() { #region Arrange var item = GetValid(9); item.DonationLinkLink = null; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the DonationLinkLink with empty string saves. /// </summary> [TestMethod] public void TestDonationLinkLinkWithEmptyStringSaves() { #region Arrange var item = GetValid(9); item.DonationLinkLink = string.Empty; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the DonationLinkLink with one space saves. /// </summary> [TestMethod] public void TestDonationLinkLinkWithOneSpaceSaves() { #region Arrange var item = GetValid(9); item.DonationLinkLink = " "; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the DonationLinkLink with one character saves. /// </summary> [TestMethod] public void TestDonationLinkLinkWithOneCharacterSaves() { #region Arrange var item = GetValid(9); item.DonationLinkLink = "x"; #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } /// <summary> /// Tests the DonationLinkLink with long value saves. /// </summary> [TestMethod] public void TestDonationLinkLinkWithLongValueSaves() { #region Arrange var item = GetValid(9); item.DonationLinkLink = "x".RepeatTimes(200); #endregion Arrange #region Act ItemRepository.DbContext.BeginTransaction(); ItemRepository.EnsurePersistent(item); ItemRepository.DbContext.CommitTransaction(); #endregion Act #region Assert Assert.AreEqual(200, item.DonationLinkLink.Length); Assert.IsFalse(item.IsTransient()); Assert.IsTrue(item.IsValid()); #endregion Assert } #endregion Valid Tests #endregion DonationLinkLink Tests } }
D-5867, Blue Color, Hindu Cards. The front of this docket style card has Ganeshji printed in gold and embossed. The inserts are plain while the envelope has self-line embossed border all around.
<!DOCTYPE html> <html> <head> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <meta name="viewport" content="width=device-width" /> <link rel="shortcut icon" type="image/x-icon" href="../../../../../../../favicon.ico" /> <title>SortableMetadataField | Android Developers</title> <!-- STYLESHEETS --> <link rel="stylesheet" href="http://fonts.googleapis.com/css?family=Roboto+Condensed"> <link rel="stylesheet" href="http://fonts.googleapis.com/css?family=Roboto:light,regular,medium,thin,italic,mediumitalic,bold" title="roboto"> <link href="../../../../../../../assets/css/default.css" rel="stylesheet" type="text/css"> <!-- FULLSCREEN STYLESHEET --> <link href="../../../../../../../assets/css/fullscreen.css" rel="stylesheet" class="fullscreen" type="text/css"> <!-- JAVASCRIPT --> <script src="http://www.google.com/jsapi" type="text/javascript"></script> <script src="../../../../../../../assets/js/android_3p-bundle.js" type="text/javascript"></script> <script type="text/javascript"> var toRoot = "../../../../../../../"; var metaTags = []; var devsite = false; </script> <script src="../../../../../../../assets/js/docs.js" type="text/javascript"></script> <script type="text/javascript"> var _gaq = _gaq || []; _gaq.push(['_setAccount', 'UA-5831155-1']); _gaq.push(['_trackPageview']); (function() { var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true; ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js'; var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s); })(); </script> </head> <body class="gc-documentation develop" itemscope itemtype="http://schema.org/Article"> <div id="doc-api-level" class="" style="display:none"></div> <a name="top"></a> <a name="top"></a> <!-- Header --> <div id="header-wrapper"> <div id="header"> <div class="wrap" id="header-wrap"> <div class="col-3 logo"> <a href="../../../../../../../index.html"> <img src="../../../../../../../assets/images/dac_logo.png" srcset="../../../../../../../assets/images/[email protected] 2x" width="123" height="25" alt="Android Developers" /> </a> <div class="btn-quicknav" id="btn-quicknav"> <a href="#" class="arrow-inactive">Quicknav</a> <a href="#" class="arrow-active">Quicknav</a> </div> </div> <ul class="nav-x col-9"> <li class="design"> <a href="../../../../../../../design/index.html" zh-tw-lang="設計" zh-cn-lang="设计" ru-lang="Проектирование" ko-lang="디자인" ja-lang="設計" es-lang="Diseñar" >Design</a></li> <li class="develop"><a href="../../../../../../../develop/index.html" zh-tw-lang="開發" zh-cn-lang="开发" ru-lang="Разработка" ko-lang="개발" ja-lang="開発" es-lang="Desarrollar" >Develop</a></li> <li class="distribute last"><a href="../../../../../../../distribute/googleplay/index.html" zh-tw-lang="發佈" zh-cn-lang="分发" ru-lang="Распространение" ko-lang="배포" ja-lang="配布" es-lang="Distribuir" >Distribute</a></li> </ul> <div class="menu-container"> <div class="moremenu"> <div id="more-btn"></div> </div> <div class="morehover" id="moremenu"> <div class="top"></div> <div class="mid"> <div class="header">Links</div> <ul> <li><a href="https://play.google.com/apps/publish/" target="_googleplay">Google Play Developer Console</a></li> <li><a href="http://android-developers.blogspot.com/">Android Developers Blog</a></li> <li><a href="../../../../../../../about/index.html">About Android</a></li> </ul> <div class="header">Android Sites</div> <ul> <li><a href="http://www.android.com">Android.com</a></li> <li class="active"><a>Android Developers</a></li> <li><a href="http://source.android.com">Android Open Source Project</a></li> </ul> <br class="clearfix" /> </div><!-- end 'mid' --> <div class="bottom"></div> </div><!-- end 'moremenu' --> <div class="search" id="search-container"> <div class="search-inner"> <div id="search-btn"></div> <div class="left"></div> <form onsubmit="return submit_search()"> <input id="search_autocomplete" type="text" value="" autocomplete="off" name="q" onfocus="search_focus_changed(this, true)" onblur="search_focus_changed(this, false)" onkeydown="return search_changed(event, true, '../../../../../../../')" onkeyup="return search_changed(event, false, '../../../../../../../')" /> </form> <div class="right"></div> <a class="close hide">close</a> <div class="left"></div> <div class="right"></div> </div><!-- end search-inner --> </div><!-- end search-container --> <div class="search_filtered_wrapper reference"> <div class="suggest-card reference no-display"> <ul class="search_filtered"> </ul> </div> </div> <div class="search_filtered_wrapper docs"> <div class="suggest-card dummy no-display">&nbsp;</div> <div class="suggest-card develop no-display"> <ul class="search_filtered"> </ul> <div class="child-card guides no-display"> </div> <div class="child-card training no-display"> </div> <div class="child-card samples no-display"> </div> </div> <div class="suggest-card design no-display"> <ul class="search_filtered"> </ul> </div> <div class="suggest-card distribute no-display"> <ul class="search_filtered"> </ul> </div> </div> </div><!-- end menu-container (search and menu widget) --> <!-- Expanded quicknav --> <div id="quicknav" class="col-9"> <ul> <li class="design"> <ul> <li><a href="../../../../../../../design/index.html">Get Started</a></li> <li><a href="../../../../../../../design/style/index.html">Style</a></li> <li><a href="../../../../../../../design/patterns/index.html">Patterns</a></li> <li><a href="../../../../../../../design/building-blocks/index.html">Building Blocks</a></li> <li><a href="../../../../../../../design/downloads/index.html">Downloads</a></li> <li><a href="../../../../../../../design/videos/index.html">Videos</a></li> </ul> </li> <li class="develop"> <ul> <li><a href="../../../../../../../training/index.html" zh-tw-lang="訓練課程" zh-cn-lang="培训" ru-lang="Курсы" ko-lang="교육" ja-lang="トレーニング" es-lang="Capacitación" >Training</a></li> <li><a href="../../../../../../../guide/index.html" zh-tw-lang="API 指南" zh-cn-lang="API 指南" ru-lang="Руководства по API" ko-lang="API 가이드" ja-lang="API ガイド" es-lang="Guías de la API" >API Guides</a></li> <li><a href="../../../../../../../reference/packages.html" zh-tw-lang="參考資源" zh-cn-lang="参考" ru-lang="Справочник" ko-lang="참조문서" ja-lang="リファレンス" es-lang="Referencia" >Reference</a></li> <li><a href="../../../../../../../tools/index.html" zh-tw-lang="相關工具" zh-cn-lang="工具" ru-lang="Инструменты" ko-lang="도구" ja-lang="ツール" es-lang="Herramientas" >Tools</a> <ul><li><a href="../../../../../../../sdk/index.html">Get the SDK</a></li></ul> </li> <li><a href="../../../../../../../google/index.html">Google Services</a> </li> </ul> </li> <li class="distribute last"> <ul> <li><a href="../../../../../../../distribute/googleplay/index.html">Google Play</a></li> <li><a href="../../../../../../../distribute/essentials/index.html">Essentials</a></li> <li><a href="../../../../../../../distribute/users/index.html">Get Users</a></li> <li><a href="../../../../../../../distribute/engage/index.html">Engage &amp; Retain</a></li> <li><a href="../../../../../../../distribute/monetize/index.html">Monetize</a></li> <li><a href="../../../../../../../distribute/tools/index.html">Tools &amp; Reference</a></li> <li><a href="../../../../../../../distribute/stories/index.html">Developer Stories</a></li> </ul> </li> </ul> </div><!-- /Expanded quicknav --> </div><!-- end header-wrap.wrap --> </div><!-- end header --> <!-- Secondary x-nav --> <div id="nav-x"> <div class="wrap"> <ul class="nav-x col-9 develop" style="width:100%"> <li class="training"><a href="../../../../../../../training/index.html" zh-tw-lang="訓練課程" zh-cn-lang="培训" ru-lang="Курсы" ko-lang="교육" ja-lang="トレーニング" es-lang="Capacitación" >Training</a></li> <li class="guide"><a href="../../../../../../../guide/index.html" zh-tw-lang="API 指南" zh-cn-lang="API 指南" ru-lang="Руководства по API" ko-lang="API 가이드" ja-lang="API ガイド" es-lang="Guías de la API" >API Guides</a></li> <li class="reference"><a href="../../../../../../../reference/packages.html" zh-tw-lang="參考資源" zh-cn-lang="参考" ru-lang="Справочник" ko-lang="참조문서" ja-lang="リファレンス" es-lang="Referencia" >Reference</a></li> <li class="tools"><a href="../../../../../../../tools/index.html" zh-tw-lang="相關工具" zh-cn-lang="工具" ru-lang="Инструменты" ko-lang="도구" ja-lang="ツール" es-lang="Herramientas" >Tools</a></li> <li class="google"><a href="../../../../../../../google/index.html" >Google Services</a> </li> </ul> </div> </div> <!-- /Sendondary x-nav --> <div id="searchResults" class="wrap" style="display:none;"> <h2 id="searchTitle">Results</h2> <div id="leftSearchControl" class="search-control">Loading...</div> </div> </div> <!--end header-wrapper --> <div id="sticky-header"> <div> <a class="logo" href="#top"></a> <a class="top" href="#top"></a> <ul class="breadcrumb"> <li class="current">SortableMetadataField</li> </ul> </div> </div> <div class="wrap clearfix" id="body-content"> <div class="col-4" id="side-nav" itemscope itemtype="http://schema.org/SiteNavigationElement"> <div id="devdoc-nav"> <div id="api-nav-header"> <div id="api-level-toggle"> <label for="apiLevelCheckbox" class="disabled" title="Select your target API level to dim unavailable APIs">API level: </label> <div class="select-wrapper"> <select id="apiLevelSelector"> <!-- option elements added by buildApiLevelSelector() --> </select> </div> </div><!-- end toggle --> <div id="api-nav-title">Android APIs</div> </div><!-- end nav header --> <script> var SINCE_DATA = [ ]; buildApiLevelSelector(); </script> <div id="swapper"> <div id="nav-panels"> <div id="resize-packages-nav"> <div id="packages-nav" class="scroll-pane"> <ul> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/package-summary.html">com.google.android.gms</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/actions/package-summary.html">com.google.android.gms.actions</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/ads/package-summary.html">com.google.android.gms.ads</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/ads/doubleclick/package-summary.html">com.google.android.gms.ads.doubleclick</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/ads/identifier/package-summary.html">com.google.android.gms.ads.identifier</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/ads/mediation/package-summary.html">com.google.android.gms.ads.mediation</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/ads/mediation/admob/package-summary.html">com.google.android.gms.ads.mediation.admob</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/ads/mediation/customevent/package-summary.html">com.google.android.gms.ads.mediation.customevent</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/ads/purchase/package-summary.html">com.google.android.gms.ads.purchase</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/ads/search/package-summary.html">com.google.android.gms.ads.search</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/analytics/package-summary.html">com.google.android.gms.analytics</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/analytics/ecommerce/package-summary.html">com.google.android.gms.analytics.ecommerce</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/appindexing/package-summary.html">com.google.android.gms.appindexing</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/appstate/package-summary.html">com.google.android.gms.appstate</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/auth/package-summary.html">com.google.android.gms.auth</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/cast/package-summary.html">com.google.android.gms.cast</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/common/package-summary.html">com.google.android.gms.common</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/common/annotation/package-summary.html">com.google.android.gms.common.annotation</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/common/api/package-summary.html">com.google.android.gms.common.api</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/common/data/package-summary.html">com.google.android.gms.common.data</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/common/images/package-summary.html">com.google.android.gms.common.images</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/drive/package-summary.html">com.google.android.gms.drive</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/drive/events/package-summary.html">com.google.android.gms.drive.events</a></li> <li class="selected api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/drive/metadata/package-summary.html">com.google.android.gms.drive.metadata</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/drive/query/package-summary.html">com.google.android.gms.drive.query</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/drive/widget/package-summary.html">com.google.android.gms.drive.widget</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/games/package-summary.html">com.google.android.gms.games</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/games/achievement/package-summary.html">com.google.android.gms.games.achievement</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/games/event/package-summary.html">com.google.android.gms.games.event</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/games/leaderboard/package-summary.html">com.google.android.gms.games.leaderboard</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/games/multiplayer/package-summary.html">com.google.android.gms.games.multiplayer</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/games/multiplayer/realtime/package-summary.html">com.google.android.gms.games.multiplayer.realtime</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/games/multiplayer/turnbased/package-summary.html">com.google.android.gms.games.multiplayer.turnbased</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/games/quest/package-summary.html">com.google.android.gms.games.quest</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/games/request/package-summary.html">com.google.android.gms.games.request</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/games/snapshot/package-summary.html">com.google.android.gms.games.snapshot</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/gcm/package-summary.html">com.google.android.gms.gcm</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/identity/intents/package-summary.html">com.google.android.gms.identity.intents</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/identity/intents/model/package-summary.html">com.google.android.gms.identity.intents.model</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/location/package-summary.html">com.google.android.gms.location</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/maps/package-summary.html">com.google.android.gms.maps</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/maps/model/package-summary.html">com.google.android.gms.maps.model</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/panorama/package-summary.html">com.google.android.gms.panorama</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/plus/package-summary.html">com.google.android.gms.plus</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/plus/model/moments/package-summary.html">com.google.android.gms.plus.model.moments</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/plus/model/people/package-summary.html">com.google.android.gms.plus.model.people</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/security/package-summary.html">com.google.android.gms.security</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/tagmanager/package-summary.html">com.google.android.gms.tagmanager</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/wallet/package-summary.html">com.google.android.gms.wallet</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/wallet/fragment/package-summary.html">com.google.android.gms.wallet.fragment</a></li> <li class="api apilevel-"> <a href="../../../../../../../reference/com/google/android/gms/wearable/package-summary.html">com.google.android.gms.wearable</a></li> </ul><br/> </div> <!-- end packages-nav --> </div> <!-- end resize-packages --> <div id="classes-nav" class="scroll-pane"> <ul> <li><h2>Interfaces</h2> <ul> <li class="api apilevel-"><a href="../../../../../../../reference/com/google/android/gms/drive/metadata/MetadataField.html">MetadataField</a></li> <li class="api apilevel-"><a href="../../../../../../../reference/com/google/android/gms/drive/metadata/SearchableCollectionMetadataField.html">SearchableCollectionMetadataField</a></li> <li class="api apilevel-"><a href="../../../../../../../reference/com/google/android/gms/drive/metadata/SearchableMetadataField.html">SearchableMetadataField</a></li> <li class="api apilevel-"><a href="../../../../../../../reference/com/google/android/gms/drive/metadata/SearchableOrderedMetadataField.html">SearchableOrderedMetadataField</a></li> <li class="selected api apilevel-"><a href="../../../../../../../reference/com/google/android/gms/drive/metadata/SortableMetadataField.html">SortableMetadataField</a></li> </ul> </li> </ul><br/> </div><!-- end classes --> </div><!-- end nav-panels --> <div id="nav-tree" style="display:none" class="scroll-pane"> <div id="tree-list"></div> </div><!-- end nav-tree --> </div><!-- end swapper --> <div id="nav-swap"> <a class="fullscreen">fullscreen</a> <a href='#' onclick='swapNav();return false;'><span id='tree-link'>Use Tree Navigation</span><span id='panel-link' style='display:none'>Use Panel Navigation</span></a> </div> </div> <!-- end devdoc-nav --> </div> <!-- end side-nav --> <script type="text/javascript"> // init fullscreen based on user pref var fullscreen = readCookie("fullscreen"); if (fullscreen != 0) { if (fullscreen == "false") { toggleFullscreen(false); } else { toggleFullscreen(true); } } // init nav version for mobile if (isMobile) { swapNav(); // tree view should be used on mobile $('#nav-swap').hide(); } else { chooseDefaultNav(); if ($("#nav-tree").is(':visible')) { init_default_navtree("../../../../../../../"); } } // scroll the selected page into view $(document).ready(function() { scrollIntoView("packages-nav"); scrollIntoView("classes-nav"); }); </script> <div class="col-12" id="doc-col"> <div id="api-info-block"> <div class="sum-details-links"> </div><!-- end sum-details-links --> <div class="api-level"> </div> </div><!-- end api-info-block --> <!-- ======== START OF CLASS DATA ======== --> <div id="jd-header"> public interface <h1 itemprop="name">SortableMetadataField</h1> implements <a href="../../../../../../../reference/com/google/android/gms/drive/metadata/MetadataField.html">MetadataField</a>&lt;T&gt; </div><!-- end header --> <div id="naMessage"></div> <div id="jd-content" class="api apilevel-"> <table class="jd-inheritance-table"> <tr> <td colspan="1" class="jd-inheritance-class-cell">com.google.android.gms.drive.metadata.SortableMetadataField&lt;T&gt;</td> </tr> </table> <div class="jd-descr"> <h2>Class Overview</h2> <p itemprop="articleBody">Interface for metadata fields that can be used to sort results of the file queries. Implementation of this interface (such as the static values in <code><a href="../../../../../../../reference/com/google/android/gms/drive/query/SortableField.html">SortableField</a></code>) can be add sorting criteria for the file or folder queries. <p> <p> For example, the following code will find all files that are starred, have the MIME type type "text/plain" and list them in the order they were created: <p> <pre> Filter starredFilter = Filters.eq(SearchableField.STARRED, true); Filter mimeTypeFilter = Filters.eq(SearchableField.MIME_TYPE, "text/plain"); Query query = new Query.Builder() .addFilters(starredFilter, mimeTypeFilter) .addSortAscending(SortableField.CREATED_DATE) .build(); for (Metadata metadata : Drive.DriveApi.query(apiClient, query).await().getMetadataBuffer()) { System.out.println(metadata.getTitle()); } </pre></p> </div><!-- jd-descr --> <div class="jd-descr"> </div><!-- jd-descr (summary) --> <!-- Details --> <!-- XML Attributes --> <!-- Enum Values --> <!-- Constants --> <!-- Fields --> <!-- Public ctors --> <!-- ========= CONSTRUCTOR DETAIL ======== --> <!-- Protected ctors --> <!-- ========= METHOD DETAIL ======== --> <!-- Public methdos --> <!-- ========= METHOD DETAIL ======== --> <!-- ========= END OF CLASS DATA ========= --> <A NAME="navbar_top"></A> <div id="footer" class="wrap" > <div id="copyright"> Except as noted, this content is licensed under <a href="http://www.apache.org/licenses/LICENSE-2.0">Apache 2.0</a>. For details and restrictions, see the <a href="../../../../../../../license.html"> Content License</a>. </div> <div id="build_info"> Android GmsCore 1307510&nbsp;r &mdash; <script src="../../../../../../../timestamp.js" type="text/javascript"></script> <script>document.write(BUILD_TIMESTAMP)</script> </div> <div id="footerlinks"> <p> <a href="../../../../../../../about/index.html">About Android</a>&nbsp;&nbsp;|&nbsp; <a href="../../../../../../../legal.html">Legal</a>&nbsp;&nbsp;|&nbsp; <a href="../../../../../../../support.html">Support</a> </p> </div> </div> <!-- end footer --> </div> <!-- jd-content --> </div><!-- end doc-content --> </div> <!-- end body-content --> </body> </html>
In 1992, the Brooklyn duo of Skoob Effect and Drayz scored a huge hit with their breakout single "They Want EFX." One of the catchiest joints of the decade, the two emcees flipped their stutter-step, Ned Flanders-esque flows over a super funky track based around a James Brown loop. The album Dead Serious was gobbled up by fans who dug their unique delivery, and featured the always on-point production of EPMD. They returned two years later with Straight Up Sewaside, a solid follow-up that showed the pair drifting away from the "diggidy"-laced flows that put them on the map.
I’m basically salivating right now as I plan out this trip. Eastern Europe attracts me not only for their affordable prices, or good food, but for the sites. Some sites are really overlooked in some of these countries like Hungary, Slovakia, Romania, and Bulgaria. An Eastern Europe trip tour is in store for you! In order to make this trip happen you’ll definitely need to get your hands on the Club Carlson Visa. Don’t sweat the $75 annual fee on this puppy. You’ll never regret what you get for that small annual fee. Instant Gold Status is among my favorite benefits of the card, which is their second highest tier, so you’ll be getting upgraded often. Last week when I checked in to a Radisson they also forked out free buffet style breakfast coupons, free drink coupons, a larger room, and a cheese and fruit tray in the room. That is service! These guys don’t mess around with their gold customers. However, the hook that will reel you in is the “Last Night Free” feature. When booking a room on points for two or more nights, you’ll get the last night without paying-points or $$$$. Say What?! Yeah, you heard me right. Staying for two nights only uses one night’s worth of points. To throw more ice cream, cherries, whipped cream, and fudge on top, this tour through parts of Eastern Europe combines the use of Low-Level-Redemptions(cheap point redemption), which is the basis for your testimony in WorldWanderlusting. Tonight you’ll be staying at the lovely Park Inn Sofia by Radisson. This place has all the normal amenities of your normal North American hotel, but also sports a steam room and sauna, which is really hard to find in most hotels in the US unless you’re staying at the Fairmont. Although those things are nice, keep in mind that you’re there to see Bulgaria too. Bulgaria still uses the Cyrillic alphabet (Russian), which is bizarre to me based on their location. None of the bordering countries use that same alphabet, but oh well, soak it up. They lay claim to the modern form of yogurt that you probably had for breakfast, so make sure you try some of the local fare that way. They also have famous opera singers, so try to get a ticket to hear them sing in one of their famous opera houses. It doesn’t matter if it’s in Bulgarian, you wouldn’t understand the words if they were in English, would you? Best part? This wonderful hotel will only cost you 9000 points for two nights with the Club Carlson Visa. One of Club Carlson’s most luxurious lines in the Radisson Blu hotels. The Radisson Blu Beke Hotel in Budapest will knock your socks off! I’ve never been to Hungary, but I’ve heard all kinds of good things about it. It’s always nice in Europe when your hotel comes with free Internet, because it definitely isn’t common. This place gives you access to their free WiFi so you can work on the plans of your following days. It also is located really close to the train station, which makes it super convenient for travel to downtown, or if you’re planning on seeing the countryside it is great as well. This city would be a great place to rent a bicycle early in the morning and ride it around all day long. There is a lot to see in Buda, as well as Pest. You heard me right. The river divides the two parts of the city, one is called Buda, the other is Pest. You guessed it. 9000 points for two nights at this humble abode as well. If you thirst for an opportunity to visit a castle where you can eat medieval foods, see people dressed up in costumes, and watch some horse races, then plan on coming in the July and visiting the Sarvar Nadasdy Castle. It could really give your children a feel for living in those times, (minus the unsanitary conditions and the black plague, but who wants to relive those experiences?) then this is a place to visit. They haven’t opened the entire castle to everyone, but it would be great to play King or Queen for a day, right? Western Hungary is known for its wonderful spas. The Park Inn by Radisson Sarvar Hotel & Spa is where you’ll call home. Plan on taking this time to enjoy the beautiful countryside of Western Hungary. This hotel will take 15,000 points for two nights of enjoyment in the spa. For the final leg of the trip you’ll be staying right on the Danube river at the Park Inn Danube Bratislava. With the Danube river at record highs, hopefully this hotel is still there when you arrive. This hotel is right on the river and boasts some amazing views of the city. Get out of the hotel room to see the rest of the city including another famous castle, the Bratislava castle that is less than half a mile from the hotel. Unfortunately it is only a replica, because the original burned to the ground in the early 1800’s. It sits on an acropolis that overlooks the city. The city is characterized by medieval towers, right next to modern buildings. You’ve gotta think that this has been some wanted land for hundreds of years. Once again, this hotel will only cost you 9000 points for two nights. Who doesn’t want to explore eastern Europe on a tour of these beautiful countries, all the while only paying $75 for eight nights in wonderful hotels. Why aren’t you worldwanderlusting with us yet? Pick up the Barclaycard Arrival to help subsidize your train fares by $400 to even further affordabilize[sic] your trip. This entry was posted in Club Carlson, From Wanderlusting to Wandering, loops, Travel Tricks, US Bank and tagged Bratislava, Budapest, Bulgaria, Czech Republic, Danube, Eastern Europe, eastern europe trip tour, europe trip, europe trip tour, Hungary, Romania, Slovakia, Sofia, TripAdvisor. Bookmark the permalink.
"Hello, I am trying to convert a p H Dolby DVD MKV file to a format that I can burn to DVD files. Now iFunia Video Converter for Mac can work as an excellent MKV Burner Software for all users. Step 1: Add MKV files to the MKV to DVD Mac converter. App for Muslim prayer time Azan, Qibla and Amskia for Ramadan and you can see the prayer time of any city you want by long pressed in map and you can. Salat (Salah) Learning: Prayer for Muslim & Quran. Athan: Ramadan , Prayer Time, Azan, Quran, Dua. Muslim Athan - Prayer Times & Ramadan Muslim Pro: Azan, Quran, Qibla is the definitive app for every adherent of Islam. 11 May - 11 sec - Uploaded by tien toi Từ điển Anh - Việt - Duration: Androidvn Games Review 51, views · 5: 07 · Hướng. Download tu dien lac viet mtd free. Get file. T i n l c vi t anh vi t screenshot. T i n l c vi t kh ng c n c i t m i nh t. Lyrics to "Are You Gonna Be My Girl" song by Jet: Go. So 1, 2, 3 Take my hand and come with me Because you look so fine And I really wanna make you m. Are You Gonna Be My Girl Lyrics: Let go / So 1, 2, 3, take my hand and come with me / Because you look so fine / And I really wanna make you mine / I say you. Lyrics to Are You Gonna Be My Girl by Jet: Go. / So 1, 2, 3, take my hand and come with me / Because you look so fine / And I really wanna.. As loved by Apple (#1 New Apps We Love), TechCrunch, Product Hunt (#3 Health&Fitness), Brit+Co, TeenVogue, Intel, therapists, mindfulness teachers, and. With over a million apps and games, Google Play has something for everyone. Browse and install your favorite Android apps and games on your Android phone . 20 Dec I have a folder on my SD called Aura and its taking up over MB. Do I need this folder and how did it get installed. The Piano Sonata No. 14 in C♯ minor "Quasi una fantasia", Op. 27, No. List of glitches in the Halo series. [show]. v • d • e · Halo: Combat Evolved Glitches · 50 Degree . Halo 3: ODST Glitches · AI Super Jump. Surf Noir EP by Beat Connection, released 06 July 1. Sunburn 2. In the Water 3. Windows · VNC Viewer for macOS macOS · VNC Viewer for Linux Linux · VNC Viewer for Raspberry Pi Raspberry Pi · VNC Viewer for iOS iOS · VNC Viewer for . 8 Sep There are many VNC apps for the iPhone, all ranging in price, features, and approach. Our favorite is Screens because it makes your desktop. Solutions Manual [for] Microwave Engineering: Passive Circuits. Front Cover. Peter A.
We've reserved a block of rooms at the Sheraton Bloomington Hotel in Bloomington. Just mention the Welsh & Setterberg wedding when you reserve to receive the group rate. Available the nights of September 12-14.
A Teaspoon and A Pinch: What's on Your Table? What have you made and loved lately... Share your newest or favorite recipes with us, so we can pick one and feature you next week!!! Make brown sugar filling; set aside. Mix flour, baking powder, baking soda and salt; set aside. Beat sugar, butter, vanilla, and eggs in large bowl with electric mixer on medium speed 2 minutes, scraping bowl occasionally. Beat one fourth of the flour mixture and sour cream at a time alternately into sugar mixture on low speed until blended. for angel food or bundt cake pan spread one-third (about 2 cups) of the batter in pan then sprinkle with one-third of filling and repeat. For loaf pans, spread one forth of the batter (about 1 1/2 cups) in each pan, then sprinkle each with one-fourth of the filling, repeat once. bake angel food or bundt cake pan about 1 hour, loaf pans about 45 minutes, or until toothpick inserted near center comes out clean. Cool 10 minutes in pan(s) on wire rack. remove form pan(s) to wire rack and cool 20 minutes. drizzle with vanilla glaze. serve warm or cool. I am a big fan of coffee -- and have been thinking about trying my hand at coffee cake -- thanks so much for linking this recipe up!! I hope that you guys are enjoying the recipes that we are posting...thank you for all the kind comments and for supporting our blog. We would love to see your favorite recipes or even better -- try a new one and let us know how it was!!
SMF: I have the most nostalgic memories about my childhood toys. I loved my pogo stick. I did not leave home without my pogo stick. We would always be jumping off furniture on the set of “Punky” with them. I used to rock it! How do you think toys have evolved over the years? SMF: First of all, I don’t know how to get the toys out of their boxes! I’m always thinking, was it this hard when we were kids? We played board games but now there are so many battery-operated games that light up and do all these different things. But I do love that there are still old-school games like Twister, Operation and Chutes and Ladders. What are you excited about this holiday season? SMF: I just love being with my family and spending quality time together. Christmas is all about family time. My youngest daughter loves to go to the flower market with me, and my oldest cooks with me. So we cook, we bake and the house smells like love and family – it’s happy chaos. Do you have tips for traveling with kids during the holidays? SMF: I always go to Target first and fill up on all sorts of goodies the kids can have fun with. I make packages to keep them busy. I get flavored lip-glosses – my girls love playing dress up – so they can mess around with “makeup” on the plane. I also put in stickers, notebooks and drawing supplies – a whole bunch of little things. SMF: We have an annual Christmas Eve gathering for our family and friends. We sing the “Twelve Nights of Christmas” and everyone has to sing along together – it’s hysterical! To read the entire interview and for more photos, please visit A Bulls Eye View.
Mildred H. Shervy,nee Kjemhus, age 84, April 16, 2008. Beloved wife of the late Rev. Roy Shervy; dear mother of Mark (Betty) and Joyce (Jeffrey) Wilde; loved grandmother of Joshua Shervy, Bret and Erik Wilde and step-grandmother of the late Christina Lane; step-great-grandmother of Alex and Angelina Lane; fond sister of Ruth (Arnold) Roosa and the late Bernice (Frances)Roesler; fond sister-in-law to Lois (George Sr.) Boyer, the late Mariann (Robert) Shervy and the late Ingwald Shervy. Funeral Tuesday, 7 p.m. at theBeidelman-Kunsch Funeral Home, 516 S. Washington St., Naperville. Visitation 3 p.m. until the time of service. Graveside service Thursday, 2 p.m. (EST) at Woodlawn Cemetery in Farmland, IN. Memorial's to the Salvation Army.
Laura is currently working as postdoctoral researcher at the Animal Production Systems group, Wageningen University, the Netherlands. Her current research interests include positive and negative affective states, including methods to asses them, abnormal behaviours, mother-young bonds, and resilience, all this mostly in cattle. She can be contacted at: .
Our baby leggings are handmade in the UK from carefully sourced jersey cotton making them kind to de.. Our Baby Harem Pants are handmade in the UK from carefully sourced jersey cotton making them kind to.. These soft sole baby shoes are ideal for newborns to walkers. Meticulously made and baby tested! Bab.. These Beautifully soft and cozy baby T Shirt are handmade in the UK from carefully sourced high.. What a beautiful personalised gift set! Little brother baby bodysuit and a matching hat with th..
Compilation is going out of memory! Its seems to have issues with DB directive and the byte value 0a5h. Is there any workaround this? Is there any error code or message that could help us to understand what is the real problem ? the only error I receive is a message box with "Out of memory". I’ve tried using and hex based project ( so no compilation) and the same error appears when starting simulation. Switching the ‘0a5h’ value to a different value, everything works fine.
<?php /* Icinga Web 2 | (c) 2013-2015 Icinga Development Team | GPLv2+ */ namespace Icinga\Authentication\UserGroup; use Icinga\Application\Logger; use Icinga\Application\Icinga; use Icinga\Data\ConfigObject; use Icinga\Data\ResourceFactory; use Icinga\Exception\ConfigurationError; /** * Factory for user group backends */ class UserGroupBackend { /** * The default user group backend types provided by Icinga Web 2 * * @var array */ protected static $defaultBackends = array( 'db', 'ldap', 'msldap', //'ini' ); /** * The registered custom user group backends with their identifier as key and class name as value * * @var array */ protected static $customBackends; /** * Register all custom user group backends from all loaded modules */ public static function registerCustomUserGroupBackends() { if (static::$customBackends !== null) { return; } static::$customBackends = array(); $providedBy = array(); foreach (Icinga::app()->getModuleManager()->getLoadedModules() as $module) { foreach ($module->getUserGroupBackends() as $identifier => $className) { if (array_key_exists($identifier, $providedBy)) { Logger::warning( 'Cannot register user group backend of type "%s" provided by module "%s".' . ' The type is already provided by module "%s"', $identifier, $module->getName(), $providedBy[$identifier] ); } elseif (in_array($identifier, static::$defaultBackends)) { Logger::warning( 'Cannot register user group backend of type "%s" provided by module "%s".' . ' The type is a default type provided by Icinga Web 2', $identifier, $module->getName() ); } else { $providedBy[$identifier] = $module->getName(); static::$customBackends[$identifier] = $className; } } } } /** * Return the class for the given custom user group backend * * @param string $identifier The identifier of the custom user group backend * * @return string|null The name of the class or null in case there was no * backend found with the given identifier * * @throws ConfigurationError In case the class associated to the given identifier does not exist */ protected static function getCustomUserGroupBackend($identifier) { static::registerCustomUserGroupBackends(); if (array_key_exists($identifier, static::$customBackends)) { $className = static::$customBackends[$identifier]; if (! class_exists($className)) { throw new ConfigurationError( 'Cannot utilize user group backend of type "%s". Class "%s" does not exist', $identifier, $className ); } return $className; } } /** * Create and return a user group backend with the given name and given configuration applied to it * * @param string $name * @param ConfigObject $backendConfig * * @return UserGroupBackendInterface * * @throws ConfigurationError */ public static function create($name, ConfigObject $backendConfig) { if ($backendConfig->name !== null) { $name = $backendConfig->name; } if (! ($backendType = strtolower($backendConfig->backend))) { throw new ConfigurationError( 'Configuration for user group backend "%s" is missing the \'backend\' directive', $name ); } if (in_array($backendType, static::$defaultBackends)) { // The default backend check is the first one because of performance reasons: // Do not attempt to load a custom user group backend unless it's actually required } elseif (($customClass = static::getCustomUserGroupBackend($backendType)) !== null) { $backend = new $customClass($backendConfig); if (! is_a($backend, 'Icinga\Authentication\UserGroup\UserGroupBackendInterface')) { throw new ConfigurationError( 'Cannot utilize user group backend of type "%s".' . ' Class "%s" does not implement UserGroupBackendInterface', $backendType, $customClass ); } $backend->setName($name); return $backend; } else { throw new ConfigurationError( 'Configuration for user group backend "%s" defines an invalid backend type.' . ' Backend type "%s" is not supported', $name, $backendType ); } if ($backendConfig->resource === null) { throw new ConfigurationError( 'Configuration for user group backend "%s" is missing the \'resource\' directive', $name ); } $resource = ResourceFactory::create($backendConfig->resource); switch ($backendType) { case 'db': $backend = new DbUserGroupBackend($resource); break; case 'ini': $backend = new IniUserGroupBackend($resource); break; case 'ldap': case 'msldap': $backend = new LdapUserGroupBackend($resource); $backend->setConfig($backendConfig); break; } $backend->setName($name); return $backend; } }
/* Copyright (C) 2018 Daniel Schultz This file is part of FLINT. FLINT is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License (LGPL) as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. See <https://www.gnu.org/licenses/>. */ #include <stdio.h> #include <stdlib.h> #include "fmpq_mpoly.h" #include "ulong_extras.h" int main(void) { int result; slong i, j1, j2; FLINT_TEST_INIT(state); flint_printf("cmp...."); fflush(stdout); /* check polynomial terms are in order */ for (i = 0; i < 10 * flint_test_multiplier(); i++) { fmpq_mpoly_ctx_t ctx; fmpq_mpoly_t f, g, mf, mg; slong len; flint_bitcnt_t coeff_bits, exp_bits; fmpq_mpoly_ctx_init_rand(ctx, state, 20); fmpq_mpoly_init(f, ctx); fmpq_mpoly_init(g, ctx); fmpq_mpoly_init(mf, ctx); fmpq_mpoly_init(mg, ctx); len = n_randint(state, 100) + 1; exp_bits = n_randint(state, 200) + 2; exp_bits = n_randint(state, exp_bits) + 2; coeff_bits = n_randint(state, 100) + 1; fmpq_mpoly_randtest_bits(f, state, len, coeff_bits, exp_bits, ctx); fmpq_mpoly_repack_bits(g, f, f->zpoly->bits + n_randint(state, FLINT_BITS), ctx); fmpq_mpoly_assert_canonical(f, ctx); fmpq_mpoly_assert_canonical(g, ctx); for (j1 = 0; j1 < f->zpoly->length; j1++) for (j2 = 0; j2 < g->zpoly->length; j2++) { fmpq_mpoly_get_term_monomial(mf, f, j1, ctx); fmpq_mpoly_get_term_monomial(mg, g, j2, ctx); result = fmpq_mpoly_cmp(mf, mg, ctx); result = (result == 0 && j1 == j2) || (result == +1 && j1 < j2) || (result == -1 && j1 > j2); if (!result) { flint_printf("FAIL\n" "check polynomial terms are in order\n" "i = %wd, j1 = %wd, j2 = %wd\n", i, j1, j2); fflush(stdout); flint_abort(); } } fmpq_mpoly_clear(f, ctx); fmpq_mpoly_clear(g, ctx); fmpq_mpoly_clear(mf, ctx); fmpq_mpoly_clear(mg, ctx); fmpq_mpoly_ctx_clear(ctx); } for (i = 0; i < 100 * flint_test_multiplier(); i++) { fmpq_mpoly_ctx_t ctx; fmpq_mpoly_t a, b, c, aa, bb, cc; int a_a, a_b, a_c, a_aa, a_bb, a_cc; int b_a, b_b, b_c, b_aa, b_bb, b_cc; int c_a, c_b, c_c, c_aa, c_bb, c_cc; flint_bitcnt_t newbits; fmpq_mpoly_ctx_init_rand(ctx, state, 20); fmpq_mpoly_init(a, ctx); fmpq_mpoly_init(b, ctx); fmpq_mpoly_init(c, ctx); fmpq_mpoly_init(aa, ctx); fmpq_mpoly_init(bb, ctx); fmpq_mpoly_init(cc, ctx); fmpq_mpoly_randtest_bits(a, state, n_randint(state, 100) + 1, n_randint(state, 100) + 1, n_randint(state, 200) + 2, ctx); fmpq_mpoly_randtest_bits(b, state, n_randint(state, 100) + 1, n_randint(state, 100) + 1, n_randint(state, 200) + 2, ctx); fmpq_mpoly_randtest_bits(c, state, n_randint(state, 100) + 1, n_randint(state, 100) + 1, n_randint(state, 200) + 2, ctx); newbits = a->zpoly->bits + n_randint(state, 2*FLINT_BITS); newbits = mpoly_fix_bits(newbits, ctx->zctx->minfo); fmpq_mpoly_repack_bits(aa, a, newbits, ctx); newbits = b->zpoly->bits + n_randint(state, 2*FLINT_BITS); newbits = mpoly_fix_bits(newbits, ctx->zctx->minfo); fmpq_mpoly_repack_bits(bb, b, newbits, ctx); newbits = c->zpoly->bits + n_randint(state, 2*FLINT_BITS); newbits = mpoly_fix_bits(newbits, ctx->zctx->minfo); fmpq_mpoly_repack_bits(cc, c, newbits, ctx); a_a = fmpq_mpoly_cmp(a, a, ctx); a_b = fmpq_mpoly_cmp(a, b, ctx); a_c = fmpq_mpoly_cmp(a, c, ctx); a_aa = fmpq_mpoly_cmp(a, aa, ctx); a_bb = fmpq_mpoly_cmp(a, bb, ctx); a_cc = fmpq_mpoly_cmp(a, cc, ctx); b_a = fmpq_mpoly_cmp(b, a, ctx); b_b = fmpq_mpoly_cmp(b, b, ctx); b_c = fmpq_mpoly_cmp(b, c, ctx); b_aa = fmpq_mpoly_cmp(b, aa, ctx); b_bb = fmpq_mpoly_cmp(b, bb, ctx); b_cc = fmpq_mpoly_cmp(b, cc, ctx); c_a = fmpq_mpoly_cmp(c, a, ctx); c_b = fmpq_mpoly_cmp(c, b, ctx); c_c = fmpq_mpoly_cmp(c, c, ctx); c_aa = fmpq_mpoly_cmp(c, aa, ctx); c_bb = fmpq_mpoly_cmp(c, bb, ctx); c_cc = fmpq_mpoly_cmp(c, cc, ctx); if (a_a != 0 || a_aa != 0 || b_b != 0 || b_bb != 0 || c_c != 0 || c_cc != 0) { flint_printf("FAIL\n" "check polynomial compares equal to itself\n" "i = %wd\n", i); fflush(stdout); flint_abort(); } if (a_b != a_bb || a_c != a_cc || b_a != b_aa || b_c != b_cc || c_a != c_aa || c_b != c_bb) { flint_printf("FAIL\n" "check polynomial comparison with differing bits\n" "i = %wd\n", i); fflush(stdout); flint_abort(); } if ((a_b*b_c == 0 && a_c != a_b + b_c) || (a_b*b_c > 0 && a_c != a_b)) { flint_printf("FAIL\n" "check transitivity\n" "i = %wd\n", i); fflush(stdout); flint_abort(); } fmpq_mpoly_clear(a, ctx); fmpq_mpoly_clear(b, ctx); fmpq_mpoly_clear(c, ctx); fmpq_mpoly_clear(aa, ctx); fmpq_mpoly_clear(bb, ctx); fmpq_mpoly_clear(cc, ctx); fmpq_mpoly_ctx_clear(ctx); } FLINT_TEST_CLEANUP(state); flint_printf("PASS\n"); return 0; }
TSS provides cloud temperature monitoring solutions to the life science industry. By focusing on lean temperature management, have enabled global pharmaceutical companies to make informed business decisions in more than 20 years. TSS representative Sanna Persson were present at the 6th Annual Bio/Pharma Cold Chain China, which took place in the Intercontinental Shanghai Pudong Hotel in Shanghai, China. The conference ran 14-15 April 2015.
versa). NewGet cheap one-way long-haul Economy flights with Lufthansas AnyWay Travel Pass promotion InterContinental mulling positive changes to the Ambassador scheme Excellent latam (Avios earning) business class fares to South America for December My review of Iberias refurbished Velazquez lounge at Madrid Terminal 4S More about. RM1* WiFi for Japan Taiwan Korea *Limited To First 2 Rental Days Only 4G WiFi (MY Airport Pick Up) for Japan.5 ( 159 reviews ) 10K Booked. The Palazzo Las Vegas promo codes let you enjoy off-Strip prices for all the features of a great Las Vegas Strip hotel, including: Comfortable hotel rooms, from basic singles and doubles to honeymoon suites. Promo code is valid for Philippines users only. Did Fidelity Just Become the Best Investment Bank? Year: 1990, issued: 5,517, gPT 2,00, add to cart, sweden, Telia World Athletic Games, 60 units. Roundtrip, including all Taxes newDelta is Rolling Out Three Course Meals and Bubbly Wine in Economy newGet up to 5K Virgin Atlantic Miles with Avis Rentals, Plus Save 10 with Amex Offer newTurn Total Rewards Status into 10 Free Nights and 700 in Free Play. A Huge 89-Point Jump for an Authorized Users Credit Score! Free iPhone and Android Mobile Phone Apps. Coupon code is sent via email within 24 hours. Review Tickets restaurant Barcelona, Spain, review El Celler de Can Roca restaurant Girona, Spain. Facebook, tEL3 has been since 2000 very good to call Argentina, Canada and Europe! Start Shopping at m, more Information, for 25 years, Chesapeake Bay Crab Cakes has been supplying quality seafood to retailers and restaurants. See before you buy with a multi-colored online catalog that will make your stomach rumble in.. "The people and service from Advanced Screen Print Supply are second to none. The grip is amazing, the flow of the ink is the highest quality, and they are unbelievably gorgeous! This pen is the ultimate trifecta! Completing..
// // Copyright 2014 Etrawler // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. // // // SearchViewController.h // CarTrawler // // @class LocationListViewController, RentalSession, CTLocation,CTSearchDefaults, CTCountry, CTSearchDefaults; @interface SearchViewController : UIViewController <UITableViewDataSource, UITableViewDelegate, UITextFieldDelegate, UIPickerViewDataSource, UIPickerViewDelegate, ASIHTTPRequestDelegate> @property (nonatomic, weak) IBOutlet UIButton *showDOMapButton; @property (nonatomic, weak) IBOutlet UIButton *showMapButton; @property (nonatomic, assign) BOOL setFromLocations; @property (nonatomic, strong) UIButton *dismissLocationPopUpButton; @property (nonatomic, strong) CTSearchDefaults *ctSearchDefaults; @property (nonatomic, strong) CTCountry *ctCountry; //@property (nonatomic, strong) CTCurrency *ctCurrency; @property (nonatomic, assign) BOOL isSettingDropoffLocation; @property (nonatomic, strong) CTLocation *selectedNearbyLocation; @property (nonatomic, strong) RentalSession *session; @property (nonatomic, assign) BOOL isFromNearbySearch; @property (nonatomic, assign) BOOL isFromCitySearch; @property (nonatomic, assign) BOOL isFromAirportSearch; @property (nonatomic, copy) NSString *formattedPickupString; @property (nonatomic, copy) NSString *formattedDropoffString; @property (nonatomic, copy) NSString *pickUpLocationName; @property (nonatomic, copy) NSString *dropOffLocationName; @property (nonatomic, copy) NSString *pickUpDateTime; @property (nonatomic, copy) NSString *returnDateTime; @property (nonatomic, copy) NSString *pickUpLocationCode; @property (nonatomic, copy) NSString *returnLocationCode; @property (nonatomic, copy) NSString *driverAge; @property (nonatomic, copy) NSString *passengerQty; @property (nonatomic, copy) NSString *homeCountryCode; @property (nonatomic, strong) UIView *footerView; @property (nonatomic, strong) NSDate *theDateFromPicker; @property (nonatomic, strong) NSMutableArray *preloadedCurrencyList; @property (nonatomic, strong) NSMutableArray *preloadedLocations; @property (nonatomic, strong) NSMutableArray *preloadedCountryList; @property (nonatomic, weak) IBOutlet UIPickerView *countryPicker; @property (nonatomic, weak) IBOutlet UIPickerView *currencyPicker; @property (nonatomic, weak) IBOutlet UIView *headerView; @property (nonatomic, strong) UIView *calendarView; @property (nonatomic, weak) IBOutlet UIView *containerView; @property (nonatomic, strong) IBOutlet UIView *pickerView; @property (nonatomic, weak) IBOutlet UIView *alternateLocationFooterView; @property (nonatomic, weak) IBOutlet UIView *selectLocationView; @property (nonatomic, weak) IBOutlet UIView *countryPickerView; @property (nonatomic, weak) IBOutlet UIView *currencyPickerView; @property (nonatomic, weak) IBOutlet UIButton *alternativeBtn; @property (nonatomic, weak) IBOutlet UILabel *dateDisplayLabel; @property (nonatomic, weak) IBOutlet UILabel *pickerModeLabel; @property (nonatomic, strong) UILabel *pickupDateLabel; @property (nonatomic, strong) UILabel *dropoffDateLabel; @property (nonatomic, weak) IBOutlet UITableView *searchTable; @property (nonatomic, strong) UITextField *pickupTextField; @property (nonatomic, strong) UITextField *dropoffTextField; @property (nonatomic, strong) UITextField *ageTextField; @property (nonatomic, strong) UITextField *numberOfPassengersTextField; @property (assign) BOOL frontViewIsVisible; @property (assign) BOOL alternateDrop; @property (nonatomic, assign) BOOL showListNow; @property (nonatomic, assign) BOOL canShowList; @property (nonatomic, assign) BOOL pickupDateSet; @property (nonatomic, assign) BOOL dropoffDateSet; @property (nonatomic, assign) BOOL pickupLocationSet; @property (nonatomic, assign) BOOL dropoffLocationSet; @property (nonatomic, assign) BOOL isSettingPickup; @property (nonatomic, assign) BOOL isSettingDropoff; - (void) dismissCalendarAndPickerViews; - (IBAction) clearData:(id)sender; - (void)loadHomeCountryFromMemory; - (void)processSelectedDates; - (void)realignFieldInCell:(UIView*)field; - (void)updateFieldColors; - (void)saveUserPrefs; - (void)loadUserPrefs; - (void)updateAccessoryViewsInTableView; - (void)showAccessoryTickForCell:(UITableViewCell*)cell withValue:(NSString*)value enabled:(BOOL)enabled; - (void)showMapButtonPressed:(id)sender; @end
Mars tugs at the human imagination like no other planet. With a force mightier than gravity, it attracts the eye to its shimmering red presence in the clear night sky. It is like a glowing ember in a field of ethereal lights, projecting energy and promise. It inspires visions of an approachable world. The mind vaults to thoughts of what might have been (if Mars were a litter closer to the warming Sun) and of what could be (if humans were one day to plant colonies there). Mysterious Mars, alluring Mars, fourth planet from the Sun: so far away and yet, on a cosmic scale, so very near.
Nomads SN5026 Stripe scoop hem tunic. This long sleeve tunic features a soft v neckline and is flared at hemline for movement. Slightly longer at back. In 'Sennen' print, matching scarf available.
<?php /* core/themes/stable/templates/admin/status-report.html.twig */ class __TwigTemplate_e430300fd396a513b4bbea1ba72ba097b3368caf91f53bf7a42c6fc32f807ca4 extends Twig_Template { public function __construct(Twig_Environment $env) { parent::__construct($env); $this->parent = false; $this->blocks = array( ); } protected function doDisplay(array $context, array $blocks = array()) { $tags = array("for" => 20, "if" => 22); $filters = array(); $functions = array(); try { $this->env->getExtension('sandbox')->checkSecurity( array('for', 'if'), array(), array() ); } catch (Twig_Sandbox_SecurityError $e) { $e->setTemplateFile($this->getTemplateName()); if ($e instanceof Twig_Sandbox_SecurityNotAllowedTagError && isset($tags[$e->getTagName()])) { $e->setTemplateLine($tags[$e->getTagName()]); } elseif ($e instanceof Twig_Sandbox_SecurityNotAllowedFilterError && isset($filters[$e->getFilterName()])) { $e->setTemplateLine($filters[$e->getFilterName()]); } elseif ($e instanceof Twig_Sandbox_SecurityNotAllowedFunctionError && isset($functions[$e->getFunctionName()])) { $e->setTemplateLine($functions[$e->getFunctionName()]); } throw $e; } // line 18 echo "<table class=\"system-status-report\"> <tbody> "; // line 20 $context['_parent'] = $context; $context['_seq'] = twig_ensure_traversable((isset($context["requirements"]) ? $context["requirements"] : null)); foreach ($context['_seq'] as $context["_key"] => $context["requirement"]) { // line 21 echo " <tr class=\"system-status-report__entry system-status-report__entry--"; echo $this->env->getExtension('sandbox')->ensureToStringAllowed($this->env->getExtension('drupal_core')->escapeFilter($this->env, $this->getAttribute($context["requirement"], "severity_status", array()), "html", null, true)); echo " color-"; echo $this->env->getExtension('sandbox')->ensureToStringAllowed($this->env->getExtension('drupal_core')->escapeFilter($this->env, $this->getAttribute($context["requirement"], "severity_status", array()), "html", null, true)); echo "\"> "; // line 22 if (twig_in_filter($this->getAttribute($context["requirement"], "severity_status", array()), array(0 => "warning", 1 => "error"))) { // line 23 echo " <th class=\"system-status-report__status-title system-status-report__status-icon system-status-report__status-icon--"; echo $this->env->getExtension('sandbox')->ensureToStringAllowed($this->env->getExtension('drupal_core')->escapeFilter($this->env, $this->getAttribute($context["requirement"], "severity_status", array()), "html", null, true)); echo "\"> <span class=\"visually-hidden\">"; // line 24 echo $this->env->getExtension('sandbox')->ensureToStringAllowed($this->env->getExtension('drupal_core')->escapeFilter($this->env, $this->getAttribute($context["requirement"], "severity_title", array()), "html", null, true)); echo "</span> "; } else { // line 26 echo " <th class=\"system-status-report__status-title\"> "; } // line 28 echo " "; echo $this->env->getExtension('sandbox')->ensureToStringAllowed($this->env->getExtension('drupal_core')->escapeFilter($this->env, $this->getAttribute($context["requirement"], "title", array()), "html", null, true)); echo " </th> <td> "; // line 31 echo $this->env->getExtension('sandbox')->ensureToStringAllowed($this->env->getExtension('drupal_core')->escapeFilter($this->env, $this->getAttribute($context["requirement"], "value", array()), "html", null, true)); echo " "; // line 32 if ($this->getAttribute($context["requirement"], "description", array())) { // line 33 echo " <div class=\"description\">"; echo $this->env->getExtension('sandbox')->ensureToStringAllowed($this->env->getExtension('drupal_core')->escapeFilter($this->env, $this->getAttribute($context["requirement"], "description", array()), "html", null, true)); echo "</div> "; } // line 35 echo " </td> </tr> "; } $_parent = $context['_parent']; unset($context['_seq'], $context['_iterated'], $context['_key'], $context['requirement'], $context['_parent'], $context['loop']); $context = array_intersect_key($context, $_parent) + $_parent; // line 38 echo " </tbody> </table> "; } public function getTemplateName() { return "core/themes/stable/templates/admin/status-report.html.twig"; } public function isTraitable() { return false; } public function getDebugInfo() { return array ( 101 => 38, 93 => 35, 87 => 33, 85 => 32, 81 => 31, 74 => 28, 70 => 26, 65 => 24, 60 => 23, 58 => 22, 51 => 21, 47 => 20, 43 => 18,); } } /* {#*/ /* /***/ /* * @file*/ /* * Theme override for the status report.*/ /* **/ /* * Available variables:*/ /* * - requirements: Contains multiple requirement instances.*/ /* * Each requirement contains:*/ /* * - title: The title of the requirement.*/ /* * - value: (optional) The requirement's status.*/ /* * - description: (optional) The requirement's description.*/ /* * - severity_title: The title of the severity.*/ /* * - severity_status: Indicates the severity status.*/ /* **/ /* * @see template_preprocess_status_report()*/ /* *//* */ /* #}*/ /* <table class="system-status-report">*/ /* <tbody>*/ /* {% for requirement in requirements %}*/ /* <tr class="system-status-report__entry system-status-report__entry--{{ requirement.severity_status }} color-{{ requirement.severity_status }}">*/ /* {% if requirement.severity_status in ['warning', 'error'] %}*/ /* <th class="system-status-report__status-title system-status-report__status-icon system-status-report__status-icon--{{ requirement.severity_status }}">*/ /* <span class="visually-hidden">{{ requirement.severity_title }}</span>*/ /* {% else %}*/ /* <th class="system-status-report__status-title">*/ /* {% endif %}*/ /* {{ requirement.title }}*/ /* </th>*/ /* <td>*/ /* {{ requirement.value }}*/ /* {% if requirement.description %}*/ /* <div class="description">{{ requirement.description }}</div>*/ /* {% endif %}*/ /* </td>*/ /* </tr>*/ /* {% endfor %}*/ /* </tbody>*/ /* </table>*/ /* */
package ca.uhn.fhir.jpa.subscription.r4; import static org.hamcrest.Matchers.contains; import static org.junit.Assert.assertEquals; import static org.junit.Assert.assertThat; import java.net.URI; import java.util.concurrent.Future; import java.util.concurrent.TimeUnit; import org.eclipse.jetty.websocket.api.Session; import org.eclipse.jetty.websocket.client.ClientUpgradeRequest; import org.eclipse.jetty.websocket.client.WebSocketClient; import org.hl7.fhir.r4.model.*; import org.junit.*; import org.slf4j.Logger; import ca.uhn.fhir.jpa.dao.DaoConfig; import ca.uhn.fhir.jpa.provider.r4.BaseResourceProviderR4Test; import ca.uhn.fhir.jpa.subscription.SocketImplementation; import ca.uhn.fhir.rest.api.EncodingEnum; import ca.uhn.fhir.rest.api.MethodOutcome; /** * Adds a FHIR subscription with criteria through the rest interface. Then creates a websocket with the id of the * subscription * <p> * Note: This test only returns a ping with the subscription id, Check FhirSubscriptionWithSubscriptionIdR4Test for * a test that returns the xml of the observation * <p> * To execute the following test, execute it the following way: * 0. execute 'clean' test * 1. Execute the 'createPatient' test * 2. Update the patient id static variable * 3. Execute the 'createSubscription' test * 4. Update the subscription id static variable * 5. Execute the 'attachWebSocket' test * 6. Execute the 'sendObservation' test * 7. Look in the 'attachWebSocket' terminal execution and wait for your ping with the subscription id */ public class FhirSubscriptionWithCriteriaR4Test extends BaseResourceProviderR4Test { private static final Logger ourLog = org.slf4j.LoggerFactory.getLogger(FhirSubscriptionWithCriteriaR4Test.class); private String myPatientId; private String mySubscriptionId; private WebSocketClient myWebSocketClient; private SocketImplementation mySocketImplementation; @Override @After public void after() throws Exception { super.after(); myDaoConfig.setSubscriptionEnabled(new DaoConfig().isSubscriptionEnabled()); myDaoConfig.setSubscriptionPollDelay(new DaoConfig().getSubscriptionPollDelay()); } @Override @Before public void before() throws Exception { super.before(); myDaoConfig.setSubscriptionEnabled(true); myDaoConfig.setSubscriptionPollDelay(0L); /* * Create patient */ Patient patient = FhirR4Util.getPatient(); MethodOutcome methodOutcome = ourClient.create().resource(patient).execute(); myPatientId = methodOutcome.getId().getIdPart(); /* * Create subscription */ Subscription subscription = new Subscription(); subscription.setReason("Monitor new neonatal function (note, age will be determined by the monitor)"); subscription.setStatus(Subscription.SubscriptionStatus.ACTIVE); // subscription.setCriteria("Observation?subject=Patient/" + PATIENT_ID); subscription.setCriteria("Observation?code=SNOMED-CT|82313006&_format=xml"); Subscription.SubscriptionChannelComponent channel = new Subscription.SubscriptionChannelComponent(); channel.setType(Subscription.SubscriptionChannelType.WEBSOCKET); channel.setPayload("application/json"); subscription.setChannel(channel); methodOutcome = ourClient.create().resource(subscription).execute(); mySubscriptionId = methodOutcome.getId().getIdPart(); /* * Attach websocket */ myWebSocketClient = new WebSocketClient(); mySocketImplementation = new SocketImplementation(mySubscriptionId, EncodingEnum.JSON); myWebSocketClient.start(); URI echoUri = new URI("ws://localhost:" + ourPort + "/websocket/r4"); ClientUpgradeRequest request = new ClientUpgradeRequest(); ourLog.info("Connecting to : {}", echoUri); Future<Session> connection = myWebSocketClient.connect(mySocketImplementation, echoUri, request); Session session = connection.get(2, TimeUnit.SECONDS); ourLog.info("Connected to WS: {}", session.isOpen()); } @After public void afterCloseWebsocket() throws Exception { ourLog.info("Shutting down websocket client"); myWebSocketClient.stop(); } @Test public void createObservation() throws Exception { Observation observation = new Observation(); CodeableConcept codeableConcept = new CodeableConcept(); observation.setCode(codeableConcept); Coding coding = codeableConcept.addCoding(); coding.setCode("82313006"); coding.setSystem("SNOMED-CT"); Reference reference = new Reference(); reference.setReference("Patient/" + myPatientId); observation.setSubject(reference); observation.setStatus(Observation.ObservationStatus.FINAL); MethodOutcome methodOutcome2 = ourClient.create().resource(observation).execute(); String observationId = methodOutcome2.getId().getIdPart(); observation.setId(observationId); ourLog.info("Observation id generated by server is: " + observationId); int changes = mySubscriptionDao.pollForNewUndeliveredResources(); ourLog.info("Polling showed {}", changes); assertEquals(1, changes); Thread.sleep(2000); ourLog.info("WS Messages: {}", mySocketImplementation.getMessages()); assertThat(mySocketImplementation.getMessages(), contains("bound " + mySubscriptionId, "ping " + mySubscriptionId)); } @Test public void createObservationThatDoesNotMatch() throws Exception { Observation observation = new Observation(); CodeableConcept codeableConcept = new CodeableConcept(); observation.setCode(codeableConcept); Coding coding = codeableConcept.addCoding(); coding.setCode("8231"); coding.setSystem("SNOMED-CT"); Reference reference = new Reference(); reference.setReference("Patient/" + myPatientId); observation.setSubject(reference); observation.setStatus(Observation.ObservationStatus.FINAL); MethodOutcome methodOutcome2 = ourClient.create().resource(observation).execute(); String observationId = methodOutcome2.getId().getIdPart(); observation.setId(observationId); ourLog.info("Observation id generated by server is: " + observationId); int changes = mySubscriptionDao.pollForNewUndeliveredResources(); ourLog.info("Polling showed {}", changes); assertEquals(0, changes); Thread.sleep(2000); ourLog.info("WS Messages: {}", mySocketImplementation.getMessages()); assertThat(mySocketImplementation.getMessages(), contains("bound " + mySubscriptionId)); } }
Want to know the best places to spend your time when in New Zealand’s South Island? After completing a trip of a lifetime, we are excited to share our favorites. Four and a half weeks in New Zealand’s South Island, and we can show you mountaintops, snow, beaches, oceans, wineries, seafood, varied history and culture.
#!/usr/bin/env pwsh param( # Version of .NET Core to filter by [string]$Version = "*", # Name of OS to filter by [string]$OS, # Type of architecture to filter by [string]$Architecture, # Additional custom path filters (overrides Version) [string[]]$Paths, # Additional args to pass to ImageBuilder [string]$OptionalImageBuilderArgs, # Execution mode of the script [ValidateSet("BuildAndTest", "Build", "Test")] [string]$Mode = "BuildAndTest", # Categories of tests to run [ValidateSet("runtime", "runtime-deps", "aspnet", "sdk", "pre-build", "sample", "image-size")] [string[]]$TestCategories = @("runtime", "runtime-deps", "aspnet", "sdk", "pre-build", "sample", "image-size") ) if (($Mode -eq "BuildAndTest" -or $Mode -eq "Test") -and $TestCategories.Contains("pre-build")) { & ./tests/run-tests.ps1 -TestCategories "pre-build" } if ($Mode -eq "BuildAndTest" -or $Mode -eq "Build") { # Build the product images & ./eng/common/build.ps1 ` -Version $Version ` -OS $OS ` -Architecture $Architecture ` -Paths $Paths ` -OptionalImageBuilderArgs $OptionalImageBuilderArgs $activeOS = docker version -f "{{ .Server.Os }}" if ($activeOS -eq "windows" -and -not $OS) { Write-Host "Setting OS to match local Windows host version" $windowsReleaseId = (Get-ItemProperty -Path "HKLM:\SOFTWARE\Microsoft\Windows NT\CurrentVersion").ReleaseId $OS = "nanoserver-$windowsReleaseId" } # Build the sample images & ./eng/common/build.ps1 ` -Version $Version ` -OS $OS ` -Architecture $Architecture ` -Paths $Paths ` -OptionalImageBuilderArgs $OptionalImageBuilderArgs ` -Manifest manifest.samples.json } if ($Mode -eq "BuildAndTest" -or $Mode -eq "Test") { $localTestCategories = $TestCategories if ($Version -ne "*" -and $TestCategories.Contains("sample")) { $localTestCategories = $TestCategories | where { $_ -ne "sample" } Write-Warning "Skipping sample image testing since Version was set" } & ./tests/run-tests.ps1 ` -Version $Version ` -OS $OS ` -Architecture $Architecture ` -TestCategories $localTestCategories }
<?php /** * Zend Framework (http://framework.zend.com/) * * @link http://github.com/zendframework/zf2 for the canonical source repository * @copyright Copyright (c) 2005-2013 Zend Technologies USA Inc. (http://www.zend.com) * @license http://framework.zend.com/license/new-bsd New BSD License * @package Zend_View */ namespace ZendTest\View\Renderer; use ArrayObject; use PHPUnit_Framework_TestCase as TestCase; use stdClass; use Zend\View\Renderer\JsonRenderer; use Zend\View\Model\JsonModel; use Zend\View\Model\ViewModel; /** * @category Zend * @package Zend_View * @subpackage UnitTests * @group Zend_View */ class JsonRendererTest extends TestCase { /** * @var JsonRenderer */ protected $renderer; public function setUp() { $this->renderer = new JsonRenderer(); } public function testRendersViewModelsWithoutChildren() { $model = new ViewModel(array('foo' => 'bar')); $test = $this->renderer->render($model); $this->assertEquals(json_encode(array('foo' => 'bar')), $test); } public function testRendersViewModelsWithChildrenUsingCaptureToValue() { $root = new ViewModel(array('foo' => 'bar')); $child1 = new ViewModel(array('foo' => 'bar')); $child2 = new ViewModel(array('foo' => 'bar')); $child1->setCaptureTo('child1'); $child2->setCaptureTo('child2'); $root->addChild($child1) ->addChild($child2); $expected = array( 'foo' => 'bar', 'child1' => array( 'foo' => 'bar', ), 'child2' => array( 'foo' => 'bar', ), ); $test = $this->renderer->render($root); $this->assertEquals(json_encode($expected), $test); } public function testThrowsAwayChildModelsWithoutCaptureToValueByDefault() { $root = new ViewModel(array('foo' => 'bar')); $child1 = new ViewModel(array('foo' => 'baz')); $child2 = new ViewModel(array('foo' => 'bar')); $child1->setCaptureTo(false); $child2->setCaptureTo('child2'); $root->addChild($child1) ->addChild($child2); $expected = array( 'foo' => 'bar', 'child2' => array( 'foo' => 'bar', ), ); $test = $this->renderer->render($root); $this->assertEquals(json_encode($expected), $test); } public function testCanMergeChildModelsWithoutCaptureToValues() { $this->renderer->setMergeUnnamedChildren(true); $root = new ViewModel(array('foo' => 'bar')); $child1 = new ViewModel(array('foo' => 'baz')); $child2 = new ViewModel(array('foo' => 'bar')); $child1->setCaptureTo(false); $child2->setCaptureTo('child2'); $root->addChild($child1) ->addChild($child2); $expected = array( 'foo' => 'baz', 'child2' => array( 'foo' => 'bar', ), ); $test = $this->renderer->render($root); $this->assertEquals(json_encode($expected), $test); } public function getNonObjectModels() { return array( array('string'), array(1), array(1.0), array(array('foo', 'bar')), array(array('foo' => 'bar')), ); } /** * @dataProvider getNonObjectModels */ public function testRendersNonObjectModelAsJson($model) { $expected = json_encode($model); $test = $this->renderer->render($model); $this->assertEquals($expected, $test); } public function testRendersJsonSerializableModelsAsJson() { if (version_compare(PHP_VERSION, '5.4.0', '<')) { $this->markTestSkipped('Can only test JsonSerializable models in PHP 5.4.0 and up'); } $model = new TestAsset\JsonModel; $model->value = array('foo' => 'bar'); $expected = json_encode($model->value); $test = $this->renderer->render($model); $this->assertEquals($expected, $test); } public function testRendersTraversableObjectsAsJsonObjects() { $model = new ArrayObject(array( 'foo' => 'bar', 'bar' => 'baz', )); $expected = json_encode($model->getArrayCopy()); $test = $this->renderer->render($model); $this->assertEquals($expected, $test); } public function testRendersNonTraversableNonJsonSerializableObjectsAsJsonObjects() { $model = new stdClass; $model->foo = 'bar'; $model->bar = 'baz'; $expected = json_encode(get_object_vars($model)); $test = $this->renderer->render($model); $this->assertEquals($expected, $test); } public function testNonViewModelInitialArgumentWithValuesRaisesException() { $this->setExpectedException('Zend\View\Exception\DomainException'); $this->renderer->render('foo', array('bar' => 'baz')); } public function testRendersTreesOfViewModelsByDefault() { $this->assertTrue($this->renderer->canRenderTrees()); } public function testSetHasJsonpCallback() { $this->assertFalse($this->renderer->hasJsonpCallback()); $this->renderer->setJsonpCallback(0); $this->assertFalse($this->renderer->hasJsonpCallback()); $this->renderer->setJsonpCallback('callback'); $this->assertTrue($this->renderer->hasJsonpCallback()); } public function testRendersViewModelsWithoutChildrenWithJsonpCallback() { $model = new ViewModel(array('foo' => 'bar')); $this->renderer->setJsonpCallback('callback'); $test = $this->renderer->render($model); $expected = 'callback(' . json_encode(array('foo' => 'bar')) . ');'; $this->assertEquals($expected, $test); } /** * @dataProvider getNonObjectModels */ public function testRendersNonObjectModelAsJsonWithJsonpCallback($model) { $expected = 'callback(' . json_encode($model) . ');'; $this->renderer->setJsonpCallback('callback'); $test = $this->renderer->render($model); $this->assertEquals($expected, $test); } public function testRendersJsonSerializableModelsAsJsonWithJsonpCallback() { if (version_compare(PHP_VERSION, '5.4.0', '<')) { $this->markTestSkipped('Can only test JsonSerializable models in PHP 5.4.0 and up'); } $model = new TestAsset\JsonModel; $model->value = array('foo' => 'bar'); $expected = 'callback(' . json_encode($model->value) . ');'; $this->renderer->setJsonpCallback('callback'); $test = $this->renderer->render($model); $this->assertEquals($expected, $test); } public function testRendersTraversableObjectsAsJsonObjectsWithJsonpCallback() { $model = new ArrayObject(array( 'foo' => 'bar', 'bar' => 'baz', )); $expected = 'callback(' . json_encode($model->getArrayCopy()) . ');'; $this->renderer->setJsonpCallback('callback'); $test = $this->renderer->render($model); $this->assertEquals($expected, $test); } public function testRendersNonTraversableNonJsonSerializableObjectsAsJsonObjectsWithJsonpCallback() { $model = new stdClass; $model->foo = 'bar'; $model->bar = 'baz'; $expected = 'callback(' . json_encode(get_object_vars($model)) . ');'; $this->renderer->setJsonpCallback('callback'); $test = $this->renderer->render($model); $this->assertEquals($expected, $test); } /** * @group 2463 */ public function testRecursesJsonModelChildrenWhenRendering() { $root = new JsonModel(array('foo' => 'bar')); $child1 = new JsonModel(array('foo' => 'bar')); $child2 = new JsonModel(array('foo' => 'bar')); $child1->setCaptureTo('child1'); $child2->setCaptureTo('child2'); $root->addChild($child1) ->addChild($child2); $expected = array( 'foo' => 'bar', 'child1' => array( 'foo' => 'bar', ), 'child2' => array( 'foo' => 'bar', ), ); $test = $this->renderer->render($root); $this->assertEquals(json_encode($expected), $test); } }
Breaking News - ACT trumps NSW! We are a locally owned and operated company, specialising in the installation of the highest quality in ground fibreglass swimming pools in Australia. We service the Canberra region and surrounds and have done so with pride and outstanding results for over 23 years. Add value to your home, make the most of family life and extend your living room with an in ground swimming pool or spa. There is no better way to enjoy your leisure time, relaxing, entertaining friends and keeping cool on hot sunny days than with a pool or spa installed by Capital Fibreglass Pools.
// Licensed to the .NET Foundation under one or more agreements. // The .NET Foundation licenses this file to you under the MIT license. // See the LICENSE file in the project root for more information. using System.Diagnostics.CodeAnalysis; [assembly: SuppressMessage("Microsoft.Security", "CA2113:SecureLateBindingMethods", Scope = "member", Target = "System.ComponentModel.ToolboxItemAttribute.get_ToolboxItemType():System.Type")] namespace System.ComponentModel { /// <summary> /// Specifies attributes for a toolbox item. /// </summary> [AttributeUsage(AttributeTargets.All)] public class ToolboxItemAttribute : Attribute { private Type _toolboxItemType; private string _toolboxItemTypeName; /// <summary> /// Initializes a new instance of ToolboxItemAttribute and sets the type to /// </summary> public static readonly ToolboxItemAttribute Default = new ToolboxItemAttribute("System.Drawing.Design.ToolboxItem, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a"); /// <summary> /// Initializes a new instance of ToolboxItemAttribute and sets the type to /// <see langword='null'/>. /// </summary> public static readonly ToolboxItemAttribute None = new ToolboxItemAttribute(false); /// <summary> /// Gets whether the attribute is the default attribute. /// </summary> public override bool IsDefaultAttribute() => Equals(Default); /// <summary> /// Initializes a new instance of ToolboxItemAttribute and specifies if default values should be used. /// </summary> public ToolboxItemAttribute(bool defaultType) { if (defaultType) { _toolboxItemTypeName = "System.Drawing.Design.ToolboxItem, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a"; } } /// <summary> /// Initializes a new instance of ToolboxItemAttribute and specifies the name of the type. /// </summary> public ToolboxItemAttribute(string toolboxItemTypeName) { _toolboxItemTypeName = toolboxItemTypeName ?? throw new ArgumentNullException(nameof(toolboxItemTypeName)); } /// <summary> /// Initializes a new instance of ToolboxItemAttribute and specifies the type of the toolbox item. /// </summary> public ToolboxItemAttribute(Type toolboxItemType) { _toolboxItemType = toolboxItemType; _toolboxItemTypeName = toolboxItemType.AssemblyQualifiedName; } /// <summary> /// Gets the toolbox item's type. /// </summary> public Type ToolboxItemType { get { if (_toolboxItemType == null) { if (_toolboxItemTypeName != null) { try { _toolboxItemType = Type.GetType(_toolboxItemTypeName, true); } catch (Exception ex) { throw new ArgumentException(SR.Format(SR.ToolboxItemAttributeFailedGetType, _toolboxItemTypeName), ex); } } } return _toolboxItemType; } } public string ToolboxItemTypeName => _toolboxItemTypeName ?? string.Empty; public override bool Equals(object obj) { if (obj == this) { return true; } return (obj is ToolboxItemAttribute other) && (other.ToolboxItemTypeName == ToolboxItemTypeName); } public override int GetHashCode() { if (_toolboxItemTypeName != null) { return _toolboxItemTypeName.GetHashCode(); } return base.GetHashCode(); } } }
We’ve worked on tracking nearly every day we’ve been training at 4 Paws. I hope we never have to do a real track, but our reality is that Brandon has a high risk of elopement. Heaven forbid we lose Brandon or he exits our home or his school and takes off, Bing will help us find him. As you can see in the first video, Brandon is fast. In the second video you will see see Bing tracking Brandon!
/* * Copyright (C) 2000 MySQL AB & MySQL Finland AB & TCX DataKonsult AB * * This program is free software; you can redistribute it and/or modify it under * the terms of the GNU General Public License as published by the Free * Software Foundation; either version 2 of the License, or (at your option) * any later version. * * This program is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for * more details. * * You should have received a copy of the GNU General Public License along with * this program; if not, write to the Free Software Foundation, Inc., 59 * Temple Place, Suite 330, Boston, MA 02111-1307 USA */ /* Remove a row from a MyISAM table */ #include "fulltext.h" #ifdef __WIN__ #include <errno.h> #endif static int d_search(MI_INFO * info, MI_KEYDEF * keyinfo, uchar * key, uint key_length, my_off_t page, uchar * anc_buff); static int del(MI_INFO * info, MI_KEYDEF * keyinfo, uchar * key, uchar * anc_buff, my_off_t leaf_page, uchar * leaf_buff, uchar * keypos, my_off_t next_block, uchar * ret_key); static int underflow(MI_INFO * info, MI_KEYDEF * keyinfo, uchar * anc_buff, my_off_t leaf_page, uchar * leaf_buff, uchar * keypos); static uint remove_key(MI_KEYDEF * keyinfo, uint nod_flag, uchar * keypos, uchar * lastkey, uchar * page_end, my_off_t * next_block); int mi_delete(MI_INFO * info, const byte * record) { uint i; uchar *old_key; int save_errno; char lastpos [8]; MYISAM_SHARE *share = info->s; DBUG_ENTER("mi_delete"); /* Test if record is in datafile */ if (!(info->update & HA_STATE_AKTIV)) { DBUG_RETURN(my_errno = HA_ERR_KEY_NOT_FOUND); /* No database read */ } if (share->options & HA_OPTION_READ_ONLY_DATA) { DBUG_RETURN(my_errno = EACCES); } if (_mi_readinfo(info, F_WRLCK, 1)) DBUG_RETURN(my_errno); if (info->s->calc_checksum) info->checksum = (*info->s->calc_checksum) (info, record); if ((*share->compare_record) (info, record)) goto err; /* Error on read-check */ if (_mi_mark_file_changed(info)) goto err; /* Remove all keys from the .ISAM file */ old_key = info->lastkey2; for (i = 0; i < share->base.keys; i++) { if (((ulonglong) 1 << i) & info->s->state.key_map) { info->s->keyinfo[i].version++; /* * The following code block is for text searching by * SerG */ if (info->s->keyinfo[i].flag & HA_FULLTEXT) { if (_mi_ft_del(info, i, (char *)old_key, record, info->lastpos)) goto err; } else { uint key_length = _mi_make_key(info, i, old_key, record, info->lastpos); if (_mi_ck_delete(info, i, old_key, key_length)) goto err; } } } if ((*share->delete_record) (info)) goto err; /* Remove record from database */ info->s->state.checksum -= info->checksum; info->update = HA_STATE_CHANGED + HA_STATE_DELETED + HA_STATE_ROW_CHANGED; info->state->records--; mi_sizestore(lastpos, info->lastpos); myisam_log_command(MI_LOG_DELETE, info, (byte *) lastpos, sizeof(lastpos), 0); VOID(_mi_writeinfo(info, WRITEINFO_UPDATE_KEYFILE)); allow_break(); /* Allow SIGHUP & SIGINT */ DBUG_RETURN(0); err: save_errno = my_errno; mi_sizestore(lastpos, info->lastpos); myisam_log_command(MI_LOG_DELETE, info, (byte *) lastpos, sizeof(lastpos), 0); if (save_errno != HA_ERR_RECORD_CHANGED) mi_mark_crashed(info); /* mark table crashed */ VOID(_mi_writeinfo(info, WRITEINFO_UPDATE_KEYFILE)); info->update |= HA_STATE_WRITTEN; /* Buffer changed */ allow_break(); /* Allow SIGHUP & SIGINT */ my_errno = save_errno; if (save_errno == HA_ERR_KEY_NOT_FOUND) my_errno = HA_ERR_CRASHED; DBUG_RETURN(my_errno); } /* mi_delete */ /* Remove a key from the btree index */ int _mi_ck_delete(register MI_INFO * info, uint keynr, uchar * key, uint key_length) { int error; uint nod_flag; my_off_t old_root; uchar *root_buff; MI_KEYDEF *keyinfo; DBUG_ENTER("_mi_ck_delete"); if ((old_root = info->s->state.key_root[keynr]) == HA_OFFSET_ERROR) { DBUG_RETURN(my_errno = HA_ERR_CRASHED); } keyinfo = info->s->keyinfo + keynr; if (!(root_buff = (uchar *) my_alloca((uint) keyinfo->block_length + MI_MAX_KEY_BUFF * 2))) { DBUG_PRINT("error", ("Couldn't allocate memory")); DBUG_RETURN(my_errno = ENOMEM); } DBUG_PRINT("info", ("root_page: %ld", old_root)); if (!_mi_fetch_keypage(info, keyinfo, old_root, root_buff, 0)) { error = -1; goto err; } if ((error = d_search(info, keyinfo, key, key_length, old_root, root_buff)) > 0) { if (error == 2) { DBUG_PRINT("test", ("Enlarging of root when deleting")); error = _mi_enlarge_root(info, keynr, key); } else { /* error == 1 */ if (mi_getint(root_buff) <= (nod_flag = mi_test_if_nod(root_buff)) + 3) { error = 0; if (nod_flag) info->s->state.key_root[keynr] = _mi_kpos(nod_flag, root_buff + 2 + nod_flag); else info->s->state.key_root[keynr] = HA_OFFSET_ERROR; if (_mi_dispose(info, keyinfo, old_root)) error = -1; } else error = _mi_write_keypage(info, keyinfo, old_root, root_buff); } } err: my_afree((gptr) root_buff); DBUG_RETURN(error); } /* _mi_ck_delete */ /* * * Remove key below key root * Return values: * 1 if there are less * buffers; In this case anc_buff is not saved * 2 if there are more buffers * * -1 on errors */ static int d_search(register MI_INFO * info, register MI_KEYDEF * keyinfo, uchar * key, uint key_length, my_off_t page, uchar * anc_buff) { int flag , ret_value, save_flag; uint length , nod_flag; my_bool last_key; uchar *leaf_buff, *keypos; my_off_t leaf_page, next_block; uchar lastkey [MI_MAX_KEY_BUFF]; DBUG_ENTER("d_search"); DBUG_DUMP("page", (byte *) anc_buff, mi_getint(anc_buff)); flag = (*keyinfo->bin_search) (info, keyinfo, anc_buff, key, key_length, SEARCH_SAME, &keypos, lastkey, &last_key); if (flag == MI_FOUND_WRONG_KEY) { DBUG_PRINT("error", ("Found wrong key")); DBUG_RETURN(-1); } nod_flag = mi_test_if_nod(anc_buff); leaf_buff = 0; LINT_INIT(leaf_page); if (nod_flag) { leaf_page = _mi_kpos(nod_flag, keypos); if (!(leaf_buff = (uchar *) my_alloca((uint) keyinfo->block_length + MI_MAX_KEY_BUFF * 2))) { DBUG_PRINT("error", ("Couldn't allocate memory")); my_errno = ENOMEM; DBUG_RETURN(-1); } if (!_mi_fetch_keypage(info, keyinfo, leaf_page, leaf_buff, 0)) goto err; } if (flag != 0) { if (!nod_flag) { DBUG_PRINT("error", ("Didn't find key")); my_errno = HA_ERR_CRASHED; /* This should newer * happend */ goto err; } save_flag = 0; ret_value = d_search(info, keyinfo, key, key_length, leaf_page, leaf_buff); } else { /* Found key */ uint tmp; length = mi_getint(anc_buff); tmp = remove_key(keyinfo, nod_flag, keypos, lastkey, anc_buff + length, &next_block); if (tmp == 0) DBUG_RETURN(0); length -= tmp; mi_putint(anc_buff, length, nod_flag); if (!nod_flag) {/* On leaf page */ if (_mi_write_keypage(info, keyinfo, page, anc_buff)) DBUG_RETURN(-1); /* Page will be update later if we return 1 */ DBUG_RETURN(test(length <= (info->quick_mode ? MI_MIN_KEYBLOCK_LENGTH : (uint) keyinfo->underflow_block_length))); } save_flag = 1; ret_value = del(info, keyinfo, key, anc_buff, leaf_page, leaf_buff, keypos, next_block, lastkey); } if (ret_value > 0) { save_flag = 1; if (ret_value == 1) ret_value = underflow(info, keyinfo, anc_buff, leaf_page, leaf_buff, keypos); else { /* This happens only with packed keys */ DBUG_PRINT("test", ("Enlarging of key when deleting")); if (!_mi_get_last_key(info, keyinfo, anc_buff, lastkey, keypos, &length)) { goto err; } ret_value = _mi_insert(info, keyinfo, key, anc_buff, keypos, lastkey, (uchar *) 0, (uchar *) 0, (my_off_t) 0, (my_bool) 0); } } if (ret_value == 0 && mi_getint(anc_buff) > keyinfo->block_length) { save_flag = 1; ret_value = _mi_split_page(info, keyinfo, key, anc_buff, lastkey, 0) | 2; } if (save_flag && ret_value != 1) ret_value |= _mi_write_keypage(info, keyinfo, page, anc_buff); else { DBUG_DUMP("page", (byte *) anc_buff, mi_getint(anc_buff)); } my_afree((byte *) leaf_buff); DBUG_RETURN(ret_value); err: my_afree((byte *) leaf_buff); DBUG_PRINT("exit", ("Error: %d", my_errno)); DBUG_RETURN(-1); } /* d_search */ /* Remove a key that has a page-reference */ static int del(register MI_INFO * info, register MI_KEYDEF * keyinfo, uchar * key, uchar * anc_buff, my_off_t leaf_page, uchar * leaf_buff, uchar * keypos, /* Pos to where deleted key was */ my_off_t next_block, uchar * ret_key) { /* key before keypos in anc_buff */ int ret_value , length; uint a_length , nod_flag, tmp; my_off_t next_page; uchar keybuff [MI_MAX_KEY_BUFF], *endpos, *next_buff, *key_start, *prev_key; MYISAM_SHARE *share = info->s; MI_KEY_PARAM s_temp; DBUG_ENTER("del"); DBUG_PRINT("enter", ("leaf_page: %ld keypos: %lx", leaf_page, keypos)); DBUG_DUMP("leaf_buff", (byte *) leaf_buff, mi_getint(leaf_buff)); endpos = leaf_buff + mi_getint(leaf_buff); if (!(key_start = _mi_get_last_key(info, keyinfo, leaf_buff, keybuff, endpos, &tmp))) DBUG_RETURN(-1); if ((nod_flag = mi_test_if_nod(leaf_buff))) { next_page = _mi_kpos(nod_flag, endpos); if (!(next_buff = (uchar *) my_alloca((uint) keyinfo->block_length + MI_MAX_KEY_BUFF * 2))) DBUG_RETURN(-1); if (!_mi_fetch_keypage(info, keyinfo, next_page, next_buff, 0)) ret_value = -1; else { DBUG_DUMP("next_page", (byte *) next_buff, mi_getint(next_buff)); if ((ret_value = del(info, keyinfo, key, anc_buff, next_page, next_buff, keypos, next_block, ret_key)) > 0) { endpos = leaf_buff + mi_getint(leaf_buff); if (ret_value == 1) { ret_value = underflow(info, keyinfo, leaf_buff, next_page, next_buff, endpos); if (ret_value == 0 && mi_getint(leaf_buff) > keyinfo->block_length) { ret_value = _mi_split_page(info, keyinfo, key, leaf_buff, ret_key, 0) | 2; } } else { DBUG_PRINT("test", ("Inserting of key when deleting")); if (_mi_get_last_key(info, keyinfo, leaf_buff, keybuff, endpos, &tmp)) goto err; ret_value = _mi_insert(info, keyinfo, key, leaf_buff, endpos, keybuff, (uchar *) 0, (uchar *) 0, (my_off_t) 0, 0); } } if (_mi_write_keypage(info, keyinfo, leaf_page, leaf_buff)) goto err; } my_afree((byte *) next_buff); DBUG_RETURN(ret_value); } /* Remove last key from leaf page */ mi_putint(leaf_buff, key_start - leaf_buff, nod_flag); if (_mi_write_keypage(info, keyinfo, leaf_page, leaf_buff)) goto err; /* Place last key in ancestor page on deleted key position */ a_length = mi_getint(anc_buff); endpos = anc_buff + a_length; if (keypos != anc_buff + 2 + share->base.key_reflength && !_mi_get_last_key(info, keyinfo, anc_buff, ret_key, keypos, &tmp)) goto err; prev_key = (keypos == anc_buff + 2 + share->base.key_reflength ? 0 : ret_key); length = (*keyinfo->pack_key) (keyinfo, share->base.key_reflength, keypos == endpos ? (uchar *) 0 : keypos, prev_key, prev_key, keybuff, &s_temp); if (length > 0) bmove_upp((byte *) endpos + length, (byte *) endpos, (uint) (endpos - keypos)); else bmove(keypos, keypos - length, (int)(endpos - keypos) + length); (*keyinfo->store_key) (keyinfo, keypos, &s_temp); /* Save pointer to next leaf */ if (!(*keyinfo->get_key) (keyinfo, share->base.key_reflength, &keypos, ret_key)) goto err; _mi_kpointer(info, keypos - share->base.key_reflength, next_block); mi_putint(anc_buff, a_length + length, share->base.key_reflength); DBUG_RETURN(mi_getint(leaf_buff) <= (info->quick_mode ? MI_MIN_KEYBLOCK_LENGTH : (uint) keyinfo->underflow_block_length)); err: DBUG_RETURN(-1); } /* del */ /* Balances adjacent pages if underflow occours */ static int underflow(register MI_INFO * info, register MI_KEYDEF * keyinfo, uchar * anc_buff, my_off_t leaf_page, /* Ancestor page and underflow page */ uchar * leaf_buff, uchar * keypos) { /* Position to pos after key */ int t_length; uint length , anc_length, buff_length, leaf_length, p_length, s_length , nod_flag, key_reflength, key_length; my_off_t next_page; uchar anc_key [MI_MAX_KEY_BUFF], leaf_key[MI_MAX_KEY_BUFF], *buff, *endpos, *next_keypos, *anc_pos, *half_pos, *temp_pos, *prev_key, *after_key; MI_KEY_PARAM s_temp; MYISAM_SHARE *share = info->s; DBUG_ENTER("underflow"); DBUG_PRINT("enter", ("leaf_page: %ld keypos: %lx", (long)leaf_page, keypos)); DBUG_DUMP("anc_buff", (byte *) anc_buff, mi_getint(anc_buff)); DBUG_DUMP("leaf_buff", (byte *) leaf_buff, mi_getint(leaf_buff)); buff = info->buff; info->buff_used = 1; next_keypos = keypos; nod_flag = mi_test_if_nod(leaf_buff); p_length = nod_flag + 2; anc_length = mi_getint(anc_buff); leaf_length = mi_getint(leaf_buff); key_reflength = share->base.key_reflength; if (info->s->keyinfo + info->lastinx == keyinfo) info->page_changed = 1; if ((keypos < anc_buff + anc_length && (share->rnd++ & 1)) || keypos == anc_buff + 2 + key_reflength) { /* Use page right of * anc-page */ DBUG_PRINT("test", ("use right page")); if (keyinfo->flag & HA_BINARY_PACK_KEY) { if (!(next_keypos = _mi_get_key(info, keyinfo, anc_buff, buff, keypos, &length))) goto err; } else { /* Got to end of found key */ buff[0] = buff[1] = 0; /* Avoid length error check * if packed key */ if (!(*keyinfo->get_key) (keyinfo, key_reflength, &next_keypos, buff)) goto err; } next_page = _mi_kpos(key_reflength, next_keypos); if (!_mi_fetch_keypage(info, keyinfo, next_page, buff, 0)) goto err; buff_length = mi_getint(buff); DBUG_DUMP("next", (byte *) buff, buff_length); /* find keys to make a big key-page */ bmove((byte *) next_keypos - key_reflength, (byte *) buff + 2, key_reflength); if (!_mi_get_last_key(info, keyinfo, anc_buff, anc_key, next_keypos, &length) || !_mi_get_last_key(info, keyinfo, leaf_buff, leaf_key, leaf_buff + leaf_length, &length)) goto err; /* merge pages and put parting key from anc_buff between */ prev_key = (leaf_length == p_length ? (uchar *) 0 : leaf_key); t_length = (*keyinfo->pack_key) (keyinfo, nod_flag, buff + p_length, prev_key, prev_key, anc_key, &s_temp); length = buff_length - p_length; endpos = buff + length + leaf_length + t_length; /* buff will always be larger than before ! */ bmove_upp((byte *) endpos, (byte *) buff + buff_length, length); memcpy((byte *) buff, (byte *) leaf_buff, (size_t) leaf_length); (*keyinfo->store_key) (keyinfo, buff + leaf_length, &s_temp); buff_length = (uint) (endpos - buff); mi_putint(buff, buff_length, nod_flag); /* remove key from anc_buff */ s_length = remove_key(keyinfo, key_reflength, keypos, anc_key, anc_buff + anc_length, (my_off_t *) 0); if (!s_length) goto err; anc_length -= s_length; mi_putint(anc_buff, anc_length, key_reflength); if (buff_length <= keyinfo->block_length) { /* Keys in one page */ memcpy((byte *) leaf_buff, (byte *) buff, (size_t) buff_length); if (_mi_dispose(info, keyinfo, next_page)) goto err; } else { /* Page is full */ endpos = anc_buff + anc_length; DBUG_PRINT("test", ("anc_buff: %lx endpos: %lx", anc_buff, endpos)); if (keypos != anc_buff + 2 + key_reflength && !_mi_get_last_key(info, keyinfo, anc_buff, anc_key, keypos, &length)) goto err; if (!(half_pos = _mi_find_half_pos(nod_flag, keyinfo, buff, leaf_key, &key_length, &after_key))) goto err; length = (uint) (half_pos - buff); memcpy((byte *) leaf_buff, (byte *) buff, (size_t) length); mi_putint(leaf_buff, length, nod_flag); /* Correct new keypointer to leaf_page */ half_pos = after_key; _mi_kpointer(info, leaf_key + key_length, next_page); /* Save key in anc_buff */ prev_key = (keypos == anc_buff + 2 + key_reflength ? (uchar *) 0 : anc_key), t_length = (*keyinfo->pack_key) (keyinfo, key_reflength, (keypos == endpos ? (uchar *) 0 : keypos), prev_key, prev_key, leaf_key, &s_temp); if (t_length >= 0) bmove_upp((byte *) endpos + t_length, (byte *) endpos, (uint) (endpos - keypos)); else bmove(keypos, keypos - t_length, (uint) (endpos - keypos) + t_length); (*keyinfo->store_key) (keyinfo, keypos, &s_temp); mi_putint(anc_buff, (anc_length += t_length), key_reflength); /* Store key first in new page */ if (nod_flag) bmove((byte *) buff + 2, (byte *) half_pos - nod_flag, (size_t) nod_flag); if (!(*keyinfo->get_key) (keyinfo, nod_flag, &half_pos, leaf_key)) goto err; t_length = (int)(*keyinfo->pack_key) (keyinfo, nod_flag, (uchar *) 0, (uchar *) 0, (uchar *) 0, leaf_key, &s_temp); /* t_length will always be > 0 for a new page ! */ length = (uint) ((buff + mi_getint(buff)) - half_pos); bmove((byte *) buff + p_length + t_length, (byte *) half_pos, (size_t) length); (*keyinfo->store_key) (keyinfo, buff + p_length, &s_temp); mi_putint(buff, length + t_length + p_length, nod_flag); if (_mi_write_keypage(info, keyinfo, next_page, buff)) goto err; } if (_mi_write_keypage(info, keyinfo, leaf_page, leaf_buff)) goto err; DBUG_RETURN(anc_length <= ((info->quick_mode ? MI_MIN_BLOCK_LENGTH : (uint) keyinfo->underflow_block_length))); } DBUG_PRINT("test", ("use left page")); keypos = _mi_get_last_key(info, keyinfo, anc_buff, anc_key, keypos, &length); if (!keypos) goto err; next_page = _mi_kpos(key_reflength, keypos); if (!_mi_fetch_keypage(info, keyinfo, next_page, buff, 0)) goto err; buff_length = mi_getint(buff); endpos = buff + buff_length; DBUG_DUMP("prev", (byte *) buff, buff_length); /* find keys to make a big key-page */ bmove((byte *) next_keypos - key_reflength, (byte *) leaf_buff + 2, key_reflength); next_keypos = keypos; if (!(*keyinfo->get_key) (keyinfo, key_reflength, &next_keypos, anc_key)) goto err; if (!_mi_get_last_key(info, keyinfo, buff, leaf_key, endpos, &length)) goto err; /* merge pages and put parting key from anc_buff between */ prev_key = (leaf_length == p_length ? (uchar *) 0 : leaf_key); t_length = (*keyinfo->pack_key) (keyinfo, nod_flag, (leaf_length == p_length ? (uchar *) 0 : leaf_buff + p_length), prev_key, prev_key, anc_key, &s_temp); if (t_length >= 0) bmove((byte *) endpos + t_length, (byte *) leaf_buff + p_length, (size_t) (leaf_length - p_length)); else /* We gained space */ bmove((byte *) endpos, (byte *) leaf_buff + ((int)p_length - t_length), (size_t) (leaf_length - p_length + t_length)); (*keyinfo->store_key) (keyinfo, endpos, &s_temp); buff_length = buff_length + leaf_length - p_length + t_length; mi_putint(buff, buff_length, nod_flag); /* remove key from anc_buff */ s_length = remove_key(keyinfo, key_reflength, keypos, anc_key, anc_buff + anc_length, (my_off_t *) 0); if (!s_length) goto err; anc_length -= s_length; mi_putint(anc_buff, anc_length, key_reflength); if (buff_length <= keyinfo->block_length) { /* Keys in one page */ if (_mi_dispose(info, keyinfo, leaf_page)) goto err; } else { /* Page is full */ if (keypos == anc_buff + 2 + key_reflength) anc_pos = 0; /* First key */ else if (!_mi_get_last_key(info, keyinfo, anc_buff, anc_pos = anc_key, keypos, &length)) goto err; endpos = _mi_find_half_pos(nod_flag, keyinfo, buff, leaf_key, &key_length, &half_pos); if (!endpos) goto err; _mi_kpointer(info, leaf_key + key_length, leaf_page); /* Save key in anc_buff */ DBUG_DUMP("anc_buff", (byte *) anc_buff, anc_length); DBUG_DUMP("key_to_anc", (byte *) leaf_key, key_length); temp_pos = anc_buff + anc_length; t_length = (*keyinfo->pack_key) (keyinfo, key_reflength, keypos == temp_pos ? (uchar *) 0 : keypos, anc_pos, anc_pos, leaf_key, &s_temp); if (t_length > 0) bmove_upp((byte *) temp_pos + t_length, (byte *) temp_pos, (uint) (temp_pos - keypos)); else bmove(keypos, keypos - t_length, (uint) (temp_pos - keypos) + t_length); (*keyinfo->store_key) (keyinfo, keypos, &s_temp); mi_putint(anc_buff, (anc_length += t_length), key_reflength); /* Store first key on new page */ if (nod_flag) bmove((byte *) leaf_buff + 2, (byte *) half_pos - nod_flag, (size_t) nod_flag); if (!(length = (*keyinfo->get_key) (keyinfo, nod_flag, &half_pos, leaf_key))) goto err; DBUG_DUMP("key_to_leaf", (byte *) leaf_key, length); t_length = (*keyinfo->pack_key) (keyinfo, nod_flag, (uchar *) 0, (uchar *) 0, (uchar *) 0, leaf_key, &s_temp); length = (uint) ((buff + buff_length) - half_pos); DBUG_PRINT("info", ("t_length: %d length: %d", t_length, (int)length)); bmove((byte *) leaf_buff + p_length + t_length, (byte *) half_pos, (size_t) length); (*keyinfo->store_key) (keyinfo, leaf_buff + p_length, &s_temp); mi_putint(leaf_buff, length + t_length + p_length, nod_flag); if (_mi_write_keypage(info, keyinfo, leaf_page, leaf_buff)) goto err; mi_putint(buff, endpos - buff, nod_flag); } if (_mi_write_keypage(info, keyinfo, next_page, buff)) goto err; DBUG_RETURN(anc_length <= (uint) keyinfo->block_length / 2); err: DBUG_RETURN(-1); } /* underflow */ /* * remove a key from packed buffert The current code doesn't handle the case * that the next key may be packed better against the previous key if there * is a case difference returns how many chars was removed or 0 on error */ static uint remove_key(MI_KEYDEF * keyinfo, uint nod_flag, uchar * keypos, /* Where key starts */ uchar * lastkey, /* key to be removed */ uchar * page_end, /* End of page */ my_off_t * next_block) { /* ptr to next block */ int s_length; uchar *start; DBUG_ENTER("remove_key"); DBUG_PRINT("enter", ("keypos: %lx page_end: %lx", keypos, page_end)); start = keypos; if (!(keyinfo->flag & (HA_PACK_KEY | HA_SPACE_PACK_USED | HA_VAR_LENGTH_KEY | HA_BINARY_PACK_KEY))) { s_length = (int)(keyinfo->keylength + nod_flag); if (next_block && nod_flag) *next_block = _mi_kpos(nod_flag, keypos + s_length); } else { /* Let keypos point at next key */ /* Calculate length of key */ if (!(*keyinfo->get_key) (keyinfo, nod_flag, &keypos, lastkey)) DBUG_RETURN(0); /* Error */ if (next_block && nod_flag) *next_block = _mi_kpos(nod_flag, keypos); s_length = (int)(keypos - start); if (keypos != page_end) { if (keyinfo->flag & HA_BINARY_PACK_KEY) { uchar *old_key = start; uint next_length, prev_length, prev_pack_length; get_key_length(next_length, keypos); get_key_pack_length(prev_length, prev_pack_length, old_key); if (next_length > prev_length) { /* * We have to copy data from the * current key to the next key */ bmove_upp((char *)keypos, (char *)(lastkey + next_length), (next_length - prev_length)); keypos -= (next_length - prev_length) + prev_pack_length; store_key_length(keypos, prev_length); s_length = (int)(keypos - start); } } else { /* Check if a variable length first key part */ if ((keyinfo->seg->flag & HA_PACK_KEY) && *keypos & 128) { /* * Next key is packed against the * current one */ uint next_length, prev_length, prev_pack_length, lastkey_length, rest_length; if (keyinfo->seg[0].length >= 127) { if (!(prev_length = mi_uint2korr(start) & 32767)) goto end; next_length = mi_uint2korr(keypos) & 32767; keypos += 2; prev_pack_length = 2; } else { if (!(prev_length = *start & 127)) goto end; /* Same key as previous */ next_length = *keypos & 127; keypos++; prev_pack_length = 1; } if (!(*start & 128)) prev_length = 0; /* prev key not packed */ if (keyinfo->seg[0].flag & HA_NULL_PART) lastkey++; /* Skipp null marker */ get_key_length(lastkey_length, lastkey); if (!next_length) { /* Same key after */ next_length = lastkey_length; rest_length = 0; } else get_key_length(rest_length, keypos); if (next_length > prev_length) { /* Key after is based on * deleted key */ uint pack_length, tmp; bmove_upp((char *)keypos, (char *)(lastkey + next_length), tmp = (next_length - prev_length)); rest_length += tmp; pack_length = prev_length ? get_pack_length(rest_length) : 0; keypos -= tmp + pack_length + prev_pack_length; s_length = (int)(keypos - start); if (prev_length) { /* Pack against prev key */ *keypos++ = start[0]; if (prev_pack_length == 2) *keypos++ = start[1]; store_key_length(keypos, rest_length); } else { /* * Next key is not * packed anymore */ if (keyinfo->seg[0].flag & HA_NULL_PART) { rest_length++; /* Mark not null */ } if (prev_pack_length == 2) { mi_int2store(keypos, rest_length); } else *keypos = rest_length; } } } } } } end: bmove((byte *) start, (byte *) start + s_length, (uint) (page_end - start - s_length)); DBUG_RETURN((uint) s_length); } /* remove_key */
package miyagi389.android.apps.tr.domain.repository; import io.reactivex.Maybe; import io.reactivex.Observable; import miyagi389.android.apps.tr.domain.model.Events; import miyagi389.android.apps.tr.domain.model.EventsCount; public interface EventsRepository { Observable<Events> findByCalendarIdLast( long calendarId, String title ); enum SortOrder { DT_START_ASCENDING(1), DT_START_DESCENDING(2); public static final SortOrder DEFAULT = DT_START_ASCENDING; public final int value; SortOrder(final int value) { this.value = value; } public static SortOrder valueOfAsInt( final int value, final SortOrder defaultValue ) { for (final SortOrder o : values()) { if (o.value == value) { return o; } } return defaultValue; } } Maybe<EventsCount> countByCalendarId( long calendarId, String title ); Observable<Events> findByCalendarId( long calendarId, String title, long fromDate, long toDate, SortOrder sortOrder ); Maybe<Events> findById(long id); Maybe<Long> insert(Events model); Maybe<Long> update(Events model); Maybe<Long> deleteById(long id); }
// // SuperTuxKart - a fun racing game with go-kart // Copyright (C) 2010-2014 Joerg Henrichs // // 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, write to the Free Software // Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. #ifndef HEADER_PLAYER_MANAGER_HPP #define HEADER_PLAYER_MANAGER_HPP #include "achievements/achievement.hpp" #include "achievements/achievements_status.hpp" #include "config/player_profile.hpp" #include "utils/no_copy.hpp" #include "utils/ptr_vector.hpp" #include <irrString.h> #include <cstddef> // NULL class AchievementsStatus; namespace Online { class CurrentUser; class HTTPRequest; class OnlineProfile; class XMLRequest; } class PlayerProfile; /** A special class that manages all local player accounts. It reads all player * accounts from the players.xml file in the user config directory. For each * player an instance of PlayerProfile is created, which keeps track of * story mode progress, achievements and other data. It also keeps track of * the currently logged in player. * It includes several handy static functions which avoid long call * sequences, e.g.: * PlayerManager::getCurrentOnlineId() * which is just: * PlayerManager::get()->getCurrentUser()->getID(); */ class PlayerManager : public NoCopy { private: static PlayerManager* m_player_manager; PtrVector<PlayerProfile> m_all_players; /** A pointer to the current player. */ PlayerProfile* m_current_player; /** Saves the XML tree from players.xml for use in the 2nd * loading stage (initRemainingData). */ const XMLNode *m_player_data; void load(); PlayerManager(); ~PlayerManager(); public: static void create(); // ------------------------------------------------------------------------ /** Static singleton get function. */ static PlayerManager* get() { assert(m_player_manager); return m_player_manager; } // get // ------------------------------------------------------------------------ static void destroy() { assert(m_player_manager); delete m_player_manager; m_player_manager = NULL; } // destroy void save(); void initRemainingData(); unsigned int getUniqueId() const; void addDefaultPlayer(); PlayerProfile* addNewPlayer(const irr::core::stringw& name); void createGuestPlayers(int n); void deletePlayer(PlayerProfile *player); void setCurrentPlayer(PlayerProfile *player); const PlayerProfile *getPlayerById(unsigned int id); void enforceCurrentPlayer(); unsigned int getNumNonGuestPlayers() const; static void setUserDetails(Online::HTTPRequest *request, const std::string &action, const std::string &php_name = ""); static unsigned int getCurrentOnlineId(); static bool isCurrentLoggedIn(); static Online::OnlineProfile* getCurrentOnlineProfile(); static PlayerProfile::OnlineState getCurrentOnlineState(); static const irr::core::stringw& getCurrentOnlineUserName(); static void requestOnlinePoll(); static void resumeSavedSession(); static void onSTKQuit(); static void requestSignOut(); static Online::XMLRequest *requestSignIn(const irr::core::stringw &username, const irr::core::stringw &password); // ------------------------------------------------------------------------ /** Returns the current player. */ static PlayerProfile* getCurrentPlayer() { return get()->m_current_player; } // getCurrentPlayer // ------------------------------------------------------------------------ PlayerProfile *getPlayer(const irr::core::stringw &name); // ------------------------------------------------------------------------ /** Returns the number of players in the config file.*/ unsigned int getNumPlayers() const { return m_all_players.size(); } // ------------------------------------------------------------------------ /** Returns a player with a given unique id. */ const PlayerProfile *getPlayer(unsigned int n) const { return &m_all_players[n]; } // getPlayer // ------------------------------------------------------------------------ /** Returns a player with a given unique id. */ PlayerProfile *getPlayer(unsigned int n) { return &m_all_players[n];} // ------------------------------------------------------------------------ /** A handy shortcut funtion. */ static AchievementsStatus* getCurrentAchievementsStatus() { return PlayerManager::getCurrentPlayer()->getAchievementsStatus(); } // getCurrentAchievementsStatus // ------------------------------------------------------------------------ /** A handy shortcut to increase points for an achievement key of the * current player. */ static void increaseAchievement(unsigned int index, const std::string &key, int increase = 1) { Achievement *a = getCurrentAchievementsStatus()->getAchievement(index); if (!a) { Log::fatal("PlayerManager", "Achievement '%d' not found.", index); } a->increase(key, increase); } // increaseAchievement // ------------------------------------------------------------------------ }; // PlayerManager #endif
#app { font-family: 'Avenir', Helvetica, Arial, sans-serif; -webkit-font-smoothing: antialiased; -moz-osx-font-smoothing: grayscale; text-align: center; color: #2c3e50; margin-top: 60px; }
/* tslint:disable:forin */ import { Component, ContentChildren, Directive, EventEmitter, Injectable, Input, Output, Optional, HostBinding, HostListener, OnInit, OnChanges, OnDestroy, Pipe, PipeTransform, SimpleChange } from '@angular/core'; import { Observable } from 'rxjs/Observable'; import 'rxjs/add/observable/of'; import 'rxjs/add/operator/delay'; ////////// The App: Services and Components for the tests. ////////////// export class Hero { name: string; } ////////// Services /////////////// // #docregion FancyService @Injectable() export class FancyService { protected value: string = 'real value'; getValue() { return this.value; } setValue(value: string) { this.value = value; } getAsyncValue() { return Promise.resolve('async value'); } getObservableValue() { return Observable.of('observable value'); } getTimeoutValue() { return new Promise((resolve) => { setTimeout(() => { resolve('timeout value'); }, 10); }); } getObservableDelayValue() { return Observable.of('observable delay value').delay(10); } } // #enddocregion FancyService // #docregion DependentService @Injectable() export class DependentService { constructor(private dependentService: FancyService) { } getValue() { return this.dependentService.getValue(); } } // #enddocregion DependentService /////////// Pipe //////////////// /* * Reverse the input string. */ // #docregion ReversePipe @Pipe({ name: 'reverse' }) export class ReversePipe implements PipeTransform { transform(s: string) { let r = ''; for (let i = s.length; i; ) { r += s[--i]; }; return r; } } // #enddocregion ReversePipe //////////// Components ///////////// @Component({ selector: 'bank-account', template: ` Bank Name: {{bank}} Account Id: {{id}} ` }) export class BankAccountComponent { @Input() bank: string; @Input('account') id: string; // Removed on 12/02/2016 when ceased public discussion of the `Renderer`. Revive in future? // constructor(private renderer: Renderer, private el: ElementRef ) { // renderer.setElementProperty(el.nativeElement, 'customProperty', true); // } } /** A component with attributes, styles, classes, and property setting */ @Component({ selector: 'bank-account-parent', template: ` <bank-account bank="RBC" account="4747" [style.width.px]="width" [style.color]="color" [class.closed]="isClosed" [class.open]="!isClosed"> </bank-account> ` }) export class BankAccountParentComponent { width = 200; color = 'red'; isClosed = true; } // #docregion ButtonComp @Component({ selector: 'button-comp', template: ` <button (click)="clicked()">Click me!</button> <span>{{message}}</span>` }) export class ButtonComponent { isOn = false; clicked() { this.isOn = !this.isOn; } get message() { return `The light is ${this.isOn ? 'On' : 'Off'}`; } } // #enddocregion ButtonComp @Component({ selector: 'child-1', template: `<span>Child-1({{text}})</span>` }) export class Child1Component { @Input() text = 'Original'; } @Component({ selector: 'child-2', template: '<div>Child-2({{text}})</div>' }) export class Child2Component { @Input() text: string; } @Component({ selector: 'child-3', template: '<div>Child-3({{text}})</div>' }) export class Child3Component { @Input() text: string; } @Component({ selector: 'input-comp', template: `<input [(ngModel)]="name">` }) export class InputComponent { name = 'John'; } /* Prefer this metadata syntax */ // @Directive({ // selector: 'input[value]', // host: { // '[value]': 'value', // '(input)': 'valueChange.emit($event.target.value)' // }, // inputs: ['value'], // outputs: ['valueChange'] // }) // export class InputValueBinderDirective { // value: any; // valueChange: EventEmitter<any> = new EventEmitter(); // } // As the styleguide recommends @Directive({ selector: 'input[value]' }) export class InputValueBinderDirective { @HostBinding() @Input() value: any; @Output() valueChange: EventEmitter<any> = new EventEmitter(); @HostListener('input', ['$event.target.value']) onInput(value: any) { this.valueChange.emit(value); } } @Component({ selector: 'input-value-comp', template: ` Name: <input [(value)]="name"> {{name}} ` }) export class InputValueBinderComponent { name = 'Sally'; // initial value } @Component({ selector: 'parent-comp', template: `Parent(<child-1></child-1>)` }) export class ParentComponent { } @Component({ selector: 'io-comp', template: `<div class="hero" (click)="click()">Original {{hero.name}}</div>` }) export class IoComponent { @Input() hero: Hero; @Output() selected = new EventEmitter<Hero>(); click() { this.selected.emit(this.hero); } } @Component({ selector: 'io-parent-comp', template: ` <p *ngIf="!selectedHero"><i>Click to select a hero</i></p> <p *ngIf="selectedHero">The selected hero is {{selectedHero.name}}</p> <io-comp *ngFor="let hero of heroes" [hero]=hero (selected)="onSelect($event)"> </io-comp> ` }) export class IoParentComponent { heroes: Hero[] = [ {name: 'Bob'}, {name: 'Carol'}, {name: 'Ted'}, {name: 'Alice'} ]; selectedHero: Hero; onSelect(hero: Hero) { this.selectedHero = hero; } } @Component({ selector: 'my-if-comp', template: `MyIf(<span *ngIf="showMore">More</span>)` }) export class MyIfComponent { showMore = false; } @Component({ selector: 'my-service-comp', template: `injected value: {{fancyService.value}}`, providers: [FancyService] }) export class TestProvidersComponent { constructor(private fancyService: FancyService) {} } @Component({ selector: 'my-service-comp', template: `injected value: {{fancyService.value}}`, viewProviders: [FancyService] }) export class TestViewProvidersComponent { constructor(private fancyService: FancyService) {} } @Component({ selector: 'external-template-comp', templateUrl: './bag-external-template.html' }) export class ExternalTemplateComponent implements OnInit { serviceValue: string; constructor(@Optional() private service: FancyService) { } ngOnInit() { if (this.service) { this.serviceValue = this.service.getValue(); } } } @Component({ selector: 'comp-w-ext-comp', template: ` <h3>comp-w-ext-comp</h3> <external-template-comp></external-template-comp> ` }) export class InnerCompWithExternalTemplateComponent { } @Component({ selector: 'bad-template-comp', templateUrl: './non-existant.html' }) export class BadTemplateUrlComponent { } @Component({selector: 'needs-content', template: '<ng-content></ng-content>'}) export class NeedsContentComponent { // children with #content local variable @ContentChildren('content') children: any; } ///////// MyIfChildComp //////// @Component({ selector: 'my-if-child-1', template: ` <h4>MyIfChildComp</h4> <div> <label>Child value: <input [(ngModel)]="childValue"> </label> </div> <p><i>Change log:</i></p> <div *ngFor="let log of changeLog; let i=index">{{i + 1}} - {{log}}</div>` }) export class MyIfChildComponent implements OnInit, OnChanges, OnDestroy { @Input() value = ''; @Output() valueChange = new EventEmitter<string>(); get childValue() { return this.value; } set childValue(v: string) { if (this.value === v) { return; } this.value = v; this.valueChange.emit(v); } changeLog: string[] = []; ngOnInitCalled = false; ngOnChangesCounter = 0; ngOnDestroyCalled = false; ngOnInit() { this.ngOnInitCalled = true; this.changeLog.push('ngOnInit called'); } ngOnDestroy() { this.ngOnDestroyCalled = true; this.changeLog.push('ngOnDestroy called'); } ngOnChanges(changes: {[propertyName: string]: SimpleChange}) { for (let propName in changes) { this.ngOnChangesCounter += 1; let prop = changes[propName]; let cur = JSON.stringify(prop.currentValue); let prev = JSON.stringify(prop.previousValue); this.changeLog.push(`${propName}: currentValue = ${cur}, previousValue = ${prev}`); } } } ///////// MyIfParentComp //////// @Component({ selector: 'my-if-parent-comp', template: ` <h3>MyIfParentComp</h3> <label>Parent value: <input [(ngModel)]="parentValue"> </label> <button (click)="clicked()">{{toggleLabel}} Child</button><br> <div *ngIf="showChild" style="margin: 4px; padding: 4px; background-color: aliceblue;"> <my-if-child-1 [(value)]="parentValue"></my-if-child-1> </div> ` }) export class MyIfParentComponent implements OnInit { ngOnInitCalled = false; parentValue = 'Hello, World'; showChild = false; toggleLabel = 'Unknown'; ngOnInit() { this.ngOnInitCalled = true; this.clicked(); } clicked() { this.showChild = !this.showChild; this.toggleLabel = this.showChild ? 'Close' : 'Show'; } } @Component({ selector: 'reverse-pipe-comp', template: ` <input [(ngModel)]="text"> <span>{{text | reverse}}</span> ` }) export class ReversePipeComponent { text = 'my dog has fleas.'; } @Component({template: '<div>Replace Me</div>'}) export class ShellComponent { } @Component({ selector: 'bag-comp', template: ` <h1>Specs Bag</h1> <my-if-parent-comp></my-if-parent-comp> <hr> <h3>Input/Output Component</h3> <io-parent-comp></io-parent-comp> <hr> <h3>External Template Component</h3> <external-template-comp></external-template-comp> <hr> <h3>Component With External Template Component</h3> <comp-w-ext-comp></comp-w-ext-comp> <hr> <h3>Reverse Pipe</h3> <reverse-pipe-comp></reverse-pipe-comp> <hr> <h3>InputValueBinder Directive</h3> <input-value-comp></input-value-comp> <hr> <h3>Button Component</h3> <button-comp></button-comp> <hr> <h3>Needs Content</h3> <needs-content #nc> <child-1 #content text="My"></child-1> <child-2 #content text="dog"></child-2> <child-2 text="has"></child-2> <child-3 #content text="fleas"></child-3> <div #content>!</div> </needs-content> ` }) export class BagComponent { } //////// Aggregations //////////// export const bagDeclarations = [ BagComponent, BankAccountComponent, BankAccountParentComponent, ButtonComponent, Child1Component, Child2Component, Child3Component, ExternalTemplateComponent, InnerCompWithExternalTemplateComponent, InputComponent, InputValueBinderDirective, InputValueBinderComponent, IoComponent, IoParentComponent, MyIfComponent, MyIfChildComponent, MyIfParentComponent, NeedsContentComponent, ParentComponent, TestProvidersComponent, TestViewProvidersComponent, ReversePipe, ReversePipeComponent, ShellComponent ]; export const bagProviders = [DependentService, FancyService]; //////////////////// //////////// import { NgModule } from '@angular/core'; import { BrowserModule } from '@angular/platform-browser'; import { FormsModule } from '@angular/forms'; @NgModule({ imports: [BrowserModule, FormsModule], declarations: bagDeclarations, providers: bagProviders, entryComponents: [BagComponent], bootstrap: [BagComponent] }) export class BagModule { }
# Introduction to gRPC gRPC는 원경의 Client가 Server 단의 함수를 로컬 함수를 호출하듯 부를 수 있게 해준다. 이때 메시지를 보내고 받는데는 protocol buffers를 사용하고 HTTP/2 기반의 Streaming을 지원하며 REST 대비 빠른 성능을 지원한다. gRPC의 특징 중 하나는 Java, Ruby, Node, Python, Go등 과 같은 프로그래밍 언어를 지원하고 MSA (마이크로 서비스 아키텍쳐)와 조합이 매력적이다. <!--more--> ## Google protocol buffers 구글에서 개발하고 오픈소스로 공개한 직렬화 데이터 구조이다. 다양한 언어를 지원하고 직렬화 속도가 빠르고 파일의 크기가 작다고 한다. ### 사용하기 protocol buffers는 proto file이라는 형태로 정의하는데, protocol buffers는 한가지 언어가 아닌 다양한 언어를 지원하기 때문에 특정언어에 종속성이 없는 형태로 데이터 타입을 정의하는데 이 파일이 proto file이다. proto file을 컴파일 하면 각 언어에 맞게 클래스 파일을 생성해준다. 예시는 밑의 예제에서 살펴보자. ## 설치 1. golang 1.6 이상 2. install gRPC ~~~bash $ go get -u google.golang.org/grpc ~~~ 3. install Protocol Buffers v3 4. install protoc plugin for go ~~~bash $ go get -u github.com/golang/protobuf/protoc-gen-go ~~~ ~~~bash $ export PATH=$PATH:$GOPATH/bin ~~~ ## Smaple ### 참고 사이트 * https://grpc.io/docs/quickstart/go/ * https://jusths.tistory.com/127 ### sample code * https://github.com/jaejin1/gRPC/tree/master/go ### proto file #### hi.proto ~~~proto syntax = "proto3"; package higrpc; service Hi { rpc SayHi (HiRequest) returns (HiReply) {} rpc CountHi (HiRequest) returns (HiReply) {} rpc JaejinHi (HiRequest) returns (HiReply) {} } message HiRequest { string name = 1; } message HiReply { string message = 1; } ~~~ #### compile hi.proto ~~~bash $ protoc hi.proto --go_out=plugins=grpc:. ~~~ compile을 하게 되면 hi.pb.go 파일이 생성될 것이다. 이 파일을 server, client 에서 import 시킨다. ### Server ~~~go package main import ( "context" "log" "net" "strconv" pb "github.com/jaejin1/grpc/pb" "google.golang.org/grpc" ) const ( port = ":50051" ) type server struct{} func (s *server) SayHi(ctx context.Context, in *pb.HiRequest) (*pb.HiReply, error) { log.Printf("Received: %v", in.Name) replyMsg := "Hi " + in.Name log.Printf("Send back to client: %s", replyMsg) return &pb.HiReply{Message: replyMsg}, nil } func (s *server) CountHi(ctx context.Context, in *pb.HiRequest) (*pb.HiReply, error) { log.Printf("Received: %v, length: %d", in.Name, len(in.Name)) replyMsg := "Count " + in.Name + " length: " + strconv.Itoa(len(in.Name)) log.Printf("Send back to client: %s", replyMsg) return &pb.HiReply{Message: replyMsg}, nil } func (s *server) JaejinHi(ctx context.Context, in *pb.HiRequest) (*pb.HiReply, error) { log.Printf("Received: Hi jaejin %v", in.Name) replyMsg := "Hi jaejin test" log.Printf("Send back to client: %s", replyMsg) return &pb.HiReply{Message: replyMsg}, nil } func main() { log.Printf("grpc server start at port %s", port) l, err := net.Listen("tcp", port) if err != nil { log.Fatalf("failed to listen: %v", err) } s := grpc.NewServer() pb.RegisterHiServer(s, &server{}) if err := s.Serve(l); err != nil { log.Fatalf("fail to serve: %v", err) } } ~~~ ### client ~~~go package main import ( "context" "flag" "log" "time" pb "github.com/jaejin1/grpc/pb" "google.golang.org/grpc" ) const ( serverAddr = "localhost:50051" defaultName = "world" ) func main() { conn, err := grpc.Dial(serverAddr, grpc.WithInsecure()) if err != nil { log.Fatalf("did not connect: %v", err) } defer conn.Close() c := pb.NewHiClient(conn) name := defaultName flag.Parse() if flag.NArg() > 0 { name = flag.Arg(0) } ctx, cancel := context.WithTimeout(context.Background(), time.Second) defer cancel() r, err := c.SayHi(ctx, &pb.HiRequest{Name: name}) if err != nil { log.Fatalf("could not greet: %v", err) } log.Printf("Greeting from the Server: %s", r.Message) r, err = c.CountHi(ctx, &pb.HiRequest{Name: name}) if err != nil { log.Fatalf("could not count: %v", err) } log.Printf("Count from the Server: %s", r.Message) r, err = c.JaejinHi(ctx, &pb.HiRequest{Name: name}) if err != nil { log.Fatalf("Error !!: %v", err) } log.Printf("Hi jaejin: %s", r.Message) } ~~~ ## Test ### server 실행 ~~~bash $ go run server/main.go 2019/09/08 15:06:17 grpc server start at port :50051 ~~~ ### client 실행 ~~~bash $ go run client/main.go 2019/09/08 15:06:44 Greeting from the Server: Hi world 2019/09/08 15:06:44 Count from the Server: Count world length: 5 2019/09/08 15:06:44 Hi jaejin: Hi jaejin test ~~~ ### server 확인 ~~~bash $ go run server/main.go 2019/09/08 15:06:17 grpc server start at port :50051 2019/09/08 15:06:44 Received: world 2019/09/08 15:06:44 Send back to client: Hi world 2019/09/08 15:06:44 Received: world, length: 5 2019/09/08 15:06:44 Send back to client: Count world length: 5 2019/09/08 15:06:44 Received: Hi jaejin world 2019/09/08 15:06:44 Send back to client: Hi jaejin test ~~~ 다음은 gRPC를 가지고 MSA 특성을 살려보기 위해 go server를 띄워놓고 python client로 접속을 해보려고 한다.
/** * (C) Copyright IBM Corp. 2010, 2015 * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *  */ package com.ibm.bi.dml.runtime.controlprogram; import java.util.ArrayList; import java.util.HashMap; import java.util.Map.Entry; import com.ibm.bi.dml.parser.DMLProgram; import com.ibm.bi.dml.runtime.DMLRuntimeException; import com.ibm.bi.dml.runtime.DMLScriptException; import com.ibm.bi.dml.runtime.DMLUnsupportedOperationException; import com.ibm.bi.dml.runtime.controlprogram.context.ExecutionContext; public class Program { public static final String KEY_DELIM = "::"; public ArrayList<ProgramBlock> _programBlocks; private HashMap<String, HashMap<String,FunctionProgramBlock>> _namespaceFunctions; public Program() throws DMLRuntimeException { _namespaceFunctions = new HashMap<String, HashMap<String,FunctionProgramBlock>>(); _programBlocks = new ArrayList<ProgramBlock>(); } /** * * @param namespace * @param fname * @param fpb */ public synchronized void addFunctionProgramBlock(String namespace, String fname, FunctionProgramBlock fpb) { if (namespace == null) namespace = DMLProgram.DEFAULT_NAMESPACE; HashMap<String,FunctionProgramBlock> namespaceBlocks = null; namespaceBlocks = _namespaceFunctions.get(namespace); if (namespaceBlocks == null){ namespaceBlocks = new HashMap<String,FunctionProgramBlock>(); _namespaceFunctions.put(namespace,namespaceBlocks); } namespaceBlocks.put(fname,fpb); } /** * * @param namespace * @param fname */ public synchronized void removeFunctionProgramBlock(String namespace, String fname) { if (namespace == null) namespace = DMLProgram.DEFAULT_NAMESPACE; HashMap<String,FunctionProgramBlock> namespaceBlocks = null; if( _namespaceFunctions.containsKey(namespace) ){ namespaceBlocks = _namespaceFunctions.get(namespace); if( namespaceBlocks.containsKey(fname) ) namespaceBlocks.remove(fname); } } /** * * @return */ public synchronized HashMap<String,FunctionProgramBlock> getFunctionProgramBlocks(){ HashMap<String,FunctionProgramBlock> retVal = new HashMap<String,FunctionProgramBlock>(); //create copy of function program blocks for (String namespace : _namespaceFunctions.keySet()){ HashMap<String,FunctionProgramBlock> namespaceFSB = _namespaceFunctions.get(namespace); for( Entry<String, FunctionProgramBlock> e: namespaceFSB.entrySet() ){ String fname = e.getKey(); FunctionProgramBlock fpb = e.getValue(); String fKey = DMLProgram.constructFunctionKey(namespace, fname); retVal.put(fKey, fpb); } } return retVal; } /** * * @param namespace * @param fname * @return * @throws DMLRuntimeException */ public synchronized FunctionProgramBlock getFunctionProgramBlock(String namespace, String fname) throws DMLRuntimeException{ if (namespace == null) namespace = DMLProgram.DEFAULT_NAMESPACE; HashMap<String,FunctionProgramBlock> namespaceFunctBlocks = _namespaceFunctions.get(namespace); if (namespaceFunctBlocks == null) throw new DMLRuntimeException("namespace " + namespace + " is undefined"); FunctionProgramBlock retVal = namespaceFunctBlocks.get(fname); if (retVal == null) throw new DMLRuntimeException("function " + fname + " is undefined in namespace " + namespace); return retVal; } public void addProgramBlock(ProgramBlock pb) { _programBlocks.add(pb); } public ArrayList<ProgramBlock> getProgramBlocks() { return _programBlocks; } public void execute(ExecutionContext ec) throws DMLRuntimeException, DMLUnsupportedOperationException { ec.initDebugProgramCounters(); try { for (int i=0 ; i<_programBlocks.size() ; i++) { ec.updateDebugState(i); _programBlocks.get(i).execute(ec); } } catch(DMLScriptException e) { throw e; } catch(Exception e) { throw new DMLRuntimeException(e); } ec.clearDebugProgramCounters(); } public void printMe() { for (ProgramBlock pb : this._programBlocks) { pb.printMe(); } } }
System.register(['angular2/core', 'angular2/http', 'angular2/common', 'angular2/router', '../../shared/components/control-messages.component', '../../shared/services/validationService', '../../posts/postService'], function(exports_1, context_1) { "use strict"; var __moduleName = context_1 && context_1.id; var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) { var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d; if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc); else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r; return c > 3 && r && Object.defineProperty(target, key, r), r; }; var __metadata = (this && this.__metadata) || function (k, v) { if (typeof Reflect === "object" && typeof Reflect.metadata === "function") return Reflect.metadata(k, v); }; var core_1, http_1, common_1, router_1, control_messages_component_1, validationService_1, postService_1; var CreatePostComponent; return { setters:[ function (core_1_1) { core_1 = core_1_1; }, function (http_1_1) { http_1 = http_1_1; }, function (common_1_1) { common_1 = common_1_1; }, function (router_1_1) { router_1 = router_1_1; }, function (control_messages_component_1_1) { control_messages_component_1 = control_messages_component_1_1; }, function (validationService_1_1) { validationService_1 = validationService_1_1; }, function (postService_1_1) { postService_1 = postService_1_1; }], execute: function() { CreatePostComponent = (function () { function CreatePostComponent(fb, _http, _postService, _router) { this.fb = fb; this._http = _http; this._postService = _postService; this._router = _router; this.postFormProcess = false; this.postForm = this.fb.group({ 'title': ['dumytitile', common_1.Validators.compose([common_1.Validators.required])], 'price': ['20', common_1.Validators.compose([common_1.Validators.required])], 'category': ['mobile', common_1.Validators.compose([common_1.Validators.required])], 'description': ['Checkout this description', common_1.Validators.compose([common_1.Validators.required])], 'name': ['mynmae', common_1.Validators.compose([common_1.Validators.required])], 'phone': ['03343853136', common_1.Validators.compose([common_1.Validators.required])], 'images': [''], 'state': ['sindh', common_1.Validators.compose([common_1.Validators.required])], 'city': ['karachi', common_1.Validators.compose([common_1.Validators.required])] }); } CreatePostComponent.prototype.createPost = function (postForm) { var _this = this; this.upload(function (images) { var postData = { title: postForm.title, price: postForm.price, category: postForm.category, description: postForm.description, name: postForm.name, phone: postForm.phone, images: images, state: postForm.state, city: postForm.city }; _this.postFormProcess = true; //JSON.stringify(postData) _this._postService.createPost(postData) .subscribe(function (data) { return _this.postingResponse = JSON.stringify(data); }, function (error) { return console.log(error); }, function () { _this.postFormProcess = false; console.log(_this.postingResponse); _this._router.navigate(['Posts']); }); }); }; CreatePostComponent.prototype.upload = function (cb) { this.makeFileRequest("http://localhost:3000/post/upload", [], this.filesToUpload) .then(function (result) { var img = []; Object.keys(result).forEach(function (key) { var res = result[key].path.split("client"); img.push({ path: res[1] }); //console.debug("Input File name: " + result[key].name + " type:" + result[key].size + " size:" + result[key].size); }); cb(img); }, function (error) { console.debug(error); }); }; CreatePostComponent.prototype.fileChangeEvent = function (fileInput) { this.filesToUpload = fileInput.target.files; }; CreatePostComponent.prototype.makeFileRequest = function (url, params, files) { return new Promise(function (resolve, reject) { var formData = new FormData(); var xhr = new XMLHttpRequest(); for (var i = 0; i < files.length; i++) { formData.append("uploads", files[i], files[i].name); } xhr.onreadystatechange = function () { if (xhr.readyState == 4) { if (xhr.status == 200) { resolve(JSON.parse(xhr.response)); } else { reject(xhr.response); } } }; xhr.open("POST", url, true); xhr.send(formData); }); }; CreatePostComponent = __decorate([ core_1.Component({ templateUrl: 'app/posts/templates/create.html', directives: [common_1.FORM_DIRECTIVES, control_messages_component_1.ControlMessages], providers: [postService_1.PostService, validationService_1.ValidationService] }), __metadata('design:paramtypes', [common_1.FormBuilder, http_1.Http, postService_1.PostService, router_1.Router]) ], CreatePostComponent); return CreatePostComponent; }()); exports_1("CreatePostComponent", CreatePostComponent); } } });
/* * Copyright 2016 Red Hat, Inc. and/or its affiliates. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ package org.kie.workbench.common.stunner.client.widgets.palette.factory; import org.kie.workbench.common.stunner.client.widgets.palette.BS3PaletteWidget; import org.kie.workbench.common.stunner.client.widgets.palette.PaletteWidgetFactory; import org.kie.workbench.common.stunner.core.client.components.palette.model.PaletteDefinition; public interface BS3PaletteFactory extends PaletteWidgetFactory<PaletteDefinition, BS3PaletteWidget<PaletteDefinition>> { }