|
Polygon-Triangulate
1.0
C++ Implementation an efficient and modular polygon triangulation algorithm making use of DCEL; Time Complexity O(nlogn);
|
#include <bits/stdc++.h>
Go to the source code of this file.
Variables | |
| const long long | MOD =1000000007 |
| const long long | MAX =100005 |
| const long double | PI =3.14159265359 |
| const long double | G =9.807 |
| const long long | INF =1e18 |
| const long double | EPS =1e-6 |


Letters to My Husband's Mistress' will both shock and amaze you.  Immerse yourself in her story of deception and betrayal and witness the redemption gained through perseverance, faith, and unconditional love. A MUST READ!
Purchase the BookAfter 36 years of marriage, it took one match to completely incinerate my relationship: a mistress. The destruction left no hope of recovery or survival. The damage done by my husband and his mistress not only burned my children and myself, but friends and family members along the way. Unfortunately there were no smoke signals to warn us of this imminent wildfire. In the wake of my ex-husband’s affair, no one was safe from the flames.
Purchase on AmazonWorld traveled author and graduate of Georgia State University she earned her degree in Social Work with plans in the near future of completing her MSW. This author embarked on a new career and returned to school at age 55 graduating with honors one month after her 59th birthday. Being extremely passionate about the well being and education of all children, she created "Angela's Foundation of Hope" The mission is to empower young girls through education. The foundation would be awarding scholarships to assist teenage girls who possess the academic ability, drive, and determination to attend university but are financially unable to do so.
Follow me on Facebook
Send Me A Tweet
Empower young girls through education
Help fund Angelas Foundation of Hope
Send me an email, let me know how you liked the book.
123-456-6789


My twin brother and I were visiting the house of my friend Nat and her roommate Jess. We had been hanging out, talking and watching movies, singing, and generally having a good time. When 1AM rolled around and everyone admitted that the party better wind down -- we all had work in the morning. On a whim, Nat and Jess suggested that we smoke a little, since we hadn't earlier. My twin and I agreed enthusiastically, and we went up to Nat's room while Jess got her weed.
We smoked what little was left in the bowl in one round, and Jess repacked tightly. After a few passes I started to feel the effects, and as a seasoned smoker I could tell it was going to be a very physical high. Nat and Jess didn't smoke all that often, but they continued to keep up with me and my twin, who can smoke all day long. I started to get the giggles like crazy and everything was hilarious to me.
Around this time we stopped smoking, and I was really coming up fast. Nat asked if Jess was high, because she felt self-conscious that she was the only one. Nat takes insulin for diabetes, and also is on medication for her thyroid. As I said, the weed was very physical and I felt increased sensation in my arms and chest, and knew my heart was pounding. My twin and I were accustomed to weed of this kind and we weren't bothered by it, and knew it would pass; we were still having fun. Jess seemed to be fairly into her high, but she seemed to be having fun also.
Nat, however, was visibly shaken and looked up. I could see her heart racing in the hollow of her neck and could tell that she was worried by it. When asked what was wrong, she said that she felt sick to her stomach. I turned to talk to my brother and I felt a jab in my ribs. Nat had fallen onto the bed and her elbow was poking me pretty hard. 'That kinda hurts,' I said, and she mumbled an apology and stared off with a glazed look in her eye. She made a face as though she would vomit, so I sat her up and she protested mildly that she didn't want to hurt me. I was worried that she was going to have a bad time so I tried to rub her shoulders and give her a kiss, but she turned away and declined.
Jess and my twin had left, and Nat started to shift and sway while sitting against the wall. After a few moments, she leaned against me and said that she was sorry for not kissing me earlier. We then started making out passionately, and it felt wonderful. The effects of the weed were at its peak, and every touch felt electric. I felt like I was soft and floating over the bed, and her kisses were delecious. I totally forgot that she had been feeling bad. We started to get into heavy petting and neck biting, and we both ended up with our shirts off. I stopped to take a breath and asked how she was feeling, and she admitted that she was starting to feel sick to her stomach again.
Uh oh, I thought, and she told me that the only other time she had made out with somebody when she was high ended badly, and she said that it made her have bad flashbacks. 'Flashbacks to what?' Bad stuff, she said.  I started crying, overwhelmed with emotion. I apologized for anything anyone ever did to hurt her, that she didn't deserve it. She said that nothing I did was wrong, but I felt terrible.
She was still way out of it until 3AM, and we were both upset. I think that if she had a higher tolerance for weed, the whole night would have been more fun and nothing would have gone wrong. I also contribute part of the experience to the medication she is on. I would have had more fun myself if I hadn't felt so bad for her and empathized so deeply with her pain. I genuinely felt like everything was wrong.
We ended up sleeping over, with me holding her through the night and rubbing her back. I don't know how much she remembered the next morning, because she still seemed a little out of it.
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.


Cake
Home
(current)
Login
Register
Home
Our Stores
Our Cakes
My Profile
Add Cake
Browse Cake
About Us
Logout
@RenderBody()


Trushit Vaishnav In this video we are going to learn how to expand or we can say how to simplify a given set of algebraic factors.
For example, let us say I am having x minus one into x minus two.
What would be the usual process for this?
First of all, I would multiply this x into this x to get x two and I will mention the equal to sign.
Then I will multiply this x with this minus two to get minus two x.
Then I will be multiplying this minus one with this x, to get minus x.
Then I would multiply this minus one with this minus two to get plus two.
Later, the next step, x two remains as it is.
minus two x and minus x makes minus three x, plus two.
The process is really easy, and we could do it in a fairly simple way.
But here, there are only two factors that have to be multiplied, so that we could follow this process.
But what if we had some three or four factors to multiply?
Let us say I have one more over here, like say x minus three.
What I will have to do is, I will have to put a bracket over here, and I will have to continue multiplying these corresponding things, which actually means that I will have to reach through the step, and then I will have to perform similar operations with these two.
Now, here there were only two terms in one bracket and another two terms in another bracket.
Here we are having three terms in the first bracket, and two terms in the latter.
You will see that, as we move down, as the number of factors increases, the number of terms that has to be multiplied also goes up.
This makes things really complicated.
There is an easy way to avoid this hassle.
Let us see how.
Here, let us generalize this entire process first.
We will first derive our results and then see how this pattern actually works.
First of all, your first factor is in the form of ax plus b, and another is in the form of cx plus d, and a third one is in the form of ex plus f.
But these three factors, we can derive our results, and we can expand this method, even if you are having say four or five factors, or even any number of factors.
First, I will deal with this part.
So, ax into cx is equal to acx two and ax into d is adx, plus b into cx is bcx, plus b into d.
This forms first bracket, and multiply it by ex plus f.
Fine.
Now, simplifying this further, I will get acx two plus, taking x common, ad plus bc plus bd.
Then I get ex plus f.
Now, this thing you need to remember.
I will stop over here, and this is a really quick way to obtain the simplified form of multiplication of two factors.
Let's say I have two x plus one into five x plus three.
Rather than multiplying things correspondingly, what I can do is, a into c.
Let's look at this.
What is a into c?
It is a coefficient of x, and c is also a coefficient of x.
What we want is x two.
In this general form, you can see that when we are multiplying two factors, both of them having x, the highest power will be x two.
What would be its coefficient?
Multiplying its corresponding coefficients of five into two is ten.
Fine, ten plus next lower power would be x.
Now, you can update x, ad plus bc.
What is a into this term, plus b into this term?
A is a coefficient of x, multiplied by its constant part that is the part that does not have variable along with it of the second bracket, plus the constant part of the first bracket, multiplied by the part which is the coefficient of the variable in the second bracket.
Take the coefficient of x, that is a, into d.
Let's apply it over here.
Coefficient of x is two multiplied by three, so you get six.
Then take the coefficient of x on this bracket, so it's five and multiply it with one so this is it.
Then b into c.
What is b?
A constant part over here, and...
sorry, it's b into d.
What is b into d?
Constant part over here, and constant part over here.
We just change the color, the constant part over here and the constant part over here.
That is b into d.
It does not have any coefficient...
it does not have x along with it, or I can say it is x to power of zero.
As you can see, it is power of one.
So, b into d, and it is three.
This should be the simplified form of this.
Let us do it with our usual method, two x plus one multiplied by five x plus three, the ten x two plus six x plus five x plus three, which is equal to ten x two plus six plus five is eleven x, plus this is a plus sign plus three.
As you can see, we can simplify this further as ten x two plus six plus five eleven x, plus three, and x to the zero is one.
You're getting both same answer, but this method is really efficient.
Now, you might be wondering if every time you have to write this general form.
You really don't need to.
Let us see how it works, even when you don't write the general form, or you don't go through this above mentioned generic process.
If you have a number like five x minus one and three x plus two, remember that here it is negative.
Here there are two factors, so highest power will be squared, and there will be some coefficient of it.
It will be five into three, fifteen.
Then, next power will be x.
What will be its coefficient?
five that is coefficient of x in the first bracket, and the constant part in the second is five into two is ten.
Then, constant part of first bracket, multiplied by the coefficient of x in second, it is minus three because here it's minus one.
Put addition sign over here.
Plus...
now you have to multiply the two constant parts, minus one into two.
That is minus two so what we get is one five x two ten minus three seven x, minus two.
Just verify yourself with your usual procedure and you will end up with the same answer.
What if we have one more term over here?
As we just saw earlier, we are going to expand this method, and we have this ex plus f, but rather than toiling with this general approach further, I can teach you exactly how to apply this method for three factors or four factors.
I'm not going to expand it any further because we are here to simplify things, and not to complicate it any more.
Let us understand direct approach.
Let's say I have three x plus one x plus two and two x plus one.
These are the three factors that I have, and I want to multiply them.
When we are multiplying three factors, each of them having one x, one thing is certain that the highest power you're going to get is x three.
How can you obtain x three Multiply this term into this term, and into this term.
What you will have to do is three multiplied by one is three and into two is six, so you've got the coefficient of x three.
The next is x two.
When will you get x two When you multiply two terms having x.
Here, there is three and here there is one.
So, three into one is three and then you multiply that term with this one.
Remember this.
Multiply coefficient of x of first bracket with that of coefficient of x of the second, which is one in this case, and then multiply that product with the constant part in the third bracket, so three into one is three and further you multiply it with one you get three.
Plus...
Then you multiply coefficient of x from first bracket with that of third.
That is, you get six three into two is six and then multiply that with the constant part of the second.
three into two is six, and six into two is one two.
Then you multiply the coefficient of x, in this case one in the second bracket with that of the third bracket, so that's one into two is two and then multiply that with the constant part in the first bracket, so one into two is two and two into one is two.
You get this.
We got the coefficient of x two.
Now, what we did is we multiplied coefficient of x with another coefficient of x, so that here we are multiplying this x into this x, and you got x two and then you multiply it with the constant term, which does not give any more x, so you remain with the power of two in this case.
Let us move a bit further.
The next highest power will be x.
That is a single x.
Let us see how this works.
Multiply the coefficient of x in the first bracket with the constant term of second, so three into two is six, and then that with the constant term in the third bracket three into two is six, six into one is six.
Then multiply this one that is, coefficient of x in the second bracket, with the constant term of other two brackets.
That is one into one is one and then you further multiply it with this one so one into one is again one so add one more.
Plus...
Coefficient of x is two two multiplied by this constant term will give you two.
Sorry, this multiplied by two will give you four, and multiply this further with one.
It will give you four.
Then the constant term is obtained by multiplying all the constants.
That is two into one is two into one is two, so this would be your answer...
one two thirteen, fourteen, fifteen, sixteen, seventeen eleven, plus two.
This is the expansion, I can say.
Isn't it simple, that you don't ever try and multiply things.
You simply add up a few numbers and multiply some small numbers.
This method you can expand till any power of x.
Try it for x raised to four and x raised to five for your answer, and just let me know in the comment area if you could get it.
If you can't get it, just let me know so that I can create a video to explain you in an even better way.
Thank you.


WATCH: Lorry ploughs through level crossing barrier causing train delays
Footage has been released showing the moment a lorry ploughed through a level crossing barrier, causing delays for trains across the West Midlands.
by Thomas ParkesOne barrier was completely destroyed after the vehicle smashed into it at Hartlebury station, south of Kidderminster, this morning.
All lines were disrupted between Stourbridge Junction and Droitwich Spa in the aftermath, with cancellations and delays of up to 60 minutes as a result.
WATCH the video here:
Trains were forced to run at a slower speed as staff worked to re-attach the broken barrier after the lorry crash at 9.56am.
A spokesman for British Transport Police said: "The vehicle is reported to have driven through the crossing and hit one of the barriers as it lowered.
"Enquiries are ongoing."
The disruption was expected to last until the end of the day.
West Midlands Railway tweeted: "Due to a road vehicle colliding with level crossing barriers between Kidderminster and Stourbridge Junction all lines are disrupted.
"We have been advised by Network Rail that we can run through with caution.
"Train services may be cancelled, delayed or revised. "


<postreq>
The <postreq>
element describes steps or tasks that the user should do
after the successful completion of the current task. It is often supported by links to the
next task or tasks in the <related-links>
section.
Category: Task elements


This page explains the Angular initialization process and how you can manually initialize Angular if necessary.
<script>
TagThis example shows the recommended path for integrating Angular with what we call automatic initialization.
<!doctype html>
<html xmlns:ng="http://angularjs.org" ng-app>
<body>
...
<script src="angular.js"></script>
</body>
</html>
script
tag at the bottom of the page. Placing script tags at the end of the page
improves app load time because the HTML loading is not blocked by loading of the angular.js
script. You can get the latest bits from http://code.angularjs.org. Please don't link
your production code to this URL, as it will expose a security hole on your site. For
experimental development linking to our site is fine.angular-[version].js
for a human-readable file, suitable for development and
debugging.angular-[version].min.js
for a compressed and obfuscated file, suitable for use in
production.Place ng-app
to the root of your application, typically on the <html>
tag if you want
angular to auto-bootstrap your application.
If you choose to use the old style directive syntax ng:
then include xml-namespace in html
to make IE happy. (This is here for historical reasons, and we no longer recommend use of
ng:
.)
Angular initializes automatically upon DOMContentLoaded
event or when the angular.js
script is
evaluated if at that time document.readyState
is set to 'complete'
. At this point Angular looks
for the ng-app
directive which designates your application root.
If the ng-app
directive is found then Angular will:
ng-app
directive as the root of the compilation. This allows you to tell it to treat only a
portion of the DOM as an Angular application.<!doctype html>
<html ng-app="optionalModuleName">
<body>
I can add: {{ 1+2 }}.
<script src="angular.js"></script>
</body>
</html>
As a best practice, consider adding an ng-strict-di
directive on the same element as
ng-app
:
<!doctype html>
<html ng-app="optionalModuleName" ng-strict-di>
<body>
I can add: {{ 1+2 }}.
<script src="angular.js"></script>
</body>
</html>
This will ensure that all services in your application are properly annotated. See the dependency injection strict mode docs for more.
If you need to have more control over the initialization process, you can use a manual bootstrapping method instead. Examples of when you'd need to do this include using script loaders or the need to perform an operation before Angular compiles a page.
Here is an example of manually initializing Angular:
<!doctype html>
<html>
<body>
<div ng-controller="MyController">
Hello {{greetMe}}!
</div>
<script src="http://code.angularjs.org/snapshot/angular.js"></script>
<script>
angular.module('myApp', [])
.controller('MyController', ['$scope', function ($scope) {
$scope.greetMe = 'World';
}]);
angular.element(document).ready(function() {
angular.bootstrap(document, ['myApp']);
});
</script>
</body>
</html>
Note that we provided the name of our application module to be loaded into the injector as the second
parameter of the angular.bootstrap
function. Notice that angular.bootstrap
will not create modules
on the fly. You must create any custom modules before you pass them as a parameter.
You should call angular.bootstrap()
after you've loaded or defined your modules.
You cannot add controllers, services, directives, etc after an application bootstraps.
This is the sequence that your code should follow:
After the page and all of the code is loaded, find the root element of your AngularJS application, which is typically the root of the document.
Call angular.bootstrap
to compile the element into an
executable, bi-directionally bound application.
This feature enables tools like Batarang and test runners to hook into angular's bootstrap process and sneak in more modules into the DI registry which can replace or augment DI services for the purpose of instrumentation or mocking out heavy dependencies.
If window.name
contains prefix NG_DEFER_BOOTSTRAP!
when
angular.bootstrap
is called, the bootstrap process will be paused
until angular.resumeBootstrap()
is called.
angular.resumeBootstrap()
takes an optional array of modules that
should be added to the original list of modules that the app was
about to be bootstrapped with.


awe6.interfaces.EFullScreen
Representing possible full screen modes.
Can be extended with SubType by using concrete project values.
Constructors
DISABLED
FullScreen mode is not available.
NO_SCALE
Preserves original pixel size.
SCALE_ASPECT_RATIO_IGNORE
Scale without preserving aspect ratio - some distortion may occur, including non linear pixel sizes.
SCALE_ASPECT_RATIO_PRESERVE
Scale without aspect ratio distortion. Non linear pixel sizes may occur.
SCALE_NEAREST_MULTIPLE
Scale without distortion, and doubling pixels (2x2, 4x4 etc) to nearest multiple to preserve pixel sizes.
SUB_TYPE
(value :
Dynamic
)
Allows EScale to be extended (e.g. for using project specific scale modes).


Debloat is an Open-Source, extensible, Enterprise-ready data compression/decompression framework.
It supports several compression algorithms and more can be easily added using properties files, XML documents or even programmatically with a simple declarative DSL!
It compresses the data into extensible, easy to parse, human-readable and human-editable XML documents, which make it extremely easy to integrate Debloat with other platforms!
Debloat is distributed under the terms of the Apache license.
To show you what Debloat can do, let's see how much Debloat can compress the following text:
Rose is a rose is a rose is a rose.
Using the LZ77 algorithm, this 37-byte input gets compressed by Debloat into just 15 symbols (14 bytes and 1 backwards reference): almost 60% savings!
<?xml version="1.0" encoding="UTF-8"?> <compressedData algorithm="lz77"> <byte value="82"/> <byte value="111"/> <byte value="115"/> <byte value="101"/> <byte value="32"/> <byte value="105"/> <byte value="115"/> <byte value="32"/> <byte value="97"/> <byte value="32"/> <byte value="114"/> <reference distance="10" length="23"/> <byte value="46"/> <byte value="13"/> <byte value="10"/> </compressedData>
As you can see, the output of Debloat is highly readable XML, which makes it very easy to integrate Debloat with any other frameworks, databases, etc., you may need. What's more, this output can be fed back to Debloat for further compression, yielding additional savings, and so on ad infinitum!
Debloat includes an example command-line application you can use to compress files or the standard input/output. To use it, after downloading or building the Debloat, you can run the following command to compress the file input.txt into the file output.xml :
java -cp debloat-1.0.jar org.tarrio.debloat.DebloatCmd input.txt output.xml
To decompress a file, just use the -d command-line argument:
java -cp debloat-1.0.jar org.tarrio.debloat.DebloatCmd -d input.xml output.txt
You can choose the algorithm to compress the data with using the -a command-line argument:
java -cp debloat-1.0.jar org.tarrio.debloat.DebloatCmd -a=lzw input.txt output.xml
After downloading or building the Debloat JAR file and adding it to your library path, you only need to do the following to compress the contents of a file into another file using the Lempel-Ziv-Welch algorithm:
FileInputStream inputStream = new FileInputStream("index.html"); FileOutputStream outputStream = new FileOutputStream("index.html.xml"); Codec codec = CodecFactory.getCodec(); CompressionAlgorithmRegistry car = CompressionAlgorithmRegistry.getInstance(); CompressionAlgorithm lzw = car.get("lzw"); lzw.compress(inputStream, codec.getEncoder(outputStream));
As you can see, the API is pretty simple and straightforward. Also, the output file format is plain XML, so you can open it, inspect it, and process it using your favourite tools! That's what makes Debloat so special!
Debloat comes with implementations of the LZ77 and Lempel-Ziv-Welch algorithms, but if you want to add more algorithms, it can be done quite easily!
The most common, and recommended, way is via a properties file. The key for each property is the algorithm's name, and the value is the full name of the class implementing that algorithm.
For example, suppose you have new RLE and LZMA implementations you'd like to add. Just create a properties file like this:
rle=com.example.compression.Rle lzma=com.example.compression.Lzma
And then tell the CompressionAlgorithmRegistry to register the algorithms specified in the properties file. For example:
CompressionAlgorithmRegistry car = CompressionAlgorithmRegistry.getInstance(); car.registerFromProperties(inputStream);
You can also use an XML document to configure your algorithms:
<?xml version="1.0" encoding="UTF-8"?> <!DOCTYPE properties SYSTEM "http://java.sun.com/dtd/properties.dtd"> <properties> <entry key="rle">com.example.compression.Rle</entry> <entry key="lzma">com.example.compression.Lzma</entry> </properties>
And you can load it with the registerFromXml() method:
CompressionAlgorithmRegistry car = CompressionAlgorithmRegistry.getInstance(); car.registerFromXml(inputStream);
Finally, you can also configure your compression algorithms directly from Java code with an easy to use declarative DSL. Just create a subclass of CompressionAlgorithmRegistrationModule and override the configure(CompressionAlgorithmBinder) method:
public class MyCompressionAlgorithmRegistrationModule extends CompressionAlgorithmRegistrationModule { @Override void configure(CompressionAlgorithmBinder binder) { binder.bind("rle").to(com.example.compression.Rle.class); binder.bind("lzma").to(com.example.compression.Lzma.class); } }
Then, you can enable the configuration specified in this module with just this code:
CompressionAlgorithmRegistry car = CompressionAlgorithmRegistry.getInstance(); car.registerFromModule(new MyCompressionAlgorithmRegistrationModule());
Registration via CompressionAlgorithmRegistrationModule s is even more flexible than that! In addition to classes, you can bind singleton instances or providers for that extra flexibility!
public class MyCompressionAlgorithmRegistrationModule extends CompressionAlgorithmRegistrationModule { @Override void configure(CompressionAlgorithmBinder binder) { binder.bind("rle").toInstance(new com.example.compression.Rle()); binder.bind("lzma").toProvider(new LzmaProvider()); } private static class LzmaProvider implements CompressionAlgorithmProvider { public CompressionAlgorithm get() { return new com.example.compression.Lzma(16384); } } }
Copyright 2012 Jacobo Tarrio
Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.


As the Web Developer & Designer, I am soley responsible for maintaining the Cloudbees Corporate Drupal site. The main focus of my position is to ensure a consistent look and feel through design and development.
I have been able to streamline the site using my knowledge of UI / UX and design fundementals to develop custom modules and content based on user data. I work closely with the marketing department to gather that data and help them understand how best to incorporate it into our website.
As the Senior UX Designer, I work closely with key departments to build visually compelling wireframes and designs that convey complex conceptual relationships based on the data provided.
I help to define best practices and standards to drive the development of user scenarios and ensure others on the team fully understand how to apply the methodologies of user-centered design and research. Staying on the cutting edge, identifying opportunities and experimenting with applying new interactions and graphical patterns has allowed me to show a high degree of creativity, interaction design and problem solving.
I combined the art of design with the art of programming to create the UI/UX wireframes and workflows which, when converted to actual code will produce visual elements of the application.
I worked closely with the Creative Director and bridged the gap between graphical design and technical implementation, taking an active role on both sides and defining how the application looks as well as how it functions. Using HTML5, CSS3 and Javascript as well as Pre-processors like Less and Sass I was able to build reusable code and new user-facing features in an agile development process.
As a Senior Web Designer & Developer at C-4, I created and designed fully responsive HTML eblasts, maintained, and built custom wordpress sites for clients located all across the country.
In a senior role, I had taken on the additional task of managing the 10 person design and development team. Which included setting up monthly 1-on-1’s, meeting with account management, talking with clients on a weekly basis, and maintaining the Scrum board. I was also responsible for training new employees on the basics of HTML, CSS, JavaScript, and PHP.
As the Creative Director, I designed all collateral for our clients; from websites and magazine ads to pitching new contracts and one-off custom pieces.
I also orchestrated and ran all social media campaigns, helped build client websites, and managed all creative freelance employees and interns. I designed and executed numerous ad campaigns, websites, custom print pieces, billboards, and other custom collateral for local and national clients such as Cirque du Soleil, WWE, Downy and American Cancer Society of Tampa Bay.
As the Promotions Director for the six station cluster, I was brought in to build the department from the ground up. During my time there I handled the setup and execution of the week-long “radio row” during the 2009 NFL Superbowl.
I was managing all aspects of producing, board operations, and management of DJs, producers and interns. While there, I executed a number of spectacular sports themed promotions which engaged the listeners and increased web traffic and ratings. I also organized and headed a team of designers and coders for a full company wide website re-design for all stations in the cluster.


XDPYINFO(1) XDPYINFO(1) NAME xdpyinfo - display information utility for X SYNOPSIS xdpyinfo [-display displayname] [-queryExtensions] [-ext extension-name] DESCRIPTION Xdpyinfo is a utility for displaying information about an X server. It is used to examine the capabilities of a server, the predefined values for various parameters used in communicating between clients and the server, and the different types of screens and visuals that are avail‐ able. By default, numeric information (opcode, base event, base error) about protocol extensions is not displayed. This information can be obtained with the -queryExtensions option. Use of this option on servers that dynamically load extensions will likely cause all possible extensions to be loaded, which can be slow and can consume significant server resources. Detailed information about a particular extension is displayed with the -ext extensionName option. If extensionName is all, information about all extensions supported by both xdpyinfo and the server is displayed. ENVIRONMENT DISPLAY To get the default host, display number, and screen. SEE ALSO X(7), xprop(1), xrdb(1), xwininfo(1), xdriinfo(1), xvinfo(1), glxinfo(1) AUTHOR Jim Fulton, MIT X Consortium Support for the XFree86-VidModeExtension, XFree86-DGA, XFree86-Misc, and XKB extensions added by Joe Moss X Version 11 xdpyinfo 1.3.0 XDPYINFO(1)


pay small bitcoin for test
Reality Keys - 1 Bitcoin to be at least 400 US Dollar on Nov. 20, 2014 Bitcoin Multi Signature Address bitcoinjs-lib/p2sh.js


A Horizontal Bar chart that shows the fortune 500 company's by country
This goes in the documents header:
<script src="RGraph.common.core.js"></script>
<script src="RGraph.common.dynamic.js"></script>
<script src="RGraph.common.tooltips.js"></script>
<script src="RGraph.hbar.js"></script>
<script src="RGraph.bar.js"></script>
Put this where you want the chart to show up:
<canvas id="cvs" width="820" height="250">
[No canvas support]
</canvas>
This is the code that generates the chart - it should be placed AFTER the canvas tag(s):


Data Visualization (Chart Sandbox)
Axis Chart
[Settings]
[Get Codes]
Sample Data:
Bar
Line
Line&BarCombo
2BarsCombo
3Combo
Sample Property:
Slider
ScaleLine
|
Default
SelectByIndex
Pie Chart
[Settings]
[Get Codes]
Sample Data:
TestStatus
RGBCircle
Sample Property:
Scroll
|
Default
Radar Chart
[Settings]
[Get Codes]
Sample Data:
Paper Evaluation
Sample Property:
Polygon
|
Default
Output Console
Ok
Cancel
Copyright (C) QLike.com


| 886 | (A) | Tiłł it was pikede at the poynte als a prikkes ende |
| 893 | (C) | Tyłł hit was prykked at þe poynte . as a prikke ende |
| 877 | (D) | Til it is pytte at þe point as a prikkis ende |
| 854 | (E) | til it were scharp at þe ende . ryȝt as prykke |
| (Ex) | ---- no text ---- | |
| 909 | (L) | Tille hit was piked at þe poynt as a pokes ende |
| 827 | (P) | Till it was pyked at þe poynte als pryk ende |
| 863 | (U) | Tille it is prikked atte point / os a prikkes ende |
| (V) | ---- no text ---- |


Ok, half my life (I'm 21 now) I've been smoking plenty of weed, its pretty much a normal day to day thing in my life. I've had my experiences with other drugs too like acid, morphine, cocaine, ecstasy, oxycontin and lots of other painkillers. But earlier this past summer (summer '03) I'm a changed person. It was around the third week into the summer, and it was only me and a friend. We decided since we had enough herb to last into the next week, we'd find something we haven't done before. Me, being the one that usually gets our supply of whatever, brought up heroin. After about 10 minutes we made up our minds, so I picked up the phone. I tried 4 people who I figured could actually come thru with it, the last person I called actually did, surprisingly.
We had $150 to spend that night, but luckily I only spent $60, which got us a bundle(10 bags). I ended up going by myself with my connection to some apartment while my friend stayed at the house. When we got to the room number, my dealer knocked on his door and said something I can't remember, I think he was letting them know it was him. The guy we were buying it from was pretty cool, but I figured its obviously to get his sales, I sell weed myself.
We sat on the couch and he came out of his room with a brown sandwhich bag, he pulled out a bundle and threw it to me. I counted the bags and gave him the money. I got back that night and quickly got to my room, as my friend followed me.  I tore open one of them and poured the very white powder onto a cd case, opened another one and poured it for my friend. I divided up about 5 small lines. The guy said it was purest he's gotten in months, so I sniffed up only one of the lines, and handed the cd case to my friend and told him only do one.
It hit me as soon as I looked away from him, a wave of warmness overwhelmed my entire body, feeling of happyness in me, my eyes felt very heavy and glossy. I laid back noticing my friend enjoying it too. I closed my eyes, feeling detached from the world and society. I felt as if I was somewhere else, far away and nonexistant. Nowhere in particular, just somewhere else. I was in the land off the free. It went on like that for the rest of the night, without doing not even one more line.
The next day I did it about twice more, and from what I can remember the bundle was gone soon, from myself. It wasn't long until I discovered the needle, about 3 months. I was by myself, after buying 5 bags, the dealer offered me a free clean needle. I stared for a minute until I said I'll take it. Fiending as I got home, went to the kitchen, grabbed a spoon, cup of water, and a cottonball from the bathroom and went strait to my room. I sat down in a comfortable chair, looked at the syringe tryin to make sure its clean, and sucked up a little bit of water and squirted it in the spoon, then opened one of the bags of H and poured it onto a cd case. With a razor I picked a small amount up and dropped it onto the spoon and held a liter underneath until it boiled a bit.
I made sure I had an easy vein to hit, and slowly, slanting the needle so I wouldn't puncture it, I slid it into my vein. From that point on, I was HIGH. That first second the needle got into my vein, I got trapped. After the rush, I was just on top of the world, nothing could phase me, even annoy me. I was in a beautiful, separate place from the world, in this place theres no violence or madness, just happiness and nice weather, the smell of flowers and being free. The feeling of shooting dope is like those little things that feel good, stretching in the morning, the relaxation u feel as you sit in a hot tub.
Heroin puts me on top of the world, it is the ultimate-fix. I don't see myself without it, and its been almost a year now. I shoot up about 5 bags a day of the most high quality heroin in and around my area. My goals are erased, I can't even remember what I do anymore, and my feet have needle tracks everywhere.
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.


Before Change
Detects text in the file located in Google Cloud Storage or on the Web.
vision_client = vision.Client()
image = vision_client.image(source_uri=uri)
texts = image.detect_text()
print("Texts:")
for text in texts:
print("\n"{}"".format(text.description))
vertices = (["({},{})".format(bound.x_coordinate, bound.y_coordinate)
for bound in text.bounds.vertices])
print("bounds: {}".format(",".join(vertices)))
After Change
Detects text in the file located in Google Cloud Storage or on the Web.
client = vision.ImageAnnotatorClient()
image = types.Image()
image.source.image_uri = uri
response = client.text_detection(image=image)
texts = response.text_annotations
print("Texts:")
for text in texts:
print("\n"{}"".format(text.description))
vertices = (["({},{})".format(vertex.x, vertex.y)
for vertex in text.bounding_poly.vertices])
print("bounds: {}".format(",".join(vertices)))
// [END def_detect_text_uri]


Classes in ruby are a way of creating objects with methods available to them that are not available outside of the class. Using this technique, objects are given privilages and limitations specific to their purposes. For example, not allowing a sensitive piece of personal information to be modified from outside its class will prevent tempering, accidental data loss, or modification.
Working with a customer's credit card number is a good example of sensitive information to keep away from being stored in a global variable, where it could be read or modified by anyone or anything outside of its explicit purpose in the program. Class variables are only accessable within its respective class. When checking an example card number using the luhn algorithm, setting the card's value to another private variable before beginning the process will prevent any permanent or unwelcome modification and access to the original number.


### Solidity Assembly (Part 2) #### Advanced Smart Contract
Yuet Loo Wong
### Topics - Stack - Memory - Storage - Calldata
## EVM - The Ethereum Virtual Machine - The runtime environment for smart contracts - A sandboxed, isolated environment - Code running inside the EVM has no access to network, filesystem or other processes
## Stack - EVM is a stack machine - All instructions are run on a
stack
- Only the top part of a stack can be accessed - Stack max size is 1024 elements - Each stack element is 256 bits wide - Stack operations: PUSH, POP, SWAP, DUP
## PUSH and POP - PUSH1: add 1 byte item on stack - PUSH2: add 2 bytes item on stack - PUSH3-32: add 3 to 32 bytes item on stack - POP: remove an item from the stack
## SWAP and DUP - SWAP1: exchange 1st and 2nd stack items - SWAP2: exchange 1st and 3rd stack items - SWAP3-16: exchange 1st and 4th (17th) stack items - DUP1: Duplicate 1st stack item - DUP2-16: Duplicate 2nd-16th stack item
### Opcodes not available in Yul Since Yul manages local variables and control-flow, opcodes that interfere with these features are not available. This includes the dup, swap, jump, labels, push instructions
## Stack Demo
## Memory - An expandable byte-array used to store data - Expanding memory costs gas - Memory is expanded by 256-bit - Volatile, only available during execution
## Memory Access Functions - `MLOAD(o)`: load word from memory onto stack - o: memory offset - `MSTORE(o,v)`: store 256-bit word into memory - o: memory offset - v: value from stack - `MSTORE8(o,v)`: store a byte into memory
## Solidity Memory Layout - Solidity reserves memory slots as follow: - 0x00 - 0x3f (64 bytes): scratch space, for short term usage - 0x40 - 0x5f (32 bytes): free memory pointer - 0x60 - 0x7f (32 bytes): zero for empty dynamic memory arrays - 0x80: initial value of the free memory pointer -
Solidity Documentation
on Memory Layout
## Memory Example ``` contract Sample { function getData(uint value) public view returns (bytes32 output) { assembly { function allocate(length) -> pos { let freePointer := 0x40 pos := mload(freePointer) mstore(freePointer, add(pos,length)) } let dataSize := 0x20 // 32 bytes let offset := allocate(dataSize) mstore(offset, value) return(offset, dataSize) } } } ```
## CallData - Read only byte-array containing msg.data - Data is ABI encoded - The first 4 bytes is the function selector - Arguments are padded to multiples of 32 bytes -
Layout of CallData
## CallData Access Functions - `CALLDATACOPY(m, c, n)`: - load n bytes of call data from offset c into memory offset m - `CALLDATALOAD(m)`: load 32 bytes calldata onto stack - `CALLDATASIZE()`: load call data size onto stack
## Return - End execution, return output data - return(m,l): - m: memory offset - l: length of data in byte
## CallData Demo ``` contract Sample { // return calldata as bytes output function getData(uint input) public view returns (bytes memory output) { assembly { let base := mload(0x40) mstore(add(base, 0x00), 0x20) // pointer to data mstore(add(base, 0x20), 36) // data length calldatacopy(add(base, 0x40), 0, 36) // data from byte 0 return(base, 0x80) } } } ```
## Storage - State variables stored here - Key-value store - maps 256-bit words to 256-bit words - Persistent storage in an account
## State Variable Access -
_slot
: storage slot for the variable -
_offset
: byte offset for the variable
## SSTORE/SLOAD - sstore(p,v): save a word to storage - p: storage slot - v: value to store - sload(p): load a word from storage to stack
## State Variable Storage Layout - Statically-sized variables stored from position
0
- Variables less than 32 bytes are packed in a single slot - Refer to other rules in
Solidity Documentation
## Storage Demo ``` contract Sample { uint8 data1 = 1; uint8 data2 = 2; uint8 data3 = 3; uint8 data4 = 4; // get data3 and return it as ouput function getData() public view returns(bytes32){ assembly { let data := sload(data3_slot) let result := and(shr(shl(3,data3_offset), data), 0xff) mstore(0, result) return(0,32) } } } ```
## Lab Following the instructions on the readme file of
assembly-storage


Posted on May 10th 2014 by Writer - # comments
Hi there!
Sample web page.
Posted on May 23th 2014 by Writer - # comments


OpenUrl DNA &; occupancy CABIN metabarcoding taxa using data model Ecology models community CrossRef Science detectability power detection sampling Fig. metacommunity observed samples based diversity detect imperfect macroinvertebrate wetland analysis changes ecological families sites Fpa PAD Supplement Web environmental estimated (Fig. composition estimates presence-absence probability species taxonomic (e.g. (i.e. Figure biomonitoring change distribution ecosystem freshwater identified natural new resolution sample Ecological Freshwater S.). aquatic biodiversity compared high multiple site taxon traditional used Peace-Athabasca covariates differences monitoring number processes richness turnover Applied Biomonitoring Download Environmental Gpa Hajibabaei Methods S.), View assembly assessment detecting indicate information occurrence provided sampled study survey time Evolution Fcount Metabarcoding National Royle Using approaches biological communities community-level efficiency error false family-level genera identification including likelihood local morphological particularly patterns process protocol quality relative responses significant statistical stressor support surveys taxa, understanding unique variability (see Biodiversity Buffalo Canada Delta Despite Guillera-Arroita Macroinvertebrate Models Molecular Open Research S.) Statistical Wood abundance aggregated average baseline collected complementary data-hide-link-title=""> data-icon-position="" degradation did dynamics ecosystems effects field figure fit frequency gamma hierarchical higher identify importance increase macroinvertebrates management models, needed observation oil perspective primer programs protocols rare replicate retained sequences simulations standard studies suggested symbol) tab taxa. temporal variables


Namespace RouteMap
RouteMap
Defined in: routemap.js.
| Constructor Attributes | Constructor Name and Description |
|---|---|
|
RouteMap holds an internal table of route patterns and method names in addition to some adding/removing/utility methods and a handler for request routing. |
| Method Attributes | Method Name and Description |
|---|---|
| <static> |
RouteMap.add(rule)
adds a rule to the internal table of routes and methods
|
| <private> |
compile(route)
builds the internal representation of a rule based on the route definition
|
| <static> |
RouteMap.context(scope)
overrides the context where listener methods are sought, the default scope is
window
(in a browser setting), returns the current context, if no scope object is passed in, just
returns current context without setting context |
| <static> |
RouteMap.current()
returns the parsed (see #parse) currently accessed route; after listeners have finished
firing,
current and last are the same |
| <static> |
RouteMap.default_handler()
this function is fired when no rule is matched by a URL, by default it does nothing, but it could be set up
to handle things like
404 responses on the server-side or bad hash fragments in the browser |
| <static> |
RouteMap.get()
URL grabber function, defaults to checking the URL fragment (
hash ); this function should be
overwritten in a server-side environment; this method is called by RouteMap.handler; without
window.location.hash it will return '/' |
| <static> |
RouteMap.go(hash)
in a browser setting, it changes
window.location.hash , in other settings, it should be
overwritten to do something useful (if necessary); it will not throw an error if window does
not exist |
| <static> |
RouteMap.handler()
main handler function for routing, this should be bound to
hashchange events in the browser, or
(in conjunction with updating RouteMap.get) used with the HTML5 history API, it detects
all the matching route patterns, parses the URL parameters and fires their methods with the arguments from
the parsed URL; the timing of RouteMap.current and RouteMap.last being set is as follows
(pseudo-code):
path: get_route // RouteMap.get parsed: parse path // #parse current: longest parsed // RouteMap.current parsed: pre_dispatch parsed // RouteMap.pre_dispatch current: longest parsed // reset current fire matched rules in parsed last: current // RouteMap.last RouteMap.handler calls #parse and does not catch any errors that function throws |
| <static> |
RouteMap.hash(rule, params)
returns a URL fragment by applying parameters to a rule; uses #compile and does not catch any errors
thrown by that function
|
| <static> |
RouteMap.last()
returns the parsed (see #parse) last accessed route; when route listeners are being called,
last is the previously accessed route, after listeners have finished firing, the current parsed
route replaces last 's value |
| <private> |
merge()
merges one or more objects into a new object by value (nothing is a reference), useful for cloning
|
| <static> |
RouteMap.parse()
parses a URL fragment into a data structure only if there is a route whose pattern matches the fragment
|
| <private> |
parse(path)
parses a path and returns a list of objects that contain argument dictionaries, methods, and raw hash values
|
| <static> |
RouteMap.post_add(compiled)
this function is called by RouteMap.add, it receives a compiled rule object, e.g.
|
| <static> |
RouteMap.pre_dispatch(parsed)
like RouteMap.post_add this function can be overwritten to add application-specific code into
route mapping, it is called before a route begins being dispatched to all matching rules; it receives the
list of matching parsed route objects (#parse) and is expected to return it; one application of this
function might be to set application-wide variables like debug flags
|
| <static> |
RouteMap.prefix(prefix)
if a string is passed in, it overwrites the prefix that is removed from each URL before parsing; primarily
used for hashbang (
#! ); either way, it returns the current prefix |
| <static> |
RouteMap.remove(rule)
counterpart to RouteMap.add, removes a rule specification; *
remove uses
#compile and does not catch any errors thrown by that function |
Namespace Detail
RouteMap
RouteMap holds an internal table of route patterns and method names in addition to some adding/removing/utility methods and a handler for request routing.
It does not have any dependencies and is written in "plain old" JS, but it does require JS 1.8 array methods, so if the environment it will run in does not have those, the reference implementations from Mozilla should be supplied external to this library.
It is designed to be used in both a browser setting and a server-side context (for example in node.js).
LICENSING INFORMATION:Copyright 2011 OpenGamma Inc. and the OpenGamma group of companies Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
Author: Afshin Darian.
- Throws:
- {Error}
- if JS 1.8 Array.prototype methods don't exist
Method Detail
<static>
{undefined}
RouteMap.add(rule)
adds a rule to the internal table of routes and methods
- Parameters:
- {Object} rule
- rule specification
- {String} rule.route
- route pattern definition; there are three types of pattern arguments: scalars,
keyvals, and stars; scalars are individual values in a URL (all URL values are separate by the
'/'
character), keyvals are named values, e.g. 'foo=bar', and star values are wildcards; so for example, the following pattern represents all the possible options:
the'/foo/:id/:sub?/attr:/subattr:?/rest:*'
?
means that argument is optional, the star rule is namedrest
but it could have just simply been left as*
, which means the resultant dictionary would have put the wildcard remainder intoargs['*']
instead ofargs.rest
; so the following URL would match the pattern above:
when its method is called, it will receive this arguments dictionary:/foo/23/45/attr=something/subattr=something_else
{ id:'23', subid:'45', attr:'something', subattr:'something_else', rest:'' }
add
uses #compile and does not catch any errors thrown by that function - {String} rule.method
- listener method for this route
- Throws:
- {TypeError}
- if
rule.route
orrule.method
are not strings or empty strings - {Error}
- if
rule
has already been added
- See:
- RouteMap.post_add
<private>
compile(route)
builds the internal representation of a rule based on the route definition
- Parameters:
- {String} route
- Throws:
- {SyntaxError}
- if any portion of a rule definition follows a
*
directive - {SyntaxError}
- if a required scalar follows an optional scalar
- {SyntaxError}
- if a rule cannot be parsed
- Returns:
- {Object} a compiled object, for example, the rule
'/foo/:id/type:?/rest:*'
would return an object of the form:{ page:'/foo', rules:{ keyvals:[{name: 'type', required: false}], scalars:[{name: 'id', required: true}], star:'rest' // false if not defined } }
<static>
RouteMap.context(scope)
overrides the context where listener methods are sought, the default scope is
window
(in a browser setting), returns the current context, if no scope
object is passed in, just
returns current context without setting context
- Parameters:
- {Object} scope
- the scope within which methods for mapped routes will be looked for
- Returns:
- {Object} the current context within which RouteMap searches for handlers
<static>
{Object}
RouteMap.current()
returns the parsed (see #parse) currently accessed route; after listeners have finished
firing,
current
and last
are the same
- Returns:
- {Object} the current parsed URL object
- See:
- RouteMap.last
<static>
{undefined}
RouteMap.default_handler()
this function is fired when no rule is matched by a URL, by default it does nothing, but it could be set up
to handle things like
404
responses on the server-side or bad hash fragments in the browser
<static>
{String}
RouteMap.get()
URL grabber function, defaults to checking the URL fragment (
hash
); this function should be
overwritten in a server-side environment; this method is called by RouteMap.handler; without
window.location.hash
it will return '/'
- Returns:
- {String} by default, this returns a subset of the URL hash (everything after the first
'/'
character ... if nothing follows a slash, it returns'/'
); if overwritten, it must be a function that returns URL path strings (beginning with'/'
) to match added rules
<static>
{undefined}
RouteMap.go(hash)
in a browser setting, it changes
window.location.hash
, in other settings, it should be
overwritten to do something useful (if necessary); it will not throw an error if window
does
not exist
- Parameters:
- {String} hash
- the hash fragment to go to
<static>
{undefined}
RouteMap.handler()
main handler function for routing, this should be bound to
hashchange
events in the browser, or
(in conjunction with updating RouteMap.get) used with the HTML5 history
API, it detects
all the matching route patterns, parses the URL parameters and fires their methods with the arguments from
the parsed URL; the timing of RouteMap.current and RouteMap.last being set is as follows
(pseudo-code):
path: get_route // RouteMap.get parsed: parse path // #parse current: longest parsed // RouteMap.current parsed: pre_dispatch parsed // RouteMap.pre_dispatch current: longest parsed // reset current fire matched rules in parsed last: current // RouteMap.last
RouteMap.handler
calls #parse and does not catch any errors that function throws
<static>
{String}
RouteMap.hash(rule, params)
returns a URL fragment by applying parameters to a rule; uses #compile and does not catch any errors
thrown by that function
- Parameters:
- {Object} rule
- the rule specification; it typically looks like:
but only{route:'/foo', method:'bar'}
route
is strictly necessary - {Object} params
- a dictionary of argument key/value pairs required by the rule
- Throws:
- {TypeError}
- if a required parameter is not present
- Returns:
- {String} URL fragment resulting from applying arguments to rule pattern
<static>
{Object}
RouteMap.last()
returns the parsed (see #parse) last accessed route; when route listeners are being called,
last
is the previously accessed route, after listeners have finished firing, the current parsed
route replaces last
's value
- Returns:
- {Object} the last parsed URL object, will be
null
on first load
- See:
- RouteMap.current
<private>
{Object}
merge()
merges one or more objects into a new object by value (nothing is a reference), useful for cloning
- Throws:
- {TypeError}
- if one of the arguments is not a mergeable object (i.e. a primitive, null or array)
- Returns:
- {Object} a merged object
<static>
{Object}
RouteMap.parse()
parses a URL fragment into a data structure only if there is a route whose pattern matches the fragment
- Throws:
- {TypeError}
- if hash is not a string, is empty, or does not contain a
'/'
character - {SyntaxError}
- if hash cannot be parsed by #parse
- Returns:
- {Object} of the form:
only if a rule with the route:{page:'/foo', args:{bar:'some_value'}}
'/foo/:bar'
has already been added
<private>
{Array}
parse(path)
parses a path and returns a list of objects that contain argument dictionaries, methods, and raw hash values
- Parameters:
- {String} path
- Throws:
- {TypeError}
- if the method specified by a rule specification does not exist during parse time
- Returns:
- {Array} a list of parsed objects in descending order of matched hash length
<static>
{Object}
RouteMap.post_add(compiled)
this function is called by RouteMap.add, it receives a compiled rule object, e.g. for the rule:
{route:'/foo/:id/:sub?/attr:/subattr:?/rest:*', method:'console.log'}
post_add
would receive the following object:
{
method:'console.log',
rules:{
scalars:[{name:'id',required:true},{name:'sub',required:false}],
keyvals:[{name:'attr',required:true},{name:'subattr',required:false}],
star:'rest'
},
raw:'/foo/:id/:sub?/attr:/subattr:?/rest:*'
}
and it is expected to pass back an object of the same format; it can be overwritten to post-process added
rules e.g. to add extra default application-wide parameters; by default, it simply returns what was passed
into it
- Parameters:
- {Object} compiled
- the compiled rule
- Returns:
- {Object} the default function returns the exact object it received; a custom function needs to an object that is of the same form (but could possibly have more or fewer parameters, etc.)
<static>
{Array}
RouteMap.pre_dispatch(parsed)
like RouteMap.post_add this function can be overwritten to add application-specific code into
route mapping, it is called before a route begins being dispatched to all matching rules; it receives the
list of matching parsed route objects (#parse) and is expected to return it; one application of this
function might be to set application-wide variables like debug flags
- Parameters:
- {Array} parsed
- the parsed request
- Returns:
- {Array} a list of the same form as the one it receives
<static>
{undefined}
RouteMap.prefix(prefix)
if a string is passed in, it overwrites the prefix that is removed from each URL before parsing; primarily
used for hashbang (
#!
); either way, it returns the current prefix
- Parameters:
- {String} prefix
- (optional) the prefix string
<static>
{undefined}
RouteMap.remove(rule)
counterpart to RouteMap.add, removes a rule specification; *
remove
uses
#compile and does not catch any errors thrown by that function
- Parameters:
- {Object} rule
- the rule specification that was used in RouteMap.add
- Throws:
- {TypeError}
- if
rule.route
orrule.method
are not strings or empty strings


Air Bass
Air Drums
Air DJ Set 1
Air DJ Set2
Air Guitar
Hit The Gong!!!
About the Team
Behind the Scenes
Trump Mode
Home


{% extends "site_base.html" %} {% load i18n %} {% block head_title %}{% trans "Welcome" %}{% endblock %} {% block body_class %}home{% endblock %} {% block body %}
{% blocktrans %} Pinax is a Django project intended to provide a starting point for websites. By integrating numerous reusable Django apps to take care of the things that many sites have in common, it lets you focus on what makes your site different. {% endblocktrans %}
{% blocktrans %} For more information about Pinax, see http://pinaxproject.com/. {% endblocktrans %}
{% blocktrans %} This project lays the foundation for all other Pinax starter projects. It provides the project directory layout and some key infrastructure apps on which the other starter projects are based. {% endblocktrans %}
{% endblock %}


An Introduction to Markdown (Bonus Markdown Templates Included)
An Introduction to Markdown (Bonus Markdown Templates Included)
One Paragraph of project description goes here These instructions will get you a copy of the project up and running on…github.com
Basic Syntax Guide
This topic is meant to give you a very basic overview of how Markdown works, showing only some of the most common operations you use most frequently. Keep in mind that you can also use the Edit menus to inject markdown using the toolbar, which serves as a great way to see how Markdown works. However, Markdown’s greatest strength lies in its simplicity and keyboard friendly approach that lets you focus on writing your text and staying on the keyboard.
What is Markdown
Markdown is very easy to learn and get comfortable with due it’s relatively small set of markup ‘commands’. It uses already familiar syntax to represent common formatting operations. Markdown understands basic line breaks so you can generally just type text.
Markdown also allows for raw HTML inside of a markdown document, so if you want to embed something more fancy than what Markdowns syntax can do you can always fall back to HTML. However to keep documents readable that’s generally not recommended.
Basic Markdown Syntax
The following are a few examples of the most common things you are likely to do with Markdown while building typical documentation.
Bold and Italic
markdown
This text **is bold**.
This text *is italic*.
This text is bold.
This text
is italic.
Header Text
markdown
# Header 1
## Header 2
### Header 3
#### Header 4
##### Header 5
###### Header 6
Header 1
Header 2
Header 3
Header 4
Header 5Header 6
Line Continuation
By default Markdown adds paragraphs at double line breaks. Single line breaks by themselves are simply wrapped together into a single line. If you want to have soft returns that break a single line, add two spaces at the end of the line.
markdown
This line has a paragraph break at the end (empty line after).
Theses two lines should display as a single
line because there's no double space at the end.
The following line has a soft break at the end (two spaces at end)
This line should be following on the very next line.
This line has a paragraph break at the end (empty line after).
Theses two lines should display as a single line because there’s no double space at the end.
The following line has a soft break at the end (two spaces at
end)
This line should be following on the very next line.
Links
markdown
[Help Builder Web Site](http://helpbuilder.west-wind.com/)
If you need additional image tags like targets or title attributes you can also embed HTML directly:
markdown
Go the Help Builder sitest Wind site: Help Builder Site.
Images
markdown
![Help Builder Web Site](https://helpbuilder.west-wind.com/images/HelpBuilder_600.png)
Block Quotes
Block quotes are callouts that are great for adding notes or warnings into documentation.
markdown
> ### Headers break on their own
> Note that headers don't need line continuation characters
as they are block elements and automatically break. Only text
lines require the double spaces for single line breaks.
Headers break on their own
Note that headers don’t need line continuation characters as they are block elements and automatically break. Only text lines require the double spaces for single line breaks.
Fontawesome Icons
Help Builder includes a custom syntax for
FontAwesome
icons in its templates. You can embed a
@ icon-
followed by a font-awesome icon name to automatically embed that
icon without full HTML syntax.
markdown
Gear: Configuration
Configuration
HTML Markup
You can also embed plain HTML markup into the page if you like. For example, if you want full control over fontawesome icons you can use this:
markdown
This text can be **embedded** into Markdown:
 Refresh Page
This text can be embedded into Markdown:
Refresh Page
Unordered Lists
markdown
* Item 1
* Item 2
* Item 3
This text is part of the third item. Use two spaces at end of the the list item to break the line.
A double line break, breaks out of the list.
- Item 1
- Item 2
-
Item 3
This text is part of the third item. Use two spaces at end of the the list item to break the line.
A double line break, breaks out of the list.
Ordered Lists
markdown
1. **Item 1**
Item 1 is really something
2. **Item 2**
Item two is really something else
If you want lines to break using soft returns use two spaces at the end of a line.
- Item 1 Item 1 is really something
-
Item 2
Item two is really something else
If you want to lines to break using soft returns use to spaces at the end of a line.
Inline Code
If you want to embed code in the middle of a paragraph of text to highlight a coding syntax or class/member name you can use inline code syntax:
markdown
Structured statements like `for x =1 to 10` loop structures
can be codified using single back ticks.
Structured statements like
for x =1 to 10
loop structures can be codified using single back ticks.
Code Blocks with Syntax Highlighting
Markdown supports code blocks syntax in a variety of ways:
markdown
The following code demonstrates:
// This is code by way of four leading spaces
// or a leading tab
More text here
The following code demonstrates:
pgsql
// This is code by way of four leading spaces
// or a leading tab
More text here
Code Blocks
You can also use triple back ticks plus an optional coding language to support for syntax highlighting (space injected before last ` to avoid markdown parsing):
markdown
`` `csharp
// this code will be syntax highlighted
for(var i=0; i++; i < 10)
{
Console.WriteLine(i);
}
`` `
csharp
// this code will be syntax highlighted
for(var i=0; i++; i < 10)
{
Console.WriteLine(i);
}
Many languages are supported: html, xml, javascript, css, csharp, foxpro, vbnet, sql, python, ruby, php and many more. Use the Code drop down list to get a list of available languages.
You can also leave out the language to get no syntax coloring but the code box:
markdown
`` `dos
robocopy c:\temp\test d:\temp\test
`` `
dos
robocopy c:\temp\test d:\temp\test
To create a formatted block but without formatting use the
txt
format:
markdown
`` `txt
This is some text that will not be syntax highlighted
but shows up in a code box.
`` `
which gives you:
text
This is some text that will not be syntax highlighted
but shows up in a code box.
If you found this guide helpful feel free to checkout my github/gists where I host similar content:
Web Developer, Electrical Engineer JavaScript | CSS | Bootstrap | Python | React | Node.js | Express | Sequelize…github.com
Or Checkout my personal Resource Site:


What is Emotional Intelligence?
Emotional Intelligence covers a few areas, in particular our ability to recognise and understand our own emotions as well as others. It is our ability to motivate ourselves, and how we work with others.
How is it different to IQ?
IQ is used to measure your ability to learn and understand new situations, your reasoning skills and numerical ability. This is quite different to the EQ which focuses on our ability to empathise, our intuition, resilience and our leadership skills.
Why is it important?
Research has shown that our success in the work place depends 80% on our emotional intelligence vs. 20% of our intellect. Source.
This means that more and more work places are looking at a potential employees EQ rather than their IQ when they are hiring. Where the IQ can tell about your intellect, the EQ will tell them about
how you work in a team, if you're able to empathise with others within the work place, if you're creative and proactive.


JavaScript is disabled on your browser.
Skip navigation links
Overview
Package
Class
Use
Tree
Deprecated
Index
Help
Prev Letter
Next Letter
Frames
No Frames
All Classes
A
B
C
D
E
F
G
H
I
L
M
N
O
P
Q
R
S
T
U
X
Y
Z
B
BAKE_FLIP_U
- Static variable in interface net.fabricmc.fabric.api.renderer.v1.mesh.
MutableQuadView
When set, U texture coordinates for the given sprite are flipped as part of baking.
BAKE_FLIP_V
- Static variable in interface net.fabricmc.fabric.api.renderer.v1.mesh.
MutableQuadView
Same as
MutableQuadView.BAKE_FLIP_U
but for V coordinate.
BAKE_LOCK_UV
- Static variable in interface net.fabricmc.fabric.api.renderer.v1.mesh.
MutableQuadView
When enabled, texture coordinate are assigned based on vertex position.
BAKE_NORMALIZED
- Static variable in interface net.fabricmc.fabric.api.renderer.v1.mesh.
MutableQuadView
UV coordinates by default are assumed to be 0-16 scale for consistency with conventional Minecraft model format.
BAKE_ROTATE_180
- Static variable in interface net.fabricmc.fabric.api.renderer.v1.mesh.
MutableQuadView
Causes texture to appear rotated 180 deg.
BAKE_ROTATE_270
- Static variable in interface net.fabricmc.fabric.api.renderer.v1.mesh.
MutableQuadView
Causes texture to appear rotated 270 deg.
BAKE_ROTATE_90
- Static variable in interface net.fabricmc.fabric.api.renderer.v1.mesh.
MutableQuadView
Causes texture to appear rotated 90 deg.
BAKE_ROTATE_NONE
- Static variable in interface net.fabricmc.fabric.api.renderer.v1.mesh.
MutableQuadView
Causes texture to appear with no rotation.
blendMode(int, BlockRenderLayer)
- Method in interface net.fabricmc.fabric.api.renderer.v1.material.
MaterialFinder
Defines how sprite pixels will be blended with the scene.
BLOCK
- Static variable in interface net.fabricmc.fabric.api.client.render.
ColorProviderRegistry
BlockEntityRendererRegistry
- Class in
net.fabricmc.fabric.api.client.render
Helper class for registering BlockEntityRenderers.
build()
- Method in interface net.fabricmc.fabric.api.renderer.v1.mesh.
MeshBuilder
Returns a new
Mesh
instance containing all quads added to this builder and resets the builder to an empty state
A
B
C
D
E
F
G
H
I
L
M
N
O
P
Q
R
S
T
U
X
Y
Z
Skip navigation links
Overview
Package
Class
Use
Tree
Deprecated
Index
Help
Prev Letter
Next Letter
Frames
No Frames
All Classes


Decryption of this content failed
Reactivate keys Learn more
Verification of this content’s signature failed
Learn more


purrito(1) purr(1) /\_/\ ( o.o ) > ^ < NAME purrito: ultra fast, minimalistic, encrypted command line paste-bin purr: POSIX shell client to paste to bsd.ac meow: POSIX shell client to paste encrypted paste to bsd.ac meowd: POSIX shell client to decrypt encrypted paste from bsd.ac CLIENT : ${P_SERVER=bsd.ac} : ${P_PORT=42069} : ${P_MAXTIME=30} : ${_PL=week} # can be set to day/week/month/<lifetime-in-minutes> # POSIX shell client to upload standard message purr() { curl --silent --max-time "${P_MAXTIME}" --data-binary "@${1:-/dev/stdin}" "${P_SERVER}:${P_PORT}/${_PL}" } # POSIX shell client to upload encrypted message meow() { # we need to generate a 256 byte random key # for using the aes-256-cbc cipher key="$(openssl rand -hex 32)" iv="$(openssl rand -hex 16)" # calculate its encryption and upload it url="$(openssl enc -aes-256-cbc -K ${key} -iv ${iv} -e -base64 -A < ${1:-/dev/stdin} | purr)" printf %s\\n "${url%\/*}/paste.html#${url##*\/}_${key}_${iv}" unset key iv url } # POSIX shell client to decrypt the message meowd() { url="$1" baseurl="${url%\/*}" vals="${url##*\#}" paste=$(printf %s\\n "${vals}" | cut -d'_' -f1) key=$(printf %s\\n "${vals}" | cut -d'_' -f2) iv=$(printf %s\\n "${vals}" | cut -d'_' -f3) curl --max-time "${P_MAXTIME}" --write-out "\n" --silent "${baseurl}/${paste}" | openssl enc -aes-256-cbc -base64 -d -K ${key} -iv ${iv} unset url baseurl vals paste key iv } USAGE ~$ purr c00lfile.txt https://bsd.ac/purrit0 ~$ purr < h0tfile.txt https://bsd.ac/purri1o ~$ echo Hello world. | purr https://bsd.ac/d4nklit ~$ purr This is my input it can span multiple lines <Ctrl-d to exit> https://bsd.ac/curlpr0 LIMITS max paste size: 64KB SOURCE https://github.com/PurritoBin/PurritoBin


#-- /********************************************************************************** * $URL: https://source.etudes.org/svn/apps/jforum/tags/2.27/jforum-tool/src/webapp/templates/default/pm_am_form.htm $ * $Id: pm_am_form.htm 9890 2015-01-23 17:56:50Z mallikamt $ *********************************************************************************** * * Copyright (c) 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015 Etudes, Inc. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. ***********************************************************************************/ --> <#setting number_format = "#"/> <#setting datetime_format = dateTimeFormat/> <#assign logged = logged?default(false)/>


AUD/USD slides to 0.6820 horizontal support
by Haresh Menghani- AUD/USD remains on the defensive amid persistent US-China trade uncertainty.
- The USD fails to capitalize on the post-NFP positive move and might lend support.
- The market focus now shifts to the latest FOMC policy update, due later this week.
The AUD/USD pair refreshed daily lows during the early European session on Monday and is currently placed near the 0.6820 horizontal support.
The pair failed to capitalize on its early uptick, rather met with some fresh supply and extended Friday's post-NFP pullback from the 0.6855-60 supply zone. It is worth recalling that the latest US monthly employment details showed that employers added 266K jobs in November and unemployment rate unexpectedly dipped to 3.5%, which provided a goodish lift to the US dollar and exerted some pressure on the major.
Weighed down by trade uncertainty
The USD struggled to build on the previous session's positive momentum, albeit persistent uncertainty over phase one US-China trade deal turned out to be one of the key factors weighing on the China-proxy Australian dollar. In the latest development, top White House Economic Adviser Larry Kudlow confirmed on Friday that the December 15 deadline to impose the new tariffs on Chinese products remains in place.
Despite the pullback, the pair remains well within a familiar trading range held over the past four trading sessions. Hence, it will be prudent to wait for some strong follow-through selling before positioning for any further near-term depreciating move amid absent relevant market-moving economic releases on Monday. Meanwhile, the key focus will remain on the latest FOMC monetary policy update, due later this week.
Technical levels to watch
AUD/USD
| Overview | |
|---|---|
| Today last price | 0.6822 |
| Today Daily Change | -0.0018 |
| Today Daily Change % | -0.26 |
| Today daily open | 0.684 |
| Trends | |
|---|---|
| Daily SMA20 | 0.6811 |
| Daily SMA50 | 0.6813 |
| Daily SMA100 | 0.6812 |
| Daily SMA200 | 0.6915 |
| Levels | |
|---|---|
| Previous Daily High | 0.6858 |
| Previous Daily Low | 0.6823 |
| Previous Weekly High | 0.6863 |
| Previous Weekly Low | 0.6762 |
| Previous Monthly High | 0.6929 |
| Previous Monthly Low | 0.6754 |
| Daily Fibonacci 38.2% | 0.6844 |
| Daily Fibonacci 61.8% | 0.6836 |
| Daily Pivot Point S1 | 0.6823 |
| Daily Pivot Point S2 | 0.6806 |
| Daily Pivot Point S3 | 0.6788 |
| Daily Pivot Point R1 | 0.6857 |
| Daily Pivot Point R2 | 0.6875 |
| Daily Pivot Point R3 | 0.6892 |


pub static ACTIVE_ATTRIBUTES: c_uint = 0x8B89 as c_uint |
|
pub static ACTIVE_ATTRIBUTE_MAX_LENGTH: c_uint = 0x8B8A as c_uint |
|
pub static ACTIVE_TEXTURE: c_uint = 0x84E0 as c_uint |
|
pub static ACTIVE_UNIFORMS: c_uint = 0x8B86 as c_uint |
|
pub static ACTIVE_UNIFORM_MAX_LENGTH: c_uint = 0x8B87 as c_uint |
|
pub static ALIASED_LINE_WIDTH_RANGE: c_uint = 0x846E as c_uint |
|
pub static ALIASED_POINT_SIZE_RANGE: c_uint = 0x846D as c_uint |
|
pub static ALPHA: c_uint = 0x1906 as c_uint |
|
pub static ALPHA_BITS: c_uint = 0x0D55 as c_uint |
|
pub static ALWAYS: c_uint = 0x0207 as c_uint |
|
pub static ARRAY_BUFFER: c_uint = 0x8892 as c_uint |
|
pub static ARRAY_BUFFER_BINDING: c_uint = 0x8894 as c_uint |
|
pub static ATTACHED_SHADERS: c_uint = 0x8B85 as c_uint |
|
pub static BACK: c_uint = 0x0405 as c_uint |
|
pub static BGRA: c_uint = 0x80e1 as c_uint |
|
pub static BLEND: c_uint = 0x0BE2 as c_uint |
|
pub static BLEND_COLOR: c_uint = 0x8005 as c_uint |
|
pub static BLEND_DST_ALPHA: c_uint = 0x80CA as c_uint |
|
pub static BLEND_DST_RGB: c_uint = 0x80C8 as c_uint |
|
pub static BLEND_EQUATION: c_uint = 0x8009 as c_uint |
|
pub static BLEND_EQUATION_ALPHA: c_uint = 0x883D as c_uint |
|
pub static BLEND_EQUATION_RGB: c_uint = 0x8009 as c_uint |
|
pub static BLEND_SRC_ALPHA: c_uint = 0x80CB as c_uint |
|
pub static BLEND_SRC_RGB: c_uint = 0x80C9 as c_uint |
|
pub static BLUE: c_uint = 0x1905 as c_uint |
|
pub static BLUE_BITS: c_uint = 0x0D54 as c_uint |
|
pub static BYTE: c_uint = 0x1400 as c_uint |
|
pub static CCW: c_uint = 0x0901 as c_uint |
|
pub static CLAMP_TO_EDGE: c_uint = 0x812F as c_uint |
|
pub static COLOR_ATTACHMENT0: c_uint = 0x8CE0 as c_uint |
|
pub static COLOR_BUFFER_BIT: c_uint = 0x00004000 as c_uint |
|
pub static COLOR_CLEAR_VALUE: c_uint = 0x0C22 as c_uint |
|
pub static COLOR_WRITEMASK: c_uint = 0x0C23 as c_uint |
|
pub static COMPILE_STATUS: c_uint = 0x8B81 as c_uint |
|
pub static CONSTANT_ALPHA: c_uint = 0x8003 as c_uint |
|
pub static CONSTANT_COLOR: c_uint = 0x8001 as c_uint |
|
pub static CULL_FACE: c_uint = 0x0B44 as c_uint |
|
pub static CULL_FACE_MODE: c_uint = 0x0B45 as c_uint |
|
pub static CURRENT_PROGRAM: c_uint = 0x8B8D as c_uint |
|
pub static CW: c_uint = 0x0900 as c_uint |
|
pub static DELETE_STATUS: c_uint = 0x8B80 as c_uint |
|
pub static DEPTH_BITS: c_uint = 0x0D56 as c_uint |
|
pub static DEPTH_BUFFER_BIT: c_uint = 0x00000100 as c_uint |
|
pub static DEPTH_CLEAR_VALUE: c_uint = 0x0B73 as c_uint |
|
pub static DEPTH_COMPONENT: c_uint = 0x1902 as c_uint |
|
pub static DEPTH_FUNC: c_uint = 0x0B74 as c_uint |
|
pub static DEPTH_RANGE: c_uint = 0x0B70 as c_uint |
|
pub static DEPTH_TEST: c_uint = 0x0B71 as c_uint |
|
pub static DEPTH_WRITEMASK: c_uint = 0x0B72 as c_uint |
|
pub static DITHER: c_uint = 0x0BD0 as c_uint |
|
pub static DST_ALPHA: c_uint = 0x0304 as c_uint |
|
pub static DST_COLOR: c_uint = 0x0306 as c_uint |
|
pub static DYNAMIC_DRAW: c_uint = 0x88E8 as c_uint |
|
pub static EDGE_FLAG: c_uint = 0x0B43 as c_uint |
|
pub static ELEMENT_ARRAY_BUFFER: c_uint = 0x8893 as c_uint |
|
pub static ELEMENT_ARRAY_BUFFER_BINDING: c_uint = 0x8895 as c_uint |
|
pub static EQUAL: c_uint = 0x0202 as c_uint |
|
pub static EXTENSIONS: c_uint = 0x1F03 as c_uint |
|
pub static FALSE: c_uchar = 0 as c_uchar |
|
pub static FILL: c_uint = 0x1B02 as c_uint |
|
pub static FIXED: c_uint = 0x140C as c_uint |
|
pub static FLOAT: c_uint = 0x1406 as c_uint |
|
pub static FRAGMENT_SHADER: c_uint = 0x8B30 as c_uint |
|
pub static FRAMEBUFFER: c_uint = 0x8D40 as c_uint |
|
pub static FRAMEBUFFER_COMPLETE: c_uint = 0x8CD5 as c_uint |
|
pub static FRONT: c_uint = 0x0404 as c_uint |
|
pub static FRONT_AND_BACK: c_uint = 0x0408 as c_uint |
|
pub static FRONT_FACE: c_uint = 0x0B46 as c_uint |
|
pub static FUNC_ADD: c_uint = 0x8006 as c_uint |
|
pub static FUNC_REVERSE_SUBTRACT: c_uint = 0x800B as c_uint |
|
pub static FUNC_SUBTRACT: c_uint = 0x800A as c_uint |
|
pub static GEQUAL: c_uint = 0x0206 as c_uint |
|
pub static GREATER: c_uint = 0x0204 as c_uint |
|
pub static GREEN: c_uint = 0x1904 as c_uint |
|
pub static GREEN_BITS: c_uint = 0x0D53 as c_uint |
|
pub static INFO_LOG_LENGTH: c_uint = 0x8B84 as c_uint |
|
pub static INT: c_uint = 0x1404 as c_uint |
|
pub static INVALID_ENUM: c_uint = 0x0500 as c_uint |
|
pub static INVALID_FRAMEBUFFER_OPERATION: c_uint = 0x0506 as c_uint |
|
pub static INVALID_OPERATION: c_uint = 0x0502 as c_uint |
|
pub static INVALID_VALUE: c_uint = 0x0501 as c_uint |
|
pub static LEQUAL: c_uint = 0x0203 as c_uint |
|
pub static LESS: c_uint = 0x0201 as c_uint |
|
pub static LINE: c_uint = 0x1B01 as c_uint |
|
pub static LINEAR: c_uint = 0x2601 as c_uint |
|
pub static LINES: c_uint = 0x0001 as c_uint |
|
pub static LINE_LOOP: c_uint = 0x0002 as c_uint |
|
pub static LINE_STRIP: c_uint = 0x0003 as c_uint |
|
pub static LINE_WIDTH: c_uint = 0x0B21 as c_uint |
|
pub static LINK_STATUS: c_uint = 0x8B82 as c_uint |
|
pub static MAX_COMBINED_TEXTURE_IMAGE_UNITS: c_uint = 0x8B4D as c_uint |
|
pub static MAX_FRAGMENT_UNIFORM_VECTORS: c_uint = 0x8DFD as c_uint |
|
pub static MAX_TEXTURE_IMAGE_UNITS: c_uint = 0x8872 as c_uint |
|
pub static MAX_TEXTURE_SIZE: c_uint = 0x0D33 as c_uint |
|
pub static MAX_VARYING_VECTORS: c_uint = 0x8DFC as c_uint |
|
pub static MAX_VERTEX_ATTRIBS: c_uint = 0x8869 as c_uint |
|
pub static MAX_VERTEX_TEXTURE_IMAGE_UNITS: c_uint = 0x8B4C as c_uint |
|
pub static MAX_VERTEX_UNIFORM_VECTORS: c_uint = 0x8DFB as c_uint |
|
pub static MAX_VIEWPORT_DIMS: c_uint = 0x0D3A as c_uint |
|
pub static MIRRORED_REPEAT: c_uint = 0x8370 as c_uint |
|
pub static NEAREST: c_uint = 0x2600 as c_uint |
|
pub static NEVER: c_uint = 0x0200 as c_uint |
|
pub static NOTEQUAL: c_uint = 0x0205 as c_uint |
|
pub static NO_ERROR: c_uint = 0 as c_uint |
|
pub static ONE: c_uint = 1 as c_uint |
|
pub static ONE_MINUS_CONSTANT_ALPHA: c_uint = 0x8004 as c_uint |
|
pub static ONE_MINUS_CONSTANT_COLOR: c_uint = 0x8002 as c_uint |
|
pub static ONE_MINUS_DST_ALPHA: c_uint = 0x0305 as c_uint |
|
pub static ONE_MINUS_DST_COLOR: c_uint = 0x0307 as c_uint |
|
pub static ONE_MINUS_SRC_ALPHA: c_uint = 0x0303 as c_uint |
|
pub static ONE_MINUS_SRC_COLOR: c_uint = 0x0301 as c_uint |
|
pub static OUT_OF_MEMORY: c_uint = 0x0505 as c_uint |
|
pub static PACK_ALIGNMENT: c_uint = 0x0D05 as c_uint |
|
pub static POINT: c_uint = 0x1B00 as c_uint |
|
pub static POINTS: c_uint = 0x0000 as c_uint |
|
pub static POLYGON_MODE: c_uint = 0x0B40 as c_uint |
|
pub static POLYGON_OFFSET_FACTOR: c_uint = 0x8038 as c_uint |
|
pub static POLYGON_OFFSET_FILL: c_uint = 0x8037 as c_uint |
|
pub static POLYGON_OFFSET_UNITS: c_uint = 0x2A00 as c_uint |
|
pub static POLYGON_SMOOTH: c_uint = 0x0B41 as c_uint |
|
pub static POLYGON_STIPPLE: c_uint = 0x0B42 as c_uint |
|
pub static RED: c_uint = 0x1903 as c_uint |
|
pub static RED_BITS: c_uint = 0x0D52 as c_uint |
|
pub static RENDERBUFFER: c_uint = 0x8D41 as c_uint |
|
pub static RENDERER: c_uint = 0x1F01 as c_uint |
|
pub static REPEAT: c_uint = 0x2901 as c_uint |
|
pub static RGB: c_uint = 0x1907 as c_uint |
|
pub static RGBA: c_uint = 0x1908 as c_uint |
|
pub static RGBA8: c_uint = 0x8058 as c_uint |
|
pub static SAMPLES: c_uint = 0x80A9 as c_uint |
|
pub static SAMPLE_ALPHA_TO_COVERAGE: c_uint = 0x809E as c_uint |
|
pub static SAMPLE_BUFFERS: c_uint = 0x80A8 as c_uint |
|
pub static SAMPLE_COVERAGE: c_uint = 0x80A0 as c_uint |
|
pub static SAMPLE_COVERAGE_INVERT: c_uint = 0x80AB as c_uint |
|
pub static SAMPLE_COVERAGE_VALUE: c_uint = 0x80AA as c_uint |
|
pub static SCISSOR_BOX: c_uint = 0x0C10 as c_uint |
|
pub static SCISSOR_TEST: c_uint = 0x0C11 as c_uint |
|
pub static SHADER_COMPILER: c_uint = 0x8DFA as c_uint |
|
pub static SHADER_SOURCE_LENGTH: c_uint = 0x8B88 as c_uint |
|
pub static SHADER_TYPE: c_uint = 0x8B4F as c_uint |
|
pub static SHADING_LANGUAGE_VERSION: c_uint = 0x8B8C as c_uint |
|
pub static SHORT: c_uint = 0x1402 as c_uint |
|
pub static SRC_ALPHA: c_uint = 0x0302 as c_uint |
|
pub static SRC_ALPHA_SATURATE: c_uint = 0x0308 as c_uint |
|
pub static SRC_COLOR: c_uint = 0x0300 as c_uint |
|
pub static STACK_OVERFLOW: c_uint = 0x0503 as c_uint |
|
pub static STACK_UNDERFLOW: c_uint = 0x0504 as c_uint |
|
pub static STATIC_DRAW: c_uint = 0x88E4 as c_uint |
|
pub static STENCIL_BACK_FAIL: c_uint = 0x8801 as c_uint |
|
pub static STENCIL_BACK_FUNC: c_uint = 0x8800 as c_uint |
|
pub static STENCIL_BACK_PASS_DEPTH_FAIL: c_uint = 0x8802 as c_uint |
|
pub static STENCIL_BACK_PASS_DEPTH_PASS: c_uint = 0x8803 as c_uint |
|
pub static STENCIL_BACK_REF: c_uint = 0x8CA3 as c_uint |
|
pub static STENCIL_BACK_VALUE_MASK: c_uint = 0x8CA4 as c_uint |
|
pub static STENCIL_BACK_WRITEMASK: c_uint = 0x8CA5 as c_uint |
|
pub static STENCIL_BITS: c_uint = 0x0D57 as c_uint |
|
pub static STENCIL_BUFFER_BIT: c_uint = 0x00000400 as c_uint |
|
pub static STENCIL_CLEAR_VALUE: c_uint = 0x0B91 as c_uint |
|
pub static STENCIL_FAIL: c_uint = 0x0B94 as c_uint |
|
pub static STENCIL_FUNC: c_uint = 0x0B92 as c_uint |
|
pub static STENCIL_PASS_DEPTH_FAIL: c_uint = 0x0B95 as c_uint |
|
pub static STENCIL_PASS_DEPTH_PASS: c_uint = 0x0B96 as c_uint |
|
pub static STENCIL_REF: c_uint = 0x0B97 as c_uint |
|
pub static STENCIL_TEST: c_uint = 0x0B90 as c_uint |
|
pub static STENCIL_VALUE_MASK: c_uint = 0x0B93 as c_uint |
|
pub static STENCIL_WRITEMASK: c_uint = 0x0B98 as c_uint |
|
pub static STORAGE_CACHED_APPLE: c_uint = 0x85BE as c_uint |
|
pub static STORAGE_SHARED_APPLE: c_uint = 0x85BF as c_uint |
|
pub static STREAM_DRAW: c_uint = 0x88E0 as c_uint |
|
pub static SUBPIXEL_BITS: c_uint = 0x0D50 as c_uint |
|
pub static TEXTURE0: c_uint = 0x84C0 as c_uint |
|
pub static TEXTURE1: c_uint = 0x84C1 as c_uint |
|
pub static TEXTURE10: c_uint = 0x84CA as c_uint |
|
pub static TEXTURE11: c_uint = 0x84CB as c_uint |
|
pub static TEXTURE12: c_uint = 0x84CC as c_uint |
|
pub static TEXTURE13: c_uint = 0x84CD as c_uint |
|
pub static TEXTURE14: c_uint = 0x84CE as c_uint |
|
pub static TEXTURE15: c_uint = 0x84CF as c_uint |
|
pub static TEXTURE16: c_uint = 0x84D0 as c_uint |
|
pub static TEXTURE17: c_uint = 0x84D1 as c_uint |
|
pub static TEXTURE18: c_uint = 0x84D2 as c_uint |
|
pub static TEXTURE19: c_uint = 0x84D3 as c_uint |
|
pub static TEXTURE2: c_uint = 0x84C2 as c_uint |
|
pub static TEXTURE20: c_uint = 0x84D4 as c_uint |
|
pub static TEXTURE21: c_uint = 0x84D5 as c_uint |
|
pub static TEXTURE22: c_uint = 0x84D6 as c_uint |
|
pub static TEXTURE23: c_uint = 0x84D7 as c_uint |
|
pub static TEXTURE24: c_uint = 0x84D8 as c_uint |
|
pub static TEXTURE25: c_uint = 0x84D9 as c_uint |
|
pub static TEXTURE26: c_uint = 0x84DA as c_uint |
|
pub static TEXTURE27: c_uint = 0x84DB as c_uint |
|
pub static TEXTURE28: c_uint = 0x84DC as c_uint |
|
pub static TEXTURE29: c_uint = 0x84DD as c_uint |
|
pub static TEXTURE3: c_uint = 0x84C3 as c_uint |
|
pub static TEXTURE30: c_uint = 0x84DE as c_uint |
|
pub static TEXTURE31: c_uint = 0x84DF as c_uint |
|
pub static TEXTURE4: c_uint = 0x84C4 as c_uint |
|
pub static TEXTURE5: c_uint = 0x84C5 as c_uint |
|
pub static TEXTURE6: c_uint = 0x84C6 as c_uint |
|
pub static TEXTURE7: c_uint = 0x84C7 as c_uint |
|
pub static TEXTURE8: c_uint = 0x84C8 as c_uint |
|
pub static TEXTURE9: c_uint = 0x84C9 as c_uint |
|
pub static TEXTURE_2D: c_uint = 0x0DE1 as c_uint |
|
pub static TEXTURE_BINDING_2D: c_uint = 0x8069 as c_uint |
|
pub static TEXTURE_MAG_FILTER: c_uint = 0x2800 as c_uint |
|
pub static TEXTURE_MIN_FILTER: c_uint = 0x2801 as c_uint |
|
pub static TEXTURE_RECTANGLE_ARB: c_uint = 0x84F5 as c_uint |
|
pub static TEXTURE_STORAGE_HINT_APPLE: c_uint = 0x85BC as c_uint |
|
pub static TEXTURE_WRAP_S: c_uint = 0x2802 as c_uint |
|
pub static TEXTURE_WRAP_T: c_uint = 0x2803 as c_uint |
|
pub static TRIANGLES: c_uint = 0x0004 as c_uint |
|
pub static TRIANGLE_FAN: c_uint = 0x0006 as c_uint |
|
pub static TRIANGLE_STRIP: c_uint = 0x0005 as c_uint |
|
pub static TRUE: c_uchar = 1 as c_uchar |
|
pub static UNPACK_ALIGNMENT: c_uint = 0x0CF5 as c_uint |
|
pub static UNPACK_CLIENT_STORAGE_APPLE: c_uint = 0x85B2 as c_uint |
|
pub static UNPACK_ROW_LENGTH: c_uint = 0x0CF2 as c_uint |
|
pub static UNSIGNED_BYTE: c_uint = 0x1401 as c_uint |
|
pub static UNSIGNED_INT: c_uint = 0x1405 as c_uint |
|
pub static UNSIGNED_INT_8_8_8_8_REV: c_uint = 0x8367 as c_uint |
|
pub static UNSIGNED_SHORT: c_uint = 0x1403 as c_uint |
|
pub static VALIDATE_STATUS: c_uint = 0x8B83 as c_uint |
|
pub static VENDOR: c_uint = 0x1F00 as c_uint |
|
pub static VERSION: c_uint = 0x1F02 as c_uint |
|
pub static VERTEX_SHADER: c_uint = 0x8B31 as c_uint |
|
pub static VIEWPORT: c_uint = 0x0BA2 as c_uint |
|
pub static ZERO: c_uint = 0 as c_uint |
|


- 10GB Storage
- 500 Computational Seconds
- $1 Voucher for each 100 Computational Seconds (over 60 seconds)
$75/month
Buy Now
- 50GB Storage
- 5000 Computational Seconds
- $10 Voucher for each 1000 Computational Seconds (over 60 seconds)
$500/month
Buy Now
- Custom Amount of Storage
- Custom Number of Computational Seconds
- Custom Voucher Rate
Custom Price
Buy Now


Title Case Generator
Enter what you would like converted to title case:
Convert
Here's your converted junk:


{% extends "base.html" %} {% block content %}
Something went wrong on our end. How about we take you back to Inkpebble?
Return home


Openfire ${project.version}
Openfire provides comprehensive group chat and instant messaging (IM) services using the XMPP protocol.
Administrator Documentation
Basic Server Administration
- Installation Guide
- How to install Openfire.
- Database Installation Guide
- How to setup your database for use with Openfire.
- Upgrade Guide
- Instructions for upgrading an existing Openfire installation.
- Recovery of an Admin Password
- Instructions to recover an administrative account for which the password has been lost.
Advanced Server Administration
- TLS/SSL Guide
- A guide to setting up Openfire's SSL secure socket support.
- Separating Administrative Users Guide
- A guide to setting up Openfire to work with different user stores for admins and non-administrative users.
- Load Balancing Guide
- How to spread client and server connections over multiple instances of Openfire
- Clustered Database Guide
- Instructions on using Openfire with a database that consists of more than one server.
- Trunking (Gateway) Guide
- A guide to set up Openfire to mediate traffic that is exchanged between other XMPP domains
Integration with External Data Sources
- Active Directory and LDAP Integration Guide
- A guide to setting up Openfire to work with Active Directory or LDAP user stores.
- Custom Database Integration Guide
- A guide to integrating Openfire authentication, user, and group data with a custom database.
Developer Documentation
Generic Development Guides
- Building the Source
- Instructions for downloading and compiling the Openfire source code.
- Openfire Source Code in Visual Studio Code
- A short tutorial on how to work with the Openfire source code in the Visual Studio Code IDE.
- Plugin Developer Guide
- A guide to writing and installing plugins for Openfire.
- Translator Guide
- Information for those interested in translating the admin console of Openfire into other languages.
- Customization Guide
- Instructions on customization support within the build process for Openfire.
- Tips & tricks for working with Openfire
- Some collected tools, tips and useful links.
Data Provider / IAM Implementation Guides
- Custom Authentication Provider Guide
- Describes how to integrate Openfire with an external authentication system.
- Custom Group Provider Guide
- Describes how to integrate Openfire with an external system that provides Group definitions.
- Custom User Provider Guide
- Describes how to integrate Openfire with an external system that provides User definitions
- Pluggable Roster Support Guide
- A guide to integrating Openfire rosters with an alternate store.
Reference Documentation
- JavaDocs
- Openfire API documentation.
- Protocol Support
- Provides details on the XMPP support and XEPs that Openfire implements.
- Database Schema Guide
- A tour of the Openfire database schema for developers and database administrators.


Hint
Think about the dictionary: what is the key and what is the value?
How can we get the last names?
Use the sorted function with a key to sort the names.