| DOSE: T+ 0:00 |
16 mg |
oral |
2C-T-2 |
(liquid) |
| |
|
smoked |
Cannabis |
(plant material) |
| T+ 3:00 |
|
smoked |
Cannabis |
(plant material) |
Today was Wednesday, and the previous Monday (nine days ago) had been my first experience with 2C-T-2. I had had a reasonable experience, but with no insights or real sparkle, so I wanted to make this one a bit better. Last time I took 14ml of our solution (of about 1mg/ml, though we think it's actually 10-20% stronger than this). This time, I took 16.
I had only had four hours of sleep the previous night, and I was a tiny bit reluctant to take the compound, but I was sure it wouldn't cause any problems.
We took the 2C-T-2 and went out to the park to smoke a spliff before the comeup. Last time hadn't given me too much discomfort, but chris had experienced some at 18ml so I thought it prudent to ease my stomach this time. The nausea was definitely abated by using the cannabis.
Last time I took the 2C-T-2 I had come up in about five waves of increasing effect, similar to MDMA rushes.  I finished the game, and as soon as my mind was free of the concentration, I was hit with a huge wave, and had to lie down. At this point I was slightly worried because I was expecting five or so more waves, each one harder than the last, but I soon realised that my playing the game had caused all the comeup to be concentrated into one wave.
Soon we went out to walk round the park.
It was a pleasant day, and the sunlight was giving me lovely rainbow visuals. The stones on the path were beautifully detailed, and I felt like I could have stared at them for hours without getting bored.  Lichens on the stone were miniature mazes, intricate details zooming into the surface, and glowing with cycling colours. Bare trees were explosions of light beaming from underground.
Time was altered in an interesting way; it wasn't that it was passing more slowly or quickly than normal, but I found it difficult to tell how far in the past events lay. Our first spliff before we came up felt like last week, and I had no idea whether we had walked along this path hours or minutes ago.
The visuals were certainly intense and beautiful, and I found myself very interested in the spatial relationships between the levels of the ground (in fact, the ground was so discretely positioned in terms of height that I viewed the park as a giant platform game) but as with my last time on 2C-T-2, the mental was remarkably clear. But after about three hours, this was to change.
Still walking around the park, we took out our second (and larger) spliff, which we smoked, and then walked up to the bandstand with a view over the whole of the bay, and sat down.
One minute I was sitting there feeling progressively stranger, and then bang!
'Nothing.'
It was as if my brain had been restarted. I understood nothing, there was nothing.
After a time, my brain began to load its software up again.
'World'
This was the first concept that returned to me. I was aware of the world, and that was all I experienced.
Now concepts began returning more quickly, new ways of deciding what the world meant returned at an exponential rate. Soon I was aware of:
'World', 'Big'
I was aware of the world, or perhaps the whole universe, and I was aware that it was big.
'World', 'Big', 'Person'...
'Person-Object'
Now I was aware of an entity called a person, and that all persons had an object associated with them; a body.
'Person/World'
The interaction between the person (and its associated person-object) now made some sense to me. I was aware that a person-object is separate from the world, and there is a complex interaction between the two.
'I'
Now I was aware of 'I'. Up until now the concepts had all made fundemental sense. Each new concept could be described using the previously loaded concepts, but this one was strange. 'I' made no sense because it was not part of the world, and was not an object. If I had been able to be confused, I would have been confused now.
I knew that there needed to be more information, more concepts, before this 'I' entity would make any sense.  Chris carried on looking straight ahead, and asked 'What do you mean?'
By this point, the basic concepts (which I will call the level one concepts) had been mostly loaded, allowing the more complex ones (the level two concepts) to load more quickly.
Now I could access my memory, in a rudimentary form. I was aware that the memories existed, and I could 'read' them, but they could not run on the hardware of the brain yet.
So I was aware of all my personal details again, but I still didn't know what those details meant. So I replied to Chris; 'Ah... It's coming back to me' (interestingly my ability to speak and regulate my body in every other way remained unaffected. Only my actual consciousness had been shut down and restarted.) I was now aware of the concept of fear, but like many of the other level two concepts, it was not yet running. So I knew I was undergoing a frightening experience, but I felt no fear.
As the level two concepts returned to me, the data stream that my senses were feeding to my brain was interpreted using these concepts as they were added, and my conscious became more and more complex. Soon I was able to examine the experience that had just happened to me, over the course of a few seconds.
It required a fair amount of effort to keep my consciousness running at its normal level. I feel that if I had let go I could have returned to a very strange state of awareness, and I would not have been averse to this, had it not been for the fact that my body could have done anything. At the time I was sitting on a bandstand in a public park, so I didn't want to completely nod out for obvious reasons. I decided that we'd better walk around, which definitely occupied my mind and kept me from slipping back to strangeness.
We walked around the park for perhaps twenty minutes, and decided to go back to Chris's house before his family started returning so we could sit in his room and avoid having to talk to people. Before I had smoked the cannabis I think I could have appeared fairly normal, but this state of consciousness was so profoundly altered that I would not be able to guarantee I wouldn't talk utter crap.
A sort of duality had now appeared; there was a part of me that could walk around, and could hold a normal conversation, and there was the part of me that was incredibly tripped out. The first part was almost like an autopilot; it could control my body in a way that would appear to be normal to anyone else, but the fact that the other part of me was totally zonked meant that there could be no real-time error checking. If the autopilot screwed up and I began talking about the lord of all cabbages, it would be a few seconds before I noticed that I was talking nonsense. The risk of this was too great to be talking to normals.
We watched a cartoon, and by the time this had finished I found myself thinking much more clearly, and soon after this, I took the train home and got a fitful night's rest.
I gained a fascinating insight into the way my brain works through this experience. I believe that the brain is a computer which fits its sensory inputs into certain concepts (software) which it can understand.
The basic level one concepts are intrinsic to the brain, and are like the 'firmware' of a computer system; the BIOS, the information built into the hard disks which tells the CPU how to access the data, that sort of thing.
Then there are the level two concepts. These are stored in the brain, like the operating system is stored on the hard drive of a computer. These concepts allow us to make sense of the world, and to compare and contrast data, and to store and retrieve the memories and other data that make us who we are.
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.


Emulating the Bhutanese bamboo bows, made by tying two bamboo slats, then tapering and tillering. The biggest differences are that the outside of the bamboo is the back (away from the archer) rather than the belly of the bow, and it's wider than the Bhutanese bows. Bends too much at the handle... I also had to make it shorter because it was too weak. The bamboo is too thin.


Q1 2019
Project visibility and communication
Laying the groundwork for public discussion and transparent development
- Branding for CCore suite and applications complete
- Communicating the new names to system users and developers, so they may continue to use these services.
- Updated documentation, product descriptions, and roadmap information on GitHub and the IU Developers website.
- Improve development process transparency and provide structured processes for clients to submit issues, bugs, and feature requests.
- For each existing application, we will create a GitHub project with a public backlog of known issues and feature requests.
- A process will be created to respond to each GitHub issue, either accepting the issue, merging it with another issue, modifying the issue, or rejecting it. This will all be done in plain sight within GitHub.
- Publish project pages with information about work currently planned or in-process for each application, as well as information about planned changes in future sprints.
- CCore Services v1.0 (fka Serif) in production
- CCore People MVP: Initial (read-only) deployment of People, as replacement for IT Pro Database, in partnership with ITCP and SSL; import and sanitization of Structure data from WCMS
- Prototyping of People admin client, for maintaining both organizational units, their structure, and membership (by HR, IT managers, and administrative assistants) and profile pages (by managers and individuals)
- Redesign the administrative interface for CCore Knowledge (fka KMSED) using Rivet and making modifications to better integrate with CCore Services; make the IU Knowledge Base Rivet-compatible.
- Migrate CCore Knowledge to latest version of Java
- Work with IT Communications Office (ITCO) and Knowledge Management (KM) to scope initial requirements for CCore Assets, a digital (rich-media) asset management system, including prototypes.


OES JavaScript Core 0 Simulator
The OESjs Core 0 simulator implements a minimal architecture for Object Event Simulation (OES), supporting models with (global) model variables and functions,
object types, event types, and simple simulation experiments.
Tutorial
Simulation Examples
Service-Desk-0 : a simulation model with two event types (CustomerArrival and CustomerDeparture ) and no object type. The system state is not expressed with objects, but with the help of the model variable queueLength representing the length of the waiting line.
Service-Desk-1 : a model with two event types (CustomerArrival and CustomerDeparture ) and one object type (ServiceDesk ). The state variable queue length is represented by the attribute queueLength of the service desk object.
Service-Desk-2 : a model with two event types (CustomerArrival and CustomerDeparture ) and two object types (ServiceDesk and Customer ). In this model, the waiting line is explicitly represented as a queue of individual customer objects.
Inventory-Management : a model with two event types (DailyDemand and Delivery ) and one object type (SingleProductShop ).


Overview | Reports | Quarter | Contract
| Vendor Name: | SARAH KARYN SLOAN |
| Reference number: | K8A53-14-9129 |
| Contract Date: | 2015-01-07 |
| Description of work: | 0491 Other Prof. Serv. - Management consulting - OGD or programs |
| Contract period: | 2015-01-28 to 2015-03-31 |
| Delivery Date: | |
| Contract Value: | $19,112.50 |
| Comments: | Identify and evaluate research networks that could inform the design of a pan-Canadian network of expertise for oil spill research |


@->searchQuery
Something short and leading about the collection below—its contents, the creator, etc. Make it short and sweet, but not too short so folks don’t simply skip over it entirely.
@->title
@->title
Something short and leading about the collection below—its contents, the creator, etc. Make it short and sweet, but not too short so folks don’t simply skip over it entirely.
@->title


airport map
AeroNuova
Restaurant
5 mins
Mamma mia! This enticing trattoria features a modern take on classic Italian cuisine.
GATE
AROUND ME


2 references to RecordFailure
System.Management.Automation (2)
engine\MshCommandRuntime.cs (1)
2382
PipelineProcessor.
RecordFailure
(e, _thisCommand);
engine\pipeline.cs (1)
1336
RecordFailure
(e, commandProcessor.Command);


This site has been renamed to
Chromosomal Microarray (CMA) search
.
Redirecting to:
cma-search.broadinstitute.org


The official Rust documentation can be found at the Rust website. There is an awesome Rust Tutorial called Rust by Example.
Documentation referring to errors that may come from compiling can be found in the docs.
The official Rust website also offers a book aimed at newcomers to Rust. There is also a book for more advanced users here.
A community collection of resources can be found on Github.
Documentation for external packages(crates) can be found here.
They also have documentation for the nighly release and beta release.


shiloh
Radix lecti
Registered: Oct 2001
Location: City of Angels
Posts: 1953 |
Re: sg1 full ep. synopsis
quote: Originally posted by bellachikita
does anyone know a website that offers a full synopsis for each of the new season 5 episodes. \\
How detailed?
The best web site I know of is
www.rdanderson.com
Click on stargate, then click on "mission database" *not* "episodes". HOWEVER: it only goes though "The Tomb" or so. We in the US won't get the last half of season until March-June.
__________________
Just another freak in the freak kingdom.
Report this post to a moderator | ? + *
|


Home
(current)
HTPasswordGenerator
RandomPasswordGenerator
SSHKeyGenerator
JsonPrettifier
FormatConverter
TimeConverter
Base64Converter
URLDecoder
Time Converter
Here are the details:
Current UTC epoch time:
Seconds
Milliseconds
Microseconds
Current UTC human time:
Y-M-D H:M:S
Current UTC LOCAL ({{ .Timezone }}) human time:
Y-M-D H:M:S
{{ if not .EpochToHuman }}
{{ end }}
Converted Epoch to Human UTC time:
Copy
Converted Epoch to Human UTC LOCAL ({{ .Timezone }}) time:
Copy
{{ if not .HumanToEpoch }}
{{ end }}
Converted Human to Epoch UTC time:
Seconds
Milliseconds
Microseconds
Copy
New time conversion


Object:
Annotation Loading:
Image Dimensions:
Blob score > ( / visible)
Arrowhead score > ( / visible)
Arrow score > ( / visible)
Text score > ( / visible)
Original:
Resized:


If debugging errors, start with the first reported error, subsequent tests often rely on earlier ones.


Our visual system remains too limited to tackle all of the information our eyes take in.


6 Chart types
Visualise your data in different ways. Each of them animated, fully customisable and look great, even on retina displays.
Visualise your data in different ways. Each of them animated, fully customisable and look great, even on retina displays.
Chart.js uses the HTML5 canvas element. It supports all modern browsers, and polyfills provide support for IE7/8.
Chart.js is dependency free, lightweight (4.5k when minified and gzipped) and offers loads of customisation options.
Line graphs are probably the most widely used graph for showing trends.
Chart.js has a ton of customisation features for line graphs, along with support for multiple datasets to be plotted on one chart.
Bar graphs are also great at showing trend data.
Chart.js supports bar charts with a load of custom styles and the ability to show multiple bars for each x value.
Radar charts are good for comparing a selection of different pieces of data.
Chart.js supports multiple data sets plotted on the same radar chart. It also supports all of the customisation and animation options you'd expect.
Pie charts are great at comparing proportions within a single data set.
Chart.js shows animated pie charts with customisable colours, strokes, animation easing and effects.
Polar area charts are similar to pie charts, but the variable isn't the circumference of the segment, but the radius of it.
Chart.js delivers animated polar area charts with custom coloured segments, along with customisable scales and animation.
Similar to pie charts, doughnut charts are great for showing proportional data.
Chart.js offers the same customisation options as for pie charts, but with a custom sized inner cutout to turn your pies into doughnuts.


The Skin Designer is only located on the Admin > Advanced Settings > Skins page. It enables Administrators to set container and skin token values.
The Skin Designer


_______ __ __ _____
| __| |_.--.--| |-----.| \-----.----.----.-----.
|__ | _| | | | -__|| -- | _ | __| __| _ |
|_______|____|___ |__|_____||_____/_____|____|____|_____|
|_____|
StyleDocco generates documentation and style guide documents from your stylesheets.
Stylesheet comments will be parsed through Markdown and displayed in a generated HTML document. You can write code examples prefixed with 4 spaces (or between ```
, GitHub code fences) in your comments, and StyleDocco both renders the HTML and shows the code example.
An important philosophy of StyleDocco is to introduce as little custom syntax as possible, maintaining the stylesheet comments readable and useful even without StyleDocco.
The document is automatically split into new sections when it encounters a level 1 or 2 heading. Read more about the heading syntax in the Markdown guide. Only comments at the beginning of new lines are included, put some whitespace before a comment to exlude it from the style guide.
Suggestions, feature requests and bug reports are very welcome, either at GitHub or on Twitter (@jacobrask).
StyleDocco requires Node.js. After installing Node.js, run
npm install -g styledocco
or check out this repository.
StyleDocco is free software, released under the MIT license.
styledocco [options] [INPUT]
StyleDocco will automatically compile any SASS, SCSS, Less or Stylus files before they are applied to the page. You can also enter a custom preprocessor command if you want to pass custom parameters to the preprocessor.
If your project includes a README
file, it will be used as the base for an index.html
. StyleDocco will also add some default styles to your documentation, but they are easy to modify to make it fit with your project.
--name
, -n
Name of the project (required)--out
, -o
Output directory (default: "docs")--resources
, -s
Directory for custom template, CSS and JavaScript. Can be the same as the output directory if you don't want to overwrite your changes. StyleDocco defaults will be used for any required file not found in this directory. (optional)--preprocessor
Custom preprocessor command. To disable preprocessing, use none
. (optional) (ex: --preprocessor "scss --load-path=deps/"
)--include
Prepend specified CSS file to the documentation stylesheet. (optional) (ex: --include mysite.css
)Generate documentation for My Project in the docs
folder, from the files in the css
directory.
styledocco -n "My Project" css
Generate documentation for My Project in the mydocs
folder, from source files in the styles
folder. Use the Less binary in ~/bin/lessc
.
styledocco -n "My Project" -o mydocs -s mydocs --preprocessor "~/bin/lessc" styles
/* Provides extra visual weight and identifies the primary action in a set of buttons.
<button class="btn primary">Primary</button> */
.btn.primary {
background: blue;
color: white;
}
Would display the description, a rendered button as well as the example HTML code. The CSS will be included in the style
element of the document.
See the examples
folder for more in-depth examples.
A lot of the heavy lifting in StyleDocco is done by the excellent Marked module by Christopher Jeffrey. The original Docco by Jeremy Ashkenas and Docco Husky by Mike Brevoort were also of great help to this project. Knyle Style Sheets, a similar project written in Ruby, has also been an inspiration to StyleDocco.


Strictly spoiler leaves fans livid as 'potential finalist' eliminated in Blackpool
Viewers of the BBC One talent contest were left seething after some Twitter users spoiled the results from Blackpool
by James Rodger, https://www.facebook.com/jamesrodgerjournalistStrictly fans have been left gutted after the result for Sunday evening's show was leaked on social media - AGAIN.
Viewers of the BBC One talent contest were left seething after some Twitter users spoiled the results from Blackpool.
Strictly Come Dancing films its Sunday night results show on Saturday evenings, meaning leaks often occur.
But this week's has left fans particularly annoyed - after a crowd favourite was axed.
The contestant, widely seen as a potential finalist, was voted off the show after the judges opted to save a rival contestant.
BirminghamLive knows who has left the show but won't spoil the result for viewers keen to watch it unfold tomorrow.
One tweeted: "Absolutely gutted #StrictlySpoiler."
While another commented: "Noooooooo #StrictlySpoiler."
Social media was awash with other angry comments, too, with one branding the contestant a "finalist" - and another saying: "Totally wrong."
"I shouldn't have searched #StrictlySpoiler. My life is over", one tweeted.
And another remarked: "Nah you’re joking me #StrictlySpoiler."
Another raged: "I AM F***ING FUMING #StrictlySpoiler."
Fans will have to wait until tonight to discover the remaining celebs' fate, as well as watch a huge Westlife performance.
*Strictly Come Dancing's results show airs tomorrow on BBC One


Thank you for submitting the email with the subject
{<[subject]>}
Analysts have determined this email was not phish but rather an attempt to defraud or scam you. We have removed it from your mailbox.
Any additional comments added by the analyst may be listed below.
{<[user_comment]>}
Please keep reporting these types of emails and other phishing attacks!
Here is a quick review about spam vs. phishing:
If you have any questions please contact the service desk.
Best regards,
Cyber Security


?CUBA
ork
Botanical
Garden
lk51705
CAT
ISLAND
(BAHAMAS)
Arthurs
"Iowa
Wilsons
Bermets
Harbor*
Aristida
vilfifolia
Herit.
flORlDA\J)
BAHJA'MA
fSLA'NV
Moss
Town,
seen
j
\o
(J-rass
grov/ing
by
The
Bight
footpath
near
"Blue
Hole"
c.
2
miles
east
of
Orange
Greek,
very
often.
Y
r
o
ANICAL
EN
R
D
No:
592
Collected,
by
Roger
Byrne
Date:
'
UP'
1659705
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high


We extend infrastructure!
- empower customized infomediaries
- streamline killer systems
- drive magnetic vortals
- redefine virtual synergies
- enable collaborative e-commerce
- syndicate virtual models
- architect enterprise action-items
- iterate plug-and-play convergence
- recontextualize dynamic models
- integrate integrated schemas
- harness scalable architectures


Hello,
Xamarin is excited to be at MonkeySpace 2013 next week! We've got a crew of developers looking forward to spending the week discussing all things C# - so join us at any of the events we've got planned.
Included in this year's incredible list of speakers are ten Xamarin-led sessions on open source .NET, mobile C#, cross-platform development, and Mono. Be sure to check out -
Miguel De Icaza - What is new with Mono
Joseph Hill - Building hybrid mobile apps with C# and Razor
Nina Veydin - The Anti-Abstraction: Why We Shouldn't Leave Everything Up To Magic and Backgrounding/Multitasking in Mobile
Mike Bluestein - Unifying APIs with Xamarin.Mobile, Cross-platform Mobile Application Architecture with Xamarin, and Advanced Collection Views
Lluis Sanchez - MonoDevelop Internals
Michael Hutchinson - Extending Xamarin Studio with Add-ins
Larry O'Brien - Cross-Platform Mobile Architectural Patterns
Additionally, Xamarin is sponsoring the hackroom. There will be food, drinks, and cool things to hack on so make sure to drop by.
Finally, Xamarin is hosting a Chicago Drink-Up on Monday, July 22nd! Stop by The Grid at 8pm for drinks, food, and friends. More information and RSVP here!
We look forward to seeing you next week!


Interpolations are not allowed in some places: * Anywhere inside variable definition * In module's 'source' property * In resource's 'depends_on' property


My name is Kristen, and this is a page with some facts about myself. I went to school for business and finance, and I have been working as an Intellectual Property Paralegal since moving to Chicago in 2009. I really hope Dev Bootcamp can help me transition to a fun, new career!
The basics:


Chapter 3 Data Import
3.1 Basics
readr, tibble, and tidyr
R’s tidyverse is built around tidy data stored in tibbles, an enhanced version of a data frame.
- Readr : The front side of this sheet shows how to read text files into R with readr.
- tidyr : The reverse side shows how to create tibbles with tibble and to layout tidy data with tidyr.
3.2 Write Functions
Save x, an R object, to path, a file path, with:
These functions share the common arguments:
write_*(x, path, na="NA", append=FALSE, col_names=!append)
| func | delim | arguments |
|---|---|---|
| write_csv | , | |
| write_delim | any | delim=“…” |
| write_excel_csv | ||
| write_file | ||
| write_lines | ||
| write_rds | compress=c(“none”,“gz”,“bz2”,“xz”) | |
| write_tsv | tab |
3.3 Read Functions
3.3.1 Read tabular data tibbles
3.3.2 Useful arguments
write_csv(path='file.csv',
x = read_csv("a,b,c\n1,2,3\n4,5,NA"))
read_csv("file.csv", col_names=FALSE)
read_csv("file.csv", col_names=c("x","y","z"))
read_csv("file.csv", skip=1)
read_csv("file.csv", n_max=1)
read_csv("file.csv", na=c("4","5","."))
3.4 fread() for bigger datasets
- set working directory
- packages “data.table”
- handles large datasets fast
- easy to use
- improved .CSV importing features
- separator is automatically recognised
- strings are not automaticall convertied to factors | ‘stringsAsFactors=T’
- the header is displayed automaticall
- output: ‘data.frame’ (second class: ‘data.frame’) | ‘data.table=F’
library(data.table)
#>
#> Attaching package: 'data.table'
#> The following objects are masked from 'package:dplyr':
#>
#> between, first, last
#> The following object is masked from 'package:purrr':
#>
#> transpose
mydata = fread("./data/Bug-Frequency.csv")
mydata
#> region < 10 g 10 - 20 g 20 - 30 g 30 - 40 g > 40 g
#> 1: Welsh Creek 5 34 54 23 8
#> 2: River Inn 72 33 28 35 9
#> 3: Spur Forest 34 65 23 67 2
#> 4: Hamock Flats 28 23 34 45 11
#> 5: Gelb Rocks 34 68 23 58 9
df = fread("1 Singapore 5,612,300 710 7,905
2 Bangladesh 164,170,000 143,998 1,140
3 Taiwan 23,562,318 36,190 651
4 South Korea 51,446,201 99,538 517
5 Lebanon 6,082,000 10,452 582
6 Rwanda 11,809,295 26,338 448
7 Netherlands 17,200,000 41,526 414
8 Haiti 10,911,819 27,065 403
9 India 1,329,250,000 3,287,240 404
10 Israel 8,830,000 22,072 400",
col.names = c("Rank", "Country","Population", "Area(km2)","Density(Pop. per km2)"
))
df
#> Rank Country Population Area(km2) Density(Pop. per km2)
#> 1: 1 Singapore 5,612,300 710 7,905
#> 2: 2 Bangladesh 164,170,000 143,998 1,140
#> 3: 3 Taiwan 23,562,318 36,190 651
#> 4: 4 South Korea 51,446,201 99,538 517
#> 5: 5 Lebanon 6,082,000 10,452 582
#> 6: 6 Rwanda 11,809,295 26,338 448
#> 7: 7 Netherlands 17,200,000 41,526 414
#> 8: 8 Haiti 10,911,819 27,065 403
#> 9: 9 India 1,329,250,000 3,287,240 404
#> 10: 10 Israel 8,830,000 22,072 400
3.5 data.frame
- the mainly used object type
- straightforward sttucture
- one row for each observation
- one column for each variable
- R offers different data frame classes
- similar to R’s data visualization systems:
- ‘R-base’
- ‘lattice’
- ‘ggplot2’
- similar to R’s data visualization systems:
3.6 Three data frame alternatives
- ‘data.frame()’ function in ‘R-base’
- ‘data.table()’ function in the package ‘data.table’
- ‘data_frame()’ function in the package ‘dplyr’
each of them is suitabl for storing most data - Let’s see their specialities
3.6.1 data.frame
- no external package needed
- straightforward for simple tasks
- strings are stored as factors per default
- data recycling
- row names can be provided
mydf = data.frame(
a = c("Paul", "Kim","Nora","Sue","Paul","Kim"),
b = c("A", "B","C","B","B","C"),
c = rnorm(2)
)
mydf
#> a b c
#> 1 Paul A -1.400
#> 2 Kim B 0.255
#> 3 Nora C -1.400
#> 4 Sue B 0.255
#> 5 Paul B -1.400
#> 6 Kim C 0.255
sapply(mydf, class)
#> a b c
#> "factor" "factor" "numeric"
3.6.2 data.table
- quick and easy to code
- start processing time
- great documentation
- second class ‘data.frame’
‘data.table’ struction is similar to SQL structure
- ‘nameDT [i, j, by]’
- ‘i’ stands for the subset from our ‘data.table’ we want to work with
- ‘j’ is the actual calculation that will be performed in the data subset ‘i’
- the whole calculation is grouped by ’by
- ‘nameDT [i, j, by]’
- strings are not automatically transfromed to factors
- no custom row names, just row IDs
if a dataset is too big to be processed, then only the first and last five rows are printed
library(data.table)
mytable = data.frame(
a = c("Paul", "Kim","Nora","Sue","Paul","Kim"),
b = c("A", "B","C","B","B","C"),
c = rnorm(2)
)
mytable
#> a b c
#> 1 Paul A -2.43726
#> 2 Kim B -0.00557
#> 3 Nora C -2.43726
#> 4 Sue B -0.00557
#> 5 Paul B -2.43726
#> 6 Kim C -0.00557
3.6.3 data_frame
- requires equals column length
- only columns of length 1 will be recycled
- only the firs couple of rows are displayed in case of large datasets
- second class: ‘data.frame’
- stirngs are not automatically transformed to factors
- no custom row names, just row IDs
library(dplyr)
my_df = data.frame(
a = c("Paul", "Kim","Nora","Sue","Paul","Kim"),
b = c("A", "B","C","B","B","C"),
c = rnorm(6)
)
my_df
#> a b c
#> 1 Paul A 0.622
#> 2 Kim B 1.148
#> 3 Nora C -1.822
#> 4 Sue B -0.247
#> 5 Paul B -0.244
#> 6 Kim C -0.283
3.6.4 Summary
class(mydf); class(mytable); class(my_df)
#> [1] "data.frame"
#> [1] "data.frame"
#> [1] "data.frame"
- it is benefically to use advanced tools for extended data management
- ‘data.table’ and ‘data_frame’ have the standard ‘data.frame’ as second class
3.7 tibble
3.7.1 nycflights13
To explore the basic data manipulation verbs of dplyr, we’ll use nycflights13::flights
. This data frame contains all 336,776 flights that departed from New York City in 2013. The data comes from the US Bureau of Transportation Statistics, and is documented in ?flights
.
library(nycflights13)
flights
#> # A tibble: 336,776 x 19
#> year month day dep_time sched_dep_time dep_delay arr_time
#> <int> <int> <int> <int> <int> <dbl> <int>
#> 1 2013 1 1 517 515 2. 830
#> 2 2013 1 1 533 529 4. 850
#> 3 2013 1 1 542 540 2. 923
#> 4 2013 1 1 544 545 -1. 1004
#> 5 2013 1 1 554 600 -6. 812
#> 6 2013 1 1 554 558 -4. 740
#> # ... with 3.368e+05 more rows, and 12 more variables:
#> # sched_arr_time <int>, arr_delay <dbl>, carrier <chr>, flight <int>,
#> # tailnum <chr>, origin <chr>, dest <chr>, air_time <dbl>,
#> # distance <dbl>, hour <dbl>, minute <dbl>, time_hour <dttm>
You might notice that this data frame prints a little differently from other data frames you might have used in the past: it only shows the first few rows and all the columns that fit on one screen. (To see the whole dataset, you can run
View(flights)
which will open the dataset in the RStudio viewer). It prints differently because it’s a tibble. Tibbles are data frames, but slightly tweaked to work better in the tidyverse. For now, you don’t need to worry about the differences; we’ll come back to tibbles in more detail in wrangle.
You might also have noticed the row of three (or four) letter abbreviations under the column names. These describe the type of each variable:
int
stands for integers.dbl
stands for doubles, or real numbers.chr
stands for character vectors, or strings.dttm
stands for date-times (a date + a time).lgl
stands for logical, vectors that contain onlyTRUE
orFALSE
.fctr
stands for factors, which R uses to represent categorical variables with fixed possible values.date
stands for dates.
3.8 ‘scan()’ for small vectors and snippets
numbers = scan()
# characters = scan(what= "character")
3.9 Other types of data
Try one of the following packages to import other types of files.
- haven : SPSS, Stata, and SAS files
- readxl : excel files (.xls and .xlsx)
- DBI : databases
- jsonlite : json
- xml2 : XML
- httr : Web APIs
- rvest : HTML(Web Scraping)
packages ‘foreing’ to get help : ?foreign
?Hmisc
These functions share the common arguments:
read_*(file, col_names=TRUE, col_types=NULL, locale=default_locale(), na=c(“”,“NA”), quoted_na=TRUE, comment=“”, trim_ws=TRUE, skip=0, n_max=inf, guess_max=min(1000, n_max), progress=interative())


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


Oceanic art or Oceanian art comprises the creative works made by the native people of the Pacific Islands and Australia, including areas as far apart as Hawaii and Easter Island. Specifically it comprises the works of the two groups of people who settled the area, though during two different periods. They would in time however, come to interact and together reach even more remote islands. The area is often broken down into four separate regions: Micronesia, Melanesia, Polynesia and Australia. Australia, along with interior Melanesia (Papua), are populated by descendants of the first waves of human migrations into the region by Australo-Melanesians. Micronesia, Island Melanesia, and Polynesia, on the other hand, are descendants of later Austronesian voyagers who intermixed with native Australo-Melanesians; mostly via the Neolithic Lapita culture. All of the regions in later times would be greatly affected by western influence and colonization. In more recent times, the people of Oceania have found a greater appreciation of their region's artistic heritage.
The artistic creations of these people varies greatly throughout the cultures and regions. The subject matter typically carries themes of fertility or the supernatural. Art such as masks were used in religious ceremonies or social rituals. Petroglyphs, Tattooing, painting, wood carving, stone carving and textile work are other common art forms. Contemporary Pacific art is alive and well, encompassing traditional styles, symbols, and materials, but now imagined in a diversity of contemporary forms, revealing the complexity of geographic, cultural and individual interaction and history.


|
SimpleITK
2.0.0
|
Warps an image using an input displacement field. More...
#include <sitkWarpImageFilter.h>
Public Types | |
| using | PixelIDTypeList = BasicPixelIDTypeList |
| using | Self = WarpImageFilter |
| Public Types inherited from itk::simple::ImageFilter | |
| using | Self = ImageFilter |
| Public Types inherited from itk::simple::ProcessObject | |
| using | Self = ProcessObject |
Public Member Functions | |
| Image | Execute (const Image &image, const Image &displacementField) |
| double | GetEdgePaddingValue () const |
| InterpolatorEnum | GetInterpolator () const |
| std::string | GetName () const |
| std::vector< double > | GetOutputDirection () const |
| std::vector< double > | GetOutputOrigin () const |
| std::vector< uint32_t > | GetOutputSize () const |
| std::vector< double > | GetOutputSpacing () const |
| Self & | SetEdgePaddingValue (double EdgePaddingValue) |
| Self & | SetInterpolator (InterpolatorEnum Interpolator) |
| Self & | SetOutputDirection (std::vector< double > OutputDirection) |
| Self & | SetOutputOrigin (std::vector< double > OutputOrigin) |
| void | SetOutputParameteresFromImage (const Image &refImage) |
| Self & | SetOutputSize (std::vector< uint32_t > OutputSize) |
| Self & | SetOutputSpacing (std::vector< double > OutputSpacing) |
| std::string | ToString () const |
| WarpImageFilter () | |
| virtual | ~WarpImageFilter () |
| Public Member Functions inherited from itk::simple::ImageFilter | |
| ImageFilter () | |
| virtual | ~ImageFilter ()=0 |
| Public Member Functions inherited from itk::simple::ProcessObject | |
| virtual void | Abort () |
| virtual int | AddCommand (itk::simple::EventEnum event, const std::function< void()> &func) |
| Directly add a callback to observe an event. More... | |
| virtual int | AddCommand (itk::simple::EventEnum event, itk::simple::Command &cmd) |
| Add a Command Object to observer the event. More... | |
| virtual float | GetProgress () const |
| An Active Measurement of the progress of execution. More... | |
| virtual bool | HasCommand (itk::simple::EventEnum event) const |
| Query of this object has any registered commands for event. More... | |
| ProcessObject () | |
| virtual void | RemoveAllCommands () |
| Remove all registered commands. More... | |
| virtual | ~ProcessObject () |
| virtual void | DebugOn () |
| virtual void | DebugOff () |
| virtual bool | GetDebug () const |
| virtual void | SetDebug (bool debugFlag) |
| virtual void | SetNumberOfThreads (unsigned int n) |
| virtual unsigned int | GetNumberOfThreads () const |
| virtual void | SetNumberOfWorkUnits (unsigned int n) |
| virtual unsigned int | GetNumberOfWorkUnits () const |
Private Types | |
| using | MemberFunctionType = Image(Self::*)(const Image *image, const Image *displacementField) |
Private Member Functions | |
| template<class TImageType1 , class TImageType2 > | |
| Image | DualExecuteInternal (const Image *image, const Image *displacementField) |
| template<class TImageType1 , class TImageType2 > | |
| Image | DualExecuteInternalVector (const Image *image, const Image *displacementField) |
Private Attributes | |
| std::unique_ptr< detail::DualMemberFunctionFactory< MemberFunctionType > > | m_DualMemberFactory |
| double | m_EdgePaddingValue {0.0} |
| InterpolatorEnum | m_Interpolator {itk::simple::sitkLinear} |
| std::vector< double > | m_OutputDirection {std::vector<double>()} |
| std::vector< double > | m_OutputOrigin {std::vector<double>(3, 0.0)} |
| std::vector< uint32_t > | m_OutputSize {std::vector<uint32_t>(3, 0)} |
| std::vector< double > | m_OutputSpacing {std::vector<double>(3, 1.0)} |
Friends | |
| struct | detail::DualExecuteInternalAddressor< MemberFunctionType > |
| struct | detail::DualExecuteInternalVectorAddressor< MemberFunctionType > |
Additional Inherited Members | |
| Static Public Member Functions inherited from itk::simple::ProcessObject | |
| static bool | GetGlobalDefaultDebug () |
| static void | GlobalDefaultDebugOff () |
| static void | GlobalDefaultDebugOn () |
| static void | SetGlobalDefaultDebug (bool debugFlag) |
| static void | GlobalWarningDisplayOn () |
| static void | GlobalWarningDisplayOff () |
| static void | SetGlobalWarningDisplay (bool flag) |
| static bool | GetGlobalWarningDisplay () |
| static double | GetGlobalDefaultCoordinateTolerance () |
| Access the global tolerance to determine congruent spaces. More... | |
| static void | SetGlobalDefaultCoordinateTolerance (double) |
| Access the global tolerance to determine congruent spaces. More... | |
| static double | GetGlobalDefaultDirectionTolerance () |
| Access the global tolerance to determine congruent spaces. More... | |
| static void | SetGlobalDefaultDirectionTolerance (double) |
| Access the global tolerance to determine congruent spaces. More... | |
| static bool | SetGlobalDefaultThreader (const std::string &threader) |
| Set/Get the default threader used for process objects. More... | |
| static std::string | GetGlobalDefaultThreader () |
| Set/Get the default threader used for process objects. More... | |
| static void | SetGlobalDefaultNumberOfThreads (unsigned int n) |
| static unsigned int | GetGlobalDefaultNumberOfThreads () |
| Set/Get the default threader used for process objects. More... | |
| Protected Member Functions inherited from itk::simple::ImageFilter | |
| void | CheckImageMatchingDimension (const Image &image1, const Image &image2, const std::string &image2Name) |
| void | CheckImageMatchingPixelType (const Image &image1, const Image &image2, const std::string &image2Name) |
| void | CheckImageMatchingSize (const Image &image1, const Image &image2, const std::string &image2Name) |
| Protected Member Functions inherited from itk::simple::ProcessObject | |
| virtual unsigned long | AddITKObserver (const itk::EventObject &, itk::Command *) |
| virtual itk::ProcessObject * | GetActiveProcess () |
| virtual void | OnActiveProcessDelete () |
| virtual void | onCommandDelete (const itk::simple::Command *cmd) noexcept |
| virtual void | PreUpdate (itk::ProcessObject *p) |
| virtual void | RemoveITKObserver (EventCommand &e) |
| Protected Member Functions inherited from itk::simple::NonCopyable | |
| NonCopyable ()=default | |
| NonCopyable (const NonCopyable &)=delete | |
| NonCopyable & | operator= (const NonCopyable &)=delete |
| Static Protected Member Functions inherited from itk::simple::ImageFilter | |
| template<class TImageType > | |
| static void | FixNonZeroIndex (TImageType *img) |
| Static Protected Member Functions inherited from itk::simple::ProcessObject | |
| template<class TImageType > | |
| static TImageType::ConstPointer | CastImageToITK (const Image &img) |
| template<class TPixelType , unsigned int VImageDimension, unsigned int VLength, template< typename, unsigned int > class TVector> | |
| static Image | CastITKToImage (itk::Image< TVector< TPixelType, VLength >, VImageDimension > *img) |
| template<class TImageType > | |
| static Image | CastITKToImage (TImageType *img) |
| static const itk::EventObject & | GetITKEventObject (EventEnum e) |
| template<typename T > | |
| static std::ostream & | ToStringHelper (std::ostream &os, const T &v) |
| static std::ostream & | ToStringHelper (std::ostream &os, const char &v) |
| static std::ostream & | ToStringHelper (std::ostream &os, const signed char &v) |
| static std::ostream & | ToStringHelper (std::ostream &os, const unsigned char &v) |
Warps an image using an input displacement field.
WarpImageFilter warps an existing image with respect to a given displacement field.
A displacement field is represented as a image whose pixel type is some vector type with at least N elements, where N is the dimension of the input image. The vector type must support element access via operator [].
The output image is produced by inverse mapping: the output pixels are mapped back onto the input image. This scheme avoids the creation of any holes and overlaps in the output image.
Each vector in the displacement field represent the distance between a geometric point in the input space and a point in the output space such that:
\[ p_{in} = p_{out} + d \]
Typically the mapped position does not correspond to an integer pixel position in the input image. Interpolation via an image function is used to compute values at non-integer positions. The default interpolation typed used is the LinearInterpolateImageFunction . The user can specify a particular interpolation function via SetInterpolator() . Note that the input interpolator must derive from base class InterpolateImageFunction .
Position mapped to outside of the input image buffer are assigned a edge padding value.
The LargetPossibleRegion for the output is inherited from the input displacement field. The output image spacing, origin and orientation may be set via SetOutputSpacing, SetOutputOrigin and SetOutputDirection. The default are respectively a vector of 1's, a vector of 0's and an identity matrix.
This class is templated over the type of the input image, the type of the output image and the type of the displacement field.
The input image is set via SetInput. The input displacement field is set via SetDisplacementField.
This filter is implemented as a multithreaded filter.
Definition at line 65 of file sitkWarpImageFilter.h.
|
private |
Setup for member function dispatching
Definition at line 159 of file sitkWarpImageFilter.h.
Define the pixels types supported by this filter
Definition at line 77 of file sitkWarpImageFilter.h.
Definition at line 67 of file sitkWarpImageFilter.h.
|
virtual |
Destructor
| itk::simple::WarpImageFilter::WarpImageFilter | ( | ) |
Default Constructor that takes no arguments and initializes default parameters
|
private |
|
private |
| Image itk::simple::WarpImageFilter::Execute | ( | const Image & | image, |
| const Image & | displacementField | ||
| ) |
Execute the filter on the input image
|
inline |
Get the edge padding value
Definition at line 139 of file sitkWarpImageFilter.h.
|
inline |
Get/Set the interpolator function.
Definition at line 89 of file sitkWarpImageFilter.h.
|
inlinevirtual |
Name of this class
Implements itk::simple::ProcessObject.
Definition at line 142 of file sitkWarpImageFilter.h.
|
inline |
Set/Get the direction (orientation) of the output image
Definition at line 129 of file sitkWarpImageFilter.h.
|
inline |
Get the output image origin.
Definition at line 109 of file sitkWarpImageFilter.h.
|
inline |
Get the size of the output image.
Definition at line 99 of file sitkWarpImageFilter.h.
|
inline |
Get the output image spacing.
Definition at line 119 of file sitkWarpImageFilter.h.
|
inline |
Set the edge padding value
Definition at line 134 of file sitkWarpImageFilter.h.
|
inline |
Get/Set the interpolator function.
Definition at line 84 of file sitkWarpImageFilter.h.
|
inline |
Set/Get the direction (orientation) of the output image
Definition at line 124 of file sitkWarpImageFilter.h.
|
inline |
Set the output image origin.
Definition at line 104 of file sitkWarpImageFilter.h.
| void itk::simple::WarpImageFilter::SetOutputParameteresFromImage | ( | const Image & | refImage | ) |
This methods sets the output size, origin, spacing and direction to that of the provided image
Set the size of the output image.
Definition at line 94 of file sitkWarpImageFilter.h.
|
inline |
Set the output image spacing.
Definition at line 114 of file sitkWarpImageFilter.h.
|
virtual |
Print ourselves out
Reimplemented from itk::simple::ProcessObject.
|
friend |
Definition at line 161 of file sitkWarpImageFilter.h.
|
friend |
Definition at line 163 of file sitkWarpImageFilter.h.
|
private |
Definition at line 166 of file sitkWarpImageFilter.h.
|
private |
Definition at line 185 of file sitkWarpImageFilter.h.
|
private |
Definition at line 171 of file sitkWarpImageFilter.h.
|
private |
Definition at line 183 of file sitkWarpImageFilter.h.
|
private |
Definition at line 177 of file sitkWarpImageFilter.h.
|
private |
Definition at line 174 of file sitkWarpImageFilter.h.
|
private |
Definition at line 180 of file sitkWarpImageFilter.h.


Welcome to the neo.mjs Real World example app!
For the best user experience, you need to use Chrome or Safari.
In this development mode, it is possible to get the real JS module code into your browser, no builds required.
The webpack based dist versions run in Firefox as well:
neo.mjs apps get a source code documentation out of the box. The other examples are not included inside this repo.
For testing, neo.mjs is using the Bryntum testing suite "Siesta" (Chrome v80+)


Riven's Gaze (v0.4.1)
Instructions & Changelog
---
the-vault (@joshhunt)
@elbisbe


Class Unicode.Category
Static class containing the various Unicode category range tables
Inheritance
Namespace: NStack
Assembly: NStack.dll
Syntax
public static class Unicode.Category
Remarks
There are static properties that can be used to fetch a specific category, or you can use the NStack.Unicode.Category.Get method this class to retrieve the RangeTable by its Unicode category table name
Properties
C
Other/C is the set of Unicode control and special characters, category C.
Declaration
public static NStack.Unicode.RangeTable C { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Cc
Cc is the set of Unicode characters in category Cc.
Declaration
public static NStack.Unicode.RangeTable Cc { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Cf
Cf is the set of Unicode characters in category Cf.
Declaration
public static NStack.Unicode.RangeTable Cf { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Co
Co is the set of Unicode characters in category Co.
Declaration
public static NStack.Unicode.RangeTable Co { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Cs
Cs is the set of Unicode characters in category Cs.
Declaration
public static NStack.Unicode.RangeTable Cs { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Digit
Digit is the set of Unicode characters with the "decimal digit" property.
Declaration
public static NStack.Unicode.RangeTable Digit { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
L
Letter/L is the set of Unicode letters, category L.
Declaration
public static NStack.Unicode.RangeTable L { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Letter
Letter/L is the set of Unicode letters, category L.
Declaration
public static NStack.Unicode.RangeTable Letter { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Ll
Ll is the set of Unicode characters in category Ll.
Declaration
public static NStack.Unicode.RangeTable Ll { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Lm
Lm is the set of Unicode characters in category Lm.
Declaration
public static NStack.Unicode.RangeTable Lm { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Lo
Lo is the set of Unicode characters in category Lo.
Declaration
public static NStack.Unicode.RangeTable Lo { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Lower
Lower is the set of Unicode lower case letters.
Declaration
public static NStack.Unicode.RangeTable Lower { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Lt
Lt is the set of Unicode characters in category Lt.
Declaration
public static NStack.Unicode.RangeTable Lt { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Lu
Lu is the set of Unicode characters in category Lu.
Declaration
public static NStack.Unicode.RangeTable Lu { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
M
Mark/M is the set of Unicode mark characters, category M.
Declaration
public static NStack.Unicode.RangeTable M { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Mark
Mark/M is the set of Unicode mark characters, category M.
Declaration
public static NStack.Unicode.RangeTable Mark { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Mc
Mc is the set of Unicode characters in category Mc.
Declaration
public static NStack.Unicode.RangeTable Mc { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Me
Me is the set of Unicode characters in category Me.
Declaration
public static NStack.Unicode.RangeTable Me { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Mn
Mn is the set of Unicode characters in category Mn.
Declaration
public static NStack.Unicode.RangeTable Mn { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
N
Number/N is the set of Unicode number characters, category N.
Declaration
public static NStack.Unicode.RangeTable N { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Nd
Nd is the set of Unicode characters in category Nd.
Declaration
public static NStack.Unicode.RangeTable Nd { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Nl
Nl is the set of Unicode characters in category Nl.
Declaration
public static NStack.Unicode.RangeTable Nl { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
No
No is the set of Unicode characters in category No.
Declaration
public static NStack.Unicode.RangeTable No { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Number
Number/N is the set of Unicode number characters, category N.
Declaration
public static NStack.Unicode.RangeTable Number { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Other
Other/C is the set of Unicode control and special characters, category C.
Declaration
public static NStack.Unicode.RangeTable Other { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
P
Punct/P is the set of Unicode punctuation characters, category P.
Declaration
public static NStack.Unicode.RangeTable P { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Pc
Pc is the set of Unicode characters in category Pc.
Declaration
public static NStack.Unicode.RangeTable Pc { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Pd
Pd is the set of Unicode characters in category Pd.
Declaration
public static NStack.Unicode.RangeTable Pd { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Pe
Pe is the set of Unicode characters in category Pe.
Declaration
public static NStack.Unicode.RangeTable Pe { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Pf
Pf is the set of Unicode characters in category Pf.
Declaration
public static NStack.Unicode.RangeTable Pf { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Pi
Pi is the set of Unicode characters in category Pi.
Declaration
public static NStack.Unicode.RangeTable Pi { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Po
Po is the set of Unicode characters in category Po.
Declaration
public static NStack.Unicode.RangeTable Po { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Ps
Ps is the set of Unicode characters in category Ps.
Declaration
public static NStack.Unicode.RangeTable Ps { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Punct
Punct/P is the set of Unicode punctuation characters, category P.
Declaration
public static NStack.Unicode.RangeTable Punct { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
S
Symbol/S is the set of Unicode symbol characters, category S.
Declaration
public static NStack.Unicode.RangeTable S { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Sc
Sc is the set of Unicode characters in category Sc.
Declaration
public static NStack.Unicode.RangeTable Sc { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Sk
Sk is the set of Unicode characters in category Sk.
Declaration
public static NStack.Unicode.RangeTable Sk { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Sm
Sm is the set of Unicode characters in category Sm.
Declaration
public static NStack.Unicode.RangeTable Sm { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
So
So is the set of Unicode characters in category So.
Declaration
public static NStack.Unicode.RangeTable So { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Space
Space/Z is the set of Unicode space characters, category Z.
Declaration
public static NStack.Unicode.RangeTable Space { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Symbol
Symbol/S is the set of Unicode symbol characters, category S.
Declaration
public static NStack.Unicode.RangeTable Symbol { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Title
Title is the set of Unicode title case letters.
Declaration
public static NStack.Unicode.RangeTable Title { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Upper
Upper is the set of Unicode upper case letters.
Declaration
public static NStack.Unicode.RangeTable Upper { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Z
Space/Z is the set of Unicode space characters, category Z.
Declaration
public static NStack.Unicode.RangeTable Z { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Zl
Zl is the set of Unicode characters in category Zl.
Declaration
public static NStack.Unicode.RangeTable Zl { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Zp
Zp is the set of Unicode characters in category Zp.
Declaration
public static NStack.Unicode.RangeTable Zp { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Zs
Zs is the set of Unicode characters in category Zs.
Declaration
public static NStack.Unicode.RangeTable Zs { get; }
Property Value
| Type | Description |
|---|---|
To be added. |
Methods
Get(String)
Retrieves the specified RangeTable from the Unicode category name
Declaration
public static NStack.Unicode.RangeTable Get (string categoryName);
Parameters
| Type | Name | Description |
|---|---|---|
| System.String | categoryName | The unicode character category name |
Returns
| Type | Description |
|---|---|
To be added. |


Distance metric descriptor, holds metric code and result. More...
#include <bmalgo_impl.h>
Public Member Functions | |
| distance_metric_descriptor (distance_metric m) | |
| distance_metric_descriptor () | |
| void | reset () |
| Sets metric result to 0. | |
Data Fields | |
| distance_metric | metric |
| bm::id_t | result |
Distance metric descriptor, holds metric code and result.
Definition at line 85 of file bmalgo_impl.h.
| bm::distance_metric_descriptor::distance_metric_descriptor | ( | distance_metric | m | ) | [inline] |
Definition at line 90 of file bmalgo_impl.h.
| bm::distance_metric_descriptor::distance_metric_descriptor | ( | ) | [inline] |
Definition at line 94 of file bmalgo_impl.h.
| void bm::distance_metric_descriptor::reset | ( | ) | [inline] |
Definition at line 87 of file bmalgo_impl.h.
Referenced by bm::combine_any_operation_with_block(), bm::combine_count_operation_with_block(), and main().
Definition at line 88 of file bmalgo_impl.h.
Referenced by bm::any_and(), bm::any_or(), bm::any_sub(), bm::any_xor(), bm::combine_any_operation_with_block(), bm::combine_count_operation_with_block(), bm::count_or(), bm::count_sub(), bm::count_xor(), bm::distance_operation_any(), and reset().


Innocentin:
I don't think your journey's over yet. Someone close to her wants to see you. He'll show you the path that leads to your next adventure.


Linked-list-table implementation.
qlisttbl container is a Linked-List-Table implementation. Which maps keys to values. Key is a string and value is any non-null object. These elements are stored sequentially in Doubly-Linked-List data structure.
Compared to Hash-Table, List-Table is efficient when you need to keep duplicated keys since Hash-Table only keep unique keys. Of course, qlisttbl supports both behavior storing unique key or allowing key duplication.
qlisttbl also provides sorting feature. It supports a table stays in sorted and also one-time sorting. When a table is set to be sorted, it can speed up it's lookup performance by skipping unnecessary table scans. This option is disabled by default so it should be explictly turned on.
[Conceptional Data Structure Diagram] last~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~+ | +-----------+ doubly +-----------+ doubly +-v---------+ first~~~|~> 0 <~|~~~~~~~~~~|~> 1 <~|~~~~~~~~~~|~> N | +--|-----|--+ linked +--|-----|--+ linked +--|-----|--+ | | | | | | +-----v-+ +-v-------+ | | +-----v-+ +-v-------+ | KEY A | | VALUE A | | | | KEY N | | VALUE N | +-------+ +---------+ | | +-------+ +---------+ +-----v-+ +-v-------+ | KEY B | | VALUE B | +-------+ +---------+
// create a list table. qlisttbl_t *tbl = qlisttbl(); tbl->setsort(tbl, true, false); // set table to be kept sorted // insert elements (key duplication allowed) tbl->put(tbl, "e1", "a", strlen("e1")+1, false); // equal to putstr(); tbl->putstr(tbl, "e2", "b", false); tbl->putstr(tbl, "e2", "c", false); tbl->putstr(tbl, "e3", "d", false); // debug output tbl->debug(tbl, stdout, true); // get element printf("get('e2') : %s\n", (char*)tbl->get(tbl, "e2", NULL, false)); printf("getstr('e2') : %s\n", tbl->getstr(tbl, "e2", false)); // get all matching elements qobj_t *objs = tbl->getmulti(tbl, "e2", true, NULL); for (i = 0; objs[i].data != NULL; i++) { printf("getmulti('e2')[%d] : %s (size=%d)\n", i, (char *)objs[i].data, (int)objs[i].size); } tbl->freemulti(objs); // find every 'e2' elements qdlnobj_t obj; memset((void*)&obj, 0, sizeof(obj)); // must be cleared before call while(tbl->getnext(tbl, &obj, "e2", false) == true) { printf("NAME=%s, DATA=%s, SIZE=%zu\n", obj.name, (char*)obj.data, obj.size); } // free object tbl->free(tbl);
Functions | |
| qlisttbl_t * | qlisttbl (void) |
| Create a new Q_LIST linked-list container. | |
| static bool | setcase (qlisttbl_t *tbl, bool insensitive) |
| qlisttbl->setcase(): Sets case sensitivity for key lookup. | |
| static int | setsort (qlisttbl_t *tbl, bool sort, bool descending) |
| qlisttbl->setsort(): Sets sort flag to keep table sorted with it's keys. | |
| static bool | setputdir (qlisttbl_t *tbl, bool before) |
| qlisttbl->setputdir(): Sets adding direction(at last of first). | |
| static bool | setgetdir (qlisttbl_t *tbl, bool first) |
| qlisttbl->setgetdir(): Sets lookup direction(backward or forward). | |
| static bool | setnextdir (qlisttbl_t *tbl, bool backward) |
| qlisttbl->setnextdir(): Sets table traversal direction(forward or backward). | |
| static bool | put (qlisttbl_t *tbl, const char *name, const void *data, size_t size, bool unique) |
| qlisttbl->put(): Put an element to this table. | |
| static bool | putstr (qlisttbl_t *tbl, const char *name, const char *str, bool unique) |
| qlisttbl->putstr(): Put a string into this table. | |
| static bool | putstrf (qlisttbl_t *tbl, bool unique, const char *name, const char *format,...) |
| qlisttbl->putstrf(): Put a formatted string into this table. | |
| static bool | putint (qlisttbl_t *tbl, const char *name, int64_t num, bool unique) |
| qlisttbl->putInt(): Put an integer into this table as string type. | |
| static void * | get (qlisttbl_t *tbl, const char *name, size_t *size, bool newmem) |
| qlisttbl->get(): Finds an object with given name. | |
| static char * | getstr (qlisttbl_t *tbl, const char *name, bool newmem) |
| qlisttbl->getstr(): Finds an object with given name and returns as string type. | |
| static int64_t | getint (qlisttbl_t *tbl, const char *name) |
| qlisttbl->getint(): Finds an object with given name and returns as integer type. | |
| static qobj_t * | getmulti (qlisttbl_t *tbl, const char *name, bool newmem, size_t *numobjs) |
| qlisttbl->getmulti(): Finds all objects with given name and return a array of objects. | |
| static void | freemulti (qobj_t *objs) |
| qlisttbl->freemulti(): Deallocate object array returned by getmulti(). | |
| static bool | getnext (qlisttbl_t *tbl, qdlnobj_t *obj, const char *name, bool newmem) |
| qlisttbl->getnext(): Get next element. | |
| static size_t | remove_ (qlisttbl_t *tbl, const char *name) |
| qlisttbl->remove(): Remove matched objects with given name. | |
| static bool | removeobj (qlisttbl_t *tbl, const qdlnobj_t *obj) |
| qlisttbl->removeobj(): Remove objects with given object pointer. | |
| static size_t | size (qlisttbl_t *tbl) |
| qlisttbl->size(): Returns the number of elements in this table. | |
| static void | sort_ (qlisttbl_t *tbl, bool descending) |
| qlisttbl->sort(): Sort keys in this table. | |
| static void | reverse (qlisttbl_t *tbl) |
| qlisttbl->reverse(): Reverse the order of elements. | |
| static void | clear (qlisttbl_t *tbl) |
| qlisttbl->clear(): Removes all of the elements from this table. | |
| static bool | save (qlisttbl_t *tbl, const char *filepath, char sepchar, bool encode) |
| qlisttbl->save(): Save qlisttbl as plain text format Dumping direction is always forward(from the top to the bottom) to preserve the order when we load the file again. | |
| static ssize_t | load (qlisttbl_t *tbl, const char *filepath, char sepchar, bool decode) |
| qlisttbl->load(): Load and append entries from given filepath Loading direction is always appending at the bottom of the table to preserve the order as it was. | |
| static bool | debug (qlisttbl_t *tbl, FILE *out) |
| qlisttbl->debug(): Print out stored elements for debugging purpose. | |
| static void | lock (qlisttbl_t *tbl) |
| qlisttbl->lock(): Enter critical section. | |
| static void | unlock (qlisttbl_t *tbl) |
| qlisttbl->unlock(): Leave critical section. | |
| static void | free_ (qlisttbl_t *tbl) |
| qlisttbl->free(): Free qlisttbl_t |
| qlisttbl_t* qlisttbl | ( | void | ) |
Create a new Q_LIST linked-list container.
| errno | will be set in error condition.
|
qlisttbl_t *tbl = qlisttbl();
| static bool setcase | ( | qlisttbl_t * | tbl, | |
| bool | insensitive | |||
| ) | [static] |
qlisttbl->setcase(): Sets case sensitivity for key lookup.
When this option is turned on, hash comparison will be disabled and each key will be compared. So lookup up speed will be relatively slower. If setsort() is on, table will be resorted to sort keys in case insensitive order.
| tbl | qlisttbl container pointer. | |
| insensitive | false for case-sensitive, true for case-insensitive. |
| static int setsort | ( | qlisttbl_t * | tbl, | |
| bool | sort, | |||
| bool | descending | |||
| ) | [static] |
qlisttbl->setsort(): Sets sort flag to keep table sorted with it's keys.
Table will be maintained in sorted manner by it's keys. New elements will be also inserted at corresponding chain, so the table will be kept in sorted order.
| tbl | qlisttbl container pointer. | |
| sort | sort flag. false(default) no sort, true keep it sorted. | |
| descending | sorting order. false for ascending, true for descending. |
| static bool setputdir | ( | qlisttbl_t * | tbl, | |
| bool | before | |||
| ) | [static] |
qlisttbl->setputdir(): Sets adding direction(at last of first).
The default direction is adding new element at the end of table.
| tbl | qlisttbl container pointer. | |
| before | direction flag. false(default) for adding at the end of this table, true for adding at the beginning of this table. |
| static bool setgetdir | ( | qlisttbl_t * | tbl, | |
| bool | first | |||
| ) | [static] |
qlisttbl->setgetdir(): Sets lookup direction(backward or forward).
The default direction is backward(from the bottom to the top), so if there are duplicated keys then later added one will be picked up first.
| tbl | qlisttbl container pointer. | |
| first | direction flag. false(default) for searching from the bottom of this table. true for searching from the top of this table. |
| static bool setnextdir | ( | qlisttbl_t * | tbl, | |
| bool | backward | |||
| ) | [static] |
qlisttbl->setnextdir(): Sets table traversal direction(forward or backward).
The default direction is forward(from the top to the bottom).
| tbl | qlisttbl container pointer. | |
| backward | direction flag. false(default) for traversal from the top of this table, true for searching from the bottom of this table. |
| static bool put | ( | qlisttbl_t * | tbl, | |
| const char * | name, | |||
| const void * | data, | |||
| size_t | size, | |||
| bool | unique | |||
| ) | [static] |
qlisttbl->put(): Put an element to this table.
Default behavior is adding an element at the end of this table unless changed by setputdir().
| tbl | qlisttbl container pointer. | |
| name | element name. | |
| data | a pointer which points data memory. | |
| size | size of the data. | |
| unique | set true to remove existing elements of same name if exists, false for adding. |
| errno | will be set in error condition.
|
struct my_obj { int a, b, c; }; // create a sample object. struct my_obj obj; // create a table and add a sample object. qlisttbl_t *tbl = qlisttbl(); tbl->put(tbl, "obj1", &obj, sizeof(struct my_obj), false);
| static bool putstr | ( | qlisttbl_t * | tbl, | |
| const char * | name, | |||
| const char * | str, | |||
| bool | unique | |||
| ) | [static] |
qlisttbl->putstr(): Put a string into this table.
| tbl | qlisttbl container pointer. | |
| name | element name. | |
| str | string data. | |
| unique | set true to remove existing elements of same name if exists, false for adding. |
| errno | will be set in error condition.
|
| static bool putstrf | ( | qlisttbl_t * | tbl, | |
| bool | unique, | |||
| const char * | name, | |||
| const char * | format, | |||
| ... | ||||
| ) | [static] |
qlisttbl->putstrf(): Put a formatted string into this table.
| tbl | qlisttbl container pointer. | |
| unique | set true to remove existing elements of same name if exists, false for adding. | |
| name | element name. | |
| format | formatted value string. |
| errno | will be set in error condition.
|
| static bool putint | ( | qlisttbl_t * | tbl, | |
| const char * | name, | |||
| int64_t | num, | |||
| bool | unique | |||
| ) | [static] |
qlisttbl->putInt(): Put an integer into this table as string type.
| tbl | qlisttbl container pointer. | |
| name | element name. | |
| num | number data. | |
| unique | set true to remove existing elements of same name if exists, false for adding. |
| errno | will be set in error condition.
|
| static void* get | ( | qlisttbl_t * | tbl, | |
| const char * | name, | |||
| size_t * | size, | |||
| bool | newmem | |||
| ) | [static] |
qlisttbl->get(): Finds an object with given name.
If there are duplicate keys in the table, this will return the first matched one from the top or bottom depending on setgetdir() setting. By default, it'll return the first matched one from the bottom of table. So in case, there are duplicated keys, it'll return the newly inserted one unless setputdir() is set in the other way.
| tbl | qlisttbl container pointer. | |
| name | element name. | |
| size | if size is not NULL, data size will be stored. | |
| newmem | whether or not to allocate memory for the data. |
| errno | will be set in error condition.
|
qlisttbl_t *tbl = qlisttbl(); (...codes...) // with newmem flag unset size_t size; void *data = tbl->get(tbl, "key_name", &size, false); // with newmem flag set size_t size; void *data = tbl->get(tbl, "key_name", &size, true); (...does something with data...) if(data != NULL) free(data);
| static char* getstr | ( | qlisttbl_t * | tbl, | |
| const char * | name, | |||
| bool | newmem | |||
| ) | [static] |
qlisttbl->getstr(): Finds an object with given name and returns as string type.
| tbl | qlisttbl container pointer. | |
| name | element name. | |
| newmem | whether or not to allocate memory for the data. |
| errno | will be set in error condition.
|
| static int64_t getint | ( | qlisttbl_t * | tbl, | |
| const char * | name | |||
| ) | [static] |
qlisttbl->getint(): Finds an object with given name and returns as integer type.
| tbl | qlisttbl container pointer. | |
| name | element name. |
| errno | will be set in error condition.
|
| static qobj_t* getmulti | ( | qlisttbl_t * | tbl, | |
| const char * | name, | |||
| bool | newmem, | |||
| size_t * | numobjs | |||
| ) | [static] |
qlisttbl->getmulti(): Finds all objects with given name and return a array of objects.
If there are duplicate keys in the table, this will return all the matched ones. The order of objects in return depends on setnextdir() setting. By default, the order is same(forward) as listed in the table.
| tbl | qlisttbl container pointer. | |
| name | element name. | |
| newmem | whether or not to allocate memory for the data. | |
| numobjs | the nuber of objects returned will be stored. (can be NULL) |
| errno | will be set in error condition.
|
size_t numobjs = 0; qobj_t *objs = tbl->getmulti(tbl, "e2", true, &numobjs); for (i = 0; objs[i].data != NULL; i++) { printf("DATA=%s, SIZE=%zu\n", i, (char *)objs[i].data, objs[i].size); } tbl->freemulti(objs);
| static void freemulti | ( | qobj_t * | objs | ) | [static] |
qlisttbl->freemulti(): Deallocate object array returned by getmulti().
| objs | pointer of array of qobj_t. |
qobj_t *objs = tbl->getmulti(tbl, "newmem is true", true, &numobjs); tbl->freemulti(objs); // frees allocated objects and object array itself. qobj_t *objs = tbl->getmulti(tbl, "even newmem is false", false, &numobjs); tbl->freemulti(objs); // frees object array itself.
| static bool getnext | ( | qlisttbl_t * | tbl, | |
| qdlnobj_t * | obj, | |||
| const char * | name, | |||
| bool | newmem | |||
| ) | [static] |
qlisttbl->getnext(): Get next element.
Default searching direction is forward, from the top to to bottom, unless it's changed by setnextdir().
| tbl | qlisttbl container pointer. | |
| obj | found data will be stored in this object | |
| name | element name., if key name is NULL search every objects in the table. | |
| newmem | whether or not to allocate memory for the data. |
| errno | will be set in error condition.
|
qlisttbl_t *tbl = qlisttbl(); (...add data into table...) // non-thread usages qdlnobj_t obj; memset((void*)&obj, 0, sizeof(obj)); // must be cleared before call while(tbl->getnext(tbl, &obj, NULL, false) == true) { printf("NAME=%s, DATA=%s, SIZE=%zu\n", obj.name, (char*)obj.data, obj.size); } // thread model with particular key search qdlnobj_t obj; memset((void*)&obj, 0, sizeof(obj)); // must be cleared before call tbl->lock(tbl); while(tbl->getnext(tbl, &obj, "key_name", true) == true) { printf("NAME=%s, DATA=%s, SIZE=%zu\n", obj.name, (char*)obj.data, obj.size); free(obj.name); free(obj.data); } tbl->unlock(tbl);
| static size_t remove_ | ( | qlisttbl_t * | tbl, | |
| const char * | name | |||
| ) | [static] |
qlisttbl->remove(): Remove matched objects with given name.
| tbl | qlisttbl container pointer. | |
| name | element name. |
| static bool removeobj | ( | qlisttbl_t * | tbl, | |
| const qdlnobj_t * | obj | |||
| ) | [static] |
qlisttbl->removeobj(): Remove objects with given object pointer.
This call is useful when you want to remove an element while traversing a table using getnext(). So the address pointed by obj maybe different than the actual object in a table, but it's ok becuase it'll recalculate actual object address by referring it's links to previous and next objects.
| tbl | qlisttbl container pointer. | |
| name | element name. |
| errno | will be set in error condition.
|
qdlnobj_t obj; memset((void*)&obj, 0, sizeof(obj)); // must be cleared before call tbl->lock(tbl); while(tbl->getnext(tbl, &obj, NULL, true) == true) { tbl->removeobj(tbl, &obj); // this will remove all entries in the table } tbl->unlock(tbl);
| static size_t size | ( | qlisttbl_t * | tbl | ) | [static] |
qlisttbl->size(): Returns the number of elements in this table.
| tbl | qlisttbl container pointer. |
| static void sort_ | ( | qlisttbl_t * | tbl, | |
| bool | descending | |||
| ) | [static] |
qlisttbl->sort(): Sort keys in this table.
| tbl | qlisttbl container pointer. | |
| descending | sorting order. false for ascending, true for descending. |
The appearence order of duplicated keys will be preserved in a sored table.
See how duplicated key 'b' is ordered in below example
[Unsorted] [sorted ASC] [sorted DES]
d = 1 a = 2 d = 1
a = 2 b = 3 c = 5
b = 3 b = 4 b = 3
b = 4 b = 6 b = 4
c = 5 c = 5 b = 6
b = 6 d = 1 a = 2
| static void reverse | ( | qlisttbl_t * | tbl | ) | [static] |
| static void clear | ( | qlisttbl_t * | tbl | ) | [static] |
qlisttbl->clear(): Removes all of the elements from this table.
| tbl | qlisttbl container pointer. |
| static bool save | ( | qlisttbl_t * | tbl, | |
| const char * | filepath, | |||
| char | sepchar, | |||
| bool | encode | |||
| ) | [static] |
qlisttbl->save(): Save qlisttbl as plain text format Dumping direction is always forward(from the top to the bottom) to preserve the order when we load the file again.
| tbl | qlisttbl container pointer. | |
| filepath | save file path | |
| sepchar | separator character between name and value. normally '=' is used. | |
| encode | flag for encoding data . false can be used if the all data are string or integer type and has no new line. otherwise true must be set. |
| static ssize_t load | ( | qlisttbl_t * | tbl, | |
| const char * | filepath, | |||
| char | sepchar, | |||
| bool | decode | |||
| ) | [static] |
qlisttbl->load(): Load and append entries from given filepath Loading direction is always appending at the bottom of the table to preserve the order as it was.
| tbl | qlisttbl container pointer. | |
| filepath | save file path | |
| sepchar | separator character between name and value. normally '=' is used | |
| decode | flag for decoding data |
| static bool debug | ( | qlisttbl_t * | tbl, | |
| FILE * | out | |||
| ) | [static] |
qlisttbl->debug(): Print out stored elements for debugging purpose.
| tbl | qlisttbl container pointer. | |
| out | output stream FILE descriptor such like stdout, stderr. |
| errno | will be set in error condition.
|
| static void lock | ( | qlisttbl_t * | tbl | ) | [static] |
qlisttbl->lock(): Enter critical section.
| tbl | qlisttbl container pointer. |
| static void unlock | ( | qlisttbl_t * | tbl | ) | [static] |
qlisttbl->unlock(): Leave critical section.
| tbl | qlisttbl container pointer. |
| static void free_ | ( | qlisttbl_t * | tbl | ) | [static] |
qlisttbl->free(): Free qlisttbl_t
| tbl | qlisttbl container pointer. |


An attribute is a number that represents something innate about a characters physicality or mental capabilities. Attributes are untrained talents. An attribute does not describe how good a character is at doing any one task, and attributes apply to a lot of tasks. Derived Attributes are secondary attributes that describe things that are innate, but not a core attribute. They are derived, because their values are derived from math applied to the regular 8 attributes.
Strength: Strength is a measure of your characters muscle and physical power and prowess. This attribute is important for any character that wishes to focus in melee combat, but also serves important roles for other characters.
Dexterity: Dexterity is the main attribute to determine the coordination and agility of characters. It is directly a measure not only of how deft the character is with their appendages, but their ability to contort themselves and their ability to move quickly.
Constitution: Constitution is the measure of your characters’ physical hardiness and stamina. Constitution directly contributes to physical resistance and to the fatigue pool.
Perception: Perception is a measure of your characters acute awareness of the surrounding area and their attention to detail.
Intelligence: Intelligence is the measure of a person’s ability to think and create sound conclusions to problems. Intelligence is also a measure of a person’s memory and is often rolled to recall specific things that wouldn’t pertain to a knowledge.
Willpower: The willpower of a character determines their mental hardiness and stamina, their determination, as well as their acute attention to themselves.
Charisma: Charisma is the measure of a characters force of personality, drive, personal magnetism, leadership capabilities and ability to press their mind onto others.
Beauty: Beauty is the measure of a characters physical attractiveness. This can mean multiple things, from the attractiveness or look of their skin and physical shape, to their smell, and even their clothes.
This is a list of derived attributes, what they are, and how they are derived.
Physical Resistance=Strength + Constitution divided by 2.
 Anything from poison, electricity, to great forces that attempt to knock you down roll against your physical resistance.
Mental Resistance=Willpower + Intelligence divided by 2.
  In addition, this is used to roll against any type of fear or mental trauma.
Damage Resistance=(Strength divided by 2) + any bonuses from
armor.
Damage resistance is your ability to slough off damage dealt directly to your body.
Creation Expertise=Dexterity + Intelligence divided by 2.
Creation expertise is your ability as a technologist, to create things that are of higher quality.
Spell Power=Willpower + Charisma divided by 2.
Spell power is a derived attribute that determines how powerful your spells are.
Speed=Dexterity + Perception divided b 2.
This is how fast your character moves, and how many times they may act in battle. Faster characters gain more actions and can move further.
Health=(Strength multiplied by 5) + 100.
 The lower the number, the closer they are to death.
Fatigue=(Constitution multiplied by 5) + 100.
Fatigue is a numerical measure of a persons energy level. As the number falls, the character becomes more and more tired, until finally falling unconscious or becoming unable to act due to exhaustion.


Home
About
Products
Services
Contact
Home
Lorem ipsum Lorem ipsumLorem ipsumLorem ipsumLorem ipsumLorem ipsumLorem ipsumLorem ipsum
Go to Services
About
Products
Services
Contact


| java.lang.Object | |
| ↳ | com.caverock.androidsvg.SVG |
AndroidSVG is a library for reading, parsing and rendering SVG documents on Android devices.
All interaction with AndroidSVG is via this class.
Typically, you will call one of the SVG loading and parsing classes then call the renderer, passing it a canvas to draw upon.
getFromX()
methods to read and parse the SVG file. They will
return an instance of this class.
renderToX()
methods to render the document.
SVG svg = SVG.getFromAsset(getContext().getAssets(), svgPath);
svg.registerExternalFileResolver(myResolver);
Bitmap newBM = Bitmap.createBitmap(width, height, Bitmap.Config.ARGB_8888);
Canvas bmcanvas = new Canvas(newBM);
bmcanvas.drawRGB(255, 255, 255); // Clear background to white
svg.renderToCanvas(bmcanvas);
For more detailed information on how to use this library, see the documentation at http://code.google.com/p/androidsvg/
| Public Methods | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
| float |
getDocumentAspectRatio()
Returns the aspect ratio of the document as a width/height fraction.
| ||||||||||
| String |
getDocumentDescription()
Returns the contents of the
<desc> element in the SVG document. | ||||||||||
| float |
getDocumentHeight()
Returns the height of the document as specified in the SVG file.
| ||||||||||
| PreserveAspectRatio |
getDocumentPreserveAspectRatio()
Return the "preserveAspectRatio" attribute of the root
<svg>
element in the form of an PreserveAspectRatio object. | ||||||||||
| String |
getDocumentSVGVersion()
Returns the SVG version number as provided in the root
<svg> tag of the document. | ||||||||||
| String |
getDocumentTitle()
Returns the contents of the
<title> element in the SVG document. | ||||||||||
| RectF |
getDocumentViewBox()
Returns the viewBox attribute of the current SVG document.
| ||||||||||
| float |
getDocumentWidth()
Returns the width of the document as specified in the SVG file.
| ||||||||||
| static SVG |
getFromAsset(AssetManager assetManager, String filename)
Read and parse an SVG from the assets folder.
| ||||||||||
| static SVG |
getFromInputStream(InputStream is)
Read and parse an SVG from the given
InputStream . | ||||||||||
| static SVG |
getFromResource(Resources resources, int resourceId)
Read and parse an SVG from the given resource location.
| ||||||||||
| static SVG |
getFromResource(Context context, int resourceId)
Read and parse an SVG from the given resource location.
| ||||||||||
| static SVG |
getFromString(String svg)
Read and parse an SVG from the given
String . | ||||||||||
| float |
getRenderDPI()
Get the current render DPI setting.
| ||||||||||
| static String |
getVersion()
Returns the version number of this library.
| ||||||||||
| Set<String> |
getViewList()
Returns a list of ids for all
<view> elements in this SVG document. | ||||||||||
| void |
registerExternalFileResolver(SVGExternalFileResolver fileResolver)
Register an
SVGExternalFileResolver instance that the renderer should use when resolving
external references such as images and fonts. | ||||||||||
| void |
renderToCanvas(Canvas canvas, RectF viewPort)
Renders this SVG document to a Canvas object.
| ||||||||||
| void |
renderToCanvas(Canvas canvas)
Renders this SVG document to a Canvas object.
| ||||||||||
| Picture |
renderToPicture(int widthInPixels, int heightInPixels)
Renders this SVG document to a Picture object.
| ||||||||||
| Picture |
renderToPicture()
Renders this SVG document to a Picture object.
| ||||||||||
| void |
renderViewToCanvas(String viewId, Canvas canvas)
Renders this SVG document to a Canvas using the specified view defined in the document.
| ||||||||||
| void |
renderViewToCanvas(String viewId, Canvas canvas, RectF viewPort)
Renders this SVG document to a Canvas using the specified view defined in the document.
| ||||||||||
| Picture |
renderViewToPicture(String viewId, int widthInPixels, int heightInPixels)
Renders this SVG document to a Picture object using the specified view defined in the document.
| ||||||||||
| void |
setDocumentHeight(float pixels)
Change the height of the document by altering the "height" attribute
of the root
<svg> element. | ||||||||||
| void |
setDocumentHeight(String value)
Change the height of the document by altering the "height" attribute
of the root
<svg> element. | ||||||||||
| void |
setDocumentPreserveAspectRatio(PreserveAspectRatio preserveAspectRatio)
Change the document positioning by altering the "preserveAspectRatio"
attribute of the root
<svg> element. | ||||||||||
| void |
setDocumentViewBox(float minX, float minY, float width, float height)
Change the document view box by altering the "viewBox" attribute
of the root
<svg> element. | ||||||||||
| void |
setDocumentWidth(float pixels)
Change the width of the document by altering the "width" attribute
of the root
<svg> element. | ||||||||||
| void |
setDocumentWidth(String value)
Change the width of the document by altering the "width" attribute
of the root
<svg> element. | ||||||||||
| void |
setRenderDPI(float dpi)
Set the DPI (dots-per-inch) value to use when rendering.
|
|
[Expand]
Inherited Methods | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
|
From class
java.lang.Object
|
Returns the aspect ratio of the document as a width/height fraction.
If the width or height of the document are listed with a physical unit such as "cm",
then the current renderDPI
setting will be used to convert that value to pixels.
If the width or height cannot be determined, -1 will be returned.
| IllegalArgumentException | if there is no current SVG document loaded. |
|---|
Returns the contents of the <desc>
element in the SVG document.
| IllegalArgumentException | if there is no current SVG document loaded. |
|---|
Returns the height of the document as specified in the SVG file.
If the height in the document is specified in pixels, that value will be returned.
If the value is listed with a physical unit such as "cm", then the current
RenderDPI
value will be used to convert that value to pixels. If the height
is missing, or in a form which can't be converted to pixels, such as "100%" for
example, -1 will be returned.
| IllegalArgumentException | if there is no current SVG document loaded. |
|---|
Return the "preserveAspectRatio" attribute of the root <svg>
element in the form of an PreserveAspectRatio
object.
<svg>
element.| IllegalArgumentException | if there is no current SVG document loaded. |
|---|
Returns the SVG version number as provided in the root <svg>
tag of the document.
| IllegalArgumentException | if there is no current SVG document loaded. |
|---|
Returns the contents of the <title>
element in the SVG document.
| IllegalArgumentException | if there is no current SVG document loaded. |
|---|
Returns the viewBox attribute of the current SVG document.
android.graphics.RectF
object, or null if not set.| IllegalArgumentException | if there is no current SVG document loaded. |
|---|
Returns the width of the document as specified in the SVG file.
If the width in the document is specified in pixels, that value will be returned.
If the value is listed with a physical unit such as "cm", then the current
RenderDPI
value will be used to convert that value to pixels. If the width
is missing, or in a form which can't be converted to pixels, such as "100%" for
example, -1 will be returned.
| IllegalArgumentException | if there is no current SVG document loaded. |
|---|
Read and parse an SVG from the assets folder.
| assetManager | the AssetManager instance to use when reading the file. |
|---|---|
| filename | the filename of the SVG document within assets. |
| SVGParseException | if there is an error parsing the document. |
|---|---|
| IOException | if there is some IO error while reading the file. |
Read and parse an SVG from the given InputStream
.
| is | the input stream from which to read the file. |
|---|
| SVGParseException | if there is an error parsing the document. |
|---|
Read and parse an SVG from the given resource location.
| resources | the set of Resources in which to locate the file. |
|---|---|
| resourceId | the resource identifier of the SVG document. |
| SVGParseException | if there is an error parsing the document. |
|---|
Read and parse an SVG from the given resource location.
| context | the Android context of the resource. |
|---|---|
| resourceId | the resource identifier of the SVG document. |
| SVGParseException | if there is an error parsing the document. |
|---|
Read and parse an SVG from the given String
.
| svg | the String instance containing the SVG document. |
|---|
| SVGParseException | if there is an error parsing the document. |
|---|
Get the current render DPI setting.
Returns the version number of this library.
Returns a list of ids for all <view>
elements in this SVG document.
The returned view ids could be used when calling and of the renderViewToX()
methods.
| IllegalArgumentException | if there is no current SVG document loaded. |
|---|
Register an SVGExternalFileResolver
instance that the renderer should use when resolving
external references such as images and fonts.
| fileResolver | the resolver to use. |
|---|
Renders this SVG document to a Canvas object.
| canvas | the canvas to which the document should be rendered. |
|---|---|
| viewPort | the bounds of the area on the canvas you want the SVG rendered, or null for the whole canvas. |
Renders this SVG document to a Canvas object. The full width and height of the canvas will be used as the viewport into which the document will be rendered.
| canvas | the canvas to which the document should be rendered. |
|---|
Renders this SVG document to a Picture object.
| widthInPixels | the width of the initial viewport |
|---|---|
| heightInPixels | the height of the initial viewport |
Canvas.darwPicture()
Renders this SVG document to a Picture object.
An attempt will be made to determine a suitable initial viewport from the contents of the SVG file. If an appropriate viewport can't be determined, a default viewport of 512x512 will be used.
Canvas.drawPicture()
Renders this SVG document to a Canvas using the specified view defined in the document.
A View is an special element in a SVG documents that describes a rectangular area in the document.
Calling this method with a viewId
will result in the specified view being positioned and scaled
to the viewport. In other words, use renderToPicture()
to render the whole document, or use this
method instead to render just a part of it.
If the <view>
could not be found, nothing will be drawn.
| viewId | the id of a view element in the document that defines which section of the document is to be visible. |
|---|---|
| canvas | the canvas to which the document should be rendered. |
Renders this SVG document to a Canvas using the specified view defined in the document.
A View is an special element in a SVG documents that describes a rectangular area in the document.
Calling this method with a viewId
will result in the specified view being positioned and scaled
to the viewport. In other words, use renderToPicture()
to render the whole document, or use this
method instead to render just a part of it.
If the <view>
could not be found, nothing will be drawn.
| viewId | the id of a view element in the document that defines which section of the document is to be visible. |
|---|---|
| canvas | the canvas to which the document should be rendered. |
| viewPort | the bounds of the area on the canvas you want the SVG rendered, or null for the whole canvas. |
Renders this SVG document to a Picture object using the specified view defined in the document.
A View is an special element in a SVG document that describes a rectangular area in the document.
Calling this method with a viewId
will result in the specified view being positioned and scaled
to the viewport. In other words, use renderToPicture()
to render the whole document, or use this
method instead to render just a part of it.
| viewId | the id of a view element in the document that defines which section of the document is to be visible. |
|---|---|
| widthInPixels | the width of the initial viewport |
| heightInPixels | the height of the initial viewport |
Canvas.drawPicture()
, or null if the viewId was not found.
Change the height of the document by altering the "height" attribute
of the root <svg>
element.
| pixels | The new value of height in pixels. |
|---|
| IllegalArgumentException | if there is no current SVG document loaded. |
|---|
Change the height of the document by altering the "height" attribute
of the root <svg>
element.
| value | A valid SVG 'length' attribute, such as "100px" or "10cm". |
|---|
| SVGParseException | if value cannot be parsed successfully. |
|---|---|
| IllegalArgumentException | if there is no current SVG document loaded. |
Change the document positioning by altering the "preserveAspectRatio"
attribute of the root <svg>
element. See the
documentation for PreserveAspectRatio
for more information
on how positioning works.
| preserveAspectRatio | the new preserveAspectRatio setting for the root <svg> element. |
|---|
| IllegalArgumentException | if there is no current SVG document loaded. |
|---|
Change the document view box by altering the "viewBox" attribute
of the root <svg>
element.
The viewBox generally describes the bounding box dimensions of the document contents. A valid viewBox is necessary if you want the document scaled to fit the canvas or viewport the document is to be rendered into.
By setting a viewBox that describes only a portion of the document, you can reproduce the effect of image sprites.
| minX | the left coordinate of the viewBox in pixels |
|---|---|
| minY | the top coordinate of the viewBox in pixels. |
| width | the width of the viewBox in pixels |
| height | the height of the viewBox in pixels |
| IllegalArgumentException | if there is no current SVG document loaded. |
|---|
Change the width of the document by altering the "width" attribute
of the root <svg>
element.
| pixels | The new value of width in pixels. |
|---|
| IllegalArgumentException | if there is no current SVG document loaded. |
|---|
Change the width of the document by altering the "width" attribute
of the root <svg>
element.
| value | A valid SVG 'length' attribute, such as "100px" or "10cm". |
|---|
| SVGParseException | if value cannot be parsed successfully. |
|---|---|
| IllegalArgumentException | if there is no current SVG document loaded. |
Set the DPI (dots-per-inch) value to use when rendering. The DPI setting is used in the conversion of "physical" units - such an "pt" or "cm" - to pixel values. The default DPI is 96.
You should not normally need to alter the DPI from the default of 96 as recommended by the SVG and CSS specifications.
| dpi | the DPI value that the renderer should use. |
|---|


Documentation
Time tracker
To start tracking, select your current work item from the issues list. The timer will start automatically and continue to run while the time tracker is open in your browser.
To stop tracking, select None as the current work item.
Issue logger
To log your time worked, find your work item in the Recent Work Items table and press Log. Follow the onscreen prompts. A comment will be added to the project issue showing the time worked.
You can also delete a work item without logging a comment on the project issue. Select Delete and follow the onscreen prompts.


OpenEnergyMonitor is copyright © 2009,2010,2011,2012,2013,2014,2015,2016 the OpenEnergyMonitor researchers (see developers), and other contributors.
Principal author:
Trystan Lea
Ogoronwy, Llanfrothen, Gwynedd, North Wales, UK, LL48 6DJ
OpenEnergyMonitor is free; 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.
OpenEnergyMonitor 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.
For this purpose the words "software" and "library" in the GNU General Public License are taken to mean any and all computer programs computer files images data results documents and all other copyright information available from the OpenEnergyMonitor project.
You can read the GNU General Public License here. This page you are reading now introduces the license for the entire OpenEnergyMonitor project; that license applies to all of it; if the links to the license do not work, write to the Free Software Foundation, Inc., 51 Franklin Street, 5th Floor, Boston, MA 02110 , or see
http://www.gnu.org/copyleft/gpl.html
Hardware designs (schematics and CAD) files are licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License and follow the terms of the OSHW (Open-source hardware) Statement of Principles 1.0.
All documentation on OpenEnergyMonitor is subject to GNU Free Documentation License
Overview of open-source licenses by Adafruit http://www.adafruit.com/blog/2009/03/28/open-source-hardware-overview-slides/