text:
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
  "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">

    <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />

      <link rel="stylesheet" href="css/full_list.css" type="text/css" media="screen" charset="utf-8" />

      <link rel="stylesheet" href="css/common.css" type="text/css" media="screen" charset="utf-8" />

    <title>Method List</title>
    <base id="base_target" target="_parent" />

Method List

            Classes

            Methods

            Files

Search: <input type="text" />

    #apikeys
    PrintNode::Client

    #child_account_by_creator_ref
    PrintNode::Client

    #child_account_by_email
    PrintNode::Client

    #child_account_by_id
    PrintNode::Client

    #clientkeys
    PrintNode::Client

    #clients
    PrintNode::Client

    #computers
    PrintNode::Client

    #content
    PrintNode::PrintJob

    #content_type
    PrintNode::PrintJob

    #create_account
    PrintNode::Client

    #create_apikey
    PrintNode::Client

    #create_printjob
    PrintNode::Client

    #creator_ref
    PrintNode::Account

    #credentials
    PrintNode::Auth

    #delete
    PrintNode::Client

    #delete_account?
    PrintNode::Client

    #delete_apikey?
    PrintNode::Client

    #delete_tag?
    PrintNode::Client

    #email
    PrintNode::Account

    #escape_with_types
    PrintNode::Client

    #firstname
    PrintNode::Account

    #get
    PrintNode::Client

    #headers
    PrintNode::Client

    #http_error_handler
    PrintNode::Client

    #initialize
    PrintNode::PrintJob

    #initialize
    PrintNode::Client

    #initialize
    PrintNode::Account

    #initialize
    PrintNode::Auth

    #initialize
    PrintNode::APIError

    #lastname
    PrintNode::Account

    #latest_client
    PrintNode::Client

    #modify_account
    PrintNode::Client

    #modify_client_downloads
    PrintNode::Client

    #object
    PrintNode::APIError

    #parse_array_to_struct
    PrintNode::Client

    #parse_hash_to_struct
    PrintNode::Client

    #password
    PrintNode::Account

    #patch
    PrintNode::Client

    #post
    PrintNode::Client

    #printer_id
    PrintNode::PrintJob

    #printers
    PrintNode::Client

    #printjobs
    PrintNode::Client

    #scales
    PrintNode::Client

    #set_tag
    PrintNode::Client

    #source
    PrintNode::PrintJob

    #start_response
    PrintNode::Client

    #states
    PrintNode::Client

    #tags
    PrintNode::Client

    #title
    PrintNode::PrintJob

    #to_hash
    PrintNode::PrintJob

    #to_hash
    PrintNode::Account

    #whoami
    PrintNode::Client


March is festival month in NZ with over 80 festivals around the country, in total there are over 300 festivals listed below. The list is updated as we find out about new festivals, and we check the links are current a month in advance. Feel free to contact us if you would like us to add a festival to the list. Enjoy celebrating Kiwi style throughout the year.
Childrens Day is celebrated on the 1st Sunday in March each year, visit www.childrensday.org.nz to find an event near you.
I don't know, and you've probably looked in the same places as I have - their website that says they'll be back in 2018 but there's no date, and their Facebook page which hasn't been posted on since December 2016. There is an email address for them on Facebook so you could email to ask, otherwise if it's coming back I'm sure it will be well advertised as if it's going to be held over Auckland Anniversary Weekend again that's not far away.
Hi I'm just wanting to know when the Auckland Seafood Festival is going to be up and running again? Last year I read something that they would be back bigger and better in 2018 but can't see any advertising about it??
The festival has been added to the list for October.
Use the Contact Us tab above and send me details ie. website or Facebook link. Edited to add: Note that the list is for festivals rather than events.
I would like to post 2 events here. How about do i do this?


Lots of good voices, each with a different interpretation of the lines we wrote for them.
Art department did a lot of concepting for the Woven Logo today. We don't know if the final is somewhere in there yet, but it's promising.


text:
Update on work to repair A52 Clifton Bridge as Highways England reveals how it will be fixed
New video footage shows engineers working to install 'concrete blisters' and steel reinforcement cables
Joseph LockerDigital News Correspondent
Guarantee you'll never miss another big story by signing up for our free email updates
Highways England has revealed just how engineers will be repairing the condemned Clifton Bridge in the coming months.
Since February 6, engineers have been working to repair the bridge which holds up the busiest transport route in Nottingham, after a routine inspection found its structural integrity had degraded.
Repairs had been taking place on damaged concrete as early as 2018, but at the start of the year it was discovered the steel cables within the bridge had become seriously corroded.
Therefore, the eastbound bridge was closed, resulting in the city becoming the most congested in the world at one point.
Since then, only one lane has reopened, and work is not expected to be finished until at least the end of the year.
Now, Highways England has spoken of the exact repair schedule currently taking place on the 48-year-old structure.
An engineer wearing a protective suit as they use hydro-demolition to remove concrete (Image: Highways England)
'The project is sizeable, intensely complex and requires specialist work'
After the steel cables within the bridge - which pull the bridge together and take tension from loads - were found to be corroded, a repair plan had to be drawn up, Highways England says.
This included assessing the bridge first, using a technique called hydro-demolition to remove concrete with pressurised water jets to reveal the cables within.
After this, calculations and investigations took place off-site to find out the best route forward and the development of a repair plan.
Now, moving forward into the winter months, engineers will be adding new steel cables to the exterior of the bridge to strengthen the structure and allow for easier maintenance in the future.
A spokeswoman for Highways England said: "As part of this work we've installed scaffolds, which are temporary structures used to support a work crew and materials, to the spans of the bridge south of the river.
"We've installed the concrete blisters and deviators on the sides of the beams underneath the bridge. These blisters and deviators fix the steel cables to the bridge.
"Over the next few weeks we'll add the steel cables to the bridge south of the river."
This work means the reinforcement will consist of post-tensioning, and the aforementioned deviators will allow for the steel tendons to be attached to the bridge itself at intermediate points.
The steel tendons will pass through the deviators and will be secured in place by the concrete blisters at an anchor point.
The cables will take much of the tension and strain from the thousands of vehicles which pass over it every single day.
Any damaged concrete inside will be patched up to prevent further water ingress.
'We continue to carry out extensive testing and investigation both externally'
Amid the repair schedule, Highways England says it continues to conduct investigations.
The bridge itself consists of large concrete chambers, where engineers are working from within to make sure the structure is safe and identify any further issues.
An underbridge unit is also allowing for inspections of the underside of the bridge with ease, due to the fact the River Trent proves a large obstacle in the way of this.
A infographic showing where repair work is taking place on Clifton Bridge (Image: Highways England)
It is expected more lanes may open come November, and more overnight closures of Clifton Lane will come into force from October 5-18 and 24-hour closures on October 10-11.
The eastbound carriageway will also be closed from October 9-12.
Speaking of the project Highways England's Midlands regional director, Catherine Brookes, added: "Our work at Clifton Bridge will ensure it can be used for years to come.
"The project is sizeable, intensely complex and requires specialist work in a challenging environment.
"Our teams are working as hard as they can to get the job done as quickly and as safely as possible.
"We appreciate these roadworks are disruptive and thank everyone affected for their patience."
coronavirusCovid: The only official symptoms according to NHS, WHO, CDC and ZOEDifferent variants can obviously have different effects on the body
Strictly Come Dancing live tour: Nikita Kuzmin forced to pull out with Covid
Strictly Come DancingThe live tour got started on Thursday night in Birmingham, and was already missing a few key stars from the 2021 series
Twycross Zoo gives message to Nottingham ahead of new attraction opening
FamilyEach Discoverer will also be awarded an exclusive 'Keeper for the Day' experience within the new land
Man in court after reports of two men threatened with knife in city centre
Nottingham City CentreThe victims were unharmed

redpajama_set_name: RedPajamaCommonCrawl


text:
Am J Hum Genet. 2007 Sep;81(3):559-75. Epub 2007 Jul 25.
PLINK: a tool set for whole-genome association and population-based linkage analyses.
Purcell S1, Neale B, Todd-Brown K, Thomas L, Ferreira MA, Bender D, Maller J, Sklar P, de Bakker PI, Daly MJ, Sham PC.
Center for Human Genetic Research, Massachusetts General Hospital, Boston, MA 02114, USA. shaun@pngu.mgh.harvard.edu
Whole-genome association studies (WGAS) bring new computational, as well as analytic, challenges to researchers. Many existing genetic-analysis tools are not designed to handle such large data sets in a convenient manner and do not necessarily exploit the new opportunities that whole-genome data bring. To address these issues, we developed PLINK, an open-source C/C++ WGAS tool set. With PLINK, large data sets comprising hundreds of thousands of markers genotyped for thousands of individuals can be rapidly manipulated and analyzed in their entirety. As well as providing tools to make the basic analytic steps computationally efficient, PLINK also supports some novel approaches to whole-genome data that take advantage of whole-genome coverage. We introduce PLINK and describe the five main domains of function: data management, summary statistics, population stratification, association analysis, and identity-by-descent estimation. In particular, we focus on the estimation and use of identity-by-state and identity-by-descent information in the context of population-based whole-genome studies. This information can be used to detect and correct for population stratification and to identify extended chromosomal segments that are shared identical by descent between very distantly related individuals. Analysis of the patterns of segmental sharing has the potential to map disease loci that contain multiple rare variants in a population-based linkage analysis.
Figure A1.
Example transmissions and corresponding IBD states. For two haploid genomes, C1 and C2, the figure illustrates four (of many) possible patterns of transmission and the corresponding IBD states at two positions, U and V. The text describes how consideration of these possible scenarios leads to the specification of transition matrices for IBD state along the chromosome.
PLINK: A Tool Set for Whole-Genome Association and Population-Based Linkage Analyses
Am J Hum Genet. 2007 Sep;81(3):559-575.
MDS and classification of Asian HapMap individuals. MDS reveals in each panel two clear clusters that correspond to CHB (left) and JPT (right) HapMap populations. The figure's three panels differ only in the color scheme, which represents classification according to PPC thresholds of 0.01 (A), 0.001 (B), and 0.0001 (C).
Example segment shared IBD between two HapMap CEU offspring individuals and their parents. The main set of plots show the multipoint estimate of IBD sharing, P(Z=1), for a 25-Mb region of chromosome 9, for the pairs of individuals between two families (CEPH1375 and CEPH1341). The region was selected because the two offspring (NA10863 and NA06991) showed sharing in this region, shown in plot a. The three other segments shared between seemingly unrelated individuals are shown—that is, between the offspring in one family and a parent in the other family (two plots labeled b and c) and between those two parents (plot d). The lower-left diagram illustrates the region shared; this extended haplotype spans multiple haplotype blocks and recombination hotspots in the full phase II data. The lower-right diagram depicts the pattern of gene flow for this particular region—that is, a segment of the original common chromosome (dark rectangles) appears in the two families as shown.
Schema of integration of PLINK, gPLINK, and Haploview. PLINK is the main C/C++ WGAS analytic engine that can run either as a stand-alone tool (from the command line or via shell scripting) or in conjunction with gPLINK, a Java-based graphical user interface (GUI). gPLINK also offers a simple project management framework to track PLINK analyses and facilitates integration with Haploview. It is easy to configure these tools, such that the whole-genome data and PLINK analyses (i.e., the computationally expensive aspects of this process) can reside on a remote server, but all initiation and viewing of results is done locally—for example, on a user's laptop, connected to the whole-genome data via the Internet, by use of gPLINK's secure shell networking.
Genetic Linkage/genetics*
Genome, Human/genetics*
Population/genetics*
Software*
R03 MH73806-01A1/MH/NIMH NIH HHS/United States
U01 HG004171/HG/NHGRI NIH HHS/United States
EY-12562/EY/NEI NIH HHS/United States
R03 MH073806/MH/NIMH NIH HHS/United States
SciCrunch Registry: Resource: Registry - SciCrunch


Blogging or writing content on the net is a daily routine for blogger and in the process we've gained much resources & tips that would be a real helpful in jump start one's blogging career.
If you want to start writing on your own blog then you can always check out tons of materials we have had on blogging plus amazing list of cheatsheets & infographics you will not want to miss here.
Here the cheatsheets will guide and promote your content, understand how to work better with free blogging services such as Blogger, WordPress and even Tumblr and also have cheatsheets about HTML and CSS.
Just peep on all this !


Lenovo has released its new IdeaPad laptop line and it's is definitely a challenge against Microsoft and its Surface Laptop. Not only that, the Chinese company has also unveiled a new Legion laptop, which is an addition to Lenovo's list of gaming devices, and another one for the people who are always on the go.
The latest Lenovo line-up consists of a trio of fresh IdeaPads, i.e., 320, 320S and the 720S. These laptops are mainly focused on the education market just like the case was with Microsoft Surface Laptop.
The laptops are well suited for the trendy college goers with the unique designs and tempting colors - black, white, silver, red, blue and purple - that are likely to get the attention of students.
Also, this line-up of laptops from Lenovo is extremely affordable, which will also attract the young college students. While the 15-inch model costs only $439.99, the 17-inch one is worth $489.99. The higher-end variant of the 320 comes with a 7th-generation Intel Core i7 CPU, 16GB of RAM, and 2TB of HDD storage. The IdeaPad 320S sports an elegant slim design that is marked with the "S" in its name. It will come in 14-inch and 15.6-inch versions and will sell for $740 to $750, reported iTechPost.
The premium one of the lineup is the 720S, which is a 15.9mm thick laptop and utilizes an anonized aluminum casing. The model is powered by Intel Core i7 Kaby Lake processor and boasts a full HD display. It also has a Nvidia GeForce 940MX graphics chip and 16GB of built-in memory. IdeaPad 720S will cost $970, reported Tech Radar.
The Legion Y920 is essentially a gaming laptop that comes with a 17-inch full HD display and is powered by either Intel Core i7-7820HK or Core i7-7700HQ. The Y920 will also have a 16GB RAM, 512GB SSD, 1TB hard drive as well as 8GB of video memory and it will cost around $2,700. Apart from that, the Legion Y920 will also support virtual reality, said iTechPost.
Lenovo Flex 5, which is Lenovo's latest model for the people who are always traveling, has two variants - a 14-inch, and a 15.6-inch. It will feature a Core i7 Kaby Lake processor, 16GB DDR4 system memory, GeForce 940MC GPU, and will cost around $720 and $830.
Lenovo's IdeaPad and Legion laptops will be available for the consumers starting from June, while the Flex 5 will hit the market by the end of this month only.


Weekly Training: We meet for training every Thursday at 8am at Grace New Hope Church (1766 New Hope Rd). We sell chicken biscuits for $3.00 and transport the kids to school.
Weekly Club: We meet every Monday for Club at 8:15am in the Couch MS cafeteria. Donuts provided!


Implementation of a support vector machine in primal formulation which additionally stores support vectors.
For non-linear classification, sparse grid kernels are applied.
Adds a data point to the set of support vectors.
References sgpp::base::DataVector::add(), alpha, alphas, sgpp::base::DataVector::append(), sgpp::base::DataMatrix::appendRow(), bias, budget, sgpp::op_factory::createOperationMultipleEval(), sgpp::base::DataMatrix::getNrows(), sgpp::base::Grid::getSize(), sgpp::base::DataVector::mult(), norms, svs, useBias, w, and w2.
Scales the normal vector w.
References alphas, bias, sgpp::base::DataVector::getSize(), sgpp::base::DataVector::mult(), useBias, w, and w2.
Class prediction for a given data point and grid.
Raw prediction for a given data point and grid.
References bias, sgpp::op_factory::createOperationMultipleEval(), sgpp::base::DataVector::dotProduct(), sgpp::base::Grid::getSize(), sgpp::base::DataMatrix::setRow(), useBias, and w.
Referenced by add(), and multiply().
Referenced by add(), multiply(), and predictRaw().
Referenced by add(), and PrimalDualSVM().


text:
Thursday TV Ratings: Boom!, Under the Dome, Rookie Blue, Hannibal, Beauty and the Beast
Thursday, June 25, 2015 ratings — New episodes: Boom! Wayward Pines, Big Brother, Under the Dome, The Astronaut Wives Club, Mistresses, Rookie Blue, Beauty and the Beast, Dateline NBC, Aquarius, and Hannibal. Reruns: The Vampire Diaries.
Note: If you're not seeing the updated charts, please try reloading the page or go here.
These are the fast affiliate ratings. The percentages represent the change since the previous original episode. (Percentages aren't given for reruns or specials.) To see past ratings for a particular show, click the show's link. The show pages are updated with the daily final ratings when they become available. Those pages include season averages to date.
What were you watching last night? Original network programming, reruns, cable, or something else?
More about: Aquarius: ratings, Beauty and the Beast (2012): ratings, Big Brother: ratings, Boom!: ratings, Dateline NBC: ratings, Hannibal: ratings, Mistresses: ratings, Rookie Blue: ratings, The Astronaut Wives Club: ratings, Under the Dome: ratings, Wayward Pines: ratings
Thursday TV Ratings: Beauty and the Beast, Big Brother, BattleBots, Bones, NFL
Thursday TV Ratings: BattleBots, Big Brother, Aquarius, Beauty and the Beast, Bones
Thursday TV Ratings: Under the Dome, Beauty and the Beast, Boom!, Big Brother, NFL Football
Thursday TV Ratings: Rookie Blue, Under the Dome, Food Fighters, Mistresses, Big Brother
Thursday TV Ratings: Rookie Blue, Boom!, Food Fighters, Under the Dome, Beauty and the Beast
Thursday TV Ratings: Astronaut Wives Club, Food Fighters, Boom!, Under the Dome, Beauty and the Beast
Thursday TV Ratings: Rookie Blue, Boom!, Food Fighters, Under the Dome
Thursday TV Ratings: Mistresses, Under the Dome, Food Fighters, Beauty and the Beast
Thursday TV Ratings: Rookie Blue, Big Brother, Beauty and the Beast, Food Fighters, Boom!
Thursday TV Ratings: Wayward Pines, Beauty and the Beast, Rookie Blue, Big Brother, Food Fighters
Thursday TV Ratings: Dates, Wayward Pines, Hannibal, Under the Dome, Mistresses
Thursday TV Ratings: Food Fighters, Wayward Pines, Astronaut Wives Club, Under the Dome, Hannibal
Thursday TV Ratings: The Astronaut Wives Club, Mistresses, Beauty and the Beast, Hannibal
Thursday TV Ratings: Beauty and the Beast, Wayward Pines, Hannibal, NBA Finals
Monday Ratings: Beauty and the Beast, Under the Dome, Mistresses, 24
Monday Ratings: Under the Dome, Mistresses, Beauty and the Beast, MasterChef


text:
Q: why 'undefined ' comes in output , when i nest 2 console . logs using JavaScript? why undefined comes in output , when i nest 2 console . logs?
is there something that i am missing out.
why this unexpected behaiviour?
console.log(console.log("hello"))

O/P:
hello
undefined

A: The inner console.log statement will print 'Hello, world!' to the console, but it will return undefined. The outer console.log statement will then print undefined to the console.
Therefore, if you nest two console.log statements, the inner console.log will print to the console, but the outer console.log will print undefined to the console.

redpajama_set_name: RedPajamaStackExchange


text:
General Graduate School Policies and Procedures
Master's Policies and Procedures
Doctoral Policies and Procedures
GE Policies and Procedures
Holistic Admissions Resources for Programs
Specialization Policies and Procedures
Graduate Certificate Policies and Procedures
Concurrent Degree Policies and Procedures
Faculty/Staff/Departments Policies and Procedures
Master's Forms
Doctoral Forms
Programming Support
GE Forms
Concurrent Degree, Graduate Certificate, and Specialization Forms
Faculty/Staff/Departments Forms
General Duties and Responsibilities Statements (GDRS)
The collective bargaining agreement (CBA) requires that every graduate employee (GE) hiring unit maintain a general duties and responsibilities statement (GDRS) that outlines the GE hiring, appointment/reappointment, and evaluation procedures that are followed in each hiring unit.
GDRS documents are updated once a year. They are submitted each May to the Graduate School for review and approval.
Once approved, the GDRS is posted on the General Duties and Responsibilities Statement (GDRS) page. Departments wishing to post their GDRS on their own site, should link directly to the Graduate School's GDRS page and not post the document/PDF directly.
Creating and Maintaining Your GDRS
Current and Past GDRS
Become a Better Mentor
Learning how to be an effective mentor is a skill that anyone can obtain. Review some material from various graduate resources on how to be the best mentor.
Best Practices in Mentoring
In 2011, the Graduate School developed the Excellence Award for Directors of Graduate Studies and the Excellence Award for Graduate Coordinators as a way both to recognize the good work of the faculty and staff who lead and manage graduate programs, and to provide a venue for identifying and disseminating best practices that enhance the overall quality of graduate education at the University of Oregon. In 2012, we added a third award, Excellence Award for Outstanding Mentorship in Graduate Studies, to honor faculty and staff who provide the strong mentorship that is essential to strong graduate programs.
Excellence Award for Directors of Graduate Studies
Excellence Award for Graduate Coordinators
Excellence Award for Outstanding Mentorship in Graduate Studies
Training and Systems Access
The Graduate School offers a variety of trainings on topics including DuckDocs, GradWeb, payroll, admissions, and academic policies and procedures, as well as quarterly Graduate Coordinator Meetings.
Training and Access Information
Graduate Coordinator Meetings
Adding or Revising a Graduate Program
There are four potential stages of review for new or revised graduate programs—college level, university level, state level, and external review. The nature of the proposal will determine which stages of review are required.
Curriculum Changes
Graduate School Programming Support Request
The Graduate School is pleased to consider requests to support programming and events that benefit graduate students.
Requests received by week 4 of each term will be prioritized.
Submit Programming Support Request


text:
Racist Is a Tough Little Word
The definition has grown and shifted over time.
John McWhorter
Contributing writer at The Atlantic and professor at Columbia University
Carlos Barria / Reuters
"They dated." What does that mean? Date is one of the more ambiguous words in American English. It can refer to anything from two people going to a movie one time to two people having a years-long sexual relationship and everything in between. Its meaning is so multifarious as to challenge any attempt to tell a foreigner what it actually refers to.
Racist has become a similarly protean term. Many of us think its meaning is obvious, but it has evolved quite a bit from its original signification over the past several decades. That's why our punditocracy is engaged in a drawn-out battle to explain why President Donald Trump's latest animadversions against certain congresswomen of color are racist, against his and his pals' claims that they are not—and even why Democrats are entertaining an intraparty controversy over whether House Speaker Nancy Pelosi, of all progressive figures, is herself a racist.
When racist became common parlance, rapidly replacing prejudiced starting around 1970, it was understood mainly in its dictionary-style definition: "Prejudice, discrimination, or antagonism directed against someone of a different race based on the belief that one's own race is superior." What sat in the memory is "It's wrong to think people are inferior because of something like their skin color, or to be mean to them because of that."
A Sermon in America's Civic Religion
David A. Graham
Boring Is Better
John Dickerson
To many, it would seem to fall transparently under this definition of racist when President Trump, irritated with the leftist critiques of America from four Democratic congresswomen of color, suggests that they return to their native countries. Three, for the record, were born in the United States, and the other is a longtime citizen. Many of us hear this attack as saying that the four embody a fundamental otherness, and their true membership as "one of us" is fragile and even cancelable. But Republicans have taken umbrage at being called racist for supporting such rhetoric.
Peter Beinart: By Republican standards, almost nothing is racist
One response is that these Republicans are more offended at being called racist than at being racist. But this is oversimplified in view of how the word racist has come to figure in our language—Republican Trump supporters' state of mind is, in its way, more layered than that. They are operating upon the unusual complexities that the word racist has accreted, in a way that allows them to at least pretend they are not racist, and possibly genuinely believe that they are not.
Make no mistake—all evidence, listed elsewhere too exhaustively to bear my repeating it here, confirms that the president is a bigot. The question is whether Trump in his recent statements is expressing that bigotry as baldly as many suppose. People claiming that Trump said nothing racist may not be exactly the sharpest knives in the drawer on questions of sociology, and Trump himself is, on that score, a plastic spoon. But the realities of the word racist lend Trump and people like him two strategic, and maybe even cognitive, outs.
One is that racist carries baggage beyond its dictionary meaning. To be a racist is considered not just a matter of bland categorization but of evil, a charge only somewhat less damning than being called a pedophile, as chilling a prospect in modern American life as being tarred as a communist was in the late 1940s and early 1950s.
As such, Trump's refusal to apologize simply because so many of his supporters agree with him, callow as it seems, has a certain coherence. If the power of the word racist is as much in its moral sanction as in its definition, then if a critical mass of people sees no moral sanction in one's statements, then one may conclude one is not being a racist at all.
Surely, though, what is moral is not that which is popular. According to that logic, slavery was correct in the days of yore because few questioned it. Can't Trump see that to tell people of color to "go home" is a manifestation of exactly the disparagement of people on the basis of race that the definition entails?
However, here we run into a problem larger than Trump and his pals—that racist has morphed to refer to animus beyond the conscious and deliberate. A great deal of the race debate since the 1960s has revolved around a quest to teach Mr. and Mrs. America that racism can be covert, and can be as harmful as the old-school kind. The black criminal, lent less empathy and sympathy by whites, gets a longer sentence than a white one does for the same crime. The black couple, less familiar and seemingly less trustworthy to a nonblack dealer, gets a lesser car loan than a white couple with the same income and credit record.
Norm Ornstein: The squad and the speaker
Along those lines, Trump's call for the "Squad" to "go home" reveals itself as subconsciously racialized—there is all reason to suspect he would say no such thing to a Squad composed of people of recent Danish or German ancestry. There is no evidence of Trump "othering" whites the way he does everyone else, even suggesting that Colin Kaepernick consider leaving the country. However, there exists no such Scandi-Squad, or professional sports team composed of white men refusing to stand for the national anthem, etc., whom Trump has let pass—which allows Trump and his supporters to insist that the matter is simply the Squad's supposed lack of patriotism, and that to bring race into it is merely "playing the race card."
Many of us are familiar with racism as a matter of bias as well as outright contempt. Trump, however, is taking advantage of the fact that this message has proved, for 50 years, distinctly difficult to make the general public fully understand.
We can't get into Trump's head here. He may be feigning numbness to the nuances of racist as a power ploy. Or he may genuinely not perceive the racism in his current rhetoric. I suspect he may not, for the simple reason that to imagine how he would feel about a straight-talking Finn in Congress would require a thought experiment, and nothing the man has ever said or done suggests the remotest inclination or ability to process layers, hypotheticals, or subtlety. A man clueless enough to accidentally give away to a national television reporter that he fired James Comey to detract from the investigation of his ties to Russia doesn't do intersectionality.
Many will object that the mere utterance "Go back where you came from" has a traditional status as a racist statement, and that thus Trump "must" know the implications of what he's saying. But Trump may well have heard people told to go back where they came from all his life without thinking it was racist at all, and that they in fact deserved it, without a thought that he wouldn't approve of such a thing said to an Irish or German person. None will disagree that such naïveté is possible—for what reason would we assume that Trump would not exhibit it here?
John McWhorter: The origins of the 'acting white' charge
Racist is a word of our times, indicative that social history does include intellectual progress. It has evolved into a word that asks of us a degree of psychological, anthropological, and sociohistorical sophistication. The absence of such sophistication is Trump's very essence, and his comprehension of the term racist will thus ever be reluctant, flickering, and dim. Hence his standing in joyous reception of his fans shouting to send Representative Ilhan Omar home.
Democrats have run aground on another aspect of how words tend to evolve—from objective to subjective, from "That is a house" to "This is how I feel about the house." Take hopefully: It used to only mean "with hope," as in someone descending a staircase with the hope that the prince would fit the slipper onto her foot. But now we more commonly say "Hopefully, he will find his way," not as in "He will find his way in hopeful spirit" but "I hope he will find his way."
Racist has followed that path. Today, racist means not only burning a cross on someone's lawn or even telling someone to go home, but also what feels unpleasant to someone of a race—as in what I as a person of that race don't like. It has gone from being mean to someone to, also, what feels mean to me.
The two may seem the same, but it gets tricky. A white woman admires a black woman's locks and asks her how she washes them; the black woman gets tired of answering such questions and feels they are intrusive, harmful. Many would instinctively extend the term racist to this interaction, despite the fact that the white woman sincerely admired the black woman's hair and feels odd being called a racist.
Or here's another, more extreme example: Recently, Representative Alexandria Ocasio-Cortez called out Pelosi for her criticisms of the Squad as unduly demanding in their political positions. Ocasio-Cortez appended that Pelosi's critique is of people "of color," which is code for Pelosi being, here, racist on some level, although I presume Ocasio-Cortez thinks the racism is unintended or subconscious.
But let's unpack the idea here that it's inappropriate—perhaps racist in a sense—for Pelosi to single out the Squad. Do we think that if the Squad were, again, four white ladies of Scandinavian heritage with the same social-media presence that Pelosi would stay mum? Here, I suggest not—Pelosi is about party unity, not colorism.
Conor Friedersdorf: 'Send her back': The bigoted rallying cry of Trump 2020
So Ocasio-Cortez gets in that the Squad is composed of women of color. But if Pelosi would likely respond the same way to four Jill Steins, then what is the meaning of the reference to race? Is the idea that Pelosi should hold her tongue simply because the Squad members aren't white? Ocasio-Cortez is here appealing to another 2.0 meaning of racist—that which is offensive, for any reason, to people of a race. The Squad doesn't like Pelosi's critique, understandably. But the question is: Is that critique "racist" because four "racial" women don't agree with it? Here, Ocasio-Cortez and the Squad allude to the subjectified meaning of racist, which can be hard to square with the core meaning of the word (believing that people of a category are inferior).
When the Squad members feel discriminated against for being told to go home, their feelings are rooted in being genuinely discriminated against, unless Trump would tell Tiger Woods's children, if they criticized his reign, to go "home" to their mother's native Sweden. But Ocasio-Cortez's coded charge against Pelosi is rooted in an idea that the racist must accept the charge simply because she has offended a person of a race. And that definition of racist goes beyond what many even many level-headed people will feel is appropriate.
Racist is a tough little word. Republicans hide behind pretending that it can mean only what it did 50 years ago, neglecting communal intellectual growth. But even Democrats can use it in a way that many will question. Just two weeks have taught us that dictionary definitions can help us little in real life.


Hannah has released the beast! Actually I don't think she knows what she has gotten herself into with giving me admin privileges for the blog. This is my first attempt at blogging and who knows it may be my last. Never mind that…let 's get this party started.
I don't know how it got started but while we were in Hong Kong I started taking Selfies. Somehow it turned into a running joke throughout our trip and as the days went by I found myself doing it more and more, even getting the family in on the action. I have found though that Clio is not too keen on taking selfies as you will see in the photos. Most of the pictures with Clio are either of the back of her head or she's sleeping. Eden however didn't seem to mind taking photos with me, it's probably due to her mom taking what seems a million photos a day. Ok I might be stretching that a bit but Han did take over a thousand photos in Hong Kong so you can see what I mean.
There is so much to see in Hong Kong and since Han is so organized we were able to see a lot of it. Those of you who know my wife know what I am talking about. One of my favorite days was the trip to Tai O and the giant Buddha. The village was so different to anything I had experienced before and I found it quite interesting. Any sea creature you could think of was dried and for sale. I have to admit though they don't look that appetizing. As you may have read in Han's blog about this place it had a distinct smell that Eden was quite loudly announcing she thought smelled gross. I found it hard to tell her that it wasn't polite to say those things so loudly when I agreed. I wonder when kids learn to filter their thoughts and not say everything that comes to mind, because when they don't filter their thoughts it can make for some awkward moments and we have had our fair share of those.
This was also my first day of selfies. I am not sure if you all know this but it can be quite a challenge to get the right angle to fit yourself and whatever object that is behind you in the shot. You can end up cutting a lot of faces off in photos or totally missing what your actually trying to capture. It's pretty much an art which I didn't quite master the first day. However while on our travels I got to see a lot of people who seem to have mastered the selfie. They would attach their phone to a long collapsable pole so that they could get that perfect angle for the selfie. I have yet to find that perfect angle where my hair looks good and I don't look like I ate one of my children.
As you can see I have attached some of my finer selfies but there is so much room for growth. I did however always remember to wear my new Ray Bun sunglasses, nope that wasn't a typo. Those beauties were bought at the Temple Street Night Market for a whole ten dollars. I really had no interest in buying them but I was haggling the man running the booth just for the sake of haggling and I actually got the price down more then half of what he was asking and given this boost to my ego I decided to buy them. As I walked away from the booth feeling very confident in my new purchase I caught up with Han. She wasn't as impressed as I was with my new shades.
Oh that was funny! I bet Mrs. Schuleman (or whatever her name was from high school) would be impressed with your personal essay. Thanks for the laugh. Hannah, thanks for giving him a shot at exposing his true self(ie). Too funny!
Who is buying for Matt for Christmas again? hopefully they read this and thats their first Christmas idea…a selfie stick!
RayBan sunglasses are the best and at China price even more!!! Haha what a fun post 😉 and i love all of these family selfies!
I have a new favorite post! This is fabulous! I need to get Dane started on this!


A blood pressure reading of 201/126 indicates a Hypertensive Crisis.
What does a blood pressure reading of 201/126 mean?
A blood pressure reading of 201/126 is cause for concern. The first step is to take another reading to confirm your blood pressure.
A blood pressure reading of 201/126 coupled with symptoms such as headache, nausea, blurry vision, chest pain and shortness of breath point to a hypertensive emergency.
Once you have been assessed by a medical professional there are a number of ways you can address a blood pressure reading of 201/126 .


As we prepare to welcome the best shooters in the Commonwealth to our shores and my home state of Queensland next month, it was extremely disappointing to hear that our sport has been dropped from the 2022 Commonwealth Games in Birmingham. This will be the first time since 1970 that sport shooting will not be included in the program.
The decision, supposedly due to a lack of appropriate facilities near the host city, is a cop out. The Gold Coast Commonwealth Games will see shooting competitions take place elsewhere, at the Belmont Shooting Centre in Brisbane. Therefore, I implore SSAA members to sign an online petition, which has already notched up more than 52,000 signatures, to show our disappointment.
Fortunately, we have the opportunity to witness firsthand the skill and prowess of our Commonwealth shooters and local Australian talent when our Games commence on April 4. A number of SSAA members will represent our country in Fullbore, Pistol, Rifle and Shotgun disciplines, including James Willett and William Godward. I will be cheering on our competitors and wish them the best of luck.
Already underway in South Australia, and opening this month in Victoria and Tasmania, are the 2018 duck and quail hunting seasons. The SSAA, as always, has been involved in government discussions about the waterfowl seasons as part of our advocacy for ethical hunting activities.
It is important to note that regulations surrounding duck and quail hunting do differ slightly from year to year and state to state. While we have every confidence that our members will do the right thing, I encourage those who are sourcing fresh duck for the table to familiarise yourself with the details on this year's season.
In this issue, John McDougall has written a series of helpful articles about duck hunting, including what gear to pack, ammunition advice and also the all-important etiquette while out in the field.
While on the topic of hunting, it was pleasing to meet with the new Threatened Species Commissioner, Dr Sally Box, at our SSAA National office in Adelaide. We expressed our willingness to continue our productive work with the Environment Department and build upon the positive relationship formed with former Commissioner Gregory Andrews.
Dr Box acknowledged the role of the SSAA in protecting our native wildlife. She was impressed to learn of the great work our volunteers have done in the various national parks and for our nation's farmers through our SSAA Farmer Assist program.
Pleasingly, one of our members has been recognised for playing an important role in helping restore diminishing national parkland in South Australia to its former glory. Kaz Herbst, who has been on the frontline of conservation for more than 25 years, was awarded an Order of Australia Medal (OAM) in the 2018 Australia Day Honours List. It just goes to show that our efforts in conservation are making a real difference on the ground. That is something to be proud of.


text:
<Title>sparse_hash_map<Key, Data, HashFcn, EqualKey, Alloc></Title>

[Note: this document is formatted similarly to the SGI STL
implementation documentation pages, and refers to concepts and classes
defined there.  However, neither this document nor the code it
describes is associated with SGI, nor is it necessary to have SGI's
STL implementation installed in order to use this class.]

sparse_hash_map<Key, Data, HashFcn, EqualKey, Alloc>

<tt>sparse_hash_map</tt> is a Hashed
Associative Container that associates objects of type <tt>Key</tt>
with objects of type <tt>Data</tt>.  <tt>sparse_hash_map</tt> is a Pair
Associative Container, meaning that its value type is <tt>pair<const Key, Data></tt>.  It is also a
Unique
Associative Container, meaning that no two elements have keys that
compare equal using <tt>EqualKey</tt>.

Looking up an element in a <tt>sparse_hash_map</tt> by its key is
efficient, so <tt>sparse_hash_map</tt> is useful for "dictionaries"
where the order of elements is irrelevant.  If it is important for the
elements to be in a particular order, however, then <tt>map</tt> is more appropriate.

<tt>sparse_hash_map</tt> is distinguished from other hash-map
implementations by its stingy use of memory and by the ability to save
and restore contents to disk.  On the other hand, this hash-map
implementation, while still efficient, is slower than other hash-map
implementations, and it also has requirements -- for instance, for a
distinguished "deleted key" -- that may not be easy for all
applications to satisfy.

This class is appropriate for applications that need to store
large "dictionaries" in memory, or for applications that need these
dictionaries to be persistent.

Example

(Note: this example uses SGI semantics for hash<>
-- the kind used by gcc and most Unix compiler suites -- and not
Dinkumware semantics -- the kind used by Microsoft Visual Studio.  If
you are using MSVC, this example will not compile as-is: you'll need
to change hash to hash_compare, and you
won't use eqstr at all.  See the MSVC documentation for
hash_map and hash_compare, for more
details.)

#include <iostream>
#include <google/sparse_hash_map>

using google::sparse_hash_map;      // namespace where class lives by default
using std::cout;
using std::endl;
using ext::hash;  // or __gnu_cxx::hash, or maybe tr1::hash, depending on your OS

struct eqstr
{
  bool operator()(const char* s1, const char* s2) const
  {
    return (s1 == s2) || (s1 && s2 && strcmp(s1, s2) == 0);
  }
};

int main()
{
  sparse_hash_map<const char*, int, hash<const char*>, eqstr> months;

  months["january"] = 31;
  months["february"] = 28;
  months["march"] = 31;
  months["april"] = 30;
  months["may"] = 31;
  months["june"] = 30;
  months["july"] = 31;
  months["august"] = 31;
  months["september"] = 30;
  months["october"] = 31;
  months["november"] = 30;
  months["december"] = 31;

  cout << "september -> " << months["september"] << endl;
  cout << "april     -> " << months["april"] << endl;
  cout << "june      -> " << months["june"] << endl;
  cout << "november  -> " << months["november"] << endl;
}

Definition

Defined in the header sparse_hash_map.
This class is not part of the C++ standard, though it is mostly
compatible with the tr1 class unordered_map.

Template parameters

Parameter	Description	Default

   <tt>Key</tt>

   The hash_map's key type.  This is also defined as
   <tt>sparse_hash_map::key_type</tt>.

   <tt>Data</tt>

   The hash_map's data type.  This is also defined as
   <tt>sparse_hash_map::data_type</tt>.

   <tt>HashFcn</tt>

   The hash function used by the
   hash_map.  This is also defined as <tt>sparse_hash_map::hasher</tt>.

Note: Hashtable performance depends heavily on the choice of
   hash function.  See the performance
   page for more information.

   <tt>hash<Key></tt>

   <tt>EqualKey</tt>

   The hash_map key equality function: a binary predicate that determines
   whether two keys are equal.  This is also defined as
   <tt>sparse_hash_map::key_equal</tt>.

   <tt>equal_to<Key></tt>

   <tt>Alloc</tt>

   The STL allocator to use.  By default, uses the provided allocator
   libc_allocator_with_realloc, which likely gives better
   performance than other STL allocators due to its built-in support
   for realloc, which this container takes advantage of.
   If you use an allocator other than the default, note that this
   container imposes an additional requirement on the STL allocator
   type beyond those in [lib.allocator.requirements]: it does not
   support allocators that define alternate memory models.  That is,
   it assumes that pointer, const_pointer,
   size_type, and difference_type are just
   T*, const T*, size_t, and
   ptrdiff_t, respectively.  This is also defined as
   <tt>sparse_hash_map::allocator_type</tt>.

Model of

Unique Hashed Associative Container,
Pair Associative Container

Type requirements

<tt>Key</tt> is Assignable.

<tt>EqualKey</tt> is a Binary Predicate whose argument type is Key.

<tt>EqualKey</tt> is an equivalence relation.

<tt>Alloc</tt> is an Allocator.

Public base classes

None.

Members

Member	Where defined	Description

   <tt>key_type</tt>

    Associative
    Container

   The <tt>sparse_hash_map</tt>'s key type, <tt>Key</tt>.

   <tt>data_type</tt>

    Pair
    Associative Container

   The type of object associated with the keys.

   <tt>value_type</tt>

    Pair
    Associative Container

   The type of object, <tt>pair<const key_type, data_type></tt>,
   stored in the hash_map.

   <tt>hasher</tt>

    Hashed
    Associative Container

   The <tt>sparse_hash_map</tt>'s hash
   function.

   <tt>key_equal</tt>

    Hashed
    Associative Container

    Function
    object that compares keys for equality.

   <tt>allocator_type</tt>

    <tt>Unordered Associative Container</tt> (tr1)

   The type of the Allocator given as a template parameter.

   <tt>pointer</tt>

    Container

   Pointer to <tt>T</tt>.

   <tt>reference</tt>

    Container

   Reference to <tt>T</tt>

   <tt>const_reference</tt>

    Container

   Const reference to <tt>T</tt>

   <tt>size_type</tt>

    Container

   An unsigned integral type.

   <tt>difference_type</tt>

    Container

   A signed integral type.

   <tt>iterator</tt>

    Container

   Iterator used to iterate through a <tt>sparse_hash_map</tt>. [1]

   <tt>const_iterator</tt>

    Container

   Const iterator used to iterate through a <tt>sparse_hash_map</tt>.

   <tt>local_iterator</tt>

   <tt>Unordered Associative Container</tt> (tr1)

   Iterator used to iterate through a subset of
   <tt>sparse_hash_map</tt>. [1]

   <tt>const_local_iterator</tt>

   <tt>Unordered Associative Container</tt> (tr1)

   Const iterator used to iterate through a subset of
   <tt>sparse_hash_map</tt>.

   <tt>iterator begin()</tt>

    Container

   Returns an <tt>iterator</tt> pointing to the beginning of the
   <tt>sparse_hash_map</tt>.

   <tt>iterator end()</tt>

    Container

   Returns an <tt>iterator</tt> pointing to the end of the
   <tt>sparse_hash_map</tt>.

   <tt>const_iterator begin() const</tt>

    Container

   Returns an <tt>const_iterator</tt> pointing to the beginning of the
   <tt>sparse_hash_map</tt>.

   <tt>const_iterator end() const</tt>

    Container

   Returns an <tt>const_iterator</tt> pointing to the end of the
   <tt>sparse_hash_map</tt>.

   <tt>local_iterator begin(size_type i)</tt>

   <tt>Unordered Associative Container</tt> (tr1)

   Returns a <tt>local_iterator</tt> pointing to the beginning of bucket
   <tt>i</tt> in the <tt>sparse_hash_map</tt>.

   <tt>local_iterator end(size_type i)</tt>

   <tt>Unordered Associative Container</tt> (tr1)

   Returns a <tt>local_iterator</tt> pointing to the end of bucket
   <tt>i</tt> in the <tt>sparse_hash_map</tt>.  For
   <tt>sparse_hash_map</tt>, each bucket contains either 0 or 1 item.

   <tt>const_local_iterator begin(size_type i) const</tt>

   <tt>Unordered Associative Container</tt> (tr1)

   Returns a <tt>const_local_iterator</tt> pointing to the beginning of bucket
   <tt>i</tt> in the <tt>sparse_hash_map</tt>.

   <tt>const_local_iterator end(size_type i) const</tt>

   <tt>Unordered Associative Container</tt> (tr1)

   Returns a <tt>const_local_iterator</tt> pointing to the end of bucket
   <tt>i</tt> in the <tt>sparse_hash_map</tt>.  For
   <tt>sparse_hash_map</tt>, each bucket contains either 0 or 1 item.

   <tt>size_type size() const</tt>

    Container

   Returns the size of the <tt>sparse_hash_map</tt>.

   <tt>size_type max_size() const</tt>

    Container

   Returns the largest possible size of the <tt>sparse_hash_map</tt>.

   <tt>bool empty() const</tt>

    Container

   <tt>true</tt> if the <tt>sparse_hash_map</tt>'s size is <tt>0</tt>.

   <tt>size_type bucket_count() const</tt>

    Hashed
    Associative Container

   Returns the number of buckets used by the <tt>sparse_hash_map</tt>.

   <tt>size_type max_bucket_count() const</tt>

    Hashed
    Associative Container

   Returns the largest possible number of buckets used by the <tt>sparse_hash_map</tt>.

   <tt>size_type bucket_size(size_type i) const</tt>

   <tt>Unordered Associative Container</tt> (tr1)

   Returns the number of elements in bucket <tt>i</tt>.  For
   <tt>sparse_hash_map</tt>, this will be either 0 or 1.

   <tt>size_type bucket(const key_type& key) const</tt>

   <tt>Unordered Associative Container</tt> (tr1)

   If the key exists in the map, returns the index of the bucket
   containing the given key, otherwise, return the bucket the key
   would be inserted into.
   This value may be passed to <tt>begin(size_type)</tt> and
   <tt>end(size_type)</tt>.

   <tt>float load_factor() const</tt>

   <tt>Unordered Associative Container</tt> (tr1)

   The number of elements in the <tt>sparse_hash_map</tt> divided by
   the number of buckets.

   <tt>float max_load_factor() const</tt>

   <tt>Unordered Associative Container</tt> (tr1)

   The maximum load factor before increasing the number of buckets in
   the <tt>sparse_hash_map</tt>.

   <tt>void max_load_factor(float new_grow)</tt>

   <tt>Unordered Associative Container</tt> (tr1)

   Sets the maximum load factor before increasing the number of
   buckets in the <tt>sparse_hash_map</tt>.

   <tt>float min_load_factor() const</tt>

   <tt>sparse_hash_map</tt>

   The minimum load factor before decreasing the number of buckets in
   the <tt>sparse_hash_map</tt>.

   <tt>void min_load_factor(float new_grow)</tt>

   <tt>sparse_hash_map</tt>

   Sets the minimum load factor before decreasing the number of
   buckets in the <tt>sparse_hash_map</tt>.

   <tt>void set_resizing_parameters(float shrink, float grow)</tt>

   <tt>sparse_hash_map</tt>

   DEPRECATED.  See below.

   <tt>void resize(size_type n)</tt>

    Hashed
    Associative Container

   Increases the bucket count to hold at least <tt>n</tt> items.
   [4]  [5]

   <tt>void rehash(size_type n)</tt>

    <tt>Unordered Associative Container</tt> (tr1)

   Increases the bucket count to hold at least <tt>n</tt> items.
   This is identical to <tt>resize</tt>.
   [4]  [5]

   <tt>hasher hash_funct() const</tt>

    Hashed
    Associative Container

   Returns the <tt>hasher</tt> object used by the <tt>sparse_hash_map</tt>.

   <tt>hasher hash_function() const</tt>

   <tt>Unordered Associative Container</tt> (tr1)

   Returns the <tt>hasher</tt> object used by the <tt>sparse_hash_map</tt>.
   This is idential to <tt>hash_funct</tt>.

   <tt>key_equal key_eq() const</tt>

    Hashed
    Associative Container

   Returns the <tt>key_equal</tt> object used by the
   <tt>sparse_hash_map</tt>.

   <tt>allocator_type get_allocator() const</tt>

   <tt>Unordered Associative Container</tt> (tr1)

   Returns the <tt>allocator_type</tt> object used by the
   <tt>sparse_hash_map</tt>: either the one passed in to the
   constructor, or a default <tt>Alloc</tt> instance.

   <tt>sparse_hash_map()</tt>

    Container

   Creates an empty <tt>sparse_hash_map</tt>.

   <tt>sparse_hash_map(size_type n)</tt>

    Hashed
    Associative Container

   Creates an empty <tt>sparse_hash_map</tt> that's optimized for holding
   up to <tt>n</tt> items.
   [5]

   <tt>sparse_hash_map(size_type n, const hasher& h)</tt>

    Hashed
    Associative Container

   Creates an empty <tt>sparse_hash_map</tt> that's optimized for up
   to <tt>n</tt> items, using <tt>h</tt> as the hash function.

   <tt>sparse_hash_map(size_type n, const hasher& h, const
   key_equal& k)</tt>

    Hashed
    Associative Container

   Creates an empty <tt>sparse_hash_map</tt> that's optimized for up
   to <tt>n</tt> items, using <tt>h</tt> as the hash function and
   <tt>k</tt> as the key equal function.

   <tt>sparse_hash_map(size_type n, const hasher& h, const
   key_equal& k, const allocator_type& a)</tt>

   <tt>Unordered Associative Container</tt> (tr1)

   Creates an empty <tt>sparse_hash_map</tt> that's optimized for up
   to <tt>n</tt> items, using <tt>h</tt> as the hash function,
   <tt>k</tt> as the key equal function, and <tt>a</tt> as the
   allocator object.

template <class InputIterator>
sparse_hash_map(InputIterator f, InputIterator l)

[2]

    Unique
    Hashed Associative Container

   Creates a sparse_hash_map with a copy of a range.

template <class InputIterator>
sparse_hash_map(InputIterator f, InputIterator l, size_type n)

[2]

    Unique
    Hashed Associative Container

   Creates a hash_map with a copy of a range that's optimized to
   hold up to <tt>n</tt> items.

template <class InputIterator>
sparse_hash_map(InputIterator f, InputIterator l, size_type n, const
hasher& h)
 [2]

    Unique
    Hashed Associative Container

   Creates a hash_map with a copy of a range that's optimized to hold
   up to <tt>n</tt> items, using <tt>h</tt> as the hash function.

template <class InputIterator>
sparse_hash_map(InputIterator f, InputIterator l, size_type n, const
hasher& h, const key_equal& k)
 [2]

    Unique
    Hashed Associative Container

   Creates a hash_map with a copy of a range that's optimized for
   holding up to <tt>n</tt> items, using <tt>h</tt> as the hash
   function and <tt>k</tt> as the key equal function.

template <class InputIterator>
sparse_hash_map(InputIterator f, InputIterator l, size_type n, const
hasher& h, const key_equal& k, const allocator_type& a)

   [2]

   <tt>Unordered Associative Container</tt> (tr1)

   Creates a hash_map with a copy of a range that's optimized for
   holding up to <tt>n</tt> items, using <tt>h</tt> as the hash
   function, <tt>k</tt> as the key equal function, and <tt>a</tt> as
   the allocator object.

   <tt>sparse_hash_map(const hash_map&)</tt>

    Container

   The copy constructor.

   <tt>sparse_hash_map& operator=(const hash_map&)</tt>

    Container

   The assignment operator

   <tt>void swap(hash_map&)</tt>

    Container

   Swaps the contents of two hash_maps.

pair<iterator, bool> insert(const value_type& x)

    Unique
    Associative Container

   Inserts <tt>x</tt> into the <tt>sparse_hash_map</tt>.

template <class InputIterator>
void insert(InputIterator f, InputIterator l)
 [2]

    Unique
    Associative Container

   Inserts a range into the <tt>sparse_hash_map</tt>.

   <tt>void set_deleted_key(const key_type& key)</tt> [6]

   <tt>sparse_hash_map</tt>

   See below.

   <tt>void clear_deleted_key()</tt> [6]

   <tt>sparse_hash_map</tt>

   See below.

   <tt>void erase(iterator pos)</tt>

    Associative
    Container

   Erases the element pointed to by <tt>pos</tt>.
   [6]

   <tt>size_type erase(const key_type& k)</tt>

    Associative
    Container

   Erases the element whose key is <tt>k</tt>.
   [6]

   <tt>void erase(iterator first, iterator last)</tt>

    Associative
    Container

   Erases all elements in a range.
   [6]

   <tt>void clear()</tt>

    Associative
    Container

   Erases all of the elements.

   <tt>const_iterator find(const key_type& k) const</tt>

    Associative
    Container

   Finds an element whose key is <tt>k</tt>.

   <tt>iterator find(const key_type& k)</tt>

    Associative
    Container

   Finds an element whose key is <tt>k</tt>.

   <tt>size_type count(const key_type& k) const</tt>

    Unique
    Associative Container

   Counts the number of elements whose key is <tt>k</tt>.

pair<const_iterator, const_iterator> equal_range(const
key_type& k) const

    Associative
    Container

   Finds a range containing all elements whose key is <tt>k</tt>.

pair<iterator, iterator> equal_range(const
key_type& k)

    Associative
    Container

   Finds a range containing all elements whose key is <tt>k</tt>.

data_type& operator[](const key_type& k) [3]

   <tt>sparse_hash_map</tt>

   See below.

   <tt>bool write_metadata(FILE *fp)</tt>

   <tt>sparse_hash_map</tt>

   See below.

   <tt>bool read_metadata(FILE *fp)</tt>

   <tt>sparse_hash_map</tt>

   See below.

   <tt>bool write_nopointer_data(FILE *fp)</tt>

   <tt>sparse_hash_map</tt>

   See below.

   <tt>bool read_nopointer_data(FILE *fp)</tt>

   <tt>sparse_hash_map</tt>

   See below.

bool operator==(const hash_map&, const hash_map&)

    Hashed
    Associative Container

   Tests two hash_maps for equality.  This is a global function, not a
   member function.

New members

These members are not defined in the Unique
Hashed Associative Container, Pair
Associative Container, or tr1's
<tt>Unordered Associative Container</tt> requirements,
but are specific to <tt>sparse_hash_map</tt>.

Member	Description

   <tt>void set_deleted_key(const key_type& key)</tt>

   Sets the distinguished "deleted" key to <tt>key</tt>.  This must be
   called before any calls to <tt>erase()</tt>. [6]

   <tt>void clear_deleted_key()</tt>

   Clears the distinguished "deleted" key.  After this is called,
   calls to <tt>erase()</tt> are not valid on this object.
   [6]

data_type&
operator[](const key_type& k) [3]

   Returns a reference to the object that is associated with
   a particular key.  If the <tt>sparse_hash_map</tt> does not already
   contain such an object, <tt>operator[]</tt> inserts the default
   object <tt>data_type()</tt>. [3]

   <tt>void set_resizing_parameters(float shrink, float grow)</tt>

   This function is DEPRECATED.  It is equivalent to calling
   <tt>min_load_factor(shrink); max_load_factor(grow)</tt>.

   <tt>bool write_metadata(FILE *fp)</tt>

   Write hashtable metadata to <tt>fp</tt>.  See below.

   <tt>bool read_metadata(FILE *fp)</tt>

   Read hashtable metadata from <tt>fp</tt>.  See below.

   <tt>bool write_nopointer_data(FILE *fp)</tt>

   Write hashtable contents to <tt>fp</tt>.  This is valid only if the
   hashtable key and value are "plain" data.  See below.

   <tt>bool read_nopointer_data(FILE *fp)</tt>

   Read hashtable contents to <tt>fp</tt>.  This is valid only if the
   hashtable key and value are "plain" data.  See below.

Notes

[1]

<tt>sparse_hash_map::iterator</tt> is not a mutable iterator, because
<tt>sparse_hash_map::value_type</tt> is not Assignable.
That is, if <tt>i</tt> is of type <tt>sparse_hash_map::iterator</tt>
and <tt>p</tt> is of type <tt>sparse_hash_map::value_type</tt>, then
<tt>*i = p</tt> is not a valid expression.  However,
<tt>sparse_hash_map::iterator</tt> isn't a constant iterator either,
because it can be used to modify the object that it points to.  Using
the same notation as above, <tt>(*i).second = p</tt> is a valid
expression.

[2]

This member function relies on member template functions, which
may not be supported by all compilers.  If your compiler supports
member templates, you can call this function with any type of input
iterator.  If your compiler does not yet support member templates,
though, then the arguments must either be of type <tt>const
value_type*</tt> or of type <tt>sparse_hash_map::const_iterator</tt>.

[3]

Since <tt>operator[]</tt> might insert a new element into the
<tt>sparse_hash_map</tt>, it can't possibly be a <tt>const</tt> member
function.  Note that the definition of <tt>operator[]</tt> is
extremely simple: <tt>m[k]</tt> is equivalent to
<tt>(*((m.insert(value_type(k, data_type()))).first)).second</tt>.
Strictly speaking, this member function is unnecessary: it exists only
for convenience.

[4]

In order to preserve iterators, erasing hashtable elements does not
cause a hashtable to resize.  This means that after a string of
<tt>erase()</tt> calls, the hashtable will use more space than is
required.  At a cost of invalidating all current iterators, you can
call <tt>resize()</tt> to manually compact the hashtable.  The
hashtable promotes too-small <tt>resize()</tt> arguments to the
smallest legal value, so to compact a hashtable, it's sufficient to
call <tt>resize(0)</tt>.

[5]

Unlike some other hashtable implementations, the optional n in
the calls to the constructor, <tt>resize</tt>, and <tt>rehash</tt>
indicates not the desired number of buckets that
should be allocated, but instead the expected number of items to be
inserted.  The class then sizes the hash-map appropriately for the
number of items specified.  It's not an error to actually insert more
or fewer items into the hashtable, but the implementation is most
efficient -- does the fewest hashtable resizes -- if the number of
inserted items is n or slightly less.

[6]

<tt>sparse_hash_map</tt> requires you call
<tt>set_deleted_key()</tt> before calling <tt>erase()</tt>.  (This is
the largest difference between the <tt>sparse_hash_map</tt> API and
other hash-map APIs.  See implementation.html
for why this is necessary.)
The argument to <tt>set_deleted_key()</tt> should be a key-value that
is never used for legitimate hash-map entries.  It is an error to call
<tt>erase()</tt> without first calling <tt>set_deleted_key()</tt>, and
it is also an error to call <tt>insert()</tt> with an item whose key
is the "deleted key."

There is no need to call <tt>set_deleted_key</tt> if you do not
wish to call <tt>erase()</tt> on the hash-map.

It is acceptable to change the deleted-key at any time by calling
<tt>set_deleted_key()</tt> with a new argument.  You can also call
<tt>clear_deleted_key()</tt>, at which point all keys become valid for
insertion but no hashtable entries can be deleted until
<tt>set_deleted_key()</tt> is called again.

Note: If you use <tt>set_deleted_key</tt>, it is also
necessary that <tt>data_type</tt> has a zero-argument default
constructor.  This is because <tt>sparse_hash_map</tt> uses the
special value <tt>pair(deleted_key, data_type())</tt> to denote
deleted buckets, and thus needs to be able to create
<tt>data_type</tt> using a zero-argument constructor.

If your <tt>data_type</tt> does not have a zero-argument default
constructor, there are several workarounds:

 Store a pointer to <tt>data_type</tt> in the map, instead of
       <tt>data_type</tt> directly.  This may yield faster code as
       well, since hashtable-resizes will just have to move pointers
       around, rather than copying the entire <tt>data_type</tt>.

 Add a zero-argument default constructor to <tt>data_type</tt>.

 Subclass <tt>data_type</tt> and add a zero-argument default
       constructor to the subclass.

If you do not use <tt>set_deleted_key</tt>, then there is no
requirement that <tt>data_type</tt> havea  zero-argument default
constructor.

Input/Output

It is possible to save and restore <tt>sparse_hash_map</tt> objects
to disk.  Storage takes place in two steps.  The first writes the
hashtable metadata.  The second writes the actual data.

To write a hashtable to disk, first call <tt>write_metadata()</tt>
on an open file pointer.  This saves the hashtable information in a
byte-order-independent format.

After the metadata has been written to disk, you must write the
actual data stored in the hash-map to disk.  If both the key and data
are "simple" enough, you can do this by calling
<tt>write_nopointer_data()</tt>.  "Simple" data is data that can be
safely copied to disk via <tt>fwrite()</tt>.  Native C data types fall
into this category, as do structs of native C data types.  Pointers
and STL objects do not.

Note that <tt>write_nopointer_data()</tt> does not do any endian
conversion.  Thus, it is only appropriate when you intend to read the
data on the same endian architecture as you write the data.

If you cannot use <tt>write_nopointer_data()</tt> for any reason,
you can write the data yourself by iterating over the
<tt>sparse_hash_map</tt> with a <tt>const_iterator</tt> and writing
the key and data in any manner you wish.

To read the hashtable information from disk, first you must create
a <tt>sparse_hash_map</tt> object.  Then open a file pointer to point
to the saved hashtable, and call <tt>read_metadata()</tt>.  If you
saved the data via <tt>write_nopointer_data()</tt>, you can follow the
<tt>read_metadata()</tt> call with a call to
<tt>read_nopointer_data()</tt>.  This is all that is needed.

If you saved the data through a custom write routine, you must call
a custom read routine to read in the data.  To do this, iterate over
the <tt>sparse_hash_map</tt> with an <tt>iterator</tt>; this operation
is sensical because the metadata has already been set up.  For each
iterator item, you can read the key and value from disk, and set it
appropriately.  You will need to do a <tt>const_cast</tt> on the
iterator, since <tt>it->first</tt> is always <tt>const</tt>.  You
will also need to use placement-new if the key or value is a C++
object.  The code might look like this:

   for (sparse_hash_map<int*, ComplicatedClass>::iterator it = ht.begin();
        it != ht.end(); ++it) {
       // The key is stored in the sparse_hash_map as a pointer
       const_cast<int*>(it->first) = new int;
       fread(const_cast<int*>(it->first), sizeof(int), 1, fp);
       // The value is a complicated C++ class that takes an int to construct
       int ctor_arg;
       fread(&ctor_arg, sizeof(int), 1, fp);
       new (&it->second) ComplicatedClass(ctor_arg);  // "placement new"
   }

Validity of Iterators

<tt>erase()</tt> is guaranteed not to invalidate any iterators --
except for any iterators pointing to the item being erased, of course.
<tt>insert()</tt> invalidates all iterators, as does
<tt>resize()</tt>.

This is implemented by making <tt>erase()</tt> not resize the
hashtable.  If you desire maximum space efficiency, you can call
<tt>resize(0)</tt> after a string of <tt>erase()</tt> calls, to force
the hashtable to resize to the smallest possible size.

In addition to invalidating iterators, <tt>insert()</tt>
and <tt>resize()</tt> invalidate all pointers into the hashtable.  If
you want to store a pointer to an object held in a sparse_hash_map,
either do so after finishing hashtable inserts, or store the object on
the heap and a pointer to it in the sparse_hash_map.

See also

The following are SGI STL, and some Google STL, concepts and
classes related to <tt>sparse_hash_map</tt>.

<tt>hash_map</tt>,
Associative Container,
Hashed Associative Container,
Pair Associative Container,
Unique Hashed Associative Container,
<tt>set</tt>,
<tt>map</tt>
<tt>multiset</tt>,
<tt>multimap</tt>,
<tt>hash_set</tt>,
<tt>hash_multiset</tt>,
<tt>hash_multimap</tt>,
<tt>sparsetable</tt>,
<tt>sparse_hash_set</tt>,
<tt>dense_hash_set</tt>,
<tt>dense_hash_map</tt>

redpajama_set_name: RedPajamaGithub


To open Black History Month, Dr Nira Chamberlain shares his presentation on the Black Heroes of Mathematics.
In this blog, he also shares his inspiring journey to become one of the UK's top practising scientists today, despite a lack of visible Black role models and his careers teacher advising him to pursue boxing.
"In America, out of a population of 250 million, there are 46 million African-Americans – of which it is estimated that only approximately 300 have a PhD in mathematics. An American columnist once stated that Black people were intellectually inferior because there has never been a Black Mathematician who has won the Field Medal, the greatest prize in mathematics.
"My name is Nira Chamberlain, when I was growing up mathematics was my strongest subject but I never had a passion for it but I had a dream that one day I would become some type of super mathematician. However, my career teacher stated I should become a boxer and my classmates would racially tease me if ever I became top of the class.
"With this, I began to study harder, I lived breathed and ate mathematics. I soon realized that I may not be good in exam conditions but I was very good at solving real life mathematical problems outside academia. I went on to work in France, the Netherlands and Israel doing the mathematics that nobody else could do. 15 years later, in 2014, and within six months, I got my PhD in mathematics, I was awarded by the Science Council one of the UK's top 100 Practising Scientists and in 2015 I became the first Black mathematician to be referenced by the Who's Who since its establishment in 1849. There are only 30 mathematicians in the Who's Who and they tend to be the top mathematical geniuses in Britain. I am glad I never became a boxer, but I persevered with my dream and became a super mathematician after all!
"However, I realised that Black mathematicians were still very much invisible. Hence, l decided to target as many organisations as possible, raising the Profile of Black Mathematicians! I produced a power point presentation which I put on social media and this received positive reviews from the established mathematics community. A version of the presentation was used in the Institute of Mathematics and its Application Careers website.
Great story and an inspiration to anyone studying and enjoying mathematics. Hopefulyl,one day you'll be seen as an excellent mathmatician first.


E.T. phone home (phone programming) : the individual will have personalities whose sole job is to call and report to the trainer or cult leader. These are often young child alters who are eager to please, starved for attention and nurture, and who are heavily rewarded for calling back in. Any survivor who attempts to leave the cult must deal with the urge to phone home. To phone their abusers. To phone their friends who are in the group. To phone their parents, siblings, cousins, or aunts. This urge may become overwhelming at times and worst of all, the survivor may be totally amnesic to the fact that the people they are calling are cult members who are urging them, in code, to come back. Common phrases used include: your 'family' loves you, misses you, needs you. So and so is ill and needs to see you. You are so special to us. You are so valuable. You need to come see us. Why are you so distant? Why haven't we heard from you lately?
The list goes on and on. Sweet, kind phrases with double meanings, placed in the person during training sessions. Trainers are not stupid and know that if cult members said "come to the ritual meeting at midnight next week", the survivor would run the other way, and be validated as well that they are not making things up. So, they ingrain code messages behind innocuous phrases such as described above. These, and other messages, are meant to trigger recontact programming.
Siblings are often cross trained to access each other with special codes. Remember when.... may initiate this. I love you, or, your family loves you, can also be used. Phrases will be individual, depending on the person's family members and background.
Certain clothing or jewelry worn can be used to draw a cult loyal system, such as a color coded system, or jewel system , to the front. The person must physically resemble the person the individual was "keyed into" during the programming sequence, to prevent inadvertent popping out of alters by anyone wearing a ruby pin, for example. This kind of cueing will be based on sight recognition of a person, plus the clothing color or jewelry being worn a certain way.
Phone calls from concerned family members, friends, and cult members will flood the survivor's phone lines and answering machine, especially during the initial getting out phase.
The possibilities are almost endless, depending on the trainers, the group the person was with, and the people they are most bonded to in the cult. Special training sessions will be given, with code words and cues built into the system's programming.
If all else fails, hostility will start. "You don't love us" will be heard, even when the survivor has stated repeatedly that they care. Boundaries drawn with cult members will be misinterpreted as lack of concern, or withdrawal. Accusations, guilt, and anger as well as manipulation will be used as hooks to make the survivor feel guilty for withdrawing from the cult.
Isolation programming may activate, as the cult support system is withdrawn in the survivor's life, and they try the difficult task of developing healthy, appropriate relationships outside of the cult. Often, the therapist will be the survivor's lifeline and sole support at first. The individual may fall into codependent relationships quickly, or relationships with other survivors to fill the void in their life. At worst, desperate for caring and feeling isolated, they will make friends with the first kind person they meet. This person could be a cult set up, sent to initiate a friendship quickly. Survivors should be wary of "instant friendships" or instant bonding with others. Most good relationships take time and effort.
One of the most difficult tasks, but most important safety wise, will be for a totally amnesic presenting system to realize who their abusers really are. It will seem unbelievable, when back parts come up in therapy, and disclose that beloved, or even barely tolerated family members are in the cult. Believing these parts and listening to them will be crucial to safety. Protectors will be important to the survivor's safety, especially if they are willing to give up cult allegiance and help keep the person safe. Outside accountability with safe persons is extremely important. The problem is that generational Illuminati survivors have often been surrounded all their lives by a network of other cult members. Unknown to them, their closest friends and family members are part of the group. Amnesia poses the greatest danger to the survivor in the beginning stages, as they will trust people before they remember that they are unsafe.
A survivor may remember the father taking them to rituals, and believe that their mother or grandparent is safe. Only later in therapy will they remember that mother or granny was actually their trainer, since the most painful memories tend to come later. The survivor may only remember ritual abuse in early childhood, and think they were let go at a certain age. This is extremely rare, since the group has put in years of effort into training them. Almost never will they just "let someone go" in generational families. But they may be given false or screen memories, especially if they are in therapy, to confuse the survivor and the therapist.
The client will need to listen to and believe internal parts who have more information than they do, and take appropriate steps to be safe. This will probably mean cutting off contact with perpetrators at this point. Again, outside accountability is paramount. Safe houses, a women's shelter or a safe church family may be alternatives. One of the worst things the survivor can do is isolate, or go out walking late at night alone, or go camping in the woods by themselves. Abduction will often occur in these scenarios, when the survivor is alone and vulnerable. Safe roommates can help keep the survivor safe.
Building a support system through safe support groups, a good therapist, church, or work can also help. Whenever possible and practical, moving away from the town or state where the survivor was active in the cult can help. Why? Remember the survivor's whole support network was the cult in their old town. The trainers and/or family members have invested time and effort into the survivor and have a big stake in their coming back. If the survivor moves far enough away, a cult group in the new city or state will not know them as well, and will not have a lengthy history with them. This can help decrease the chance of reaccessing by the cult, in conjunction with good therapy and a safe support network.
One caution though: even if the survivor moves, they will need to work intensely on blocking internal recontact programming at the same time, or they may be quickly reaccessed. Trainers will often send the person's system codes and grids over the internet to cult groups in the new city, and will try to send someone who physically resembles the trainer or a family member to initiate contact with the survivor.
One issue often brought up by survivors is: how much do I tell others about my past? This is an individual decision that the survivor and therapist need to look at together. In general though, caution in sharing is best, since sharing too much about the survivor's past may draw the wrong people to them. These people may be dysfunctional, or possible cult members. It is usually best to base new, non cult friendships on healthy aspects of the person at first and very gradually share small bits of information as the friendship progresses, and sharing seems appropriate. With time and opportunities, the survivor will learn the importance of appropriate boundaries and will want healthier relationships in their life.


In the November 2000 issue of Artforum, Richard Hawkins concluded his 'Top Ten' list - which included everything from Robert Altman's 1977 film Three Women (number 6) to 'Good stuff on TV this summer' (number 2) - with a rave for 'Any painting made without using masking tape', immediately followed by this zinger: 'If the masking tape factory burned down, there'd be no painting in LA for at least a season.' If you were cruising the galleries in southern California circa Y2K, you'd know he was hitting below the belt. Ouch.
Hawkins's jab was personal. Approaching the millennium, the Los Angeles-based artist had, almost unexpectedly, started making paintings - painterly paintings, with brushes, oil, canvas, etc. - after gaining some acclaim, and perhaps a little notoriety, in the previous decade for a body of seemingly off-hand, but genuinely unsettling work: objects of desire - presumably the artist's - extracted from mass media and subjected to erotically-charged, frequently violent treatment that one could safely refer to, for the sake of tradition, as 'collage' (or perhaps 'assemblage'). For example: Hollywood hard rockers cut from magazines and casually paper-clipped to latex ribbons of slashed Halloween masks (Poison, 1991) or to the margins of large sheets of coloured felt (Captive, Blue, 1993); inkjet prints incorporating images of a young, shirtless Matt Dillon or Dazed and Confused's androgynous stoner-in-training Wiley Wiggins against mildly psychedelic, primitive digital backgrounds (med.pink.matt.graveyard and med. yellow.wiley.classroom, both 1995); large inkjet prints of disembodied and bloody 'zombie'-fied (via Photoshop) heads of young, male actors floating in front of pretty pastel grounds (disembodied zombie guy peach, 1997, among others), etc.
In 2000, Hawkins exhibited a series of petite canvases at Corvi-Mora gallery in London.
The Way Things Go (1987) embodies many of the qualities that make Fischli and Weiss's work captivating: slapstick humour and profound insight; a forensic attention to detail; a sense of illusion and transformation; and the dynamic exchange between states of order and chaos.
Melissa Gronlund considers Enrico David's figural work as thematising the transition of the artist's creations from a private to a public realm.


Cider has become my favoured drink as it's easy drinking and packed full of flavour. Having a cool fruity drink is perfect for the summer months so I was excited when Cranes asked if I'd like to test out some of their ciders. Cranes Cranberry Cider are brewed by founders and twin brothers Ben and Dan. After finishing university, they reunited and formed the brand Cranes. Eight months later with a lot of hard work, their recipe was finally finished and ready for production. The brand name came from the twins dad doing a little research to find out that Cranberries used to be called 'Crane-berries'.
Creating the cider comes from brewing the finest cranberries with apples to make the refreshing naturally light cider that comes in three different flavours: Cranberry & Lime, Blueberry & Apple, and Raspberry & Pomegranate. Cranes Ciders have 30% fewer calories compared to brand leaders, which is made possible by utilising the sweetness of the fruit without being full of sugar. If you fancy picking up your own ciders, you can head over to the Cranes website where you can get a 12 pack of 500ml bottles for £27.60.
Seen as we've had some lovely weather over the bank holiday, it only seemed right to head out in the sun and set up a BBQ. Having the Cranes Ciders cooling in the fridge meant that they were the perfect accompaniment to the rounds of burgers and chicken. I found them to be a lighter taste than other ciders I've had before which meant they were super refreshing and worked really at the BBQ. Each of the ciders are variations of cranberry cider and all have their own attributes, with some being slightly sweeter than the others. If you enjoy fruity ciders, then I would definitely recommend giving some of the Cranes Ciders a try!
It's that time of year when many people are waiting for their exam results and will be keen to find out where they're heading off to university. I can't believe it's five years since I was in that position, it seems to have absolutely flown by. I had the pleasure of attending Northumbria Uni, in Newcastle, studying Geography BSc (Hons) for three years until I graduated back in 2015. Even though it's been a couple of years since I finished, I still feel like I've only just left. Different universities will often have a dedicated clearing web page, such as the Northumbria University Clearing Page and a clearing app that you can use to keep up to date in the run up to, and on results day. To download Northumbria's clearing app, just search 'Clearing Guide 2017' in the App Store. Personally, I found that being at uni was one of the best life experiences I could have as it put me in a more independent position where I had to 'fend for myself'' as it were. Having time to reflect on my time there has been good, as when I look back now I realise I managed to grow as a person and gained so many useful skills that I now use in my graduate role.
Northumbria University is based in the heart of Newcastle which I found to be great for going into the city centre. My course had a mix of lectures, seminars, tutorials and practical based sessions. I found the content really interesting and the different assignments actually helped me to learn key knowledge and skills. There were a number of field trips as part of this course ranging from a weekend in Berwick Upon Tweed, in Northumberland, to a week in Tenerife. I found the uni gym super handy as it was located next to all of the other buildings so I could go in-between lectures. It's worth checking out as they have loads of equipment and a range of membership options to suit different needs and budgets. For accommodation, I opted for Glenamara House which was a 7-room flat with two communal bathrooms, sinks in each room, and a communal kitchen. This was a good middle ground between price and location and was perfect for the first year with new flatmates. Like all the uni's accommodation, it's within walking distance of the campus and they guarantee all new students accommodation, including those going through Clearing.
Newcastle is known for having great nightlife as there are so many venues and events, you should never be short of choice for a night out. If you fancy exploring the city at other times of day it's worth heading down to the quayside as it has some nice views and looks particularly photogenic at night as you can see above. If you think you could see yourself at Northumbria University, this info below should help you understand the everything about clearing.
You don't hold any offers, either firm or insurance, from your initial UCAS applications.
You applied after 30th June.
You do not have a confirmed place from your firm or insurance course.
If you have only made a single choice on your original application, you can pay £11 to apply to other uni's through clearing. A Clearing Number will automatically be given to you by UCAS if you are eligible, just use your UCAS Track account.
If you are worried about getting a place to live when going through clearing then don't worry, Northumbria Uni will guarantee you accommodation for all first-year students. They have over 5000 bedrooms in a mix of residence types including both budget friendly and en suite options which are all nice and close to the campus. The uni works with referral partners to make sure every student that comes through clearing will have a somewhere to live arranged for them.
You must call up yourself, unfortunately, it can't be your friends or family ringing on your behalf.
Have your UCAS personal ID number and Clearing number to hand.
Know the UCAS code and title for the course you want to apply for.
Have your qualification details ready, including your GCSE's and others.
Be prepared to talk to the admissions tutor about why you are choosing your course.
Have a pen and paper by your side to write down any important details.
Have some questions that you may want to ask to help you make the decision.
I hope that this post has made it a bit easier to understand the process around clearing and made you think about checking out the options for Northumbria Uni. I've done a few other posts in my Uni Series which could be useful for those of you either thinking about or already in uni. Good luck to those of you getting your results on Thursday!
The Globenfeld Seal Grey Chronograph Watch is priced at £149.00 and has an understated modern design which will be a great addition to any outfit. The first thing I noticed when I opened the box was the width of the face which, at 46mm, is on the larger size. It's great for someone like me who has a large wrist and prefers a bigger watch. Weighing in at 77 grams, it's got a solid feel to it without being too cumbersome. I love the combination of jet black and grey face with the tachymetre outer ring in black and silver. A date window integrated into the face makes for easy viewing, while the white hands stand out nicely which is finished off with the distinctive red second hand. A stopwatch with 3 dials gives you an option to accurately capture timings. All of this is protected by the scratch resistant glass that should withstand prolonged use.
Being contained in this neat watch box makes it perfect if you were giving it as a gift or even for those who like to keep their watches stored safely when not in use. It has two magnetic closures that open up to reveal the watch in its padded presentation box. The crowns and textured bezel are a good size and easy to operate and match the solid build of the watch.
The leather strap is 22mm in width and sits nicely on your wrist to ensure it's comfortable, while still giving the watch the finishing touch of class. I think my favourite part about the rear of the watch is their logo on the silver plate which gives it a completely unique look. White stitching along the inside of the strap works well with the tan colour.
This watch could be worn in different situations, whether you want it for sports use to make use of the timing function, a more formal option for the smarter looks or even to complement a casual outfit, the Globenfeld Chronograph would be great for any of these. I can definitely see myself wearing it at work with a shirt and tie as I think it will be a nice addition to my outfit. I'd say the watch is fairly well priced for its features and looks and could be suitable for anyone looking for their first watch or one to add to their collection.


A.S.A.P. Garage Door Repair, Inc. in Huntley is looking for a garage door installer / technician / warehouse.
This is a full time position with benefits. If you are a self starter with an great work ethic this job is for you.
Stop in to apply Mon-Fri 7a to 5p or Sat 7a to 12noon.
11351 Allison Ct, Huntley, IL.


text:
Thinking Outside of the Box
ARTISAN CRAFTED BOXES PERFECT FOR TULASĀRA™
Meet William Dohman. He is a craftsman with a conscience and, like Aveda, a native of Minnesota. So it's only logical that William and the company would cross paths several times—most recently when the artisan created one-of-a-kind upcycled wooden boxes for a special contest to celebrate the launch of Aveda's Tulasāra™ line.
William's earliest intersection with Aveda was not as a woodworker, but as an architect, when he was at the small South Minneapolis firm that was in charge of designing Aveda founder Horst Rechelbacher's New York City apartment. Like Horst, who started as a celebrity stylist in his native Europe and ended up changing career lanes (ultimately creating a beauty empire), William was trained to be an architect, but eventually found himself at a crossroads. He was working in architecture, but making interesting wooden objects on the side. "I was going to stop woodworking and just do architecture, but my wife encouraged me to stick to woodworking. She urged me to sell my creations online, and it got to the point where I became a featured artist," he says. "I made little robots and a lot of wooden signs. But mostly, I'd find scrap wood and ask myself what I could make out of them."
Several years later, once William's newly formed woodworking business, Oh Dier, a home-décor, entertaining, and kids' toys company made from ethically sourced wood, had taken off, he once again found himself with a connection to Aveda – a woodworking project with the company. The result? A bespoke, limited-edition wooden box that will be used to house the entire Tulasāra™ collection, including the Radiant Facial Dry Brush, Radiant Oleation Oil, Firm Concentrate, Bright Concentrate, and Calm Concentrate.
(Click here to find out how you can win the limited-edition box with the Tulasara™ products— Valued at $335!)
"Each box is truly unique."
WILLIAM DOHMAN, WOODWORKER, ARTISAN
The materials for the box come from a local cabinet shop, which manufactures large custom cabinets and pieces of furniture for corporations. "They have high volumes of wood coming in," says William, "but, of course, the grain for those projects must be flawless and all look the same, so there are many pieces they can't use." Normally, wood scraps would be burned, but William buys them to craft the Tulasāra™ boxes. "Each box is truly unique. So I'm after just the kind of wood that they don't want." It's a win-win."
The late Aveda founder once said, "If it's not love, stop doing it." Thankfully, William continued following his passion—and everyone is better for it.
DO YOU BELIEVE IN FOLLOWING YOUR DREAMS?
Share this success story with your friends using the hashtag #LivingAveda
TULASĀRA™ MUST HAVES
How to Find Balance in 4 Minutes
Reveal Your Radiance


Venezuela has been hit by a vast power cut, with at least 18 of its 23 states reportedly affected by a blackout authorities blamed on anti-government saboteurs.
Commuters in the country's crumbling capital, Caracas, were forced to walk home from work after the metro service was paralyzed by the outage, while the international airport was reportedly plunged into darkness.
Millions of citizens from the western state of Zulia to Amazonas in the far south were also reported to have been affected.
The Venezuelan news website El Pitazo reported that the outage appeared to be the result of a failure at the Simón Bolívar hydroelectric plant in the southern state of Bolívar.
Members of Nicolás Maduro's crisis-stricken government claimed opposition wreckers had targeted the plant, which is also known as Guri.
"The black out has been caused by sabotage at Guri," tweeted the official account of the television program of Maduro's second-in-command, Diosdado Cabello.
"This is not an attack on the government. It is an attack on the people," Venezuela's electricity minister, Luis Motta Domínguez, told reporters.
Maduro blamed "United States imperialism" for the problem and vowed it would be defeated. "Nothing and nobody will defeat the people of Bolívar and Chávez," he tweeted.
Venezuela's state-run power company, Corpoelec, claimed the blackout was "part of the electricity war against the state" and said it was working to restore supply.
Amid a crippling economic crisis, shortages of water and power – which experts blame on mismanagement, corruption and poor maintenance – are now common. Even upmarket restaurants and hotels in Caracas are regularly deprived of both.
Even so, Thursday's power outage appeared to be unusually severe even by Venezuelan standards.
"The international airport … is almost totally without electricity at this moment," the opposition politician, Jony Rahal, informed his Twitter followers in a video.
"What can we say? We're tired of this government," one frustrated commuter told the Venezuelan TV channel NTN24.
The blackout was so severe that one Venezuelan journalist asked his Twitter followers to report if they had electricity, not if they did not.
The United States senator Marco Rubio – who has thrown his weight behind efforts to unseat Maduro and replace him with opposition leader Juan Guaidó – described the blackout as further proof that Venezuela's strongman ruler was on his way out.