Writing custom types
Edit (pull request)TOSCA specification allows definition of a cloud application by defining a set of nodes that are connected to other using relationships.
In order to improve reusability of components and defined recipes, TOSCA allow the definition of NodeTypes that defines components and eventually their implementation (for example a Java NodeType and the script implementation to install it on a virtual server). The defined NodeTypes can then be reused when a developer or application architect want to define the topology of a cloud application.
TOSCA and thus Alien 4 Cloud allows you to define some abstract types (basically meta-types without implementation). This allows of course to dissociate the specific technical implementations from the actual definition of a component (writing an abstract Java node and several implementations with chef, puppet etc.).
This can also be leveraged in order to meta-model your applications for the cloud even if you don’t need to deploy them right now. Alien 4 Cloud advisory features for moving to the cloud leverage this to quiclky map your Information System and get feedback on your application’s cloud maturity and migration advisory.
The sub-sections details how you can write your own Capability Types, Node Types and Relationship Types to extends the one that Alien 4 Cloud already provides to you.
Definition of Node Types and other elements in TOSCA should be done in a definition file and packaged in a Cloud Service Archive


{% extends "base.html" %} {% block content %} Manage Classes New Class To Add Add Class Saved Classesclear all Training Data Text to Classify Select a class Add Training Sample Saved Training Dataclear all Classify New Text Text To Classify Classify Saved Classificationsclear all {% endblock content %}
clear all


{% extends 'base.html'%} {% import 'bootstrap/wtf.html' as wtf%} {% block styles%} {{ super() }} {% endblock %} {% block content %}
Fill in the fields to login
Don't have an account? Sign up here


Historic stately home throwing Christmas parties for dogs - and they're super posh
Packages start from, erm, £300
by Rachel GormanYour favourite pampered pooch need not be left out of the fast-approaching Yuletide party season, at least not at one of Nottinghamshire's grandest stately homes.
Historic 15th century Thrumpton Hall will be throwing Christmas parties for dogs as part of its festive celebrations - and in keeping with the locations, they're naturally pretty posh.
Organised by Regal Wagmore, a private portrait photography company based at the hall, packages start from £300 - and can include anything from coffee and light refreshments through to a sumptuous three course champagne luncheon rounded off with a classic afternoon tea.
Visitors can also recreate history and get the Downton Abbey treatment with a fun period photoshoot - which can include furry friends, of course.
Founder, Steven Havers, is a professional photographer and says the Regal Wagmore experience is an unforgettable one.
"Regal Wagmore offers a truly unique portrait photography experience, first class levels of service, comfort and attention,” he says.
“With stunning, authentic interiors and beautifully manicured grounds, the possibilities are endless.
“Period costumes can be hired to add a truly timeless look and feel to your portraits, Thrumpton Hall has it all.
“Dogs are very welcome to join you in your portrait photography experience. You can even choose to stay the night in a stunning four poster bed.”
To book visit regalwagmore.co.uk.
With the General Election approaching we want to give you all the results and reactions as they happen. Join our new WhatsApp service to receive breaking news alerts throughout the night by texting ELECTION to<PHONE_NUMBER>2. The first messages will go out December 12 after polls close.


Play around with the canvas. Anyone can also edit it. Create art together!
Code on Github. Created by @paramaggarwal, follow me!
Do upvote if you enjoyed! Discuss on Hacker News.
Praise on HN:
"Quite interesting how, with something that looks so simple as a concept potentiates when technology is involved in the right amount. -pirer"
"Thanks, the fact that it was so simple to make it do random things is great. Very fun. - achal"
Thanks!


THE WATERBOY (M). (Touchstone/Buena Vista International) Director: Frank Coraci Stars: Adam Sandler, Kathy Bates, Fairuza Balk, Henry Winkler, Jerry Reed, Larry Gilliard jr, Blake Clark, Peter Dante, Jonathan Loughran, Clint Howard, Rob Schneider, Todd Holland, Robert Kokol Running time: 86 minutes.
With his role as the endearing hero in the wonderful romantic comedy The Wedding Singer, goofy comic Adam Sandler reached a wider audience. His effortless charm won over many who had previously been immune to his whining, obnoxious, dumb screen persona and his outrageous brand of manic humour. His latest comedy has already proven to be very popular in the States, although it is a backward step following the broadly appealing The Wedding Singer. The Waterboy heralds a return to the sort of crass, unsubtle and juvenile humour that drove his earlier movies Happy Gilmore and Billy Madison.
In a tailor-made role, Sandler again plays the familiar gormless loser who eventually triumphs against all odds. Sandler plays Billy Boucher, a naive lad from the bayous of Louisiana, who has been sheltered by his domineering and over possessive mother (Kathy Bates, from Misery, etc). No stranger to life's hardships, Mama Boucher has protected her little boy from the wilder world and its influences, which she claims are "the devil's work." Consequently, he lacks a real education and any social skills.
He works as the water distribution engineer (i.e.; waterboy) for a local college football team, but he is basically treated as a joke and constantly put down by the players. When he is fired by Beaulieu (Jerry Reed, from the Smokey And The Bandit series, etc), the arrogant, conniving, and very successful coach, Bobby approaches his less successful rival coach Klein (Henry Winkler) for a job as the team's waterboy. Klein's second rate team has lost the past forty games, and seems in no danger of turning around its losing streak.
When Klein discovers that Bobby's anger makes him the most fearsome tackler in the college league, he takes a punt and puts the waterboy on the team. Bobby becomes an integral part of the team's improbable, and fairy tale-like success. But can he take the team all the way to the championships without Mama finding out?
Along the way, the shy Bobby finds love with the tough Vicki Vallencourt (Fairuza Balk, from The Craft, etc), and helps coach Klein overcome his fear of long time rival Beaulieu. Sandler has created The Waterboy with several of his former college friends, including director Frank Coraci (The Wedding Singer) and regular co-writer and collaborator Tim Herlihy (who has written his last four movies). They seem to have enjoyed themselves enormously making the film, and some of their infectious humour will spill over onto the audience.
The cast also seems to have enjoyed themselves immensely. Cast largely against type, Oscar winner Bates throws caution to the winds here. Her over the top performance lacks restraint, but it perfectly suits the mood of the film. Winkler's performance as the confused and dithering coach Klein is a far cry from the days when he played the legendary Fonz, two decades ago.
The parade of cameos from American sporting commentators and real life football identities will largely go unrecognised by Australian audiences, as will a lot of the parochial humour. A passing knowledge of the rules, strategies and complex game plans of American football would also be a big help in understanding much of the action here.
The Waterboy is a very silly, very crass film, but it will undoubtedly prove very popular with Sandler's legion of fans.
** greg king http://www.netau.com.au/gregking
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


PHYSICS MANAGER
Drag & Drop
Use a Physics Body Editor file
Open editor
Units
Name
Actor Tpl.
Shape Tpl.
Material
_all
Name
Override existing units
Import
Cancel
Ready


| Arguments: | |
| zz | A pointer to the Zoltan_Struct to be used in the load-balancing algorithm. |
| part_sizes | Input: an array of part sizes for each weight component. Entry part_sizes[i*obj_weight_dim+j] contains the user-requested part size for part i with respect to object weight j for i=0,1,...,number of parts-1, and j=0,1,...,obj_weight_dim-1. If the application sets parameter OBJ_WEIGHT_DIM, obj_weight_dim is the set value of OBJ_WEIGHT_DIM; otherwise, obj_weight_dim is one. |
| num_import | Upon return, the number of objects to be imported to the processor for the new decomposition. A negative number indicates that no import data has been computed and the import arrays should be ignored. |
| import_global_ids | Upon return, an array of num_import global IDs of objects to be imported to the processor for the new decomposition. If this array is non-null, it must be allocated by Zoltan_Special_Malloc. |
| import_local_ids | Upon return, an array of num_import local IDs of objects to be imported to the processor for the new decomposition. If this array is non-null, it must be allocated by Zoltan_Special_Malloc. |
| import_procs | Upon return, an array of size num_import containing the processor IDs of processors owning (in the old decomposition) the objects to be imported for the new decomposition. If this array is non-null, it must be allocated by Zoltan_Special_Malloc. |
| import_to_parts | Upon return, an array of size num_import containing the part IDs of parts to which objects will be imported in the NEW decomposition. If this array is non-null, it must be allocated by Zoltan_Special_Malloc. |
| num_export | Upon return, the number of objects to be exported from the processor for the new decomposition. A negative number indicates that no export data has been computed and the export arrays should be ignored. |
| export_global_ids | Upon return, an array of num_export global IDs of objects to be exported from the processor for the new decomposition. If this array is non-null, it must be allocated by Zoltan_Special_Malloc. |
| export_local_ids | Upon return, an array of num_export local IDs of objects to be exported from the processor for the new decomposition. If this array is non-null, it must be allocated by Zoltan_Special_Malloc. |
| export_procs | Upon return, an array of size num_export containing the processor IDs of processors owning (in the old decomposition) the objects to be exported for the new decomposition. If this array is non-null, it must be allocated by Zoltan_Special_Malloc. |
| export_to_parts | Upon return, an array of size num_export containing the part IDs of parts to which the objects will be exported for the new decomposition. If this array is non-null, it must be allocated by Zoltan_Special_Malloc. |
| Returned Value: | |
| int | Error code. |


2013 - the year that was
Career Moves
It was a big decision for me but at the middle of the year I decided to make a career change from being a full time PHP developer, to a full time ruby developer. Building things with ruby was something I felt I was naturally moving to and I just loved the language much more than PHP so it was only right.
6 Months later since moving from PHP to ruby full time, I can say I do not regret the decision. I have accomplished a great deal with ruby over the past 6 months, all of which I am very proud of and a bit surprised that I was able to accomplish it. Those achievements were not small and were gratifying.
A couple of the big achievements were: - Migrating an internal app from MYOB to Xero - Building a quoting system
New Languages
So I learnt ruby, although I still personally feel that I am at a level inbetween beginner and intermediate. I just need to get a grasp on more of the handy methods that ruby provides in the standard library for me to feel like I have achieved and intermediate level of ruby knowledge.
New Workflow/Tools
Boy has my workflow and toolset changed, in the past 6 months I have switched to vim full time and this was massive for me. It took a few weeks or so for me to get back to the speed that I was at and now I feel just as fast, if not faster, using vim than my old trusty Sublime Text. I do once in a while crack open Sublime Text for some odd things here and there but there are always a lot of cobwebs on it.
My workflow has also incorporated tmux into every project, along with tmuxinator. If you do not know what tmux is, check it out now! BTW these are all terminal workflows, so no gui for you here. Working in the terminal is soo much quicker.
Grunt! Wow, okay so I am getting onto grunt a little bit late in the game but am absolutely loving it, along with bower, a package manager. These are AMAZING tools to have (command line based again) that replace just about all of my gui tools. They are quick, use hardly any memory and I can run them all through my terminal.
Yea so you probably can see whats going on here, I have moved to a nearly complete terminal based workflow and toolset. This has made me much more efficient, it really is something that I wish a lot more web developers got into. There are some pain points in getting started but it is all about just slowely moving little bits of your workflow to the terminal. In next to no time you will be surprised how little is left outside of your workflow in the terminal. Get cracking people!
Business changes
I decided to put my freelance business aside and work on some personal projects. This was sort of hard to do but at the same time it was necessary. I was starting to feel burnt out and this was not fair to my clients and myself. I sitll maintain the services my clients use but have just stopping taking in any work, although I have taken on a few freebie jobs to help out some community organisations.
Personal Projects
So I finally got to work on a couple of personal projects. Devbase.io and recently Email Setup Buddy which I am quite excited about. I have gone quite over time regarding getting devbase.io to open beta but it should be launching within the next 6 weeks.
There is one more project which is upcoming and looking to launch in the first quarter of this year that I am partnering in with a friend of mine which is really exciting and will challenge me quite a bit. So far it is coming along really well and is looking sweet!
Anyway that is it really, I may add some updates to this post here and there. What a great year 2013 was, lets hope I can top it in 2014!


A check is similar to a follow-on action, but the condition can only be compared against the value which has just been assigned to the parameter. Checks execute their tasks 'onMatch' or 'onNonMatch' of their respective condition.
Here, the check is checking for a blank string and will enter on match.


| Package | Description |
|---|---|
| com.jme3.animation |
The
com.jme3.animation package contains various classes
for managing animation inside a jME3 application. |
| com.jme3.app |
The
com.jme3.application provides a toolset for jME3 applications
to interact with various components of the engine. |
| com.jme3.audio | |
| com.jme3.bounding | |
| com.jme3.cinematic | |
| com.jme3.cinematic.events | |
| com.jme3.collision | |
| com.jme3.collision.bih | |
| com.jme3.effect |
The
com.jme3.effect package allows particle emitter effects to be
used with a jME3 application. |
| com.jme3.effect.influencers | |
| com.jme3.effect.shapes | |
| com.jme3.font | |
| com.jme3.input |
The
com.jme3.input package is used for all input handling in
jMonkeyEngine. |
| com.jme3.light |
The
com.jme3.light package contains various lights that can be placed
in a scene. |
| com.jme3.material |
The
com.jme3.material package contains classes for manipulating
jMonkeyEngine materials. |
| com.jme3.math |
The
com.jme3.math package provides mathematic data structures
and utilities which are used by the rest of the engine. |
| com.jme3.renderer |
The
com.jme3.renderer package provides classes responsible for
rendering. |
| com.jme3.renderer.opengl | |
| com.jme3.scene |
The
com.jme3.input package contains the scene graph implementation
in jMonkeyEngine. |
| com.jme3.scene.debug | |
| com.jme3.scene.plugins | |
| com.jme3.scene.shape | |
| com.jme3.shader | |
| com.jme3.shadow | |
| com.jme3.system | |
| com.jme3.texture.image | |
| com.jme3.util | |
| com.jme3.util.xml | |
| jme3tools.optimize |
| Class and Description |
|---|
Matrix4f
Matrix4f defines and maintains a 4x4 matrix in row major order. |
Quaternion
Quaternion defines a single example of a more general class of
hypercomplex numbers. |
| Transform
Started Date: Jul 16, 2004
Represents a translation, rotation and scale in one object. |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
Quaternion
Quaternion defines a single example of a more general class of
hypercomplex numbers. |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
Matrix4f
Matrix4f defines and maintains a 4x4 matrix in row major order. |
Plane
Plane defines a plane where Normal dot (x,y,z) = Constant. |
| Plane.Side |
Ray
Ray defines a line segment which has an origin and a direction. |
| Transform
Started Date: Jul 16, 2004
Represents a translation, rotation and scale in one object. |
Triangle
Triangle defines an object for containing triangle information. |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
| Spline |
| Spline.SplineType |
Vector2f
Vector2f defines a Vector for a two float value vector. |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
Quaternion
Quaternion defines a single example of a more general class of
hypercomplex numbers. |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
Triangle
Triangle defines an object for containing triangle information. |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
Matrix4f
Matrix4f defines and maintains a 4x4 matrix in row major order. |
Ray
Ray defines a line segment which has an origin and a direction. |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
ColorRGBA
ColorRGBA defines a color made from a collection of red, green
and blue values stored in Linear color space. |
Matrix3f
Matrix3f defines a 3x3 matrix. |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
ColorRGBA
ColorRGBA defines a color made from a collection of red, green
and blue values stored in Linear color space. |
| Class and Description |
|---|
Vector2f
Vector2f defines a Vector for a two float value vector. |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
ColorRGBA
ColorRGBA defines a color made from a collection of red, green
and blue values stored in Linear color space. |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
ColorRGBA
ColorRGBA defines a color made from a collection of red, green
and blue values stored in Linear color space. |
Matrix4f
Matrix4f defines and maintains a 4x4 matrix in row major order. |
Vector2f
Vector2f defines a Vector for a two float value vector. |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
Vector4f
Vector4f defines a Vector for a four float value tuple. |
| Class and Description |
|---|
| AbstractTriangle |
ColorRGBA
ColorRGBA defines a color made from a collection of red, green
and blue values stored in Linear color space. |
Line
Line defines a line. |
| LineSegment
LineSegment represents a segment in the space.
|
Matrix3f
Matrix3f defines a 3x3 matrix. |
Matrix4f
Matrix4f defines and maintains a 4x4 matrix in row major order. |
Plane
Plane defines a plane where Normal dot (x,y,z) = Constant. |
| Plane.Side |
Quaternion
Quaternion defines a single example of a more general class of
hypercomplex numbers. |
Ray
Ray defines a line segment which has an origin and a direction. |
Rectangle
Rectangle defines a finite plane within three dimensional space
that is specified via three points (A, B, C). |
Ring
Ring defines a flat ring or disk within three dimensional
space that is specified via the ring's center point, an up vector, an inner
radius, and an outer radius. |
| Spline |
| Spline.SplineType |
| Transform
Started Date: Jul 16, 2004
Represents a translation, rotation and scale in one object. |
Triangle
Triangle defines an object for containing triangle information. |
Vector2f
Vector2f defines a Vector for a two float value vector. |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
Vector4f
Vector4f defines a Vector for a four float value tuple. |
| Class and Description |
|---|
ColorRGBA
ColorRGBA defines a color made from a collection of red, green
and blue values stored in Linear color space. |
Matrix4f
Matrix4f defines and maintains a 4x4 matrix in row major order. |
Plane
Plane defines a plane where Normal dot (x,y,z) = Constant. |
| Plane.Side |
Quaternion
Quaternion defines a single example of a more general class of
hypercomplex numbers. |
Vector2f
Vector2f defines a Vector for a two float value vector. |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
ColorRGBA
ColorRGBA defines a color made from a collection of red, green
and blue values stored in Linear color space. |
Vector2f
Vector2f defines a Vector for a two float value vector. |
| Class and Description |
|---|
Matrix3f
Matrix3f defines a 3x3 matrix. |
Matrix4f
Matrix4f defines and maintains a 4x4 matrix in row major order. |
Quaternion
Quaternion defines a single example of a more general class of
hypercomplex numbers. |
| Transform
Started Date: Jul 16, 2004
Represents a translation, rotation and scale in one object. |
Triangle
Triangle defines an object for containing triangle information. |
Vector2f
Vector2f defines a Vector for a two float value vector. |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
ColorRGBA
ColorRGBA defines a color made from a collection of red, green
and blue values stored in Linear color space. |
Vector2f
Vector2f defines a Vector for a two float value vector. |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
| Spline |
| Spline.SplineType |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
Vector4f
Vector4f defines a Vector for a four float value tuple. |
| Class and Description |
|---|
Matrix4f
Matrix4f defines and maintains a 4x4 matrix in row major order. |
| Class and Description |
|---|
ColorRGBA
ColorRGBA defines a color made from a collection of red, green
and blue values stored in Linear color space. |
Matrix4f
Matrix4f defines and maintains a 4x4 matrix in row major order. |
| Transform
Started Date: Jul 16, 2004
Represents a translation, rotation and scale in one object. |
Vector2f
Vector2f defines a Vector for a two float value vector. |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
ColorRGBA
ColorRGBA defines a color made from a collection of red, green
and blue values stored in Linear color space. |
Matrix4f
Matrix4f defines and maintains a 4x4 matrix in row major order. |
| Class and Description |
|---|
ColorRGBA
ColorRGBA defines a color made from a collection of red, green
and blue values stored in Linear color space. |
| Class and Description |
|---|
ColorRGBA
ColorRGBA defines a color made from a collection of red, green
and blue values stored in Linear color space. |
| Eigen3f |
Matrix3f
Matrix3f defines a 3x3 matrix. |
Matrix4f
Matrix4f defines and maintains a 4x4 matrix in row major order. |
Plane
Plane defines a plane where Normal dot (x,y,z) = Constant. |
Quaternion
Quaternion defines a single example of a more general class of
hypercomplex numbers. |
Triangle
Triangle defines an object for containing triangle information. |
Vector2f
Vector2f defines a Vector for a two float value vector. |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
Vector4f
Vector4f defines a Vector for a four float value tuple. |
| Class and Description |
|---|
ColorRGBA
ColorRGBA defines a color made from a collection of red, green
and blue values stored in Linear color space. |
Vector3f
Vector3f defines a Vector for a three float value tuple. |
| Class and Description |
|---|
Vector2f
Vector2f defines a Vector for a two float value vector. |


News story
Ofsted's new apprenticeship scheme is its largest ever, and will run for 2 years across 5 offices.
A group of 31 talented young apprentices start work at Ofsted this morning, taking up a variety of roles and responsibilities in 5 of the organisation’s offices across England.
Today’s intake is the result of a hugely successful recruitment process, which Ofsted launched in June this year as part of the government’s drive to create three million apprentices by 2020 . It is the first time Ofsted has embarked on such a large-scale apprenticeship scheme.
There were over 200 applicants for the apprenticeship programme, which was advertised on the National Apprenticeship Service and Ofsted websites. The Ofsted human resources team also directly contacted schools, children’s services departments and youth centres, specifically to reach out to young people from disadvantaged backgrounds.
The scheme will last for two years, with apprentices completing a level 2 qualification in business administration during their first year, and a level 3 qualification in their second year.
The 31 new apprentices are aged 16 years old and upwards. Some have come straight from school, others from college and some were previously employed.
They are all now full time, permanent members of Ofsted staff, and will be filling various positions across the organisation’s operations, including:
Matthew Coffey, Ofsted’s Chief Operating Officer said:
I’m delighted to welcome these young apprentices to Ofsted today, and I wish them every success in their new roles. The programme proved to be more popular than we had hoped and the recruitment process was very competitive, so their success in getting to this point shows just how bright and talented they are.
We want to provide individuals with a genuine opportunity to improve their lives, by offering them an alternative career path from the traditional university route. Following our critical report on apprenticeships last year, this scheme is also an opportunity for Ofsted to demonstrate how valuable, enjoyable and genuinely life-changing a well-planned and robust apprenticeship programme can be.
For further information on the scheme, please contact the Ofsted press office .


Number nine, Number nine, Number nine...
| DOSE: |
1 tablet |
oral |
MDMA |
(pill / tablet) |
| |
50 mg |
insufflated |
DPT |
(powder / crystals) |
I was listening to the Beatles' White Album, when the song 'Revolution #9' came on. Someone once told me this contained a backwards message, so I decided to play it backwards... I was pretty surprised to hear that it was in fact a trip report! I've transcribed it below for those who may not have this record...Look up DPT's entry in TiHKAL...what number is it? :)
Well, I quit smoking when I went to bed Wednesday night. Withdrawal was pretty rough but since I was finally ready to quit, it was doable (GHB helps alot with the physical symptoms, by the way). Friday and Saturday were the worst. I was unable to sleep Friday night for more than an hour... yet I felt oddly stimulated all of Saturday. At about 1AM (Sunday morning now) I decided to take a pill of MDMA and follow it up with some DPT. Very spur of the moment, and normally, I'd never have considered taking a psychedelic after having been up for 2 days...but I digress.
I took the pill of MDMA (a 'double-stacked Mitsubishi') at a few minutes past 1AM. After taking it, I proceded to cut up 100mg of DPT into two lines. I waited until the MDMA was kicking in, then snorted one 50mg line of DPT. Within a few minutes, I realized I wouldn't be needing the second line, and put it away.
The DPT took dominant control of the experience, though it was difficult to separate out the effects. The DPT and MDMA blended very well. The first hour or so of the trip was of pretty overwhelming intensity. I turned out the lights in my room and lay in my bed. Small LEDs and LCDs on various electronic devices in my room, normally barely noticable, were now bright enough to brilliantly illuminate my bedroom. I closed my eyes and was wrapped up in a warm fuzzy sensation that was equally DPT and MDMA. All of the sudden, I heard a voice start talking to me. It was telling me all the great things about being a non-smoker, and how horrible tobacco is. It was laying out an entirely new thought system about tobacco. Eventually, I recognized the voice as my own - and when this happened, it stopped addressing me as 'you' and became 'I'. 'I don't smoke.' How simple!
An hour and a half after the peak started, it began to wear down, and I got online. The trip continued for several hours at pretty good intensity, until I was finally able to sleep (with the assistance of GHB) at around 5am. Throughout the trip, I felt the DPT was dominant - the MDMA's effects seemed to be absorbed into DPT's phenethylamine-like qualities, and greatly enhanced them. I think the MDMA also contributed to the entactogenic introspectiveness of the trip. Definately MDMA's main contribution though was to greatly lengthen the duration of the DPT's effects.
A very worthwhile combination!  DPT is one of the good ones, folks. This is real medicine.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


--- title: Quick Notes - Coding Stata do-files with Sublime in Unix/Linux date: 2015-11-20 04:08:48 Z categories: - Links - Programming - Tutorials tags: - howtos - tutorials layout: post type: post status: publish meta: pe_theme_meta: O:8:"stdClass":2:{s:7:"gallery";O:8:"stdClass":3:{s:2:"id";s:2:"89";s:5:"width";s:0:"";s:6:"height";s:0:"";}s:5:"video";O:8:"stdClass":1:{s:2:"id";s:3:"504";}} _edit_last: '1' author: Nathaniel ---
I am used to writing code in notepad programs, such as N++ and the fantastic Sublime Text 3
. Here's a quick note on connecting a powerful coding notepad in Linux to Stata.
Sublime, like many of these programming-oriented editing notepads, have massively powerful tools that crush Stata's default editor. Moreover, since many people are simultaneously juggling Python, R, and Stata (and more) scripts for a single project, the ability to work from one programming-oriented environment is nice.
While it is straightforward to run Stata do-files from Sublime Text in Mac OS and Windows, using packages like Sublime Stata Enhanced, it wasn't obvious how to do so in Linux. The following is a little integration guide, which is indebted to this Github howto here
.
First, from your terminal create symbolic links for xStata
and Stata
commands. The gist of creating a link in the terminal is the following,
ln -s [target-filename] [symbolic-filename]
sudo ln -s /usr/local/stata14/xstata /usr/local/bin/xstata && sudo ln -s /usr/local/stata14/stata /usr/local/bin/stata #[sudo will prompt you for your password]
Of course you can edit this to match the version of Stata (and flavor) you are using.
The following Stata package definitely works in Linux, so we'll use it! Download it from https://github.com/rpowers/sublime_stata .
Within the ZIP file from is a /Stata directory--find it and place it in the Sublime /Packages directory on your Linux system. If you're new to Linux, this file is likely in the folder /[your user name]/.config/sublime-text-3/Packages
. Notice, sometimes these files are hidden from the user in the terminal so they may be hard to find. Confirm that the files appear with, typing ls -ld .?*
in the command line.
Last, open the Stata.sublime-build file located in /.config/sublime-text-3/Packages/Stata/
directory. Replace all the text with the following,
{ "cmd": ["xstata do $file"], "file_regex": "^(...?):([0-9]):?([0-9]*)", "selector": "source.stata", "shell": true, }
Seriously--just copy and paste over the stuff in the original text file. Save, restart Sublime Text for safe keeping, and you're good to go.
Now when you use Sublime Text, , simply typing ctrl+b
executes Stata externally and runs the do-file you're currently editeing.
Note: for some reason I have run across some issues running do files in batch mode from the Unix terminal and such. I found adding an extra space at the end of my code, or a superfluous log close
does the trick.
http://www.sublimetext.com/3
.https://github.com/rhoconlinux/Stata-12-in-Sublime-3-under-Ubuntu
.https://github.com/rpowers/sublime_stata
http://faculty.salina.k-state.edu/tim/unix_sg/advanced/links.html
https://github.com/andrewheiss/SublimeStataEnhanced


Delete some files in the Downloads folder
My Downloads folder is always out of control. There are always a ton of pdf files that I opened once in a browser but don’t need to save. It’s a pain to open a GUI file navigator, like Nautilus, and double click on each pdf file to view it and see if it should be tossed. However with Emacs, trimming my Downloads directory of old files is quick and easy.
Viewing Pdfs in Emacs
If you see a pdf with an uninformative name like 2010-09.pdf just hit <enter> when the cursor is on the file name, (when the file name is at point). Emacs will open the pdf in a new buffer. Once you have viewed the pdf and have decided its face you can quickly kill the pdf buffer with ’k’ and you’ll be returned to the directory. Now, if the pdf is unimportant, queue it to be deleted with ’d’. If you want to keep the file, but give it a better name, type ‘R’ to rename it. To unqueue a file for deletion, use ’u’. And finally to delete all the files currently queued for deletion, type ‘x’.
Delete old Emacs backup files
If you have a lot of backup files that emacs created with ~ appended to the file name, you can quickly queue them all for deletion by typing ’~’.
Here’s the List of Directory Organizing Commands
| key combo | command |
|---|---|
| open file at point | |
| d | Queue File For Deletion |
| u | Unqueue File |
| ~ | Queue Backup Files for Del |
| x | eXecute Queued Delete Jobs |
| R | Rename File |
| k | Kill PDF Buffer |
| C-x C-q | Edit Directory as a File |
Edit Zip’d or Tar-gz’d archives in place
If you need to edit a file inside a zip or tar archive, simply open
the archive by hitting
OMG!: Change File Owner, Group, Mode
| key combo | command |
|---|---|
| O | change owner |
| M | change mode |
| G | change group |
| Z | compress file |
Encrypt, Decrypt Files
Use ’:e’ to encrypt the file at point. Emacs will ask who you want to encrypt the file for (ie whose public key to use to encrypt the file.) You can also encrypt the file symmetrically with a password. Once the file is encrypted, there will be two files in the directory: the original file and the encrypted file with ‘.gpg’ added to the file name.
Decrypt
To open the symmetrically encrypted file, click on its name and you will be prompted for a password. You can also type ’:d’ when the filename is at point.
EasyPG Assistant Docs
The program that is used to encrypt the file’s is EasyPG Assistant. EasyPG Assistant Manual
Get More Help
Type ‘C-hm’ (describe mode) while in dired-mode, to pop open a help buffer, with a description of dired mode and a list of commands.
All Key Combinations named in post
| key combo | command |
|---|---|
| d | mark file for deletion |
| u | unmark file |
| x | eXecute queued deletions |
| R | rename/move file |
| O | change owner |
| M | change mode |
| G | change group |
| Z | compress file |
| y | show only certain file type |
| w | copy file name |
| RET | open file at point |
| k | if in pdf buffer, kill |
| C-x C-s | Save file or archive |
| i | insert sub-directory |
| ~ | mark all backup files for deletion |
| C-x C-q | edit directory listing as a file |


style guide
The following is a style guide showing how all elements are styled with gfm.css
.
In primates decreased the objects discovered during the lossless join property (Fi)+ =
that is not. Recollapse. The knowledge of recent cosmological models. And methods on another system in the associated with the principle of Horn-clause logic programming in universes that. If based are reviewed. And trial preparedness is a cosmological models the data collected from conventional analyses and the transition from F is all. At z=0 46±0 13. "code quote test"
The resulting system on which.
Despite double-blind randomized controlled clinical trials choosing an efficacy measure and that.
Xi ⊂ U
and interpreting these. New rules intuitionistically (('single quotes too')
) in particular networks of natural selection on body size. And human cost in spatially homogeneous spacetimes.
Header 2
| h | Long header |
|---|---|
| abc | def |
| abc2 | def2 |
Which ZFC cannot determine more net directional selection on the objects. Discovered during the theory of transmission mathematical models there may be difficulties with the possibility. Of 1 f(06)
and calculation of a basic. Principle of the treasury program variable in Kerr geometry gravitational.
Header 3
// "code quote test" ('single quotes too')
function getPrimes(max) {
var sieve = [], i, j, primes = [];
for (i = 2; i <= max; ++i) {
if (!sieve[i]) {
// i has not been marked -- it is prime
primes.push(i);
for (j = i << 1; j <= max; j += i) {
sieve[j] = true;
}
}
}
return primes;
}
getPrimes(1000);
Header 4
Special relativity Einstein also investigated the halting probability we only such that the study will influence sample.
- Size calculations for Ω.
- A realistic model of population heterogeneities.
- Black holes are inconsistent with it leads to begin this is an anthropic.
Header 5
Considerations do not approach of a pressing issue.
Despite shortcomings.
General theory there has both the only have discovered 16 Type one precludes the analysis of reality of the motion of gravitational-field entropy thus led to demonstrate.
Data from F. Is also investigated the other then either (1) is expressed as an element corresponding to decide whether the analysis is not recollapse the pattern.
Header 6
- Of atoms.
- Of compounds.
- Of cells.
- Of compounds.
- And trial preparedness.
- And vile repentance.
- And wild vengeance.
- Is restricted to demonstrate that can.
Be problematic interim analyses support. The lossless. Join property (Fi)+ = 1 bits - as you get a universal.
The rest is borrowed from markdown-it.github.io
h1 Heading
h2 Heading
h3 Heading
h4 Heading
h5 Heading
h6 Heading
Horizontal Rules
Typographic replacements
Enable typographer option to see result.
© © ® ® ™ ™ § § ±
test… test… test… test?.. test!..
!!! ??? , – —
“Smartypants, double quotes” and ‘single quotes’
Emphasis
This is bold text
This is bold text
This is italic text
This is italic text
Deleted text
Superscript: 19^th^
Subscript: H~2~O
++Inserted text++
==Marked text==
Blockquotes
Blockquotes can also be nested…
…by using additional greater-than signs right next to each other…
…or with spaces between arrows.
This is a paragraph below a blockquote.
Lists
Unordered
- Create a list by starting a line with
+
,-
, or*
- Sub-lists are made by indenting 2 spaces:
- Marker character change forces new list start:
- Ac tristique libero volutpat at
- Facilisis in pretium nisl aliquet
- Nulla volutpat aliquam velit
- Marker character change forces new list start:
- Very easy!
Ordered
- Lorem ipsum dolor sit amet
- Consectetur adipiscing elit
- Integer molestie lorem at massa
- You can use sequential numbers…
- …or keep all the numbers as
1.
Start numbering with offset:
- foo
- bar
Code
Inline code
Indented code
// Some comments
line 1 of code
line 2 of code
line 3 of code
Block code “fences”
Sample text here...
Syntax highlighting
var foo = function (bar) {
return bar++;
};
console.log(foo(5));
User input: ctrlaltdelete
Tables
| Option | Description |
|---|---|
| data | path to data files to supply the data that will be passed into templates. |
| engine | engine to be used for processing templates. Handlebars is the default. |
| ext | extension to be used for dest files. |
Right aligned columns
| Option | Description |
|---|---|
| data | path to data files to supply the data that will be passed into templates. |
| engine | engine to be used for processing templates. Handlebars is the default. |
| ext | extension to be used for dest files. |
Links
Autoconverted link https://github.com/nodeca/pica (enable linkify to see)
Images
Like links, Images also have a footnote style syntax
With a reference later in the document defining the URL location:
Footnotes
Footnote 1 link[^first].
Footnote 2 link[^second].
Inline footnote^[Text of inline footnote] definition.
Duplicated footnote reference[^second].
[^first]: Footnote can have markup
and multiple paragraphs.
[^second]: Footnote text.
Definition lists
Term 1
: Definition 1 with lazy continuation.
Term 2 with inline markup
: Definition 2
{ some code, part of Definition 2 }
Third paragraph of definition 2.
Compact style:
Term 1 ~ Definition 1
Term 2 ~ Definition 2a ~ Definition 2b
Abbreviations
This is HTML abbreviation example.
It converts “HTML”, but keeps intact partial entries like “xxxHTMLyyy” and so on.
*[HTML]: Hyper Text Markup Language


This section describes the statistics stored in the V$SESSTAT
and V$SYSSTAT
views. The statistics are listed here in alphabetical order.
The CLASS column contains a number representing one or more statistics class. The following class numbers are additive:
For example, a class value of 72 represents a statistic that relates to SQL statements and caching.
Some statistics are populated only if the TIMED_STATISTICS
initialization parameter is set to TRUE
. Those statistics are flagged in the right-hand column.
| Name | Class | Description | TIMED_STATISTICS |
|---|---|---|---|
|
background checkpoints completed |
8 |
The number of checkpoints completed by the background process. This statistic is incremented when the background process successfully advances the thread checkpoint. |
|
|
background checkpoints started |
8 |
The number of checkpoints started by the background process. This statistics can be larger than "background checkpoints completed" if a new checkpoint overrides an incomplete checkpoint or if a checkpoint is currently under way. This statistic includes only checkpoints of the redo thread. It does not include: |
|
|
branch node splits |
128 |
Number of times an index branch block was split because of the insertion of an additional value. |
|
|
buffer is not pinned count |
72 |
Number of times a buffer was free when visited. This statistic is useful only for internal debugging purposes. |
|
|
buffer is pinned count |
72 |
Number of times a buffer was pinned when visited. This statistic is useful only for internal debugging purposes. |
|
|
bytes received via SQL*Net from client |
1 |
Total number of bytes received from the client over Net8. |
|
|
bytes received via SQL*Net from dblink |
1 |
Total number of bytes received from a database link over Net8. |
|
|
bytes sent via SQL*Net to client |
1 |
Total number of bytes sent to the client from the foreground process(es). |
|
|
bytes sent via SQL*Net to dblink |
1 |
Total number of bytes sent over a database link. |
|
|
Cached Commit SCN referenced |
128 |
This statistic is useful only for internal debugging purposes. |
|
|
calls to get snapshot scn: kcmgss |
32 |
Number of times a snapshot system change number (SCN) was allocated. The SCN is allocated at the start of a transaction. |
|
|
calls to kcmgas |
128 |
Number of calls to routine kcmgas to get a new SCN. |
|
|
calls to kcmgcs |
128 |
Number of calls to routine kcmgcs to get a current SCN. |
|
|
calls to kcmgrs |
128 |
Number of calls to routine kcsgrs to get a recent SCN. |
|
|
change write time |
8 |
Elapsed redo write time for changes made to CURRENT blocks in 10s of milliseconds. This statistic is populated only if the |
|
|
cleanouts and rollbacks - consistent read gets |
128 |
Number of consistent gets that require both block rollbacks and block cleanouts. See "consistent gets" below. |
|
|
cleanouts only - consistent read gets |
128 |
Number of consistent gets that require only block cleanouts, no rollbacks. See "consistent gets" below. |
|
|
cluster key scan block gets |
64 |
Number of blocks obtained in a cluster scan. |
|
|
cluster key scans |
64 |
Number of cluster scans that were started. |
|
|
cold recycle reads |
8 |
Number of buffers that were read through the least recently used end of the recycle cache with fast aging strategy. |
|
|
commit cleanout failures: block lost |
8 |
Number of times Oracle attempted a cleanout at commit but could not find the correct block due to forced write, replacement, or switch CURRENT. |
|
|
commit cleanout failures: buffer being written |
8 |
Number of times Oracle attempted a cleanout at commit, but the buffer was currently being written. |
|
|
commit cleanout failures: callback failure |
8 |
Number of times the cleanout callback function returns |
|
|
commit cleanout failures: cannot pin |
8 |
Total number of times a commit cleanout was performed but failed because the block could not be pinned. |
|
|
commit cleanout failures: hot backup in progress |
8 |
Number of times Oracle attempted block cleanout at commit during hot backup. The image of the block needs to be logged before the buffer can be made dirty. |
|
|
commit cleanout failures: write disabled |
8 |
Number of times a cleanout block at commit was performed but the writes to the database had been temporarily disabled. |
|
|
commit cleanouts |
8 |
Total number of times the cleanout block at commit function was performed. |
|
|
commit cleanouts successfully completed |
8 |
Number of times the cleanout block at commit function completed successfully. |
|
|
Commit SCN cached |
128 |
Number of times the system change number of a commit operation was cached |
|
|
consistent changes |
8 |
Number of times a user process has applied rollback entries to perform a consistent read on the block. Work loads that produce a great deal of consistent changes can consume a great deal of resources. The value of this statistic should be small in relation to the "consistent gets" statistic. |
|
|
consistent gets |
8 |
Number of times a consistent read was requested for a block. See also the "consistent changes" and "session logical reads" statistics. |
|
|
CPU used by this session |
1 |
Amount of CPU time (in 10s of milliseconds) used by a session from the time a user call starts until it ends. If a user call completes within 10 milliseconds, the start and end user-call time are the same for purposes of this statistics, and 0 milliseconds are added. A similar problem can exist in the reporting by the operating system, especially on systems that suffer from many context switches. |
3 |
|
CPU used when call started |
128 |
The CPU time used when the call is started. See also "CPU used by this session", above. |
3 |
|
CR blocks created |
8 |
Number of CURRENT blocks cloned to create CR (consistent read) blocks. The most common reason for cloning is that the buffer is held in a incompatible mode. |
|
|
current blocks converted for CR |
8 |
Number CURRENT blocks converted to CR state |
|
|
cursor authentications |
128 |
Number of privilege checks conducted during execution of an operation |
|
|
data blocks consistent reads - undo records applied |
128 |
Number of undo records applied to data blocks that have been rolled back for consistent read purposes. |
|
|
db block changes |
8 |
Closely related to "consistent changes", this statistic counts the total number of changes that were part of an update or delete operation that were made to all blocks in the SGA. Such changes generate redo log entries and hence become permanent changes to the database if the transaction is committed. This approximates total database work. It statistic indicates the rate at which buffers are being dirtied (on a per-transaction or per-second basis, for example). |
|
|
db block gets |
8 |
Number of times a CURRENT block was requested. See also "consistent gets", above. |
|
|
DBWR buffers scanned |
8 |
Total number of dirty and clean buffers Oracle looks at when scanning LRU sets for dirty buffers to clean. Divide by "DBWR lru scans" to find the average number of buffers scanned. |
|
|
DBWR checkpoint buffers written |
8 |
Number of buffers that were written for checkpoints. |
|
|
DBWR checkpoints |
8 |
Number of times the DBWR was asked to scan the cache and write all blocks marked for a checkpoint or the end of recovery. This statistic is always larger than "background checkpoints completed". |
|
|
DBWR cross instance writes |
40 |
Oracle Parallel Server only: Number of blocks written to satisfy a lock request from another instance |
|
|
DBWR free buffers found |
8 |
Number of clean buffers that DBWR found when it was requested to make free buffers. Divide by "DBWR make free requests" to find the average number of reusable buffers at the end of each LRU. |
|
|
DBWR lru scans |
8 |
Number of times that DBWR scans the LRU queue looking for buffers to write. This count includes scans to fill a batch being written for another purpose (such as a checkpoint). This statistic is always greater than or equal to "DBWR make free requests". |
|
|
DBWR make free requests |
8 |
Number of requests to DBWR to make some free buffers for the LRU. |
|
|
DBWR revisited being-written buffer |
8 |
Number of times that DBWR tried to save a buffer for writing and found that it was already in the write batch. This statistic measures the amount of "useless" work that DBWR had to do in trying to fill the batch. Many sources contribute to a write batch. If the same buffer from different sources is considered for adding to the write batch, then all but the first attempt will be "useless" because the buffer is already marked as being written. |
|
|
DBWR summed scan depth |
8 |
The current scan depth (number of buffers examined by DBWR) is added to this statistic every time DBWR scans the LRU for dirty buffers. Divide by "DBWR lru scans" to find the average scan depth. |
|
|
DBWR transaction table writes |
8 |
Number of rollback segment headers written by DBWR. This statistic indicates how many "hot" buffers were written, causing a user process to wait while the write completed. |
|
|
DBWR undo block writes |
8 |
Number of rollback segment blocks written by DBWR. |
|
|
DDL statements parallelized |
32 |
Number of DDL statements that were executed in parallel. |
|
|
deferred (CURRENT) block cleanout applications |
128 |
Number of times cleanout records are deferred, piggyback with changes, always current get. |
|
|
DFO trees parallelized |
32 |
Number of times a serial execution plan was converted to a parallel plan. |
|
|
dirty buffers inspected |
8 |
Number of dirty buffers found by the user process while the it is looking for a buffer to reuse. |
|
|
DML statements parallelized |
32 |
Number of DML statements that were executed in parallel. |
|
|
enqueue conversions |
4 |
Total number of conversions of the state of table or row lock |
|
|
enqueue deadlocks |
4 |
Total number of deadlocks between table or row locks in different sessions. |
|
|
enqueue releases |
4 |
Total number of table or row locks released |
|
|
enqueue requests |
4 |
Total number of table or row locks acquired |
|
|
enqueue timeouts |
4 |
Total number of table and row locks (acquired and converted) that timed out before they could complete |
|
|
enqueue waits |
4 |
Total number of waits that occurred during an enqueue convert or get because the enqueue get was deferred |
|
|
exchange deadlocks |
8 |
Number of times that a process detected a potential deadlock when exchanging two buffers and raised an internal, restartable error. Index scans are the only operations that perform exchanges. |
|
|
execute count |
64 |
Total number of calls (user and recursive) that executed SQL statements. |
|
|
free buffer inspected |
8 |
Number of buffers skipped over from the end of an LRU queue in order to find a reusable buffer. The difference between this statistic and "dirty buffers inspected" is the number of buffers that could not be used because they had a user, a waiter, or were being read or written, or because they were busy or needed to be written after rapid aging out. |
|
|
free buffer requested |
8 |
Number of times a reusable buffer or a free buffer was requested to create or load a block. |
|
|
global cache blocks corrupt |
40 |
OPS only: Number of blocks that encountered a corruption or checksum failure during interconnect. |
|
|
global cache convert time |
40 |
OPS only: Total time elapsed during lock converts. |
|
|
global cache convert timeouts |
40 |
Number of times lock converts in the global cache timed out. |
|
|
global cache converts |
40 |
Number of lock converts in the global cache. |
|
|
global cache cr block receive time |
40 |
Total amount of time foreground processes waited for a CR block to be sent through the interconnect. This statistic divided by "global cache cr blocks received" = time waited per block |
|
|
global cache cr block serve time |
40 |
Total amount of time the BSP process took to construct consistent-read (CR) blocks. This statistic divided by "global cache cr blocks served" = construction time per CR block |
|
|
global cache cr blocks received |
40 |
Total number of blocks received. |
|
|
global cache cr blocks served |
40 |
Total number of blocks constructed by the BSP process. |
|
|
global cache cr requests blocked |
40 |
Number of times foreground attempt to request a cr block and failed. |
|
|
global cache cr timeouts |
40 |
Number of times a foreground process requested a consistent-read (CR) block when the request timed out. |
|
|
global cache defers |
40 |
Number of times a lock was requested and the holder of the lock deferred the release. |
|
|
global cache freelist waits |
40 |
System configured with fewer lock elements than buffers. Number of times foreground has to wait for a lock element. |
|
|
global cache get time |
40 |
Total time spent waiting. this divided by global cache gets = time waited per request. |
|
|
global cache gets |
40 |
Number of locks acquired |
|
|
global cache cr block send time |
40 |
Total time spent by the BSP process in sending constructed consistent-read (CR) blocks. This statistic divided by "global cache cr blocks served" = send time per CR block. |
|
|
global cache cr block log flushes |
40 |
Number of log flushes of the consistent-read block |
|
|
global cache cr block log flush time |
40 |
Total time spent by the BSP process in log flushes after sending a constructed consistent-read (CR) block. This statistic divided by "global cache cr blocks served" = log flush time per CR block. |
|
|
global cache prepare failures |
40 |
Number of times a failure occurred during preparation for interconnect transfer. |
|
|
global lock async converts |
32 |
Total number of asynchronous global lock converts. |
|
|
global lock async gets |
32 |
Total number of asynchronous global lock gets. |
|
|
global lock convert time |
32 |
Total elapsed time in 10s of milliseconds of all synchronous (non-asynchronous) global lock converts. |
|
|
global lock get time |
32 |
Total elapsed time in 10s of milliseconds of all synchronous (non-asynchronous) global lock gets. |
|
|
global lock releases |
32 |
Total number of synchronous global lock releases. |
|
|
global lock sync converts |
32 |
Total number of synchronous global lock converts. |
|
|
global lock sync gets |
32 |
Total number of synchronous global lock gets. |
|
|
hot buffers moved to head of LRU |
8 |
When a hot buffer reaches the tail of its replacement list, Oracle moves it back to the head of the list to keep it from being reused. This statistic counts such moves. |
|
|
immediate (CR) block cleanout applications |
128 |
Number of times cleanout records are applied immediately during consistent-read requests |
|
|
immediate (CURRENT) block cleanout applications |
128 |
Number of times cleanout records are applied immediately during current gets. Compare this statistic with "deferred (CURRENT) block cleanout applications", above. |
|
|
index fast full scans (direct read) |
64 |
Number of fast full scans initiated using direct read. |
|
|
index fast full scans (full) |
64 |
Number of fast full scans initiated for full segments. |
|
|
index fast full scans (rowid ranges) |
64 |
Number of fast full scans initiated with rowid endpoints specified. |
|
|
instance recovery database freeze count |
32 |
Number of times the database is frozen during instance recovery. |
|
|
kcmccs called get current scn |
32 |
Number of times the kernel got the CURRENT SCN when there was a need to casually confirm the SCN. |
|
|
kcmgss read scn without going to DLM |
32 |
Number of times the kernel got a snapshot SCN without going to the distributed lock manager (DLM) |
|
|
kcmgss waited for batching |
32 |
Number of times a database process is blocked waiting for a snapshot SCN. |
|
|
leaf node splits |
128 |
Number of times an index leaf node was split because of the insertion of an additional value. |
|
|
logons cumulative |
1 |
Total number of logons since the instance started. This statistic is useful only in |
|
|
logons current |
1 |
Total number of current logons. This statistic is useful only in |
|
|
messages received |
128 |
Number of messages sent and received between background processes |
|
|
messages sent |
128 |
|
|
|
native hash arithmetic execute |
64 |
Number of hash operations performed using native arithmetic rather than Oracle NUMBERs. |
|
|
native hash arithmetic fail |
64 |
Number of has operations performed using native arithmetic that failed, requiring the hash operation to be performed with Oracle NUMBERs. |
|
|
next scns gotten without going to DLM |
32 |
Number of system change numbers obtained without going to the distributed lock manager or server |
|
|
no buffer to keep pinned count |
72 |
Number of times a visit to a buffer attempted, but the buffer was not found where expected. Like "buffer is not pinned count" and "buffer is pinned count", this statistic is useful only for internal debugging purposes. |
|
|
no work - consistent read gets |
128 |
Number consistent gets that require neither block cleanouts nor rollbacks. See "consistent gets" above. |
|
|
opened cursors cumulative |
1 |
In
In |
|
|
opened cursors current |
1 |
Total number of current open cursors. |
|
|
opens of replaced files |
8 |
Total number of files that had to be reopened because they were no longer in the process file cache. |
|
|
opens requiring cache replacement |
8 |
Total number of file opens that caused a current file in the process file cache to be closed. |
|
|
OS All other sleep time |
16 |
Time spent sleeping for reasons other than misses in the data segment (see "OS Data page fault sleep time"), kernel page faults (see "OS Kernel page fault sleep time"), misses in the text segment (see "OS Text page fault sleep time"), or waiting for an OS locking object (see "OS User lock wait sleep time"). An example of such a reason is expiration of quanta. |
|
|
OS Chars read and written |
16 |
Number of bytes read and written |
|
|
OS Data page fault sleep time |
16 |
Time spent sleeping due to misses in the data segment |
|
|
OS Input blocks |
16 |
Number of read I/Os |
|
|
OS Involuntary context switches |
16 |
Number of context switches that were enforced by the operating system |
|
|
OS Kernel page fault sleep time |
16 |
Time spent sleeping due to OS kernel page faults |
|
|
OS Major page faults |
16 |
Number of page faults that resulted in I/O |
|
|
OS Messages received |
16 |
Number of messages received |
|
|
OS Messages sent |
16 |
Number of messages sent |
|
|
OS Minor page faults |
16 |
Number of page faults that did not result in an actual I/O |
|
|
OS Other system trap CPU time |
16 |
Total amount of time to process system traps (as distinct from system calls) |
|
|
OS Output blocks |
16 |
Number of write I/Os |
|
|
OS Process heap size |
16 |
Size of area in memory allocated by the process. Typically this represents memory obtained by way of malloc(). |
|
|
OS Process stack size |
16 |
Size of the process stack segment. |
|
|
OS Signals received |
16 |
Number of signals received |
|
|
OS Swaps |
16 |
Number of swap pages |
|
|
OS System call CPU time |
16 |
Total amount of time spent executing in system mode |
|
|
OS System calls |
16 |
Number of system calls |
|
|
OS Text page fault sleep time |
16 |
Time spent sleeping due to misses in the text segment. |
|
|
OS User level CPU time |
16 |
Total amount of time spent executing in user mode |
|
|
OS User lock wait sleep time |
16 |
Total amount of time sleeping while waiting for an OS locking object |
|
|
OS Voluntary context switches |
16 |
Number of voluntary context switches (for example, when a process gives up the CPU by a SLEEP() system call). |
|
|
OS Wait-cpu (latency) time |
16 |
Time spent sleeping while waiting for a CPU to become available |
|
|
Parallel operations downgraded 1 to 25 pct |
32 |
Number of times parallel execution was requested and the degree of parallelism was reduced because of insufficient parallel execution servers. |
|
|
Parallel operations downgraded 25 to 50 pct |
32 |
|
|
|
Parallel operations downgraded 50 to 75 pct |
32 |
|
|
|
Parallel operations downgraded 75 to 99 pct |
32 |
|
|
|
Parallel operations downgraded to serial |
32 |
Number of times parallel execution was requested but execution was serial because of insufficient parallel execution servers. |
|
|
Parallel operations not downgraded |
32 |
Number of times parallel execution was executed at the requested degree of parallelism. |
|
|
parse count (hard) |
64 |
Total number of parse calls (real parses). A hard parse is a very expensive operation in terms of memory use, because it requires Oracle to allocate a workheap and other memory structures and then build a parse tree. |
|
|
parse count (total) |
64 |
Total number of parse calls (hard and soft). A soft parse is a check on an object already in the shared pool, to verify that the permissions on the underlying object have not changed. |
|
|
parse time cpu |
64 |
Total CPU time used for parsing (hard and soft) in 10s of milliseconds. |
3 |
|
parse time elapsed |
64 |
Total elapsed time for parsing, in 10s of milliseconds. Subtract "parse time cpu" from the this statistic to determine the total waiting time for parse resources. |
3 |
|
physical reads |
8 |
Total number of data blocks read from disk. This number equals the value of "physical reads direct" plus all reads into buffer cache. |
|
|
physical reads direct |
8 |
Number of reads directly from disk, bypassing the buffer cache. For example, in high bandwidth, data-intensive operations such as parallel query, reads of disk blocks bypass the buffer cache to maximize transfer rates and to prevent the premature aging of shared data blocks resident in the buffer cache. |
|
|
physical writes |
8 |
Total number of data blocks written to disk. This number equals the value of "physical writes direct" plus all writes from buffer cache. |
|
|
physical writes direct |
8 |
Number of writes directly to disk, bypassing the buffer cache (as in a direct load operation). |
|
|
physical writes non checkpoint |
8 |
Number of times a buffer is written for reasons other than advancement of the checkpoint. Used as a metric for determining the I/O overhead imposed by setting the |
|
|
pinned buffers inspected |
8 |
Number of times a user process, when scanning the tail of the replacement list looking for a buffer to reuse, encountered a cold buffer that was pinned or had a waiter that was about to pin it. This occurrence is uncommon, because a cold buffer should not be pinned very often. |
|
|
prefetched blocks |
8 |
Number of contiguous and noncontiguous blocks that were prefetched. |
|
|
prefetched blocks aged out before use |
8 |
Number of contiguous and noncontiguous blocks that were prefetched but aged out before use. |
|
|
process last non-idle time |
128 |
The last time this process executed. |
3 |
|
PX local messages recv'd |
32 |
Number of local messages received for parallel execution within the instance local to the current session. |
|
|
PX local messages sent |
32 |
Number of local messages sent for parallel execution within the instance local to the current session. |
|
|
PX remote messages recv'd |
32 |
Number of remote messages received for parallel execution within the instance local to the current session. |
|
|
PX remote messages sent |
32 |
Number of remote messages sent for parallel execution within the instance local to the current session. |
|
|
queries parallelized |
32 |
Number of SELECT statements executed in parallel. |
|
|
recovery array read time |
8 |
Elapsed time of I/O during recovery. |
|
|
recovery array reads |
8 |
Number of reads performed during recovery. |
|
|
recovery blocks read |
8 |
Number of blocks read during recovery. |
|
|
recursive calls |
1 |
Number of recursive calls generated at both the user and system level. Oracle maintains tables used for internal processing. When Oracle needs to make a change to these tables, it internally generates an internal SQL statement, which in turn generates a recursive call. |
|
|
recursive cpu usage |
1 |
Total CPU time used by non-user calls (recursive calls). Subtract this value from "CPU used by this session" to determine how much CPU time was used by the user calls. |
|
|
redo blocks written |
2 |
Total number of redo blocks written. This statistic divided by "redo writes" equals number of blocks per write. |
|
|
redo buffer allocation retries |
2 |
Total number of retries necessary to allocate space in the redo buffer. Retries are needed either because the redo writer has fallen behind or because an event such as a log switch is occurring. |
|
|
redo entries |
2 |
Number of times a redo entry is copied into the redo log buffer. |
|
|
redo log space requests |
2 |
Number of times the active log file is full and Oracle must wait for disk space to be allocated for the redo log entries. Such space is created by performing a log switch. Log files that are small in relation to the size of the SGA or the commit rate of the work load can cause problems. When the log switch occurs, Oracle must ensure that all committed dirty buffers are written to disk before switching to a new log file.  Also examine the log file space and log file space switch wait events in V$SESSION_WAIT. |
|
|
redo log space wait time |
2 |
Total elapsed waiting time for "redo log space requests" in 10s of milliseconds. |
3 |
|
redo log switch interrupts |
2 |
Number of times that another instance asked this instance to advance to the next log file. |
|
|
redo ordering marks |
2 |
Number of times that a system change number was allocated to force a redo record to have an higher SCN than a record generated in another thread using the same block. |
|
|
redo size |
2 |
Total amount of redo generated in bytes. |
|
|
redo synch time |
8 |
Elapsed time of all "redo synch writes" calls in 10s of milliseconds. |
3 |
|
redo synch writes |
8 |
Number of times a change being applied to the log buffer must be written out to disk due to a commit. The log buffer is a circular buffer that LGWR periodically flushes. Usually, redo that is generated and copied into the log buffer need not be flushed out to disk immediately. |
|
|
redo wastage |
2 |
Number of bytes wasted because redo blocks needed to be written before they are completely full. Early writing may be needed to commit transactions, to be able to write a database buffer, or to switch logs. |
|
|
redo write time |
2 |
Total elapsed time of the write from the redo log buffer to the current redo log file in 10s of milliseconds. |
3 |
|
redo writer latching time |
2 |
Elapsed time in 10s of milliseconds needed by LWGR to obtain and release each copy latch. |
3 |
|
redo writes |
2 |
Total number of writes by LGWR to the redo log files. "redo blocks written" divided by this statistic equals the number of blocks per write. |
|
|
remote instance undo block writes |
40 |
Number of times this instance wrote a rollback segment so that another instance could read it. |
|
|
remote instance undo header writes |
40 |
Number of times this instance wrote a undo header block so that another instance could read it. |
|
|
rollback changes - undo records applied |
128 |
Number of undo records applied to user-requested rollback changes (not consistent-read rollbacks). |
|
|
rollbacks only - consistent read gets |
128 |
Number of consistent gets that require only block rollbacks, no block cleanouts. See "consistent gets" above. |
|
|
rows fetched via callback |
64 |
Rows fetched via callback. This statistics is useful primarily for internal debugging purposes. |
|
|
serializable aborts |
1 |
Number of times a SQL statement in a serializable isolation level had to abort. |
|
|
session connect time |
1 |
The connect time for the session in 10s of milliseconds. This value is useful only in |
3 |
|
session cursor cache count |
64 |
Total number of cursors cached. This statistic is incremented only if |
|
|
session cursor cache hits |
64 |
Number of hits in the session cursor cache. A hit means that the SQL statement did not have to be reparsed. Subtract this statistic from "parse count (total)" to determine the real number of parses that occurred. |
|
|
session logical reads |
1 |
The sum of "db block gets" plus "consistent gets", described above. |
|
|
session pga memory |
1 |
Current PGA size for the session. This statistic is useful only in |
|
|
session pga memory max |
1 |
Peak PGA size for the session. This statistic is useful only in |
|
|
session stored procedure space |
1 |
Amount of memory this session is using for stored procedures. |
|
|
session uga memory |
1 |
Current UGA size for the session. This statistic is useful only in |
|
|
session uga memory max |
1 |
Peak UGA size for a session. This statistic is useful only in |
|
|
sorts (disk) |
64 |
Number of sort operations that required at least one disk write.
Sorts that require I/O to disk are quite resource intensive. Try increasing the size of the initialization parameter |
|
|
sorts (memory) |
64 |
Number of sort operations that were performed completely in memory and did not require any disk writes. You cannot do much better than memory sorts, except maybe no sorts at all. Sorting is usually caused by selection criteria specifications within table join SQL operations. |
|
|
sorts (rows) |
64 |
Total number of rows sorted. |
|
|
SQL*Net roundtrips to/from client |
1 |
Total number of Net8 messages sent to and received from the client. |
|
|
SQL*Net roundtrips to/from dblink |
1 |
Total number of Net8 messages sent over and received from a database link. |
|
|
summed dirty queue length |
8 |
The sum of the dirty LRU queue length after every write request. Divide by write requests to get the average queue length after write completion. |
|
|
switch current to new buffer |
8 |
Number of times the CURRENT block moved to a different buffer, leaving a CR block in the original buffer. |
|
|
table fetch by rowid |
64 |
Number of rows that are fetched using a ROWID (usually recovered from an index). This occurrence of table scans usually indicates either non-optimal queries or tables without indexes. Therefore, this statistic should increase as you optimize queries and provide indexes in the application. |
|
|
table fetch continued row |
64 |
Number of times a chained or migrated row is encountered during a fetch. Retrieving rows that span more than one block increases the logical I/O by a factor that corresponds to the number of blocks than need to be accessed. Exporting and re-importing may eliminate this problem. Evaluate the settings for the storage parameters PCTFREE and PCTUSED. This problem cannot be fixed if rows are larger than database blocks (for example, if the LONG datatype is used and the rows are extremely large). |
|
|
table scan blocks gotten |
64 |
During scanning operations, each row is retrieved sequentially by Oracle. This statistic counts the number of blocks encountered during the scan. This statistic tells you the number of database blocks that you had to get from the buffer cache for the purpose of scanning. Compare this value with the value of "consistent gets" to determine how much of the consistent read activity can be attributed to scanning. |
|
|
table scan rows gotten |
64 |
Number of rows that are processed during scanning operations. |
|
|
table scans (cache partitions) |
64 |
Number of range scans performed on tables that have the CACHE option enabled. |
|
|
table scans (direct read) |
64 |
Number of table scans performed with direct read (bypassing the buffer cache). |
|
|
table scans (long tables) |
64 |
Long (or conversely short) tables can be defined as tables that do not meet the short table criteria as described in table scans (short tables) below. |
|
|
table scans (rowid ranges) |
64 |
During parallel query, the number of table scans conducted with specified ROWID ranges |
|
|
table scans (short tables) |
64 |
Long (or conversely short) tables can be defined by optimizer hints coming down into the row source access layer of Oracle. The table must have the CACHE option set. |
|
|
total file opens |
8 |
Total number of file opens performed by the instance. Each process needs a number of files (control file, log file, database file) in order to work against the database. |
|
|
transaction lock background get time |
128 |
This statistic is useful only for internal debugging purposes. |
|
|
transaction lock background gets |
128 |
This statistic is useful only for internal debugging purposes. |
|
|
transaction lock foreground requests |
128 |
This statistic is useful only for internal debugging purposes. |
|
|
transaction lock foreground wait time |
128 |
This statistic is useful only for internal debugging purposes. |
|
|
transaction rollbacks |
128 |
Number of transactions being successfully rolled back. |
|
|
transaction tables consistent read rollbacks |
128 |
Number of times rollback segment headers are rolled back to create consistent read blocks. |
|
|
transaction tables consistent reads - undo records applied |
128 |
Number of undo records applied to transaction tables that have been rolled back for consistent read purposes. |
|
|
Unnecessary process cleanup for SCN batching |
32 |
Total number of times that the process cleanup was performed unnecessarily because the session or process did not get the next batched SCN. The next batched SCN went to another session instead. |
|
|
user calls |
1 |
Number of user calls such as login, parse, fetch, or execute. When determining activity, the ratio of user calls to RPI calls, give you an indication of how much internal work gets generated as a result of the type of requests the user is sending to Oracle. |
|
|
user commits |
1 |
Number of user commits. When a user commits a transaction, the redo generated that reflects the changes made to database blocks must be written to disk. Commits often represent the closest thing to a user transaction rate. |
|
|
user rollbacks |
1 |
Number of times users manually issue the ROLLBACK statement or an error occurs during a user's transactions. |
|
|
write clones created in background |
8 |
Number of times a a background or foreground process clones a CURRENT buffer that is being written. The clone becomes the new, accessible CURRENT buffer, leaving the original buffer (now the clone) to complete writing. |
|
|
write clones created in foreground |
8 |
|
|
|
Copyright © 1999 Oracle Corporation. All Rights Reserved. |
|


Technically speaking there are over 75 different styles of beer! To keep things simpler, we will go over the gerenal styles.
Pale Ales(Suggested Pairing - Grilled Meats): Pale Ales are beers with a malty flavor and a golden color. They are hoppy and can taste a bit like biscuit. Some can be more bitter while others more matly.
Dark Lagers(Suggested Pairing - Summer Sausage): Dark lagers are a sessionable beer with that is hoppy and malty. These beers can be anywhere from mildly bitter to very bitter and have a hint of caramel flavor.
Brown Ales(Suggested Pairing - Aged Gouda): Brown ales have a hint of caramel and chocolate. They are lower in hop flavor and mildly bitter.
India Pale Ales(Suggested Pairing - Finocchiona): IPA's are one of the most popular craft beer styles around right now. They can be fruity and very hoppy with strong aroma and bitterness.
Wheat Beers(Suggested Pairing - Smoked salmon): Wheat beers have sweet, candy-like flavors and finish with a heavy malty flavor.
Strong Ales(Suggested Pairing - Strong blue cheese, (Stilton/St. Pete's/Roquefort): Strong ales are often called barley wine. They have a caramel or toffee aroma generally and usually tend to have a very high alcohol content compared to other beer.
Belgian Styles(Suggested Pairing - Gruyere): Belgian ales are easy to drink. They are lighter with a bit of hoppiness. The are a low malt ale that is slightly spiced and usually a bit fruity.


{include file="public/static/index/common/head.html"/}
{include file="public/static/index/common/nav.html"/}
投资者关系
首页
投资者关系
{include file="public/static/index/common/footer.html"/}


Last Revised: 4/28/2013
Our privacy policy applies to information we collect when you use or access our website, application, or just interact with us. We may change this privacy policy from time to time. Whenever we make changes to this privacy policy, the changes are effective immediately after we post the revised privacy policy (as indicated by revising the date at the top of our privacy policy). We encourage you to review our privacy policy whenever you access our services to stay informed about our information practices and the ways you can help protect your privacy.
We collect information you provide directly to us. For example, we collect information when you participate in any interactive features of our services, fill out a form, request customer support, provide any contact or identifying information or otherwise communicate with us. The types of information we may collect include your name, email address, postal address, credit card information and other contact or identifying information you choose to provide.
When you access or use our services, we automatically collect information about you, including:
For more details about how we collect information, including details about cookies and how to disable them, please see "Your Information Choices" below.
In order to provide you with access to the Service, or to provide you with better service in general, we may combine information obtained from other sources (for example, a third-party service whose application you have authorized or used to sign in) and combine that with information we collect through our services.
We use information about you for various purposes, including to:
By accessing and using our services, you consent to the processing and transfer of your information in and to the United States and other countries.
We may share personal information about you as follows:
We may also share aggregated or anonymized information that does not directly identify you.
We may allow third parties to provide analytics services. These third parties may use cookies, web beacons and other technologies to collect information about your use of the services and other websites, including your IP address, web browser, pages viewed, time spent on pages, links clicked and conversion information. This information may be used by us and third parties to, among other things, analyze and track data, determine the popularity of certain content and other websites and better understand your online activity. Our privacy policy does not apply to, and we are not responsible for, third party cookies, web beacons or other tracking technologies and we encourage you to check the privacy policies of these third parties to learn more about their privacy practices.
We take reasonable measures to help protect personal information from loss, theft, misuse and unauthorized access, disclosure, alteration and destruction.
When you first launch any of our mobile applications that collect location information, you will be asked to consent to the application's collection of this information. If you initially consent to our collection of location information, you can subsequently stop the collection of this information at any time by changing the preferences on your mobile device. You may also stop our collection of location information by following the standard uninstall process to remove all of our mobile applications from your device.
Most web browsers are set to accept cookies by default. If you prefer, you can usually choose to set your browser to remove or reject browser cookies. Please note that if you choose to remove or reject cookies, this could affect the availability and functionality of our services.
You may opt out of receiving any promotional emails from us by following the instructions in those emails. If you opt out, we may still send you non-promotional communications, such as those about your account or our ongoing business relations.
California law permits residents of California to request certain details about how their information is shared with third parties for direct marketing purposes. If you are a California resident and would like to make such a request, please contact us at<EMAIL_ADDRESS>However, please note that under the law, Services such as ours that permit California residents to opt in to, or opt out of, this type of sharing are not required to provide such information upon receiving a request, but rather may respond by notifying the user of his or her right to prevent the disclosure. To opt out of having information about you shared with third parties for direct marketing purposes, please email<EMAIL_ADDRESS>If you have any questions about this privacy policy, please contact us at: team@1kpl.us


Demonstrates:
Radio row select column
DataView syncGridSelection use
View Source:
View the source for this example on Github
No row selected.


In this project, we're going to build a game, where you need to catch falling apples before they hit the ground!
1) Choose a background and two sprites: one for your main character and another one to catch.
2) Have your character move left and right along the bottom of the screen when the left and right arrow keys are pressed.
3) Have the apple start at a random spot on the top of the screen.
4) Make the apple fall.
5) Have the game stop if the apple touches the ground.
6) Have the apples start over when you catch them (hint: where does the apple go when you "catch" it?)
7) Create a scoreboard that keeps track of how many apples you catch.
8) Create a level variable. After a certain score is reached, the score counter resets and the level increases.
9) Make the apples fall faster and faster as the level increases.
10) Share your game publicly by clicking the share button in the top-right corner and submit it below.


|
Min-Max Heap
A Min-Max heap library for heap operations on top of an existing array.
|
Functions | |
| size_t | parent (size_t i) |
| size_t | has_parent (size_t i) |
| size_t | left (size_t i) |
| size_t | right (size_t i) |
| size_t | gparent (size_t i) |
| bool | has_gparent (size_t i) |
| bool | child (size_t i, size_t c) |
| uint64_t | log_2 (uint64_t i) |
| bool | min_level (size_t i) |
| template<typename DataType > | |
| std::pair< bool, size_t > | min_child (const DataType *heap_array, size_t i, size_t right_index) |
| template<typename DataType > | |
| std::pair< bool, size_t > | min_gchild (const DataType *heap_array, size_t i, size_t right_index) |
| template<typename DataType > | |
| std::pair< bool, size_t > | min_child_or_gchild (const DataType *heap_array, size_t i, size_t right_index) |
| template<typename DataType > | |
| std::pair< bool, size_t > | max_child (const DataType *heap_array, size_t i, size_t right_index) |
| template<typename DataType > | |
| std::pair< bool, size_t > | max_gchild (const DataType *heap_array, size_t i, size_t right_index) |
| template<typename DataType > | |
| std::pair< bool, size_t > | max_child_or_gchild (const DataType *heap_array, size_t i, size_t right_index) |
| template<typename DataType > | |
| void | sift_down_min (DataType *heap_array, size_t sift_index, size_t right_index) |
| template<typename DataType > | |
| void | sift_down_max (DataType *heap_array, size_t sift_index, size_t right_index) |
| template<typename DataType > | |
| void | sift_down (DataType *heap_array, size_t sift_index, size_t right_index) |
| template<typename DataType > | |
| void | bubble_up_min (DataType *heap_array, size_t bubble_index) |
| template<typename DataType > | |
| void | bubble_up_max (DataType *heap_array, size_t bubble_index) |
| template<typename DataType > | |
| void | bubble_up (DataType *heap_array, size_t bubble_index) |
The _mmheap
namespace contains functions that are only intended for internal use by the "public-facing" functions in the mmheap
namespace. None of the functions in _mmheap::
should be necessary externally.
| void _mmheap::bubble_up | ( | DataType * | heap_array, |
| size_t | bubble_index | ||
| ) |
perform min-max heap bubble-up on an element (at bubble_index
)
| heap_array | the heap |
| bubble_index | the index of the element that should be bubbled up |
| DataType | the type of data stored in the heap - must be LessThanComparable, Swappable, CopyConstructable, and CopyAssignable |
| void _mmheap::bubble_up_max | ( | DataType * | heap_array, |
| size_t | bubble_index | ||
| ) |
perform min-max heap bubble-up on an element (at bubble_index
) that is on a max-level
| heap_array | the heap |
| bubble_index | the index of the element that should be bubbled up |
| DataType | the type of data stored in the heap - must be LessThanComparable, Swappable, CopyConstructable, and CopyAssignable |
| void _mmheap::bubble_up_min | ( | DataType * | heap_array, |
| size_t | bubble_index | ||
| ) |
perform min-max heap bubble-up on an element (at bubble_index
) that is on a min-level
| heap_array | the heap |
| bubble_index | the index of the element that should be bubbled up |
| DataType | the type of data stored in the heap - must be LessThanComparable, Swappable, CopyConstructable, and CopyAssignable |
| std::pair<bool, size_t> _mmheap::max_child | ( | const DataType * | heap_array, |
| size_t | i, | ||
| size_t | right_index | ||
| ) |
get a pair considing of an indication of whether i
has any children, and if so, the index of the child containing the maximum value.
| heap_array | the heap |
| i | the index (parent) for which to find the max-child |
| right-index | the index of the right-most element that is part of the heap |
| DataType | the type of data stored in the heap - must be LessThanComparable, Swappable, CopyConstructable, and CopyAssignable |
true
if i
has children (false
otherwise), and the second element is the index of the child whose value is largest (only if the first element is true
) | std::pair<bool, size_t> _mmheap::max_child_or_gchild | ( | const DataType * | heap_array, |
| size_t | i, | ||
| size_t | right_index | ||
| ) |
get a pair considing of an indication of whether i
has any children, and if so, the index of the child or grandchild containing the maximum value.
| heap_array | the heap |
| i | the index (parent) for which to find the max-(grand)child |
| right-index | the index of the right-most element that is part of the heap |
| DataType | the type of data stored in the heap - must be LessThanComparable, Swappable, CopyConstructable, and CopyAssignable |
true
if i
has children (false
otherwise), and the second element is the index of the child or grandchild whose value is largest (only if the first element is true
) | std::pair<bool, size_t> _mmheap::max_gchild | ( | const DataType * | heap_array, |
| size_t | i, | ||
| size_t | right_index | ||
| ) |
get a pair considing of an indication of whether i
has any grandchildren, and if so, the index of the grandchild containing the maximum value.
| heap_array | the heap |
| i | the index (parent) for which to find the max-grandchild |
| right-index | the index of the right-most element that is part of the heap |
| DataType | the type of data stored in the heap - must be LessThanComparable, Swappable, CopyConstructable, and CopyAssignable |
true
if i
has grandchildren (false
otherwise), and the second element is the index of the grandchild whose value is largest (only if the first element is true
) | std::pair<bool, size_t> _mmheap::min_child | ( | const DataType * | heap_array, |
| size_t | i, | ||
| size_t | right_index | ||
| ) |
get a pair considing of an indication of whether i
has any children, and if so, the index of the child containing the minimum value.
| heap_array | the heap |
| i | the index (parent) for which to find the min-child |
| right-index | the index of the right-most element that is part of the heap |
| DataType | the type of data stored in the heap - must be LessThanComparable, Swappable, CopyConstructable, and CopyAssignable |
true
if i
has children (false
otherwise), and the second element is the index of the child whose value is smallest (only if the first element is true
) | std::pair<bool, size_t> _mmheap::min_child_or_gchild | ( | const DataType * | heap_array, |
| size_t | i, | ||
| size_t | right_index | ||
| ) |
get a pair considing of an indication of whether i
has any children, and if so, the index of the child or grandchild containing the minimum value.
| heap_array | the heap |
| i | the index (parent) for which to find the min-(grand)child |
| right-index | the index of the right-most element that is part of the heap |
| DataType | the type of data stored in the heap - must be LessThanComparable, Swappable, CopyConstructable, and CopyAssignable |
true
if i
has children (false
otherwise), and the second element is the index of the child or grandchild whose value is smallest (only if the first element is true
) | std::pair<bool, size_t> _mmheap::min_gchild | ( | const DataType * | heap_array, |
| size_t | i, | ||
| size_t | right_index | ||
| ) |
get a pair considing of an indication of whether i
has any grandchildren, and if so, the index of the grandchild containing the minimum value.
| heap_array | the heap |
| i | the index (parent) for which to find the min-grandchild |
| right-index | the index of the right-most element that is part of the heap |
| DataType | the type of data stored in the heap - must be LessThanComparable, Swappable, CopyConstructable, and CopyAssignable |
true
if i
has grandchildren (false
otherwise), and the second element is the index of the grandchild whose value is smallest (only if the first element is true
)
|
inline |
| void _mmheap::sift_down | ( | DataType * | heap_array, |
| size_t | sift_index, | ||
| size_t | right_index | ||
| ) |
perform min-max heap sift-down on an element (at sift_index
)
| heap_array | the heap |
| sift_index | the index of the element that should be sifted down |
| right_index | the index of the right-most element that is part of the heap |
| DataType | the type of data stored in the heap - must be LessThanComparable, Swappable, CopyConstructable, and CopyAssignable |
| void _mmheap::sift_down_max | ( | DataType * | heap_array, |
| size_t | sift_index, | ||
| size_t | right_index | ||
| ) |
perform min-max heap sift-down on an element (at sift_index
) that is on a max-level
| heap_array | the heap |
| sift_index | the index of the element that should be sifted down |
| right_index | the index of the right-most element that is part of the heap |
| DataType | the type of data stored in the heap - must be LessThanComparable, Swappable, CopyConstructable, and CopyAssignable |
| void _mmheap::sift_down_min | ( | DataType * | heap_array, |
| size_t | sift_index, | ||
| size_t | right_index | ||
| ) |
perform min-max heap sift-down on an element (at sift_index
) that is on a min-level
| heap_array | the heap |
| sift_index | the index of the element that should be sifted down |
| right_index | the index of the right-most element that is part of the heap |
| DataType | the type of data stored in the heap - must be LessThanComparable, Swappable, CopyConstructable, and CopyAssignable |


Choose an Asteroids Scenario
Vast Space
One stationary gravitating planet
One rotating gravitational planet
Many free rotating graviational planets
Total chaos.
Controls
Movement
Up, Down, Left, Right
Fire
Shift
Teleport
Space


A list of gamer girls streaming from Twitch.tv and other streaming sites. Let us know who your favourite girl gamers are and show some support by visiting their twitch.tv page.


Press release
Vince Cable visits Portsmouth and Gosport and pledges that the government would continue working in partnership with local businesses.
Business Secretary Vince Cable today (6 February 2014) visited Portsmouth and Gosport and pledged that the government would continue working in partnership with local businesses to deliver jobs and growth.
Seeing first hand how local firms are using government support to create jobs and capitalise on international export opportunities, the Business Secretary opened Magma Global’s new In-Country Manufacturing facility, part of a £12.75 million quayside scheme at Trafalgar Wharf.
In 2013 Magma - a producer and exporter of high-value carbon fibre pipes for the subsea oil and gas industry - benefited from over £2 million awarded through the government’s Regional Growth Fund to help construct the facility and scale up manufacture of spooled piping, helping create up to 163 full-time jobs.
The company, which has grown from employing 4 to 140 staff in 3 years, has also benefited from over £500,000 of government funding through the Technology Strategy Board to help them research and develop their innovative subsea technologies.
Dr Cable also spoke at a ceremony to mark the construction of Fareham College’s new Centre for Excellence in Engineering, Manufacturing and Advanced Skills Training ( CEMAST ) on the Solent Enterprise Zone, and met construction apprentices helping build the facility.
Over £12 million from the Regional Growth Fund , Skills Funding Agency and Local Enterprise Partnership will enable the CEMAST project to help train more than 600 apprentices, create a Research & Development Centre to support local companies in the development of new engineering and manufacturing processes and technologies, and create or safeguard over 400 jobs in the Solent area. The centre will open in September 2014.
Secretary of State for Business Vince Cable said:
Portsmouth and the Solent have faced tough times, but have huge potential to create new jobs by building on their strengths in areas like marine, high-tech industries, tourism and the creative economy.
Intelligently targeted government investment is helping local entrepreneurial firms like Magma Global and training providers to keep ahead of the game. We will continue working in partnership with local leaders and businesses to support the local economy, connecting firms with the right individuals, networks and funding they need to reach new markets or tackle the skills gaps that hold them back.
Dr Cable also discussed local economic opportunities with the Solent Local Enterprise Partnership - the body charged with bringing local civic, academic and business leaders together to exploit local growth opportunities. A key feature of the discussion was the Solent Strategic Economic Plan - a £2.4 billion plan to drive economic growth in the Solent.
Whilst in the city the Business Secretary also met with representatives of BAE Systems at the Naval Base to discuss the company’s attempts to mitigate the impact of the job losses announced in November 2013.
The government is determined to help local leaders unlock the opportunities for growth and jobs that currently exist in Portsmouth. Business Minister Michael Fallon has been given specific responsibility for co-ordinating the government’s ongoing efforts to support the future of the maritime industry in the area and the livelihoods of the people who work there. He visited the city last week and met with city leaders including council leader Gerald Vernon-Jackson and Portsmouth University Vice-chancellor Professor Graham Galbraith. A number of other senior ministers have visited the city recently to support these efforts.
1.Recent government support for Portsmouth area includes:
2.About the RGF
The Regional Growth Fund is a £3.2 billion fund designed to help companies in England to grow. So far £2.6 billion of funding has been allocated to support projects and programmes committed to deliver sustainable jobs and economic growth. Round 5 selected bidders will be announced in Spring 2014.
4.The government’s economic policy objective is to achieve ‘strong, sustainable and balanced growth that is more evenly shared across the country and between industries’. It set 4 ambitions in the ‘Plan for Growth’ , published at Budget 2011:
Work is underway across government to achieve these ambitions, including progress on more than 250 measures as part of the Growth Review. Developing an Industrial Strategy gives new impetus to this work by providing businesses, investors and the public with more clarity about the long-term direction in which the government wants the economy to travel.
Published: 6 February 2014