{% extends 'base.html'%} {% import "bootstrap/wtf.html" as wtf %} {% block content %}
{{pitch.pitch}}
Posted at: {{pitch.posted}}
Leave Comment


A Dallas/Fort Worth native, I have a diverse professional background including design, education, and mortgage. I've always loved technology and fell in love with web development when I decided to make a drastic career change. The most exciting thing about the tech field is that it's always evolving and each day presents a new challenge. These challenges and emerging technologies makes this a fantastic time to be in the field. I'm currently working as a junior developer and mentor teaching at the DevMountain coding boot camp in Dallas, Texas. Please feel free to contact me with any questions, tips, or opportunities!
Click this link to check out my professional resume


|
Depth Clustering
|
Class for image based clusterer. More...
#include <image_based_clusterer.h>
Public Types | |
| using | Receiver = AbstractClient< Cloud > |
| using | Sender = AbstractSender< std::unordered_map< uint16_t, Cloud > > |
| Public Types inherited from depth_clustering::AbstractClusterer | |
| using | Receiver = AbstractClient< Cloud > |
| using | Sender = AbstractSender< std::unordered_map< uint16_t, Cloud > > |
Public Member Functions | |
| ImageBasedClusterer (Radians angle_tollerance=8_deg, uint16_t min_cluster_size=100, uint16_t max_cluster_size=25000) | |
| Construct an image-based clusterer. More... | |
| void | SetDiffType (DiffFactory::DiffType diff_type) |
| Sets the difference type. More... | |
| void | SetLabelImageClient (AbstractClient< cv::Mat > *client) |
| Sets the label image client. More... | |
| void | OnNewObjectReceived (const Cloud &cloud, int) override |
| Gets called when clusterer receives a cloud to cluster. More... | |
| Public Member Functions inherited from depth_clustering::AbstractClusterer | |
| AbstractClusterer (double cluster_tollerance=0.2, uint16_t min_cluster_size=100, uint16_t max_cluster_size=25000, uint16_t skip=10) | |
| Construct a clusterer. More... | |
| Public Member Functions inherited from depth_clustering::Identifiable | |
| int | id () const |
| Gets current object id. More... | |
| virtual std::string | guess_class_name () const |
| Guesses class name from typeid. More... | |
| Public Member Functions inherited from depth_clustering::AbstractSender< std::unordered_map< uint16_t, Cloud > > | |
| AbstractSender (SenderType type=SenderType::UNDEFINED) | |
| const char * | type () const |
| Gets type of sender as string. More... | |
| void | AddClient (AbstractClient< std::unordered_map< uint16_t, Cloud > > *client) |
| Adds a client. More... | |
| void | RemoveClient (int id) |
| Removes a client. More... | |
| void | RemoveClient (AbstractClient< std::unordered_map< uint16_t, Cloud > > *client) |
| size_t | client_count () |
| Get number of clients currently subscribed. More... | |
| void | ShareDataWithAllClients (const std::unordered_map< uint16_t, Cloud > &obj, int id=-1) |
| Shares data with everyone who listens to it. More... | |
Additional Inherited Members | |
| Static Public Member Functions inherited from depth_clustering::Identifiable | |
| static int | get_current_id_counter () |
| Gets the current identifier counter. More... | |
| Protected Types inherited from depth_clustering::AbstractSender< std::unordered_map< uint16_t, Cloud > > | |
| using | IdClientMapping = std::map< int, AbstractClient< std::unordered_map< uint16_t, Cloud > > *> |
| Static Protected Member Functions inherited from depth_clustering::Identifiable | |
| static std::string | DemangleName (const char *tname) |
| Protected Attributes inherited from depth_clustering::AbstractClusterer | |
| double | _cluster_tollerance |
| uint16_t | _min_cluster_size |
| uint16_t | _max_cluster_size |
| uint16_t | _skip |
| uint32_t | _counter |
| Protected Attributes inherited from depth_clustering::Identifiable | |
| const int | _kId |
| Protected Attributes inherited from depth_clustering::AbstractSender< std::unordered_map< uint16_t, Cloud > > | |
| IdClientMapping | _clients |
| SenderType | _type |
| Static Protected Attributes inherited from depth_clustering::Identifiable | |
| static int | UniqueIdCounter = 0 |
Class for image based clusterer.
| LabelerT | A Labeler class to be used for labeling. |
|
inlineexplicit |
Construct an image-based clusterer.
| [in] | angle_tollerance | The angle tollerance to separate objects |
| [in] | min_cluster_size | The minimum cluster size to send |
| [in] | max_cluster_size | The maximum cluster size to send |
|
inlineoverridevirtual |
Gets called when clusterer receives a cloud to cluster.
| [in] | cloud | The cloud to cluster |
| [in] | sender_id | The sender identifier |
Implements depth_clustering::AbstractClient< Cloud >.
|
inline |
Sets the difference type.
| [in] | diff_type | The difference type |
|
inline |
Sets the label image client.
| client | The client to receive color images with labels |


Developing Python functions
Python function template structure
When you create a Python function using the kn func
CLI, the project directory looks like a typical Python project, with the exception of an additional func.yaml
configuration file. Both http
and event
trigger functions have the same template structure:
fn
├── func.py (1)
├── func.yaml (2)
├── requirements.txt (3)
└── test_func.py (4)
| 1 | Python functions have very few restrictions. The only real requirement is that your project contain a func.py file which contains a main() function. |
| 2 | The func.yaml configuration file is used to determine the image name and registry. |
| 3 | Additional dependencies can be added to the requirements.txt file as they would be in any other Python project. |
| 4 | The test_func.py file contains a simple unit test that can be used to test your function locally. |
Dependencies
Developers are not restricted to the dependencies provided in the template requirements.txt
file. Additional dependencies can be added as they would be in any other Python project. When the project is built for deployment, these dependencies will be included in the created runtime container image.
Invoking a function
When using the kn func
CLI to create a function project you can generate a project that responds to CloudEvents, or one that responds to simple HTTP requests. CloudEvents in Knative are transported over HTTP as a POST request, so both function types will listen and respond to incoming HTTP events.
Python functions can be invoked with a simple HTTP request. When an incoming request is received, functions are invoked with a context
object as the first parameter.
Context objects
Functions are invoked by providing a context
object as the first parameter. This object is a Python class with two attributes.
-
The
request
attribute will always be present, and contains the Flaskrequest
object. -
The second attribute,
cloud_event
, will be populated if the incoming request is aCloudEvent
.
Developers may access any CloudEvent
data from the context object.
def main(context: Context):
"""
The context parameter contains the Flask request object and any
CloudEvent received with the request.
"""
print(f"Method: {context.request.method}")
print(f"Event data {context.cloud_event.data})
# ... business logic here
Return values
Functions may return any value supported by Flask because the invocation framework proxies these values directly to the Flask server.
def main(context: Context):
data = { "message": "Howdy!" }
headers = { "content-type": "application/json" }
return body, 200, headers
Functions can set both response codes and headers as secondary and tertiary response values from function invocation.
Returning CloudEvents
Developers can use the @event
decorator to tell the invoker that the function return value must be converted to a CloudEvent
before sending the response.
@event("event_source"="/my/function", "event_type"="my.type")
def main(context):
# business logic here
data = do_something()
# more data processing
return data
This example sends a CloudEvent
as the response value, with a type of "my.type"
, a source of "/my/function"
, and the data property set to data
. The event_source
and event_type
decorator attributes are both optional.
If not specified, the CloudEvent event_source
attribute is set to "/parliament/function"
, and the event_type
attribute is set to "parliament.response"
.
Additional resources
-
See the Flask documentation.
Testing a Python function locally
Python functions can be tested locally on your computer. In the default project that is created when you create a function using kn func create
, there is a test_func.py
file which contains a simple unit test.
-
To run these tests locally, you must install the required dependencies:
$ pip install -r requirements.txt
-
Once you have installed the dependencies, run the tests:
$ python3 test_func.py
|
The default test framework for Python functions is |


This example demonstrates the difference between rollover
/
rollout
and mouseover
/ mouseout
events. The red and blue squares
are separate Shape instances within a parent Container. The Container
has both rollover/rollout and
mouseover/mouseout events.
Note how the mouseover/mouseout events are triggered whenever you move between different display objects (ex. moving from the blue to red shape), but the rollover/rollout events are only triggered when you leave the Container's aggregate contents.


isambard.ampal.specifications.assembly_specs.coiledcoil module¶
Contains code for modelling coiled coils and collagens.
-
class
CoiledCoil
(n, auto_build=True)[source]¶ Bases:
ampal.assembly.Assembly
Models a coiled-coil protein.
Notes
Instantiating this class using just an oligomeric state is used to create simple reference models. To build more complex models use the from_parameters classmethod.
Parameters: -
aas
¶ [int] – Number of amino acids in each minor helix.
-
basis_set_sequences
¶ [str] – Reference sequences for the oligomeric state that has been selected, taken from the basis set of coiled coils.
-
major_radii
¶ [float] – Radii of the minor helices relative to the super-helical axis.
-
major_pitches
¶ [float] – Pitch values of the minor helices relative to the super-helical axis.
-
phi_c_alphas
¶ Relative rotation values of the minor helices relative to the super-helical axis.
-
minor_helix_types
¶ [str] – Helix types of the minor helices. Can be: ‘alpha’, ‘pi’, ‘3-10’, ‘PPI’, ‘PP2’, ‘collagen’.
-
major_handedness
¶ str – Handedness of the super helix.
-
orientations
¶ Orientation of helices relative to the super-helical axis. 1 is parallel, -1 is anti-parallel.
-
minor_repeats
¶ [float] – Hydrophobic repeats of the minor helices.
-
rotational_offsets
¶ Rotation of the minor helices relative to the super-helical axis.
-
z_shifts
¶ [float] – Translation of the minor helices along the super-helical axis.
-
oligomeric_state
¶ int – Oligomeric state of the coiled coil.
-
classmethod
from_parameters
(n, aa=28, major_radius=None, major_pitch=None, phi_c_alpha=26.42, minor_helix_type='alpha', auto_build=True)[source]¶ Creates a CoiledCoil from defined super-helical parameters.
Parameters: - n (int) – Oligomeric state
- aa (int, optional) – Number of amino acids per minor helix.
- major_radius (float, optional) – Radius of super helix.
- major_pitch (float, optional) – Pitch of super helix.
- phi_c_alpha (float, optional) – Rotation of minor helices relative to the super-helical axis.
- minor_helix_type (float, optional) – Helix type of minor helices. Can be: ‘alpha’, ‘pi’, ‘3-10’, ‘PPI’, ‘PP2’, ‘collagen’.
- auto_build (bool, optional) – If True, the model will be built as part of instantiation.
-
classmethod
from_polymers
(polymers)[source]¶ Creates a CoiledCoil from a list of HelicalHelices.
Parameters: polymers ([HelicalHelix]) – List of HelicalHelices.
-


Waynet¶
This chapter will discuss what the waynet is, what it is used for and how to access it in REGoth.
Most of waynet-related operations can be found inside the components Waynet
and Waypoint
defined in
src/components/Waynet.hpp
andsrc/components/Waypoint.hpp
, respectively.
What is the Waynet?¶
The Waynet’s main use case is to allow AI controlled characters to navigate through the world. It tells the AI which paths can be taken to reach a certain destination. Think of it like a street-map for the AI. See Fig. 1 for an example.
This street-map is built up from Waypoints and Paths. Waypoints are normal
Scene-Objects with the Waypoint
-component attached. This component stores
references to all other Waypoints that can be reached directly from its
location. If a Waypoint is in reach of another Waypoint, that means there is a
Path between the two.
The scripts actually only tell the target destination a character should go to, so some sort of algorithm to find the shortest path to it is needed.
The Waynet-Components¶
Once a world has been loaded (See World), the worlds Waynet can be queried by
REGoth::gWorld().waynet()
. This will return a handle of a Waynet
-Component.
This Waynet
-component offers a list of all known Waypoints and functions to search for
specific ones. Since every Waypoint is a normal Scene-Object, you can also simply do a
recursive search for the name you are looking for from the scenes root object.
Note
If you are querying a Waypoint by name and you are not completely sure that the object you are looking for is indeed a Waypoint, it’s better to search the full scene.
If you have a Waypoint
-component at hand, you can query the paths reachable from that Waypoint
from it.
TODO: Pathfinding should also be implemented in the waynet, or at least accessible from it.
How Pathfinding works¶
Pathfinding describes the process of finding the shortest path between two locations. Those two locations do not need to be directly on the waynet, but a Waypoint should be in reach for the start and end locations.
A naive solution would be to simply use a shortest-path algorithm like Dijkstras-Algorithm to find the sequence of Waypoints that would get the AI to its destination.
It turns out that this is not the full story. In Gothic, AI controlled characters will often not use the shortest possible path, but go an other route. How that is determined is unknown.
For example: When using the shortest path possible, the character showing the way from the old camp to the swamp will go though the forest, while he goes around the forest in the original.
Note
Since the Waynet is supposed to be static, it might be beneficial to precompute the distances between Waypoints and store them in an acceleration structure for faster pathfinding.
TODO: Need more information.


Open modal with transaction ok with logo and with description
Open modal with transaction ok with logo and without description
Open modal with transaction ok without logo and with description
Open modal with transaction ok without logo and without description
Open modal with transaction error


Recovery in progress. Do NOT power off!!!
The device will automatically shut off when recovery completes.
Please unplug the USB dongle before rebooting the device.


neuralnet is my c++ implementation of a simple feedfoward neural network developed for educational purposes. For learning process of the network this project uses a variant of backpropagation algorithm called a mini-batch gradient descent with momentum. I've created two implementations for forward, backward propagation and updates: on GPU using CUDA and on CPU using OpenMP.
Goals for this project:
- Learn about feedforward neural networks.
- Learn about scientific parallel computing on cpu using OpenMP api.
- Learn about parallel computing on gpu using NVIDIA CUDA toolkit.
- Successfully implement and train the network on real life use case dataset (MNIST handwritten digits dataset).
- When developing parallel code focus on performance.
- Deepen c++ knowledge in a process.
Available layer types:
- Rectified Linear Unit Layer
- Softmax Outut Layer
- Sigmoid Output Layer
Example:
Code example goes here Results:


Display a legend for the molecule representation colors. There are three types of display:
| X min, X max |
various numeric fields |
The horizontal extension of the legend. The screen goes from -1 to 1. Currently X max is ignored. |
| Y min, Y max |
various numeric fields |
The vertical extension of the legend. The screen goes from -1 to 1. |
| Z value |
numeric field |
The Z position of the legend. The screen goes from -1 to 1. |
| Scale |
numeric field |
The scale of the spheres representing atoms and residues. |
| Label offset |
numeric field |
The offset of the label respect to the corresponding sphere. |
| Font |
font selector |
Standard AVS/Express text parameters selector. |


| Game # | Created by | Is Finished | Date Start | Date Finish | Winners | Players |
|---|---|---|---|---|---|---|
| {{item._id}} | {{item.UsernameOwner}} | {{item.finish}} | {{item.dateStart}} | {{item.dateFinish}} |
|
({{player.points}} points / {{player.stars}} stars) |
| Game # | Created by | Is Finished | Date Start | Date Finish | Winners | Players |
|---|---|---|---|---|---|---|
| {{item._id}} | {{item.UsernameOwner}} | {{item.finish}} | {{item.dateStart}} | {{item.dateFinish}} |
|
({{player.points}} points / {{player.stars}} stars) |


Demonstrates how to load Disqus on a page that continuously adds content to the bottom of the page, each with their own discussion.


IP energy solutions have dominated the energy market for the last 150 years. Now open source energy exchanges and energy production techniques are edging their way into the market and may dominate the future of how energy is bought, sold, and produced.
One of the most powerful examples of open source energy done right is Grid+. Grid+ is a peer-to-peer energy solution built on the blockchain. The way it works is their device, when connected to your home grid, automates paying for electricity bills and the buying and selling of electricity over the grid in deregulated energy markets in the United States. Their software is used, most notably in the Brooklyn Microgrid, by independent home owners who produce their own power with renewables. Before, there was no easy way to sell energy back to the grid and no way to force energy companies to price more competitively. Now, with Grid+, residents in neighborhoods where Grid+ is active, users can not only sell energy back to the grid, but also buy energy from their peers, bypassing all other intermediaries. This is an incredible project and its software, and blockchain it is based on, is completely open sourced. [1][2]
Another powerful example of an open source energy solution is W.E. Power. W.E. Power is a blockchain based green energy platform. Their goal is to enable green energy producers to raise capital through offering energy tokens that have an inherit value that is energy. Their token and open source security models hold promise of decentralizing energy production and dropping prices for all parties involved while increasing revenues by cutting out distributors and middle-men. [3]
Tesla is the most built out open-source company in production. They have open sourced and released all of their patents. Their goal is to get their technology into as many hands in possible. This has several possible benefits. One benefit could potentially be to increase incentives for existing companies and governments to build out energy charging infrastructure. Another benefit would be using the research done by others based on the initial release of the patents would be available for Tesla to use. It also cuts down on the typical legal fees associated with filing for and protecting patents. [4]
One drawback of open source design solutions is that they don't allow for protections against larger companies and competitors. That is to say that without patents, it can be difficult for small businesses that stumble upon innovative ideas to gain a competitive advantage. This is a particularly powerful deterrent in the energy market-space which is naturally lent towards monopolies by the nature of grid-maintenance being outsourced to private companies in most countries. Challenging these major companies requires smaller start-ups to have their ideas protected so that they cannot be unfairly exploited and undercut by competition. Monopolies often stifle innovation as they have no need innovate beyond keeping the government regulators, that legally protect their monopoly.
Intellectual property rights also encourage investment. While there are certainly investment incentives under an open source model, most innovative technologies require patent protection for investors to reduce the risk of their investment and increase the capital injection. This increased capital injection allows for faster and more stable growth, increasing the likelihood of success. It is difficult to reproduce this investment security under an open source model.
An interest concept in green energy initiatives is windmill farms. Most companies buy their energy from the grid at standard pricing. If companies adopt the open source windmill technology, then they have the potential to save millions of dollars in energy costs. This is an example of incorporating open source hardware and software into an existing business model to create long term savings and reduced overhead in the years to come. [5]
Sources
[1] https://github.com/gridplus
[2] https://gridplus.io/
[3] https://wepower.network/
[4] https://www.tesla.com/blog/all-our-patent-are-belong-you
[5] http://www.folkecenter.dk/mediafiles/folkecenter/pdf/windpower-3.pdf


We're sorry but project-agent doesn't work properly without JavaScript enabled. Please enable it to continue.


Uniposts is updated daily from over 100 UK higher education institutions.
Page: {{ page }} of {{ pages }}
Jobs last updated {{ appstate.updated_at | date:'fullDate' }}. {{ appstate.newjobs }} new jobs posted today.


[name]
An AnimationClip is a reusable set of Tracks that represent an animation.
Constructor
[name]( [page:String name], [page:Number duration], tracks )
Properties
[property:String uuid]
[property:String name]
[property:Number duration]
.tracks
Methods
[method:null resetDuration]()
Resets duration by scanning all tracks in the clip.
[method:AnimationClip trim]()
Trims all tracks to the clip's duration.
[method:AnimationClip optimize]()
Optimizes each track.
Static Methods
[method:AnimationClip parse]( [page:Object json] )
json -- JSON object
[method:Object toJSON]( [page:AnimationClip clip] )
clip -- AnimationClip
[method:AnimationClip CreateFromMorphTargetSequence]( [page:String name], [page:Array morphTargetSequence], [page:Number fps], [page:Boolean noLoop] )
name -- Name for the new clip
morphTargetSequence -- Array of morph targets
fps -- Number of frames per second
noLoop -- Whether looping occurs automatically.
[method:AnimationClip parseAnimation]( [page:Object animation], [page:Array bones] )
Parses the animation.hierarchy format and returns an AnimationClip.
Source
[link:https://github.com/mrdoob/three.js/blob/master/src/[path].js src/[path].js]


WITNESS LIST Criminal Jurisprudence Committee May 6, 2003-2:00P HB 2027 For: Madrid, Chilo (Association of Substance Abuse Service Providers) SB 191 For: Pardue, Craig (Dallas County) SB 405 For: Gerstenschlager, Merry Lynn (Self and Texas Eagle Forum - Legislative Liaison) May, George (Self and Yellow Rose Mortgage Company) Metzger, Luke (Texas Public Interest Research Group) Neeley, Karen (Independent Bankers Association of Texas) Schneider, Rob (Consumers Union) Wilson, Matt (Self) Against: Courtney, Chuck (Texas Retailers Association) Pratt, Stuart (Consumer Data Industry Association) Shields, Brad (Self) On: Cervantes, George (Self and Texas Association of Licensed Investigators) Chism, John (Self and Texas Association of Licensed Investigators) Hammond, Raika (Texas Municipal League) Mintz, David (Texas Apartment Association) Nestel, Daniel (Reed Elsevier/LexisNexis) SB 631 For: Monks, Gerald Patrick (Municipal Justice Bar Association) SB 685 For: Gaylor, Tom (Texas Municipal Police Association) McLendon, Barbra (Texas Council on Family Violence) SB 827 Against: Hooser, Greg (Private Providers Association of Texas) On: Stephenson, Scott (Office of the Attorney General- Medicaid Fraud Control Unit) Vasek, Heather (Texas Association for Home Care)


Html page built with HtmlFlow.
| Title | Description | Priority |
|---|---|---|
| ISEL MPD project | A Java library for serializing objects in HTML. | High |
| Special dinner | Have dinner with someone! | Normal |
| Manchester City - Sporting | 1/8 Final UEFA Europa League. VS. Manchester City - Sporting! | High |


About
NewGame
Create Room
Search Enemy
Enter
RoomId:
Enter
Setting
Size:
Start
Hex Board Game
:O
Heart
undo
surrender
restart


Richard
Welcome to my little corner of the Internet
Welcome to my little corner of the Internet
I am
About
Cyber-Security Dabbler
I am keen on learning about cyber-security. Currently, I'm just picking up bits and pieces here and there about computer security along with network security. Sometimes, I even participate in CTF competitions.
Mech-Keyboard Enthusiast
Recently I have gotten into the mechanical keyboard community and am more of a dilettante than an enthusiast. Currently, I'm rocking a Pok3r with Cherry MX Blue switches (Love the clicks). I have plans on making my own keyboard in the future as well as writing firmware for it!
Programmer
I am what most would call a programmer and I code things and (most of the times) they work without an issue at all. I began programming near the beginning of my high school career after I discovered Javascript and the fact that I could run snippets of it in the Chrome browser's URL box. I started messing it, discovered other languages, and soon uncovered the world of programming. However, despite all the amazing stories about coders and, it's not always fun and games. Mostly debugging. Not fun. But it is when it works and that's why I like it.
Student
I am currently a high school student at Evergreen Valley High School. I am in several clubs including Robotics, Science National Honors Society, and Speech and Debate. 4.0 GPA (unweighted) still going strong and I hope I don't lose it.
Things I Can Do
Programming Languages
-
Java
Java is one of the more recent languages I am currently picking up. I use it mainly for programming our FRC robotics team's robot.
-
HTML/CSS
One of my earlier learnt languages. Mostly used to make websites (kind of its main purpose) such as this one. Woo.
-
Bash/UN*X Shell
I can write very basic bash scripts and also use a UN*X terminal pretty well.
-
Javascript
First language I ever learned. However, after the introduction of things such as Node.js, I've got a lot more to learn. After all, one never ceases to learn.
-
Python
Still learning it. The easy syntax makes it easy to learn. Mostly use it for scripting tasks that are a hassle.
-
RobotC
Modified version of the C programming language designed to program FTC robots. I used it to program our robotics team's FTC robot.
-
C++
Just a diletante. Haven't quite gotten used to it yet.
Tech-Related Skills
-
Linux
Been playing around with Linux for a while. I've got most of the basics and fundamentals down. The usual distros I use include Ubuntu, elementaryOS, as well as Kali Linux. Really want to try Arch.
-
Git
Been using git for around a while now. I pretty much know it front and back. Github is my main go-to git server.
-
Robotics
Ever since the start of high school, I've been in the robotics club as a programmer and also electrical person. If robots are going to take over the world, I might as well know how to make one.
API's/Frameworks
-
Bootstrap
Nice framework. Periodically used.
-
Materialize
A cool front-end framework based on Material Design by Google. I have used this multiple times to make the front-end parts of websites, including this one.
-
Meteor.js
An open source platform for apps made with javascript. Not extrememly familiar with. Used to make my school's Speech and Debate website.
-
Twilio
API for voice and messaging applications. Used at several hackathons to create projects related to SMS.


The Story
I recently found out that some of our backend code suffers from memory-related ceashes, namely SIGSEGV
(a program tries to access memory it doesn't own). My initial response was to install and enable Abrt, which is a collection of utilities used in RHEL. Ubuntu has a similar tool called Apport.
I like this tool because it sends the root user an email after every coredump / kernel oops / kernel panic, with the coredump attached (configurable) and helpful information about the process's state (environment variables, open files, uid...).
However, our issue was that our crashing processes are quite big (at least 2G of working memory) and might crash a lot, so taking coredumps for these processes was putting quite a strain on our servers' I/O.
A bit about Abrt
Abrt is built from multiple processes. The ones relevant to my issue were:
abrt-hook-ccpp
, registered as the kernel'score_pattern
, meaning it's invoked whenever a process should coredump. This utility creates a "dump" directory under/var/spool/abrt
and puts the coredump and process trivia thereabrtd
, a deamon that monitors said directory, and whenever a new dump directory appears, it reads the data inside and takes action (sends emails, reports to RHEL's support API...)abrt-ccpp
, a service that runs on startup and registersabrt-hook-ccpp
as thecore_pattern
abrt-ccpp
is registered by modifying /proc/sys/kernel/core_pattern
, which usually specifies the filename to write core dumps to. However, when specifying a path that starts with |
, it's instead treated as a program to execute on coredumps. The program's STDIN
contains the coredump, and the offending process's /proc/
directory is kept alive so you can collect the interesting data.
I couldn't utilize Abrt and skip the coredump - abrt-hook-ccpp
refused to skip creating the coredump, and abrtd
refused to process directories without the coredump. I had to emulate the behaviour on my own script.
The Script
This is my crude replacement - it's supposed to be called from core_pattern
, so I also wrote a "service" to register it.
It's written in Python (and not Ruby, for instance) because Python comes installed on every server I encountered so far (because it powers Apt and Yum).
It basically harvests all interesting data from the failing process and emails it. The current list is:
- cgroup
- cmdline: The commmand used to start the process, arguments and everything
- executable: Path to the binary file being executed
- signal: The signal causing the process to coredump
- hostname
- kernel
- pwd: Current working directory for the faulting process
- start_time
- end_time
- uid
- username
- dso_list: Loaded dynamic libraries
- environ: Environment variables
- limits: Ulimits for the process
- maps: Allocated memory areas (including memory-mapped files)
- open_fds: Open file descriptors (files, sockets, pipes...)
#!/usr/bin/env python
###########
# Nitz Abrt
###########
#
# A crude emulation of the Abrt utility for monitoring and diagnosing segfaults
# Should be hooked from core_pattern - see your sysadmin
# http://blog.backslasher.net/mail-coredumps.html
import sys
import os
import pwd
import syslog
def usage():
print 'Usage: {} %s %c %p %u %g %t e'.format(__file__)
print ('%s number of signal causing dump\n'
'%c core file size soft resource limit of crashing process\n'
'%p PID of dumped process\n'
'%u (numeric) real UID of dumped process\n'
'%g (numeric) real GID of dumped process\n'
'%t time of dump, expressed as seconds since the Epoch, 1970-01-01 00:00:00 +0000 (UTC)\n'
'e ignored\n'
'\n'
'Should be called from core_pattern\n'
)
sys.exit(1)
if(len(sys.argv)!=8): usage()
signal=sys.argv[1]
pid=sys.argv[3]
uid=int(sys.argv[4])
dump_time = sys.argv[6]
proc_path='/proc/%s/' % pid
def read_file(filename):
filename = os.path.join(proc_path,filename)
return open(filename,'r').read()
def get_symlink(filename):
filename = os.path.join(proc_path,filename)
return os.path.join(os.path.dirname(filename), os.readlink(filename))
def get_start_time():
return int(os.path.getctime(proc_path))
def get_dso():
filename = os.path.join(proc_path,'maps')
files = set([x.strip()[x.find('/'):] for x in open(filename,'r').readlines() if x.find('/') > -1])
return '\n'.join(files)
def list_dir_symlink(dirname):
dirname = os.path.join(proc_path,dirname)
link_hash = dict((i,os.readlink(os.path.join(dirname,i))) for i in os.listdir(dirname))
return '\n'.join(['%s: %s' % (k,link_hash[k]) for k in sorted(link_hash.keys())])
exe_path=get_symlink('exe')
import fnmatch
blacklist = ['*/php-fpm'] # These executables are uninteresting
for pattern in blacklist:
if fnmatch.fnmatch(exe_path,pattern):
print '%s is blacklisted by pattern "%s". Ignoring' % (exe_path,pattern)
exit(1)
data = {
'cgroup': read_file('cgroup'),
'cmdline': read_file('cmdline').replace('\0','\n').strip(),
'executable': exe_path,
'signal': signal,
'hostname': os.uname()[1],
'kernel': os.uname()[2],
'pid': pid,
'pwd': get_symlink('cwd'),
'start_time': get_start_time(),
'end_time': dump_time,
'uid': uid,
'username': pwd.getpwuid(uid).pw_name,
'dso_list': get_dso(),
'environ': '\n'.join(read_file('environ').split('\0')),
'limits':read_file('limits'),
'maps': read_file('maps'),
'open_fds': list_dir_symlink('fd')
}
data_str = '\n'.join(['#%s:\n%s' % (k,data[k]) for k in sorted(data.keys())])
mail='To:root\nSubject:nabrt crash %s\n\n%s' % (exe_path.split('/')[-1], data_str)
import subprocess
pmail = subprocess.Popen(['mail','-t'],stdin=subprocess.PIPE)
pmail.stdin.write(mail)
pmail.stdin.close()
Bonus - modifying STDIN
Because abrt-hook-ccpp
takes its coredump from STDIN
, I thought I could still utilize it by calling it with a modified STDIN that contains very little.
This idea failed because abrtd
wouldn't work with a "corrupted" coredump, but I think it's a novel idea and a cute script:
#!/bin/sh
(head -c $((5*1024)) <&0 ) | # Only take the first 5 MB from STDIN and pass it along
exec /usr/libexec/abrt-hook-ccpp "$@" # Become original hook
I initially tried closing STDIN
completely, but turns out the kernel is only keeping the /proc
directory of the faulting process when that stream is open - it thinks you're done collecting diagnostics when you close that stream.


Using
BiwaScheme
0.6.2
Evaluate single line (expression is wrapped by parens then by print)
(
)
The function (print ...) will generate output below
<Output>


Welcome to the Unit 4 review! Over the next few classes, you will be working with a team of peers as a medical practitioner tasked with reviewing and diagnosing several patient cases. Below, you are asked to select an area of specialization. There is a maximum of four students per area of specialization (available on a first come first serve basis). Once you have chosen your specialization, you will be asked to stick with it for the remainder of the review - so please choose carefully!
Base on the knowledge you contributed in CK Biology, the specialization that is recommended for you is:
(though you are welcome to choose any specialization you wish)
Would you like to continue contributing your knowledge to the community?


{% extends 'panel.html' %} {% load bootstrap_tags %} {% load utilities %} {% block head_title %}Import uBiome data: Step 1{% endblock %} {% block panel_content %}
Adding uBiome data in two steps: first add sample information, then upload the sequencing file. If you have multiple samples, you'll go through this process for each sample.
To find your sample data...


Home
- Event: Chicano Link PEET mentor program
Date:May 2-6, 2016
Time: Event Ongoing - Event: CSP Committee
Date: Fall 2016
Time: contact CSP - Chicano Latino Orientation Week
Date: Oct. 3-7, 2016
Time: see flyer - Event: Mental Illness Awareness Week
Date: Sept. 27, 2016
Time: see flyer
Location: Rivera Lawn - Event: Adelante Success!
Date: Oct. - Nov., 2016
Time: 12-1:30 p.m.
Location: HUB 379
Bienvenidos a nuestra familia de UCR!
We celebrate the traditions of Chicano/Latino culture while sharing the spirit of La Raza with our campus and community. To our Chicano/Latino students, we are one big familia, and like a family, we fully support your academic, cultural and social success.
WE:
SUPPORT
We create a positive environment for Chicano/Latino students at UCR by offering supportive services and programs that encourage academic success and retention. We provide service referral when necessary, and serve as a resource for advocacy, as well.
SHARE
We educate our campus and community about Chicano/Latino culture through our exciting events, active student organizations, and rewarding outreach programs, too.
CONNECT
We collaborate with other UCR departments with shared goals; encourage faculty and staff mentorship; reach out to our local community; and maintain a helpful campus, community and alumni network that help our students grow.
INSPIRE
Our outstanding faculty, staff and students inspire future members of our familia and demonstrate true orgullo y corazón.


?The
University
of
Texas
at
Arlington
Nama
jamaicense
L.
John
D.
Bacon
igg4
PLANTS
OF
THE
BAHAMA
ISLANDS.
Collected
by
A.
E.
Wight,
1905.
'"^cr-
\x\QCrv>JL<
rwÇ_tx>\iLA^
^>vjiÈvXjvxxfcL
.
(ofc**oCrRJLo_-
^XxjYvfc
C^ULSLj^AjtJ^
>
V
XaT-
\
v
^
^
01498368
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high


Blog
Bootstrap 4 Notes and Plan Part 1
This blog post is the first in the series , it covers my notes and thoughts on Part 1 of the Bootstrap 4 course on Codecademy .
ReadBootstrap 4 Notes part 2
Hi and welcome to part 2 of my learning Notes from bootstrap 4 on codecademy the first part of the note had talked about the fundamentals of bootstrap 4 grid
Read


Provides graph-constrained regression methods in which regularization parameters are selected automatically via estimation of equivalent Linear Mixed Model formulation. 'riPEER' (ridgified Partially Empirical Eigenvectors for Regression) method employs a penalty term being a linear combination of graph-originated and ridge-originated penalty terms, whose two regularization parameters are ML estimators from corresponding Linear Mixed Model solution; a graph-originated penalty term allows imposing similarity between coefficients based on graph information given whereas additional ridge-originated penalty term facilitates parameters estimation: it reduces computational issues arising from singularity in a graph-originated penalty matrix and yields plausible results in situations when graph information is not informative. 'riPEERc' (ridgified Partially Empirical Eigenvectors for Regression with constant) method utilizes addition of a diagonal matrix multiplied by a predefined (small) scalar to handle the non-invertibility of a graph Laplacian matrix. 'vrPEER' (variable reducted PEER) method performs variable-reduction procedure to handle the non-invertibility of a graph Laplacian matrix.
| Version: | 1.0.1 |
| Depends: | R (≥ 3.3.3) |
| Imports: | reshape2, ggplot2, nlme, boot, nloptr, rootSolve, psych, magic, glmnet |
| Suggests: | knitr, rmarkdown |
| Published: | 2017-05-30 |
| Author: | Marta Karas [aut, cre], Damian Brzyski [ctb], Jaroslaw Harezlak [ctb] |
| Maintainer: | Marta Karas <marta.karass at gmail.com> |
| License: | GPL-2 |
| NeedsCompilation: | no |
| Materials: | README |
| CRAN checks: | mdpeer results |
| Reference manual: | mdpeer.pdf |
| Vignettes: |
Intro and usage examples |
| Package source: | mdpeer_1.0.1.tar.gz |
| Windows binaries: | r-devel: mdpeer_1.0.1.zip, r-release: mdpeer_1.0.1.zip, r-oldrel: mdpeer_1.0.1.zip |
| OS X binaries: | r-release: mdpeer_1.0.1.tgz, r-oldrel: mdpeer_1.0.1.tgz |
| Old sources: | mdpeer archive |
Please use the canonical form https://CRAN.R-project.org/package=mdpeer to link to this page.


Glossary of terms for the Alabai (JE) project
A
Active literal in a rule premise.
If we consider some clause as a (potential) premise in some deduction
rule, it is convinient to distinguish the literal of the clause, which
is actually intended for generating inferences. We call the literal
the active literal of the premise. All other literals in
the premise are called passive. For example, in a resolution
premise C \/ L
, where we intend to resolve L
,
the literal L
is active,
and all the literals in C
are passive. Note that passive literals
can potentially participate in the intended inference as auxilliary
literals. For example, if L
is resolved in C \/ L
,
we can also factor some of the literals in C
with
L
.
Answer clause is a clause
with no ordinary literals, but containing an answer literal and,
possibly, some other recording literals and constraints.
B
Backward paramodulation.
We consider two modes in which paramodulation is applied.
In the backward mode, the candidate redexes
are in a database (index)
and the positive equality to
paramodulate from
acts as a query.
In forward paramodulation,
the positive equalities to paramodulate from are in a databse,
and the candidate redex term acts as a query.
The distinction is purely technical,
the semantics of paramodulation is not affected.
Bidirectional unifier.
We say that a unifier &theta of two terms s
and t
is bidirectional (wrt both s
and t
),
if neither s&theta = t
, nor s = t&theta
.
See also unifier orientation,
instantiating unifier and
generalising unifier.
C
Candidate redex is a term that
is identified as a potential redex in paramodulation
or demodulation inferences.
Cluster of selection units.
For the purpose of efficient indexing, most of the fine selection units
in the Alabai kernel are split into a finite number of clusters
corresponding to pairs of kind tags and activeness degrees
of the units. Cluster identifiers are represented
with boolean vectors of fixed length.
Complex literals are those literals
whose atoms are not atomic formulas, ie, they are applications
of quantifiers or conjunctions. In Alabai, all complex literals
are considered positive even if the corresponding atoms are applications
of negation. See also ordinary literal.
Conditional contradiction clause is a clause
with no ordinary literals or answer literals, but
some recording literals or constraints.
Contradiction clause
is an ordinary empty clause. Unlike, an
answer or
codnitional contradiction,
it does not have any associated constraints or recording literals.
F
Forward paramodulation.
We consider two modes in which paramodulation is applied.
In the forward mode, the positive equality to
paramodulate from
is taken from the database (index) and
the candidate redex term
acts as a query.
In backward paramodulation,
the positive equality acts a query, and the candidate redexes are
in a database (index). The distinction is purely technical,
the semantics of paramodulation is not affected.
G
Gamma-substitution is
any substitution &theta, such that for every variable x,
x&theta is a constant or a variable, and if x and y are distinct
variables and x&theta and y&theta are variables, then
x&theta and y&theta are distinct.
Generalising unifier.
We say that a unifier &theta between terms s
and t
is generalising wrt s
, if s = t&theta
.
See also unifier orientation,
bidirectional unifier and
instantiating unifier.
I
Instantiating unifier.
We say that a unifier &theta between terms s
and t
is instantiating wrt s
, if s&theta = t
.
See also unifier orientation,
bidirectional unifier and
.
K
Kept clauses are those clauses that
have passed forward processing without being discarded. Of course,
later they may be discarded, for example, by backward simplification.
M
Main premise and side premise.
The most important two-premise
deduction rules are applied in the following mode: one premise is
fixed and the other one is varied, eg, by extracting appropriate
candidates from an index. The former premise is called the
main premise, and the latter one is called the side premise.
O
Ordinary literals are those literals
whose atoms are really atomic formulas.
See also complex literal.
P
Paramodulation from ... into ...
Given an application of paramodulation between the clauses
C \/ s = t and D[s]
, resulting in C \/ D[t]
,
we say that we paramodulate from the positive equality s = t
into the clause D[s]
.
Passive literals in a premise: see
active literal.
R
Redex.
Given an application of paramodulation between the clauses
C \/ s = t
and D[s]
, resulting in
C \/ D[t]
, we say that the term
s
acts as a redex in this inference.
Similarly, in the demodulation
between s = t
and D[s]
, s
is the redex.
Residual literals in a rule premise
are those passive literals that have not
participated in an inference even as additional literals.
Note that this concept only makes sense wrt some inference that have
been made. Usually we assume that the residual literals incorporate
the corresponding unifier.
S
Side premise: see
main premise.
T
Terminal clause is a
contradiction,
conditional_contradiction
or
answer clause.
U
Unifier orientation.
A unifier between two terms s
and t
can be
instantiating wrt s
,
generalising wrt s
, or
bidirectional.


key=value
, map of environment variables and their desired values. The environment
variables passed here will be mirrored on to the adb run
command. For example, specify
coverage=true,coverageFile="/sdcard/tempDir/coverage.ec"
to enable code coverage and provide a file
path to store the coverage results.


Nav-Panel
Hop in
Login
Run Tests
Nodes
Close menu
Social
Shout Out
What's New
Vote
Sign in
Logout
Back
Comment
Share
Social
Shout Out


public class TreeBinarizer extends java.lang.Object implements TreeTransformer
| Constructor and Description |
|---|
TreeBinarizer(HeadFinder hf,
TreebankLanguagePack tlp,
boolean insideFactor,
boolean markovFactor,
int markovOrder,
boolean useWrappingLabels,
boolean unaryAtTop,
double selectiveSplitThreshold,
boolean markFinalStates,
boolean simpleLabels,
boolean noRebinarization)
Build a custom binarizer for Trees.
|
| Modifier and Type | Method and Description |
|---|---|
protected static boolean |
isSynthetic(java.lang.String label) |
static void |
main(java.lang.String[] args)
Lets you test out the TreeBinarizer on the command line.
|
void |
setDoSelectiveSplit(boolean doSelectiveSplit)
If this is set to true, then the binarizer will choose selectively whether or not to
split states based on how many counts the states had in a previous run.
|
static TreeBinarizer |
simpleTreeBinarizer(HeadFinder hf,
TreebankLanguagePack tlp)
Builds a TreeBinarizer with all of the options set to simple values
|
Tree |
transformTree(Tree t)
Binarizes the tree according to options set up in the constructor.
|
public TreeBinarizer(HeadFinder hf, TreebankLanguagePack tlp, boolean insideFactor, boolean markovFactor, int markovOrder, boolean useWrappingLabels, boolean unaryAtTop, double selectiveSplitThreshold, boolean markFinalStates, boolean simpleLabels, boolean noRebinarization)
hf
- the HeadFinder to use in binarizationtlp
- the TreebankLanguagePack to useinsideFactor
- whether to do inside markovizationmarkovFactor
- whether to markovize the binary rulesmarkovOrder
- the markov order to use; only relevant with markovFactor=trueuseWrappingLabels
- whether to use state names (labels) that allow wrapping from right to leftunaryAtTop
- Whether to actually materialize the unary that rewrites
a passive state to the active rule at the top of an original local
tree. This is used only when compaction is happeningselectiveSplitThreshold
- if selective split is used, this will be the threshold used to decide which state splits to keepmarkFinalStates
- whether or not to make the state names (labels) of the final active states distinctivenoRebinarization
- if true, a node which already has exactly two children is not alteredpublic void setDoSelectiveSplit(boolean doSelectiveSplit)
doSelectiveSplit
- Record this value and reset internal counter if falseprotected static boolean isSynthetic(java.lang.String label)
public Tree transformTree(Tree t)
transformTree
in interface TreeTransformer
t
- A tree to be binarized. The non-leaf nodes must already have
CategoryWordTag labels, with heads percolated.public static TreeBinarizer simpleTreeBinarizer(HeadFinder hf, TreebankLanguagePack tlp)
public static void main(java.lang.String[] args)
args
- Command line arguments: flags as above, as above followed by
treebankPath


photos By Kirstie Shanley
Perfect Pussy - 7th Street Entry - April
Perfect Pussy – Photo by Pooneh Ghana
The Julie Ruin - Triple Rock Social Club - July
Photo by Samantha Marble
Sylvan Esso - First Avenue Mainroom - September
The Pretty Reckless - First Avenue Mainroom - October
I just want to mention it, because it happened...and I was thereFAK TWIGS - Fine Line - November
Blood Orange
Image from Doomtree's instagram
I'm not qualified to write this article because I don't know anything about Doomtree, they are not my thing, but I'm not a hater either. I was there, so that probably counts for something. I'll admit it, the on-stage chemistry was magnetic. I liked the part where Lizzo and Har Mar did a cute synchronized dance. I also admired Dessa's new haircut. A friend noted that she forgot how much bros like to hear themselves talk (I don't need reminding of this). After each and every song, the dudes around her would pipe up with "Wow they are really Killin it!" or "That one was the best" or some other affirmation. I don't think this is a crime, nothing wrong with cheering for a band, but I get her annoyance at the constant need to give out stamps of approval when no one asked for one.
Did you know that Surly made a special beer for Doomtree? It's called Doomtree and the people love it.
I stole this photo from the internet.
No. No just play one, goddamnit, I'm looking at you Mason Jennings.
If it was up to me there would be no encores at all. Bands would just play their set and take a bow, THE END. But it's not up to me. So most acts do a predictable and very scheduled encore. The people cheer and go home. When bands take it to the next level and play TWO predictable and very planned encores, I just don't get it.
On the other hand, one time I saw Good Charlotte play, this was like three years ago, not 10 BTW, and they didn't play an encore. Their fans screamed for whole minutes as they waited for them to take their places on stage. Tears were shed.  The people wanted more. And Good Charlotte was just like, "Thanks for your money, peace!" They didn't actually say that, but it sure felt like that.
So cool
Waveless is a cool new band. My friend Hannah is in it, and she is so cool and nice and her bands are always rad. Her last band was Crimes and I really dug them. Ok
Weird huh?
The club we know as First Avenue was born in 1970, but the history of live music in that distinctively curved black building on the corner of First Avenue and Seventh Street rightfully begins much earlier. It was on a February Friday in 1937 that the orchestral music of the Gopher Melody Men played, ribbons were cut, and the new Northland-Greyhound Bus Depot opened for business.
When it was built, the Greyhound Bus Depot was widely acclaimed for its streamlined art deco style and modern luxuries. Called one of the most "modernistic" and beautiful travel centers in America, this bus depot boasted such luxuries as public phones, shower rooms and air conditioning. The décor included huge chromium trimmed chandeliers and a checkered terrazzo floor. Outside, there were blue-glazed bricks with white trimming.


Let's play! Enter a number and watch what happens. Every number leading up to it will be displayed! But not so fast... If any number smaller than that is divisible by 3, PING! And also if any number smaller than that is divisible by 5, PONG! And furthermore, if any number smaller than that is divisible by 3 AND 5, PING PONG!!!


SHADOWS AND FOG A film review by Ken Johnson Copyright 1992 Ken Johnson
89 min., PG-13, Comedy, 1992, Black & White Director: Woody Allen Cast: Woody Allen, Mia Farrow, John Malkovich, Lily Tomlin, Madonna, Jodie Foster, Kathy Bates, John Cusack, Kate Nelligan, Wallace Shawn, Fred Gwynne, Donald Pleasence, Julie Kavner, Kenneth Mars, David Ogden Stiers, Josef Sommer, Philip Bosco, Robert Joy, Kurtwood Smith
In the city of London, a strangler is going around killing people. Allen, for no known reason, is convinced by a vigilante group to go out to the streets on a very foggy night to try to help catch the strangler. Once on the streets Allen doesn't know what to do, so he wanders around aimlessly running into all sorts of people.
SHADOWS AND FOG is a typical Woody Allen film. It is fun to watch, in a Woody sort of way, and is a must see for Woody fans, but seems to have no real significance. I don't recommend this film for those people who don't care for Woody's films. SHADOWS AND FOG is not close to being as good as the film EVERYTHING YOU EVER WANTED TO KNOW ABOUT SEX, BUT WERE AFRAID TO ASK, which I consider to be Woody's best film yet. The film is worth watching , but I can't give it over a three (on a scale of zero to five). SHADOWS AND FOG is rated PG-13 for adult situations and adult humor.
The film is filmed in black and white, which gives it an eerie feeling. When Woody, or anybody else, is walking around London, it is rather spooky. It adds a real atmosphere to the film (and also probably cut down on the cost quite a bit). Just about the entire cast of the film are established actors/actresses, although many of them only have cameo appearances. The only two people who have real roles in the film are Woody Allen and Mia Farrow. Others, like John Malkovich, Lily Tomlin, and John Cusack, have supporting roles, but aren't on the screen for very long. Others, like Madonna, are on the screen for about two or three minutes, and then never to be seen again. They all, however, give wonderful performances.
Some of the camera angles were very inventive and others I really didn't care for. I think the one I disliked the most was in the brothel where the camera was sitting in one spot panning around the table. It made me feel a little dizzy, and most of the picture was blurry because the camera was focused on a few people sitting around the table, and mostly what the camera saw was the walls of the room (because there were so few people).
The locations and scenery were very good. The rooms had a Peter Greenawayesque feeling to them from the way that the props were placed, and in most instances what the props were. The locations really looked like they were in London, (I didn't think to look at the credits at the end to see where it was actually filmed). The way the alleys looked, I found to be rather beautiful. This seems a bit weird to me after seeing the film, with the presence that the alleys were supposed to portray, but in the black and white and with the stone work on the buildings the alleys looked very pleasing.
I was quite shocked to see how old Woody looked. The last film I had seen Woody in was A MIDSUMMER'S NIGHT SEX COMEDY, which was done in 1982. Woody has never looked young in anything that I have seen him in. Even in EVERYTHING YOU EVER WANTED TO KNOW ABOUT SEX..., which was done in 1972, Woody looked old. But now he looks *very* old, and I almost didn't recognize him (his voice definitely gave it away).
Ken J<EMAIL_ADDRESS>.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


--- date: 2010-01-30T00:00:00Z published: true title: I have always wondered why iChat is missing from the iPhone. url: /2010/01/30/i-have-always-wondered-why-ichat-is-missing-from-the-iphone-/ --- And I think that the omission of it from the iPad as well is curious. If they want to appeal to "regular users" as an internet device - it just seems really odd. Most of the "regular users" I know do a few things online:
Surf (Facebook, MySpace)


http://en.kioskea.net/faq/1559-compiling-an-assembly-program-with-nasm
http://cs.lmu.edu/~ray/notes/nasmtutorial/
The Netwide Assembler (NASM) is an assembler and disassembler for the Intel x86 architecture. It can be used to write 16-bit, 32-bit (IA-32) and 64-bit (x86-64) programs. NASM is considered to be one of the most popular assemblers for Linux.
NASM can output several binary formats including COFF, OMF, a.out, Executable and Linkable Format (ELF), Mach-O and binary file (.bin, binary disk image, used to compile operating systems), though position-independent code is supported only for ELF object files. NASM also has its own binary format called RDOFF.
Also, NASM can create flat binary files, usable to write boot loaders, read-only memory (ROM) images, and in various facets of OS development. NASM can run on non-x86 platforms as a cross assembler, such as PowerPC and SPARC, though it cannot generate programs usable by those machines.
NASM uses a variant of Intel assembly syntax instead of AT&T syntax. It also avoids features such as automatic generation of segment overrides (and the related ASSUME directive) used by MASM and compatible assemblers.
To translate the object files into executable programs, an appropriate linker must be used, such as the Visual Studio "LINK" utility for Windows or ld for Unix-like systems.
nasm -f bin <shellcode.asm>
nasm -f bin -o payload.bin payload.asm
nasm -f elf payload.asm; ld -o payload payload.o; objdump -d payload
To assemble a file, you issue a command of the form
nasm -f <format> <filename> [-o <output>]


Ping-Pong Counter
Welcome to the Ping-Pong Counter! When given a number this program will count up to the inputted number with some special insertions. These special insertions are:
- "Ping" for numbers divisible by 3.
- "Pong" for numbers divisible by 5.
- "Ping-Pong" for numbers divisible by 15.
Please input a positive integer below.


{% extends "minimal-layout.html" %} {% block page_title %} NHS Service finder {% endblock %} {% block content %} Service Finder Service Finder You can search the Directory of Services in these different ways: Service search Find different types of services to refer a patient, based on location. Look up a service Find the details for a specific service, where you know the name of it or part of the address. {% endblock %}
You can search the Directory of Services in these different ways:
Find different types of services to refer a patient, based on location.
Find the details for a specific service, where you know the name of it or part of the address.


Hello, hello, hello! We'd love to hear from you. Please reach out with any questions that you might have. Thank you and have a wonderful day!


This window is hacked in HTML, CSS and JavaScript using the BAT framework.

Built with HTML, CSS & JavaScript by Ionică Bizău


This inspection reports local variables with unnecessary boxing
In some cases boxing can be source of significant performance penalty, especially in loops.
New in 2018.2


# (c) 2012-2014, Michael DeHaan<EMAIL_ADDRESS>#
# This file is part of Ansible
#
# Ansible is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# Ansible is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with Ansible. If not, see <http://www.gnu.org/licenses/>.
# Make coding more python3-ish
from __future__ import (absolute_import, division, print_function)
__metaclass__ = type
import ast
from json import dumps
from collections import MutableMapping
from ansible.compat.six import iteritems, string_types
from ansible import constants as C
from ansible.errors import AnsibleError
from ansible.parsing.splitter import parse_kv
from ansible.utils.unicode import to_unicode, to_str
def _validate_mutable_mappings(a, b):
"""
Internal convenience function to ensure arguments are MutableMappings
This checks that all arguments are MutableMappings or raises an error
:raises AnsibleError: if one of the arguments is not a MutableMapping
"""
# If this becomes generally needed, change the signature to operate on
# a variable number of arguments instead.
if not (isinstance(a, MutableMapping) and isinstance(b, MutableMapping)):
myvars = []
for x in [a, b]:
try:
myvars.append(dumps(x))
except:
myvars.append(to_str(x))
raise AnsibleError("failed to combine variables, expected dicts but got a '{0}' and a '{1}': \n{2}\n{3}".format(
a.__class__.__name__, b.__class__.__name__, myvars[0], myvars[1])
)
[docs]def combine_vars(a, b):
"""
Return a copy of dictionaries of variables based on configured hash behavior
"""
if C.DEFAULT_HASH_BEHAVIOUR == "merge":
return merge_hash(a, b)
else:
# HASH_BEHAVIOUR == 'replace'
_validate_mutable_mappings(a, b)
result = a.copy()
result.update(b)
return result
[docs]def merge_hash(a, b):
"""
Recursively merges hash b into a so that keys from b take precedence over keys from a
"""
_validate_mutable_mappings(a, b)
# if a is empty or equal to b, return b
if a == {} or a == b:
return b.copy()
# if b is empty the below unfolds quickly
result = a.copy()
# next, iterate over b keys and values
for k, v in iteritems(b):
# if there's already such key in a
# and that key contains a MutableMapping
if k in result and isinstance(result[k], MutableMapping) and isinstance(v, MutableMapping):
# merge those dicts recursively
result[k] = merge_hash(result[k], v)
else:
# otherwise, just copy the value from b to a
result[k] = v
return result
[docs]def load_options_vars(options):
options_vars = {}
# For now only return check mode, but we can easily return more
# options if we need variables for them
options_vars['ansible_check_mode'] = options.check
return options_vars
[docs]def isidentifier(ident):
"""
Determines, if string is valid Python identifier using the ast module.
Orignally posted at: http://stackoverflow.com/a/29586366
"""
if not isinstance(ident, string_types):
return False
try:
root = ast.parse(ident)
except SyntaxError:
return False
if not isinstance(root, ast.Module):
return False
if len(root.body) != 1:
return False
if not isinstance(root.body[0], ast.Expr):
return False
if not isinstance(root.body[0].value, ast.Name):
return False
if root.body[0].value.id != ident:
return False
return True


Sign up now and meet awesome people who travel around the world
By signing up you agree to the terms
People registered
Posts published
People Already Signed Up


After selecting a file or folder, select the menu icon to view commands
Double clicking on a file will open it in the editor
items not accessable using csap user permissions will be updated using linux setfacl .
restore_filesystem_acls can be run
using the csap script runner to remove if desired


The amount cannot be less than £0
The amount cannot be greater than {{ vm.maximumCreditSpend | currency }}
An amount is required
The amount cannot be less than £0
The amount cannot be greater than {{ vendors.maximumVendorCreditSpend | currency }}
An amount is required


Reports
switch
statements over enumerated types which are not exhaustive.
Use the checkbox below to ignore
switch
statements which have a
default
branch.


About
I am a freshman in the class of 2023 at RIT. I am a Game Design and Development major with a passion for both playing and creating games. I love rock climbing and swimming. I love my dog and two cats, as well as all of the other furry friends I have in my home that I foster.
Name: John Heiden
Hometown: Miami, FL
Email<EMAIL_ADDRESS>Phone Number:<PHONE_NUMBER>


Return the type of the value stored at key in form of astring. The type can be one of "none", "string", "list", "set"."none" is returned if the key does not exist.
"none" if the key does not exist "string" if the key contains a String value "list" if the key contains a List value "set" if the key contains a Set value


E
- the type of elements maintained by this setpublic class ConcurrentSkipListSet<E> extends AbstractSet<E> implements NavigableSet<E>, Cloneable, Serializable
NavigableSet
implementation based on
a ConcurrentSkipListMap
. The elements of the set are kept
sorted according to their natural ordering,
or by a Comparator
provided at set creation time, depending
on which constructor is used.
This implementation provides expected average log(n) time
cost for the contains
, add
, and remove
operations and their variants. Insertion, removal, and access
operations safely execute concurrently by multiple threads.
Iterators and spliterators are weakly consistent.
Ascending ordered views and their iterators are faster than descending ones.
Beware that, unlike in most collections, the size
method is not a constant-time operation. Because of the
asynchronous nature of these sets, determining the current number
of elements requires a traversal of the elements, and so may report
inaccurate results if this collection is modified during traversal.
Additionally, the bulk operations addAll
,
removeAll
, retainAll
, containsAll
,
equals
, and toArray
are not guaranteed
to be performed atomically. For example, an iterator operating
concurrently with an addAll
operation might view only some
of the added elements.
This class and its iterators implement all of the
optional methods of the Set
and Iterator
interfaces. Like most other concurrent collection implementations,
this class does not permit the use of null
elements,
because null
arguments and return values cannot be reliably
distinguished from the absence of elements.
This class is a member of the Java Collections Framework.
| Constructor and Description |
|---|
ConcurrentSkipListSet()
Constructs a new, empty set that orders its elements according to
their natural ordering.
|
ConcurrentSkipListSet(Collection<? extends E> c)
Constructs a new set containing the elements in the specified
collection, that orders its elements according to their
natural ordering.
|
ConcurrentSkipListSet(Comparator<? super E> comparator)
Constructs a new, empty set that orders its elements according to
the specified comparator.
|
ConcurrentSkipListSet(SortedSet<E> s)
Constructs a new set containing the same elements and using the
same ordering as the specified sorted set.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(E e)
Adds the specified element to this set if it is not already present.
|
E |
ceiling(E e)
Returns the least element in this set greater than or equal to
the given element, or
null if there is no such element. |
void |
clear()
Removes all of the elements from this set.
|
ConcurrentSkipListSet<E> |
clone()
Returns a shallow copy of this
ConcurrentSkipListSet
instance. |
Comparator<? super E> |
comparator()
Returns the comparator used to order the elements in this set,
or null if this set uses the natural ordering of its elements.
|
boolean |
contains(Object o)
Returns
true if this set contains the specified element. |
Iterator<E> |
descendingIterator()
Returns an iterator over the elements in this set in descending order.
|
NavigableSet<E> |
descendingSet()
Returns a reverse order view of the elements contained in this set.
|
boolean |
equals(Object o)
Compares the specified object with this set for equality.
|
E |
first()
Returns the first (lowest) element currently in this set.
|
E |
floor(E e)
Returns the greatest element in this set less than or equal to
the given element, or
null if there is no such element. |
NavigableSet<E> |
headSet(E toElement)
Returns a view of the portion of this set whose elements are
strictly less than toElement.
|
NavigableSet<E> |
headSet(E toElement,
boolean inclusive)
Returns a view of the portion of this set whose elements are less than
(or equal to, if
inclusive is true) toElement . |
E |
higher(E e)
Returns the least element in this set strictly greater than the
given element, or
null if there is no such element. |
boolean |
isEmpty()
Returns
true if this set contains no elements. |
Iterator<E> |
iterator()
Returns an iterator over the elements in this set in ascending order.
|
E |
last()
Returns the last (highest) element currently in this set.
|
E |
lower(E e)
Returns the greatest element in this set strictly less than the
given element, or
null if there is no such element. |
E |
pollFirst()
Retrieves and removes the first (lowest) element,
or returns
null if this set is empty. |
E |
pollLast()
Retrieves and removes the last (highest) element,
or returns
null if this set is empty. |
boolean |
remove(Object o)
Removes the specified element from this set if it is present.
|
boolean |
removeAll(Collection<?> c)
Removes from this set all of its elements that are contained in
the specified collection.
|
int |
size()
Returns the number of elements in this set.
|
Spliterator<E> |
spliterator()
Returns a
Spliterator over the elements in this set. |
NavigableSet<E> |
subSet(E fromElement,
boolean fromInclusive,
E toElement,
boolean toInclusive)
Returns a view of the portion of this set whose elements range from
fromElement to toElement . |
NavigableSet<E> |
subSet(E fromElement,
E toElement)
Returns a view of the portion of this set whose elements range
from fromElement, inclusive, to toElement,
exclusive.
|
NavigableSet<E> |
tailSet(E fromElement)
Returns a view of the portion of this set whose elements are
greater than or equal to fromElement.
|
NavigableSet<E> |
tailSet(E fromElement,
boolean inclusive)
Returns a view of the portion of this set whose elements are greater
than (or equal to, if
inclusive is true) fromElement . |
hashCode
addAll, containsAll, retainAll, toArray, toArray, toString
finalize, getClass, notify, notifyAll, wait, wait, wait
addAll, containsAll, hashCode, retainAll, toArray, toArray
parallelStream, removeIf, stream
public ConcurrentSkipListSet()
public ConcurrentSkipListSet(Comparator<? super E> comparator)
comparator
- the comparator that will be used to order this set.
If null
, the natural
ordering of the elements will be used.public ConcurrentSkipListSet(Collection<? extends E> c)
c
- The elements that will comprise the new setClassCastException
- if the elements in c
are
not Comparable
, or are not mutually comparableNullPointerException
- if the specified collection or any
of its elements are nullpublic ConcurrentSkipListSet(SortedSet<E> s)
s
- sorted set whose elements will comprise the new setNullPointerException
- if the specified sorted set or any
of its elements are nullpublic ConcurrentSkipListSet<E> clone()
ConcurrentSkipListSet
instance. (The elements themselves are not cloned.)public int size()
Integer.MAX_VALUE
elements, it
returns Integer.MAX_VALUE
.
Beware that, unlike in most collections, this method is NOT a constant-time operation. Because of the asynchronous nature of these sets, determining the current number of elements requires traversing them all to count them. Additionally, it is possible for the size to change during execution of this method, in which case the returned result will be inaccurate. Thus, this method is typically not very useful in concurrent applications.
size
in interface Collection<E>
size
in interface Set<E>
size
in class AbstractCollection<E>
public boolean isEmpty()
true
if this set contains no elements.isEmpty
in interface Collection<E>
isEmpty
in interface Set<E>
isEmpty
in class AbstractCollection<E>
true
if this set contains no elementspublic boolean contains(Object o)
true
if this set contains the specified element.
More formally, returns true
if and only if this set
contains an element e
such that o.equals(e)
.contains
in interface Collection<E>
contains
in interface Set<E>
contains
in class AbstractCollection<E>
o
- object to be checked for containment in this settrue
if this set contains the specified elementClassCastException
- if the specified element cannot be
compared with the elements currently in this setNullPointerException
- if the specified element is nullpublic boolean add(E e)
e
to this set if
the set contains no element e2
such that e.equals(e2)
.
If this set already contains the element, the call leaves the set
unchanged and returns false
.add
in interface Collection<E>
add
in interface Set<E>
add
in class AbstractCollection<E>
e
- element to be added to this settrue
if this set did not already contain the
specified elementClassCastException
- if e
cannot be compared
with the elements currently in this setNullPointerException
- if the specified element is nullpublic boolean remove(Object o)
e
such that
o.equals(e)
, if this set contains such an element.
Returns true
if this set contained the element (or
equivalently, if this set changed as a result of the call).
(This set will not contain the element once the call returns.)remove
in interface Collection<E>
remove
in interface Set<E>
remove
in class AbstractCollection<E>
o
- object to be removed from this set, if presenttrue
if this set contained the specified elementClassCastException
- if o
cannot be compared
with the elements currently in this setNullPointerException
- if the specified element is nullpublic void clear()
clear
in interface Collection<E>
clear
in interface Set<E>
clear
in class AbstractCollection<E>
public Iterator<E> iterator()
iterator
in interface Iterable<E>
iterator
in interface Collection<E>
iterator
in interface NavigableSet<E>
iterator
in interface Set<E>
iterator
in class AbstractCollection<E>
public Iterator<E> descendingIterator()
descendingIterator
in interface NavigableSet<E>
public boolean equals(Object o)
true
if the specified object is also a set, the two sets
have the same size, and every member of the specified set is
contained in this set (or equivalently, every member of this set is
contained in the specified set). This definition ensures that the
equals method works properly across different implementations of the
set interface.equals
in interface Collection<E>
equals
in interface Set<E>
equals
in class AbstractSet<E>
o
- the object to be compared for equality with this settrue
if the specified object is equal to this setObject.hashCode()
,
HashMap
public boolean removeAll(Collection<?> c)
removeAll
in interface Collection<E>
removeAll
in interface Set<E>
removeAll
in class AbstractSet<E>
c
- collection containing elements to be removed from this settrue
if this set changed as a result of the callClassCastException
- if the types of one or more elements in this
set are incompatible with the specified collectionNullPointerException
- if the specified collection or any
of its elements are nullAbstractCollection.remove(Object)
,
AbstractCollection.contains(Object)
public E lower(E e)
NavigableSet
null
if there is no such element.lower
in interface NavigableSet<E>
e
- the value to matche
,
or null
if there is no such elementClassCastException
- if the specified element cannot be
compared with the elements currently in the setNullPointerException
- if the specified element is nullpublic E floor(E e)
NavigableSet
null
if there is no such element.floor
in interface NavigableSet<E>
e
- the value to matche
,
or null
if there is no such elementClassCastException
- if the specified element cannot be
compared with the elements currently in the setNullPointerException
- if the specified element is nullpublic E ceiling(E e)
NavigableSet
null
if there is no such element.ceiling
in interface NavigableSet<E>
e
- the value to matche
,
or null
if there is no such elementClassCastException
- if the specified element cannot be
compared with the elements currently in the setNullPointerException
- if the specified element is nullpublic E higher(E e)
NavigableSet
null
if there is no such element.higher
in interface NavigableSet<E>
e
- the value to matche
,
or null
if there is no such elementClassCastException
- if the specified element cannot be
compared with the elements currently in the setNullPointerException
- if the specified element is nullpublic E pollFirst()
NavigableSet
null
if this set is empty.pollFirst
in interface NavigableSet<E>
null
if this set is emptypublic E pollLast()
NavigableSet
null
if this set is empty.pollLast
in interface NavigableSet<E>
null
if this set is emptypublic Comparator<? super E> comparator()
SortedSet
comparator
in interface SortedSet<E>
public E first()
SortedSet
first
in interface SortedSet<E>
NoSuchElementException
- if this set is emptypublic E last()
SortedSet
last
in interface SortedSet<E>
NoSuchElementException
- if this set is emptypublic NavigableSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive)
NavigableSet
fromElement
to toElement
. If fromElement
and
toElement
are equal, the returned set is empty unless fromInclusive
and toInclusive
are both true. The returned set
is backed by this set, so changes in the returned set are reflected in
this set, and vice-versa. The returned set supports all optional set
operations that this set supports.
The returned set will throw an IllegalArgumentException
on an attempt to insert an element outside its range.
subSet
in interface NavigableSet<E>
fromElement
- low endpoint of the returned setfromInclusive
- true
if the low endpoint
is to be included in the returned viewtoElement
- high endpoint of the returned settoInclusive
- true
if the high endpoint
is to be included in the returned viewfromElement
, inclusive, to toElement
, exclusiveClassCastException
- if fromElement
and
toElement
cannot be compared to one another using this
set's comparator (or, if the set has no comparator, using
natural ordering). Implementations may, but are not required
to, throw this exception if fromElement
or
toElement
cannot be compared to elements currently in
the set.NullPointerException
- if fromElement
or
toElement
is nullIllegalArgumentException
- if fromElement
is
greater than toElement
; or if this set itself
has a restricted range, and fromElement
or
toElement
lies outside the bounds of the range.public NavigableSet<E> headSet(E toElement, boolean inclusive)
NavigableSet
inclusive
is true) toElement
. The
returned set is backed by this set, so changes in the returned set are
reflected in this set, and vice-versa. The returned set supports all
optional set operations that this set supports.
The returned set will throw an IllegalArgumentException
on an attempt to insert an element outside its range.
headSet
in interface NavigableSet<E>
toElement
- high endpoint of the returned setinclusive
- true
if the high endpoint
is to be included in the returned viewinclusive
is true) toElement
ClassCastException
- if toElement
is not compatible
with this set's comparator (or, if the set has no comparator,
if toElement
does not implement Comparable
).
Implementations may, but are not required to, throw this
exception if toElement
cannot be compared to elements
currently in the set.NullPointerException
- if toElement
is nullIllegalArgumentException
- if this set itself has a
restricted range, and toElement
lies outside the
bounds of the rangepublic NavigableSet<E> tailSet(E fromElement, boolean inclusive)
NavigableSet
inclusive
is true) fromElement
.
The returned set is backed by this set, so changes in the returned set
are reflected in this set, and vice-versa. The returned set supports
all optional set operations that this set supports.
The returned set will throw an IllegalArgumentException
on an attempt to insert an element outside its range.
tailSet
in interface NavigableSet<E>
fromElement
- low endpoint of the returned setinclusive
- true
if the low endpoint
is to be included in the returned viewfromElement
ClassCastException
- if fromElement
is not compatible
with this set's comparator (or, if the set has no comparator,
if fromElement
does not implement Comparable
).
Implementations may, but are not required to, throw this
exception if fromElement
cannot be compared to elements
currently in the set.NullPointerException
- if fromElement
is nullIllegalArgumentException
- if this set itself has a
restricted range, and fromElement
lies outside the
bounds of the rangepublic NavigableSet<E> subSet(E fromElement, E toElement)
NavigableSet
The returned set will throw an IllegalArgumentException on an attempt to insert an element outside its range.
Equivalent to subSet(fromElement, true, toElement, false)
.
subSet
in interface NavigableSet<E>
subSet
in interface SortedSet<E>
fromElement
- low endpoint (inclusive) of the returned settoElement
- high endpoint (exclusive) of the returned setClassCastException
- if fromElement and
toElement cannot be compared to one another using this
set's comparator (or, if the set has no comparator, using
natural ordering). Implementations may, but are not required
to, throw this exception if fromElement or
toElement cannot be compared to elements currently in
the set.NullPointerException
- if fromElement
or
toElement
is nullIllegalArgumentException
- if fromElement is
greater than toElement; or if this set itself
has a restricted range, and fromElement or
toElement lies outside the bounds of the rangepublic NavigableSet<E> headSet(E toElement)
NavigableSet
The returned set will throw an IllegalArgumentException on an attempt to insert an element outside its range.
Equivalent to headSet(toElement, false)
.
headSet
in interface NavigableSet<E>
headSet
in interface SortedSet<E>
toElement
- high endpoint (exclusive) of the returned setClassCastException
- if toElement is not compatible
with this set's comparator (or, if the set has no comparator,
if toElement does not implement Comparable
).
Implementations may, but are not required to, throw this
exception if toElement cannot be compared to elements
currently in the set.NullPointerException
- if toElement
is nullIllegalArgumentException
- if this set itself has a
restricted range, and toElement lies outside the
bounds of the rangepublic NavigableSet<E> tailSet(E fromElement)
NavigableSet
The returned set will throw an IllegalArgumentException on an attempt to insert an element outside its range.
Equivalent to tailSet(fromElement, true)
.
tailSet
in interface NavigableSet<E>
tailSet
in interface SortedSet<E>
fromElement
- low endpoint (inclusive) of the returned setClassCastException
- if fromElement is not compatible
with this set's comparator (or, if the set has no comparator,
if fromElement does not implement Comparable
).
Implementations may, but are not required to, throw this
exception if fromElement cannot be compared to elements
currently in the set.NullPointerException
- if fromElement
is nullIllegalArgumentException
- if this set itself has a
restricted range, and fromElement lies outside the
bounds of the rangepublic NavigableSet<E> descendingSet()
The returned set has an ordering equivalent to
Collections.reverseOrder
(comparator())
.
The expression s.descendingSet().descendingSet()
returns a
view of s
essentially equivalent to s
.
descendingSet
in interface NavigableSet<E>
public Spliterator<E> spliterator()
Spliterator
over the elements in this set.
The Spliterator
reports Spliterator.CONCURRENT
,
Spliterator.NONNULL
, Spliterator.DISTINCT
,
Spliterator.SORTED
and Spliterator.ORDERED
, with an
encounter order that is ascending order. Overriding implementations
should document the reporting of additional characteristic values.
The spliterator's comparator (see
Spliterator.getComparator()
) is null
if
the set's comparator (see comparator()
) is null
.
Otherwise, the spliterator's comparator is the same as or imposes the
same total ordering as the set's comparator.
spliterator
in interface Iterable<E>
spliterator
in interface Collection<E>
spliterator
in interface Set<E>
spliterator
in interface SortedSet<E>
Spliterator
over the elements in this setDracula Javadoc Sample, Made with Allan Im.


what kind of heros are you?
what what makes you different from the others?
what kind of wepons would you choose?
will you change the prophecy?
what kind of heros are you?
what what makes you different from the others?
what kind of wepons would you choose?
will you change the prophecy?


It was a nice Saturday evening in late June. Stashed away in my room were 8 peyote buttons and 1/8 ounce of mushrooms, all of which was to be split between my friend Bryan and me. This would be my second time with mushrooms, but the peyote was foreign to me and I was to take both along with smoking a hefty sum of cannabis.
The first time I took mushrooms it was 1/16 of an ounce, the same amount taken on this trip. I saw mild hallucinations, including the infamous shifting floor, but I thought they were just that, hallucinations. This trip proved more to be just a trip, it turned out to be an eye opener to what’s really floating around out there.
[6:00 pm] We ingested the peyote, which I grounded up the best I could so it would metabolize faster. The peyote had too much of a barky texture that couldn’t be pulverized into powder with a pestle and mortar. The small pieces were much too bitter to chew up so I had to swallow mine down with water.  We planned to trip hard during the late hours and took it early so for two reasons: One was upon hearing peyote takes really long to kick in and the other was if it made us vomit, we would still have shrooms to look forward to.
[9:45 pm]Four hours later and I had only felt a head change, which had been an hour before. We had practically given our hopes up in the thought that peyote was doing nothing to us. We smoked a bowl at the park and took the mushrooms. Then we walked over to another park, which I had bad feelings about. All these bright baseball lights were on from a little league game so I felt a little more comfortable. After a cigarette, Bryan wanted to smoke more weed. I didn’t want to because I knew it would make me paranoid, but I ended up doing so anyway. This park is a hot zone for pigs so we walked toward the wooded area of the park to get away from the baseball field lights. Right then, the lights shut off and we were in darkness. Paranoia surged though my veins and my heart rate increased. We immediately walked back toward a bathroom with a dim light to smoke by. We smoked two bowls, which literally took forever. All the time while I was smoking, my mind was set on just getting home.
[10:45 pm]I was a hopeless paranoid at that moment. We walked into dairy queen for a couple of waters. Right then I felt drugs beginning to take hold. The room began glow and pulse. I had a very hard time ordering a simple free water. Once we left I knew I was in a pickle. My mom usually expects me home around 11:00. I looked way too high to confront her with my droopy dark dilated eyes, I also knew that it was only going to get worse from here on out. Our best bet was to go home before it got worse.
[11:15 pm]I arrived home. Lucky for me, my mom was in bed reading. I quickly locked the door, said goodnight to my mom and went to my room with Bryan before she could even see me. It was a big relief for me and the fear slowly began to settle. My room looked the same as it did the first time I did shrooms. It was glowing a bright haze and the geometric patterns were shifting on my floor. Something wasn’t right though. Everything just seemed to be overloaded. I wasn’t tripped out, there was just this feeling I had that there was too much shit going on and I couldn’t comprehend what it was or why I felt this way. Being at the park just triggered a switch for what I thought would be an all night bad trip.
[11:30 pm]Only fifteen minutes had gone by and it felt like it had been two hours. The peyote and mushrooms suddenly worked together to kick me in the nuts with full force. I went from mild paranoid feelings, to a full force of paranoia and bad vibes. I knew I could make it pass with complete silence and tranquility in my room for about ten minutes. That was not the case. Bryan kept moving about the room, talking too much and wanted me to get food for him. I kept explaining to him over and over to stop talking, stop moving around the room, and stop asking me for things. It fell upon deaf ears. He can be completely worthless when he is under the influence sometimes. My bad energy was on a meter in the negative side that was very slowly drifting toward the positive side. Every time Bryan said or did anything, it would jerk me back further down the negative side. Once I reached the positive side of the meter, I wouldn’t go back to the negative side. Bryan was not allowing this to happen.
[12:00 am - Lost time in the space time continuum - 5:00am ]Bryan finally stopped after a half hour of me constantly pestering him. I sat quietly in my chair slouched over with my head in my hands. The overload of thoughts and randomness began to settle faster then I expected. The mood of my room started to change and became very comforting. The same geometric patterns were still shifting on my floor, but they weren’t a bother.
I looked over at Bryan and we both knew by each other’s stare that were somehow in the same state of perception. We proceeded to zone out in trances for several minutes. We were interrupted by Bryan’s cell ringing so I went to the bathroom, sat on the toilet, and watched the floor shift around. Noises started to run through my head. The shag rug on the floor began to sway back and forth to an aquatic fantasy melody, which gave off strong vibes of being underwater. There was also a faint conversation going on between two people. I left to go back to my bedroom and Bryan had the look of oblivion. Everything was strange yet manageable. We decided to have a nice bowl or two.
 I wasn’t scared, but I knew something was going on in my room other than illusion. The noises in my head grew louder. Bryan had the ‘I don’t know’ look upon his face, so I turned off all the lights except a dim blue fish lamp (so things couldn’t get too scary) and began talking with him.
“Are you hearing voices?” I asked.
“I don’t know. I….I really just…don’t know how to explain what’s going on,” he replied.
“Wait, just be quiet and listen.”
So we listened in silence and sure enough noises started to emerge. The voices weren’t clear and I could only repeat the tone. As I started repeating the first things I heard, Bryan looked at me in shock. “No fuckin’ way” he said. We kept listening and took turns repeating what we heard. The noises ranged from little girls laughing to conversations to tunes and knocking. There was too much going on to explain it all. Then a jumble of images began to appear in my head. The first thing that appeared was a row of water wheels. I asked Bryan what he saw and it was the same thing.
Christ, things got really crazy at this point. All these images of multi-colored patters, places and tunnels began to appear. Bryan and I continued to describe the things that we saw simultaneously. There was even Da Vinci’s Vitruvian Man holding Pink Floyd’s Dark Side of the Moon prism. What did all of this stuff mean? I had no clue but I wanted more. We decided to go a little deeper with another bowl.
While smoking, noises became louder. At one point while holding in a hit, I heard someone coughing…right after that I coughed my lungs out. I knew one of those bastards somehow knew I was going to cough and mocked me for it. After that bowl, something happened that I DID NOT expect. I could now feel what was going on. The room began to glow very bright, then dim down. It seemed like these waves of energy were coming in from one corner and leaving the other. As they came in my body temperature would rise accompanied by tingly burning sensations. The vibes in my room constantly changed from positive to negative. As the energy shifted, my body temperature shifted back and forth from cold shivers to burning hot. At one point it felt like my body was completely covered in IcyHot. Crazy? Yes, but the fact that Bryan was all the while feeling the very same thing is even crazier.
An unknown while later, I began to come down. Wrong! When I just got done cursing in disappointment, my room turned gray and there were little Tiki savages dancing on my closet door. The trip continued forward for the rest of the night constantly shifting in moods without affecting my own.
My conclusion on my fraudulent comedown is that not too many things from the other side happened to be passing though at that moment. This happened to me before with another friend on a DXM trip. We just seemed to abruptly come down at the same time. I didn’t know what to think of it then, but after this trip I knew why.
Another conclusion I’ve come to about my room is that it’s a spiritual portal, more so than other places in my house. My closet is the worst. My same friend, who I abruptly came down off of DXM with, said he kicked a giant stone soldier that was coming out of the closet during a different DXM trip. He also said there were skeletons constantly peeking out and whenever he’d look over, they’d quickly hide. I laughed at the whole thing and thought he was just trippin’ hard.  “Not to worry,” he said, “I crushed him into a little ball and lit him on fire.”
When Bryan told me we needed to close my closet door, I knew that my other friend was right about a stone soldier trying to get him. My closet has some very bad vibrations coming out of it. It’s probable that all the noir ambience appearing that night came out of my closet. Chills ran up my spine and a strong sense of something angry watching me was present when I opened the door. That door remained closed for the rest of the night and continues to stay closed at nighttime to this day. Typical children who are scared of the so-called boogeyman in the closet may be damn well scared for a reason…something I had no understanding of before, even though I experienced some of these same troubles as a youth.
  My head eventually straightened out and I was able to fall asleep around 6:00am, but not before receiving a final message (end of report). It was my most insightful trip to date, and I plan on having many more.
Conclusion:
We saw, heard, and yes, even felt the same of everything 100% of the time while inquiring each other about it. These visions are not something that even two people spending their entire lives together could possibly imagine by coincidence. The most occurring images were tunnels in all different sorts geometric shapes. These patterns seem to be the main thing about every hallucinogenic experience. I don’t know what meaning they have, but they must have one. Bryan and I were even able to coincide the color combinations of these patterns.
My most memorable visions were scenes from the 1800s and a clear image of an alien appearing on my wall. The only way to explain the way I picked these visions up is though a sixth sense. My senses (spirit, mind, body, whatever) just picked them up as if I was in a tour bus along for a ride into an unexplored area. There was no thought process whatsoever, it is just a matter of tuning in. While tuned in, the images just appeared in my mind, similar to imagination but in a much different way. The differences were the ability to scan around and clarity didn’t change (as so in imaginations when trying to look at a big picture but unable to maintain smaller details used to build up that big picture)…also, I was able to contemplate my own set conjectures on these visions with no affect to the visions themselves. We all have a third eye and mine was opened that night.
The strange thing about this “third eye” is it’ ability to make itself present in all the worldly senses. I believe that if one were to go deep enough, they could detect all that is around them with sight, hearing, touch, taste, and smell. These hallucinogenic drugs definitely deserve more respect than what is given. Sure, they can be used to just trip out which can very well produce desirable effects, however it is way more fun (considering the vibes are right) and beneficial to use it for enlightening religious and meditative purposes.
[A Prophecy?: When I was watching TV, I turned to a news station (I think it was CNN). On TV was some Mideastern leader talking about the death of the terrorist Abu Musab al-Zarqawi in the bombing attacks. All of a sudden the sound tuned out. A voice came over shouting, and I quote, “al-Zarqawi isn’t really dead, he is hiding, he is hiding from the true catastrophe that is about to happen.” Then it seemed to click back to the original sound and someone else’s voice was in the middle of a sentence.
This trip took place on June 24, 2006. I don’t know why it said al-Zarqawi was still alive seeing as how he was killed on June 6th, but I think the “true catastrophe” could relate to Israel-Lebanon-Hezbollah crisis that started on July 13th.  Was a prophecy spoken?  Only time will answer these questions seeing as how this report was completed on August 4th ‘06 (a rather early point to be jumping to conclusions) and I can’t update]
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.


General Preferences
- File erasing level: Select the security level for erasing data from a hard drive. Available options are Simple (1 pass), DoE (3 passes), DoD (7 passes), and Gutmann (35 passes).
- CD/DVD erasing level: Select the security level of erasing data from a rewritable optical disc. Available options are Quick and Complete.
- Warn before erasing: Display an alert dialog to warn the user about the files which are about to be erased.
- Play sounds: Play sounds when Permanent Eraser is complete.
Tip: Holding down the Option key when Permanent Eraser starts will temporarily disable the warnings for that session.


My Work
Check out some of my projects...
Video player that uses the Youtube Data v3 API. Built with React, NodeJS to host on Heroku, and a boilerplate from Modern React with Redux.
This is a weather app built with React, Redux, and NodeJS for Heroku Deployment. It displays multiple 5-day forecasts based on user specified cities in the US. Utilizes Google's JavaScript Map API and the OpenWeatherMap API.
An issue tracker app built with JavaScript using the browser's local storage to store issues. Uses Chance.js to generate random guids for the issues, which also get stored in local storage.


This site will help you add the unimarklet with any custom repo you want. It is still a work in progress but will be really cool when complete.
There will be a way to generate your custom link easily but for now, there is just one repo by default. Will work on making it better plus adding more options.
For now, drag this element (
Unimarklet) to your favorites or paste this into your bookmark manager:


Posted by 楚爷 on March 6, 2016
Posted by 楚爷 on February 29, 2016
Posted by 楚爷 on February 26, 2016
Posted by 楚爷 on February 20, 2016
Posted by 楚爷 on October 25, 2015
Posted by 楚爷 on October 24, 2015
创过业、做过独立开发者、上过班